make_create();\",\n \"public static Writer writerCreator(String iFile, String config) throws IOException\\n\\t{\\n\\t\\tWriter writer = new BufferedWriter(\\n\\t\\t\\t\\tnew OutputStreamWriter(new FileOutputStream(iFile), UTF8));\\n\\t\\twriter.write(config);\\n\\t\\treturn writer;\\n\\t}\",\n \"private ServerSocket createServerSocket() throws IOException {\\n ServerSocket serverSocket = new ServerSocket(Constants.SERVER_PORT);\\n System.out.printf(\\\"Server for chatting started at %d\\\\n\\\", Constants.SERVER_PORT);\\n return serverSocket;\\n }\",\n \"public Writer getWriter(String cliParameter) {\\n Writer writer = null;\\n if(\\\"csv\\\".equals(cliParameter)){\\n writer = new WriterCSV();\\n }\\n \\n return writer;\\n }\",\n \"public JsonGenerator createGenerator(Writer w)\\n/* */ throws IOException\\n/* */ {\\n/* 1129 */ IOContext ctxt = _createContext(w, false);\\n/* 1130 */ return _createGenerator(_decorate(w, ctxt), ctxt);\\n/* */ }\",\n \"public interface ConsolePrinter {\\r\\n\\r\\n\\t/**\\r\\n\\t * Prints given text line to console.\\r\\n\\t * \\r\\n\\t * @param line\\r\\n\\t * text to print.\\r\\n\\t */\\r\\n\\tvoid println(String line);\\r\\n\\r\\n\\t/**\\r\\n\\t * Prints given (formatted) string to current server console.<br>\\r\\n\\t * <i>Note: This method neither throws an exception nor prints anything if a\\r\\n\\t * command line is available but no server console running. Use\\r\\n\\t * {@link EduLog} for that.</i>\\r\\n\\t * \\r\\n\\t * @see Formatter\\r\\n\\t * \\r\\n\\t * @param line\\r\\n\\t * A (format) string that should be printed.\\r\\n\\t * \\r\\n\\t * @param args\\r\\n\\t * Format arguments.\\r\\n\\t * \\r\\n\\t * @throws IllegalFormatException\\r\\n\\t * If a format string contains an illegal syntax, a format\\r\\n\\t * specifier that is incompatible with the given arguments,\\r\\n\\t * insufficient arguments given the format string, or other\\r\\n\\t * illegal conditions. For specification of all possible\\r\\n\\t * formatting errors, see the detail section of\\r\\n\\t * {@link Formatter} class specification.\\r\\n\\t */\\r\\n\\tvoid printlnf(String line, Object... args);\\r\\n\\r\\n}\",\n \"public KVServerInstance createServerInstance(KVCommunicationModule com, KVServer master){\\n KVServerInstance newInstance = new KVServerInstance(com,master);\\n newInstance.changeLogLevel(kv_out.getOutputLevel(),kv_out.getLogLevel());\\n return newInstance;\\n }\",\n \"Writer run(Writer writer, List<Object> scopes);\",\n \"public static JSONWriter getInstance(){\\n\\t\\treturn new JSONWriter();\\n\\t}\",\n \"protected void appendSuiteCreatorCommand(StringBuffer buffer, String bootstrapSuitePath) {\\n buffer.append(getSquawkExecutable());\\n if (verbose) {\\n buffer.append(\\\" -verbose\\\");\\n }\\n// buffer.append(\\\" -J-Xdebug -J-Xrunjdwp:transport=dt_socket,server=y,suspend=n,address=9999\\\");\\n buffer.append(\\\" -J-Djava.awt.headless=true\\\");\\n// buffer.append(\\\" -veryverbose\\\");\\n if (bootstrapSuitePath != null) {\\n buffer.append(\\\" -Xboot:\\\");\\n buffer.append(bootstrapSuitePath);\\n }\\n if (suiteCreatorDebug) {\\n buffer.append(\\\" com.sun.squawk.debugger.sda.SDA\\\");\\n }\\n buffer.append(\\\" com.sun.squawk.SuiteCreator\\\");\\n }\",\n \"void create(T instance) throws IOException;\",\n \"public static JsonWriter newWriter(Writer writer) {\\n if (provider == JsonProvider.UNKNOWN) {\\n init();\\n }\\n return provider.newWriter(writer);\\n }\",\n \"public static OutputQueue createOutputThread() {\\n\\tfinal OutputQueue queue = new OutputQueue();\\n\\tThread t = new Thread() {\\n\\t public void run() {\\n\\t\\tUtterance utterance = null;\\n\\t\\tdo {\\n\\t\\t utterance = queue.pend();\\n\\t\\t if (utterance != null) {\\n\\t\\t\\tVoice voice = utterance.getVoice();\\n\\t\\t\\tvoice.log(\\\"OUT: \\\" + utterance.getString(\\\"input_text\\\"));\\n voice.outputUtterance(utterance, voice.threadTimer);\\n\\t\\t }\\n\\t\\t} while (utterance != null);\\n\\t }\\n\\t};\\n\\tt.setDaemon(true);\\n\\tt.start();\\n\\treturn queue;\\n }\",\n \"Contender createContender();\",\n \"public static void main(String[] args) {\\n \\tWelcome console = null;\\n\\t\\ttry {\\n\\t\\t\\t//console = new Welcome(conn);\\n\\t\\t\\tconsole = new Welcome();\\n\\t\\t} catch (Exception e) {\\n\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n \\tconsole.start();\\n }\",\n \"private void initializeConsole() {\\n\\t\\tthis.hydraConsole = new HydraConsole(this.stage, this.commands);\\n\\t\\tthis.splitPane.setBottomComponent(this.hydraConsole);\\n\\t}\",\n \"private ConsoleUtils(String name) {\\n instance = this;\\n fConsole = new IOConsole(\\\"Mobius\\\" + name + \\\" Console\\\", EImages.TOOL.getDescriptor());\\n fConsole.activate();\\n ConsolePlugin.getDefault().getConsoleManager().addConsoles(new IConsole[]{fConsole});\\n final Display display = PlatformUI.getWorkbench().getDisplay();\\n fRed = new Color(display, RED);\\n fBlue = new Color(display, BLUE);\\n fPurple = new Color(display, PURPLE);\\n fBlack = new Color(display, BLACK);\\n }\",\n \"private void crearFlujos() throws IOException {\\n salidaDecorada = new PrintStream(socket.getOutputStream());\\n entradaDecorada = new Scanner(socket.getInputStream());\\n }\",\n \"private JTextArea getConsole() {\\r\\n\\t\\tif (console == null) {\\r\\n\\t\\t\\tconsole = new JTextArea();\\r\\n\\t\\t}\\r\\n\\t\\treturn console;\\r\\n\\t}\",\n \"@RequestMapping(value = \\\"/console\\\", method = RequestMethod.POST)\\n public ResponseEntity<Consoles> create(@RequestBody @Valid @NotNull Consoles consoles) {\\n consoles.setConsolesId(UUID.randomUUID().toString());\\n consolesService.saveConsoles(consoles);\\n return ResponseEntity.ok().body(consoles);\\n }\",\n \"public StdOutWriter ()\\n {\\n super (System.out, true);\\n }\",\n \"public CreateConsole pretty(String pretty) {\\n put(\\\"pretty\\\", pretty);\\n return this;\\n }\",\n \"public abstract JsonWriter newWriter(Writer writer);\",\n \"private void initWriter(int queueSize) {\\n\\t\\tthis.writer = new RoutingWriter(this.myName, this.remoteName, new Writer(\\n\\t\\t\\t\\tthis.dos, queueSize, true));\\n\\t\\tthis.writer.start();\\n\\t}\",\n \"Process createProcess();\",\n \"abstract ManagedChannel createChannel(List<ServerInfo> servers);\",\n \"@Override\\n\\tpublic IOProcessor create(Interpreter interpreter) {\\n\\t\\tTestCustomIOProc ioProc = new TestCustomIOProc();\\n\\t\\tioProc.interpreter = interpreter;\\n\\t\\tioProc.swigReleaseOwnership();\\n\\t\\treturn ioProc;\\n\\t}\",\n \"Port createPort();\",\n \"Port createPort();\",\n \"default ServerTextChannelUpdater createUpdater() {\\n return new ServerTextChannelUpdater(this);\\n }\",\n \"public static RoMServer createServer() throws IOException, Exception {\\r\\n \\t\\t// Ip and Port out of config\\r\\n \\t\\tIConfig cfg = ConfigurationFactory.getConfig();\\r\\n \\r\\n \\t\\treturn RoMServer.createServer(cfg.getIp(), cfg.getPort());\\r\\n \\t}\",\n \"public JPanel buildConsole()\\n\\t{\\n\\t\\tJPanel output = new JPanel(new BorderLayout());\\n\\t\\tString hold = \\\"\\\";\\n\\t\\t\\n output.setBorder (new TitledBorder(new EtchedBorder(),\\\"Console\\\")); //Create the border\\n output.setPreferredSize(new Dimension(50,150)); //Set the size of the JPanel\\n console.insert(hold,0);\\n console.setLineWrap(true);\\n console.setWrapStyleWord(true);\\n console.setEditable(false); //Does not allow the user to edit the output\\n JScrollPane Cscroll = new JScrollPane (console); //Create a JScrollPane object\\n Cscroll.setVerticalScrollBarPolicy ( ScrollPaneConstants.VERTICAL_SCROLLBAR_AS_NEEDED ); //Set the scroll bars to appear when necessary\\n output.add(Cscroll); //Add the scroll to the JPanel\\n textField = new JTextField();\\n output.add(BorderLayout.PAGE_END, textField);\\n \\n\\t\\treturn output;\\n\\t}\",\n \"DynamicPort createDynamicPort();\",\n \"public WriteToClient(Socket c) throws IOException { //initialize printwirte and scanner\\r\\n\\t\\ttoClient = new PrintWriter(c.getOutputStream());\\r\\n\\t\\tstdin = new Scanner(System.in);\\r\\n\\t}\",\n \"private Command createPushCommand() {\\n\\t\\treturn new PushCommand();\\n\\t}\",\n \"public ResourceBroker(ServerHandlerManager shm,\\n\\t\\t\\tAdminServer admin,\\n\\t\\t\\tAdminWriter writer) \\n {\\n super();\\n Hashtable defs = new Hashtable(3);\\n defs.put(\\\"identifier\\\", \\\"broker-frame\\\");\\n registerFrame( new BrokerFrame(shm, admin, writer), defs);\\n }\",\n \"private PrintWriter createOutputFile(String outputFile) throws IOException {\\n return new PrintWriter(new BufferedWriter(new FileWriter(outputFile)));\\n }\",\n \"public static void setup() {\\n\\t\\toutputs.add(new Console.stdout());\\n\\t}\",\n \"protected Device createOutputDevice(HttpServletRequest request,\\n HttpServletResponse response,\\n ExternalizedResource extInfo) \\n throws IOException {\\n return new ServletDevice(response.getOutputStream());\\n }\",\n \"public void setConsole(Console c) {\\n con = c;\\n console = true;\\n }\",\n \"public ServerConsole(String uID, String host, String password, int port){\\n\\t\\ttry{\\n\\t\\t\\tclient= new ChatClient(uID, host, password, port, this);\\n\\t\\t} \\n\\t\\tcatch(IOException exception){\\n\\t\\t\\tSystem.out.println(\\\"Error: Can't setup connection!\\\" + \\\" Terminating client.\\\");\\t\\n\\t\\t\\tSystem.exit(1);\\n\\t\\t}\\n\\t}\",\n \"private void writeToConsole(IOConsoleOutputStream stream, String output){\\n try {\\n stream.write(output);\\n } catch (IOException e) {\\n OPIBuilderPlugin.getLogger().log(Level.WARNING, \\\"Write Console error\\\",e); //$NON-NLS-1$\\n }\\n }\",\n \"@Override\\n public Writer getOutputStreamWriter() throws IOException {\\n return new OutputStreamWriter(getOutputStream());\\n }\",\n \"public static Writer wrapWriter(StyledPrintWriter w) {\\n return new WrappedWriter(w);\\n }\",\n \"private PrintWriter\\n\\tgetStreamWriter(\\n\\t\\tOutputStream\\toutputStream)\\n\\t{\\n\\t\\treturn(new PrintWriter(outputStream, true));\\n\\t}\",\n \"default Writer execute(Writer writer, Object scope) {\\n return execute(writer, makeList(scope));\\n }\",\n \"public ServerWriter(ServerConnection connection) {\\n super(connection);\\n }\",\n \"Subprocess createSubprocess();\",\n \"private BufferedWriter createWriter(String filePath, String fileName)\\r\\n\\t\\t\\tthrows IOException {\\r\\n\\t\\tString fullPath = filePath + \\\"/\\\" + fileName;\\r\\n\\t\\tFile file = new File(fullPath);\\r\\n\\t\\tboolean exists = new File(filePath).exists();\\r\\n\\t\\tif (!exists) {\\r\\n\\t\\t\\tfile.mkdir();\\r\\n\\t\\t}\\r\\n\\t\\tFileWriter writer = new FileWriter(file);\\r\\n\\t\\tBufferedWriter bufferWriter = new BufferedWriter(writer);\\r\\n\\r\\n\\t\\treturn bufferWriter;\\r\\n\\t}\",\n \"public void instantiateCommand() throws SystemException {\\r\\n\\t\\t// Check the definitation.\\r\\n\\t\\tdefinitionCheck();\\r\\n\\t\\t\\r\\n\\t\\t// Create the fresh instance.\\r\\n\\t\\tcommandInstance = new ReadWriteableAttributes();\\r\\n\\t}\",\n \"public AbstractInvoker(Console console) {\\n\\t\\tthis.console = console;\\n\\t}\",\n \"public Cli (BufferedReader in,PrintWriter out , Controller thecontroller) {\\r\\n\\t\\tsuper(thecontroller);\\r\\n\\t\\tthis.in=in;\\r\\n\\t\\tthis.out=out;\\r\\n\\t\\tthis.commandsSet= controller.getCommandSet();\\r\\n\\t}\",\n \"public static XMLStringWriter create() {\\r\\n return new XMLStringWriter(new StringWriter());\\r\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.567867","0.5450029","0.54417866","0.52625364","0.525718","0.52485496","0.51781327","0.5171072","0.5167998","0.514637","0.51183426","0.51164347","0.50651383","0.5045914","0.50295967","0.50021845","0.4972306","0.49389556","0.4936409","0.49284518","0.48786974","0.4873728","0.4871558","0.48702386","0.4857459","0.48173717","0.4809427","0.48082364","0.47957706","0.4792136","0.47515076","0.4749112","0.47487926","0.47201264","0.47186473","0.4697516","0.46887243","0.46878457","0.46755627","0.4666798","0.4655882","0.46520185","0.46244165","0.46117404","0.4589904","0.45799863","0.45704278","0.4568889","0.45682803","0.4561579","0.45598197","0.45439926","0.45421082","0.45364326","0.4520775","0.45145068","0.45109156","0.45104644","0.45033938","0.449926","0.4497281","0.44917467","0.44904485","0.44860977","0.4479123","0.44751406","0.44640398","0.4459578","0.44545504","0.44542617","0.4452475","0.44399208","0.44370264","0.44208837","0.44189814","0.44189814","0.44158527","0.44138926","0.44134414","0.44118562","0.4411287","0.44098404","0.44095227","0.4405288","0.43974903","0.43923315","0.439143","0.4388762","0.43860853","0.43816146","0.4379084","0.43771988","0.43753278","0.43724006","0.43708432","0.43690613","0.43655962","0.4362158","0.43598995","0.43571976"],"string":"[\n \"0.567867\",\n \"0.5450029\",\n \"0.54417866\",\n \"0.52625364\",\n \"0.525718\",\n \"0.52485496\",\n \"0.51781327\",\n \"0.5171072\",\n \"0.5167998\",\n \"0.514637\",\n \"0.51183426\",\n \"0.51164347\",\n \"0.50651383\",\n \"0.5045914\",\n \"0.50295967\",\n \"0.50021845\",\n \"0.4972306\",\n \"0.49389556\",\n \"0.4936409\",\n \"0.49284518\",\n \"0.48786974\",\n \"0.4873728\",\n \"0.4871558\",\n \"0.48702386\",\n \"0.4857459\",\n \"0.48173717\",\n \"0.4809427\",\n \"0.48082364\",\n \"0.47957706\",\n \"0.4792136\",\n \"0.47515076\",\n \"0.4749112\",\n \"0.47487926\",\n \"0.47201264\",\n \"0.47186473\",\n \"0.4697516\",\n \"0.46887243\",\n \"0.46878457\",\n \"0.46755627\",\n \"0.4666798\",\n \"0.4655882\",\n \"0.46520185\",\n \"0.46244165\",\n \"0.46117404\",\n \"0.4589904\",\n \"0.45799863\",\n \"0.45704278\",\n \"0.4568889\",\n \"0.45682803\",\n \"0.4561579\",\n \"0.45598197\",\n \"0.45439926\",\n \"0.45421082\",\n \"0.45364326\",\n \"0.4520775\",\n \"0.45145068\",\n \"0.45109156\",\n \"0.45104644\",\n \"0.45033938\",\n \"0.449926\",\n \"0.4497281\",\n \"0.44917467\",\n \"0.44904485\",\n \"0.44860977\",\n \"0.4479123\",\n \"0.44751406\",\n \"0.44640398\",\n \"0.4459578\",\n \"0.44545504\",\n \"0.44542617\",\n \"0.4452475\",\n \"0.44399208\",\n \"0.44370264\",\n \"0.44208837\",\n \"0.44189814\",\n \"0.44189814\",\n \"0.44158527\",\n \"0.44138926\",\n \"0.44134414\",\n \"0.44118562\",\n \"0.4411287\",\n \"0.44098404\",\n \"0.44095227\",\n \"0.4405288\",\n \"0.43974903\",\n \"0.43923315\",\n \"0.439143\",\n \"0.4388762\",\n \"0.43860853\",\n \"0.43816146\",\n \"0.4379084\",\n \"0.43771988\",\n \"0.43753278\",\n \"0.43724006\",\n \"0.43708432\",\n \"0.43690613\",\n \"0.43655962\",\n \"0.4362158\",\n \"0.43598995\",\n \"0.43571976\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.70811266"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":29382,"cells":{"query":{"kind":"string","value":"Writes a portion of an array of characters."},"document":{"kind":"string","value":"@Override\n public void write(char[] cbuf, int off, int len) throws IOException\n {\n builder.append(cbuf, off, len);\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["void writeChars(char[] c, int off, int len) throws IOException;","public void write(char[] charArray, int offset, int length) throws IOException{\r\n if(closed){\r\n throw new IOException(\"The stream is not open.\");\r\n }\r\n getBuffer().append(charArray, offset, length);\r\n }","public void write(char[] charArray) throws IOException{\r\n write(charArray, 0, charArray.length);\r\n }","public void write(char cbuf[], int off, int len) throws IOException {\n ensureOpen();\n if ((off < 0) || (off > cbuf.length) || (len < 0) ||\n ((off + len) > cbuf.length) || ((off + len) < 0)) {\n throw new IndexOutOfBoundsException();\n } else if (len == 0) {\n return;\n }\n out.write(cbuf, off, len);\n }","public void write(String[] buf, int offset, int size) throws IOException;","void write (char ch, int offset);","void writeChars(String s) throws IOException;","public void write(char[] cArr) throws XMLStreamException {\n try {\n this.writer.write(cArr);\n } catch (IOException e) {\n throw new XMLStreamException((Throwable) e);\n }\n }","public void write(char[] buffer, int offset, int length) {\n final String text = new String(buffer, offset, length);\n //Java 8\n //SwingUtilities.invokeLater(()->{try{pane.getDocument().insertString(pane.getDocument().getLength(), text, properties);}catch(Exception e){}});\n\n //Java 7\n SwingUtilities.invokeLater(new Runnable() {\n public void run() {\n try{pane.getDocument().insertString(pane.getDocument().getLength(), text, properties);}\n catch(Exception e){}\n }\n });\n }","public void write(String[] buf) throws IOException;","public abstract void drawChars(char data[], int offset, int length, int x, int y);","@Override\n public void characters(char ch[], int start, int length) {\n\n }","@Override\r\n public void write(char[] cbuf, int off, int len) throws IOException {\r\n\r\n IOException ioException = null;\r\n for (WriterInfo writerInfo : mWriters) {\r\n try {\r\n writerInfo.getWriter().write(cbuf, off, len);\r\n } catch(IOException ioex) {\r\n ioException = ioex;\r\n }\r\n }\r\n if (ioException != null) {\r\n throw ioException;\r\n }\r\n\r\n }","@Override\n\tpublic void characters(char ch[], int start, int length) {\n\t\tchars.append(new String(ch, start, length));\n\t}","private static void writer(String filename, char[] chars) {\n BinaryOut binaryOut = new BinaryOut(filename);\n\n for (char c : chars) {\n binaryOut.write(c);\n }\n\n binaryOut.close();\n }","@Override \n\t public void characters(char ch[], int start, int length) { \n\t\t \n\t }","public synchronized void write(final byte[] cbuf, final int off, final int len) throws IOException {\n\t\tif (len < 0) {\n\t\t\tthrow new IllegalArgumentException();\n\t\t}\n\t\tif (off < 0) {\n\t\t\tthrow new IndexOutOfBoundsException();\n\t\t}\n\t\tif (cbuf == null) {\n\t\t\tthrow new NullPointerException();\n\t\t}\n\t\tif ((len + off) > cbuf.length) {\n\t\t\tthrow new IndexOutOfBoundsException();\n\t\t}\n\n\t\tensureSize(cursor + len);\n\n\t\tSystem.arraycopy(cbuf, off, this.buffer, cursor, len);\n\t\tcursor += len;\n\t}","public void write(byte b[], int off, int len) throws IOException;","void write (String s, int offset);","void write(byte[] buffer, int bufferOffset, int length) throws IOException;","public void write(char[] b, int off, int len) throws IOException {\n\t\t\tif (!initialized) {\n\t\t\t\tarea.setText(\"\");\n\t\t\t\tinitialized = true;\n\t\t\t}\n\t\t\tString str = new String(b, off, len);\n\t\t\tStringBuffer sb = new StringBuffer(len);\n\t\t\twhile (str != null && str.length() > 0) {\n\t\t\t\tif (lastCR && str.charAt(0) == '\\n')\n\t\t\t\t\tstr = str.substring(1);\n\t\t\t\tint crIndex = str.indexOf('\\r');\n\t\t\t\tif (crIndex >= 0) {\n\t\t\t\t\tsb.append(str.substring(0, crIndex));\n\t\t\t\t\tsb.append(\"\\n\");\n\t\t\t\t\tstr = str.substring(crIndex + 1);\n\t\t\t\t\tlastCR = true;\n\t\t\t\t} else {\n\t\t\t\t\tsb.append(str);\n\t\t\t\t\tstr = null;\n\t\t\t\t}\n\t\t\t}\n\t\t\tarea.append(sb.toString());\n\t\t}","@Override\n void characters(char[] ch, int start, int length);","public void writeText(char[] text, int off, int len) throws IOException {\r\n deNude();\r\n writerEscape.writeText(text, off, len);\r\n }","public synchronized void write(byte b[], int off, int len) {\n \tif ((off < 0) || (off > b.length) || (len < 0) ||\n \t\t\t((off + len) > b.length) || ((off + len) < 0)) {\n \t\tthrow new IndexOutOfBoundsException();\n \t} else if (len == 0) {\n \t\treturn;\n \t}\n \tif (enableClip) {\n \t\tdoClipWrite(b, off, len);\n \t} else {\n \t\twriteDirectly(b, off, len);\n \t}\n \t\n }","public void write(byte[] data, long offset);","public void write( byte[] array, int firstIndex,\n\t\t\tint count );","public void characters (char ch[], int start, int length)\n\t\t{\n//\t\t\tfor (int i = start; i < start + length; i++) \n//\t\t\t\tSystem.out.print(ch[i]);\n//\t\t\tSystem.out.println();\n\t\t}","public void write(char c){\n\t\tbuffer[bufferPos++] = c;\n\n\t\tif(bufferPos == limit) flush();\n\t}","public void characters( char[] buf, int offset, int len ) {\r\n\r\n // Append the new characters\r\n currentString.append( new String( buf, offset, len ) );\r\n }","public void printToClient(char[] charArray) {\n for (int i = 0; i < charArray.length; i++) {\n out.print(charArray[i] + \" \");\n }\n out.println();\n }","private void _writeString(char[] text, int offset, int len)\n/* */ throws IOException\n/* */ {\n/* 1049 */ if (this._characterEscapes != null) {\n/* 1050 */ _writeStringCustom(text, offset, len);\n/* 1051 */ return;\n/* */ }\n/* 1053 */ if (this._maximumNonEscapedChar != 0) {\n/* 1054 */ _writeStringASCII(text, offset, len, this._maximumNonEscapedChar);\n/* 1055 */ return;\n/* */ }\n/* */ \n/* */ \n/* */ \n/* */ \n/* */ \n/* 1062 */ len += offset;\n/* 1063 */ int[] escCodes = this._outputEscapes;\n/* 1064 */ int escLen = escCodes.length;\n/* 1065 */ while (offset < len) {\n/* 1066 */ int start = offset;\n/* */ for (;;)\n/* */ {\n/* 1069 */ char c = text[offset];\n/* 1070 */ if ((c < escLen) && (escCodes[c] != 0)) {\n/* */ break;\n/* */ }\n/* 1073 */ offset++; if (offset >= len) {\n/* */ break;\n/* */ }\n/* */ }\n/* */ \n/* */ \n/* 1079 */ int newAmount = offset - start;\n/* 1080 */ if (newAmount < 32)\n/* */ {\n/* 1082 */ if (this._outputTail + newAmount > this._outputEnd) {\n/* 1083 */ _flushBuffer();\n/* */ }\n/* 1085 */ if (newAmount > 0) {\n/* 1086 */ System.arraycopy(text, start, this._outputBuffer, this._outputTail, newAmount);\n/* 1087 */ this._outputTail += newAmount;\n/* */ }\n/* */ } else {\n/* 1090 */ _flushBuffer();\n/* 1091 */ this._writer.write(text, start, newAmount);\n/* */ }\n/* */ \n/* 1094 */ if (offset >= len) {\n/* */ break;\n/* */ }\n/* */ \n/* 1098 */ char c = text[(offset++)];\n/* 1099 */ _appendCharacterEscape(c, escCodes[c]);\n/* */ }\n/* */ }","@Override\n public void writeSpace(char[] text, int offset, int length)\n throws XMLStreamException\n {\n writeRaw(text, offset, length);\n }","@Override\n public void write(char[] cbuf, int off, int len) throws IOException {\n if (textArea == null) {\n throw new IOException(\"Writer has already been closed!\");\n }\n String toWrite = String.copyValueOf(cbuf, off, len);\n textArea.appendText(toWrite);\n\n }","T println(char[] data, int from, int len) throws PrintingException, ArrayIndexOutOfBoundsException;","public void write(byte b[]) throws IOException;","public void write(char[] cArr, int i, int i2) throws XMLStreamException {\n try {\n this.writer.write(cArr, i, i2);\n } catch (IOException e) {\n throw new XMLStreamException((Throwable) e);\n }\n }","private void writeChar(byte[] bytes) {\n // let terminal do auto wrap around. \n term.writeChar(bytes);\n\n // update cursor \n //int x=term.getCursorX(); \n //int y=term.getCursorY();\n //term.putChar(bytes, x, y);\n // increment: let terminal do auto wrap around. \n //term.moveCursor(1,0); \n\n }","void writeChar(char value);","void write(byte b[]) throws IOException;","@Override\n public void write(final byte[] data, final int offset, final int length)\n throws IOException {\n if (offset < 0 || length < 0 || length > data.length - offset) {\n throw new IndexOutOfBoundsException();\n }\n\n writeInternal(data, offset, length);\n }","public static void write(@Nullable final char[] data, final Writer output) throws IOException {\n if (data != null) {\n output.write(data);\n }\n }","public void write(byte[] b, int offset, int len) throws IOException {\n if (pos + len < BUFFER_SIZE) {\n System.arraycopy(b, offset, buffer, pos, len);\n pos += len;\n } else {\n flush();\n if (len < BUFFER_SIZE) {\n System.arraycopy(b, offset, buffer, 0, len);\n } else {\n ConsoleRedirect.this.flush(b, offset, len);\n }\n }\n }","void writeInts(int[] i, int off, int len) throws IOException;","@Override\n public void write(byte[] data, int off, int len) throws IOException {\n for (int i = off; i < len; i++) {\n write(data[i]);\n }\n }","public void write(byte[] buffer);","private static void shiftArray(char [] dest,int start, int e, char subChar){\n int w = e;\n int r = e;\n while (--r >= start) {\n char ch = dest[r];\n if (ch != subChar) {\n --w;\n if (w != r) {\n dest[w] = ch;\n }\n }\n }\n }","CharacterTarget put(char[] symbols, int from, int to) throws PrintingException;","T print(char[] data, int from, int len) throws PrintingException, ArrayIndexOutOfBoundsException;","public void charData(char[] c, int offset, int length) throws Exception {\n\t\t\tString s = new String(c, offset, length);\n\n\t\t\tif (isVerbose()) {\n\t\t\t\tString x;\n\n\t\t\t\tif (s.length() > 40) {\n\t\t\t\t\tx = s.substring(0, 40) + \"...\";\n\t\t\t\t} else {\n\t\t\t\t\tx = s;\n\t\t\t\t}\n\n\t\t\t\tlogInfo(\"cdata\", \"[\" + offset + \",\" + length + \"] \" + x);\n\t\t\t}\n\n\t\t\t_currentElement.appendPCData(s);\n\t\t}","public void characters(char[] ch, int start, int length) {\n\n\t\tfor (int i=start; i!=start+length; ++i) {\n\t\t\tif (Character.isWhitespace(ch[i])) {\n\t\t\t\tif (lastCharWS)\n\t\t\t\t\tcontinue;\n\t\t\t\tlastCharWS = true;\n\t\t\t\tbuffer.append(\" \");\n\t\t\t\tcontinue;\n\t\t\t} else {\n\t\t\t\tlastCharWS = false;\n\t\t\t\tbuffer.append(ch[i]);\n\t\t\t}\n\t\t}\n\t}","public static void writeWriterContents(Writer writer, char[] text) throws CoreException {\r\n\t\tCheck.checkArg(writer);\r\n try {\r\n \ttry {\r\n \t\twriter.write(text, 0, text.length);\r\n \t} finally {\r\n \t\twriter.close();\r\n \t}\r\n } catch (UnsupportedEncodingException e) {\r\n throw new CoreException(createErrorStatus(e));\r\n } catch (IOException e) {\r\n throw new CoreException(createErrorStatus(e));\r\n }\r\n\t}","@Override\n public void write(char[] cbuf, int off, int len) throws IOException {\n for (int i = 0; i < cbuf.length; ++i)\n cbuf[i] = Character.toUpperCase(cbuf[i]);\n \n super.write(cbuf, off, len);\n \n }","public void writeCharactersInternal(char[] cArr, int i, int i2, boolean z) throws XMLStreamException {\n CharsetEncoder charsetEncoder;\n if (i2 != 0) {\n int i3 = 0;\n while (i3 < i2) {\n char c = cArr[i3 + i];\n if (c == '\\\"') {\n if (z) {\n break;\n }\n } else if (c != '&' && c != '<' && c != '>') {\n if (c >= ' ') {\n if (c > 127 && (charsetEncoder = this.encoder) != null && !charsetEncoder.canEncode(c)) {\n break;\n }\n } else if (!z) {\n if (!(c == 9 || c == 10)) {\n break;\n }\n } else {\n break;\n }\n } else {\n break;\n }\n i3++;\n }\n if (i3 < i2) {\n slowWriteCharacters(cArr, i, i2, z);\n } else {\n write(cArr, i, i2);\n }\n }\n }","public static void printArray(char[] array) {\n for (int i = 0; i < array.length; i++) {\n System.out.print(array[i] + \" \");\n }\n System.out.println();\n }","public void write(char cbuf[], int off, int len) {\r\n if ((cbuf != null) && (len > 0)) {\r\n\r\n // Force flush if we have accumulated more than 1K of text\r\n boolean flushMe = false;\r\n synchronized (LogWriter.this) {\r\n buffer.append(cbuf, off, len);\r\n if (buffer.length() >= 1024) {\r\n flushMe = true;\r\n } else {\r\n // Look for embedded EOL\r\n for (int i=off+len-1; i>= off; i--) {\r\n if (cbuf[i] == '\\n') {\r\n flushMe = true;\r\n break;\r\n }\r\n }\r\n }\r\n }\r\n\r\n if (flushMe) flush();\r\n }\r\n }","String charWrite();","public static void printCharArr(char[] arr){\n\t for(int i = 0; i < arr.length; i++){\n\t System.out.println(arr[i]);\n\t }\n\t}","public abstract void read_char_array(char[] value, int offset, int\nlength);","public void setText(char[] chars, int start, int length);","public static void writeArray(byte[] buffer, long offset, long length , byte [] name) {\n int i =0 ;\n while(length-- > 0){\n buffer[(int) offset++] = (byte) (name[i++] & 0xff);\n }\n }","public final void write(int c) {\r\n if (cbyte == size) {\r\n throw new ArrayIndexOutOfBoundsException(String.format(\"%d\", cbyte));\r\n }\r\n \r\n // Append the input byte to the data element.\r\n elem |= (c & 0xff) << (bytenum << 3);\r\n \r\n bytenum++;\r\n cbyte++;\r\n if (bytenum == BYTES_IN_ELEMENT) {\r\n // Write the data\r\n data[offset] = elem;\r\n // Increase offset\r\n offset++;\r\n // Reset current element\r\n elem = 0;\r\n // Reset bytenum\r\n bytenum = 0;\r\n }\r\n }","void writeShorts(short[] s, int off, int len) throws IOException;","public void write(byte b[], int off, int len) \r\n {\r\n \tif ((off < 0) || (off > b.length) || (len < 0) ||\r\n ((off + len) > b.length) || ((off + len) < 0)) \r\n \t{\r\n \t\tthrow new IndexOutOfBoundsException();\r\n \t} \r\n \telse if (len == 0) \r\n \t{\r\n \t\treturn;\r\n \t}\r\n int newcount = count + len;\r\n if (newcount > buf.length) \r\n {\r\n byte newbuf[] = new byte[Math.max(buf.length << 1, newcount)];\r\n System.arraycopy(buf, 0, newbuf, 0, count);\r\n buf = newbuf;\r\n }\r\n System.arraycopy(b, off, buf, count, len);\r\n count = newcount;\r\n }","static void printArray(char [] a) {\n\t\tfor (int i=0; i< a.length; i++) System.out.print(a[i]); \n\t\tSystem.out.println();\n\t}","@Override\n public int write(byte[] bytes, int offset, int length) throws SWPException {\n int codePointLength = getLength();\n SWPException.requireTrue(length >= codePointLength, \"Buffer overflow.\");\n bytes[offset] = (byte) ((codePointLength << 8) & 0xff);\n bytes[offset + 1] = (byte) (codePointLength & 0xff);\n bytes[offset + 2] = (byte) (codePoint >>> 8);\n bytes[offset + 3] = (byte) (codePoint & 0xff);\n if (isNull()) {\n\n bytes[offset + 4] = SwpConstants.NULL_INDICATOR;\n }\n else {\n\n bytes[offset + 4] = SwpConstants.NOT_NULL_INDICATOR;\n primitive.write(bytes, offset + 5, length - 5);\n }\n return codePointLength;\n }","@Override\n public void write(byte[] buf, int offset, int size) throws IOException;","public abstract void writeBytes(byte[] b, int offset, int length) throws IOException;","public abstract void writeRange(int startElement, int count,\r\n ByteBuffer src, int offsetBytes, boolean bForward);","public void characters(char[] ch, int start, int length) throws SAXException {\n contents.write(ch, start, length);//ne znam cemu sluzi ali neka ostane\n textBuffer.append(new String(ch, start, length));\n }","@Override\n public void write (final char buf[], final int off, final int len)\n {\n if (text != null)\n {\n text.append (new String (buf, off, len));\n if ((col += len) > wrap)\n println ();\n }\n else\n super.write (buf, off, len);\n }","static void writearray(String[]array) {\n\t\t for (int i = 0; i < array.length; i++) {\n\t\t\tSystem.out.println(array[i]);\n\t\t}\n\t}","public static void writeOnBoard(char[][] a, char letter, int x, int y){\r\n //first check if valid\r\n int rowNumber = a.length;\r\n int colNumber = a[0].length;\r\n if (colNumber<=x || rowNumber<=y || x<0 || y<0){\r\n throw new IllegalArgumentException(\"Point out of the span. Please re-enter a new point.\");\r\n }\r\n if (!spotIsEmpty(a[x][y])){\r\n throw new IllegalArgumentException(\"This spot has already been taken! Please re-enter a new point.\");\r\n }\r\n a[x][y] = letter;\r\n \r\n }","private void writeEsc(char ch[], int start, int length, boolean isAttVal) throws IOException {\n\t\tescapeHandler.escape(ch, start, length, isAttVal, output);\n\t}","@Override\n public void characters(char[] ch, int start, int length) {\n Node current = eltStack.peek();\n if (current.getChildNodes().getLength() == 1\n && current.getChildNodes().item(0).getNodeType() == Node.TEXT_NODE) {\n Text text = (Text) current.getChildNodes().item(0);\n text.appendData(new String(ch, start, length));\n } else {\n Text text = document.createTextNode(new String(ch, start, length));\n eltStack.peek().appendChild(text);\n }\n }","@Override\r\n\tpublic synchronized void write(byte[] b, int off, int len)\r\n\t{\r\n\t}","public void write(final byte[] data, final int offset, final int len) throws IOException {\n checkOpened();\n dos.write(data, offset, len);\n flush();\n }","private void addCharacters(\n final SAXEventType eventType,\n char[] characters, int offset, int length) {\n\n boolean coalesce = true;\n\n startRecording();\n\n // Coalesce adjacent character events together.\n if (lastEventType != eventType) {\n // Add the event type.\n addEvent(eventType);\n\n coalesce = false;\n }\n\n if (coalesce) {\n int lastLength = lastCharacterEventLength.getValue();\n int totalLength = lastLength + length;\n lastCharacterEventLength.setValue(totalLength);\n if(LOGGER.isDebugEnabled()) {\n LOGGER.debug(\"characters (coalesce)='\" +\n new String(characters,offset, length) + \"'\");\n }\n } else {\n if (LOGGER.isDebugEnabled()) {\n LOGGER.debug(\"characters='\" +\n new String(characters, offset, length) + \"'\");\n }\n addInt(characterCount);\n\n addPlaceHolderValue(lastCharacterEventLength);\n\n lastCharacterEventLength.setValue(length);\n }\n\n ensureCharacterArrayCapacity(characterCount + length);\n System.arraycopy(characters, offset, characterArray, characterCount,\n length);\n characterCount += length;\n }","public void cdata(char[] chars, int start, int length);","public abstract void write(byte[] b);","public void characters(char[] ch, int start, int len) {\r\n \tif (charState > 0) {\r\n \t\tif (charState == 2) {\r\n \t\t\tlineBuffer.append(' ');\r\n \t\t}\r\n \t\tcharState = 1;\r\n \tlineBuffer.append(new String(ch, start, len));\r\n \t}\r\n }","CharacterTarget put(char[] symbols) throws PrintingException;","public static void main(String[] args) {\n\t\t\r\n\t\tString charArray = \"Benjamin\";\r\n\t\t\r\n\t\tchar[] myChar = charArray.toCharArray(); //string returns to char\r\n\t\t\r\n\t\tSystem.out.println(Arrays.toString(myChar));\r\n\t\t\r\n\t\tSystem.out.println(\"elements in myChar: \"+myChar.length);\r\n\t\t\r\n\r\n\t\t\r\n\t\tString str =\"\";\r\n\t\tchar mychar[] = {'a', 'b', 'c'};\r\n\t\t\r\n\t\tfor(int i=0; i<mychar.length; i++) {\r\n\t\t\tchar c= mychar[i];\r\n\t\t\tstr+=c;\r\n\t\t\t\r\n\t\t}\r\n\t\tSystem.out.println(\"char to string result is: \"+str);\r\n\t}","private void doClipWrite(byte b[], int off, int len) {\n\t\tif (count + len <= maxOutputSize) { // won't overflow\n\t\t\tthis.writeDirectly(b, off, len);\n\t\t} else {\n\t\t\tint discardBytes = len + count - maxOutputSize;\n\t\t\tif (len >= maxOutputSize) {\n\t\t\t\treset();\n\t\t\t\tthis.writeDirectly(b, off + len - maxOutputSize, maxOutputSize);\n\t\t\t} else {\n\t\t\t\tint shiftStart = count - maxOutputSize + len;\n\t\t\t\tint remaining = maxOutputSize - len;\n\t\t\t\tSystem.arraycopy(buf, shiftStart, buf, 0, remaining);\n\t\t\t\tcount = remaining;\n\t\t\t\tthis.writeDirectly(b, off, len);\n\t\t\t}\n\t\t\tclipNum ++;\n\t\t\tSystem.out.println(String.format(\"Overflow count: %d, discarded bytes number: %d\", clipNum,\n\t\t\t\t\tdiscardBytes));\n\t\t\t\n\t\t}\n\n\t}","@Override\n public void write(byte[] data) throws IOException {\n for (int i = 0; i < data.length; i++) {\n write(data[i]);\n }\n }","public void writeArray(Object o) throws IOException;","void writeChar(final char result) throws WriterException;","public static byte[] writeInArray(byte[] array, String value, int pos) {\n\n byte[] strVal = value.getBytes();\n System.arraycopy(strVal, 0, array, pos, value.length());\n\n return array;\n }","public void setChars(char[] data, int row, int column) {\n\t\tcolumns[column].setChars(data, subset[row]);\n\t}","private void writeBuffer( byte b[], int offset, int length) throws IOException\r\n\t{\r\n\t\t// Write the chunk length as a hex number.\r\n\t\tfinal String size = Integer.toHexString(length);\r\n\t\tthis.out.write(size.getBytes());\r\n\t\t// Write a CRLF.\r\n\t\tthis.out.write( CR );\r\n\t\tthis.out.write( LF );\r\n\t\t// Write the data.\r\n\t\tif (length != 0 )\r\n\t\t\tthis.out.write(b, offset, length);\r\n\t\t// Write a CRLF.\r\n\t\tthis.out.write( CR );\r\n\t\tthis.out.write( LF );\r\n\t\t// And flush the real stream.\r\n\t\tthis.out.flush();\r\n\t}","public void write(byte b[]) throws IOException\n {\n checkThreshold(b.length);\n getStream().write(b);\n written += b.length;\n }","public static int compress(char[] chars) {\n int anchor = 0, write = 0;\n for (int read = 0; read < chars.length; read++){\n if (read + 1 == chars.length || chars[read + 1] != chars[read]){\n chars[write++] = chars[anchor];\n if (read > anchor) {\n// Integer.toString(read-anchor + 1)\n for (char c: (\"\" + (read - anchor + 1)).toCharArray()){\n chars[write++] = c;\n }\n }\n anchor = read + 1;\n }\n }\n return write;\n }","public void safeEncode(char[] chars, int off, int len, CharWriter writer) throws EncodingException\n {\n int previous = off;\n\n //\n int to = off + len;\n\n // Perform lookup char by char\n for (int current = off; current < to; current++)\n {\n // Lookup\n String replacement = lookup(chars[current]);\n\n // Do we have a replacement\n if (replacement != null)\n {\n // We lazy create the result\n\n // Append the previous chars if any\n writer.append(chars, previous, current - previous);\n\n // Append the replaced entity\n writer.append('&').append(replacement).append(';');\n\n // Update the previous pointer\n previous = current + 1;\n }\n }\n\n //\n writer.append(chars, previous, chars.length - previous);\n }","public void write(byte[] b, int off, int len) {\n\t\tbaos.write(b, off, len);\n\t}","@Override\r\n public synchronized void write(byte b[], int off, int len ) throws IOException {\r\n \tint avail = buf.length - count;\r\n\r\n \tif ( len <= avail ) {\r\n \t\tSystem.arraycopy( b, off, buf, count, len );\r\n \t\tcount += len;\r\n \t\treturn; // Over step to do flush()\r\n\t } else if ( len > avail ) {\r\n\t \tSystem.arraycopy( b, off, buf, count, avail);\r\n\t \tcount += avail;\r\n\t \tflush();\r\n\t \tSystem.arraycopy( b, avail, b, 0, (len-avail));\r\n\t \twrite(b, 0, (len-avail));\r\n\t } else {\r\n\t \twriteBuffer(b, off, len);\r\n\t }\r\n\t}","@Override\n\tpublic int write( byte [] buffer, int offset, int length ) {\n\t\tByteBuffer out = getOutputBuffer();\n\t\tif( out.limit() <= 0 ) {\n\t\t\tout.limit( out.capacity() );\n\t\t}\n\t\tsynchronized( out ) {\n\t\t\tout.put( buffer, offset, length );\n\t\t}\n\t\tdispatcher.requestWrite( this );\n\t\treturn length;\n\t}","private void _writeSegment(int end)\n/* */ throws IOException\n/* */ {\n/* 1006 */ int[] escCodes = this._outputEscapes;\n/* 1007 */ int escLen = escCodes.length;\n/* */ \n/* 1009 */ int ptr = 0;\n/* 1010 */ int start = ptr;\n/* */ \n/* */ \n/* 1013 */ while (ptr < end)\n/* */ {\n/* */ char c;\n/* */ for (;;) {\n/* 1017 */ c = this._outputBuffer[ptr];\n/* 1018 */ if ((c >= escLen) || (escCodes[c] == 0))\n/* */ {\n/* */ \n/* 1021 */ ptr++; if (ptr >= end) {\n/* */ break;\n/* */ }\n/* */ }\n/* */ }\n/* */ \n/* */ \n/* */ \n/* */ \n/* 1030 */ int flushLen = ptr - start;\n/* 1031 */ if (flushLen > 0) {\n/* 1032 */ this._writer.write(this._outputBuffer, start, flushLen);\n/* 1033 */ if (ptr >= end) {\n/* */ break;\n/* */ }\n/* */ }\n/* 1037 */ ptr++;\n/* */ \n/* 1039 */ start = _prependOrWriteCharacterEscape(this._outputBuffer, ptr, end, c, escCodes[c]);\n/* */ }\n/* */ }","public void characters(char ch[], int start, int length)\n throws SAXException {\n int i = 0;\n while ( i < length ) {\n char c = ch[start + i];\n switch (c) {\n case '&':\n newContent.append(\"&\");\n break;\n case '<':\n newContent.append(\"<\");\n break;\n case '>':\n newContent.append(\">\");\n break;\n case '\"':\n newContent.append(\""\");\n break;\n case '\\'':\n newContent.append(\"'\");\n break;\n default:\n // If we're outside 7 bit ascii encode as a character ref.\n // Not sure what the proper behavior here should be.\n if ((int) c > 127) {\n newContent.append(\"&#\" + (int) c + \";\");\n }\n else {\n newContent.append(c);\n }\n }\n\n i++;\n }\n }","public void write(byte b[], int off, int len) throws IOException\n {\n checkThreshold(len);\n getStream().write(b, off, len);\n written += len;\n }","public void write( OutputStream stream, short[] shorts, int offset, int numShorts ) throws IOException\n {\n int limit = offset + numShorts;\n\t\tfor( int i=offset; i<limit; i++ )\n\t\t{\n short sample = shorts[i];\n stream.write( sample >> 8 ); // high byte\n stream.write( sample ); // low byte\n\t\t}\n\t}","public void write(String value){\r\n for(int i=0; i<value.length(); i++){\r\n mBufferData.add(value.charAt(i));\r\n }\r\n }"],"string":"[\n \"void writeChars(char[] c, int off, int len) throws IOException;\",\n \"public void write(char[] charArray, int offset, int length) throws IOException{\\r\\n if(closed){\\r\\n throw new IOException(\\\"The stream is not open.\\\");\\r\\n }\\r\\n getBuffer().append(charArray, offset, length);\\r\\n }\",\n \"public void write(char[] charArray) throws IOException{\\r\\n write(charArray, 0, charArray.length);\\r\\n }\",\n \"public void write(char cbuf[], int off, int len) throws IOException {\\n ensureOpen();\\n if ((off < 0) || (off > cbuf.length) || (len < 0) ||\\n ((off + len) > cbuf.length) || ((off + len) < 0)) {\\n throw new IndexOutOfBoundsException();\\n } else if (len == 0) {\\n return;\\n }\\n out.write(cbuf, off, len);\\n }\",\n \"public void write(String[] buf, int offset, int size) throws IOException;\",\n \"void write (char ch, int offset);\",\n \"void writeChars(String s) throws IOException;\",\n \"public void write(char[] cArr) throws XMLStreamException {\\n try {\\n this.writer.write(cArr);\\n } catch (IOException e) {\\n throw new XMLStreamException((Throwable) e);\\n }\\n }\",\n \"public void write(char[] buffer, int offset, int length) {\\n final String text = new String(buffer, offset, length);\\n //Java 8\\n //SwingUtilities.invokeLater(()->{try{pane.getDocument().insertString(pane.getDocument().getLength(), text, properties);}catch(Exception e){}});\\n\\n //Java 7\\n SwingUtilities.invokeLater(new Runnable() {\\n public void run() {\\n try{pane.getDocument().insertString(pane.getDocument().getLength(), text, properties);}\\n catch(Exception e){}\\n }\\n });\\n }\",\n \"public void write(String[] buf) throws IOException;\",\n \"public abstract void drawChars(char data[], int offset, int length, int x, int y);\",\n \"@Override\\n public void characters(char ch[], int start, int length) {\\n\\n }\",\n \"@Override\\r\\n public void write(char[] cbuf, int off, int len) throws IOException {\\r\\n\\r\\n IOException ioException = null;\\r\\n for (WriterInfo writerInfo : mWriters) {\\r\\n try {\\r\\n writerInfo.getWriter().write(cbuf, off, len);\\r\\n } catch(IOException ioex) {\\r\\n ioException = ioex;\\r\\n }\\r\\n }\\r\\n if (ioException != null) {\\r\\n throw ioException;\\r\\n }\\r\\n\\r\\n }\",\n \"@Override\\n\\tpublic void characters(char ch[], int start, int length) {\\n\\t\\tchars.append(new String(ch, start, length));\\n\\t}\",\n \"private static void writer(String filename, char[] chars) {\\n BinaryOut binaryOut = new BinaryOut(filename);\\n\\n for (char c : chars) {\\n binaryOut.write(c);\\n }\\n\\n binaryOut.close();\\n }\",\n \"@Override \\n\\t public void characters(char ch[], int start, int length) { \\n\\t\\t \\n\\t }\",\n \"public synchronized void write(final byte[] cbuf, final int off, final int len) throws IOException {\\n\\t\\tif (len < 0) {\\n\\t\\t\\tthrow new IllegalArgumentException();\\n\\t\\t}\\n\\t\\tif (off < 0) {\\n\\t\\t\\tthrow new IndexOutOfBoundsException();\\n\\t\\t}\\n\\t\\tif (cbuf == null) {\\n\\t\\t\\tthrow new NullPointerException();\\n\\t\\t}\\n\\t\\tif ((len + off) > cbuf.length) {\\n\\t\\t\\tthrow new IndexOutOfBoundsException();\\n\\t\\t}\\n\\n\\t\\tensureSize(cursor + len);\\n\\n\\t\\tSystem.arraycopy(cbuf, off, this.buffer, cursor, len);\\n\\t\\tcursor += len;\\n\\t}\",\n \"public void write(byte b[], int off, int len) throws IOException;\",\n \"void write (String s, int offset);\",\n \"void write(byte[] buffer, int bufferOffset, int length) throws IOException;\",\n \"public void write(char[] b, int off, int len) throws IOException {\\n\\t\\t\\tif (!initialized) {\\n\\t\\t\\t\\tarea.setText(\\\"\\\");\\n\\t\\t\\t\\tinitialized = true;\\n\\t\\t\\t}\\n\\t\\t\\tString str = new String(b, off, len);\\n\\t\\t\\tStringBuffer sb = new StringBuffer(len);\\n\\t\\t\\twhile (str != null && str.length() > 0) {\\n\\t\\t\\t\\tif (lastCR && str.charAt(0) == '\\\\n')\\n\\t\\t\\t\\t\\tstr = str.substring(1);\\n\\t\\t\\t\\tint crIndex = str.indexOf('\\\\r');\\n\\t\\t\\t\\tif (crIndex >= 0) {\\n\\t\\t\\t\\t\\tsb.append(str.substring(0, crIndex));\\n\\t\\t\\t\\t\\tsb.append(\\\"\\\\n\\\");\\n\\t\\t\\t\\t\\tstr = str.substring(crIndex + 1);\\n\\t\\t\\t\\t\\tlastCR = true;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tsb.append(str);\\n\\t\\t\\t\\t\\tstr = null;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tarea.append(sb.toString());\\n\\t\\t}\",\n \"@Override\\n void characters(char[] ch, int start, int length);\",\n \"public void writeText(char[] text, int off, int len) throws IOException {\\r\\n deNude();\\r\\n writerEscape.writeText(text, off, len);\\r\\n }\",\n \"public synchronized void write(byte b[], int off, int len) {\\n \\tif ((off < 0) || (off > b.length) || (len < 0) ||\\n \\t\\t\\t((off + len) > b.length) || ((off + len) < 0)) {\\n \\t\\tthrow new IndexOutOfBoundsException();\\n \\t} else if (len == 0) {\\n \\t\\treturn;\\n \\t}\\n \\tif (enableClip) {\\n \\t\\tdoClipWrite(b, off, len);\\n \\t} else {\\n \\t\\twriteDirectly(b, off, len);\\n \\t}\\n \\t\\n }\",\n \"public void write(byte[] data, long offset);\",\n \"public void write( byte[] array, int firstIndex,\\n\\t\\t\\tint count );\",\n \"public void characters (char ch[], int start, int length)\\n\\t\\t{\\n//\\t\\t\\tfor (int i = start; i < start + length; i++) \\n//\\t\\t\\t\\tSystem.out.print(ch[i]);\\n//\\t\\t\\tSystem.out.println();\\n\\t\\t}\",\n \"public void write(char c){\\n\\t\\tbuffer[bufferPos++] = c;\\n\\n\\t\\tif(bufferPos == limit) flush();\\n\\t}\",\n \"public void characters( char[] buf, int offset, int len ) {\\r\\n\\r\\n // Append the new characters\\r\\n currentString.append( new String( buf, offset, len ) );\\r\\n }\",\n \"public void printToClient(char[] charArray) {\\n for (int i = 0; i < charArray.length; i++) {\\n out.print(charArray[i] + \\\" \\\");\\n }\\n out.println();\\n }\",\n \"private void _writeString(char[] text, int offset, int len)\\n/* */ throws IOException\\n/* */ {\\n/* 1049 */ if (this._characterEscapes != null) {\\n/* 1050 */ _writeStringCustom(text, offset, len);\\n/* 1051 */ return;\\n/* */ }\\n/* 1053 */ if (this._maximumNonEscapedChar != 0) {\\n/* 1054 */ _writeStringASCII(text, offset, len, this._maximumNonEscapedChar);\\n/* 1055 */ return;\\n/* */ }\\n/* */ \\n/* */ \\n/* */ \\n/* */ \\n/* */ \\n/* 1062 */ len += offset;\\n/* 1063 */ int[] escCodes = this._outputEscapes;\\n/* 1064 */ int escLen = escCodes.length;\\n/* 1065 */ while (offset < len) {\\n/* 1066 */ int start = offset;\\n/* */ for (;;)\\n/* */ {\\n/* 1069 */ char c = text[offset];\\n/* 1070 */ if ((c < escLen) && (escCodes[c] != 0)) {\\n/* */ break;\\n/* */ }\\n/* 1073 */ offset++; if (offset >= len) {\\n/* */ break;\\n/* */ }\\n/* */ }\\n/* */ \\n/* */ \\n/* 1079 */ int newAmount = offset - start;\\n/* 1080 */ if (newAmount < 32)\\n/* */ {\\n/* 1082 */ if (this._outputTail + newAmount > this._outputEnd) {\\n/* 1083 */ _flushBuffer();\\n/* */ }\\n/* 1085 */ if (newAmount > 0) {\\n/* 1086 */ System.arraycopy(text, start, this._outputBuffer, this._outputTail, newAmount);\\n/* 1087 */ this._outputTail += newAmount;\\n/* */ }\\n/* */ } else {\\n/* 1090 */ _flushBuffer();\\n/* 1091 */ this._writer.write(text, start, newAmount);\\n/* */ }\\n/* */ \\n/* 1094 */ if (offset >= len) {\\n/* */ break;\\n/* */ }\\n/* */ \\n/* 1098 */ char c = text[(offset++)];\\n/* 1099 */ _appendCharacterEscape(c, escCodes[c]);\\n/* */ }\\n/* */ }\",\n \"@Override\\n public void writeSpace(char[] text, int offset, int length)\\n throws XMLStreamException\\n {\\n writeRaw(text, offset, length);\\n }\",\n \"@Override\\n public void write(char[] cbuf, int off, int len) throws IOException {\\n if (textArea == null) {\\n throw new IOException(\\\"Writer has already been closed!\\\");\\n }\\n String toWrite = String.copyValueOf(cbuf, off, len);\\n textArea.appendText(toWrite);\\n\\n }\",\n \"T println(char[] data, int from, int len) throws PrintingException, ArrayIndexOutOfBoundsException;\",\n \"public void write(byte b[]) throws IOException;\",\n \"public void write(char[] cArr, int i, int i2) throws XMLStreamException {\\n try {\\n this.writer.write(cArr, i, i2);\\n } catch (IOException e) {\\n throw new XMLStreamException((Throwable) e);\\n }\\n }\",\n \"private void writeChar(byte[] bytes) {\\n // let terminal do auto wrap around. \\n term.writeChar(bytes);\\n\\n // update cursor \\n //int x=term.getCursorX(); \\n //int y=term.getCursorY();\\n //term.putChar(bytes, x, y);\\n // increment: let terminal do auto wrap around. \\n //term.moveCursor(1,0); \\n\\n }\",\n \"void writeChar(char value);\",\n \"void write(byte b[]) throws IOException;\",\n \"@Override\\n public void write(final byte[] data, final int offset, final int length)\\n throws IOException {\\n if (offset < 0 || length < 0 || length > data.length - offset) {\\n throw new IndexOutOfBoundsException();\\n }\\n\\n writeInternal(data, offset, length);\\n }\",\n \"public static void write(@Nullable final char[] data, final Writer output) throws IOException {\\n if (data != null) {\\n output.write(data);\\n }\\n }\",\n \"public void write(byte[] b, int offset, int len) throws IOException {\\n if (pos + len < BUFFER_SIZE) {\\n System.arraycopy(b, offset, buffer, pos, len);\\n pos += len;\\n } else {\\n flush();\\n if (len < BUFFER_SIZE) {\\n System.arraycopy(b, offset, buffer, 0, len);\\n } else {\\n ConsoleRedirect.this.flush(b, offset, len);\\n }\\n }\\n }\",\n \"void writeInts(int[] i, int off, int len) throws IOException;\",\n \"@Override\\n public void write(byte[] data, int off, int len) throws IOException {\\n for (int i = off; i < len; i++) {\\n write(data[i]);\\n }\\n }\",\n \"public void write(byte[] buffer);\",\n \"private static void shiftArray(char [] dest,int start, int e, char subChar){\\n int w = e;\\n int r = e;\\n while (--r >= start) {\\n char ch = dest[r];\\n if (ch != subChar) {\\n --w;\\n if (w != r) {\\n dest[w] = ch;\\n }\\n }\\n }\\n }\",\n \"CharacterTarget put(char[] symbols, int from, int to) throws PrintingException;\",\n \"T print(char[] data, int from, int len) throws PrintingException, ArrayIndexOutOfBoundsException;\",\n \"public void charData(char[] c, int offset, int length) throws Exception {\\n\\t\\t\\tString s = new String(c, offset, length);\\n\\n\\t\\t\\tif (isVerbose()) {\\n\\t\\t\\t\\tString x;\\n\\n\\t\\t\\t\\tif (s.length() > 40) {\\n\\t\\t\\t\\t\\tx = s.substring(0, 40) + \\\"...\\\";\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tx = s;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tlogInfo(\\\"cdata\\\", \\\"[\\\" + offset + \\\",\\\" + length + \\\"] \\\" + x);\\n\\t\\t\\t}\\n\\n\\t\\t\\t_currentElement.appendPCData(s);\\n\\t\\t}\",\n \"public void characters(char[] ch, int start, int length) {\\n\\n\\t\\tfor (int i=start; i!=start+length; ++i) {\\n\\t\\t\\tif (Character.isWhitespace(ch[i])) {\\n\\t\\t\\t\\tif (lastCharWS)\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\tlastCharWS = true;\\n\\t\\t\\t\\tbuffer.append(\\\" \\\");\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tlastCharWS = false;\\n\\t\\t\\t\\tbuffer.append(ch[i]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public static void writeWriterContents(Writer writer, char[] text) throws CoreException {\\r\\n\\t\\tCheck.checkArg(writer);\\r\\n try {\\r\\n \\ttry {\\r\\n \\t\\twriter.write(text, 0, text.length);\\r\\n \\t} finally {\\r\\n \\t\\twriter.close();\\r\\n \\t}\\r\\n } catch (UnsupportedEncodingException e) {\\r\\n throw new CoreException(createErrorStatus(e));\\r\\n } catch (IOException e) {\\r\\n throw new CoreException(createErrorStatus(e));\\r\\n }\\r\\n\\t}\",\n \"@Override\\n public void write(char[] cbuf, int off, int len) throws IOException {\\n for (int i = 0; i < cbuf.length; ++i)\\n cbuf[i] = Character.toUpperCase(cbuf[i]);\\n \\n super.write(cbuf, off, len);\\n \\n }\",\n \"public void writeCharactersInternal(char[] cArr, int i, int i2, boolean z) throws XMLStreamException {\\n CharsetEncoder charsetEncoder;\\n if (i2 != 0) {\\n int i3 = 0;\\n while (i3 < i2) {\\n char c = cArr[i3 + i];\\n if (c == '\\\\\\\"') {\\n if (z) {\\n break;\\n }\\n } else if (c != '&' && c != '<' && c != '>') {\\n if (c >= ' ') {\\n if (c > 127 && (charsetEncoder = this.encoder) != null && !charsetEncoder.canEncode(c)) {\\n break;\\n }\\n } else if (!z) {\\n if (!(c == 9 || c == 10)) {\\n break;\\n }\\n } else {\\n break;\\n }\\n } else {\\n break;\\n }\\n i3++;\\n }\\n if (i3 < i2) {\\n slowWriteCharacters(cArr, i, i2, z);\\n } else {\\n write(cArr, i, i2);\\n }\\n }\\n }\",\n \"public static void printArray(char[] array) {\\n for (int i = 0; i < array.length; i++) {\\n System.out.print(array[i] + \\\" \\\");\\n }\\n System.out.println();\\n }\",\n \"public void write(char cbuf[], int off, int len) {\\r\\n if ((cbuf != null) && (len > 0)) {\\r\\n\\r\\n // Force flush if we have accumulated more than 1K of text\\r\\n boolean flushMe = false;\\r\\n synchronized (LogWriter.this) {\\r\\n buffer.append(cbuf, off, len);\\r\\n if (buffer.length() >= 1024) {\\r\\n flushMe = true;\\r\\n } else {\\r\\n // Look for embedded EOL\\r\\n for (int i=off+len-1; i>= off; i--) {\\r\\n if (cbuf[i] == '\\\\n') {\\r\\n flushMe = true;\\r\\n break;\\r\\n }\\r\\n }\\r\\n }\\r\\n }\\r\\n\\r\\n if (flushMe) flush();\\r\\n }\\r\\n }\",\n \"String charWrite();\",\n \"public static void printCharArr(char[] arr){\\n\\t for(int i = 0; i < arr.length; i++){\\n\\t System.out.println(arr[i]);\\n\\t }\\n\\t}\",\n \"public abstract void read_char_array(char[] value, int offset, int\\nlength);\",\n \"public void setText(char[] chars, int start, int length);\",\n \"public static void writeArray(byte[] buffer, long offset, long length , byte [] name) {\\n int i =0 ;\\n while(length-- > 0){\\n buffer[(int) offset++] = (byte) (name[i++] & 0xff);\\n }\\n }\",\n \"public final void write(int c) {\\r\\n if (cbyte == size) {\\r\\n throw new ArrayIndexOutOfBoundsException(String.format(\\\"%d\\\", cbyte));\\r\\n }\\r\\n \\r\\n // Append the input byte to the data element.\\r\\n elem |= (c & 0xff) << (bytenum << 3);\\r\\n \\r\\n bytenum++;\\r\\n cbyte++;\\r\\n if (bytenum == BYTES_IN_ELEMENT) {\\r\\n // Write the data\\r\\n data[offset] = elem;\\r\\n // Increase offset\\r\\n offset++;\\r\\n // Reset current element\\r\\n elem = 0;\\r\\n // Reset bytenum\\r\\n bytenum = 0;\\r\\n }\\r\\n }\",\n \"void writeShorts(short[] s, int off, int len) throws IOException;\",\n \"public void write(byte b[], int off, int len) \\r\\n {\\r\\n \\tif ((off < 0) || (off > b.length) || (len < 0) ||\\r\\n ((off + len) > b.length) || ((off + len) < 0)) \\r\\n \\t{\\r\\n \\t\\tthrow new IndexOutOfBoundsException();\\r\\n \\t} \\r\\n \\telse if (len == 0) \\r\\n \\t{\\r\\n \\t\\treturn;\\r\\n \\t}\\r\\n int newcount = count + len;\\r\\n if (newcount > buf.length) \\r\\n {\\r\\n byte newbuf[] = new byte[Math.max(buf.length << 1, newcount)];\\r\\n System.arraycopy(buf, 0, newbuf, 0, count);\\r\\n buf = newbuf;\\r\\n }\\r\\n System.arraycopy(b, off, buf, count, len);\\r\\n count = newcount;\\r\\n }\",\n \"static void printArray(char [] a) {\\n\\t\\tfor (int i=0; i< a.length; i++) System.out.print(a[i]); \\n\\t\\tSystem.out.println();\\n\\t}\",\n \"@Override\\n public int write(byte[] bytes, int offset, int length) throws SWPException {\\n int codePointLength = getLength();\\n SWPException.requireTrue(length >= codePointLength, \\\"Buffer overflow.\\\");\\n bytes[offset] = (byte) ((codePointLength << 8) & 0xff);\\n bytes[offset + 1] = (byte) (codePointLength & 0xff);\\n bytes[offset + 2] = (byte) (codePoint >>> 8);\\n bytes[offset + 3] = (byte) (codePoint & 0xff);\\n if (isNull()) {\\n\\n bytes[offset + 4] = SwpConstants.NULL_INDICATOR;\\n }\\n else {\\n\\n bytes[offset + 4] = SwpConstants.NOT_NULL_INDICATOR;\\n primitive.write(bytes, offset + 5, length - 5);\\n }\\n return codePointLength;\\n }\",\n \"@Override\\n public void write(byte[] buf, int offset, int size) throws IOException;\",\n \"public abstract void writeBytes(byte[] b, int offset, int length) throws IOException;\",\n \"public abstract void writeRange(int startElement, int count,\\r\\n ByteBuffer src, int offsetBytes, boolean bForward);\",\n \"public void characters(char[] ch, int start, int length) throws SAXException {\\n contents.write(ch, start, length);//ne znam cemu sluzi ali neka ostane\\n textBuffer.append(new String(ch, start, length));\\n }\",\n \"@Override\\n public void write (final char buf[], final int off, final int len)\\n {\\n if (text != null)\\n {\\n text.append (new String (buf, off, len));\\n if ((col += len) > wrap)\\n println ();\\n }\\n else\\n super.write (buf, off, len);\\n }\",\n \"static void writearray(String[]array) {\\n\\t\\t for (int i = 0; i < array.length; i++) {\\n\\t\\t\\tSystem.out.println(array[i]);\\n\\t\\t}\\n\\t}\",\n \"public static void writeOnBoard(char[][] a, char letter, int x, int y){\\r\\n //first check if valid\\r\\n int rowNumber = a.length;\\r\\n int colNumber = a[0].length;\\r\\n if (colNumber<=x || rowNumber<=y || x<0 || y<0){\\r\\n throw new IllegalArgumentException(\\\"Point out of the span. Please re-enter a new point.\\\");\\r\\n }\\r\\n if (!spotIsEmpty(a[x][y])){\\r\\n throw new IllegalArgumentException(\\\"This spot has already been taken! Please re-enter a new point.\\\");\\r\\n }\\r\\n a[x][y] = letter;\\r\\n \\r\\n }\",\n \"private void writeEsc(char ch[], int start, int length, boolean isAttVal) throws IOException {\\n\\t\\tescapeHandler.escape(ch, start, length, isAttVal, output);\\n\\t}\",\n \"@Override\\n public void characters(char[] ch, int start, int length) {\\n Node current = eltStack.peek();\\n if (current.getChildNodes().getLength() == 1\\n && current.getChildNodes().item(0).getNodeType() == Node.TEXT_NODE) {\\n Text text = (Text) current.getChildNodes().item(0);\\n text.appendData(new String(ch, start, length));\\n } else {\\n Text text = document.createTextNode(new String(ch, start, length));\\n eltStack.peek().appendChild(text);\\n }\\n }\",\n \"@Override\\r\\n\\tpublic synchronized void write(byte[] b, int off, int len)\\r\\n\\t{\\r\\n\\t}\",\n \"public void write(final byte[] data, final int offset, final int len) throws IOException {\\n checkOpened();\\n dos.write(data, offset, len);\\n flush();\\n }\",\n \"private void addCharacters(\\n final SAXEventType eventType,\\n char[] characters, int offset, int length) {\\n\\n boolean coalesce = true;\\n\\n startRecording();\\n\\n // Coalesce adjacent character events together.\\n if (lastEventType != eventType) {\\n // Add the event type.\\n addEvent(eventType);\\n\\n coalesce = false;\\n }\\n\\n if (coalesce) {\\n int lastLength = lastCharacterEventLength.getValue();\\n int totalLength = lastLength + length;\\n lastCharacterEventLength.setValue(totalLength);\\n if(LOGGER.isDebugEnabled()) {\\n LOGGER.debug(\\\"characters (coalesce)='\\\" +\\n new String(characters,offset, length) + \\\"'\\\");\\n }\\n } else {\\n if (LOGGER.isDebugEnabled()) {\\n LOGGER.debug(\\\"characters='\\\" +\\n new String(characters, offset, length) + \\\"'\\\");\\n }\\n addInt(characterCount);\\n\\n addPlaceHolderValue(lastCharacterEventLength);\\n\\n lastCharacterEventLength.setValue(length);\\n }\\n\\n ensureCharacterArrayCapacity(characterCount + length);\\n System.arraycopy(characters, offset, characterArray, characterCount,\\n length);\\n characterCount += length;\\n }\",\n \"public void cdata(char[] chars, int start, int length);\",\n \"public abstract void write(byte[] b);\",\n \"public void characters(char[] ch, int start, int len) {\\r\\n \\tif (charState > 0) {\\r\\n \\t\\tif (charState == 2) {\\r\\n \\t\\t\\tlineBuffer.append(' ');\\r\\n \\t\\t}\\r\\n \\t\\tcharState = 1;\\r\\n \\tlineBuffer.append(new String(ch, start, len));\\r\\n \\t}\\r\\n }\",\n \"CharacterTarget put(char[] symbols) throws PrintingException;\",\n \"public static void main(String[] args) {\\n\\t\\t\\r\\n\\t\\tString charArray = \\\"Benjamin\\\";\\r\\n\\t\\t\\r\\n\\t\\tchar[] myChar = charArray.toCharArray(); //string returns to char\\r\\n\\t\\t\\r\\n\\t\\tSystem.out.println(Arrays.toString(myChar));\\r\\n\\t\\t\\r\\n\\t\\tSystem.out.println(\\\"elements in myChar: \\\"+myChar.length);\\r\\n\\t\\t\\r\\n\\r\\n\\t\\t\\r\\n\\t\\tString str =\\\"\\\";\\r\\n\\t\\tchar mychar[] = {'a', 'b', 'c'};\\r\\n\\t\\t\\r\\n\\t\\tfor(int i=0; i<mychar.length; i++) {\\r\\n\\t\\t\\tchar c= mychar[i];\\r\\n\\t\\t\\tstr+=c;\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\tSystem.out.println(\\\"char to string result is: \\\"+str);\\r\\n\\t}\",\n \"private void doClipWrite(byte b[], int off, int len) {\\n\\t\\tif (count + len <= maxOutputSize) { // won't overflow\\n\\t\\t\\tthis.writeDirectly(b, off, len);\\n\\t\\t} else {\\n\\t\\t\\tint discardBytes = len + count - maxOutputSize;\\n\\t\\t\\tif (len >= maxOutputSize) {\\n\\t\\t\\t\\treset();\\n\\t\\t\\t\\tthis.writeDirectly(b, off + len - maxOutputSize, maxOutputSize);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tint shiftStart = count - maxOutputSize + len;\\n\\t\\t\\t\\tint remaining = maxOutputSize - len;\\n\\t\\t\\t\\tSystem.arraycopy(buf, shiftStart, buf, 0, remaining);\\n\\t\\t\\t\\tcount = remaining;\\n\\t\\t\\t\\tthis.writeDirectly(b, off, len);\\n\\t\\t\\t}\\n\\t\\t\\tclipNum ++;\\n\\t\\t\\tSystem.out.println(String.format(\\\"Overflow count: %d, discarded bytes number: %d\\\", clipNum,\\n\\t\\t\\t\\t\\tdiscardBytes));\\n\\t\\t\\t\\n\\t\\t}\\n\\n\\t}\",\n \"@Override\\n public void write(byte[] data) throws IOException {\\n for (int i = 0; i < data.length; i++) {\\n write(data[i]);\\n }\\n }\",\n \"public void writeArray(Object o) throws IOException;\",\n \"void writeChar(final char result) throws WriterException;\",\n \"public static byte[] writeInArray(byte[] array, String value, int pos) {\\n\\n byte[] strVal = value.getBytes();\\n System.arraycopy(strVal, 0, array, pos, value.length());\\n\\n return array;\\n }\",\n \"public void setChars(char[] data, int row, int column) {\\n\\t\\tcolumns[column].setChars(data, subset[row]);\\n\\t}\",\n \"private void writeBuffer( byte b[], int offset, int length) throws IOException\\r\\n\\t{\\r\\n\\t\\t// Write the chunk length as a hex number.\\r\\n\\t\\tfinal String size = Integer.toHexString(length);\\r\\n\\t\\tthis.out.write(size.getBytes());\\r\\n\\t\\t// Write a CRLF.\\r\\n\\t\\tthis.out.write( CR );\\r\\n\\t\\tthis.out.write( LF );\\r\\n\\t\\t// Write the data.\\r\\n\\t\\tif (length != 0 )\\r\\n\\t\\t\\tthis.out.write(b, offset, length);\\r\\n\\t\\t// Write a CRLF.\\r\\n\\t\\tthis.out.write( CR );\\r\\n\\t\\tthis.out.write( LF );\\r\\n\\t\\t// And flush the real stream.\\r\\n\\t\\tthis.out.flush();\\r\\n\\t}\",\n \"public void write(byte b[]) throws IOException\\n {\\n checkThreshold(b.length);\\n getStream().write(b);\\n written += b.length;\\n }\",\n \"public static int compress(char[] chars) {\\n int anchor = 0, write = 0;\\n for (int read = 0; read < chars.length; read++){\\n if (read + 1 == chars.length || chars[read + 1] != chars[read]){\\n chars[write++] = chars[anchor];\\n if (read > anchor) {\\n// Integer.toString(read-anchor + 1)\\n for (char c: (\\\"\\\" + (read - anchor + 1)).toCharArray()){\\n chars[write++] = c;\\n }\\n }\\n anchor = read + 1;\\n }\\n }\\n return write;\\n }\",\n \"public void safeEncode(char[] chars, int off, int len, CharWriter writer) throws EncodingException\\n {\\n int previous = off;\\n\\n //\\n int to = off + len;\\n\\n // Perform lookup char by char\\n for (int current = off; current < to; current++)\\n {\\n // Lookup\\n String replacement = lookup(chars[current]);\\n\\n // Do we have a replacement\\n if (replacement != null)\\n {\\n // We lazy create the result\\n\\n // Append the previous chars if any\\n writer.append(chars, previous, current - previous);\\n\\n // Append the replaced entity\\n writer.append('&').append(replacement).append(';');\\n\\n // Update the previous pointer\\n previous = current + 1;\\n }\\n }\\n\\n //\\n writer.append(chars, previous, chars.length - previous);\\n }\",\n \"public void write(byte[] b, int off, int len) {\\n\\t\\tbaos.write(b, off, len);\\n\\t}\",\n \"@Override\\r\\n public synchronized void write(byte b[], int off, int len ) throws IOException {\\r\\n \\tint avail = buf.length - count;\\r\\n\\r\\n \\tif ( len <= avail ) {\\r\\n \\t\\tSystem.arraycopy( b, off, buf, count, len );\\r\\n \\t\\tcount += len;\\r\\n \\t\\treturn; // Over step to do flush()\\r\\n\\t } else if ( len > avail ) {\\r\\n\\t \\tSystem.arraycopy( b, off, buf, count, avail);\\r\\n\\t \\tcount += avail;\\r\\n\\t \\tflush();\\r\\n\\t \\tSystem.arraycopy( b, avail, b, 0, (len-avail));\\r\\n\\t \\twrite(b, 0, (len-avail));\\r\\n\\t } else {\\r\\n\\t \\twriteBuffer(b, off, len);\\r\\n\\t }\\r\\n\\t}\",\n \"@Override\\n\\tpublic int write( byte [] buffer, int offset, int length ) {\\n\\t\\tByteBuffer out = getOutputBuffer();\\n\\t\\tif( out.limit() <= 0 ) {\\n\\t\\t\\tout.limit( out.capacity() );\\n\\t\\t}\\n\\t\\tsynchronized( out ) {\\n\\t\\t\\tout.put( buffer, offset, length );\\n\\t\\t}\\n\\t\\tdispatcher.requestWrite( this );\\n\\t\\treturn length;\\n\\t}\",\n \"private void _writeSegment(int end)\\n/* */ throws IOException\\n/* */ {\\n/* 1006 */ int[] escCodes = this._outputEscapes;\\n/* 1007 */ int escLen = escCodes.length;\\n/* */ \\n/* 1009 */ int ptr = 0;\\n/* 1010 */ int start = ptr;\\n/* */ \\n/* */ \\n/* 1013 */ while (ptr < end)\\n/* */ {\\n/* */ char c;\\n/* */ for (;;) {\\n/* 1017 */ c = this._outputBuffer[ptr];\\n/* 1018 */ if ((c >= escLen) || (escCodes[c] == 0))\\n/* */ {\\n/* */ \\n/* 1021 */ ptr++; if (ptr >= end) {\\n/* */ break;\\n/* */ }\\n/* */ }\\n/* */ }\\n/* */ \\n/* */ \\n/* */ \\n/* */ \\n/* 1030 */ int flushLen = ptr - start;\\n/* 1031 */ if (flushLen > 0) {\\n/* 1032 */ this._writer.write(this._outputBuffer, start, flushLen);\\n/* 1033 */ if (ptr >= end) {\\n/* */ break;\\n/* */ }\\n/* */ }\\n/* 1037 */ ptr++;\\n/* */ \\n/* 1039 */ start = _prependOrWriteCharacterEscape(this._outputBuffer, ptr, end, c, escCodes[c]);\\n/* */ }\\n/* */ }\",\n \"public void characters(char ch[], int start, int length)\\n throws SAXException {\\n int i = 0;\\n while ( i < length ) {\\n char c = ch[start + i];\\n switch (c) {\\n case '&':\\n newContent.append(\\\"&\\\");\\n break;\\n case '<':\\n newContent.append(\\\"<\\\");\\n break;\\n case '>':\\n newContent.append(\\\">\\\");\\n break;\\n case '\\\"':\\n newContent.append(\\\""\\\");\\n break;\\n case '\\\\'':\\n newContent.append(\\\"'\\\");\\n break;\\n default:\\n // If we're outside 7 bit ascii encode as a character ref.\\n // Not sure what the proper behavior here should be.\\n if ((int) c > 127) {\\n newContent.append(\\\"&#\\\" + (int) c + \\\";\\\");\\n }\\n else {\\n newContent.append(c);\\n }\\n }\\n\\n i++;\\n }\\n }\",\n \"public void write(byte b[], int off, int len) throws IOException\\n {\\n checkThreshold(len);\\n getStream().write(b, off, len);\\n written += len;\\n }\",\n \"public void write( OutputStream stream, short[] shorts, int offset, int numShorts ) throws IOException\\n {\\n int limit = offset + numShorts;\\n\\t\\tfor( int i=offset; i<limit; i++ )\\n\\t\\t{\\n short sample = shorts[i];\\n stream.write( sample >> 8 ); // high byte\\n stream.write( sample ); // low byte\\n\\t\\t}\\n\\t}\",\n \"public void write(String value){\\r\\n for(int i=0; i<value.length(); i++){\\r\\n mBufferData.add(value.charAt(i));\\r\\n }\\r\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.8040365","0.69351685","0.6754314","0.66677344","0.64745426","0.64163166","0.6251137","0.62477624","0.6234871","0.6193163","0.61458325","0.6139917","0.61393845","0.61271626","0.6127038","0.61244005","0.60924226","0.60894907","0.60780525","0.60670334","0.60516983","0.60458136","0.6015765","0.601447","0.6006369","0.59926116","0.598219","0.58733153","0.5869798","0.5846469","0.5846419","0.578059","0.5777774","0.57600355","0.57591337","0.5757569","0.5755024","0.5731398","0.5697031","0.5694418","0.5674944","0.56361353","0.5615913","0.558431","0.5562722","0.55613285","0.5546506","0.55173016","0.5516495","0.5511201","0.5501984","0.54811716","0.54783005","0.54734135","0.54534996","0.5441175","0.543563","0.5414898","0.53922945","0.5383738","0.53690374","0.5367528","0.53663534","0.53627795","0.5361538","0.5358196","0.53574765","0.53303987","0.53224355","0.52996224","0.5299515","0.5292664","0.5289184","0.528877","0.52597237","0.5250477","0.524046","0.52397877","0.523943","0.52224195","0.52221245","0.5221805","0.52152616","0.5213843","0.5201804","0.51969314","0.5188298","0.51839924","0.51810724","0.51798147","0.51712257","0.5165429","0.5162857","0.51350397","0.51296276","0.51277906","0.51257086","0.51174283","0.5103709","0.5098239"],"string":"[\n \"0.8040365\",\n \"0.69351685\",\n \"0.6754314\",\n \"0.66677344\",\n \"0.64745426\",\n \"0.64163166\",\n \"0.6251137\",\n \"0.62477624\",\n \"0.6234871\",\n \"0.6193163\",\n \"0.61458325\",\n \"0.6139917\",\n \"0.61393845\",\n \"0.61271626\",\n \"0.6127038\",\n \"0.61244005\",\n \"0.60924226\",\n \"0.60894907\",\n \"0.60780525\",\n \"0.60670334\",\n \"0.60516983\",\n \"0.60458136\",\n \"0.6015765\",\n \"0.601447\",\n \"0.6006369\",\n \"0.59926116\",\n \"0.598219\",\n \"0.58733153\",\n \"0.5869798\",\n \"0.5846469\",\n \"0.5846419\",\n \"0.578059\",\n \"0.5777774\",\n \"0.57600355\",\n \"0.57591337\",\n \"0.5757569\",\n \"0.5755024\",\n \"0.5731398\",\n \"0.5697031\",\n \"0.5694418\",\n \"0.5674944\",\n \"0.56361353\",\n \"0.5615913\",\n \"0.558431\",\n \"0.5562722\",\n \"0.55613285\",\n \"0.5546506\",\n \"0.55173016\",\n \"0.5516495\",\n \"0.5511201\",\n \"0.5501984\",\n \"0.54811716\",\n \"0.54783005\",\n \"0.54734135\",\n \"0.54534996\",\n \"0.5441175\",\n \"0.543563\",\n \"0.5414898\",\n \"0.53922945\",\n \"0.5383738\",\n \"0.53690374\",\n \"0.5367528\",\n \"0.53663534\",\n \"0.53627795\",\n \"0.5361538\",\n \"0.5358196\",\n \"0.53574765\",\n \"0.53303987\",\n \"0.53224355\",\n \"0.52996224\",\n \"0.5299515\",\n \"0.5292664\",\n \"0.5289184\",\n \"0.528877\",\n \"0.52597237\",\n \"0.5250477\",\n \"0.524046\",\n \"0.52397877\",\n \"0.523943\",\n \"0.52224195\",\n \"0.52221245\",\n \"0.5221805\",\n \"0.52152616\",\n \"0.5213843\",\n \"0.5201804\",\n \"0.51969314\",\n \"0.5188298\",\n \"0.51839924\",\n \"0.51810724\",\n \"0.51798147\",\n \"0.51712257\",\n \"0.5165429\",\n \"0.5162857\",\n \"0.51350397\",\n \"0.51296276\",\n \"0.51277906\",\n \"0.51257086\",\n \"0.51174283\",\n \"0.5103709\",\n \"0.5098239\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6314676"},"document_rank":{"kind":"string","value":"6"}}},{"rowIdx":29383,"cells":{"query":{"kind":"string","value":"Flushes this stream by writing any buffered output to the underlying stream."},"document":{"kind":"string","value":"@Override\n public void flush() throws IOException\n {\n for(;;) {\n int index = indexOneOf(builder, '\\r', '\\n');\n if(index == -1) {\n break;\n }\n // ignore false returned by offer when queue is full\n queue.offer(builder.substring(0, index));\n\n if(builder.charAt(index) == '\\r') {\n ++index;\n }\n if(builder.charAt(index) != '\\n') {\n throw new IllegalStateException();\n }\n ++index;\n builder.delete(0, index);\n }\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["public void flush() {\n wasFlushed = true;\n }","public void flush() throws IOException\n {\n getStream().flush();\n }","public static void flush() {\n if (outputEnabled)\n out.flush();\n }","public synchronized void flush() {\n\t\ttry {\n\t\t\tcloseWriter();\n\t\t} catch(IOException ioe ) {\n\t\t\tioe.printStackTrace();\n\t\t}\n\n\t\ttry {\n\t\t\topenWriter(true);\n\t\t} catch(IOException ioe ) {\n\t\t\tioe.printStackTrace();\n\t\t}\n\t}","@Override\n public void flush() throws IOException {\n byteBufferStreamOutput.flush();\n }","public void flush() {\n writer.flush();\n }","public void flush() {\n flushed = true;\n }","public void flush() throws IOException {\n try {\n out.flush();\n } catch (IOException ioe) {\n String msg = \"Failed to flush \" + this;\n LOG.error(msg, ioe);\n throw new IOException(msg, ioe);\n }\n }","public void flush() throws IOException {\n mPrintWriter.flush();\n }","@Override\n public void flush()\n throws XMLStreamException\n {\n try {\n mWriter.flush();\n } catch (IOException ie) {\n throw new WstxIOException(ie);\n }\n }","public void flush() throws IOException;","public void flush() throws IOException;","public void flush() throws IOException;","public synchronized void flush() throws IOException {\n\t\tcheckNotClosed();\n\t\ttrimToSize();\n\t\tjournalWriter.flush();\n\t}","public void flush();","public void flush();","public void flush();","public void flush();","public void flush() {\n\r\n int inflatedSize = buffer.position();\r\n deflator.setInput(buffer.getBuffer(), 0, inflatedSize);\r\n deflator.finish();\r\n int deflatedSize = deflator.deflate(compressionBuffer.array());\r\n deflator.reset();\r\n\r\n try {\r\n outputStream.writeInt(deflatedSize);\r\n outputStream.writeInt(inflatedSize);\r\n outputStream.write(compressionBuffer.array(), 0, deflatedSize);\r\n }\r\n catch (IOException e) {\r\n throw new RuntimeException(\"Failed to write compressed data to stream\", e);\r\n }\r\n\r\n buffer.clear();\r\n compressionBuffer.clear();\r\n }","@Override\n\t\tpublic void flush() throws IOException {\n\t\t\twriteBlock(true);\n\t\t\tout.flush();\n\n\t\t\t// it's a bit nasty if an exception is thrown from the log,\n\t\t\t// but ignoring it can be nasty as well, so it is decided to\n\t\t\t// let it go so there is feedback about something going wrong\n\t\t\t// it's a bit nasty if an exception is thrown from the log,\n\t\t\t// but ignoring it can be nasty as well, so it is decided to\n\t\t\t// let it go so there is feedback about something going wrong\n\t\t\tif (debug) {\n\t\t\t\tlog.flush();\n\t\t\t}\n\t\t}","@Override\n public void flush() throws IOException {\n checkStreamState();\n flushIOBuffers();\n }","public void flush() throws IOException {\n\t\tmFile.seek(mOffset);\n\t\tmWriter.write(mBuffer, 0, mBufferLength);\n\t\tmOffset += mBufferLength;\n\t\tmBufferLength = 0;\n\t}","public void flush()\r\n\tthrows IOException\r\n\t{\r\n\tgetWriter().flush();\r\n\treturn;\r\n\t}","public void flush() {\n\t\t\n\t}","public void flush()\n/* */ throws IOException\n/* */ {\n/* 833 */ _flushBuffer();\n/* 834 */ if ((this._writer != null) && \n/* 835 */ (isEnabled(JsonGenerator.Feature.FLUSH_PASSED_TO_STREAM))) {\n/* 836 */ this._writer.flush();\n/* */ }\n/* */ }","private void flush() {\n try {\n output.write(digits);\n } catch (IOException e) {\n throw new RuntimeException(e.toString());\n }\n digits = 0;\n numDigits = 0;\n }","public void flush(){\n\t\ttry{\n\t\t\tse.write(buffer, 0, bufferPos);\n\t\t\tbufferPos = 0;\n\t\t\tse.flush();\n\t\t}catch(IOException ioex){\n\t\t\tfailures = true;\n\t\t}\n\t}","public abstract void flush();","public void flush() throws IOException {\n\t\t// TODO implement me\n\t}","public void flush() {\r\n\t\ttry {\r\n\t\t\tdos.flush();\r\n\t\t} catch (IOException e) {\r\n\t\t\t// TODO Auto-generated catch block\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t}","public void flush() throws IOException {\n if (firstMessage != null) {\n writer.messageWrite(firstMessage);\n }\n firstMessage = null;\n }","@Override\r\n public synchronized void flush() throws IOException {\r\n\t\tif ( count != 0 ) {\r\n\t\t writeBuffer(buf, 0, count );\r\n\t\t count = 0;\r\n\t\t}\r\n\t}","void flush() throws IOException;","void flush() throws IOException;","void flush() throws IOException;","@Override\r\n public void flush ()\r\n {\r\n }","public void flush() throws IOException {\n // nothing to do with cached bytes\n }","public void flush(){\r\n mBufferData.clear();\r\n }","@Override\n public void flush() throws IOException {\n }","public void flush()\r\n {\r\n if ( content != null )\r\n {\r\n content.flush();\r\n }\r\n }","@Override\r\n\tpublic void flush() {\n\t\t\r\n\t}","@Override\n public void flush() {\n }","@Override\n public void flush() {\n }","@Override\n public void flush() {\n }","void flush();","void flush();","void flush();","void flush();","void flush();","void flush();","void flush();","void flush();","@Override\n\tpublic void flush() {\n\t\t\n\t}","@Override\n\tpublic void flush() {\n\t\t\n\t}","@Override\n\tpublic void flush() {\n\t\t\n\t}","@Override\n\tpublic void flush() {\n\t\t\n\t}","public synchronized void flush() throws IOException {\n if (sink != null) {\n synchronized (sink) {\n sink.notifyAll();\n }\n }\n }","@Override\r\n\tpublic void flush() {\n\t}","@Override\n public void flush()\n {\n }","@Override\n\tpublic void flush() {\n\t}","void flushToOutputStream(OutputStream outputStream) throws IOException;","@Override\n\tpublic void flushBuffer() throws IOException {\n\t}","@Override\n public void flush () throws IOException\n {\n if ((null == _topParts) || (null == _mmDelimiter))\n throw new EOFException(\"No parsing in progress to flush\");\n if (null == this.out)\n throw new EOFException(\"No underlying output stream to flush\");\n this.out.flush();\n }","public void flush() {\n mMessages.postToServer();\n }","public void flush() throws IOException {\n dos.flush();\n }","public void flush() throws Exception{\r\n\tout.flush();\r\n}","static public void flushPrintStream() {\n \t out.flush();\n }","void flush() throws Exception;","public void close() {\n try { out.flush(); } catch (Exception e) {}; // just to be sure\n \n cleanup();\n }","private void flush() {\n try {\n final int flushResult = Mp3EncoderWrap.newInstance().encodeFlush(mp3Buffer);\n Log.d(TAG, \"===zhongjihao====flush mp3Buffer: \"+mp3Buffer+\" flush size: \"+flushResult);\n if (flushResult > 0) {\n mp3File.write(mp3Buffer, 0, flushResult);\n }\n } catch (Exception e) {\n e.printStackTrace();\n } finally {\n try {\n mp3File.close();\n } catch (Exception e) {\n e.printStackTrace();\n }\n Log.d(TAG, \"===zhongjihao====destroy===mp3 encoder====\");\n Mp3EncoderWrap.newInstance().destroyMp3Encoder();\n }\n }","protected void finish() {\n writerServerTimingHeader();\n\n try {\n\n // maybe nobody ever call getOutputStream() or getWriter()\n if (bufferedOutputStream != null) {\n\n // make sure the writer flushes everything to the underlying output stream\n if (bufferedWriter != null) {\n bufferedWriter.flush();\n }\n\n // send the buffered response to the client\n bufferedOutputStream.writeBufferTo(getResponse().getOutputStream());\n\n }\n\n } catch (IOException e) {\n throw new IllegalStateException(\"Could not flush response buffer\", e);\n }\n\n }","public void flush() throws IOException {\n\t\tif ((buffer.length - cursor) > 50000) {\n\t\t\tSystem.out.println(\"WASTED: \" + (buffer.length - cursor));\n\t\t}\n\t}","void flush() throws EDIStreamException;","protected void deferFlush()\n {\n // push next flush out to avoid attempts at multiple simultaneous\n // flushes\n m_lNextFlush = Long.MAX_VALUE;\n }","void flush() {\r\n synchronized (sync) {\r\n updatedFiles.clear();\r\n }\r\n }","@Override\n public void flush() throws IOException {\n ConsoleRedirect.this.flush(buffer, 0, pos);\n pos = 0;\n }","@Override\n public void flushBuffer() throws IOException {\n\n }","public void close() {\n this.output.flush();\n this.output.close();\n }","@Override\n public void close() throws IOException {\n flush();\n }","public void flush() {\r\n if (SwingUtilities.isEventDispatchThread()) {\r\n flushImpl();\r\n } else {\r\n synchronized (this) {\r\n if (!flusherRunning) {\r\n SwingUtilities.invokeLater(flusher);\r\n flusherRunning = true;\r\n }\r\n }\r\n }\r\n }","public void flush() {\n renderMesh();\n }","public void flush () {\n\t\ttracker.flush();\n\t}","public void flush () throws IOException\n {\n if (m_nBufferedBitCount > 0)\n {\n if (m_nBufferedBitCount != CGlobal.BITS_PER_BYTE)\n if (LOGGER.isDebugEnabled ())\n LOGGER.debug (\"Flushing BitOutputStream with only \" + m_nBufferedBitCount + \" bits\");\n m_aOS.write ((byte) m_nBuffer);\n m_nBufferedBitCount = 0;\n m_nBuffer = 0;\n }\n }","public boolean isFlushed() {\n return flushed;\n }","public void flushStreamSpecs();","public void close() {\n if (this.out == null) {\n return;\n }\n try {\n this.out.flush();\n this.out.close();\n this.out = null;\n } catch (IOException e) {\n e.printStackTrace();\n }\n }","@Override\n public void hflush() throws IOException {\n hsync();\n }","@Override\n public void flush() throws IOException {\n FileDescriptor myFd = fd;\n if (myFd == null) throw new IOException(\"socket closed\");\n\n // Loop until the output buffer is empty.\n Int32Ref pending = new Int32Ref(0);\n while (true) {\n try {\n // See linux/net/unix/af_unix.c\n Os.ioctlInt(myFd, OsConstants.TIOCOUTQ, pending);\n } catch (ErrnoException e) {\n throw e.rethrowAsIOException();\n }\n\n if (pending.value <= 0) {\n // The output buffer is empty.\n break;\n }\n\n try {\n Thread.sleep(10);\n } catch (InterruptedException ie) {\n break;\n }\n }\n }","@Override\n public void flush() {\n new QueueConsumer().run();\n }","public void flush() {\r\n // Flushing is required only if there are written bytes in\r\n // the current data element.\r\n if (bytenum != 0) {\r\n data[offset] = elem;\r\n }\r\n }","public void close() throws IOException\n {\n try\n {\n flush();\n }\n catch (IOException ignored)\n {\n // ignore\n }\n getStream().close();\n }","public void flushBuffer() throws IOException {\n this.response.flushBuffer();\n }","public void flush() throws IOException{\r\n if(closed){\r\n throw new IOException(\"The stream is not open.\");\r\n }\r\n // the newline character should not be necessary. The PrintWriter\r\n // should autmatically put the newline, but it doesn't seem to work\r\n textArea.append(getBuffer().toString());\r\n if(System.getProperty(\"java.version\").startsWith(\"1.1\")){\r\n textArea.append(\"\\n\");\r\n }\r\n textArea.setCaretPosition(textArea.getDocument().getLength());\r\n buffer = new StringBuffer();\r\n }","@Override\r\n public void flush() {\n\r\n }","private void flushData()\n {\n try\n {\n while(state.get().ordinal() < SimulationState.TEARING_DOWN.ordinal() || !flushing.isEmpty())\n {\n ICardinality cardinality = flushing.poll(1, TimeUnit.MILLISECONDS);\n if (cardinality == null)\n continue;\n\n long numToFlush = cardinality.cardinality();\n counters.numFlushed.addAndGet(numToFlush);\n generateSSTables(cardinality, numToFlush, partitioner.getMinimumToken(), partitioner.getMaximumToken(), \"flushing\", true);\n }\n }\n catch (InterruptedException e)\n {\n logger.error(\"Exception happen during flushing\", e);\n }\n }","private void flush() throws IOException {\n if (!rates.isEmpty()) {\n writeRates();\n rates.clear();\n firstBatch = false;\n }\n }","@Override\r\n public void flush() {\n\r\n }","public void flushEvent()\n throws SAXException;","public synchronized void flush() throws java.io.IOException { throw new RuntimeException(\"Stub!\"); }","private void flush() {\n\t\ttry {\n\t\t\tif (mResultSet != null) {\n\t\t\t\tmResultSet.close();\n\t\t\t}\n\n\t\t\tif (mStatement != null) {\n\t\t\t\tmStatement.close();\n\t\t\t}\n\t\t} catch (Exception e) {\n\n\t\t}\n\t}","@Override\r\n\tpublic void flushAll() {\n\t\t\r\n\t}"],"string":"[\n \"public void flush() {\\n wasFlushed = true;\\n }\",\n \"public void flush() throws IOException\\n {\\n getStream().flush();\\n }\",\n \"public static void flush() {\\n if (outputEnabled)\\n out.flush();\\n }\",\n \"public synchronized void flush() {\\n\\t\\ttry {\\n\\t\\t\\tcloseWriter();\\n\\t\\t} catch(IOException ioe ) {\\n\\t\\t\\tioe.printStackTrace();\\n\\t\\t}\\n\\n\\t\\ttry {\\n\\t\\t\\topenWriter(true);\\n\\t\\t} catch(IOException ioe ) {\\n\\t\\t\\tioe.printStackTrace();\\n\\t\\t}\\n\\t}\",\n \"@Override\\n public void flush() throws IOException {\\n byteBufferStreamOutput.flush();\\n }\",\n \"public void flush() {\\n writer.flush();\\n }\",\n \"public void flush() {\\n flushed = true;\\n }\",\n \"public void flush() throws IOException {\\n try {\\n out.flush();\\n } catch (IOException ioe) {\\n String msg = \\\"Failed to flush \\\" + this;\\n LOG.error(msg, ioe);\\n throw new IOException(msg, ioe);\\n }\\n }\",\n \"public void flush() throws IOException {\\n mPrintWriter.flush();\\n }\",\n \"@Override\\n public void flush()\\n throws XMLStreamException\\n {\\n try {\\n mWriter.flush();\\n } catch (IOException ie) {\\n throw new WstxIOException(ie);\\n }\\n }\",\n \"public void flush() throws IOException;\",\n \"public void flush() throws IOException;\",\n \"public void flush() throws IOException;\",\n \"public synchronized void flush() throws IOException {\\n\\t\\tcheckNotClosed();\\n\\t\\ttrimToSize();\\n\\t\\tjournalWriter.flush();\\n\\t}\",\n \"public void flush();\",\n \"public void flush();\",\n \"public void flush();\",\n \"public void flush();\",\n \"public void flush() {\\n\\r\\n int inflatedSize = buffer.position();\\r\\n deflator.setInput(buffer.getBuffer(), 0, inflatedSize);\\r\\n deflator.finish();\\r\\n int deflatedSize = deflator.deflate(compressionBuffer.array());\\r\\n deflator.reset();\\r\\n\\r\\n try {\\r\\n outputStream.writeInt(deflatedSize);\\r\\n outputStream.writeInt(inflatedSize);\\r\\n outputStream.write(compressionBuffer.array(), 0, deflatedSize);\\r\\n }\\r\\n catch (IOException e) {\\r\\n throw new RuntimeException(\\\"Failed to write compressed data to stream\\\", e);\\r\\n }\\r\\n\\r\\n buffer.clear();\\r\\n compressionBuffer.clear();\\r\\n }\",\n \"@Override\\n\\t\\tpublic void flush() throws IOException {\\n\\t\\t\\twriteBlock(true);\\n\\t\\t\\tout.flush();\\n\\n\\t\\t\\t// it's a bit nasty if an exception is thrown from the log,\\n\\t\\t\\t// but ignoring it can be nasty as well, so it is decided to\\n\\t\\t\\t// let it go so there is feedback about something going wrong\\n\\t\\t\\t// it's a bit nasty if an exception is thrown from the log,\\n\\t\\t\\t// but ignoring it can be nasty as well, so it is decided to\\n\\t\\t\\t// let it go so there is feedback about something going wrong\\n\\t\\t\\tif (debug) {\\n\\t\\t\\t\\tlog.flush();\\n\\t\\t\\t}\\n\\t\\t}\",\n \"@Override\\n public void flush() throws IOException {\\n checkStreamState();\\n flushIOBuffers();\\n }\",\n \"public void flush() throws IOException {\\n\\t\\tmFile.seek(mOffset);\\n\\t\\tmWriter.write(mBuffer, 0, mBufferLength);\\n\\t\\tmOffset += mBufferLength;\\n\\t\\tmBufferLength = 0;\\n\\t}\",\n \"public void flush()\\r\\n\\tthrows IOException\\r\\n\\t{\\r\\n\\tgetWriter().flush();\\r\\n\\treturn;\\r\\n\\t}\",\n \"public void flush() {\\n\\t\\t\\n\\t}\",\n \"public void flush()\\n/* */ throws IOException\\n/* */ {\\n/* 833 */ _flushBuffer();\\n/* 834 */ if ((this._writer != null) && \\n/* 835 */ (isEnabled(JsonGenerator.Feature.FLUSH_PASSED_TO_STREAM))) {\\n/* 836 */ this._writer.flush();\\n/* */ }\\n/* */ }\",\n \"private void flush() {\\n try {\\n output.write(digits);\\n } catch (IOException e) {\\n throw new RuntimeException(e.toString());\\n }\\n digits = 0;\\n numDigits = 0;\\n }\",\n \"public void flush(){\\n\\t\\ttry{\\n\\t\\t\\tse.write(buffer, 0, bufferPos);\\n\\t\\t\\tbufferPos = 0;\\n\\t\\t\\tse.flush();\\n\\t\\t}catch(IOException ioex){\\n\\t\\t\\tfailures = true;\\n\\t\\t}\\n\\t}\",\n \"public abstract void flush();\",\n \"public void flush() throws IOException {\\n\\t\\t// TODO implement me\\n\\t}\",\n \"public void flush() {\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tdos.flush();\\r\\n\\t\\t} catch (IOException e) {\\r\\n\\t\\t\\t// TODO Auto-generated catch block\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public void flush() throws IOException {\\n if (firstMessage != null) {\\n writer.messageWrite(firstMessage);\\n }\\n firstMessage = null;\\n }\",\n \"@Override\\r\\n public synchronized void flush() throws IOException {\\r\\n\\t\\tif ( count != 0 ) {\\r\\n\\t\\t writeBuffer(buf, 0, count );\\r\\n\\t\\t count = 0;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"void flush() throws IOException;\",\n \"void flush() throws IOException;\",\n \"void flush() throws IOException;\",\n \"@Override\\r\\n public void flush ()\\r\\n {\\r\\n }\",\n \"public void flush() throws IOException {\\n // nothing to do with cached bytes\\n }\",\n \"public void flush(){\\r\\n mBufferData.clear();\\r\\n }\",\n \"@Override\\n public void flush() throws IOException {\\n }\",\n \"public void flush()\\r\\n {\\r\\n if ( content != null )\\r\\n {\\r\\n content.flush();\\r\\n }\\r\\n }\",\n \"@Override\\r\\n\\tpublic void flush() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n public void flush() {\\n }\",\n \"@Override\\n public void flush() {\\n }\",\n \"@Override\\n public void flush() {\\n }\",\n \"void flush();\",\n \"void flush();\",\n \"void flush();\",\n \"void flush();\",\n \"void flush();\",\n \"void flush();\",\n \"void flush();\",\n \"void flush();\",\n \"@Override\\n\\tpublic void flush() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void flush() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void flush() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void flush() {\\n\\t\\t\\n\\t}\",\n \"public synchronized void flush() throws IOException {\\n if (sink != null) {\\n synchronized (sink) {\\n sink.notifyAll();\\n }\\n }\\n }\",\n \"@Override\\r\\n\\tpublic void flush() {\\n\\t}\",\n \"@Override\\n public void flush()\\n {\\n }\",\n \"@Override\\n\\tpublic void flush() {\\n\\t}\",\n \"void flushToOutputStream(OutputStream outputStream) throws IOException;\",\n \"@Override\\n\\tpublic void flushBuffer() throws IOException {\\n\\t}\",\n \"@Override\\n public void flush () throws IOException\\n {\\n if ((null == _topParts) || (null == _mmDelimiter))\\n throw new EOFException(\\\"No parsing in progress to flush\\\");\\n if (null == this.out)\\n throw new EOFException(\\\"No underlying output stream to flush\\\");\\n this.out.flush();\\n }\",\n \"public void flush() {\\n mMessages.postToServer();\\n }\",\n \"public void flush() throws IOException {\\n dos.flush();\\n }\",\n \"public void flush() throws Exception{\\r\\n\\tout.flush();\\r\\n}\",\n \"static public void flushPrintStream() {\\n \\t out.flush();\\n }\",\n \"void flush() throws Exception;\",\n \"public void close() {\\n try { out.flush(); } catch (Exception e) {}; // just to be sure\\n \\n cleanup();\\n }\",\n \"private void flush() {\\n try {\\n final int flushResult = Mp3EncoderWrap.newInstance().encodeFlush(mp3Buffer);\\n Log.d(TAG, \\\"===zhongjihao====flush mp3Buffer: \\\"+mp3Buffer+\\\" flush size: \\\"+flushResult);\\n if (flushResult > 0) {\\n mp3File.write(mp3Buffer, 0, flushResult);\\n }\\n } catch (Exception e) {\\n e.printStackTrace();\\n } finally {\\n try {\\n mp3File.close();\\n } catch (Exception e) {\\n e.printStackTrace();\\n }\\n Log.d(TAG, \\\"===zhongjihao====destroy===mp3 encoder====\\\");\\n Mp3EncoderWrap.newInstance().destroyMp3Encoder();\\n }\\n }\",\n \"protected void finish() {\\n writerServerTimingHeader();\\n\\n try {\\n\\n // maybe nobody ever call getOutputStream() or getWriter()\\n if (bufferedOutputStream != null) {\\n\\n // make sure the writer flushes everything to the underlying output stream\\n if (bufferedWriter != null) {\\n bufferedWriter.flush();\\n }\\n\\n // send the buffered response to the client\\n bufferedOutputStream.writeBufferTo(getResponse().getOutputStream());\\n\\n }\\n\\n } catch (IOException e) {\\n throw new IllegalStateException(\\\"Could not flush response buffer\\\", e);\\n }\\n\\n }\",\n \"public void flush() throws IOException {\\n\\t\\tif ((buffer.length - cursor) > 50000) {\\n\\t\\t\\tSystem.out.println(\\\"WASTED: \\\" + (buffer.length - cursor));\\n\\t\\t}\\n\\t}\",\n \"void flush() throws EDIStreamException;\",\n \"protected void deferFlush()\\n {\\n // push next flush out to avoid attempts at multiple simultaneous\\n // flushes\\n m_lNextFlush = Long.MAX_VALUE;\\n }\",\n \"void flush() {\\r\\n synchronized (sync) {\\r\\n updatedFiles.clear();\\r\\n }\\r\\n }\",\n \"@Override\\n public void flush() throws IOException {\\n ConsoleRedirect.this.flush(buffer, 0, pos);\\n pos = 0;\\n }\",\n \"@Override\\n public void flushBuffer() throws IOException {\\n\\n }\",\n \"public void close() {\\n this.output.flush();\\n this.output.close();\\n }\",\n \"@Override\\n public void close() throws IOException {\\n flush();\\n }\",\n \"public void flush() {\\r\\n if (SwingUtilities.isEventDispatchThread()) {\\r\\n flushImpl();\\r\\n } else {\\r\\n synchronized (this) {\\r\\n if (!flusherRunning) {\\r\\n SwingUtilities.invokeLater(flusher);\\r\\n flusherRunning = true;\\r\\n }\\r\\n }\\r\\n }\\r\\n }\",\n \"public void flush() {\\n renderMesh();\\n }\",\n \"public void flush () {\\n\\t\\ttracker.flush();\\n\\t}\",\n \"public void flush () throws IOException\\n {\\n if (m_nBufferedBitCount > 0)\\n {\\n if (m_nBufferedBitCount != CGlobal.BITS_PER_BYTE)\\n if (LOGGER.isDebugEnabled ())\\n LOGGER.debug (\\\"Flushing BitOutputStream with only \\\" + m_nBufferedBitCount + \\\" bits\\\");\\n m_aOS.write ((byte) m_nBuffer);\\n m_nBufferedBitCount = 0;\\n m_nBuffer = 0;\\n }\\n }\",\n \"public boolean isFlushed() {\\n return flushed;\\n }\",\n \"public void flushStreamSpecs();\",\n \"public void close() {\\n if (this.out == null) {\\n return;\\n }\\n try {\\n this.out.flush();\\n this.out.close();\\n this.out = null;\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n }\",\n \"@Override\\n public void hflush() throws IOException {\\n hsync();\\n }\",\n \"@Override\\n public void flush() throws IOException {\\n FileDescriptor myFd = fd;\\n if (myFd == null) throw new IOException(\\\"socket closed\\\");\\n\\n // Loop until the output buffer is empty.\\n Int32Ref pending = new Int32Ref(0);\\n while (true) {\\n try {\\n // See linux/net/unix/af_unix.c\\n Os.ioctlInt(myFd, OsConstants.TIOCOUTQ, pending);\\n } catch (ErrnoException e) {\\n throw e.rethrowAsIOException();\\n }\\n\\n if (pending.value <= 0) {\\n // The output buffer is empty.\\n break;\\n }\\n\\n try {\\n Thread.sleep(10);\\n } catch (InterruptedException ie) {\\n break;\\n }\\n }\\n }\",\n \"@Override\\n public void flush() {\\n new QueueConsumer().run();\\n }\",\n \"public void flush() {\\r\\n // Flushing is required only if there are written bytes in\\r\\n // the current data element.\\r\\n if (bytenum != 0) {\\r\\n data[offset] = elem;\\r\\n }\\r\\n }\",\n \"public void close() throws IOException\\n {\\n try\\n {\\n flush();\\n }\\n catch (IOException ignored)\\n {\\n // ignore\\n }\\n getStream().close();\\n }\",\n \"public void flushBuffer() throws IOException {\\n this.response.flushBuffer();\\n }\",\n \"public void flush() throws IOException{\\r\\n if(closed){\\r\\n throw new IOException(\\\"The stream is not open.\\\");\\r\\n }\\r\\n // the newline character should not be necessary. The PrintWriter\\r\\n // should autmatically put the newline, but it doesn't seem to work\\r\\n textArea.append(getBuffer().toString());\\r\\n if(System.getProperty(\\\"java.version\\\").startsWith(\\\"1.1\\\")){\\r\\n textArea.append(\\\"\\\\n\\\");\\r\\n }\\r\\n textArea.setCaretPosition(textArea.getDocument().getLength());\\r\\n buffer = new StringBuffer();\\r\\n }\",\n \"@Override\\r\\n public void flush() {\\n\\r\\n }\",\n \"private void flushData()\\n {\\n try\\n {\\n while(state.get().ordinal() < SimulationState.TEARING_DOWN.ordinal() || !flushing.isEmpty())\\n {\\n ICardinality cardinality = flushing.poll(1, TimeUnit.MILLISECONDS);\\n if (cardinality == null)\\n continue;\\n\\n long numToFlush = cardinality.cardinality();\\n counters.numFlushed.addAndGet(numToFlush);\\n generateSSTables(cardinality, numToFlush, partitioner.getMinimumToken(), partitioner.getMaximumToken(), \\\"flushing\\\", true);\\n }\\n }\\n catch (InterruptedException e)\\n {\\n logger.error(\\\"Exception happen during flushing\\\", e);\\n }\\n }\",\n \"private void flush() throws IOException {\\n if (!rates.isEmpty()) {\\n writeRates();\\n rates.clear();\\n firstBatch = false;\\n }\\n }\",\n \"@Override\\r\\n public void flush() {\\n\\r\\n }\",\n \"public void flushEvent()\\n throws SAXException;\",\n \"public synchronized void flush() throws java.io.IOException { throw new RuntimeException(\\\"Stub!\\\"); }\",\n \"private void flush() {\\n\\t\\ttry {\\n\\t\\t\\tif (mResultSet != null) {\\n\\t\\t\\t\\tmResultSet.close();\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (mStatement != null) {\\n\\t\\t\\t\\tmStatement.close();\\n\\t\\t\\t}\\n\\t\\t} catch (Exception e) {\\n\\n\\t\\t}\\n\\t}\",\n \"@Override\\r\\n\\tpublic void flushAll() {\\n\\t\\t\\r\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.75294834","0.73114276","0.7289606","0.7164379","0.71445906","0.70890856","0.69873977","0.68884796","0.6833588","0.682276","0.68087804","0.68087804","0.68087804","0.67931044","0.6788341","0.6788341","0.6788341","0.6788341","0.6774422","0.6735276","0.67298067","0.67288727","0.67227405","0.6709895","0.6685825","0.66590786","0.6640151","0.65943813","0.6582967","0.6569456","0.65625983","0.65571827","0.6503751","0.6503751","0.6503751","0.6501189","0.64950365","0.6469978","0.6455921","0.64457303","0.6426386","0.6366622","0.6366622","0.6366622","0.63583386","0.63583386","0.63583386","0.63583386","0.63583386","0.63583386","0.63583386","0.63583386","0.63459563","0.63459563","0.63459563","0.63459563","0.63445306","0.6313955","0.6300498","0.62420154","0.61438936","0.6136186","0.6132334","0.61221063","0.61084384","0.6072604","0.60615736","0.6058717","0.6027275","0.6025469","0.5989358","0.59513885","0.5929456","0.5918468","0.59112567","0.58858424","0.5841442","0.58395827","0.58357805","0.5834828","0.58156145","0.58095765","0.57966805","0.5789755","0.57822776","0.57738686","0.574976","0.57364774","0.57201415","0.57019556","0.57016045","0.5696319","0.56905544","0.5689429","0.5670722","0.566709","0.56625575","0.565407","0.5644526","0.5606351","0.5587362"],"string":"[\n \"0.75294834\",\n \"0.73114276\",\n \"0.7289606\",\n \"0.7164379\",\n \"0.71445906\",\n \"0.70890856\",\n \"0.69873977\",\n \"0.68884796\",\n \"0.6833588\",\n \"0.682276\",\n \"0.68087804\",\n \"0.68087804\",\n \"0.68087804\",\n \"0.67931044\",\n \"0.6788341\",\n \"0.6788341\",\n \"0.6788341\",\n \"0.6788341\",\n \"0.6774422\",\n \"0.6735276\",\n \"0.67298067\",\n \"0.67288727\",\n \"0.67227405\",\n \"0.6709895\",\n \"0.6685825\",\n \"0.66590786\",\n \"0.6640151\",\n \"0.65943813\",\n \"0.6582967\",\n \"0.6569456\",\n \"0.65625983\",\n \"0.65571827\",\n \"0.6503751\",\n \"0.6503751\",\n \"0.6503751\",\n \"0.6501189\",\n \"0.64950365\",\n \"0.6469978\",\n \"0.6455921\",\n \"0.64457303\",\n \"0.6426386\",\n \"0.6366622\",\n \"0.6366622\",\n \"0.6366622\",\n \"0.63583386\",\n \"0.63583386\",\n \"0.63583386\",\n \"0.63583386\",\n \"0.63583386\",\n \"0.63583386\",\n \"0.63583386\",\n \"0.63583386\",\n \"0.63459563\",\n \"0.63459563\",\n \"0.63459563\",\n \"0.63459563\",\n \"0.63445306\",\n \"0.6313955\",\n \"0.6300498\",\n \"0.62420154\",\n \"0.61438936\",\n \"0.6136186\",\n \"0.6132334\",\n \"0.61221063\",\n \"0.61084384\",\n \"0.6072604\",\n \"0.60615736\",\n \"0.6058717\",\n \"0.6027275\",\n \"0.6025469\",\n \"0.5989358\",\n \"0.59513885\",\n \"0.5929456\",\n \"0.5918468\",\n \"0.59112567\",\n \"0.58858424\",\n \"0.5841442\",\n \"0.58395827\",\n \"0.58357805\",\n \"0.5834828\",\n \"0.58156145\",\n \"0.58095765\",\n \"0.57966805\",\n \"0.5789755\",\n \"0.57822776\",\n \"0.57738686\",\n \"0.574976\",\n \"0.57364774\",\n \"0.57201415\",\n \"0.57019556\",\n \"0.57016045\",\n \"0.5696319\",\n \"0.56905544\",\n \"0.5689429\",\n \"0.5670722\",\n \"0.566709\",\n \"0.56625575\",\n \"0.565407\",\n \"0.5644526\",\n \"0.5606351\",\n \"0.5587362\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":29384,"cells":{"query":{"kind":"string","value":"Closes the stream, flushing it first."},"document":{"kind":"string","value":"@Override\n public void close() throws IOException\n {\n debug(\"Dispose remote console server.\");\n // this method tries its best and as a least resort uses thread interruption\n synchronized(this) {\n try {\n // try to break server.accept in order to force queue reading on thread\n Socket socket = new Socket();\n socket.connect(new InetSocketAddress(port), 500);\n socket.close();\n }\n catch(IOException e) {\n error(e);\n }\n\n queue.clear();\n queue.offer(SHUTDOWN);\n\n try {\n wait(SHUTDOWN_TIMEOUT);\n }\n catch(InterruptedException unused) {\n thread.interrupt();\n }\n }\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["public void closeStream() {\n output.close();\n input.close();\n }","protected void closeStream ()\n {\n stream.close ();\n }","public void closeStream() {\n\t\ttry {\n\t\t\tisReaderStatusClosed = true;\n\t\t\tif(buffReader != null) {\n\t\t\t\tbuffReader.close();\n\t\t\t}\n\t\t} catch(Exception e) { }\n\t}","public void close ()\n {\n StreamHelper.flush (this);\n StreamHelper.close (m_aOS);\n m_aOS = null;\n }","public void close() throws IOException\n {\n try\n {\n flush();\n }\n catch (IOException ignored)\n {\n // ignore\n }\n getStream().close();\n }","public void close() {\n try { out.flush(); } catch (Exception e) {}; // just to be sure\n \n cleanup();\n }","public void close() throws IOException {\n open = false;\n stream.close();\n }","private void closeStream() throws IOException {\n if (originalInputStream != inputStream) {\n // Close the byte input stream or file input stream, if either is the current one\n inputStream.close();\n }\n\n if (closeOriginalStreamOnClose) {\n originalInputStream.close();\n }\n }","@Override\n public void close() throws IOException {\n flush();\n }","public void close() {\r\n\t\tflush();\r\n\t\ttry {\r\n\t\t\tdos.close();\r\n\t\t\ts.close();\r\n\t\t} catch (IOException e) {\r\n\t\t\t// TODO Auto-generated catch block\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\r\n\t}","private void close() {\n try {\n if (reader != null) {\n this.reader.close();\n }\n if (writer != null) {\n this.writer.close();\n }\n }\n catch (IOException e) {\n log.error(e);\n log.debug(Constants.STREAM_IS_CLOSED);\n }\n }","public void close() {\n this.output.flush();\n this.output.close();\n }","public void finish( OutputStream stream ) throws IOException\n {\n }","protected void close() {\n\t\tif(sOutput != null) {\n\t\t\ttry {\n\t\t\t\tsOutput.close();\n\t\t\t} catch (IOException e) {\n\t\t\t\tSystem.err.println(\"error closing output stream\");\n\t\t\t}\n\t\t\t\n\t\t\tsOutput = null;\n\t\t}\n\t}","public static void end()\n {\n if(out!=null) {\n out.println(\"close \" + name);\n out.flush();\n }\n }","public synchronized void close() throws IOException {\n\t\t\tfinish();\n\t\t\tout.close();\n\t\t}","public void close() throws IOException {\n\t\tif (keyClass != null) {\n\t\t keySerializer.close();\n\t\t valueSerializer.close();\n\t\t}\n\n\t\t// Write EOF_MARKER for key/value length\n\t\tWritableUtils.writeVInt(out, EOF_MARKER);\n\t\tWritableUtils.writeVInt(out, EOF_MARKER);\n\t\tdecompressedBytesWritten += 2 * WritableUtils.getVIntSize(EOF_MARKER);\n \n\t\t//Flush the stream\n\t\tout.flush();\n \n\t\tif (compressOutput) {\n\t\t // Flush\n\t\t compressedOut.finish();\n\t\t compressedOut.resetState();\n\t\t}\n \n\t\t// Close the underlying stream iff we own it...\n\t\tif (ownOutputStream) {\n\t\t out.close();\n\t\t}\n\t\telse {\n\t\t // Write the checksum\n\t\t checksumOut.finish();\n\t\t}\n\n\t\tcompressedBytesWritten = rawOut.getPos() - start;\n\n\t\tif (compressOutput) {\n\t\t // Return back the compressor\n\t\t CodecPool.returnCompressor(compressor);\n\t\t compressor = null;\n\t\t}\n\n\t\tout = null;\n\t\tif(writtenRecordsCounter != null) {\n\t\t writtenRecordsCounter.increment(numRecordsWritten);\n\t\t}\n\t }","public void close() throws IOException {\n\t\tout.flush();\n\t\tout.close();\n\t}","public void flush() throws IOException\n {\n getStream().flush();\n }","public void close()\n\t{\n\t\ttry { stream.close(); } catch(Exception ex1) {}\n\t\ttry { channel.close(); } catch(Exception ex2) {}\n\t}","@Override\n public void close() {\n LOG.info(\"Closing stream writer:\" + streamName);\n shutdown();\n try {\n awaitTermination(1, TimeUnit.MINUTES);\n } catch (InterruptedException ignored) {\n }\n }","public void close() {\n if (this.out == null) {\n return;\n }\n try {\n this.out.flush();\n this.out.close();\n this.out = null;\n } catch (IOException e) {\n e.printStackTrace();\n }\n }","public void close() throws IOException {\n if (sink != null) {\n sink.receivedLast();\n }\n }","public void close() throws IOException {\n\t\tthis.finish();\n\t\tthis.buffer.close();\n\t\t}","public void close()\n throws IOException\n {\n outstream.close();\n }","private void close() {\n\t\tif (socketChannel != null) {\n\t\t\ttry {\n\t\t\t\tif (in != null) {\n\t\t\t\t\tin.close();\n\t\t\t\t}\n\t\t\t} catch (IOException e) {\n\t\t\t\tlog.log(Level.SEVERE, \"Close in stream \", e);\n\t\t\t}\n\t\t\ttry {\n\t\t\t\tif (out != null) {\n\t\t\t\t\tout.close();\n\t\t\t\t}\n\t\t\t} catch (IOException e) {\n\t\t\t\tlog.log(Level.SEVERE, \"Close out stream \", e);\n\t\t\t}\n\t\t\ttry {\n\t\t\t\tsocketChannel.close();\n\t\t\t} catch (IOException ex) {\n\t\t\t\tlog.log(Level.SEVERE, \"Can't close socket channel\", ex);\n\t\t\t}\n\n\t\t}\n\t\t//Defender.stopConnection();\n\t}","protected void onEndOfStream()\n {\n synchronized (f_aBuffSingleInbound)\n {\n synchronized (f_aBuffSingleOutbound)\n {\n if (f_engine.getSession().isValid())\n {\n try\n {\n f_engine.closeInbound();\n closeOutbound(false);\n }\n catch (SSLException e)\n {\n // mimicking SSLSocket\n }\n catch (IOException ignored)\n {\n // won't occur\n }\n }\n }\n }\n }","public synchronized void close() {\n try {\n audioInputStream.close();\n } catch (IOException ioe) {\n System.err.println(\"Problem while closing the audioInputSteam\");\n }\n\n }","public static void closeIO()\r\n\t{\n\t\ttry\r\n\t\t{\r\n\t\t\tinStream.close();\r\n\t\t\toutStream.close();\r\n\t\t}\r\n\t\tcatch(IOException e)\r\n\t\t{\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t}","private void closeOutputStream() {\n\t\tPrintStreamManagement.closeOutputStream();\n\t}","public void close() {\n if (numDigits > 0)\n flush();\n try {\n output.close();\n } catch (IOException e) {\n throw new RuntimeException(e.toString());\n }\n }","@Override\n public void close() throws IOException {\n opened = false;\n if (socket != null) {\n Utils.closeSilent(dis);\n Utils.closeSilent(dos);\n socket.close();\n }\n }","@Override\n public void close() {\n backingIterator.close();\n outputBuffer.close();\n isClosed = true;\n }","public void close() throws IOException {\n\t\tistream.close();\n\t\tostream.close();\n\t\tsocket.close();\n\t}","public void close()\r\n\t{\r\n\t if (isOpen()) try {\r\n\t \tfd.close();\r\n\t } catch (IOException ex) {\r\n\t \t/* do nothing */\r\n\t } finally {\r\n\t\t thisc = EOF;\r\n\t\t holdc = EOF;\r\n\t\t fd = null;\r\n\t }\r\n\t}","@Override\n\t public synchronized void close() throws IOException {\n\t\tout.close();\n\t\topen = false;\n\t }","protected void close()\n {\n out.close();\n }","public void close() throws IOException {\n maxStreamPos = cache.length();\n\n seek(maxStreamPos);\n flushBefore(maxStreamPos);\n super.close();\n cache.close();\n cache = null;\n cacheFile.delete();\n cacheFile = null;\n stream.flush();\n stream = null;\n StreamCloser.removeFromQueue(closeAction);\n }","public void close(){\n\t\ttry{\n\t\t\tflush();\n\t\t\tse.close();\n\t\t}catch(IOException ioex){\n\t\t\tfailures = true;\n\t\t}\n\t}","public static void closeStreamAndForceCompleteResponse() throws IOException {\n FacesContext fc = FacesContext.getCurrentInstance();\n ExternalContext ex = Faces.getExternalContext();\n ex.getResponseOutputStream().flush();\n ex.getResponseOutputStream().close();\n fc.responseComplete();\n }","@Override\n public void close() throws IOException {\n input.close();\n }","public void close() {\n try {\n socket.close();\n outputStream.close();\n inputStream.close();\n } catch (Exception e) {\n e.printStackTrace();\n }\n }","public void close() {\n\t\ttry {\n\t\t\t_inputStream.close();\n\t\t\t_outputStream.close();\n\t\t\t_socket.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\n\t}","private static void closeStream(@javax.annotation.Nullable Closeable stream) {\n if (stream != null) {\n try {\n stream.close();\n } catch (IOException e) {\n // ignore\n }\n }\n }","@Override\n public void onClose() {\n logger.info(\"Closing {} streams for file {}\", this.getTransferType(), this.getResource().file);\n try {\n if (inputChannel != null) {\n inputChannel.close();\n inputChannel = null;\n inputBuffer.clear();\n inputBuffer = null;\n }\n if (outputStream != null) {\n outputStream.close();\n outputStream = null;\n }\n } catch (IOException e) {\n e.printStackTrace();\n }\n }","@Override\n public void close() throws IOException\n {\n InputStream in = _inputSource;\n\n if (in != null) {\n _inputSource = null;\n if (_autoClose) {\n in.close();\n }\n }\n freeBuffers();\n }","private void close()\n {\n try\n {\n if (outputStream != null)\n {\n outputStream.close();\n }\n } catch (Exception e)\n {\n\n }\n try\n {\n if (inputStream != null)\n {\n inputStream.close();\n }\n } catch (Exception e)\n {\n\n }\n try\n {\n if (socket != null)\n {\n socket.close();\n }\n } catch (Exception e)\n {\n\n }\n }","public void close() throws FormatException, IOException {\n if (in != null) in.close();\n in = null;\n currentId = null;\n }","public void close() throws IOException {\n\t\tin.close();\n \n\t\t// Release the buffer\n\t\tdataIn = null;\n\t\tbuffer = null;\n\t\tif(readRecordsCounter != null) {\n\t\t readRecordsCounter.increment(numRecordsRead);\n\t\t}\n\n\t\t// Return the decompressor\n\t\tif (decompressor != null) {\n\t\t decompressor.reset();\n\t\t CodecPool.returnDecompressor(decompressor);\n\t\t decompressor = null;\n\t\t}\n\t }","@Override\n\t public synchronized void close() throws IOException {\n\t\tin.close();\n\t\topen = false;\n\t }","public void close() throws IOException {\n isClosed = true;\n inputStreamOpened = false;\n outputStreamOpened = false;\n parent.setInactive();\n }","public void streamSubscriberClose(ISubscriberStream stream);","@Override\n\tpublic void close() throws IOException {\n\t\tLog.d(TAG, \"rtsp data source close!\");\n\t\tif (_RtspClient != null) {\n\t\t\t_RtspClient.shutdown();\n\t\t}\n\t}","private void closeStreams() {\n try {\n System.out.println(\"Closing streams and terminating thread.\");\n running = false;\n outputStream.close();\n inputStream.close();\n clientSocket.close();\n } catch (IOException e) {\n System.err.println(e.getMessage());\n }\n }","@Override\r\n\tpublic void finish() {\n\t\tsuper.finish();\r\n\t\tif(!s.isClosed()){\r\n\t\t\ttry {\r\n\t\t\t\ts.close();\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\t// TODO Auto-generated catch block\r\n\t\t\t\te.printStackTrace();\r\n\t\t\t}\r\n\t\t}\r\n\t}","public void close() {\n\t\ttry {\n\t\t\tin.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}","public void close() {\n this.output = null;\n }","@Override\n public void close() throws IOException {\n isClosed = true;\n }","@Override\n public void flush() throws IOException {\n byteBufferStreamOutput.flush();\n }","public void ensureInputStreamClosed() {\n if (claimInputStream()) {\n try {\n Closeables.close(_stream, true);\n } catch (IOException e) {\n // Already caught and logged\n }\n }\n }","@Override\n\t\tpublic void close() throws IOException {\n\t\t\tout.close();\n\t\t}","public void flushStreamSpecs();","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; // indicate end of file\n zzEndRead = zzStartRead; // invalidate buffer\n\n if (zzReader != null) {\n zzReader.close();\n }\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; // indicate end of file\n zzEndRead = zzStartRead; // invalidate buffer\n\n if (zzReader != null) {\n zzReader.close();\n }\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n zzAtEOF = true; /* indicate end of file */\n zzEndRead = zzStartRead; /* invalidate buffer */\n\n if (zzReader != null)\n zzReader.close();\n }","public final void yyclose() throws java.io.IOException {\n\t\tzzAtEOF = true; /* indicate end of file */\n\t\tzzEndRead = zzStartRead; /* invalidate buffer */\n\n\t\tif (zzReader != null)\n\t\t\tzzReader.close();\n\t}","protected static void close(InputStream iStream, OutputStream oStream) throws\r\n IOException {\r\n try {\r\n if (iStream != null) {\r\n iStream.close();\r\n }\r\n }\r\n finally {\r\n if (oStream != null) {\r\n oStream.close();\r\n }\r\n }\r\n }","@Override\n protected void done() throws IOException {\n if (this.closeable instanceof Flushable) {\n ((Flushable)((Object)this.closeable)).flush();\n }\n if (!this.ignoreCloseExceptions) {\n this.closeable.close();\n return;\n }\n try {\n this.closeable.close();\n return;\n }\n catch (IOException iOException) {\n return;\n }\n }","@Override\n public void close() throws IOException\n {\n _out.close();\n }","public final void yyclose() throws java.io.IOException {\r\n zzAtEOF = true; /* indicate end of file */\r\n zzEndRead = zzStartRead; /* invalidate buffer */\r\n\r\n if (zzReader != null)\r\n zzReader.close();\r\n }","public final void yyclose() throws java.io.IOException {\r\n zzAtEOF = true; /* indicate end of file */\r\n zzEndRead = zzStartRead; /* invalidate buffer */\r\n\r\n if (zzReader != null)\r\n zzReader.close();\r\n }","public final void yyclose() throws java.io.IOException {\r\n zzAtEOF = true; /* indicate end of file */\r\n zzEndRead = zzStartRead; /* invalidate buffer */\r\n\r\n if (zzReader != null)\r\n zzReader.close();\r\n }","public final void yyclose() throws java.io.IOException {\r\n zzAtEOF = true; /* indicate end of file */\r\n zzEndRead = zzStartRead; /* invalidate buffer */\r\n\r\n if (zzReader != null)\r\n zzReader.close();\r\n }","public final void yyclose() throws java.io.IOException {\r\n zzAtEOF = true; /* indicate end of file */\r\n zzEndRead = zzStartRead; /* invalidate buffer */\r\n\r\n if (zzReader != null)\r\n zzReader.close();\r\n }","@Override\n public void close() throws IOException\n {\n try\n {\n fAVMRemote.closeInputHandle(fTicketHolder.getTicket(), fHandle);\n }\n catch (Exception e)\n {\n throw new IOException(\"Remote Error closing input stream.\");\n }\n }","private void closeStreams() {\n try {\n windowForCommunication.append(\"Closing connection now.\" + \"\\n\");\n sendMessageToClient(\"ENDING CHAT: Closing connection now\");\n input.close();\n output.close();\n serverSocket.close();\n }\n catch(IOException e) {\n System.out.println(e);\n windowForCommunication.append(\"Uh oh. Seems like there was a communication error....!\");\n }\n }","public void close() throws IOException;","public void close() throws IOException;","public void close() throws IOException;"],"string":"[\n \"public void closeStream() {\\n output.close();\\n input.close();\\n }\",\n \"protected void closeStream ()\\n {\\n stream.close ();\\n }\",\n \"public void closeStream() {\\n\\t\\ttry {\\n\\t\\t\\tisReaderStatusClosed = true;\\n\\t\\t\\tif(buffReader != null) {\\n\\t\\t\\t\\tbuffReader.close();\\n\\t\\t\\t}\\n\\t\\t} catch(Exception e) { }\\n\\t}\",\n \"public void close ()\\n {\\n StreamHelper.flush (this);\\n StreamHelper.close (m_aOS);\\n m_aOS = null;\\n }\",\n \"public void close() throws IOException\\n {\\n try\\n {\\n flush();\\n }\\n catch (IOException ignored)\\n {\\n // ignore\\n }\\n getStream().close();\\n }\",\n \"public void close() {\\n try { out.flush(); } catch (Exception e) {}; // just to be sure\\n \\n cleanup();\\n }\",\n \"public void close() throws IOException {\\n open = false;\\n stream.close();\\n }\",\n \"private void closeStream() throws IOException {\\n if (originalInputStream != inputStream) {\\n // Close the byte input stream or file input stream, if either is the current one\\n inputStream.close();\\n }\\n\\n if (closeOriginalStreamOnClose) {\\n originalInputStream.close();\\n }\\n }\",\n \"@Override\\n public void close() throws IOException {\\n flush();\\n }\",\n \"public void close() {\\r\\n\\t\\tflush();\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tdos.close();\\r\\n\\t\\t\\ts.close();\\r\\n\\t\\t} catch (IOException e) {\\r\\n\\t\\t\\t// TODO Auto-generated catch block\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\r\\n\\t}\",\n \"private void close() {\\n try {\\n if (reader != null) {\\n this.reader.close();\\n }\\n if (writer != null) {\\n this.writer.close();\\n }\\n }\\n catch (IOException e) {\\n log.error(e);\\n log.debug(Constants.STREAM_IS_CLOSED);\\n }\\n }\",\n \"public void close() {\\n this.output.flush();\\n this.output.close();\\n }\",\n \"public void finish( OutputStream stream ) throws IOException\\n {\\n }\",\n \"protected void close() {\\n\\t\\tif(sOutput != null) {\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tsOutput.close();\\n\\t\\t\\t} catch (IOException e) {\\n\\t\\t\\t\\tSystem.err.println(\\\"error closing output stream\\\");\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tsOutput = null;\\n\\t\\t}\\n\\t}\",\n \"public static void end()\\n {\\n if(out!=null) {\\n out.println(\\\"close \\\" + name);\\n out.flush();\\n }\\n }\",\n \"public synchronized void close() throws IOException {\\n\\t\\t\\tfinish();\\n\\t\\t\\tout.close();\\n\\t\\t}\",\n \"public void close() throws IOException {\\n\\t\\tif (keyClass != null) {\\n\\t\\t keySerializer.close();\\n\\t\\t valueSerializer.close();\\n\\t\\t}\\n\\n\\t\\t// Write EOF_MARKER for key/value length\\n\\t\\tWritableUtils.writeVInt(out, EOF_MARKER);\\n\\t\\tWritableUtils.writeVInt(out, EOF_MARKER);\\n\\t\\tdecompressedBytesWritten += 2 * WritableUtils.getVIntSize(EOF_MARKER);\\n \\n\\t\\t//Flush the stream\\n\\t\\tout.flush();\\n \\n\\t\\tif (compressOutput) {\\n\\t\\t // Flush\\n\\t\\t compressedOut.finish();\\n\\t\\t compressedOut.resetState();\\n\\t\\t}\\n \\n\\t\\t// Close the underlying stream iff we own it...\\n\\t\\tif (ownOutputStream) {\\n\\t\\t out.close();\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t // Write the checksum\\n\\t\\t checksumOut.finish();\\n\\t\\t}\\n\\n\\t\\tcompressedBytesWritten = rawOut.getPos() - start;\\n\\n\\t\\tif (compressOutput) {\\n\\t\\t // Return back the compressor\\n\\t\\t CodecPool.returnCompressor(compressor);\\n\\t\\t compressor = null;\\n\\t\\t}\\n\\n\\t\\tout = null;\\n\\t\\tif(writtenRecordsCounter != null) {\\n\\t\\t writtenRecordsCounter.increment(numRecordsWritten);\\n\\t\\t}\\n\\t }\",\n \"public void close() throws IOException {\\n\\t\\tout.flush();\\n\\t\\tout.close();\\n\\t}\",\n \"public void flush() throws IOException\\n {\\n getStream().flush();\\n }\",\n \"public void close()\\n\\t{\\n\\t\\ttry { stream.close(); } catch(Exception ex1) {}\\n\\t\\ttry { channel.close(); } catch(Exception ex2) {}\\n\\t}\",\n \"@Override\\n public void close() {\\n LOG.info(\\\"Closing stream writer:\\\" + streamName);\\n shutdown();\\n try {\\n awaitTermination(1, TimeUnit.MINUTES);\\n } catch (InterruptedException ignored) {\\n }\\n }\",\n \"public void close() {\\n if (this.out == null) {\\n return;\\n }\\n try {\\n this.out.flush();\\n this.out.close();\\n this.out = null;\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n }\",\n \"public void close() throws IOException {\\n if (sink != null) {\\n sink.receivedLast();\\n }\\n }\",\n \"public void close() throws IOException {\\n\\t\\tthis.finish();\\n\\t\\tthis.buffer.close();\\n\\t\\t}\",\n \"public void close()\\n throws IOException\\n {\\n outstream.close();\\n }\",\n \"private void close() {\\n\\t\\tif (socketChannel != null) {\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tif (in != null) {\\n\\t\\t\\t\\t\\tin.close();\\n\\t\\t\\t\\t}\\n\\t\\t\\t} catch (IOException e) {\\n\\t\\t\\t\\tlog.log(Level.SEVERE, \\\"Close in stream \\\", e);\\n\\t\\t\\t}\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tif (out != null) {\\n\\t\\t\\t\\t\\tout.close();\\n\\t\\t\\t\\t}\\n\\t\\t\\t} catch (IOException e) {\\n\\t\\t\\t\\tlog.log(Level.SEVERE, \\\"Close out stream \\\", e);\\n\\t\\t\\t}\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tsocketChannel.close();\\n\\t\\t\\t} catch (IOException ex) {\\n\\t\\t\\t\\tlog.log(Level.SEVERE, \\\"Can't close socket channel\\\", ex);\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t\\t//Defender.stopConnection();\\n\\t}\",\n \"protected void onEndOfStream()\\n {\\n synchronized (f_aBuffSingleInbound)\\n {\\n synchronized (f_aBuffSingleOutbound)\\n {\\n if (f_engine.getSession().isValid())\\n {\\n try\\n {\\n f_engine.closeInbound();\\n closeOutbound(false);\\n }\\n catch (SSLException e)\\n {\\n // mimicking SSLSocket\\n }\\n catch (IOException ignored)\\n {\\n // won't occur\\n }\\n }\\n }\\n }\\n }\",\n \"public synchronized void close() {\\n try {\\n audioInputStream.close();\\n } catch (IOException ioe) {\\n System.err.println(\\\"Problem while closing the audioInputSteam\\\");\\n }\\n\\n }\",\n \"public static void closeIO()\\r\\n\\t{\\n\\t\\ttry\\r\\n\\t\\t{\\r\\n\\t\\t\\tinStream.close();\\r\\n\\t\\t\\toutStream.close();\\r\\n\\t\\t}\\r\\n\\t\\tcatch(IOException e)\\r\\n\\t\\t{\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"private void closeOutputStream() {\\n\\t\\tPrintStreamManagement.closeOutputStream();\\n\\t}\",\n \"public void close() {\\n if (numDigits > 0)\\n flush();\\n try {\\n output.close();\\n } catch (IOException e) {\\n throw new RuntimeException(e.toString());\\n }\\n }\",\n \"@Override\\n public void close() throws IOException {\\n opened = false;\\n if (socket != null) {\\n Utils.closeSilent(dis);\\n Utils.closeSilent(dos);\\n socket.close();\\n }\\n }\",\n \"@Override\\n public void close() {\\n backingIterator.close();\\n outputBuffer.close();\\n isClosed = true;\\n }\",\n \"public void close() throws IOException {\\n\\t\\tistream.close();\\n\\t\\tostream.close();\\n\\t\\tsocket.close();\\n\\t}\",\n \"public void close()\\r\\n\\t{\\r\\n\\t if (isOpen()) try {\\r\\n\\t \\tfd.close();\\r\\n\\t } catch (IOException ex) {\\r\\n\\t \\t/* do nothing */\\r\\n\\t } finally {\\r\\n\\t\\t thisc = EOF;\\r\\n\\t\\t holdc = EOF;\\r\\n\\t\\t fd = null;\\r\\n\\t }\\r\\n\\t}\",\n \"@Override\\n\\t public synchronized void close() throws IOException {\\n\\t\\tout.close();\\n\\t\\topen = false;\\n\\t }\",\n \"protected void close()\\n {\\n out.close();\\n }\",\n \"public void close() throws IOException {\\n maxStreamPos = cache.length();\\n\\n seek(maxStreamPos);\\n flushBefore(maxStreamPos);\\n super.close();\\n cache.close();\\n cache = null;\\n cacheFile.delete();\\n cacheFile = null;\\n stream.flush();\\n stream = null;\\n StreamCloser.removeFromQueue(closeAction);\\n }\",\n \"public void close(){\\n\\t\\ttry{\\n\\t\\t\\tflush();\\n\\t\\t\\tse.close();\\n\\t\\t}catch(IOException ioex){\\n\\t\\t\\tfailures = true;\\n\\t\\t}\\n\\t}\",\n \"public static void closeStreamAndForceCompleteResponse() throws IOException {\\n FacesContext fc = FacesContext.getCurrentInstance();\\n ExternalContext ex = Faces.getExternalContext();\\n ex.getResponseOutputStream().flush();\\n ex.getResponseOutputStream().close();\\n fc.responseComplete();\\n }\",\n \"@Override\\n public void close() throws IOException {\\n input.close();\\n }\",\n \"public void close() {\\n try {\\n socket.close();\\n outputStream.close();\\n inputStream.close();\\n } catch (Exception e) {\\n e.printStackTrace();\\n }\\n }\",\n \"public void close() {\\n\\t\\ttry {\\n\\t\\t\\t_inputStream.close();\\n\\t\\t\\t_outputStream.close();\\n\\t\\t\\t_socket.close();\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\n\\t}\",\n \"private static void closeStream(@javax.annotation.Nullable Closeable stream) {\\n if (stream != null) {\\n try {\\n stream.close();\\n } catch (IOException e) {\\n // ignore\\n }\\n }\\n }\",\n \"@Override\\n public void onClose() {\\n logger.info(\\\"Closing {} streams for file {}\\\", this.getTransferType(), this.getResource().file);\\n try {\\n if (inputChannel != null) {\\n inputChannel.close();\\n inputChannel = null;\\n inputBuffer.clear();\\n inputBuffer = null;\\n }\\n if (outputStream != null) {\\n outputStream.close();\\n outputStream = null;\\n }\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n }\",\n \"@Override\\n public void close() throws IOException\\n {\\n InputStream in = _inputSource;\\n\\n if (in != null) {\\n _inputSource = null;\\n if (_autoClose) {\\n in.close();\\n }\\n }\\n freeBuffers();\\n }\",\n \"private void close()\\n {\\n try\\n {\\n if (outputStream != null)\\n {\\n outputStream.close();\\n }\\n } catch (Exception e)\\n {\\n\\n }\\n try\\n {\\n if (inputStream != null)\\n {\\n inputStream.close();\\n }\\n } catch (Exception e)\\n {\\n\\n }\\n try\\n {\\n if (socket != null)\\n {\\n socket.close();\\n }\\n } catch (Exception e)\\n {\\n\\n }\\n }\",\n \"public void close() throws FormatException, IOException {\\n if (in != null) in.close();\\n in = null;\\n currentId = null;\\n }\",\n \"public void close() throws IOException {\\n\\t\\tin.close();\\n \\n\\t\\t// Release the buffer\\n\\t\\tdataIn = null;\\n\\t\\tbuffer = null;\\n\\t\\tif(readRecordsCounter != null) {\\n\\t\\t readRecordsCounter.increment(numRecordsRead);\\n\\t\\t}\\n\\n\\t\\t// Return the decompressor\\n\\t\\tif (decompressor != null) {\\n\\t\\t decompressor.reset();\\n\\t\\t CodecPool.returnDecompressor(decompressor);\\n\\t\\t decompressor = null;\\n\\t\\t}\\n\\t }\",\n \"@Override\\n\\t public synchronized void close() throws IOException {\\n\\t\\tin.close();\\n\\t\\topen = false;\\n\\t }\",\n \"public void close() throws IOException {\\n isClosed = true;\\n inputStreamOpened = false;\\n outputStreamOpened = false;\\n parent.setInactive();\\n }\",\n \"public void streamSubscriberClose(ISubscriberStream stream);\",\n \"@Override\\n\\tpublic void close() throws IOException {\\n\\t\\tLog.d(TAG, \\\"rtsp data source close!\\\");\\n\\t\\tif (_RtspClient != null) {\\n\\t\\t\\t_RtspClient.shutdown();\\n\\t\\t}\\n\\t}\",\n \"private void closeStreams() {\\n try {\\n System.out.println(\\\"Closing streams and terminating thread.\\\");\\n running = false;\\n outputStream.close();\\n inputStream.close();\\n clientSocket.close();\\n } catch (IOException e) {\\n System.err.println(e.getMessage());\\n }\\n }\",\n \"@Override\\r\\n\\tpublic void finish() {\\n\\t\\tsuper.finish();\\r\\n\\t\\tif(!s.isClosed()){\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\ts.close();\\r\\n\\t\\t\\t} catch (IOException e) {\\r\\n\\t\\t\\t\\t// TODO Auto-generated catch block\\r\\n\\t\\t\\t\\te.printStackTrace();\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public void close() {\\n\\t\\ttry {\\n\\t\\t\\tin.close();\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t}\",\n \"public void close() {\\n this.output = null;\\n }\",\n \"@Override\\n public void close() throws IOException {\\n isClosed = true;\\n }\",\n \"@Override\\n public void flush() throws IOException {\\n byteBufferStreamOutput.flush();\\n }\",\n \"public void ensureInputStreamClosed() {\\n if (claimInputStream()) {\\n try {\\n Closeables.close(_stream, true);\\n } catch (IOException e) {\\n // Already caught and logged\\n }\\n }\\n }\",\n \"@Override\\n\\t\\tpublic void close() throws IOException {\\n\\t\\t\\tout.close();\\n\\t\\t}\",\n \"public void flushStreamSpecs();\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; // indicate end of file\\n zzEndRead = zzStartRead; // invalidate buffer\\n\\n if (zzReader != null) {\\n zzReader.close();\\n }\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; // indicate end of file\\n zzEndRead = zzStartRead; // invalidate buffer\\n\\n if (zzReader != null) {\\n zzReader.close();\\n }\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n zzAtEOF = true; /* indicate end of file */\\n zzEndRead = zzStartRead; /* invalidate buffer */\\n\\n if (zzReader != null)\\n zzReader.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\n\\t\\tzzAtEOF = true; /* indicate end of file */\\n\\t\\tzzEndRead = zzStartRead; /* invalidate buffer */\\n\\n\\t\\tif (zzReader != null)\\n\\t\\t\\tzzReader.close();\\n\\t}\",\n \"protected static void close(InputStream iStream, OutputStream oStream) throws\\r\\n IOException {\\r\\n try {\\r\\n if (iStream != null) {\\r\\n iStream.close();\\r\\n }\\r\\n }\\r\\n finally {\\r\\n if (oStream != null) {\\r\\n oStream.close();\\r\\n }\\r\\n }\\r\\n }\",\n \"@Override\\n protected void done() throws IOException {\\n if (this.closeable instanceof Flushable) {\\n ((Flushable)((Object)this.closeable)).flush();\\n }\\n if (!this.ignoreCloseExceptions) {\\n this.closeable.close();\\n return;\\n }\\n try {\\n this.closeable.close();\\n return;\\n }\\n catch (IOException iOException) {\\n return;\\n }\\n }\",\n \"@Override\\n public void close() throws IOException\\n {\\n _out.close();\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\r\\n zzAtEOF = true; /* indicate end of file */\\r\\n zzEndRead = zzStartRead; /* invalidate buffer */\\r\\n\\r\\n if (zzReader != null)\\r\\n zzReader.close();\\r\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\r\\n zzAtEOF = true; /* indicate end of file */\\r\\n zzEndRead = zzStartRead; /* invalidate buffer */\\r\\n\\r\\n if (zzReader != null)\\r\\n zzReader.close();\\r\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\r\\n zzAtEOF = true; /* indicate end of file */\\r\\n zzEndRead = zzStartRead; /* invalidate buffer */\\r\\n\\r\\n if (zzReader != null)\\r\\n zzReader.close();\\r\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\r\\n zzAtEOF = true; /* indicate end of file */\\r\\n zzEndRead = zzStartRead; /* invalidate buffer */\\r\\n\\r\\n if (zzReader != null)\\r\\n zzReader.close();\\r\\n }\",\n \"public final void yyclose() throws java.io.IOException {\\r\\n zzAtEOF = true; /* indicate end of file */\\r\\n zzEndRead = zzStartRead; /* invalidate buffer */\\r\\n\\r\\n if (zzReader != null)\\r\\n zzReader.close();\\r\\n }\",\n \"@Override\\n public void close() throws IOException\\n {\\n try\\n {\\n fAVMRemote.closeInputHandle(fTicketHolder.getTicket(), fHandle);\\n }\\n catch (Exception e)\\n {\\n throw new IOException(\\\"Remote Error closing input stream.\\\");\\n }\\n }\",\n \"private void closeStreams() {\\n try {\\n windowForCommunication.append(\\\"Closing connection now.\\\" + \\\"\\\\n\\\");\\n sendMessageToClient(\\\"ENDING CHAT: Closing connection now\\\");\\n input.close();\\n output.close();\\n serverSocket.close();\\n }\\n catch(IOException e) {\\n System.out.println(e);\\n windowForCommunication.append(\\\"Uh oh. Seems like there was a communication error....!\\\");\\n }\\n }\",\n \"public void close() throws IOException;\",\n \"public void close() throws IOException;\",\n \"public void close() throws IOException;\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.742372","0.73023313","0.7160331","0.70681417","0.69970876","0.67976123","0.66543734","0.6564473","0.64817876","0.64380145","0.64156985","0.6405659","0.6285523","0.627561","0.62693334","0.625075","0.6232578","0.6231858","0.62049574","0.61861706","0.6165183","0.6131752","0.6110503","0.6102961","0.6097","0.60851914","0.60779613","0.60685843","0.60683024","0.605122","0.60451406","0.6008812","0.59965706","0.5992124","0.59849584","0.5956828","0.59553033","0.595342","0.594544","0.5904884","0.5903145","0.59031266","0.58971876","0.586967","0.58621657","0.5832557","0.5828823","0.5817927","0.58101285","0.5799819","0.57972056","0.5773901","0.5773007","0.57718617","0.5770487","0.5762706","0.5761155","0.57469195","0.57388914","0.5734517","0.57253873","0.5722466","0.5714114","0.5714114","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56946594","0.56923014","0.5680454","0.56773937","0.56766343","0.56674135","0.56674135","0.56674135","0.56674135","0.56674135","0.566428","0.5662045","0.5660415","0.5660415","0.5660415"],"string":"[\n \"0.742372\",\n \"0.73023313\",\n \"0.7160331\",\n \"0.70681417\",\n \"0.69970876\",\n \"0.67976123\",\n \"0.66543734\",\n \"0.6564473\",\n \"0.64817876\",\n \"0.64380145\",\n \"0.64156985\",\n \"0.6405659\",\n \"0.6285523\",\n \"0.627561\",\n \"0.62693334\",\n \"0.625075\",\n \"0.6232578\",\n \"0.6231858\",\n \"0.62049574\",\n \"0.61861706\",\n \"0.6165183\",\n \"0.6131752\",\n \"0.6110503\",\n \"0.6102961\",\n \"0.6097\",\n \"0.60851914\",\n \"0.60779613\",\n \"0.60685843\",\n \"0.60683024\",\n \"0.605122\",\n \"0.60451406\",\n \"0.6008812\",\n \"0.59965706\",\n \"0.5992124\",\n \"0.59849584\",\n \"0.5956828\",\n \"0.59553033\",\n \"0.595342\",\n \"0.594544\",\n \"0.5904884\",\n \"0.5903145\",\n \"0.59031266\",\n \"0.58971876\",\n \"0.586967\",\n \"0.58621657\",\n \"0.5832557\",\n \"0.5828823\",\n \"0.5817927\",\n \"0.58101285\",\n \"0.5799819\",\n \"0.57972056\",\n \"0.5773901\",\n \"0.5773007\",\n \"0.57718617\",\n \"0.5770487\",\n \"0.5762706\",\n \"0.5761155\",\n \"0.57469195\",\n \"0.57388914\",\n \"0.5734517\",\n \"0.57253873\",\n \"0.5722466\",\n \"0.5714114\",\n \"0.5714114\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56946594\",\n \"0.56923014\",\n \"0.5680454\",\n \"0.56773937\",\n \"0.56766343\",\n \"0.56674135\",\n \"0.56674135\",\n \"0.56674135\",\n \"0.56674135\",\n \"0.56674135\",\n \"0.566428\",\n \"0.5662045\",\n \"0.5660415\",\n \"0.5660415\",\n \"0.5660415\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":29385,"cells":{"query":{"kind":"string","value":"internal logging helpers uses log4j internal logger LogLog in order to avoid circular dependencies Internal debug message."},"document":{"kind":"string","value":"private static void debug(String message, Object... args)\n {\n StatusLogger.getLogger().debug(String.format(message, args));\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["protected Log getLog()\n/* */ {\n/* 59 */ return log;\n/* */ }","protected static Logger log() {\n return LogSingleton.INSTANCE.value;\n }","abstract protected void logInternal(int level, String message);","private void debugLog(String msg)\n {\n m_log.log(\"[\" + m_appName + \"] :\" + msg);\n }","private Log() {\r\n\t}","private static void _logInfo ()\n {\n System.err.println (\"Logging is enabled using \" + log.getClass ().getName ());\n }","protected void log(Object msg) {\n\t\n\t\tSystem.out.println(\"MusicDataAccessor: \" + msg);\n\t}","protected void initLogger() {\n initLogger(\"DEBUG\");\n }","@Override\n public void log()\n {\n }","abstract void initiateLog();","public LogScrap() {\n\t\tconsumer = bin->Conveyor.LOG.debug(\"{}\",bin);\n\t}","private static void log_d( String msg ) {\n\t if (D) Log.d( TAG, TAG_SUB + \" \" + msg );\n}","private static void defineLogger() {\n HTMLLayout layout = new HTMLLayout();\n DailyRollingFileAppender appender = null;\n try {\n appender = new DailyRollingFileAppender(layout, \"/Server_Log/log\", \"yyyy-MM-dd\");\n } catch (IOException e) {\n e.printStackTrace();\n }\n logger.addAppender(appender);\n logger.setLevel(Level.DEBUG);\n }","public void logDebug()\n\t{\n\t\tLogHandler handlerList[];\n\t\tLogHandler handler = null;\n\n\t\tSystem.out.println(\"Logger = \"+logger);\n\t\tSystem.out.println(\"Logger log level is: \"+logger.getLogLevel());\n\t\tSystem.out.println(\"Logger log filter is: \"+logger.getFilter());\n\t\thandlerList = logger.getHandlers();\n\t\tfor(int i = 0; i < handlerList.length; i++)\n\t\t{\n\t\t\thandler = handlerList[i];\n\t\t\tSystem.out.println(\"Logger handler \"+i+\" is:\"+handler+\" and called \"+handler.getName());\n\t\t\tSystem.out.println(\"Logger handler \"+i+\" has filter:\"+handler.getFilter());\n\t\t\tSystem.out.println(\"Logger handler \"+i+\" has log level:\"+handler.getLogLevel());\n\t\t}\n\t}","private void log_d( String msg ) {\n\t if (D) Log.d( TAG, TAG_SUB + \" \" + msg );\n}","final void out (String msg) { if (m_debugMode) { Logger.println (msg); } }","private Log getLog(final String key) {\r\n Log l = this.logs.get(key);\r\n\r\n if (l == null) {\r\n l = LogFactory.getLog(key);\r\n\r\n if (l != null) {\r\n this.addLog(key, l);\r\n } else {\r\n throw new IllegalStateException(\"LogUtil : Log4J is not initialized correctly : missing logger [\" + key + \"] = check the log4j configuration file (log4j.xml) !\");\r\n }\r\n }\r\n\r\n return l;\r\n }","void initializeLogging();","@Override\n\t\t\t\t\t\t\tpublic void log(String msg, int level, Date date, StackTraceElement trace) {\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t}","void log(Log log);","private void log(String msg) {\r\n\t\tif (logger != null) {\r\n\t\t\tlogger.append(msg);\r\n\t\t\tlogger.println();\r\n\t\t}\r\n\t}","private ExtentLogger() {}","private final Log getLogBase() {\r\n return this.logBase;\r\n }","private void setupLogging() {\n\t\t// Ensure all JDK log messages are deferred until a target is registered\n\t\tLogger rootLogger = Logger.getLogger(\"\");\n\t\tHandlerUtils.wrapWithDeferredLogHandler(rootLogger, Level.SEVERE);\n\n\t\t// Set a suitable priority level on Spring Framework log messages\n\t\tLogger sfwLogger = Logger.getLogger(\"org.springframework\");\n\t\tsfwLogger.setLevel(Level.WARNING);\n\n\t\t// Set a suitable priority level on Roo log messages\n\t\t// (see ROO-539 and HandlerUtils.getLogger(Class))\n\t\tLogger rooLogger = Logger.getLogger(\"org.springframework.shell\");\n\t\trooLogger.setLevel(Level.FINE);\n\t}","private static final Logger getLog4JLogger(final Log l) {\r\n return ((org.apache.commons.logging.impl.Log4JLogger) l).getLogger();\r\n }","private static final void log(String msg) {\n\t\tlog.println(msg);\n\t}","private Log() {\n }","private static void LOG(String msg) {\n if ( DEBUG ) {\n Log.d(TAG, msg);\n }\n }","@Override\n public void logs() {\n \n }","private void debug(String msg) {\r\n if (LOG.isDebugEnabled()) {\r\n LOG.debug(msg);\r\n }\r\n }","final void out (String msg1, String msg2) { if (m_debugMode) { Logger.print (msg1); Logger.println (msg2); } }","private void init() {\r\n this.log = this.getLog(LOGGER_MAIN);\r\n\r\n if (!(this.log instanceof org.apache.commons.logging.impl.Log4JLogger)) {\r\n throw new IllegalStateException(\r\n \"LogUtil : apache Log4J library or log4j.xml file are not present in classpath !\");\r\n }\r\n\r\n // TODO : check if logger has an appender (use parent hierarchy if needed)\r\n if (this.log.isWarnEnabled()) {\r\n this.log.warn(\"LogUtil : logging enabled now.\");\r\n }\r\n\r\n this.logBase = this.getLog(LOGGER_BASE);\r\n this.logDev = this.getLog(LOGGER_DEV);\r\n }","protected abstract Logger getLogger();","Appendable getLog();","public Log(Logger logger) {\n this.logger = logger;\n }","protected void log(String msg) {\n\t\tif(isLogging) {\n\t\t\tSystem.out.println(\"[TRACKER \" + id() + \"] \" + msg);\n\t\t}\n\t}","@SuppressWarnings(\"unused\")\n protected void debug(String msg) {\n if (this.getContainer() != null && this.getContainer().getLogger().isDebugEnabled()) {\n this.getContainer().getLogger().debug(msg);\n }\n }","@Override\n\tpublic void initLogger() {\n\t\t\n\t}","private void divertLog() {\n wr = new StringWriter(1000);\n LogTarget[] lt = { new WriterTarget(wr, fmt) };\n SampleResult.log.setLogTargets(lt);\n }","private final Log getLog() {\r\n return this.log;\r\n }","private static Logger getLogger() {\n return LogDomains.getLogger(ClassLoaderUtil.class, LogDomains.UTIL_LOGGER);\n }","private TypicalLogEntries() {}","@Override\n protected void log(String tag, String msg) {\n Log.i(tag, \"[you can use your custom logger here \\\"]\" + msg);\n }","@Override\n protected Logger getLogger() {\n return LOGGER;\n }","protected abstract ILogger getLogger();","protected static void logAndPrint(Logger logger, String msg) {\n\t\tSystem.out.println(msg);\n\t\tlogger.debug(msg);\n\t}","private LogUtil() {\r\n /* no-op */\r\n }","private Logger getLogger() {\n return LoggingUtils.getLogger();\n }","private JavaUtilLogHandlers() { }","public void setLogUtilities(LogUtilities log) { this.log = log; }","public static Log getLoggerDev() {\r\n Log l = null;\r\n if (isRunning()) {\r\n l = getInstance().getLogDev();\r\n }\r\n return l;\r\n }","public void customLogger() {\n KOOM.getInstance().setLogger(new KLog.KLogger() {\n @Override\n public void i(String TAG, String msg) {\n //get the log of info level\n }\n\n @Override\n public void d(String TAG, String msg) {\n //get the log of debug level\n }\n\n @Override\n public void e(String TAG, String msg) {\n //get the log of error level\n }\n });\n }","@Override\n public void initializeLogging() {\n // Wraps Android's native log framework.\n LogWrapper logWrapper = new LogWrapper();\n // Using Log, front-end to the logging chain, emulates android.util.log method signatures.\n Log.setLogNode(logWrapper);\n\n // Filter strips out everything except the message text.\n MessageOnlyLogFilter msgFilter = new MessageOnlyLogFilter();\n logWrapper.setNext(msgFilter);\n\n // On screen logging via a fragment with a TextView.\n //LogFragment logFragment = (LogFragment) getSupportFragmentManager()\n // .findFragmentById(R.id.log_fragment);\n //msgFilter.setNext(logFragment.getLogView());\n\n mLogFragment = (LogFragment) getSupportFragmentManager()\n .findFragmentById(R.id.log_fragment);\n msgFilter.setNext(mLogFragment.getLogView());\n\n Log.i(TAG, \"Ready\");\n }","public interface LoggerUtil {\n\t/**\n\t * Set the logger for the controller\n\t * \n\t * @param logName\n\t * @param filePath\n\t * @param logLevel\n\t * @return\n\t */\n\tLogger loggerArrangement(String logName, String filePath, LogeLevel logLevel);\n}","public Logger log() {\n return LOG;\n }","public static Log getLoggerBase() {\r\n Log l = null;\r\n if (isRunning()) {\r\n l = getInstance().getLogBase();\r\n }\r\n return l;\r\n }","private static Log getLog() {\n if (log == null) {\n log = new SystemStreamLog();\n }\n\n return log;\n }","private void doIt() {\n\t\tlogger.debug(\"hellow this is the first time I use Logback\");\n\t\t\n\t}","public Logger getLogger()\n/* */ {\n/* 77 */ if (this.logger == null) {\n/* 78 */ this.logger = Hierarchy.getDefaultHierarchy().getLoggerFor(this.name);\n/* */ }\n/* 80 */ return this.logger;\n/* */ }","@Override\n\tprotected Logger getLogger() {\n\t\treturn HMetis.logger;\n\t}","protected final LogTarget getLogTarget() \n {\n return m_wrappedLogTarget; \n }","private DAOLogger() {\n\t}","public interface Log {\n\n /**\n * This is a method description.\n *\n * <p>Another description after blank line.\n *\n * @param handler 添加handler.\n * @author admin\n */\n default void addHandler(Handler handler) {\n //\n }\n\n /**\n * This is a method description.\n *\n * <p>Another description after blank line.\n *\n * @param newLevel 设置日志级别.\n * @throws SecurityException 抛出安全异常.\n * @author admin\n */\n default void setLevel(final Level newLevel) throws SecurityException {\n //\n }\n\n /**\n * 信息日志.\n *\n * <p>Another description after blank line.\n *\n * @param message 日志消息.\n * @param args 日志消息格式化填充对象.\n * @author admin\n */\n void info(final String message, final Object... args);\n\n /**\n * This is a method description.\n *\n * <p>Another description after blank line.\n *\n * @param message 日志消息.\n * @author admin\n */\n void info(final String message);\n\n /**\n * 详细日志.\n *\n * <p>Another description after blank line.\n *\n * @param message 日志消息.\n * @param args 日志消息格式化填充对象.\n * @author admin\n */\n void debug(final String message, final Object... args);\n\n /**\n * This is a method description.\n *\n * <p>Another description after blank line.\n *\n * @param message 日志消息.\n * @author admin\n */\n void debug(final String message);\n\n /**\n * 较详细日志.\n *\n * <p>Another description after blank line.\n *\n * @param message 日志消息.\n * @param args 日志消息格式化填充对象.\n * @author admin\n */\n void trace(final String message, final Object... args);\n\n /**\n * 较详细日志.\n *\n * <p>Another description after blank line.\n *\n * @param message 日志消息.\n * @author admin\n */\n void trace(final String message);\n\n /**\n * 警告日志.\n *\n * <p>Another description after blank line.\n *\n * @param message 日志消息.\n * @param args 日志消息格式化填充对象.\n * @author admin\n */\n void warn(final String message, final Object... args);\n\n /**\n * 较详细日志.\n *\n * <p>Another description after blank line.\n *\n * @param message 日志消息.\n * @author admin\n */\n void warn(final String message);\n\n /**\n * 严重日志.\n *\n * <p>Another description after blank line.\n *\n * @param message 日志消息.\n * @param args 日志消息格式化填充对象.\n * @author admin\n */\n void error(final String message, final Object... args);\n\n /**\n * 较详细日志.\n *\n * <p>Another description after blank line.\n *\n * @param message 日志消息.\n * @author admin\n */\n void error(final String message);\n\n /**\n * 致命错误日志.\n *\n * <p>Another description after blank line.\n *\n * @param message 日志消息.\n * @param args 日志消息格式化填充对象.\n * @author admin\n */\n void fatal(final String message, final Object... args);\n\n /**\n * 致命错误日志.\n *\n * <p>Another description after blank line.\n *\n * @param message 日志消息.\n * @author admin\n */\n void fatal(final String message);\n\n /**\n * This is a method description.\n *\n * <p>Another description after blank line.\n *\n * @param args 日志传递进来的参数.\n * @param message 日志消息.\n * @author admin\n */\n default void off(final String message, final Object... args) {\n //\n }\n\n /**\n * This is a method description.\n *\n * <p>Another description after blank line.\n *\n * @param message 日志消息.\n * @author admin\n */\n default void off(final String message) {\n //\n }\n\n /**\n * This is a method description.\n *\n * <p>Another description after blank line.\n *\n * @param args 日志传递进来的参数.\n * @param message 日志消息.\n * @author admin\n */\n default void all(final String message, final Object... args) {\n //\n }\n\n /**\n * This is a method description.\n *\n * <p>Another description after blank line.\n *\n * @param message 日志消息.\n * @author admin\n */\n default void all(final String message) {\n //\n }\n\n /**\n * This is a method description.\n *\n * <p>Another description after blank line.\n *\n * @param args 日志传递进来的参数.\n * @param message 日志消息.\n * @author admin\n */\n default void config(final String message, final Object... args) {\n //\n }\n\n /**\n * This is a method description.\n *\n * <p>Another description after blank line.\n *\n * @param message 日志消息.\n * @author admin\n */\n default void config(final String message) {\n //\n }\n\n /**\n * This is a method description.\n *\n * <p>Another description after blank line.\n *\n * @return 是否开启调试.\n * @author admin\n */\n default boolean isDebugEnabled() {\n return false;\n }\n\n /**\n * This is a method description.\n *\n * <p>Another description after blank line.\n *\n * @return 是否开启Info.\n * @author admin\n */\n default boolean isInfoEnabled() {\n return false;\n }\n\n /**\n * This is a method description.\n *\n * <p>Another description after blank line.\n *\n * @return 是否开启Warn.\n * @author admin\n */\n default boolean isWarnEnabled() {\n return false;\n }\n}","public static final void debug(@org.jetbrains.annotations.NotNull org.jetbrains.anko.AnkoLogger r4, @org.jetbrains.annotations.Nullable java.lang.Object r5, @org.jetbrains.annotations.Nullable java.lang.Throwable r6) {\n /*\n r3 = \"$receiver\";\n kotlin.jvm.internal.Intrinsics.checkParameterIsNotNull(r4, r3);\n r0 = 3;\n r2 = r4.getLoggerTag();\n r3 = android.util.Log.isLoggable(r2, r0);\n if (r3 == 0) goto L_0x0025;\n L_0x0011:\n if (r6 == 0) goto L_0x002a;\n L_0x0013:\n if (r5 == 0) goto L_0x0026;\n L_0x0015:\n r3 = r5.toString();\n if (r3 == 0) goto L_0x0026;\n L_0x001b:\n r6 = (java.lang.Throwable) r6;\n r3 = (java.lang.String) r3;\n r1 = r2;\n r1 = (java.lang.String) r1;\n android.util.Log.d(r1, r3, r6);\n L_0x0025:\n return;\n L_0x0026:\n r3 = \"null\";\n goto L_0x001b;\n L_0x002a:\n if (r5 == 0) goto L_0x003b;\n L_0x002c:\n r3 = r5.toString();\n if (r3 == 0) goto L_0x003b;\n L_0x0032:\n r3 = (java.lang.String) r3;\n r1 = r2;\n r1 = (java.lang.String) r1;\n android.util.Log.d(r1, r3);\n goto L_0x0025;\n L_0x003b:\n r3 = \"null\";\n goto L_0x0032;\n */\n throw new UnsupportedOperationException(\"Method not decompiled: org.jetbrains.anko.Logging.debug(org.jetbrains.anko.AnkoLogger, java.lang.Object, java.lang.Throwable):void\");\n }","@Override\n\tpublic void debug(MessageSupplier msgSupplier) {\n\n\t}","private void initLog() {\n _logsList = (ListView) findViewById(R.id.lv_log);\n setupLogger();\n }","private void initLogger(BundleContext bc) {\n\t\tBasicConfigurator.configure();\r\n\t\tlogger = Logger.getLogger(Activator.class);\r\n\t\tLogger.getLogger(\"org.directwebremoting\").setLevel(Level.WARN);\r\n\t}","private static void log(String msg) {\n Log.d(LOG_TAG, msg);\n }","public abstract void logd(String str);","void log();","public void log(String msg) {\n\n\t}","ExtendedCommonLogger() {\n this.msgbuf = new byte[128];\n }","private static void longer_logmsg_Log4j(Logger log, Object msg, Throwable ex, int id, \n String original_methname, Object msg_modified) {\n\n Level level = Level.toLevel(original_methname);\n boolean legacyEnabled = log.isEnabledFor(level);\n int printResult = shouldPrint(id, legacyEnabled);\n if( (printResult & LOG_OUT) != 0) {\n /*LEVS methname = getWarnLevel(id);\n if(methname == null)\n methname = setMeth(id, original_methname);\n Level level = Level.toLevel(methname.toString());*/\n if(msg_modified == null)\n msg_modified = taggedID(id) + msg;\n \n String logname = log.getName();\n\n log.callAppenders(\n new org.apache.log4j.spi.LoggingEvent(logname, log, level, msg_modified, ex));\n }\n if( (printResult & RECORD_OUT) != 0)\n RecordStatements.record(id, original_methname, msg, ex);\n }","@Override\n\tpublic void log(String msg) throws IOException {\n\t\t\n\t}","@Override\n public void log(String message) {\n }","protected abstract void debug(String msg);","public void writeLog() {\n\n\t}","public void writeLog() {\n\n\t}","public void writeLog() {\n\n\t}","public void setLOG(Logger newLog)\r\n\t{\r\n\t\tlog = newLog;\r\n\t}","private static void initLog() {\n LogManager.mCallback = null;\n if (SettingsManager.getDefaultState().debugToasts) {\n Toast.makeText(mContext, mContext.getClass().getCanonicalName(), Toast.LENGTH_SHORT).show();\n }\n if (SettingsManager.getDefaultState().debugLevel >= LogManager.LEVEL_ERRORS) {\n new TopExceptionHandler(SettingsManager.getDefaultState().debugMail);\n }\n //Si hubo un crash grave se guardo el reporte en el sharedpreferences, por lo que al inicio\n //levanto los posibles crashes y, si el envio por mail está activado , lo envio\n String possibleCrash = StoreManager.pullString(\"crash\");\n if (!possibleCrash.equals(\"\")) {\n OtherAppsConnectionManager.sendMail(\"Stack\", possibleCrash, SettingsManager.getDefaultState().debugMailAddress);\n StoreManager.removeObject(\"crash\");\n }\n }","public void debug(Object message)\n/* */ {\n/* 118 */ if (message != null) {\n/* 119 */ getLogger().debug(String.valueOf(message));\n/* */ }\n/* */ }","@Override\r\n\tpublic Log getLog() {\n\t\treturn log;\r\n\t}","private static void log(String aMsg){\n\t System.out.println(aMsg);\n\t }","public void setLog (Logger log) {\n this.log = log;\n }","public Log log() {\n return _log;\n }","@Override\n public boolean isDebugEnabled() {\n return innerLog.isDebugEnabled();\n }","private final Log getLogDev() {\r\n return this.logDev;\r\n }","public void logthis(String msg) {\n logger.append(msg + \"\\n\");\n Log.d(TAG, msg);\n }","@Test\r\n\tpublic void logTest() {\r\n\t\tlogger.info(\"Testando info\");\r\n\t\tlogger.debug(\"nao sera logado\" + \"Nice\");\r\n\t\tlogger.error(\"This is Error message\", new Exception(\"Testing\"));\r\n\t}","private void addLog(String log) {\n LogHelper.addIdentificationLog(log);\n }","abstract protected void _log(TrackingActivity activity) throws Exception;","IFileLogger log();","private void initLoggers() {\n _logger = LoggerFactory.getInstance().createLogger();\n _build_logger = LoggerFactory.getInstance().createAntLogger();\n }","public static final void debug(@org.jetbrains.annotations.NotNull org.jetbrains.anko.AnkoLogger r2, @org.jetbrains.annotations.NotNull kotlin.jvm.functions.Function0<? extends java.lang.Object> r3) {\n /*\n r1 = \"$receiver\";\n kotlin.jvm.internal.Intrinsics.checkParameterIsNotNull(r2, r1);\n r1 = \"message\";\n kotlin.jvm.internal.Intrinsics.checkParameterIsNotNull(r3, r1);\n r0 = r2.getLoggerTag();\n r1 = 3;\n r1 = android.util.Log.isLoggable(r0, r1);\n if (r1 == 0) goto L_0x0026;\n L_0x0017:\n r1 = r3.invoke();\n if (r1 == 0) goto L_0x0027;\n L_0x001d:\n r1 = r1.toString();\n if (r1 == 0) goto L_0x0027;\n L_0x0023:\n android.util.Log.d(r0, r1);\n L_0x0026:\n return;\n L_0x0027:\n r1 = \"null\";\n goto L_0x0023;\n */\n throw new UnsupportedOperationException(\"Method not decompiled: org.jetbrains.anko.Logging.debug(org.jetbrains.anko.AnkoLogger, kotlin.jvm.functions.Function0):void\");\n }","@Override\n\tpublic void debug(Message msg) {\n\n\t}","public Logger getLog () {\n return log;\n }","public interface ILog {\n\n /**\n * Send an information level log message, used by time-related log.\n *\n * @param tag Used to identify the source of a log message. It usually identifies\n * the class or activity where the log call occurs.\n * @param msg The message you would like logged.\n */\n void info(String tag, String msg);\n\n\n /**\n * Send an warning level log message, used by exception-related log.\n *\n * @param tag Used to identify the source of a log message. It usually identifies\n * the class or activity where the log call occurs.\n * @param msg The message you would like logged.\n */\n void warn(String tag, String msg);\n}","protected Log getLogger() {\n return LOGGER;\n }","@Test\n\t/**\n\t * This is in effect:\n\t * \n\t * log4j.rootLogger=DEBUG\n\t */\n\tpublic void testDebugAbove(){\n\t\tlogger.trace(\"Trace\");\n\t\t//Above Debug are all logged\n\t\tlogger.debug(\"Debug\");\n\t\tlogger.info(\"Info\");\n\t\tlogger.warn(\"Warning\");\n\t\tlogger.error(\"Error\");\n\t}","public void logDebug(String str) {\n }"],"string":"[\n \"protected Log getLog()\\n/* */ {\\n/* 59 */ return log;\\n/* */ }\",\n \"protected static Logger log() {\\n return LogSingleton.INSTANCE.value;\\n }\",\n \"abstract protected void logInternal(int level, String message);\",\n \"private void debugLog(String msg)\\n {\\n m_log.log(\\\"[\\\" + m_appName + \\\"] :\\\" + msg);\\n }\",\n \"private Log() {\\r\\n\\t}\",\n \"private static void _logInfo ()\\n {\\n System.err.println (\\\"Logging is enabled using \\\" + log.getClass ().getName ());\\n }\",\n \"protected void log(Object msg) {\\n\\t\\n\\t\\tSystem.out.println(\\\"MusicDataAccessor: \\\" + msg);\\n\\t}\",\n \"protected void initLogger() {\\n initLogger(\\\"DEBUG\\\");\\n }\",\n \"@Override\\n public void log()\\n {\\n }\",\n \"abstract void initiateLog();\",\n \"public LogScrap() {\\n\\t\\tconsumer = bin->Conveyor.LOG.debug(\\\"{}\\\",bin);\\n\\t}\",\n \"private static void log_d( String msg ) {\\n\\t if (D) Log.d( TAG, TAG_SUB + \\\" \\\" + msg );\\n}\",\n \"private static void defineLogger() {\\n HTMLLayout layout = new HTMLLayout();\\n DailyRollingFileAppender appender = null;\\n try {\\n appender = new DailyRollingFileAppender(layout, \\\"/Server_Log/log\\\", \\\"yyyy-MM-dd\\\");\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n logger.addAppender(appender);\\n logger.setLevel(Level.DEBUG);\\n }\",\n \"public void logDebug()\\n\\t{\\n\\t\\tLogHandler handlerList[];\\n\\t\\tLogHandler handler = null;\\n\\n\\t\\tSystem.out.println(\\\"Logger = \\\"+logger);\\n\\t\\tSystem.out.println(\\\"Logger log level is: \\\"+logger.getLogLevel());\\n\\t\\tSystem.out.println(\\\"Logger log filter is: \\\"+logger.getFilter());\\n\\t\\thandlerList = logger.getHandlers();\\n\\t\\tfor(int i = 0; i < handlerList.length; i++)\\n\\t\\t{\\n\\t\\t\\thandler = handlerList[i];\\n\\t\\t\\tSystem.out.println(\\\"Logger handler \\\"+i+\\\" is:\\\"+handler+\\\" and called \\\"+handler.getName());\\n\\t\\t\\tSystem.out.println(\\\"Logger handler \\\"+i+\\\" has filter:\\\"+handler.getFilter());\\n\\t\\t\\tSystem.out.println(\\\"Logger handler \\\"+i+\\\" has log level:\\\"+handler.getLogLevel());\\n\\t\\t}\\n\\t}\",\n \"private void log_d( String msg ) {\\n\\t if (D) Log.d( TAG, TAG_SUB + \\\" \\\" + msg );\\n}\",\n \"final void out (String msg) { if (m_debugMode) { Logger.println (msg); } }\",\n \"private Log getLog(final String key) {\\r\\n Log l = this.logs.get(key);\\r\\n\\r\\n if (l == null) {\\r\\n l = LogFactory.getLog(key);\\r\\n\\r\\n if (l != null) {\\r\\n this.addLog(key, l);\\r\\n } else {\\r\\n throw new IllegalStateException(\\\"LogUtil : Log4J is not initialized correctly : missing logger [\\\" + key + \\\"] = check the log4j configuration file (log4j.xml) !\\\");\\r\\n }\\r\\n }\\r\\n\\r\\n return l;\\r\\n }\",\n \"void initializeLogging();\",\n \"@Override\\n\\t\\t\\t\\t\\t\\t\\tpublic void log(String msg, int level, Date date, StackTraceElement trace) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t}\",\n \"void log(Log log);\",\n \"private void log(String msg) {\\r\\n\\t\\tif (logger != null) {\\r\\n\\t\\t\\tlogger.append(msg);\\r\\n\\t\\t\\tlogger.println();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"private ExtentLogger() {}\",\n \"private final Log getLogBase() {\\r\\n return this.logBase;\\r\\n }\",\n \"private void setupLogging() {\\n\\t\\t// Ensure all JDK log messages are deferred until a target is registered\\n\\t\\tLogger rootLogger = Logger.getLogger(\\\"\\\");\\n\\t\\tHandlerUtils.wrapWithDeferredLogHandler(rootLogger, Level.SEVERE);\\n\\n\\t\\t// Set a suitable priority level on Spring Framework log messages\\n\\t\\tLogger sfwLogger = Logger.getLogger(\\\"org.springframework\\\");\\n\\t\\tsfwLogger.setLevel(Level.WARNING);\\n\\n\\t\\t// Set a suitable priority level on Roo log messages\\n\\t\\t// (see ROO-539 and HandlerUtils.getLogger(Class))\\n\\t\\tLogger rooLogger = Logger.getLogger(\\\"org.springframework.shell\\\");\\n\\t\\trooLogger.setLevel(Level.FINE);\\n\\t}\",\n \"private static final Logger getLog4JLogger(final Log l) {\\r\\n return ((org.apache.commons.logging.impl.Log4JLogger) l).getLogger();\\r\\n }\",\n \"private static final void log(String msg) {\\n\\t\\tlog.println(msg);\\n\\t}\",\n \"private Log() {\\n }\",\n \"private static void LOG(String msg) {\\n if ( DEBUG ) {\\n Log.d(TAG, msg);\\n }\\n }\",\n \"@Override\\n public void logs() {\\n \\n }\",\n \"private void debug(String msg) {\\r\\n if (LOG.isDebugEnabled()) {\\r\\n LOG.debug(msg);\\r\\n }\\r\\n }\",\n \"final void out (String msg1, String msg2) { if (m_debugMode) { Logger.print (msg1); Logger.println (msg2); } }\",\n \"private void init() {\\r\\n this.log = this.getLog(LOGGER_MAIN);\\r\\n\\r\\n if (!(this.log instanceof org.apache.commons.logging.impl.Log4JLogger)) {\\r\\n throw new IllegalStateException(\\r\\n \\\"LogUtil : apache Log4J library or log4j.xml file are not present in classpath !\\\");\\r\\n }\\r\\n\\r\\n // TODO : check if logger has an appender (use parent hierarchy if needed)\\r\\n if (this.log.isWarnEnabled()) {\\r\\n this.log.warn(\\\"LogUtil : logging enabled now.\\\");\\r\\n }\\r\\n\\r\\n this.logBase = this.getLog(LOGGER_BASE);\\r\\n this.logDev = this.getLog(LOGGER_DEV);\\r\\n }\",\n \"protected abstract Logger getLogger();\",\n \"Appendable getLog();\",\n \"public Log(Logger logger) {\\n this.logger = logger;\\n }\",\n \"protected void log(String msg) {\\n\\t\\tif(isLogging) {\\n\\t\\t\\tSystem.out.println(\\\"[TRACKER \\\" + id() + \\\"] \\\" + msg);\\n\\t\\t}\\n\\t}\",\n \"@SuppressWarnings(\\\"unused\\\")\\n protected void debug(String msg) {\\n if (this.getContainer() != null && this.getContainer().getLogger().isDebugEnabled()) {\\n this.getContainer().getLogger().debug(msg);\\n }\\n }\",\n \"@Override\\n\\tpublic void initLogger() {\\n\\t\\t\\n\\t}\",\n \"private void divertLog() {\\n wr = new StringWriter(1000);\\n LogTarget[] lt = { new WriterTarget(wr, fmt) };\\n SampleResult.log.setLogTargets(lt);\\n }\",\n \"private final Log getLog() {\\r\\n return this.log;\\r\\n }\",\n \"private static Logger getLogger() {\\n return LogDomains.getLogger(ClassLoaderUtil.class, LogDomains.UTIL_LOGGER);\\n }\",\n \"private TypicalLogEntries() {}\",\n \"@Override\\n protected void log(String tag, String msg) {\\n Log.i(tag, \\\"[you can use your custom logger here \\\\\\\"]\\\" + msg);\\n }\",\n \"@Override\\n protected Logger getLogger() {\\n return LOGGER;\\n }\",\n \"protected abstract ILogger getLogger();\",\n \"protected static void logAndPrint(Logger logger, String msg) {\\n\\t\\tSystem.out.println(msg);\\n\\t\\tlogger.debug(msg);\\n\\t}\",\n \"private LogUtil() {\\r\\n /* no-op */\\r\\n }\",\n \"private Logger getLogger() {\\n return LoggingUtils.getLogger();\\n }\",\n \"private JavaUtilLogHandlers() { }\",\n \"public void setLogUtilities(LogUtilities log) { this.log = log; }\",\n \"public static Log getLoggerDev() {\\r\\n Log l = null;\\r\\n if (isRunning()) {\\r\\n l = getInstance().getLogDev();\\r\\n }\\r\\n return l;\\r\\n }\",\n \"public void customLogger() {\\n KOOM.getInstance().setLogger(new KLog.KLogger() {\\n @Override\\n public void i(String TAG, String msg) {\\n //get the log of info level\\n }\\n\\n @Override\\n public void d(String TAG, String msg) {\\n //get the log of debug level\\n }\\n\\n @Override\\n public void e(String TAG, String msg) {\\n //get the log of error level\\n }\\n });\\n }\",\n \"@Override\\n public void initializeLogging() {\\n // Wraps Android's native log framework.\\n LogWrapper logWrapper = new LogWrapper();\\n // Using Log, front-end to the logging chain, emulates android.util.log method signatures.\\n Log.setLogNode(logWrapper);\\n\\n // Filter strips out everything except the message text.\\n MessageOnlyLogFilter msgFilter = new MessageOnlyLogFilter();\\n logWrapper.setNext(msgFilter);\\n\\n // On screen logging via a fragment with a TextView.\\n //LogFragment logFragment = (LogFragment) getSupportFragmentManager()\\n // .findFragmentById(R.id.log_fragment);\\n //msgFilter.setNext(logFragment.getLogView());\\n\\n mLogFragment = (LogFragment) getSupportFragmentManager()\\n .findFragmentById(R.id.log_fragment);\\n msgFilter.setNext(mLogFragment.getLogView());\\n\\n Log.i(TAG, \\\"Ready\\\");\\n }\",\n \"public interface LoggerUtil {\\n\\t/**\\n\\t * Set the logger for the controller\\n\\t * \\n\\t * @param logName\\n\\t * @param filePath\\n\\t * @param logLevel\\n\\t * @return\\n\\t */\\n\\tLogger loggerArrangement(String logName, String filePath, LogeLevel logLevel);\\n}\",\n \"public Logger log() {\\n return LOG;\\n }\",\n \"public static Log getLoggerBase() {\\r\\n Log l = null;\\r\\n if (isRunning()) {\\r\\n l = getInstance().getLogBase();\\r\\n }\\r\\n return l;\\r\\n }\",\n \"private static Log getLog() {\\n if (log == null) {\\n log = new SystemStreamLog();\\n }\\n\\n return log;\\n }\",\n \"private void doIt() {\\n\\t\\tlogger.debug(\\\"hellow this is the first time I use Logback\\\");\\n\\t\\t\\n\\t}\",\n \"public Logger getLogger()\\n/* */ {\\n/* 77 */ if (this.logger == null) {\\n/* 78 */ this.logger = Hierarchy.getDefaultHierarchy().getLoggerFor(this.name);\\n/* */ }\\n/* 80 */ return this.logger;\\n/* */ }\",\n \"@Override\\n\\tprotected Logger getLogger() {\\n\\t\\treturn HMetis.logger;\\n\\t}\",\n \"protected final LogTarget getLogTarget() \\n {\\n return m_wrappedLogTarget; \\n }\",\n \"private DAOLogger() {\\n\\t}\",\n \"public interface Log {\\n\\n /**\\n * This is a method description.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param handler 添加handler.\\n * @author admin\\n */\\n default void addHandler(Handler handler) {\\n //\\n }\\n\\n /**\\n * This is a method description.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param newLevel 设置日志级别.\\n * @throws SecurityException 抛出安全异常.\\n * @author admin\\n */\\n default void setLevel(final Level newLevel) throws SecurityException {\\n //\\n }\\n\\n /**\\n * 信息日志.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param message 日志消息.\\n * @param args 日志消息格式化填充对象.\\n * @author admin\\n */\\n void info(final String message, final Object... args);\\n\\n /**\\n * This is a method description.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param message 日志消息.\\n * @author admin\\n */\\n void info(final String message);\\n\\n /**\\n * 详细日志.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param message 日志消息.\\n * @param args 日志消息格式化填充对象.\\n * @author admin\\n */\\n void debug(final String message, final Object... args);\\n\\n /**\\n * This is a method description.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param message 日志消息.\\n * @author admin\\n */\\n void debug(final String message);\\n\\n /**\\n * 较详细日志.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param message 日志消息.\\n * @param args 日志消息格式化填充对象.\\n * @author admin\\n */\\n void trace(final String message, final Object... args);\\n\\n /**\\n * 较详细日志.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param message 日志消息.\\n * @author admin\\n */\\n void trace(final String message);\\n\\n /**\\n * 警告日志.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param message 日志消息.\\n * @param args 日志消息格式化填充对象.\\n * @author admin\\n */\\n void warn(final String message, final Object... args);\\n\\n /**\\n * 较详细日志.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param message 日志消息.\\n * @author admin\\n */\\n void warn(final String message);\\n\\n /**\\n * 严重日志.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param message 日志消息.\\n * @param args 日志消息格式化填充对象.\\n * @author admin\\n */\\n void error(final String message, final Object... args);\\n\\n /**\\n * 较详细日志.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param message 日志消息.\\n * @author admin\\n */\\n void error(final String message);\\n\\n /**\\n * 致命错误日志.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param message 日志消息.\\n * @param args 日志消息格式化填充对象.\\n * @author admin\\n */\\n void fatal(final String message, final Object... args);\\n\\n /**\\n * 致命错误日志.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param message 日志消息.\\n * @author admin\\n */\\n void fatal(final String message);\\n\\n /**\\n * This is a method description.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param args 日志传递进来的参数.\\n * @param message 日志消息.\\n * @author admin\\n */\\n default void off(final String message, final Object... args) {\\n //\\n }\\n\\n /**\\n * This is a method description.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param message 日志消息.\\n * @author admin\\n */\\n default void off(final String message) {\\n //\\n }\\n\\n /**\\n * This is a method description.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param args 日志传递进来的参数.\\n * @param message 日志消息.\\n * @author admin\\n */\\n default void all(final String message, final Object... args) {\\n //\\n }\\n\\n /**\\n * This is a method description.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param message 日志消息.\\n * @author admin\\n */\\n default void all(final String message) {\\n //\\n }\\n\\n /**\\n * This is a method description.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param args 日志传递进来的参数.\\n * @param message 日志消息.\\n * @author admin\\n */\\n default void config(final String message, final Object... args) {\\n //\\n }\\n\\n /**\\n * This is a method description.\\n *\\n * <p>Another description after blank line.\\n *\\n * @param message 日志消息.\\n * @author admin\\n */\\n default void config(final String message) {\\n //\\n }\\n\\n /**\\n * This is a method description.\\n *\\n * <p>Another description after blank line.\\n *\\n * @return 是否开启调试.\\n * @author admin\\n */\\n default boolean isDebugEnabled() {\\n return false;\\n }\\n\\n /**\\n * This is a method description.\\n *\\n * <p>Another description after blank line.\\n *\\n * @return 是否开启Info.\\n * @author admin\\n */\\n default boolean isInfoEnabled() {\\n return false;\\n }\\n\\n /**\\n * This is a method description.\\n *\\n * <p>Another description after blank line.\\n *\\n * @return 是否开启Warn.\\n * @author admin\\n */\\n default boolean isWarnEnabled() {\\n return false;\\n }\\n}\",\n \"public static final void debug(@org.jetbrains.annotations.NotNull org.jetbrains.anko.AnkoLogger r4, @org.jetbrains.annotations.Nullable java.lang.Object r5, @org.jetbrains.annotations.Nullable java.lang.Throwable r6) {\\n /*\\n r3 = \\\"$receiver\\\";\\n kotlin.jvm.internal.Intrinsics.checkParameterIsNotNull(r4, r3);\\n r0 = 3;\\n r2 = r4.getLoggerTag();\\n r3 = android.util.Log.isLoggable(r2, r0);\\n if (r3 == 0) goto L_0x0025;\\n L_0x0011:\\n if (r6 == 0) goto L_0x002a;\\n L_0x0013:\\n if (r5 == 0) goto L_0x0026;\\n L_0x0015:\\n r3 = r5.toString();\\n if (r3 == 0) goto L_0x0026;\\n L_0x001b:\\n r6 = (java.lang.Throwable) r6;\\n r3 = (java.lang.String) r3;\\n r1 = r2;\\n r1 = (java.lang.String) r1;\\n android.util.Log.d(r1, r3, r6);\\n L_0x0025:\\n return;\\n L_0x0026:\\n r3 = \\\"null\\\";\\n goto L_0x001b;\\n L_0x002a:\\n if (r5 == 0) goto L_0x003b;\\n L_0x002c:\\n r3 = r5.toString();\\n if (r3 == 0) goto L_0x003b;\\n L_0x0032:\\n r3 = (java.lang.String) r3;\\n r1 = r2;\\n r1 = (java.lang.String) r1;\\n android.util.Log.d(r1, r3);\\n goto L_0x0025;\\n L_0x003b:\\n r3 = \\\"null\\\";\\n goto L_0x0032;\\n */\\n throw new UnsupportedOperationException(\\\"Method not decompiled: org.jetbrains.anko.Logging.debug(org.jetbrains.anko.AnkoLogger, java.lang.Object, java.lang.Throwable):void\\\");\\n }\",\n \"@Override\\n\\tpublic void debug(MessageSupplier msgSupplier) {\\n\\n\\t}\",\n \"private void initLog() {\\n _logsList = (ListView) findViewById(R.id.lv_log);\\n setupLogger();\\n }\",\n \"private void initLogger(BundleContext bc) {\\n\\t\\tBasicConfigurator.configure();\\r\\n\\t\\tlogger = Logger.getLogger(Activator.class);\\r\\n\\t\\tLogger.getLogger(\\\"org.directwebremoting\\\").setLevel(Level.WARN);\\r\\n\\t}\",\n \"private static void log(String msg) {\\n Log.d(LOG_TAG, msg);\\n }\",\n \"public abstract void logd(String str);\",\n \"void log();\",\n \"public void log(String msg) {\\n\\n\\t}\",\n \"ExtendedCommonLogger() {\\n this.msgbuf = new byte[128];\\n }\",\n \"private static void longer_logmsg_Log4j(Logger log, Object msg, Throwable ex, int id, \\n String original_methname, Object msg_modified) {\\n\\n Level level = Level.toLevel(original_methname);\\n boolean legacyEnabled = log.isEnabledFor(level);\\n int printResult = shouldPrint(id, legacyEnabled);\\n if( (printResult & LOG_OUT) != 0) {\\n /*LEVS methname = getWarnLevel(id);\\n if(methname == null)\\n methname = setMeth(id, original_methname);\\n Level level = Level.toLevel(methname.toString());*/\\n if(msg_modified == null)\\n msg_modified = taggedID(id) + msg;\\n \\n String logname = log.getName();\\n\\n log.callAppenders(\\n new org.apache.log4j.spi.LoggingEvent(logname, log, level, msg_modified, ex));\\n }\\n if( (printResult & RECORD_OUT) != 0)\\n RecordStatements.record(id, original_methname, msg, ex);\\n }\",\n \"@Override\\n\\tpublic void log(String msg) throws IOException {\\n\\t\\t\\n\\t}\",\n \"@Override\\n public void log(String message) {\\n }\",\n \"protected abstract void debug(String msg);\",\n \"public void writeLog() {\\n\\n\\t}\",\n \"public void writeLog() {\\n\\n\\t}\",\n \"public void writeLog() {\\n\\n\\t}\",\n \"public void setLOG(Logger newLog)\\r\\n\\t{\\r\\n\\t\\tlog = newLog;\\r\\n\\t}\",\n \"private static void initLog() {\\n LogManager.mCallback = null;\\n if (SettingsManager.getDefaultState().debugToasts) {\\n Toast.makeText(mContext, mContext.getClass().getCanonicalName(), Toast.LENGTH_SHORT).show();\\n }\\n if (SettingsManager.getDefaultState().debugLevel >= LogManager.LEVEL_ERRORS) {\\n new TopExceptionHandler(SettingsManager.getDefaultState().debugMail);\\n }\\n //Si hubo un crash grave se guardo el reporte en el sharedpreferences, por lo que al inicio\\n //levanto los posibles crashes y, si el envio por mail está activado , lo envio\\n String possibleCrash = StoreManager.pullString(\\\"crash\\\");\\n if (!possibleCrash.equals(\\\"\\\")) {\\n OtherAppsConnectionManager.sendMail(\\\"Stack\\\", possibleCrash, SettingsManager.getDefaultState().debugMailAddress);\\n StoreManager.removeObject(\\\"crash\\\");\\n }\\n }\",\n \"public void debug(Object message)\\n/* */ {\\n/* 118 */ if (message != null) {\\n/* 119 */ getLogger().debug(String.valueOf(message));\\n/* */ }\\n/* */ }\",\n \"@Override\\r\\n\\tpublic Log getLog() {\\n\\t\\treturn log;\\r\\n\\t}\",\n \"private static void log(String aMsg){\\n\\t System.out.println(aMsg);\\n\\t }\",\n \"public void setLog (Logger log) {\\n this.log = log;\\n }\",\n \"public Log log() {\\n return _log;\\n }\",\n \"@Override\\n public boolean isDebugEnabled() {\\n return innerLog.isDebugEnabled();\\n }\",\n \"private final Log getLogDev() {\\r\\n return this.logDev;\\r\\n }\",\n \"public void logthis(String msg) {\\n logger.append(msg + \\\"\\\\n\\\");\\n Log.d(TAG, msg);\\n }\",\n \"@Test\\r\\n\\tpublic void logTest() {\\r\\n\\t\\tlogger.info(\\\"Testando info\\\");\\r\\n\\t\\tlogger.debug(\\\"nao sera logado\\\" + \\\"Nice\\\");\\r\\n\\t\\tlogger.error(\\\"This is Error message\\\", new Exception(\\\"Testing\\\"));\\r\\n\\t}\",\n \"private void addLog(String log) {\\n LogHelper.addIdentificationLog(log);\\n }\",\n \"abstract protected void _log(TrackingActivity activity) throws Exception;\",\n \"IFileLogger log();\",\n \"private void initLoggers() {\\n _logger = LoggerFactory.getInstance().createLogger();\\n _build_logger = LoggerFactory.getInstance().createAntLogger();\\n }\",\n \"public static final void debug(@org.jetbrains.annotations.NotNull org.jetbrains.anko.AnkoLogger r2, @org.jetbrains.annotations.NotNull kotlin.jvm.functions.Function0<? extends java.lang.Object> r3) {\\n /*\\n r1 = \\\"$receiver\\\";\\n kotlin.jvm.internal.Intrinsics.checkParameterIsNotNull(r2, r1);\\n r1 = \\\"message\\\";\\n kotlin.jvm.internal.Intrinsics.checkParameterIsNotNull(r3, r1);\\n r0 = r2.getLoggerTag();\\n r1 = 3;\\n r1 = android.util.Log.isLoggable(r0, r1);\\n if (r1 == 0) goto L_0x0026;\\n L_0x0017:\\n r1 = r3.invoke();\\n if (r1 == 0) goto L_0x0027;\\n L_0x001d:\\n r1 = r1.toString();\\n if (r1 == 0) goto L_0x0027;\\n L_0x0023:\\n android.util.Log.d(r0, r1);\\n L_0x0026:\\n return;\\n L_0x0027:\\n r1 = \\\"null\\\";\\n goto L_0x0023;\\n */\\n throw new UnsupportedOperationException(\\\"Method not decompiled: org.jetbrains.anko.Logging.debug(org.jetbrains.anko.AnkoLogger, kotlin.jvm.functions.Function0):void\\\");\\n }\",\n \"@Override\\n\\tpublic void debug(Message msg) {\\n\\n\\t}\",\n \"public Logger getLog () {\\n return log;\\n }\",\n \"public interface ILog {\\n\\n /**\\n * Send an information level log message, used by time-related log.\\n *\\n * @param tag Used to identify the source of a log message. It usually identifies\\n * the class or activity where the log call occurs.\\n * @param msg The message you would like logged.\\n */\\n void info(String tag, String msg);\\n\\n\\n /**\\n * Send an warning level log message, used by exception-related log.\\n *\\n * @param tag Used to identify the source of a log message. It usually identifies\\n * the class or activity where the log call occurs.\\n * @param msg The message you would like logged.\\n */\\n void warn(String tag, String msg);\\n}\",\n \"protected Log getLogger() {\\n return LOGGER;\\n }\",\n \"@Test\\n\\t/**\\n\\t * This is in effect:\\n\\t * \\n\\t * log4j.rootLogger=DEBUG\\n\\t */\\n\\tpublic void testDebugAbove(){\\n\\t\\tlogger.trace(\\\"Trace\\\");\\n\\t\\t//Above Debug are all logged\\n\\t\\tlogger.debug(\\\"Debug\\\");\\n\\t\\tlogger.info(\\\"Info\\\");\\n\\t\\tlogger.warn(\\\"Warning\\\");\\n\\t\\tlogger.error(\\\"Error\\\");\\n\\t}\",\n \"public void logDebug(String str) {\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6820123","0.6780879","0.671974","0.6700964","0.6637071","0.6519738","0.64312446","0.6427003","0.6338282","0.63056445","0.63048685","0.6277209","0.6267726","0.6261081","0.62280333","0.62098986","0.62031895","0.62021124","0.6188186","0.6185712","0.61808074","0.6173148","0.61684114","0.61620116","0.6149724","0.61394423","0.6131203","0.6126038","0.6125655","0.61103153","0.60740346","0.60644716","0.60558945","0.60552174","0.6040714","0.602795","0.6027447","0.6012363","0.6003667","0.6002481","0.60000324","0.59520453","0.5950816","0.5943747","0.5943327","0.5938905","0.59330547","0.59322","0.5926746","0.5911022","0.5910872","0.5907544","0.59022284","0.5900104","0.58992976","0.58850825","0.58835894","0.58791417","0.5876871","0.5872153","0.58668643","0.58631444","0.5860514","0.58594924","0.5855271","0.5853562","0.58470654","0.58426034","0.58406985","0.5839392","0.58353657","0.58332574","0.58315","0.5822201","0.58180743","0.5817632","0.58174103","0.58174103","0.58174103","0.5813102","0.5812082","0.5806511","0.580503","0.5802578","0.58003616","0.57885253","0.5786708","0.5786249","0.5776296","0.5762361","0.5757521","0.57560074","0.57535243","0.57535195","0.57526743","0.5750215","0.5749337","0.5740211","0.5735069","0.57341754","0.57252127"],"string":"[\n \"0.6820123\",\n \"0.6780879\",\n \"0.671974\",\n \"0.6700964\",\n \"0.6637071\",\n \"0.6519738\",\n \"0.64312446\",\n \"0.6427003\",\n \"0.6338282\",\n \"0.63056445\",\n \"0.63048685\",\n \"0.6277209\",\n \"0.6267726\",\n \"0.6261081\",\n \"0.62280333\",\n \"0.62098986\",\n \"0.62031895\",\n \"0.62021124\",\n \"0.6188186\",\n \"0.6185712\",\n \"0.61808074\",\n \"0.6173148\",\n \"0.61684114\",\n \"0.61620116\",\n \"0.6149724\",\n \"0.61394423\",\n \"0.6131203\",\n \"0.6126038\",\n \"0.6125655\",\n \"0.61103153\",\n \"0.60740346\",\n \"0.60644716\",\n \"0.60558945\",\n \"0.60552174\",\n \"0.6040714\",\n \"0.602795\",\n \"0.6027447\",\n \"0.6012363\",\n \"0.6003667\",\n \"0.6002481\",\n \"0.60000324\",\n \"0.59520453\",\n \"0.5950816\",\n \"0.5943747\",\n \"0.5943327\",\n \"0.5938905\",\n \"0.59330547\",\n \"0.59322\",\n \"0.5926746\",\n \"0.5911022\",\n \"0.5910872\",\n \"0.5907544\",\n \"0.59022284\",\n \"0.5900104\",\n \"0.58992976\",\n \"0.58850825\",\n \"0.58835894\",\n \"0.58791417\",\n \"0.5876871\",\n \"0.5872153\",\n \"0.58668643\",\n \"0.58631444\",\n \"0.5860514\",\n \"0.58594924\",\n \"0.5855271\",\n \"0.5853562\",\n \"0.58470654\",\n \"0.58426034\",\n \"0.58406985\",\n \"0.5839392\",\n \"0.58353657\",\n \"0.58332574\",\n \"0.58315\",\n \"0.5822201\",\n \"0.58180743\",\n \"0.5817632\",\n \"0.58174103\",\n \"0.58174103\",\n \"0.58174103\",\n \"0.5813102\",\n \"0.5812082\",\n \"0.5806511\",\n \"0.580503\",\n \"0.5802578\",\n \"0.58003616\",\n \"0.57885253\",\n \"0.5786708\",\n \"0.5786249\",\n \"0.5776296\",\n \"0.5762361\",\n \"0.5757521\",\n \"0.57560074\",\n \"0.57535243\",\n \"0.57535195\",\n \"0.57526743\",\n \"0.5750215\",\n \"0.5749337\",\n \"0.5740211\",\n \"0.5735069\",\n \"0.57341754\",\n \"0.57252127\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":29386,"cells":{"query":{"kind":"string","value":"also needs to path auth"},"document":{"kind":"string","value":"@GetMapping(\"/info\")\n public String info(){\n return \"info\";\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["boolean authNeeded();","java.lang.String getAuth();","java.lang.String getAuth();","java.lang.String getAuth();","boolean hasAuth();","private void authenticate(String user, String pass) {\n }","@Override\n protected void configure(AuthenticationManagerBuilder auth) {\n }","@Override\n protected void afterAuthenticating() {\n }","@GetMapping(\"/\")\n\tpublic String auth() throws IOException \n\t{\n\t\t/* Returns to home.html : index.html */\n\t\treturn appservice.authentication() ? \"application.html\" : \"log.html\";\n\t}","private void loginHandler(RoutingContext context) {\n JsonObject creds = new JsonObject()\n .put(\"username\", context.getBodyAsJson().getString(\"username\"))\n .put(\"password\", context.getBodyAsJson().getString(\"password\"));\n\n // TODO : Authentication\n context.response().setStatusCode(500).end();\n }","private AppAuth() {\n }","@Override\n\tpublic void credite() {\n\t\t\n\t}","private void authorize() {\r\n\r\n\t}","private boolean authenticatedUser(String uName, String pass) {\n\t\treturn true;\n\t}","protected void login() {\n\t\t\r\n\t}","@Override\n protected void configure(AuthenticationManagerBuilder auth) throws Exception {\n auth.inMemoryAuthentication()\n .withUser(\"ahmed\")\n .password(\"123456\")\n .roles(\"admin\");\n }","boolean isAuthenticated();","public boolean isAuthRequired() {\n\t\treturn false;\n\t}","private void authenticateAction() {\n if (requestModel.getUsername().equals(\"superuser\")\n && requestModel.getPassword().equals(\"\")) {\n Collection<Webres> webres = getAllWebres();\n proceedWhenAuthenticated(new User(null, null, null, \"superuser\", \"\", null) {\n @Override\n public Collection<Webres> getAllowedResources() {\n return webres;\n }\n @Override\n public ActionController getDefaultController() {\n return ActionController.EMPLOYEES_SERVLET;\n }\n });\n return;\n }\n \n // try to authenticate against other credentials from the database\n Optional<User> u = getUserByCredentials(requestModel.getUsername(), requestModel.getPassword()); \n if (u.isPresent()) {\n proceedWhenAuthenticated(u.get());\n return;\n }\n \n // report authentication failed\n LOG.log(Level.INFO, \"{0} Authentication failed. Login: {1}, Password: {2}\", new Object[]{httpSession.getId(), requestModel.getUsername(), requestModel.getPassword()});\n SignInViewModel viewModel = new SignInViewModel(true);\n renderSignInView(viewModel);\n }","@Override\n public JsonResponse duringAuthentication(String... params) {\n try {\n final String username = params[0];\n final String password = params[1];\n return RequestHandler.authenticate(this.getApplicationContext(), username, password);\n } catch (IOException e) {\n return null;\n }\n }","public boolean auth() throws IOException {\r\n \treturn auth(false);\r\n }","public User doAuthentication(String account, String password);","@Override\n protected void configure(AuthenticationManagerBuilder auth) {\n auth.authenticationProvider(authProvider);\n }","@Override\n protected void configure(AuthenticationManagerBuilder auth) throws Exception {\n auth.inMemoryAuthentication()\n .withUser(\"user1\").password(\"secret1\").roles(\"USER\");\n }","public void setAuth(int pAuth){\n this.auth = pAuth;\n }","@Override\n public void showAuthScreen() {\n }","@Override\n public boolean auth(String email, String pseudonyme) {\n Properties props = new Properties();\n props.setProperty(\"org.omg.CORBA.ORBInitialHost\", \"localhost\");\n props.setProperty(\"org.omg.CORBA.ORBInitialPort\", \"3700\");\n props.setProperty(\"java.naming.factory.initial\", \"com.sun.enterprise.naming.SerialInitContextFactory\");\n props.setProperty(\"java.naming.factory.url.pkgs\", \"com.sun.enterprise.naming\");\n props.setProperty(\"java.naming.factory.state\", \"com.sun.corba.ee.impl.presentation.rmi.JNDIStateFactoryImpl\");\n \n StatelessDirectoryManagerBeanRemote sb = null;\n InitialContext ic;\n \n try {\n ic = new InitialContext(props);\n sb = (StatelessDirectoryManagerBeanRemote)ic.lookup(\"com.master2.datascale.directorymanager.bean.StatelessDirectoryManagerBeanRemote\");\n\t\t\t\n } catch (NamingException ex) {\n Logger.getLogger(StatefulAuctionManagerBean.class.getName()).log(Level.SEVERE, null, ex);\n }\n\t\t\t\n return sb.auth(email, pseudonyme);\n }","@Override\n\tpublic Authentication authenticate(Authentication auth) throws AuthenticationException {\n\t\t username = auth.getName();\n\t\tString pass = auth.getCredentials().toString();\n\t\t\n\t\tif(AppController.users.containsKey(username))\n\t\t{\n\t\tString password = AppController.users.get(username); \n\t\t\t\n\t\tif(password.equals(pass))\n\t\t\treturn new UsernamePasswordAuthenticationToken(username,pass,Collections.EMPTY_LIST);\n\t\telse\n\t\t\tthrow new BadCredentialsException(\"authentication failed\");\n\t\t\n\t\t}\n\t\telse\n\t\t\tthrow new BadCredentialsException(\"authentication failed\");\n\t}","protected abstract String getAuthorization();","final void setAuthentication(boolean required)\r\n {\r\n requires_AUT = required;\r\n }","abstract public boolean checkAuth(String userId) throws IOException;","@Override\n\tpublic User auth()\n\t{\n\t\treturn this.user;\n\t}","@Override\r\n\tprotected void configure(AuthenticationManagerBuilder auth) throws Exception {\n\t\tauth.inMemoryAuthentication().withUser(\"purna\").password(\"purna43$\").roles(\"USER\")\r\n\t\t.and().withUser(\"chandu\").password(\"chandu43$\").roles(\"ADMIN\");\r\n\t}","private void checkAuthAtMain() {\n val auth = config.getString(\"authAtMain\");\n\n checkArgument(auth.length() > 10, \"auth string (at-main) length is less than or equal to 10!\");\n }","public void handleAuthenticationRequest(RoutingContext context) {\n\n final HttpServerRequest request = context.request();\n\n final String basicAuthentication = request.getHeader(AUTHORIZATION_HEADER);\n\n try {\n\n final String[] auth =\n BasicAuthEncoder.decodeBasicAuthentication(basicAuthentication).split(\":\");\n\n if (auth.length < 2) {\n\n context.response().putHeader(CONTENT_TYPE_HEADER, HTML_CONTENT_TYPE)\n .end(Json.encode(Errors.CREDENTIAL_ERROR.error()));\n\n } else {\n\n final Credential credential = new Credential(auth[0], auth[1]);\n\n authenticationService.authenticate(credential, user -> {\n\n if (null != user) {\n\n tokenService.generateToken(user, token -> {\n\n context.response().putHeader(CONTENT_TYPE_HEADER, HTML_CONTENT_TYPE).end(token);\n\n }, err -> {\n\n context.response().putHeader(CONTENT_TYPE_HEADER, JSON_CONTENT_TYPE)\n .end(Json.encode(Errors.INTERNAL_ERROR.error()));\n\n });\n\n } else {\n\n context.response().putHeader(CONTENT_TYPE_HEADER, JSON_CONTENT_TYPE)\n .end(Json.encode(Errors.CREDENTIAL_ERROR.error()));\n\n }\n\n }, err -> {\n\n context.response().putHeader(CONTENT_TYPE_HEADER, JSON_CONTENT_TYPE)\n .end(Json.encode(err.toError()));\n\n });\n\n\n }\n\n } catch (final Exception e) {\n\n context.response().putHeader(CONTENT_TYPE_HEADER, JSON_CONTENT_TYPE)\n .end(Json.encode(Errors.INVALID_AUTHENTICATION_TOKEN.error()));\n\n\n }\n\n\n\n }","private void signIn() {\n }","@Override\n protected void configure(AuthenticationManagerBuilder auth) throws Exception {\n auth.inMemoryAuthentication()\n .withUser(\"user\").password(\"{noop}user\").roles(\"USER\")\n .and()\n .withUser(\"admin\").password(\"{noop}admin\").roles(\"ADMIN\", \"USER\");\n }","@Override\npublic boolean supports(Class<?> authentication) {\n return true;\n}","private AuthenticationService() {}","@Override\n\tprotected void configure(AuthenticationManagerBuilder auth) throws Exception {\n\t\tauth.inMemoryAuthentication().withUser(\"nandy@yahoo.in\").password(\"{noop}12345\").roles(\"USER\");\n\t}","UserPermissions authenticate (Request request);","protected abstract void appendRootUri(StringBuilder buffer, boolean addPassword);","@Override\n public void onAuthenticationFailed() {\n }","@Test\n public void testAddDemotivatorPageRequiresAuthentication(){\n \tResponse response = GET(\"/add\");\n \n assertNotNull(response);\n assertStatus(302, response);\n \n assertHeaderEquals(\"Location\", \"/secure/login\", response);\n }","@Override\n protected void configure(AuthenticationManagerBuilder auth) throws Exception {\n\n //CREATE USERS\n auth.inMemoryAuthentication().withUser(\"myadmin\").password(\"{noop}myadminpassword\").roles(\"ADMIN\");\n auth.inMemoryAuthentication().withUser(\"myuser\" ).password(\"{noop}myuserpassword\" ).roles(\"USER\" );\n\n }","public interface AuthService {\n void init();\n boolean login(HttpServletRequest request, String user, String password);\n\n void logout(HttpServletRequest request);\n\n boolean register(User user);\n\n\n User checkLogin(String username, String password);\n}","@Override\n\tprotected String url() {\n\t\treturn \"user\";\n\t}","public interface IAuthService {\n AuthInfo getAuthentication(String username, String password);\n}","@Given(\"^The app (.+) auth (.+) and (.+)$\")\n\tpublic void the_app_auth_and(String url, String username, String password) throws IOException {\n\t\tLOGGER.info(\"Starting to test the Basic Auth \");\n\t\tboolean turnOffSSL = url.contains(\"8443\")?true:false;\n\t\trestTemplate = RestTemplateUtils.newRestTemplate(turnOffSSL);\n\t\trestTemplate.getInterceptors().add(CPEHeaderInterceptor.Builder.fromBasicAuth(username, password).build());\n\t\tthis.url = url;\n\t}","public Authentification() {\n initComponents();\n }","@Override\r\n\tpublic void onAuthenticationSuccess(HttpServletRequest req, HttpServletResponse res,\r\n\t\t\tAuthentication auth) throws IOException, ServletException {\n\t\tlogger.info(\"Login Success !\");\r\n\t\tlogger.info(\"Login ID [ {} ].\",auth.getName());\r\n\t\t\r\n\t\tfor(GrantedAuthority a : auth.getAuthorities()) {\r\n\t\t\tlogger.info(\"authority = [ {} ].\",a.getAuthority());\r\n\t\t}\r\n\t\t\r\n\t\tlogger.info(auth.getDetails().toString());\r\n\t\tlogger.info(auth.getPrincipal().toString());\r\n\t\t\r\n\t\tUserDetails u = (UserDetails)auth.getPrincipal();\r\n\t\t\r\n\t\tlogger.info(String.valueOf(u.isAccountNonExpired()));\r\n\t\t\r\n\t\tlogger.info(\"sending URL..\");\r\n\t\t\r\n\t\tclearAuthenticationAttributes(req);\r\n\t\t\r\n\t\tint intRedirectStrategy = decideRedirectStrategy(req, res);\r\n\t\t\r\n\t\tswitch(intRedirectStrategy) {\r\n\t\t\r\n\t\tcase 1:\r\n\t\t\tuseTargetUrl(req, res);\r\n\t\t\tbreak;\r\n\t\t\t\r\n\t\tcase 2:\r\n\t\t\tuseSessionUrl(req, res);\r\n\t\t\tbreak;\r\n\t\t\t\r\n\t\tcase 3:\r\n\t\t\tuseRefererUrl(req, res);\r\n\t\t\tbreak;\r\n\t\t\t\r\n\t\tdefault:\r\n\t\t\tuseDefaultUrl(req, res);\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t}","protected EscidocAuthenticationProvider() {\r\n }","@Test\n public void basicAuthentication() {\n RestAssured.given().auth().basic(\"admin\",\"admin\").when().get(\"https://the-internet.herokuapp.com/basic_auth\").\n then().assertThat().statusCode(200);\n\n //api key is one type of authentication, we can also be authenticated by providing a name and password.\n }","public interface AuthManager\n{\n void checkAuthAnnounce(Id<Node> nodeId, DynamicAnnouncement announcement, HttpServletRequest request);\n\n void checkAuthDelete(Id<Node> nodeId, HttpServletRequest request);\n\n void checkAuthReplicate(HttpServletRequest request);\n}","@Override\n\tpublic void setAuthProvider(AuthProvider arg0) {\n\t}","@RequestMapping(\"/auth\") \r\n\tpublic String redirect(Model model,HttpServletRequest httpRequest) { \r\n\t\t String path = httpRequest.getContextPath();\r\n\t String basePath = httpRequest.getScheme()+\"://\"+httpRequest.getServerName()+\":\"+httpRequest.getServerPort()+path; \r\n\t model.addAttribute(\"base\", basePath);\r\n\t\treturn \"/index/login\"; \r\n\t}","public CheckAuthCommand() {\n this.authLevel = AUTH_LEVEL_LOGGED_IN;\n }","MeshAuthChain getAuthChain();","@Autowired\r\n public void globalUserDetails(AuthenticationManagerBuilder auth) throws Exception {\n auth.inMemoryAuthentication()\r\n // Define user's roles\r\n .withUser(adminId).password(adminPassword).roles(ADMIN_ROLE).and()\r\n .withUser(userId).password(userPassword).roles(USER_ROLE);\r\n }","@Override\r\n\tpublic void login() {\n\t\t\r\n\t}","protected Response login() {\n return login(\"\");\n }","@Override\n public void onAuthenticationFailed() {\n }","private ModelAndView handleScriptBasicAuth(HttpServletRequest request, HttpServletResponse response)\n {\n\tfinal HttpSession session = request.getSession();\n\tString http_basic_auth = null, http_basic_auth_username = null, http_basic_auth_password = null, openid = null;\n\tBoolean user_authenticated = false;\n\tbyte[] byteArray = null;\n\thttp_basic_auth = request.getHeader(\"Authorization\");\n\t \n\t \n\tString http_basic_auth_enc = http_basic_auth.replaceAll(\"Basic \", \"\");\n\tbyteArray = Base64.decodeBase64(http_basic_auth_enc.getBytes());\n\tString http_basic_auth_dec = new String(byteArray);\n\tString[] parts = http_basic_auth_dec.split(\":\");\n\thttp_basic_auth_username = parts[0];\n\thttp_basic_auth_password = parts[1];\n\t \n\tif (LOG.isDebugEnabled()) LOG.debug(\"Attempting authentication with user=\"+http_basic_auth_username+\" password=\"+http_basic_auth_password);\n\t\t\n\tuser_authenticated = idp.authenticate_ids(http_basic_auth_username, http_basic_auth_password);\n\topenid = idp.getOpenid(http_basic_auth_username);\t\t\n\t\t\n\tif((user_authenticated) && (openid != null)) \n\t{\n\t return setPositiveSessionAuth(session, openid);\n\t} \n\telse\n\t{\n\t // set session-scope authentication flag to FALSE\n\t session.setAttribute(OpenidPars.SESSION_ATTRIBUTE_AUTHENTICATED, Boolean.FALSE);\n\t if (LOG.isDebugEnabled()) LOG.debug(\"Authentication error\");\n\t response.setStatus(HttpServletResponse.SC_UNAUTHORIZED);\n\t return null;\n\t}\n }","public void authenticationProcedure(){\n\t\tthrow new UnsupportedOperationException(\"TODO: auto-generated method stub\");\r\n\t}","@Test\n @Transactional\n public void testUrlsRequireAuthentication() throws Exception {\n final View view = viewTestTools.createView(\"TestView\");\n\n // View \"stream\" page.\n testUrlRequiresAuthentication(\"/stream/\" + view.getId(), false);\n }","public void addBasicAuthentication() {\n\t\tAuthorization auth = new Authorization();\n\t\tauth.setUser(this.authUsername);\n\t\tauth.setPass(this.authPassword);\n\t\tauth.setURL(\"\");\n\n\t\tAuthManager authManager = new AuthManager();\n\t\tauthManager.setEnabled(true);\n\t\tauthManager.setName(\"HTTP Authorization Manager\");\n\t\tauthManager.getClearEachIteration();\n\t\tauthManager.addAuth(auth);\n\t\tauthManager.setProperty(TestElement.TEST_CLASS, AuthManager.class.getName());\n\t\tauthManager.setProperty(TestElement.GUI_CLASS, AuthPanel.class.getName());\n\n\t\tthis.testPlanHashTree.add(authManager);\n\t}","@Test\n public void test001() {\n String login = \"admin\";\n String password = \"admin\";\n\n openBasicAuthPage(login, password);\n assertThatAuthenticated();\n\n }","private void checkAuthControl() {\n val authKey = config.getString(\"authControlKey\");\n val authValue = config.getString(\"authControlValue\");\n\n checkArgument(authKey.length() > 2, \"auth string (control key) length is less than or equal to 2!\");\n checkArgument(authValue.length() > 2, \"auth string (control value) length is less than or equal to 2!\");\n }","private static Object doAuth(Request req, Response res) {\n \n HashMap<String, String> response = new HashMap<>();\n\t\t \n String email = Jsoup.parse(req.queryParams(\"email\")).text();\n\t\t String password = Jsoup.parse(req.queryParams(\"password\")).text();\n\t\t\n res.type(Path.Web.JSON_TYPE);\n \t\t\n\t\t\n\t\tif(email != null && !email.isEmpty() && password != null && !password.isEmpty() ) {\n \n authenticate = new Authenticate(password);\n\t\t\t//note that the server obj has been created during call to login()\n\t\t\tString M2 = authenticate.getM2(server);\n\t\t\t\n if(M2 != null || !M2.isEmpty()) {\n \n \n\t\t\tSession session = req.session(true);\n\t\t\tsession.maxInactiveInterval(Path.Web.SESSION_TIMEOUT);\n\t\t\tUser user = UserController.getUserByEmail(email);\n\t\t\tsession.attribute(Path.Web.ATTR_USER_NAME, user.getUsername());\n session.attribute(Path.Web.ATTR_USER_ID, user.getId().toString()); //saves the id as String\n\t\t\tsession.attribute(Path.Web.AUTH_STATUS, authenticate.authenticated);\n\t\t\tsession.attribute(Path.Web.ATTR_EMAIL, user.getEmail());\n logger.info(user.toString() + \" Has Logged In Successfully\");\n \n response.put(\"M2\", M2);\n response.put(\"code\", \"200\");\n response.put(\"status\", \"success\");\n response.put(\"target\", Path.Web.DASHBOARD);\n \n String respjson = gson.toJson(response);\n logger.info(\"Final response sent By doAuth to client = \" + respjson);\n res.status(200);\n return respjson;\n }\n\t\t\t\t\n\t\t} \n \n res.status(401);\n response.put(\"code\", \"401\");\n response.put(\"status\", \"Error! Invalid Login Credentials\");\n \n return gson.toJson(response);\n }","public interface AuthService {\n User register(User user, CheckError checkError);\n \n String login(String username, String password);\n \n String refresh(String oldToken);\n}","@Test(dependsOnMethods = \"testEnableAuth\", groups = \"authEnable\", priority = 1)\n public void setupAuthClient() {\n this.userClient = Client.builder()\n .endpoints(endpoints)\n .user(user)\n .password(userNewPass).build();\n this.rootClient = Client.builder()\n .endpoints(endpoints)\n .user(root)\n .password(rootPass).build();\n }","@Autowired\n public void configureGlobalSecurity(AuthenticationManagerBuilder auth) throws Exception {\n auth.inMemoryAuthentication().withUser(\"John\").password(\"{noop}test\").roles(\"ADMIN\");\n auth.inMemoryAuthentication().withUser(\"Oliver\").password(\"{noop}test\").roles(\"USER\");\n }","private void loggedInUser() {\n\t\t\n\t}","@Test\n @Transactional\n public void testUrlsRequireAuthentication() throws Exception {\n // cluster index page.\n testUrlRequiresAuthentication(\"/cluster\", false);\n }","private void debugAuthentcation() {\n\n\t\t/*\n\t\t * XPagesUtil.showErrorMessage(\"bluemix util: serviceName: \" +\n\t\t * serviceName + \", baseUrl: \" + baseUrl + \" username: \" + username +\n\t\t * \" password: \" + password);\n\t\t * XPagesUtil.showErrorMessage(\"bluemix util: service name: \" +\n\t\t * serviceName + \", hardcodedBaseUrl: \" + hardcodedBaseUrl +\n\t\t * \" hardcodedUsername: \" + hardcodedUsername + \" hardcodedPassword: \" +\n\t\t * hardcodedPassword);\n\t\t */\n\t}","public Result authenticate() {\r\n // 1. Define class to send JSON response back\r\n class Login {\r\n public Long id;\r\n public String gamerTag;\r\n public String token;\r\n\r\n public Login() {\r\n }\r\n }\r\n\r\n // 2. Read email and password from request()\r\n JsonNode request = request().body().asJson();\r\n String gamerTag = request.get(\"gamerTag\").asText();\r\n String password = request.get(\"password\").asText();\r\n\r\n // 3. Find user with given gamerTag\r\n Login ret = new Login();\r\n User user = User.gamerTagLogin(gamerTag);\r\n if (user == null) {\r\n return unauthorized(Json.toJson(ret));\r\n }\r\n // 4. Compare password.\r\n String sha256 = User.getSha256(request.get(\"password\").asText());\r\n if (sha256.equals(user.getPassword())) {\r\n // Success\r\n String authToken = generateAuthToken();\r\n user.setToken(authToken);\r\n Ebean.update(user);\r\n ret.token = authToken;\r\n ret.gamerTag = user.getGamerTag();\r\n ret.id = user.getId();\r\n return ok(Json.toJson(ret));\r\n\r\n }\r\n // 5. Unauthorized access\r\n return unauthorized();\r\n }","public Builder setAuth(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n \n auth_ = value;\n onChanged();\n return this;\n }","public Builder setAuth(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n \n auth_ = value;\n onChanged();\n return this;\n }","public Builder setAuth(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n \n auth_ = value;\n onChanged();\n return this;\n }","private LogIn() {}","private void startAuth() {\n if (ConnectionUtils.getSessionInstance().isLoggedIn()) {\n ConnectionUtils.getSessionInstance().logOut();\n } else {\n ConnectionUtils.getSessionInstance().authenticate(this);\n }\n updateUiForLoginState();\n }","@Override\n public void onAuthenticated(AuthData authData) {\n Log.i(\"lt\", \"authed\");\n }","@Override\r\n\tpublic void login() {\n\r\n\t}","void setAuthenticated(boolean b);","@Override\r\n protected void additionalAuthenticationChecks(UserDetails userDetails, UsernamePasswordAuthenticationToken authentication) {\n }","public static void run_auth(String pass)\r\n\t{\r\n\t\tpassword = pass;\r\n\t\t\r\n\t\t// Call hash function to encrypt the input password\r\n\t\ttry \r\n\t\t{\r\n\t\t\thash = hash_password(password);\r\n\t\t\tSystem.out.println(\"Hashed password: \" + hash);\r\n\t\t} \r\n\t\tcatch (Exception e) \r\n\t\t{\r\n\t\t\tSystem.out.println(\"There was an error hashing the input password...\");\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t\t\r\n\t\t// Call query function to retrieve hash from the DB\r\n\t\ttry \r\n\t\t{\r\n\t\t\tquery_hash = query_hash();\r\n\t\t\tSystem.out.println(\"Queried hash: \" + query_hash);\r\n\t\t} \r\n\t\tcatch (ClassNotFoundException e) \r\n\t\t{\r\n\t\t\tSystem.out.println(\"There was an error querying the database...\");\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t}","public interface Authentication extends Component {\n /**\n * Given an incoming HTTP request, determine who the user is and create a UserPermissions object with that\n * information. If the user cannot be identified and/or authenticated, don't set those attributes and throw an\n * exception. Otherwise return a UserPermissions object.\n */\n UserPermissions authenticate (Request request);\n}","@Override\n public boolean isClientAuthEnabled() {\n return true;\n }","@Override\r\n\tprotected void configure(AuthenticationManagerBuilder auth) throws Exception {\n\t\tauth.authenticationProvider(authenticateionProvider());\r\n\t}","protected String getAuthInfo ()\n\t{\n\t\treturn authInfo;\n\t}","@Override\n\t\t\tpublic void handle(Request req, Response res) throws Exception {\n\t\t\t\tfinal String op = req.params(\":op\");\n\t\t\t\tfinal String username = req.queryParams(\"user\");\n\t\t\t\tfinal String path = req.queryParams(\"path\");\n\t\t\t\t\n\t\t\t\t//--- framework access ---//\n\t\t\t\tif (!Results.hasFrameworkAccess(op, path)) halt(404);\n\t\t\t\t//--- path exists? ---//\n\t\t\t\tif (!Directories.isExist(path)) halt(404);\n\t\t\t\t//--- section and path access ---//\n\t\t\t\tif (!AccessManager.hasAccess(username, path)) halt(401);\n\n\t\t\t}","public void authenticate(LoginRequest loginRequest) {\n\n }","@Override\n\tprotected void configure(AuthenticationManagerBuilder auth) throws Exception {\n\t\tif (isDevelopment()) {\n\t\t\tswitch (this.applicationProperties.getMode()) {\n\t\t\tcase basic:\n\t\t\t\tauth.inMemoryAuthentication().withUser(\"INTW1\").password(\"{noop}intw1\")\n\t\t\t\t\t\t.and()\n\t\t\t\t\t\t.withUser(\"ABC\").password(\"{noop}abc\")\n\t\t\t\t\t\t.and()\n\t\t\t\t\t\t.withUser(\"JKL\").password(\"{noop}jkl\")\n\t\t\t\t\t\t.and()\n\t\t\t\t\t\t.withUser(\"noWrite\").password(\"{noop}a\");\n\t\t\t\tbreak;\n\t\t\tcase noauth:\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}","@Test\n public void authentication2() \n {\n\t Response resp = RestAssured.given().auth().oauth2(\"accessTokenToPass\").post(\"URL/URL\");\n\t resp.getStatusCode();\n\t \n\t //Getting entire data value\n\t System.out.println(\"Content is :\" +resp.getBody().asString());\n\t \n\t //Converting in to Json path value\n\t JsonPath json = resp.getBody().jsonPath();\n\t \n\t //Printing in JSON value\n\t System.out.println(\"Json Value are :\" +json);\n }","private static IndexAuthorization buildAuth(final Properties authProps,\n final Reporter reporter) throws IOException {\n if(authProps.size() == 0) {\n return null;\n }\n\n IndexAuthorization authorization = new BasicAuth(authProps);\n for(String index : authorization.authorizedIndexes()) {\n reporter.createStore(index);\n }\n\n return authorization;\n }","protected void onSuccessfulAuthentication(HttpServletRequest request, HttpServletResponse response, Authentication authResult) throws IOException {\n }","private boolean authenticate (HttpRequest request, HttpResponse response) throws UnsupportedEncodingException\n\t{\n\t\tString[] requestSplit=request.getPath().split(\"/\",3);\n\t\tif(requestSplit.length<2)\n\t\t\treturn false;\n\t\tString serviceName=requestSplit[1];\n\t\tfinal int BASIC_PREFIX_LENGTH=\"BASIC \".length();\n\t\tString userPass=\"\";\n\t\tString username=\"\";\n\t\tString password=\"\";\n\t\t\n\t\t//Check for authentication information in header\n\t\tif(request.hasHeaderField(AUTHENTICATION_FIELD)\n\t\t\t\t&&(request.getHeaderField(AUTHENTICATION_FIELD).length()>BASIC_PREFIX_LENGTH))\n\t\t{\n\t\t\tuserPass=request.getHeaderField(AUTHENTICATION_FIELD).substring(BASIC_PREFIX_LENGTH);\n\t\t\tuserPass=new String(Base64.decode(userPass), \"UTF-8\");\n\t\t\tint separatorPos=userPass.indexOf(':');\n\t\t\t//get username and password\n\t\t\tusername=userPass.substring(0,separatorPos);\n\t\t\tpassword=userPass.substring(separatorPos+1);\n\t\t\t\n\t\t\t\n\t\t\ttry\n\t\t\t{\n\t\t\t\t\n\t\t\t\tlong userId;\n\t\t\t\tAgent userAgent;\n\t\t\t\t\n\t\t\t\tif ( username.matches (\"-?[0-9].*\") ) {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tuserId = Long.valueOf(username);\n\t\t\t\t\t} catch ( NumberFormatException e ) {\n\t\t\t\t\t\tthrow new L2pSecurityException (\"The given user does not contain a valid agent id!\");\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tuserId = l2pNode.getAgentIdForLogin(username);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tuserAgent = l2pNode.getAgent(userId);\n\t\t\t\t\n\t\t\t\tif ( ! (userAgent instanceof PassphraseAgent ))\n\t\t\t\t\tthrow new L2pSecurityException (\"Agent is not passphrase protected!\");\n\t\t\t\t((PassphraseAgent)userAgent).unlockPrivateKey(password);\n\t\t\t\t_currentUserId=userId;\n\t\t\t\t\n\t\t\t\tif(!_userSessions.containsKey(userId))//if user not registered\n\t\t\t\t{\t\t\t\t\n\t\t\t\t\tMediator mediator = l2pNode.getOrRegisterLocalMediator(userAgent);\n\t\t\t\t\t_userSessions.put(userId, new UserSession(mediator));\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t_userSessions.get(userId).updateServiceTime(serviceName,new Date().getTime());//update last access time for service\n\t\t\t\t\n\t\t\t\tconnector.logMessage(\"Login: \"+username);\n\t\t\t\tconnector.logMessage(\"Sessions: \"+Integer.toString(_userSessions.size()));\n\t\t\t\t\n\t\t\t\treturn true;\n\t\t\t\t\n\t\t\t}catch (AgentNotKnownException e) {\n\t\t\t\tsendUnauthorizedResponse(response, null, request.getRemoteAddress() + \": login denied for user \" + username);\n\t\t\t} catch (L2pSecurityException e) {\n\t\t\t\tsendUnauthorizedResponse( response, null, request.getRemoteAddress() + \": unauth access - prob. login problems\");\n\t\t\t} catch (Exception e) {\n\t\t\t\t\n\t\t\t\tsendInternalErrorResponse(\n\t\t\t\t\t\tresponse, \n\t\t\t\t\t\t\"The server was unable to process your request because of an internal exception!\", \n\t\t\t\t\t\t\"Exception in processing create session request: \" + e);\n\t\t\t}\n\t\t\t\n\t\t}\n\t\telse\n\t\t{\n\t\t\tresponse.setStatus ( HttpResponse.STATUS_BAD_REQUEST );\n\t\t\tresponse.setContentType( \"text/plain\" );\n\t\t\tresponse.print ( \"No authentication provided!\" );\n\t\t\tconnector.logError( \"No authentication provided!\" );\n\t\t}\n\t\treturn false;\n\t}","@Override\n public F.Promise<Result> onAuthFailure(Http.Context context, String content) {\n final Http.Context c = context;\n return F.Promise.promise(new F.Function0<Result>() {\n @Override\n public Result apply() throws Throwable {\n String path = c.request().path();\n String sessionId = context.session().get(\"sessionId\");\n try {\n SessionStoreAdapter.getInstance().getUserSession(sessionId);\n c.flash().put(\"error\", Messages.get(\"global.error.noauthorizationforthispage\"));\n return ok(index.render());\n } catch(Exception e) {\n return ok(login.render(path));\n }\n }\n });\n }","boolean authenticate(String userName, String password);","public GluewineSecuredStaticHandler(String context, UseridPasswordAuthentication authenticator)\n {\n super(context);\n this.authenticator = authenticator;\n }","@Before(unless = { \"signin\", \"doLogin\" })\n\tprivate static void checkAuthentification() {\n\t\t// get ID from secure social plugin\n\t\tString uid = session.get(PLAYUSER_ID);\n\t\tif (uid == null) {\n\t\t\tsignin(null);\n\t\t}\n\n\t\t// get the user from the store. TODO Can also get it from the cache...\n\t\tUser user = null;\n\t\tif (Cache.get(uid) == null) {\n\t\t\ttry {\n\t\t\t\tuser = UserClient.getUserFromID(uid);\n\t\t\t\tCache.set(uid, user);\n\t\t\t} catch (ApplicationException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t\tflash.error(\"Problem while getting user from store...\");\n\t\t\t}\n\t\t} else {\n\t\t\tuser = (User) Cache.get(uid);\n\t\t}\n\n\t\tif (user == null) {\n\t\t\tflash.error(\"Problem while getting user from store...\");\n\t\t\tAuthentifier.logout();\n\t\t}\n\n\t\tif (user.avatarURL == null) {\n\t\t\tuser.avatarURL = Gravatar.get(user.email, 100);\n\t\t}\n\n\t\t// push the user object in the request arguments for later display...\n\t\trenderArgs.put(PLAYUSER, user);\n\t}"],"string":"[\n \"boolean authNeeded();\",\n \"java.lang.String getAuth();\",\n \"java.lang.String getAuth();\",\n \"java.lang.String getAuth();\",\n \"boolean hasAuth();\",\n \"private void authenticate(String user, String pass) {\\n }\",\n \"@Override\\n protected void configure(AuthenticationManagerBuilder auth) {\\n }\",\n \"@Override\\n protected void afterAuthenticating() {\\n }\",\n \"@GetMapping(\\\"/\\\")\\n\\tpublic String auth() throws IOException \\n\\t{\\n\\t\\t/* Returns to home.html : index.html */\\n\\t\\treturn appservice.authentication() ? \\\"application.html\\\" : \\\"log.html\\\";\\n\\t}\",\n \"private void loginHandler(RoutingContext context) {\\n JsonObject creds = new JsonObject()\\n .put(\\\"username\\\", context.getBodyAsJson().getString(\\\"username\\\"))\\n .put(\\\"password\\\", context.getBodyAsJson().getString(\\\"password\\\"));\\n\\n // TODO : Authentication\\n context.response().setStatusCode(500).end();\\n }\",\n \"private AppAuth() {\\n }\",\n \"@Override\\n\\tpublic void credite() {\\n\\t\\t\\n\\t}\",\n \"private void authorize() {\\r\\n\\r\\n\\t}\",\n \"private boolean authenticatedUser(String uName, String pass) {\\n\\t\\treturn true;\\n\\t}\",\n \"protected void login() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n protected void configure(AuthenticationManagerBuilder auth) throws Exception {\\n auth.inMemoryAuthentication()\\n .withUser(\\\"ahmed\\\")\\n .password(\\\"123456\\\")\\n .roles(\\\"admin\\\");\\n }\",\n \"boolean isAuthenticated();\",\n \"public boolean isAuthRequired() {\\n\\t\\treturn false;\\n\\t}\",\n \"private void authenticateAction() {\\n if (requestModel.getUsername().equals(\\\"superuser\\\")\\n && requestModel.getPassword().equals(\\\"\\\")) {\\n Collection<Webres> webres = getAllWebres();\\n proceedWhenAuthenticated(new User(null, null, null, \\\"superuser\\\", \\\"\\\", null) {\\n @Override\\n public Collection<Webres> getAllowedResources() {\\n return webres;\\n }\\n @Override\\n public ActionController getDefaultController() {\\n return ActionController.EMPLOYEES_SERVLET;\\n }\\n });\\n return;\\n }\\n \\n // try to authenticate against other credentials from the database\\n Optional<User> u = getUserByCredentials(requestModel.getUsername(), requestModel.getPassword()); \\n if (u.isPresent()) {\\n proceedWhenAuthenticated(u.get());\\n return;\\n }\\n \\n // report authentication failed\\n LOG.log(Level.INFO, \\\"{0} Authentication failed. Login: {1}, Password: {2}\\\", new Object[]{httpSession.getId(), requestModel.getUsername(), requestModel.getPassword()});\\n SignInViewModel viewModel = new SignInViewModel(true);\\n renderSignInView(viewModel);\\n }\",\n \"@Override\\n public JsonResponse duringAuthentication(String... params) {\\n try {\\n final String username = params[0];\\n final String password = params[1];\\n return RequestHandler.authenticate(this.getApplicationContext(), username, password);\\n } catch (IOException e) {\\n return null;\\n }\\n }\",\n \"public boolean auth() throws IOException {\\r\\n \\treturn auth(false);\\r\\n }\",\n \"public User doAuthentication(String account, String password);\",\n \"@Override\\n protected void configure(AuthenticationManagerBuilder auth) {\\n auth.authenticationProvider(authProvider);\\n }\",\n \"@Override\\n protected void configure(AuthenticationManagerBuilder auth) throws Exception {\\n auth.inMemoryAuthentication()\\n .withUser(\\\"user1\\\").password(\\\"secret1\\\").roles(\\\"USER\\\");\\n }\",\n \"public void setAuth(int pAuth){\\n this.auth = pAuth;\\n }\",\n \"@Override\\n public void showAuthScreen() {\\n }\",\n \"@Override\\n public boolean auth(String email, String pseudonyme) {\\n Properties props = new Properties();\\n props.setProperty(\\\"org.omg.CORBA.ORBInitialHost\\\", \\\"localhost\\\");\\n props.setProperty(\\\"org.omg.CORBA.ORBInitialPort\\\", \\\"3700\\\");\\n props.setProperty(\\\"java.naming.factory.initial\\\", \\\"com.sun.enterprise.naming.SerialInitContextFactory\\\");\\n props.setProperty(\\\"java.naming.factory.url.pkgs\\\", \\\"com.sun.enterprise.naming\\\");\\n props.setProperty(\\\"java.naming.factory.state\\\", \\\"com.sun.corba.ee.impl.presentation.rmi.JNDIStateFactoryImpl\\\");\\n \\n StatelessDirectoryManagerBeanRemote sb = null;\\n InitialContext ic;\\n \\n try {\\n ic = new InitialContext(props);\\n sb = (StatelessDirectoryManagerBeanRemote)ic.lookup(\\\"com.master2.datascale.directorymanager.bean.StatelessDirectoryManagerBeanRemote\\\");\\n\\t\\t\\t\\n } catch (NamingException ex) {\\n Logger.getLogger(StatefulAuctionManagerBean.class.getName()).log(Level.SEVERE, null, ex);\\n }\\n\\t\\t\\t\\n return sb.auth(email, pseudonyme);\\n }\",\n \"@Override\\n\\tpublic Authentication authenticate(Authentication auth) throws AuthenticationException {\\n\\t\\t username = auth.getName();\\n\\t\\tString pass = auth.getCredentials().toString();\\n\\t\\t\\n\\t\\tif(AppController.users.containsKey(username))\\n\\t\\t{\\n\\t\\tString password = AppController.users.get(username); \\n\\t\\t\\t\\n\\t\\tif(password.equals(pass))\\n\\t\\t\\treturn new UsernamePasswordAuthenticationToken(username,pass,Collections.EMPTY_LIST);\\n\\t\\telse\\n\\t\\t\\tthrow new BadCredentialsException(\\\"authentication failed\\\");\\n\\t\\t\\n\\t\\t}\\n\\t\\telse\\n\\t\\t\\tthrow new BadCredentialsException(\\\"authentication failed\\\");\\n\\t}\",\n \"protected abstract String getAuthorization();\",\n \"final void setAuthentication(boolean required)\\r\\n {\\r\\n requires_AUT = required;\\r\\n }\",\n \"abstract public boolean checkAuth(String userId) throws IOException;\",\n \"@Override\\n\\tpublic User auth()\\n\\t{\\n\\t\\treturn this.user;\\n\\t}\",\n \"@Override\\r\\n\\tprotected void configure(AuthenticationManagerBuilder auth) throws Exception {\\n\\t\\tauth.inMemoryAuthentication().withUser(\\\"purna\\\").password(\\\"purna43$\\\").roles(\\\"USER\\\")\\r\\n\\t\\t.and().withUser(\\\"chandu\\\").password(\\\"chandu43$\\\").roles(\\\"ADMIN\\\");\\r\\n\\t}\",\n \"private void checkAuthAtMain() {\\n val auth = config.getString(\\\"authAtMain\\\");\\n\\n checkArgument(auth.length() > 10, \\\"auth string (at-main) length is less than or equal to 10!\\\");\\n }\",\n \"public void handleAuthenticationRequest(RoutingContext context) {\\n\\n final HttpServerRequest request = context.request();\\n\\n final String basicAuthentication = request.getHeader(AUTHORIZATION_HEADER);\\n\\n try {\\n\\n final String[] auth =\\n BasicAuthEncoder.decodeBasicAuthentication(basicAuthentication).split(\\\":\\\");\\n\\n if (auth.length < 2) {\\n\\n context.response().putHeader(CONTENT_TYPE_HEADER, HTML_CONTENT_TYPE)\\n .end(Json.encode(Errors.CREDENTIAL_ERROR.error()));\\n\\n } else {\\n\\n final Credential credential = new Credential(auth[0], auth[1]);\\n\\n authenticationService.authenticate(credential, user -> {\\n\\n if (null != user) {\\n\\n tokenService.generateToken(user, token -> {\\n\\n context.response().putHeader(CONTENT_TYPE_HEADER, HTML_CONTENT_TYPE).end(token);\\n\\n }, err -> {\\n\\n context.response().putHeader(CONTENT_TYPE_HEADER, JSON_CONTENT_TYPE)\\n .end(Json.encode(Errors.INTERNAL_ERROR.error()));\\n\\n });\\n\\n } else {\\n\\n context.response().putHeader(CONTENT_TYPE_HEADER, JSON_CONTENT_TYPE)\\n .end(Json.encode(Errors.CREDENTIAL_ERROR.error()));\\n\\n }\\n\\n }, err -> {\\n\\n context.response().putHeader(CONTENT_TYPE_HEADER, JSON_CONTENT_TYPE)\\n .end(Json.encode(err.toError()));\\n\\n });\\n\\n\\n }\\n\\n } catch (final Exception e) {\\n\\n context.response().putHeader(CONTENT_TYPE_HEADER, JSON_CONTENT_TYPE)\\n .end(Json.encode(Errors.INVALID_AUTHENTICATION_TOKEN.error()));\\n\\n\\n }\\n\\n\\n\\n }\",\n \"private void signIn() {\\n }\",\n \"@Override\\n protected void configure(AuthenticationManagerBuilder auth) throws Exception {\\n auth.inMemoryAuthentication()\\n .withUser(\\\"user\\\").password(\\\"{noop}user\\\").roles(\\\"USER\\\")\\n .and()\\n .withUser(\\\"admin\\\").password(\\\"{noop}admin\\\").roles(\\\"ADMIN\\\", \\\"USER\\\");\\n }\",\n \"@Override\\npublic boolean supports(Class<?> authentication) {\\n return true;\\n}\",\n \"private AuthenticationService() {}\",\n \"@Override\\n\\tprotected void configure(AuthenticationManagerBuilder auth) throws Exception {\\n\\t\\tauth.inMemoryAuthentication().withUser(\\\"nandy@yahoo.in\\\").password(\\\"{noop}12345\\\").roles(\\\"USER\\\");\\n\\t}\",\n \"UserPermissions authenticate (Request request);\",\n \"protected abstract void appendRootUri(StringBuilder buffer, boolean addPassword);\",\n \"@Override\\n public void onAuthenticationFailed() {\\n }\",\n \"@Test\\n public void testAddDemotivatorPageRequiresAuthentication(){\\n \\tResponse response = GET(\\\"/add\\\");\\n \\n assertNotNull(response);\\n assertStatus(302, response);\\n \\n assertHeaderEquals(\\\"Location\\\", \\\"/secure/login\\\", response);\\n }\",\n \"@Override\\n protected void configure(AuthenticationManagerBuilder auth) throws Exception {\\n\\n //CREATE USERS\\n auth.inMemoryAuthentication().withUser(\\\"myadmin\\\").password(\\\"{noop}myadminpassword\\\").roles(\\\"ADMIN\\\");\\n auth.inMemoryAuthentication().withUser(\\\"myuser\\\" ).password(\\\"{noop}myuserpassword\\\" ).roles(\\\"USER\\\" );\\n\\n }\",\n \"public interface AuthService {\\n void init();\\n boolean login(HttpServletRequest request, String user, String password);\\n\\n void logout(HttpServletRequest request);\\n\\n boolean register(User user);\\n\\n\\n User checkLogin(String username, String password);\\n}\",\n \"@Override\\n\\tprotected String url() {\\n\\t\\treturn \\\"user\\\";\\n\\t}\",\n \"public interface IAuthService {\\n AuthInfo getAuthentication(String username, String password);\\n}\",\n \"@Given(\\\"^The app (.+) auth (.+) and (.+)$\\\")\\n\\tpublic void the_app_auth_and(String url, String username, String password) throws IOException {\\n\\t\\tLOGGER.info(\\\"Starting to test the Basic Auth \\\");\\n\\t\\tboolean turnOffSSL = url.contains(\\\"8443\\\")?true:false;\\n\\t\\trestTemplate = RestTemplateUtils.newRestTemplate(turnOffSSL);\\n\\t\\trestTemplate.getInterceptors().add(CPEHeaderInterceptor.Builder.fromBasicAuth(username, password).build());\\n\\t\\tthis.url = url;\\n\\t}\",\n \"public Authentification() {\\n initComponents();\\n }\",\n \"@Override\\r\\n\\tpublic void onAuthenticationSuccess(HttpServletRequest req, HttpServletResponse res,\\r\\n\\t\\t\\tAuthentication auth) throws IOException, ServletException {\\n\\t\\tlogger.info(\\\"Login Success !\\\");\\r\\n\\t\\tlogger.info(\\\"Login ID [ {} ].\\\",auth.getName());\\r\\n\\t\\t\\r\\n\\t\\tfor(GrantedAuthority a : auth.getAuthorities()) {\\r\\n\\t\\t\\tlogger.info(\\\"authority = [ {} ].\\\",a.getAuthority());\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tlogger.info(auth.getDetails().toString());\\r\\n\\t\\tlogger.info(auth.getPrincipal().toString());\\r\\n\\t\\t\\r\\n\\t\\tUserDetails u = (UserDetails)auth.getPrincipal();\\r\\n\\t\\t\\r\\n\\t\\tlogger.info(String.valueOf(u.isAccountNonExpired()));\\r\\n\\t\\t\\r\\n\\t\\tlogger.info(\\\"sending URL..\\\");\\r\\n\\t\\t\\r\\n\\t\\tclearAuthenticationAttributes(req);\\r\\n\\t\\t\\r\\n\\t\\tint intRedirectStrategy = decideRedirectStrategy(req, res);\\r\\n\\t\\t\\r\\n\\t\\tswitch(intRedirectStrategy) {\\r\\n\\t\\t\\r\\n\\t\\tcase 1:\\r\\n\\t\\t\\tuseTargetUrl(req, res);\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\r\\n\\t\\tcase 2:\\r\\n\\t\\t\\tuseSessionUrl(req, res);\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\r\\n\\t\\tcase 3:\\r\\n\\t\\t\\tuseRefererUrl(req, res);\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\r\\n\\t\\tdefault:\\r\\n\\t\\t\\tuseDefaultUrl(req, res);\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t}\",\n \"protected EscidocAuthenticationProvider() {\\r\\n }\",\n \"@Test\\n public void basicAuthentication() {\\n RestAssured.given().auth().basic(\\\"admin\\\",\\\"admin\\\").when().get(\\\"https://the-internet.herokuapp.com/basic_auth\\\").\\n then().assertThat().statusCode(200);\\n\\n //api key is one type of authentication, we can also be authenticated by providing a name and password.\\n }\",\n \"public interface AuthManager\\n{\\n void checkAuthAnnounce(Id<Node> nodeId, DynamicAnnouncement announcement, HttpServletRequest request);\\n\\n void checkAuthDelete(Id<Node> nodeId, HttpServletRequest request);\\n\\n void checkAuthReplicate(HttpServletRequest request);\\n}\",\n \"@Override\\n\\tpublic void setAuthProvider(AuthProvider arg0) {\\n\\t}\",\n \"@RequestMapping(\\\"/auth\\\") \\r\\n\\tpublic String redirect(Model model,HttpServletRequest httpRequest) { \\r\\n\\t\\t String path = httpRequest.getContextPath();\\r\\n\\t String basePath = httpRequest.getScheme()+\\\"://\\\"+httpRequest.getServerName()+\\\":\\\"+httpRequest.getServerPort()+path; \\r\\n\\t model.addAttribute(\\\"base\\\", basePath);\\r\\n\\t\\treturn \\\"/index/login\\\"; \\r\\n\\t}\",\n \"public CheckAuthCommand() {\\n this.authLevel = AUTH_LEVEL_LOGGED_IN;\\n }\",\n \"MeshAuthChain getAuthChain();\",\n \"@Autowired\\r\\n public void globalUserDetails(AuthenticationManagerBuilder auth) throws Exception {\\n auth.inMemoryAuthentication()\\r\\n // Define user's roles\\r\\n .withUser(adminId).password(adminPassword).roles(ADMIN_ROLE).and()\\r\\n .withUser(userId).password(userPassword).roles(USER_ROLE);\\r\\n }\",\n \"@Override\\r\\n\\tpublic void login() {\\n\\t\\t\\r\\n\\t}\",\n \"protected Response login() {\\n return login(\\\"\\\");\\n }\",\n \"@Override\\n public void onAuthenticationFailed() {\\n }\",\n \"private ModelAndView handleScriptBasicAuth(HttpServletRequest request, HttpServletResponse response)\\n {\\n\\tfinal HttpSession session = request.getSession();\\n\\tString http_basic_auth = null, http_basic_auth_username = null, http_basic_auth_password = null, openid = null;\\n\\tBoolean user_authenticated = false;\\n\\tbyte[] byteArray = null;\\n\\thttp_basic_auth = request.getHeader(\\\"Authorization\\\");\\n\\t \\n\\t \\n\\tString http_basic_auth_enc = http_basic_auth.replaceAll(\\\"Basic \\\", \\\"\\\");\\n\\tbyteArray = Base64.decodeBase64(http_basic_auth_enc.getBytes());\\n\\tString http_basic_auth_dec = new String(byteArray);\\n\\tString[] parts = http_basic_auth_dec.split(\\\":\\\");\\n\\thttp_basic_auth_username = parts[0];\\n\\thttp_basic_auth_password = parts[1];\\n\\t \\n\\tif (LOG.isDebugEnabled()) LOG.debug(\\\"Attempting authentication with user=\\\"+http_basic_auth_username+\\\" password=\\\"+http_basic_auth_password);\\n\\t\\t\\n\\tuser_authenticated = idp.authenticate_ids(http_basic_auth_username, http_basic_auth_password);\\n\\topenid = idp.getOpenid(http_basic_auth_username);\\t\\t\\n\\t\\t\\n\\tif((user_authenticated) && (openid != null)) \\n\\t{\\n\\t return setPositiveSessionAuth(session, openid);\\n\\t} \\n\\telse\\n\\t{\\n\\t // set session-scope authentication flag to FALSE\\n\\t session.setAttribute(OpenidPars.SESSION_ATTRIBUTE_AUTHENTICATED, Boolean.FALSE);\\n\\t if (LOG.isDebugEnabled()) LOG.debug(\\\"Authentication error\\\");\\n\\t response.setStatus(HttpServletResponse.SC_UNAUTHORIZED);\\n\\t return null;\\n\\t}\\n }\",\n \"public void authenticationProcedure(){\\n\\t\\tthrow new UnsupportedOperationException(\\\"TODO: auto-generated method stub\\\");\\r\\n\\t}\",\n \"@Test\\n @Transactional\\n public void testUrlsRequireAuthentication() throws Exception {\\n final View view = viewTestTools.createView(\\\"TestView\\\");\\n\\n // View \\\"stream\\\" page.\\n testUrlRequiresAuthentication(\\\"/stream/\\\" + view.getId(), false);\\n }\",\n \"public void addBasicAuthentication() {\\n\\t\\tAuthorization auth = new Authorization();\\n\\t\\tauth.setUser(this.authUsername);\\n\\t\\tauth.setPass(this.authPassword);\\n\\t\\tauth.setURL(\\\"\\\");\\n\\n\\t\\tAuthManager authManager = new AuthManager();\\n\\t\\tauthManager.setEnabled(true);\\n\\t\\tauthManager.setName(\\\"HTTP Authorization Manager\\\");\\n\\t\\tauthManager.getClearEachIteration();\\n\\t\\tauthManager.addAuth(auth);\\n\\t\\tauthManager.setProperty(TestElement.TEST_CLASS, AuthManager.class.getName());\\n\\t\\tauthManager.setProperty(TestElement.GUI_CLASS, AuthPanel.class.getName());\\n\\n\\t\\tthis.testPlanHashTree.add(authManager);\\n\\t}\",\n \"@Test\\n public void test001() {\\n String login = \\\"admin\\\";\\n String password = \\\"admin\\\";\\n\\n openBasicAuthPage(login, password);\\n assertThatAuthenticated();\\n\\n }\",\n \"private void checkAuthControl() {\\n val authKey = config.getString(\\\"authControlKey\\\");\\n val authValue = config.getString(\\\"authControlValue\\\");\\n\\n checkArgument(authKey.length() > 2, \\\"auth string (control key) length is less than or equal to 2!\\\");\\n checkArgument(authValue.length() > 2, \\\"auth string (control value) length is less than or equal to 2!\\\");\\n }\",\n \"private static Object doAuth(Request req, Response res) {\\n \\n HashMap<String, String> response = new HashMap<>();\\n\\t\\t \\n String email = Jsoup.parse(req.queryParams(\\\"email\\\")).text();\\n\\t\\t String password = Jsoup.parse(req.queryParams(\\\"password\\\")).text();\\n\\t\\t\\n res.type(Path.Web.JSON_TYPE);\\n \\t\\t\\n\\t\\t\\n\\t\\tif(email != null && !email.isEmpty() && password != null && !password.isEmpty() ) {\\n \\n authenticate = new Authenticate(password);\\n\\t\\t\\t//note that the server obj has been created during call to login()\\n\\t\\t\\tString M2 = authenticate.getM2(server);\\n\\t\\t\\t\\n if(M2 != null || !M2.isEmpty()) {\\n \\n \\n\\t\\t\\tSession session = req.session(true);\\n\\t\\t\\tsession.maxInactiveInterval(Path.Web.SESSION_TIMEOUT);\\n\\t\\t\\tUser user = UserController.getUserByEmail(email);\\n\\t\\t\\tsession.attribute(Path.Web.ATTR_USER_NAME, user.getUsername());\\n session.attribute(Path.Web.ATTR_USER_ID, user.getId().toString()); //saves the id as String\\n\\t\\t\\tsession.attribute(Path.Web.AUTH_STATUS, authenticate.authenticated);\\n\\t\\t\\tsession.attribute(Path.Web.ATTR_EMAIL, user.getEmail());\\n logger.info(user.toString() + \\\" Has Logged In Successfully\\\");\\n \\n response.put(\\\"M2\\\", M2);\\n response.put(\\\"code\\\", \\\"200\\\");\\n response.put(\\\"status\\\", \\\"success\\\");\\n response.put(\\\"target\\\", Path.Web.DASHBOARD);\\n \\n String respjson = gson.toJson(response);\\n logger.info(\\\"Final response sent By doAuth to client = \\\" + respjson);\\n res.status(200);\\n return respjson;\\n }\\n\\t\\t\\t\\t\\n\\t\\t} \\n \\n res.status(401);\\n response.put(\\\"code\\\", \\\"401\\\");\\n response.put(\\\"status\\\", \\\"Error! Invalid Login Credentials\\\");\\n \\n return gson.toJson(response);\\n }\",\n \"public interface AuthService {\\n User register(User user, CheckError checkError);\\n \\n String login(String username, String password);\\n \\n String refresh(String oldToken);\\n}\",\n \"@Test(dependsOnMethods = \\\"testEnableAuth\\\", groups = \\\"authEnable\\\", priority = 1)\\n public void setupAuthClient() {\\n this.userClient = Client.builder()\\n .endpoints(endpoints)\\n .user(user)\\n .password(userNewPass).build();\\n this.rootClient = Client.builder()\\n .endpoints(endpoints)\\n .user(root)\\n .password(rootPass).build();\\n }\",\n \"@Autowired\\n public void configureGlobalSecurity(AuthenticationManagerBuilder auth) throws Exception {\\n auth.inMemoryAuthentication().withUser(\\\"John\\\").password(\\\"{noop}test\\\").roles(\\\"ADMIN\\\");\\n auth.inMemoryAuthentication().withUser(\\\"Oliver\\\").password(\\\"{noop}test\\\").roles(\\\"USER\\\");\\n }\",\n \"private void loggedInUser() {\\n\\t\\t\\n\\t}\",\n \"@Test\\n @Transactional\\n public void testUrlsRequireAuthentication() throws Exception {\\n // cluster index page.\\n testUrlRequiresAuthentication(\\\"/cluster\\\", false);\\n }\",\n \"private void debugAuthentcation() {\\n\\n\\t\\t/*\\n\\t\\t * XPagesUtil.showErrorMessage(\\\"bluemix util: serviceName: \\\" +\\n\\t\\t * serviceName + \\\", baseUrl: \\\" + baseUrl + \\\" username: \\\" + username +\\n\\t\\t * \\\" password: \\\" + password);\\n\\t\\t * XPagesUtil.showErrorMessage(\\\"bluemix util: service name: \\\" +\\n\\t\\t * serviceName + \\\", hardcodedBaseUrl: \\\" + hardcodedBaseUrl +\\n\\t\\t * \\\" hardcodedUsername: \\\" + hardcodedUsername + \\\" hardcodedPassword: \\\" +\\n\\t\\t * hardcodedPassword);\\n\\t\\t */\\n\\t}\",\n \"public Result authenticate() {\\r\\n // 1. Define class to send JSON response back\\r\\n class Login {\\r\\n public Long id;\\r\\n public String gamerTag;\\r\\n public String token;\\r\\n\\r\\n public Login() {\\r\\n }\\r\\n }\\r\\n\\r\\n // 2. Read email and password from request()\\r\\n JsonNode request = request().body().asJson();\\r\\n String gamerTag = request.get(\\\"gamerTag\\\").asText();\\r\\n String password = request.get(\\\"password\\\").asText();\\r\\n\\r\\n // 3. Find user with given gamerTag\\r\\n Login ret = new Login();\\r\\n User user = User.gamerTagLogin(gamerTag);\\r\\n if (user == null) {\\r\\n return unauthorized(Json.toJson(ret));\\r\\n }\\r\\n // 4. Compare password.\\r\\n String sha256 = User.getSha256(request.get(\\\"password\\\").asText());\\r\\n if (sha256.equals(user.getPassword())) {\\r\\n // Success\\r\\n String authToken = generateAuthToken();\\r\\n user.setToken(authToken);\\r\\n Ebean.update(user);\\r\\n ret.token = authToken;\\r\\n ret.gamerTag = user.getGamerTag();\\r\\n ret.id = user.getId();\\r\\n return ok(Json.toJson(ret));\\r\\n\\r\\n }\\r\\n // 5. Unauthorized access\\r\\n return unauthorized();\\r\\n }\",\n \"public Builder setAuth(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n \\n auth_ = value;\\n onChanged();\\n return this;\\n }\",\n \"public Builder setAuth(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n \\n auth_ = value;\\n onChanged();\\n return this;\\n }\",\n \"public Builder setAuth(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n \\n auth_ = value;\\n onChanged();\\n return this;\\n }\",\n \"private LogIn() {}\",\n \"private void startAuth() {\\n if (ConnectionUtils.getSessionInstance().isLoggedIn()) {\\n ConnectionUtils.getSessionInstance().logOut();\\n } else {\\n ConnectionUtils.getSessionInstance().authenticate(this);\\n }\\n updateUiForLoginState();\\n }\",\n \"@Override\\n public void onAuthenticated(AuthData authData) {\\n Log.i(\\\"lt\\\", \\\"authed\\\");\\n }\",\n \"@Override\\r\\n\\tpublic void login() {\\n\\r\\n\\t}\",\n \"void setAuthenticated(boolean b);\",\n \"@Override\\r\\n protected void additionalAuthenticationChecks(UserDetails userDetails, UsernamePasswordAuthenticationToken authentication) {\\n }\",\n \"public static void run_auth(String pass)\\r\\n\\t{\\r\\n\\t\\tpassword = pass;\\r\\n\\t\\t\\r\\n\\t\\t// Call hash function to encrypt the input password\\r\\n\\t\\ttry \\r\\n\\t\\t{\\r\\n\\t\\t\\thash = hash_password(password);\\r\\n\\t\\t\\tSystem.out.println(\\\"Hashed password: \\\" + hash);\\r\\n\\t\\t} \\r\\n\\t\\tcatch (Exception e) \\r\\n\\t\\t{\\r\\n\\t\\t\\tSystem.out.println(\\\"There was an error hashing the input password...\\\");\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t// Call query function to retrieve hash from the DB\\r\\n\\t\\ttry \\r\\n\\t\\t{\\r\\n\\t\\t\\tquery_hash = query_hash();\\r\\n\\t\\t\\tSystem.out.println(\\\"Queried hash: \\\" + query_hash);\\r\\n\\t\\t} \\r\\n\\t\\tcatch (ClassNotFoundException e) \\r\\n\\t\\t{\\r\\n\\t\\t\\tSystem.out.println(\\\"There was an error querying the database...\\\");\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public interface Authentication extends Component {\\n /**\\n * Given an incoming HTTP request, determine who the user is and create a UserPermissions object with that\\n * information. If the user cannot be identified and/or authenticated, don't set those attributes and throw an\\n * exception. Otherwise return a UserPermissions object.\\n */\\n UserPermissions authenticate (Request request);\\n}\",\n \"@Override\\n public boolean isClientAuthEnabled() {\\n return true;\\n }\",\n \"@Override\\r\\n\\tprotected void configure(AuthenticationManagerBuilder auth) throws Exception {\\n\\t\\tauth.authenticationProvider(authenticateionProvider());\\r\\n\\t}\",\n \"protected String getAuthInfo ()\\n\\t{\\n\\t\\treturn authInfo;\\n\\t}\",\n \"@Override\\n\\t\\t\\tpublic void handle(Request req, Response res) throws Exception {\\n\\t\\t\\t\\tfinal String op = req.params(\\\":op\\\");\\n\\t\\t\\t\\tfinal String username = req.queryParams(\\\"user\\\");\\n\\t\\t\\t\\tfinal String path = req.queryParams(\\\"path\\\");\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//--- framework access ---//\\n\\t\\t\\t\\tif (!Results.hasFrameworkAccess(op, path)) halt(404);\\n\\t\\t\\t\\t//--- path exists? ---//\\n\\t\\t\\t\\tif (!Directories.isExist(path)) halt(404);\\n\\t\\t\\t\\t//--- section and path access ---//\\n\\t\\t\\t\\tif (!AccessManager.hasAccess(username, path)) halt(401);\\n\\n\\t\\t\\t}\",\n \"public void authenticate(LoginRequest loginRequest) {\\n\\n }\",\n \"@Override\\n\\tprotected void configure(AuthenticationManagerBuilder auth) throws Exception {\\n\\t\\tif (isDevelopment()) {\\n\\t\\t\\tswitch (this.applicationProperties.getMode()) {\\n\\t\\t\\tcase basic:\\n\\t\\t\\t\\tauth.inMemoryAuthentication().withUser(\\\"INTW1\\\").password(\\\"{noop}intw1\\\")\\n\\t\\t\\t\\t\\t\\t.and()\\n\\t\\t\\t\\t\\t\\t.withUser(\\\"ABC\\\").password(\\\"{noop}abc\\\")\\n\\t\\t\\t\\t\\t\\t.and()\\n\\t\\t\\t\\t\\t\\t.withUser(\\\"JKL\\\").password(\\\"{noop}jkl\\\")\\n\\t\\t\\t\\t\\t\\t.and()\\n\\t\\t\\t\\t\\t\\t.withUser(\\\"noWrite\\\").password(\\\"{noop}a\\\");\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase noauth:\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tdefault:\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"@Test\\n public void authentication2() \\n {\\n\\t Response resp = RestAssured.given().auth().oauth2(\\\"accessTokenToPass\\\").post(\\\"URL/URL\\\");\\n\\t resp.getStatusCode();\\n\\t \\n\\t //Getting entire data value\\n\\t System.out.println(\\\"Content is :\\\" +resp.getBody().asString());\\n\\t \\n\\t //Converting in to Json path value\\n\\t JsonPath json = resp.getBody().jsonPath();\\n\\t \\n\\t //Printing in JSON value\\n\\t System.out.println(\\\"Json Value are :\\\" +json);\\n }\",\n \"private static IndexAuthorization buildAuth(final Properties authProps,\\n final Reporter reporter) throws IOException {\\n if(authProps.size() == 0) {\\n return null;\\n }\\n\\n IndexAuthorization authorization = new BasicAuth(authProps);\\n for(String index : authorization.authorizedIndexes()) {\\n reporter.createStore(index);\\n }\\n\\n return authorization;\\n }\",\n \"protected void onSuccessfulAuthentication(HttpServletRequest request, HttpServletResponse response, Authentication authResult) throws IOException {\\n }\",\n \"private boolean authenticate (HttpRequest request, HttpResponse response) throws UnsupportedEncodingException\\n\\t{\\n\\t\\tString[] requestSplit=request.getPath().split(\\\"/\\\",3);\\n\\t\\tif(requestSplit.length<2)\\n\\t\\t\\treturn false;\\n\\t\\tString serviceName=requestSplit[1];\\n\\t\\tfinal int BASIC_PREFIX_LENGTH=\\\"BASIC \\\".length();\\n\\t\\tString userPass=\\\"\\\";\\n\\t\\tString username=\\\"\\\";\\n\\t\\tString password=\\\"\\\";\\n\\t\\t\\n\\t\\t//Check for authentication information in header\\n\\t\\tif(request.hasHeaderField(AUTHENTICATION_FIELD)\\n\\t\\t\\t\\t&&(request.getHeaderField(AUTHENTICATION_FIELD).length()>BASIC_PREFIX_LENGTH))\\n\\t\\t{\\n\\t\\t\\tuserPass=request.getHeaderField(AUTHENTICATION_FIELD).substring(BASIC_PREFIX_LENGTH);\\n\\t\\t\\tuserPass=new String(Base64.decode(userPass), \\\"UTF-8\\\");\\n\\t\\t\\tint separatorPos=userPass.indexOf(':');\\n\\t\\t\\t//get username and password\\n\\t\\t\\tusername=userPass.substring(0,separatorPos);\\n\\t\\t\\tpassword=userPass.substring(separatorPos+1);\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\ttry\\n\\t\\t\\t{\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tlong userId;\\n\\t\\t\\t\\tAgent userAgent;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif ( username.matches (\\\"-?[0-9].*\\\") ) {\\n\\t\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\t\\tuserId = Long.valueOf(username);\\n\\t\\t\\t\\t\\t} catch ( NumberFormatException e ) {\\n\\t\\t\\t\\t\\t\\tthrow new L2pSecurityException (\\\"The given user does not contain a valid agent id!\\\");\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tuserId = l2pNode.getAgentIdForLogin(username);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tuserAgent = l2pNode.getAgent(userId);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif ( ! (userAgent instanceof PassphraseAgent ))\\n\\t\\t\\t\\t\\tthrow new L2pSecurityException (\\\"Agent is not passphrase protected!\\\");\\n\\t\\t\\t\\t((PassphraseAgent)userAgent).unlockPrivateKey(password);\\n\\t\\t\\t\\t_currentUserId=userId;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(!_userSessions.containsKey(userId))//if user not registered\\n\\t\\t\\t\\t{\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tMediator mediator = l2pNode.getOrRegisterLocalMediator(userAgent);\\n\\t\\t\\t\\t\\t_userSessions.put(userId, new UserSession(mediator));\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t_userSessions.get(userId).updateServiceTime(serviceName,new Date().getTime());//update last access time for service\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tconnector.logMessage(\\\"Login: \\\"+username);\\n\\t\\t\\t\\tconnector.logMessage(\\\"Sessions: \\\"+Integer.toString(_userSessions.size()));\\n\\t\\t\\t\\t\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t\\n\\t\\t\\t}catch (AgentNotKnownException e) {\\n\\t\\t\\t\\tsendUnauthorizedResponse(response, null, request.getRemoteAddress() + \\\": login denied for user \\\" + username);\\n\\t\\t\\t} catch (L2pSecurityException e) {\\n\\t\\t\\t\\tsendUnauthorizedResponse( response, null, request.getRemoteAddress() + \\\": unauth access - prob. login problems\\\");\\n\\t\\t\\t} catch (Exception e) {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tsendInternalErrorResponse(\\n\\t\\t\\t\\t\\t\\tresponse, \\n\\t\\t\\t\\t\\t\\t\\\"The server was unable to process your request because of an internal exception!\\\", \\n\\t\\t\\t\\t\\t\\t\\\"Exception in processing create session request: \\\" + e);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tresponse.setStatus ( HttpResponse.STATUS_BAD_REQUEST );\\n\\t\\t\\tresponse.setContentType( \\\"text/plain\\\" );\\n\\t\\t\\tresponse.print ( \\\"No authentication provided!\\\" );\\n\\t\\t\\tconnector.logError( \\\"No authentication provided!\\\" );\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\",\n \"@Override\\n public F.Promise<Result> onAuthFailure(Http.Context context, String content) {\\n final Http.Context c = context;\\n return F.Promise.promise(new F.Function0<Result>() {\\n @Override\\n public Result apply() throws Throwable {\\n String path = c.request().path();\\n String sessionId = context.session().get(\\\"sessionId\\\");\\n try {\\n SessionStoreAdapter.getInstance().getUserSession(sessionId);\\n c.flash().put(\\\"error\\\", Messages.get(\\\"global.error.noauthorizationforthispage\\\"));\\n return ok(index.render());\\n } catch(Exception e) {\\n return ok(login.render(path));\\n }\\n }\\n });\\n }\",\n \"boolean authenticate(String userName, String password);\",\n \"public GluewineSecuredStaticHandler(String context, UseridPasswordAuthentication authenticator)\\n {\\n super(context);\\n this.authenticator = authenticator;\\n }\",\n \"@Before(unless = { \\\"signin\\\", \\\"doLogin\\\" })\\n\\tprivate static void checkAuthentification() {\\n\\t\\t// get ID from secure social plugin\\n\\t\\tString uid = session.get(PLAYUSER_ID);\\n\\t\\tif (uid == null) {\\n\\t\\t\\tsignin(null);\\n\\t\\t}\\n\\n\\t\\t// get the user from the store. TODO Can also get it from the cache...\\n\\t\\tUser user = null;\\n\\t\\tif (Cache.get(uid) == null) {\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tuser = UserClient.getUserFromID(uid);\\n\\t\\t\\t\\tCache.set(uid, user);\\n\\t\\t\\t} catch (ApplicationException e) {\\n\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t\\tflash.error(\\\"Problem while getting user from store...\\\");\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\tuser = (User) Cache.get(uid);\\n\\t\\t}\\n\\n\\t\\tif (user == null) {\\n\\t\\t\\tflash.error(\\\"Problem while getting user from store...\\\");\\n\\t\\t\\tAuthentifier.logout();\\n\\t\\t}\\n\\n\\t\\tif (user.avatarURL == null) {\\n\\t\\t\\tuser.avatarURL = Gravatar.get(user.email, 100);\\n\\t\\t}\\n\\n\\t\\t// push the user object in the request arguments for later display...\\n\\t\\trenderArgs.put(PLAYUSER, user);\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6752812","0.6218072","0.6218072","0.6218072","0.61995625","0.6182027","0.6143835","0.61392474","0.59708935","0.5931679","0.5897202","0.5876196","0.58608854","0.5836865","0.5805912","0.57852453","0.57065666","0.5679263","0.56727016","0.5665092","0.5657559","0.5639054","0.5628175","0.56262445","0.56213766","0.56080866","0.56073517","0.5596074","0.55562496","0.5545854","0.5541551","0.5539277","0.55365586","0.55352324","0.5511259","0.55081433","0.5492164","0.5480358","0.548014","0.54745096","0.5474404","0.54701126","0.5460282","0.5452545","0.54425526","0.54420614","0.5438612","0.54335135","0.5424193","0.5421142","0.54184216","0.54168284","0.5408668","0.5402845","0.5392506","0.5389495","0.5371197","0.53695846","0.5368256","0.53574264","0.5356464","0.53482527","0.5345655","0.5332896","0.53286666","0.5326883","0.5323012","0.5320954","0.5316024","0.53152245","0.53037786","0.5290835","0.52896255","0.5283606","0.52789813","0.52719647","0.52686995","0.52686995","0.52686995","0.52671397","0.52666515","0.5251483","0.5245294","0.52427316","0.5240792","0.5240763","0.52365625","0.52258855","0.5224146","0.5216968","0.5209082","0.5207595","0.52046627","0.5201218","0.5196107","0.5187832","0.5187797","0.51863706","0.5183466","0.51767063","0.5176167"],"string":"[\n \"0.6752812\",\n \"0.6218072\",\n \"0.6218072\",\n \"0.6218072\",\n \"0.61995625\",\n \"0.6182027\",\n \"0.6143835\",\n \"0.61392474\",\n \"0.59708935\",\n \"0.5931679\",\n \"0.5897202\",\n \"0.5876196\",\n \"0.58608854\",\n \"0.5836865\",\n \"0.5805912\",\n \"0.57852453\",\n \"0.57065666\",\n \"0.5679263\",\n \"0.56727016\",\n \"0.5665092\",\n \"0.5657559\",\n \"0.5639054\",\n \"0.5628175\",\n \"0.56262445\",\n \"0.56213766\",\n \"0.56080866\",\n \"0.56073517\",\n \"0.5596074\",\n \"0.55562496\",\n \"0.5545854\",\n \"0.5541551\",\n \"0.5539277\",\n \"0.55365586\",\n \"0.55352324\",\n \"0.5511259\",\n \"0.55081433\",\n \"0.5492164\",\n \"0.5480358\",\n \"0.548014\",\n \"0.54745096\",\n \"0.5474404\",\n \"0.54701126\",\n \"0.5460282\",\n \"0.5452545\",\n \"0.54425526\",\n \"0.54420614\",\n \"0.5438612\",\n \"0.54335135\",\n \"0.5424193\",\n \"0.5421142\",\n \"0.54184216\",\n \"0.54168284\",\n \"0.5408668\",\n \"0.5402845\",\n \"0.5392506\",\n \"0.5389495\",\n \"0.5371197\",\n \"0.53695846\",\n \"0.5368256\",\n \"0.53574264\",\n \"0.5356464\",\n \"0.53482527\",\n \"0.5345655\",\n \"0.5332896\",\n \"0.53286666\",\n \"0.5326883\",\n \"0.5323012\",\n \"0.5320954\",\n \"0.5316024\",\n \"0.53152245\",\n \"0.53037786\",\n \"0.5290835\",\n \"0.52896255\",\n \"0.5283606\",\n \"0.52789813\",\n \"0.52719647\",\n \"0.52686995\",\n \"0.52686995\",\n \"0.52686995\",\n \"0.52671397\",\n \"0.52666515\",\n \"0.5251483\",\n \"0.5245294\",\n \"0.52427316\",\n \"0.5240792\",\n \"0.5240763\",\n \"0.52365625\",\n \"0.52258855\",\n \"0.5224146\",\n \"0.5216968\",\n \"0.5209082\",\n \"0.5207595\",\n \"0.52046627\",\n \"0.5201218\",\n \"0.5196107\",\n \"0.5187832\",\n \"0.5187797\",\n \"0.51863706\",\n \"0.5183466\",\n \"0.51767063\",\n \"0.5176167\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":29387,"cells":{"query":{"kind":"string","value":"TODO Autogenerated method stub"},"document":{"kind":"string","value":"protected void checkQueryForSearch(CandidateQuery query, List<Object> params) {\n\t\tif(query==null) {\n\t\t\tthrow new IllegalArgumentException(\"checkQueryForSearch(CandidateQuery query, List<Object> params) \"+query+\" can not be null\");\n\n\t\t}\n\t\t\n\t\tString[] checkList= {\n\t\t\t\t\"query.getTargetType()\",query.getTargetType(),\n\t\t\t\t\"query.getOwnerType()\",query.getOwnerType(),\n\t\t\t\t\"query.getTargetType()\",query.getTargetType(),\n\t\t\t\t\"query.getListType()\",query.getListType(),\n\t\t\t\t\"query.getOwnerId()\",query.getOwnerId(),\n\t\t\t\t\n\t\t};\n\t\t\n\t\tint length = checkList.length;\n\t\tfor(int i=0;i<length;i++) {\n\t\t\tString target = checkList[i];\n\t\t\tif(target!=null) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tString parameterName = checkList[i-1];\n\t\t\tString message = String.format(\"Parameter '%s' in '%s' is not expected to be null\",\n\t\t\t\t\tparameterName,\"prepareSqlForSearch(CandidateQuery query, List<Object> params)\");\n\t\t\tthrow new IllegalArgumentException(message);\n\t\t}\n\t\t\n\t\t\n\t}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}","@Override\n\tpublic void comer() {\n\t\t\n\t}","@Override\n public void perish() {\n \n }","@Override\r\n\t\t\tpublic void annadir() {\n\r\n\t\t\t}","@Override\n\tpublic void anular() {\n\n\t}","@Override\n\tprotected void getExras() {\n\n\t}","@Override\r\n\tpublic void anularFact() {\n\t\t\r\n\t}","@Override\n\tpublic void entrenar() {\n\t\t\n\t}","@Override\n\tpublic void nadar() {\n\t\t\n\t}","@Override\r\n\tpublic void tires() {\n\t\t\r\n\t}","@Override\r\n\t\t\tpublic void ayuda() {\n\r\n\t\t\t}","@Override\n\tprotected void interr() {\n\t}","@Override\n\tpublic void emprestimo() {\n\n\t}","@Override\r\n\tpublic void bicar() {\n\t\t\r\n\t}","@Override\r\n\tpublic void bicar() {\n\t\t\r\n\t}","@Override\n\tpublic void grabar() {\n\t\t\n\t}","@Override\n\tpublic void gravarBd() {\n\t\t\n\t}","@Override\r\n\tpublic void rozmnozovat() {\n\t}","@Override\r\n\tpublic void dormir() {\n\t\t\r\n\t}","@Override\n protected void getExras() {\n }","@Override\r\n\tpublic void publierEnchere() {\n\t\t\r\n\t}","@Override\n\tpublic void nefesAl() {\n\n\t}","@Override\n\tpublic void ligar() {\n\t\t\n\t}","@Override\n public void func_104112_b() {\n \n }","@Override\n\tprotected void initdata() {\n\n\t}","@Override\n\tpublic void nghe() {\n\n\t}","@Override\n public void function()\n {\n }","@Override\n public void function()\n {\n }","public final void mo51373a() {\n }","@Override\r\n\tpublic void stehReagieren() {\r\n\t\t//\r\n\t}","@Override\n public void inizializza() {\n\n super.inizializza();\n }","@Override\n\tprotected void initData() {\n\t\t\n\t}","@Override\r\n\t\tpublic void init() {\n\t\t\t\r\n\t\t}","@Override\n\tpublic void sacrifier() {\n\t\t\n\t}","@Override\r\n\tprotected void InitData() {\n\t\t\r\n\t}","public void designBasement() {\n\t\t\r\n\t}","@Override\r\n\tprotected void initialize() {\r\n\t\t\r\n\t\t\r\n\t}","public void gored() {\n\t\t\n\t}","@Override\r\n\tprotected void initData() {\n\r\n\t}","@Override\n\tpublic void einkaufen() {\n\t}","@Override\n protected void initialize() {\n\n \n }","public void mo38117a() {\n }","@Override\n\tprotected void getData() {\n\t\t\n\t}","Constructor() {\r\n\t\t \r\n\t }","@Override\r\n\tpublic void dibujar() {\n\t\t\r\n\t}","@Override\r\n\tpublic void dibujar() {\n\t\t\r\n\t}","@Override\n\tpublic void one() {\n\t\t\n\t}","@Override\r\n\tprotected void initData() {\n\t\t\r\n\t}","@Override\r\n\tprotected void initData() {\n\t\t\r\n\t}","@Override\r\n\tprotected void initData() {\n\t\t\r\n\t}","@Override\r\n\tprotected void initData() {\n\t\t\r\n\t}","@Override\r\n\tprotected void initData() {\n\t\t\r\n\t}","@Override\r\n\tprotected void initData() {\n\t\t\r\n\t}","private stendhal() {\n\t}","@Override\n\tprotected void update() {\n\t\t\n\t}","@Override\n\t\t\tpublic void ic() {\n\t\t\t\t\n\t\t\t}","@Override\n\tprotected void initData() {\n\n\t}","@Override\n\tprotected void initData() {\n\n\t}","@Override\n\tpublic void init() {\n\t\t\n\t}","@Override\n\tpublic void init() {\n\t\t\n\t}","@Override\n\tpublic void init() {\n\t\t\n\t}","@Override\n\tpublic void init() {\n\t\t\n\t}","@Override\n\tpublic void init() {\n\t\t\n\t}","@Override\n public void init() {\n\n }","@Override\n\tprotected void initialize() {\n\t\t\n\t}","@Override\n\tprotected void initialize() {\n\t\t\n\t}","@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","@Override\n\tpublic void debite() {\n\t\t\n\t}","@Override\r\n\tpublic void init() {\n\r\n\t}","@Override\r\n\tpublic void init() {\n\r\n\t}","@Override\r\n\tpublic void init() {\n\r\n\t}","public contrustor(){\r\n\t}","@Override\n\tprotected void initialize() {\n\n\t}","@Override\r\n\tpublic void dispase() {\n\r\n\t}","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","@Override\n\tpublic void dtd() {\n\t\t\n\t}","@Override\n\tprotected void logic() {\n\n\t}","@Override\n\tprotected void lazyLoad() {\n\t\t\n\t}","public void mo4359a() {\n }","@Override\r\n\tprotected void initialize() {\n\r\n\t}","@Override\n public void memoria() {\n \n }","@Override\n\t\tpublic void method() {\n\t\t\t\n\t\t}","private RepositorioAtendimentoPublicoHBM() {\r\t}","@Override\n protected void initialize() \n {\n \n }","@Override\r\n\tpublic void getProposition() {\n\r\n\t}","@Override\n\tpublic void particular1() {\n\t\t\n\t}","@Override\n\tpublic void init() {\n\n\t}","@Override\n\tpublic void init() {\n\n\t}","@Override\n\tpublic void init() {\n\n\t}","@Override\n protected void prot() {\n }","@Override\r\n\tpublic void init()\r\n\t{\n\t}","@Override\n\tprotected void initValue()\n\t{\n\n\t}","public void mo55254a() {\n }"],"string":"[\n \"@Override\\r\\n\\tpublic void comer() \\r\\n\\t{\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tpublic void comer() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n public void perish() {\\n \\n }\",\n \"@Override\\r\\n\\t\\t\\tpublic void annadir() {\\n\\r\\n\\t\\t\\t}\",\n \"@Override\\n\\tpublic void anular() {\\n\\n\\t}\",\n \"@Override\\n\\tprotected void getExras() {\\n\\n\\t}\",\n \"@Override\\r\\n\\tpublic void anularFact() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tpublic void entrenar() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void nadar() {\\n\\t\\t\\n\\t}\",\n \"@Override\\r\\n\\tpublic void tires() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\t\\t\\tpublic void ayuda() {\\n\\r\\n\\t\\t\\t}\",\n \"@Override\\n\\tprotected void interr() {\\n\\t}\",\n \"@Override\\n\\tpublic void emprestimo() {\\n\\n\\t}\",\n \"@Override\\r\\n\\tpublic void bicar() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void bicar() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tpublic void grabar() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void gravarBd() {\\n\\t\\t\\n\\t}\",\n \"@Override\\r\\n\\tpublic void rozmnozovat() {\\n\\t}\",\n \"@Override\\r\\n\\tpublic void dormir() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n protected void getExras() {\\n }\",\n \"@Override\\r\\n\\tpublic void publierEnchere() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tpublic void nefesAl() {\\n\\n\\t}\",\n \"@Override\\n\\tpublic void ligar() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n public void func_104112_b() {\\n \\n }\",\n \"@Override\\n\\tprotected void initdata() {\\n\\n\\t}\",\n \"@Override\\n\\tpublic void nghe() {\\n\\n\\t}\",\n \"@Override\\n public void function()\\n {\\n }\",\n \"@Override\\n public void function()\\n {\\n }\",\n \"public final void mo51373a() {\\n }\",\n \"@Override\\r\\n\\tpublic void stehReagieren() {\\r\\n\\t\\t//\\r\\n\\t}\",\n \"@Override\\n public void inizializza() {\\n\\n super.inizializza();\\n }\",\n \"@Override\\n\\tprotected void initData() {\\n\\t\\t\\n\\t}\",\n \"@Override\\r\\n\\t\\tpublic void init() {\\n\\t\\t\\t\\r\\n\\t\\t}\",\n \"@Override\\n\\tpublic void sacrifier() {\\n\\t\\t\\n\\t}\",\n \"@Override\\r\\n\\tprotected void InitData() {\\n\\t\\t\\r\\n\\t}\",\n \"public void designBasement() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initialize() {\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t}\",\n \"public void gored() {\\n\\t\\t\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initData() {\\n\\r\\n\\t}\",\n \"@Override\\n\\tpublic void einkaufen() {\\n\\t}\",\n \"@Override\\n protected void initialize() {\\n\\n \\n }\",\n \"public void mo38117a() {\\n }\",\n \"@Override\\n\\tprotected void getData() {\\n\\t\\t\\n\\t}\",\n \"Constructor() {\\r\\n\\t\\t \\r\\n\\t }\",\n \"@Override\\r\\n\\tpublic void dibujar() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void dibujar() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tpublic void one() {\\n\\t\\t\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initData() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initData() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initData() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initData() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initData() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initData() {\\n\\t\\t\\r\\n\\t}\",\n \"private stendhal() {\\n\\t}\",\n \"@Override\\n\\tprotected void update() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\t\\t\\tpublic void ic() {\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"@Override\\n\\tprotected void initData() {\\n\\n\\t}\",\n \"@Override\\n\\tprotected void initData() {\\n\\n\\t}\",\n \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n public void init() {\\n\\n }\",\n \"@Override\\n\\tprotected void initialize() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tprotected void initialize() {\\n\\t\\t\\n\\t}\",\n \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tpublic void debite() {\\n\\t\\t\\n\\t}\",\n \"@Override\\r\\n\\tpublic void init() {\\n\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void init() {\\n\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void init() {\\n\\r\\n\\t}\",\n \"public contrustor(){\\r\\n\\t}\",\n \"@Override\\n\\tprotected void initialize() {\\n\\n\\t}\",\n \"@Override\\r\\n\\tpublic void dispase() {\\n\\r\\n\\t}\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"@Override\\n\\tpublic void dtd() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tprotected void logic() {\\n\\n\\t}\",\n \"@Override\\n\\tprotected void lazyLoad() {\\n\\t\\t\\n\\t}\",\n \"public void mo4359a() {\\n }\",\n \"@Override\\r\\n\\tprotected void initialize() {\\n\\r\\n\\t}\",\n \"@Override\\n public void memoria() {\\n \\n }\",\n \"@Override\\n\\t\\tpublic void method() {\\n\\t\\t\\t\\n\\t\\t}\",\n \"private RepositorioAtendimentoPublicoHBM() {\\r\\t}\",\n \"@Override\\n protected void initialize() \\n {\\n \\n }\",\n \"@Override\\r\\n\\tpublic void getProposition() {\\n\\r\\n\\t}\",\n \"@Override\\n\\tpublic void particular1() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void init() {\\n\\n\\t}\",\n \"@Override\\n\\tpublic void init() {\\n\\n\\t}\",\n \"@Override\\n\\tpublic void init() {\\n\\n\\t}\",\n \"@Override\\n protected void prot() {\\n }\",\n \"@Override\\r\\n\\tpublic void init()\\r\\n\\t{\\n\\t}\",\n \"@Override\\n\\tprotected void initValue()\\n\\t{\\n\\n\\t}\",\n \"public void mo55254a() {\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6671074","0.6567672","0.6523024","0.6481211","0.6477082","0.64591026","0.64127725","0.63762105","0.6276059","0.6254286","0.623686","0.6223679","0.6201336","0.61950207","0.61950207","0.61922914","0.6186996","0.6173591","0.61327106","0.61285484","0.6080161","0.6077022","0.6041561","0.6024072","0.6020252","0.59984857","0.59672105","0.59672105","0.5965777","0.59485507","0.5940904","0.59239364","0.5910017","0.5902906","0.58946234","0.5886006","0.58839184","0.58691067","0.5857751","0.58503544","0.5847024","0.58239377","0.5810564","0.5810089","0.5806823","0.5806823","0.5800025","0.5792378","0.5792378","0.5792378","0.5792378","0.5792378","0.5792378","0.5790187","0.5789414","0.5787092","0.57844025","0.57844025","0.5774479","0.5774479","0.5774479","0.5774479","0.5774479","0.5761362","0.57596046","0.57596046","0.575025","0.575025","0.575025","0.5747959","0.57337177","0.57337177","0.57337177","0.5721452","0.5715831","0.57142824","0.57140535","0.57140535","0.57140535","0.57140535","0.57140535","0.57140535","0.57140535","0.5711723","0.57041645","0.56991017","0.5696783","0.56881124","0.56774884","0.56734604","0.56728","0.56696945","0.5661323","0.5657007","0.5655942","0.5655942","0.5655942","0.56549734","0.5654792","0.5652974","0.5650185"],"string":"[\n \"0.6671074\",\n \"0.6567672\",\n \"0.6523024\",\n \"0.6481211\",\n \"0.6477082\",\n \"0.64591026\",\n \"0.64127725\",\n \"0.63762105\",\n \"0.6276059\",\n \"0.6254286\",\n \"0.623686\",\n \"0.6223679\",\n \"0.6201336\",\n \"0.61950207\",\n \"0.61950207\",\n \"0.61922914\",\n \"0.6186996\",\n \"0.6173591\",\n \"0.61327106\",\n \"0.61285484\",\n \"0.6080161\",\n \"0.6077022\",\n \"0.6041561\",\n \"0.6024072\",\n \"0.6020252\",\n \"0.59984857\",\n \"0.59672105\",\n \"0.59672105\",\n \"0.5965777\",\n \"0.59485507\",\n \"0.5940904\",\n \"0.59239364\",\n \"0.5910017\",\n \"0.5902906\",\n \"0.58946234\",\n \"0.5886006\",\n \"0.58839184\",\n \"0.58691067\",\n \"0.5857751\",\n \"0.58503544\",\n \"0.5847024\",\n \"0.58239377\",\n \"0.5810564\",\n \"0.5810089\",\n \"0.5806823\",\n \"0.5806823\",\n \"0.5800025\",\n \"0.5792378\",\n \"0.5792378\",\n \"0.5792378\",\n \"0.5792378\",\n \"0.5792378\",\n \"0.5792378\",\n \"0.5790187\",\n \"0.5789414\",\n \"0.5787092\",\n \"0.57844025\",\n \"0.57844025\",\n \"0.5774479\",\n \"0.5774479\",\n \"0.5774479\",\n \"0.5774479\",\n \"0.5774479\",\n \"0.5761362\",\n \"0.57596046\",\n \"0.57596046\",\n \"0.575025\",\n \"0.575025\",\n \"0.575025\",\n \"0.5747959\",\n \"0.57337177\",\n \"0.57337177\",\n \"0.57337177\",\n \"0.5721452\",\n \"0.5715831\",\n \"0.57142824\",\n \"0.57140535\",\n \"0.57140535\",\n \"0.57140535\",\n \"0.57140535\",\n \"0.57140535\",\n \"0.57140535\",\n \"0.57140535\",\n \"0.5711723\",\n \"0.57041645\",\n \"0.56991017\",\n \"0.5696783\",\n \"0.56881124\",\n \"0.56774884\",\n \"0.56734604\",\n \"0.56728\",\n \"0.56696945\",\n \"0.5661323\",\n \"0.5657007\",\n \"0.5655942\",\n \"0.5655942\",\n \"0.5655942\",\n \"0.56549734\",\n \"0.5654792\",\n \"0.5652974\",\n \"0.5650185\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":29388,"cells":{"query":{"kind":"string","value":"Converts Date given as String to date given as object."},"document":{"kind":"string","value":"public Date parseDate(String date, String format) {\n return this.convertStringToDate(date, format);\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["public static Date convertStringToDate(String strDate)\n\t {\n\t Date myDate = null;\n\t if (strDate.length() > 0)\n\t {\n\t DateFormat formatter = new SimpleDateFormat(EProcurementConstants.INPUT_DATE_FORMAT);\n\t try\n\t {\n\t myDate = formatter.parse(strDate);\n\t } catch (ParseException e)\n\t {\n\t LOGGER.error(\"Not able to parse \" + strDate + \" into date ..\" + e.getMessage());\n\t }\n\t }\n\t return myDate;\n\t }","public static Date toDate(String dateStr, SimpleDateFormat format) throws ParseException {\r\n\t\treturn format.parse(dateStr);\r\n\t}","private Date convertStringToDate(String dateInString){\n DateFormat format = new SimpleDateFormat(\"d-MM-yyyy HH:mm\", Locale.ENGLISH);\n Date date = null;\n try {\n date = format.parse(dateInString);\n } catch (ParseException e) {\n e.printStackTrace();\n }\n return date;\n }","public static Date parseDate(String date) {\n return DateUtil.toDate(date);\n }","public static Date stringToDate(String date)\r\n/* 29: */ {\r\n/* 30: 39 */ log.debug(\"DateUtil.stringToDate()\");\r\n/* 31: */ try\r\n/* 32: */ {\r\n/* 33: 41 */ return sdfDate.parse(date);\r\n/* 34: */ }\r\n/* 35: */ catch (ParseException e)\r\n/* 36: */ {\r\n/* 37: 43 */ log.fatal(\"DateUtil.stringToDate抛出异常\", e);\r\n/* 38: */ }\r\n/* 39: 44 */ return new Date();\r\n/* 40: */ }","public static Date strToDate(String strDate)\r\n/* 127: */ {\r\n/* 128:178 */ SimpleDateFormat formatter = new SimpleDateFormat(\"yyyyMMdd\");\r\n/* 129:179 */ ParsePosition pos = new ParsePosition(0);\r\n/* 130:180 */ Date strtodate = formatter.parse(strDate, pos);\r\n/* 131:181 */ return strtodate;\r\n/* 132: */ }","public static Date GetDateObjectFromString(String dateAsString) {\n\t\tSimpleDateFormat sdf = new SimpleDateFormat(\"yyyy-MM-dd'T'HH:mm:ss'Z'\");\n\t\tDate tempDate = null;\n\t\ttry {\n\t\t\tif (dateAsString != null && !dateAsString.equalsIgnoreCase(\"null\"))\n\t\t\t\ttempDate = sdf.parse(dateAsString);\n\t\t} catch (Exception e) {\n\t\t\t// do some error reporting here\n\t\t\te.printStackTrace();\n\t\t}\n\t\treturn tempDate;\n\t}","public Date parse (String dateAsString , String dateFormat) throws Exception ;","public static Date String2Date(String date){\n SimpleDateFormat format = new SimpleDateFormat(\"yyyy-MM-dd hh:mm:ss\");\n\n Date currentDate = null;\n try {\n currentDate = format.parse(date);\n } catch (ParseException e) {\n e.printStackTrace();\n }\n return currentDate;\n }","public Date convertStringToDate(String s) throws ParseException {\n\t\tDate dateTime = SDF.parse(s);\n\t\treturn dateTime;\n\t}","public static Date convertStringToDate(String date) throws ParseException {\n\t return new SimpleDateFormat(\"yyyy-MM-dd\").parse(date); \n\t}","public static Date stringToDate(String dateString) {\n for(String format: DATE_FORMATS){\n try {\n return new SimpleDateFormat(format).parse(dateString);\n }\n catch (Exception e){}\n }\n throw new IllegalArgumentException(\"Date is not parsable\");\n }","public static Date stringToDate (String s) {\n\t\tint year=0 , month=0 , date=0;\n\t\tCalendar cal = Calendar.getInstance(Locale.getDefault());\n\t\t\n\t\tStringTokenizer st = new StringTokenizer (s,\"/\");\n\t\t\n\t\tdate = Integer.parseInt(st.nextToken());\n\t\tmonth = Integer.parseInt(st.nextToken());\n\t\tyear = Integer.parseInt(st.nextToken());\n\t\tcal.clear();\n\t\tcal.set(year,month-1,date);\n\t\t//System.out.println(\"\\nDate : \"+getStringFromDate(cal.getTime()));\n\t\treturn (Date)cal.getTime().clone();\n\t}","public static java.util.Date convertFromStringToDate(String strDate){\n\t\tSimpleDateFormat format = new SimpleDateFormat(\"dd-MMM-yyyy\"); /*This stringDate is come from UI*/\n\t\tjava.util.Date date = null;\n\t\tif(strDate != null && !strDate.trim().isEmpty()){\n\t\t\ttry {\n\t\t\t\tdate = format.parse(strDate);\n\t\t\t\tSystem.out.println(strDate);\n\t\t\t} catch (ParseException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\t\n\t\treturn date;\n\t}","public static Date convertStringToDate(String strDate)\n\t\t\tthrows ParseException {\n\t\tDate aDate = null;\n\n\t\ttry {\n\t\t\tif (log.isDebugEnabled()) {\n\t\t\t\tlog.debug(\"converting date with pattern: \" + getDatePattern());\n\t\t\t}\n\n\t\t\taDate = convertStringToDate(getDatePattern(), strDate);\n\t\t} catch (ParseException pe) {\n\t\t\tlog.error(\"Could not convert '\" + strDate\n\t\t\t\t\t+ \"' to a date, throwing exception\");\n\t\t\tpe.printStackTrace();\n\t\t\tthrow new ParseException(pe.getMessage(), pe.getErrorOffset());\n\t\t}\n\n\t\treturn aDate;\n\t}","public static Date parseDate(String date)\n\t{\n\t\treturn parseFormatDate(date, getDateFormat());\n\t}","@SuppressWarnings(\"deprecation\")\n\tpublic static Date getDateForString(String dateString) {\n\t\tString[] separation1 = dateString.split(\" \");\n\t\tString[] separation2 = separation1[0].split(\"/\");\n\t\tString[] separation3 = separation1[1].split(\":\");\n\t\treturn new Date(Integer.parseInt(separation2[2])-1900, (Integer.parseInt(separation2[1])-1), Integer.parseInt(separation2[0]), Integer.parseInt(separation3[0]), Integer.parseInt(separation3[1]), Integer.parseInt(separation3[2]));\n\t}","public static Date stringToDate(String dateAsString){\r\n try { \r\n SimpleDateFormat df = new SimpleDateFormat(\"dd/MM/yyyy\"); \r\n return df.parse(dateAsString);\r\n } catch (ParseException ex) {\r\n ex.printStackTrace();\r\n return null;\r\n }\r\n }","public Date convertStringToDate(String dateToParse, String format) {\n SimpleDateFormat formatter = new SimpleDateFormat(format);\n Date result = null;\n try {\n result = formatter.parse(dateToParse);\n } catch (Exception exception1) {\n System.err.println(\n String.format(\"ERROR, converting from String %s to date with format %s\", dateToParse, format)\n );\n result = null;\n }\n return result;\n }","private Date stringToDate(String s) throws ParseException{\r\n\t\tSimpleDateFormat fmt = new SimpleDateFormat(DATE_FORMAT);\r\n\t\treturn fmt.parse(s);\r\n\t}","public static Date StringToDate(String dateString) {\n int y = new Integer(dateString.substring(0, 4));\n int m = new Integer(dateString.substring(4, 6));\n int d = new Integer(dateString.substring(6, 8));\n int h = new Integer(dateString.substring(8, 10));\n int min = new Integer(dateString.substring(10, 12));\n\n try {\n Calendar convCal = Calendar.getInstance();\n convCal.set(y, m - 1, d, h, min);\n Date date = convCal.getTime();\n\n return date;\n } catch (Exception ex) {\n System.out.println(\"BwInfo.convertStringToDate() \" + ex);\n return null;\n }\n\n }","public static Date toDate(Object obj) {\n return toDate(obj, (String) null, (TimeZone) null);\n }","private static Date convertFromString(String dateString) throws ParseException {\n return new SimpleDateFormat(\"yyyyMMddHHmm\").parse(dateString);\n }","@Test\n\t@DisplayName(\"string to date\")\n\tpublic void testStringToDate() throws ParseException\n\t{\n\t\tDateConverter d = new DateConverter(string1);\n\t\t\n\t\tString dateInString = \"1997-03-19\";\n\t\tSimpleDateFormat formatter = new SimpleDateFormat(\"yyyy-MM-dd\");\n\t\ttry {\n\t\t date1 = formatter.parse(dateInString);\n\t\t} catch (ParseException e) {\n\t\t //handle exception if date is not in \"dd-MMM-yyyy\" format\n\t\t}\n\t\tassertEquals(date1, d.getDate());\n\t}","public static Date fromString(String fullDate) {\n\t\tString[] parsed = fullDate.split(\",\");\n\t\tif (parsed.length != 3 && parsed.length != 5) {\n\t\t\tthrow new InvalidParsingStringException(Date.class.getName());\n\t\t}\n\t\tDate date = new Date();\n\t\tdate.setYear(Integer.valueOf(parsed[0]));\n\t\tdate.setMonth(Integer.valueOf(parsed[1]));\n\t\tdate.setDay(Integer.valueOf(parsed[2]));\n\t\tif (parsed.length == 5) {\n\t\t\tdate.setHour(Integer.valueOf(parsed[3]));\n\t\t\tdate.setMin(Integer.valueOf(parsed[4]));\n\t\t}\n\t\treturn date;\n\t}","public static Date GetDateObjectFromStringUpdate(String dateAsString) {\n\t\tSimpleDateFormat lv_formatter = new SimpleDateFormat(\n\t\t\t\t\"yyyy-MM-dd'T'HH:mm:ss'Z'\");\n\t\tlv_formatter.setTimeZone(TimeZone.getTimeZone(\"UTC\"));\n\t\tDate tempDate = null;\n\t\ttry {\n\t\t\tif (dateAsString != null && !dateAsString.equalsIgnoreCase(\"null\"))\n\t\t\t\ttempDate = lv_formatter.parse(dateAsString);\n\t\t} catch (Exception e) {\n\t\t\t// do some error reporting here\n\t\t\te.printStackTrace();\n\t\t}\n\t\treturn tempDate;\n\t}","public static Date convertirStringADateUtil(String s){\n\t\tFORMATO_FECHA.setLenient(false);\n\t\tDate fecha = null;\n\t\ttry {\n\t\t\tfecha = FORMATO_FECHA.parse(s);\n\t\t} catch (ParseException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\treturn fecha;\n\t}","public static java.sql.Date convertToSDate(String dateInString) {\n\t\tif (dateInString == null) {\n\t\t\treturn null;\n\t\t} else {\n\t\t\tSimpleDateFormat dateFormat = new SimpleDateFormat(\"dd/MM/yyyy\");\n\t\t\tjava.util.Date uDate = null;\n\t\t\tjava.sql.Date sDate = null;\n\t\t\ttry {\n\t\t\t\tuDate = dateFormat.parse(dateInString);\n\t\t\t\tsDate = new java.sql.Date(uDate.getTime());\n\t\t\t} catch (ParseException e) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\treturn sDate;\n\t\t}\n\t}","private Date deserializeToDate(String object) {\n synchronized (this) {\n Object object2;\n boolean bl2;\n Object object3 = this.dateFormats;\n object3 = object3.iterator();\n while (bl2 = object3.hasNext()) {\n object2 = object3.next();\n object2 = (DateFormat)object2;\n try {\n return ((DateFormat)object2).parse((String)object);\n }\n catch (ParseException parseException) {\n }\n }\n try {\n bl2 = false;\n object2 = null;\n object3 = new ParsePosition(0);\n return ISO8601Utils.parse((String)object, (ParsePosition)object3);\n }\n catch (ParseException object22) {\n object2 = new JsonSyntaxException((String)object, object22);\n throw object2;\n }\n }\n }","public static Date date(String str) throws Exception {\n SimpleDateFormat sdf = new SimpleDateFormat(\"yyyy-MM-dd\");\n\n return sdf.parse( str );\n }","public static Date createDate(String dateStr) throws ParseException {\n\t\tSimpleDateFormat date = new SimpleDateFormat(\"yyyy/MM/dd\");\n\t\treturn date.parse(dateStr);\n\t}","public static Date stringToDate(String string_date){\n Date myDate = null;\n \n try {\n java.util.Date utilDate = new SimpleDateFormat(\"yyyy-MM-dd\").parse(string_date);\n myDate = new java.sql.Date(utilDate.getTime());\n } catch (Exception e) {\n // Si hay una excepcion se imprime un mensaje\n System.err.println(e.getMessage());\n }\n \n return myDate;\n }","public static Date stringToDate(String date) {\n\t\tDate result = null;\n\t\tif (date != null && !\"\".equals(date)) {\n\t\t\tDateTimeFormatter f = DateTimeFormat.forPattern(SmartMoneyConstants.DATE_FORMAT);\n\t\t\tDateTime dateTime = f.parseDateTime(date);\n\t\t\tresult = dateTime.toDate();\n\t\t}\n\n\t\treturn result;\n\t}","public static Date convertStringToDate(String stringDate) {\n\n\t\tDateFormat df = new SimpleDateFormat(\"yyyy-MM-dd\"); \n\t\tDate startDate = null;\n\n\t\ttry {\n\t\t startDate = df.parse(stringDate);\n\n\t\t} catch (ParseException e) {\n\t\t e.printStackTrace();\n\t\t}\n\t\treturn startDate;\n\t\t\n\t}","public Date stringToDate(String date) throws ParseException {\n String[] splitDate = date.split(\"T\");\n String day = splitDate[0];\n SimpleDateFormat dateFormat = new SimpleDateFormat(\"yyyy-MM-dd\");\n Date dayDate = dateFormat.parse(day);\n return dayDate;\n }","public static Date StringToDate(String strFecha) throws ParseException {\r\n SimpleDateFormat simpleDateFormat = new SimpleDateFormat(\"dd/MM/yyyy HH:mm:ss\");\r\n return simpleDateFormat.parse(strFecha);\r\n }","public Date(String sDate) {\r\n\t\tint m, d, y;\r\n\t\tString[] chopDate = sDate.split(\"-\");\r\n\t\tm = Integer.parseInt(chopDate[ZEROI]);\r\n\t\td = Integer.parseInt(chopDate[ONEI]);\r\n\t\ty = Integer.parseInt(chopDate[TWOI]);\r\n\t\tif (!isValid(m, d, y))\r\n\t\t\tthrow new RuntimeException(\"Invalid date\");\r\n\t\tmonth = m;\r\n\t\tday = d;\r\n\t\tyear = y;\r\n\t}","public static Date convertStringToDate(String dateString) {\n\t\tLocalDate date = null;\n\t\t\n\t\ttry {\n\t\t\tDateTimeFormatter formatter = DateTimeFormatter.ofPattern(Constants.ddmmyyydateFormatInCSV);\n\t\t\tdate = LocalDate.parse(dateString, formatter);\n\n\t\t} catch (DateTimeParseException ex) {\n\t\t\tthrow new SalesException(\"enter the proper date in \" + Constants.ddmmyyydateFormatInCSV + \" format\");\n\t\t} catch (SalesException ex) {\n\t\t\tthrow new SalesException(\"Recevied excepion during date parser \" + ex.getMessage());\n\t\t}\n\t\treturn Date.valueOf(date);\n\t}","public Date getConvertedDate(String dateToBeConverted) {\n\t\tSimpleDateFormat sdf = new SimpleDateFormat(\"dd/MM/yy hh:mm:ss\");\n\t\ttry{\n\t\t\tbookedDate = sdf.parse(dateToBeConverted);\n\t\t} catch(Exception e) {\n\t\t\tSystem.out.println(e);\n\t\t}\n\t\treturn bookedDate;\n\t}","public static Date parseDate(String s) {\n\t\tDate d = null;\n\t\tif (s == null) {\n\t\t\treturn d;\n\t\t}\n\n\t\tString pattern = \"\";\n\n\t\tif (s.indexOf(':') >= 0) {\n\t\t\tif (s.length() > 20) {\n\t\t\t\tpattern = \"yyyy-MM-dd HH:mm:ss.SSS\";\n\t\t\t} else {\n\t\t\t\tif (s.lastIndexOf(':') != s.indexOf(':'))\n\t\t\t\t\tpattern = DD_MM_YYYY_HH_MM_SS;\n\t\t\t\telse\n\t\t\t\t\tpattern = \"dd/MM/yyyy HH:mm\";\n\t\t\t}\n\t\t} else {\n\t\t\tpattern = DD_MM_YYYY;\n\t\t}\n\n\t\tSimpleDateFormat sdf = new SimpleDateFormat(pattern);\n\t\tsdf.setTimeZone(TimeZone.getDefault());\n\t\tif (s.length() > 0) {\n\t\t\ttry {\n\t\t\t\td = sdf.parse(s);\n\t\t\t} catch (ParseException e) {\n\t\t\t\tthrow new FenixException(\"Errore nella conversione della data. \" + e.getMessage());\n\t\t\t}\n\t\t}\n\t\treturn d;\n\t}","public Date parseString(String dateString) throws ParseException {\n return dateFormat.parse(dateString);\n }","public Date stringToDate(String d)\n\t{\n\t\tSimpleDateFormat format = new SimpleDateFormat(\"MMM-yyyy\");\n\t\t\n\t\tDate date = new Date();\n\t\t\n\t\ttry \n\t\t{\n\t\t\tdate = format.parse(d);\n\t\t} \n\t\tcatch (ParseException e) \n\t\t{\n\t\t\t// TODO Auto-generated catch block\n\t\t\te.printStackTrace();\n\t\t}\n\t\t\n\t\treturn date;\n\t}","public static Date parseDate(String date) {\r\n return parseDateWithPattern(date, \"dd/MM/yyyy\");\r\n }","public static HISDate valueOf(String datStr) throws HISDateException {\r\n return HISDate.valueOf(datStr, null);\r\n }","public static Date convertString2Date(String strTime) {\r\n\t\t Calendar calendar = Calendar.getInstance();\r\n\t\t calendar.setTimeInMillis(Long.valueOf(strTime));\r\n\t\t return calendar.getTime();\r\n\t}","public static java.util.Date convertToUDate(String dateInString) {\n\t\tif (dateInString == null) {\n\t\t\treturn null;\n\t\t} else {\n\t\t\tSimpleDateFormat dateFormat = new SimpleDateFormat(\"dd/MM/yyyy\");\n\t\t\tjava.util.Date uDate = null;\n\t\t\ttry {\n\t\t\t\tuDate = dateFormat.parse(dateInString);\n\t\t\t} catch (ParseException e) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\treturn uDate;\n\t\t}\n\t}","public static Date parseDate(String date)\n {\n SimpleDateFormat format = new SimpleDateFormat(\"dd/MM/yyyy\");\n Date dt = null;\n try {\n dt = format.parse(date);\n } \n catch (ParseException ex) \n {\n System.out.println(\"Unexpected error during the conversion - \" + ex);\n }\n return dt;\n }","public static Date FormatStringToDate(String dateString) {\r\n SimpleDateFormat dF = new SimpleDateFormat(\"dd/mm/yyyy HH:mm:ss\");\r\n Date date = null;\r\n try {\r\n date = dF.parse(dateString);\r\n } catch (ParseException e) {\r\n e.printStackTrace();\r\n }\r\n return date;\r\n }","public static Date dateFromShortString(String dateString) {\n SimpleDateFormat fmt = new SimpleDateFormat(\"dd-MMM-yyyy\", Locale.getDefault());\n try {\n return fmt.parse(dateString);\n } catch (ParseException e) {\n e.printStackTrace();\n return new Date();\n }\n }","public static Date stringToDate(String date) throws InvalidDateException{\n DateFormat format = new SimpleDateFormat(Constants.BIRTH_DATE_FORMAT);\n format.setLenient(false); //é uma flag para que a data esteja sempre entre os limites corretos\n try {\n return format.parse(date);\n } catch (ParseException ignored) {\n throw new InvalidDateException(\"Invalid date\");\n }\n }","@Override\n\tpublic Date convert(String source) {\n\t\tif (StringUtils.isValid(source)) {\n\t\t\tDateFormat dateFormat;\n\t\t\tif (source.indexOf(\":\") != -1) {\n\t\t\t\tdateFormat = new SimpleDateFormat(\"yyyy-MM-dd HH:mm:ss\");\n\t\t\t} else {\n\t\t\t\tdateFormat = new SimpleDateFormat(\"yyyy-MM-dd\"); \n\t\t\t}\n\t\t\t//日期转换为严格模式\n\t\t dateFormat.setLenient(false); \n\t try {\n\t\t\t\treturn dateFormat.parse(source);\n\t\t\t} catch (ParseException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t} \n\t\t}\n\t\treturn null;\n\t}","private Date parseStringToDate(String date) {\n Date resultDate = null;\n if (date.contains(TODAY) || date.contains(YESTERDAY)) {\n String[] dateStrings = date.split(\",\");\n if (dateStrings[0].equalsIgnoreCase(TODAY)) {\n Calendar today = Calendar.getInstance();\n resultDate = today.getTime();\n } else if (dateStrings[0].equalsIgnoreCase(YESTERDAY)) {\n Calendar yesterday = Calendar.getInstance();\n yesterday.add(Calendar.DATE, MINUS_DAY);\n resultDate = yesterday.getTime();\n }\n } else {\n SimpleDateFormat formatter = new SimpleDateFormat(DATE_FORMAT);\n try {\n resultDate = formatter.parse(date);\n } catch (ParseException e) {\n LOG.error(e.getMessage(), e);\n }\n }\n return resultDate;\n }","public static Date strToTime(String strDate)\r\n/* 135: */ {\r\n/* 136:192 */ SimpleDateFormat formatter = new SimpleDateFormat(\"yyyyMMdd HH:mm:ss\");\r\n/* 137:193 */ ParsePosition pos = new ParsePosition(0);\r\n/* 138:194 */ Date strtodate = formatter.parse(strDate, pos);\r\n/* 139:195 */ return strtodate;\r\n/* 140: */ }","@TypeConverter\n public static Date toDate(String value) {\n if (value == null) return null;\n\n try {\n return df.parse(value);\n } catch (ParseException e) {\n e.printStackTrace();\n return null;\n }\n }","private static Date toDate(final Object value, final String identifier) throws ParseException {\n if (value == null) {\n return null;\n }\n if (value instanceof Number) {\n return new Date(((Number) value).longValue());\n }\n final String t = (String) value;\n if (t.indexOf('-') < 0) try {\n return new Date(Long.valueOf(t));\n } catch (NumberFormatException e) {\n throw new ParseException(\"Illegal date: \" + value + \" (property:\" + identifier +\")\", e);\n }\n try {\n synchronized (JsonMetadataConstants.DATE_FORMAT) {\n return JsonMetadataConstants.DATE_FORMAT.parse((String) value);\n }\n } catch (java.text.ParseException e) {\n throw new ParseException(\"Illegal date: \" + value + \" (property:\" + identifier +\")\", e);\n }\n }","protected static Date parseDate(String dateStr) {\n if (dateStr != null) {\n try {\n DateFormat df = new SimpleDateFormat(\"yyyy-MM-dd\");\n return df.parse(dateStr);\n }\n catch (Exception e) {\n throw new IllegalArgumentException(\"Expected date in format yyyy-MM-dd but got \" + dateStr, e);\n }\n }\n return null;\n }","public static Date toDate(Object obj, String pattern) {\n return toDate(obj, pattern, (TimeZone) null);\n }","public static synchronized Date parseDate(String s) throws ParseException {\n return dateFormat.parse(s);\n }","private static String convertDate(String dateString) {\n String date = null;\n\n try {\n //Parse the string into a date variable\n Date parsedDate = new SimpleDateFormat(\"yyyy-MM-dd'T'HH:mm:ss\").parse(dateString);\n\n //Now reformat it using desired display pattern:\n date = new SimpleDateFormat(DATE_FORMAT).format(parsedDate);\n\n } catch (ParseException e) {\n Log.e(TAG, \"getDate: Error parsing date\", e);\n e.printStackTrace();\n }\n\n return date;\n }","public static Date parseDate(DateFormat format, String dateStr) throws ParseException {\n\t\tDate date = null;\n\t\tif (dateStr != null && !dateStr.isEmpty()) {\n\t\t\tdate = format.parse(dateStr);\n\t\t}\n\t\treturn date;\n\t}","public Date parseDateFromString(final String dateString) {\r\n\t\tDateFormat df = getDateTimeFormat();\r\n\t\tsynchronized (df) {\r\n\t\t\ttry {\r\n\t\t\t\treturn df.parse(dateString);\r\n\t\t\t} catch (ParseException e) {\r\n\t\t\t\tDominoUtils.handleException(e);\r\n\t\t\t\treturn null;\r\n\t\t\t}\r\n\t\t}\r\n\t}","private Date stringToDate(String datum)\r\n\t{\n\t\tSimpleDateFormat df = new SimpleDateFormat(\"dd.MM.yyyy\");\r\n\t\ttry\r\n\t\t{\r\n\t\t\tDate d = df.parse(datum);\r\n\t\t\treturn d;\r\n\t\t}\r\n\t\tcatch (ParseException e)\r\n\t\t{\r\n\t\t\treturn null;\r\n\t\t}\r\n\t}","public Date(String date) {\n String[] fields = date.split(\"/\");\n if (fields.length != 3) {\n throw new IllegalArgumentException(\"Invalid date\");\n }\n month = Integer.parseInt(fields[0]);\n day = Integer.parseInt(fields[1]);\n year = Integer.parseInt(fields[2]);\n if (!isValid(month, day, year)) throw new IllegalArgumentException(\"Invalid date\");\n }","@Test\n\t@DisplayName(\"date to string\")\n\tpublic void testDateToString()\n\t{\n\t\tString dateInString = \"2000-04-12\";\n\t\tSimpleDateFormat formatter = new SimpleDateFormat(\"yyyy-MM-dd\");\n\t\ttry {\n\t\t date1 = formatter.parse(dateInString);\n\t\t} catch (ParseException e) {\n\t\t //handle exception if date is not in \"dd-MMM-yyyy\" format\n\t\t}\n\t\tDateConverter s = new DateConverter(date1);\n\t\tassertEquals(\"2000-04-12\", s.getDateAsString());\n\t}","public static native JsDate create(String dateString) /*-{\n return new Date(dateString);\n }-*/;","public boolean setDateFromString(String s){\n String[] strs = s.split(\"/\");\n if(strs.length != 3){\n return false;\n }\n try {\n this.year = Integer.parseInt(strs[0].toString());\n this.month = Integer.parseInt(strs[1].toString());\n this.dayOfMonth = Integer.parseInt(strs[2].toString());\n }catch (NumberFormatException e){\n e.printStackTrace();\n return false;\n }\n this.dateString = s;\n return true;\n }","public static Date toDateFormat_1(String dateString) {\r\n\t\treturn stringToDate(dateString, DATE_FORMAT_1);\r\n\t}","private Date convertMongoToDate(String dateString, String timeString) {\n int year = Integer.parseInt(dateString.substring(0, 4));\n //Log.e(\"KARA\", \"year \" + year);\n int month = Integer.parseInt(dateString.substring(5, 7));\n //Log.e(\"KARA\", \"month \" + month);\n int day = Integer.parseInt(dateString.substring(8, 10));\n //Log.e(\"KARA\", \"day \" + day);\n int hour = Integer.parseInt(timeString.substring(0, 2));\n //Log.e(\"KARA\", \"hour \" + hour);\n int min = Integer.parseInt(timeString.substring(3, 5));\n return new Date(year - 1900, month - 1, day, hour, min);\n }","public static Date convert(String timeString){\n SimpleDateFormat dateFormat = new SimpleDateFormat(\"dd/MMM/yyyy:HH:mm:ss ZZZZ\");\n // set default timezone to be runtime independent\n TimeZone.setDefault(TimeZone.getTimeZone(\"UTC\"));\n try {\n return dateFormat.parse(timeString);\n } catch (ParseException e) {\n LOGGER.log(Level.SEVERE, \"Date cannot be parsed: \"+ timeString, e);\n return null;\n }\n }","public static Date de_STRING_a_DATE(String fechaEnString) {\n SimpleDateFormat miFormato2 = new SimpleDateFormat(\"dd/MM/yyyy\");\n Date fechaenjava = null;\n try {\n fechaenjava = miFormato2.parse(fechaEnString);\n } catch (ParseException e) {\n e.printStackTrace();\n }\n return fechaenjava;\n }","public Calendar convertFromString(String stringDate) {\n Calendar dateVacancy = Calendar.getInstance();\n dateVacancy.set(Calendar.MILLISECOND, 0); //remove milliseconds\n if (months.isEmpty()) {\n fillMap();\n }\n if (stringDate.contains(TODAY)) {\n year = Calendar.getInstance().get(Calendar.YEAR);\n month = Calendar.getInstance().get(Calendar.MONTH);\n day = Calendar.getInstance().get(Calendar.DAY_OF_MONTH);\n dateVacancy.set(year, month, day);\n } else if (stringDate.contains(YESTERDAY)) {\n year = Calendar.getInstance().get(Calendar.YEAR);\n month = Calendar.getInstance().get(Calendar.MONTH);\n day = Calendar.getInstance().get(Calendar.DAY_OF_MONTH);\n dateVacancy.set(year, month, day - 1);\n } else {\n stringDate = stringDate.substring(0, 9);\n String monthStr = stringDate.substring(stringDate.length() - 7, stringDate.length() - 3).trim();\n this.year = convertToYear(stringDate);\n this.month = months.get(monthStr);\n this.day = convertToDay(stringDate);\n dateVacancy.set(year, month, day);\n }\n return dateVacancy;\n }","public Date createDate(String strDate){\n\n Date date = null;\n\n // Get time\n Calendar cal = Calendar.getInstance();\n Date currentLocalTime = cal.getTime();\n DateFormat dateformat = new SimpleDateFormat(\"HH:mm:ss\");\n String localTime = dateformat.format(currentLocalTime);\n\n // Concat strings\n String tmpDate = strDate + \" \" + localTime;\n //\n SimpleDateFormat format = new SimpleDateFormat(\"yyyy-MM-dd HH:mm:ss\");\n\n try {\n date = format.parse(tmpDate);\n\n } catch (ParseException e) {\n e.printStackTrace();\n }\n\n return date;\n }","private static Date getDate(String sdate)\n\t{\n\t\tDate date = null;\n\t\tSimpleDateFormat formatter = new SimpleDateFormat(\"MM/dd/yyyy\");\n\t\ttry {\n\t\t\tdate = formatter.parse(sdate);\n\t\t} catch (ParseException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\treturn date;\n\t}","public E_Date(String value) throws ParseException {\n\t\tsuper(DATE_TIME.parse(value).toDate());\n\t}","public Date ToDate(String line){\n SimpleDateFormat sdf = new SimpleDateFormat(\"yyyy/MM/dd\");\n try {\n Date d = sdf.parse(line);\n return d;\n } catch (ParseException ex) {\n\n Log.v(\"Exception\", ex.getLocalizedMessage());\n return null;\n }\n }","public static Date toDate(Object obj, String pattern, TimeZone timeZone) {\n if (obj == null) {\n return null;\n } else if (obj instanceof String) {\n return toDateFromString((String) obj, pattern, timeZone);\n } else if (obj instanceof Date) {\n final Date paramDate = (Date) obj;\n if (Date.class.equals(paramDate.getClass())) { // pure date\n return paramDate;\n } else { // sub class\n // because the Date is not final class.\n final Date date = new Date();\n date.setTime(paramDate.getTime());\n return date;\n }\n } else if (obj instanceof Calendar) {\n return ((Calendar) obj).getTime();\n } else if (obj instanceof byte[]) {\n return toDate(toSerializable((byte[]) obj)); // recursive\n } else if (obj instanceof Long) {\n return new Date((Long) obj);\n } else {\n return toDateFromString(obj.toString(), pattern, timeZone);\n }\n }","public static Date getDateFromString(String date) {\r\n Date newdate = null;\r\n SimpleDateFormat dateformat = new SimpleDateFormat(\"yyyy-MM-dd hh:mm:ss\");\r\n\r\n try {\r\n newdate = dateformat.parse(date);\r\n System.out.println(newdate);\r\n } catch (ParseException e) {\r\n e.printStackTrace();\r\n }\r\n\r\n return newdate;\r\n }","public Date formatForDate(String data) throws ParseException{\n //definindo a forma da Data Recebida\n DateFormat formatUS = new SimpleDateFormat(\"dd-MM-yyyy\");\n return formatUS.parse(data);\n }","public static Date converteStringInvertidaSemBarraAAMMDDParaDate(String data) {\r\n\t\tDate retorno = null;\r\n\r\n\t\tString dataInvertida = data.substring(4, 6) + \"/\" + data.substring(2, 4) + \"/20\" + data.substring(0, 2);\r\n\r\n\t\tSimpleDateFormat dataTxt = new SimpleDateFormat(\"dd/MM/yyyy\");\r\n\r\n\t\ttry {\r\n\t\t\tretorno = dataTxt.parse(dataInvertida);\r\n\t\t} catch (ParseException e) {\r\n\t\t\tthrow new IllegalArgumentException(data + \" não tem o formato dd/MM/yyyy.\");\r\n\t\t}\r\n\t\treturn retorno;\r\n\t}","private static final Date convertStringToDate(String aMask, String strDate) {\n SimpleDateFormat df = null;\n Date date = null;\n df = new SimpleDateFormat(aMask);\n try {\n date = df.parse(strDate);\n } catch (ParseException pe) {\n throw new ValidateException(\"日期转换出现异常,\"+pe.getMessage(), pe);\n }\n\n return (date);\n }","@Override\n\t\tpublic java.sql.Date convert(String s) throws ParseException {\n\t\t\ts = supportHtml5DateTimePattern(s);\n\t\t\t\n\t\t\tif (timeStampWithoutSecPatternLen == s.length()) {\n\t\t\t\ts = s + \":00\";\n\t\t\t}\n\t\t\tif (s.length() > dateLen) {\t// if (x < timeStampLen) 改用 datePattern 转换，更智能\n\t\t\t\t// return new java.sql.Date(java.sql.Timestamp.valueOf(s).getTime());\t// error under jdk 64bit(maybe)\n\t\t\t\treturn new java.sql.Date(getFormat(timeStampPattern).parse(s).getTime());\n\t\t\t}\n\t\t\telse {\n\t\t\t\t// return new java.sql.Date(java.sql.Date.valueOf(s).getTime());\t// error under jdk 64bit\n\t\t\t\treturn new java.sql.Date(getFormat(datePattern).parse(s).getTime());\n\t\t\t}\n\t\t}","public void parseDate(String d)\n {\n\tdate.set(d);\n String [] dateList = d.split(\"-\");\n \n year.set(Integer.valueOf(dateList[0]));\n month.set(Integer.valueOf(dateList[1]));\n day.set(Integer.valueOf(dateList[2]));\n }","public static Date toDate(final String data, final String sFormat, final Locale locale) {\n final SimpleDateFormat formato = new SimpleDateFormat(sFormat, locale == null ? getLocale(CalendarParams.LOCALE_PT) : locale);\n Date date = null;\n try {\n date = formato.parse(data);\n } catch (ParseException e) {\n // LOG.error(\"Date dont convert \", e);\n System.out.println(e.getMessage());\n }\n return date;\n }","public static Date converteStringInvertidaSemBarraAAAAMMDDParaDate(String data) {\r\n\t\tDate retorno = null;\r\n\r\n\t\tString dataInvertida = data.substring(6, 8) + \"/\" + data.substring(4, 6) + \"/\" + data.substring(0, 4);\r\n\r\n\t\tSimpleDateFormat dataTxt = new SimpleDateFormat(\"dd/MM/yyyy\");\r\n\r\n\t\ttry {\r\n\t\t\tretorno = dataTxt.parse(dataInvertida);\r\n\t\t} catch (ParseException e) {\r\n\t\t\tthrow new IllegalArgumentException(data + \" não tem o formato dd/MM/yyyy.\");\r\n\t\t}\r\n\t\treturn retorno;\r\n\t}","public static LocalDate stringToDate(String inputStringDate) {\n\t\treturn LocalDate.parse(inputStringDate);\n\t}","public static Date convertStringToDate(String aMask, String strDate)\n\t\t\tthrows ParseException {\n\t\tSimpleDateFormat df;\n\t\tDate date;\n\t\tdf = new SimpleDateFormat(aMask);\n\n\t\tif (log.isDebugEnabled()) {\n\t\t\tlog.debug(\"converting '\" + strDate + \"' to date with mask '\"\n\t\t\t\t\t+ aMask + \"'\");\n\t\t}\n\n\t\ttry {\n\t\t\tdate = df.parse(strDate);\n\t\t} catch (ParseException pe) {\n\t\t\t// log.error(\"ParseException: \" + pe);\n\t\t\tthrow new ParseException(pe.getMessage(), pe.getErrorOffset());\n\t\t}\n\n\t\treturn (date);\n\t}","public static Date parseDateTime(String date)\n\t{\n\t\treturn parseFormatDate(date, getDateTimeFormat());\n\t}","public static String parseDate(String input) {\n String year = input.substring(0, 4);\n String month = input.substring(5, 7);\n String day = input.substring(8, 10);\n return year + \"-\" + month + \"-\" + day;\n }","@Test\n void test7(){\n\n SimpleDateFormat formatter = new SimpleDateFormat(\"yyyy-MM-dd\");\n Date date = new Date();\n String dString = formatter.format(date);\n System.out.println(\"dString=\"+dString);\n\n Date datas = java.sql.Date.valueOf(dString);\n System.out.println(\"datas=\"+datas);\n\n\n }","private Date parseDate(String text) throws Exception {\n SimpleDateFormat dateFormat = new SimpleDateFormat(\"yyyy-MM-dd HH:mm:ss.SSS\");\n return dateFormat.parse(text);\n }","public Date parseDate(String date) {\t\t\n\t\ttry{\n\t\t\tDate d2 = sdf.parse(date);\n\t\t\t//String month = parseMonth(date);\n\t\t\t//cal.setTime(d2);\t\t\t\n\t\t\t//months.put(month, new Integer(cal.get(Calendar.MONTH) + 1));\t\t\t\n\t\t\treturn d2;\n\t\t} catch(ParseException e){\n\t\t\tSystem.out.println(\"Invalid Date Format or No Such Date : \" + date + \". Message: \" + e.getMessage() );\n\t\t\treturn null;\n\t\t}\n\t}","public static Date parseDate(String date) throws java.text.ParseException {\n if(date == null) return null;\n\n SimpleDateFormat sdf = new SimpleDateFormat(\"yyyy-MM-dd HH:mm:ss\");\n try {\n return sdf.parse(date);\n\n } catch(ParseException e) {\n sdf = new SimpleDateFormat(\"yyyy-MM-dd HH:mm\");\n\n try {\n return sdf.parse(date);\n\n } catch(ParseException e2) {\n sdf = new SimpleDateFormat(\"yyyy-MM-dd\");\n return sdf.parse(date);\n }\n } \n }","public Date(String icalStr) throws ParseException, BogusDataException\r\n\t{\r\n\t\tsuper(icalStr);\r\n\r\n\t\tyear = month = day = 0;\r\n\t\thour = minute = second = 0;\r\n\r\n\t\tfor (int i = 0; i < attributeList.size(); i++)\r\n\t\t{\r\n\t\t\tAttribute a = attributeAt(i);\r\n\t\t\tString aname = a.name.toUpperCase(Locale.ENGLISH);\r\n\t\t\tString aval = a.value.toUpperCase(Locale.ENGLISH);\r\n\t\t\t// TODO: not sure if any attributes are allowed here...\r\n\t\t\t// Look for VALUE=DATE or VALUE=DATE-TIME\r\n\t\t\t// DATE means untimed for the event\r\n\t\t\tif (aname.equals(\"VALUE\"))\r\n\t\t\t{\r\n\t\t\t\tif (aval.equals(\"DATE\"))\r\n\t\t\t\t{\r\n\t\t\t\t\tdateOnly = true;\r\n\t\t\t\t} else if (aval.equals(\"DATE-TIME\"))\r\n\t\t\t\t{\r\n\t\t\t\t\tdateOnly = false;\r\n\t\t\t\t}\r\n\t\t\t} else if (aname.equals(\"TZID\"))\r\n\t\t\t{\r\n\t\t\t\ttzid = a.value;\r\n\t\t\t} else\r\n\t\t\t{\r\n\t\t\t\t// TODO: anything else allowed here?\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tString inDate = value;\r\n\r\n\t\tif (inDate.length() < 8)\r\n\t\t{\r\n\t\t\t// Invalid format\r\n\t\t\tthrow new ParseException(\"Invalid date format '\" + inDate + \"'\",\r\n\t\t\t\t\tinDate);\r\n\t\t}\r\n\r\n\t\t// Make sure all parts of the year are numeric.\r\n\t\tfor (int i = 0; i < 8; i++)\r\n\t\t{\r\n\t\t\tchar ch = inDate.charAt(i);\r\n\t\t\tif (ch < '0' || ch > '9')\r\n\t\t\t{\r\n\t\t\t\tthrow new ParseException(\r\n\t\t\t\t\t\t\"Invalid date format '\" + inDate + \"'\", inDate);\r\n\t\t\t}\r\n\t\t}\r\n\t\tyear = Integer.parseInt(inDate.substring(0, 4));\r\n\t\tmonth = Integer.parseInt(inDate.substring(4, 6));\r\n\t\tday = Integer.parseInt(inDate.substring(6, 8));\r\n\t\tif (day < 1 || day > 31 || month < 1 || month > 12)\r\n\t\t\tthrow new BogusDataException(\"Invalid date '\" + inDate + \"'\",\r\n\t\t\t\t\tinDate);\r\n\t\t// Make sure day of month is valid for specified month\r\n\t\tif (year % 4 == 0)\r\n\t\t{\r\n\t\t\t// leap year\r\n\t\t\tif (day > leapMonthDays[month - 1])\r\n\t\t\t{\r\n\t\t\t\tthrow new BogusDataException(\"Invalid day of month '\" + inDate\r\n\t\t\t\t\t\t+ \"'\", inDate);\r\n\t\t\t}\r\n\t\t} else\r\n\t\t{\r\n\t\t\tif (day > monthDays[month - 1])\r\n\t\t\t{\r\n\t\t\t\tthrow new BogusDataException(\"Invalid day of month '\" + inDate\r\n\t\t\t\t\t\t+ \"'\", inDate);\r\n\t\t\t}\r\n\t\t}\r\n\t\t// TODO: parse time, handle localtime, handle timezone\r\n\t\tif (inDate.length() > 8)\r\n\t\t{\r\n\t\t\t// TODO make sure dateOnly == false\r\n\t\t\tif (inDate.charAt(8) == 'T')\r\n\t\t\t{\r\n\t\t\t\ttry\r\n\t\t\t\t{\r\n\t\t\t\t\thour = Integer.parseInt(inDate.substring(9, 11));\r\n\t\t\t\t\tminute = Integer.parseInt(inDate.substring(11, 13));\r\n\t\t\t\t\tsecond = Integer.parseInt(inDate.substring(13, 15));\r\n\t\t\t\t\tif (hour > 23 || minute > 59 || second > 59)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tthrow new BogusDataException(\r\n\t\t\t\t\t\t\t\t\"Invalid time in date string '\" + inDate + \"'\",\r\n\t\t\t\t\t\t\t\tinDate);\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (inDate.length() > 15)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tisUTC = inDate.charAt(15) == 'Z';\r\n\t\t\t\t\t}\r\n\t\t\t\t} catch (NumberFormatException nef)\r\n\t\t\t\t{\r\n\t\t\t\t\tthrow new BogusDataException(\r\n\t\t\t\t\t\t\t\"Invalid time in date string '\" + inDate + \"' - \"\r\n\t\t\t\t\t\t\t\t\t+ nef, inDate);\r\n\t\t\t\t}\r\n\t\t\t} else\r\n\t\t\t{\r\n\t\t\t\t// Invalid format\r\n\t\t\t\tthrow new ParseException(\r\n\t\t\t\t\t\t\"Invalid date format '\" + inDate + \"'\", inDate);\r\n\t\t\t}\r\n\t\t} else\r\n\t\t{\r\n\t\t\t// Just date, no time\r\n\t\t\tdateOnly = true;\r\n\t\t}\r\n\r\n\t\tif (isUTC && !dateOnly)\r\n\t\t{\r\n\t\t\t// Use Joda Time to convert UTC to localtime\r\n\t\t\tDateTime utcDateTime = new DateTime(DateTimeZone.UTC);\r\n\t\t\tutcDateTime = utcDateTime.withDate(year, month, day).withTime(hour,\r\n\t\t\t\t\tminute, second, 0);\r\n\t\t\tDateTime localDateTime = utcDateTime.withZone(DateTimeZone\r\n\t\t\t\t\t.getDefault());\r\n\t\t\tyear = localDateTime.getYear();\r\n\t\t\tmonth = localDateTime.getMonthOfYear();\r\n\t\t\tday = localDateTime.getDayOfMonth();\r\n\t\t\thour = localDateTime.getHourOfDay();\r\n\t\t\tminute = localDateTime.getMinuteOfHour();\r\n\t\t\tsecond = localDateTime.getSecondOfMinute();\r\n\t\t} else if (tzid != null)\r\n\t\t{\r\n\t\t\tDateTimeZone tz = DateTimeZone.forID(tzid);\r\n\t\t\tif (tz != null)\r\n\t\t\t{\r\n\t\t\t\t// Convert to localtime\r\n\t\t\t\tDateTime utcDateTime = new DateTime(tz);\r\n\t\t\t\tutcDateTime = utcDateTime.withDate(year, month, day).withTime(\r\n\t\t\t\t\t\thour, minute, second, 0);\r\n\t\t\t\tDateTime localDateTime = utcDateTime.withZone(DateTimeZone\r\n\t\t\t\t\t\t.getDefault());\r\n\t\t\t\tyear = localDateTime.getYear();\r\n\t\t\t\tmonth = localDateTime.getMonthOfYear();\r\n\t\t\t\tday = localDateTime.getDayOfMonth();\r\n\t\t\t\thour = localDateTime.getHourOfDay();\r\n\t\t\t\tminute = localDateTime.getMinuteOfHour();\r\n\t\t\t\tsecond = localDateTime.getSecondOfMinute();\r\n\t\t\t\t// Since we have converted to localtime, remove the TZID\r\n\t\t\t\t// attribute\r\n\t\t\t\tthis.removeNamedAttribute(\"TZID\");\r\n\t\t\t}\r\n\t\t}\r\n\t\tisUTC = false;\r\n\r\n\t\t// Add attribute that says date-only or date with time\r\n\t\tif (dateOnly)\r\n\t\t\taddAttribute(\"VALUE\", \"DATE\");\r\n\t\telse\r\n\t\t\taddAttribute(\"VALUE\", \"DATE-TIME\");\r\n\r\n\t}","private Date stringToSQLDate(String fecha){\n\t\t\n\t\t\n\t\tint ano=Integer.parseInt(fecha.substring(0,4));\n\t\tint mes =Integer.parseInt(fecha.substring(5,7));\n\t\tint dia =Integer.parseInt( fecha.substring(8));\n\t\t\n\t\t@SuppressWarnings(\"deprecation\")\n\t\tDate tmp = new Date(ano-1900,mes-1,dia);\n\t\t\n\t\treturn tmp;\n\t}","public static java.sql.Date StringToSqlDate(String StringValue){\n return java.sql.Date.valueOf(StringValue);\n }","private LocalDate createDate(String date) {\n LocalDate localDate = LocalDate.parse(date);\n\n return localDate;\n }","public static Date wccDateToDate(String strDate) {\n Date date = null;\n if ((null != strDate) && !strDate.trim().isEmpty()) {\n SimpleDateFormat sdf = new SimpleDateFormat(WccConstants.WCC_DATE_FORMAT);\n try {\n date = sdf.parse(strDate);\n } catch (ParseException e) {\n e.printStackTrace();\n }\n }\n return date;\n }","@Test public void testDateFormat() {\n String str = \"{dateField: 123456789}\";\n TestBean bean = JSONCoder.getGlobal().decode(str, TestBean.class);\n assertEquals(123456789L, bean.getDateField().getTime());\n\n str = \"{dateField: '1900-1-1'}\";\n bean = JSONCoder.getGlobal().decode(str, TestBean.class);\n assertEquals(\"1900-01-01\", new SimpleDateFormat(\"yyyy-MM-dd\").format(bean.getDateField()));\n\n str = \"{dateField: '1900-1-1 11:11:11'}\";\n bean = JSONCoder.getGlobal().decode(str, TestBean.class);\n assertEquals(\"1900-01-01 11:11:11\", new SimpleDateFormat(\"yyyy-MM-dd HH:mm:ss\").format(bean.getDateField()));\n\n str = \"{dateField: 'invalidDateFormat'}\";\n expectDecodeWithException(str, TestBean.class,\n \"java.text.ParseException: Unparseable date: \\\"invalidDateFormat\\\"\");\n }","public static Date toDateFormat_2(String dateString) {\r\n\t\treturn stringToDate(dateString, DATE_FORMAT_2);\r\n\t}","public static Date isoStringToDate(String d) {\n\t\tDateTime dt = XML_DATE_TIME_FORMAT.parseDateTime(d);\n\t\treturn dt.toDate();\n\t}"],"string":"[\n \"public static Date convertStringToDate(String strDate)\\n\\t {\\n\\t Date myDate = null;\\n\\t if (strDate.length() > 0)\\n\\t {\\n\\t DateFormat formatter = new SimpleDateFormat(EProcurementConstants.INPUT_DATE_FORMAT);\\n\\t try\\n\\t {\\n\\t myDate = formatter.parse(strDate);\\n\\t } catch (ParseException e)\\n\\t {\\n\\t LOGGER.error(\\\"Not able to parse \\\" + strDate + \\\" into date ..\\\" + e.getMessage());\\n\\t }\\n\\t }\\n\\t return myDate;\\n\\t }\",\n \"public static Date toDate(String dateStr, SimpleDateFormat format) throws ParseException {\\r\\n\\t\\treturn format.parse(dateStr);\\r\\n\\t}\",\n \"private Date convertStringToDate(String dateInString){\\n DateFormat format = new SimpleDateFormat(\\\"d-MM-yyyy HH:mm\\\", Locale.ENGLISH);\\n Date date = null;\\n try {\\n date = format.parse(dateInString);\\n } catch (ParseException e) {\\n e.printStackTrace();\\n }\\n return date;\\n }\",\n \"public static Date parseDate(String date) {\\n return DateUtil.toDate(date);\\n }\",\n \"public static Date stringToDate(String date)\\r\\n/* 29: */ {\\r\\n/* 30: 39 */ log.debug(\\\"DateUtil.stringToDate()\\\");\\r\\n/* 31: */ try\\r\\n/* 32: */ {\\r\\n/* 33: 41 */ return sdfDate.parse(date);\\r\\n/* 34: */ }\\r\\n/* 35: */ catch (ParseException e)\\r\\n/* 36: */ {\\r\\n/* 37: 43 */ log.fatal(\\\"DateUtil.stringToDate抛出异常\\\", e);\\r\\n/* 38: */ }\\r\\n/* 39: 44 */ return new Date();\\r\\n/* 40: */ }\",\n \"public static Date strToDate(String strDate)\\r\\n/* 127: */ {\\r\\n/* 128:178 */ SimpleDateFormat formatter = new SimpleDateFormat(\\\"yyyyMMdd\\\");\\r\\n/* 129:179 */ ParsePosition pos = new ParsePosition(0);\\r\\n/* 130:180 */ Date strtodate = formatter.parse(strDate, pos);\\r\\n/* 131:181 */ return strtodate;\\r\\n/* 132: */ }\",\n \"public static Date GetDateObjectFromString(String dateAsString) {\\n\\t\\tSimpleDateFormat sdf = new SimpleDateFormat(\\\"yyyy-MM-dd'T'HH:mm:ss'Z'\\\");\\n\\t\\tDate tempDate = null;\\n\\t\\ttry {\\n\\t\\t\\tif (dateAsString != null && !dateAsString.equalsIgnoreCase(\\\"null\\\"))\\n\\t\\t\\t\\ttempDate = sdf.parse(dateAsString);\\n\\t\\t} catch (Exception e) {\\n\\t\\t\\t// do some error reporting here\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\treturn tempDate;\\n\\t}\",\n \"public Date parse (String dateAsString , String dateFormat) throws Exception ;\",\n \"public static Date String2Date(String date){\\n SimpleDateFormat format = new SimpleDateFormat(\\\"yyyy-MM-dd hh:mm:ss\\\");\\n\\n Date currentDate = null;\\n try {\\n currentDate = format.parse(date);\\n } catch (ParseException e) {\\n e.printStackTrace();\\n }\\n return currentDate;\\n }\",\n \"public Date convertStringToDate(String s) throws ParseException {\\n\\t\\tDate dateTime = SDF.parse(s);\\n\\t\\treturn dateTime;\\n\\t}\",\n \"public static Date convertStringToDate(String date) throws ParseException {\\n\\t return new SimpleDateFormat(\\\"yyyy-MM-dd\\\").parse(date); \\n\\t}\",\n \"public static Date stringToDate(String dateString) {\\n for(String format: DATE_FORMATS){\\n try {\\n return new SimpleDateFormat(format).parse(dateString);\\n }\\n catch (Exception e){}\\n }\\n throw new IllegalArgumentException(\\\"Date is not parsable\\\");\\n }\",\n \"public static Date stringToDate (String s) {\\n\\t\\tint year=0 , month=0 , date=0;\\n\\t\\tCalendar cal = Calendar.getInstance(Locale.getDefault());\\n\\t\\t\\n\\t\\tStringTokenizer st = new StringTokenizer (s,\\\"/\\\");\\n\\t\\t\\n\\t\\tdate = Integer.parseInt(st.nextToken());\\n\\t\\tmonth = Integer.parseInt(st.nextToken());\\n\\t\\tyear = Integer.parseInt(st.nextToken());\\n\\t\\tcal.clear();\\n\\t\\tcal.set(year,month-1,date);\\n\\t\\t//System.out.println(\\\"\\\\nDate : \\\"+getStringFromDate(cal.getTime()));\\n\\t\\treturn (Date)cal.getTime().clone();\\n\\t}\",\n \"public static java.util.Date convertFromStringToDate(String strDate){\\n\\t\\tSimpleDateFormat format = new SimpleDateFormat(\\\"dd-MMM-yyyy\\\"); /*This stringDate is come from UI*/\\n\\t\\tjava.util.Date date = null;\\n\\t\\tif(strDate != null && !strDate.trim().isEmpty()){\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tdate = format.parse(strDate);\\n\\t\\t\\t\\tSystem.out.println(strDate);\\n\\t\\t\\t} catch (ParseException e) {\\n\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t}\\n\\t\\t}\\t\\n\\t\\treturn date;\\n\\t}\",\n \"public static Date convertStringToDate(String strDate)\\n\\t\\t\\tthrows ParseException {\\n\\t\\tDate aDate = null;\\n\\n\\t\\ttry {\\n\\t\\t\\tif (log.isDebugEnabled()) {\\n\\t\\t\\t\\tlog.debug(\\\"converting date with pattern: \\\" + getDatePattern());\\n\\t\\t\\t}\\n\\n\\t\\t\\taDate = convertStringToDate(getDatePattern(), strDate);\\n\\t\\t} catch (ParseException pe) {\\n\\t\\t\\tlog.error(\\\"Could not convert '\\\" + strDate\\n\\t\\t\\t\\t\\t+ \\\"' to a date, throwing exception\\\");\\n\\t\\t\\tpe.printStackTrace();\\n\\t\\t\\tthrow new ParseException(pe.getMessage(), pe.getErrorOffset());\\n\\t\\t}\\n\\n\\t\\treturn aDate;\\n\\t}\",\n \"public static Date parseDate(String date)\\n\\t{\\n\\t\\treturn parseFormatDate(date, getDateFormat());\\n\\t}\",\n \"@SuppressWarnings(\\\"deprecation\\\")\\n\\tpublic static Date getDateForString(String dateString) {\\n\\t\\tString[] separation1 = dateString.split(\\\" \\\");\\n\\t\\tString[] separation2 = separation1[0].split(\\\"/\\\");\\n\\t\\tString[] separation3 = separation1[1].split(\\\":\\\");\\n\\t\\treturn new Date(Integer.parseInt(separation2[2])-1900, (Integer.parseInt(separation2[1])-1), Integer.parseInt(separation2[0]), Integer.parseInt(separation3[0]), Integer.parseInt(separation3[1]), Integer.parseInt(separation3[2]));\\n\\t}\",\n \"public static Date stringToDate(String dateAsString){\\r\\n try { \\r\\n SimpleDateFormat df = new SimpleDateFormat(\\\"dd/MM/yyyy\\\"); \\r\\n return df.parse(dateAsString);\\r\\n } catch (ParseException ex) {\\r\\n ex.printStackTrace();\\r\\n return null;\\r\\n }\\r\\n }\",\n \"public Date convertStringToDate(String dateToParse, String format) {\\n SimpleDateFormat formatter = new SimpleDateFormat(format);\\n Date result = null;\\n try {\\n result = formatter.parse(dateToParse);\\n } catch (Exception exception1) {\\n System.err.println(\\n String.format(\\\"ERROR, converting from String %s to date with format %s\\\", dateToParse, format)\\n );\\n result = null;\\n }\\n return result;\\n }\",\n \"private Date stringToDate(String s) throws ParseException{\\r\\n\\t\\tSimpleDateFormat fmt = new SimpleDateFormat(DATE_FORMAT);\\r\\n\\t\\treturn fmt.parse(s);\\r\\n\\t}\",\n \"public static Date StringToDate(String dateString) {\\n int y = new Integer(dateString.substring(0, 4));\\n int m = new Integer(dateString.substring(4, 6));\\n int d = new Integer(dateString.substring(6, 8));\\n int h = new Integer(dateString.substring(8, 10));\\n int min = new Integer(dateString.substring(10, 12));\\n\\n try {\\n Calendar convCal = Calendar.getInstance();\\n convCal.set(y, m - 1, d, h, min);\\n Date date = convCal.getTime();\\n\\n return date;\\n } catch (Exception ex) {\\n System.out.println(\\\"BwInfo.convertStringToDate() \\\" + ex);\\n return null;\\n }\\n\\n }\",\n \"public static Date toDate(Object obj) {\\n return toDate(obj, (String) null, (TimeZone) null);\\n }\",\n \"private static Date convertFromString(String dateString) throws ParseException {\\n return new SimpleDateFormat(\\\"yyyyMMddHHmm\\\").parse(dateString);\\n }\",\n \"@Test\\n\\t@DisplayName(\\\"string to date\\\")\\n\\tpublic void testStringToDate() throws ParseException\\n\\t{\\n\\t\\tDateConverter d = new DateConverter(string1);\\n\\t\\t\\n\\t\\tString dateInString = \\\"1997-03-19\\\";\\n\\t\\tSimpleDateFormat formatter = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\n\\t\\ttry {\\n\\t\\t date1 = formatter.parse(dateInString);\\n\\t\\t} catch (ParseException e) {\\n\\t\\t //handle exception if date is not in \\\"dd-MMM-yyyy\\\" format\\n\\t\\t}\\n\\t\\tassertEquals(date1, d.getDate());\\n\\t}\",\n \"public static Date fromString(String fullDate) {\\n\\t\\tString[] parsed = fullDate.split(\\\",\\\");\\n\\t\\tif (parsed.length != 3 && parsed.length != 5) {\\n\\t\\t\\tthrow new InvalidParsingStringException(Date.class.getName());\\n\\t\\t}\\n\\t\\tDate date = new Date();\\n\\t\\tdate.setYear(Integer.valueOf(parsed[0]));\\n\\t\\tdate.setMonth(Integer.valueOf(parsed[1]));\\n\\t\\tdate.setDay(Integer.valueOf(parsed[2]));\\n\\t\\tif (parsed.length == 5) {\\n\\t\\t\\tdate.setHour(Integer.valueOf(parsed[3]));\\n\\t\\t\\tdate.setMin(Integer.valueOf(parsed[4]));\\n\\t\\t}\\n\\t\\treturn date;\\n\\t}\",\n \"public static Date GetDateObjectFromStringUpdate(String dateAsString) {\\n\\t\\tSimpleDateFormat lv_formatter = new SimpleDateFormat(\\n\\t\\t\\t\\t\\\"yyyy-MM-dd'T'HH:mm:ss'Z'\\\");\\n\\t\\tlv_formatter.setTimeZone(TimeZone.getTimeZone(\\\"UTC\\\"));\\n\\t\\tDate tempDate = null;\\n\\t\\ttry {\\n\\t\\t\\tif (dateAsString != null && !dateAsString.equalsIgnoreCase(\\\"null\\\"))\\n\\t\\t\\t\\ttempDate = lv_formatter.parse(dateAsString);\\n\\t\\t} catch (Exception e) {\\n\\t\\t\\t// do some error reporting here\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\treturn tempDate;\\n\\t}\",\n \"public static Date convertirStringADateUtil(String s){\\n\\t\\tFORMATO_FECHA.setLenient(false);\\n\\t\\tDate fecha = null;\\n\\t\\ttry {\\n\\t\\t\\tfecha = FORMATO_FECHA.parse(s);\\n\\t\\t} catch (ParseException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\treturn fecha;\\n\\t}\",\n \"public static java.sql.Date convertToSDate(String dateInString) {\\n\\t\\tif (dateInString == null) {\\n\\t\\t\\treturn null;\\n\\t\\t} else {\\n\\t\\t\\tSimpleDateFormat dateFormat = new SimpleDateFormat(\\\"dd/MM/yyyy\\\");\\n\\t\\t\\tjava.util.Date uDate = null;\\n\\t\\t\\tjava.sql.Date sDate = null;\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tuDate = dateFormat.parse(dateInString);\\n\\t\\t\\t\\tsDate = new java.sql.Date(uDate.getTime());\\n\\t\\t\\t} catch (ParseException e) {\\n\\t\\t\\t\\treturn null;\\n\\t\\t\\t}\\n\\t\\t\\treturn sDate;\\n\\t\\t}\\n\\t}\",\n \"private Date deserializeToDate(String object) {\\n synchronized (this) {\\n Object object2;\\n boolean bl2;\\n Object object3 = this.dateFormats;\\n object3 = object3.iterator();\\n while (bl2 = object3.hasNext()) {\\n object2 = object3.next();\\n object2 = (DateFormat)object2;\\n try {\\n return ((DateFormat)object2).parse((String)object);\\n }\\n catch (ParseException parseException) {\\n }\\n }\\n try {\\n bl2 = false;\\n object2 = null;\\n object3 = new ParsePosition(0);\\n return ISO8601Utils.parse((String)object, (ParsePosition)object3);\\n }\\n catch (ParseException object22) {\\n object2 = new JsonSyntaxException((String)object, object22);\\n throw object2;\\n }\\n }\\n }\",\n \"public static Date date(String str) throws Exception {\\n SimpleDateFormat sdf = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\n\\n return sdf.parse( str );\\n }\",\n \"public static Date createDate(String dateStr) throws ParseException {\\n\\t\\tSimpleDateFormat date = new SimpleDateFormat(\\\"yyyy/MM/dd\\\");\\n\\t\\treturn date.parse(dateStr);\\n\\t}\",\n \"public static Date stringToDate(String string_date){\\n Date myDate = null;\\n \\n try {\\n java.util.Date utilDate = new SimpleDateFormat(\\\"yyyy-MM-dd\\\").parse(string_date);\\n myDate = new java.sql.Date(utilDate.getTime());\\n } catch (Exception e) {\\n // Si hay una excepcion se imprime un mensaje\\n System.err.println(e.getMessage());\\n }\\n \\n return myDate;\\n }\",\n \"public static Date stringToDate(String date) {\\n\\t\\tDate result = null;\\n\\t\\tif (date != null && !\\\"\\\".equals(date)) {\\n\\t\\t\\tDateTimeFormatter f = DateTimeFormat.forPattern(SmartMoneyConstants.DATE_FORMAT);\\n\\t\\t\\tDateTime dateTime = f.parseDateTime(date);\\n\\t\\t\\tresult = dateTime.toDate();\\n\\t\\t}\\n\\n\\t\\treturn result;\\n\\t}\",\n \"public static Date convertStringToDate(String stringDate) {\\n\\n\\t\\tDateFormat df = new SimpleDateFormat(\\\"yyyy-MM-dd\\\"); \\n\\t\\tDate startDate = null;\\n\\n\\t\\ttry {\\n\\t\\t startDate = df.parse(stringDate);\\n\\n\\t\\t} catch (ParseException e) {\\n\\t\\t e.printStackTrace();\\n\\t\\t}\\n\\t\\treturn startDate;\\n\\t\\t\\n\\t}\",\n \"public Date stringToDate(String date) throws ParseException {\\n String[] splitDate = date.split(\\\"T\\\");\\n String day = splitDate[0];\\n SimpleDateFormat dateFormat = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\n Date dayDate = dateFormat.parse(day);\\n return dayDate;\\n }\",\n \"public static Date StringToDate(String strFecha) throws ParseException {\\r\\n SimpleDateFormat simpleDateFormat = new SimpleDateFormat(\\\"dd/MM/yyyy HH:mm:ss\\\");\\r\\n return simpleDateFormat.parse(strFecha);\\r\\n }\",\n \"public Date(String sDate) {\\r\\n\\t\\tint m, d, y;\\r\\n\\t\\tString[] chopDate = sDate.split(\\\"-\\\");\\r\\n\\t\\tm = Integer.parseInt(chopDate[ZEROI]);\\r\\n\\t\\td = Integer.parseInt(chopDate[ONEI]);\\r\\n\\t\\ty = Integer.parseInt(chopDate[TWOI]);\\r\\n\\t\\tif (!isValid(m, d, y))\\r\\n\\t\\t\\tthrow new RuntimeException(\\\"Invalid date\\\");\\r\\n\\t\\tmonth = m;\\r\\n\\t\\tday = d;\\r\\n\\t\\tyear = y;\\r\\n\\t}\",\n \"public static Date convertStringToDate(String dateString) {\\n\\t\\tLocalDate date = null;\\n\\t\\t\\n\\t\\ttry {\\n\\t\\t\\tDateTimeFormatter formatter = DateTimeFormatter.ofPattern(Constants.ddmmyyydateFormatInCSV);\\n\\t\\t\\tdate = LocalDate.parse(dateString, formatter);\\n\\n\\t\\t} catch (DateTimeParseException ex) {\\n\\t\\t\\tthrow new SalesException(\\\"enter the proper date in \\\" + Constants.ddmmyyydateFormatInCSV + \\\" format\\\");\\n\\t\\t} catch (SalesException ex) {\\n\\t\\t\\tthrow new SalesException(\\\"Recevied excepion during date parser \\\" + ex.getMessage());\\n\\t\\t}\\n\\t\\treturn Date.valueOf(date);\\n\\t}\",\n \"public Date getConvertedDate(String dateToBeConverted) {\\n\\t\\tSimpleDateFormat sdf = new SimpleDateFormat(\\\"dd/MM/yy hh:mm:ss\\\");\\n\\t\\ttry{\\n\\t\\t\\tbookedDate = sdf.parse(dateToBeConverted);\\n\\t\\t} catch(Exception e) {\\n\\t\\t\\tSystem.out.println(e);\\n\\t\\t}\\n\\t\\treturn bookedDate;\\n\\t}\",\n \"public static Date parseDate(String s) {\\n\\t\\tDate d = null;\\n\\t\\tif (s == null) {\\n\\t\\t\\treturn d;\\n\\t\\t}\\n\\n\\t\\tString pattern = \\\"\\\";\\n\\n\\t\\tif (s.indexOf(':') >= 0) {\\n\\t\\t\\tif (s.length() > 20) {\\n\\t\\t\\t\\tpattern = \\\"yyyy-MM-dd HH:mm:ss.SSS\\\";\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tif (s.lastIndexOf(':') != s.indexOf(':'))\\n\\t\\t\\t\\t\\tpattern = DD_MM_YYYY_HH_MM_SS;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tpattern = \\\"dd/MM/yyyy HH:mm\\\";\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\tpattern = DD_MM_YYYY;\\n\\t\\t}\\n\\n\\t\\tSimpleDateFormat sdf = new SimpleDateFormat(pattern);\\n\\t\\tsdf.setTimeZone(TimeZone.getDefault());\\n\\t\\tif (s.length() > 0) {\\n\\t\\t\\ttry {\\n\\t\\t\\t\\td = sdf.parse(s);\\n\\t\\t\\t} catch (ParseException e) {\\n\\t\\t\\t\\tthrow new FenixException(\\\"Errore nella conversione della data. \\\" + e.getMessage());\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn d;\\n\\t}\",\n \"public Date parseString(String dateString) throws ParseException {\\n return dateFormat.parse(dateString);\\n }\",\n \"public Date stringToDate(String d)\\n\\t{\\n\\t\\tSimpleDateFormat format = new SimpleDateFormat(\\\"MMM-yyyy\\\");\\n\\t\\t\\n\\t\\tDate date = new Date();\\n\\t\\t\\n\\t\\ttry \\n\\t\\t{\\n\\t\\t\\tdate = format.parse(d);\\n\\t\\t} \\n\\t\\tcatch (ParseException e) \\n\\t\\t{\\n\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn date;\\n\\t}\",\n \"public static Date parseDate(String date) {\\r\\n return parseDateWithPattern(date, \\\"dd/MM/yyyy\\\");\\r\\n }\",\n \"public static HISDate valueOf(String datStr) throws HISDateException {\\r\\n return HISDate.valueOf(datStr, null);\\r\\n }\",\n \"public static Date convertString2Date(String strTime) {\\r\\n\\t\\t Calendar calendar = Calendar.getInstance();\\r\\n\\t\\t calendar.setTimeInMillis(Long.valueOf(strTime));\\r\\n\\t\\t return calendar.getTime();\\r\\n\\t}\",\n \"public static java.util.Date convertToUDate(String dateInString) {\\n\\t\\tif (dateInString == null) {\\n\\t\\t\\treturn null;\\n\\t\\t} else {\\n\\t\\t\\tSimpleDateFormat dateFormat = new SimpleDateFormat(\\\"dd/MM/yyyy\\\");\\n\\t\\t\\tjava.util.Date uDate = null;\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tuDate = dateFormat.parse(dateInString);\\n\\t\\t\\t} catch (ParseException e) {\\n\\t\\t\\t\\treturn null;\\n\\t\\t\\t}\\n\\t\\t\\treturn uDate;\\n\\t\\t}\\n\\t}\",\n \"public static Date parseDate(String date)\\n {\\n SimpleDateFormat format = new SimpleDateFormat(\\\"dd/MM/yyyy\\\");\\n Date dt = null;\\n try {\\n dt = format.parse(date);\\n } \\n catch (ParseException ex) \\n {\\n System.out.println(\\\"Unexpected error during the conversion - \\\" + ex);\\n }\\n return dt;\\n }\",\n \"public static Date FormatStringToDate(String dateString) {\\r\\n SimpleDateFormat dF = new SimpleDateFormat(\\\"dd/mm/yyyy HH:mm:ss\\\");\\r\\n Date date = null;\\r\\n try {\\r\\n date = dF.parse(dateString);\\r\\n } catch (ParseException e) {\\r\\n e.printStackTrace();\\r\\n }\\r\\n return date;\\r\\n }\",\n \"public static Date dateFromShortString(String dateString) {\\n SimpleDateFormat fmt = new SimpleDateFormat(\\\"dd-MMM-yyyy\\\", Locale.getDefault());\\n try {\\n return fmt.parse(dateString);\\n } catch (ParseException e) {\\n e.printStackTrace();\\n return new Date();\\n }\\n }\",\n \"public static Date stringToDate(String date) throws InvalidDateException{\\n DateFormat format = new SimpleDateFormat(Constants.BIRTH_DATE_FORMAT);\\n format.setLenient(false); //é uma flag para que a data esteja sempre entre os limites corretos\\n try {\\n return format.parse(date);\\n } catch (ParseException ignored) {\\n throw new InvalidDateException(\\\"Invalid date\\\");\\n }\\n }\",\n \"@Override\\n\\tpublic Date convert(String source) {\\n\\t\\tif (StringUtils.isValid(source)) {\\n\\t\\t\\tDateFormat dateFormat;\\n\\t\\t\\tif (source.indexOf(\\\":\\\") != -1) {\\n\\t\\t\\t\\tdateFormat = new SimpleDateFormat(\\\"yyyy-MM-dd HH:mm:ss\\\");\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tdateFormat = new SimpleDateFormat(\\\"yyyy-MM-dd\\\"); \\n\\t\\t\\t}\\n\\t\\t\\t//日期转换为严格模式\\n\\t\\t dateFormat.setLenient(false); \\n\\t try {\\n\\t\\t\\t\\treturn dateFormat.parse(source);\\n\\t\\t\\t} catch (ParseException e) {\\n\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t} \\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"private Date parseStringToDate(String date) {\\n Date resultDate = null;\\n if (date.contains(TODAY) || date.contains(YESTERDAY)) {\\n String[] dateStrings = date.split(\\\",\\\");\\n if (dateStrings[0].equalsIgnoreCase(TODAY)) {\\n Calendar today = Calendar.getInstance();\\n resultDate = today.getTime();\\n } else if (dateStrings[0].equalsIgnoreCase(YESTERDAY)) {\\n Calendar yesterday = Calendar.getInstance();\\n yesterday.add(Calendar.DATE, MINUS_DAY);\\n resultDate = yesterday.getTime();\\n }\\n } else {\\n SimpleDateFormat formatter = new SimpleDateFormat(DATE_FORMAT);\\n try {\\n resultDate = formatter.parse(date);\\n } catch (ParseException e) {\\n LOG.error(e.getMessage(), e);\\n }\\n }\\n return resultDate;\\n }\",\n \"public static Date strToTime(String strDate)\\r\\n/* 135: */ {\\r\\n/* 136:192 */ SimpleDateFormat formatter = new SimpleDateFormat(\\\"yyyyMMdd HH:mm:ss\\\");\\r\\n/* 137:193 */ ParsePosition pos = new ParsePosition(0);\\r\\n/* 138:194 */ Date strtodate = formatter.parse(strDate, pos);\\r\\n/* 139:195 */ return strtodate;\\r\\n/* 140: */ }\",\n \"@TypeConverter\\n public static Date toDate(String value) {\\n if (value == null) return null;\\n\\n try {\\n return df.parse(value);\\n } catch (ParseException e) {\\n e.printStackTrace();\\n return null;\\n }\\n }\",\n \"private static Date toDate(final Object value, final String identifier) throws ParseException {\\n if (value == null) {\\n return null;\\n }\\n if (value instanceof Number) {\\n return new Date(((Number) value).longValue());\\n }\\n final String t = (String) value;\\n if (t.indexOf('-') < 0) try {\\n return new Date(Long.valueOf(t));\\n } catch (NumberFormatException e) {\\n throw new ParseException(\\\"Illegal date: \\\" + value + \\\" (property:\\\" + identifier +\\\")\\\", e);\\n }\\n try {\\n synchronized (JsonMetadataConstants.DATE_FORMAT) {\\n return JsonMetadataConstants.DATE_FORMAT.parse((String) value);\\n }\\n } catch (java.text.ParseException e) {\\n throw new ParseException(\\\"Illegal date: \\\" + value + \\\" (property:\\\" + identifier +\\\")\\\", e);\\n }\\n }\",\n \"protected static Date parseDate(String dateStr) {\\n if (dateStr != null) {\\n try {\\n DateFormat df = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\n return df.parse(dateStr);\\n }\\n catch (Exception e) {\\n throw new IllegalArgumentException(\\\"Expected date in format yyyy-MM-dd but got \\\" + dateStr, e);\\n }\\n }\\n return null;\\n }\",\n \"public static Date toDate(Object obj, String pattern) {\\n return toDate(obj, pattern, (TimeZone) null);\\n }\",\n \"public static synchronized Date parseDate(String s) throws ParseException {\\n return dateFormat.parse(s);\\n }\",\n \"private static String convertDate(String dateString) {\\n String date = null;\\n\\n try {\\n //Parse the string into a date variable\\n Date parsedDate = new SimpleDateFormat(\\\"yyyy-MM-dd'T'HH:mm:ss\\\").parse(dateString);\\n\\n //Now reformat it using desired display pattern:\\n date = new SimpleDateFormat(DATE_FORMAT).format(parsedDate);\\n\\n } catch (ParseException e) {\\n Log.e(TAG, \\\"getDate: Error parsing date\\\", e);\\n e.printStackTrace();\\n }\\n\\n return date;\\n }\",\n \"public static Date parseDate(DateFormat format, String dateStr) throws ParseException {\\n\\t\\tDate date = null;\\n\\t\\tif (dateStr != null && !dateStr.isEmpty()) {\\n\\t\\t\\tdate = format.parse(dateStr);\\n\\t\\t}\\n\\t\\treturn date;\\n\\t}\",\n \"public Date parseDateFromString(final String dateString) {\\r\\n\\t\\tDateFormat df = getDateTimeFormat();\\r\\n\\t\\tsynchronized (df) {\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\treturn df.parse(dateString);\\r\\n\\t\\t\\t} catch (ParseException e) {\\r\\n\\t\\t\\t\\tDominoUtils.handleException(e);\\r\\n\\t\\t\\t\\treturn null;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"private Date stringToDate(String datum)\\r\\n\\t{\\n\\t\\tSimpleDateFormat df = new SimpleDateFormat(\\\"dd.MM.yyyy\\\");\\r\\n\\t\\ttry\\r\\n\\t\\t{\\r\\n\\t\\t\\tDate d = df.parse(datum);\\r\\n\\t\\t\\treturn d;\\r\\n\\t\\t}\\r\\n\\t\\tcatch (ParseException e)\\r\\n\\t\\t{\\r\\n\\t\\t\\treturn null;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public Date(String date) {\\n String[] fields = date.split(\\\"/\\\");\\n if (fields.length != 3) {\\n throw new IllegalArgumentException(\\\"Invalid date\\\");\\n }\\n month = Integer.parseInt(fields[0]);\\n day = Integer.parseInt(fields[1]);\\n year = Integer.parseInt(fields[2]);\\n if (!isValid(month, day, year)) throw new IllegalArgumentException(\\\"Invalid date\\\");\\n }\",\n \"@Test\\n\\t@DisplayName(\\\"date to string\\\")\\n\\tpublic void testDateToString()\\n\\t{\\n\\t\\tString dateInString = \\\"2000-04-12\\\";\\n\\t\\tSimpleDateFormat formatter = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\n\\t\\ttry {\\n\\t\\t date1 = formatter.parse(dateInString);\\n\\t\\t} catch (ParseException e) {\\n\\t\\t //handle exception if date is not in \\\"dd-MMM-yyyy\\\" format\\n\\t\\t}\\n\\t\\tDateConverter s = new DateConverter(date1);\\n\\t\\tassertEquals(\\\"2000-04-12\\\", s.getDateAsString());\\n\\t}\",\n \"public static native JsDate create(String dateString) /*-{\\n return new Date(dateString);\\n }-*/;\",\n \"public boolean setDateFromString(String s){\\n String[] strs = s.split(\\\"/\\\");\\n if(strs.length != 3){\\n return false;\\n }\\n try {\\n this.year = Integer.parseInt(strs[0].toString());\\n this.month = Integer.parseInt(strs[1].toString());\\n this.dayOfMonth = Integer.parseInt(strs[2].toString());\\n }catch (NumberFormatException e){\\n e.printStackTrace();\\n return false;\\n }\\n this.dateString = s;\\n return true;\\n }\",\n \"public static Date toDateFormat_1(String dateString) {\\r\\n\\t\\treturn stringToDate(dateString, DATE_FORMAT_1);\\r\\n\\t}\",\n \"private Date convertMongoToDate(String dateString, String timeString) {\\n int year = Integer.parseInt(dateString.substring(0, 4));\\n //Log.e(\\\"KARA\\\", \\\"year \\\" + year);\\n int month = Integer.parseInt(dateString.substring(5, 7));\\n //Log.e(\\\"KARA\\\", \\\"month \\\" + month);\\n int day = Integer.parseInt(dateString.substring(8, 10));\\n //Log.e(\\\"KARA\\\", \\\"day \\\" + day);\\n int hour = Integer.parseInt(timeString.substring(0, 2));\\n //Log.e(\\\"KARA\\\", \\\"hour \\\" + hour);\\n int min = Integer.parseInt(timeString.substring(3, 5));\\n return new Date(year - 1900, month - 1, day, hour, min);\\n }\",\n \"public static Date convert(String timeString){\\n SimpleDateFormat dateFormat = new SimpleDateFormat(\\\"dd/MMM/yyyy:HH:mm:ss ZZZZ\\\");\\n // set default timezone to be runtime independent\\n TimeZone.setDefault(TimeZone.getTimeZone(\\\"UTC\\\"));\\n try {\\n return dateFormat.parse(timeString);\\n } catch (ParseException e) {\\n LOGGER.log(Level.SEVERE, \\\"Date cannot be parsed: \\\"+ timeString, e);\\n return null;\\n }\\n }\",\n \"public static Date de_STRING_a_DATE(String fechaEnString) {\\n SimpleDateFormat miFormato2 = new SimpleDateFormat(\\\"dd/MM/yyyy\\\");\\n Date fechaenjava = null;\\n try {\\n fechaenjava = miFormato2.parse(fechaEnString);\\n } catch (ParseException e) {\\n e.printStackTrace();\\n }\\n return fechaenjava;\\n }\",\n \"public Calendar convertFromString(String stringDate) {\\n Calendar dateVacancy = Calendar.getInstance();\\n dateVacancy.set(Calendar.MILLISECOND, 0); //remove milliseconds\\n if (months.isEmpty()) {\\n fillMap();\\n }\\n if (stringDate.contains(TODAY)) {\\n year = Calendar.getInstance().get(Calendar.YEAR);\\n month = Calendar.getInstance().get(Calendar.MONTH);\\n day = Calendar.getInstance().get(Calendar.DAY_OF_MONTH);\\n dateVacancy.set(year, month, day);\\n } else if (stringDate.contains(YESTERDAY)) {\\n year = Calendar.getInstance().get(Calendar.YEAR);\\n month = Calendar.getInstance().get(Calendar.MONTH);\\n day = Calendar.getInstance().get(Calendar.DAY_OF_MONTH);\\n dateVacancy.set(year, month, day - 1);\\n } else {\\n stringDate = stringDate.substring(0, 9);\\n String monthStr = stringDate.substring(stringDate.length() - 7, stringDate.length() - 3).trim();\\n this.year = convertToYear(stringDate);\\n this.month = months.get(monthStr);\\n this.day = convertToDay(stringDate);\\n dateVacancy.set(year, month, day);\\n }\\n return dateVacancy;\\n }\",\n \"public Date createDate(String strDate){\\n\\n Date date = null;\\n\\n // Get time\\n Calendar cal = Calendar.getInstance();\\n Date currentLocalTime = cal.getTime();\\n DateFormat dateformat = new SimpleDateFormat(\\\"HH:mm:ss\\\");\\n String localTime = dateformat.format(currentLocalTime);\\n\\n // Concat strings\\n String tmpDate = strDate + \\\" \\\" + localTime;\\n //\\n SimpleDateFormat format = new SimpleDateFormat(\\\"yyyy-MM-dd HH:mm:ss\\\");\\n\\n try {\\n date = format.parse(tmpDate);\\n\\n } catch (ParseException e) {\\n e.printStackTrace();\\n }\\n\\n return date;\\n }\",\n \"private static Date getDate(String sdate)\\n\\t{\\n\\t\\tDate date = null;\\n\\t\\tSimpleDateFormat formatter = new SimpleDateFormat(\\\"MM/dd/yyyy\\\");\\n\\t\\ttry {\\n\\t\\t\\tdate = formatter.parse(sdate);\\n\\t\\t} catch (ParseException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\treturn date;\\n\\t}\",\n \"public E_Date(String value) throws ParseException {\\n\\t\\tsuper(DATE_TIME.parse(value).toDate());\\n\\t}\",\n \"public Date ToDate(String line){\\n SimpleDateFormat sdf = new SimpleDateFormat(\\\"yyyy/MM/dd\\\");\\n try {\\n Date d = sdf.parse(line);\\n return d;\\n } catch (ParseException ex) {\\n\\n Log.v(\\\"Exception\\\", ex.getLocalizedMessage());\\n return null;\\n }\\n }\",\n \"public static Date toDate(Object obj, String pattern, TimeZone timeZone) {\\n if (obj == null) {\\n return null;\\n } else if (obj instanceof String) {\\n return toDateFromString((String) obj, pattern, timeZone);\\n } else if (obj instanceof Date) {\\n final Date paramDate = (Date) obj;\\n if (Date.class.equals(paramDate.getClass())) { // pure date\\n return paramDate;\\n } else { // sub class\\n // because the Date is not final class.\\n final Date date = new Date();\\n date.setTime(paramDate.getTime());\\n return date;\\n }\\n } else if (obj instanceof Calendar) {\\n return ((Calendar) obj).getTime();\\n } else if (obj instanceof byte[]) {\\n return toDate(toSerializable((byte[]) obj)); // recursive\\n } else if (obj instanceof Long) {\\n return new Date((Long) obj);\\n } else {\\n return toDateFromString(obj.toString(), pattern, timeZone);\\n }\\n }\",\n \"public static Date getDateFromString(String date) {\\r\\n Date newdate = null;\\r\\n SimpleDateFormat dateformat = new SimpleDateFormat(\\\"yyyy-MM-dd hh:mm:ss\\\");\\r\\n\\r\\n try {\\r\\n newdate = dateformat.parse(date);\\r\\n System.out.println(newdate);\\r\\n } catch (ParseException e) {\\r\\n e.printStackTrace();\\r\\n }\\r\\n\\r\\n return newdate;\\r\\n }\",\n \"public Date formatForDate(String data) throws ParseException{\\n //definindo a forma da Data Recebida\\n DateFormat formatUS = new SimpleDateFormat(\\\"dd-MM-yyyy\\\");\\n return formatUS.parse(data);\\n }\",\n \"public static Date converteStringInvertidaSemBarraAAMMDDParaDate(String data) {\\r\\n\\t\\tDate retorno = null;\\r\\n\\r\\n\\t\\tString dataInvertida = data.substring(4, 6) + \\\"/\\\" + data.substring(2, 4) + \\\"/20\\\" + data.substring(0, 2);\\r\\n\\r\\n\\t\\tSimpleDateFormat dataTxt = new SimpleDateFormat(\\\"dd/MM/yyyy\\\");\\r\\n\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tretorno = dataTxt.parse(dataInvertida);\\r\\n\\t\\t} catch (ParseException e) {\\r\\n\\t\\t\\tthrow new IllegalArgumentException(data + \\\" não tem o formato dd/MM/yyyy.\\\");\\r\\n\\t\\t}\\r\\n\\t\\treturn retorno;\\r\\n\\t}\",\n \"private static final Date convertStringToDate(String aMask, String strDate) {\\n SimpleDateFormat df = null;\\n Date date = null;\\n df = new SimpleDateFormat(aMask);\\n try {\\n date = df.parse(strDate);\\n } catch (ParseException pe) {\\n throw new ValidateException(\\\"日期转换出现异常,\\\"+pe.getMessage(), pe);\\n }\\n\\n return (date);\\n }\",\n \"@Override\\n\\t\\tpublic java.sql.Date convert(String s) throws ParseException {\\n\\t\\t\\ts = supportHtml5DateTimePattern(s);\\n\\t\\t\\t\\n\\t\\t\\tif (timeStampWithoutSecPatternLen == s.length()) {\\n\\t\\t\\t\\ts = s + \\\":00\\\";\\n\\t\\t\\t}\\n\\t\\t\\tif (s.length() > dateLen) {\\t// if (x < timeStampLen) 改用 datePattern 转换，更智能\\n\\t\\t\\t\\t// return new java.sql.Date(java.sql.Timestamp.valueOf(s).getTime());\\t// error under jdk 64bit(maybe)\\n\\t\\t\\t\\treturn new java.sql.Date(getFormat(timeStampPattern).parse(s).getTime());\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\t// return new java.sql.Date(java.sql.Date.valueOf(s).getTime());\\t// error under jdk 64bit\\n\\t\\t\\t\\treturn new java.sql.Date(getFormat(datePattern).parse(s).getTime());\\n\\t\\t\\t}\\n\\t\\t}\",\n \"public void parseDate(String d)\\n {\\n\\tdate.set(d);\\n String [] dateList = d.split(\\\"-\\\");\\n \\n year.set(Integer.valueOf(dateList[0]));\\n month.set(Integer.valueOf(dateList[1]));\\n day.set(Integer.valueOf(dateList[2]));\\n }\",\n \"public static Date toDate(final String data, final String sFormat, final Locale locale) {\\n final SimpleDateFormat formato = new SimpleDateFormat(sFormat, locale == null ? getLocale(CalendarParams.LOCALE_PT) : locale);\\n Date date = null;\\n try {\\n date = formato.parse(data);\\n } catch (ParseException e) {\\n // LOG.error(\\\"Date dont convert \\\", e);\\n System.out.println(e.getMessage());\\n }\\n return date;\\n }\",\n \"public static Date converteStringInvertidaSemBarraAAAAMMDDParaDate(String data) {\\r\\n\\t\\tDate retorno = null;\\r\\n\\r\\n\\t\\tString dataInvertida = data.substring(6, 8) + \\\"/\\\" + data.substring(4, 6) + \\\"/\\\" + data.substring(0, 4);\\r\\n\\r\\n\\t\\tSimpleDateFormat dataTxt = new SimpleDateFormat(\\\"dd/MM/yyyy\\\");\\r\\n\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tretorno = dataTxt.parse(dataInvertida);\\r\\n\\t\\t} catch (ParseException e) {\\r\\n\\t\\t\\tthrow new IllegalArgumentException(data + \\\" não tem o formato dd/MM/yyyy.\\\");\\r\\n\\t\\t}\\r\\n\\t\\treturn retorno;\\r\\n\\t}\",\n \"public static LocalDate stringToDate(String inputStringDate) {\\n\\t\\treturn LocalDate.parse(inputStringDate);\\n\\t}\",\n \"public static Date convertStringToDate(String aMask, String strDate)\\n\\t\\t\\tthrows ParseException {\\n\\t\\tSimpleDateFormat df;\\n\\t\\tDate date;\\n\\t\\tdf = new SimpleDateFormat(aMask);\\n\\n\\t\\tif (log.isDebugEnabled()) {\\n\\t\\t\\tlog.debug(\\\"converting '\\\" + strDate + \\\"' to date with mask '\\\"\\n\\t\\t\\t\\t\\t+ aMask + \\\"'\\\");\\n\\t\\t}\\n\\n\\t\\ttry {\\n\\t\\t\\tdate = df.parse(strDate);\\n\\t\\t} catch (ParseException pe) {\\n\\t\\t\\t// log.error(\\\"ParseException: \\\" + pe);\\n\\t\\t\\tthrow new ParseException(pe.getMessage(), pe.getErrorOffset());\\n\\t\\t}\\n\\n\\t\\treturn (date);\\n\\t}\",\n \"public static Date parseDateTime(String date)\\n\\t{\\n\\t\\treturn parseFormatDate(date, getDateTimeFormat());\\n\\t}\",\n \"public static String parseDate(String input) {\\n String year = input.substring(0, 4);\\n String month = input.substring(5, 7);\\n String day = input.substring(8, 10);\\n return year + \\\"-\\\" + month + \\\"-\\\" + day;\\n }\",\n \"@Test\\n void test7(){\\n\\n SimpleDateFormat formatter = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\n Date date = new Date();\\n String dString = formatter.format(date);\\n System.out.println(\\\"dString=\\\"+dString);\\n\\n Date datas = java.sql.Date.valueOf(dString);\\n System.out.println(\\\"datas=\\\"+datas);\\n\\n\\n }\",\n \"private Date parseDate(String text) throws Exception {\\n SimpleDateFormat dateFormat = new SimpleDateFormat(\\\"yyyy-MM-dd HH:mm:ss.SSS\\\");\\n return dateFormat.parse(text);\\n }\",\n \"public Date parseDate(String date) {\\t\\t\\n\\t\\ttry{\\n\\t\\t\\tDate d2 = sdf.parse(date);\\n\\t\\t\\t//String month = parseMonth(date);\\n\\t\\t\\t//cal.setTime(d2);\\t\\t\\t\\n\\t\\t\\t//months.put(month, new Integer(cal.get(Calendar.MONTH) + 1));\\t\\t\\t\\n\\t\\t\\treturn d2;\\n\\t\\t} catch(ParseException e){\\n\\t\\t\\tSystem.out.println(\\\"Invalid Date Format or No Such Date : \\\" + date + \\\". Message: \\\" + e.getMessage() );\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t}\",\n \"public static Date parseDate(String date) throws java.text.ParseException {\\n if(date == null) return null;\\n\\n SimpleDateFormat sdf = new SimpleDateFormat(\\\"yyyy-MM-dd HH:mm:ss\\\");\\n try {\\n return sdf.parse(date);\\n\\n } catch(ParseException e) {\\n sdf = new SimpleDateFormat(\\\"yyyy-MM-dd HH:mm\\\");\\n\\n try {\\n return sdf.parse(date);\\n\\n } catch(ParseException e2) {\\n sdf = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\n return sdf.parse(date);\\n }\\n } \\n }\",\n \"public Date(String icalStr) throws ParseException, BogusDataException\\r\\n\\t{\\r\\n\\t\\tsuper(icalStr);\\r\\n\\r\\n\\t\\tyear = month = day = 0;\\r\\n\\t\\thour = minute = second = 0;\\r\\n\\r\\n\\t\\tfor (int i = 0; i < attributeList.size(); i++)\\r\\n\\t\\t{\\r\\n\\t\\t\\tAttribute a = attributeAt(i);\\r\\n\\t\\t\\tString aname = a.name.toUpperCase(Locale.ENGLISH);\\r\\n\\t\\t\\tString aval = a.value.toUpperCase(Locale.ENGLISH);\\r\\n\\t\\t\\t// TODO: not sure if any attributes are allowed here...\\r\\n\\t\\t\\t// Look for VALUE=DATE or VALUE=DATE-TIME\\r\\n\\t\\t\\t// DATE means untimed for the event\\r\\n\\t\\t\\tif (aname.equals(\\\"VALUE\\\"))\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif (aval.equals(\\\"DATE\\\"))\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tdateOnly = true;\\r\\n\\t\\t\\t\\t} else if (aval.equals(\\\"DATE-TIME\\\"))\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tdateOnly = false;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t} else if (aname.equals(\\\"TZID\\\"))\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttzid = a.value;\\r\\n\\t\\t\\t} else\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t// TODO: anything else allowed here?\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tString inDate = value;\\r\\n\\r\\n\\t\\tif (inDate.length() < 8)\\r\\n\\t\\t{\\r\\n\\t\\t\\t// Invalid format\\r\\n\\t\\t\\tthrow new ParseException(\\\"Invalid date format '\\\" + inDate + \\\"'\\\",\\r\\n\\t\\t\\t\\t\\tinDate);\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// Make sure all parts of the year are numeric.\\r\\n\\t\\tfor (int i = 0; i < 8; i++)\\r\\n\\t\\t{\\r\\n\\t\\t\\tchar ch = inDate.charAt(i);\\r\\n\\t\\t\\tif (ch < '0' || ch > '9')\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tthrow new ParseException(\\r\\n\\t\\t\\t\\t\\t\\t\\\"Invalid date format '\\\" + inDate + \\\"'\\\", inDate);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tyear = Integer.parseInt(inDate.substring(0, 4));\\r\\n\\t\\tmonth = Integer.parseInt(inDate.substring(4, 6));\\r\\n\\t\\tday = Integer.parseInt(inDate.substring(6, 8));\\r\\n\\t\\tif (day < 1 || day > 31 || month < 1 || month > 12)\\r\\n\\t\\t\\tthrow new BogusDataException(\\\"Invalid date '\\\" + inDate + \\\"'\\\",\\r\\n\\t\\t\\t\\t\\tinDate);\\r\\n\\t\\t// Make sure day of month is valid for specified month\\r\\n\\t\\tif (year % 4 == 0)\\r\\n\\t\\t{\\r\\n\\t\\t\\t// leap year\\r\\n\\t\\t\\tif (day > leapMonthDays[month - 1])\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tthrow new BogusDataException(\\\"Invalid day of month '\\\" + inDate\\r\\n\\t\\t\\t\\t\\t\\t+ \\\"'\\\", inDate);\\r\\n\\t\\t\\t}\\r\\n\\t\\t} else\\r\\n\\t\\t{\\r\\n\\t\\t\\tif (day > monthDays[month - 1])\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tthrow new BogusDataException(\\\"Invalid day of month '\\\" + inDate\\r\\n\\t\\t\\t\\t\\t\\t+ \\\"'\\\", inDate);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t// TODO: parse time, handle localtime, handle timezone\\r\\n\\t\\tif (inDate.length() > 8)\\r\\n\\t\\t{\\r\\n\\t\\t\\t// TODO make sure dateOnly == false\\r\\n\\t\\t\\tif (inDate.charAt(8) == 'T')\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttry\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\thour = Integer.parseInt(inDate.substring(9, 11));\\r\\n\\t\\t\\t\\t\\tminute = Integer.parseInt(inDate.substring(11, 13));\\r\\n\\t\\t\\t\\t\\tsecond = Integer.parseInt(inDate.substring(13, 15));\\r\\n\\t\\t\\t\\t\\tif (hour > 23 || minute > 59 || second > 59)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tthrow new BogusDataException(\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\\"Invalid time in date string '\\\" + inDate + \\\"'\\\",\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tinDate);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tif (inDate.length() > 15)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tisUTC = inDate.charAt(15) == 'Z';\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t} catch (NumberFormatException nef)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tthrow new BogusDataException(\\r\\n\\t\\t\\t\\t\\t\\t\\t\\\"Invalid time in date string '\\\" + inDate + \\\"' - \\\"\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ nef, inDate);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t} else\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t// Invalid format\\r\\n\\t\\t\\t\\tthrow new ParseException(\\r\\n\\t\\t\\t\\t\\t\\t\\\"Invalid date format '\\\" + inDate + \\\"'\\\", inDate);\\r\\n\\t\\t\\t}\\r\\n\\t\\t} else\\r\\n\\t\\t{\\r\\n\\t\\t\\t// Just date, no time\\r\\n\\t\\t\\tdateOnly = true;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tif (isUTC && !dateOnly)\\r\\n\\t\\t{\\r\\n\\t\\t\\t// Use Joda Time to convert UTC to localtime\\r\\n\\t\\t\\tDateTime utcDateTime = new DateTime(DateTimeZone.UTC);\\r\\n\\t\\t\\tutcDateTime = utcDateTime.withDate(year, month, day).withTime(hour,\\r\\n\\t\\t\\t\\t\\tminute, second, 0);\\r\\n\\t\\t\\tDateTime localDateTime = utcDateTime.withZone(DateTimeZone\\r\\n\\t\\t\\t\\t\\t.getDefault());\\r\\n\\t\\t\\tyear = localDateTime.getYear();\\r\\n\\t\\t\\tmonth = localDateTime.getMonthOfYear();\\r\\n\\t\\t\\tday = localDateTime.getDayOfMonth();\\r\\n\\t\\t\\thour = localDateTime.getHourOfDay();\\r\\n\\t\\t\\tminute = localDateTime.getMinuteOfHour();\\r\\n\\t\\t\\tsecond = localDateTime.getSecondOfMinute();\\r\\n\\t\\t} else if (tzid != null)\\r\\n\\t\\t{\\r\\n\\t\\t\\tDateTimeZone tz = DateTimeZone.forID(tzid);\\r\\n\\t\\t\\tif (tz != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t// Convert to localtime\\r\\n\\t\\t\\t\\tDateTime utcDateTime = new DateTime(tz);\\r\\n\\t\\t\\t\\tutcDateTime = utcDateTime.withDate(year, month, day).withTime(\\r\\n\\t\\t\\t\\t\\t\\thour, minute, second, 0);\\r\\n\\t\\t\\t\\tDateTime localDateTime = utcDateTime.withZone(DateTimeZone\\r\\n\\t\\t\\t\\t\\t\\t.getDefault());\\r\\n\\t\\t\\t\\tyear = localDateTime.getYear();\\r\\n\\t\\t\\t\\tmonth = localDateTime.getMonthOfYear();\\r\\n\\t\\t\\t\\tday = localDateTime.getDayOfMonth();\\r\\n\\t\\t\\t\\thour = localDateTime.getHourOfDay();\\r\\n\\t\\t\\t\\tminute = localDateTime.getMinuteOfHour();\\r\\n\\t\\t\\t\\tsecond = localDateTime.getSecondOfMinute();\\r\\n\\t\\t\\t\\t// Since we have converted to localtime, remove the TZID\\r\\n\\t\\t\\t\\t// attribute\\r\\n\\t\\t\\t\\tthis.removeNamedAttribute(\\\"TZID\\\");\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tisUTC = false;\\r\\n\\r\\n\\t\\t// Add attribute that says date-only or date with time\\r\\n\\t\\tif (dateOnly)\\r\\n\\t\\t\\taddAttribute(\\\"VALUE\\\", \\\"DATE\\\");\\r\\n\\t\\telse\\r\\n\\t\\t\\taddAttribute(\\\"VALUE\\\", \\\"DATE-TIME\\\");\\r\\n\\r\\n\\t}\",\n \"private Date stringToSQLDate(String fecha){\\n\\t\\t\\n\\t\\t\\n\\t\\tint ano=Integer.parseInt(fecha.substring(0,4));\\n\\t\\tint mes =Integer.parseInt(fecha.substring(5,7));\\n\\t\\tint dia =Integer.parseInt( fecha.substring(8));\\n\\t\\t\\n\\t\\t@SuppressWarnings(\\\"deprecation\\\")\\n\\t\\tDate tmp = new Date(ano-1900,mes-1,dia);\\n\\t\\t\\n\\t\\treturn tmp;\\n\\t}\",\n \"public static java.sql.Date StringToSqlDate(String StringValue){\\n return java.sql.Date.valueOf(StringValue);\\n }\",\n \"private LocalDate createDate(String date) {\\n LocalDate localDate = LocalDate.parse(date);\\n\\n return localDate;\\n }\",\n \"public static Date wccDateToDate(String strDate) {\\n Date date = null;\\n if ((null != strDate) && !strDate.trim().isEmpty()) {\\n SimpleDateFormat sdf = new SimpleDateFormat(WccConstants.WCC_DATE_FORMAT);\\n try {\\n date = sdf.parse(strDate);\\n } catch (ParseException e) {\\n e.printStackTrace();\\n }\\n }\\n return date;\\n }\",\n \"@Test public void testDateFormat() {\\n String str = \\\"{dateField: 123456789}\\\";\\n TestBean bean = JSONCoder.getGlobal().decode(str, TestBean.class);\\n assertEquals(123456789L, bean.getDateField().getTime());\\n\\n str = \\\"{dateField: '1900-1-1'}\\\";\\n bean = JSONCoder.getGlobal().decode(str, TestBean.class);\\n assertEquals(\\\"1900-01-01\\\", new SimpleDateFormat(\\\"yyyy-MM-dd\\\").format(bean.getDateField()));\\n\\n str = \\\"{dateField: '1900-1-1 11:11:11'}\\\";\\n bean = JSONCoder.getGlobal().decode(str, TestBean.class);\\n assertEquals(\\\"1900-01-01 11:11:11\\\", new SimpleDateFormat(\\\"yyyy-MM-dd HH:mm:ss\\\").format(bean.getDateField()));\\n\\n str = \\\"{dateField: 'invalidDateFormat'}\\\";\\n expectDecodeWithException(str, TestBean.class,\\n \\\"java.text.ParseException: Unparseable date: \\\\\\\"invalidDateFormat\\\\\\\"\\\");\\n }\",\n \"public static Date toDateFormat_2(String dateString) {\\r\\n\\t\\treturn stringToDate(dateString, DATE_FORMAT_2);\\r\\n\\t}\",\n \"public static Date isoStringToDate(String d) {\\n\\t\\tDateTime dt = XML_DATE_TIME_FORMAT.parseDateTime(d);\\n\\t\\treturn dt.toDate();\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6909921","0.6881368","0.68681103","0.6784058","0.67214596","0.66932607","0.668448","0.6682733","0.66671634","0.6661706","0.6592853","0.65484166","0.6543475","0.65428084","0.65289915","0.651658","0.6513105","0.6494011","0.6493836","0.64858776","0.6470408","0.6469805","0.6460947","0.64576787","0.6447253","0.6434062","0.64340615","0.64105904","0.6410218","0.6391713","0.6390289","0.6380305","0.63720256","0.6361005","0.6352107","0.63469964","0.63419485","0.631145","0.6254166","0.6250892","0.6249973","0.6221776","0.62175876","0.6203144","0.61980873","0.6162136","0.6103184","0.6090055","0.6078048","0.6074059","0.6061212","0.6054869","0.60536975","0.6030682","0.60291886","0.602588","0.59707004","0.59478825","0.5937856","0.59249735","0.5909724","0.58930194","0.58909696","0.5880642","0.5874604","0.5867961","0.58676594","0.5863864","0.5859922","0.584951","0.58186316","0.5817607","0.58115727","0.58088005","0.58052105","0.58025336","0.5799303","0.57977706","0.57949126","0.5793776","0.5779818","0.57681537","0.5765932","0.5756428","0.5750809","0.572626","0.5718425","0.56955564","0.56736475","0.5669833","0.5659281","0.5647579","0.5633523","0.56289494","0.56265104","0.56203026","0.5620042","0.5608438","0.55900943","0.5589155"],"string":"[\n \"0.6909921\",\n \"0.6881368\",\n \"0.68681103\",\n \"0.6784058\",\n \"0.67214596\",\n \"0.66932607\",\n \"0.668448\",\n \"0.6682733\",\n \"0.66671634\",\n \"0.6661706\",\n \"0.6592853\",\n \"0.65484166\",\n \"0.6543475\",\n \"0.65428084\",\n \"0.65289915\",\n \"0.651658\",\n \"0.6513105\",\n \"0.6494011\",\n \"0.6493836\",\n \"0.64858776\",\n \"0.6470408\",\n \"0.6469805\",\n \"0.6460947\",\n \"0.64576787\",\n \"0.6447253\",\n \"0.6434062\",\n \"0.64340615\",\n \"0.64105904\",\n \"0.6410218\",\n \"0.6391713\",\n \"0.6390289\",\n \"0.6380305\",\n \"0.63720256\",\n \"0.6361005\",\n \"0.6352107\",\n \"0.63469964\",\n \"0.63419485\",\n \"0.631145\",\n \"0.6254166\",\n \"0.6250892\",\n \"0.6249973\",\n \"0.6221776\",\n \"0.62175876\",\n \"0.6203144\",\n \"0.61980873\",\n \"0.6162136\",\n \"0.6103184\",\n \"0.6090055\",\n \"0.6078048\",\n \"0.6074059\",\n \"0.6061212\",\n \"0.6054869\",\n \"0.60536975\",\n \"0.6030682\",\n \"0.60291886\",\n \"0.602588\",\n \"0.59707004\",\n \"0.59478825\",\n \"0.5937856\",\n \"0.59249735\",\n \"0.5909724\",\n \"0.58930194\",\n \"0.58909696\",\n \"0.5880642\",\n \"0.5874604\",\n \"0.5867961\",\n \"0.58676594\",\n \"0.5863864\",\n \"0.5859922\",\n \"0.584951\",\n \"0.58186316\",\n \"0.5817607\",\n \"0.58115727\",\n \"0.58088005\",\n \"0.58052105\",\n \"0.58025336\",\n \"0.5799303\",\n \"0.57977706\",\n \"0.57949126\",\n \"0.5793776\",\n \"0.5779818\",\n \"0.57681537\",\n \"0.5765932\",\n \"0.5756428\",\n \"0.5750809\",\n \"0.572626\",\n \"0.5718425\",\n \"0.56955564\",\n \"0.56736475\",\n \"0.5669833\",\n \"0.5659281\",\n \"0.5647579\",\n \"0.5633523\",\n \"0.56289494\",\n \"0.56265104\",\n \"0.56203026\",\n \"0.5620042\",\n \"0.5608438\",\n \"0.55900943\",\n \"0.5589155\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.60682964"},"document_rank":{"kind":"string","value":"50"}}},{"rowIdx":29389,"cells":{"query":{"kind":"string","value":"Converts Date given as String to date given as object."},"document":{"kind":"string","value":"public Date convertStringToDate(String dateToParse, String format) {\n SimpleDateFormat formatter = new SimpleDateFormat(format);\n Date result = null;\n try {\n result = formatter.parse(dateToParse);\n } catch (Exception exception1) {\n System.err.println(\n String.format(\"ERROR, converting from String %s to date with format %s\", dateToParse, format)\n );\n result = null;\n }\n return result;\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["public static Date convertStringToDate(String strDate)\n\t {\n\t Date myDate = null;\n\t if (strDate.length() > 0)\n\t {\n\t DateFormat formatter = new SimpleDateFormat(EProcurementConstants.INPUT_DATE_FORMAT);\n\t try\n\t {\n\t myDate = formatter.parse(strDate);\n\t } catch (ParseException e)\n\t {\n\t LOGGER.error(\"Not able to parse \" + strDate + \" into date ..\" + e.getMessage());\n\t }\n\t }\n\t return myDate;\n\t }","public static Date toDate(String dateStr, SimpleDateFormat format) throws ParseException {\r\n\t\treturn format.parse(dateStr);\r\n\t}","private Date convertStringToDate(String dateInString){\n DateFormat format = new SimpleDateFormat(\"d-MM-yyyy HH:mm\", Locale.ENGLISH);\n Date date = null;\n try {\n date = format.parse(dateInString);\n } catch (ParseException e) {\n e.printStackTrace();\n }\n return date;\n }","public static Date parseDate(String date) {\n return DateUtil.toDate(date);\n }","public static Date stringToDate(String date)\r\n/* 29: */ {\r\n/* 30: 39 */ log.debug(\"DateUtil.stringToDate()\");\r\n/* 31: */ try\r\n/* 32: */ {\r\n/* 33: 41 */ return sdfDate.parse(date);\r\n/* 34: */ }\r\n/* 35: */ catch (ParseException e)\r\n/* 36: */ {\r\n/* 37: 43 */ log.fatal(\"DateUtil.stringToDate抛出异常\", e);\r\n/* 38: */ }\r\n/* 39: 44 */ return new Date();\r\n/* 40: */ }","public static Date strToDate(String strDate)\r\n/* 127: */ {\r\n/* 128:178 */ SimpleDateFormat formatter = new SimpleDateFormat(\"yyyyMMdd\");\r\n/* 129:179 */ ParsePosition pos = new ParsePosition(0);\r\n/* 130:180 */ Date strtodate = formatter.parse(strDate, pos);\r\n/* 131:181 */ return strtodate;\r\n/* 132: */ }","public static Date GetDateObjectFromString(String dateAsString) {\n\t\tSimpleDateFormat sdf = new SimpleDateFormat(\"yyyy-MM-dd'T'HH:mm:ss'Z'\");\n\t\tDate tempDate = null;\n\t\ttry {\n\t\t\tif (dateAsString != null && !dateAsString.equalsIgnoreCase(\"null\"))\n\t\t\t\ttempDate = sdf.parse(dateAsString);\n\t\t} catch (Exception e) {\n\t\t\t// do some error reporting here\n\t\t\te.printStackTrace();\n\t\t}\n\t\treturn tempDate;\n\t}","public Date parse (String dateAsString , String dateFormat) throws Exception ;","public static Date String2Date(String date){\n SimpleDateFormat format = new SimpleDateFormat(\"yyyy-MM-dd hh:mm:ss\");\n\n Date currentDate = null;\n try {\n currentDate = format.parse(date);\n } catch (ParseException e) {\n e.printStackTrace();\n }\n return currentDate;\n }","public Date convertStringToDate(String s) throws ParseException {\n\t\tDate dateTime = SDF.parse(s);\n\t\treturn dateTime;\n\t}","public static Date convertStringToDate(String date) throws ParseException {\n\t return new SimpleDateFormat(\"yyyy-MM-dd\").parse(date); \n\t}","public static Date stringToDate(String dateString) {\n for(String format: DATE_FORMATS){\n try {\n return new SimpleDateFormat(format).parse(dateString);\n }\n catch (Exception e){}\n }\n throw new IllegalArgumentException(\"Date is not parsable\");\n }","public static java.util.Date convertFromStringToDate(String strDate){\n\t\tSimpleDateFormat format = new SimpleDateFormat(\"dd-MMM-yyyy\"); /*This stringDate is come from UI*/\n\t\tjava.util.Date date = null;\n\t\tif(strDate != null && !strDate.trim().isEmpty()){\n\t\t\ttry {\n\t\t\t\tdate = format.parse(strDate);\n\t\t\t\tSystem.out.println(strDate);\n\t\t\t} catch (ParseException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\t\n\t\treturn date;\n\t}","public static Date stringToDate (String s) {\n\t\tint year=0 , month=0 , date=0;\n\t\tCalendar cal = Calendar.getInstance(Locale.getDefault());\n\t\t\n\t\tStringTokenizer st = new StringTokenizer (s,\"/\");\n\t\t\n\t\tdate = Integer.parseInt(st.nextToken());\n\t\tmonth = Integer.parseInt(st.nextToken());\n\t\tyear = Integer.parseInt(st.nextToken());\n\t\tcal.clear();\n\t\tcal.set(year,month-1,date);\n\t\t//System.out.println(\"\\nDate : \"+getStringFromDate(cal.getTime()));\n\t\treturn (Date)cal.getTime().clone();\n\t}","public static Date convertStringToDate(String strDate)\n\t\t\tthrows ParseException {\n\t\tDate aDate = null;\n\n\t\ttry {\n\t\t\tif (log.isDebugEnabled()) {\n\t\t\t\tlog.debug(\"converting date with pattern: \" + getDatePattern());\n\t\t\t}\n\n\t\t\taDate = convertStringToDate(getDatePattern(), strDate);\n\t\t} catch (ParseException pe) {\n\t\t\tlog.error(\"Could not convert '\" + strDate\n\t\t\t\t\t+ \"' to a date, throwing exception\");\n\t\t\tpe.printStackTrace();\n\t\t\tthrow new ParseException(pe.getMessage(), pe.getErrorOffset());\n\t\t}\n\n\t\treturn aDate;\n\t}","public static Date parseDate(String date)\n\t{\n\t\treturn parseFormatDate(date, getDateFormat());\n\t}","@SuppressWarnings(\"deprecation\")\n\tpublic static Date getDateForString(String dateString) {\n\t\tString[] separation1 = dateString.split(\" \");\n\t\tString[] separation2 = separation1[0].split(\"/\");\n\t\tString[] separation3 = separation1[1].split(\":\");\n\t\treturn new Date(Integer.parseInt(separation2[2])-1900, (Integer.parseInt(separation2[1])-1), Integer.parseInt(separation2[0]), Integer.parseInt(separation3[0]), Integer.parseInt(separation3[1]), Integer.parseInt(separation3[2]));\n\t}","public static Date stringToDate(String dateAsString){\r\n try { \r\n SimpleDateFormat df = new SimpleDateFormat(\"dd/MM/yyyy\"); \r\n return df.parse(dateAsString);\r\n } catch (ParseException ex) {\r\n ex.printStackTrace();\r\n return null;\r\n }\r\n }","private Date stringToDate(String s) throws ParseException{\r\n\t\tSimpleDateFormat fmt = new SimpleDateFormat(DATE_FORMAT);\r\n\t\treturn fmt.parse(s);\r\n\t}","public static Date StringToDate(String dateString) {\n int y = new Integer(dateString.substring(0, 4));\n int m = new Integer(dateString.substring(4, 6));\n int d = new Integer(dateString.substring(6, 8));\n int h = new Integer(dateString.substring(8, 10));\n int min = new Integer(dateString.substring(10, 12));\n\n try {\n Calendar convCal = Calendar.getInstance();\n convCal.set(y, m - 1, d, h, min);\n Date date = convCal.getTime();\n\n return date;\n } catch (Exception ex) {\n System.out.println(\"BwInfo.convertStringToDate() \" + ex);\n return null;\n }\n\n }","public static Date toDate(Object obj) {\n return toDate(obj, (String) null, (TimeZone) null);\n }","private static Date convertFromString(String dateString) throws ParseException {\n return new SimpleDateFormat(\"yyyyMMddHHmm\").parse(dateString);\n }","@Test\n\t@DisplayName(\"string to date\")\n\tpublic void testStringToDate() throws ParseException\n\t{\n\t\tDateConverter d = new DateConverter(string1);\n\t\t\n\t\tString dateInString = \"1997-03-19\";\n\t\tSimpleDateFormat formatter = new SimpleDateFormat(\"yyyy-MM-dd\");\n\t\ttry {\n\t\t date1 = formatter.parse(dateInString);\n\t\t} catch (ParseException e) {\n\t\t //handle exception if date is not in \"dd-MMM-yyyy\" format\n\t\t}\n\t\tassertEquals(date1, d.getDate());\n\t}","public static Date fromString(String fullDate) {\n\t\tString[] parsed = fullDate.split(\",\");\n\t\tif (parsed.length != 3 && parsed.length != 5) {\n\t\t\tthrow new InvalidParsingStringException(Date.class.getName());\n\t\t}\n\t\tDate date = new Date();\n\t\tdate.setYear(Integer.valueOf(parsed[0]));\n\t\tdate.setMonth(Integer.valueOf(parsed[1]));\n\t\tdate.setDay(Integer.valueOf(parsed[2]));\n\t\tif (parsed.length == 5) {\n\t\t\tdate.setHour(Integer.valueOf(parsed[3]));\n\t\t\tdate.setMin(Integer.valueOf(parsed[4]));\n\t\t}\n\t\treturn date;\n\t}","public static Date GetDateObjectFromStringUpdate(String dateAsString) {\n\t\tSimpleDateFormat lv_formatter = new SimpleDateFormat(\n\t\t\t\t\"yyyy-MM-dd'T'HH:mm:ss'Z'\");\n\t\tlv_formatter.setTimeZone(TimeZone.getTimeZone(\"UTC\"));\n\t\tDate tempDate = null;\n\t\ttry {\n\t\t\tif (dateAsString != null && !dateAsString.equalsIgnoreCase(\"null\"))\n\t\t\t\ttempDate = lv_formatter.parse(dateAsString);\n\t\t} catch (Exception e) {\n\t\t\t// do some error reporting here\n\t\t\te.printStackTrace();\n\t\t}\n\t\treturn tempDate;\n\t}","public static Date convertirStringADateUtil(String s){\n\t\tFORMATO_FECHA.setLenient(false);\n\t\tDate fecha = null;\n\t\ttry {\n\t\t\tfecha = FORMATO_FECHA.parse(s);\n\t\t} catch (ParseException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\treturn fecha;\n\t}","public static java.sql.Date convertToSDate(String dateInString) {\n\t\tif (dateInString == null) {\n\t\t\treturn null;\n\t\t} else {\n\t\t\tSimpleDateFormat dateFormat = new SimpleDateFormat(\"dd/MM/yyyy\");\n\t\t\tjava.util.Date uDate = null;\n\t\t\tjava.sql.Date sDate = null;\n\t\t\ttry {\n\t\t\t\tuDate = dateFormat.parse(dateInString);\n\t\t\t\tsDate = new java.sql.Date(uDate.getTime());\n\t\t\t} catch (ParseException e) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\treturn sDate;\n\t\t}\n\t}","private Date deserializeToDate(String object) {\n synchronized (this) {\n Object object2;\n boolean bl2;\n Object object3 = this.dateFormats;\n object3 = object3.iterator();\n while (bl2 = object3.hasNext()) {\n object2 = object3.next();\n object2 = (DateFormat)object2;\n try {\n return ((DateFormat)object2).parse((String)object);\n }\n catch (ParseException parseException) {\n }\n }\n try {\n bl2 = false;\n object2 = null;\n object3 = new ParsePosition(0);\n return ISO8601Utils.parse((String)object, (ParsePosition)object3);\n }\n catch (ParseException object22) {\n object2 = new JsonSyntaxException((String)object, object22);\n throw object2;\n }\n }\n }","public static Date createDate(String dateStr) throws ParseException {\n\t\tSimpleDateFormat date = new SimpleDateFormat(\"yyyy/MM/dd\");\n\t\treturn date.parse(dateStr);\n\t}","public static Date date(String str) throws Exception {\n SimpleDateFormat sdf = new SimpleDateFormat(\"yyyy-MM-dd\");\n\n return sdf.parse( str );\n }","public static Date stringToDate(String string_date){\n Date myDate = null;\n \n try {\n java.util.Date utilDate = new SimpleDateFormat(\"yyyy-MM-dd\").parse(string_date);\n myDate = new java.sql.Date(utilDate.getTime());\n } catch (Exception e) {\n // Si hay una excepcion se imprime un mensaje\n System.err.println(e.getMessage());\n }\n \n return myDate;\n }","public static Date stringToDate(String date) {\n\t\tDate result = null;\n\t\tif (date != null && !\"\".equals(date)) {\n\t\t\tDateTimeFormatter f = DateTimeFormat.forPattern(SmartMoneyConstants.DATE_FORMAT);\n\t\t\tDateTime dateTime = f.parseDateTime(date);\n\t\t\tresult = dateTime.toDate();\n\t\t}\n\n\t\treturn result;\n\t}","public static Date convertStringToDate(String stringDate) {\n\n\t\tDateFormat df = new SimpleDateFormat(\"yyyy-MM-dd\"); \n\t\tDate startDate = null;\n\n\t\ttry {\n\t\t startDate = df.parse(stringDate);\n\n\t\t} catch (ParseException e) {\n\t\t e.printStackTrace();\n\t\t}\n\t\treturn startDate;\n\t\t\n\t}","public Date stringToDate(String date) throws ParseException {\n String[] splitDate = date.split(\"T\");\n String day = splitDate[0];\n SimpleDateFormat dateFormat = new SimpleDateFormat(\"yyyy-MM-dd\");\n Date dayDate = dateFormat.parse(day);\n return dayDate;\n }","public static Date StringToDate(String strFecha) throws ParseException {\r\n SimpleDateFormat simpleDateFormat = new SimpleDateFormat(\"dd/MM/yyyy HH:mm:ss\");\r\n return simpleDateFormat.parse(strFecha);\r\n }","public Date(String sDate) {\r\n\t\tint m, d, y;\r\n\t\tString[] chopDate = sDate.split(\"-\");\r\n\t\tm = Integer.parseInt(chopDate[ZEROI]);\r\n\t\td = Integer.parseInt(chopDate[ONEI]);\r\n\t\ty = Integer.parseInt(chopDate[TWOI]);\r\n\t\tif (!isValid(m, d, y))\r\n\t\t\tthrow new RuntimeException(\"Invalid date\");\r\n\t\tmonth = m;\r\n\t\tday = d;\r\n\t\tyear = y;\r\n\t}","public static Date convertStringToDate(String dateString) {\n\t\tLocalDate date = null;\n\t\t\n\t\ttry {\n\t\t\tDateTimeFormatter formatter = DateTimeFormatter.ofPattern(Constants.ddmmyyydateFormatInCSV);\n\t\t\tdate = LocalDate.parse(dateString, formatter);\n\n\t\t} catch (DateTimeParseException ex) {\n\t\t\tthrow new SalesException(\"enter the proper date in \" + Constants.ddmmyyydateFormatInCSV + \" format\");\n\t\t} catch (SalesException ex) {\n\t\t\tthrow new SalesException(\"Recevied excepion during date parser \" + ex.getMessage());\n\t\t}\n\t\treturn Date.valueOf(date);\n\t}","public Date getConvertedDate(String dateToBeConverted) {\n\t\tSimpleDateFormat sdf = new SimpleDateFormat(\"dd/MM/yy hh:mm:ss\");\n\t\ttry{\n\t\t\tbookedDate = sdf.parse(dateToBeConverted);\n\t\t} catch(Exception e) {\n\t\t\tSystem.out.println(e);\n\t\t}\n\t\treturn bookedDate;\n\t}","public static Date parseDate(String s) {\n\t\tDate d = null;\n\t\tif (s == null) {\n\t\t\treturn d;\n\t\t}\n\n\t\tString pattern = \"\";\n\n\t\tif (s.indexOf(':') >= 0) {\n\t\t\tif (s.length() > 20) {\n\t\t\t\tpattern = \"yyyy-MM-dd HH:mm:ss.SSS\";\n\t\t\t} else {\n\t\t\t\tif (s.lastIndexOf(':') != s.indexOf(':'))\n\t\t\t\t\tpattern = DD_MM_YYYY_HH_MM_SS;\n\t\t\t\telse\n\t\t\t\t\tpattern = \"dd/MM/yyyy HH:mm\";\n\t\t\t}\n\t\t} else {\n\t\t\tpattern = DD_MM_YYYY;\n\t\t}\n\n\t\tSimpleDateFormat sdf = new SimpleDateFormat(pattern);\n\t\tsdf.setTimeZone(TimeZone.getDefault());\n\t\tif (s.length() > 0) {\n\t\t\ttry {\n\t\t\t\td = sdf.parse(s);\n\t\t\t} catch (ParseException e) {\n\t\t\t\tthrow new FenixException(\"Errore nella conversione della data. \" + e.getMessage());\n\t\t\t}\n\t\t}\n\t\treturn d;\n\t}","public Date parseString(String dateString) throws ParseException {\n return dateFormat.parse(dateString);\n }","public Date stringToDate(String d)\n\t{\n\t\tSimpleDateFormat format = new SimpleDateFormat(\"MMM-yyyy\");\n\t\t\n\t\tDate date = new Date();\n\t\t\n\t\ttry \n\t\t{\n\t\t\tdate = format.parse(d);\n\t\t} \n\t\tcatch (ParseException e) \n\t\t{\n\t\t\t// TODO Auto-generated catch block\n\t\t\te.printStackTrace();\n\t\t}\n\t\t\n\t\treturn date;\n\t}","public static Date parseDate(String date) {\r\n return parseDateWithPattern(date, \"dd/MM/yyyy\");\r\n }","public static HISDate valueOf(String datStr) throws HISDateException {\r\n return HISDate.valueOf(datStr, null);\r\n }","public static Date convertString2Date(String strTime) {\r\n\t\t Calendar calendar = Calendar.getInstance();\r\n\t\t calendar.setTimeInMillis(Long.valueOf(strTime));\r\n\t\t return calendar.getTime();\r\n\t}","public static java.util.Date convertToUDate(String dateInString) {\n\t\tif (dateInString == null) {\n\t\t\treturn null;\n\t\t} else {\n\t\t\tSimpleDateFormat dateFormat = new SimpleDateFormat(\"dd/MM/yyyy\");\n\t\t\tjava.util.Date uDate = null;\n\t\t\ttry {\n\t\t\t\tuDate = dateFormat.parse(dateInString);\n\t\t\t} catch (ParseException e) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\treturn uDate;\n\t\t}\n\t}","public static Date parseDate(String date)\n {\n SimpleDateFormat format = new SimpleDateFormat(\"dd/MM/yyyy\");\n Date dt = null;\n try {\n dt = format.parse(date);\n } \n catch (ParseException ex) \n {\n System.out.println(\"Unexpected error during the conversion - \" + ex);\n }\n return dt;\n }","public static Date FormatStringToDate(String dateString) {\r\n SimpleDateFormat dF = new SimpleDateFormat(\"dd/mm/yyyy HH:mm:ss\");\r\n Date date = null;\r\n try {\r\n date = dF.parse(dateString);\r\n } catch (ParseException e) {\r\n e.printStackTrace();\r\n }\r\n return date;\r\n }","public static Date dateFromShortString(String dateString) {\n SimpleDateFormat fmt = new SimpleDateFormat(\"dd-MMM-yyyy\", Locale.getDefault());\n try {\n return fmt.parse(dateString);\n } catch (ParseException e) {\n e.printStackTrace();\n return new Date();\n }\n }","public static Date stringToDate(String date) throws InvalidDateException{\n DateFormat format = new SimpleDateFormat(Constants.BIRTH_DATE_FORMAT);\n format.setLenient(false); //é uma flag para que a data esteja sempre entre os limites corretos\n try {\n return format.parse(date);\n } catch (ParseException ignored) {\n throw new InvalidDateException(\"Invalid date\");\n }\n }","public Date parseDate(String date, String format) {\n return this.convertStringToDate(date, format);\n }","@Override\n\tpublic Date convert(String source) {\n\t\tif (StringUtils.isValid(source)) {\n\t\t\tDateFormat dateFormat;\n\t\t\tif (source.indexOf(\":\") != -1) {\n\t\t\t\tdateFormat = new SimpleDateFormat(\"yyyy-MM-dd HH:mm:ss\");\n\t\t\t} else {\n\t\t\t\tdateFormat = new SimpleDateFormat(\"yyyy-MM-dd\"); \n\t\t\t}\n\t\t\t//日期转换为严格模式\n\t\t dateFormat.setLenient(false); \n\t try {\n\t\t\t\treturn dateFormat.parse(source);\n\t\t\t} catch (ParseException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t} \n\t\t}\n\t\treturn null;\n\t}","private Date parseStringToDate(String date) {\n Date resultDate = null;\n if (date.contains(TODAY) || date.contains(YESTERDAY)) {\n String[] dateStrings = date.split(\",\");\n if (dateStrings[0].equalsIgnoreCase(TODAY)) {\n Calendar today = Calendar.getInstance();\n resultDate = today.getTime();\n } else if (dateStrings[0].equalsIgnoreCase(YESTERDAY)) {\n Calendar yesterday = Calendar.getInstance();\n yesterday.add(Calendar.DATE, MINUS_DAY);\n resultDate = yesterday.getTime();\n }\n } else {\n SimpleDateFormat formatter = new SimpleDateFormat(DATE_FORMAT);\n try {\n resultDate = formatter.parse(date);\n } catch (ParseException e) {\n LOG.error(e.getMessage(), e);\n }\n }\n return resultDate;\n }","public static Date strToTime(String strDate)\r\n/* 135: */ {\r\n/* 136:192 */ SimpleDateFormat formatter = new SimpleDateFormat(\"yyyyMMdd HH:mm:ss\");\r\n/* 137:193 */ ParsePosition pos = new ParsePosition(0);\r\n/* 138:194 */ Date strtodate = formatter.parse(strDate, pos);\r\n/* 139:195 */ return strtodate;\r\n/* 140: */ }","private static Date toDate(final Object value, final String identifier) throws ParseException {\n if (value == null) {\n return null;\n }\n if (value instanceof Number) {\n return new Date(((Number) value).longValue());\n }\n final String t = (String) value;\n if (t.indexOf('-') < 0) try {\n return new Date(Long.valueOf(t));\n } catch (NumberFormatException e) {\n throw new ParseException(\"Illegal date: \" + value + \" (property:\" + identifier +\")\", e);\n }\n try {\n synchronized (JsonMetadataConstants.DATE_FORMAT) {\n return JsonMetadataConstants.DATE_FORMAT.parse((String) value);\n }\n } catch (java.text.ParseException e) {\n throw new ParseException(\"Illegal date: \" + value + \" (property:\" + identifier +\")\", e);\n }\n }","@TypeConverter\n public static Date toDate(String value) {\n if (value == null) return null;\n\n try {\n return df.parse(value);\n } catch (ParseException e) {\n e.printStackTrace();\n return null;\n }\n }","protected static Date parseDate(String dateStr) {\n if (dateStr != null) {\n try {\n DateFormat df = new SimpleDateFormat(\"yyyy-MM-dd\");\n return df.parse(dateStr);\n }\n catch (Exception e) {\n throw new IllegalArgumentException(\"Expected date in format yyyy-MM-dd but got \" + dateStr, e);\n }\n }\n return null;\n }","public static Date toDate(Object obj, String pattern) {\n return toDate(obj, pattern, (TimeZone) null);\n }","public static synchronized Date parseDate(String s) throws ParseException {\n return dateFormat.parse(s);\n }","private static String convertDate(String dateString) {\n String date = null;\n\n try {\n //Parse the string into a date variable\n Date parsedDate = new SimpleDateFormat(\"yyyy-MM-dd'T'HH:mm:ss\").parse(dateString);\n\n //Now reformat it using desired display pattern:\n date = new SimpleDateFormat(DATE_FORMAT).format(parsedDate);\n\n } catch (ParseException e) {\n Log.e(TAG, \"getDate: Error parsing date\", e);\n e.printStackTrace();\n }\n\n return date;\n }","public static Date parseDate(DateFormat format, String dateStr) throws ParseException {\n\t\tDate date = null;\n\t\tif (dateStr != null && !dateStr.isEmpty()) {\n\t\t\tdate = format.parse(dateStr);\n\t\t}\n\t\treturn date;\n\t}","public Date parseDateFromString(final String dateString) {\r\n\t\tDateFormat df = getDateTimeFormat();\r\n\t\tsynchronized (df) {\r\n\t\t\ttry {\r\n\t\t\t\treturn df.parse(dateString);\r\n\t\t\t} catch (ParseException e) {\r\n\t\t\t\tDominoUtils.handleException(e);\r\n\t\t\t\treturn null;\r\n\t\t\t}\r\n\t\t}\r\n\t}","public Date(String date) {\n String[] fields = date.split(\"/\");\n if (fields.length != 3) {\n throw new IllegalArgumentException(\"Invalid date\");\n }\n month = Integer.parseInt(fields[0]);\n day = Integer.parseInt(fields[1]);\n year = Integer.parseInt(fields[2]);\n if (!isValid(month, day, year)) throw new IllegalArgumentException(\"Invalid date\");\n }","private Date stringToDate(String datum)\r\n\t{\n\t\tSimpleDateFormat df = new SimpleDateFormat(\"dd.MM.yyyy\");\r\n\t\ttry\r\n\t\t{\r\n\t\t\tDate d = df.parse(datum);\r\n\t\t\treturn d;\r\n\t\t}\r\n\t\tcatch (ParseException e)\r\n\t\t{\r\n\t\t\treturn null;\r\n\t\t}\r\n\t}","@Test\n\t@DisplayName(\"date to string\")\n\tpublic void testDateToString()\n\t{\n\t\tString dateInString = \"2000-04-12\";\n\t\tSimpleDateFormat formatter = new SimpleDateFormat(\"yyyy-MM-dd\");\n\t\ttry {\n\t\t date1 = formatter.parse(dateInString);\n\t\t} catch (ParseException e) {\n\t\t //handle exception if date is not in \"dd-MMM-yyyy\" format\n\t\t}\n\t\tDateConverter s = new DateConverter(date1);\n\t\tassertEquals(\"2000-04-12\", s.getDateAsString());\n\t}","public static native JsDate create(String dateString) /*-{\n return new Date(dateString);\n }-*/;","public static Date toDateFormat_1(String dateString) {\r\n\t\treturn stringToDate(dateString, DATE_FORMAT_1);\r\n\t}","public boolean setDateFromString(String s){\n String[] strs = s.split(\"/\");\n if(strs.length != 3){\n return false;\n }\n try {\n this.year = Integer.parseInt(strs[0].toString());\n this.month = Integer.parseInt(strs[1].toString());\n this.dayOfMonth = Integer.parseInt(strs[2].toString());\n }catch (NumberFormatException e){\n e.printStackTrace();\n return false;\n }\n this.dateString = s;\n return true;\n }","private Date convertMongoToDate(String dateString, String timeString) {\n int year = Integer.parseInt(dateString.substring(0, 4));\n //Log.e(\"KARA\", \"year \" + year);\n int month = Integer.parseInt(dateString.substring(5, 7));\n //Log.e(\"KARA\", \"month \" + month);\n int day = Integer.parseInt(dateString.substring(8, 10));\n //Log.e(\"KARA\", \"day \" + day);\n int hour = Integer.parseInt(timeString.substring(0, 2));\n //Log.e(\"KARA\", \"hour \" + hour);\n int min = Integer.parseInt(timeString.substring(3, 5));\n return new Date(year - 1900, month - 1, day, hour, min);\n }","public static Date convert(String timeString){\n SimpleDateFormat dateFormat = new SimpleDateFormat(\"dd/MMM/yyyy:HH:mm:ss ZZZZ\");\n // set default timezone to be runtime independent\n TimeZone.setDefault(TimeZone.getTimeZone(\"UTC\"));\n try {\n return dateFormat.parse(timeString);\n } catch (ParseException e) {\n LOGGER.log(Level.SEVERE, \"Date cannot be parsed: \"+ timeString, e);\n return null;\n }\n }","public static Date de_STRING_a_DATE(String fechaEnString) {\n SimpleDateFormat miFormato2 = new SimpleDateFormat(\"dd/MM/yyyy\");\n Date fechaenjava = null;\n try {\n fechaenjava = miFormato2.parse(fechaEnString);\n } catch (ParseException e) {\n e.printStackTrace();\n }\n return fechaenjava;\n }","public Calendar convertFromString(String stringDate) {\n Calendar dateVacancy = Calendar.getInstance();\n dateVacancy.set(Calendar.MILLISECOND, 0); //remove milliseconds\n if (months.isEmpty()) {\n fillMap();\n }\n if (stringDate.contains(TODAY)) {\n year = Calendar.getInstance().get(Calendar.YEAR);\n month = Calendar.getInstance().get(Calendar.MONTH);\n day = Calendar.getInstance().get(Calendar.DAY_OF_MONTH);\n dateVacancy.set(year, month, day);\n } else if (stringDate.contains(YESTERDAY)) {\n year = Calendar.getInstance().get(Calendar.YEAR);\n month = Calendar.getInstance().get(Calendar.MONTH);\n day = Calendar.getInstance().get(Calendar.DAY_OF_MONTH);\n dateVacancy.set(year, month, day - 1);\n } else {\n stringDate = stringDate.substring(0, 9);\n String monthStr = stringDate.substring(stringDate.length() - 7, stringDate.length() - 3).trim();\n this.year = convertToYear(stringDate);\n this.month = months.get(monthStr);\n this.day = convertToDay(stringDate);\n dateVacancy.set(year, month, day);\n }\n return dateVacancy;\n }","public Date createDate(String strDate){\n\n Date date = null;\n\n // Get time\n Calendar cal = Calendar.getInstance();\n Date currentLocalTime = cal.getTime();\n DateFormat dateformat = new SimpleDateFormat(\"HH:mm:ss\");\n String localTime = dateformat.format(currentLocalTime);\n\n // Concat strings\n String tmpDate = strDate + \" \" + localTime;\n //\n SimpleDateFormat format = new SimpleDateFormat(\"yyyy-MM-dd HH:mm:ss\");\n\n try {\n date = format.parse(tmpDate);\n\n } catch (ParseException e) {\n e.printStackTrace();\n }\n\n return date;\n }","private static Date getDate(String sdate)\n\t{\n\t\tDate date = null;\n\t\tSimpleDateFormat formatter = new SimpleDateFormat(\"MM/dd/yyyy\");\n\t\ttry {\n\t\t\tdate = formatter.parse(sdate);\n\t\t} catch (ParseException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\treturn date;\n\t}","public E_Date(String value) throws ParseException {\n\t\tsuper(DATE_TIME.parse(value).toDate());\n\t}","public Date ToDate(String line){\n SimpleDateFormat sdf = new SimpleDateFormat(\"yyyy/MM/dd\");\n try {\n Date d = sdf.parse(line);\n return d;\n } catch (ParseException ex) {\n\n Log.v(\"Exception\", ex.getLocalizedMessage());\n return null;\n }\n }","public static Date toDate(Object obj, String pattern, TimeZone timeZone) {\n if (obj == null) {\n return null;\n } else if (obj instanceof String) {\n return toDateFromString((String) obj, pattern, timeZone);\n } else if (obj instanceof Date) {\n final Date paramDate = (Date) obj;\n if (Date.class.equals(paramDate.getClass())) { // pure date\n return paramDate;\n } else { // sub class\n // because the Date is not final class.\n final Date date = new Date();\n date.setTime(paramDate.getTime());\n return date;\n }\n } else if (obj instanceof Calendar) {\n return ((Calendar) obj).getTime();\n } else if (obj instanceof byte[]) {\n return toDate(toSerializable((byte[]) obj)); // recursive\n } else if (obj instanceof Long) {\n return new Date((Long) obj);\n } else {\n return toDateFromString(obj.toString(), pattern, timeZone);\n }\n }","public static Date getDateFromString(String date) {\r\n Date newdate = null;\r\n SimpleDateFormat dateformat = new SimpleDateFormat(\"yyyy-MM-dd hh:mm:ss\");\r\n\r\n try {\r\n newdate = dateformat.parse(date);\r\n System.out.println(newdate);\r\n } catch (ParseException e) {\r\n e.printStackTrace();\r\n }\r\n\r\n return newdate;\r\n }","public Date formatForDate(String data) throws ParseException{\n //definindo a forma da Data Recebida\n DateFormat formatUS = new SimpleDateFormat(\"dd-MM-yyyy\");\n return formatUS.parse(data);\n }","private static final Date convertStringToDate(String aMask, String strDate) {\n SimpleDateFormat df = null;\n Date date = null;\n df = new SimpleDateFormat(aMask);\n try {\n date = df.parse(strDate);\n } catch (ParseException pe) {\n throw new ValidateException(\"日期转换出现异常,\"+pe.getMessage(), pe);\n }\n\n return (date);\n }","public static Date converteStringInvertidaSemBarraAAMMDDParaDate(String data) {\r\n\t\tDate retorno = null;\r\n\r\n\t\tString dataInvertida = data.substring(4, 6) + \"/\" + data.substring(2, 4) + \"/20\" + data.substring(0, 2);\r\n\r\n\t\tSimpleDateFormat dataTxt = new SimpleDateFormat(\"dd/MM/yyyy\");\r\n\r\n\t\ttry {\r\n\t\t\tretorno = dataTxt.parse(dataInvertida);\r\n\t\t} catch (ParseException e) {\r\n\t\t\tthrow new IllegalArgumentException(data + \" não tem o formato dd/MM/yyyy.\");\r\n\t\t}\r\n\t\treturn retorno;\r\n\t}","@Override\n\t\tpublic java.sql.Date convert(String s) throws ParseException {\n\t\t\ts = supportHtml5DateTimePattern(s);\n\t\t\t\n\t\t\tif (timeStampWithoutSecPatternLen == s.length()) {\n\t\t\t\ts = s + \":00\";\n\t\t\t}\n\t\t\tif (s.length() > dateLen) {\t// if (x < timeStampLen) 改用 datePattern 转换，更智能\n\t\t\t\t// return new java.sql.Date(java.sql.Timestamp.valueOf(s).getTime());\t// error under jdk 64bit(maybe)\n\t\t\t\treturn new java.sql.Date(getFormat(timeStampPattern).parse(s).getTime());\n\t\t\t}\n\t\t\telse {\n\t\t\t\t// return new java.sql.Date(java.sql.Date.valueOf(s).getTime());\t// error under jdk 64bit\n\t\t\t\treturn new java.sql.Date(getFormat(datePattern).parse(s).getTime());\n\t\t\t}\n\t\t}","public void parseDate(String d)\n {\n\tdate.set(d);\n String [] dateList = d.split(\"-\");\n \n year.set(Integer.valueOf(dateList[0]));\n month.set(Integer.valueOf(dateList[1]));\n day.set(Integer.valueOf(dateList[2]));\n }","public static Date toDate(final String data, final String sFormat, final Locale locale) {\n final SimpleDateFormat formato = new SimpleDateFormat(sFormat, locale == null ? getLocale(CalendarParams.LOCALE_PT) : locale);\n Date date = null;\n try {\n date = formato.parse(data);\n } catch (ParseException e) {\n // LOG.error(\"Date dont convert \", e);\n System.out.println(e.getMessage());\n }\n return date;\n }","public static Date converteStringInvertidaSemBarraAAAAMMDDParaDate(String data) {\r\n\t\tDate retorno = null;\r\n\r\n\t\tString dataInvertida = data.substring(6, 8) + \"/\" + data.substring(4, 6) + \"/\" + data.substring(0, 4);\r\n\r\n\t\tSimpleDateFormat dataTxt = new SimpleDateFormat(\"dd/MM/yyyy\");\r\n\r\n\t\ttry {\r\n\t\t\tretorno = dataTxt.parse(dataInvertida);\r\n\t\t} catch (ParseException e) {\r\n\t\t\tthrow new IllegalArgumentException(data + \" não tem o formato dd/MM/yyyy.\");\r\n\t\t}\r\n\t\treturn retorno;\r\n\t}","public static LocalDate stringToDate(String inputStringDate) {\n\t\treturn LocalDate.parse(inputStringDate);\n\t}","public static Date convertStringToDate(String aMask, String strDate)\n\t\t\tthrows ParseException {\n\t\tSimpleDateFormat df;\n\t\tDate date;\n\t\tdf = new SimpleDateFormat(aMask);\n\n\t\tif (log.isDebugEnabled()) {\n\t\t\tlog.debug(\"converting '\" + strDate + \"' to date with mask '\"\n\t\t\t\t\t+ aMask + \"'\");\n\t\t}\n\n\t\ttry {\n\t\t\tdate = df.parse(strDate);\n\t\t} catch (ParseException pe) {\n\t\t\t// log.error(\"ParseException: \" + pe);\n\t\t\tthrow new ParseException(pe.getMessage(), pe.getErrorOffset());\n\t\t}\n\n\t\treturn (date);\n\t}","public static Date parseDateTime(String date)\n\t{\n\t\treturn parseFormatDate(date, getDateTimeFormat());\n\t}","public static String parseDate(String input) {\n String year = input.substring(0, 4);\n String month = input.substring(5, 7);\n String day = input.substring(8, 10);\n return year + \"-\" + month + \"-\" + day;\n }","@Test\n void test7(){\n\n SimpleDateFormat formatter = new SimpleDateFormat(\"yyyy-MM-dd\");\n Date date = new Date();\n String dString = formatter.format(date);\n System.out.println(\"dString=\"+dString);\n\n Date datas = java.sql.Date.valueOf(dString);\n System.out.println(\"datas=\"+datas);\n\n\n }","private Date parseDate(String text) throws Exception {\n SimpleDateFormat dateFormat = new SimpleDateFormat(\"yyyy-MM-dd HH:mm:ss.SSS\");\n return dateFormat.parse(text);\n }","public Date parseDate(String date) {\t\t\n\t\ttry{\n\t\t\tDate d2 = sdf.parse(date);\n\t\t\t//String month = parseMonth(date);\n\t\t\t//cal.setTime(d2);\t\t\t\n\t\t\t//months.put(month, new Integer(cal.get(Calendar.MONTH) + 1));\t\t\t\n\t\t\treturn d2;\n\t\t} catch(ParseException e){\n\t\t\tSystem.out.println(\"Invalid Date Format or No Such Date : \" + date + \". Message: \" + e.getMessage() );\n\t\t\treturn null;\n\t\t}\n\t}","public static Date parseDate(String date) throws java.text.ParseException {\n if(date == null) return null;\n\n SimpleDateFormat sdf = new SimpleDateFormat(\"yyyy-MM-dd HH:mm:ss\");\n try {\n return sdf.parse(date);\n\n } catch(ParseException e) {\n sdf = new SimpleDateFormat(\"yyyy-MM-dd HH:mm\");\n\n try {\n return sdf.parse(date);\n\n } catch(ParseException e2) {\n sdf = new SimpleDateFormat(\"yyyy-MM-dd\");\n return sdf.parse(date);\n }\n } \n }","public Date(String icalStr) throws ParseException, BogusDataException\r\n\t{\r\n\t\tsuper(icalStr);\r\n\r\n\t\tyear = month = day = 0;\r\n\t\thour = minute = second = 0;\r\n\r\n\t\tfor (int i = 0; i < attributeList.size(); i++)\r\n\t\t{\r\n\t\t\tAttribute a = attributeAt(i);\r\n\t\t\tString aname = a.name.toUpperCase(Locale.ENGLISH);\r\n\t\t\tString aval = a.value.toUpperCase(Locale.ENGLISH);\r\n\t\t\t// TODO: not sure if any attributes are allowed here...\r\n\t\t\t// Look for VALUE=DATE or VALUE=DATE-TIME\r\n\t\t\t// DATE means untimed for the event\r\n\t\t\tif (aname.equals(\"VALUE\"))\r\n\t\t\t{\r\n\t\t\t\tif (aval.equals(\"DATE\"))\r\n\t\t\t\t{\r\n\t\t\t\t\tdateOnly = true;\r\n\t\t\t\t} else if (aval.equals(\"DATE-TIME\"))\r\n\t\t\t\t{\r\n\t\t\t\t\tdateOnly = false;\r\n\t\t\t\t}\r\n\t\t\t} else if (aname.equals(\"TZID\"))\r\n\t\t\t{\r\n\t\t\t\ttzid = a.value;\r\n\t\t\t} else\r\n\t\t\t{\r\n\t\t\t\t// TODO: anything else allowed here?\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tString inDate = value;\r\n\r\n\t\tif (inDate.length() < 8)\r\n\t\t{\r\n\t\t\t// Invalid format\r\n\t\t\tthrow new ParseException(\"Invalid date format '\" + inDate + \"'\",\r\n\t\t\t\t\tinDate);\r\n\t\t}\r\n\r\n\t\t// Make sure all parts of the year are numeric.\r\n\t\tfor (int i = 0; i < 8; i++)\r\n\t\t{\r\n\t\t\tchar ch = inDate.charAt(i);\r\n\t\t\tif (ch < '0' || ch > '9')\r\n\t\t\t{\r\n\t\t\t\tthrow new ParseException(\r\n\t\t\t\t\t\t\"Invalid date format '\" + inDate + \"'\", inDate);\r\n\t\t\t}\r\n\t\t}\r\n\t\tyear = Integer.parseInt(inDate.substring(0, 4));\r\n\t\tmonth = Integer.parseInt(inDate.substring(4, 6));\r\n\t\tday = Integer.parseInt(inDate.substring(6, 8));\r\n\t\tif (day < 1 || day > 31 || month < 1 || month > 12)\r\n\t\t\tthrow new BogusDataException(\"Invalid date '\" + inDate + \"'\",\r\n\t\t\t\t\tinDate);\r\n\t\t// Make sure day of month is valid for specified month\r\n\t\tif (year % 4 == 0)\r\n\t\t{\r\n\t\t\t// leap year\r\n\t\t\tif (day > leapMonthDays[month - 1])\r\n\t\t\t{\r\n\t\t\t\tthrow new BogusDataException(\"Invalid day of month '\" + inDate\r\n\t\t\t\t\t\t+ \"'\", inDate);\r\n\t\t\t}\r\n\t\t} else\r\n\t\t{\r\n\t\t\tif (day > monthDays[month - 1])\r\n\t\t\t{\r\n\t\t\t\tthrow new BogusDataException(\"Invalid day of month '\" + inDate\r\n\t\t\t\t\t\t+ \"'\", inDate);\r\n\t\t\t}\r\n\t\t}\r\n\t\t// TODO: parse time, handle localtime, handle timezone\r\n\t\tif (inDate.length() > 8)\r\n\t\t{\r\n\t\t\t// TODO make sure dateOnly == false\r\n\t\t\tif (inDate.charAt(8) == 'T')\r\n\t\t\t{\r\n\t\t\t\ttry\r\n\t\t\t\t{\r\n\t\t\t\t\thour = Integer.parseInt(inDate.substring(9, 11));\r\n\t\t\t\t\tminute = Integer.parseInt(inDate.substring(11, 13));\r\n\t\t\t\t\tsecond = Integer.parseInt(inDate.substring(13, 15));\r\n\t\t\t\t\tif (hour > 23 || minute > 59 || second > 59)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tthrow new BogusDataException(\r\n\t\t\t\t\t\t\t\t\"Invalid time in date string '\" + inDate + \"'\",\r\n\t\t\t\t\t\t\t\tinDate);\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (inDate.length() > 15)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tisUTC = inDate.charAt(15) == 'Z';\r\n\t\t\t\t\t}\r\n\t\t\t\t} catch (NumberFormatException nef)\r\n\t\t\t\t{\r\n\t\t\t\t\tthrow new BogusDataException(\r\n\t\t\t\t\t\t\t\"Invalid time in date string '\" + inDate + \"' - \"\r\n\t\t\t\t\t\t\t\t\t+ nef, inDate);\r\n\t\t\t\t}\r\n\t\t\t} else\r\n\t\t\t{\r\n\t\t\t\t// Invalid format\r\n\t\t\t\tthrow new ParseException(\r\n\t\t\t\t\t\t\"Invalid date format '\" + inDate + \"'\", inDate);\r\n\t\t\t}\r\n\t\t} else\r\n\t\t{\r\n\t\t\t// Just date, no time\r\n\t\t\tdateOnly = true;\r\n\t\t}\r\n\r\n\t\tif (isUTC && !dateOnly)\r\n\t\t{\r\n\t\t\t// Use Joda Time to convert UTC to localtime\r\n\t\t\tDateTime utcDateTime = new DateTime(DateTimeZone.UTC);\r\n\t\t\tutcDateTime = utcDateTime.withDate(year, month, day).withTime(hour,\r\n\t\t\t\t\tminute, second, 0);\r\n\t\t\tDateTime localDateTime = utcDateTime.withZone(DateTimeZone\r\n\t\t\t\t\t.getDefault());\r\n\t\t\tyear = localDateTime.getYear();\r\n\t\t\tmonth = localDateTime.getMonthOfYear();\r\n\t\t\tday = localDateTime.getDayOfMonth();\r\n\t\t\thour = localDateTime.getHourOfDay();\r\n\t\t\tminute = localDateTime.getMinuteOfHour();\r\n\t\t\tsecond = localDateTime.getSecondOfMinute();\r\n\t\t} else if (tzid != null)\r\n\t\t{\r\n\t\t\tDateTimeZone tz = DateTimeZone.forID(tzid);\r\n\t\t\tif (tz != null)\r\n\t\t\t{\r\n\t\t\t\t// Convert to localtime\r\n\t\t\t\tDateTime utcDateTime = new DateTime(tz);\r\n\t\t\t\tutcDateTime = utcDateTime.withDate(year, month, day).withTime(\r\n\t\t\t\t\t\thour, minute, second, 0);\r\n\t\t\t\tDateTime localDateTime = utcDateTime.withZone(DateTimeZone\r\n\t\t\t\t\t\t.getDefault());\r\n\t\t\t\tyear = localDateTime.getYear();\r\n\t\t\t\tmonth = localDateTime.getMonthOfYear();\r\n\t\t\t\tday = localDateTime.getDayOfMonth();\r\n\t\t\t\thour = localDateTime.getHourOfDay();\r\n\t\t\t\tminute = localDateTime.getMinuteOfHour();\r\n\t\t\t\tsecond = localDateTime.getSecondOfMinute();\r\n\t\t\t\t// Since we have converted to localtime, remove the TZID\r\n\t\t\t\t// attribute\r\n\t\t\t\tthis.removeNamedAttribute(\"TZID\");\r\n\t\t\t}\r\n\t\t}\r\n\t\tisUTC = false;\r\n\r\n\t\t// Add attribute that says date-only or date with time\r\n\t\tif (dateOnly)\r\n\t\t\taddAttribute(\"VALUE\", \"DATE\");\r\n\t\telse\r\n\t\t\taddAttribute(\"VALUE\", \"DATE-TIME\");\r\n\r\n\t}","private Date stringToSQLDate(String fecha){\n\t\t\n\t\t\n\t\tint ano=Integer.parseInt(fecha.substring(0,4));\n\t\tint mes =Integer.parseInt(fecha.substring(5,7));\n\t\tint dia =Integer.parseInt( fecha.substring(8));\n\t\t\n\t\t@SuppressWarnings(\"deprecation\")\n\t\tDate tmp = new Date(ano-1900,mes-1,dia);\n\t\t\n\t\treturn tmp;\n\t}","public static java.sql.Date StringToSqlDate(String StringValue){\n return java.sql.Date.valueOf(StringValue);\n }","private LocalDate createDate(String date) {\n LocalDate localDate = LocalDate.parse(date);\n\n return localDate;\n }","public static Date wccDateToDate(String strDate) {\n Date date = null;\n if ((null != strDate) && !strDate.trim().isEmpty()) {\n SimpleDateFormat sdf = new SimpleDateFormat(WccConstants.WCC_DATE_FORMAT);\n try {\n date = sdf.parse(strDate);\n } catch (ParseException e) {\n e.printStackTrace();\n }\n }\n return date;\n }","@Test public void testDateFormat() {\n String str = \"{dateField: 123456789}\";\n TestBean bean = JSONCoder.getGlobal().decode(str, TestBean.class);\n assertEquals(123456789L, bean.getDateField().getTime());\n\n str = \"{dateField: '1900-1-1'}\";\n bean = JSONCoder.getGlobal().decode(str, TestBean.class);\n assertEquals(\"1900-01-01\", new SimpleDateFormat(\"yyyy-MM-dd\").format(bean.getDateField()));\n\n str = \"{dateField: '1900-1-1 11:11:11'}\";\n bean = JSONCoder.getGlobal().decode(str, TestBean.class);\n assertEquals(\"1900-01-01 11:11:11\", new SimpleDateFormat(\"yyyy-MM-dd HH:mm:ss\").format(bean.getDateField()));\n\n str = \"{dateField: 'invalidDateFormat'}\";\n expectDecodeWithException(str, TestBean.class,\n \"java.text.ParseException: Unparseable date: \\\"invalidDateFormat\\\"\");\n }","public static Date isoStringToDate(String d) {\n\t\tDateTime dt = XML_DATE_TIME_FORMAT.parseDateTime(d);\n\t\treturn dt.toDate();\n\t}","public static Date toDateFormat_2(String dateString) {\r\n\t\treturn stringToDate(dateString, DATE_FORMAT_2);\r\n\t}"],"string":"[\n \"public static Date convertStringToDate(String strDate)\\n\\t {\\n\\t Date myDate = null;\\n\\t if (strDate.length() > 0)\\n\\t {\\n\\t DateFormat formatter = new SimpleDateFormat(EProcurementConstants.INPUT_DATE_FORMAT);\\n\\t try\\n\\t {\\n\\t myDate = formatter.parse(strDate);\\n\\t } catch (ParseException e)\\n\\t {\\n\\t LOGGER.error(\\\"Not able to parse \\\" + strDate + \\\" into date ..\\\" + e.getMessage());\\n\\t }\\n\\t }\\n\\t return myDate;\\n\\t }\",\n \"public static Date toDate(String dateStr, SimpleDateFormat format) throws ParseException {\\r\\n\\t\\treturn format.parse(dateStr);\\r\\n\\t}\",\n \"private Date convertStringToDate(String dateInString){\\n DateFormat format = new SimpleDateFormat(\\\"d-MM-yyyy HH:mm\\\", Locale.ENGLISH);\\n Date date = null;\\n try {\\n date = format.parse(dateInString);\\n } catch (ParseException e) {\\n e.printStackTrace();\\n }\\n return date;\\n }\",\n \"public static Date parseDate(String date) {\\n return DateUtil.toDate(date);\\n }\",\n \"public static Date stringToDate(String date)\\r\\n/* 29: */ {\\r\\n/* 30: 39 */ log.debug(\\\"DateUtil.stringToDate()\\\");\\r\\n/* 31: */ try\\r\\n/* 32: */ {\\r\\n/* 33: 41 */ return sdfDate.parse(date);\\r\\n/* 34: */ }\\r\\n/* 35: */ catch (ParseException e)\\r\\n/* 36: */ {\\r\\n/* 37: 43 */ log.fatal(\\\"DateUtil.stringToDate抛出异常\\\", e);\\r\\n/* 38: */ }\\r\\n/* 39: 44 */ return new Date();\\r\\n/* 40: */ }\",\n \"public static Date strToDate(String strDate)\\r\\n/* 127: */ {\\r\\n/* 128:178 */ SimpleDateFormat formatter = new SimpleDateFormat(\\\"yyyyMMdd\\\");\\r\\n/* 129:179 */ ParsePosition pos = new ParsePosition(0);\\r\\n/* 130:180 */ Date strtodate = formatter.parse(strDate, pos);\\r\\n/* 131:181 */ return strtodate;\\r\\n/* 132: */ }\",\n \"public static Date GetDateObjectFromString(String dateAsString) {\\n\\t\\tSimpleDateFormat sdf = new SimpleDateFormat(\\\"yyyy-MM-dd'T'HH:mm:ss'Z'\\\");\\n\\t\\tDate tempDate = null;\\n\\t\\ttry {\\n\\t\\t\\tif (dateAsString != null && !dateAsString.equalsIgnoreCase(\\\"null\\\"))\\n\\t\\t\\t\\ttempDate = sdf.parse(dateAsString);\\n\\t\\t} catch (Exception e) {\\n\\t\\t\\t// do some error reporting here\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\treturn tempDate;\\n\\t}\",\n \"public Date parse (String dateAsString , String dateFormat) throws Exception ;\",\n \"public static Date String2Date(String date){\\n SimpleDateFormat format = new SimpleDateFormat(\\\"yyyy-MM-dd hh:mm:ss\\\");\\n\\n Date currentDate = null;\\n try {\\n currentDate = format.parse(date);\\n } catch (ParseException e) {\\n e.printStackTrace();\\n }\\n return currentDate;\\n }\",\n \"public Date convertStringToDate(String s) throws ParseException {\\n\\t\\tDate dateTime = SDF.parse(s);\\n\\t\\treturn dateTime;\\n\\t}\",\n \"public static Date convertStringToDate(String date) throws ParseException {\\n\\t return new SimpleDateFormat(\\\"yyyy-MM-dd\\\").parse(date); \\n\\t}\",\n \"public static Date stringToDate(String dateString) {\\n for(String format: DATE_FORMATS){\\n try {\\n return new SimpleDateFormat(format).parse(dateString);\\n }\\n catch (Exception e){}\\n }\\n throw new IllegalArgumentException(\\\"Date is not parsable\\\");\\n }\",\n \"public static java.util.Date convertFromStringToDate(String strDate){\\n\\t\\tSimpleDateFormat format = new SimpleDateFormat(\\\"dd-MMM-yyyy\\\"); /*This stringDate is come from UI*/\\n\\t\\tjava.util.Date date = null;\\n\\t\\tif(strDate != null && !strDate.trim().isEmpty()){\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tdate = format.parse(strDate);\\n\\t\\t\\t\\tSystem.out.println(strDate);\\n\\t\\t\\t} catch (ParseException e) {\\n\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t}\\n\\t\\t}\\t\\n\\t\\treturn date;\\n\\t}\",\n \"public static Date stringToDate (String s) {\\n\\t\\tint year=0 , month=0 , date=0;\\n\\t\\tCalendar cal = Calendar.getInstance(Locale.getDefault());\\n\\t\\t\\n\\t\\tStringTokenizer st = new StringTokenizer (s,\\\"/\\\");\\n\\t\\t\\n\\t\\tdate = Integer.parseInt(st.nextToken());\\n\\t\\tmonth = Integer.parseInt(st.nextToken());\\n\\t\\tyear = Integer.parseInt(st.nextToken());\\n\\t\\tcal.clear();\\n\\t\\tcal.set(year,month-1,date);\\n\\t\\t//System.out.println(\\\"\\\\nDate : \\\"+getStringFromDate(cal.getTime()));\\n\\t\\treturn (Date)cal.getTime().clone();\\n\\t}\",\n \"public static Date convertStringToDate(String strDate)\\n\\t\\t\\tthrows ParseException {\\n\\t\\tDate aDate = null;\\n\\n\\t\\ttry {\\n\\t\\t\\tif (log.isDebugEnabled()) {\\n\\t\\t\\t\\tlog.debug(\\\"converting date with pattern: \\\" + getDatePattern());\\n\\t\\t\\t}\\n\\n\\t\\t\\taDate = convertStringToDate(getDatePattern(), strDate);\\n\\t\\t} catch (ParseException pe) {\\n\\t\\t\\tlog.error(\\\"Could not convert '\\\" + strDate\\n\\t\\t\\t\\t\\t+ \\\"' to a date, throwing exception\\\");\\n\\t\\t\\tpe.printStackTrace();\\n\\t\\t\\tthrow new ParseException(pe.getMessage(), pe.getErrorOffset());\\n\\t\\t}\\n\\n\\t\\treturn aDate;\\n\\t}\",\n \"public static Date parseDate(String date)\\n\\t{\\n\\t\\treturn parseFormatDate(date, getDateFormat());\\n\\t}\",\n \"@SuppressWarnings(\\\"deprecation\\\")\\n\\tpublic static Date getDateForString(String dateString) {\\n\\t\\tString[] separation1 = dateString.split(\\\" \\\");\\n\\t\\tString[] separation2 = separation1[0].split(\\\"/\\\");\\n\\t\\tString[] separation3 = separation1[1].split(\\\":\\\");\\n\\t\\treturn new Date(Integer.parseInt(separation2[2])-1900, (Integer.parseInt(separation2[1])-1), Integer.parseInt(separation2[0]), Integer.parseInt(separation3[0]), Integer.parseInt(separation3[1]), Integer.parseInt(separation3[2]));\\n\\t}\",\n \"public static Date stringToDate(String dateAsString){\\r\\n try { \\r\\n SimpleDateFormat df = new SimpleDateFormat(\\\"dd/MM/yyyy\\\"); \\r\\n return df.parse(dateAsString);\\r\\n } catch (ParseException ex) {\\r\\n ex.printStackTrace();\\r\\n return null;\\r\\n }\\r\\n }\",\n \"private Date stringToDate(String s) throws ParseException{\\r\\n\\t\\tSimpleDateFormat fmt = new SimpleDateFormat(DATE_FORMAT);\\r\\n\\t\\treturn fmt.parse(s);\\r\\n\\t}\",\n \"public static Date StringToDate(String dateString) {\\n int y = new Integer(dateString.substring(0, 4));\\n int m = new Integer(dateString.substring(4, 6));\\n int d = new Integer(dateString.substring(6, 8));\\n int h = new Integer(dateString.substring(8, 10));\\n int min = new Integer(dateString.substring(10, 12));\\n\\n try {\\n Calendar convCal = Calendar.getInstance();\\n convCal.set(y, m - 1, d, h, min);\\n Date date = convCal.getTime();\\n\\n return date;\\n } catch (Exception ex) {\\n System.out.println(\\\"BwInfo.convertStringToDate() \\\" + ex);\\n return null;\\n }\\n\\n }\",\n \"public static Date toDate(Object obj) {\\n return toDate(obj, (String) null, (TimeZone) null);\\n }\",\n \"private static Date convertFromString(String dateString) throws ParseException {\\n return new SimpleDateFormat(\\\"yyyyMMddHHmm\\\").parse(dateString);\\n }\",\n \"@Test\\n\\t@DisplayName(\\\"string to date\\\")\\n\\tpublic void testStringToDate() throws ParseException\\n\\t{\\n\\t\\tDateConverter d = new DateConverter(string1);\\n\\t\\t\\n\\t\\tString dateInString = \\\"1997-03-19\\\";\\n\\t\\tSimpleDateFormat formatter = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\n\\t\\ttry {\\n\\t\\t date1 = formatter.parse(dateInString);\\n\\t\\t} catch (ParseException e) {\\n\\t\\t //handle exception if date is not in \\\"dd-MMM-yyyy\\\" format\\n\\t\\t}\\n\\t\\tassertEquals(date1, d.getDate());\\n\\t}\",\n \"public static Date fromString(String fullDate) {\\n\\t\\tString[] parsed = fullDate.split(\\\",\\\");\\n\\t\\tif (parsed.length != 3 && parsed.length != 5) {\\n\\t\\t\\tthrow new InvalidParsingStringException(Date.class.getName());\\n\\t\\t}\\n\\t\\tDate date = new Date();\\n\\t\\tdate.setYear(Integer.valueOf(parsed[0]));\\n\\t\\tdate.setMonth(Integer.valueOf(parsed[1]));\\n\\t\\tdate.setDay(Integer.valueOf(parsed[2]));\\n\\t\\tif (parsed.length == 5) {\\n\\t\\t\\tdate.setHour(Integer.valueOf(parsed[3]));\\n\\t\\t\\tdate.setMin(Integer.valueOf(parsed[4]));\\n\\t\\t}\\n\\t\\treturn date;\\n\\t}\",\n \"public static Date GetDateObjectFromStringUpdate(String dateAsString) {\\n\\t\\tSimpleDateFormat lv_formatter = new SimpleDateFormat(\\n\\t\\t\\t\\t\\\"yyyy-MM-dd'T'HH:mm:ss'Z'\\\");\\n\\t\\tlv_formatter.setTimeZone(TimeZone.getTimeZone(\\\"UTC\\\"));\\n\\t\\tDate tempDate = null;\\n\\t\\ttry {\\n\\t\\t\\tif (dateAsString != null && !dateAsString.equalsIgnoreCase(\\\"null\\\"))\\n\\t\\t\\t\\ttempDate = lv_formatter.parse(dateAsString);\\n\\t\\t} catch (Exception e) {\\n\\t\\t\\t// do some error reporting here\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\treturn tempDate;\\n\\t}\",\n \"public static Date convertirStringADateUtil(String s){\\n\\t\\tFORMATO_FECHA.setLenient(false);\\n\\t\\tDate fecha = null;\\n\\t\\ttry {\\n\\t\\t\\tfecha = FORMATO_FECHA.parse(s);\\n\\t\\t} catch (ParseException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\treturn fecha;\\n\\t}\",\n \"public static java.sql.Date convertToSDate(String dateInString) {\\n\\t\\tif (dateInString == null) {\\n\\t\\t\\treturn null;\\n\\t\\t} else {\\n\\t\\t\\tSimpleDateFormat dateFormat = new SimpleDateFormat(\\\"dd/MM/yyyy\\\");\\n\\t\\t\\tjava.util.Date uDate = null;\\n\\t\\t\\tjava.sql.Date sDate = null;\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tuDate = dateFormat.parse(dateInString);\\n\\t\\t\\t\\tsDate = new java.sql.Date(uDate.getTime());\\n\\t\\t\\t} catch (ParseException e) {\\n\\t\\t\\t\\treturn null;\\n\\t\\t\\t}\\n\\t\\t\\treturn sDate;\\n\\t\\t}\\n\\t}\",\n \"private Date deserializeToDate(String object) {\\n synchronized (this) {\\n Object object2;\\n boolean bl2;\\n Object object3 = this.dateFormats;\\n object3 = object3.iterator();\\n while (bl2 = object3.hasNext()) {\\n object2 = object3.next();\\n object2 = (DateFormat)object2;\\n try {\\n return ((DateFormat)object2).parse((String)object);\\n }\\n catch (ParseException parseException) {\\n }\\n }\\n try {\\n bl2 = false;\\n object2 = null;\\n object3 = new ParsePosition(0);\\n return ISO8601Utils.parse((String)object, (ParsePosition)object3);\\n }\\n catch (ParseException object22) {\\n object2 = new JsonSyntaxException((String)object, object22);\\n throw object2;\\n }\\n }\\n }\",\n \"public static Date createDate(String dateStr) throws ParseException {\\n\\t\\tSimpleDateFormat date = new SimpleDateFormat(\\\"yyyy/MM/dd\\\");\\n\\t\\treturn date.parse(dateStr);\\n\\t}\",\n \"public static Date date(String str) throws Exception {\\n SimpleDateFormat sdf = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\n\\n return sdf.parse( str );\\n }\",\n \"public static Date stringToDate(String string_date){\\n Date myDate = null;\\n \\n try {\\n java.util.Date utilDate = new SimpleDateFormat(\\\"yyyy-MM-dd\\\").parse(string_date);\\n myDate = new java.sql.Date(utilDate.getTime());\\n } catch (Exception e) {\\n // Si hay una excepcion se imprime un mensaje\\n System.err.println(e.getMessage());\\n }\\n \\n return myDate;\\n }\",\n \"public static Date stringToDate(String date) {\\n\\t\\tDate result = null;\\n\\t\\tif (date != null && !\\\"\\\".equals(date)) {\\n\\t\\t\\tDateTimeFormatter f = DateTimeFormat.forPattern(SmartMoneyConstants.DATE_FORMAT);\\n\\t\\t\\tDateTime dateTime = f.parseDateTime(date);\\n\\t\\t\\tresult = dateTime.toDate();\\n\\t\\t}\\n\\n\\t\\treturn result;\\n\\t}\",\n \"public static Date convertStringToDate(String stringDate) {\\n\\n\\t\\tDateFormat df = new SimpleDateFormat(\\\"yyyy-MM-dd\\\"); \\n\\t\\tDate startDate = null;\\n\\n\\t\\ttry {\\n\\t\\t startDate = df.parse(stringDate);\\n\\n\\t\\t} catch (ParseException e) {\\n\\t\\t e.printStackTrace();\\n\\t\\t}\\n\\t\\treturn startDate;\\n\\t\\t\\n\\t}\",\n \"public Date stringToDate(String date) throws ParseException {\\n String[] splitDate = date.split(\\\"T\\\");\\n String day = splitDate[0];\\n SimpleDateFormat dateFormat = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\n Date dayDate = dateFormat.parse(day);\\n return dayDate;\\n }\",\n \"public static Date StringToDate(String strFecha) throws ParseException {\\r\\n SimpleDateFormat simpleDateFormat = new SimpleDateFormat(\\\"dd/MM/yyyy HH:mm:ss\\\");\\r\\n return simpleDateFormat.parse(strFecha);\\r\\n }\",\n \"public Date(String sDate) {\\r\\n\\t\\tint m, d, y;\\r\\n\\t\\tString[] chopDate = sDate.split(\\\"-\\\");\\r\\n\\t\\tm = Integer.parseInt(chopDate[ZEROI]);\\r\\n\\t\\td = Integer.parseInt(chopDate[ONEI]);\\r\\n\\t\\ty = Integer.parseInt(chopDate[TWOI]);\\r\\n\\t\\tif (!isValid(m, d, y))\\r\\n\\t\\t\\tthrow new RuntimeException(\\\"Invalid date\\\");\\r\\n\\t\\tmonth = m;\\r\\n\\t\\tday = d;\\r\\n\\t\\tyear = y;\\r\\n\\t}\",\n \"public static Date convertStringToDate(String dateString) {\\n\\t\\tLocalDate date = null;\\n\\t\\t\\n\\t\\ttry {\\n\\t\\t\\tDateTimeFormatter formatter = DateTimeFormatter.ofPattern(Constants.ddmmyyydateFormatInCSV);\\n\\t\\t\\tdate = LocalDate.parse(dateString, formatter);\\n\\n\\t\\t} catch (DateTimeParseException ex) {\\n\\t\\t\\tthrow new SalesException(\\\"enter the proper date in \\\" + Constants.ddmmyyydateFormatInCSV + \\\" format\\\");\\n\\t\\t} catch (SalesException ex) {\\n\\t\\t\\tthrow new SalesException(\\\"Recevied excepion during date parser \\\" + ex.getMessage());\\n\\t\\t}\\n\\t\\treturn Date.valueOf(date);\\n\\t}\",\n \"public Date getConvertedDate(String dateToBeConverted) {\\n\\t\\tSimpleDateFormat sdf = new SimpleDateFormat(\\\"dd/MM/yy hh:mm:ss\\\");\\n\\t\\ttry{\\n\\t\\t\\tbookedDate = sdf.parse(dateToBeConverted);\\n\\t\\t} catch(Exception e) {\\n\\t\\t\\tSystem.out.println(e);\\n\\t\\t}\\n\\t\\treturn bookedDate;\\n\\t}\",\n \"public static Date parseDate(String s) {\\n\\t\\tDate d = null;\\n\\t\\tif (s == null) {\\n\\t\\t\\treturn d;\\n\\t\\t}\\n\\n\\t\\tString pattern = \\\"\\\";\\n\\n\\t\\tif (s.indexOf(':') >= 0) {\\n\\t\\t\\tif (s.length() > 20) {\\n\\t\\t\\t\\tpattern = \\\"yyyy-MM-dd HH:mm:ss.SSS\\\";\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tif (s.lastIndexOf(':') != s.indexOf(':'))\\n\\t\\t\\t\\t\\tpattern = DD_MM_YYYY_HH_MM_SS;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tpattern = \\\"dd/MM/yyyy HH:mm\\\";\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\tpattern = DD_MM_YYYY;\\n\\t\\t}\\n\\n\\t\\tSimpleDateFormat sdf = new SimpleDateFormat(pattern);\\n\\t\\tsdf.setTimeZone(TimeZone.getDefault());\\n\\t\\tif (s.length() > 0) {\\n\\t\\t\\ttry {\\n\\t\\t\\t\\td = sdf.parse(s);\\n\\t\\t\\t} catch (ParseException e) {\\n\\t\\t\\t\\tthrow new FenixException(\\\"Errore nella conversione della data. \\\" + e.getMessage());\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn d;\\n\\t}\",\n \"public Date parseString(String dateString) throws ParseException {\\n return dateFormat.parse(dateString);\\n }\",\n \"public Date stringToDate(String d)\\n\\t{\\n\\t\\tSimpleDateFormat format = new SimpleDateFormat(\\\"MMM-yyyy\\\");\\n\\t\\t\\n\\t\\tDate date = new Date();\\n\\t\\t\\n\\t\\ttry \\n\\t\\t{\\n\\t\\t\\tdate = format.parse(d);\\n\\t\\t} \\n\\t\\tcatch (ParseException e) \\n\\t\\t{\\n\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn date;\\n\\t}\",\n \"public static Date parseDate(String date) {\\r\\n return parseDateWithPattern(date, \\\"dd/MM/yyyy\\\");\\r\\n }\",\n \"public static HISDate valueOf(String datStr) throws HISDateException {\\r\\n return HISDate.valueOf(datStr, null);\\r\\n }\",\n \"public static Date convertString2Date(String strTime) {\\r\\n\\t\\t Calendar calendar = Calendar.getInstance();\\r\\n\\t\\t calendar.setTimeInMillis(Long.valueOf(strTime));\\r\\n\\t\\t return calendar.getTime();\\r\\n\\t}\",\n \"public static java.util.Date convertToUDate(String dateInString) {\\n\\t\\tif (dateInString == null) {\\n\\t\\t\\treturn null;\\n\\t\\t} else {\\n\\t\\t\\tSimpleDateFormat dateFormat = new SimpleDateFormat(\\\"dd/MM/yyyy\\\");\\n\\t\\t\\tjava.util.Date uDate = null;\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tuDate = dateFormat.parse(dateInString);\\n\\t\\t\\t} catch (ParseException e) {\\n\\t\\t\\t\\treturn null;\\n\\t\\t\\t}\\n\\t\\t\\treturn uDate;\\n\\t\\t}\\n\\t}\",\n \"public static Date parseDate(String date)\\n {\\n SimpleDateFormat format = new SimpleDateFormat(\\\"dd/MM/yyyy\\\");\\n Date dt = null;\\n try {\\n dt = format.parse(date);\\n } \\n catch (ParseException ex) \\n {\\n System.out.println(\\\"Unexpected error during the conversion - \\\" + ex);\\n }\\n return dt;\\n }\",\n \"public static Date FormatStringToDate(String dateString) {\\r\\n SimpleDateFormat dF = new SimpleDateFormat(\\\"dd/mm/yyyy HH:mm:ss\\\");\\r\\n Date date = null;\\r\\n try {\\r\\n date = dF.parse(dateString);\\r\\n } catch (ParseException e) {\\r\\n e.printStackTrace();\\r\\n }\\r\\n return date;\\r\\n }\",\n \"public static Date dateFromShortString(String dateString) {\\n SimpleDateFormat fmt = new SimpleDateFormat(\\\"dd-MMM-yyyy\\\", Locale.getDefault());\\n try {\\n return fmt.parse(dateString);\\n } catch (ParseException e) {\\n e.printStackTrace();\\n return new Date();\\n }\\n }\",\n \"public static Date stringToDate(String date) throws InvalidDateException{\\n DateFormat format = new SimpleDateFormat(Constants.BIRTH_DATE_FORMAT);\\n format.setLenient(false); //é uma flag para que a data esteja sempre entre os limites corretos\\n try {\\n return format.parse(date);\\n } catch (ParseException ignored) {\\n throw new InvalidDateException(\\\"Invalid date\\\");\\n }\\n }\",\n \"public Date parseDate(String date, String format) {\\n return this.convertStringToDate(date, format);\\n }\",\n \"@Override\\n\\tpublic Date convert(String source) {\\n\\t\\tif (StringUtils.isValid(source)) {\\n\\t\\t\\tDateFormat dateFormat;\\n\\t\\t\\tif (source.indexOf(\\\":\\\") != -1) {\\n\\t\\t\\t\\tdateFormat = new SimpleDateFormat(\\\"yyyy-MM-dd HH:mm:ss\\\");\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tdateFormat = new SimpleDateFormat(\\\"yyyy-MM-dd\\\"); \\n\\t\\t\\t}\\n\\t\\t\\t//日期转换为严格模式\\n\\t\\t dateFormat.setLenient(false); \\n\\t try {\\n\\t\\t\\t\\treturn dateFormat.parse(source);\\n\\t\\t\\t} catch (ParseException e) {\\n\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t} \\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"private Date parseStringToDate(String date) {\\n Date resultDate = null;\\n if (date.contains(TODAY) || date.contains(YESTERDAY)) {\\n String[] dateStrings = date.split(\\\",\\\");\\n if (dateStrings[0].equalsIgnoreCase(TODAY)) {\\n Calendar today = Calendar.getInstance();\\n resultDate = today.getTime();\\n } else if (dateStrings[0].equalsIgnoreCase(YESTERDAY)) {\\n Calendar yesterday = Calendar.getInstance();\\n yesterday.add(Calendar.DATE, MINUS_DAY);\\n resultDate = yesterday.getTime();\\n }\\n } else {\\n SimpleDateFormat formatter = new SimpleDateFormat(DATE_FORMAT);\\n try {\\n resultDate = formatter.parse(date);\\n } catch (ParseException e) {\\n LOG.error(e.getMessage(), e);\\n }\\n }\\n return resultDate;\\n }\",\n \"public static Date strToTime(String strDate)\\r\\n/* 135: */ {\\r\\n/* 136:192 */ SimpleDateFormat formatter = new SimpleDateFormat(\\\"yyyyMMdd HH:mm:ss\\\");\\r\\n/* 137:193 */ ParsePosition pos = new ParsePosition(0);\\r\\n/* 138:194 */ Date strtodate = formatter.parse(strDate, pos);\\r\\n/* 139:195 */ return strtodate;\\r\\n/* 140: */ }\",\n \"private static Date toDate(final Object value, final String identifier) throws ParseException {\\n if (value == null) {\\n return null;\\n }\\n if (value instanceof Number) {\\n return new Date(((Number) value).longValue());\\n }\\n final String t = (String) value;\\n if (t.indexOf('-') < 0) try {\\n return new Date(Long.valueOf(t));\\n } catch (NumberFormatException e) {\\n throw new ParseException(\\\"Illegal date: \\\" + value + \\\" (property:\\\" + identifier +\\\")\\\", e);\\n }\\n try {\\n synchronized (JsonMetadataConstants.DATE_FORMAT) {\\n return JsonMetadataConstants.DATE_FORMAT.parse((String) value);\\n }\\n } catch (java.text.ParseException e) {\\n throw new ParseException(\\\"Illegal date: \\\" + value + \\\" (property:\\\" + identifier +\\\")\\\", e);\\n }\\n }\",\n \"@TypeConverter\\n public static Date toDate(String value) {\\n if (value == null) return null;\\n\\n try {\\n return df.parse(value);\\n } catch (ParseException e) {\\n e.printStackTrace();\\n return null;\\n }\\n }\",\n \"protected static Date parseDate(String dateStr) {\\n if (dateStr != null) {\\n try {\\n DateFormat df = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\n return df.parse(dateStr);\\n }\\n catch (Exception e) {\\n throw new IllegalArgumentException(\\\"Expected date in format yyyy-MM-dd but got \\\" + dateStr, e);\\n }\\n }\\n return null;\\n }\",\n \"public static Date toDate(Object obj, String pattern) {\\n return toDate(obj, pattern, (TimeZone) null);\\n }\",\n \"public static synchronized Date parseDate(String s) throws ParseException {\\n return dateFormat.parse(s);\\n }\",\n \"private static String convertDate(String dateString) {\\n String date = null;\\n\\n try {\\n //Parse the string into a date variable\\n Date parsedDate = new SimpleDateFormat(\\\"yyyy-MM-dd'T'HH:mm:ss\\\").parse(dateString);\\n\\n //Now reformat it using desired display pattern:\\n date = new SimpleDateFormat(DATE_FORMAT).format(parsedDate);\\n\\n } catch (ParseException e) {\\n Log.e(TAG, \\\"getDate: Error parsing date\\\", e);\\n e.printStackTrace();\\n }\\n\\n return date;\\n }\",\n \"public static Date parseDate(DateFormat format, String dateStr) throws ParseException {\\n\\t\\tDate date = null;\\n\\t\\tif (dateStr != null && !dateStr.isEmpty()) {\\n\\t\\t\\tdate = format.parse(dateStr);\\n\\t\\t}\\n\\t\\treturn date;\\n\\t}\",\n \"public Date parseDateFromString(final String dateString) {\\r\\n\\t\\tDateFormat df = getDateTimeFormat();\\r\\n\\t\\tsynchronized (df) {\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\treturn df.parse(dateString);\\r\\n\\t\\t\\t} catch (ParseException e) {\\r\\n\\t\\t\\t\\tDominoUtils.handleException(e);\\r\\n\\t\\t\\t\\treturn null;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public Date(String date) {\\n String[] fields = date.split(\\\"/\\\");\\n if (fields.length != 3) {\\n throw new IllegalArgumentException(\\\"Invalid date\\\");\\n }\\n month = Integer.parseInt(fields[0]);\\n day = Integer.parseInt(fields[1]);\\n year = Integer.parseInt(fields[2]);\\n if (!isValid(month, day, year)) throw new IllegalArgumentException(\\\"Invalid date\\\");\\n }\",\n \"private Date stringToDate(String datum)\\r\\n\\t{\\n\\t\\tSimpleDateFormat df = new SimpleDateFormat(\\\"dd.MM.yyyy\\\");\\r\\n\\t\\ttry\\r\\n\\t\\t{\\r\\n\\t\\t\\tDate d = df.parse(datum);\\r\\n\\t\\t\\treturn d;\\r\\n\\t\\t}\\r\\n\\t\\tcatch (ParseException e)\\r\\n\\t\\t{\\r\\n\\t\\t\\treturn null;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"@Test\\n\\t@DisplayName(\\\"date to string\\\")\\n\\tpublic void testDateToString()\\n\\t{\\n\\t\\tString dateInString = \\\"2000-04-12\\\";\\n\\t\\tSimpleDateFormat formatter = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\n\\t\\ttry {\\n\\t\\t date1 = formatter.parse(dateInString);\\n\\t\\t} catch (ParseException e) {\\n\\t\\t //handle exception if date is not in \\\"dd-MMM-yyyy\\\" format\\n\\t\\t}\\n\\t\\tDateConverter s = new DateConverter(date1);\\n\\t\\tassertEquals(\\\"2000-04-12\\\", s.getDateAsString());\\n\\t}\",\n \"public static native JsDate create(String dateString) /*-{\\n return new Date(dateString);\\n }-*/;\",\n \"public static Date toDateFormat_1(String dateString) {\\r\\n\\t\\treturn stringToDate(dateString, DATE_FORMAT_1);\\r\\n\\t}\",\n \"public boolean setDateFromString(String s){\\n String[] strs = s.split(\\\"/\\\");\\n if(strs.length != 3){\\n return false;\\n }\\n try {\\n this.year = Integer.parseInt(strs[0].toString());\\n this.month = Integer.parseInt(strs[1].toString());\\n this.dayOfMonth = Integer.parseInt(strs[2].toString());\\n }catch (NumberFormatException e){\\n e.printStackTrace();\\n return false;\\n }\\n this.dateString = s;\\n return true;\\n }\",\n \"private Date convertMongoToDate(String dateString, String timeString) {\\n int year = Integer.parseInt(dateString.substring(0, 4));\\n //Log.e(\\\"KARA\\\", \\\"year \\\" + year);\\n int month = Integer.parseInt(dateString.substring(5, 7));\\n //Log.e(\\\"KARA\\\", \\\"month \\\" + month);\\n int day = Integer.parseInt(dateString.substring(8, 10));\\n //Log.e(\\\"KARA\\\", \\\"day \\\" + day);\\n int hour = Integer.parseInt(timeString.substring(0, 2));\\n //Log.e(\\\"KARA\\\", \\\"hour \\\" + hour);\\n int min = Integer.parseInt(timeString.substring(3, 5));\\n return new Date(year - 1900, month - 1, day, hour, min);\\n }\",\n \"public static Date convert(String timeString){\\n SimpleDateFormat dateFormat = new SimpleDateFormat(\\\"dd/MMM/yyyy:HH:mm:ss ZZZZ\\\");\\n // set default timezone to be runtime independent\\n TimeZone.setDefault(TimeZone.getTimeZone(\\\"UTC\\\"));\\n try {\\n return dateFormat.parse(timeString);\\n } catch (ParseException e) {\\n LOGGER.log(Level.SEVERE, \\\"Date cannot be parsed: \\\"+ timeString, e);\\n return null;\\n }\\n }\",\n \"public static Date de_STRING_a_DATE(String fechaEnString) {\\n SimpleDateFormat miFormato2 = new SimpleDateFormat(\\\"dd/MM/yyyy\\\");\\n Date fechaenjava = null;\\n try {\\n fechaenjava = miFormato2.parse(fechaEnString);\\n } catch (ParseException e) {\\n e.printStackTrace();\\n }\\n return fechaenjava;\\n }\",\n \"public Calendar convertFromString(String stringDate) {\\n Calendar dateVacancy = Calendar.getInstance();\\n dateVacancy.set(Calendar.MILLISECOND, 0); //remove milliseconds\\n if (months.isEmpty()) {\\n fillMap();\\n }\\n if (stringDate.contains(TODAY)) {\\n year = Calendar.getInstance().get(Calendar.YEAR);\\n month = Calendar.getInstance().get(Calendar.MONTH);\\n day = Calendar.getInstance().get(Calendar.DAY_OF_MONTH);\\n dateVacancy.set(year, month, day);\\n } else if (stringDate.contains(YESTERDAY)) {\\n year = Calendar.getInstance().get(Calendar.YEAR);\\n month = Calendar.getInstance().get(Calendar.MONTH);\\n day = Calendar.getInstance().get(Calendar.DAY_OF_MONTH);\\n dateVacancy.set(year, month, day - 1);\\n } else {\\n stringDate = stringDate.substring(0, 9);\\n String monthStr = stringDate.substring(stringDate.length() - 7, stringDate.length() - 3).trim();\\n this.year = convertToYear(stringDate);\\n this.month = months.get(monthStr);\\n this.day = convertToDay(stringDate);\\n dateVacancy.set(year, month, day);\\n }\\n return dateVacancy;\\n }\",\n \"public Date createDate(String strDate){\\n\\n Date date = null;\\n\\n // Get time\\n Calendar cal = Calendar.getInstance();\\n Date currentLocalTime = cal.getTime();\\n DateFormat dateformat = new SimpleDateFormat(\\\"HH:mm:ss\\\");\\n String localTime = dateformat.format(currentLocalTime);\\n\\n // Concat strings\\n String tmpDate = strDate + \\\" \\\" + localTime;\\n //\\n SimpleDateFormat format = new SimpleDateFormat(\\\"yyyy-MM-dd HH:mm:ss\\\");\\n\\n try {\\n date = format.parse(tmpDate);\\n\\n } catch (ParseException e) {\\n e.printStackTrace();\\n }\\n\\n return date;\\n }\",\n \"private static Date getDate(String sdate)\\n\\t{\\n\\t\\tDate date = null;\\n\\t\\tSimpleDateFormat formatter = new SimpleDateFormat(\\\"MM/dd/yyyy\\\");\\n\\t\\ttry {\\n\\t\\t\\tdate = formatter.parse(sdate);\\n\\t\\t} catch (ParseException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\treturn date;\\n\\t}\",\n \"public E_Date(String value) throws ParseException {\\n\\t\\tsuper(DATE_TIME.parse(value).toDate());\\n\\t}\",\n \"public Date ToDate(String line){\\n SimpleDateFormat sdf = new SimpleDateFormat(\\\"yyyy/MM/dd\\\");\\n try {\\n Date d = sdf.parse(line);\\n return d;\\n } catch (ParseException ex) {\\n\\n Log.v(\\\"Exception\\\", ex.getLocalizedMessage());\\n return null;\\n }\\n }\",\n \"public static Date toDate(Object obj, String pattern, TimeZone timeZone) {\\n if (obj == null) {\\n return null;\\n } else if (obj instanceof String) {\\n return toDateFromString((String) obj, pattern, timeZone);\\n } else if (obj instanceof Date) {\\n final Date paramDate = (Date) obj;\\n if (Date.class.equals(paramDate.getClass())) { // pure date\\n return paramDate;\\n } else { // sub class\\n // because the Date is not final class.\\n final Date date = new Date();\\n date.setTime(paramDate.getTime());\\n return date;\\n }\\n } else if (obj instanceof Calendar) {\\n return ((Calendar) obj).getTime();\\n } else if (obj instanceof byte[]) {\\n return toDate(toSerializable((byte[]) obj)); // recursive\\n } else if (obj instanceof Long) {\\n return new Date((Long) obj);\\n } else {\\n return toDateFromString(obj.toString(), pattern, timeZone);\\n }\\n }\",\n \"public static Date getDateFromString(String date) {\\r\\n Date newdate = null;\\r\\n SimpleDateFormat dateformat = new SimpleDateFormat(\\\"yyyy-MM-dd hh:mm:ss\\\");\\r\\n\\r\\n try {\\r\\n newdate = dateformat.parse(date);\\r\\n System.out.println(newdate);\\r\\n } catch (ParseException e) {\\r\\n e.printStackTrace();\\r\\n }\\r\\n\\r\\n return newdate;\\r\\n }\",\n \"public Date formatForDate(String data) throws ParseException{\\n //definindo a forma da Data Recebida\\n DateFormat formatUS = new SimpleDateFormat(\\\"dd-MM-yyyy\\\");\\n return formatUS.parse(data);\\n }\",\n \"private static final Date convertStringToDate(String aMask, String strDate) {\\n SimpleDateFormat df = null;\\n Date date = null;\\n df = new SimpleDateFormat(aMask);\\n try {\\n date = df.parse(strDate);\\n } catch (ParseException pe) {\\n throw new ValidateException(\\\"日期转换出现异常,\\\"+pe.getMessage(), pe);\\n }\\n\\n return (date);\\n }\",\n \"public static Date converteStringInvertidaSemBarraAAMMDDParaDate(String data) {\\r\\n\\t\\tDate retorno = null;\\r\\n\\r\\n\\t\\tString dataInvertida = data.substring(4, 6) + \\\"/\\\" + data.substring(2, 4) + \\\"/20\\\" + data.substring(0, 2);\\r\\n\\r\\n\\t\\tSimpleDateFormat dataTxt = new SimpleDateFormat(\\\"dd/MM/yyyy\\\");\\r\\n\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tretorno = dataTxt.parse(dataInvertida);\\r\\n\\t\\t} catch (ParseException e) {\\r\\n\\t\\t\\tthrow new IllegalArgumentException(data + \\\" não tem o formato dd/MM/yyyy.\\\");\\r\\n\\t\\t}\\r\\n\\t\\treturn retorno;\\r\\n\\t}\",\n \"@Override\\n\\t\\tpublic java.sql.Date convert(String s) throws ParseException {\\n\\t\\t\\ts = supportHtml5DateTimePattern(s);\\n\\t\\t\\t\\n\\t\\t\\tif (timeStampWithoutSecPatternLen == s.length()) {\\n\\t\\t\\t\\ts = s + \\\":00\\\";\\n\\t\\t\\t}\\n\\t\\t\\tif (s.length() > dateLen) {\\t// if (x < timeStampLen) 改用 datePattern 转换，更智能\\n\\t\\t\\t\\t// return new java.sql.Date(java.sql.Timestamp.valueOf(s).getTime());\\t// error under jdk 64bit(maybe)\\n\\t\\t\\t\\treturn new java.sql.Date(getFormat(timeStampPattern).parse(s).getTime());\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\t// return new java.sql.Date(java.sql.Date.valueOf(s).getTime());\\t// error under jdk 64bit\\n\\t\\t\\t\\treturn new java.sql.Date(getFormat(datePattern).parse(s).getTime());\\n\\t\\t\\t}\\n\\t\\t}\",\n \"public void parseDate(String d)\\n {\\n\\tdate.set(d);\\n String [] dateList = d.split(\\\"-\\\");\\n \\n year.set(Integer.valueOf(dateList[0]));\\n month.set(Integer.valueOf(dateList[1]));\\n day.set(Integer.valueOf(dateList[2]));\\n }\",\n \"public static Date toDate(final String data, final String sFormat, final Locale locale) {\\n final SimpleDateFormat formato = new SimpleDateFormat(sFormat, locale == null ? getLocale(CalendarParams.LOCALE_PT) : locale);\\n Date date = null;\\n try {\\n date = formato.parse(data);\\n } catch (ParseException e) {\\n // LOG.error(\\\"Date dont convert \\\", e);\\n System.out.println(e.getMessage());\\n }\\n return date;\\n }\",\n \"public static Date converteStringInvertidaSemBarraAAAAMMDDParaDate(String data) {\\r\\n\\t\\tDate retorno = null;\\r\\n\\r\\n\\t\\tString dataInvertida = data.substring(6, 8) + \\\"/\\\" + data.substring(4, 6) + \\\"/\\\" + data.substring(0, 4);\\r\\n\\r\\n\\t\\tSimpleDateFormat dataTxt = new SimpleDateFormat(\\\"dd/MM/yyyy\\\");\\r\\n\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tretorno = dataTxt.parse(dataInvertida);\\r\\n\\t\\t} catch (ParseException e) {\\r\\n\\t\\t\\tthrow new IllegalArgumentException(data + \\\" não tem o formato dd/MM/yyyy.\\\");\\r\\n\\t\\t}\\r\\n\\t\\treturn retorno;\\r\\n\\t}\",\n \"public static LocalDate stringToDate(String inputStringDate) {\\n\\t\\treturn LocalDate.parse(inputStringDate);\\n\\t}\",\n \"public static Date convertStringToDate(String aMask, String strDate)\\n\\t\\t\\tthrows ParseException {\\n\\t\\tSimpleDateFormat df;\\n\\t\\tDate date;\\n\\t\\tdf = new SimpleDateFormat(aMask);\\n\\n\\t\\tif (log.isDebugEnabled()) {\\n\\t\\t\\tlog.debug(\\\"converting '\\\" + strDate + \\\"' to date with mask '\\\"\\n\\t\\t\\t\\t\\t+ aMask + \\\"'\\\");\\n\\t\\t}\\n\\n\\t\\ttry {\\n\\t\\t\\tdate = df.parse(strDate);\\n\\t\\t} catch (ParseException pe) {\\n\\t\\t\\t// log.error(\\\"ParseException: \\\" + pe);\\n\\t\\t\\tthrow new ParseException(pe.getMessage(), pe.getErrorOffset());\\n\\t\\t}\\n\\n\\t\\treturn (date);\\n\\t}\",\n \"public static Date parseDateTime(String date)\\n\\t{\\n\\t\\treturn parseFormatDate(date, getDateTimeFormat());\\n\\t}\",\n \"public static String parseDate(String input) {\\n String year = input.substring(0, 4);\\n String month = input.substring(5, 7);\\n String day = input.substring(8, 10);\\n return year + \\\"-\\\" + month + \\\"-\\\" + day;\\n }\",\n \"@Test\\n void test7(){\\n\\n SimpleDateFormat formatter = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\n Date date = new Date();\\n String dString = formatter.format(date);\\n System.out.println(\\\"dString=\\\"+dString);\\n\\n Date datas = java.sql.Date.valueOf(dString);\\n System.out.println(\\\"datas=\\\"+datas);\\n\\n\\n }\",\n \"private Date parseDate(String text) throws Exception {\\n SimpleDateFormat dateFormat = new SimpleDateFormat(\\\"yyyy-MM-dd HH:mm:ss.SSS\\\");\\n return dateFormat.parse(text);\\n }\",\n \"public Date parseDate(String date) {\\t\\t\\n\\t\\ttry{\\n\\t\\t\\tDate d2 = sdf.parse(date);\\n\\t\\t\\t//String month = parseMonth(date);\\n\\t\\t\\t//cal.setTime(d2);\\t\\t\\t\\n\\t\\t\\t//months.put(month, new Integer(cal.get(Calendar.MONTH) + 1));\\t\\t\\t\\n\\t\\t\\treturn d2;\\n\\t\\t} catch(ParseException e){\\n\\t\\t\\tSystem.out.println(\\\"Invalid Date Format or No Such Date : \\\" + date + \\\". Message: \\\" + e.getMessage() );\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t}\",\n \"public static Date parseDate(String date) throws java.text.ParseException {\\n if(date == null) return null;\\n\\n SimpleDateFormat sdf = new SimpleDateFormat(\\\"yyyy-MM-dd HH:mm:ss\\\");\\n try {\\n return sdf.parse(date);\\n\\n } catch(ParseException e) {\\n sdf = new SimpleDateFormat(\\\"yyyy-MM-dd HH:mm\\\");\\n\\n try {\\n return sdf.parse(date);\\n\\n } catch(ParseException e2) {\\n sdf = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\n return sdf.parse(date);\\n }\\n } \\n }\",\n \"public Date(String icalStr) throws ParseException, BogusDataException\\r\\n\\t{\\r\\n\\t\\tsuper(icalStr);\\r\\n\\r\\n\\t\\tyear = month = day = 0;\\r\\n\\t\\thour = minute = second = 0;\\r\\n\\r\\n\\t\\tfor (int i = 0; i < attributeList.size(); i++)\\r\\n\\t\\t{\\r\\n\\t\\t\\tAttribute a = attributeAt(i);\\r\\n\\t\\t\\tString aname = a.name.toUpperCase(Locale.ENGLISH);\\r\\n\\t\\t\\tString aval = a.value.toUpperCase(Locale.ENGLISH);\\r\\n\\t\\t\\t// TODO: not sure if any attributes are allowed here...\\r\\n\\t\\t\\t// Look for VALUE=DATE or VALUE=DATE-TIME\\r\\n\\t\\t\\t// DATE means untimed for the event\\r\\n\\t\\t\\tif (aname.equals(\\\"VALUE\\\"))\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif (aval.equals(\\\"DATE\\\"))\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tdateOnly = true;\\r\\n\\t\\t\\t\\t} else if (aval.equals(\\\"DATE-TIME\\\"))\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tdateOnly = false;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t} else if (aname.equals(\\\"TZID\\\"))\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttzid = a.value;\\r\\n\\t\\t\\t} else\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t// TODO: anything else allowed here?\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tString inDate = value;\\r\\n\\r\\n\\t\\tif (inDate.length() < 8)\\r\\n\\t\\t{\\r\\n\\t\\t\\t// Invalid format\\r\\n\\t\\t\\tthrow new ParseException(\\\"Invalid date format '\\\" + inDate + \\\"'\\\",\\r\\n\\t\\t\\t\\t\\tinDate);\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// Make sure all parts of the year are numeric.\\r\\n\\t\\tfor (int i = 0; i < 8; i++)\\r\\n\\t\\t{\\r\\n\\t\\t\\tchar ch = inDate.charAt(i);\\r\\n\\t\\t\\tif (ch < '0' || ch > '9')\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tthrow new ParseException(\\r\\n\\t\\t\\t\\t\\t\\t\\\"Invalid date format '\\\" + inDate + \\\"'\\\", inDate);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tyear = Integer.parseInt(inDate.substring(0, 4));\\r\\n\\t\\tmonth = Integer.parseInt(inDate.substring(4, 6));\\r\\n\\t\\tday = Integer.parseInt(inDate.substring(6, 8));\\r\\n\\t\\tif (day < 1 || day > 31 || month < 1 || month > 12)\\r\\n\\t\\t\\tthrow new BogusDataException(\\\"Invalid date '\\\" + inDate + \\\"'\\\",\\r\\n\\t\\t\\t\\t\\tinDate);\\r\\n\\t\\t// Make sure day of month is valid for specified month\\r\\n\\t\\tif (year % 4 == 0)\\r\\n\\t\\t{\\r\\n\\t\\t\\t// leap year\\r\\n\\t\\t\\tif (day > leapMonthDays[month - 1])\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tthrow new BogusDataException(\\\"Invalid day of month '\\\" + inDate\\r\\n\\t\\t\\t\\t\\t\\t+ \\\"'\\\", inDate);\\r\\n\\t\\t\\t}\\r\\n\\t\\t} else\\r\\n\\t\\t{\\r\\n\\t\\t\\tif (day > monthDays[month - 1])\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tthrow new BogusDataException(\\\"Invalid day of month '\\\" + inDate\\r\\n\\t\\t\\t\\t\\t\\t+ \\\"'\\\", inDate);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t// TODO: parse time, handle localtime, handle timezone\\r\\n\\t\\tif (inDate.length() > 8)\\r\\n\\t\\t{\\r\\n\\t\\t\\t// TODO make sure dateOnly == false\\r\\n\\t\\t\\tif (inDate.charAt(8) == 'T')\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttry\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\thour = Integer.parseInt(inDate.substring(9, 11));\\r\\n\\t\\t\\t\\t\\tminute = Integer.parseInt(inDate.substring(11, 13));\\r\\n\\t\\t\\t\\t\\tsecond = Integer.parseInt(inDate.substring(13, 15));\\r\\n\\t\\t\\t\\t\\tif (hour > 23 || minute > 59 || second > 59)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tthrow new BogusDataException(\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\\"Invalid time in date string '\\\" + inDate + \\\"'\\\",\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tinDate);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tif (inDate.length() > 15)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tisUTC = inDate.charAt(15) == 'Z';\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t} catch (NumberFormatException nef)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tthrow new BogusDataException(\\r\\n\\t\\t\\t\\t\\t\\t\\t\\\"Invalid time in date string '\\\" + inDate + \\\"' - \\\"\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ nef, inDate);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t} else\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t// Invalid format\\r\\n\\t\\t\\t\\tthrow new ParseException(\\r\\n\\t\\t\\t\\t\\t\\t\\\"Invalid date format '\\\" + inDate + \\\"'\\\", inDate);\\r\\n\\t\\t\\t}\\r\\n\\t\\t} else\\r\\n\\t\\t{\\r\\n\\t\\t\\t// Just date, no time\\r\\n\\t\\t\\tdateOnly = true;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tif (isUTC && !dateOnly)\\r\\n\\t\\t{\\r\\n\\t\\t\\t// Use Joda Time to convert UTC to localtime\\r\\n\\t\\t\\tDateTime utcDateTime = new DateTime(DateTimeZone.UTC);\\r\\n\\t\\t\\tutcDateTime = utcDateTime.withDate(year, month, day).withTime(hour,\\r\\n\\t\\t\\t\\t\\tminute, second, 0);\\r\\n\\t\\t\\tDateTime localDateTime = utcDateTime.withZone(DateTimeZone\\r\\n\\t\\t\\t\\t\\t.getDefault());\\r\\n\\t\\t\\tyear = localDateTime.getYear();\\r\\n\\t\\t\\tmonth = localDateTime.getMonthOfYear();\\r\\n\\t\\t\\tday = localDateTime.getDayOfMonth();\\r\\n\\t\\t\\thour = localDateTime.getHourOfDay();\\r\\n\\t\\t\\tminute = localDateTime.getMinuteOfHour();\\r\\n\\t\\t\\tsecond = localDateTime.getSecondOfMinute();\\r\\n\\t\\t} else if (tzid != null)\\r\\n\\t\\t{\\r\\n\\t\\t\\tDateTimeZone tz = DateTimeZone.forID(tzid);\\r\\n\\t\\t\\tif (tz != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t// Convert to localtime\\r\\n\\t\\t\\t\\tDateTime utcDateTime = new DateTime(tz);\\r\\n\\t\\t\\t\\tutcDateTime = utcDateTime.withDate(year, month, day).withTime(\\r\\n\\t\\t\\t\\t\\t\\thour, minute, second, 0);\\r\\n\\t\\t\\t\\tDateTime localDateTime = utcDateTime.withZone(DateTimeZone\\r\\n\\t\\t\\t\\t\\t\\t.getDefault());\\r\\n\\t\\t\\t\\tyear = localDateTime.getYear();\\r\\n\\t\\t\\t\\tmonth = localDateTime.getMonthOfYear();\\r\\n\\t\\t\\t\\tday = localDateTime.getDayOfMonth();\\r\\n\\t\\t\\t\\thour = localDateTime.getHourOfDay();\\r\\n\\t\\t\\t\\tminute = localDateTime.getMinuteOfHour();\\r\\n\\t\\t\\t\\tsecond = localDateTime.getSecondOfMinute();\\r\\n\\t\\t\\t\\t// Since we have converted to localtime, remove the TZID\\r\\n\\t\\t\\t\\t// attribute\\r\\n\\t\\t\\t\\tthis.removeNamedAttribute(\\\"TZID\\\");\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tisUTC = false;\\r\\n\\r\\n\\t\\t// Add attribute that says date-only or date with time\\r\\n\\t\\tif (dateOnly)\\r\\n\\t\\t\\taddAttribute(\\\"VALUE\\\", \\\"DATE\\\");\\r\\n\\t\\telse\\r\\n\\t\\t\\taddAttribute(\\\"VALUE\\\", \\\"DATE-TIME\\\");\\r\\n\\r\\n\\t}\",\n \"private Date stringToSQLDate(String fecha){\\n\\t\\t\\n\\t\\t\\n\\t\\tint ano=Integer.parseInt(fecha.substring(0,4));\\n\\t\\tint mes =Integer.parseInt(fecha.substring(5,7));\\n\\t\\tint dia =Integer.parseInt( fecha.substring(8));\\n\\t\\t\\n\\t\\t@SuppressWarnings(\\\"deprecation\\\")\\n\\t\\tDate tmp = new Date(ano-1900,mes-1,dia);\\n\\t\\t\\n\\t\\treturn tmp;\\n\\t}\",\n \"public static java.sql.Date StringToSqlDate(String StringValue){\\n return java.sql.Date.valueOf(StringValue);\\n }\",\n \"private LocalDate createDate(String date) {\\n LocalDate localDate = LocalDate.parse(date);\\n\\n return localDate;\\n }\",\n \"public static Date wccDateToDate(String strDate) {\\n Date date = null;\\n if ((null != strDate) && !strDate.trim().isEmpty()) {\\n SimpleDateFormat sdf = new SimpleDateFormat(WccConstants.WCC_DATE_FORMAT);\\n try {\\n date = sdf.parse(strDate);\\n } catch (ParseException e) {\\n e.printStackTrace();\\n }\\n }\\n return date;\\n }\",\n \"@Test public void testDateFormat() {\\n String str = \\\"{dateField: 123456789}\\\";\\n TestBean bean = JSONCoder.getGlobal().decode(str, TestBean.class);\\n assertEquals(123456789L, bean.getDateField().getTime());\\n\\n str = \\\"{dateField: '1900-1-1'}\\\";\\n bean = JSONCoder.getGlobal().decode(str, TestBean.class);\\n assertEquals(\\\"1900-01-01\\\", new SimpleDateFormat(\\\"yyyy-MM-dd\\\").format(bean.getDateField()));\\n\\n str = \\\"{dateField: '1900-1-1 11:11:11'}\\\";\\n bean = JSONCoder.getGlobal().decode(str, TestBean.class);\\n assertEquals(\\\"1900-01-01 11:11:11\\\", new SimpleDateFormat(\\\"yyyy-MM-dd HH:mm:ss\\\").format(bean.getDateField()));\\n\\n str = \\\"{dateField: 'invalidDateFormat'}\\\";\\n expectDecodeWithException(str, TestBean.class,\\n \\\"java.text.ParseException: Unparseable date: \\\\\\\"invalidDateFormat\\\\\\\"\\\");\\n }\",\n \"public static Date isoStringToDate(String d) {\\n\\t\\tDateTime dt = XML_DATE_TIME_FORMAT.parseDateTime(d);\\n\\t\\treturn dt.toDate();\\n\\t}\",\n \"public static Date toDateFormat_2(String dateString) {\\r\\n\\t\\treturn stringToDate(dateString, DATE_FORMAT_2);\\r\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.690975","0.68790036","0.68677276","0.6784011","0.6719434","0.6692963","0.66848546","0.668141","0.66657454","0.6659591","0.6591835","0.6546939","0.6541635","0.6541179","0.65279484","0.6516968","0.65118176","0.6491956","0.64834255","0.64689696","0.6466199","0.64598006","0.6455555","0.6448227","0.643395","0.643109","0.640989","0.64086187","0.6389556","0.6389145","0.6378502","0.6371149","0.6360912","0.63510716","0.634552","0.6344947","0.6309216","0.62535423","0.6248647","0.6248509","0.6219307","0.6217705","0.6203482","0.6196517","0.6161671","0.61029094","0.6088667","0.60774","0.60733783","0.6066901","0.6058303","0.6054263","0.6054195","0.6029019","0.60275644","0.6026597","0.59669244","0.59452945","0.59366024","0.59237826","0.59083694","0.5892567","0.5891935","0.5879182","0.58746344","0.5866148","0.58660567","0.58634067","0.58564246","0.584938","0.5819057","0.58171076","0.581144","0.5808536","0.5804197","0.5800365","0.57984316","0.57958543","0.579484","0.579401","0.57772076","0.5768565","0.57633066","0.57552135","0.57500976","0.57265604","0.57184225","0.56929713","0.5672797","0.5667154","0.56597596","0.56474364","0.5634956","0.56290895","0.5625253","0.5621059","0.5619489","0.56099534","0.55896777","0.55893445"],"string":"[\n \"0.690975\",\n \"0.68790036\",\n \"0.68677276\",\n \"0.6784011\",\n \"0.6719434\",\n \"0.6692963\",\n \"0.66848546\",\n \"0.668141\",\n \"0.66657454\",\n \"0.6659591\",\n \"0.6591835\",\n \"0.6546939\",\n \"0.6541635\",\n \"0.6541179\",\n \"0.65279484\",\n \"0.6516968\",\n \"0.65118176\",\n \"0.6491956\",\n \"0.64834255\",\n \"0.64689696\",\n \"0.6466199\",\n \"0.64598006\",\n \"0.6455555\",\n \"0.6448227\",\n \"0.643395\",\n \"0.643109\",\n \"0.640989\",\n \"0.64086187\",\n \"0.6389556\",\n \"0.6389145\",\n \"0.6378502\",\n \"0.6371149\",\n \"0.6360912\",\n \"0.63510716\",\n \"0.634552\",\n \"0.6344947\",\n \"0.6309216\",\n \"0.62535423\",\n \"0.6248647\",\n \"0.6248509\",\n \"0.6219307\",\n \"0.6217705\",\n \"0.6203482\",\n \"0.6196517\",\n \"0.6161671\",\n \"0.61029094\",\n \"0.6088667\",\n \"0.60774\",\n \"0.60733783\",\n \"0.6066901\",\n \"0.6058303\",\n \"0.6054263\",\n \"0.6054195\",\n \"0.6029019\",\n \"0.60275644\",\n \"0.6026597\",\n \"0.59669244\",\n \"0.59452945\",\n \"0.59366024\",\n \"0.59237826\",\n \"0.59083694\",\n \"0.5892567\",\n \"0.5891935\",\n \"0.5879182\",\n \"0.58746344\",\n \"0.5866148\",\n \"0.58660567\",\n \"0.58634067\",\n \"0.58564246\",\n \"0.584938\",\n \"0.5819057\",\n \"0.58171076\",\n \"0.581144\",\n \"0.5808536\",\n \"0.5804197\",\n \"0.5800365\",\n \"0.57984316\",\n \"0.57958543\",\n \"0.579484\",\n \"0.579401\",\n \"0.57772076\",\n \"0.5768565\",\n \"0.57633066\",\n \"0.57552135\",\n \"0.57500976\",\n \"0.57265604\",\n \"0.57184225\",\n \"0.56929713\",\n \"0.5672797\",\n \"0.5667154\",\n \"0.56597596\",\n \"0.56474364\",\n \"0.5634956\",\n \"0.56290895\",\n \"0.5625253\",\n \"0.5621059\",\n \"0.5619489\",\n \"0.56099534\",\n \"0.55896777\",\n \"0.55893445\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6491432"},"document_rank":{"kind":"string","value":"18"}}},{"rowIdx":29390,"cells":{"query":{"kind":"string","value":"Formats given date with given format."},"document":{"kind":"string","value":"public String formatDate(Date date, String format) {\n return this.convertDateToString(date, format);\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["public String format (Date date , String dateFormat) ;","public Date formatDate( String date, String format )\n throws ParseException {\n SimpleDateFormat dateFormat = new SimpleDateFormat(format);\n dateFormat.setLenient(false);\n return dateFormat.parse(date);\n }","public static String formatDate(Calendar date, DateFormat format) {\n\n switch (format) {\n case COMPLETE_DATE_FORMAT:\n format = DateFormat.COMPLETE_DATE_FORMAT;\n break;\n case DAY_FORMAT:\n format = DateFormat.DAY_FORMAT;\n break;\n }\n\n SimpleDateFormat dateFormatter = new SimpleDateFormat(format.getFormat(), Locale.US);\n\n return dateFormatter.format(date.getTime());\n }","public static String formatDate(Date date, String format)\n\t{\n\t\tDateFormat dateFormat = new SimpleDateFormat(format);\n\t\treturn dateFormat.format(date);\n\t}","public static String formatDateToString(Date dateObj, String format) {\n SimpleDateFormat formatter = new SimpleDateFormat(format);\n return formatter.format(dateObj);\n }","public static synchronized String formatDate(Date d) {\n return dateFormat.format(d);\n }","public static String dateToStringFormat(Date date, String format){\n return new SimpleDateFormat(format).format(date);\n }","@Method(selector = \"stringFromDate:toDate:\")\n public native String format(NSDate fromDate, NSDate toDate);","private String easyDateFormat(final String format) {\n Date today = new Date();\n SimpleDateFormat formatter = new SimpleDateFormat(format);\n String datenewformat = formatter.format(today);\n return datenewformat;\n }","@Override\n public StringBuffer format(Date date, StringBuffer toAppendTo, FieldPosition fieldPosition) {\n String value = ISO8601Utils.format(date, true);\n toAppendTo.append(value);\n return toAppendTo;\n }","public static String formatDate(String format, long timestamp) {\n return DateFormat.format(format, new Date(timestamp)).toString();\n }","public static String getFormattedDateString(Date date, String format) {\n Calendar cal = Calendar.getInstance();\n TimeZone timeZone = cal.getTimeZone();\n\n SimpleDateFormat dateFormat = new SimpleDateFormat(format);\n dateFormat.setTimeZone(timeZone);\n\n return dateFormat.format(date);\n }","public String formatDate(Date date) {\n String result = \"\";\n if (date != null) {\n result = DateUtility.simpleFormat(date, MEDIUM_DATE_FORMAT);\n }\n return result;\n }","public static String formatDate(Date valor, String formato) {\r\n\t\tSimpleDateFormat sdf = new SimpleDateFormat(formato);\r\n\t\treturn sdf.format(valor);\r\n\t}","public String dateFormatter(String fromDate) {\n\t\tString newDateString=\"\";\n\t\ttry {\n\t\t\tfinal String oldFormat = \"yyyy/MM/dd\";\n\t\t\tfinal String newFormat = \"yyyy-MM-dd\";\n\t\t\tSimpleDateFormat sdf = new SimpleDateFormat(oldFormat);\n\t\t\tDate d = sdf.parse(fromDate);\n\t\t\tsdf.applyPattern(newFormat);\n\t\t\tnewDateString = sdf.format(d);\n\t\t} catch(Exception exp) {\n\t\t\tthrow ExceptionUtil.getYFSException(ExceptionLiterals.ERRORCODE_INVALID_DATE, exp);\n\t\t}\n\t\treturn newDateString;\n\t}","private String formatDate(Date date) {\n String resultDate;\n SimpleDateFormat dateFormat;\n dateFormat = new SimpleDateFormat(\"dd/MM/yyyy\");\n resultDate = dateFormat.format(date);\n return resultDate;\n }","public static String formatDate(java.util.Date value, String pattern) {\r\n\t\tif (value != null) {\r\n\t\t\t// Cria Locale informando Portugues Brasil\r\n\t\t\tLocale locale = new Locale(\"pt\", \"BR\");\r\n\t\t\t// Cria Formatador de data informando padr�o\r\n\t\t\tSimpleDateFormat dateFormat = new SimpleDateFormat(pattern, locale);\r\n\t\t\t// Passa o resultado final obtido para uma String\r\n\t\t\tString retorno = dateFormat.format(value);\r\n\t\t\t// Trata a String para que a primeira letra seja maiuscula (caso esteja no padr�o MMM/yyyy\r\n\t\t\tif ((retorno != null) && (retorno.length() > 0)) {\r\n\t\t\t\tretorno = (retorno.charAt(0) + \"\").toUpperCase() + retorno.substring(1);\r\n\t\t\t}\r\n\t\t\treturn retorno;\r\n\t\t} else {\r\n\t\t\treturn \"\";\r\n\t\t}\r\n\t}","public static String date_d(String sourceDate,String format) throws ParseException {\n SimpleDateFormat sdf_ = new SimpleDateFormat(\"yyyy-MM-dd\");\n SimpleDateFormat sdfNew_ = new SimpleDateFormat(format);\n return sdfNew_.format(sdf_.parse(sourceDate));\n }","@org.jetbrains.annotations.NotNull()\n public static final java.lang.String getFormattedDate(@org.jetbrains.annotations.NotNull()\n java.util.Calendar $this$getFormattedDate, @org.jetbrains.annotations.NotNull()\n java.lang.String format) {\n return null;\n }","public String formatDate (Date date){\r\n\t\tDateFormat df = new SimpleDateFormat(\"EEE, d MMM yyyy HH:mm:ss z\", Locale.ENGLISH);\r\n\t\treturn df.format(date);\r\n\t}","public static String getFormattedDate(String dateStr, String toformat)\r\n\t{\r\n\t\tString mName = \"getFormattedDate()\";\r\n\t\tIDateFormatter dateFormatter = null;\r\n\t\tDateFormatConfig dateFormat = null;\r\n\t\tString formattedDate = null;\r\n\t\tdateFormat = getDateFormat(toformat);\r\n\t\ttry\r\n\t\t{\r\n\t\t\tdateFormatter = (IDateFormatter) ResourceLoaderUtils.createInstance(dateFormat.getFormatterClass(),\r\n\t\t\t\t\t(Object[]) null);\r\n\t\t\tformattedDate = dateFormatter.formatDate(dateStr, dateFormat.getJavaDateFormat());\r\n\t\t} catch (Exception exp)\r\n\t\t{\r\n\t\t\tlogger.cterror(\"CTBAS00112\", exp, mName);\r\n\r\n\t\t}\r\n\t\treturn formattedDate;\r\n\t}","private static void formatDate (XmlDoc.Element date) throws Throwable {\n\t\tString in = date.value();\n\t\tString out = DateUtil.convertDateString(in, \"dd-MMM-yyyy\", \"yyyy-MM-dd\");\n\t\tdate.setValue(out);\n\t}","public static String formatSdf(Date data, String format) {\n if (data == null) {\n return null;\n }\n return new SimpleDateFormat(format).format(data);\n }","public static String formatDate(Date date) {\n\t\tString newstring = new SimpleDateFormat(\"MM-dd-yyyy\").format(date);\n\t\treturn newstring;\n\t}","private String formatDate (Date date) {\n SimpleDateFormat sdf = new SimpleDateFormat(\"E, dd MMM yyyy HH:mm:ss\", Locale.ENGLISH);\n return sdf.format(date);\n }","public String formatDate(Date date) {\n\t\tString formattedDate;\n\t\tif (date != null) {\n\t\t\tformattedDate = simpleDateFormat.format(date);\n\t\t\tformattedDate = formattedDate.substring(0,\n\t\t\t\t\tformattedDate.length() - 5);\n\t\t} else {\n\t\t\tformattedDate = Constants.EMPTY_STRING;\n\t\t}\n\t\treturn formattedDate;\n\t}","public static String formatDateToString(Date d, String formatoData) {\n\t\tfinal String OLD_FORMAT = \"yyyy-MM-dd\";\r\n\r\n\t\tString newDateString;\r\n\r\n\t\tSimpleDateFormat sdf = new SimpleDateFormat(OLD_FORMAT);\r\n\t\tsdf.applyPattern(formatoData);\r\n\t\tnewDateString = sdf.format(d);\r\n\t\t\r\n\t\treturn newDateString;\r\n\t}","public static String formatterDate(Date date){\n\t\tString retour = null;\n\t\tif(date != null){\n\t\t\tretour = dfr.format(date);\n\t\t}\n\t\treturn retour;\n\t}","public static Date changeDateFormat(String date, String format){\n SimpleDateFormat sdf = new SimpleDateFormat(format);\n try {\n return sdf.parse(date);\n } catch (ParseException e) {\n e.printStackTrace();\n return null;\n }\n }","public java.sql.Date format(String date) {\n int i = 0;\n int dateAttr[];\n dateAttr = new int[3];\n for(String v : date.split(\"/\")) {\n dateAttr[i] = Integer.parseInt(v);\n i++;\n }\n\n GregorianCalendar gcalendar = new GregorianCalendar();\n gcalendar.set(dateAttr[2], dateAttr[0]-1, dateAttr[1]); // Year,Month,Day Of Month\n java.sql.Date sdate = new java.sql.Date(gcalendar.getTimeInMillis());\n return sdate;\n }","public static String formatDate(Date date) {\n final SimpleDateFormat formatter = new SimpleDateFormat(\"MM-dd-yyyy\");\n return formatter.format(date);\n }","private String formatDate(final Date date) {\r\n\t\tfinal Calendar calendar = Calendar.getInstance();\r\n\t\tcalendar.setTime(date);\r\n\r\n\t\tfinal String dayOfMonth = formatDayOfMonth(calendar);\r\n\t\tfinal String month = formatMonth(calendar);\r\n\t\tfinal String year = String.valueOf(calendar.get(Calendar.YEAR));\r\n\r\n\t\treturn String.format(\"%s/%s/%s\", year, month, dayOfMonth);\r\n\t}","public static String formatDate(Date date, String userId)\n\t{\n\t\tDateFormat format = new SimpleDateFormat(\"MMM dd, yyyy hh:mm a\", getPreferredLocale(userId));\n\t\tformat.setTimeZone(getPreferredTimeZone(userId));\n\t\tString rv = format.format(date);\n\t\treturn rv;\n\t}","private String formatDate(Date date){\n SimpleDateFormat format = new SimpleDateFormat(\"dd-MM-yyyy HH:mm\", Locale.getDefault());\n\n return format.format(date);\n }","public static String format(LocalDate date){\r\n\t\t\r\n\t\tif(date==null){\r\n\t\t\treturn null;\r\n\t\t}\r\n\t\treturn DATE_FORMATTER.format(date);\r\n\t}","private String getFormattedDate(String date) {\n SimpleDateFormat dateFormat = new SimpleDateFormat(getString(R.string.received_import_date_format));\n SimpleDateFormat desiredDateFormat = new SimpleDateFormat(getString(R.string.desired_import_date_format));\n Date parsedDate;\n try {\n parsedDate = dateFormat.parse(date);\n return desiredDateFormat.format(parsedDate);\n } catch (ParseException e) {\n // Return an empty string in case of issues parsing the date string received.\n e.printStackTrace();\n return \"\";\n }\n }","private String formatDate(String dateStr) {\n try {\n SimpleDateFormat fmt = new SimpleDateFormat(Properties.DATE_FORMAT_ALL);\n Date date = fmt.parse(dateStr);\n SimpleDateFormat fmtOut = new SimpleDateFormat(Properties.DATE_FORMAT);\n return fmtOut.format(date);\n } catch (ParseException e) {\n System.out.println( Properties.K_WARNING + \" \" + e.getMessage());\n }\n return \"\";\n }","public static String formatDateOnly(Date date, String userId)\n\t{\t\t\n\t\tDateFormat dateFormat = new SimpleDateFormat(\"MMM dd, yyyy\", getPreferredLocale(userId));\n\t\tdateFormat.setTimeZone(getPreferredTimeZone(userId));\n\t\tString rv = dateFormat.format(date);\n\t\treturn rv;\n\t}","public String convertDateToString(Date date, String format) {\n DateFormat dateFormat = new SimpleDateFormat(format);\n String dateAsString = dateFormat.format(date);\n return dateAsString;\n }","public static String convertDateFormat (String dateStr, String fromFormatPattern, String toFormatPattern) {\n\t\tDateFormat fromFormat = new SimpleDateFormat(fromFormatPattern);\n\t\tDateFormat toFormat = new SimpleDateFormat(toFormatPattern);\n\t\ttoFormat.setLenient(false);\n\t\tDate date;\n\t\ttry {\n\t\t\tdate = fromFormat.parse(dateStr);\n\t\t\treturn toFormat.format(date);\n\t\t} catch (ParseException e) {\n\t\t\t// TODO Auto-generated catch block\n\t\t\tLog.d(\"ERROR\", \"Date formatting Error\");\n\t\t}\n\t\treturn null;\n\t}","public static String formatDate(String dateValue) {\n Date uploadDateTime = null;\n try {\n uploadDateTime = new SimpleDateFormat(\"yyyy-MM-dd HH:mm:ss\", Locale.US).parse(dateValue);\n } catch (ParseException e) {\n e.printStackTrace();\n }\n return new SimpleDateFormat(\"dd/MM/yyyy HH:mm\", Locale.US).format(uploadDateTime);\n }","private String formatDate(Date dateObject) {\r\n SimpleDateFormat dateFormat = new SimpleDateFormat(\"LLL dd, yyyy\");\r\n return dateFormat.format(dateObject);\r\n }","private String formatDate(Date dateObject) {\n SimpleDateFormat dateFormat = new SimpleDateFormat(\"LLL dd, yyyy\");\n return dateFormat.format(dateObject);\n }","public void setDateFormat(String format) {\n this.mDateFormat = format;\n }","private String formatDate(Date dateObject) {\n SimpleDateFormat dateFormat = new SimpleDateFormat(\"LLL dd, yyyy\", Locale.getDefault());\n return dateFormat.format(dateObject);\n }","public static String format(Date d, DateFormat formatter, int gmt) {\n return formatter.format(DateUtil.transform(d, gmt));\n }","public static String formatDate(String date){\n String formatedDate = date;\n if (!date.matches(\"[0-9]{2}-[0-9]{2}-[0-9]{4}\")){\n if (date.matches(\"[0-9]{1,2}/[0-9]{1,2}/([0-9]{2}|[0-9]{4})\"))\n formatedDate = date.replace('/', '-');\n if (date.matches(\"[0-9]{1,2}.[0-9]{1,2}.([0-9]{2}|[0-9]{4})\")){\n if (formatedDate.matches(\"[0-9]{1}.[0-9]{1,2}.([0-9]{2}|[0-9]{4})\"))\n formatedDate = \"0\" + formatedDate;\n if (formatedDate.matches(\"[0-9]{2}.[0-9]{1}.([0-9]{2}|[0-9]{4})\"))\n formatedDate = formatedDate.substring(0, 3) + \"0\" + \n formatedDate.substring(3);\n if (formatedDate.matches(\"[0-9]{2}.[0-9]{2}.[0-9]{2}\")){\n String thisYear = String.valueOf(LocalDate.now().getYear());\n String century = thisYear.substring(0,2);\n /* If the last two digits of the date are larger than the two last digits of \n * the current date, then we can suppose that the year corresponds to the last \n * century.\n */ \n if (Integer.valueOf(formatedDate.substring(6)) > Integer.valueOf(thisYear.substring(2)))\n century = String.valueOf(Integer.valueOf(century) - 1);\n formatedDate = formatedDate.substring(0, 6) + century +\n formatedDate.substring(6); \n }\n }\n }\n return formatedDate;\n }","public static String formatDate(Date d) {\n\t\tint month = d.getMonth() + 1;\n\t\tint dayOfMonth = d.getDate();\n\t\tint year = d.getYear() + 1900;\n\t\tString y = \"\" + year;\n\t\tString m = \"\" + month;\n\t\tString dom = \"\" + dayOfMonth;\n\t\tif (month < 10) {\n\t\t\tm = \"0\" + m;\n\t\t}\n\t\tif (dayOfMonth < 10) {\n\t\t\tdom = \"0\" + dom;\n\t\t}\n\t\treturn m + \"/\" + dom + \"/\" + y.substring(2);\n\t}","public static String formatDate(String strDate) {\n return formatDate(strDate, false);\n }","public static String convertDateFormat(Date sourceDate, SimpleDateFormat dateForm) {\n return dateForm.format(sourceDate);\n }","public static String formatDate(final Date data, final String sFormat, final Locale locale) {\n final SimpleDateFormat simple = new SimpleDateFormat(sFormat, locale == null ? getLocale(CalendarParams.LOCALE_PT) : locale);\n String dateRetorno;\n if (data == null) {\n final GregorianCalendar cal = new GregorianCalendar();\n dateRetorno = simple.format(cal.getTime());\n } else {\n dateRetorno = simple.format(data);\n }\n\n return dateRetorno;\n }","public Date formatDate( String dob )\n throws ParseException {\n SimpleDateFormat dateFormat = new SimpleDateFormat(\"MM/dd/yyyy\");\n dateFormat.setLenient(false);\n return dateFormat.parse(dob);\n }","public static String dateToString(Date date, String format) {\n\t\n\t\tString result = \"\";\n\t\tSimpleDateFormat dateFormat = new SimpleDateFormat(format);\n\n\t\tif (date != null) {\n\t\t\tresult = dateFormat.format(date);\n\t\t}\n\t\n\t\treturn result;\n\t}","public static String formatDate(java.sql.Date date){\n\t\treturn date!=null?toTheString(date):\"\";\n\t}","public static String formatDate(Date date) {\n\t\tDateFormat dateFormat = DateFormat.getDateTimeInstance(DateFormat.SHORT, DateFormat.MEDIUM);\n\n\t\tif (dateFormat instanceof SimpleDateFormat) {\n\t\t\tSimpleDateFormat sdf = (SimpleDateFormat) dateFormat;\n\t\t\t// we want short date format but with 4 digit year\n\t\t\tsdf.applyPattern(sdf.toPattern().replaceAll(\"y+\", \"yyyy\").concat(\" z\"));\n\t\t}\n\n\t\treturn dateFormat.format(date);\n\t}","private String getFormattedDate(Integer format) {\n Date date = new Date(format * 1000L);\n DateFormat dateFormat = new SimpleDateFormat(\"yyyy-MM-dd HH:mm:ss.SSS\");\n dateFormat.setTimeZone(TimeZone.getTimeZone(\"Etc/UTC\"));\n Log.e(\"time\",dateFormat.format(date));\n return dateFormat.format(date);\n }","public static String formatDateForQuery(java.util.Date date){\n return (new SimpleDateFormat(\"yyyy-MM-dd\")).format(date);\n }","public DateTextFieldConfig withFormat(final String value) {\n put(Key.Format, Dates.toJavaScriptDateFormat(value));\n return this;\n }","public void mostrarHora(String formato){\n Date objDate = new Date();\n SimpleDateFormat objSDF = new SimpleDateFormat(formato);\n //este sera el resultado de la fechas\n fecha=objSDF.format(objDate);\n }","private String formatDate(String dateString) {\n DateTimeFormatter dateTimeFormatter = DateTimeFormatter.ofPattern(\"LLL dd, yyyy\");\n LocalDate localDate = LocalDate.parse(dateString.substring(0, 10));\n return dateTimeFormatter.format(localDate);\n }","public static String formatDate(Date date) {\n return DateFormat.getDateFormat(BaracusApplicationContext.getContext()).format(date);\n }","public void setDateFormat(String format) {\n dateFormat = format;\n constructVssDateTimeFormat();\n }","public static String formatDate(Date source, String pattern) throws Exception {\n\tif (null != source) {\n\t DateFormat format = new SimpleDateFormat(pattern);\n\t return format.format(source);\n\t}\n\treturn null;\n }","public static String formatterDateUS(Date date){\n\t\tString retour = null;\n\t\tif(date != null){\n\t\t\tretour = df.format(date);\n\t\t}\n\t\treturn retour;\n\t}","@SuppressLint(\"SimpleDateFormat\") public static String parse(String date, String format){\r\n\t\ttry {\r\n\t\t\tSimpleDateFormat localFormatter= new SimpleDateFormat(format);\r\n\t\t\tlocalFormatter.setLenient(false);\r\n\t\t\tString formattedDate=localFormatter.parse(date).toString();\r\n\t\t\t\r\n\t\t\t//days, months, years\r\n\t\t\tif(format.equals(formats[0])) return convertDate(formattedDate);\r\n\t\t\t\r\n\t\t\t//hours, minutes, seconds\r\n\t\t\telse if(format.equals(formats[1])) return convertHoursMinsSecs(formattedDate);\t\r\n\t\t\t\r\n\t\t\t//hours, minutes\r\n\t\t\telse if(format.equals(formats[2])) return convertHoursMins(formattedDate);\t\r\n\t\t\t\r\n\t\t\treturn \"\";\r\n\t\t\r\n\t\t} catch (ParseException e) {\r\n\t\t\t//e.printStackTrace();\r\n\t\t\treturn \"\";\r\n\t\t}\r\n\t}","private static void formatDate(Date i) {\n\t\tSimpleDateFormat formatter = new SimpleDateFormat(\"MM/dd/yy\");\n\t\tformatter.setLenient(false);\n\t\tAnswer = formatter.format(i);\n\t}","String formatDateCondition(Date date);","private static Date getFormattedDate(String date){\n\t\tString dateStr = null;\n\t\tif(date.length()<11){\n\t\t\tdateStr = date+\" 00:00:00.0\";\n\t\t}else{\n\t\t\tdateStr = date;\n\t\t}\n\t\tDate formattedDate = null;\n\t\ttry {\n\t\t\tformattedDate = new SimpleDateFormat(\"yyyy-MM-dd HH:mm:ss.S\").parse(dateStr);\n\t\t} catch (ParseException e) {\n\t\t\tCommonUtilities.createErrorLogFile(e);\n\t\t}\n\t\treturn formattedDate;\n\n\t}","public static String toStringFormat_1(Date date) {\r\n\r\n\t\treturn dateToString(date, DATE_FORMAT_1);\r\n\t}","private String formatDate(String date)\n\t{\n\t\tif(date == null || date.isEmpty())\n\t\t{\n\t\t\treturn \"\";\n\t\t}\n\t\telse\n\t\t{\n\t\t\tString[] dateSplit = date.split(\"/\");\n\t\t\tif(dateSplit.length != 3)\n\t\t\t{\n\t\t\t\treturn \"\";\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn getMonthName(dateSplit[0]) + \" \"+ dateSplit[1]+\", \"+ dateSplit[2];\n\t\t\t}\n\t\t}\n\t}","public static String formatDate(java.util.Date uDate) {\n\t\tif (uDate == null) {\n\t\t\treturn null;\n\t\t} else {\n\t\t\tSimpleDateFormat dateFormat = new SimpleDateFormat(\"dd/MM/yyyy\");\n\t\t\treturn dateFormat.format(uDate);\n\t\t}\n\t}","public Date formatForDate(String data) throws ParseException{\n //definindo a forma da Data Recebida\n DateFormat formatUS = new SimpleDateFormat(\"dd-MM-yyyy\");\n return formatUS.parse(data);\n }","public static String formatFechaMascara(String fecha, String formatoFecha) {\n SimpleDateFormat sdf = new SimpleDateFormat(formatoFecha);\n String response = \"\";\n // format BD\n SimpleDateFormat sdfBD = new SimpleDateFormat(\"yyyy-MM-dd\");\n Date fechaParse = null;\n try {\n\n fechaParse = sdfBD.parse(fecha.substring(0, 10));\n\n } catch (java.text.ParseException e) {\n try {\n fechaParse = sdf.parse(fecha);\n } catch (java.text.ParseException e1) {\n // TODO Auto-generated catch block\n e1.printStackTrace();\n }\n }\n\n if (fechaParse == null) return \"\";\n\n response = sdf.format(fechaParse);\n return response;\n }","public static String formatDate(Date time) {\n\t\tSimpleDateFormat df = new SimpleDateFormat(PreferenceProperties.JMS_DATE_FORMAT);\n\t\treturn df.format(time);\n\t}","public String formatDateAndTime(String date){\n\n return dateTimeFormatter.parse(date).toString();\n\n }","public static String getFormatString(Date date, DateFormat dateFormat)\n\t{\n\t\treturn dateFormat.format(date);\n\t}","public static final String DateFormat(final Object object, final String format) {\n\t\t\n\t\tlong date;\n\t\ttry {\n\t\t\tif (object == null) {\n\t\t\t\tdate = 0;\n\t\t\t} else if (object instanceof Date) {\n\t\t\t\tdate = ((Date) object).getTime();\n\t\t\t} else {\n\t\t\t\tdate = Convert.Any.toLong(object, 0L);\n\t\t\t}\n\t\t} catch (final Throwable e) {\n\t\t\tdate = Convert.Any.toLong(object, 0L);\n\t\t}\n\t\tfinal SimpleDateFormat formatter = new SimpleDateFormat(format);\n\t\treturn formatter.format(new Date(date));\n\t}","protected static SimpleDateFormat dateFormat() {\n return dateFormat(true, false);\n }","public static String formatDateTime(String date) {\n\t\tif(date == null) return \"\";\n\t\tdate = date.trim();\n\t\tif(date.equals(\" \")) return \"\";\n\t\tif (date.length() == 0 || date.length() != 14) return date;\n\t\tdate = date.substring(0,4) + \"/\" + date.substring(4,6) \n\t\t\t\t+ \"/\" + date.substring(6,8)\n\t\t\t\t+\" \"+date.substring(8,10)\n\t\t\t\t+\":\"+date.substring(10,12)\n\t\t\t\t+\":\"+date.substring(12,14);\n\t\treturn date;\n\t}","public String DateFormatted(){\n\t\tSimpleDateFormat simDate = new SimpleDateFormat(\"E, dd/MM/yy hh:mm:ss a\");\n\t\treturn simDate.format(date.getTime());\n\t}","private LocalDate parse(String format) {\r\n\t\tString lista[] = format.split(\"/\"); // DD - MM - YYYY\r\n\t\tint dia = Integer.parseInt(lista[0]);\r\n\t\tint mes = Integer.parseInt(lista[1]);\r\n\t\tint ano = Integer.parseInt(lista[2]);\r\n\t\tLocalDate date = LocalDate.of(ano, mes, dia);\r\n\t\treturn date;\r\n\t}","public static String formatDateForName(Date date, String userId)\n\t{\n\t\tDateFormat format = new SimpleDateFormat(\"MMM dd, yyyy hh:mm a\", getPreferredLocale(userId));\n\t\tformat.setTimeZone(getPreferredTimeZone(userId));\n\n\t\tString rv = format.format(date);\n\t\treturn rv;\n\t}","@NotNull\n public static String dateToString(Date date, String pattern, Locale locale) {\n DateFormat format = new SimpleDateFormat(pattern, locale);\n return format.format(date);\n }","public static String getStringFromDate(Date date, String format) {\n if(date == null || format == null || format.isEmpty()) return \"\";\n\n String str = \"\";\n\n try {\n DateFormat dateFormat = new SimpleDateFormat(format);\n str = dateFormat.format(date);\n }\n catch (Exception e) {e.printStackTrace();}\n\n return str;\n }","public static String format(String $formatString, long $timeValue /*= 0*/) {\n return (new SimpleDateFormat($formatString)).format($timeValue == 0 ? new Date() : new Date($timeValue));\n }","public static String dateToStringFormat(Calendar calendar, String format){\n SimpleDateFormat simpleDateFormat = new SimpleDateFormat(format);\n return simpleDateFormat.format(calendar.getTime());\n }","private static String formatDate(long date) {\n Date systemDate = new java.util.Date(date * 1000L);\n // the format of your date\n SimpleDateFormat sdf = new java.text.SimpleDateFormat(\"yyyy-MM-dd HH:mm:ss\");\n // give a timezone reference for formatting (see comment at the bottom)\n sdf.setTimeZone(java.util.TimeZone.getTimeZone(\"GMT-4\"));\n String formattedDate = sdf.format(systemDate);\n return formattedDate;\n }","protected String date(String format, double time) {\n\t\treturn new java.util.Date((long)(time*1000)).toString();\n\t}","public void formatDateTime() {\n // Check if type of parsing is for display or not. \n // If it is for display, no need to check if date has already passed.\n if (parseType != 2) {\n startDate = dtFormat.formatDate(startDate,0);\n endDate = dtFormat.formatDate(endDate,0);\n } else {\n startDate = dtFormat.formatDate(startDate,1);\n endDate = dtFormat.formatDate(endDate,1);\n }\n \n startTime = dtFormat.formatTime(startTime);\n endTime = dtFormat.formatTime(endTime);\n }","public static String DateToString(Date fecha, String formato){\n if (nullToBlank(fecha).equals(\"\")) {\n return \"\";\n }\n SimpleDateFormat df = new SimpleDateFormat(formato);\n return df.format(fecha);\n }","@Override // override for Javadoc and performance\n public String format(DateTimeFormatter formatter) {\n Objects.requireNonNull(formatter, \"formatter\");\n return formatter.format(this);\n }","public void setDateFormats(String dateFormats)\n {\n this.dateFormats = dateFormats;\n }","public static String toStringFormat_2(Date date) {\r\n\r\n\t\treturn dateToString(date, DATE_FORMAT_2);\r\n\t}","public static String getStringFromDate(Date date, String format)\n {\n SimpleDateFormat formatter = new SimpleDateFormat(format);\n return formatter.format(date);\n }","private String changeDateFormat (String oldDate) throws ParseException {\n // Source: https://stackoverflow.com/questions/3469507/how-can-i-change-the-date-format-in-java\n final String OLD_FORMAT = \"MM/dd/yyyy\";\n final String NEW_FORMAT = \"yyyyMMdd\";\n String newDateString;\n SimpleDateFormat sdf = new SimpleDateFormat(OLD_FORMAT);\n Date d = sdf.parse(oldDate);\n sdf.applyPattern(NEW_FORMAT);\n newDateString = sdf.format(d);\n return newDateString;\n }","public Date parseDate(String date, String format) {\n return this.convertStringToDate(date, format);\n }","public static boolean isDate(InputField f, String format) {\r\n\t\tString d = f.getValue().replace(\"-\", \"\").replace(\"/\", \"\");\r\n\t\ttry {\r\n\t\t\tnew SimpleDateFormat(format).parse(d);\r\n\t\t\treturn true;\r\n\t\t}\r\n\t\tcatch(Exception e) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}","public static String FormatDate(int day, int month, int year) {\r\n String jour = Integer.toString(day);\r\n String mois = Integer.toString(month + 1);\r\n if (jour.length() == 1) {\r\n jour = \"0\" + jour;\r\n }\r\n\r\n if (mois.length() == 1) {\r\n mois = \"0\" + mois;\r\n }\r\n return jour + \"/\" + mois + \"/\" + Integer.toString(year);\r\n }","public static String formatDate(Date date){\n\t\tCalendar now = Calendar.getInstance(); // Gets the current date and time\n\t\tint currentYear = now.get(Calendar.YEAR);\n\t\tint dateYear = Integer.parseInt(new SimpleDateFormat(\"yyyy\").format(date));\n\n\t\tif (dateYear <= currentYear){\n\t\t\treturn new SimpleDateFormat(\"E MMM dd HH:mm\").format(date);\n\t\t} else {\n\t\t\treturn new SimpleDateFormat(\"E yyyy MMM dd HH:mm\").format(date);\n\t\t}\n\t}","public static String formatDateU(java.sql.Date date){\n\t\treturn date!=null?toTheString(date):\"unknown\";\n\t}"],"string":"[\n \"public String format (Date date , String dateFormat) ;\",\n \"public Date formatDate( String date, String format )\\n throws ParseException {\\n SimpleDateFormat dateFormat = new SimpleDateFormat(format);\\n dateFormat.setLenient(false);\\n return dateFormat.parse(date);\\n }\",\n \"public static String formatDate(Calendar date, DateFormat format) {\\n\\n switch (format) {\\n case COMPLETE_DATE_FORMAT:\\n format = DateFormat.COMPLETE_DATE_FORMAT;\\n break;\\n case DAY_FORMAT:\\n format = DateFormat.DAY_FORMAT;\\n break;\\n }\\n\\n SimpleDateFormat dateFormatter = new SimpleDateFormat(format.getFormat(), Locale.US);\\n\\n return dateFormatter.format(date.getTime());\\n }\",\n \"public static String formatDate(Date date, String format)\\n\\t{\\n\\t\\tDateFormat dateFormat = new SimpleDateFormat(format);\\n\\t\\treturn dateFormat.format(date);\\n\\t}\",\n \"public static String formatDateToString(Date dateObj, String format) {\\n SimpleDateFormat formatter = new SimpleDateFormat(format);\\n return formatter.format(dateObj);\\n }\",\n \"public static synchronized String formatDate(Date d) {\\n return dateFormat.format(d);\\n }\",\n \"public static String dateToStringFormat(Date date, String format){\\n return new SimpleDateFormat(format).format(date);\\n }\",\n \"@Method(selector = \\\"stringFromDate:toDate:\\\")\\n public native String format(NSDate fromDate, NSDate toDate);\",\n \"private String easyDateFormat(final String format) {\\n Date today = new Date();\\n SimpleDateFormat formatter = new SimpleDateFormat(format);\\n String datenewformat = formatter.format(today);\\n return datenewformat;\\n }\",\n \"@Override\\n public StringBuffer format(Date date, StringBuffer toAppendTo, FieldPosition fieldPosition) {\\n String value = ISO8601Utils.format(date, true);\\n toAppendTo.append(value);\\n return toAppendTo;\\n }\",\n \"public static String formatDate(String format, long timestamp) {\\n return DateFormat.format(format, new Date(timestamp)).toString();\\n }\",\n \"public static String getFormattedDateString(Date date, String format) {\\n Calendar cal = Calendar.getInstance();\\n TimeZone timeZone = cal.getTimeZone();\\n\\n SimpleDateFormat dateFormat = new SimpleDateFormat(format);\\n dateFormat.setTimeZone(timeZone);\\n\\n return dateFormat.format(date);\\n }\",\n \"public String formatDate(Date date) {\\n String result = \\\"\\\";\\n if (date != null) {\\n result = DateUtility.simpleFormat(date, MEDIUM_DATE_FORMAT);\\n }\\n return result;\\n }\",\n \"public static String formatDate(Date valor, String formato) {\\r\\n\\t\\tSimpleDateFormat sdf = new SimpleDateFormat(formato);\\r\\n\\t\\treturn sdf.format(valor);\\r\\n\\t}\",\n \"public String dateFormatter(String fromDate) {\\n\\t\\tString newDateString=\\\"\\\";\\n\\t\\ttry {\\n\\t\\t\\tfinal String oldFormat = \\\"yyyy/MM/dd\\\";\\n\\t\\t\\tfinal String newFormat = \\\"yyyy-MM-dd\\\";\\n\\t\\t\\tSimpleDateFormat sdf = new SimpleDateFormat(oldFormat);\\n\\t\\t\\tDate d = sdf.parse(fromDate);\\n\\t\\t\\tsdf.applyPattern(newFormat);\\n\\t\\t\\tnewDateString = sdf.format(d);\\n\\t\\t} catch(Exception exp) {\\n\\t\\t\\tthrow ExceptionUtil.getYFSException(ExceptionLiterals.ERRORCODE_INVALID_DATE, exp);\\n\\t\\t}\\n\\t\\treturn newDateString;\\n\\t}\",\n \"private String formatDate(Date date) {\\n String resultDate;\\n SimpleDateFormat dateFormat;\\n dateFormat = new SimpleDateFormat(\\\"dd/MM/yyyy\\\");\\n resultDate = dateFormat.format(date);\\n return resultDate;\\n }\",\n \"public static String formatDate(java.util.Date value, String pattern) {\\r\\n\\t\\tif (value != null) {\\r\\n\\t\\t\\t// Cria Locale informando Portugues Brasil\\r\\n\\t\\t\\tLocale locale = new Locale(\\\"pt\\\", \\\"BR\\\");\\r\\n\\t\\t\\t// Cria Formatador de data informando padr�o\\r\\n\\t\\t\\tSimpleDateFormat dateFormat = new SimpleDateFormat(pattern, locale);\\r\\n\\t\\t\\t// Passa o resultado final obtido para uma String\\r\\n\\t\\t\\tString retorno = dateFormat.format(value);\\r\\n\\t\\t\\t// Trata a String para que a primeira letra seja maiuscula (caso esteja no padr�o MMM/yyyy\\r\\n\\t\\t\\tif ((retorno != null) && (retorno.length() > 0)) {\\r\\n\\t\\t\\t\\tretorno = (retorno.charAt(0) + \\\"\\\").toUpperCase() + retorno.substring(1);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\treturn retorno;\\r\\n\\t\\t} else {\\r\\n\\t\\t\\treturn \\\"\\\";\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public static String date_d(String sourceDate,String format) throws ParseException {\\n SimpleDateFormat sdf_ = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\n SimpleDateFormat sdfNew_ = new SimpleDateFormat(format);\\n return sdfNew_.format(sdf_.parse(sourceDate));\\n }\",\n \"@org.jetbrains.annotations.NotNull()\\n public static final java.lang.String getFormattedDate(@org.jetbrains.annotations.NotNull()\\n java.util.Calendar $this$getFormattedDate, @org.jetbrains.annotations.NotNull()\\n java.lang.String format) {\\n return null;\\n }\",\n \"public String formatDate (Date date){\\r\\n\\t\\tDateFormat df = new SimpleDateFormat(\\\"EEE, d MMM yyyy HH:mm:ss z\\\", Locale.ENGLISH);\\r\\n\\t\\treturn df.format(date);\\r\\n\\t}\",\n \"public static String getFormattedDate(String dateStr, String toformat)\\r\\n\\t{\\r\\n\\t\\tString mName = \\\"getFormattedDate()\\\";\\r\\n\\t\\tIDateFormatter dateFormatter = null;\\r\\n\\t\\tDateFormatConfig dateFormat = null;\\r\\n\\t\\tString formattedDate = null;\\r\\n\\t\\tdateFormat = getDateFormat(toformat);\\r\\n\\t\\ttry\\r\\n\\t\\t{\\r\\n\\t\\t\\tdateFormatter = (IDateFormatter) ResourceLoaderUtils.createInstance(dateFormat.getFormatterClass(),\\r\\n\\t\\t\\t\\t\\t(Object[]) null);\\r\\n\\t\\t\\tformattedDate = dateFormatter.formatDate(dateStr, dateFormat.getJavaDateFormat());\\r\\n\\t\\t} catch (Exception exp)\\r\\n\\t\\t{\\r\\n\\t\\t\\tlogger.cterror(\\\"CTBAS00112\\\", exp, mName);\\r\\n\\r\\n\\t\\t}\\r\\n\\t\\treturn formattedDate;\\r\\n\\t}\",\n \"private static void formatDate (XmlDoc.Element date) throws Throwable {\\n\\t\\tString in = date.value();\\n\\t\\tString out = DateUtil.convertDateString(in, \\\"dd-MMM-yyyy\\\", \\\"yyyy-MM-dd\\\");\\n\\t\\tdate.setValue(out);\\n\\t}\",\n \"public static String formatSdf(Date data, String format) {\\n if (data == null) {\\n return null;\\n }\\n return new SimpleDateFormat(format).format(data);\\n }\",\n \"public static String formatDate(Date date) {\\n\\t\\tString newstring = new SimpleDateFormat(\\\"MM-dd-yyyy\\\").format(date);\\n\\t\\treturn newstring;\\n\\t}\",\n \"private String formatDate (Date date) {\\n SimpleDateFormat sdf = new SimpleDateFormat(\\\"E, dd MMM yyyy HH:mm:ss\\\", Locale.ENGLISH);\\n return sdf.format(date);\\n }\",\n \"public String formatDate(Date date) {\\n\\t\\tString formattedDate;\\n\\t\\tif (date != null) {\\n\\t\\t\\tformattedDate = simpleDateFormat.format(date);\\n\\t\\t\\tformattedDate = formattedDate.substring(0,\\n\\t\\t\\t\\t\\tformattedDate.length() - 5);\\n\\t\\t} else {\\n\\t\\t\\tformattedDate = Constants.EMPTY_STRING;\\n\\t\\t}\\n\\t\\treturn formattedDate;\\n\\t}\",\n \"public static String formatDateToString(Date d, String formatoData) {\\n\\t\\tfinal String OLD_FORMAT = \\\"yyyy-MM-dd\\\";\\r\\n\\r\\n\\t\\tString newDateString;\\r\\n\\r\\n\\t\\tSimpleDateFormat sdf = new SimpleDateFormat(OLD_FORMAT);\\r\\n\\t\\tsdf.applyPattern(formatoData);\\r\\n\\t\\tnewDateString = sdf.format(d);\\r\\n\\t\\t\\r\\n\\t\\treturn newDateString;\\r\\n\\t}\",\n \"public static String formatterDate(Date date){\\n\\t\\tString retour = null;\\n\\t\\tif(date != null){\\n\\t\\t\\tretour = dfr.format(date);\\n\\t\\t}\\n\\t\\treturn retour;\\n\\t}\",\n \"public static Date changeDateFormat(String date, String format){\\n SimpleDateFormat sdf = new SimpleDateFormat(format);\\n try {\\n return sdf.parse(date);\\n } catch (ParseException e) {\\n e.printStackTrace();\\n return null;\\n }\\n }\",\n \"public java.sql.Date format(String date) {\\n int i = 0;\\n int dateAttr[];\\n dateAttr = new int[3];\\n for(String v : date.split(\\\"/\\\")) {\\n dateAttr[i] = Integer.parseInt(v);\\n i++;\\n }\\n\\n GregorianCalendar gcalendar = new GregorianCalendar();\\n gcalendar.set(dateAttr[2], dateAttr[0]-1, dateAttr[1]); // Year,Month,Day Of Month\\n java.sql.Date sdate = new java.sql.Date(gcalendar.getTimeInMillis());\\n return sdate;\\n }\",\n \"public static String formatDate(Date date) {\\n final SimpleDateFormat formatter = new SimpleDateFormat(\\\"MM-dd-yyyy\\\");\\n return formatter.format(date);\\n }\",\n \"private String formatDate(final Date date) {\\r\\n\\t\\tfinal Calendar calendar = Calendar.getInstance();\\r\\n\\t\\tcalendar.setTime(date);\\r\\n\\r\\n\\t\\tfinal String dayOfMonth = formatDayOfMonth(calendar);\\r\\n\\t\\tfinal String month = formatMonth(calendar);\\r\\n\\t\\tfinal String year = String.valueOf(calendar.get(Calendar.YEAR));\\r\\n\\r\\n\\t\\treturn String.format(\\\"%s/%s/%s\\\", year, month, dayOfMonth);\\r\\n\\t}\",\n \"public static String formatDate(Date date, String userId)\\n\\t{\\n\\t\\tDateFormat format = new SimpleDateFormat(\\\"MMM dd, yyyy hh:mm a\\\", getPreferredLocale(userId));\\n\\t\\tformat.setTimeZone(getPreferredTimeZone(userId));\\n\\t\\tString rv = format.format(date);\\n\\t\\treturn rv;\\n\\t}\",\n \"private String formatDate(Date date){\\n SimpleDateFormat format = new SimpleDateFormat(\\\"dd-MM-yyyy HH:mm\\\", Locale.getDefault());\\n\\n return format.format(date);\\n }\",\n \"public static String format(LocalDate date){\\r\\n\\t\\t\\r\\n\\t\\tif(date==null){\\r\\n\\t\\t\\treturn null;\\r\\n\\t\\t}\\r\\n\\t\\treturn DATE_FORMATTER.format(date);\\r\\n\\t}\",\n \"private String getFormattedDate(String date) {\\n SimpleDateFormat dateFormat = new SimpleDateFormat(getString(R.string.received_import_date_format));\\n SimpleDateFormat desiredDateFormat = new SimpleDateFormat(getString(R.string.desired_import_date_format));\\n Date parsedDate;\\n try {\\n parsedDate = dateFormat.parse(date);\\n return desiredDateFormat.format(parsedDate);\\n } catch (ParseException e) {\\n // Return an empty string in case of issues parsing the date string received.\\n e.printStackTrace();\\n return \\\"\\\";\\n }\\n }\",\n \"private String formatDate(String dateStr) {\\n try {\\n SimpleDateFormat fmt = new SimpleDateFormat(Properties.DATE_FORMAT_ALL);\\n Date date = fmt.parse(dateStr);\\n SimpleDateFormat fmtOut = new SimpleDateFormat(Properties.DATE_FORMAT);\\n return fmtOut.format(date);\\n } catch (ParseException e) {\\n System.out.println( Properties.K_WARNING + \\\" \\\" + e.getMessage());\\n }\\n return \\\"\\\";\\n }\",\n \"public static String formatDateOnly(Date date, String userId)\\n\\t{\\t\\t\\n\\t\\tDateFormat dateFormat = new SimpleDateFormat(\\\"MMM dd, yyyy\\\", getPreferredLocale(userId));\\n\\t\\tdateFormat.setTimeZone(getPreferredTimeZone(userId));\\n\\t\\tString rv = dateFormat.format(date);\\n\\t\\treturn rv;\\n\\t}\",\n \"public String convertDateToString(Date date, String format) {\\n DateFormat dateFormat = new SimpleDateFormat(format);\\n String dateAsString = dateFormat.format(date);\\n return dateAsString;\\n }\",\n \"public static String convertDateFormat (String dateStr, String fromFormatPattern, String toFormatPattern) {\\n\\t\\tDateFormat fromFormat = new SimpleDateFormat(fromFormatPattern);\\n\\t\\tDateFormat toFormat = new SimpleDateFormat(toFormatPattern);\\n\\t\\ttoFormat.setLenient(false);\\n\\t\\tDate date;\\n\\t\\ttry {\\n\\t\\t\\tdate = fromFormat.parse(dateStr);\\n\\t\\t\\treturn toFormat.format(date);\\n\\t\\t} catch (ParseException e) {\\n\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\tLog.d(\\\"ERROR\\\", \\\"Date formatting Error\\\");\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"public static String formatDate(String dateValue) {\\n Date uploadDateTime = null;\\n try {\\n uploadDateTime = new SimpleDateFormat(\\\"yyyy-MM-dd HH:mm:ss\\\", Locale.US).parse(dateValue);\\n } catch (ParseException e) {\\n e.printStackTrace();\\n }\\n return new SimpleDateFormat(\\\"dd/MM/yyyy HH:mm\\\", Locale.US).format(uploadDateTime);\\n }\",\n \"private String formatDate(Date dateObject) {\\r\\n SimpleDateFormat dateFormat = new SimpleDateFormat(\\\"LLL dd, yyyy\\\");\\r\\n return dateFormat.format(dateObject);\\r\\n }\",\n \"private String formatDate(Date dateObject) {\\n SimpleDateFormat dateFormat = new SimpleDateFormat(\\\"LLL dd, yyyy\\\");\\n return dateFormat.format(dateObject);\\n }\",\n \"public void setDateFormat(String format) {\\n this.mDateFormat = format;\\n }\",\n \"private String formatDate(Date dateObject) {\\n SimpleDateFormat dateFormat = new SimpleDateFormat(\\\"LLL dd, yyyy\\\", Locale.getDefault());\\n return dateFormat.format(dateObject);\\n }\",\n \"public static String format(Date d, DateFormat formatter, int gmt) {\\n return formatter.format(DateUtil.transform(d, gmt));\\n }\",\n \"public static String formatDate(String date){\\n String formatedDate = date;\\n if (!date.matches(\\\"[0-9]{2}-[0-9]{2}-[0-9]{4}\\\")){\\n if (date.matches(\\\"[0-9]{1,2}/[0-9]{1,2}/([0-9]{2}|[0-9]{4})\\\"))\\n formatedDate = date.replace('/', '-');\\n if (date.matches(\\\"[0-9]{1,2}.[0-9]{1,2}.([0-9]{2}|[0-9]{4})\\\")){\\n if (formatedDate.matches(\\\"[0-9]{1}.[0-9]{1,2}.([0-9]{2}|[0-9]{4})\\\"))\\n formatedDate = \\\"0\\\" + formatedDate;\\n if (formatedDate.matches(\\\"[0-9]{2}.[0-9]{1}.([0-9]{2}|[0-9]{4})\\\"))\\n formatedDate = formatedDate.substring(0, 3) + \\\"0\\\" + \\n formatedDate.substring(3);\\n if (formatedDate.matches(\\\"[0-9]{2}.[0-9]{2}.[0-9]{2}\\\")){\\n String thisYear = String.valueOf(LocalDate.now().getYear());\\n String century = thisYear.substring(0,2);\\n /* If the last two digits of the date are larger than the two last digits of \\n * the current date, then we can suppose that the year corresponds to the last \\n * century.\\n */ \\n if (Integer.valueOf(formatedDate.substring(6)) > Integer.valueOf(thisYear.substring(2)))\\n century = String.valueOf(Integer.valueOf(century) - 1);\\n formatedDate = formatedDate.substring(0, 6) + century +\\n formatedDate.substring(6); \\n }\\n }\\n }\\n return formatedDate;\\n }\",\n \"public static String formatDate(Date d) {\\n\\t\\tint month = d.getMonth() + 1;\\n\\t\\tint dayOfMonth = d.getDate();\\n\\t\\tint year = d.getYear() + 1900;\\n\\t\\tString y = \\\"\\\" + year;\\n\\t\\tString m = \\\"\\\" + month;\\n\\t\\tString dom = \\\"\\\" + dayOfMonth;\\n\\t\\tif (month < 10) {\\n\\t\\t\\tm = \\\"0\\\" + m;\\n\\t\\t}\\n\\t\\tif (dayOfMonth < 10) {\\n\\t\\t\\tdom = \\\"0\\\" + dom;\\n\\t\\t}\\n\\t\\treturn m + \\\"/\\\" + dom + \\\"/\\\" + y.substring(2);\\n\\t}\",\n \"public static String formatDate(String strDate) {\\n return formatDate(strDate, false);\\n }\",\n \"public static String convertDateFormat(Date sourceDate, SimpleDateFormat dateForm) {\\n return dateForm.format(sourceDate);\\n }\",\n \"public static String formatDate(final Date data, final String sFormat, final Locale locale) {\\n final SimpleDateFormat simple = new SimpleDateFormat(sFormat, locale == null ? getLocale(CalendarParams.LOCALE_PT) : locale);\\n String dateRetorno;\\n if (data == null) {\\n final GregorianCalendar cal = new GregorianCalendar();\\n dateRetorno = simple.format(cal.getTime());\\n } else {\\n dateRetorno = simple.format(data);\\n }\\n\\n return dateRetorno;\\n }\",\n \"public Date formatDate( String dob )\\n throws ParseException {\\n SimpleDateFormat dateFormat = new SimpleDateFormat(\\\"MM/dd/yyyy\\\");\\n dateFormat.setLenient(false);\\n return dateFormat.parse(dob);\\n }\",\n \"public static String dateToString(Date date, String format) {\\n\\t\\n\\t\\tString result = \\\"\\\";\\n\\t\\tSimpleDateFormat dateFormat = new SimpleDateFormat(format);\\n\\n\\t\\tif (date != null) {\\n\\t\\t\\tresult = dateFormat.format(date);\\n\\t\\t}\\n\\t\\n\\t\\treturn result;\\n\\t}\",\n \"public static String formatDate(java.sql.Date date){\\n\\t\\treturn date!=null?toTheString(date):\\\"\\\";\\n\\t}\",\n \"public static String formatDate(Date date) {\\n\\t\\tDateFormat dateFormat = DateFormat.getDateTimeInstance(DateFormat.SHORT, DateFormat.MEDIUM);\\n\\n\\t\\tif (dateFormat instanceof SimpleDateFormat) {\\n\\t\\t\\tSimpleDateFormat sdf = (SimpleDateFormat) dateFormat;\\n\\t\\t\\t// we want short date format but with 4 digit year\\n\\t\\t\\tsdf.applyPattern(sdf.toPattern().replaceAll(\\\"y+\\\", \\\"yyyy\\\").concat(\\\" z\\\"));\\n\\t\\t}\\n\\n\\t\\treturn dateFormat.format(date);\\n\\t}\",\n \"private String getFormattedDate(Integer format) {\\n Date date = new Date(format * 1000L);\\n DateFormat dateFormat = new SimpleDateFormat(\\\"yyyy-MM-dd HH:mm:ss.SSS\\\");\\n dateFormat.setTimeZone(TimeZone.getTimeZone(\\\"Etc/UTC\\\"));\\n Log.e(\\\"time\\\",dateFormat.format(date));\\n return dateFormat.format(date);\\n }\",\n \"public static String formatDateForQuery(java.util.Date date){\\n return (new SimpleDateFormat(\\\"yyyy-MM-dd\\\")).format(date);\\n }\",\n \"public DateTextFieldConfig withFormat(final String value) {\\n put(Key.Format, Dates.toJavaScriptDateFormat(value));\\n return this;\\n }\",\n \"public void mostrarHora(String formato){\\n Date objDate = new Date();\\n SimpleDateFormat objSDF = new SimpleDateFormat(formato);\\n //este sera el resultado de la fechas\\n fecha=objSDF.format(objDate);\\n }\",\n \"private String formatDate(String dateString) {\\n DateTimeFormatter dateTimeFormatter = DateTimeFormatter.ofPattern(\\\"LLL dd, yyyy\\\");\\n LocalDate localDate = LocalDate.parse(dateString.substring(0, 10));\\n return dateTimeFormatter.format(localDate);\\n }\",\n \"public static String formatDate(Date date) {\\n return DateFormat.getDateFormat(BaracusApplicationContext.getContext()).format(date);\\n }\",\n \"public void setDateFormat(String format) {\\n dateFormat = format;\\n constructVssDateTimeFormat();\\n }\",\n \"public static String formatDate(Date source, String pattern) throws Exception {\\n\\tif (null != source) {\\n\\t DateFormat format = new SimpleDateFormat(pattern);\\n\\t return format.format(source);\\n\\t}\\n\\treturn null;\\n }\",\n \"public static String formatterDateUS(Date date){\\n\\t\\tString retour = null;\\n\\t\\tif(date != null){\\n\\t\\t\\tretour = df.format(date);\\n\\t\\t}\\n\\t\\treturn retour;\\n\\t}\",\n \"@SuppressLint(\\\"SimpleDateFormat\\\") public static String parse(String date, String format){\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tSimpleDateFormat localFormatter= new SimpleDateFormat(format);\\r\\n\\t\\t\\tlocalFormatter.setLenient(false);\\r\\n\\t\\t\\tString formattedDate=localFormatter.parse(date).toString();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//days, months, years\\r\\n\\t\\t\\tif(format.equals(formats[0])) return convertDate(formattedDate);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//hours, minutes, seconds\\r\\n\\t\\t\\telse if(format.equals(formats[1])) return convertHoursMinsSecs(formattedDate);\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//hours, minutes\\r\\n\\t\\t\\telse if(format.equals(formats[2])) return convertHoursMins(formattedDate);\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\treturn \\\"\\\";\\r\\n\\t\\t\\r\\n\\t\\t} catch (ParseException e) {\\r\\n\\t\\t\\t//e.printStackTrace();\\r\\n\\t\\t\\treturn \\\"\\\";\\r\\n\\t\\t}\\r\\n\\t}\",\n \"private static void formatDate(Date i) {\\n\\t\\tSimpleDateFormat formatter = new SimpleDateFormat(\\\"MM/dd/yy\\\");\\n\\t\\tformatter.setLenient(false);\\n\\t\\tAnswer = formatter.format(i);\\n\\t}\",\n \"String formatDateCondition(Date date);\",\n \"private static Date getFormattedDate(String date){\\n\\t\\tString dateStr = null;\\n\\t\\tif(date.length()<11){\\n\\t\\t\\tdateStr = date+\\\" 00:00:00.0\\\";\\n\\t\\t}else{\\n\\t\\t\\tdateStr = date;\\n\\t\\t}\\n\\t\\tDate formattedDate = null;\\n\\t\\ttry {\\n\\t\\t\\tformattedDate = new SimpleDateFormat(\\\"yyyy-MM-dd HH:mm:ss.S\\\").parse(dateStr);\\n\\t\\t} catch (ParseException e) {\\n\\t\\t\\tCommonUtilities.createErrorLogFile(e);\\n\\t\\t}\\n\\t\\treturn formattedDate;\\n\\n\\t}\",\n \"public static String toStringFormat_1(Date date) {\\r\\n\\r\\n\\t\\treturn dateToString(date, DATE_FORMAT_1);\\r\\n\\t}\",\n \"private String formatDate(String date)\\n\\t{\\n\\t\\tif(date == null || date.isEmpty())\\n\\t\\t{\\n\\t\\t\\treturn \\\"\\\";\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tString[] dateSplit = date.split(\\\"/\\\");\\n\\t\\t\\tif(dateSplit.length != 3)\\n\\t\\t\\t{\\n\\t\\t\\t\\treturn \\\"\\\";\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\treturn getMonthName(dateSplit[0]) + \\\" \\\"+ dateSplit[1]+\\\", \\\"+ dateSplit[2];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public static String formatDate(java.util.Date uDate) {\\n\\t\\tif (uDate == null) {\\n\\t\\t\\treturn null;\\n\\t\\t} else {\\n\\t\\t\\tSimpleDateFormat dateFormat = new SimpleDateFormat(\\\"dd/MM/yyyy\\\");\\n\\t\\t\\treturn dateFormat.format(uDate);\\n\\t\\t}\\n\\t}\",\n \"public Date formatForDate(String data) throws ParseException{\\n //definindo a forma da Data Recebida\\n DateFormat formatUS = new SimpleDateFormat(\\\"dd-MM-yyyy\\\");\\n return formatUS.parse(data);\\n }\",\n \"public static String formatFechaMascara(String fecha, String formatoFecha) {\\n SimpleDateFormat sdf = new SimpleDateFormat(formatoFecha);\\n String response = \\\"\\\";\\n // format BD\\n SimpleDateFormat sdfBD = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\n Date fechaParse = null;\\n try {\\n\\n fechaParse = sdfBD.parse(fecha.substring(0, 10));\\n\\n } catch (java.text.ParseException e) {\\n try {\\n fechaParse = sdf.parse(fecha);\\n } catch (java.text.ParseException e1) {\\n // TODO Auto-generated catch block\\n e1.printStackTrace();\\n }\\n }\\n\\n if (fechaParse == null) return \\\"\\\";\\n\\n response = sdf.format(fechaParse);\\n return response;\\n }\",\n \"public static String formatDate(Date time) {\\n\\t\\tSimpleDateFormat df = new SimpleDateFormat(PreferenceProperties.JMS_DATE_FORMAT);\\n\\t\\treturn df.format(time);\\n\\t}\",\n \"public String formatDateAndTime(String date){\\n\\n return dateTimeFormatter.parse(date).toString();\\n\\n }\",\n \"public static String getFormatString(Date date, DateFormat dateFormat)\\n\\t{\\n\\t\\treturn dateFormat.format(date);\\n\\t}\",\n \"public static final String DateFormat(final Object object, final String format) {\\n\\t\\t\\n\\t\\tlong date;\\n\\t\\ttry {\\n\\t\\t\\tif (object == null) {\\n\\t\\t\\t\\tdate = 0;\\n\\t\\t\\t} else if (object instanceof Date) {\\n\\t\\t\\t\\tdate = ((Date) object).getTime();\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tdate = Convert.Any.toLong(object, 0L);\\n\\t\\t\\t}\\n\\t\\t} catch (final Throwable e) {\\n\\t\\t\\tdate = Convert.Any.toLong(object, 0L);\\n\\t\\t}\\n\\t\\tfinal SimpleDateFormat formatter = new SimpleDateFormat(format);\\n\\t\\treturn formatter.format(new Date(date));\\n\\t}\",\n \"protected static SimpleDateFormat dateFormat() {\\n return dateFormat(true, false);\\n }\",\n \"public static String formatDateTime(String date) {\\n\\t\\tif(date == null) return \\\"\\\";\\n\\t\\tdate = date.trim();\\n\\t\\tif(date.equals(\\\" \\\")) return \\\"\\\";\\n\\t\\tif (date.length() == 0 || date.length() != 14) return date;\\n\\t\\tdate = date.substring(0,4) + \\\"/\\\" + date.substring(4,6) \\n\\t\\t\\t\\t+ \\\"/\\\" + date.substring(6,8)\\n\\t\\t\\t\\t+\\\" \\\"+date.substring(8,10)\\n\\t\\t\\t\\t+\\\":\\\"+date.substring(10,12)\\n\\t\\t\\t\\t+\\\":\\\"+date.substring(12,14);\\n\\t\\treturn date;\\n\\t}\",\n \"public String DateFormatted(){\\n\\t\\tSimpleDateFormat simDate = new SimpleDateFormat(\\\"E, dd/MM/yy hh:mm:ss a\\\");\\n\\t\\treturn simDate.format(date.getTime());\\n\\t}\",\n \"private LocalDate parse(String format) {\\r\\n\\t\\tString lista[] = format.split(\\\"/\\\"); // DD - MM - YYYY\\r\\n\\t\\tint dia = Integer.parseInt(lista[0]);\\r\\n\\t\\tint mes = Integer.parseInt(lista[1]);\\r\\n\\t\\tint ano = Integer.parseInt(lista[2]);\\r\\n\\t\\tLocalDate date = LocalDate.of(ano, mes, dia);\\r\\n\\t\\treturn date;\\r\\n\\t}\",\n \"public static String formatDateForName(Date date, String userId)\\n\\t{\\n\\t\\tDateFormat format = new SimpleDateFormat(\\\"MMM dd, yyyy hh:mm a\\\", getPreferredLocale(userId));\\n\\t\\tformat.setTimeZone(getPreferredTimeZone(userId));\\n\\n\\t\\tString rv = format.format(date);\\n\\t\\treturn rv;\\n\\t}\",\n \"@NotNull\\n public static String dateToString(Date date, String pattern, Locale locale) {\\n DateFormat format = new SimpleDateFormat(pattern, locale);\\n return format.format(date);\\n }\",\n \"public static String getStringFromDate(Date date, String format) {\\n if(date == null || format == null || format.isEmpty()) return \\\"\\\";\\n\\n String str = \\\"\\\";\\n\\n try {\\n DateFormat dateFormat = new SimpleDateFormat(format);\\n str = dateFormat.format(date);\\n }\\n catch (Exception e) {e.printStackTrace();}\\n\\n return str;\\n }\",\n \"public static String format(String $formatString, long $timeValue /*= 0*/) {\\n return (new SimpleDateFormat($formatString)).format($timeValue == 0 ? new Date() : new Date($timeValue));\\n }\",\n \"public static String dateToStringFormat(Calendar calendar, String format){\\n SimpleDateFormat simpleDateFormat = new SimpleDateFormat(format);\\n return simpleDateFormat.format(calendar.getTime());\\n }\",\n \"private static String formatDate(long date) {\\n Date systemDate = new java.util.Date(date * 1000L);\\n // the format of your date\\n SimpleDateFormat sdf = new java.text.SimpleDateFormat(\\\"yyyy-MM-dd HH:mm:ss\\\");\\n // give a timezone reference for formatting (see comment at the bottom)\\n sdf.setTimeZone(java.util.TimeZone.getTimeZone(\\\"GMT-4\\\"));\\n String formattedDate = sdf.format(systemDate);\\n return formattedDate;\\n }\",\n \"protected String date(String format, double time) {\\n\\t\\treturn new java.util.Date((long)(time*1000)).toString();\\n\\t}\",\n \"public void formatDateTime() {\\n // Check if type of parsing is for display or not. \\n // If it is for display, no need to check if date has already passed.\\n if (parseType != 2) {\\n startDate = dtFormat.formatDate(startDate,0);\\n endDate = dtFormat.formatDate(endDate,0);\\n } else {\\n startDate = dtFormat.formatDate(startDate,1);\\n endDate = dtFormat.formatDate(endDate,1);\\n }\\n \\n startTime = dtFormat.formatTime(startTime);\\n endTime = dtFormat.formatTime(endTime);\\n }\",\n \"public static String DateToString(Date fecha, String formato){\\n if (nullToBlank(fecha).equals(\\\"\\\")) {\\n return \\\"\\\";\\n }\\n SimpleDateFormat df = new SimpleDateFormat(formato);\\n return df.format(fecha);\\n }\",\n \"@Override // override for Javadoc and performance\\n public String format(DateTimeFormatter formatter) {\\n Objects.requireNonNull(formatter, \\\"formatter\\\");\\n return formatter.format(this);\\n }\",\n \"public void setDateFormats(String dateFormats)\\n {\\n this.dateFormats = dateFormats;\\n }\",\n \"public static String toStringFormat_2(Date date) {\\r\\n\\r\\n\\t\\treturn dateToString(date, DATE_FORMAT_2);\\r\\n\\t}\",\n \"public static String getStringFromDate(Date date, String format)\\n {\\n SimpleDateFormat formatter = new SimpleDateFormat(format);\\n return formatter.format(date);\\n }\",\n \"private String changeDateFormat (String oldDate) throws ParseException {\\n // Source: https://stackoverflow.com/questions/3469507/how-can-i-change-the-date-format-in-java\\n final String OLD_FORMAT = \\\"MM/dd/yyyy\\\";\\n final String NEW_FORMAT = \\\"yyyyMMdd\\\";\\n String newDateString;\\n SimpleDateFormat sdf = new SimpleDateFormat(OLD_FORMAT);\\n Date d = sdf.parse(oldDate);\\n sdf.applyPattern(NEW_FORMAT);\\n newDateString = sdf.format(d);\\n return newDateString;\\n }\",\n \"public Date parseDate(String date, String format) {\\n return this.convertStringToDate(date, format);\\n }\",\n \"public static boolean isDate(InputField f, String format) {\\r\\n\\t\\tString d = f.getValue().replace(\\\"-\\\", \\\"\\\").replace(\\\"/\\\", \\\"\\\");\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tnew SimpleDateFormat(format).parse(d);\\r\\n\\t\\t\\treturn true;\\r\\n\\t\\t}\\r\\n\\t\\tcatch(Exception e) {\\r\\n\\t\\t\\treturn false;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public static String FormatDate(int day, int month, int year) {\\r\\n String jour = Integer.toString(day);\\r\\n String mois = Integer.toString(month + 1);\\r\\n if (jour.length() == 1) {\\r\\n jour = \\\"0\\\" + jour;\\r\\n }\\r\\n\\r\\n if (mois.length() == 1) {\\r\\n mois = \\\"0\\\" + mois;\\r\\n }\\r\\n return jour + \\\"/\\\" + mois + \\\"/\\\" + Integer.toString(year);\\r\\n }\",\n \"public static String formatDate(Date date){\\n\\t\\tCalendar now = Calendar.getInstance(); // Gets the current date and time\\n\\t\\tint currentYear = now.get(Calendar.YEAR);\\n\\t\\tint dateYear = Integer.parseInt(new SimpleDateFormat(\\\"yyyy\\\").format(date));\\n\\n\\t\\tif (dateYear <= currentYear){\\n\\t\\t\\treturn new SimpleDateFormat(\\\"E MMM dd HH:mm\\\").format(date);\\n\\t\\t} else {\\n\\t\\t\\treturn new SimpleDateFormat(\\\"E yyyy MMM dd HH:mm\\\").format(date);\\n\\t\\t}\\n\\t}\",\n \"public static String formatDateU(java.sql.Date date){\\n\\t\\treturn date!=null?toTheString(date):\\\"unknown\\\";\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7205822","0.7132317","0.7005666","0.69919586","0.6561013","0.64861333","0.64353704","0.63492525","0.6329546","0.62939","0.6269629","0.62261266","0.6205373","0.6187804","0.6160959","0.6159536","0.6156424","0.611411","0.6104788","0.61036026","0.6083815","0.6082056","0.6071837","0.60524386","0.60480565","0.60448575","0.60351735","0.602319","0.6023139","0.6015031","0.59924155","0.59731865","0.5964154","0.59377074","0.5936687","0.5935422","0.59241414","0.5907228","0.5906302","0.59021217","0.58970934","0.58708924","0.58629376","0.5852768","0.58436584","0.5826243","0.5823432","0.5817178","0.5814904","0.58098197","0.580415","0.57932365","0.57821506","0.5764829","0.57565635","0.57452977","0.5734206","0.57275414","0.5723646","0.57166266","0.5715584","0.56969017","0.5696216","0.5680365","0.5672137","0.56606156","0.5649479","0.5630725","0.56148964","0.5612112","0.5605588","0.5594372","0.5588115","0.5588022","0.5569762","0.5561027","0.55491","0.5540647","0.5532555","0.552364","0.55112195","0.55064666","0.5496336","0.5494174","0.54787266","0.54756284","0.5472924","0.5471271","0.54687315","0.54641104","0.54593414","0.5452148","0.5449916","0.54448944","0.5425714","0.5425073","0.5424869","0.5421625","0.54187536","0.5417326"],"string":"[\n \"0.7205822\",\n \"0.7132317\",\n \"0.7005666\",\n \"0.69919586\",\n \"0.6561013\",\n \"0.64861333\",\n \"0.64353704\",\n \"0.63492525\",\n \"0.6329546\",\n \"0.62939\",\n \"0.6269629\",\n \"0.62261266\",\n \"0.6205373\",\n \"0.6187804\",\n \"0.6160959\",\n \"0.6159536\",\n \"0.6156424\",\n \"0.611411\",\n \"0.6104788\",\n \"0.61036026\",\n \"0.6083815\",\n \"0.6082056\",\n \"0.6071837\",\n \"0.60524386\",\n \"0.60480565\",\n \"0.60448575\",\n \"0.60351735\",\n \"0.602319\",\n \"0.6023139\",\n \"0.6015031\",\n \"0.59924155\",\n \"0.59731865\",\n \"0.5964154\",\n \"0.59377074\",\n \"0.5936687\",\n \"0.5935422\",\n \"0.59241414\",\n \"0.5907228\",\n \"0.5906302\",\n \"0.59021217\",\n \"0.58970934\",\n \"0.58708924\",\n \"0.58629376\",\n \"0.5852768\",\n \"0.58436584\",\n \"0.5826243\",\n \"0.5823432\",\n \"0.5817178\",\n \"0.5814904\",\n \"0.58098197\",\n \"0.580415\",\n \"0.57932365\",\n \"0.57821506\",\n \"0.5764829\",\n \"0.57565635\",\n \"0.57452977\",\n \"0.5734206\",\n \"0.57275414\",\n \"0.5723646\",\n \"0.57166266\",\n \"0.5715584\",\n \"0.56969017\",\n \"0.5696216\",\n \"0.5680365\",\n \"0.5672137\",\n \"0.56606156\",\n \"0.5649479\",\n \"0.5630725\",\n \"0.56148964\",\n \"0.5612112\",\n \"0.5605588\",\n \"0.5594372\",\n \"0.5588115\",\n \"0.5588022\",\n \"0.5569762\",\n \"0.5561027\",\n \"0.55491\",\n \"0.5540647\",\n \"0.5532555\",\n \"0.552364\",\n \"0.55112195\",\n \"0.55064666\",\n \"0.5496336\",\n \"0.5494174\",\n \"0.54787266\",\n \"0.54756284\",\n \"0.5472924\",\n \"0.5471271\",\n \"0.54687315\",\n \"0.54641104\",\n \"0.54593414\",\n \"0.5452148\",\n \"0.5449916\",\n \"0.54448944\",\n \"0.5425714\",\n \"0.5425073\",\n \"0.5424869\",\n \"0.5421625\",\n \"0.54187536\",\n \"0.5417326\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7147396"},"document_rank":{"kind":"string","value":"1"}}},{"rowIdx":29391,"cells":{"query":{"kind":"string","value":"Converts given date with given pattern to String object."},"document":{"kind":"string","value":"public String convertDateToString(Date date, String format) {\n DateFormat dateFormat = new SimpleDateFormat(format);\n String dateAsString = dateFormat.format(date);\n return dateAsString;\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["public static final Function<Date,String> toStr(final String pattern) {\r\n return new ToString(pattern);\r\n }","public String getSimpleDate( java.util.Date date, String pattern ){\n if ( date == null || pattern == null ) return null;\n SimpleDateFormat sdf = new SimpleDateFormat(pattern);\n return sdf.format(date);\n }","@NotNull\n public static String dateToString(Date date, String pattern, Locale locale) {\n DateFormat format = new SimpleDateFormat(pattern, locale);\n return format.format(date);\n }","public static final Function<Date,String> toStr(final String pattern, final String locale) {\r\n return new ToString(pattern, locale);\r\n }","public static final Function<Date,String> toStr(final String pattern, final Locale locale) {\r\n return new ToString(pattern, locale);\r\n }","public static String getDate(String pattern) {\n return getDate(pattern, System.currentTimeMillis());\n }","public static String formatDate(Date source, String pattern) throws Exception {\n\tif (null != source) {\n\t DateFormat format = new SimpleDateFormat(pattern);\n\t return format.format(source);\n\t}\n\treturn null;\n }","public static String formatDate(java.util.Date value, String pattern) {\r\n\t\tif (value != null) {\r\n\t\t\t// Cria Locale informando Portugues Brasil\r\n\t\t\tLocale locale = new Locale(\"pt\", \"BR\");\r\n\t\t\t// Cria Formatador de data informando padr�o\r\n\t\t\tSimpleDateFormat dateFormat = new SimpleDateFormat(pattern, locale);\r\n\t\t\t// Passa o resultado final obtido para uma String\r\n\t\t\tString retorno = dateFormat.format(value);\r\n\t\t\t// Trata a String para que a primeira letra seja maiuscula (caso esteja no padr�o MMM/yyyy\r\n\t\t\tif ((retorno != null) && (retorno.length() > 0)) {\r\n\t\t\t\tretorno = (retorno.charAt(0) + \"\").toUpperCase() + retorno.substring(1);\r\n\t\t\t}\r\n\t\t\treturn retorno;\r\n\t\t} else {\r\n\t\t\treturn \"\";\r\n\t\t}\r\n\t}","public static String now(String pattern){\n return DateFormatUtils.format(Calendar.getInstance(),pattern);\n }","public static String getCurrentDateFormatted(String pattern) {\r\n\t\tDate now = new Date();\r\n\t\ttry {\r\n\t\t\tDateFormat df = new SimpleDateFormat(pattern);\r\n\t\t\treturn df.format(now);\r\n\t\t} catch (IllegalArgumentException e) {\r\n\t\t\tthrow e;\r\n\t\t}\r\n\t}","public DateGraphFormat(String pattern){\n\t((SimpleDateFormat) dateFormat).applyPattern(pattern);\n }","public static String getTimeStamp(String pattern){\n Timestamp timestamp = new Timestamp(System.currentTimeMillis());\n SimpleDateFormat sdf = new SimpleDateFormat(pattern);\n return String.valueOf(sdf.format(timestamp));\n\n }","public static String getDatePattern() {\n\t\treturn DATE_PATTERN;\n\t}","public static String getDate(String pattern, long timeInMillis) {\n SimpleDateFormat format = new SimpleDateFormat(pattern);\n return format.format(new Date(timeInMillis));\n }","public String format (Date date , String dateFormat) ;","public static String toStringFormat_1(Date date) {\r\n\r\n\t\treturn dateToString(date, DATE_FORMAT_1);\r\n\t}","public static String convertDateFormat (String dateStr, String fromFormatPattern, String toFormatPattern) {\n\t\tDateFormat fromFormat = new SimpleDateFormat(fromFormatPattern);\n\t\tDateFormat toFormat = new SimpleDateFormat(toFormatPattern);\n\t\ttoFormat.setLenient(false);\n\t\tDate date;\n\t\ttry {\n\t\t\tdate = fromFormat.parse(dateStr);\n\t\t\treturn toFormat.format(date);\n\t\t} catch (ParseException e) {\n\t\t\t// TODO Auto-generated catch block\n\t\t\tLog.d(\"ERROR\", \"Date formatting Error\");\n\t\t}\n\t\treturn null;\n\t}","public static String toStringFormat_4(Date date) {\r\n\r\n\t\treturn dateToString(date, DATE_FORMAT_4);\r\n\t}","public static String formatDateToString(Date dateObj) {\n return formatDateToString(dateObj, DATE_FORMAT.DEFAULT);\n }","public static String formatString(Timestamp timestamp,\n String pattern,\n boolean withZoneUTC) {\n return formatString(timestamp, pattern, withZoneUTC, false, 0);\n }","public static Date toDate(Object obj, String pattern) {\n return toDate(obj, pattern, (TimeZone) null);\n }","public static String parseStringDate(String s, String myPattern) {\n\n\t\tString pattern = \"\";\n\t\tLocale locale = null;\n\t\tif (s.indexOf(':') >= 0) {\n\t\t\tif (s.length() > 23) {\n\n\t\t\t\tpattern = \"EEE MMM dd HH:mm:ss Z yyyy\";\n\t\t\t\tlocale = Locale.ENGLISH;\n\n\t\t\t} else if (s.length() > 20) {\n\n\t\t\t\tpattern = \"yyyy-MM-dd HH:mm:ss.SSS\";\n\n\t\t\t} else {\n\t\t\t\tpattern = DD_MM_YYYY_HH_MM_SS;\n\n\t\t\t}\n\t\t} else {\n\t\t\tpattern = DD_MM_YYYY;\n\t\t}\n\n\t\tSimpleDateFormat sdfSource = null;\n\t\tif (pattern.length() > 23) {\n\t\t\tsdfSource = new SimpleDateFormat(pattern, locale);\n\t\t} else {\n\t\t\tsdfSource = new SimpleDateFormat(pattern);\n\t\t}\n\n\t\tDate date = null;\n\t\ttry {\n\t\t\tdate = sdfSource.parse(s);\n\t\t} catch (ParseException e) {\n\t\t\tLOGGER.error(e);\n\t\t}\n\n\t\tSimpleDateFormat sdfDestination = new SimpleDateFormat(myPattern);\n\n\t\treturn sdfDestination.format(date);\n\t}","public String getFormattedDateOnly(DateTime date) {\n String datePattern = context.getString(R.string.general_date_pattern_date_only);\n DateTimeFormatter dtfOut = DateTimeFormat.forPattern(datePattern);\n return dtfOut.print(date);\n }","public static String convertToString(Date value) {\r\n if (value == null) {\r\n return null;\r\n }\r\n\r\n String dateFormat = ResourceUtil.getMessageResourceString(\"application.pattern.timestamp\");\r\n SimpleDateFormat simpleDateFormat = new SimpleDateFormat(dateFormat);\r\n String result = simpleDateFormat.format(value);\r\n\r\n return result;\r\n }","public static Date parseDateWithPattern(String date, String pattern) {\r\n DateFormat format = new SimpleDateFormat(pattern, Locale.ITALY);\r\n try {\r\n return format.parse(date);\r\n } catch (Exception ex) {\r\n return null;\r\n }\r\n }","public static java.util.Date parseStringToDate(String data, String pattern) {\r\n\t\tjava.util.Date retorno = null;\r\n\r\n\t\tif (data != null && pattern != null) {\r\n\t\t\tSimpleDateFormat format = new SimpleDateFormat(pattern);\r\n\t\t\tformat.setLenient(false);\r\n\t\t\ttry {\r\n\t\t\t\tretorno = format.parse(data);\r\n\t\t\t} catch (ParseException e) {\r\n\t\t\t\treturn null;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn retorno;\r\n\t}","private String dateToString(Date d){\r\n\t\tSimpleDateFormat fmt = new SimpleDateFormat(DATE_FORMAT);\r\n\t\treturn fmt.format(d);\r\n\t}","public void setDatePattern(String datePattern)\r\n\t{\r\n\t\tthis.datePattern = datePattern;\r\n\t}","static String formatString(TimestampValueImpl value,\n String pattern,\n boolean withZoneUTC) {\n\n if ((pattern == null ||\n pattern.equals(TimestampDef.DEFAULT_PATTERN)) &&\n withZoneUTC == true) {\n\n return stringFromBytes(value.getBytes(),\n value.getDefinition().getPrecision());\n }\n return formatString(value.get(), pattern, withZoneUTC,\n false /* optionalFracSecond */,\n ((pattern == null) ?\n value.getDefinition().getPrecision() : 0));\n }","public static String formatDateToString(Date dateObj, String format) {\n SimpleDateFormat formatter = new SimpleDateFormat(format);\n return formatter.format(dateObj);\n }","public String getCreationTime(String pattern) {\n\t\tString ret = new SimpleDateFormat(pattern).format(this.creationTime);\n\t\treturn ret;\n\t}","public static String toStringFormat_2(Date date) {\r\n\r\n\t\treturn dateToString(date, DATE_FORMAT_2);\r\n\t}","public static String toString(Object obj, String pattern) {\n if (obj == null) {\n return null;\n } else if (obj instanceof String) {\n return (String) obj;\n } else if (obj instanceof Date) {\n return toStringFromDate((Date) obj, pattern);\n } else if (obj instanceof Number) {\n return toStringFromNumber((Number) obj, pattern);\n } else if (obj instanceof Calendar) {\n return toStringFromDate(((Calendar) obj).getTime(), pattern);\n } else if (obj instanceof byte[]) {\n return encodeAsBase64((byte[]) obj);\n } else if (obj instanceof Throwable) {\n return toStringStackTrace((Throwable) obj);\n } else {\n return obj.toString();\n }\n }","public String getDatePattern()\r\n\t{\r\n\t\treturn datePattern;\r\n\t}","public static String convertDateToString(Date aDate) {\n\t\treturn getDateTime(getDatePattern(), aDate);\n\t}","public static String dateToStringFormat(Date date, String format){\n return new SimpleDateFormat(format).format(date);\n }","String formatDateCondition(Date date);","public static String dateToString(Date date)\r\n/* 19: */ {\r\n/* 20: 23 */ return sdfDate.format(date);\r\n/* 21: */ }","public static String toStringFormat_7(Date date) {\r\n\r\n\t\treturn dateToString(date, DATE_FORMAT_7);\r\n\t}","public String ConvertDate(){\r\n//\t\tDate date=JavaUtils.getSystemDate();\r\n//\t DateFormat df = new SimpleDateFormat(\"yyyy/MM/dd\");\r\n\t String pattern = \"yyyy-MM-dd\";\r\n\t SimpleDateFormat simpleDateFormat = new SimpleDateFormat(pattern);\r\n\r\n\t String date = simpleDateFormat.format(new Date());\r\n//\t System.out.println(date);\r\n\t \r\n//\t String s = df.format(date);\r\n//\t String result = s;\r\n//\t try {\r\n//\t date=df.parse(result);\r\n//\t } catch (ParseException e) {\r\n//\t // TODO Auto-generated catch block\r\n//\t e.printStackTrace();\r\n//\t }\r\n\t return date;\r\n\t }","public static String dateToString(Date date){\n\t\tSimpleDateFormat formatter = new SimpleDateFormat(\"MMddyy\");\n\t\treturn formatter.format(date);\n\t}","public String dateToString() {\n\t\treturn new String(year + \"/\"\n\t\t\t\t+ month + \"/\"\n\t\t\t\t+ day);\n }","public String getDateString(){\n return Utilities.dateToString(date);\n }","public static String dateToString(Date date){\r\n SimpleDateFormat df = new SimpleDateFormat(\"dd/MM/yyyy\");\r\n return df.format(date);\r\n }","private static String getDateStr() {\n\t\tDate date = Calendar.getInstance().getTime();\n\t\tDateFormat dateFormat = new SimpleDateFormat(\"MMddyyy\");\n\t\tString dateStr = dateFormat.format(date);\n\t\treturn dateStr;\n\t}","public static Date inputDate(String p, String pattern) {\n SimpleDateFormat sdf = new SimpleDateFormat(pattern);\n Date date = new Date();\n String tmp;\n while (true) {\n try {\n System.out.print(p);\n tmp = in.nextLine();\n if (!tmp.isEmpty()) {\n date = sdf.parse(tmp);\n if (tmp.equals(sdf.format(date))) {\n return date;\n } else {\n System.err.println(\"Please enter a right date, enter again.\");\n }\n } else {\n System.err.println(\"Not empty! Re-enter.\");\n }\n } catch (Exception e) {\n System.err.println(\"Format must be \" + pattern + \" ! Enter again.\");\n }\n }\n }","public String convertDateToString(Date date) {\n\t\tString dateTime = SDF.format(date);\n\t\treturn dateTime;\t\n\t}","private String formatDate(final Date date) {\r\n\t\tfinal Calendar calendar = Calendar.getInstance();\r\n\t\tcalendar.setTime(date);\r\n\r\n\t\tfinal String dayOfMonth = formatDayOfMonth(calendar);\r\n\t\tfinal String month = formatMonth(calendar);\r\n\t\tfinal String year = String.valueOf(calendar.get(Calendar.YEAR));\r\n\r\n\t\treturn String.format(\"%s/%s/%s\", year, month, dayOfMonth);\r\n\t}","private String dateToString(Date datum)\r\n\t{\n\t\tSimpleDateFormat df = new SimpleDateFormat(\"dd.MM.yyyy\");\r\n\t\tString dat = df.format(datum);\r\n\t\treturn dat;\r\n\t}","public static String dateToString(final Date date, final String inFormat) {\n\t\tString output = null;\n\t\tif (date != null) {\n\t\t\tString format = inFormat;\n\t\t\tif (inFormat == null) {\n\t\t\t\tformat = DD_MM_YYYY;\n\t\t\t}\n\t\t\tSimpleDateFormat dateFormatter = new SimpleDateFormat(format);\n\t\t\tdateFormatter.setTimeZone(TimeZone.getDefault());\n\t\t\toutput = dateFormatter.format(date);\n\t\t}\n\t\treturn output;\n\t}","public String convertDateToString(){\n\t\tString aDate = \"\";\n\t\taDate += Integer.toString(day);\n\t\taDate += \"/\";\n\t\taDate += Integer.toString(month);\n\t\taDate += \"/\";\n\t\taDate += Integer.toString(year);\n\t\treturn aDate;\n\t}","private String stringifyDate(Date date){\n\t\tDateFormat dateFormatter = new SimpleDateFormat(\"yyyy-MM-dd\");\t\t\n\t\treturn dateFormatter.format(date);\n\t}","static String formatString(Timestamp timestamp,\n String pattern,\n boolean withZoneUTC,\n boolean optionalFracSecond,\n int nFracSecond) {\n\n String fmt = (pattern == null) ? TimestampDef.DEFAULT_PATTERN : pattern;\n try {\n ZonedDateTime zdt = toUTCDateTime(timestamp);\n return zdt.format(getDateTimeFormatter(fmt, withZoneUTC,\n optionalFracSecond,\n false, nFracSecond));\n } catch (IllegalArgumentException iae) {\n throw new IllegalArgumentException(\"Failed to format the \" +\n \"timestamp with pattern '\" + fmt + \"': \" + iae.getMessage(),\n iae);\n } catch (DateTimeException dte) {\n throw new IllegalArgumentException(\"Failed to format the \" +\n \"timestamp with pattern '\" + fmt + \"': \" + dte.getMessage(),\n dte);\n }\n }","public static String dateStr(String input ){\n String mm = input.substring(0,2);\n String dd = input.substring(3,5);\n String yyyy = input.substring(6,10);\n return dd + \" - \" + mm + \" - \" + yyyy;\n }","public static String dateToString(Date date, String format) {\n\t\n\t\tString result = \"\";\n\t\tSimpleDateFormat dateFormat = new SimpleDateFormat(format);\n\n\t\tif (date != null) {\n\t\t\tresult = dateFormat.format(date);\n\t\t}\n\t\n\t\treturn result;\n\t}","public String convertDayToString(Date date) {\n SimpleDateFormat formatDate = new SimpleDateFormat(\"yyyy-MM-dd\");\n return formatDate.format(date);\n }","public static String englishStringOf(LocalDate date) {\n String[] dateStrings = date.toString().split(\"-\");\n String dateString = dateStrings[1] + \"/\" + dateStrings[2] + \"/\" + dateStrings[0];\n return dateString;\n }","private static String format(String pattern, Object... params) {\n\t\tStringBuffer result = new StringBuffer();\n\t\tnew MessageFormat(pattern, getLocale()).format(params, result, null);\n\t\treturn result.toString();\n\t}","private String formatDate(Date dateObject) {\r\n SimpleDateFormat dateFormat = new SimpleDateFormat(\"LLL dd, yyyy\");\r\n return dateFormat.format(dateObject);\r\n }","public String getFormattedDateShort(DateTime date) {\n String datePattern = context.getString(R.string.general_date_pattern_short);\n DateTimeFormatter dtfOut = DateTimeFormat.forPattern(datePattern);\n return dtfOut.print(date);\n }","private String formatDate(Date dateObject) {\n SimpleDateFormat dateFormat = new SimpleDateFormat(\"LLL dd, yyyy\");\n return dateFormat.format(dateObject);\n }","public static String formatDateToString(Date d, String formatoData) {\n\t\tfinal String OLD_FORMAT = \"yyyy-MM-dd\";\r\n\r\n\t\tString newDateString;\r\n\r\n\t\tSimpleDateFormat sdf = new SimpleDateFormat(OLD_FORMAT);\r\n\t\tsdf.applyPattern(formatoData);\r\n\t\tnewDateString = sdf.format(d);\r\n\t\t\r\n\t\treturn newDateString;\r\n\t}","public static String format(LocalDate date){\r\n\t\t\r\n\t\tif(date==null){\r\n\t\t\treturn null;\r\n\t\t}\r\n\t\treturn DATE_FORMATTER.format(date);\r\n\t}","public static String getStringFromDate(Date date, String format) {\n if(date == null || format == null || format.isEmpty()) return \"\";\n\n String str = \"\";\n\n try {\n DateFormat dateFormat = new SimpleDateFormat(format);\n str = dateFormat.format(date);\n }\n catch (Exception e) {e.printStackTrace();}\n\n return str;\n }","public static String getStringFromDate(Date date, String format)\n {\n SimpleDateFormat formatter = new SimpleDateFormat(format);\n return formatter.format(date);\n }","private static String convertDate(String dateString) {\n String date = null;\n\n try {\n //Parse the string into a date variable\n Date parsedDate = new SimpleDateFormat(\"yyyy-MM-dd'T'HH:mm:ss\").parse(dateString);\n\n //Now reformat it using desired display pattern:\n date = new SimpleDateFormat(DATE_FORMAT).format(parsedDate);\n\n } catch (ParseException e) {\n Log.e(TAG, \"getDate: Error parsing date\", e);\n e.printStackTrace();\n }\n\n return date;\n }","@Method(selector = \"stringFromDate:toDate:\")\n public native String format(NSDate fromDate, NSDate toDate);","public String dateStr(String date) {\n\t\treturn AnalyticsUDF.dateFormatter(date);\n\t}","private String formatDate(String dateString) {\n DateTimeFormatter dateTimeFormatter = DateTimeFormatter.ofPattern(\"LLL dd, yyyy\");\n LocalDate localDate = LocalDate.parse(dateString.substring(0, 10));\n return dateTimeFormatter.format(localDate);\n }","public static String formatDateU(java.sql.Date date){\n\t\treturn date!=null?toTheString(date):\"unknown\";\n\t}","java.lang.String getDate();","public static String formatterDate(Date date){\n\t\tString retour = null;\n\t\tif(date != null){\n\t\t\tretour = dfr.format(date);\n\t\t}\n\t\treturn retour;\n\t}","public static String getFormattedDateString(Date date, String format) {\n Calendar cal = Calendar.getInstance();\n TimeZone timeZone = cal.getTimeZone();\n\n SimpleDateFormat dateFormat = new SimpleDateFormat(format);\n dateFormat.setTimeZone(timeZone);\n\n return dateFormat.format(date);\n }","protected String formatDateToString(Date date) {\n\t\tSimpleDateFormat format = new SimpleDateFormat(\"yyyy.MM.dd HH:mm:ss\");\n\t\tString formatted = format.format(date);\n\t\treturn formatted;\n\t}","private String getFormattedDate(String date) {\n SimpleDateFormat dateFormat = new SimpleDateFormat(getString(R.string.received_import_date_format));\n SimpleDateFormat desiredDateFormat = new SimpleDateFormat(getString(R.string.desired_import_date_format));\n Date parsedDate;\n try {\n parsedDate = dateFormat.parse(date);\n return desiredDateFormat.format(parsedDate);\n } catch (ParseException e) {\n // Return an empty string in case of issues parsing the date string received.\n e.printStackTrace();\n return \"\";\n }\n }","public static java.sql.Date toSqlDate(Object obj, String pattern) {\n return toSqlDate(obj, pattern, (TimeZone) null);\n }","private String formatDate(Date dateObject) {\n SimpleDateFormat dateFormat = new SimpleDateFormat(\"LLL dd, yyyy\", Locale.getDefault());\n return dateFormat.format(dateObject);\n }","public static String formatDate(Date date) {\n\t\tString newstring = new SimpleDateFormat(\"MM-dd-yyyy\").format(date);\n\t\treturn newstring;\n\t}","public static String fromDate(String s){\n \t\t\n \t\tString[] date = s.split(\"T\");\n \t\tString time = date[1].substring(0,5);\n \t\tString[] dates = date[0].split(\"-\"); \n \t\tString month = dates[1];\n \t\tString day = dates[2];\n \t\t\n \t\treturn day + \"/\" + month + \", kl: \" + time;\n \t}","public static DateTimeFormatter forStrptimePattern(String pattern) {\n if (pattern == null || pattern.length() == 0)\n throw new IllegalArgumentException(\"Empty date time pattern specification\");\n\n DateTimeFormatterBuilder builder = new DateTimeFormatterBuilder();\n parseToBuilder(builder, pattern);\n DateTimeFormatter formatter = builder.toFormatter();\n\n return formatter;\n }","String getDate();","String getDate();","public static String getDate(Date date)\n\t{\n\t\treturn getFormatString(date, getDateFormat());\n\t}","public static String getDateAsString(Date date) {\r\n\t\tSimpleDateFormat dateform = new SimpleDateFormat(_dateFormat);\r\n\r\n\t\treturn dateform.format(date);\r\n\t}","public String getFormatedDate(Date date) {\r\n\t\tSimpleDateFormat sdf=new SimpleDateFormat(\"dd/mm/yyyy\");\r\n\t\treturn sdf.format(date);\r\n\t}","public static String convert( Date date )\r\n {\r\n SimpleDateFormat simpleDateFormat = new SimpleDateFormat( \"yyyy-MM-dd\" );\r\n\r\n return simpleDateFormat.format( date );\r\n }","public static String formatToString(long unixTimeInSecond, String pattern) {\n if (StringUtils.isBlank(pattern)) {\n pattern = DEFAULT_TIME_PATTERN;\n }\n LocalDateTime dateTime = LocalDateTime.ofInstant(Instant.ofEpochSecond(unixTimeInSecond), ZoneOffset.systemDefault());\n return DateTimeFormatter.ofPattern(pattern).format(dateTime);\n }","public java.sql.Date format(String date) {\n int i = 0;\n int dateAttr[];\n dateAttr = new int[3];\n for(String v : date.split(\"/\")) {\n dateAttr[i] = Integer.parseInt(v);\n i++;\n }\n\n GregorianCalendar gcalendar = new GregorianCalendar();\n gcalendar.set(dateAttr[2], dateAttr[0]-1, dateAttr[1]); // Year,Month,Day Of Month\n java.sql.Date sdate = new java.sql.Date(gcalendar.getTimeInMillis());\n return sdate;\n }","public String formatDate (Date date){\r\n\t\tDateFormat df = new SimpleDateFormat(\"EEE, d MMM yyyy HH:mm:ss z\", Locale.ENGLISH);\r\n\t\treturn df.format(date);\r\n\t}","public static String formatDate(java.sql.Date date){\n\t\treturn date!=null?toTheString(date):\"\";\n\t}","private String formatDate(Date date) {\n String resultDate;\n SimpleDateFormat dateFormat;\n dateFormat = new SimpleDateFormat(\"dd/MM/yyyy\");\n resultDate = dateFormat.format(date);\n return resultDate;\n }","public static String dateToStringFormat(Calendar calendar, String format){\n SimpleDateFormat simpleDateFormat = new SimpleDateFormat(format);\n return simpleDateFormat.format(calendar.getTime());\n }","private static String toString(int year, int month, int day) {\n\n // Use a buffer to create the string\n StringBuffer buffer = new StringBuffer(8);\n\n // Append the year\n if (year < 10) {\n buffer.append(\"000\");\n } else if (year < 100) {\n buffer.append(\"00\");\n } else if (year < 1000) {\n buffer.append('0');\n }\n buffer.append(year);\n\n // Append the month\n if (month < 10) {\n buffer.append('0');\n }\n buffer.append(month);\n\n // Append the day\n if (day < 10) {\n buffer.append('0');\n }\n buffer.append(day);\n\n return buffer.toString();\n }","@Override\n\tpublic String toString() {\n\t\ttry {\n\t\t\tSimpleDateFormat formatter = new SimpleDateFormat(\"MM/dd/yyyy\");\n\t\t\tDate date = formatter.parse(month + \"/\" + day + \"/\" + year);\n\n\t\t\treturn formatter.format(date);\n\t\t} catch (Exception e) {\n\t\t\tthrow new RuntimeException(e);\n\t\t}\n\t}","public String getStringDate(){\n String finalDate = \"\";\n Locale usersLocale = Locale.getDefault();\n DateFormatSymbols dfs = new DateFormatSymbols(usersLocale);\n String weekdays[] = dfs.getWeekdays();\n int day = date.get(Calendar.DAY_OF_WEEK);\n String nameOfDay = weekdays[day];\n\n finalDate += nameOfDay + \" \" + date.get(Calendar.DAY_OF_MONTH) + \", \";\n\n String months[] = dfs.getMonths();\n int month = date.get(Calendar.MONTH);\n String nameOfMonth = months[month];\n\n finalDate += nameOfMonth + \", \" + date.get(Calendar.YEAR);\n\n return finalDate;\n }","public static String getStrDate(Date date) {\n //TODO get date\n SimpleDateFormat formatter;\n if (DateUtils.isToday(date.getTime())) {\n formatter = new SimpleDateFormat(\"HH:mm\");\n return formatter.format(date);\n }\n formatter = new SimpleDateFormat(\"MMM dd\");\n return formatter.format(date);\n }","public String dateFormatter(String fromDate) {\n\t\tString newDateString=\"\";\n\t\ttry {\n\t\t\tfinal String oldFormat = \"yyyy/MM/dd\";\n\t\t\tfinal String newFormat = \"yyyy-MM-dd\";\n\t\t\tSimpleDateFormat sdf = new SimpleDateFormat(oldFormat);\n\t\t\tDate d = sdf.parse(fromDate);\n\t\t\tsdf.applyPattern(newFormat);\n\t\t\tnewDateString = sdf.format(d);\n\t\t} catch(Exception exp) {\n\t\t\tthrow ExceptionUtil.getYFSException(ExceptionLiterals.ERRORCODE_INVALID_DATE, exp);\n\t\t}\n\t\treturn newDateString;\n\t}","public String getDateString(Date date) {\n Calendar cal = Calendar.getInstance();\n\n cal.setTime(date);\n int year = cal.get(Calendar.YEAR);\n String month = String.format(\"%02d\", cal.get(Calendar.MONTH) + 1);\n String day = String.format(\"%02d\", cal.get(Calendar.DAY_OF_MONTH));\n return year + month + day;\n }","public static String formatDate(Calendar date, DateFormat format) {\n\n switch (format) {\n case COMPLETE_DATE_FORMAT:\n format = DateFormat.COMPLETE_DATE_FORMAT;\n break;\n case DAY_FORMAT:\n format = DateFormat.DAY_FORMAT;\n break;\n }\n\n SimpleDateFormat dateFormatter = new SimpleDateFormat(format.getFormat(), Locale.US);\n\n return dateFormatter.format(date.getTime());\n }","private String formatDate(String date)\n\t{\n\t\tif(date == null || date.isEmpty())\n\t\t{\n\t\t\treturn \"\";\n\t\t}\n\t\telse\n\t\t{\n\t\t\tString[] dateSplit = date.split(\"/\");\n\t\t\tif(dateSplit.length != 3)\n\t\t\t{\n\t\t\t\treturn \"\";\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn getMonthName(dateSplit[0]) + \" \"+ dateSplit[1]+\", \"+ dateSplit[2];\n\t\t\t}\n\t\t}\n\t}"],"string":"[\n \"public static final Function<Date,String> toStr(final String pattern) {\\r\\n return new ToString(pattern);\\r\\n }\",\n \"public String getSimpleDate( java.util.Date date, String pattern ){\\n if ( date == null || pattern == null ) return null;\\n SimpleDateFormat sdf = new SimpleDateFormat(pattern);\\n return sdf.format(date);\\n }\",\n \"@NotNull\\n public static String dateToString(Date date, String pattern, Locale locale) {\\n DateFormat format = new SimpleDateFormat(pattern, locale);\\n return format.format(date);\\n }\",\n \"public static final Function<Date,String> toStr(final String pattern, final String locale) {\\r\\n return new ToString(pattern, locale);\\r\\n }\",\n \"public static final Function<Date,String> toStr(final String pattern, final Locale locale) {\\r\\n return new ToString(pattern, locale);\\r\\n }\",\n \"public static String getDate(String pattern) {\\n return getDate(pattern, System.currentTimeMillis());\\n }\",\n \"public static String formatDate(Date source, String pattern) throws Exception {\\n\\tif (null != source) {\\n\\t DateFormat format = new SimpleDateFormat(pattern);\\n\\t return format.format(source);\\n\\t}\\n\\treturn null;\\n }\",\n \"public static String formatDate(java.util.Date value, String pattern) {\\r\\n\\t\\tif (value != null) {\\r\\n\\t\\t\\t// Cria Locale informando Portugues Brasil\\r\\n\\t\\t\\tLocale locale = new Locale(\\\"pt\\\", \\\"BR\\\");\\r\\n\\t\\t\\t// Cria Formatador de data informando padr�o\\r\\n\\t\\t\\tSimpleDateFormat dateFormat = new SimpleDateFormat(pattern, locale);\\r\\n\\t\\t\\t// Passa o resultado final obtido para uma String\\r\\n\\t\\t\\tString retorno = dateFormat.format(value);\\r\\n\\t\\t\\t// Trata a String para que a primeira letra seja maiuscula (caso esteja no padr�o MMM/yyyy\\r\\n\\t\\t\\tif ((retorno != null) && (retorno.length() > 0)) {\\r\\n\\t\\t\\t\\tretorno = (retorno.charAt(0) + \\\"\\\").toUpperCase() + retorno.substring(1);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\treturn retorno;\\r\\n\\t\\t} else {\\r\\n\\t\\t\\treturn \\\"\\\";\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public static String now(String pattern){\\n return DateFormatUtils.format(Calendar.getInstance(),pattern);\\n }\",\n \"public static String getCurrentDateFormatted(String pattern) {\\r\\n\\t\\tDate now = new Date();\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tDateFormat df = new SimpleDateFormat(pattern);\\r\\n\\t\\t\\treturn df.format(now);\\r\\n\\t\\t} catch (IllegalArgumentException e) {\\r\\n\\t\\t\\tthrow e;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public DateGraphFormat(String pattern){\\n\\t((SimpleDateFormat) dateFormat).applyPattern(pattern);\\n }\",\n \"public static String getTimeStamp(String pattern){\\n Timestamp timestamp = new Timestamp(System.currentTimeMillis());\\n SimpleDateFormat sdf = new SimpleDateFormat(pattern);\\n return String.valueOf(sdf.format(timestamp));\\n\\n }\",\n \"public static String getDatePattern() {\\n\\t\\treturn DATE_PATTERN;\\n\\t}\",\n \"public static String getDate(String pattern, long timeInMillis) {\\n SimpleDateFormat format = new SimpleDateFormat(pattern);\\n return format.format(new Date(timeInMillis));\\n }\",\n \"public String format (Date date , String dateFormat) ;\",\n \"public static String toStringFormat_1(Date date) {\\r\\n\\r\\n\\t\\treturn dateToString(date, DATE_FORMAT_1);\\r\\n\\t}\",\n \"public static String convertDateFormat (String dateStr, String fromFormatPattern, String toFormatPattern) {\\n\\t\\tDateFormat fromFormat = new SimpleDateFormat(fromFormatPattern);\\n\\t\\tDateFormat toFormat = new SimpleDateFormat(toFormatPattern);\\n\\t\\ttoFormat.setLenient(false);\\n\\t\\tDate date;\\n\\t\\ttry {\\n\\t\\t\\tdate = fromFormat.parse(dateStr);\\n\\t\\t\\treturn toFormat.format(date);\\n\\t\\t} catch (ParseException e) {\\n\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\tLog.d(\\\"ERROR\\\", \\\"Date formatting Error\\\");\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"public static String toStringFormat_4(Date date) {\\r\\n\\r\\n\\t\\treturn dateToString(date, DATE_FORMAT_4);\\r\\n\\t}\",\n \"public static String formatDateToString(Date dateObj) {\\n return formatDateToString(dateObj, DATE_FORMAT.DEFAULT);\\n }\",\n \"public static String formatString(Timestamp timestamp,\\n String pattern,\\n boolean withZoneUTC) {\\n return formatString(timestamp, pattern, withZoneUTC, false, 0);\\n }\",\n \"public static Date toDate(Object obj, String pattern) {\\n return toDate(obj, pattern, (TimeZone) null);\\n }\",\n \"public static String parseStringDate(String s, String myPattern) {\\n\\n\\t\\tString pattern = \\\"\\\";\\n\\t\\tLocale locale = null;\\n\\t\\tif (s.indexOf(':') >= 0) {\\n\\t\\t\\tif (s.length() > 23) {\\n\\n\\t\\t\\t\\tpattern = \\\"EEE MMM dd HH:mm:ss Z yyyy\\\";\\n\\t\\t\\t\\tlocale = Locale.ENGLISH;\\n\\n\\t\\t\\t} else if (s.length() > 20) {\\n\\n\\t\\t\\t\\tpattern = \\\"yyyy-MM-dd HH:mm:ss.SSS\\\";\\n\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tpattern = DD_MM_YYYY_HH_MM_SS;\\n\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\tpattern = DD_MM_YYYY;\\n\\t\\t}\\n\\n\\t\\tSimpleDateFormat sdfSource = null;\\n\\t\\tif (pattern.length() > 23) {\\n\\t\\t\\tsdfSource = new SimpleDateFormat(pattern, locale);\\n\\t\\t} else {\\n\\t\\t\\tsdfSource = new SimpleDateFormat(pattern);\\n\\t\\t}\\n\\n\\t\\tDate date = null;\\n\\t\\ttry {\\n\\t\\t\\tdate = sdfSource.parse(s);\\n\\t\\t} catch (ParseException e) {\\n\\t\\t\\tLOGGER.error(e);\\n\\t\\t}\\n\\n\\t\\tSimpleDateFormat sdfDestination = new SimpleDateFormat(myPattern);\\n\\n\\t\\treturn sdfDestination.format(date);\\n\\t}\",\n \"public String getFormattedDateOnly(DateTime date) {\\n String datePattern = context.getString(R.string.general_date_pattern_date_only);\\n DateTimeFormatter dtfOut = DateTimeFormat.forPattern(datePattern);\\n return dtfOut.print(date);\\n }\",\n \"public static String convertToString(Date value) {\\r\\n if (value == null) {\\r\\n return null;\\r\\n }\\r\\n\\r\\n String dateFormat = ResourceUtil.getMessageResourceString(\\\"application.pattern.timestamp\\\");\\r\\n SimpleDateFormat simpleDateFormat = new SimpleDateFormat(dateFormat);\\r\\n String result = simpleDateFormat.format(value);\\r\\n\\r\\n return result;\\r\\n }\",\n \"public static Date parseDateWithPattern(String date, String pattern) {\\r\\n DateFormat format = new SimpleDateFormat(pattern, Locale.ITALY);\\r\\n try {\\r\\n return format.parse(date);\\r\\n } catch (Exception ex) {\\r\\n return null;\\r\\n }\\r\\n }\",\n \"public static java.util.Date parseStringToDate(String data, String pattern) {\\r\\n\\t\\tjava.util.Date retorno = null;\\r\\n\\r\\n\\t\\tif (data != null && pattern != null) {\\r\\n\\t\\t\\tSimpleDateFormat format = new SimpleDateFormat(pattern);\\r\\n\\t\\t\\tformat.setLenient(false);\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\tretorno = format.parse(data);\\r\\n\\t\\t\\t} catch (ParseException e) {\\r\\n\\t\\t\\t\\treturn null;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn retorno;\\r\\n\\t}\",\n \"private String dateToString(Date d){\\r\\n\\t\\tSimpleDateFormat fmt = new SimpleDateFormat(DATE_FORMAT);\\r\\n\\t\\treturn fmt.format(d);\\r\\n\\t}\",\n \"public void setDatePattern(String datePattern)\\r\\n\\t{\\r\\n\\t\\tthis.datePattern = datePattern;\\r\\n\\t}\",\n \"static String formatString(TimestampValueImpl value,\\n String pattern,\\n boolean withZoneUTC) {\\n\\n if ((pattern == null ||\\n pattern.equals(TimestampDef.DEFAULT_PATTERN)) &&\\n withZoneUTC == true) {\\n\\n return stringFromBytes(value.getBytes(),\\n value.getDefinition().getPrecision());\\n }\\n return formatString(value.get(), pattern, withZoneUTC,\\n false /* optionalFracSecond */,\\n ((pattern == null) ?\\n value.getDefinition().getPrecision() : 0));\\n }\",\n \"public static String formatDateToString(Date dateObj, String format) {\\n SimpleDateFormat formatter = new SimpleDateFormat(format);\\n return formatter.format(dateObj);\\n }\",\n \"public String getCreationTime(String pattern) {\\n\\t\\tString ret = new SimpleDateFormat(pattern).format(this.creationTime);\\n\\t\\treturn ret;\\n\\t}\",\n \"public static String toStringFormat_2(Date date) {\\r\\n\\r\\n\\t\\treturn dateToString(date, DATE_FORMAT_2);\\r\\n\\t}\",\n \"public static String toString(Object obj, String pattern) {\\n if (obj == null) {\\n return null;\\n } else if (obj instanceof String) {\\n return (String) obj;\\n } else if (obj instanceof Date) {\\n return toStringFromDate((Date) obj, pattern);\\n } else if (obj instanceof Number) {\\n return toStringFromNumber((Number) obj, pattern);\\n } else if (obj instanceof Calendar) {\\n return toStringFromDate(((Calendar) obj).getTime(), pattern);\\n } else if (obj instanceof byte[]) {\\n return encodeAsBase64((byte[]) obj);\\n } else if (obj instanceof Throwable) {\\n return toStringStackTrace((Throwable) obj);\\n } else {\\n return obj.toString();\\n }\\n }\",\n \"public String getDatePattern()\\r\\n\\t{\\r\\n\\t\\treturn datePattern;\\r\\n\\t}\",\n \"public static String convertDateToString(Date aDate) {\\n\\t\\treturn getDateTime(getDatePattern(), aDate);\\n\\t}\",\n \"public static String dateToStringFormat(Date date, String format){\\n return new SimpleDateFormat(format).format(date);\\n }\",\n \"String formatDateCondition(Date date);\",\n \"public static String dateToString(Date date)\\r\\n/* 19: */ {\\r\\n/* 20: 23 */ return sdfDate.format(date);\\r\\n/* 21: */ }\",\n \"public static String toStringFormat_7(Date date) {\\r\\n\\r\\n\\t\\treturn dateToString(date, DATE_FORMAT_7);\\r\\n\\t}\",\n \"public String ConvertDate(){\\r\\n//\\t\\tDate date=JavaUtils.getSystemDate();\\r\\n//\\t DateFormat df = new SimpleDateFormat(\\\"yyyy/MM/dd\\\");\\r\\n\\t String pattern = \\\"yyyy-MM-dd\\\";\\r\\n\\t SimpleDateFormat simpleDateFormat = new SimpleDateFormat(pattern);\\r\\n\\r\\n\\t String date = simpleDateFormat.format(new Date());\\r\\n//\\t System.out.println(date);\\r\\n\\t \\r\\n//\\t String s = df.format(date);\\r\\n//\\t String result = s;\\r\\n//\\t try {\\r\\n//\\t date=df.parse(result);\\r\\n//\\t } catch (ParseException e) {\\r\\n//\\t // TODO Auto-generated catch block\\r\\n//\\t e.printStackTrace();\\r\\n//\\t }\\r\\n\\t return date;\\r\\n\\t }\",\n \"public static String dateToString(Date date){\\n\\t\\tSimpleDateFormat formatter = new SimpleDateFormat(\\\"MMddyy\\\");\\n\\t\\treturn formatter.format(date);\\n\\t}\",\n \"public String dateToString() {\\n\\t\\treturn new String(year + \\\"/\\\"\\n\\t\\t\\t\\t+ month + \\\"/\\\"\\n\\t\\t\\t\\t+ day);\\n }\",\n \"public String getDateString(){\\n return Utilities.dateToString(date);\\n }\",\n \"public static String dateToString(Date date){\\r\\n SimpleDateFormat df = new SimpleDateFormat(\\\"dd/MM/yyyy\\\");\\r\\n return df.format(date);\\r\\n }\",\n \"private static String getDateStr() {\\n\\t\\tDate date = Calendar.getInstance().getTime();\\n\\t\\tDateFormat dateFormat = new SimpleDateFormat(\\\"MMddyyy\\\");\\n\\t\\tString dateStr = dateFormat.format(date);\\n\\t\\treturn dateStr;\\n\\t}\",\n \"public static Date inputDate(String p, String pattern) {\\n SimpleDateFormat sdf = new SimpleDateFormat(pattern);\\n Date date = new Date();\\n String tmp;\\n while (true) {\\n try {\\n System.out.print(p);\\n tmp = in.nextLine();\\n if (!tmp.isEmpty()) {\\n date = sdf.parse(tmp);\\n if (tmp.equals(sdf.format(date))) {\\n return date;\\n } else {\\n System.err.println(\\\"Please enter a right date, enter again.\\\");\\n }\\n } else {\\n System.err.println(\\\"Not empty! Re-enter.\\\");\\n }\\n } catch (Exception e) {\\n System.err.println(\\\"Format must be \\\" + pattern + \\\" ! Enter again.\\\");\\n }\\n }\\n }\",\n \"public String convertDateToString(Date date) {\\n\\t\\tString dateTime = SDF.format(date);\\n\\t\\treturn dateTime;\\t\\n\\t}\",\n \"private String formatDate(final Date date) {\\r\\n\\t\\tfinal Calendar calendar = Calendar.getInstance();\\r\\n\\t\\tcalendar.setTime(date);\\r\\n\\r\\n\\t\\tfinal String dayOfMonth = formatDayOfMonth(calendar);\\r\\n\\t\\tfinal String month = formatMonth(calendar);\\r\\n\\t\\tfinal String year = String.valueOf(calendar.get(Calendar.YEAR));\\r\\n\\r\\n\\t\\treturn String.format(\\\"%s/%s/%s\\\", year, month, dayOfMonth);\\r\\n\\t}\",\n \"private String dateToString(Date datum)\\r\\n\\t{\\n\\t\\tSimpleDateFormat df = new SimpleDateFormat(\\\"dd.MM.yyyy\\\");\\r\\n\\t\\tString dat = df.format(datum);\\r\\n\\t\\treturn dat;\\r\\n\\t}\",\n \"public static String dateToString(final Date date, final String inFormat) {\\n\\t\\tString output = null;\\n\\t\\tif (date != null) {\\n\\t\\t\\tString format = inFormat;\\n\\t\\t\\tif (inFormat == null) {\\n\\t\\t\\t\\tformat = DD_MM_YYYY;\\n\\t\\t\\t}\\n\\t\\t\\tSimpleDateFormat dateFormatter = new SimpleDateFormat(format);\\n\\t\\t\\tdateFormatter.setTimeZone(TimeZone.getDefault());\\n\\t\\t\\toutput = dateFormatter.format(date);\\n\\t\\t}\\n\\t\\treturn output;\\n\\t}\",\n \"public String convertDateToString(){\\n\\t\\tString aDate = \\\"\\\";\\n\\t\\taDate += Integer.toString(day);\\n\\t\\taDate += \\\"/\\\";\\n\\t\\taDate += Integer.toString(month);\\n\\t\\taDate += \\\"/\\\";\\n\\t\\taDate += Integer.toString(year);\\n\\t\\treturn aDate;\\n\\t}\",\n \"private String stringifyDate(Date date){\\n\\t\\tDateFormat dateFormatter = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\t\\t\\n\\t\\treturn dateFormatter.format(date);\\n\\t}\",\n \"static String formatString(Timestamp timestamp,\\n String pattern,\\n boolean withZoneUTC,\\n boolean optionalFracSecond,\\n int nFracSecond) {\\n\\n String fmt = (pattern == null) ? TimestampDef.DEFAULT_PATTERN : pattern;\\n try {\\n ZonedDateTime zdt = toUTCDateTime(timestamp);\\n return zdt.format(getDateTimeFormatter(fmt, withZoneUTC,\\n optionalFracSecond,\\n false, nFracSecond));\\n } catch (IllegalArgumentException iae) {\\n throw new IllegalArgumentException(\\\"Failed to format the \\\" +\\n \\\"timestamp with pattern '\\\" + fmt + \\\"': \\\" + iae.getMessage(),\\n iae);\\n } catch (DateTimeException dte) {\\n throw new IllegalArgumentException(\\\"Failed to format the \\\" +\\n \\\"timestamp with pattern '\\\" + fmt + \\\"': \\\" + dte.getMessage(),\\n dte);\\n }\\n }\",\n \"public static String dateStr(String input ){\\n String mm = input.substring(0,2);\\n String dd = input.substring(3,5);\\n String yyyy = input.substring(6,10);\\n return dd + \\\" - \\\" + mm + \\\" - \\\" + yyyy;\\n }\",\n \"public static String dateToString(Date date, String format) {\\n\\t\\n\\t\\tString result = \\\"\\\";\\n\\t\\tSimpleDateFormat dateFormat = new SimpleDateFormat(format);\\n\\n\\t\\tif (date != null) {\\n\\t\\t\\tresult = dateFormat.format(date);\\n\\t\\t}\\n\\t\\n\\t\\treturn result;\\n\\t}\",\n \"public String convertDayToString(Date date) {\\n SimpleDateFormat formatDate = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\n return formatDate.format(date);\\n }\",\n \"public static String englishStringOf(LocalDate date) {\\n String[] dateStrings = date.toString().split(\\\"-\\\");\\n String dateString = dateStrings[1] + \\\"/\\\" + dateStrings[2] + \\\"/\\\" + dateStrings[0];\\n return dateString;\\n }\",\n \"private static String format(String pattern, Object... params) {\\n\\t\\tStringBuffer result = new StringBuffer();\\n\\t\\tnew MessageFormat(pattern, getLocale()).format(params, result, null);\\n\\t\\treturn result.toString();\\n\\t}\",\n \"private String formatDate(Date dateObject) {\\r\\n SimpleDateFormat dateFormat = new SimpleDateFormat(\\\"LLL dd, yyyy\\\");\\r\\n return dateFormat.format(dateObject);\\r\\n }\",\n \"public String getFormattedDateShort(DateTime date) {\\n String datePattern = context.getString(R.string.general_date_pattern_short);\\n DateTimeFormatter dtfOut = DateTimeFormat.forPattern(datePattern);\\n return dtfOut.print(date);\\n }\",\n \"private String formatDate(Date dateObject) {\\n SimpleDateFormat dateFormat = new SimpleDateFormat(\\\"LLL dd, yyyy\\\");\\n return dateFormat.format(dateObject);\\n }\",\n \"public static String formatDateToString(Date d, String formatoData) {\\n\\t\\tfinal String OLD_FORMAT = \\\"yyyy-MM-dd\\\";\\r\\n\\r\\n\\t\\tString newDateString;\\r\\n\\r\\n\\t\\tSimpleDateFormat sdf = new SimpleDateFormat(OLD_FORMAT);\\r\\n\\t\\tsdf.applyPattern(formatoData);\\r\\n\\t\\tnewDateString = sdf.format(d);\\r\\n\\t\\t\\r\\n\\t\\treturn newDateString;\\r\\n\\t}\",\n \"public static String format(LocalDate date){\\r\\n\\t\\t\\r\\n\\t\\tif(date==null){\\r\\n\\t\\t\\treturn null;\\r\\n\\t\\t}\\r\\n\\t\\treturn DATE_FORMATTER.format(date);\\r\\n\\t}\",\n \"public static String getStringFromDate(Date date, String format) {\\n if(date == null || format == null || format.isEmpty()) return \\\"\\\";\\n\\n String str = \\\"\\\";\\n\\n try {\\n DateFormat dateFormat = new SimpleDateFormat(format);\\n str = dateFormat.format(date);\\n }\\n catch (Exception e) {e.printStackTrace();}\\n\\n return str;\\n }\",\n \"public static String getStringFromDate(Date date, String format)\\n {\\n SimpleDateFormat formatter = new SimpleDateFormat(format);\\n return formatter.format(date);\\n }\",\n \"private static String convertDate(String dateString) {\\n String date = null;\\n\\n try {\\n //Parse the string into a date variable\\n Date parsedDate = new SimpleDateFormat(\\\"yyyy-MM-dd'T'HH:mm:ss\\\").parse(dateString);\\n\\n //Now reformat it using desired display pattern:\\n date = new SimpleDateFormat(DATE_FORMAT).format(parsedDate);\\n\\n } catch (ParseException e) {\\n Log.e(TAG, \\\"getDate: Error parsing date\\\", e);\\n e.printStackTrace();\\n }\\n\\n return date;\\n }\",\n \"@Method(selector = \\\"stringFromDate:toDate:\\\")\\n public native String format(NSDate fromDate, NSDate toDate);\",\n \"public String dateStr(String date) {\\n\\t\\treturn AnalyticsUDF.dateFormatter(date);\\n\\t}\",\n \"private String formatDate(String dateString) {\\n DateTimeFormatter dateTimeFormatter = DateTimeFormatter.ofPattern(\\\"LLL dd, yyyy\\\");\\n LocalDate localDate = LocalDate.parse(dateString.substring(0, 10));\\n return dateTimeFormatter.format(localDate);\\n }\",\n \"public static String formatDateU(java.sql.Date date){\\n\\t\\treturn date!=null?toTheString(date):\\\"unknown\\\";\\n\\t}\",\n \"java.lang.String getDate();\",\n \"public static String formatterDate(Date date){\\n\\t\\tString retour = null;\\n\\t\\tif(date != null){\\n\\t\\t\\tretour = dfr.format(date);\\n\\t\\t}\\n\\t\\treturn retour;\\n\\t}\",\n \"public static String getFormattedDateString(Date date, String format) {\\n Calendar cal = Calendar.getInstance();\\n TimeZone timeZone = cal.getTimeZone();\\n\\n SimpleDateFormat dateFormat = new SimpleDateFormat(format);\\n dateFormat.setTimeZone(timeZone);\\n\\n return dateFormat.format(date);\\n }\",\n \"protected String formatDateToString(Date date) {\\n\\t\\tSimpleDateFormat format = new SimpleDateFormat(\\\"yyyy.MM.dd HH:mm:ss\\\");\\n\\t\\tString formatted = format.format(date);\\n\\t\\treturn formatted;\\n\\t}\",\n \"private String getFormattedDate(String date) {\\n SimpleDateFormat dateFormat = new SimpleDateFormat(getString(R.string.received_import_date_format));\\n SimpleDateFormat desiredDateFormat = new SimpleDateFormat(getString(R.string.desired_import_date_format));\\n Date parsedDate;\\n try {\\n parsedDate = dateFormat.parse(date);\\n return desiredDateFormat.format(parsedDate);\\n } catch (ParseException e) {\\n // Return an empty string in case of issues parsing the date string received.\\n e.printStackTrace();\\n return \\\"\\\";\\n }\\n }\",\n \"public static java.sql.Date toSqlDate(Object obj, String pattern) {\\n return toSqlDate(obj, pattern, (TimeZone) null);\\n }\",\n \"private String formatDate(Date dateObject) {\\n SimpleDateFormat dateFormat = new SimpleDateFormat(\\\"LLL dd, yyyy\\\", Locale.getDefault());\\n return dateFormat.format(dateObject);\\n }\",\n \"public static String formatDate(Date date) {\\n\\t\\tString newstring = new SimpleDateFormat(\\\"MM-dd-yyyy\\\").format(date);\\n\\t\\treturn newstring;\\n\\t}\",\n \"public static String fromDate(String s){\\n \\t\\t\\n \\t\\tString[] date = s.split(\\\"T\\\");\\n \\t\\tString time = date[1].substring(0,5);\\n \\t\\tString[] dates = date[0].split(\\\"-\\\"); \\n \\t\\tString month = dates[1];\\n \\t\\tString day = dates[2];\\n \\t\\t\\n \\t\\treturn day + \\\"/\\\" + month + \\\", kl: \\\" + time;\\n \\t}\",\n \"public static DateTimeFormatter forStrptimePattern(String pattern) {\\n if (pattern == null || pattern.length() == 0)\\n throw new IllegalArgumentException(\\\"Empty date time pattern specification\\\");\\n\\n DateTimeFormatterBuilder builder = new DateTimeFormatterBuilder();\\n parseToBuilder(builder, pattern);\\n DateTimeFormatter formatter = builder.toFormatter();\\n\\n return formatter;\\n }\",\n \"String getDate();\",\n \"String getDate();\",\n \"public static String getDate(Date date)\\n\\t{\\n\\t\\treturn getFormatString(date, getDateFormat());\\n\\t}\",\n \"public static String getDateAsString(Date date) {\\r\\n\\t\\tSimpleDateFormat dateform = new SimpleDateFormat(_dateFormat);\\r\\n\\r\\n\\t\\treturn dateform.format(date);\\r\\n\\t}\",\n \"public String getFormatedDate(Date date) {\\r\\n\\t\\tSimpleDateFormat sdf=new SimpleDateFormat(\\\"dd/mm/yyyy\\\");\\r\\n\\t\\treturn sdf.format(date);\\r\\n\\t}\",\n \"public static String convert( Date date )\\r\\n {\\r\\n SimpleDateFormat simpleDateFormat = new SimpleDateFormat( \\\"yyyy-MM-dd\\\" );\\r\\n\\r\\n return simpleDateFormat.format( date );\\r\\n }\",\n \"public static String formatToString(long unixTimeInSecond, String pattern) {\\n if (StringUtils.isBlank(pattern)) {\\n pattern = DEFAULT_TIME_PATTERN;\\n }\\n LocalDateTime dateTime = LocalDateTime.ofInstant(Instant.ofEpochSecond(unixTimeInSecond), ZoneOffset.systemDefault());\\n return DateTimeFormatter.ofPattern(pattern).format(dateTime);\\n }\",\n \"public java.sql.Date format(String date) {\\n int i = 0;\\n int dateAttr[];\\n dateAttr = new int[3];\\n for(String v : date.split(\\\"/\\\")) {\\n dateAttr[i] = Integer.parseInt(v);\\n i++;\\n }\\n\\n GregorianCalendar gcalendar = new GregorianCalendar();\\n gcalendar.set(dateAttr[2], dateAttr[0]-1, dateAttr[1]); // Year,Month,Day Of Month\\n java.sql.Date sdate = new java.sql.Date(gcalendar.getTimeInMillis());\\n return sdate;\\n }\",\n \"public String formatDate (Date date){\\r\\n\\t\\tDateFormat df = new SimpleDateFormat(\\\"EEE, d MMM yyyy HH:mm:ss z\\\", Locale.ENGLISH);\\r\\n\\t\\treturn df.format(date);\\r\\n\\t}\",\n \"public static String formatDate(java.sql.Date date){\\n\\t\\treturn date!=null?toTheString(date):\\\"\\\";\\n\\t}\",\n \"private String formatDate(Date date) {\\n String resultDate;\\n SimpleDateFormat dateFormat;\\n dateFormat = new SimpleDateFormat(\\\"dd/MM/yyyy\\\");\\n resultDate = dateFormat.format(date);\\n return resultDate;\\n }\",\n \"public static String dateToStringFormat(Calendar calendar, String format){\\n SimpleDateFormat simpleDateFormat = new SimpleDateFormat(format);\\n return simpleDateFormat.format(calendar.getTime());\\n }\",\n \"private static String toString(int year, int month, int day) {\\n\\n // Use a buffer to create the string\\n StringBuffer buffer = new StringBuffer(8);\\n\\n // Append the year\\n if (year < 10) {\\n buffer.append(\\\"000\\\");\\n } else if (year < 100) {\\n buffer.append(\\\"00\\\");\\n } else if (year < 1000) {\\n buffer.append('0');\\n }\\n buffer.append(year);\\n\\n // Append the month\\n if (month < 10) {\\n buffer.append('0');\\n }\\n buffer.append(month);\\n\\n // Append the day\\n if (day < 10) {\\n buffer.append('0');\\n }\\n buffer.append(day);\\n\\n return buffer.toString();\\n }\",\n \"@Override\\n\\tpublic String toString() {\\n\\t\\ttry {\\n\\t\\t\\tSimpleDateFormat formatter = new SimpleDateFormat(\\\"MM/dd/yyyy\\\");\\n\\t\\t\\tDate date = formatter.parse(month + \\\"/\\\" + day + \\\"/\\\" + year);\\n\\n\\t\\t\\treturn formatter.format(date);\\n\\t\\t} catch (Exception e) {\\n\\t\\t\\tthrow new RuntimeException(e);\\n\\t\\t}\\n\\t}\",\n \"public String getStringDate(){\\n String finalDate = \\\"\\\";\\n Locale usersLocale = Locale.getDefault();\\n DateFormatSymbols dfs = new DateFormatSymbols(usersLocale);\\n String weekdays[] = dfs.getWeekdays();\\n int day = date.get(Calendar.DAY_OF_WEEK);\\n String nameOfDay = weekdays[day];\\n\\n finalDate += nameOfDay + \\\" \\\" + date.get(Calendar.DAY_OF_MONTH) + \\\", \\\";\\n\\n String months[] = dfs.getMonths();\\n int month = date.get(Calendar.MONTH);\\n String nameOfMonth = months[month];\\n\\n finalDate += nameOfMonth + \\\", \\\" + date.get(Calendar.YEAR);\\n\\n return finalDate;\\n }\",\n \"public static String getStrDate(Date date) {\\n //TODO get date\\n SimpleDateFormat formatter;\\n if (DateUtils.isToday(date.getTime())) {\\n formatter = new SimpleDateFormat(\\\"HH:mm\\\");\\n return formatter.format(date);\\n }\\n formatter = new SimpleDateFormat(\\\"MMM dd\\\");\\n return formatter.format(date);\\n }\",\n \"public String dateFormatter(String fromDate) {\\n\\t\\tString newDateString=\\\"\\\";\\n\\t\\ttry {\\n\\t\\t\\tfinal String oldFormat = \\\"yyyy/MM/dd\\\";\\n\\t\\t\\tfinal String newFormat = \\\"yyyy-MM-dd\\\";\\n\\t\\t\\tSimpleDateFormat sdf = new SimpleDateFormat(oldFormat);\\n\\t\\t\\tDate d = sdf.parse(fromDate);\\n\\t\\t\\tsdf.applyPattern(newFormat);\\n\\t\\t\\tnewDateString = sdf.format(d);\\n\\t\\t} catch(Exception exp) {\\n\\t\\t\\tthrow ExceptionUtil.getYFSException(ExceptionLiterals.ERRORCODE_INVALID_DATE, exp);\\n\\t\\t}\\n\\t\\treturn newDateString;\\n\\t}\",\n \"public String getDateString(Date date) {\\n Calendar cal = Calendar.getInstance();\\n\\n cal.setTime(date);\\n int year = cal.get(Calendar.YEAR);\\n String month = String.format(\\\"%02d\\\", cal.get(Calendar.MONTH) + 1);\\n String day = String.format(\\\"%02d\\\", cal.get(Calendar.DAY_OF_MONTH));\\n return year + month + day;\\n }\",\n \"public static String formatDate(Calendar date, DateFormat format) {\\n\\n switch (format) {\\n case COMPLETE_DATE_FORMAT:\\n format = DateFormat.COMPLETE_DATE_FORMAT;\\n break;\\n case DAY_FORMAT:\\n format = DateFormat.DAY_FORMAT;\\n break;\\n }\\n\\n SimpleDateFormat dateFormatter = new SimpleDateFormat(format.getFormat(), Locale.US);\\n\\n return dateFormatter.format(date.getTime());\\n }\",\n \"private String formatDate(String date)\\n\\t{\\n\\t\\tif(date == null || date.isEmpty())\\n\\t\\t{\\n\\t\\t\\treturn \\\"\\\";\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tString[] dateSplit = date.split(\\\"/\\\");\\n\\t\\t\\tif(dateSplit.length != 3)\\n\\t\\t\\t{\\n\\t\\t\\t\\treturn \\\"\\\";\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\treturn getMonthName(dateSplit[0]) + \\\" \\\"+ dateSplit[1]+\\\", \\\"+ dateSplit[2];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.8005487","0.7416862","0.7283096","0.7163661","0.70958173","0.70723426","0.6571093","0.65497774","0.6296196","0.61360383","0.6113263","0.6046777","0.6011517","0.59892505","0.5979728","0.5913717","0.5908517","0.5901056","0.5875054","0.5874348","0.5867673","0.58613604","0.58308756","0.58186454","0.5812609","0.58111656","0.580759","0.5751799","0.57500327","0.57472","0.57361424","0.5713485","0.5704553","0.5680443","0.56473744","0.56392324","0.5632651","0.5631565","0.56232","0.5611041","0.55978465","0.55934644","0.55832034","0.5566068","0.55635107","0.5534174","0.5530577","0.5527725","0.5522139","0.55097324","0.55056596","0.5462446","0.5456043","0.5455127","0.54485404","0.54357344","0.5430631","0.542966","0.5425687","0.5424553","0.54184604","0.54182845","0.54108983","0.5406839","0.5391986","0.53882986","0.5374705","0.53706217","0.5364299","0.5357174","0.5353532","0.5353124","0.5342692","0.53386337","0.5335802","0.533475","0.53296787","0.532229","0.5321082","0.5302743","0.5298221","0.5298221","0.5292962","0.5292539","0.52864563","0.5285505","0.52849466","0.527898","0.5278626","0.5276619","0.5272451","0.52675116","0.5267232","0.5266506","0.5263754","0.5259917","0.5256444","0.5240094","0.5239505","0.52355045"],"string":"[\n \"0.8005487\",\n \"0.7416862\",\n \"0.7283096\",\n \"0.7163661\",\n \"0.70958173\",\n \"0.70723426\",\n \"0.6571093\",\n \"0.65497774\",\n \"0.6296196\",\n \"0.61360383\",\n \"0.6113263\",\n \"0.6046777\",\n \"0.6011517\",\n \"0.59892505\",\n \"0.5979728\",\n \"0.5913717\",\n \"0.5908517\",\n \"0.5901056\",\n \"0.5875054\",\n \"0.5874348\",\n \"0.5867673\",\n \"0.58613604\",\n \"0.58308756\",\n \"0.58186454\",\n \"0.5812609\",\n \"0.58111656\",\n \"0.580759\",\n \"0.5751799\",\n \"0.57500327\",\n \"0.57472\",\n \"0.57361424\",\n \"0.5713485\",\n \"0.5704553\",\n \"0.5680443\",\n \"0.56473744\",\n \"0.56392324\",\n \"0.5632651\",\n \"0.5631565\",\n \"0.56232\",\n \"0.5611041\",\n \"0.55978465\",\n \"0.55934644\",\n \"0.55832034\",\n \"0.5566068\",\n \"0.55635107\",\n \"0.5534174\",\n \"0.5530577\",\n \"0.5527725\",\n \"0.5522139\",\n \"0.55097324\",\n \"0.55056596\",\n \"0.5462446\",\n \"0.5456043\",\n \"0.5455127\",\n \"0.54485404\",\n \"0.54357344\",\n \"0.5430631\",\n \"0.542966\",\n \"0.5425687\",\n \"0.5424553\",\n \"0.54184604\",\n \"0.54182845\",\n \"0.54108983\",\n \"0.5406839\",\n \"0.5391986\",\n \"0.53882986\",\n \"0.5374705\",\n \"0.53706217\",\n \"0.5364299\",\n \"0.5357174\",\n \"0.5353532\",\n \"0.5353124\",\n \"0.5342692\",\n \"0.53386337\",\n \"0.5335802\",\n \"0.533475\",\n \"0.53296787\",\n \"0.532229\",\n \"0.5321082\",\n \"0.5302743\",\n \"0.5298221\",\n \"0.5298221\",\n \"0.5292962\",\n \"0.5292539\",\n \"0.52864563\",\n \"0.5285505\",\n \"0.52849466\",\n \"0.527898\",\n \"0.5278626\",\n \"0.5276619\",\n \"0.5272451\",\n \"0.52675116\",\n \"0.5267232\",\n \"0.5266506\",\n \"0.5263754\",\n \"0.5259917\",\n \"0.5256444\",\n \"0.5240094\",\n \"0.5239505\",\n \"0.52355045\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.54833686"},"document_rank":{"kind":"string","value":"51"}}},{"rowIdx":29392,"cells":{"query":{"kind":"string","value":"/ finds the shortest path in a graph using bellmanford Algorithm."},"document":{"kind":"string","value":"public int[] findMinimunPathBF(int src, int[][] graph) {\r\n\t\t// The distance from the src to each vertices.\r\n\t\tint[] dist = new int[graph.length];\r\n\t\t// Maximizing the distance of the sre to all the vertices.\r\n\t\tfor (int i = 0; i < dist.length; i++) {\r\n\t\t\tdist[i] = Integer.MAX_VALUE;\r\n\t\t}\r\n\t\tdist[src] = 0;\r\n\r\n\t\t// Loop |v|-1 times, For each edge in the graph.\r\n\t\tfor (int k = 0; k < graph.length - 1; k++) {\r\n\t\t\t// For each edge in the graph. \r\n\t\t\tfor (int i = 0; i < graph.length; i++) {\r\n\t\t\t\tfor (int j = 0; j < graph.length; j++) {\r\n\t\t\t\t\t// Relax edge(i, j).\r\n\t\t\t\t\tif (graph[i][j] != 0) {\r\n\t\t\t\t\t\tif (dist[i] != Integer.MAX_VALUE\r\n\t\t\t\t\t\t\t\t&& dist[j] > dist[i] + graph[i][j]) {\r\n\t\t\t\t\t\t\tdist[j] = dist[i] + graph[i][j];\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t// Check if there is a negative cycle, loop the edges.\r\n\t\tfor (int i = 0; i < graph.length; i++) {\r\n\t\t\t// For each edge in the graph.\r\n\t\t\tfor (int j = 0; j < graph.length; j++) {\r\n\t\t\t\tif (graph[i][j] != 0) {\r\n\t\t\t\t\t// Still can relax the edges?.\r\n\t\t\t\t\tif (dist[i] != Integer.MAX_VALUE\r\n\t\t\t\t\t\t\t&& dist[j] > dist[i] + graph[i][j]) {\r\n\t\t\t\t\t\t// Put a sign of having a negative cycle.\r\n\t\t\t\t\t\tdist[0] = Integer.MIN_VALUE;\r\n\t\t\t\t\t\treturn dist;\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 dist;\r\n\t}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["void bellman_ford(int s)\n {\n int dist[]=new int[V]; \n \n //to track the path from s to all\n int parent[]=new int[V] ;\n //useful when a vertex has no parent\n for(int i=0;i<V;i++)\n parent[i]=-2;\n \n for(int i=0;i<V;i++) \n dist[i]=INF;\n \n //start from source vertex\n dist[s]=0;\n parent[s]=-1;\n \n //we have to iterate over all the edges for V-1 times\n //each ith iteration finds atleast ith path length dist\n //worst case each ith will find ith path length \n \n for(int i=1;i<V;i++) \n {\n for(int j=0;j<E;j++)\n {\n //conside for all edges (u,v), wt\n int u=edge[j].src;\n int v=edge[j].dest;\n int wt=edge[j].wt; \n //since dist[u]=INF and adding to it=>overflow, therefore check first\n if( dist[u]!=INF && dist[u]+wt < dist[v])\n {\n dist[v]=dist[u]+wt;\n parent[v]=u;\n } \n }\n }\n \n //iterate for V-1 times, one more iteration necessarily gives a path length of atleast V in W.C=>cycle\n for(int j=0;j<E;j++) \n {\n int u=edge[j].src;\n int v=edge[j].dest;\n int wt=edge[j].wt;\n if( dist[u]!=INF && dist[u]+wt < dist[v])\n {\n System.out.println(\"Graph has cycle\");\n return;\n } \n }\n \n //print the distance to all from s\n System.out.println(\"from source \"+s+\" the dist to all other\");\n print_dist(dist); \n print_path(parent,dist,s); \n \n }","private static void bellmanfordTest() {\n\t\t\n\t\tgraphs.objectorientedgraph.Graph<Integer> graph = new graphs.objectorientedgraph.Graph<Integer>();\n\t\t\n\t\tfor (int i = 0; i < 6; i++)\n\t\t\tgraph.addVertex(i, i);\n\t\t\n\t\tgraph.addDirectedEdge(0, 1, 0);\n\t\tgraph.addDirectedEdge(0, 2, 0);\n\t\tgraph.addDirectedEdge(0, 3, 0);\n\t\tgraph.addDirectedEdge(0, 4, 0);\n\t\tgraph.addDirectedEdge(0, 5, 0);\n\t\tgraph.addDirectedEdge(5, 1, -1);\n\t\tgraph.addDirectedEdge(5, 2, 1);\n\t\tgraph.addDirectedEdge(1, 4, 4);\n\t\tgraph.addDirectedEdge(1, 3, 5);\n\t\tgraph.addDirectedEdge(2, 1, 0);\n\t\tgraph.addDirectedEdge(3, 5, -3);\n\t\tgraph.addDirectedEdge(3, 4, -1);\n\t\tgraph.addDirectedEdge(4, 5, -3);\n\t\t\n\t\tBellmanFordAlgo<Integer> bellnBellmanFordAlgo = new BellmanFordAlgo(graph ,graph.vertexList.get(0));\n\t\t\n\t\tbellnBellmanFordAlgo.getSingleSourceShortestPath();\n\t\t\n\t\tbellnBellmanFordAlgo.printPath(graph.vertexList.get(3));\n\t\t\n\t}","public void bellman_ford(int input)\n{\n this.minimumTree = this._getKruskalTree(false);\n /*\n * Lets write the heritage of our minimum spanning tree to our Bellman Ford\n * arrays, and see what happens.\n */\n while (0 != minimumTree.size()) {\n Edge nextEdge = minimumTree.remove();\n this.bellmanParent[nextEdge.destVert] = nextEdge.srcVert;\n this.bellmanDistance[nextEdge.destVert] = nextEdge.distance;\n }\n System.out.println(\"shortest path \\t\\t\\t weight\");\n /*\n * We need to find the immediate children for the input vertex, and see how\n * far that gets us. Depending upon where the input is in the minimum\n * spanning tree, only a subtree may be accessible since this is a directed\n * graph.\n */\n for (int loop = 0;\n loop < this.nVerts;\n loop++\n ) {\n LinkedList<Integer> output = this._findShortestPath(input, loop);\n Integer result = output.removeFirst();\n int weight = 0;\n if (-1 == result) {\n continue;\n }\n System.out.print(this.vertexList[result].label);\n weight += this.bellmanDistance[result];\n while (0 != output.size()) {\n result = output.removeFirst();\n weight += this.bellmanDistance[result];\n System.out.print(\" -> \" + this.vertexList[result].label);\n }\n System.out.println(\" \\t\\t\\t\\t \" + weight);\n }\n}","@Override\n\tpublic void bellmanFord(IWeightedGraph<N, E> graph, int startnode) {\n\t\tif(graph == null){\n\t\t\tthrow new NullPointerException();\n\t\t}else if (startnode < 0 || startnode > graph.numberOfNodes()-1){\n\t\t\tthrow new IllegalArgumentException();\n\t\t}\n\n\n\t\tfor(int i= 0; i<shortestPaths.length;i++){\n\t\t\tshortestPaths[i] = Double.POSITIVE_INFINITY;\n\t\t}\n\t\tshortestPaths[startnode] = 0;\n\n\t\tfor(int i= 1; i<graph.numberOfNodes(); i++){\n\t\t\tIterator<IEdge<E>> edgesIterator = graph.edgeIterator();\n\t\t\twhile(edgesIterator.hasNext()){\n\t\t\t\tIEdge<E> edge = edgesIterator.next();\n\t\t\t\tif(shortestPaths[edge.getSource()] + edge.getWeight() < shortestPaths[edge.getDestination()]){\n\t\t\t\t\tshortestPaths[edge.getDestination()] = shortestPaths[edge.getSource()] + edge.getWeight();\n\t\t\t\t\tpreviousNode[edge.getDestination()] = edge.getSource();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t}","int[] bfs(int[][] graph,int source){\n int len=graph.length;\n int shortest_path[]=new int[len];\n int parent[]=new int[len];\n Arrays.fill(shortest_path, Integer.MAX_VALUE/2);\n shortest_path[source]=0;\n Queue<Integer> q=new LinkedList<>();\n q.add(source);\n while (!q.isEmpty()) { \n int u=q.poll();\n for(int v:graph[u]){\n if(shortest_path[v]==Integer.MAX_VALUE/2){\n q.add(v);\n shortest_path[v]=shortest_path[u]+1;\n parent[v]=u;\n }\n }\n }\n return shortest_path;\n }","void shortestPath( final VertexType fromNode, Integer node );","private static void shortestPath(Graph graph, Character startNode, int algorithm) {\n Node currentNode = graph.getNode(startNode);\n\n // keep track of the nodes visited\n List<Character> nodesVisited = new ArrayList<>();\n\n // add the current node\n nodesVisited.add(currentNode.getName());\n\n // breadth first search to help keep track of the nodes we have already visited\n // helps with backtracking\n Stack<Node> visitingNodes = new Stack<>();\n\n // loop through the graph\n while (currentNode != graph.getNode('Z')) {\n // we have visited a node\n // add it to the stack\n // set true to since its been visited and it will be in the shortest path\n visitingNodes.add(currentNode);\n currentNode.setNodeVisited(true);\n currentNode.setInShortestPath(true);\n\n // get all the edges that are connected to the current node we are on\n List<Edge> adjacentNodes = currentNode.getNeighbors();\n\n // temp for next node\n Node nextNode = null;\n int weightDistanceTotal = Integer.MAX_VALUE;\n\n for (Edge i: adjacentNodes) {\n // testing\n // System.out.println(i.destination.getName());\n // System.out.println(i.destination.getDistanceToZ());\n\n // 1. always check to see if we have visited the node\n if (i.destination.isNodeVisited()) {\n // System.out.println(i.destination.getName() + \" is already in the path\");\n continue;\n }\n\n // 2. assign the next node to the destination\n if (nextNode == null) {\n nextNode = i.destination;\n }\n\n // compare distances\n if (algorithm == 1) {\n nextNode = updateNextNodeAlgo1(nextNode, i.destination);\n } else {\n NodeWithWeightDistanceTotal nodeWithWeightDistanceTotal = updateNextNodeAlgo2(nextNode, i, weightDistanceTotal);\n nextNode = nodeWithWeightDistanceTotal.node;\n weightDistanceTotal = nodeWithWeightDistanceTotal.weightDistanceTotal;\n }\n //if (nextNode.getDistanceToZ() > i.destination.getDistanceToZ()) {\n // nextNode = i.destination;\n //}\n }\n\n // next has no other edges\n if (nextNode == null) {\n // System.out.println(\"There no place to go from \" + currentNode.getName());\n // pop off the node we just visited\n nextNode = visitingNodes.pop();\n // its not in the shortest path to Z\n nextNode.setInShortestPath(false);\n // set the next node to the previous node\n nextNode = visitingNodes.pop();\n }\n\n // add the nodes we visit to keep track of the path\n nodesVisited.add(nextNode.getName());\n\n // System.out.println(Arrays.toString(nodesVisited.toArray()));\n // testing purposes to see if the node is on the shortest path\n\n// for (Character node: nodesVisited) {\n// Node boolVisit = graph.getNode(node);\n// System.out.println(boolVisit.isInShortestPath());\n// }\n\n // progress to the next node\n currentNode = nextNode;\n // when visiting the last node mark z in the shortest path\n if (currentNode.getName() == 'Z') {\n currentNode.setInShortestPath(true);\n }\n // testing\n // System.out.println(\"next node = \" + currentNode.getName());\n }\n\n // keep track of the path visited and the total addition of weights\n int pathCounter = 0;\n\n // construct the shortest path\n List<Node> shortestPath = new ArrayList<>();\n\n for (Character nodeVisitor: nodesVisited) {\n // get the node\n Node node = graph.getNode(nodeVisitor);\n\n // add to the shortest path\n if (node.isInShortestPath() && !shortestPath.contains(node)) {\n shortestPath.add(node);\n }\n }\n\n // print the shortest path\n for (int i = 0; i < shortestPath.size() - 1; i++) {\n currentNode = shortestPath.get(i);\n Node nextNode = shortestPath.get(i + 1);\n\n // find the weight of that node\n int weight = currentNode.findWeight(nextNode);\n pathCounter += weight;\n\n // System.out.println(\"weight \" + weight);\n // System.out.println(\"path total \" + pathCounter);\n }\n\n // final output\n String fullPathSequence = \"\";\n String shortestPathSequence = \"\";\n\n for (int i = 0; i < nodesVisited.size(); i++) {\n if (i != nodesVisited.size() - 1) {\n fullPathSequence += nodesVisited.get(i) + \" -> \";\n }\n }\n\n fullPathSequence += nodesVisited.get(nodesVisited.size() - 1);\n\n for (int i = 0; i < shortestPath.size(); i++) {\n if (i != shortestPath.size() - 1) {\n shortestPathSequence += shortestPath.get(i).getName() + \" -> \";\n }\n }\n\n if (currentNode.getName() == 'Z') {\n shortestPathSequence += \"Z\";\n } else {\n shortestPathSequence += shortestPath.get(shortestPath.size() - 1).getName();\n }\n\n System.out.println(\"Algorithm \" + algorithm + \" : \");\n System.out.println(\"Sequence of all nodes \" + fullPathSequence);\n System.out.println(\"Shortest path: \" + shortestPathSequence);\n System.out.println(\"Shortest path length: \" + pathCounter);\n System.out.println(\"\\n\");\n\n // reset the graph\n graph.graphReset();\n\n }","public void shortestPathsNodes() {\n for (int sourceNode = 0; sourceNode < wordGraph.V(); sourceNode++) {\n BreadthFirstDirectedPaths bfs = new BreadthFirstDirectedPaths(wordGraph, sourceNode);\n\n for (int goalNode = 0; goalNode < wordGraph.V(); goalNode++) {\n Iterable<Integer> shortestPath = bfs.pathTo(goalNode);\n int pathLength = -1;\n if (shortestPath != null) {\n for (int edge : shortestPath) {\n pathLength++;\n }\n }\n if (pathLength != -1) {\n }\n System.out.println(pathLength);\n }\n }\n }","void BFS(int s, int d) \r\n { \r\n int source = s;\r\n int destination = d;\r\n boolean visited[] = new boolean[V];\r\n int parent[] = new int[V];\r\n \r\n // Create a queue for BFS \r\n LinkedList<Integer> queue = new LinkedList<Integer>(); \r\n \r\n // Mark the current node as visited and enqueue it \r\n \r\n visited[s]=true; \r\n queue.add(s); \r\n System.out.println(\"Search Nodes: \");\r\n while (queue.size() != 0) \r\n { \r\n int index = 0;\r\n \r\n // Dequeue a vertex from queue and print it \r\n \r\n s = queue.poll();\r\n \r\n System.out.print(convert2(s)); \r\n \r\n if(s == destination)\r\n {\r\n break;\r\n }\r\n \r\n System.out.print(\" -> \");\r\n while(index < adj[s].size()) \r\n { \r\n \r\n \r\n int n = adj[s].get(index); \r\n if (!visited[n]) \r\n { \r\n visited[n] = true;\r\n parent[n] = s;\r\n queue.add(n); \r\n }\r\n index = index+ 2;\r\n \r\n \r\n }\r\n \r\n \r\n \r\n }\r\n int check = destination;\r\n int cost = 0, first, second = 0;\r\n String string = \"\" + convert2(check);\r\n while(check!=source)\r\n {\r\n \r\n first = parent[check];\r\n string = convert2(first) + \" -> \" + string;\r\n while(adj[first].get(second) != check)\r\n {\r\n second++;\r\n }\r\n cost = cost + adj[first].get(second +1);\r\n check = first;\r\n second = 0;\r\n \r\n }\r\n \r\n System.out.println(\"\\n\\nPathway: \");\r\n \r\n System.out.println(string);\r\n \r\n \r\n System.out.println(\"\\nTotal cost: \" + cost);\r\n }","void dijkstra(int[][] graph){\r\n int dist[] = new int[rideCount];\r\n Boolean sptSet[] = new Boolean[rideCount];\r\n\r\n for(int i = 0; i< rideCount; i++){\r\n dist[i] = Integer.MAX_VALUE;\r\n sptSet[i] = false;\r\n }\r\n\r\n dist[0] = 0;\r\n\r\n for(int count = 0; count< rideCount -1; count++){\r\n int u = minWeight(dist, sptSet);\r\n sptSet[u] = true;\r\n for(int v = 0; v< rideCount; v++){\r\n if (!sptSet[v] && graph[u][v] != 0 && dist[u] + graph[u][v] < dist[v]){\r\n dist[v] = dist[u] + graph[u][v];\r\n }\r\n }\r\n }\r\n printSolution(dist);\r\n }","public int doDijkstras(String startVertex, String endVertex, ArrayList<String> shortestPath)\r\n\t{\r\n\t\tif(!this.dataMap.containsKey(startVertex) || !this.dataMap.containsKey(endVertex))\r\n\t\t{\r\n\t\t\tthrow new IllegalArgumentException(\"Vertex does not exist in the graph!\");\r\n\t\t}\r\n\t\t\r\n\t\t\r\n\t\tSet<String> visited = new HashSet<String>();\r\n\t\t\r\n\t\tPriorityQueue<Vertex> minDist = new PriorityQueue<Vertex>();\r\n\t\t\r\n\t\tVertex firstV = new Vertex(startVertex,startVertex,0);\r\n\t\tminDist.add(firstV);\r\n\t\t\r\n\t\tfor(String V : this.adjacencyMap.get(startVertex).keySet())\r\n\t\t{\r\n\t\t\tminDist.add(new Vertex(V,startVertex,this.getCost(startVertex, V)));\r\n\t\t}\r\n\t\t\r\n\t\t\r\n\t\t//map of vertexName --> VertexObject\r\n\t\tHashMap<String, Vertex> mapV = new HashMap<String,Vertex>();\r\n\t\tmapV.put(startVertex, firstV);\t\r\n\t\t\r\n\t\t/*\r\n\t\t * Init keys-->costs\r\n\t\t */\r\n\t\tfor(String key : this.getVertices())\r\n\t\t{\r\n\t\t\tif(key.equals(startVertex))\r\n\t\t\t{\r\n\t\t\t\tmapV.put(key, new Vertex(key,null,0));\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tmapV.put(key, new Vertex(key,null,Integer.MAX_VALUE));\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\r\n\t\t/*\r\n\t\t * Init List for shortest path\r\n\t\t */\r\n\t\tLinkedList<String> list = new LinkedList<String>();\r\n\t\tlist.add(startVertex);\r\n\r\n\t\tHashMap<String,List<String>> path = new HashMap<String,List<String>>();\r\n\t\tpath.put(startVertex, list);\r\n\t\t\r\n\t\twhile(!minDist.isEmpty())\r\n\t\t{\r\n\t\t\tVertex node = minDist.poll();\r\n\t\t\tString V = node.current;\r\n\t\t\tint minimum = node.cost;\r\n\t\t\tSystem.out.println(minDist.toString());\r\n\t\t\t\r\n\t\t\t\tvisited.add(V);\r\n\t\t\t\t\r\n\t\t\t\tTreeSet<String> adj = new TreeSet<String>(this.adjacencyMap.get(V).keySet());\r\n\t\t\t\t\r\n\t\t\t\tfor(String successor : adj)\r\n\t\t\t\t{\r\n\t\t\t\t\tif(!visited.contains(successor) && !V.equals(successor))\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\t\tint newCost = this.getCost(V, successor)+minimum;\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tif(newCost < mapV.get(successor).cost)\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tminDist.remove(mapV.get(successor));\r\n\t\t\t\t\t\t\t\tminDist.add(new Vertex(successor,V,newCost));\r\n\t\t\t\t\t\t\t\tmapV.put(successor, new Vertex(successor,V,newCost));\r\n\r\n\t\t\t\t\t\t\t\tLinkedList<String> newList = new LinkedList<String>(path.get(V));\r\n\t\t\t\t\t\t\t\tnewList.add(successor);\r\n\t\t\t\t\t\t\t\tpath.put(successor, newList);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\tint smallestPath = mapV.get(endVertex).cost == Integer.MAX_VALUE ? -1 : mapV.get(endVertex).cost;\r\n\t\t\r\n\t\tif(smallestPath == -1)\r\n\t\t{\r\n\t\t\tshortestPath.add(\"None\");\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tfor(String node : path.get(endVertex))\r\n\t\t\t{\r\n\t\t\t\tshortestPath.add(node);\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\treturn smallestPath;\r\n\t}","ShortestPath(UndirectedWeightedGraph graph, String startNodeId, String endNodeId) throws NotFoundNodeException {\r\n\t\t\r\n\t\tif (!graph.containsNode(startNodeId)) {\r\n\t\t\tthrow new NotFoundNodeException(graph, startNodeId);\r\n\t\t}\t\t\r\n\t\tif (!graph.containsNode(endNodeId)) {\r\n\t\t\tthrow new NotFoundNodeException(graph, endNodeId);\r\n\t\t}\t\r\n\r\n\t\tsrc = startNodeId;\r\n\t\tdst = endNodeId;\r\n\t\t\r\n\t\tif (endNodeId.equals(startNodeId)) {\r\n\t\t\tlength = 0;\r\n\t\t\tnumOfPath = 1;\r\n\t\t\tArrayList<String> path = new ArrayList<String>();\r\n\t\t\tpath.add(startNodeId);\r\n\t\t\tpathList.add(path);\r\n\t\t}\r\n\t\telse {\r\n\t\t\t// create a HashMap of updated distance from the starting node to every node\r\n\t\t\t// initially it is 0, inf, inf, inf, ...\r\n\t\t\tHashMap<String, Double> distance = new HashMap<String, Double>();\t\r\n\t\t\tfor (String nodeId : graph.getNodeList().keySet()) {\r\n\t\t\t\tif (nodeId.equals(startNodeId)) {\r\n\t\t\t\t\t// the starting node will always have 0 distance from itself\r\n\t\t\t\t\tdistance.put(nodeId, 0.0);\r\n\t\t\t\t}\r\n\t\t\t\telse {\r\n\t\t\t\t\t// the others have initial distance is infinity\r\n\t\t\t\t\tdistance.put(nodeId, Double.MAX_VALUE);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t// a HashMap of preceding node of each node\r\n\t\t\tHashMap<String, HashSet<String>> precedence = new HashMap<String, HashSet<String>>();\r\n\t\t\tfor (String nodeId : graph.getNodeList().keySet()) {\r\n\t\t\t\tif ( nodeId.equals(startNodeId) ) {\r\n\t\t\t\t\tprecedence.put(nodeId, null);\t// the start node will have no preceding node\r\n\t\t\t\t}\r\n\t\t\t\telse { \r\n\t\t\t\t\tprecedence.put(nodeId, new HashSet<String>());\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//\r\n\t\t\tSet<String> unvisitedNode = new HashSet<String>();\r\n\t\t\tfor (String nodeId : graph.getNodeList().keySet()) {\r\n\t\t\t\tunvisitedNode.add(nodeId);\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tdouble minUnvisitedLength;\r\n\t\t\tString minUnvisitedNode;\r\n\t\t\t// run loop while not all node is visited\r\n\t\t\twhile ( unvisitedNode.size() != 0 ) {\r\n\t\t\t\t// find the unvisited node with minimum current distance in distance list\r\n\t\t\t\tminUnvisitedLength = Double.MAX_VALUE;\r\n\t\t\t\tminUnvisitedNode = \"\";\r\n\t\t\t\tfor (String nodeId : unvisitedNode) {\r\n\t\t\t\t\tif (distance.get(nodeId) < minUnvisitedLength) {\r\n\t\t\t\t\t\tminUnvisitedNode = nodeId;\r\n\t\t\t\t\t\tminUnvisitedLength = distance.get(nodeId); \r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\t// if there are no node that can be visited from the unvisitedNode, break the loop \r\n\t\t\t\tif (minUnvisitedLength == Double.MAX_VALUE) {\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\t\t\t\r\n\t\t\t\t\r\n\t\t\t\t// remove the node from unvisitedNode\r\n\t\t\t\tunvisitedNode.remove(minUnvisitedNode);\r\n\t\t\t\t\r\n\t\t\t\t// update the distance of its neighbors\r\n\t\t\t\tfor (Node neighborNode : graph.getNodeList().get(minUnvisitedNode).getNeighbors().keySet()) {\r\n\t\t\t\t\tdouble distanceFromTheMinNode = distance.get(minUnvisitedNode) + graph.getNodeList().get(minUnvisitedNode).getNeighbors().get(neighborNode).getWeight();\r\n\t\t\t\t\t// if the distance of the neighbor can be shorter from the current node, change \r\n\t\t\t\t\t// its details in distance and precedence\r\n\t\t\t\t\tif ( distanceFromTheMinNode < distance.get(neighborNode.getId()) ) {\r\n\t\t\t\t\t\tdistance.replace(neighborNode.getId(), distanceFromTheMinNode);\r\n\t\t\t\t\t\t// renew the precedence of the neighbor node\r\n\t\t\t\t\t\tprecedence.put(neighborNode.getId(), new HashSet<String>());\r\n\t\t\t\t\t\tprecedence.get(neighborNode.getId()).add(minUnvisitedNode);\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if (distanceFromTheMinNode == distance.get(neighborNode.getId())) {\r\n\t\t\t\t\t\t// unlike dijkstra's algorithm, multiple path should be update into the precedence\r\n\t\t\t\t\t\t// if from another node the distance is the same, add it to the precedence\r\n\t\t\t\t\t\tprecedence.get(neighborNode.getId()).add(minUnvisitedNode);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\t\t\t\r\n\t\t\t\t\r\n\t\t\t\t// if the current node in the process is the end node, we can stop the while loop here\r\n\t\t\t\tif (minUnvisitedNode == endNodeId) {\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t\r\n\t\t\t\r\n\t\t\tif (distance.get(endNodeId) == Double.MAX_VALUE) {\r\n\t\t\t\t// in case there is no shortest path between the 2 nodes\r\n\t\t\t\tlength = 0;\r\n\t\t\t\tnumOfPath = 0;\r\n\t\t\t\tpathList = null;\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\t// other wise we have these information\r\n\t\t\t\tlength = distance.get(endNodeId);\r\n\t\t\t\t//numOfPath = this.getNumPath(precedence, startNodeId, endNodeId);\r\n\t\t\t\tpathList = this.findPathList(precedence, startNodeId, endNodeId);\r\n\t\t\t\tnumOfPath = pathList.size();\r\n\t\t\t}\r\n\t\t\t\r\n\t\t}\t// END ELSE\t\t\r\n\t}","public ShortestPath(IWeightedGraph<N,E> graph, int startNode) {\n\t\tthis.graph = graph;\n\t\tthis.startNode = startNode;\n\t\tthis.shortestPaths = new double[graph.numberOfNodes()];\n\t\tthis.previousNode = new int[graph.numberOfNodes()];\n\t\tbellmanFord(this.graph, this.startNode);\n\t}","private void computeShortestPath(){\n T current = start;\n boolean atEnd = false;\n while (!unvisited.isEmpty()&& !atEnd){\n int currentIndex = vertexIndex(current);\n LinkedList<T> neighbors = getUnvisitedNeighbors(current); // getting unvisited neighbors\n \n //what is this doing here???\n if (neighbors.isEmpty()){\n \n }\n \n // looping through to find distances from start to neighbors\n for (T neighbor : neighbors){ \n int neighborIndex = vertexIndex(neighbor); \n int d = distances[currentIndex] + getEdgeWeight(current, neighbor);\n \n if (d < distances[neighborIndex]){ // if this distance is less than previous distance\n distances[neighborIndex] = d;\n closestPredecessor[neighborIndex] = current; // now closest predecessor is current\n }\n }\n \n if (current.equals(end)){\n atEnd = true;\n }\n else{\n // finding unvisited node that is closest to start node\n T min = getMinUnvisited();\n if (min != null){\n unvisited.remove(min); // remove minimum neighbor from unvisited\n visited.add(min); // add minimum neighbor to visited\n current = min;\n }\n }\n }\n computePath();\n totalDistance = distances[vertexIndex(end)];\n }","private int bfs(String source, String destination, Map<String, List<String>> graph) {\n\n class Node {\n String word;\n int distance = 0;\n\n public Node(String word, int distance) {\n this.word = word;\n this.distance = distance;\n }\n }\n\n final Queue<Node> queue = new LinkedList<>();\n Set<String> visited = new HashSet<>();\n queue.offer(new Node(source, 0)); //distance of source to source is 0\n visited.add(source);\n\n while (!queue.isEmpty()) {\n\n final Node node = queue.poll();\n final int distance = node.distance;\n\n //if we reached the destination node\n if (node.word.equals(destination)) {\n return distance + 1;\n }\n\n //try all word which is 1 weight away\n for (String neighbour : graph.getOrDefault(node.word, new ArrayList<>())) {\n if (!visited.contains(neighbour)) {\n visited.add(neighbour);\n queue.offer(new Node(neighbour, distance + 1));\n }\n }\n\n\n }\n return 0;\n }","void shortestPaths( Set<Integer> nodes );","private int BFS() {\n adjList.cleanNodeFields();\n\n //Queue for storing current shortest path\n Queue<Node<Integer, Integer>> q = new LinkedList<>();\n\n //Set source node value to 0\n q.add(adjList.getNode(startNode));\n q.peek().key = 0;\n q.peek().d = 0;\n q.peek().visited = true;\n\n //Helper variables\n LinkedList<Pair<Node<Integer, Integer>, Integer>> neighbors;//Array of pairs <neighborKey, edgeWeight>\n Node<Integer, Integer> neighbor, u;\n long speed = (long) (cellSideLength * 1.20);\n\n while (!isCancelled() && q.size() != 0) {\n u = q.poll();\n\n //Marks node as checked\n checkedNodesGC.fillRect((u.value >> 16) * cellSideLength + 0.5f,\n (u.value & 0x0000FFFF) * cellSideLength + 0.5f,\n (int) cellSideLength - 1, (int) cellSideLength - 1);\n\n //endNode found\n if (u.value == endNode) {\n //Draws shortest path\n Node<Integer, Integer> current = u, prev = u;\n\n while ((current = current.prev) != null) {\n shortestPathGC.strokeLine((prev.value >> 16) * cellSideLength + cellSideLength / 2,\n (prev.value & 0x0000FFFF) * cellSideLength + cellSideLength / 2,\n (current.value >> 16) * cellSideLength + cellSideLength / 2,\n (current.value & 0x0000FFFF) * cellSideLength + cellSideLength / 2);\n prev = current;\n }\n return u.d;\n }\n\n //Wait after checking node\n try {\n Thread.sleep(speed);\n } catch (InterruptedException interrupted) {\n if (isCancelled())\n break;\n }\n\n //Checking Neighbors\n neighbors = adjList.getNeighbors(u.value);\n for (Pair<Node<Integer, Integer>, Integer> neighborKeyValuePair : neighbors) {\n neighbor = neighborKeyValuePair.getKey();\n //Relaxation step\n //Checks if neighbor hasn't been checked, if so the assign the shortest path\n if (!neighbor.visited) {\n //Adds checked neighbor to queue\n neighbor.key = u.d + 1;\n neighbor.d = u.d + 1; //Assign shorter path found to neighbor\n neighbor.prev = u;\n neighbor.visited = true;\n q.add(neighbor);\n }\n }\n }\n return Integer.MAX_VALUE;\n }","@Override\n public List dijkstrasShortestPath(T start, T end) {\n Vertex<T> origin = new Vertex<>(start);\n Vertex<T> destination = new Vertex<>(end);\n List<Vertex<T>> path;\n\n settledNodes = new HashSet<>();\n unSettledNodes = new HashSet<>();\n distancesBetweenNodes = new HashMap<>();\n predecessors = new HashMap<>();\n\n distancesBetweenNodes.put(origin,0);\n unSettledNodes.add(origin);\n\n while(unSettledNodes.size() > 0){\n Vertex<T> minimumWeightedVertex = getMinimum(unSettledNodes);\n settledNodes.add(minimumWeightedVertex);\n unSettledNodes.remove(minimumWeightedVertex);\n findMinimumDistance(minimumWeightedVertex);\n }\n path = getPath(destination);\n return path;\n\n }","static void BellmanFord(int[][] edges, int src) {\n int V = edges[0].length;\n int dist[] = new int[V];\n\n // Step 1: Initialize distances from src to all other\n // vertices as INFINITE\n for (int i = 0; i < V; i++)\n dist[i] = Integer.MAX_VALUE;\n dist[src] = 0;\n\n // Step 2: Relax all edges |V| - 1 times. A simple\n // shortest path from src to any other vertex can\n // have at-most |V| - 1 edges\n // var++ is the value of the variable before incrementing, whereas the result returned by ++var is the value of the variable after the increment is applied.\n for (int i = 1; i < V; i++) {\n for (int j = 0; j < V; j++) {\n for (int k = 0; k < V; k++) {\n if (j != k && edges[j][k] != Integer.MAX_VALUE) {\n int weight = edges[j][k];\n if (dist[j] != Integer.MAX_VALUE && dist[j] + weight < dist[k])\n dist[k] = dist[j] + weight;\n }\n }\n }\n }\n\n // Step 3: check for negative-weight cycles. The above\n // step guarantees shortest distances if graph doesn't\n // contain negative weight cycle. If we get a shorter\n // path, then there is a cycle.\n for (int j = 0; j < V; j++) {\n for (int k = 0; k < V; k++) {\n if (j != k && edges[j][k] != Integer.MAX_VALUE) {\n int weight = edges[j][k];\n if (dist[j] != Integer.MAX_VALUE && dist[j] + weight < dist[k])\n System.out.println(\"Graph contains negative weight cycle\");\n }\n }\n }\n System.out.println();\n }","private LinkedList<Integer> _findShortestPath(int source, int destination)\n{\n LinkedList<Integer> output = new LinkedList<Integer>();\n if (this.bellmanParent[destination] == source) {\n output.addFirst(destination);\n output.addFirst(source);\n return output;\n }\n /*\n * Our source is only part of the subtree, and we requested a node beyond\n * its reach. Lets flag it so that the calling function knows to ignore this\n * result.\n */\n if (this.bellmanParent[destination] == destination) {\n output.addFirst(-1);\n return output;\n }\n output = this._findShortestPath(source, this.bellmanParent[destination]);\n output.addLast(destination);\n return output;\n}","private static void disjkstraAlgorithm(Node sourceNode, GraphBuilder graph){\n PriorityQueue<Node> smallestDisQueue = new PriorityQueue<>(graph.nodeArr.size(), new Comparator<Node>() {\n @Override\n public int compare(Node first, Node sec) {\n if(first.distance == Integer.MAX_VALUE && sec.distance == Integer.MAX_VALUE){\n return 0;\n }\n else if(first.distance == Integer.MAX_VALUE && sec.distance != Integer.MAX_VALUE){\n return 1;\n } else if(first.distance != Integer.MAX_VALUE && sec.distance == Integer.MAX_VALUE){\n return -1;\n }\n else\n return (int) (first.distance - sec.distance);\n }\n });\n\n smallestDisQueue.add(sourceNode); //add the node to the queue\n\n // until all vertices are know get the vertex with smallest distance\n\n while(!smallestDisQueue.isEmpty()) {\n\n Node currNode = smallestDisQueue.poll();\n// System.out.println(\"Curr: \");\n// System.out.println(currNode);\n if(currNode.known)\n continue; //do nothing if the currNode is known\n\n currNode.known = true; // otherwise, set it to be known\n\n for(Edge connectedEdge : currNode.connectingEdges){\n Node nextNode = connectedEdge.head;\n if(!nextNode.known){ // Visit all neighbors that are unknown\n\n long weight = connectedEdge.weight;\n if(currNode.distance == Integer.MAX_VALUE){\n continue;\n }\n else if(nextNode.distance == Integer.MAX_VALUE && currNode.distance == Integer.MAX_VALUE) {\n continue;\n }\n\n else if(nextNode.distance> weight + currNode.distance){//Update their distance and path variable\n smallestDisQueue.remove(nextNode); //remove it from the queue\n nextNode.distance = weight + currNode.distance;\n\n smallestDisQueue.add(nextNode); //add it again to the queue\n nextNode.pathFromSouce = currNode;\n\n// System.out.println(\"Next: \");\n// System.out.println(nextNode);\n }\n }\n }\n// System.out.println(\"/////////////\");\n }\n }","public static List<GraphEdge<String, String>> shortestPath(Graph<String, String> graph, String src, String dest) {\n // ... implement BFS as described in HW6 ...\n\t Queue<GraphNode<String>> q = new LinkedList<GraphNode<String>>();\n\t \n\t // Each key in m is a visited node\n\t // Each value is a list containing the shortest path from start\n\t Map<GraphNode<String>, List<GraphEdge<String, String>>> m = new HashMap<GraphNode<String>, List<GraphEdge<String, String>>>();\n\t \n\t q.add(graph.getNode(src));\n\t m.put(graph.getNode(src), new ArrayList<GraphEdge<String, String>>());\n\t \n\t //{{Inv: m has a key for every node added to q so far\n\t //\t\t (even those that have since been removed)\n\t //\t The value associated with each key is the shortest path to that node}}\n\t while (!q.isEmpty()) {\n\t\t GraphNode<String> temp = q.remove();\n\t\t if (temp.getData().equals(dest)) {\n\t\t\t return m.get(temp);\n\t\t }\n\t\t \n\t\t Set<GraphEdge<String, String>> set = new TreeSet<GraphEdge<String, String>>();\n\t\t set.addAll(graph.getChildren(temp));\n\t\t \n\t\t for (GraphEdge<String, String> edge : set) {\n\t\t\t if (!m.containsKey(edge.getDestination())) {\n\t\t\t\t List<GraphEdge<String, String>> list = new ArrayList<GraphEdge<String, String>>(m.get(temp));\n\t\t\t\t list.add(edge);\n\t\t\t\t m.put(edge.getDestination(), list);\n\t\t\t\t q.add(edge.getDestination());\n\t\t\t }\n\t\t }\n\t }\n\t \n\t return null;\n }","public static int shortestDistance(Graph graph, Vertex a, Vertex b) {\n Set<List<Vertex>> listSetVertex=breadthFirstSearch(graph);\n int distance=graph.getVertices().size();\n for(List<Vertex> lv: listSetVertex){\n int aindex=lv.indexOf(a);\n int bindex=lv.indexOf(b);\n if(aindex>=0&&bindex>=0){\n distance=distance>Math.abs(aindex-bindex)?Math.abs(aindex-bindex):distance;\n }\n }\n return distance==graph.getVertices().size()?-1:distance;\n }","private static ArrayList<Connection> pathFindDijkstra(Graph graph, int start, int goal) {\n\t\tNodeRecord startRecord = new NodeRecord();\r\n\t\tstartRecord.setNode(start);\r\n\t\tstartRecord.setConnection(null);\r\n\t\tstartRecord.setCostSoFar(0);\r\n\t\tstartRecord.setCategory(OPEN);\r\n\t\t\r\n\t\tArrayList<NodeRecord> open = new ArrayList<NodeRecord>();\r\n\t\tArrayList<NodeRecord> close = new ArrayList<NodeRecord>();\r\n\t\topen.add(startRecord);\r\n\t\tNodeRecord current = null;\r\n\t\tdouble endNodeCost = 0;\r\n\t\twhile(open.size() > 0){\r\n\t\t\tcurrent = getSmallestCSFElementFromList(open);\r\n\t\t\tif(current.getNode() == goal){\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t\tGraphNode node = graph.getNodeById(current.getNode());\r\n\t\t\tArrayList<Connection> connections = node.getConnection();\r\n\t\t\tfor( Connection connection :connections){\r\n\t\t\t\t// get the cost estimate for end node\r\n\t\t\t\tint endNode = connection.getToNode();\r\n\t\t\t\tendNodeCost = current.getCostSoFar() + connection.getCost();\r\n\t\t\t\tNodeRecord endNodeRecord = new NodeRecord();\r\n\t\t\t\t// if node is closed skip it\r\n\t\t\t\tif(listContains(close, endNode))\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\t// or if the node is in open list\r\n\t\t\t\telse if (listContains(open,endNode)){\r\n\t\t\t\t\tendNodeRecord = findInList(open, endNode);\r\n\t\t\t\t\t// print\r\n\t\t\t\t\t// if we didn't get shorter route then skip\r\n\t\t\t\t\tif(endNodeRecord.getCostSoFar() <= endNodeCost) {\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t// else node is not visited yet\r\n\t\t\t\telse {\r\n\t\t\t\t\tendNodeRecord = new NodeRecord();\r\n\t\t\t\t\tendNodeRecord.setNode(endNode);\r\n\t\t\t\t}\r\n\t\t\t\t//update the node\r\n\t\t\t\tendNodeRecord.setCostSoFar(endNodeCost);\r\n\t\t\t\tendNodeRecord.setConnection(connection);\r\n\t\t\t\t// add it to open list\r\n\t\t\t\tif(!listContains(open, endNode)){\r\n\t\t\t\t\topen.add(endNodeRecord);\r\n\t\t\t\t}\r\n\t\t\t}// end of for loop for connection\r\n\t\t\topen.remove(current);\r\n\t\t\tclose.add(current);\r\n\t\t}// end of while loop for open list\r\n\t\tif(current.getNode() != goal)\r\n\t\t\treturn null;\r\n\t\telse { //get the path\r\n\t\t\tArrayList<Connection> path = new ArrayList<>();\r\n\t\t\twhile(current.getNode() != start){\r\n\t\t\t\tpath.add(current.getConnection());\r\n\t\t\t\tint newNode = current.getConnection().getFromNode();\r\n\t\t\t\tcurrent = findInList(close, newNode);\r\n\t\t\t}\r\n\t\t\tCollections.reverse(path);\r\n\t\t\treturn path;\r\n\t\t}\r\n\t}","public List<node_info> shortestPath(int src, int dest);","public static int dijkstra(AdjList<String> adjList, String startNode, String endNode, LinkedList<String> pathList) {\n //Valid AdjList\n if (adjList == null || adjList.size() == 0 || adjList.hasNegativeEdges())\n return Integer.MAX_VALUE;\n\n //Checks if start and end nodes exist in adjList\n if (!adjList.contains(startNode) || !adjList.contains(endNode))\n return Integer.MAX_VALUE;\n\n //Checks if graph is suitable for BFS\n if (!adjList.isWeighted())\n return BFS(adjList, startNode, endNode, pathList);\n\n //Sets all node objects in adjList to defaults\n adjList.cleanNodeFields();\n\n //Fibonacci heap for storing current shortest path\n FibHeap<Integer, String> q = new FibHeap<>();\n\n //Set source node value to 0\n q.insert(adjList.getNode(startNode), 0);\n q.peek().d = 0;\n q.peek().visited = true;\n\n //Helper variables\n LinkedList<Pair<Node<Integer, String>, Integer>> neighbors;//Array of pairs <neighborKey, edgeWeight>\n Node<Integer, String> neighbor, u;//Current Node with shortest path / top of min-queue\n int edgeWeight;\n while (q.size() != 0) {\n u = q.extractMin();\n u.closed = true;\n\n //endNode found\n if (Objects.equals(u.value, endNode)) {\n //Build path of vertexes\n Node<Integer, String> current = adjList.getNode(endNode);\n pathList.add(current.value);\n while ((current = current.prev) != null)\n pathList.addFirst(current.value);\n return u.d;\n }\n\n neighbors = adjList.getNeighbors(u.value);\n for (Pair<Node<Integer, String>, Integer> neighborKeyValuePair : neighbors) {//Loops through every neighbor\n neighbor = neighborKeyValuePair.getKey();\n edgeWeight = neighborKeyValuePair.getValue();\n //Relaxation step\n //Checks if distance to neighbor node is less than the min distance already found\n if (!neighbor.visited || neighbor.d > u.d + edgeWeight) {\n //Assign shorter path found to neighbor in out array\n neighbor.d = u.d + edgeWeight;\n\n //Assigns previous shortest node to neighbor\n neighbor.prev = u;\n\n //Inserts or decrease key\n if (!neighbor.visited) {\n q.insert(neighbor, u.d + edgeWeight);\n neighbor.visited = true;\n } else {\n q.decreaseKey(neighbor, u.d + edgeWeight);\n }\n }\n }\n }\n return Integer.MAX_VALUE;\n }","public Path shortestPath(Vertex a, Vertex b) {\n // If a or b aren't present in the set of vertices throw an exception\n if (!myGraph.containsKey(b) || !myGraph.containsKey(a)) {\n throw new IllegalArgumentException(\"One of the vertices isn't valid\");\n }\n /* Create a map of Vertices to VertexInfos. Fill it with VertexInfos for all\n vertices that each have no previous vertex and and a cost of INFINITY */\n Map<Vertex, VertexInfo> vertInfos = new HashMap<Vertex, VertexInfo>();\n for (Vertex v : vertices()) {\n vertInfos.put(v, new VertexInfo(v, null, INFINITY));\n }\n /* Create a PriorityQueue for VertexInfos */\n PriorityQueue<VertexInfo> viQueue = new PriorityQueue<VertexInfo>();\n /* Create a VertexInfo for the start Vertex 'a' with a cost of 0. This uses a copy of Vertex a&b for immutability */\n Vertex copyA = new Vertex(a.getLabel());\n Vertex copyB = new Vertex(b.getLabel());\n\n VertexInfo vi_a = new VertexInfo(copyA, null, 0);\n /* Add VerxtexInfo for a to PQ and map it to it's VertexInfo */\n viQueue.add(vi_a);\n vertInfos.put(a, vi_a);\n while(!viQueue.isEmpty()) {\n /* Remove the VertexInfo with lowest cost */\n Vertex curr = viQueue.poll().getVertex();\n /* Check all adjacent Vertices of curr Vertex */\n for (Vertex v : adjacentVertices(curr)) {\n /* Calculate cost to get to v through curr */\n int cost = vertInfos.get(curr).getCost() + edgeCost(curr, v);\n /* If cost through curr is lower than previous */\n if (cost < vertInfos.get(v).getCost()) {\n /* Remove v's VertexInfo from PQ */\n viQueue.remove(vertInfos.get(v));\n /* Overwrite previous value of v in map\n Add updated VerexInfo to PQ */\n VertexInfo vi = new VertexInfo(v, curr, cost);\n vertInfos.put(v,vi);\n viQueue.add(vi);\n }\n }\n }\n /* Create ArrayList for path */\n List<Vertex> path = new ArrayList<Vertex>();\n \n /* Add each vertex and it's previous vertex to path until a null vertex is reached */\n for (Vertex vert = copyB; vert != null; vert = vertInfos.get(vert).getPrev()) {\n path.add(vert);\n }\n\n /* Reverse order of path */ \n Collections.reverse(path);\n /* Create new Path object with corresponding parameters */\n if(path.contains(copyA)){\n Path pathToB = new Path(path, vertInfos.get(copyB).getCost());\n return pathToB;\n } else {\n return null;\n }\n }","public int shortestPath(Village startVillage, Village targetVillage) {\n// setting the initial point 's minimum distance to zera\n startVillage.setMinDistance(0);\n// accourting to bellman ford if there are n number of dots then n-1 iterations to be done to find the minimum distances of every dot from one initial dot\n int length = this.villageList.size();\n// looping n-1 times\n for (int i = 0; i < length - 1; i++) {\n// looping through all the roads and mark the minimum distances of all the possible points\n for (Road road : roadList) {\n\n\n// if the road is a main road then skip the path\n if (road.getWeight() == 900)\n continue; //why 900 ? : just a random hightest number as a minimum distance and same 900 is used as a mix number\n Village v = road.getStartVertex();\n Village u = road.getTargetVertex();\n// if the newly went path is less than the path it used to be the update the min distance of the reached vertex\n int newLengtha = v.getMinDistance() + road.getWeight();\n if (newLengtha < u.getMinDistance()) {\n u.setMinDistance(newLengtha);\n u.setPreviousVertex(v);\n }\n int newLengthb = u.getMinDistance() + road.getWeight();\n if (newLengthb < v.getMinDistance()) {\n v.setMinDistance(newLengthb);\n v.setPreviousVertex(v);\n }\n }\n }\n// finally return the minimum distance\n return targetVillage.getMinDistance();\n }","private void breadthFirst(PathBetweenNodes graph, LinkedList<String> visited) {\r\n\r\n LinkedList<String> nodes = graph.adjacentNodes(visited.getLast());\r\n for (String node : nodes)\r\n {\r\n if (visited.contains(node))\r\n {\r\n continue;\r\n }\r\n if (node.equals(END))\r\n {\r\n \tif (mode1 && mode){\r\n visited.add(node);\r\n printPath(visited); \r\n graph.flag=false;\r\n mode=false;\r\n visited.removeLast();\r\n \t} else if(mode2){\r\n visited.add(node);\r\n printPath(visited); \r\n flag=mode2; \r\n visited.removeLast();\r\n \t} \r\n } \r\n }\r\n\r\n for (String node : nodes) { // implementing a for loop to call each node in the array nodes\r\n if (visited.contains(node) || node.equals(END)) { // if statement to see if node is already visited or it is the end node\r\n continue;\r\n }\r\n flag=true;\r\n visited.addLast(node); //adding the last node to visited array\r\n breadthFirst(graph, visited); // implementing the breath first search\r\n visited.removeLast(); // removing the last node from array visited\r\n }\r\n if (flag == false) {\r\n System.out.println(\"No path Exists between \" + START + \" and \" + END);\r\n flag = true;\r\n }\r\n }","public void shortestRouteDijkstra(){\n int landmark1 = l1.getSelectionModel().getSelectedIndex();\n int landmark2 = l2.getSelectionModel().getSelectedIndex();\n GraphNodeAL<MapPoint> lm1 = landmarkList.get(landmark1);\n GraphNodeAL<MapPoint> lm2 = landmarkList.get(landmark2);\n\n shortestRouteDij(lm1, lm2);\n }","@Override\n\tpublic List<node_data> shortestPath(int src, int dest) {\n\t\tList<node_data> ans = new ArrayList<>();\n\t\tthis.shortestPathDist(src, dest);\n\t\tif(this.GA.getNode(src).getWeight() == Integer.MAX_VALUE || this.GA.getNode(dest).getWeight() == Integer.MAX_VALUE){\n\t\t\tSystem.out.print(\"There is not a path between the nodes.\");\n\t\t\treturn null;\n\t\t}\n\t\tgraph copied = this.copy();\n\t\ttransPose(copied);\n\t\tnode_data first = copied.getNode(dest);\n\t\tans.add(first);\n\t\twhile (first.getKey() != src) {\n\t\t\tCollection<edge_data> temp = copied.getE(first.getKey());\n\t\t\tdouble check= first.getWeight();\n\t\t\tif(temp!=null) {\n\t\t\t\tfor (edge_data edge : temp) {\n\t\t\t\t\tif (copied.getNode(edge.getDest()).getWeight() + edge.getWeight() == check) {\n\t\t\t\t\t\tfirst = copied.getNode(edge.getDest());\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tans.add(first);\n\t\t}\n\t\tList<node_data> ans2 = new ArrayList<>();\n\t\tfor (int i = ans.size()-1;i>=0;i--){\n\t\t\tans2.add(ans.get(i));\n\t\t}\n\t\treturn ans2;\n\t}","int main()\n{\n // Create a graph given in the above diagram\n Graph g(4);\n g.addEdge(0, 1);\n g.addEdge(0, 2);\n g.addEdge(1, 2);\n g.addEdge(2, 0);\n g.addEdge(2, 3);\n g.addEdge(3, 3);\n \n cout << \"Following is Breadth First Traversal \"\n << \"(starting from vertex 2) n\";\n g.BFS(2);\n \n return 0;\n}","public Path getShortestPath() {\n\t\tNodeRecord startRecord = new NodeRecord(start, null, 0.0f, (float) heuristic.estimate(start), Category.OPEN);\n\n\t\t// Initialize the open list\n\t\tPathFindingList open = new PathFindingList();\n\t\topen.addRecordByEstimatedTotalCost(startRecord);\n\t\trecords.set(Integer.parseInt(startRecord.node.id), startRecord);\n\t\tNodeRecord current = null;\n\t\t\n\t\t// Iterate through processing each node\n\t\twhile (!open.isEmpty()) {\n\t\t\t// Find smallest element in the open list using estimatedTotalCost\n\t\t\tcurrent = open.getSmallestNodeRecordByEstimatedTotalCost();\n\n\t\t\t// If its the goal node, terminate\n\t\t\tif (current.node.equals(end)) break;\n\n\t\t\t// Otherwise get its outgoing connections\n\t\t\tArrayList<DefaultWeightedEdge> connections = g.getConnections(current.node);\n\t\t\t\n\t\t\t// Loop through each connection\n\t\t\tfor (DefaultWeightedEdge connection : connections) {\n\t\t\t\t// Get the cost and other information for end node\n\t\t\t Vertex endNode = g.graph.getEdgeTarget(connection);\n\t\t\t int endNodeRecordIndex = Integer.parseInt(endNode.id);\n NodeRecord endNodeRecord = records.get(endNodeRecordIndex); // this is potentially null but we handle it\n\t\t\t\tdouble newEndNodeCost = current.costSoFar + g.graph.getEdgeWeight(connection);\n\t\t\t\tdouble endNodeHeuristic = 0;\n\t\t\t\t\n\t\t\t\t// if node is closed we may have to skip, or remove it from closed list\t\n\t\t\t\tif( endNodeRecord != null && endNodeRecord.category == Category.CLOSED ){ \n\t\t\t\t\t// Find the record corresponding to the endNode\n\t\t\t\t\tendNodeRecord = records.get(endNodeRecordIndex);\n\n\t\t\t\t\t// If we didn't find a shorter route, skip\n\t\t\t\t\tif (endNodeRecord.costSoFar <= newEndNodeCost) continue;\n\n\t\t\t\t\t// Otherwise remove it from closed list\n\t\t\t\t\trecords.get(endNodeRecordIndex).category = Category.OPEN;\n\n\t\t\t\t\t// Use node's old cost values to calculate its heuristic to save computation\n\t\t\t\t\tendNodeHeuristic = endNodeRecord.estimatedTotalCost - endNodeRecord.costSoFar;\n\n\t\t\t\t// Skip if node is open and we've not found a better route\n\t\t\t\t} else if( endNodeRecord != null && endNodeRecord.category == Category.OPEN ){ \n\t\t\t\t\t// Here we find the record in the open list corresponding to the endNode\n\t\t\t\t\tendNodeRecord = records.get(endNodeRecordIndex);\n\n\t\t\t\t\t// If our route isn't better, skip\n\t\t\t\t\tif (endNodeRecord.costSoFar <= newEndNodeCost) continue;\n\n\t\t\t\t\t// Use the node's old cost values to calculate its heuristic to save computation\n\t\t\t\t\tendNodeHeuristic = endNodeRecord.estimatedTotalCost - endNodeRecord.costSoFar;\n\n\t\t\t\t// Otherwise we know we've got an unvisited node, so make a new record\n\t\t\t\t} else { // if endNodeRecord.category == Category.UNVISITED\n\t\t\t\t endNodeRecord = new NodeRecord();\n\t\t\t\t\tendNodeRecord.node = endNode;\n\t\t\t\t\trecords.set(endNodeRecordIndex, endNodeRecord);\n\n\t\t\t\t\t// Need to calculate heuristic since this is new\n\t\t\t\t\tendNodeHeuristic = heuristic.estimate(endNode);\n\t\t\t\t}\n\t\t\t\t\n\n\t\t\t\t// We're here if we need to update the node\n\t\t\t\t// update the cost, estimate, and connection\n\t\t\t\tendNodeRecord.costSoFar = newEndNodeCost;\n\t\t\t\tendNodeRecord.edge = connection;\n\t\t\t\tendNodeRecord.estimatedTotalCost = newEndNodeCost + endNodeHeuristic;\n\n\t\t\t\t// Add it to the open list\n\t\t\t\tif ( endNodeRecord.category != Category.OPEN ) {\n\t\t\t\t\topen.addRecordByEstimatedTotalCost(endNodeRecord);\n\t\t\t\t\tendNodeRecord.category = Category.OPEN;\n\t\t\t\t\trecords.set(endNodeRecordIndex, endNodeRecord);\n\t\t\t\t}\n\n\t\t\t}\n\t\t\t\n\t\t\t// We’ve finished looking at the connections for\n\t\t\t// the current node, so add it to the closed list\n\t\t\t// and remove it from the open list\n\t\t\topen.removeRecord(current);\n\t\t\tcurrent.category = Category.CLOSED;\n\t\t\trecords.set(Integer.parseInt(current.node.id), current);\n\t\t}\n\t\t\n\t\t// We’re here if we’ve either found the goal, or\n\t\t// if we’ve no more nodes to search, find which.\n\t\tif (!current.node.equals(end)) {\n\t\t\t// Ran out of nodes without finding the goal, no solution\n\t\t\treturn null;\n\t\t} else {\n\t\t // Compile the list of connections in the path\n\t\t\tArrayList<DefaultWeightedEdge> path = new ArrayList<>();\n\n\t\t\twhile (!current.node.equals(start)) {\n\t\t\t\tpath.add(current.edge);\n\t\t\t\t// Set current (NodeRecord) to is source.\n\t\t\t\tcurrent = records.get( Integer.parseInt(g.graph.getEdgeSource(current.edge).id) );\n\t\t\t}\n\n\t\t\t// Reverse the path, and return it\n\t\t\tCollections.reverse(path);\n\t\t\treturn new Path(g, path);\n\t\t}\n\n\t}","public static <N>Path<N> findShortestPath(DirectedGraph<N, Double> graph, N first, N last){\n PriorityQueue<Path<N>> active = new PriorityQueue<>(new Comparator<Path<N>>() {\n @Override\n public int compare(Path<N> x, Path<N> y) {\n if(x.getCost() > y.getCost()){\n return 1;\n } else if (x.getCost() < y.getCost()){\n return -1;\n }\n return 0;\n }\n });\n\n Set<N> finished = new HashSet<>();\n N start = first;\n N end = last;\n\n active.add(new Path<N>(start));\n while(!active.isEmpty()){\n Path<N> minPath = active.remove();\n N minDest = minPath.getEnd();\n if(minDest.equals(end)){\n return minPath;\n }\n if(finished.contains(minDest)){\n continue;\n }\n for(Edge<N, Double> e : graph.getEdges(minDest)){\n if(!finished.contains(e.getChild())){\n Path<N> newPath = minPath.extend(e.getChild(), e.getLabel());\n active.add(newPath);\n }\n }\n finished.add(minDest);\n }\n return null;\n }","public static void main(String[] args) {\n Graph graph = new Graph();\n graph.addEdge(0, 1);\n graph.addEdge(0, 4);\n\n graph.addEdge(1,0);\n graph.addEdge(1,5);\n graph.addEdge(1,2);\n graph.addEdge(2,1);\n graph.addEdge(2,6);\n graph.addEdge(2,3);\n\n graph.addEdge(3,2);\n graph.addEdge(3,7);\n\n graph.addEdge(7,3);\n graph.addEdge(7,6);\n graph.addEdge(7,11);\n\n graph.addEdge(5,1);\n graph.addEdge(5,9);\n graph.addEdge(5,6);\n graph.addEdge(5,4);\n\n graph.addEdge(9,8);\n graph.addEdge(9,5);\n graph.addEdge(9,13);\n graph.addEdge(9,10);\n\n graph.addEdge(13,17);\n graph.addEdge(13,14);\n graph.addEdge(13,9);\n graph.addEdge(13,12);\n\n graph.addEdge(4,0);\n graph.addEdge(4,5);\n graph.addEdge(4,8);\n graph.addEdge(8,4);\n graph.addEdge(8,12);\n graph.addEdge(8,9);\n graph.addEdge(12,8);\n graph.addEdge(12,16);\n graph.addEdge(12,13);\n graph.addEdge(16,12);\n graph.addEdge(16,17);\n graph.addEdge(17,13);\n graph.addEdge(17,16);\n graph.addEdge(17,18);\n\n graph.addEdge(18,17);\n graph.addEdge(18,14);\n graph.addEdge(18,19);\n\n graph.addEdge(19,18);\n graph.addEdge(19,15);\n LinkedList<Integer> visited = new LinkedList();\n List<ArrayList<Integer>> paths = new ArrayList<ArrayList<Integer>>();\n int currentNode = START;\n visited.add(START);\n new searchEasy().findAllPaths(graph, visited, paths, currentNode);\n for(ArrayList<Integer> path : paths){\n for (Integer node : path) {\n System.out.print(node);\n System.out.print(\" \");\n }\n System.out.println();\n }\n }","private void findBestPath(){\n\t\t// The method will try to find the best path for every starting point and will use the minimum\n\t\tfor(int start = 0; start < this.getDimension(); start++){\n\t\t\tfindBestPath(start);\t\n\t\t}\t\n\t}","public List<Integer> BFS(int s, int t, ArrayList<ArrayList<Integer>> adjacencyLists) {\n\t\tint N = adjacencyLists.size();\n boolean visited[] = new boolean[N]; \n int parrent[] = new int[N];\n \n // Create a queue for BFS \n LinkedList<Integer> queue = new LinkedList<Integer>(); \n \n // Mark the current node as visited and enqueue it \n visited[s]=true; \n parrent[s]=-1;\n queue.add(s); \n Boolean hasPath = false;\n \n while (queue.size() != 0) \n { \n // Dequeue a vertex from queue and print it \n int current = queue.poll(); \n \n Iterator<Integer> i = adjacencyLists.get(current).listIterator();\n while (i.hasNext()) \n { \n int n = i.next(); \n if (!visited[n]) \n { \n visited[n] = true; \n parrent[n] = current;\n if (n == t) {\n \thasPath = true;\n \tbreak;\n }\n queue.add(n); \n } \n } \n } \n if (!hasPath) {\n \treturn null;\n }\n \n int trace = t;\n ArrayList<Integer> shortestPath = new ArrayList<Integer>();\n while(parrent[trace] != -1) {\n \tshortestPath.add(trace);\t\n \ttrace = parrent[trace];\n }\n shortestPath.add(s);\n Collections.reverse(shortestPath);\n return shortestPath;\n }","public int[] djekstra(Router root, Router destination){\n //if router and destination same\n if (root.getID() == destination.getID()){\n int[] result = new int[2];\n result[0] = root.getID();\n result[1] = 0;\n hops.add(0);\n return result;\n }\n\n //Storing shortest path currently known\n int[] shortestPath = new int[size];\n //Storing the weights of the current router's connection to neighbors\n int[] currentNeighborConnectionWeight = new int[size];\n\n //First set all of the positions to 9999 (pseudo infinity)\n for (int i = 0; i < shortestPath.length;i++){\n shortestPath[i] = 9999;\n }\n\n // Set the distance to itself as 0, mark as visited\n shortestPath[root.getID()-1] = 0;\n root.visit();\n\n //For each connection the root has, set the shortestPath available to the weight to the neighbor\n for (Connection c : root.getConnections()){\n shortestPath[c.getDestination().getID()-1] = c.getWeight();\n }\n\n //Find the smallest router to start the algorithm\n //ID of smallest router, start the value with the first available option\n int smallestRouterID = 0;\n int smallestRouterWeight = 9999;\n //Router used for iterating\n Router current = null;\n //Storing path length\n int totalPathLength = 0;\n\n\n //Find the shortest available path link to start with\n for (int k = 0; k < shortestPath.length; k++){\n if ((shortestPath[k] < smallestRouterWeight) && (shortestPath[k] != 0)){\n // Check to see if dead end\n if (routers.get(k).getConnections().size() > 1){\n // id is pos+1\n smallestRouterID = k + 1;\n smallestRouterWeight = shortestPath[k];\n } else if (routers.get(k).getID() == destination.getID()){ //edge case\n // id is pos+1\n smallestRouterID = k + 1;\n smallestRouterWeight = shortestPath[k];\n }\n }\n }\n // add its weight\n totalPathLength += smallestRouterWeight;\n\n //This is where we start our first step\n current = getRouter(smallestRouterID);\n hops.add(current.getID());\n current.visit();\n //System.out.println(\"First step--> Router:\" + smallestRouterID + \" Weight to router from root:\" + smallestRouterWeight);\n //Now we loop\n Router firstRouter = current;\n boolean done = false;\n while (done == false){\n //Break case 1, we found the router\n if (current.getID() == destination.getID()){\n // check if root has available connections\n\n // set current to root and store totalPathLength to new variable && store hops in new array ArrayList\n // compare totals and store the one that's lower ++ hops list too\n // could we recursively call djekstra?\n done = true;\n // System.out.println(\"Router found\");\n break;\n }\n\n //Break case 2, all of the connections have been visited already\n boolean destinationAvailable = hasAvailableConnections(current);\n if (destinationAvailable == false){\n if(hasAvailableConnections(root)){\n current = root;\n hops.clear();\n totalPathLength= 0;\n } else {\n done = true;\n // System.out.println(\"v-- No more routers available\");\n break;\n }\n }\n\n //set all to 9999 to assume we cant see\n for (int a = 0; a < currentNeighborConnectionWeight.length; a++){\n currentNeighborConnectionWeight[a] = 9999;\n }\n\n //Recalculate for new path lengths\n for (Connection c : current.getConnections()){\n //Only calculate path for routers that havent been visited\n if (c.getDestination().getVisit() == false){\n currentNeighborConnectionWeight[c.getDestination().getID()-1] = c.getWeight();\n }\n }\n\n //Find the next step to take\n //Find the shortest available path link to start with\n smallestRouterID = 0;\n smallestRouterWeight = 9999;\n for (int b = 0; b < currentNeighborConnectionWeight.length; b++){\n if ((currentNeighborConnectionWeight[b] < smallestRouterWeight)){\n // id is pos+1\n smallestRouterID = b + 1;\n smallestRouterWeight = currentNeighborConnectionWeight[b];\n }\n }\n\n // add its weight\n totalPathLength += smallestRouterWeight;\n current = getRouter(smallestRouterID);\n hops.add(current.getID());\n current.visit();\n // System.out.println(\"Next shortest path--> Router: \" + current.getID() + \" Length from root:\" + totalPathLength);\n\n\n } // <--------------------------------------------------------------------------------End of while loop\n\n // returns <lasthop, pathcost>\n int[] result = new int[2];\n //Check and see if the path length is smaller then the original\n if (totalPathLength <= shortestPath[destination.getID()-1]){\n //System.out.println(\"Case new \" + firstRouter.getID());\n shortestPath[destination.getID()-1] = totalPathLength;\n result[0] = firstRouter.getID();\n result[1] = shortestPath[destination.getID()-1];\n } else {\n //root was shorter\n //System.out.println(\"Case old \" + root.getID());\n result[0] = root.getID();\n result[1] = shortestPath[destination.getID()-1];\n }\n // System.out.println(\"Next hop:\" + current.getID() + \" Total Distance:\" + shortestPath[destination.getID()-1]);\n\n //reset the visited list\n for (Router r: routers){\n r.unvisit();\n }\n return result;\n }","public void findShortestPath(String startName, String endName) {\n checkValidEndpoint(startName);\n checkValidEndpoint(endName);\n\n Vertex<String> start = vertices.get(startName);\n Vertex<String> end = vertices.get(endName);\n\n double totalDist; // totalDist must be update below\n\n Map<Vertex<String>, Double> distance = new HashMap<>();\n Map<Vertex<String>, Vertex<String>> previous = new HashMap<>();\n Set<Vertex<String>> explored = new HashSet<>();\n PriorityQueue<VertexDistancePair> pq = new PriorityQueue<>();\n\n\n\n addPQ(distance, start, pq, previous);\n\n\n\n dijkstraHelper(pq, end, explored, distance, previous);\n\n\n\n\n\n\n totalDist = distance.get(end);\n List<Edge<String>> path = getPath(end, start);\n printPath(path, totalDist);\n }","private Path findShortestPath(Address start, Address destination) throws Exception{\n HashMap<Intersection, Segment> pi = dijkstra(start);\n Segment seg = pi.get(destination);\n if(seg == null){\n throw new Exception();\n }\n LinkedList<Segment> newPathComposition = new LinkedList<>();\n Path newPath = new Path(start, destination, newPathComposition);\n newPathComposition.add(seg);\n while (!seg.getOrigin().equals(start)) {\n Intersection s = seg.getOrigin();\n seg = pi.get(s);\n if(seg == null){\n throw new Exception();\n }\n newPathComposition.add(seg);\n }\n Collections.reverse(newPathComposition);\n newPath.setSegmentsOfPath(newPathComposition);\n return newPath;\n }","public void shortestPaths(int source) {\n\n\t\tlong start = 0;\n\t\tlong stop;\n\t\tfor (int v = 0; v < vertexList.length; v++) {\n\t\t\tedgeList[v] = new Edge(vertexList[v].id, rand, 5000);\n\t\t}\n\t\t// creating object of fibonacci\n\t\tFHeap pq = new FHeap();\n\t\t// creating a map for checking\n\t\tMap<Integer, FHeap.Node> check = new HashMap<Integer, FHeap.Node>();\n\t\t// storing the mst costs\n\n\t\tfor (int v = 0; v < vertexList.length; v++) {\n\t\t\tcheck.put(vertexList[v].id,\n\t\t\t\t\tpq.enqueue(vertexList[v].id, Double.POSITIVE_INFINITY));\n\t\t}\n\t\tstart = System.currentTimeMillis();\n\t\t// allot cost 0 to initial node\n\t\tpq.decreaseKey(check.get(vertexList[source].id), 0.0);\n\n\t\twhile (!pq.isEmpty()) {\n\t\t\t// take the current node and get its minimum cost\n\t\t\tFHeap.Node current = pq.dequeueMin();\n\n\t\t\t// store the values in the table\n\t\t\tresult.put(current.getValue(), current.getCost());\n\n\t\t\t// update the costs\n\t\t\tfor (Neighbor nbr = vertexList[current.getValue()].adjList; nbr != null; nbr = nbr.next) {\n\n\t\t\t\t// edge is not added if shortest cost is known\n\t\t\t\tif (result.containsKey(vertexList[nbr.vertexNumber].id))\n\t\t\t\t\tcontinue;\n\n\t\t\t\t// update cost to shortest\n\t\t\t\tFHeap.Node finalCost = check\n\t\t\t\t\t\t.get(vertexList[nbr.vertexNumber].id);\n\t\t\t\tif (nbr.weight < finalCost.getCost())\n\t\t\t\t\tpq.decreaseKey(finalCost, nbr.weight);\n\t\t\t}\n\t\t}\n\t\tstop = System.currentTimeMillis();\n\t\t// computing the time\n\t\ttime = stop - start;\n\n\t\t// calculate the MST cost\n\t\tfor (int i = 0; i < vertexList.length; i++) {\n\t\t\tsumHeapCost = (int) (sumHeapCost + result.get(i));\n\t\t}\n\t\t// for printing in case of input from file in fibonacci mode\n\t\n\t\t// System.out.println(sumHeapCost);\n\t}","private LinkedList<Node> aStarPath() throws PathNotFoundException {\n\n // Set of nodes already evaluated\n List<Node> closedSet = new ArrayList<Node>();\n\n // Set of nodes visited, but not evaluated\n List<Node> openSet = new ArrayList<Node>();\n openSet.add(start);\n\n\n // Map of node with shortest path leading to it\n Map<Node, Node> cameFrom = new HashMap<>();\n\n // Map of cost of navigating from start to node\n Map<Node, Double> costFromStart = new HashMap<>();\n costFromStart.put(start, 0.0);\n\n // Map of cost of navigating path from start to end through node\n Map<Node, Double> costThrough = new HashMap<>();\n costThrough.put(start, heuristic(start, end));\n\n while (!openSet.isEmpty()){\n\n Node current = lowestCostThrough(openSet, costThrough);\n\n if(current.equals(end)){\n return reconstructPath(cameFrom, current);\n }\n\n openSet.remove(current);\n closedSet.add(current);\n\n for(Node neighbor: current.getNodes()) {\n if (closedSet.contains(neighbor)) {\n continue;\n }\n\n double tentativeCost = costFromStart.get(current) + distanceBetween(current, neighbor);\n\n if (!openSet.contains(neighbor)) { // found new neighbor\n openSet.add(neighbor);\n } else if (tentativeCost >= costFromStart.get(neighbor)) { // not a better path\n continue;\n }\n\n cameFrom.put(neighbor, current);\n costFromStart.put(neighbor, tentativeCost);\n costThrough.put(neighbor, tentativeCost + heuristic(neighbor, end));\n\n }\n }\n // no path\n throw pathNotFound;\n }","@Test public void testPublic14() {\n Graph<String> graph= TestGraphs.testGraph2();\n List<String> shortestPath= new ArrayList<String>();\n\n assertEquals(1, graph.Dijkstra(\"apple\", \"banana\", shortestPath));\n assertEquals(\"apple banana\", TestGraphs.listToString(shortestPath));\n\n assertEquals(2, graph.Dijkstra(\"apple\", \"cherry\", shortestPath));\n assertEquals(\"apple banana cherry\",\n TestGraphs.listToString(shortestPath));\n\n assertEquals(3, graph.Dijkstra(\"apple\", \"date\", shortestPath));\n assertEquals(\"apple banana cherry date\",\n TestGraphs.listToString(shortestPath));\n\n assertEquals(4, graph.Dijkstra(\"apple\", \"elderberry\", shortestPath));\n assertEquals(\"apple banana cherry date elderberry\",\n TestGraphs.listToString(shortestPath));\n\n assertEquals(5, graph.Dijkstra(\"apple\", \"fig\", shortestPath));\n assertEquals(\"apple banana cherry date elderberry fig\",\n TestGraphs.listToString(shortestPath));\n\n assertEquals(6, graph.Dijkstra(\"apple\", \"guava\", shortestPath));\n assertEquals(\"apple banana cherry date elderberry fig guava\",\n TestGraphs.listToString(shortestPath));\n }","@Override\n public Double calculateShortestPathFromSource(String from, String to) {\n Node source = graph.getNodeByName(from);\n Node destination = graph.getNodeByName(to);\n source.setDistance(0d);\n Set<Node> settledNodes = new HashSet<>();\n PriorityQueue<Node> unsettledNodes = new PriorityQueue<>(Comparator.comparing(Node::getDistance));\n unsettledNodes.add(source);\n while (unsettledNodes.size() != 0) {\n Node currentNode = unsettledNodes.poll();\n for (Map.Entry<Node, Double> adjacencyPair : currentNode.getAdjacentNodes().entrySet()) {\n Node adjacentNode = adjacencyPair.getKey();\n Double distance = adjacencyPair.getValue();\n if (!settledNodes.contains(adjacentNode)) {\n calculateMinimumDistance(adjacentNode, distance, currentNode);\n unsettledNodes.add(adjacentNode);\n }\n }\n settledNodes.add(currentNode);\n }\n return destination.getDistance() == Double.MAX_VALUE ? -9999d : destination.getDistance();\n }","public int bellman(Edge[] graph, int start, int end, int n) {\n int[] dist = new int[n+1];\n fill(dist, inf);\n dist[start] = 0;\n\n for(int i=1; i<=n; i++) {\n for(Edge e: graph) {\n dist[e.to] = min(dist[e.from] + e.weight, dist[e.to]);\n }\n }\n\n if(hasNegCycle(graph, dist, end)) {\n return -1;\n } else if(dist[end] == inf){\n return -2;\n } else {\n return dist[end];\n }\n }","private List<routerNode> getPathVertexList(routerNode beginNode, routerNode endNode) {\r\n\t\tTransformer<routerLink, Integer> wtTransformer; // transformer for getting edge weight\r\n\t\twtTransformer = new Transformer<routerLink, Integer>() {\r\n public Integer transform(routerLink link) {\r\n return link.getWeight();\r\n \t}\r\n };\t\t\r\n\r\n\t\t\r\n\t\tList<routerNode> vlist;\r\n\t\tDijkstraShortestPath<routerNode, routerLink> DSPath = \r\n\t \t new DijkstraShortestPath<routerNode, routerLink>(gGraph, wtTransformer);\r\n \t// get the shortest path in the form of edge list \r\n List<routerLink> elist = DSPath.getPath(beginNode, endNode);\r\n\t\t\r\n \t\t// get the node list form the shortest path\r\n\t Iterator<routerLink> ebIter = elist.iterator();\r\n\t vlist = new ArrayList<routerNode>(elist.size() + 1);\r\n \tvlist.add(0, beginNode);\r\n\t for(int i=0; i<elist.size(); i++){\r\n\t\t routerLink aLink = ebIter.next();\r\n\t \t \t// get the nodes corresponding to the edge\r\n \t\tPair<routerNode> endpoints = gGraph.getEndpoints(aLink);\r\n\t routerNode V1 = endpoints.getFirst();\r\n\t routerNode V2 = endpoints.getSecond();\r\n\t \tif(vlist.get(i) == V1)\r\n\t \t vlist.add(i+1, V2);\r\n\t else\r\n\t \tvlist.add(i+1, V1);\r\n\t }\r\n\t return vlist;\r\n\t}","@Override\r\n public List<T> breadthFirstPath(T start, T end) {\r\n\r\n Vertex<T> startV = vertices.get(start);\r\n Vertex<T> endV = vertices.get(end);\r\n\r\n LinkedList<Vertex<T>> vertexList = new LinkedList<>();\r\n //Set<Vertex<T>> visited = new HashSet<>();\r\n ArrayList<Vertex<T>> visited = new ArrayList<>();\r\n\r\n LinkedList<Vertex<T>> pred = new LinkedList<>();\r\n int currIndex = 0;\r\n\r\n pred.add(null);\r\n\r\n vertexList.add(startV);\r\n visited.add(startV);\r\n\r\n LinkedList<T> path = new LinkedList<>();\r\n\r\n if (breadthFirstSearch(start, end) == false) {\r\n path = new LinkedList<>();\r\n return path;\r\n } else {\r\n while (vertexList.size() > 0) {\r\n Vertex<T> next = vertexList.poll();\r\n if(next == null){\r\n continue;\r\n }\r\n if (next == endV) {\r\n path.add(endV.getValue());\r\n break;\r\n }\r\n for (Vertex<T> neighbor : next.getNeighbors()) {\r\n if (!visited.contains(neighbor)) {\r\n pred.add(next);\r\n visited.add(neighbor);\r\n vertexList.add(neighbor);\r\n }\r\n }\r\n currIndex++;\r\n //path.add(next.getValue());\r\n\r\n }\r\n while (currIndex != 0) {\r\n Vertex<T> parent = pred.get(currIndex);\r\n path.add(parent.getValue());\r\n currIndex = visited.indexOf(parent);\r\n }\r\n }\r\n Collections.reverse(path);\r\n return path;\r\n }","private static void simpleDijikstra(final DirectedGraph directedGraph,\n final Map<String, Integer> currentShortestPaths,\n final String start, final Set<String> visitedSet, final String destination) {\n // Terminate when we have visited all the nodes or if our start value isn't in our dijikstra table\n if (containsAndNotNull(currentShortestPaths, start) && visitedSet.size() != currentShortestPaths.keySet().size()) {\n compareDistanceAndReplace(directedGraph, currentShortestPaths, start);\n visitedSet.add(start);\n // Calculate the next current smallest node that hasn't been visited and not infinity\n final Optional<Map.Entry<String, Integer>> optionalSmallest =\n currentShortestPaths.entrySet().stream()\n .filter(node -> !visitedSet.contains(node.getKey()) && node.getValue() != null)\n .min(Comparator.comparingInt(Map.Entry::getValue));\n // Continue to next node if there is one available\n optionalSmallest.ifPresent(smallest -> {\n // No need to continue if the next smallest node is our destination\n if (!smallest.getKey().equals(destination)) {\n simpleDijikstra(directedGraph, currentShortestPaths, smallest.getKey(), visitedSet, destination);\n }\n });\n }\n }","public Dijkstra(Graph graph, int firstVertexPortNum)\n {\n this.graph = graph;\n Set<String> vertexKeys = this.graph.vertexKeys();\n \n this.initialVertexPortNum = firstVertexPortNum;\n this.predecessors = new HashMap<String, String>();\n this.distances = new HashMap<String, Integer>();\n this.availableVertices = new PriorityQueue<Vertex>(vertexKeys.size(), new Comparator<Vertex>()\n {\n // compare weights of these two vertices.\n public int compare(Vertex v1, Vertex v2)\n {\n \t// errors are here.\n int weightOne = Dijkstra.this.distances.get(v1.convertToString(v1.getVertexPortNum())); // distances stored by portnum in string form.\n int weightTwo = Dijkstra.this.distances.get(v2.convertToString(v2.getVertexPortNum())); // distances stored by portnum in string form.\n return weightOne - weightTwo; // return the modified weight of the two vertices.\n }\n });\n \n this.visitedVertices = new HashSet<Vertex>();\n \n // for each Vertex in the graph\n for(String key: vertexKeys)\n {\n this.predecessors.put(key, null);\n this.distances.put(key, Integer.MAX_VALUE); // assuming that the distance of this is infinity.\n }\n \n \n //the distance from the initial vertex to itself is 0\n this.distances.put(convertToString(initialVertexPortNum), 0); \n \n //and seed initialVertex's neighbors\n Vertex initialVertex = this.graph.getVertex(convertToString(initialVertexPortNum)); // converted portnum to String to make this work.\n ArrayList<Edge> initialVertexNeighbors = initialVertex.getSquad();\n for(Edge e : initialVertexNeighbors)\n {\n Vertex other = e.getNeighbor(initialVertex);\n this.predecessors.put(convertToString(other.getVertexPortNum()), convertToString(initialVertexPortNum));\n this.distances.put(convertToString(other.getVertexPortNum()), e.getWeight()); // converted portnum to String to make this work.\n this.availableVertices.add(other); // add to available vertices.\n }\n \n this.visitedVertices.add(initialVertex); // add to list of visited vertices.\n \n // apply Dijkstra's algorithm to the overlay.\n processOverlay();\n \n }","public static void breadthFirstSearch(ArrayList<Node> graph) {\n\t\tSystem.out.println(\"BFS:\");\n\t\tif(graph.size() == 0) {\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tGraphUtils.cleanGraph(graph);\n\n\t\tQueue<Node> queue = new LinkedList<Node>();\n\t\tfor(Node node : graph) {\n\t\t\tif(node.state != Node.State.UNDISCOVERED) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tnode.state = Node.State.DISCOVERED;\n\t\t\tqueue.add(node);\n\t\t\t\n\t\t\twhile(!queue.isEmpty()) {\n\t\t\t\tnode = queue.remove();\n\t\t\t\t\n\t\t\t\t//process node\n\t\t\t\tSystem.out.print(node.name + \" -> \");\n\t\t\t\t\n\t\t\t\tfor(Edge e : node.edges) {\n\t\t\t\t\t//process edge\n\t\t\t\t\tNode neighbor = e.getNeighbor(node);\n\t\t\t\t\t\n\t\t\t\t\t//first time we see this node it gets added to the queue for later processing\n\t\t\t\t\tif(neighbor.state == Node.State.UNDISCOVERED) {\n\t\t\t\t\t\tneighbor.state = Node.State.DISCOVERED;\n\t\t\t\t\t\tqueue.add(neighbor);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t//finished with this node\n\t\t\t\tnode.state = Node.State.COMPLETE;\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println();\n\t\tGraphUtils.cleanGraph(graph);\n\t}","@SuppressWarnings({ \"rawtypes\", \"unchecked\" })\n public List<Edge<T>> viterbiPath() {\n final int numNodes = nodeList.size();\n double[] d_v = new double[numNodes];\n Arrays.fill(d_v, annihilator());\n d_v[ROOT_ID] = identity();\n Edge[] p_v = new Edge[numNodes]; \n \n // Forward pass\n for (int v = ROOT_ID+1; v < numNodes; ++v) {\n List<Edge<T>> edgeList = nodeList.get(v).backwardStar();\n for (Edge<T> edge : edgeList) {\n int u = edge.start().id();\n double bestCost = d_v[v];\n double transitionCost = score(d_v[u], edge.weight());\n if (compare(bestCost, transitionCost) == transitionCost) {\n // Do an update to the best cost\n d_v[v] = transitionCost;\n p_v[v] = edge;\n }\n }\n }\n \n // Backout the solution\n List<Edge<T>> bestPath = new LinkedList<Edge<T>>();\n Edge<T> bestEdge = p_v[numNodes-1];\n bestEdge = p_v[bestEdge.start().id()]; // Skip the goal node\n while(bestEdge.start().id() != ROOT_ID) {\n bestPath.add(0, bestEdge); // O(c) pre-pend\n bestEdge = p_v[bestEdge.start().id()];\n }\n\n return bestPath;\n }","@Override\n public List<node_info> shortestPath(int src, int dest) {\n int counter=0;//counter for index of listPath\n List<node_info> listPath=new ArrayList<node_info>();//The reverse list that is returned\n List<node_info> listResult=new ArrayList<node_info>();//the returned list\n if(!DijkstraHelp(src,dest)) return null;//if there is no path from src to dest\n if(src==dest) {\n listPath.add(this.ga.getNode(src));\n return listPath;\n }\n //the other case:\n node_info d=this.ga.getNode(dest);\n listPath.add(counter,d);//insert the dest in order to go from destination to source\n //counter++;\n weighted_graph gCopy=copy();\n Iterator<node_info> it=gCopy.getV().iterator();//run on the whole graph\n while(it.hasNext()){\n if(listPath.get(counter).getKey()==src) break;//if we finished\n if(gCopy.getV(listPath.get(counter).getKey()).contains(it.next())) {//remove the nodes that we were already checked if\n //they need to be insert to listPath\n continue;\n }\n Iterator<node_info> currentIt=gCopy.getV(listPath.get(counter).getKey()).iterator();//iterator on the ni-list of the\n //last node were insert to the listPath\n if(currentIt!=null) {\n node_info min=null;\n while (currentIt.hasNext()){\n node_info currentLoop=currentIt.next();\n if(currentLoop.getTag()+gCopy.getEdge(listPath.get(counter).getKey(),currentLoop.getKey())==\n listPath.get(counter).getTag()){//check if this is the node that appropriate to the shortest path\n min=currentLoop;\n }\n }\n listPath.add(min);//insert to listPath\n counter++;\n }\n }\n for(int i=listPath.size()-1;i>=0;i--){\n listResult.add(listPath.size()-i-1,listPath.get(i));//reverse the list\n }\n return listResult;\n }","public int shortestPathLength(int[][] graph) {\n Queue<MyPath> q = new LinkedList<>();\n Set<String> visited = new HashSet<>();\n\n for (int i = 0; i < graph.length; i++) {\n MyPath path = new MyPath(i, (1 << i));\n visited.add(path.convertToString());\n q.offer(path);\n }\n\n int length = 0;\n while (!q.isEmpty()) {\n int size = q.size();\n while (size-- > 0) {\n MyPath next = q.poll();\n int curr = next.curr;\n int currPath = next.nodes;\n // Assume we have two nodes -> n = 2\n // 1 << 2 -> 100\n // 100 - 1 -> 011 which means both nodes are visited\n if (currPath == (1 << graph.length) - 1) {\n return length;\n }\n for (int neighbors : graph[curr]) {\n MyPath newPath = new MyPath(neighbors, currPath | (1 << neighbors));\n String pathString = newPath.convertToString();\n if (visited.add(pathString)) {\n q.offer(newPath);\n }\n }\n }\n length++;\n }\n\n return -1;\n }","public List<Node> findShortestPath(Node s, Node t);","public static List<CampusGraph.Edges<String, String>> findPath(CampusGraph<String, String> cg, String start, String destination) {\n if (cg == null || start == null || destination == null) {\n throw new IllegalArgumentException();\n }\n Queue<String> visitedNodes = new LinkedList<>();\n Map<String, List<CampusGraph.Edges<String, String>>> paths = new HashMap<>();\n visitedNodes.add(start); // Add start to Q\n paths.put(start, new LinkedList<>()); // Add start->[] to M (start mapped to an empty list)\n\n while (!visitedNodes.isEmpty()) {\n String currentNode = visitedNodes.remove();\n if (currentNode.equals(destination)) { // found the path\n return paths.get(currentNode);\n } else {\n List<CampusGraph.Edges<String, String>> neighbors = cg.getAllChildren(currentNode);\n neighbors.sort(new Comparator<CampusGraph.Edges<String, String>>() {\n @Override\n public int compare(CampusGraph.Edges<String, String> o1, CampusGraph.Edges<String, String> o2) {\n int cmpEndNode = o1.getEndTag().compareTo(o2.getEndTag());\n if (cmpEndNode == 0) {\n return o1.getEdgeLabel().compareTo(o2.getEdgeLabel());\n }\n return cmpEndNode;\n }\n }); // ascending list. Sort characters and books names all at once??\n\n for (CampusGraph.Edges<String, String> e: neighbors) {\n String neighbor = e.getEndTag();\n if (!paths.containsKey(neighbor)) { // i.e. if the neighbor is unvisited\n List<CampusGraph.Edges<String, String>> pathCopy = new LinkedList<>(paths.get(currentNode));\n pathCopy.add(e);\n paths.put(neighbor, pathCopy); // add the path exclusive to this neighbor\n visitedNodes.add(neighbor); // then, mark the neighbor as visited\n }\n }\n }\n }\n return null; // No destination found\n }","public List<Node> computeDijkstraShortestPath(Node source, Node destination) {\n\n source.minDistance = 0.;\n PriorityQueue<Node> nodeQueue = new PriorityQueue<Node>();\n nodeQueue.add(source);\n\n int destinationGroup = destination._groupID;\n\n while (!nodeQueue.isEmpty()) {\n Node v = nodeQueue.poll();\n\n Log.i(\"bbb\", \"In dijsk node name \"+ v._waypointName);\n //Stop searching when reach the destination node\n\n\n if(destinationGroup!=0){\n\n if(v._groupID==destinationGroup){\n destination = navigationGraph.get(navigationGraph.size()-1).nodesInSubgraph.get(v._waypointID);\n Log.i(\"bbb\", \"destination is: \"+destination._waypointName);\n\n break;\n }\n\n }\n\n if (v._waypointID.equals(destination._waypointID))\n break;\n\n\n // Visit each edge that is adjacent to v\n for (Edge e : v._edges) {\n Node a = e.target;\n Log.i(\"bbb\", \"node a \"+a._waypointName);\n double weight = e.weight;\n double distanceThroughU = v.minDistance + weight;\n if (distanceThroughU < a.minDistance) {\n nodeQueue.remove(a);\n a.minDistance = distanceThroughU;\n a.previous = v;\n Log.i(\"bbb\", \"set previous\");\n nodeQueue.add(a);\n }\n }\n }\n\n Log.i(\"bbb\", \"destination is: \"+destination._waypointName);\n\n return getShortestPathToDestination(destination);\n }","List<V> getShortestPath(V vertex);","private int bfs(int startNode, Map<Integer, List<Integer>> adjacencyList, int[] distanceToNode) {\n int furthestNode = 1;\n int furthestDistance = Integer.MIN_VALUE;\n\n Queue<Integer> queue = new LinkedList<>();\n Arrays.fill(distanceToNode, -1);\n\n // Put start node in queue\n queue.add(startNode);\n // Set distance of the first node to 0 (0 edge to itself)\n distanceToNode[startNode - 1] = 0;\n\n // While queue is not empty\n while (!queue.isEmpty()) {\n // Pop node\n int curNode = queue.remove();\n\n // Iterate through node's neighbours\n for (int neighbour : adjacencyList.get(curNode)) {\n // If neighbour is not visited (distance not -1)\n if (distanceToNode[neighbour - 1] == -1) {\n // Calculate distance by taking curNode distance and add 1\n // Update distance in array as a way of marking it as visited\n distanceToNode[neighbour - 1] = distanceToNode[curNode - 1] + 1;\n\n // Add to queue to process next\n queue.add(neighbour);\n\n // If the distance is bigger than current furthest one, update\n if (distanceToNode[neighbour - 1] > furthestDistance)\n furthestNode = neighbour;\n }\n }\n }\n return furthestNode;\n }","public int[] shortestPath(int destination) throws BellmanFordException{\n \n Stack<Integer> tempStack = new Stack<Integer>(); // We create a temporary stack to store the path that we would want to return backwardly. ie: pushing the destination (our last node) into the stack first.\n int[] shortestPath; // array to return \n tempStack.push(destination);\n \n int currentNode = destination;\n\n while (predecessors[currentNode] != -1) \n {\n\t\t\tcurrentNode = predecessors[currentNode]; // Get the predecessor of each node from the predecessor array\n\t\t\ttempStack.push(currentNode); // Push our result into our temp stack.\n\t\t}\n\n if (tempStack.peek() == destination) // Check if the top of our stack is our input destination, if so, that means there isn't a path exists between our source and destination.\n {\n\t\t\tthrow (new PathDoesNotExistException (\"Error: there isn't a path exists between the node: \" + this.source + \" and the node: \" + destination + \".\"));\n\t\t}\n \n shortestPath = new int[tempStack.size()]; // Our return array will have the same size as our tempStack.\n int i = 0;\n while (tempStack.isEmpty() == false) \n {\n\t\t\tcurrentNode = tempStack.pop(); // Popping nodes from our temp stack \n\t\t\tshortestPath[i] = currentNode; // and store them into our return array. By doing this, we will have the correct order of nodes that forms a path between our source and destination.\n\t\t\ti++;\n\t\t}\n\t\treturn shortestPath;\n }","private void calculateShortestDistances (GraphStructure graph,int startVertex,int destinationVertex) {\r\n\t\t//traverseRecursively(graph, startVertex);\r\n\t\tif(pathList.contains(destinationVertex)) {\r\n\t\t\tdistanceArray = new int [graph.getNumberOfVertices()];\r\n\t\t\tint numberOfVertices=graph.getNumberOfVertices();\r\n\t\t\tSet<Integer> spanningTreeSet = new HashSet<Integer>();\r\n\t\t\tArrays.fill(distanceArray,Integer.MAX_VALUE);\r\n\t\t\tdistanceArray[startVertex]=0;\r\n\t\t\tadjacencyList = graph.getAdjacencyList();\r\n\t\t\tList<Edge> list;\r\n\t\t\tlist = graph.getAdjacencyList()[startVertex];\r\n\t\t\tif(startVertex==destinationVertex) {\r\n\t\t\t\treturn;\r\n\t\t\t} else {\r\n\t\t\t\tfor(Edge value : list) {\r\n\t\t\t\t\tif(! isVisited[value.getVertex()]) {\r\n\t\t\t\t\t\tint sumOfWeightAndSourceVertexDistanceValue = distanceArray[startVertex] + value.getWeight();\r\n\t\t\t\t\t\tint distanceValueOfDestinationVertex = distanceArray[value.getVertex()];\r\n\t\t\t\t\t\tif( sumOfWeightAndSourceVertexDistanceValue < distanceValueOfDestinationVertex ) {\r\n\t\t\t\t\t\t\tdistanceArray[value.getVertex()] = sumOfWeightAndSourceVertexDistanceValue;\r\n\t\t\t\t\t\t\tshortestPathList.add(value.getVertex());\r\n\t\t\t\t\t\t\tcalculateShortestDistances(graph,value.getVertex(), distanceValueOfDestinationVertex);\r\n\t\t\t\t\t\t} \r\n\t\t\t\t\t} \r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t/*for(Integer value : spanningTreeSet) {\r\n\t\t\t\tSystem.out.print(value+\" \");\r\n\t\t\t}*/\r\n\t\t} else {\r\n\t\t\tSystem.out.println(\"No route is present between given vertices !\");\r\n\t\t}\r\n\t}","void dijkstra(int graph[][], int src) {\n int dist[] = new int[V]; // The output array. dist[i] will hold\n // the shortest distance from src to i\n\n // sptSet[i] will true if vertex i is included in shortest\n Boolean sptSet[] = new Boolean[V];\n\n for (int i = 0; i < V; i++) {\n dist[i] = Integer.MAX_VALUE;\n sptSet[i] = false;\n }\n\n dist[src] = 0;\n\n // Find shortest path for all vertices\n for (int count = 0; count < V-1; count++) {\n\n int u = minDistance(dist, sptSet);\n\n // Mark the picked vertex as processed\n sptSet[u] = true;\n\n // Update dist value of the adjacent vertices of the\n // picked vertex.\n for (int v = 0; v < V; v++)\n\n\n if (!sptSet[v] && graph[u][v]!=0 &&\n dist[u] != Integer.MAX_VALUE &&\n dist[u]+graph[u][v] < dist[v])\n dist[v] = dist[u] + graph[u][v];\n }\n\n printSolution(dist, V);\n }","@Test\n void testShortestPath(){\n weighted_graph g = new WGraph_DS();\n for(int i = 1; i <= 7; i++){\n g.addNode(i);\n }\n g.connect(1,2,20);\n g.connect(1,5,15);\n g.connect(2,3,20);\n g.connect(5,6,15);\n g.connect(3,4,20);\n g.connect(6,4,15);\n g.connect(1,7,2);\n g.connect(7,4,1);\n weighted_graph_algorithms ga = new WGraph_Algo();\n ga.init(g);\n LinkedList<node_info> expectedPath = new LinkedList<>(Arrays.asList(g.getNode(1),g.getNode(7),g.getNode(4)));\n assertNull(ga.shortestPath(1,10));\n assertEquals(expectedPath,ga.shortestPath(1,4));\n assertEquals(1,ga.shortestPath(1,1).size());\n }","@Override\n public List<node_data> shortestPath(int src, int dest) {\n reset();\n for (node_data node : G.getV()) {\n node.setWeight(Double.POSITIVE_INFINITY);\n }\n\n DWGraph_DS.Node currentNode = (DWGraph_DS.Node) G.getNode(src);\n currentNode.setWeight(0);\n PriorityQueue<node_data> unvisitedNodes = new PriorityQueue(G.nodeSize(), weightComperator);\n unvisitedNodes.addAll(G.getV());\n HashMap<Integer, node_data> parent = new HashMap<>();\n parent.put(src, null);\n\n while (currentNode.getWeight() != Double.POSITIVE_INFINITY) {\n if (G.getNode(dest).getTag() == 1) {\n break;\n }\n for (edge_data edge : G.getE(currentNode.getKey())) {\n DWGraph_DS.Node neighbor = (DWGraph_DS.Node) G.getNode(edge.getDest());\n double tmpWeight = currentNode.getWeight() + edge.getWeight();\n if (tmpWeight < neighbor.getWeight()) {\n neighbor.setWeight(tmpWeight);\n unvisitedNodes.remove(neighbor);\n unvisitedNodes.add(neighbor);\n parent.put(neighbor.getKey(), currentNode);\n }\n }\n currentNode.setTag(1);\n if(currentNode.getKey()==dest) break;\n unvisitedNodes.remove(currentNode);\n currentNode = (DWGraph_DS.Node) unvisitedNodes.poll();\n }\n /*\n Rebuild the path list\n */\n if (!parent.keySet().contains(dest)) return null;\n List<node_data> pathList = new ArrayList<>();\n currentNode = (DWGraph_DS.Node) G.getNode(dest);\n while (parent.get(currentNode.getKey()) != null) {\n pathList.add(currentNode);\n currentNode = (DWGraph_DS.Node) parent.get(currentNode.getKey());\n }\n Collections.reverse(pathList);\n return pathList;\n }","public List<Vertex> shortestPath(Vertex start, Vertex end) {\r\n\t\tMap<Vertex, Vertex> backRefs = new HashMap<Vertex, Vertex>();\r\n\r\n\t\t// Create a queue for BFS\r\n\t\tQueue<Vertex> queue = new LinkedList<Vertex>();\r\n\r\n\t\t// Mark the current node as visited and enqueue it. Use backRef as\r\n\t\t// visited set\r\n\t\tqueue.offer(start);\r\n\t\tbackRefs.put(start, null);\r\n\r\n\t\tVertex currentNode;\r\n\t\tSet<Vertex> neighbors;\r\n\r\n\t\twhile (queue.size() != 0) { // or !queue.isEmpty()\r\n\t\t\t// Dequeue a vertex from queue and print it\r\n\t\t\tcurrentNode = queue.poll();\r\n\r\n\t\t\tif (currentNode.equals(end)) {\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\r\n\t\t\t// Get all adjacent vertices of the dequeued vertex s\r\n\t\t\t// If a adjacent has not been visited, then mark it\r\n\t\t\t// visited and enqueue it\r\n\t\t\tneighbors = currentNode.getNeighbors();\r\n\r\n\t\t\tfor (Vertex n : neighbors) {\r\n\t\t\t\tif (!backRefs.containsKey(n)) {\r\n\t\t\t\t\tqueue.offer(n);\r\n\t\t\t\t\tbackRefs.put(n, currentNode);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (!backRefs.containsKey(end))\r\n\t\t\treturn null;\r\n\r\n\t\tList<Vertex> path = new ArrayList<Vertex>();\r\n\t\tcurrentNode = end;\r\n\r\n\t\twhile (currentNode != null) {\r\n\t\t\tpath.add(currentNode);\r\n\t\t\tcurrentNode = backRefs.get(currentNode);\r\n\t\t}\r\n\r\n\t\tCollections.reverse(path);\r\n\r\n\t\treturn path;\r\n\t}","@Override\n\tpublic List<node_data> shortestPath(int src, int dest) {\n\t\tfor(node_data vertex : dwg.getV()) {\n\t\t\tvertex.setInfo(\"\"+Double.MAX_VALUE);\n\t\t}\n\t\tint[] prev = new int[dwg.nodeSize()];\n\t\tnode_data start = dwg.getNode(src);\n\t\tstart.setInfo(\"0.0\");\n\t\tQueue<node_data> q = new LinkedBlockingQueue<node_data>();\n\t\tq.add(start);\n\t\tprev[src%dwg.nodeSize()] = -1;\n\t\twhile(!q.isEmpty()) {\n\t\t\tnode_data v = q.poll();\n\t\t\tCollection<edge_data> edgesV = dwg.getE(v.getKey());\n\t\t\tfor(edge_data edgeV : edgesV) {\n\t\t\t\tdouble newSumPath = Double.parseDouble(v.getInfo()) +edgeV.getWeight();\n\t\t\t\tint keyU = edgeV.getDest();\n\t\t\t\tnode_data u = dwg.getNode(keyU);\n\t\t\t\tif(newSumPath < Double.parseDouble(u.getInfo())) {\n\t\t\t\t\tu.setInfo(\"\"+newSumPath);\n\t\t\t\t\tq.remove(u);\n\t\t\t\t\tq.add(u);\n\t\t\t\t\tprev[u.getKey()%dwg.nodeSize()] = v.getKey();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tList<node_data> ans = new ArrayList<node_data>();\n\t\tint run = dest;\n\t\twhile(run != src) {\n\t\t\tans.add(0,dwg.getNode(run));\n\t\t\trun = prev[run%dwg.nodeSize()];\n\t\t}\n\t\tans.add(0, dwg.getNode(src));\n\n\t\treturn ans;\n\t}","@Override\n public List<Node> findShortestPath(Node s, Node t)\n {\n nodeDists.clear(); //clear previously calculated distances\n\n recordNodeDistances(s, t); //record node distances to target\n\n LinkedList<Node> shortestPath = new LinkedList<Node>();\n\n shortestPath.addLast(s);\n\n boolean reachedEnd = false;\n\n if(s==t) reachedEnd = true; // \"That was easy\"\n\n while(!reachedEnd)\n {\n //get the neighbors from the most recent step on the path\n Collection<? extends Node> neighbors = shortestPath.getLast().getNeighbors();\n\n //minimum cost from neighbors\n Node minNode = null;\n\n for(Node n: neighbors)\n {\n if(minNode == null || nodeDists.get(n) < nodeDists.get(minNode))\n {\n minNode = n;\n\n if(nodeDists.get(n) == 0)\n {\n reachedEnd = true;\n break;\n }\n }\n }\n\n if(nodeDists.get(minNode) == Integer.MAX_VALUE) return null; //no path\n else shortestPath.addLast(minNode);\n }\n\n return shortestPath;\n }","private static void computePaths(Vertex source) {\n source.minDistance = 0;\n // retrieves with log(n) time\n PriorityQueue<Vertex> vertexPriorityQueue = new PriorityQueue<>();\n\n //BFS traversal\n vertexPriorityQueue.add(source);\n\n // O((v + e) * log(v))\n while (!vertexPriorityQueue.isEmpty()) {\n // this poll always returns the shortest distance vertex at log(v) time\n Vertex vertex = vertexPriorityQueue.poll();\n\n //visit each edge exiting vertex (adjacencies)\n for (Edge edgeInVertex : vertex.adjacencies) {\n // calculate new distance between edgeInVertex and target\n Vertex targetVertex = edgeInVertex.target;\n double edgeWeightForThisVertex = edgeInVertex.weight;\n double distanceThruVertex = vertex.minDistance + edgeWeightForThisVertex;\n if (distanceThruVertex < targetVertex.minDistance) {\n // modify the targetVertex with new calculated minDistance and previous vertex\n // by removing the old vertex and add new vertex with updates\n vertexPriorityQueue.remove(targetVertex);\n targetVertex.minDistance = distanceThruVertex;\n // update previous with the shortest distance vertex\n targetVertex.previous = vertex;\n vertexPriorityQueue.add(targetVertex);// adding takes log(v) time because needs to heapify\n }\n }\n }\n }","public static void main(String[] args) {\n\n BDNode a = new BDNode(\"A\");\n BDNode b = new BDNode(\"B\");\n BDNode c = new BDNode(\"C\");\n BDNode d = new BDNode(\"D\");\n BDNode e = new BDNode(\"E\");\n\n a.link(b);\n a.link(d);\n b.link(a);\n b.link(c);\n b.link(e);\n c.link(b);\n c.link(d);\n d.link(a);\n d.link(c);\n d.link(e);\n e.link(b);\n e.link(d);\n\n BDNode target = e;\n\n/*\n // BFS\n Queue<BDNode> queue = new LinkedList<>();\n queue.offer(a);\n\n while(!queue.isEmpty()) {\n BDNode n = queue.poll();\n n.visit();\n System.out.println(n); // 찾는 여정 출력\n\n if(n.equals(target)) {\n System.out.println(\"BFS Found! \" + n);\n break;\n }\n\n for (BDNode l : n.links) {\n if(l.isVisited()) continue;\n if (queue.contains(l)) continue;\n queue.offer(l);\n }\n\n // 위랑 같은 표현\n// n.links.stream()\n// .filter(l -> !queue.contains(l))\n// .forEach(queue::offer);\n }\n*/\n\n // DFS\n Stack<BDNode> stack = new Stack<>();\n stack.push(a);\n\n while(!stack.isEmpty()) {\n BDNode n = stack.pop();\n n.visit();\n System.out.println(n); // 찾는 여정 출력\n\n if (n.equals(target)) {\n System.out.println(\"DFS Found! \" + n);\n break;\n }\n\n for (BDNode l : n.links) {\n if (l.isVisited()) continue;\n if (stack.contains(l)) continue;\n\n stack.push(l);\n }\n }\n\n\n }","public static Graph dijkstra(Graph graph, Node source) {\n source.distance = 0;\n Set<Node> settledNodes = new HashSet<>();\n Set<Node> unsettledNodes = new HashSet<>();\n unsettledNodes.add(source);\n \n while (unsettledNodes.size() != 0) {\n Node currentNode = Graph.getLowestDistanceNode(unsettledNodes);\n unsettledNodes.remove(currentNode);\n for (Map.Entry<Node, Integer> adjacencyPair: \n currentNode.adjacentNodes.entrySet()) {\n Node adjacentNode = adjacencyPair.getKey();\n Integer edgeWeight = adjacencyPair.getValue();\n if (!settledNodes.contains(adjacentNode)) {\n Graph.calculateMinimumDistance(adjacentNode, edgeWeight, currentNode);\n unsettledNodes.add(adjacentNode);\n }\n }\n settledNodes.add(currentNode);\n }\n return graph;\n }","static void FindPath(vertex s, vertex[] array){\r\n\t\tvertex v; \r\n\t\tint min = Integer.MAX_VALUE;\r\n\t\t//node wN; vertex wV; //wN= adjacent node in LinkedList; wV= find the values in the vertices for wL\r\n\t\tint j =0;\r\n\t\ts.known = true;\r\n\t\ts.dist = 0;\r\n\t\tShortestPath(s, array);\r\n\t\r\n\t\twhile(j<array.length-1 ){ //&& array[j].known== false){\r\n\t\t\tint count = 0; \r\n\t\t\tmin = Integer.MAX_VALUE;\r\n\t\t\tfor(int i = 0; i<array.length; i++){\r\n\t\t\t\tif(array[i].known== false && array[i].dist < min){\r\n\t\t\t\t\tmin = array[i].dist;\r\n\t\t\t\t\tcount = i;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tv = array[count];\r\n //System.out.println(\"count: \" + count + \"Next v: \" + v.name);\r\n\t\t\tShortestPath(v, array);\r\n\t\t\tj++; \t\t\r\n }\r\n\t}","private void breadthFirstSearch(Node sourceNode, Node destinationNode, String path, HashSet<Character> visited) {\n // Create a list of nodes to visit (children of nodes)\n LinkedList<Node> nextToVisit = new LinkedList<>();\n // Add the first node to the list\n nextToVisit.add(sourceNode);\n\n // Traverse level by level by traversing to all of its children first\n while(!nextToVisit.isEmpty()) {\n Node node = nextToVisit.remove();\n // If its visited already, continue to the next child\n if(visited.contains(node.charId)) {\n continue;\n }\n // Mark the node as visited\n path += \"->\" + node.charId;\n visited.add(node.charId);\n // If destination is reached\n if(node == destinationNode) {\n paths.add(path);\n return;\n }\n // Add all of its children to the next node to visit\n for(Node children : node.adjacent) {\n nextToVisit.add(children);\n }\n }\n\n }","public void dijkstra(int graphWeight[][], int source){\r\n\t\t\r\n\t\tint queue[] = new int[vertices]; //The array which will hold the shortest distance from source to node i\r\n\t\tboolean set[] = new boolean[vertices]; //It will store true for node i if the shortest path to that vertex or node is found\r\n\t\t\r\n\t\t//Initialize distances to infinity and set[] array to false \r\n\t\tfor(int i=0;i<vertices;i++){\r\n\t\t\tqueue[i] = Integer.MAX_VALUE; \r\n\t\t\tset[i] = false;\r\n\t\t}\r\n\t\t\r\n\t\t//Distance of source vertex from itself is always 0\r\n\t\tqueue[source] = 0;\r\n\r\n\t\t//Find shortest path of all the vertices\r\n\t\tfor(int count=0;count<vertices-1;count++){\r\n\t\t\t\r\n\t\t\t//Pick the minimum distance vertex from the from the set of vertices \r\n\t\t\t//not processed. u is equal to source in first iteration\r\n\t\t\tint u = extractMinDistance(queue, set);\r\n\t\t\t\r\n\t\t\t//Mark the picked vertex processed\r\n\t\t\tset[u] = true;\r\n\t\t\t//Update queue value of the adjacent vertices of the picked vertex\r\n\t\t\tfor(int v=0;v<vertices;v++)\r\n\t\t\t{\r\n\t\t\t\t//Update queue[v] only if\r\n\t\t\t\t// 1. It is not in set true in the Set Array\r\n\t\t\t\t// 2. There is an edge from u to v\r\n\t\t\t\t// 3. Total weight of path from source to v through u is smaller than current value of queue[v]\r\n\t\t\t\tif((graphWeight[u][v] > 0) && set[v] == false){\r\n\t\t\t\t\t\tif(queue[u] + graphWeight[u][v] < queue[v]){\r\n\t\t\t\t\t\t\tqueue[v] = queue[u] + graphWeight[u][v];\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t//printSolution(queue, vertices);\r\n\t\t}\r\n\t\t//Print the constructed distance array\r\n\t\tprintSolution(queue, vertices);\r\n\t}","public Stack<Point> shortestPath() {\n\t\tresetVisited();\n\t\tStack <Point> shortestPath = new Stack<Point>();\n\t\tprev = new HashMap<Point,Point>();\n\t\tCompass[] direction = Compass.values();\n\t\tQueue <Point> path = new LinkedList<Point>();\n\t\tpath.add(playerStart);\n\t\twhile(!path.isEmpty()) {\n\t\t\tPoint current = path.poll();\n\t\t\tfor (Compass pointing: direction) {\n\t\t\t\tif (current.equals(goal)) {\n\t\t\t\t\tshortestPath.push(current);\n\t\t\t\t\twhile (prev.containsKey(shortestPath.peek()) && !shortestPath.peek().equals(playerStart)){\n\t\t\t\t\t\tshortestPath.push(prev.get(shortestPath.peek()));\n\t\t\t\t\t}\n\t\t\t\t\treturn shortestPath;\n\t\t\t\t}\n\t\t\t\tint nextW = (int)current.getX() + pointing.mapX;\n\t\t\t\tint nextH = (int)current.getY() + pointing.mapY;\n\t\t\t\tPoint nextPoint = new Point(nextW, nextH);\n\t\t\t\tif (arrayBounds(nextW, width) && arrayBounds (nextH, height) && maze[nextW][nextH] == 0 && !visited.contains(nextPoint)) {\n\t\t\t\t\tpath.add(nextPoint);\n\t\t\t\t\tvisited.add(nextPoint);\n\t\t\t\t\tprev.put(nextPoint, current);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn shortestPath;\t\t\n\t}","@Test\n public void directedRouting() {\n EdgeIteratorState rightNorth, rightSouth, leftSouth, leftNorth;\n graph.edge(0, 1).setDistance(1).set(speedEnc, 10, 10);\n graph.edge(1, 2).setDistance(1).set(speedEnc, 10, 10);\n graph.edge(2, 3).setDistance(1).set(speedEnc, 10, 10);\n graph.edge(3, 4).setDistance(3).set(speedEnc, 10, 10);\n rightNorth = graph.edge(4, 10).setDistance(1).set(speedEnc, 10, 10);\n rightSouth = graph.edge(10, 5).setDistance(1).set(speedEnc, 10, 10);\n graph.edge(5, 6).setDistance(2).set(speedEnc, 10, 10);\n graph.edge(6, 2).setDistance(1).set(speedEnc, 10, 10);\n graph.edge(2, 7).setDistance(1).set(speedEnc, 10, 10);\n graph.edge(7, 8).setDistance(9).set(speedEnc, 10, 10);\n leftSouth = graph.edge(8, 9).setDistance(1).set(speedEnc, 10, 10);\n leftNorth = graph.edge(9, 0).setDistance(1).set(speedEnc, 10, 10);\n\n // make paths fully deterministic by applying some turn costs at junction node 2\n setTurnCost(7, 2, 3, 1);\n setTurnCost(7, 2, 6, 3);\n setTurnCost(1, 2, 3, 5);\n setTurnCost(1, 2, 6, 7);\n setTurnCost(1, 2, 7, 9);\n\n final double unitEdgeWeight = 0.1;\n assertPath(calcPath(9, 9, leftNorth.getEdge(), leftSouth.getEdge()),\n 23 * unitEdgeWeight + 5, 23, (long) ((23 * unitEdgeWeight + 5) * 1000),\n nodes(9, 0, 1, 2, 3, 4, 10, 5, 6, 2, 7, 8, 9));\n assertPath(calcPath(9, 9, leftSouth.getEdge(), leftNorth.getEdge()),\n 14 * unitEdgeWeight, 14, (long) ((14 * unitEdgeWeight) * 1000),\n nodes(9, 8, 7, 2, 1, 0, 9));\n assertPath(calcPath(9, 10, leftSouth.getEdge(), rightSouth.getEdge()),\n 15 * unitEdgeWeight + 3, 15, (long) ((15 * unitEdgeWeight + 3) * 1000),\n nodes(9, 8, 7, 2, 6, 5, 10));\n assertPath(calcPath(9, 10, leftSouth.getEdge(), rightNorth.getEdge()),\n 16 * unitEdgeWeight + 1, 16, (long) ((16 * unitEdgeWeight + 1) * 1000),\n nodes(9, 8, 7, 2, 3, 4, 10));\n }","public String BFS(int g) {\n\t\t//TODO\n\t}","public List<GeographicPoint> dijkstra(GeographicPoint start, \n\t\t\t\t\t\t\t\t\t\t GeographicPoint goal, Consumer<GeographicPoint> nodeSearched)\n\t{\n\t\t// TODO: Implement this method in WEEK 4\n\n\t\t// Hook for visualization. See writeup.\n\t\t//nodeSearched.accept(next.getLocation());\n\t\t\n\t\t//initialize distance of each MapNode from start to infinity\n\t\t\n\t\tSet<GeographicPoint> visited = new HashSet<GeographicPoint>();\n\t\tPriorityQueue<MapNode> queue = new PriorityQueue<MapNode>();\n\t\tHashMap<GeographicPoint, List<GeographicPoint>> path = new HashMap<GeographicPoint, List<GeographicPoint>>();\n\t\tint count = 0;\n\t\t\n\t\tif (!map.containsKey(start) || !map.containsKey(goal))\n\t\t\treturn null;\n\t\t\n\t\tfor (GeographicPoint temp : map.keySet())\n\t\t\tpath.put(temp, new ArrayList<GeographicPoint>());\n\t\t\n\t\tMapNode startNode = map.get(start);\n\t\tstartNode.setTimeToStart(0.0);\n\t\tstartNode.setDistanceToStart(0.0);\n\t\tqueue.add(startNode);\n\t\t\n\t\twhile (!queue.isEmpty()) {\n\t\t\tMapNode currNode = queue.poll();\n\t\t\tnodeSearched.accept(currNode.getLocation());\n\t\t\t\n\t\t\tif (!visited.contains(currNode.getLocation())) {\n\t\t\t\tvisited.add(currNode.getLocation());\n\t\t\t\tcount++;\n\t\t\t\t\n\t\t\t\tif (currNode.getLocation().equals(goal))\n\t\t\t\t\tbreak;\n\t\t\t\t\n\t\t\t\tHashMap<MapEdge, GeographicPoint> neighbours = currNode.getNeighbours();\n\t\t\t\tfor (MapEdge edge : neighbours.keySet()) {\n\t\t\t\t\t\n\t\t\t\t\tif (!visited.contains(edge.getEnd())) {\n\t\t\t\t\t\t\n\t\t\t\t\t\tMapNode addNode = map.get(neighbours.get(edge));\n\t\t\t\t\t\tdouble tempTime = currNode.getTimeToStart() + ((edge.getDistance())/(edge.getSpeedLimit()));\n\t\t\t\t\t\t\n\t\t\t\t\t\tif (tempTime < addNode.getTimeToStart()) {\n\t\t\t\t\t\t\taddNode.setTimeToStart(tempTime);\n\t\t\t\t\t\t\tqueue.add(addNode);\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tList<GeographicPoint> temp = path.get(neighbours.get(edge));\n\t\t\t\t\t\t\ttemp.add(currNode.getLocation());\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(\"Dijkstra: \" + count);\n\t\treturn backTrack(path,goal);\n\t}","public void floyd_warshall()\n{\n /*\n * We get the minimum tree again, but we allow cycles this time. This gives\n * us the complete tree, but with edges ranked by priority.\n */\n this.minimumTree = this._getKruskalTree(true);\n for (int loop = 0;\n loop < this.nVerts;\n loop++\n ) {\n this.bellman_ford(loop);\n }\n}","private List<Pair<Integer, Integer>> getBestPath(Pair<Integer, Integer> curLocation, Pair<Integer, Integer> dest) {\n\t\tList<Pair<Integer, Integer>> path = new LinkedList<Pair<Integer, Integer>>();\n\t\t\n\t\t\n\t\tNode current = new Node(curLocation.getX(), curLocation.getY(), getHitProbability(curLocation.getX(), curLocation.getY()));\n\t\tNode target = new Node(dest.getX(), dest.getY(), getHitProbability(dest.getX(), dest.getY()));\n\t\tList<Node> openSet = new ArrayList<>();\n List<Node> closedSet = new ArrayList<>();\n \n \n while (true) {\n openSet.remove(current);\n List<Node> adjacent = getAdjacentNodes(current, closedSet, target);\n\n // Find the adjacent node with the lowest heuristic cost.\n for (Node neighbor : adjacent) {\n \tboolean inOpenset = false;\n \tList<Node> openSetCopy = new ArrayList<>(openSet);\n \tfor (Node node : openSetCopy) {\n \t\tif (neighbor.equals(node)) {\n \t\t\tinOpenset = true;\n \t\t\tif (neighbor.getAccumulatedCost() < node.getAccumulatedCost()) {\n \t\t\t\topenSet.remove(node);\n \t\t\t\topenSet.add(neighbor);\n \t\t\t}\n \t\t}\n \t}\n \t\n \tif (!inOpenset) {\n \t\topenSet.add(neighbor);\n \t}\n }\n\n // Exit search if done.\n if (openSet.isEmpty()) {\n System.out.printf(\"Target (%d, %d) is unreachable from position (%d, %d).\\n\",\n target.getX(), target.getY(), curLocation.getX(), curLocation.getY());\n return null;\n } else if (/*isAdjacent(current, target)*/ current.equals(target)) {\n break;\n }\n\n // This node has been explored now.\n closedSet.add(current);\n\n // Find the next open node with the lowest cost.\n Node next = openSet.get(0);\n for (Node node : openSet) {\n if (node.getCost(target) < next.getCost(target)) {\n next = node;\n }\n }\n// System.out.println(\"Moving to node: \" + current);\n current = next;\n }\n \n // Rebuild the path using the node parents\n path.add(new Pair<Integer, Integer>(curLocation.getX(), curLocation.getY()));\n while(current.getParent() != null) {\n \tcurrent = current.getParent();\n \tpath.add(0, new Pair<Integer, Integer>(current.getX(), current.getY()));\n }\n \n if (path.size() > 1) {\n \tpath.remove(0);\n }\n \n\t\treturn path;\n\t}","public String breadthFirstSearch( AnyType start_vertex ) throws VertexException {\n \n StringBuffer buffer = new StringBuffer();\n \n // ----------------------------\n // TODO: Add your code here\n // ----------------------------\n boolean exists = false;\n Vertex<AnyType> S = new Vertex<AnyType>(start_vertex);\n int counter = 1;\n //make new vertex to check if its in list\n //make queue to hold vertices\n SemiConstantTimeQueue<Vertex<AnyType>> queue = new SemiConstantTimeQueue<Vertex<AnyType>>();\n //loop through and set not visited\n for( int i = 0; i < vertex_adjacency_list.size(); i++){\n vertex_adjacency_list.get(i).setVisited(-1);\n //if it's in list then set exists to true\n //and set visited \n if(vertex_adjacency_list.get(i).compareTo(S) == 0){\n exists = true;\n vertex_adjacency_list.get(i).setVisited(counter);\n counter = i;\n }\n } \n //if doesn't exist then throw the exception\n if(exists == false){\n throw new VertexException(\"Start Vertex does not exist\");\n }\n //make new queue\n queue.add(vertex_adjacency_list.get(counter));\n vertex_adjacency_list.get(counter).setVisited(1);\n counter = 1;\n int k=0;\n Vertex<AnyType>e;\n //while the queue isn't empty\n while(queue.peek() !=null){\n //make e the top of the queue \n e = queue.peek(); \n //go through the list and if you reach the begining it exits loop\n for( k = 0; k < vertex_adjacency_list.size()-1; k++){\n if(vertex_adjacency_list.get(k).compareTo(e)==0){\n break;\n }\n } \n //go through loop and check if visited, if not then add it to queue, set visited\n for( int j = 0; j< vertex_adjacency_list.get(k).numberOfAdjacentVertices(); j++){\n if(vertex_adjacency_list.get(k).getAdjacentVertex(j).hasBeenVisited()==false){\n counter++;\n queue.add(vertex_adjacency_list.get(k).getAdjacentVertex(j));\n vertex_adjacency_list.get(k).getAdjacentVertex(j).setVisited(counter);\n }\n }\n //remove from queue when through loop once\n k++;\n queue.remove();\n }\n //loop through list and print vertex and when it was visited\n for(int o = 0; o< vertex_adjacency_list.size(); o++){\n buffer.append(vertex_adjacency_list.get(o) + \":\" + vertex_adjacency_list.get(o).getVisited()+ \"\\n\");\n }\n return buffer.toString();\n }","public static ArrayList<edges<String, Double>> Dijkstra(String CHAR1, String CHAR2, graph<String,Float> g) {\n\t\tPriorityQueue<ArrayList<edges<String, Double>>> active = \n\t\t\tnew PriorityQueue<ArrayList<edges<String, Double>>>(10,new Comparator<ArrayList<edges<String, Double>>>() {\n\t\t\t\tpublic int compare(ArrayList<edges<String, Double>> path1, ArrayList<edges<String, Double>> path2) {\n\t\t\t\t\tedges<String, Double> dest1 = path1.get(path1.size() - 1);\n\t\t\t\t\tedges<String, Double> dest2 = path2.get(path2.size() - 1);\n\t\t\t\t\tif (!(dest1.getLabel().equals(dest2.getLabel())))\n\t\t\t\t\t\treturn dest1.getLabel().compareTo(dest2.getLabel());\n\t\t\t\t\treturn path1.size() - path2.size();\n\t\t\t\t}\n\t\t\t});\n\t\t\tSet<String> known = new HashSet<String>();\n\t\t\tArrayList<edges<String, Double>> begin = new ArrayList<edges<String, Double>>();\n\t\t\tbegin.add(new edges<String, Double>(CHAR1, 0.0));\n\t\t\tactive.add(begin);\t\t\n\t\t\twhile (!active.isEmpty()) {\n\t\t\t\tArrayList<edges<String, Double>> minPath = active.poll();\n\t\t\t\tedges<String, Double> endOfMinPath = minPath.get(minPath.size() - 1);\n\t\t\t\tString minDest = endOfMinPath.getDest();\n\t\t\t\tdouble minCost = endOfMinPath.getLabel();\n\t\t\t\tif (minDest.equals(CHAR2)) {\n\t\t\t\t\treturn minPath;\n\t\t\t\t}\n\t\t\t\tif (known.contains(minDest))\n\t\t\t\t\tcontinue;\n\t\t\t\tSet<edges<String,Float>> children = g.childrenOf(minDest);\n\t\t\t\tfor (edges<String, Float> e : children) {\n\t\t\t\t\tif (!known.contains(e.getDest())) {\n\t\t\t\t\t\tdouble newCost = minCost + e.getLabel();\n\t\t\t\t\t\tArrayList<edges<String, Double>> newPath = new ArrayList<edges<String, Double>>(minPath); \n\t\t\t\t\t\tnewPath.add(new edges<String, Double>(e.getDest(), newCost));\n\t\t\t\t\t\tactive.add(newPath);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tknown.add(minDest);\n\t\t\t}\n\t\t\treturn null;\n\t}","private void computeShortestPathsFromSource(V source) {\n\t\tBFSDistanceLabeler<V, E> labeler = new BFSDistanceLabeler<V, E>();\n\t\tlabeler.labelDistances(mGraph, source);\n\t\tdistances = labeler.getDistanceDecorator();\n\t\tMap<V, Number> currentSourceSPMap = new HashMap<V, Number>();\n\t\tMap<V, E> currentSourceEdgeMap = new HashMap<V, E>();\n\n\t\tfor (V vertex : mGraph.getVertices()) {\n\n\t\t\tNumber distanceVal = distances.get(vertex);\n\t\t\t// BFSDistanceLabeler uses -1 to indicate unreachable vertices;\n\t\t\t// don't bother to store unreachable vertices\n\t\t\tif (distanceVal != null && distanceVal.intValue() >= 0) {\n\t\t\t\tcurrentSourceSPMap.put(vertex, distanceVal);\n\t\t\t\tint minDistance = distanceVal.intValue();\n\t\t\t\tfor (E incomingEdge : mGraph.getInEdges(vertex)) {\n\t\t\t\t\tfor (V neighbor : mGraph\n\t\t\t\t\t\t\t.getIncidentVertices(incomingEdge)) {\n\t\t\t\t\t\tif (neighbor.equals(vertex))\n\t\t\t\t\t\t {\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t// V neighbor = mGraph.getOpposite(vertex,\n\t\t\t\t\t\t// incomingEdge);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tNumber predDistanceVal = distances.get(neighbor);\n\n\t\t\t\t\t\tint pred_distance = predDistanceVal.intValue();\n\t\t\t\t\t\tif (pred_distance < minDistance && pred_distance >= 0) {\n\t\t\t\t\t\t\tminDistance = predDistanceVal.intValue();\n\t\t\t\t\t\t\tcurrentSourceEdgeMap.put(vertex, incomingEdge);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tmDistanceMap.put(source, currentSourceSPMap);\n\t\tmIncomingEdgeMap.put(source, currentSourceEdgeMap);\n\t}","private void dijkstra(final NavigableSet<Node> queue) {\n Node firstNode, neighbor;\n while (!queue.isEmpty()) {\n // vertex with shortest distance (first iteration will return source)\n firstNode = queue.pollFirst();\n assert firstNode != null;\n if (!explored.contains(firstNode.coordinate)) {\n explored.add(firstNode.coordinate);\n }\n if (firstNode.dist == Integer.MAX_VALUE)\n // we can ignore u (and any other remaining vertices) since they are unreachable\n break;\n //look at distances to each neighbour\n for (Map.Entry<Node, Integer> temp : firstNode.neighbours.entrySet()) {\n neighbor = temp.getKey(); //the neighbour in this iteration\n if (!explored.contains(neighbor.coordinate)) {\n explored.add(neighbor.coordinate);\n }\n final int alternateDist = firstNode.dist + temp.getValue();\n if (alternateDist < neighbor.dist) { // shorter path to neighbour found\n queue.remove(neighbor);\n neighbor.dist = alternateDist;\n neighbor.previous = firstNode;\n queue.add(neighbor);\n }\n }\n }\n }","@Override\r\n\tpublic void getMinimumSpanningTree(GraphStructure graph) {\r\n\t\tdistanceArray = new int [graph.getNumberOfVertices()];\r\n\t\tint numberOfVertices=graph.getNumberOfVertices();\r\n\t\tSet<Integer> spanningTreeSet = new HashSet<Integer>();\r\n\t\tArrays.fill(distanceArray,Integer.MAX_VALUE);\r\n\t\tdistanceArray[0]=0;\r\n\t\tadjacencyList = graph.getAdjacencyList();\r\n\t\tList<Edge> list;\r\n\t\twhile(spanningTreeSet.size()!=numberOfVertices) {\r\n\t\t\tfor (int vertex=0; vertex<numberOfVertices;vertex++) {\r\n\t\t\t\tif(! spanningTreeSet.contains(vertex)) {\r\n\t\t\t\t\tspanningTreeSet.add(vertex);\r\n\t\t\t\t\tlist = adjacencyList[vertex];\r\n\t\t\t\t\tfor(Edge value : list) {\r\n\t\t\t\t\t\tint sumOfWeightAndSourceVertexDistanceValue = distanceArray[vertex] + value.getWeight();\r\n\t\t\t\t\t\tint distanceValueOfDestinationVertex = distanceArray[value.getVertex()];\r\n\t\t\t\t\t\tif( sumOfWeightAndSourceVertexDistanceValue < distanceValueOfDestinationVertex ) {\r\n\t\t\t\t\t\t\tdistanceArray[value.getVertex()] = sumOfWeightAndSourceVertexDistanceValue;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tSystem.out.println(\"\\nvertex\\tdistance from source\");\r\n\t\tfor (int i=0;i<numberOfVertices;i++) {\r\n\t\t\tSystem.out.println(i+\"\\t\"+distanceArray[i]);\r\n\t\t}\r\n\t}","@Override\n List<NodeData> pathFind() throws NoPathException {\n System.out.println(\"Starting Scenic\");\n\n frontier.add(start);\n\n while(!frontier.isEmpty()) {\n StarNode current = frontier.getLast();\n frontier.removeLast(); // pop the priority queue\n if(current.getXCoord() == goal.getXCoord() && current.getYCoord() == goal.getYCoord()) {\n // If we are at the goal, we need to backtrack through the shortest path\n System.out.println(\"At target!\");\n finalList.add(current); // we have to add the goal to the path before we start backtracking\n while(!(current.getXCoord() == start.getXCoord() && current.getYCoord() == start.getYCoord())) {\n finalList.add(current.getPreviousNode());\n current = current.getPreviousNode();\n System.out.println(current.getNodeID());\n }\n return finalList;\n }\n else {\n // we need to get all the neighbor nodes, identify their costs, and put them into the queue\n LinkedList<StarNode> neighbors = current.getNeighbors();\n // we also need to remove the previous node from the list of neighbors because we do not want to backtrack\n neighbors.remove(current.getPreviousNode());\n\n for (StarNode newnode : neighbors) {\n int nodePlace = this.listContainsId(frontier, newnode);\n if(nodePlace > -1) {\n if (frontier.get(nodePlace).getF() > actionCost(newnode) + distanceToGo(newnode, goal)) {\n System.out.println(\"Here\");\n frontier.remove(frontier.get(nodePlace));\n newnode.setPreviousNode(current);\n frontier.add(newnode);\n newnode.setF(actionCost(newnode) + distanceToGo(newnode, goal));\n }\n }\n else {\n newnode.setPreviousNode(current);\n frontier.add(newnode);\n newnode.setF(actionCost(newnode) + distanceToGo(newnode, goal));\n }\n\n // This fixes the problem with infinitely looping elevators (I hope)\n if(current.getNodeType().equals(\"ELEV\") && newnode.getNodeType().equals(\"ELEV\")) {\n for (Iterator<StarNode> iterator = newnode.neighbors.iterator(); iterator.hasNext();) {\n StarNode newneighbor = iterator.next();\n if (newneighbor.getNodeType().equals(\"ELEV\")) {\n // Remove the current element from the iterator and the list.\n iterator.remove();\n }\n }\n }\n if(current.getNodeType().equals(\"STAI\") && newnode.getNodeType().equals(\"STAI\")) {\n for (Iterator<StarNode> iterator = newnode.neighbors.iterator(); iterator.hasNext();) {\n StarNode newneighbor = iterator.next();\n if (newneighbor.getNodeType().equals(\"STAI\")) {\n // Remove the current element from the iterator and the list.\n iterator.remove();\n }\n }\n }\n // this is where the node is put in the right place in the queue\n Collections.sort(frontier);\n }\n }\n }\n throw new NoPathException(start.getLongName(), goal.getLongName());\n }","@Nullable\n private NodeWithCost<V, A> findShortestPath(@Nonnull DirectedGraph<V, A> graph,\n V start, V goal, @Nonnull ToDoubleFunction<A> costf) {\n PriorityQueue< NodeWithCost<V, A>> frontier = new PriorityQueue<>(61);\n Map<V, NodeWithCost<V, A>> frontierMap = new HashMap<>(61);\n // Size of explored is the expected number of nextArrows that we need to explore.\n Set<V> explored = new HashSet<>(61);\n return doFindShortestPath(start, frontier, frontierMap, goal, explored, graph, costf);\n }","public LinkedList<Node> shortestPath() throws PathNotFoundException {\n // Which strategy shall we use?\n ApplicationConfiguration config = ApplicationConfiguration.getInstance();\n switch(config.getCurrentSearchAlgorithm()) {\n case A_STAR:\n return aStarPath();\n case BFS:\n return bfsPath();\n case DFS:\n return dfsPath();\n default:\n return null;\n }\n }","public ArrayList<String> breadthFirstSearch(Character sourceId, Character destinationId) {\n if(!graph.containsKey(sourceId) || !graph.containsKey(destinationId)) {\n throw new NullPointerException(\"The graph does not contain the source or the destination node ID\");\n }\n // Initialize the list of paths & visited set\n paths = new ArrayList<>();\n HashSet<Character> visited = new HashSet<>();\n // Get the nodes from the map\n Node sourceNode = getNode(sourceId);\n Node destinationNode = getNode(destinationId);\n // Call the private method\n breadthFirstSearch(sourceNode, destinationNode, \"\", visited);\n // Return the paths found\n return paths;\n }","private HashMap<String, Integer> getShortestPathBetweenDifferentNodes(Node start, Node end) {\n HashMap<Node, Node> parentChildMap = new HashMap<>();\n parentChildMap.put(start, null);\n\n // Shortest path between nodes\n HashMap<Node, Integer> shortestPathMap = new HashMap<>();\n\n for (Node node : getNodes()) {\n if (node == start)\n shortestPathMap.put(start, 0);\n else shortestPathMap.put(node, Integer.MAX_VALUE);\n }\n\n for (Edge edge : start.getEdges()) {\n shortestPathMap.put(edge.getDestination(), edge.getWeight());\n parentChildMap.put(edge.getDestination(), start);\n }\n\n while (true) {\n Node currentNode = closestUnvisitedNeighbour(shortestPathMap);\n\n if (currentNode == null) {\n return null;\n }\n\n // Save path to nearest unvisited node\n if (currentNode == end) {\n Node child = end;\n String path = end.getName();\n while (true) {\n Node parent = parentChildMap.get(child);\n if (parent == null) {\n break;\n }\n\n // Create path using previous(parent) and current(child) node\n path = parent.getName() + \"\" + path;\n child = parent;\n }\n HashMap<String,Integer> hm= new HashMap<>();\n hm.put(path, shortestPathMap.get(end));\n return hm;\n }\n currentNode.visit();\n\n // Go trough edges and find nearest\n for (Edge edge : currentNode.getEdges()) {\n if (edge.getDestination().isVisited())\n continue;\n\n if (shortestPathMap.get(currentNode) + edge.getWeight() < shortestPathMap.get(edge.getDestination())) {\n shortestPathMap.put(edge.getDestination(), shortestPathMap.get(currentNode) + edge.getWeight());\n parentChildMap.put(edge.getDestination(), currentNode);\n }\n }\n }\n }","public List<String> computeBestPath(String source, String dest)\r\n {\r\n Vertex v;\r\n List<String>shortestPath = new LinkedList<String>();\r\n \r\n // First, relax all nodes\r\n computeAllPaths(source);\r\n \r\n // Then go through each one and return the path as a list of strings\r\n for (v= network_topology.get(dest); v != null; v = v.previous)\r\n { \r\n shortestPath.add(v.name);\r\n }\r\n \r\n Collections.reverse(shortestPath);\r\n \r\n // Clear the relaxed values so that they can be recalculated with each term\r\n clearPathData();\r\n \r\n return shortestPath;\r\n }","public KnightNode getPathByBFS(KnightNode startNode,\n\t\t\tKnightNode finishNode) {\n\t\tif (startNode == null) {\n\t\t\tthrow new IllegalArgumentException(\"start node shouldn't be null!\");\n\t\t}\n\n\t\tif (finishNode == null) {\n\t\t\tthrow new IllegalArgumentException(\"finish node shouldn't be null!\");\n\t\t}\n\n\t\tQueue<KnightNode> queue = new LinkedList<KnightNode>();\n\n\t\t// step 0\n\t\tstartNode.isUsed = true;\n\t\tqueue.add(startNode);\n\t\n\t\twhile (!queue.isEmpty()) {\n\t\t\t// get next node from head of queue\n\t\t\tKnightNode tmpNode = queue.remove();\n\t\t\tSet<KnightNode> childNodes = tmpNode.availableMoves;\n\t\t\tfor (KnightNode tmpChild : childNodes) {\n\t\t\t\ttmpChild = findNode(tmpChild.x, tmpChild.y);\n\t\t\t\t// check if we have already been here\n\t\t\t\tif (!tmpChild.isUsed) {\n\t\t\t\t\ttmpChild.root = tmpNode;\n\t\t\t\t\ttmpChild.isUsed = true;\n\t\t\t\t\tqueue.add(tmpChild);\n\n\t\t\t\t\tif (tmpChild.equals(finishNode)) {\n\t\t\t\t\t\t// we have found our short path\n\t\t\t\t\t\treturn tmpChild;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t\t// path is not exist\n\t\treturn null;\n\t}","void dijkstra(Coordinate startName) {\n if (!graph.containsKey(startName)) {\n //test use print statement\n //System.out.printf(\"Graph doesn't contain start vertex \\\"%s\\\"\\n\", startName);\n return;\n }\n final Node source = graph.get(startName);\n NavigableSet<Node> queue = new TreeSet<>();\n\n // set-up vertices\n for (Node node : graph.values()) {\n node.previous = node == source ? source : null;\n node.dist = node == source ? 0 : Integer.MAX_VALUE;\n queue.add(node);\n }\n dijkstra(queue);\n }","public static void exampleGraph() {\n\t\t// create a simple FNSS topology\n\t\tTopology topology = new Topology();\n\t\ttopology.addEdge(\"1\", \"2\", new Edge());\n\t\ttopology.addEdge(\"2\", \"3\", new Edge());\n\t\t\n\t\t// convert to JGraphT\n\t\tGraph<String, Edge> graph = JGraphTConverter.getGraph(topology);\n\t\t\n\t\t// Find shortest paths\n\t\tString source = \"3\";\n\t\tString destination = \"1\";\n\t\tList<Edge> sp = DijkstraShortestPath.findPathBetween(graph, source, destination);\n\t\t\n\t\t// Print results\n\t\tSystem.out.println(\"Shortest path from \" + source + \" to \" + destination + \":\");\n\t\tfor (Edge e : sp) {\n\t\t\tSystem.out.println(graph.getEdgeSource(e) + \" -> \" + graph.getEdgeTarget(e));\n\t\t}\n\t}","public static void djikstra(int[][] graph, int src) {\n\t\t/* output array */\n\t\tint[] dist = new int[graph.length];\n\t\tboolean[] visited = new boolean[graph.length];\n\n\t\tfor (int i = 0; i < graph.length; i++) {\n\t\t\tdist[i] = Integer.MAX_VALUE;\n\t\t\tvisited[i] = false;\n\t\t}\n\n\t\tdist[src] = 0;\n\n\t\tfor (int i = 0; i < graph.length - 1; i++) {\n\n\t\t\t// Pick the minimum distance vertex from the set of vertices not\n\t\t\t// yet processed. u is always equal to src in first iteration.\n\t\t\tint u = findMinDistanceVertex(dist, visited);\n\t\t\t// Mark the picked vertex as processed\n\t\t\tvisited[u] = true;\n\t\t\t\n\t\t\tfor(int j = 0; j < graph.length; j++) {\n\t\t\t\t\n\t\t\t\t// Update dist[v] only if is not in sptSet, there is an edge from \n\t\t // u to v, and total weight of path from src to v through u is \n\t\t // smaller than current value of dist[v]\n\t\t\t\tif(!visited[j] && graph[u][j] != 0\n\t\t\t\t\t\t&& dist[u] != Integer.MAX_VALUE\n\t\t\t\t\t\t&& dist[u] + graph[u][j] < dist[j]) {\n\t\t\t\t\tdist[j] = dist[u] + graph[u][j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tprintSolution(dist, graph.length);\n\t}","public static void getShortestPath()\r\n\t{\r\n\t\tScanner scan = new Scanner(System.in); //instance for input declared\r\n\t\tSystem.out.print(\"\\nPlease enter the Source node for shortest path: \");\r\n\t\tint src = scan.nextInt() - 1;\r\n\t\twhile(src < 0 || src > routers-1)\r\n {\r\n\t\t\tSystem.out.println(\"The entered source node is out of range, please enter again: \"); // Printing error\r\n\t\t\tsrc = scan.nextInt() - 1;\t//re-input source\r\n\t\t}\r\n\t\t\r\n\t\tSystem.out.print(\"Please enter the destination node for shortest path: \");\r\n\t\tint dest = scan.nextInt() - 1;\r\n\t\twhile(dest < 0 || dest > routers-1)\r\n {\r\n\t\t\tSystem.out.println(\"The entered destination node is out of range, please enter again: \"); // Printing error\r\n\t\t\tdest = scan.nextInt() - 1;\t//re-input destination\r\n\t\t}\r\n\t\t\r\n\t\tconnectNetwork(src, dest, true);\r\n\t}","static int shortestCellPath(int[][] grid, int sr, int sc, int tr, int tc) {\n\n\n Queue<Pair> queue = new LinkedList<>();\n\n\n boolean visited[][] = new boolean[grid.length][grid[0].length];\n\n\n int dirs[][] = new int[][]{{1,0},{0,1},{-1,0},{0,-1}};\n\n queue.offer(new Pair(sr,sc,0));\n visited[sr][sc] = true;\n\n while(!queue.isEmpty()){\n\n Pair currentNode = queue.poll();\n\n if(currentNode.row == tr && currentNode.col == tc) {\n return currentNode.d;\n }\n\n\n\n\n for(int[] dir : dirs) {\n\n\n int row = currentNode.row + dir[0];\n int col = currentNode.col + dir[1];\n\n if(row >= 0 && row < grid.length && col >= 0 && col < grid[0].length && !visited[row][col] && grid[row][col] == 1) {\n queue.offer(new Pair(row,col,currentNode.d+1));\n visited[row][col] = true;\n }\n }\n\n\n\n }\n\n return -1;\n }","HashMap<GamePiece, GamePiece> bfs(GamePiece from) {\n ArrayDeque<GamePiece> worklist = new ArrayDeque<GamePiece>();\n ArrayList<GamePiece> seen = new ArrayList<GamePiece>();\n HashMap<GamePiece, GamePiece> graph = new HashMap<GamePiece, GamePiece>();\n worklist.addFirst(from);\n graph.put(from, from);\n while (worklist.size() > 0) {\n GamePiece next = worklist.removeFirst();\n if (seen.contains(next)) {\n // if seen has the next element, don't do anything with it\n }\n else {\n for (String s : this.directions) {\n if (next.hasNeighbor(s) && next.connected(s)) {\n worklist.addFirst(next.neighbors.get(s));\n graph.put(next.neighbors.get(s), next);\n }\n }\n seen.add(next);\n }\n }\n return graph;\n }","private PathCostFlow findCheapestPath(int start, int end, double max_flow) throws Exception {\n if (getNode(start) == null || getNode(end) == null\n || !getNode(start).isSource() || getNode(end).isSource()) {\n throw new IllegalArgumentException(\"start must be the index of a source and end must be the index of a sink\");\n }\n double amount = Math.min(Math.min(getNode(start).getResidualCapacity(),\n getNode(end).getResidualCapacity()), max_flow);\n\n boolean[] visited = new boolean[n];\n int[] parent = new int[n];\n for (int i = 0; i < n; i++) {\n parent[i] = -1;\n }\n double[] cost = new double[n];\n for (int i = 0; i < n; i++) {\n cost[i] = Integer.MAX_VALUE;\n }\n cost[start] = 0;\n\n PriorityQueue<IndexCostTuple> queue = new PriorityQueue<IndexCostTuple>();\n queue.add(new IndexCostTuple(start, 0));\n\n while (!queue.isEmpty()) {\n IndexCostTuple current = queue.poll();\n\n // we found the target node\n if (current.getIndex() == end) {\n ArrayList<Integer> path = new ArrayList<Integer>();\n path.add(new Integer(end));\n while (path.get(path.size() - 1) != start) {\n path.add(parent[path.get(path.size() - 1)]);\n }\n Collections.reverse(path);\n if ((path.get(0) != start) || (path.get(path.size() - 1) != end)) {\n throw new Exception(\"I fucked up coding Dijkstra's\");\n }\n return new PathCostFlow(path, cost[end], amount);\n }\n\n // iterate through all possible neighbors of the current node\n for (int i = 0; i < n; i++) {\n SingleEdge e = matrix[current.getIndex()][i];\n if ((!visited[i]) && (e != null)\n && (current.getCost() + e.getCost(amount) < cost[i])) {\n cost[i] = current.getCost() + e.getCost(amount);\n parent[i] = current.getIndex();\n\n // update the entry for this node in the queue\n IndexCostTuple newCost = new IndexCostTuple(i, cost[i]);\n queue.remove(newCost);\n queue.add(newCost);\n }\n }\n visited[current.getIndex()] = true;\n }\n\n return null; //the target node was unreachable\n }","private Path aStar(AStarNode start, AStarNode end) {\n\n\t/*pre-search setup*/\n astarSetup(end);\n AStarNode current = start;\n current.updateDist(0.0F);\n ArrayList<AStarNode> openSet = new ArrayList<>(getNodes().size());\n addNode(openSet, start);\n start.setFound(true);\n\n while (!openSet.isEmpty()) { // While there are nodes to evaluate\n if (current.equals(end)) // When reached the destination\n return createPath(start, end);\n openSet.remove(current); // Removes the node whose shortest distance from start position is determined\n current.setVisited(true); // marking the field that is added to closedSet\n \n for (AStarNode neighbor : current.getConnections()) { \n if (!neighbor.isVisited() && !neighbor.found()) { // if it is not seen before, add to open list\n addNode(openSet,neighbor);\n neighbor.setFound(true);\n neighbor.setPrevious(current);\n neighbor.setHeruistic(end);\n neighbor.updateDist(current.getDist() + current.getDistTo(neighbor));\n }\n else if(!neighbor.isVisited()){ //If seen before, update cost.\n double tempGScore = current.getDist() + current.getDistTo(neighbor);\n if (neighbor.getDist() > tempGScore) {\n neighbor.updateDist(tempGScore);\n neighbor.setPrevious(current);\n neighbor.setHeruistic(end);\n }\n }\n }\n current = getMinFScore(openSet); // setting next node as a node with minimum fScore.\n }\n\t\n\t/*If search ends without returning a path, there is no possible path.*/\n throw new PathFindingAlgorithm.AlgorithmFailureException();\n }","private String getShortestPath(final Pair<Long, Long> src, final Pair<Long, Long> dst,\n final String passCode, final boolean first) {\n final var queue = new LinkedList<Node>();\n final var seen = new HashSet<Node>();\n //start from source\n final var srcNode = new Node( src, \"\" );\n queue.add( srcNode );\n seen.add( srcNode );\n\n int max = 0;\n while ( !queue.isEmpty() ) {\n final var curr = queue.remove();\n if ( curr.pos.equals( dst ) ) {\n if ( first ) {\n //shortest path\n return curr.path;\n } else {\n //store path length\n max = curr.path.length();\n //stop this path\n }\n } else {\n for ( final var neighbour : getNeighbours( curr, passCode ) ) {\n //unseen neighbour\n if ( seen.add( neighbour ) ) {\n //add to the queue\n queue.add( neighbour );\n }\n }\n }\n }\n\n return itoa( max );\n }","public void Djkstra(int source) {\n\t\tfor (int i = 0; i < vertices; i++) {\n\t\t\tdist[i] = Integer.MAX_VALUE; // added infinity to all ,\n\t\t}\n\t\t\n\t\tdist[source] = 0;\n\n\t\t// add source vertex to priority queue\n\t\tq.add(new Node(source, 0));\n\n\n\t\t// while my all vertices are not selected as a min among smallest one time\n\t\t// refracted in visited\n\t\twhile (visited.size() != vertices) {\n\n\t\t\t// pick from priority queue the smallest/min distance\n\t\t\tint i = q.remove().node;\n\n\t\t\t// once node is removed from queue add to set\n\t\t\tvisited.add(i);\n\n\t\t\t// relax adjacent vertex of this node;\n\t\t\t// And add the new node to queue bcoz distance has got updated so add new node as i dont have any method to update \n\t\t\t// already present node and its distance\n\t\t\t\n\n\t\t\tfor (Node v : graph[i]) {\n\t\t\t\tif (!visited.contains(v.node)) {\n\t\t\t\t\tif (dist[i] + v.cost < dist[v.node]) {\n\t\t\t\t\t\tdist[v.node] = dist[i] + v.cost;\n\t\t\t\t\t\tq.add(new Node(v.node, dist[v.node]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t}"],"string":"[\n \"void bellman_ford(int s)\\n {\\n int dist[]=new int[V]; \\n \\n //to track the path from s to all\\n int parent[]=new int[V] ;\\n //useful when a vertex has no parent\\n for(int i=0;i<V;i++)\\n parent[i]=-2;\\n \\n for(int i=0;i<V;i++) \\n dist[i]=INF;\\n \\n //start from source vertex\\n dist[s]=0;\\n parent[s]=-1;\\n \\n //we have to iterate over all the edges for V-1 times\\n //each ith iteration finds atleast ith path length dist\\n //worst case each ith will find ith path length \\n \\n for(int i=1;i<V;i++) \\n {\\n for(int j=0;j<E;j++)\\n {\\n //conside for all edges (u,v), wt\\n int u=edge[j].src;\\n int v=edge[j].dest;\\n int wt=edge[j].wt; \\n //since dist[u]=INF and adding to it=>overflow, therefore check first\\n if( dist[u]!=INF && dist[u]+wt < dist[v])\\n {\\n dist[v]=dist[u]+wt;\\n parent[v]=u;\\n } \\n }\\n }\\n \\n //iterate for V-1 times, one more iteration necessarily gives a path length of atleast V in W.C=>cycle\\n for(int j=0;j<E;j++) \\n {\\n int u=edge[j].src;\\n int v=edge[j].dest;\\n int wt=edge[j].wt;\\n if( dist[u]!=INF && dist[u]+wt < dist[v])\\n {\\n System.out.println(\\\"Graph has cycle\\\");\\n return;\\n } \\n }\\n \\n //print the distance to all from s\\n System.out.println(\\\"from source \\\"+s+\\\" the dist to all other\\\");\\n print_dist(dist); \\n print_path(parent,dist,s); \\n \\n }\",\n \"private static void bellmanfordTest() {\\n\\t\\t\\n\\t\\tgraphs.objectorientedgraph.Graph<Integer> graph = new graphs.objectorientedgraph.Graph<Integer>();\\n\\t\\t\\n\\t\\tfor (int i = 0; i < 6; i++)\\n\\t\\t\\tgraph.addVertex(i, i);\\n\\t\\t\\n\\t\\tgraph.addDirectedEdge(0, 1, 0);\\n\\t\\tgraph.addDirectedEdge(0, 2, 0);\\n\\t\\tgraph.addDirectedEdge(0, 3, 0);\\n\\t\\tgraph.addDirectedEdge(0, 4, 0);\\n\\t\\tgraph.addDirectedEdge(0, 5, 0);\\n\\t\\tgraph.addDirectedEdge(5, 1, -1);\\n\\t\\tgraph.addDirectedEdge(5, 2, 1);\\n\\t\\tgraph.addDirectedEdge(1, 4, 4);\\n\\t\\tgraph.addDirectedEdge(1, 3, 5);\\n\\t\\tgraph.addDirectedEdge(2, 1, 0);\\n\\t\\tgraph.addDirectedEdge(3, 5, -3);\\n\\t\\tgraph.addDirectedEdge(3, 4, -1);\\n\\t\\tgraph.addDirectedEdge(4, 5, -3);\\n\\t\\t\\n\\t\\tBellmanFordAlgo<Integer> bellnBellmanFordAlgo = new BellmanFordAlgo(graph ,graph.vertexList.get(0));\\n\\t\\t\\n\\t\\tbellnBellmanFordAlgo.getSingleSourceShortestPath();\\n\\t\\t\\n\\t\\tbellnBellmanFordAlgo.printPath(graph.vertexList.get(3));\\n\\t\\t\\n\\t}\",\n \"public void bellman_ford(int input)\\n{\\n this.minimumTree = this._getKruskalTree(false);\\n /*\\n * Lets write the heritage of our minimum spanning tree to our Bellman Ford\\n * arrays, and see what happens.\\n */\\n while (0 != minimumTree.size()) {\\n Edge nextEdge = minimumTree.remove();\\n this.bellmanParent[nextEdge.destVert] = nextEdge.srcVert;\\n this.bellmanDistance[nextEdge.destVert] = nextEdge.distance;\\n }\\n System.out.println(\\\"shortest path \\\\t\\\\t\\\\t weight\\\");\\n /*\\n * We need to find the immediate children for the input vertex, and see how\\n * far that gets us. Depending upon where the input is in the minimum\\n * spanning tree, only a subtree may be accessible since this is a directed\\n * graph.\\n */\\n for (int loop = 0;\\n loop < this.nVerts;\\n loop++\\n ) {\\n LinkedList<Integer> output = this._findShortestPath(input, loop);\\n Integer result = output.removeFirst();\\n int weight = 0;\\n if (-1 == result) {\\n continue;\\n }\\n System.out.print(this.vertexList[result].label);\\n weight += this.bellmanDistance[result];\\n while (0 != output.size()) {\\n result = output.removeFirst();\\n weight += this.bellmanDistance[result];\\n System.out.print(\\\" -> \\\" + this.vertexList[result].label);\\n }\\n System.out.println(\\\" \\\\t\\\\t\\\\t\\\\t \\\" + weight);\\n }\\n}\",\n \"@Override\\n\\tpublic void bellmanFord(IWeightedGraph<N, E> graph, int startnode) {\\n\\t\\tif(graph == null){\\n\\t\\t\\tthrow new NullPointerException();\\n\\t\\t}else if (startnode < 0 || startnode > graph.numberOfNodes()-1){\\n\\t\\t\\tthrow new IllegalArgumentException();\\n\\t\\t}\\n\\n\\n\\t\\tfor(int i= 0; i<shortestPaths.length;i++){\\n\\t\\t\\tshortestPaths[i] = Double.POSITIVE_INFINITY;\\n\\t\\t}\\n\\t\\tshortestPaths[startnode] = 0;\\n\\n\\t\\tfor(int i= 1; i<graph.numberOfNodes(); i++){\\n\\t\\t\\tIterator<IEdge<E>> edgesIterator = graph.edgeIterator();\\n\\t\\t\\twhile(edgesIterator.hasNext()){\\n\\t\\t\\t\\tIEdge<E> edge = edgesIterator.next();\\n\\t\\t\\t\\tif(shortestPaths[edge.getSource()] + edge.getWeight() < shortestPaths[edge.getDestination()]){\\n\\t\\t\\t\\t\\tshortestPaths[edge.getDestination()] = shortestPaths[edge.getSource()] + edge.getWeight();\\n\\t\\t\\t\\t\\tpreviousNode[edge.getDestination()] = edge.getSource();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}\",\n \"int[] bfs(int[][] graph,int source){\\n int len=graph.length;\\n int shortest_path[]=new int[len];\\n int parent[]=new int[len];\\n Arrays.fill(shortest_path, Integer.MAX_VALUE/2);\\n shortest_path[source]=0;\\n Queue<Integer> q=new LinkedList<>();\\n q.add(source);\\n while (!q.isEmpty()) { \\n int u=q.poll();\\n for(int v:graph[u]){\\n if(shortest_path[v]==Integer.MAX_VALUE/2){\\n q.add(v);\\n shortest_path[v]=shortest_path[u]+1;\\n parent[v]=u;\\n }\\n }\\n }\\n return shortest_path;\\n }\",\n \"void shortestPath( final VertexType fromNode, Integer node );\",\n \"private static void shortestPath(Graph graph, Character startNode, int algorithm) {\\n Node currentNode = graph.getNode(startNode);\\n\\n // keep track of the nodes visited\\n List<Character> nodesVisited = new ArrayList<>();\\n\\n // add the current node\\n nodesVisited.add(currentNode.getName());\\n\\n // breadth first search to help keep track of the nodes we have already visited\\n // helps with backtracking\\n Stack<Node> visitingNodes = new Stack<>();\\n\\n // loop through the graph\\n while (currentNode != graph.getNode('Z')) {\\n // we have visited a node\\n // add it to the stack\\n // set true to since its been visited and it will be in the shortest path\\n visitingNodes.add(currentNode);\\n currentNode.setNodeVisited(true);\\n currentNode.setInShortestPath(true);\\n\\n // get all the edges that are connected to the current node we are on\\n List<Edge> adjacentNodes = currentNode.getNeighbors();\\n\\n // temp for next node\\n Node nextNode = null;\\n int weightDistanceTotal = Integer.MAX_VALUE;\\n\\n for (Edge i: adjacentNodes) {\\n // testing\\n // System.out.println(i.destination.getName());\\n // System.out.println(i.destination.getDistanceToZ());\\n\\n // 1. always check to see if we have visited the node\\n if (i.destination.isNodeVisited()) {\\n // System.out.println(i.destination.getName() + \\\" is already in the path\\\");\\n continue;\\n }\\n\\n // 2. assign the next node to the destination\\n if (nextNode == null) {\\n nextNode = i.destination;\\n }\\n\\n // compare distances\\n if (algorithm == 1) {\\n nextNode = updateNextNodeAlgo1(nextNode, i.destination);\\n } else {\\n NodeWithWeightDistanceTotal nodeWithWeightDistanceTotal = updateNextNodeAlgo2(nextNode, i, weightDistanceTotal);\\n nextNode = nodeWithWeightDistanceTotal.node;\\n weightDistanceTotal = nodeWithWeightDistanceTotal.weightDistanceTotal;\\n }\\n //if (nextNode.getDistanceToZ() > i.destination.getDistanceToZ()) {\\n // nextNode = i.destination;\\n //}\\n }\\n\\n // next has no other edges\\n if (nextNode == null) {\\n // System.out.println(\\\"There no place to go from \\\" + currentNode.getName());\\n // pop off the node we just visited\\n nextNode = visitingNodes.pop();\\n // its not in the shortest path to Z\\n nextNode.setInShortestPath(false);\\n // set the next node to the previous node\\n nextNode = visitingNodes.pop();\\n }\\n\\n // add the nodes we visit to keep track of the path\\n nodesVisited.add(nextNode.getName());\\n\\n // System.out.println(Arrays.toString(nodesVisited.toArray()));\\n // testing purposes to see if the node is on the shortest path\\n\\n// for (Character node: nodesVisited) {\\n// Node boolVisit = graph.getNode(node);\\n// System.out.println(boolVisit.isInShortestPath());\\n// }\\n\\n // progress to the next node\\n currentNode = nextNode;\\n // when visiting the last node mark z in the shortest path\\n if (currentNode.getName() == 'Z') {\\n currentNode.setInShortestPath(true);\\n }\\n // testing\\n // System.out.println(\\\"next node = \\\" + currentNode.getName());\\n }\\n\\n // keep track of the path visited and the total addition of weights\\n int pathCounter = 0;\\n\\n // construct the shortest path\\n List<Node> shortestPath = new ArrayList<>();\\n\\n for (Character nodeVisitor: nodesVisited) {\\n // get the node\\n Node node = graph.getNode(nodeVisitor);\\n\\n // add to the shortest path\\n if (node.isInShortestPath() && !shortestPath.contains(node)) {\\n shortestPath.add(node);\\n }\\n }\\n\\n // print the shortest path\\n for (int i = 0; i < shortestPath.size() - 1; i++) {\\n currentNode = shortestPath.get(i);\\n Node nextNode = shortestPath.get(i + 1);\\n\\n // find the weight of that node\\n int weight = currentNode.findWeight(nextNode);\\n pathCounter += weight;\\n\\n // System.out.println(\\\"weight \\\" + weight);\\n // System.out.println(\\\"path total \\\" + pathCounter);\\n }\\n\\n // final output\\n String fullPathSequence = \\\"\\\";\\n String shortestPathSequence = \\\"\\\";\\n\\n for (int i = 0; i < nodesVisited.size(); i++) {\\n if (i != nodesVisited.size() - 1) {\\n fullPathSequence += nodesVisited.get(i) + \\\" -> \\\";\\n }\\n }\\n\\n fullPathSequence += nodesVisited.get(nodesVisited.size() - 1);\\n\\n for (int i = 0; i < shortestPath.size(); i++) {\\n if (i != shortestPath.size() - 1) {\\n shortestPathSequence += shortestPath.get(i).getName() + \\\" -> \\\";\\n }\\n }\\n\\n if (currentNode.getName() == 'Z') {\\n shortestPathSequence += \\\"Z\\\";\\n } else {\\n shortestPathSequence += shortestPath.get(shortestPath.size() - 1).getName();\\n }\\n\\n System.out.println(\\\"Algorithm \\\" + algorithm + \\\" : \\\");\\n System.out.println(\\\"Sequence of all nodes \\\" + fullPathSequence);\\n System.out.println(\\\"Shortest path: \\\" + shortestPathSequence);\\n System.out.println(\\\"Shortest path length: \\\" + pathCounter);\\n System.out.println(\\\"\\\\n\\\");\\n\\n // reset the graph\\n graph.graphReset();\\n\\n }\",\n \"public void shortestPathsNodes() {\\n for (int sourceNode = 0; sourceNode < wordGraph.V(); sourceNode++) {\\n BreadthFirstDirectedPaths bfs = new BreadthFirstDirectedPaths(wordGraph, sourceNode);\\n\\n for (int goalNode = 0; goalNode < wordGraph.V(); goalNode++) {\\n Iterable<Integer> shortestPath = bfs.pathTo(goalNode);\\n int pathLength = -1;\\n if (shortestPath != null) {\\n for (int edge : shortestPath) {\\n pathLength++;\\n }\\n }\\n if (pathLength != -1) {\\n }\\n System.out.println(pathLength);\\n }\\n }\\n }\",\n \"void BFS(int s, int d) \\r\\n { \\r\\n int source = s;\\r\\n int destination = d;\\r\\n boolean visited[] = new boolean[V];\\r\\n int parent[] = new int[V];\\r\\n \\r\\n // Create a queue for BFS \\r\\n LinkedList<Integer> queue = new LinkedList<Integer>(); \\r\\n \\r\\n // Mark the current node as visited and enqueue it \\r\\n \\r\\n visited[s]=true; \\r\\n queue.add(s); \\r\\n System.out.println(\\\"Search Nodes: \\\");\\r\\n while (queue.size() != 0) \\r\\n { \\r\\n int index = 0;\\r\\n \\r\\n // Dequeue a vertex from queue and print it \\r\\n \\r\\n s = queue.poll();\\r\\n \\r\\n System.out.print(convert2(s)); \\r\\n \\r\\n if(s == destination)\\r\\n {\\r\\n break;\\r\\n }\\r\\n \\r\\n System.out.print(\\\" -> \\\");\\r\\n while(index < adj[s].size()) \\r\\n { \\r\\n \\r\\n \\r\\n int n = adj[s].get(index); \\r\\n if (!visited[n]) \\r\\n { \\r\\n visited[n] = true;\\r\\n parent[n] = s;\\r\\n queue.add(n); \\r\\n }\\r\\n index = index+ 2;\\r\\n \\r\\n \\r\\n }\\r\\n \\r\\n \\r\\n \\r\\n }\\r\\n int check = destination;\\r\\n int cost = 0, first, second = 0;\\r\\n String string = \\\"\\\" + convert2(check);\\r\\n while(check!=source)\\r\\n {\\r\\n \\r\\n first = parent[check];\\r\\n string = convert2(first) + \\\" -> \\\" + string;\\r\\n while(adj[first].get(second) != check)\\r\\n {\\r\\n second++;\\r\\n }\\r\\n cost = cost + adj[first].get(second +1);\\r\\n check = first;\\r\\n second = 0;\\r\\n \\r\\n }\\r\\n \\r\\n System.out.println(\\\"\\\\n\\\\nPathway: \\\");\\r\\n \\r\\n System.out.println(string);\\r\\n \\r\\n \\r\\n System.out.println(\\\"\\\\nTotal cost: \\\" + cost);\\r\\n }\",\n \"void dijkstra(int[][] graph){\\r\\n int dist[] = new int[rideCount];\\r\\n Boolean sptSet[] = new Boolean[rideCount];\\r\\n\\r\\n for(int i = 0; i< rideCount; i++){\\r\\n dist[i] = Integer.MAX_VALUE;\\r\\n sptSet[i] = false;\\r\\n }\\r\\n\\r\\n dist[0] = 0;\\r\\n\\r\\n for(int count = 0; count< rideCount -1; count++){\\r\\n int u = minWeight(dist, sptSet);\\r\\n sptSet[u] = true;\\r\\n for(int v = 0; v< rideCount; v++){\\r\\n if (!sptSet[v] && graph[u][v] != 0 && dist[u] + graph[u][v] < dist[v]){\\r\\n dist[v] = dist[u] + graph[u][v];\\r\\n }\\r\\n }\\r\\n }\\r\\n printSolution(dist);\\r\\n }\",\n \"public int doDijkstras(String startVertex, String endVertex, ArrayList<String> shortestPath)\\r\\n\\t{\\r\\n\\t\\tif(!this.dataMap.containsKey(startVertex) || !this.dataMap.containsKey(endVertex))\\r\\n\\t\\t{\\r\\n\\t\\t\\tthrow new IllegalArgumentException(\\\"Vertex does not exist in the graph!\\\");\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\tSet<String> visited = new HashSet<String>();\\r\\n\\t\\t\\r\\n\\t\\tPriorityQueue<Vertex> minDist = new PriorityQueue<Vertex>();\\r\\n\\t\\t\\r\\n\\t\\tVertex firstV = new Vertex(startVertex,startVertex,0);\\r\\n\\t\\tminDist.add(firstV);\\r\\n\\t\\t\\r\\n\\t\\tfor(String V : this.adjacencyMap.get(startVertex).keySet())\\r\\n\\t\\t{\\r\\n\\t\\t\\tminDist.add(new Vertex(V,startVertex,this.getCost(startVertex, V)));\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t//map of vertexName --> VertexObject\\r\\n\\t\\tHashMap<String, Vertex> mapV = new HashMap<String,Vertex>();\\r\\n\\t\\tmapV.put(startVertex, firstV);\\t\\r\\n\\t\\t\\r\\n\\t\\t/*\\r\\n\\t\\t * Init keys-->costs\\r\\n\\t\\t */\\r\\n\\t\\tfor(String key : this.getVertices())\\r\\n\\t\\t{\\r\\n\\t\\t\\tif(key.equals(startVertex))\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tmapV.put(key, new Vertex(key,null,0));\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tmapV.put(key, new Vertex(key,null,Integer.MAX_VALUE));\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\r\\n\\t\\t/*\\r\\n\\t\\t * Init List for shortest path\\r\\n\\t\\t */\\r\\n\\t\\tLinkedList<String> list = new LinkedList<String>();\\r\\n\\t\\tlist.add(startVertex);\\r\\n\\r\\n\\t\\tHashMap<String,List<String>> path = new HashMap<String,List<String>>();\\r\\n\\t\\tpath.put(startVertex, list);\\r\\n\\t\\t\\r\\n\\t\\twhile(!minDist.isEmpty())\\r\\n\\t\\t{\\r\\n\\t\\t\\tVertex node = minDist.poll();\\r\\n\\t\\t\\tString V = node.current;\\r\\n\\t\\t\\tint minimum = node.cost;\\r\\n\\t\\t\\tSystem.out.println(minDist.toString());\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\tvisited.add(V);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tTreeSet<String> adj = new TreeSet<String>(this.adjacencyMap.get(V).keySet());\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tfor(String successor : adj)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tif(!visited.contains(successor) && !V.equals(successor))\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tint newCost = this.getCost(V, successor)+minimum;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tif(newCost < mapV.get(successor).cost)\\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tminDist.remove(mapV.get(successor));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tminDist.add(new Vertex(successor,V,newCost));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tmapV.put(successor, new Vertex(successor,V,newCost));\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tLinkedList<String> newList = new LinkedList<String>(path.get(V));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tnewList.add(successor);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tpath.put(successor, newList);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tint smallestPath = mapV.get(endVertex).cost == Integer.MAX_VALUE ? -1 : mapV.get(endVertex).cost;\\r\\n\\t\\t\\r\\n\\t\\tif(smallestPath == -1)\\r\\n\\t\\t{\\r\\n\\t\\t\\tshortestPath.add(\\\"None\\\");\\r\\n\\t\\t}\\r\\n\\t\\telse\\r\\n\\t\\t{\\r\\n\\t\\t\\tfor(String node : path.get(endVertex))\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tshortestPath.add(node);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\treturn smallestPath;\\r\\n\\t}\",\n \"ShortestPath(UndirectedWeightedGraph graph, String startNodeId, String endNodeId) throws NotFoundNodeException {\\r\\n\\t\\t\\r\\n\\t\\tif (!graph.containsNode(startNodeId)) {\\r\\n\\t\\t\\tthrow new NotFoundNodeException(graph, startNodeId);\\r\\n\\t\\t}\\t\\t\\r\\n\\t\\tif (!graph.containsNode(endNodeId)) {\\r\\n\\t\\t\\tthrow new NotFoundNodeException(graph, endNodeId);\\r\\n\\t\\t}\\t\\r\\n\\r\\n\\t\\tsrc = startNodeId;\\r\\n\\t\\tdst = endNodeId;\\r\\n\\t\\t\\r\\n\\t\\tif (endNodeId.equals(startNodeId)) {\\r\\n\\t\\t\\tlength = 0;\\r\\n\\t\\t\\tnumOfPath = 1;\\r\\n\\t\\t\\tArrayList<String> path = new ArrayList<String>();\\r\\n\\t\\t\\tpath.add(startNodeId);\\r\\n\\t\\t\\tpathList.add(path);\\r\\n\\t\\t}\\r\\n\\t\\telse {\\r\\n\\t\\t\\t// create a HashMap of updated distance from the starting node to every node\\r\\n\\t\\t\\t// initially it is 0, inf, inf, inf, ...\\r\\n\\t\\t\\tHashMap<String, Double> distance = new HashMap<String, Double>();\\t\\r\\n\\t\\t\\tfor (String nodeId : graph.getNodeList().keySet()) {\\r\\n\\t\\t\\t\\tif (nodeId.equals(startNodeId)) {\\r\\n\\t\\t\\t\\t\\t// the starting node will always have 0 distance from itself\\r\\n\\t\\t\\t\\t\\tdistance.put(nodeId, 0.0);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\t// the others have initial distance is infinity\\r\\n\\t\\t\\t\\t\\tdistance.put(nodeId, Double.MAX_VALUE);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// a HashMap of preceding node of each node\\r\\n\\t\\t\\tHashMap<String, HashSet<String>> precedence = new HashMap<String, HashSet<String>>();\\r\\n\\t\\t\\tfor (String nodeId : graph.getNodeList().keySet()) {\\r\\n\\t\\t\\t\\tif ( nodeId.equals(startNodeId) ) {\\r\\n\\t\\t\\t\\t\\tprecedence.put(nodeId, null);\\t// the start node will have no preceding node\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse { \\r\\n\\t\\t\\t\\t\\tprecedence.put(nodeId, new HashSet<String>());\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//\\r\\n\\t\\t\\tSet<String> unvisitedNode = new HashSet<String>();\\r\\n\\t\\t\\tfor (String nodeId : graph.getNodeList().keySet()) {\\r\\n\\t\\t\\t\\tunvisitedNode.add(nodeId);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tdouble minUnvisitedLength;\\r\\n\\t\\t\\tString minUnvisitedNode;\\r\\n\\t\\t\\t// run loop while not all node is visited\\r\\n\\t\\t\\twhile ( unvisitedNode.size() != 0 ) {\\r\\n\\t\\t\\t\\t// find the unvisited node with minimum current distance in distance list\\r\\n\\t\\t\\t\\tminUnvisitedLength = Double.MAX_VALUE;\\r\\n\\t\\t\\t\\tminUnvisitedNode = \\\"\\\";\\r\\n\\t\\t\\t\\tfor (String nodeId : unvisitedNode) {\\r\\n\\t\\t\\t\\t\\tif (distance.get(nodeId) < minUnvisitedLength) {\\r\\n\\t\\t\\t\\t\\t\\tminUnvisitedNode = nodeId;\\r\\n\\t\\t\\t\\t\\t\\tminUnvisitedLength = distance.get(nodeId); \\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// if there are no node that can be visited from the unvisitedNode, break the loop \\r\\n\\t\\t\\t\\tif (minUnvisitedLength == Double.MAX_VALUE) {\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t}\\t\\t\\t\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// remove the node from unvisitedNode\\r\\n\\t\\t\\t\\tunvisitedNode.remove(minUnvisitedNode);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// update the distance of its neighbors\\r\\n\\t\\t\\t\\tfor (Node neighborNode : graph.getNodeList().get(minUnvisitedNode).getNeighbors().keySet()) {\\r\\n\\t\\t\\t\\t\\tdouble distanceFromTheMinNode = distance.get(minUnvisitedNode) + graph.getNodeList().get(minUnvisitedNode).getNeighbors().get(neighborNode).getWeight();\\r\\n\\t\\t\\t\\t\\t// if the distance of the neighbor can be shorter from the current node, change \\r\\n\\t\\t\\t\\t\\t// its details in distance and precedence\\r\\n\\t\\t\\t\\t\\tif ( distanceFromTheMinNode < distance.get(neighborNode.getId()) ) {\\r\\n\\t\\t\\t\\t\\t\\tdistance.replace(neighborNode.getId(), distanceFromTheMinNode);\\r\\n\\t\\t\\t\\t\\t\\t// renew the precedence of the neighbor node\\r\\n\\t\\t\\t\\t\\t\\tprecedence.put(neighborNode.getId(), new HashSet<String>());\\r\\n\\t\\t\\t\\t\\t\\tprecedence.get(neighborNode.getId()).add(minUnvisitedNode);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if (distanceFromTheMinNode == distance.get(neighborNode.getId())) {\\r\\n\\t\\t\\t\\t\\t\\t// unlike dijkstra's algorithm, multiple path should be update into the precedence\\r\\n\\t\\t\\t\\t\\t\\t// if from another node the distance is the same, add it to the precedence\\r\\n\\t\\t\\t\\t\\t\\tprecedence.get(neighborNode.getId()).add(minUnvisitedNode);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\t\\t\\t\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// if the current node in the process is the end node, we can stop the while loop here\\r\\n\\t\\t\\t\\tif (minUnvisitedNode == endNodeId) {\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif (distance.get(endNodeId) == Double.MAX_VALUE) {\\r\\n\\t\\t\\t\\t// in case there is no shortest path between the 2 nodes\\r\\n\\t\\t\\t\\tlength = 0;\\r\\n\\t\\t\\t\\tnumOfPath = 0;\\r\\n\\t\\t\\t\\tpathList = null;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse {\\r\\n\\t\\t\\t\\t// other wise we have these information\\r\\n\\t\\t\\t\\tlength = distance.get(endNodeId);\\r\\n\\t\\t\\t\\t//numOfPath = this.getNumPath(precedence, startNodeId, endNodeId);\\r\\n\\t\\t\\t\\tpathList = this.findPathList(precedence, startNodeId, endNodeId);\\r\\n\\t\\t\\t\\tnumOfPath = pathList.size();\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\t// END ELSE\\t\\t\\r\\n\\t}\",\n \"public ShortestPath(IWeightedGraph<N,E> graph, int startNode) {\\n\\t\\tthis.graph = graph;\\n\\t\\tthis.startNode = startNode;\\n\\t\\tthis.shortestPaths = new double[graph.numberOfNodes()];\\n\\t\\tthis.previousNode = new int[graph.numberOfNodes()];\\n\\t\\tbellmanFord(this.graph, this.startNode);\\n\\t}\",\n \"private void computeShortestPath(){\\n T current = start;\\n boolean atEnd = false;\\n while (!unvisited.isEmpty()&& !atEnd){\\n int currentIndex = vertexIndex(current);\\n LinkedList<T> neighbors = getUnvisitedNeighbors(current); // getting unvisited neighbors\\n \\n //what is this doing here???\\n if (neighbors.isEmpty()){\\n \\n }\\n \\n // looping through to find distances from start to neighbors\\n for (T neighbor : neighbors){ \\n int neighborIndex = vertexIndex(neighbor); \\n int d = distances[currentIndex] + getEdgeWeight(current, neighbor);\\n \\n if (d < distances[neighborIndex]){ // if this distance is less than previous distance\\n distances[neighborIndex] = d;\\n closestPredecessor[neighborIndex] = current; // now closest predecessor is current\\n }\\n }\\n \\n if (current.equals(end)){\\n atEnd = true;\\n }\\n else{\\n // finding unvisited node that is closest to start node\\n T min = getMinUnvisited();\\n if (min != null){\\n unvisited.remove(min); // remove minimum neighbor from unvisited\\n visited.add(min); // add minimum neighbor to visited\\n current = min;\\n }\\n }\\n }\\n computePath();\\n totalDistance = distances[vertexIndex(end)];\\n }\",\n \"private int bfs(String source, String destination, Map<String, List<String>> graph) {\\n\\n class Node {\\n String word;\\n int distance = 0;\\n\\n public Node(String word, int distance) {\\n this.word = word;\\n this.distance = distance;\\n }\\n }\\n\\n final Queue<Node> queue = new LinkedList<>();\\n Set<String> visited = new HashSet<>();\\n queue.offer(new Node(source, 0)); //distance of source to source is 0\\n visited.add(source);\\n\\n while (!queue.isEmpty()) {\\n\\n final Node node = queue.poll();\\n final int distance = node.distance;\\n\\n //if we reached the destination node\\n if (node.word.equals(destination)) {\\n return distance + 1;\\n }\\n\\n //try all word which is 1 weight away\\n for (String neighbour : graph.getOrDefault(node.word, new ArrayList<>())) {\\n if (!visited.contains(neighbour)) {\\n visited.add(neighbour);\\n queue.offer(new Node(neighbour, distance + 1));\\n }\\n }\\n\\n\\n }\\n return 0;\\n }\",\n \"void shortestPaths( Set<Integer> nodes );\",\n \"private int BFS() {\\n adjList.cleanNodeFields();\\n\\n //Queue for storing current shortest path\\n Queue<Node<Integer, Integer>> q = new LinkedList<>();\\n\\n //Set source node value to 0\\n q.add(adjList.getNode(startNode));\\n q.peek().key = 0;\\n q.peek().d = 0;\\n q.peek().visited = true;\\n\\n //Helper variables\\n LinkedList<Pair<Node<Integer, Integer>, Integer>> neighbors;//Array of pairs <neighborKey, edgeWeight>\\n Node<Integer, Integer> neighbor, u;\\n long speed = (long) (cellSideLength * 1.20);\\n\\n while (!isCancelled() && q.size() != 0) {\\n u = q.poll();\\n\\n //Marks node as checked\\n checkedNodesGC.fillRect((u.value >> 16) * cellSideLength + 0.5f,\\n (u.value & 0x0000FFFF) * cellSideLength + 0.5f,\\n (int) cellSideLength - 1, (int) cellSideLength - 1);\\n\\n //endNode found\\n if (u.value == endNode) {\\n //Draws shortest path\\n Node<Integer, Integer> current = u, prev = u;\\n\\n while ((current = current.prev) != null) {\\n shortestPathGC.strokeLine((prev.value >> 16) * cellSideLength + cellSideLength / 2,\\n (prev.value & 0x0000FFFF) * cellSideLength + cellSideLength / 2,\\n (current.value >> 16) * cellSideLength + cellSideLength / 2,\\n (current.value & 0x0000FFFF) * cellSideLength + cellSideLength / 2);\\n prev = current;\\n }\\n return u.d;\\n }\\n\\n //Wait after checking node\\n try {\\n Thread.sleep(speed);\\n } catch (InterruptedException interrupted) {\\n if (isCancelled())\\n break;\\n }\\n\\n //Checking Neighbors\\n neighbors = adjList.getNeighbors(u.value);\\n for (Pair<Node<Integer, Integer>, Integer> neighborKeyValuePair : neighbors) {\\n neighbor = neighborKeyValuePair.getKey();\\n //Relaxation step\\n //Checks if neighbor hasn't been checked, if so the assign the shortest path\\n if (!neighbor.visited) {\\n //Adds checked neighbor to queue\\n neighbor.key = u.d + 1;\\n neighbor.d = u.d + 1; //Assign shorter path found to neighbor\\n neighbor.prev = u;\\n neighbor.visited = true;\\n q.add(neighbor);\\n }\\n }\\n }\\n return Integer.MAX_VALUE;\\n }\",\n \"@Override\\n public List dijkstrasShortestPath(T start, T end) {\\n Vertex<T> origin = new Vertex<>(start);\\n Vertex<T> destination = new Vertex<>(end);\\n List<Vertex<T>> path;\\n\\n settledNodes = new HashSet<>();\\n unSettledNodes = new HashSet<>();\\n distancesBetweenNodes = new HashMap<>();\\n predecessors = new HashMap<>();\\n\\n distancesBetweenNodes.put(origin,0);\\n unSettledNodes.add(origin);\\n\\n while(unSettledNodes.size() > 0){\\n Vertex<T> minimumWeightedVertex = getMinimum(unSettledNodes);\\n settledNodes.add(minimumWeightedVertex);\\n unSettledNodes.remove(minimumWeightedVertex);\\n findMinimumDistance(minimumWeightedVertex);\\n }\\n path = getPath(destination);\\n return path;\\n\\n }\",\n \"static void BellmanFord(int[][] edges, int src) {\\n int V = edges[0].length;\\n int dist[] = new int[V];\\n\\n // Step 1: Initialize distances from src to all other\\n // vertices as INFINITE\\n for (int i = 0; i < V; i++)\\n dist[i] = Integer.MAX_VALUE;\\n dist[src] = 0;\\n\\n // Step 2: Relax all edges |V| - 1 times. A simple\\n // shortest path from src to any other vertex can\\n // have at-most |V| - 1 edges\\n // var++ is the value of the variable before incrementing, whereas the result returned by ++var is the value of the variable after the increment is applied.\\n for (int i = 1; i < V; i++) {\\n for (int j = 0; j < V; j++) {\\n for (int k = 0; k < V; k++) {\\n if (j != k && edges[j][k] != Integer.MAX_VALUE) {\\n int weight = edges[j][k];\\n if (dist[j] != Integer.MAX_VALUE && dist[j] + weight < dist[k])\\n dist[k] = dist[j] + weight;\\n }\\n }\\n }\\n }\\n\\n // Step 3: check for negative-weight cycles. The above\\n // step guarantees shortest distances if graph doesn't\\n // contain negative weight cycle. If we get a shorter\\n // path, then there is a cycle.\\n for (int j = 0; j < V; j++) {\\n for (int k = 0; k < V; k++) {\\n if (j != k && edges[j][k] != Integer.MAX_VALUE) {\\n int weight = edges[j][k];\\n if (dist[j] != Integer.MAX_VALUE && dist[j] + weight < dist[k])\\n System.out.println(\\\"Graph contains negative weight cycle\\\");\\n }\\n }\\n }\\n System.out.println();\\n }\",\n \"private LinkedList<Integer> _findShortestPath(int source, int destination)\\n{\\n LinkedList<Integer> output = new LinkedList<Integer>();\\n if (this.bellmanParent[destination] == source) {\\n output.addFirst(destination);\\n output.addFirst(source);\\n return output;\\n }\\n /*\\n * Our source is only part of the subtree, and we requested a node beyond\\n * its reach. Lets flag it so that the calling function knows to ignore this\\n * result.\\n */\\n if (this.bellmanParent[destination] == destination) {\\n output.addFirst(-1);\\n return output;\\n }\\n output = this._findShortestPath(source, this.bellmanParent[destination]);\\n output.addLast(destination);\\n return output;\\n}\",\n \"private static void disjkstraAlgorithm(Node sourceNode, GraphBuilder graph){\\n PriorityQueue<Node> smallestDisQueue = new PriorityQueue<>(graph.nodeArr.size(), new Comparator<Node>() {\\n @Override\\n public int compare(Node first, Node sec) {\\n if(first.distance == Integer.MAX_VALUE && sec.distance == Integer.MAX_VALUE){\\n return 0;\\n }\\n else if(first.distance == Integer.MAX_VALUE && sec.distance != Integer.MAX_VALUE){\\n return 1;\\n } else if(first.distance != Integer.MAX_VALUE && sec.distance == Integer.MAX_VALUE){\\n return -1;\\n }\\n else\\n return (int) (first.distance - sec.distance);\\n }\\n });\\n\\n smallestDisQueue.add(sourceNode); //add the node to the queue\\n\\n // until all vertices are know get the vertex with smallest distance\\n\\n while(!smallestDisQueue.isEmpty()) {\\n\\n Node currNode = smallestDisQueue.poll();\\n// System.out.println(\\\"Curr: \\\");\\n// System.out.println(currNode);\\n if(currNode.known)\\n continue; //do nothing if the currNode is known\\n\\n currNode.known = true; // otherwise, set it to be known\\n\\n for(Edge connectedEdge : currNode.connectingEdges){\\n Node nextNode = connectedEdge.head;\\n if(!nextNode.known){ // Visit all neighbors that are unknown\\n\\n long weight = connectedEdge.weight;\\n if(currNode.distance == Integer.MAX_VALUE){\\n continue;\\n }\\n else if(nextNode.distance == Integer.MAX_VALUE && currNode.distance == Integer.MAX_VALUE) {\\n continue;\\n }\\n\\n else if(nextNode.distance> weight + currNode.distance){//Update their distance and path variable\\n smallestDisQueue.remove(nextNode); //remove it from the queue\\n nextNode.distance = weight + currNode.distance;\\n\\n smallestDisQueue.add(nextNode); //add it again to the queue\\n nextNode.pathFromSouce = currNode;\\n\\n// System.out.println(\\\"Next: \\\");\\n// System.out.println(nextNode);\\n }\\n }\\n }\\n// System.out.println(\\\"/////////////\\\");\\n }\\n }\",\n \"public static List<GraphEdge<String, String>> shortestPath(Graph<String, String> graph, String src, String dest) {\\n // ... implement BFS as described in HW6 ...\\n\\t Queue<GraphNode<String>> q = new LinkedList<GraphNode<String>>();\\n\\t \\n\\t // Each key in m is a visited node\\n\\t // Each value is a list containing the shortest path from start\\n\\t Map<GraphNode<String>, List<GraphEdge<String, String>>> m = new HashMap<GraphNode<String>, List<GraphEdge<String, String>>>();\\n\\t \\n\\t q.add(graph.getNode(src));\\n\\t m.put(graph.getNode(src), new ArrayList<GraphEdge<String, String>>());\\n\\t \\n\\t //{{Inv: m has a key for every node added to q so far\\n\\t //\\t\\t (even those that have since been removed)\\n\\t //\\t The value associated with each key is the shortest path to that node}}\\n\\t while (!q.isEmpty()) {\\n\\t\\t GraphNode<String> temp = q.remove();\\n\\t\\t if (temp.getData().equals(dest)) {\\n\\t\\t\\t return m.get(temp);\\n\\t\\t }\\n\\t\\t \\n\\t\\t Set<GraphEdge<String, String>> set = new TreeSet<GraphEdge<String, String>>();\\n\\t\\t set.addAll(graph.getChildren(temp));\\n\\t\\t \\n\\t\\t for (GraphEdge<String, String> edge : set) {\\n\\t\\t\\t if (!m.containsKey(edge.getDestination())) {\\n\\t\\t\\t\\t List<GraphEdge<String, String>> list = new ArrayList<GraphEdge<String, String>>(m.get(temp));\\n\\t\\t\\t\\t list.add(edge);\\n\\t\\t\\t\\t m.put(edge.getDestination(), list);\\n\\t\\t\\t\\t q.add(edge.getDestination());\\n\\t\\t\\t }\\n\\t\\t }\\n\\t }\\n\\t \\n\\t return null;\\n }\",\n \"public static int shortestDistance(Graph graph, Vertex a, Vertex b) {\\n Set<List<Vertex>> listSetVertex=breadthFirstSearch(graph);\\n int distance=graph.getVertices().size();\\n for(List<Vertex> lv: listSetVertex){\\n int aindex=lv.indexOf(a);\\n int bindex=lv.indexOf(b);\\n if(aindex>=0&&bindex>=0){\\n distance=distance>Math.abs(aindex-bindex)?Math.abs(aindex-bindex):distance;\\n }\\n }\\n return distance==graph.getVertices().size()?-1:distance;\\n }\",\n \"private static ArrayList<Connection> pathFindDijkstra(Graph graph, int start, int goal) {\\n\\t\\tNodeRecord startRecord = new NodeRecord();\\r\\n\\t\\tstartRecord.setNode(start);\\r\\n\\t\\tstartRecord.setConnection(null);\\r\\n\\t\\tstartRecord.setCostSoFar(0);\\r\\n\\t\\tstartRecord.setCategory(OPEN);\\r\\n\\t\\t\\r\\n\\t\\tArrayList<NodeRecord> open = new ArrayList<NodeRecord>();\\r\\n\\t\\tArrayList<NodeRecord> close = new ArrayList<NodeRecord>();\\r\\n\\t\\topen.add(startRecord);\\r\\n\\t\\tNodeRecord current = null;\\r\\n\\t\\tdouble endNodeCost = 0;\\r\\n\\t\\twhile(open.size() > 0){\\r\\n\\t\\t\\tcurrent = getSmallestCSFElementFromList(open);\\r\\n\\t\\t\\tif(current.getNode() == goal){\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tGraphNode node = graph.getNodeById(current.getNode());\\r\\n\\t\\t\\tArrayList<Connection> connections = node.getConnection();\\r\\n\\t\\t\\tfor( Connection connection :connections){\\r\\n\\t\\t\\t\\t// get the cost estimate for end node\\r\\n\\t\\t\\t\\tint endNode = connection.getToNode();\\r\\n\\t\\t\\t\\tendNodeCost = current.getCostSoFar() + connection.getCost();\\r\\n\\t\\t\\t\\tNodeRecord endNodeRecord = new NodeRecord();\\r\\n\\t\\t\\t\\t// if node is closed skip it\\r\\n\\t\\t\\t\\tif(listContains(close, endNode))\\r\\n\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t// or if the node is in open list\\r\\n\\t\\t\\t\\telse if (listContains(open,endNode)){\\r\\n\\t\\t\\t\\t\\tendNodeRecord = findInList(open, endNode);\\r\\n\\t\\t\\t\\t\\t// print\\r\\n\\t\\t\\t\\t\\t// if we didn't get shorter route then skip\\r\\n\\t\\t\\t\\t\\tif(endNodeRecord.getCostSoFar() <= endNodeCost) {\\r\\n\\t\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t// else node is not visited yet\\r\\n\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\tendNodeRecord = new NodeRecord();\\r\\n\\t\\t\\t\\t\\tendNodeRecord.setNode(endNode);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t//update the node\\r\\n\\t\\t\\t\\tendNodeRecord.setCostSoFar(endNodeCost);\\r\\n\\t\\t\\t\\tendNodeRecord.setConnection(connection);\\r\\n\\t\\t\\t\\t// add it to open list\\r\\n\\t\\t\\t\\tif(!listContains(open, endNode)){\\r\\n\\t\\t\\t\\t\\topen.add(endNodeRecord);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}// end of for loop for connection\\r\\n\\t\\t\\topen.remove(current);\\r\\n\\t\\t\\tclose.add(current);\\r\\n\\t\\t}// end of while loop for open list\\r\\n\\t\\tif(current.getNode() != goal)\\r\\n\\t\\t\\treturn null;\\r\\n\\t\\telse { //get the path\\r\\n\\t\\t\\tArrayList<Connection> path = new ArrayList<>();\\r\\n\\t\\t\\twhile(current.getNode() != start){\\r\\n\\t\\t\\t\\tpath.add(current.getConnection());\\r\\n\\t\\t\\t\\tint newNode = current.getConnection().getFromNode();\\r\\n\\t\\t\\t\\tcurrent = findInList(close, newNode);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tCollections.reverse(path);\\r\\n\\t\\t\\treturn path;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public List<node_info> shortestPath(int src, int dest);\",\n \"public static int dijkstra(AdjList<String> adjList, String startNode, String endNode, LinkedList<String> pathList) {\\n //Valid AdjList\\n if (adjList == null || adjList.size() == 0 || adjList.hasNegativeEdges())\\n return Integer.MAX_VALUE;\\n\\n //Checks if start and end nodes exist in adjList\\n if (!adjList.contains(startNode) || !adjList.contains(endNode))\\n return Integer.MAX_VALUE;\\n\\n //Checks if graph is suitable for BFS\\n if (!adjList.isWeighted())\\n return BFS(adjList, startNode, endNode, pathList);\\n\\n //Sets all node objects in adjList to defaults\\n adjList.cleanNodeFields();\\n\\n //Fibonacci heap for storing current shortest path\\n FibHeap<Integer, String> q = new FibHeap<>();\\n\\n //Set source node value to 0\\n q.insert(adjList.getNode(startNode), 0);\\n q.peek().d = 0;\\n q.peek().visited = true;\\n\\n //Helper variables\\n LinkedList<Pair<Node<Integer, String>, Integer>> neighbors;//Array of pairs <neighborKey, edgeWeight>\\n Node<Integer, String> neighbor, u;//Current Node with shortest path / top of min-queue\\n int edgeWeight;\\n while (q.size() != 0) {\\n u = q.extractMin();\\n u.closed = true;\\n\\n //endNode found\\n if (Objects.equals(u.value, endNode)) {\\n //Build path of vertexes\\n Node<Integer, String> current = adjList.getNode(endNode);\\n pathList.add(current.value);\\n while ((current = current.prev) != null)\\n pathList.addFirst(current.value);\\n return u.d;\\n }\\n\\n neighbors = adjList.getNeighbors(u.value);\\n for (Pair<Node<Integer, String>, Integer> neighborKeyValuePair : neighbors) {//Loops through every neighbor\\n neighbor = neighborKeyValuePair.getKey();\\n edgeWeight = neighborKeyValuePair.getValue();\\n //Relaxation step\\n //Checks if distance to neighbor node is less than the min distance already found\\n if (!neighbor.visited || neighbor.d > u.d + edgeWeight) {\\n //Assign shorter path found to neighbor in out array\\n neighbor.d = u.d + edgeWeight;\\n\\n //Assigns previous shortest node to neighbor\\n neighbor.prev = u;\\n\\n //Inserts or decrease key\\n if (!neighbor.visited) {\\n q.insert(neighbor, u.d + edgeWeight);\\n neighbor.visited = true;\\n } else {\\n q.decreaseKey(neighbor, u.d + edgeWeight);\\n }\\n }\\n }\\n }\\n return Integer.MAX_VALUE;\\n }\",\n \"public Path shortestPath(Vertex a, Vertex b) {\\n // If a or b aren't present in the set of vertices throw an exception\\n if (!myGraph.containsKey(b) || !myGraph.containsKey(a)) {\\n throw new IllegalArgumentException(\\\"One of the vertices isn't valid\\\");\\n }\\n /* Create a map of Vertices to VertexInfos. Fill it with VertexInfos for all\\n vertices that each have no previous vertex and and a cost of INFINITY */\\n Map<Vertex, VertexInfo> vertInfos = new HashMap<Vertex, VertexInfo>();\\n for (Vertex v : vertices()) {\\n vertInfos.put(v, new VertexInfo(v, null, INFINITY));\\n }\\n /* Create a PriorityQueue for VertexInfos */\\n PriorityQueue<VertexInfo> viQueue = new PriorityQueue<VertexInfo>();\\n /* Create a VertexInfo for the start Vertex 'a' with a cost of 0. This uses a copy of Vertex a&b for immutability */\\n Vertex copyA = new Vertex(a.getLabel());\\n Vertex copyB = new Vertex(b.getLabel());\\n\\n VertexInfo vi_a = new VertexInfo(copyA, null, 0);\\n /* Add VerxtexInfo for a to PQ and map it to it's VertexInfo */\\n viQueue.add(vi_a);\\n vertInfos.put(a, vi_a);\\n while(!viQueue.isEmpty()) {\\n /* Remove the VertexInfo with lowest cost */\\n Vertex curr = viQueue.poll().getVertex();\\n /* Check all adjacent Vertices of curr Vertex */\\n for (Vertex v : adjacentVertices(curr)) {\\n /* Calculate cost to get to v through curr */\\n int cost = vertInfos.get(curr).getCost() + edgeCost(curr, v);\\n /* If cost through curr is lower than previous */\\n if (cost < vertInfos.get(v).getCost()) {\\n /* Remove v's VertexInfo from PQ */\\n viQueue.remove(vertInfos.get(v));\\n /* Overwrite previous value of v in map\\n Add updated VerexInfo to PQ */\\n VertexInfo vi = new VertexInfo(v, curr, cost);\\n vertInfos.put(v,vi);\\n viQueue.add(vi);\\n }\\n }\\n }\\n /* Create ArrayList for path */\\n List<Vertex> path = new ArrayList<Vertex>();\\n \\n /* Add each vertex and it's previous vertex to path until a null vertex is reached */\\n for (Vertex vert = copyB; vert != null; vert = vertInfos.get(vert).getPrev()) {\\n path.add(vert);\\n }\\n\\n /* Reverse order of path */ \\n Collections.reverse(path);\\n /* Create new Path object with corresponding parameters */\\n if(path.contains(copyA)){\\n Path pathToB = new Path(path, vertInfos.get(copyB).getCost());\\n return pathToB;\\n } else {\\n return null;\\n }\\n }\",\n \"public int shortestPath(Village startVillage, Village targetVillage) {\\n// setting the initial point 's minimum distance to zera\\n startVillage.setMinDistance(0);\\n// accourting to bellman ford if there are n number of dots then n-1 iterations to be done to find the minimum distances of every dot from one initial dot\\n int length = this.villageList.size();\\n// looping n-1 times\\n for (int i = 0; i < length - 1; i++) {\\n// looping through all the roads and mark the minimum distances of all the possible points\\n for (Road road : roadList) {\\n\\n\\n// if the road is a main road then skip the path\\n if (road.getWeight() == 900)\\n continue; //why 900 ? : just a random hightest number as a minimum distance and same 900 is used as a mix number\\n Village v = road.getStartVertex();\\n Village u = road.getTargetVertex();\\n// if the newly went path is less than the path it used to be the update the min distance of the reached vertex\\n int newLengtha = v.getMinDistance() + road.getWeight();\\n if (newLengtha < u.getMinDistance()) {\\n u.setMinDistance(newLengtha);\\n u.setPreviousVertex(v);\\n }\\n int newLengthb = u.getMinDistance() + road.getWeight();\\n if (newLengthb < v.getMinDistance()) {\\n v.setMinDistance(newLengthb);\\n v.setPreviousVertex(v);\\n }\\n }\\n }\\n// finally return the minimum distance\\n return targetVillage.getMinDistance();\\n }\",\n \"private void breadthFirst(PathBetweenNodes graph, LinkedList<String> visited) {\\r\\n\\r\\n LinkedList<String> nodes = graph.adjacentNodes(visited.getLast());\\r\\n for (String node : nodes)\\r\\n {\\r\\n if (visited.contains(node))\\r\\n {\\r\\n continue;\\r\\n }\\r\\n if (node.equals(END))\\r\\n {\\r\\n \\tif (mode1 && mode){\\r\\n visited.add(node);\\r\\n printPath(visited); \\r\\n graph.flag=false;\\r\\n mode=false;\\r\\n visited.removeLast();\\r\\n \\t} else if(mode2){\\r\\n visited.add(node);\\r\\n printPath(visited); \\r\\n flag=mode2; \\r\\n visited.removeLast();\\r\\n \\t} \\r\\n } \\r\\n }\\r\\n\\r\\n for (String node : nodes) { // implementing a for loop to call each node in the array nodes\\r\\n if (visited.contains(node) || node.equals(END)) { // if statement to see if node is already visited or it is the end node\\r\\n continue;\\r\\n }\\r\\n flag=true;\\r\\n visited.addLast(node); //adding the last node to visited array\\r\\n breadthFirst(graph, visited); // implementing the breath first search\\r\\n visited.removeLast(); // removing the last node from array visited\\r\\n }\\r\\n if (flag == false) {\\r\\n System.out.println(\\\"No path Exists between \\\" + START + \\\" and \\\" + END);\\r\\n flag = true;\\r\\n }\\r\\n }\",\n \"public void shortestRouteDijkstra(){\\n int landmark1 = l1.getSelectionModel().getSelectedIndex();\\n int landmark2 = l2.getSelectionModel().getSelectedIndex();\\n GraphNodeAL<MapPoint> lm1 = landmarkList.get(landmark1);\\n GraphNodeAL<MapPoint> lm2 = landmarkList.get(landmark2);\\n\\n shortestRouteDij(lm1, lm2);\\n }\",\n \"@Override\\n\\tpublic List<node_data> shortestPath(int src, int dest) {\\n\\t\\tList<node_data> ans = new ArrayList<>();\\n\\t\\tthis.shortestPathDist(src, dest);\\n\\t\\tif(this.GA.getNode(src).getWeight() == Integer.MAX_VALUE || this.GA.getNode(dest).getWeight() == Integer.MAX_VALUE){\\n\\t\\t\\tSystem.out.print(\\\"There is not a path between the nodes.\\\");\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t\\tgraph copied = this.copy();\\n\\t\\ttransPose(copied);\\n\\t\\tnode_data first = copied.getNode(dest);\\n\\t\\tans.add(first);\\n\\t\\twhile (first.getKey() != src) {\\n\\t\\t\\tCollection<edge_data> temp = copied.getE(first.getKey());\\n\\t\\t\\tdouble check= first.getWeight();\\n\\t\\t\\tif(temp!=null) {\\n\\t\\t\\t\\tfor (edge_data edge : temp) {\\n\\t\\t\\t\\t\\tif (copied.getNode(edge.getDest()).getWeight() + edge.getWeight() == check) {\\n\\t\\t\\t\\t\\t\\tfirst = copied.getNode(edge.getDest());\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tans.add(first);\\n\\t\\t}\\n\\t\\tList<node_data> ans2 = new ArrayList<>();\\n\\t\\tfor (int i = ans.size()-1;i>=0;i--){\\n\\t\\t\\tans2.add(ans.get(i));\\n\\t\\t}\\n\\t\\treturn ans2;\\n\\t}\",\n \"int main()\\n{\\n // Create a graph given in the above diagram\\n Graph g(4);\\n g.addEdge(0, 1);\\n g.addEdge(0, 2);\\n g.addEdge(1, 2);\\n g.addEdge(2, 0);\\n g.addEdge(2, 3);\\n g.addEdge(3, 3);\\n \\n cout << \\\"Following is Breadth First Traversal \\\"\\n << \\\"(starting from vertex 2) n\\\";\\n g.BFS(2);\\n \\n return 0;\\n}\",\n \"public Path getShortestPath() {\\n\\t\\tNodeRecord startRecord = new NodeRecord(start, null, 0.0f, (float) heuristic.estimate(start), Category.OPEN);\\n\\n\\t\\t// Initialize the open list\\n\\t\\tPathFindingList open = new PathFindingList();\\n\\t\\topen.addRecordByEstimatedTotalCost(startRecord);\\n\\t\\trecords.set(Integer.parseInt(startRecord.node.id), startRecord);\\n\\t\\tNodeRecord current = null;\\n\\t\\t\\n\\t\\t// Iterate through processing each node\\n\\t\\twhile (!open.isEmpty()) {\\n\\t\\t\\t// Find smallest element in the open list using estimatedTotalCost\\n\\t\\t\\tcurrent = open.getSmallestNodeRecordByEstimatedTotalCost();\\n\\n\\t\\t\\t// If its the goal node, terminate\\n\\t\\t\\tif (current.node.equals(end)) break;\\n\\n\\t\\t\\t// Otherwise get its outgoing connections\\n\\t\\t\\tArrayList<DefaultWeightedEdge> connections = g.getConnections(current.node);\\n\\t\\t\\t\\n\\t\\t\\t// Loop through each connection\\n\\t\\t\\tfor (DefaultWeightedEdge connection : connections) {\\n\\t\\t\\t\\t// Get the cost and other information for end node\\n\\t\\t\\t Vertex endNode = g.graph.getEdgeTarget(connection);\\n\\t\\t\\t int endNodeRecordIndex = Integer.parseInt(endNode.id);\\n NodeRecord endNodeRecord = records.get(endNodeRecordIndex); // this is potentially null but we handle it\\n\\t\\t\\t\\tdouble newEndNodeCost = current.costSoFar + g.graph.getEdgeWeight(connection);\\n\\t\\t\\t\\tdouble endNodeHeuristic = 0;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// if node is closed we may have to skip, or remove it from closed list\\t\\n\\t\\t\\t\\tif( endNodeRecord != null && endNodeRecord.category == Category.CLOSED ){ \\n\\t\\t\\t\\t\\t// Find the record corresponding to the endNode\\n\\t\\t\\t\\t\\tendNodeRecord = records.get(endNodeRecordIndex);\\n\\n\\t\\t\\t\\t\\t// If we didn't find a shorter route, skip\\n\\t\\t\\t\\t\\tif (endNodeRecord.costSoFar <= newEndNodeCost) continue;\\n\\n\\t\\t\\t\\t\\t// Otherwise remove it from closed list\\n\\t\\t\\t\\t\\trecords.get(endNodeRecordIndex).category = Category.OPEN;\\n\\n\\t\\t\\t\\t\\t// Use node's old cost values to calculate its heuristic to save computation\\n\\t\\t\\t\\t\\tendNodeHeuristic = endNodeRecord.estimatedTotalCost - endNodeRecord.costSoFar;\\n\\n\\t\\t\\t\\t// Skip if node is open and we've not found a better route\\n\\t\\t\\t\\t} else if( endNodeRecord != null && endNodeRecord.category == Category.OPEN ){ \\n\\t\\t\\t\\t\\t// Here we find the record in the open list corresponding to the endNode\\n\\t\\t\\t\\t\\tendNodeRecord = records.get(endNodeRecordIndex);\\n\\n\\t\\t\\t\\t\\t// If our route isn't better, skip\\n\\t\\t\\t\\t\\tif (endNodeRecord.costSoFar <= newEndNodeCost) continue;\\n\\n\\t\\t\\t\\t\\t// Use the node's old cost values to calculate its heuristic to save computation\\n\\t\\t\\t\\t\\tendNodeHeuristic = endNodeRecord.estimatedTotalCost - endNodeRecord.costSoFar;\\n\\n\\t\\t\\t\\t// Otherwise we know we've got an unvisited node, so make a new record\\n\\t\\t\\t\\t} else { // if endNodeRecord.category == Category.UNVISITED\\n\\t\\t\\t\\t endNodeRecord = new NodeRecord();\\n\\t\\t\\t\\t\\tendNodeRecord.node = endNode;\\n\\t\\t\\t\\t\\trecords.set(endNodeRecordIndex, endNodeRecord);\\n\\n\\t\\t\\t\\t\\t// Need to calculate heuristic since this is new\\n\\t\\t\\t\\t\\tendNodeHeuristic = heuristic.estimate(endNode);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\n\\t\\t\\t\\t// We're here if we need to update the node\\n\\t\\t\\t\\t// update the cost, estimate, and connection\\n\\t\\t\\t\\tendNodeRecord.costSoFar = newEndNodeCost;\\n\\t\\t\\t\\tendNodeRecord.edge = connection;\\n\\t\\t\\t\\tendNodeRecord.estimatedTotalCost = newEndNodeCost + endNodeHeuristic;\\n\\n\\t\\t\\t\\t// Add it to the open list\\n\\t\\t\\t\\tif ( endNodeRecord.category != Category.OPEN ) {\\n\\t\\t\\t\\t\\topen.addRecordByEstimatedTotalCost(endNodeRecord);\\n\\t\\t\\t\\t\\tendNodeRecord.category = Category.OPEN;\\n\\t\\t\\t\\t\\trecords.set(endNodeRecordIndex, endNodeRecord);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// We’ve finished looking at the connections for\\n\\t\\t\\t// the current node, so add it to the closed list\\n\\t\\t\\t// and remove it from the open list\\n\\t\\t\\topen.removeRecord(current);\\n\\t\\t\\tcurrent.category = Category.CLOSED;\\n\\t\\t\\trecords.set(Integer.parseInt(current.node.id), current);\\n\\t\\t}\\n\\t\\t\\n\\t\\t// We’re here if we’ve either found the goal, or\\n\\t\\t// if we’ve no more nodes to search, find which.\\n\\t\\tif (!current.node.equals(end)) {\\n\\t\\t\\t// Ran out of nodes without finding the goal, no solution\\n\\t\\t\\treturn null;\\n\\t\\t} else {\\n\\t\\t // Compile the list of connections in the path\\n\\t\\t\\tArrayList<DefaultWeightedEdge> path = new ArrayList<>();\\n\\n\\t\\t\\twhile (!current.node.equals(start)) {\\n\\t\\t\\t\\tpath.add(current.edge);\\n\\t\\t\\t\\t// Set current (NodeRecord) to is source.\\n\\t\\t\\t\\tcurrent = records.get( Integer.parseInt(g.graph.getEdgeSource(current.edge).id) );\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Reverse the path, and return it\\n\\t\\t\\tCollections.reverse(path);\\n\\t\\t\\treturn new Path(g, path);\\n\\t\\t}\\n\\n\\t}\",\n \"public static <N>Path<N> findShortestPath(DirectedGraph<N, Double> graph, N first, N last){\\n PriorityQueue<Path<N>> active = new PriorityQueue<>(new Comparator<Path<N>>() {\\n @Override\\n public int compare(Path<N> x, Path<N> y) {\\n if(x.getCost() > y.getCost()){\\n return 1;\\n } else if (x.getCost() < y.getCost()){\\n return -1;\\n }\\n return 0;\\n }\\n });\\n\\n Set<N> finished = new HashSet<>();\\n N start = first;\\n N end = last;\\n\\n active.add(new Path<N>(start));\\n while(!active.isEmpty()){\\n Path<N> minPath = active.remove();\\n N minDest = minPath.getEnd();\\n if(minDest.equals(end)){\\n return minPath;\\n }\\n if(finished.contains(minDest)){\\n continue;\\n }\\n for(Edge<N, Double> e : graph.getEdges(minDest)){\\n if(!finished.contains(e.getChild())){\\n Path<N> newPath = minPath.extend(e.getChild(), e.getLabel());\\n active.add(newPath);\\n }\\n }\\n finished.add(minDest);\\n }\\n return null;\\n }\",\n \"public static void main(String[] args) {\\n Graph graph = new Graph();\\n graph.addEdge(0, 1);\\n graph.addEdge(0, 4);\\n\\n graph.addEdge(1,0);\\n graph.addEdge(1,5);\\n graph.addEdge(1,2);\\n graph.addEdge(2,1);\\n graph.addEdge(2,6);\\n graph.addEdge(2,3);\\n\\n graph.addEdge(3,2);\\n graph.addEdge(3,7);\\n\\n graph.addEdge(7,3);\\n graph.addEdge(7,6);\\n graph.addEdge(7,11);\\n\\n graph.addEdge(5,1);\\n graph.addEdge(5,9);\\n graph.addEdge(5,6);\\n graph.addEdge(5,4);\\n\\n graph.addEdge(9,8);\\n graph.addEdge(9,5);\\n graph.addEdge(9,13);\\n graph.addEdge(9,10);\\n\\n graph.addEdge(13,17);\\n graph.addEdge(13,14);\\n graph.addEdge(13,9);\\n graph.addEdge(13,12);\\n\\n graph.addEdge(4,0);\\n graph.addEdge(4,5);\\n graph.addEdge(4,8);\\n graph.addEdge(8,4);\\n graph.addEdge(8,12);\\n graph.addEdge(8,9);\\n graph.addEdge(12,8);\\n graph.addEdge(12,16);\\n graph.addEdge(12,13);\\n graph.addEdge(16,12);\\n graph.addEdge(16,17);\\n graph.addEdge(17,13);\\n graph.addEdge(17,16);\\n graph.addEdge(17,18);\\n\\n graph.addEdge(18,17);\\n graph.addEdge(18,14);\\n graph.addEdge(18,19);\\n\\n graph.addEdge(19,18);\\n graph.addEdge(19,15);\\n LinkedList<Integer> visited = new LinkedList();\\n List<ArrayList<Integer>> paths = new ArrayList<ArrayList<Integer>>();\\n int currentNode = START;\\n visited.add(START);\\n new searchEasy().findAllPaths(graph, visited, paths, currentNode);\\n for(ArrayList<Integer> path : paths){\\n for (Integer node : path) {\\n System.out.print(node);\\n System.out.print(\\\" \\\");\\n }\\n System.out.println();\\n }\\n }\",\n \"private void findBestPath(){\\n\\t\\t// The method will try to find the best path for every starting point and will use the minimum\\n\\t\\tfor(int start = 0; start < this.getDimension(); start++){\\n\\t\\t\\tfindBestPath(start);\\t\\n\\t\\t}\\t\\n\\t}\",\n \"public List<Integer> BFS(int s, int t, ArrayList<ArrayList<Integer>> adjacencyLists) {\\n\\t\\tint N = adjacencyLists.size();\\n boolean visited[] = new boolean[N]; \\n int parrent[] = new int[N];\\n \\n // Create a queue for BFS \\n LinkedList<Integer> queue = new LinkedList<Integer>(); \\n \\n // Mark the current node as visited and enqueue it \\n visited[s]=true; \\n parrent[s]=-1;\\n queue.add(s); \\n Boolean hasPath = false;\\n \\n while (queue.size() != 0) \\n { \\n // Dequeue a vertex from queue and print it \\n int current = queue.poll(); \\n \\n Iterator<Integer> i = adjacencyLists.get(current).listIterator();\\n while (i.hasNext()) \\n { \\n int n = i.next(); \\n if (!visited[n]) \\n { \\n visited[n] = true; \\n parrent[n] = current;\\n if (n == t) {\\n \\thasPath = true;\\n \\tbreak;\\n }\\n queue.add(n); \\n } \\n } \\n } \\n if (!hasPath) {\\n \\treturn null;\\n }\\n \\n int trace = t;\\n ArrayList<Integer> shortestPath = new ArrayList<Integer>();\\n while(parrent[trace] != -1) {\\n \\tshortestPath.add(trace);\\t\\n \\ttrace = parrent[trace];\\n }\\n shortestPath.add(s);\\n Collections.reverse(shortestPath);\\n return shortestPath;\\n }\",\n \"public int[] djekstra(Router root, Router destination){\\n //if router and destination same\\n if (root.getID() == destination.getID()){\\n int[] result = new int[2];\\n result[0] = root.getID();\\n result[1] = 0;\\n hops.add(0);\\n return result;\\n }\\n\\n //Storing shortest path currently known\\n int[] shortestPath = new int[size];\\n //Storing the weights of the current router's connection to neighbors\\n int[] currentNeighborConnectionWeight = new int[size];\\n\\n //First set all of the positions to 9999 (pseudo infinity)\\n for (int i = 0; i < shortestPath.length;i++){\\n shortestPath[i] = 9999;\\n }\\n\\n // Set the distance to itself as 0, mark as visited\\n shortestPath[root.getID()-1] = 0;\\n root.visit();\\n\\n //For each connection the root has, set the shortestPath available to the weight to the neighbor\\n for (Connection c : root.getConnections()){\\n shortestPath[c.getDestination().getID()-1] = c.getWeight();\\n }\\n\\n //Find the smallest router to start the algorithm\\n //ID of smallest router, start the value with the first available option\\n int smallestRouterID = 0;\\n int smallestRouterWeight = 9999;\\n //Router used for iterating\\n Router current = null;\\n //Storing path length\\n int totalPathLength = 0;\\n\\n\\n //Find the shortest available path link to start with\\n for (int k = 0; k < shortestPath.length; k++){\\n if ((shortestPath[k] < smallestRouterWeight) && (shortestPath[k] != 0)){\\n // Check to see if dead end\\n if (routers.get(k).getConnections().size() > 1){\\n // id is pos+1\\n smallestRouterID = k + 1;\\n smallestRouterWeight = shortestPath[k];\\n } else if (routers.get(k).getID() == destination.getID()){ //edge case\\n // id is pos+1\\n smallestRouterID = k + 1;\\n smallestRouterWeight = shortestPath[k];\\n }\\n }\\n }\\n // add its weight\\n totalPathLength += smallestRouterWeight;\\n\\n //This is where we start our first step\\n current = getRouter(smallestRouterID);\\n hops.add(current.getID());\\n current.visit();\\n //System.out.println(\\\"First step--> Router:\\\" + smallestRouterID + \\\" Weight to router from root:\\\" + smallestRouterWeight);\\n //Now we loop\\n Router firstRouter = current;\\n boolean done = false;\\n while (done == false){\\n //Break case 1, we found the router\\n if (current.getID() == destination.getID()){\\n // check if root has available connections\\n\\n // set current to root and store totalPathLength to new variable && store hops in new array ArrayList\\n // compare totals and store the one that's lower ++ hops list too\\n // could we recursively call djekstra?\\n done = true;\\n // System.out.println(\\\"Router found\\\");\\n break;\\n }\\n\\n //Break case 2, all of the connections have been visited already\\n boolean destinationAvailable = hasAvailableConnections(current);\\n if (destinationAvailable == false){\\n if(hasAvailableConnections(root)){\\n current = root;\\n hops.clear();\\n totalPathLength= 0;\\n } else {\\n done = true;\\n // System.out.println(\\\"v-- No more routers available\\\");\\n break;\\n }\\n }\\n\\n //set all to 9999 to assume we cant see\\n for (int a = 0; a < currentNeighborConnectionWeight.length; a++){\\n currentNeighborConnectionWeight[a] = 9999;\\n }\\n\\n //Recalculate for new path lengths\\n for (Connection c : current.getConnections()){\\n //Only calculate path for routers that havent been visited\\n if (c.getDestination().getVisit() == false){\\n currentNeighborConnectionWeight[c.getDestination().getID()-1] = c.getWeight();\\n }\\n }\\n\\n //Find the next step to take\\n //Find the shortest available path link to start with\\n smallestRouterID = 0;\\n smallestRouterWeight = 9999;\\n for (int b = 0; b < currentNeighborConnectionWeight.length; b++){\\n if ((currentNeighborConnectionWeight[b] < smallestRouterWeight)){\\n // id is pos+1\\n smallestRouterID = b + 1;\\n smallestRouterWeight = currentNeighborConnectionWeight[b];\\n }\\n }\\n\\n // add its weight\\n totalPathLength += smallestRouterWeight;\\n current = getRouter(smallestRouterID);\\n hops.add(current.getID());\\n current.visit();\\n // System.out.println(\\\"Next shortest path--> Router: \\\" + current.getID() + \\\" Length from root:\\\" + totalPathLength);\\n\\n\\n } // <--------------------------------------------------------------------------------End of while loop\\n\\n // returns <lasthop, pathcost>\\n int[] result = new int[2];\\n //Check and see if the path length is smaller then the original\\n if (totalPathLength <= shortestPath[destination.getID()-1]){\\n //System.out.println(\\\"Case new \\\" + firstRouter.getID());\\n shortestPath[destination.getID()-1] = totalPathLength;\\n result[0] = firstRouter.getID();\\n result[1] = shortestPath[destination.getID()-1];\\n } else {\\n //root was shorter\\n //System.out.println(\\\"Case old \\\" + root.getID());\\n result[0] = root.getID();\\n result[1] = shortestPath[destination.getID()-1];\\n }\\n // System.out.println(\\\"Next hop:\\\" + current.getID() + \\\" Total Distance:\\\" + shortestPath[destination.getID()-1]);\\n\\n //reset the visited list\\n for (Router r: routers){\\n r.unvisit();\\n }\\n return result;\\n }\",\n \"public void findShortestPath(String startName, String endName) {\\n checkValidEndpoint(startName);\\n checkValidEndpoint(endName);\\n\\n Vertex<String> start = vertices.get(startName);\\n Vertex<String> end = vertices.get(endName);\\n\\n double totalDist; // totalDist must be update below\\n\\n Map<Vertex<String>, Double> distance = new HashMap<>();\\n Map<Vertex<String>, Vertex<String>> previous = new HashMap<>();\\n Set<Vertex<String>> explored = new HashSet<>();\\n PriorityQueue<VertexDistancePair> pq = new PriorityQueue<>();\\n\\n\\n\\n addPQ(distance, start, pq, previous);\\n\\n\\n\\n dijkstraHelper(pq, end, explored, distance, previous);\\n\\n\\n\\n\\n\\n\\n totalDist = distance.get(end);\\n List<Edge<String>> path = getPath(end, start);\\n printPath(path, totalDist);\\n }\",\n \"private Path findShortestPath(Address start, Address destination) throws Exception{\\n HashMap<Intersection, Segment> pi = dijkstra(start);\\n Segment seg = pi.get(destination);\\n if(seg == null){\\n throw new Exception();\\n }\\n LinkedList<Segment> newPathComposition = new LinkedList<>();\\n Path newPath = new Path(start, destination, newPathComposition);\\n newPathComposition.add(seg);\\n while (!seg.getOrigin().equals(start)) {\\n Intersection s = seg.getOrigin();\\n seg = pi.get(s);\\n if(seg == null){\\n throw new Exception();\\n }\\n newPathComposition.add(seg);\\n }\\n Collections.reverse(newPathComposition);\\n newPath.setSegmentsOfPath(newPathComposition);\\n return newPath;\\n }\",\n \"public void shortestPaths(int source) {\\n\\n\\t\\tlong start = 0;\\n\\t\\tlong stop;\\n\\t\\tfor (int v = 0; v < vertexList.length; v++) {\\n\\t\\t\\tedgeList[v] = new Edge(vertexList[v].id, rand, 5000);\\n\\t\\t}\\n\\t\\t// creating object of fibonacci\\n\\t\\tFHeap pq = new FHeap();\\n\\t\\t// creating a map for checking\\n\\t\\tMap<Integer, FHeap.Node> check = new HashMap<Integer, FHeap.Node>();\\n\\t\\t// storing the mst costs\\n\\n\\t\\tfor (int v = 0; v < vertexList.length; v++) {\\n\\t\\t\\tcheck.put(vertexList[v].id,\\n\\t\\t\\t\\t\\tpq.enqueue(vertexList[v].id, Double.POSITIVE_INFINITY));\\n\\t\\t}\\n\\t\\tstart = System.currentTimeMillis();\\n\\t\\t// allot cost 0 to initial node\\n\\t\\tpq.decreaseKey(check.get(vertexList[source].id), 0.0);\\n\\n\\t\\twhile (!pq.isEmpty()) {\\n\\t\\t\\t// take the current node and get its minimum cost\\n\\t\\t\\tFHeap.Node current = pq.dequeueMin();\\n\\n\\t\\t\\t// store the values in the table\\n\\t\\t\\tresult.put(current.getValue(), current.getCost());\\n\\n\\t\\t\\t// update the costs\\n\\t\\t\\tfor (Neighbor nbr = vertexList[current.getValue()].adjList; nbr != null; nbr = nbr.next) {\\n\\n\\t\\t\\t\\t// edge is not added if shortest cost is known\\n\\t\\t\\t\\tif (result.containsKey(vertexList[nbr.vertexNumber].id))\\n\\t\\t\\t\\t\\tcontinue;\\n\\n\\t\\t\\t\\t// update cost to shortest\\n\\t\\t\\t\\tFHeap.Node finalCost = check\\n\\t\\t\\t\\t\\t\\t.get(vertexList[nbr.vertexNumber].id);\\n\\t\\t\\t\\tif (nbr.weight < finalCost.getCost())\\n\\t\\t\\t\\t\\tpq.decreaseKey(finalCost, nbr.weight);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstop = System.currentTimeMillis();\\n\\t\\t// computing the time\\n\\t\\ttime = stop - start;\\n\\n\\t\\t// calculate the MST cost\\n\\t\\tfor (int i = 0; i < vertexList.length; i++) {\\n\\t\\t\\tsumHeapCost = (int) (sumHeapCost + result.get(i));\\n\\t\\t}\\n\\t\\t// for printing in case of input from file in fibonacci mode\\n\\t\\n\\t\\t// System.out.println(sumHeapCost);\\n\\t}\",\n \"private LinkedList<Node> aStarPath() throws PathNotFoundException {\\n\\n // Set of nodes already evaluated\\n List<Node> closedSet = new ArrayList<Node>();\\n\\n // Set of nodes visited, but not evaluated\\n List<Node> openSet = new ArrayList<Node>();\\n openSet.add(start);\\n\\n\\n // Map of node with shortest path leading to it\\n Map<Node, Node> cameFrom = new HashMap<>();\\n\\n // Map of cost of navigating from start to node\\n Map<Node, Double> costFromStart = new HashMap<>();\\n costFromStart.put(start, 0.0);\\n\\n // Map of cost of navigating path from start to end through node\\n Map<Node, Double> costThrough = new HashMap<>();\\n costThrough.put(start, heuristic(start, end));\\n\\n while (!openSet.isEmpty()){\\n\\n Node current = lowestCostThrough(openSet, costThrough);\\n\\n if(current.equals(end)){\\n return reconstructPath(cameFrom, current);\\n }\\n\\n openSet.remove(current);\\n closedSet.add(current);\\n\\n for(Node neighbor: current.getNodes()) {\\n if (closedSet.contains(neighbor)) {\\n continue;\\n }\\n\\n double tentativeCost = costFromStart.get(current) + distanceBetween(current, neighbor);\\n\\n if (!openSet.contains(neighbor)) { // found new neighbor\\n openSet.add(neighbor);\\n } else if (tentativeCost >= costFromStart.get(neighbor)) { // not a better path\\n continue;\\n }\\n\\n cameFrom.put(neighbor, current);\\n costFromStart.put(neighbor, tentativeCost);\\n costThrough.put(neighbor, tentativeCost + heuristic(neighbor, end));\\n\\n }\\n }\\n // no path\\n throw pathNotFound;\\n }\",\n \"@Test public void testPublic14() {\\n Graph<String> graph= TestGraphs.testGraph2();\\n List<String> shortestPath= new ArrayList<String>();\\n\\n assertEquals(1, graph.Dijkstra(\\\"apple\\\", \\\"banana\\\", shortestPath));\\n assertEquals(\\\"apple banana\\\", TestGraphs.listToString(shortestPath));\\n\\n assertEquals(2, graph.Dijkstra(\\\"apple\\\", \\\"cherry\\\", shortestPath));\\n assertEquals(\\\"apple banana cherry\\\",\\n TestGraphs.listToString(shortestPath));\\n\\n assertEquals(3, graph.Dijkstra(\\\"apple\\\", \\\"date\\\", shortestPath));\\n assertEquals(\\\"apple banana cherry date\\\",\\n TestGraphs.listToString(shortestPath));\\n\\n assertEquals(4, graph.Dijkstra(\\\"apple\\\", \\\"elderberry\\\", shortestPath));\\n assertEquals(\\\"apple banana cherry date elderberry\\\",\\n TestGraphs.listToString(shortestPath));\\n\\n assertEquals(5, graph.Dijkstra(\\\"apple\\\", \\\"fig\\\", shortestPath));\\n assertEquals(\\\"apple banana cherry date elderberry fig\\\",\\n TestGraphs.listToString(shortestPath));\\n\\n assertEquals(6, graph.Dijkstra(\\\"apple\\\", \\\"guava\\\", shortestPath));\\n assertEquals(\\\"apple banana cherry date elderberry fig guava\\\",\\n TestGraphs.listToString(shortestPath));\\n }\",\n \"@Override\\n public Double calculateShortestPathFromSource(String from, String to) {\\n Node source = graph.getNodeByName(from);\\n Node destination = graph.getNodeByName(to);\\n source.setDistance(0d);\\n Set<Node> settledNodes = new HashSet<>();\\n PriorityQueue<Node> unsettledNodes = new PriorityQueue<>(Comparator.comparing(Node::getDistance));\\n unsettledNodes.add(source);\\n while (unsettledNodes.size() != 0) {\\n Node currentNode = unsettledNodes.poll();\\n for (Map.Entry<Node, Double> adjacencyPair : currentNode.getAdjacentNodes().entrySet()) {\\n Node adjacentNode = adjacencyPair.getKey();\\n Double distance = adjacencyPair.getValue();\\n if (!settledNodes.contains(adjacentNode)) {\\n calculateMinimumDistance(adjacentNode, distance, currentNode);\\n unsettledNodes.add(adjacentNode);\\n }\\n }\\n settledNodes.add(currentNode);\\n }\\n return destination.getDistance() == Double.MAX_VALUE ? -9999d : destination.getDistance();\\n }\",\n \"public int bellman(Edge[] graph, int start, int end, int n) {\\n int[] dist = new int[n+1];\\n fill(dist, inf);\\n dist[start] = 0;\\n\\n for(int i=1; i<=n; i++) {\\n for(Edge e: graph) {\\n dist[e.to] = min(dist[e.from] + e.weight, dist[e.to]);\\n }\\n }\\n\\n if(hasNegCycle(graph, dist, end)) {\\n return -1;\\n } else if(dist[end] == inf){\\n return -2;\\n } else {\\n return dist[end];\\n }\\n }\",\n \"private List<routerNode> getPathVertexList(routerNode beginNode, routerNode endNode) {\\r\\n\\t\\tTransformer<routerLink, Integer> wtTransformer; // transformer for getting edge weight\\r\\n\\t\\twtTransformer = new Transformer<routerLink, Integer>() {\\r\\n public Integer transform(routerLink link) {\\r\\n return link.getWeight();\\r\\n \\t}\\r\\n };\\t\\t\\r\\n\\r\\n\\t\\t\\r\\n\\t\\tList<routerNode> vlist;\\r\\n\\t\\tDijkstraShortestPath<routerNode, routerLink> DSPath = \\r\\n\\t \\t new DijkstraShortestPath<routerNode, routerLink>(gGraph, wtTransformer);\\r\\n \\t// get the shortest path in the form of edge list \\r\\n List<routerLink> elist = DSPath.getPath(beginNode, endNode);\\r\\n\\t\\t\\r\\n \\t\\t// get the node list form the shortest path\\r\\n\\t Iterator<routerLink> ebIter = elist.iterator();\\r\\n\\t vlist = new ArrayList<routerNode>(elist.size() + 1);\\r\\n \\tvlist.add(0, beginNode);\\r\\n\\t for(int i=0; i<elist.size(); i++){\\r\\n\\t\\t routerLink aLink = ebIter.next();\\r\\n\\t \\t \\t// get the nodes corresponding to the edge\\r\\n \\t\\tPair<routerNode> endpoints = gGraph.getEndpoints(aLink);\\r\\n\\t routerNode V1 = endpoints.getFirst();\\r\\n\\t routerNode V2 = endpoints.getSecond();\\r\\n\\t \\tif(vlist.get(i) == V1)\\r\\n\\t \\t vlist.add(i+1, V2);\\r\\n\\t else\\r\\n\\t \\tvlist.add(i+1, V1);\\r\\n\\t }\\r\\n\\t return vlist;\\r\\n\\t}\",\n \"@Override\\r\\n public List<T> breadthFirstPath(T start, T end) {\\r\\n\\r\\n Vertex<T> startV = vertices.get(start);\\r\\n Vertex<T> endV = vertices.get(end);\\r\\n\\r\\n LinkedList<Vertex<T>> vertexList = new LinkedList<>();\\r\\n //Set<Vertex<T>> visited = new HashSet<>();\\r\\n ArrayList<Vertex<T>> visited = new ArrayList<>();\\r\\n\\r\\n LinkedList<Vertex<T>> pred = new LinkedList<>();\\r\\n int currIndex = 0;\\r\\n\\r\\n pred.add(null);\\r\\n\\r\\n vertexList.add(startV);\\r\\n visited.add(startV);\\r\\n\\r\\n LinkedList<T> path = new LinkedList<>();\\r\\n\\r\\n if (breadthFirstSearch(start, end) == false) {\\r\\n path = new LinkedList<>();\\r\\n return path;\\r\\n } else {\\r\\n while (vertexList.size() > 0) {\\r\\n Vertex<T> next = vertexList.poll();\\r\\n if(next == null){\\r\\n continue;\\r\\n }\\r\\n if (next == endV) {\\r\\n path.add(endV.getValue());\\r\\n break;\\r\\n }\\r\\n for (Vertex<T> neighbor : next.getNeighbors()) {\\r\\n if (!visited.contains(neighbor)) {\\r\\n pred.add(next);\\r\\n visited.add(neighbor);\\r\\n vertexList.add(neighbor);\\r\\n }\\r\\n }\\r\\n currIndex++;\\r\\n //path.add(next.getValue());\\r\\n\\r\\n }\\r\\n while (currIndex != 0) {\\r\\n Vertex<T> parent = pred.get(currIndex);\\r\\n path.add(parent.getValue());\\r\\n currIndex = visited.indexOf(parent);\\r\\n }\\r\\n }\\r\\n Collections.reverse(path);\\r\\n return path;\\r\\n }\",\n \"private static void simpleDijikstra(final DirectedGraph directedGraph,\\n final Map<String, Integer> currentShortestPaths,\\n final String start, final Set<String> visitedSet, final String destination) {\\n // Terminate when we have visited all the nodes or if our start value isn't in our dijikstra table\\n if (containsAndNotNull(currentShortestPaths, start) && visitedSet.size() != currentShortestPaths.keySet().size()) {\\n compareDistanceAndReplace(directedGraph, currentShortestPaths, start);\\n visitedSet.add(start);\\n // Calculate the next current smallest node that hasn't been visited and not infinity\\n final Optional<Map.Entry<String, Integer>> optionalSmallest =\\n currentShortestPaths.entrySet().stream()\\n .filter(node -> !visitedSet.contains(node.getKey()) && node.getValue() != null)\\n .min(Comparator.comparingInt(Map.Entry::getValue));\\n // Continue to next node if there is one available\\n optionalSmallest.ifPresent(smallest -> {\\n // No need to continue if the next smallest node is our destination\\n if (!smallest.getKey().equals(destination)) {\\n simpleDijikstra(directedGraph, currentShortestPaths, smallest.getKey(), visitedSet, destination);\\n }\\n });\\n }\\n }\",\n \"public Dijkstra(Graph graph, int firstVertexPortNum)\\n {\\n this.graph = graph;\\n Set<String> vertexKeys = this.graph.vertexKeys();\\n \\n this.initialVertexPortNum = firstVertexPortNum;\\n this.predecessors = new HashMap<String, String>();\\n this.distances = new HashMap<String, Integer>();\\n this.availableVertices = new PriorityQueue<Vertex>(vertexKeys.size(), new Comparator<Vertex>()\\n {\\n // compare weights of these two vertices.\\n public int compare(Vertex v1, Vertex v2)\\n {\\n \\t// errors are here.\\n int weightOne = Dijkstra.this.distances.get(v1.convertToString(v1.getVertexPortNum())); // distances stored by portnum in string form.\\n int weightTwo = Dijkstra.this.distances.get(v2.convertToString(v2.getVertexPortNum())); // distances stored by portnum in string form.\\n return weightOne - weightTwo; // return the modified weight of the two vertices.\\n }\\n });\\n \\n this.visitedVertices = new HashSet<Vertex>();\\n \\n // for each Vertex in the graph\\n for(String key: vertexKeys)\\n {\\n this.predecessors.put(key, null);\\n this.distances.put(key, Integer.MAX_VALUE); // assuming that the distance of this is infinity.\\n }\\n \\n \\n //the distance from the initial vertex to itself is 0\\n this.distances.put(convertToString(initialVertexPortNum), 0); \\n \\n //and seed initialVertex's neighbors\\n Vertex initialVertex = this.graph.getVertex(convertToString(initialVertexPortNum)); // converted portnum to String to make this work.\\n ArrayList<Edge> initialVertexNeighbors = initialVertex.getSquad();\\n for(Edge e : initialVertexNeighbors)\\n {\\n Vertex other = e.getNeighbor(initialVertex);\\n this.predecessors.put(convertToString(other.getVertexPortNum()), convertToString(initialVertexPortNum));\\n this.distances.put(convertToString(other.getVertexPortNum()), e.getWeight()); // converted portnum to String to make this work.\\n this.availableVertices.add(other); // add to available vertices.\\n }\\n \\n this.visitedVertices.add(initialVertex); // add to list of visited vertices.\\n \\n // apply Dijkstra's algorithm to the overlay.\\n processOverlay();\\n \\n }\",\n \"public static void breadthFirstSearch(ArrayList<Node> graph) {\\n\\t\\tSystem.out.println(\\\"BFS:\\\");\\n\\t\\tif(graph.size() == 0) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t\\n\\t\\tGraphUtils.cleanGraph(graph);\\n\\n\\t\\tQueue<Node> queue = new LinkedList<Node>();\\n\\t\\tfor(Node node : graph) {\\n\\t\\t\\tif(node.state != Node.State.UNDISCOVERED) {\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tnode.state = Node.State.DISCOVERED;\\n\\t\\t\\tqueue.add(node);\\n\\t\\t\\t\\n\\t\\t\\twhile(!queue.isEmpty()) {\\n\\t\\t\\t\\tnode = queue.remove();\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//process node\\n\\t\\t\\t\\tSystem.out.print(node.name + \\\" -> \\\");\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tfor(Edge e : node.edges) {\\n\\t\\t\\t\\t\\t//process edge\\n\\t\\t\\t\\t\\tNode neighbor = e.getNeighbor(node);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t//first time we see this node it gets added to the queue for later processing\\n\\t\\t\\t\\t\\tif(neighbor.state == Node.State.UNDISCOVERED) {\\n\\t\\t\\t\\t\\t\\tneighbor.state = Node.State.DISCOVERED;\\n\\t\\t\\t\\t\\t\\tqueue.add(neighbor);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//finished with this node\\n\\t\\t\\t\\tnode.state = Node.State.COMPLETE;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tSystem.out.println();\\n\\t\\tGraphUtils.cleanGraph(graph);\\n\\t}\",\n \"@SuppressWarnings({ \\\"rawtypes\\\", \\\"unchecked\\\" })\\n public List<Edge<T>> viterbiPath() {\\n final int numNodes = nodeList.size();\\n double[] d_v = new double[numNodes];\\n Arrays.fill(d_v, annihilator());\\n d_v[ROOT_ID] = identity();\\n Edge[] p_v = new Edge[numNodes]; \\n \\n // Forward pass\\n for (int v = ROOT_ID+1; v < numNodes; ++v) {\\n List<Edge<T>> edgeList = nodeList.get(v).backwardStar();\\n for (Edge<T> edge : edgeList) {\\n int u = edge.start().id();\\n double bestCost = d_v[v];\\n double transitionCost = score(d_v[u], edge.weight());\\n if (compare(bestCost, transitionCost) == transitionCost) {\\n // Do an update to the best cost\\n d_v[v] = transitionCost;\\n p_v[v] = edge;\\n }\\n }\\n }\\n \\n // Backout the solution\\n List<Edge<T>> bestPath = new LinkedList<Edge<T>>();\\n Edge<T> bestEdge = p_v[numNodes-1];\\n bestEdge = p_v[bestEdge.start().id()]; // Skip the goal node\\n while(bestEdge.start().id() != ROOT_ID) {\\n bestPath.add(0, bestEdge); // O(c) pre-pend\\n bestEdge = p_v[bestEdge.start().id()];\\n }\\n\\n return bestPath;\\n }\",\n \"@Override\\n public List<node_info> shortestPath(int src, int dest) {\\n int counter=0;//counter for index of listPath\\n List<node_info> listPath=new ArrayList<node_info>();//The reverse list that is returned\\n List<node_info> listResult=new ArrayList<node_info>();//the returned list\\n if(!DijkstraHelp(src,dest)) return null;//if there is no path from src to dest\\n if(src==dest) {\\n listPath.add(this.ga.getNode(src));\\n return listPath;\\n }\\n //the other case:\\n node_info d=this.ga.getNode(dest);\\n listPath.add(counter,d);//insert the dest in order to go from destination to source\\n //counter++;\\n weighted_graph gCopy=copy();\\n Iterator<node_info> it=gCopy.getV().iterator();//run on the whole graph\\n while(it.hasNext()){\\n if(listPath.get(counter).getKey()==src) break;//if we finished\\n if(gCopy.getV(listPath.get(counter).getKey()).contains(it.next())) {//remove the nodes that we were already checked if\\n //they need to be insert to listPath\\n continue;\\n }\\n Iterator<node_info> currentIt=gCopy.getV(listPath.get(counter).getKey()).iterator();//iterator on the ni-list of the\\n //last node were insert to the listPath\\n if(currentIt!=null) {\\n node_info min=null;\\n while (currentIt.hasNext()){\\n node_info currentLoop=currentIt.next();\\n if(currentLoop.getTag()+gCopy.getEdge(listPath.get(counter).getKey(),currentLoop.getKey())==\\n listPath.get(counter).getTag()){//check if this is the node that appropriate to the shortest path\\n min=currentLoop;\\n }\\n }\\n listPath.add(min);//insert to listPath\\n counter++;\\n }\\n }\\n for(int i=listPath.size()-1;i>=0;i--){\\n listResult.add(listPath.size()-i-1,listPath.get(i));//reverse the list\\n }\\n return listResult;\\n }\",\n \"public int shortestPathLength(int[][] graph) {\\n Queue<MyPath> q = new LinkedList<>();\\n Set<String> visited = new HashSet<>();\\n\\n for (int i = 0; i < graph.length; i++) {\\n MyPath path = new MyPath(i, (1 << i));\\n visited.add(path.convertToString());\\n q.offer(path);\\n }\\n\\n int length = 0;\\n while (!q.isEmpty()) {\\n int size = q.size();\\n while (size-- > 0) {\\n MyPath next = q.poll();\\n int curr = next.curr;\\n int currPath = next.nodes;\\n // Assume we have two nodes -> n = 2\\n // 1 << 2 -> 100\\n // 100 - 1 -> 011 which means both nodes are visited\\n if (currPath == (1 << graph.length) - 1) {\\n return length;\\n }\\n for (int neighbors : graph[curr]) {\\n MyPath newPath = new MyPath(neighbors, currPath | (1 << neighbors));\\n String pathString = newPath.convertToString();\\n if (visited.add(pathString)) {\\n q.offer(newPath);\\n }\\n }\\n }\\n length++;\\n }\\n\\n return -1;\\n }\",\n \"public List<Node> findShortestPath(Node s, Node t);\",\n \"public static List<CampusGraph.Edges<String, String>> findPath(CampusGraph<String, String> cg, String start, String destination) {\\n if (cg == null || start == null || destination == null) {\\n throw new IllegalArgumentException();\\n }\\n Queue<String> visitedNodes = new LinkedList<>();\\n Map<String, List<CampusGraph.Edges<String, String>>> paths = new HashMap<>();\\n visitedNodes.add(start); // Add start to Q\\n paths.put(start, new LinkedList<>()); // Add start->[] to M (start mapped to an empty list)\\n\\n while (!visitedNodes.isEmpty()) {\\n String currentNode = visitedNodes.remove();\\n if (currentNode.equals(destination)) { // found the path\\n return paths.get(currentNode);\\n } else {\\n List<CampusGraph.Edges<String, String>> neighbors = cg.getAllChildren(currentNode);\\n neighbors.sort(new Comparator<CampusGraph.Edges<String, String>>() {\\n @Override\\n public int compare(CampusGraph.Edges<String, String> o1, CampusGraph.Edges<String, String> o2) {\\n int cmpEndNode = o1.getEndTag().compareTo(o2.getEndTag());\\n if (cmpEndNode == 0) {\\n return o1.getEdgeLabel().compareTo(o2.getEdgeLabel());\\n }\\n return cmpEndNode;\\n }\\n }); // ascending list. Sort characters and books names all at once??\\n\\n for (CampusGraph.Edges<String, String> e: neighbors) {\\n String neighbor = e.getEndTag();\\n if (!paths.containsKey(neighbor)) { // i.e. if the neighbor is unvisited\\n List<CampusGraph.Edges<String, String>> pathCopy = new LinkedList<>(paths.get(currentNode));\\n pathCopy.add(e);\\n paths.put(neighbor, pathCopy); // add the path exclusive to this neighbor\\n visitedNodes.add(neighbor); // then, mark the neighbor as visited\\n }\\n }\\n }\\n }\\n return null; // No destination found\\n }\",\n \"public List<Node> computeDijkstraShortestPath(Node source, Node destination) {\\n\\n source.minDistance = 0.;\\n PriorityQueue<Node> nodeQueue = new PriorityQueue<Node>();\\n nodeQueue.add(source);\\n\\n int destinationGroup = destination._groupID;\\n\\n while (!nodeQueue.isEmpty()) {\\n Node v = nodeQueue.poll();\\n\\n Log.i(\\\"bbb\\\", \\\"In dijsk node name \\\"+ v._waypointName);\\n //Stop searching when reach the destination node\\n\\n\\n if(destinationGroup!=0){\\n\\n if(v._groupID==destinationGroup){\\n destination = navigationGraph.get(navigationGraph.size()-1).nodesInSubgraph.get(v._waypointID);\\n Log.i(\\\"bbb\\\", \\\"destination is: \\\"+destination._waypointName);\\n\\n break;\\n }\\n\\n }\\n\\n if (v._waypointID.equals(destination._waypointID))\\n break;\\n\\n\\n // Visit each edge that is adjacent to v\\n for (Edge e : v._edges) {\\n Node a = e.target;\\n Log.i(\\\"bbb\\\", \\\"node a \\\"+a._waypointName);\\n double weight = e.weight;\\n double distanceThroughU = v.minDistance + weight;\\n if (distanceThroughU < a.minDistance) {\\n nodeQueue.remove(a);\\n a.minDistance = distanceThroughU;\\n a.previous = v;\\n Log.i(\\\"bbb\\\", \\\"set previous\\\");\\n nodeQueue.add(a);\\n }\\n }\\n }\\n\\n Log.i(\\\"bbb\\\", \\\"destination is: \\\"+destination._waypointName);\\n\\n return getShortestPathToDestination(destination);\\n }\",\n \"List<V> getShortestPath(V vertex);\",\n \"private int bfs(int startNode, Map<Integer, List<Integer>> adjacencyList, int[] distanceToNode) {\\n int furthestNode = 1;\\n int furthestDistance = Integer.MIN_VALUE;\\n\\n Queue<Integer> queue = new LinkedList<>();\\n Arrays.fill(distanceToNode, -1);\\n\\n // Put start node in queue\\n queue.add(startNode);\\n // Set distance of the first node to 0 (0 edge to itself)\\n distanceToNode[startNode - 1] = 0;\\n\\n // While queue is not empty\\n while (!queue.isEmpty()) {\\n // Pop node\\n int curNode = queue.remove();\\n\\n // Iterate through node's neighbours\\n for (int neighbour : adjacencyList.get(curNode)) {\\n // If neighbour is not visited (distance not -1)\\n if (distanceToNode[neighbour - 1] == -1) {\\n // Calculate distance by taking curNode distance and add 1\\n // Update distance in array as a way of marking it as visited\\n distanceToNode[neighbour - 1] = distanceToNode[curNode - 1] + 1;\\n\\n // Add to queue to process next\\n queue.add(neighbour);\\n\\n // If the distance is bigger than current furthest one, update\\n if (distanceToNode[neighbour - 1] > furthestDistance)\\n furthestNode = neighbour;\\n }\\n }\\n }\\n return furthestNode;\\n }\",\n \"public int[] shortestPath(int destination) throws BellmanFordException{\\n \\n Stack<Integer> tempStack = new Stack<Integer>(); // We create a temporary stack to store the path that we would want to return backwardly. ie: pushing the destination (our last node) into the stack first.\\n int[] shortestPath; // array to return \\n tempStack.push(destination);\\n \\n int currentNode = destination;\\n\\n while (predecessors[currentNode] != -1) \\n {\\n\\t\\t\\tcurrentNode = predecessors[currentNode]; // Get the predecessor of each node from the predecessor array\\n\\t\\t\\ttempStack.push(currentNode); // Push our result into our temp stack.\\n\\t\\t}\\n\\n if (tempStack.peek() == destination) // Check if the top of our stack is our input destination, if so, that means there isn't a path exists between our source and destination.\\n {\\n\\t\\t\\tthrow (new PathDoesNotExistException (\\\"Error: there isn't a path exists between the node: \\\" + this.source + \\\" and the node: \\\" + destination + \\\".\\\"));\\n\\t\\t}\\n \\n shortestPath = new int[tempStack.size()]; // Our return array will have the same size as our tempStack.\\n int i = 0;\\n while (tempStack.isEmpty() == false) \\n {\\n\\t\\t\\tcurrentNode = tempStack.pop(); // Popping nodes from our temp stack \\n\\t\\t\\tshortestPath[i] = currentNode; // and store them into our return array. By doing this, we will have the correct order of nodes that forms a path between our source and destination.\\n\\t\\t\\ti++;\\n\\t\\t}\\n\\t\\treturn shortestPath;\\n }\",\n \"private void calculateShortestDistances (GraphStructure graph,int startVertex,int destinationVertex) {\\r\\n\\t\\t//traverseRecursively(graph, startVertex);\\r\\n\\t\\tif(pathList.contains(destinationVertex)) {\\r\\n\\t\\t\\tdistanceArray = new int [graph.getNumberOfVertices()];\\r\\n\\t\\t\\tint numberOfVertices=graph.getNumberOfVertices();\\r\\n\\t\\t\\tSet<Integer> spanningTreeSet = new HashSet<Integer>();\\r\\n\\t\\t\\tArrays.fill(distanceArray,Integer.MAX_VALUE);\\r\\n\\t\\t\\tdistanceArray[startVertex]=0;\\r\\n\\t\\t\\tadjacencyList = graph.getAdjacencyList();\\r\\n\\t\\t\\tList<Edge> list;\\r\\n\\t\\t\\tlist = graph.getAdjacencyList()[startVertex];\\r\\n\\t\\t\\tif(startVertex==destinationVertex) {\\r\\n\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t} else {\\r\\n\\t\\t\\t\\tfor(Edge value : list) {\\r\\n\\t\\t\\t\\t\\tif(! isVisited[value.getVertex()]) {\\r\\n\\t\\t\\t\\t\\t\\tint sumOfWeightAndSourceVertexDistanceValue = distanceArray[startVertex] + value.getWeight();\\r\\n\\t\\t\\t\\t\\t\\tint distanceValueOfDestinationVertex = distanceArray[value.getVertex()];\\r\\n\\t\\t\\t\\t\\t\\tif( sumOfWeightAndSourceVertexDistanceValue < distanceValueOfDestinationVertex ) {\\r\\n\\t\\t\\t\\t\\t\\t\\tdistanceArray[value.getVertex()] = sumOfWeightAndSourceVertexDistanceValue;\\r\\n\\t\\t\\t\\t\\t\\t\\tshortestPathList.add(value.getVertex());\\r\\n\\t\\t\\t\\t\\t\\t\\tcalculateShortestDistances(graph,value.getVertex(), distanceValueOfDestinationVertex);\\r\\n\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t/*for(Integer value : spanningTreeSet) {\\r\\n\\t\\t\\t\\tSystem.out.print(value+\\\" \\\");\\r\\n\\t\\t\\t}*/\\r\\n\\t\\t} else {\\r\\n\\t\\t\\tSystem.out.println(\\\"No route is present between given vertices !\\\");\\r\\n\\t\\t}\\r\\n\\t}\",\n \"void dijkstra(int graph[][], int src) {\\n int dist[] = new int[V]; // The output array. dist[i] will hold\\n // the shortest distance from src to i\\n\\n // sptSet[i] will true if vertex i is included in shortest\\n Boolean sptSet[] = new Boolean[V];\\n\\n for (int i = 0; i < V; i++) {\\n dist[i] = Integer.MAX_VALUE;\\n sptSet[i] = false;\\n }\\n\\n dist[src] = 0;\\n\\n // Find shortest path for all vertices\\n for (int count = 0; count < V-1; count++) {\\n\\n int u = minDistance(dist, sptSet);\\n\\n // Mark the picked vertex as processed\\n sptSet[u] = true;\\n\\n // Update dist value of the adjacent vertices of the\\n // picked vertex.\\n for (int v = 0; v < V; v++)\\n\\n\\n if (!sptSet[v] && graph[u][v]!=0 &&\\n dist[u] != Integer.MAX_VALUE &&\\n dist[u]+graph[u][v] < dist[v])\\n dist[v] = dist[u] + graph[u][v];\\n }\\n\\n printSolution(dist, V);\\n }\",\n \"@Test\\n void testShortestPath(){\\n weighted_graph g = new WGraph_DS();\\n for(int i = 1; i <= 7; i++){\\n g.addNode(i);\\n }\\n g.connect(1,2,20);\\n g.connect(1,5,15);\\n g.connect(2,3,20);\\n g.connect(5,6,15);\\n g.connect(3,4,20);\\n g.connect(6,4,15);\\n g.connect(1,7,2);\\n g.connect(7,4,1);\\n weighted_graph_algorithms ga = new WGraph_Algo();\\n ga.init(g);\\n LinkedList<node_info> expectedPath = new LinkedList<>(Arrays.asList(g.getNode(1),g.getNode(7),g.getNode(4)));\\n assertNull(ga.shortestPath(1,10));\\n assertEquals(expectedPath,ga.shortestPath(1,4));\\n assertEquals(1,ga.shortestPath(1,1).size());\\n }\",\n \"@Override\\n public List<node_data> shortestPath(int src, int dest) {\\n reset();\\n for (node_data node : G.getV()) {\\n node.setWeight(Double.POSITIVE_INFINITY);\\n }\\n\\n DWGraph_DS.Node currentNode = (DWGraph_DS.Node) G.getNode(src);\\n currentNode.setWeight(0);\\n PriorityQueue<node_data> unvisitedNodes = new PriorityQueue(G.nodeSize(), weightComperator);\\n unvisitedNodes.addAll(G.getV());\\n HashMap<Integer, node_data> parent = new HashMap<>();\\n parent.put(src, null);\\n\\n while (currentNode.getWeight() != Double.POSITIVE_INFINITY) {\\n if (G.getNode(dest).getTag() == 1) {\\n break;\\n }\\n for (edge_data edge : G.getE(currentNode.getKey())) {\\n DWGraph_DS.Node neighbor = (DWGraph_DS.Node) G.getNode(edge.getDest());\\n double tmpWeight = currentNode.getWeight() + edge.getWeight();\\n if (tmpWeight < neighbor.getWeight()) {\\n neighbor.setWeight(tmpWeight);\\n unvisitedNodes.remove(neighbor);\\n unvisitedNodes.add(neighbor);\\n parent.put(neighbor.getKey(), currentNode);\\n }\\n }\\n currentNode.setTag(1);\\n if(currentNode.getKey()==dest) break;\\n unvisitedNodes.remove(currentNode);\\n currentNode = (DWGraph_DS.Node) unvisitedNodes.poll();\\n }\\n /*\\n Rebuild the path list\\n */\\n if (!parent.keySet().contains(dest)) return null;\\n List<node_data> pathList = new ArrayList<>();\\n currentNode = (DWGraph_DS.Node) G.getNode(dest);\\n while (parent.get(currentNode.getKey()) != null) {\\n pathList.add(currentNode);\\n currentNode = (DWGraph_DS.Node) parent.get(currentNode.getKey());\\n }\\n Collections.reverse(pathList);\\n return pathList;\\n }\",\n \"public List<Vertex> shortestPath(Vertex start, Vertex end) {\\r\\n\\t\\tMap<Vertex, Vertex> backRefs = new HashMap<Vertex, Vertex>();\\r\\n\\r\\n\\t\\t// Create a queue for BFS\\r\\n\\t\\tQueue<Vertex> queue = new LinkedList<Vertex>();\\r\\n\\r\\n\\t\\t// Mark the current node as visited and enqueue it. Use backRef as\\r\\n\\t\\t// visited set\\r\\n\\t\\tqueue.offer(start);\\r\\n\\t\\tbackRefs.put(start, null);\\r\\n\\r\\n\\t\\tVertex currentNode;\\r\\n\\t\\tSet<Vertex> neighbors;\\r\\n\\r\\n\\t\\twhile (queue.size() != 0) { // or !queue.isEmpty()\\r\\n\\t\\t\\t// Dequeue a vertex from queue and print it\\r\\n\\t\\t\\tcurrentNode = queue.poll();\\r\\n\\r\\n\\t\\t\\tif (currentNode.equals(end)) {\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t// Get all adjacent vertices of the dequeued vertex s\\r\\n\\t\\t\\t// If a adjacent has not been visited, then mark it\\r\\n\\t\\t\\t// visited and enqueue it\\r\\n\\t\\t\\tneighbors = currentNode.getNeighbors();\\r\\n\\r\\n\\t\\t\\tfor (Vertex n : neighbors) {\\r\\n\\t\\t\\t\\tif (!backRefs.containsKey(n)) {\\r\\n\\t\\t\\t\\t\\tqueue.offer(n);\\r\\n\\t\\t\\t\\t\\tbackRefs.put(n, currentNode);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tif (!backRefs.containsKey(end))\\r\\n\\t\\t\\treturn null;\\r\\n\\r\\n\\t\\tList<Vertex> path = new ArrayList<Vertex>();\\r\\n\\t\\tcurrentNode = end;\\r\\n\\r\\n\\t\\twhile (currentNode != null) {\\r\\n\\t\\t\\tpath.add(currentNode);\\r\\n\\t\\t\\tcurrentNode = backRefs.get(currentNode);\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tCollections.reverse(path);\\r\\n\\r\\n\\t\\treturn path;\\r\\n\\t}\",\n \"@Override\\n\\tpublic List<node_data> shortestPath(int src, int dest) {\\n\\t\\tfor(node_data vertex : dwg.getV()) {\\n\\t\\t\\tvertex.setInfo(\\\"\\\"+Double.MAX_VALUE);\\n\\t\\t}\\n\\t\\tint[] prev = new int[dwg.nodeSize()];\\n\\t\\tnode_data start = dwg.getNode(src);\\n\\t\\tstart.setInfo(\\\"0.0\\\");\\n\\t\\tQueue<node_data> q = new LinkedBlockingQueue<node_data>();\\n\\t\\tq.add(start);\\n\\t\\tprev[src%dwg.nodeSize()] = -1;\\n\\t\\twhile(!q.isEmpty()) {\\n\\t\\t\\tnode_data v = q.poll();\\n\\t\\t\\tCollection<edge_data> edgesV = dwg.getE(v.getKey());\\n\\t\\t\\tfor(edge_data edgeV : edgesV) {\\n\\t\\t\\t\\tdouble newSumPath = Double.parseDouble(v.getInfo()) +edgeV.getWeight();\\n\\t\\t\\t\\tint keyU = edgeV.getDest();\\n\\t\\t\\t\\tnode_data u = dwg.getNode(keyU);\\n\\t\\t\\t\\tif(newSumPath < Double.parseDouble(u.getInfo())) {\\n\\t\\t\\t\\t\\tu.setInfo(\\\"\\\"+newSumPath);\\n\\t\\t\\t\\t\\tq.remove(u);\\n\\t\\t\\t\\t\\tq.add(u);\\n\\t\\t\\t\\t\\tprev[u.getKey()%dwg.nodeSize()] = v.getKey();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tList<node_data> ans = new ArrayList<node_data>();\\n\\t\\tint run = dest;\\n\\t\\twhile(run != src) {\\n\\t\\t\\tans.add(0,dwg.getNode(run));\\n\\t\\t\\trun = prev[run%dwg.nodeSize()];\\n\\t\\t}\\n\\t\\tans.add(0, dwg.getNode(src));\\n\\n\\t\\treturn ans;\\n\\t}\",\n \"@Override\\n public List<Node> findShortestPath(Node s, Node t)\\n {\\n nodeDists.clear(); //clear previously calculated distances\\n\\n recordNodeDistances(s, t); //record node distances to target\\n\\n LinkedList<Node> shortestPath = new LinkedList<Node>();\\n\\n shortestPath.addLast(s);\\n\\n boolean reachedEnd = false;\\n\\n if(s==t) reachedEnd = true; // \\\"That was easy\\\"\\n\\n while(!reachedEnd)\\n {\\n //get the neighbors from the most recent step on the path\\n Collection<? extends Node> neighbors = shortestPath.getLast().getNeighbors();\\n\\n //minimum cost from neighbors\\n Node minNode = null;\\n\\n for(Node n: neighbors)\\n {\\n if(minNode == null || nodeDists.get(n) < nodeDists.get(minNode))\\n {\\n minNode = n;\\n\\n if(nodeDists.get(n) == 0)\\n {\\n reachedEnd = true;\\n break;\\n }\\n }\\n }\\n\\n if(nodeDists.get(minNode) == Integer.MAX_VALUE) return null; //no path\\n else shortestPath.addLast(minNode);\\n }\\n\\n return shortestPath;\\n }\",\n \"private static void computePaths(Vertex source) {\\n source.minDistance = 0;\\n // retrieves with log(n) time\\n PriorityQueue<Vertex> vertexPriorityQueue = new PriorityQueue<>();\\n\\n //BFS traversal\\n vertexPriorityQueue.add(source);\\n\\n // O((v + e) * log(v))\\n while (!vertexPriorityQueue.isEmpty()) {\\n // this poll always returns the shortest distance vertex at log(v) time\\n Vertex vertex = vertexPriorityQueue.poll();\\n\\n //visit each edge exiting vertex (adjacencies)\\n for (Edge edgeInVertex : vertex.adjacencies) {\\n // calculate new distance between edgeInVertex and target\\n Vertex targetVertex = edgeInVertex.target;\\n double edgeWeightForThisVertex = edgeInVertex.weight;\\n double distanceThruVertex = vertex.minDistance + edgeWeightForThisVertex;\\n if (distanceThruVertex < targetVertex.minDistance) {\\n // modify the targetVertex with new calculated minDistance and previous vertex\\n // by removing the old vertex and add new vertex with updates\\n vertexPriorityQueue.remove(targetVertex);\\n targetVertex.minDistance = distanceThruVertex;\\n // update previous with the shortest distance vertex\\n targetVertex.previous = vertex;\\n vertexPriorityQueue.add(targetVertex);// adding takes log(v) time because needs to heapify\\n }\\n }\\n }\\n }\",\n \"public static void main(String[] args) {\\n\\n BDNode a = new BDNode(\\\"A\\\");\\n BDNode b = new BDNode(\\\"B\\\");\\n BDNode c = new BDNode(\\\"C\\\");\\n BDNode d = new BDNode(\\\"D\\\");\\n BDNode e = new BDNode(\\\"E\\\");\\n\\n a.link(b);\\n a.link(d);\\n b.link(a);\\n b.link(c);\\n b.link(e);\\n c.link(b);\\n c.link(d);\\n d.link(a);\\n d.link(c);\\n d.link(e);\\n e.link(b);\\n e.link(d);\\n\\n BDNode target = e;\\n\\n/*\\n // BFS\\n Queue<BDNode> queue = new LinkedList<>();\\n queue.offer(a);\\n\\n while(!queue.isEmpty()) {\\n BDNode n = queue.poll();\\n n.visit();\\n System.out.println(n); // 찾는 여정 출력\\n\\n if(n.equals(target)) {\\n System.out.println(\\\"BFS Found! \\\" + n);\\n break;\\n }\\n\\n for (BDNode l : n.links) {\\n if(l.isVisited()) continue;\\n if (queue.contains(l)) continue;\\n queue.offer(l);\\n }\\n\\n // 위랑 같은 표현\\n// n.links.stream()\\n// .filter(l -> !queue.contains(l))\\n// .forEach(queue::offer);\\n }\\n*/\\n\\n // DFS\\n Stack<BDNode> stack = new Stack<>();\\n stack.push(a);\\n\\n while(!stack.isEmpty()) {\\n BDNode n = stack.pop();\\n n.visit();\\n System.out.println(n); // 찾는 여정 출력\\n\\n if (n.equals(target)) {\\n System.out.println(\\\"DFS Found! \\\" + n);\\n break;\\n }\\n\\n for (BDNode l : n.links) {\\n if (l.isVisited()) continue;\\n if (stack.contains(l)) continue;\\n\\n stack.push(l);\\n }\\n }\\n\\n\\n }\",\n \"public static Graph dijkstra(Graph graph, Node source) {\\n source.distance = 0;\\n Set<Node> settledNodes = new HashSet<>();\\n Set<Node> unsettledNodes = new HashSet<>();\\n unsettledNodes.add(source);\\n \\n while (unsettledNodes.size() != 0) {\\n Node currentNode = Graph.getLowestDistanceNode(unsettledNodes);\\n unsettledNodes.remove(currentNode);\\n for (Map.Entry<Node, Integer> adjacencyPair: \\n currentNode.adjacentNodes.entrySet()) {\\n Node adjacentNode = adjacencyPair.getKey();\\n Integer edgeWeight = adjacencyPair.getValue();\\n if (!settledNodes.contains(adjacentNode)) {\\n Graph.calculateMinimumDistance(adjacentNode, edgeWeight, currentNode);\\n unsettledNodes.add(adjacentNode);\\n }\\n }\\n settledNodes.add(currentNode);\\n }\\n return graph;\\n }\",\n \"static void FindPath(vertex s, vertex[] array){\\r\\n\\t\\tvertex v; \\r\\n\\t\\tint min = Integer.MAX_VALUE;\\r\\n\\t\\t//node wN; vertex wV; //wN= adjacent node in LinkedList; wV= find the values in the vertices for wL\\r\\n\\t\\tint j =0;\\r\\n\\t\\ts.known = true;\\r\\n\\t\\ts.dist = 0;\\r\\n\\t\\tShortestPath(s, array);\\r\\n\\t\\r\\n\\t\\twhile(j<array.length-1 ){ //&& array[j].known== false){\\r\\n\\t\\t\\tint count = 0; \\r\\n\\t\\t\\tmin = Integer.MAX_VALUE;\\r\\n\\t\\t\\tfor(int i = 0; i<array.length; i++){\\r\\n\\t\\t\\t\\tif(array[i].known== false && array[i].dist < min){\\r\\n\\t\\t\\t\\t\\tmin = array[i].dist;\\r\\n\\t\\t\\t\\t\\tcount = i;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tv = array[count];\\r\\n //System.out.println(\\\"count: \\\" + count + \\\"Next v: \\\" + v.name);\\r\\n\\t\\t\\tShortestPath(v, array);\\r\\n\\t\\t\\tj++; \\t\\t\\r\\n }\\r\\n\\t}\",\n \"private void breadthFirstSearch(Node sourceNode, Node destinationNode, String path, HashSet<Character> visited) {\\n // Create a list of nodes to visit (children of nodes)\\n LinkedList<Node> nextToVisit = new LinkedList<>();\\n // Add the first node to the list\\n nextToVisit.add(sourceNode);\\n\\n // Traverse level by level by traversing to all of its children first\\n while(!nextToVisit.isEmpty()) {\\n Node node = nextToVisit.remove();\\n // If its visited already, continue to the next child\\n if(visited.contains(node.charId)) {\\n continue;\\n }\\n // Mark the node as visited\\n path += \\\"->\\\" + node.charId;\\n visited.add(node.charId);\\n // If destination is reached\\n if(node == destinationNode) {\\n paths.add(path);\\n return;\\n }\\n // Add all of its children to the next node to visit\\n for(Node children : node.adjacent) {\\n nextToVisit.add(children);\\n }\\n }\\n\\n }\",\n \"public void dijkstra(int graphWeight[][], int source){\\r\\n\\t\\t\\r\\n\\t\\tint queue[] = new int[vertices]; //The array which will hold the shortest distance from source to node i\\r\\n\\t\\tboolean set[] = new boolean[vertices]; //It will store true for node i if the shortest path to that vertex or node is found\\r\\n\\t\\t\\r\\n\\t\\t//Initialize distances to infinity and set[] array to false \\r\\n\\t\\tfor(int i=0;i<vertices;i++){\\r\\n\\t\\t\\tqueue[i] = Integer.MAX_VALUE; \\r\\n\\t\\t\\tset[i] = false;\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t//Distance of source vertex from itself is always 0\\r\\n\\t\\tqueue[source] = 0;\\r\\n\\r\\n\\t\\t//Find shortest path of all the vertices\\r\\n\\t\\tfor(int count=0;count<vertices-1;count++){\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//Pick the minimum distance vertex from the from the set of vertices \\r\\n\\t\\t\\t//not processed. u is equal to source in first iteration\\r\\n\\t\\t\\tint u = extractMinDistance(queue, set);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//Mark the picked vertex processed\\r\\n\\t\\t\\tset[u] = true;\\r\\n\\t\\t\\t//Update queue value of the adjacent vertices of the picked vertex\\r\\n\\t\\t\\tfor(int v=0;v<vertices;v++)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t//Update queue[v] only if\\r\\n\\t\\t\\t\\t// 1. It is not in set true in the Set Array\\r\\n\\t\\t\\t\\t// 2. There is an edge from u to v\\r\\n\\t\\t\\t\\t// 3. Total weight of path from source to v through u is smaller than current value of queue[v]\\r\\n\\t\\t\\t\\tif((graphWeight[u][v] > 0) && set[v] == false){\\r\\n\\t\\t\\t\\t\\t\\tif(queue[u] + graphWeight[u][v] < queue[v]){\\r\\n\\t\\t\\t\\t\\t\\t\\tqueue[v] = queue[u] + graphWeight[u][v];\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t//printSolution(queue, vertices);\\r\\n\\t\\t}\\r\\n\\t\\t//Print the constructed distance array\\r\\n\\t\\tprintSolution(queue, vertices);\\r\\n\\t}\",\n \"public Stack<Point> shortestPath() {\\n\\t\\tresetVisited();\\n\\t\\tStack <Point> shortestPath = new Stack<Point>();\\n\\t\\tprev = new HashMap<Point,Point>();\\n\\t\\tCompass[] direction = Compass.values();\\n\\t\\tQueue <Point> path = new LinkedList<Point>();\\n\\t\\tpath.add(playerStart);\\n\\t\\twhile(!path.isEmpty()) {\\n\\t\\t\\tPoint current = path.poll();\\n\\t\\t\\tfor (Compass pointing: direction) {\\n\\t\\t\\t\\tif (current.equals(goal)) {\\n\\t\\t\\t\\t\\tshortestPath.push(current);\\n\\t\\t\\t\\t\\twhile (prev.containsKey(shortestPath.peek()) && !shortestPath.peek().equals(playerStart)){\\n\\t\\t\\t\\t\\t\\tshortestPath.push(prev.get(shortestPath.peek()));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn shortestPath;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tint nextW = (int)current.getX() + pointing.mapX;\\n\\t\\t\\t\\tint nextH = (int)current.getY() + pointing.mapY;\\n\\t\\t\\t\\tPoint nextPoint = new Point(nextW, nextH);\\n\\t\\t\\t\\tif (arrayBounds(nextW, width) && arrayBounds (nextH, height) && maze[nextW][nextH] == 0 && !visited.contains(nextPoint)) {\\n\\t\\t\\t\\t\\tpath.add(nextPoint);\\n\\t\\t\\t\\t\\tvisited.add(nextPoint);\\n\\t\\t\\t\\t\\tprev.put(nextPoint, current);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn shortestPath;\\t\\t\\n\\t}\",\n \"@Test\\n public void directedRouting() {\\n EdgeIteratorState rightNorth, rightSouth, leftSouth, leftNorth;\\n graph.edge(0, 1).setDistance(1).set(speedEnc, 10, 10);\\n graph.edge(1, 2).setDistance(1).set(speedEnc, 10, 10);\\n graph.edge(2, 3).setDistance(1).set(speedEnc, 10, 10);\\n graph.edge(3, 4).setDistance(3).set(speedEnc, 10, 10);\\n rightNorth = graph.edge(4, 10).setDistance(1).set(speedEnc, 10, 10);\\n rightSouth = graph.edge(10, 5).setDistance(1).set(speedEnc, 10, 10);\\n graph.edge(5, 6).setDistance(2).set(speedEnc, 10, 10);\\n graph.edge(6, 2).setDistance(1).set(speedEnc, 10, 10);\\n graph.edge(2, 7).setDistance(1).set(speedEnc, 10, 10);\\n graph.edge(7, 8).setDistance(9).set(speedEnc, 10, 10);\\n leftSouth = graph.edge(8, 9).setDistance(1).set(speedEnc, 10, 10);\\n leftNorth = graph.edge(9, 0).setDistance(1).set(speedEnc, 10, 10);\\n\\n // make paths fully deterministic by applying some turn costs at junction node 2\\n setTurnCost(7, 2, 3, 1);\\n setTurnCost(7, 2, 6, 3);\\n setTurnCost(1, 2, 3, 5);\\n setTurnCost(1, 2, 6, 7);\\n setTurnCost(1, 2, 7, 9);\\n\\n final double unitEdgeWeight = 0.1;\\n assertPath(calcPath(9, 9, leftNorth.getEdge(), leftSouth.getEdge()),\\n 23 * unitEdgeWeight + 5, 23, (long) ((23 * unitEdgeWeight + 5) * 1000),\\n nodes(9, 0, 1, 2, 3, 4, 10, 5, 6, 2, 7, 8, 9));\\n assertPath(calcPath(9, 9, leftSouth.getEdge(), leftNorth.getEdge()),\\n 14 * unitEdgeWeight, 14, (long) ((14 * unitEdgeWeight) * 1000),\\n nodes(9, 8, 7, 2, 1, 0, 9));\\n assertPath(calcPath(9, 10, leftSouth.getEdge(), rightSouth.getEdge()),\\n 15 * unitEdgeWeight + 3, 15, (long) ((15 * unitEdgeWeight + 3) * 1000),\\n nodes(9, 8, 7, 2, 6, 5, 10));\\n assertPath(calcPath(9, 10, leftSouth.getEdge(), rightNorth.getEdge()),\\n 16 * unitEdgeWeight + 1, 16, (long) ((16 * unitEdgeWeight + 1) * 1000),\\n nodes(9, 8, 7, 2, 3, 4, 10));\\n }\",\n \"public String BFS(int g) {\\n\\t\\t//TODO\\n\\t}\",\n \"public List<GeographicPoint> dijkstra(GeographicPoint start, \\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t GeographicPoint goal, Consumer<GeographicPoint> nodeSearched)\\n\\t{\\n\\t\\t// TODO: Implement this method in WEEK 4\\n\\n\\t\\t// Hook for visualization. See writeup.\\n\\t\\t//nodeSearched.accept(next.getLocation());\\n\\t\\t\\n\\t\\t//initialize distance of each MapNode from start to infinity\\n\\t\\t\\n\\t\\tSet<GeographicPoint> visited = new HashSet<GeographicPoint>();\\n\\t\\tPriorityQueue<MapNode> queue = new PriorityQueue<MapNode>();\\n\\t\\tHashMap<GeographicPoint, List<GeographicPoint>> path = new HashMap<GeographicPoint, List<GeographicPoint>>();\\n\\t\\tint count = 0;\\n\\t\\t\\n\\t\\tif (!map.containsKey(start) || !map.containsKey(goal))\\n\\t\\t\\treturn null;\\n\\t\\t\\n\\t\\tfor (GeographicPoint temp : map.keySet())\\n\\t\\t\\tpath.put(temp, new ArrayList<GeographicPoint>());\\n\\t\\t\\n\\t\\tMapNode startNode = map.get(start);\\n\\t\\tstartNode.setTimeToStart(0.0);\\n\\t\\tstartNode.setDistanceToStart(0.0);\\n\\t\\tqueue.add(startNode);\\n\\t\\t\\n\\t\\twhile (!queue.isEmpty()) {\\n\\t\\t\\tMapNode currNode = queue.poll();\\n\\t\\t\\tnodeSearched.accept(currNode.getLocation());\\n\\t\\t\\t\\n\\t\\t\\tif (!visited.contains(currNode.getLocation())) {\\n\\t\\t\\t\\tvisited.add(currNode.getLocation());\\n\\t\\t\\t\\tcount++;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (currNode.getLocation().equals(goal))\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tHashMap<MapEdge, GeographicPoint> neighbours = currNode.getNeighbours();\\n\\t\\t\\t\\tfor (MapEdge edge : neighbours.keySet()) {\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif (!visited.contains(edge.getEnd())) {\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tMapNode addNode = map.get(neighbours.get(edge));\\n\\t\\t\\t\\t\\t\\tdouble tempTime = currNode.getTimeToStart() + ((edge.getDistance())/(edge.getSpeedLimit()));\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tif (tempTime < addNode.getTimeToStart()) {\\n\\t\\t\\t\\t\\t\\t\\taddNode.setTimeToStart(tempTime);\\n\\t\\t\\t\\t\\t\\t\\tqueue.add(addNode);\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\tList<GeographicPoint> temp = path.get(neighbours.get(edge));\\n\\t\\t\\t\\t\\t\\t\\ttemp.add(currNode.getLocation());\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tSystem.out.println(\\\"Dijkstra: \\\" + count);\\n\\t\\treturn backTrack(path,goal);\\n\\t}\",\n \"public void floyd_warshall()\\n{\\n /*\\n * We get the minimum tree again, but we allow cycles this time. This gives\\n * us the complete tree, but with edges ranked by priority.\\n */\\n this.minimumTree = this._getKruskalTree(true);\\n for (int loop = 0;\\n loop < this.nVerts;\\n loop++\\n ) {\\n this.bellman_ford(loop);\\n }\\n}\",\n \"private List<Pair<Integer, Integer>> getBestPath(Pair<Integer, Integer> curLocation, Pair<Integer, Integer> dest) {\\n\\t\\tList<Pair<Integer, Integer>> path = new LinkedList<Pair<Integer, Integer>>();\\n\\t\\t\\n\\t\\t\\n\\t\\tNode current = new Node(curLocation.getX(), curLocation.getY(), getHitProbability(curLocation.getX(), curLocation.getY()));\\n\\t\\tNode target = new Node(dest.getX(), dest.getY(), getHitProbability(dest.getX(), dest.getY()));\\n\\t\\tList<Node> openSet = new ArrayList<>();\\n List<Node> closedSet = new ArrayList<>();\\n \\n \\n while (true) {\\n openSet.remove(current);\\n List<Node> adjacent = getAdjacentNodes(current, closedSet, target);\\n\\n // Find the adjacent node with the lowest heuristic cost.\\n for (Node neighbor : adjacent) {\\n \\tboolean inOpenset = false;\\n \\tList<Node> openSetCopy = new ArrayList<>(openSet);\\n \\tfor (Node node : openSetCopy) {\\n \\t\\tif (neighbor.equals(node)) {\\n \\t\\t\\tinOpenset = true;\\n \\t\\t\\tif (neighbor.getAccumulatedCost() < node.getAccumulatedCost()) {\\n \\t\\t\\t\\topenSet.remove(node);\\n \\t\\t\\t\\topenSet.add(neighbor);\\n \\t\\t\\t}\\n \\t\\t}\\n \\t}\\n \\t\\n \\tif (!inOpenset) {\\n \\t\\topenSet.add(neighbor);\\n \\t}\\n }\\n\\n // Exit search if done.\\n if (openSet.isEmpty()) {\\n System.out.printf(\\\"Target (%d, %d) is unreachable from position (%d, %d).\\\\n\\\",\\n target.getX(), target.getY(), curLocation.getX(), curLocation.getY());\\n return null;\\n } else if (/*isAdjacent(current, target)*/ current.equals(target)) {\\n break;\\n }\\n\\n // This node has been explored now.\\n closedSet.add(current);\\n\\n // Find the next open node with the lowest cost.\\n Node next = openSet.get(0);\\n for (Node node : openSet) {\\n if (node.getCost(target) < next.getCost(target)) {\\n next = node;\\n }\\n }\\n// System.out.println(\\\"Moving to node: \\\" + current);\\n current = next;\\n }\\n \\n // Rebuild the path using the node parents\\n path.add(new Pair<Integer, Integer>(curLocation.getX(), curLocation.getY()));\\n while(current.getParent() != null) {\\n \\tcurrent = current.getParent();\\n \\tpath.add(0, new Pair<Integer, Integer>(current.getX(), current.getY()));\\n }\\n \\n if (path.size() > 1) {\\n \\tpath.remove(0);\\n }\\n \\n\\t\\treturn path;\\n\\t}\",\n \"public String breadthFirstSearch( AnyType start_vertex ) throws VertexException {\\n \\n StringBuffer buffer = new StringBuffer();\\n \\n // ----------------------------\\n // TODO: Add your code here\\n // ----------------------------\\n boolean exists = false;\\n Vertex<AnyType> S = new Vertex<AnyType>(start_vertex);\\n int counter = 1;\\n //make new vertex to check if its in list\\n //make queue to hold vertices\\n SemiConstantTimeQueue<Vertex<AnyType>> queue = new SemiConstantTimeQueue<Vertex<AnyType>>();\\n //loop through and set not visited\\n for( int i = 0; i < vertex_adjacency_list.size(); i++){\\n vertex_adjacency_list.get(i).setVisited(-1);\\n //if it's in list then set exists to true\\n //and set visited \\n if(vertex_adjacency_list.get(i).compareTo(S) == 0){\\n exists = true;\\n vertex_adjacency_list.get(i).setVisited(counter);\\n counter = i;\\n }\\n } \\n //if doesn't exist then throw the exception\\n if(exists == false){\\n throw new VertexException(\\\"Start Vertex does not exist\\\");\\n }\\n //make new queue\\n queue.add(vertex_adjacency_list.get(counter));\\n vertex_adjacency_list.get(counter).setVisited(1);\\n counter = 1;\\n int k=0;\\n Vertex<AnyType>e;\\n //while the queue isn't empty\\n while(queue.peek() !=null){\\n //make e the top of the queue \\n e = queue.peek(); \\n //go through the list and if you reach the begining it exits loop\\n for( k = 0; k < vertex_adjacency_list.size()-1; k++){\\n if(vertex_adjacency_list.get(k).compareTo(e)==0){\\n break;\\n }\\n } \\n //go through loop and check if visited, if not then add it to queue, set visited\\n for( int j = 0; j< vertex_adjacency_list.get(k).numberOfAdjacentVertices(); j++){\\n if(vertex_adjacency_list.get(k).getAdjacentVertex(j).hasBeenVisited()==false){\\n counter++;\\n queue.add(vertex_adjacency_list.get(k).getAdjacentVertex(j));\\n vertex_adjacency_list.get(k).getAdjacentVertex(j).setVisited(counter);\\n }\\n }\\n //remove from queue when through loop once\\n k++;\\n queue.remove();\\n }\\n //loop through list and print vertex and when it was visited\\n for(int o = 0; o< vertex_adjacency_list.size(); o++){\\n buffer.append(vertex_adjacency_list.get(o) + \\\":\\\" + vertex_adjacency_list.get(o).getVisited()+ \\\"\\\\n\\\");\\n }\\n return buffer.toString();\\n }\",\n \"public static ArrayList<edges<String, Double>> Dijkstra(String CHAR1, String CHAR2, graph<String,Float> g) {\\n\\t\\tPriorityQueue<ArrayList<edges<String, Double>>> active = \\n\\t\\t\\tnew PriorityQueue<ArrayList<edges<String, Double>>>(10,new Comparator<ArrayList<edges<String, Double>>>() {\\n\\t\\t\\t\\tpublic int compare(ArrayList<edges<String, Double>> path1, ArrayList<edges<String, Double>> path2) {\\n\\t\\t\\t\\t\\tedges<String, Double> dest1 = path1.get(path1.size() - 1);\\n\\t\\t\\t\\t\\tedges<String, Double> dest2 = path2.get(path2.size() - 1);\\n\\t\\t\\t\\t\\tif (!(dest1.getLabel().equals(dest2.getLabel())))\\n\\t\\t\\t\\t\\t\\treturn dest1.getLabel().compareTo(dest2.getLabel());\\n\\t\\t\\t\\t\\treturn path1.size() - path2.size();\\n\\t\\t\\t\\t}\\n\\t\\t\\t});\\n\\t\\t\\tSet<String> known = new HashSet<String>();\\n\\t\\t\\tArrayList<edges<String, Double>> begin = new ArrayList<edges<String, Double>>();\\n\\t\\t\\tbegin.add(new edges<String, Double>(CHAR1, 0.0));\\n\\t\\t\\tactive.add(begin);\\t\\t\\n\\t\\t\\twhile (!active.isEmpty()) {\\n\\t\\t\\t\\tArrayList<edges<String, Double>> minPath = active.poll();\\n\\t\\t\\t\\tedges<String, Double> endOfMinPath = minPath.get(minPath.size() - 1);\\n\\t\\t\\t\\tString minDest = endOfMinPath.getDest();\\n\\t\\t\\t\\tdouble minCost = endOfMinPath.getLabel();\\n\\t\\t\\t\\tif (minDest.equals(CHAR2)) {\\n\\t\\t\\t\\t\\treturn minPath;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (known.contains(minDest))\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\tSet<edges<String,Float>> children = g.childrenOf(minDest);\\n\\t\\t\\t\\tfor (edges<String, Float> e : children) {\\n\\t\\t\\t\\t\\tif (!known.contains(e.getDest())) {\\n\\t\\t\\t\\t\\t\\tdouble newCost = minCost + e.getLabel();\\n\\t\\t\\t\\t\\t\\tArrayList<edges<String, Double>> newPath = new ArrayList<edges<String, Double>>(minPath); \\n\\t\\t\\t\\t\\t\\tnewPath.add(new edges<String, Double>(e.getDest(), newCost));\\n\\t\\t\\t\\t\\t\\tactive.add(newPath);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tknown.add(minDest);\\n\\t\\t\\t}\\n\\t\\t\\treturn null;\\n\\t}\",\n \"private void computeShortestPathsFromSource(V source) {\\n\\t\\tBFSDistanceLabeler<V, E> labeler = new BFSDistanceLabeler<V, E>();\\n\\t\\tlabeler.labelDistances(mGraph, source);\\n\\t\\tdistances = labeler.getDistanceDecorator();\\n\\t\\tMap<V, Number> currentSourceSPMap = new HashMap<V, Number>();\\n\\t\\tMap<V, E> currentSourceEdgeMap = new HashMap<V, E>();\\n\\n\\t\\tfor (V vertex : mGraph.getVertices()) {\\n\\n\\t\\t\\tNumber distanceVal = distances.get(vertex);\\n\\t\\t\\t// BFSDistanceLabeler uses -1 to indicate unreachable vertices;\\n\\t\\t\\t// don't bother to store unreachable vertices\\n\\t\\t\\tif (distanceVal != null && distanceVal.intValue() >= 0) {\\n\\t\\t\\t\\tcurrentSourceSPMap.put(vertex, distanceVal);\\n\\t\\t\\t\\tint minDistance = distanceVal.intValue();\\n\\t\\t\\t\\tfor (E incomingEdge : mGraph.getInEdges(vertex)) {\\n\\t\\t\\t\\t\\tfor (V neighbor : mGraph\\n\\t\\t\\t\\t\\t\\t\\t.getIncidentVertices(incomingEdge)) {\\n\\t\\t\\t\\t\\t\\tif (neighbor.equals(vertex))\\n\\t\\t\\t\\t\\t\\t {\\n\\t\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t\\t// V neighbor = mGraph.getOpposite(vertex,\\n\\t\\t\\t\\t\\t\\t// incomingEdge);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tNumber predDistanceVal = distances.get(neighbor);\\n\\n\\t\\t\\t\\t\\t\\tint pred_distance = predDistanceVal.intValue();\\n\\t\\t\\t\\t\\t\\tif (pred_distance < minDistance && pred_distance >= 0) {\\n\\t\\t\\t\\t\\t\\t\\tminDistance = predDistanceVal.intValue();\\n\\t\\t\\t\\t\\t\\t\\tcurrentSourceEdgeMap.put(vertex, incomingEdge);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmDistanceMap.put(source, currentSourceSPMap);\\n\\t\\tmIncomingEdgeMap.put(source, currentSourceEdgeMap);\\n\\t}\",\n \"private void dijkstra(final NavigableSet<Node> queue) {\\n Node firstNode, neighbor;\\n while (!queue.isEmpty()) {\\n // vertex with shortest distance (first iteration will return source)\\n firstNode = queue.pollFirst();\\n assert firstNode != null;\\n if (!explored.contains(firstNode.coordinate)) {\\n explored.add(firstNode.coordinate);\\n }\\n if (firstNode.dist == Integer.MAX_VALUE)\\n // we can ignore u (and any other remaining vertices) since they are unreachable\\n break;\\n //look at distances to each neighbour\\n for (Map.Entry<Node, Integer> temp : firstNode.neighbours.entrySet()) {\\n neighbor = temp.getKey(); //the neighbour in this iteration\\n if (!explored.contains(neighbor.coordinate)) {\\n explored.add(neighbor.coordinate);\\n }\\n final int alternateDist = firstNode.dist + temp.getValue();\\n if (alternateDist < neighbor.dist) { // shorter path to neighbour found\\n queue.remove(neighbor);\\n neighbor.dist = alternateDist;\\n neighbor.previous = firstNode;\\n queue.add(neighbor);\\n }\\n }\\n }\\n }\",\n \"@Override\\r\\n\\tpublic void getMinimumSpanningTree(GraphStructure graph) {\\r\\n\\t\\tdistanceArray = new int [graph.getNumberOfVertices()];\\r\\n\\t\\tint numberOfVertices=graph.getNumberOfVertices();\\r\\n\\t\\tSet<Integer> spanningTreeSet = new HashSet<Integer>();\\r\\n\\t\\tArrays.fill(distanceArray,Integer.MAX_VALUE);\\r\\n\\t\\tdistanceArray[0]=0;\\r\\n\\t\\tadjacencyList = graph.getAdjacencyList();\\r\\n\\t\\tList<Edge> list;\\r\\n\\t\\twhile(spanningTreeSet.size()!=numberOfVertices) {\\r\\n\\t\\t\\tfor (int vertex=0; vertex<numberOfVertices;vertex++) {\\r\\n\\t\\t\\t\\tif(! spanningTreeSet.contains(vertex)) {\\r\\n\\t\\t\\t\\t\\tspanningTreeSet.add(vertex);\\r\\n\\t\\t\\t\\t\\tlist = adjacencyList[vertex];\\r\\n\\t\\t\\t\\t\\tfor(Edge value : list) {\\r\\n\\t\\t\\t\\t\\t\\tint sumOfWeightAndSourceVertexDistanceValue = distanceArray[vertex] + value.getWeight();\\r\\n\\t\\t\\t\\t\\t\\tint distanceValueOfDestinationVertex = distanceArray[value.getVertex()];\\r\\n\\t\\t\\t\\t\\t\\tif( sumOfWeightAndSourceVertexDistanceValue < distanceValueOfDestinationVertex ) {\\r\\n\\t\\t\\t\\t\\t\\t\\tdistanceArray[value.getVertex()] = sumOfWeightAndSourceVertexDistanceValue;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tSystem.out.println(\\\"\\\\nvertex\\\\tdistance from source\\\");\\r\\n\\t\\tfor (int i=0;i<numberOfVertices;i++) {\\r\\n\\t\\t\\tSystem.out.println(i+\\\"\\\\t\\\"+distanceArray[i]);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"@Override\\n List<NodeData> pathFind() throws NoPathException {\\n System.out.println(\\\"Starting Scenic\\\");\\n\\n frontier.add(start);\\n\\n while(!frontier.isEmpty()) {\\n StarNode current = frontier.getLast();\\n frontier.removeLast(); // pop the priority queue\\n if(current.getXCoord() == goal.getXCoord() && current.getYCoord() == goal.getYCoord()) {\\n // If we are at the goal, we need to backtrack through the shortest path\\n System.out.println(\\\"At target!\\\");\\n finalList.add(current); // we have to add the goal to the path before we start backtracking\\n while(!(current.getXCoord() == start.getXCoord() && current.getYCoord() == start.getYCoord())) {\\n finalList.add(current.getPreviousNode());\\n current = current.getPreviousNode();\\n System.out.println(current.getNodeID());\\n }\\n return finalList;\\n }\\n else {\\n // we need to get all the neighbor nodes, identify their costs, and put them into the queue\\n LinkedList<StarNode> neighbors = current.getNeighbors();\\n // we also need to remove the previous node from the list of neighbors because we do not want to backtrack\\n neighbors.remove(current.getPreviousNode());\\n\\n for (StarNode newnode : neighbors) {\\n int nodePlace = this.listContainsId(frontier, newnode);\\n if(nodePlace > -1) {\\n if (frontier.get(nodePlace).getF() > actionCost(newnode) + distanceToGo(newnode, goal)) {\\n System.out.println(\\\"Here\\\");\\n frontier.remove(frontier.get(nodePlace));\\n newnode.setPreviousNode(current);\\n frontier.add(newnode);\\n newnode.setF(actionCost(newnode) + distanceToGo(newnode, goal));\\n }\\n }\\n else {\\n newnode.setPreviousNode(current);\\n frontier.add(newnode);\\n newnode.setF(actionCost(newnode) + distanceToGo(newnode, goal));\\n }\\n\\n // This fixes the problem with infinitely looping elevators (I hope)\\n if(current.getNodeType().equals(\\\"ELEV\\\") && newnode.getNodeType().equals(\\\"ELEV\\\")) {\\n for (Iterator<StarNode> iterator = newnode.neighbors.iterator(); iterator.hasNext();) {\\n StarNode newneighbor = iterator.next();\\n if (newneighbor.getNodeType().equals(\\\"ELEV\\\")) {\\n // Remove the current element from the iterator and the list.\\n iterator.remove();\\n }\\n }\\n }\\n if(current.getNodeType().equals(\\\"STAI\\\") && newnode.getNodeType().equals(\\\"STAI\\\")) {\\n for (Iterator<StarNode> iterator = newnode.neighbors.iterator(); iterator.hasNext();) {\\n StarNode newneighbor = iterator.next();\\n if (newneighbor.getNodeType().equals(\\\"STAI\\\")) {\\n // Remove the current element from the iterator and the list.\\n iterator.remove();\\n }\\n }\\n }\\n // this is where the node is put in the right place in the queue\\n Collections.sort(frontier);\\n }\\n }\\n }\\n throw new NoPathException(start.getLongName(), goal.getLongName());\\n }\",\n \"@Nullable\\n private NodeWithCost<V, A> findShortestPath(@Nonnull DirectedGraph<V, A> graph,\\n V start, V goal, @Nonnull ToDoubleFunction<A> costf) {\\n PriorityQueue< NodeWithCost<V, A>> frontier = new PriorityQueue<>(61);\\n Map<V, NodeWithCost<V, A>> frontierMap = new HashMap<>(61);\\n // Size of explored is the expected number of nextArrows that we need to explore.\\n Set<V> explored = new HashSet<>(61);\\n return doFindShortestPath(start, frontier, frontierMap, goal, explored, graph, costf);\\n }\",\n \"public LinkedList<Node> shortestPath() throws PathNotFoundException {\\n // Which strategy shall we use?\\n ApplicationConfiguration config = ApplicationConfiguration.getInstance();\\n switch(config.getCurrentSearchAlgorithm()) {\\n case A_STAR:\\n return aStarPath();\\n case BFS:\\n return bfsPath();\\n case DFS:\\n return dfsPath();\\n default:\\n return null;\\n }\\n }\",\n \"public ArrayList<String> breadthFirstSearch(Character sourceId, Character destinationId) {\\n if(!graph.containsKey(sourceId) || !graph.containsKey(destinationId)) {\\n throw new NullPointerException(\\\"The graph does not contain the source or the destination node ID\\\");\\n }\\n // Initialize the list of paths & visited set\\n paths = new ArrayList<>();\\n HashSet<Character> visited = new HashSet<>();\\n // Get the nodes from the map\\n Node sourceNode = getNode(sourceId);\\n Node destinationNode = getNode(destinationId);\\n // Call the private method\\n breadthFirstSearch(sourceNode, destinationNode, \\\"\\\", visited);\\n // Return the paths found\\n return paths;\\n }\",\n \"private HashMap<String, Integer> getShortestPathBetweenDifferentNodes(Node start, Node end) {\\n HashMap<Node, Node> parentChildMap = new HashMap<>();\\n parentChildMap.put(start, null);\\n\\n // Shortest path between nodes\\n HashMap<Node, Integer> shortestPathMap = new HashMap<>();\\n\\n for (Node node : getNodes()) {\\n if (node == start)\\n shortestPathMap.put(start, 0);\\n else shortestPathMap.put(node, Integer.MAX_VALUE);\\n }\\n\\n for (Edge edge : start.getEdges()) {\\n shortestPathMap.put(edge.getDestination(), edge.getWeight());\\n parentChildMap.put(edge.getDestination(), start);\\n }\\n\\n while (true) {\\n Node currentNode = closestUnvisitedNeighbour(shortestPathMap);\\n\\n if (currentNode == null) {\\n return null;\\n }\\n\\n // Save path to nearest unvisited node\\n if (currentNode == end) {\\n Node child = end;\\n String path = end.getName();\\n while (true) {\\n Node parent = parentChildMap.get(child);\\n if (parent == null) {\\n break;\\n }\\n\\n // Create path using previous(parent) and current(child) node\\n path = parent.getName() + \\\"\\\" + path;\\n child = parent;\\n }\\n HashMap<String,Integer> hm= new HashMap<>();\\n hm.put(path, shortestPathMap.get(end));\\n return hm;\\n }\\n currentNode.visit();\\n\\n // Go trough edges and find nearest\\n for (Edge edge : currentNode.getEdges()) {\\n if (edge.getDestination().isVisited())\\n continue;\\n\\n if (shortestPathMap.get(currentNode) + edge.getWeight() < shortestPathMap.get(edge.getDestination())) {\\n shortestPathMap.put(edge.getDestination(), shortestPathMap.get(currentNode) + edge.getWeight());\\n parentChildMap.put(edge.getDestination(), currentNode);\\n }\\n }\\n }\\n }\",\n \"public List<String> computeBestPath(String source, String dest)\\r\\n {\\r\\n Vertex v;\\r\\n List<String>shortestPath = new LinkedList<String>();\\r\\n \\r\\n // First, relax all nodes\\r\\n computeAllPaths(source);\\r\\n \\r\\n // Then go through each one and return the path as a list of strings\\r\\n for (v= network_topology.get(dest); v != null; v = v.previous)\\r\\n { \\r\\n shortestPath.add(v.name);\\r\\n }\\r\\n \\r\\n Collections.reverse(shortestPath);\\r\\n \\r\\n // Clear the relaxed values so that they can be recalculated with each term\\r\\n clearPathData();\\r\\n \\r\\n return shortestPath;\\r\\n }\",\n \"public KnightNode getPathByBFS(KnightNode startNode,\\n\\t\\t\\tKnightNode finishNode) {\\n\\t\\tif (startNode == null) {\\n\\t\\t\\tthrow new IllegalArgumentException(\\\"start node shouldn't be null!\\\");\\n\\t\\t}\\n\\n\\t\\tif (finishNode == null) {\\n\\t\\t\\tthrow new IllegalArgumentException(\\\"finish node shouldn't be null!\\\");\\n\\t\\t}\\n\\n\\t\\tQueue<KnightNode> queue = new LinkedList<KnightNode>();\\n\\n\\t\\t// step 0\\n\\t\\tstartNode.isUsed = true;\\n\\t\\tqueue.add(startNode);\\n\\t\\n\\t\\twhile (!queue.isEmpty()) {\\n\\t\\t\\t// get next node from head of queue\\n\\t\\t\\tKnightNode tmpNode = queue.remove();\\n\\t\\t\\tSet<KnightNode> childNodes = tmpNode.availableMoves;\\n\\t\\t\\tfor (KnightNode tmpChild : childNodes) {\\n\\t\\t\\t\\ttmpChild = findNode(tmpChild.x, tmpChild.y);\\n\\t\\t\\t\\t// check if we have already been here\\n\\t\\t\\t\\tif (!tmpChild.isUsed) {\\n\\t\\t\\t\\t\\ttmpChild.root = tmpNode;\\n\\t\\t\\t\\t\\ttmpChild.isUsed = true;\\n\\t\\t\\t\\t\\tqueue.add(tmpChild);\\n\\n\\t\\t\\t\\t\\tif (tmpChild.equals(finishNode)) {\\n\\t\\t\\t\\t\\t\\t// we have found our short path\\n\\t\\t\\t\\t\\t\\treturn tmpChild;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\t// path is not exist\\n\\t\\treturn null;\\n\\t}\",\n \"void dijkstra(Coordinate startName) {\\n if (!graph.containsKey(startName)) {\\n //test use print statement\\n //System.out.printf(\\\"Graph doesn't contain start vertex \\\\\\\"%s\\\\\\\"\\\\n\\\", startName);\\n return;\\n }\\n final Node source = graph.get(startName);\\n NavigableSet<Node> queue = new TreeSet<>();\\n\\n // set-up vertices\\n for (Node node : graph.values()) {\\n node.previous = node == source ? source : null;\\n node.dist = node == source ? 0 : Integer.MAX_VALUE;\\n queue.add(node);\\n }\\n dijkstra(queue);\\n }\",\n \"public static void exampleGraph() {\\n\\t\\t// create a simple FNSS topology\\n\\t\\tTopology topology = new Topology();\\n\\t\\ttopology.addEdge(\\\"1\\\", \\\"2\\\", new Edge());\\n\\t\\ttopology.addEdge(\\\"2\\\", \\\"3\\\", new Edge());\\n\\t\\t\\n\\t\\t// convert to JGraphT\\n\\t\\tGraph<String, Edge> graph = JGraphTConverter.getGraph(topology);\\n\\t\\t\\n\\t\\t// Find shortest paths\\n\\t\\tString source = \\\"3\\\";\\n\\t\\tString destination = \\\"1\\\";\\n\\t\\tList<Edge> sp = DijkstraShortestPath.findPathBetween(graph, source, destination);\\n\\t\\t\\n\\t\\t// Print results\\n\\t\\tSystem.out.println(\\\"Shortest path from \\\" + source + \\\" to \\\" + destination + \\\":\\\");\\n\\t\\tfor (Edge e : sp) {\\n\\t\\t\\tSystem.out.println(graph.getEdgeSource(e) + \\\" -> \\\" + graph.getEdgeTarget(e));\\n\\t\\t}\\n\\t}\",\n \"public static void djikstra(int[][] graph, int src) {\\n\\t\\t/* output array */\\n\\t\\tint[] dist = new int[graph.length];\\n\\t\\tboolean[] visited = new boolean[graph.length];\\n\\n\\t\\tfor (int i = 0; i < graph.length; i++) {\\n\\t\\t\\tdist[i] = Integer.MAX_VALUE;\\n\\t\\t\\tvisited[i] = false;\\n\\t\\t}\\n\\n\\t\\tdist[src] = 0;\\n\\n\\t\\tfor (int i = 0; i < graph.length - 1; i++) {\\n\\n\\t\\t\\t// Pick the minimum distance vertex from the set of vertices not\\n\\t\\t\\t// yet processed. u is always equal to src in first iteration.\\n\\t\\t\\tint u = findMinDistanceVertex(dist, visited);\\n\\t\\t\\t// Mark the picked vertex as processed\\n\\t\\t\\tvisited[u] = true;\\n\\t\\t\\t\\n\\t\\t\\tfor(int j = 0; j < graph.length; j++) {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Update dist[v] only if is not in sptSet, there is an edge from \\n\\t\\t // u to v, and total weight of path from src to v through u is \\n\\t\\t // smaller than current value of dist[v]\\n\\t\\t\\t\\tif(!visited[j] && graph[u][j] != 0\\n\\t\\t\\t\\t\\t\\t&& dist[u] != Integer.MAX_VALUE\\n\\t\\t\\t\\t\\t\\t&& dist[u] + graph[u][j] < dist[j]) {\\n\\t\\t\\t\\t\\tdist[j] = dist[u] + graph[u][j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tprintSolution(dist, graph.length);\\n\\t}\",\n \"public static void getShortestPath()\\r\\n\\t{\\r\\n\\t\\tScanner scan = new Scanner(System.in); //instance for input declared\\r\\n\\t\\tSystem.out.print(\\\"\\\\nPlease enter the Source node for shortest path: \\\");\\r\\n\\t\\tint src = scan.nextInt() - 1;\\r\\n\\t\\twhile(src < 0 || src > routers-1)\\r\\n {\\r\\n\\t\\t\\tSystem.out.println(\\\"The entered source node is out of range, please enter again: \\\"); // Printing error\\r\\n\\t\\t\\tsrc = scan.nextInt() - 1;\\t//re-input source\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tSystem.out.print(\\\"Please enter the destination node for shortest path: \\\");\\r\\n\\t\\tint dest = scan.nextInt() - 1;\\r\\n\\t\\twhile(dest < 0 || dest > routers-1)\\r\\n {\\r\\n\\t\\t\\tSystem.out.println(\\\"The entered destination node is out of range, please enter again: \\\"); // Printing error\\r\\n\\t\\t\\tdest = scan.nextInt() - 1;\\t//re-input destination\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tconnectNetwork(src, dest, true);\\r\\n\\t}\",\n \"static int shortestCellPath(int[][] grid, int sr, int sc, int tr, int tc) {\\n\\n\\n Queue<Pair> queue = new LinkedList<>();\\n\\n\\n boolean visited[][] = new boolean[grid.length][grid[0].length];\\n\\n\\n int dirs[][] = new int[][]{{1,0},{0,1},{-1,0},{0,-1}};\\n\\n queue.offer(new Pair(sr,sc,0));\\n visited[sr][sc] = true;\\n\\n while(!queue.isEmpty()){\\n\\n Pair currentNode = queue.poll();\\n\\n if(currentNode.row == tr && currentNode.col == tc) {\\n return currentNode.d;\\n }\\n\\n\\n\\n\\n for(int[] dir : dirs) {\\n\\n\\n int row = currentNode.row + dir[0];\\n int col = currentNode.col + dir[1];\\n\\n if(row >= 0 && row < grid.length && col >= 0 && col < grid[0].length && !visited[row][col] && grid[row][col] == 1) {\\n queue.offer(new Pair(row,col,currentNode.d+1));\\n visited[row][col] = true;\\n }\\n }\\n\\n\\n\\n }\\n\\n return -1;\\n }\",\n \"HashMap<GamePiece, GamePiece> bfs(GamePiece from) {\\n ArrayDeque<GamePiece> worklist = new ArrayDeque<GamePiece>();\\n ArrayList<GamePiece> seen = new ArrayList<GamePiece>();\\n HashMap<GamePiece, GamePiece> graph = new HashMap<GamePiece, GamePiece>();\\n worklist.addFirst(from);\\n graph.put(from, from);\\n while (worklist.size() > 0) {\\n GamePiece next = worklist.removeFirst();\\n if (seen.contains(next)) {\\n // if seen has the next element, don't do anything with it\\n }\\n else {\\n for (String s : this.directions) {\\n if (next.hasNeighbor(s) && next.connected(s)) {\\n worklist.addFirst(next.neighbors.get(s));\\n graph.put(next.neighbors.get(s), next);\\n }\\n }\\n seen.add(next);\\n }\\n }\\n return graph;\\n }\",\n \"private PathCostFlow findCheapestPath(int start, int end, double max_flow) throws Exception {\\n if (getNode(start) == null || getNode(end) == null\\n || !getNode(start).isSource() || getNode(end).isSource()) {\\n throw new IllegalArgumentException(\\\"start must be the index of a source and end must be the index of a sink\\\");\\n }\\n double amount = Math.min(Math.min(getNode(start).getResidualCapacity(),\\n getNode(end).getResidualCapacity()), max_flow);\\n\\n boolean[] visited = new boolean[n];\\n int[] parent = new int[n];\\n for (int i = 0; i < n; i++) {\\n parent[i] = -1;\\n }\\n double[] cost = new double[n];\\n for (int i = 0; i < n; i++) {\\n cost[i] = Integer.MAX_VALUE;\\n }\\n cost[start] = 0;\\n\\n PriorityQueue<IndexCostTuple> queue = new PriorityQueue<IndexCostTuple>();\\n queue.add(new IndexCostTuple(start, 0));\\n\\n while (!queue.isEmpty()) {\\n IndexCostTuple current = queue.poll();\\n\\n // we found the target node\\n if (current.getIndex() == end) {\\n ArrayList<Integer> path = new ArrayList<Integer>();\\n path.add(new Integer(end));\\n while (path.get(path.size() - 1) != start) {\\n path.add(parent[path.get(path.size() - 1)]);\\n }\\n Collections.reverse(path);\\n if ((path.get(0) != start) || (path.get(path.size() - 1) != end)) {\\n throw new Exception(\\\"I fucked up coding Dijkstra's\\\");\\n }\\n return new PathCostFlow(path, cost[end], amount);\\n }\\n\\n // iterate through all possible neighbors of the current node\\n for (int i = 0; i < n; i++) {\\n SingleEdge e = matrix[current.getIndex()][i];\\n if ((!visited[i]) && (e != null)\\n && (current.getCost() + e.getCost(amount) < cost[i])) {\\n cost[i] = current.getCost() + e.getCost(amount);\\n parent[i] = current.getIndex();\\n\\n // update the entry for this node in the queue\\n IndexCostTuple newCost = new IndexCostTuple(i, cost[i]);\\n queue.remove(newCost);\\n queue.add(newCost);\\n }\\n }\\n visited[current.getIndex()] = true;\\n }\\n\\n return null; //the target node was unreachable\\n }\",\n \"private Path aStar(AStarNode start, AStarNode end) {\\n\\n\\t/*pre-search setup*/\\n astarSetup(end);\\n AStarNode current = start;\\n current.updateDist(0.0F);\\n ArrayList<AStarNode> openSet = new ArrayList<>(getNodes().size());\\n addNode(openSet, start);\\n start.setFound(true);\\n\\n while (!openSet.isEmpty()) { // While there are nodes to evaluate\\n if (current.equals(end)) // When reached the destination\\n return createPath(start, end);\\n openSet.remove(current); // Removes the node whose shortest distance from start position is determined\\n current.setVisited(true); // marking the field that is added to closedSet\\n \\n for (AStarNode neighbor : current.getConnections()) { \\n if (!neighbor.isVisited() && !neighbor.found()) { // if it is not seen before, add to open list\\n addNode(openSet,neighbor);\\n neighbor.setFound(true);\\n neighbor.setPrevious(current);\\n neighbor.setHeruistic(end);\\n neighbor.updateDist(current.getDist() + current.getDistTo(neighbor));\\n }\\n else if(!neighbor.isVisited()){ //If seen before, update cost.\\n double tempGScore = current.getDist() + current.getDistTo(neighbor);\\n if (neighbor.getDist() > tempGScore) {\\n neighbor.updateDist(tempGScore);\\n neighbor.setPrevious(current);\\n neighbor.setHeruistic(end);\\n }\\n }\\n }\\n current = getMinFScore(openSet); // setting next node as a node with minimum fScore.\\n }\\n\\t\\n\\t/*If search ends without returning a path, there is no possible path.*/\\n throw new PathFindingAlgorithm.AlgorithmFailureException();\\n }\",\n \"private String getShortestPath(final Pair<Long, Long> src, final Pair<Long, Long> dst,\\n final String passCode, final boolean first) {\\n final var queue = new LinkedList<Node>();\\n final var seen = new HashSet<Node>();\\n //start from source\\n final var srcNode = new Node( src, \\\"\\\" );\\n queue.add( srcNode );\\n seen.add( srcNode );\\n\\n int max = 0;\\n while ( !queue.isEmpty() ) {\\n final var curr = queue.remove();\\n if ( curr.pos.equals( dst ) ) {\\n if ( first ) {\\n //shortest path\\n return curr.path;\\n } else {\\n //store path length\\n max = curr.path.length();\\n //stop this path\\n }\\n } else {\\n for ( final var neighbour : getNeighbours( curr, passCode ) ) {\\n //unseen neighbour\\n if ( seen.add( neighbour ) ) {\\n //add to the queue\\n queue.add( neighbour );\\n }\\n }\\n }\\n }\\n\\n return itoa( max );\\n }\",\n \"public void Djkstra(int source) {\\n\\t\\tfor (int i = 0; i < vertices; i++) {\\n\\t\\t\\tdist[i] = Integer.MAX_VALUE; // added infinity to all ,\\n\\t\\t}\\n\\t\\t\\n\\t\\tdist[source] = 0;\\n\\n\\t\\t// add source vertex to priority queue\\n\\t\\tq.add(new Node(source, 0));\\n\\n\\n\\t\\t// while my all vertices are not selected as a min among smallest one time\\n\\t\\t// refracted in visited\\n\\t\\twhile (visited.size() != vertices) {\\n\\n\\t\\t\\t// pick from priority queue the smallest/min distance\\n\\t\\t\\tint i = q.remove().node;\\n\\n\\t\\t\\t// once node is removed from queue add to set\\n\\t\\t\\tvisited.add(i);\\n\\n\\t\\t\\t// relax adjacent vertex of this node;\\n\\t\\t\\t// And add the new node to queue bcoz distance has got updated so add new node as i dont have any method to update \\n\\t\\t\\t// already present node and its distance\\n\\t\\t\\t\\n\\n\\t\\t\\tfor (Node v : graph[i]) {\\n\\t\\t\\t\\tif (!visited.contains(v.node)) {\\n\\t\\t\\t\\t\\tif (dist[i] + v.cost < dist[v.node]) {\\n\\t\\t\\t\\t\\t\\tdist[v.node] = dist[i] + v.cost;\\n\\t\\t\\t\\t\\t\\tq.add(new Node(v.node, dist[v.node]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7235284","0.71405","0.70830643","0.6733986","0.65027964","0.64627135","0.6458492","0.6431659","0.6394997","0.6389615","0.6381586","0.63688207","0.6359802","0.6355839","0.63443756","0.6308898","0.6297694","0.62451416","0.6212219","0.6200578","0.61981344","0.6186831","0.6183426","0.6169001","0.6165777","0.61378664","0.6123661","0.61168486","0.609643","0.60807484","0.60694057","0.60526264","0.6032997","0.6028948","0.60130405","0.60130066","0.6010968","0.5985051","0.5975607","0.5955093","0.5946875","0.594349","0.5933025","0.5932357","0.5928044","0.59215456","0.5920365","0.5918939","0.59089816","0.5904789","0.5901767","0.58975434","0.5889175","0.5876909","0.5875338","0.5874729","0.587313","0.58660793","0.586433","0.5859104","0.58584446","0.5858099","0.5841035","0.5833367","0.5822998","0.5814504","0.58097076","0.58072567","0.5804677","0.5799135","0.57949656","0.5793569","0.5792463","0.57862055","0.577285","0.5770348","0.57683337","0.57640386","0.5762087","0.576035","0.57567406","0.5754551","0.57504785","0.57497233","0.5740796","0.57383615","0.573787","0.5724957","0.57227224","0.57225204","0.5721608","0.5720476","0.5719365","0.5714245","0.5705123","0.5696933","0.56958383","0.5695606","0.56931555","0.5692458"],"string":"[\n \"0.7235284\",\n \"0.71405\",\n \"0.70830643\",\n \"0.6733986\",\n \"0.65027964\",\n \"0.64627135\",\n \"0.6458492\",\n \"0.6431659\",\n \"0.6394997\",\n \"0.6389615\",\n \"0.6381586\",\n \"0.63688207\",\n \"0.6359802\",\n \"0.6355839\",\n \"0.63443756\",\n \"0.6308898\",\n \"0.6297694\",\n \"0.62451416\",\n \"0.6212219\",\n \"0.6200578\",\n \"0.61981344\",\n \"0.6186831\",\n \"0.6183426\",\n \"0.6169001\",\n \"0.6165777\",\n \"0.61378664\",\n \"0.6123661\",\n \"0.61168486\",\n \"0.609643\",\n \"0.60807484\",\n \"0.60694057\",\n \"0.60526264\",\n \"0.6032997\",\n \"0.6028948\",\n \"0.60130405\",\n \"0.60130066\",\n \"0.6010968\",\n \"0.5985051\",\n \"0.5975607\",\n \"0.5955093\",\n \"0.5946875\",\n \"0.594349\",\n \"0.5933025\",\n \"0.5932357\",\n \"0.5928044\",\n \"0.59215456\",\n \"0.5920365\",\n \"0.5918939\",\n \"0.59089816\",\n \"0.5904789\",\n \"0.5901767\",\n \"0.58975434\",\n \"0.5889175\",\n \"0.5876909\",\n \"0.5875338\",\n \"0.5874729\",\n \"0.587313\",\n \"0.58660793\",\n \"0.586433\",\n \"0.5859104\",\n \"0.58584446\",\n \"0.5858099\",\n \"0.5841035\",\n \"0.5833367\",\n \"0.5822998\",\n \"0.5814504\",\n \"0.58097076\",\n \"0.58072567\",\n \"0.5804677\",\n \"0.5799135\",\n \"0.57949656\",\n \"0.5793569\",\n \"0.5792463\",\n \"0.57862055\",\n \"0.577285\",\n \"0.5770348\",\n \"0.57683337\",\n \"0.57640386\",\n \"0.5762087\",\n \"0.576035\",\n \"0.57567406\",\n \"0.5754551\",\n \"0.57504785\",\n \"0.57497233\",\n \"0.5740796\",\n \"0.57383615\",\n \"0.573787\",\n \"0.5724957\",\n \"0.57227224\",\n \"0.57225204\",\n \"0.5721608\",\n \"0.5720476\",\n \"0.5719365\",\n \"0.5714245\",\n \"0.5705123\",\n \"0.5696933\",\n \"0.56958383\",\n \"0.5695606\",\n \"0.56931555\",\n \"0.5692458\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.5797351"},"document_rank":{"kind":"string","value":"70"}}},{"rowIdx":29393,"cells":{"query":{"kind":"string","value":"Sort in decreasing length order"},"document":{"kind":"string","value":"@Override\n public int compare(String o1, String o2) {\n return Integer.compare(o2.length(), o1.length());\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["public void sort(){\n for(int i = array.length-1;i >= 0;i--){\n sink(i);\n }\n while(size > 0){\n swap(0, size-1);\n size -= 1;\n sink(0);\n }\n }","public static ArrayList<String> lineLengthSort(ArrayList<String> inArray)\n\t{\n\t\tboolean hasSwapped = true;\n\t\twhile (hasSwapped)\n\t\t{\n\t\t\thasSwapped = false;\n\t\t\tfor(int i = 1; i < inArray.size(); i++)\n\t\t\t{\n\t\t\t\tif(inArray.get(i - 1).length() > inArray.get(i).length())\n\t\t\t\t{\n\t\t\t\t\tString temp = inArray.get(i - 1);\n\t\t\t\t\tinArray.set(i - 1, inArray.get(i));\n\t\t\t\t\tinArray.set(i, temp);\n\t\t\t\t\thasSwapped = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn inArray;\n\t}","public void sortByWordLengthDesc() {\r\n\t\tcomparator = new WordLengthDesc();\r\n\t}","private void sort()\n {\n // This implements Shell sort.\n // Unfortunately we cannot use the sorting functions from the library\n // (e.g. java.util.Arrays.sort), since the ones that work on int\n // arrays do not accept a comparison function, but only allow\n // sorting into natural order.\n int jump = length;\n boolean done;\n \n while( jump>1 ){\n jump /= 2;\n \n do {\n done = true;\n \n for( int j = 0; j<(length-jump); j++ ){\n int i = j + jump;\n \n if( !areCorrectlyOrdered( indices[j], indices[i] ) ){\n // Things are in the wrong order, swap them and step back.\n int tmp = indices[i];\n indices[i] = indices[j];\n indices[j] = tmp;\n done = false;\n }\n }\n } while( !done );\n }\n \n // TODO: integrate this with the stuff above.\n for( int i=1; i<length; i++ ){\n commonality[i] = commonLength( indices[i-1], indices[i] );\n }\n commonality[0] = -1;\n }","public void oldSort()\n\t{\n\t\tfor (int index = 0; index < arraySize; index++) {\n\t\t\tfor (int secondIndex = index + 1; secondIndex < arraySize; secondIndex++) {\n\t\t\t\tint temp = 0;\n\t\t\t\tif (array[index] > array[secondIndex]) {\n\t\t\t\t\ttemp = array[index];\n\t\t\t\t\tarray[index] = array[secondIndex];\n\t\t\t\t\tarray[secondIndex] = temp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t}","private static void sort(String[] a, int lo, int hi, int d) { \n if (hi <= lo + CUTOFF) {\n insertion(a, lo, hi, d);\n return;\n }\n int lt = lo;\n int gt = hi;\n int v = charAt(a[lo], d);\n int i = lo + 1;\n while (i <= gt) {\n int t = charAt(a[i], d);\n if (t < v) {\n \texch(a, lt++, i++);\n }\n else if (t > v) {\n \texch(a, i, gt--);\n }\n else {\n \ti++;\n }\n }\n //a[lo..lt-1] < v = a[lt..gt] < a[gt+1..hi]. \n sort(a, lo, lt-1, d);\n if (v >= 0) sort(a, lt, gt, d+1);\n sort(a, gt+1, hi, d);\n }","void sort();","void sort();","public void sort() {\r\n int k = start;\r\n for (int i = 0; i < size - 1; i++) {\r\n int p = (k + 1) % cir.length;\r\n for (int j = i + 1; j < size; j++) {\r\n if ((int) cir[p] < (int) cir[k % cir.length]) {\r\n Object temp = cir[k];\r\n cir[k] = cir[p];\r\n cir[p] = temp;\r\n }\r\n p = (p + 1) % cir.length;\r\n }\r\n k = (k + 1) % cir.length;\r\n }\r\n }","public void sortByWordLengthAsc() {\r\n\t\tcomparator = new WordLengthAsc();\r\n\t}","public String doSort();","public void sort() {\n\tqsort(a,0,a.length-1);\n }","public static <Key extends Comparable<Key> > void sort (Key [] a){\n int n=a.length;\n //rearrange the array to a max heap\n for (int k=n/2;k>=1;k--) sink(a,k,n);\n for ( int i=0;i<a.length;i++){\n exch(a,1,n--);\n sink(a,1,n);\n }\n\n }","public static List<String> sortDNA(List<String> unsortedSequences) {\n\t\tfor (int i = 0; i < unsortedSequences.size()-1; i++) {\n\t\t\tif (unsortedSequences.get(i).length()>unsortedSequences.get(i+1).length()) {\n\t\t\t\t\n\t\t\t\tString temp = unsortedSequences.get(i);\n\t\t\t\t\n\t\t\t\tunsortedSequences.set(i, unsortedSequences.get(i+1));\n\t\t\t\t\n\t\t\t\tunsortedSequences.set(i+1, temp);\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\t\n\t\treturn unsortedSequences;\n\t\t//return 0;\n\t}","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","public int Sort(){\n\tint nt ;\n\tint i ;\n\tint aux02 ;\n\tint aux04 ;\n\tint aux05 ;\n\tint aux06 ;\n\tint aux07 ;\n\tint j ;\n\tint t ;\n\ti = size - 1 ;\n\taux02 = 0 - 1 ;\n\twhile (aux02 < i) {\n\t j = 1 ;\n\t //aux03 = i+1 ;\n\t while (j < (i+1)){\n\t\taux07 = j - 1 ;\n\t\taux04 = number[aux07] ;\n\t\taux05 = number[j] ;\n\t\tif (aux05 < aux04) {\n\t\t aux06 = j - 1 ;\n\t\t t = number[aux06] ;\n\t\t number[aux06] = number[j] ;\n\t\t number[j] = t;\n\t\t}\n\t\telse nt = 0 ;\n\t\tj = j + 1 ;\n\t }\n\t i = i - 1 ;\n\t}\n\treturn 0 ;\n }","@Override\r\n\tpublic void sort() {\r\n\t\tint minpos;\r\n\t\tfor (int i = 0; i < elements.length-1; i++) {\r\n\t\t\tminpos=AuxMethods.minPos(elements, i);\r\n\t\t\telements=AuxMethods.swapElements(elements, i, minpos);\r\n\t\t\t\r\n\t\t}\r\n\t}","@SuppressWarnings({ \"unchecked\", \"rawtypes\" })\n\t@Override\n\tpublic void sort() {\n\t\t\n\t\t// create maxHeap\n\t\tHeap<E> maxHeap = new MaxHeap<E>(arr);\n\t\t\n\t\telapsedTime = System.nanoTime(); // get time of start\n\t\t\n\t\tfor (int i = length - 1; i > 0; i--) {\n\n\t\t\tmaxHeap.swap(arr, 0, i);\n\t\t\tmaxHeap.heapSize--;\n\t\t\t((MaxHeap) maxHeap).maxHeapify(arr, 0);\n\n\t\t}\n\t\t\n\t\telapsedTime = System.nanoTime() - elapsedTime; // get elapsed time\n\t\t\n\t\tprint(); // print sorted array\n\t\tprintElapsedTime(); // print elapsed time\n\t\t\n\t\t\n\t}","private static <T> void sort1(char x[], char[] a2, int off, int len) {\n\t\t// Insertion sort on smallest arrays\n\t\tif (len < 7) {\n\t\t\tfor (int i=off; i<len+off; i++)\n\t\t\t\tfor (int j=i; j>off && x[j-1]>x[j]; j--)\n\t\t\t\t\tswap(x,a2, j, j-1);\n\t\t\treturn;\n\t\t}\n\n\t\t// Choose a partition element, v\n\t\tint m = off + (len >> 1); // Small arrays, middle element\n\t\tif (len > 7) {\n\t\t\tint l = off;\n\t\t\tint n = off + len - 1;\n\t\t\tif (len > 40) { // Big arrays, pseudomedian of 9\n\t\t\t\tint s = len/8;\n\t\t\t\tl = med3(x, l, l+s, l+2*s);\n\t\t\t\tm = med3(x, m-s, m, m+s);\n\t\t\t\tn = med3(x, n-2*s, n-s, n);\n\t\t\t}\n\t\t\tm = med3(x, l, m, n); // Mid-size, med of 3\n\t\t}\n\t\tchar v = x[m];\n\n\t\t// Establish Invariant: v* (<v)* (>v)* v*\n\t\tint a = off, b = a, c = off + len - 1, d = c;\n\t\twhile(true) {\n\t\t\twhile (b <= c && x[b] <= v) {\n\t\t\t\tif (x[b] == v)\n\t\t\t\t\tswap(x,a2, a++, b);\n\t\t\t\tb++;\n\t\t\t}\n\t\t\twhile (c >= b && x[c] >= v) {\n\t\t\t\tif (x[c] == v)\n\t\t\t\t\tswap(x,a2, c, d--);\n\t\t\t\tc--;\n\t\t\t}\n\t\t\tif (b > c)\n\t\t\t\tbreak;\n\t\t\tswap(x,a2, b++, c--);\n\t\t}\n\n\t\t// Swap partition elements back to middle\n\t\tint s, n = off + len;\n\t\ts = Math.min(a-off, b-a ); vecswap(x, a2,off, b-s, s);\n\t\ts = Math.min(d-c, n-d-1); vecswap(x, a2,b, n-s, s);\n\n\t\t// Recursively sort non-partition-elements\n\t\tif ((s = b-a) > 1)\n\t\t\tsort1(x,a2, off, s);\n\t\tif ((s = d-c) > 1)\n\t\t\tsort1(x,a2, n-s, s);\n\t}","public void sort() {\n\t\tdivider(0, array.size() - 1);\n\t}","public void sort() {\n ListNode start = head;\n ListNode position1;\n ListNode position2;\n\n // Going through each element of the array from the second element to the end\n while (start.next != null) {\n start = start.next;\n position1 = start;\n position2 = position1.previous;\n // Checks if previous is null and keeps swapping elements backwards till there\n // is an element that is bigger than the original element\n while (position2 != null && (position1.data < position2.data)) {\n swap(position1, position2);\n numberComparisons++;\n position1 = position2;\n position2 = position1.previous;\n }\n }\n }","public static WordFrq[] sort(WordFrq b[]){\n WordFrq temp;\n int i=0;\n while (i < 3) {\n for (i = 1; i < 3; i++) {\n if (b[i-1].count > b[i].count) {\n temp = b[i];\n b[i] = b[i-1];\n b[i-1] = temp;\n break;\n }\n }\n }\n\n\n return b;\n\n\n\n\n\n }","@Override\n\tpublic T[] sort(T[] input) {\n\t\tfor(int i = 1; i < input.length; i++){\n\t\t\t//compare with the previous one, if smaller, switch with it.\n\t\t\tfor(int j = i; j > 0 && input[j-1].compareTo( input[j]) > 0; j--){\n\t\t\t\t//add the condition input[j-1] > input[j] in the for loop;\n\t\t\t\t//cause if j-1th < jth, j-2th < jth(left part is ordered)\n\t\t\t\tswap(input, j, j-1);\n\t\t\t}\n\t\t}\n\t\treturn input;\n\t}","static void sort(int[] a)\n {\n for ( int j = 1; j<a.length; j++)\n {\n int i = j - 1;\n while(i>=0 && a[i]>a[i+1])\n {\n int temp = a[i];\n a[i] = a[i+1];\n a[i+1] = temp;\n i--;\n }\n }\n }","public void sortByLength()\n {\n boolean swapMade;//has a swap been made in the most recent pass?\n \n //repeat looking for swaps\n do\n {\n swapMade=false;//just starting this pass, so no swap yet\n \n //go through entire array. looking for swaps that need to be done\n for(int i = 0; i<currentRide-1; i++)\n {\n //if the other RideLines has less people\n if(rides[i].getCurrentPeople()<rides[i+1].getCurrentPeople())\n {\n // standard swap, using a temporary. swap with less people\n RideLines temp = rides[i];\n rides[i]=rides[i+1];\n rides[i+1]=temp;\n \n swapMade=true;//remember this pass made at least one swap\n }\n \n } \n }while(swapMade);//until no swaps were found in the most recent past\n \n redrawLines();//redraw the image\n \n }","public static void main(String[] args) {\n\t\tScanner input = new Scanner(System.in);\n\t\tint k = input.nextInt();\n\t\tString s = input.next();\n\t\tString smallest = \" \";\n\t\tString largest = \" \";\n\t\tList<String> SubStringsOf_k_Length = new ArrayList<String>();\n\t\tfor(int i=0;(i+k)<=s.length();i++) {\n\t\t\tSubStringsOf_k_Length.add(s.substring(i,i+k));\n\t\t}\n//\t\tSystem.out.println(\"Before Sorting\");\n\t\tSystem.out.println(SubStringsOf_k_Length);\n\t\tSystem.out.println(SubStringsOf_k_Length.size());\n//\t\tCollections.sort(SubStringsOf_k_Length);\n//\t\tSystem.out.println(\"After Sorting\");\n//\t\tSystem.out.println(SubStringsOf_k_Length);\n\t\t\n//\t\tIterator itr = SubStringsOf_k_Length.iterator();\n//\t\t\n//\t\twhile(itr.hasNext()) {\n//\t\t\t\n//\t\t}\n\t\tString temp_largest = SubStringsOf_k_Length.get(0);\n\t\tString temp_smallest = SubStringsOf_k_Length.get(0);\n\t\tfor(int i=0;i<SubStringsOf_k_Length.size();i++) {\n\t\t\tif(temp_largest.compareTo(SubStringsOf_k_Length.get(i))>0 || temp_smallest.compareTo(SubStringsOf_k_Length.get(i))<0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tfor(int j=i+1;j<SubStringsOf_k_Length.size();j++) {\n\t\t\t\t\tif(SubStringsOf_k_Length.get(i).compareTo(SubStringsOf_k_Length.get(j))>0) {\n\t\t\t\t\t\tlargest = SubStringsOf_k_Length.get(i);\n\t\t\t\t\t\tsmallest=SubStringsOf_k_Length.get(j);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\t//smallest = SubStringsOf_k_Length.get(i);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttemp_largest = largest;\n\t\t\t\ttemp_smallest = smallest;\n\t\t\t\t\n\t\t\t}\t\n\t\t}\n\t\tSystem.out.println(largest);\n\t\tSystem.out.println(smallest);\n//\t\tfor(int i=1;i<subStrings_Of_k_Length.length;i++) {\n//\t\t\tSystem.out.println(subStrings_Of_k_Length[i-1]);\n//\t\t\tsmallest = subStrings_Of_k_Length[i-1];\n//\t\t\tif((subStrings_Of_k_Length[i].compareTo(smallest))<0) {\n//\t\t\t\tlargest = subStrings_Of_k_Length[i-1];\n//\t\t\t\tsmallest = subStrings_Of_k_Length[i];\n//\t\t\t}\n//\t\t}\n//\t\tSystem.out.println(\"Smallest:\" +smallest);\n//\t\tSystem.out.println(\"Largest:\" +largest);\n\t}","private static List<String> sort(String a)\n {\n String temp;\n List<String> list = new ArrayList<String>();\n for(int t = 0; t < a.length(); t++)\n {\n list.add(\"\"+a.charAt(t));\n }\n for(int i = 1; i < list.size(); i++)\n {\n for(int j = i ; j > 0; j--)\n {\n if(list.get(j).charAt(0) < list.get(j-1).charAt(0))\n {\n temp = list.get(j);\n list.set(j,list.get(j-1));\n list.set(j-1,temp);\n }\n \n }\n }\n return list;\n }"],"string":"[\n \"public void sort(){\\n for(int i = array.length-1;i >= 0;i--){\\n sink(i);\\n }\\n while(size > 0){\\n swap(0, size-1);\\n size -= 1;\\n sink(0);\\n }\\n }\",\n \"public static ArrayList<String> lineLengthSort(ArrayList<String> inArray)\\n\\t{\\n\\t\\tboolean hasSwapped = true;\\n\\t\\twhile (hasSwapped)\\n\\t\\t{\\n\\t\\t\\thasSwapped = false;\\n\\t\\t\\tfor(int i = 1; i < inArray.size(); i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(inArray.get(i - 1).length() > inArray.get(i).length())\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tString temp = inArray.get(i - 1);\\n\\t\\t\\t\\t\\tinArray.set(i - 1, inArray.get(i));\\n\\t\\t\\t\\t\\tinArray.set(i, temp);\\n\\t\\t\\t\\t\\thasSwapped = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn inArray;\\n\\t}\",\n \"public void sortByWordLengthDesc() {\\r\\n\\t\\tcomparator = new WordLengthDesc();\\r\\n\\t}\",\n \"private void sort()\\n {\\n // This implements Shell sort.\\n // Unfortunately we cannot use the sorting functions from the library\\n // (e.g. java.util.Arrays.sort), since the ones that work on int\\n // arrays do not accept a comparison function, but only allow\\n // sorting into natural order.\\n int jump = length;\\n boolean done;\\n \\n while( jump>1 ){\\n jump /= 2;\\n \\n do {\\n done = true;\\n \\n for( int j = 0; j<(length-jump); j++ ){\\n int i = j + jump;\\n \\n if( !areCorrectlyOrdered( indices[j], indices[i] ) ){\\n // Things are in the wrong order, swap them and step back.\\n int tmp = indices[i];\\n indices[i] = indices[j];\\n indices[j] = tmp;\\n done = false;\\n }\\n }\\n } while( !done );\\n }\\n \\n // TODO: integrate this with the stuff above.\\n for( int i=1; i<length; i++ ){\\n commonality[i] = commonLength( indices[i-1], indices[i] );\\n }\\n commonality[0] = -1;\\n }\",\n \"public void oldSort()\\n\\t{\\n\\t\\tfor (int index = 0; index < arraySize; index++) {\\n\\t\\t\\tfor (int secondIndex = index + 1; secondIndex < arraySize; secondIndex++) {\\n\\t\\t\\t\\tint temp = 0;\\n\\t\\t\\t\\tif (array[index] > array[secondIndex]) {\\n\\t\\t\\t\\t\\ttemp = array[index];\\n\\t\\t\\t\\t\\tarray[index] = array[secondIndex];\\n\\t\\t\\t\\t\\tarray[secondIndex] = temp;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"private static void sort(String[] a, int lo, int hi, int d) { \\n if (hi <= lo + CUTOFF) {\\n insertion(a, lo, hi, d);\\n return;\\n }\\n int lt = lo;\\n int gt = hi;\\n int v = charAt(a[lo], d);\\n int i = lo + 1;\\n while (i <= gt) {\\n int t = charAt(a[i], d);\\n if (t < v) {\\n \\texch(a, lt++, i++);\\n }\\n else if (t > v) {\\n \\texch(a, i, gt--);\\n }\\n else {\\n \\ti++;\\n }\\n }\\n //a[lo..lt-1] < v = a[lt..gt] < a[gt+1..hi]. \\n sort(a, lo, lt-1, d);\\n if (v >= 0) sort(a, lt, gt, d+1);\\n sort(a, gt+1, hi, d);\\n }\",\n \"void sort();\",\n \"void sort();\",\n \"public void sort() {\\r\\n int k = start;\\r\\n for (int i = 0; i < size - 1; i++) {\\r\\n int p = (k + 1) % cir.length;\\r\\n for (int j = i + 1; j < size; j++) {\\r\\n if ((int) cir[p] < (int) cir[k % cir.length]) {\\r\\n Object temp = cir[k];\\r\\n cir[k] = cir[p];\\r\\n cir[p] = temp;\\r\\n }\\r\\n p = (p + 1) % cir.length;\\r\\n }\\r\\n k = (k + 1) % cir.length;\\r\\n }\\r\\n }\",\n \"public void sortByWordLengthAsc() {\\r\\n\\t\\tcomparator = new WordLengthAsc();\\r\\n\\t}\",\n \"public String doSort();\",\n \"public void sort() {\\n\\tqsort(a,0,a.length-1);\\n }\",\n \"public static <Key extends Comparable<Key> > void sort (Key [] a){\\n int n=a.length;\\n //rearrange the array to a max heap\\n for (int k=n/2;k>=1;k--) sink(a,k,n);\\n for ( int i=0;i<a.length;i++){\\n exch(a,1,n--);\\n sink(a,1,n);\\n }\\n\\n }\",\n \"public static List<String> sortDNA(List<String> unsortedSequences) {\\n\\t\\tfor (int i = 0; i < unsortedSequences.size()-1; i++) {\\n\\t\\t\\tif (unsortedSequences.get(i).length()>unsortedSequences.get(i+1).length()) {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tString temp = unsortedSequences.get(i);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tunsortedSequences.set(i, unsortedSequences.get(i+1));\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tunsortedSequences.set(i+1, temp);\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\treturn unsortedSequences;\\n\\t\\t//return 0;\\n\\t}\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"public int Sort(){\\n\\tint nt ;\\n\\tint i ;\\n\\tint aux02 ;\\n\\tint aux04 ;\\n\\tint aux05 ;\\n\\tint aux06 ;\\n\\tint aux07 ;\\n\\tint j ;\\n\\tint t ;\\n\\ti = size - 1 ;\\n\\taux02 = 0 - 1 ;\\n\\twhile (aux02 < i) {\\n\\t j = 1 ;\\n\\t //aux03 = i+1 ;\\n\\t while (j < (i+1)){\\n\\t\\taux07 = j - 1 ;\\n\\t\\taux04 = number[aux07] ;\\n\\t\\taux05 = number[j] ;\\n\\t\\tif (aux05 < aux04) {\\n\\t\\t aux06 = j - 1 ;\\n\\t\\t t = number[aux06] ;\\n\\t\\t number[aux06] = number[j] ;\\n\\t\\t number[j] = t;\\n\\t\\t}\\n\\t\\telse nt = 0 ;\\n\\t\\tj = j + 1 ;\\n\\t }\\n\\t i = i - 1 ;\\n\\t}\\n\\treturn 0 ;\\n }\",\n \"@Override\\r\\n\\tpublic void sort() {\\r\\n\\t\\tint minpos;\\r\\n\\t\\tfor (int i = 0; i < elements.length-1; i++) {\\r\\n\\t\\t\\tminpos=AuxMethods.minPos(elements, i);\\r\\n\\t\\t\\telements=AuxMethods.swapElements(elements, i, minpos);\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t}\",\n \"@SuppressWarnings({ \\\"unchecked\\\", \\\"rawtypes\\\" })\\n\\t@Override\\n\\tpublic void sort() {\\n\\t\\t\\n\\t\\t// create maxHeap\\n\\t\\tHeap<E> maxHeap = new MaxHeap<E>(arr);\\n\\t\\t\\n\\t\\telapsedTime = System.nanoTime(); // get time of start\\n\\t\\t\\n\\t\\tfor (int i = length - 1; i > 0; i--) {\\n\\n\\t\\t\\tmaxHeap.swap(arr, 0, i);\\n\\t\\t\\tmaxHeap.heapSize--;\\n\\t\\t\\t((MaxHeap) maxHeap).maxHeapify(arr, 0);\\n\\n\\t\\t}\\n\\t\\t\\n\\t\\telapsedTime = System.nanoTime() - elapsedTime; // get elapsed time\\n\\t\\t\\n\\t\\tprint(); // print sorted array\\n\\t\\tprintElapsedTime(); // print elapsed time\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"private static <T> void sort1(char x[], char[] a2, int off, int len) {\\n\\t\\t// Insertion sort on smallest arrays\\n\\t\\tif (len < 7) {\\n\\t\\t\\tfor (int i=off; i<len+off; i++)\\n\\t\\t\\t\\tfor (int j=i; j>off && x[j-1]>x[j]; j--)\\n\\t\\t\\t\\t\\tswap(x,a2, j, j-1);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\t// Choose a partition element, v\\n\\t\\tint m = off + (len >> 1); // Small arrays, middle element\\n\\t\\tif (len > 7) {\\n\\t\\t\\tint l = off;\\n\\t\\t\\tint n = off + len - 1;\\n\\t\\t\\tif (len > 40) { // Big arrays, pseudomedian of 9\\n\\t\\t\\t\\tint s = len/8;\\n\\t\\t\\t\\tl = med3(x, l, l+s, l+2*s);\\n\\t\\t\\t\\tm = med3(x, m-s, m, m+s);\\n\\t\\t\\t\\tn = med3(x, n-2*s, n-s, n);\\n\\t\\t\\t}\\n\\t\\t\\tm = med3(x, l, m, n); // Mid-size, med of 3\\n\\t\\t}\\n\\t\\tchar v = x[m];\\n\\n\\t\\t// Establish Invariant: v* (<v)* (>v)* v*\\n\\t\\tint a = off, b = a, c = off + len - 1, d = c;\\n\\t\\twhile(true) {\\n\\t\\t\\twhile (b <= c && x[b] <= v) {\\n\\t\\t\\t\\tif (x[b] == v)\\n\\t\\t\\t\\t\\tswap(x,a2, a++, b);\\n\\t\\t\\t\\tb++;\\n\\t\\t\\t}\\n\\t\\t\\twhile (c >= b && x[c] >= v) {\\n\\t\\t\\t\\tif (x[c] == v)\\n\\t\\t\\t\\t\\tswap(x,a2, c, d--);\\n\\t\\t\\t\\tc--;\\n\\t\\t\\t}\\n\\t\\t\\tif (b > c)\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tswap(x,a2, b++, c--);\\n\\t\\t}\\n\\n\\t\\t// Swap partition elements back to middle\\n\\t\\tint s, n = off + len;\\n\\t\\ts = Math.min(a-off, b-a ); vecswap(x, a2,off, b-s, s);\\n\\t\\ts = Math.min(d-c, n-d-1); vecswap(x, a2,b, n-s, s);\\n\\n\\t\\t// Recursively sort non-partition-elements\\n\\t\\tif ((s = b-a) > 1)\\n\\t\\t\\tsort1(x,a2, off, s);\\n\\t\\tif ((s = d-c) > 1)\\n\\t\\t\\tsort1(x,a2, n-s, s);\\n\\t}\",\n \"public void sort() {\\n\\t\\tdivider(0, array.size() - 1);\\n\\t}\",\n \"public void sort() {\\n ListNode start = head;\\n ListNode position1;\\n ListNode position2;\\n\\n // Going through each element of the array from the second element to the end\\n while (start.next != null) {\\n start = start.next;\\n position1 = start;\\n position2 = position1.previous;\\n // Checks if previous is null and keeps swapping elements backwards till there\\n // is an element that is bigger than the original element\\n while (position2 != null && (position1.data < position2.data)) {\\n swap(position1, position2);\\n numberComparisons++;\\n position1 = position2;\\n position2 = position1.previous;\\n }\\n }\\n }\",\n \"public static WordFrq[] sort(WordFrq b[]){\\n WordFrq temp;\\n int i=0;\\n while (i < 3) {\\n for (i = 1; i < 3; i++) {\\n if (b[i-1].count > b[i].count) {\\n temp = b[i];\\n b[i] = b[i-1];\\n b[i-1] = temp;\\n break;\\n }\\n }\\n }\\n\\n\\n return b;\\n\\n\\n\\n\\n\\n }\",\n \"@Override\\n\\tpublic T[] sort(T[] input) {\\n\\t\\tfor(int i = 1; i < input.length; i++){\\n\\t\\t\\t//compare with the previous one, if smaller, switch with it.\\n\\t\\t\\tfor(int j = i; j > 0 && input[j-1].compareTo( input[j]) > 0; j--){\\n\\t\\t\\t\\t//add the condition input[j-1] > input[j] in the for loop;\\n\\t\\t\\t\\t//cause if j-1th < jth, j-2th < jth(left part is ordered)\\n\\t\\t\\t\\tswap(input, j, j-1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn input;\\n\\t}\",\n \"static void sort(int[] a)\\n {\\n for ( int j = 1; j<a.length; j++)\\n {\\n int i = j - 1;\\n while(i>=0 && a[i]>a[i+1])\\n {\\n int temp = a[i];\\n a[i] = a[i+1];\\n a[i+1] = temp;\\n i--;\\n }\\n }\\n }\",\n \"public void sortByLength()\\n {\\n boolean swapMade;//has a swap been made in the most recent pass?\\n \\n //repeat looking for swaps\\n do\\n {\\n swapMade=false;//just starting this pass, so no swap yet\\n \\n //go through entire array. looking for swaps that need to be done\\n for(int i = 0; i<currentRide-1; i++)\\n {\\n //if the other RideLines has less people\\n if(rides[i].getCurrentPeople()<rides[i+1].getCurrentPeople())\\n {\\n // standard swap, using a temporary. swap with less people\\n RideLines temp = rides[i];\\n rides[i]=rides[i+1];\\n rides[i+1]=temp;\\n \\n swapMade=true;//remember this pass made at least one swap\\n }\\n \\n } \\n }while(swapMade);//until no swaps were found in the most recent past\\n \\n redrawLines();//redraw the image\\n \\n }\",\n \"public static void main(String[] args) {\\n\\t\\tScanner input = new Scanner(System.in);\\n\\t\\tint k = input.nextInt();\\n\\t\\tString s = input.next();\\n\\t\\tString smallest = \\\" \\\";\\n\\t\\tString largest = \\\" \\\";\\n\\t\\tList<String> SubStringsOf_k_Length = new ArrayList<String>();\\n\\t\\tfor(int i=0;(i+k)<=s.length();i++) {\\n\\t\\t\\tSubStringsOf_k_Length.add(s.substring(i,i+k));\\n\\t\\t}\\n//\\t\\tSystem.out.println(\\\"Before Sorting\\\");\\n\\t\\tSystem.out.println(SubStringsOf_k_Length);\\n\\t\\tSystem.out.println(SubStringsOf_k_Length.size());\\n//\\t\\tCollections.sort(SubStringsOf_k_Length);\\n//\\t\\tSystem.out.println(\\\"After Sorting\\\");\\n//\\t\\tSystem.out.println(SubStringsOf_k_Length);\\n\\t\\t\\n//\\t\\tIterator itr = SubStringsOf_k_Length.iterator();\\n//\\t\\t\\n//\\t\\twhile(itr.hasNext()) {\\n//\\t\\t\\t\\n//\\t\\t}\\n\\t\\tString temp_largest = SubStringsOf_k_Length.get(0);\\n\\t\\tString temp_smallest = SubStringsOf_k_Length.get(0);\\n\\t\\tfor(int i=0;i<SubStringsOf_k_Length.size();i++) {\\n\\t\\t\\tif(temp_largest.compareTo(SubStringsOf_k_Length.get(i))>0 || temp_smallest.compareTo(SubStringsOf_k_Length.get(i))<0) {\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tfor(int j=i+1;j<SubStringsOf_k_Length.size();j++) {\\n\\t\\t\\t\\t\\tif(SubStringsOf_k_Length.get(i).compareTo(SubStringsOf_k_Length.get(j))>0) {\\n\\t\\t\\t\\t\\t\\tlargest = SubStringsOf_k_Length.get(i);\\n\\t\\t\\t\\t\\t\\tsmallest=SubStringsOf_k_Length.get(j);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t//smallest = SubStringsOf_k_Length.get(i);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttemp_largest = largest;\\n\\t\\t\\t\\ttemp_smallest = smallest;\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\t\\n\\t\\t}\\n\\t\\tSystem.out.println(largest);\\n\\t\\tSystem.out.println(smallest);\\n//\\t\\tfor(int i=1;i<subStrings_Of_k_Length.length;i++) {\\n//\\t\\t\\tSystem.out.println(subStrings_Of_k_Length[i-1]);\\n//\\t\\t\\tsmallest = subStrings_Of_k_Length[i-1];\\n//\\t\\t\\tif((subStrings_Of_k_Length[i].compareTo(smallest))<0) {\\n//\\t\\t\\t\\tlargest = subStrings_Of_k_Length[i-1];\\n//\\t\\t\\t\\tsmallest = subStrings_Of_k_Length[i];\\n//\\t\\t\\t}\\n//\\t\\t}\\n//\\t\\tSystem.out.println(\\\"Smallest:\\\" +smallest);\\n//\\t\\tSystem.out.println(\\\"Largest:\\\" +largest);\\n\\t}\",\n \"private static List<String> sort(String a)\\n {\\n String temp;\\n List<String> list = new ArrayList<String>();\\n for(int t = 0; t < a.length(); t++)\\n {\\n list.add(\\\"\\\"+a.charAt(t));\\n }\\n for(int i = 1; i < list.size(); i++)\\n {\\n for(int j = i ; j > 0; j--)\\n {\\n if(list.get(j).charAt(0) < list.get(j-1).charAt(0))\\n {\\n temp = list.get(j);\\n list.set(j,list.get(j-1));\\n list.set(j-1,temp);\\n }\\n \\n }\\n }\\n return list;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6709117","0.66611093","0.66513926","0.6611596","0.65257436","0.6493754","0.6491357","0.6491357","0.6490662","0.64609885","0.64414567","0.64180756","0.6372272","0.6300941","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6286009","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6285722","0.6234266","0.6225888","0.6211854","0.620978","0.61882836","0.6156285","0.61403954","0.6138353","0.6129032","0.61288995","0.61248106"],"string":"[\n \"0.6709117\",\n \"0.66611093\",\n \"0.66513926\",\n \"0.6611596\",\n \"0.65257436\",\n \"0.6493754\",\n \"0.6491357\",\n \"0.6491357\",\n \"0.6490662\",\n \"0.64609885\",\n \"0.64414567\",\n \"0.64180756\",\n \"0.6372272\",\n \"0.6300941\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6286009\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6285722\",\n \"0.6234266\",\n \"0.6225888\",\n \"0.6211854\",\n \"0.620978\",\n \"0.61882836\",\n \"0.6156285\",\n \"0.61403954\",\n \"0.6138353\",\n \"0.6129032\",\n \"0.61288995\",\n \"0.61248106\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":29394,"cells":{"query":{"kind":"string","value":"Find by unique key"},"document":{"kind":"string","value":"public CurrencyXRateProvider findByCode(String code) {\n\t\treturn (CurrencyXRateProvider) this\n\t\t\t\t.getEntityManager()\n\t\t\t\t.createNamedQuery(CurrencyXRateProvider.NQ_FIND_BY_CODE)\n\t\t\t\t.setParameter(\"clientId\",\n\t\t\t\t\t\tSession.user.get().getClient().getId())\n\t\t\t\t.setParameter(\"code\", code).getSingleResult();\n\t}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["public Entry find(Object key) {\r\n Entry entry_with_key = new Entry();\r\n entry_with_key.key = key; \r\n int comp_hash = compFunction(entry_with_key.key.hashCode());\r\n if (hash_table[comp_hash] == null) {\r\n return null;\r\n } else {\r\n DList searching = hash_table[comp_hash];\r\n for(Object entry: searching){\r\n if(((Entry) entry).key().equals(key)){\r\n return (Entry) entry;\r\n }\r\n }\r\n return null;\r\n \r\n }\r\n\r\n\r\n }","public V search(K key);","private Node<Pair<K, V>> findItem(K key) {\n Node<Pair<K, V>> result = null;\n\n int hash1 = hash1(key);\n\n if (table[hash1] != null) {\n Node<Pair<K, V>> node = search(table[hash1].list, key);\n\n if (node != null) {\n result = node;\n }\n }\n\n int hash2 = hash2(key);\n\n if (table[hash2] != null && result == null) {\n Node<Pair<K, V>> node = search(table[hash2].list, key);\n\n if (node != null) {\n result = node;\n }\n }\n\n return result;\n }","String search(int key);","public DataItem find(int key){\n\t\tint hashVal = hashFunc(key);\n\t\tint stepSize = hashFunc2(key);\n\t\twhile(hashArray[hashVal] != null){\n\t\t\tif(hashArray[hashVal].getKey() == key){\n\t\t\t\tDataItem temp = hashArray[hashVal]; //find the item\n\t\t\t\treturn temp;\n\t\t\t}\n\t\t\thashVal += stepSize;\n\t\t\thashVal %= arraySize;\n\t\t}\n\t\treturn null;\n\t}","Online selectByPrimaryKey(String hash);","boolean containsKey(long key);","public Entry find(Object key) {\n int i = compFunction(key.hashCode());\n SList chain = buckets[i];\n try {\n for (SListNode n = (SListNode) chain.front(); n.isValidNode(); n = (SListNode) n.next()) {\n Entry e = (Entry) n.item();\n if (e.key.equals(key)) {\n return e;\n }\n }\n } catch(InvalidNodeException e) {\n System.out.println(e);\n }\n return null;\n }","public KeyedItem retrieve(Comparable searchKey);","@Nullable IStrongSlot find(LuaValue key);","private int locate(Key key) {\n\t\tint index = hash(key);\n\t\twhile(this.keys[index] != null && !this.keys[index].equals(key)) {\n\t\t\tindex = increment(index);\n\t\t}\n\t\treturn index;\n\t}","boolean exists(Integer key);","public Entry<K, V> find(K key) {\r\n try {\r\n int hash = key.hashCode();\r\n ListNode<Entry<K, V>> node = table[compFunction(hash)].front();\r\n if (node.isValidNode()) {\r\n return (Entry<K, V>) node.getItem();\r\n }\r\n } catch (Exception e) {\r\n System.out.println(\"Unhashable key: \" + e);\r\n }\r\n return null;\r\n }","public T retrieveByKey(S key) throws SQLException;","public boolean contains(Key key);","public abstract boolean lookup(Key key);","public boolean containsKey(Key key) ;","@Override\n public Message findOne(Integer key) throws SQLException {\n //Ei toteutettu\n return null;\n }","public E find(K key){\n\t\tE output= null;\n\t\t\n\t\tint i = 0;\n\t\twhile (i<keys.length && output == null){\n\t\t\tif(keys[i] != null && keys[i].equals(key))\n\t\t\t\toutput = elem[i];\n\t\t\ti = i + 1;\n\t\t}\n\t\treturn output;\n\t}","private Node _locate(Object key){\n\t\tint hashCode = key.hashCode();\r\n\t\tint bucketNum = hashCode % _numBuckets;\r\n\t\treturn _locate(key, bucketNum);\r\n\t}","private boolean isIdExists(SQLiteDatabase db, String tableName, String firstColumnName, Object key) {\n boolean ret = false;\n String query = new StringBuilder(\"SELECT \")\n .append(firstColumnName)\n .append(\" FROM \")\n .append(tableName)\n .append(\" WHERE \")\n .append(firstColumnName)\n .append(\" = \")\n .append(key)\n .append(\";\")\n .toString();\n JSArray resQuery = this.selectSQL(db, query, new ArrayList<String>());\n if (resQuery.length() == 1) ret = true;\n return ret;\n }","@Override\n\tpublic User findByKey(Integer id) {\n\t\treturn null;\n\t}","public Object findRecord(Object key) \n\t{\n\t check(\"find\", key);\n \n\t Object record = htRecords.get(key);\n\t if ( record != null )\n\t {\n\t\t //--- Return a copy of the record\n\t return copy ( record );\n\t }\n\t else\n\t {\n\t return null ;\n\t }\n\t}","int find(K key)\n {\n return Math.abs(key.hashCode() % this.buckets.length);\n }","@Override\r\n public Object findElement(Object key) {\r\n\r\n // Search for node possibly containing key\r\n TFNode node = search(root(), key);\r\n \r\n // Note the index of where the key should be\r\n int index = FFGTE(node, key);\r\n\r\n // If the index is greater than the number of items in the node, the key is not in the node\r\n if (index < node.getNumItems()) {\r\n // Look for key in node\r\n if (treeComp.isEqual(node.getItem(index).key(), key)) {\r\n return node.getItem(index);\r\n }\r\n }\r\n\r\n // The search hit a leaf without finding the key\r\n return null;\r\n }","UrlMap findByKey(String key);","public String find(String key) {\n\t\t\n\t\tsearchProbe = 0;\n\t\tint h = hash(key);\n\t\twhile(table[h]!=null) {\n\t\t\t\n\t\t\tif(table[h].toString().substring(0, 19).equals(key)) {\n\t\t\t\treturn table[h].toString();\n\t\t\t}\n\t\t\tsearchProbe++;\n\t\t\th=(h+1)%getTablesize();\n\t\t}\n\t\t\n\t\t\n\treturn \"Not Found\";\n\t}","public int getIndexOf(K key);","V get(UniqueId uniqueId);","private HashGroupifyEntry findEntry(final int row, final int index, final int keyHash) {\n HashGroupifyEntry m = hashTableBuckets[index];\n while ((m != null) && ((m.hashcode != keyHash) || !dataOutput.equals(row, m.row))) {\n m = m.next;\n }\n return m;\n }","Object getKey();","private Node find(String key) {\n Node now = head;\n while (now != null) {\n if (now.pairStringString.getKey().equals(key)) {\n return now;\n }\n now = now.next;\n }\n return null;\n }","public Entry find(Object key) {\n int hashCode = key.hashCode();\n int index = compFunction(hashCode);\n\n if(defTable[index].isEmpty()) {\n return null;\n }\n\n Entry entry = new Entry();\n ListNode current = defTable[index].front();\n\n try{\n while(true) {\n if(((Entry) current.item()).key().equals(key)) {\n entry.key = key;\n entry.value = ((Entry) current.item()).value();\n return entry;\n }\n if(current==defTable[index].back()) {\n break;\n }\n current = current.next();\n }\n } catch(Exception err) {\n System.out.println(err);\n }\n return null;\n }","public int find(K key){\r\n int k =0;\r\n int ik;\r\n while(true){\r\n ik = getIndex(k,key);\r\n if(hashTable[ik] == null || hashTable[ik].equals(key))\r\n return ik;\r\n else if(hashTable[ik].isDeleted){ // deleted\r\n break;\r\n }else{\r\n k++;\r\n }\r\n }\r\n int xspot = ik;\r\n while(true){\r\n k++;\r\n if(hashTable[ik]!=null && hashTable[ik].equals(key)){\r\n return ik;\r\n }\r\n if(hashTable[ik] == null){\r\n return xspot;\r\n }\r\n }\r\n }","Option<AcHost> findByKey(String key) throws Throwable;","Collection getUniqueKeysInGroup(Object groupID) throws Exception;","private Node<Pair<K, V>> search(\n BiDirectionalNullTerminatedTailedLinkedList<Pair<K, V>> list,\n K key) {\n\n for (Node<Pair<K, V>> i = list.getHead().getNext(); i != list.getTail();\n i = i.getNext()) {\n if (i.getData().key.equals(key)) {\n return i;\n }\n }\n\n return null;\n }","E findById(K id);","boolean hasKey(String collection, String hkey);","public int Search(int key)\n {\n for(int i=0; i<n; i++)\n {\n if(a[i]==key)\n return 1;\n }\n return 0;\n }","public boolean existsKey(String inKey);","public RBNode<T, E> searchAndRetrieve(T key) {\r\n\t\tRBNode<T, E> c = root;\r\n\t\tRBNode<T, E> p = nillLeaf;\r\n\t\twhile (c != nillLeaf) {\r\n\t\t\t// if when comparing if it hasnt found the key go to the left\r\n\t\t\tif (key.compareTo(c.uniqueKey) < 0) {\r\n\t\t\t\tp = c;\r\n\t\t\t\tc = c.leftChild;\r\n\t\t\t}\r\n\t\t\t// if when comparing if it hasnt found the key go to the right\r\n\t\t\telse if (key.compareTo(c.uniqueKey) > 0) {\r\n\t\t\t\tp = c;\r\n\t\t\t\tc = c.rightChild;\r\n\t\t\t}\r\n\t\t\t// they are equal\r\n\t\t\telse {\r\n\t\t\t\tp = c;\r\n\t\t\t\tc = c.leftChild;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn p;\r\n\t}","public V lookup(K key);","String getLookupKey();","String getKey(int index);","int getKey(int i);","T get(final UniqueId uniqueId) {\n _readLock.lock();\n try {\n return _uniqueIdMap.get(uniqueId);\n } finally {\n _readLock.unlock();\n }\n }","Storage selectByPrimaryKey(StorageKey key);","K findKeyForValue(V val);","@Override\r\n\tpublic CommonParamDomain findByKey(CommonParamDomain t) {\n\t\treturn getPersistanceManager().load(getNamespace() + \".findByKey\", t);\r\n\t}","T find(String collection, String hkey, Class<T> tclass);","E find(KeyType key) {\n int position = findPosKey(key);\n if (mArray[position].state == FHhashQP.ACTIVE) {\n return mArray[findPosKey(key)].data;\n } else {\n throw new NoSuchElementException();\n }\n }","public Record find(String key) {\n\t\tint hash = toHashKey(key);\n\t\tint baseValue = (baseHash(hash,length))% length;\n\t\tif (Table[baseValue].hash == -1){ //If slot is empty\n\t\t\treturn null;\n\t\t}\n\t\telse if (Table[baseValue].key.equals(key)){ //if the slot is the key we are looking for\n\t\t\treturn Table[baseValue];\n\t\t}\n\t\telse {\n\t\t\tint step = (stepHash(hash,length)); //checks first slot after base\n\t\t\tint current = (baseValue + step)% length; //checks first slot after base\n\t\t\twhile (current != baseValue){ //cycle through table until reaching first value again\n\t\t\t\tif (Table[current].hash == -1){//If slot is empty\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\t\t\t\telse if (Table[current].key.equals(key)){ //if the slot is the key we are looking for\n\t\t\t\t\treturn Table[current];\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcurrent = (current + step) % length; //Cycle through table without going over the newlength\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn null;\n\t}","Key getPrimaryKey();","public abstract boolean containsKey(K key);","private Document findInCache(String userId) {\n\t\tString key;\n\t\tSet<String> keys = cache.keySet();\n\t\tIterator<String> itr = keys.iterator();\n\t\twhile (itr.hasNext()) {\n\t\t\tkey = itr.next();\n\t\t\tDocument data = cache.get(key);\n\t\t\t// check if email in profile object is same as input userId\n\t\t\tString email = \"\";\n\t\t\ttry {\n\t\t\t\temail = DOMUtil.value(data, Profile.xpathMap.get(\"email\"), Profile.nameSpaceCtx);\n\t\t\t} catch (XMLException e) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t// cache hit\n\t\t\tif (StringUtil.equalsIgnoreCase(email, userId)) {\n\t\t\t\treturn data;\n\t\t\t}\n\t\t}\n\t\t// Cache miss\n\t\treturn null;\n\t}","public T search(K key) {\n\t\tfor (T item : list) {\n\t\t\tif (item.matches(key)) {\n\t\t\t\treturn item;\n\t\t\t}\n\t\t}\n\t\treturn null;\n\t}","public E findById(Serializable pk) ;","abstract public String getKey();","@Override\n public int find(int p) {\n while (p != id[p]) { p = id[p]; }\n return p;\n }","public boolean containsId(String key, Long userId) {\n if(index.containsKey(key)) {\n return index.get(key).contains(userId);\n }\n return false;\n }","public boolean contains(K key);","java.lang.String getKey();","java.lang.String getKey();","java.lang.String getKey();","java.lang.String getKey();","java.lang.String getKey();","java.lang.String getKey();","MongoDBEntry<K, V> get(byte[] key);","private ImmutablePair<byte[], byte[]> getFuzzyKeyFor(MDSKey key) {\n byte[] keyBytes = key.getKey();\n // byte array is automatically initialized to 0, which implies fixed match in fuzzy info\n // the row key after targetId doesn't need to be a match.\n // Workaround for HBASE-15676, need to have at least one 1 in the fuzzy filter\n byte[] infoBytes = new byte[keyBytes.length + 1];\n infoBytes[infoBytes.length - 1] = 1;\n\n // the key array size and mask array size has to be equal so increase the size by 1\n return new ImmutablePair<>(Bytes.concat(keyBytes, new byte[1]), infoBytes);\n }","private CAUEntry findElementWithTID(CAUList ulist, int tid){\n\t\tList<CAUEntry> list = ulist.CAUEntries;\n\t\t\n\t\t// perform a binary search to check if the subset appears in level k-1.\n int first = 0;\n int last = list.size() - 1;\n \n // the binary search\n while( first <= last )\n {\n \tint middle = ( first + last ) >>> 1; // divide by 2\n\n if(list.get(middle).tid < tid){\n \tfirst = middle + 1; // the itemset compared is larger than the subset according to the lexical order\n }\n else if(list.get(middle).tid > tid){\n \tlast = middle - 1; // the itemset compared is smaller than the subset is smaller according to the lexical order\n }\n else{\n \treturn list.get(middle);\n }\n }\n\t\treturn null;\n\t}","public void test_findUniqueByProperty() {\r\n\t\tPerson person = (Person) this.persistenceService.findUniqueByProperty(Person.class, NAME_PROPERTY, NAME_PARAM[2]);\r\n\t\tassertForFindUniquePerson(person);\r\n\t}","private BTNode search(BTNode btNode, DataPair key) {\n int i =0;\n while (i < btNode.mCurrentKeyNum && key.compareTo(btNode.mKeys[i]) > 0)\n i++;\n\n if (i < btNode.mCurrentKeyNum && key.compareTo(btNode.mKeys[i])==0)\n return btNode;//btNode.mKeys[i];\n if (btNode.mIsLeaf)\n return null;\n return search(btNode.mChildren[i],key);\n }","Kaiwa selectByPrimaryKey(String maht);","String getKey();","String getKey();","String getKey();","String getKey();","String getKey();","String getKey();","String getKey();","String getKey();","String getKey();","String getKey();","String getKey();","String getKey();","String getKey();","private Node findKey(String key){\n Node N = front;\n while(N != null){\n if(N.key.equals(key)){\n return N; \n }\n else{\n N = N.next; \n }\n }\n return null;\n }","boolean has(String key);","public int search (int[] db, int skey)\n { \n for (int i = 0; i < db.length; i++)\n { \n if (skey == db[i])\n {\n return i;\n }\n }\n return -1;\n }","@Override\r\n\tpublic boolean exists(T key) {\r\n\t\treturn existsRec(raiz, key);\r\n\t}","private ListNode find(K key) {\r\n\t\t\tif (key == null) throw new NullPointerException();\r\n\t\t\tListNode current = header;\r\n\t\t\twhile (current != null) {\r\n\t\t\t\tif (current.key.equals(key)) return current;\r\n\t\t\t\tcurrent = current.next;\r\n\t\t\t}\r\n\t\t\treturn null;\r\n\t\t}","public String findUserData(String login, String key);","String getKey(Object entity);","public V find (K key) throws KeyNotFoundException {\n\t\treturn findKey(root, key);\n\t}","T key();","@Override\n public boolean containsKey(Object key) {\n LinkedList<Entry> tempBucket = chooseBucket(key);\n \n for(int i=0;i<tempBucket.size();i++) {\n \t\tEntry tempEntry = tempBucket.get(i);\n \t\t\n \t\tif(tempEntry.getKey() == key) {\n \t\t\treturn true;\n \t\t}\n \t}\n \n return false;\n }","boolean containsKey(K key);","boolean containsKey(K key);","public Object get(Object key) {\n\t\tint index = key.hashCode() % SLOTS;\n\t\t// check if key is already present in that slot/bucket.\n\t\tfor(Pair p:table[index]) {\n\t\t\tif(key.equals(p.key))\n\t\t\t\treturn p.value;\n\t\t}\n\t\t// if not found, return null\n\t\treturn null;\n\t}","public boolean contains(String key);"],"string":"[\n \"public Entry find(Object key) {\\r\\n Entry entry_with_key = new Entry();\\r\\n entry_with_key.key = key; \\r\\n int comp_hash = compFunction(entry_with_key.key.hashCode());\\r\\n if (hash_table[comp_hash] == null) {\\r\\n return null;\\r\\n } else {\\r\\n DList searching = hash_table[comp_hash];\\r\\n for(Object entry: searching){\\r\\n if(((Entry) entry).key().equals(key)){\\r\\n return (Entry) entry;\\r\\n }\\r\\n }\\r\\n return null;\\r\\n \\r\\n }\\r\\n\\r\\n\\r\\n }\",\n \"public V search(K key);\",\n \"private Node<Pair<K, V>> findItem(K key) {\\n Node<Pair<K, V>> result = null;\\n\\n int hash1 = hash1(key);\\n\\n if (table[hash1] != null) {\\n Node<Pair<K, V>> node = search(table[hash1].list, key);\\n\\n if (node != null) {\\n result = node;\\n }\\n }\\n\\n int hash2 = hash2(key);\\n\\n if (table[hash2] != null && result == null) {\\n Node<Pair<K, V>> node = search(table[hash2].list, key);\\n\\n if (node != null) {\\n result = node;\\n }\\n }\\n\\n return result;\\n }\",\n \"String search(int key);\",\n \"public DataItem find(int key){\\n\\t\\tint hashVal = hashFunc(key);\\n\\t\\tint stepSize = hashFunc2(key);\\n\\t\\twhile(hashArray[hashVal] != null){\\n\\t\\t\\tif(hashArray[hashVal].getKey() == key){\\n\\t\\t\\t\\tDataItem temp = hashArray[hashVal]; //find the item\\n\\t\\t\\t\\treturn temp;\\n\\t\\t\\t}\\n\\t\\t\\thashVal += stepSize;\\n\\t\\t\\thashVal %= arraySize;\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"Online selectByPrimaryKey(String hash);\",\n \"boolean containsKey(long key);\",\n \"public Entry find(Object key) {\\n int i = compFunction(key.hashCode());\\n SList chain = buckets[i];\\n try {\\n for (SListNode n = (SListNode) chain.front(); n.isValidNode(); n = (SListNode) n.next()) {\\n Entry e = (Entry) n.item();\\n if (e.key.equals(key)) {\\n return e;\\n }\\n }\\n } catch(InvalidNodeException e) {\\n System.out.println(e);\\n }\\n return null;\\n }\",\n \"public KeyedItem retrieve(Comparable searchKey);\",\n \"@Nullable IStrongSlot find(LuaValue key);\",\n \"private int locate(Key key) {\\n\\t\\tint index = hash(key);\\n\\t\\twhile(this.keys[index] != null && !this.keys[index].equals(key)) {\\n\\t\\t\\tindex = increment(index);\\n\\t\\t}\\n\\t\\treturn index;\\n\\t}\",\n \"boolean exists(Integer key);\",\n \"public Entry<K, V> find(K key) {\\r\\n try {\\r\\n int hash = key.hashCode();\\r\\n ListNode<Entry<K, V>> node = table[compFunction(hash)].front();\\r\\n if (node.isValidNode()) {\\r\\n return (Entry<K, V>) node.getItem();\\r\\n }\\r\\n } catch (Exception e) {\\r\\n System.out.println(\\\"Unhashable key: \\\" + e);\\r\\n }\\r\\n return null;\\r\\n }\",\n \"public T retrieveByKey(S key) throws SQLException;\",\n \"public boolean contains(Key key);\",\n \"public abstract boolean lookup(Key key);\",\n \"public boolean containsKey(Key key) ;\",\n \"@Override\\n public Message findOne(Integer key) throws SQLException {\\n //Ei toteutettu\\n return null;\\n }\",\n \"public E find(K key){\\n\\t\\tE output= null;\\n\\t\\t\\n\\t\\tint i = 0;\\n\\t\\twhile (i<keys.length && output == null){\\n\\t\\t\\tif(keys[i] != null && keys[i].equals(key))\\n\\t\\t\\t\\toutput = elem[i];\\n\\t\\t\\ti = i + 1;\\n\\t\\t}\\n\\t\\treturn output;\\n\\t}\",\n \"private Node _locate(Object key){\\n\\t\\tint hashCode = key.hashCode();\\r\\n\\t\\tint bucketNum = hashCode % _numBuckets;\\r\\n\\t\\treturn _locate(key, bucketNum);\\r\\n\\t}\",\n \"private boolean isIdExists(SQLiteDatabase db, String tableName, String firstColumnName, Object key) {\\n boolean ret = false;\\n String query = new StringBuilder(\\\"SELECT \\\")\\n .append(firstColumnName)\\n .append(\\\" FROM \\\")\\n .append(tableName)\\n .append(\\\" WHERE \\\")\\n .append(firstColumnName)\\n .append(\\\" = \\\")\\n .append(key)\\n .append(\\\";\\\")\\n .toString();\\n JSArray resQuery = this.selectSQL(db, query, new ArrayList<String>());\\n if (resQuery.length() == 1) ret = true;\\n return ret;\\n }\",\n \"@Override\\n\\tpublic User findByKey(Integer id) {\\n\\t\\treturn null;\\n\\t}\",\n \"public Object findRecord(Object key) \\n\\t{\\n\\t check(\\\"find\\\", key);\\n \\n\\t Object record = htRecords.get(key);\\n\\t if ( record != null )\\n\\t {\\n\\t\\t //--- Return a copy of the record\\n\\t return copy ( record );\\n\\t }\\n\\t else\\n\\t {\\n\\t return null ;\\n\\t }\\n\\t}\",\n \"int find(K key)\\n {\\n return Math.abs(key.hashCode() % this.buckets.length);\\n }\",\n \"@Override\\r\\n public Object findElement(Object key) {\\r\\n\\r\\n // Search for node possibly containing key\\r\\n TFNode node = search(root(), key);\\r\\n \\r\\n // Note the index of where the key should be\\r\\n int index = FFGTE(node, key);\\r\\n\\r\\n // If the index is greater than the number of items in the node, the key is not in the node\\r\\n if (index < node.getNumItems()) {\\r\\n // Look for key in node\\r\\n if (treeComp.isEqual(node.getItem(index).key(), key)) {\\r\\n return node.getItem(index);\\r\\n }\\r\\n }\\r\\n\\r\\n // The search hit a leaf without finding the key\\r\\n return null;\\r\\n }\",\n \"UrlMap findByKey(String key);\",\n \"public String find(String key) {\\n\\t\\t\\n\\t\\tsearchProbe = 0;\\n\\t\\tint h = hash(key);\\n\\t\\twhile(table[h]!=null) {\\n\\t\\t\\t\\n\\t\\t\\tif(table[h].toString().substring(0, 19).equals(key)) {\\n\\t\\t\\t\\treturn table[h].toString();\\n\\t\\t\\t}\\n\\t\\t\\tsearchProbe++;\\n\\t\\t\\th=(h+1)%getTablesize();\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\treturn \\\"Not Found\\\";\\n\\t}\",\n \"public int getIndexOf(K key);\",\n \"V get(UniqueId uniqueId);\",\n \"private HashGroupifyEntry findEntry(final int row, final int index, final int keyHash) {\\n HashGroupifyEntry m = hashTableBuckets[index];\\n while ((m != null) && ((m.hashcode != keyHash) || !dataOutput.equals(row, m.row))) {\\n m = m.next;\\n }\\n return m;\\n }\",\n \"Object getKey();\",\n \"private Node find(String key) {\\n Node now = head;\\n while (now != null) {\\n if (now.pairStringString.getKey().equals(key)) {\\n return now;\\n }\\n now = now.next;\\n }\\n return null;\\n }\",\n \"public Entry find(Object key) {\\n int hashCode = key.hashCode();\\n int index = compFunction(hashCode);\\n\\n if(defTable[index].isEmpty()) {\\n return null;\\n }\\n\\n Entry entry = new Entry();\\n ListNode current = defTable[index].front();\\n\\n try{\\n while(true) {\\n if(((Entry) current.item()).key().equals(key)) {\\n entry.key = key;\\n entry.value = ((Entry) current.item()).value();\\n return entry;\\n }\\n if(current==defTable[index].back()) {\\n break;\\n }\\n current = current.next();\\n }\\n } catch(Exception err) {\\n System.out.println(err);\\n }\\n return null;\\n }\",\n \"public int find(K key){\\r\\n int k =0;\\r\\n int ik;\\r\\n while(true){\\r\\n ik = getIndex(k,key);\\r\\n if(hashTable[ik] == null || hashTable[ik].equals(key))\\r\\n return ik;\\r\\n else if(hashTable[ik].isDeleted){ // deleted\\r\\n break;\\r\\n }else{\\r\\n k++;\\r\\n }\\r\\n }\\r\\n int xspot = ik;\\r\\n while(true){\\r\\n k++;\\r\\n if(hashTable[ik]!=null && hashTable[ik].equals(key)){\\r\\n return ik;\\r\\n }\\r\\n if(hashTable[ik] == null){\\r\\n return xspot;\\r\\n }\\r\\n }\\r\\n }\",\n \"Option<AcHost> findByKey(String key) throws Throwable;\",\n \"Collection getUniqueKeysInGroup(Object groupID) throws Exception;\",\n \"private Node<Pair<K, V>> search(\\n BiDirectionalNullTerminatedTailedLinkedList<Pair<K, V>> list,\\n K key) {\\n\\n for (Node<Pair<K, V>> i = list.getHead().getNext(); i != list.getTail();\\n i = i.getNext()) {\\n if (i.getData().key.equals(key)) {\\n return i;\\n }\\n }\\n\\n return null;\\n }\",\n \"E findById(K id);\",\n \"boolean hasKey(String collection, String hkey);\",\n \"public int Search(int key)\\n {\\n for(int i=0; i<n; i++)\\n {\\n if(a[i]==key)\\n return 1;\\n }\\n return 0;\\n }\",\n \"public boolean existsKey(String inKey);\",\n \"public RBNode<T, E> searchAndRetrieve(T key) {\\r\\n\\t\\tRBNode<T, E> c = root;\\r\\n\\t\\tRBNode<T, E> p = nillLeaf;\\r\\n\\t\\twhile (c != nillLeaf) {\\r\\n\\t\\t\\t// if when comparing if it hasnt found the key go to the left\\r\\n\\t\\t\\tif (key.compareTo(c.uniqueKey) < 0) {\\r\\n\\t\\t\\t\\tp = c;\\r\\n\\t\\t\\t\\tc = c.leftChild;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t// if when comparing if it hasnt found the key go to the right\\r\\n\\t\\t\\telse if (key.compareTo(c.uniqueKey) > 0) {\\r\\n\\t\\t\\t\\tp = c;\\r\\n\\t\\t\\t\\tc = c.rightChild;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t// they are equal\\r\\n\\t\\t\\telse {\\r\\n\\t\\t\\t\\tp = c;\\r\\n\\t\\t\\t\\tc = c.leftChild;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn p;\\r\\n\\t}\",\n \"public V lookup(K key);\",\n \"String getLookupKey();\",\n \"String getKey(int index);\",\n \"int getKey(int i);\",\n \"T get(final UniqueId uniqueId) {\\n _readLock.lock();\\n try {\\n return _uniqueIdMap.get(uniqueId);\\n } finally {\\n _readLock.unlock();\\n }\\n }\",\n \"Storage selectByPrimaryKey(StorageKey key);\",\n \"K findKeyForValue(V val);\",\n \"@Override\\r\\n\\tpublic CommonParamDomain findByKey(CommonParamDomain t) {\\n\\t\\treturn getPersistanceManager().load(getNamespace() + \\\".findByKey\\\", t);\\r\\n\\t}\",\n \"T find(String collection, String hkey, Class<T> tclass);\",\n \"E find(KeyType key) {\\n int position = findPosKey(key);\\n if (mArray[position].state == FHhashQP.ACTIVE) {\\n return mArray[findPosKey(key)].data;\\n } else {\\n throw new NoSuchElementException();\\n }\\n }\",\n \"public Record find(String key) {\\n\\t\\tint hash = toHashKey(key);\\n\\t\\tint baseValue = (baseHash(hash,length))% length;\\n\\t\\tif (Table[baseValue].hash == -1){ //If slot is empty\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t\\telse if (Table[baseValue].key.equals(key)){ //if the slot is the key we are looking for\\n\\t\\t\\treturn Table[baseValue];\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint step = (stepHash(hash,length)); //checks first slot after base\\n\\t\\t\\tint current = (baseValue + step)% length; //checks first slot after base\\n\\t\\t\\twhile (current != baseValue){ //cycle through table until reaching first value again\\n\\t\\t\\t\\tif (Table[current].hash == -1){//If slot is empty\\n\\t\\t\\t\\t\\treturn null;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (Table[current].key.equals(key)){ //if the slot is the key we are looking for\\n\\t\\t\\t\\t\\treturn Table[current];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tcurrent = (current + step) % length; //Cycle through table without going over the newlength\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"Key getPrimaryKey();\",\n \"public abstract boolean containsKey(K key);\",\n \"private Document findInCache(String userId) {\\n\\t\\tString key;\\n\\t\\tSet<String> keys = cache.keySet();\\n\\t\\tIterator<String> itr = keys.iterator();\\n\\t\\twhile (itr.hasNext()) {\\n\\t\\t\\tkey = itr.next();\\n\\t\\t\\tDocument data = cache.get(key);\\n\\t\\t\\t// check if email in profile object is same as input userId\\n\\t\\t\\tString email = \\\"\\\";\\n\\t\\t\\ttry {\\n\\t\\t\\t\\temail = DOMUtil.value(data, Profile.xpathMap.get(\\\"email\\\"), Profile.nameSpaceCtx);\\n\\t\\t\\t} catch (XMLException e) {\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\t// cache hit\\n\\t\\t\\tif (StringUtil.equalsIgnoreCase(email, userId)) {\\n\\t\\t\\t\\treturn data;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// Cache miss\\n\\t\\treturn null;\\n\\t}\",\n \"public T search(K key) {\\n\\t\\tfor (T item : list) {\\n\\t\\t\\tif (item.matches(key)) {\\n\\t\\t\\t\\treturn item;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"public E findById(Serializable pk) ;\",\n \"abstract public String getKey();\",\n \"@Override\\n public int find(int p) {\\n while (p != id[p]) { p = id[p]; }\\n return p;\\n }\",\n \"public boolean containsId(String key, Long userId) {\\n if(index.containsKey(key)) {\\n return index.get(key).contains(userId);\\n }\\n return false;\\n }\",\n \"public boolean contains(K key);\",\n \"java.lang.String getKey();\",\n \"java.lang.String getKey();\",\n \"java.lang.String getKey();\",\n \"java.lang.String getKey();\",\n \"java.lang.String getKey();\",\n \"java.lang.String getKey();\",\n \"MongoDBEntry<K, V> get(byte[] key);\",\n \"private ImmutablePair<byte[], byte[]> getFuzzyKeyFor(MDSKey key) {\\n byte[] keyBytes = key.getKey();\\n // byte array is automatically initialized to 0, which implies fixed match in fuzzy info\\n // the row key after targetId doesn't need to be a match.\\n // Workaround for HBASE-15676, need to have at least one 1 in the fuzzy filter\\n byte[] infoBytes = new byte[keyBytes.length + 1];\\n infoBytes[infoBytes.length - 1] = 1;\\n\\n // the key array size and mask array size has to be equal so increase the size by 1\\n return new ImmutablePair<>(Bytes.concat(keyBytes, new byte[1]), infoBytes);\\n }\",\n \"private CAUEntry findElementWithTID(CAUList ulist, int tid){\\n\\t\\tList<CAUEntry> list = ulist.CAUEntries;\\n\\t\\t\\n\\t\\t// perform a binary search to check if the subset appears in level k-1.\\n int first = 0;\\n int last = list.size() - 1;\\n \\n // the binary search\\n while( first <= last )\\n {\\n \\tint middle = ( first + last ) >>> 1; // divide by 2\\n\\n if(list.get(middle).tid < tid){\\n \\tfirst = middle + 1; // the itemset compared is larger than the subset according to the lexical order\\n }\\n else if(list.get(middle).tid > tid){\\n \\tlast = middle - 1; // the itemset compared is smaller than the subset is smaller according to the lexical order\\n }\\n else{\\n \\treturn list.get(middle);\\n }\\n }\\n\\t\\treturn null;\\n\\t}\",\n \"public void test_findUniqueByProperty() {\\r\\n\\t\\tPerson person = (Person) this.persistenceService.findUniqueByProperty(Person.class, NAME_PROPERTY, NAME_PARAM[2]);\\r\\n\\t\\tassertForFindUniquePerson(person);\\r\\n\\t}\",\n \"private BTNode search(BTNode btNode, DataPair key) {\\n int i =0;\\n while (i < btNode.mCurrentKeyNum && key.compareTo(btNode.mKeys[i]) > 0)\\n i++;\\n\\n if (i < btNode.mCurrentKeyNum && key.compareTo(btNode.mKeys[i])==0)\\n return btNode;//btNode.mKeys[i];\\n if (btNode.mIsLeaf)\\n return null;\\n return search(btNode.mChildren[i],key);\\n }\",\n \"Kaiwa selectByPrimaryKey(String maht);\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"private Node findKey(String key){\\n Node N = front;\\n while(N != null){\\n if(N.key.equals(key)){\\n return N; \\n }\\n else{\\n N = N.next; \\n }\\n }\\n return null;\\n }\",\n \"boolean has(String key);\",\n \"public int search (int[] db, int skey)\\n { \\n for (int i = 0; i < db.length; i++)\\n { \\n if (skey == db[i])\\n {\\n return i;\\n }\\n }\\n return -1;\\n }\",\n \"@Override\\r\\n\\tpublic boolean exists(T key) {\\r\\n\\t\\treturn existsRec(raiz, key);\\r\\n\\t}\",\n \"private ListNode find(K key) {\\r\\n\\t\\t\\tif (key == null) throw new NullPointerException();\\r\\n\\t\\t\\tListNode current = header;\\r\\n\\t\\t\\twhile (current != null) {\\r\\n\\t\\t\\t\\tif (current.key.equals(key)) return current;\\r\\n\\t\\t\\t\\tcurrent = current.next;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\treturn null;\\r\\n\\t\\t}\",\n \"public String findUserData(String login, String key);\",\n \"String getKey(Object entity);\",\n \"public V find (K key) throws KeyNotFoundException {\\n\\t\\treturn findKey(root, key);\\n\\t}\",\n \"T key();\",\n \"@Override\\n public boolean containsKey(Object key) {\\n LinkedList<Entry> tempBucket = chooseBucket(key);\\n \\n for(int i=0;i<tempBucket.size();i++) {\\n \\t\\tEntry tempEntry = tempBucket.get(i);\\n \\t\\t\\n \\t\\tif(tempEntry.getKey() == key) {\\n \\t\\t\\treturn true;\\n \\t\\t}\\n \\t}\\n \\n return false;\\n }\",\n \"boolean containsKey(K key);\",\n \"boolean containsKey(K key);\",\n \"public Object get(Object key) {\\n\\t\\tint index = key.hashCode() % SLOTS;\\n\\t\\t// check if key is already present in that slot/bucket.\\n\\t\\tfor(Pair p:table[index]) {\\n\\t\\t\\tif(key.equals(p.key))\\n\\t\\t\\t\\treturn p.value;\\n\\t\\t}\\n\\t\\t// if not found, return null\\n\\t\\treturn null;\\n\\t}\",\n \"public boolean contains(String key);\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6557548","0.643432","0.6391567","0.6365645","0.63271624","0.62824047","0.6248718","0.62012416","0.6187755","0.6091412","0.60801125","0.60783225","0.6019925","0.6017186","0.60071295","0.5949148","0.59168965","0.590516","0.5889019","0.58544356","0.5850748","0.58504003","0.5846398","0.58166367","0.5811134","0.58050877","0.58001983","0.57801753","0.57700527","0.5754542","0.5737355","0.5725294","0.56994325","0.56967604","0.5690346","0.56514287","0.5645431","0.5622744","0.56095856","0.5595444","0.5590188","0.5569931","0.5565742","0.55463564","0.55400485","0.5533375","0.5528807","0.55126166","0.5506231","0.54987705","0.5493664","0.5479118","0.5474766","0.5466993","0.54360306","0.5434999","0.5426315","0.5424639","0.54224426","0.5421154","0.5420269","0.5414533","0.5412998","0.5412998","0.5412998","0.5412998","0.5412998","0.5412998","0.5408697","0.5408657","0.5406584","0.5400865","0.5400679","0.53918445","0.5386191","0.5386191","0.5386191","0.5386191","0.5386191","0.5386191","0.5386191","0.5386191","0.5386191","0.5386191","0.5386191","0.5386191","0.5386191","0.53858477","0.5380723","0.53777474","0.5373163","0.5370162","0.53610617","0.5359053","0.53486764","0.5346942","0.5346161","0.5345456","0.5345456","0.5345237","0.53392893"],"string":"[\n \"0.6557548\",\n \"0.643432\",\n \"0.6391567\",\n \"0.6365645\",\n \"0.63271624\",\n \"0.62824047\",\n \"0.6248718\",\n \"0.62012416\",\n \"0.6187755\",\n \"0.6091412\",\n \"0.60801125\",\n \"0.60783225\",\n \"0.6019925\",\n \"0.6017186\",\n \"0.60071295\",\n \"0.5949148\",\n \"0.59168965\",\n \"0.590516\",\n \"0.5889019\",\n \"0.58544356\",\n \"0.5850748\",\n \"0.58504003\",\n \"0.5846398\",\n \"0.58166367\",\n \"0.5811134\",\n \"0.58050877\",\n \"0.58001983\",\n \"0.57801753\",\n \"0.57700527\",\n \"0.5754542\",\n \"0.5737355\",\n \"0.5725294\",\n \"0.56994325\",\n \"0.56967604\",\n \"0.5690346\",\n \"0.56514287\",\n \"0.5645431\",\n \"0.5622744\",\n \"0.56095856\",\n \"0.5595444\",\n \"0.5590188\",\n \"0.5569931\",\n \"0.5565742\",\n \"0.55463564\",\n \"0.55400485\",\n \"0.5533375\",\n \"0.5528807\",\n \"0.55126166\",\n \"0.5506231\",\n \"0.54987705\",\n \"0.5493664\",\n \"0.5479118\",\n \"0.5474766\",\n \"0.5466993\",\n \"0.54360306\",\n \"0.5434999\",\n \"0.5426315\",\n \"0.5424639\",\n \"0.54224426\",\n \"0.5421154\",\n \"0.5420269\",\n \"0.5414533\",\n \"0.5412998\",\n \"0.5412998\",\n \"0.5412998\",\n \"0.5412998\",\n \"0.5412998\",\n \"0.5412998\",\n \"0.5408697\",\n \"0.5408657\",\n \"0.5406584\",\n \"0.5400865\",\n \"0.5400679\",\n \"0.53918445\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.53858477\",\n \"0.5380723\",\n \"0.53777474\",\n \"0.5373163\",\n \"0.5370162\",\n \"0.53610617\",\n \"0.5359053\",\n \"0.53486764\",\n \"0.5346942\",\n \"0.5346161\",\n \"0.5345456\",\n \"0.5345456\",\n \"0.5345237\",\n \"0.53392893\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":29395,"cells":{"query":{"kind":"string","value":"Find by unique key"},"document":{"kind":"string","value":"public CurrencyXRateProvider findByName(String name) {\n\t\treturn (CurrencyXRateProvider) this\n\t\t\t\t.getEntityManager()\n\t\t\t\t.createNamedQuery(CurrencyXRateProvider.NQ_FIND_BY_NAME)\n\t\t\t\t.setParameter(\"clientId\",\n\t\t\t\t\t\tSession.user.get().getClient().getId())\n\t\t\t\t.setParameter(\"name\", name).getSingleResult();\n\t}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["public Entry find(Object key) {\r\n Entry entry_with_key = new Entry();\r\n entry_with_key.key = key; \r\n int comp_hash = compFunction(entry_with_key.key.hashCode());\r\n if (hash_table[comp_hash] == null) {\r\n return null;\r\n } else {\r\n DList searching = hash_table[comp_hash];\r\n for(Object entry: searching){\r\n if(((Entry) entry).key().equals(key)){\r\n return (Entry) entry;\r\n }\r\n }\r\n return null;\r\n \r\n }\r\n\r\n\r\n }","public V search(K key);","private Node<Pair<K, V>> findItem(K key) {\n Node<Pair<K, V>> result = null;\n\n int hash1 = hash1(key);\n\n if (table[hash1] != null) {\n Node<Pair<K, V>> node = search(table[hash1].list, key);\n\n if (node != null) {\n result = node;\n }\n }\n\n int hash2 = hash2(key);\n\n if (table[hash2] != null && result == null) {\n Node<Pair<K, V>> node = search(table[hash2].list, key);\n\n if (node != null) {\n result = node;\n }\n }\n\n return result;\n }","String search(int key);","public DataItem find(int key){\n\t\tint hashVal = hashFunc(key);\n\t\tint stepSize = hashFunc2(key);\n\t\twhile(hashArray[hashVal] != null){\n\t\t\tif(hashArray[hashVal].getKey() == key){\n\t\t\t\tDataItem temp = hashArray[hashVal]; //find the item\n\t\t\t\treturn temp;\n\t\t\t}\n\t\t\thashVal += stepSize;\n\t\t\thashVal %= arraySize;\n\t\t}\n\t\treturn null;\n\t}","Online selectByPrimaryKey(String hash);","boolean containsKey(long key);","public Entry find(Object key) {\n int i = compFunction(key.hashCode());\n SList chain = buckets[i];\n try {\n for (SListNode n = (SListNode) chain.front(); n.isValidNode(); n = (SListNode) n.next()) {\n Entry e = (Entry) n.item();\n if (e.key.equals(key)) {\n return e;\n }\n }\n } catch(InvalidNodeException e) {\n System.out.println(e);\n }\n return null;\n }","public KeyedItem retrieve(Comparable searchKey);","@Nullable IStrongSlot find(LuaValue key);","private int locate(Key key) {\n\t\tint index = hash(key);\n\t\twhile(this.keys[index] != null && !this.keys[index].equals(key)) {\n\t\t\tindex = increment(index);\n\t\t}\n\t\treturn index;\n\t}","boolean exists(Integer key);","public Entry<K, V> find(K key) {\r\n try {\r\n int hash = key.hashCode();\r\n ListNode<Entry<K, V>> node = table[compFunction(hash)].front();\r\n if (node.isValidNode()) {\r\n return (Entry<K, V>) node.getItem();\r\n }\r\n } catch (Exception e) {\r\n System.out.println(\"Unhashable key: \" + e);\r\n }\r\n return null;\r\n }","public T retrieveByKey(S key) throws SQLException;","public boolean contains(Key key);","public abstract boolean lookup(Key key);","public boolean containsKey(Key key) ;","@Override\n public Message findOne(Integer key) throws SQLException {\n //Ei toteutettu\n return null;\n }","public E find(K key){\n\t\tE output= null;\n\t\t\n\t\tint i = 0;\n\t\twhile (i<keys.length && output == null){\n\t\t\tif(keys[i] != null && keys[i].equals(key))\n\t\t\t\toutput = elem[i];\n\t\t\ti = i + 1;\n\t\t}\n\t\treturn output;\n\t}","private Node _locate(Object key){\n\t\tint hashCode = key.hashCode();\r\n\t\tint bucketNum = hashCode % _numBuckets;\r\n\t\treturn _locate(key, bucketNum);\r\n\t}","private boolean isIdExists(SQLiteDatabase db, String tableName, String firstColumnName, Object key) {\n boolean ret = false;\n String query = new StringBuilder(\"SELECT \")\n .append(firstColumnName)\n .append(\" FROM \")\n .append(tableName)\n .append(\" WHERE \")\n .append(firstColumnName)\n .append(\" = \")\n .append(key)\n .append(\";\")\n .toString();\n JSArray resQuery = this.selectSQL(db, query, new ArrayList<String>());\n if (resQuery.length() == 1) ret = true;\n return ret;\n }","@Override\n\tpublic User findByKey(Integer id) {\n\t\treturn null;\n\t}","public Object findRecord(Object key) \n\t{\n\t check(\"find\", key);\n \n\t Object record = htRecords.get(key);\n\t if ( record != null )\n\t {\n\t\t //--- Return a copy of the record\n\t return copy ( record );\n\t }\n\t else\n\t {\n\t return null ;\n\t }\n\t}","int find(K key)\n {\n return Math.abs(key.hashCode() % this.buckets.length);\n }","@Override\r\n public Object findElement(Object key) {\r\n\r\n // Search for node possibly containing key\r\n TFNode node = search(root(), key);\r\n \r\n // Note the index of where the key should be\r\n int index = FFGTE(node, key);\r\n\r\n // If the index is greater than the number of items in the node, the key is not in the node\r\n if (index < node.getNumItems()) {\r\n // Look for key in node\r\n if (treeComp.isEqual(node.getItem(index).key(), key)) {\r\n return node.getItem(index);\r\n }\r\n }\r\n\r\n // The search hit a leaf without finding the key\r\n return null;\r\n }","UrlMap findByKey(String key);","public String find(String key) {\n\t\t\n\t\tsearchProbe = 0;\n\t\tint h = hash(key);\n\t\twhile(table[h]!=null) {\n\t\t\t\n\t\t\tif(table[h].toString().substring(0, 19).equals(key)) {\n\t\t\t\treturn table[h].toString();\n\t\t\t}\n\t\t\tsearchProbe++;\n\t\t\th=(h+1)%getTablesize();\n\t\t}\n\t\t\n\t\t\n\treturn \"Not Found\";\n\t}","public int getIndexOf(K key);","V get(UniqueId uniqueId);","private HashGroupifyEntry findEntry(final int row, final int index, final int keyHash) {\n HashGroupifyEntry m = hashTableBuckets[index];\n while ((m != null) && ((m.hashcode != keyHash) || !dataOutput.equals(row, m.row))) {\n m = m.next;\n }\n return m;\n }","Object getKey();","private Node find(String key) {\n Node now = head;\n while (now != null) {\n if (now.pairStringString.getKey().equals(key)) {\n return now;\n }\n now = now.next;\n }\n return null;\n }","public Entry find(Object key) {\n int hashCode = key.hashCode();\n int index = compFunction(hashCode);\n\n if(defTable[index].isEmpty()) {\n return null;\n }\n\n Entry entry = new Entry();\n ListNode current = defTable[index].front();\n\n try{\n while(true) {\n if(((Entry) current.item()).key().equals(key)) {\n entry.key = key;\n entry.value = ((Entry) current.item()).value();\n return entry;\n }\n if(current==defTable[index].back()) {\n break;\n }\n current = current.next();\n }\n } catch(Exception err) {\n System.out.println(err);\n }\n return null;\n }","public int find(K key){\r\n int k =0;\r\n int ik;\r\n while(true){\r\n ik = getIndex(k,key);\r\n if(hashTable[ik] == null || hashTable[ik].equals(key))\r\n return ik;\r\n else if(hashTable[ik].isDeleted){ // deleted\r\n break;\r\n }else{\r\n k++;\r\n }\r\n }\r\n int xspot = ik;\r\n while(true){\r\n k++;\r\n if(hashTable[ik]!=null && hashTable[ik].equals(key)){\r\n return ik;\r\n }\r\n if(hashTable[ik] == null){\r\n return xspot;\r\n }\r\n }\r\n }","Option<AcHost> findByKey(String key) throws Throwable;","Collection getUniqueKeysInGroup(Object groupID) throws Exception;","private Node<Pair<K, V>> search(\n BiDirectionalNullTerminatedTailedLinkedList<Pair<K, V>> list,\n K key) {\n\n for (Node<Pair<K, V>> i = list.getHead().getNext(); i != list.getTail();\n i = i.getNext()) {\n if (i.getData().key.equals(key)) {\n return i;\n }\n }\n\n return null;\n }","E findById(K id);","boolean hasKey(String collection, String hkey);","public int Search(int key)\n {\n for(int i=0; i<n; i++)\n {\n if(a[i]==key)\n return 1;\n }\n return 0;\n }","public boolean existsKey(String inKey);","public RBNode<T, E> searchAndRetrieve(T key) {\r\n\t\tRBNode<T, E> c = root;\r\n\t\tRBNode<T, E> p = nillLeaf;\r\n\t\twhile (c != nillLeaf) {\r\n\t\t\t// if when comparing if it hasnt found the key go to the left\r\n\t\t\tif (key.compareTo(c.uniqueKey) < 0) {\r\n\t\t\t\tp = c;\r\n\t\t\t\tc = c.leftChild;\r\n\t\t\t}\r\n\t\t\t// if when comparing if it hasnt found the key go to the right\r\n\t\t\telse if (key.compareTo(c.uniqueKey) > 0) {\r\n\t\t\t\tp = c;\r\n\t\t\t\tc = c.rightChild;\r\n\t\t\t}\r\n\t\t\t// they are equal\r\n\t\t\telse {\r\n\t\t\t\tp = c;\r\n\t\t\t\tc = c.leftChild;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn p;\r\n\t}","public V lookup(K key);","String getLookupKey();","String getKey(int index);","int getKey(int i);","T get(final UniqueId uniqueId) {\n _readLock.lock();\n try {\n return _uniqueIdMap.get(uniqueId);\n } finally {\n _readLock.unlock();\n }\n }","Storage selectByPrimaryKey(StorageKey key);","K findKeyForValue(V val);","@Override\r\n\tpublic CommonParamDomain findByKey(CommonParamDomain t) {\n\t\treturn getPersistanceManager().load(getNamespace() + \".findByKey\", t);\r\n\t}","T find(String collection, String hkey, Class<T> tclass);","E find(KeyType key) {\n int position = findPosKey(key);\n if (mArray[position].state == FHhashQP.ACTIVE) {\n return mArray[findPosKey(key)].data;\n } else {\n throw new NoSuchElementException();\n }\n }","public Record find(String key) {\n\t\tint hash = toHashKey(key);\n\t\tint baseValue = (baseHash(hash,length))% length;\n\t\tif (Table[baseValue].hash == -1){ //If slot is empty\n\t\t\treturn null;\n\t\t}\n\t\telse if (Table[baseValue].key.equals(key)){ //if the slot is the key we are looking for\n\t\t\treturn Table[baseValue];\n\t\t}\n\t\telse {\n\t\t\tint step = (stepHash(hash,length)); //checks first slot after base\n\t\t\tint current = (baseValue + step)% length; //checks first slot after base\n\t\t\twhile (current != baseValue){ //cycle through table until reaching first value again\n\t\t\t\tif (Table[current].hash == -1){//If slot is empty\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\t\t\t\telse if (Table[current].key.equals(key)){ //if the slot is the key we are looking for\n\t\t\t\t\treturn Table[current];\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcurrent = (current + step) % length; //Cycle through table without going over the newlength\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn null;\n\t}","Key getPrimaryKey();","public abstract boolean containsKey(K key);","private Document findInCache(String userId) {\n\t\tString key;\n\t\tSet<String> keys = cache.keySet();\n\t\tIterator<String> itr = keys.iterator();\n\t\twhile (itr.hasNext()) {\n\t\t\tkey = itr.next();\n\t\t\tDocument data = cache.get(key);\n\t\t\t// check if email in profile object is same as input userId\n\t\t\tString email = \"\";\n\t\t\ttry {\n\t\t\t\temail = DOMUtil.value(data, Profile.xpathMap.get(\"email\"), Profile.nameSpaceCtx);\n\t\t\t} catch (XMLException e) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t// cache hit\n\t\t\tif (StringUtil.equalsIgnoreCase(email, userId)) {\n\t\t\t\treturn data;\n\t\t\t}\n\t\t}\n\t\t// Cache miss\n\t\treturn null;\n\t}","public T search(K key) {\n\t\tfor (T item : list) {\n\t\t\tif (item.matches(key)) {\n\t\t\t\treturn item;\n\t\t\t}\n\t\t}\n\t\treturn null;\n\t}","public E findById(Serializable pk) ;","abstract public String getKey();","@Override\n public int find(int p) {\n while (p != id[p]) { p = id[p]; }\n return p;\n }","public boolean containsId(String key, Long userId) {\n if(index.containsKey(key)) {\n return index.get(key).contains(userId);\n }\n return false;\n }","public boolean contains(K key);","java.lang.String getKey();","java.lang.String getKey();","java.lang.String getKey();","java.lang.String getKey();","java.lang.String getKey();","java.lang.String getKey();","MongoDBEntry<K, V> get(byte[] key);","private ImmutablePair<byte[], byte[]> getFuzzyKeyFor(MDSKey key) {\n byte[] keyBytes = key.getKey();\n // byte array is automatically initialized to 0, which implies fixed match in fuzzy info\n // the row key after targetId doesn't need to be a match.\n // Workaround for HBASE-15676, need to have at least one 1 in the fuzzy filter\n byte[] infoBytes = new byte[keyBytes.length + 1];\n infoBytes[infoBytes.length - 1] = 1;\n\n // the key array size and mask array size has to be equal so increase the size by 1\n return new ImmutablePair<>(Bytes.concat(keyBytes, new byte[1]), infoBytes);\n }","private CAUEntry findElementWithTID(CAUList ulist, int tid){\n\t\tList<CAUEntry> list = ulist.CAUEntries;\n\t\t\n\t\t// perform a binary search to check if the subset appears in level k-1.\n int first = 0;\n int last = list.size() - 1;\n \n // the binary search\n while( first <= last )\n {\n \tint middle = ( first + last ) >>> 1; // divide by 2\n\n if(list.get(middle).tid < tid){\n \tfirst = middle + 1; // the itemset compared is larger than the subset according to the lexical order\n }\n else if(list.get(middle).tid > tid){\n \tlast = middle - 1; // the itemset compared is smaller than the subset is smaller according to the lexical order\n }\n else{\n \treturn list.get(middle);\n }\n }\n\t\treturn null;\n\t}","public void test_findUniqueByProperty() {\r\n\t\tPerson person = (Person) this.persistenceService.findUniqueByProperty(Person.class, NAME_PROPERTY, NAME_PARAM[2]);\r\n\t\tassertForFindUniquePerson(person);\r\n\t}","private BTNode search(BTNode btNode, DataPair key) {\n int i =0;\n while (i < btNode.mCurrentKeyNum && key.compareTo(btNode.mKeys[i]) > 0)\n i++;\n\n if (i < btNode.mCurrentKeyNum && key.compareTo(btNode.mKeys[i])==0)\n return btNode;//btNode.mKeys[i];\n if (btNode.mIsLeaf)\n return null;\n return search(btNode.mChildren[i],key);\n }","Kaiwa selectByPrimaryKey(String maht);","String getKey();","String getKey();","String getKey();","String getKey();","String getKey();","String getKey();","String getKey();","String getKey();","String getKey();","String getKey();","String getKey();","String getKey();","String getKey();","private Node findKey(String key){\n Node N = front;\n while(N != null){\n if(N.key.equals(key)){\n return N; \n }\n else{\n N = N.next; \n }\n }\n return null;\n }","boolean has(String key);","public int search (int[] db, int skey)\n { \n for (int i = 0; i < db.length; i++)\n { \n if (skey == db[i])\n {\n return i;\n }\n }\n return -1;\n }","@Override\r\n\tpublic boolean exists(T key) {\r\n\t\treturn existsRec(raiz, key);\r\n\t}","private ListNode find(K key) {\r\n\t\t\tif (key == null) throw new NullPointerException();\r\n\t\t\tListNode current = header;\r\n\t\t\twhile (current != null) {\r\n\t\t\t\tif (current.key.equals(key)) return current;\r\n\t\t\t\tcurrent = current.next;\r\n\t\t\t}\r\n\t\t\treturn null;\r\n\t\t}","public String findUserData(String login, String key);","String getKey(Object entity);","public V find (K key) throws KeyNotFoundException {\n\t\treturn findKey(root, key);\n\t}","T key();","@Override\n public boolean containsKey(Object key) {\n LinkedList<Entry> tempBucket = chooseBucket(key);\n \n for(int i=0;i<tempBucket.size();i++) {\n \t\tEntry tempEntry = tempBucket.get(i);\n \t\t\n \t\tif(tempEntry.getKey() == key) {\n \t\t\treturn true;\n \t\t}\n \t}\n \n return false;\n }","boolean containsKey(K key);","boolean containsKey(K key);","public Object get(Object key) {\n\t\tint index = key.hashCode() % SLOTS;\n\t\t// check if key is already present in that slot/bucket.\n\t\tfor(Pair p:table[index]) {\n\t\t\tif(key.equals(p.key))\n\t\t\t\treturn p.value;\n\t\t}\n\t\t// if not found, return null\n\t\treturn null;\n\t}","public boolean contains(String key);"],"string":"[\n \"public Entry find(Object key) {\\r\\n Entry entry_with_key = new Entry();\\r\\n entry_with_key.key = key; \\r\\n int comp_hash = compFunction(entry_with_key.key.hashCode());\\r\\n if (hash_table[comp_hash] == null) {\\r\\n return null;\\r\\n } else {\\r\\n DList searching = hash_table[comp_hash];\\r\\n for(Object entry: searching){\\r\\n if(((Entry) entry).key().equals(key)){\\r\\n return (Entry) entry;\\r\\n }\\r\\n }\\r\\n return null;\\r\\n \\r\\n }\\r\\n\\r\\n\\r\\n }\",\n \"public V search(K key);\",\n \"private Node<Pair<K, V>> findItem(K key) {\\n Node<Pair<K, V>> result = null;\\n\\n int hash1 = hash1(key);\\n\\n if (table[hash1] != null) {\\n Node<Pair<K, V>> node = search(table[hash1].list, key);\\n\\n if (node != null) {\\n result = node;\\n }\\n }\\n\\n int hash2 = hash2(key);\\n\\n if (table[hash2] != null && result == null) {\\n Node<Pair<K, V>> node = search(table[hash2].list, key);\\n\\n if (node != null) {\\n result = node;\\n }\\n }\\n\\n return result;\\n }\",\n \"String search(int key);\",\n \"public DataItem find(int key){\\n\\t\\tint hashVal = hashFunc(key);\\n\\t\\tint stepSize = hashFunc2(key);\\n\\t\\twhile(hashArray[hashVal] != null){\\n\\t\\t\\tif(hashArray[hashVal].getKey() == key){\\n\\t\\t\\t\\tDataItem temp = hashArray[hashVal]; //find the item\\n\\t\\t\\t\\treturn temp;\\n\\t\\t\\t}\\n\\t\\t\\thashVal += stepSize;\\n\\t\\t\\thashVal %= arraySize;\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"Online selectByPrimaryKey(String hash);\",\n \"boolean containsKey(long key);\",\n \"public Entry find(Object key) {\\n int i = compFunction(key.hashCode());\\n SList chain = buckets[i];\\n try {\\n for (SListNode n = (SListNode) chain.front(); n.isValidNode(); n = (SListNode) n.next()) {\\n Entry e = (Entry) n.item();\\n if (e.key.equals(key)) {\\n return e;\\n }\\n }\\n } catch(InvalidNodeException e) {\\n System.out.println(e);\\n }\\n return null;\\n }\",\n \"public KeyedItem retrieve(Comparable searchKey);\",\n \"@Nullable IStrongSlot find(LuaValue key);\",\n \"private int locate(Key key) {\\n\\t\\tint index = hash(key);\\n\\t\\twhile(this.keys[index] != null && !this.keys[index].equals(key)) {\\n\\t\\t\\tindex = increment(index);\\n\\t\\t}\\n\\t\\treturn index;\\n\\t}\",\n \"boolean exists(Integer key);\",\n \"public Entry<K, V> find(K key) {\\r\\n try {\\r\\n int hash = key.hashCode();\\r\\n ListNode<Entry<K, V>> node = table[compFunction(hash)].front();\\r\\n if (node.isValidNode()) {\\r\\n return (Entry<K, V>) node.getItem();\\r\\n }\\r\\n } catch (Exception e) {\\r\\n System.out.println(\\\"Unhashable key: \\\" + e);\\r\\n }\\r\\n return null;\\r\\n }\",\n \"public T retrieveByKey(S key) throws SQLException;\",\n \"public boolean contains(Key key);\",\n \"public abstract boolean lookup(Key key);\",\n \"public boolean containsKey(Key key) ;\",\n \"@Override\\n public Message findOne(Integer key) throws SQLException {\\n //Ei toteutettu\\n return null;\\n }\",\n \"public E find(K key){\\n\\t\\tE output= null;\\n\\t\\t\\n\\t\\tint i = 0;\\n\\t\\twhile (i<keys.length && output == null){\\n\\t\\t\\tif(keys[i] != null && keys[i].equals(key))\\n\\t\\t\\t\\toutput = elem[i];\\n\\t\\t\\ti = i + 1;\\n\\t\\t}\\n\\t\\treturn output;\\n\\t}\",\n \"private Node _locate(Object key){\\n\\t\\tint hashCode = key.hashCode();\\r\\n\\t\\tint bucketNum = hashCode % _numBuckets;\\r\\n\\t\\treturn _locate(key, bucketNum);\\r\\n\\t}\",\n \"private boolean isIdExists(SQLiteDatabase db, String tableName, String firstColumnName, Object key) {\\n boolean ret = false;\\n String query = new StringBuilder(\\\"SELECT \\\")\\n .append(firstColumnName)\\n .append(\\\" FROM \\\")\\n .append(tableName)\\n .append(\\\" WHERE \\\")\\n .append(firstColumnName)\\n .append(\\\" = \\\")\\n .append(key)\\n .append(\\\";\\\")\\n .toString();\\n JSArray resQuery = this.selectSQL(db, query, new ArrayList<String>());\\n if (resQuery.length() == 1) ret = true;\\n return ret;\\n }\",\n \"@Override\\n\\tpublic User findByKey(Integer id) {\\n\\t\\treturn null;\\n\\t}\",\n \"public Object findRecord(Object key) \\n\\t{\\n\\t check(\\\"find\\\", key);\\n \\n\\t Object record = htRecords.get(key);\\n\\t if ( record != null )\\n\\t {\\n\\t\\t //--- Return a copy of the record\\n\\t return copy ( record );\\n\\t }\\n\\t else\\n\\t {\\n\\t return null ;\\n\\t }\\n\\t}\",\n \"int find(K key)\\n {\\n return Math.abs(key.hashCode() % this.buckets.length);\\n }\",\n \"@Override\\r\\n public Object findElement(Object key) {\\r\\n\\r\\n // Search for node possibly containing key\\r\\n TFNode node = search(root(), key);\\r\\n \\r\\n // Note the index of where the key should be\\r\\n int index = FFGTE(node, key);\\r\\n\\r\\n // If the index is greater than the number of items in the node, the key is not in the node\\r\\n if (index < node.getNumItems()) {\\r\\n // Look for key in node\\r\\n if (treeComp.isEqual(node.getItem(index).key(), key)) {\\r\\n return node.getItem(index);\\r\\n }\\r\\n }\\r\\n\\r\\n // The search hit a leaf without finding the key\\r\\n return null;\\r\\n }\",\n \"UrlMap findByKey(String key);\",\n \"public String find(String key) {\\n\\t\\t\\n\\t\\tsearchProbe = 0;\\n\\t\\tint h = hash(key);\\n\\t\\twhile(table[h]!=null) {\\n\\t\\t\\t\\n\\t\\t\\tif(table[h].toString().substring(0, 19).equals(key)) {\\n\\t\\t\\t\\treturn table[h].toString();\\n\\t\\t\\t}\\n\\t\\t\\tsearchProbe++;\\n\\t\\t\\th=(h+1)%getTablesize();\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\treturn \\\"Not Found\\\";\\n\\t}\",\n \"public int getIndexOf(K key);\",\n \"V get(UniqueId uniqueId);\",\n \"private HashGroupifyEntry findEntry(final int row, final int index, final int keyHash) {\\n HashGroupifyEntry m = hashTableBuckets[index];\\n while ((m != null) && ((m.hashcode != keyHash) || !dataOutput.equals(row, m.row))) {\\n m = m.next;\\n }\\n return m;\\n }\",\n \"Object getKey();\",\n \"private Node find(String key) {\\n Node now = head;\\n while (now != null) {\\n if (now.pairStringString.getKey().equals(key)) {\\n return now;\\n }\\n now = now.next;\\n }\\n return null;\\n }\",\n \"public Entry find(Object key) {\\n int hashCode = key.hashCode();\\n int index = compFunction(hashCode);\\n\\n if(defTable[index].isEmpty()) {\\n return null;\\n }\\n\\n Entry entry = new Entry();\\n ListNode current = defTable[index].front();\\n\\n try{\\n while(true) {\\n if(((Entry) current.item()).key().equals(key)) {\\n entry.key = key;\\n entry.value = ((Entry) current.item()).value();\\n return entry;\\n }\\n if(current==defTable[index].back()) {\\n break;\\n }\\n current = current.next();\\n }\\n } catch(Exception err) {\\n System.out.println(err);\\n }\\n return null;\\n }\",\n \"public int find(K key){\\r\\n int k =0;\\r\\n int ik;\\r\\n while(true){\\r\\n ik = getIndex(k,key);\\r\\n if(hashTable[ik] == null || hashTable[ik].equals(key))\\r\\n return ik;\\r\\n else if(hashTable[ik].isDeleted){ // deleted\\r\\n break;\\r\\n }else{\\r\\n k++;\\r\\n }\\r\\n }\\r\\n int xspot = ik;\\r\\n while(true){\\r\\n k++;\\r\\n if(hashTable[ik]!=null && hashTable[ik].equals(key)){\\r\\n return ik;\\r\\n }\\r\\n if(hashTable[ik] == null){\\r\\n return xspot;\\r\\n }\\r\\n }\\r\\n }\",\n \"Option<AcHost> findByKey(String key) throws Throwable;\",\n \"Collection getUniqueKeysInGroup(Object groupID) throws Exception;\",\n \"private Node<Pair<K, V>> search(\\n BiDirectionalNullTerminatedTailedLinkedList<Pair<K, V>> list,\\n K key) {\\n\\n for (Node<Pair<K, V>> i = list.getHead().getNext(); i != list.getTail();\\n i = i.getNext()) {\\n if (i.getData().key.equals(key)) {\\n return i;\\n }\\n }\\n\\n return null;\\n }\",\n \"E findById(K id);\",\n \"boolean hasKey(String collection, String hkey);\",\n \"public int Search(int key)\\n {\\n for(int i=0; i<n; i++)\\n {\\n if(a[i]==key)\\n return 1;\\n }\\n return 0;\\n }\",\n \"public boolean existsKey(String inKey);\",\n \"public RBNode<T, E> searchAndRetrieve(T key) {\\r\\n\\t\\tRBNode<T, E> c = root;\\r\\n\\t\\tRBNode<T, E> p = nillLeaf;\\r\\n\\t\\twhile (c != nillLeaf) {\\r\\n\\t\\t\\t// if when comparing if it hasnt found the key go to the left\\r\\n\\t\\t\\tif (key.compareTo(c.uniqueKey) < 0) {\\r\\n\\t\\t\\t\\tp = c;\\r\\n\\t\\t\\t\\tc = c.leftChild;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t// if when comparing if it hasnt found the key go to the right\\r\\n\\t\\t\\telse if (key.compareTo(c.uniqueKey) > 0) {\\r\\n\\t\\t\\t\\tp = c;\\r\\n\\t\\t\\t\\tc = c.rightChild;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t// they are equal\\r\\n\\t\\t\\telse {\\r\\n\\t\\t\\t\\tp = c;\\r\\n\\t\\t\\t\\tc = c.leftChild;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn p;\\r\\n\\t}\",\n \"public V lookup(K key);\",\n \"String getLookupKey();\",\n \"String getKey(int index);\",\n \"int getKey(int i);\",\n \"T get(final UniqueId uniqueId) {\\n _readLock.lock();\\n try {\\n return _uniqueIdMap.get(uniqueId);\\n } finally {\\n _readLock.unlock();\\n }\\n }\",\n \"Storage selectByPrimaryKey(StorageKey key);\",\n \"K findKeyForValue(V val);\",\n \"@Override\\r\\n\\tpublic CommonParamDomain findByKey(CommonParamDomain t) {\\n\\t\\treturn getPersistanceManager().load(getNamespace() + \\\".findByKey\\\", t);\\r\\n\\t}\",\n \"T find(String collection, String hkey, Class<T> tclass);\",\n \"E find(KeyType key) {\\n int position = findPosKey(key);\\n if (mArray[position].state == FHhashQP.ACTIVE) {\\n return mArray[findPosKey(key)].data;\\n } else {\\n throw new NoSuchElementException();\\n }\\n }\",\n \"public Record find(String key) {\\n\\t\\tint hash = toHashKey(key);\\n\\t\\tint baseValue = (baseHash(hash,length))% length;\\n\\t\\tif (Table[baseValue].hash == -1){ //If slot is empty\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t\\telse if (Table[baseValue].key.equals(key)){ //if the slot is the key we are looking for\\n\\t\\t\\treturn Table[baseValue];\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tint step = (stepHash(hash,length)); //checks first slot after base\\n\\t\\t\\tint current = (baseValue + step)% length; //checks first slot after base\\n\\t\\t\\twhile (current != baseValue){ //cycle through table until reaching first value again\\n\\t\\t\\t\\tif (Table[current].hash == -1){//If slot is empty\\n\\t\\t\\t\\t\\treturn null;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (Table[current].key.equals(key)){ //if the slot is the key we are looking for\\n\\t\\t\\t\\t\\treturn Table[current];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tcurrent = (current + step) % length; //Cycle through table without going over the newlength\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"Key getPrimaryKey();\",\n \"public abstract boolean containsKey(K key);\",\n \"private Document findInCache(String userId) {\\n\\t\\tString key;\\n\\t\\tSet<String> keys = cache.keySet();\\n\\t\\tIterator<String> itr = keys.iterator();\\n\\t\\twhile (itr.hasNext()) {\\n\\t\\t\\tkey = itr.next();\\n\\t\\t\\tDocument data = cache.get(key);\\n\\t\\t\\t// check if email in profile object is same as input userId\\n\\t\\t\\tString email = \\\"\\\";\\n\\t\\t\\ttry {\\n\\t\\t\\t\\temail = DOMUtil.value(data, Profile.xpathMap.get(\\\"email\\\"), Profile.nameSpaceCtx);\\n\\t\\t\\t} catch (XMLException e) {\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\t// cache hit\\n\\t\\t\\tif (StringUtil.equalsIgnoreCase(email, userId)) {\\n\\t\\t\\t\\treturn data;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// Cache miss\\n\\t\\treturn null;\\n\\t}\",\n \"public T search(K key) {\\n\\t\\tfor (T item : list) {\\n\\t\\t\\tif (item.matches(key)) {\\n\\t\\t\\t\\treturn item;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"public E findById(Serializable pk) ;\",\n \"abstract public String getKey();\",\n \"@Override\\n public int find(int p) {\\n while (p != id[p]) { p = id[p]; }\\n return p;\\n }\",\n \"public boolean containsId(String key, Long userId) {\\n if(index.containsKey(key)) {\\n return index.get(key).contains(userId);\\n }\\n return false;\\n }\",\n \"public boolean contains(K key);\",\n \"java.lang.String getKey();\",\n \"java.lang.String getKey();\",\n \"java.lang.String getKey();\",\n \"java.lang.String getKey();\",\n \"java.lang.String getKey();\",\n \"java.lang.String getKey();\",\n \"MongoDBEntry<K, V> get(byte[] key);\",\n \"private ImmutablePair<byte[], byte[]> getFuzzyKeyFor(MDSKey key) {\\n byte[] keyBytes = key.getKey();\\n // byte array is automatically initialized to 0, which implies fixed match in fuzzy info\\n // the row key after targetId doesn't need to be a match.\\n // Workaround for HBASE-15676, need to have at least one 1 in the fuzzy filter\\n byte[] infoBytes = new byte[keyBytes.length + 1];\\n infoBytes[infoBytes.length - 1] = 1;\\n\\n // the key array size and mask array size has to be equal so increase the size by 1\\n return new ImmutablePair<>(Bytes.concat(keyBytes, new byte[1]), infoBytes);\\n }\",\n \"private CAUEntry findElementWithTID(CAUList ulist, int tid){\\n\\t\\tList<CAUEntry> list = ulist.CAUEntries;\\n\\t\\t\\n\\t\\t// perform a binary search to check if the subset appears in level k-1.\\n int first = 0;\\n int last = list.size() - 1;\\n \\n // the binary search\\n while( first <= last )\\n {\\n \\tint middle = ( first + last ) >>> 1; // divide by 2\\n\\n if(list.get(middle).tid < tid){\\n \\tfirst = middle + 1; // the itemset compared is larger than the subset according to the lexical order\\n }\\n else if(list.get(middle).tid > tid){\\n \\tlast = middle - 1; // the itemset compared is smaller than the subset is smaller according to the lexical order\\n }\\n else{\\n \\treturn list.get(middle);\\n }\\n }\\n\\t\\treturn null;\\n\\t}\",\n \"public void test_findUniqueByProperty() {\\r\\n\\t\\tPerson person = (Person) this.persistenceService.findUniqueByProperty(Person.class, NAME_PROPERTY, NAME_PARAM[2]);\\r\\n\\t\\tassertForFindUniquePerson(person);\\r\\n\\t}\",\n \"private BTNode search(BTNode btNode, DataPair key) {\\n int i =0;\\n while (i < btNode.mCurrentKeyNum && key.compareTo(btNode.mKeys[i]) > 0)\\n i++;\\n\\n if (i < btNode.mCurrentKeyNum && key.compareTo(btNode.mKeys[i])==0)\\n return btNode;//btNode.mKeys[i];\\n if (btNode.mIsLeaf)\\n return null;\\n return search(btNode.mChildren[i],key);\\n }\",\n \"Kaiwa selectByPrimaryKey(String maht);\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"String getKey();\",\n \"private Node findKey(String key){\\n Node N = front;\\n while(N != null){\\n if(N.key.equals(key)){\\n return N; \\n }\\n else{\\n N = N.next; \\n }\\n }\\n return null;\\n }\",\n \"boolean has(String key);\",\n \"public int search (int[] db, int skey)\\n { \\n for (int i = 0; i < db.length; i++)\\n { \\n if (skey == db[i])\\n {\\n return i;\\n }\\n }\\n return -1;\\n }\",\n \"@Override\\r\\n\\tpublic boolean exists(T key) {\\r\\n\\t\\treturn existsRec(raiz, key);\\r\\n\\t}\",\n \"private ListNode find(K key) {\\r\\n\\t\\t\\tif (key == null) throw new NullPointerException();\\r\\n\\t\\t\\tListNode current = header;\\r\\n\\t\\t\\twhile (current != null) {\\r\\n\\t\\t\\t\\tif (current.key.equals(key)) return current;\\r\\n\\t\\t\\t\\tcurrent = current.next;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\treturn null;\\r\\n\\t\\t}\",\n \"public String findUserData(String login, String key);\",\n \"String getKey(Object entity);\",\n \"public V find (K key) throws KeyNotFoundException {\\n\\t\\treturn findKey(root, key);\\n\\t}\",\n \"T key();\",\n \"@Override\\n public boolean containsKey(Object key) {\\n LinkedList<Entry> tempBucket = chooseBucket(key);\\n \\n for(int i=0;i<tempBucket.size();i++) {\\n \\t\\tEntry tempEntry = tempBucket.get(i);\\n \\t\\t\\n \\t\\tif(tempEntry.getKey() == key) {\\n \\t\\t\\treturn true;\\n \\t\\t}\\n \\t}\\n \\n return false;\\n }\",\n \"boolean containsKey(K key);\",\n \"boolean containsKey(K key);\",\n \"public Object get(Object key) {\\n\\t\\tint index = key.hashCode() % SLOTS;\\n\\t\\t// check if key is already present in that slot/bucket.\\n\\t\\tfor(Pair p:table[index]) {\\n\\t\\t\\tif(key.equals(p.key))\\n\\t\\t\\t\\treturn p.value;\\n\\t\\t}\\n\\t\\t// if not found, return null\\n\\t\\treturn null;\\n\\t}\",\n \"public boolean contains(String key);\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6557548","0.643432","0.6391567","0.6365645","0.63271624","0.62824047","0.6248718","0.62012416","0.6187755","0.6091412","0.60801125","0.60783225","0.6019925","0.6017186","0.60071295","0.5949148","0.59168965","0.590516","0.5889019","0.58544356","0.5850748","0.58504003","0.5846398","0.58166367","0.5811134","0.58050877","0.58001983","0.57801753","0.57700527","0.5754542","0.5737355","0.5725294","0.56994325","0.56967604","0.5690346","0.56514287","0.5645431","0.5622744","0.56095856","0.5595444","0.5590188","0.5569931","0.5565742","0.55463564","0.55400485","0.5533375","0.5528807","0.55126166","0.5506231","0.54987705","0.5493664","0.5479118","0.5474766","0.5466993","0.54360306","0.5434999","0.5426315","0.5424639","0.54224426","0.5421154","0.5420269","0.5414533","0.5412998","0.5412998","0.5412998","0.5412998","0.5412998","0.5412998","0.5408697","0.5408657","0.5406584","0.5400865","0.5400679","0.53918445","0.5386191","0.5386191","0.5386191","0.5386191","0.5386191","0.5386191","0.5386191","0.5386191","0.5386191","0.5386191","0.5386191","0.5386191","0.5386191","0.53858477","0.5380723","0.53777474","0.5373163","0.5370162","0.53610617","0.5359053","0.53486764","0.5346942","0.5346161","0.5345456","0.5345456","0.5345237","0.53392893"],"string":"[\n \"0.6557548\",\n \"0.643432\",\n \"0.6391567\",\n \"0.6365645\",\n \"0.63271624\",\n \"0.62824047\",\n \"0.6248718\",\n \"0.62012416\",\n \"0.6187755\",\n \"0.6091412\",\n \"0.60801125\",\n \"0.60783225\",\n \"0.6019925\",\n \"0.6017186\",\n \"0.60071295\",\n \"0.5949148\",\n \"0.59168965\",\n \"0.590516\",\n \"0.5889019\",\n \"0.58544356\",\n \"0.5850748\",\n \"0.58504003\",\n \"0.5846398\",\n \"0.58166367\",\n \"0.5811134\",\n \"0.58050877\",\n \"0.58001983\",\n \"0.57801753\",\n \"0.57700527\",\n \"0.5754542\",\n \"0.5737355\",\n \"0.5725294\",\n \"0.56994325\",\n \"0.56967604\",\n \"0.5690346\",\n \"0.56514287\",\n \"0.5645431\",\n \"0.5622744\",\n \"0.56095856\",\n \"0.5595444\",\n \"0.5590188\",\n \"0.5569931\",\n \"0.5565742\",\n \"0.55463564\",\n \"0.55400485\",\n \"0.5533375\",\n \"0.5528807\",\n \"0.55126166\",\n \"0.5506231\",\n \"0.54987705\",\n \"0.5493664\",\n \"0.5479118\",\n \"0.5474766\",\n \"0.5466993\",\n \"0.54360306\",\n \"0.5434999\",\n \"0.5426315\",\n \"0.5424639\",\n \"0.54224426\",\n \"0.5421154\",\n \"0.5420269\",\n \"0.5414533\",\n \"0.5412998\",\n \"0.5412998\",\n \"0.5412998\",\n \"0.5412998\",\n \"0.5412998\",\n \"0.5412998\",\n \"0.5408697\",\n \"0.5408657\",\n \"0.5406584\",\n \"0.5400865\",\n \"0.5400679\",\n \"0.53918445\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.5386191\",\n \"0.53858477\",\n \"0.5380723\",\n \"0.53777474\",\n \"0.5373163\",\n \"0.5370162\",\n \"0.53610617\",\n \"0.5359053\",\n \"0.53486764\",\n \"0.5346942\",\n \"0.5346161\",\n \"0.5345456\",\n \"0.5345456\",\n \"0.5345237\",\n \"0.53392893\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":29396,"cells":{"query":{"kind":"string","value":"Constructor to call if output to console desired or DAG visual desired"},"document":{"kind":"string","value":"public OWLReasoner createReasoner(OWLOntology ontology, boolean verbose, boolean showGraph) {\n\t\treturn new DMTReasoner(ontology, verbose, showGraph);\n\t}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["public PrintStreamCommandOutput()\n {\n this( System.out );\n }","public OutputConsole() {\n initComponents();\n setSize (1520, 750);\n }","public NullPrintStream()\r\n\t{\r\n\t\tsuper(System.out);\r\n\t}","abstract void initiateConsole();","private CGraphInliner() {\n }","private Output() {}","public EventPrinter() {\n this(System.out);\n }","public Bach() {\n this(LOGGER, System.out::println);\n }","public AbstractCommand()\n {\n this.logger = new ConsoleLogger();\n }","public HelloWorldProgramOutput ()\n {\n initialize();\n }","public Console() {\n initComponents();\n }","private CommandLine() {\n\t}","public StdOutWriter ()\n {\n super (System.out, true);\n }","public Overview() {\n\t\t// It will work whenever i create object with using no parameter const\n\t\tSystem.out.println(\"This is constructor\");\n\t}","public PlotDrawer() {\n\n\t}","public ConsoleView() {\n\t\tcrapsControl = new CrapsControl();\n\t\tinput = new Scanner(System.in);\n\t}","private AbstractTerminal()\n\t{\n\t\tio = new SwingTextTerminal();\n\t}","public ConsoleView(GraphModel g) {\n this.graphModel = g;\n g.addObserver(this);\n }","public Main() {\n\t\tsuper();\n\t}","public StandardPipeline() {\n this(null);\n }","public Cli (BufferedReader in,PrintWriter out , Controller thecontroller) {\r\n\t\tsuper(thecontroller);\r\n\t\tthis.in=in;\r\n\t\tthis.out=out;\r\n\t\tthis.commandsSet= controller.getCommandSet();\r\n\t}","private Main() {\n\n super();\n }","public Main() {\n \n \n }","public IcsSystemConsoleDesignation(Connection connection, String encoding){\n super(connection, encoding);\n }","public CLI()\r\n\t{\r\n\t\t//lvl = new Level();\r\n\t\tthis.inputCommand = \"\";\r\n\t\t//this.exitStr = exitStr;\r\n\t\tin = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\r\n\t}","public Terminal() {\n initComponents();\n }","public Main() {\r\n\t}","public ABBOut() {}","public static void setup() {\n\t\toutputs.add(new Console.stdout());\n\t}","private void initializeConsole() {\n\t\tthis.hydraConsole = new HydraConsole(this.stage, this.commands);\n\t\tthis.splitPane.setBottomComponent(this.hydraConsole);\n\t}","private void initializeConsole()\n {\n final ConsolePrintStream consolePrintStream = new ConsolePrintStream(this.informationMessage);\n System.setOut(consolePrintStream.getPrintStream());\n }","public EnlightenedJavaPrinter() {\n\n }","public Console() {\n instance = this;\n\n this.setPrefViewportHeight(300);\n lb = new Label();\n lb.setWrapText(true);\n instance.setContent(lb);\n\n }","private AlgorithmRegistryCLI() {\n super();\n }","public TaskQueue(){\n this(\n new PrintWriter(System.out, true),\n new PrintWriter(System.err, true),\n DEFAULT_CONCURRENT_ACTIONS\n );\n }","@Override\n public void populateDAG(DAG dag, Configuration conf)\n {\n DummyOutputOperator combinedConsole = dag.addOperator(\"console\", new DummyOutputOperator());\n \n FileInputReaderWithShutDown inputOp = dag.addOperator(\"inputWordsReader\", new FileInputReaderWithShutDown());\n inputOp.setDirectory(\"/media/isha/apex-samples/sampleInput1\");\n dag.addStream(\"stream1\", inputOp.output, combinedConsole.input1);\n \n FileInputReaderWithoutShutDownException inputOp1 = dag.addOperator(\"inputTextReader1\", new FileInputReaderWithoutShutDownException());\n inputOp1.setDirectory(\"/media/isha/apex-samples/sampleInput2\");\n dag.addStream(\"stream2\", inputOp1.output, combinedConsole.input2);\n }","public Main() {\r\n }","public Main() {\r\n }","public LessCSSTask() {\n // empty\n }","public static void main(String[] args) {\n\t\t\r\n\t\tGraph g = new Graph();\r\n\t\tg.printData();\r\n\t\t\r\n\t}","public DecisionTrace() {\r\n\r\n\t}","public Connect4TextConsole(){\r\n this.board = new Connect4(); \r\n this.comp = new Connect4ComputerPlayer(this.board);\r\n }","public interface Console {\n\t//For know without description\n\t\n\t/**\n\t * Prints all information in XML src\n\t * @param src - document \n\t */\n\tpublic void startInfo(Document src);\n\t\n\t/**\n\t * Reading and printing inform. from console\n\t * @param str - string from console with request\n\t */\n\tpublic void readAndPrint(String str);\n\t\n\t/**\n\t * Starts listening InputStream in\n\t * @param in - in this program it's System.in\n\t */\n\n\tpublic void start(InputStream in, String path);\n\t\n\t/**\n\t * Printing all information about Node n\n\t * @param n\n\t */\n\tpublic void printNode(Node n);\n}","public Main() {\n }","public WalkingDistance() {\n this(ApplicationMode.CONSOLE);\n }","public PrintStreamCommandOutput( PrintStream output )\n {\n this( output, System.err );\n }","private Main ()\n {\n super ();\n }","public Example2() {\n\t\tSystem.out.println(\"Example2....\");\n\t}","public Main() {\n }","public Main() {\n }","public void prepare() {\r\n\t\tsuper.prepare();\r\n\t\tSystem.out.println(\" - Gather the grains\");\r\n\t\tSystem.out.println(\" - Shape into circles\");\r\n\t\tSystem.out.println(\" - Randomly color circles\");\r\n\t\tSystem.out.println(\" - Let circles dry\");\r\n\t}","public void createOutput() {\n\t\tsetOutput(new Output());\n\t}","com.lxd.protobuf.msg.result.console.Console.Console_ getConsole();","Mouse(){\n System.out.println(\"This is Mouse class.\");\n }","public ChessclubHelpConsoleDesignation(\n Connection connection, String encoding, boolean isConsoleCloseable) {\n super(connection, true, encoding, isConsoleCloseable);\n }","public Printer(){ }","private SimpleCLI(Options options) {\n this.options = options;\n }","public abstract void printPlan(Operator plan) throws OutputException;","public MyViewCLI(InputStreamReader in, OutputStreamWriter out, Controller controller) {\r\n\t\tcli = new CLI(in, out, controller);\r\n\t\tthis.controller = controller;\r\n\t}","public static void main(String[] args) {\n\t\tDirectedAcyclicGraph<String, DefaultEdge> dag = new DirectedAcyclicGraph<>(DefaultEdge.class);\r\n\t\t\r\n\t\t//Add some vertices to the DAG and display the contents\r\n\t\tdag.addVertex(\"1\");\r\n\t\tdag.addVertex(\"2\");\r\n\t\tdag.addVertex(\"3\");\r\n\t\tdag.addVertex(\"4\");\r\n\t\tSystem.out.println(dag.toString());\r\n\t\t\r\n\t\t//Properly use the addDagEdge() method and display the contents\r\n\t\ttry {\r\n\t\t\tdag.addDagEdge(\"1\", \"2\");\r\n\t\t\tdag.addDagEdge(\"2\", \"3\");\r\n\t\t\tdag.addDagEdge(\"3\", \"4\");\r\n\t\t} catch (CycleFoundException e) {\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t\tSystem.out.println(dag.toString());\r\n\t\t\r\n\t\t//Purposefully have addDagEdge() throw an exception\r\n\t\ttry {\r\n\t\t\tdag.addDagEdge(\"4\", \"1\");\r\n\t\t} catch (CycleFoundException e) {\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t\t\r\n\t\t//Display the contents of the DAG\r\n\t\tSystem.out.println(dag.toString());\r\n\t\t\r\n\t\t//Acknowledge that the addEdge() method can work without a try-catch block\r\n\t\tdag.addEdge(\"2\", \"4\");\r\n\t\t\r\n\t\t//Display the contents of the DAG\r\n\t\tSystem.out.println(dag.toString());\r\n\t\t\r\n\t\t//Show that addEdge() throws an IllegalArgumentException when used improperly\r\n\t\ttry {\r\n\t\t\tdag.addEdge(\"4\", \"1\");\r\n\t\t} catch (IllegalArgumentException e) {\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t\t\r\n\t\t//Remove \"4\" from the DAG and display the contents\r\n\t\tdag.removeVertex(\"4\");\r\n\t\tSystem.out.println(dag.toString());\r\n\t\t\r\n\t\t//Add \"4\" and \"5\" and associated edges (3, 4) and (3, 5)\r\n\t\tdag.addVertex(\"4\");\r\n\t\tdag.addVertex(\"5\");\r\n\t\ttry {\r\n\t\t\tdag.addDagEdge(\"3\", \"4\");\r\n\t\t\tdag.addDagEdge(\"3\", \"5\");\r\n\t\t} catch (CycleFoundException e) {\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t\t\r\n\t\t//Display the ancestors of \"4\"\r\n\t\tSystem.out.println(dag.getAncestors(dag, \"4\").toString());\r\n\t\t\r\n\t\t//Display the descendants of \"2\"\r\n\t\tSystem.out.println(dag.getDescendants(dag, \"2\").toString());\r\n\t}","public yyAnim (String title, int io) { this(System.class, title, io); }","ConstructorPractice () {\n\t\tSystem.out.println(\"Default Constructor\");\n\t}","Output createOutput();","public Main() {}","public Plot() {\r\n }","Car()\r\n\t{\r\n\t\tSystem.out.println(\"hello\");\r\n\t}","public Main() {\r\n\t\tsuper();\r\n\t\tinitialize();\r\n\r\n\t}","public Panel03Console() {\n System.out.println(\"Panel03 ConsolePanel()\");\n initComponents();\n super.setPreferredSize(new Dimension(CONSOLE_WIDTH, CONSOLE_HEIGHT));\n }","void visualize(Object o) {\n\t\tif (o == null) {\n\t\t\to = new NullObject();\n\t\t}\n\n\t\tScratch scratch = scratchFactory.create(o);\n\t\tscratch.addCSSClass(\"printOut\");\n\n\t\tvisualizeScratch(scratch);\n\t}","protected Plot() {\r\n }","public FlowNodeInstance() {\n\t}","public StateVisualizer() {\r\n }","public AbstractCar(String car){\n\t\n\tSystem.out.println(\"\\n\\n The following are the details for : \" + car);\n}","public RoutingResourceGraph() {\n ex = new RunGraph(3,2);\n squares = new JLabel[ex.getGraphSize()][ex.getGraphSize()];\n squares_sinks = new JLabel[ex.getGraphSize()][ex.getGraphSize()];\n squares_wires = new JLabel[2 * ex.getGraphSize() * ex.getGraphSize()][ex.getWireSize()];\n switches = new JToggleButton[ex.getGraphSize()][ex.getGraphSize()];\n ex.initialize();\n initComponents();\n initialize();\n add_edge();\n ex.find_shortest_path();\n showCong();\n showGraph();\n }","public XMLOutputter() {\r\n }","private ColorWithConstructor() {\n\t\tSystem.out.println(\"Constructor called for : \" + this.toString());\n\t}","public CLI(String inputCommand)\r\n\t{\r\n\t\t//lvl = new Level();\r\n\t\tthis.inputCommand = inputCommand;\r\n\t\tin = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\r\n\t}","private static void consoleOutput() {\n\n Output airportFlightCounter = new AirportFlightCounter(airports);\n Output flightInventory = new FlightInventory(flights);\n Output flightPassengerCounter = new FlightPassengerCounter(flights);\n Output mileageCounter = new MileageCounter(flights, airports);\n\n airportFlightCounter.toConsole();\n flightInventory.toConsole();\n flightPassengerCounter.toConsole();\n mileageCounter.toConsole();\n }","protected ConsoleHandler() {\n super();\n setConsole(System.err);\n setFormatter(LOG_FORMATTER);\n setLevel(DEFAULT_LEVEL);\n }","public Main() {\n // Required empty public constructor\n }","private ConsoleUtils(String name) {\n instance = this;\n fConsole = new IOConsole(\"Mobius\" + name + \" Console\", EImages.TOOL.getDescriptor());\n fConsole.activate();\n ConsolePlugin.getDefault().getConsoleManager().addConsoles(new IConsole[]{fConsole});\n final Display display = PlatformUI.getWorkbench().getDisplay();\n fRed = new Color(display, RED);\n fBlue = new Color(display, BLUE);\n fPurple = new Color(display, PURPLE);\n fBlack = new Color(display, BLACK);\n }","public void init()\n {\n _appContext = SubAppContext.createOMM(System.out);\n _serviceName = CommandLine.variable(\"serviceName\");\n initGUI();\n }","public Calculator() {\r\n\t\t/*\r\n\t\t * Constructor - Method name which has the same class name is called a Consatructor\r\n\t\t */\r\n\t\tSystem.out.println(\"Calling constructor\");\r\n\t}","public abstract void debug(PrintStream console);","public SystemLog () {\r\n\t\tsuper();\r\n\t}","public NewCommand(ApplicationData data) {\n super(\"NewCommand\");\n this.data = data;\n // configure log4j using resource URL APF-548\n DOMConfigurator.configure(getClass().getResource(\"/META-INF/log4j.xml\"));\n log = getLogger(NewCommand.class);\n\n }","public NGATAstro()\n\t{\n\t\tsuper();\n\t\tlogger = LogManager.getLogger(this);\n\t\tinitialiseLoggerReference(logger);\n\t}","public GoalViewer()\r\n/* 25: */ {\r\n/* 26: 28 */ setBorder(BorderFactory.createLineBorder(Color.BLACK));\r\n/* 27: */ }","public DepthFirst(Graph g,JTextArea output) {\n\t\tsuper();\n\t\tthis.g=g;\n\t\tthis.output=output;\n\t\tthis.output.setText(\"\");\n\n\t}","protected MethodCallPrinter()\n {\n }","private Shell() { }","public VectorOutput () { }","public BootstrapInstrumentor(PrintWriter w) {\n this.w = w;\n }","public Controller() {\n\t\tdoResidu = false;\n\t\tdoTime = false;\n\t\tdoReference = false;\n\t\tdoConstraint = false;\n\t\ttimeStarting = System.nanoTime();\n\t\t\n\t\tsetPath(Files.getWorkingDirectory());\n\t\tsetSystem(true);\n\t\tsetMultithreading(true);\n\t\tsetDisplayFinal(true);\n\t\tsetFFT(FFT.getFastestFFT().getDefaultFFT());\n\t\tsetNormalizationPSF(1);\n\t\tsetEpsilon(1e-6);\n\t\tsetPadding(new Padding());\n\t\tsetApodization(new Apodization());\n\n\t\tmonitors = new Monitors();\n\t\tmonitors.add(new ConsoleMonitor());\n\t\tmonitors.add(new TableMonitor(Constants.widthGUI, 240));\n\n\t\tsetVerbose(Verbose.Log);\n\t\tsetStats(new Stats(Stats.Mode.NO));\n\t\tsetConstraint(Constraint.Mode.NO);\n\t\tsetResiduMin(-1);\n\t\tsetTimeLimit(-1);\n\t\tsetReference(null);\n\t\tsetOuts(new ArrayList<Output>());\n\t}","public StackAnalysesView() {\n\t\tsuper(\"Stack Analyses\");\n\t\tinternalBrowser = new InternalBrowser(new DefaultShell());\n\t}","public HtShowDetailedLog() {\n\t}","public void setOut(PrintStream out);","private Log()\n {\n //Hides implicit constructor.\n }","public Output(Input input)\n {\n outputHelper = new OutputHelper();\n setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\n add(outputHelper);\n setSize(Constants.WIDTH, Constants.HEIGHT);\n setVisible(true);\n addMouseListener(input);\n addMouseMotionListener(input);\n addKeyListener(input);\n }","public ConsoleOutputWrapper() {\n fCurrent = ConsoleUtils.getDefault().getConsole();\n }","public CLI(BufferedReader in, Writer out) {\n\t\t_in = in;\n\t\t_out = out;\n\t}"],"string":"[\n \"public PrintStreamCommandOutput()\\n {\\n this( System.out );\\n }\",\n \"public OutputConsole() {\\n initComponents();\\n setSize (1520, 750);\\n }\",\n \"public NullPrintStream()\\r\\n\\t{\\r\\n\\t\\tsuper(System.out);\\r\\n\\t}\",\n \"abstract void initiateConsole();\",\n \"private CGraphInliner() {\\n }\",\n \"private Output() {}\",\n \"public EventPrinter() {\\n this(System.out);\\n }\",\n \"public Bach() {\\n this(LOGGER, System.out::println);\\n }\",\n \"public AbstractCommand()\\n {\\n this.logger = new ConsoleLogger();\\n }\",\n \"public HelloWorldProgramOutput ()\\n {\\n initialize();\\n }\",\n \"public Console() {\\n initComponents();\\n }\",\n \"private CommandLine() {\\n\\t}\",\n \"public StdOutWriter ()\\n {\\n super (System.out, true);\\n }\",\n \"public Overview() {\\n\\t\\t// It will work whenever i create object with using no parameter const\\n\\t\\tSystem.out.println(\\\"This is constructor\\\");\\n\\t}\",\n \"public PlotDrawer() {\\n\\n\\t}\",\n \"public ConsoleView() {\\n\\t\\tcrapsControl = new CrapsControl();\\n\\t\\tinput = new Scanner(System.in);\\n\\t}\",\n \"private AbstractTerminal()\\n\\t{\\n\\t\\tio = new SwingTextTerminal();\\n\\t}\",\n \"public ConsoleView(GraphModel g) {\\n this.graphModel = g;\\n g.addObserver(this);\\n }\",\n \"public Main() {\\n\\t\\tsuper();\\n\\t}\",\n \"public StandardPipeline() {\\n this(null);\\n }\",\n \"public Cli (BufferedReader in,PrintWriter out , Controller thecontroller) {\\r\\n\\t\\tsuper(thecontroller);\\r\\n\\t\\tthis.in=in;\\r\\n\\t\\tthis.out=out;\\r\\n\\t\\tthis.commandsSet= controller.getCommandSet();\\r\\n\\t}\",\n \"private Main() {\\n\\n super();\\n }\",\n \"public Main() {\\n \\n \\n }\",\n \"public IcsSystemConsoleDesignation(Connection connection, String encoding){\\n super(connection, encoding);\\n }\",\n \"public CLI()\\r\\n\\t{\\r\\n\\t\\t//lvl = new Level();\\r\\n\\t\\tthis.inputCommand = \\\"\\\";\\r\\n\\t\\t//this.exitStr = exitStr;\\r\\n\\t\\tin = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\\r\\n\\t}\",\n \"public Terminal() {\\n initComponents();\\n }\",\n \"public Main() {\\r\\n\\t}\",\n \"public ABBOut() {}\",\n \"public static void setup() {\\n\\t\\toutputs.add(new Console.stdout());\\n\\t}\",\n \"private void initializeConsole() {\\n\\t\\tthis.hydraConsole = new HydraConsole(this.stage, this.commands);\\n\\t\\tthis.splitPane.setBottomComponent(this.hydraConsole);\\n\\t}\",\n \"private void initializeConsole()\\n {\\n final ConsolePrintStream consolePrintStream = new ConsolePrintStream(this.informationMessage);\\n System.setOut(consolePrintStream.getPrintStream());\\n }\",\n \"public EnlightenedJavaPrinter() {\\n\\n }\",\n \"public Console() {\\n instance = this;\\n\\n this.setPrefViewportHeight(300);\\n lb = new Label();\\n lb.setWrapText(true);\\n instance.setContent(lb);\\n\\n }\",\n \"private AlgorithmRegistryCLI() {\\n super();\\n }\",\n \"public TaskQueue(){\\n this(\\n new PrintWriter(System.out, true),\\n new PrintWriter(System.err, true),\\n DEFAULT_CONCURRENT_ACTIONS\\n );\\n }\",\n \"@Override\\n public void populateDAG(DAG dag, Configuration conf)\\n {\\n DummyOutputOperator combinedConsole = dag.addOperator(\\\"console\\\", new DummyOutputOperator());\\n \\n FileInputReaderWithShutDown inputOp = dag.addOperator(\\\"inputWordsReader\\\", new FileInputReaderWithShutDown());\\n inputOp.setDirectory(\\\"/media/isha/apex-samples/sampleInput1\\\");\\n dag.addStream(\\\"stream1\\\", inputOp.output, combinedConsole.input1);\\n \\n FileInputReaderWithoutShutDownException inputOp1 = dag.addOperator(\\\"inputTextReader1\\\", new FileInputReaderWithoutShutDownException());\\n inputOp1.setDirectory(\\\"/media/isha/apex-samples/sampleInput2\\\");\\n dag.addStream(\\\"stream2\\\", inputOp1.output, combinedConsole.input2);\\n }\",\n \"public Main() {\\r\\n }\",\n \"public Main() {\\r\\n }\",\n \"public LessCSSTask() {\\n // empty\\n }\",\n \"public static void main(String[] args) {\\n\\t\\t\\r\\n\\t\\tGraph g = new Graph();\\r\\n\\t\\tg.printData();\\r\\n\\t\\t\\r\\n\\t}\",\n \"public DecisionTrace() {\\r\\n\\r\\n\\t}\",\n \"public Connect4TextConsole(){\\r\\n this.board = new Connect4(); \\r\\n this.comp = new Connect4ComputerPlayer(this.board);\\r\\n }\",\n \"public interface Console {\\n\\t//For know without description\\n\\t\\n\\t/**\\n\\t * Prints all information in XML src\\n\\t * @param src - document \\n\\t */\\n\\tpublic void startInfo(Document src);\\n\\t\\n\\t/**\\n\\t * Reading and printing inform. from console\\n\\t * @param str - string from console with request\\n\\t */\\n\\tpublic void readAndPrint(String str);\\n\\t\\n\\t/**\\n\\t * Starts listening InputStream in\\n\\t * @param in - in this program it's System.in\\n\\t */\\n\\n\\tpublic void start(InputStream in, String path);\\n\\t\\n\\t/**\\n\\t * Printing all information about Node n\\n\\t * @param n\\n\\t */\\n\\tpublic void printNode(Node n);\\n}\",\n \"public Main() {\\n }\",\n \"public WalkingDistance() {\\n this(ApplicationMode.CONSOLE);\\n }\",\n \"public PrintStreamCommandOutput( PrintStream output )\\n {\\n this( output, System.err );\\n }\",\n \"private Main ()\\n {\\n super ();\\n }\",\n \"public Example2() {\\n\\t\\tSystem.out.println(\\\"Example2....\\\");\\n\\t}\",\n \"public Main() {\\n }\",\n \"public Main() {\\n }\",\n \"public void prepare() {\\r\\n\\t\\tsuper.prepare();\\r\\n\\t\\tSystem.out.println(\\\" - Gather the grains\\\");\\r\\n\\t\\tSystem.out.println(\\\" - Shape into circles\\\");\\r\\n\\t\\tSystem.out.println(\\\" - Randomly color circles\\\");\\r\\n\\t\\tSystem.out.println(\\\" - Let circles dry\\\");\\r\\n\\t}\",\n \"public void createOutput() {\\n\\t\\tsetOutput(new Output());\\n\\t}\",\n \"com.lxd.protobuf.msg.result.console.Console.Console_ getConsole();\",\n \"Mouse(){\\n System.out.println(\\\"This is Mouse class.\\\");\\n }\",\n \"public ChessclubHelpConsoleDesignation(\\n Connection connection, String encoding, boolean isConsoleCloseable) {\\n super(connection, true, encoding, isConsoleCloseable);\\n }\",\n \"public Printer(){ }\",\n \"private SimpleCLI(Options options) {\\n this.options = options;\\n }\",\n \"public abstract void printPlan(Operator plan) throws OutputException;\",\n \"public MyViewCLI(InputStreamReader in, OutputStreamWriter out, Controller controller) {\\r\\n\\t\\tcli = new CLI(in, out, controller);\\r\\n\\t\\tthis.controller = controller;\\r\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tDirectedAcyclicGraph<String, DefaultEdge> dag = new DirectedAcyclicGraph<>(DefaultEdge.class);\\r\\n\\t\\t\\r\\n\\t\\t//Add some vertices to the DAG and display the contents\\r\\n\\t\\tdag.addVertex(\\\"1\\\");\\r\\n\\t\\tdag.addVertex(\\\"2\\\");\\r\\n\\t\\tdag.addVertex(\\\"3\\\");\\r\\n\\t\\tdag.addVertex(\\\"4\\\");\\r\\n\\t\\tSystem.out.println(dag.toString());\\r\\n\\t\\t\\r\\n\\t\\t//Properly use the addDagEdge() method and display the contents\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tdag.addDagEdge(\\\"1\\\", \\\"2\\\");\\r\\n\\t\\t\\tdag.addDagEdge(\\\"2\\\", \\\"3\\\");\\r\\n\\t\\t\\tdag.addDagEdge(\\\"3\\\", \\\"4\\\");\\r\\n\\t\\t} catch (CycleFoundException e) {\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t\\tSystem.out.println(dag.toString());\\r\\n\\t\\t\\r\\n\\t\\t//Purposefully have addDagEdge() throw an exception\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tdag.addDagEdge(\\\"4\\\", \\\"1\\\");\\r\\n\\t\\t} catch (CycleFoundException e) {\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t//Display the contents of the DAG\\r\\n\\t\\tSystem.out.println(dag.toString());\\r\\n\\t\\t\\r\\n\\t\\t//Acknowledge that the addEdge() method can work without a try-catch block\\r\\n\\t\\tdag.addEdge(\\\"2\\\", \\\"4\\\");\\r\\n\\t\\t\\r\\n\\t\\t//Display the contents of the DAG\\r\\n\\t\\tSystem.out.println(dag.toString());\\r\\n\\t\\t\\r\\n\\t\\t//Show that addEdge() throws an IllegalArgumentException when used improperly\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tdag.addEdge(\\\"4\\\", \\\"1\\\");\\r\\n\\t\\t} catch (IllegalArgumentException e) {\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t//Remove \\\"4\\\" from the DAG and display the contents\\r\\n\\t\\tdag.removeVertex(\\\"4\\\");\\r\\n\\t\\tSystem.out.println(dag.toString());\\r\\n\\t\\t\\r\\n\\t\\t//Add \\\"4\\\" and \\\"5\\\" and associated edges (3, 4) and (3, 5)\\r\\n\\t\\tdag.addVertex(\\\"4\\\");\\r\\n\\t\\tdag.addVertex(\\\"5\\\");\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tdag.addDagEdge(\\\"3\\\", \\\"4\\\");\\r\\n\\t\\t\\tdag.addDagEdge(\\\"3\\\", \\\"5\\\");\\r\\n\\t\\t} catch (CycleFoundException e) {\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t//Display the ancestors of \\\"4\\\"\\r\\n\\t\\tSystem.out.println(dag.getAncestors(dag, \\\"4\\\").toString());\\r\\n\\t\\t\\r\\n\\t\\t//Display the descendants of \\\"2\\\"\\r\\n\\t\\tSystem.out.println(dag.getDescendants(dag, \\\"2\\\").toString());\\r\\n\\t}\",\n \"public yyAnim (String title, int io) { this(System.class, title, io); }\",\n \"ConstructorPractice () {\\n\\t\\tSystem.out.println(\\\"Default Constructor\\\");\\n\\t}\",\n \"Output createOutput();\",\n \"public Main() {}\",\n \"public Plot() {\\r\\n }\",\n \"Car()\\r\\n\\t{\\r\\n\\t\\tSystem.out.println(\\\"hello\\\");\\r\\n\\t}\",\n \"public Main() {\\r\\n\\t\\tsuper();\\r\\n\\t\\tinitialize();\\r\\n\\r\\n\\t}\",\n \"public Panel03Console() {\\n System.out.println(\\\"Panel03 ConsolePanel()\\\");\\n initComponents();\\n super.setPreferredSize(new Dimension(CONSOLE_WIDTH, CONSOLE_HEIGHT));\\n }\",\n \"void visualize(Object o) {\\n\\t\\tif (o == null) {\\n\\t\\t\\to = new NullObject();\\n\\t\\t}\\n\\n\\t\\tScratch scratch = scratchFactory.create(o);\\n\\t\\tscratch.addCSSClass(\\\"printOut\\\");\\n\\n\\t\\tvisualizeScratch(scratch);\\n\\t}\",\n \"protected Plot() {\\r\\n }\",\n \"public FlowNodeInstance() {\\n\\t}\",\n \"public StateVisualizer() {\\r\\n }\",\n \"public AbstractCar(String car){\\n\\t\\n\\tSystem.out.println(\\\"\\\\n\\\\n The following are the details for : \\\" + car);\\n}\",\n \"public RoutingResourceGraph() {\\n ex = new RunGraph(3,2);\\n squares = new JLabel[ex.getGraphSize()][ex.getGraphSize()];\\n squares_sinks = new JLabel[ex.getGraphSize()][ex.getGraphSize()];\\n squares_wires = new JLabel[2 * ex.getGraphSize() * ex.getGraphSize()][ex.getWireSize()];\\n switches = new JToggleButton[ex.getGraphSize()][ex.getGraphSize()];\\n ex.initialize();\\n initComponents();\\n initialize();\\n add_edge();\\n ex.find_shortest_path();\\n showCong();\\n showGraph();\\n }\",\n \"public XMLOutputter() {\\r\\n }\",\n \"private ColorWithConstructor() {\\n\\t\\tSystem.out.println(\\\"Constructor called for : \\\" + this.toString());\\n\\t}\",\n \"public CLI(String inputCommand)\\r\\n\\t{\\r\\n\\t\\t//lvl = new Level();\\r\\n\\t\\tthis.inputCommand = inputCommand;\\r\\n\\t\\tin = new Scanner(new BufferedReader(new InputStreamReader(System.in)));\\r\\n\\t}\",\n \"private static void consoleOutput() {\\n\\n Output airportFlightCounter = new AirportFlightCounter(airports);\\n Output flightInventory = new FlightInventory(flights);\\n Output flightPassengerCounter = new FlightPassengerCounter(flights);\\n Output mileageCounter = new MileageCounter(flights, airports);\\n\\n airportFlightCounter.toConsole();\\n flightInventory.toConsole();\\n flightPassengerCounter.toConsole();\\n mileageCounter.toConsole();\\n }\",\n \"protected ConsoleHandler() {\\n super();\\n setConsole(System.err);\\n setFormatter(LOG_FORMATTER);\\n setLevel(DEFAULT_LEVEL);\\n }\",\n \"public Main() {\\n // Required empty public constructor\\n }\",\n \"private ConsoleUtils(String name) {\\n instance = this;\\n fConsole = new IOConsole(\\\"Mobius\\\" + name + \\\" Console\\\", EImages.TOOL.getDescriptor());\\n fConsole.activate();\\n ConsolePlugin.getDefault().getConsoleManager().addConsoles(new IConsole[]{fConsole});\\n final Display display = PlatformUI.getWorkbench().getDisplay();\\n fRed = new Color(display, RED);\\n fBlue = new Color(display, BLUE);\\n fPurple = new Color(display, PURPLE);\\n fBlack = new Color(display, BLACK);\\n }\",\n \"public void init()\\n {\\n _appContext = SubAppContext.createOMM(System.out);\\n _serviceName = CommandLine.variable(\\\"serviceName\\\");\\n initGUI();\\n }\",\n \"public Calculator() {\\r\\n\\t\\t/*\\r\\n\\t\\t * Constructor - Method name which has the same class name is called a Consatructor\\r\\n\\t\\t */\\r\\n\\t\\tSystem.out.println(\\\"Calling constructor\\\");\\r\\n\\t}\",\n \"public abstract void debug(PrintStream console);\",\n \"public SystemLog () {\\r\\n\\t\\tsuper();\\r\\n\\t}\",\n \"public NewCommand(ApplicationData data) {\\n super(\\\"NewCommand\\\");\\n this.data = data;\\n // configure log4j using resource URL APF-548\\n DOMConfigurator.configure(getClass().getResource(\\\"/META-INF/log4j.xml\\\"));\\n log = getLogger(NewCommand.class);\\n\\n }\",\n \"public NGATAstro()\\n\\t{\\n\\t\\tsuper();\\n\\t\\tlogger = LogManager.getLogger(this);\\n\\t\\tinitialiseLoggerReference(logger);\\n\\t}\",\n \"public GoalViewer()\\r\\n/* 25: */ {\\r\\n/* 26: 28 */ setBorder(BorderFactory.createLineBorder(Color.BLACK));\\r\\n/* 27: */ }\",\n \"public DepthFirst(Graph g,JTextArea output) {\\n\\t\\tsuper();\\n\\t\\tthis.g=g;\\n\\t\\tthis.output=output;\\n\\t\\tthis.output.setText(\\\"\\\");\\n\\n\\t}\",\n \"protected MethodCallPrinter()\\n {\\n }\",\n \"private Shell() { }\",\n \"public VectorOutput () { }\",\n \"public BootstrapInstrumentor(PrintWriter w) {\\n this.w = w;\\n }\",\n \"public Controller() {\\n\\t\\tdoResidu = false;\\n\\t\\tdoTime = false;\\n\\t\\tdoReference = false;\\n\\t\\tdoConstraint = false;\\n\\t\\ttimeStarting = System.nanoTime();\\n\\t\\t\\n\\t\\tsetPath(Files.getWorkingDirectory());\\n\\t\\tsetSystem(true);\\n\\t\\tsetMultithreading(true);\\n\\t\\tsetDisplayFinal(true);\\n\\t\\tsetFFT(FFT.getFastestFFT().getDefaultFFT());\\n\\t\\tsetNormalizationPSF(1);\\n\\t\\tsetEpsilon(1e-6);\\n\\t\\tsetPadding(new Padding());\\n\\t\\tsetApodization(new Apodization());\\n\\n\\t\\tmonitors = new Monitors();\\n\\t\\tmonitors.add(new ConsoleMonitor());\\n\\t\\tmonitors.add(new TableMonitor(Constants.widthGUI, 240));\\n\\n\\t\\tsetVerbose(Verbose.Log);\\n\\t\\tsetStats(new Stats(Stats.Mode.NO));\\n\\t\\tsetConstraint(Constraint.Mode.NO);\\n\\t\\tsetResiduMin(-1);\\n\\t\\tsetTimeLimit(-1);\\n\\t\\tsetReference(null);\\n\\t\\tsetOuts(new ArrayList<Output>());\\n\\t}\",\n \"public StackAnalysesView() {\\n\\t\\tsuper(\\\"Stack Analyses\\\");\\n\\t\\tinternalBrowser = new InternalBrowser(new DefaultShell());\\n\\t}\",\n \"public HtShowDetailedLog() {\\n\\t}\",\n \"public void setOut(PrintStream out);\",\n \"private Log()\\n {\\n //Hides implicit constructor.\\n }\",\n \"public Output(Input input)\\n {\\n outputHelper = new OutputHelper();\\n setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\\n add(outputHelper);\\n setSize(Constants.WIDTH, Constants.HEIGHT);\\n setVisible(true);\\n addMouseListener(input);\\n addMouseMotionListener(input);\\n addKeyListener(input);\\n }\",\n \"public ConsoleOutputWrapper() {\\n fCurrent = ConsoleUtils.getDefault().getConsole();\\n }\",\n \"public CLI(BufferedReader in, Writer out) {\\n\\t\\t_in = in;\\n\\t\\t_out = out;\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6333759","0.6127229","0.6077421","0.60292816","0.5983578","0.59658235","0.5913372","0.58349746","0.5833874","0.5833127","0.5796187","0.57904845","0.57721853","0.5746298","0.57434523","0.5726681","0.5707729","0.5701344","0.56994724","0.56431377","0.55765367","0.55451024","0.5544818","0.554125","0.5529355","0.55199575","0.551071","0.5503881","0.54958344","0.5483733","0.54612654","0.54456633","0.5445081","0.5442437","0.54348207","0.5429681","0.5419993","0.5419993","0.5412625","0.54051316","0.54021347","0.53657806","0.5364082","0.5362689","0.5358805","0.5351668","0.5323397","0.53167063","0.5315601","0.5315601","0.53123486","0.5305322","0.52792853","0.5276636","0.5276259","0.52672875","0.5261834","0.52603275","0.5253799","0.5253126","0.52508956","0.5241535","0.5240586","0.5233245","0.52291137","0.52236146","0.5220771","0.52198744","0.5218945","0.52187324","0.5217959","0.5199332","0.51958764","0.51926655","0.51782054","0.51735747","0.51671624","0.5163603","0.5163224","0.51585126","0.5155879","0.51558435","0.5154405","0.5145911","0.5145286","0.5143396","0.51427823","0.51402354","0.5130067","0.5129732","0.5113065","0.51125634","0.51101923","0.5091926","0.5086845","0.5082865","0.5079263","0.5076887","0.50696385","0.50663316","0.506613"],"string":"[\n \"0.6333759\",\n \"0.6127229\",\n \"0.6077421\",\n \"0.60292816\",\n \"0.5983578\",\n \"0.59658235\",\n \"0.5913372\",\n \"0.58349746\",\n \"0.5833874\",\n \"0.5833127\",\n \"0.5796187\",\n \"0.57904845\",\n \"0.57721853\",\n \"0.5746298\",\n \"0.57434523\",\n \"0.5726681\",\n \"0.5707729\",\n \"0.5701344\",\n \"0.56994724\",\n \"0.56431377\",\n \"0.55765367\",\n \"0.55451024\",\n \"0.5544818\",\n \"0.554125\",\n \"0.5529355\",\n \"0.55199575\",\n \"0.551071\",\n \"0.5503881\",\n \"0.54958344\",\n \"0.5483733\",\n \"0.54612654\",\n \"0.54456633\",\n \"0.5445081\",\n \"0.5442437\",\n \"0.54348207\",\n \"0.5429681\",\n \"0.5419993\",\n \"0.5419993\",\n \"0.5412625\",\n \"0.54051316\",\n \"0.54021347\",\n \"0.53657806\",\n \"0.5364082\",\n \"0.5362689\",\n \"0.5358805\",\n \"0.5351668\",\n \"0.5323397\",\n \"0.53167063\",\n \"0.5315601\",\n \"0.5315601\",\n \"0.53123486\",\n \"0.5305322\",\n \"0.52792853\",\n \"0.5276636\",\n \"0.5276259\",\n \"0.52672875\",\n \"0.5261834\",\n \"0.52603275\",\n \"0.5253799\",\n \"0.5253126\",\n \"0.52508956\",\n \"0.5241535\",\n \"0.5240586\",\n \"0.5233245\",\n \"0.52291137\",\n \"0.52236146\",\n \"0.5220771\",\n \"0.52198744\",\n \"0.5218945\",\n \"0.52187324\",\n \"0.5217959\",\n \"0.5199332\",\n \"0.51958764\",\n \"0.51926655\",\n \"0.51782054\",\n \"0.51735747\",\n \"0.51671624\",\n \"0.5163603\",\n \"0.5163224\",\n \"0.51585126\",\n \"0.5155879\",\n \"0.51558435\",\n \"0.5154405\",\n \"0.5145911\",\n \"0.5145286\",\n \"0.5143396\",\n \"0.51427823\",\n \"0.51402354\",\n \"0.5130067\",\n \"0.5129732\",\n \"0.5113065\",\n \"0.51125634\",\n \"0.51101923\",\n \"0.5091926\",\n \"0.5086845\",\n \"0.5082865\",\n \"0.5079263\",\n \"0.5076887\",\n \"0.50696385\",\n \"0.50663316\",\n \"0.506613\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":29397,"cells":{"query":{"kind":"string","value":"Costruttore per un'istanza RuleParser"},"document":{"kind":"string","value":"public RuleParser() {\n this.fileName = \"\";\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["Rule createRule();","Rule createRule();","Rule createRule();","public interface ValidParserRules {\n String getName();\n String getPrefix();\n PropertyType getType();\n ValidParserRules getParent();\n}","Rule getRule();","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }","@Override public ParserRule getRule() { return rule; }"],"string":"[\n \"Rule createRule();\",\n \"Rule createRule();\",\n \"Rule createRule();\",\n \"public interface ValidParserRules {\\n String getName();\\n String getPrefix();\\n PropertyType getType();\\n ValidParserRules getParent();\\n}\",\n \"Rule getRule();\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\",\n \"@Override public ParserRule getRule() { return rule; }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.62157726","0.62157726","0.62157726","0.62084335","0.60326684","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5987451","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146","0.5952146"],"string":"[\n \"0.62157726\",\n \"0.62157726\",\n \"0.62157726\",\n \"0.62084335\",\n \"0.60326684\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5987451\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\",\n \"0.5952146\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.60495967"},"document_rank":{"kind":"string","value":"4"}}},{"rowIdx":29398,"cells":{"query":{"kind":"string","value":"Permette di specificare il percorso del file da cui estrarre le regole"},"document":{"kind":"string","value":"public void setUp(String fileName) {\n this.fileName = fileName;\n this.timer = new MyTimer(\"TimerThread\");\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["public void armarPreguntas(){\n preguntas = file.listaPreguntas(\"Preguntas.txt\");\n }","public void showFile() throws FileNotFoundException, IOException{\r\n ArrayList<String> arxiu = new ArrayList<>();\r\n \r\n BufferedReader br = new BufferedReader(new FileReader(fitxerUsuaris));\r\n \r\n String usuari;\r\n \r\n while((usuari = br.readLine()) != null){\r\n arxiu.add(usuari);\r\n }\r\n \r\n for (int i = 0; i < arxiu.size(); i++) {\r\n System.out.println(arxiu.get(i));\r\n }\r\n }","public void seleccionarFichero(){\n JFileChooser fileChooser = new JFileChooser();\n FileNameExtensionFilter filter = new FileNameExtensionFilter(\"xml\", \"xml\");\n fileChooser.setFileFilter(filter);\n fileChooser.setCurrentDirectory(new java.io.File(\"./ficheros\"));\n int seleccion = fileChooser.showOpenDialog(vista_principal);\n if (seleccion == JFileChooser.APPROVE_OPTION){\n fichero = fileChooser.getSelectedFile();\n vista_principal.getTxtfield_nombre_fichero().\n setText(fichero.getName().substring(0, fichero.getName().length()-4));\n }\n }","private void abrirFichero() {\r\n\t\tJFileChooser abrir = new JFileChooser();\r\n\t\tFileNameExtensionFilter filtro = new FileNameExtensionFilter(\"obj\",\"obj\");\r\n\t\tabrir.setFileFilter(filtro);\r\n\t\tif(abrir.showOpenDialog(abrir) == JFileChooser.APPROVE_OPTION){\r\n\t\t\ttry {\r\n\t\t\t\tGestion.liga = (Liga) Gestion.abrir(abrir.getSelectedFile());\r\n\t\t\t\tGestion.setAbierto(true);\r\n\t\t\t\tGestion.setFichero(abrir.getSelectedFile());\r\n\t\t\t\tGestion.setModificado(false);\r\n\t\t\t\tfrmLigaDeFtbol.setTitle(Gestion.getFichero().getName());\r\n\t\t\t} catch (ClassNotFoundException | IOException e) {\r\n\t\t\t\tJOptionPane.showMessageDialog(null, \"No se ha podido abrir el fichero\", \"Error\", JOptionPane.ERROR_MESSAGE);\r\n\t\t\t}\r\n\t\t}\r\n\t}","private void choixRepertoire(int format){\n\t\tString path = \"\"; //Chemin a parcourir\n\t\tJFileChooser chooser = null;\n\t\tif(SauvegardeRepertoire.getPaths().isEmpty()){//Si la liste des repertoires est vide\n\t\t\tchooser = new JFileChooser();\n\t\t}\n\t\telse{//si elle n'est pas vide\n\t\t\tIterator<String> it = SauvegardeRepertoire.getPaths().iterator();\n\t\t\twhile (it.hasNext() && path.equals(\"\")) {\n\t\t\t\tString str = (String) it.next();\n\t\t\t\tFile file = new File(str);\n\n\t\t\t\tif (file.exists()) //on recupere le premier repertoire possible\t\n\t\t\t\t\tpath = file.getAbsolutePath();\n\t\t\t}\n\n\t\t\tif(path.equals(\"\"))//si on a pas trouvé de chemin coherent\n\t\t\t\tchooser = new JFileChooser();\n\t\t\telse\n\t\t\t\tchooser = new JFileChooser(path);\n\t\t}\n\t\tFileNameExtensionFilter filter=null;\n\t\tswitch(format)\n\t\t{\n\t\t\tcase PDFFile:\n\t\t\t\tfilter = new FileNameExtensionFilter(\"PDF\",\"pdf\");\n\t\t\t\tbreak;\n\t\t\tcase ARFFFile:\n\t\t\t\tchooser.setFileSelectionMode(JFileChooser.DIRECTORIES_ONLY);\n\t\t\t\tchooser.setAcceptAllFileFilterUsed(false);\n\t\t\t\tbreak;\n\t\t}\n\n\t\tchooser.setFileFilter(filter);\n\t\tchooser.setMultiSelectionEnabled(false);\n\t\tint returnVal = chooser.showOpenDialog(null);\n\t\tif(returnVal == JFileChooser.APPROVE_OPTION) {\n\t\t\tSauvegardeRepertoire.ajoutPath(chooser);//permet de sauvegarder les repertoires\n\t\t\tif(filter!=null && filter.getExtensions()[0].equals(\"pdf\")) {\n\t\t\t\tgestionFichier(chooser);\n\t\t\t\tunlockButton();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tgestionFichierDataSet(chooser);\n\t\t\t\tbDataTraining.setEnabled(true);\n\t\t\t}\n\n\t\t}\n\t}","public void loadFile()\n {\n\n FileDialog fd = null; //no value\n fd = new FileDialog(fd , \"Pick up a bubble file: \" , FileDialog.LOAD); //create popup menu \n fd.setVisible(true); // make visible manu\n String directory = fd.getDirectory(); // give the location of file\n String name = fd.getFile(); // give us what file is it\n String fullName = directory + name; //put together in one sting \n \n File rideNameFile = new File(fullName); //open new file with above directory and name\n \n Scanner nameReader = null;\n //when I try to pick up it read as scanner what I choose\n try\n {\n nameReader = new Scanner(rideNameFile);\n }\n catch (FileNotFoundException fnfe)//if dont find return this message below\n {\n return; // immedaitely exit from here\n }\n \n //if load button pressed, it remove all ride lines in the world\n if(load.getFound()){\n removeAllLines();\n } \n \n //read until is no more stings inside of file and until fullfill max rides\n while(nameReader.hasNextLine()&¤tRide<MAX_RIDES)\n {\n \n String rd= nameReader.nextLine();//hold and read string with name of ride\n RideLines nova =new RideLines(rd);\n rides[currentRide]=nova;\n \n //Create a RideLine with string given from file\n addObject(rides[currentRide++], 650, 20 + 40*currentRide);\n }\n \n //when is no more strings inside it close reader\n nameReader.close();\n }","public static void main(String[] args) throws FileNotFoundException {\n\t\tListaNombre nombres = new ListaNombre();\n//\t\tnombres.add(new Nombre(\"guido\"));\n//\t\tnombres.add(new Nombre(\"guido\"));\n//\t\tnombres.add(new Nombre(\"guido\"));\n//\t\tnombres.add(new Nombre(\"juan\"));\n//\t\tnombres.add(new Nombre(\"juan\"));\n//\t\tnombres.add(new Nombre(\"daria\"));\n//\t\tnombres.add(new Nombre(\"daria\"));\n//\t\tnombres.add(new Nombre(\"pedro\"));\n//\t\tnombres.add(new Nombre(\"pedro\"));\n//\t\tnombres.add(new Nombre(\"pedro\"));\n//\t\tnombres.setCantRepetidos(3);\n//\t\tfor (Nombre nom : nombres.getNombres()) {\n//\t\t\tSystem.out.println(nom.getNombre() + \" \" + nom.getCant());\n//\t\t}\n\t\tnombres = ( Archivo.leer(\"C:\\\\Users\\\\guido\\\\eclipse-workspace\\\\DescubriendoNombresRepetidos\\\\premioA.in\"));\n\t\tArchivo.escribir(\"C:\\\\Users\\\\guido\\\\eclipse-workspace\\\\DescubriendoNombresRepetidos\\\\salida.out\",nombres);\n\t}","public static void RT() {////cada clase que tiene informacion en un archivo txt tiene este metodo para leer el respectivo archivoy guardarlo en su hashmap\n\t\treadTxt(\"peliculas.txt\", pelisList);\n\t}","private void dialogEcritureFichier(File file) {\n\t\tJOptionPane.showMessageDialog(null, \"le fichier \" + file.getName() +\" a été écrit\", \"Info\", JOptionPane.INFORMATION_MESSAGE);\n\t}","public void subir_file()\n {\n FileChooser fc = new FileChooser();\n\n fc.getExtensionFilters().addAll(new FileChooser.ExtensionFilter(\"PDF Files\",\"*.pdf\")\n , new FileChooser.ExtensionFilter(\"Jpg Images\",\"*.jpg\",\"*.JPEG\",\"*.JPG\",\"*.jpeg\",\"*.PNG\",\"*.png\"));\n\n File fileSelected = fc.showOpenDialog(null);\n\n if (fileSelected!= null){\n txt_ruta.setText(fileSelected.getPath());\n\n if(txt_ruta.getText().contains(\".pdf\"))\n {\n System.out.println(\"si es pdf\");\n Image image = new Image(\"/sample/Clases/pdf.png\");\n image_esquema.setImage(image);\n\n }\n else\n {\n File file = new File(txt_ruta.getText());\n javafx.scene.image.Image image = new Image(file.toURI().toString());\n image_esquema.setImage(image);\n }\n\n }\n else{\n System.out.println(\"no se seleccinoó\");\n }\n }","public void OuvrirAgd() {\n //on charge l'agenda à partir d'un fichier en lecture\n try {\n File agd_a_lire = new File(\"C:\\\\Projet_Agenda_ING3\\\\saved_agendas\");\n Scanner sc = new Scanner(agd_a_lire);\n\n //on lit le fichier ligne par ligne\n /*while (sc.) {\n\n }*/\n\n sc.close();\n } catch (Exception e) {\n System.out.print(\"Erreur d'ouverture du fichier en lecture\\n\");\n }\n }","private static void obtenirUneListe() throws FileNotFoundException {\n\t\tSystem.out.println(\"\\r\\nPour combien de jours : \");\n\t\tint nbJours = sc.nextInt();\n\n\t\tSystem.out.println(\"\\r\\nCombien de propositions : \");\n\t\tint nbPropositions = sc.nextInt();\n\n\t\tList<List<Recette>> listeProposition = genererListePropositions(nbJours, nbPropositions);\n\n\t\tSystem.out.println(\"\\r\\nChoix ? \");\n\t\tint choix = sc.nextInt();\n\n\t\tgenererFichier(listeProposition.get(choix - 1));\n\n\t\tsc.nextLine();\n\n\t\traz();\n\t}","@objid (\"116a5759-3df1-4c8b-bd9e-e521507f07e6\")\r\n public String searchFile() {\r\n String nomFichier = this.dialog.open();\r\n if ((nomFichier != null) && (nomFichier.length() != 0)) {\r\n this.currentFile = new File(nomFichier);\r\n this.text.setText(nomFichier);\r\n }\r\n return this.text.getText();\r\n }","public void arquivo(String nomarq)\r\n {\n }","public void FermerAgd() {\n //on essaye d'ouvrir un fichier dans lequel enregistrer le contenu de l'agenda\n try {\n Formatter agd_a_enreg = new Formatter(\"C:\\\\Projet_Agenda_ING3\\\\saved_agendas\");\n\n for (RdV el : this.getAgenda()) {\n //on enregistre 1 rdv par ligne\n //faire gaffe aux formats : %..\n agd_a_enreg.format(\"%s/%s/%s de %s a %s : %s , %s\\n\",\n el.getDate().getDayOfMonth(), el.getDate().getMonthValue(),\n el.getDate().getYear(), el.getHdebut(),\n el.getHfin(), el.getLibelle(), el.getRappel());\n //on supprime le rdv de l'arraylist d'agenda \n this.suppressionRdV(el);\n }\n //on ferme le fichier en ecriture\n agd_a_enreg.close();\n //on met l'attribut agenda à null une fois qu'il est \"vidé\"\n this.agd = null;\n } //en cas de probleme dans l'ouverture du fichier on affiche une erreur\n catch (Exception e) {\n System.out.print(\"Erreur d'ouverture du fichier en ecriture\\n\");\n }\n\n }","private static void info ( File f ) {\n\tString nume = f . getName () ;\n\tif( f.isFile () )\n\tSystem.out.println ( \" Fisier : \" + nume ) ;\n\telse\n\tif( f.isDirectory () )\n\tSystem.out.println ( \" Director : \" + nume ) ;\n\tSystem.out.println (\n\t\" Cale absoluta : \" + f.getAbsolutePath () +\n\t\" \\n Poate citi : \" + f.canRead () +\n\t\" \\n Poate scrie : \" + f.canWrite () +\n\t\" \\n Parinte : \" + f.getParent () +\n\t\" \\n Cale : \" + f.getPath () +\n\t\" \\n Lungime : \" + f.length () +\n\t\" \\n Data ultimei modificari : \" +\n\tnew Date ( f.lastModified () ) ) ;\n\tSystem.out.println ( \" --------------\" ) ;\n\t}","public void service_psy (Personne p) throws FileNotFoundException\r\n\t{\r\n\t\r\n\t\t\r\n\t\t \t\tString [] info_psy=null ;\r\n\t\t \t\tString [] cle_valeur=null;\r\n\t\t \t\tboolean spec,adr;\r\n\t\t \t\tFileInputStream f=new FileInputStream(\"C://Users/Azaiez Hamed/Desktop/workspace/Projet de programmation/src/Medecin.txt\");\r\n\t\t \t\ttry {\r\n\t\t \t\t\tBufferedReader reader =new BufferedReader (new InputStreamReader(f,\"UTF-8\"));\r\n\t\t \t\t\tString line=reader.readLine();\r\n\t\t \t\t\twhile(line!=null){\r\n\t\t \t\t\t\tinfo_psy=line.split(\"\\t\\t\\t\");\r\n\t\t \t\t\t\tspec=false;adr=false;\r\n\t\t \t\t\t\tfor(int i=0;i<info_psy.length;i++)\r\n\t\t \t\t\t\t{\r\n\t\t \t\t\t\t\t cle_valeur=info_psy[i].split(\":\");\r\n\t\t\t\t\t\t if ((cle_valeur[0].equals(\"specialite\"))&& (cle_valeur[1].equals(\"psy\")))\r\n\t\t\t\t\t\t \t spec=true;\r\n\t\t\t\t\t\t if ((cle_valeur[0].equals(\"gouvernerat\"))&&(cle_valeur[1].equals(p.getGouvernerat())))\r\n\t\t \t\t\t\t\t \tadr=true;\r\n\t\t\t\t\t\t}\r\n\t\t \t\t\t\tif (spec && adr) {\r\n\t\t \t\t\t\t\t System.out.println(\"voilà toutes les informations du psy, veuillez lui contacter immédiatement **\");\r\n\t\t \t\t\t\t\t System.out.println(line);return;}\r\n\t\t \t\t\t\telse\r\n\t\t \t\t\t\t line=reader.readLine();\r\n\t\t \t\t\t\t }\r\n\t\t \t\t }\r\n\t\t \t\t \tcatch(IOException e){e.printStackTrace();}\r\n\t\t \t\t System.out.println(\"Pas de psy trouvé dans votre gouvernerat\");\r\n\t}","public ifrm_historial() {\n initComponents();\n this.setTitle(\"Historial bitacoraCalculadora.txt\");\n File archivo;\n try{\n final BufferedReader lector = new BufferedReader(new FileReader(\"bitacoraCalculadora.txt\"));\n String line = \"\";\n while ((line = lector.readLine()) != null){\n //txt_mostrar.setText(line);\n txt_mostrar.append(line +\"\\n\");\n }lector.close();\n }catch(FileNotFoundException e){\n e.printStackTrace();\n } catch(IOException e){\n e.printStackTrace();\n }\n }","private static void letturaFilePerRiga(File file) {\n\t\ttry(FileReader reader = new FileReader(file);\n\t\t\tBufferedReader buffReader = new BufferedReader(reader)) {\n\t\t\tString riga = null;\n\t\t\t\n\t\t\tdo {\n\t\t\t\triga = buffReader.readLine();\n\t\t\t\tSystem.out.println(riga);\n\n\t\t\t} while (riga != null);\n\t\t\twhile(riga != null);\n\t\t} catch (FileNotFoundException e) {\n\t\t\t// TODO: handle exception\n\t\t} catch (IOException e) {\n\t\t\t// TODO: handle exception\n\t\t}\n\t\n\n\t}","public void salvaPartita(String file) {\n\r\n }","public void afficherFile() {\r\n\r\n\t\tSystem.out.println();\r\n\t\tSystem.out.println(\"Voici la File (tete a gauche, queue a droite): \");\r\n\t\tSystem.out.println(\"----------------------------------------------\");\r\n\r\n\t\tif (this.estVide() == true) {\r\n\r\n\t\t\tSystem.out.println();\r\n\t\t} else {\r\n\r\n\t\t\tCellule<T> ref = this.tete;\r\n\r\n\t\t\tfor (int i = 1; i <= this.getLongueurFile(); i++) {\r\n\r\n\t\t\t\tSystem.out.print(ref.getValeur() + \" \");\r\n\r\n\t\t\t\tif (ref.getSuivant() != null) {\r\n\r\n\t\t\t\t\tref = ref.getSuivant();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tSystem.out.println();\r\n\t\tSystem.out.println();\r\n\t}","public void abrirArchivo() {\r\n try {\r\n entrada = new Scanner(new File(\"estudiantes.txt\"));\r\n } // fin de try\r\n catch (FileNotFoundException fileNotFoundException) {\r\n System.err.println(\"Error al abrir el archivo.\");\r\n System.exit(1);\r\n } // fin de catch\r\n }","private void validateFile(final boolean isRustica) {\n\t\thayErroresFilas = false;\r\n\t\thayErroresFila = false;\r\n\r\n\t\tcampoMasaCorrectos = true;\r\n\t\tcampoHojaCorrecto = true;\r\n\t\tcampoParecelaCorrecto = true;\r\n\t\tcampoTipoCorrecto = true;\r\n\t\tcampoFechaAltaCorrecto = true;\r\n\t\tcampoFechaBajaCorrecto = true;\r\n\r\n\t\tFile currentDirectory = (File) blackboard.get(ImportarUtils_LCGIII.LAST_IMPORT_DIRECTORY);\r\n\r\n\t\tGeopistaFiltroFicheroFilter filter = new GeopistaFiltroFicheroFilter();\r\n\t\tfilter.addExtension(\"SHP\");\r\n filter.setDescription(\"Shapefiles\");\r\n\t\t\r\n final JFileChooser jfc;\r\n final JTextField jtf;\r\n if (isRustica)\r\n {\r\n \tjfc = fcRustica;\t\r\n \tjtf = this.txtFicheroRustica;\r\n }\r\n\t\telse\r\n\t\t{\r\n\t\t\tjfc = fcUrbana;\r\n\t\t\tjtf = this.txtFicheroUrbana;\r\n\t\t}\r\n\t\t\t\t\r\n\t\t// FILES(*.*)\r\n jfc.setFileFilter(filter);\r\n \tjfc.setAcceptAllFileFilterUsed(false); // QUITA LA OPCION ALL\r\n\t\tjfc.setCurrentDirectory(currentDirectory);\r\n\t\t\r\n\t\tint returnVal = jfc.showOpenDialog(this);\r\n\t\tblackboard.put(ImportarUtils_LCGIII.LAST_IMPORT_DIRECTORY, jfc.getCurrentDirectory());\r\n\r\n\t\tif (returnVal == JFileChooser.APPROVE_OPTION)\r\n\t\t{\r\n\t\t\t// Cargamos el fichero que hemos obtenido\r\n\t\t\tString fichero;\r\n\t\t\tfichero = jfc.getSelectedFile().getPath();\r\n\t\t\tjtf.setText(fichero); // meto el fichero seleccionado\r\n\t\t\t// en el campo\r\n\r\n\t\t\tcadenaTexto = \"<font face=SansSerif size=3>\"\r\n\t\t\t\t+ aplicacion.getI18nString(\"ImportacionComenzar\") + \"<b>\" + \" \"\r\n\t\t\t\t+ jfc.getSelectedFile().getName() + \"</b>\";\r\n\t\t\t\r\n\t\t\tcadenaTexto = cadenaTexto + \"<p>\" + aplicacion.getI18nString(\"OperacionMinutos\") + \" ...</p></font>\";\r\n\t\t\tcadenaTexto = cadenaTexto + aplicacion.getI18nString(\"importar.datos.parcelas\");\r\n\r\n\t\t\tediError.setText(cadenaTexto);\r\n\t\t\tcadenaTexto=\"\";\r\n\r\n\t\t\tfinal TaskMonitorDialog progressDialog = \r\n\t\t\t\tnew TaskMonitorDialog(aplicacion.getMainFrame(), geopistaEditor.getContext().getErrorHandler());\r\n\r\n\t\t\tprogressDialog.setTitle(aplicacion.getI18nString(\"ValidandoDatos\"));\r\n\t\t\tprogressDialog.report(aplicacion.getI18nString(\"ValidandoDatos\"));\r\n\t\t\tprogressDialog.addComponentListener(new ComponentAdapter()\r\n\t\t\t{\r\n\t\t\t\tpublic void componentShown(ComponentEvent e)\r\n\t\t\t\t{\r\n\t\t\t\t\t// Wait for the dialog to appear before starting the\r\n\t\t\t\t\t// task. Otherwise\r\n\t\t\t\t\t// the task might possibly finish before the dialog\r\n\t\t\t\t\t// appeared and the\r\n\t\t\t\t\t// dialog would never close. [Jon Aquino]\r\n\t\t\t\t\tnew Thread(new Runnable()\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tpublic void run()\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\ttry\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tGeopistaLayer layerParcelas = (GeopistaLayer) blackboard.get(\"capaParcelasInfoReferencia\");\r\n\t\t\t\t\t\t\t\tif (layerParcelas != null)\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\tgeopistaEditor.getLayerManager().remove(layerParcelas);\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\tlayerParcelas = (GeopistaLayer) geopistaEditor.loadData(\r\n\t\t\t\t\t\t\t\t\t\tjfc.getSelectedFile().getAbsolutePath(),\r\n\t\t\t\t\t\t\t\t\t\taplicacion.getI18nString(\"importar.informe.parcelas\"));\r\n\t\t\t\t\t\t\t\tlayerParcelas.setActiva(false);\r\n\t\t\t\t\t\t\t\tlayerParcelas.addStyle(new BasicStyle(new Color(64, 64,64)));\r\n\t\t\t\t\t\t\t\tlayerParcelas.setVisible(false);\r\n\r\n\t\t\t\t\t\t\t\tif (isRustica)\r\n\t\t\t\t\t\t\t\t\tblackboard.put(\"capaParcelasInfoReferencia\", layerParcelas);\r\n\t\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t\t\tblackboard.put(\"capaParcelasInfoReferenciaUrbana\", layerParcelas);\r\n\r\n\t\t\t\t\t\t\t\t// Obtener el esquema\r\n\t\t\t\t\t\t\t\tFeatureSchema esquema = layerParcelas.getFeatureCollectionWrapper().getFeatureSchema();\r\n\r\n\t\t\t\t\t\t\t\t// Localizar los campos\r\n\t\t\t\t\t\t\t\tcampoMasaCorrectos = encontrarCampo(\"MASA\",esquema);\r\n\t\t\t\t\t\t\t\tcampoHojaCorrecto = encontrarCampo(\"HOJA\",esquema);\r\n\t\t\t\t\t\t\t\tcampoParecelaCorrecto = encontrarCampo(\"PARCELA\",esquema);\r\n\t\t\t\t\t\t\t\tcampoTipoCorrecto = encontrarCampo(\"TIPO\",esquema);\r\n\t\t\t\t\t\t\t\tcampoFechaAltaCorrecto = encontrarCampo(\"FECHAALTA\", esquema);\r\n\t\t\t\t\t\t\t\tcampoFechaBajaCorrecto = encontrarCampo(\"FECHABAJA\", esquema);\r\n\r\n\t\t\t\t\t\t\t\tif (campoMasaCorrectos \r\n\t\t\t\t\t\t\t\t\t\t&& campoHojaCorrecto\r\n\t\t\t\t\t\t\t\t\t\t&& campoParecelaCorrecto\r\n\t\t\t\t\t\t\t\t\t\t&& campoTipoCorrecto\r\n\t\t\t\t\t\t\t\t\t\t&& campoFechaAltaCorrecto\r\n\t\t\t\t\t\t\t\t\t\t&& campoFechaBajaCorrecto)\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t// A partir de aqui hay que\r\n\t\t\t\t\t\t\t\t\t// verificar que no hay nulos y es\r\n\t\t\t\t\t\t\t\t\t// del tipo correcto los valores.\r\n\t\t\t\t\t\t\t\t\tList listaLayer = layerParcelas.getFeatureCollectionWrapper().getFeatures();\r\n\t\t\t\t\t\t\t\t\tIterator itLayer = listaLayer.iterator();\r\n\r\n\t\t\t\t\t\t\t\t\twhile (itLayer.hasNext())\r\n\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\tif (hayErroresFila)\r\n\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t// break;\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\tFeature f = (Feature) itLayer.next();\r\n\t\t\t\t\t\t\t\t\t\tString masa = f.getString(\"MASA\");\r\n\t\t\t\t\t\t\t\t\t\tString hoja = f.getString(\"HOJA\");\r\n\t\t\t\t\t\t\t\t\t\tString parcela = f.getString(\"PARCELA\");\r\n\r\n\t\t\t\t\t\t\t\t\t\tString tipo = f.getString(\"TIPO\");\r\n\t\t\t\t\t\t\t\t\t\t// Comprobamos que no sea nulo y\r\n\t\t\t\t\t\t\t\t\t\t// sea una U o una R\r\n\t\t\t\t\t\t\t\t\t\tif ((!tipo.equals(\"U\"))\r\n\t\t\t\t\t\t\t\t\t\t\t\t&& (!tipo.equals(\"R\"))\r\n\t\t\t\t\t\t\t\t\t\t\t\t&& (!tipo.equals(\"D\"))\r\n\t\t\t\t\t\t\t\t\t\t\t\t&& (!tipo.equals(\"X\")))\r\n\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t// Solo puede haber una R \r\n\t\t\t\t\t\t\t\t\t\t\t// una U una D o una X.\r\n\t\t\t\t\t\t\t\t\t\t\tcadenaTexto = cadenaTexto\r\n\t\t\t\t\t\t\t\t\t\t\t+ aplicacion.getI18nString(\"importar.informe.parcelas.rustico\")\r\n\t\t\t\t\t\t\t\t\t\t\t+ masa\r\n\t\t\t\t\t\t\t\t\t\t\t+ hoja\r\n\t\t\t\t\t\t\t\t\t\t\t+ parcela\r\n\t\t\t\t\t\t\t\t\t\t\t+ aplicacion.getI18nString(\"importar.informe.parcelas.fin.rustico\");\r\n\t\t\t\t\t\t\t\t\t\t\thayErroresFila = true;\r\n\t\t\t\t\t\t\t\t\t\t\thayErroresFilas = true;\r\n\t\t\t\t\t\t\t\t\t\t\t// break;\r\n\t\t\t\t\t\t\t\t\t\t} \r\n\t\t\t\t\t\t\t\t\t\telse if (!isRustica && (tipo.equals(\"R\") || tipo.equals(\"D\") || tipo.equals(\"X\")))\r\n\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\tcadenaTexto = I18N.get(\"ImportadorParcelas\", \"importar.informe.parcelas.error.inicio.parcelario\")\r\n\t\t\t\t\t\t\t\t\t\t\t+ I18N.get(\"ImportadorParcelas\", \"importar.informacion.referencia.validacion.urbana\") + \r\n\t\t\t\t\t\t\t\t\t\t\tI18N.get(\"ImportadorParcelas\", \"importar.informe.parcelas.error.fin.parcelario\");\r\n\t\t\t\t\t\t\t\t\t\t\thayErroresFila = true;\r\n\t\t\t\t\t\t\t\t\t\t\thayErroresFilas = true;\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\telse if (isRustica && tipo.equals(\"U\"))\r\n\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\tcadenaTexto = I18N.get(\"ImportadorParcelas\", \"importar.informe.parcelas.error.inicio.parcelario\")\r\n\t\t\t\t\t\t\t\t\t\t\t+ I18N.get(\"ImportadorParcelas\", \"importar.informacion.referencia.validacion.rustica\") + \r\n\t\t\t\t\t\t\t\t\t\t\tI18N.get(\"ImportadorParcelas\", \"importar.informe.parcelas.error.fin.parcelario\");\r\n\t\t\t\t\t\t\t\t\t\t\thayErroresFila = true;\r\n\t\t\t\t\t\t\t\t\t\t\thayErroresFilas = true;\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t// Comprobamos que la fecha\r\n\t\t\t\t\t\t\t\t\t\t\t// que viene sea fecha\r\n\t\t\t\t\t\t\t\t\t\t\ttry\r\n\t\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t\tDateFormat formatter = new SimpleDateFormat(\"yyyyMMdd\");\r\n\t\t\t\t\t\t\t\t\t\t\t\tDate date = (Date) formatter.parse(f.getString(\"FECHAALTA\"));\r\n\t\t\t\t\t\t\t\t\t\t\t\t// Comprobamos que la\r\n\t\t\t\t\t\t\t\t\t\t\t\t// fecha de baja es nula\r\n\t\t\t\t\t\t\t\t\t\t\t\t// o valida o 9999999\r\n\t\t\t\t\t\t\t\t\t\t\t\tif (f.getString(\"FECHABAJA\").equals(\"99999999\"))\r\n\t\t\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t// Correcto\r\n\t\t\t\t\t\t\t\t\t\t\t\t\thayErroresFila = false;\r\n\t\t\t\t\t\t\t\t\t\t\t\t} \r\n\t\t\t\t\t\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tif ((f.getString(\"FECHABAJA\")) == null)\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\thayErroresFila = false;\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t} \r\n\t\t\t\t\t\t\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t// Comprobamos que sea una fecha correcta\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\ttry\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tDateFormat formatter1 = new SimpleDateFormat(\"yyyyMMdd\");\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tDate date1 = (Date) formatter1.parse(f.getString(\"FECHABAJA\"));\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t} \r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tcatch (Exception excp)\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\texcp.printStackTrace();\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\thayErroresFila = true;\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\thayErroresFilas = true;\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcadenaTexto = cadenaTexto\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t+ aplicacion.getI18nString(\"importar.informe.parcelas.fecha.baja\")\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t+ masa\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t+ hoja\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t+ parcela\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t+ aplicacion.getI18nString(\"importar.informe.parcelas.fin.rustico\");\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t// break;\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\t\t//jtf.setBorder(BorderFactory.createLineBorder(Color.GREEN, 2));\r\n\t\t\t\t\t\t\t\t\t\t\t\tif (isRustica)\r\n\t\t\t\t\t\t\t\t\t\t\t\t\trusticaValida = true;\r\n\t\t\t\t\t\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t\t\t\t\t\t\turbanaValida = true;\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t} \r\n\t\t\t\t\t\t\t\t\t\t\tcatch (Exception exc)\r\n\t\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t\t// En la fecha de alta\r\n\t\t\t\t\t\t\t\t\t\t\t\tcadenaTexto = cadenaTexto\r\n\t\t\t\t\t\t\t\t\t\t\t\t+ aplicacion.getI18nString(\"importar.informe.parcelas.fecha.alta.validacion\")\r\n\t\t\t\t\t\t\t\t\t\t\t\t+ masa\r\n\t\t\t\t\t\t\t\t\t\t\t\t+ hoja\r\n\t\t\t\t\t\t\t\t\t\t\t\t+ parcela\r\n\t\t\t\t\t\t\t\t\t\t\t\t+ aplicacion.getI18nString(\"importar.informe.parcelas.fin.rustico\");\r\n\t\t\t\t\t\t\t\t\t\t\t\texc.printStackTrace();\r\n\t\t\t\t\t\t\t\t\t\t\t\thayErroresFila = true;\r\n\t\t\t\t\t\t\t\t\t\t\t\thayErroresFilas = true;\r\n\t\t\t\t\t\t\t\t\t\t\t\t// break;\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t//Se comprueba si la geometría es de tipo polygon y no es empty (únicas válidas en la capa parcelas)\r\n\t\t\t\t\t\t\t\t\t\t\tif (!(f.getGeometry() instanceof Polygon)\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t|| f.getGeometry().isEmpty())\r\n\t\t\t\t\t\t\t\t\t\t\t{\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\tcadenaTexto = I18N.get(\"ImportadorParcelas\", \"importar.informe.parcelas.error.inicio.parcelario\")\r\n\t\t\t\t\t\t\t\t\t\t\t\t+ I18N.get(\"ImportadorParcelas\", \"importar.informacion.referencia.validacion.geometria\") + \r\n\t\t\t\t\t\t\t\t\t\t\t\tI18N.get(\"ImportadorParcelas\", \"importar.informe.parcelas.error.fin.parcelario\");\r\n\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\thayErroresFila = true;\r\n\t\t\t\t\t\t\t\t\t\t\t\thayErroresFilas = true;\r\n\t\t\t\t\t\t\t\t\t\t\t}\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t} \r\n\t\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t// Alguno de los campos no están\r\n\t\t\t\t\t\t\t\t\t// definidos\r\n\t\t\t\t\t\t\t\t\t// JOptionPane.showMessageDialog(this,aplicacion.getI18nString(\"importar.informe.parcelas.algun.campo\"));\r\n\t\t\t\t\t\t\t\t\tcadenaTexto += aplicacion.getI18nString(\"importar.informacion.ficheros.no.correctos\");\r\n\t\t\t\t\t\t\t\t\thayErroresFilas = true;\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tif (isRustica)\r\n\t\t\t\t\t\t\t\t\t\trusticaValida = false;\r\n\t\t\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t\t\t\turbanaValida = false;\t\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t} \r\n\t\t\t\t\t\t\tcatch (Exception e)\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\thayErroresFilas = true;\r\n\t\t\t\t\t\t\t} \r\n\t\t\t\t\t\t\tfinally\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tprogressDialog.setVisible(false);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}).start();\r\n\t\t\t\t}\r\n\t\t\t});\r\n\t\t\t\r\n\t\t\tGUIUtil.centreOnWindow(progressDialog);\r\n\t\t\tprogressDialog.setVisible(true);\r\n\r\n\t\t\tif (hayErroresFilas)\r\n\t\t\t{\r\n\t\t\t\tjtf.setBorder(BorderFactory.createLineBorder(Color.RED, 2));\r\n\t\t\t\tcadenaTexto = cadenaTexto + aplicacion.getI18nString(\"validacion.finalizada\");\t\t\t\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tjtf.setBorder(BorderFactory.createLineBorder(Color.GREEN, 2));\r\n\t\t\t\tcadenaTexto = cadenaTexto + aplicacion.getI18nString(\"importar.informe.parcelas.fichero.correcto\")\r\n\t\t\t\t+ aplicacion.getI18nString(\"validacion.finalizada\");\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tediError.setText(cadenaTexto);\r\n\t\t\twizardContext.inputChanged();\r\n\t\t}\r\n\r\n\t}","public static void readMetro(String ligne){\n file=ligne;\n try{\n Metro.readGraph();\n }\n catch (FileNotFoundException e){\n System.out.println(\"It's not the file you're looking for.\");\n }\n ;\n }","public void restaurarPartida() throws FileNotFoundException, IOException, ClassNotFoundException {\n\t\tjuego.restaurarPartida(jugador.getID());\t\r\n\t}","public static void otvoriFajl() {\r\n\t\tJFileChooser fc = new JFileChooser();\r\n\t\tFileNameExtensionFilter filter = new FileNameExtensionFilter(\"Gym files\", \"gym\");\r\n\r\n\t\tfc.setFileFilter(filter);\r\n\t\tfc.setCurrentDirectory(new File(\".\"));\r\n\t\tint izbor = fc.showOpenDialog(teretanaGui.getContentPane());\r\n\r\n\t\tif (izbor == JFileChooser.APPROVE_OPTION) {\r\n\t\t\tFile f = fc.getSelectedFile();\r\n\r\n\t\t\tString fileName = f.getAbsolutePath();\r\n\r\n\t\t\tpath = fileName;\r\n\r\n\t\t\ttry {\r\n\t\t\t\tlistaClanova.ucitajIzFajla(fileName);\r\n\t\t\t\tpopuniTabelu();\r\n\t\t\t} catch (Exception e) {\r\n\t\t\t\tJOptionPane.showMessageDialog(teretanaGui.getContentPane(), \"Greska pri ucitavanju clanova!\", \"Greska\",\r\n\t\t\t\t\t\tJOptionPane.ERROR_MESSAGE);\r\n\t\t\t}\r\n\r\n\t\t}\r\n\t}","public void loadShow(File f) {\n \n }","public void seleccionarArchivo(){\n JFileChooser j= new JFileChooser();\r\n FileNameExtensionFilter fi= new FileNameExtensionFilter(\"pdf\",\"pdf\");\r\n j.setFileFilter(fi);\r\n int se = j.showOpenDialog(this);\r\n if(se==0){\r\n this.txtCurriculum.setText(\"\"+j.getSelectedFile().getName());\r\n ruta_archivo=j.getSelectedFile().getAbsolutePath();\r\n }else{}\r\n }","private void jButtonCreateInsexActionPerformed(java.awt.event.ActionEvent evt) {\n try {\n lstPerson = new ArrayList();\n Properties prop = new Properties();//почти тоже самое что ini файлы\n content = Files.readAllLines(Paths.get(PATH_FILE_SOURCE), Charset.forName(\"cp1251\"));\n String s = content.get(0);\n for (int i = 0, j = 1; i < s.length(); i += 128, j++) {\n Person p = new Person(\n s.substring(i, i + 30).trim(),\n s.substring(i + 30, i + 50).trim(),\n s.substring(i + 50, i + 70).trim(),\n s.substring(i + 70, i + 78).trim(),\n s.substring(i + 78).trim(), j);\n lstPerson.add(p);\n }\n\n for (Person person : lstPerson) {\n prop.put(person.getSurname().toUpperCase(), Integer.toString(person.getID()));\n }\n prop.storeToXML(new FileOutputStream(FILE_PATH_INDEX_SURNAME), \"LIB\");//можно и без xml\n jLabelStatusBar.setForeground(Color.magenta);\n jLabelStatusBar.setText(\"Индексный файл создан!\");\n jLabelStatusBar.setForeground(Color.BLACK);\n\n } catch (IOException ex) {\n jLabelStatusBar.setForeground(Color.red);\n jLabelStatusBar.setText(\"Индексный файл не создан!\");\n Logger.getLogger(NewJFrame1.class.getName()).log(Level.SEVERE, null, ex);\n }\n }","public void leerFichero(String rutaFichero) {\r\n\t\t\ttry {\r\n\t\t\t\tBufferedReader fichero;\r\n\t\t\t\tfichero = new BufferedReader(new FileReader(rutaFichero));\r\n\t\t\t\tString registro;\r\n\t\t\t\twhile ((registro = fichero.readLine()) != null) {\r\n\t\t\t\t\tSystem.out.println(registro);\r\n\r\n\t\t\t\t\t// ................\r\n\r\n\t\t\t\t}\r\n\t\t\t\tfichero.close();\r\n\t\t\t\tSystem.out.println(\"Fin de la lectura del fichero\");\r\n\r\n\t\t\t} catch (FileNotFoundException excepcion) {\r\n\t\t\t\tSystem.out.println(\"fichero no encontrado\");\r\n\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\tSystem.out.println(\"IO Excepcion\");\r\n\t\t\t}\r\n\t\t}","public void KvtTartListFrissit( String sKonyvtar)\r\n {\n File cAktKvt = null ;\r\n Object aKvtTartalma[] = null ;\r\n\r\n//System.out.println( \"JFileValasztDlg.KvtTartListFrissit( \" + sKonyvtar + \")\") ;\r\n\r\n// cAktKvt = new File( \".\") ;\r\n// cAktKvt = new File( \"/home/tamas/java/Polar/hrmfiles\") ;\r\n cAktKvt = new File( sKonyvtar) ;\r\n\r\n//System.out.println( \"JFileValasztDlg.KvtTartListFrissit cAktKvt = new File() utan\") ;\r\n\r\n // Az aktualis konyvtar teljes utvonalanak beirasa\r\n// Itt nyeli le a vegerol a \\-t vagy /-t :\r\n// m_jKonyvtarTxtFld.setText( cAktKvt.getAbsolutePath()) ; // getAbsolutePath()\r\n m_jKonyvtarTxtFld.setText( sKonyvtar) ;\r\n\r\n//System.out.println( \"JFileValasztDlg.KvtTartListFrissit m_jKonyvtarTxtFld.setText( cAktKvt.getAbsolutePath()) utan\") ;\r\n if ( cAktKvt != null && cAktKvt.isDirectory() == true )\r\n {\r\n aKvtTartalma = HRMFileSzuro( cAktKvt) ;\r\n//System.out.println( \"JFileValasztDlg.KvtTartListFrissit() : HRMFileSzuro() utan\") ;\r\n\r\n if ( aKvtTartalma != null )\r\n {\r\n/*\r\nfor ( int i=0 ; i < aKvtTartalma.length ; i++ )\r\n{\r\nSystem.out.println( \"JFileValasztDlg.KvtTartListFrissit() : cKvtrkFileok[\" + i + \"]=\" + aKvtTartalma[i].toString()) ;\r\n}\r\n*/\r\n m_jKvtTartList.setListData( aKvtTartalma) ;\r\n//System.out.println( \"JFileValasztDlg.KvtTartListFrissit() : .setListData() utan\") ;\r\n\r\n // Itt mar valoszinu, hogy a ListBox a konyvtar file-jait tartalmazza +++\r\n SetAktKonyvtar( sKonyvtar) ;\r\n\r\n m_jKvtTartList.setSelectedIndex( 0) ;\r\n \r\n//System.out.println( \"JFileValasztDlg.KvtTartListFrissit() : SetAktKonyvtar() utan\") ;\r\n//System.out.println( \"JFileValasztDlg.KvtTartListFrissit() : setListData\") ;\r\n/*\r\n for ( nIdx = 0 ; nIdx < aKvtTartalma.length ; nIdx++ )\r\n {\r\n m_jKvtTartList.setListData( aKvtTartalma) ;\r\n }\r\n*/\r\n }\r\n }\r\n }","public AppGenALexicos(File f) {\n initComponents();\n String cadena = \"\";\n try {\n FileReader fr = new FileReader(f);\n try (BufferedReader br = new BufferedReader(fr)) {\n while ((cadena = br.readLine()) != null) {\n jTextArea1.append(cadena + \"\\n\");\n }\n }\n } catch (FileNotFoundException ex) {\n Logger.getLogger(AppCompiladores.class.getName()).log(Level.SEVERE, null, ex);\n } catch (IOException ex) {\n Logger.getLogger(AppCompiladores.class.getName()).log(Level.SEVERE, null, ex);\n }\n }","private void cargarFichero() throws FileNotFoundException {\n\t\tFile miFichero = new File(NOMBRE_FICHERO);\n\t\tFileWriter erroresFichero;\n\t\t\n\t\tScanner in = new Scanner(miFichero);\n\t\t\n\t\tEjercicio nuevoEjer;\n\t\tString siguienteLinea;\n\t\tComprobadorEntradaFichero comprobador = new ComprobadorEntradaFichero();\n\t\tString errores = \"\";\n\t\tint numLinea = 1;\n\t\t\n\t\twhile (in.hasNextLine()) {\n\t\t\t\n\t\t\tsiguienteLinea = in.nextLine();\n\t\t\tif (comprobador.test(siguienteLinea)) {\n\t\t\t\tnuevoEjer = new Ejercicio(siguienteLinea);\n\t\t\t\tcoleccionEj.addEjercicio(nuevoEjer);\n\t\t\t} else {\n\t\t\t\t//Controlar cuántos errores va dando\n\t\t\t\terrores += \"Error en la lÃnea: \" + String.valueOf(numLinea) + \". Datos: \" + siguienteLinea + \"\\n\";\n\t\t\t}\n\t\t\tnumLinea++;\n\t\t}\n\t\t\n\t\tin.close();\n\t\t\n\t\t\n\t\t//Ahora escribimos \n\t\tif (errores != \"\") {\n\t\t\ttry {\n\t\t\t erroresFichero = new FileWriter(NOMBRE_FICHERO_ERRORES);\n\t\t\n\t\t\t erroresFichero.write(errores);\n\n\t\t\t erroresFichero.close();\n\n\t\t\t} catch (Exception ex) {\n\t\t\t\tSystem.out.println(\"Mensaje de la excepción: \" + ex.getMessage());\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t}","public void instalarTipoLetra()\r\n\t{\r\n\t\ttry\r\n { \r\n FileInputStream fIn = new FileInputStream(\"./images/dandelion in the spring.ttf\");\r\n FileOutputStream fOut = new FileOutputStream(\"C:/windows/fonts/dandelion in the spring.ttf\");\r\n \r\n FileChannel fIChan = fIn.getChannel();\r\n FileChannel fOChan = fOut.getChannel();\r\n \r\n long fSize = fIChan.size();\r\n \r\n MappedByteBuffer mBuf = \r\n fIChan.map(FileChannel.MapMode.READ_ONLY, 0, fSize); \r\n fOChan.write(mBuf);//con esto copiamos el archivo\r\n \r\n //nunca olvidemos cerrar los archivos\r\n fIChan.close();\r\n fIn.close();\r\n fOChan.close();\r\n fOut.close();\r\n JOptionPane.showMessageDialog(this,\"El tipo de letra ha sido instalada en el sistema operativo.\",\"Instalar Tipo Letra\", JOptionPane.INFORMATION_MESSAGE,new ImageIcon(\"./images/IconosInterfaz/informacion.PNG\"));\r\n JOptionPane.showMessageDialog(this,\"Cierre el Sistema Experto - SESP y vuelva a iniciar el ejecutable.\",\"Instalar Tipo Letra\", JOptionPane.INFORMATION_MESSAGE,new ImageIcon(\"./images/IconosInterfaz/informacion.PNG\"));\r\n }\r\n catch(Exception ef)\r\n {\r\n \tJOptionPane.showMessageDialog(this,\"Error al instalar el tipo de letra dandelion in the spring en el sistema operativo\",\"Error\", JOptionPane.ERROR_MESSAGE,new ImageIcon(\"./images/IconosInterfaz/error.PNG\"));\r\n \tJOptionPane.showMessageDialog(this,\"Intente instalar manualmente el archivo (dandelion in the spring.ttf) que esta en la carpeta images o intente\"+\"\\n\"+\" copiar manualmente el archivo (dandelion in the spring.ttf) en el directorio C:/windows/fonts\",\"Error\", JOptionPane.ERROR_MESSAGE,new ImageIcon(\"./images/IconosInterfaz/error.PNG\"));\r\n \t}\r\n\t}","private static void showFiles(File f) {\n\t\n}","public void importaRegole(String file, ArrayList<Sensore> listaSensori, ArrayList<Attuatore> listaAttuatori) {\n ArrayList<String> nomiDispPres = new ArrayList<>();\n\n for (Sensore s : listaSensori) {\n nomiDispPres.add(s.getNome());\n }\n\n for (Attuatore att : listaAttuatori) {\n nomiDispPres.add(att.getNome());\n }\n\n String regoleImport = readFromFile(file);\n\n if (regoleImport.equals(\"\")) {\n System.out.println(\"XX Errore di lettura file. Non sono state inserite regole per l'unita immobiliare XX\\n\");\n return;\n }\n\n String[] regole = regoleImport.split(\"\\n\");\n\n for (String r : regole) {\n try {\n ArrayList<String> dispTrovati = verificaCompRegola(r);\n\n for (String nomeDis : dispTrovati) {\n if (nomeDis.contains(\".\")){\n String nomeS = nomeDis.split(\"\\\\.\")[0];\n\n if (!nomiDispPres.contains(nomeS)) {\n throw new Exception(\"XX Dispositivi Incompatibili all'interno della regola XX\\n\");\n }\n\n Sensore s = listaSensori.stream().filter(sensore -> sensore.getNome().equals(nomeS)).iterator().next();\n String nomeInfo = nomeDis.split(\"\\\\.\")[1];\n\n if (s.getInformazione(nomeInfo) == null)\n throw new Exception(\"XX Regola non compatibile XX\\n\");\n\n\n } else if (!nomiDispPres.contains(nomeDis)) {\n throw new Exception(\"XX Dispositivi Incompatibili all'interno della regola XX\\n\");\n\n }\n }\n System.out.println(\"*** Importazione della regola avvenuta con successo ***\\n\");\n writeRuleToFile(r, true);\n\n } catch (Exception e) {\n System.out.println(e.getMessage());\n }\n\n }\n eliminaDoppie(listaSensori,listaAttuatori);\n }","void load_from_file(){\n\t\tthis.setAlwaysOnTop(false);\n\t\t\n\t\t/**\n\t\t * chose file with file selector \n\t\t */\n\t\t\n\t\tFileDialog fd = new FileDialog(this, \"Choose a file\", FileDialog.LOAD);\n\t\t\n\t\t//default path is current directory\n\t\tfd.setDirectory(System.getProperty(\"user.dir\"));\n\t\tfd.setFile(\"*.cmakro\");\n\t\tfd.setVisible(true);\n\t\t\n\t\t\n\t\t\n\t\tString filename = fd.getFile();\n\t\tString path = fd.getDirectory();\n\t\tString file_withpath = path + filename;\n\t\t\n\t\t\n\t\tif (filename != null) {\n\t\t\t System.out.println(\"load path: \" + file_withpath);\t\n\t\t\n\t\t\t \n\t\t\t /**\n\t\t\t * read object from file \n\t\t\t */\n\t\t\t\ttry {\n\t\t\t\t\tObjectInputStream in = new ObjectInputStream(new FileInputStream(file_withpath));\n\n\t\t\t\t\tKey_Lists = Key_Lists.copy((key_lists) in.readObject());\n\n\t\t\t\t\tkeys_area.setText(Key_Lists.arraylist_tostring());\t\t\n\t\t\t\t\t\n\t\t\t\t\tin.close();\n\t\t\t\t\t\n\t\t\t\t\tinfo_label.setForeground(green);\n\t\t\t\t\tinfo_label.setText(\"file loaded :D\");\n\t\t\t\t\t\n\t\t\t\t} catch (FileNotFoundException e) {\n\t\t\t\t\t// TODO Auto-generated catch block\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\tinfo_label.setForeground(white);\n\t\t\t\t\tinfo_label.setText(\"wrong file format\");\n\t\t\t\t\tSystem.out.println(\"io exception\");\n\t\t\t\t\t//e.printStackTrace();\n\t\t\t\t} catch (ClassNotFoundException e) {\n\t\t\t\t\t// TODO Auto-generated catch block\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\n\t\t\t\t\n\t\t}\n\t\t\n\t\t\n\t\tthis.setAlwaysOnTop(true);\n\t\n\t}","public FrmFerramentas() throws IOException {\n initComponents();\n SelecionaLocal();\n //PreencheLook();\n }","public void leerDeFichero() {\n try\n {\n Scanner sc = new Scanner(new File(\"texto.txt\"));\n while (sc.hasNextLine() && !textoCompleto())\n addFrase(sc.nextLine());\n sc.close();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }","public static void main(String[] args) {\n File myFile = new File (\"d:/names.txt\");\r\n // para saber si el archivo no existe, devuelve true o false\r\n System.out.println(\"file.exists(): \" + myFile.exists());\r\n System.out.println(\"file.isDirectory(): \" + myFile.isDirectory());\r\n // para saber la fecha de modificación\r\n System.out.println(\"file.lastModified(): \" + myFile.lastModified());\r\n // para saber el nombre del archivo\r\n System.out.println(\"file.getName(): \" + myFile.getName());\r\n // para saber la ruta\r\n System.out.println(\"file.getPath(): \" + myFile.getPath());\r\n // para saber el tamaño en bytes que ocupa en disco\r\n System.out.println(\"file.length(): \" + myFile.length()+\" bytes\");\r\n // para saber si es de lectura, devuelve true o false\r\n System.out.println(\"file.canRead():\" + myFile.canRead());\r\n\r\n //File newfolder = new File(\"D:/carpeta con archivos año mío\");\r\n //System.out.println(newfolder.mkdir());\r\n\r\n // si fuera un directorio, para saber los archivos que contiene\r\n File carpeta = new File(\"D:/carpeta_con_archivos\");\r\n System.out.println(\"----listado archivos D:/carpeta_archivos------\");\r\n for (String archivo : carpeta.list()) {\r\n System.out.println(archivo);\r\n }\r\n\r\n //agregar una linea nueva a un archivo existente (METODO 1)\r\n /*try {\r\n //abra el archivo , TRUE en un forma append (agregar nuevos valores)\r\n FileWriter myFile2 = new FileWriter(\"d:/names.txt\", true);\r\n //cargar en memora ram del SO el contenido del archivo\r\n BufferedWriter dataFile = new BufferedWriter(myFile2);\r\n //agregar una nueva linea\r\n dataFile.write(\"\\nnueva linea tres\");\r\n dataFile.close();\r\n\r\n } catch (IOException e) {\r\n e.printStackTrace();\r\n }*/\r\n //agregar una linea nueva a un archivo existente (METODO 1 optimizado)\r\n /*try{\r\n BufferedWriter dataFile = new BufferedWriter(new FileWriter(\"d:/names.txt\",true));\r\n //agregamos la nueva linea\r\n dataFile.write(\"nueva linea sin borrar\");\r\n dataFile.close();\r\n } catch (Exception e) {\r\n e.printStackTrace();\r\n }*/\r\n // agregar nueva linea con metodo super optimizado en lineas (METODO FLAHS)\r\n try{\r\n PrintWriter myFile3 = new PrintWriter(new BufferedWriter(new FileWriter(\"d:/names.txt\", true)));\r\n myFile3.println(\"Otra nueva línea mezclando las dos librerías (PrintWriter + FileWriter) \");\r\n myFile3.close();\r\n\r\n } catch (Exception e) {\r\n e.printStackTrace();\r\n }\r\n\r\n\r\n }","public void Leer() throws FileNotFoundException\n {\n // se crea una nueva ruta en donde se va a ir a leer el archivo\n String ruta = new File(\"datos.txt\").getAbsolutePath(); \n archivo=new File(ruta); \n }","public static void LeerCaracter(File rutaLeer, File rutaEscribir) throws IOException {\n\n FileReader lector = new FileReader(rutaLeer);\n FileWriter escritor = new FileWriter(rutaEscribir);\n\n String cartelera = (\"--------------------------------------\\n\"\n + \" Cartelera de CineFBMoll\\n\"\n + \"--------------------------------------\\n\\n\");\n\n String linea = \"--------------------------------------\\n\\n\";\n\n //se escribe la cartelera\n for (int i = 0; i < cartelera.length(); i++) {\n escritor.write(cartelera.charAt(i));\n }\n\n int caracter;\n int contador = 0;\n boolean encontrarSigno = true;\n\n while ((caracter = lector.read()) != -1) {\n if (((char) caracter) != '#') {\n if (((char) caracter) != '{') {\n if (encontrarSigno) {\n for (int i = 0; i < datos[contador].length(); i++) {\n escritor.write(datos[contador].charAt(i)); // imprimir elemento de datos\n }\n escritor.write(\": \");\n encontrarSigno = false;\n }\n escritor.write(((char) caracter));\n } else {\n escritor.write(\"\\n\");\n escritor.write(\"\\n\");\n for (int i = 0; i < linea.length(); i++) {\n escritor.write(linea.charAt(i));\n }\n\n contador = 0;\n encontrarSigno = true;\n }\n } else {\n escritor.write(\"\\n\");\n escritor.write(\"\\n\");\n contador++;\n encontrarSigno = true;\n }\n }//while\n lector.close();// Cierra el archivo \n escritor.close();// Cierra el archivo \n\n }","private void dialogFichierInexistant(File file){\n\t\tJOptionPane.showMessageDialog(null, \"le fichier \" + file.getName() +\"\\n'existe pas\", \"Erreur\", JOptionPane.ERROR_MESSAGE);\n\t}","public void lesBok(String filen)throws Exception\n {\n liste.add(new Ord(\"null\"));//se siste linje i finnOrd-metod\n Scanner inn = new Scanner(new File(filen));//henter ord fra filen anngitt i kallet paa metode lesBok og legger det inn i scanner inn\n while (inn.hasNextLine())\n {\n String tempOrd = inn.nextLine();\n leggeTilOrd(tempOrd);//sender ord fra scanner via string til metode legeTilOrd\n }\n }","private void guardarComo() {\r\n\t\tJFileChooser guardar = new JFileChooser();\r\n\t\tFileNameExtensionFilter filtro = new FileNameExtensionFilter(\"obj\",\"obj\");\r\n\t\tguardar.setFileFilter(filtro);\r\n\t\tif(guardar.showSaveDialog(guardar) == JFileChooser.APPROVE_OPTION){\r\n\t\t\tGestion.setFichero(Gestion.extensionValida(guardar.getSelectedFile()));\r\n\t\t\ttry {\r\n\t\t\t\tif(!Gestion.existe(Gestion.getFichero())){\r\n\t\t\t\t\tGestion.escribir(Gestion.getFichero());\r\n\t\t\t\t\tGestion.setModificado(false);\r\n\t\t\t\t\tfrmLigaDeFtbol.setTitle(Gestion.getFichero().getName());\r\n\t\t\t\t}\r\n\t\t\t\telse{\r\n\t\t\t\t\tswitch(JOptionPane.showConfirmDialog(null, \"El archivo existe. Desea sobreescribirlo?\", \"Aviso\", JOptionPane.WARNING_MESSAGE)){\r\n\t\t\t\t\tcase JOptionPane.OK_OPTION:\r\n\t\t\t\t\t\tGestion.escribir(Gestion.getFichero());\r\n\t\t\t\t\t\tGestion.setModificado(false);\r\n\t\t\t\t\t\t\t\tfrmLigaDeFtbol.setTitle(Gestion.getFichero().getName());\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\t\t\t\t\t\t\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\tJOptionPane.showMessageDialog(null, e.getMessage(), \"Error\", JOptionPane.ERROR_MESSAGE);\r\n\t\t\t}\r\n\t\t}\r\n\t}","public void pruebaEscritura() {\n\t\tFileWriter fichero = null;\n\t\tPrintWriter pw = null;\n\t\ttry {\n\t\t\tfichero = new FileWriter(\"//172.16.1.141/Modelo_Raster/Varios/Monitoreo_Forestal/REDD/Metadatos/test.xml\");\n\t\t\tpw = new PrintWriter(fichero);\n\n\t\t\tfor (int i = 0; i < 10; i++)\n\t\t\t\tpw.println(\"Linea \" + i);\n\n\t\t}\n\t\tcatch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\tfinally {\n\t\t\ttry {\n\t\t\t\t// Nuevamente aprovechamos el finally para\n\t\t\t\t// asegurarnos que se cierra el fichero.\n\t\t\t\tif (null != fichero) fichero.close();\n\t\t\t}\n\t\t\tcatch (Exception e2) {\n\t\t\t\te2.printStackTrace();\n\t\t\t}\n\t\t}\n\t}","public String ouvrir(){\n \n JTextArea text=new JTextArea();\n FileNameExtensionFilter filter = new FileNameExtensionFilter (\n \"java\", \"java\");\n chooser.setFileFilter(filter);\n \n int ret=chooser.showOpenDialog(text);\n String path=\"\";\n if(ret==JFileChooser.APPROVE_OPTION){\n path=chooser.getSelectedFile().getAbsolutePath();\n }\n\n return path;\n }","private String setFichero(enumFicheros fichero)\n\t{\n\t\tswitch(fichero)\n\t\t{\n\t\tcase FICHERO_INFO_RANURA1:\n\t\t{\n\t\t\treturn fichero_info_ranura1;\n\t\t}\n\t\tcase FICHERO_INFO_RANURA2:\n\t\t{\n\t\t\treturn fichero_info_ranura2;\n\t\t}\n\t\tcase FICHERO_INFO_RANURA3:\n\t\t{\n\t\t\treturn fichero_info_ranura3;\n\t\t}\n\t\tcase FICHERO_PJ_RANURA1:\n\t\t{\n\t\t\treturn fichero_pj_ranura1;\n\t\t}\n\t\tcase FICHERO_PJ_RANURA2:\n\t\t{\n\t\t\treturn fichero_pj_ranura2;\n\t\t}\n\t\tcase FICHERO_PJ_RANURA3:\n\t\t{\n\t\t\treturn fichero_pj_ranura3;\n\t\t}\n\t\t}\n\t\treturn null;\n\t}","public void xuLyLuuHoaHoaDon(){\n JFileChooser fileChooser = new JFileChooser();\n fileChooser.setFileFilter(new FileFilter() {\n @Override\n public boolean accept(File file) {\n return file.getAbsolutePath().endsWith(\".txt\");\n }\n\n @Override\n public String getDescription() {\n return \".txt\";\n }\n });\n fileChooser.setFileFilter(new FileFilter() {\n @Override\n public boolean accept(File file) {\n return file.getAbsolutePath().endsWith(\".doc\");\n }\n\n @Override\n public String getDescription() {\n return \".doc\";\n }\n });\n int flag = fileChooser.showSaveDialog(null);\n if(flag == JFileChooser.APPROVE_OPTION){\n File file = fileChooser.getSelectedFile();\n try {\n OutputStreamWriter outputStreamWriter = new OutputStreamWriter(new FileOutputStream(file), Charset.forName(\"UTF-8\"));\n PrintWriter printWriter = new PrintWriter(outputStreamWriter);\n String lineTieuDe1 = \"----------------Phiếu Thanh Toán-----------------------\";\n String lineMaPTT = \"+Mã Phiếu Thanh Toán: \" + txtMaPTT.getText();\n String lineMaPDK = \"+Mã Phiếu Đăng Ký: \" + cbbMaPDK.getSelectedItem().toString();\n String lineSoThang = \"+Số Tháng: \" + txtSoThang.getText()+\"|\";\n String lineNgayTT = \"+Ngày Thanh Toán: \" + txtNgayTT.getText();\n String lineTienPhong = \"+Tiền Phòng: \" + txtTongTien.getText();\n String lineTienDV = \"+Tiền Dịch Vụ: \"+txtThanhToanTongCong.getText();\n String lineTieuDe2 = \"--------------------------------------------------------\";\n String lineTienPhaiTra =\"+Tiền Phải Trả: \" + txtTienPhaiTra.getText()+\" \";\n String lineTieuDe3 = \"--------------------------------------------------------\";\n \n printWriter.println(lineTieuDe1);\n printWriter.println(lineMaPTT);\n printWriter.println(lineMaPDK);\n printWriter.println(lineSoThang);\n printWriter.println(lineNgayTT);\n printWriter.println(lineTienPhong);\n printWriter.println(lineTienDV);\n printWriter.println(lineTieuDe2);\n printWriter.println(lineTienPhaiTra);\n printWriter.println(lineTieuDe3);\n \n printWriter.close();\n outputStreamWriter.close();\n \n } catch (Exception e) {\n e.printStackTrace();\n }\n JOptionPane.showMessageDialog(null, \"Đã lưu\");\n }\n \n }","public void readFromFile() {\n\n\t}","private void jMenuItem_ShowProspectActionPerformed(java.awt.event.ActionEvent evt) {//GEN-FIRST:event_jMenuItem_ShowProspectActionPerformed\n File fProspect = new File(\"Propsect_Relance.csv\");\n try {\n Desktop.getDesktop().open(fProspect);\n } catch (IOException ex) {\n Logger.getLogger(JFrame_Accueil.class.getName()).log(Level.SEVERE, null, ex);\n }\n }","public void grabarGrafoColoreado(String archivo) {\n\t\tPrintWriter salida = null;\n\t\ttry {\n\n\t\t\tsalida = new PrintWriter(new FileWriter(archivo));\n\t\t\tsalida.println(cantNodos + \" \" + cantColores);\n\n\t\t\tfor (int i = 0; i < cantNodos; i++)\n\t\t\t\tsalida.println(nodos.get(i).getNumero() + \" \" + nodos.get(i).getColor());\n\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t} finally {\n\t\t\tsalida.close();\n\t\t}\n\t}","public static void main(String[] args) {\n\r\n String contenido = \"\";\r\n\r\n try {\r\n FileReader in = new FileReader(\"./src/fichero_prueba.txt\");\r\n int c = in.read();\r\n\r\n while (c != -1) {\r\n contenido += (char) c;\r\n c = in.read();\r\n }\r\n in.close();\r\n } catch (IOException e){\r\n System.out.println(e.getMessage());\r\n }\r\n\r\n System.out.println(contenido);\r\n\r\n\r\n //LEER MENSAJE POR BLOQUES\r\n\r\n String contenido2 = \"\";\r\n\r\n try {\r\n BufferedReader inb = new BufferedReader(new FileReader(\"./src/fichero_prueba.txt\"));\r\n\r\n String linea = inb.readLine();\r\n while (linea!=null){\r\n contenido2 += linea+\"\\n\";\r\n linea = inb.readLine();\r\n }\r\n inb.close();\r\n } catch (IOException e){\r\n e.printStackTrace();\r\n }\r\n System.out.println(contenido2);\r\n\r\n }","private void openFile() {\n\t\t\n\t\n\t\t\t\n\t\tFile file = jfc.getSelectedFile();\n\t\tint a = -1;\n\t\tif(file==null&&!jta.getText().equals(\"\"))\n\t\t{\n\t\t\ta = JOptionPane.showConfirmDialog(this, \"저장?\");\n\t\t\n\t\t}\n\t\tswitch (a){\n\t\tcase 0:\n\t\t\ttry {\n\t\t\t\tint c = -1;\n\t\t\t\tif(file==null)\n\t\t\t\t{\n\t\t\t\t\tc = jfc.showSaveDialog(this);\n\t\t\t\t}\n\t\t\t\tif(file!= null || c ==0)\n\t\t\t\t{\t\n\t\t\t\t\tFileWriter fw = new FileWriter(jfc.getSelectedFile());\n\t\t\t\t\tfw.write(jta.getText());\n\t\t\t\t\tfw.close();\n\t\t\t\t\tSystem.out.println(\"파일을 저장하였습니다\");\n\t\t\t\t}\n\t\t\t} catch (Exception e2) {\n\t\t\t\t// TODO: handle exception\n\t\t\t\tSystem.out.println(e2.getMessage());\n\t\t\t}\n\t\tbreak;\n\t\tcase 1:\n\t\t\ttry {\n\t\t\t\tint j=-1;\n\t\t\t\tif(file==null)\n\t\t\t\t{\n\t\t\t\t\tj = jfc.showOpenDialog(this);\n\t\t\t\t}\n\t\t\t\tif(file!= null || j == 1)\n\t\t\t\t{\t\n\t\t\t\t\tFileReader fr = new FileReader(file);\n\n\t\t\t\t\tString str=\"\";\n\t\t\t\t\twhile((j=fr.read())!=-1)\n\t\t\t\t\t{\n\t\t\t\t\t\tstr = str+(char)j;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tjta.setText(str);\n\t\t\t\t\t\n\t\t\t\t\tsetTitle(file.getName());\n\t\t\t\t\t\n\t\t\t\t\tfr.close();\n\t\t\t\t}\n\t\t\t}\t\n\t\t\tcatch (Exception e2) {\n\t\t\t\t// TODO: handle exception\n\t\t\t\tSystem.out.println(e2.getMessage());\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tint d= jfc.showOpenDialog(this);\n\t\t\n\t\tif(d==0)\n\t\t\ttry {\n\t\t\t\tFileReader fr = new FileReader(jfc.getSelectedFile());\n\t\t\t\tint l;\n\t\t\t\tString str=\"\";\n\t\t\t\twhile((l=fr.read())!=-1)\n\t\t\t\t{\n\t\t\t\t\tstr = str+(char)l;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tjta.setText(str);\n\t\t\t\t\n\t\t\t\tfr.close();\n\t\n\t\t\t\t\t\n\t\t\t} catch (Exception e2) {\n\t\t\t\t// TODO: handle exception\n\t\t\t\tSystem.out.println(e2.getMessage());\n\t\t\t}\n\t}","final public void GuardarCuadruplos() throws ParseException {\ntry {\n // Crea un cuadro de dialogo. El input se guarda en strNomArchivo\n String strNomArchivo = \"\";\n\n // Si el campo quedo vacío o se cerró la ventana, volver a mostrarlo\n while (strNomArchivo==null || strNomArchivo.trim().isEmpty()) {\n strNomArchivo = (String)JOptionPane.showInputDialog(\n null, \"Escribe el nombre que tendra el archivo\", \"Input\", JOptionPane.PLAIN_MESSAGE, null, null, null);\n }\n\n // objeto printwriter con el nombre del archivo\n PrintWriter codigoObj = new PrintWriter(strNomArchivo);\n\n // Agrega uno por uno los cuadruplos al archivo\n for (int i=0; i < cuadruplos.size(); i++) {\n codigoObj.println( Cuadruplo.returnCuadruplo( (Cuadruplo)cuadruplos.get(i) ) );\n }\n\n // cierra el archivo\n codigoObj.close();\n\n } catch(FileNotFoundException e) {\n System.out.println(e.getMessage());\n }\n }","public void LoadTxt(File Arquivo) {\n if (Arquivo.exists()) {\r\n\r\n try {\r\n\r\n FileReader FR = new FileReader(Arquivo);\r\n BufferedReader BW = new BufferedReader(new InputStreamReader(new FileInputStream(Arquivo.getAbsolutePath()), \"ISO-8859-1\"));\r\n\r\n //BufferedReader BW = new BufferedReader(FR);\r\n\r\n String dados;\r\n String[] paraArray = new String[3];\r\n String matricula;\r\n \r\n String serie = Arquivo.getName();\r\n int pos = serie.lastIndexOf(\".\");\r\n if (pos > 0) {\r\n serie = serie.substring(0, pos);\r\n }\r\n\r\n Sala novaSala = new Sala(serie); //CRIANDO SALA COM NOME DE TURMA\r\n salas2.add(novaSala); // ADICIONANDO SALA NA LISTA DE SALAS\r\n while ((dados = BW.readLine()) != null) {\r\n paraArray = dados.split(\";\");\r\n\r\n matricula = /*Integer.parseInt*/ (paraArray[0]);\r\n //senha = /*Integer.parseInt*/(paraArray[2]);\r\n Dados novoDado = new Dados(matricula, paraArray[1], paraArray[2]);\r\n\r\n novoDado.setSerie(serie); //ADICIONANDO TURMA AO DADO\r\n novaSala.getDadosalas().add(novoDado); //ADICIONANDO DADOS A LISTA DE DADOS QUE ESTA EM SALA\r\n\r\n }\r\n \r\n\r\n BW.close();\r\n FR.close();\r\n\r\n } catch (Exception e) {\r\n System.out.println(\"Erro ao carregar arquivo acima\");\r\n System.out.println(e.getMessage());\r\n\r\n }\r\n\r\n } else {\r\n System.out.println(\"Nenhum arquivo de dados encontrado\");\r\n }\r\n\r\n }","public void escribir(String direccion,String texto) {\n try {\n FileWriter writer = new FileWriter(direccion);\n PrintWriter print = new PrintWriter(writer);\n print.print(texto);\n writer.close();\n } catch (IOException e) {\n System.out.println(e.getMessage());\n }\n }","private static void createFileContribuicaoUmidade() throws IOException{\r\n\t\tInteger contribuicaoDefault = 0;\r\n\t\tarqContribuicaoUmidade = new File(pathContribuicaoUmidade);\r\n\t\tif(!arqContribuicaoUmidade.exists()) {\r\n\t\t\tarqContribuicaoUmidade.createNewFile();\r\n\t\t\tFileWriter fw = new FileWriter(getArqContribuicaoUmidade());\r\n\t\t\tBufferedWriter buffWrite = new BufferedWriter(fw);\r\n\t\t\tbuffWrite.append(contribuicaoDefault.toString() + String.valueOf('\\n'));\r\n\t\t\tbuffWrite.close();\r\n\t\t}else {//Se arquivo existir\r\n\t\t\tFileReader fr = new FileReader(getArqContribuicaoUmidade());\r\n\t\t\tBufferedReader buffRead = new BufferedReader(fr);\r\n\t\t\tif(!buffRead.ready()) {/*Se o arquivo se encontar criado mas estiver vazio(modificado)*/\r\n\t\t\t\tFileWriter fw = new FileWriter(arqContribuicaoUmidade);\r\n\t\t\t\tBufferedWriter buffWrite = new BufferedWriter(fw);\r\n\t\t\t\tbuffWrite.append(contribuicaoDefault.toString() + String.valueOf('\\n'));/*Inicializa o arquivo com uma contribuicao Inicial*/\r\n\t\t\t\tbuffWrite.close();\r\n\t\t\t}\r\n\t\t\tbuffRead.close();\r\n\t\t}\r\n\t}","public static void processOneFileSelecction()\n {\n int answer = JSoundsMainWindowViewController.jfcOneFile.showOpenDialog(JSoundsMainWindowViewController.jSoundsMainWindow);\n \n if (answer == JFileChooser.APPROVE_OPTION)\n {\n File actualDirectory = JSoundsMainWindowViewController.jfcOneFile.getCurrentDirectory();\n String directory = actualDirectory.getAbsolutePath() + \"/\" + JSoundsMainWindowViewController.jfcOneFile.getSelectedFile().getName();\n UtilFunctions.listOneFile(JSoundsMainWindowViewController.jfcOneFile.getSelectedFile());\n JSoundsMainWindowViewController.orderBy(true, false, false); \n }\n }","public static void main(String[] args) {\n\r\n String cFields = \"NIC,SIMBOLO_VARIABLE,FECHA_VENCIMIENTO,FECHA_PAGO_OPORTUNO,FECHA_EMISION,NUMERO_FACTURA,INDICATIVO_SUMINISTRO,CIIU,TIPO_COBRO,SECUENCIAL_RECIBO,NIS,TIPO_SERVICIO,ORDEN_LECTURA,MEDIDOR,LECT_ANTERIOR,LECT_ACTUAL,FECHA_LECTURA_ACTUAL,CONSUMO_FACTURADO,VALOR_FACTURA,GRUPO_FAMILIAR,PRECIO_UNITARIO_CU,IND_VISUSALIZACION_BARCODI,IMPORTE_TOTAL_DEUDA,CANTIDAD_FACTURAS_ADEUDADAS,DESC_ANOMALIA_LECTURA,IMPORTE_TOTAL_FACTURA,SUBTOTAL_FACTURA,DESCRIPCION_TARIFA,CONSUMO_PROMEDIO,DIAS_FACTURADOS,CLAVE_ORDEN_FACTURA,PROPIEDAD_EQUIPO_MEDIDA,UNICOM,RUTA,ITINERARIO\";\r\n fields = cFields.split(\",\");\r\n\r\n readConfiguracion();\r\n\r\n if (configuracion.size() != fields.length) {\r\n System.out.println(\"Longitud de campos y configuración es diferente. Fields: \" + fields.length + \" Configuracion: \" + configuracion.size());\r\n Utilidades.AgregarLog(\"Longitud de campos y configuración es diferente. Fields: \" + fields.length + \" Configuracion: \" + configuracion.size());\r\n return;\r\n }\r\n\r\n if (configuracion.size() > 0) {\r\n System.out.println(\"Campos a leer: \" + configuracion.size());\r\n Utilidades.AgregarLog(\"Campos a leer: \" + configuracion.size());\r\n String ruta = \"C:\\\\REPARTO\\\\\";\r\n File directorio = new File(ruta);\r\n Utilidades.AgregarLog(\"Descomprimiendo archivos ruta:\" + ruta);\r\n DescomprimirArchivosCarpeta(directorio);\r\n Utilidades.AgregarLog(\"Procesando archivos de reparto en ruta:\" + ruta);\r\n ProcesarDirectorio(directorio);\r\n\r\n } else {\r\n System.out.println(\"No se ha cargado la configuracion\");\r\n Utilidades.AgregarLog(\"No se ha cargado la configuracion\");\r\n }\r\n\r\n }","public void loadFile() {\n\t\t\n\t\tString fileloc = \"\";\n\t\tif(!prf.foldername.getText().equals(\"\"))\n\t\t\tfileloc += prf.foldername.getText()+\"/\";\n\t\t\n\t\tString filename = JOptionPane.showInputDialog(null,\"Enter the filename.\");\n\t\tfileloc += filename;\n\t\tFile fl = new File(fileloc);\n\t\t\n\t\tif(!fl.exists()) {\n\t\t\tJOptionPane.showMessageDialog(null, \"The specified file doesnt exist at the given location.\");\n\t\t} else {\n\t\t\tMinLFile nminl = new MinLFile(filename);\n\t\t\t\n\t\t\ttry {\n\t\t\t\tFileReader flrd = new FileReader(fileloc);\n\t\t\t\tBufferedReader bufread = new BufferedReader(flrd);\n\t\t\t\t\n\t\t\t\tnminl.CodeArea.setText(\"\");\n\t\t\t\n\t\t\t\tString str;\n\t\t\t\twhile((str = bufread.readLine()) != null) {\n\t\t\t\t\tDocument doc = nminl.CodeArea.getDocument();\n\t\t\t\t\ttry {\n\t\t\t\t\tdoc.insertString(doc.getLength(), str, null);\n\t\t\t\t\t} catch (BadLocationException e) {\n\t\t\t\t\t\te.printStackTrace();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tbufread.close();\n\t\t\t\tflrd.close();\n\t\t\t\n\t\t\t} catch (IOException e) {\n\t\t\t\te.printStackTrace();\n\t\t\t}\t\t\n\t\t\t\n\t\t\tJComponent panel = nminl;\n\t\t\t\n\t\t\ttabbedPane.addTab(filename, null, panel,\n\t\t\t\t\tfilename);\t\t\n\t\t\ttabbedPane.setMnemonicAt(0, 0);\n\t\t}\t\n\t}","public static String cargarPreguntas(String fileName){\n String line = null; \n try {\n //Para lectura del archivo\n FileReader fileReader =\n new FileReader(fileName); \n \n //BufferedReader para optimización de recursos\n BufferedReader bufferedReader =\n new BufferedReader(fileReader);\n \n// Lee línea por línea, verifica que tengan algo de texto\n while(((line = bufferedReader.readLine()) != null)) {\n if ((line.length() > 0) && !(line.startsWith(\"//\"))){\n// Para ignorar las líneas de comentario en el archivo de texto\n //if (!(line.startsWith(\"//\"))){\n// Crea una lista de Strings para cada línea a evaluar\n List<String> listaLinea = new ArrayList<>(Arrays.asList(line.split(\";\")));\n// Impresión de prueba del ArrayList(descomentar)\n// System.out.println(listaLinea);\n \n //Obtiene lista de Respuestas, en tipo String\n List <String >resp = listaLinea.subList(1,listaLinea.size());\n //Creación de Respuestas (bajo el debido constructor) en un HashSet\n HashSet<Respuesta> respuestas = new HashSet(); \n for (int i = 0; i < resp.size();i++){\n if (i == 0){\n //Identifica la respuesta correcta\n respuestas.add(new Respuesta(resp.get(i), true));\n }\n else{\n //Identifica las respuestas incorrectas\n respuestas.add(new Respuesta(resp.get(i), false));\n } \n }\n //System.out.println(resp); Impresión de prueba (descomentar)\n \n //Agrega Preguntas y Respuestas a nuestro HashSet y HashMap\n Almacenamiento.getPreguntas().add(new Pregunta(listaLinea.get(0)));\n Almacenamiento.getMapaPR().put(new Pregunta(listaLinea.get(0)), respuestas); \n //}\n }\n }\n //Impresiones de prueba, descomentar.\n// for(Pregunta p: Almacenamiento.getPreguntas()){\n// System.out.println(p.toString()); \n// } \n// Almacenamiento.getMapaPR().forEach((k,v)-> System.out.println(k+\", \"+v));\n \n // Siempre cerrar archivo, para optimizar recursos\n bufferedReader.close(); \n }\n //Detalle de exception impreso en consola\n catch(FileNotFoundException ex) {\n System.out.println(\n \"No se pudo abrir archivo '\" +\n fileName + \"'\"); \n }\n //Detalle de exception impreso en consola\n catch(IOException ex) {\n System.out.println(\n \"Error leyendo archivo '\"\n + fileName + \"'\"); \n }\n return null;\n }","private void chooseRemaindersFile() {\n JFileChooser setEF = new JFileChooser(System.getProperty(\"user.home\"));\n setEF.setDialogType(JFileChooser.OPEN_DIALOG);\n setEF.showDialog(this, \"Выбрать файл\");\n remainderFile = setEF.getSelectedFile();\n putLog(\"Файл остатков: \" + remainderFile.getPath());\n jbParse.setEnabled(workingDirectory != null && remainderFile != null);\n }","public ArrayList<String> Info_Disco_Pel_Rep4(String genero) {\r\n String line;\r\n ArrayList<String> Lista_datos_nombre_genero = new ArrayList();\r\n try (BufferedReader br = new BufferedReader(new FileReader(\"src/Archivos/cat_peliculas.txt\"))) {\r\n while ((line = br.readLine()) != null) {\r\n String[] info_disco = line.split(\";\");\r\n if (info_disco[2].equals(genero)) {\r\n Lista_datos_nombre_genero.add(info_disco[0]);\r\n }\r\n }\r\n } catch (IOException ex) {\r\n System.out.println(ex);\r\n }\r\n return Lista_datos_nombre_genero;\r\n }","public static void crearPartida() throws FileNotFoundException, IOException, ExcepcionesFich {\n\t\tLecturaFicheros.AllLecture(\"C:\\\\Users\\\\Erick\\\\pruebaPOO.txt\");\n\t\tinterfaz = new GUI(0);\t\t\n\t}","public String afficherInfoFichierTexte(){\n\t\tString fichierComplet = \"\";\n\t\tfor (Joueur j: ListJoueur) {\n\t\t\tfichierComplet += j.afficherFichierTexte();\n\t\t}\n\t\treturn fichierComplet;\n\t}","public ArrayList<String> Info_Disc_Mus_Compras(String genero) {\r\n ArrayList<String> Lista_nombre = Info_Disco_Mus_Rep1(genero);\r\n ArrayList<String> Lista_datos_compras = new ArrayList();\r\n String line;\r\n try (BufferedReader br = new BufferedReader(new FileReader(\"src/Archivos/Compra_Musica.txt\"))) {\r\n while ((line = br.readLine()) != null) {\r\n String[] info_disco_compra = line.split(\";\");\r\n for (int s = 0; s < Lista_nombre.size(); s++) {\r\n if (Lista_nombre.get(s).equals(info_disco_compra[3])) {\r\n Lista_datos_compras.add(info_disco_compra[3]);\r\n Lista_datos_compras.add(info_disco_compra[5]);\r\n }\r\n }\r\n }\r\n } catch (IOException ex) {\r\n System.out.println(ex);\r\n }\r\n return Lista_datos_compras;\r\n }","public ArrayList<String> Info_Disco_Pel_Rep1(String genero) {\r\n String line;\r\n ArrayList<String> Lista_datos_nombre_genero = new ArrayList();\r\n try (BufferedReader br = new BufferedReader(new FileReader(\"src/Archivos/cat_peliculas.txt\"))) {\r\n while ((line = br.readLine()) != null) {\r\n String[] info_disco = line.split(\";\");\r\n if (info_disco[2].equals(genero)) {\r\n Lista_datos_nombre_genero.add(info_disco[0]);\r\n }\r\n }\r\n } catch (IOException ex) {\r\n System.out.println(ex);\r\n }\r\n return Lista_datos_nombre_genero;\r\n }","public static void RT() {//metodo para leer la informacion del txt , presente en todas las clases que se guardan en un txt\n\t\treadTxt(\"usuarios.txt\", usersList);\n\t}","public void lecture() throws FileNotFoundException, IOException {\n \n //ouverture du fichier en lecture\n InputStream is = this.getClass().getClassLoader().getResourceAsStream(adresseFichier);\n InputStreamReader ir = new InputStreamReader(is);\n BufferedReader fichier = new BufferedReader(ir);\n \n //Lecture ligne à ligne\n String ligne;\n int numLigne = 0;\n while((ligne = fichier.readLine()) != null){\n //parsage de la ligne\n this.parseLigne(numLigne, ligne);\n numLigne++;\n }\n }","private void readSavedFile() {\n\n String[] files = new String[0];\n \n // On récupère la liste des fichiers\n File file = new File(folderName);\n\n // check if the specified pathname is directory first\n if(file.isDirectory()){\n //list all files on directory\n files = file.list();\n }\n\n if (files != null) {\n for(String currentFile : files) {\n Vehicule voiture;\n try {\n FileInputStream fileIn = new FileInputStream(folderName + \"/\" + currentFile);\n ObjectInputStream in = new ObjectInputStream(fileIn);\n voiture = (Vehicule) in.readObject();\n addVoitureToList(voiture);\n in.close();\n fileIn.close();\n } catch (IOException i) {\n i.printStackTrace();\n return;\n } catch (ClassNotFoundException c) {\n System.out.println(\"#Erreur : Impossible de récupérer l'objet \" + currentFile);\n c.printStackTrace();\n return;\n }\n }\n }\n }","public static void main(String[] args) throws IOException {\n File archivo = new File(\"/Users/Germayn/Documents/NetBeansProjects/busquedalineal/archivoprueba.txt\");\r\n \r\n Scanner teclado = new Scanner(System.in);\r\n \r\n System.out.println(\"palabra a buscar\");\r\n String palabra = teclado.nextLine();\r\n System.out.println(\"\");\r\n \r\n buscarpalabra(archivo,palabra);\r\n \r\n }","private void viewAllInfo(){\r\n try{\r\n Scanner scanner = new Scanner(file);\r\n String info;\r\n\r\n while (scanner.hasNext()){\r\n String line = scanner.nextLine();\r\n String[] components = line.split(separator);\r\n info = \" Name: \" + components[0] + \"\\n\";\r\n info += \" Phone No.: \"+components[1]+\"\\n\";\r\n info += \" Email: \"+components[2]+\"\\n\";\r\n info += \" Address: \"+components[3]+\"\\n\";\r\n textAreaFromAllInfo.append(info+\"\\n\");\r\n }\r\n\r\n }catch (IOException e){\r\n fileError();\r\n }\r\n }","void citire(FileReader f);","public void fillFilenames() {\r\n if (this.pl_LastFiles.getParam(\"nodelist-file\") != null\r\n && this.pl_LastFiles.getParam(\"edgelist-file\") != null) {\r\n this.nodefileText.setText(this.pl_LastFiles.getParam(\"nodelist-file\"));\r\n this.edgeFileText.setText(this.pl_LastFiles.getParam(\"edgelist-file\"));\r\n } else {\r\n this.nodefileText.setText(\"examples\" + System.getProperty(\"file.separator\") + \"20nodes.txt\");\r\n this.edgeFileText.setText(\"examples\" + System.getProperty(\"file.separator\") + \"20edges.txt\");\r\n }\r\n }","public n501070324_PedidosAssistencia() {\n super(\"Pedidos.txt\");\n }","private void winOpen() {\n try {\n content = Files.readAllLines(Paths.get(FILE_PATH_INDEX_TXT), Charset.forName(\"cp1251\"));\n String[] Str = content.get(0).split(\";\");\n mapIndexes = new HashMap();\n int i = 0;\n for (String string : Str) {\n mapIndexes.put(string, ++i);\n }\n setLocation(main.getLocation().x + main.getWidth(), main.getLocation().y + this.getHeight() - 10);\n } catch (IOException ex) {\n JOptionPane.showOptionDialog(this, \"Ошибка\", \"Не найден индексный файл!\", JOptionPane.DEFAULT_OPTION,\n JOptionPane.ERROR_MESSAGE, null, null, null);\n }\n\n }","public void Horas() {\r\n File archivo = null;\r\n FileReader fr = null;\r\n BufferedReader br = null;\r\n \r\n try {\r\n // Apertura del fichero y creacion de BufferedReader para poder\r\n // hacer una lectura comoda (disponer del metodo readLine()).\r\n \r\n \r\n // Lectura del fichero\r\n String linea;\r\n \r\n for (a=0;a<5;a++){\r\n if (a==0){\r\n categoria=\"Embarazadas\";\r\n }\r\n if (a==1){\r\n categoria=\"Regulares\";\r\n }\r\n if (a==2){\r\n categoria=\"Discapacitados\";\r\n }\r\n if (a==3){\r\n categoria=\"Mayores\";\r\n }\r\n if (a==4){\r\n categoria=\"Corporativos\";\r\n }\r\n archivo = new File (System.getProperty(\"user.dir\")+\"/Clientes/\"+categoria+\".txt\");\r\n fr = new FileReader (archivo);\r\n br = new BufferedReader(fr);\r\n while((linea=br.readLine())!=null)\r\n if (leerHora == contador){\r\n comparar = linea.substring(0,2);\r\n \r\n if (\"09\".equals(comparar)){\r\n nueve++;\r\n }\r\n if (\"10\".equals(comparar)){\r\n diez++;\r\n }\r\n if (\"11\".equals(comparar)){\r\n once++;\r\n }\r\n if (\"13\".equals(comparar)){\r\n una++;\r\n }\r\n if (\"14\".equals(comparar)){\r\n dos++;\r\n }\r\n if (\"15\".equals(comparar)){\r\n tres++;\r\n }\r\n if (\"16\".equals(comparar)){\r\n cuatro++;\r\n }\r\n \r\n contador +=1;\r\n leerHora += 6;\r\n }\r\n else{\r\n contador += 1;\r\n }\r\n }\r\n }\r\n catch(Exception e){\r\n e.printStackTrace();\r\n }finally{\r\n // En el finally cerramos el fichero, para asegurarnos\r\n // que se cierra tanto si todo va bien como si salta \r\n // una excepcion.\r\n try{ \r\n if( null != fr ){ \r\n fr.close(); \r\n } \r\n }catch (Exception e2){ \r\n e2.printStackTrace();\r\n }\r\n }\r\n }","private void lesFil()\n\t{\n\t\tDATAFIL = datafil(false);\n\n\t\ttry ( ObjectInputStream innfil = new ObjectInputStream( new FileInputStream( DATAFIL ) ) )\n\t\t{\n\t\t\tbr = (Boligregister) innfil.readObject();\n\t\t\tvisMelding( \"Data er hentet fra fil.\" );\n\t\t}\n\t\tcatch(ClassNotFoundException cnfe)\n\t\t{\n\t\t\tvisMelding( \"<html>Feil:<br><br>\" + cnfe.getMessage() + \"<br><br>Oppretter tom datafil. Tar vare på gammel datafil.</html>\" );\n\t\t\ttomtRegister();\n\t\t\tDATAFIL = datafil(true);\n\t\t\tskrivTilFil(false);\n\t\t}\n\t\tcatch(FileNotFoundException fne)\n\t\t{\n\t\t\tvisMelding( \"Ingen datafil funnet. Oppretter tom datafil.\" );\n\t\t\ttomtRegister();\n\t\t\tskrivTilFil(false);\n\t\t}\n\t\tcatch(IOException ioe)\n\t\t{\n\t\t\tvisMelding( \"<html>Innlesingsfeil. Oppretter tom datafil. Tar vare på gammel datafil.</html>\" );\n\t\t\ttomtRegister();\n\t\t\tDATAFIL = datafil(true);\n\t\t\tskrivTilFil(false);\n\t\t}\n\t}","public static void main(String[] args) {\n\t\tFileUTL fUtl = new FileUTL();\n\t\tString fileAddres = \"C:\\\\Users\\\\lenovo\\\\Desktop\\\\医嘱和对应路径信息\\\\\";\n\t\tString filename = fileAddres+\"12个病人的医嘱信息-utf8.csv\";\n\t\tString splitSign = \",\";\n\t\tString dateSign = \"/\";\n\t\tfUtl.readFile(filename, splitSign, dateSign);\n\t}","public ExcluirFilme() {\n initComponents();\n setTitle(\"LocVideo\");\n AtualizarCombo();\n }","public static void main(String[] args) {\n\t\t\r\n\t\ttry {\r\n\t\t\tFile f = new File(\"MonFichier.txt\");\r\n\t\t\tFileReader fr = new FileReader(f);\r\n\t\t\t//flot de communication pour les caractères,\r\n\t\t\t//qui se connecte à un fichier\r\n\t\t\tBufferedReader br = new BufferedReader(fr);\r\n\t\t\t//flot de traitement pour les caractères (buffer)\r\n\t\t\t//ce flot est chaîné au FileReader\r\n\t\t\tString ligne = null; // contiendra chaque ligne\r\n\t\t\twhile ((ligne = br.readLine()) != null) {\r\n\t\t\t\tSystem.out.println(ligne);\r\n\t\t\t}\r\n\t\t\tbr.close();\r\n\t\t} catch (FileNotFoundException e) {\r\n\t\t\t// TODO Auto-generated catch block\r\n\t\t\te.printStackTrace();\r\n\t\t} catch (IOException e) {\r\n\t\t\t// TODO Auto-generated catch block\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t\t\r\n\r\n\t}","@Override\n public void actionPerformed(ActionEvent e) {\n int returnVal = fc.showOpenDialog(panel);\n if(returnVal == JFileChooser.APPROVE_OPTION){\n file = fc.getSelectedFile();\n System.out.println(file);\n \n try {\n Scanner scanner = new Scanner(file);\n String appendString = \"\";\n \n while(scanner.hasNext()){\n String oneString = scanner.nextLine();\n txtArea.append(oneString + \"\\n\");\n }\n \n try {\n read_characters(file.toString());\n } catch (IOException e1) {\n // TODO Auto-generated catch block\n e1.printStackTrace();\n }\n \n resultArea.append(resultString);\n resultPane.setText(resultString);\n } catch (FileNotFoundException e1) {\n // TODO Auto-generated catch block\n e1.printStackTrace();\n }\n \n //Print ID table\n Map<String,Integer> map = new TreeMap<String,Integer>(userDefinedWords);\n identifierTableArea.append(\"Number of Occurences \" + \"\\t\" +\n \t\t\t\t\t\t\t\"Symbol\" + \"\\n\\n\");\n Iterator iter = \n \t\tmap.entrySet().iterator();\n while(iter.hasNext()){\n \t Map.Entry pair = \n \t\t\t (Map.Entry)iter.next();\n \t identifierTableArea.append(\n \t\t\t pair.getValue() + \"\\t\\t\" + pair.getKey() + \"\\n\");\n }\n \n }\n }","public ArrayList<String> Info_Disc_Pel_Compras(String genero) {\r\n ArrayList<String> Lista_nombre = Info_Disco_Pel_Rep4(genero);\r\n ArrayList<String> Lista_datos_compras = new ArrayList();\r\n String line;\r\n try (BufferedReader br = new BufferedReader(new FileReader(\"src/Archivos/Compra_Peliculas.txt\"))) {\r\n while ((line = br.readLine()) != null) {\r\n String[] info_disco_compra = line.split(\";\");\r\n for (int s = 0; s < Lista_nombre.size(); s++) {\r\n if (Lista_nombre.get(s).equals(info_disco_compra[3])) {\r\n Lista_datos_compras.add(info_disco_compra[3]);\r\n Lista_datos_compras.add(info_disco_compra[5]);\r\n }\r\n }\r\n }\r\n } catch (IOException ex) {\r\n System.out.println(ex);\r\n }\r\n return Lista_datos_compras;\r\n }","static void LeerArchivo(){ \r\n \t//iniciamos el try y si no funciona se hace el catch\r\n\r\n try{ \r\n \t//se crea un objeto br con el archivo de txt\r\n \tBufferedReader br = new BufferedReader( \r\n \tnew FileReader(\"reporte.txt\")\r\n );\r\n String s;\r\n //Mientras haya una linea de texto se imprime\r\n while((s = br.readLine()) != null){ \r\n System.out.println(s);\r\n }\r\n //se cierra el archivo de texto\r\n br.close(); \r\n } catch(Exception ex){\r\n \t//si no funciona se imprime el error\r\n System.out.println(ex); \r\n }\r\n }","void selectFile(){\n JLabel lblFileName = new JLabel();\n fc.setCurrentDirectory(new java.io.File(\"saved\" + File.separator));\n fc.setDialogTitle(\"FILE CHOOSER\");\n FileNameExtensionFilter xmlfilter = new FileNameExtensionFilter(\n \"json files (*.json)\", \"json\");\n fc.setFileFilter(xmlfilter);\n int response = fc.showOpenDialog(this);\n if (response == JFileChooser.APPROVE_OPTION) {\n lblFileName.setText(fc.getSelectedFile().toString());\n }else {\n lblFileName.setText(\"the file operation was cancelled\");\n }\n System.out.println(fc.getSelectedFile().getAbsolutePath());\n }","public static void main(String[] args) {\n File myFile= new File(\"D:/yeah.txt\");\n System.out.println(\"Iiim file bnuu? \"+myFile.exists());\n\t System.out.println(\"Zaagdsan zam deeree bnuu?\"+myFile.isFile());\t \n\t System.out.println(\"Ug file iin ner \"+myFile.getName());\n\t System.out.println(\"Ug file iin zam \"+myFile.getPath());\n\t}","@Override\r\n\t\t\tpublic void actionPerformed(ActionEvent arg0) {\n\t\t\t\tJFileChooser chooser = new JFileChooser();\r\n\t\t\t\tFileNameExtensionFilter filter = new FileNameExtensionFilter(\r\n\t\t\t\t\t\t\"Excel Files\", // 파일 이름에 창에 출력될 문자열\r\n\t\t\t\t\t\t\"xls\"); // 파일 필터로 사용되는 확장자. *.xml 만 나열됨\r\n\t\t\t\tchooser.setFileFilter(filter); // 파일 다이얼로그에 파일 필터 설정\r\n\t\t\t\tchooser.setMultiSelectionEnabled(false);//다중 선택 불가\r\n\r\n\t\t\t\t// 파일 다이얼로그 출력\r\n\t\t\t\tint ret = chooser.showOpenDialog(null);\r\n\t\t\t\tif (ret != JFileChooser.APPROVE_OPTION) { // 사용자가 창을 강제로 닫았거나 취소\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t// 버튼을 누른 경우\r\n\t\t\t\t\tJOptionPane.showMessageDialog(null, \"파일을 선택하지 않았습니다\", \"경고\",\r\n\t\t\t\t\t\t\tJOptionPane.WARNING_MESSAGE);\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\t\t\t\t// 사용자가 파일을 선택하고 \"열기\" 버튼을 누른 경우\r\n\t\t\t\tString readFilePath = chooser.getSelectedFile().getPath(); // 파일 경로명을 알아온다.\t\t\t\t\r\n\t\t\t\tShowPatientInfo_K showPatientInfo = new ShowPatientInfo_K(readFilePath);\r\n\t\t\t}","private static void recorrerFicheros(File[] ficheros, int indice,\n\t\t\tString texto) {\n\t\tif (indice <= ficheros.length - 1) {\n\t\t\tif (practica6.Prueba1.\n\t\t\t\t\tesFicheroGrafico(ficheros[indice])) {\n\t\t\t\tImageIcon img = new ImageIcon(ficheros[indice].\n\t\t\t\t\t\tgetPath().toLowerCase());\n\t\t\t\t// comprueba si tiene alguna coincidencia\n\t\t\t\tif (ficheros[indice].getName().\n\t\t\t\t\t\tindexOf(texto) != -1) {\n\t\t\t\t\tSystem.out.printf(\"%s%n\", ficheros[indice].\n\t\t\t\t\t\t\tgetPath());\n\t\t\t\t\t// lo agrega al vector\n\t\t\t\t\tv.add(img);\n\t\t\t\t}\n\t\t\t\tindice++;\n\t\t\t\trecorrerFicheros(ficheros, indice, texto);\n\t\t\t} else {\n\t\t\t\tindice++;\n\t\t\t\trecorrerFicheros(ficheros, indice, texto);\n\t\t\t}\n\t\t}\n\t}","public void readFromFile(String doc) {\n\t\tString newline = \"\\n\";\n\t\tString doc_text = \"\";\n\t\tint count = 0;\n\t\tString line=\"\";\n\t\t\n\t\t//for random button\n\t\tint buttoncount = 0;\n\t\tArrayList<JButton> list = new ArrayList<JButton>();\n\t\t\n\t\ttry{\n\t\t\t//input stream for reading special characters in German\t\n\t\t\t//documents from folder textfiles\n \tBufferedReader rd = new BufferedReader(new InputStreamReader(new FileInputStream(\"textfiles/\" + doc),StandardCharsets.UTF_8));\n \twhile ((line=rd.readLine()) != null) {\n \t\t//question text\n \t\tif (count == 0) {\n \t\t\t\n \t\t\tswitch(bg) {\n \t\t\t\tcase(1):\n \t\t\t\tdoc_text = \"Dein Charakter lässt sich durch 4 Merkmale beschreiben.\\r\\n\" + \n \t\t\t\t\t\t\"Wähle als 1. dein Persönlichkeitsmerkmal:\" + newline;\n \t\t\t\t\tcount++;\n \t\t\t\tbreak;\n \t\t\tcase(2):\n \t\t\t\tdoc_text = \"Wähle das 2. Merkmal ein Ideal:\" + newline;\n \t\t\t\tcount++;\n \t\t\t\tbreak;\n \t\t\tcase(3):\n \t\t\t\tdoc_text = \"Entscheide dich als nächstes für eine Bindung:\"+ newline;\n \t\t\t\tcount++;\n \t\t\t\tbreak;\n \t\t\tcase(4):\n \t\t\t\tdoc_text = \"Deine letzte Frage. Im Anschluss wird dein Charakter generiert.\\r\\n\" + \n \t\t\t\t\t\t\"Wähle ein Makel der dich beschreibt:\"+ newline;\n \t\t\t\tcount++;\n \t\t\t\tbreak;\n \t\t\tdefault:\n \t\t\t\tdoc_text = doc_text + line + newline;\n \t\t\t\tbreak;\n \t\t\t}\n \t\t\ttxt.setText(doc_text);\n \t\t\tif(randomButton == true) {\n\t\t \t\ttxt.setVisible(false);\n \t\t\t\t}\n \t\t\tpanelA.add(txt);\n \t\t}\n \t\t\n \t\t//buttonname;next document(;information)\n \t\tif (count == 1) {\n \t\t\tString[] tokens = line.split(\";\");\n \t\t\tJButton button = new JButton (tokens[0]);\n \t\t\t\tbutton.setFont(new Font(\"Rockwell\", Font.PLAIN, 24));\n \t\t\t//for random button: add buttons to a list and count them\n \t\t\tlist.add(button);\n \t\t\tbuttoncount++;\n \t\t\t\tif(randomButton == true) {\n \t\t\t\t\tbutton.setVisible(false);\n \t\t\t\t}\n \t\t\t\t\n \t\t\t\tpanelB.add(button);\n\t\t\t\t\tbutton.addActionListener( new ActionListener() {\n\t\t\t\t\t\tpublic void actionPerformed(ActionEvent ae) {\n\t\t\t\t\t\t\tif(ae.getSource() == button) {\n\t\t\t\t\t\t\t\tif (tokens.length == 1) {\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\tclearPanel();\t\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t//if race is already set but class not yet, than read question for class\n\t\t\t\t\t\t\t\t\tif(baseRace == true && baseClass == false) {\n \t\t\t\t\t\t\t\t\tspecific_race = tokens[0];\n \t\t\t\t\t\t\t\t\treadFromFile(\"/question_class/question_class_\" + attribute + \".txt\");\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t//if race and class is already set -> open question for background\n\t\t\t\t\t\t\t\t\telse if(baseRace == true && baseClass == true) {\n\t\t\t \t\t\t\t\tspecific_class = tokens[0];\n \t\t\t\t\t\t\t\t\treadFromFile(\"question_backgrounds\" + \".txt\");\n\t\t\t \t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\tif (tokens.length > 1) {\n\t\t\t\t\t\t\t\t\t//Buttonname/tokens[0];[tokens[1];tokens[2] \n\t\t\t\t\t\t\t\t\tif (tokens.length>2) {\n\t\t\t\t\t\t\t\t\t\tif (baseRace == false && baseClass == false) {\n\t\t\t \t\t\t\t\t\tbase_race.setRace(tokens[2]);\n\t\t\t \t\t\t\t\t\tbaseRace = true;\n\t\t\t \t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\telse if (baseRace == true && baseClass == false) {\n\t\t\t \t\t\t\t\t\tbase_class.setClass(tokens[2]);\n\t\t\t \t\t\t\t\t\tbaseClass = true;\n\n\t\t\t \t\t\t\t\t} \t\t\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t//random button\n\t\t\t\t\t\t\t\t\tif (tokens[0].equals(\"Zufallscharakter erstellen\")) {\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\trandomButton = true;\n\t\t\t\t\t\t\t\t\t\tclearPanel();\n\t\t\t\t\t\t\t\t\t\treadFromFile(tokens[1] + \".txt\");\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t//choose main attribute for race and class\n\t\t\t\t\t\t\t\t\telse if(doc.equals(\"question_1.txt\")) {\n\t\t\t \t\t\t\t\tString attribute_tokens [] = tokens[1].split(\"_\");\n\t\t\t \t\t\t\t\tattribute = attribute_tokens[3];\n\t\t\t \t\t\t\t\tclearPanel();\n\t\t\t\t\t\t\t\t\t\treadFromFile(tokens[1]+\".txt\");\t\n\t\t\t \t\t\t\t}\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t//choose background personality\n\t\t\t\t\t\t\t\t\telse if(doc.equals(\"question_backgrounds.txt\")) {\n\t\t\t\t\t\t\t\t\t\tpersonality = tokens[1];\n\t\t\t \t \t\tbase_personality.setPersonality(tokens[0]);\n\t\t\t \t \t\tclearPanel();\n\t\t\t \t \t\tbg++;\n\t\t\t \t \t\treadFromFile(\"question_personalities/\" + personality + \"/question_personality_\" + personality + \".txt\");\n\t\t\t \t\t\t\t}\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t//background\n\t\t\t\t\t\t\t\t\telse if (bg == 1) {\t\n\t\t\t\t\t\t\t\t\t\tbg++;\n\t \t\t\t\t\t\t\t\tbase_personality.setPersonalityTrait(tokens[1]);\n\t \t\t\t\t\t\t\t\tclearPanel();\n\t \t\t\t\t\t\t\t\treadFromFile(\"/question_personalities/\" + personality + \"/question_ideal_\" + personality + \".txt\");\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\telse if (bg == 2) {\n\t\t\t\t\t\t\t\t\t\tbg++;\n\t\t\t\t\t\t\t\t\t\tbase_personality.setIdeal(tokens[1]);\n\t\t\t\t\t\t\t\t\t\tclearPanel();\n\t \t\t \t\t\t\treadFromFile(\"/question_personalities/\" + personality + \"/question_bond_\" + personality + \".txt\");\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\telse if (bg == 3) {\t\n\t\t\t\t\t\t\t\t\t\tbg++;\n\t \t\t\t\t\t\t\t\tbase_personality.setBond(tokens[1]);\n\t \t\t\t\t\t\t\t\tclearPanel();\n\t \t\t \t\t\t\treadFromFile(\"/question_personalities/\" + personality + \"/question_flaw_\" + personality + \".txt\");\t \t\t \t\t\t \t\t\t\t\n\t\t\t\t \t\t\t} \t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\telse if (bg == 4) {\n\t\t\t\t\t\t\t\t\t\tbg = 0;\n\t \t\t\t\t\t\t\t\tbase_personality.setFlaw(tokens[1]);\n\t \t\t\t\t\t\t\t\tsetAttributes();\n\t \t\t \t\tshowResults();\n\t \t\t \t\t\n\t\t\t\t \t\t\t}\n\t\t\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\t\t\tclearPanel();\n\t\t\t\t\t\t\t\t\t\treadFromFile(tokens[1]+\".txt\");\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t \t \t\t\t\t\n \t\t\t}); //actionlistener close \n \t\t\t\n \t\t} //if count == 1 end\n\n \t\t//empty line\n\t\t if (line.length() == 0) {\n\t\t \tcount++;\n\t\t \ttxt.setText(doc_text);\n\t\t \tif(randomButton == true) {\n\t\t \t\ttxt.setVisible(false);\n \t\t\t\t}\n\t\t \tpanelA.add(txt);\n\t\t }\n\t\t \n \t} // while end\n \t\n\t\t\t\n \trd.close();\n \t\n } //try\n\t\tcatch(Exception e){\n\t\t\te.printStackTrace();\n\t\t}\n\t\tsetFrameContent();\n\t\tif(randomButton == true) {\n\t\t\trandomInt = rdm.nextInt(buttoncount);\t\n\t\t\tlist.get(randomInt).doClick();\n\t\t}\n\t}","public ArrayList<String> Info_Disco_Mus_Rep1(String genero) {\r\n String line;\r\n ArrayList<String> Lista_datos_nombre_genero = new ArrayList();\r\n try (BufferedReader br = new BufferedReader(new FileReader(\"src/Archivos/cat_musica.txt\"))) {\r\n while ((line = br.readLine()) != null) {\r\n String[] info_disco = line.split(\";\");\r\n if (info_disco[2].equals(genero)) {\r\n Lista_datos_nombre_genero.add(info_disco[0]);\r\n }\r\n }\r\n } catch (IOException ex) {\r\n System.out.println(ex);\r\n }\r\n return Lista_datos_nombre_genero;\r\n }","private void btnAgregarActionPerformed(java.awt.event.ActionEvent evt) {//GEN-FIRST:event_btnAgregarActionPerformed\n \n camino=null;\n \n int status = fileChooser.showOpenDialog (null);\n if (status == JFileChooser.APPROVE_OPTION){\n File selectedFile = fileChooser.getSelectedFile();\n camino = selectedFile.getAbsolutePath();\n }\n else{ \n if (status == JFileChooser.CANCEL_OPTION){\n System.out.println(\"CANCELAR\");\n }\n \n }\n try {\n cancion.agregarCancion(camino);\n } catch (IOException ex) {\n Logger.getLogger(biblioteca.class.getName()).log(Level.SEVERE, null, ex);\n } catch (UnsupportedTagException ex) {\n Logger.getLogger(biblioteca.class.getName()).log(Level.SEVERE, null, ex);\n } catch (InvalidDataException ex) {\n Logger.getLogger(biblioteca.class.getName()).log(Level.SEVERE, null, ex);\n }\n String[] test = cancion.mostrarCancion(i);\n lista.addElement(\" \"+test[0]);\n libCancion.setModel(lista);\n i++;\n }","private void dialogEchecConversionFichier(File file, File file2){\n\t\tJOptionPane.showMessageDialog(null, \"le fichier \" + file.getName() +\"\\nn'a pas été converti en \"+ file2.getName(), \"Erreur\", JOptionPane.ERROR_MESSAGE);\n\t}","public void setFileRegExpr(String f) {\n this.fileRegExpr = f;\n }","public int Tipo() {\r\n File archivo = null;\r\n FileReader fr = null;\r\n BufferedReader br = null;\r\n \r\n try {\r\n String linea;\r\n for (a=0;a<5;a++){\r\n if (a==0){\r\n tipo=\"Embarazadas\";\r\n }\r\n if (a==1){\r\n tipo=\"Regulares\";\r\n }\r\n if (a==2){\r\n tipo=\"Discapacitados\";\r\n }\r\n if (a==3){\r\n tipo=\"Mayores\";\r\n }\r\n if (a==4){\r\n tipo=\"Corporativos\";\r\n }\r\n archivo = new File (System.getProperty(\"user.dir\")+\"/Clientes/\"+tipo+\".txt\");\r\n fr = new FileReader (archivo);\r\n br = new BufferedReader(fr);\r\n while((linea=br.readLine())!=null){\r\n if (leerTipo == contador){\r\n errorTipo =String.valueOf(String.valueOf(leerTipo).length());\r\n if (a==0){\r\n resultadoembarazadas+=1;\r\n }\r\n if (a==1){\r\n resultadoregulares+=1;\r\n }\r\n if (a==2){\r\n resultadodiscapacitados+=1;\r\n }\r\n if (a==3){\r\n resultadomayores+=1;\r\n }\r\n if (a==4){\r\n resultadocorporativos+=1;\r\n }\r\n contador +=1;\r\n leerTipo +=6;\r\n\r\n }\r\n else{\r\n contador += 1;\r\n }\r\n }\r\n }\r\n\r\n }\r\n catch(Exception e){\r\n e.printStackTrace();\r\n }finally{\r\n // En el finally cerramos el fichero, para asegurarnos\r\n // que se cierra tanto si todo va bien como si salta \r\n // una excepcion.\r\n try{ \r\n if( null != fr ){ \r\n fr.close(); \r\n } \r\n }catch (Exception e2){ \r\n e2.printStackTrace();\r\n }\r\n }\r\n //return resultado;\r\n return 0;\r\n }","public void Fecha() throws FileNotFoundException, IOException {\r\n File archivo = null;\r\n FileReader fr = null;\r\n BufferedReader br = null;\r\n \r\n try {\r\n // Apertura del fichero y creacion de BufferedReader para poder\r\n // hacer una lectura comoda (disponer del metodo readLine()).\r\n // Lectura del fichero\r\n String linea;\r\n \r\n for (b=0;b<5;b++){\r\n if (b==0){\r\n categoria=\"Embarazadas\";\r\n }\r\n if (b==1){\r\n categoria=\"Regulares\";\r\n }\r\n if (b==2){\r\n categoria=\"Discapacitados\";\r\n }\r\n if (b==3){\r\n categoria=\"Mayores\";\r\n }\r\n if (b==4){\r\n categoria=\"Corporativos\";\r\n }\r\n archivo = new File (System.getProperty(\"user.dir\")+\"/Clientes/\"+categoria+\".txt\");\r\n fr = new FileReader (archivo);\r\n br = new BufferedReader(fr);\r\n while((linea=br.readLine())!=null){\r\n if (leerFecha == contador){\r\n errorFecha = linea.substring(1,2);\r\n if (errorFecha.equals(\"/\")){\r\n comparar = linea.substring(0, 1);\r\n if (\"1\".equals(comparar)){\r\n d1++;\r\n }\r\n if (\"2\".equals(comparar)){\r\n d2++;\r\n }\r\n if (\"3\".equals(comparar)){\r\n d3++;\r\n }\r\n if (\"4\".equals(comparar)){\r\n d4++;\r\n }\r\n if (\"5\".equals(comparar)){\r\n d5++;\r\n }\r\n if (\"6\".equals(comparar)){\r\n d6++;\r\n }\r\n if (\"7\".equals(comparar)){\r\n d7++;\r\n }\r\n if (\"8\".equals(comparar)){\r\n d8++;\r\n }\r\n if (\"9\".equals(comparar)){\r\n d9++;\r\n }\r\n } \r\n else{\r\n comparar1=linea.substring(0, 2);\r\n if (\"10\".equals(comparar1)){\r\n d10++;\r\n }\r\n if (\"11\".equals(comparar1)){\r\n d11++;\r\n }\r\n if (\"12\".equals(comparar1)){\r\n d12++;\r\n }\r\n if (\"13\".equals(comparar1)){\r\n d13++;\r\n }\r\n if (\"14\".equals(comparar1)){\r\n d14++;\r\n }\r\n if (\"15\".equals(comparar1)){\r\n d15++;\r\n }\r\n if (\"16\".equals(comparar1)){\r\n d16++;\r\n }\r\n if (\"17\".equals(comparar1)){\r\n d17++;\r\n }\r\n if (\"18\".equals(comparar1)){\r\n d18++;\r\n }\r\n if (\"19\".equals(comparar1)){\r\n d19++;\r\n }\r\n if (\"20\".equals(comparar1)){\r\n d20++;\r\n }\r\n if (\"21\".equals(comparar1)){\r\n d21++;\r\n }\r\n if (\"22\".equals(comparar1)){\r\n d22++;\r\n }\r\n if (\"23\".equals(comparar1)){\r\n d23++;\r\n }\r\n if (\"24\".equals(comparar1)){\r\n d24++;\r\n }\r\n if (\"25\".equals(comparar1)){\r\n d25++;\r\n }\r\n if (\"26\".equals(comparar1)){\r\n d26++;\r\n }\r\n if (\"27\".equals(comparar1)){\r\n d27++;\r\n }\r\n if (\"28\".equals(comparar1)){\r\n d28++;\r\n }\r\n if (\"29\".equals(comparar1)){\r\n d29++;\r\n }\r\n if (\"30\".equals(comparar1)){\r\n d30++;\r\n }\r\n if (\"31\".equals(comparar1)){\r\n d31++;\r\n }\r\n \r\n }\r\n leerFecha+=6;\r\n contador += 1;\r\n }\r\n \r\n else{\r\n contador += 1;\r\n \r\n \r\n }\r\n } \r\n }\r\n }\r\n catch(Exception e){\r\n e.printStackTrace();\r\n }finally{\r\n // En el finally cerramos el fichero, para asegurarnos\r\n // que se cierra tanto si todo va bien como si salta \r\n // una excepcion.\r\n try{ \r\n if( null != fr ){ \r\n fr.close(); \r\n } \r\n }catch (Exception e2){ \r\n e2.printStackTrace();\r\n }\r\n }\r\n }","public static void main(String[] args) throws IOException {\n File ruta = new File(\"C:\\\\Users\\\\usuario\\\\Documents\\\\curso de java online sepe\\\\unidad 1 clase file\\\\ejercicios\");\n // establecer el nombre del fichero a crear\n File f = new File(ruta, \"datos.txt\");\n File f1 = new File(ruta, \"datosNuevos.txt\");\n // imprimir la ruta absoluta del archivo\n System.out.println(f.getAbsolutePath());\n // Devuelve un String conteniendo el directorio padre del File. Devuelve null si no tiene directorio padre. del archivo\n System.out.println(f.getParent());\n // imprimir la ruta absoluta de la ruta del archivo\n System.out.println(ruta.getAbsolutePath());\n // Devuelve un String conteniendo el directorio padre del File. Devuelve null si no tiene directorio padre. de la ruta\n System.out.println(ruta.getParent());\n if (!f.exists()) { //se comprueba si el fichero existe o no\n System.out.println(\"Fichero \" + f.getName() + \" no existe\");\n if (!ruta.exists()) { //se comprueba si la ruta existe o no\n System.out.println(\"El directorio \" + ruta.getName() + \" no existe\");\n if (ruta.mkdir()) { //se crea la carpeta\n System.out.println(\"Directorio creado\");\n if (f.createNewFile()) { //se crea el fichero.\n System.out.println(\"Fichero \" + f.getName() + \" creado\");\n } else {\n System.out.println(\"No se ha podido crear \" + f.getName());\n }\n } else {\n System.out.println(\"No se ha podido crear \" + ruta.getName());\n }\n } else { //si la ruta existe creamos el fichero\n if (f.createNewFile()) {\n System.out.println(\"Fichero \" + f.getName() + \" creado\");\n } else {\n System.out.println(\"No se ha podido crear \" + f.getName());\n }\n }\n } else { //el fichero existe. Mostramos el tamaño\n System.out.println(\"Fichero \" + f.getName() + \" existe\");\n System.out.println(\"Tamaño \" + f.length() + \" bytes\");\n }\n\n // mostrar los archivos en esa carpeta\n File f2 = new File(ruta, \".\");\n // creamos un array para mostrar todos los archivos en esa ruta\n String[] listaArchivos = f2.list();\n if (!f1.exists()) { //se comprueba si el fichero existe o no\n System.out.println(\"Fichero \" + f1.getName() + \" no existe\");\n }\n if (f1.createNewFile()) { //se crea el fichero. Si se ha creado correctamente\n System.out.println(\"Fichero \" + f1.getName() + \" creado\");\n } else {\n System.out.println(\"No se ha podido crear \" + f1.getName());\n }\n for (int i = 0; i < listaArchivos.length; i++) {\n System.out.println(listaArchivos[i]);\n }\n // mostrar el numero de archivos en esa carpeta\n String[] elementos = ruta.list();\n System.out.println(\"La carpeta \" + ruta.getAbsolutePath() + \" tiene \" + elementos.length + \" subelementos\");\n }","private void leerOracion(){\r\n\tString wor=\"\";\r\n\r\n try {\r\n\r\n arch = new File (\"texto.txt\");\r\n fr = new FileReader (arch);\r\n br = new BufferedReader(fr);\r\n\r\n String lin;\r\n int ind=0;\r\n while((lin=br.readLine())!=null){\r\n \twor=lin;\r\n }\r\n }\r\n catch(Exception e){\r\n e.printStackTrace();\r\n }finally{\r\n try{ \r\n if( null != fr ){ \r\n fr.close(); \r\n } \r\n }catch (Exception e2){ \r\n e2.printStackTrace();\r\n }\r\n }\r\n\r\n\twhile(wor.compareTo(\"\")!=0){\r\n\tint lugar=wor.indexOf(' ');\r\n if(lugar!=-1){\r\n orac.add(wor.substring(0,lugar));\r\n wor=wor.substring(lugar+1);\r\n }else{\r\n orac.add(wor);\r\n wor=\"\";\r\n }\r\n }\r\n }","void doShowFiles()\n\t{\n\t\ttry\n\t\t{\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tIterator itr = m_fileInfo.getAllFiles();\n\n\t\t\twhile(itr.hasNext())\n\t\t\t{\n\t\t\t\tSourceFile m = (SourceFile) ((Map.Entry)itr.next()).getValue();\n\n\t\t\t\tString name = m.getName();\n\t\t\t\tint id = m.getId();\n\t\t\t\tString path = m.getFullPath();\n\n\t\t\t\tsb.append(id);\n\t\t\t\tsb.append(' ');\n\t\t\t\tsb.append(path);\n\t\t\t\tsb.append(\", \"); //$NON-NLS-1$\n\t\t\t\tsb.append(name);\n\t\t\t\tsb.append(m_newline);\n\t\t\t}\n\t\t\tout( sb.toString() );\n\t\t}\n\t\tcatch(NullPointerException npe)\n\t\t{\n\t\t\terr(getLocalizationManager().getLocalizedTextString(\"noSourceFilesFound\")); //$NON-NLS-1$\n\t\t}\n\t}","private void cargarFichaLepra_control() {\r\n\r\n\t\tMap<String, Object> parameters = new HashMap<String, Object>();\r\n\t\tparameters.put(\"codigo_empresa\", codigo_empresa);\r\n\t\tparameters.put(\"codigo_sucursal\", codigo_sucursal);\r\n\t\tparameters.put(\"nro_identificacion\", tbxNro_identificacion.getValue());\r\n\r\n\t\tficha_inicio_lepraService.setLimit(\"limit 25 offset 0\");\r\n\r\n\t\t// log.info(\"parameters>>>>\" + parameters);\r\n\t\tBoolean ficha_inicio = ficha_inicio_lepraService\r\n\t\t\t\t.existe_paciente_lepra(parameters);\r\n\t\t// log.info(\"ficha_inicio>>>>\" + ficha_inicio);\r\n\r\n\t\tif (ficha_inicio) {\r\n\t\t\tMap<String, Object> parametros = new HashMap<String, Object>();\r\n\t\t\tparametros.put(\"nro_identificacion\",\r\n\t\t\t\t\tadmision_seleccionada.getNro_identificacion());\r\n\t\t\tparametros.put(\"nro_ingreso\",\r\n\t\t\t\t\tadmision_seleccionada.getNro_ingreso());\r\n\t\t\tparametros.put(\"estado\", admision_seleccionada.getEstado());\r\n\t\t\tparametros.put(\"codigo_administradora\",\r\n\t\t\t\t\tadmision_seleccionada.getCodigo_administradora());\r\n\t\t\tparametros.put(\"id_plan\", admision_seleccionada.getId_plan());\r\n\t\t\tparametros.put(IVias_ingreso.ADMISION_PACIENTE,\r\n\t\t\t\t\tadmision_seleccionada);\r\n\t\t\tparametros.put(IVias_ingreso.OPCION_VIA_INGRESO,\r\n\t\t\t\t\tOpciones_via_ingreso.REGISTRAR);\r\n\t\t\ttabboxContendor.abrirPaginaTabDemanda(false,\r\n\t\t\t\t\tIRutas_historia.PAGINA_SEGUIMIENTO_TRATAMIENTO_LEPRA,\r\n\t\t\t\t\tIRutas_historia.LABEL_SEGUIMIENTO_TRATAMIENTO_LEPRA,\r\n\t\t\t\t\tparametros);\r\n\t\t}\r\n\t}","public static void main(String[] args) {\n String filePath = \"C:\\\\Users\\\\Catalin\\\\Desktop\\\\fisierdecitit.txt\";\n\n try {\n //incarcarea fisierului in memoria programului cu ajutorul ob fileReader\n FileReader fileReader = new FileReader(filePath);\n //incepem citirea din fisier linie cu line cu ajutorul BufferedReader\n BufferedReader bufferedReader = new BufferedReader(fileReader);\n String text = bufferedReader.readLine();\n while (text != null) {\n System.out.println(\"Linia citita este: \" + text);\n String[] array = text.split(\" \");\n System.out.println(array.length);\n text = bufferedReader.readLine();\n\n }\n\n } catch (IOException e) {\n System.out.println(\"A aparut o eroare: \" + e.getMessage());\n }\n\n\n //invatam sa scriem intr un fisier\n String filePathToWrite = \"C:\\\\Users\\\\Catalin\\\\Desktop\\\\fisierdescris.txt\";\n try {\n FileWriter fileWriter = new FileWriter(filePathToWrite);\n BufferedWriter bufferedWriter = new BufferedWriter(fileWriter);\n String text = \"Mama lu' Ana nu are nici mere si nici pere.\";\n String text2 = \"smhjhdgfdsbfkdhj\";\n\n bufferedWriter.write(text2);\n bufferedWriter.newLine();\n bufferedWriter.write(text);\n bufferedWriter.flush();\n bufferedWriter.close();\n } catch (IOException e) {\n System.out.println(\"A aparut o exceptie: \" + e.getMessage());\n }\n\n\n }"],"string":"[\n \"public void armarPreguntas(){\\n preguntas = file.listaPreguntas(\\\"Preguntas.txt\\\");\\n }\",\n \"public void showFile() throws FileNotFoundException, IOException{\\r\\n ArrayList<String> arxiu = new ArrayList<>();\\r\\n \\r\\n BufferedReader br = new BufferedReader(new FileReader(fitxerUsuaris));\\r\\n \\r\\n String usuari;\\r\\n \\r\\n while((usuari = br.readLine()) != null){\\r\\n arxiu.add(usuari);\\r\\n }\\r\\n \\r\\n for (int i = 0; i < arxiu.size(); i++) {\\r\\n System.out.println(arxiu.get(i));\\r\\n }\\r\\n }\",\n \"public void seleccionarFichero(){\\n JFileChooser fileChooser = new JFileChooser();\\n FileNameExtensionFilter filter = new FileNameExtensionFilter(\\\"xml\\\", \\\"xml\\\");\\n fileChooser.setFileFilter(filter);\\n fileChooser.setCurrentDirectory(new java.io.File(\\\"./ficheros\\\"));\\n int seleccion = fileChooser.showOpenDialog(vista_principal);\\n if (seleccion == JFileChooser.APPROVE_OPTION){\\n fichero = fileChooser.getSelectedFile();\\n vista_principal.getTxtfield_nombre_fichero().\\n setText(fichero.getName().substring(0, fichero.getName().length()-4));\\n }\\n }\",\n \"private void abrirFichero() {\\r\\n\\t\\tJFileChooser abrir = new JFileChooser();\\r\\n\\t\\tFileNameExtensionFilter filtro = new FileNameExtensionFilter(\\\"obj\\\",\\\"obj\\\");\\r\\n\\t\\tabrir.setFileFilter(filtro);\\r\\n\\t\\tif(abrir.showOpenDialog(abrir) == JFileChooser.APPROVE_OPTION){\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\tGestion.liga = (Liga) Gestion.abrir(abrir.getSelectedFile());\\r\\n\\t\\t\\t\\tGestion.setAbierto(true);\\r\\n\\t\\t\\t\\tGestion.setFichero(abrir.getSelectedFile());\\r\\n\\t\\t\\t\\tGestion.setModificado(false);\\r\\n\\t\\t\\t\\tfrmLigaDeFtbol.setTitle(Gestion.getFichero().getName());\\r\\n\\t\\t\\t} catch (ClassNotFoundException | IOException e) {\\r\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(null, \\\"No se ha podido abrir el fichero\\\", \\\"Error\\\", JOptionPane.ERROR_MESSAGE);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"private void choixRepertoire(int format){\\n\\t\\tString path = \\\"\\\"; //Chemin a parcourir\\n\\t\\tJFileChooser chooser = null;\\n\\t\\tif(SauvegardeRepertoire.getPaths().isEmpty()){//Si la liste des repertoires est vide\\n\\t\\t\\tchooser = new JFileChooser();\\n\\t\\t}\\n\\t\\telse{//si elle n'est pas vide\\n\\t\\t\\tIterator<String> it = SauvegardeRepertoire.getPaths().iterator();\\n\\t\\t\\twhile (it.hasNext() && path.equals(\\\"\\\")) {\\n\\t\\t\\t\\tString str = (String) it.next();\\n\\t\\t\\t\\tFile file = new File(str);\\n\\n\\t\\t\\t\\tif (file.exists()) //on recupere le premier repertoire possible\\t\\n\\t\\t\\t\\t\\tpath = file.getAbsolutePath();\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(path.equals(\\\"\\\"))//si on a pas trouvé de chemin coherent\\n\\t\\t\\t\\tchooser = new JFileChooser();\\n\\t\\t\\telse\\n\\t\\t\\t\\tchooser = new JFileChooser(path);\\n\\t\\t}\\n\\t\\tFileNameExtensionFilter filter=null;\\n\\t\\tswitch(format)\\n\\t\\t{\\n\\t\\t\\tcase PDFFile:\\n\\t\\t\\t\\tfilter = new FileNameExtensionFilter(\\\"PDF\\\",\\\"pdf\\\");\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase ARFFFile:\\n\\t\\t\\t\\tchooser.setFileSelectionMode(JFileChooser.DIRECTORIES_ONLY);\\n\\t\\t\\t\\tchooser.setAcceptAllFileFilterUsed(false);\\n\\t\\t\\t\\tbreak;\\n\\t\\t}\\n\\n\\t\\tchooser.setFileFilter(filter);\\n\\t\\tchooser.setMultiSelectionEnabled(false);\\n\\t\\tint returnVal = chooser.showOpenDialog(null);\\n\\t\\tif(returnVal == JFileChooser.APPROVE_OPTION) {\\n\\t\\t\\tSauvegardeRepertoire.ajoutPath(chooser);//permet de sauvegarder les repertoires\\n\\t\\t\\tif(filter!=null && filter.getExtensions()[0].equals(\\\"pdf\\\")) {\\n\\t\\t\\t\\tgestionFichier(chooser);\\n\\t\\t\\t\\tunlockButton();\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tgestionFichierDataSet(chooser);\\n\\t\\t\\t\\tbDataTraining.setEnabled(true);\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t}\",\n \"public void loadFile()\\n {\\n\\n FileDialog fd = null; //no value\\n fd = new FileDialog(fd , \\\"Pick up a bubble file: \\\" , FileDialog.LOAD); //create popup menu \\n fd.setVisible(true); // make visible manu\\n String directory = fd.getDirectory(); // give the location of file\\n String name = fd.getFile(); // give us what file is it\\n String fullName = directory + name; //put together in one sting \\n \\n File rideNameFile = new File(fullName); //open new file with above directory and name\\n \\n Scanner nameReader = null;\\n //when I try to pick up it read as scanner what I choose\\n try\\n {\\n nameReader = new Scanner(rideNameFile);\\n }\\n catch (FileNotFoundException fnfe)//if dont find return this message below\\n {\\n return; // immedaitely exit from here\\n }\\n \\n //if load button pressed, it remove all ride lines in the world\\n if(load.getFound()){\\n removeAllLines();\\n } \\n \\n //read until is no more stings inside of file and until fullfill max rides\\n while(nameReader.hasNextLine()&¤tRide<MAX_RIDES)\\n {\\n \\n String rd= nameReader.nextLine();//hold and read string with name of ride\\n RideLines nova =new RideLines(rd);\\n rides[currentRide]=nova;\\n \\n //Create a RideLine with string given from file\\n addObject(rides[currentRide++], 650, 20 + 40*currentRide);\\n }\\n \\n //when is no more strings inside it close reader\\n nameReader.close();\\n }\",\n \"public static void main(String[] args) throws FileNotFoundException {\\n\\t\\tListaNombre nombres = new ListaNombre();\\n//\\t\\tnombres.add(new Nombre(\\\"guido\\\"));\\n//\\t\\tnombres.add(new Nombre(\\\"guido\\\"));\\n//\\t\\tnombres.add(new Nombre(\\\"guido\\\"));\\n//\\t\\tnombres.add(new Nombre(\\\"juan\\\"));\\n//\\t\\tnombres.add(new Nombre(\\\"juan\\\"));\\n//\\t\\tnombres.add(new Nombre(\\\"daria\\\"));\\n//\\t\\tnombres.add(new Nombre(\\\"daria\\\"));\\n//\\t\\tnombres.add(new Nombre(\\\"pedro\\\"));\\n//\\t\\tnombres.add(new Nombre(\\\"pedro\\\"));\\n//\\t\\tnombres.add(new Nombre(\\\"pedro\\\"));\\n//\\t\\tnombres.setCantRepetidos(3);\\n//\\t\\tfor (Nombre nom : nombres.getNombres()) {\\n//\\t\\t\\tSystem.out.println(nom.getNombre() + \\\" \\\" + nom.getCant());\\n//\\t\\t}\\n\\t\\tnombres = ( Archivo.leer(\\\"C:\\\\\\\\Users\\\\\\\\guido\\\\\\\\eclipse-workspace\\\\\\\\DescubriendoNombresRepetidos\\\\\\\\premioA.in\\\"));\\n\\t\\tArchivo.escribir(\\\"C:\\\\\\\\Users\\\\\\\\guido\\\\\\\\eclipse-workspace\\\\\\\\DescubriendoNombresRepetidos\\\\\\\\salida.out\\\",nombres);\\n\\t}\",\n \"public static void RT() {////cada clase que tiene informacion en un archivo txt tiene este metodo para leer el respectivo archivoy guardarlo en su hashmap\\n\\t\\treadTxt(\\\"peliculas.txt\\\", pelisList);\\n\\t}\",\n \"private void dialogEcritureFichier(File file) {\\n\\t\\tJOptionPane.showMessageDialog(null, \\\"le fichier \\\" + file.getName() +\\\" a été écrit\\\", \\\"Info\\\", JOptionPane.INFORMATION_MESSAGE);\\n\\t}\",\n \"public void subir_file()\\n {\\n FileChooser fc = new FileChooser();\\n\\n fc.getExtensionFilters().addAll(new FileChooser.ExtensionFilter(\\\"PDF Files\\\",\\\"*.pdf\\\")\\n , new FileChooser.ExtensionFilter(\\\"Jpg Images\\\",\\\"*.jpg\\\",\\\"*.JPEG\\\",\\\"*.JPG\\\",\\\"*.jpeg\\\",\\\"*.PNG\\\",\\\"*.png\\\"));\\n\\n File fileSelected = fc.showOpenDialog(null);\\n\\n if (fileSelected!= null){\\n txt_ruta.setText(fileSelected.getPath());\\n\\n if(txt_ruta.getText().contains(\\\".pdf\\\"))\\n {\\n System.out.println(\\\"si es pdf\\\");\\n Image image = new Image(\\\"/sample/Clases/pdf.png\\\");\\n image_esquema.setImage(image);\\n\\n }\\n else\\n {\\n File file = new File(txt_ruta.getText());\\n javafx.scene.image.Image image = new Image(file.toURI().toString());\\n image_esquema.setImage(image);\\n }\\n\\n }\\n else{\\n System.out.println(\\\"no se seleccinoó\\\");\\n }\\n }\",\n \"public void OuvrirAgd() {\\n //on charge l'agenda à partir d'un fichier en lecture\\n try {\\n File agd_a_lire = new File(\\\"C:\\\\\\\\Projet_Agenda_ING3\\\\\\\\saved_agendas\\\");\\n Scanner sc = new Scanner(agd_a_lire);\\n\\n //on lit le fichier ligne par ligne\\n /*while (sc.) {\\n\\n }*/\\n\\n sc.close();\\n } catch (Exception e) {\\n System.out.print(\\\"Erreur d'ouverture du fichier en lecture\\\\n\\\");\\n }\\n }\",\n \"private static void obtenirUneListe() throws FileNotFoundException {\\n\\t\\tSystem.out.println(\\\"\\\\r\\\\nPour combien de jours : \\\");\\n\\t\\tint nbJours = sc.nextInt();\\n\\n\\t\\tSystem.out.println(\\\"\\\\r\\\\nCombien de propositions : \\\");\\n\\t\\tint nbPropositions = sc.nextInt();\\n\\n\\t\\tList<List<Recette>> listeProposition = genererListePropositions(nbJours, nbPropositions);\\n\\n\\t\\tSystem.out.println(\\\"\\\\r\\\\nChoix ? \\\");\\n\\t\\tint choix = sc.nextInt();\\n\\n\\t\\tgenererFichier(listeProposition.get(choix - 1));\\n\\n\\t\\tsc.nextLine();\\n\\n\\t\\traz();\\n\\t}\",\n \"@objid (\\\"116a5759-3df1-4c8b-bd9e-e521507f07e6\\\")\\r\\n public String searchFile() {\\r\\n String nomFichier = this.dialog.open();\\r\\n if ((nomFichier != null) && (nomFichier.length() != 0)) {\\r\\n this.currentFile = new File(nomFichier);\\r\\n this.text.setText(nomFichier);\\r\\n }\\r\\n return this.text.getText();\\r\\n }\",\n \"public void arquivo(String nomarq)\\r\\n {\\n }\",\n \"public void FermerAgd() {\\n //on essaye d'ouvrir un fichier dans lequel enregistrer le contenu de l'agenda\\n try {\\n Formatter agd_a_enreg = new Formatter(\\\"C:\\\\\\\\Projet_Agenda_ING3\\\\\\\\saved_agendas\\\");\\n\\n for (RdV el : this.getAgenda()) {\\n //on enregistre 1 rdv par ligne\\n //faire gaffe aux formats : %..\\n agd_a_enreg.format(\\\"%s/%s/%s de %s a %s : %s , %s\\\\n\\\",\\n el.getDate().getDayOfMonth(), el.getDate().getMonthValue(),\\n el.getDate().getYear(), el.getHdebut(),\\n el.getHfin(), el.getLibelle(), el.getRappel());\\n //on supprime le rdv de l'arraylist d'agenda \\n this.suppressionRdV(el);\\n }\\n //on ferme le fichier en ecriture\\n agd_a_enreg.close();\\n //on met l'attribut agenda à null une fois qu'il est \\\"vidé\\\"\\n this.agd = null;\\n } //en cas de probleme dans l'ouverture du fichier on affiche une erreur\\n catch (Exception e) {\\n System.out.print(\\\"Erreur d'ouverture du fichier en ecriture\\\\n\\\");\\n }\\n\\n }\",\n \"private static void info ( File f ) {\\n\\tString nume = f . getName () ;\\n\\tif( f.isFile () )\\n\\tSystem.out.println ( \\\" Fisier : \\\" + nume ) ;\\n\\telse\\n\\tif( f.isDirectory () )\\n\\tSystem.out.println ( \\\" Director : \\\" + nume ) ;\\n\\tSystem.out.println (\\n\\t\\\" Cale absoluta : \\\" + f.getAbsolutePath () +\\n\\t\\\" \\\\n Poate citi : \\\" + f.canRead () +\\n\\t\\\" \\\\n Poate scrie : \\\" + f.canWrite () +\\n\\t\\\" \\\\n Parinte : \\\" + f.getParent () +\\n\\t\\\" \\\\n Cale : \\\" + f.getPath () +\\n\\t\\\" \\\\n Lungime : \\\" + f.length () +\\n\\t\\\" \\\\n Data ultimei modificari : \\\" +\\n\\tnew Date ( f.lastModified () ) ) ;\\n\\tSystem.out.println ( \\\" --------------\\\" ) ;\\n\\t}\",\n \"public void service_psy (Personne p) throws FileNotFoundException\\r\\n\\t{\\r\\n\\t\\r\\n\\t\\t\\r\\n\\t\\t \\t\\tString [] info_psy=null ;\\r\\n\\t\\t \\t\\tString [] cle_valeur=null;\\r\\n\\t\\t \\t\\tboolean spec,adr;\\r\\n\\t\\t \\t\\tFileInputStream f=new FileInputStream(\\\"C://Users/Azaiez Hamed/Desktop/workspace/Projet de programmation/src/Medecin.txt\\\");\\r\\n\\t\\t \\t\\ttry {\\r\\n\\t\\t \\t\\t\\tBufferedReader reader =new BufferedReader (new InputStreamReader(f,\\\"UTF-8\\\"));\\r\\n\\t\\t \\t\\t\\tString line=reader.readLine();\\r\\n\\t\\t \\t\\t\\twhile(line!=null){\\r\\n\\t\\t \\t\\t\\t\\tinfo_psy=line.split(\\\"\\\\t\\\\t\\\\t\\\");\\r\\n\\t\\t \\t\\t\\t\\tspec=false;adr=false;\\r\\n\\t\\t \\t\\t\\t\\tfor(int i=0;i<info_psy.length;i++)\\r\\n\\t\\t \\t\\t\\t\\t{\\r\\n\\t\\t \\t\\t\\t\\t\\t cle_valeur=info_psy[i].split(\\\":\\\");\\r\\n\\t\\t\\t\\t\\t\\t if ((cle_valeur[0].equals(\\\"specialite\\\"))&& (cle_valeur[1].equals(\\\"psy\\\")))\\r\\n\\t\\t\\t\\t\\t\\t \\t spec=true;\\r\\n\\t\\t\\t\\t\\t\\t if ((cle_valeur[0].equals(\\\"gouvernerat\\\"))&&(cle_valeur[1].equals(p.getGouvernerat())))\\r\\n\\t\\t \\t\\t\\t\\t\\t \\tadr=true;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\tif (spec && adr) {\\r\\n\\t\\t \\t\\t\\t\\t\\t System.out.println(\\\"voilà toutes les informations du psy, veuillez lui contacter immédiatement **\\\");\\r\\n\\t\\t \\t\\t\\t\\t\\t System.out.println(line);return;}\\r\\n\\t\\t \\t\\t\\t\\telse\\r\\n\\t\\t \\t\\t\\t\\t line=reader.readLine();\\r\\n\\t\\t \\t\\t\\t\\t }\\r\\n\\t\\t \\t\\t }\\r\\n\\t\\t \\t\\t \\tcatch(IOException e){e.printStackTrace();}\\r\\n\\t\\t \\t\\t System.out.println(\\\"Pas de psy trouvé dans votre gouvernerat\\\");\\r\\n\\t}\",\n \"public ifrm_historial() {\\n initComponents();\\n this.setTitle(\\\"Historial bitacoraCalculadora.txt\\\");\\n File archivo;\\n try{\\n final BufferedReader lector = new BufferedReader(new FileReader(\\\"bitacoraCalculadora.txt\\\"));\\n String line = \\\"\\\";\\n while ((line = lector.readLine()) != null){\\n //txt_mostrar.setText(line);\\n txt_mostrar.append(line +\\\"\\\\n\\\");\\n }lector.close();\\n }catch(FileNotFoundException e){\\n e.printStackTrace();\\n } catch(IOException e){\\n e.printStackTrace();\\n }\\n }\",\n \"private static void letturaFilePerRiga(File file) {\\n\\t\\ttry(FileReader reader = new FileReader(file);\\n\\t\\t\\tBufferedReader buffReader = new BufferedReader(reader)) {\\n\\t\\t\\tString riga = null;\\n\\t\\t\\t\\n\\t\\t\\tdo {\\n\\t\\t\\t\\triga = buffReader.readLine();\\n\\t\\t\\t\\tSystem.out.println(riga);\\n\\n\\t\\t\\t} while (riga != null);\\n\\t\\t\\twhile(riga != null);\\n\\t\\t} catch (FileNotFoundException e) {\\n\\t\\t\\t// TODO: handle exception\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\t// TODO: handle exception\\n\\t\\t}\\n\\t\\n\\n\\t}\",\n \"public void salvaPartita(String file) {\\n\\r\\n }\",\n \"public void afficherFile() {\\r\\n\\r\\n\\t\\tSystem.out.println();\\r\\n\\t\\tSystem.out.println(\\\"Voici la File (tete a gauche, queue a droite): \\\");\\r\\n\\t\\tSystem.out.println(\\\"----------------------------------------------\\\");\\r\\n\\r\\n\\t\\tif (this.estVide() == true) {\\r\\n\\r\\n\\t\\t\\tSystem.out.println();\\r\\n\\t\\t} else {\\r\\n\\r\\n\\t\\t\\tCellule<T> ref = this.tete;\\r\\n\\r\\n\\t\\t\\tfor (int i = 1; i <= this.getLongueurFile(); i++) {\\r\\n\\r\\n\\t\\t\\t\\tSystem.out.print(ref.getValeur() + \\\" \\\");\\r\\n\\r\\n\\t\\t\\t\\tif (ref.getSuivant() != null) {\\r\\n\\r\\n\\t\\t\\t\\t\\tref = ref.getSuivant();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tSystem.out.println();\\r\\n\\t\\tSystem.out.println();\\r\\n\\t}\",\n \"public void abrirArchivo() {\\r\\n try {\\r\\n entrada = new Scanner(new File(\\\"estudiantes.txt\\\"));\\r\\n } // fin de try\\r\\n catch (FileNotFoundException fileNotFoundException) {\\r\\n System.err.println(\\\"Error al abrir el archivo.\\\");\\r\\n System.exit(1);\\r\\n } // fin de catch\\r\\n }\",\n \"private void validateFile(final boolean isRustica) {\\n\\t\\thayErroresFilas = false;\\r\\n\\t\\thayErroresFila = false;\\r\\n\\r\\n\\t\\tcampoMasaCorrectos = true;\\r\\n\\t\\tcampoHojaCorrecto = true;\\r\\n\\t\\tcampoParecelaCorrecto = true;\\r\\n\\t\\tcampoTipoCorrecto = true;\\r\\n\\t\\tcampoFechaAltaCorrecto = true;\\r\\n\\t\\tcampoFechaBajaCorrecto = true;\\r\\n\\r\\n\\t\\tFile currentDirectory = (File) blackboard.get(ImportarUtils_LCGIII.LAST_IMPORT_DIRECTORY);\\r\\n\\r\\n\\t\\tGeopistaFiltroFicheroFilter filter = new GeopistaFiltroFicheroFilter();\\r\\n\\t\\tfilter.addExtension(\\\"SHP\\\");\\r\\n filter.setDescription(\\\"Shapefiles\\\");\\r\\n\\t\\t\\r\\n final JFileChooser jfc;\\r\\n final JTextField jtf;\\r\\n if (isRustica)\\r\\n {\\r\\n \\tjfc = fcRustica;\\t\\r\\n \\tjtf = this.txtFicheroRustica;\\r\\n }\\r\\n\\t\\telse\\r\\n\\t\\t{\\r\\n\\t\\t\\tjfc = fcUrbana;\\r\\n\\t\\t\\tjtf = this.txtFicheroUrbana;\\r\\n\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t// FILES(*.*)\\r\\n jfc.setFileFilter(filter);\\r\\n \\tjfc.setAcceptAllFileFilterUsed(false); // QUITA LA OPCION ALL\\r\\n\\t\\tjfc.setCurrentDirectory(currentDirectory);\\r\\n\\t\\t\\r\\n\\t\\tint returnVal = jfc.showOpenDialog(this);\\r\\n\\t\\tblackboard.put(ImportarUtils_LCGIII.LAST_IMPORT_DIRECTORY, jfc.getCurrentDirectory());\\r\\n\\r\\n\\t\\tif (returnVal == JFileChooser.APPROVE_OPTION)\\r\\n\\t\\t{\\r\\n\\t\\t\\t// Cargamos el fichero que hemos obtenido\\r\\n\\t\\t\\tString fichero;\\r\\n\\t\\t\\tfichero = jfc.getSelectedFile().getPath();\\r\\n\\t\\t\\tjtf.setText(fichero); // meto el fichero seleccionado\\r\\n\\t\\t\\t// en el campo\\r\\n\\r\\n\\t\\t\\tcadenaTexto = \\\"<font face=SansSerif size=3>\\\"\\r\\n\\t\\t\\t\\t+ aplicacion.getI18nString(\\\"ImportacionComenzar\\\") + \\\"<b>\\\" + \\\" \\\"\\r\\n\\t\\t\\t\\t+ jfc.getSelectedFile().getName() + \\\"</b>\\\";\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tcadenaTexto = cadenaTexto + \\\"<p>\\\" + aplicacion.getI18nString(\\\"OperacionMinutos\\\") + \\\" ...</p></font>\\\";\\r\\n\\t\\t\\tcadenaTexto = cadenaTexto + aplicacion.getI18nString(\\\"importar.datos.parcelas\\\");\\r\\n\\r\\n\\t\\t\\tediError.setText(cadenaTexto);\\r\\n\\t\\t\\tcadenaTexto=\\\"\\\";\\r\\n\\r\\n\\t\\t\\tfinal TaskMonitorDialog progressDialog = \\r\\n\\t\\t\\t\\tnew TaskMonitorDialog(aplicacion.getMainFrame(), geopistaEditor.getContext().getErrorHandler());\\r\\n\\r\\n\\t\\t\\tprogressDialog.setTitle(aplicacion.getI18nString(\\\"ValidandoDatos\\\"));\\r\\n\\t\\t\\tprogressDialog.report(aplicacion.getI18nString(\\\"ValidandoDatos\\\"));\\r\\n\\t\\t\\tprogressDialog.addComponentListener(new ComponentAdapter()\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tpublic void componentShown(ComponentEvent e)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t// Wait for the dialog to appear before starting the\\r\\n\\t\\t\\t\\t\\t// task. Otherwise\\r\\n\\t\\t\\t\\t\\t// the task might possibly finish before the dialog\\r\\n\\t\\t\\t\\t\\t// appeared and the\\r\\n\\t\\t\\t\\t\\t// dialog would never close. [Jon Aquino]\\r\\n\\t\\t\\t\\t\\tnew Thread(new Runnable()\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tpublic void run()\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\ttry\\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tGeopistaLayer layerParcelas = (GeopistaLayer) blackboard.get(\\\"capaParcelasInfoReferencia\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (layerParcelas != null)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tgeopistaEditor.getLayerManager().remove(layerParcelas);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tlayerParcelas = (GeopistaLayer) geopistaEditor.loadData(\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tjfc.getSelectedFile().getAbsolutePath(),\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\taplicacion.getI18nString(\\\"importar.informe.parcelas\\\"));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tlayerParcelas.setActiva(false);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tlayerParcelas.addStyle(new BasicStyle(new Color(64, 64,64)));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tlayerParcelas.setVisible(false);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (isRustica)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tblackboard.put(\\\"capaParcelasInfoReferencia\\\", layerParcelas);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tblackboard.put(\\\"capaParcelasInfoReferenciaUrbana\\\", layerParcelas);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// Obtener el esquema\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tFeatureSchema esquema = layerParcelas.getFeatureCollectionWrapper().getFeatureSchema();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// Localizar los campos\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcampoMasaCorrectos = encontrarCampo(\\\"MASA\\\",esquema);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcampoHojaCorrecto = encontrarCampo(\\\"HOJA\\\",esquema);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcampoParecelaCorrecto = encontrarCampo(\\\"PARCELA\\\",esquema);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcampoTipoCorrecto = encontrarCampo(\\\"TIPO\\\",esquema);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcampoFechaAltaCorrecto = encontrarCampo(\\\"FECHAALTA\\\", esquema);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcampoFechaBajaCorrecto = encontrarCampo(\\\"FECHABAJA\\\", esquema);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (campoMasaCorrectos \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t&& campoHojaCorrecto\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t&& campoParecelaCorrecto\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t&& campoTipoCorrecto\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t&& campoFechaAltaCorrecto\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t&& campoFechaBajaCorrecto)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// A partir de aqui hay que\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// verificar que no hay nulos y es\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// del tipo correcto los valores.\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tList listaLayer = layerParcelas.getFeatureCollectionWrapper().getFeatures();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tIterator itLayer = listaLayer.iterator();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\twhile (itLayer.hasNext())\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (hayErroresFila)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// break;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tFeature f = (Feature) itLayer.next();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tString masa = f.getString(\\\"MASA\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tString hoja = f.getString(\\\"HOJA\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tString parcela = f.getString(\\\"PARCELA\\\");\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tString tipo = f.getString(\\\"TIPO\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// Comprobamos que no sea nulo y\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// sea una U o una R\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif ((!tipo.equals(\\\"U\\\"))\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t&& (!tipo.equals(\\\"R\\\"))\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t&& (!tipo.equals(\\\"D\\\"))\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t&& (!tipo.equals(\\\"X\\\")))\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// Solo puede haber una R \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// una U una D o una X.\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcadenaTexto = cadenaTexto\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ aplicacion.getI18nString(\\\"importar.informe.parcelas.rustico\\\")\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ masa\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ hoja\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ parcela\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ aplicacion.getI18nString(\\\"importar.informe.parcelas.fin.rustico\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFila = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFilas = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// break;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse if (!isRustica && (tipo.equals(\\\"R\\\") || tipo.equals(\\\"D\\\") || tipo.equals(\\\"X\\\")))\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcadenaTexto = I18N.get(\\\"ImportadorParcelas\\\", \\\"importar.informe.parcelas.error.inicio.parcelario\\\")\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ I18N.get(\\\"ImportadorParcelas\\\", \\\"importar.informacion.referencia.validacion.urbana\\\") + \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tI18N.get(\\\"ImportadorParcelas\\\", \\\"importar.informe.parcelas.error.fin.parcelario\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFila = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFilas = true;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse if (isRustica && tipo.equals(\\\"U\\\"))\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcadenaTexto = I18N.get(\\\"ImportadorParcelas\\\", \\\"importar.informe.parcelas.error.inicio.parcelario\\\")\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ I18N.get(\\\"ImportadorParcelas\\\", \\\"importar.informacion.referencia.validacion.rustica\\\") + \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tI18N.get(\\\"ImportadorParcelas\\\", \\\"importar.informe.parcelas.error.fin.parcelario\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFila = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFilas = true;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// Comprobamos que la fecha\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// que viene sea fecha\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\ttry\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tDateFormat formatter = new SimpleDateFormat(\\\"yyyyMMdd\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tDate date = (Date) formatter.parse(f.getString(\\\"FECHAALTA\\\"));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// Comprobamos que la\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// fecha de baja es nula\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// o valida o 9999999\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (f.getString(\\\"FECHABAJA\\\").equals(\\\"99999999\\\"))\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// Correcto\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFila = false;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif ((f.getString(\\\"FECHABAJA\\\")) == null)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFila = false;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// Comprobamos que sea una fecha correcta\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\ttry\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tDateFormat formatter1 = new SimpleDateFormat(\\\"yyyyMMdd\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tDate date1 = (Date) formatter1.parse(f.getString(\\\"FECHABAJA\\\"));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcatch (Exception excp)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\texcp.printStackTrace();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFila = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFilas = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcadenaTexto = cadenaTexto\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ aplicacion.getI18nString(\\\"importar.informe.parcelas.fecha.baja\\\")\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ masa\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ hoja\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ parcela\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ aplicacion.getI18nString(\\\"importar.informe.parcelas.fin.rustico\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// break;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//jtf.setBorder(BorderFactory.createLineBorder(Color.GREEN, 2));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (isRustica)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\trusticaValida = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\turbanaValida = true;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcatch (Exception exc)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// En la fecha de alta\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcadenaTexto = cadenaTexto\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ aplicacion.getI18nString(\\\"importar.informe.parcelas.fecha.alta.validacion\\\")\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ masa\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ hoja\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ parcela\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ aplicacion.getI18nString(\\\"importar.informe.parcelas.fin.rustico\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\texc.printStackTrace();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFila = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFilas = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// break;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//Se comprueba si la geometría es de tipo polygon y no es empty (únicas válidas en la capa parcelas)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (!(f.getGeometry() instanceof Polygon)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t|| f.getGeometry().isEmpty())\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcadenaTexto = I18N.get(\\\"ImportadorParcelas\\\", \\\"importar.informe.parcelas.error.inicio.parcelario\\\")\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ I18N.get(\\\"ImportadorParcelas\\\", \\\"importar.informacion.referencia.validacion.geometria\\\") + \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tI18N.get(\\\"ImportadorParcelas\\\", \\\"importar.informe.parcelas.error.fin.parcelario\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFila = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFilas = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// Alguno de los campos no están\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// definidos\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// JOptionPane.showMessageDialog(this,aplicacion.getI18nString(\\\"importar.informe.parcelas.algun.campo\\\"));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tcadenaTexto += aplicacion.getI18nString(\\\"importar.informacion.ficheros.no.correctos\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFilas = true;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (isRustica)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\trusticaValida = false;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\turbanaValida = false;\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t\\tcatch (Exception e)\\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\thayErroresFilas = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t\\tfinally\\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tprogressDialog.setVisible(false);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}).start();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t});\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tGUIUtil.centreOnWindow(progressDialog);\\r\\n\\t\\t\\tprogressDialog.setVisible(true);\\r\\n\\r\\n\\t\\t\\tif (hayErroresFilas)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tjtf.setBorder(BorderFactory.createLineBorder(Color.RED, 2));\\r\\n\\t\\t\\t\\tcadenaTexto = cadenaTexto + aplicacion.getI18nString(\\\"validacion.finalizada\\\");\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tjtf.setBorder(BorderFactory.createLineBorder(Color.GREEN, 2));\\r\\n\\t\\t\\t\\tcadenaTexto = cadenaTexto + aplicacion.getI18nString(\\\"importar.informe.parcelas.fichero.correcto\\\")\\r\\n\\t\\t\\t\\t+ aplicacion.getI18nString(\\\"validacion.finalizada\\\");\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tediError.setText(cadenaTexto);\\r\\n\\t\\t\\twizardContext.inputChanged();\\r\\n\\t\\t}\\r\\n\\r\\n\\t}\",\n \"public static void readMetro(String ligne){\\n file=ligne;\\n try{\\n Metro.readGraph();\\n }\\n catch (FileNotFoundException e){\\n System.out.println(\\\"It's not the file you're looking for.\\\");\\n }\\n ;\\n }\",\n \"public void restaurarPartida() throws FileNotFoundException, IOException, ClassNotFoundException {\\n\\t\\tjuego.restaurarPartida(jugador.getID());\\t\\r\\n\\t}\",\n \"public static void otvoriFajl() {\\r\\n\\t\\tJFileChooser fc = new JFileChooser();\\r\\n\\t\\tFileNameExtensionFilter filter = new FileNameExtensionFilter(\\\"Gym files\\\", \\\"gym\\\");\\r\\n\\r\\n\\t\\tfc.setFileFilter(filter);\\r\\n\\t\\tfc.setCurrentDirectory(new File(\\\".\\\"));\\r\\n\\t\\tint izbor = fc.showOpenDialog(teretanaGui.getContentPane());\\r\\n\\r\\n\\t\\tif (izbor == JFileChooser.APPROVE_OPTION) {\\r\\n\\t\\t\\tFile f = fc.getSelectedFile();\\r\\n\\r\\n\\t\\t\\tString fileName = f.getAbsolutePath();\\r\\n\\r\\n\\t\\t\\tpath = fileName;\\r\\n\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\tlistaClanova.ucitajIzFajla(fileName);\\r\\n\\t\\t\\t\\tpopuniTabelu();\\r\\n\\t\\t\\t} catch (Exception e) {\\r\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(teretanaGui.getContentPane(), \\\"Greska pri ucitavanju clanova!\\\", \\\"Greska\\\",\\r\\n\\t\\t\\t\\t\\t\\tJOptionPane.ERROR_MESSAGE);\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public void loadShow(File f) {\\n \\n }\",\n \"public void seleccionarArchivo(){\\n JFileChooser j= new JFileChooser();\\r\\n FileNameExtensionFilter fi= new FileNameExtensionFilter(\\\"pdf\\\",\\\"pdf\\\");\\r\\n j.setFileFilter(fi);\\r\\n int se = j.showOpenDialog(this);\\r\\n if(se==0){\\r\\n this.txtCurriculum.setText(\\\"\\\"+j.getSelectedFile().getName());\\r\\n ruta_archivo=j.getSelectedFile().getAbsolutePath();\\r\\n }else{}\\r\\n }\",\n \"private void jButtonCreateInsexActionPerformed(java.awt.event.ActionEvent evt) {\\n try {\\n lstPerson = new ArrayList();\\n Properties prop = new Properties();//почти тоже самое что ini файлы\\n content = Files.readAllLines(Paths.get(PATH_FILE_SOURCE), Charset.forName(\\\"cp1251\\\"));\\n String s = content.get(0);\\n for (int i = 0, j = 1; i < s.length(); i += 128, j++) {\\n Person p = new Person(\\n s.substring(i, i + 30).trim(),\\n s.substring(i + 30, i + 50).trim(),\\n s.substring(i + 50, i + 70).trim(),\\n s.substring(i + 70, i + 78).trim(),\\n s.substring(i + 78).trim(), j);\\n lstPerson.add(p);\\n }\\n\\n for (Person person : lstPerson) {\\n prop.put(person.getSurname().toUpperCase(), Integer.toString(person.getID()));\\n }\\n prop.storeToXML(new FileOutputStream(FILE_PATH_INDEX_SURNAME), \\\"LIB\\\");//можно и без xml\\n jLabelStatusBar.setForeground(Color.magenta);\\n jLabelStatusBar.setText(\\\"Индексный файл создан!\\\");\\n jLabelStatusBar.setForeground(Color.BLACK);\\n\\n } catch (IOException ex) {\\n jLabelStatusBar.setForeground(Color.red);\\n jLabelStatusBar.setText(\\\"Индексный файл не создан!\\\");\\n Logger.getLogger(NewJFrame1.class.getName()).log(Level.SEVERE, null, ex);\\n }\\n }\",\n \"public void leerFichero(String rutaFichero) {\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\tBufferedReader fichero;\\r\\n\\t\\t\\t\\tfichero = new BufferedReader(new FileReader(rutaFichero));\\r\\n\\t\\t\\t\\tString registro;\\r\\n\\t\\t\\t\\twhile ((registro = fichero.readLine()) != null) {\\r\\n\\t\\t\\t\\t\\tSystem.out.println(registro);\\r\\n\\r\\n\\t\\t\\t\\t\\t// ................\\r\\n\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tfichero.close();\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"Fin de la lectura del fichero\\\");\\r\\n\\r\\n\\t\\t\\t} catch (FileNotFoundException excepcion) {\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"fichero no encontrado\\\");\\r\\n\\r\\n\\t\\t\\t} catch (IOException e) {\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"IO Excepcion\\\");\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\",\n \"public void KvtTartListFrissit( String sKonyvtar)\\r\\n {\\n File cAktKvt = null ;\\r\\n Object aKvtTartalma[] = null ;\\r\\n\\r\\n//System.out.println( \\\"JFileValasztDlg.KvtTartListFrissit( \\\" + sKonyvtar + \\\")\\\") ;\\r\\n\\r\\n// cAktKvt = new File( \\\".\\\") ;\\r\\n// cAktKvt = new File( \\\"/home/tamas/java/Polar/hrmfiles\\\") ;\\r\\n cAktKvt = new File( sKonyvtar) ;\\r\\n\\r\\n//System.out.println( \\\"JFileValasztDlg.KvtTartListFrissit cAktKvt = new File() utan\\\") ;\\r\\n\\r\\n // Az aktualis konyvtar teljes utvonalanak beirasa\\r\\n// Itt nyeli le a vegerol a \\\\-t vagy /-t :\\r\\n// m_jKonyvtarTxtFld.setText( cAktKvt.getAbsolutePath()) ; // getAbsolutePath()\\r\\n m_jKonyvtarTxtFld.setText( sKonyvtar) ;\\r\\n\\r\\n//System.out.println( \\\"JFileValasztDlg.KvtTartListFrissit m_jKonyvtarTxtFld.setText( cAktKvt.getAbsolutePath()) utan\\\") ;\\r\\n if ( cAktKvt != null && cAktKvt.isDirectory() == true )\\r\\n {\\r\\n aKvtTartalma = HRMFileSzuro( cAktKvt) ;\\r\\n//System.out.println( \\\"JFileValasztDlg.KvtTartListFrissit() : HRMFileSzuro() utan\\\") ;\\r\\n\\r\\n if ( aKvtTartalma != null )\\r\\n {\\r\\n/*\\r\\nfor ( int i=0 ; i < aKvtTartalma.length ; i++ )\\r\\n{\\r\\nSystem.out.println( \\\"JFileValasztDlg.KvtTartListFrissit() : cKvtrkFileok[\\\" + i + \\\"]=\\\" + aKvtTartalma[i].toString()) ;\\r\\n}\\r\\n*/\\r\\n m_jKvtTartList.setListData( aKvtTartalma) ;\\r\\n//System.out.println( \\\"JFileValasztDlg.KvtTartListFrissit() : .setListData() utan\\\") ;\\r\\n\\r\\n // Itt mar valoszinu, hogy a ListBox a konyvtar file-jait tartalmazza +++\\r\\n SetAktKonyvtar( sKonyvtar) ;\\r\\n\\r\\n m_jKvtTartList.setSelectedIndex( 0) ;\\r\\n \\r\\n//System.out.println( \\\"JFileValasztDlg.KvtTartListFrissit() : SetAktKonyvtar() utan\\\") ;\\r\\n//System.out.println( \\\"JFileValasztDlg.KvtTartListFrissit() : setListData\\\") ;\\r\\n/*\\r\\n for ( nIdx = 0 ; nIdx < aKvtTartalma.length ; nIdx++ )\\r\\n {\\r\\n m_jKvtTartList.setListData( aKvtTartalma) ;\\r\\n }\\r\\n*/\\r\\n }\\r\\n }\\r\\n }\",\n \"public AppGenALexicos(File f) {\\n initComponents();\\n String cadena = \\\"\\\";\\n try {\\n FileReader fr = new FileReader(f);\\n try (BufferedReader br = new BufferedReader(fr)) {\\n while ((cadena = br.readLine()) != null) {\\n jTextArea1.append(cadena + \\\"\\\\n\\\");\\n }\\n }\\n } catch (FileNotFoundException ex) {\\n Logger.getLogger(AppCompiladores.class.getName()).log(Level.SEVERE, null, ex);\\n } catch (IOException ex) {\\n Logger.getLogger(AppCompiladores.class.getName()).log(Level.SEVERE, null, ex);\\n }\\n }\",\n \"private void cargarFichero() throws FileNotFoundException {\\n\\t\\tFile miFichero = new File(NOMBRE_FICHERO);\\n\\t\\tFileWriter erroresFichero;\\n\\t\\t\\n\\t\\tScanner in = new Scanner(miFichero);\\n\\t\\t\\n\\t\\tEjercicio nuevoEjer;\\n\\t\\tString siguienteLinea;\\n\\t\\tComprobadorEntradaFichero comprobador = new ComprobadorEntradaFichero();\\n\\t\\tString errores = \\\"\\\";\\n\\t\\tint numLinea = 1;\\n\\t\\t\\n\\t\\twhile (in.hasNextLine()) {\\n\\t\\t\\t\\n\\t\\t\\tsiguienteLinea = in.nextLine();\\n\\t\\t\\tif (comprobador.test(siguienteLinea)) {\\n\\t\\t\\t\\tnuevoEjer = new Ejercicio(siguienteLinea);\\n\\t\\t\\t\\tcoleccionEj.addEjercicio(nuevoEjer);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t//Controlar cuántos errores va dando\\n\\t\\t\\t\\terrores += \\\"Error en la lÃnea: \\\" + String.valueOf(numLinea) + \\\". Datos: \\\" + siguienteLinea + \\\"\\\\n\\\";\\n\\t\\t\\t}\\n\\t\\t\\tnumLinea++;\\n\\t\\t}\\n\\t\\t\\n\\t\\tin.close();\\n\\t\\t\\n\\t\\t\\n\\t\\t//Ahora escribimos \\n\\t\\tif (errores != \\\"\\\") {\\n\\t\\t\\ttry {\\n\\t\\t\\t erroresFichero = new FileWriter(NOMBRE_FICHERO_ERRORES);\\n\\t\\t\\n\\t\\t\\t erroresFichero.write(errores);\\n\\n\\t\\t\\t erroresFichero.close();\\n\\n\\t\\t\\t} catch (Exception ex) {\\n\\t\\t\\t\\tSystem.out.println(\\\"Mensaje de la excepción: \\\" + ex.getMessage());\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"public void instalarTipoLetra()\\r\\n\\t{\\r\\n\\t\\ttry\\r\\n { \\r\\n FileInputStream fIn = new FileInputStream(\\\"./images/dandelion in the spring.ttf\\\");\\r\\n FileOutputStream fOut = new FileOutputStream(\\\"C:/windows/fonts/dandelion in the spring.ttf\\\");\\r\\n \\r\\n FileChannel fIChan = fIn.getChannel();\\r\\n FileChannel fOChan = fOut.getChannel();\\r\\n \\r\\n long fSize = fIChan.size();\\r\\n \\r\\n MappedByteBuffer mBuf = \\r\\n fIChan.map(FileChannel.MapMode.READ_ONLY, 0, fSize); \\r\\n fOChan.write(mBuf);//con esto copiamos el archivo\\r\\n \\r\\n //nunca olvidemos cerrar los archivos\\r\\n fIChan.close();\\r\\n fIn.close();\\r\\n fOChan.close();\\r\\n fOut.close();\\r\\n JOptionPane.showMessageDialog(this,\\\"El tipo de letra ha sido instalada en el sistema operativo.\\\",\\\"Instalar Tipo Letra\\\", JOptionPane.INFORMATION_MESSAGE,new ImageIcon(\\\"./images/IconosInterfaz/informacion.PNG\\\"));\\r\\n JOptionPane.showMessageDialog(this,\\\"Cierre el Sistema Experto - SESP y vuelva a iniciar el ejecutable.\\\",\\\"Instalar Tipo Letra\\\", JOptionPane.INFORMATION_MESSAGE,new ImageIcon(\\\"./images/IconosInterfaz/informacion.PNG\\\"));\\r\\n }\\r\\n catch(Exception ef)\\r\\n {\\r\\n \\tJOptionPane.showMessageDialog(this,\\\"Error al instalar el tipo de letra dandelion in the spring en el sistema operativo\\\",\\\"Error\\\", JOptionPane.ERROR_MESSAGE,new ImageIcon(\\\"./images/IconosInterfaz/error.PNG\\\"));\\r\\n \\tJOptionPane.showMessageDialog(this,\\\"Intente instalar manualmente el archivo (dandelion in the spring.ttf) que esta en la carpeta images o intente\\\"+\\\"\\\\n\\\"+\\\" copiar manualmente el archivo (dandelion in the spring.ttf) en el directorio C:/windows/fonts\\\",\\\"Error\\\", JOptionPane.ERROR_MESSAGE,new ImageIcon(\\\"./images/IconosInterfaz/error.PNG\\\"));\\r\\n \\t}\\r\\n\\t}\",\n \"private static void showFiles(File f) {\\n\\t\\n}\",\n \"public void importaRegole(String file, ArrayList<Sensore> listaSensori, ArrayList<Attuatore> listaAttuatori) {\\n ArrayList<String> nomiDispPres = new ArrayList<>();\\n\\n for (Sensore s : listaSensori) {\\n nomiDispPres.add(s.getNome());\\n }\\n\\n for (Attuatore att : listaAttuatori) {\\n nomiDispPres.add(att.getNome());\\n }\\n\\n String regoleImport = readFromFile(file);\\n\\n if (regoleImport.equals(\\\"\\\")) {\\n System.out.println(\\\"XX Errore di lettura file. Non sono state inserite regole per l'unita immobiliare XX\\\\n\\\");\\n return;\\n }\\n\\n String[] regole = regoleImport.split(\\\"\\\\n\\\");\\n\\n for (String r : regole) {\\n try {\\n ArrayList<String> dispTrovati = verificaCompRegola(r);\\n\\n for (String nomeDis : dispTrovati) {\\n if (nomeDis.contains(\\\".\\\")){\\n String nomeS = nomeDis.split(\\\"\\\\\\\\.\\\")[0];\\n\\n if (!nomiDispPres.contains(nomeS)) {\\n throw new Exception(\\\"XX Dispositivi Incompatibili all'interno della regola XX\\\\n\\\");\\n }\\n\\n Sensore s = listaSensori.stream().filter(sensore -> sensore.getNome().equals(nomeS)).iterator().next();\\n String nomeInfo = nomeDis.split(\\\"\\\\\\\\.\\\")[1];\\n\\n if (s.getInformazione(nomeInfo) == null)\\n throw new Exception(\\\"XX Regola non compatibile XX\\\\n\\\");\\n\\n\\n } else if (!nomiDispPres.contains(nomeDis)) {\\n throw new Exception(\\\"XX Dispositivi Incompatibili all'interno della regola XX\\\\n\\\");\\n\\n }\\n }\\n System.out.println(\\\"*** Importazione della regola avvenuta con successo ***\\\\n\\\");\\n writeRuleToFile(r, true);\\n\\n } catch (Exception e) {\\n System.out.println(e.getMessage());\\n }\\n\\n }\\n eliminaDoppie(listaSensori,listaAttuatori);\\n }\",\n \"void load_from_file(){\\n\\t\\tthis.setAlwaysOnTop(false);\\n\\t\\t\\n\\t\\t/**\\n\\t\\t * chose file with file selector \\n\\t\\t */\\n\\t\\t\\n\\t\\tFileDialog fd = new FileDialog(this, \\\"Choose a file\\\", FileDialog.LOAD);\\n\\t\\t\\n\\t\\t//default path is current directory\\n\\t\\tfd.setDirectory(System.getProperty(\\\"user.dir\\\"));\\n\\t\\tfd.setFile(\\\"*.cmakro\\\");\\n\\t\\tfd.setVisible(true);\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\tString filename = fd.getFile();\\n\\t\\tString path = fd.getDirectory();\\n\\t\\tString file_withpath = path + filename;\\n\\t\\t\\n\\t\\t\\n\\t\\tif (filename != null) {\\n\\t\\t\\t System.out.println(\\\"load path: \\\" + file_withpath);\\t\\n\\t\\t\\n\\t\\t\\t \\n\\t\\t\\t /**\\n\\t\\t\\t * read object from file \\n\\t\\t\\t */\\n\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\tObjectInputStream in = new ObjectInputStream(new FileInputStream(file_withpath));\\n\\n\\t\\t\\t\\t\\tKey_Lists = Key_Lists.copy((key_lists) in.readObject());\\n\\n\\t\\t\\t\\t\\tkeys_area.setText(Key_Lists.arraylist_tostring());\\t\\t\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tin.close();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tinfo_label.setForeground(green);\\n\\t\\t\\t\\t\\tinfo_label.setText(\\\"file loaded :D\\\");\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t} catch (FileNotFoundException e) {\\n\\t\\t\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t\\t} catch (IOException e) {\\n\\t\\t\\t\\t\\tinfo_label.setForeground(white);\\n\\t\\t\\t\\t\\tinfo_label.setText(\\\"wrong file format\\\");\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"io exception\\\");\\n\\t\\t\\t\\t\\t//e.printStackTrace();\\n\\t\\t\\t\\t} catch (ClassNotFoundException e) {\\n\\t\\t\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\tthis.setAlwaysOnTop(true);\\n\\t\\n\\t}\",\n \"public FrmFerramentas() throws IOException {\\n initComponents();\\n SelecionaLocal();\\n //PreencheLook();\\n }\",\n \"public void leerDeFichero() {\\n try\\n {\\n Scanner sc = new Scanner(new File(\\\"texto.txt\\\"));\\n while (sc.hasNextLine() && !textoCompleto())\\n addFrase(sc.nextLine());\\n sc.close();\\n }\\n catch (IOException e)\\n {\\n e.printStackTrace();\\n }\\n }\",\n \"public static void main(String[] args) {\\n File myFile = new File (\\\"d:/names.txt\\\");\\r\\n // para saber si el archivo no existe, devuelve true o false\\r\\n System.out.println(\\\"file.exists(): \\\" + myFile.exists());\\r\\n System.out.println(\\\"file.isDirectory(): \\\" + myFile.isDirectory());\\r\\n // para saber la fecha de modificación\\r\\n System.out.println(\\\"file.lastModified(): \\\" + myFile.lastModified());\\r\\n // para saber el nombre del archivo\\r\\n System.out.println(\\\"file.getName(): \\\" + myFile.getName());\\r\\n // para saber la ruta\\r\\n System.out.println(\\\"file.getPath(): \\\" + myFile.getPath());\\r\\n // para saber el tamaño en bytes que ocupa en disco\\r\\n System.out.println(\\\"file.length(): \\\" + myFile.length()+\\\" bytes\\\");\\r\\n // para saber si es de lectura, devuelve true o false\\r\\n System.out.println(\\\"file.canRead():\\\" + myFile.canRead());\\r\\n\\r\\n //File newfolder = new File(\\\"D:/carpeta con archivos año mío\\\");\\r\\n //System.out.println(newfolder.mkdir());\\r\\n\\r\\n // si fuera un directorio, para saber los archivos que contiene\\r\\n File carpeta = new File(\\\"D:/carpeta_con_archivos\\\");\\r\\n System.out.println(\\\"----listado archivos D:/carpeta_archivos------\\\");\\r\\n for (String archivo : carpeta.list()) {\\r\\n System.out.println(archivo);\\r\\n }\\r\\n\\r\\n //agregar una linea nueva a un archivo existente (METODO 1)\\r\\n /*try {\\r\\n //abra el archivo , TRUE en un forma append (agregar nuevos valores)\\r\\n FileWriter myFile2 = new FileWriter(\\\"d:/names.txt\\\", true);\\r\\n //cargar en memora ram del SO el contenido del archivo\\r\\n BufferedWriter dataFile = new BufferedWriter(myFile2);\\r\\n //agregar una nueva linea\\r\\n dataFile.write(\\\"\\\\nnueva linea tres\\\");\\r\\n dataFile.close();\\r\\n\\r\\n } catch (IOException e) {\\r\\n e.printStackTrace();\\r\\n }*/\\r\\n //agregar una linea nueva a un archivo existente (METODO 1 optimizado)\\r\\n /*try{\\r\\n BufferedWriter dataFile = new BufferedWriter(new FileWriter(\\\"d:/names.txt\\\",true));\\r\\n //agregamos la nueva linea\\r\\n dataFile.write(\\\"nueva linea sin borrar\\\");\\r\\n dataFile.close();\\r\\n } catch (Exception e) {\\r\\n e.printStackTrace();\\r\\n }*/\\r\\n // agregar nueva linea con metodo super optimizado en lineas (METODO FLAHS)\\r\\n try{\\r\\n PrintWriter myFile3 = new PrintWriter(new BufferedWriter(new FileWriter(\\\"d:/names.txt\\\", true)));\\r\\n myFile3.println(\\\"Otra nueva línea mezclando las dos librerías (PrintWriter + FileWriter) \\\");\\r\\n myFile3.close();\\r\\n\\r\\n } catch (Exception e) {\\r\\n e.printStackTrace();\\r\\n }\\r\\n\\r\\n\\r\\n }\",\n \"public void Leer() throws FileNotFoundException\\n {\\n // se crea una nueva ruta en donde se va a ir a leer el archivo\\n String ruta = new File(\\\"datos.txt\\\").getAbsolutePath(); \\n archivo=new File(ruta); \\n }\",\n \"public static void LeerCaracter(File rutaLeer, File rutaEscribir) throws IOException {\\n\\n FileReader lector = new FileReader(rutaLeer);\\n FileWriter escritor = new FileWriter(rutaEscribir);\\n\\n String cartelera = (\\\"--------------------------------------\\\\n\\\"\\n + \\\" Cartelera de CineFBMoll\\\\n\\\"\\n + \\\"--------------------------------------\\\\n\\\\n\\\");\\n\\n String linea = \\\"--------------------------------------\\\\n\\\\n\\\";\\n\\n //se escribe la cartelera\\n for (int i = 0; i < cartelera.length(); i++) {\\n escritor.write(cartelera.charAt(i));\\n }\\n\\n int caracter;\\n int contador = 0;\\n boolean encontrarSigno = true;\\n\\n while ((caracter = lector.read()) != -1) {\\n if (((char) caracter) != '#') {\\n if (((char) caracter) != '{') {\\n if (encontrarSigno) {\\n for (int i = 0; i < datos[contador].length(); i++) {\\n escritor.write(datos[contador].charAt(i)); // imprimir elemento de datos\\n }\\n escritor.write(\\\": \\\");\\n encontrarSigno = false;\\n }\\n escritor.write(((char) caracter));\\n } else {\\n escritor.write(\\\"\\\\n\\\");\\n escritor.write(\\\"\\\\n\\\");\\n for (int i = 0; i < linea.length(); i++) {\\n escritor.write(linea.charAt(i));\\n }\\n\\n contador = 0;\\n encontrarSigno = true;\\n }\\n } else {\\n escritor.write(\\\"\\\\n\\\");\\n escritor.write(\\\"\\\\n\\\");\\n contador++;\\n encontrarSigno = true;\\n }\\n }//while\\n lector.close();// Cierra el archivo \\n escritor.close();// Cierra el archivo \\n\\n }\",\n \"private void dialogFichierInexistant(File file){\\n\\t\\tJOptionPane.showMessageDialog(null, \\\"le fichier \\\" + file.getName() +\\\"\\\\n'existe pas\\\", \\\"Erreur\\\", JOptionPane.ERROR_MESSAGE);\\n\\t}\",\n \"public void lesBok(String filen)throws Exception\\n {\\n liste.add(new Ord(\\\"null\\\"));//se siste linje i finnOrd-metod\\n Scanner inn = new Scanner(new File(filen));//henter ord fra filen anngitt i kallet paa metode lesBok og legger det inn i scanner inn\\n while (inn.hasNextLine())\\n {\\n String tempOrd = inn.nextLine();\\n leggeTilOrd(tempOrd);//sender ord fra scanner via string til metode legeTilOrd\\n }\\n }\",\n \"private void guardarComo() {\\r\\n\\t\\tJFileChooser guardar = new JFileChooser();\\r\\n\\t\\tFileNameExtensionFilter filtro = new FileNameExtensionFilter(\\\"obj\\\",\\\"obj\\\");\\r\\n\\t\\tguardar.setFileFilter(filtro);\\r\\n\\t\\tif(guardar.showSaveDialog(guardar) == JFileChooser.APPROVE_OPTION){\\r\\n\\t\\t\\tGestion.setFichero(Gestion.extensionValida(guardar.getSelectedFile()));\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\tif(!Gestion.existe(Gestion.getFichero())){\\r\\n\\t\\t\\t\\t\\tGestion.escribir(Gestion.getFichero());\\r\\n\\t\\t\\t\\t\\tGestion.setModificado(false);\\r\\n\\t\\t\\t\\t\\tfrmLigaDeFtbol.setTitle(Gestion.getFichero().getName());\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse{\\r\\n\\t\\t\\t\\t\\tswitch(JOptionPane.showConfirmDialog(null, \\\"El archivo existe. Desea sobreescribirlo?\\\", \\\"Aviso\\\", JOptionPane.WARNING_MESSAGE)){\\r\\n\\t\\t\\t\\t\\tcase JOptionPane.OK_OPTION:\\r\\n\\t\\t\\t\\t\\t\\tGestion.escribir(Gestion.getFichero());\\r\\n\\t\\t\\t\\t\\t\\tGestion.setModificado(false);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfrmLigaDeFtbol.setTitle(Gestion.getFichero().getName());\\r\\n\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t} catch (IOException e) {\\r\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(null, e.getMessage(), \\\"Error\\\", JOptionPane.ERROR_MESSAGE);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public void pruebaEscritura() {\\n\\t\\tFileWriter fichero = null;\\n\\t\\tPrintWriter pw = null;\\n\\t\\ttry {\\n\\t\\t\\tfichero = new FileWriter(\\\"//172.16.1.141/Modelo_Raster/Varios/Monitoreo_Forestal/REDD/Metadatos/test.xml\\\");\\n\\t\\t\\tpw = new PrintWriter(fichero);\\n\\n\\t\\t\\tfor (int i = 0; i < 10; i++)\\n\\t\\t\\t\\tpw.println(\\\"Linea \\\" + i);\\n\\n\\t\\t}\\n\\t\\tcatch (Exception e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\tfinally {\\n\\t\\t\\ttry {\\n\\t\\t\\t\\t// Nuevamente aprovechamos el finally para\\n\\t\\t\\t\\t// asegurarnos que se cierra el fichero.\\n\\t\\t\\t\\tif (null != fichero) fichero.close();\\n\\t\\t\\t}\\n\\t\\t\\tcatch (Exception e2) {\\n\\t\\t\\t\\te2.printStackTrace();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public String ouvrir(){\\n \\n JTextArea text=new JTextArea();\\n FileNameExtensionFilter filter = new FileNameExtensionFilter (\\n \\\"java\\\", \\\"java\\\");\\n chooser.setFileFilter(filter);\\n \\n int ret=chooser.showOpenDialog(text);\\n String path=\\\"\\\";\\n if(ret==JFileChooser.APPROVE_OPTION){\\n path=chooser.getSelectedFile().getAbsolutePath();\\n }\\n\\n return path;\\n }\",\n \"private String setFichero(enumFicheros fichero)\\n\\t{\\n\\t\\tswitch(fichero)\\n\\t\\t{\\n\\t\\tcase FICHERO_INFO_RANURA1:\\n\\t\\t{\\n\\t\\t\\treturn fichero_info_ranura1;\\n\\t\\t}\\n\\t\\tcase FICHERO_INFO_RANURA2:\\n\\t\\t{\\n\\t\\t\\treturn fichero_info_ranura2;\\n\\t\\t}\\n\\t\\tcase FICHERO_INFO_RANURA3:\\n\\t\\t{\\n\\t\\t\\treturn fichero_info_ranura3;\\n\\t\\t}\\n\\t\\tcase FICHERO_PJ_RANURA1:\\n\\t\\t{\\n\\t\\t\\treturn fichero_pj_ranura1;\\n\\t\\t}\\n\\t\\tcase FICHERO_PJ_RANURA2:\\n\\t\\t{\\n\\t\\t\\treturn fichero_pj_ranura2;\\n\\t\\t}\\n\\t\\tcase FICHERO_PJ_RANURA3:\\n\\t\\t{\\n\\t\\t\\treturn fichero_pj_ranura3;\\n\\t\\t}\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"public void xuLyLuuHoaHoaDon(){\\n JFileChooser fileChooser = new JFileChooser();\\n fileChooser.setFileFilter(new FileFilter() {\\n @Override\\n public boolean accept(File file) {\\n return file.getAbsolutePath().endsWith(\\\".txt\\\");\\n }\\n\\n @Override\\n public String getDescription() {\\n return \\\".txt\\\";\\n }\\n });\\n fileChooser.setFileFilter(new FileFilter() {\\n @Override\\n public boolean accept(File file) {\\n return file.getAbsolutePath().endsWith(\\\".doc\\\");\\n }\\n\\n @Override\\n public String getDescription() {\\n return \\\".doc\\\";\\n }\\n });\\n int flag = fileChooser.showSaveDialog(null);\\n if(flag == JFileChooser.APPROVE_OPTION){\\n File file = fileChooser.getSelectedFile();\\n try {\\n OutputStreamWriter outputStreamWriter = new OutputStreamWriter(new FileOutputStream(file), Charset.forName(\\\"UTF-8\\\"));\\n PrintWriter printWriter = new PrintWriter(outputStreamWriter);\\n String lineTieuDe1 = \\\"----------------Phiếu Thanh Toán-----------------------\\\";\\n String lineMaPTT = \\\"+Mã Phiếu Thanh Toán: \\\" + txtMaPTT.getText();\\n String lineMaPDK = \\\"+Mã Phiếu Đăng Ký: \\\" + cbbMaPDK.getSelectedItem().toString();\\n String lineSoThang = \\\"+Số Tháng: \\\" + txtSoThang.getText()+\\\"|\\\";\\n String lineNgayTT = \\\"+Ngày Thanh Toán: \\\" + txtNgayTT.getText();\\n String lineTienPhong = \\\"+Tiền Phòng: \\\" + txtTongTien.getText();\\n String lineTienDV = \\\"+Tiền Dịch Vụ: \\\"+txtThanhToanTongCong.getText();\\n String lineTieuDe2 = \\\"--------------------------------------------------------\\\";\\n String lineTienPhaiTra =\\\"+Tiền Phải Trả: \\\" + txtTienPhaiTra.getText()+\\\" \\\";\\n String lineTieuDe3 = \\\"--------------------------------------------------------\\\";\\n \\n printWriter.println(lineTieuDe1);\\n printWriter.println(lineMaPTT);\\n printWriter.println(lineMaPDK);\\n printWriter.println(lineSoThang);\\n printWriter.println(lineNgayTT);\\n printWriter.println(lineTienPhong);\\n printWriter.println(lineTienDV);\\n printWriter.println(lineTieuDe2);\\n printWriter.println(lineTienPhaiTra);\\n printWriter.println(lineTieuDe3);\\n \\n printWriter.close();\\n outputStreamWriter.close();\\n \\n } catch (Exception e) {\\n e.printStackTrace();\\n }\\n JOptionPane.showMessageDialog(null, \\\"Đã lưu\\\");\\n }\\n \\n }\",\n \"public void readFromFile() {\\n\\n\\t}\",\n \"private void jMenuItem_ShowProspectActionPerformed(java.awt.event.ActionEvent evt) {//GEN-FIRST:event_jMenuItem_ShowProspectActionPerformed\\n File fProspect = new File(\\\"Propsect_Relance.csv\\\");\\n try {\\n Desktop.getDesktop().open(fProspect);\\n } catch (IOException ex) {\\n Logger.getLogger(JFrame_Accueil.class.getName()).log(Level.SEVERE, null, ex);\\n }\\n }\",\n \"public void grabarGrafoColoreado(String archivo) {\\n\\t\\tPrintWriter salida = null;\\n\\t\\ttry {\\n\\n\\t\\t\\tsalida = new PrintWriter(new FileWriter(archivo));\\n\\t\\t\\tsalida.println(cantNodos + \\\" \\\" + cantColores);\\n\\n\\t\\t\\tfor (int i = 0; i < cantNodos; i++)\\n\\t\\t\\t\\tsalida.println(nodos.get(i).getNumero() + \\\" \\\" + nodos.get(i).getColor());\\n\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t} finally {\\n\\t\\t\\tsalida.close();\\n\\t\\t}\\n\\t}\",\n \"public static void main(String[] args) {\\n\\r\\n String contenido = \\\"\\\";\\r\\n\\r\\n try {\\r\\n FileReader in = new FileReader(\\\"./src/fichero_prueba.txt\\\");\\r\\n int c = in.read();\\r\\n\\r\\n while (c != -1) {\\r\\n contenido += (char) c;\\r\\n c = in.read();\\r\\n }\\r\\n in.close();\\r\\n } catch (IOException e){\\r\\n System.out.println(e.getMessage());\\r\\n }\\r\\n\\r\\n System.out.println(contenido);\\r\\n\\r\\n\\r\\n //LEER MENSAJE POR BLOQUES\\r\\n\\r\\n String contenido2 = \\\"\\\";\\r\\n\\r\\n try {\\r\\n BufferedReader inb = new BufferedReader(new FileReader(\\\"./src/fichero_prueba.txt\\\"));\\r\\n\\r\\n String linea = inb.readLine();\\r\\n while (linea!=null){\\r\\n contenido2 += linea+\\\"\\\\n\\\";\\r\\n linea = inb.readLine();\\r\\n }\\r\\n inb.close();\\r\\n } catch (IOException e){\\r\\n e.printStackTrace();\\r\\n }\\r\\n System.out.println(contenido2);\\r\\n\\r\\n }\",\n \"private void openFile() {\\n\\t\\t\\n\\t\\n\\t\\t\\t\\n\\t\\tFile file = jfc.getSelectedFile();\\n\\t\\tint a = -1;\\n\\t\\tif(file==null&&!jta.getText().equals(\\\"\\\"))\\n\\t\\t{\\n\\t\\t\\ta = JOptionPane.showConfirmDialog(this, \\\"저장?\\\");\\n\\t\\t\\n\\t\\t}\\n\\t\\tswitch (a){\\n\\t\\tcase 0:\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tint c = -1;\\n\\t\\t\\t\\tif(file==null)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tc = jfc.showSaveDialog(this);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(file!= null || c ==0)\\n\\t\\t\\t\\t{\\t\\n\\t\\t\\t\\t\\tFileWriter fw = new FileWriter(jfc.getSelectedFile());\\n\\t\\t\\t\\t\\tfw.write(jta.getText());\\n\\t\\t\\t\\t\\tfw.close();\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"파일을 저장하였습니다\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t} catch (Exception e2) {\\n\\t\\t\\t\\t// TODO: handle exception\\n\\t\\t\\t\\tSystem.out.println(e2.getMessage());\\n\\t\\t\\t}\\n\\t\\tbreak;\\n\\t\\tcase 1:\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tint j=-1;\\n\\t\\t\\t\\tif(file==null)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tj = jfc.showOpenDialog(this);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(file!= null || j == 1)\\n\\t\\t\\t\\t{\\t\\n\\t\\t\\t\\t\\tFileReader fr = new FileReader(file);\\n\\n\\t\\t\\t\\t\\tString str=\\\"\\\";\\n\\t\\t\\t\\t\\twhile((j=fr.read())!=-1)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tstr = str+(char)j;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tjta.setText(str);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tsetTitle(file.getName());\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tfr.close();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\t\\n\\t\\t\\tcatch (Exception e2) {\\n\\t\\t\\t\\t// TODO: handle exception\\n\\t\\t\\t\\tSystem.out.println(e2.getMessage());\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tint d= jfc.showOpenDialog(this);\\n\\t\\t\\n\\t\\tif(d==0)\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tFileReader fr = new FileReader(jfc.getSelectedFile());\\n\\t\\t\\t\\tint l;\\n\\t\\t\\t\\tString str=\\\"\\\";\\n\\t\\t\\t\\twhile((l=fr.read())!=-1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tstr = str+(char)l;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tjta.setText(str);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tfr.close();\\n\\t\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t} catch (Exception e2) {\\n\\t\\t\\t\\t// TODO: handle exception\\n\\t\\t\\t\\tSystem.out.println(e2.getMessage());\\n\\t\\t\\t}\\n\\t}\",\n \"final public void GuardarCuadruplos() throws ParseException {\\ntry {\\n // Crea un cuadro de dialogo. El input se guarda en strNomArchivo\\n String strNomArchivo = \\\"\\\";\\n\\n // Si el campo quedo vacío o se cerró la ventana, volver a mostrarlo\\n while (strNomArchivo==null || strNomArchivo.trim().isEmpty()) {\\n strNomArchivo = (String)JOptionPane.showInputDialog(\\n null, \\\"Escribe el nombre que tendra el archivo\\\", \\\"Input\\\", JOptionPane.PLAIN_MESSAGE, null, null, null);\\n }\\n\\n // objeto printwriter con el nombre del archivo\\n PrintWriter codigoObj = new PrintWriter(strNomArchivo);\\n\\n // Agrega uno por uno los cuadruplos al archivo\\n for (int i=0; i < cuadruplos.size(); i++) {\\n codigoObj.println( Cuadruplo.returnCuadruplo( (Cuadruplo)cuadruplos.get(i) ) );\\n }\\n\\n // cierra el archivo\\n codigoObj.close();\\n\\n } catch(FileNotFoundException e) {\\n System.out.println(e.getMessage());\\n }\\n }\",\n \"public void LoadTxt(File Arquivo) {\\n if (Arquivo.exists()) {\\r\\n\\r\\n try {\\r\\n\\r\\n FileReader FR = new FileReader(Arquivo);\\r\\n BufferedReader BW = new BufferedReader(new InputStreamReader(new FileInputStream(Arquivo.getAbsolutePath()), \\\"ISO-8859-1\\\"));\\r\\n\\r\\n //BufferedReader BW = new BufferedReader(FR);\\r\\n\\r\\n String dados;\\r\\n String[] paraArray = new String[3];\\r\\n String matricula;\\r\\n \\r\\n String serie = Arquivo.getName();\\r\\n int pos = serie.lastIndexOf(\\\".\\\");\\r\\n if (pos > 0) {\\r\\n serie = serie.substring(0, pos);\\r\\n }\\r\\n\\r\\n Sala novaSala = new Sala(serie); //CRIANDO SALA COM NOME DE TURMA\\r\\n salas2.add(novaSala); // ADICIONANDO SALA NA LISTA DE SALAS\\r\\n while ((dados = BW.readLine()) != null) {\\r\\n paraArray = dados.split(\\\";\\\");\\r\\n\\r\\n matricula = /*Integer.parseInt*/ (paraArray[0]);\\r\\n //senha = /*Integer.parseInt*/(paraArray[2]);\\r\\n Dados novoDado = new Dados(matricula, paraArray[1], paraArray[2]);\\r\\n\\r\\n novoDado.setSerie(serie); //ADICIONANDO TURMA AO DADO\\r\\n novaSala.getDadosalas().add(novoDado); //ADICIONANDO DADOS A LISTA DE DADOS QUE ESTA EM SALA\\r\\n\\r\\n }\\r\\n \\r\\n\\r\\n BW.close();\\r\\n FR.close();\\r\\n\\r\\n } catch (Exception e) {\\r\\n System.out.println(\\\"Erro ao carregar arquivo acima\\\");\\r\\n System.out.println(e.getMessage());\\r\\n\\r\\n }\\r\\n\\r\\n } else {\\r\\n System.out.println(\\\"Nenhum arquivo de dados encontrado\\\");\\r\\n }\\r\\n\\r\\n }\",\n \"public void escribir(String direccion,String texto) {\\n try {\\n FileWriter writer = new FileWriter(direccion);\\n PrintWriter print = new PrintWriter(writer);\\n print.print(texto);\\n writer.close();\\n } catch (IOException e) {\\n System.out.println(e.getMessage());\\n }\\n }\",\n \"private static void createFileContribuicaoUmidade() throws IOException{\\r\\n\\t\\tInteger contribuicaoDefault = 0;\\r\\n\\t\\tarqContribuicaoUmidade = new File(pathContribuicaoUmidade);\\r\\n\\t\\tif(!arqContribuicaoUmidade.exists()) {\\r\\n\\t\\t\\tarqContribuicaoUmidade.createNewFile();\\r\\n\\t\\t\\tFileWriter fw = new FileWriter(getArqContribuicaoUmidade());\\r\\n\\t\\t\\tBufferedWriter buffWrite = new BufferedWriter(fw);\\r\\n\\t\\t\\tbuffWrite.append(contribuicaoDefault.toString() + String.valueOf('\\\\n'));\\r\\n\\t\\t\\tbuffWrite.close();\\r\\n\\t\\t}else {//Se arquivo existir\\r\\n\\t\\t\\tFileReader fr = new FileReader(getArqContribuicaoUmidade());\\r\\n\\t\\t\\tBufferedReader buffRead = new BufferedReader(fr);\\r\\n\\t\\t\\tif(!buffRead.ready()) {/*Se o arquivo se encontar criado mas estiver vazio(modificado)*/\\r\\n\\t\\t\\t\\tFileWriter fw = new FileWriter(arqContribuicaoUmidade);\\r\\n\\t\\t\\t\\tBufferedWriter buffWrite = new BufferedWriter(fw);\\r\\n\\t\\t\\t\\tbuffWrite.append(contribuicaoDefault.toString() + String.valueOf('\\\\n'));/*Inicializa o arquivo com uma contribuicao Inicial*/\\r\\n\\t\\t\\t\\tbuffWrite.close();\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tbuffRead.close();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public static void processOneFileSelecction()\\n {\\n int answer = JSoundsMainWindowViewController.jfcOneFile.showOpenDialog(JSoundsMainWindowViewController.jSoundsMainWindow);\\n \\n if (answer == JFileChooser.APPROVE_OPTION)\\n {\\n File actualDirectory = JSoundsMainWindowViewController.jfcOneFile.getCurrentDirectory();\\n String directory = actualDirectory.getAbsolutePath() + \\\"/\\\" + JSoundsMainWindowViewController.jfcOneFile.getSelectedFile().getName();\\n UtilFunctions.listOneFile(JSoundsMainWindowViewController.jfcOneFile.getSelectedFile());\\n JSoundsMainWindowViewController.orderBy(true, false, false); \\n }\\n }\",\n \"public static void main(String[] args) {\\n\\r\\n String cFields = \\\"NIC,SIMBOLO_VARIABLE,FECHA_VENCIMIENTO,FECHA_PAGO_OPORTUNO,FECHA_EMISION,NUMERO_FACTURA,INDICATIVO_SUMINISTRO,CIIU,TIPO_COBRO,SECUENCIAL_RECIBO,NIS,TIPO_SERVICIO,ORDEN_LECTURA,MEDIDOR,LECT_ANTERIOR,LECT_ACTUAL,FECHA_LECTURA_ACTUAL,CONSUMO_FACTURADO,VALOR_FACTURA,GRUPO_FAMILIAR,PRECIO_UNITARIO_CU,IND_VISUSALIZACION_BARCODI,IMPORTE_TOTAL_DEUDA,CANTIDAD_FACTURAS_ADEUDADAS,DESC_ANOMALIA_LECTURA,IMPORTE_TOTAL_FACTURA,SUBTOTAL_FACTURA,DESCRIPCION_TARIFA,CONSUMO_PROMEDIO,DIAS_FACTURADOS,CLAVE_ORDEN_FACTURA,PROPIEDAD_EQUIPO_MEDIDA,UNICOM,RUTA,ITINERARIO\\\";\\r\\n fields = cFields.split(\\\",\\\");\\r\\n\\r\\n readConfiguracion();\\r\\n\\r\\n if (configuracion.size() != fields.length) {\\r\\n System.out.println(\\\"Longitud de campos y configuración es diferente. Fields: \\\" + fields.length + \\\" Configuracion: \\\" + configuracion.size());\\r\\n Utilidades.AgregarLog(\\\"Longitud de campos y configuración es diferente. Fields: \\\" + fields.length + \\\" Configuracion: \\\" + configuracion.size());\\r\\n return;\\r\\n }\\r\\n\\r\\n if (configuracion.size() > 0) {\\r\\n System.out.println(\\\"Campos a leer: \\\" + configuracion.size());\\r\\n Utilidades.AgregarLog(\\\"Campos a leer: \\\" + configuracion.size());\\r\\n String ruta = \\\"C:\\\\\\\\REPARTO\\\\\\\\\\\";\\r\\n File directorio = new File(ruta);\\r\\n Utilidades.AgregarLog(\\\"Descomprimiendo archivos ruta:\\\" + ruta);\\r\\n DescomprimirArchivosCarpeta(directorio);\\r\\n Utilidades.AgregarLog(\\\"Procesando archivos de reparto en ruta:\\\" + ruta);\\r\\n ProcesarDirectorio(directorio);\\r\\n\\r\\n } else {\\r\\n System.out.println(\\\"No se ha cargado la configuracion\\\");\\r\\n Utilidades.AgregarLog(\\\"No se ha cargado la configuracion\\\");\\r\\n }\\r\\n\\r\\n }\",\n \"public void loadFile() {\\n\\t\\t\\n\\t\\tString fileloc = \\\"\\\";\\n\\t\\tif(!prf.foldername.getText().equals(\\\"\\\"))\\n\\t\\t\\tfileloc += prf.foldername.getText()+\\\"/\\\";\\n\\t\\t\\n\\t\\tString filename = JOptionPane.showInputDialog(null,\\\"Enter the filename.\\\");\\n\\t\\tfileloc += filename;\\n\\t\\tFile fl = new File(fileloc);\\n\\t\\t\\n\\t\\tif(!fl.exists()) {\\n\\t\\t\\tJOptionPane.showMessageDialog(null, \\\"The specified file doesnt exist at the given location.\\\");\\n\\t\\t} else {\\n\\t\\t\\tMinLFile nminl = new MinLFile(filename);\\n\\t\\t\\t\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tFileReader flrd = new FileReader(fileloc);\\n\\t\\t\\t\\tBufferedReader bufread = new BufferedReader(flrd);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tnminl.CodeArea.setText(\\\"\\\");\\n\\t\\t\\t\\n\\t\\t\\t\\tString str;\\n\\t\\t\\t\\twhile((str = bufread.readLine()) != null) {\\n\\t\\t\\t\\t\\tDocument doc = nminl.CodeArea.getDocument();\\n\\t\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\tdoc.insertString(doc.getLength(), str, null);\\n\\t\\t\\t\\t\\t} catch (BadLocationException e) {\\n\\t\\t\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tbufread.close();\\n\\t\\t\\t\\tflrd.close();\\n\\t\\t\\t\\n\\t\\t\\t} catch (IOException e) {\\n\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t}\\t\\t\\n\\t\\t\\t\\n\\t\\t\\tJComponent panel = nminl;\\n\\t\\t\\t\\n\\t\\t\\ttabbedPane.addTab(filename, null, panel,\\n\\t\\t\\t\\t\\tfilename);\\t\\t\\n\\t\\t\\ttabbedPane.setMnemonicAt(0, 0);\\n\\t\\t}\\t\\n\\t}\",\n \"public static String cargarPreguntas(String fileName){\\n String line = null; \\n try {\\n //Para lectura del archivo\\n FileReader fileReader =\\n new FileReader(fileName); \\n \\n //BufferedReader para optimización de recursos\\n BufferedReader bufferedReader =\\n new BufferedReader(fileReader);\\n \\n// Lee línea por línea, verifica que tengan algo de texto\\n while(((line = bufferedReader.readLine()) != null)) {\\n if ((line.length() > 0) && !(line.startsWith(\\\"//\\\"))){\\n// Para ignorar las líneas de comentario en el archivo de texto\\n //if (!(line.startsWith(\\\"//\\\"))){\\n// Crea una lista de Strings para cada línea a evaluar\\n List<String> listaLinea = new ArrayList<>(Arrays.asList(line.split(\\\";\\\")));\\n// Impresión de prueba del ArrayList(descomentar)\\n// System.out.println(listaLinea);\\n \\n //Obtiene lista de Respuestas, en tipo String\\n List <String >resp = listaLinea.subList(1,listaLinea.size());\\n //Creación de Respuestas (bajo el debido constructor) en un HashSet\\n HashSet<Respuesta> respuestas = new HashSet(); \\n for (int i = 0; i < resp.size();i++){\\n if (i == 0){\\n //Identifica la respuesta correcta\\n respuestas.add(new Respuesta(resp.get(i), true));\\n }\\n else{\\n //Identifica las respuestas incorrectas\\n respuestas.add(new Respuesta(resp.get(i), false));\\n } \\n }\\n //System.out.println(resp); Impresión de prueba (descomentar)\\n \\n //Agrega Preguntas y Respuestas a nuestro HashSet y HashMap\\n Almacenamiento.getPreguntas().add(new Pregunta(listaLinea.get(0)));\\n Almacenamiento.getMapaPR().put(new Pregunta(listaLinea.get(0)), respuestas); \\n //}\\n }\\n }\\n //Impresiones de prueba, descomentar.\\n// for(Pregunta p: Almacenamiento.getPreguntas()){\\n// System.out.println(p.toString()); \\n// } \\n// Almacenamiento.getMapaPR().forEach((k,v)-> System.out.println(k+\\\", \\\"+v));\\n \\n // Siempre cerrar archivo, para optimizar recursos\\n bufferedReader.close(); \\n }\\n //Detalle de exception impreso en consola\\n catch(FileNotFoundException ex) {\\n System.out.println(\\n \\\"No se pudo abrir archivo '\\\" +\\n fileName + \\\"'\\\"); \\n }\\n //Detalle de exception impreso en consola\\n catch(IOException ex) {\\n System.out.println(\\n \\\"Error leyendo archivo '\\\"\\n + fileName + \\\"'\\\"); \\n }\\n return null;\\n }\",\n \"private void chooseRemaindersFile() {\\n JFileChooser setEF = new JFileChooser(System.getProperty(\\\"user.home\\\"));\\n setEF.setDialogType(JFileChooser.OPEN_DIALOG);\\n setEF.showDialog(this, \\\"Выбрать файл\\\");\\n remainderFile = setEF.getSelectedFile();\\n putLog(\\\"Файл остатков: \\\" + remainderFile.getPath());\\n jbParse.setEnabled(workingDirectory != null && remainderFile != null);\\n }\",\n \"public ArrayList<String> Info_Disco_Pel_Rep4(String genero) {\\r\\n String line;\\r\\n ArrayList<String> Lista_datos_nombre_genero = new ArrayList();\\r\\n try (BufferedReader br = new BufferedReader(new FileReader(\\\"src/Archivos/cat_peliculas.txt\\\"))) {\\r\\n while ((line = br.readLine()) != null) {\\r\\n String[] info_disco = line.split(\\\";\\\");\\r\\n if (info_disco[2].equals(genero)) {\\r\\n Lista_datos_nombre_genero.add(info_disco[0]);\\r\\n }\\r\\n }\\r\\n } catch (IOException ex) {\\r\\n System.out.println(ex);\\r\\n }\\r\\n return Lista_datos_nombre_genero;\\r\\n }\",\n \"public static void crearPartida() throws FileNotFoundException, IOException, ExcepcionesFich {\\n\\t\\tLecturaFicheros.AllLecture(\\\"C:\\\\\\\\Users\\\\\\\\Erick\\\\\\\\pruebaPOO.txt\\\");\\n\\t\\tinterfaz = new GUI(0);\\t\\t\\n\\t}\",\n \"public String afficherInfoFichierTexte(){\\n\\t\\tString fichierComplet = \\\"\\\";\\n\\t\\tfor (Joueur j: ListJoueur) {\\n\\t\\t\\tfichierComplet += j.afficherFichierTexte();\\n\\t\\t}\\n\\t\\treturn fichierComplet;\\n\\t}\",\n \"public ArrayList<String> Info_Disc_Mus_Compras(String genero) {\\r\\n ArrayList<String> Lista_nombre = Info_Disco_Mus_Rep1(genero);\\r\\n ArrayList<String> Lista_datos_compras = new ArrayList();\\r\\n String line;\\r\\n try (BufferedReader br = new BufferedReader(new FileReader(\\\"src/Archivos/Compra_Musica.txt\\\"))) {\\r\\n while ((line = br.readLine()) != null) {\\r\\n String[] info_disco_compra = line.split(\\\";\\\");\\r\\n for (int s = 0; s < Lista_nombre.size(); s++) {\\r\\n if (Lista_nombre.get(s).equals(info_disco_compra[3])) {\\r\\n Lista_datos_compras.add(info_disco_compra[3]);\\r\\n Lista_datos_compras.add(info_disco_compra[5]);\\r\\n }\\r\\n }\\r\\n }\\r\\n } catch (IOException ex) {\\r\\n System.out.println(ex);\\r\\n }\\r\\n return Lista_datos_compras;\\r\\n }\",\n \"public ArrayList<String> Info_Disco_Pel_Rep1(String genero) {\\r\\n String line;\\r\\n ArrayList<String> Lista_datos_nombre_genero = new ArrayList();\\r\\n try (BufferedReader br = new BufferedReader(new FileReader(\\\"src/Archivos/cat_peliculas.txt\\\"))) {\\r\\n while ((line = br.readLine()) != null) {\\r\\n String[] info_disco = line.split(\\\";\\\");\\r\\n if (info_disco[2].equals(genero)) {\\r\\n Lista_datos_nombre_genero.add(info_disco[0]);\\r\\n }\\r\\n }\\r\\n } catch (IOException ex) {\\r\\n System.out.println(ex);\\r\\n }\\r\\n return Lista_datos_nombre_genero;\\r\\n }\",\n \"public static void RT() {//metodo para leer la informacion del txt , presente en todas las clases que se guardan en un txt\\n\\t\\treadTxt(\\\"usuarios.txt\\\", usersList);\\n\\t}\",\n \"public void lecture() throws FileNotFoundException, IOException {\\n \\n //ouverture du fichier en lecture\\n InputStream is = this.getClass().getClassLoader().getResourceAsStream(adresseFichier);\\n InputStreamReader ir = new InputStreamReader(is);\\n BufferedReader fichier = new BufferedReader(ir);\\n \\n //Lecture ligne à ligne\\n String ligne;\\n int numLigne = 0;\\n while((ligne = fichier.readLine()) != null){\\n //parsage de la ligne\\n this.parseLigne(numLigne, ligne);\\n numLigne++;\\n }\\n }\",\n \"private void readSavedFile() {\\n\\n String[] files = new String[0];\\n \\n // On récupère la liste des fichiers\\n File file = new File(folderName);\\n\\n // check if the specified pathname is directory first\\n if(file.isDirectory()){\\n //list all files on directory\\n files = file.list();\\n }\\n\\n if (files != null) {\\n for(String currentFile : files) {\\n Vehicule voiture;\\n try {\\n FileInputStream fileIn = new FileInputStream(folderName + \\\"/\\\" + currentFile);\\n ObjectInputStream in = new ObjectInputStream(fileIn);\\n voiture = (Vehicule) in.readObject();\\n addVoitureToList(voiture);\\n in.close();\\n fileIn.close();\\n } catch (IOException i) {\\n i.printStackTrace();\\n return;\\n } catch (ClassNotFoundException c) {\\n System.out.println(\\\"#Erreur : Impossible de récupérer l'objet \\\" + currentFile);\\n c.printStackTrace();\\n return;\\n }\\n }\\n }\\n }\",\n \"public static void main(String[] args) throws IOException {\\n File archivo = new File(\\\"/Users/Germayn/Documents/NetBeansProjects/busquedalineal/archivoprueba.txt\\\");\\r\\n \\r\\n Scanner teclado = new Scanner(System.in);\\r\\n \\r\\n System.out.println(\\\"palabra a buscar\\\");\\r\\n String palabra = teclado.nextLine();\\r\\n System.out.println(\\\"\\\");\\r\\n \\r\\n buscarpalabra(archivo,palabra);\\r\\n \\r\\n }\",\n \"private void viewAllInfo(){\\r\\n try{\\r\\n Scanner scanner = new Scanner(file);\\r\\n String info;\\r\\n\\r\\n while (scanner.hasNext()){\\r\\n String line = scanner.nextLine();\\r\\n String[] components = line.split(separator);\\r\\n info = \\\" Name: \\\" + components[0] + \\\"\\\\n\\\";\\r\\n info += \\\" Phone No.: \\\"+components[1]+\\\"\\\\n\\\";\\r\\n info += \\\" Email: \\\"+components[2]+\\\"\\\\n\\\";\\r\\n info += \\\" Address: \\\"+components[3]+\\\"\\\\n\\\";\\r\\n textAreaFromAllInfo.append(info+\\\"\\\\n\\\");\\r\\n }\\r\\n\\r\\n }catch (IOException e){\\r\\n fileError();\\r\\n }\\r\\n }\",\n \"void citire(FileReader f);\",\n \"public void fillFilenames() {\\r\\n if (this.pl_LastFiles.getParam(\\\"nodelist-file\\\") != null\\r\\n && this.pl_LastFiles.getParam(\\\"edgelist-file\\\") != null) {\\r\\n this.nodefileText.setText(this.pl_LastFiles.getParam(\\\"nodelist-file\\\"));\\r\\n this.edgeFileText.setText(this.pl_LastFiles.getParam(\\\"edgelist-file\\\"));\\r\\n } else {\\r\\n this.nodefileText.setText(\\\"examples\\\" + System.getProperty(\\\"file.separator\\\") + \\\"20nodes.txt\\\");\\r\\n this.edgeFileText.setText(\\\"examples\\\" + System.getProperty(\\\"file.separator\\\") + \\\"20edges.txt\\\");\\r\\n }\\r\\n }\",\n \"public n501070324_PedidosAssistencia() {\\n super(\\\"Pedidos.txt\\\");\\n }\",\n \"private void winOpen() {\\n try {\\n content = Files.readAllLines(Paths.get(FILE_PATH_INDEX_TXT), Charset.forName(\\\"cp1251\\\"));\\n String[] Str = content.get(0).split(\\\";\\\");\\n mapIndexes = new HashMap();\\n int i = 0;\\n for (String string : Str) {\\n mapIndexes.put(string, ++i);\\n }\\n setLocation(main.getLocation().x + main.getWidth(), main.getLocation().y + this.getHeight() - 10);\\n } catch (IOException ex) {\\n JOptionPane.showOptionDialog(this, \\\"Ошибка\\\", \\\"Не найден индексный файл!\\\", JOptionPane.DEFAULT_OPTION,\\n JOptionPane.ERROR_MESSAGE, null, null, null);\\n }\\n\\n }\",\n \"public void Horas() {\\r\\n File archivo = null;\\r\\n FileReader fr = null;\\r\\n BufferedReader br = null;\\r\\n \\r\\n try {\\r\\n // Apertura del fichero y creacion de BufferedReader para poder\\r\\n // hacer una lectura comoda (disponer del metodo readLine()).\\r\\n \\r\\n \\r\\n // Lectura del fichero\\r\\n String linea;\\r\\n \\r\\n for (a=0;a<5;a++){\\r\\n if (a==0){\\r\\n categoria=\\\"Embarazadas\\\";\\r\\n }\\r\\n if (a==1){\\r\\n categoria=\\\"Regulares\\\";\\r\\n }\\r\\n if (a==2){\\r\\n categoria=\\\"Discapacitados\\\";\\r\\n }\\r\\n if (a==3){\\r\\n categoria=\\\"Mayores\\\";\\r\\n }\\r\\n if (a==4){\\r\\n categoria=\\\"Corporativos\\\";\\r\\n }\\r\\n archivo = new File (System.getProperty(\\\"user.dir\\\")+\\\"/Clientes/\\\"+categoria+\\\".txt\\\");\\r\\n fr = new FileReader (archivo);\\r\\n br = new BufferedReader(fr);\\r\\n while((linea=br.readLine())!=null)\\r\\n if (leerHora == contador){\\r\\n comparar = linea.substring(0,2);\\r\\n \\r\\n if (\\\"09\\\".equals(comparar)){\\r\\n nueve++;\\r\\n }\\r\\n if (\\\"10\\\".equals(comparar)){\\r\\n diez++;\\r\\n }\\r\\n if (\\\"11\\\".equals(comparar)){\\r\\n once++;\\r\\n }\\r\\n if (\\\"13\\\".equals(comparar)){\\r\\n una++;\\r\\n }\\r\\n if (\\\"14\\\".equals(comparar)){\\r\\n dos++;\\r\\n }\\r\\n if (\\\"15\\\".equals(comparar)){\\r\\n tres++;\\r\\n }\\r\\n if (\\\"16\\\".equals(comparar)){\\r\\n cuatro++;\\r\\n }\\r\\n \\r\\n contador +=1;\\r\\n leerHora += 6;\\r\\n }\\r\\n else{\\r\\n contador += 1;\\r\\n }\\r\\n }\\r\\n }\\r\\n catch(Exception e){\\r\\n e.printStackTrace();\\r\\n }finally{\\r\\n // En el finally cerramos el fichero, para asegurarnos\\r\\n // que se cierra tanto si todo va bien como si salta \\r\\n // una excepcion.\\r\\n try{ \\r\\n if( null != fr ){ \\r\\n fr.close(); \\r\\n } \\r\\n }catch (Exception e2){ \\r\\n e2.printStackTrace();\\r\\n }\\r\\n }\\r\\n }\",\n \"private void lesFil()\\n\\t{\\n\\t\\tDATAFIL = datafil(false);\\n\\n\\t\\ttry ( ObjectInputStream innfil = new ObjectInputStream( new FileInputStream( DATAFIL ) ) )\\n\\t\\t{\\n\\t\\t\\tbr = (Boligregister) innfil.readObject();\\n\\t\\t\\tvisMelding( \\\"Data er hentet fra fil.\\\" );\\n\\t\\t}\\n\\t\\tcatch(ClassNotFoundException cnfe)\\n\\t\\t{\\n\\t\\t\\tvisMelding( \\\"<html>Feil:<br><br>\\\" + cnfe.getMessage() + \\\"<br><br>Oppretter tom datafil. Tar vare på gammel datafil.</html>\\\" );\\n\\t\\t\\ttomtRegister();\\n\\t\\t\\tDATAFIL = datafil(true);\\n\\t\\t\\tskrivTilFil(false);\\n\\t\\t}\\n\\t\\tcatch(FileNotFoundException fne)\\n\\t\\t{\\n\\t\\t\\tvisMelding( \\\"Ingen datafil funnet. Oppretter tom datafil.\\\" );\\n\\t\\t\\ttomtRegister();\\n\\t\\t\\tskrivTilFil(false);\\n\\t\\t}\\n\\t\\tcatch(IOException ioe)\\n\\t\\t{\\n\\t\\t\\tvisMelding( \\\"<html>Innlesingsfeil. Oppretter tom datafil. Tar vare på gammel datafil.</html>\\\" );\\n\\t\\t\\ttomtRegister();\\n\\t\\t\\tDATAFIL = datafil(true);\\n\\t\\t\\tskrivTilFil(false);\\n\\t\\t}\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tFileUTL fUtl = new FileUTL();\\n\\t\\tString fileAddres = \\\"C:\\\\\\\\Users\\\\\\\\lenovo\\\\\\\\Desktop\\\\\\\\医嘱和对应路径信息\\\\\\\\\\\";\\n\\t\\tString filename = fileAddres+\\\"12个病人的医嘱信息-utf8.csv\\\";\\n\\t\\tString splitSign = \\\",\\\";\\n\\t\\tString dateSign = \\\"/\\\";\\n\\t\\tfUtl.readFile(filename, splitSign, dateSign);\\n\\t}\",\n \"public ExcluirFilme() {\\n initComponents();\\n setTitle(\\\"LocVideo\\\");\\n AtualizarCombo();\\n }\",\n \"public static void main(String[] args) {\\n\\t\\t\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tFile f = new File(\\\"MonFichier.txt\\\");\\r\\n\\t\\t\\tFileReader fr = new FileReader(f);\\r\\n\\t\\t\\t//flot de communication pour les caractères,\\r\\n\\t\\t\\t//qui se connecte à un fichier\\r\\n\\t\\t\\tBufferedReader br = new BufferedReader(fr);\\r\\n\\t\\t\\t//flot de traitement pour les caractères (buffer)\\r\\n\\t\\t\\t//ce flot est chaîné au FileReader\\r\\n\\t\\t\\tString ligne = null; // contiendra chaque ligne\\r\\n\\t\\t\\twhile ((ligne = br.readLine()) != null) {\\r\\n\\t\\t\\t\\tSystem.out.println(ligne);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tbr.close();\\r\\n\\t\\t} catch (FileNotFoundException e) {\\r\\n\\t\\t\\t// TODO Auto-generated catch block\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t} catch (IOException e) {\\r\\n\\t\\t\\t// TODO Auto-generated catch block\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\r\\n\\t}\",\n \"@Override\\n public void actionPerformed(ActionEvent e) {\\n int returnVal = fc.showOpenDialog(panel);\\n if(returnVal == JFileChooser.APPROVE_OPTION){\\n file = fc.getSelectedFile();\\n System.out.println(file);\\n \\n try {\\n Scanner scanner = new Scanner(file);\\n String appendString = \\\"\\\";\\n \\n while(scanner.hasNext()){\\n String oneString = scanner.nextLine();\\n txtArea.append(oneString + \\\"\\\\n\\\");\\n }\\n \\n try {\\n read_characters(file.toString());\\n } catch (IOException e1) {\\n // TODO Auto-generated catch block\\n e1.printStackTrace();\\n }\\n \\n resultArea.append(resultString);\\n resultPane.setText(resultString);\\n } catch (FileNotFoundException e1) {\\n // TODO Auto-generated catch block\\n e1.printStackTrace();\\n }\\n \\n //Print ID table\\n Map<String,Integer> map = new TreeMap<String,Integer>(userDefinedWords);\\n identifierTableArea.append(\\\"Number of Occurences \\\" + \\\"\\\\t\\\" +\\n \\t\\t\\t\\t\\t\\t\\t\\\"Symbol\\\" + \\\"\\\\n\\\\n\\\");\\n Iterator iter = \\n \\t\\tmap.entrySet().iterator();\\n while(iter.hasNext()){\\n \\t Map.Entry pair = \\n \\t\\t\\t (Map.Entry)iter.next();\\n \\t identifierTableArea.append(\\n \\t\\t\\t pair.getValue() + \\\"\\\\t\\\\t\\\" + pair.getKey() + \\\"\\\\n\\\");\\n }\\n \\n }\\n }\",\n \"public ArrayList<String> Info_Disc_Pel_Compras(String genero) {\\r\\n ArrayList<String> Lista_nombre = Info_Disco_Pel_Rep4(genero);\\r\\n ArrayList<String> Lista_datos_compras = new ArrayList();\\r\\n String line;\\r\\n try (BufferedReader br = new BufferedReader(new FileReader(\\\"src/Archivos/Compra_Peliculas.txt\\\"))) {\\r\\n while ((line = br.readLine()) != null) {\\r\\n String[] info_disco_compra = line.split(\\\";\\\");\\r\\n for (int s = 0; s < Lista_nombre.size(); s++) {\\r\\n if (Lista_nombre.get(s).equals(info_disco_compra[3])) {\\r\\n Lista_datos_compras.add(info_disco_compra[3]);\\r\\n Lista_datos_compras.add(info_disco_compra[5]);\\r\\n }\\r\\n }\\r\\n }\\r\\n } catch (IOException ex) {\\r\\n System.out.println(ex);\\r\\n }\\r\\n return Lista_datos_compras;\\r\\n }\",\n \"static void LeerArchivo(){ \\r\\n \\t//iniciamos el try y si no funciona se hace el catch\\r\\n\\r\\n try{ \\r\\n \\t//se crea un objeto br con el archivo de txt\\r\\n \\tBufferedReader br = new BufferedReader( \\r\\n \\tnew FileReader(\\\"reporte.txt\\\")\\r\\n );\\r\\n String s;\\r\\n //Mientras haya una linea de texto se imprime\\r\\n while((s = br.readLine()) != null){ \\r\\n System.out.println(s);\\r\\n }\\r\\n //se cierra el archivo de texto\\r\\n br.close(); \\r\\n } catch(Exception ex){\\r\\n \\t//si no funciona se imprime el error\\r\\n System.out.println(ex); \\r\\n }\\r\\n }\",\n \"void selectFile(){\\n JLabel lblFileName = new JLabel();\\n fc.setCurrentDirectory(new java.io.File(\\\"saved\\\" + File.separator));\\n fc.setDialogTitle(\\\"FILE CHOOSER\\\");\\n FileNameExtensionFilter xmlfilter = new FileNameExtensionFilter(\\n \\\"json files (*.json)\\\", \\\"json\\\");\\n fc.setFileFilter(xmlfilter);\\n int response = fc.showOpenDialog(this);\\n if (response == JFileChooser.APPROVE_OPTION) {\\n lblFileName.setText(fc.getSelectedFile().toString());\\n }else {\\n lblFileName.setText(\\\"the file operation was cancelled\\\");\\n }\\n System.out.println(fc.getSelectedFile().getAbsolutePath());\\n }\",\n \"public static void main(String[] args) {\\n File myFile= new File(\\\"D:/yeah.txt\\\");\\n System.out.println(\\\"Iiim file bnuu? \\\"+myFile.exists());\\n\\t System.out.println(\\\"Zaagdsan zam deeree bnuu?\\\"+myFile.isFile());\\t \\n\\t System.out.println(\\\"Ug file iin ner \\\"+myFile.getName());\\n\\t System.out.println(\\\"Ug file iin zam \\\"+myFile.getPath());\\n\\t}\",\n \"@Override\\r\\n\\t\\t\\tpublic void actionPerformed(ActionEvent arg0) {\\n\\t\\t\\t\\tJFileChooser chooser = new JFileChooser();\\r\\n\\t\\t\\t\\tFileNameExtensionFilter filter = new FileNameExtensionFilter(\\r\\n\\t\\t\\t\\t\\t\\t\\\"Excel Files\\\", // 파일 이름에 창에 출력될 문자열\\r\\n\\t\\t\\t\\t\\t\\t\\\"xls\\\"); // 파일 필터로 사용되는 확장자. *.xml 만 나열됨\\r\\n\\t\\t\\t\\tchooser.setFileFilter(filter); // 파일 다이얼로그에 파일 필터 설정\\r\\n\\t\\t\\t\\tchooser.setMultiSelectionEnabled(false);//다중 선택 불가\\r\\n\\r\\n\\t\\t\\t\\t// 파일 다이얼로그 출력\\r\\n\\t\\t\\t\\tint ret = chooser.showOpenDialog(null);\\r\\n\\t\\t\\t\\tif (ret != JFileChooser.APPROVE_OPTION) { // 사용자가 창을 강제로 닫았거나 취소\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// 버튼을 누른 경우\\r\\n\\t\\t\\t\\t\\tJOptionPane.showMessageDialog(null, \\\"파일을 선택하지 않았습니다\\\", \\\"경고\\\",\\r\\n\\t\\t\\t\\t\\t\\t\\tJOptionPane.WARNING_MESSAGE);\\r\\n\\t\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t// 사용자가 파일을 선택하고 \\\"열기\\\" 버튼을 누른 경우\\r\\n\\t\\t\\t\\tString readFilePath = chooser.getSelectedFile().getPath(); // 파일 경로명을 알아온다.\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tShowPatientInfo_K showPatientInfo = new ShowPatientInfo_K(readFilePath);\\r\\n\\t\\t\\t}\",\n \"private static void recorrerFicheros(File[] ficheros, int indice,\\n\\t\\t\\tString texto) {\\n\\t\\tif (indice <= ficheros.length - 1) {\\n\\t\\t\\tif (practica6.Prueba1.\\n\\t\\t\\t\\t\\tesFicheroGrafico(ficheros[indice])) {\\n\\t\\t\\t\\tImageIcon img = new ImageIcon(ficheros[indice].\\n\\t\\t\\t\\t\\t\\tgetPath().toLowerCase());\\n\\t\\t\\t\\t// comprueba si tiene alguna coincidencia\\n\\t\\t\\t\\tif (ficheros[indice].getName().\\n\\t\\t\\t\\t\\t\\tindexOf(texto) != -1) {\\n\\t\\t\\t\\t\\tSystem.out.printf(\\\"%s%n\\\", ficheros[indice].\\n\\t\\t\\t\\t\\t\\t\\tgetPath());\\n\\t\\t\\t\\t\\t// lo agrega al vector\\n\\t\\t\\t\\t\\tv.add(img);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tindice++;\\n\\t\\t\\t\\trecorrerFicheros(ficheros, indice, texto);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tindice++;\\n\\t\\t\\t\\trecorrerFicheros(ficheros, indice, texto);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public void readFromFile(String doc) {\\n\\t\\tString newline = \\\"\\\\n\\\";\\n\\t\\tString doc_text = \\\"\\\";\\n\\t\\tint count = 0;\\n\\t\\tString line=\\\"\\\";\\n\\t\\t\\n\\t\\t//for random button\\n\\t\\tint buttoncount = 0;\\n\\t\\tArrayList<JButton> list = new ArrayList<JButton>();\\n\\t\\t\\n\\t\\ttry{\\n\\t\\t\\t//input stream for reading special characters in German\\t\\n\\t\\t\\t//documents from folder textfiles\\n \\tBufferedReader rd = new BufferedReader(new InputStreamReader(new FileInputStream(\\\"textfiles/\\\" + doc),StandardCharsets.UTF_8));\\n \\twhile ((line=rd.readLine()) != null) {\\n \\t\\t//question text\\n \\t\\tif (count == 0) {\\n \\t\\t\\t\\n \\t\\t\\tswitch(bg) {\\n \\t\\t\\t\\tcase(1):\\n \\t\\t\\t\\tdoc_text = \\\"Dein Charakter lässt sich durch 4 Merkmale beschreiben.\\\\r\\\\n\\\" + \\n \\t\\t\\t\\t\\t\\t\\\"Wähle als 1. dein Persönlichkeitsmerkmal:\\\" + newline;\\n \\t\\t\\t\\t\\tcount++;\\n \\t\\t\\t\\tbreak;\\n \\t\\t\\tcase(2):\\n \\t\\t\\t\\tdoc_text = \\\"Wähle das 2. Merkmal ein Ideal:\\\" + newline;\\n \\t\\t\\t\\tcount++;\\n \\t\\t\\t\\tbreak;\\n \\t\\t\\tcase(3):\\n \\t\\t\\t\\tdoc_text = \\\"Entscheide dich als nächstes für eine Bindung:\\\"+ newline;\\n \\t\\t\\t\\tcount++;\\n \\t\\t\\t\\tbreak;\\n \\t\\t\\tcase(4):\\n \\t\\t\\t\\tdoc_text = \\\"Deine letzte Frage. Im Anschluss wird dein Charakter generiert.\\\\r\\\\n\\\" + \\n \\t\\t\\t\\t\\t\\t\\\"Wähle ein Makel der dich beschreibt:\\\"+ newline;\\n \\t\\t\\t\\tcount++;\\n \\t\\t\\t\\tbreak;\\n \\t\\t\\tdefault:\\n \\t\\t\\t\\tdoc_text = doc_text + line + newline;\\n \\t\\t\\t\\tbreak;\\n \\t\\t\\t}\\n \\t\\t\\ttxt.setText(doc_text);\\n \\t\\t\\tif(randomButton == true) {\\n\\t\\t \\t\\ttxt.setVisible(false);\\n \\t\\t\\t\\t}\\n \\t\\t\\tpanelA.add(txt);\\n \\t\\t}\\n \\t\\t\\n \\t\\t//buttonname;next document(;information)\\n \\t\\tif (count == 1) {\\n \\t\\t\\tString[] tokens = line.split(\\\";\\\");\\n \\t\\t\\tJButton button = new JButton (tokens[0]);\\n \\t\\t\\t\\tbutton.setFont(new Font(\\\"Rockwell\\\", Font.PLAIN, 24));\\n \\t\\t\\t//for random button: add buttons to a list and count them\\n \\t\\t\\tlist.add(button);\\n \\t\\t\\tbuttoncount++;\\n \\t\\t\\t\\tif(randomButton == true) {\\n \\t\\t\\t\\t\\tbutton.setVisible(false);\\n \\t\\t\\t\\t}\\n \\t\\t\\t\\t\\n \\t\\t\\t\\tpanelB.add(button);\\n\\t\\t\\t\\t\\tbutton.addActionListener( new ActionListener() {\\n\\t\\t\\t\\t\\t\\tpublic void actionPerformed(ActionEvent ae) {\\n\\t\\t\\t\\t\\t\\t\\tif(ae.getSource() == button) {\\n\\t\\t\\t\\t\\t\\t\\t\\tif (tokens.length == 1) {\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tclearPanel();\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t//if race is already set but class not yet, than read question for class\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif(baseRace == true && baseClass == false) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tspecific_race = tokens[0];\\n \\t\\t\\t\\t\\t\\t\\t\\t\\treadFromFile(\\\"/question_class/question_class_\\\" + attribute + \\\".txt\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t//if race and class is already set -> open question for background\\n\\t\\t\\t\\t\\t\\t\\t\\t\\telse if(baseRace == true && baseClass == true) {\\n\\t\\t\\t \\t\\t\\t\\t\\tspecific_class = tokens[0];\\n \\t\\t\\t\\t\\t\\t\\t\\t\\treadFromFile(\\\"question_backgrounds\\\" + \\\".txt\\\");\\n\\t\\t\\t \\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\tif (tokens.length > 1) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t//Buttonname/tokens[0];[tokens[1];tokens[2] \\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (tokens.length>2) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (baseRace == false && baseClass == false) {\\n\\t\\t\\t \\t\\t\\t\\t\\t\\tbase_race.setRace(tokens[2]);\\n\\t\\t\\t \\t\\t\\t\\t\\t\\tbaseRace = true;\\n\\t\\t\\t \\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse if (baseRace == true && baseClass == false) {\\n\\t\\t\\t \\t\\t\\t\\t\\t\\tbase_class.setClass(tokens[2]);\\n\\t\\t\\t \\t\\t\\t\\t\\t\\tbaseClass = true;\\n\\n\\t\\t\\t \\t\\t\\t\\t\\t} \\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t//random button\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (tokens[0].equals(\\\"Zufallscharakter erstellen\\\")) {\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\trandomButton = true;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tclearPanel();\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\treadFromFile(tokens[1] + \\\".txt\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t//choose main attribute for race and class\\n\\t\\t\\t\\t\\t\\t\\t\\t\\telse if(doc.equals(\\\"question_1.txt\\\")) {\\n\\t\\t\\t \\t\\t\\t\\t\\tString attribute_tokens [] = tokens[1].split(\\\"_\\\");\\n\\t\\t\\t \\t\\t\\t\\t\\tattribute = attribute_tokens[3];\\n\\t\\t\\t \\t\\t\\t\\t\\tclearPanel();\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\treadFromFile(tokens[1]+\\\".txt\\\");\\t\\n\\t\\t\\t \\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t//choose background personality\\n\\t\\t\\t\\t\\t\\t\\t\\t\\telse if(doc.equals(\\\"question_backgrounds.txt\\\")) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tpersonality = tokens[1];\\n\\t\\t\\t \\t \\t\\tbase_personality.setPersonality(tokens[0]);\\n\\t\\t\\t \\t \\t\\tclearPanel();\\n\\t\\t\\t \\t \\t\\tbg++;\\n\\t\\t\\t \\t \\t\\treadFromFile(\\\"question_personalities/\\\" + personality + \\\"/question_personality_\\\" + personality + \\\".txt\\\");\\n\\t\\t\\t \\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t//background\\n\\t\\t\\t\\t\\t\\t\\t\\t\\telse if (bg == 1) {\\t\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbg++;\\n\\t \\t\\t\\t\\t\\t\\t\\t\\tbase_personality.setPersonalityTrait(tokens[1]);\\n\\t \\t\\t\\t\\t\\t\\t\\t\\tclearPanel();\\n\\t \\t\\t\\t\\t\\t\\t\\t\\treadFromFile(\\\"/question_personalities/\\\" + personality + \\\"/question_ideal_\\\" + personality + \\\".txt\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\telse if (bg == 2) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbg++;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbase_personality.setIdeal(tokens[1]);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tclearPanel();\\n\\t \\t\\t \\t\\t\\t\\treadFromFile(\\\"/question_personalities/\\\" + personality + \\\"/question_bond_\\\" + personality + \\\".txt\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\telse if (bg == 3) {\\t\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbg++;\\n\\t \\t\\t\\t\\t\\t\\t\\t\\tbase_personality.setBond(tokens[1]);\\n\\t \\t\\t\\t\\t\\t\\t\\t\\tclearPanel();\\n\\t \\t\\t \\t\\t\\t\\treadFromFile(\\\"/question_personalities/\\\" + personality + \\\"/question_flaw_\\\" + personality + \\\".txt\\\");\\t \\t\\t \\t\\t\\t \\t\\t\\t\\t\\n\\t\\t\\t\\t \\t\\t\\t} \\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\t\\telse if (bg == 4) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbg = 0;\\n\\t \\t\\t\\t\\t\\t\\t\\t\\tbase_personality.setFlaw(tokens[1]);\\n\\t \\t\\t\\t\\t\\t\\t\\t\\tsetAttributes();\\n\\t \\t\\t \\t\\tshowResults();\\n\\t \\t\\t \\t\\t\\n\\t\\t\\t\\t \\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tclearPanel();\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\treadFromFile(tokens[1]+\\\".txt\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t \\t \\t\\t\\t\\t\\n \\t\\t\\t}); //actionlistener close \\n \\t\\t\\t\\n \\t\\t} //if count == 1 end\\n\\n \\t\\t//empty line\\n\\t\\t if (line.length() == 0) {\\n\\t\\t \\tcount++;\\n\\t\\t \\ttxt.setText(doc_text);\\n\\t\\t \\tif(randomButton == true) {\\n\\t\\t \\t\\ttxt.setVisible(false);\\n \\t\\t\\t\\t}\\n\\t\\t \\tpanelA.add(txt);\\n\\t\\t }\\n\\t\\t \\n \\t} // while end\\n \\t\\n\\t\\t\\t\\n \\trd.close();\\n \\t\\n } //try\\n\\t\\tcatch(Exception e){\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\tsetFrameContent();\\n\\t\\tif(randomButton == true) {\\n\\t\\t\\trandomInt = rdm.nextInt(buttoncount);\\t\\n\\t\\t\\tlist.get(randomInt).doClick();\\n\\t\\t}\\n\\t}\",\n \"public ArrayList<String> Info_Disco_Mus_Rep1(String genero) {\\r\\n String line;\\r\\n ArrayList<String> Lista_datos_nombre_genero = new ArrayList();\\r\\n try (BufferedReader br = new BufferedReader(new FileReader(\\\"src/Archivos/cat_musica.txt\\\"))) {\\r\\n while ((line = br.readLine()) != null) {\\r\\n String[] info_disco = line.split(\\\";\\\");\\r\\n if (info_disco[2].equals(genero)) {\\r\\n Lista_datos_nombre_genero.add(info_disco[0]);\\r\\n }\\r\\n }\\r\\n } catch (IOException ex) {\\r\\n System.out.println(ex);\\r\\n }\\r\\n return Lista_datos_nombre_genero;\\r\\n }\",\n \"private void btnAgregarActionPerformed(java.awt.event.ActionEvent evt) {//GEN-FIRST:event_btnAgregarActionPerformed\\n \\n camino=null;\\n \\n int status = fileChooser.showOpenDialog (null);\\n if (status == JFileChooser.APPROVE_OPTION){\\n File selectedFile = fileChooser.getSelectedFile();\\n camino = selectedFile.getAbsolutePath();\\n }\\n else{ \\n if (status == JFileChooser.CANCEL_OPTION){\\n System.out.println(\\\"CANCELAR\\\");\\n }\\n \\n }\\n try {\\n cancion.agregarCancion(camino);\\n } catch (IOException ex) {\\n Logger.getLogger(biblioteca.class.getName()).log(Level.SEVERE, null, ex);\\n } catch (UnsupportedTagException ex) {\\n Logger.getLogger(biblioteca.class.getName()).log(Level.SEVERE, null, ex);\\n } catch (InvalidDataException ex) {\\n Logger.getLogger(biblioteca.class.getName()).log(Level.SEVERE, null, ex);\\n }\\n String[] test = cancion.mostrarCancion(i);\\n lista.addElement(\\\" \\\"+test[0]);\\n libCancion.setModel(lista);\\n i++;\\n }\",\n \"private void dialogEchecConversionFichier(File file, File file2){\\n\\t\\tJOptionPane.showMessageDialog(null, \\\"le fichier \\\" + file.getName() +\\\"\\\\nn'a pas été converti en \\\"+ file2.getName(), \\\"Erreur\\\", JOptionPane.ERROR_MESSAGE);\\n\\t}\",\n \"public void setFileRegExpr(String f) {\\n this.fileRegExpr = f;\\n }\",\n \"public int Tipo() {\\r\\n File archivo = null;\\r\\n FileReader fr = null;\\r\\n BufferedReader br = null;\\r\\n \\r\\n try {\\r\\n String linea;\\r\\n for (a=0;a<5;a++){\\r\\n if (a==0){\\r\\n tipo=\\\"Embarazadas\\\";\\r\\n }\\r\\n if (a==1){\\r\\n tipo=\\\"Regulares\\\";\\r\\n }\\r\\n if (a==2){\\r\\n tipo=\\\"Discapacitados\\\";\\r\\n }\\r\\n if (a==3){\\r\\n tipo=\\\"Mayores\\\";\\r\\n }\\r\\n if (a==4){\\r\\n tipo=\\\"Corporativos\\\";\\r\\n }\\r\\n archivo = new File (System.getProperty(\\\"user.dir\\\")+\\\"/Clientes/\\\"+tipo+\\\".txt\\\");\\r\\n fr = new FileReader (archivo);\\r\\n br = new BufferedReader(fr);\\r\\n while((linea=br.readLine())!=null){\\r\\n if (leerTipo == contador){\\r\\n errorTipo =String.valueOf(String.valueOf(leerTipo).length());\\r\\n if (a==0){\\r\\n resultadoembarazadas+=1;\\r\\n }\\r\\n if (a==1){\\r\\n resultadoregulares+=1;\\r\\n }\\r\\n if (a==2){\\r\\n resultadodiscapacitados+=1;\\r\\n }\\r\\n if (a==3){\\r\\n resultadomayores+=1;\\r\\n }\\r\\n if (a==4){\\r\\n resultadocorporativos+=1;\\r\\n }\\r\\n contador +=1;\\r\\n leerTipo +=6;\\r\\n\\r\\n }\\r\\n else{\\r\\n contador += 1;\\r\\n }\\r\\n }\\r\\n }\\r\\n\\r\\n }\\r\\n catch(Exception e){\\r\\n e.printStackTrace();\\r\\n }finally{\\r\\n // En el finally cerramos el fichero, para asegurarnos\\r\\n // que se cierra tanto si todo va bien como si salta \\r\\n // una excepcion.\\r\\n try{ \\r\\n if( null != fr ){ \\r\\n fr.close(); \\r\\n } \\r\\n }catch (Exception e2){ \\r\\n e2.printStackTrace();\\r\\n }\\r\\n }\\r\\n //return resultado;\\r\\n return 0;\\r\\n }\",\n \"public void Fecha() throws FileNotFoundException, IOException {\\r\\n File archivo = null;\\r\\n FileReader fr = null;\\r\\n BufferedReader br = null;\\r\\n \\r\\n try {\\r\\n // Apertura del fichero y creacion de BufferedReader para poder\\r\\n // hacer una lectura comoda (disponer del metodo readLine()).\\r\\n // Lectura del fichero\\r\\n String linea;\\r\\n \\r\\n for (b=0;b<5;b++){\\r\\n if (b==0){\\r\\n categoria=\\\"Embarazadas\\\";\\r\\n }\\r\\n if (b==1){\\r\\n categoria=\\\"Regulares\\\";\\r\\n }\\r\\n if (b==2){\\r\\n categoria=\\\"Discapacitados\\\";\\r\\n }\\r\\n if (b==3){\\r\\n categoria=\\\"Mayores\\\";\\r\\n }\\r\\n if (b==4){\\r\\n categoria=\\\"Corporativos\\\";\\r\\n }\\r\\n archivo = new File (System.getProperty(\\\"user.dir\\\")+\\\"/Clientes/\\\"+categoria+\\\".txt\\\");\\r\\n fr = new FileReader (archivo);\\r\\n br = new BufferedReader(fr);\\r\\n while((linea=br.readLine())!=null){\\r\\n if (leerFecha == contador){\\r\\n errorFecha = linea.substring(1,2);\\r\\n if (errorFecha.equals(\\\"/\\\")){\\r\\n comparar = linea.substring(0, 1);\\r\\n if (\\\"1\\\".equals(comparar)){\\r\\n d1++;\\r\\n }\\r\\n if (\\\"2\\\".equals(comparar)){\\r\\n d2++;\\r\\n }\\r\\n if (\\\"3\\\".equals(comparar)){\\r\\n d3++;\\r\\n }\\r\\n if (\\\"4\\\".equals(comparar)){\\r\\n d4++;\\r\\n }\\r\\n if (\\\"5\\\".equals(comparar)){\\r\\n d5++;\\r\\n }\\r\\n if (\\\"6\\\".equals(comparar)){\\r\\n d6++;\\r\\n }\\r\\n if (\\\"7\\\".equals(comparar)){\\r\\n d7++;\\r\\n }\\r\\n if (\\\"8\\\".equals(comparar)){\\r\\n d8++;\\r\\n }\\r\\n if (\\\"9\\\".equals(comparar)){\\r\\n d9++;\\r\\n }\\r\\n } \\r\\n else{\\r\\n comparar1=linea.substring(0, 2);\\r\\n if (\\\"10\\\".equals(comparar1)){\\r\\n d10++;\\r\\n }\\r\\n if (\\\"11\\\".equals(comparar1)){\\r\\n d11++;\\r\\n }\\r\\n if (\\\"12\\\".equals(comparar1)){\\r\\n d12++;\\r\\n }\\r\\n if (\\\"13\\\".equals(comparar1)){\\r\\n d13++;\\r\\n }\\r\\n if (\\\"14\\\".equals(comparar1)){\\r\\n d14++;\\r\\n }\\r\\n if (\\\"15\\\".equals(comparar1)){\\r\\n d15++;\\r\\n }\\r\\n if (\\\"16\\\".equals(comparar1)){\\r\\n d16++;\\r\\n }\\r\\n if (\\\"17\\\".equals(comparar1)){\\r\\n d17++;\\r\\n }\\r\\n if (\\\"18\\\".equals(comparar1)){\\r\\n d18++;\\r\\n }\\r\\n if (\\\"19\\\".equals(comparar1)){\\r\\n d19++;\\r\\n }\\r\\n if (\\\"20\\\".equals(comparar1)){\\r\\n d20++;\\r\\n }\\r\\n if (\\\"21\\\".equals(comparar1)){\\r\\n d21++;\\r\\n }\\r\\n if (\\\"22\\\".equals(comparar1)){\\r\\n d22++;\\r\\n }\\r\\n if (\\\"23\\\".equals(comparar1)){\\r\\n d23++;\\r\\n }\\r\\n if (\\\"24\\\".equals(comparar1)){\\r\\n d24++;\\r\\n }\\r\\n if (\\\"25\\\".equals(comparar1)){\\r\\n d25++;\\r\\n }\\r\\n if (\\\"26\\\".equals(comparar1)){\\r\\n d26++;\\r\\n }\\r\\n if (\\\"27\\\".equals(comparar1)){\\r\\n d27++;\\r\\n }\\r\\n if (\\\"28\\\".equals(comparar1)){\\r\\n d28++;\\r\\n }\\r\\n if (\\\"29\\\".equals(comparar1)){\\r\\n d29++;\\r\\n }\\r\\n if (\\\"30\\\".equals(comparar1)){\\r\\n d30++;\\r\\n }\\r\\n if (\\\"31\\\".equals(comparar1)){\\r\\n d31++;\\r\\n }\\r\\n \\r\\n }\\r\\n leerFecha+=6;\\r\\n contador += 1;\\r\\n }\\r\\n \\r\\n else{\\r\\n contador += 1;\\r\\n \\r\\n \\r\\n }\\r\\n } \\r\\n }\\r\\n }\\r\\n catch(Exception e){\\r\\n e.printStackTrace();\\r\\n }finally{\\r\\n // En el finally cerramos el fichero, para asegurarnos\\r\\n // que se cierra tanto si todo va bien como si salta \\r\\n // una excepcion.\\r\\n try{ \\r\\n if( null != fr ){ \\r\\n fr.close(); \\r\\n } \\r\\n }catch (Exception e2){ \\r\\n e2.printStackTrace();\\r\\n }\\r\\n }\\r\\n }\",\n \"public static void main(String[] args) throws IOException {\\n File ruta = new File(\\\"C:\\\\\\\\Users\\\\\\\\usuario\\\\\\\\Documents\\\\\\\\curso de java online sepe\\\\\\\\unidad 1 clase file\\\\\\\\ejercicios\\\");\\n // establecer el nombre del fichero a crear\\n File f = new File(ruta, \\\"datos.txt\\\");\\n File f1 = new File(ruta, \\\"datosNuevos.txt\\\");\\n // imprimir la ruta absoluta del archivo\\n System.out.println(f.getAbsolutePath());\\n // Devuelve un String conteniendo el directorio padre del File. Devuelve null si no tiene directorio padre. del archivo\\n System.out.println(f.getParent());\\n // imprimir la ruta absoluta de la ruta del archivo\\n System.out.println(ruta.getAbsolutePath());\\n // Devuelve un String conteniendo el directorio padre del File. Devuelve null si no tiene directorio padre. de la ruta\\n System.out.println(ruta.getParent());\\n if (!f.exists()) { //se comprueba si el fichero existe o no\\n System.out.println(\\\"Fichero \\\" + f.getName() + \\\" no existe\\\");\\n if (!ruta.exists()) { //se comprueba si la ruta existe o no\\n System.out.println(\\\"El directorio \\\" + ruta.getName() + \\\" no existe\\\");\\n if (ruta.mkdir()) { //se crea la carpeta\\n System.out.println(\\\"Directorio creado\\\");\\n if (f.createNewFile()) { //se crea el fichero.\\n System.out.println(\\\"Fichero \\\" + f.getName() + \\\" creado\\\");\\n } else {\\n System.out.println(\\\"No se ha podido crear \\\" + f.getName());\\n }\\n } else {\\n System.out.println(\\\"No se ha podido crear \\\" + ruta.getName());\\n }\\n } else { //si la ruta existe creamos el fichero\\n if (f.createNewFile()) {\\n System.out.println(\\\"Fichero \\\" + f.getName() + \\\" creado\\\");\\n } else {\\n System.out.println(\\\"No se ha podido crear \\\" + f.getName());\\n }\\n }\\n } else { //el fichero existe. Mostramos el tamaño\\n System.out.println(\\\"Fichero \\\" + f.getName() + \\\" existe\\\");\\n System.out.println(\\\"Tamaño \\\" + f.length() + \\\" bytes\\\");\\n }\\n\\n // mostrar los archivos en esa carpeta\\n File f2 = new File(ruta, \\\".\\\");\\n // creamos un array para mostrar todos los archivos en esa ruta\\n String[] listaArchivos = f2.list();\\n if (!f1.exists()) { //se comprueba si el fichero existe o no\\n System.out.println(\\\"Fichero \\\" + f1.getName() + \\\" no existe\\\");\\n }\\n if (f1.createNewFile()) { //se crea el fichero. Si se ha creado correctamente\\n System.out.println(\\\"Fichero \\\" + f1.getName() + \\\" creado\\\");\\n } else {\\n System.out.println(\\\"No se ha podido crear \\\" + f1.getName());\\n }\\n for (int i = 0; i < listaArchivos.length; i++) {\\n System.out.println(listaArchivos[i]);\\n }\\n // mostrar el numero de archivos en esa carpeta\\n String[] elementos = ruta.list();\\n System.out.println(\\\"La carpeta \\\" + ruta.getAbsolutePath() + \\\" tiene \\\" + elementos.length + \\\" subelementos\\\");\\n }\",\n \"private void leerOracion(){\\r\\n\\tString wor=\\\"\\\";\\r\\n\\r\\n try {\\r\\n\\r\\n arch = new File (\\\"texto.txt\\\");\\r\\n fr = new FileReader (arch);\\r\\n br = new BufferedReader(fr);\\r\\n\\r\\n String lin;\\r\\n int ind=0;\\r\\n while((lin=br.readLine())!=null){\\r\\n \\twor=lin;\\r\\n }\\r\\n }\\r\\n catch(Exception e){\\r\\n e.printStackTrace();\\r\\n }finally{\\r\\n try{ \\r\\n if( null != fr ){ \\r\\n fr.close(); \\r\\n } \\r\\n }catch (Exception e2){ \\r\\n e2.printStackTrace();\\r\\n }\\r\\n }\\r\\n\\r\\n\\twhile(wor.compareTo(\\\"\\\")!=0){\\r\\n\\tint lugar=wor.indexOf(' ');\\r\\n if(lugar!=-1){\\r\\n orac.add(wor.substring(0,lugar));\\r\\n wor=wor.substring(lugar+1);\\r\\n }else{\\r\\n orac.add(wor);\\r\\n wor=\\\"\\\";\\r\\n }\\r\\n }\\r\\n }\",\n \"void doShowFiles()\\n\\t{\\n\\t\\ttry\\n\\t\\t{\\n\\t\\t\\tStringBuilder sb = new StringBuilder();\\n\\t\\t\\tIterator itr = m_fileInfo.getAllFiles();\\n\\n\\t\\t\\twhile(itr.hasNext())\\n\\t\\t\\t{\\n\\t\\t\\t\\tSourceFile m = (SourceFile) ((Map.Entry)itr.next()).getValue();\\n\\n\\t\\t\\t\\tString name = m.getName();\\n\\t\\t\\t\\tint id = m.getId();\\n\\t\\t\\t\\tString path = m.getFullPath();\\n\\n\\t\\t\\t\\tsb.append(id);\\n\\t\\t\\t\\tsb.append(' ');\\n\\t\\t\\t\\tsb.append(path);\\n\\t\\t\\t\\tsb.append(\\\", \\\"); //$NON-NLS-1$\\n\\t\\t\\t\\tsb.append(name);\\n\\t\\t\\t\\tsb.append(m_newline);\\n\\t\\t\\t}\\n\\t\\t\\tout( sb.toString() );\\n\\t\\t}\\n\\t\\tcatch(NullPointerException npe)\\n\\t\\t{\\n\\t\\t\\terr(getLocalizationManager().getLocalizedTextString(\\\"noSourceFilesFound\\\")); //$NON-NLS-1$\\n\\t\\t}\\n\\t}\",\n \"private void cargarFichaLepra_control() {\\r\\n\\r\\n\\t\\tMap<String, Object> parameters = new HashMap<String, Object>();\\r\\n\\t\\tparameters.put(\\\"codigo_empresa\\\", codigo_empresa);\\r\\n\\t\\tparameters.put(\\\"codigo_sucursal\\\", codigo_sucursal);\\r\\n\\t\\tparameters.put(\\\"nro_identificacion\\\", tbxNro_identificacion.getValue());\\r\\n\\r\\n\\t\\tficha_inicio_lepraService.setLimit(\\\"limit 25 offset 0\\\");\\r\\n\\r\\n\\t\\t// log.info(\\\"parameters>>>>\\\" + parameters);\\r\\n\\t\\tBoolean ficha_inicio = ficha_inicio_lepraService\\r\\n\\t\\t\\t\\t.existe_paciente_lepra(parameters);\\r\\n\\t\\t// log.info(\\\"ficha_inicio>>>>\\\" + ficha_inicio);\\r\\n\\r\\n\\t\\tif (ficha_inicio) {\\r\\n\\t\\t\\tMap<String, Object> parametros = new HashMap<String, Object>();\\r\\n\\t\\t\\tparametros.put(\\\"nro_identificacion\\\",\\r\\n\\t\\t\\t\\t\\tadmision_seleccionada.getNro_identificacion());\\r\\n\\t\\t\\tparametros.put(\\\"nro_ingreso\\\",\\r\\n\\t\\t\\t\\t\\tadmision_seleccionada.getNro_ingreso());\\r\\n\\t\\t\\tparametros.put(\\\"estado\\\", admision_seleccionada.getEstado());\\r\\n\\t\\t\\tparametros.put(\\\"codigo_administradora\\\",\\r\\n\\t\\t\\t\\t\\tadmision_seleccionada.getCodigo_administradora());\\r\\n\\t\\t\\tparametros.put(\\\"id_plan\\\", admision_seleccionada.getId_plan());\\r\\n\\t\\t\\tparametros.put(IVias_ingreso.ADMISION_PACIENTE,\\r\\n\\t\\t\\t\\t\\tadmision_seleccionada);\\r\\n\\t\\t\\tparametros.put(IVias_ingreso.OPCION_VIA_INGRESO,\\r\\n\\t\\t\\t\\t\\tOpciones_via_ingreso.REGISTRAR);\\r\\n\\t\\t\\ttabboxContendor.abrirPaginaTabDemanda(false,\\r\\n\\t\\t\\t\\t\\tIRutas_historia.PAGINA_SEGUIMIENTO_TRATAMIENTO_LEPRA,\\r\\n\\t\\t\\t\\t\\tIRutas_historia.LABEL_SEGUIMIENTO_TRATAMIENTO_LEPRA,\\r\\n\\t\\t\\t\\t\\tparametros);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public static void main(String[] args) {\\n String filePath = \\\"C:\\\\\\\\Users\\\\\\\\Catalin\\\\\\\\Desktop\\\\\\\\fisierdecitit.txt\\\";\\n\\n try {\\n //incarcarea fisierului in memoria programului cu ajutorul ob fileReader\\n FileReader fileReader = new FileReader(filePath);\\n //incepem citirea din fisier linie cu line cu ajutorul BufferedReader\\n BufferedReader bufferedReader = new BufferedReader(fileReader);\\n String text = bufferedReader.readLine();\\n while (text != null) {\\n System.out.println(\\\"Linia citita este: \\\" + text);\\n String[] array = text.split(\\\" \\\");\\n System.out.println(array.length);\\n text = bufferedReader.readLine();\\n\\n }\\n\\n } catch (IOException e) {\\n System.out.println(\\\"A aparut o eroare: \\\" + e.getMessage());\\n }\\n\\n\\n //invatam sa scriem intr un fisier\\n String filePathToWrite = \\\"C:\\\\\\\\Users\\\\\\\\Catalin\\\\\\\\Desktop\\\\\\\\fisierdescris.txt\\\";\\n try {\\n FileWriter fileWriter = new FileWriter(filePathToWrite);\\n BufferedWriter bufferedWriter = new BufferedWriter(fileWriter);\\n String text = \\\"Mama lu' Ana nu are nici mere si nici pere.\\\";\\n String text2 = \\\"smhjhdgfdsbfkdhj\\\";\\n\\n bufferedWriter.write(text2);\\n bufferedWriter.newLine();\\n bufferedWriter.write(text);\\n bufferedWriter.flush();\\n bufferedWriter.close();\\n } catch (IOException e) {\\n System.out.println(\\\"A aparut o exceptie: \\\" + e.getMessage());\\n }\\n\\n\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6538007","0.6518997","0.6489293","0.6483024","0.6373594","0.6324646","0.6267357","0.6245618","0.61500937","0.61420095","0.61260396","0.61188596","0.6105742","0.6100809","0.6062974","0.60073733","0.60028297","0.59977794","0.59917605","0.59848845","0.59717774","0.59634125","0.5949149","0.59480286","0.59445506","0.5908735","0.58979255","0.58904874","0.5888346","0.58856124","0.5878339","0.58646244","0.5843941","0.58020747","0.5779035","0.57774043","0.5759568","0.575633","0.5756105","0.5744652","0.5738489","0.5737409","0.5732473","0.5725211","0.5721766","0.5716957","0.5710698","0.57101953","0.57088363","0.570552","0.570519","0.56870985","0.56798863","0.567897","0.56723756","0.5660166","0.5651389","0.56490195","0.5645403","0.5626968","0.56215197","0.5619775","0.56174415","0.5612189","0.56055474","0.56037","0.5602835","0.5600196","0.5597591","0.5596273","0.5580282","0.55723876","0.55702966","0.55602324","0.5555133","0.55525935","0.55521643","0.5551493","0.5538748","0.55331504","0.553165","0.5531244","0.5507286","0.5507206","0.54972756","0.5496017","0.5493676","0.54922664","0.5492147","0.5489562","0.5489128","0.5486009","0.5484589","0.54824907","0.54804456","0.547829","0.5476577","0.54764396","0.5473805","0.5466652","0.54640394"],"string":"[\n \"0.6538007\",\n \"0.6518997\",\n \"0.6489293\",\n \"0.6483024\",\n \"0.6373594\",\n \"0.6324646\",\n \"0.6267357\",\n \"0.6245618\",\n \"0.61500937\",\n \"0.61420095\",\n \"0.61260396\",\n \"0.61188596\",\n \"0.6105742\",\n \"0.6100809\",\n \"0.6062974\",\n \"0.60073733\",\n \"0.60028297\",\n \"0.59977794\",\n \"0.59917605\",\n \"0.59848845\",\n \"0.59717774\",\n \"0.59634125\",\n \"0.5949149\",\n \"0.59480286\",\n \"0.59445506\",\n \"0.5908735\",\n \"0.58979255\",\n \"0.58904874\",\n \"0.5888346\",\n \"0.58856124\",\n \"0.5878339\",\n \"0.58646244\",\n \"0.5843941\",\n \"0.58020747\",\n \"0.5779035\",\n \"0.57774043\",\n \"0.5759568\",\n \"0.575633\",\n \"0.5756105\",\n \"0.5744652\",\n \"0.5738489\",\n \"0.5737409\",\n \"0.5732473\",\n \"0.5725211\",\n \"0.5721766\",\n \"0.5716957\",\n \"0.5710698\",\n \"0.57101953\",\n \"0.57088363\",\n \"0.570552\",\n \"0.570519\",\n \"0.56870985\",\n \"0.56798863\",\n \"0.567897\",\n \"0.56723756\",\n \"0.5660166\",\n \"0.5651389\",\n \"0.56490195\",\n \"0.5645403\",\n \"0.5626968\",\n \"0.56215197\",\n \"0.5619775\",\n \"0.56174415\",\n \"0.5612189\",\n \"0.56055474\",\n \"0.56037\",\n \"0.5602835\",\n \"0.5600196\",\n \"0.5597591\",\n \"0.5596273\",\n \"0.5580282\",\n \"0.55723876\",\n \"0.55702966\",\n \"0.55602324\",\n \"0.5555133\",\n \"0.55525935\",\n \"0.55521643\",\n \"0.5551493\",\n \"0.5538748\",\n \"0.55331504\",\n \"0.553165\",\n \"0.5531244\",\n \"0.5507286\",\n \"0.5507206\",\n \"0.54972756\",\n \"0.5496017\",\n \"0.5493676\",\n \"0.54922664\",\n \"0.5492147\",\n \"0.5489562\",\n \"0.5489128\",\n \"0.5486009\",\n \"0.5484589\",\n \"0.54824907\",\n \"0.54804456\",\n \"0.547829\",\n \"0.5476577\",\n \"0.54764396\",\n \"0.5473805\",\n \"0.5466652\",\n \"0.54640394\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":29399,"cells":{"query":{"kind":"string","value":"Permette la scrittura di regola/e nel file dal percorso specficato in modo da salvare permanentemente"},"document":{"kind":"string","value":"public void writeRuleToFile(String text, boolean append) {\n if (fileName.isEmpty())\n return;\n\n try {\n FileWriter fileWriter = new FileWriter(fileName, append);\n PrintWriter writer = new PrintWriter(fileWriter);\n\n writer.println(text);\n\n writer.close();\n fileWriter.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["public void pruebaEscritura() {\n\t\tFileWriter fichero = null;\n\t\tPrintWriter pw = null;\n\t\ttry {\n\t\t\tfichero = new FileWriter(\"//172.16.1.141/Modelo_Raster/Varios/Monitoreo_Forestal/REDD/Metadatos/test.xml\");\n\t\t\tpw = new PrintWriter(fichero);\n\n\t\t\tfor (int i = 0; i < 10; i++)\n\t\t\t\tpw.println(\"Linea \" + i);\n\n\t\t}\n\t\tcatch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\tfinally {\n\t\t\ttry {\n\t\t\t\t// Nuevamente aprovechamos el finally para\n\t\t\t\t// asegurarnos que se cierra el fichero.\n\t\t\t\tif (null != fichero) fichero.close();\n\t\t\t}\n\t\t\tcatch (Exception e2) {\n\t\t\t\te2.printStackTrace();\n\t\t\t}\n\t\t}\n\t}","@Override\n\tpublic void salvaSuFile() {\n\t\tString path = \"alimenti.txt\";\n\t\tString allergeni = Alimento.getStringaAllergeni(getElencoAllergeni());\n\t\ttry {\n\t\t\tFile file = new File(path);\n\t\t\tFileWriter fw = new FileWriter(file, true);\n\t\t\tBufferedWriter bw = new BufferedWriter(fw);\n\t\t\tbw.write(getNome() + \" - \" + getPrezzo() + \"€\\n\");\n\t\t\tbw.write(\"Adatto a vegani: \" + (getVegano() ? \"sì\\n\" : \"no\\n\"));\n\t\t\tbw.write(\"Adatto a vegetariani: \" + (getVegetariano() ? \"sì\\n\" : \"no\\n\"));\n\t\t\tbw.write(\"Tipologia: \" + getTipoPortata().getNome().toUpperCase() + \"\\n\");\n\t\t\tbw.write(\"Cottura: \" + getTipoCottura().getNome().toUpperCase() + \"\\n\");\n\t\t\tbw.write(\"Allergeni: \" + (allergeni.isEmpty() ? \"--\" : allergeni) + \"\\n\\n\");\n\t\t\tbw.flush();\n\t\t\tbw.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}","public void salvaPartita(String file) {\n\r\n }","private static void createFileContribuicaoUmidade() throws IOException{\r\n\t\tInteger contribuicaoDefault = 0;\r\n\t\tarqContribuicaoUmidade = new File(pathContribuicaoUmidade);\r\n\t\tif(!arqContribuicaoUmidade.exists()) {\r\n\t\t\tarqContribuicaoUmidade.createNewFile();\r\n\t\t\tFileWriter fw = new FileWriter(getArqContribuicaoUmidade());\r\n\t\t\tBufferedWriter buffWrite = new BufferedWriter(fw);\r\n\t\t\tbuffWrite.append(contribuicaoDefault.toString() + String.valueOf('\\n'));\r\n\t\t\tbuffWrite.close();\r\n\t\t}else {//Se arquivo existir\r\n\t\t\tFileReader fr = new FileReader(getArqContribuicaoUmidade());\r\n\t\t\tBufferedReader buffRead = new BufferedReader(fr);\r\n\t\t\tif(!buffRead.ready()) {/*Se o arquivo se encontar criado mas estiver vazio(modificado)*/\r\n\t\t\t\tFileWriter fw = new FileWriter(arqContribuicaoUmidade);\r\n\t\t\t\tBufferedWriter buffWrite = new BufferedWriter(fw);\r\n\t\t\t\tbuffWrite.append(contribuicaoDefault.toString() + String.valueOf('\\n'));/*Inicializa o arquivo com uma contribuicao Inicial*/\r\n\t\t\t\tbuffWrite.close();\r\n\t\t\t}\r\n\t\t\tbuffRead.close();\r\n\t\t}\r\n\t}","public void arquivoSaida() {\r\n\r\n try {\r\n File file = new File(\"arquivoSaida.txt\");\r\n try (FileWriter arquivoSaida = new FileWriter(file, true)) {\r\n arquivoSaida.write(\"Rota do menor caminho entre as cidades escolhidas: \\n\\n\");\r\n Vertice v;\r\n \r\n //Escreve no arquivo a rota de ida de entrega nas cidades\r\n for (int i = 0; i < rota.getLista_de_rota().size() - 1; i++) {\r\n for (int j = 0; j < rota.getLista_de_rota().get(i).size(); j++) {\r\n v = rota.getLista_de_rota().get(i).get(j);\r\n arquivoSaida.write(v.getId() + \"; \");\r\n }\r\n }\r\n \r\n arquivoSaida.write(\"\\n\\nRota do menor caminho de volta: (Considerando que não há mais nenhuma entrega)\\n\\n\");\r\n // pegando a ultima posição da lista geral em que está a lista do menor caminho de volta\r\n int t = rota.getLista_de_rota().size() - 1; \r\n \r\n //Escreve a rota do caminho de volta, verificando a distancia entre a cidade origem e a cidade destino\r\n for (int j = rota.getLista_de_rota().get(t).size() - 1; j >= 0; j--) {\r\n v = (Vertice) rota.getLista_de_rota().get(t).get(j);\r\n arquivoSaida.write(v.getId() + \"; \");\r\n }\r\n arquivoSaida.write(\"Distancia percorrida: \"+rota.getDistancia()+\"\\n\");\r\n arquivoSaida.close();\r\n }\r\n } catch (IOException ex) { //caso nao seja possivel abrir algum dos arquivos\r\n System.out.println(\"Não foi possivel abrir arquivo\");\r\n }\r\n }","public void importaRegole(String file, ArrayList<Sensore> listaSensori, ArrayList<Attuatore> listaAttuatori) {\n ArrayList<String> nomiDispPres = new ArrayList<>();\n\n for (Sensore s : listaSensori) {\n nomiDispPres.add(s.getNome());\n }\n\n for (Attuatore att : listaAttuatori) {\n nomiDispPres.add(att.getNome());\n }\n\n String regoleImport = readFromFile(file);\n\n if (regoleImport.equals(\"\")) {\n System.out.println(\"XX Errore di lettura file. Non sono state inserite regole per l'unita immobiliare XX\\n\");\n return;\n }\n\n String[] regole = regoleImport.split(\"\\n\");\n\n for (String r : regole) {\n try {\n ArrayList<String> dispTrovati = verificaCompRegola(r);\n\n for (String nomeDis : dispTrovati) {\n if (nomeDis.contains(\".\")){\n String nomeS = nomeDis.split(\"\\\\.\")[0];\n\n if (!nomiDispPres.contains(nomeS)) {\n throw new Exception(\"XX Dispositivi Incompatibili all'interno della regola XX\\n\");\n }\n\n Sensore s = listaSensori.stream().filter(sensore -> sensore.getNome().equals(nomeS)).iterator().next();\n String nomeInfo = nomeDis.split(\"\\\\.\")[1];\n\n if (s.getInformazione(nomeInfo) == null)\n throw new Exception(\"XX Regola non compatibile XX\\n\");\n\n\n } else if (!nomiDispPres.contains(nomeDis)) {\n throw new Exception(\"XX Dispositivi Incompatibili all'interno della regola XX\\n\");\n\n }\n }\n System.out.println(\"*** Importazione della regola avvenuta con successo ***\\n\");\n writeRuleToFile(r, true);\n\n } catch (Exception e) {\n System.out.println(e.getMessage());\n }\n\n }\n eliminaDoppie(listaSensori,listaAttuatori);\n }","public static void RT() {////cada clase que tiene informacion en un archivo txt tiene este metodo para leer el respectivo archivoy guardarlo en su hashmap\n\t\treadTxt(\"peliculas.txt\", pelisList);\n\t}","void changeFile()\n {\n App app = new App();\n // Loop through the read File\n for (String s : readFile) {\n if (app.containsUtilize(s)) {\n // Changes the first use of utilize with use\n String newTemp = s.replaceFirst(\"utilize\", \"use\");\n // Writes to file\n this.writeFile.add(newTemp);\n } else {\n // not utilize\n this.writeFile.add(s);\n }\n }\n }","public void abrirArchivo() {\r\n try {\r\n entrada = new Scanner(new File(\"estudiantes.txt\"));\r\n } // fin de try\r\n catch (FileNotFoundException fileNotFoundException) {\r\n System.err.println(\"Error al abrir el archivo.\");\r\n System.exit(1);\r\n } // fin de catch\r\n }","public void Leer() throws FileNotFoundException\n {\n // se crea una nueva ruta en donde se va a ir a leer el archivo\n String ruta = new File(\"datos.txt\").getAbsolutePath(); \n archivo=new File(ruta); \n }","String prepareFile();","public void FermerAgd() {\n //on essaye d'ouvrir un fichier dans lequel enregistrer le contenu de l'agenda\n try {\n Formatter agd_a_enreg = new Formatter(\"C:\\\\Projet_Agenda_ING3\\\\saved_agendas\");\n\n for (RdV el : this.getAgenda()) {\n //on enregistre 1 rdv par ligne\n //faire gaffe aux formats : %..\n agd_a_enreg.format(\"%s/%s/%s de %s a %s : %s , %s\\n\",\n el.getDate().getDayOfMonth(), el.getDate().getMonthValue(),\n el.getDate().getYear(), el.getHdebut(),\n el.getHfin(), el.getLibelle(), el.getRappel());\n //on supprime le rdv de l'arraylist d'agenda \n this.suppressionRdV(el);\n }\n //on ferme le fichier en ecriture\n agd_a_enreg.close();\n //on met l'attribut agenda à null une fois qu'il est \"vidé\"\n this.agd = null;\n } //en cas de probleme dans l'ouverture du fichier on affiche une erreur\n catch (Exception e) {\n System.out.print(\"Erreur d'ouverture du fichier en ecriture\\n\");\n }\n\n }","public void remFile(){\n ((MvwDefinitionDMO) core).remFile();\n }","private void removeContentsFromFile() {\n Log.d(\"debugMode\", \"deleting entire file contents...\");\n try {\n FileOutputStream openFileInput = openFileOutput(\"Locations.txt\", MODE_PRIVATE);\n PrintWriter printWriter = new PrintWriter(openFileInput);\n printWriter.print(\"\");\n printWriter.close();\n Log.d(\"debugMode\", \"deleting entire file contents successful\");\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }","protected void fileSet() throws IOException {\n//\t\tfos = new FileOutputStream(outFile, false);\n//\t\tdos = new DataOutputStream(fos);\n\t\trealWriter = new BufferedWriter(new FileWriter(outFile.getAbsolutePath()));\n\t}","private void guardarComo() {\r\n\t\tJFileChooser guardar = new JFileChooser();\r\n\t\tFileNameExtensionFilter filtro = new FileNameExtensionFilter(\"obj\",\"obj\");\r\n\t\tguardar.setFileFilter(filtro);\r\n\t\tif(guardar.showSaveDialog(guardar) == JFileChooser.APPROVE_OPTION){\r\n\t\t\tGestion.setFichero(Gestion.extensionValida(guardar.getSelectedFile()));\r\n\t\t\ttry {\r\n\t\t\t\tif(!Gestion.existe(Gestion.getFichero())){\r\n\t\t\t\t\tGestion.escribir(Gestion.getFichero());\r\n\t\t\t\t\tGestion.setModificado(false);\r\n\t\t\t\t\tfrmLigaDeFtbol.setTitle(Gestion.getFichero().getName());\r\n\t\t\t\t}\r\n\t\t\t\telse{\r\n\t\t\t\t\tswitch(JOptionPane.showConfirmDialog(null, \"El archivo existe. Desea sobreescribirlo?\", \"Aviso\", JOptionPane.WARNING_MESSAGE)){\r\n\t\t\t\t\tcase JOptionPane.OK_OPTION:\r\n\t\t\t\t\t\tGestion.escribir(Gestion.getFichero());\r\n\t\t\t\t\t\tGestion.setModificado(false);\r\n\t\t\t\t\t\t\t\tfrmLigaDeFtbol.setTitle(Gestion.getFichero().getName());\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\t\t\t\t\t\t\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\tJOptionPane.showMessageDialog(null, e.getMessage(), \"Error\", JOptionPane.ERROR_MESSAGE);\r\n\t\t\t}\r\n\t\t}\r\n\t}","public void OuvrirAgd() {\n //on charge l'agenda à partir d'un fichier en lecture\n try {\n File agd_a_lire = new File(\"C:\\\\Projet_Agenda_ING3\\\\saved_agendas\");\n Scanner sc = new Scanner(agd_a_lire);\n\n //on lit le fichier ligne par ligne\n /*while (sc.) {\n\n }*/\n\n sc.close();\n } catch (Exception e) {\n System.out.print(\"Erreur d'ouverture du fichier en lecture\\n\");\n }\n }","public void apagarFicheiro(String s) {\r\n\t\tFile f = new File(s + \".dat\");\r\n\t\ttry {\r\n\t\t\tif (f.exists()) {\r\n\t\t\t\tf.delete();\r\n\t\t\t}\r\n\t\t} catch (Exception e) {\r\n\t\t\t//\r\n\t\t}\r\n\t}","public void EliminarArchivos(){\n\t\ttry{\n\t\tFile Delete = new File(\"Cod.txt\");\n\t\tDelete.deleteOnExit();\n\t\tFile Borrar = new File(\"Maq.txt\");\n\t\tBorrar.deleteOnExit();\n\t\tFile eliminar = new File(\"WS.txt\");\n\t\teliminar.deleteOnExit();\n\t\tFile Bye = new File(\"RESPALDO.txt\");\n\t\tBye.deleteOnExit();\n\t\t\tBufferedReader numero= new BufferedReader(new FileReader(\"WS.txt\"));\n\t\t\tString valor = numero.readLine();\n\t\t\tint NumAreas= Integer.valueOf(valor);\n\t\t\tfor(int i=0; i< NumAreas;i++){\n\t\t\t\tvalor= numero.readLine();\n\t\t\t\tFile eliminas = new File(\"WS\"+valor+\".txt\");\n\t\t\t\teliminas.deleteOnExit();\n\t\t\t}\n\t\t\tnumero.close();\n\t\t}catch(IOException e){\n\t\t\tSystem.out.println(\"File not found\");\n\t\t}\n\t}","public void disabilitaRegolaConDispositivo(String nomeDispositivo) {\n String[] regole = readRuleFromFile().split(\"\\n\");\n for (String s : regole) {\n try {\n ArrayList<String> disps = verificaCompRegola(s);\n\n if (disps.contains(nomeDispositivo)) {\n cambiaAbilitazioneRegola(s,false);\n }\n\n } catch (Exception e) {\n String msg = e.getMessage();\n }\n\n if (s.contains(nomeDispositivo)) {\n cambiaAbilitazioneRegola(s, false);\n }\n }\n }","private void cargarFichero() throws FileNotFoundException {\n\t\tFile miFichero = new File(NOMBRE_FICHERO);\n\t\tFileWriter erroresFichero;\n\t\t\n\t\tScanner in = new Scanner(miFichero);\n\t\t\n\t\tEjercicio nuevoEjer;\n\t\tString siguienteLinea;\n\t\tComprobadorEntradaFichero comprobador = new ComprobadorEntradaFichero();\n\t\tString errores = \"\";\n\t\tint numLinea = 1;\n\t\t\n\t\twhile (in.hasNextLine()) {\n\t\t\t\n\t\t\tsiguienteLinea = in.nextLine();\n\t\t\tif (comprobador.test(siguienteLinea)) {\n\t\t\t\tnuevoEjer = new Ejercicio(siguienteLinea);\n\t\t\t\tcoleccionEj.addEjercicio(nuevoEjer);\n\t\t\t} else {\n\t\t\t\t//Controlar cuántos errores va dando\n\t\t\t\terrores += \"Error en la lÃnea: \" + String.valueOf(numLinea) + \". Datos: \" + siguienteLinea + \"\\n\";\n\t\t\t}\n\t\t\tnumLinea++;\n\t\t}\n\t\t\n\t\tin.close();\n\t\t\n\t\t\n\t\t//Ahora escribimos \n\t\tif (errores != \"\") {\n\t\t\ttry {\n\t\t\t erroresFichero = new FileWriter(NOMBRE_FICHERO_ERRORES);\n\t\t\n\t\t\t erroresFichero.write(errores);\n\n\t\t\t erroresFichero.close();\n\n\t\t\t} catch (Exception ex) {\n\t\t\t\tSystem.out.println(\"Mensaje de la excepción: \" + ex.getMessage());\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t}","void reloadeRooms( ) throws FileNotFoundException;","public void afterCleaner() throws NumberFormatException, IOException{\n \t\t\t fileCleaner(\"ini.time\" );\n \t\t\t fileCleaner(\"failed.num\" );\n// \t\t\t fileCleaner(\"test.num\" );\n \t\t\t fileCleaner(\"add.num\" );\n// \t\t\t fileCleaner(\"prev.num\" );\n \t\t\t fileCleaner(\"server.info\");\n \t\t\t fileCleaner(\"email.opt\" );\n \t\t\t fileCleaner(\"email.all\" );\n \t\t\t fileCleaner(\"email.cont\" );\n \t\t\t fileCleaner(\"email.subj\" );\n \t\t\t fileCleaner(\"add.show\" );\n \t\t\t fileCleaner(\"screen-shots.zip\");\n \t\t\t fileCleaner(\"screen-shots.renameToZip\");\n \t\t}","public void saveFile() {\t\n\t\tString fileloc = \"\";\n\t\tif(!prf.foldername.getText().equals(\"\"))\n\t\t\tfileloc += prf.foldername.getText()+\"/\";\n\t\tfileloc += ((MinLFile) tabbedPane.getSelectedComponent()).filename;;\t\t\n\t\tFile fl = new File(fileloc);\n\t\t\n\t\ttry {\n\t\t\tif(fl.exists()) {\n\t\t\t\tint option = JOptionPane.showConfirmDialog(null, \"The file with this name already exists, do you want to overwrite it?\", \"Save File\", JOptionPane.YES_NO_OPTION);\n\t\t\t\tif(option == 0) {\n\t\t\t\t\tFiles.delete(fl.toPath());\n\t\t\t\t\ttry {\n\t\t\t\t\t\t\n\t\t\t\t\t\tFileWriter fw = new FileWriter(fileloc);\n\t\t\t\t\t\tBufferedWriter bw = new BufferedWriter(fw);\n\t\t\t\t\t\tbw.write(((MinLFile) tabbedPane.getSelectedComponent()).CodeArea.getText());\n\t\t\t\t\t\tbw.close();\n\t\t\t\t\t\tfw.close();\n\t\t\t\t\t\t((MinLFile) tabbedPane.getSelectedComponent()).filechanged = false;\n\t\t\t\t\t} catch (IOException e1) {\n\t\t\t\t\t\te1.printStackTrace();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\ttry {\n\t\t\t\t\tFileWriter fw = new FileWriter(fileloc);\n\t\t\t\t\tBufferedWriter bw = new BufferedWriter(fw);\n\t\t\t\t\tbw.write(((MinLFile) tabbedPane.getSelectedComponent()).CodeArea.getText());\n\t\t\t\t\tbw.close();\n\t\t\t\t\tfw.close();\n\t\t\t\t\t((MinLFile) tabbedPane.getSelectedComponent()).filechanged = false;\n\t\t\t\t} catch (IOException e1) {\n\t\t\t\t\tJOptionPane.showMessageDialog(null, \"The specified folder doesnt exist.\");\n\t\t\t\t\te1.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}","private void updateFile() {\n try {\n this.taskStorage.save(this.taskList);\n this.aliasStorage.save(this.parser);\n } catch (IOException e) {\n System.out.println(\"Master i am unable to save the file!\");\n }\n }","private void fecharArquivoEscrita(BufferedWriter file) {\n\t\ttry {\n\t\t\tfile.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}","public void loadData() {\n Path path= Paths.get(filename);\n Stream<String> lines;\n try {\n lines= Files.lines(path);\n lines.forEach(ln->{\n String[] s=ln.split(\";\");\n if(s.length==3){\n try {\n super.save(new Teme(Integer.parseInt(s[0]),Integer.parseInt(s[1]),s[2]));\n } catch (ValidationException e) {\n e.printStackTrace();\n } catch (SQLException e) {\n e.printStackTrace();\n }\n }else\n System.out.println(\"linie corupta in fisierul teme.txt\");});\n } catch (IOException e) {\n e.printStackTrace();\n }\n }","private static void createFileUmidade() throws IOException {\r\n\t\tInteger defaultUmidade = 30;\r\n\t\tarqUmidade = new File(pathUmidade);\r\n\t\tif(!arqUmidade.exists()) {\r\n\t\t\tarqUmidade.createNewFile();\r\n\t\t\tFileWriter fw = new FileWriter(getArqUmidade());\r\n\t\t\tBufferedWriter buffWrite = new BufferedWriter(fw);\r\n\t\t\tbuffWrite.append(defaultUmidade.toString() + String.valueOf('\\n'));/*Inicializa o arquivo com uma umidade Inicial*/\r\n\t\t\tbuffWrite.close();\r\n\t\t}else {\r\n\t\t\tFileReader fr = new FileReader(getArqUmidade());\r\n\t\t\tBufferedReader buffRead = new BufferedReader(fr);\r\n\t\t\tif(!buffRead.ready()) {/*Se o arquivo se encontar criado mas estiver vazio*/\r\n\t\t\t\tFileWriter fw = new FileWriter(arqUmidade);\r\n\t\t\t\tBufferedWriter buffWrite = new BufferedWriter(fw);\r\n\t\t\t\tbuffWrite.append(defaultUmidade.toString() + String.valueOf('\\n'));/*Inicializa o arquivo com uma umidade Inicial*/\r\n\t\t\t\tbuffWrite.close();\r\n\t\t\t}\r\n\t\t\tbuffRead.close();\r\n\t\t}\r\n\t}","private void grabarArchivo() {\n\t\tPrintWriter salida;\n\t\ttry {\n\t\t\tsalida = new PrintWriter(new FileWriter(super.salida));\n\t\t\tsalida.println(this.aDevolver);\n\t\t\tsalida.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}","public void guardarContribuintes () throws IOException {\n FileWriter f = new FileWriter(\"registo_contribuintes.txt\");\n \n for(String NIF : contribuintes.keySet())\n f.write(getContribuinte(NIF).toString());\n \n f.close();\n }","public void leeArchivo() throws IOException {\n // defino el objeto de Entrada para tomar datos\n BufferedReader brwEntrada;\n try {\n // creo el objeto de entrada a partir de un archivo de texto\n brwEntrada = new BufferedReader(new FileReader(\"datos.txt\"));\n } catch (FileNotFoundException e) {\n // si marca error es que el archivo no existia entonces lo creo\n File filPuntos = new File(\"datos.txt\");\n PrintWriter prwSalida = new PrintWriter(filPuntos);\n // le pongo datos ficticios o de default\n // lo cierro para que se grabe lo que meti al archivo\n prwSalida.close();\n // lo vuelvo a abrir porque el objetivo es leer datos\n brwEntrada = new BufferedReader(new FileReader(\"datos.txt\"));\n }\n // con el archivo abierto leo los datos que estan guardados\n brwEntrada.close();\n }","public static void fix(World world) {\n \t\tFile regionFolder = new File(Bukkit.getWorldContainer() + File.separator + world.getName() + File.separator + \"region\");\r\n \t\tif (regionFolder.exists()) {\r\n \t\t\t// Loop through all region files of the world\r\n \t\t\tint dx, dz;\r\n \t\t\tint rx, rz;\r\n \t\t\tfor (String regionFileName : regionFolder.list()) {\r\n \t\t\t\t// Validate file\r\n \t\t\t\tFile file = new File(regionFolder + File.separator + regionFileName);\r\n \t\t\t\tif (!file.isFile() || !file.exists()) {\r\n \t\t\t\t\tcontinue;\r\n \t\t\t\t}\r\n \t\t\t\tString[] parts = regionFileName.split(\"\\\\.\");\r\n \t\t\t\tif (parts.length != 4 || !parts[0].equals(\"r\") || !parts[3].equals(\"mca\")) {\r\n \t\t\t\t\tcontinue;\r\n \t\t\t\t}\r\n \t\t\t\t// Obtain the chunk offset of this region file\r\n \t\t\t\ttry {\r\n \t\t\t\t\trx = Integer.parseInt(parts[1]) << 5;\r\n \t\t\t\t\trz = Integer.parseInt(parts[2]) << 5;\r\n \t\t\t\t} catch (Exception ex) {\r\n \t\t\t\t\tcontinue;\r\n \t\t\t\t}\r\n \r\n \t\t\t\t// Is it contained in the cache?\r\n \t\t\t\tReference<RegionFile> ref = RegionFileCacheRef.FILES.get(file);\r\n \t\t\t\tRegionFile reg = null;\r\n \t\t\t\tif (ref != null) {\r\n \t\t\t\t\treg = ref.get();\r\n \t\t\t\t}\r\n \t\t\t\tboolean closeOnFinish = false;\r\n \t\t\t\tif (reg == null) {\r\n \t\t\t\t\tcloseOnFinish = true;\r\n \t\t\t\t\t// Manually load this region file\r\n \t\t\t\t\treg = new RegionFile(file);\r\n \t\t\t\t}\r\n \t\t\t\t// Obtain all generated chunks in this region file\r\n \t\t\t\tfor (dx = 0; dx < 32; dx++) {\r\n \t\t\t\t\tfor (dz = 0; dz < 32; dz++) {\r\n \t\t\t\t\t\tif (reg.c(dx, dz)) {\r\n \t\t\t\t\t\t\t// Region file exists - add it\r\n\t\t\t\t\t\t\tfix(world, rx + dx, rz + dz, true);\r\n \t\t\t\t\t\t}\r\n \t\t\t\t\t}\r\n \t\t\t\t}\r\n \t\t\t\tif (closeOnFinish) {\r\n \t\t\t\t\t// Close the region file stream - we are done with it\r\n \t\t\t\t\treg.c();\r\n \t\t\t\t}\r\n \t\t\t}\r\n\t\t} else {\r\n\t\t\tNoLagg.plugin.log(Level.WARNING, \"Failed to fix world '\" + world.getName() + \"': Region folder is missing!\");\r\n \t\t}\r\n \t}","private void guardarArchivoMemoriaInterna(String objeto,String fileName,int modoGuardado) throws FileSaverException{\n String msg = contexto.getResources().getString(R.string.fileSaverErrorEscrituraLocal);\n FileOutputStream mOutput;\n if(objeto!=null) {\n try {\n Log.v(TAG,\"Guardando el archivo \"+fileName+\" en memoriaInterna\");\n mOutput = contexto.openFileOutput(fileName, modoGuardado);\n mOutput.write(objeto.toString().getBytes());\n mOutput.flush();\n mOutput.close();\n msg = contexto.getResources().getString(R.string.fileSaverAlmacenExitoso);\n Log.v(TAG,msg);\n }\n catch(FileNotFoundException e){\n throw new FileSaverException(msg);\n }\n catch(IOException e){\n throw new FileSaverException(msg);\n }\n }\n else{\n throw new FileSaverException(msg);\n }\n }","private void RemoverMapa(String nomeMapa){\n try{\n BufferedReader br = new BufferedReader(new FileReader(caminho.getPath()+\"/caminho.txt\"));\n File rm = new File(caminho.getPath()+\"/\"+nomeMapa+\".txt\");\n rm.delete();\n String linha = br.readLine();\n ArrayList<String> salvar = new ArrayList();\n String array[] = new String[3];\n while (linha != null){\n array = linha.split(\",\");\n if(!array[1].equals(nomeMapa)){\n salvar.add(linha);\n }\n linha = br.readLine();\n }\n br.close();\n FileWriter fw = new FileWriter(caminho.getPath()+\"/caminho.txt\", true);\n fw.close();\n BufferedWriter bw = new BufferedWriter(new FileWriter(caminho.getPath()+\"/caminho.txt\"));\n for (int i = 0; i < salvar.size();i++){\n bw.write(salvar.get(i));\n bw.newLine();\n }\n bw.close();\n\n }catch (IOException ioe){\n }\n }","public EnigmaFile() throws Exception\n {\n\n String path = Main.class.getClassLoader().getResource(\"filein.txt\").getPath();\n File currentDirectory=new File(path);\n finstream = new FileInputStream(currentDirectory);\n\n\n String pathToWrite = path.replaceFirst(\"filein.txt\",\"fileout.txt\");\n File outputFile = new File(pathToWrite);\n br = new BufferedReader(new InputStreamReader(finstream));\n outputFile.createNewFile();\n FileWriter fileWrite = new FileWriter(outputFile.getAbsoluteFile());\n writer = new BufferedWriter(fileWrite);\n\n\n }","public static void LeerCaracter(File rutaLeer, File rutaEscribir) throws IOException {\n\n FileReader lector = new FileReader(rutaLeer);\n FileWriter escritor = new FileWriter(rutaEscribir);\n\n String cartelera = (\"--------------------------------------\\n\"\n + \" Cartelera de CineFBMoll\\n\"\n + \"--------------------------------------\\n\\n\");\n\n String linea = \"--------------------------------------\\n\\n\";\n\n //se escribe la cartelera\n for (int i = 0; i < cartelera.length(); i++) {\n escritor.write(cartelera.charAt(i));\n }\n\n int caracter;\n int contador = 0;\n boolean encontrarSigno = true;\n\n while ((caracter = lector.read()) != -1) {\n if (((char) caracter) != '#') {\n if (((char) caracter) != '{') {\n if (encontrarSigno) {\n for (int i = 0; i < datos[contador].length(); i++) {\n escritor.write(datos[contador].charAt(i)); // imprimir elemento de datos\n }\n escritor.write(\": \");\n encontrarSigno = false;\n }\n escritor.write(((char) caracter));\n } else {\n escritor.write(\"\\n\");\n escritor.write(\"\\n\");\n for (int i = 0; i < linea.length(); i++) {\n escritor.write(linea.charAt(i));\n }\n\n contador = 0;\n encontrarSigno = true;\n }\n } else {\n escritor.write(\"\\n\");\n escritor.write(\"\\n\");\n contador++;\n encontrarSigno = true;\n }\n }//while\n lector.close();// Cierra el archivo \n escritor.close();// Cierra el archivo \n\n }","public void escribir(String direccion,String texto) {\n try {\n FileWriter writer = new FileWriter(direccion);\n PrintWriter print = new PrintWriter(writer);\n print.print(texto);\n writer.close();\n } catch (IOException e) {\n System.out.println(e.getMessage());\n }\n }","public void save() {\r\n File distDataFile = new File(path);\r\n\r\n //String basePath = path;\r\n String endOfPath = path.substring(path.lastIndexOf(\"/\"));\r\n\r\n File rootDataFile;\r\n if (!path.contains(\"artists\")) {\r\n rootDataFile = new File(BASEDIR + \"/resources/data\" + endOfPath);\r\n } else {\r\n rootDataFile = new File(BASEDIR + \"/resources/data/artists\" + endOfPath);\r\n }\r\n\r\n File distTempFile = new File(path.substring(0, path.lastIndexOf(\"/\")) + \"/myTempFile.txt\");\r\n\r\n File rootTempFile;\r\n if (!path.contains(\"artists\")) {\r\n rootTempFile = new File(BASEDIR + \"/resources/data/myTempFile.txt\");\r\n } else {\r\n rootTempFile = new File(BASEDIR + \"/resources/data/artists/myTempFile.txt\");\r\n }\r\n \r\n try {\r\n BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(\r\n new FileOutputStream(distTempFile), \"UTF-8\"));\r\n\r\n for (String line : data) {\r\n bw.write(line);\r\n bw.newLine();\r\n }\r\n\r\n bw.close();\r\n distDataFile.delete();\r\n distTempFile.renameTo(distDataFile);\r\n\r\n BufferedWriter bw2 = new BufferedWriter(new OutputStreamWriter(\r\n new FileOutputStream(rootTempFile), \"UTF-8\"));\r\n\r\n for (String line : data) {\r\n bw2.write(line);\r\n bw2.newLine();\r\n }\r\n\r\n bw2.close();\r\n rootDataFile.delete();\r\n rootTempFile.renameTo(rootDataFile);\r\n } catch (IOException ex) {\r\n System.out.println(\"IOExceptoin in save1 : FileData\");\r\n }\r\n }","void saveSimpleCodesToFile() {\n\t\tPrintWriter writer;\r\n\t\ttry {\r\n\t\t\t//writer = new PrintWriter(pathStr + \"/../pt.iscte.pidesco.codegenerator/Settings/Code.cg\", \"UTF-8\");\r\n\t\t\twriter = new PrintWriter(\"Code.cg\", \"UTF-8\");\r\n\t\t\tfor (SimpleCode sc : SimpleCodeMap.values()) {\r\n\t\t\t\twriter.print(sc.getCodeName() + \"-CGSeparator-\" + sc.resultCodeToWrite());\r\n\t\t\t\twriter.print(\"-CGCodeSeparator-\");\r\n\t\t\t}\r\n\t\t\twriter.close();\r\n\t\t} catch (FileNotFoundException | UnsupportedEncodingException e) {\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t}","static void escribir(Planeta planeta_a_escribir) {\n if (escritor != null) {\n try {\n escritor.writeObject(planeta_a_escribir);\n \n } catch (IOException ex) {\n System.out.println(\"Error al escribir el archivo\");\n }\n }\n }","public static void main(String[] args) throws FileNotFoundException {\n\t\tListaNombre nombres = new ListaNombre();\n//\t\tnombres.add(new Nombre(\"guido\"));\n//\t\tnombres.add(new Nombre(\"guido\"));\n//\t\tnombres.add(new Nombre(\"guido\"));\n//\t\tnombres.add(new Nombre(\"juan\"));\n//\t\tnombres.add(new Nombre(\"juan\"));\n//\t\tnombres.add(new Nombre(\"daria\"));\n//\t\tnombres.add(new Nombre(\"daria\"));\n//\t\tnombres.add(new Nombre(\"pedro\"));\n//\t\tnombres.add(new Nombre(\"pedro\"));\n//\t\tnombres.add(new Nombre(\"pedro\"));\n//\t\tnombres.setCantRepetidos(3);\n//\t\tfor (Nombre nom : nombres.getNombres()) {\n//\t\t\tSystem.out.println(nom.getNombre() + \" \" + nom.getCant());\n//\t\t}\n\t\tnombres = ( Archivo.leer(\"C:\\\\Users\\\\guido\\\\eclipse-workspace\\\\DescubriendoNombresRepetidos\\\\premioA.in\"));\n\t\tArchivo.escribir(\"C:\\\\Users\\\\guido\\\\eclipse-workspace\\\\DescubriendoNombresRepetidos\\\\salida.out\",nombres);\n\t}","public void loadSave(){\n if((new File(\"data.MBM\")).exists()){\n isNew = false;\n\n try {\n BufferedReader br = new BufferedReader(new FileReader(\"data.MBM\"));\n String line = br.readLine();\n \n while (line != null) {\n \n if(line.contains(\"outDir\")){\n String[] result = line.split(\":\");\n outputDir = new File(result[1]);\n if(outputDir.exists() == false){\n isNew = true;\n }\n }\n else if(line.contains(\"MBMWORLD\")){\n String[] result = line.split(\":\");\n //1 = filename\n //2 = world name\n //3 = path\n //4 = date\n addWorld(new File(result[3]), result[2]);\n worlds.get(numWorlds()-1).setLastBackup(result[4]);\n }\n \n line = br.readLine();\n }\n \n br.close();\n \n } catch(IOException e){\n System.out.println(e);\n }\n }\n }","public void service_psy (Personne p) throws FileNotFoundException\r\n\t{\r\n\t\r\n\t\t\r\n\t\t \t\tString [] info_psy=null ;\r\n\t\t \t\tString [] cle_valeur=null;\r\n\t\t \t\tboolean spec,adr;\r\n\t\t \t\tFileInputStream f=new FileInputStream(\"C://Users/Azaiez Hamed/Desktop/workspace/Projet de programmation/src/Medecin.txt\");\r\n\t\t \t\ttry {\r\n\t\t \t\t\tBufferedReader reader =new BufferedReader (new InputStreamReader(f,\"UTF-8\"));\r\n\t\t \t\t\tString line=reader.readLine();\r\n\t\t \t\t\twhile(line!=null){\r\n\t\t \t\t\t\tinfo_psy=line.split(\"\\t\\t\\t\");\r\n\t\t \t\t\t\tspec=false;adr=false;\r\n\t\t \t\t\t\tfor(int i=0;i<info_psy.length;i++)\r\n\t\t \t\t\t\t{\r\n\t\t \t\t\t\t\t cle_valeur=info_psy[i].split(\":\");\r\n\t\t\t\t\t\t if ((cle_valeur[0].equals(\"specialite\"))&& (cle_valeur[1].equals(\"psy\")))\r\n\t\t\t\t\t\t \t spec=true;\r\n\t\t\t\t\t\t if ((cle_valeur[0].equals(\"gouvernerat\"))&&(cle_valeur[1].equals(p.getGouvernerat())))\r\n\t\t \t\t\t\t\t \tadr=true;\r\n\t\t\t\t\t\t}\r\n\t\t \t\t\t\tif (spec && adr) {\r\n\t\t \t\t\t\t\t System.out.println(\"voilà toutes les informations du psy, veuillez lui contacter immédiatement **\");\r\n\t\t \t\t\t\t\t System.out.println(line);return;}\r\n\t\t \t\t\t\telse\r\n\t\t \t\t\t\t line=reader.readLine();\r\n\t\t \t\t\t\t }\r\n\t\t \t\t }\r\n\t\t \t\t \tcatch(IOException e){e.printStackTrace();}\r\n\t\t \t\t System.out.println(\"Pas de psy trouvé dans votre gouvernerat\");\r\n\t}","private void validateFile(final boolean isRustica) {\n\t\thayErroresFilas = false;\r\n\t\thayErroresFila = false;\r\n\r\n\t\tcampoMasaCorrectos = true;\r\n\t\tcampoHojaCorrecto = true;\r\n\t\tcampoParecelaCorrecto = true;\r\n\t\tcampoTipoCorrecto = true;\r\n\t\tcampoFechaAltaCorrecto = true;\r\n\t\tcampoFechaBajaCorrecto = true;\r\n\r\n\t\tFile currentDirectory = (File) blackboard.get(ImportarUtils_LCGIII.LAST_IMPORT_DIRECTORY);\r\n\r\n\t\tGeopistaFiltroFicheroFilter filter = new GeopistaFiltroFicheroFilter();\r\n\t\tfilter.addExtension(\"SHP\");\r\n filter.setDescription(\"Shapefiles\");\r\n\t\t\r\n final JFileChooser jfc;\r\n final JTextField jtf;\r\n if (isRustica)\r\n {\r\n \tjfc = fcRustica;\t\r\n \tjtf = this.txtFicheroRustica;\r\n }\r\n\t\telse\r\n\t\t{\r\n\t\t\tjfc = fcUrbana;\r\n\t\t\tjtf = this.txtFicheroUrbana;\r\n\t\t}\r\n\t\t\t\t\r\n\t\t// FILES(*.*)\r\n jfc.setFileFilter(filter);\r\n \tjfc.setAcceptAllFileFilterUsed(false); // QUITA LA OPCION ALL\r\n\t\tjfc.setCurrentDirectory(currentDirectory);\r\n\t\t\r\n\t\tint returnVal = jfc.showOpenDialog(this);\r\n\t\tblackboard.put(ImportarUtils_LCGIII.LAST_IMPORT_DIRECTORY, jfc.getCurrentDirectory());\r\n\r\n\t\tif (returnVal == JFileChooser.APPROVE_OPTION)\r\n\t\t{\r\n\t\t\t// Cargamos el fichero que hemos obtenido\r\n\t\t\tString fichero;\r\n\t\t\tfichero = jfc.getSelectedFile().getPath();\r\n\t\t\tjtf.setText(fichero); // meto el fichero seleccionado\r\n\t\t\t// en el campo\r\n\r\n\t\t\tcadenaTexto = \"<font face=SansSerif size=3>\"\r\n\t\t\t\t+ aplicacion.getI18nString(\"ImportacionComenzar\") + \"<b>\" + \" \"\r\n\t\t\t\t+ jfc.getSelectedFile().getName() + \"</b>\";\r\n\t\t\t\r\n\t\t\tcadenaTexto = cadenaTexto + \"<p>\" + aplicacion.getI18nString(\"OperacionMinutos\") + \" ...</p></font>\";\r\n\t\t\tcadenaTexto = cadenaTexto + aplicacion.getI18nString(\"importar.datos.parcelas\");\r\n\r\n\t\t\tediError.setText(cadenaTexto);\r\n\t\t\tcadenaTexto=\"\";\r\n\r\n\t\t\tfinal TaskMonitorDialog progressDialog = \r\n\t\t\t\tnew TaskMonitorDialog(aplicacion.getMainFrame(), geopistaEditor.getContext().getErrorHandler());\r\n\r\n\t\t\tprogressDialog.setTitle(aplicacion.getI18nString(\"ValidandoDatos\"));\r\n\t\t\tprogressDialog.report(aplicacion.getI18nString(\"ValidandoDatos\"));\r\n\t\t\tprogressDialog.addComponentListener(new ComponentAdapter()\r\n\t\t\t{\r\n\t\t\t\tpublic void componentShown(ComponentEvent e)\r\n\t\t\t\t{\r\n\t\t\t\t\t// Wait for the dialog to appear before starting the\r\n\t\t\t\t\t// task. Otherwise\r\n\t\t\t\t\t// the task might possibly finish before the dialog\r\n\t\t\t\t\t// appeared and the\r\n\t\t\t\t\t// dialog would never close. [Jon Aquino]\r\n\t\t\t\t\tnew Thread(new Runnable()\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tpublic void run()\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\ttry\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tGeopistaLayer layerParcelas = (GeopistaLayer) blackboard.get(\"capaParcelasInfoReferencia\");\r\n\t\t\t\t\t\t\t\tif (layerParcelas != null)\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\tgeopistaEditor.getLayerManager().remove(layerParcelas);\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\tlayerParcelas = (GeopistaLayer) geopistaEditor.loadData(\r\n\t\t\t\t\t\t\t\t\t\tjfc.getSelectedFile().getAbsolutePath(),\r\n\t\t\t\t\t\t\t\t\t\taplicacion.getI18nString(\"importar.informe.parcelas\"));\r\n\t\t\t\t\t\t\t\tlayerParcelas.setActiva(false);\r\n\t\t\t\t\t\t\t\tlayerParcelas.addStyle(new BasicStyle(new Color(64, 64,64)));\r\n\t\t\t\t\t\t\t\tlayerParcelas.setVisible(false);\r\n\r\n\t\t\t\t\t\t\t\tif (isRustica)\r\n\t\t\t\t\t\t\t\t\tblackboard.put(\"capaParcelasInfoReferencia\", layerParcelas);\r\n\t\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t\t\tblackboard.put(\"capaParcelasInfoReferenciaUrbana\", layerParcelas);\r\n\r\n\t\t\t\t\t\t\t\t// Obtener el esquema\r\n\t\t\t\t\t\t\t\tFeatureSchema esquema = layerParcelas.getFeatureCollectionWrapper().getFeatureSchema();\r\n\r\n\t\t\t\t\t\t\t\t// Localizar los campos\r\n\t\t\t\t\t\t\t\tcampoMasaCorrectos = encontrarCampo(\"MASA\",esquema);\r\n\t\t\t\t\t\t\t\tcampoHojaCorrecto = encontrarCampo(\"HOJA\",esquema);\r\n\t\t\t\t\t\t\t\tcampoParecelaCorrecto = encontrarCampo(\"PARCELA\",esquema);\r\n\t\t\t\t\t\t\t\tcampoTipoCorrecto = encontrarCampo(\"TIPO\",esquema);\r\n\t\t\t\t\t\t\t\tcampoFechaAltaCorrecto = encontrarCampo(\"FECHAALTA\", esquema);\r\n\t\t\t\t\t\t\t\tcampoFechaBajaCorrecto = encontrarCampo(\"FECHABAJA\", esquema);\r\n\r\n\t\t\t\t\t\t\t\tif (campoMasaCorrectos \r\n\t\t\t\t\t\t\t\t\t\t&& campoHojaCorrecto\r\n\t\t\t\t\t\t\t\t\t\t&& campoParecelaCorrecto\r\n\t\t\t\t\t\t\t\t\t\t&& campoTipoCorrecto\r\n\t\t\t\t\t\t\t\t\t\t&& campoFechaAltaCorrecto\r\n\t\t\t\t\t\t\t\t\t\t&& campoFechaBajaCorrecto)\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t// A partir de aqui hay que\r\n\t\t\t\t\t\t\t\t\t// verificar que no hay nulos y es\r\n\t\t\t\t\t\t\t\t\t// del tipo correcto los valores.\r\n\t\t\t\t\t\t\t\t\tList listaLayer = layerParcelas.getFeatureCollectionWrapper().getFeatures();\r\n\t\t\t\t\t\t\t\t\tIterator itLayer = listaLayer.iterator();\r\n\r\n\t\t\t\t\t\t\t\t\twhile (itLayer.hasNext())\r\n\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\tif (hayErroresFila)\r\n\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t// break;\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\tFeature f = (Feature) itLayer.next();\r\n\t\t\t\t\t\t\t\t\t\tString masa = f.getString(\"MASA\");\r\n\t\t\t\t\t\t\t\t\t\tString hoja = f.getString(\"HOJA\");\r\n\t\t\t\t\t\t\t\t\t\tString parcela = f.getString(\"PARCELA\");\r\n\r\n\t\t\t\t\t\t\t\t\t\tString tipo = f.getString(\"TIPO\");\r\n\t\t\t\t\t\t\t\t\t\t// Comprobamos que no sea nulo y\r\n\t\t\t\t\t\t\t\t\t\t// sea una U o una R\r\n\t\t\t\t\t\t\t\t\t\tif ((!tipo.equals(\"U\"))\r\n\t\t\t\t\t\t\t\t\t\t\t\t&& (!tipo.equals(\"R\"))\r\n\t\t\t\t\t\t\t\t\t\t\t\t&& (!tipo.equals(\"D\"))\r\n\t\t\t\t\t\t\t\t\t\t\t\t&& (!tipo.equals(\"X\")))\r\n\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t// Solo puede haber una R \r\n\t\t\t\t\t\t\t\t\t\t\t// una U una D o una X.\r\n\t\t\t\t\t\t\t\t\t\t\tcadenaTexto = cadenaTexto\r\n\t\t\t\t\t\t\t\t\t\t\t+ aplicacion.getI18nString(\"importar.informe.parcelas.rustico\")\r\n\t\t\t\t\t\t\t\t\t\t\t+ masa\r\n\t\t\t\t\t\t\t\t\t\t\t+ hoja\r\n\t\t\t\t\t\t\t\t\t\t\t+ parcela\r\n\t\t\t\t\t\t\t\t\t\t\t+ aplicacion.getI18nString(\"importar.informe.parcelas.fin.rustico\");\r\n\t\t\t\t\t\t\t\t\t\t\thayErroresFila = true;\r\n\t\t\t\t\t\t\t\t\t\t\thayErroresFilas = true;\r\n\t\t\t\t\t\t\t\t\t\t\t// break;\r\n\t\t\t\t\t\t\t\t\t\t} \r\n\t\t\t\t\t\t\t\t\t\telse if (!isRustica && (tipo.equals(\"R\") || tipo.equals(\"D\") || tipo.equals(\"X\")))\r\n\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\tcadenaTexto = I18N.get(\"ImportadorParcelas\", \"importar.informe.parcelas.error.inicio.parcelario\")\r\n\t\t\t\t\t\t\t\t\t\t\t+ I18N.get(\"ImportadorParcelas\", \"importar.informacion.referencia.validacion.urbana\") + \r\n\t\t\t\t\t\t\t\t\t\t\tI18N.get(\"ImportadorParcelas\", \"importar.informe.parcelas.error.fin.parcelario\");\r\n\t\t\t\t\t\t\t\t\t\t\thayErroresFila = true;\r\n\t\t\t\t\t\t\t\t\t\t\thayErroresFilas = true;\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\telse if (isRustica && tipo.equals(\"U\"))\r\n\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\tcadenaTexto = I18N.get(\"ImportadorParcelas\", \"importar.informe.parcelas.error.inicio.parcelario\")\r\n\t\t\t\t\t\t\t\t\t\t\t+ I18N.get(\"ImportadorParcelas\", \"importar.informacion.referencia.validacion.rustica\") + \r\n\t\t\t\t\t\t\t\t\t\t\tI18N.get(\"ImportadorParcelas\", \"importar.informe.parcelas.error.fin.parcelario\");\r\n\t\t\t\t\t\t\t\t\t\t\thayErroresFila = true;\r\n\t\t\t\t\t\t\t\t\t\t\thayErroresFilas = true;\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t// Comprobamos que la fecha\r\n\t\t\t\t\t\t\t\t\t\t\t// que viene sea fecha\r\n\t\t\t\t\t\t\t\t\t\t\ttry\r\n\t\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t\tDateFormat formatter = new SimpleDateFormat(\"yyyyMMdd\");\r\n\t\t\t\t\t\t\t\t\t\t\t\tDate date = (Date) formatter.parse(f.getString(\"FECHAALTA\"));\r\n\t\t\t\t\t\t\t\t\t\t\t\t// Comprobamos que la\r\n\t\t\t\t\t\t\t\t\t\t\t\t// fecha de baja es nula\r\n\t\t\t\t\t\t\t\t\t\t\t\t// o valida o 9999999\r\n\t\t\t\t\t\t\t\t\t\t\t\tif (f.getString(\"FECHABAJA\").equals(\"99999999\"))\r\n\t\t\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t// Correcto\r\n\t\t\t\t\t\t\t\t\t\t\t\t\thayErroresFila = false;\r\n\t\t\t\t\t\t\t\t\t\t\t\t} \r\n\t\t\t\t\t\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tif ((f.getString(\"FECHABAJA\")) == null)\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\thayErroresFila = false;\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t} \r\n\t\t\t\t\t\t\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t// Comprobamos que sea una fecha correcta\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\ttry\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tDateFormat formatter1 = new SimpleDateFormat(\"yyyyMMdd\");\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tDate date1 = (Date) formatter1.parse(f.getString(\"FECHABAJA\"));\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t} \r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tcatch (Exception excp)\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\texcp.printStackTrace();\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\thayErroresFila = true;\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\thayErroresFilas = true;\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcadenaTexto = cadenaTexto\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t+ aplicacion.getI18nString(\"importar.informe.parcelas.fecha.baja\")\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t+ masa\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t+ hoja\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t+ parcela\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t+ aplicacion.getI18nString(\"importar.informe.parcelas.fin.rustico\");\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t// break;\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\t\t//jtf.setBorder(BorderFactory.createLineBorder(Color.GREEN, 2));\r\n\t\t\t\t\t\t\t\t\t\t\t\tif (isRustica)\r\n\t\t\t\t\t\t\t\t\t\t\t\t\trusticaValida = true;\r\n\t\t\t\t\t\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t\t\t\t\t\t\turbanaValida = true;\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t} \r\n\t\t\t\t\t\t\t\t\t\t\tcatch (Exception exc)\r\n\t\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\t\t// En la fecha de alta\r\n\t\t\t\t\t\t\t\t\t\t\t\tcadenaTexto = cadenaTexto\r\n\t\t\t\t\t\t\t\t\t\t\t\t+ aplicacion.getI18nString(\"importar.informe.parcelas.fecha.alta.validacion\")\r\n\t\t\t\t\t\t\t\t\t\t\t\t+ masa\r\n\t\t\t\t\t\t\t\t\t\t\t\t+ hoja\r\n\t\t\t\t\t\t\t\t\t\t\t\t+ parcela\r\n\t\t\t\t\t\t\t\t\t\t\t\t+ aplicacion.getI18nString(\"importar.informe.parcelas.fin.rustico\");\r\n\t\t\t\t\t\t\t\t\t\t\t\texc.printStackTrace();\r\n\t\t\t\t\t\t\t\t\t\t\t\thayErroresFila = true;\r\n\t\t\t\t\t\t\t\t\t\t\t\thayErroresFilas = true;\r\n\t\t\t\t\t\t\t\t\t\t\t\t// break;\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t//Se comprueba si la geometría es de tipo polygon y no es empty (únicas válidas en la capa parcelas)\r\n\t\t\t\t\t\t\t\t\t\t\tif (!(f.getGeometry() instanceof Polygon)\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t|| f.getGeometry().isEmpty())\r\n\t\t\t\t\t\t\t\t\t\t\t{\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\tcadenaTexto = I18N.get(\"ImportadorParcelas\", \"importar.informe.parcelas.error.inicio.parcelario\")\r\n\t\t\t\t\t\t\t\t\t\t\t\t+ I18N.get(\"ImportadorParcelas\", \"importar.informacion.referencia.validacion.geometria\") + \r\n\t\t\t\t\t\t\t\t\t\t\t\tI18N.get(\"ImportadorParcelas\", \"importar.informe.parcelas.error.fin.parcelario\");\r\n\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\thayErroresFila = true;\r\n\t\t\t\t\t\t\t\t\t\t\t\thayErroresFilas = true;\r\n\t\t\t\t\t\t\t\t\t\t\t}\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t} \r\n\t\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t// Alguno de los campos no están\r\n\t\t\t\t\t\t\t\t\t// definidos\r\n\t\t\t\t\t\t\t\t\t// JOptionPane.showMessageDialog(this,aplicacion.getI18nString(\"importar.informe.parcelas.algun.campo\"));\r\n\t\t\t\t\t\t\t\t\tcadenaTexto += aplicacion.getI18nString(\"importar.informacion.ficheros.no.correctos\");\r\n\t\t\t\t\t\t\t\t\thayErroresFilas = true;\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tif (isRustica)\r\n\t\t\t\t\t\t\t\t\t\trusticaValida = false;\r\n\t\t\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t\t\t\turbanaValida = false;\t\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t} \r\n\t\t\t\t\t\t\tcatch (Exception e)\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\thayErroresFilas = true;\r\n\t\t\t\t\t\t\t} \r\n\t\t\t\t\t\t\tfinally\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tprogressDialog.setVisible(false);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}).start();\r\n\t\t\t\t}\r\n\t\t\t});\r\n\t\t\t\r\n\t\t\tGUIUtil.centreOnWindow(progressDialog);\r\n\t\t\tprogressDialog.setVisible(true);\r\n\r\n\t\t\tif (hayErroresFilas)\r\n\t\t\t{\r\n\t\t\t\tjtf.setBorder(BorderFactory.createLineBorder(Color.RED, 2));\r\n\t\t\t\tcadenaTexto = cadenaTexto + aplicacion.getI18nString(\"validacion.finalizada\");\t\t\t\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tjtf.setBorder(BorderFactory.createLineBorder(Color.GREEN, 2));\r\n\t\t\t\tcadenaTexto = cadenaTexto + aplicacion.getI18nString(\"importar.informe.parcelas.fichero.correcto\")\r\n\t\t\t\t+ aplicacion.getI18nString(\"validacion.finalizada\");\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tediError.setText(cadenaTexto);\r\n\t\t\twizardContext.inputChanged();\r\n\t\t}\r\n\r\n\t}","public static void main(String[] args) {\n\r\n String cFields = \"NIC,SIMBOLO_VARIABLE,FECHA_VENCIMIENTO,FECHA_PAGO_OPORTUNO,FECHA_EMISION,NUMERO_FACTURA,INDICATIVO_SUMINISTRO,CIIU,TIPO_COBRO,SECUENCIAL_RECIBO,NIS,TIPO_SERVICIO,ORDEN_LECTURA,MEDIDOR,LECT_ANTERIOR,LECT_ACTUAL,FECHA_LECTURA_ACTUAL,CONSUMO_FACTURADO,VALOR_FACTURA,GRUPO_FAMILIAR,PRECIO_UNITARIO_CU,IND_VISUSALIZACION_BARCODI,IMPORTE_TOTAL_DEUDA,CANTIDAD_FACTURAS_ADEUDADAS,DESC_ANOMALIA_LECTURA,IMPORTE_TOTAL_FACTURA,SUBTOTAL_FACTURA,DESCRIPCION_TARIFA,CONSUMO_PROMEDIO,DIAS_FACTURADOS,CLAVE_ORDEN_FACTURA,PROPIEDAD_EQUIPO_MEDIDA,UNICOM,RUTA,ITINERARIO\";\r\n fields = cFields.split(\",\");\r\n\r\n readConfiguracion();\r\n\r\n if (configuracion.size() != fields.length) {\r\n System.out.println(\"Longitud de campos y configuración es diferente. Fields: \" + fields.length + \" Configuracion: \" + configuracion.size());\r\n Utilidades.AgregarLog(\"Longitud de campos y configuración es diferente. Fields: \" + fields.length + \" Configuracion: \" + configuracion.size());\r\n return;\r\n }\r\n\r\n if (configuracion.size() > 0) {\r\n System.out.println(\"Campos a leer: \" + configuracion.size());\r\n Utilidades.AgregarLog(\"Campos a leer: \" + configuracion.size());\r\n String ruta = \"C:\\\\REPARTO\\\\\";\r\n File directorio = new File(ruta);\r\n Utilidades.AgregarLog(\"Descomprimiendo archivos ruta:\" + ruta);\r\n DescomprimirArchivosCarpeta(directorio);\r\n Utilidades.AgregarLog(\"Procesando archivos de reparto en ruta:\" + ruta);\r\n ProcesarDirectorio(directorio);\r\n\r\n } else {\r\n System.out.println(\"No se ha cargado la configuracion\");\r\n Utilidades.AgregarLog(\"No se ha cargado la configuracion\");\r\n }\r\n\r\n }","public static void main(String[] args){\n File testFile = new File(args[1]);\n File testFile_new = new File(args[2]);\n String all = \"\";\n // read all data\n try {\n Scanner input = null;\n input = new Scanner(testFile);\n while (input.hasNext()){\n all += input.nextLine() + \"\\r\\n\";\n }\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n // print and replace\n System.out.println(all);\n all = all.replaceAll(args[0], \"\");\n // save to other file with replaced\n try{\n PrintWriter output = new PrintWriter(testFile_new);\n output.write(all);\n output.close();\n } catch (FileNotFoundException ex){\n ex.printStackTrace();\n }\n }","@Override\n public void incluir(Colaborador objeto)throws Exception {\n try {\n System.out.println(\"Estou Gravando no Arquivo\" + nomeDoArquivoNoDisco);\n FileWriter fw = new FileWriter(nomeDoArquivoNoDisco, true);\n //Criar o buffer do arquivo\n BufferedWriter bw = new BufferedWriter(fw);\n //Escreve no arquivo\n bw.write(objeto.toString() + \"\\n\");\n //Fechar o arquivo\n bw.close();\n } catch (Exception erro) {\n throw erro;\n }\n }","public void save() throws FileNotFoundException, IOException, ClassNotFoundException ;","public void guardarPuntaje() {\r\n\t\tFile archivo = new File(\"archivos/puntajes.txt\");\r\n\t\tBufferedWriter bw;\r\n\t\ttry {\r\n\t\t\tif (archivo.exists()) {\r\n\t\t\t\tFileWriter fw = new FileWriter(archivo, true);\r\n\t\t\t\tbw = new BufferedWriter(fw);\r\n\t\t\t\tbw.write(\"\\r\\n\"+jugadorActual.getNombre()+\"-\"+jugadorActual.getPuntaje());\t\t\t\t\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\tFileWriter fw = new FileWriter(archivo, true);\r\n\t\t\t\tbw = new BufferedWriter(fw);\r\n\t\t\t\tbw.write(jugadorActual.getNombre()+\"-\"+jugadorActual.getPuntaje());\r\n\t\t\t\t\r\n\t\t\t}\t\t\t\t\t\r\n\t\t\tbw.close();\r\n\t\t\t\r\n\t\t} catch (Exception e) {\r\n\t\t}\r\n\t}","static void inicializarentrada(){\n try {\n archivo_entrada= new FileInputStream(\"src/serializacion/salida.txt\");\n } catch (FileNotFoundException ex) {\n System.out.println(\"Error al abrir el archivo\");\n }\n \n try {\n lector= new ObjectInputStream(archivo_entrada);\n } catch (IOException ex) {\n System.out.println(\"Error al acceder al archivo\");\n }\n }","public void crearArchivoDeTexto(String rutas,String nombre, String texto){\n try{\n archivo = new File(rutas + File.separator + nombre);\n String rutaCompleta=archivo.getAbsolutePath();\n \n System.out.println(rutaCompleta);\n FileWriter archivoEscritura= new FileWriter(rutaCompleta,true);\n BufferedWriter escritura= new BufferedWriter(archivoEscritura);\n escritura.append(texto+\"\\n\");\n escritura.close();\n archivoEscritura.close();\n }catch(FileNotFoundException e1){\n System.out.println(\"Ruta de archivo no encontrada\");\n }catch(IOException e2){\n System.out.println(\"Error de escritura\");\n }catch(Exception e3){\n System.out.println(\"Error General\");\n }\n }","public void leerDeFichero() {\n try\n {\n Scanner sc = new Scanner(new File(\"texto.txt\"));\n while (sc.hasNextLine() && !textoCompleto())\n addFrase(sc.nextLine());\n sc.close();\n }\n catch (IOException e)\n {\n e.printStackTrace();\n }\n }","public void armarPreguntas(){\n preguntas = file.listaPreguntas(\"Preguntas.txt\");\n }","public void guardarGrafo(final String archivo) {\n\t\tPrintWriter salida = null;// !=BufferedReader\n\t\ttry {\n\n\t\t\tsalida = new PrintWriter(new FileWriter(archivo));\n\t\t\tsalida.println(cantNodos + \" \" + cantAristas + \" \" + porcentAdy + \" \" + grMax + \" \" + grMin);\n\t\t\tfor (int f = 0; f < cantNodos; f++) {\n\t\t\t\tfor (int c = f + 1; c < cantNodos; c++) {\n\t\t\t\t\tif (getValor(f, c) == true) {\n\t\t\t\t\t\tsalida.println((f + 1) + \" \" + (c + 1));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t} finally {\n\t\t\tsalida.close();\n\t\t}\n\t}","static void LeerArchivo(){ \r\n \t//iniciamos el try y si no funciona se hace el catch\r\n\r\n try{ \r\n \t//se crea un objeto br con el archivo de txt\r\n \tBufferedReader br = new BufferedReader( \r\n \tnew FileReader(\"reporte.txt\")\r\n );\r\n String s;\r\n //Mientras haya una linea de texto se imprime\r\n while((s = br.readLine()) != null){ \r\n System.out.println(s);\r\n }\r\n //se cierra el archivo de texto\r\n br.close(); \r\n } catch(Exception ex){\r\n \t//si no funciona se imprime el error\r\n System.out.println(ex); \r\n }\r\n }","static void cerrarSalida(){\n if (escritor!=null){\n try {\n escritor.close();\n } catch (IOException ex) {\n System.out.println(\"Error al cerrar el archivo\");\n }\n }\n }","private void updateFile(CrowdinFile _file) {\n String fileN = _file.getFile().getName();\n if (getLog().isDebugEnabled())\n getLog().debug(\"*** Initializing: \" + fileN);\n // Making sure the file is a master file and not a translation\n if (_file.getClass().equals(CrowdinFile.class)) {\n if (getLog().isDebugEnabled())\n getLog().debug(\"*** Init dir\");\n initDir(_file.getCrowdinPath());\n try {\n if (_file.getFile().exists()) {\n \n //escape special character before sync\n FileUtils.replaceCharactersInFile(_file.getFile().getPath(), \"config/special_character_processing.properties\", \"EscapeSpecialCharactersBeforeSyncFromCodeToCrowdin\");\n \n if (!getHelper().elementExists(_file.getCrowdinPath())) {\n if (getLog().isDebugEnabled())\n getLog().debug(\"*** Add file: \" + _file.getCrowdinPath());\n String result = getHelper().addFile(_file);\n if (result.contains(\"success\")) {\n getLog().info(\"File \" + fileN + \" created succesfully.\");\n initTranslations(_file);\n } else {\n getLog().warn(\"Cannot create file '\" + _file.getFile().getPath() + \"'. Reason:\\n\" + result);\n if (_file.isShouldBeCleaned()) {\n _file.getFile().delete();\n }\n }\n } else {\n if (getLog().isDebugEnabled()) {\n getLog().debug(\"*** Update file: \" + _file.getCrowdinPath());\n }\n String result = getHelper().updateFile(_file);\n System.out.println(result);\n if (result.contains(\"success\"))\n getLog().info(\"File \" + fileN + \" updated succesfully.\");\n else\n getLog().warn(\"Cannot update file '\" + _file.getFile().getPath() + \"'. Reason:\\n\" + result);\n if (_file.isShouldBeCleaned()) {\n _file.getFile().delete();\n }\n \n //remove escape special character before sync\n FileUtils.replaceCharactersInFile(_file.getFile().getPath(), \"config/special_character_processing.properties\", \"EscapeSpecialCharactersAfterSyncFromCodeToCrowdin\");\n \n }\n } else {\n if (getHelper().elementExists(_file.getCrowdinPath())) {\n if (getLog().isDebugEnabled())\n getLog().debug(\"*** Delete file: \" + _file.getCrowdinPath());\n String result = getHelper().deleteFile(_file);\n if (result.contains(\"success\"))\n getLog().info(\"File \" + fileN + \" deleted succesfully.\");\n else\n getLog().warn(\"Cannot delete file '\" + _file.getFile().getPath() + \"'. Reason:\\n\" + result);\n }\n }\n } catch (MojoExecutionException e) {\n getLog().error(\"Error while updating file '\" + _file.getFile().getPath() + \"'. Exception:\\n\" + e.getMessage());\n }\n }\n }","public static void fileEditor(String path, String search, String replace) {\t \t\n\t\t\ttry {\n\t\t\t\t File log= new File(path);\t \t\n\t\t\t FileReader fr = new FileReader(log);\n\t\t\t String s;\n\t\t\t String totalStr = \"\";\n\t\t\t try (BufferedReader br = new BufferedReader(fr)) {\n\t\t\t while ((s = br.readLine()) != null) { totalStr += s + \"\\n\"; }\t \n\t\t\t totalStr = totalStr.replaceAll(search, replace);\n\t\t\t FileWriter fw = new FileWriter(log);\n\t\t\t fw.write(totalStr);\n\t\t\t fw.close();\n\t\t\t }\n\t\t\t } catch(Exception e) { System.out.println(\"Problem reading file.\"); }\n\t\t\t}","public void writeFile() {\n\t\ttry {\n\t\t\tFile dir = Environment.getExternalStorageDirectory();\n\t\t\tFile myFile = new File(dir.toString() + File.separator + FILENAME);\n\t\t\tLog.i(\"MyMovies\", \"SeSus write : \" + myFile.toString());\n\t\t\tmyFile.createNewFile();\n\t\t\tFileOutputStream fOut = new FileOutputStream(myFile);\n\t\t\tOutputStreamWriter myOutWriter = \n\t\t\t\t\tnew OutputStreamWriter(fOut);\n\t\t\tfor (Map.Entry<String, ValueElement> me : hm.entrySet()) {\n\t\t\t\tString refs = (me.getValue().cRefMovies>0? \"MOVIE\" : \"\");\n\t\t\t\trefs += (me.getValue().cRefBooks>0? \"BOOK\" : \"\");\n\t\t\t\tString line = me.getKey() + DELIMITER + me.getValue().zweiteZeile \n\t\t\t\t\t\t //+ DELIMITER\n\t\t\t\t\t\t //+ me.getValue().count\n\t\t\t\t\t \t+ DELIMITER\n\t\t\t\t\t \t+ refs\n\t\t\t\t\t \t + System.getProperty(\"line.separator\");\n\t\t\t\t//Log.i(\"MyMovies\", \"SeSus extracted : \" + line);\n\t\t\t\tmyOutWriter.write(line);\n\t\t\t}\n\t\t\tmyOutWriter.close();\n\t\t\tfOut.close();\n\t\t} catch (IOException e) {\n\t\t\t//\n\t\t\tLog.i(\"MyMovies\", \"SeSus write Exception : \");\n\t\t\te.printStackTrace();\n\t\t}\n\t}","@Override\r\n\tpublic void remFile(String path) {\n\t\t\r\n\t}","void abreArquivo (String filetText, String fileData){\n //Abre e le o arquivo\n arquivo.abrirArquivo(filetText); //Le primeiro arquivo\n separaDados.salvaInstrucao (arquivo.arquivo, memoria); //Salva na memoria de texto\n\n arquivo.abrirArquivo(fileData); //Le arquivo de dados\n separaDados.salvaDados (arquivo.arquivo, memoria); //Armazena arquivo lido na memoria\n }","void writeToFile () throws IOException{\n FileWriter deleteFile = new FileWriter(\"Resolved Ticket of \" + this.resovedDate + \".txt\");\n BufferedWriter FileDeleted = new BufferedWriter(deleteFile);\n\n FileDeleted.write(\"Resolution: \" + this.Resolution + \" ; Date: \" + this.resovedDate);\n FileDeleted.close();\n }","public void mo210a(File file) {\n }","public void crearPrimerFichero(){\n File f=new File(getApplicationContext().getFilesDir(),\"datos.json\");\n // si no existe lo creo\n if(!f.exists()) {\n String filename = \"datos.json\";\n String fileContents = \"[]\";\n FileOutputStream outputStream;\n\n try {\n outputStream = openFileOutput(filename, Context.MODE_PRIVATE);\n outputStream.write(fileContents.getBytes());\n outputStream.close();\n } catch (Exception e) {\n e.printStackTrace();\n }\n }\n\n }","public void suppfichier(String chemin) {\n Path path = Paths.get(chemin);\n if (path.toFile().isDirectory()) { //si c'esst un dossier\n try (DirectoryStream<Path> listing = Files.newDirectoryStream(path)) {\n if (path != null) {\n for (Path nom : listing) { //parsourir les fichier et sou dossier\n if (!Files.isDirectory(nom)) {\n Files.delete(nom);\n } else {\n suppfichier(nom.toFile().getAbsolutePath());\n }\n }\n Files.delete(path);\n } else {\n Files.delete(path);\n }\n } catch (IOException e) {\n File file = new File(chemin);\n file.delete();\n }\n } else {\n File file = new File(chemin);\n file.delete();\n }\n }","private void abrirEntTransaccion(){\n try{\n entTransaccion = new ObjectInputStream(\n Files.newInputStream(Paths.get(\"trans.ser\")));\n }\n catch(IOException iOException){\n System.err.println(\"Error al abrir el archivo. Terminado.\");\n System.exit(1);\n }\n }","public void setWorldFile(File newFile) {\n File configDirectory = new File(newFile,CONFIG_DIRECTORY);\n configDirectory.mkdir();\n\n String configName = generalConfigFile.getPath();\n String generalConfigDirectoryName = generalConfigFile.getParentFile().getPath();\n String detailName = configName.substring(generalConfigDirectoryName.length()+1);\n //logger.info(\"Filename \"+detailName);\n File localConfigFile = new File(configDirectory,detailName);\n setWorldConfigFile(localConfigFile);\n }","public void save(File f) {\n\t\tif (f.exists()) {\r\n\t\t\tString filename = f.getName();\r\n\t\t\tString backName;\r\n\t\t\tif (filename.contains(\".\")) {\r\n\t\t\t\tbackName = filename.substring(0,filename.lastIndexOf('.'));\r\n\t\t\t\tbackName += \"_backup\";\r\n\t\t\t\tbackName += filename.substring(filename.lastIndexOf('.'));\r\n\t\t\t} else {\r\n\t\t\t\tbackName = filename + \"_backup\";\r\n\t\t\t}\r\n\t\t\tFile back = new File(f.getParent(),backName);\r\n\t\t\tSystem.out.println(\"Writing backup to: \"+back.getAbsolutePath());\r\n\t\t\tif (back.exists()) back.delete();\r\n\t\t\tFile newF = f;\r\n\t\t\tf.renameTo(back);\r\n\t\t\tf = newF;\r\n\t\t}\r\n\r\n\t\tFileOutputStream outputStream = null;\r\n\t\ttry {\r\n\t\t\tDocument doc = DocumentBuilderFactory.newInstance().newDocumentBuilder().newDocument();\r\n//\t\t\tb.append(\"<Map xmlns:xsi=\\\"http://www.w3.org/2001/XMLSchema-instance\\\" xsi:noNamespaceSchemaLocation=\\\"map.xsd\\\">\");\r\n//\t\t\tProcessingInstruction pi = doc.createProcessingInstruction(\"xml-stylesheet\", \"type=\\\"text/xsl\\\" href=\\\"/assistantdm/static/CharacterSheetTemplate.xsl\\\"\");\r\n//\t\t\tdoc.appendChild(pi);\r\n\t\t\tXMLMapExporter processor = new XMLMapExporter(doc);\r\n\t\t\tmapPanel.executeProcess(processor);\r\n\t\t\tdoc.setXmlStandalone(true);\r\n\r\n\t\t\tTransformer trans = TransformerFactory.newInstance().newTransformer();\r\n\t\t\ttrans.setOutputProperty(OutputKeys.INDENT, \"yes\");\r\n\t\t\ttrans.setOutputProperty(OutputKeys.ENCODING, \"UTF-8\");\r\n\t\t\ttrans.setOutputProperty(\"{http://xml.apache.org/xslt}indent-amount\", \"4\");\r\n\t\t\toutputStream = new FileOutputStream(f);\r\n\t\t\ttrans.transform(new DOMSource(doc), new StreamResult(outputStream));\r\n\t\t\tmapPanel.modified = false;\r\n\t\t} catch (Exception ex) {\r\n\t\t\tex.printStackTrace();\r\n\t\t} finally {\r\n\t\t\tif (outputStream != null) {\r\n\t\t\t\ttry {\r\n\t\t\t\t\toutputStream.close();\r\n\t\t\t\t} catch (IOException e1) {\r\n\t\t\t\t\te1.printStackTrace();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}","public void geraArquivoAjudaTextual(String caminho, String nomeArquivo, String texto) {\r\n\t\ttry {\r\n\t\t\tarquivoTexto = new File(caminho + \"\\\\\" + nomeArquivo);\r\n\t\t\tFileWriter fw = new FileWriter(arquivoTexto);\r\n\t\t\tPrintWriter pw = new PrintWriter(fw);\r\n\t\t\tpw.write(texto);\r\n\t\t\tfw.close();\r\n\t\t} catch (IOException e) {\r\n\t\t}\r\n\t}","private void guardar() {\n\t\t//JFileChooser fglobal = principal.getFglobal();\n\t\tprincipal.getFglobal().setDialogTitle(ic.buscar(38)); // Tag 38\n\n\t\t\tprincipal.getFglobal().setDialogType(JFileChooser.SAVE_DIALOG);\n\n\t\tAccesorio pep = new Accesorio(principal.getFglobal(),t, principal.getIC());\n\t\tprincipal.getFglobal().setAccessory(pep);\n\t\tpep.setProfundidad(true);\n\t\t\n principal.getFglobal().resetChoosableFileFilters();\n \n ExampleFileFilter filtroT = new ExampleFileFilter (\n new String [] {\"tiff\",\n \"tif\",\n },\n ic.buscar(3)); // Tag 3\n \n\n \n\t\t\t\n ExampleFileFilter filtroJ = new ExampleFileFilter (\n new String [] {\"jpeg\",\n \"jpg\"\n },\n ic.buscar(4)); // Tag 4\n principal.getFglobal().addChoosableFileFilter(filtroT);\n principal.getFglobal().addChoosableFileFilter(filtroJ);\n\t\t\n\t\t\n\t\t\n\t\tint retval = principal.getFglobal().showDialog(t, null);\n\t\tif (retval == JFileChooser.APPROVE_OPTION) \n\t\t{\t\t\n\t\t\tFile guardar = principal.getFglobal().getSelectedFile();\n \n\t\t\tif (\tprincipal.getFglobal().getFileFilter().getDescription().equals(filtroJ.getDescription()) )\n\t\t\t{// Guardar como JPEG\n \n\t\t\t\tJAI.create(\"filestore\",imagen_original,guardar.getPath(),\"JPEG\", new JPEGEncodeParam());\n\t\t\t}\n\t\t\telse if (principal.getFglobal().getFileFilter().getDescription().equals(filtroT.getDescription()))\n\t\t\t{// Guardar como TIFF\n\t\t\t\tint profundidad = pep.getEP().getMarcada();\n\t\t\t\t// Cubre todas las posibilidades (¿esto guarda los metadatos?)\n\t\t\t\tTiledImage tiled = null;\n\t\t\t\tif (profundidad != ElegirProfundidad.OCHO)\n\t\t\t\t{\n\t\t\t\t\ttiled = \n ElegirProfundidad.crearProfundidadReducida(\n ipixel_o, \n profundidad, \n imagen_original.getWidth(), \n imagen_original.getHeight());\n\t\t\t\t}\n\n\t\t\t\t//imgGuardar = djai.getSource();\n\t\t\t\tParameterBlock pb = new ParameterBlock();\n\t\t\t\tif (profundidad != ElegirProfundidad.OCHO)\n\t\t\t\t{\n\t\t\t\t\tpb.addSource(tiled);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tpb.addSource(imagen_original);\n\t\t\t\t}\n\t\t\t\tpb.add(guardar);\n\t\t\t\tpb.add(\"TIFF\");\n\t\t\t\tpb.add(false); //UseProperties\n\t\t\t\tpb.add(false); //Transcode\n\t\t\t\tpb.add(true); //VerifyOutput\n\t\t\t\tpb.add(false); //AllowPixelReplacement\n\t\t\t\tpb.add(null); //TileSize\n\t\t\t\tpb.add(streamData);\n\t\t\t\tpb.add(imageData);\n\t \t\t\tJAI.create(\"imagewrite\", pb);\n\t\t\t\t\n\t\t\t\t//JAI.create(\"imagewrite\",tiled,guardar.getPath(),\"TIFF\");\n\t\t\t}\n\t\t\telse\n\t\t\t{// No tiene extensión o es una extensión extraña\n\t\t\t\tJAI.create(\"imagewrite\",imagen_original,guardar.getPath()+\".tif\",\"TIFF\");\n\t\t\t}\n\t\t\t\n\t\t}\t\t\t \n\t\telse \n\t\t{\n\t\t\tdibujarMensajesError(retval);\n\t\t} \n\t\t\n\t\t\n\t}","public static void main(String[] args) {\n File myFile = new File (\"d:/names.txt\");\r\n // para saber si el archivo no existe, devuelve true o false\r\n System.out.println(\"file.exists(): \" + myFile.exists());\r\n System.out.println(\"file.isDirectory(): \" + myFile.isDirectory());\r\n // para saber la fecha de modificación\r\n System.out.println(\"file.lastModified(): \" + myFile.lastModified());\r\n // para saber el nombre del archivo\r\n System.out.println(\"file.getName(): \" + myFile.getName());\r\n // para saber la ruta\r\n System.out.println(\"file.getPath(): \" + myFile.getPath());\r\n // para saber el tamaño en bytes que ocupa en disco\r\n System.out.println(\"file.length(): \" + myFile.length()+\" bytes\");\r\n // para saber si es de lectura, devuelve true o false\r\n System.out.println(\"file.canRead():\" + myFile.canRead());\r\n\r\n //File newfolder = new File(\"D:/carpeta con archivos año mío\");\r\n //System.out.println(newfolder.mkdir());\r\n\r\n // si fuera un directorio, para saber los archivos que contiene\r\n File carpeta = new File(\"D:/carpeta_con_archivos\");\r\n System.out.println(\"----listado archivos D:/carpeta_archivos------\");\r\n for (String archivo : carpeta.list()) {\r\n System.out.println(archivo);\r\n }\r\n\r\n //agregar una linea nueva a un archivo existente (METODO 1)\r\n /*try {\r\n //abra el archivo , TRUE en un forma append (agregar nuevos valores)\r\n FileWriter myFile2 = new FileWriter(\"d:/names.txt\", true);\r\n //cargar en memora ram del SO el contenido del archivo\r\n BufferedWriter dataFile = new BufferedWriter(myFile2);\r\n //agregar una nueva linea\r\n dataFile.write(\"\\nnueva linea tres\");\r\n dataFile.close();\r\n\r\n } catch (IOException e) {\r\n e.printStackTrace();\r\n }*/\r\n //agregar una linea nueva a un archivo existente (METODO 1 optimizado)\r\n /*try{\r\n BufferedWriter dataFile = new BufferedWriter(new FileWriter(\"d:/names.txt\",true));\r\n //agregamos la nueva linea\r\n dataFile.write(\"nueva linea sin borrar\");\r\n dataFile.close();\r\n } catch (Exception e) {\r\n e.printStackTrace();\r\n }*/\r\n // agregar nueva linea con metodo super optimizado en lineas (METODO FLAHS)\r\n try{\r\n PrintWriter myFile3 = new PrintWriter(new BufferedWriter(new FileWriter(\"d:/names.txt\", true)));\r\n myFile3.println(\"Otra nueva línea mezclando las dos librerías (PrintWriter + FileWriter) \");\r\n myFile3.close();\r\n\r\n } catch (Exception e) {\r\n e.printStackTrace();\r\n }\r\n\r\n\r\n }","public AsociarArchivoSerializado(String nuevoMaest, String registro){\n try{\n salNuevoMaest = new ObjectOutputStream(\n Files.newOutputStream(Paths.get(nuevoMaest)));\n \n salRegistro = new ObjectOutputStream(\n Files.newOutputStream(Paths.get(registro)));\n }\n catch(IOException iOException){\n System.err.println(\"Error al abrir el archivo. Terminado.\");\n System.exit(1);\n }\n }","public void DesSerializar() throws FileNotFoundException {\n try {\n FileInputStream archivo = new FileInputStream(\"SerializacionEdificios\");\n ObjectInputStream entrada = new ObjectInputStream(archivo);\n ArrayList<Edificio> edificiosDes = (ArrayList<Edificio>) entrada.readObject();\n archivo = new FileInputStream(\"SerializacionEstudiantes\");\n entrada = new ObjectInputStream(archivo);\n ArrayList<Estudiante> estudiantesDes = (ArrayList<Estudiante>) entrada.readObject();\n archivo = new FileInputStream(\"SerializacionProfesores\");\n entrada = new ObjectInputStream(archivo);\n ArrayList<Profesor> profesoresDes = (ArrayList<Profesor>) entrada.readObject();\n archivo = new FileInputStream(\"SerializacionAdministradores\");\n entrada = new ObjectInputStream(archivo);\n ArrayList<Administrador> administradoresDes = (ArrayList<Administrador>) entrada.readObject();\n edificios = edificiosDes;\n estudiantes = estudiantesDes;\n profesores = profesoresDes;\n administradores = administradoresDes;\n entrada.close();\n }\n catch (IOException e){\n e.printStackTrace();\n }\n catch (ClassNotFoundException e){\n e.printStackTrace();\n }\n\n\n }","private BufferedWriter abrirArquivoEscrita() {\n\t\ttry{\n\t\t\tBufferedWriter file = null;\n\t\t\tfile = new BufferedWriter(new FileWriter(caminho));\n\t\t\treturn file;\n\t\t}catch(Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\treturn null;\n\t}","public void escribir(String cadena) throws IOException\n {\n fileWriter = new FileWriter(archivo);\n printWriter = new PrintWriter(fileWriter);\n printWriter.println(cadena);\n }","private static void saveTemplateFile(File file, Template newTemp) {\n String string = newTemp.toString();\n\n //Save File\n try {\n FileOutputStream fos = new FileOutputStream(file);\n fos.write(string.getBytes());\n fos.flush();\n fos.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n\n //Read back file and check against original.\n try {\n FileInputStream fis = new FileInputStream(file);\n byte[] data = new byte[(int)file.length()];\n\n fis.read(data);\n String tmpIN = new String(data,\"UTF-8\");\n Log.d(\"Behave\",\"Read Back Template: \"+ tmpIN);\n Log.d(\"Behave\",\"Template Saved Correctly: \"+tmpIN.equals(string));\n } catch (FileNotFoundException | UnsupportedEncodingException e) {\n e.printStackTrace();\n } catch (IOException e) {\n // Separate catch block for IOException because other exceptions are encapsulated by it.\n Log.e(\"Behave\", \"IOException not otherwise caught\");\n e.printStackTrace();\n }\n }","private void jButtonCreateInsexActionPerformed(java.awt.event.ActionEvent evt) {\n try {\n lstPerson = new ArrayList();\n Properties prop = new Properties();//почти тоже самое что ini файлы\n content = Files.readAllLines(Paths.get(PATH_FILE_SOURCE), Charset.forName(\"cp1251\"));\n String s = content.get(0);\n for (int i = 0, j = 1; i < s.length(); i += 128, j++) {\n Person p = new Person(\n s.substring(i, i + 30).trim(),\n s.substring(i + 30, i + 50).trim(),\n s.substring(i + 50, i + 70).trim(),\n s.substring(i + 70, i + 78).trim(),\n s.substring(i + 78).trim(), j);\n lstPerson.add(p);\n }\n\n for (Person person : lstPerson) {\n prop.put(person.getSurname().toUpperCase(), Integer.toString(person.getID()));\n }\n prop.storeToXML(new FileOutputStream(FILE_PATH_INDEX_SURNAME), \"LIB\");//можно и без xml\n jLabelStatusBar.setForeground(Color.magenta);\n jLabelStatusBar.setText(\"Индексный файл создан!\");\n jLabelStatusBar.setForeground(Color.BLACK);\n\n } catch (IOException ex) {\n jLabelStatusBar.setForeground(Color.red);\n jLabelStatusBar.setText(\"Индексный файл не создан!\");\n Logger.getLogger(NewJFrame1.class.getName()).log(Level.SEVERE, null, ex);\n }\n }","private static boolean writeStringToFile(java.io.File r6, java.lang.String r7) {\n /*\n if (r7 != 0) goto L_0x0004\n java.lang.String r7 = \"\"\n L_0x0004:\n r1 = 0\n r2 = 0\n java.io.File r4 = r6.getParentFile() // Catch:{ IOException -> 0x0020 }\n ensureDirectory(r4) // Catch:{ IOException -> 0x0020 }\n java.io.FileWriter r3 = new java.io.FileWriter // Catch:{ IOException -> 0x0020 }\n r3.<init>(r6) // Catch:{ IOException -> 0x0020 }\n r3.write(r7) // Catch:{ IOException -> 0x003c, all -> 0x0039 }\n r1 = 1\n if (r3 == 0) goto L_0x003f\n r3.close() // Catch:{ IOException -> 0x001d }\n r2 = r3\n L_0x001c:\n return r1\n L_0x001d:\n r4 = move-exception\n r2 = r3\n goto L_0x001c\n L_0x0020:\n r0 = move-exception\n L_0x0021:\n java.lang.String r4 = \"PluginNativeHelper\"\n java.lang.String r5 = \"error occurs while writing file\"\n com.tencent.component.utils.log.LogUtil.d(r4, r5, r0) // Catch:{ all -> 0x0030 }\n if (r2 == 0) goto L_0x001c\n r2.close() // Catch:{ IOException -> 0x002e }\n goto L_0x001c\n L_0x002e:\n r4 = move-exception\n goto L_0x001c\n L_0x0030:\n r4 = move-exception\n L_0x0031:\n if (r2 == 0) goto L_0x0036\n r2.close() // Catch:{ IOException -> 0x0037 }\n L_0x0036:\n throw r4\n L_0x0037:\n r5 = move-exception\n goto L_0x0036\n L_0x0039:\n r4 = move-exception\n r2 = r3\n goto L_0x0031\n L_0x003c:\n r0 = move-exception\n r2 = r3\n goto L_0x0021\n L_0x003f:\n r2 = r3\n goto L_0x001c\n */\n throw new UnsupportedOperationException(\"Method not decompiled: com.tencent.component.plugin.PluginNativeHelper.writeStringToFile(java.io.File, java.lang.String):boolean\");\n }","public void save(String newFilePath) {\r\n File deletedFile = new File(path);\r\n deletedFile.delete();\r\n path = newFilePath;\r\n File dataFile = new File(path);\r\n File tempFile = new File(path.substring(0, path.lastIndexOf(\"/\")) + \"/myTempFile.txt\");\r\n\r\n try {\r\n BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(\r\n new FileOutputStream(tempFile), \"UTF-8\"));\r\n\r\n for (String line : data) {\r\n bw.write(line);\r\n bw.newLine();\r\n }\r\n\r\n bw.close();\r\n dataFile.delete();\r\n tempFile.renameTo(dataFile);\r\n } catch (IOException ex) {\r\n System.out.println(\"IOException in save2 : FileData\");\r\n }\r\n }","public static void main(String[] args) {\n String filePath = \"C:\\\\Users\\\\Catalin\\\\Desktop\\\\fisierdecitit.txt\";\n\n try {\n //incarcarea fisierului in memoria programului cu ajutorul ob fileReader\n FileReader fileReader = new FileReader(filePath);\n //incepem citirea din fisier linie cu line cu ajutorul BufferedReader\n BufferedReader bufferedReader = new BufferedReader(fileReader);\n String text = bufferedReader.readLine();\n while (text != null) {\n System.out.println(\"Linia citita este: \" + text);\n String[] array = text.split(\" \");\n System.out.println(array.length);\n text = bufferedReader.readLine();\n\n }\n\n } catch (IOException e) {\n System.out.println(\"A aparut o eroare: \" + e.getMessage());\n }\n\n\n //invatam sa scriem intr un fisier\n String filePathToWrite = \"C:\\\\Users\\\\Catalin\\\\Desktop\\\\fisierdescris.txt\";\n try {\n FileWriter fileWriter = new FileWriter(filePathToWrite);\n BufferedWriter bufferedWriter = new BufferedWriter(fileWriter);\n String text = \"Mama lu' Ana nu are nici mere si nici pere.\";\n String text2 = \"smhjhdgfdsbfkdhj\";\n\n bufferedWriter.write(text2);\n bufferedWriter.newLine();\n bufferedWriter.write(text);\n bufferedWriter.flush();\n bufferedWriter.close();\n } catch (IOException e) {\n System.out.println(\"A aparut o exceptie: \" + e.getMessage());\n }\n\n\n }","public static void overwritePal() throws Exception {\n\n\t\tString fileName = PropertiesFile.getInstance().getProperty(\"input_qualifier\")+ Constants.PALETTE_FILE_EXTENSION;\n\t\tFile templateFile = new File(getFullyQualifiedFileName(\"cell\") +\"/\" + fileName );\n\n\t\tFile newPal = new File(getRISEInputFolder()+\"/\" + fileName );\n\n\t\tFileInputStream input = new FileInputStream(templateFile);\n\t\twriter(input, newPal);\n\t}","public void zerarSistema() {\r\n\t\tarquivo.clear();\r\n\t\tcriaRepositorio();\r\n\t}","@Override\n\tpublic void resolver() \n\t{\n\t\tPrintWriter sal = null;\n\t\ttry \n\t\t{\n\t\t\tsal = new PrintWriter(new File(salida));\n\t\t} \n\t\tcatch (FileNotFoundException e) \n\t\t{\n\t\t\tSystem.out.println(\"Ha ocurrido un error con el archivo de salida\");\n\t\t\tSystem.exit(1);\n\t\t}\n\t\tArrayList<ClaveValor> ninos = new ArrayList<ClaveValor>();\n\t\t//Este for es el for del archivo cuando voy leyendo los nombres.\n\t\tfor(String s : nombres)\n\t\t{\n\t\t\tClaveValor aux = new ClaveValor(s,1);\n\t\t\tif(ninos.contains(aux))\n\t\t\t\tninos.get(ninos.indexOf(aux)).valor++;\n\t\t\telse\n\t\t\t\tninos.add(aux);\n\t\t}\n\t\t//Ordeno las nombres de los ninos por repeticion.\n\t\tCollections.sort(ninos, new Comparator<Object>() {\n\t\t @Override\n\t\t public int compare(Object a1, Object a2) \n\t\t {\n\t\t return ((ClaveValor)a2).valor-((ClaveValor)a1).valor;\n\t\t }\n\t\t});\n\t\t\n\t\tfor(int i = 0; i<n && i < ninos.size(); i++)\n\t\t\tsal.println(ninos.get(i));\n\tsal.close();\n\t}","private void updateDatFile() {\n\t\tIOService<?> ioManager = new IOService<Entity>();\n\t\ttry {\n\t\t\tioManager.writeToFile(FileDataWrapper.productMap.values(), new Product());\n\t\t\tioManager = null;\n\t\t} catch (Exception ex) {\n\t\t\tDisplayUtil.displayValidationError(buttonPanel, StoreConstants.ERROR + \" saving new product\");\n\t\t\tioManager = null;\n\t\t}\n\t}","public void LecturaEscrituraOBjetosManual(File rutaEscribir) throws IOException {\n ObjectOutputStream escribir = new ObjectOutputStream(\n new BufferedOutputStream(\n new FileOutputStream(rutaEscribir)));\n\n Scanner read = new Scanner(System.in);\n System.out.println(\"¿Cuántas carteleras agregarás?\");\n //se ingresa cantidad de carteleras, para generar el array\n //se crea el array y se piden los datos de cada objeto\n //se agrega cada objeto al array y lo devuelve con la información rellenada\n Cartelera[] lista = Cartelera.listaCartelera(read.nextInt());\n\n //se escribe un array de cartelera. \n escribir.writeObject(lista);\n escribir.close();\n }","private void fecharArquivoLeitura(BufferedReader file) {\n\t\ttry {\n\t\t\tfile.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}","private void resetINIFile(){\n\tFileOutputStream outstream = null;\n System.out.println(\"do reset\");\n InputStream instream = brokenJavaNaming(\"UI.ini\");\n if (instream == null){\n System.out.println(\"instream null looking for UI.ini\");\n System.exit(1);\n }\n \n \ttry{\n \t File outfile = iniFile;\n \n \t outstream = new FileOutputStream(outfile);\n \n \t byte[] buffer = new byte[1024];\n \n \t int length;\n \t /*copying the contents from input stream to\n \t * output stream using read and write methods\n \t */\n \t while ((length = instream.read(buffer)) > 0){\n \t \toutstream.write(buffer, 0, length);\n \t }\n\n \t //Closing the input/output file streams\n \t instream.close();\n \t outstream.close();\n \t \n System.out.println(\"File copied successfully!!\");\n \n \t}catch(IOException ioe){\n \t\tioe.printStackTrace();\n \t }\n }","static void GuardarToken(int clase, String valor){\r\n try{\r\n String archivo;\r\n FileWriter fr;\r\n BufferedWriter br;\r\n\r\n archivo = \"token.txt\";\r\n fr = new FileWriter(archivo, true);\r\n br = new BufferedWriter(fr);\r\n\r\n br.write(clase + \" \" + valor);\r\n br.newLine();\r\n\r\n br.close();\r\n }\r\n catch(Exception e) {\r\n e.printStackTrace();\r\n }\r\n }","public void Horas() {\r\n File archivo = null;\r\n FileReader fr = null;\r\n BufferedReader br = null;\r\n \r\n try {\r\n // Apertura del fichero y creacion de BufferedReader para poder\r\n // hacer una lectura comoda (disponer del metodo readLine()).\r\n \r\n \r\n // Lectura del fichero\r\n String linea;\r\n \r\n for (a=0;a<5;a++){\r\n if (a==0){\r\n categoria=\"Embarazadas\";\r\n }\r\n if (a==1){\r\n categoria=\"Regulares\";\r\n }\r\n if (a==2){\r\n categoria=\"Discapacitados\";\r\n }\r\n if (a==3){\r\n categoria=\"Mayores\";\r\n }\r\n if (a==4){\r\n categoria=\"Corporativos\";\r\n }\r\n archivo = new File (System.getProperty(\"user.dir\")+\"/Clientes/\"+categoria+\".txt\");\r\n fr = new FileReader (archivo);\r\n br = new BufferedReader(fr);\r\n while((linea=br.readLine())!=null)\r\n if (leerHora == contador){\r\n comparar = linea.substring(0,2);\r\n \r\n if (\"09\".equals(comparar)){\r\n nueve++;\r\n }\r\n if (\"10\".equals(comparar)){\r\n diez++;\r\n }\r\n if (\"11\".equals(comparar)){\r\n once++;\r\n }\r\n if (\"13\".equals(comparar)){\r\n una++;\r\n }\r\n if (\"14\".equals(comparar)){\r\n dos++;\r\n }\r\n if (\"15\".equals(comparar)){\r\n tres++;\r\n }\r\n if (\"16\".equals(comparar)){\r\n cuatro++;\r\n }\r\n \r\n contador +=1;\r\n leerHora += 6;\r\n }\r\n else{\r\n contador += 1;\r\n }\r\n }\r\n }\r\n catch(Exception e){\r\n e.printStackTrace();\r\n }finally{\r\n // En el finally cerramos el fichero, para asegurarnos\r\n // que se cierra tanto si todo va bien como si salta \r\n // una excepcion.\r\n try{ \r\n if( null != fr ){ \r\n fr.close(); \r\n } \r\n }catch (Exception e2){ \r\n e2.printStackTrace();\r\n }\r\n }\r\n }","private String readAndReplaceString(String fileName, String packageName, String className) {\n String baseFilePath = \"com.bgn.baseframe.base\";\n\n String time = new SimpleDateFormat(\"yyyy-MM-dd HH:mm\").format(new Date());\n String path = (codeType == 0 ? \"kotlin/\" : \"java/\");\n return readFile(path + fileName + \".txt\")\n .replace(\"&time&\", time)\n .replace(\"&package&\", packageName)\n .replace(\"&mvp&\", baseFilePath)\n .replace(\"&className&\", className);\n }","public void Sauvegarder(Partie p) {\n if (SaveNum > 0 && SaveNum < 10) {\n //System.out.println(\"index ok\");\n try {\n if (erase) {\n slot[SaveNum - 1].delete();\n }\n //System.out.println(\"Try start\");\n //File f = new File(i + \".\" + p.getJoueur1().getNom() + \"-vs-\" + p.getJoueur2().getNom() + \".ser\");\n SaveName = (SaveNum - 1 + \"-\" + SaveName + \".ser\");\n File fichier = new File(SavePath + SaveName);\n FileOutputStream fos = new FileOutputStream(fichier);\n ObjectOutputStream oos = new ObjectOutputStream(fos);\n //System.out.println(\"ok\");\n oos.writeObject(p);\n //System.out.println(\"ok\");\n oos.close();\n //slot[i] = fichier;\n SaveName = \"Sauvegarde\";\n //System.out.println(\"Save Done\" + SaveNum);\n SaveNum = 20;\n } catch (IOException | NullPointerException e) {\n System.out.println(\"Erreur lors de la sauvegarde du fichier\");\n }\n }\n }","public void analizarArchivoDeLog(String nombreArchivo)\n {\n archivoLog.clear();\n try{\n File log = new File(nombreArchivo);\n Scanner sc = new Scanner(log);\n while (sc.hasNextLine()) {\n String linea = sc.nextLine();\n String[] arrayDeString = linea.split(\" \");\n archivoLog.add(new Acceso (Integer.parseInt(arrayDeString[0]),Integer.parseInt(arrayDeString[1]),Integer.parseInt(arrayDeString[2]),Integer.parseInt(arrayDeString[3]),Integer.parseInt(arrayDeString[4])));\n }\n sc.close();\n }\n\n catch (FileNotFoundException e){\n e.printStackTrace();\n }\n }","public void recevoirDossier() {\n try {\n fileInfo = (FileInfo) ois.readObject(); //lire les informations du fichier\n //chemin du fichier en sortie\n String outputFile = fileInfo.getDestinationDirectory() + fileInfo.getFilename();\n dstFile = new File(outputFile);\n if (!new File(fileInfo.getDestinationDirectory()).exists()) { //si le fichier n'existe pas\n new File(fileInfo.getDestinationDirectory()).mkdirs(); //creation du fichier\n fos = new FileOutputStream(dstFile);\n fos.write(fileInfo.getFileData()); //ecrire les données dans le fichier\n fos.flush();\n fileInfo.setFileData(null);\n System.gc();\n fos.close();\n dstFile.setLastModified(fileInfo.getModifier());\n\n } else if (dstFile.lastModified() < fileInfo.getModifier()) { //si le fichier existe et que c'est une nouvelle version alors\n fos = new FileOutputStream(dstFile);\n fos.write(fileInfo.getFileData());\n fos.flush();\n fileInfo.setFileData(null);\n fos.close();\n dstFile.setLastModified(fileInfo.getModifier());\n }\n } catch (IOException | ClassNotFoundException ex) {\n Logger.getLogger(RecevoirFichier.class.getName()).log(Level.SEVERE, null, ex);\n }\n }","@Override\n\tpublic void init() throws RemoteException {\n\t\ttry {\n\t\t\tFile f5 = new File(\"TxtData/warein.txt\");\n\t\t\tFileWriter fw5 = new FileWriter(f5);\n\t\t\tBufferedWriter bw1 = new BufferedWriter(fw5);\n\t\t\tbw1.write(\"\");\n\t\t} catch (Exception e) {\n\n\t\t}\n\t}","public static void genArchivoTokens(){\r\n\t\tString path = AnManager.getPath() + File.separator +\"Resultados Grupo81\" + File.separator+ \"Tokens.txt\";\r\n\t\tFile f = new File(path);\r\n\t\tf.getParentFile().mkdirs(); \r\n\t\ttry {\r\n\t\t\tf.delete(); //Eliminamos si existe algo antes\r\n\t\t\tf.createNewFile();\r\n\t\t} catch (IOException e) {\r\n\t\t\tJOptionPane.showMessageDialog(null, \"Fallo al crear archivo tokens\");\r\n\t\t}\r\n\t}","public void salvaAula()\n { \n JFileChooser fileChooser = new JFileChooser();\n String strFilePlan = \"out/\" + this.myAula.getNome()+ \"_plan\"+ \".png\";\n System.out.println(\"scrivo su file \"+ strFilePlan);\n File fp = new File(strFilePlan);\n String strFileDati = \"out/\" + this.myAula.getNome()+ \"_dati\"+ \".png\";\n File fd = new File(strFileDati);\n fileChooser.setSelectedFile(fd);\n try\n { \n ImageIO.write(this.getPlan(), \"png\", fp);\n ImageIO.write(this.getDati(), \"png\", fd);\n }\n catch (Exception ex)\n {\n System.out.println(\"errore in Salvataggio aula su file\");\n }\n \n JOptionPane.showMessageDialog(this, \"file salvati correttamente sotto cartella /out\",\"Info\", JOptionPane.INFORMATION_MESSAGE);\n }","final public void GuardarCuadruplos() throws ParseException {\ntry {\n // Crea un cuadro de dialogo. El input se guarda en strNomArchivo\n String strNomArchivo = \"\";\n\n // Si el campo quedo vacío o se cerró la ventana, volver a mostrarlo\n while (strNomArchivo==null || strNomArchivo.trim().isEmpty()) {\n strNomArchivo = (String)JOptionPane.showInputDialog(\n null, \"Escribe el nombre que tendra el archivo\", \"Input\", JOptionPane.PLAIN_MESSAGE, null, null, null);\n }\n\n // objeto printwriter con el nombre del archivo\n PrintWriter codigoObj = new PrintWriter(strNomArchivo);\n\n // Agrega uno por uno los cuadruplos al archivo\n for (int i=0; i < cuadruplos.size(); i++) {\n codigoObj.println( Cuadruplo.returnCuadruplo( (Cuadruplo)cuadruplos.get(i) ) );\n }\n\n // cierra el archivo\n codigoObj.close();\n\n } catch(FileNotFoundException e) {\n System.out.println(e.getMessage());\n }\n }","public void LoadTxt(File Arquivo) {\n if (Arquivo.exists()) {\r\n\r\n try {\r\n\r\n FileReader FR = new FileReader(Arquivo);\r\n BufferedReader BW = new BufferedReader(new InputStreamReader(new FileInputStream(Arquivo.getAbsolutePath()), \"ISO-8859-1\"));\r\n\r\n //BufferedReader BW = new BufferedReader(FR);\r\n\r\n String dados;\r\n String[] paraArray = new String[3];\r\n String matricula;\r\n \r\n String serie = Arquivo.getName();\r\n int pos = serie.lastIndexOf(\".\");\r\n if (pos > 0) {\r\n serie = serie.substring(0, pos);\r\n }\r\n\r\n Sala novaSala = new Sala(serie); //CRIANDO SALA COM NOME DE TURMA\r\n salas2.add(novaSala); // ADICIONANDO SALA NA LISTA DE SALAS\r\n while ((dados = BW.readLine()) != null) {\r\n paraArray = dados.split(\";\");\r\n\r\n matricula = /*Integer.parseInt*/ (paraArray[0]);\r\n //senha = /*Integer.parseInt*/(paraArray[2]);\r\n Dados novoDado = new Dados(matricula, paraArray[1], paraArray[2]);\r\n\r\n novoDado.setSerie(serie); //ADICIONANDO TURMA AO DADO\r\n novaSala.getDadosalas().add(novoDado); //ADICIONANDO DADOS A LISTA DE DADOS QUE ESTA EM SALA\r\n\r\n }\r\n \r\n\r\n BW.close();\r\n FR.close();\r\n\r\n } catch (Exception e) {\r\n System.out.println(\"Erro ao carregar arquivo acima\");\r\n System.out.println(e.getMessage());\r\n\r\n }\r\n\r\n } else {\r\n System.out.println(\"Nenhum arquivo de dados encontrado\");\r\n }\r\n\r\n }","private void cerrarSalRegistro(){\n try{\n if(salRegistro != null)\n salRegistro.close();\n }\n catch(IOException iOException){\n System.err.println(\"Error al cerrar el archivo. Terminado.\");\n System.exit(1);\n }\n }","public void gerarCupom(String cliente, String vendedor,List<Produto> produtos, float totalVenda ) throws IOException {\r\n \r\n File arquivo = new File(\"cupomFiscal.txt\");\r\n String produto =\" \"; \r\n if(arquivo.exists()){\r\n System.out.println(\"Arquivo localizado com sucessso\");\r\n }else{\r\n System.out.println(\"Arquivo não localizado, será criado outro\");\r\n arquivo.createNewFile();\r\n } \r\n \r\n for(Produto p: produtos){\r\n produto += \" \"+p.getQtd()+\" \"+ p.getNome()+\" \"+p.getMarca()+\" \"+ p.getPreco()+\"\\n \";\r\n }\r\n \r\n \r\n \r\n FileWriter fw = new FileWriter(arquivo, true);\r\n BufferedWriter bw = new BufferedWriter(fw);\r\n \r\n \r\n bw.write(\" \"+LOJA);\r\n bw.newLine();\r\n bw.write(\"---------------------------------------\");\r\n bw.newLine();\r\n bw.write(\"CLIENTE CPF\");\r\n bw.newLine();\r\n bw.write(cliente);\r\n bw.newLine();\r\n bw.write(\"---------------------------------------\");\r\n bw.newLine();\r\n bw.write(DateCustom.dataHora());\r\n bw.newLine();\r\n bw.write(\" CUPOM FISCAL \");\r\n bw.newLine();\r\n bw.write(\"QTD DESCRIÇÃO PREÇO\");\r\n bw.newLine();\r\n bw.write(produto);\r\n bw.newLine(); \r\n bw.write(\"---------------------------------------\");\r\n bw.newLine();\r\n bw.write(\"TOTAL R$ \" + totalVenda);\r\n bw.newLine();\r\n bw.write(\"---------------------------------------\");\r\n bw.newLine();\r\n bw.write(\"Vendedor \" + vendedor);\r\n bw.newLine();\r\n bw.newLine();\r\n bw.close();\r\n fw.close();\r\n }","private boolean renomeiaArquivo(File origem, File destino)\n\t{\n\t\t// Tenta executar o renameTo da classe File. Caso o destino seja em filesystem diferente entao\n\t\t// este comando ira falhar, portanto realiza a copia do arquivo, executa o delete para entao\n\t\t// retornar a funcao\n\t\tboolean renomeou = origem.renameTo(destino);\n\t\t// Se o comando falhou entao tenta copiar e apagar o arquivo\n\t\tif (!renomeou)\n\t\t{\n\t\t\trenomeou = copiaArquivo(origem,destino);\n\t\t\t// Caso tenha conseguido copiar o arquivo origem para o destino, entao remove o arquivo\n\t\t\t// origem. Simulacao do move.\n\t\t\tif (renomeou)\n\t\t\t\trenomeou = origem.delete();\n\t\t}\n\t\treturn renomeou;\n\t}"],"string":"[\n \"public void pruebaEscritura() {\\n\\t\\tFileWriter fichero = null;\\n\\t\\tPrintWriter pw = null;\\n\\t\\ttry {\\n\\t\\t\\tfichero = new FileWriter(\\\"//172.16.1.141/Modelo_Raster/Varios/Monitoreo_Forestal/REDD/Metadatos/test.xml\\\");\\n\\t\\t\\tpw = new PrintWriter(fichero);\\n\\n\\t\\t\\tfor (int i = 0; i < 10; i++)\\n\\t\\t\\t\\tpw.println(\\\"Linea \\\" + i);\\n\\n\\t\\t}\\n\\t\\tcatch (Exception e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\tfinally {\\n\\t\\t\\ttry {\\n\\t\\t\\t\\t// Nuevamente aprovechamos el finally para\\n\\t\\t\\t\\t// asegurarnos que se cierra el fichero.\\n\\t\\t\\t\\tif (null != fichero) fichero.close();\\n\\t\\t\\t}\\n\\t\\t\\tcatch (Exception e2) {\\n\\t\\t\\t\\te2.printStackTrace();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"@Override\\n\\tpublic void salvaSuFile() {\\n\\t\\tString path = \\\"alimenti.txt\\\";\\n\\t\\tString allergeni = Alimento.getStringaAllergeni(getElencoAllergeni());\\n\\t\\ttry {\\n\\t\\t\\tFile file = new File(path);\\n\\t\\t\\tFileWriter fw = new FileWriter(file, true);\\n\\t\\t\\tBufferedWriter bw = new BufferedWriter(fw);\\n\\t\\t\\tbw.write(getNome() + \\\" - \\\" + getPrezzo() + \\\"€\\\\n\\\");\\n\\t\\t\\tbw.write(\\\"Adatto a vegani: \\\" + (getVegano() ? \\\"sì\\\\n\\\" : \\\"no\\\\n\\\"));\\n\\t\\t\\tbw.write(\\\"Adatto a vegetariani: \\\" + (getVegetariano() ? \\\"sì\\\\n\\\" : \\\"no\\\\n\\\"));\\n\\t\\t\\tbw.write(\\\"Tipologia: \\\" + getTipoPortata().getNome().toUpperCase() + \\\"\\\\n\\\");\\n\\t\\t\\tbw.write(\\\"Cottura: \\\" + getTipoCottura().getNome().toUpperCase() + \\\"\\\\n\\\");\\n\\t\\t\\tbw.write(\\\"Allergeni: \\\" + (allergeni.isEmpty() ? \\\"--\\\" : allergeni) + \\\"\\\\n\\\\n\\\");\\n\\t\\t\\tbw.flush();\\n\\t\\t\\tbw.close();\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t}\",\n \"public void salvaPartita(String file) {\\n\\r\\n }\",\n \"private static void createFileContribuicaoUmidade() throws IOException{\\r\\n\\t\\tInteger contribuicaoDefault = 0;\\r\\n\\t\\tarqContribuicaoUmidade = new File(pathContribuicaoUmidade);\\r\\n\\t\\tif(!arqContribuicaoUmidade.exists()) {\\r\\n\\t\\t\\tarqContribuicaoUmidade.createNewFile();\\r\\n\\t\\t\\tFileWriter fw = new FileWriter(getArqContribuicaoUmidade());\\r\\n\\t\\t\\tBufferedWriter buffWrite = new BufferedWriter(fw);\\r\\n\\t\\t\\tbuffWrite.append(contribuicaoDefault.toString() + String.valueOf('\\\\n'));\\r\\n\\t\\t\\tbuffWrite.close();\\r\\n\\t\\t}else {//Se arquivo existir\\r\\n\\t\\t\\tFileReader fr = new FileReader(getArqContribuicaoUmidade());\\r\\n\\t\\t\\tBufferedReader buffRead = new BufferedReader(fr);\\r\\n\\t\\t\\tif(!buffRead.ready()) {/*Se o arquivo se encontar criado mas estiver vazio(modificado)*/\\r\\n\\t\\t\\t\\tFileWriter fw = new FileWriter(arqContribuicaoUmidade);\\r\\n\\t\\t\\t\\tBufferedWriter buffWrite = new BufferedWriter(fw);\\r\\n\\t\\t\\t\\tbuffWrite.append(contribuicaoDefault.toString() + String.valueOf('\\\\n'));/*Inicializa o arquivo com uma contribuicao Inicial*/\\r\\n\\t\\t\\t\\tbuffWrite.close();\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tbuffRead.close();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public void arquivoSaida() {\\r\\n\\r\\n try {\\r\\n File file = new File(\\\"arquivoSaida.txt\\\");\\r\\n try (FileWriter arquivoSaida = new FileWriter(file, true)) {\\r\\n arquivoSaida.write(\\\"Rota do menor caminho entre as cidades escolhidas: \\\\n\\\\n\\\");\\r\\n Vertice v;\\r\\n \\r\\n //Escreve no arquivo a rota de ida de entrega nas cidades\\r\\n for (int i = 0; i < rota.getLista_de_rota().size() - 1; i++) {\\r\\n for (int j = 0; j < rota.getLista_de_rota().get(i).size(); j++) {\\r\\n v = rota.getLista_de_rota().get(i).get(j);\\r\\n arquivoSaida.write(v.getId() + \\\"; \\\");\\r\\n }\\r\\n }\\r\\n \\r\\n arquivoSaida.write(\\\"\\\\n\\\\nRota do menor caminho de volta: (Considerando que não há mais nenhuma entrega)\\\\n\\\\n\\\");\\r\\n // pegando a ultima posição da lista geral em que está a lista do menor caminho de volta\\r\\n int t = rota.getLista_de_rota().size() - 1; \\r\\n \\r\\n //Escreve a rota do caminho de volta, verificando a distancia entre a cidade origem e a cidade destino\\r\\n for (int j = rota.getLista_de_rota().get(t).size() - 1; j >= 0; j--) {\\r\\n v = (Vertice) rota.getLista_de_rota().get(t).get(j);\\r\\n arquivoSaida.write(v.getId() + \\\"; \\\");\\r\\n }\\r\\n arquivoSaida.write(\\\"Distancia percorrida: \\\"+rota.getDistancia()+\\\"\\\\n\\\");\\r\\n arquivoSaida.close();\\r\\n }\\r\\n } catch (IOException ex) { //caso nao seja possivel abrir algum dos arquivos\\r\\n System.out.println(\\\"Não foi possivel abrir arquivo\\\");\\r\\n }\\r\\n }\",\n \"public void importaRegole(String file, ArrayList<Sensore> listaSensori, ArrayList<Attuatore> listaAttuatori) {\\n ArrayList<String> nomiDispPres = new ArrayList<>();\\n\\n for (Sensore s : listaSensori) {\\n nomiDispPres.add(s.getNome());\\n }\\n\\n for (Attuatore att : listaAttuatori) {\\n nomiDispPres.add(att.getNome());\\n }\\n\\n String regoleImport = readFromFile(file);\\n\\n if (regoleImport.equals(\\\"\\\")) {\\n System.out.println(\\\"XX Errore di lettura file. Non sono state inserite regole per l'unita immobiliare XX\\\\n\\\");\\n return;\\n }\\n\\n String[] regole = regoleImport.split(\\\"\\\\n\\\");\\n\\n for (String r : regole) {\\n try {\\n ArrayList<String> dispTrovati = verificaCompRegola(r);\\n\\n for (String nomeDis : dispTrovati) {\\n if (nomeDis.contains(\\\".\\\")){\\n String nomeS = nomeDis.split(\\\"\\\\\\\\.\\\")[0];\\n\\n if (!nomiDispPres.contains(nomeS)) {\\n throw new Exception(\\\"XX Dispositivi Incompatibili all'interno della regola XX\\\\n\\\");\\n }\\n\\n Sensore s = listaSensori.stream().filter(sensore -> sensore.getNome().equals(nomeS)).iterator().next();\\n String nomeInfo = nomeDis.split(\\\"\\\\\\\\.\\\")[1];\\n\\n if (s.getInformazione(nomeInfo) == null)\\n throw new Exception(\\\"XX Regola non compatibile XX\\\\n\\\");\\n\\n\\n } else if (!nomiDispPres.contains(nomeDis)) {\\n throw new Exception(\\\"XX Dispositivi Incompatibili all'interno della regola XX\\\\n\\\");\\n\\n }\\n }\\n System.out.println(\\\"*** Importazione della regola avvenuta con successo ***\\\\n\\\");\\n writeRuleToFile(r, true);\\n\\n } catch (Exception e) {\\n System.out.println(e.getMessage());\\n }\\n\\n }\\n eliminaDoppie(listaSensori,listaAttuatori);\\n }\",\n \"public static void RT() {////cada clase que tiene informacion en un archivo txt tiene este metodo para leer el respectivo archivoy guardarlo en su hashmap\\n\\t\\treadTxt(\\\"peliculas.txt\\\", pelisList);\\n\\t}\",\n \"void changeFile()\\n {\\n App app = new App();\\n // Loop through the read File\\n for (String s : readFile) {\\n if (app.containsUtilize(s)) {\\n // Changes the first use of utilize with use\\n String newTemp = s.replaceFirst(\\\"utilize\\\", \\\"use\\\");\\n // Writes to file\\n this.writeFile.add(newTemp);\\n } else {\\n // not utilize\\n this.writeFile.add(s);\\n }\\n }\\n }\",\n \"public void abrirArchivo() {\\r\\n try {\\r\\n entrada = new Scanner(new File(\\\"estudiantes.txt\\\"));\\r\\n } // fin de try\\r\\n catch (FileNotFoundException fileNotFoundException) {\\r\\n System.err.println(\\\"Error al abrir el archivo.\\\");\\r\\n System.exit(1);\\r\\n } // fin de catch\\r\\n }\",\n \"public void Leer() throws FileNotFoundException\\n {\\n // se crea una nueva ruta en donde se va a ir a leer el archivo\\n String ruta = new File(\\\"datos.txt\\\").getAbsolutePath(); \\n archivo=new File(ruta); \\n }\",\n \"String prepareFile();\",\n \"public void FermerAgd() {\\n //on essaye d'ouvrir un fichier dans lequel enregistrer le contenu de l'agenda\\n try {\\n Formatter agd_a_enreg = new Formatter(\\\"C:\\\\\\\\Projet_Agenda_ING3\\\\\\\\saved_agendas\\\");\\n\\n for (RdV el : this.getAgenda()) {\\n //on enregistre 1 rdv par ligne\\n //faire gaffe aux formats : %..\\n agd_a_enreg.format(\\\"%s/%s/%s de %s a %s : %s , %s\\\\n\\\",\\n el.getDate().getDayOfMonth(), el.getDate().getMonthValue(),\\n el.getDate().getYear(), el.getHdebut(),\\n el.getHfin(), el.getLibelle(), el.getRappel());\\n //on supprime le rdv de l'arraylist d'agenda \\n this.suppressionRdV(el);\\n }\\n //on ferme le fichier en ecriture\\n agd_a_enreg.close();\\n //on met l'attribut agenda à null une fois qu'il est \\\"vidé\\\"\\n this.agd = null;\\n } //en cas de probleme dans l'ouverture du fichier on affiche une erreur\\n catch (Exception e) {\\n System.out.print(\\\"Erreur d'ouverture du fichier en ecriture\\\\n\\\");\\n }\\n\\n }\",\n \"public void remFile(){\\n ((MvwDefinitionDMO) core).remFile();\\n }\",\n \"private void removeContentsFromFile() {\\n Log.d(\\\"debugMode\\\", \\\"deleting entire file contents...\\\");\\n try {\\n FileOutputStream openFileInput = openFileOutput(\\\"Locations.txt\\\", MODE_PRIVATE);\\n PrintWriter printWriter = new PrintWriter(openFileInput);\\n printWriter.print(\\\"\\\");\\n printWriter.close();\\n Log.d(\\\"debugMode\\\", \\\"deleting entire file contents successful\\\");\\n } catch (FileNotFoundException e) {\\n e.printStackTrace();\\n }\\n }\",\n \"protected void fileSet() throws IOException {\\n//\\t\\tfos = new FileOutputStream(outFile, false);\\n//\\t\\tdos = new DataOutputStream(fos);\\n\\t\\trealWriter = new BufferedWriter(new FileWriter(outFile.getAbsolutePath()));\\n\\t}\",\n \"private void guardarComo() {\\r\\n\\t\\tJFileChooser guardar = new JFileChooser();\\r\\n\\t\\tFileNameExtensionFilter filtro = new FileNameExtensionFilter(\\\"obj\\\",\\\"obj\\\");\\r\\n\\t\\tguardar.setFileFilter(filtro);\\r\\n\\t\\tif(guardar.showSaveDialog(guardar) == JFileChooser.APPROVE_OPTION){\\r\\n\\t\\t\\tGestion.setFichero(Gestion.extensionValida(guardar.getSelectedFile()));\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\tif(!Gestion.existe(Gestion.getFichero())){\\r\\n\\t\\t\\t\\t\\tGestion.escribir(Gestion.getFichero());\\r\\n\\t\\t\\t\\t\\tGestion.setModificado(false);\\r\\n\\t\\t\\t\\t\\tfrmLigaDeFtbol.setTitle(Gestion.getFichero().getName());\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse{\\r\\n\\t\\t\\t\\t\\tswitch(JOptionPane.showConfirmDialog(null, \\\"El archivo existe. Desea sobreescribirlo?\\\", \\\"Aviso\\\", JOptionPane.WARNING_MESSAGE)){\\r\\n\\t\\t\\t\\t\\tcase JOptionPane.OK_OPTION:\\r\\n\\t\\t\\t\\t\\t\\tGestion.escribir(Gestion.getFichero());\\r\\n\\t\\t\\t\\t\\t\\tGestion.setModificado(false);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfrmLigaDeFtbol.setTitle(Gestion.getFichero().getName());\\r\\n\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t} catch (IOException e) {\\r\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(null, e.getMessage(), \\\"Error\\\", JOptionPane.ERROR_MESSAGE);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public void OuvrirAgd() {\\n //on charge l'agenda à partir d'un fichier en lecture\\n try {\\n File agd_a_lire = new File(\\\"C:\\\\\\\\Projet_Agenda_ING3\\\\\\\\saved_agendas\\\");\\n Scanner sc = new Scanner(agd_a_lire);\\n\\n //on lit le fichier ligne par ligne\\n /*while (sc.) {\\n\\n }*/\\n\\n sc.close();\\n } catch (Exception e) {\\n System.out.print(\\\"Erreur d'ouverture du fichier en lecture\\\\n\\\");\\n }\\n }\",\n \"public void apagarFicheiro(String s) {\\r\\n\\t\\tFile f = new File(s + \\\".dat\\\");\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tif (f.exists()) {\\r\\n\\t\\t\\t\\tf.delete();\\r\\n\\t\\t\\t}\\r\\n\\t\\t} catch (Exception e) {\\r\\n\\t\\t\\t//\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public void EliminarArchivos(){\\n\\t\\ttry{\\n\\t\\tFile Delete = new File(\\\"Cod.txt\\\");\\n\\t\\tDelete.deleteOnExit();\\n\\t\\tFile Borrar = new File(\\\"Maq.txt\\\");\\n\\t\\tBorrar.deleteOnExit();\\n\\t\\tFile eliminar = new File(\\\"WS.txt\\\");\\n\\t\\teliminar.deleteOnExit();\\n\\t\\tFile Bye = new File(\\\"RESPALDO.txt\\\");\\n\\t\\tBye.deleteOnExit();\\n\\t\\t\\tBufferedReader numero= new BufferedReader(new FileReader(\\\"WS.txt\\\"));\\n\\t\\t\\tString valor = numero.readLine();\\n\\t\\t\\tint NumAreas= Integer.valueOf(valor);\\n\\t\\t\\tfor(int i=0; i< NumAreas;i++){\\n\\t\\t\\t\\tvalor= numero.readLine();\\n\\t\\t\\t\\tFile eliminas = new File(\\\"WS\\\"+valor+\\\".txt\\\");\\n\\t\\t\\t\\teliminas.deleteOnExit();\\n\\t\\t\\t}\\n\\t\\t\\tnumero.close();\\n\\t\\t}catch(IOException e){\\n\\t\\t\\tSystem.out.println(\\\"File not found\\\");\\n\\t\\t}\\n\\t}\",\n \"public void disabilitaRegolaConDispositivo(String nomeDispositivo) {\\n String[] regole = readRuleFromFile().split(\\\"\\\\n\\\");\\n for (String s : regole) {\\n try {\\n ArrayList<String> disps = verificaCompRegola(s);\\n\\n if (disps.contains(nomeDispositivo)) {\\n cambiaAbilitazioneRegola(s,false);\\n }\\n\\n } catch (Exception e) {\\n String msg = e.getMessage();\\n }\\n\\n if (s.contains(nomeDispositivo)) {\\n cambiaAbilitazioneRegola(s, false);\\n }\\n }\\n }\",\n \"private void cargarFichero() throws FileNotFoundException {\\n\\t\\tFile miFichero = new File(NOMBRE_FICHERO);\\n\\t\\tFileWriter erroresFichero;\\n\\t\\t\\n\\t\\tScanner in = new Scanner(miFichero);\\n\\t\\t\\n\\t\\tEjercicio nuevoEjer;\\n\\t\\tString siguienteLinea;\\n\\t\\tComprobadorEntradaFichero comprobador = new ComprobadorEntradaFichero();\\n\\t\\tString errores = \\\"\\\";\\n\\t\\tint numLinea = 1;\\n\\t\\t\\n\\t\\twhile (in.hasNextLine()) {\\n\\t\\t\\t\\n\\t\\t\\tsiguienteLinea = in.nextLine();\\n\\t\\t\\tif (comprobador.test(siguienteLinea)) {\\n\\t\\t\\t\\tnuevoEjer = new Ejercicio(siguienteLinea);\\n\\t\\t\\t\\tcoleccionEj.addEjercicio(nuevoEjer);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t//Controlar cuántos errores va dando\\n\\t\\t\\t\\terrores += \\\"Error en la lÃnea: \\\" + String.valueOf(numLinea) + \\\". Datos: \\\" + siguienteLinea + \\\"\\\\n\\\";\\n\\t\\t\\t}\\n\\t\\t\\tnumLinea++;\\n\\t\\t}\\n\\t\\t\\n\\t\\tin.close();\\n\\t\\t\\n\\t\\t\\n\\t\\t//Ahora escribimos \\n\\t\\tif (errores != \\\"\\\") {\\n\\t\\t\\ttry {\\n\\t\\t\\t erroresFichero = new FileWriter(NOMBRE_FICHERO_ERRORES);\\n\\t\\t\\n\\t\\t\\t erroresFichero.write(errores);\\n\\n\\t\\t\\t erroresFichero.close();\\n\\n\\t\\t\\t} catch (Exception ex) {\\n\\t\\t\\t\\tSystem.out.println(\\\"Mensaje de la excepción: \\\" + ex.getMessage());\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"void reloadeRooms( ) throws FileNotFoundException;\",\n \"public void afterCleaner() throws NumberFormatException, IOException{\\n \\t\\t\\t fileCleaner(\\\"ini.time\\\" );\\n \\t\\t\\t fileCleaner(\\\"failed.num\\\" );\\n// \\t\\t\\t fileCleaner(\\\"test.num\\\" );\\n \\t\\t\\t fileCleaner(\\\"add.num\\\" );\\n// \\t\\t\\t fileCleaner(\\\"prev.num\\\" );\\n \\t\\t\\t fileCleaner(\\\"server.info\\\");\\n \\t\\t\\t fileCleaner(\\\"email.opt\\\" );\\n \\t\\t\\t fileCleaner(\\\"email.all\\\" );\\n \\t\\t\\t fileCleaner(\\\"email.cont\\\" );\\n \\t\\t\\t fileCleaner(\\\"email.subj\\\" );\\n \\t\\t\\t fileCleaner(\\\"add.show\\\" );\\n \\t\\t\\t fileCleaner(\\\"screen-shots.zip\\\");\\n \\t\\t\\t fileCleaner(\\\"screen-shots.renameToZip\\\");\\n \\t\\t}\",\n \"public void saveFile() {\\t\\n\\t\\tString fileloc = \\\"\\\";\\n\\t\\tif(!prf.foldername.getText().equals(\\\"\\\"))\\n\\t\\t\\tfileloc += prf.foldername.getText()+\\\"/\\\";\\n\\t\\tfileloc += ((MinLFile) tabbedPane.getSelectedComponent()).filename;;\\t\\t\\n\\t\\tFile fl = new File(fileloc);\\n\\t\\t\\n\\t\\ttry {\\n\\t\\t\\tif(fl.exists()) {\\n\\t\\t\\t\\tint option = JOptionPane.showConfirmDialog(null, \\\"The file with this name already exists, do you want to overwrite it?\\\", \\\"Save File\\\", JOptionPane.YES_NO_OPTION);\\n\\t\\t\\t\\tif(option == 0) {\\n\\t\\t\\t\\t\\tFiles.delete(fl.toPath());\\n\\t\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tFileWriter fw = new FileWriter(fileloc);\\n\\t\\t\\t\\t\\t\\tBufferedWriter bw = new BufferedWriter(fw);\\n\\t\\t\\t\\t\\t\\tbw.write(((MinLFile) tabbedPane.getSelectedComponent()).CodeArea.getText());\\n\\t\\t\\t\\t\\t\\tbw.close();\\n\\t\\t\\t\\t\\t\\tfw.close();\\n\\t\\t\\t\\t\\t\\t((MinLFile) tabbedPane.getSelectedComponent()).filechanged = false;\\n\\t\\t\\t\\t\\t} catch (IOException e1) {\\n\\t\\t\\t\\t\\t\\te1.printStackTrace();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\tFileWriter fw = new FileWriter(fileloc);\\n\\t\\t\\t\\t\\tBufferedWriter bw = new BufferedWriter(fw);\\n\\t\\t\\t\\t\\tbw.write(((MinLFile) tabbedPane.getSelectedComponent()).CodeArea.getText());\\n\\t\\t\\t\\t\\tbw.close();\\n\\t\\t\\t\\t\\tfw.close();\\n\\t\\t\\t\\t\\t((MinLFile) tabbedPane.getSelectedComponent()).filechanged = false;\\n\\t\\t\\t\\t} catch (IOException e1) {\\n\\t\\t\\t\\t\\tJOptionPane.showMessageDialog(null, \\\"The specified folder doesnt exist.\\\");\\n\\t\\t\\t\\t\\te1.printStackTrace();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t}\",\n \"private void updateFile() {\\n try {\\n this.taskStorage.save(this.taskList);\\n this.aliasStorage.save(this.parser);\\n } catch (IOException e) {\\n System.out.println(\\\"Master i am unable to save the file!\\\");\\n }\\n }\",\n \"private void fecharArquivoEscrita(BufferedWriter file) {\\n\\t\\ttry {\\n\\t\\t\\tfile.close();\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t}\",\n \"public void loadData() {\\n Path path= Paths.get(filename);\\n Stream<String> lines;\\n try {\\n lines= Files.lines(path);\\n lines.forEach(ln->{\\n String[] s=ln.split(\\\";\\\");\\n if(s.length==3){\\n try {\\n super.save(new Teme(Integer.parseInt(s[0]),Integer.parseInt(s[1]),s[2]));\\n } catch (ValidationException e) {\\n e.printStackTrace();\\n } catch (SQLException e) {\\n e.printStackTrace();\\n }\\n }else\\n System.out.println(\\\"linie corupta in fisierul teme.txt\\\");});\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n }\",\n \"private static void createFileUmidade() throws IOException {\\r\\n\\t\\tInteger defaultUmidade = 30;\\r\\n\\t\\tarqUmidade = new File(pathUmidade);\\r\\n\\t\\tif(!arqUmidade.exists()) {\\r\\n\\t\\t\\tarqUmidade.createNewFile();\\r\\n\\t\\t\\tFileWriter fw = new FileWriter(getArqUmidade());\\r\\n\\t\\t\\tBufferedWriter buffWrite = new BufferedWriter(fw);\\r\\n\\t\\t\\tbuffWrite.append(defaultUmidade.toString() + String.valueOf('\\\\n'));/*Inicializa o arquivo com uma umidade Inicial*/\\r\\n\\t\\t\\tbuffWrite.close();\\r\\n\\t\\t}else {\\r\\n\\t\\t\\tFileReader fr = new FileReader(getArqUmidade());\\r\\n\\t\\t\\tBufferedReader buffRead = new BufferedReader(fr);\\r\\n\\t\\t\\tif(!buffRead.ready()) {/*Se o arquivo se encontar criado mas estiver vazio*/\\r\\n\\t\\t\\t\\tFileWriter fw = new FileWriter(arqUmidade);\\r\\n\\t\\t\\t\\tBufferedWriter buffWrite = new BufferedWriter(fw);\\r\\n\\t\\t\\t\\tbuffWrite.append(defaultUmidade.toString() + String.valueOf('\\\\n'));/*Inicializa o arquivo com uma umidade Inicial*/\\r\\n\\t\\t\\t\\tbuffWrite.close();\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tbuffRead.close();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"private void grabarArchivo() {\\n\\t\\tPrintWriter salida;\\n\\t\\ttry {\\n\\t\\t\\tsalida = new PrintWriter(new FileWriter(super.salida));\\n\\t\\t\\tsalida.println(this.aDevolver);\\n\\t\\t\\tsalida.close();\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t}\",\n \"public void guardarContribuintes () throws IOException {\\n FileWriter f = new FileWriter(\\\"registo_contribuintes.txt\\\");\\n \\n for(String NIF : contribuintes.keySet())\\n f.write(getContribuinte(NIF).toString());\\n \\n f.close();\\n }\",\n \"public void leeArchivo() throws IOException {\\n // defino el objeto de Entrada para tomar datos\\n BufferedReader brwEntrada;\\n try {\\n // creo el objeto de entrada a partir de un archivo de texto\\n brwEntrada = new BufferedReader(new FileReader(\\\"datos.txt\\\"));\\n } catch (FileNotFoundException e) {\\n // si marca error es que el archivo no existia entonces lo creo\\n File filPuntos = new File(\\\"datos.txt\\\");\\n PrintWriter prwSalida = new PrintWriter(filPuntos);\\n // le pongo datos ficticios o de default\\n // lo cierro para que se grabe lo que meti al archivo\\n prwSalida.close();\\n // lo vuelvo a abrir porque el objetivo es leer datos\\n brwEntrada = new BufferedReader(new FileReader(\\\"datos.txt\\\"));\\n }\\n // con el archivo abierto leo los datos que estan guardados\\n brwEntrada.close();\\n }\",\n \"public static void fix(World world) {\\n \\t\\tFile regionFolder = new File(Bukkit.getWorldContainer() + File.separator + world.getName() + File.separator + \\\"region\\\");\\r\\n \\t\\tif (regionFolder.exists()) {\\r\\n \\t\\t\\t// Loop through all region files of the world\\r\\n \\t\\t\\tint dx, dz;\\r\\n \\t\\t\\tint rx, rz;\\r\\n \\t\\t\\tfor (String regionFileName : regionFolder.list()) {\\r\\n \\t\\t\\t\\t// Validate file\\r\\n \\t\\t\\t\\tFile file = new File(regionFolder + File.separator + regionFileName);\\r\\n \\t\\t\\t\\tif (!file.isFile() || !file.exists()) {\\r\\n \\t\\t\\t\\t\\tcontinue;\\r\\n \\t\\t\\t\\t}\\r\\n \\t\\t\\t\\tString[] parts = regionFileName.split(\\\"\\\\\\\\.\\\");\\r\\n \\t\\t\\t\\tif (parts.length != 4 || !parts[0].equals(\\\"r\\\") || !parts[3].equals(\\\"mca\\\")) {\\r\\n \\t\\t\\t\\t\\tcontinue;\\r\\n \\t\\t\\t\\t}\\r\\n \\t\\t\\t\\t// Obtain the chunk offset of this region file\\r\\n \\t\\t\\t\\ttry {\\r\\n \\t\\t\\t\\t\\trx = Integer.parseInt(parts[1]) << 5;\\r\\n \\t\\t\\t\\t\\trz = Integer.parseInt(parts[2]) << 5;\\r\\n \\t\\t\\t\\t} catch (Exception ex) {\\r\\n \\t\\t\\t\\t\\tcontinue;\\r\\n \\t\\t\\t\\t}\\r\\n \\r\\n \\t\\t\\t\\t// Is it contained in the cache?\\r\\n \\t\\t\\t\\tReference<RegionFile> ref = RegionFileCacheRef.FILES.get(file);\\r\\n \\t\\t\\t\\tRegionFile reg = null;\\r\\n \\t\\t\\t\\tif (ref != null) {\\r\\n \\t\\t\\t\\t\\treg = ref.get();\\r\\n \\t\\t\\t\\t}\\r\\n \\t\\t\\t\\tboolean closeOnFinish = false;\\r\\n \\t\\t\\t\\tif (reg == null) {\\r\\n \\t\\t\\t\\t\\tcloseOnFinish = true;\\r\\n \\t\\t\\t\\t\\t// Manually load this region file\\r\\n \\t\\t\\t\\t\\treg = new RegionFile(file);\\r\\n \\t\\t\\t\\t}\\r\\n \\t\\t\\t\\t// Obtain all generated chunks in this region file\\r\\n \\t\\t\\t\\tfor (dx = 0; dx < 32; dx++) {\\r\\n \\t\\t\\t\\t\\tfor (dz = 0; dz < 32; dz++) {\\r\\n \\t\\t\\t\\t\\t\\tif (reg.c(dx, dz)) {\\r\\n \\t\\t\\t\\t\\t\\t\\t// Region file exists - add it\\r\\n\\t\\t\\t\\t\\t\\t\\tfix(world, rx + dx, rz + dz, true);\\r\\n \\t\\t\\t\\t\\t\\t}\\r\\n \\t\\t\\t\\t\\t}\\r\\n \\t\\t\\t\\t}\\r\\n \\t\\t\\t\\tif (closeOnFinish) {\\r\\n \\t\\t\\t\\t\\t// Close the region file stream - we are done with it\\r\\n \\t\\t\\t\\t\\treg.c();\\r\\n \\t\\t\\t\\t}\\r\\n \\t\\t\\t}\\r\\n\\t\\t} else {\\r\\n\\t\\t\\tNoLagg.plugin.log(Level.WARNING, \\\"Failed to fix world '\\\" + world.getName() + \\\"': Region folder is missing!\\\");\\r\\n \\t\\t}\\r\\n \\t}\",\n \"private void guardarArchivoMemoriaInterna(String objeto,String fileName,int modoGuardado) throws FileSaverException{\\n String msg = contexto.getResources().getString(R.string.fileSaverErrorEscrituraLocal);\\n FileOutputStream mOutput;\\n if(objeto!=null) {\\n try {\\n Log.v(TAG,\\\"Guardando el archivo \\\"+fileName+\\\" en memoriaInterna\\\");\\n mOutput = contexto.openFileOutput(fileName, modoGuardado);\\n mOutput.write(objeto.toString().getBytes());\\n mOutput.flush();\\n mOutput.close();\\n msg = contexto.getResources().getString(R.string.fileSaverAlmacenExitoso);\\n Log.v(TAG,msg);\\n }\\n catch(FileNotFoundException e){\\n throw new FileSaverException(msg);\\n }\\n catch(IOException e){\\n throw new FileSaverException(msg);\\n }\\n }\\n else{\\n throw new FileSaverException(msg);\\n }\\n }\",\n \"private void RemoverMapa(String nomeMapa){\\n try{\\n BufferedReader br = new BufferedReader(new FileReader(caminho.getPath()+\\\"/caminho.txt\\\"));\\n File rm = new File(caminho.getPath()+\\\"/\\\"+nomeMapa+\\\".txt\\\");\\n rm.delete();\\n String linha = br.readLine();\\n ArrayList<String> salvar = new ArrayList();\\n String array[] = new String[3];\\n while (linha != null){\\n array = linha.split(\\\",\\\");\\n if(!array[1].equals(nomeMapa)){\\n salvar.add(linha);\\n }\\n linha = br.readLine();\\n }\\n br.close();\\n FileWriter fw = new FileWriter(caminho.getPath()+\\\"/caminho.txt\\\", true);\\n fw.close();\\n BufferedWriter bw = new BufferedWriter(new FileWriter(caminho.getPath()+\\\"/caminho.txt\\\"));\\n for (int i = 0; i < salvar.size();i++){\\n bw.write(salvar.get(i));\\n bw.newLine();\\n }\\n bw.close();\\n\\n }catch (IOException ioe){\\n }\\n }\",\n \"public EnigmaFile() throws Exception\\n {\\n\\n String path = Main.class.getClassLoader().getResource(\\\"filein.txt\\\").getPath();\\n File currentDirectory=new File(path);\\n finstream = new FileInputStream(currentDirectory);\\n\\n\\n String pathToWrite = path.replaceFirst(\\\"filein.txt\\\",\\\"fileout.txt\\\");\\n File outputFile = new File(pathToWrite);\\n br = new BufferedReader(new InputStreamReader(finstream));\\n outputFile.createNewFile();\\n FileWriter fileWrite = new FileWriter(outputFile.getAbsoluteFile());\\n writer = new BufferedWriter(fileWrite);\\n\\n\\n }\",\n \"public static void LeerCaracter(File rutaLeer, File rutaEscribir) throws IOException {\\n\\n FileReader lector = new FileReader(rutaLeer);\\n FileWriter escritor = new FileWriter(rutaEscribir);\\n\\n String cartelera = (\\\"--------------------------------------\\\\n\\\"\\n + \\\" Cartelera de CineFBMoll\\\\n\\\"\\n + \\\"--------------------------------------\\\\n\\\\n\\\");\\n\\n String linea = \\\"--------------------------------------\\\\n\\\\n\\\";\\n\\n //se escribe la cartelera\\n for (int i = 0; i < cartelera.length(); i++) {\\n escritor.write(cartelera.charAt(i));\\n }\\n\\n int caracter;\\n int contador = 0;\\n boolean encontrarSigno = true;\\n\\n while ((caracter = lector.read()) != -1) {\\n if (((char) caracter) != '#') {\\n if (((char) caracter) != '{') {\\n if (encontrarSigno) {\\n for (int i = 0; i < datos[contador].length(); i++) {\\n escritor.write(datos[contador].charAt(i)); // imprimir elemento de datos\\n }\\n escritor.write(\\\": \\\");\\n encontrarSigno = false;\\n }\\n escritor.write(((char) caracter));\\n } else {\\n escritor.write(\\\"\\\\n\\\");\\n escritor.write(\\\"\\\\n\\\");\\n for (int i = 0; i < linea.length(); i++) {\\n escritor.write(linea.charAt(i));\\n }\\n\\n contador = 0;\\n encontrarSigno = true;\\n }\\n } else {\\n escritor.write(\\\"\\\\n\\\");\\n escritor.write(\\\"\\\\n\\\");\\n contador++;\\n encontrarSigno = true;\\n }\\n }//while\\n lector.close();// Cierra el archivo \\n escritor.close();// Cierra el archivo \\n\\n }\",\n \"public void escribir(String direccion,String texto) {\\n try {\\n FileWriter writer = new FileWriter(direccion);\\n PrintWriter print = new PrintWriter(writer);\\n print.print(texto);\\n writer.close();\\n } catch (IOException e) {\\n System.out.println(e.getMessage());\\n }\\n }\",\n \"public void save() {\\r\\n File distDataFile = new File(path);\\r\\n\\r\\n //String basePath = path;\\r\\n String endOfPath = path.substring(path.lastIndexOf(\\\"/\\\"));\\r\\n\\r\\n File rootDataFile;\\r\\n if (!path.contains(\\\"artists\\\")) {\\r\\n rootDataFile = new File(BASEDIR + \\\"/resources/data\\\" + endOfPath);\\r\\n } else {\\r\\n rootDataFile = new File(BASEDIR + \\\"/resources/data/artists\\\" + endOfPath);\\r\\n }\\r\\n\\r\\n File distTempFile = new File(path.substring(0, path.lastIndexOf(\\\"/\\\")) + \\\"/myTempFile.txt\\\");\\r\\n\\r\\n File rootTempFile;\\r\\n if (!path.contains(\\\"artists\\\")) {\\r\\n rootTempFile = new File(BASEDIR + \\\"/resources/data/myTempFile.txt\\\");\\r\\n } else {\\r\\n rootTempFile = new File(BASEDIR + \\\"/resources/data/artists/myTempFile.txt\\\");\\r\\n }\\r\\n \\r\\n try {\\r\\n BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(\\r\\n new FileOutputStream(distTempFile), \\\"UTF-8\\\"));\\r\\n\\r\\n for (String line : data) {\\r\\n bw.write(line);\\r\\n bw.newLine();\\r\\n }\\r\\n\\r\\n bw.close();\\r\\n distDataFile.delete();\\r\\n distTempFile.renameTo(distDataFile);\\r\\n\\r\\n BufferedWriter bw2 = new BufferedWriter(new OutputStreamWriter(\\r\\n new FileOutputStream(rootTempFile), \\\"UTF-8\\\"));\\r\\n\\r\\n for (String line : data) {\\r\\n bw2.write(line);\\r\\n bw2.newLine();\\r\\n }\\r\\n\\r\\n bw2.close();\\r\\n rootDataFile.delete();\\r\\n rootTempFile.renameTo(rootDataFile);\\r\\n } catch (IOException ex) {\\r\\n System.out.println(\\\"IOExceptoin in save1 : FileData\\\");\\r\\n }\\r\\n }\",\n \"void saveSimpleCodesToFile() {\\n\\t\\tPrintWriter writer;\\r\\n\\t\\ttry {\\r\\n\\t\\t\\t//writer = new PrintWriter(pathStr + \\\"/../pt.iscte.pidesco.codegenerator/Settings/Code.cg\\\", \\\"UTF-8\\\");\\r\\n\\t\\t\\twriter = new PrintWriter(\\\"Code.cg\\\", \\\"UTF-8\\\");\\r\\n\\t\\t\\tfor (SimpleCode sc : SimpleCodeMap.values()) {\\r\\n\\t\\t\\t\\twriter.print(sc.getCodeName() + \\\"-CGSeparator-\\\" + sc.resultCodeToWrite());\\r\\n\\t\\t\\t\\twriter.print(\\\"-CGCodeSeparator-\\\");\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\twriter.close();\\r\\n\\t\\t} catch (FileNotFoundException | UnsupportedEncodingException e) {\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"static void escribir(Planeta planeta_a_escribir) {\\n if (escritor != null) {\\n try {\\n escritor.writeObject(planeta_a_escribir);\\n \\n } catch (IOException ex) {\\n System.out.println(\\\"Error al escribir el archivo\\\");\\n }\\n }\\n }\",\n \"public static void main(String[] args) throws FileNotFoundException {\\n\\t\\tListaNombre nombres = new ListaNombre();\\n//\\t\\tnombres.add(new Nombre(\\\"guido\\\"));\\n//\\t\\tnombres.add(new Nombre(\\\"guido\\\"));\\n//\\t\\tnombres.add(new Nombre(\\\"guido\\\"));\\n//\\t\\tnombres.add(new Nombre(\\\"juan\\\"));\\n//\\t\\tnombres.add(new Nombre(\\\"juan\\\"));\\n//\\t\\tnombres.add(new Nombre(\\\"daria\\\"));\\n//\\t\\tnombres.add(new Nombre(\\\"daria\\\"));\\n//\\t\\tnombres.add(new Nombre(\\\"pedro\\\"));\\n//\\t\\tnombres.add(new Nombre(\\\"pedro\\\"));\\n//\\t\\tnombres.add(new Nombre(\\\"pedro\\\"));\\n//\\t\\tnombres.setCantRepetidos(3);\\n//\\t\\tfor (Nombre nom : nombres.getNombres()) {\\n//\\t\\t\\tSystem.out.println(nom.getNombre() + \\\" \\\" + nom.getCant());\\n//\\t\\t}\\n\\t\\tnombres = ( Archivo.leer(\\\"C:\\\\\\\\Users\\\\\\\\guido\\\\\\\\eclipse-workspace\\\\\\\\DescubriendoNombresRepetidos\\\\\\\\premioA.in\\\"));\\n\\t\\tArchivo.escribir(\\\"C:\\\\\\\\Users\\\\\\\\guido\\\\\\\\eclipse-workspace\\\\\\\\DescubriendoNombresRepetidos\\\\\\\\salida.out\\\",nombres);\\n\\t}\",\n \"public void loadSave(){\\n if((new File(\\\"data.MBM\\\")).exists()){\\n isNew = false;\\n\\n try {\\n BufferedReader br = new BufferedReader(new FileReader(\\\"data.MBM\\\"));\\n String line = br.readLine();\\n \\n while (line != null) {\\n \\n if(line.contains(\\\"outDir\\\")){\\n String[] result = line.split(\\\":\\\");\\n outputDir = new File(result[1]);\\n if(outputDir.exists() == false){\\n isNew = true;\\n }\\n }\\n else if(line.contains(\\\"MBMWORLD\\\")){\\n String[] result = line.split(\\\":\\\");\\n //1 = filename\\n //2 = world name\\n //3 = path\\n //4 = date\\n addWorld(new File(result[3]), result[2]);\\n worlds.get(numWorlds()-1).setLastBackup(result[4]);\\n }\\n \\n line = br.readLine();\\n }\\n \\n br.close();\\n \\n } catch(IOException e){\\n System.out.println(e);\\n }\\n }\\n }\",\n \"public void service_psy (Personne p) throws FileNotFoundException\\r\\n\\t{\\r\\n\\t\\r\\n\\t\\t\\r\\n\\t\\t \\t\\tString [] info_psy=null ;\\r\\n\\t\\t \\t\\tString [] cle_valeur=null;\\r\\n\\t\\t \\t\\tboolean spec,adr;\\r\\n\\t\\t \\t\\tFileInputStream f=new FileInputStream(\\\"C://Users/Azaiez Hamed/Desktop/workspace/Projet de programmation/src/Medecin.txt\\\");\\r\\n\\t\\t \\t\\ttry {\\r\\n\\t\\t \\t\\t\\tBufferedReader reader =new BufferedReader (new InputStreamReader(f,\\\"UTF-8\\\"));\\r\\n\\t\\t \\t\\t\\tString line=reader.readLine();\\r\\n\\t\\t \\t\\t\\twhile(line!=null){\\r\\n\\t\\t \\t\\t\\t\\tinfo_psy=line.split(\\\"\\\\t\\\\t\\\\t\\\");\\r\\n\\t\\t \\t\\t\\t\\tspec=false;adr=false;\\r\\n\\t\\t \\t\\t\\t\\tfor(int i=0;i<info_psy.length;i++)\\r\\n\\t\\t \\t\\t\\t\\t{\\r\\n\\t\\t \\t\\t\\t\\t\\t cle_valeur=info_psy[i].split(\\\":\\\");\\r\\n\\t\\t\\t\\t\\t\\t if ((cle_valeur[0].equals(\\\"specialite\\\"))&& (cle_valeur[1].equals(\\\"psy\\\")))\\r\\n\\t\\t\\t\\t\\t\\t \\t spec=true;\\r\\n\\t\\t\\t\\t\\t\\t if ((cle_valeur[0].equals(\\\"gouvernerat\\\"))&&(cle_valeur[1].equals(p.getGouvernerat())))\\r\\n\\t\\t \\t\\t\\t\\t\\t \\tadr=true;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\tif (spec && adr) {\\r\\n\\t\\t \\t\\t\\t\\t\\t System.out.println(\\\"voilà toutes les informations du psy, veuillez lui contacter immédiatement **\\\");\\r\\n\\t\\t \\t\\t\\t\\t\\t System.out.println(line);return;}\\r\\n\\t\\t \\t\\t\\t\\telse\\r\\n\\t\\t \\t\\t\\t\\t line=reader.readLine();\\r\\n\\t\\t \\t\\t\\t\\t }\\r\\n\\t\\t \\t\\t }\\r\\n\\t\\t \\t\\t \\tcatch(IOException e){e.printStackTrace();}\\r\\n\\t\\t \\t\\t System.out.println(\\\"Pas de psy trouvé dans votre gouvernerat\\\");\\r\\n\\t}\",\n \"private void validateFile(final boolean isRustica) {\\n\\t\\thayErroresFilas = false;\\r\\n\\t\\thayErroresFila = false;\\r\\n\\r\\n\\t\\tcampoMasaCorrectos = true;\\r\\n\\t\\tcampoHojaCorrecto = true;\\r\\n\\t\\tcampoParecelaCorrecto = true;\\r\\n\\t\\tcampoTipoCorrecto = true;\\r\\n\\t\\tcampoFechaAltaCorrecto = true;\\r\\n\\t\\tcampoFechaBajaCorrecto = true;\\r\\n\\r\\n\\t\\tFile currentDirectory = (File) blackboard.get(ImportarUtils_LCGIII.LAST_IMPORT_DIRECTORY);\\r\\n\\r\\n\\t\\tGeopistaFiltroFicheroFilter filter = new GeopistaFiltroFicheroFilter();\\r\\n\\t\\tfilter.addExtension(\\\"SHP\\\");\\r\\n filter.setDescription(\\\"Shapefiles\\\");\\r\\n\\t\\t\\r\\n final JFileChooser jfc;\\r\\n final JTextField jtf;\\r\\n if (isRustica)\\r\\n {\\r\\n \\tjfc = fcRustica;\\t\\r\\n \\tjtf = this.txtFicheroRustica;\\r\\n }\\r\\n\\t\\telse\\r\\n\\t\\t{\\r\\n\\t\\t\\tjfc = fcUrbana;\\r\\n\\t\\t\\tjtf = this.txtFicheroUrbana;\\r\\n\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t// FILES(*.*)\\r\\n jfc.setFileFilter(filter);\\r\\n \\tjfc.setAcceptAllFileFilterUsed(false); // QUITA LA OPCION ALL\\r\\n\\t\\tjfc.setCurrentDirectory(currentDirectory);\\r\\n\\t\\t\\r\\n\\t\\tint returnVal = jfc.showOpenDialog(this);\\r\\n\\t\\tblackboard.put(ImportarUtils_LCGIII.LAST_IMPORT_DIRECTORY, jfc.getCurrentDirectory());\\r\\n\\r\\n\\t\\tif (returnVal == JFileChooser.APPROVE_OPTION)\\r\\n\\t\\t{\\r\\n\\t\\t\\t// Cargamos el fichero que hemos obtenido\\r\\n\\t\\t\\tString fichero;\\r\\n\\t\\t\\tfichero = jfc.getSelectedFile().getPath();\\r\\n\\t\\t\\tjtf.setText(fichero); // meto el fichero seleccionado\\r\\n\\t\\t\\t// en el campo\\r\\n\\r\\n\\t\\t\\tcadenaTexto = \\\"<font face=SansSerif size=3>\\\"\\r\\n\\t\\t\\t\\t+ aplicacion.getI18nString(\\\"ImportacionComenzar\\\") + \\\"<b>\\\" + \\\" \\\"\\r\\n\\t\\t\\t\\t+ jfc.getSelectedFile().getName() + \\\"</b>\\\";\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tcadenaTexto = cadenaTexto + \\\"<p>\\\" + aplicacion.getI18nString(\\\"OperacionMinutos\\\") + \\\" ...</p></font>\\\";\\r\\n\\t\\t\\tcadenaTexto = cadenaTexto + aplicacion.getI18nString(\\\"importar.datos.parcelas\\\");\\r\\n\\r\\n\\t\\t\\tediError.setText(cadenaTexto);\\r\\n\\t\\t\\tcadenaTexto=\\\"\\\";\\r\\n\\r\\n\\t\\t\\tfinal TaskMonitorDialog progressDialog = \\r\\n\\t\\t\\t\\tnew TaskMonitorDialog(aplicacion.getMainFrame(), geopistaEditor.getContext().getErrorHandler());\\r\\n\\r\\n\\t\\t\\tprogressDialog.setTitle(aplicacion.getI18nString(\\\"ValidandoDatos\\\"));\\r\\n\\t\\t\\tprogressDialog.report(aplicacion.getI18nString(\\\"ValidandoDatos\\\"));\\r\\n\\t\\t\\tprogressDialog.addComponentListener(new ComponentAdapter()\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tpublic void componentShown(ComponentEvent e)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t// Wait for the dialog to appear before starting the\\r\\n\\t\\t\\t\\t\\t// task. Otherwise\\r\\n\\t\\t\\t\\t\\t// the task might possibly finish before the dialog\\r\\n\\t\\t\\t\\t\\t// appeared and the\\r\\n\\t\\t\\t\\t\\t// dialog would never close. [Jon Aquino]\\r\\n\\t\\t\\t\\t\\tnew Thread(new Runnable()\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tpublic void run()\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\ttry\\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tGeopistaLayer layerParcelas = (GeopistaLayer) blackboard.get(\\\"capaParcelasInfoReferencia\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (layerParcelas != null)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tgeopistaEditor.getLayerManager().remove(layerParcelas);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tlayerParcelas = (GeopistaLayer) geopistaEditor.loadData(\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tjfc.getSelectedFile().getAbsolutePath(),\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\taplicacion.getI18nString(\\\"importar.informe.parcelas\\\"));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tlayerParcelas.setActiva(false);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tlayerParcelas.addStyle(new BasicStyle(new Color(64, 64,64)));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tlayerParcelas.setVisible(false);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (isRustica)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tblackboard.put(\\\"capaParcelasInfoReferencia\\\", layerParcelas);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tblackboard.put(\\\"capaParcelasInfoReferenciaUrbana\\\", layerParcelas);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// Obtener el esquema\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tFeatureSchema esquema = layerParcelas.getFeatureCollectionWrapper().getFeatureSchema();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// Localizar los campos\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcampoMasaCorrectos = encontrarCampo(\\\"MASA\\\",esquema);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcampoHojaCorrecto = encontrarCampo(\\\"HOJA\\\",esquema);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcampoParecelaCorrecto = encontrarCampo(\\\"PARCELA\\\",esquema);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcampoTipoCorrecto = encontrarCampo(\\\"TIPO\\\",esquema);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcampoFechaAltaCorrecto = encontrarCampo(\\\"FECHAALTA\\\", esquema);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcampoFechaBajaCorrecto = encontrarCampo(\\\"FECHABAJA\\\", esquema);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (campoMasaCorrectos \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t&& campoHojaCorrecto\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t&& campoParecelaCorrecto\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t&& campoTipoCorrecto\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t&& campoFechaAltaCorrecto\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t&& campoFechaBajaCorrecto)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// A partir de aqui hay que\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// verificar que no hay nulos y es\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// del tipo correcto los valores.\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tList listaLayer = layerParcelas.getFeatureCollectionWrapper().getFeatures();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tIterator itLayer = listaLayer.iterator();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\twhile (itLayer.hasNext())\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (hayErroresFila)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// break;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tFeature f = (Feature) itLayer.next();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tString masa = f.getString(\\\"MASA\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tString hoja = f.getString(\\\"HOJA\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tString parcela = f.getString(\\\"PARCELA\\\");\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tString tipo = f.getString(\\\"TIPO\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// Comprobamos que no sea nulo y\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// sea una U o una R\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif ((!tipo.equals(\\\"U\\\"))\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t&& (!tipo.equals(\\\"R\\\"))\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t&& (!tipo.equals(\\\"D\\\"))\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t&& (!tipo.equals(\\\"X\\\")))\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// Solo puede haber una R \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// una U una D o una X.\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcadenaTexto = cadenaTexto\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ aplicacion.getI18nString(\\\"importar.informe.parcelas.rustico\\\")\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ masa\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ hoja\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ parcela\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ aplicacion.getI18nString(\\\"importar.informe.parcelas.fin.rustico\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFila = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFilas = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// break;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse if (!isRustica && (tipo.equals(\\\"R\\\") || tipo.equals(\\\"D\\\") || tipo.equals(\\\"X\\\")))\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcadenaTexto = I18N.get(\\\"ImportadorParcelas\\\", \\\"importar.informe.parcelas.error.inicio.parcelario\\\")\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ I18N.get(\\\"ImportadorParcelas\\\", \\\"importar.informacion.referencia.validacion.urbana\\\") + \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tI18N.get(\\\"ImportadorParcelas\\\", \\\"importar.informe.parcelas.error.fin.parcelario\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFila = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFilas = true;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse if (isRustica && tipo.equals(\\\"U\\\"))\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcadenaTexto = I18N.get(\\\"ImportadorParcelas\\\", \\\"importar.informe.parcelas.error.inicio.parcelario\\\")\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ I18N.get(\\\"ImportadorParcelas\\\", \\\"importar.informacion.referencia.validacion.rustica\\\") + \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tI18N.get(\\\"ImportadorParcelas\\\", \\\"importar.informe.parcelas.error.fin.parcelario\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFila = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFilas = true;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// Comprobamos que la fecha\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// que viene sea fecha\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\ttry\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tDateFormat formatter = new SimpleDateFormat(\\\"yyyyMMdd\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tDate date = (Date) formatter.parse(f.getString(\\\"FECHAALTA\\\"));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// Comprobamos que la\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// fecha de baja es nula\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// o valida o 9999999\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (f.getString(\\\"FECHABAJA\\\").equals(\\\"99999999\\\"))\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// Correcto\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFila = false;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif ((f.getString(\\\"FECHABAJA\\\")) == null)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFila = false;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// Comprobamos que sea una fecha correcta\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\ttry\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tDateFormat formatter1 = new SimpleDateFormat(\\\"yyyyMMdd\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tDate date1 = (Date) formatter1.parse(f.getString(\\\"FECHABAJA\\\"));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcatch (Exception excp)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\texcp.printStackTrace();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFila = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFilas = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcadenaTexto = cadenaTexto\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ aplicacion.getI18nString(\\\"importar.informe.parcelas.fecha.baja\\\")\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ masa\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ hoja\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ parcela\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ aplicacion.getI18nString(\\\"importar.informe.parcelas.fin.rustico\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// break;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//jtf.setBorder(BorderFactory.createLineBorder(Color.GREEN, 2));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (isRustica)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\trusticaValida = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\turbanaValida = true;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcatch (Exception exc)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// En la fecha de alta\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcadenaTexto = cadenaTexto\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ aplicacion.getI18nString(\\\"importar.informe.parcelas.fecha.alta.validacion\\\")\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ masa\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ hoja\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ parcela\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ aplicacion.getI18nString(\\\"importar.informe.parcelas.fin.rustico\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\texc.printStackTrace();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFila = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFilas = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// break;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//Se comprueba si la geometría es de tipo polygon y no es empty (únicas válidas en la capa parcelas)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (!(f.getGeometry() instanceof Polygon)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t|| f.getGeometry().isEmpty())\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcadenaTexto = I18N.get(\\\"ImportadorParcelas\\\", \\\"importar.informe.parcelas.error.inicio.parcelario\\\")\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ I18N.get(\\\"ImportadorParcelas\\\", \\\"importar.informacion.referencia.validacion.geometria\\\") + \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tI18N.get(\\\"ImportadorParcelas\\\", \\\"importar.informe.parcelas.error.fin.parcelario\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFila = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFilas = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// Alguno de los campos no están\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// definidos\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// JOptionPane.showMessageDialog(this,aplicacion.getI18nString(\\\"importar.informe.parcelas.algun.campo\\\"));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tcadenaTexto += aplicacion.getI18nString(\\\"importar.informacion.ficheros.no.correctos\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\thayErroresFilas = true;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (isRustica)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\trusticaValida = false;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\turbanaValida = false;\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t\\tcatch (Exception e)\\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\thayErroresFilas = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t\\tfinally\\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tprogressDialog.setVisible(false);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}).start();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t});\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tGUIUtil.centreOnWindow(progressDialog);\\r\\n\\t\\t\\tprogressDialog.setVisible(true);\\r\\n\\r\\n\\t\\t\\tif (hayErroresFilas)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tjtf.setBorder(BorderFactory.createLineBorder(Color.RED, 2));\\r\\n\\t\\t\\t\\tcadenaTexto = cadenaTexto + aplicacion.getI18nString(\\\"validacion.finalizada\\\");\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tjtf.setBorder(BorderFactory.createLineBorder(Color.GREEN, 2));\\r\\n\\t\\t\\t\\tcadenaTexto = cadenaTexto + aplicacion.getI18nString(\\\"importar.informe.parcelas.fichero.correcto\\\")\\r\\n\\t\\t\\t\\t+ aplicacion.getI18nString(\\\"validacion.finalizada\\\");\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tediError.setText(cadenaTexto);\\r\\n\\t\\t\\twizardContext.inputChanged();\\r\\n\\t\\t}\\r\\n\\r\\n\\t}\",\n \"public static void main(String[] args) {\\n\\r\\n String cFields = \\\"NIC,SIMBOLO_VARIABLE,FECHA_VENCIMIENTO,FECHA_PAGO_OPORTUNO,FECHA_EMISION,NUMERO_FACTURA,INDICATIVO_SUMINISTRO,CIIU,TIPO_COBRO,SECUENCIAL_RECIBO,NIS,TIPO_SERVICIO,ORDEN_LECTURA,MEDIDOR,LECT_ANTERIOR,LECT_ACTUAL,FECHA_LECTURA_ACTUAL,CONSUMO_FACTURADO,VALOR_FACTURA,GRUPO_FAMILIAR,PRECIO_UNITARIO_CU,IND_VISUSALIZACION_BARCODI,IMPORTE_TOTAL_DEUDA,CANTIDAD_FACTURAS_ADEUDADAS,DESC_ANOMALIA_LECTURA,IMPORTE_TOTAL_FACTURA,SUBTOTAL_FACTURA,DESCRIPCION_TARIFA,CONSUMO_PROMEDIO,DIAS_FACTURADOS,CLAVE_ORDEN_FACTURA,PROPIEDAD_EQUIPO_MEDIDA,UNICOM,RUTA,ITINERARIO\\\";\\r\\n fields = cFields.split(\\\",\\\");\\r\\n\\r\\n readConfiguracion();\\r\\n\\r\\n if (configuracion.size() != fields.length) {\\r\\n System.out.println(\\\"Longitud de campos y configuración es diferente. Fields: \\\" + fields.length + \\\" Configuracion: \\\" + configuracion.size());\\r\\n Utilidades.AgregarLog(\\\"Longitud de campos y configuración es diferente. Fields: \\\" + fields.length + \\\" Configuracion: \\\" + configuracion.size());\\r\\n return;\\r\\n }\\r\\n\\r\\n if (configuracion.size() > 0) {\\r\\n System.out.println(\\\"Campos a leer: \\\" + configuracion.size());\\r\\n Utilidades.AgregarLog(\\\"Campos a leer: \\\" + configuracion.size());\\r\\n String ruta = \\\"C:\\\\\\\\REPARTO\\\\\\\\\\\";\\r\\n File directorio = new File(ruta);\\r\\n Utilidades.AgregarLog(\\\"Descomprimiendo archivos ruta:\\\" + ruta);\\r\\n DescomprimirArchivosCarpeta(directorio);\\r\\n Utilidades.AgregarLog(\\\"Procesando archivos de reparto en ruta:\\\" + ruta);\\r\\n ProcesarDirectorio(directorio);\\r\\n\\r\\n } else {\\r\\n System.out.println(\\\"No se ha cargado la configuracion\\\");\\r\\n Utilidades.AgregarLog(\\\"No se ha cargado la configuracion\\\");\\r\\n }\\r\\n\\r\\n }\",\n \"public static void main(String[] args){\\n File testFile = new File(args[1]);\\n File testFile_new = new File(args[2]);\\n String all = \\\"\\\";\\n // read all data\\n try {\\n Scanner input = null;\\n input = new Scanner(testFile);\\n while (input.hasNext()){\\n all += input.nextLine() + \\\"\\\\r\\\\n\\\";\\n }\\n } catch (FileNotFoundException e) {\\n e.printStackTrace();\\n }\\n // print and replace\\n System.out.println(all);\\n all = all.replaceAll(args[0], \\\"\\\");\\n // save to other file with replaced\\n try{\\n PrintWriter output = new PrintWriter(testFile_new);\\n output.write(all);\\n output.close();\\n } catch (FileNotFoundException ex){\\n ex.printStackTrace();\\n }\\n }\",\n \"@Override\\n public void incluir(Colaborador objeto)throws Exception {\\n try {\\n System.out.println(\\\"Estou Gravando no Arquivo\\\" + nomeDoArquivoNoDisco);\\n FileWriter fw = new FileWriter(nomeDoArquivoNoDisco, true);\\n //Criar o buffer do arquivo\\n BufferedWriter bw = new BufferedWriter(fw);\\n //Escreve no arquivo\\n bw.write(objeto.toString() + \\\"\\\\n\\\");\\n //Fechar o arquivo\\n bw.close();\\n } catch (Exception erro) {\\n throw erro;\\n }\\n }\",\n \"public void save() throws FileNotFoundException, IOException, ClassNotFoundException ;\",\n \"public void guardarPuntaje() {\\r\\n\\t\\tFile archivo = new File(\\\"archivos/puntajes.txt\\\");\\r\\n\\t\\tBufferedWriter bw;\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tif (archivo.exists()) {\\r\\n\\t\\t\\t\\tFileWriter fw = new FileWriter(archivo, true);\\r\\n\\t\\t\\t\\tbw = new BufferedWriter(fw);\\r\\n\\t\\t\\t\\tbw.write(\\\"\\\\r\\\\n\\\"+jugadorActual.getNombre()+\\\"-\\\"+jugadorActual.getPuntaje());\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse {\\r\\n\\t\\t\\t\\tFileWriter fw = new FileWriter(archivo, true);\\r\\n\\t\\t\\t\\tbw = new BufferedWriter(fw);\\r\\n\\t\\t\\t\\tbw.write(jugadorActual.getNombre()+\\\"-\\\"+jugadorActual.getPuntaje());\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\t\\t\\t\\t\\t\\r\\n\\t\\t\\tbw.close();\\r\\n\\t\\t\\t\\r\\n\\t\\t} catch (Exception e) {\\r\\n\\t\\t}\\r\\n\\t}\",\n \"static void inicializarentrada(){\\n try {\\n archivo_entrada= new FileInputStream(\\\"src/serializacion/salida.txt\\\");\\n } catch (FileNotFoundException ex) {\\n System.out.println(\\\"Error al abrir el archivo\\\");\\n }\\n \\n try {\\n lector= new ObjectInputStream(archivo_entrada);\\n } catch (IOException ex) {\\n System.out.println(\\\"Error al acceder al archivo\\\");\\n }\\n }\",\n \"public void crearArchivoDeTexto(String rutas,String nombre, String texto){\\n try{\\n archivo = new File(rutas + File.separator + nombre);\\n String rutaCompleta=archivo.getAbsolutePath();\\n \\n System.out.println(rutaCompleta);\\n FileWriter archivoEscritura= new FileWriter(rutaCompleta,true);\\n BufferedWriter escritura= new BufferedWriter(archivoEscritura);\\n escritura.append(texto+\\\"\\\\n\\\");\\n escritura.close();\\n archivoEscritura.close();\\n }catch(FileNotFoundException e1){\\n System.out.println(\\\"Ruta de archivo no encontrada\\\");\\n }catch(IOException e2){\\n System.out.println(\\\"Error de escritura\\\");\\n }catch(Exception e3){\\n System.out.println(\\\"Error General\\\");\\n }\\n }\",\n \"public void leerDeFichero() {\\n try\\n {\\n Scanner sc = new Scanner(new File(\\\"texto.txt\\\"));\\n while (sc.hasNextLine() && !textoCompleto())\\n addFrase(sc.nextLine());\\n sc.close();\\n }\\n catch (IOException e)\\n {\\n e.printStackTrace();\\n }\\n }\",\n \"public void armarPreguntas(){\\n preguntas = file.listaPreguntas(\\\"Preguntas.txt\\\");\\n }\",\n \"public void guardarGrafo(final String archivo) {\\n\\t\\tPrintWriter salida = null;// !=BufferedReader\\n\\t\\ttry {\\n\\n\\t\\t\\tsalida = new PrintWriter(new FileWriter(archivo));\\n\\t\\t\\tsalida.println(cantNodos + \\\" \\\" + cantAristas + \\\" \\\" + porcentAdy + \\\" \\\" + grMax + \\\" \\\" + grMin);\\n\\t\\t\\tfor (int f = 0; f < cantNodos; f++) {\\n\\t\\t\\t\\tfor (int c = f + 1; c < cantNodos; c++) {\\n\\t\\t\\t\\t\\tif (getValor(f, c) == true) {\\n\\t\\t\\t\\t\\t\\tsalida.println((f + 1) + \\\" \\\" + (c + 1));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t} catch (Exception e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t} finally {\\n\\t\\t\\tsalida.close();\\n\\t\\t}\\n\\t}\",\n \"static void LeerArchivo(){ \\r\\n \\t//iniciamos el try y si no funciona se hace el catch\\r\\n\\r\\n try{ \\r\\n \\t//se crea un objeto br con el archivo de txt\\r\\n \\tBufferedReader br = new BufferedReader( \\r\\n \\tnew FileReader(\\\"reporte.txt\\\")\\r\\n );\\r\\n String s;\\r\\n //Mientras haya una linea de texto se imprime\\r\\n while((s = br.readLine()) != null){ \\r\\n System.out.println(s);\\r\\n }\\r\\n //se cierra el archivo de texto\\r\\n br.close(); \\r\\n } catch(Exception ex){\\r\\n \\t//si no funciona se imprime el error\\r\\n System.out.println(ex); \\r\\n }\\r\\n }\",\n \"static void cerrarSalida(){\\n if (escritor!=null){\\n try {\\n escritor.close();\\n } catch (IOException ex) {\\n System.out.println(\\\"Error al cerrar el archivo\\\");\\n }\\n }\\n }\",\n \"private void updateFile(CrowdinFile _file) {\\n String fileN = _file.getFile().getName();\\n if (getLog().isDebugEnabled())\\n getLog().debug(\\\"*** Initializing: \\\" + fileN);\\n // Making sure the file is a master file and not a translation\\n if (_file.getClass().equals(CrowdinFile.class)) {\\n if (getLog().isDebugEnabled())\\n getLog().debug(\\\"*** Init dir\\\");\\n initDir(_file.getCrowdinPath());\\n try {\\n if (_file.getFile().exists()) {\\n \\n //escape special character before sync\\n FileUtils.replaceCharactersInFile(_file.getFile().getPath(), \\\"config/special_character_processing.properties\\\", \\\"EscapeSpecialCharactersBeforeSyncFromCodeToCrowdin\\\");\\n \\n if (!getHelper().elementExists(_file.getCrowdinPath())) {\\n if (getLog().isDebugEnabled())\\n getLog().debug(\\\"*** Add file: \\\" + _file.getCrowdinPath());\\n String result = getHelper().addFile(_file);\\n if (result.contains(\\\"success\\\")) {\\n getLog().info(\\\"File \\\" + fileN + \\\" created succesfully.\\\");\\n initTranslations(_file);\\n } else {\\n getLog().warn(\\\"Cannot create file '\\\" + _file.getFile().getPath() + \\\"'. Reason:\\\\n\\\" + result);\\n if (_file.isShouldBeCleaned()) {\\n _file.getFile().delete();\\n }\\n }\\n } else {\\n if (getLog().isDebugEnabled()) {\\n getLog().debug(\\\"*** Update file: \\\" + _file.getCrowdinPath());\\n }\\n String result = getHelper().updateFile(_file);\\n System.out.println(result);\\n if (result.contains(\\\"success\\\"))\\n getLog().info(\\\"File \\\" + fileN + \\\" updated succesfully.\\\");\\n else\\n getLog().warn(\\\"Cannot update file '\\\" + _file.getFile().getPath() + \\\"'. Reason:\\\\n\\\" + result);\\n if (_file.isShouldBeCleaned()) {\\n _file.getFile().delete();\\n }\\n \\n //remove escape special character before sync\\n FileUtils.replaceCharactersInFile(_file.getFile().getPath(), \\\"config/special_character_processing.properties\\\", \\\"EscapeSpecialCharactersAfterSyncFromCodeToCrowdin\\\");\\n \\n }\\n } else {\\n if (getHelper().elementExists(_file.getCrowdinPath())) {\\n if (getLog().isDebugEnabled())\\n getLog().debug(\\\"*** Delete file: \\\" + _file.getCrowdinPath());\\n String result = getHelper().deleteFile(_file);\\n if (result.contains(\\\"success\\\"))\\n getLog().info(\\\"File \\\" + fileN + \\\" deleted succesfully.\\\");\\n else\\n getLog().warn(\\\"Cannot delete file '\\\" + _file.getFile().getPath() + \\\"'. Reason:\\\\n\\\" + result);\\n }\\n }\\n } catch (MojoExecutionException e) {\\n getLog().error(\\\"Error while updating file '\\\" + _file.getFile().getPath() + \\\"'. Exception:\\\\n\\\" + e.getMessage());\\n }\\n }\\n }\",\n \"public static void fileEditor(String path, String search, String replace) {\\t \\t\\n\\t\\t\\ttry {\\n\\t\\t\\t\\t File log= new File(path);\\t \\t\\n\\t\\t\\t FileReader fr = new FileReader(log);\\n\\t\\t\\t String s;\\n\\t\\t\\t String totalStr = \\\"\\\";\\n\\t\\t\\t try (BufferedReader br = new BufferedReader(fr)) {\\n\\t\\t\\t while ((s = br.readLine()) != null) { totalStr += s + \\\"\\\\n\\\"; }\\t \\n\\t\\t\\t totalStr = totalStr.replaceAll(search, replace);\\n\\t\\t\\t FileWriter fw = new FileWriter(log);\\n\\t\\t\\t fw.write(totalStr);\\n\\t\\t\\t fw.close();\\n\\t\\t\\t }\\n\\t\\t\\t } catch(Exception e) { System.out.println(\\\"Problem reading file.\\\"); }\\n\\t\\t\\t}\",\n \"public void writeFile() {\\n\\t\\ttry {\\n\\t\\t\\tFile dir = Environment.getExternalStorageDirectory();\\n\\t\\t\\tFile myFile = new File(dir.toString() + File.separator + FILENAME);\\n\\t\\t\\tLog.i(\\\"MyMovies\\\", \\\"SeSus write : \\\" + myFile.toString());\\n\\t\\t\\tmyFile.createNewFile();\\n\\t\\t\\tFileOutputStream fOut = new FileOutputStream(myFile);\\n\\t\\t\\tOutputStreamWriter myOutWriter = \\n\\t\\t\\t\\t\\tnew OutputStreamWriter(fOut);\\n\\t\\t\\tfor (Map.Entry<String, ValueElement> me : hm.entrySet()) {\\n\\t\\t\\t\\tString refs = (me.getValue().cRefMovies>0? \\\"MOVIE\\\" : \\\"\\\");\\n\\t\\t\\t\\trefs += (me.getValue().cRefBooks>0? \\\"BOOK\\\" : \\\"\\\");\\n\\t\\t\\t\\tString line = me.getKey() + DELIMITER + me.getValue().zweiteZeile \\n\\t\\t\\t\\t\\t\\t //+ DELIMITER\\n\\t\\t\\t\\t\\t\\t //+ me.getValue().count\\n\\t\\t\\t\\t\\t \\t+ DELIMITER\\n\\t\\t\\t\\t\\t \\t+ refs\\n\\t\\t\\t\\t\\t \\t + System.getProperty(\\\"line.separator\\\");\\n\\t\\t\\t\\t//Log.i(\\\"MyMovies\\\", \\\"SeSus extracted : \\\" + line);\\n\\t\\t\\t\\tmyOutWriter.write(line);\\n\\t\\t\\t}\\n\\t\\t\\tmyOutWriter.close();\\n\\t\\t\\tfOut.close();\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\t//\\n\\t\\t\\tLog.i(\\\"MyMovies\\\", \\\"SeSus write Exception : \\\");\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t}\",\n \"@Override\\r\\n\\tpublic void remFile(String path) {\\n\\t\\t\\r\\n\\t}\",\n \"void abreArquivo (String filetText, String fileData){\\n //Abre e le o arquivo\\n arquivo.abrirArquivo(filetText); //Le primeiro arquivo\\n separaDados.salvaInstrucao (arquivo.arquivo, memoria); //Salva na memoria de texto\\n\\n arquivo.abrirArquivo(fileData); //Le arquivo de dados\\n separaDados.salvaDados (arquivo.arquivo, memoria); //Armazena arquivo lido na memoria\\n }\",\n \"void writeToFile () throws IOException{\\n FileWriter deleteFile = new FileWriter(\\\"Resolved Ticket of \\\" + this.resovedDate + \\\".txt\\\");\\n BufferedWriter FileDeleted = new BufferedWriter(deleteFile);\\n\\n FileDeleted.write(\\\"Resolution: \\\" + this.Resolution + \\\" ; Date: \\\" + this.resovedDate);\\n FileDeleted.close();\\n }\",\n \"public void mo210a(File file) {\\n }\",\n \"public void crearPrimerFichero(){\\n File f=new File(getApplicationContext().getFilesDir(),\\\"datos.json\\\");\\n // si no existe lo creo\\n if(!f.exists()) {\\n String filename = \\\"datos.json\\\";\\n String fileContents = \\\"[]\\\";\\n FileOutputStream outputStream;\\n\\n try {\\n outputStream = openFileOutput(filename, Context.MODE_PRIVATE);\\n outputStream.write(fileContents.getBytes());\\n outputStream.close();\\n } catch (Exception e) {\\n e.printStackTrace();\\n }\\n }\\n\\n }\",\n \"public void suppfichier(String chemin) {\\n Path path = Paths.get(chemin);\\n if (path.toFile().isDirectory()) { //si c'esst un dossier\\n try (DirectoryStream<Path> listing = Files.newDirectoryStream(path)) {\\n if (path != null) {\\n for (Path nom : listing) { //parsourir les fichier et sou dossier\\n if (!Files.isDirectory(nom)) {\\n Files.delete(nom);\\n } else {\\n suppfichier(nom.toFile().getAbsolutePath());\\n }\\n }\\n Files.delete(path);\\n } else {\\n Files.delete(path);\\n }\\n } catch (IOException e) {\\n File file = new File(chemin);\\n file.delete();\\n }\\n } else {\\n File file = new File(chemin);\\n file.delete();\\n }\\n }\",\n \"private void abrirEntTransaccion(){\\n try{\\n entTransaccion = new ObjectInputStream(\\n Files.newInputStream(Paths.get(\\\"trans.ser\\\")));\\n }\\n catch(IOException iOException){\\n System.err.println(\\\"Error al abrir el archivo. Terminado.\\\");\\n System.exit(1);\\n }\\n }\",\n \"public void setWorldFile(File newFile) {\\n File configDirectory = new File(newFile,CONFIG_DIRECTORY);\\n configDirectory.mkdir();\\n\\n String configName = generalConfigFile.getPath();\\n String generalConfigDirectoryName = generalConfigFile.getParentFile().getPath();\\n String detailName = configName.substring(generalConfigDirectoryName.length()+1);\\n //logger.info(\\\"Filename \\\"+detailName);\\n File localConfigFile = new File(configDirectory,detailName);\\n setWorldConfigFile(localConfigFile);\\n }\",\n \"public void save(File f) {\\n\\t\\tif (f.exists()) {\\r\\n\\t\\t\\tString filename = f.getName();\\r\\n\\t\\t\\tString backName;\\r\\n\\t\\t\\tif (filename.contains(\\\".\\\")) {\\r\\n\\t\\t\\t\\tbackName = filename.substring(0,filename.lastIndexOf('.'));\\r\\n\\t\\t\\t\\tbackName += \\\"_backup\\\";\\r\\n\\t\\t\\t\\tbackName += filename.substring(filename.lastIndexOf('.'));\\r\\n\\t\\t\\t} else {\\r\\n\\t\\t\\t\\tbackName = filename + \\\"_backup\\\";\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tFile back = new File(f.getParent(),backName);\\r\\n\\t\\t\\tSystem.out.println(\\\"Writing backup to: \\\"+back.getAbsolutePath());\\r\\n\\t\\t\\tif (back.exists()) back.delete();\\r\\n\\t\\t\\tFile newF = f;\\r\\n\\t\\t\\tf.renameTo(back);\\r\\n\\t\\t\\tf = newF;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tFileOutputStream outputStream = null;\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tDocument doc = DocumentBuilderFactory.newInstance().newDocumentBuilder().newDocument();\\r\\n//\\t\\t\\tb.append(\\\"<Map xmlns:xsi=\\\\\\\"http://www.w3.org/2001/XMLSchema-instance\\\\\\\" xsi:noNamespaceSchemaLocation=\\\\\\\"map.xsd\\\\\\\">\\\");\\r\\n//\\t\\t\\tProcessingInstruction pi = doc.createProcessingInstruction(\\\"xml-stylesheet\\\", \\\"type=\\\\\\\"text/xsl\\\\\\\" href=\\\\\\\"/assistantdm/static/CharacterSheetTemplate.xsl\\\\\\\"\\\");\\r\\n//\\t\\t\\tdoc.appendChild(pi);\\r\\n\\t\\t\\tXMLMapExporter processor = new XMLMapExporter(doc);\\r\\n\\t\\t\\tmapPanel.executeProcess(processor);\\r\\n\\t\\t\\tdoc.setXmlStandalone(true);\\r\\n\\r\\n\\t\\t\\tTransformer trans = TransformerFactory.newInstance().newTransformer();\\r\\n\\t\\t\\ttrans.setOutputProperty(OutputKeys.INDENT, \\\"yes\\\");\\r\\n\\t\\t\\ttrans.setOutputProperty(OutputKeys.ENCODING, \\\"UTF-8\\\");\\r\\n\\t\\t\\ttrans.setOutputProperty(\\\"{http://xml.apache.org/xslt}indent-amount\\\", \\\"4\\\");\\r\\n\\t\\t\\toutputStream = new FileOutputStream(f);\\r\\n\\t\\t\\ttrans.transform(new DOMSource(doc), new StreamResult(outputStream));\\r\\n\\t\\t\\tmapPanel.modified = false;\\r\\n\\t\\t} catch (Exception ex) {\\r\\n\\t\\t\\tex.printStackTrace();\\r\\n\\t\\t} finally {\\r\\n\\t\\t\\tif (outputStream != null) {\\r\\n\\t\\t\\t\\ttry {\\r\\n\\t\\t\\t\\t\\toutputStream.close();\\r\\n\\t\\t\\t\\t} catch (IOException e1) {\\r\\n\\t\\t\\t\\t\\te1.printStackTrace();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public void geraArquivoAjudaTextual(String caminho, String nomeArquivo, String texto) {\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tarquivoTexto = new File(caminho + \\\"\\\\\\\\\\\" + nomeArquivo);\\r\\n\\t\\t\\tFileWriter fw = new FileWriter(arquivoTexto);\\r\\n\\t\\t\\tPrintWriter pw = new PrintWriter(fw);\\r\\n\\t\\t\\tpw.write(texto);\\r\\n\\t\\t\\tfw.close();\\r\\n\\t\\t} catch (IOException e) {\\r\\n\\t\\t}\\r\\n\\t}\",\n \"private void guardar() {\\n\\t\\t//JFileChooser fglobal = principal.getFglobal();\\n\\t\\tprincipal.getFglobal().setDialogTitle(ic.buscar(38)); // Tag 38\\n\\n\\t\\t\\tprincipal.getFglobal().setDialogType(JFileChooser.SAVE_DIALOG);\\n\\n\\t\\tAccesorio pep = new Accesorio(principal.getFglobal(),t, principal.getIC());\\n\\t\\tprincipal.getFglobal().setAccessory(pep);\\n\\t\\tpep.setProfundidad(true);\\n\\t\\t\\n principal.getFglobal().resetChoosableFileFilters();\\n \\n ExampleFileFilter filtroT = new ExampleFileFilter (\\n new String [] {\\\"tiff\\\",\\n \\\"tif\\\",\\n },\\n ic.buscar(3)); // Tag 3\\n \\n\\n \\n\\t\\t\\t\\n ExampleFileFilter filtroJ = new ExampleFileFilter (\\n new String [] {\\\"jpeg\\\",\\n \\\"jpg\\\"\\n },\\n ic.buscar(4)); // Tag 4\\n principal.getFglobal().addChoosableFileFilter(filtroT);\\n principal.getFglobal().addChoosableFileFilter(filtroJ);\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\tint retval = principal.getFglobal().showDialog(t, null);\\n\\t\\tif (retval == JFileChooser.APPROVE_OPTION) \\n\\t\\t{\\t\\t\\n\\t\\t\\tFile guardar = principal.getFglobal().getSelectedFile();\\n \\n\\t\\t\\tif (\\tprincipal.getFglobal().getFileFilter().getDescription().equals(filtroJ.getDescription()) )\\n\\t\\t\\t{// Guardar como JPEG\\n \\n\\t\\t\\t\\tJAI.create(\\\"filestore\\\",imagen_original,guardar.getPath(),\\\"JPEG\\\", new JPEGEncodeParam());\\n\\t\\t\\t}\\n\\t\\t\\telse if (principal.getFglobal().getFileFilter().getDescription().equals(filtroT.getDescription()))\\n\\t\\t\\t{// Guardar como TIFF\\n\\t\\t\\t\\tint profundidad = pep.getEP().getMarcada();\\n\\t\\t\\t\\t// Cubre todas las posibilidades (¿esto guarda los metadatos?)\\n\\t\\t\\t\\tTiledImage tiled = null;\\n\\t\\t\\t\\tif (profundidad != ElegirProfundidad.OCHO)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttiled = \\n ElegirProfundidad.crearProfundidadReducida(\\n ipixel_o, \\n profundidad, \\n imagen_original.getWidth(), \\n imagen_original.getHeight());\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t//imgGuardar = djai.getSource();\\n\\t\\t\\t\\tParameterBlock pb = new ParameterBlock();\\n\\t\\t\\t\\tif (profundidad != ElegirProfundidad.OCHO)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tpb.addSource(tiled);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tpb.addSource(imagen_original);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tpb.add(guardar);\\n\\t\\t\\t\\tpb.add(\\\"TIFF\\\");\\n\\t\\t\\t\\tpb.add(false); //UseProperties\\n\\t\\t\\t\\tpb.add(false); //Transcode\\n\\t\\t\\t\\tpb.add(true); //VerifyOutput\\n\\t\\t\\t\\tpb.add(false); //AllowPixelReplacement\\n\\t\\t\\t\\tpb.add(null); //TileSize\\n\\t\\t\\t\\tpb.add(streamData);\\n\\t\\t\\t\\tpb.add(imageData);\\n\\t \\t\\t\\tJAI.create(\\\"imagewrite\\\", pb);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//JAI.create(\\\"imagewrite\\\",tiled,guardar.getPath(),\\\"TIFF\\\");\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{// No tiene extensión o es una extensión extraña\\n\\t\\t\\t\\tJAI.create(\\\"imagewrite\\\",imagen_original,guardar.getPath()+\\\".tif\\\",\\\"TIFF\\\");\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\t\\t\\t \\n\\t\\telse \\n\\t\\t{\\n\\t\\t\\tdibujarMensajesError(retval);\\n\\t\\t} \\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"public static void main(String[] args) {\\n File myFile = new File (\\\"d:/names.txt\\\");\\r\\n // para saber si el archivo no existe, devuelve true o false\\r\\n System.out.println(\\\"file.exists(): \\\" + myFile.exists());\\r\\n System.out.println(\\\"file.isDirectory(): \\\" + myFile.isDirectory());\\r\\n // para saber la fecha de modificación\\r\\n System.out.println(\\\"file.lastModified(): \\\" + myFile.lastModified());\\r\\n // para saber el nombre del archivo\\r\\n System.out.println(\\\"file.getName(): \\\" + myFile.getName());\\r\\n // para saber la ruta\\r\\n System.out.println(\\\"file.getPath(): \\\" + myFile.getPath());\\r\\n // para saber el tamaño en bytes que ocupa en disco\\r\\n System.out.println(\\\"file.length(): \\\" + myFile.length()+\\\" bytes\\\");\\r\\n // para saber si es de lectura, devuelve true o false\\r\\n System.out.println(\\\"file.canRead():\\\" + myFile.canRead());\\r\\n\\r\\n //File newfolder = new File(\\\"D:/carpeta con archivos año mío\\\");\\r\\n //System.out.println(newfolder.mkdir());\\r\\n\\r\\n // si fuera un directorio, para saber los archivos que contiene\\r\\n File carpeta = new File(\\\"D:/carpeta_con_archivos\\\");\\r\\n System.out.println(\\\"----listado archivos D:/carpeta_archivos------\\\");\\r\\n for (String archivo : carpeta.list()) {\\r\\n System.out.println(archivo);\\r\\n }\\r\\n\\r\\n //agregar una linea nueva a un archivo existente (METODO 1)\\r\\n /*try {\\r\\n //abra el archivo , TRUE en un forma append (agregar nuevos valores)\\r\\n FileWriter myFile2 = new FileWriter(\\\"d:/names.txt\\\", true);\\r\\n //cargar en memora ram del SO el contenido del archivo\\r\\n BufferedWriter dataFile = new BufferedWriter(myFile2);\\r\\n //agregar una nueva linea\\r\\n dataFile.write(\\\"\\\\nnueva linea tres\\\");\\r\\n dataFile.close();\\r\\n\\r\\n } catch (IOException e) {\\r\\n e.printStackTrace();\\r\\n }*/\\r\\n //agregar una linea nueva a un archivo existente (METODO 1 optimizado)\\r\\n /*try{\\r\\n BufferedWriter dataFile = new BufferedWriter(new FileWriter(\\\"d:/names.txt\\\",true));\\r\\n //agregamos la nueva linea\\r\\n dataFile.write(\\\"nueva linea sin borrar\\\");\\r\\n dataFile.close();\\r\\n } catch (Exception e) {\\r\\n e.printStackTrace();\\r\\n }*/\\r\\n // agregar nueva linea con metodo super optimizado en lineas (METODO FLAHS)\\r\\n try{\\r\\n PrintWriter myFile3 = new PrintWriter(new BufferedWriter(new FileWriter(\\\"d:/names.txt\\\", true)));\\r\\n myFile3.println(\\\"Otra nueva línea mezclando las dos librerías (PrintWriter + FileWriter) \\\");\\r\\n myFile3.close();\\r\\n\\r\\n } catch (Exception e) {\\r\\n e.printStackTrace();\\r\\n }\\r\\n\\r\\n\\r\\n }\",\n \"public AsociarArchivoSerializado(String nuevoMaest, String registro){\\n try{\\n salNuevoMaest = new ObjectOutputStream(\\n Files.newOutputStream(Paths.get(nuevoMaest)));\\n \\n salRegistro = new ObjectOutputStream(\\n Files.newOutputStream(Paths.get(registro)));\\n }\\n catch(IOException iOException){\\n System.err.println(\\\"Error al abrir el archivo. Terminado.\\\");\\n System.exit(1);\\n }\\n }\",\n \"public void DesSerializar() throws FileNotFoundException {\\n try {\\n FileInputStream archivo = new FileInputStream(\\\"SerializacionEdificios\\\");\\n ObjectInputStream entrada = new ObjectInputStream(archivo);\\n ArrayList<Edificio> edificiosDes = (ArrayList<Edificio>) entrada.readObject();\\n archivo = new FileInputStream(\\\"SerializacionEstudiantes\\\");\\n entrada = new ObjectInputStream(archivo);\\n ArrayList<Estudiante> estudiantesDes = (ArrayList<Estudiante>) entrada.readObject();\\n archivo = new FileInputStream(\\\"SerializacionProfesores\\\");\\n entrada = new ObjectInputStream(archivo);\\n ArrayList<Profesor> profesoresDes = (ArrayList<Profesor>) entrada.readObject();\\n archivo = new FileInputStream(\\\"SerializacionAdministradores\\\");\\n entrada = new ObjectInputStream(archivo);\\n ArrayList<Administrador> administradoresDes = (ArrayList<Administrador>) entrada.readObject();\\n edificios = edificiosDes;\\n estudiantes = estudiantesDes;\\n profesores = profesoresDes;\\n administradores = administradoresDes;\\n entrada.close();\\n }\\n catch (IOException e){\\n e.printStackTrace();\\n }\\n catch (ClassNotFoundException e){\\n e.printStackTrace();\\n }\\n\\n\\n }\",\n \"private BufferedWriter abrirArquivoEscrita() {\\n\\t\\ttry{\\n\\t\\t\\tBufferedWriter file = null;\\n\\t\\t\\tfile = new BufferedWriter(new FileWriter(caminho));\\n\\t\\t\\treturn file;\\n\\t\\t}catch(Exception e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"public void escribir(String cadena) throws IOException\\n {\\n fileWriter = new FileWriter(archivo);\\n printWriter = new PrintWriter(fileWriter);\\n printWriter.println(cadena);\\n }\",\n \"private static void saveTemplateFile(File file, Template newTemp) {\\n String string = newTemp.toString();\\n\\n //Save File\\n try {\\n FileOutputStream fos = new FileOutputStream(file);\\n fos.write(string.getBytes());\\n fos.flush();\\n fos.close();\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n\\n //Read back file and check against original.\\n try {\\n FileInputStream fis = new FileInputStream(file);\\n byte[] data = new byte[(int)file.length()];\\n\\n fis.read(data);\\n String tmpIN = new String(data,\\\"UTF-8\\\");\\n Log.d(\\\"Behave\\\",\\\"Read Back Template: \\\"+ tmpIN);\\n Log.d(\\\"Behave\\\",\\\"Template Saved Correctly: \\\"+tmpIN.equals(string));\\n } catch (FileNotFoundException | UnsupportedEncodingException e) {\\n e.printStackTrace();\\n } catch (IOException e) {\\n // Separate catch block for IOException because other exceptions are encapsulated by it.\\n Log.e(\\\"Behave\\\", \\\"IOException not otherwise caught\\\");\\n e.printStackTrace();\\n }\\n }\",\n \"private void jButtonCreateInsexActionPerformed(java.awt.event.ActionEvent evt) {\\n try {\\n lstPerson = new ArrayList();\\n Properties prop = new Properties();//почти тоже самое что ini файлы\\n content = Files.readAllLines(Paths.get(PATH_FILE_SOURCE), Charset.forName(\\\"cp1251\\\"));\\n String s = content.get(0);\\n for (int i = 0, j = 1; i < s.length(); i += 128, j++) {\\n Person p = new Person(\\n s.substring(i, i + 30).trim(),\\n s.substring(i + 30, i + 50).trim(),\\n s.substring(i + 50, i + 70).trim(),\\n s.substring(i + 70, i + 78).trim(),\\n s.substring(i + 78).trim(), j);\\n lstPerson.add(p);\\n }\\n\\n for (Person person : lstPerson) {\\n prop.put(person.getSurname().toUpperCase(), Integer.toString(person.getID()));\\n }\\n prop.storeToXML(new FileOutputStream(FILE_PATH_INDEX_SURNAME), \\\"LIB\\\");//можно и без xml\\n jLabelStatusBar.setForeground(Color.magenta);\\n jLabelStatusBar.setText(\\\"Индексный файл создан!\\\");\\n jLabelStatusBar.setForeground(Color.BLACK);\\n\\n } catch (IOException ex) {\\n jLabelStatusBar.setForeground(Color.red);\\n jLabelStatusBar.setText(\\\"Индексный файл не создан!\\\");\\n Logger.getLogger(NewJFrame1.class.getName()).log(Level.SEVERE, null, ex);\\n }\\n }\",\n \"private static boolean writeStringToFile(java.io.File r6, java.lang.String r7) {\\n /*\\n if (r7 != 0) goto L_0x0004\\n java.lang.String r7 = \\\"\\\"\\n L_0x0004:\\n r1 = 0\\n r2 = 0\\n java.io.File r4 = r6.getParentFile() // Catch:{ IOException -> 0x0020 }\\n ensureDirectory(r4) // Catch:{ IOException -> 0x0020 }\\n java.io.FileWriter r3 = new java.io.FileWriter // Catch:{ IOException -> 0x0020 }\\n r3.<init>(r6) // Catch:{ IOException -> 0x0020 }\\n r3.write(r7) // Catch:{ IOException -> 0x003c, all -> 0x0039 }\\n r1 = 1\\n if (r3 == 0) goto L_0x003f\\n r3.close() // Catch:{ IOException -> 0x001d }\\n r2 = r3\\n L_0x001c:\\n return r1\\n L_0x001d:\\n r4 = move-exception\\n r2 = r3\\n goto L_0x001c\\n L_0x0020:\\n r0 = move-exception\\n L_0x0021:\\n java.lang.String r4 = \\\"PluginNativeHelper\\\"\\n java.lang.String r5 = \\\"error occurs while writing file\\\"\\n com.tencent.component.utils.log.LogUtil.d(r4, r5, r0) // Catch:{ all -> 0x0030 }\\n if (r2 == 0) goto L_0x001c\\n r2.close() // Catch:{ IOException -> 0x002e }\\n goto L_0x001c\\n L_0x002e:\\n r4 = move-exception\\n goto L_0x001c\\n L_0x0030:\\n r4 = move-exception\\n L_0x0031:\\n if (r2 == 0) goto L_0x0036\\n r2.close() // Catch:{ IOException -> 0x0037 }\\n L_0x0036:\\n throw r4\\n L_0x0037:\\n r5 = move-exception\\n goto L_0x0036\\n L_0x0039:\\n r4 = move-exception\\n r2 = r3\\n goto L_0x0031\\n L_0x003c:\\n r0 = move-exception\\n r2 = r3\\n goto L_0x0021\\n L_0x003f:\\n r2 = r3\\n goto L_0x001c\\n */\\n throw new UnsupportedOperationException(\\\"Method not decompiled: com.tencent.component.plugin.PluginNativeHelper.writeStringToFile(java.io.File, java.lang.String):boolean\\\");\\n }\",\n \"public void save(String newFilePath) {\\r\\n File deletedFile = new File(path);\\r\\n deletedFile.delete();\\r\\n path = newFilePath;\\r\\n File dataFile = new File(path);\\r\\n File tempFile = new File(path.substring(0, path.lastIndexOf(\\\"/\\\")) + \\\"/myTempFile.txt\\\");\\r\\n\\r\\n try {\\r\\n BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(\\r\\n new FileOutputStream(tempFile), \\\"UTF-8\\\"));\\r\\n\\r\\n for (String line : data) {\\r\\n bw.write(line);\\r\\n bw.newLine();\\r\\n }\\r\\n\\r\\n bw.close();\\r\\n dataFile.delete();\\r\\n tempFile.renameTo(dataFile);\\r\\n } catch (IOException ex) {\\r\\n System.out.println(\\\"IOException in save2 : FileData\\\");\\r\\n }\\r\\n }\",\n \"public static void main(String[] args) {\\n String filePath = \\\"C:\\\\\\\\Users\\\\\\\\Catalin\\\\\\\\Desktop\\\\\\\\fisierdecitit.txt\\\";\\n\\n try {\\n //incarcarea fisierului in memoria programului cu ajutorul ob fileReader\\n FileReader fileReader = new FileReader(filePath);\\n //incepem citirea din fisier linie cu line cu ajutorul BufferedReader\\n BufferedReader bufferedReader = new BufferedReader(fileReader);\\n String text = bufferedReader.readLine();\\n while (text != null) {\\n System.out.println(\\\"Linia citita este: \\\" + text);\\n String[] array = text.split(\\\" \\\");\\n System.out.println(array.length);\\n text = bufferedReader.readLine();\\n\\n }\\n\\n } catch (IOException e) {\\n System.out.println(\\\"A aparut o eroare: \\\" + e.getMessage());\\n }\\n\\n\\n //invatam sa scriem intr un fisier\\n String filePathToWrite = \\\"C:\\\\\\\\Users\\\\\\\\Catalin\\\\\\\\Desktop\\\\\\\\fisierdescris.txt\\\";\\n try {\\n FileWriter fileWriter = new FileWriter(filePathToWrite);\\n BufferedWriter bufferedWriter = new BufferedWriter(fileWriter);\\n String text = \\\"Mama lu' Ana nu are nici mere si nici pere.\\\";\\n String text2 = \\\"smhjhdgfdsbfkdhj\\\";\\n\\n bufferedWriter.write(text2);\\n bufferedWriter.newLine();\\n bufferedWriter.write(text);\\n bufferedWriter.flush();\\n bufferedWriter.close();\\n } catch (IOException e) {\\n System.out.println(\\\"A aparut o exceptie: \\\" + e.getMessage());\\n }\\n\\n\\n }\",\n \"public static void overwritePal() throws Exception {\\n\\n\\t\\tString fileName = PropertiesFile.getInstance().getProperty(\\\"input_qualifier\\\")+ Constants.PALETTE_FILE_EXTENSION;\\n\\t\\tFile templateFile = new File(getFullyQualifiedFileName(\\\"cell\\\") +\\\"/\\\" + fileName );\\n\\n\\t\\tFile newPal = new File(getRISEInputFolder()+\\\"/\\\" + fileName );\\n\\n\\t\\tFileInputStream input = new FileInputStream(templateFile);\\n\\t\\twriter(input, newPal);\\n\\t}\",\n \"public void zerarSistema() {\\r\\n\\t\\tarquivo.clear();\\r\\n\\t\\tcriaRepositorio();\\r\\n\\t}\",\n \"@Override\\n\\tpublic void resolver() \\n\\t{\\n\\t\\tPrintWriter sal = null;\\n\\t\\ttry \\n\\t\\t{\\n\\t\\t\\tsal = new PrintWriter(new File(salida));\\n\\t\\t} \\n\\t\\tcatch (FileNotFoundException e) \\n\\t\\t{\\n\\t\\t\\tSystem.out.println(\\\"Ha ocurrido un error con el archivo de salida\\\");\\n\\t\\t\\tSystem.exit(1);\\n\\t\\t}\\n\\t\\tArrayList<ClaveValor> ninos = new ArrayList<ClaveValor>();\\n\\t\\t//Este for es el for del archivo cuando voy leyendo los nombres.\\n\\t\\tfor(String s : nombres)\\n\\t\\t{\\n\\t\\t\\tClaveValor aux = new ClaveValor(s,1);\\n\\t\\t\\tif(ninos.contains(aux))\\n\\t\\t\\t\\tninos.get(ninos.indexOf(aux)).valor++;\\n\\t\\t\\telse\\n\\t\\t\\t\\tninos.add(aux);\\n\\t\\t}\\n\\t\\t//Ordeno las nombres de los ninos por repeticion.\\n\\t\\tCollections.sort(ninos, new Comparator<Object>() {\\n\\t\\t @Override\\n\\t\\t public int compare(Object a1, Object a2) \\n\\t\\t {\\n\\t\\t return ((ClaveValor)a2).valor-((ClaveValor)a1).valor;\\n\\t\\t }\\n\\t\\t});\\n\\t\\t\\n\\t\\tfor(int i = 0; i<n && i < ninos.size(); i++)\\n\\t\\t\\tsal.println(ninos.get(i));\\n\\tsal.close();\\n\\t}\",\n \"private void updateDatFile() {\\n\\t\\tIOService<?> ioManager = new IOService<Entity>();\\n\\t\\ttry {\\n\\t\\t\\tioManager.writeToFile(FileDataWrapper.productMap.values(), new Product());\\n\\t\\t\\tioManager = null;\\n\\t\\t} catch (Exception ex) {\\n\\t\\t\\tDisplayUtil.displayValidationError(buttonPanel, StoreConstants.ERROR + \\\" saving new product\\\");\\n\\t\\t\\tioManager = null;\\n\\t\\t}\\n\\t}\",\n \"public void LecturaEscrituraOBjetosManual(File rutaEscribir) throws IOException {\\n ObjectOutputStream escribir = new ObjectOutputStream(\\n new BufferedOutputStream(\\n new FileOutputStream(rutaEscribir)));\\n\\n Scanner read = new Scanner(System.in);\\n System.out.println(\\\"¿Cuántas carteleras agregarás?\\\");\\n //se ingresa cantidad de carteleras, para generar el array\\n //se crea el array y se piden los datos de cada objeto\\n //se agrega cada objeto al array y lo devuelve con la información rellenada\\n Cartelera[] lista = Cartelera.listaCartelera(read.nextInt());\\n\\n //se escribe un array de cartelera. \\n escribir.writeObject(lista);\\n escribir.close();\\n }\",\n \"private void fecharArquivoLeitura(BufferedReader file) {\\n\\t\\ttry {\\n\\t\\t\\tfile.close();\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t}\",\n \"private void resetINIFile(){\\n\\tFileOutputStream outstream = null;\\n System.out.println(\\\"do reset\\\");\\n InputStream instream = brokenJavaNaming(\\\"UI.ini\\\");\\n if (instream == null){\\n System.out.println(\\\"instream null looking for UI.ini\\\");\\n System.exit(1);\\n }\\n \\n \\ttry{\\n \\t File outfile = iniFile;\\n \\n \\t outstream = new FileOutputStream(outfile);\\n \\n \\t byte[] buffer = new byte[1024];\\n \\n \\t int length;\\n \\t /*copying the contents from input stream to\\n \\t * output stream using read and write methods\\n \\t */\\n \\t while ((length = instream.read(buffer)) > 0){\\n \\t \\toutstream.write(buffer, 0, length);\\n \\t }\\n\\n \\t //Closing the input/output file streams\\n \\t instream.close();\\n \\t outstream.close();\\n \\t \\n System.out.println(\\\"File copied successfully!!\\\");\\n \\n \\t}catch(IOException ioe){\\n \\t\\tioe.printStackTrace();\\n \\t }\\n }\",\n \"static void GuardarToken(int clase, String valor){\\r\\n try{\\r\\n String archivo;\\r\\n FileWriter fr;\\r\\n BufferedWriter br;\\r\\n\\r\\n archivo = \\\"token.txt\\\";\\r\\n fr = new FileWriter(archivo, true);\\r\\n br = new BufferedWriter(fr);\\r\\n\\r\\n br.write(clase + \\\" \\\" + valor);\\r\\n br.newLine();\\r\\n\\r\\n br.close();\\r\\n }\\r\\n catch(Exception e) {\\r\\n e.printStackTrace();\\r\\n }\\r\\n }\",\n \"public void Horas() {\\r\\n File archivo = null;\\r\\n FileReader fr = null;\\r\\n BufferedReader br = null;\\r\\n \\r\\n try {\\r\\n // Apertura del fichero y creacion de BufferedReader para poder\\r\\n // hacer una lectura comoda (disponer del metodo readLine()).\\r\\n \\r\\n \\r\\n // Lectura del fichero\\r\\n String linea;\\r\\n \\r\\n for (a=0;a<5;a++){\\r\\n if (a==0){\\r\\n categoria=\\\"Embarazadas\\\";\\r\\n }\\r\\n if (a==1){\\r\\n categoria=\\\"Regulares\\\";\\r\\n }\\r\\n if (a==2){\\r\\n categoria=\\\"Discapacitados\\\";\\r\\n }\\r\\n if (a==3){\\r\\n categoria=\\\"Mayores\\\";\\r\\n }\\r\\n if (a==4){\\r\\n categoria=\\\"Corporativos\\\";\\r\\n }\\r\\n archivo = new File (System.getProperty(\\\"user.dir\\\")+\\\"/Clientes/\\\"+categoria+\\\".txt\\\");\\r\\n fr = new FileReader (archivo);\\r\\n br = new BufferedReader(fr);\\r\\n while((linea=br.readLine())!=null)\\r\\n if (leerHora == contador){\\r\\n comparar = linea.substring(0,2);\\r\\n \\r\\n if (\\\"09\\\".equals(comparar)){\\r\\n nueve++;\\r\\n }\\r\\n if (\\\"10\\\".equals(comparar)){\\r\\n diez++;\\r\\n }\\r\\n if (\\\"11\\\".equals(comparar)){\\r\\n once++;\\r\\n }\\r\\n if (\\\"13\\\".equals(comparar)){\\r\\n una++;\\r\\n }\\r\\n if (\\\"14\\\".equals(comparar)){\\r\\n dos++;\\r\\n }\\r\\n if (\\\"15\\\".equals(comparar)){\\r\\n tres++;\\r\\n }\\r\\n if (\\\"16\\\".equals(comparar)){\\r\\n cuatro++;\\r\\n }\\r\\n \\r\\n contador +=1;\\r\\n leerHora += 6;\\r\\n }\\r\\n else{\\r\\n contador += 1;\\r\\n }\\r\\n }\\r\\n }\\r\\n catch(Exception e){\\r\\n e.printStackTrace();\\r\\n }finally{\\r\\n // En el finally cerramos el fichero, para asegurarnos\\r\\n // que se cierra tanto si todo va bien como si salta \\r\\n // una excepcion.\\r\\n try{ \\r\\n if( null != fr ){ \\r\\n fr.close(); \\r\\n } \\r\\n }catch (Exception e2){ \\r\\n e2.printStackTrace();\\r\\n }\\r\\n }\\r\\n }\",\n \"private String readAndReplaceString(String fileName, String packageName, String className) {\\n String baseFilePath = \\\"com.bgn.baseframe.base\\\";\\n\\n String time = new SimpleDateFormat(\\\"yyyy-MM-dd HH:mm\\\").format(new Date());\\n String path = (codeType == 0 ? \\\"kotlin/\\\" : \\\"java/\\\");\\n return readFile(path + fileName + \\\".txt\\\")\\n .replace(\\\"&time&\\\", time)\\n .replace(\\\"&package&\\\", packageName)\\n .replace(\\\"&mvp&\\\", baseFilePath)\\n .replace(\\\"&className&\\\", className);\\n }\",\n \"public void Sauvegarder(Partie p) {\\n if (SaveNum > 0 && SaveNum < 10) {\\n //System.out.println(\\\"index ok\\\");\\n try {\\n if (erase) {\\n slot[SaveNum - 1].delete();\\n }\\n //System.out.println(\\\"Try start\\\");\\n //File f = new File(i + \\\".\\\" + p.getJoueur1().getNom() + \\\"-vs-\\\" + p.getJoueur2().getNom() + \\\".ser\\\");\\n SaveName = (SaveNum - 1 + \\\"-\\\" + SaveName + \\\".ser\\\");\\n File fichier = new File(SavePath + SaveName);\\n FileOutputStream fos = new FileOutputStream(fichier);\\n ObjectOutputStream oos = new ObjectOutputStream(fos);\\n //System.out.println(\\\"ok\\\");\\n oos.writeObject(p);\\n //System.out.println(\\\"ok\\\");\\n oos.close();\\n //slot[i] = fichier;\\n SaveName = \\\"Sauvegarde\\\";\\n //System.out.println(\\\"Save Done\\\" + SaveNum);\\n SaveNum = 20;\\n } catch (IOException | NullPointerException e) {\\n System.out.println(\\\"Erreur lors de la sauvegarde du fichier\\\");\\n }\\n }\\n }\",\n \"public void analizarArchivoDeLog(String nombreArchivo)\\n {\\n archivoLog.clear();\\n try{\\n File log = new File(nombreArchivo);\\n Scanner sc = new Scanner(log);\\n while (sc.hasNextLine()) {\\n String linea = sc.nextLine();\\n String[] arrayDeString = linea.split(\\\" \\\");\\n archivoLog.add(new Acceso (Integer.parseInt(arrayDeString[0]),Integer.parseInt(arrayDeString[1]),Integer.parseInt(arrayDeString[2]),Integer.parseInt(arrayDeString[3]),Integer.parseInt(arrayDeString[4])));\\n }\\n sc.close();\\n }\\n\\n catch (FileNotFoundException e){\\n e.printStackTrace();\\n }\\n }\",\n \"public void recevoirDossier() {\\n try {\\n fileInfo = (FileInfo) ois.readObject(); //lire les informations du fichier\\n //chemin du fichier en sortie\\n String outputFile = fileInfo.getDestinationDirectory() + fileInfo.getFilename();\\n dstFile = new File(outputFile);\\n if (!new File(fileInfo.getDestinationDirectory()).exists()) { //si le fichier n'existe pas\\n new File(fileInfo.getDestinationDirectory()).mkdirs(); //creation du fichier\\n fos = new FileOutputStream(dstFile);\\n fos.write(fileInfo.getFileData()); //ecrire les données dans le fichier\\n fos.flush();\\n fileInfo.setFileData(null);\\n System.gc();\\n fos.close();\\n dstFile.setLastModified(fileInfo.getModifier());\\n\\n } else if (dstFile.lastModified() < fileInfo.getModifier()) { //si le fichier existe et que c'est une nouvelle version alors\\n fos = new FileOutputStream(dstFile);\\n fos.write(fileInfo.getFileData());\\n fos.flush();\\n fileInfo.setFileData(null);\\n fos.close();\\n dstFile.setLastModified(fileInfo.getModifier());\\n }\\n } catch (IOException | ClassNotFoundException ex) {\\n Logger.getLogger(RecevoirFichier.class.getName()).log(Level.SEVERE, null, ex);\\n }\\n }\",\n \"@Override\\n\\tpublic void init() throws RemoteException {\\n\\t\\ttry {\\n\\t\\t\\tFile f5 = new File(\\\"TxtData/warein.txt\\\");\\n\\t\\t\\tFileWriter fw5 = new FileWriter(f5);\\n\\t\\t\\tBufferedWriter bw1 = new BufferedWriter(fw5);\\n\\t\\t\\tbw1.write(\\\"\\\");\\n\\t\\t} catch (Exception e) {\\n\\n\\t\\t}\\n\\t}\",\n \"public static void genArchivoTokens(){\\r\\n\\t\\tString path = AnManager.getPath() + File.separator +\\\"Resultados Grupo81\\\" + File.separator+ \\\"Tokens.txt\\\";\\r\\n\\t\\tFile f = new File(path);\\r\\n\\t\\tf.getParentFile().mkdirs(); \\r\\n\\t\\ttry {\\r\\n\\t\\t\\tf.delete(); //Eliminamos si existe algo antes\\r\\n\\t\\t\\tf.createNewFile();\\r\\n\\t\\t} catch (IOException e) {\\r\\n\\t\\t\\tJOptionPane.showMessageDialog(null, \\\"Fallo al crear archivo tokens\\\");\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public void salvaAula()\\n { \\n JFileChooser fileChooser = new JFileChooser();\\n String strFilePlan = \\\"out/\\\" + this.myAula.getNome()+ \\\"_plan\\\"+ \\\".png\\\";\\n System.out.println(\\\"scrivo su file \\\"+ strFilePlan);\\n File fp = new File(strFilePlan);\\n String strFileDati = \\\"out/\\\" + this.myAula.getNome()+ \\\"_dati\\\"+ \\\".png\\\";\\n File fd = new File(strFileDati);\\n fileChooser.setSelectedFile(fd);\\n try\\n { \\n ImageIO.write(this.getPlan(), \\\"png\\\", fp);\\n ImageIO.write(this.getDati(), \\\"png\\\", fd);\\n }\\n catch (Exception ex)\\n {\\n System.out.println(\\\"errore in Salvataggio aula su file\\\");\\n }\\n \\n JOptionPane.showMessageDialog(this, \\\"file salvati correttamente sotto cartella /out\\\",\\\"Info\\\", JOptionPane.INFORMATION_MESSAGE);\\n }\",\n \"final public void GuardarCuadruplos() throws ParseException {\\ntry {\\n // Crea un cuadro de dialogo. El input se guarda en strNomArchivo\\n String strNomArchivo = \\\"\\\";\\n\\n // Si el campo quedo vacío o se cerró la ventana, volver a mostrarlo\\n while (strNomArchivo==null || strNomArchivo.trim().isEmpty()) {\\n strNomArchivo = (String)JOptionPane.showInputDialog(\\n null, \\\"Escribe el nombre que tendra el archivo\\\", \\\"Input\\\", JOptionPane.PLAIN_MESSAGE, null, null, null);\\n }\\n\\n // objeto printwriter con el nombre del archivo\\n PrintWriter codigoObj = new PrintWriter(strNomArchivo);\\n\\n // Agrega uno por uno los cuadruplos al archivo\\n for (int i=0; i < cuadruplos.size(); i++) {\\n codigoObj.println( Cuadruplo.returnCuadruplo( (Cuadruplo)cuadruplos.get(i) ) );\\n }\\n\\n // cierra el archivo\\n codigoObj.close();\\n\\n } catch(FileNotFoundException e) {\\n System.out.println(e.getMessage());\\n }\\n }\",\n \"public void LoadTxt(File Arquivo) {\\n if (Arquivo.exists()) {\\r\\n\\r\\n try {\\r\\n\\r\\n FileReader FR = new FileReader(Arquivo);\\r\\n BufferedReader BW = new BufferedReader(new InputStreamReader(new FileInputStream(Arquivo.getAbsolutePath()), \\\"ISO-8859-1\\\"));\\r\\n\\r\\n //BufferedReader BW = new BufferedReader(FR);\\r\\n\\r\\n String dados;\\r\\n String[] paraArray = new String[3];\\r\\n String matricula;\\r\\n \\r\\n String serie = Arquivo.getName();\\r\\n int pos = serie.lastIndexOf(\\\".\\\");\\r\\n if (pos > 0) {\\r\\n serie = serie.substring(0, pos);\\r\\n }\\r\\n\\r\\n Sala novaSala = new Sala(serie); //CRIANDO SALA COM NOME DE TURMA\\r\\n salas2.add(novaSala); // ADICIONANDO SALA NA LISTA DE SALAS\\r\\n while ((dados = BW.readLine()) != null) {\\r\\n paraArray = dados.split(\\\";\\\");\\r\\n\\r\\n matricula = /*Integer.parseInt*/ (paraArray[0]);\\r\\n //senha = /*Integer.parseInt*/(paraArray[2]);\\r\\n Dados novoDado = new Dados(matricula, paraArray[1], paraArray[2]);\\r\\n\\r\\n novoDado.setSerie(serie); //ADICIONANDO TURMA AO DADO\\r\\n novaSala.getDadosalas().add(novoDado); //ADICIONANDO DADOS A LISTA DE DADOS QUE ESTA EM SALA\\r\\n\\r\\n }\\r\\n \\r\\n\\r\\n BW.close();\\r\\n FR.close();\\r\\n\\r\\n } catch (Exception e) {\\r\\n System.out.println(\\\"Erro ao carregar arquivo acima\\\");\\r\\n System.out.println(e.getMessage());\\r\\n\\r\\n }\\r\\n\\r\\n } else {\\r\\n System.out.println(\\\"Nenhum arquivo de dados encontrado\\\");\\r\\n }\\r\\n\\r\\n }\",\n \"private void cerrarSalRegistro(){\\n try{\\n if(salRegistro != null)\\n salRegistro.close();\\n }\\n catch(IOException iOException){\\n System.err.println(\\\"Error al cerrar el archivo. Terminado.\\\");\\n System.exit(1);\\n }\\n }\",\n \"public void gerarCupom(String cliente, String vendedor,List<Produto> produtos, float totalVenda ) throws IOException {\\r\\n \\r\\n File arquivo = new File(\\\"cupomFiscal.txt\\\");\\r\\n String produto =\\\" \\\"; \\r\\n if(arquivo.exists()){\\r\\n System.out.println(\\\"Arquivo localizado com sucessso\\\");\\r\\n }else{\\r\\n System.out.println(\\\"Arquivo não localizado, será criado outro\\\");\\r\\n arquivo.createNewFile();\\r\\n } \\r\\n \\r\\n for(Produto p: produtos){\\r\\n produto += \\\" \\\"+p.getQtd()+\\\" \\\"+ p.getNome()+\\\" \\\"+p.getMarca()+\\\" \\\"+ p.getPreco()+\\\"\\\\n \\\";\\r\\n }\\r\\n \\r\\n \\r\\n \\r\\n FileWriter fw = new FileWriter(arquivo, true);\\r\\n BufferedWriter bw = new BufferedWriter(fw);\\r\\n \\r\\n \\r\\n bw.write(\\\" \\\"+LOJA);\\r\\n bw.newLine();\\r\\n bw.write(\\\"---------------------------------------\\\");\\r\\n bw.newLine();\\r\\n bw.write(\\\"CLIENTE CPF\\\");\\r\\n bw.newLine();\\r\\n bw.write(cliente);\\r\\n bw.newLine();\\r\\n bw.write(\\\"---------------------------------------\\\");\\r\\n bw.newLine();\\r\\n bw.write(DateCustom.dataHora());\\r\\n bw.newLine();\\r\\n bw.write(\\\" CUPOM FISCAL \\\");\\r\\n bw.newLine();\\r\\n bw.write(\\\"QTD DESCRIÇÃO PREÇO\\\");\\r\\n bw.newLine();\\r\\n bw.write(produto);\\r\\n bw.newLine(); \\r\\n bw.write(\\\"---------------------------------------\\\");\\r\\n bw.newLine();\\r\\n bw.write(\\\"TOTAL R$ \\\" + totalVenda);\\r\\n bw.newLine();\\r\\n bw.write(\\\"---------------------------------------\\\");\\r\\n bw.newLine();\\r\\n bw.write(\\\"Vendedor \\\" + vendedor);\\r\\n bw.newLine();\\r\\n bw.newLine();\\r\\n bw.close();\\r\\n fw.close();\\r\\n }\",\n \"private boolean renomeiaArquivo(File origem, File destino)\\n\\t{\\n\\t\\t// Tenta executar o renameTo da classe File. Caso o destino seja em filesystem diferente entao\\n\\t\\t// este comando ira falhar, portanto realiza a copia do arquivo, executa o delete para entao\\n\\t\\t// retornar a funcao\\n\\t\\tboolean renomeou = origem.renameTo(destino);\\n\\t\\t// Se o comando falhou entao tenta copiar e apagar o arquivo\\n\\t\\tif (!renomeou)\\n\\t\\t{\\n\\t\\t\\trenomeou = copiaArquivo(origem,destino);\\n\\t\\t\\t// Caso tenha conseguido copiar o arquivo origem para o destino, entao remove o arquivo\\n\\t\\t\\t// origem. Simulacao do move.\\n\\t\\t\\tif (renomeou)\\n\\t\\t\\t\\trenomeou = origem.delete();\\n\\t\\t}\\n\\t\\treturn renomeou;\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.63330466","0.6260972","0.623227","0.6163346","0.6153471","0.6147348","0.61067605","0.6017744","0.60124224","0.6009369","0.59205586","0.5892288","0.5828394","0.5813266","0.5761136","0.572993","0.5706137","0.5700054","0.5694814","0.5680734","0.56720215","0.5665566","0.5656568","0.5637716","0.5631437","0.5628627","0.5621946","0.56211734","0.5613639","0.56054395","0.56027955","0.5594543","0.5588595","0.5585137","0.5581268","0.5576992","0.5576906","0.5563496","0.5558538","0.55537724","0.5549325","0.553109","0.5528981","0.550366","0.5493805","0.5488402","0.54659307","0.5445374","0.5442983","0.543141","0.5431364","0.54280996","0.5422498","0.54172784","0.5414524","0.5413941","0.5411998","0.5402602","0.54015887","0.54012054","0.53893566","0.53889495","0.5386936","0.53865117","0.53545356","0.5353898","0.5351505","0.53451425","0.53442955","0.5343456","0.53422403","0.53417593","0.5334764","0.5334719","0.5333871","0.5332491","0.53294665","0.53275985","0.53210443","0.5319106","0.5318948","0.53179216","0.5316688","0.53112966","0.53097486","0.53068864","0.53012097","0.5299786","0.5299763","0.5292796","0.529183","0.52884775","0.528727","0.5285549","0.5281705","0.52764803","0.5264435","0.5261153","0.52552253","0.5252419","0.5251068"],"string":"[\n \"0.63330466\",\n \"0.6260972\",\n \"0.623227\",\n \"0.6163346\",\n \"0.6153471\",\n \"0.6147348\",\n \"0.61067605\",\n \"0.6017744\",\n \"0.60124224\",\n \"0.6009369\",\n \"0.59205586\",\n \"0.5892288\",\n \"0.5828394\",\n \"0.5813266\",\n \"0.5761136\",\n \"0.572993\",\n \"0.5706137\",\n \"0.5700054\",\n \"0.5694814\",\n \"0.5680734\",\n \"0.56720215\",\n \"0.5665566\",\n \"0.5656568\",\n \"0.5637716\",\n \"0.5631437\",\n \"0.5628627\",\n \"0.5621946\",\n \"0.56211734\",\n \"0.5613639\",\n \"0.56054395\",\n \"0.56027955\",\n \"0.5594543\",\n \"0.5588595\",\n \"0.5585137\",\n \"0.5581268\",\n \"0.5576992\",\n \"0.5576906\",\n \"0.5563496\",\n \"0.5558538\",\n \"0.55537724\",\n \"0.5549325\",\n \"0.553109\",\n \"0.5528981\",\n \"0.550366\",\n \"0.5493805\",\n \"0.5488402\",\n \"0.54659307\",\n \"0.5445374\",\n \"0.5442983\",\n \"0.543141\",\n \"0.5431364\",\n \"0.54280996\",\n \"0.5422498\",\n \"0.54172784\",\n \"0.5414524\",\n \"0.5413941\",\n \"0.5411998\",\n \"0.5402602\",\n \"0.54015887\",\n \"0.54012054\",\n \"0.53893566\",\n \"0.53889495\",\n \"0.5386936\",\n \"0.53865117\",\n \"0.53545356\",\n \"0.5353898\",\n \"0.5351505\",\n \"0.53451425\",\n \"0.53442955\",\n \"0.5343456\",\n \"0.53422403\",\n \"0.53417593\",\n \"0.5334764\",\n \"0.5334719\",\n \"0.5333871\",\n \"0.5332491\",\n \"0.53294665\",\n \"0.53275985\",\n \"0.53210443\",\n \"0.5319106\",\n \"0.5318948\",\n \"0.53179216\",\n \"0.5316688\",\n \"0.53112966\",\n \"0.53097486\",\n \"0.53068864\",\n \"0.53012097\",\n \"0.5299786\",\n \"0.5299763\",\n \"0.5292796\",\n \"0.529183\",\n \"0.52884775\",\n \"0.528727\",\n \"0.5285549\",\n \"0.5281705\",\n \"0.52764803\",\n \"0.5264435\",\n \"0.5261153\",\n \"0.52552253\",\n \"0.5252419\",\n \"0.5251068\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}}],"truncated":false,"partial":true},"paginationData":{"pageIndex":293,"numItemsPerPage":100,"numTotalItems":136513,"offset":29300,"length":100}},"jwt":"eyJhbGciOiJFZERTQSIsImtpZCI6IjVHZDBvd0g5MTM2eDZjc1FvbE1zcktNWUZoRVFoUm5PVVVybEpjOUhaUEEifQ.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sInJlcG9JZHMiOlsiNjc1Mzc3Mjk2YzBkMWNiNGEwNmY5MzlkIl0sImlhdCI6MTc5MDg2MTEzMCwianRpIjoiMzk2ODM2NGQtODlmNi00NjZjLWFmYzktODVjN2ZlZmMxZGI0Iiwic3ViIjoiL2RhdGFzZXRzL25vbWljLWFpL2Nvcm5zdGFjay1qYXZhLXYxIiwiZXhwIjoxNzkwODY0NzMwLCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.FPlj6Mr70owmnIFuraylz0O6gc3HqkeVfyXDNhDt8mHCuqpwwjIvVVLtNHZ4Pfy4IFRKq4X4BkKGSY3vCdw5Ag","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":136513,"numBytesParquet":1558040430}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
query stringlengths 7 33.1k | document stringlengths 7 335k | metadata dict | negatives listlengths 3 101 | negative_scores listlengths 3 101 | document_score stringlengths 3 10 | document_rank stringclasses 102
values |
|---|---|---|---|---|---|---|
Retrieve the Forward Label, if Present | public org.drip.state.identifier.ForwardLabel forwardLabel()
{
org.drip.state.identifier.FloaterLabel floaterLabel = floaterLabel();
return null != floaterLabel && floaterLabel instanceof org.drip.state.identifier.ForwardLabel ?
(org.drip.state.identifier.ForwardLabel) floaterLabel : null;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public org.drip.state.identifier.ForwardLabel forwardLabel()\n\t{\n\t\treturn _lslForward;\n\t}",
"Label getLabel();",
"Label getLabel();",
"Label getLabel();",
"default String getLabel() { return ((TensorImpl<?>) this).find(NDFrame.class).map(NDFrame::getLabel).orElse(\"\"); }",
"public String getForwar... | [
"0.7678048",
"0.64264596",
"0.64264596",
"0.64264596",
"0.6333999",
"0.6321883",
"0.6268819",
"0.6268819",
"0.6107798",
"0.61059695",
"0.6049356",
"0.60335004",
"0.6029269",
"0.60101336",
"0.599874",
"0.599874",
"0.5997783",
"0.59862393",
"0.59825826",
"0.59825826",
"0.598096... | 0.78166515 | 0 |
Retrieve the OTC Fix Float Label, if Present | public org.drip.state.identifier.OTCFixFloatLabel otcFixFloatLabel()
{
org.drip.state.identifier.FloaterLabel floaterLabel = floaterLabel();
return null != floaterLabel && floaterLabel instanceof org.drip.state.identifier.OTCFixFloatLabel ?
(org.drip.state.identifier.OTCFixFloatLabel) floaterLabel : null;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private static DecimalFormat determineLabelFormat(float val) {\n float absval = Math.abs(val);\n\n DecimalFormat rval = null;\n if (absval == 0) {\n rval = new DecimalFormat(\"0.#\");\n } else if (absval < 0.001 || absval > 1e7) {\n rval = new DecimalFormat(\"0.###... | [
"0.62034804",
"0.6129242",
"0.60501325",
"0.5913735",
"0.5891387",
"0.5877262",
"0.5795651",
"0.57477736",
"0.5708618",
"0.5683645",
"0.5658727",
"0.5655863",
"0.56417245",
"0.55814356",
"0.55814356",
"0.5575542",
"0.55645573",
"0.55270755",
"0.55164057",
"0.55135816",
"0.549... | 0.78775287 | 0 |
Retrieve the Funding Label | public org.drip.state.identifier.FundingLabel fundingLabel()
{
return _lsPeriod.get (0).fundingLabel();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public org.drip.state.identifier.FundingLabel fundingLabel()\n\t{\n\t\treturn _lslFunding;\n\t}",
"com.microsoft.schemas.xrm._2011.contracts.Label getLabel();",
"public JLabel getLblFundaciones() {\r\n\t\treturn lblFundaciones;\r\n\t}",
"String getLabel();",
"String getLabel();",
"public java.lang.String... | [
"0.754628",
"0.7325803",
"0.6864824",
"0.6736176",
"0.6736176",
"0.6720462",
"0.66839826",
"0.66748214",
"0.65512526",
"0.65370566",
"0.65370566",
"0.65370566",
"0.65370566",
"0.65060973",
"0.65060973",
"0.65060973",
"0.64391553",
"0.6393706",
"0.63823843",
"0.6359553",
"0.63... | 0.7773978 | 0 |
Retrieve the FX Label | public org.drip.state.identifier.FXLabel fxLabel()
{
return _lsPeriod.get (0).fxLabel();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public String getLabel() {\n return getElement().getChildren()\n .filter(child -> child.getTag().equals(\"label\")).findFirst()\n .get().getText();\n }",
"public java.lang.String getLabel();",
"public String getLabelText();",
"java.lang.String getLabel();",
"public S... | [
"0.7510083",
"0.74692804",
"0.7451905",
"0.7429578",
"0.7350037",
"0.7350037",
"0.7350037",
"0.7350037",
"0.7323705",
"0.73128736",
"0.73128736",
"0.7250884",
"0.7244965",
"0.7228396",
"0.7217888",
"0.72103876",
"0.7208645",
"0.71929383",
"0.71819675",
"0.717678",
"0.717678",... | 0.76403743 | 0 |
Retrieve the Coupon Period List | public java.util.List<org.drip.analytics.cashflow.CompositePeriod> cashFlowPeriod()
{
return _lsPeriod;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"java.util.List<hr.client.appuser.CouponCenter.AppCoupon> \n getCouponListList();",
"hr.client.appuser.CouponCenter.AppCoupon getCouponList(int index);",
"public List<Period> getPeriods() throws PeriodNotFoundException;",
"public List<CouponData> getExpiredCouponList() {\n LocalDateTime currentD... | [
"0.68862456",
"0.6355341",
"0.6323599",
"0.6240389",
"0.6123474",
"0.608212",
"0.6067371",
"0.6031185",
"0.6003095",
"0.5980912",
"0.591051",
"0.59034914",
"0.5888625",
"0.584319",
"0.5817953",
"0.5807437",
"0.58058256",
"0.5800955",
"0.5786275",
"0.57850385",
"0.57683027",
... | 0.6117422 | 5 |
Retrieve the Period Instance enveloping the specified Date | public org.drip.analytics.cashflow.CompositePeriod containingPeriod (
final int iDate)
{
try {
for (org.drip.analytics.cashflow.CompositePeriod cp : _lsPeriod) {
if (cp.contains (iDate)) return cp;
}
} catch (java.lang.Exception e) {
e.printStackTrace();
}
return null;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n @Cacheable(value=AccountingPeriod.CACHE_NAME, key=\"'date='+#p0\")\n public AccountingPeriod getByDate(Date date) {\n Map<String,Object> primaryKeys = new HashMap<String, Object>();\n primaryKeys.put(OLEPropertyConstants.UNIVERSITY_DATE, date);\n UniversityDate universityDate... | [
"0.6004383",
"0.59803575",
"0.59118485",
"0.5829884",
"0.58049774",
"0.57996535",
"0.5787663",
"0.57724804",
"0.57394236",
"0.573721",
"0.56998646",
"0.5665379",
"0.5659187",
"0.5597854",
"0.55706847",
"0.5539156",
"0.5386135",
"0.5383041",
"0.5380427",
"0.5306178",
"0.530462... | 0.5689566 | 11 |
Retrieve the Initial Notional | public double initialNotional()
{
return _lsPeriod.get (0).baseNotional();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public double getNotional() {\n return _notional;\n }",
"public long getInitial() {\n return m_Initial;\n }",
"public Ndimensional getStartPoint();",
"Pair<Integer, Integer> getInitialPosition();",
"public BoundCodeDt<ImagingModalityEnum> getModalityFirstRep() {\n\t\tif (getModality().size() == 0) ... | [
"0.62292373",
"0.59172",
"0.58784544",
"0.5840878",
"0.57342094",
"0.57132715",
"0.57132715",
"0.57132715",
"0.570266",
"0.56852305",
"0.56825584",
"0.5658213",
"0.5579737",
"0.55752975",
"0.5560742",
"0.5548182",
"0.5547017",
"0.5449623",
"0.5435342",
"0.5429598",
"0.5421516... | 0.70450777 | 0 |
Retrieve the Notional corresponding to the specified Date | public double notional (
final int iDate)
throws java.lang.Exception
{
int iEffectiveDate = effective().julian();
int iAdjustedDate = iEffectiveDate > iDate ? iEffectiveDate : iDate;
org.drip.analytics.cashflow.CompositePeriod cp = containingPeriod (iAdjustedDate);
if (null == cp) throw new java.lang.Ex... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public double notional (\n\t\tfinal int iDate1,\n\t\tfinal int iDate2)\n\t\tthrows java.lang.Exception\n\t{\n\t\torg.drip.analytics.cashflow.CompositePeriod cp = containingPeriod (iDate1);\n\n\t\tif (null == cp || !cp.contains (iDate2))\n\t\t\tthrow new java.lang.Exception (\"Stream::notional => Invalid Inputs\");... | [
"0.5830215",
"0.57499677",
"0.5525641",
"0.542927",
"0.5363897",
"0.5356984",
"0.53260565",
"0.52934283",
"0.5243731",
"0.52255666",
"0.5176874",
"0.51702315",
"0.51647896",
"0.51533943",
"0.5146923",
"0.51226383",
"0.5115386",
"0.5115037",
"0.50323945",
"0.5010665",
"0.50013... | 0.64200115 | 0 |
Retrieve the Notional aggregated over the Date Pairs | public double notional (
final int iDate1,
final int iDate2)
throws java.lang.Exception
{
org.drip.analytics.cashflow.CompositePeriod cp = containingPeriod (iDate1);
if (null == cp || !cp.contains (iDate2))
throw new java.lang.Exception ("Stream::notional => Invalid Inputs");
org.drip.quant.common.Arr... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Pair<Date, Date> getForDatesFrame();",
"public DateSavingsSumMap toModelType() {\n DateSavingsSumMap modelDssm = new DateSavingsSumMap();\n this.mappings.forEach(\n jdsp -> {\n try {\n modelDssm.add(jdsp.getDate(), jdsp.getSavings());\n } ... | [
"0.5755842",
"0.4892607",
"0.4818243",
"0.48146477",
"0.48043513",
"0.4777092",
"0.47763124",
"0.47581333",
"0.47503123",
"0.4745598",
"0.47343662",
"0.46821913",
"0.4674756",
"0.46663922",
"0.46275982",
"0.46092623",
"0.46051797",
"0.45939755",
"0.45929897",
"0.45900938",
"0... | 0.48002407 | 5 |
Retrieve the Effective Date | public org.drip.analytics.date.JulianDate effective()
{
try {
return new org.drip.analytics.date.JulianDate (_lsPeriod.get (0).startDate());
} catch (java.lang.Exception e) {
e.printStackTrace();
}
return null;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Date getEffectiveDate() {\r\n return effectiveDate;\r\n }",
"public Date getEffectiveDate() {\n return effectiveDate;\n }",
"public Date getEffectiveDate() {\n return effectiveDate;\n }",
"public Date getEffectiveDate() {\n return effectiveDate;\n }",
"@gw.int... | [
"0.7494322",
"0.7490041",
"0.7490041",
"0.7490041",
"0.74815875",
"0.71854234",
"0.7106792",
"0.70981103",
"0.7006767",
"0.69009805",
"0.684399",
"0.6820626",
"0.67946416",
"0.66917694",
"0.6679812",
"0.6650035",
"0.6605467",
"0.66026855",
"0.6564741",
"0.65444803",
"0.650811... | 0.64407796 | 22 |
Retrieve the Maturity Date | public org.drip.analytics.date.JulianDate maturity()
{
try {
return new org.drip.analytics.date.JulianDate (_lsPeriod.get (_lsPeriod.size() - 1).endDate());
} catch (java.lang.Exception e) {
e.printStackTrace();
}
return null;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public int finalMaturityDate()\n\t{\n\t\treturn _iFinalMaturityDate;\n\t}",
"public DateInfo getDate() {\r\n\t\treturn new DateInfo(super.getDate());\r\n\t\t//return new DateInfo(maturityDate);\r\n\t}",
"ValuationDate getValuationDate();",
"String getCoverageExpirationDate(Record inputRecord);",
"public in... | [
"0.7634364",
"0.68771505",
"0.6712855",
"0.66949147",
"0.6669534",
"0.6624322",
"0.65533787",
"0.65019983",
"0.64803207",
"0.647726",
"0.6417102",
"0.64076227",
"0.63452256",
"0.63313055",
"0.63313055",
"0.63313055",
"0.62907857",
"0.6284071",
"0.6279999",
"0.622612",
"0.6217... | 0.74637014 | 1 |
Retrieve the First Coupon Pay Date | public org.drip.analytics.date.JulianDate firstCouponDate()
{
try {
return new org.drip.analytics.date.JulianDate (_lsPeriod.get (0).endDate());
} catch (java.lang.Exception e) {
e.printStackTrace();
}
return null;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static final BondStream FromFirstPenultimateCouponDate (\n\t\tfinal int iMaturityDate,\n\t\tfinal int iEffectiveDate,\n\t\tfinal int iFinalMaturityDate,\n\t\tfinal int iFirstCouponDate,\n\t\tfinal int iPenultimateCouponDate,\n\t\tfinal int iFreq,\n\t\tfinal double dblCoupon,\n\t\tfinal java.lang.String strC... | [
"0.5973829",
"0.59540784",
"0.58748674",
"0.57953525",
"0.5738173",
"0.5720867",
"0.57201076",
"0.5711842",
"0.56501377",
"0.5631325",
"0.5630206",
"0.5584244",
"0.55762225",
"0.55762225",
"0.55603063",
"0.55589443",
"0.55451745",
"0.5537134",
"0.5531814",
"0.5510804",
"0.547... | 0.7654367 | 0 |
Retrieve the Coupon Currency | public java.lang.String couponCurrency()
{
return _lsPeriod.get (_lsPeriod.size() - 1).couponCurrency();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Currency getCurrency();",
"public Currency getCurrency();",
"String getTradeCurrency();",
"String getSettlementCurrency();",
"public String getCurrency() {\n return this.currency;\n }",
"public String getCurrency()\r\n {\r\n return currency;\r\n }",
"public Pokemon.Currency getCurrency() {... | [
"0.7571733",
"0.73094165",
"0.71618336",
"0.7159344",
"0.70715064",
"0.7050811",
"0.7045247",
"0.6943295",
"0.6923539",
"0.6923539",
"0.6923539",
"0.6923539",
"0.6920498",
"0.69200253",
"0.6911765",
"0.6904372",
"0.6890791",
"0.68834555",
"0.686384",
"0.68291974",
"0.6797878"... | 0.7669337 | 0 |
Retrieve the Pay Currency | public java.lang.String payCurrency()
{
return _lsPeriod.get (_lsPeriod.size() - 1).payCurrency();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Currency getCurrency();",
"String getTradeCurrency();",
"public Currency getCurrency();",
"String getSettlementCurrency();",
"public String getCurrency()\r\n {\r\n return currency;\r\n }",
"public String getCurrency() {\n return this.currency;\n }",
"public String getCurrency() {\r\n ... | [
"0.8309743",
"0.8060724",
"0.79364353",
"0.7788456",
"0.7683507",
"0.7654515",
"0.75904125",
"0.75800365",
"0.75684303",
"0.7562418",
"0.7562418",
"0.7562418",
"0.7562418",
"0.7521331",
"0.7444008",
"0.74006164",
"0.73917025",
"0.7385094",
"0.73603415",
"0.73397785",
"0.73197... | 0.7800341 | 3 |
Retrieve the Cash Flow Currency Set | public java.util.Set<java.lang.String> cashflowCurrencySet()
{
java.util.Set<java.lang.String> setCcy = new java.util.HashSet<java.lang.String>();
setCcy.add (payCurrency());
setCcy.add (couponCurrency());
return setCcy;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private static Set<String> getCurrencySet() {\n Set<String> currencySet = new HashSet<>();\n for (int i= 0; i<getDataBase().length;i++){\n currencySet.add(getDataBase()[i][0]);\n }\n return Collections.synchronizedSet(currencySet);\n }",
"String getSettlementCur... | [
"0.67794895",
"0.6603694",
"0.6522162",
"0.64178836",
"0.638596",
"0.62932265",
"0.6282132",
"0.62177587",
"0.6214017",
"0.6065217",
"0.60483265",
"0.6012709",
"0.5999494",
"0.59984475",
"0.5984072",
"0.59840405",
"0.5968861",
"0.5952953",
"0.5932899",
"0.5930334",
"0.5928617... | 0.766823 | 0 |
Retrieve the Stream Name | public java.lang.String name()
{
org.drip.state.identifier.FloaterLabel floaterLabel = floaterLabel();
java.lang.String strTrailer = "::{" + effective() + "->" + maturity() + "}";
if (null != floaterLabel)
return "FLOATSTREAM::" + payCurrency() + "::" + floaterLabel.fullyQualifiedName() + strTrailer;
ret... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"String getStreamName();",
"public String getStreamNameString() {\n return streamName;\n }",
"public String getName() {\n\treturn (super.getName() + \".\" + stream.getName());\n }",
"public String getVideoStreamName() {\n return videoStreamName;\n }",
"public String getName() {\n\t\treturn ... | [
"0.91045964",
"0.8553889",
"0.7879215",
"0.68989617",
"0.64311546",
"0.6316381",
"0.6279697",
"0.6267219",
"0.62059844",
"0.6142073",
"0.6108339",
"0.6065308",
"0.6030241",
"0.59996676",
"0.59743726",
"0.59728014",
"0.5971334",
"0.5933252",
"0.5874681",
"0.58746314",
"0.58503... | 0.0 | -1 |
Get the Coupon Metrics for the period corresponding to the specified accrual end date | public org.drip.analytics.output.CompositePeriodCouponMetrics coupon (
final int iAccrualEndDate,
final org.drip.param.valuation.ValuationParams valParams,
final org.drip.param.market.CurveSurfaceQuoteContainer csqs)
{
if (null == valParams) return null;
org.drip.analytics.cashflow.CompositePeriod cp = cont... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public CostItem[] getCostReport(String start, String end) throws CostManagerException;",
"List<SalesConciliation> getSalesConciliation(Company company, Date startDate, Date endDate) throws Exception;",
"public JFreeChart getPieChart(String start, String end) throws CostManagerException;",
"List<Coupon> findB... | [
"0.5494645",
"0.54592526",
"0.5407877",
"0.5356687",
"0.5211007",
"0.51335466",
"0.5057822",
"0.5057822",
"0.5036173",
"0.5008802",
"0.49506634",
"0.49209055",
"0.48347366",
"0.48345935",
"0.4820547",
"0.48131064",
"0.48080334",
"0.48079365",
"0.4788379",
"0.4788379",
"0.4771... | 0.6121659 | 0 |
Generate the Calibration Quote Set corresponding to the specified Latent State Array | public org.drip.product.calib.ProductQuoteSet calibQuoteSet (
final org.drip.state.representation.LatentStateSpecification[] aLSS)
{
try {
return null == floaterLabel() ? new org.drip.product.calib.FixedStreamQuoteSet (aLSS) : new
org.drip.product.calib.FloatingStreamQuoteSet (aLSS);
} catch (java.lang.Ex... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public long[] getState() {\n return new long[] {(long)Cg0, (long)Cg1, (long)Cg2,\n (long)Cg3, (long)Cg4, (long)Cg5};\n }",
"public Sarsa(int states, int actions, ExplorationPolicy explorationPolicy, boolean randomize) {\n this.states = states;\n this.actions = action... | [
"0.5106366",
"0.49770626",
"0.49656534",
"0.47379303",
"0.47201025",
"0.46621522",
"0.4617894",
"0.4594368",
"0.45778507",
"0.4559568",
"0.45261452",
"0.45109373",
"0.44938856",
"0.44840732",
"0.44460425",
"0.44299808",
"0.44200402",
"0.44178247",
"0.4411152",
"0.439015",
"0.... | 0.5243337 | 0 |
Retrieve the Stream Coupon Basis | public double basis()
{
return _lsPeriod.get (0).basis();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public String getIncomeStreamFinancialCoaCode() {\n return incomeStreamFinancialCoaCode;\n }",
"int getCouponStat();",
"int getCouponType();",
"public java.lang.String couponCurrency()\n\t{\n\t\treturn _lsPeriod.get (_lsPeriod.size() - 1).couponCurrency();\n\t}",
"@java.lang.Override\n public ... | [
"0.6218416",
"0.5815287",
"0.5766331",
"0.563502",
"0.55866957",
"0.55527806",
"0.5542095",
"0.5542095",
"0.5522188",
"0.54943556",
"0.5486817",
"0.5486817",
"0.54700553",
"0.54561204",
"0.5452309",
"0.54394954",
"0.5420144",
"0.538395",
"0.5367708",
"0.5367398",
"0.5337157",... | 0.0 | -1 |
Generate a Value Map for the Stream | public org.drip.analytics.support.CaseInsensitiveTreeMap<java.lang.Double> value (
final org.drip.param.valuation.ValuationParams valParams,
final org.drip.param.pricer.CreditPricerParams pricerParams,
final org.drip.param.market.CurveSurfaceQuoteContainer csqs,
final org.drip.param.valuation.ValuationCustomiza... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Test\r\n void convertStreamBean2MapMethod() {\r\n\t\tStream<TransactionBean> transactionBeanStream = transactions.stream();\r\n\t\t// Convert stream -> Map<Object, Object> -> Map<String, TransactionBean>\r\n\t\tMap<String, TransactionBean> afterStreamMap = (Map<String, TransactionBean>)transactionBeanStream.pe... | [
"0.61544764",
"0.6038352",
"0.5851085",
"0.5802548",
"0.5729786",
"0.5726409",
"0.5696489",
"0.56448215",
"0.56229496",
"0.56027436",
"0.5601077",
"0.5597323",
"0.55518824",
"0.54577947",
"0.5447762",
"0.5424156",
"0.5409739",
"0.54004914",
"0.53968656",
"0.53870463",
"0.5383... | 0.0 | -1 |
Retrieve the set of the implemented measures | public java.util.Set<java.lang.String> availableMeasures()
{
java.util.Set<java.lang.String> setstrMeasures = new java.util.TreeSet<java.lang.String>();
setstrMeasures.add ("AccrualCoupon");
setstrMeasures.add ("Accrued");
setstrMeasures.add ("Accrued01");
setstrMeasures.add ("CleanDV01");
setstrMeasu... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public abstract Set<Measure> supportedMeasures();",
"@Override\n public List<String> getMeasures() {\n return measures;\n }",
"@Override\n public Set<Measure> supportedMeasures() {\n return ImmutableSet.of();\n }",
"@Override\n public Enumeration<String> enumerateMeasures() {\n\n Vector... | [
"0.8256186",
"0.8220706",
"0.77369344",
"0.7520789",
"0.65568066",
"0.6492008",
"0.64353216",
"0.63785416",
"0.63099533",
"0.6252851",
"0.6224013",
"0.61058694",
"0.60474056",
"0.60455203",
"0.59263134",
"0.5905402",
"0.5901735",
"0.5867111",
"0.58165926",
"0.57988834",
"0.57... | 0.7814511 | 2 |
Compute the PV for the specified Market Parameters | public double pv (
final org.drip.param.valuation.ValuationParams valParams,
final org.drip.param.pricer.CreditPricerParams pricerParams,
final org.drip.param.market.CurveSurfaceQuoteContainer csqc,
final org.drip.param.valuation.ValuationCustomizationParams vcp)
throws java.lang.Exception
{
if (null == va... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public double couponPV()\n\t{\n\t\treturn _dblCouponPV;\n\t}",
"@Test\n public void test_parameterSensitivity() {\n SimplePriceIndexValues test = SimplePriceIndexValues.of(US_CPI_U, VAL_DATE, CURVE_NOFIX, USCPI_TS);\n InflationRateSensitivity point =\n InflationRateSensitivity.of(PriceIndexObservat... | [
"0.57223845",
"0.568636",
"0.5402192",
"0.5402192",
"0.53874844",
"0.5357304",
"0.5326472",
"0.5324077",
"0.5302959",
"0.5244701",
"0.52299964",
"0.5186419",
"0.5170881",
"0.5161554",
"0.5157274",
"0.5147524",
"0.5141194",
"0.5128022",
"0.5090648",
"0.5084561",
"0.50800025",
... | 0.4783883 | 47 |
Generate the State Loading Constraints for the Forward Latent State | public org.drip.state.estimator.PredictorResponseWeightConstraint forwardPRWC (
final org.drip.param.valuation.ValuationParams valParams,
final org.drip.param.pricer.CreditPricerParams pricerParams,
final org.drip.param.market.CurveSurfaceQuoteContainer csqs,
final org.drip.param.valuation.ValuationCustomizatio... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void testLPState()\n \t{\n \t\tsolver.buildLPState();\n \t\tassertTrue(solver.hasLPState());\n \t\t\n \t\tfinal int nLPVars = solver.getNumberOfLPVariables();\n \t\tassertTrue(nLPVars >= 0);\n \t\t\n \t\tfinal double[] objective = solver.getObjectiveFunction();\n \t\tassertEquals(nLPVars, objective.length);... | [
"0.56771815",
"0.5336378",
"0.5329037",
"0.52981037",
"0.5233846",
"0.5115891",
"0.5102483",
"0.5049701",
"0.5023344",
"0.4993071",
"0.49926987",
"0.49572027",
"0.4952929",
"0.49195555",
"0.49186864",
"0.49076033",
"0.48895702",
"0.48561865",
"0.4846372",
"0.4840333",
"0.4838... | 0.0 | -1 |
Generate the State Loading Constraints for the Funding Latent State | public org.drip.state.estimator.PredictorResponseWeightConstraint fundingPRWC (
final org.drip.param.valuation.ValuationParams valParams,
final org.drip.param.pricer.CreditPricerParams pricerParams,
final org.drip.param.market.CurveSurfaceQuoteContainer csqs,
final org.drip.param.valuation.ValuationCustomizatio... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void testLPState()\n \t{\n \t\tsolver.buildLPState();\n \t\tassertTrue(solver.hasLPState());\n \t\t\n \t\tfinal int nLPVars = solver.getNumberOfLPVariables();\n \t\tassertTrue(nLPVars >= 0);\n \t\t\n \t\tfinal double[] objective = solver.getObjectiveFunction();\n \t\tassertEquals(nLPVars, objective.length);... | [
"0.5656169",
"0.55079234",
"0.5472892",
"0.54528224",
"0.5403826",
"0.5343341",
"0.52920365",
"0.52351385",
"0.52276003",
"0.51735127",
"0.5171785",
"0.51133263",
"0.5094659",
"0.5023714",
"0.50145715",
"0.50100875",
"0.50091165",
"0.49993885",
"0.498671",
"0.4979749",
"0.497... | 0.0 | -1 |
Generate the State Loading Constraints for the Merged Forward/Funding Latent State | public org.drip.state.estimator.PredictorResponseWeightConstraint fundingForwardPRWC (
final org.drip.param.valuation.ValuationParams valParams,
final org.drip.param.pricer.CreditPricerParams pricerParams,
final org.drip.param.market.CurveSurfaceQuoteContainer csqs,
final org.drip.param.valuation.ValuationCusto... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void solveGame4() {\n\t\tlosingStates = new HashSet<S>();\n\t\t\n\t\tQueue<S> losing = new LinkedList<S>();\n\t\tList<Set<S>> uncontrollableSuccessors = new ArrayList<Set<S>>();\n\t\tboolean[] isUncontrollable = new boolean[game.getStates().size()+1];\n\t\tHashMap<S, Integer> stateToIndex = new HashMap<S, I... | [
"0.5495977",
"0.53509593",
"0.53213596",
"0.5274447",
"0.5121231",
"0.5084851",
"0.50842166",
"0.5065969",
"0.5036651",
"0.49918306",
"0.49856636",
"0.49622568",
"0.49457937",
"0.49094322",
"0.48996636",
"0.48849663",
"0.48826113",
"0.4863468",
"0.48526835",
"0.48257053",
"0.... | 0.0 | -1 |
Generate the Calibratable Linearized Predictor/Response Constraint Weights for the Nonmerged FX Curve FX Forward Latent State from the Component's Cash Flows. The Constraints here typically correspond to Date/Cash Flow pairs and the corresponding leading PV. | public org.drip.state.estimator.PredictorResponseWeightConstraint fxPRWC (
final org.drip.param.valuation.ValuationParams valParams,
final org.drip.param.pricer.CreditPricerParams pricerParams,
final org.drip.param.market.CurveSurfaceQuoteContainer csqs,
final org.drip.param.valuation.ValuationCustomizationPara... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public void calculate(double[] x) {\n\n double prob = 0.0; // the log prob of the sequence given the model, which is the negation of value at this point\n Triple<double[][], double[][], double[][]> allParams = separateWeights(x);\n double[][] linearWeights = allParams.first();\n double[][]... | [
"0.49675936",
"0.48108283",
"0.48009998",
"0.47816962",
"0.47122014",
"0.4711302",
"0.46626073",
"0.46270412",
"0.46154404",
"0.45259142",
"0.45154217",
"0.4514669",
"0.4501271",
"0.4466499",
"0.4449678",
"0.4441388",
"0.4426709",
"0.44215813",
"0.4407837",
"0.4400905",
"0.43... | 0.47509235 | 4 |
Generate the Calibratable Linearized Predictor/Response Constraint Weights for the Nonmerged Govvie Curve Yield Latent State from the Component's Cash Flows. The Constraints here typically correspond to Date/Cash Flow pairs and the corresponding leading PV. | public org.drip.state.estimator.PredictorResponseWeightConstraint govviePRWC (
final org.drip.param.valuation.ValuationParams valParams,
final org.drip.param.pricer.CreditPricerParams pricerParams,
final org.drip.param.market.CurveSurfaceQuoteContainer csqs,
final org.drip.param.valuation.ValuationCustomization... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void generateCost() throws StandardException {\n\n double baseTableSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.BASE);\n double filterBaseTableSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.BASE,QualifierPhase.FILTER_BASE);\n double proj... | [
"0.49196377",
"0.4844701",
"0.47751012",
"0.47480255",
"0.473246",
"0.47095716",
"0.4670785",
"0.46374092",
"0.45839107",
"0.45750362",
"0.45744944",
"0.45688927",
"0.45573348",
"0.45386213",
"0.4537088",
"0.45075026",
"0.4479291",
"0.44749618",
"0.44473693",
"0.44356215",
"0... | 0.44341025 | 21 |
Generate the Calibratable Linearized Predictor/Response Constraint Weights for the Nonmerged Volatility Curve Volatility Latent State from the Component's Cash Flows. The Constraints here typically correspond tovDate/Cash Flow pairs and the corresponding leading PV. | public org.drip.state.estimator.PredictorResponseWeightConstraint volatilityPRWC (
final org.drip.param.valuation.ValuationParams valParams,
final org.drip.param.pricer.CreditPricerParams pricerParams,
final org.drip.param.market.CurveSurfaceQuoteContainer csqs,
final org.drip.param.valuation.ValuationCustomiza... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void InitializeConstraints(boundkey[] bkc, double[] blc, NodesVector nvector, PipesVector pvector,\n\t\t\tTapsVector tvector, double outflow, double PrixMax, double lcom) {\n\t\tNodes nodes;\n\t\tPipes pipes;\n\t\tTaps taps;\n\n\t\t/* Contraintes sur les Nodes - taps */\n\t\tfor (int i = 0; i < (NbNodes - N... | [
"0.49333188",
"0.47457168",
"0.47104055",
"0.4622128",
"0.45666656",
"0.45471382",
"0.45235628",
"0.44968522",
"0.4460658",
"0.44345257",
"0.44276357",
"0.4417899",
"0.43890798",
"0.43724954",
"0.43718514",
"0.43661314",
"0.43578488",
"0.4304602",
"0.42962167",
"0.4291844",
"... | 0.48803034 | 1 |
Generate the Jacobian of the Dirty PV to the Manifest Measure | public org.drip.quant.calculus.WengertJacobian jackDDirtyPVDManifestMeasure (
final org.drip.param.valuation.ValuationParams valParams,
final org.drip.param.pricer.CreditPricerParams pricerParams,
final org.drip.param.market.CurveSurfaceQuoteContainer csqs,
final org.drip.param.valuation.ValuationCustomizationP... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public interface Jacobian {\n\n /**\n * Fetch an element in the jacobian matrix. Bounds checking is up to the implementer.\n * @param row Row id in matrix. Number from 0 to getRowSize()-1\n * @param col Column id in matrix. Number from 0 to getColumnSize()-1\n */\n double get(int row,int col)... | [
"0.53433704",
"0.52052104",
"0.51187766",
"0.49703133",
"0.49398366",
"0.48711008",
"0.48141837",
"0.47640523",
"0.46892503",
"0.4656957",
"0.46299797",
"0.4620345",
"0.4584311",
"0.45753193",
"0.45687208",
"0.45463687",
"0.45293447",
"0.45282608",
"0.45176125",
"0.4516728",
... | 0.4954907 | 4 |
Generate the microJacobian of the Manifest Measure to the Discount Factor | public org.drip.quant.calculus.WengertJacobian manifestMeasureDFMicroJack (
final java.lang.String strManifestMeasure,
final org.drip.param.valuation.ValuationParams valParams,
final org.drip.param.pricer.CreditPricerParams pricerParams,
final org.drip.param.market.CurveSurfaceQuoteContainer csqs,
final org.d... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private long getSuffixCValue(int sufIndex){\n long result = 0;\n for(int index = sufIndex; index<number;index++){\n result = result^array[index];\n }\n return result;\n }",
"public static void matrixDis()\n\t{\n\t\t\n\t\tclade = clad[k];\n\t\t//System.err.println(\"\\n\\... | [
"0.5360259",
"0.5023242",
"0.500104",
"0.49573663",
"0.4949933",
"0.49432126",
"0.48971167",
"0.48811853",
"0.4871537",
"0.48403797",
"0.47445926",
"0.4738086",
"0.47335047",
"0.47316965",
"0.4728945",
"0.47152084",
"0.4708405",
"0.470762",
"0.4705067",
"0.47036296",
"0.46952... | 0.5110159 | 1 |
Takes a String s in camel class and splits it by injecting a space Taken from polygenelubricants answer on | public static String splitCamelCase(String s) {
return s.replaceAll(
String.format("%s|%s|%s",
"(?<=[A-Z])(?=[A-Z][a-z])",
"(?<=[^A-Z])(?=[A-Z])",
"(?<=[A-Za-z])(?=[^A-Za-z])"
),
" "
)... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static String splitCamelCase(String s) {\n return s.replaceAll(\n String.format(\"%s|%s|%s\",\n \"(?<=[A-Z])(?=[A-Z][a-z])\",\n \"(?<=[^A-Z])(?=[A-Z])\",\n \"(?<=[A-Za-z])(?=[^A-Za-z])\"),\n \" \").replaceAll(\"[-_]\", \"\").r... | [
"0.7494371",
"0.7052162",
"0.6790428",
"0.6580964",
"0.63633204",
"0.63013303",
"0.6199556",
"0.6185821",
"0.6183761",
"0.6171002",
"0.6166158",
"0.61357725",
"0.6087131",
"0.60428196",
"0.60142267",
"0.6008457",
"0.59993404",
"0.59847015",
"0.59598386",
"0.5925488",
"0.58839... | 0.7373392 | 1 |
Takes a String s in camel class and splits it by injecting the supplied replacement Taken from polygenelubricants answer on | public static String splitCamelCase(String s, String replacement) {
return s.replaceAll(
String.format("%s|%s|%s",
"(?<=[A-Z])(?=[A-Z][a-z])",
"(?<=[^A-Z])(?=[A-Z])",
"(?<=[A-Za-z])(?=[^A-Za-z])"
), replaceme... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static String splitCamelCase(String s) {\n return s.replaceAll(\n String.format(\"%s|%s|%s\",\n \"(?<=[A-Z])(?=[A-Z][a-z])\",\n \"(?<=[^A-Z])(?=[A-Z])\",\n \"(?<=[A-Za-z])(?=[^A-Za-z])\"),\n \" \").replaceAll(\"[-_]\", \"\").r... | [
"0.6464311",
"0.6332634",
"0.61056125",
"0.5949995",
"0.5846709",
"0.5819106",
"0.5665756",
"0.560157",
"0.5539888",
"0.5405675",
"0.5342492",
"0.5276182",
"0.52368367",
"0.52094054",
"0.51906765",
"0.5180283",
"0.5176807",
"0.5147173",
"0.51232207",
"0.5039645",
"0.50230634"... | 0.7052626 | 0 |
Removes all line break characters from a supplied string | public static String removeLineBreaks(String string)
{
String[] lines = string.split("\r\n|\r|\n");
String oneLiner = "";
for (String line : lines) {
oneLiner += line;
}
return oneLiner;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public String removeLineBreak(String text){\n\t\ttext = text.replace(\"\\n\", \"\").replace(\"\\r\", \"\");\n\t\treturn text;\n\t}",
"private String trimStringNewline(String text) {\n while (text.endsWith(\"\\n\")) {\n text = text.substring(0, text.length() - 1);\n }\n \n r... | [
"0.80699694",
"0.70172185",
"0.6753621",
"0.6749205",
"0.6623076",
"0.65002054",
"0.6405545",
"0.63638586",
"0.6330869",
"0.6219904",
"0.6167412",
"0.61453533",
"0.6057256",
"0.6045583",
"0.6042984",
"0.60174066",
"0.6012843",
"0.5987661",
"0.59285647",
"0.5924761",
"0.590565... | 0.7703012 | 1 |
Counts the number of occurences of a char within a string Taken from Jon Skeets answer from | public static int countOccurrences(String haystack, char needle)
{
int count = 0;
for (int i=0; i < haystack.length(); i++)
{
if (haystack.charAt(i) == needle)
{
count++;
}
}
return count;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static int char_count(String y, char c){\r\n\tint count = 0;\r\n\tfor(int i = 0; i < y.length(); i++){\r\n\t\tif(y.charAt(i) == c){\r\n\t\t\tcount++;\r\n\t\t}\r\n\t}\r\n\treturn count;\r\n}",
"private static int countOccurrences(String input, char c) {\n int count = 0;\n for (int i = 0; i < ... | [
"0.8046001",
"0.8014129",
"0.7821778",
"0.77220386",
"0.76944315",
"0.7681828",
"0.76259327",
"0.7587956",
"0.74850714",
"0.7475265",
"0.7451532",
"0.7360138",
"0.7309561",
"0.7306047",
"0.72852254",
"0.728433",
"0.7179896",
"0.7168203",
"0.71676004",
"0.71439993",
"0.7126994... | 0.69953656 | 25 |
Prints to console the occurences of each regex match within a string of text Taken from Jean Logeart's answer from | public static void printMatches(String text, String regex) {
Pattern pattern = Pattern.compile(regex);
Matcher matcher = pattern.matcher(text);
// Check all occurrences
while (matcher.find()) {
System.out.print("Start index: " + matcher.start());
System.out.print(... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void printMatches(String text, String regex) {\n\t\tvar matches = getMatches(text, regex);\n\t\tconsole.printf(\"%10s -> %2d matches: %s %n\", replaceSymbols(regex), matches.size(), matches);\n\t}",
"public static void showMatches(String text, String regex) {\n\t\t// create regex and matcher\n\t\tP... | [
"0.7732845",
"0.7301418",
"0.6801707",
"0.66742915",
"0.6075175",
"0.6071267",
"0.60184515",
"0.59916633",
"0.5723449",
"0.5597834",
"0.5578458",
"0.5559976",
"0.55451745",
"0.55279005",
"0.5477942",
"0.546708",
"0.5437158",
"0.54360574",
"0.5434503",
"0.5428034",
"0.53912437... | 0.7838839 | 0 |
Returns all the RegexResult objects for regex matches within a string | public static ArrayList<RegexResult> getMatches(String text, String regex) {
Pattern pattern = Pattern.compile(regex);
Matcher matcher = pattern.matcher(text);
// Check all occurrences
ArrayList<RegexResult> results = new ArrayList<>();
while (matcher.find()) {
resu... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private DynamicObject getMatchResult(TruffleObject result, String inputStr) {\n return JSArray.createLazyRegexArray(context, regexResultAccessor.groupCount(result), result, inputStr);\n }",
"public static ArrayList<String> getMatches(String text, String regex) {\n\t\tArrayList<String> matches =... | [
"0.65765435",
"0.6567474",
"0.62210864",
"0.6119133",
"0.6119133",
"0.6009622",
"0.59467083",
"0.5900778",
"0.58987087",
"0.5866742",
"0.58558315",
"0.57648826",
"0.574516",
"0.56033504",
"0.55900407",
"0.5468816",
"0.54561144",
"0.5452806",
"0.54415035",
"0.5412439",
"0.5406... | 0.73669624 | 0 |
Taken from CraigTP's answer on StackOverflow Works for negative and decimal numbers but not international | public static boolean isNumericRegex(String str)
{
return str.matches("-?\\d+(\\.\\d+)?"); //match a number with optional '-' and decimal.
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"abstract String convertEnglishNumber(String number);",
"public static void main( String[] args ) {\n System.out.println(NumUtil.format4DecimalPoint(1));\n System.out.println(NumUtil.format4DecimalPoint(1.1));\n System.out.println(NumUtil.format4DecimalPoint(1.12));\n System.out.println(NumUtil.format... | [
"0.65394247",
"0.63646406",
"0.59206754",
"0.5881485",
"0.5799803",
"0.5755947",
"0.57297724",
"0.5697359",
"0.56487477",
"0.5635813",
"0.56229794",
"0.56125",
"0.55878836",
"0.55092907",
"0.5506636",
"0.54885393",
"0.54787654",
"0.5473533",
"0.5434447",
"0.54258186",
"0.5423... | 0.0 | -1 |
Taken from CraigTP's answer on StackOverflow | public static boolean isNumericInternational(String str)
{
try
{
double d = Double.parseDouble(str);
}
catch(NumberFormatException nfe)
{
return false;
}
return true;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void method_4270() {}",
"protected boolean func_70814_o() { return true; }",
"public void func_70305_f() {}",
"public abstract int mo9754s();",
"@Override\n public void func_104112_b() {\n \n }",
"public abstract String mo13682d();",
"private void kk12() {\n\n\t}",
"void mo57277b(... | [
"0.5463842",
"0.52122253",
"0.51914793",
"0.51697344",
"0.5144335",
"0.50483245",
"0.50391316",
"0.5034999",
"0.5028256",
"0.50192255",
"0.50068474",
"0.49757388",
"0.49706703",
"0.49445093",
"0.49212712",
"0.48753402",
"0.48738697",
"0.48714086",
"0.48661065",
"0.48617268",
... | 0.0 | -1 |
Taken from CraigTP's answer on StackOverflow Does not work for numbers that are negative or decimals | public static boolean isNumeric(String str)
{
return str.chars().allMatch( Character::isDigit );
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void main( String[] args ) {\n System.out.println(NumUtil.format4DecimalPoint(1));\n System.out.println(NumUtil.format4DecimalPoint(1.1));\n System.out.println(NumUtil.format4DecimalPoint(1.12));\n System.out.println(NumUtil.format4DecimalPoint(1.123));\n System.out.println(NumUtil.for... | [
"0.64957696",
"0.6137498",
"0.6043085",
"0.6011973",
"0.59220195",
"0.5879067",
"0.5875702",
"0.58572125",
"0.5852673",
"0.58503664",
"0.58236146",
"0.58050126",
"0.57940704",
"0.57748014",
"0.5769493",
"0.5744782",
"0.57385045",
"0.5689715",
"0.56781",
"0.5668533",
"0.566853... | 0.0 | -1 |
TODO: save step state in the descripor | public void onButtonTouched(int index, View anchor ){
WorkflowStepDescriptor descr = descriptors.get(index);
descr.status_completed = true;
FutureVisitActivity.this.showMessageDialog(index, anchor);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public String getStepDescription()\r\n\t{\r\n\t\treturn stepDescription;\r\n\t}",
"public java.lang.String getStepDescription() {\n return stepDescription;\n }",
"public void setStepDescription(String stepDescription)\r\n\t{\r\n\t\tthis.stepDescription = stepDescription;\r\n\t}",
"@Override\n pu... | [
"0.72575194",
"0.6906461",
"0.6684224",
"0.66805255",
"0.6600281",
"0.6600281",
"0.65801305",
"0.65801305",
"0.65656835",
"0.6559091",
"0.6549611",
"0.65338",
"0.6489475",
"0.6395018",
"0.63893384",
"0.63540596",
"0.63540596",
"0.6338217",
"0.6325045",
"0.62881386",
"0.62845"... | 0.0 | -1 |
15, only letters and numbers, not simbols | public RegistrationRutPage(WebDriver driver) {
super(driver);
PageFactory.initElements(driver, this);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private static Boolean testUsername(String username){\n\t\t//Setting Up Regex -> All Numbers and Letters maximum 14 signs\n\t\tString pattern =\"[A-z1-9]{2,14}\";\n\t\tPattern p = Pattern.compile(pattern);\n\t\tMatcher m = p.matcher(username);\n\t\t\t\n\t\tif(m.matches() && !username.isEmpty()){\n\t\t\treturn true... | [
"0.59685236",
"0.59402144",
"0.5880569",
"0.5849386",
"0.56389856",
"0.5616063",
"0.5588638",
"0.55811775",
"0.55776256",
"0.5560203",
"0.5560039",
"0.55508304",
"0.5547023",
"0.55462235",
"0.55400115",
"0.55097795",
"0.5505419",
"0.550337",
"0.5491488",
"0.5450988",
"0.54341... | 0.0 | -1 |
clicking on the buttons | public RegistrationRutPage clickOnAddUserButton() {
Log.info("Clicking on Add user button");
clickElement(addUserButton);
return this;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void click() {\n\t\tSystem.out.println(\"LinuxButton Click\");\r\n\t}",
"public void buttonClicked();",
"protected void onClick() {\n for(Runnable action : onClick) action.run();\n }",
"private void button1MouseClicked(MouseEvent e) {\n\t}",
"public void click(){\n\t\t\n\tfor(MouseListener... | [
"0.71963924",
"0.7182013",
"0.717067",
"0.71462506",
"0.71356565",
"0.7122098",
"0.6996352",
"0.6990564",
"0.6989841",
"0.6968635",
"0.69476354",
"0.69194686",
"0.68894464",
"0.68520224",
"0.68369675",
"0.6835636",
"0.67991537",
"0.6792789",
"0.67749774",
"0.6770518",
"0.6751... | 0.0 | -1 |
Sets upp a clip for treePane | private void initializeTreePane() {
Rectangle clipRect = new Rectangle(treePane.getWidth(), treePane.getHeight());
clipRect.heightProperty().bind(treePane.heightProperty());
clipRect.widthProperty().bind(treePane.widthProperty());
treePane.setClip(clipRect);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public PaneOrganizer() {\n\t\t\n\t\t_root = new BorderPane();\n\t\t_game = new Game(_root);\n\t\tthis.setupButton();\n\t\t\n\t}",
"public void setClip(Shape clip)\r\n\t{\r\n\t\tg.setClip(clip);\r\n\t}",
"private void initPane() {\n\t\tContainer localContainer = getContentPane();\n\t\tlocalContainer.setLayout(n... | [
"0.6346305",
"0.5843613",
"0.58298177",
"0.5812045",
"0.5780987",
"0.5775481",
"0.5750647",
"0.5733432",
"0.57230175",
"0.57033277",
"0.5699892",
"0.56799316",
"0.56541157",
"0.5620668",
"0.561723",
"0.5610482",
"0.5574504",
"0.55719656",
"0.55620307",
"0.55213666",
"0.547703... | 0.7857707 | 0 |
Sets upp and initializes the spinner input for branchLimit | private void initializeBranchLimitSpinner() {
SpinnerValueFactory<Integer> valueFactory;
valueFactory = new SpinnerValueFactory.IntegerSpinnerValueFactory(0, 20, inputN){
@Override public void decrement(int steps) {
final int min = getMin();
final int currentV... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void initSpinner() {\n }",
"public void setupPrioritySpinner() {\n ArrayAdapter<CharSequence> adapter = ArrayAdapter.createFromResource(getActivity(),\n R.array.prirority_level_list, android.R.layout.simple_spinner_item);\n adapter.setDropDownViewResource(android.R.layout.s... | [
"0.61726886",
"0.6088473",
"0.6071019",
"0.60037965",
"0.59693265",
"0.5960306",
"0.58440197",
"0.58242774",
"0.5822374",
"0.5767914",
"0.5706264",
"0.5686165",
"0.5664048",
"0.5654706",
"0.5650077",
"0.56451845",
"0.56361026",
"0.5616766",
"0.55894756",
"0.5582324",
"0.55769... | 0.8079941 | 0 |
The method used to clear and build a tree | @FXML
private void renderTree() {
unmountTree();
buildTree(inputN, treePane.getWidth() / 2, treePane.getHeight(), Math.toRadians(inputTrunkAngle), inputBranchLength);
mountTree();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void clear() {\n tree.clear();\n }",
"public void clear() {\n\t\troot.left = null;\n\t\troot.right = null;\n\t\troot = null;\n\t\tsize = 0;\n\t}",
"public TreeBuilder() {\n\t\troot = null;\n\t}",
"@Override\r\n public void clear(){\r\n root = null;\r\n }",
"public void clear(){\n ... | [
"0.7647076",
"0.7209922",
"0.7155653",
"0.7146795",
"0.71353114",
"0.7130077",
"0.7118458",
"0.71030825",
"0.71009463",
"0.70842725",
"0.70753175",
"0.70702636",
"0.7063944",
"0.7057031",
"0.70186317",
"0.6994936",
"0.69767404",
"0.6969378",
"0.6969378",
"0.6951991",
"0.69519... | 0.0 | -1 |
Renders the slider that controls the inputBranchWitherRatio field | @FXML
private void renderBranchWitherSlider() {
renderSlider(0, 1, inputBranchWitherRatio, (e) -> {
inputBranchWitherRatio = slider.getValue();
renderTree();
});
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@FXML\n private void renderBranchGrowthRatioSlider() {\n renderSlider(0.5, 1, inputBranchGrowthRatio, (e) -> {\n inputBranchGrowthRatio = slider.getValue();\n renderTree();\n });\n }",
"@FXML\n private void renderBranchAngleSlider() {\n renderSlider(1, 30, inpu... | [
"0.81464815",
"0.7562315",
"0.74384034",
"0.62105924",
"0.59863317",
"0.5842651",
"0.5821956",
"0.57995373",
"0.5765713",
"0.5739573",
"0.5712611",
"0.5696003",
"0.56489456",
"0.56008995",
"0.5599106",
"0.5573541",
"0.5533203",
"0.5529043",
"0.55173427",
"0.5466139",
"0.54492... | 0.8416763 | 0 |
Renders the slider that controls the inputBranchLength field | @FXML
private void renderBranchLengthSlider() {
renderSlider(1, 100, inputBranchLength, (e) -> {
inputBranchLength = slider.getValue();
renderTree();
});
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@FXML\n private void renderBranchGrowthRatioSlider() {\n renderSlider(0.5, 1, inputBranchGrowthRatio, (e) -> {\n inputBranchGrowthRatio = slider.getValue();\n renderTree();\n });\n }",
"@FXML\n private void renderBranchWitherSlider() {\n renderSlider(0, 1, inpu... | [
"0.71128684",
"0.69999975",
"0.6957884",
"0.57808393",
"0.5700991",
"0.5656721",
"0.54315734",
"0.54163754",
"0.53798735",
"0.5341865",
"0.52874964",
"0.5284961",
"0.5252166",
"0.52426",
"0.516793",
"0.51652676",
"0.5124004",
"0.51209766",
"0.50761706",
"0.50745875",
"0.50648... | 0.8361786 | 0 |
Renders the slider that controls the inputBranchGrowthRatio field | @FXML
private void renderBranchGrowthRatioSlider() {
renderSlider(0.5, 1, inputBranchGrowthRatio, (e) -> {
inputBranchGrowthRatio = slider.getValue();
renderTree();
});
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@FXML\n private void renderBranchWitherSlider() {\n renderSlider(0, 1, inputBranchWitherRatio, (e) -> {\n inputBranchWitherRatio = slider.getValue();\n renderTree();\n });\n }",
"@FXML\n private void renderBranchLengthSlider() {\n renderSlider(1, 100, inputBran... | [
"0.7813283",
"0.7500392",
"0.74079984",
"0.57754546",
"0.5659731",
"0.5554458",
"0.5464184",
"0.5448314",
"0.5398842",
"0.5363041",
"0.5321663",
"0.53177434",
"0.53113294",
"0.53094125",
"0.53082395",
"0.52994835",
"0.5235362",
"0.52122146",
"0.52064896",
"0.5158338",
"0.5156... | 0.85692126 | 0 |
Renders the slider that controls the inputBranchAngle field | @FXML
private void renderBranchAngleSlider() {
renderSlider(1, 30, inputBranchAngle, (e) -> {
inputBranchAngle = slider.getValue();
renderTree();
});
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@FXML\n private void renderBranchWitherSlider() {\n renderSlider(0, 1, inputBranchWitherRatio, (e) -> {\n inputBranchWitherRatio = slider.getValue();\n renderTree();\n });\n }",
"@FXML\n private void renderBranchGrowthRatioSlider() {\n renderSlider(0.5, 1, inpu... | [
"0.7263239",
"0.7179494",
"0.71741235",
"0.708682",
"0.60620487",
"0.5465874",
"0.536721",
"0.53148764",
"0.5262232",
"0.5258807",
"0.51618713",
"0.514601",
"0.51015097",
"0.50655574",
"0.50556266",
"0.5054633",
"0.50312597",
"0.50077367",
"0.49805763",
"0.4978545",
"0.496996... | 0.84581774 | 0 |
Renders the slider that controls the inputTrunkAngle field | @FXML
private void renderTrunkAngleSlider() {
renderSlider(-180, 0, inputTrunkAngle, (e) -> {
inputTrunkAngle = slider.getValue();
renderTree();
});
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@FXML\n private void renderBranchAngleSlider() {\n renderSlider(1, 30, inputBranchAngle, (e) -> {\n inputBranchAngle = slider.getValue();\n renderTree();\n });\n }",
"@FXML\n void angleSliderEvent() {\n \tint value = (int) angleSlider.getValue();\n \tangleText.s... | [
"0.7127012",
"0.6531134",
"0.60295886",
"0.5923007",
"0.5698197",
"0.56713545",
"0.5637436",
"0.5626394",
"0.5520627",
"0.5428475",
"0.5427872",
"0.54096836",
"0.5381897",
"0.5330204",
"0.53277165",
"0.52696455",
"0.52613765",
"0.52575505",
"0.52549887",
"0.5225345",
"0.52020... | 0.82781607 | 0 |
A generic method for rendering sliders with an event on mouse release | private void renderSlider(double min, double max, double value, EventHandler eventHandler) {
unmountSlider();
buildSlider(min, max, value);
slider.addEventHandler(MouseEvent.MOUSE_RELEASED, eventHandler);
mountSlider();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n\tpublic void mouseReleaseHandler(MouseEvent e) {\n\n\t}",
"@Override\n public void mouseReleased(MouseEvent e) {\n }",
"@Override\n public void onMouseReleased(MouseEvent event, DrawingView dv) {\n }",
"@Override\n public void mouseRe... | [
"0.6847691",
"0.68272895",
"0.68209857",
"0.67379",
"0.67332166",
"0.6728356",
"0.6726712",
"0.67183656",
"0.670848",
"0.670848",
"0.67070156",
"0.6705201",
"0.6705201",
"0.6705201",
"0.6705201",
"0.6705201",
"0.66999835",
"0.66999835",
"0.66999835",
"0.66999835",
"0.6694474"... | 0.7178929 | 0 |
Unmounts tree from treePane | private void unmountTree() {
if (tree != null) {
treePane.getChildren().clear();
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public abstract void removedFromWidgetTree();",
"private void mountTree() {\n if (tree != null) {\n treePane.getChildren().addAll(tree);\n }\n }",
"public void removeFromRoot(){\n Main.getRootPlayGround().getChildren().remove(imageView);\n }",
"private void unmountSlider... | [
"0.63570833",
"0.6227573",
"0.5964328",
"0.59201646",
"0.58464634",
"0.5807764",
"0.57793176",
"0.5680599",
"0.56556475",
"0.56276566",
"0.56223804",
"0.56189305",
"0.55402344",
"0.5508049",
"0.55004215",
"0.54990774",
"0.5466417",
"0.54606736",
"0.545505",
"0.5368895",
"0.53... | 0.8659417 | 0 |
initializes the tree array and populates it | private void buildTree(int n, double x, double y, double a, double branchLength) {
tree = new ArrayList<>();
populateTree(n, x, y, a, branchLength);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public int[] initializeTree() {\n BST myTree = new BST();\n int[] myArray = {0, 52, 33, 75, 21, 40, 64, 86, 15, 27, 37, 46, 58, 70, 81, 89, 12, 18, 24, 30, 35, 39, 43, 49, 55, 61, 67, 73, 79, 83, 87, 92};\n for (int i = 1; i < myArray.length; i++) {\n myTree.addItem(myArray[i]);\n ... | [
"0.7268921",
"0.7044916",
"0.7042618",
"0.69291246",
"0.68158394",
"0.68158394",
"0.6808646",
"0.6805295",
"0.67891484",
"0.6656674",
"0.65560013",
"0.6548724",
"0.6520185",
"0.6495217",
"0.64779013",
"0.63851863",
"0.63804877",
"0.63701475",
"0.6325351",
"0.63131696",
"0.631... | 0.6354159 | 18 |
Generic method for "curving" the branch wither ratio | private double curveBranchWitherRatio(int n){
return Math.pow(((double)n / (double)inputN), inputBranchWitherRatio);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"double getBranchProbability();",
"private void reduce() {\n int gcd = gcd(this.numerator, this.denominator);\n this.numerator = this.numerator / gcd;\n this.denominator = this.denominator / gcd;\n }",
"double getRatio();",
"private void reduce() {\n /** The fraction is equal to 0. Th... | [
"0.6367253",
"0.5861993",
"0.57022095",
"0.56775475",
"0.5663086",
"0.55269384",
"0.55242926",
"0.5484173",
"0.5466344",
"0.54548484",
"0.54186654",
"0.5416349",
"0.53747463",
"0.53664595",
"0.53494334",
"0.53197956",
"0.5292197",
"0.52755123",
"0.5261603",
"0.5236263",
"0.52... | 0.66868603 | 0 |
Mounts tree onto treePane | private void mountTree() {
if (tree != null) {
treePane.getChildren().addAll(tree);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@FXML\n private void renderTree() {\n unmountTree();\n buildTree(inputN, treePane.getWidth() / 2, treePane.getHeight(), Math.toRadians(inputTrunkAngle), inputBranchLength);\n mountTree();\n }",
"private void initializeTreePane() {\n Rectangle clipRect = new Rectangle(treePane.ge... | [
"0.6816048",
"0.64292",
"0.63967437",
"0.6240624",
"0.62085754",
"0.6010165",
"0.59163964",
"0.587",
"0.57927287",
"0.57863486",
"0.5770739",
"0.5741902",
"0.56922394",
"0.5624246",
"0.55535895",
"0.55467564",
"0.54782206",
"0.5461528",
"0.54571205",
"0.5433121",
"0.54283035"... | 0.8122045 | 0 |
Unmounts slider from sliderPane | private void unmountSlider() {
if (slider != null) {
sliderPane.getChildren().remove(slider);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void dropview() {\n\t\tthis.remove(scrollPane);\n\t}",
"public void removeFromRoot(){\n Main.getRootPlayGround().getChildren().remove(imageView);\n }",
"@Override\r\n\tpublic void onClosed() {\n\t\tmSlidingLayer.removeAllViews();\r\n\t}",
"private void mountSlider() {\n if (slider != ... | [
"0.5891477",
"0.5770983",
"0.5760895",
"0.57597435",
"0.57505834",
"0.57378703",
"0.5545681",
"0.5470041",
"0.54341847",
"0.543041",
"0.54291815",
"0.53988546",
"0.5385946",
"0.534111",
"0.53298193",
"0.5320292",
"0.5313458",
"0.53120625",
"0.52916443",
"0.52743036",
"0.52516... | 0.8895049 | 0 |
Mounts slider onto sliderPane | private void mountSlider() {
if (slider != null) {
sliderPane.getChildren().add(slider);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void unmountSlider() {\n if (slider != null) {\n sliderPane.getChildren().remove(slider);\n }\n }",
"private void initSlider() {\n setOrientation(HORIZONTAL);\n }",
"private void createSlider(){\n\t\tslider = new GVertSlider(winApp, (int)width - 10, (int)height, 10... | [
"0.6620579",
"0.6459802",
"0.63890624",
"0.62705684",
"0.60200006",
"0.58442074",
"0.58395976",
"0.57896096",
"0.57786644",
"0.5752813",
"0.5698313",
"0.5666282",
"0.56498635",
"0.5596167",
"0.55955327",
"0.55833435",
"0.5578919",
"0.5570712",
"0.5563887",
"0.55479413",
"0.55... | 0.82988966 | 0 |
Return the trade price | public BigDecimal getPrice() {
return price;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Price getTradePrice();",
"@Field(26) \n\tpublic double TradePrice() {\n\t\treturn this.io.getDoubleField(this, 26);\n\t}",
"TickerPrice getPrice(String symbol);",
"public double getBuyPrice() {\n return buyPrice;\n }",
"public static int getPrice() {\n return PRICE_TO_BUY;\n }",
"doub... | [
"0.88450676",
"0.790492",
"0.7516808",
"0.74722284",
"0.74597454",
"0.7417922",
"0.7417922",
"0.7417922",
"0.7379568",
"0.73563653",
"0.72945",
"0.7285025",
"0.7282232",
"0.7280733",
"0.72803754",
"0.7278834",
"0.72637856",
"0.7250905",
"0.725046",
"0.72452146",
"0.7216305",
... | 0.7174617 | 30 |
Return the trade amount. | public BigDecimal getAmount() {
return amount;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public BigDecimal getTradeTotal() {\n return tradeTotal;\n }",
"public int getTradeValue() {\n \t\treturn tradeValue;\n \t}",
"public double getDepositAmount()\n\t{\n\t\treturn this.getFlightCosts() + this.totalPrice * this.half;\n\t}",
"public Double getTotalBuyMoney() {\r\n return totalBuy... | [
"0.75257635",
"0.730285",
"0.6966845",
"0.69192314",
"0.6882328",
"0.6881878",
"0.68226755",
"0.68053883",
"0.67649233",
"0.67506933",
"0.67226547",
"0.66950446",
"0.66666675",
"0.6629405",
"0.6624925",
"0.6607314",
"0.6606099",
"0.65890276",
"0.65796447",
"0.6570975",
"0.656... | 0.6214783 | 95 |
Return the trade id. | public BigDecimal getId() {
return id;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Long getTradeId() {\n return tradeId;\n }",
"public String getTradeId() {\n\t\treturn this.tradeId;\n\t}",
"public String getTradeNo() {\n\t\treturn tradeNo;\n\t}",
"public long id() {\n\t\treturn message.getBaseMarketId();\n\t}",
"public java.lang.Long getInternalTradeId() {\n retu... | [
"0.81206524",
"0.8034848",
"0.7211089",
"0.71210355",
"0.6815663",
"0.6814581",
"0.67674494",
"0.6662002",
"0.6655534",
"0.6628759",
"0.6586141",
"0.647857",
"0.6458992",
"0.6339173",
"0.629731",
"0.6238321",
"0.6205278",
"0.6197215",
"0.61952317",
"0.61850446",
"0.6172611",
... | 0.0 | -1 |
Returns true if the attribute "for" is set. | public final boolean isForSetted() {
return engine.isPropertySetted(Properties.FOR);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"boolean hasSetAttribute();",
"public final boolean hasAttribute ()\r\n {\r\n return _value.hasAttribute();\r\n }",
"boolean isAttribute();",
"boolean hasAttributes();",
"boolean hasAttributes();",
"public boolean isSetAttrs() {\n return this.attrs != null;\n }",
"public boolean isSetLoop... | [
"0.68169665",
"0.65799344",
"0.6396289",
"0.63216114",
"0.63216114",
"0.62969863",
"0.6222567",
"0.61916256",
"0.6170728",
"0.61575115",
"0.61423266",
"0.61165786",
"0.6071341",
"0.6014158",
"0.60066015",
"0.59748966",
"0.58895135",
"0.5884925",
"0.584304",
"0.5814462",
"0.57... | 0.73865855 | 0 |
Returns true if the attribute "manyResultsMessage" is set. | public final boolean isManyResultsMessageSetted() {
return engine.isPropertySetted(Properties.MANY_RESULTS_MESSAGE);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public final boolean isOneResultMessageSetted() {\n\t\treturn engine.isPropertySetted(Properties.ONE_RESULT_MESSAGE);\n\t}",
"public boolean isSetResults() {\n return this.results != null;\n }",
"public boolean getMoreResults() {\n return moreResults_;\n }",
"public boolean getMoreResults() {\n ... | [
"0.665829",
"0.6501732",
"0.6469233",
"0.6448871",
"0.62809116",
"0.61320066",
"0.5858878",
"0.581694",
"0.5786029",
"0.5780845",
"0.57478344",
"0.5663061",
"0.56095475",
"0.55644226",
"0.55608916",
"0.55577284",
"0.5527805",
"0.54951066",
"0.5491291",
"0.54911244",
"0.548175... | 0.86627984 | 0 |
Returns true if the attribute "message" is set. | public final boolean isMessageSetted() {
return engine.isPropertySetted(Properties.MESSAGE);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public boolean isSetMessage() {\n return this.Message != null;\n }",
"public boolean is_set_msg() {\n return this.msg != null;\n }",
"public boolean isSetMsg() {\n return this.msg != null;\n }",
"public boolean isValid() {\n return message == null;\n }",
"boolean hasMessage();",
"bo... | [
"0.79260176",
"0.74718606",
"0.7249422",
"0.7137898",
"0.71103394",
"0.71103394",
"0.71103394",
"0.71103394",
"0.71103394",
"0.71103394",
"0.71103394",
"0.71103394",
"0.7035329",
"0.7035329",
"0.7035329",
"0.7035329",
"0.7035175",
"0.7035175",
"0.701567",
"0.701567",
"0.70142... | 0.77528805 | 1 |
Returns true if the attribute "oneResultMessage" is set. | public final boolean isOneResultMessageSetted() {
return engine.isPropertySetted(Properties.ONE_RESULT_MESSAGE);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public final boolean isZeroResultMessageSetted() {\n\t\treturn engine.isPropertySetted(Properties.ZERO_RESULT_MESSAGE);\n\t}",
"public boolean isSetResult() {\n return this.result != null;\n }",
"public boolean isSetMessage() {\n return this.Message != null;\n }",
"public static void ensureResultMess... | [
"0.72161865",
"0.68635327",
"0.6455939",
"0.64409065",
"0.64051956",
"0.64051956",
"0.64051956",
"0.6405153",
"0.6405153",
"0.64035285",
"0.639855",
"0.6385228",
"0.6385228",
"0.6385228",
"0.6384776",
"0.6384776",
"0.6384776",
"0.6378558",
"0.6362597",
"0.635765",
"0.6347301"... | 0.828893 | 0 |
Returns true if the attribute "zeroResultMessage" is set. | public final boolean isZeroResultMessageSetted() {
return engine.isPropertySetted(Properties.ZERO_RESULT_MESSAGE);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public final boolean isOneResultMessageSetted() {\n\t\treturn engine.isPropertySetted(Properties.ONE_RESULT_MESSAGE);\n\t}",
"public boolean hasResult() {\n return ((bitField0_ & 0x00000002) == 0x00000002);\n }",
"public boolean hasResult() {\n return ((bitField0_ & 0x00000001) == 0x00000001);\n ... | [
"0.65579",
"0.6526155",
"0.6503942",
"0.6503942",
"0.6503942",
"0.6503753",
"0.6503753",
"0.6503753",
"0.65007836",
"0.64899474",
"0.6487348",
"0.6484246",
"0.6484246",
"0.6484081",
"0.6484081",
"0.6484081",
"0.6482163",
"0.641695",
"0.62825334",
"0.6264697",
"0.62177575",
... | 0.8491803 | 0 |
Returns a string specifying the message to display when there is no row to display. | public String getNoPagedMessage() {
return getNoPagedMessage(null);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void displayNoResults()\n {\n tableData.add(new Company(null, \"No results found\"));\n tableView.setItems(tableData); \n }",
"private void displayNoRoomMsg() {\n\t\t \n\t\t //displays error message to user\n\t\t System.out.println(\"Unable to move in that direction.\... | [
"0.65571356",
"0.64867556",
"0.6467869",
"0.6248714",
"0.6151021",
"0.60408384",
"0.60408384",
"0.5983701",
"0.59688735",
"0.5966816",
"0.59420544",
"0.59227043",
"0.59227043",
"0.5900729",
"0.5877202",
"0.5822069",
"0.5809091",
"0.57711357",
"0.57458913",
"0.5744804",
"0.573... | 0.57851326 | 17 |
Returns a string specifying the message to display when there is no row to display. | public String getNoPagedMessage(javax.faces.context.FacesContext facesContext) {
String s = engine.getStringProperty(Properties.NO_PAGED_MESSAGE, facesContext);
return s;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void displayNoResults()\n {\n tableData.add(new Company(null, \"No results found\"));\n tableView.setItems(tableData); \n }",
"private void displayNoRoomMsg() {\n\t\t \n\t\t //displays error message to user\n\t\t System.out.println(\"Unable to move in that direction.\... | [
"0.6559164",
"0.6488702",
"0.6467328",
"0.6249669",
"0.6150954",
"0.6040549",
"0.6040549",
"0.5984542",
"0.5966944",
"0.59653366",
"0.5944742",
"0.5923682",
"0.5923682",
"0.5898448",
"0.5878485",
"0.58192855",
"0.5811681",
"0.578501",
"0.5769989",
"0.5746674",
"0.57449794",
... | 0.56609744 | 26 |
Steps a string specifying the message to display when there is no row to display. | public void setNoPagedMessage(String noPagedMessage) {
engine.setProperty(Properties.NO_PAGED_MESSAGE, noPagedMessage);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void displayValidityReport() {\r\n\t\tif (this.tuple == null)\r\n\t\t\treturn;\r\n\t\tsetMessage(\"\");\r\n\t\tint row = this.tableView.getSelectedRow();\r\n\t\tif (row < this.tuple.getNumberOfEntries() && row >= 0)\r\n\t\t\tdisplayValidityReport(row);\r\n\t}",
"private void displayNoRoomMsg() {\n\t\t \n... | [
"0.64088136",
"0.6297014",
"0.61763275",
"0.6086415",
"0.5667458",
"0.56472045",
"0.5609208",
"0.55679077",
"0.5494457",
"0.54286444",
"0.54209554",
"0.5413702",
"0.5402042",
"0.53806627",
"0.53801733",
"0.5349081",
"0.53278154",
"0.5275024",
"0.526673",
"0.5259567",
"0.52595... | 0.0 | -1 |
Steps a string specifying the message to display when there is no row to display. | public boolean isNoPagedMessageSetted() {
return engine.isPropertySetted(Properties.NO_PAGED_MESSAGE);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void displayValidityReport() {\r\n\t\tif (this.tuple == null)\r\n\t\t\treturn;\r\n\t\tsetMessage(\"\");\r\n\t\tint row = this.tableView.getSelectedRow();\r\n\t\tif (row < this.tuple.getNumberOfEntries() && row >= 0)\r\n\t\t\tdisplayValidityReport(row);\r\n\t}",
"private void displayNoRoomMsg() {\n\t\t \n... | [
"0.64088136",
"0.6297014",
"0.61763275",
"0.6086415",
"0.5667458",
"0.56472045",
"0.5609208",
"0.55679077",
"0.5494457",
"0.54286444",
"0.54209554",
"0.5413702",
"0.5402042",
"0.53806627",
"0.53801733",
"0.5349081",
"0.53278154",
"0.5275024",
"0.526673",
"0.5259567",
"0.52595... | 0.0 | -1 |
Check if the last executed deployment scripts was successful. | @Override
public boolean wasLastScriptSuccessful() {
if (LOG.isDebugEnabled()) {
LOG.debug("Checking if the last deployment script was successful");
}
final StringBuilder queryBuilder = new StringBuilder(79);
// The creation time is unreliable because on fast machines tw... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public boolean wasLastScriptSuccessful() {\n return this.deploymentScriptService.wasLastScriptSuccessful();\n }",
"public boolean runAllPendingScripts() {\n if (LOG.isInfoEnabled()) {\n LOG.info(\"Running all pending update deployment scripts.\");\n }\n return this.runAl... | [
"0.81606466",
"0.65619195",
"0.615247",
"0.600427",
"0.5953454",
"0.5876571",
"0.58717346",
"0.57295275",
"0.5710881",
"0.5692137",
"0.5630059",
"0.5630059",
"0.5630059",
"0.5535444",
"0.55185884",
"0.5516604",
"0.54417753",
"0.54404473",
"0.54182714",
"0.54117155",
"0.539834... | 0.79337823 | 1 |
TODO Autogenerated method stub | public static void main(String[] args) {
VolatileDemo vd = new VolatileDemo();
for (int i=0;i<500;i++) {
new Thread(new Runnable() {
@Override
public void run() {
// TODO Auto-generated method stub
vd.increase();
}
}).start();
}
while(Thread.activeCount() > 1) {
Thre... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override\r\n\t\t\tpublic void annadir() {\n\r\n\t\t\t}",
"@Override\n\tpublic void anular() {\n\n\t}",
"@Override\n\tprotected void getExr... | [
"0.6671074",
"0.6567672",
"0.6523024",
"0.6481211",
"0.6477082",
"0.64591026",
"0.64127725",
"0.63762105",
"0.6276059",
"0.6254286",
"0.623686",
"0.6223679",
"0.6201336",
"0.61950207",
"0.61950207",
"0.61922914",
"0.6186996",
"0.6173591",
"0.61327106",
"0.61285484",
"0.608016... | 0.0 | -1 |
TODO Autogenerated method stub | @Override
public void run() {
vd.increase();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override\r\n\t\t\tpublic void annadir() {\n\r\n\t\t\t}",
"@Override\n\tpublic void anular() {\n\n\t}",
"@Override\n\tprotected void getExr... | [
"0.6671074",
"0.6567672",
"0.6523024",
"0.6481211",
"0.6477082",
"0.64591026",
"0.64127725",
"0.63762105",
"0.6276059",
"0.6254286",
"0.623686",
"0.6223679",
"0.6201336",
"0.61950207",
"0.61950207",
"0.61922914",
"0.6186996",
"0.6173591",
"0.61327106",
"0.61285484",
"0.608016... | 0.0 | -1 |
Inflate the menu; this adds items to the action bar if it is present. | @Override
public boolean onCreateOptionsMenu(Menu menu) {
getMenuInflater().inflate(R.menu.menu_registro_conductor, menu);
return true;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public boolean onCreateOptionsMenu(Menu menu) {\n \tMenuInflater inflater = getMenuInflater();\n \tinflater.inflate(R.menu.main_activity_actions, menu);\n \treturn super.onCreateOptionsMenu(menu);\n }",
"@Override\n public void onCreateOptionsMenu(Menu menu, MenuInflater inflater) {... | [
"0.7246102",
"0.7201358",
"0.7194834",
"0.7176498",
"0.71066517",
"0.7039537",
"0.7037961",
"0.70112145",
"0.70094734",
"0.69807225",
"0.6944953",
"0.69389373",
"0.6933199",
"0.6916928",
"0.6916928",
"0.6891486",
"0.68831646",
"0.68754137",
"0.68745375",
"0.68621665",
"0.6862... | 0.0 | -1 |
Handle action bar item clicks here. The action bar will automatically handle clicks on the Home/Up button, so long as you specify a parent activity in AndroidManifest.xml. | @Override
public boolean onOptionsItemSelected(MenuItem item) {
int id = item.getItemId();
return super.onOptionsItemSelected(item);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public boolean onOptionsItemSelected(MenuItem item) { Handle action bar item clicks here. The action bar will\n // automatically handle clicks on the Home/Up button, so long\n // as you specify a parent activity in AndroidManifest.xml.\n\n //\n // HANDLE BACK BUTTON\n ... | [
"0.7904451",
"0.78051436",
"0.7766031",
"0.77275425",
"0.76321447",
"0.7622237",
"0.7584132",
"0.7530231",
"0.74875915",
"0.7457484",
"0.7457484",
"0.7438372",
"0.74221927",
"0.7403421",
"0.73915446",
"0.738672",
"0.7378976",
"0.73701847",
"0.7362139",
"0.73556066",
"0.734531... | 0.0 | -1 |
Techtorial / T e c h ... 0123456789 Techtorial | public static void main(String[] args) {
/*
* T
* e
* c
* h
* ...
*/
//0123456789
//Techtorial
String word="Techtorial";
for(int index=0, lenght=word.length() ; index<lenght ; index++ ) {
System.out.println(word.charAt(index));
}
//
// for(int index=0, le... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"String mo21078i();",
"private static char[] m619z(String str) {\n char[] toCharArray = str.toCharArray();\n if (toCharArray.length < 2) {\n toCharArray[0] = (char) (toCharArray[0] ^ 20);\n }\n return toCharArray;\n }",
"private static String m12564b(String str, String ... | [
"0.59872085",
"0.59645474",
"0.5875846",
"0.5816474",
"0.5777148",
"0.5774027",
"0.5759332",
"0.5752272",
"0.5745448",
"0.57408154",
"0.5719666",
"0.5716889",
"0.56941265",
"0.5640088",
"0.56205004",
"0.56066906",
"0.5606121",
"0.5600665",
"0.55886716",
"0.557705",
"0.5565472... | 0.5495396 | 30 |
Keep max value low so that the basket total weight is low (problem limit is 100,000) | @Test
public void when_provided_maximum_size_list_with_all_elements_that_can_be_added_then_return_sum_in_allowable_amount_of_time() {
final int[] elements = Fixture.initializeRandomList(MAX_NUM_ELEMENTS, MIN_ELEMENT_SIZE, 5);
final int elementSum = IntStream.of(elements).sum();
final long startTime = System.curr... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"static int knapsack(Item[] items, int maxWeight) {\n return knapsack(items, maxWeight, 0);\n }",
"public void setMaxWeight(double inMaxWeight) {\n maxWeight = inMaxWeight;\n }",
"public void setMaxprice(int value) {\n this.maxprice = value;\n }",
"public void setmaxWeigh... | [
"0.6650229",
"0.6519421",
"0.64571065",
"0.6399682",
"0.6357538",
"0.6351207",
"0.6313644",
"0.629626",
"0.6145918",
"0.6127599",
"0.6116213",
"0.6100449",
"0.6087184",
"0.60794073",
"0.607563",
"0.60680765",
"0.6039796",
"0.60363775",
"0.60312504",
"0.5989931",
"0.5986619",
... | 0.57092255 | 50 |
Create a new ObjectFactory that can be used to create new instances of schema derived classes for package: com.bestbuy.tsh.facilities.locations.service.v2 | public ObjectFactory() {
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private EntityFactory() {}",
"public ObjectFactory() {}",
"public ObjectFactory() {}",
"public ObjectFactory() {}",
"ObjectFactoryGenerator objectFactoryGenerator();",
"@Override\n protected ObjectFactory initObjectFactory() {\n try {\n BeanManager bm = (BeanManager) new InitialConte... | [
"0.5970813",
"0.5906768",
"0.5906768",
"0.5906768",
"0.5899731",
"0.58580935",
"0.58211935",
"0.5797012",
"0.578937",
"0.5783719",
"0.57710516",
"0.5770201",
"0.5765123",
"0.5758739",
"0.57543504",
"0.57472646",
"0.57397753",
"0.5729349",
"0.57234794"
] | 0.0 | -1 |
Check if it's need to compare values as numbers or not. value1 is usually expected one and could contain formula from ComparisonUtils. So need to process it like notnumeric value in default way | @Override
public ComparisonResult compareValues(String expectedValue, String actualValue, String column) throws Exception
{
if (StringUtils.isNotBlank(expectedValue) && StringUtils.isNotBlank(actualValue)
&& !expectedValue.startsWith(MatrixFunctions.FORMULA_START) && numericColumns.containsKey(column))
{
t... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void testGetNumericValue1() {\n ValueString vs = new ValueString(\"1000\");\n\n assertEquals(\"1000\", vs.getString());\n assertEquals(1000.0D, vs.getNumber(), 0.0D);\n assertNull(vs.getDate()); // will fail parsing\n assertEquals(false, vs.getBoolean());\n assertEq... | [
"0.6406389",
"0.6257816",
"0.6235029",
"0.6010553",
"0.59858894",
"0.59606755",
"0.587236",
"0.5812742",
"0.5796492",
"0.5763025",
"0.57388186",
"0.57323223",
"0.5714801",
"0.56903946",
"0.5653628",
"0.56501627",
"0.56500155",
"0.5606238",
"0.55873275",
"0.5570015",
"0.553604... | 0.60942626 | 3 |
Creates new form Formas | public Formas() {
initComponents();
setIconImage(new ImageIcon(this.getClass().getResource("/Imagen/capsule.png")).getImage());
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"FORM createFORM();",
"public static void create(Formulario form){\n daoFormulario.create(form);\n }",
"public static Result newForm() {\n return ok(newForm.render(palletForm, setOfArticleForm));\n }",
"public SalidaCajaForm() {\n\t\tinicializarComponentes();\n }",
"public FormInserir... | [
"0.748264",
"0.7274339",
"0.65657145",
"0.65645075",
"0.6318116",
"0.62970716",
"0.60711354",
"0.60194737",
"0.60178494",
"0.60037094",
"0.5986952",
"0.59763",
"0.5963809",
"0.5938802",
"0.5932473",
"0.59083813",
"0.5908022",
"0.5899548",
"0.58720845",
"0.5865205",
"0.5847255... | 0.0 | -1 |
This method is called from within the constructor to initialize the form. WARNING: Do NOT modify this code. The content of this method is always regenerated by the Form Editor. | @SuppressWarnings("unchecked")
// <editor-fold defaultstate="collapsed" desc="Generated Code">//GEN-BEGIN:initComponents
private void initComponents() {
jPanel1 = new javax.swing.JPanel();
jLabel1 = new javax.swing.JLabel();
jPanel2 = new javax.swing.JPanel();
setDefaultCloseOp... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Form() {\n initComponents();\n }",
"public MainForm() {\n initComponents();\n }",
"public MainForm() {\n initComponents();\n }",
"public MainForm() {\n initComponents();\n }",
"public frmRectangulo() {\n initComponents();\n }",
"public form() {\n ... | [
"0.73197734",
"0.72908777",
"0.72908777",
"0.72908777",
"0.72870827",
"0.7248368",
"0.7213462",
"0.7208004",
"0.7195763",
"0.7189973",
"0.7184436",
"0.7159332",
"0.71478266",
"0.709268",
"0.7080727",
"0.7057287",
"0.6986775",
"0.6977119",
"0.69554067",
"0.69548035",
"0.694574... | 0.0 | -1 |
End of variables declaration//GENEND:variables | public void SetValues(Map<String, Integer> Usuario,int cont){
//Crear un dataset
DefaultPieDataset data = new DefaultPieDataset();
Iterator it = Usuario.keySet().iterator();
int c = 0;
while(it.hasNext()){
if(c<5){
String key = (String)it.next();
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void lavar() {\n\t\t// TODO Auto-generated method stub\n\t\t\n\t}",
"public void mo38117a() {\n }",
"@Override\r\n\tpublic void initVariables() {\n\t\t\r\n\t}",
"private void assignment() {\n\n\t\t\t}",
"private void kk12() {\n\n\t}",
"public void gored() {\n\t\t\n\t}",
"@Override\n pu... | [
"0.6359434",
"0.6280371",
"0.61868024",
"0.6094568",
"0.60925734",
"0.6071678",
"0.6052686",
"0.60522056",
"0.6003249",
"0.59887564",
"0.59705925",
"0.59680873",
"0.5967989",
"0.5965816",
"0.5962006",
"0.5942372",
"0.5909877",
"0.5896588",
"0.5891321",
"0.5882983",
"0.5881482... | 0.0 | -1 |
Create remote console writer instance. | public RemoteConsoleWriter(int port)
{
debug("Create remote console server instance.");
ServerSocket server = null;
Thread thread = null;
try {
server = new ServerSocket();
thread = new Thread(this);
thread.setDaemon(true);
thread.start();
}
catch(IOException e) {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public ConsoleHandler createConsoleHandler () {\r\n\t\t\t\r\n\t\tConsoleHandler consoleHandler = null;\r\n\t\t\t\r\n\t\ttry {\r\n\t\t \t\r\n\t\t\tconsoleHandler = new ConsoleHandler();\r\n\t\t\t\t\r\n\t\t} catch (SecurityException e) {\r\n\t\t\t\t\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t\t \r\n\t\t r... | [
"0.567867",
"0.5450029",
"0.54417866",
"0.52625364",
"0.525718",
"0.52485496",
"0.51781327",
"0.5171072",
"0.5167998",
"0.514637",
"0.51183426",
"0.51164347",
"0.50651383",
"0.5045914",
"0.50295967",
"0.50021845",
"0.4972306",
"0.49389556",
"0.4936409",
"0.49284518",
"0.48786... | 0.70811266 | 0 |
Writes a portion of an array of characters. | @Override
public void write(char[] cbuf, int off, int len) throws IOException
{
builder.append(cbuf, off, len);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"void writeChars(char[] c, int off, int len) throws IOException;",
"public void write(char[] charArray, int offset, int length) throws IOException{\r\n if(closed){\r\n throw new IOException(\"The stream is not open.\");\r\n }\r\n getBuffer().append(charArray, offset, length);\r\n ... | [
"0.8040365",
"0.69351685",
"0.6754314",
"0.66677344",
"0.64745426",
"0.64163166",
"0.6251137",
"0.62477624",
"0.6234871",
"0.6193163",
"0.61458325",
"0.6139917",
"0.61393845",
"0.61271626",
"0.6127038",
"0.61244005",
"0.60924226",
"0.60894907",
"0.60780525",
"0.60670334",
"0.... | 0.6314676 | 6 |
Flushes this stream by writing any buffered output to the underlying stream. | @Override
public void flush() throws IOException
{
for(;;) {
int index = indexOneOf(builder, '\r', '\n');
if(index == -1) {
break;
}
// ignore false returned by offer when queue is full
queue.offer(builder.substring(0, index));
if(builder.charAt(index) == '\r') {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void flush() {\n wasFlushed = true;\n }",
"public void flush() throws IOException\n {\n getStream().flush();\n }",
"public static void flush() {\n if (outputEnabled)\n out.flush();\n }",
"public synchronized void flush() {\n\t\ttry {\n\t\t\tcloseWriter();\n\t\t} catch(I... | [
"0.75294834",
"0.73114276",
"0.7289606",
"0.7164379",
"0.71445906",
"0.70890856",
"0.69873977",
"0.68884796",
"0.6833588",
"0.682276",
"0.68087804",
"0.68087804",
"0.68087804",
"0.67931044",
"0.6788341",
"0.6788341",
"0.6788341",
"0.6788341",
"0.6774422",
"0.6735276",
"0.6729... | 0.0 | -1 |
Closes the stream, flushing it first. | @Override
public void close() throws IOException
{
debug("Dispose remote console server.");
// this method tries its best and as a least resort uses thread interruption
synchronized(this) {
try {
// try to break server.accept in order to force queue reading on thread
Socket socket ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void closeStream() {\n output.close();\n input.close();\n }",
"protected void closeStream ()\n {\n stream.close ();\n }",
"public void closeStream() {\n\t\ttry {\n\t\t\tisReaderStatusClosed = true;\n\t\t\tif(buffReader != null) {\n\t\t\t\tbuffReader.close();\n\t\t\t}\n\t\t} catch(... | [
"0.742372",
"0.73023313",
"0.7160331",
"0.70681417",
"0.69970876",
"0.67976123",
"0.66543734",
"0.6564473",
"0.64817876",
"0.64380145",
"0.64156985",
"0.6405659",
"0.6285523",
"0.627561",
"0.62693334",
"0.625075",
"0.6232578",
"0.6231858",
"0.62049574",
"0.61861706",
"0.61651... | 0.0 | -1 |
internal logging helpers uses log4j internal logger LogLog in order to avoid circular dependencies Internal debug message. | private static void debug(String message, Object... args)
{
StatusLogger.getLogger().debug(String.format(message, args));
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"protected Log getLog()\n/* */ {\n/* 59 */ return log;\n/* */ }",
"protected static Logger log() {\n return LogSingleton.INSTANCE.value;\n }",
"abstract protected void logInternal(int level, String message);",
"private void debugLog(String msg)\n {\n m_log.log(\"[\" + m_appNa... | [
"0.6820123",
"0.6780879",
"0.671974",
"0.6700964",
"0.6637071",
"0.6519738",
"0.64312446",
"0.6427003",
"0.6338282",
"0.63056445",
"0.63048685",
"0.6277209",
"0.6267726",
"0.6261081",
"0.62280333",
"0.62098986",
"0.62031895",
"0.62021124",
"0.6188186",
"0.6185712",
"0.6180807... | 0.0 | -1 |
also needs to path auth | @GetMapping("/info")
public String info(){
return "info";
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"boolean authNeeded();",
"java.lang.String getAuth();",
"java.lang.String getAuth();",
"java.lang.String getAuth();",
"boolean hasAuth();",
"private void authenticate(String user, String pass) {\n }",
"@Override\n protected void configure(AuthenticationManagerBuilder auth) {\n }",
"@Override\... | [
"0.6752812",
"0.6218072",
"0.6218072",
"0.6218072",
"0.61995625",
"0.6182027",
"0.6143835",
"0.61392474",
"0.59708935",
"0.5931679",
"0.5897202",
"0.5876196",
"0.58608854",
"0.5836865",
"0.5805912",
"0.57852453",
"0.57065666",
"0.5679263",
"0.56727016",
"0.5665092",
"0.565755... | 0.0 | -1 |
TODO Autogenerated method stub | protected void checkQueryForSearch(CandidateQuery query, List<Object> params) {
if(query==null) {
throw new IllegalArgumentException("checkQueryForSearch(CandidateQuery query, List<Object> params) "+query+" can not be null");
}
String[] checkList= {
"query.getTargetType()",query.getTargetType(),
"q... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override\r\n\t\t\tpublic void annadir() {\n\r\n\t\t\t}",
"@Override\n\tpublic void anular() {\n\n\t}",
"@Override\n\tprotected void getExr... | [
"0.6671074",
"0.6567672",
"0.6523024",
"0.6481211",
"0.6477082",
"0.64591026",
"0.64127725",
"0.63762105",
"0.6276059",
"0.6254286",
"0.623686",
"0.6223679",
"0.6201336",
"0.61950207",
"0.61950207",
"0.61922914",
"0.6186996",
"0.6173591",
"0.61327106",
"0.61285484",
"0.608016... | 0.0 | -1 |
Converts Date given as String to date given as object. | public Date parseDate(String date, String format) {
return this.convertStringToDate(date, format);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static Date convertStringToDate(String strDate)\n\t {\n\t Date myDate = null;\n\t if (strDate.length() > 0)\n\t {\n\t DateFormat formatter = new SimpleDateFormat(EProcurementConstants.INPUT_DATE_FORMAT);\n\t try\n\t {\n\t myDate = forma... | [
"0.6909921",
"0.6881368",
"0.68681103",
"0.6784058",
"0.67214596",
"0.66932607",
"0.668448",
"0.6682733",
"0.66671634",
"0.6661706",
"0.6592853",
"0.65484166",
"0.6543475",
"0.65428084",
"0.65289915",
"0.651658",
"0.6513105",
"0.6494011",
"0.6493836",
"0.64858776",
"0.6470408... | 0.60682964 | 50 |
Converts Date given as String to date given as object. | public Date convertStringToDate(String dateToParse, String format) {
SimpleDateFormat formatter = new SimpleDateFormat(format);
Date result = null;
try {
result = formatter.parse(dateToParse);
} catch (Exception exception1) {
System.err.println(
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static Date convertStringToDate(String strDate)\n\t {\n\t Date myDate = null;\n\t if (strDate.length() > 0)\n\t {\n\t DateFormat formatter = new SimpleDateFormat(EProcurementConstants.INPUT_DATE_FORMAT);\n\t try\n\t {\n\t myDate = forma... | [
"0.690975",
"0.68790036",
"0.68677276",
"0.6784011",
"0.6719434",
"0.6692963",
"0.66848546",
"0.668141",
"0.66657454",
"0.6659591",
"0.6591835",
"0.6546939",
"0.6541635",
"0.6541179",
"0.65279484",
"0.6516968",
"0.65118176",
"0.6491956",
"0.64834255",
"0.64689696",
"0.6466199... | 0.6491432 | 18 |
Formats given date with given format. | public String formatDate(Date date, String format) {
return this.convertDateToString(date, format);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public String format (Date date , String dateFormat) ;",
"public Date formatDate( String date, String format )\n throws ParseException {\n SimpleDateFormat dateFormat = new SimpleDateFormat(format);\n dateFormat.setLenient(false);\n return dateFormat.parse(date);\n }",
"public stati... | [
"0.7205822",
"0.7132317",
"0.7005666",
"0.69919586",
"0.6561013",
"0.64861333",
"0.64353704",
"0.63492525",
"0.6329546",
"0.62939",
"0.6269629",
"0.62261266",
"0.6205373",
"0.6187804",
"0.6160959",
"0.6159536",
"0.6156424",
"0.611411",
"0.6104788",
"0.61036026",
"0.6083815",
... | 0.7147396 | 1 |
Converts given date with given pattern to String object. | public String convertDateToString(Date date, String format) {
DateFormat dateFormat = new SimpleDateFormat(format);
String dateAsString = dateFormat.format(date);
return dateAsString;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static final Function<Date,String> toStr(final String pattern) {\r\n return new ToString(pattern);\r\n }",
"public String getSimpleDate( java.util.Date date, String pattern ){\n if ( date == null || pattern == null ) return null;\n SimpleDateFormat sdf = new SimpleDateFormat(patter... | [
"0.8005487",
"0.7416862",
"0.7283096",
"0.7163661",
"0.70958173",
"0.70723426",
"0.6571093",
"0.65497774",
"0.6296196",
"0.61360383",
"0.6113263",
"0.6046777",
"0.6011517",
"0.59892505",
"0.5979728",
"0.5913717",
"0.5908517",
"0.5901056",
"0.5875054",
"0.5874348",
"0.5867673"... | 0.54833686 | 51 |
/ finds the shortest path in a graph using bellmanford Algorithm. | public int[] findMinimunPathBF(int src, int[][] graph) {
// The distance from the src to each vertices.
int[] dist = new int[graph.length];
// Maximizing the distance of the sre to all the vertices.
for (int i = 0; i < dist.length; i++) {
dist[i] = Integer.MAX_VALUE;
}
dist[src] = 0;
// Loop ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"void bellman_ford(int s)\n {\n int dist[]=new int[V]; \n \n //to track the path from s to all\n int parent[]=new int[V] ;\n //useful when a vertex has no parent\n for(int i=0;i<V;i++)\n parent[i]=-2;\n \n for(int i=0;i<V;i++) \n dist[i]=INF;\n \n //start from... | [
"0.7235284",
"0.71405",
"0.70830643",
"0.6733986",
"0.65027964",
"0.64627135",
"0.6458492",
"0.6431659",
"0.6394997",
"0.6389615",
"0.6381586",
"0.63688207",
"0.6359802",
"0.6355839",
"0.63443756",
"0.6308898",
"0.6297694",
"0.62451416",
"0.6212219",
"0.6200578",
"0.61981344"... | 0.5797351 | 70 |
Sort in decreasing length order | @Override
public int compare(String o1, String o2) {
return Integer.compare(o2.length(), o1.length());
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void sort(){\n for(int i = array.length-1;i >= 0;i--){\n sink(i);\n }\n while(size > 0){\n swap(0, size-1);\n size -= 1;\n sink(0);\n }\n }",
"public static ArrayList<String> lineLengthSort(ArrayList<String> inArray)\n\t{\n\t\tbool... | [
"0.6709117",
"0.66611093",
"0.66513926",
"0.6611596",
"0.65257436",
"0.6493754",
"0.6491357",
"0.6491357",
"0.6490662",
"0.64609885",
"0.64414567",
"0.64180756",
"0.6372272",
"0.6300941",
"0.6286009",
"0.6286009",
"0.6286009",
"0.6286009",
"0.6286009",
"0.6286009",
"0.6286009... | 0.0 | -1 |
Find by unique key | public CurrencyXRateProvider findByCode(String code) {
return (CurrencyXRateProvider) this
.getEntityManager()
.createNamedQuery(CurrencyXRateProvider.NQ_FIND_BY_CODE)
.setParameter("clientId",
Session.user.get().getClient().getId())
.setParameter("code", code).getSingleResult();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Entry find(Object key) {\r\n Entry entry_with_key = new Entry();\r\n entry_with_key.key = key; \r\n int comp_hash = compFunction(entry_with_key.key.hashCode());\r\n if (hash_table[comp_hash] == null) {\r\n return null;\r\n } else {\r\n DList searching = hash_table[comp_hash];\r\n ... | [
"0.6557548",
"0.643432",
"0.6391567",
"0.6365645",
"0.63271624",
"0.62824047",
"0.6248718",
"0.62012416",
"0.6187755",
"0.6091412",
"0.60801125",
"0.60783225",
"0.6019925",
"0.6017186",
"0.60071295",
"0.5949148",
"0.59168965",
"0.590516",
"0.5889019",
"0.58544356",
"0.5850748... | 0.0 | -1 |
Find by unique key | public CurrencyXRateProvider findByName(String name) {
return (CurrencyXRateProvider) this
.getEntityManager()
.createNamedQuery(CurrencyXRateProvider.NQ_FIND_BY_NAME)
.setParameter("clientId",
Session.user.get().getClient().getId())
.setParameter("name", name).getSingleResult();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Entry find(Object key) {\r\n Entry entry_with_key = new Entry();\r\n entry_with_key.key = key; \r\n int comp_hash = compFunction(entry_with_key.key.hashCode());\r\n if (hash_table[comp_hash] == null) {\r\n return null;\r\n } else {\r\n DList searching = hash_table[comp_hash];\r\n ... | [
"0.6557548",
"0.643432",
"0.6391567",
"0.6365645",
"0.63271624",
"0.62824047",
"0.6248718",
"0.62012416",
"0.6187755",
"0.6091412",
"0.60801125",
"0.60783225",
"0.6019925",
"0.6017186",
"0.60071295",
"0.5949148",
"0.59168965",
"0.590516",
"0.5889019",
"0.58544356",
"0.5850748... | 0.0 | -1 |
Constructor to call if output to console desired or DAG visual desired | public OWLReasoner createReasoner(OWLOntology ontology, boolean verbose, boolean showGraph) {
return new DMTReasoner(ontology, verbose, showGraph);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public PrintStreamCommandOutput()\n {\n this( System.out );\n }",
"public OutputConsole() {\n initComponents();\n setSize (1520, 750);\n }",
"public NullPrintStream()\r\n\t{\r\n\t\tsuper(System.out);\r\n\t}",
"abstract void initiateConsole();",
"private CGraphInliner() {\n }"... | [
"0.6333759",
"0.6127229",
"0.6077421",
"0.60292816",
"0.5983578",
"0.59658235",
"0.5913372",
"0.58349746",
"0.5833874",
"0.5833127",
"0.5796187",
"0.57904845",
"0.57721853",
"0.5746298",
"0.57434523",
"0.5726681",
"0.5707729",
"0.5701344",
"0.56994724",
"0.56431377",
"0.55765... | 0.0 | -1 |
Costruttore per un'istanza RuleParser | public RuleParser() {
this.fileName = "";
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Rule createRule();",
"Rule createRule();",
"Rule createRule();",
"public interface ValidParserRules {\n String getName();\n String getPrefix();\n PropertyType getType();\n ValidParserRules getParent();\n}",
"Rule getRule();",
"public ParserRule getRule() { return rule; }",
"public ParserRul... | [
"0.62157726",
"0.62157726",
"0.62157726",
"0.62084335",
"0.60326684",
"0.5987451",
"0.5987451",
"0.5987451",
"0.5987451",
"0.5987451",
"0.5987451",
"0.5987451",
"0.5987451",
"0.5987451",
"0.5987451",
"0.5987451",
"0.5987451",
"0.5987451",
"0.5987451",
"0.5987451",
"0.5987451"... | 0.60495967 | 4 |
Permette di specificare il percorso del file da cui estrarre le regole | public void setUp(String fileName) {
this.fileName = fileName;
this.timer = new MyTimer("TimerThread");
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void armarPreguntas(){\n preguntas = file.listaPreguntas(\"Preguntas.txt\");\n }",
"public void showFile() throws FileNotFoundException, IOException{\r\n ArrayList<String> arxiu = new ArrayList<>();\r\n \r\n BufferedReader br = new BufferedReader(new FileReader(fitxe... | [
"0.6538007",
"0.6518997",
"0.6489293",
"0.6483024",
"0.6373594",
"0.6324646",
"0.6267357",
"0.6245618",
"0.61500937",
"0.61420095",
"0.61260396",
"0.61188596",
"0.6105742",
"0.6100809",
"0.6062974",
"0.60073733",
"0.60028297",
"0.59977794",
"0.59917605",
"0.59848845",
"0.5971... | 0.0 | -1 |
Permette la scrittura di regola/e nel file dal percorso specficato in modo da salvare permanentemente | public void writeRuleToFile(String text, boolean append) {
if (fileName.isEmpty())
return;
try {
FileWriter fileWriter = new FileWriter(fileName, append);
PrintWriter writer = new PrintWriter(fileWriter);
writer.println(text);
writer.close()... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void pruebaEscritura() {\n\t\tFileWriter fichero = null;\n\t\tPrintWriter pw = null;\n\t\ttry {\n\t\t\tfichero = new FileWriter(\"//172.16.1.141/Modelo_Raster/Varios/Monitoreo_Forestal/REDD/Metadatos/test.xml\");\n\t\t\tpw = new PrintWriter(fichero);\n\n\t\t\tfor (int i = 0; i < 10; i++)\n\t\t\t\tpw.println... | [
"0.63330466",
"0.6260972",
"0.623227",
"0.6163346",
"0.6153471",
"0.6147348",
"0.61067605",
"0.6017744",
"0.60124224",
"0.6009369",
"0.59205586",
"0.5892288",
"0.5828394",
"0.5813266",
"0.5761136",
"0.572993",
"0.5706137",
"0.5700054",
"0.5694814",
"0.5680734",
"0.56720215",
... | 0.0 | -1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.