angelHomePage\\\", driver);\\r\\n\\t\\tswitchFrameToAngelContent();\\r\\n\\t\\tif(Element.verify(\\\"Logged in Message\\\", driver, \\\"XPATH\\\", \\\"//span[@class='pageTitleSpan' and text()='Home']\\\"))\\r\\n\\t\\t{\\r\\n\\t\\t\\tResultUtil.report(\\\"PASS\\\", \\\"Successfully logged in\\\", driver);\\r\\n\\t\\t}\\r\\n\\t\\telse\\r\\n\\t\\t{\\r\\n\\t\\t\\tResultUtil.report(\\\"FAIL\\\", \\\"Login failed\\\", driver);\\r\\n\\t\\t}\\t\\t\\r\\n\\t}\",\n \"public static void goToHome(Context context){\\n }\",\n \"public String processHomePage() {\\n return \\\"success\\\";\\n }\",\n \"@Override\\n\\tpublic void goHome() {\\n\\t\\tSystem.out.println(\\\"回窝了！！！！\\\");\\n\\t}\",\n \"public void goHome() throws ManipulatorException;\",\n \"public String home() {\\n if(getUsuario()==null){\\r\\n return \\\"login.xhtml\\\";\\r\\n }\\r\\n \\r\\n // Si el usuario es un administrador, le lleva a la pagina del listado de apadrinados\\r\\n if(getUsuario().getRol().equals(getUsuario().getRol().ADMINISTRADOR)){\\r\\n return \\\"listaninosapadrinados.xhtml\\\";\\r\\n }\\r\\n \\r\\n // Si el usuario es socio, le lleva a la pagina de apadrinar\\r\\n if(getUsuario().getRol().equals(getUsuario().getRol().SOCIO)){\\r\\n return \\\"apadrinar.xhtml\\\";\\r\\n }\\r\\n return null;\\r\\n }\",\n \"public void home(View view){\\n if(check.equals(\\\"true\\\")){\\n Intent intent = new Intent(this, Menu_Admin.class);\\n intent.putExtra(MainActivity.USER, this.email);\\n intent.putExtra(MainActivity.CHECK_ADMIN, check);\\n startActivity(intent);\\n }\\n else{\\n Intent intent = new Intent(this, Menu_Client.class);\\n intent.putExtra(MainActivity.USER, this.email);\\n intent.putExtra(MainActivity.CHECK_ADMIN, check);\\n startActivity(intent);\\n }\\n }\",\n \"public void home() {\\n\\t\\tUserUI ui = new UserUI();\\n\\t\\tui.start();\\n\\t}\",\n \"private void CallHomePage() {\\n\\t\\t\\n\\t\\tfr = new FragmentCategories();\\n\\t\\tFragmentManager fm = getFragmentManager();\\n\\t\\tFragmentTransaction fragmentTransaction = fm.beginTransaction();\\n\\t\\tfragmentTransaction.replace(R.id.fragment_place, fr);\\n\\t\\tfragmentTransaction.addToBackStack(null);\\n\\t\\tfragmentTransaction.commit();\\n\\n\\t}\",\n \"public void goHome(View view) {\\n String toastString = \\\"go home...\\\";\\n Toast.makeText(FriendsList.this,toastString, Toast.LENGTH_SHORT).show();\\n\\n //TODO\\n // go to list screen....\\n Intent goToNextScreen = new Intent (this, AccountAccess.class);\\n final int result = 1;\\n startActivity(goToNextScreen);\\n }\",\n \"public void openHome() {\\n connectionProgressDialog.dismiss();\\n Intent i = new Intent(this, ZulipActivity.class);\\n startActivity(i);\\n finish();\\n }\",\n \"public void tohome (View view){\\n Intent i = new Intent(this,Intro.class);\\n startActivity(i);\\n }\",\n \"@RequestMapping(value = \\\"/home\\\", method = RequestMethod.GET)\\n\\tpublic String openhomePage() {\\n/*\\t\\tlogger.debug(\\\"Inside Instruction page\\\");\\n*/\\t\\treturn \\\"home\\\";\\n\\t}\",\n \"public void viewListofHomes() {\\n\\t\\ttry {\\n\\t\\t\\t\\n\\t\\t}catch(Exception e) {\\n\\t\\t\\tLog.addMessage(\\\"Failed to get list of homes\\\");\\n\\t\\t\\tSystem.out.println(e.getMessage().toString());\\n\\t\\t\\tAssert.assertTrue(false, \\\"Failed to get list of homes\\\");\\n\\t\\t}\\n\\t}\",\n \"void pindahKeHome(){\\n SessionManager sessionManager = new SessionManager(PrintPreviewActivity.this);\\n sessionManager.clearPenjualanOffline();\\n\\n\\n //pindah ke home\\n Intent homeActivity = new Intent(PrintPreviewActivity.this, MainActivity.class);\\n homeActivity.setFlags(Intent.FLAG_ACTIVITY_CLEAR_TOP);\\n startActivity(homeActivity);\\n this.finish();\\n\\n }\",\n \"public void clickOnHome() {\\n\\t\\twait.waitForStableDom(250);\\n\\t\\tisElementDisplayed(\\\"link_home\\\");\\n\\t\\twait.waitForElementToBeClickable(element(\\\"link_home\\\"));\\n\\t\\texecuteJavascript(\\\"document.getElementById('doctor-home').getElementsByTagName('i')[0].click();\\\");\\n//\\t\\t element(\\\"link_home\\\").click();\\n\\t\\tlogMessage(\\\"user clicks on Home\\\");\\n\\t}\",\n \"@Override\\r\\n\\tpublic String executa(HttpServletRequest req, HttpServletResponse res) throws Exception {\\n\\t\\treturn \\\"view/home.html\\\";\\r\\n\\t}\",\n \"public Home clickonHome()\\n\\t{\\n\\t\\tdriver.findElement(By.xpath(home_xpath)).click();\\n\\t\\treturn new Home(driver);\\n\\t}\",\n \"public HomePage(BaseFunc baseFunc) {\\n // zapisivaem basefunc v teku6ij basefunc classa; 4tobi on bil dosputen v etom page;\\n this.baseFunc = baseFunc;\\n }\",\n \"public String home() {\\n if (getUsuario() == null) {\\n return \\\"login.xhtml\\\";\\n }\\n // Si el usuario es un ADMINISTRADOR, le lleva a la pagina a la lista de Alumnos\\n if (getUsuario().getRol().equals(getUsuario().getRol().ADMINISTRADOR)) {\\n return \\\"ListaAlumnos.xhtml\\\";\\n }\\n // Si el usuario es Alumno, le llevará a la página web de INDEX\\n // REVISAR\\n if (getUsuario().getRol().equals(getUsuario().getRol().ALUMNO)) {\\n return \\\"login.xhtml\\\";\\n }\\n return null;\\n }\",\n \"void keyHome();\",\n \"@Given(\\\"I am on Magalu HomePage\\\")\\n\\tpublic void i_am_on_the_homepage() {\\n\\t\\tdriver.get(Homeurl);\\n\\t}\",\n \"public void navigateToHomePage()\\n\\t {\\n\\t if(getAdvertisementbtn().isPresent())\\n\\t getAdvertisementbtn().click();\\n\\t }\",\n \"public static void home(String homeName, Player player) {\\n UUID Id = player.getUniqueId();\\n World w = Bukkit.getServer().getWorld(FileManager.getHomeYml().getString(\\\"HOMES.\\\" + Id + \\\".\\\" + homeName + \\\".world\\\"));\\n double x = FileManager.getHomeYml().getDouble(\\\"HOMES.\\\" + Id + \\\".\\\" + homeName + \\\".x\\\");\\n double y = FileManager.getHomeYml().getDouble(\\\"HOMES.\\\" + Id + \\\".\\\" + homeName + \\\".y\\\");\\n double z = FileManager.getHomeYml().getDouble(\\\"HOMES.\\\" + Id + \\\".\\\" + homeName + \\\".z\\\");\\n int ya = FileManager.getHomeYml().getInt(\\\"HOMES.\\\" + Id + \\\".\\\" + homeName + \\\".yaw\\\");\\n int pi = FileManager.getHomeYml().getInt(\\\"HOMES.\\\" + Id + \\\".\\\" + homeName + \\\".pitch\\\");\\n player.teleport(new Location(w, x, y, z, ya, pi));\\n if (Main.plugin.getConfig().getString(\\\"NOTIFICATIONS.Home\\\").equalsIgnoreCase(\\\"True\\\")) {\\n String original = MessageManager.getMessageYml().getString(\\\"Home.Home\\\");\\n String replaced = original.replaceAll(\\\"%home%\\\", homeName);\\n player.sendMessage(MessageManager.getPrefix() + ChatColor.translateAlternateColorCodes('&', replaced));\\n }\\n }\",\n \"@Override\\n public void onStartNavi(int arg0) {\\n\\n }\",\n \"public HomeSection enterUrl(){\\r\\n\\t\\tGlobal.driver.get(CONSTANT.proUrl);\\r\\n\\t\\treturn new HomeSection();\\r\\n\\t}\",\n \"private void prepareAndShowHomeScreen() {\\n\\t\\tFraHeader header = FraHeader.newInstance(true);\\n\\t\\theader.showBackButton(false);\\n\\t\\tFraHomeContent homeContent = FraHomeContent.newInstance();\\n\\t\\tFraFooter footer = FraFooter.newInstance(FooterIcons.TOP10);\\n\\t\\tFraSearch search = FraSearch.newInstance();\\n\\t\\tFraFont font = FraFont.newInstance();\\n\\t\\tFraShare share = FraShare.newInstance();\\n\\n\\t\\treplaceScreenWithNavBarContentAndMenu(header, FraHeader.TAG,\\n\\t\\t\\t\\thomeContent, FraHomeContent.TAG, footer, FraFooter.TAG,\\n\\t\\t\\t\\tFraMenu.newInstance(), FraMenu.TAG, search, FraSearch.TAG,\\n\\t\\t\\t\\tfont, FraFont.TAG, share, FraShare.TAG, false);\\n\\t\\tprepareAndShowHomeScreen(false);\\n\\t\\t/*\\n\\t\\t * replaceScreenWithNavBarContentAndFooter(homeContent,\\n\\t\\t * FraHomeContent.TAG, footer, FraFooter.TAG, false);\\n\\t\\t */\\n\\t}\",\n \"public void goHome() {\\n shouldWork = false;\\n }\",\n \"public v_home() {\\n initComponents();\\n koneksi = DatabaseConnection.getKoneksi(\\\"localhost\\\", \\\"5432\\\", \\\"postgres\\\", \\\"posgre\\\", \\\"db_hesco\\\");\\n showData();\\n showStok();\\n }\",\n \"@RequestMapping(value = {\\\"/\\\", \\\"/home\\\"}, method = RequestMethod.GET)\\n public String goHome(ModelMap model) {\\n model.addAttribute(\\\"loggedinuser\\\", appService.getPrincipal());\\n model.addAttribute(\\\"pagetitle\\\", \\\"Pand-Eco\\\");\\n return \\\"view_landing_page\\\";\\n }\",\n \"public void openHomePage() {\\n\\t\\tlogger.info(\\\"Opening Home Page\\\");\\n\\t\\tdriver.get(ReadPropertyFile.getConfigPropertyVal(\\\"homePageURL\\\"));\\n\\t\\t\\n\\t}\",\n \"public static final String getHome() { return home; }\",\n \"private void openHome() {\\n Intent intent = new Intent(this, WelcomeActivity.class);\\n startActivity(intent);\\n\\n finish();\\n }\",\n \"public void cursorHome();\",\n \"@Test\\n\\tpublic void homepage()\\n\\t{\\n\\t//WebDriver driver = null;\\n\\t\\t//Welcome_MurcuryTours wt=PageFactory.initElements(driver,Welcome_MurcuryTours.class);\\n\\t\\tWelcome_MurcuryTours wt=PageFactory.initElements(driver, Welcome_MurcuryTours.class);\\n\\twt.signOn();\\n\\tdriver.navigate().back();\\n\\twt.register();\\n\\t\\n\\t}\",\n \"private void loadHome(){\\n Intent intent = new Intent(this, NameListActivity.class);\\n startActivity(intent);\\n finish();\\n }\",\n \"public void ClickHome(View view){\\n MainActivity.redirectActivity(this,MainActivity.class);\\n\\n }\",\n \"void pasarALista();\",\n \"public void launchHomePage() {\\n Intent intent = new Intent(LoginActivity.this, HomeActivity.class);\\n startActivity(intent);\\n }\",\n \"@Override\\r\\n\\tpublic void onStartNavi(int arg0) {\\n\\r\\n\\t}\",\n \"public Home() {\\n initComponents();\\n setTitle(\\\"Home\\\");\\n setResizable(false);\\n Dimension dim = Toolkit.getDefaultToolkit().getScreenSize();\\n this.setLocation(dim.width / 2 - this.getSize().width / 2, dim.height / 2 - this.getSize().height / 2);\\n adminButton.setVisible(Login.isAdmin());\\n\\n String info = null;\\n try {\\n info = DataBase.showAccDet(Login.getIDAcc());\\n } catch (SQLException ex) {\\n Logger.getLogger(Home.class.getName()).log(Level.SEVERE, null, ex);\\n }\\n String[] cuv = info.split(\\\" \\\");\\n welcomeLabel.setText(\\\"Welcome back, \\\" + cuv[1] + \\\"!\\\");\\n\\n }\",\n \"@Override\\r\\n\\tpublic String direct() {\\n\\t\\treturn ADM + \\\"home-contents\\\";\\r\\n\\t}\",\n \"public void goToHome() {\\n Intent intent = new Intent(this, MainActivity_3.class);\\n startActivity(intent);\\n }\",\n \"public SigninPage getHomepage() throws Exception {\\n \\t WebElement homePage = getDriver().findElement(By.xpath(\\\"//span[text()='Welcome, anusha kariveda!']\\\")); //Home page validation by using menu tab\\n \\t //After Magento 2.3.upgrade fix on welcome message\\n \\t\\tAssert.assertEquals(true, homePage.isDisplayed());\\n \\t\\tSystem.out.println(\\\"User Successfully loggedin and placed under homepage\\\");\\n \\t\\tThread.sleep(4000);\\n \\treturn new SigninPage();\\n }\",\n \"void showHome() {\\n\\t\\tsetContentView(R.layout.home);\\r\\n\\t\\tView homeView = findViewById(R.id.home_image);\\r\\n\\t\\thomeView.setOnClickListener(new View.OnClickListener() {\\r\\n\\t\\t public void onClick(View v) {\\r\\n\\t\\t \\tstartGame();\\r\\n\\t\\t }\\r\\n\\t\\t});\\r\\n\\t}\",\n \"public void gotoAdminLogin(){ application.gotoAdminLogin(); }\",\n \"@Override\\n\\tpublic void onStartNavi(int arg0) {\\n\\n\\t}\",\n \"@RequestMapping(value = \\\"/\\\", method = RequestMethod.GET)\\n\\tpublic String home(@RequestParam(defaultValue=\\\"1\\\") String menu, Locale locale, HomeBean home) {\\n\\t\\tlogger.info(\\\"Welcome home! The client locale is {}.\\\", locale);\\n\\t\\tint menuId = Integer.parseInt(menu); \\n\\t\\thome.setMenus(menuService.listAllMenus());\\n\\t\\thome.setAllCharacters(characterService.getAllCharacters(menuId));\\n\\t\\thome.setContents(contentService.getContentListBy(ContentService.MENU,menuId));\\n\\t\\t\\n\\t\\treturn \\\"content/home\\\";\\n\\t}\",\n \"public void navigateToHomePage() {\\n\\t\\n\\t\\t\\tScreenShot screen = new ScreenShot();\\n\\n\\t\\t\\t// Utilize the driver and invoke the chrome browser\\n\\t\\t\\tdriver.get(\\\" https://www.progressive.com/\\\");\\n\\t\\t\\tdriver.manage().window().maximize();\\n\\n\\t\\t\\t// Wait for page to be loaded\\n\\t\\t\\tdriver.manage().timeouts().implicitlyWait(10, TimeUnit.SECONDS);\\n\\n\\t\\t\\t// Take a Screenshot\\n\\t\\t\\tscreen.takeSnapShot(driver, \\\"Progressive Insurance HomePage\\\");\\n\\t\\t\\t\\n\\t\\t\\tclickAutoInsurance();\\t\\n\\t\\t\\n\\t\\t}\",\n \"@Given(\\\"I am on the Home Page\\\")\\n public void i_am_on_the_home_page(){\\n i_logged_into_Tenant_Manager_Project_list_page();\\n\\n }\",\n \"public void goToHome() {\\n navController.navigate(R.id.nav_home);\\n }\",\n \"public ReturnHome() {\\n addSequential(new SetShooterPos(Constants.shooterHome));\\n addParallel(new HoldIntakePosition(Constants.intakeArmHome));\\n addSequential(new WaitCommand(1.5));\\n addSequential(new StopChassisIntake());\\n }\",\n \"@When(\\\"I am on Home page\\\")\\n public void homepage_i_am_on_home_page() {\\n homePage = new HomePage(driver);\\n homePage.check_page_title();\\n }\",\n \"public static String getHome() {\\n return home;\\n }\",\n \"public String getHomePage() {\\r\\n return this.homePage;\\r\\n }\",\n \"public void goHomeScreen(View view)\\n {\\n\\n Intent homeScreen;\\n\\n homeScreen = new Intent(this, homeScreen.class);\\n\\n startActivity(homeScreen);\\n\\n }\",\n \"private Home getHome(final Context ctx)\\r\\n {\\r\\n return (Home) ctx.get(this.homeKey_);\\r\\n }\",\n \"@FXML\\r\\n\\tpublic void vaiAllaHome(ActionEvent event) throws IOException {\\r\\n\\t\\tHomeView view = new HomeView(this.getStage());\\r\\n\\t\\tview.mostra();\\r\\n\\t}\",\n \"public void welcome();\",\n \"public HomePage() {\\n\\t\\tPageFactory.initElements(driver, this);\\n\\t\\t\\n\\t}\",\n \"public void inicio(){\\n }\",\n \"public home() {\\n initComponents();\\n ctoko = new controllerToko(this);\\n ctoko.isiTable();\\n }\",\n \"public void navigateToHome() {\\n Intent intent = new Intent(this, MainMenu.class);\\n startActivity(intent);\\n finish();\\n }\",\n \"public void onClickHome (View v)\\n{\\n goHome (this);\\n}\",\n \"public void msgAtHome() {\\n\\t\\tatHome.release();\\n\\t\\tstateChanged();\\n\\t}\",\n \"public void home(){\\n Intent intent = new Intent(getApplicationContext(), TouchController.class);\\n intent.setAction(Constant.ACTION_NOTIFICATION);\\n startService(intent);\\n }\",\n \"public homePage DadosCadastraisPage() {\\n\\t\\t\\n\\t\\tnavegador.findElement(By.name(\\\"usernameRegisterPage\\\")).sendKeys(\\\"benedito\\\");\\n\\n\\t\\t//preencher o email name(\\\"emailRegisterPage\\\")\\n\\t\\tnavegador.findElement(By.name(\\\"emailRegisterPage\\\")).sendKeys(\\\"beneditojose@hotmail.com\\\");\\n\\n\\t\\t//inserir senha name (\\\"passwordRegisterPage\\\")\\n\\t\\tnavegador.findElement(By.name(\\\"passwordRegisterPage\\\")).sendKeys(\\\"1Ben\\\");\\n\\n\\t\\t//confirmar a senha (\\\"confirm_passwordRegisterPage\\\")\\n\\t\\tnavegador.findElement(By.name(\\\"confirm_passwordRegisterPage\\\")).sendKeys(\\\"1Ben\\\");\\t\\n\\t\\tnavegador.findElement(By.name(\\\"first_nameRegisterPage\\\")).sendKeys(\\\"benedito\\\");\\n\\t\\tnavegador.findElement(By.name(\\\"last_nameRegisterPage\\\")).sendKeys(\\\"Jose\\\");\\n\\t\\tnavegador.findElement(By.name(\\\"phone_numberRegisterPage\\\")).sendKeys(\\\"131111111111\\\");\\n\\n\\t\\tnavegador.manage().timeouts().implicitlyWait(20, TimeUnit.SECONDS);\\n\\t\\t\\n\\t\\tSelect combobox = new Select(navegador.findElement(By.name(\\\"countryListboxRegisterPage\\\")));\\n\\t\\t\\t\\n\\t\\t//navegador.manage().timeouts().implicitlyWait(20, TimeUnit.SECONDS);\\t\\t\\n\\t\\tcombobox.selectByVisibleText(\\\"Brazil\\\");\\n\\n\\t\\tnavegador.manage().timeouts().implicitlyWait(10, TimeUnit.SECONDS);\\n\\t\\t\\n\\t\\tnavegador.findElement(By.name(\\\"cityRegisterPage\\\")).sendKeys(\\\"Sao Vicente\\\");\\n\\t\\t\\n\\t\\tJavascriptExecutor desceRua = (JavascriptExecutor)navegador;\\n\\t\\tdesceRua.executeScript(\\\"window.scrollBy(0,200)\\\");\\n\\t\\t\\n\\t\\tnavegador.findElement(By.name(\\\"addressRegisterPage\\\")).sendKeys(\\\"Rua Benigno, N 040\\\");\\n\\t\\tnavegador.findElement(By.name(\\\"state_/_province_/_regionRegisterPage\\\")).sendKeys(\\\"SP\\\");\\n\\t\\tnavegador.findElement(By.name(\\\"postal_codeRegisterPage\\\")).sendKeys(\\\"11349440\\\");\\n\\n\\t\\t//Selecionar checkbox name(\\\"i_agree\\\")\\n\\t\\tnavegador.findElement(By.name(\\\"i_agree\\\")).click();\\n\\n\\t\\t//Clicar em register id(\\\"register_btnundefined\\\")\\t\\t\\n\\t\\tnavegador.findElement(By.id(\\\"register_btnundefined\\\")).click();\\n\\t\\t\\n\\t\\treturn new homePage (navegador);\\n\\t}\",\n \"public String homepage() {\\n return this.home;\\n }\",\n \"@Override\\n\\tpublic boolean goHomePage(PageContext context) {\\n\\t\\treturn false;\\n\\t}\",\n \"public void transitionToHome() throws RemoteException{\\n removeAll();\\n mainPanel = new MainPanel(contr);\\n add(mainPanel, \\\"span 1\\\");\\n }\",\n \"@RequestMapping(method = RequestMethod.GET)\\n public ModelAndView home() {\\n page = new ModelAndView();\\n page.setViewName(\\\"Statistique\\\");\\n page.addObject(\\\"resources\\\", resourceService.listMainMenu());\\n page.addObject(\\\"proms\\\", articleService.getFiveLastProms());\\n page.addObject(\\\"mostPlayedClasses\\\", statsService.listXMostPlayedClasses(5));\\n page.addObject(\\\"mostPlayedRaces\\\", statsService.listXMostPlayedRaces(5));\\n page.addObject(\\\"mostPlayedSpecializations\\\", statsService.listXMostPlayedSpecialization(5));\\n page.addObject(\\\"usersWithoutAvatar\\\", statsService.listUsersWithoutAvatar());\\n page.addObject(\\\"mostActiveUsers\\\", statsService.listMostActiveUsers(5));\\n if (user != null)\\n page.addObject(\\\"userResources\\\", resourceService.listUserResources(user.getGroup().getId()));\\n return page;\\n }\",\n \"@Override\\r\\n\\tprotected String go() throws Exception {\\n\\t\\tif(userSize==0)\\r\\n\\t\\t{\\r\\n\\t\\t\\tuserSize=3;\\r\\n\\t\\t}\\r\\n\\t\\ttry{\\r\\n\\t\\t\\tint userid=(Integer)this.get(\\\"currentUserid\\\");\\r\\n\\t\\t\\tProDiaryService proDiaryService=(ProDiaryService)this.getBean(\\\"proDiaryService\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tpage=proDiaryService.getCurrProDiaryListByUserID(userid,userSize,pageNo);\\r\\n\\t\\t\\tPagefoot pagefoot = new Pagefoot();\\r\\n\\t\\t\\tpageString = pagefoot.packString(page, pageNo,\\\"getPage\\\",userSize);\\r\\n\\t\\t\\t \\r\\n\\t\\t\\t}catch(Exception e){\\r\\n\\t\\t\\t\\tSystem.out.println(e.getMessage());\\r\\n\\t\\t\\t}\\r\\n\\t return \\\"success\\\";\\r\\n\\t}\",\n \"void courir();\",\n \"public int getHome() {\\n return m_home;\\n }\",\n \"public void pressHomeButton() {\\n System.out.println(\\\"TV is already on the home screen\\\\n\\\");\\n }\",\n \"public void goToHomePage(View view)\\n {\\n Intent intent = new Intent( this, HomeActivity.class );\\n startActivity( intent );\\n }\",\n \"@SuppressWarnings(\\\"unchecked\\\")\\n private void userinitComponents() {\\n attendace.home = this;\\n \\n \\n \\n }\",\n \"public interface IHomePage extends BaseInterface{\\n\\n //获取设备最后数据\\n void get4GPushData();\\n\\n //重新登录\\n void reEnterIn(String loginName, String password);\\n\\n void getDeviceList(String loginName);\\n\\n\\n //发送巡检指令\\n void check4GData();\\n\\n\\n void sendJTOrder(String phoneNumber);\\n\\n\\n //开关ZB灯\\n void sendOpenZBLight(String lightflag);\\n\\n\\n //开关ZB门锁\\n void sendOpenZBDoorLock(String doorlockflag);\\n\\n}\",\n \"public static void printHome() {\\n printSeparator();\\n System.out.println(\\\"Bem Vindo ao Sistema de Cadastros das Babara\\\");\\n printSeparator();\\n }\",\n \"private void goToHome() {\\n finish();\\n Intent onPropertyView = new Intent(ChatMessage.this, MainActivity.class);\\n startActivity(onPropertyView);\\n }\",\n \"void showHomeScree(Context con) {\\n\\t\\tIntent i = new Intent(con,CouponsScreen.class);\\n\\t\\t//i.setFlags(Intent.FLAG_ACTIVITY_NEW_TASK);\\n\\t\\ti.setFlags(Intent.FLAG_ACTIVITY_CLEAR_TOP);\\n\\t\\tcon.startActivity( i );\\n\\t}\",\n \"public static void goHome(Activity a) {\\n\\t\\t\\n\\t\\tIntent intent = new Intent(a, UserHome.class);\\n\\t\\ta.startActivity(intent);\\n\\t}\",\n \"private void HomePage(){\\n Intent intent = new Intent();\\n intent.setClass(FaultActivity.this, MainActivity.class);\\n startActivity(intent);\\n FaultActivity.this.finish();\\n }\",\n \"public void verifyUserIsOnHomepage()\\n {\\n asserttextmessage(getTextFromElement(_welcomeTileText),expected,\\\"user on home page\\\");\\n\\n }\",\n \"protected abstract void displayWelcome();\",\n \"public DashBoardPage NavigateToMittICA()\\n{\\n\\tif(Action.IsVisible(Master_Guest_Mitt_ICA_Link))\\n\\tAction.Click(Master_Guest_Mitt_ICA_Link);\\n\\telse\\n\\t\\tAction.Click(Master_SignIN_Mitt_ICA_Link);\\n\\treturn this;\\n}\",\n \"@When(\\\"^the user open Automation Home page$\\\")\\r\\n\\tpublic void the_user_open_Automation_Home_page() throws Throwable {\\n\\t w.Homepage1();\\r\\n\\t}\",\n \"void setOssHomepage(String ossHomepage);\",\n \"public void displayHome() {\\n\\t\\tclearBackStack();\\n\\t\\tselectItemById(KestrelWeatherDrawerFactory.MAP_OVERVIEW, getLeftDrawerList());\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.75576174","0.7143405","0.68635535","0.6848384","0.68474436","0.68299836","0.67505085","0.6628225","0.6549451","0.64783806","0.64624274","0.644763","0.64325887","0.63915145","0.63259435","0.63116175","0.62795085","0.62673104","0.6246196","0.6237688","0.6233962","0.62313354","0.6216411","0.61991394","0.6191","0.6183764","0.6180437","0.6172968","0.61344266","0.61268276","0.61240816","0.61157054","0.61123586","0.61082715","0.6083425","0.605428","0.6037143","0.6032681","0.60173416","0.60098296","0.5986541","0.59851277","0.59851027","0.5973238","0.59675354","0.594741","0.5943974","0.59384793","0.59323823","0.592287","0.590981","0.59009975","0.58983976","0.58914846","0.5888212","0.58606786","0.58594924","0.5859031","0.58507115","0.5844822","0.58265615","0.5824637","0.58243746","0.58098626","0.5803153","0.58020777","0.5794996","0.5779864","0.5767879","0.57673675","0.57649064","0.5764131","0.57613194","0.5759455","0.57416797","0.5741363","0.5741234","0.573513","0.5732514","0.57286817","0.5724937","0.57236075","0.5709936","0.5702143","0.5691161","0.5690407","0.56902224","0.5683892","0.56832397","0.5676027","0.5674001","0.56721944","0.5669532","0.5665617","0.56622475","0.56570184","0.5653729","0.5650283","0.565022","0.5644628"],"string":"[\n \"0.75576174\",\n \"0.7143405\",\n \"0.68635535\",\n \"0.6848384\",\n \"0.68474436\",\n \"0.68299836\",\n \"0.67505085\",\n \"0.6628225\",\n \"0.6549451\",\n \"0.64783806\",\n \"0.64624274\",\n \"0.644763\",\n \"0.64325887\",\n \"0.63915145\",\n \"0.63259435\",\n \"0.63116175\",\n \"0.62795085\",\n \"0.62673104\",\n \"0.6246196\",\n \"0.6237688\",\n \"0.6233962\",\n \"0.62313354\",\n \"0.6216411\",\n \"0.61991394\",\n \"0.6191\",\n \"0.6183764\",\n \"0.6180437\",\n \"0.6172968\",\n \"0.61344266\",\n \"0.61268276\",\n \"0.61240816\",\n \"0.61157054\",\n \"0.61123586\",\n \"0.61082715\",\n \"0.6083425\",\n \"0.605428\",\n \"0.6037143\",\n \"0.6032681\",\n \"0.60173416\",\n \"0.60098296\",\n \"0.5986541\",\n \"0.59851277\",\n \"0.59851027\",\n \"0.5973238\",\n \"0.59675354\",\n \"0.594741\",\n \"0.5943974\",\n \"0.59384793\",\n \"0.59323823\",\n \"0.592287\",\n \"0.590981\",\n \"0.59009975\",\n \"0.58983976\",\n \"0.58914846\",\n \"0.5888212\",\n \"0.58606786\",\n \"0.58594924\",\n \"0.5859031\",\n \"0.58507115\",\n \"0.5844822\",\n \"0.58265615\",\n \"0.5824637\",\n \"0.58243746\",\n \"0.58098626\",\n \"0.5803153\",\n \"0.58020777\",\n \"0.5794996\",\n \"0.5779864\",\n \"0.5767879\",\n \"0.57673675\",\n \"0.57649064\",\n \"0.5764131\",\n \"0.57613194\",\n \"0.5759455\",\n \"0.57416797\",\n \"0.5741363\",\n \"0.5741234\",\n \"0.573513\",\n \"0.5732514\",\n \"0.57286817\",\n \"0.5724937\",\n \"0.57236075\",\n \"0.5709936\",\n \"0.5702143\",\n \"0.5691161\",\n \"0.5690407\",\n \"0.56902224\",\n \"0.5683892\",\n \"0.56832397\",\n \"0.5676027\",\n \"0.5674001\",\n \"0.56721944\",\n \"0.5669532\",\n \"0.5665617\",\n \"0.56622475\",\n \"0.56570184\",\n \"0.5653729\",\n \"0.5650283\",\n \"0.565022\",\n \"0.5644628\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.5694487"},"document_rank":{"kind":"string","value":"84"}}},{"rowIdx":26195,"cells":{"query":{"kind":"string","value":"Tree is an interface that should be implemented by all trees."},"document":{"kind":"string","value":"public interface Tree<T extends Comparable<T>> {\n public boolean isEmpty();\n\n public int size();\n\n public T min();\n\n public T max();\n\n public boolean contains(T element);\n\n public boolean add(T element);\n\n public boolean remove(T element);\n\n public Iterator<T> traverse(TreeTraversalOrder order);\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 interface Tree {\n\n //查找节点\n Node find(int val);\n\n //插入新节点\n boolean insert(int val);\n\n //中序遍历\n void infixOrder(Node current);\n\n //前序遍历\n void preOrder(Node current);\n\n //后序遍历\n void postOrder(Node current);\n\n //找到最大值\n Node findMax();\n\n //找到最小值\n Node findMin();\n\n //删除节点\n boolean delete(int val);\n\n}","@jdk.Supported\npublic interface Tree {\n\n /**\n * Enumerates all kinds of trees.\n */\n @jdk.Supported\n public enum Kind {\n\n /**\n * Used for instance of {@link ExtendedASTAnnotationTree}\n * representing AST-level tree annotation \"@@\"\n */\n AST_ANNOTATION(null, \"ASTAnnotation\"), // ExtendedASTAnnotationTree.class ... break API compatility with visitor ...\n\n ANNOTATED_TYPE(AnnotatedTypeTree.class, \"AnnotatedType\", \"AtType\"),\n\n /**\n * Used for instances of {@link AnnotationTree}\n * representing declaration annotations.\n */\n ANNOTATION(AnnotationTree.class, \"Annotation\", \"At\"),\n\n /**\n * Used for instances of {@link AnnotationTree}\n * representing type annotations.\n */\n TYPE_ANNOTATION(AnnotationTree.class, \"TypeAnnotation\", \"Annotation\", \"At\"),\n\n /**\n * Used for instances of {@link ArrayAccessTree}.\n */\n ARRAY_ACCESS(ArrayAccessTree.class, \"ArrayAccess\"),\n\n /**\n * Used for instances of {@link ArrayTypeTree}.\n */\n ARRAY_TYPE(ArrayTypeTree.class, \"ArrayType\"),\n\n /**\n * Used for instances of {@link AssertTree}.\n */\n ASSERT(AssertTree.class, \"Assert\", \"assert\"),\n\n /**\n * Used for instances of {@link AssignmentTree}.\n */\n ASSIGNMENT(AssignmentTree.class, \"Assign\", \"Eq\", \"=\"),\n\n /**\n * Used for instances of {@link BlockTree}.\n */\n BLOCK(BlockTree.class, \"Block\", \"{}\"),\n\n /**\n * Used for instances of {@link BreakTree}.\n */\n BREAK(BreakTree.class, \"Break\", \"break\"),\n\n /**\n * Used for instances of {@link CaseTree}.\n */\n CASE(CaseTree.class, \"Case\", \"case\"),\n\n /**\n * Used for instances of {@link CatchTree}.\n */\n CATCH(CatchTree.class, \"Catch\", \"catch\"),\n\n /**\n * Used for instances of {@link ClassTree} representing classes.\n */\n CLASS(ClassTree.class, \"Class\", \"class\"),\n\n /**\n * Used for instances of {@link CompilationUnitTree}.\n */\n COMPILATION_UNIT(CompilationUnitTree.class, \"CompilationUnit\", \"cu\"),\n\n /**\n * Used for instances of {@link ConditionalExpressionTree}.\n */\n CONDITIONAL_EXPRESSION(ConditionalExpressionTree.class, \"ConditionalExpression\", \"?\"),\n\n /**\n * Used for instances of {@link ContinueTree}.\n */\n CONTINUE(ContinueTree.class, \"Continue\", \"continue\"),\n\n /**\n * Used for instances of {@link DoWhileLoopTree}.\n */\n DO_WHILE_LOOP(DoWhileLoopTree.class, \"DoWhile\", \"do\"),\n\n /**\n * Used for instances of {@link EnhancedForLoopTree}.\n */\n ENHANCED_FOR_LOOP(EnhancedForLoopTree.class, \"EnhancedForLoop\", \"for\"),\n\n /**\n * Used for instances of {@link ExpressionStatementTree}.\n */\n EXPRESSION_STATEMENT(ExpressionStatementTree.class, \"ExpressionStatement\", \"expr;\", \"e;\"),\n\n /**\n * Used for instances of {@link MemberSelectTree}.\n */\n MEMBER_SELECT(MemberSelectTree.class, \"MemberSelect\", \".\"),\n\n /**\n * Used for instances of {@link MemberReferenceTree}.\n */\n MEMBER_REFERENCE(MemberReferenceTree.class, \"MemberReference\", \"#\"),\n\n /**\n * Used for instances of {@link ForLoopTree}.\n */\n FOR_LOOP(ForLoopTree.class, \"ForLoop\", \"for\"),\n\n /**\n * Used for instances of {@link IdentifierTree}.\n */\n IDENTIFIER(IdentifierTree.class, \"Identifier\", \"id\", \"name\"),\n\n /**\n * Used for instances of {@link IfTree}.\n */\n IF(IfTree.class, \"If\", \"if\"),\n\n /**\n * Used for instances of {@link ImportTree}.\n */\n IMPORT(ImportTree.class, \"Import\", \"import\"),\n\n /**\n * Used for instances of {@link InstanceOfTree}.\n */\n INSTANCE_OF(InstanceOfTree.class, \"InstanceOf\", \"instanceof\"),\n\n /**\n * Used for instances of {@link LabeledStatementTree}.\n */\n LABELED_STATEMENT(LabeledStatementTree.class, \"LabeledStatement\", \"label\"),\n\n /**\n * Used for instances of {@link MethodTree}.\n */\n METHOD(MethodTree.class, \"Method\", \"method\"),\n\n /**\n * Used for instances of {@link MethodInvocationTree}.\n */\n METHOD_INVOCATION(MethodInvocationTree.class, \"MethodInvocation\", \"invoke\", \"call\"),\n\n /**\n * Used for instances of {@link ModifiersTree}.\n */\n MODIFIERS(ModifiersTree.class, \"Modifiers\"),\n\n /**\n * Used for instances of {@link NewArrayTree}.\n */\n NEW_ARRAY(NewArrayTree.class, \"NewArray\", \"new\"),\n\n /**\n * Used for instances of {@link NewClassTree}.\n */\n NEW_CLASS(NewClassTree.class, \"NewClass\", \"new\"),\n\n /**\n * Used for instances of {@link LambdaExpressionTree}.\n */\n LAMBDA_EXPRESSION(LambdaExpressionTree.class, \"Lambda\", \"lambda\"),\n\n /**\n * Used for instances of {@link ParenthesizedTree}.\n */\n PARENTHESIZED(ParenthesizedTree.class, \"Parenthesized\"), // should not use prefix with \"(e)\" as it might confuse the parser ?\n\n /**\n * Used for instances of {@link PrimitiveTypeTree}.\n */\n PRIMITIVE_TYPE(PrimitiveTypeTree.class, \"PrimitiveType\", \"type\"),\n\n /**\n * Used for instances of {@link ReturnTree}.\n */\n RETURN(ReturnTree.class, \"Return\", \"return\"),\n\n /**\n * Used for instances of {@link EmptyStatementTree}.\n */\n EMPTY_STATEMENT(EmptyStatementTree.class, \"EmptyStatement\", \"empty\"),\n\n /**\n * Used for instances of {@link SwitchTree}.\n */\n SWITCH(SwitchTree.class, \"Switch\", \"switch\"),\n\n /**\n * Used for instances of {@link SynchronizedTree}.\n */\n SYNCHRONIZED(SynchronizedTree.class, \"Synchronized\", \"synchronized\"),\n\n /**\n * Used for instances of {@link ThrowTree}.\n */\n THROW(ThrowTree.class, \"Throw\", \"throw\"),\n\n /**\n * Used for instances of {@link TryTree}.\n */\n TRY(TryTree.class, \"Try\", \"try\"),\n\n /**\n * Used for instances of {@link ParameterizedTypeTree}.\n */\n PARAMETERIZED_TYPE(ParameterizedTypeTree.class, \"ParameterizedType\", \"type<>\", \"type\"),\n\n /**\n * Used for instances of {@link UnionTypeTree}.\n */\n UNION_TYPE(UnionTypeTree.class, \"UnionType\", \"union\", \"|\", \"uniontype\", \"type\"),\n\n /**\n * Used for instances of {@link IntersectionTypeTree}.\n */\n INTERSECTION_TYPE(IntersectionTypeTree.class, \"IntersectionType\", \"intersectiontype\", \"type\"),\n\n /**\n * Used for instances of {@link TypeCastTree}.\n */\n TYPE_CAST(TypeCastTree.class, \"TypeCast\", \"cast\"), // should not use prefix with \"()\" as it might confuse the parser ?\n\n /**\n * Used for instances of {@link TypeParameterTree}.\n */\n TYPE_PARAMETER(TypeParameterTree.class, \"TypeParameter\", \"type\"),\n\n /**\n * Used for instances of {@link VariableTree}.\n */\n VARIABLE(VariableTree.class, \"Variable\", \"var\", \"vardecl\"),\n\n /**\n * Used for instances of {@link WhileLoopTree}.\n */\n WHILE_LOOP(WhileLoopTree.class, \"WhileLoop\", \"while\"),\n\n /**\n * Used for instances of {@link UnaryTree} representing postfix\n * increment operator {@code ++}.\n */\n POSTFIX_INCREMENT(UnaryTree.class, \"PostfixIncrement\", \"e++\", \"++\"),\n\n /**\n * Used for instances of {@link UnaryTree} representing postfix\n * decrement operator {@code --}.\n */\n POSTFIX_DECREMENT(UnaryTree.class, \"PostfixDecrement\", \"e--\", \"--\"),\n\n /**\n * Used for instances of {@link UnaryTree} representing prefix\n * increment operator {@code ++}.\n */\n PREFIX_INCREMENT(UnaryTree.class, \"PrefixIncrement\", \"++e\", \"++\"),\n\n /**\n * Used for instances of {@link UnaryTree} representing prefix\n * decrement operator {@code --}.\n */\n PREFIX_DECREMENT(UnaryTree.class, \"PrefixDecrement\", \"--e\", \"--\"),\n\n /**\n * Used for instances of {@link UnaryTree} representing unary plus\n * operator {@code +}.\n */\n UNARY_PLUS(UnaryTree.class, \"UnaryPlus\", \"+e\", \"+\"),\n\n /**\n * Used for instances of {@link UnaryTree} representing unary minus\n * operator {@code -}.\n */\n UNARY_MINUS(UnaryTree.class, \"UnaryMinus\", \"-e\", \"-\"),\n\n /**\n * Used for instances of {@link UnaryTree} representing bitwise\n * complement operator {@code ~}.\n */\n BITWISE_COMPLEMENT(UnaryTree.class, \"BitwiseComplement\", \"~\"),\n\n /**\n * Used for instances of {@link UnaryTree} representing logical\n * complement operator {@code !}.\n */\n LOGICAL_COMPLEMENT(UnaryTree.class, \"LogicalComlement\", \"!\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * multiplication {@code *}.\n */\n MULTIPLY(BinaryTree.class, \"Multiply\", \"mult\", \"*\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * division {@code /}.\n */\n DIVIDE(BinaryTree.class, \"Divide\", \"div\", \"/\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * remainder {@code %}.\n */\n REMAINDER(BinaryTree.class, \"Remainder\", \"rem\", \"%\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * addition or string concatenation {@code +}.\n */\n PLUS(BinaryTree.class, \"BinaryPlus\", \"e+e\", \"+\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * subtraction {@code -}.\n */\n MINUS(BinaryTree.class, \"BinaryMinus\", \"e-e\", \"-\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * left shift {@code <<}.\n */\n LEFT_SHIFT(BinaryTree.class, \"LeftShift\", \"<<\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * right shift {@code >>}.\n */\n RIGHT_SHIFT(BinaryTree.class, \"RightShift\", \">>\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * unsigned right shift {@code >>>}.\n */\n UNSIGNED_RIGHT_SHIFT(BinaryTree.class, \"UnsignedRightShift\", \">>>\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * less-than {@code <}.\n */\n LESS_THAN(BinaryTree.class, \"LessThan\", \"lt\", \"<\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * greater-than {@code >}.\n */\n GREATER_THAN(BinaryTree.class, \"GreaterThan\", \"gt\", \">\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * less-than-equal {@code <=}.\n */\n LESS_THAN_EQUAL(BinaryTree.class, \"LessThanEqual\", \"le\", \"<=\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * greater-than-equal {@code >=}.\n */\n GREATER_THAN_EQUAL(BinaryTree.class, \"GreaterThanEqual\", \"ge\", \">=\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * equal-to {@code ==}.\n */\n EQUAL_TO(BinaryTree.class, \"Equals\", \"equals\", \"==\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * not-equal-to {@code !=}.\n */\n NOT_EQUAL_TO(BinaryTree.class, \"NotEquals\", \"notequals\", \"!=\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * bitwise and logical \"and\" {@code &}.\n */\n AND(BinaryTree.class, \"And\", \"and\", \"&\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * bitwise and logical \"xor\" {@code ^}.\n */\n XOR(BinaryTree.class, \"Xor\", \"xor\", \"^\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * bitwise and logical \"or\" {@code |}.\n */\n OR(BinaryTree.class, \"Or\", \"or\", \"|\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * conditional-and {@code &&}.\n */\n CONDITIONAL_AND(BinaryTree.class, \"ConditionalAnd\", \"&&\"),\n\n /**\n * Used for instances of {@link BinaryTree} representing\n * conditional-or {@code ||}.\n */\n CONDITIONAL_OR(BinaryTree.class, \"ConditionalOr\", \"||\"),\n\n /**\n * Used for instances of {@link CompoundAssignmentTree} representing\n * multiplication assignment {@code *=}.\n */\n MULTIPLY_ASSIGNMENT(CompoundAssignmentTree.class, \"MultiplyAssignment\", \"*=\"),\n\n /**\n * Used for instances of {@link CompoundAssignmentTree} representing\n * division assignment {@code /=}.\n */\n DIVIDE_ASSIGNMENT(CompoundAssignmentTree.class, \"DivideAssignment\", \"/=\"),\n\n /**\n * Used for instances of {@link CompoundAssignmentTree} representing\n * remainder assignment {@code %=}.\n */\n REMAINDER_ASSIGNMENT(CompoundAssignmentTree.class, \"RemainderAssignment\", \"%=\"),\n\n /**\n * Used for instances of {@link CompoundAssignmentTree} representing\n * addition or string concatenation assignment {@code +=}.\n */\n PLUS_ASSIGNMENT(CompoundAssignmentTree.class, \"PLusAssignment\", \"+=\"),\n\n /**\n * Used for instances of {@link CompoundAssignmentTree} representing\n * subtraction assignment {@code -=}.\n */\n MINUS_ASSIGNMENT(CompoundAssignmentTree.class, \"MinusAssignment\", \"-=\"),\n\n /**\n * Used for instances of {@link CompoundAssignmentTree} representing\n * left shift assignment {@code <<=}.\n */\n LEFT_SHIFT_ASSIGNMENT(CompoundAssignmentTree.class, \"LeftShiftAssignment\", \"<<=\"),\n\n /**\n * Used for instances of {@link CompoundAssignmentTree} representing\n * right shift assignment {@code >>=}.\n */\n RIGHT_SHIFT_ASSIGNMENT(CompoundAssignmentTree.class, \"RightShiftAssignment\", \">>=\"),\n\n /**\n * Used for instances of {@link CompoundAssignmentTree} representing\n * unsigned right shift assignment {@code >>>=}.\n */\n UNSIGNED_RIGHT_SHIFT_ASSIGNMENT(CompoundAssignmentTree.class, \"UnsignedRightShiftAssignment\", \">>>=\"),\n\n /**\n * Used for instances of {@link CompoundAssignmentTree} representing\n * bitwise and logical \"and\" assignment {@code &=}.\n */\n AND_ASSIGNMENT(CompoundAssignmentTree.class, \"AndAssignment\", \"&=\"),\n\n /**\n * Used for instances of {@link CompoundAssignmentTree} representing\n * bitwise and logical \"xor\" assignment {@code ^=}.\n */\n XOR_ASSIGNMENT(CompoundAssignmentTree.class, \"XorAssignment\", \"^=\"),\n\n /**\n * Used for instances of {@link CompoundAssignmentTree} representing\n * bitwise and logical \"or\" assignment {@code |=}.\n */\n OR_ASSIGNMENT(CompoundAssignmentTree.class, \"OrAssignment\", \"|=\"),\n\n /**\n * Used for instances of {@link LiteralTree} representing\n * an integral literal expression of type {@code int}.\n */\n INT_LITERAL(LiteralTree.class, \"IntLiteral\", \"int\", \"literal\"),\n\n /**\n * Used for instances of {@link LiteralTree} representing\n * an integral literal expression of type {@code long}.\n */\n LONG_LITERAL(LiteralTree.class, \"LongLiteral\", \"long\", \"literal\"),\n\n /**\n * Used for instances of {@link LiteralTree} representing\n * a floating-point literal expression of type {@code float}.\n */\n FLOAT_LITERAL(LiteralTree.class, \"FloatLiteral\", \"float\", \"literal\"),\n\n /**\n * Used for instances of {@link LiteralTree} representing\n * a floating-point literal expression of type {@code double}.\n */\n DOUBLE_LITERAL(LiteralTree.class, \"DoubleLiteral\", \"double\", \"literal\"),\n\n /**\n * Used for instances of {@link LiteralTree} representing\n * a boolean literal expression of type {@code boolean}.\n */\n BOOLEAN_LITERAL(LiteralTree.class, \"BooleanLiteral\", \"boolean\", \"bool\", \"literal\"),\n\n /**\n * Used for instances of {@link LiteralTree} representing\n * a character literal expression of type {@code char}.\n */\n CHAR_LITERAL(LiteralTree.class, \"CharLiteral\", \"char\", \"literal\"),\n\n /**\n * Used for instances of {@link LiteralTree} representing\n * a string literal expression of type {@link String}.\n */\n STRING_LITERAL(LiteralTree.class, \"StringLiteral\", \"string\", \"literal\"),\n\n /**\n * Used for instances of {@link LiteralTree} representing\n * the use of {@code null}.\n */\n NULL_LITERAL(LiteralTree.class, \"NullLiteral\", \"null\", \"literal\"),\n\n /**\n * Used for instances of {@link WildcardTree} representing\n * an unbounded wildcard type argument.\n */\n UNBOUNDED_WILDCARD(WildcardTree.class, \"UnboundedWildcard\", \"?\"),\n\n /**\n * Used for instances of {@link WildcardTree} representing\n * an extends bounded wildcard type argument.\n */\n EXTENDS_WILDCARD(WildcardTree.class, \"ExtendsWildcard\", \"?extends\"),\n\n /**\n * Used for instances of {@link WildcardTree} representing\n * a super bounded wildcard type argument.\n */\n SUPER_WILDCARD(WildcardTree.class, \"SuperWildcard\", \"?super\"),\n\n /**\n * Used for instances of {@link ErroneousTree}.\n */\n ERRONEOUS(ErroneousTree.class, \"Erroneous\", \"ERROR\", \"error\"),\n\n /**\n * Used for instances of {@link ClassTree} representing interfaces.\n */\n INTERFACE(ClassTree.class, \"Interface\", \"interface\"),\n\n /**\n * Used for instances of {@link ClassTree} representing enums.\n */\n ENUM(ClassTree.class, \"Enum\", \"enum\"),\n\n /**\n * Used for instances of {@link ClassTree} representing annotation types.\n */\n ANNOTATION_TYPE(ClassTree.class, \"AnnotationType\", \"At\"),\n\n /**\n * An implementation-reserved node. This is the not the node\n * you are looking for.\n */\n OTHER(null, \"Other\");\n\n\n\t\tKind(Class<? extends Tree> intf, String displayName, String... prefixAliases) {\n associatedInterface = intf;\n this.displayName = displayName;\n this.preferredPrefix = (displayName != null)? displayName : toString();\n this.preferredPrefixLowerCase = preferredPrefix.toLowerCase();\n if (prefixAliases == null) prefixAliases = new String[0];\n this.prefixAliases = Collections.unmodifiableSet(new HashSet<String>(Arrays.asList(prefixAliases)));\n Set<String> tmpPrefixAliasesLowerCase = new HashSet<String>();\n for(String e : prefixAliases) {\n \ttmpPrefixAliasesLowerCase.add(e.toLowerCase());\n }\n this.prefixAliasesLowerCase = Collections.unmodifiableSet(tmpPrefixAliasesLowerCase);\n }\n\n private final Class<? extends Tree> associatedInterface;\n \n private final String displayName;\n \n private final String preferredPrefix;\n\n private final String preferredPrefixLowerCase;\n\n private final Set<String> prefixAliases;\n \n private final Set<String> prefixAliasesLowerCase;\n\n\n public Class<? extends Tree> asInterface() {\n return associatedInterface;\n }\n\n public String getDisplayName() {\n\t\t\treturn displayName;\n\t\t}\n\n\t\tpublic String preferredPrefix() {\n \treturn preferredPrefix;\n }\n\n public boolean hasAliasPrefix(String prefix) {\n \treturn prefixAliases.contains(prefix);\n }\n\n public boolean acceptPrefix(String prefix) {\n \tif (prefix == null) return false;\n \treturn preferredPrefix.equals(prefix)\n \t\t\t|| prefixAliases.contains(prefix);\n }\n\n public boolean acceptPrefixIgnoreCase(String prefix) {\n \tif (prefix == null) return false;\n \tString prefixLowerCase = prefix.toLowerCase();\n \treturn preferredPrefixLowerCase.equals(prefixLowerCase)\n \t\t\t|| prefixAliasesLowerCase.contains(prefixLowerCase);\n }\n\n }\n\n /**\n * Gets the kind of this tree.\n *\n * @return the kind of this tree.\n */\n Kind getKind();\n\n /**\n * Accept method used to implement the visitor pattern. The\n * visitor pattern is used to implement operations on trees.\n *\n * @param <R> result type of this operation.\n * @param <D> type of additional data.\n */\n <R,D> R accept(TreeVisitor<R,D> visitor, D data);\n\n /**\n * @since jdk1.8-ARN\n */\n List<? extends ASTExtensionTree> getASTExtensions();\n\n /**\n * @since jdk1.8-ARN\n */\n List<ASTAnnotationTree> getASTAnnotations();\n \n \n}","public interface TreeNode{\r\n\t\r\n\t// enumerated node types\r\n\tpublic enum NodeType {\r\n\t\tMIN {\r\n\t\t\t@Override\r\n\t\t\tpublic NodeType opposite() {\r\n\t\t\t\treturn MAX;\r\n\t\t\t}\r\n\t\t}, MAX {\r\n\t\t\t@Override\r\n\t\t\tpublic NodeType opposite() {\r\n\t\t\t\treturn MIN;\r\n\t\t\t}\r\n\t\t};\r\n\t\r\n\t\tpublic abstract NodeType opposite();\r\n\t};\r\n\t\r\n\t// the type of node represented\r\n\tpublic NodeType getNodeType();\r\n\t\r\n\t// a possibly empty list of children\r\n\tpublic List<TreeNode> getChildrenNodes();\r\n\t\r\n\t// request a new child node after executing a move\r\n\tpublic TreeNode getChildNode(GameMove move) throws IllegalArgumentException;\r\n\t\r\n\t// the parent node of the current node\r\n\t// current Node == getParentNode for ROOT\r\n\tpublic TreeNode getParentNode();\r\n \r\n\t// whether the current node is the root node\r\n\tpublic Boolean isRootNode();\r\n \r\n\t// returns an object modeling some external state \r\n\tpublic GameState getGameState();\r\n \r\n\t// depth of node in tree\r\n\tpublic int getDepth();\r\n \r\n\t// evaluates/scores the leaf node\r\n\tpublic int scoreLeafNode();\r\n}","public MyTree getTree() {\r\n\t\treturn tree;\r\n\t}","public interface TreeInterface extends SymmetricDigraphInterface {\r\n /** Return parent of a tree node.\r\n * @precondition nonNull(node)\r\n */\r\n public IRNode getParent(IRNode node);\r\n\r\n /** The location is a value used by an IRSequence\r\n * to locate an element. For IRArray, it is an integer.\r\n * @precondition nonNull(node)\r\n */\r\n public IRLocation getLocation(IRNode node);\r\n\r\n /** Return the root of a subtree.\r\n */\r\n public IRNode getRoot(IRNode subtree);\r\n\r\n /** Return an enumeration of nodes in the subtree\r\n * starting with leaves and working toward the node given.\r\n * A postorder traversal.\r\n */\r\n public Iteratable<IRNode> bottomUp(IRNode subtree);\r\n\r\n /** Return an enumeration of nodes in the subtree\r\n * starting with this node and working toward the leaves.\r\n * A preorder traversal.\r\n */\r\n public Iteratable<IRNode> topDown(IRNode subtree);\r\n}","public Tree()\n\t{\n\t\tsuper(\"Tree\", \"tree\", 0);\n\t}","public interface Tree<E> extends Iterable<E>\r\n{\r\n //accessor methods\r\n /**\r\n * Returns the Position of the root of the tree.\r\n * @return the Position of the root of the tree\r\n */\r\n Position<E> root();\r\n \r\n /**\r\n * Returns the Position of the parent of given Position.\r\n * @param p Position to check\r\n * @return the Position of the parent of given Position (or null if p is the root). \r\n * @throws IllegalArgumentException if Position isn't valid\r\n */\r\n Position<E> parent(Position<E> p) throws IllegalArgumentException;\r\n \r\n /**\r\n * Returns the number of children of given Position.\r\n * @param p Position to check\r\n * @return the number of children of given Position\r\n * @throws IllegalArgumentException if Position isn't valid\r\n */\r\n int numChildren(Position<E> p) throws IllegalArgumentException;\r\n\r\n /**\r\n * Returns the number of positions (and therefore elements) that are contained in tree.\r\n * @return the number of positions (and therefore elements) that are contained in tree\r\n */\r\n int size();\r\n \r\n \r\n //query methods\r\n /**\r\n * Tests whether given Position has at least one child.\r\n * @param p Position to check\r\n * @return true if given Position has at least one child, false otherwise\r\n * @throws IllegalArgumentException if Position isn't valid \r\n */\r\n boolean isInternal(Position<E> p) throws IllegalArgumentException;\r\n \r\n /**\r\n * Tests whether given Position has any children.\r\n * @param p Position to check\r\n * @return true if given Position does not have children, false otherwise\r\n * @throws IllegalArgumentException if Position isn't valid \r\n */\r\n boolean isExternal(Position<E> p) throws IllegalArgumentException;\r\n \r\n /**\r\n * Tests whether given Position is the root of the tree.\r\n * @param p Position to check\r\n * @return true if given Position is the root, false otherwise\r\n * @throws IllegalArgumentException if Position isn't valid \r\n */\r\n boolean isRoot(Position<E> p) throws IllegalArgumentException;\r\n \r\n /**\r\n * Tests whether tree contains any Positions (and therefore elements).\r\n * @return true if tree doesn't contain any Positions, false otherwise\r\n */\r\n boolean isEmpty();\r\n \r\n \r\n \r\n //additional methods\r\n /**\r\n * Returns an iterable Collection containing the children of given Position.\r\n * @param p Position to check\r\n * @return an iterable Collection containing the children of given Position\r\n * @throws IllegalArgumentException if Position isn't valid\r\n */\r\n Iterable<Position<E>> children(Position<E> p) throws IllegalArgumentException;\r\n \r\n /**\r\n * Returns an iterable Collection of all Positions of the tree.\r\n * @return an iterable Collection of all Positions of the tree.\r\n */\r\n Iterable<Position<E>> positions(); \r\n \r\n /**\r\n * Returns an iterator for all elements in the tree.\r\n * Ensures tree itself is iterable.\r\n * @return an iterator for all elements in the tree\r\n */\r\n @Override\r\n Iterator<E> iterator(); \r\n}","public interface TreeModel {\n\n double checkAccuracy(DataSource d);\n void crossValidate(DataSource testdata);\n void pessimisticPrune(double z);\n void printTree();\n\n}","public interface ITreeObject {\r\n\r\n\tpublic static final Object[] EMPTY_OBJECT_ARRAY = new Object[0]; \r\n\t/**\r\n\t * Returns immediate parent of this item\r\n\t * @return immediate parent item or null if this item has no parent or parent is unknown \r\n\t */\r\n\tObject getParent();\r\n\r\n\t/**\r\n\t * Tells if item has children \r\n\t * @return true if this item has children \r\n\t */\r\n\tboolean hasChildren();\r\n\t\r\n\t/**\r\n\t * Returns number of children \r\n\t * @return child count \r\n\t */\r\n\tint getChildCount();\r\n\t\r\n\t/**\r\n\t * Returns array of child items as generic Objects\r\n\t * @return array of child items or empty array if item has no children \r\n\t */\r\n\tObject[] getChildArray();\r\n}","public interface INode {\n INode[] children();\n INode getParent();\n void setParent(INode parent);\n INode copySubTree();\n INode copyWholeTree();\n String getNodeChar();\n void setChildren(INode[] newKids);\n void setNodeChar(String c);\n INode getRoot();\n boolean isRoot();\n Bit getBit();\n void setBit(Bit bit);\n void tellChildAboutParent();\n INode addBrackets();\n INode removeBrackets();\n String toPlainText();\n}","TreeNode getTreeNode();","public JTree getTree(){\n return tree;\n }","public interface TreeNode {\n Collection<TreeNode> getChildren();\n boolean isDirectory();\n}","public EntryTree tree() {\n return tree;\n }","public interface Node {\n\n\tLong getClsId();\n\n\tNode getParent();\n\n\tvoid setParent(Node p);\n\n\tNode[] getChildrenArray();\n\n\tList<Node> getChildrenList();\n\n\tvoid resetChildren(Node[] children);\n\n\tObject getValue(int attr);\n\n\tObject setValue(int attr, Object value);\n\n\tlong getLongValue(int attr);\n\n\tInteger getId();\n}","public Tree(){\n root = null;\n }","Collection<Tree<V, E>> getTrees();","public void setTree(Tree tree) {\n this.tree = tree;\n }","public interface BinaryTree<T> {\t\r\n\t/**\r\n\t * Binary tree Node interface.\r\n\t * @param <T> Node contents\r\n\t */\r\n\tpublic interface BinaryNode<T> { }\r\n\t\r\n\t/**\r\n\t * Searches through the tree for a specified value, returning the Node\r\n\t * containing the value.\r\n\t * @param v The value to search for\r\n\t * @return The Node containing the value\r\n\t */\r\n\tpublic BinaryNode<T> find(T v);\r\n\t\r\n\t/**\r\n\t * Checks whether the tree is empty (i.e., its root is null).\r\n\t * @return {@code true} if the tree is empty, {@code false} otherwise\r\n\t */\r\n\tpublic boolean isEmpty();\r\n}","public HIRTree(){\r\n\t\t\r\n\t}","public interface TreeNode {\r\n\r\n /**\r\n * Function to return Code of this node.\r\n *\r\n * @return Character that is the code that the node represents.\r\n */\r\n Character getCode();\r\n\r\n /**\r\n * Method to add a child to a Tree node. The method returns reference to the node that was just\r\n * added or the node with the entered code if it was already present.\r\n *\r\n * @param node a treenode with the code to be added to the intermediate node\r\n * @return an already existing tree node with given code or create a new tree node and return it.\r\n */\r\n TreeNode addChild(TreeNode node);\r\n\r\n /**\r\n * Given a node with a character code, return the node in the tree with the same code.\r\n *\r\n * @param node the node with character to be checked for in the tree.\r\n * @return the node with code equal to the code of the parameter passed.\r\n */\r\n TreeNode returnNode(TreeNode node);\r\n\r\n /**\r\n * Given a size, check if all nodes in the tree have number of children equal to the size passed.\r\n *\r\n * @param size the value to be checked against.\r\n * @return true or false according to if the check passes or fails.\r\n */\r\n boolean isCodeComplete(int size);\r\n}","public interface TreeElementI extends Serializable\n{\n public void addChild(TreeElementI child);\n public String getId();\n public void setId(String id);\n public String getOutlineTitle();\n public void setOutlineTitle(String outlineTitle);\n public boolean isHasParent();\n public void setHasParent(boolean hasParent);\n public boolean isHasChild();\n public void setHasChild(boolean hasChild);\n public int getLevel();\n public void setLevel(int level);\n public boolean isExpanded();\n public void setExpanded(boolean expanded);\n public ArrayList<TreeElementI> getChildList();\n public TreeElementI getParent();\n public void setParent(TreeElementI parent);\n\n}","public interface AST {\n \n /**\n * Returns the label or tag for this AST node.\n */\n public int getNodeLabel ();\n \n /**\n * Returns the textual value of this AST node.\n */\n public String getNodeValue ();\n \n /**\n * Returns a list of child nodes, or null if there are no child nodes. The value returned is a shallow copy\n * which can be manipulated by the caller.\n */\n public List<AST> getChildNodes ();\n \n /**\n * Returns the position of the node in the original source(s).\n */\n public CodePosition getCodePosition ();\n \n}","@FunctionalInterface\npublic interface TreeGenerator {\n /**\n * Constructs a new tree data structure.\n *\n * @param type\n * the required return type of the tree\n * @param depth\n * the maximum depth of any nodes of the tree\n * @return the newly created tree data structure\n */\n Node generate(Type type, int depth);\n}","public Tree(E value) {\n this.root = new Node<E>(value);\n this.length = 0;\n }","public String getTreeType();","public interface ITreeMaker {\n /**\n * Return the Huffman/coding tree.\n * @return the Huffman tree\n */\n public HuffTree makeHuffTree(InputStream stream) throws IOException;\n}","public Tree() {\n // constructor. no nodes in tree yet\n root = null;\n }","public FamilyTree(){\r\n super();\r\n }","public interface RootNode {\r\n}","TreeStorage getTreeStorage();","public interface BinaryTreeADT<T> extends Iterable<T>\n{\n//Returns the element stored in the root of the tree.\npublic T getRootElement();\n\n//Returns the left subtree of the root.\npublic BinaryTreeADT<T> getLeft();\n\n//Returns the right subtree of the root.\npublic BinaryTreeADT<T> getRight();\n\n//Returns true if the binary tree contains an element that\n//matches the specified element and false otherwise.\npublic boolean contains (T target);\n\n//Returns a reference to the element in the tree matching\n//the specified target.\npublic T find (T target);\n\n//Returns true if the binary tree contains no elements, and\n//false otherwise.\npublic boolean isEmpty();\n\n//Returns the number of elements in this binary tree.\npublic int size();\n\n//Returns the string representation of the binary tree.\npublic String toString();\n\n\n}","public Tree(PApplet t, PImage tree) {\n\t\tthis.t = t;\n\t\tthis.tree = tree;\n\t}","public RBTree() {\n\t\troot = null;\n\t\tdrawer = new RBTreeDrawer();\n\t}","public interface TreeBuilder {\r\n\r\n\t/**\r\n\t * Creates the relationship for the give persons in the provided family with given relationshiptype.\r\n\t * @param rt\r\n\t * @param parentId\r\n\t * @param childId\r\n\t * @param familyId\r\n\t * @return - Relationship created with the given type in the given family for the given persons\r\n\t * @throws Exception\r\n\t */\r\n\tpublic Relationship createRelationship(RelationshipType rt, String parentId, String childId, String familyId) throws Exception;\r\n\t/**\r\n\t * Creates a family with given name.\r\n\t * @param name\r\n\t * @return - Family ID of the created family\r\n\t */\r\n\tpublic String createFamily(String name);\r\n\t/**\r\n\t * Provides any one person from the given family.\r\n\t * @param familyId\r\n\t * @return - Person ID from the given family\r\n\t */\r\n\tpublic String getFamilyPerson(String familyId);\r\n\t/**\r\n\t * Provides the Person Id of the root member of this family.\r\n\t * @param familyId\r\n\t * @return - Person ID of the root member in the family.\r\n\t */\r\n\tpublic String getFamilyRoot(String familyId);\r\n\t/**\r\n\t * Checks if the family exists with given ID.\r\n\t * @param familyId\r\n\t * @return boolean\r\n\t */\r\n\tpublic boolean isFamily(String familyId);\r\n}","public TreeNode getTreeNode() {\n return treeNode;\n }","public List<Tree> getTrees() {\n return trees;\n }","@Override\r\n\tpublic JTree getJTree() {\r\n\t\tif (jTree == null) {\r\n\t\t\tjTree = new JLagerTree();\r\n\t\t\tjTree.getSelectionModel().setSelectionMode(TreeSelectionModel.SINGLE_TREE_SELECTION );\r\n\t\t\tGenericNode root = new GenericNode(null);\r\n\t\t\tjTree.setModel(getTreeModel(root));\r\n\t\t\tjTree.setComponentOrientation(ComponentOrientation.LEFT_TO_RIGHT);\r\n//\t\t\tjTree.addTreeSelectionListener(new javax.swing.event.TreeSelectionListener() {\r\n//\t\t\t\tpublic void valueChanged(javax.swing.event.TreeSelectionEvent e) {\r\n//\t\t\t\t\ttreeValueChanged(e,BaugruppeTreePaneView.this.getJTree());\r\n////\t\t\t\t\tSystem.out.println(\"valueChanged()\"); // TODO Auto-generated Event stub valueChanged()\r\n//\t\t\t\t}\r\n//\t\t\t});\r\n//\t\t\tjTree.addTreeSelectionListener(getTreeSelectionListner());\r\n\t\t\t//Aussehen von JTree\r\n\t\t\tjTree.setCellRenderer(new AnfoderungTreeRenderer());\r\n\t\t\tjTree.setToolTipText(\"\");\r\n\t\t\t\r\n\t\t}\r\n\t\treturn jTree;\r\n\t}","public RBTree() {\r\n\t\t// well its supposed just create a new Red Black Tree\r\n\t\t// Maybe create a new one that does a array of Objects\r\n\t}","public String treeType();","public interface AVLTree<E extends Comparable<E>> extends BinarySortedTree<E>{\n\n boolean isAVLTree(AVLNode<E> current);\n\n interface AVLNode<E>{\n E getData();\n\n AVLNode setData(E data);\n\n AVLNode<E> getParent();\n\n AVLNode setParent(AVLNode<E> parent);\n\n AVLNode<E> getLeft();\n AVLNode setLeft(AVLNode<E> left);\n\n AVLNode<E> getRight();\n\n AVLNode setRight(AVLNode<E> right);\n\n int getHeight();\n\n AVLNode setHeight(int height);\n }\n}","public interface TreeIterable<T> extends Iterable<T>{\n TreeIterator<T> iterator();\n}","public interface TreeProcessor<N extends TreeNode<N>> {\n\n /**\n * Will start the processing at the originating node\n * @param origin the node from which the processing will originate\n * @param processor the processor to run on each node\n */\n void process(N origin, TreeNodeProcessor<N> processor);\n\n}","public TreeImpl(T dato) {\r\n\t\traiz = new NodeImpl<T>(dato, null);// El null dice que es raiz\r\n\t}","public HtmlTree()\n {\n // do nothing\n }","public JdbTree(TreeModel treeModel) {\r\n super(treeModel);\r\n commonInit();\r\n }","public void setTree(MyTree t) {\r\n\t\ttree = t;\r\n\t}","public static interface Node {\n int getValue();\n List<Node> getChildren();\n }","public TreeTest(String name) {\r\n super(name);\r\n }","public interface Node extends Serializable {\n\n\tvoid setOwner(Object owner);\n Object getOwner();\n\n String getName();\n Node getChild(int i);\n List<Node> childList();\n\n Node attach(int id, Node n) throws VetoTypeInduction;\n void induceOutputType(Class type) throws VetoTypeInduction;\n int getInputCount();\n\tClass getInputType(int id);\n List<Class> getInputTypes();\n Class getOutputType();\n Tuple.Two<Class,List<Class>> getType();\n\n Object evaluate();\n\n boolean isTerminal();\n\n <T extends Node> T copy();\n String debugString(Set<Node> set);\n}","public Symbol_Tree (Environ environ) {\r\n \r\n this.environ = environ;\r\n \r\n arraySpinners = new Vector (10);\r\n Tree = new MyJTree(environ);\r\n Tree.setToggleClickCount(1);\r\n\r\n treeRoot = new DefaultMutableTreeNode (new TreeNodeInfo(environ, TreeNodeInfo.C_TYPE_UNKNOWN));\r\n }","public Object clone()\n\t{\n\t\treturn new Tree();\n\t}","protected abstract Class<? extends TreeStructure> getTreeType();","public DefaultMutableTreeNode gettree()\n\t{\n\t\treturn root;\n\t}","public IntTree() {\n overallRoot = null;\n }","public interface Node {\n public int arityOfOperation();\n public String getText(int depth) throws CalculationException;\n public double getResult() throws CalculationException;\n public boolean isReachable(int depth);\n public List<Node> getAdjacentNodes();\n public String getTitle();\n public void setDepth(int depth);\n}","public SearchTreeInterface<Food> getPriceTree() {\r\n return priceTree;\r\n }","public MorseCodeTree()\r\n\t{\r\n\t\tbuildTree();\r\n\t}","public interface SelectionTreeNode extends TreeNode {\n public static enum State {\n NONE_SELECTED, SOME_SELECTED, ALL_SELECTED\n }\n\n /**\n * Returns this node's current state.\n *\n * @return this node's current state.\n */\n public State getState();\n\n /**\n * Updates this node's current state.\n *\n * @param state new state for this node.\n */\n public void setState(final State state);\n\n /**\n * Instructs the node to update its state. The node will then scan its children to determine whether all, some or\n * none of them are selected. If the node does not have children, the value provided by the last call of setState\n * will be retained.\n */\n public void updateState();\n\n /**\n * Adds a selection listener to the node, which will be notified when the node's state changes.\n *\n * @param listener listener to add.\n * @see net.sarcommand.swingextensions.selectiontree.SelectionTreeListener\n */\n public void addSelectionTreeListener(final SelectionTreeListener listener);\n\n /**\n * Removes a selection listener from the node.\n *\n * @param listener listener to remove.\n * @see net.sarcommand.swingextensions.selectiontree.SelectionTreeListener\n */\n public void removeSelectionTreeListener(final SelectionTreeListener listener);\n}","public Tree() // constructor\n\t{ root = null; }","public interface Node extends TreeComponent {\n /**\n * The types of decision tree nodes available.\n */\n enum NodeType {\n Internal,\n Leaf\n }\n\n /**\n * Gets the type of this node.\n * @return The type of node.\n */\n NodeType getType();\n\n void print();\n\n String getClassLabel(DataTuple tuple);\n}","public interface BinaryTreeADT <T extends Comparable<T>> {\n \n public boolean isEmpty();\n public int size();\n public boolean contains();\n public NodoBT<T> find(T elemento);\n public Iterator<T> imorden();\n public Iterator<T> preorden();\n public Iterator<T> postorden();\n \n \n \n}","public GenealogyTree(T root) {\r\n tree = (T[]) new Object[SIZE];\r\n tree[0] = root;\r\n }","public TreeModel getTreeModel() {\r\n return ModelBuilder.getSingleton().buildTreeModelAsync(this);\r\n }","@Override\n public void accept(TreeVisitor visitor) {\n }","public TreeNode() {\n }","public TreeRootNode() {\n super(\"root\");\n }","public TreeTag()\n {\n setNoField(true);\n setRootVisible(true);\n icons = new HashMap<String, Object>();\n }","public interface TreeChangeHandler extends EventHandler {\r\n\t\r\n\t/**\r\n\t * Handles the tree change event.\r\n\t * @param event the tree change event.\r\n\t */\r\n\tvoid onTreeChange(TreeChangeEvent event);\r\n\t\r\n}","public int getTreeIndex() {\n\t\treturn tree;\n\t}","public myBinaryTree<T> my_left_tree() throws myException;","public JdbTree() {\r\n this(new Object [] {});\r\n }","public BinaryTree(){}","protected PublicTreeIterator(Tree<T> tree) {\n\t\t\tsuper();\n\t\t\tthis.tree = tree;\n\t\t\tcursor = null;\n\t\t}","public TreeNode() {\n // do nothing\n }","public interface BinarySearchTree<T extends Comparable<T>> {\r\n //Add the new element to the tree where it belongs.\r\n public void insert(T element);\r\n\r\n //Search the tree for a given element.\r\n public boolean search(T element);\r\n\r\n //Get the total height of the tree starting at the root.\r\n public int getHeight();\r\n\r\n //Get how many steps the search count took. Also reset the current search count.\r\n public int getSearchSteps();\r\n\r\n //Get how many single rotations have occurred in the tree.\r\n public int getRotations();\r\n\r\n //Return a human-readable name for the tree.\r\n public String getTreeType();\r\n}","public interface LinkTree<E> extends BinaryTree<E> {\n /** Adds a root node to an empty tree */\n public Position<E> addRoot(E e) throws NonEmptyTreeException;\n /** Inserts a left child at a given node. */\n public Position<E> insertLeft(Position<E> v, E e) throws InvalidPositionException;\n /** Inserts a right child at a given node. */\n public Position<E> insertRight(Position<E> v, E e) throws InvalidPositionException;\n /** Removes a node with zero or one child. */\n public E remove(Position<E> v) throws InvalidPositionException;\n /** Attaches two trees to be subtrees of an external node. */\n public void attach(Position<E> v, BinaryTree<E> T1, BinaryTree<E> T2) throws InvalidPositionException;\n}","public KdTree() \n\t {\n\t\t \n\t }","public JdbTree(TreeNode root) {\r\n this(root, false);\r\n }","public DefaultTreeModel(final TreeNode root) {\n super(root);\n }","public TwoFourTree()\r\n\t{\r\n\t\troot = new TreeNode(); //assign the root to a new tree node\r\n\t}","public interface MasterTree extends MasterComponent {\n}","public KdTree() {\n }","@Override\n\tpublic void accept(TreeVisitor visitor) {\n\n\t}","public DefaultTreeCellEditor(JTree tree,\n\t\t\t\t DefaultTreeCellRenderer renderer) {\n\tthis(tree, renderer, null);\n }","public interface Visitor {\n\tpublic void visit(WordTreeI wt);\n}","public FVTreeManager() {\n mgrModels =\n new EnumMap<TreeTypeEnum, TreeManagementModel>(\n TreeTypeEnum.class);\n for (TreeTypeEnum type : TreeTypeEnum.values()) {\n mgrModels.put(type, new TreeManagementModel());\n }\n\n searchBuilder = new SearchTreeBuilder();\n }","public Hierarchy() {\n treeModel = new DefaultTreeModel(topNode);\n treeModel.addTreeModelListener(new MyTreeModelListener());\n initComponents ();\n }","public abstract boolean isBinarySearchTree();","public KdTree() \r\n\t{\r\n\t}","public void createTree() {\n\t\taddNodeToParent(nodeMap);\n\t}","public AVLTree() {\n\t\tthis.root = null;\n\t}","protected TreeNode<T> createTreeNode(T value) {\n return new TreeNode<T>(this, value);\n }","public abstract Type treeCopy();","public BinaryTree() {\n\t}","public interface IContainerTreeNode extends IMutableTypeContainer, MutableTreeNode {\r\n}","RootNode getRootNode();","public RBTree() {\r\n\t\troot = null;\r\n\t}","public TreeNodeImpl(N value) {\n this.value = value;\n }","void makeTree()\n \t{\n \t\t\t \n \t\tobj.insert(5,\"spandu\");\n \tobj.insert(4,\"anshu\");\n \tobj.insert(3,\"anu\");\n \tobj.insert(6,\"himani\");\n \t\t\n \t}"],"string":"[\n \"public interface Tree {\\n\\n //查找节点\\n Node find(int val);\\n\\n //插入新节点\\n boolean insert(int val);\\n\\n //中序遍历\\n void infixOrder(Node current);\\n\\n //前序遍历\\n void preOrder(Node current);\\n\\n //后序遍历\\n void postOrder(Node current);\\n\\n //找到最大值\\n Node findMax();\\n\\n //找到最小值\\n Node findMin();\\n\\n //删除节点\\n boolean delete(int val);\\n\\n}\",\n \"@jdk.Supported\\npublic interface Tree {\\n\\n /**\\n * Enumerates all kinds of trees.\\n */\\n @jdk.Supported\\n public enum Kind {\\n\\n /**\\n * Used for instance of {@link ExtendedASTAnnotationTree}\\n * representing AST-level tree annotation \\\"@@\\\"\\n */\\n AST_ANNOTATION(null, \\\"ASTAnnotation\\\"), // ExtendedASTAnnotationTree.class ... break API compatility with visitor ...\\n\\n ANNOTATED_TYPE(AnnotatedTypeTree.class, \\\"AnnotatedType\\\", \\\"AtType\\\"),\\n\\n /**\\n * Used for instances of {@link AnnotationTree}\\n * representing declaration annotations.\\n */\\n ANNOTATION(AnnotationTree.class, \\\"Annotation\\\", \\\"At\\\"),\\n\\n /**\\n * Used for instances of {@link AnnotationTree}\\n * representing type annotations.\\n */\\n TYPE_ANNOTATION(AnnotationTree.class, \\\"TypeAnnotation\\\", \\\"Annotation\\\", \\\"At\\\"),\\n\\n /**\\n * Used for instances of {@link ArrayAccessTree}.\\n */\\n ARRAY_ACCESS(ArrayAccessTree.class, \\\"ArrayAccess\\\"),\\n\\n /**\\n * Used for instances of {@link ArrayTypeTree}.\\n */\\n ARRAY_TYPE(ArrayTypeTree.class, \\\"ArrayType\\\"),\\n\\n /**\\n * Used for instances of {@link AssertTree}.\\n */\\n ASSERT(AssertTree.class, \\\"Assert\\\", \\\"assert\\\"),\\n\\n /**\\n * Used for instances of {@link AssignmentTree}.\\n */\\n ASSIGNMENT(AssignmentTree.class, \\\"Assign\\\", \\\"Eq\\\", \\\"=\\\"),\\n\\n /**\\n * Used for instances of {@link BlockTree}.\\n */\\n BLOCK(BlockTree.class, \\\"Block\\\", \\\"{}\\\"),\\n\\n /**\\n * Used for instances of {@link BreakTree}.\\n */\\n BREAK(BreakTree.class, \\\"Break\\\", \\\"break\\\"),\\n\\n /**\\n * Used for instances of {@link CaseTree}.\\n */\\n CASE(CaseTree.class, \\\"Case\\\", \\\"case\\\"),\\n\\n /**\\n * Used for instances of {@link CatchTree}.\\n */\\n CATCH(CatchTree.class, \\\"Catch\\\", \\\"catch\\\"),\\n\\n /**\\n * Used for instances of {@link ClassTree} representing classes.\\n */\\n CLASS(ClassTree.class, \\\"Class\\\", \\\"class\\\"),\\n\\n /**\\n * Used for instances of {@link CompilationUnitTree}.\\n */\\n COMPILATION_UNIT(CompilationUnitTree.class, \\\"CompilationUnit\\\", \\\"cu\\\"),\\n\\n /**\\n * Used for instances of {@link ConditionalExpressionTree}.\\n */\\n CONDITIONAL_EXPRESSION(ConditionalExpressionTree.class, \\\"ConditionalExpression\\\", \\\"?\\\"),\\n\\n /**\\n * Used for instances of {@link ContinueTree}.\\n */\\n CONTINUE(ContinueTree.class, \\\"Continue\\\", \\\"continue\\\"),\\n\\n /**\\n * Used for instances of {@link DoWhileLoopTree}.\\n */\\n DO_WHILE_LOOP(DoWhileLoopTree.class, \\\"DoWhile\\\", \\\"do\\\"),\\n\\n /**\\n * Used for instances of {@link EnhancedForLoopTree}.\\n */\\n ENHANCED_FOR_LOOP(EnhancedForLoopTree.class, \\\"EnhancedForLoop\\\", \\\"for\\\"),\\n\\n /**\\n * Used for instances of {@link ExpressionStatementTree}.\\n */\\n EXPRESSION_STATEMENT(ExpressionStatementTree.class, \\\"ExpressionStatement\\\", \\\"expr;\\\", \\\"e;\\\"),\\n\\n /**\\n * Used for instances of {@link MemberSelectTree}.\\n */\\n MEMBER_SELECT(MemberSelectTree.class, \\\"MemberSelect\\\", \\\".\\\"),\\n\\n /**\\n * Used for instances of {@link MemberReferenceTree}.\\n */\\n MEMBER_REFERENCE(MemberReferenceTree.class, \\\"MemberReference\\\", \\\"#\\\"),\\n\\n /**\\n * Used for instances of {@link ForLoopTree}.\\n */\\n FOR_LOOP(ForLoopTree.class, \\\"ForLoop\\\", \\\"for\\\"),\\n\\n /**\\n * Used for instances of {@link IdentifierTree}.\\n */\\n IDENTIFIER(IdentifierTree.class, \\\"Identifier\\\", \\\"id\\\", \\\"name\\\"),\\n\\n /**\\n * Used for instances of {@link IfTree}.\\n */\\n IF(IfTree.class, \\\"If\\\", \\\"if\\\"),\\n\\n /**\\n * Used for instances of {@link ImportTree}.\\n */\\n IMPORT(ImportTree.class, \\\"Import\\\", \\\"import\\\"),\\n\\n /**\\n * Used for instances of {@link InstanceOfTree}.\\n */\\n INSTANCE_OF(InstanceOfTree.class, \\\"InstanceOf\\\", \\\"instanceof\\\"),\\n\\n /**\\n * Used for instances of {@link LabeledStatementTree}.\\n */\\n LABELED_STATEMENT(LabeledStatementTree.class, \\\"LabeledStatement\\\", \\\"label\\\"),\\n\\n /**\\n * Used for instances of {@link MethodTree}.\\n */\\n METHOD(MethodTree.class, \\\"Method\\\", \\\"method\\\"),\\n\\n /**\\n * Used for instances of {@link MethodInvocationTree}.\\n */\\n METHOD_INVOCATION(MethodInvocationTree.class, \\\"MethodInvocation\\\", \\\"invoke\\\", \\\"call\\\"),\\n\\n /**\\n * Used for instances of {@link ModifiersTree}.\\n */\\n MODIFIERS(ModifiersTree.class, \\\"Modifiers\\\"),\\n\\n /**\\n * Used for instances of {@link NewArrayTree}.\\n */\\n NEW_ARRAY(NewArrayTree.class, \\\"NewArray\\\", \\\"new\\\"),\\n\\n /**\\n * Used for instances of {@link NewClassTree}.\\n */\\n NEW_CLASS(NewClassTree.class, \\\"NewClass\\\", \\\"new\\\"),\\n\\n /**\\n * Used for instances of {@link LambdaExpressionTree}.\\n */\\n LAMBDA_EXPRESSION(LambdaExpressionTree.class, \\\"Lambda\\\", \\\"lambda\\\"),\\n\\n /**\\n * Used for instances of {@link ParenthesizedTree}.\\n */\\n PARENTHESIZED(ParenthesizedTree.class, \\\"Parenthesized\\\"), // should not use prefix with \\\"(e)\\\" as it might confuse the parser ?\\n\\n /**\\n * Used for instances of {@link PrimitiveTypeTree}.\\n */\\n PRIMITIVE_TYPE(PrimitiveTypeTree.class, \\\"PrimitiveType\\\", \\\"type\\\"),\\n\\n /**\\n * Used for instances of {@link ReturnTree}.\\n */\\n RETURN(ReturnTree.class, \\\"Return\\\", \\\"return\\\"),\\n\\n /**\\n * Used for instances of {@link EmptyStatementTree}.\\n */\\n EMPTY_STATEMENT(EmptyStatementTree.class, \\\"EmptyStatement\\\", \\\"empty\\\"),\\n\\n /**\\n * Used for instances of {@link SwitchTree}.\\n */\\n SWITCH(SwitchTree.class, \\\"Switch\\\", \\\"switch\\\"),\\n\\n /**\\n * Used for instances of {@link SynchronizedTree}.\\n */\\n SYNCHRONIZED(SynchronizedTree.class, \\\"Synchronized\\\", \\\"synchronized\\\"),\\n\\n /**\\n * Used for instances of {@link ThrowTree}.\\n */\\n THROW(ThrowTree.class, \\\"Throw\\\", \\\"throw\\\"),\\n\\n /**\\n * Used for instances of {@link TryTree}.\\n */\\n TRY(TryTree.class, \\\"Try\\\", \\\"try\\\"),\\n\\n /**\\n * Used for instances of {@link ParameterizedTypeTree}.\\n */\\n PARAMETERIZED_TYPE(ParameterizedTypeTree.class, \\\"ParameterizedType\\\", \\\"type<>\\\", \\\"type\\\"),\\n\\n /**\\n * Used for instances of {@link UnionTypeTree}.\\n */\\n UNION_TYPE(UnionTypeTree.class, \\\"UnionType\\\", \\\"union\\\", \\\"|\\\", \\\"uniontype\\\", \\\"type\\\"),\\n\\n /**\\n * Used for instances of {@link IntersectionTypeTree}.\\n */\\n INTERSECTION_TYPE(IntersectionTypeTree.class, \\\"IntersectionType\\\", \\\"intersectiontype\\\", \\\"type\\\"),\\n\\n /**\\n * Used for instances of {@link TypeCastTree}.\\n */\\n TYPE_CAST(TypeCastTree.class, \\\"TypeCast\\\", \\\"cast\\\"), // should not use prefix with \\\"()\\\" as it might confuse the parser ?\\n\\n /**\\n * Used for instances of {@link TypeParameterTree}.\\n */\\n TYPE_PARAMETER(TypeParameterTree.class, \\\"TypeParameter\\\", \\\"type\\\"),\\n\\n /**\\n * Used for instances of {@link VariableTree}.\\n */\\n VARIABLE(VariableTree.class, \\\"Variable\\\", \\\"var\\\", \\\"vardecl\\\"),\\n\\n /**\\n * Used for instances of {@link WhileLoopTree}.\\n */\\n WHILE_LOOP(WhileLoopTree.class, \\\"WhileLoop\\\", \\\"while\\\"),\\n\\n /**\\n * Used for instances of {@link UnaryTree} representing postfix\\n * increment operator {@code ++}.\\n */\\n POSTFIX_INCREMENT(UnaryTree.class, \\\"PostfixIncrement\\\", \\\"e++\\\", \\\"++\\\"),\\n\\n /**\\n * Used for instances of {@link UnaryTree} representing postfix\\n * decrement operator {@code --}.\\n */\\n POSTFIX_DECREMENT(UnaryTree.class, \\\"PostfixDecrement\\\", \\\"e--\\\", \\\"--\\\"),\\n\\n /**\\n * Used for instances of {@link UnaryTree} representing prefix\\n * increment operator {@code ++}.\\n */\\n PREFIX_INCREMENT(UnaryTree.class, \\\"PrefixIncrement\\\", \\\"++e\\\", \\\"++\\\"),\\n\\n /**\\n * Used for instances of {@link UnaryTree} representing prefix\\n * decrement operator {@code --}.\\n */\\n PREFIX_DECREMENT(UnaryTree.class, \\\"PrefixDecrement\\\", \\\"--e\\\", \\\"--\\\"),\\n\\n /**\\n * Used for instances of {@link UnaryTree} representing unary plus\\n * operator {@code +}.\\n */\\n UNARY_PLUS(UnaryTree.class, \\\"UnaryPlus\\\", \\\"+e\\\", \\\"+\\\"),\\n\\n /**\\n * Used for instances of {@link UnaryTree} representing unary minus\\n * operator {@code -}.\\n */\\n UNARY_MINUS(UnaryTree.class, \\\"UnaryMinus\\\", \\\"-e\\\", \\\"-\\\"),\\n\\n /**\\n * Used for instances of {@link UnaryTree} representing bitwise\\n * complement operator {@code ~}.\\n */\\n BITWISE_COMPLEMENT(UnaryTree.class, \\\"BitwiseComplement\\\", \\\"~\\\"),\\n\\n /**\\n * Used for instances of {@link UnaryTree} representing logical\\n * complement operator {@code !}.\\n */\\n LOGICAL_COMPLEMENT(UnaryTree.class, \\\"LogicalComlement\\\", \\\"!\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * multiplication {@code *}.\\n */\\n MULTIPLY(BinaryTree.class, \\\"Multiply\\\", \\\"mult\\\", \\\"*\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * division {@code /}.\\n */\\n DIVIDE(BinaryTree.class, \\\"Divide\\\", \\\"div\\\", \\\"/\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * remainder {@code %}.\\n */\\n REMAINDER(BinaryTree.class, \\\"Remainder\\\", \\\"rem\\\", \\\"%\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * addition or string concatenation {@code +}.\\n */\\n PLUS(BinaryTree.class, \\\"BinaryPlus\\\", \\\"e+e\\\", \\\"+\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * subtraction {@code -}.\\n */\\n MINUS(BinaryTree.class, \\\"BinaryMinus\\\", \\\"e-e\\\", \\\"-\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * left shift {@code <<}.\\n */\\n LEFT_SHIFT(BinaryTree.class, \\\"LeftShift\\\", \\\"<<\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * right shift {@code >>}.\\n */\\n RIGHT_SHIFT(BinaryTree.class, \\\"RightShift\\\", \\\">>\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * unsigned right shift {@code >>>}.\\n */\\n UNSIGNED_RIGHT_SHIFT(BinaryTree.class, \\\"UnsignedRightShift\\\", \\\">>>\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * less-than {@code <}.\\n */\\n LESS_THAN(BinaryTree.class, \\\"LessThan\\\", \\\"lt\\\", \\\"<\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * greater-than {@code >}.\\n */\\n GREATER_THAN(BinaryTree.class, \\\"GreaterThan\\\", \\\"gt\\\", \\\">\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * less-than-equal {@code <=}.\\n */\\n LESS_THAN_EQUAL(BinaryTree.class, \\\"LessThanEqual\\\", \\\"le\\\", \\\"<=\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * greater-than-equal {@code >=}.\\n */\\n GREATER_THAN_EQUAL(BinaryTree.class, \\\"GreaterThanEqual\\\", \\\"ge\\\", \\\">=\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * equal-to {@code ==}.\\n */\\n EQUAL_TO(BinaryTree.class, \\\"Equals\\\", \\\"equals\\\", \\\"==\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * not-equal-to {@code !=}.\\n */\\n NOT_EQUAL_TO(BinaryTree.class, \\\"NotEquals\\\", \\\"notequals\\\", \\\"!=\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * bitwise and logical \\\"and\\\" {@code &}.\\n */\\n AND(BinaryTree.class, \\\"And\\\", \\\"and\\\", \\\"&\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * bitwise and logical \\\"xor\\\" {@code ^}.\\n */\\n XOR(BinaryTree.class, \\\"Xor\\\", \\\"xor\\\", \\\"^\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * bitwise and logical \\\"or\\\" {@code |}.\\n */\\n OR(BinaryTree.class, \\\"Or\\\", \\\"or\\\", \\\"|\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * conditional-and {@code &&}.\\n */\\n CONDITIONAL_AND(BinaryTree.class, \\\"ConditionalAnd\\\", \\\"&&\\\"),\\n\\n /**\\n * Used for instances of {@link BinaryTree} representing\\n * conditional-or {@code ||}.\\n */\\n CONDITIONAL_OR(BinaryTree.class, \\\"ConditionalOr\\\", \\\"||\\\"),\\n\\n /**\\n * Used for instances of {@link CompoundAssignmentTree} representing\\n * multiplication assignment {@code *=}.\\n */\\n MULTIPLY_ASSIGNMENT(CompoundAssignmentTree.class, \\\"MultiplyAssignment\\\", \\\"*=\\\"),\\n\\n /**\\n * Used for instances of {@link CompoundAssignmentTree} representing\\n * division assignment {@code /=}.\\n */\\n DIVIDE_ASSIGNMENT(CompoundAssignmentTree.class, \\\"DivideAssignment\\\", \\\"/=\\\"),\\n\\n /**\\n * Used for instances of {@link CompoundAssignmentTree} representing\\n * remainder assignment {@code %=}.\\n */\\n REMAINDER_ASSIGNMENT(CompoundAssignmentTree.class, \\\"RemainderAssignment\\\", \\\"%=\\\"),\\n\\n /**\\n * Used for instances of {@link CompoundAssignmentTree} representing\\n * addition or string concatenation assignment {@code +=}.\\n */\\n PLUS_ASSIGNMENT(CompoundAssignmentTree.class, \\\"PLusAssignment\\\", \\\"+=\\\"),\\n\\n /**\\n * Used for instances of {@link CompoundAssignmentTree} representing\\n * subtraction assignment {@code -=}.\\n */\\n MINUS_ASSIGNMENT(CompoundAssignmentTree.class, \\\"MinusAssignment\\\", \\\"-=\\\"),\\n\\n /**\\n * Used for instances of {@link CompoundAssignmentTree} representing\\n * left shift assignment {@code <<=}.\\n */\\n LEFT_SHIFT_ASSIGNMENT(CompoundAssignmentTree.class, \\\"LeftShiftAssignment\\\", \\\"<<=\\\"),\\n\\n /**\\n * Used for instances of {@link CompoundAssignmentTree} representing\\n * right shift assignment {@code >>=}.\\n */\\n RIGHT_SHIFT_ASSIGNMENT(CompoundAssignmentTree.class, \\\"RightShiftAssignment\\\", \\\">>=\\\"),\\n\\n /**\\n * Used for instances of {@link CompoundAssignmentTree} representing\\n * unsigned right shift assignment {@code >>>=}.\\n */\\n UNSIGNED_RIGHT_SHIFT_ASSIGNMENT(CompoundAssignmentTree.class, \\\"UnsignedRightShiftAssignment\\\", \\\">>>=\\\"),\\n\\n /**\\n * Used for instances of {@link CompoundAssignmentTree} representing\\n * bitwise and logical \\\"and\\\" assignment {@code &=}.\\n */\\n AND_ASSIGNMENT(CompoundAssignmentTree.class, \\\"AndAssignment\\\", \\\"&=\\\"),\\n\\n /**\\n * Used for instances of {@link CompoundAssignmentTree} representing\\n * bitwise and logical \\\"xor\\\" assignment {@code ^=}.\\n */\\n XOR_ASSIGNMENT(CompoundAssignmentTree.class, \\\"XorAssignment\\\", \\\"^=\\\"),\\n\\n /**\\n * Used for instances of {@link CompoundAssignmentTree} representing\\n * bitwise and logical \\\"or\\\" assignment {@code |=}.\\n */\\n OR_ASSIGNMENT(CompoundAssignmentTree.class, \\\"OrAssignment\\\", \\\"|=\\\"),\\n\\n /**\\n * Used for instances of {@link LiteralTree} representing\\n * an integral literal expression of type {@code int}.\\n */\\n INT_LITERAL(LiteralTree.class, \\\"IntLiteral\\\", \\\"int\\\", \\\"literal\\\"),\\n\\n /**\\n * Used for instances of {@link LiteralTree} representing\\n * an integral literal expression of type {@code long}.\\n */\\n LONG_LITERAL(LiteralTree.class, \\\"LongLiteral\\\", \\\"long\\\", \\\"literal\\\"),\\n\\n /**\\n * Used for instances of {@link LiteralTree} representing\\n * a floating-point literal expression of type {@code float}.\\n */\\n FLOAT_LITERAL(LiteralTree.class, \\\"FloatLiteral\\\", \\\"float\\\", \\\"literal\\\"),\\n\\n /**\\n * Used for instances of {@link LiteralTree} representing\\n * a floating-point literal expression of type {@code double}.\\n */\\n DOUBLE_LITERAL(LiteralTree.class, \\\"DoubleLiteral\\\", \\\"double\\\", \\\"literal\\\"),\\n\\n /**\\n * Used for instances of {@link LiteralTree} representing\\n * a boolean literal expression of type {@code boolean}.\\n */\\n BOOLEAN_LITERAL(LiteralTree.class, \\\"BooleanLiteral\\\", \\\"boolean\\\", \\\"bool\\\", \\\"literal\\\"),\\n\\n /**\\n * Used for instances of {@link LiteralTree} representing\\n * a character literal expression of type {@code char}.\\n */\\n CHAR_LITERAL(LiteralTree.class, \\\"CharLiteral\\\", \\\"char\\\", \\\"literal\\\"),\\n\\n /**\\n * Used for instances of {@link LiteralTree} representing\\n * a string literal expression of type {@link String}.\\n */\\n STRING_LITERAL(LiteralTree.class, \\\"StringLiteral\\\", \\\"string\\\", \\\"literal\\\"),\\n\\n /**\\n * Used for instances of {@link LiteralTree} representing\\n * the use of {@code null}.\\n */\\n NULL_LITERAL(LiteralTree.class, \\\"NullLiteral\\\", \\\"null\\\", \\\"literal\\\"),\\n\\n /**\\n * Used for instances of {@link WildcardTree} representing\\n * an unbounded wildcard type argument.\\n */\\n UNBOUNDED_WILDCARD(WildcardTree.class, \\\"UnboundedWildcard\\\", \\\"?\\\"),\\n\\n /**\\n * Used for instances of {@link WildcardTree} representing\\n * an extends bounded wildcard type argument.\\n */\\n EXTENDS_WILDCARD(WildcardTree.class, \\\"ExtendsWildcard\\\", \\\"?extends\\\"),\\n\\n /**\\n * Used for instances of {@link WildcardTree} representing\\n * a super bounded wildcard type argument.\\n */\\n SUPER_WILDCARD(WildcardTree.class, \\\"SuperWildcard\\\", \\\"?super\\\"),\\n\\n /**\\n * Used for instances of {@link ErroneousTree}.\\n */\\n ERRONEOUS(ErroneousTree.class, \\\"Erroneous\\\", \\\"ERROR\\\", \\\"error\\\"),\\n\\n /**\\n * Used for instances of {@link ClassTree} representing interfaces.\\n */\\n INTERFACE(ClassTree.class, \\\"Interface\\\", \\\"interface\\\"),\\n\\n /**\\n * Used for instances of {@link ClassTree} representing enums.\\n */\\n ENUM(ClassTree.class, \\\"Enum\\\", \\\"enum\\\"),\\n\\n /**\\n * Used for instances of {@link ClassTree} representing annotation types.\\n */\\n ANNOTATION_TYPE(ClassTree.class, \\\"AnnotationType\\\", \\\"At\\\"),\\n\\n /**\\n * An implementation-reserved node. This is the not the node\\n * you are looking for.\\n */\\n OTHER(null, \\\"Other\\\");\\n\\n\\n\\t\\tKind(Class<? extends Tree> intf, String displayName, String... prefixAliases) {\\n associatedInterface = intf;\\n this.displayName = displayName;\\n this.preferredPrefix = (displayName != null)? displayName : toString();\\n this.preferredPrefixLowerCase = preferredPrefix.toLowerCase();\\n if (prefixAliases == null) prefixAliases = new String[0];\\n this.prefixAliases = Collections.unmodifiableSet(new HashSet<String>(Arrays.asList(prefixAliases)));\\n Set<String> tmpPrefixAliasesLowerCase = new HashSet<String>();\\n for(String e : prefixAliases) {\\n \\ttmpPrefixAliasesLowerCase.add(e.toLowerCase());\\n }\\n this.prefixAliasesLowerCase = Collections.unmodifiableSet(tmpPrefixAliasesLowerCase);\\n }\\n\\n private final Class<? extends Tree> associatedInterface;\\n \\n private final String displayName;\\n \\n private final String preferredPrefix;\\n\\n private final String preferredPrefixLowerCase;\\n\\n private final Set<String> prefixAliases;\\n \\n private final Set<String> prefixAliasesLowerCase;\\n\\n\\n public Class<? extends Tree> asInterface() {\\n return associatedInterface;\\n }\\n\\n public String getDisplayName() {\\n\\t\\t\\treturn displayName;\\n\\t\\t}\\n\\n\\t\\tpublic String preferredPrefix() {\\n \\treturn preferredPrefix;\\n }\\n\\n public boolean hasAliasPrefix(String prefix) {\\n \\treturn prefixAliases.contains(prefix);\\n }\\n\\n public boolean acceptPrefix(String prefix) {\\n \\tif (prefix == null) return false;\\n \\treturn preferredPrefix.equals(prefix)\\n \\t\\t\\t|| prefixAliases.contains(prefix);\\n }\\n\\n public boolean acceptPrefixIgnoreCase(String prefix) {\\n \\tif (prefix == null) return false;\\n \\tString prefixLowerCase = prefix.toLowerCase();\\n \\treturn preferredPrefixLowerCase.equals(prefixLowerCase)\\n \\t\\t\\t|| prefixAliasesLowerCase.contains(prefixLowerCase);\\n }\\n\\n }\\n\\n /**\\n * Gets the kind of this tree.\\n *\\n * @return the kind of this tree.\\n */\\n Kind getKind();\\n\\n /**\\n * Accept method used to implement the visitor pattern. The\\n * visitor pattern is used to implement operations on trees.\\n *\\n * @param <R> result type of this operation.\\n * @param <D> type of additional data.\\n */\\n <R,D> R accept(TreeVisitor<R,D> visitor, D data);\\n\\n /**\\n * @since jdk1.8-ARN\\n */\\n List<? extends ASTExtensionTree> getASTExtensions();\\n\\n /**\\n * @since jdk1.8-ARN\\n */\\n List<ASTAnnotationTree> getASTAnnotations();\\n \\n \\n}\",\n \"public interface TreeNode{\\r\\n\\t\\r\\n\\t// enumerated node types\\r\\n\\tpublic enum NodeType {\\r\\n\\t\\tMIN {\\r\\n\\t\\t\\t@Override\\r\\n\\t\\t\\tpublic NodeType opposite() {\\r\\n\\t\\t\\t\\treturn MAX;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}, MAX {\\r\\n\\t\\t\\t@Override\\r\\n\\t\\t\\tpublic NodeType opposite() {\\r\\n\\t\\t\\t\\treturn MIN;\\r\\n\\t\\t\\t}\\r\\n\\t\\t};\\r\\n\\t\\r\\n\\t\\tpublic abstract NodeType opposite();\\r\\n\\t};\\r\\n\\t\\r\\n\\t// the type of node represented\\r\\n\\tpublic NodeType getNodeType();\\r\\n\\t\\r\\n\\t// a possibly empty list of children\\r\\n\\tpublic List<TreeNode> getChildrenNodes();\\r\\n\\t\\r\\n\\t// request a new child node after executing a move\\r\\n\\tpublic TreeNode getChildNode(GameMove move) throws IllegalArgumentException;\\r\\n\\t\\r\\n\\t// the parent node of the current node\\r\\n\\t// current Node == getParentNode for ROOT\\r\\n\\tpublic TreeNode getParentNode();\\r\\n \\r\\n\\t// whether the current node is the root node\\r\\n\\tpublic Boolean isRootNode();\\r\\n \\r\\n\\t// returns an object modeling some external state \\r\\n\\tpublic GameState getGameState();\\r\\n \\r\\n\\t// depth of node in tree\\r\\n\\tpublic int getDepth();\\r\\n \\r\\n\\t// evaluates/scores the leaf node\\r\\n\\tpublic int scoreLeafNode();\\r\\n}\",\n \"public MyTree getTree() {\\r\\n\\t\\treturn tree;\\r\\n\\t}\",\n \"public interface TreeInterface extends SymmetricDigraphInterface {\\r\\n /** Return parent of a tree node.\\r\\n * @precondition nonNull(node)\\r\\n */\\r\\n public IRNode getParent(IRNode node);\\r\\n\\r\\n /** The location is a value used by an IRSequence\\r\\n * to locate an element. For IRArray, it is an integer.\\r\\n * @precondition nonNull(node)\\r\\n */\\r\\n public IRLocation getLocation(IRNode node);\\r\\n\\r\\n /** Return the root of a subtree.\\r\\n */\\r\\n public IRNode getRoot(IRNode subtree);\\r\\n\\r\\n /** Return an enumeration of nodes in the subtree\\r\\n * starting with leaves and working toward the node given.\\r\\n * A postorder traversal.\\r\\n */\\r\\n public Iteratable<IRNode> bottomUp(IRNode subtree);\\r\\n\\r\\n /** Return an enumeration of nodes in the subtree\\r\\n * starting with this node and working toward the leaves.\\r\\n * A preorder traversal.\\r\\n */\\r\\n public Iteratable<IRNode> topDown(IRNode subtree);\\r\\n}\",\n \"public Tree()\\n\\t{\\n\\t\\tsuper(\\\"Tree\\\", \\\"tree\\\", 0);\\n\\t}\",\n \"public interface Tree<E> extends Iterable<E>\\r\\n{\\r\\n //accessor methods\\r\\n /**\\r\\n * Returns the Position of the root of the tree.\\r\\n * @return the Position of the root of the tree\\r\\n */\\r\\n Position<E> root();\\r\\n \\r\\n /**\\r\\n * Returns the Position of the parent of given Position.\\r\\n * @param p Position to check\\r\\n * @return the Position of the parent of given Position (or null if p is the root). \\r\\n * @throws IllegalArgumentException if Position isn't valid\\r\\n */\\r\\n Position<E> parent(Position<E> p) throws IllegalArgumentException;\\r\\n \\r\\n /**\\r\\n * Returns the number of children of given Position.\\r\\n * @param p Position to check\\r\\n * @return the number of children of given Position\\r\\n * @throws IllegalArgumentException if Position isn't valid\\r\\n */\\r\\n int numChildren(Position<E> p) throws IllegalArgumentException;\\r\\n\\r\\n /**\\r\\n * Returns the number of positions (and therefore elements) that are contained in tree.\\r\\n * @return the number of positions (and therefore elements) that are contained in tree\\r\\n */\\r\\n int size();\\r\\n \\r\\n \\r\\n //query methods\\r\\n /**\\r\\n * Tests whether given Position has at least one child.\\r\\n * @param p Position to check\\r\\n * @return true if given Position has at least one child, false otherwise\\r\\n * @throws IllegalArgumentException if Position isn't valid \\r\\n */\\r\\n boolean isInternal(Position<E> p) throws IllegalArgumentException;\\r\\n \\r\\n /**\\r\\n * Tests whether given Position has any children.\\r\\n * @param p Position to check\\r\\n * @return true if given Position does not have children, false otherwise\\r\\n * @throws IllegalArgumentException if Position isn't valid \\r\\n */\\r\\n boolean isExternal(Position<E> p) throws IllegalArgumentException;\\r\\n \\r\\n /**\\r\\n * Tests whether given Position is the root of the tree.\\r\\n * @param p Position to check\\r\\n * @return true if given Position is the root, false otherwise\\r\\n * @throws IllegalArgumentException if Position isn't valid \\r\\n */\\r\\n boolean isRoot(Position<E> p) throws IllegalArgumentException;\\r\\n \\r\\n /**\\r\\n * Tests whether tree contains any Positions (and therefore elements).\\r\\n * @return true if tree doesn't contain any Positions, false otherwise\\r\\n */\\r\\n boolean isEmpty();\\r\\n \\r\\n \\r\\n \\r\\n //additional methods\\r\\n /**\\r\\n * Returns an iterable Collection containing the children of given Position.\\r\\n * @param p Position to check\\r\\n * @return an iterable Collection containing the children of given Position\\r\\n * @throws IllegalArgumentException if Position isn't valid\\r\\n */\\r\\n Iterable<Position<E>> children(Position<E> p) throws IllegalArgumentException;\\r\\n \\r\\n /**\\r\\n * Returns an iterable Collection of all Positions of the tree.\\r\\n * @return an iterable Collection of all Positions of the tree.\\r\\n */\\r\\n Iterable<Position<E>> positions(); \\r\\n \\r\\n /**\\r\\n * Returns an iterator for all elements in the tree.\\r\\n * Ensures tree itself is iterable.\\r\\n * @return an iterator for all elements in the tree\\r\\n */\\r\\n @Override\\r\\n Iterator<E> iterator(); \\r\\n}\",\n \"public interface TreeModel {\\n\\n double checkAccuracy(DataSource d);\\n void crossValidate(DataSource testdata);\\n void pessimisticPrune(double z);\\n void printTree();\\n\\n}\",\n \"public interface ITreeObject {\\r\\n\\r\\n\\tpublic static final Object[] EMPTY_OBJECT_ARRAY = new Object[0]; \\r\\n\\t/**\\r\\n\\t * Returns immediate parent of this item\\r\\n\\t * @return immediate parent item or null if this item has no parent or parent is unknown \\r\\n\\t */\\r\\n\\tObject getParent();\\r\\n\\r\\n\\t/**\\r\\n\\t * Tells if item has children \\r\\n\\t * @return true if this item has children \\r\\n\\t */\\r\\n\\tboolean hasChildren();\\r\\n\\t\\r\\n\\t/**\\r\\n\\t * Returns number of children \\r\\n\\t * @return child count \\r\\n\\t */\\r\\n\\tint getChildCount();\\r\\n\\t\\r\\n\\t/**\\r\\n\\t * Returns array of child items as generic Objects\\r\\n\\t * @return array of child items or empty array if item has no children \\r\\n\\t */\\r\\n\\tObject[] getChildArray();\\r\\n}\",\n \"public interface INode {\\n INode[] children();\\n INode getParent();\\n void setParent(INode parent);\\n INode copySubTree();\\n INode copyWholeTree();\\n String getNodeChar();\\n void setChildren(INode[] newKids);\\n void setNodeChar(String c);\\n INode getRoot();\\n boolean isRoot();\\n Bit getBit();\\n void setBit(Bit bit);\\n void tellChildAboutParent();\\n INode addBrackets();\\n INode removeBrackets();\\n String toPlainText();\\n}\",\n \"TreeNode getTreeNode();\",\n \"public JTree getTree(){\\n return tree;\\n }\",\n \"public interface TreeNode {\\n Collection<TreeNode> getChildren();\\n boolean isDirectory();\\n}\",\n \"public EntryTree tree() {\\n return tree;\\n }\",\n \"public interface Node {\\n\\n\\tLong getClsId();\\n\\n\\tNode getParent();\\n\\n\\tvoid setParent(Node p);\\n\\n\\tNode[] getChildrenArray();\\n\\n\\tList<Node> getChildrenList();\\n\\n\\tvoid resetChildren(Node[] children);\\n\\n\\tObject getValue(int attr);\\n\\n\\tObject setValue(int attr, Object value);\\n\\n\\tlong getLongValue(int attr);\\n\\n\\tInteger getId();\\n}\",\n \"public Tree(){\\n root = null;\\n }\",\n \"Collection<Tree<V, E>> getTrees();\",\n \"public void setTree(Tree tree) {\\n this.tree = tree;\\n }\",\n \"public interface BinaryTree<T> {\\t\\r\\n\\t/**\\r\\n\\t * Binary tree Node interface.\\r\\n\\t * @param <T> Node contents\\r\\n\\t */\\r\\n\\tpublic interface BinaryNode<T> { }\\r\\n\\t\\r\\n\\t/**\\r\\n\\t * Searches through the tree for a specified value, returning the Node\\r\\n\\t * containing the value.\\r\\n\\t * @param v The value to search for\\r\\n\\t * @return The Node containing the value\\r\\n\\t */\\r\\n\\tpublic BinaryNode<T> find(T v);\\r\\n\\t\\r\\n\\t/**\\r\\n\\t * Checks whether the tree is empty (i.e., its root is null).\\r\\n\\t * @return {@code true} if the tree is empty, {@code false} otherwise\\r\\n\\t */\\r\\n\\tpublic boolean isEmpty();\\r\\n}\",\n \"public HIRTree(){\\r\\n\\t\\t\\r\\n\\t}\",\n \"public interface TreeNode {\\r\\n\\r\\n /**\\r\\n * Function to return Code of this node.\\r\\n *\\r\\n * @return Character that is the code that the node represents.\\r\\n */\\r\\n Character getCode();\\r\\n\\r\\n /**\\r\\n * Method to add a child to a Tree node. The method returns reference to the node that was just\\r\\n * added or the node with the entered code if it was already present.\\r\\n *\\r\\n * @param node a treenode with the code to be added to the intermediate node\\r\\n * @return an already existing tree node with given code or create a new tree node and return it.\\r\\n */\\r\\n TreeNode addChild(TreeNode node);\\r\\n\\r\\n /**\\r\\n * Given a node with a character code, return the node in the tree with the same code.\\r\\n *\\r\\n * @param node the node with character to be checked for in the tree.\\r\\n * @return the node with code equal to the code of the parameter passed.\\r\\n */\\r\\n TreeNode returnNode(TreeNode node);\\r\\n\\r\\n /**\\r\\n * Given a size, check if all nodes in the tree have number of children equal to the size passed.\\r\\n *\\r\\n * @param size the value to be checked against.\\r\\n * @return true or false according to if the check passes or fails.\\r\\n */\\r\\n boolean isCodeComplete(int size);\\r\\n}\",\n \"public interface TreeElementI extends Serializable\\n{\\n public void addChild(TreeElementI child);\\n public String getId();\\n public void setId(String id);\\n public String getOutlineTitle();\\n public void setOutlineTitle(String outlineTitle);\\n public boolean isHasParent();\\n public void setHasParent(boolean hasParent);\\n public boolean isHasChild();\\n public void setHasChild(boolean hasChild);\\n public int getLevel();\\n public void setLevel(int level);\\n public boolean isExpanded();\\n public void setExpanded(boolean expanded);\\n public ArrayList<TreeElementI> getChildList();\\n public TreeElementI getParent();\\n public void setParent(TreeElementI parent);\\n\\n}\",\n \"public interface AST {\\n \\n /**\\n * Returns the label or tag for this AST node.\\n */\\n public int getNodeLabel ();\\n \\n /**\\n * Returns the textual value of this AST node.\\n */\\n public String getNodeValue ();\\n \\n /**\\n * Returns a list of child nodes, or null if there are no child nodes. The value returned is a shallow copy\\n * which can be manipulated by the caller.\\n */\\n public List<AST> getChildNodes ();\\n \\n /**\\n * Returns the position of the node in the original source(s).\\n */\\n public CodePosition getCodePosition ();\\n \\n}\",\n \"@FunctionalInterface\\npublic interface TreeGenerator {\\n /**\\n * Constructs a new tree data structure.\\n *\\n * @param type\\n * the required return type of the tree\\n * @param depth\\n * the maximum depth of any nodes of the tree\\n * @return the newly created tree data structure\\n */\\n Node generate(Type type, int depth);\\n}\",\n \"public Tree(E value) {\\n this.root = new Node<E>(value);\\n this.length = 0;\\n }\",\n \"public String getTreeType();\",\n \"public interface ITreeMaker {\\n /**\\n * Return the Huffman/coding tree.\\n * @return the Huffman tree\\n */\\n public HuffTree makeHuffTree(InputStream stream) throws IOException;\\n}\",\n \"public Tree() {\\n // constructor. no nodes in tree yet\\n root = null;\\n }\",\n \"public FamilyTree(){\\r\\n super();\\r\\n }\",\n \"public interface RootNode {\\r\\n}\",\n \"TreeStorage getTreeStorage();\",\n \"public interface BinaryTreeADT<T> extends Iterable<T>\\n{\\n//Returns the element stored in the root of the tree.\\npublic T getRootElement();\\n\\n//Returns the left subtree of the root.\\npublic BinaryTreeADT<T> getLeft();\\n\\n//Returns the right subtree of the root.\\npublic BinaryTreeADT<T> getRight();\\n\\n//Returns true if the binary tree contains an element that\\n//matches the specified element and false otherwise.\\npublic boolean contains (T target);\\n\\n//Returns a reference to the element in the tree matching\\n//the specified target.\\npublic T find (T target);\\n\\n//Returns true if the binary tree contains no elements, and\\n//false otherwise.\\npublic boolean isEmpty();\\n\\n//Returns the number of elements in this binary tree.\\npublic int size();\\n\\n//Returns the string representation of the binary tree.\\npublic String toString();\\n\\n\\n}\",\n \"public Tree(PApplet t, PImage tree) {\\n\\t\\tthis.t = t;\\n\\t\\tthis.tree = tree;\\n\\t}\",\n \"public RBTree() {\\n\\t\\troot = null;\\n\\t\\tdrawer = new RBTreeDrawer();\\n\\t}\",\n \"public interface TreeBuilder {\\r\\n\\r\\n\\t/**\\r\\n\\t * Creates the relationship for the give persons in the provided family with given relationshiptype.\\r\\n\\t * @param rt\\r\\n\\t * @param parentId\\r\\n\\t * @param childId\\r\\n\\t * @param familyId\\r\\n\\t * @return - Relationship created with the given type in the given family for the given persons\\r\\n\\t * @throws Exception\\r\\n\\t */\\r\\n\\tpublic Relationship createRelationship(RelationshipType rt, String parentId, String childId, String familyId) throws Exception;\\r\\n\\t/**\\r\\n\\t * Creates a family with given name.\\r\\n\\t * @param name\\r\\n\\t * @return - Family ID of the created family\\r\\n\\t */\\r\\n\\tpublic String createFamily(String name);\\r\\n\\t/**\\r\\n\\t * Provides any one person from the given family.\\r\\n\\t * @param familyId\\r\\n\\t * @return - Person ID from the given family\\r\\n\\t */\\r\\n\\tpublic String getFamilyPerson(String familyId);\\r\\n\\t/**\\r\\n\\t * Provides the Person Id of the root member of this family.\\r\\n\\t * @param familyId\\r\\n\\t * @return - Person ID of the root member in the family.\\r\\n\\t */\\r\\n\\tpublic String getFamilyRoot(String familyId);\\r\\n\\t/**\\r\\n\\t * Checks if the family exists with given ID.\\r\\n\\t * @param familyId\\r\\n\\t * @return boolean\\r\\n\\t */\\r\\n\\tpublic boolean isFamily(String familyId);\\r\\n}\",\n \"public TreeNode getTreeNode() {\\n return treeNode;\\n }\",\n \"public List<Tree> getTrees() {\\n return trees;\\n }\",\n \"@Override\\r\\n\\tpublic JTree getJTree() {\\r\\n\\t\\tif (jTree == null) {\\r\\n\\t\\t\\tjTree = new JLagerTree();\\r\\n\\t\\t\\tjTree.getSelectionModel().setSelectionMode(TreeSelectionModel.SINGLE_TREE_SELECTION );\\r\\n\\t\\t\\tGenericNode root = new GenericNode(null);\\r\\n\\t\\t\\tjTree.setModel(getTreeModel(root));\\r\\n\\t\\t\\tjTree.setComponentOrientation(ComponentOrientation.LEFT_TO_RIGHT);\\r\\n//\\t\\t\\tjTree.addTreeSelectionListener(new javax.swing.event.TreeSelectionListener() {\\r\\n//\\t\\t\\t\\tpublic void valueChanged(javax.swing.event.TreeSelectionEvent e) {\\r\\n//\\t\\t\\t\\t\\ttreeValueChanged(e,BaugruppeTreePaneView.this.getJTree());\\r\\n////\\t\\t\\t\\t\\tSystem.out.println(\\\"valueChanged()\\\"); // TODO Auto-generated Event stub valueChanged()\\r\\n//\\t\\t\\t\\t}\\r\\n//\\t\\t\\t});\\r\\n//\\t\\t\\tjTree.addTreeSelectionListener(getTreeSelectionListner());\\r\\n\\t\\t\\t//Aussehen von JTree\\r\\n\\t\\t\\tjTree.setCellRenderer(new AnfoderungTreeRenderer());\\r\\n\\t\\t\\tjTree.setToolTipText(\\\"\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\treturn jTree;\\r\\n\\t}\",\n \"public RBTree() {\\r\\n\\t\\t// well its supposed just create a new Red Black Tree\\r\\n\\t\\t// Maybe create a new one that does a array of Objects\\r\\n\\t}\",\n \"public String treeType();\",\n \"public interface AVLTree<E extends Comparable<E>> extends BinarySortedTree<E>{\\n\\n boolean isAVLTree(AVLNode<E> current);\\n\\n interface AVLNode<E>{\\n E getData();\\n\\n AVLNode setData(E data);\\n\\n AVLNode<E> getParent();\\n\\n AVLNode setParent(AVLNode<E> parent);\\n\\n AVLNode<E> getLeft();\\n AVLNode setLeft(AVLNode<E> left);\\n\\n AVLNode<E> getRight();\\n\\n AVLNode setRight(AVLNode<E> right);\\n\\n int getHeight();\\n\\n AVLNode setHeight(int height);\\n }\\n}\",\n \"public interface TreeIterable<T> extends Iterable<T>{\\n TreeIterator<T> iterator();\\n}\",\n \"public interface TreeProcessor<N extends TreeNode<N>> {\\n\\n /**\\n * Will start the processing at the originating node\\n * @param origin the node from which the processing will originate\\n * @param processor the processor to run on each node\\n */\\n void process(N origin, TreeNodeProcessor<N> processor);\\n\\n}\",\n \"public TreeImpl(T dato) {\\r\\n\\t\\traiz = new NodeImpl<T>(dato, null);// El null dice que es raiz\\r\\n\\t}\",\n \"public HtmlTree()\\n {\\n // do nothing\\n }\",\n \"public JdbTree(TreeModel treeModel) {\\r\\n super(treeModel);\\r\\n commonInit();\\r\\n }\",\n \"public void setTree(MyTree t) {\\r\\n\\t\\ttree = t;\\r\\n\\t}\",\n \"public static interface Node {\\n int getValue();\\n List<Node> getChildren();\\n }\",\n \"public TreeTest(String name) {\\r\\n super(name);\\r\\n }\",\n \"public interface Node extends Serializable {\\n\\n\\tvoid setOwner(Object owner);\\n Object getOwner();\\n\\n String getName();\\n Node getChild(int i);\\n List<Node> childList();\\n\\n Node attach(int id, Node n) throws VetoTypeInduction;\\n void induceOutputType(Class type) throws VetoTypeInduction;\\n int getInputCount();\\n\\tClass getInputType(int id);\\n List<Class> getInputTypes();\\n Class getOutputType();\\n Tuple.Two<Class,List<Class>> getType();\\n\\n Object evaluate();\\n\\n boolean isTerminal();\\n\\n <T extends Node> T copy();\\n String debugString(Set<Node> set);\\n}\",\n \"public Symbol_Tree (Environ environ) {\\r\\n \\r\\n this.environ = environ;\\r\\n \\r\\n arraySpinners = new Vector (10);\\r\\n Tree = new MyJTree(environ);\\r\\n Tree.setToggleClickCount(1);\\r\\n\\r\\n treeRoot = new DefaultMutableTreeNode (new TreeNodeInfo(environ, TreeNodeInfo.C_TYPE_UNKNOWN));\\r\\n }\",\n \"public Object clone()\\n\\t{\\n\\t\\treturn new Tree();\\n\\t}\",\n \"protected abstract Class<? extends TreeStructure> getTreeType();\",\n \"public DefaultMutableTreeNode gettree()\\n\\t{\\n\\t\\treturn root;\\n\\t}\",\n \"public IntTree() {\\n overallRoot = null;\\n }\",\n \"public interface Node {\\n public int arityOfOperation();\\n public String getText(int depth) throws CalculationException;\\n public double getResult() throws CalculationException;\\n public boolean isReachable(int depth);\\n public List<Node> getAdjacentNodes();\\n public String getTitle();\\n public void setDepth(int depth);\\n}\",\n \"public SearchTreeInterface<Food> getPriceTree() {\\r\\n return priceTree;\\r\\n }\",\n \"public MorseCodeTree()\\r\\n\\t{\\r\\n\\t\\tbuildTree();\\r\\n\\t}\",\n \"public interface SelectionTreeNode extends TreeNode {\\n public static enum State {\\n NONE_SELECTED, SOME_SELECTED, ALL_SELECTED\\n }\\n\\n /**\\n * Returns this node's current state.\\n *\\n * @return this node's current state.\\n */\\n public State getState();\\n\\n /**\\n * Updates this node's current state.\\n *\\n * @param state new state for this node.\\n */\\n public void setState(final State state);\\n\\n /**\\n * Instructs the node to update its state. The node will then scan its children to determine whether all, some or\\n * none of them are selected. If the node does not have children, the value provided by the last call of setState\\n * will be retained.\\n */\\n public void updateState();\\n\\n /**\\n * Adds a selection listener to the node, which will be notified when the node's state changes.\\n *\\n * @param listener listener to add.\\n * @see net.sarcommand.swingextensions.selectiontree.SelectionTreeListener\\n */\\n public void addSelectionTreeListener(final SelectionTreeListener listener);\\n\\n /**\\n * Removes a selection listener from the node.\\n *\\n * @param listener listener to remove.\\n * @see net.sarcommand.swingextensions.selectiontree.SelectionTreeListener\\n */\\n public void removeSelectionTreeListener(final SelectionTreeListener listener);\\n}\",\n \"public Tree() // constructor\\n\\t{ root = null; }\",\n \"public interface Node extends TreeComponent {\\n /**\\n * The types of decision tree nodes available.\\n */\\n enum NodeType {\\n Internal,\\n Leaf\\n }\\n\\n /**\\n * Gets the type of this node.\\n * @return The type of node.\\n */\\n NodeType getType();\\n\\n void print();\\n\\n String getClassLabel(DataTuple tuple);\\n}\",\n \"public interface BinaryTreeADT <T extends Comparable<T>> {\\n \\n public boolean isEmpty();\\n public int size();\\n public boolean contains();\\n public NodoBT<T> find(T elemento);\\n public Iterator<T> imorden();\\n public Iterator<T> preorden();\\n public Iterator<T> postorden();\\n \\n \\n \\n}\",\n \"public GenealogyTree(T root) {\\r\\n tree = (T[]) new Object[SIZE];\\r\\n tree[0] = root;\\r\\n }\",\n \"public TreeModel getTreeModel() {\\r\\n return ModelBuilder.getSingleton().buildTreeModelAsync(this);\\r\\n }\",\n \"@Override\\n public void accept(TreeVisitor visitor) {\\n }\",\n \"public TreeNode() {\\n }\",\n \"public TreeRootNode() {\\n super(\\\"root\\\");\\n }\",\n \"public TreeTag()\\n {\\n setNoField(true);\\n setRootVisible(true);\\n icons = new HashMap<String, Object>();\\n }\",\n \"public interface TreeChangeHandler extends EventHandler {\\r\\n\\t\\r\\n\\t/**\\r\\n\\t * Handles the tree change event.\\r\\n\\t * @param event the tree change event.\\r\\n\\t */\\r\\n\\tvoid onTreeChange(TreeChangeEvent event);\\r\\n\\t\\r\\n}\",\n \"public int getTreeIndex() {\\n\\t\\treturn tree;\\n\\t}\",\n \"public myBinaryTree<T> my_left_tree() throws myException;\",\n \"public JdbTree() {\\r\\n this(new Object [] {});\\r\\n }\",\n \"public BinaryTree(){}\",\n \"protected PublicTreeIterator(Tree<T> tree) {\\n\\t\\t\\tsuper();\\n\\t\\t\\tthis.tree = tree;\\n\\t\\t\\tcursor = null;\\n\\t\\t}\",\n \"public TreeNode() {\\n // do nothing\\n }\",\n \"public interface BinarySearchTree<T extends Comparable<T>> {\\r\\n //Add the new element to the tree where it belongs.\\r\\n public void insert(T element);\\r\\n\\r\\n //Search the tree for a given element.\\r\\n public boolean search(T element);\\r\\n\\r\\n //Get the total height of the tree starting at the root.\\r\\n public int getHeight();\\r\\n\\r\\n //Get how many steps the search count took. Also reset the current search count.\\r\\n public int getSearchSteps();\\r\\n\\r\\n //Get how many single rotations have occurred in the tree.\\r\\n public int getRotations();\\r\\n\\r\\n //Return a human-readable name for the tree.\\r\\n public String getTreeType();\\r\\n}\",\n \"public interface LinkTree<E> extends BinaryTree<E> {\\n /** Adds a root node to an empty tree */\\n public Position<E> addRoot(E e) throws NonEmptyTreeException;\\n /** Inserts a left child at a given node. */\\n public Position<E> insertLeft(Position<E> v, E e) throws InvalidPositionException;\\n /** Inserts a right child at a given node. */\\n public Position<E> insertRight(Position<E> v, E e) throws InvalidPositionException;\\n /** Removes a node with zero or one child. */\\n public E remove(Position<E> v) throws InvalidPositionException;\\n /** Attaches two trees to be subtrees of an external node. */\\n public void attach(Position<E> v, BinaryTree<E> T1, BinaryTree<E> T2) throws InvalidPositionException;\\n}\",\n \"public KdTree() \\n\\t {\\n\\t\\t \\n\\t }\",\n \"public JdbTree(TreeNode root) {\\r\\n this(root, false);\\r\\n }\",\n \"public DefaultTreeModel(final TreeNode root) {\\n super(root);\\n }\",\n \"public TwoFourTree()\\r\\n\\t{\\r\\n\\t\\troot = new TreeNode(); //assign the root to a new tree node\\r\\n\\t}\",\n \"public interface MasterTree extends MasterComponent {\\n}\",\n \"public KdTree() {\\n }\",\n \"@Override\\n\\tpublic void accept(TreeVisitor visitor) {\\n\\n\\t}\",\n \"public DefaultTreeCellEditor(JTree tree,\\n\\t\\t\\t\\t DefaultTreeCellRenderer renderer) {\\n\\tthis(tree, renderer, null);\\n }\",\n \"public interface Visitor {\\n\\tpublic void visit(WordTreeI wt);\\n}\",\n \"public FVTreeManager() {\\n mgrModels =\\n new EnumMap<TreeTypeEnum, TreeManagementModel>(\\n TreeTypeEnum.class);\\n for (TreeTypeEnum type : TreeTypeEnum.values()) {\\n mgrModels.put(type, new TreeManagementModel());\\n }\\n\\n searchBuilder = new SearchTreeBuilder();\\n }\",\n \"public Hierarchy() {\\n treeModel = new DefaultTreeModel(topNode);\\n treeModel.addTreeModelListener(new MyTreeModelListener());\\n initComponents ();\\n }\",\n \"public abstract boolean isBinarySearchTree();\",\n \"public KdTree() \\r\\n\\t{\\r\\n\\t}\",\n \"public void createTree() {\\n\\t\\taddNodeToParent(nodeMap);\\n\\t}\",\n \"public AVLTree() {\\n\\t\\tthis.root = null;\\n\\t}\",\n \"protected TreeNode<T> createTreeNode(T value) {\\n return new TreeNode<T>(this, value);\\n }\",\n \"public abstract Type treeCopy();\",\n \"public BinaryTree() {\\n\\t}\",\n \"public interface IContainerTreeNode extends IMutableTypeContainer, MutableTreeNode {\\r\\n}\",\n \"RootNode getRootNode();\",\n \"public RBTree() {\\r\\n\\t\\troot = null;\\r\\n\\t}\",\n \"public TreeNodeImpl(N value) {\\n this.value = value;\\n }\",\n \"void makeTree()\\n \\t{\\n \\t\\t\\t \\n \\t\\tobj.insert(5,\\\"spandu\\\");\\n \\tobj.insert(4,\\\"anshu\\\");\\n \\tobj.insert(3,\\\"anu\\\");\\n \\tobj.insert(6,\\\"himani\\\");\\n \\t\\t\\n \\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7726013","0.7395538","0.7384544","0.71659404","0.7146552","0.71192265","0.6947367","0.68130565","0.6779357","0.6719812","0.66755986","0.66392714","0.65505713","0.6534005","0.6513212","0.64961827","0.64960265","0.6462345","0.6455866","0.64484715","0.6399143","0.6374908","0.6349086","0.6326758","0.63265723","0.6303317","0.6300646","0.6270198","0.6269874","0.62629205","0.62287205","0.62236017","0.6223072","0.62169933","0.6207294","0.6206052","0.6201817","0.61802584","0.61785096","0.61784834","0.61304504","0.6129169","0.6103842","0.60866314","0.6066082","0.6065779","0.60640585","0.60588354","0.6045982","0.60454917","0.6040454","0.6035577","0.599167","0.59737444","0.59703416","0.59676987","0.5965862","0.59564507","0.59498155","0.593283","0.5922355","0.5917719","0.5906966","0.5903242","0.5903224","0.59022945","0.589999","0.5895233","0.5891512","0.5886421","0.58843476","0.5881524","0.58758974","0.58609957","0.5850723","0.58485603","0.58394635","0.5831195","0.5827251","0.58177346","0.581057","0.58065367","0.58045083","0.57907254","0.5789027","0.57850087","0.5776311","0.57752657","0.57742584","0.5765653","0.5757352","0.5748291","0.5747011","0.5744434","0.5737636","0.5729342","0.5727644","0.5723192","0.57189065","0.571436"],"string":"[\n \"0.7726013\",\n \"0.7395538\",\n \"0.7384544\",\n \"0.71659404\",\n \"0.7146552\",\n \"0.71192265\",\n \"0.6947367\",\n \"0.68130565\",\n \"0.6779357\",\n \"0.6719812\",\n \"0.66755986\",\n \"0.66392714\",\n \"0.65505713\",\n \"0.6534005\",\n \"0.6513212\",\n \"0.64961827\",\n \"0.64960265\",\n \"0.6462345\",\n \"0.6455866\",\n \"0.64484715\",\n \"0.6399143\",\n \"0.6374908\",\n \"0.6349086\",\n \"0.6326758\",\n \"0.63265723\",\n \"0.6303317\",\n \"0.6300646\",\n \"0.6270198\",\n \"0.6269874\",\n \"0.62629205\",\n \"0.62287205\",\n \"0.62236017\",\n \"0.6223072\",\n \"0.62169933\",\n \"0.6207294\",\n \"0.6206052\",\n \"0.6201817\",\n \"0.61802584\",\n \"0.61785096\",\n \"0.61784834\",\n \"0.61304504\",\n \"0.6129169\",\n \"0.6103842\",\n \"0.60866314\",\n \"0.6066082\",\n \"0.6065779\",\n \"0.60640585\",\n \"0.60588354\",\n \"0.6045982\",\n \"0.60454917\",\n \"0.6040454\",\n \"0.6035577\",\n \"0.599167\",\n \"0.59737444\",\n \"0.59703416\",\n \"0.59676987\",\n \"0.5965862\",\n \"0.59564507\",\n \"0.59498155\",\n \"0.593283\",\n \"0.5922355\",\n \"0.5917719\",\n \"0.5906966\",\n \"0.5903242\",\n \"0.5903224\",\n \"0.59022945\",\n \"0.589999\",\n \"0.5895233\",\n \"0.5891512\",\n \"0.5886421\",\n \"0.58843476\",\n \"0.5881524\",\n \"0.58758974\",\n \"0.58609957\",\n \"0.5850723\",\n \"0.58485603\",\n \"0.58394635\",\n \"0.5831195\",\n \"0.5827251\",\n \"0.58177346\",\n \"0.581057\",\n \"0.58065367\",\n \"0.58045083\",\n \"0.57907254\",\n \"0.5789027\",\n \"0.57850087\",\n \"0.5776311\",\n \"0.57752657\",\n \"0.57742584\",\n \"0.5765653\",\n \"0.5757352\",\n \"0.5748291\",\n \"0.5747011\",\n \"0.5744434\",\n \"0.5737636\",\n \"0.5729342\",\n \"0.5727644\",\n \"0.5723192\",\n \"0.57189065\",\n \"0.571436\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.77069265"},"document_rank":{"kind":"string","value":"1"}}},{"rowIdx":26196,"cells":{"query":{"kind":"string","value":"/ Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution."},"document":{"kind":"string","value":"public static void main(String[] args) {\n TruckTour sol1 = new TruckTour();\n sol1.process();\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 void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\r\n\t\tSolution s = new Solution();\r\n\t}","public static void main(String[] args) throws IOException {\n\t\t//Scanner in = new Scanner(System.in);\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tPrintWriter out = new PrintWriter(System.out);\n\t\tsolve(in, out);\n\t\tout.close();\n\t\tin.close();\t\n\t}","public static void main(String[] args) {\n\t\tInputStream inputStream = System.in;\n OutputStream outputStream = System.out;\n InputReader in = new InputReader(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n\t\tProblemSolver problemSolver = new ProblemSolver();\n\t\tproblemSolver.solveTheProblem(in, out);\t\t\n\t\tout.close();\t\t\n\t}","public void solution() {\n\t\t\n\t}","public static void main(String[] args) {\n\t\tSystem.out.println(solution());\r\n\t}","public static void main(String[] args) {\n\n Solution2.solution();\n }","private Solution() { }","private Solution() { }","private Solution() {\n\n }","public static void main(String []args) throws IOException {\n\tFastScanner in = new FastScanner(System.in);\n\tPrintWriter out = \n\t\tnew PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)), false); \n\tsolve(in, out);\n\tin.close();\n\tout.close();\n }","private Solution() {\n }","public static void main(String[] args) throws IOException{\n BufferedReader f = new BufferedReader(new InputStreamReader(System.in));\r\n\r\n \tint n = Integer.parseInt(f.readLine());\r\n \t\r\n \tint[] a = new int[n];\r\n \tStringTokenizer st = new StringTokenizer(f.readLine());\r\n \tfor(int i = 0; i < n; i++) a[i] = Integer.parseInt(st.nextToken());\r\n \t\r\n \tSystem.out.println(solution(a));\r\n \r\n //out.close();\r\n }","public static void main(String[] args) throws IOException {\n\t\tin = new Scanner(new File(\"square.in\"));\n\t\tout = new PrintWriter(new File(\"square.out\"));\n\t\t\n\t\tinit();\n\t\tsolve();\n\t\t\n\t\tin.close();\n\t\tout.close();\n\t}","public static void main(String[] args) {\n\t\tSystem.out.println(solution(0));\n\n\t}","public static void main(String[] args) {\n\t\tScanner scanner = new Scanner(System.in);\n\t\twhile (scanner.hasNextLine()) {\n\t\t\tString input = scanner.nextLine();\n\t\t\tSystem.out.println(solve(input));\n\t\t\t\n\t\t}\n\t\t\n\t}","public static void main(String[] args) {\n String problem = \"Herman\";\n\n // Assign string type variable to solution string\n String result = solution(problem);\n\n //Print solution result\n System.out.println(result);\n }","public static void main(String[] args) {\r\n\t\tSolver m = new Solver();\r\n\t\t\r\n\r\n\r\n\t\ttry {\r\n\t\t\tm.readData(\"data/Test_case_1.in\");\r\n\t\t} catch (Exception e) {\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t\t\r\n\r\n\t\tint answer = m.solve(\"data/Test_case_1.in\");\r\n\r\n\t\tSystem.out.println(answer);\r\n\t\t\r\n\r\n\r\n\t}","public static void main(String[] args) {\n\t\tSolution s = new Solution();\n\t\ts.solution(2, 4, 2, 1);\n\t}","public static void main(String[] args) \r\n {\r\n // TODO: Read the input from the user and call produceAnswer with an equation\r\n \tScanner in = new Scanner(System.in);\r\n \tString problem = in.nextLine();\r\n \tin.close();\r\n \tSystem.out.printf(\"Result: %s\" , produceAnswer(problem));\r\n }","public static void main(String[] args) {\n\t\t\tSystem.out.println(Solution(5, 83));\n\t\t\t\n\t\t}","public static void main(String[] args) {\n Scanner ob = new Scanner(System.in);\n Solution solution = null;\n int testcases = ob.nextInt();\n ob.nextLine();\n for (int i = 0; i < testcases; i++) {\n String numsLine = ob.nextLine();\n String[] numsLineParts = numsLine.trim().split(\" \");\n int dimensions = Integer.valueOf(numsLineParts[0]);\n int numOperations = Integer.valueOf(numsLineParts[1]);\n solution = new Solution(dimensions);\n for (int j = 0; j < numOperations; j++) {\n String line = ob.nextLine();\n String[] lineParts = line.split(\" \");\n if (lineParts[0].equals(\"UPDATE\")) {\n solution.update(Integer.valueOf(lineParts[1])-1, Integer.valueOf(lineParts[2])-1, Integer.valueOf(lineParts[3])-1, Integer.valueOf(lineParts[4]));\n }\n if (lineParts[0].equals(\"QUERY\")) {\n solution.query(Integer.valueOf(lineParts[1])-1, Integer.valueOf(lineParts[2])-1, Integer.valueOf(lineParts[3])-1, Integer.valueOf(lineParts[4])-1, Integer.valueOf(lineParts[5])-1, Integer.valueOf(lineParts[6])-1);\n }\n }\n }\n }","public static void main(String[] args) {\n\r\n\t\tnew Main().sol();\r\n\t}","public static void main(String[] args) throws IOException {\n\t\tSalesmanTour ss = new SalesmanTour();\n\t\tss.input();\n\t\tSystem.out.println(ss.solve());\n\t}","private Solution() {\n //constructor\n }","public static void main(String[] args) throws IOException {\n\t\tString task = \"palsquare\"; //XXX change this\n\t\tString path = !TESTING ? task + \".in\"\n\t\t\t\t: System.getProperty(\"user.dir\") + File.separator + \"src\" + File.separator + \"test.in\";\n\t\tInputReader in = new InputReader(new FileInputStream(path));\n\t\tPrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(task + \".out\")));\n\t\tsolve(in, out);\n\t\tout.close();\n\t}","private void generateSolution() {\n\t\t// TODO\n\n\t}","public static void main(String[] args) {\r\n\t\t\r\n\t\ttry{\r\n\t\t\tScanner sc= new Scanner(new File(inpPath));\t//new File(inpPath)\r\n\t\t\tPrintWriter out = new PrintWriter(new File(outPath));\r\n\t\t\tint cases = sc.nextInt();\r\n\t\t\tfor(int t=1;t<=cases;t++){\r\n\t\t\t\tsolve(t,sc,out);\r\n\t\t\t}\r\n\t\t\tout.flush();\r\n\t\t\tout.close();\r\n\t\t}catch(Exception ex){ex.printStackTrace();}\r\n\t\t\r\n\t}","public static void main(String[] args)\n\t{\n\t\tScanner in = new Scanner(System.in);\n\t\tStringBuilder answers = new StringBuilder();\n\n\t\tanswers.append(\"PERFECTION OUTPUT\\n\");\n\t\ttry\n\t\t{\n\t\t\tint value;\n\t\t\twhile (true)\n\t\t\t{\n\t\t\t\tvalue = in.nextInt();\n\t\t\t\tif (value == 0) break;\n\n\t\t\t\tanswers.append(solve(value));\n\t\t\t}\n\t\t}\n\t\tcatch (Exception e)\n\t\t{\n\t\t\te.printStackTrace();\n\t\t\tSystem.out.println(e);\n\t\t\tSystem.exit(1);\n\t\t}\n\t\tanswers.append(\"END OF OUTPUT\");\n\n\t\tSystem.out.println(answers);\n\t}","public static void main(String[] args) throws IOException {\n\t\tin = new BufferedReader(new FileReader(\"cowdance.in\"));\n\t\tout = new PrintWriter(new File(\"cowdance.out\"));\n\t\t\n\t\tinit();\n\t\tsolve();\n\t\t\n\t\tin.close();\n\t\tout.close();\n\t}","public static void main(String[] args) throws IOException {\n\n String path = \"D:\\\\GitHub\\\\Competetions\\\\CodeJam\\\\Code\\\\src\\\\B12016\\\\\";\n String input = \"bsmall.in\", output = \"bsmall.out\";\n FileInputStream fip = new FileInputStream(path + input);\n FileOutputStream fop = new FileOutputStream(path + output);\n in = fip;\n out = new PrintWriter(fop);\n B a = new B();\n a.solve();\n out.close();\n }","public static void main(String[] args) {\n\t\tSolution sol = new Solution();\n\t\tsol.test();\n\t}","public static void main (String args []) throws IOException\r\n\t{\n\t\tScanner in = new Scanner(new File(\"moo.in\"));\r\n\t\tPrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(\"moo.out\")));\r\n\t\tint n = in.nextInt();\r\n//\t\tSystem.out.println(solve(n,0));\r\n\t\tout.println(solve(n,0));\r\n\t\tout.flush();\r\n\t}","public static void main(String[] args) {\n System.out.println(Arrays.toString(solution(\"\")));\n System.out.println(Arrays.toString(solution(\"abcdef\")));\n System.out.println(Arrays.toString(solution(\"HelloWorld\")));\n System.out.println(Arrays.toString(solution(\"abcde\")));\n System.out.println(Arrays.toString(solution(\"LovePizza\")));\n\n }","public static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tBufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));\n\t\tint t = Integer.parseInt(br.readLine());\n\t\tint a = 0, b = 0;\n\t\tfor (int i = 0; i < t; i++) {\n\t\t\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\t\ta = Integer.parseInt(st.nextToken());\n\t\t\tb = Integer.parseInt(st.nextToken());\n\t\t\tbw.write(solution(a, b) + \"\\n\");\n\t\t}\n\t\tbw.flush();\n\t\tbw.close();\n\t}","public static void main(String[] args) {\n Last_coding_exercises.task17();\n\n\n }","public static void main(String[] args) {\n\t\tSystem.out.println(Arrays.toString(solution(8, 1)));\r\n\t}","public static void main(String[] args) throws Exception\n\t{\n\t\tBufferedReader br = new BufferedReader(new FileReader(\"input6.txt\"));\n\t\tSystem.setOut(new PrintStream(new File(\"output.txt\")));\n\n\t\tsolve(br);\n\t}","@Test\n public void test() {\n Solution solution = new Solution();\n\n }","@Test\n public void test() {\n Solution solution = new Solution();\n\n }","public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int[] arr = new int[4];\n for (int i = 0; i < 4; i++)\n arr[i] = sc.nextInt();\n \n Q1 q1 = new Q1();\n int[] answer = q1.solution(arr);\n \n for (int i = 0; i < answer.length; i++) {\n System.out.println(answer[i]);\n }\n }","public static void main(String[] args) throws Exception {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\t//BufferedReader br = new BufferedReader(new FileReader(\"input/vol2/Problem127.in\"));\n\t\tString line = \"\";\n\t\t\n\t\twhile(true) {\n\t\t\tLinkedList<String> strings = new LinkedList<String>();\n\t\t\tLinkedList<Card> deck = new LinkedList<Card>();\n\t\t\tline = br.readLine().trim();\n\t\t\tif(line.equals(\"#\"))\n\t\t\t\tbreak;\n\t\t\tCollections.addAll(strings, line.split(\" \"));\n\t\t\tline = br.readLine().trim();\n\t\t\tCollections.addAll(strings, line.split(\" \"));\n\t\t\tfor(String str : strings) {\n\t\t\t\tdeck.add(new Card(str));\n\t\t\t}\n\t\t\tTableau solution = new Tableau();\n\t\t\tfor(Card c : deck) {\n\t\t\t\t//System.out.print(\"Adding: \" + c + \" \");\n\t\t\t\tsolution.add(c);\n\t\t\t\t//System.out.println(solution);\n\t\t\t\t//solution.debug();\n\t\t\t}\n\t\t\tSystem.out.println(solution);\n\t\t}\n\t\t//System.out.println(\"Runtime: \" + (System.currentTimeMillis() - startTime) + \"ms\");\n\t}","public void findSolution() {\n\n\t\t// TODO\n\t}","public void Main(){\n }","public static void main(String[] args) {\n\n // create initial board from file\n In in = new In(args[0]);\n int N = in.readInt();\n int[][] tiles = new int[N][N];\n for (int i = 0; i < N; i++)\n for (int j = 0; j < N; j++)\n tiles[i][j] = in.readInt();\n Board initial = new Board(tiles);\n\n // check if puzzle is solvable; if so, solve it and output solution\n if (initial.isSolvable()) {\n Solver solver = new Solver(initial);\n StdOut.println(\"Minimum number of moves = \" + solver.moves());\n for (Board board : solver.solution())\n StdOut.println(board);\n }\n\n // if not, report unsolvable\n else {\n StdOut.println(\"Unsolvable puzzle\");\n }\n}","public static void main(String[] args) throws IOException {\n\t\t// TODO Auto-generated method stub\n\t\tNumberGame ng = new NumberGame();\n\t\tng.solve();\n\t\t//ng.test();\n\t}","public static void main(String[] args) {\n\r\n\t\t\r\n\t\tTest01 t = new Test01();\r\n\t\t\r\n\t\t//String st = \"1927\";\r\n\t\t//int in\t= 2;\t// n 개 제거\r\n\r\n\t\tString st = \"1231234\";\r\n\t\tint in\t= 3;\t\r\n\t\t\r\n\t\tString an = t.solution(st, in);\r\n\t\t\r\n\t\tSystem.out.println(an);\r\n\t}","private void testSolution(String input, String output) {\n runs++;\n\n // Load the problem & solution\n ProblemSpec problemSpec = Solution.loadProblem(input);\n Solution solution = new Solution(problemSpec);\n\n // Solve and time the solution\n long startTime = System.currentTimeMillis();\n List<State> states = solution.solve();\n long endTime = System.currentTimeMillis();\n durations.put(input, endTime - startTime);\n\n // Output the solution\n Solution.writeSolution(Formatter.format(states), output);\n\n problemSpec = Solution.loadProblem(input, output);\n if (solutionPasses(problemSpec)) {\n passes++;\n }\n\n successes++;\n }","public static void main(String[] args) throws IOException {\n// new Homework01();\n new Homework02();\n }","void run() throws IOException {\n\r\n\t\treader = new BufferedReader(new FileReader(\"input.txt\"));\r\n\r\n\t\tout = new PrintWriter(new FileWriter(\"output.txt\"));\r\n\t\ttokenizer = null;\r\n\t\tsolve();\r\n\t\treader.close();\r\n\t\tout.flush();\r\n\r\n\t}","public static void main(String[] args) {\n InputData inputData = new InputData();\n FindNumberOfSteps findNumberOfSteps = new FindNumberOfSteps();\n PrintResult printResult = new PrintResult();\n printResult.print(findNumberOfSteps.find(inputData.input()));\n }","public static void main(String[] args) throws IOException {\n\r\n \r\n \r\n }","public static void main(String[] args) throws IOException {\n\t\t\t\r\n\t\t\tint [] numReps= {3,1,2,2,2};\r\n\t\t\tMathModelClass.solveMe(85, 5, 2,numReps, 1);\r\n\t\r\n\t\t}","public static void main(String[] args) {\n\t\tString filename = \"src/y20161B/B-small-practice\";\n\t\t//String filename = \"src/y20161B/B-large-practice\";\n\n\t\tFileInputStream file;\n\t\tint T;\n\n\t\ttry {\n\t\t\tfile = new FileInputStream(filename+\".in\");\n\n\t\t\tBufferedReader in = new BufferedReader(new InputStreamReader(file));\n\n\t\t\tT = Integer.parseInt(in.readLine());\n\n\t\t\tBufferedWriter bw = new BufferedWriter(new FileWriter(filename+\".out\"));\n\n\t\t\tfor (int i=0; i<T; i++) {\n\t\t\t\tint ind = i+1;\n\t\t\t\t// parser\n\t\t\t\tString buff[] = in.readLine().split(\" \");\n\t\t\t\tString C = buff[0];\n\t\t\t\tString J = buff[1];\n\t\t\t\t\n\t\t\t\t// calcul\n\t\t\t\tString res = solve(C, J);\n\t\t\t\t\n\t\t\t\tSystem.out.println(\"Result \"+i+\": \"+res);\n\t\t\t\tbw.write(\"Case #\"+ind+\": \"+res+\"\\n\");\n\t\t\t}\n\t\t\tbw.close();\n\n\t\t\tin.close();\n\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}","public static void main(String[] args) {\n\t\tint [] arr = {4,2,3,5};\r\n\t\tint [] answer = solution(arr);\r\n\t\tfor(int i=0;i<answer.length;i++)\r\n\t\t\tSystem.out.print(answer[i]+\" \");\r\n\t}","public static void main(String[] args) throws FileNotFoundException, IOException{\n InputStream inputStream = new FileInputStream(new File(\"./src/B-large.in\"));\n OutputStream outputStream = new FileOutputStream(new File(\"./src/B-large.out\"));\n InputReaderRevengePancakes in = new InputReaderRevengePancakes(inputStream);\n PrintWriter out = new PrintWriter(outputStream);\n TaskRevengePancakes solver = new TaskRevengePancakes();\n solver.solve(1, in, out);\n out.close();\n }","public static void main(String[] args) throws IOException {\n br = new BufferedReader(new FileReader(\"input.txt\"));\r\n\r\n int T = nextInt();\r\n for (int t = 1; t <= T; t++) {\r\n nextInt();\r\n int X = nextInt();\r\n String lString = nextToken();\r\n\r\n StringBuilder s = new StringBuilder();\r\n for (; X > 0; X--) s.append(lString);\r\n char[] arr = s.toString().toCharArray();\r\n String soln = solve(arr) ? \"YES\" : \"NO\";\r\n\r\n System.out.printf(\"Case #%d: %s%n\", t, soln);\r\n }\r\n }","public static void main(String[] args) throws Exception\n\t{\n\t\tBufferedReader br = new BufferedReader(new FileReader(\"input6.txt\"));\tSystem.setOut(new PrintStream(new File(\"output.txt\")));\n\t\t\n\t\tint t = Integer.parseInt(br.readLine());\n\t\tfor(int i = 1; i <= t; i++)\n\t\t\tSystem.out.println(\"Case #\"+i+\": \"+solve(br));\n\t}","public static void main(String[] args) {\r\n\t\tint N=1;\r\n\t\tint[][] trust = {};\r\n\t\tSolution sol = new Solution();\r\n\t\tSystem.out.println(sol.findJudge(N, trust));\r\n\t}","public static void main(String[] args) \n\t{\n\t\tinitialize(\"\");\n\t\t\n\t\t//making instance from file name\n\n\t\tString str = \"A-n32-k5.vrp\";\n\t\tString fileName = \"input//\" + str;\n\t\t\n\t\t\n\t\tInstance problem = new VRPInstance(fileName);\n\t\tSystem.out.println(problem.comment);\n\t\t//solve problem\n\n\t\t//Solver solver2 = new SimpleGreedySolver(problem);\n\t\t//Solver solver2 = new NearestNeighborGreedySolver(problem);\n\t\t//Solver solver = new ClarkeWrightGreedySolver(problem);\n\t\t//Solver solver = new EHSBASolver(problem);\n\t\t//solver2.solve();\n\t\t//solver2.printResult();\n\t\t\n\t\t//solver = new ClarkeWrightGreedySolver(problem);\n\t\tSolver solver3 = new EHSBASolver(problem);\n\t\tsolver3.solve();\n\t\tsolver3.printResult();\n\t\t\n\t\tSystem.out.println(\"finished.\");\n\t\t\n\t\t\n\t\t/*File folder = new File(\"input\");\n\t\tFile[] listOfFiles = folder.listFiles();\n\t\t\n\t\tfor(int i = 0; i < listOfFiles.length; i++)\n\t\t{\n\t\t\n\t\t\tString str = listOfFiles[i].getName();\n\t\t\tSystem.out.println(str);\n\t\t\tif(listOfFiles[i].isFile() && str.substring(0, 1).equalsIgnoreCase(\"A\"))\n\t\t\t\tfileName = \"input\\\\\" + str;\n\t\t\telse\n\t\t\t\tcontinue;\n\n\t\t\t//fileName = \"input\\\\\" + fileName;\n\t\t\tInstance problem = new VRPInstance(fileName);\n\t\t\tSystem.out.println(problem.comment);\n\t\t\t//solve problem\n\t\n\t\t\t//Solver solver = new SimpleGreedySolver(problem);\n\t\t\t//Solver solver = new NearestNeighborGreedySolver(problem);\n\t\t\tSolver solver = new ClarkeWrightGreedySolver(problem);\n\t\t\t//Solver solver = new EHSBASolver(problem);\n\t\t\tsolver.solve();\n\t\t\tsolver.printResult();\t\n\n\t\t}*/\n\n\t\t\n\t}","public static void main(String[] args) {\n In in = new In(args[0]);\n int n = in.readInt();\n int[][] blocks = new int[n][n];\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n blocks[i][j] = in.readInt();\n\n Board initial = new Board(blocks);\n\n // solve the puzzle\n Solver solver = new Solver(initial);\n\n // print solution to standard output\n if (!solver.isSolvable())\n StdOut.println(\"No solution possible\");\n else {\n StdOut.println(\"Minimum number of moves = \" + solver.moves());\n for (Board board : solver.solution())\n StdOut.println(board);\n }\n }","public static void main(String[] args) {\n In in = new In(args[0]);\n int n = in.readInt();\n int[][] blocks = new int[n][n];\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n blocks[i][j] = in.readInt();\n Board initial = new Board(blocks);\n\n // solve the puzzle\n Solver solver = new Solver(initial);\n\n // print solution to standard output\n if (!solver.isSolvable())\n StdOut.println(\"No solution possible\");\n else {\n StdOut.println(\"Minimum number of moves = \" + solver.moves());\n for (Board board : solver.solution())\n StdOut.println(board);\n }\n }","public static void main(String[] args) {\n /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */\n Scanner sc = new Scanner(System.in);\n int cases = sc.nextInt();\n for(int i=0;i<cases;i++){\n \tString[] strArray = sc.next().split(\"\");\n\n \tString odd = \"\";\n \tString even = \"\";\n \t\n \tfor(int j=1;j<strArray.length;j++){\n \t\tif(j%2==0){\n\t\t\t\t\teven += strArray[j];\n \t\t}else{\n \t\t\todd += strArray[j];\n \t\t}\n \t\t\n \t}\n \t\n \tSystem.out.println(odd + \" \" + even);\n }\n }","public static void main(String[] args) {\n int[] arr = {10, 2, 5, 1, 8, 12};\n System.out.println(solution(arr));\n }","public void main(){\n }","public static void main(String[] args) {\n\n\t\tsolution();\n\n\t\t// int maxDivisor = Divided.getMaxDivisor(1, 3);\n\t\t// System.out.println(\"maxDivisor：\" + maxDivisor);\n\n\t}","public static void main() {\n \n }","public static void main(String[] args){\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n }","public static void main(String[] args) {\n\r\n\t\tSystem.out.println(solution(\"ACACACA\"));\r\n\t}","public static void main(String[] args) {\n\t\tint A[]={2,1,0,0,0};\r\n\t\tSystem.out.println(solution(A));\r\n\r\n\t}","public static void main(String[] args) {\n\t\tint A[] = new int[5];\n\t\tA[0]=3;\n\t\tA[1]=1;\n\t\tA[2]=2;\n\t\tA[3]=4;\n\t\tA[4]=3;\n\t\tSolution s = new Solution();\n\t\tSystem.out.println(s.solution(A));\n\t}","public static void main(String args[]) {\n\n\t\tFlowers example = new Flowers();\n\t\t\n\t\texample.model();\n\n\t\tif (example.search())\n\t\t\tSystem.out.println(\"Solution(s) found\");\n\t\t\n\t}","public static void main(String[] args) {\n String str = \"The one-hour drama series Westworld is a dark odyssey about the dawn of artificial consciousness and the evolution of sin. Set at the intersection of the near future and the reimagined past, it explores a world in which every human appetite, no matter how noble or depraved, can be indulged.\";\n\n System.out.println(solution1(str));\n }","public static void main(String[] args) {\n\t\tint[] number = new int[] {1, 1, 1, 1, 1};\n\t\tint target = 3;\n\t\t\n\t\tSolution s = new Solution();\n\t\tint result = s.solution(number, target);\n\t\tSystem.out.println(result);\n\t}","@Test\n public void testSolution() {\n assertSolution(\"425\", \"input-day01-2018.txt\");\n }","public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint n = sc.nextInt();\n\t\tArrayList<Integer> arr = new ArrayList<>();\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tarr.add(sc.nextInt());\n\t\t}\n\t\tint k = sc.nextInt();\n\t\tSolution sol = new Solution();\n\t\tSystem.out.println(sol.solve(arr, k));\n\t\tsc.close();\n\t}","public Main() {\n }","public Main() {\n }","public static void main(String[] args) {\n\t\tint arr[] = {9,3,9,3,9,7,9};\n\t\tSolution(arr);\n\t}","public static void main(String[] args) { \n \n //read in filename from user\n String filenameInput = args[0];\n \n //create new maze/graph\n Maze newMaze = new Maze(filenameInput);\n \n //call toString\n //String stringMaze = newMaze.toString();\n \n //print the string maze\n //System.out.println(stringMaze);\n \n //call findPath\n //System.out.println(newMaze.findPath());\n \n for (Vertex v : newMaze.findPath()) System.out.print(v.getName());\n \n //print solution?\n //System.out.println(newMaze.solution);\n \n \n }","public static void main(String[] args) {\n String name = \"ABAAABB\";\n\n System.out.println(solution(name));\n }","public static void main(String[] args) {\n\t\tint[] A = {51,31,43};\n\t\tSystem.out.println(solution(A));\n\n\t}","public static void main (String[] args) {\n Scanner s = new Scanner(System.in);\r\n System.out.print(BinaryReversalMethod(s.nextLine()));\r\n s.close();\r\n }","public static void main(String[] args) // solve a slider puzzle (given below)\n {\n In in = new In(args[0]);\n int N = in.readInt();\n int[][] blocks = new int[N][N];\n for (int i = 0; i < N; i++)\n for (int j = 0; j < N; j++)\n blocks[i][j] = in.readInt();\n Board initial = new Board(blocks);\n\n // solve the puzzle\n Solver solver = new Solver(initial);\n\n // print solution to standard output\n if (!solver.isSolvable())\n StdOut.println(\"No solution possible\");\n else {\n StdOut.println(\"Minimum number of moves = \" + solver.moves());\n for (Board board : solver.solution())\n StdOut.println(board);\n \n \t\n }\n}","public Main() {\n \n \n }","public Main() {\n }","public static void main()\n\t{\n\t}","public static void main(String[] args) throws IOException {\n\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tStringTokenizer st = new StringTokenizer(br.readLine().trim());\n\t\tint tc = Integer.parseInt(st.nextToken());\n\t\tfor (int i = 0; i < tc; i++) {\n\t\t\tst = new StringTokenizer(br.readLine().trim());\n\t\t\tint x = Integer.parseInt(st.nextToken());\n\t\t\tint y = Integer.parseInt(st.nextToken());\n\t\t\tsolve(y - x);\n\t\t}\n\t}","public static void main(String[] args) throws FileNotFoundException {\n Scanner scanner = new Scanner(new FileInputStream(\"/Users/guoziren/IdeaProjects/剑指offer for Java/src/main/java/com/ustc/leetcode/algorithmidea/dynamicprogramming/input.txt\"));\n }","public interface SASolution extends Solution {\r\n\r\n /**\r\n * Generates a neighbor solution using this solution\r\n *\r\n * @return\r\n */\r\n public SASolution getNeighborSolution();\r\n\r\n /**\r\n * Prints this solution\r\n *\r\n * @return\r\n */\r\n public String getAsString();\r\n\r\n}","public static void main(String[] args) throws IOException {\n\r\n }","public Main() {\r\n }","public Main() {\r\n }","public static void main(String[] args) {\n int lineSize = Integer.parseInt(args[0]);\n String[] input = getInput(args);\n\n WordWrap ww = new WordWrap(lineSize, input);\n Long start = System.currentTimeMillis();\n Integer[] lines = ww.solve();\n Long end = System.currentTimeMillis();\n\n System.out.println(\"solved in \"+((end-start)/1000.0) +\" seconds\");\n printResult(lines, input);\n }","public static void main(String[] args) {\n System.out.println(solution(new int[]{3,1,2,4,3}));\n }","public static void main(String[] args) {\n\t\tnew Challenge09();\r\n\t}","public static void main(String[] args){\n Solution solution = new Solution();\n System.out.println(solution.convertToTitle(27));\n }","public static void main(String[] args) {\n In in = new In(args[0]);\n int n = in.readInt();\n int[][] tiles = new int[n][n];\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n tiles[i][j] = in.readInt();\n Board initial = new Board(tiles);\n\n // Solve the puzzle\n Solver solver = new Solver(initial);\n\n // Print solution to standard output\n if (!solver.isSolvable())\n StdOut.println(\" No solution possible \");\n else {\n StdOut.println(\" Minimum number of moves = \" + solver.moves());\n for (Board solutionboard : solver.solution())\n StdOut.println(solutionboard);\n }\n\n }","public static void main(String[] args) {\n\t\tSolution s = new Solution();\n\t\tint[] nums = {4,5,6,7,0,1,2};\n\t\tSystem.out.println(s.search(nums, 0));\n\t}","public Main() {}","public static void main(String[] args) {\n\t\tScanner in = new Scanner(System.in);\n\t\tArrayList<String> problems = new ArrayList<>();\n\t\t\n\t\t\n\t\tint noOfInputs = Integer.parseInt(in.nextLine());\n\t\t\n\t\tfor(int x=0; x<noOfInputs; x++) {\n\t\t\tproblems.add(in.nextLine());\n\t\t}\n\t\tin.close();\n\t\t\n\t\tfor(String p : problems) {\n\t\t\tint no = getFibonacciIndex(p);\n\t\t\t//System.out.print( no + \"\\n\\t\" + p + \"\\n\\t\" + getFib(no) + \"\\n\" );\n\t\t\tSystem.out.print(no + \" \");\n\t\t}\n\t\tSystem.out.println(\"\");\n\n\t}","public static void main(String[] args) {\n\t\tMain m=new Main();\n\t\tSystem.out.println(m.solve(\"abcd\"));\n\t}"],"string":"[\n \"public static void main(String[] args) {\\n\\t\\tScanner sc = new Scanner(System.in);\\r\\n\\t\\tSolution s = new Solution();\\r\\n\\t}\",\n \"public static void main(String[] args) throws IOException {\\n\\t\\t//Scanner in = new Scanner(System.in);\\n\\t\\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\\n\\t\\tPrintWriter out = new PrintWriter(System.out);\\n\\t\\tsolve(in, out);\\n\\t\\tout.close();\\n\\t\\tin.close();\\t\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tInputStream inputStream = System.in;\\n OutputStream outputStream = System.out;\\n InputReader in = new InputReader(inputStream);\\n PrintWriter out = new PrintWriter(outputStream);\\n\\t\\tProblemSolver problemSolver = new ProblemSolver();\\n\\t\\tproblemSolver.solveTheProblem(in, out);\\t\\t\\n\\t\\tout.close();\\t\\t\\n\\t}\",\n \"public void solution() {\\n\\t\\t\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tSystem.out.println(solution());\\r\\n\\t}\",\n \"public static void main(String[] args) {\\n\\n Solution2.solution();\\n }\",\n \"private Solution() { }\",\n \"private Solution() { }\",\n \"private Solution() {\\n\\n }\",\n \"public static void main(String []args) throws IOException {\\n\\tFastScanner in = new FastScanner(System.in);\\n\\tPrintWriter out = \\n\\t\\tnew PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)), false); \\n\\tsolve(in, out);\\n\\tin.close();\\n\\tout.close();\\n }\",\n \"private Solution() {\\n }\",\n \"public static void main(String[] args) throws IOException{\\n BufferedReader f = new BufferedReader(new InputStreamReader(System.in));\\r\\n\\r\\n \\tint n = Integer.parseInt(f.readLine());\\r\\n \\t\\r\\n \\tint[] a = new int[n];\\r\\n \\tStringTokenizer st = new StringTokenizer(f.readLine());\\r\\n \\tfor(int i = 0; i < n; i++) a[i] = Integer.parseInt(st.nextToken());\\r\\n \\t\\r\\n \\tSystem.out.println(solution(a));\\r\\n \\r\\n //out.close();\\r\\n }\",\n \"public static void main(String[] args) throws IOException {\\n\\t\\tin = new Scanner(new File(\\\"square.in\\\"));\\n\\t\\tout = new PrintWriter(new File(\\\"square.out\\\"));\\n\\t\\t\\n\\t\\tinit();\\n\\t\\tsolve();\\n\\t\\t\\n\\t\\tin.close();\\n\\t\\tout.close();\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tSystem.out.println(solution(0));\\n\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tScanner scanner = new Scanner(System.in);\\n\\t\\twhile (scanner.hasNextLine()) {\\n\\t\\t\\tString input = scanner.nextLine();\\n\\t\\t\\tSystem.out.println(solve(input));\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"public static void main(String[] args) {\\n String problem = \\\"Herman\\\";\\n\\n // Assign string type variable to solution string\\n String result = solution(problem);\\n\\n //Print solution result\\n System.out.println(result);\\n }\",\n \"public static void main(String[] args) {\\r\\n\\t\\tSolver m = new Solver();\\r\\n\\t\\t\\r\\n\\r\\n\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tm.readData(\\\"data/Test_case_1.in\\\");\\r\\n\\t\\t} catch (Exception e) {\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\r\\n\\t\\tint answer = m.solve(\\\"data/Test_case_1.in\\\");\\r\\n\\r\\n\\t\\tSystem.out.println(answer);\\r\\n\\t\\t\\r\\n\\r\\n\\r\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tSolution s = new Solution();\\n\\t\\ts.solution(2, 4, 2, 1);\\n\\t}\",\n \"public static void main(String[] args) \\r\\n {\\r\\n // TODO: Read the input from the user and call produceAnswer with an equation\\r\\n \\tScanner in = new Scanner(System.in);\\r\\n \\tString problem = in.nextLine();\\r\\n \\tin.close();\\r\\n \\tSystem.out.printf(\\\"Result: %s\\\" , produceAnswer(problem));\\r\\n }\",\n \"public static void main(String[] args) {\\n\\t\\t\\tSystem.out.println(Solution(5, 83));\\n\\t\\t\\t\\n\\t\\t}\",\n \"public static void main(String[] args) {\\n Scanner ob = new Scanner(System.in);\\n Solution solution = null;\\n int testcases = ob.nextInt();\\n ob.nextLine();\\n for (int i = 0; i < testcases; i++) {\\n String numsLine = ob.nextLine();\\n String[] numsLineParts = numsLine.trim().split(\\\" \\\");\\n int dimensions = Integer.valueOf(numsLineParts[0]);\\n int numOperations = Integer.valueOf(numsLineParts[1]);\\n solution = new Solution(dimensions);\\n for (int j = 0; j < numOperations; j++) {\\n String line = ob.nextLine();\\n String[] lineParts = line.split(\\\" \\\");\\n if (lineParts[0].equals(\\\"UPDATE\\\")) {\\n solution.update(Integer.valueOf(lineParts[1])-1, Integer.valueOf(lineParts[2])-1, Integer.valueOf(lineParts[3])-1, Integer.valueOf(lineParts[4]));\\n }\\n if (lineParts[0].equals(\\\"QUERY\\\")) {\\n solution.query(Integer.valueOf(lineParts[1])-1, Integer.valueOf(lineParts[2])-1, Integer.valueOf(lineParts[3])-1, Integer.valueOf(lineParts[4])-1, Integer.valueOf(lineParts[5])-1, Integer.valueOf(lineParts[6])-1);\\n }\\n }\\n }\\n }\",\n \"public static void main(String[] args) {\\n\\r\\n\\t\\tnew Main().sol();\\r\\n\\t}\",\n \"public static void main(String[] args) throws IOException {\\n\\t\\tSalesmanTour ss = new SalesmanTour();\\n\\t\\tss.input();\\n\\t\\tSystem.out.println(ss.solve());\\n\\t}\",\n \"private Solution() {\\n //constructor\\n }\",\n \"public static void main(String[] args) throws IOException {\\n\\t\\tString task = \\\"palsquare\\\"; //XXX change this\\n\\t\\tString path = !TESTING ? task + \\\".in\\\"\\n\\t\\t\\t\\t: System.getProperty(\\\"user.dir\\\") + File.separator + \\\"src\\\" + File.separator + \\\"test.in\\\";\\n\\t\\tInputReader in = new InputReader(new FileInputStream(path));\\n\\t\\tPrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(task + \\\".out\\\")));\\n\\t\\tsolve(in, out);\\n\\t\\tout.close();\\n\\t}\",\n \"private void generateSolution() {\\n\\t\\t// TODO\\n\\n\\t}\",\n \"public static void main(String[] args) {\\r\\n\\t\\t\\r\\n\\t\\ttry{\\r\\n\\t\\t\\tScanner sc= new Scanner(new File(inpPath));\\t//new File(inpPath)\\r\\n\\t\\t\\tPrintWriter out = new PrintWriter(new File(outPath));\\r\\n\\t\\t\\tint cases = sc.nextInt();\\r\\n\\t\\t\\tfor(int t=1;t<=cases;t++){\\r\\n\\t\\t\\t\\tsolve(t,sc,out);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tout.flush();\\r\\n\\t\\t\\tout.close();\\r\\n\\t\\t}catch(Exception ex){ex.printStackTrace();}\\r\\n\\t\\t\\r\\n\\t}\",\n \"public static void main(String[] args)\\n\\t{\\n\\t\\tScanner in = new Scanner(System.in);\\n\\t\\tStringBuilder answers = new StringBuilder();\\n\\n\\t\\tanswers.append(\\\"PERFECTION OUTPUT\\\\n\\\");\\n\\t\\ttry\\n\\t\\t{\\n\\t\\t\\tint value;\\n\\t\\t\\twhile (true)\\n\\t\\t\\t{\\n\\t\\t\\t\\tvalue = in.nextInt();\\n\\t\\t\\t\\tif (value == 0) break;\\n\\n\\t\\t\\t\\tanswers.append(solve(value));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcatch (Exception e)\\n\\t\\t{\\n\\t\\t\\te.printStackTrace();\\n\\t\\t\\tSystem.out.println(e);\\n\\t\\t\\tSystem.exit(1);\\n\\t\\t}\\n\\t\\tanswers.append(\\\"END OF OUTPUT\\\");\\n\\n\\t\\tSystem.out.println(answers);\\n\\t}\",\n \"public static void main(String[] args) throws IOException {\\n\\t\\tin = new BufferedReader(new FileReader(\\\"cowdance.in\\\"));\\n\\t\\tout = new PrintWriter(new File(\\\"cowdance.out\\\"));\\n\\t\\t\\n\\t\\tinit();\\n\\t\\tsolve();\\n\\t\\t\\n\\t\\tin.close();\\n\\t\\tout.close();\\n\\t}\",\n \"public static void main(String[] args) throws IOException {\\n\\n String path = \\\"D:\\\\\\\\GitHub\\\\\\\\Competetions\\\\\\\\CodeJam\\\\\\\\Code\\\\\\\\src\\\\\\\\B12016\\\\\\\\\\\";\\n String input = \\\"bsmall.in\\\", output = \\\"bsmall.out\\\";\\n FileInputStream fip = new FileInputStream(path + input);\\n FileOutputStream fop = new FileOutputStream(path + output);\\n in = fip;\\n out = new PrintWriter(fop);\\n B a = new B();\\n a.solve();\\n out.close();\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tSolution sol = new Solution();\\n\\t\\tsol.test();\\n\\t}\",\n \"public static void main (String args []) throws IOException\\r\\n\\t{\\n\\t\\tScanner in = new Scanner(new File(\\\"moo.in\\\"));\\r\\n\\t\\tPrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(\\\"moo.out\\\")));\\r\\n\\t\\tint n = in.nextInt();\\r\\n//\\t\\tSystem.out.println(solve(n,0));\\r\\n\\t\\tout.println(solve(n,0));\\r\\n\\t\\tout.flush();\\r\\n\\t}\",\n \"public static void main(String[] args) {\\n System.out.println(Arrays.toString(solution(\\\"\\\")));\\n System.out.println(Arrays.toString(solution(\\\"abcdef\\\")));\\n System.out.println(Arrays.toString(solution(\\\"HelloWorld\\\")));\\n System.out.println(Arrays.toString(solution(\\\"abcde\\\")));\\n System.out.println(Arrays.toString(solution(\\\"LovePizza\\\")));\\n\\n }\",\n \"public static void main(String[] args) throws IOException {\\n\\t\\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n\\t\\tBufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));\\n\\t\\tint t = Integer.parseInt(br.readLine());\\n\\t\\tint a = 0, b = 0;\\n\\t\\tfor (int i = 0; i < t; i++) {\\n\\t\\t\\tStringTokenizer st = new StringTokenizer(br.readLine());\\n\\t\\t\\ta = Integer.parseInt(st.nextToken());\\n\\t\\t\\tb = Integer.parseInt(st.nextToken());\\n\\t\\t\\tbw.write(solution(a, b) + \\\"\\\\n\\\");\\n\\t\\t}\\n\\t\\tbw.flush();\\n\\t\\tbw.close();\\n\\t}\",\n \"public static void main(String[] args) {\\n Last_coding_exercises.task17();\\n\\n\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tSystem.out.println(Arrays.toString(solution(8, 1)));\\r\\n\\t}\",\n \"public static void main(String[] args) throws Exception\\n\\t{\\n\\t\\tBufferedReader br = new BufferedReader(new FileReader(\\\"input6.txt\\\"));\\n\\t\\tSystem.setOut(new PrintStream(new File(\\\"output.txt\\\")));\\n\\n\\t\\tsolve(br);\\n\\t}\",\n \"@Test\\n public void test() {\\n Solution solution = new Solution();\\n\\n }\",\n \"@Test\\n public void test() {\\n Solution solution = new Solution();\\n\\n }\",\n \"public static void main(String[] args) {\\n Scanner sc = new Scanner(System.in);\\n int[] arr = new int[4];\\n for (int i = 0; i < 4; i++)\\n arr[i] = sc.nextInt();\\n \\n Q1 q1 = new Q1();\\n int[] answer = q1.solution(arr);\\n \\n for (int i = 0; i < answer.length; i++) {\\n System.out.println(answer[i]);\\n }\\n }\",\n \"public static void main(String[] args) throws Exception {\\n\\t\\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n\\t\\t//BufferedReader br = new BufferedReader(new FileReader(\\\"input/vol2/Problem127.in\\\"));\\n\\t\\tString line = \\\"\\\";\\n\\t\\t\\n\\t\\twhile(true) {\\n\\t\\t\\tLinkedList<String> strings = new LinkedList<String>();\\n\\t\\t\\tLinkedList<Card> deck = new LinkedList<Card>();\\n\\t\\t\\tline = br.readLine().trim();\\n\\t\\t\\tif(line.equals(\\\"#\\\"))\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tCollections.addAll(strings, line.split(\\\" \\\"));\\n\\t\\t\\tline = br.readLine().trim();\\n\\t\\t\\tCollections.addAll(strings, line.split(\\\" \\\"));\\n\\t\\t\\tfor(String str : strings) {\\n\\t\\t\\t\\tdeck.add(new Card(str));\\n\\t\\t\\t}\\n\\t\\t\\tTableau solution = new Tableau();\\n\\t\\t\\tfor(Card c : deck) {\\n\\t\\t\\t\\t//System.out.print(\\\"Adding: \\\" + c + \\\" \\\");\\n\\t\\t\\t\\tsolution.add(c);\\n\\t\\t\\t\\t//System.out.println(solution);\\n\\t\\t\\t\\t//solution.debug();\\n\\t\\t\\t}\\n\\t\\t\\tSystem.out.println(solution);\\n\\t\\t}\\n\\t\\t//System.out.println(\\\"Runtime: \\\" + (System.currentTimeMillis() - startTime) + \\\"ms\\\");\\n\\t}\",\n \"public void findSolution() {\\n\\n\\t\\t// TODO\\n\\t}\",\n \"public void Main(){\\n }\",\n \"public static void main(String[] args) {\\n\\n // create initial board from file\\n In in = new In(args[0]);\\n int N = in.readInt();\\n int[][] tiles = new int[N][N];\\n for (int i = 0; i < N; i++)\\n for (int j = 0; j < N; j++)\\n tiles[i][j] = in.readInt();\\n Board initial = new Board(tiles);\\n\\n // check if puzzle is solvable; if so, solve it and output solution\\n if (initial.isSolvable()) {\\n Solver solver = new Solver(initial);\\n StdOut.println(\\\"Minimum number of moves = \\\" + solver.moves());\\n for (Board board : solver.solution())\\n StdOut.println(board);\\n }\\n\\n // if not, report unsolvable\\n else {\\n StdOut.println(\\\"Unsolvable puzzle\\\");\\n }\\n}\",\n \"public static void main(String[] args) throws IOException {\\n\\t\\t// TODO Auto-generated method stub\\n\\t\\tNumberGame ng = new NumberGame();\\n\\t\\tng.solve();\\n\\t\\t//ng.test();\\n\\t}\",\n \"public static void main(String[] args) {\\n\\r\\n\\t\\t\\r\\n\\t\\tTest01 t = new Test01();\\r\\n\\t\\t\\r\\n\\t\\t//String st = \\\"1927\\\";\\r\\n\\t\\t//int in\\t= 2;\\t// n 개 제거\\r\\n\\r\\n\\t\\tString st = \\\"1231234\\\";\\r\\n\\t\\tint in\\t= 3;\\t\\r\\n\\t\\t\\r\\n\\t\\tString an = t.solution(st, in);\\r\\n\\t\\t\\r\\n\\t\\tSystem.out.println(an);\\r\\n\\t}\",\n \"private void testSolution(String input, String output) {\\n runs++;\\n\\n // Load the problem & solution\\n ProblemSpec problemSpec = Solution.loadProblem(input);\\n Solution solution = new Solution(problemSpec);\\n\\n // Solve and time the solution\\n long startTime = System.currentTimeMillis();\\n List<State> states = solution.solve();\\n long endTime = System.currentTimeMillis();\\n durations.put(input, endTime - startTime);\\n\\n // Output the solution\\n Solution.writeSolution(Formatter.format(states), output);\\n\\n problemSpec = Solution.loadProblem(input, output);\\n if (solutionPasses(problemSpec)) {\\n passes++;\\n }\\n\\n successes++;\\n }\",\n \"public static void main(String[] args) throws IOException {\\n// new Homework01();\\n new Homework02();\\n }\",\n \"void run() throws IOException {\\n\\r\\n\\t\\treader = new BufferedReader(new FileReader(\\\"input.txt\\\"));\\r\\n\\r\\n\\t\\tout = new PrintWriter(new FileWriter(\\\"output.txt\\\"));\\r\\n\\t\\ttokenizer = null;\\r\\n\\t\\tsolve();\\r\\n\\t\\treader.close();\\r\\n\\t\\tout.flush();\\r\\n\\r\\n\\t}\",\n \"public static void main(String[] args) {\\n InputData inputData = new InputData();\\n FindNumberOfSteps findNumberOfSteps = new FindNumberOfSteps();\\n PrintResult printResult = new PrintResult();\\n printResult.print(findNumberOfSteps.find(inputData.input()));\\n }\",\n \"public static void main(String[] args) throws IOException {\\n\\r\\n \\r\\n \\r\\n }\",\n \"public static void main(String[] args) throws IOException {\\n\\t\\t\\t\\r\\n\\t\\t\\tint [] numReps= {3,1,2,2,2};\\r\\n\\t\\t\\tMathModelClass.solveMe(85, 5, 2,numReps, 1);\\r\\n\\t\\r\\n\\t\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tString filename = \\\"src/y20161B/B-small-practice\\\";\\n\\t\\t//String filename = \\\"src/y20161B/B-large-practice\\\";\\n\\n\\t\\tFileInputStream file;\\n\\t\\tint T;\\n\\n\\t\\ttry {\\n\\t\\t\\tfile = new FileInputStream(filename+\\\".in\\\");\\n\\n\\t\\t\\tBufferedReader in = new BufferedReader(new InputStreamReader(file));\\n\\n\\t\\t\\tT = Integer.parseInt(in.readLine());\\n\\n\\t\\t\\tBufferedWriter bw = new BufferedWriter(new FileWriter(filename+\\\".out\\\"));\\n\\n\\t\\t\\tfor (int i=0; i<T; i++) {\\n\\t\\t\\t\\tint ind = i+1;\\n\\t\\t\\t\\t// parser\\n\\t\\t\\t\\tString buff[] = in.readLine().split(\\\" \\\");\\n\\t\\t\\t\\tString C = buff[0];\\n\\t\\t\\t\\tString J = buff[1];\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// calcul\\n\\t\\t\\t\\tString res = solve(C, J);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tSystem.out.println(\\\"Result \\\"+i+\\\": \\\"+res);\\n\\t\\t\\t\\tbw.write(\\\"Case #\\\"+ind+\\\": \\\"+res+\\\"\\\\n\\\");\\n\\t\\t\\t}\\n\\t\\t\\tbw.close();\\n\\n\\t\\t\\tin.close();\\n\\n\\t\\t} catch (Exception e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tint [] arr = {4,2,3,5};\\r\\n\\t\\tint [] answer = solution(arr);\\r\\n\\t\\tfor(int i=0;i<answer.length;i++)\\r\\n\\t\\t\\tSystem.out.print(answer[i]+\\\" \\\");\\r\\n\\t}\",\n \"public static void main(String[] args) throws FileNotFoundException, IOException{\\n InputStream inputStream = new FileInputStream(new File(\\\"./src/B-large.in\\\"));\\n OutputStream outputStream = new FileOutputStream(new File(\\\"./src/B-large.out\\\"));\\n InputReaderRevengePancakes in = new InputReaderRevengePancakes(inputStream);\\n PrintWriter out = new PrintWriter(outputStream);\\n TaskRevengePancakes solver = new TaskRevengePancakes();\\n solver.solve(1, in, out);\\n out.close();\\n }\",\n \"public static void main(String[] args) throws IOException {\\n br = new BufferedReader(new FileReader(\\\"input.txt\\\"));\\r\\n\\r\\n int T = nextInt();\\r\\n for (int t = 1; t <= T; t++) {\\r\\n nextInt();\\r\\n int X = nextInt();\\r\\n String lString = nextToken();\\r\\n\\r\\n StringBuilder s = new StringBuilder();\\r\\n for (; X > 0; X--) s.append(lString);\\r\\n char[] arr = s.toString().toCharArray();\\r\\n String soln = solve(arr) ? \\\"YES\\\" : \\\"NO\\\";\\r\\n\\r\\n System.out.printf(\\\"Case #%d: %s%n\\\", t, soln);\\r\\n }\\r\\n }\",\n \"public static void main(String[] args) throws Exception\\n\\t{\\n\\t\\tBufferedReader br = new BufferedReader(new FileReader(\\\"input6.txt\\\"));\\tSystem.setOut(new PrintStream(new File(\\\"output.txt\\\")));\\n\\t\\t\\n\\t\\tint t = Integer.parseInt(br.readLine());\\n\\t\\tfor(int i = 1; i <= t; i++)\\n\\t\\t\\tSystem.out.println(\\\"Case #\\\"+i+\\\": \\\"+solve(br));\\n\\t}\",\n \"public static void main(String[] args) {\\r\\n\\t\\tint N=1;\\r\\n\\t\\tint[][] trust = {};\\r\\n\\t\\tSolution sol = new Solution();\\r\\n\\t\\tSystem.out.println(sol.findJudge(N, trust));\\r\\n\\t}\",\n \"public static void main(String[] args) \\n\\t{\\n\\t\\tinitialize(\\\"\\\");\\n\\t\\t\\n\\t\\t//making instance from file name\\n\\n\\t\\tString str = \\\"A-n32-k5.vrp\\\";\\n\\t\\tString fileName = \\\"input//\\\" + str;\\n\\t\\t\\n\\t\\t\\n\\t\\tInstance problem = new VRPInstance(fileName);\\n\\t\\tSystem.out.println(problem.comment);\\n\\t\\t//solve problem\\n\\n\\t\\t//Solver solver2 = new SimpleGreedySolver(problem);\\n\\t\\t//Solver solver2 = new NearestNeighborGreedySolver(problem);\\n\\t\\t//Solver solver = new ClarkeWrightGreedySolver(problem);\\n\\t\\t//Solver solver = new EHSBASolver(problem);\\n\\t\\t//solver2.solve();\\n\\t\\t//solver2.printResult();\\n\\t\\t\\n\\t\\t//solver = new ClarkeWrightGreedySolver(problem);\\n\\t\\tSolver solver3 = new EHSBASolver(problem);\\n\\t\\tsolver3.solve();\\n\\t\\tsolver3.printResult();\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"finished.\\\");\\n\\t\\t\\n\\t\\t\\n\\t\\t/*File folder = new File(\\\"input\\\");\\n\\t\\tFile[] listOfFiles = folder.listFiles();\\n\\t\\t\\n\\t\\tfor(int i = 0; i < listOfFiles.length; i++)\\n\\t\\t{\\n\\t\\t\\n\\t\\t\\tString str = listOfFiles[i].getName();\\n\\t\\t\\tSystem.out.println(str);\\n\\t\\t\\tif(listOfFiles[i].isFile() && str.substring(0, 1).equalsIgnoreCase(\\\"A\\\"))\\n\\t\\t\\t\\tfileName = \\\"input\\\\\\\\\\\" + str;\\n\\t\\t\\telse\\n\\t\\t\\t\\tcontinue;\\n\\n\\t\\t\\t//fileName = \\\"input\\\\\\\\\\\" + fileName;\\n\\t\\t\\tInstance problem = new VRPInstance(fileName);\\n\\t\\t\\tSystem.out.println(problem.comment);\\n\\t\\t\\t//solve problem\\n\\t\\n\\t\\t\\t//Solver solver = new SimpleGreedySolver(problem);\\n\\t\\t\\t//Solver solver = new NearestNeighborGreedySolver(problem);\\n\\t\\t\\tSolver solver = new ClarkeWrightGreedySolver(problem);\\n\\t\\t\\t//Solver solver = new EHSBASolver(problem);\\n\\t\\t\\tsolver.solve();\\n\\t\\t\\tsolver.printResult();\\t\\n\\n\\t\\t}*/\\n\\n\\t\\t\\n\\t}\",\n \"public static void main(String[] args) {\\n In in = new In(args[0]);\\n int n = in.readInt();\\n int[][] blocks = new int[n][n];\\n for (int i = 0; i < n; i++)\\n for (int j = 0; j < n; j++)\\n blocks[i][j] = in.readInt();\\n\\n Board initial = new Board(blocks);\\n\\n // solve the puzzle\\n Solver solver = new Solver(initial);\\n\\n // print solution to standard output\\n if (!solver.isSolvable())\\n StdOut.println(\\\"No solution possible\\\");\\n else {\\n StdOut.println(\\\"Minimum number of moves = \\\" + solver.moves());\\n for (Board board : solver.solution())\\n StdOut.println(board);\\n }\\n }\",\n \"public static void main(String[] args) {\\n In in = new In(args[0]);\\n int n = in.readInt();\\n int[][] blocks = new int[n][n];\\n for (int i = 0; i < n; i++)\\n for (int j = 0; j < n; j++)\\n blocks[i][j] = in.readInt();\\n Board initial = new Board(blocks);\\n\\n // solve the puzzle\\n Solver solver = new Solver(initial);\\n\\n // print solution to standard output\\n if (!solver.isSolvable())\\n StdOut.println(\\\"No solution possible\\\");\\n else {\\n StdOut.println(\\\"Minimum number of moves = \\\" + solver.moves());\\n for (Board board : solver.solution())\\n StdOut.println(board);\\n }\\n }\",\n \"public static void main(String[] args) {\\n /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */\\n Scanner sc = new Scanner(System.in);\\n int cases = sc.nextInt();\\n for(int i=0;i<cases;i++){\\n \\tString[] strArray = sc.next().split(\\\"\\\");\\n\\n \\tString odd = \\\"\\\";\\n \\tString even = \\\"\\\";\\n \\t\\n \\tfor(int j=1;j<strArray.length;j++){\\n \\t\\tif(j%2==0){\\n\\t\\t\\t\\t\\teven += strArray[j];\\n \\t\\t}else{\\n \\t\\t\\todd += strArray[j];\\n \\t\\t}\\n \\t\\t\\n \\t}\\n \\t\\n \\tSystem.out.println(odd + \\\" \\\" + even);\\n }\\n }\",\n \"public static void main(String[] args) {\\n int[] arr = {10, 2, 5, 1, 8, 12};\\n System.out.println(solution(arr));\\n }\",\n \"public void main(){\\n }\",\n \"public static void main(String[] args) {\\n\\n\\t\\tsolution();\\n\\n\\t\\t// int maxDivisor = Divided.getMaxDivisor(1, 3);\\n\\t\\t// System.out.println(\\\"maxDivisor：\\\" + maxDivisor);\\n\\n\\t}\",\n \"public static void main() {\\n \\n }\",\n \"public static void main(String[] args){\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n }\",\n \"public static void main(String[] args) {\\n\\r\\n\\t\\tSystem.out.println(solution(\\\"ACACACA\\\"));\\r\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tint A[]={2,1,0,0,0};\\r\\n\\t\\tSystem.out.println(solution(A));\\r\\n\\r\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tint A[] = new int[5];\\n\\t\\tA[0]=3;\\n\\t\\tA[1]=1;\\n\\t\\tA[2]=2;\\n\\t\\tA[3]=4;\\n\\t\\tA[4]=3;\\n\\t\\tSolution s = new Solution();\\n\\t\\tSystem.out.println(s.solution(A));\\n\\t}\",\n \"public static void main(String args[]) {\\n\\n\\t\\tFlowers example = new Flowers();\\n\\t\\t\\n\\t\\texample.model();\\n\\n\\t\\tif (example.search())\\n\\t\\t\\tSystem.out.println(\\\"Solution(s) found\\\");\\n\\t\\t\\n\\t}\",\n \"public static void main(String[] args) {\\n String str = \\\"The one-hour drama series Westworld is a dark odyssey about the dawn of artificial consciousness and the evolution of sin. Set at the intersection of the near future and the reimagined past, it explores a world in which every human appetite, no matter how noble or depraved, can be indulged.\\\";\\n\\n System.out.println(solution1(str));\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tint[] number = new int[] {1, 1, 1, 1, 1};\\n\\t\\tint target = 3;\\n\\t\\t\\n\\t\\tSolution s = new Solution();\\n\\t\\tint result = s.solution(number, target);\\n\\t\\tSystem.out.println(result);\\n\\t}\",\n \"@Test\\n public void testSolution() {\\n assertSolution(\\\"425\\\", \\\"input-day01-2018.txt\\\");\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tScanner sc = new Scanner(System.in);\\n\\t\\tint n = sc.nextInt();\\n\\t\\tArrayList<Integer> arr = new ArrayList<>();\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tarr.add(sc.nextInt());\\n\\t\\t}\\n\\t\\tint k = sc.nextInt();\\n\\t\\tSolution sol = new Solution();\\n\\t\\tSystem.out.println(sol.solve(arr, k));\\n\\t\\tsc.close();\\n\\t}\",\n \"public Main() {\\n }\",\n \"public Main() {\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tint arr[] = {9,3,9,3,9,7,9};\\n\\t\\tSolution(arr);\\n\\t}\",\n \"public static void main(String[] args) { \\n \\n //read in filename from user\\n String filenameInput = args[0];\\n \\n //create new maze/graph\\n Maze newMaze = new Maze(filenameInput);\\n \\n //call toString\\n //String stringMaze = newMaze.toString();\\n \\n //print the string maze\\n //System.out.println(stringMaze);\\n \\n //call findPath\\n //System.out.println(newMaze.findPath());\\n \\n for (Vertex v : newMaze.findPath()) System.out.print(v.getName());\\n \\n //print solution?\\n //System.out.println(newMaze.solution);\\n \\n \\n }\",\n \"public static void main(String[] args) {\\n String name = \\\"ABAAABB\\\";\\n\\n System.out.println(solution(name));\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tint[] A = {51,31,43};\\n\\t\\tSystem.out.println(solution(A));\\n\\n\\t}\",\n \"public static void main (String[] args) {\\n Scanner s = new Scanner(System.in);\\r\\n System.out.print(BinaryReversalMethod(s.nextLine()));\\r\\n s.close();\\r\\n }\",\n \"public static void main(String[] args) // solve a slider puzzle (given below)\\n {\\n In in = new In(args[0]);\\n int N = in.readInt();\\n int[][] blocks = new int[N][N];\\n for (int i = 0; i < N; i++)\\n for (int j = 0; j < N; j++)\\n blocks[i][j] = in.readInt();\\n Board initial = new Board(blocks);\\n\\n // solve the puzzle\\n Solver solver = new Solver(initial);\\n\\n // print solution to standard output\\n if (!solver.isSolvable())\\n StdOut.println(\\\"No solution possible\\\");\\n else {\\n StdOut.println(\\\"Minimum number of moves = \\\" + solver.moves());\\n for (Board board : solver.solution())\\n StdOut.println(board);\\n \\n \\t\\n }\\n}\",\n \"public Main() {\\n \\n \\n }\",\n \"public Main() {\\n }\",\n \"public static void main()\\n\\t{\\n\\t}\",\n \"public static void main(String[] args) throws IOException {\\n\\n\\t\\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n\\t\\tStringTokenizer st = new StringTokenizer(br.readLine().trim());\\n\\t\\tint tc = Integer.parseInt(st.nextToken());\\n\\t\\tfor (int i = 0; i < tc; i++) {\\n\\t\\t\\tst = new StringTokenizer(br.readLine().trim());\\n\\t\\t\\tint x = Integer.parseInt(st.nextToken());\\n\\t\\t\\tint y = Integer.parseInt(st.nextToken());\\n\\t\\t\\tsolve(y - x);\\n\\t\\t}\\n\\t}\",\n \"public static void main(String[] args) throws FileNotFoundException {\\n Scanner scanner = new Scanner(new FileInputStream(\\\"/Users/guoziren/IdeaProjects/剑指offer for Java/src/main/java/com/ustc/leetcode/algorithmidea/dynamicprogramming/input.txt\\\"));\\n }\",\n \"public interface SASolution extends Solution {\\r\\n\\r\\n /**\\r\\n * Generates a neighbor solution using this solution\\r\\n *\\r\\n * @return\\r\\n */\\r\\n public SASolution getNeighborSolution();\\r\\n\\r\\n /**\\r\\n * Prints this solution\\r\\n *\\r\\n * @return\\r\\n */\\r\\n public String getAsString();\\r\\n\\r\\n}\",\n \"public static void main(String[] args) throws IOException {\\n\\r\\n }\",\n \"public Main() {\\r\\n }\",\n \"public Main() {\\r\\n }\",\n \"public static void main(String[] args) {\\n int lineSize = Integer.parseInt(args[0]);\\n String[] input = getInput(args);\\n\\n WordWrap ww = new WordWrap(lineSize, input);\\n Long start = System.currentTimeMillis();\\n Integer[] lines = ww.solve();\\n Long end = System.currentTimeMillis();\\n\\n System.out.println(\\\"solved in \\\"+((end-start)/1000.0) +\\\" seconds\\\");\\n printResult(lines, input);\\n }\",\n \"public static void main(String[] args) {\\n System.out.println(solution(new int[]{3,1,2,4,3}));\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tnew Challenge09();\\r\\n\\t}\",\n \"public static void main(String[] args){\\n Solution solution = new Solution();\\n System.out.println(solution.convertToTitle(27));\\n }\",\n \"public static void main(String[] args) {\\n In in = new In(args[0]);\\n int n = in.readInt();\\n int[][] tiles = new int[n][n];\\n for (int i = 0; i < n; i++)\\n for (int j = 0; j < n; j++)\\n tiles[i][j] = in.readInt();\\n Board initial = new Board(tiles);\\n\\n // Solve the puzzle\\n Solver solver = new Solver(initial);\\n\\n // Print solution to standard output\\n if (!solver.isSolvable())\\n StdOut.println(\\\" No solution possible \\\");\\n else {\\n StdOut.println(\\\" Minimum number of moves = \\\" + solver.moves());\\n for (Board solutionboard : solver.solution())\\n StdOut.println(solutionboard);\\n }\\n\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tSolution s = new Solution();\\n\\t\\tint[] nums = {4,5,6,7,0,1,2};\\n\\t\\tSystem.out.println(s.search(nums, 0));\\n\\t}\",\n \"public Main() {}\",\n \"public static void main(String[] args) {\\n\\t\\tScanner in = new Scanner(System.in);\\n\\t\\tArrayList<String> problems = new ArrayList<>();\\n\\t\\t\\n\\t\\t\\n\\t\\tint noOfInputs = Integer.parseInt(in.nextLine());\\n\\t\\t\\n\\t\\tfor(int x=0; x<noOfInputs; x++) {\\n\\t\\t\\tproblems.add(in.nextLine());\\n\\t\\t}\\n\\t\\tin.close();\\n\\t\\t\\n\\t\\tfor(String p : problems) {\\n\\t\\t\\tint no = getFibonacciIndex(p);\\n\\t\\t\\t//System.out.print( no + \\\"\\\\n\\\\t\\\" + p + \\\"\\\\n\\\\t\\\" + getFib(no) + \\\"\\\\n\\\" );\\n\\t\\t\\tSystem.out.print(no + \\\" \\\");\\n\\t\\t}\\n\\t\\tSystem.out.println(\\\"\\\");\\n\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tMain m=new Main();\\n\\t\\tSystem.out.println(m.solve(\\\"abcd\\\"));\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7527976","0.7303336","0.72607845","0.7235645","0.71771896","0.7173708","0.7021257","0.7021257","0.6892989","0.6870499","0.6857013","0.68230754","0.68217313","0.68089324","0.6807614","0.68048334","0.67823637","0.6769391","0.6755574","0.6752626","0.67501354","0.67343485","0.67177075","0.670575","0.6694025","0.6651379","0.6650486","0.66273195","0.6623455","0.66219133","0.6614607","0.66057944","0.6601166","0.65847987","0.6519271","0.65002024","0.64949495","0.6468012","0.6468012","0.6460535","0.6455496","0.64402544","0.6416208","0.63926125","0.6383955","0.63642913","0.6343862","0.6340873","0.6339769","0.633103","0.63309777","0.6324926","0.63149905","0.63087344","0.6296579","0.6269123","0.6265856","0.6255766","0.62493974","0.6241782","0.6230336","0.6229485","0.62289786","0.6222315","0.6215251","0.6212911","0.62036884","0.61999005","0.61966467","0.619219","0.6185675","0.61798847","0.6169137","0.616607","0.61657315","0.616071","0.616071","0.61604697","0.6159225","0.6157685","0.6157004","0.61509573","0.61485475","0.61485267","0.6148091","0.6145761","0.61394733","0.6137791","0.61346126","0.6134102","0.6132378","0.6132378","0.6127424","0.6123743","0.61157185","0.61015606","0.6097861","0.6089708","0.6086964","0.6086727","0.6085393"],"string":"[\n \"0.7527976\",\n \"0.7303336\",\n \"0.72607845\",\n \"0.7235645\",\n \"0.71771896\",\n \"0.7173708\",\n \"0.7021257\",\n \"0.7021257\",\n \"0.6892989\",\n \"0.6870499\",\n \"0.6857013\",\n \"0.68230754\",\n \"0.68217313\",\n \"0.68089324\",\n \"0.6807614\",\n \"0.68048334\",\n \"0.67823637\",\n \"0.6769391\",\n \"0.6755574\",\n \"0.6752626\",\n \"0.67501354\",\n \"0.67343485\",\n \"0.67177075\",\n \"0.670575\",\n \"0.6694025\",\n \"0.6651379\",\n \"0.6650486\",\n \"0.66273195\",\n \"0.6623455\",\n \"0.66219133\",\n \"0.6614607\",\n \"0.66057944\",\n \"0.6601166\",\n \"0.65847987\",\n \"0.6519271\",\n \"0.65002024\",\n \"0.64949495\",\n \"0.6468012\",\n \"0.6468012\",\n \"0.6460535\",\n \"0.6455496\",\n \"0.64402544\",\n \"0.6416208\",\n \"0.63926125\",\n \"0.6383955\",\n \"0.63642913\",\n \"0.6343862\",\n \"0.6340873\",\n \"0.6339769\",\n \"0.633103\",\n \"0.63309777\",\n \"0.6324926\",\n \"0.63149905\",\n \"0.63087344\",\n \"0.6296579\",\n \"0.6269123\",\n \"0.6265856\",\n \"0.6255766\",\n \"0.62493974\",\n \"0.6241782\",\n \"0.6230336\",\n \"0.6229485\",\n \"0.62289786\",\n \"0.6222315\",\n \"0.6215251\",\n \"0.6212911\",\n \"0.62036884\",\n \"0.61999005\",\n \"0.61966467\",\n \"0.619219\",\n \"0.6185675\",\n \"0.61798847\",\n \"0.6169137\",\n \"0.616607\",\n \"0.61657315\",\n \"0.616071\",\n \"0.616071\",\n \"0.61604697\",\n \"0.6159225\",\n \"0.6157685\",\n \"0.6157004\",\n \"0.61509573\",\n \"0.61485475\",\n \"0.61485267\",\n \"0.6148091\",\n \"0.6145761\",\n \"0.61394733\",\n \"0.6137791\",\n \"0.61346126\",\n \"0.6134102\",\n \"0.6132378\",\n \"0.6132378\",\n \"0.6127424\",\n \"0.6123743\",\n \"0.61157185\",\n \"0.61015606\",\n \"0.6097861\",\n \"0.6089708\",\n \"0.6086964\",\n \"0.6086727\",\n \"0.6085393\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":26197,"cells":{"query":{"kind":"string","value":"private Map, Vertex> previous; Creates a StreetSearcher object."},"document":{"kind":"string","value":"public StreetSearcher() {\n vertices = new HashMap<>();\n graph = new SparseGraph<>();\n //double smDistance = 0;\n //previous = new HashMap<>();\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 Vertex getPrevious(){\n return previous;\n }","@Override\n\t//loc1 is the start location,loc2 is the destination\n\tpublic ArrayList<MapCoordinate> bfsSearch(MapCoordinate loc1, MapCoordinate loc2, Map m) {\n\t\tSystem.out.println(\"come into bfsSearch\");\n\t\tif(m.isAgentHasAxe() && m.isAgentHasKey()){\n\t\t\tLinkedList<State> queue=new LinkedList<State>();\n\t\t\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\n\t\t\t\n\t\t\t//Visited.add(loc1);\n\t\t\tState s1=new State(loc1,m.getAgentHasNStones(),null);\n\t\t\tqueue.add(s1);\n\t\t\t\n\t\t\twhile(!queue.isEmpty()){\n\t\t\t\tState s=queue.remove();\n\t\t\t\tMapCoordinate currentLocation=s.getLocation();\n\t\t\t\tVisited.add(s.getLocation()); //add to visited every loop\n\t\t\t\tif(loc2.equals(currentLocation)){\n\t\t\t\t\t//means could reach loc2 from loc1\n\t\t\t\t\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\n\t\t\t\t\twhile(s.getPrevState()!=null){\n\t\t\t\t\t\troute.add(0,s.getLocation()); //add to head\n\t\t\t\t\t\ts=s.getPrevState();\n\t\t\t\t\t}\n\t\t\t\t\treturn route;\n\t\t\t\t}\n\t\t\t\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY());\n\t\t\t\tif(m.hasCoordinate(temp)){//state move east\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){ //this is important else if(cTemp!='~'), not barely else,\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY());\n\t\t\t\tif(m.hasCoordinate(temp)){//state move south\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1);\n\t\t\t\tif(m.hasCoordinate(temp)){//state move north\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1);\n\t\t\t\tif(m.hasCoordinate(temp)){//state move south\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' ){\n\t\t\t\t\t\t\tif(cTemp=='~' &&s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\t\n\t\t\t}\n\t\t\treturn null;\n\t\t}else if(m.isAgentHasAxe()){ //only have axe\n\t\t\tLinkedList<State> queue=new LinkedList<State>();\n\t\t\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\n\t\t\t\n\t\t\t//Visited.add(loc1);\n\t\t\tState s1=new State(loc1,m.getAgentHasNStones(),null);\n\t\t\tqueue.add(s1);\n\t\t\t\n\t\t\twhile(!queue.isEmpty()){\n\t\t\t\tState s=queue.remove();\n\t\t\t\tMapCoordinate currentLocation=s.getLocation();\n\t\t\t\tVisited.add(s.getLocation()); //add visited every loop\n\t\t\t\tif(loc2.equals(currentLocation)){\n\t\t\t\t\t//means could reach loc2 from loc1\n\t\t\t\t\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\n\t\t\t\t\twhile(s.getPrevState()!=null){\n\t\t\t\t\t\troute.add(0,s.getLocation()); //add to head\n\t\t\t\t\t\ts=s.getPrevState();\n\t\t\t\t\t}\n\t\t\t\t\treturn route;\n\t\t\t\t}\n\t\t\t\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY());\n\t\t\t\tif(m.hasCoordinate(temp)){//state move south\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY());\n\t\t\t\tif(m.hasCoordinate(temp)){//state move south\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1);\n\t\t\t\tif(m.hasCoordinate(temp)){//state move north\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1);\n\t\t\t\tif(m.hasCoordinate(temp)){//state move south\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn null;\n\t\t}else if(m.isAgentHasKey()){ //only have key\n\t\t\tLinkedList<State> queue=new LinkedList<State>();\n\t\t\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\n\t\t\t\n\t\t\t//Visited.add(loc1);\n\t\t\tState s1=new State(loc1,m.getAgentHasNStones(),null);\n\t\t\tqueue.add(s1);\n\t\t\t\n\t\t\twhile(!queue.isEmpty()){\n\t\t\t\tState s=queue.remove();\n\t\t\t\tMapCoordinate currentLocation=s.getLocation();\n\t\t\t\tVisited.add(s.getLocation());\n\t\t\t\tif(loc2.equals(currentLocation)){\n\t\t\t\t\t//means could reach loc2 from loc1\n\t\t\t\t\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\n\t\t\t\t\twhile(s.getPrevState()!=null){\n\t\t\t\t\t\troute.add(0, s.getLocation()); //add to head,in this fashion, return the right order of route\n\t\t\t\t\t\ts=s.getPrevState();\n\t\t\t\t\t}\n\t\t\t\t\treturn route;\n\t\t\t\t}\n\t\t\t\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY()); \n\t\t\t\tif(m.hasCoordinate(temp)){//state move east\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY()); //state that move west\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1); //state move north\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1); //state move south\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn null;\n\t\t}\n\t\t\n\t\t\n\t\t/*\n\t\t * \n\t\t **/\t\t\n\t\telse{ //have no key and axe\n\t\t\tSystem.out.println(\"come into the last elas clause\");\n\t\t\tLinkedList<State> queue=new LinkedList<State>();\n\t\t\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\n\t\t\t\n\t\t\tVisited.add(loc1);\n\t\t\tState s1=new State(loc1,m.getAgentHasNStones(),null);\n\t\t\tqueue.add(s1);\n\t\t\t\n\t\t\t//int i=0;\n\t\t\twhile(!queue.isEmpty()){\n\t\t\t\t//i++;\n\t\t\t\t//System.out.println(\"come into while: \"+i);\n\t\t\t\tState s=queue.remove();\n\t\t\t\tMapCoordinate currentLocation=s.getLocation();\n\t\t\t\tVisited.add(s.getLocation()); //add visited, let program won't stuck in \n\t\t\t\tif(loc2.equals(currentLocation)){\n\t\t\t\t\t//means could reach loc2 from loc1\n\t\t\t\t\tSystem.out.println(\"return computed route\");\n\t\t\t\t\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\n\t\t\t\t\twhile(s.getPrevState()!=null){\n\t\t\t\t\t\troute.add(0, s.getLocation()); //add to head\n\t\t\t\t\t\ts=s.getPrevState();\n\t\t\t\t\t}\n\t\t\t\t\tfor(MapCoordinate mc:route){\n\t\t\t\t\t\t//System.out.println(\"print returned route in bfssearch\");\n\t\t\t\t\t\tSystem.out.print(\"mc:\"+mc.getX()+\" \"+mc.getY()+\"->\");\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\treturn route;\n\t\t\t\t}\n\t\t\t\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY());\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\t//System.out.println(\"1 if\");\n\t\t\t\t\tif(s.getPrevState()!=null &&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if\");\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 if\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 if\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 else\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for the initial state \n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY());\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.add(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for the initial state \n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\tSystem.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1);\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*'&&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for the initial state \n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1);\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' &&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}//do not do any action for not enough stones situation\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for the initial state \n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}//do not do any action for not enough stones situation\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn null;\n\t\t}\n\t}","private List<GeographicPoint> backTrack(HashMap<GeographicPoint, List<GeographicPoint>> prev, GeographicPoint goal) {\n\t\tList<GeographicPoint> ans = new ArrayList<GeographicPoint>();\n\t\tList<GeographicPoint> temp = prev.get(goal);\n\t\tif (temp.size() != 0) {\n\t\t\tans.add(goal);\n\t\t\twhile (temp.size() != 0) {\n//\t\t\t\tSystem.out.print(\"Neighbours: \");\n\t\t\t\t// lastNeighbour will be the neighbour node we visited right before moving to the current node\n\t\t\t\tGeographicPoint lastNeighbour = temp.get(temp.size() - 1);\n\t\t\t\tans.add(lastNeighbour);\n\t\t\t\ttemp = prev.get(lastNeighbour);\n\t\t\t}\n\t\t\tCollections.reverse(ans);\n\t\t}\n\t\tif (ans.isEmpty())\n\t\t\treturn null;\n\t\treturn ans;\n\t}","public Graph() {\n\t\ttowns = new HashSet<Town>();\n\t\troads = new HashSet<Road>();\n\t\tprevVertex = new HashMap<String, Town>();\n\t}","public Vertex getPrev() {\n return prev;\n }","public void setPrevious(Vertex v){\n previous = v;\n }","@Override\n\tpublic void search() {\n\t\tpq = new IndexMinPQ<>(graph.getNumberOfStations());\n\t\tpq.insert(startIndex, distTo[startIndex]);\n\t\twhile (!pq.isEmpty()) {\n\t\t\tint v = pq.delMin();\n\t\t\tnodesVisited.add(graph.getStation(v));\n\t\t\tnodesVisitedAmount++;\n\t\t\tfor (Integer vertex : graph.getAdjacentVertices(v)) {\t\n\t\t\t\trelax(graph.getConnection(v, vertex));\n\t\t\t}\n\t\t}\n\t\tpathWeight = distTo[endIndex];\n\t\tpathTo(endIndex);\n\t}","private int searchNext(JmtCell prev) {\r\n \t\tRectangle boundspadre = GraphConstants.getBounds((prev).getAttributes()).getBounds();\r\n \t\tObject[] listEdges = null;\r\n \t\tGraphModel graphmodel = graph.getModel();\r\n \t\tList<Object> next = new ArrayList<Object>();\r\n \r\n \t\tif (flag1 == false && prev.seen == false) {\r\n \r\n \t\t\t// Rectangle bounds =\r\n \t\t\t// GraphConstants.getBounds(((JmtCell)prev).getAttributes()).getBounds();\r\n \t\t\tif (!flag2) {\r\n \t\t\t\tboundspadre.setLocation(x, y + ((e + 1) * (42 + heightMax)) - (int) (boundspadre.getHeight() / 2) + 30);\r\n \t\t\t} else {\r\n \t\t\t\tboundspadre.setLocation(x - (int) (boundspadre.getWidth() / 2), y + ((e + 1) * (42 + heightMax))\r\n \t\t\t\t\t\t- (int) (boundspadre.getHeight() / 2) + 30);\r\n \t\t\t}\r\n \r\n \t\t\tGraphConstants.setBounds(prev.getAttributes(), boundspadre);\r\n \t\t\tx = (int) boundspadre.getCenterX() + widthMax + 50;\r\n \t\t\tprev.seen = true;\r\n \t\t\tflag2 = true;\r\n \t\t}\r\n \r\n \t\t// inserisco tutti gli archi uscenti e entranti di min.get(j) in\r\n \t\t// listEdges\r\n \t\tlistEdges = DefaultGraphModel.getOutgoingEdges(graphmodel, prev);\r\n \t\tVector<Object> listEdgestmp = new Vector<Object>();\r\n \t\tfor (Object listEdge : listEdges) {\r\n \t\t\tJmtCell qq = (JmtCell) (graphmodel.getParent(graphmodel.getTarget(listEdge)));\r\n \t\t\tif (!(qq).seen) {\r\n \t\t\t\tlistEdgestmp.add(listEdge);\r\n \t\t\t}\r\n \t\t}\r\n \t\tlistEdges = listEdgestmp.toArray();\r\n \r\n \t\tint numTarget = listEdges.length;\r\n \t\tif (numTarget == 0) {\r\n \t\t\treturn 1;\r\n \t\t}\r\n \r\n \t\tfor (int k = 0; k < numTarget; k++) {\r\n \t\t\tnext.add((graphmodel.getParent(graphmodel.getTarget(listEdges[k]))));\r\n \t\t}\r\n \r\n \t\tint j = 1;\r\n \t\tif (inRepositionSons == false && ((JmtCell) next.get(0)).seen == false) {\r\n \t\t\tj = searchNext((JmtCell) next.get(0));\r\n \t\t} else if (inRepositionSons == true && ((JmtCell) next.get(0)).seen == false) {\r\n \r\n \t\t\tRectangle bounds = GraphConstants.getBounds(((JmtCell) next.get(0)).getAttributes()).getBounds();\r\n \t\t\tbounds.setLocation((int) (boundspadre.getCenterX()) + widthMax + 50 - (int) (bounds.getWidth() / 2), (int) boundspadre.getCenterY()\r\n \t\t\t\t\t- (int) (bounds.getHeight() / 2));\r\n \t\t\tGraphConstants.setBounds(((JmtCell) next.get(0)).getAttributes(), bounds);\r\n \r\n \t\t\t((JmtCell) next.get(0)).seen = true;\r\n \t\t\tj = searchNext((JmtCell) next.get(0));\r\n \t\t}\r\n \r\n \t\tif (numTarget > 0) {\r\n \t\t\tif (!flag) {\r\n \t\t\t\trepositionSons(prev, next, j - 1, 1);\r\n \t\t\t} else {\r\n \t\t\t\trepositionSons(prev, next, -1, 0);\r\n \t\t\t}\r\n \t\t\tflag = false;\r\n \t\t}\r\n \r\n \t\t(prev).sons = 0;\r\n \t\tfor (int w = 0; w < numTarget; w++) {\r\n \t\t\tprev.sons += ((JmtCell) next.get(w)).sons;\r\n \t\t}\r\n \r\n \t\treturn prev.sons;\r\n \t}","private Vertex getVertex( String vertexName )\n {\n Vertex v = vertexMap.get( vertexName );\n if( v == null )\n {\n v = new Vertex( vertexName );\n vertexMap.put( vertexName, v );\n }\n return v;\n }","void prevSet(Entry e) {\r\n\t\t\tprev = e;\r\n\t\t}","public List<Location> getPreviousLocations();","public Stack<Vertex> next() {\n Vertex u = lov.pop();\n for (Edge e : u.outEdges) {\n if (!e.to.visited) {\n cameFromEdge.put(e.to.toIdentifier(), e.from);\n if (e.to.x == MazeWorld.width - 1 && e.to.y == MazeWorld.height - 1) {\n reconstruct(cameFromEdge, e.to);\n lov = new Stack<Vertex>();\n }\n else {\n lov.push(u);\n e.to.visited = true;\n lov.push(e.to);\n break;\n }\n }\n }\n return lov;\n }","private void prevAddress(){\n\t\tif (this.addressIndex <= 0){\n\t\t\t this.addressIndex = this.addresses.length -1; \n\t\t\t}\n\t\t\telse{\n\t\t\t\tthis.addressIndex--;\n\t\t\t}\n\t\tthis.displayServer = this.addresses[addressIndex];\n\t\t\n\t}","private void findPrev() {\n \tthis.find(false);\n }","@Override\n protected KPMPSolution nextNeighbour() {\n List<KPMPSolutionWriter.PageEntry> edgePartition = bestSolution.getEdgePartition().stream().map(KPMPSolutionWriter.PageEntry::clone).collect(toCollection(ArrayList::new));\n KPMPSolution neighbourSolution = new KPMPSolution(bestSolution.getSpineOrder(), edgePartition, bestSolution.getNumberOfPages());\n edge = edgePartition.get(index);\n originalPageIndex = edge.page;\n newPageIndex = pageCounter;\n edgePartition.get(index).page = newPageIndex;\n index++;\n numberOfIterations++;\n return neighbourSolution;\n }","private Vertex<String> addLocation(String name) {\n if (!vertices.containsKey(name)) {\n Vertex<String> v = graph.insert(name);\n vertices.put(name, v);\n return v;\n }\n return vertices.get(name);\n }","public Pair<Integer, Map<Vertex, Vertex>> ShortestDistance(Vertex source, Vertex zink) {\n Map<Vertex, Vertex> PredecessorMap = new HashMap<>();\n Map<Vertex, Integer> DistanceMap = new HashMap<>();\n Vertex a;\n // initialize arrays\n for (Vertex v : Vertices) {\n DistanceMap.put(v, 1000); //We initialize the array in infinite\n PredecessorMap.put(v, null);\n }\n DistanceMap.put(source, 0); //We put the source in 0\n for (Vertex v : Vertices) {\n while (!DistanceMap.isEmpty()) { //And we iterate until the distance map is empty\n a = getmin(DistanceMap); //we get the minimum vertex\n if(a==null) {\n return (new Pair<Integer, Map<Vertex, Vertex>>(DistanceMap.get(zink), PredecessorMap));\n }\n\n ArrayList<Edge> edges = a.getOutEdges(); //we get de edges connected to this vertex\n for (Edge e : edges) { //we iterate getting the vertex of each edge\n if (DistanceMap.containsKey(e.tovertex)) { //if the vertex is in the distance map:\n Integer alt = DistanceMap.get(a) + e.distance; //we get it value and plus the distance of the edge\n\n System.out.println(\"This is the distance going out from that Vertex: \" + alt + \", with previous distance: \" + DistanceMap.get(e.tovertex));\n if (alt < DistanceMap.get(e.tovertex)) { //if it is less, we put it in the arrays\n DistanceMap.put(e.tovertex, alt);\n PredecessorMap.put(e.tovertex, a);\n\n }\n }\n }\n DistanceMap.remove(a); //and we remove it of the array\n }\n }\n return (new Pair<Integer, Map<Vertex, Vertex>>(DistanceMap.get(zink), PredecessorMap));\n }","private Stack<Cell> constructPlan(WorldMap worldMap, Cell target, Hashtable<Cell, Cell> prev) {\n\n\t\t// Starting from the target and backtracking to find the route plan\n\t\tStack<Cell> newPlan = new Stack<Cell>();\n\n\t\tCell cell = target;\n\t\twhile (prev.containsKey(cell)) {\n\t\t\tnewPlan.push(cell);\n\t\t\tcell = prev.get(cell);\n\t\t}\n\t\treturn newPlan;\n\t}","private void processOverlay(){\n \n // go for as long as edges still exist.\n while(this.availableVertices.size() > 0)\n {\n \n // pick the least weight vertex.\n Vertex next = this.availableVertices.poll(); // finding the least weight vertex.\n int distanceToNext = this.distances.get(convertToString(next.getVertexPortNum())); // must use the string version of the portnum.\n \n // and for each available squad member of the chosen vertex\n List<Edge> nextSquad = next.getSquad(); \n for(Edge e: nextSquad)\n {\n Vertex other = e.getNeighbor(next);\n if(this.visitedVertices.contains(other))\n {\n continue; // continue the while loop in this case.\n }\n \n // check for a shorter path, update if a new path is found within the overlay.\n int currentWeight = this.distances.get(convertToString(other.getVertexPortNum())); // using string version of the port number.\n int newWeight = distanceToNext + e.getWeight();\n \n if(newWeight < currentWeight){\n this.predecessors.put(convertToString(other.getVertexPortNum()), convertToString(next.getVertexPortNum())); // use the string versions of the port numbers.\n this.distances.put(convertToString(other.getVertexPortNum()), newWeight); // use the string version of the port numbers.\n // updating here.\n this.availableVertices.remove(other);\n this.availableVertices.add(other);\n }\n \n }\n \n this.visitedVertices.add(next); // add this vertex as \"visited\" so we do not visit it again.\n }\n }","protected abstract Collection<Street> findConnectedStreets(\r\n StreetNode streetNode);","GameBoardVertex(GameBoardVertex neighbor){this.neighbors.add(neighbor);}","private Point backtrack(Point p){\n\t\t// coordinates of the point\n\t\tint x = (int)p.getX();\n\t\tint y = (int)p.getY();\n\t\t// neigh hold the return value\n\t\tPoint neigh= p;\n\t\t// the lowest score\n\t\tint score=10000;\n\t\t// look at all the neighbor and compare them\n\t\tif(x>0\t && topology[x-1][y]>=0){\n\t\t\tscore = topology[x-1][y];\n\t\t\tneigh = new Point(x-1,y);\n\t\t}\n\t\tif(x<row-1 && topology[x+1][y]>=0 && score > topology[x+1][y]) {\n\t\t\tscore = topology[x+1][y];\n\t\t\tneigh = new Point(x+1,y);\n\t\t}\n\t\tif(y<col-1 && topology[x][y+1]>=0 && score > topology[x][y+1]) {\n\t\t\tscore = topology[x][y+1];\n\t\t\tneigh = new Point(x,y+1);\n\t\t}\n\t\tif(y>0 && topology[x][y-1]>=0 && score > topology[x][y-1]) {\n\t\t\tscore = topology[x][y-1];\n\t\t\tneigh = new Point(x,y-1);\n\t\t}\n\t\treturn neigh;\n\t}","public GameList getSearchResult(){ return m_NewSearchResult;}","public MapGraphExtra()\n\t{\n\t\t// TODO: Implement in this constructor in WEEK 3\n\t\tmap = new HashMap<GeographicPoint, MapNode> ();\n\t}","public static Map<Integer, Boolean> InitializeVisited() {\n\t\tMap<Integer, Boolean> visited = new HashMap<Integer, Boolean>();\r\n\t\tfor (Entry<Integer, Vertex> currentVertex : vertexes.entrySet())\r\n\t\t\tvisited.put(currentVertex.getKey(), false);\r\n\t\treturn visited;\r\n\t}","public Shard getLowerNeighbor() {\r\n double middleLat = south + Math.abs(north - south) / 2;\r\n double nextLat = middleLat - Math.abs(north - south);\r\n\r\n return new Shard(new Coordinates(nextLat, coordinates.getLon()), zoom);\r\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 }","public void previous() {\n if (highlight.getMatchCount() > 0) {\n Point point = highlight.getPreviousMatch(cursor.getY(), cursor.getX());\n if (point != null) {\n cursor.moveTo(point);\n }\n return;\n }\n Point point = file.getPreviousModifiedPoint(cursor.getY(), cursor.getX());\n if (point != null) {\n cursor.moveTo(point);\n }\n }","public Vertex getFrom() {\r\n\r\n return from;\r\n }","protected void streetLoc(LatLng latLng) {\n if (latLng == null) {\n return;\n }\n TencentSearch tencentSearch = new TencentSearch(this);\n //还可以传入其他坐标系的坐标，不过需要用coord_type()指明所用类型\n //这里设置返回周边poi列表，可以在一定程度上满足用户获取指定坐标周边poi的需求\n Geo2AddressParam geo2AddressParam = new Geo2AddressParam(latLng).getPoi(true)\n .setPoiOptions(new Geo2AddressParam.PoiOptions()\n// .setRadius(1000).setCategorys(\"面包\")\n .setPolicy(Geo2AddressParam.PoiOptions.POLICY_O2O));\n tencentSearch.geo2address(geo2AddressParam, new HttpResponseListener<BaseObject>() {\n\n @Override\n public void onSuccess(int arg0, BaseObject arg1) {\n if (arg1 == null) {\n return;\n }\n Geo2AddressResultObject obj = (Geo2AddressResultObject)arg1;\n StringBuilder sb = new StringBuilder();\n sb.append(\"逆地址解析\");\n sb.append(\"\\n地址：\" + obj.result.address);\n sb.append(\"\\npois:\"+obj.result.address_component.province+obj.result.address_component.city+obj.result.address_component.district);\n// provinceMap.put()\n province1 = provinceMap.get(obj.result.address_component.province+obj.result.address_component.city+obj.result.address_component.district);\n if(province1 == null) {\n provinceMap.put(obj.result.address_component.province+obj.result.address_component.city+obj.result.address_component.district,obj.result.address_component.province+obj.result.address_component.city+obj.result.address_component.district);\n getStreet(obj.result.address_component.province, obj.result.address_component.city, obj.result.address_component.district);\n }\n\n// for (Poi poi : obj.result.pois) {\n// sb.append(\"\\n\\t\" + poi.title);\n// tencentMap.addMarker(new MarkerOptions()\n// .position(poi.latLng) //标注的位置\n// .title(poi.title) //标注的InfoWindow的标题\n// .snippet(poi.address) //标注的InfoWindow的内容\n// );\n// }\n// Log.e(\"test\", sb.toString());\n }\n\n @Override\n public void onFailure(int arg0, String arg1, Throwable arg2) {\n Log.e(\"test\", \"error code:\" + arg0 + \", msg:\" + arg1);\n }\n });\n }","public void onMapSearch(View view) {\n\n EditText locationSearch = (EditText) findViewById(R.id.arrival);\n String location = locationSearch.getText().toString();\n List<Address>addressList = null;\n\n if (location != null || !location.equals(\"\")) {\n Geocoder geocoder = new Geocoder(this);\n try {\n addressList = geocoder.getFromLocationName(location, 1);\n\n } catch (IOException e) {\n Toast.makeText(this,\"Destination not found\",Toast.LENGTH_SHORT).show();\n\n }\n Address address = addressList.get(0);\n LatLng latLng = new LatLng(address.getLatitude(), address.getLongitude());\n MarkerPoints.add(latLng);\n Toast.makeText(MapsActivity.this,\"added position 2 \"+MarkerPoints.size(),Toast.LENGTH_SHORT).show();\n\n mMap.addMarker(new MarkerOptions().position(latLng).draggable(true).title(location+\" (\"+address.getLatitude()+\",\"+address.getLongitude()+\")\").icon(BitmapDescriptorFactory.fromResource(R.drawable.flag)));\n mMap.animateCamera(CameraUpdateFactory.newLatLngZoom(latLng,16));\n //listClients.add(new Client(R.drawable.flag,\"Nasser\",\"client2 requesting cab\",100,address.getLatitude(), address.getLongitude()));\n //Toast.makeText(MapsActivity.this,\"client attended at \"+\" (\"+address.getLatitude()+\",\"+address.getLongitude()+\")\",Toast.LENGTH_SHORT).show();\n\n\n\n /* if (MarkerPoints.size() > 2) {\n // MarkerPoints.clear();\n mMap.clear();\n }*/\n\n\n // Checks, whether start and end locations are captured\n if (MarkerPoints.size() >= 2) {\n LatLng origin = MarkerPoints.get(0);\n LatLng dest = MarkerPoints.get(MarkerPoints.size()-1);\n\n // Getting URL to the Google Directions API\n String url = getUrl(origin, dest);\n Log.d(\"onMapClick\", url.toString());\n FetchUrl FetchUrl = new FetchUrl();\n\n // Start downloading json data from Google Directions API\n FetchUrl.execute(url);\n //move map camera\n //mMap.moveCamera(CameraUpdateFactory.newLatLng(origin));\n //mMap.animateCamera(CameraUpdateFactory.zoomTo(11));\n\n build_retrofit_and_get_response(\"driving\");\n\n final View mapView = getSupportFragmentManager().findFragmentById(R.id.map).getView();\n if (mapView.getViewTreeObserver().isAlive()) {\n mapView.getViewTreeObserver().addOnGlobalLayoutListener(new ViewTreeObserver.OnGlobalLayoutListener() {\n @SuppressLint(\"NewApi\")\n @Override\n public void onGlobalLayout() {\n LatLngBounds.Builder bld = new LatLngBounds.Builder();\n for (int i = 0; i < MarkerPoints.size(); i++) {\n LatLng ll = new LatLng(MarkerPoints.get(i).latitude, MarkerPoints.get(i).longitude);\n bld.include(ll);\n }\n LatLngBounds bounds = bld.build();\n mMap.moveCamera(CameraUpdateFactory.newLatLngBounds(bounds, 70));\n mapView.getViewTreeObserver().removeGlobalOnLayoutListener(this);\n\n }\n });\n }\n }\n\n }\n }","public CustomGraphSearch(boolean bInsertFront) {\n\tSystem.out.println(\"bInsertFront: \" + bInsertFront);\n\tinsertFront = bInsertFront;\n }","public HashMap<Integer, Integer> findAugumentPath() {\n if (debug == 1) printFree();\n HashMap<Integer, Integer> Path = new HashMap<>();\n if (V1.isEmpty() || V2.isEmpty()) {\n if (debug == 1) System.out.println(\"V1||V2 is empty\");\n return Path;\n }\n\n GM.clearAllEdge();\n for (int i = 0; i < x.length; i++) {\n for (int j : x[i].getDomain()) {\n GM.addEdge(i, Map.get(j));\n }\n }\n GM.adjList[X].clear();\n for (int i : V1) {\n GM.addEdge(X, i);\n }\n for (int i = 0; i < x.length; i++) {\n if (MaxMatch[i] != 0) GM.addEdge(MaxMatch[i], i);\n }\n if (debug == 1) System.out.println(GM);\n\n // DFS từ X. Gặp 1 đỉnh thuộc V2 thì break\n boolean[] visited = new boolean[nbOfVertex + 10];\n int[] prev = new int[nbOfVertex + 10];\n prev[X] = -1;\n int last = -1;\n\n Stack<Integer> S = new Stack<>();\n S.push(X);\n while (!S.isEmpty() && last == -1) {\n int top = S.pop();\n //System.out.println(\"Popped \" + top);\n if (!visited[top]) {\n visited[top] = true;\n for (int next : GM.adjList[top])\n if (!visited[next]) {\n prev[next] = top;\n if (V2.contains(next)) {\n last = next;\n //System.out.println(\"Here \" + next);\n break;\n }\n S.push(next);\n //System.out.println(\"Pushed \" + next);\n }\n }\n }\n if (last == -1) {\n //System.out.println(\"Cant find any augument path\\n\");\n } else {\n //System.out.println(\"Constructing augument path\");\n //int step = 0;\n while (last != -1) {\n int from = prev[last];\n if (from == X) break;\n Path.put(from, last);\n ////System.out.println(Math.min(from, last) + \" --> \" + Math.max(from, last));\n last = from;\n //step++;\n //if(step>10) break;\n }\n if (debug == 1) System.out.println(\"Construct augument path completed \" + Path.size());\n if (debug == 1) printCurrentAugumentPath(Path);\n }\n //System.out.println(Path.size());\n return Path;\n }","Vertex addVertex(String name){\n\t\t//if graph doesn't already have the key\n\t\tif (!adjlist.containsKey(name)) {\n\t\t\tkeys.add(name); //places keys in list in order they're added\n\t\t\tvertices++; //increases vertex count variable\n\t\t\treturn adjlist.put(name, new Vertex(name)); //adds to hashmap\n\t\t//if graph does already have the key\n\t\t} else {\n\t\t\treturn adjlist.get(name);\n\t\t}\n\t}","public Road(Town source, Town destination, String name) {\r\n\t\tthis.source = source;\r\n\t\tthis.destination = destination;\r\n\t\tthis.vertices = new HashSet<Town>();\r\n\t\tvertices.add(source);\r\n\t\tvertices.add(destination);\r\n\t\t\r\n\t\tthis.name = name;\r\n\t}","@Override\n public boolean AddTraversalStreet(Street street) {\n boolean follows = false;\n if(streets.size() == 0) {\n follows = true;\n } else {\n for (Street s : streets) {\n if (s.follows(street)) {\n follows = true;\n break;\n }\n }\n }\n if(!follows) {\n return false;\n }\n if(!streets.contains(street))\n streets.add(street);\n return true;\n }","public void findStreets() {\r\n\t\tpolygonMap.resetStreets();\r\n\t\tpolygonMap.setCurrentPlayerID(client.getSettler().getID());\r\n\t\tfor (int i = 0; i < island.getRoads().length; i++) {\r\n\t\t\tif (buildStreetIsAllowed(island.getRoads()[i])\r\n\t\t\t\t\t&& !isWaterStreet(island.getRoads()[i])) {\r\n\t\t\t\tpolygonMap.addStreet(i);\r\n\t\t\t}\r\n\t\t}\r\n\t}","public Town getVertex(String name) {\n\t\tfor (Town t : towns) {\n\t\t\tif (t.getName().equals(name)) {\n\t\t\t\treturn t;\n\t\t\t}\n\t\t}\n\t\treturn null;\n\t}","@Override\n public PointInPath getLastRoutePointBeforeCoordinate(Street street, Coordinate coord) {\n for(int r_index = currRouteIndex; r_index<=routes.size()-1; r_index++) {\n Route r = routes.get(r_index);\n\n // iterate through the route\n for(int i=0; i<r.getRoute().size()-1; i++) {\n PointInPath p1 = r.getRoute().get(i);\n PointInPath p2 = r.getRoute().get(i+1);\n\n if(p1.getStreet().getId().equals(street.getId())) {\n if(Math2D.isLocatedBetweenPoints(coord, p1.getCoordinate(), p2.getCoordinate())) {\n if(r_index != currRouteIndex) {\n // return last route point that is already a part of the street\n return new PointInPath(r, p1.getStreet(), p1.getCoordinate());\n } else {\n // returned route point is the vehicle's position\n Coordinate vehiclePos = getPosition(progressTowardsNextStop);\n if(Math2D.isLocatedBetweenPoints(vehiclePos, p1.getCoordinate(), coord)) {\n PointInPath currVehiclePoint = new PointInPath(r, p1.getStreet(), vehiclePos);\n r.getRoute().add(i+1, currVehiclePoint);\n\n return currVehiclePoint;\n }\n }\n }\n }\n }\n }\n return null;\n }","public Street (SimpleMap roadMap) {\n if (roadMap != null) roadMap.addToMap(this);\n }","public void makeVertexUp( String sourceName)\n {\n Vertex v = vertexMap.get( sourceName );\n if(v!=null)\n \tv.isDown =false;\n else\n \tSystem.out.println(\"Invalid vertex\");\n \n \n // v.weightnext.put(w.name,(Double) distance);\n }","void testSearches(Tester t) {\n Vertex v1 = new Vertex(10, 10);\n Vertex v2 = new Vertex(10, 11);\n Vertex v3 = new Vertex(10, 12);\n\n Edge e1 = new Edge(v1, v2, 1);\n Edge e2 = new Edge(v2, v3, 1);\n\n IList<Vertex> map = new Cons<Vertex>(v1, new Cons<Vertex>(v2, new Cons<Vertex>(\n v3, new Empty<Vertex>())));\n\n Player player = new Player(map);\n DepthFirst dp = new DepthFirst(map);\n BreadthFirst bp = new BreadthFirst(map);\n\n t.checkExpect(player.current, v1);\n t.checkExpect(player.finished, false);\n\n t.checkExpect(bp.hasNext(), true);\n t.checkExpect(bp.next(), new Queue<Vertex>());\n\n t.checkExpect(dp.hasNext(), true);\n t.checkExpect(dp.next(), new Stack<Vertex>());\n\n t.checkExpect(player.move(true, e1), v2);\n\n t.checkExpect(player.current, v2);\n t.checkExpect(player.finished, false);\n\n t.checkExpect(bp.hasNext(), false);\n t.checkExpect(bp.next(), v3);\n\n t.checkExpect(dp.hasNext(), false);\n t.checkExpect(dp.next(), v3);\n\n t.checkExpect(player.move(true, e2), v3);\n\n player.finished = true;\n\n t.checkExpect(player.current, v3);\n t.checkExpect(player.finished, true);\n\n Queue<Vertex> q = new Queue<Vertex>(map);\n\n q.enqueue(new Vertex(5, 5));\n\n Deque<Vertex> dq = new Deque<Vertex>();\n dq.addAtHead(v1);\n dq.addAtTail(v2);\n dq.addAtTail(new Vertex(5, 5));\n\n\n t.checkExpect(q.isEmpty(), false);\n t.checkExpect(q.contents, dq);\n\n Stack<Vertex> stack = new Stack<Vertex>(map);\n\n t.checkExpect(stack.isEmpty(), false);\n dq.removeFromHead();\n t.checkExpect(stack.pop(), dq);\n\n t.checkExpect(dp.next(), v2);\n t.checkExpect(bp.hasNext(), true);\n\n }","@Override\r\n public Iterable<V> neighbors(V vertexName) {\r\n try {\r\n Iterator<Vertex> vertexIterator = map.values().iterator();\r\n while(vertexIterator.hasNext()) {\r\n Vertex v = vertexIterator.next();\r\n if(vertexName.compareTo(v.vertexName) == 0)\r\n return v.destinations;\r\n }\r\n vertexIterator.next();\r\n return null;\r\n }\r\n catch(NoSuchElementException e) {\r\n throw e;\r\n }\r\n }","public Queue<Vertex> next() {\n\n Vertex u = lov.dequeue();\n for (Edge e : u.outEdges) {\n if (!e.to.visited) {\n cameFromEdge.put(e.to.toIdentifier(), e.from);\n if (e.to.x == MazeWorld.width - 1 && e.to.y == MazeWorld.height - 1) {\n reconstruct(cameFromEdge, e.to);\n lov = new Queue<Vertex>();\n }\n else {\n e.to.visited = true;\n lov.enqueue(e.to);\n }\n }\n }\n return lov;\n }","public VertexIterator(Iterator<PointF> source)\n {\n this.source = source;\n }","Vertex(int id, Vertex prev, int costToReach) {\n this.id = id;\n this.prev = prev;\n this.costToReach = costToReach;\n }","private Iterable<V> reconstructPath(V last, V from, HashMap<V, V> previous){\n LinkedList<V> ret = new LinkedList<>();\n ret.addFirst(last);\n while (!last.equals(from)){\n V prev = previous.get(last);\n ret.addFirst(prev);\n last = prev;\n }\n return ret;\n }","private static <T> Map<Character,Node<T>> newNodeMap(Map<Character,Node<T>> prev)\n\t\t{\n\t\t\treturn new HashMap<Character,Node<T>>(prev);\n\t\t}","private void buildMap(VLongArrayListWritable currentVertexValue) {\n verticesMap.clear();\n \n // add vertex ID itself\n verticesMap.put(getVertexId().get(), 1l);\n \n // add IDs of its neighbors\n for (Edge<VLongWritable, IntWritable> edge : getEdges()) {\n verticesMap.put(edge.getDestVertexId().get(), 1l);\n }\n \n // add current results IDs from the vertex value\n if (currentVertexValue == null) {\n return;\n }\n for (int i = 0; i < currentVertexValue.size(); i++) {\n long vid = ((VLongWritable) currentVertexValue.get(i)).get();\n if (!verticesMap.containsKey(vid)) {\n verticesMap.put(vid, 1l);\n }\n }\n }","public void startSearch() {\n if (solving) {\n Alg.Dijkstra();\n }\n pause(); //pause state\n }","public TopologicalIterator() {\n fringe = new Stack<Integer>();\n edgeCopy = new LinkedList[myAdjLists.length];\n int count = 0;\n for (LinkedList l : myAdjLists) {\n \tLinkedList toAdd = new LinkedList();\n \tfor (Object e : l) {\n \t\ttoAdd.add(e);\n \t}\n \tedgeCopy[count] = toAdd;\n \tcount++;\n }\n for (int i = 0; i < myVertexCount; i++) {\n \tif (inDegreeCopy(i, edgeCopy) == 0) {\n \t\tfringe.add(i);\n \t}\n }\n alreadyReturned = new ArrayList<Integer>();\n // more statements go here\n }","public MapSearchViewer() {\n initComponents();\n listPoints = new ArrayList<>(); \n listId_stanice = new ArrayList<>();\n\n\t// load the filtered objects from a db.\n try {\n loadFilteredObjectFromDb();\n } catch (Exception e) {\n e.printStackTrace();\n } \n }","void stateBacktracked (Search search);","public Town getTargetVertex(Town sourceVertex) {\r\n\t\tfor(Town town: vertices) {\r\n\t\t\tif(!town.equals(sourceVertex)) {\r\n\t\t\t\treturn town;\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\treturn null;\r\n\t}","@Override\n\tpublic List<Path> getShortestRoute(Location src, Location dest, String edgePropertyName) {\n\t\t//array to keep track of visited vertexes\n\t\tboolean[] visited = new boolean[locations.size()];\n\t\t//array to store weights\n\t\tdouble[] weight = new double[locations.size()];\n\t\t//array to store predecessors\n\t\tLocation[] pre = new Location[locations.size()];\n\t\t//creates priority queue\n\t\tPriorityQueue<LocWeight> pq = new PriorityQueue<LocWeight>();\n\t\t// initializes every vertex misted mark to false\n\t\tfor (int i = 0; i < visited.length; i++)\n\t\t\tvisited[i] = false;\n\t\t// initializes every vertex's total weight to infinity\n\t\tfor (int i = 0; i < weight.length; i++)\n\t\t\tweight[i] = Double.POSITIVE_INFINITY;\n\t\t// initializes every vertex's predecessor to null\n\t\tfor (int i = 0; i < pre.length; i++)\n\t\t\tpre[i] = null;\n\t\t//sets start vertex's total weight to 0\n\t\tweight[locations.indexOf(src)] = 0;\n\t\t//insert start vertex in priroty queue\n\t\tpq.add(new LocWeight(src, 0.0));\n\t\t\n\t\tString[] edgeNames = getEdgePropertyNames();\n\t\tint indexProp = 0;\n\t\tfor (int i = 0; i < edgeNames.length; i++) {\n\t\t\tif (edgeNames[i].equalsIgnoreCase(edgePropertyName))\n\t\t\t\tindexProp = i;\n\t\t}\n\t\twhile (!pq.isEmpty()) {\n\t\t\tLocWeight c = pq.remove();\n\t\t\t//set C's visited mark to true\n\t\t\tvisited[locations.indexOf(c)] = true;\n\n\t\t\tList<Location> neighbors = getNeighbors(c.getLocation());\n\t\t\t//for each unvisited successor adjacent to C\n\t\t\tfor (int i = 0; i < neighbors.size(); i++) {\n\t\t\t\tif (visited[locations.indexOf(neighbors.get(i))] == false) {\n\t\t\t\t\t//change successor's total weight to equal C's weight + edge weight from C to successor\n\t\t\t\t\tweight[locations.indexOf(neighbors.get(i))] = c.getWeight() + getEdgeIfExists(c.getLocation(), neighbors.get(i)).getProperties().get(indexProp);\n\t\t\t\t\tpre[locations.indexOf(neighbors.get(i))] = c.getLocation();\n\t\t\t\t\tLocWeight succ = new LocWeight(neighbors.get(i), weight[locations.indexOf(neighbors.get(i))]);\n\t\t\t\t\t//if successor is already in pq, update its total weight\n\t\t\t\t\tif (pq.contains(succ)) {\n\t\t\t\t\t\tpq.remove(succ);\n\t\t\t\t\t}\n\t\t\t\t\t//if not already there, add\n\t\t\t\t\tpq.add(succ);\n\n\t\t\t\t}\n\n\t\t\t}\n\t\t\t\n\t\t\t\n\n\n\t\t}\n\t\t\n\t\tArrayList<Path> path = new ArrayList<Path>();\n\t\t//find predecessor of each vertex and construct shortest path then return it\n\t\tLocation curr1 = dest;\n\t\twhile (pre[locations.indexOf(curr1)] != null) {\n\t\t\tpath.add(getEdgeIfExists(pre[locations.indexOf(curr1)], curr1));\n\t\t\tcurr1 = pre[locations.indexOf(curr1)];\n\t\t}\n\t\t//to show path from the start\n\t\tfor (int i = path.size() - 1; i >= 0; i--)\n\t\t\tpath.add(path.remove(i));\n\n\n\t\treturn path;\n\t}","@Override\n public Iterable<V> adjacentTo(V from)\n {\n if (from.equals(null)){\n throw new IllegalArgumentException();\n }\n Iterator graphIterator = graph.entrySet().iterator();\n \t Map.Entry graphElement = (Map.Entry) graphIterator.next();\n \t V vert = (V)graphElement.getKey();\n \t while (graphIterator.hasNext() && vert != from){\n \t\tgraphElement = (Map.Entry) graphIterator.next();\n \t\tvert = (V)graphElement.getKey();\n \t }\n \t ArrayList <V> edges = graph.get(vert);\n \t //Iterable <V> e = edges;\n \t return edges;\n }","public Vertex<VV> getFrom()\r\n { return from; }","private Vertice getVertex(String name) {\r\n Vertice v = (Vertice) vertices.get(name);\r\n if (v == null) {\r\n v = new Vertice(name);\r\n vertices.put(name, v);\r\n }\r\n return v;\r\n }","public PathFinder(PathStore store, Tile from, Tile to, boolean bGetToNeighbor){\r\n \t// this.store = store;\r\n \tthis.map = store.getMap();\r\n \t// this.tileFrom = from;\r\n \tthis.tileTo = to;\r\n \tthis.bGetToNeighbor = bGetToNeighbor;\r\n }","void getVertices() {\r\n\t\tSystem.out.println(\"Enter your vertices:\");\r\n\t\tarrIndexToVertexMap = new HashMap<>();\r\n\t\ttry {\r\n\t\t\tfor (int i = 0; i < numberOfVertices; i++) {\r\n\t\t\t\tarrIndexToVertexMap.put(i, sc.next());\r\n\t\t\t}\r\n\t\t\tsc.close();\r\n\t\t} catch (RuntimeException re) {\r\n\t\t\tSystem.out.println(\"Error at method:: getVertices || Description:\" + re);\r\n\t\t}\r\n\t}","public Vertex getVertex(String place)\n\t{\n\t\treturn vertices.get(place);\n\t}","public void previousSolution() {\r\n\t\tif (solutionIndex > 0) {\r\n\t\t\tsolutionIndex--;\r\n\t\t\tcreateObjectDiagram(solutions.get(solutionIndex));\r\n\t\t} else {\r\n\t\t\tLOG.info(LogMessages.pagingFirst);\r\n\t\t}\r\n\t}","void stateStored (Search search);","public Vertex(String aName)\r\n\t\t{\r\n\t\t\tthis.name = aName;\r\n\t\t\tthis.neighbors = new ArrayList<Edge>();\r\n\t\t}","public wVertex(String s){\r\n name = s;\r\n adjacencies = new ArrayList<Edge>();\r\n }","Set<Edge> getIncomingNeighborEdges(boolean onUpwardPass) {\n//\t\t\tif(_outgoingEdges.size() == 0) { // only compute if we have to\n\t\t\t\tSet<Edge> outgoingEdges = new HashSet<Edge>();\n\t\t\t\tIterator<Edge> it = _neighborEdges.keySet().iterator();\n\t\t\t\twhile(it.hasNext()) {\n\t\t\t\t\tEdge e = it.next();\n\t\t\t\t\tVertex v = e.getOtherVertex(this);\n\t\t\t\t\tif(this._orderID == UNMARKED) {\n\t\t\t\t\t\tSystem.err.println(\"whoops i am unmarked\");\n\t\t\t\t\t}\n\t\t\t\t\tif(v._orderID == UNMARKED) {\n\t\t\t\t\t\tSystem.err.println(\"whoops neighbor unmarked\");\n\t\t\t\t\t}\n\t\t\t\t\tif(this._orderID < v._orderID) {\n\t\t\t\t\t\toutgoingEdges.add(e);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t_outgoingEdges = outgoingEdges;\n//\t\t\t}\n//\t\t\treturn _outgoingEdges;\n\t\t\t\treturn outgoingEdges;\n\t\t}","public Vertex( String nm )\n { name = nm; adjEdge = new TreeMap<String,Edge>( ); reset( ); }","public void setPreviousHop(int previousHop) {\n this.previousHop = previousHop;\n }","public AStarNode getPrevious() {\n return previous;\n }","private void addAllNeighbours(@NonNull final Location searchLoc) {\n for (int x = -1; x < 2; x++) {\n for (int y = -1; y < 2; y++) {\n if ((x == 0) && (y == 0)) {\n continue;\n }\n final long foundKey = Location.getKey(searchLoc.getScX() + x, searchLoc.getScY() + y,\n searchLoc.getScZ());\n synchronized (unchecked) {\n if (!unchecked.contains(foundKey)) {\n unchecked.add(foundKey);\n }\n }\n }\n }\n \n final long foundKey = Location.getKey(searchLoc.getScX(), searchLoc.getScY(), searchLoc.getScZ() + 1);\n synchronized (unchecked) {\n if (!unchecked.contains(foundKey)) {\n unchecked.add(foundKey);\n }\n }\n }","public Intersection(Stoplight s, Point p) {\n\t\troads = new ArrayList<Road>();\n\t\tstoplight = s;\n\t\tcurrentCar = null;\n\t\tpos = p;\n\t}","private List<String> searchByDijkstra(Vertex starting, String end ,Map<String, Vertex> verticesWithDistance) {\n\t\tSet<Vertex> visited = new HashSet<Vertex>();\n\t\tPriorityQueue<Vertex> pq = new PriorityQueue<Vertex>();\n\t\tpq.offer(starting);\n\t\twhile (!pq.isEmpty()) {\n\t\t\tVertex v = pq.poll();\n\t\t\tif (v.name.equals(end))\n\t\t\t\treturn v.route;\n\t\t\tif (!visited.contains(v))\n\t\t\t\tvisited.add(v);\n\t\t\telse\n\t\t\t\tcontinue;\n\t\t\tfor (String n : neighbors.get(v.name)) {\n\t\t\t\tint newDistance = v.distance + edges.get(v.name + \" \" + n);\n\t\t\t\tVertex nextVertex = verticesWithDistance.get(n);\n\t\t\t\tif (nextVertex.distance == -1 || newDistance < nextVertex.distance) {\n\t\t\t\t\tnextVertex.distance = newDistance;\n\t\t\t\t\tnextVertex.route = new LinkedList<String>(v.route);\n\t\t\t\t\tnextVertex.route.add(nextVertex.name);\n\t\t\t\t}\n\t\t\t\tpq.offer(nextVertex);\n\t\t\t}\n\t\t}\n\t\treturn null;\n\t}","public String getNearestStreet() {\n String nearestStreet = \"null\";\n CollisionResults results = new CollisionResults();\n float closestDistance = 101f;\n for(float xDir = -1; xDir <= 1; xDir += .1f) {\n for(float yDir = -1; yDir <= 1; yDir += .1f) {\n for(float zDir = -1; zDir <= 1; zDir += .1f) { \n Ray ray = new Ray(loc, new Vector3f(xDir, yDir, zDir));\n world.collideWith(ray, results);\n for (int i = 0; i < results.size(); i++) {\n float dist = results.getCollision(i).getDistance();\n String name = results.getCollision(i).getGeometry().getParent().getName();\n if (name.startsWith(\"R_\") && dist <= 100 && dist < closestDistance) {\n nearestStreet = name;\n closestDistance = dist;\n }\n }\n }\n }\n }\n\n return nearestStreet;\n \n }","private Cell breadthFirstSearch(WorldMap worldMap, Cell startCell, CELLTYPE goalType, Hashtable<Cell, Cell> prev) {\n\n\t\t// Using markedSet to avoid re-checking already visited nodes\n\t\tHashSet<Cell> markedSet = new HashSet<Cell>();\n\t\tLinkedList<Cell> queue = new LinkedList<Cell>();\n\n\t\tmarkedSet.add(startCell);\n\t\tqueue.add(startCell);\n\n\t\twhile (!queue.isEmpty()) {\n\t\t\tCell cell = queue.remove();\n\t\t\tif (cell.getCellType() == goalType)\n\t\t\t\treturn cell;\n\t\t\tLinkedList<Cell> neighbors = generateSuccessors(worldMap, cell, goalType);\n\n\t\t\t/*\n\t\t\t * If looking for unexplored, shuffle list. Since the neighbors are\n\t\t\t * always returned NESW, it's best to shuffle the list if ant wants\n\t\t\t * to explore a random portion of the map.\n\t\t\t */\n\t\t\tif (goalType == CELLTYPE.UNEXPLORED)\n\t\t\t\tCollections.shuffle(neighbors, new Random(System.currentTimeMillis()));\n\n\t\t\tfor (Cell neighbor : neighbors)\n\t\t\t\tif (!markedSet.contains(neighbor)) {\n\t\t\t\t\tmarkedSet.add(neighbor);\n\t\t\t\t\tqueue.add(neighbor);\n\t\t\t\t\tprev.put(neighbor, cell);\n\t\t\t\t}\n\t\t}\n\t\t// If reached here, goal type doesn't exist\n\t\treturn null;\n\t}","public K prev();","public E getPrevEdge()\r\n/* */ {\r\n/* 178 */ return (E)this.prevEdge;\r\n/* */ }","@Override\n protected void onActivityResult(int requestCode, int resultCode, Intent data) {\n super.onActivityResult(requestCode, resultCode, data);\n if (requestCode == RESULT_CODE_SEARCH) {\n if (resultCode == Activity.RESULT_OK) {\n String street_name;\n String street_number;\n String meter_number;\n try {\n street_name = data.getStringExtra(\"street_name\");\n street_number = data.getStringExtra(\"street_number\");\n meter_number = data.getStringExtra(\"meter_number\");\n } catch (Exception e) {\n e.printStackTrace();\n return;\n }\n\n ArrayList<model_pro_mr_route_rows> rows = new ArrayList<>();\n for (MeterReaderController.Keys rid : MeterReaderController.route_row_keys) {\n rows.add(\n DBHelper.pro_mr_route_rows.getRouteRow(rid.getInstNode_id(),\n rid.getMobnode_id(),\n rid.getCycle(),\n rid.getRoute_number(),\n rid.getMeter_id(),\n rid.getWalk_sequence()));\n }\n\n //We have a meter number, only on record will have the entry\n if (!meter_number.isEmpty()) {\n for (model_pro_mr_route_rows r : rows) {\n if ((r.getMeter_number().compareToIgnoreCase(meter_number) == 0)) {\n setCurrentFragmentView(\n new MeterReaderController.Keys(r.getCycle(),\n r.getInstNode_id(),\n r.getMeter_id(),\n r.getMobnode_id(),\n r.getRoute_number(),\n r.getWalk_sequence()));\n return;\n }\n }\n }\n\n //We have a complete address\n if (!street_name.isEmpty() & !street_number.isEmpty()) {\n for (model_pro_mr_route_rows r : rows) {\n if ((r.getAddress_name().compareToIgnoreCase(street_name) == 0) &\n (r.getStreet_number().compareToIgnoreCase(street_number) == 0)) {\n setCurrentFragmentView(\n new MeterReaderController.Keys(r.getCycle(),\n r.getInstNode_id(),\n r.getMeter_id(),\n r.getMobnode_id(),\n r.getRoute_number(),\n r.getWalk_sequence()));\n return;\n }\n }\n }\n\n //We have a street name but no number\n if (!street_name.isEmpty()) {\n for (model_pro_mr_route_rows r : rows) {\n if (r.getAddress_name().compareToIgnoreCase(street_name) == 0) {\n setCurrentFragmentView(\n new MeterReaderController.Keys(r.getCycle(),\n r.getInstNode_id(),\n r.getMeter_id(),\n r.getMobnode_id(),\n r.getRoute_number(),\n r.getWalk_sequence()));\n return;\n }\n }\n }\n\n //We have a street number but no nname\n if (!street_number.isEmpty()) {\n for (model_pro_mr_route_rows r : rows) {\n if (r.getStreet_number().compareToIgnoreCase(street_number) == 0) {\n setCurrentFragmentView(\n new MeterReaderController.Keys(r.getCycle(),\n r.getInstNode_id(),\n r.getMeter_id(),\n r.getMobnode_id(),\n r.getRoute_number(),\n r.getWalk_sequence()));\n }\n }\n }\n }\n }\n }","public interface SearchSolver {\n\n /**\n * initializes the algorithm. This method has to be called before calling any other method\n * @param graph the graph of the map where the search takes place\n * @param targetStart the start position for the target (in our case the thief)\n * @param searchStart the start position for the searcher (in our case the police)\n * @param counter the counter object that counts the expanded nodes\n */\n void initialize(Graph graph, Node targetStart, Node searchStart, ExpandCounter counter);\n\n /**\n * gets the shortest path from search start to target\n * @return list of edges that describe the path\n * @throws NoPathFoundException if there is no path to the target\n */\n List<Edge> getPath() throws NoPathFoundException;\n}","public MinimumTrialsSourceToDestWord()\n {\n nodeList = new HashMap<T, GraphNode>();\n }","public void previous();","private Node locatePrevNode(K key) { \n\t\tNode p = null; \n\t\tNode current = first; \n\t\twhile (current != null && current.getData().getKey().compareTo(key) < 0) {\n\t\t\tp = current; \n\t\t\tcurrent = current.getNext(); \n\t\t}\n\t\treturn p; \n\t}","public Road(Town source, Town destination, int weight, String name) {\r\n\t\tthis.source = source;\r\n\t\tthis.destination = destination;\r\n\t\tthis.vertices = new HashSet<Town>();\r\n\t\tvertices.add(source);\r\n\t\tvertices.add(destination);\r\n\t\t\r\n\t\tthis.weight = weight;\r\n\t\tthis.name = name;\r\n\t\t\r\n\t}","@Override\r\n public void add(V vertexName) {\r\n if(!contains(vertexName))\r\n map.put(vertexName, new Vertex(vertexName));\r\n }","public void setPrevious(DSAGraphNode<E> inPrevious)\n {\n previous = inPrevious;\n }","public DijkstraSP(EdgeWeightedDigraph G, int s, Map<Integer, Site> siteMap) {\n \tthis.G = G;\n \tthis.siteMap = siteMap;\n distTo = new double[G.V()];\n edgeTo = new SiteEdge[G.V()];\n for (int v = 0; v < G.V(); v++)\n distTo[v] = Double.POSITIVE_INFINITY;\n distTo[s] = 0.0;\n\n // relax vertices in order of distance from s\n pq = new IndexMinPQ<Double>(G.V());\n pq.insert(s, distTo[s]);\n while (!pq.isEmpty()) {\n int v = pq.delMin();\n for (SiteEdge e : G.adj(v)){\n relax(e);\n }\n }\n }","@Override\n public Vertex getSource() {\n return sourceVertex;\n }","private void search(final Map<String, Integer> routes, Vertex current, Vertex finishVertex, int maxDistance, String currentRoute, int currentDistance) {\r\n if(current == finishVertex) {\r\n routes.put(currentRoute, currentDistance);\r\n }\r\n for(Edge e : current.getIncidentEdges()) {\r\n if(e.getDistance() + currentDistance <= maxDistance)\r\n search(routes, e.getOppositeVertex(current), finishVertex, maxDistance, currentRoute + e.getOppositeVertex(current).getName(), e.getDistance() + currentDistance);\r\n }\r\n }","Object previous();","private Route calculate(String fromStation, String toStation) {\n\t\tif (stations==null){\r\n\t\t\tSystem.out.println(\"DEBUG RUN OF DIJKSTRA.\");\r\n\t\t\tstations = new ArrayList<Station>();\r\n\t\t\tcreateDebugMap(stations);\r\n\t\t}\r\n\r\n\t\t/**\r\n\t\t * Check if the stations exists\r\n\t\t */\r\n\t\tStation startStation = null, endStation = null;\r\n\r\n\t\t// Find starting station\r\n\t\tfor (Station thisStation : stations) {\r\n\t\t\tif (thisStation.stationName.equals(fromStation)) {\r\n\t\t\t\tSystem.out.println(\"Found startStaion in the Database\");\r\n\t\t\t\tstartStation = thisStation;\r\n\t\t\t}\r\n\t\t\tif (thisStation.stationName.equals(toStation)) {\r\n\t\t\t\tSystem.out.println(\"Found endStation in the Database\");\r\n\t\t\t\tendStation = thisStation;\r\n\t\t\t}\r\n\t\t}\r\n\t\t// Station not found. Break\r\n\t\tif (startStation == null || endStation == null) {\r\n\t\t\tSystem.out.println(\"Shit! One of the stations could not be found\");\r\n\t\t\treturn null;\r\n\t\t}\r\n\r\n\t\t/**\r\n\t\t * Declare the variables for the algorithm\r\n\t\t */\r\n\r\n\t\t// ArrayList for keeping track of stations we have visited.\r\n\t\tArrayList<Station> visitedStations = new ArrayList<Station>();\r\n\t\t// Array for the DijkstraStations. This type holds the current best cost and best link to it.\r\n\t\tArrayList<DijkstraStation> dijkstraStations = new ArrayList<DijkstraStation>();\r\n\r\n\t\t// The station we are examining neighbors from.\r\n\t\tDijkstraStation currentStation = new DijkstraStation(new Neighbor(startStation, 0, 0), 0, startStation);\r\n\r\n\t\t// PriorityQueue for sorting unvisited DijkstraStations.\r\n\t\tNeighBorDijktstraComparetor Dijkcomparator = new NeighBorDijktstraComparetor();\r\n\t\tPriorityQueue<DijkstraStation> unvisitedDijkstraStations;\r\n\t\tunvisitedDijkstraStations = new PriorityQueue<DijkstraStation>(100, Dijkcomparator);\r\n\r\n\t\t// Variable to keep track of the goal\r\n\t\tboolean goalFound = false; // did we find the goal yet\r\n\t\tint goalBestCost = Integer.MAX_VALUE; // did we find the goal yet\r\n\r\n\t\t// Add the start staion to the queue so that the loop will start with this staiton\r\n\t\tunvisitedDijkstraStations.add(currentStation);\r\n\t\tdijkstraStations.add(currentStation);\r\n\r\n\t\t/***************************\r\n\t\t * The Dijkstra algorithm loop.\r\n\t\t ***************************/\r\n\r\n\t\twhile (!unvisitedDijkstraStations.isEmpty()) {\r\n\t\t\t// Take the next station to examine from the queue and set the next station as the currentStation\r\n\t\t\tcurrentStation = unvisitedDijkstraStations.poll();\r\n\r\n\t\t\tSystem.out.println(\"\\n============= New loop passtrough =============\");\r\n\t\t\tSystem.out.println(\"Analysing neighbors of \" + currentStation.stationRef.stationName + \". Cost to this station is: \" + currentStation.totalCost);\r\n\r\n\t\t\t// Add visited so we dont visit again.\r\n\t\t\tvisitedStations.add(currentStation.stationRef);\r\n\r\n\t\t\t// break the algorithm if the current stations totalcost if bigger than the best cost of the goal\r\n\t\t\tif (goalBestCost < currentStation.totalCost) {\r\n\t\t\t\tSystem.out.println(\"Best route to the goal has been found. Best cost is: \" + goalBestCost\r\n\t\t\t\t\t\t+ \" (To reach current station is: \" + currentStation.totalCost + \")\");\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t// Check all neighbors from the currentStation to the neighBorQueue so we can examine them\r\n\t\t\tfor (Neighbor thisNeighbor : currentStation.stationRef.neighbors) {\r\n\r\n\t\t\t\t// Skip stations we have already visited\r\n\t\t\t\tif (!visitedStations.contains(thisNeighbor.stationRef)) {\r\n\t\t\t\t\t// If we havent seen this station before\r\n\t\t\t\t\t// Add it to the list of Dijkstrastations and to the PriorityQueue of unvisited stations\r\n\t\t\t\t\tif (getDijkstraStationByID(thisNeighbor.stationRef.stationid, dijkstraStations) == null) {\r\n\t\t\t\t\t\tDijkstraStation thisDijkstraStation = new DijkstraStation(thisNeighbor, currentStation.totalCost\r\n\t\t\t\t\t\t\t\t+ thisNeighbor.cost, currentStation.stationRef);\r\n\t\t\t\t\t\tdijkstraStations.add(thisDijkstraStation);\r\n\t\t\t\t\t\tunvisitedDijkstraStations.offer(thisDijkstraStation);\r\n\r\n\t\t\t\t\t\tif (thisNeighbor.stationRef.equals(endStation)) {\r\n\t\t\t\t\t\t\tgoalFound = true;\r\n\t\t\t\t\t\t\tgoalBestCost = (int) thisDijkstraStation.totalCost;\r\n\t\t\t\t\t\t\tSystem.out.println(\"Goal station found :) Cost to goal is: \" + goalBestCost);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tSystem.out.println(\"New station seen: \" + thisDijkstraStation);\r\n\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\t// Station has been seen before.\r\n\r\n\t\t\t\t\t\t// Get the station as a DijkstraStation from the array\r\n\t\t\t\t\t\tDijkstraStation thisDijkstraStation = getDijkstraStationByID(thisNeighbor.stationRef.stationid,\r\n\t\t\t\t\t\t\t\tdijkstraStations);\r\n\r\n\t\t\t\t\t\t// Check if the connection is better than the one we already know\r\n\t\t\t\t\t\tif (currentStation.totalCost + thisNeighbor.cost < thisDijkstraStation.totalCost) {\r\n\r\n\t\t\t\t\t\t\t// New best link found\r\n\t\t\t\t\t\t\tSystem.out.println(\"New best route found for \" + thisNeighbor.stationRef.stationName);\r\n\t\t\t\t\t\t\tSystem.out.println(\"Old cost:\" + thisDijkstraStation.totalCost + \", New cost: \"\r\n\t\t\t\t\t\t\t\t\t+ (currentStation.totalCost + thisNeighbor.cost));\r\n\r\n\t\t\t\t\t\t\t// update the cost and via station on the DijkstraStation\r\n\t\t\t\t\t\t\tthisDijkstraStation.updateBestLink((int) (currentStation.totalCost + thisNeighbor.cost),\r\n\t\t\t\t\t\t\t\t\tcurrentStation.stationRef, thisNeighbor);\r\n\r\n\t\t\t\t\t\t\t// if this is the goal station, update the totalCost\r\n\t\t\t\t\t\t\tif (thisNeighbor.stationRef.equals(endStation)) {\r\n\t\t\t\t\t\t\t\tgoalBestCost = (int) thisDijkstraStation.totalCost;\r\n\t\t\t\t\t\t\t\tSystem.out.println(\"Updated cost for the goal to : \" + goalBestCost);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t}// End while\r\n\r\n\t\t// Print the World:\r\n//\t\t System.out.println();\r\n//\t\t System.out.println(\"################# Printing the world ###################\");\r\n//\t\t for (DijkstraStation thisDijkstraStation : dijkstraStations) {\r\n//\t\t System.out.println(thisDijkstraStation.toString());\r\n//\t\t DijkstraStation tempStation = thisDijkstraStation;\r\n//\t\t System.out.print(\"BackTracking route =>\");\r\n//\t\t while (!tempStation.stationRef.equals(startStation)) {\r\n//\t\t System.out.print(\" \" + tempStation.cost + \" to \" + tempStation.viaStation.stationName + \" #\");\r\n//\t\t\r\n//\t\t tempStation = getDijkstraStationByID(tempStation.viaStation.stationid, dijkstraStations);\r\n//\t\t }\r\n//\t\t System.out.print(\" End\");\r\n//\t\t System.out.print(\"\\n\\n\");\r\n//\t\t }\r\n//\r\n\t\tif (goalFound) {\r\n\t\t\tSystem.out.println(\"Generating route to goal\");\r\n\t\t\t// create a route object with all the stations.\r\n\t\t\tRoute routeToGoal = new Route(fromStation, toStation);\r\n\t\t\t// get the goalStation as a DijkstraStation Type\r\n\t\t\tDijkstraStation goalStation = getDijkstraStationByID(endStation.stationid, dijkstraStations);\r\n\r\n\t\t\trouteToGoal.cost = goalStation.totalCost;\r\n\t\t\trouteToGoal.price = (int) goalStation.totalCost;\r\n\r\n\t\t\t// Find the route to the goal\r\n\t\t\tDijkstraStation tempStation = goalStation;\r\n\r\n\t\t\twhile (!tempStation.stationRef.equals(startStation)) {\r\n\t\t\t\t// Add the station to the route table\r\n\t\t\t\tSerializableStation thisStation = new SerializableStation(tempStation.cost, tempStation.cost,\r\n\t\t\t\t\t\ttempStation.stationRef.stationName, tempStation.stationRef.stationid);\r\n\t\t\t\t\r\n\t\t\t\t//Fix region string\r\n\t\t\t\tString regionString=\"\";\r\n\t\t\t\tfor (Integer regionID : tempStation.stationRef.region) {\r\n\t\t\t\t\tregionString.concat(regionID+ \",\");\r\n\t\t\t\t}\t\t\t\t\r\n\t\t\t\tthisStation.region = regionString.substring(0, regionString.length() - 1);\r\n\t\t\t\t\r\n\t\t\t\t//Add the station\r\n\t\t\t\trouteToGoal.route.add(0, thisStation);\r\n\t\t\t\t// Go to the previous station\r\n\t\t\t\ttempStation = getDijkstraStationByID(tempStation.viaStation.stationid, dijkstraStations);\r\n\t\t\t}\r\n\t\t\t// add the starting station\r\n\t\t\tSerializableStation thisStation = new SerializableStation(tempStation.stationRef.latitude, tempStation.stationRef.longitude, tempStation.stationRef.stationName,\r\n\t\t\t\t\ttempStation.stationRef.stationid);\r\n\t\t\trouteToGoal.route.add(0, thisStation);\r\n\r\n\t\t\t// print the route\r\n\t\t\t//System.out.println(\"Printing best route to the Goal:\\n\" + routeToGoal.toString());\r\n\r\n\t\t\treturn routeToGoal;\r\n\t\t}\r\n\r\n\t\treturn null;\r\n\t}","public MyGraph(Collection<Vertex> v, Collection<Edge> e) {\n myGraph = new HashMap<Vertex, Collection<Edge>>();\n \n Iterator<Vertex> vertices = v.iterator();\n while(vertices.hasNext()) {\n //create a new vertex copy of each passes in vertex in Collection v to restrict any reference\n //to the internals of this class\n Vertex currV = new Vertex(vertices.next().getLabel()); //NEW\n //Vertex currV = vertices.next(); OLD\n if(!myGraph.containsKey(currV)){\n //add the copy of the vertex into the HashMap\n myGraph.put(currV, new ArrayList<Edge>());\n }\n }\n\n Iterator<Edge> edges = e.iterator();\n while(edges.hasNext()){\n //copies a new edge for each edge in Collection e to restrict any reference \n //to the internals of this class\n Edge parameterEdge = edges.next();\n Edge currE = new Edge(parameterEdge.getSource(), parameterEdge.getDestination(), parameterEdge.getWeight()); //NEW\n //Edge currE = edges.next(); OLD\n if(currE.getWeight() < 0){\n throw new IllegalArgumentException(\"Edge weight is negative\");\n }\n Vertex currESrc = currE.getSource();\n Vertex currEDest = currE.getDestination();\n if(v.contains(currESrc) && v.contains(currEDest)){\n Collection<Edge> outEdges = myGraph.get(currESrc);\n if(!outEdges.contains(currE)){\n //add the copy of the edge as a value in the HashMap\n outEdges.add(currE);\n }\n } else {\n throw new IllegalArgumentException(\"Vertex in edge is not valid\");\n }\n }\n }","@Override\n public void onPlaceSelected(Place place) {\n initiateSearch(place.getLatLng());\n }","private void navigateToPreviousSearchState() {\n Logger.logMessage(TAG, \"Current adapter in nav back is\" + currentAdapter);\n switch (currentAdapter) {\n case \"R\":\n navToPreviousRegions();\n break;\n case \"S\":\n mRecyclerView.setAdapter(regionsAdapter);\n if (currentDisplayingParentId == 0) {\n displayingNowTextView.setText(\"Regions\");\n searchBack.setVisibility(View.GONE);\n } else {\n navToPreviousRegions();\n }\n currentAdapter = \"R\";\n break;\n }\n }","boolean scavenge()\r\n/* 462: */ {\r\n/* 463:493 */ if (scavengeSome()) {\r\n/* 464:494 */ return true;\r\n/* 465: */ }\r\n/* 466:498 */ this.prev = null;\r\n/* 467:499 */ this.cursor = this.head;\r\n/* 468:500 */ return false;\r\n/* 469: */ }","public void prev();","public Map<String,Integer> getAdjacentVertices(String vertexName)\r\n\t{\r\n\t\treturn this.adjacencyMap.get(vertexName);\r\n\t}","public Vertex getDestination() {\n return destination;\n }","public Position2D getPreviousPosition()\n {\n return previousPosition;\n }","private void findNewNearestPub() {\n \t\tevent.SetPubLocation(new PubLocation()/*new nearest found location*/);\n \t\tUpdateFromEvent();\n \t}","public void retreat() {\n if( mMatches.hasPrevious() ) {\n setCurrent( mMatches.previous() );\n }\n }","Place getNextPlace(Place next)\n{\n if (!visited.contains(next.goNorth()) && !(next.goNorth()).isWall()){\n soln.append(\"N\");\n visited.add(next.goNorth());\n //nearby.clear();\n return next.goNorth();\n }\n else if (!visited.contains(next.goEast()) && !next.goEast().isWall()){\n soln.append(\"E\");\n visited.add(next.goEast());\n //nearby.clear();\n return next.goEast();\n }\n else if (!visited.contains(next.goNorth()) && !next.goNorth().isWall()){\n soln.append(\"N\");\n visited.add(next.goNorth());\n //nearby.clear();\n return next.goNorth();\n }\n else if (!visited.contains(next.goNorth()) && !next.goNorth().isWall()){\n soln.append(\"N\");\n visited.add(next.goNorth());\n //nearby.clear();\n return next.goNorth();\n \n //nearby.clear();\n return null;\n} \n}"],"string":"[\n \"public Vertex getPrevious(){\\n return previous;\\n }\",\n \"@Override\\n\\t//loc1 is the start location,loc2 is the destination\\n\\tpublic ArrayList<MapCoordinate> bfsSearch(MapCoordinate loc1, MapCoordinate loc2, Map m) {\\n\\t\\tSystem.out.println(\\\"come into bfsSearch\\\");\\n\\t\\tif(m.isAgentHasAxe() && m.isAgentHasKey()){\\n\\t\\t\\tLinkedList<State> queue=new LinkedList<State>();\\n\\t\\t\\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\n\\t\\t\\t//Visited.add(loc1);\\n\\t\\t\\tState s1=new State(loc1,m.getAgentHasNStones(),null);\\n\\t\\t\\tqueue.add(s1);\\n\\t\\t\\t\\n\\t\\t\\twhile(!queue.isEmpty()){\\n\\t\\t\\t\\tState s=queue.remove();\\n\\t\\t\\t\\tMapCoordinate currentLocation=s.getLocation();\\n\\t\\t\\t\\tVisited.add(s.getLocation()); //add to visited every loop\\n\\t\\t\\t\\tif(loc2.equals(currentLocation)){\\n\\t\\t\\t\\t\\t//means could reach loc2 from loc1\\n\\t\\t\\t\\t\\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\t\\twhile(s.getPrevState()!=null){\\n\\t\\t\\t\\t\\t\\troute.add(0,s.getLocation()); //add to head\\n\\t\\t\\t\\t\\t\\ts=s.getPrevState();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn route;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY());\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move east\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){ //this is important else if(cTemp!='~'), not barely else,\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY());\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move south\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1);\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move north\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1);\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move south\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' &&s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\t\\n\\t\\t\\t}\\n\\t\\t\\treturn null;\\n\\t\\t}else if(m.isAgentHasAxe()){ //only have axe\\n\\t\\t\\tLinkedList<State> queue=new LinkedList<State>();\\n\\t\\t\\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\n\\t\\t\\t//Visited.add(loc1);\\n\\t\\t\\tState s1=new State(loc1,m.getAgentHasNStones(),null);\\n\\t\\t\\tqueue.add(s1);\\n\\t\\t\\t\\n\\t\\t\\twhile(!queue.isEmpty()){\\n\\t\\t\\t\\tState s=queue.remove();\\n\\t\\t\\t\\tMapCoordinate currentLocation=s.getLocation();\\n\\t\\t\\t\\tVisited.add(s.getLocation()); //add visited every loop\\n\\t\\t\\t\\tif(loc2.equals(currentLocation)){\\n\\t\\t\\t\\t\\t//means could reach loc2 from loc1\\n\\t\\t\\t\\t\\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\t\\twhile(s.getPrevState()!=null){\\n\\t\\t\\t\\t\\t\\troute.add(0,s.getLocation()); //add to head\\n\\t\\t\\t\\t\\t\\ts=s.getPrevState();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn route;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY());\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move south\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY());\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move south\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1);\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move north\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1);\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move south\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn null;\\n\\t\\t}else if(m.isAgentHasKey()){ //only have key\\n\\t\\t\\tLinkedList<State> queue=new LinkedList<State>();\\n\\t\\t\\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\n\\t\\t\\t//Visited.add(loc1);\\n\\t\\t\\tState s1=new State(loc1,m.getAgentHasNStones(),null);\\n\\t\\t\\tqueue.add(s1);\\n\\t\\t\\t\\n\\t\\t\\twhile(!queue.isEmpty()){\\n\\t\\t\\t\\tState s=queue.remove();\\n\\t\\t\\t\\tMapCoordinate currentLocation=s.getLocation();\\n\\t\\t\\t\\tVisited.add(s.getLocation());\\n\\t\\t\\t\\tif(loc2.equals(currentLocation)){\\n\\t\\t\\t\\t\\t//means could reach loc2 from loc1\\n\\t\\t\\t\\t\\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\t\\twhile(s.getPrevState()!=null){\\n\\t\\t\\t\\t\\t\\troute.add(0, s.getLocation()); //add to head,in this fashion, return the right order of route\\n\\t\\t\\t\\t\\t\\ts=s.getPrevState();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn route;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY()); \\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move east\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY()); //state that move west\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1); //state move north\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1); //state move south\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\t/*\\n\\t\\t * \\n\\t\\t **/\\t\\t\\n\\t\\telse{ //have no key and axe\\n\\t\\t\\tSystem.out.println(\\\"come into the last elas clause\\\");\\n\\t\\t\\tLinkedList<State> queue=new LinkedList<State>();\\n\\t\\t\\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\n\\t\\t\\tVisited.add(loc1);\\n\\t\\t\\tState s1=new State(loc1,m.getAgentHasNStones(),null);\\n\\t\\t\\tqueue.add(s1);\\n\\t\\t\\t\\n\\t\\t\\t//int i=0;\\n\\t\\t\\twhile(!queue.isEmpty()){\\n\\t\\t\\t\\t//i++;\\n\\t\\t\\t\\t//System.out.println(\\\"come into while: \\\"+i);\\n\\t\\t\\t\\tState s=queue.remove();\\n\\t\\t\\t\\tMapCoordinate currentLocation=s.getLocation();\\n\\t\\t\\t\\tVisited.add(s.getLocation()); //add visited, let program won't stuck in \\n\\t\\t\\t\\tif(loc2.equals(currentLocation)){\\n\\t\\t\\t\\t\\t//means could reach loc2 from loc1\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"return computed route\\\");\\n\\t\\t\\t\\t\\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\t\\twhile(s.getPrevState()!=null){\\n\\t\\t\\t\\t\\t\\troute.add(0, s.getLocation()); //add to head\\n\\t\\t\\t\\t\\t\\ts=s.getPrevState();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tfor(MapCoordinate mc:route){\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"print returned route in bfssearch\\\");\\n\\t\\t\\t\\t\\t\\tSystem.out.print(\\\"mc:\\\"+mc.getX()+\\\" \\\"+mc.getY()+\\\"->\\\");\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn route;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY());\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\t//System.out.println(\\\"1 if\\\");\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null &&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if\\\");\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 if\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 if\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 else\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for the initial state \\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY());\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.add(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for the initial state \\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1);\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*'&&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for the initial state \\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1);\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}//do not do any action for not enough stones situation\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for the initial state \\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}//do not do any action for not enough stones situation\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t}\",\n \"private List<GeographicPoint> backTrack(HashMap<GeographicPoint, List<GeographicPoint>> prev, GeographicPoint goal) {\\n\\t\\tList<GeographicPoint> ans = new ArrayList<GeographicPoint>();\\n\\t\\tList<GeographicPoint> temp = prev.get(goal);\\n\\t\\tif (temp.size() != 0) {\\n\\t\\t\\tans.add(goal);\\n\\t\\t\\twhile (temp.size() != 0) {\\n//\\t\\t\\t\\tSystem.out.print(\\\"Neighbours: \\\");\\n\\t\\t\\t\\t// lastNeighbour will be the neighbour node we visited right before moving to the current node\\n\\t\\t\\t\\tGeographicPoint lastNeighbour = temp.get(temp.size() - 1);\\n\\t\\t\\t\\tans.add(lastNeighbour);\\n\\t\\t\\t\\ttemp = prev.get(lastNeighbour);\\n\\t\\t\\t}\\n\\t\\t\\tCollections.reverse(ans);\\n\\t\\t}\\n\\t\\tif (ans.isEmpty())\\n\\t\\t\\treturn null;\\n\\t\\treturn ans;\\n\\t}\",\n \"public Graph() {\\n\\t\\ttowns = new HashSet<Town>();\\n\\t\\troads = new HashSet<Road>();\\n\\t\\tprevVertex = new HashMap<String, Town>();\\n\\t}\",\n \"public Vertex getPrev() {\\n return prev;\\n }\",\n \"public void setPrevious(Vertex v){\\n previous = v;\\n }\",\n \"@Override\\n\\tpublic void search() {\\n\\t\\tpq = new IndexMinPQ<>(graph.getNumberOfStations());\\n\\t\\tpq.insert(startIndex, distTo[startIndex]);\\n\\t\\twhile (!pq.isEmpty()) {\\n\\t\\t\\tint v = pq.delMin();\\n\\t\\t\\tnodesVisited.add(graph.getStation(v));\\n\\t\\t\\tnodesVisitedAmount++;\\n\\t\\t\\tfor (Integer vertex : graph.getAdjacentVertices(v)) {\\t\\n\\t\\t\\t\\trelax(graph.getConnection(v, vertex));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tpathWeight = distTo[endIndex];\\n\\t\\tpathTo(endIndex);\\n\\t}\",\n \"private int searchNext(JmtCell prev) {\\r\\n \\t\\tRectangle boundspadre = GraphConstants.getBounds((prev).getAttributes()).getBounds();\\r\\n \\t\\tObject[] listEdges = null;\\r\\n \\t\\tGraphModel graphmodel = graph.getModel();\\r\\n \\t\\tList<Object> next = new ArrayList<Object>();\\r\\n \\r\\n \\t\\tif (flag1 == false && prev.seen == false) {\\r\\n \\r\\n \\t\\t\\t// Rectangle bounds =\\r\\n \\t\\t\\t// GraphConstants.getBounds(((JmtCell)prev).getAttributes()).getBounds();\\r\\n \\t\\t\\tif (!flag2) {\\r\\n \\t\\t\\t\\tboundspadre.setLocation(x, y + ((e + 1) * (42 + heightMax)) - (int) (boundspadre.getHeight() / 2) + 30);\\r\\n \\t\\t\\t} else {\\r\\n \\t\\t\\t\\tboundspadre.setLocation(x - (int) (boundspadre.getWidth() / 2), y + ((e + 1) * (42 + heightMax))\\r\\n \\t\\t\\t\\t\\t\\t- (int) (boundspadre.getHeight() / 2) + 30);\\r\\n \\t\\t\\t}\\r\\n \\r\\n \\t\\t\\tGraphConstants.setBounds(prev.getAttributes(), boundspadre);\\r\\n \\t\\t\\tx = (int) boundspadre.getCenterX() + widthMax + 50;\\r\\n \\t\\t\\tprev.seen = true;\\r\\n \\t\\t\\tflag2 = true;\\r\\n \\t\\t}\\r\\n \\r\\n \\t\\t// inserisco tutti gli archi uscenti e entranti di min.get(j) in\\r\\n \\t\\t// listEdges\\r\\n \\t\\tlistEdges = DefaultGraphModel.getOutgoingEdges(graphmodel, prev);\\r\\n \\t\\tVector<Object> listEdgestmp = new Vector<Object>();\\r\\n \\t\\tfor (Object listEdge : listEdges) {\\r\\n \\t\\t\\tJmtCell qq = (JmtCell) (graphmodel.getParent(graphmodel.getTarget(listEdge)));\\r\\n \\t\\t\\tif (!(qq).seen) {\\r\\n \\t\\t\\t\\tlistEdgestmp.add(listEdge);\\r\\n \\t\\t\\t}\\r\\n \\t\\t}\\r\\n \\t\\tlistEdges = listEdgestmp.toArray();\\r\\n \\r\\n \\t\\tint numTarget = listEdges.length;\\r\\n \\t\\tif (numTarget == 0) {\\r\\n \\t\\t\\treturn 1;\\r\\n \\t\\t}\\r\\n \\r\\n \\t\\tfor (int k = 0; k < numTarget; k++) {\\r\\n \\t\\t\\tnext.add((graphmodel.getParent(graphmodel.getTarget(listEdges[k]))));\\r\\n \\t\\t}\\r\\n \\r\\n \\t\\tint j = 1;\\r\\n \\t\\tif (inRepositionSons == false && ((JmtCell) next.get(0)).seen == false) {\\r\\n \\t\\t\\tj = searchNext((JmtCell) next.get(0));\\r\\n \\t\\t} else if (inRepositionSons == true && ((JmtCell) next.get(0)).seen == false) {\\r\\n \\r\\n \\t\\t\\tRectangle bounds = GraphConstants.getBounds(((JmtCell) next.get(0)).getAttributes()).getBounds();\\r\\n \\t\\t\\tbounds.setLocation((int) (boundspadre.getCenterX()) + widthMax + 50 - (int) (bounds.getWidth() / 2), (int) boundspadre.getCenterY()\\r\\n \\t\\t\\t\\t\\t- (int) (bounds.getHeight() / 2));\\r\\n \\t\\t\\tGraphConstants.setBounds(((JmtCell) next.get(0)).getAttributes(), bounds);\\r\\n \\r\\n \\t\\t\\t((JmtCell) next.get(0)).seen = true;\\r\\n \\t\\t\\tj = searchNext((JmtCell) next.get(0));\\r\\n \\t\\t}\\r\\n \\r\\n \\t\\tif (numTarget > 0) {\\r\\n \\t\\t\\tif (!flag) {\\r\\n \\t\\t\\t\\trepositionSons(prev, next, j - 1, 1);\\r\\n \\t\\t\\t} else {\\r\\n \\t\\t\\t\\trepositionSons(prev, next, -1, 0);\\r\\n \\t\\t\\t}\\r\\n \\t\\t\\tflag = false;\\r\\n \\t\\t}\\r\\n \\r\\n \\t\\t(prev).sons = 0;\\r\\n \\t\\tfor (int w = 0; w < numTarget; w++) {\\r\\n \\t\\t\\tprev.sons += ((JmtCell) next.get(w)).sons;\\r\\n \\t\\t}\\r\\n \\r\\n \\t\\treturn prev.sons;\\r\\n \\t}\",\n \"private Vertex getVertex( String vertexName )\\n {\\n Vertex v = vertexMap.get( vertexName );\\n if( v == null )\\n {\\n v = new Vertex( vertexName );\\n vertexMap.put( vertexName, v );\\n }\\n return v;\\n }\",\n \"void prevSet(Entry e) {\\r\\n\\t\\t\\tprev = e;\\r\\n\\t\\t}\",\n \"public List<Location> getPreviousLocations();\",\n \"public Stack<Vertex> next() {\\n Vertex u = lov.pop();\\n for (Edge e : u.outEdges) {\\n if (!e.to.visited) {\\n cameFromEdge.put(e.to.toIdentifier(), e.from);\\n if (e.to.x == MazeWorld.width - 1 && e.to.y == MazeWorld.height - 1) {\\n reconstruct(cameFromEdge, e.to);\\n lov = new Stack<Vertex>();\\n }\\n else {\\n lov.push(u);\\n e.to.visited = true;\\n lov.push(e.to);\\n break;\\n }\\n }\\n }\\n return lov;\\n }\",\n \"private void prevAddress(){\\n\\t\\tif (this.addressIndex <= 0){\\n\\t\\t\\t this.addressIndex = this.addresses.length -1; \\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tthis.addressIndex--;\\n\\t\\t\\t}\\n\\t\\tthis.displayServer = this.addresses[addressIndex];\\n\\t\\t\\n\\t}\",\n \"private void findPrev() {\\n \\tthis.find(false);\\n }\",\n \"@Override\\n protected KPMPSolution nextNeighbour() {\\n List<KPMPSolutionWriter.PageEntry> edgePartition = bestSolution.getEdgePartition().stream().map(KPMPSolutionWriter.PageEntry::clone).collect(toCollection(ArrayList::new));\\n KPMPSolution neighbourSolution = new KPMPSolution(bestSolution.getSpineOrder(), edgePartition, bestSolution.getNumberOfPages());\\n edge = edgePartition.get(index);\\n originalPageIndex = edge.page;\\n newPageIndex = pageCounter;\\n edgePartition.get(index).page = newPageIndex;\\n index++;\\n numberOfIterations++;\\n return neighbourSolution;\\n }\",\n \"private Vertex<String> addLocation(String name) {\\n if (!vertices.containsKey(name)) {\\n Vertex<String> v = graph.insert(name);\\n vertices.put(name, v);\\n return v;\\n }\\n return vertices.get(name);\\n }\",\n \"public Pair<Integer, Map<Vertex, Vertex>> ShortestDistance(Vertex source, Vertex zink) {\\n Map<Vertex, Vertex> PredecessorMap = new HashMap<>();\\n Map<Vertex, Integer> DistanceMap = new HashMap<>();\\n Vertex a;\\n // initialize arrays\\n for (Vertex v : Vertices) {\\n DistanceMap.put(v, 1000); //We initialize the array in infinite\\n PredecessorMap.put(v, null);\\n }\\n DistanceMap.put(source, 0); //We put the source in 0\\n for (Vertex v : Vertices) {\\n while (!DistanceMap.isEmpty()) { //And we iterate until the distance map is empty\\n a = getmin(DistanceMap); //we get the minimum vertex\\n if(a==null) {\\n return (new Pair<Integer, Map<Vertex, Vertex>>(DistanceMap.get(zink), PredecessorMap));\\n }\\n\\n ArrayList<Edge> edges = a.getOutEdges(); //we get de edges connected to this vertex\\n for (Edge e : edges) { //we iterate getting the vertex of each edge\\n if (DistanceMap.containsKey(e.tovertex)) { //if the vertex is in the distance map:\\n Integer alt = DistanceMap.get(a) + e.distance; //we get it value and plus the distance of the edge\\n\\n System.out.println(\\\"This is the distance going out from that Vertex: \\\" + alt + \\\", with previous distance: \\\" + DistanceMap.get(e.tovertex));\\n if (alt < DistanceMap.get(e.tovertex)) { //if it is less, we put it in the arrays\\n DistanceMap.put(e.tovertex, alt);\\n PredecessorMap.put(e.tovertex, a);\\n\\n }\\n }\\n }\\n DistanceMap.remove(a); //and we remove it of the array\\n }\\n }\\n return (new Pair<Integer, Map<Vertex, Vertex>>(DistanceMap.get(zink), PredecessorMap));\\n }\",\n \"private Stack<Cell> constructPlan(WorldMap worldMap, Cell target, Hashtable<Cell, Cell> prev) {\\n\\n\\t\\t// Starting from the target and backtracking to find the route plan\\n\\t\\tStack<Cell> newPlan = new Stack<Cell>();\\n\\n\\t\\tCell cell = target;\\n\\t\\twhile (prev.containsKey(cell)) {\\n\\t\\t\\tnewPlan.push(cell);\\n\\t\\t\\tcell = prev.get(cell);\\n\\t\\t}\\n\\t\\treturn newPlan;\\n\\t}\",\n \"private void processOverlay(){\\n \\n // go for as long as edges still exist.\\n while(this.availableVertices.size() > 0)\\n {\\n \\n // pick the least weight vertex.\\n Vertex next = this.availableVertices.poll(); // finding the least weight vertex.\\n int distanceToNext = this.distances.get(convertToString(next.getVertexPortNum())); // must use the string version of the portnum.\\n \\n // and for each available squad member of the chosen vertex\\n List<Edge> nextSquad = next.getSquad(); \\n for(Edge e: nextSquad)\\n {\\n Vertex other = e.getNeighbor(next);\\n if(this.visitedVertices.contains(other))\\n {\\n continue; // continue the while loop in this case.\\n }\\n \\n // check for a shorter path, update if a new path is found within the overlay.\\n int currentWeight = this.distances.get(convertToString(other.getVertexPortNum())); // using string version of the port number.\\n int newWeight = distanceToNext + e.getWeight();\\n \\n if(newWeight < currentWeight){\\n this.predecessors.put(convertToString(other.getVertexPortNum()), convertToString(next.getVertexPortNum())); // use the string versions of the port numbers.\\n this.distances.put(convertToString(other.getVertexPortNum()), newWeight); // use the string version of the port numbers.\\n // updating here.\\n this.availableVertices.remove(other);\\n this.availableVertices.add(other);\\n }\\n \\n }\\n \\n this.visitedVertices.add(next); // add this vertex as \\\"visited\\\" so we do not visit it again.\\n }\\n }\",\n \"protected abstract Collection<Street> findConnectedStreets(\\r\\n StreetNode streetNode);\",\n \"GameBoardVertex(GameBoardVertex neighbor){this.neighbors.add(neighbor);}\",\n \"private Point backtrack(Point p){\\n\\t\\t// coordinates of the point\\n\\t\\tint x = (int)p.getX();\\n\\t\\tint y = (int)p.getY();\\n\\t\\t// neigh hold the return value\\n\\t\\tPoint neigh= p;\\n\\t\\t// the lowest score\\n\\t\\tint score=10000;\\n\\t\\t// look at all the neighbor and compare them\\n\\t\\tif(x>0\\t && topology[x-1][y]>=0){\\n\\t\\t\\tscore = topology[x-1][y];\\n\\t\\t\\tneigh = new Point(x-1,y);\\n\\t\\t}\\n\\t\\tif(x<row-1 && topology[x+1][y]>=0 && score > topology[x+1][y]) {\\n\\t\\t\\tscore = topology[x+1][y];\\n\\t\\t\\tneigh = new Point(x+1,y);\\n\\t\\t}\\n\\t\\tif(y<col-1 && topology[x][y+1]>=0 && score > topology[x][y+1]) {\\n\\t\\t\\tscore = topology[x][y+1];\\n\\t\\t\\tneigh = new Point(x,y+1);\\n\\t\\t}\\n\\t\\tif(y>0 && topology[x][y-1]>=0 && score > topology[x][y-1]) {\\n\\t\\t\\tscore = topology[x][y-1];\\n\\t\\t\\tneigh = new Point(x,y-1);\\n\\t\\t}\\n\\t\\treturn neigh;\\n\\t}\",\n \"public GameList getSearchResult(){ return m_NewSearchResult;}\",\n \"public MapGraphExtra()\\n\\t{\\n\\t\\t// TODO: Implement in this constructor in WEEK 3\\n\\t\\tmap = new HashMap<GeographicPoint, MapNode> ();\\n\\t}\",\n \"public static Map<Integer, Boolean> InitializeVisited() {\\n\\t\\tMap<Integer, Boolean> visited = new HashMap<Integer, Boolean>();\\r\\n\\t\\tfor (Entry<Integer, Vertex> currentVertex : vertexes.entrySet())\\r\\n\\t\\t\\tvisited.put(currentVertex.getKey(), false);\\r\\n\\t\\treturn visited;\\r\\n\\t}\",\n \"public Shard getLowerNeighbor() {\\r\\n double middleLat = south + Math.abs(north - south) / 2;\\r\\n double nextLat = middleLat - Math.abs(north - south);\\r\\n\\r\\n return new Shard(new Coordinates(nextLat, coordinates.getLon()), zoom);\\r\\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 \"public void previous() {\\n if (highlight.getMatchCount() > 0) {\\n Point point = highlight.getPreviousMatch(cursor.getY(), cursor.getX());\\n if (point != null) {\\n cursor.moveTo(point);\\n }\\n return;\\n }\\n Point point = file.getPreviousModifiedPoint(cursor.getY(), cursor.getX());\\n if (point != null) {\\n cursor.moveTo(point);\\n }\\n }\",\n \"public Vertex getFrom() {\\r\\n\\r\\n return from;\\r\\n }\",\n \"protected void streetLoc(LatLng latLng) {\\n if (latLng == null) {\\n return;\\n }\\n TencentSearch tencentSearch = new TencentSearch(this);\\n //还可以传入其他坐标系的坐标，不过需要用coord_type()指明所用类型\\n //这里设置返回周边poi列表，可以在一定程度上满足用户获取指定坐标周边poi的需求\\n Geo2AddressParam geo2AddressParam = new Geo2AddressParam(latLng).getPoi(true)\\n .setPoiOptions(new Geo2AddressParam.PoiOptions()\\n// .setRadius(1000).setCategorys(\\\"面包\\\")\\n .setPolicy(Geo2AddressParam.PoiOptions.POLICY_O2O));\\n tencentSearch.geo2address(geo2AddressParam, new HttpResponseListener<BaseObject>() {\\n\\n @Override\\n public void onSuccess(int arg0, BaseObject arg1) {\\n if (arg1 == null) {\\n return;\\n }\\n Geo2AddressResultObject obj = (Geo2AddressResultObject)arg1;\\n StringBuilder sb = new StringBuilder();\\n sb.append(\\\"逆地址解析\\\");\\n sb.append(\\\"\\\\n地址：\\\" + obj.result.address);\\n sb.append(\\\"\\\\npois:\\\"+obj.result.address_component.province+obj.result.address_component.city+obj.result.address_component.district);\\n// provinceMap.put()\\n province1 = provinceMap.get(obj.result.address_component.province+obj.result.address_component.city+obj.result.address_component.district);\\n if(province1 == null) {\\n provinceMap.put(obj.result.address_component.province+obj.result.address_component.city+obj.result.address_component.district,obj.result.address_component.province+obj.result.address_component.city+obj.result.address_component.district);\\n getStreet(obj.result.address_component.province, obj.result.address_component.city, obj.result.address_component.district);\\n }\\n\\n// for (Poi poi : obj.result.pois) {\\n// sb.append(\\\"\\\\n\\\\t\\\" + poi.title);\\n// tencentMap.addMarker(new MarkerOptions()\\n// .position(poi.latLng) //标注的位置\\n// .title(poi.title) //标注的InfoWindow的标题\\n// .snippet(poi.address) //标注的InfoWindow的内容\\n// );\\n// }\\n// Log.e(\\\"test\\\", sb.toString());\\n }\\n\\n @Override\\n public void onFailure(int arg0, String arg1, Throwable arg2) {\\n Log.e(\\\"test\\\", \\\"error code:\\\" + arg0 + \\\", msg:\\\" + arg1);\\n }\\n });\\n }\",\n \"public void onMapSearch(View view) {\\n\\n EditText locationSearch = (EditText) findViewById(R.id.arrival);\\n String location = locationSearch.getText().toString();\\n List<Address>addressList = null;\\n\\n if (location != null || !location.equals(\\\"\\\")) {\\n Geocoder geocoder = new Geocoder(this);\\n try {\\n addressList = geocoder.getFromLocationName(location, 1);\\n\\n } catch (IOException e) {\\n Toast.makeText(this,\\\"Destination not found\\\",Toast.LENGTH_SHORT).show();\\n\\n }\\n Address address = addressList.get(0);\\n LatLng latLng = new LatLng(address.getLatitude(), address.getLongitude());\\n MarkerPoints.add(latLng);\\n Toast.makeText(MapsActivity.this,\\\"added position 2 \\\"+MarkerPoints.size(),Toast.LENGTH_SHORT).show();\\n\\n mMap.addMarker(new MarkerOptions().position(latLng).draggable(true).title(location+\\\" (\\\"+address.getLatitude()+\\\",\\\"+address.getLongitude()+\\\")\\\").icon(BitmapDescriptorFactory.fromResource(R.drawable.flag)));\\n mMap.animateCamera(CameraUpdateFactory.newLatLngZoom(latLng,16));\\n //listClients.add(new Client(R.drawable.flag,\\\"Nasser\\\",\\\"client2 requesting cab\\\",100,address.getLatitude(), address.getLongitude()));\\n //Toast.makeText(MapsActivity.this,\\\"client attended at \\\"+\\\" (\\\"+address.getLatitude()+\\\",\\\"+address.getLongitude()+\\\")\\\",Toast.LENGTH_SHORT).show();\\n\\n\\n\\n /* if (MarkerPoints.size() > 2) {\\n // MarkerPoints.clear();\\n mMap.clear();\\n }*/\\n\\n\\n // Checks, whether start and end locations are captured\\n if (MarkerPoints.size() >= 2) {\\n LatLng origin = MarkerPoints.get(0);\\n LatLng dest = MarkerPoints.get(MarkerPoints.size()-1);\\n\\n // Getting URL to the Google Directions API\\n String url = getUrl(origin, dest);\\n Log.d(\\\"onMapClick\\\", url.toString());\\n FetchUrl FetchUrl = new FetchUrl();\\n\\n // Start downloading json data from Google Directions API\\n FetchUrl.execute(url);\\n //move map camera\\n //mMap.moveCamera(CameraUpdateFactory.newLatLng(origin));\\n //mMap.animateCamera(CameraUpdateFactory.zoomTo(11));\\n\\n build_retrofit_and_get_response(\\\"driving\\\");\\n\\n final View mapView = getSupportFragmentManager().findFragmentById(R.id.map).getView();\\n if (mapView.getViewTreeObserver().isAlive()) {\\n mapView.getViewTreeObserver().addOnGlobalLayoutListener(new ViewTreeObserver.OnGlobalLayoutListener() {\\n @SuppressLint(\\\"NewApi\\\")\\n @Override\\n public void onGlobalLayout() {\\n LatLngBounds.Builder bld = new LatLngBounds.Builder();\\n for (int i = 0; i < MarkerPoints.size(); i++) {\\n LatLng ll = new LatLng(MarkerPoints.get(i).latitude, MarkerPoints.get(i).longitude);\\n bld.include(ll);\\n }\\n LatLngBounds bounds = bld.build();\\n mMap.moveCamera(CameraUpdateFactory.newLatLngBounds(bounds, 70));\\n mapView.getViewTreeObserver().removeGlobalOnLayoutListener(this);\\n\\n }\\n });\\n }\\n }\\n\\n }\\n }\",\n \"public CustomGraphSearch(boolean bInsertFront) {\\n\\tSystem.out.println(\\\"bInsertFront: \\\" + bInsertFront);\\n\\tinsertFront = bInsertFront;\\n }\",\n \"public HashMap<Integer, Integer> findAugumentPath() {\\n if (debug == 1) printFree();\\n HashMap<Integer, Integer> Path = new HashMap<>();\\n if (V1.isEmpty() || V2.isEmpty()) {\\n if (debug == 1) System.out.println(\\\"V1||V2 is empty\\\");\\n return Path;\\n }\\n\\n GM.clearAllEdge();\\n for (int i = 0; i < x.length; i++) {\\n for (int j : x[i].getDomain()) {\\n GM.addEdge(i, Map.get(j));\\n }\\n }\\n GM.adjList[X].clear();\\n for (int i : V1) {\\n GM.addEdge(X, i);\\n }\\n for (int i = 0; i < x.length; i++) {\\n if (MaxMatch[i] != 0) GM.addEdge(MaxMatch[i], i);\\n }\\n if (debug == 1) System.out.println(GM);\\n\\n // DFS từ X. Gặp 1 đỉnh thuộc V2 thì break\\n boolean[] visited = new boolean[nbOfVertex + 10];\\n int[] prev = new int[nbOfVertex + 10];\\n prev[X] = -1;\\n int last = -1;\\n\\n Stack<Integer> S = new Stack<>();\\n S.push(X);\\n while (!S.isEmpty() && last == -1) {\\n int top = S.pop();\\n //System.out.println(\\\"Popped \\\" + top);\\n if (!visited[top]) {\\n visited[top] = true;\\n for (int next : GM.adjList[top])\\n if (!visited[next]) {\\n prev[next] = top;\\n if (V2.contains(next)) {\\n last = next;\\n //System.out.println(\\\"Here \\\" + next);\\n break;\\n }\\n S.push(next);\\n //System.out.println(\\\"Pushed \\\" + next);\\n }\\n }\\n }\\n if (last == -1) {\\n //System.out.println(\\\"Cant find any augument path\\\\n\\\");\\n } else {\\n //System.out.println(\\\"Constructing augument path\\\");\\n //int step = 0;\\n while (last != -1) {\\n int from = prev[last];\\n if (from == X) break;\\n Path.put(from, last);\\n ////System.out.println(Math.min(from, last) + \\\" --> \\\" + Math.max(from, last));\\n last = from;\\n //step++;\\n //if(step>10) break;\\n }\\n if (debug == 1) System.out.println(\\\"Construct augument path completed \\\" + Path.size());\\n if (debug == 1) printCurrentAugumentPath(Path);\\n }\\n //System.out.println(Path.size());\\n return Path;\\n }\",\n \"Vertex addVertex(String name){\\n\\t\\t//if graph doesn't already have the key\\n\\t\\tif (!adjlist.containsKey(name)) {\\n\\t\\t\\tkeys.add(name); //places keys in list in order they're added\\n\\t\\t\\tvertices++; //increases vertex count variable\\n\\t\\t\\treturn adjlist.put(name, new Vertex(name)); //adds to hashmap\\n\\t\\t//if graph does already have the key\\n\\t\\t} else {\\n\\t\\t\\treturn adjlist.get(name);\\n\\t\\t}\\n\\t}\",\n \"public Road(Town source, Town destination, String name) {\\r\\n\\t\\tthis.source = source;\\r\\n\\t\\tthis.destination = destination;\\r\\n\\t\\tthis.vertices = new HashSet<Town>();\\r\\n\\t\\tvertices.add(source);\\r\\n\\t\\tvertices.add(destination);\\r\\n\\t\\t\\r\\n\\t\\tthis.name = name;\\r\\n\\t}\",\n \"@Override\\n public boolean AddTraversalStreet(Street street) {\\n boolean follows = false;\\n if(streets.size() == 0) {\\n follows = true;\\n } else {\\n for (Street s : streets) {\\n if (s.follows(street)) {\\n follows = true;\\n break;\\n }\\n }\\n }\\n if(!follows) {\\n return false;\\n }\\n if(!streets.contains(street))\\n streets.add(street);\\n return true;\\n }\",\n \"public void findStreets() {\\r\\n\\t\\tpolygonMap.resetStreets();\\r\\n\\t\\tpolygonMap.setCurrentPlayerID(client.getSettler().getID());\\r\\n\\t\\tfor (int i = 0; i < island.getRoads().length; i++) {\\r\\n\\t\\t\\tif (buildStreetIsAllowed(island.getRoads()[i])\\r\\n\\t\\t\\t\\t\\t&& !isWaterStreet(island.getRoads()[i])) {\\r\\n\\t\\t\\t\\tpolygonMap.addStreet(i);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public Town getVertex(String name) {\\n\\t\\tfor (Town t : towns) {\\n\\t\\t\\tif (t.getName().equals(name)) {\\n\\t\\t\\t\\treturn t;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"@Override\\n public PointInPath getLastRoutePointBeforeCoordinate(Street street, Coordinate coord) {\\n for(int r_index = currRouteIndex; r_index<=routes.size()-1; r_index++) {\\n Route r = routes.get(r_index);\\n\\n // iterate through the route\\n for(int i=0; i<r.getRoute().size()-1; i++) {\\n PointInPath p1 = r.getRoute().get(i);\\n PointInPath p2 = r.getRoute().get(i+1);\\n\\n if(p1.getStreet().getId().equals(street.getId())) {\\n if(Math2D.isLocatedBetweenPoints(coord, p1.getCoordinate(), p2.getCoordinate())) {\\n if(r_index != currRouteIndex) {\\n // return last route point that is already a part of the street\\n return new PointInPath(r, p1.getStreet(), p1.getCoordinate());\\n } else {\\n // returned route point is the vehicle's position\\n Coordinate vehiclePos = getPosition(progressTowardsNextStop);\\n if(Math2D.isLocatedBetweenPoints(vehiclePos, p1.getCoordinate(), coord)) {\\n PointInPath currVehiclePoint = new PointInPath(r, p1.getStreet(), vehiclePos);\\n r.getRoute().add(i+1, currVehiclePoint);\\n\\n return currVehiclePoint;\\n }\\n }\\n }\\n }\\n }\\n }\\n return null;\\n }\",\n \"public Street (SimpleMap roadMap) {\\n if (roadMap != null) roadMap.addToMap(this);\\n }\",\n \"public void makeVertexUp( String sourceName)\\n {\\n Vertex v = vertexMap.get( sourceName );\\n if(v!=null)\\n \\tv.isDown =false;\\n else\\n \\tSystem.out.println(\\\"Invalid vertex\\\");\\n \\n \\n // v.weightnext.put(w.name,(Double) distance);\\n }\",\n \"void testSearches(Tester t) {\\n Vertex v1 = new Vertex(10, 10);\\n Vertex v2 = new Vertex(10, 11);\\n Vertex v3 = new Vertex(10, 12);\\n\\n Edge e1 = new Edge(v1, v2, 1);\\n Edge e2 = new Edge(v2, v3, 1);\\n\\n IList<Vertex> map = new Cons<Vertex>(v1, new Cons<Vertex>(v2, new Cons<Vertex>(\\n v3, new Empty<Vertex>())));\\n\\n Player player = new Player(map);\\n DepthFirst dp = new DepthFirst(map);\\n BreadthFirst bp = new BreadthFirst(map);\\n\\n t.checkExpect(player.current, v1);\\n t.checkExpect(player.finished, false);\\n\\n t.checkExpect(bp.hasNext(), true);\\n t.checkExpect(bp.next(), new Queue<Vertex>());\\n\\n t.checkExpect(dp.hasNext(), true);\\n t.checkExpect(dp.next(), new Stack<Vertex>());\\n\\n t.checkExpect(player.move(true, e1), v2);\\n\\n t.checkExpect(player.current, v2);\\n t.checkExpect(player.finished, false);\\n\\n t.checkExpect(bp.hasNext(), false);\\n t.checkExpect(bp.next(), v3);\\n\\n t.checkExpect(dp.hasNext(), false);\\n t.checkExpect(dp.next(), v3);\\n\\n t.checkExpect(player.move(true, e2), v3);\\n\\n player.finished = true;\\n\\n t.checkExpect(player.current, v3);\\n t.checkExpect(player.finished, true);\\n\\n Queue<Vertex> q = new Queue<Vertex>(map);\\n\\n q.enqueue(new Vertex(5, 5));\\n\\n Deque<Vertex> dq = new Deque<Vertex>();\\n dq.addAtHead(v1);\\n dq.addAtTail(v2);\\n dq.addAtTail(new Vertex(5, 5));\\n\\n\\n t.checkExpect(q.isEmpty(), false);\\n t.checkExpect(q.contents, dq);\\n\\n Stack<Vertex> stack = new Stack<Vertex>(map);\\n\\n t.checkExpect(stack.isEmpty(), false);\\n dq.removeFromHead();\\n t.checkExpect(stack.pop(), dq);\\n\\n t.checkExpect(dp.next(), v2);\\n t.checkExpect(bp.hasNext(), true);\\n\\n }\",\n \"@Override\\r\\n public Iterable<V> neighbors(V vertexName) {\\r\\n try {\\r\\n Iterator<Vertex> vertexIterator = map.values().iterator();\\r\\n while(vertexIterator.hasNext()) {\\r\\n Vertex v = vertexIterator.next();\\r\\n if(vertexName.compareTo(v.vertexName) == 0)\\r\\n return v.destinations;\\r\\n }\\r\\n vertexIterator.next();\\r\\n return null;\\r\\n }\\r\\n catch(NoSuchElementException e) {\\r\\n throw e;\\r\\n }\\r\\n }\",\n \"public Queue<Vertex> next() {\\n\\n Vertex u = lov.dequeue();\\n for (Edge e : u.outEdges) {\\n if (!e.to.visited) {\\n cameFromEdge.put(e.to.toIdentifier(), e.from);\\n if (e.to.x == MazeWorld.width - 1 && e.to.y == MazeWorld.height - 1) {\\n reconstruct(cameFromEdge, e.to);\\n lov = new Queue<Vertex>();\\n }\\n else {\\n e.to.visited = true;\\n lov.enqueue(e.to);\\n }\\n }\\n }\\n return lov;\\n }\",\n \"public VertexIterator(Iterator<PointF> source)\\n {\\n this.source = source;\\n }\",\n \"Vertex(int id, Vertex prev, int costToReach) {\\n this.id = id;\\n this.prev = prev;\\n this.costToReach = costToReach;\\n }\",\n \"private Iterable<V> reconstructPath(V last, V from, HashMap<V, V> previous){\\n LinkedList<V> ret = new LinkedList<>();\\n ret.addFirst(last);\\n while (!last.equals(from)){\\n V prev = previous.get(last);\\n ret.addFirst(prev);\\n last = prev;\\n }\\n return ret;\\n }\",\n \"private static <T> Map<Character,Node<T>> newNodeMap(Map<Character,Node<T>> prev)\\n\\t\\t{\\n\\t\\t\\treturn new HashMap<Character,Node<T>>(prev);\\n\\t\\t}\",\n \"private void buildMap(VLongArrayListWritable currentVertexValue) {\\n verticesMap.clear();\\n \\n // add vertex ID itself\\n verticesMap.put(getVertexId().get(), 1l);\\n \\n // add IDs of its neighbors\\n for (Edge<VLongWritable, IntWritable> edge : getEdges()) {\\n verticesMap.put(edge.getDestVertexId().get(), 1l);\\n }\\n \\n // add current results IDs from the vertex value\\n if (currentVertexValue == null) {\\n return;\\n }\\n for (int i = 0; i < currentVertexValue.size(); i++) {\\n long vid = ((VLongWritable) currentVertexValue.get(i)).get();\\n if (!verticesMap.containsKey(vid)) {\\n verticesMap.put(vid, 1l);\\n }\\n }\\n }\",\n \"public void startSearch() {\\n if (solving) {\\n Alg.Dijkstra();\\n }\\n pause(); //pause state\\n }\",\n \"public TopologicalIterator() {\\n fringe = new Stack<Integer>();\\n edgeCopy = new LinkedList[myAdjLists.length];\\n int count = 0;\\n for (LinkedList l : myAdjLists) {\\n \\tLinkedList toAdd = new LinkedList();\\n \\tfor (Object e : l) {\\n \\t\\ttoAdd.add(e);\\n \\t}\\n \\tedgeCopy[count] = toAdd;\\n \\tcount++;\\n }\\n for (int i = 0; i < myVertexCount; i++) {\\n \\tif (inDegreeCopy(i, edgeCopy) == 0) {\\n \\t\\tfringe.add(i);\\n \\t}\\n }\\n alreadyReturned = new ArrayList<Integer>();\\n // more statements go here\\n }\",\n \"public MapSearchViewer() {\\n initComponents();\\n listPoints = new ArrayList<>(); \\n listId_stanice = new ArrayList<>();\\n\\n\\t// load the filtered objects from a db.\\n try {\\n loadFilteredObjectFromDb();\\n } catch (Exception e) {\\n e.printStackTrace();\\n } \\n }\",\n \"void stateBacktracked (Search search);\",\n \"public Town getTargetVertex(Town sourceVertex) {\\r\\n\\t\\tfor(Town town: vertices) {\\r\\n\\t\\t\\tif(!town.equals(sourceVertex)) {\\r\\n\\t\\t\\t\\treturn town;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\treturn null;\\r\\n\\t}\",\n \"@Override\\n\\tpublic List<Path> getShortestRoute(Location src, Location dest, String edgePropertyName) {\\n\\t\\t//array to keep track of visited vertexes\\n\\t\\tboolean[] visited = new boolean[locations.size()];\\n\\t\\t//array to store weights\\n\\t\\tdouble[] weight = new double[locations.size()];\\n\\t\\t//array to store predecessors\\n\\t\\tLocation[] pre = new Location[locations.size()];\\n\\t\\t//creates priority queue\\n\\t\\tPriorityQueue<LocWeight> pq = new PriorityQueue<LocWeight>();\\n\\t\\t// initializes every vertex misted mark to false\\n\\t\\tfor (int i = 0; i < visited.length; i++)\\n\\t\\t\\tvisited[i] = false;\\n\\t\\t// initializes every vertex's total weight to infinity\\n\\t\\tfor (int i = 0; i < weight.length; i++)\\n\\t\\t\\tweight[i] = Double.POSITIVE_INFINITY;\\n\\t\\t// initializes every vertex's predecessor to null\\n\\t\\tfor (int i = 0; i < pre.length; i++)\\n\\t\\t\\tpre[i] = null;\\n\\t\\t//sets start vertex's total weight to 0\\n\\t\\tweight[locations.indexOf(src)] = 0;\\n\\t\\t//insert start vertex in priroty queue\\n\\t\\tpq.add(new LocWeight(src, 0.0));\\n\\t\\t\\n\\t\\tString[] edgeNames = getEdgePropertyNames();\\n\\t\\tint indexProp = 0;\\n\\t\\tfor (int i = 0; i < edgeNames.length; i++) {\\n\\t\\t\\tif (edgeNames[i].equalsIgnoreCase(edgePropertyName))\\n\\t\\t\\t\\tindexProp = i;\\n\\t\\t}\\n\\t\\twhile (!pq.isEmpty()) {\\n\\t\\t\\tLocWeight c = pq.remove();\\n\\t\\t\\t//set C's visited mark to true\\n\\t\\t\\tvisited[locations.indexOf(c)] = true;\\n\\n\\t\\t\\tList<Location> neighbors = getNeighbors(c.getLocation());\\n\\t\\t\\t//for each unvisited successor adjacent to C\\n\\t\\t\\tfor (int i = 0; i < neighbors.size(); i++) {\\n\\t\\t\\t\\tif (visited[locations.indexOf(neighbors.get(i))] == false) {\\n\\t\\t\\t\\t\\t//change successor's total weight to equal C's weight + edge weight from C to successor\\n\\t\\t\\t\\t\\tweight[locations.indexOf(neighbors.get(i))] = c.getWeight() + getEdgeIfExists(c.getLocation(), neighbors.get(i)).getProperties().get(indexProp);\\n\\t\\t\\t\\t\\tpre[locations.indexOf(neighbors.get(i))] = c.getLocation();\\n\\t\\t\\t\\t\\tLocWeight succ = new LocWeight(neighbors.get(i), weight[locations.indexOf(neighbors.get(i))]);\\n\\t\\t\\t\\t\\t//if successor is already in pq, update its total weight\\n\\t\\t\\t\\t\\tif (pq.contains(succ)) {\\n\\t\\t\\t\\t\\t\\tpq.remove(succ);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t//if not already there, add\\n\\t\\t\\t\\t\\tpq.add(succ);\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t\\n\\n\\n\\t\\t}\\n\\t\\t\\n\\t\\tArrayList<Path> path = new ArrayList<Path>();\\n\\t\\t//find predecessor of each vertex and construct shortest path then return it\\n\\t\\tLocation curr1 = dest;\\n\\t\\twhile (pre[locations.indexOf(curr1)] != null) {\\n\\t\\t\\tpath.add(getEdgeIfExists(pre[locations.indexOf(curr1)], curr1));\\n\\t\\t\\tcurr1 = pre[locations.indexOf(curr1)];\\n\\t\\t}\\n\\t\\t//to show path from the start\\n\\t\\tfor (int i = path.size() - 1; i >= 0; i--)\\n\\t\\t\\tpath.add(path.remove(i));\\n\\n\\n\\t\\treturn path;\\n\\t}\",\n \"@Override\\n public Iterable<V> adjacentTo(V from)\\n {\\n if (from.equals(null)){\\n throw new IllegalArgumentException();\\n }\\n Iterator graphIterator = graph.entrySet().iterator();\\n \\t Map.Entry graphElement = (Map.Entry) graphIterator.next();\\n \\t V vert = (V)graphElement.getKey();\\n \\t while (graphIterator.hasNext() && vert != from){\\n \\t\\tgraphElement = (Map.Entry) graphIterator.next();\\n \\t\\tvert = (V)graphElement.getKey();\\n \\t }\\n \\t ArrayList <V> edges = graph.get(vert);\\n \\t //Iterable <V> e = edges;\\n \\t return edges;\\n }\",\n \"public Vertex<VV> getFrom()\\r\\n { return from; }\",\n \"private Vertice getVertex(String name) {\\r\\n Vertice v = (Vertice) vertices.get(name);\\r\\n if (v == null) {\\r\\n v = new Vertice(name);\\r\\n vertices.put(name, v);\\r\\n }\\r\\n return v;\\r\\n }\",\n \"public PathFinder(PathStore store, Tile from, Tile to, boolean bGetToNeighbor){\\r\\n \\t// this.store = store;\\r\\n \\tthis.map = store.getMap();\\r\\n \\t// this.tileFrom = from;\\r\\n \\tthis.tileTo = to;\\r\\n \\tthis.bGetToNeighbor = bGetToNeighbor;\\r\\n }\",\n \"void getVertices() {\\r\\n\\t\\tSystem.out.println(\\\"Enter your vertices:\\\");\\r\\n\\t\\tarrIndexToVertexMap = new HashMap<>();\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tfor (int i = 0; i < numberOfVertices; i++) {\\r\\n\\t\\t\\t\\tarrIndexToVertexMap.put(i, sc.next());\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tsc.close();\\r\\n\\t\\t} catch (RuntimeException re) {\\r\\n\\t\\t\\tSystem.out.println(\\\"Error at method:: getVertices || Description:\\\" + re);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public Vertex getVertex(String place)\\n\\t{\\n\\t\\treturn vertices.get(place);\\n\\t}\",\n \"public void previousSolution() {\\r\\n\\t\\tif (solutionIndex > 0) {\\r\\n\\t\\t\\tsolutionIndex--;\\r\\n\\t\\t\\tcreateObjectDiagram(solutions.get(solutionIndex));\\r\\n\\t\\t} else {\\r\\n\\t\\t\\tLOG.info(LogMessages.pagingFirst);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"void stateStored (Search search);\",\n \"public Vertex(String aName)\\r\\n\\t\\t{\\r\\n\\t\\t\\tthis.name = aName;\\r\\n\\t\\t\\tthis.neighbors = new ArrayList<Edge>();\\r\\n\\t\\t}\",\n \"public wVertex(String s){\\r\\n name = s;\\r\\n adjacencies = new ArrayList<Edge>();\\r\\n }\",\n \"Set<Edge> getIncomingNeighborEdges(boolean onUpwardPass) {\\n//\\t\\t\\tif(_outgoingEdges.size() == 0) { // only compute if we have to\\n\\t\\t\\t\\tSet<Edge> outgoingEdges = new HashSet<Edge>();\\n\\t\\t\\t\\tIterator<Edge> it = _neighborEdges.keySet().iterator();\\n\\t\\t\\t\\twhile(it.hasNext()) {\\n\\t\\t\\t\\t\\tEdge e = it.next();\\n\\t\\t\\t\\t\\tVertex v = e.getOtherVertex(this);\\n\\t\\t\\t\\t\\tif(this._orderID == UNMARKED) {\\n\\t\\t\\t\\t\\t\\tSystem.err.println(\\\"whoops i am unmarked\\\");\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(v._orderID == UNMARKED) {\\n\\t\\t\\t\\t\\t\\tSystem.err.println(\\\"whoops neighbor unmarked\\\");\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(this._orderID < v._orderID) {\\n\\t\\t\\t\\t\\t\\toutgoingEdges.add(e);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t_outgoingEdges = outgoingEdges;\\n//\\t\\t\\t}\\n//\\t\\t\\treturn _outgoingEdges;\\n\\t\\t\\t\\treturn outgoingEdges;\\n\\t\\t}\",\n \"public Vertex( String nm )\\n { name = nm; adjEdge = new TreeMap<String,Edge>( ); reset( ); }\",\n \"public void setPreviousHop(int previousHop) {\\n this.previousHop = previousHop;\\n }\",\n \"public AStarNode getPrevious() {\\n return previous;\\n }\",\n \"private void addAllNeighbours(@NonNull final Location searchLoc) {\\n for (int x = -1; x < 2; x++) {\\n for (int y = -1; y < 2; y++) {\\n if ((x == 0) && (y == 0)) {\\n continue;\\n }\\n final long foundKey = Location.getKey(searchLoc.getScX() + x, searchLoc.getScY() + y,\\n searchLoc.getScZ());\\n synchronized (unchecked) {\\n if (!unchecked.contains(foundKey)) {\\n unchecked.add(foundKey);\\n }\\n }\\n }\\n }\\n \\n final long foundKey = Location.getKey(searchLoc.getScX(), searchLoc.getScY(), searchLoc.getScZ() + 1);\\n synchronized (unchecked) {\\n if (!unchecked.contains(foundKey)) {\\n unchecked.add(foundKey);\\n }\\n }\\n }\",\n \"public Intersection(Stoplight s, Point p) {\\n\\t\\troads = new ArrayList<Road>();\\n\\t\\tstoplight = s;\\n\\t\\tcurrentCar = null;\\n\\t\\tpos = p;\\n\\t}\",\n \"private List<String> searchByDijkstra(Vertex starting, String end ,Map<String, Vertex> verticesWithDistance) {\\n\\t\\tSet<Vertex> visited = new HashSet<Vertex>();\\n\\t\\tPriorityQueue<Vertex> pq = new PriorityQueue<Vertex>();\\n\\t\\tpq.offer(starting);\\n\\t\\twhile (!pq.isEmpty()) {\\n\\t\\t\\tVertex v = pq.poll();\\n\\t\\t\\tif (v.name.equals(end))\\n\\t\\t\\t\\treturn v.route;\\n\\t\\t\\tif (!visited.contains(v))\\n\\t\\t\\t\\tvisited.add(v);\\n\\t\\t\\telse\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tfor (String n : neighbors.get(v.name)) {\\n\\t\\t\\t\\tint newDistance = v.distance + edges.get(v.name + \\\" \\\" + n);\\n\\t\\t\\t\\tVertex nextVertex = verticesWithDistance.get(n);\\n\\t\\t\\t\\tif (nextVertex.distance == -1 || newDistance < nextVertex.distance) {\\n\\t\\t\\t\\t\\tnextVertex.distance = newDistance;\\n\\t\\t\\t\\t\\tnextVertex.route = new LinkedList<String>(v.route);\\n\\t\\t\\t\\t\\tnextVertex.route.add(nextVertex.name);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tpq.offer(nextVertex);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"public String getNearestStreet() {\\n String nearestStreet = \\\"null\\\";\\n CollisionResults results = new CollisionResults();\\n float closestDistance = 101f;\\n for(float xDir = -1; xDir <= 1; xDir += .1f) {\\n for(float yDir = -1; yDir <= 1; yDir += .1f) {\\n for(float zDir = -1; zDir <= 1; zDir += .1f) { \\n Ray ray = new Ray(loc, new Vector3f(xDir, yDir, zDir));\\n world.collideWith(ray, results);\\n for (int i = 0; i < results.size(); i++) {\\n float dist = results.getCollision(i).getDistance();\\n String name = results.getCollision(i).getGeometry().getParent().getName();\\n if (name.startsWith(\\\"R_\\\") && dist <= 100 && dist < closestDistance) {\\n nearestStreet = name;\\n closestDistance = dist;\\n }\\n }\\n }\\n }\\n }\\n\\n return nearestStreet;\\n \\n }\",\n \"private Cell breadthFirstSearch(WorldMap worldMap, Cell startCell, CELLTYPE goalType, Hashtable<Cell, Cell> prev) {\\n\\n\\t\\t// Using markedSet to avoid re-checking already visited nodes\\n\\t\\tHashSet<Cell> markedSet = new HashSet<Cell>();\\n\\t\\tLinkedList<Cell> queue = new LinkedList<Cell>();\\n\\n\\t\\tmarkedSet.add(startCell);\\n\\t\\tqueue.add(startCell);\\n\\n\\t\\twhile (!queue.isEmpty()) {\\n\\t\\t\\tCell cell = queue.remove();\\n\\t\\t\\tif (cell.getCellType() == goalType)\\n\\t\\t\\t\\treturn cell;\\n\\t\\t\\tLinkedList<Cell> neighbors = generateSuccessors(worldMap, cell, goalType);\\n\\n\\t\\t\\t/*\\n\\t\\t\\t * If looking for unexplored, shuffle list. Since the neighbors are\\n\\t\\t\\t * always returned NESW, it's best to shuffle the list if ant wants\\n\\t\\t\\t * to explore a random portion of the map.\\n\\t\\t\\t */\\n\\t\\t\\tif (goalType == CELLTYPE.UNEXPLORED)\\n\\t\\t\\t\\tCollections.shuffle(neighbors, new Random(System.currentTimeMillis()));\\n\\n\\t\\t\\tfor (Cell neighbor : neighbors)\\n\\t\\t\\t\\tif (!markedSet.contains(neighbor)) {\\n\\t\\t\\t\\t\\tmarkedSet.add(neighbor);\\n\\t\\t\\t\\t\\tqueue.add(neighbor);\\n\\t\\t\\t\\t\\tprev.put(neighbor, cell);\\n\\t\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// If reached here, goal type doesn't exist\\n\\t\\treturn null;\\n\\t}\",\n \"public K prev();\",\n \"public E getPrevEdge()\\r\\n/* */ {\\r\\n/* 178 */ return (E)this.prevEdge;\\r\\n/* */ }\",\n \"@Override\\n protected void onActivityResult(int requestCode, int resultCode, Intent data) {\\n super.onActivityResult(requestCode, resultCode, data);\\n if (requestCode == RESULT_CODE_SEARCH) {\\n if (resultCode == Activity.RESULT_OK) {\\n String street_name;\\n String street_number;\\n String meter_number;\\n try {\\n street_name = data.getStringExtra(\\\"street_name\\\");\\n street_number = data.getStringExtra(\\\"street_number\\\");\\n meter_number = data.getStringExtra(\\\"meter_number\\\");\\n } catch (Exception e) {\\n e.printStackTrace();\\n return;\\n }\\n\\n ArrayList<model_pro_mr_route_rows> rows = new ArrayList<>();\\n for (MeterReaderController.Keys rid : MeterReaderController.route_row_keys) {\\n rows.add(\\n DBHelper.pro_mr_route_rows.getRouteRow(rid.getInstNode_id(),\\n rid.getMobnode_id(),\\n rid.getCycle(),\\n rid.getRoute_number(),\\n rid.getMeter_id(),\\n rid.getWalk_sequence()));\\n }\\n\\n //We have a meter number, only on record will have the entry\\n if (!meter_number.isEmpty()) {\\n for (model_pro_mr_route_rows r : rows) {\\n if ((r.getMeter_number().compareToIgnoreCase(meter_number) == 0)) {\\n setCurrentFragmentView(\\n new MeterReaderController.Keys(r.getCycle(),\\n r.getInstNode_id(),\\n r.getMeter_id(),\\n r.getMobnode_id(),\\n r.getRoute_number(),\\n r.getWalk_sequence()));\\n return;\\n }\\n }\\n }\\n\\n //We have a complete address\\n if (!street_name.isEmpty() & !street_number.isEmpty()) {\\n for (model_pro_mr_route_rows r : rows) {\\n if ((r.getAddress_name().compareToIgnoreCase(street_name) == 0) &\\n (r.getStreet_number().compareToIgnoreCase(street_number) == 0)) {\\n setCurrentFragmentView(\\n new MeterReaderController.Keys(r.getCycle(),\\n r.getInstNode_id(),\\n r.getMeter_id(),\\n r.getMobnode_id(),\\n r.getRoute_number(),\\n r.getWalk_sequence()));\\n return;\\n }\\n }\\n }\\n\\n //We have a street name but no number\\n if (!street_name.isEmpty()) {\\n for (model_pro_mr_route_rows r : rows) {\\n if (r.getAddress_name().compareToIgnoreCase(street_name) == 0) {\\n setCurrentFragmentView(\\n new MeterReaderController.Keys(r.getCycle(),\\n r.getInstNode_id(),\\n r.getMeter_id(),\\n r.getMobnode_id(),\\n r.getRoute_number(),\\n r.getWalk_sequence()));\\n return;\\n }\\n }\\n }\\n\\n //We have a street number but no nname\\n if (!street_number.isEmpty()) {\\n for (model_pro_mr_route_rows r : rows) {\\n if (r.getStreet_number().compareToIgnoreCase(street_number) == 0) {\\n setCurrentFragmentView(\\n new MeterReaderController.Keys(r.getCycle(),\\n r.getInstNode_id(),\\n r.getMeter_id(),\\n r.getMobnode_id(),\\n r.getRoute_number(),\\n r.getWalk_sequence()));\\n }\\n }\\n }\\n }\\n }\\n }\",\n \"public interface SearchSolver {\\n\\n /**\\n * initializes the algorithm. This method has to be called before calling any other method\\n * @param graph the graph of the map where the search takes place\\n * @param targetStart the start position for the target (in our case the thief)\\n * @param searchStart the start position for the searcher (in our case the police)\\n * @param counter the counter object that counts the expanded nodes\\n */\\n void initialize(Graph graph, Node targetStart, Node searchStart, ExpandCounter counter);\\n\\n /**\\n * gets the shortest path from search start to target\\n * @return list of edges that describe the path\\n * @throws NoPathFoundException if there is no path to the target\\n */\\n List<Edge> getPath() throws NoPathFoundException;\\n}\",\n \"public MinimumTrialsSourceToDestWord()\\n {\\n nodeList = new HashMap<T, GraphNode>();\\n }\",\n \"public void previous();\",\n \"private Node locatePrevNode(K key) { \\n\\t\\tNode p = null; \\n\\t\\tNode current = first; \\n\\t\\twhile (current != null && current.getData().getKey().compareTo(key) < 0) {\\n\\t\\t\\tp = current; \\n\\t\\t\\tcurrent = current.getNext(); \\n\\t\\t}\\n\\t\\treturn p; \\n\\t}\",\n \"public Road(Town source, Town destination, int weight, String name) {\\r\\n\\t\\tthis.source = source;\\r\\n\\t\\tthis.destination = destination;\\r\\n\\t\\tthis.vertices = new HashSet<Town>();\\r\\n\\t\\tvertices.add(source);\\r\\n\\t\\tvertices.add(destination);\\r\\n\\t\\t\\r\\n\\t\\tthis.weight = weight;\\r\\n\\t\\tthis.name = name;\\r\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n public void add(V vertexName) {\\r\\n if(!contains(vertexName))\\r\\n map.put(vertexName, new Vertex(vertexName));\\r\\n }\",\n \"public void setPrevious(DSAGraphNode<E> inPrevious)\\n {\\n previous = inPrevious;\\n }\",\n \"public DijkstraSP(EdgeWeightedDigraph G, int s, Map<Integer, Site> siteMap) {\\n \\tthis.G = G;\\n \\tthis.siteMap = siteMap;\\n distTo = new double[G.V()];\\n edgeTo = new SiteEdge[G.V()];\\n for (int v = 0; v < G.V(); v++)\\n distTo[v] = Double.POSITIVE_INFINITY;\\n distTo[s] = 0.0;\\n\\n // relax vertices in order of distance from s\\n pq = new IndexMinPQ<Double>(G.V());\\n pq.insert(s, distTo[s]);\\n while (!pq.isEmpty()) {\\n int v = pq.delMin();\\n for (SiteEdge e : G.adj(v)){\\n relax(e);\\n }\\n }\\n }\",\n \"@Override\\n public Vertex getSource() {\\n return sourceVertex;\\n }\",\n \"private void search(final Map<String, Integer> routes, Vertex current, Vertex finishVertex, int maxDistance, String currentRoute, int currentDistance) {\\r\\n if(current == finishVertex) {\\r\\n routes.put(currentRoute, currentDistance);\\r\\n }\\r\\n for(Edge e : current.getIncidentEdges()) {\\r\\n if(e.getDistance() + currentDistance <= maxDistance)\\r\\n search(routes, e.getOppositeVertex(current), finishVertex, maxDistance, currentRoute + e.getOppositeVertex(current).getName(), e.getDistance() + currentDistance);\\r\\n }\\r\\n }\",\n \"Object previous();\",\n \"private Route calculate(String fromStation, String toStation) {\\n\\t\\tif (stations==null){\\r\\n\\t\\t\\tSystem.out.println(\\\"DEBUG RUN OF DIJKSTRA.\\\");\\r\\n\\t\\t\\tstations = new ArrayList<Station>();\\r\\n\\t\\t\\tcreateDebugMap(stations);\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t/**\\r\\n\\t\\t * Check if the stations exists\\r\\n\\t\\t */\\r\\n\\t\\tStation startStation = null, endStation = null;\\r\\n\\r\\n\\t\\t// Find starting station\\r\\n\\t\\tfor (Station thisStation : stations) {\\r\\n\\t\\t\\tif (thisStation.stationName.equals(fromStation)) {\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"Found startStaion in the Database\\\");\\r\\n\\t\\t\\t\\tstartStation = thisStation;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tif (thisStation.stationName.equals(toStation)) {\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"Found endStation in the Database\\\");\\r\\n\\t\\t\\t\\tendStation = thisStation;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t// Station not found. Break\\r\\n\\t\\tif (startStation == null || endStation == null) {\\r\\n\\t\\t\\tSystem.out.println(\\\"Shit! One of the stations could not be found\\\");\\r\\n\\t\\t\\treturn null;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t/**\\r\\n\\t\\t * Declare the variables for the algorithm\\r\\n\\t\\t */\\r\\n\\r\\n\\t\\t// ArrayList for keeping track of stations we have visited.\\r\\n\\t\\tArrayList<Station> visitedStations = new ArrayList<Station>();\\r\\n\\t\\t// Array for the DijkstraStations. This type holds the current best cost and best link to it.\\r\\n\\t\\tArrayList<DijkstraStation> dijkstraStations = new ArrayList<DijkstraStation>();\\r\\n\\r\\n\\t\\t// The station we are examining neighbors from.\\r\\n\\t\\tDijkstraStation currentStation = new DijkstraStation(new Neighbor(startStation, 0, 0), 0, startStation);\\r\\n\\r\\n\\t\\t// PriorityQueue for sorting unvisited DijkstraStations.\\r\\n\\t\\tNeighBorDijktstraComparetor Dijkcomparator = new NeighBorDijktstraComparetor();\\r\\n\\t\\tPriorityQueue<DijkstraStation> unvisitedDijkstraStations;\\r\\n\\t\\tunvisitedDijkstraStations = new PriorityQueue<DijkstraStation>(100, Dijkcomparator);\\r\\n\\r\\n\\t\\t// Variable to keep track of the goal\\r\\n\\t\\tboolean goalFound = false; // did we find the goal yet\\r\\n\\t\\tint goalBestCost = Integer.MAX_VALUE; // did we find the goal yet\\r\\n\\r\\n\\t\\t// Add the start staion to the queue so that the loop will start with this staiton\\r\\n\\t\\tunvisitedDijkstraStations.add(currentStation);\\r\\n\\t\\tdijkstraStations.add(currentStation);\\r\\n\\r\\n\\t\\t/***************************\\r\\n\\t\\t * The Dijkstra algorithm loop.\\r\\n\\t\\t ***************************/\\r\\n\\r\\n\\t\\twhile (!unvisitedDijkstraStations.isEmpty()) {\\r\\n\\t\\t\\t// Take the next station to examine from the queue and set the next station as the currentStation\\r\\n\\t\\t\\tcurrentStation = unvisitedDijkstraStations.poll();\\r\\n\\r\\n\\t\\t\\tSystem.out.println(\\\"\\\\n============= New loop passtrough =============\\\");\\r\\n\\t\\t\\tSystem.out.println(\\\"Analysing neighbors of \\\" + currentStation.stationRef.stationName + \\\". Cost to this station is: \\\" + currentStation.totalCost);\\r\\n\\r\\n\\t\\t\\t// Add visited so we dont visit again.\\r\\n\\t\\t\\tvisitedStations.add(currentStation.stationRef);\\r\\n\\r\\n\\t\\t\\t// break the algorithm if the current stations totalcost if bigger than the best cost of the goal\\r\\n\\t\\t\\tif (goalBestCost < currentStation.totalCost) {\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"Best route to the goal has been found. Best cost is: \\\" + goalBestCost\\r\\n\\t\\t\\t\\t\\t\\t+ \\\" (To reach current station is: \\\" + currentStation.totalCost + \\\")\\\");\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// Check all neighbors from the currentStation to the neighBorQueue so we can examine them\\r\\n\\t\\t\\tfor (Neighbor thisNeighbor : currentStation.stationRef.neighbors) {\\r\\n\\r\\n\\t\\t\\t\\t// Skip stations we have already visited\\r\\n\\t\\t\\t\\tif (!visitedStations.contains(thisNeighbor.stationRef)) {\\r\\n\\t\\t\\t\\t\\t// If we havent seen this station before\\r\\n\\t\\t\\t\\t\\t// Add it to the list of Dijkstrastations and to the PriorityQueue of unvisited stations\\r\\n\\t\\t\\t\\t\\tif (getDijkstraStationByID(thisNeighbor.stationRef.stationid, dijkstraStations) == null) {\\r\\n\\t\\t\\t\\t\\t\\tDijkstraStation thisDijkstraStation = new DijkstraStation(thisNeighbor, currentStation.totalCost\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t+ thisNeighbor.cost, currentStation.stationRef);\\r\\n\\t\\t\\t\\t\\t\\tdijkstraStations.add(thisDijkstraStation);\\r\\n\\t\\t\\t\\t\\t\\tunvisitedDijkstraStations.offer(thisDijkstraStation);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tif (thisNeighbor.stationRef.equals(endStation)) {\\r\\n\\t\\t\\t\\t\\t\\t\\tgoalFound = true;\\r\\n\\t\\t\\t\\t\\t\\t\\tgoalBestCost = (int) thisDijkstraStation.totalCost;\\r\\n\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"Goal station found :) Cost to goal is: \\\" + goalBestCost);\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"New station seen: \\\" + thisDijkstraStation);\\r\\n\\r\\n\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\t// Station has been seen before.\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t// Get the station as a DijkstraStation from the array\\r\\n\\t\\t\\t\\t\\t\\tDijkstraStation thisDijkstraStation = getDijkstraStationByID(thisNeighbor.stationRef.stationid,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tdijkstraStations);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t// Check if the connection is better than the one we already know\\r\\n\\t\\t\\t\\t\\t\\tif (currentStation.totalCost + thisNeighbor.cost < thisDijkstraStation.totalCost) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t// New best link found\\r\\n\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"New best route found for \\\" + thisNeighbor.stationRef.stationName);\\r\\n\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"Old cost:\\\" + thisDijkstraStation.totalCost + \\\", New cost: \\\"\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ (currentStation.totalCost + thisNeighbor.cost));\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t// update the cost and via station on the DijkstraStation\\r\\n\\t\\t\\t\\t\\t\\t\\tthisDijkstraStation.updateBestLink((int) (currentStation.totalCost + thisNeighbor.cost),\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tcurrentStation.stationRef, thisNeighbor);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t// if this is the goal station, update the totalCost\\r\\n\\t\\t\\t\\t\\t\\t\\tif (thisNeighbor.stationRef.equals(endStation)) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tgoalBestCost = (int) thisDijkstraStation.totalCost;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"Updated cost for the goal to : \\\" + goalBestCost);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t}// End while\\r\\n\\r\\n\\t\\t// Print the World:\\r\\n//\\t\\t System.out.println();\\r\\n//\\t\\t System.out.println(\\\"################# Printing the world ###################\\\");\\r\\n//\\t\\t for (DijkstraStation thisDijkstraStation : dijkstraStations) {\\r\\n//\\t\\t System.out.println(thisDijkstraStation.toString());\\r\\n//\\t\\t DijkstraStation tempStation = thisDijkstraStation;\\r\\n//\\t\\t System.out.print(\\\"BackTracking route =>\\\");\\r\\n//\\t\\t while (!tempStation.stationRef.equals(startStation)) {\\r\\n//\\t\\t System.out.print(\\\" \\\" + tempStation.cost + \\\" to \\\" + tempStation.viaStation.stationName + \\\" #\\\");\\r\\n//\\t\\t\\r\\n//\\t\\t tempStation = getDijkstraStationByID(tempStation.viaStation.stationid, dijkstraStations);\\r\\n//\\t\\t }\\r\\n//\\t\\t System.out.print(\\\" End\\\");\\r\\n//\\t\\t System.out.print(\\\"\\\\n\\\\n\\\");\\r\\n//\\t\\t }\\r\\n//\\r\\n\\t\\tif (goalFound) {\\r\\n\\t\\t\\tSystem.out.println(\\\"Generating route to goal\\\");\\r\\n\\t\\t\\t// create a route object with all the stations.\\r\\n\\t\\t\\tRoute routeToGoal = new Route(fromStation, toStation);\\r\\n\\t\\t\\t// get the goalStation as a DijkstraStation Type\\r\\n\\t\\t\\tDijkstraStation goalStation = getDijkstraStationByID(endStation.stationid, dijkstraStations);\\r\\n\\r\\n\\t\\t\\trouteToGoal.cost = goalStation.totalCost;\\r\\n\\t\\t\\trouteToGoal.price = (int) goalStation.totalCost;\\r\\n\\r\\n\\t\\t\\t// Find the route to the goal\\r\\n\\t\\t\\tDijkstraStation tempStation = goalStation;\\r\\n\\r\\n\\t\\t\\twhile (!tempStation.stationRef.equals(startStation)) {\\r\\n\\t\\t\\t\\t// Add the station to the route table\\r\\n\\t\\t\\t\\tSerializableStation thisStation = new SerializableStation(tempStation.cost, tempStation.cost,\\r\\n\\t\\t\\t\\t\\t\\ttempStation.stationRef.stationName, tempStation.stationRef.stationid);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t//Fix region string\\r\\n\\t\\t\\t\\tString regionString=\\\"\\\";\\r\\n\\t\\t\\t\\tfor (Integer regionID : tempStation.stationRef.region) {\\r\\n\\t\\t\\t\\t\\tregionString.concat(regionID+ \\\",\\\");\\r\\n\\t\\t\\t\\t}\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tthisStation.region = regionString.substring(0, regionString.length() - 1);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t//Add the station\\r\\n\\t\\t\\t\\trouteToGoal.route.add(0, thisStation);\\r\\n\\t\\t\\t\\t// Go to the previous station\\r\\n\\t\\t\\t\\ttempStation = getDijkstraStationByID(tempStation.viaStation.stationid, dijkstraStations);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t// add the starting station\\r\\n\\t\\t\\tSerializableStation thisStation = new SerializableStation(tempStation.stationRef.latitude, tempStation.stationRef.longitude, tempStation.stationRef.stationName,\\r\\n\\t\\t\\t\\t\\ttempStation.stationRef.stationid);\\r\\n\\t\\t\\trouteToGoal.route.add(0, thisStation);\\r\\n\\r\\n\\t\\t\\t// print the route\\r\\n\\t\\t\\t//System.out.println(\\\"Printing best route to the Goal:\\\\n\\\" + routeToGoal.toString());\\r\\n\\r\\n\\t\\t\\treturn routeToGoal;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\treturn null;\\r\\n\\t}\",\n \"public MyGraph(Collection<Vertex> v, Collection<Edge> e) {\\n myGraph = new HashMap<Vertex, Collection<Edge>>();\\n \\n Iterator<Vertex> vertices = v.iterator();\\n while(vertices.hasNext()) {\\n //create a new vertex copy of each passes in vertex in Collection v to restrict any reference\\n //to the internals of this class\\n Vertex currV = new Vertex(vertices.next().getLabel()); //NEW\\n //Vertex currV = vertices.next(); OLD\\n if(!myGraph.containsKey(currV)){\\n //add the copy of the vertex into the HashMap\\n myGraph.put(currV, new ArrayList<Edge>());\\n }\\n }\\n\\n Iterator<Edge> edges = e.iterator();\\n while(edges.hasNext()){\\n //copies a new edge for each edge in Collection e to restrict any reference \\n //to the internals of this class\\n Edge parameterEdge = edges.next();\\n Edge currE = new Edge(parameterEdge.getSource(), parameterEdge.getDestination(), parameterEdge.getWeight()); //NEW\\n //Edge currE = edges.next(); OLD\\n if(currE.getWeight() < 0){\\n throw new IllegalArgumentException(\\\"Edge weight is negative\\\");\\n }\\n Vertex currESrc = currE.getSource();\\n Vertex currEDest = currE.getDestination();\\n if(v.contains(currESrc) && v.contains(currEDest)){\\n Collection<Edge> outEdges = myGraph.get(currESrc);\\n if(!outEdges.contains(currE)){\\n //add the copy of the edge as a value in the HashMap\\n outEdges.add(currE);\\n }\\n } else {\\n throw new IllegalArgumentException(\\\"Vertex in edge is not valid\\\");\\n }\\n }\\n }\",\n \"@Override\\n public void onPlaceSelected(Place place) {\\n initiateSearch(place.getLatLng());\\n }\",\n \"private void navigateToPreviousSearchState() {\\n Logger.logMessage(TAG, \\\"Current adapter in nav back is\\\" + currentAdapter);\\n switch (currentAdapter) {\\n case \\\"R\\\":\\n navToPreviousRegions();\\n break;\\n case \\\"S\\\":\\n mRecyclerView.setAdapter(regionsAdapter);\\n if (currentDisplayingParentId == 0) {\\n displayingNowTextView.setText(\\\"Regions\\\");\\n searchBack.setVisibility(View.GONE);\\n } else {\\n navToPreviousRegions();\\n }\\n currentAdapter = \\\"R\\\";\\n break;\\n }\\n }\",\n \"boolean scavenge()\\r\\n/* 462: */ {\\r\\n/* 463:493 */ if (scavengeSome()) {\\r\\n/* 464:494 */ return true;\\r\\n/* 465: */ }\\r\\n/* 466:498 */ this.prev = null;\\r\\n/* 467:499 */ this.cursor = this.head;\\r\\n/* 468:500 */ return false;\\r\\n/* 469: */ }\",\n \"public void prev();\",\n \"public Map<String,Integer> getAdjacentVertices(String vertexName)\\r\\n\\t{\\r\\n\\t\\treturn this.adjacencyMap.get(vertexName);\\r\\n\\t}\",\n \"public Vertex getDestination() {\\n return destination;\\n }\",\n \"public Position2D getPreviousPosition()\\n {\\n return previousPosition;\\n }\",\n \"private void findNewNearestPub() {\\n \\t\\tevent.SetPubLocation(new PubLocation()/*new nearest found location*/);\\n \\t\\tUpdateFromEvent();\\n \\t}\",\n \"public void retreat() {\\n if( mMatches.hasPrevious() ) {\\n setCurrent( mMatches.previous() );\\n }\\n }\",\n \"Place getNextPlace(Place next)\\n{\\n if (!visited.contains(next.goNorth()) && !(next.goNorth()).isWall()){\\n soln.append(\\\"N\\\");\\n visited.add(next.goNorth());\\n //nearby.clear();\\n return next.goNorth();\\n }\\n else if (!visited.contains(next.goEast()) && !next.goEast().isWall()){\\n soln.append(\\\"E\\\");\\n visited.add(next.goEast());\\n //nearby.clear();\\n return next.goEast();\\n }\\n else if (!visited.contains(next.goNorth()) && !next.goNorth().isWall()){\\n soln.append(\\\"N\\\");\\n visited.add(next.goNorth());\\n //nearby.clear();\\n return next.goNorth();\\n }\\n else if (!visited.contains(next.goNorth()) && !next.goNorth().isWall()){\\n soln.append(\\\"N\\\");\\n visited.add(next.goNorth());\\n //nearby.clear();\\n return next.goNorth();\\n \\n //nearby.clear();\\n return null;\\n} \\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5627445","0.55323344","0.5339006","0.53070784","0.5228151","0.51851505","0.5169838","0.51343405","0.5123293","0.510184","0.50734395","0.5063662","0.5061977","0.50599587","0.5056774","0.50472885","0.5046267","0.5041834","0.49829865","0.49800807","0.49718004","0.49645674","0.4957869","0.49360642","0.49237883","0.4919187","0.48857287","0.4883986","0.48761344","0.48528713","0.48414317","0.4827991","0.48183087","0.4802156","0.47983018","0.47979903","0.4792791","0.47874233","0.47820002","0.4769394","0.47532848","0.47476363","0.4739884","0.4737093","0.47223145","0.47220507","0.4720052","0.47171336","0.47039354","0.47036734","0.47031018","0.46954203","0.4690427","0.4686299","0.46834576","0.4675214","0.46568915","0.46549225","0.46528262","0.46462974","0.46432546","0.46197426","0.46151957","0.4612583","0.46122026","0.46104497","0.4606627","0.45991054","0.4597971","0.4597233","0.4596367","0.45957458","0.45931968","0.45918024","0.4587215","0.45820367","0.4581961","0.45796165","0.457747","0.45768154","0.45755538","0.45748508","0.45746854","0.45619628","0.4560936","0.4558748","0.45580864","0.45580238","0.4557787","0.4557749","0.4551155","0.4550193","0.45492452","0.45460588","0.4543454","0.4542276","0.45356154","0.45339152","0.45273808","0.45262384"],"string":"[\n \"0.5627445\",\n \"0.55323344\",\n \"0.5339006\",\n \"0.53070784\",\n \"0.5228151\",\n \"0.51851505\",\n \"0.5169838\",\n \"0.51343405\",\n \"0.5123293\",\n \"0.510184\",\n \"0.50734395\",\n \"0.5063662\",\n \"0.5061977\",\n \"0.50599587\",\n \"0.5056774\",\n \"0.50472885\",\n \"0.5046267\",\n \"0.5041834\",\n \"0.49829865\",\n \"0.49800807\",\n \"0.49718004\",\n \"0.49645674\",\n \"0.4957869\",\n \"0.49360642\",\n \"0.49237883\",\n \"0.4919187\",\n \"0.48857287\",\n \"0.4883986\",\n \"0.48761344\",\n \"0.48528713\",\n \"0.48414317\",\n \"0.4827991\",\n \"0.48183087\",\n \"0.4802156\",\n \"0.47983018\",\n \"0.47979903\",\n \"0.4792791\",\n \"0.47874233\",\n \"0.47820002\",\n \"0.4769394\",\n \"0.47532848\",\n \"0.47476363\",\n \"0.4739884\",\n \"0.4737093\",\n \"0.47223145\",\n \"0.47220507\",\n \"0.4720052\",\n \"0.47171336\",\n \"0.47039354\",\n \"0.47036734\",\n \"0.47031018\",\n \"0.46954203\",\n \"0.4690427\",\n \"0.4686299\",\n \"0.46834576\",\n \"0.4675214\",\n \"0.46568915\",\n \"0.46549225\",\n \"0.46528262\",\n \"0.46462974\",\n \"0.46432546\",\n \"0.46197426\",\n \"0.46151957\",\n \"0.4612583\",\n \"0.46122026\",\n \"0.46104497\",\n \"0.4606627\",\n \"0.45991054\",\n \"0.4597971\",\n \"0.4597233\",\n \"0.4596367\",\n \"0.45957458\",\n \"0.45931968\",\n \"0.45918024\",\n \"0.4587215\",\n \"0.45820367\",\n \"0.4581961\",\n \"0.45796165\",\n \"0.457747\",\n \"0.45768154\",\n \"0.45755538\",\n \"0.45748508\",\n \"0.45746854\",\n \"0.45619628\",\n \"0.4560936\",\n \"0.4558748\",\n \"0.45580864\",\n \"0.45580238\",\n \"0.4557787\",\n \"0.4557749\",\n \"0.4551155\",\n \"0.4550193\",\n \"0.45492452\",\n \"0.45460588\",\n \"0.4543454\",\n \"0.4542276\",\n \"0.45356154\",\n \"0.45339152\",\n \"0.45273808\",\n \"0.45262384\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7586039"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":26198,"cells":{"query":{"kind":"string","value":"Get the path by tracing labels back from end to start."},"document":{"kind":"string","value":"private List<Edge<String>> getPath(Vertex<String> end,\n Vertex<String> start) {\n if (graph.label(end) != null) {\n List<Edge<String>> path = new ArrayList<>();\n\n Vertex<String> cur = end;\n Edge<String> road;\n while (cur != start) {\n road = (Edge<String>) graph.label(cur); // unchecked cast ok\n path.add(road);\n cur = graph.from(road);\n }\n return path;\n }\n return null;\n }"},"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 LinkedList<IVertex<String>> getPath(IVertex<String> target) {\n\n LinkedList<IVertex<String>> path = new LinkedList<IVertex<String>>();\n\n IVertex<String> step = target;\n\n // check if a path exists\n if (predecessors.get(step) == null) {\n return null;\n }\n path.add(step);\n while (predecessors.get(step) != null) {\n step = predecessors.get(step);\n path.add(step);\n }\n // Put it into the correct order\n Collections.reverse(path);\n return path;\n }","private String backtrackPath(int[][] backtrack, int startRow) {\r\n\t\t// start the path with the state given by startRow\r\n\t\tString path = states[startRow].toString();\r\n\t\t// initialize curRow to the starting row\r\n\t\tint curRow = startRow;\r\n\t\t// loop over all columns backwards through the matrix\r\n\t\tfor (int i = backtrack[0].length - 1; i >= 0; --i) {\r\n\t\t\t// update the current row by backtracking\r\n\t\t\tcurRow = backtrack[curRow][i];\r\n\t\t\t// add this new state to the front of the string\r\n\t\t\tpath = states[curRow].toString() + path;\r\n\t\t}\r\n\t\t\r\n\t\treturn path;\r\n\t}","public String findFromToEnd(int end) {\n StringBuilder sb = new StringBuilder() ;\n ArrayList paths = new ArrayList() ;\n while (end != start) {\n\n paths.add(\"From \" + pred[end] + \" go to \" + end + \"\\n\") ;\n end = pred[end] ;\n\n }\n int count = paths.size() ;\n while (count > 0) {\n sb.append(paths.get(count-1)) ;\n count-- ;\n }\n return sb.toString() ;\n\n }","private void backTrack(String start, AdjVertex end, Vertex parent){\r\n\t\tif(parent.name.compareToIgnoreCase(start) == 0){ \r\n\t\t\t//if we have found our way back to the start, then we print the result\r\n\t\t\tif(pathStack.isEmpty()){\r\n\t\t\t\tSystem.out.println(start + \" -- \" + end.name);\r\n\t\t\t}\r\n\t\t\telse{\r\n\t\t\t\tSystem.out.print(start + \" -- \" + end.name);\r\n\t\t\t\twhile(!pathStack.isEmpty()){\r\n\t\t\t\t\tSystem.out.print(\" -- \" + pathStack.pop());\r\n\t\t\t\t}\r\n\t\t\t\tSystem.out.println();\r\n\t\t\t}\r\n\t\t}\r\n\t\t//if we still have to find our way back to the first person,\r\n\t\t//we push the end name into the stack, \r\n\t\telse{ \r\n\t\t\tpathStack.push(end.name);\r\n\t\t\tconnector(start, parent.name);\r\n\t\t}\r\n\t}","private LinkedList<Node> backtraceFromGoal(Node Target, Node Start) {\n LinkedList<Node> pathList = new LinkedList<>();\n\n pathList.add(Target);\n Node currentNode = null;\n /*ЕСЛИ финишная ячейка помечена\n ТО\n перейти в финишную ячейку\n ЦИКЛ\n выбрать среди соседних ячейку, помеченную числом на 1 меньше числа в текущей ячейке\n перейти в выбранную ячейку и добавить её к пути\n ПОКА текущая ячейка — не стартовая\n ВОЗВРАТ путь найден\n ИНАЧЕ\n ВОЗВРАТ путь не найден*/\n\n\n return pathList;\n }","private List<Edge<T>> getPath(T target) {\n List<Edge<T>> path = new LinkedList<>();\n T step = target;\n // check if a path exists\n if (predecessors.get(step) == null) {\n return path;\n }\n while (predecessors.get(step) != null) {\n T endVertex = step;\n step = predecessors.get(step);\n T startVertex = step;\n path.add(getEdge(startVertex, endVertex));\n }\n // Put it into the correct order\n Collections.reverse(path);\n return path;\n }","private static ArrayList<String> getPath(SearchTreeNode last) {\n\t\tArrayList<String> result = new ArrayList<>();\n\t\tfor (SearchTreeNode current = last; current.parent != null; current = current.parent) {\n\t\t\tresult.add(current.action);\n\t\t}\n\t\tCollections.reverse(result);\n\t\treturn result;\n\t}","private void computePath(){\n LinkedStack<T> reversePath = new LinkedStack<T>();\n // adding end vertex to reversePath\n T current = end; // first node is the end one\n while (!current.equals(start)){\n reversePath.push(current); // adding current to path\n current = closestPredecessor[vertexIndex(current)]; // changing to closest predecessor to current\n }\n reversePath.push(current); // adding the start vertex\n \n while (!reversePath.isEmpty()){\n path.enqueue(reversePath.pop());\n }\n }","@Override\n\tpublic List<Path> getOutEdges(Location src) {\n\t\treturn \tpaths.get(locations.indexOf(src));\n\t}","private void tracePath(Node lastVisitedNode)\r\n {\r\n Node pathPtr = lastVisitedNode;\r\n while (pathPtr != Start)\r\n {\r\n pathPtr.isVisited = true;\r\n pathPtr = pathPtr.parent;\r\n }\r\n }","public List<Node> findPath(Node start);","public Label\ngetStartLabel();","public ArrayList<Vertex> getPath(Vertex target) {\n\t\tArrayList<Vertex> path = new ArrayList<Vertex>();\n\t\tVertex step = target;\n\t\t// check if a path exists\n\t\tif (predecessors.get(step) == null) {\n\t\t\treturn null;\n\t\t}\n\t\tpath.add(step);\n\t\twhile (predecessors.get(step) != null) {\n\t\t\tstep = predecessors.get(step);\n\t\t\tpath.add(step);\n\t\t}\n\t\t// Put it into the correct order\n\t\tCollections.reverse(path);\n\n\n\t\tVertex current=null;\n\t\tVertex next=null;\n\t\tint length = path.size();\n\t\tfor(int i=0;i<length-1;i++){\n current = path.get(i);\n\t\t\t next = path.get(i+1);\n\t\t\tif(!rapid && (nodeColor_map.get(current.getName()).equalsIgnoreCase(\"dB\")||\n\t\t\t\t\tnodeColor_map.get(next.getName()).equalsIgnoreCase(\"dB\")))\n\t\t\t\trapid = true;\n\t\t\troute_length+= edge_length_map.get(new Pair(current,next));\n\t\t}\n\n\t\treturn path;\n\t}","private List<Edge> getPath(Vertex source) {\n\t\tint [] predecessors = new ShortestPath().findShortestPath(this.residualNetwork, source);\n\t\tList<Edge> path = retrieveEdgesFromPredecessorArray(predecessors);\n\t\treturn path;\n\t}","private void setPath(){\r\n // get the reversed path\r\n ArrayList<Grid> reversedPath = new ArrayList<>();\r\n int index = _endIndex;\r\n reversedPath.add(_map.get_grid(index));\r\n while(index != _startIndex){\r\n index = _map.get_grid(index).get_parent();\r\n reversedPath.add(_map.get_grid(index));\r\n }\r\n\r\n // get the final path in the correct order\r\n int length = reversedPath.size();\r\n for(int i=length-1;i>=0;i--){\r\n _path.add(reversedPath.get(i));\r\n }\r\n }","public LinkedList<Vertex> getPath(Vertex target) {\n LinkedList<Vertex> path = new LinkedList<Vertex>();\n Vertex step = target;\n // check if a path exists\n if (predecessors.get(step) == null) {\n return null;\n }\n path.add(step);\n while (predecessors.get(step) != null) {\n step = predecessors.get(step);\n path.add(step);\n }\n // Put it into the correct order\n Collections.reverse(path);\n return path;\n }","@Override\n\tpublic ArrayList<Edge<Object>> getPath(String startNode, String endNode) {\n\t\treturn null;\n\t}","public List<WeightedPoint> getPath()\n {\n return getPath(this.tail);\n }","java.lang.String getPaths(int index);","public static void showPath(Shape start, Shape end, Vector<Shape> shapes, String label) {\n\t\tVector<Edge> paths = getEdgeDest(start, shapes);\n\t\tfor (Edge edge : paths) {\n\t\t\tif (edge.getEdgeLabel().getLabel() == label) {\n\t\t\t\trecursiveFindPath(edge, end);\n\t\t\t}\n\t\t}\n\t}","protected String printablePath(IVertex<String> target){\n\n String lineout = \"\";\n\n LinkedList<IVertex<String>> path = this.getPath(target);\n\n IVertex<String> previous = null;\n\n IVertex<String> next = null;\n\n if(path!=null) {\n Iterator<IVertex<String>> it = path.iterator();\n\n while (it.hasNext()) {\n\n previous = next;\n\n next = it.next();\n\n IWeightedEdge<String> prevedge = null;\n\n if(previous!=null && next!=null){\n prevedge = this.weightedGraph.getEdge(previous,next);\n }\n\n if(prevedge!=null)\n lineout+= \" \" +prevedge.getWeight() + \" \";\n\n lineout += \" \" + next.getValue() + \" \";\n }\n }\n return lineout;\n }","TreeNodeValueModel<T>[] path();","public String getPath()\r\n/* 26: */ {\r\n/* 27:57 */ return this.path;\r\n/* 28: */ }","public String getBackwardNode() {\r\n\t\ttry {\r\n\t\t\treturn path.getPreviousNode(procNode);\r\n\t\t} catch (Exception e) {return null; /* In case of an error!*/}\r\n\t}","public LinkedList<City> getPath(City target) {\r\n\r\n\t\tLinkedList<City> path = new LinkedList<City>();\r\n \t\tCity step = target;\r\n\t\t// check if a path exists\r\n\t\tif (predecessors.get(step) == null) {\r\n\t\t\treturn null;\r\n\t\t}\r\n\t\tpath.add(step);\r\n\t\twhile (predecessors.get(step) != null) {\r\n\t\t\tstep = predecessors.get(step);\r\n\t\t\tpath.add(step);\r\n\t\t}\r\n\t\t// Put it into the correct order\r\n\t\tCollections.reverse(path);\r\n\t\treturn path;\r\n\t}","private Stack<MapLocation> returnPath(MapLocation goal, MapLocation start) {\n\t\tStack<MapLocation> path = new Stack<MapLocation>();\n\n\t\tMapLocation iter = goal;\n\t\twhile (iter.cameFrom != null) {\n\t\t\tpath.add(iter.cameFrom);\n\t\t\titer = iter.cameFrom;\n\t\t}\n\t\t// to remove start\n\n\t\tif (path.isEmpty()) {\n\t\t\treturn path;\n\t\t}\n\n\t\tpath.pop();\n\n\t\treturn path;\n\t}","public String getPath() { \n\t\treturn getPathElement().getValue();\n\t}","public String getDescendencyPath() {\n if (isLeaf()) {\n return getName();\n }\n else {\n return getName() + \".\" + getChild().getDescendencyPath();\n }\n }","private Square[] returnPath(Vertex v, GameBoard b) {\n // because we're starting at the end point,\n // we need build the path in 'reverse'\n Stack<Square> path = new Stack<Square>();\n\n // while we're not at the start point\n while ( v.dist != 0 ) {\n path.push(vertexToSquare(v,b));\n v = v.path;\n }\n\n // place the locations in the proper order\n Square[] road = new Square[path.size()];\n for ( int i = 0; i < path.size(); i++ )\n road[i] = path.pop();\n\n return road;\n }","Path getPath();","private List<Node> backTrackFrom(Node start, Node end, Stack<Node> path, Map<Node,Integer> distance) {\n\t\tfinal List<Node> shortestPath = new ArrayList<Node>();\n\t\tNode n;\n\t\tNode current = start;\n\t\tshortestPath.add(start);\n\t\twhile (!path.isEmpty()) {\n\t\t\tn = path.pop();\n\t\t\t// checks the distance and adds the corresponding neighbor node\n\t\t\tif (current.getNeighbors().contains(n) && distance.get(n) + 1 == distance.get(current)) {\n\t\t\t\tshortestPath.add(n);\n\t\t\t\tcurrent = n;\n\t\t\t\t// stop adding to shortestPath once s is found\n\t\t\t\tif (n.equals(end))\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tCollections.reverse(shortestPath);\n\t\treturn shortestPath;\n\t}","public void branchChainTo(Label label) {\n\t\t if (this.statements != null) {\n\t\t \tthis.statements[statements.length - 1].branchChainTo(label);\n\t\t }\n\t}","public List<Integer> getPath(int endId) throws IllegalArgumentException, IllegalStateException;","IPath getPath();","private Queue<T> backtrace(T node, Map<T, T> parentMap) {\n LinkedList<T> path = new LinkedList<>();\n path.add(node);\n\n int previousX, previousY, currentX, currentY;\n int dx, dy;\n int steps;\n T temp;\n while (parentMap.containsKey(node)) {\n previousX = parentMap.get(node).x;\n previousY = parentMap.get(node).y;\n currentX = node.x;\n currentY = node.y;\n steps = Integer.max(Math.abs(previousX - currentX), Math.abs(previousY - currentY));\n dx = Integer.compare(previousX, currentX);\n dy = Integer.compare(previousY, currentY);\n\n temp = node;\n for (int i = 0; i < steps; i++) {\n temp = graph.getNode(temp.x + dx, temp.y + dy);\n path.addFirst(temp);\n }\n\n node = parentMap.get(node);\n }\n return path;\n }","public Path getPath();","private static void backtrace(int dest, int[] parents) {\n int node = dest;\n\n // Hmmm.... need some code.\n System.out.println(\"Path\" );\n\n }","CtPath getPath();","public Stack<Position> getReturnPath() {\n\t\treturn returnPath;\n\t}","public static Path getOnePathTo(ARGState pLastElement) {\n Path path = new Path();\n Set<ARGState> seenElements = new HashSet<ARGState>();\n\n // each element of the path consists of the abstract state and the outgoing\n // edge to its successor\n\n ARGState currentARGState = pLastElement;\n // add the error node and its -first- outgoing edge\n // that edge is not important so we pick the first even\n // if there are more outgoing edges\n\n CFANode loc = extractLocation(currentARGState);\n CFAEdge lastEdge = null;\n if (loc.getNumLeavingEdges() > 0) {\n lastEdge = loc.getLeavingEdge(0);\n }\n /*\n\n */\n path.addFirst(Pair.of(currentARGState, lastEdge));\n seenElements.add(currentARGState);\n\n while (!currentARGState.getParents().isEmpty()) {\n Iterator<ARGState> parents = currentARGState.getParents().iterator();\n\n ARGState parentElement = parents.next();\n //System.out.println(currentARGState.getStateId()+\":\"+parentElement);\n while (!seenElements.add(parentElement) && parents.hasNext()) {\n // while seenElements already contained parentElement, try next parent\n parentElement = parents.next();\n // System.out.println(currentARGState.getStateId()+\":\"+parentElement);\n }\n\n CFAEdge edge = parentElement.getEdgeToChild(currentARGState);\n path.addFirst(Pair.of(parentElement, edge));\n //输出当前路径\n //System.out.println(currentARGState.getStateId()+\",\"+currentARGState.getValuesOfKeyVariables());\n //System.out.println(edge);\n currentARGState = parentElement;\n\n //测试用\n /*if(!(edge instanceof CAssumeEdge) &&edge.getRawStatement().contains(\"a3\")){\n System.out.println(currentARGState.getStateId()+\":\"+currentARGState.getValuesOfKeyVariables());\n }*/\n\n }\n // System.out.println(\"跳出getOnePathTo\");\n return path;\n }","PathSegments getPath();","public String getPathName();","@Override\n\t\tpublic String getPathTranslated() {\n\t\t\treturn null;\n\t\t}","Iterable<Vertex> computePathToGraph(Loc start, Vertex end) throws GraphException;","@Override\n public List<String> pathFromDisambiguation(ResolvedTime now) {\n return now.toHierarchy();\n }","public Label getEndLabel() {\n\treturn endLabel;\n }","public AbstractPathElement<V, E> getPrevPathElement()\r\n/* */ {\r\n/* 188 */ return this.prevPathElement;\r\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 }","public Stack<Node> retrieve_fastest_path() {\r\n return findPath(initial_node, end_node);\r\n }","java.lang.String getSourcepath(int index);","java.lang.String getSourcepath(int index);","public java.lang.String getCurrentPath() {\n java.lang.Object ref = currentPath_;\n if (ref instanceof java.lang.String) {\n return (java.lang.String) ref;\n } else {\n com.google.protobuf.ByteString bs = \n (com.google.protobuf.ByteString) ref;\n java.lang.String s = bs.toStringUtf8();\n currentPath_ = s;\n return s;\n }\n }","public PathCode getCurPathCode() { return /*appliedTo.curPathCode*/currentpathcode;}","String getPathName();","String getPathName();","private List<Node> getIntermediatePath(final Node source, final Node target) {\n if (P[source.id][target.id] == null) {\n return new ArrayList<Node>();\n }\n final List<Node> path = new ArrayList<Node>();\n path.addAll(getIntermediatePath(source, P[source.id][target.id]));\n path.add(P[source.id][target.id]);\n path.addAll(getIntermediatePath(P[source.id][target.id], target));\n return path;\n }","private static String getLabel(State from, State to) {\n String label = transitionLabels.get(hashOf(from, to));\n if (label != null)\n return label;\n else\n return \"\";\n }","java.lang.String getProcessorpath(int index);","Iterable<Vertex> computePath(Vertex start, Vertex end) throws GraphException;","public String getPath(String from, String to, String pathAlgo);","public com.google.protobuf.ByteString\n getPathBytes(int index) {\n return path_.getByteString(index);\n }","@Override\n\tpublic String getDirection(List<String> path) {\n\n\t\tString nextMove = path.get(path.size() - 1);\n\t\tif (nextMove.equals(\"TOP\")) {\n\t\t\treturn \"DOWN\";\n\t\t} else if (nextMove.equals(\"DOWN\")) {\n\t\t\treturn \"TOP\";\n\t\t} else if (nextMove.equals(\"LEFT\")) {\n\t\t\treturn \"RIGHT\";\n\t\t} else if (nextMove.equals(\"RIGHT\")) {\n\t\t\treturn \"LEFT\";\n\t\t}\n\t\treturn \"\";\n\t}","public List<Vertex> getShortestPathTo(Vertex target)\n {\n List<Vertex> path = new ArrayList<Vertex>();\n for (Vertex vertex = target; vertex != null; vertex = vertex.previous)\n path.add(vertex);\n Collections.reverse(path);\n return path;\n }","public String getRelPath () throws java.io.IOException, com.linar.jintegra.AutomationException;","java.lang.String getParent();","java.lang.String getParent();","public String getPath()\n {\n \tif (_nodeVRL==null)\n \t\treturn null;\n \t\n return _nodeVRL.getPath();\n }","public StringBuffer pathTo(int v) {\n if (!hasPathTo(v)) return null;\n StringBuffer pathInfo = new StringBuffer();\n for (SiteEdge e = edgeTo[v]; e != null; e = edgeTo[e.from()]) {\n \tpathInfo.insert(0, siteMap.get(e.from()).getSiteNo()+\",\");\n }\n pathInfo.append(siteMap.get(v).getSiteNo());\n return pathInfo;\n }","public java.lang.String getCurrentPath() {\n java.lang.Object ref = currentPath_;\n if (!(ref instanceof java.lang.String)) {\n com.google.protobuf.ByteString bs =\n (com.google.protobuf.ByteString) ref;\n java.lang.String s = bs.toStringUtf8();\n currentPath_ = s;\n return s;\n } else {\n return (java.lang.String) ref;\n }\n }","void flipPath(int lastNode) {\n int myLastNode = lastNode;\n while (myLastNode != EMPTY_LABEL) {\n int parent = this.tLabels[myLastNode];\n\n // Add (parent, lastNode) to matching. We don't need to\n // explicitly remove any edges from the matching because:\n // * We know at this point that there is no i such that\n // sMatches[i] = lastNode.\n // * Although there might be some j such that tMatches[j] =\n // parent, that j must be sLabels[parent], and will change\n // tMatches[j] in the next time through this loop.\n this.sMatches[parent] = lastNode;\n this.tMatches[myLastNode] = parent;\n\n myLastNode = this.sLabels[parent];\n }\n }","private void buildPath() {\r\n int xNext = 1;\r\n int yNext = map.getStartPos() + 1;\r\n CellLayered before = cells[yNext][xNext];\r\n while(true)\r\n {\r\n Byte[] xy = map.getDirection(xNext-1, yNext-1);\r\n xNext = xNext + xy[0];\r\n yNext = yNext + xy[1];\r\n\r\n CellLayered next = cells[yNext][xNext];\r\n\r\n if(xy[0]==-1)\r\n before.setRight(false);\r\n else\r\n before.setRight(true);\r\n before.setPath(true);\r\n if(next==null)\r\n break;\r\n\r\n before.setNextInPath(next);\r\n before = next;\r\n }\r\n }","public BlockPath getPath() {\n BlockPath path = new BlockPath();\n path.addPathNodeToPathFront(this);\n CourseComponent nodeAbove = parent;\n while (nodeAbove != null) {\n path.addPathNodeToPathFront(nodeAbove);\n nodeAbove = nodeAbove.getParent();\n }\n return path;\n }","@Override\n protected String handleGetExceptionPath()\n {\n\n final StateVertexFacade target = this.getTarget();\n\n if (target instanceof GuiForward)\n {\n\n return (target).getFullyQualifiedNamePath() + \".gui\";\n\n } else if (target instanceof GuiFinalState)\n {\n\n return ((GuiFinalState) target).getFullyQualifiedNamePath();\n\n } else\n {\n\n return \"\";\n\n }\n\n }","private void traversePath()\n\t{\n\t\trobot.forward(50);\n\t\trobot.right(90);\n\t\trobot.forward(50);\n\t\trobot.right(90);\n\t\trobot.forward(50);\n\t\trobot.left(90);\n\t\trobot.forward(50);\n\t\trobot.left(90);\n\t}","public SoNode \ngetCurPathTail() \n{\n//#ifdef DEBUG\n if (currentpath.getTail() != (SoFullPath.cast(getCurPath())).getTail()){\n SoDebugError.post(\"SoAction::getCurPathTail\\n\", \n \"Inconsistent path tail. Did you change the scene graph\\n\"+\n \"During traversal?\\n\");\n }\n//#endif /*DEBUG*/\n return(currentpath.getTail());\n}","@Override\n\tpublic String getPathTranslated() {\n\t\treturn null;\n\t}","public int getNumberOfPaths(){ \r\n HashMap<FlowGraphNode, Integer> number = new HashMap<>();\r\n LinkedList<FlowGraphNode> queue = new LinkedList<>();\r\n HashMap<FlowGraphNode, Integer> label = new HashMap<>();\r\n \r\n label.put(start,1);\r\n queue.add(start);\r\n do{\r\n FlowGraphNode node = queue.pop();\r\n for(FlowGraphNode child : node.to){\r\n int count = number.getOrDefault(child, child.inDeg()) -1;\r\n if(count == 0){\r\n queue.add(child);\r\n number.remove(child);\r\n //label\r\n int sum = 0;\r\n for(FlowGraphNode anc : child.from){\r\n sum += label.get(anc);\r\n }\r\n label.put(child,sum);\r\n }else{\r\n number.put(child, count);\r\n }\r\n }\r\n }while(!queue.isEmpty());\r\n \r\n if(!number.isEmpty()){\r\n //there has to be a loop in the graph\r\n return -1;\r\n }\r\n \r\n return label.get(end);\r\n }","public String getPath() {\n \tStringBuilder path = new StringBuilder();\n \tint s = this.getSelectedIndex();\n \tif (s <= 0 ) s = 0;\n \tJPiereIADTabpanel p = tabPanelList.get(s);\n \tfor (int i = 0; i <= s; i++) {\n \t\tString n = null;\n \t\tif (i == s)\n \t\t\tn = p.getTitle();\n \t\telse {\n \t\t\tJPiereIADTabpanel t = tabPanelList.get(i);\n \t\t\tif (t.getTabLevel() < p.getTabLevel())\n \t\t\t\tn = t.getTitle();\n \t\t}\n \t\tif (n != null) {\n \t\t\tif (path.length() > 0) {\n \t\t\t\tpath.append(\" > \");\n \t\t\t}\n \t\t\tpath.append(n);\n \t\t}\n \t}\n\n \treturn path.toString();\n }","public java.lang.String getPath(int index) {\n return path_.get(index);\n }","private void buildLabelLocs() {\n this.labelLocs = new HashMap<String, Integer>();\n for (int n = 0; n < this.code.size(); n++) {\n TACOp op = this.code.get(n);\n if (op.getType() == TACOpType.LABEL) {\n this.labelLocs.put(op.getLabel(), n);\n }\n }\n }","private Stack path(Graph graph, GraphNode start, GraphNode end) throws GraphException {\n\t\tGraph g = graph;\n\t\tGraphNode b = start;\n\t\tGraphNode e = end;\n\t\tGraphNode temp;\n\t\tStack p;\n\n\t\t// mark the beginning point and push it to the stack.\n\t\tb.setMark(true);\n\t\tedgeStack.push(b);\n\n\t\t// check if the starting and end point are equal.\n\t\tif (b == e) {\n\t\t\treturn edgeStack;\n\t\t}\n\t\t// iterates until it reaches the end point\n\t\telse {\n\t\t\t// initializes edges to the edges incident on node b\n\t\t\tIterator<GraphEdge> edges = graph.incidentEdges(b);\n\n\t\t\t// iterates until it reaches the end of nodes\n\t\t\twhile (edges.hasNext()) {\n\t\t\t\ttemp = edges.next().secondEndpoint();\n\n\t\t\t\t// checks if the second point of the edge has been discovered\n\t\t\t\tif (temp.getMark() == false ) {\n\t\t\t\t\tp = path(g, temp, e);\n\n\t\t\t\t\t// if the path ends return null\n\t\t\t\t\tif (p != null) {\n\t\t\t\t\t\treturn p;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tedgeStack.pop();\n\t\t}\n\t\treturn null;\n\t}","private void gotoPath() {\n\t\tfinal String hdfs = getFullPath(txtRootPath.getText().trim());\n\t\tif (StringUtils.isEmpty(hdfs)) {\n\t\t\treturn;\n\t\t}\n\t\ttry {\n\t\t\tFileStatus fs = getFileStatusWithProgress(hdfs);\n\t\t\tgotoPath(fs);\n\t\t} catch (Exception e) {\n\t\t\tMessageDialog.openError(getShell(), Messages.msgError, e.getMessage());\n\t\t}\n\t}","private String getLabel(int index) throws Exception{\n for (CodyFileReader.Trial t : trials){\n if (t.start <= index && index < t.end) \n return t.label;\n }\n \n return null;\n }","public int path(){\n\t\treturn this.path;\n\t}","int getLabelOffset();","public java.lang.String getPath(int index) {\n return path_.get(index);\n }","public com.google.protobuf.ByteString\n getPathBytes(int index) {\n return path_.getByteString(index);\n }","private void printPath() {\n // generate and print the shortest path.\n if (this == this.previous) {\n graphPathRef.add(this);\n } else if (this.previous == null) {\n System.out.print(\"\");\n } else {\n graphPathRef.add(this);\n this.previous.printPath();\n }\n }","java.lang.String getXpath();","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 String getPath() {\n\t\treturn getString(\"path\");\n\t}","void printPath(Coordinate endName) {\n if (!graph.containsKey(endName)) {\n // test use, display point\n // System.err.printf(\"Graph doesn't contain end vertex \\\"%s\\\"\\n\", endName);\n return;\n }\n graph.get(endName).printPath();\n }","public Path getPath(){\n return this.path;\n }","public PathOrBuilder getSourcePathOrBuilder(\n int index) {\n if (sourcePathBuilder_ == null) {\n return sourcePath_.get(index); } else {\n return sourcePathBuilder_.getMessageOrBuilder(index);\n }\n }","String getLocationLabel();","public Position[] getPath() {\n\t\treturn path;\n\t}","public String getShortestPath(T begin, T end);","public String getPath() \r\n\t{\r\n\t\tStringBuilder pathBuilder = new StringBuilder();\r\n\t\tfor(Cell c: path)\r\n\t\t\tpathBuilder.append(\" (\" + c.getRow() + ',' + c.getColumn() + ')');\r\n\t\t\r\n\t\treturn pathBuilder.toString();\r\n\t}","@Override\n public BPath getBPath() {\n if (getThread() == null)\n {\n if (DEBUG) Timber.e(\"Owner Thread is null\");\n return null;\n }\n return getThread().getBPath().addPathComponent(BFirebaseDefines.Path.BMessagesPath, entityID);\n }","private Iterable<V> reconstructPath(V last, V from, HashMap<V, V> previous){\n LinkedList<V> ret = new LinkedList<>();\n ret.addFirst(last);\n while (!last.equals(from)){\n V prev = previous.get(last);\n ret.addFirst(prev);\n last = prev;\n }\n return ret;\n }"],"string":"[\n \"protected LinkedList<IVertex<String>> getPath(IVertex<String> target) {\\n\\n LinkedList<IVertex<String>> path = new LinkedList<IVertex<String>>();\\n\\n IVertex<String> step = target;\\n\\n // check if a path exists\\n if (predecessors.get(step) == null) {\\n return null;\\n }\\n path.add(step);\\n while (predecessors.get(step) != null) {\\n step = predecessors.get(step);\\n path.add(step);\\n }\\n // Put it into the correct order\\n Collections.reverse(path);\\n return path;\\n }\",\n \"private String backtrackPath(int[][] backtrack, int startRow) {\\r\\n\\t\\t// start the path with the state given by startRow\\r\\n\\t\\tString path = states[startRow].toString();\\r\\n\\t\\t// initialize curRow to the starting row\\r\\n\\t\\tint curRow = startRow;\\r\\n\\t\\t// loop over all columns backwards through the matrix\\r\\n\\t\\tfor (int i = backtrack[0].length - 1; i >= 0; --i) {\\r\\n\\t\\t\\t// update the current row by backtracking\\r\\n\\t\\t\\tcurRow = backtrack[curRow][i];\\r\\n\\t\\t\\t// add this new state to the front of the string\\r\\n\\t\\t\\tpath = states[curRow].toString() + path;\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\treturn path;\\r\\n\\t}\",\n \"public String findFromToEnd(int end) {\\n StringBuilder sb = new StringBuilder() ;\\n ArrayList paths = new ArrayList() ;\\n while (end != start) {\\n\\n paths.add(\\\"From \\\" + pred[end] + \\\" go to \\\" + end + \\\"\\\\n\\\") ;\\n end = pred[end] ;\\n\\n }\\n int count = paths.size() ;\\n while (count > 0) {\\n sb.append(paths.get(count-1)) ;\\n count-- ;\\n }\\n return sb.toString() ;\\n\\n }\",\n \"private void backTrack(String start, AdjVertex end, Vertex parent){\\r\\n\\t\\tif(parent.name.compareToIgnoreCase(start) == 0){ \\r\\n\\t\\t\\t//if we have found our way back to the start, then we print the result\\r\\n\\t\\t\\tif(pathStack.isEmpty()){\\r\\n\\t\\t\\t\\tSystem.out.println(start + \\\" -- \\\" + end.name);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse{\\r\\n\\t\\t\\t\\tSystem.out.print(start + \\\" -- \\\" + end.name);\\r\\n\\t\\t\\t\\twhile(!pathStack.isEmpty()){\\r\\n\\t\\t\\t\\t\\tSystem.out.print(\\\" -- \\\" + pathStack.pop());\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tSystem.out.println();\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t//if we still have to find our way back to the first person,\\r\\n\\t\\t//we push the end name into the stack, \\r\\n\\t\\telse{ \\r\\n\\t\\t\\tpathStack.push(end.name);\\r\\n\\t\\t\\tconnector(start, parent.name);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"private LinkedList<Node> backtraceFromGoal(Node Target, Node Start) {\\n LinkedList<Node> pathList = new LinkedList<>();\\n\\n pathList.add(Target);\\n Node currentNode = null;\\n /*ЕСЛИ финишная ячейка помечена\\n ТО\\n перейти в финишную ячейку\\n ЦИКЛ\\n выбрать среди соседних ячейку, помеченную числом на 1 меньше числа в текущей ячейке\\n перейти в выбранную ячейку и добавить её к пути\\n ПОКА текущая ячейка — не стартовая\\n ВОЗВРАТ путь найден\\n ИНАЧЕ\\n ВОЗВРАТ путь не найден*/\\n\\n\\n return pathList;\\n }\",\n \"private List<Edge<T>> getPath(T target) {\\n List<Edge<T>> path = new LinkedList<>();\\n T step = target;\\n // check if a path exists\\n if (predecessors.get(step) == null) {\\n return path;\\n }\\n while (predecessors.get(step) != null) {\\n T endVertex = step;\\n step = predecessors.get(step);\\n T startVertex = step;\\n path.add(getEdge(startVertex, endVertex));\\n }\\n // Put it into the correct order\\n Collections.reverse(path);\\n return path;\\n }\",\n \"private static ArrayList<String> getPath(SearchTreeNode last) {\\n\\t\\tArrayList<String> result = new ArrayList<>();\\n\\t\\tfor (SearchTreeNode current = last; current.parent != null; current = current.parent) {\\n\\t\\t\\tresult.add(current.action);\\n\\t\\t}\\n\\t\\tCollections.reverse(result);\\n\\t\\treturn result;\\n\\t}\",\n \"private void computePath(){\\n LinkedStack<T> reversePath = new LinkedStack<T>();\\n // adding end vertex to reversePath\\n T current = end; // first node is the end one\\n while (!current.equals(start)){\\n reversePath.push(current); // adding current to path\\n current = closestPredecessor[vertexIndex(current)]; // changing to closest predecessor to current\\n }\\n reversePath.push(current); // adding the start vertex\\n \\n while (!reversePath.isEmpty()){\\n path.enqueue(reversePath.pop());\\n }\\n }\",\n \"@Override\\n\\tpublic List<Path> getOutEdges(Location src) {\\n\\t\\treturn \\tpaths.get(locations.indexOf(src));\\n\\t}\",\n \"private void tracePath(Node lastVisitedNode)\\r\\n {\\r\\n Node pathPtr = lastVisitedNode;\\r\\n while (pathPtr != Start)\\r\\n {\\r\\n pathPtr.isVisited = true;\\r\\n pathPtr = pathPtr.parent;\\r\\n }\\r\\n }\",\n \"public List<Node> findPath(Node start);\",\n \"public Label\\ngetStartLabel();\",\n \"public ArrayList<Vertex> getPath(Vertex target) {\\n\\t\\tArrayList<Vertex> path = new ArrayList<Vertex>();\\n\\t\\tVertex step = target;\\n\\t\\t// check if a path exists\\n\\t\\tif (predecessors.get(step) == null) {\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t\\tpath.add(step);\\n\\t\\twhile (predecessors.get(step) != null) {\\n\\t\\t\\tstep = predecessors.get(step);\\n\\t\\t\\tpath.add(step);\\n\\t\\t}\\n\\t\\t// Put it into the correct order\\n\\t\\tCollections.reverse(path);\\n\\n\\n\\t\\tVertex current=null;\\n\\t\\tVertex next=null;\\n\\t\\tint length = path.size();\\n\\t\\tfor(int i=0;i<length-1;i++){\\n current = path.get(i);\\n\\t\\t\\t next = path.get(i+1);\\n\\t\\t\\tif(!rapid && (nodeColor_map.get(current.getName()).equalsIgnoreCase(\\\"dB\\\")||\\n\\t\\t\\t\\t\\tnodeColor_map.get(next.getName()).equalsIgnoreCase(\\\"dB\\\")))\\n\\t\\t\\t\\trapid = true;\\n\\t\\t\\troute_length+= edge_length_map.get(new Pair(current,next));\\n\\t\\t}\\n\\n\\t\\treturn path;\\n\\t}\",\n \"private List<Edge> getPath(Vertex source) {\\n\\t\\tint [] predecessors = new ShortestPath().findShortestPath(this.residualNetwork, source);\\n\\t\\tList<Edge> path = retrieveEdgesFromPredecessorArray(predecessors);\\n\\t\\treturn path;\\n\\t}\",\n \"private void setPath(){\\r\\n // get the reversed path\\r\\n ArrayList<Grid> reversedPath = new ArrayList<>();\\r\\n int index = _endIndex;\\r\\n reversedPath.add(_map.get_grid(index));\\r\\n while(index != _startIndex){\\r\\n index = _map.get_grid(index).get_parent();\\r\\n reversedPath.add(_map.get_grid(index));\\r\\n }\\r\\n\\r\\n // get the final path in the correct order\\r\\n int length = reversedPath.size();\\r\\n for(int i=length-1;i>=0;i--){\\r\\n _path.add(reversedPath.get(i));\\r\\n }\\r\\n }\",\n \"public LinkedList<Vertex> getPath(Vertex target) {\\n LinkedList<Vertex> path = new LinkedList<Vertex>();\\n Vertex step = target;\\n // check if a path exists\\n if (predecessors.get(step) == null) {\\n return null;\\n }\\n path.add(step);\\n while (predecessors.get(step) != null) {\\n step = predecessors.get(step);\\n path.add(step);\\n }\\n // Put it into the correct order\\n Collections.reverse(path);\\n return path;\\n }\",\n \"@Override\\n\\tpublic ArrayList<Edge<Object>> getPath(String startNode, String endNode) {\\n\\t\\treturn null;\\n\\t}\",\n \"public List<WeightedPoint> getPath()\\n {\\n return getPath(this.tail);\\n }\",\n \"java.lang.String getPaths(int index);\",\n \"public static void showPath(Shape start, Shape end, Vector<Shape> shapes, String label) {\\n\\t\\tVector<Edge> paths = getEdgeDest(start, shapes);\\n\\t\\tfor (Edge edge : paths) {\\n\\t\\t\\tif (edge.getEdgeLabel().getLabel() == label) {\\n\\t\\t\\t\\trecursiveFindPath(edge, end);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"protected String printablePath(IVertex<String> target){\\n\\n String lineout = \\\"\\\";\\n\\n LinkedList<IVertex<String>> path = this.getPath(target);\\n\\n IVertex<String> previous = null;\\n\\n IVertex<String> next = null;\\n\\n if(path!=null) {\\n Iterator<IVertex<String>> it = path.iterator();\\n\\n while (it.hasNext()) {\\n\\n previous = next;\\n\\n next = it.next();\\n\\n IWeightedEdge<String> prevedge = null;\\n\\n if(previous!=null && next!=null){\\n prevedge = this.weightedGraph.getEdge(previous,next);\\n }\\n\\n if(prevedge!=null)\\n lineout+= \\\" \\\" +prevedge.getWeight() + \\\" \\\";\\n\\n lineout += \\\" \\\" + next.getValue() + \\\" \\\";\\n }\\n }\\n return lineout;\\n }\",\n \"TreeNodeValueModel<T>[] path();\",\n \"public String getPath()\\r\\n/* 26: */ {\\r\\n/* 27:57 */ return this.path;\\r\\n/* 28: */ }\",\n \"public String getBackwardNode() {\\r\\n\\t\\ttry {\\r\\n\\t\\t\\treturn path.getPreviousNode(procNode);\\r\\n\\t\\t} catch (Exception e) {return null; /* In case of an error!*/}\\r\\n\\t}\",\n \"public LinkedList<City> getPath(City target) {\\r\\n\\r\\n\\t\\tLinkedList<City> path = new LinkedList<City>();\\r\\n \\t\\tCity step = target;\\r\\n\\t\\t// check if a path exists\\r\\n\\t\\tif (predecessors.get(step) == null) {\\r\\n\\t\\t\\treturn null;\\r\\n\\t\\t}\\r\\n\\t\\tpath.add(step);\\r\\n\\t\\twhile (predecessors.get(step) != null) {\\r\\n\\t\\t\\tstep = predecessors.get(step);\\r\\n\\t\\t\\tpath.add(step);\\r\\n\\t\\t}\\r\\n\\t\\t// Put it into the correct order\\r\\n\\t\\tCollections.reverse(path);\\r\\n\\t\\treturn path;\\r\\n\\t}\",\n \"private Stack<MapLocation> returnPath(MapLocation goal, MapLocation start) {\\n\\t\\tStack<MapLocation> path = new Stack<MapLocation>();\\n\\n\\t\\tMapLocation iter = goal;\\n\\t\\twhile (iter.cameFrom != null) {\\n\\t\\t\\tpath.add(iter.cameFrom);\\n\\t\\t\\titer = iter.cameFrom;\\n\\t\\t}\\n\\t\\t// to remove start\\n\\n\\t\\tif (path.isEmpty()) {\\n\\t\\t\\treturn path;\\n\\t\\t}\\n\\n\\t\\tpath.pop();\\n\\n\\t\\treturn path;\\n\\t}\",\n \"public String getPath() { \\n\\t\\treturn getPathElement().getValue();\\n\\t}\",\n \"public String getDescendencyPath() {\\n if (isLeaf()) {\\n return getName();\\n }\\n else {\\n return getName() + \\\".\\\" + getChild().getDescendencyPath();\\n }\\n }\",\n \"private Square[] returnPath(Vertex v, GameBoard b) {\\n // because we're starting at the end point,\\n // we need build the path in 'reverse'\\n Stack<Square> path = new Stack<Square>();\\n\\n // while we're not at the start point\\n while ( v.dist != 0 ) {\\n path.push(vertexToSquare(v,b));\\n v = v.path;\\n }\\n\\n // place the locations in the proper order\\n Square[] road = new Square[path.size()];\\n for ( int i = 0; i < path.size(); i++ )\\n road[i] = path.pop();\\n\\n return road;\\n }\",\n \"Path getPath();\",\n \"private List<Node> backTrackFrom(Node start, Node end, Stack<Node> path, Map<Node,Integer> distance) {\\n\\t\\tfinal List<Node> shortestPath = new ArrayList<Node>();\\n\\t\\tNode n;\\n\\t\\tNode current = start;\\n\\t\\tshortestPath.add(start);\\n\\t\\twhile (!path.isEmpty()) {\\n\\t\\t\\tn = path.pop();\\n\\t\\t\\t// checks the distance and adds the corresponding neighbor node\\n\\t\\t\\tif (current.getNeighbors().contains(n) && distance.get(n) + 1 == distance.get(current)) {\\n\\t\\t\\t\\tshortestPath.add(n);\\n\\t\\t\\t\\tcurrent = n;\\n\\t\\t\\t\\t// stop adding to shortestPath once s is found\\n\\t\\t\\t\\tif (n.equals(end))\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tCollections.reverse(shortestPath);\\n\\t\\treturn shortestPath;\\n\\t}\",\n \"public void branchChainTo(Label label) {\\n\\t\\t if (this.statements != null) {\\n\\t\\t \\tthis.statements[statements.length - 1].branchChainTo(label);\\n\\t\\t }\\n\\t}\",\n \"public List<Integer> getPath(int endId) throws IllegalArgumentException, IllegalStateException;\",\n \"IPath getPath();\",\n \"private Queue<T> backtrace(T node, Map<T, T> parentMap) {\\n LinkedList<T> path = new LinkedList<>();\\n path.add(node);\\n\\n int previousX, previousY, currentX, currentY;\\n int dx, dy;\\n int steps;\\n T temp;\\n while (parentMap.containsKey(node)) {\\n previousX = parentMap.get(node).x;\\n previousY = parentMap.get(node).y;\\n currentX = node.x;\\n currentY = node.y;\\n steps = Integer.max(Math.abs(previousX - currentX), Math.abs(previousY - currentY));\\n dx = Integer.compare(previousX, currentX);\\n dy = Integer.compare(previousY, currentY);\\n\\n temp = node;\\n for (int i = 0; i < steps; i++) {\\n temp = graph.getNode(temp.x + dx, temp.y + dy);\\n path.addFirst(temp);\\n }\\n\\n node = parentMap.get(node);\\n }\\n return path;\\n }\",\n \"public Path getPath();\",\n \"private static void backtrace(int dest, int[] parents) {\\n int node = dest;\\n\\n // Hmmm.... need some code.\\n System.out.println(\\\"Path\\\" );\\n\\n }\",\n \"CtPath getPath();\",\n \"public Stack<Position> getReturnPath() {\\n\\t\\treturn returnPath;\\n\\t}\",\n \"public static Path getOnePathTo(ARGState pLastElement) {\\n Path path = new Path();\\n Set<ARGState> seenElements = new HashSet<ARGState>();\\n\\n // each element of the path consists of the abstract state and the outgoing\\n // edge to its successor\\n\\n ARGState currentARGState = pLastElement;\\n // add the error node and its -first- outgoing edge\\n // that edge is not important so we pick the first even\\n // if there are more outgoing edges\\n\\n CFANode loc = extractLocation(currentARGState);\\n CFAEdge lastEdge = null;\\n if (loc.getNumLeavingEdges() > 0) {\\n lastEdge = loc.getLeavingEdge(0);\\n }\\n /*\\n\\n */\\n path.addFirst(Pair.of(currentARGState, lastEdge));\\n seenElements.add(currentARGState);\\n\\n while (!currentARGState.getParents().isEmpty()) {\\n Iterator<ARGState> parents = currentARGState.getParents().iterator();\\n\\n ARGState parentElement = parents.next();\\n //System.out.println(currentARGState.getStateId()+\\\":\\\"+parentElement);\\n while (!seenElements.add(parentElement) && parents.hasNext()) {\\n // while seenElements already contained parentElement, try next parent\\n parentElement = parents.next();\\n // System.out.println(currentARGState.getStateId()+\\\":\\\"+parentElement);\\n }\\n\\n CFAEdge edge = parentElement.getEdgeToChild(currentARGState);\\n path.addFirst(Pair.of(parentElement, edge));\\n //输出当前路径\\n //System.out.println(currentARGState.getStateId()+\\\",\\\"+currentARGState.getValuesOfKeyVariables());\\n //System.out.println(edge);\\n currentARGState = parentElement;\\n\\n //测试用\\n /*if(!(edge instanceof CAssumeEdge) &&edge.getRawStatement().contains(\\\"a3\\\")){\\n System.out.println(currentARGState.getStateId()+\\\":\\\"+currentARGState.getValuesOfKeyVariables());\\n }*/\\n\\n }\\n // System.out.println(\\\"跳出getOnePathTo\\\");\\n return path;\\n }\",\n \"PathSegments getPath();\",\n \"public String getPathName();\",\n \"@Override\\n\\t\\tpublic String getPathTranslated() {\\n\\t\\t\\treturn null;\\n\\t\\t}\",\n \"Iterable<Vertex> computePathToGraph(Loc start, Vertex end) throws GraphException;\",\n \"@Override\\n public List<String> pathFromDisambiguation(ResolvedTime now) {\\n return now.toHierarchy();\\n }\",\n \"public Label getEndLabel() {\\n\\treturn endLabel;\\n }\",\n \"public AbstractPathElement<V, E> getPrevPathElement()\\r\\n/* */ {\\r\\n/* 188 */ return this.prevPathElement;\\r\\n/* */ }\",\n \"@Override\\r\\n public List<T> breadthFirstPath(T start, T end) {\\r\\n\\r\\n Vertex<T> startV = vertices.get(start);\\r\\n Vertex<T> endV = vertices.get(end);\\r\\n\\r\\n LinkedList<Vertex<T>> vertexList = new LinkedList<>();\\r\\n //Set<Vertex<T>> visited = new HashSet<>();\\r\\n ArrayList<Vertex<T>> visited = new ArrayList<>();\\r\\n\\r\\n LinkedList<Vertex<T>> pred = new LinkedList<>();\\r\\n int currIndex = 0;\\r\\n\\r\\n pred.add(null);\\r\\n\\r\\n vertexList.add(startV);\\r\\n visited.add(startV);\\r\\n\\r\\n LinkedList<T> path = new LinkedList<>();\\r\\n\\r\\n if (breadthFirstSearch(start, end) == false) {\\r\\n path = new LinkedList<>();\\r\\n return path;\\r\\n } else {\\r\\n while (vertexList.size() > 0) {\\r\\n Vertex<T> next = vertexList.poll();\\r\\n if(next == null){\\r\\n continue;\\r\\n }\\r\\n if (next == endV) {\\r\\n path.add(endV.getValue());\\r\\n break;\\r\\n }\\r\\n for (Vertex<T> neighbor : next.getNeighbors()) {\\r\\n if (!visited.contains(neighbor)) {\\r\\n pred.add(next);\\r\\n visited.add(neighbor);\\r\\n vertexList.add(neighbor);\\r\\n }\\r\\n }\\r\\n currIndex++;\\r\\n //path.add(next.getValue());\\r\\n\\r\\n }\\r\\n while (currIndex != 0) {\\r\\n Vertex<T> parent = pred.get(currIndex);\\r\\n path.add(parent.getValue());\\r\\n currIndex = visited.indexOf(parent);\\r\\n }\\r\\n }\\r\\n Collections.reverse(path);\\r\\n return path;\\r\\n }\",\n \"public Stack<Node> retrieve_fastest_path() {\\r\\n return findPath(initial_node, end_node);\\r\\n }\",\n \"java.lang.String getSourcepath(int index);\",\n \"java.lang.String getSourcepath(int index);\",\n \"public java.lang.String getCurrentPath() {\\n java.lang.Object ref = currentPath_;\\n if (ref instanceof java.lang.String) {\\n return (java.lang.String) ref;\\n } else {\\n com.google.protobuf.ByteString bs = \\n (com.google.protobuf.ByteString) ref;\\n java.lang.String s = bs.toStringUtf8();\\n currentPath_ = s;\\n return s;\\n }\\n }\",\n \"public PathCode getCurPathCode() { return /*appliedTo.curPathCode*/currentpathcode;}\",\n \"String getPathName();\",\n \"String getPathName();\",\n \"private List<Node> getIntermediatePath(final Node source, final Node target) {\\n if (P[source.id][target.id] == null) {\\n return new ArrayList<Node>();\\n }\\n final List<Node> path = new ArrayList<Node>();\\n path.addAll(getIntermediatePath(source, P[source.id][target.id]));\\n path.add(P[source.id][target.id]);\\n path.addAll(getIntermediatePath(P[source.id][target.id], target));\\n return path;\\n }\",\n \"private static String getLabel(State from, State to) {\\n String label = transitionLabels.get(hashOf(from, to));\\n if (label != null)\\n return label;\\n else\\n return \\\"\\\";\\n }\",\n \"java.lang.String getProcessorpath(int index);\",\n \"Iterable<Vertex> computePath(Vertex start, Vertex end) throws GraphException;\",\n \"public String getPath(String from, String to, String pathAlgo);\",\n \"public com.google.protobuf.ByteString\\n getPathBytes(int index) {\\n return path_.getByteString(index);\\n }\",\n \"@Override\\n\\tpublic String getDirection(List<String> path) {\\n\\n\\t\\tString nextMove = path.get(path.size() - 1);\\n\\t\\tif (nextMove.equals(\\\"TOP\\\")) {\\n\\t\\t\\treturn \\\"DOWN\\\";\\n\\t\\t} else if (nextMove.equals(\\\"DOWN\\\")) {\\n\\t\\t\\treturn \\\"TOP\\\";\\n\\t\\t} else if (nextMove.equals(\\\"LEFT\\\")) {\\n\\t\\t\\treturn \\\"RIGHT\\\";\\n\\t\\t} else if (nextMove.equals(\\\"RIGHT\\\")) {\\n\\t\\t\\treturn \\\"LEFT\\\";\\n\\t\\t}\\n\\t\\treturn \\\"\\\";\\n\\t}\",\n \"public List<Vertex> getShortestPathTo(Vertex target)\\n {\\n List<Vertex> path = new ArrayList<Vertex>();\\n for (Vertex vertex = target; vertex != null; vertex = vertex.previous)\\n path.add(vertex);\\n Collections.reverse(path);\\n return path;\\n }\",\n \"public String getRelPath () throws java.io.IOException, com.linar.jintegra.AutomationException;\",\n \"java.lang.String getParent();\",\n \"java.lang.String getParent();\",\n \"public String getPath()\\n {\\n \\tif (_nodeVRL==null)\\n \\t\\treturn null;\\n \\t\\n return _nodeVRL.getPath();\\n }\",\n \"public StringBuffer pathTo(int v) {\\n if (!hasPathTo(v)) return null;\\n StringBuffer pathInfo = new StringBuffer();\\n for (SiteEdge e = edgeTo[v]; e != null; e = edgeTo[e.from()]) {\\n \\tpathInfo.insert(0, siteMap.get(e.from()).getSiteNo()+\\\",\\\");\\n }\\n pathInfo.append(siteMap.get(v).getSiteNo());\\n return pathInfo;\\n }\",\n \"public java.lang.String getCurrentPath() {\\n java.lang.Object ref = currentPath_;\\n if (!(ref instanceof java.lang.String)) {\\n com.google.protobuf.ByteString bs =\\n (com.google.protobuf.ByteString) ref;\\n java.lang.String s = bs.toStringUtf8();\\n currentPath_ = s;\\n return s;\\n } else {\\n return (java.lang.String) ref;\\n }\\n }\",\n \"void flipPath(int lastNode) {\\n int myLastNode = lastNode;\\n while (myLastNode != EMPTY_LABEL) {\\n int parent = this.tLabels[myLastNode];\\n\\n // Add (parent, lastNode) to matching. We don't need to\\n // explicitly remove any edges from the matching because:\\n // * We know at this point that there is no i such that\\n // sMatches[i] = lastNode.\\n // * Although there might be some j such that tMatches[j] =\\n // parent, that j must be sLabels[parent], and will change\\n // tMatches[j] in the next time through this loop.\\n this.sMatches[parent] = lastNode;\\n this.tMatches[myLastNode] = parent;\\n\\n myLastNode = this.sLabels[parent];\\n }\\n }\",\n \"private void buildPath() {\\r\\n int xNext = 1;\\r\\n int yNext = map.getStartPos() + 1;\\r\\n CellLayered before = cells[yNext][xNext];\\r\\n while(true)\\r\\n {\\r\\n Byte[] xy = map.getDirection(xNext-1, yNext-1);\\r\\n xNext = xNext + xy[0];\\r\\n yNext = yNext + xy[1];\\r\\n\\r\\n CellLayered next = cells[yNext][xNext];\\r\\n\\r\\n if(xy[0]==-1)\\r\\n before.setRight(false);\\r\\n else\\r\\n before.setRight(true);\\r\\n before.setPath(true);\\r\\n if(next==null)\\r\\n break;\\r\\n\\r\\n before.setNextInPath(next);\\r\\n before = next;\\r\\n }\\r\\n }\",\n \"public BlockPath getPath() {\\n BlockPath path = new BlockPath();\\n path.addPathNodeToPathFront(this);\\n CourseComponent nodeAbove = parent;\\n while (nodeAbove != null) {\\n path.addPathNodeToPathFront(nodeAbove);\\n nodeAbove = nodeAbove.getParent();\\n }\\n return path;\\n }\",\n \"@Override\\n protected String handleGetExceptionPath()\\n {\\n\\n final StateVertexFacade target = this.getTarget();\\n\\n if (target instanceof GuiForward)\\n {\\n\\n return (target).getFullyQualifiedNamePath() + \\\".gui\\\";\\n\\n } else if (target instanceof GuiFinalState)\\n {\\n\\n return ((GuiFinalState) target).getFullyQualifiedNamePath();\\n\\n } else\\n {\\n\\n return \\\"\\\";\\n\\n }\\n\\n }\",\n \"private void traversePath()\\n\\t{\\n\\t\\trobot.forward(50);\\n\\t\\trobot.right(90);\\n\\t\\trobot.forward(50);\\n\\t\\trobot.right(90);\\n\\t\\trobot.forward(50);\\n\\t\\trobot.left(90);\\n\\t\\trobot.forward(50);\\n\\t\\trobot.left(90);\\n\\t}\",\n \"public SoNode \\ngetCurPathTail() \\n{\\n//#ifdef DEBUG\\n if (currentpath.getTail() != (SoFullPath.cast(getCurPath())).getTail()){\\n SoDebugError.post(\\\"SoAction::getCurPathTail\\\\n\\\", \\n \\\"Inconsistent path tail. Did you change the scene graph\\\\n\\\"+\\n \\\"During traversal?\\\\n\\\");\\n }\\n//#endif /*DEBUG*/\\n return(currentpath.getTail());\\n}\",\n \"@Override\\n\\tpublic String getPathTranslated() {\\n\\t\\treturn null;\\n\\t}\",\n \"public int getNumberOfPaths(){ \\r\\n HashMap<FlowGraphNode, Integer> number = new HashMap<>();\\r\\n LinkedList<FlowGraphNode> queue = new LinkedList<>();\\r\\n HashMap<FlowGraphNode, Integer> label = new HashMap<>();\\r\\n \\r\\n label.put(start,1);\\r\\n queue.add(start);\\r\\n do{\\r\\n FlowGraphNode node = queue.pop();\\r\\n for(FlowGraphNode child : node.to){\\r\\n int count = number.getOrDefault(child, child.inDeg()) -1;\\r\\n if(count == 0){\\r\\n queue.add(child);\\r\\n number.remove(child);\\r\\n //label\\r\\n int sum = 0;\\r\\n for(FlowGraphNode anc : child.from){\\r\\n sum += label.get(anc);\\r\\n }\\r\\n label.put(child,sum);\\r\\n }else{\\r\\n number.put(child, count);\\r\\n }\\r\\n }\\r\\n }while(!queue.isEmpty());\\r\\n \\r\\n if(!number.isEmpty()){\\r\\n //there has to be a loop in the graph\\r\\n return -1;\\r\\n }\\r\\n \\r\\n return label.get(end);\\r\\n }\",\n \"public String getPath() {\\n \\tStringBuilder path = new StringBuilder();\\n \\tint s = this.getSelectedIndex();\\n \\tif (s <= 0 ) s = 0;\\n \\tJPiereIADTabpanel p = tabPanelList.get(s);\\n \\tfor (int i = 0; i <= s; i++) {\\n \\t\\tString n = null;\\n \\t\\tif (i == s)\\n \\t\\t\\tn = p.getTitle();\\n \\t\\telse {\\n \\t\\t\\tJPiereIADTabpanel t = tabPanelList.get(i);\\n \\t\\t\\tif (t.getTabLevel() < p.getTabLevel())\\n \\t\\t\\t\\tn = t.getTitle();\\n \\t\\t}\\n \\t\\tif (n != null) {\\n \\t\\t\\tif (path.length() > 0) {\\n \\t\\t\\t\\tpath.append(\\\" > \\\");\\n \\t\\t\\t}\\n \\t\\t\\tpath.append(n);\\n \\t\\t}\\n \\t}\\n\\n \\treturn path.toString();\\n }\",\n \"public java.lang.String getPath(int index) {\\n return path_.get(index);\\n }\",\n \"private void buildLabelLocs() {\\n this.labelLocs = new HashMap<String, Integer>();\\n for (int n = 0; n < this.code.size(); n++) {\\n TACOp op = this.code.get(n);\\n if (op.getType() == TACOpType.LABEL) {\\n this.labelLocs.put(op.getLabel(), n);\\n }\\n }\\n }\",\n \"private Stack path(Graph graph, GraphNode start, GraphNode end) throws GraphException {\\n\\t\\tGraph g = graph;\\n\\t\\tGraphNode b = start;\\n\\t\\tGraphNode e = end;\\n\\t\\tGraphNode temp;\\n\\t\\tStack p;\\n\\n\\t\\t// mark the beginning point and push it to the stack.\\n\\t\\tb.setMark(true);\\n\\t\\tedgeStack.push(b);\\n\\n\\t\\t// check if the starting and end point are equal.\\n\\t\\tif (b == e) {\\n\\t\\t\\treturn edgeStack;\\n\\t\\t}\\n\\t\\t// iterates until it reaches the end point\\n\\t\\telse {\\n\\t\\t\\t// initializes edges to the edges incident on node b\\n\\t\\t\\tIterator<GraphEdge> edges = graph.incidentEdges(b);\\n\\n\\t\\t\\t// iterates until it reaches the end of nodes\\n\\t\\t\\twhile (edges.hasNext()) {\\n\\t\\t\\t\\ttemp = edges.next().secondEndpoint();\\n\\n\\t\\t\\t\\t// checks if the second point of the edge has been discovered\\n\\t\\t\\t\\tif (temp.getMark() == false ) {\\n\\t\\t\\t\\t\\tp = path(g, temp, e);\\n\\n\\t\\t\\t\\t\\t// if the path ends return null\\n\\t\\t\\t\\t\\tif (p != null) {\\n\\t\\t\\t\\t\\t\\treturn p;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tedgeStack.pop();\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"private void gotoPath() {\\n\\t\\tfinal String hdfs = getFullPath(txtRootPath.getText().trim());\\n\\t\\tif (StringUtils.isEmpty(hdfs)) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\ttry {\\n\\t\\t\\tFileStatus fs = getFileStatusWithProgress(hdfs);\\n\\t\\t\\tgotoPath(fs);\\n\\t\\t} catch (Exception e) {\\n\\t\\t\\tMessageDialog.openError(getShell(), Messages.msgError, e.getMessage());\\n\\t\\t}\\n\\t}\",\n \"private String getLabel(int index) throws Exception{\\n for (CodyFileReader.Trial t : trials){\\n if (t.start <= index && index < t.end) \\n return t.label;\\n }\\n \\n return null;\\n }\",\n \"public int path(){\\n\\t\\treturn this.path;\\n\\t}\",\n \"int getLabelOffset();\",\n \"public java.lang.String getPath(int index) {\\n return path_.get(index);\\n }\",\n \"public com.google.protobuf.ByteString\\n getPathBytes(int index) {\\n return path_.getByteString(index);\\n }\",\n \"private void printPath() {\\n // generate and print the shortest path.\\n if (this == this.previous) {\\n graphPathRef.add(this);\\n } else if (this.previous == null) {\\n System.out.print(\\\"\\\");\\n } else {\\n graphPathRef.add(this);\\n this.previous.printPath();\\n }\\n }\",\n \"java.lang.String getXpath();\",\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 String getPath() {\\n\\t\\treturn getString(\\\"path\\\");\\n\\t}\",\n \"void printPath(Coordinate endName) {\\n if (!graph.containsKey(endName)) {\\n // test use, display point\\n // System.err.printf(\\\"Graph doesn't contain end vertex \\\\\\\"%s\\\\\\\"\\\\n\\\", endName);\\n return;\\n }\\n graph.get(endName).printPath();\\n }\",\n \"public Path getPath(){\\n return this.path;\\n }\",\n \"public PathOrBuilder getSourcePathOrBuilder(\\n int index) {\\n if (sourcePathBuilder_ == null) {\\n return sourcePath_.get(index); } else {\\n return sourcePathBuilder_.getMessageOrBuilder(index);\\n }\\n }\",\n \"String getLocationLabel();\",\n \"public Position[] getPath() {\\n\\t\\treturn path;\\n\\t}\",\n \"public String getShortestPath(T begin, T end);\",\n \"public String getPath() \\r\\n\\t{\\r\\n\\t\\tStringBuilder pathBuilder = new StringBuilder();\\r\\n\\t\\tfor(Cell c: path)\\r\\n\\t\\t\\tpathBuilder.append(\\\" (\\\" + c.getRow() + ',' + c.getColumn() + ')');\\r\\n\\t\\t\\r\\n\\t\\treturn pathBuilder.toString();\\r\\n\\t}\",\n \"@Override\\n public BPath getBPath() {\\n if (getThread() == null)\\n {\\n if (DEBUG) Timber.e(\\\"Owner Thread is null\\\");\\n return null;\\n }\\n return getThread().getBPath().addPathComponent(BFirebaseDefines.Path.BMessagesPath, entityID);\\n }\",\n \"private Iterable<V> reconstructPath(V last, V from, HashMap<V, V> previous){\\n LinkedList<V> ret = new LinkedList<>();\\n ret.addFirst(last);\\n while (!last.equals(from)){\\n V prev = previous.get(last);\\n ret.addFirst(prev);\\n last = prev;\\n }\\n return ret;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.60260016","0.59370637","0.5937007","0.58844805","0.5817005","0.58126265","0.5801257","0.5786069","0.56865394","0.55991036","0.55725574","0.5541935","0.55298626","0.5526854","0.55133563","0.5501968","0.5496783","0.5468478","0.5462103","0.5378485","0.5377501","0.5370461","0.5370219","0.53229403","0.5294607","0.5289201","0.5281472","0.5271027","0.52703273","0.52698714","0.52657753","0.5257148","0.5245027","0.52280587","0.52255106","0.5194636","0.5191019","0.51861686","0.5183983","0.5178202","0.5169765","0.5161652","0.51498294","0.51379657","0.51330745","0.5122351","0.5122342","0.5115358","0.51082474","0.51019096","0.51019096","0.50959593","0.5091121","0.50903106","0.50903106","0.5081079","0.5078458","0.50704885","0.5064537","0.50544125","0.5036329","0.50318027","0.5030752","0.50273776","0.5018672","0.5018672","0.5017795","0.50150764","0.5012048","0.50101656","0.50012505","0.49986568","0.49981126","0.49958622","0.49936596","0.4991058","0.49845102","0.49796224","0.49770248","0.49607965","0.4950394","0.49473","0.49459606","0.49418446","0.49411467","0.493981","0.4939522","0.49384066","0.49371737","0.49362504","0.49350226","0.49312216","0.49305418","0.4929018","0.49214336","0.49202138","0.49191052","0.49183187","0.4917466","0.49130976"],"string":"[\n \"0.60260016\",\n \"0.59370637\",\n \"0.5937007\",\n \"0.58844805\",\n \"0.5817005\",\n \"0.58126265\",\n \"0.5801257\",\n \"0.5786069\",\n \"0.56865394\",\n \"0.55991036\",\n \"0.55725574\",\n \"0.5541935\",\n \"0.55298626\",\n \"0.5526854\",\n \"0.55133563\",\n \"0.5501968\",\n \"0.5496783\",\n \"0.5468478\",\n \"0.5462103\",\n \"0.5378485\",\n \"0.5377501\",\n \"0.5370461\",\n \"0.5370219\",\n \"0.53229403\",\n \"0.5294607\",\n \"0.5289201\",\n \"0.5281472\",\n \"0.5271027\",\n \"0.52703273\",\n \"0.52698714\",\n \"0.52657753\",\n \"0.5257148\",\n \"0.5245027\",\n \"0.52280587\",\n \"0.52255106\",\n \"0.5194636\",\n \"0.5191019\",\n \"0.51861686\",\n \"0.5183983\",\n \"0.5178202\",\n \"0.5169765\",\n \"0.5161652\",\n \"0.51498294\",\n \"0.51379657\",\n \"0.51330745\",\n \"0.5122351\",\n \"0.5122342\",\n \"0.5115358\",\n \"0.51082474\",\n \"0.51019096\",\n \"0.51019096\",\n \"0.50959593\",\n \"0.5091121\",\n \"0.50903106\",\n \"0.50903106\",\n \"0.5081079\",\n \"0.5078458\",\n \"0.50704885\",\n \"0.5064537\",\n \"0.50544125\",\n \"0.5036329\",\n \"0.50318027\",\n \"0.5030752\",\n \"0.50273776\",\n \"0.5018672\",\n \"0.5018672\",\n \"0.5017795\",\n \"0.50150764\",\n \"0.5012048\",\n \"0.50101656\",\n \"0.50012505\",\n \"0.49986568\",\n \"0.49981126\",\n \"0.49958622\",\n \"0.49936596\",\n \"0.4991058\",\n \"0.49845102\",\n \"0.49796224\",\n \"0.49770248\",\n \"0.49607965\",\n \"0.4950394\",\n \"0.49473\",\n \"0.49459606\",\n \"0.49418446\",\n \"0.49411467\",\n \"0.493981\",\n \"0.4939522\",\n \"0.49384066\",\n \"0.49371737\",\n \"0.49362504\",\n \"0.49350226\",\n \"0.49312216\",\n \"0.49305418\",\n \"0.4929018\",\n \"0.49214336\",\n \"0.49202138\",\n \"0.49191052\",\n \"0.49183187\",\n \"0.4917466\",\n \"0.49130976\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6432541"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":26199,"cells":{"query":{"kind":"string","value":"Print the path found."},"document":{"kind":"string","value":"private void printPath(List<Edge<String>> path,\n double totalDistance) {\n if (path == null) {\n System.out.println(\"No path found\");\n return;\n }\n\n System.out.println(\"Total Distance: \" + totalDistance);\n for (int i = path.size() - 1; i >= 0; i--) {\n System.out.println(path.get(i).get() + \" \"\n + graph.label(path.get(i)));\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 printPath(){\n\t\tListIterator<Path> listIterator =temp.listIterator();\n\t\twhile(listIterator.hasNext()){\n\t\t\tSystem.out.print(listIterator.next().getPos()+\" \");\n\t\t}\n\t}","public void printPath() {\n System.out.print(\"Path: \");\n for (int i = 0; i < parents.size(); i++) {\n Cell cell = parents.get(i);\n System.out.print(\" (\" + cell.x + \",\" + cell.y + \") \");\n }\n System.out.println(\"\\nVisited cells: \" + visitedCells);\n System.out.println(\"Length of Path: \" + parents.size());\n }","public String print(){\n\t\treturn this.sonsPaths_.toString();\n\t}","public static void main(String[] args) {\n\t\tSystem.out.println(findPath(0,5));\r\n\t}","public void printPath()\r\n\t{\r\n\t\tSystem.out.print(\"+ +\");\r\n\t\tfor (int i = 1; i < this.getWidth(); i++)\r\n\t\t{\r\n\t\t\tSystem.out.print(\"-+\");\r\n\t\t}\r\n\t\tSystem.out.println();\r\n\r\n\t\tfor (int i = 0; i < this.getHeight(); i++)\r\n\t\t{\r\n\t\t\t\r\n\t\t\tfor (int j = 0; j < this.getWidth(); j++)\r\n\t\t\t{\r\n\t\t\t\tCell c = this.getCellAt(i, j);\r\n\t\t\t\t// if cells are connected, no wall is printed in between them\r\n\t\t\t\tif (c.hasDoorwayTo(Cell.WEST))\r\n\t\t\t\t\tSystem.out.print(\" \");\r\n\t\t\t\telse\r\n\t\t\t\t\tSystem.out.print(\"|\");\t\t\t\r\n\t\t\t\t\r\n\t\t\t\tif(path.contains(c))\r\n\t\t\t\t\tSystem.out.print(\"#\");\r\n\t\t\t\telse\r\n\t\t\t\t\tSystem.out.print(\" \");\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tSystem.out.println(\"|\");\r\n\t\t\t\r\n\t\t\tfor (int j = 0; j < this.getWidth(); j++)\r\n\t\t\t{\r\n\t\t\t\tCell c = this.getCellAt(i, j);\r\n\t\t\t\tSystem.out.print(\"+\");\r\n\r\n\t\t\t\tif (c.hasDoorwayTo(Cell.SOUTH) || c == this.getCellAt(getHeight()-1, getWidth()-1))\r\n\t\t\t\t\tSystem.out.print(\" \");\r\n\t\t\t\telse\r\n\t\t\t\t\tSystem.out.print(\"-\");\r\n\t\t\t}\r\n\t\t\tSystem.out.println(\"+\");\r\n\t\t}\r\n\t}","public void printDetails() \r\n\t{\r\n\t\t// Print cells in path\r\n\t\tSystem.out.print(\"Path:\");\r\n\t\tfor(Cell c: path)\r\n\t\t\tSystem.out.print(\" (\" + c.getRow() + ',' + c.getColumn() + ')');\r\n\t\t\r\n\t\t// Print path length\r\n\t\tSystem.out.println(\"\\nLength of path: \" + path.size());\r\n\t\t\r\n\t\t// Print visited cell amount\r\n\t\tint lastCell = path.size() - 1;\r\n\t\tint visitedCells = path.get(lastCell).getDiscoveryTime() + 1;\r\n\t\tSystem.out.println(\"Visited cells: \" + visitedCells + '\\n');\r\n\t}","void printFile(String path) {\n try {\n String[] readFileOutPut = readFile(path);\n for (int i = 0; i < readFileOutPut.length;i++) System.out.println(readFileOutPut[i]);\n } catch (Exception e) {\n e.printStackTrace();\n }\n }","public void print(){\n for(int i = 0; i < rootDir.length; i++){\n System.out.println(rootDir[i]);\n }\n }","public void printPath(int index){\n\t\tList<V> path=getPath(index);\n\n\t\tSystem.out.println(\"A path from \"+vertices.get(root)+\" to \"+vertices.get(index)+\": \");\n\t\tfor(int i=path.size()-1;i>=0;i--)\n\t\t\tSystem.out.print(path.get(i)+\" \");\n\n\t\t}","void pathFound(Node node);","private void printPath(LinkedList<String> visited) {\r\n\r\n if (flag == false) {\r\n System.out.println(\"Yes there exists a path between \" + START + \" and \" + END);\r\n }\r\n for (String node : visited) { //creating for loop to print the nodes stored in visited array \r\n System.out.print(node);\r\n System.out.print(\" \");\r\n }\r\n System.out.println();\r\n }","private void printPath() {\n // generate and print the shortest path.\n if (this == this.previous) {\n graphPathRef.add(this);\n } else if (this.previous == null) {\n System.out.print(\"\");\n } else {\n graphPathRef.add(this);\n this.previous.printPath();\n }\n }","public void printAllPaths() {\n\n if (root == null) System.out.println(\"No paths for you!\");\n else {\n printPaths(root.left, root.element.toString());\n printPaths(root.right, root.element.toString());\n }\n }","public void print() {\n\n if (root == null) // If the root does not exist, then we cannot print anything\n {\n System.out.println(\"The head does not exist \");\n return;\n }\n\n directory Fileptr = root;\n while (Fileptr != null) {\n System.out.print(Fileptr.a);\n System.out.print(\" ( Available Space \" + Fileptr.availableSpace + \" ) \" + \" ----> \");\n Fileptr = Fileptr.forward;\n }\n System.out.print(\" NULL \\n\");\n }","void printPath(Coordinate endName) {\n if (!graph.containsKey(endName)) {\n // test use, display point\n // System.err.printf(\"Graph doesn't contain end vertex \\\"%s\\\"\\n\", endName);\n return;\n }\n graph.get(endName).printPath();\n }","public void printPath(Vertice c) {\r\n Vertice actual = c;\r\n if (actual.previous != null) {\r\n printPath(actual.previous);\r\n System.out.print(\" --> \");\r\n System.out.print(actual.name);\r\n }\r\n if (actual.previous == null) {\r\n System.out.print(actual.name);\r\n }\r\n }","private void printPath( Vertex dest )\n {\n if( dest.prev != null )\n {\n printPath( dest.prev );\n // System.out.print( \" to \" );\n }\n System.out.print( dest.name +\" \" );\n }","public static void main(String[] args) {\n\n\t\tSystem.out.println(path(4,4));\n\t}","static void printPaths(Node node)\n\t{\n\t\tint path[] = new int[1000];\n\t\tprintPathsRecursive(node, path, 0);\n\t}","public void print() \n\t{\n\t\tSystem.out.println(\"existing files:\\n\");\n\t\tIterator<Entry<String, byte[]>> existing = this.existingFile.entrySet().iterator();\n\t\twhile (existing.hasNext()) \n\t\t{\n\t\t\tEntry<String, byte[]> entry = existing.next();\n\t\t\tString key = entry.getKey();\n\t\t\tbyte[] macValue = entry.getValue();\n\t\t\tSystem.out.println(key + \" - \" + bytes2HexString(macValue));\n\t\t}\n\t\t\n\t\tSystem.out.println(\"\\n\\nprefix files:\\n\");\n\t\tIterator<Entry<String, byte[]>> prefix = this.prefix.entrySet().iterator();\n\t\twhile (prefix.hasNext()) \n\t\t{\n\t\t\tEntry<String, byte[]> entry = prefix.next();\n\t\t\tString key = entry.getKey();\n\t\t\tbyte[] macValue = entry.getValue();\n\t\t\tSystem.out.println(key + \" - \" + bytes2HexString(macValue));\n\t\t}\n\t}","public void printPath(Vertex v) {\n if ( v.dist == 0 )\n return;\n printPath(v.path);\n System.out.print(\"-> \" + v.graphLoc+\" \");\n }","public void printFileNames() {\n DirectoryResource dr = new DirectoryResource();\n for (File f : dr.selectedFiles()) {\n System.out.println(f);\n }\n }","@Override\n\tpublic String toString() {\n\t\treturn getFullPath();\n\t}","public void detailTestPath() {\n // Get test run file\n File report_path = new File(System.getProperty(PATH) + TESTNG);\n // Check if the path exists\n if (!report_path.exists()) {\n System.out.println(SEE_THE_DETAIL_TEST__REPORT_ + System.getProperty(PATH) + LOGXML);\n // Get error log file\n File path = new File(System.getProperty(PATH) + ERROR_LOGLOGTXT);\n // If file exists then display error log file path\n if (path.exists()) {\n System.out.println(SEE_THE_DETAIL_ERROR__REPORT_ + System.getProperty(PATH) + ERROR_LOGLOGTXT);\n }\n }\n }","public void printAction() {\n this.folderList.get(currentFolder).printIt();\n }","public static void printPath(Tile[] path) {\n\t\tSystem.out.print(\"Path tiles: {\");\n\t\tfor (Tile tile : path) {\n\t\t\tSystem.out.print(tile + \",\");\n\t\t}\n\t\tSystem.out.println(\"}\");\n\t}","@Override\n\tpublic String toString() {\n\t\treturn path.toString();\n\t}","public void printPath( String destName )\n {\n \t DecimalFormat df = new DecimalFormat(\"###.##\");\n Vertex w = vertexMap.get( destName );\n if( w == null )\n throw new NoSuchElementException( \"Destination vertex not found\" );\n else if( w.dist == INFINITY )\n System.out.println( destName + \" is unreachable\" );\n else\n {\n //System.out.print( \"(Distance is: \" + w.dist + \") \" );\n printPath( w );\n System.out.println(df.format(w.dist) );\n }\n }","private void printPath(int currentVertex, int[] parents) {\n // Base case : Source node has been processed \n if (currentVertex == NO_PARENT) {\n return;\n }\n printPath(parents[currentVertex], parents);\n System.out.print(currentVertex + \" \");\n }","private void printSketchFolder() {\n File sketchFolder = sketch.getFolder();\n System.out.println(\"++++++++++sketch folder: [\" + sketchFolder.getAbsolutePath() + \"]\");\n }","public static void main(String[] args) {\n\t\t\n\t\tprintpath(3,0);\n\t\t//System.out.println(list);\n\t}","@Override\n\tpublic String toString() {\n\t\treturn this.f.getPath();\n\t}","public static void print_path(Stack<Node> st){\n for(int i=0;i<st.size();i++){\n System.out.print(st.elementAt(i).data+\" \");\n }\n }","public String showFind() {\n String findMessage = \"Ain't no problem! I have found the matchin' tasks in your list:\";\n return findMessage;\n }","public void print ()\n\t{\n\t\tSystem.out.println(\"Polyhedron File Name: \" + FileName);\n\t\tSystem.out.println(\"Object active: \" + Boolean.toString(isActive()));\n\t\tprintCoordinates();\n\t}","protected static void printPath(int[] thePath) {\r\n\t\t\r\n\t\tint[] orderedPath = new int[thePath.length];\r\n\t\r\n\t\tfor (int i = 0; i < thePath.length; i++)\r\n\t\t\torderedPath[i] = -1;\r\n\t\r\n\t\torderedPath[0] = myEndPole;\r\n\t\tint i = myEndPole;\r\n\t\tint j = 1;\r\n\t \r\n\t\twhile (true && j < orderedPath.length) {\t\r\n\t\t\tif (thePath[i] == -1 && i == START_POLE)\r\n\t\t\t\tbreak;\r\n\t\t\torderedPath[j] = thePath[i];\t\r\n\t\t\ti = thePath[i];\r\n\t\t\tj++;\r\n\t\t}\r\n\t\r\n\t\tSystem.out.print(\"The Shortest Path is \");\r\n\t\r\n\t\tfor (i = orderedPath.length - 1; i >= 0; i--) {\r\n\t\t\tif (orderedPath[i] == -1)\r\n\t\t\t\tcontinue;\r\n\t\t\tif (i == 0) {\r\n\t\t\t\tSystem.out.print((orderedPath[i] + 1));\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\tSystem.out.print((orderedPath[i] + 1) + \" -> \");\r\n\t\t}\r\n\r\n\t\tSystem.out.println();\r\n\t\tSystem.out.println();\r\n\t}","public static void main(String[] args) {\n\t\tPath iP = Paths.get(\"/\", \"First.txt\");\t// C\n\t\t//Path iP = Paths.toPath(\"/First.txt\");\t// D\n\t\tSystem.out.println(iP) ;\n\t}","private void showFinalPath() // run after end dest has been set\n {\n for(int i = 0; i < cities.size(); i++)\n System.out.println(cities.get(i));\n }","public void printDirectory() {\n System.out.println(\"Inventory:\");\n for (Ingredient i : stock.keySet()) {\n System.out.printf(\"%s, %d\\n\", i.getName(), stock.get(i));\n }\n System.out.println(\"Menu:\");\n int drink_number = 1;\n for (Drink d : drinks.keySet()) {\n\n System.out.printf(\"%d, %s, $%.2f, %b\\n\", drink_number++, d.getName(), d.getPrice(), inStock(d));\n }\n }","public void print_root(){\r\n\t\tfor(int id = 0; id < label.length; id++){\r\n\t\t\tSystem.out.printf(\"\"%d \"\", find(id));\r\n\t\t}\r\n\t\tSystem.out.printf(\"\"\\n\"\");\r\n\t}","@Override\n public String toString() {\n final StringBuilder buffer = new StringBuilder();\n try {\n formatPath(buffer, path, 0, indices);\n } catch (IOException e) {\n throw new AssertionError(e); // Should never happen, since we are writting to a StringBuilder.\n }\n return buffer.toString();\n }","public static void printLoadingFile() {\n System.out.println(Message.LOADING_FILE);\n }","public void displayPaths() {\r\n\t\tlog.debug(\"startPaths\");\r\n\t\tfor ( Map.Entry<Integer, Vector<Edge>> entry: startPaths.entrySet()) {\r\n\t\t\tfor ( Edge edge: entry.getValue()) {\r\n\t\t\t\tlog.debug( entry.getKey() + \": \" + edge.StartRoom + \"->\" + edge.door + \"->\" + edge.DestinationRoom );\r\n\t\t\t}\r\n\t\t}\r\n\t\tlog.debug(\"destinationPaths\");\r\n\t\tfor ( Map.Entry<Integer, Vector<Edge>> entry: destinationPaths.entrySet()) {\r\n\t\t\tfor ( Edge edge: entry.getValue()) {\r\n\t\t\t\tlog.debug( entry.getKey() + \": \" + edge.StartRoom + \"->\" + edge.door + \"->\" + edge.DestinationRoom );\r\n\t\t\t}\r\n\t\t}\r\n\t}","public static void printAvailableMaps() {\n \tFile folder = new File(\"./examples/\");\n \tFile[] listOfFiles = folder.listFiles();\n \tSystem.out.println(\"Available maps (choose one and start game with command 'game map_name' ) : \");\n\n \t for (int i = 0; i < listOfFiles.length; i++) {\n \t if (listOfFiles[i].isFile()) {\n \t System.out.println(\"\\t\"+listOfFiles[i].getName());\n \t } \n \t }\n }","public static void print(double[][] path)\n\t{\n\t\tSystem.out.println(\"X: \\t Y:\");\n\n\t\tfor(double[] u: path)\n\t\t\tSystem.out.println(u[0]+ \"\\t\" +u[1]);\n\t}","@Override\n\tpublic void find() {\n\t\tSystem.out.println(\"find method\");\n\t}","void print_path(int[]parent,int[]dist,int s)\n {\n System.out.println(); \n \n //path from s to all other vertices\n \n for(int i=0;i<parent.length;i++)\n {\n System.out.println(\"From \"+s+\" to \"+i);\n System.out.print(\"path: \");\n print_node(parent,i);\n System.out.print(\"END\");\n if(dist[i]==INF)\n System.out.println(\" cost=INF\"); \n else\n System.out.println(\" cost=\"+dist[i]);\n\n }\n \n \n System.out.println();\n \n\n \n }","static void Print(WellPathData wellPathData) {\n\t\tfor (WellPathPosition pos : wellPathData.getWellPathList()) {\n\t\t\tSystem.out.println(\"Measured Depth: \" + pos.getMeasuredDepth());\n\t\t\tSystem.out.println(\" Inline Pos: \" + pos.getInlinePos());\n\t\t\tSystem.out.println(\" Xline Pos: \" + pos.getXlinePos());\n\t\t\tSystem.out.println(\" True Vert. Depth: \" + pos.getTrueVerticalDepth());\t\t\t\n\t\t}\n\t}","@Override\n\tpublic void printToFile() {\n\t\t\n\t}","public String getPath() {\n if (foundNemo) {\n return path;\n } else {\n path = \"Uh Oh!! Could not find Nemo!!\";\n return path;\n }\n }","@Override\n public void printAllSubFilesAndFolders(String folderPath) {\n Path file = new File(folderPath).toPath();\n // boolean exists = Files.exists(file); // Check if the file exists\n boolean isDirectory = Files.isDirectory(file); // Check if it's a directory\n boolean isFile = Files.isRegularFile(file); // Check if it's a regular file\n if (isDirectory) {\n System.out.println(\"cd \"+file+\" %d\");\n System.out.println( System.getProperty(file.toString()));\n } else if (isFile) {\n System.out.println(\"dir\");\n }\n }","public static void main(String[] args) {\n\t\tPath path = Paths.get(\"F:\\\\AccentureMayBatch\\\\JSTLProject\");\r\n\r\n\t\r\n\r\n\t\tSystem.out.format(\"toString: %s%n\", path.toString());\r\n\t\tSystem.out.format(\"getFileName: %s%n\", path.getFileName());\r\n\t\tSystem.out.format(\"getName(0): %s%n\", path.getName(0));\r\n\t\tSystem.out.format(\"getNameCount: %d%n\", path.getNameCount());\r\n\t\tSystem.out.format(\"subpath(0,2): %s%n\", path.subpath(0,2));\r\n\t\tSystem.out.format(\"getParent: %s%n\", path.getParent());\r\n\t\tSystem.out.format(\"getRoot: %s%n\", path.getRoot());\r\n\t\t\r\n\t\ttry {\r\n\t\t\tFiles.list(new File(\".\").toPath())\r\n\t\t\t .forEach(System.out::println);\r\n\t\t\t\r\n\t\t\t\r\n\t\t\tFiles.walk(new File(\".\").toPath())\r\n\t\t .filter(p -> !p.getFileName()\r\n\t\t .toString().startsWith(\".\"))\r\n\t\t .forEach(System.out::println);\r\n\t\t\t\r\n\t\t\tFiles.lines(new File(\"./src/com/polaris/utility/PathDemo.java\").toPath())\r\n\t\t .map(s -> s.trim())\r\n\t\t .filter(s -> !s.isEmpty())\r\n\t\t .forEach(System.out::println);\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//finding path and sub path into string\r\n\t\t Path start = Paths.get(\".\");\r\n\t\t int maxDepth = 5;\r\n\t\t try (Stream<Path> stream = Files.find(start, maxDepth, (path2, attr) -> String.valueOf(path2).endsWith(\".java\"))) \r\n\t\t {\r\n\t\t String joined = stream\r\n\t\t .sorted()\r\n\t\t .map(String::valueOf)\r\n\t\t .collect(Collectors.joining(\"; \"));\r\n\t\t System.out.println(\"Found: \" + joined);\r\n\t\t } catch (IOException e1) {\r\n\t\t\t\t// TODO Auto-generated catch block\r\n\t\t\t\te1.printStackTrace();\r\n\t\t\t}\r\n\t\t \r\n\t\t\r\n\t\tPath source = Paths.get(\"./src/com/polaris/utility/PathDemo.java\");\r\n\t\tPath target = Paths.get(\"F:/yatrabakup\");\r\n\t\t\r\n/*\r\n\t\ttry {\r\n\t\t // Files.copy(source, target);\r\n\t\t} catch(FileAlreadyExistsException fae) {\r\n\t\t fae.printStackTrace();\r\n\t\t} catch (IOException e) {\r\n\t\t // something else went wrong\r\n\t\t e.printStackTrace();\r\n\t\t}\r\n\t\t*/\r\n\t\ttry (BufferedReader reader = Files.newBufferedReader(Paths.get(\"f:\\\\yatrabakup\\\\EmployeeData.csv\"))) {\r\n\t\t reader.lines().map(String::toLowerCase).forEach(System.out::println);\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}","void printToConsole() {\n\t\tSystem.out.println(\"PROVIDER DIRECTORY:\");\n\t\tfor (int i = 0; i < services.size(); i++) {\n\t\t\tString service = services.get(i).getServiceName() + \" (\" + services.get(i).getServiceNumber() + \") for $\" + services.get(i).getServiceFee();\n\t\t\tSystem.out.println(\"\\t\" + service);\n\t\t}\n\t}","public static void main(String[] args) throws IOException {\n\t\tPath testFilePath = Paths.get(\"/home/ilmir/Dropbox/Aliya_Ilmir/2дебила\");\n\t\tSystem.out.println(\"Path: \"+testFilePath);\n\t\tline();\n\n\t\t// retrieve basic information about path\n\t\tSystem.out.println(\"Printing file information: \");\n\t\tSystem.out.println(\"\\t getFileName(): \\t\" + testFilePath.getFileName());\n\t\tSystem.out.println(\"\\t getRoot(): \\t\\t\" + testFilePath.getRoot());\n\t\tSystem.out.println(\"\\t getParent(): \\t\\t\" + testFilePath.getParent());\n\t\tline();\n\n\t\t// print path elements\n\t\tSystem.out.println(\"Printing elements of the path: \");\n\t\tfor(Path element : testFilePath) {\n\t\t\tSystem.out.println(\"\\t path element: \" + element);\n\t\t}\n\t\tline();\n\n\t\t//get a path object with relative path\n\t\tPath path = Paths.get(\"./src\");\n\t\tSystem.out.println(\"Path: \"+path);\n\t\tSystem.out.println(\"1) getFileName(): \" + path.getFileName());\n\t\tSystem.out.println(\"2) toUri(): \" + path.toUri());\n\t\tSystem.out.println(\"3) toAbsolutePath(): \" + path.toAbsolutePath());\n\t\tSystem.out.println(\"4) normalize(): \" + path.normalize());\n\n\t\t// get another path object with normalized relative path\n\t\tPath testPathNormalized = Paths.get(path.normalize().toString());\n\t\tSystem.out.println(\"Path normalized: \"+testPathNormalized);\n\t\tSystem.out.println(\"5) normalized absolute path is: \" +\n\t\t\t\ttestPathNormalized.toAbsolutePath());\n\t\tSystem.out.println(\"6) normalized real path is: \" +\n\t\t\t\tpath.toRealPath (LinkOption.NOFOLLOW_LINKS));\n\n\t\tline();\n\n\t\tPath dir = Paths.get(\"/home/ilmir/Dropbox/Aliya_Ilmir\");\n\t\tPath resolvedPath = dir.resolve(\"2дебила\");\n\t\tSystem.out.println(\"Resolved path: \"+resolvedPath);\n\t}","public void print() {\n\t\t\n\t\tfor(Solution sol : population) {\n\t\t\tSystem.out.println(sol.getPossibleSolution() + \" \" + sol.getPath());\n\t\t}\n\t}","private void gotoPath() {\n\t\tfinal String hdfs = getFullPath(txtRootPath.getText().trim());\n\t\tif (StringUtils.isEmpty(hdfs)) {\n\t\t\treturn;\n\t\t}\n\t\ttry {\n\t\t\tFileStatus fs = getFileStatusWithProgress(hdfs);\n\t\t\tgotoPath(fs);\n\t\t} catch (Exception e) {\n\t\t\tMessageDialog.openError(getShell(), Messages.msgError, e.getMessage());\n\t\t}\n\t}","public static void searchFile(String path){\n try {\n Scanner scanner = new Scanner(System.in);\n System.out.println(\"Enter the File Name You need to Find:\");\n String name = scanner.next();\n File file = new File(path + \"/\" + name);\n if (file.isFile()) {\n file.getName();\n System.out.println(\"File Exists\");\n }\n else{\n System.out.println(\"File Not Found\");\n\n }\n\n }\n catch (Exception e)\n {\n e.printStackTrace();\n }\n }","public static void printFileInfo(String filePath) {\n File f1 = new File(filePath);\n System.out.println(\"File name: \" + f1.getName());\n System.out.println(\"Path: \" + f1.getPath());\n System.out.println(\"Parent: \" + f1.getParent());\n System.out.println(f1.exists() ? \"file exist\" : \"file is not exist\");\n System.out.println(f1.canRead() ? \"file readable\" : \"file is not readable\");\n System.out.println(f1.canWrite() ? \"file writable\" : \"file is not writable\");\n System.out.println(f1.isDirectory() ? \"It is directory\" : \"It is not directory\");\n System.out.println(f1.isFile() ? \"It is a simple file\" : \"It can be named channel\");\n System.out.println(f1.isAbsolute() ? \"It is absolute\" : \"It is not absolute\");\n System.out.println(\"Last modified: \" + f1.lastModified());\n System.out.println(\"Size is \" + f1.length() + \" byte\");\n }","static void print(FileSearch fileSearch) {\n System.out.print(fileSearch.getFile().getFileName() + COLON);\n System.out.print(fileSearch.getMatchCount() * 100 / fileSearch.getLine().split(DELIMITER).length);\n System.out.println(PERCENTAGE);\n }","protected String printablePath(IVertex<String> target){\n\n String lineout = \"\";\n\n LinkedList<IVertex<String>> path = this.getPath(target);\n\n IVertex<String> previous = null;\n\n IVertex<String> next = null;\n\n if(path!=null) {\n Iterator<IVertex<String>> it = path.iterator();\n\n while (it.hasNext()) {\n\n previous = next;\n\n next = it.next();\n\n IWeightedEdge<String> prevedge = null;\n\n if(previous!=null && next!=null){\n prevedge = this.weightedGraph.getEdge(previous,next);\n }\n\n if(prevedge!=null)\n lineout+= \" \" +prevedge.getWeight() + \" \";\n\n lineout += \" \" + next.getValue() + \" \";\n }\n }\n return lineout;\n }","public void printFilenames(){\n\t\tSystem.out.println(\"\\nAgent list of files: \" + this.filenames.size());\n\t\tfor(int i = 0;i<filenames.size();i++){\n\t\t\tSystem.out.println(i+1+ \") \" + filenames.get(i));\n\t\t}\n\t\tSystem.out.println(\"\");\n\t}","public static void printValidSearchMessage(boolean isFound) {\n if (isFound) {\n System.out.println(\"Search found!\");\n } else {\n System.out.println(\"Task not found in the task list!\");\n }\n }","public void pathFinder() {\n String oldPath = path;\n ProcessHandle.allProcesses()\n .forEach(process -> checkProcess(process.info()));\n writePath();\n //return (oldPath != path);\n }","public String find()\n\t{\n\t\tFile f = new File(ampath);\n\t\tString fdir = f.getParent();\n\t\tFile fs = new File (fdir);\n\t\tString cplpath = null;\n\t\tboolean found = false;\n\t\t\n\t\tFile [] files = fs.listFiles();\n\t\t\n\t\tfor (int i=0; i<files.length; i++) {\n\t\t\tif(files[i].getName().equalsIgnoreCase(cplfilename)){\n\t\t\t\tfound = true;\n\t\t\t\tcplpath = files[i].getPath();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t//Searching in Subfolder for CPL-File\n\t\t\tif (files[i].isDirectory()) {\n\t\t\t\tFile f2 = new File(files[i].getPath());\n\t\t\t\tFile [] files2 = f2.listFiles();\n\t\t\t\tfor(int j=0; j<files2.length; j++) {\n\t\t\t\t\tif(files2[j].getName().equalsIgnoreCase(cplfilename)){\n\t\t\t\t\t\tfound = true;\n\t\t\t\t\t\tcplpath = files2[i].getPath();\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//Returns CPL-File as String\n\t\tif (found == false) {\n\t\t\tSystem.out.println(\"CPL-File not found\");\n\t\t\treturn \"CPL-File not found\";\n\t\t}\n\t\telse {\n\t\t\treturn cplpath;\n\t\t}\n\t\t\n\t}","java.lang.String getFileLoc();","private static void debug(String s) {\n if (System.getProperty(\"javafind.debug\") != null)\n System.out.println(\"debug in GnuNativeFind: \" + s);\n }","public void path(int element) {\n if(!empty()) pathNodes(element, root);\n System.out.println();\n }","private void PrintPath(Stack<MazePoint> stack, boolean hasExit)\n {\n if(hasExit)\n {\n //reverse the sPath\n Stack<MazePoint> sExitPath = new Stack<MazePoint>();\n MazePoint exitPoint = stack.top();\n int size = stack.getSize();\n while(!stack.isEmpty())\n {\n MazePoint p = stack.top();\n sExitPath.push(p);\n stack.pop();\n \n int pRow = p.getRow();\n int pColumn = p.getColumn();\n cMaze[pRow][pColumn].markPath();\n }\n MazePoint startPoint = sExitPath.top();\n \n System.out.println(\"Path to follow from Start \" + startPoint.toString() + \" to Exit \" + exitPoint.toString() + \" - \" + size + \" steps:\");\n //print the sExitPath\n while(!sExitPath.isEmpty())\n {\n MazePoint p = sExitPath.top();\n sExitPath.pop();\n System.out.println(p.toString());\n }\n System.out.print(\"\\n\");\n }\n else\n {\n System.out.println(\"There is no exit out of the maze.\");\n }\n //PrintContents();\n for(int i=0; i< cMaze.length; i++)\n {\n for(int j=0; j<cMaze[i].length; j++)\n {\n char locationData = cMaze[i][j].getLocationData();\n //when it is not on the path and visited\n if(locationData != ('.') && cMaze[i][j].wasVisited())\n {\n System.out.print('V');\n }\n else\n {\n System.out.print(locationData);\n }\n }\n System.out.print(\"\\n\");\n }\n \n PrintItems();\n }","public void printLocationInfo()\n {\n System.out.println(currentRoom.getLongDescription());\n System.out.println();\n }","private static void printPath(List<Node> path, int k) {\n long pathSum = 0;\n for(int i=path.size()-1; i>=0; --i){\n pathSum += path.get(i).id;\n if(pathSum == k){\n print(path, i, path.size()-1);\n }\n }\n }","public void printFile() {\n\t\t\n\t\tfor(String[] line_i: linesArray) {\n\t\t\tSystem.out.println( Arrays.toString(line_i) );\n\t\t}\n\t}","public void printResults(){\n\t\tSystem.out.println(\"The area of the triangle is \" + findArea());\n\t\tSystem.out.println(\"The perimeter of the triangle is \"+ findPerimeter());}","public static void printInfo(){\n }","public static void printPath(int[] prev, int v) {\n\t\tif(prev[v] != -1) {\n\t\t\tprintPath(prev,prev[v]);\n\t\t\tSystem.out.print(\"-\");\n\t\t}\n\t\tSystem.out.print(v);\n\t}","@Override\n public String toString() {\n return \"ls [PATH ...]:\\n\" + \"\\tList the contents.\\n\" + \"\\tNote:\\n\"\n + \"\\t1.If no PATH given, print contents of current directory.\\n\"\n + \"\\t2.If PATH specifies a directory, print its contents(file or \"\n + \"directory).\\n\" + \"\\t3.If PATH specifies a file, print its name.\";\n }","public void printInfo(){\n\t}","public void printInfo(){\n\t}","private static void displaySoundDir(){\n System.out.println(SOUNDS_DIR);\n }","void debug() {\n\t\tfor( int i = 0; i < N; i++ ) {\t\n\t\t\tSystem.out.print(i+\" \");\n\t\t\tfor( int j = 0; j < N; j++ )\n\t\t\t\tSystem.out.print(j+\":\"+(defined[i][j]?\"T\":\"F\")+\" \"+\n\t\t\t\t\t\tc[i][j]+\" p=\"+path[i][j]+\" f=\"+f[i][j]+\"; \");\n\t\t\tSystem.out.println();\n\t\t}\n\t}","public static void main(String[] args) {\n List<String> paths = findPaths(10);\n paths.forEach(System.out::println);\n }","public void printFilesIn(String word){\n System.out.println(\"\\nThe word \" + word + \" is in the following files: \");\n for (String s : hashWords.keySet()){\n if (s.equals(word)){\n ArrayList wordAndFiles = hashWords.get(s);\n for (int i=0; i< wordAndFiles.size(); i++){\n System.out.println(wordAndFiles.get(i));\n }\n }\n }\n }","public void print() {\n\t\tSystem.out.println(\"ONOMA IDIOKTITH: \" + fname);\n\t\tSystem.out.println(\"EPWNYMO IDIOKTITH: \" + lname);\n\t\tSystem.out.println(\"DIEUTHINSH FARMAKEIOU: \" + address);\n\t\tSystem.out.println(\"THLEFWNO FARMAKEIOU: \" + telephone);\n\t\tSystem.out.println();\n\t}","@DISPID(35)\r\n\t// = 0x23. The runtime will prefer the VTID if present\r\n\t@VTID(40)\r\n\tjava.lang.String fullPath();","private static void printUsage() {\n\t\tSystem.out.println(\"[0] apk files directory\");\n\t\tSystem.out.println(\"[1] android-jar directory\");\n\t}","void printInfo();","public String getResultingString(IDirectory toLsDir) {\r\n // get sub-directories and files\r\n String result = \"\";\r\n // Check if the path is valid\r\n if (toPrint) {\r\n // Get the sub-directories and files\r\n ArrayList<DirectoryTreeNode> contents = toLsDir.getContents();\r\n\r\n // check if contents is empty or not\r\n if (!contents.isEmpty()) {\r\n // get the names of all the sub-directories\r\n for (DirectoryTreeNode content : contents) {\r\n result += content.getName() + \"\\n\";\r\n }\r\n }\r\n // If the path is not valid then return an appropriate message\r\n } else {\r\n if (toRedirect) {\r\n System.out.println(\"Error: Cannot access path.\\n\");\r\n } else\r\n result = \"Cannot access path \\n\";\r\n }\r\n // return the result\r\n return result;\r\n }","public void printIndex() {\n System.out.println(\"\\n\" + \"=== Staged Files ===\");\n List<String> addingStage = Utils.plainFilenamesIn(INDEX);\n for (String filesName: addingStage) {\n File fileInIndex = new File(INDEX, filesName);\n File fileInCWD = new File(Main.CWD, filesName);\n if (Utils.readContentsAsString(fileInCWD)\n .equals(Utils.readContentsAsString(fileInIndex))) {\n System.out.println(filesName);\n }\n }\n }","@DISPID(77)\r\n\t// = 0x4d. The runtime will prefer the VTID if present\r\n\t@VTID(75)\r\n\tjava.lang.String fullPath();","private static void findPath()\r\n {\r\n String temp_path = System.getProperty(\"user.dir\");\r\n char last = temp_path.charAt(temp_path.length() - 1);\r\n if(last == 'g')\r\n {\r\n path = \".\";\r\n }\r\n else\r\n {\r\n path = \"./bag\";\r\n }\r\n \r\n }","public void directoryPathPrompt() {\n System.out.println(\"Enter a file path to export the PDF of the schedule to.\");\n }","public void printLDR() {\n if(!empty()) {\n printLDRNodes(root);\n System.out.println();\n }\n }","private static void printUsage() throws Exception {\n\t\tSystem.out.println(new ResourceGetter(\"uk/ac/cam/ch/wwmm/oscar3/resources/\").getString(\"usage.txt\"));\n\t}","public static void main(String[] args) {\n TreeNode root = new TreeNode(1);\n root.left = new TreeNode(2);\n root.right = new TreeNode(3);\n root.left.left = new TreeNode(4);\n root.left.right = new TreeNode(8);\n root.right.left = new TreeNode(6);\n root.right.right = new TreeNode(7);\n Solution34 solution34 = new Solution34();\n System.out.println(solution34.FindPath(root,11));\n }","private void findMatches(String key, String path, boolean caseSensitive, boolean fileName) {\n\t\tfor (String word : document) {\n\t\t\tif (contains(key, word, caseSensitive)) {\n\t\t\t\tif (fileName) {\n\t\t\t\t\tSystem.out.println(path);\n\t\t\t\t\tbreak;\n\t\t\t\t} else {\n\t\t\t\t\tSystem.out.println(word);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","public static void searchFile() \n\t{\n\t\t//Variable Declaration\n\t\tString fileName;\n\t\tScanner obj = new Scanner(System.in);\n\n\t\t//Read file name from user\n\t\tSystem.out.println(\"Enter file name to searched:\");\n\t\tfileName= obj.nextLine();\n\t\t\n\t\t//Searching the file\n\t\tboolean isFound = FileManager.searchFile(folderpath, fileName);\n\t\t\n\t\tif(isFound)\n\t\t\tSystem.out.println(\"File is present\");\n\t\telse\n\t\t\tSystem.out.println(\"File not present.\");\n\n\t}","public void printString()\r\n\t\t{\r\n\t\t\tTreeNode previousTreeNode = null; //holds the previous node\r\n\t\t\tTreeNode currentTreeNode = null; //holds current node\r\n\r\n\t\t\tData currentData = head; //start at the head of our data which is a linked list\r\n\t\t\twhile (currentData != null) //while the currentData is not null\r\n\t\t\t{\r\n\t\t\t\tcurrentTreeNode = currentData.getLT(); //get the Less Than tree\r\n\t\t\t\tif (currentTreeNode != previousTreeNode)\r\n\t\t\t\t\tcurrentTreeNode.printString(); //print the Less Than tree\r\n\t\t\t\tpreviousTreeNode = currentTreeNode;\r\n\r\n\t\t\t\tcurrentData.getWord(); //get the current word\r\n\t\t\t\tSystem.out.printf(\"%-20s\", currentData.getWord()); //print the current word\r\n\t\t\t\tArrayList locations = currentData.getLocations(); //get the word's locations in the file\r\n\t\t\t\tfor (int i = 0; i < locations.size(); i++) //print all of those\r\n\t\t\t\t{\r\n\t\t\t\t\tSystem.out.printf(\" (%s,%s)\", ((Point) locations.get(i)).x, ((Point) locations.get(i)).y);\r\n\t\t\t\t\tif ((((i + 1) % 8) == 0) && ((i + 1) != locations.size())) //only print 8 items per line\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tSystem.out.printf(\"\\n%-20s\", \"\\\"\");\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tSystem.out.println(); //print a newline\r\n\r\n\t\t\t\tcurrentTreeNode = currentData.getGT(); //get the Greater Than tree\r\n\t\t\t\tif (currentTreeNode != previousTreeNode)\r\n\t\t\t\t\tcurrentTreeNode.printString(); //print the Greater Than tree\r\n\t\t\t\tpreviousTreeNode = currentTreeNode;\r\n\t\t\t\tcurrentData = currentData.nextData();\r\n\t\t\t}\r\n\t\t}","String displayableFileName(String path) {\n String result = \"\";\n StringTokenizer tok = new StringTokenizer(path, \"\\\\/\");\n while (tok.hasMoreTokens()) {\n result = tok.nextToken();\n }\n return result;\n }","private static void print(String p) {\n\t\tSystem.out.println(PREFIX + p);\n\t}","@Override\n\tvoid display() {\n\t\tif(nodeList == null || nodeList.size() == 0) {\n\t\t\tSystem.out.println(\"not found.\");\n\t\t\treturn;\n\t\t}\n for(Inode inode:nodeList) {\n\t\t\tSystem.out.println(inode.nodename);\n }\n\t}","public static void printShortestPath(List<Town> sp) {\n\t\tint size = sp.size();\n\t\tif ( size>1 ) {\n\t\t\tfor( int i = 1; i <= size; i++) {\n\t\t\t\tif( i != size ) {\n\t\t\t\t\tSystem.out.print( sp.get(size-i).getName()+\"-\" );\n\t\t\t\t}else {\n\t\t\t\t\tSystem.out.print( sp.get(size-i).getName());\n\t\t\t\t} \n\t\t\t}\t\t\t\n\t\t}else {\n\t\t\tSystem.out.println(\"There is no possible route\");\n\t\t}\n\t}"],"string":"[\n \"public void printPath(){\\n\\t\\tListIterator<Path> listIterator =temp.listIterator();\\n\\t\\twhile(listIterator.hasNext()){\\n\\t\\t\\tSystem.out.print(listIterator.next().getPos()+\\\" \\\");\\n\\t\\t}\\n\\t}\",\n \"public void printPath() {\\n System.out.print(\\\"Path: \\\");\\n for (int i = 0; i < parents.size(); i++) {\\n Cell cell = parents.get(i);\\n System.out.print(\\\" (\\\" + cell.x + \\\",\\\" + cell.y + \\\") \\\");\\n }\\n System.out.println(\\\"\\\\nVisited cells: \\\" + visitedCells);\\n System.out.println(\\\"Length of Path: \\\" + parents.size());\\n }\",\n \"public String print(){\\n\\t\\treturn this.sonsPaths_.toString();\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tSystem.out.println(findPath(0,5));\\r\\n\\t}\",\n \"public void printPath()\\r\\n\\t{\\r\\n\\t\\tSystem.out.print(\\\"+ +\\\");\\r\\n\\t\\tfor (int i = 1; i < this.getWidth(); i++)\\r\\n\\t\\t{\\r\\n\\t\\t\\tSystem.out.print(\\\"-+\\\");\\r\\n\\t\\t}\\r\\n\\t\\tSystem.out.println();\\r\\n\\r\\n\\t\\tfor (int i = 0; i < this.getHeight(); i++)\\r\\n\\t\\t{\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tfor (int j = 0; j < this.getWidth(); j++)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tCell c = this.getCellAt(i, j);\\r\\n\\t\\t\\t\\t// if cells are connected, no wall is printed in between them\\r\\n\\t\\t\\t\\tif (c.hasDoorwayTo(Cell.WEST))\\r\\n\\t\\t\\t\\t\\tSystem.out.print(\\\" \\\");\\r\\n\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\tSystem.out.print(\\\"|\\\");\\t\\t\\t\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(path.contains(c))\\r\\n\\t\\t\\t\\t\\tSystem.out.print(\\\"#\\\");\\r\\n\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\tSystem.out.print(\\\" \\\");\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(\\\"|\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tfor (int j = 0; j < this.getWidth(); j++)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tCell c = this.getCellAt(i, j);\\r\\n\\t\\t\\t\\tSystem.out.print(\\\"+\\\");\\r\\n\\r\\n\\t\\t\\t\\tif (c.hasDoorwayTo(Cell.SOUTH) || c == this.getCellAt(getHeight()-1, getWidth()-1))\\r\\n\\t\\t\\t\\t\\tSystem.out.print(\\\" \\\");\\r\\n\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\tSystem.out.print(\\\"-\\\");\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tSystem.out.println(\\\"+\\\");\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public void printDetails() \\r\\n\\t{\\r\\n\\t\\t// Print cells in path\\r\\n\\t\\tSystem.out.print(\\\"Path:\\\");\\r\\n\\t\\tfor(Cell c: path)\\r\\n\\t\\t\\tSystem.out.print(\\\" (\\\" + c.getRow() + ',' + c.getColumn() + ')');\\r\\n\\t\\t\\r\\n\\t\\t// Print path length\\r\\n\\t\\tSystem.out.println(\\\"\\\\nLength of path: \\\" + path.size());\\r\\n\\t\\t\\r\\n\\t\\t// Print visited cell amount\\r\\n\\t\\tint lastCell = path.size() - 1;\\r\\n\\t\\tint visitedCells = path.get(lastCell).getDiscoveryTime() + 1;\\r\\n\\t\\tSystem.out.println(\\\"Visited cells: \\\" + visitedCells + '\\\\n');\\r\\n\\t}\",\n \"void printFile(String path) {\\n try {\\n String[] readFileOutPut = readFile(path);\\n for (int i = 0; i < readFileOutPut.length;i++) System.out.println(readFileOutPut[i]);\\n } catch (Exception e) {\\n e.printStackTrace();\\n }\\n }\",\n \"public void print(){\\n for(int i = 0; i < rootDir.length; i++){\\n System.out.println(rootDir[i]);\\n }\\n }\",\n \"public void printPath(int index){\\n\\t\\tList<V> path=getPath(index);\\n\\n\\t\\tSystem.out.println(\\\"A path from \\\"+vertices.get(root)+\\\" to \\\"+vertices.get(index)+\\\": \\\");\\n\\t\\tfor(int i=path.size()-1;i>=0;i--)\\n\\t\\t\\tSystem.out.print(path.get(i)+\\\" \\\");\\n\\n\\t\\t}\",\n \"void pathFound(Node node);\",\n \"private void printPath(LinkedList<String> visited) {\\r\\n\\r\\n if (flag == false) {\\r\\n System.out.println(\\\"Yes there exists a path between \\\" + START + \\\" and \\\" + END);\\r\\n }\\r\\n for (String node : visited) { //creating for loop to print the nodes stored in visited array \\r\\n System.out.print(node);\\r\\n System.out.print(\\\" \\\");\\r\\n }\\r\\n System.out.println();\\r\\n }\",\n \"private void printPath() {\\n // generate and print the shortest path.\\n if (this == this.previous) {\\n graphPathRef.add(this);\\n } else if (this.previous == null) {\\n System.out.print(\\\"\\\");\\n } else {\\n graphPathRef.add(this);\\n this.previous.printPath();\\n }\\n }\",\n \"public void printAllPaths() {\\n\\n if (root == null) System.out.println(\\\"No paths for you!\\\");\\n else {\\n printPaths(root.left, root.element.toString());\\n printPaths(root.right, root.element.toString());\\n }\\n }\",\n \"public void print() {\\n\\n if (root == null) // If the root does not exist, then we cannot print anything\\n {\\n System.out.println(\\\"The head does not exist \\\");\\n return;\\n }\\n\\n directory Fileptr = root;\\n while (Fileptr != null) {\\n System.out.print(Fileptr.a);\\n System.out.print(\\\" ( Available Space \\\" + Fileptr.availableSpace + \\\" ) \\\" + \\\" ----> \\\");\\n Fileptr = Fileptr.forward;\\n }\\n System.out.print(\\\" NULL \\\\n\\\");\\n }\",\n \"void printPath(Coordinate endName) {\\n if (!graph.containsKey(endName)) {\\n // test use, display point\\n // System.err.printf(\\\"Graph doesn't contain end vertex \\\\\\\"%s\\\\\\\"\\\\n\\\", endName);\\n return;\\n }\\n graph.get(endName).printPath();\\n }\",\n \"public void printPath(Vertice c) {\\r\\n Vertice actual = c;\\r\\n if (actual.previous != null) {\\r\\n printPath(actual.previous);\\r\\n System.out.print(\\\" --> \\\");\\r\\n System.out.print(actual.name);\\r\\n }\\r\\n if (actual.previous == null) {\\r\\n System.out.print(actual.name);\\r\\n }\\r\\n }\",\n \"private void printPath( Vertex dest )\\n {\\n if( dest.prev != null )\\n {\\n printPath( dest.prev );\\n // System.out.print( \\\" to \\\" );\\n }\\n System.out.print( dest.name +\\\" \\\" );\\n }\",\n \"public static void main(String[] args) {\\n\\n\\t\\tSystem.out.println(path(4,4));\\n\\t}\",\n \"static void printPaths(Node node)\\n\\t{\\n\\t\\tint path[] = new int[1000];\\n\\t\\tprintPathsRecursive(node, path, 0);\\n\\t}\",\n \"public void print() \\n\\t{\\n\\t\\tSystem.out.println(\\\"existing files:\\\\n\\\");\\n\\t\\tIterator<Entry<String, byte[]>> existing = this.existingFile.entrySet().iterator();\\n\\t\\twhile (existing.hasNext()) \\n\\t\\t{\\n\\t\\t\\tEntry<String, byte[]> entry = existing.next();\\n\\t\\t\\tString key = entry.getKey();\\n\\t\\t\\tbyte[] macValue = entry.getValue();\\n\\t\\t\\tSystem.out.println(key + \\\" - \\\" + bytes2HexString(macValue));\\n\\t\\t}\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"\\\\n\\\\nprefix files:\\\\n\\\");\\n\\t\\tIterator<Entry<String, byte[]>> prefix = this.prefix.entrySet().iterator();\\n\\t\\twhile (prefix.hasNext()) \\n\\t\\t{\\n\\t\\t\\tEntry<String, byte[]> entry = prefix.next();\\n\\t\\t\\tString key = entry.getKey();\\n\\t\\t\\tbyte[] macValue = entry.getValue();\\n\\t\\t\\tSystem.out.println(key + \\\" - \\\" + bytes2HexString(macValue));\\n\\t\\t}\\n\\t}\",\n \"public void printPath(Vertex v) {\\n if ( v.dist == 0 )\\n return;\\n printPath(v.path);\\n System.out.print(\\\"-> \\\" + v.graphLoc+\\\" \\\");\\n }\",\n \"public void printFileNames() {\\n DirectoryResource dr = new DirectoryResource();\\n for (File f : dr.selectedFiles()) {\\n System.out.println(f);\\n }\\n }\",\n \"@Override\\n\\tpublic String toString() {\\n\\t\\treturn getFullPath();\\n\\t}\",\n \"public void detailTestPath() {\\n // Get test run file\\n File report_path = new File(System.getProperty(PATH) + TESTNG);\\n // Check if the path exists\\n if (!report_path.exists()) {\\n System.out.println(SEE_THE_DETAIL_TEST__REPORT_ + System.getProperty(PATH) + LOGXML);\\n // Get error log file\\n File path = new File(System.getProperty(PATH) + ERROR_LOGLOGTXT);\\n // If file exists then display error log file path\\n if (path.exists()) {\\n System.out.println(SEE_THE_DETAIL_ERROR__REPORT_ + System.getProperty(PATH) + ERROR_LOGLOGTXT);\\n }\\n }\\n }\",\n \"public void printAction() {\\n this.folderList.get(currentFolder).printIt();\\n }\",\n \"public static void printPath(Tile[] path) {\\n\\t\\tSystem.out.print(\\\"Path tiles: {\\\");\\n\\t\\tfor (Tile tile : path) {\\n\\t\\t\\tSystem.out.print(tile + \\\",\\\");\\n\\t\\t}\\n\\t\\tSystem.out.println(\\\"}\\\");\\n\\t}\",\n \"@Override\\n\\tpublic String toString() {\\n\\t\\treturn path.toString();\\n\\t}\",\n \"public void printPath( String destName )\\n {\\n \\t DecimalFormat df = new DecimalFormat(\\\"###.##\\\");\\n Vertex w = vertexMap.get( destName );\\n if( w == null )\\n throw new NoSuchElementException( \\\"Destination vertex not found\\\" );\\n else if( w.dist == INFINITY )\\n System.out.println( destName + \\\" is unreachable\\\" );\\n else\\n {\\n //System.out.print( \\\"(Distance is: \\\" + w.dist + \\\") \\\" );\\n printPath( w );\\n System.out.println(df.format(w.dist) );\\n }\\n }\",\n \"private void printPath(int currentVertex, int[] parents) {\\n // Base case : Source node has been processed \\n if (currentVertex == NO_PARENT) {\\n return;\\n }\\n printPath(parents[currentVertex], parents);\\n System.out.print(currentVertex + \\\" \\\");\\n }\",\n \"private void printSketchFolder() {\\n File sketchFolder = sketch.getFolder();\\n System.out.println(\\\"++++++++++sketch folder: [\\\" + sketchFolder.getAbsolutePath() + \\\"]\\\");\\n }\",\n \"public static void main(String[] args) {\\n\\t\\t\\n\\t\\tprintpath(3,0);\\n\\t\\t//System.out.println(list);\\n\\t}\",\n \"@Override\\n\\tpublic String toString() {\\n\\t\\treturn this.f.getPath();\\n\\t}\",\n \"public static void print_path(Stack<Node> st){\\n for(int i=0;i<st.size();i++){\\n System.out.print(st.elementAt(i).data+\\\" \\\");\\n }\\n }\",\n \"public String showFind() {\\n String findMessage = \\\"Ain't no problem! I have found the matchin' tasks in your list:\\\";\\n return findMessage;\\n }\",\n \"public void print ()\\n\\t{\\n\\t\\tSystem.out.println(\\\"Polyhedron File Name: \\\" + FileName);\\n\\t\\tSystem.out.println(\\\"Object active: \\\" + Boolean.toString(isActive()));\\n\\t\\tprintCoordinates();\\n\\t}\",\n \"protected static void printPath(int[] thePath) {\\r\\n\\t\\t\\r\\n\\t\\tint[] orderedPath = new int[thePath.length];\\r\\n\\t\\r\\n\\t\\tfor (int i = 0; i < thePath.length; i++)\\r\\n\\t\\t\\torderedPath[i] = -1;\\r\\n\\t\\r\\n\\t\\torderedPath[0] = myEndPole;\\r\\n\\t\\tint i = myEndPole;\\r\\n\\t\\tint j = 1;\\r\\n\\t \\r\\n\\t\\twhile (true && j < orderedPath.length) {\\t\\r\\n\\t\\t\\tif (thePath[i] == -1 && i == START_POLE)\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\torderedPath[j] = thePath[i];\\t\\r\\n\\t\\t\\ti = thePath[i];\\r\\n\\t\\t\\tj++;\\r\\n\\t\\t}\\r\\n\\t\\r\\n\\t\\tSystem.out.print(\\\"The Shortest Path is \\\");\\r\\n\\t\\r\\n\\t\\tfor (i = orderedPath.length - 1; i >= 0; i--) {\\r\\n\\t\\t\\tif (orderedPath[i] == -1)\\r\\n\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\tif (i == 0) {\\r\\n\\t\\t\\t\\tSystem.out.print((orderedPath[i] + 1));\\r\\n\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tSystem.out.print((orderedPath[i] + 1) + \\\" -> \\\");\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tSystem.out.println();\\r\\n\\t\\tSystem.out.println();\\r\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tPath iP = Paths.get(\\\"/\\\", \\\"First.txt\\\");\\t// C\\n\\t\\t//Path iP = Paths.toPath(\\\"/First.txt\\\");\\t// D\\n\\t\\tSystem.out.println(iP) ;\\n\\t}\",\n \"private void showFinalPath() // run after end dest has been set\\n {\\n for(int i = 0; i < cities.size(); i++)\\n System.out.println(cities.get(i));\\n }\",\n \"public void printDirectory() {\\n System.out.println(\\\"Inventory:\\\");\\n for (Ingredient i : stock.keySet()) {\\n System.out.printf(\\\"%s, %d\\\\n\\\", i.getName(), stock.get(i));\\n }\\n System.out.println(\\\"Menu:\\\");\\n int drink_number = 1;\\n for (Drink d : drinks.keySet()) {\\n\\n System.out.printf(\\\"%d, %s, $%.2f, %b\\\\n\\\", drink_number++, d.getName(), d.getPrice(), inStock(d));\\n }\\n }\",\n \"public void print_root(){\\r\\n\\t\\tfor(int id = 0; id < label.length; id++){\\r\\n\\t\\t\\tSystem.out.printf(\\\"\\\"%d \\\"\\\", find(id));\\r\\n\\t\\t}\\r\\n\\t\\tSystem.out.printf(\\\"\\\"\\\\n\\\"\\\");\\r\\n\\t}\",\n \"@Override\\n public String toString() {\\n final StringBuilder buffer = new StringBuilder();\\n try {\\n formatPath(buffer, path, 0, indices);\\n } catch (IOException e) {\\n throw new AssertionError(e); // Should never happen, since we are writting to a StringBuilder.\\n }\\n return buffer.toString();\\n }\",\n \"public static void printLoadingFile() {\\n System.out.println(Message.LOADING_FILE);\\n }\",\n \"public void displayPaths() {\\r\\n\\t\\tlog.debug(\\\"startPaths\\\");\\r\\n\\t\\tfor ( Map.Entry<Integer, Vector<Edge>> entry: startPaths.entrySet()) {\\r\\n\\t\\t\\tfor ( Edge edge: entry.getValue()) {\\r\\n\\t\\t\\t\\tlog.debug( entry.getKey() + \\\": \\\" + edge.StartRoom + \\\"->\\\" + edge.door + \\\"->\\\" + edge.DestinationRoom );\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tlog.debug(\\\"destinationPaths\\\");\\r\\n\\t\\tfor ( Map.Entry<Integer, Vector<Edge>> entry: destinationPaths.entrySet()) {\\r\\n\\t\\t\\tfor ( Edge edge: entry.getValue()) {\\r\\n\\t\\t\\t\\tlog.debug( entry.getKey() + \\\": \\\" + edge.StartRoom + \\\"->\\\" + edge.door + \\\"->\\\" + edge.DestinationRoom );\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public static void printAvailableMaps() {\\n \\tFile folder = new File(\\\"./examples/\\\");\\n \\tFile[] listOfFiles = folder.listFiles();\\n \\tSystem.out.println(\\\"Available maps (choose one and start game with command 'game map_name' ) : \\\");\\n\\n \\t for (int i = 0; i < listOfFiles.length; i++) {\\n \\t if (listOfFiles[i].isFile()) {\\n \\t System.out.println(\\\"\\\\t\\\"+listOfFiles[i].getName());\\n \\t } \\n \\t }\\n }\",\n \"public static void print(double[][] path)\\n\\t{\\n\\t\\tSystem.out.println(\\\"X: \\\\t Y:\\\");\\n\\n\\t\\tfor(double[] u: path)\\n\\t\\t\\tSystem.out.println(u[0]+ \\\"\\\\t\\\" +u[1]);\\n\\t}\",\n \"@Override\\n\\tpublic void find() {\\n\\t\\tSystem.out.println(\\\"find method\\\");\\n\\t}\",\n \"void print_path(int[]parent,int[]dist,int s)\\n {\\n System.out.println(); \\n \\n //path from s to all other vertices\\n \\n for(int i=0;i<parent.length;i++)\\n {\\n System.out.println(\\\"From \\\"+s+\\\" to \\\"+i);\\n System.out.print(\\\"path: \\\");\\n print_node(parent,i);\\n System.out.print(\\\"END\\\");\\n if(dist[i]==INF)\\n System.out.println(\\\" cost=INF\\\"); \\n else\\n System.out.println(\\\" cost=\\\"+dist[i]);\\n\\n }\\n \\n \\n System.out.println();\\n \\n\\n \\n }\",\n \"static void Print(WellPathData wellPathData) {\\n\\t\\tfor (WellPathPosition pos : wellPathData.getWellPathList()) {\\n\\t\\t\\tSystem.out.println(\\\"Measured Depth: \\\" + pos.getMeasuredDepth());\\n\\t\\t\\tSystem.out.println(\\\" Inline Pos: \\\" + pos.getInlinePos());\\n\\t\\t\\tSystem.out.println(\\\" Xline Pos: \\\" + pos.getXlinePos());\\n\\t\\t\\tSystem.out.println(\\\" True Vert. Depth: \\\" + pos.getTrueVerticalDepth());\\t\\t\\t\\n\\t\\t}\\n\\t}\",\n \"@Override\\n\\tpublic void printToFile() {\\n\\t\\t\\n\\t}\",\n \"public String getPath() {\\n if (foundNemo) {\\n return path;\\n } else {\\n path = \\\"Uh Oh!! Could not find Nemo!!\\\";\\n return path;\\n }\\n }\",\n \"@Override\\n public void printAllSubFilesAndFolders(String folderPath) {\\n Path file = new File(folderPath).toPath();\\n // boolean exists = Files.exists(file); // Check if the file exists\\n boolean isDirectory = Files.isDirectory(file); // Check if it's a directory\\n boolean isFile = Files.isRegularFile(file); // Check if it's a regular file\\n if (isDirectory) {\\n System.out.println(\\\"cd \\\"+file+\\\" %d\\\");\\n System.out.println( System.getProperty(file.toString()));\\n } else if (isFile) {\\n System.out.println(\\\"dir\\\");\\n }\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tPath path = Paths.get(\\\"F:\\\\\\\\AccentureMayBatch\\\\\\\\JSTLProject\\\");\\r\\n\\r\\n\\t\\r\\n\\r\\n\\t\\tSystem.out.format(\\\"toString: %s%n\\\", path.toString());\\r\\n\\t\\tSystem.out.format(\\\"getFileName: %s%n\\\", path.getFileName());\\r\\n\\t\\tSystem.out.format(\\\"getName(0): %s%n\\\", path.getName(0));\\r\\n\\t\\tSystem.out.format(\\\"getNameCount: %d%n\\\", path.getNameCount());\\r\\n\\t\\tSystem.out.format(\\\"subpath(0,2): %s%n\\\", path.subpath(0,2));\\r\\n\\t\\tSystem.out.format(\\\"getParent: %s%n\\\", path.getParent());\\r\\n\\t\\tSystem.out.format(\\\"getRoot: %s%n\\\", path.getRoot());\\r\\n\\t\\t\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tFiles.list(new File(\\\".\\\").toPath())\\r\\n\\t\\t\\t .forEach(System.out::println);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tFiles.walk(new File(\\\".\\\").toPath())\\r\\n\\t\\t .filter(p -> !p.getFileName()\\r\\n\\t\\t .toString().startsWith(\\\".\\\"))\\r\\n\\t\\t .forEach(System.out::println);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tFiles.lines(new File(\\\"./src/com/polaris/utility/PathDemo.java\\\").toPath())\\r\\n\\t\\t .map(s -> s.trim())\\r\\n\\t\\t .filter(s -> !s.isEmpty())\\r\\n\\t\\t .forEach(System.out::println);\\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//finding path and sub path into string\\r\\n\\t\\t Path start = Paths.get(\\\".\\\");\\r\\n\\t\\t int maxDepth = 5;\\r\\n\\t\\t try (Stream<Path> stream = Files.find(start, maxDepth, (path2, attr) -> String.valueOf(path2).endsWith(\\\".java\\\"))) \\r\\n\\t\\t {\\r\\n\\t\\t String joined = stream\\r\\n\\t\\t .sorted()\\r\\n\\t\\t .map(String::valueOf)\\r\\n\\t\\t .collect(Collectors.joining(\\\"; \\\"));\\r\\n\\t\\t System.out.println(\\\"Found: \\\" + joined);\\r\\n\\t\\t } catch (IOException e1) {\\r\\n\\t\\t\\t\\t// TODO Auto-generated catch block\\r\\n\\t\\t\\t\\te1.printStackTrace();\\r\\n\\t\\t\\t}\\r\\n\\t\\t \\r\\n\\t\\t\\r\\n\\t\\tPath source = Paths.get(\\\"./src/com/polaris/utility/PathDemo.java\\\");\\r\\n\\t\\tPath target = Paths.get(\\\"F:/yatrabakup\\\");\\r\\n\\t\\t\\r\\n/*\\r\\n\\t\\ttry {\\r\\n\\t\\t // Files.copy(source, target);\\r\\n\\t\\t} catch(FileAlreadyExistsException fae) {\\r\\n\\t\\t fae.printStackTrace();\\r\\n\\t\\t} catch (IOException e) {\\r\\n\\t\\t // something else went wrong\\r\\n\\t\\t e.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t\\t*/\\r\\n\\t\\ttry (BufferedReader reader = Files.newBufferedReader(Paths.get(\\\"f:\\\\\\\\yatrabakup\\\\\\\\EmployeeData.csv\\\"))) {\\r\\n\\t\\t reader.lines().map(String::toLowerCase).forEach(System.out::println);\\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 \"void printToConsole() {\\n\\t\\tSystem.out.println(\\\"PROVIDER DIRECTORY:\\\");\\n\\t\\tfor (int i = 0; i < services.size(); i++) {\\n\\t\\t\\tString service = services.get(i).getServiceName() + \\\" (\\\" + services.get(i).getServiceNumber() + \\\") for $\\\" + services.get(i).getServiceFee();\\n\\t\\t\\tSystem.out.println(\\\"\\\\t\\\" + service);\\n\\t\\t}\\n\\t}\",\n \"public static void main(String[] args) throws IOException {\\n\\t\\tPath testFilePath = Paths.get(\\\"/home/ilmir/Dropbox/Aliya_Ilmir/2дебила\\\");\\n\\t\\tSystem.out.println(\\\"Path: \\\"+testFilePath);\\n\\t\\tline();\\n\\n\\t\\t// retrieve basic information about path\\n\\t\\tSystem.out.println(\\\"Printing file information: \\\");\\n\\t\\tSystem.out.println(\\\"\\\\t getFileName(): \\\\t\\\" + testFilePath.getFileName());\\n\\t\\tSystem.out.println(\\\"\\\\t getRoot(): \\\\t\\\\t\\\" + testFilePath.getRoot());\\n\\t\\tSystem.out.println(\\\"\\\\t getParent(): \\\\t\\\\t\\\" + testFilePath.getParent());\\n\\t\\tline();\\n\\n\\t\\t// print path elements\\n\\t\\tSystem.out.println(\\\"Printing elements of the path: \\\");\\n\\t\\tfor(Path element : testFilePath) {\\n\\t\\t\\tSystem.out.println(\\\"\\\\t path element: \\\" + element);\\n\\t\\t}\\n\\t\\tline();\\n\\n\\t\\t//get a path object with relative path\\n\\t\\tPath path = Paths.get(\\\"./src\\\");\\n\\t\\tSystem.out.println(\\\"Path: \\\"+path);\\n\\t\\tSystem.out.println(\\\"1) getFileName(): \\\" + path.getFileName());\\n\\t\\tSystem.out.println(\\\"2) toUri(): \\\" + path.toUri());\\n\\t\\tSystem.out.println(\\\"3) toAbsolutePath(): \\\" + path.toAbsolutePath());\\n\\t\\tSystem.out.println(\\\"4) normalize(): \\\" + path.normalize());\\n\\n\\t\\t// get another path object with normalized relative path\\n\\t\\tPath testPathNormalized = Paths.get(path.normalize().toString());\\n\\t\\tSystem.out.println(\\\"Path normalized: \\\"+testPathNormalized);\\n\\t\\tSystem.out.println(\\\"5) normalized absolute path is: \\\" +\\n\\t\\t\\t\\ttestPathNormalized.toAbsolutePath());\\n\\t\\tSystem.out.println(\\\"6) normalized real path is: \\\" +\\n\\t\\t\\t\\tpath.toRealPath (LinkOption.NOFOLLOW_LINKS));\\n\\n\\t\\tline();\\n\\n\\t\\tPath dir = Paths.get(\\\"/home/ilmir/Dropbox/Aliya_Ilmir\\\");\\n\\t\\tPath resolvedPath = dir.resolve(\\\"2дебила\\\");\\n\\t\\tSystem.out.println(\\\"Resolved path: \\\"+resolvedPath);\\n\\t}\",\n \"public void print() {\\n\\t\\t\\n\\t\\tfor(Solution sol : population) {\\n\\t\\t\\tSystem.out.println(sol.getPossibleSolution() + \\\" \\\" + sol.getPath());\\n\\t\\t}\\n\\t}\",\n \"private void gotoPath() {\\n\\t\\tfinal String hdfs = getFullPath(txtRootPath.getText().trim());\\n\\t\\tif (StringUtils.isEmpty(hdfs)) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\ttry {\\n\\t\\t\\tFileStatus fs = getFileStatusWithProgress(hdfs);\\n\\t\\t\\tgotoPath(fs);\\n\\t\\t} catch (Exception e) {\\n\\t\\t\\tMessageDialog.openError(getShell(), Messages.msgError, e.getMessage());\\n\\t\\t}\\n\\t}\",\n \"public static void searchFile(String path){\\n try {\\n Scanner scanner = new Scanner(System.in);\\n System.out.println(\\\"Enter the File Name You need to Find:\\\");\\n String name = scanner.next();\\n File file = new File(path + \\\"/\\\" + name);\\n if (file.isFile()) {\\n file.getName();\\n System.out.println(\\\"File Exists\\\");\\n }\\n else{\\n System.out.println(\\\"File Not Found\\\");\\n\\n }\\n\\n }\\n catch (Exception e)\\n {\\n e.printStackTrace();\\n }\\n }\",\n \"public static void printFileInfo(String filePath) {\\n File f1 = new File(filePath);\\n System.out.println(\\\"File name: \\\" + f1.getName());\\n System.out.println(\\\"Path: \\\" + f1.getPath());\\n System.out.println(\\\"Parent: \\\" + f1.getParent());\\n System.out.println(f1.exists() ? \\\"file exist\\\" : \\\"file is not exist\\\");\\n System.out.println(f1.canRead() ? \\\"file readable\\\" : \\\"file is not readable\\\");\\n System.out.println(f1.canWrite() ? \\\"file writable\\\" : \\\"file is not writable\\\");\\n System.out.println(f1.isDirectory() ? \\\"It is directory\\\" : \\\"It is not directory\\\");\\n System.out.println(f1.isFile() ? \\\"It is a simple file\\\" : \\\"It can be named channel\\\");\\n System.out.println(f1.isAbsolute() ? \\\"It is absolute\\\" : \\\"It is not absolute\\\");\\n System.out.println(\\\"Last modified: \\\" + f1.lastModified());\\n System.out.println(\\\"Size is \\\" + f1.length() + \\\" byte\\\");\\n }\",\n \"static void print(FileSearch fileSearch) {\\n System.out.print(fileSearch.getFile().getFileName() + COLON);\\n System.out.print(fileSearch.getMatchCount() * 100 / fileSearch.getLine().split(DELIMITER).length);\\n System.out.println(PERCENTAGE);\\n }\",\n \"protected String printablePath(IVertex<String> target){\\n\\n String lineout = \\\"\\\";\\n\\n LinkedList<IVertex<String>> path = this.getPath(target);\\n\\n IVertex<String> previous = null;\\n\\n IVertex<String> next = null;\\n\\n if(path!=null) {\\n Iterator<IVertex<String>> it = path.iterator();\\n\\n while (it.hasNext()) {\\n\\n previous = next;\\n\\n next = it.next();\\n\\n IWeightedEdge<String> prevedge = null;\\n\\n if(previous!=null && next!=null){\\n prevedge = this.weightedGraph.getEdge(previous,next);\\n }\\n\\n if(prevedge!=null)\\n lineout+= \\\" \\\" +prevedge.getWeight() + \\\" \\\";\\n\\n lineout += \\\" \\\" + next.getValue() + \\\" \\\";\\n }\\n }\\n return lineout;\\n }\",\n \"public void printFilenames(){\\n\\t\\tSystem.out.println(\\\"\\\\nAgent list of files: \\\" + this.filenames.size());\\n\\t\\tfor(int i = 0;i<filenames.size();i++){\\n\\t\\t\\tSystem.out.println(i+1+ \\\") \\\" + filenames.get(i));\\n\\t\\t}\\n\\t\\tSystem.out.println(\\\"\\\");\\n\\t}\",\n \"public static void printValidSearchMessage(boolean isFound) {\\n if (isFound) {\\n System.out.println(\\\"Search found!\\\");\\n } else {\\n System.out.println(\\\"Task not found in the task list!\\\");\\n }\\n }\",\n \"public void pathFinder() {\\n String oldPath = path;\\n ProcessHandle.allProcesses()\\n .forEach(process -> checkProcess(process.info()));\\n writePath();\\n //return (oldPath != path);\\n }\",\n \"public String find()\\n\\t{\\n\\t\\tFile f = new File(ampath);\\n\\t\\tString fdir = f.getParent();\\n\\t\\tFile fs = new File (fdir);\\n\\t\\tString cplpath = null;\\n\\t\\tboolean found = false;\\n\\t\\t\\n\\t\\tFile [] files = fs.listFiles();\\n\\t\\t\\n\\t\\tfor (int i=0; i<files.length; i++) {\\n\\t\\t\\tif(files[i].getName().equalsIgnoreCase(cplfilename)){\\n\\t\\t\\t\\tfound = true;\\n\\t\\t\\t\\tcplpath = files[i].getPath();\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t//Searching in Subfolder for CPL-File\\n\\t\\t\\tif (files[i].isDirectory()) {\\n\\t\\t\\t\\tFile f2 = new File(files[i].getPath());\\n\\t\\t\\t\\tFile [] files2 = f2.listFiles();\\n\\t\\t\\t\\tfor(int j=0; j<files2.length; j++) {\\n\\t\\t\\t\\t\\tif(files2[j].getName().equalsIgnoreCase(cplfilename)){\\n\\t\\t\\t\\t\\t\\tfound = true;\\n\\t\\t\\t\\t\\t\\tcplpath = files2[i].getPath();\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//Returns CPL-File as String\\n\\t\\tif (found == false) {\\n\\t\\t\\tSystem.out.println(\\\"CPL-File not found\\\");\\n\\t\\t\\treturn \\\"CPL-File not found\\\";\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn cplpath;\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"java.lang.String getFileLoc();\",\n \"private static void debug(String s) {\\n if (System.getProperty(\\\"javafind.debug\\\") != null)\\n System.out.println(\\\"debug in GnuNativeFind: \\\" + s);\\n }\",\n \"public void path(int element) {\\n if(!empty()) pathNodes(element, root);\\n System.out.println();\\n }\",\n \"private void PrintPath(Stack<MazePoint> stack, boolean hasExit)\\n {\\n if(hasExit)\\n {\\n //reverse the sPath\\n Stack<MazePoint> sExitPath = new Stack<MazePoint>();\\n MazePoint exitPoint = stack.top();\\n int size = stack.getSize();\\n while(!stack.isEmpty())\\n {\\n MazePoint p = stack.top();\\n sExitPath.push(p);\\n stack.pop();\\n \\n int pRow = p.getRow();\\n int pColumn = p.getColumn();\\n cMaze[pRow][pColumn].markPath();\\n }\\n MazePoint startPoint = sExitPath.top();\\n \\n System.out.println(\\\"Path to follow from Start \\\" + startPoint.toString() + \\\" to Exit \\\" + exitPoint.toString() + \\\" - \\\" + size + \\\" steps:\\\");\\n //print the sExitPath\\n while(!sExitPath.isEmpty())\\n {\\n MazePoint p = sExitPath.top();\\n sExitPath.pop();\\n System.out.println(p.toString());\\n }\\n System.out.print(\\\"\\\\n\\\");\\n }\\n else\\n {\\n System.out.println(\\\"There is no exit out of the maze.\\\");\\n }\\n //PrintContents();\\n for(int i=0; i< cMaze.length; i++)\\n {\\n for(int j=0; j<cMaze[i].length; j++)\\n {\\n char locationData = cMaze[i][j].getLocationData();\\n //when it is not on the path and visited\\n if(locationData != ('.') && cMaze[i][j].wasVisited())\\n {\\n System.out.print('V');\\n }\\n else\\n {\\n System.out.print(locationData);\\n }\\n }\\n System.out.print(\\\"\\\\n\\\");\\n }\\n \\n PrintItems();\\n }\",\n \"public void printLocationInfo()\\n {\\n System.out.println(currentRoom.getLongDescription());\\n System.out.println();\\n }\",\n \"private static void printPath(List<Node> path, int k) {\\n long pathSum = 0;\\n for(int i=path.size()-1; i>=0; --i){\\n pathSum += path.get(i).id;\\n if(pathSum == k){\\n print(path, i, path.size()-1);\\n }\\n }\\n }\",\n \"public void printFile() {\\n\\t\\t\\n\\t\\tfor(String[] line_i: linesArray) {\\n\\t\\t\\tSystem.out.println( Arrays.toString(line_i) );\\n\\t\\t}\\n\\t}\",\n \"public void printResults(){\\n\\t\\tSystem.out.println(\\\"The area of the triangle is \\\" + findArea());\\n\\t\\tSystem.out.println(\\\"The perimeter of the triangle is \\\"+ findPerimeter());}\",\n \"public static void printInfo(){\\n }\",\n \"public static void printPath(int[] prev, int v) {\\n\\t\\tif(prev[v] != -1) {\\n\\t\\t\\tprintPath(prev,prev[v]);\\n\\t\\t\\tSystem.out.print(\\\"-\\\");\\n\\t\\t}\\n\\t\\tSystem.out.print(v);\\n\\t}\",\n \"@Override\\n public String toString() {\\n return \\\"ls [PATH ...]:\\\\n\\\" + \\\"\\\\tList the contents.\\\\n\\\" + \\\"\\\\tNote:\\\\n\\\"\\n + \\\"\\\\t1.If no PATH given, print contents of current directory.\\\\n\\\"\\n + \\\"\\\\t2.If PATH specifies a directory, print its contents(file or \\\"\\n + \\\"directory).\\\\n\\\" + \\\"\\\\t3.If PATH specifies a file, print its name.\\\";\\n }\",\n \"public void printInfo(){\\n\\t}\",\n \"public void printInfo(){\\n\\t}\",\n \"private static void displaySoundDir(){\\n System.out.println(SOUNDS_DIR);\\n }\",\n \"void debug() {\\n\\t\\tfor( int i = 0; i < N; i++ ) {\\t\\n\\t\\t\\tSystem.out.print(i+\\\" \\\");\\n\\t\\t\\tfor( int j = 0; j < N; j++ )\\n\\t\\t\\t\\tSystem.out.print(j+\\\":\\\"+(defined[i][j]?\\\"T\\\":\\\"F\\\")+\\\" \\\"+\\n\\t\\t\\t\\t\\t\\tc[i][j]+\\\" p=\\\"+path[i][j]+\\\" f=\\\"+f[i][j]+\\\"; \\\");\\n\\t\\t\\tSystem.out.println();\\n\\t\\t}\\n\\t}\",\n \"public static void main(String[] args) {\\n List<String> paths = findPaths(10);\\n paths.forEach(System.out::println);\\n }\",\n \"public void printFilesIn(String word){\\n System.out.println(\\\"\\\\nThe word \\\" + word + \\\" is in the following files: \\\");\\n for (String s : hashWords.keySet()){\\n if (s.equals(word)){\\n ArrayList wordAndFiles = hashWords.get(s);\\n for (int i=0; i< wordAndFiles.size(); i++){\\n System.out.println(wordAndFiles.get(i));\\n }\\n }\\n }\\n }\",\n \"public void print() {\\n\\t\\tSystem.out.println(\\\"ONOMA IDIOKTITH: \\\" + fname);\\n\\t\\tSystem.out.println(\\\"EPWNYMO IDIOKTITH: \\\" + lname);\\n\\t\\tSystem.out.println(\\\"DIEUTHINSH FARMAKEIOU: \\\" + address);\\n\\t\\tSystem.out.println(\\\"THLEFWNO FARMAKEIOU: \\\" + telephone);\\n\\t\\tSystem.out.println();\\n\\t}\",\n \"@DISPID(35)\\r\\n\\t// = 0x23. The runtime will prefer the VTID if present\\r\\n\\t@VTID(40)\\r\\n\\tjava.lang.String fullPath();\",\n \"private static void printUsage() {\\n\\t\\tSystem.out.println(\\\"[0] apk files directory\\\");\\n\\t\\tSystem.out.println(\\\"[1] android-jar directory\\\");\\n\\t}\",\n \"void printInfo();\",\n \"public String getResultingString(IDirectory toLsDir) {\\r\\n // get sub-directories and files\\r\\n String result = \\\"\\\";\\r\\n // Check if the path is valid\\r\\n if (toPrint) {\\r\\n // Get the sub-directories and files\\r\\n ArrayList<DirectoryTreeNode> contents = toLsDir.getContents();\\r\\n\\r\\n // check if contents is empty or not\\r\\n if (!contents.isEmpty()) {\\r\\n // get the names of all the sub-directories\\r\\n for (DirectoryTreeNode content : contents) {\\r\\n result += content.getName() + \\\"\\\\n\\\";\\r\\n }\\r\\n }\\r\\n // If the path is not valid then return an appropriate message\\r\\n } else {\\r\\n if (toRedirect) {\\r\\n System.out.println(\\\"Error: Cannot access path.\\\\n\\\");\\r\\n } else\\r\\n result = \\\"Cannot access path \\\\n\\\";\\r\\n }\\r\\n // return the result\\r\\n return result;\\r\\n }\",\n \"public void printIndex() {\\n System.out.println(\\\"\\\\n\\\" + \\\"=== Staged Files ===\\\");\\n List<String> addingStage = Utils.plainFilenamesIn(INDEX);\\n for (String filesName: addingStage) {\\n File fileInIndex = new File(INDEX, filesName);\\n File fileInCWD = new File(Main.CWD, filesName);\\n if (Utils.readContentsAsString(fileInCWD)\\n .equals(Utils.readContentsAsString(fileInIndex))) {\\n System.out.println(filesName);\\n }\\n }\\n }\",\n \"@DISPID(77)\\r\\n\\t// = 0x4d. The runtime will prefer the VTID if present\\r\\n\\t@VTID(75)\\r\\n\\tjava.lang.String fullPath();\",\n \"private static void findPath()\\r\\n {\\r\\n String temp_path = System.getProperty(\\\"user.dir\\\");\\r\\n char last = temp_path.charAt(temp_path.length() - 1);\\r\\n if(last == 'g')\\r\\n {\\r\\n path = \\\".\\\";\\r\\n }\\r\\n else\\r\\n {\\r\\n path = \\\"./bag\\\";\\r\\n }\\r\\n \\r\\n }\",\n \"public void directoryPathPrompt() {\\n System.out.println(\\\"Enter a file path to export the PDF of the schedule to.\\\");\\n }\",\n \"public void printLDR() {\\n if(!empty()) {\\n printLDRNodes(root);\\n System.out.println();\\n }\\n }\",\n \"private static void printUsage() throws Exception {\\n\\t\\tSystem.out.println(new ResourceGetter(\\\"uk/ac/cam/ch/wwmm/oscar3/resources/\\\").getString(\\\"usage.txt\\\"));\\n\\t}\",\n \"public static void main(String[] args) {\\n TreeNode root = new TreeNode(1);\\n root.left = new TreeNode(2);\\n root.right = new TreeNode(3);\\n root.left.left = new TreeNode(4);\\n root.left.right = new TreeNode(8);\\n root.right.left = new TreeNode(6);\\n root.right.right = new TreeNode(7);\\n Solution34 solution34 = new Solution34();\\n System.out.println(solution34.FindPath(root,11));\\n }\",\n \"private void findMatches(String key, String path, boolean caseSensitive, boolean fileName) {\\n\\t\\tfor (String word : document) {\\n\\t\\t\\tif (contains(key, word, caseSensitive)) {\\n\\t\\t\\t\\tif (fileName) {\\n\\t\\t\\t\\t\\tSystem.out.println(path);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tSystem.out.println(word);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public static void searchFile() \\n\\t{\\n\\t\\t//Variable Declaration\\n\\t\\tString fileName;\\n\\t\\tScanner obj = new Scanner(System.in);\\n\\n\\t\\t//Read file name from user\\n\\t\\tSystem.out.println(\\\"Enter file name to searched:\\\");\\n\\t\\tfileName= obj.nextLine();\\n\\t\\t\\n\\t\\t//Searching the file\\n\\t\\tboolean isFound = FileManager.searchFile(folderpath, fileName);\\n\\t\\t\\n\\t\\tif(isFound)\\n\\t\\t\\tSystem.out.println(\\\"File is present\\\");\\n\\t\\telse\\n\\t\\t\\tSystem.out.println(\\\"File not present.\\\");\\n\\n\\t}\",\n \"public void printString()\\r\\n\\t\\t{\\r\\n\\t\\t\\tTreeNode previousTreeNode = null; //holds the previous node\\r\\n\\t\\t\\tTreeNode currentTreeNode = null; //holds current node\\r\\n\\r\\n\\t\\t\\tData currentData = head; //start at the head of our data which is a linked list\\r\\n\\t\\t\\twhile (currentData != null) //while the currentData is not null\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tcurrentTreeNode = currentData.getLT(); //get the Less Than tree\\r\\n\\t\\t\\t\\tif (currentTreeNode != previousTreeNode)\\r\\n\\t\\t\\t\\t\\tcurrentTreeNode.printString(); //print the Less Than tree\\r\\n\\t\\t\\t\\tpreviousTreeNode = currentTreeNode;\\r\\n\\r\\n\\t\\t\\t\\tcurrentData.getWord(); //get the current word\\r\\n\\t\\t\\t\\tSystem.out.printf(\\\"%-20s\\\", currentData.getWord()); //print the current word\\r\\n\\t\\t\\t\\tArrayList locations = currentData.getLocations(); //get the word's locations in the file\\r\\n\\t\\t\\t\\tfor (int i = 0; i < locations.size(); i++) //print all of those\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tSystem.out.printf(\\\" (%s,%s)\\\", ((Point) locations.get(i)).x, ((Point) locations.get(i)).y);\\r\\n\\t\\t\\t\\t\\tif ((((i + 1) % 8) == 0) && ((i + 1) != locations.size())) //only print 8 items per line\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tSystem.out.printf(\\\"\\\\n%-20s\\\", \\\"\\\\\\\"\\\");\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tSystem.out.println(); //print a newline\\r\\n\\r\\n\\t\\t\\t\\tcurrentTreeNode = currentData.getGT(); //get the Greater Than tree\\r\\n\\t\\t\\t\\tif (currentTreeNode != previousTreeNode)\\r\\n\\t\\t\\t\\t\\tcurrentTreeNode.printString(); //print the Greater Than tree\\r\\n\\t\\t\\t\\tpreviousTreeNode = currentTreeNode;\\r\\n\\t\\t\\t\\tcurrentData = currentData.nextData();\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\",\n \"String displayableFileName(String path) {\\n String result = \\\"\\\";\\n StringTokenizer tok = new StringTokenizer(path, \\\"\\\\\\\\/\\\");\\n while (tok.hasMoreTokens()) {\\n result = tok.nextToken();\\n }\\n return result;\\n }\",\n \"private static void print(String p) {\\n\\t\\tSystem.out.println(PREFIX + p);\\n\\t}\",\n \"@Override\\n\\tvoid display() {\\n\\t\\tif(nodeList == null || nodeList.size() == 0) {\\n\\t\\t\\tSystem.out.println(\\\"not found.\\\");\\n\\t\\t\\treturn;\\n\\t\\t}\\n for(Inode inode:nodeList) {\\n\\t\\t\\tSystem.out.println(inode.nodename);\\n }\\n\\t}\",\n \"public static void printShortestPath(List<Town> sp) {\\n\\t\\tint size = sp.size();\\n\\t\\tif ( size>1 ) {\\n\\t\\t\\tfor( int i = 1; i <= size; i++) {\\n\\t\\t\\t\\tif( i != size ) {\\n\\t\\t\\t\\t\\tSystem.out.print( sp.get(size-i).getName()+\\\"-\\\" );\\n\\t\\t\\t\\t}else {\\n\\t\\t\\t\\t\\tSystem.out.print( sp.get(size-i).getName());\\n\\t\\t\\t\\t} \\n\\t\\t\\t}\\t\\t\\t\\n\\t\\t}else {\\n\\t\\t\\tSystem.out.println(\\\"There is no possible route\\\");\\n\\t\\t}\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7210239","0.67714804","0.6730696","0.6634288","0.65731144","0.648892","0.6418824","0.6374114","0.63300073","0.6317806","0.6148213","0.61161673","0.6072567","0.60206854","0.59955037","0.59786135","0.5966822","0.59166485","0.5879695","0.587811","0.58117986","0.5775113","0.5771761","0.5720602","0.5717444","0.5709887","0.5678094","0.56672007","0.5667004","0.5666989","0.56586957","0.56560963","0.562961","0.56069493","0.55532384","0.553526","0.55058277","0.55049014","0.5500583","0.54995525","0.5498738","0.5488026","0.5484205","0.5465231","0.54482704","0.54474604","0.5439524","0.5437433","0.5411883","0.54025173","0.5400063","0.5396782","0.53957283","0.5386288","0.53853744","0.53819704","0.5379532","0.5375368","0.53706974","0.5357772","0.5357553","0.53528166","0.53500855","0.53436923","0.53356695","0.53328496","0.5323467","0.5321846","0.53203213","0.5316763","0.5316719","0.5309998","0.5302317","0.52967733","0.52858394","0.5283218","0.5283218","0.52693903","0.52597433","0.5247994","0.5245924","0.52450895","0.52430606","0.52294904","0.52178115","0.5213663","0.5212705","0.5201619","0.5197682","0.5196524","0.5195905","0.51943135","0.51905495","0.5166667","0.5164814","0.5163982","0.51632905","0.5162029","0.51546454","0.51447856"],"string":"[\n \"0.7210239\",\n \"0.67714804\",\n \"0.6730696\",\n \"0.6634288\",\n \"0.65731144\",\n \"0.648892\",\n \"0.6418824\",\n \"0.6374114\",\n \"0.63300073\",\n \"0.6317806\",\n \"0.6148213\",\n \"0.61161673\",\n \"0.6072567\",\n \"0.60206854\",\n \"0.59955037\",\n \"0.59786135\",\n \"0.5966822\",\n \"0.59166485\",\n \"0.5879695\",\n \"0.587811\",\n \"0.58117986\",\n \"0.5775113\",\n \"0.5771761\",\n \"0.5720602\",\n \"0.5717444\",\n \"0.5709887\",\n \"0.5678094\",\n \"0.56672007\",\n \"0.5667004\",\n \"0.5666989\",\n \"0.56586957\",\n \"0.56560963\",\n \"0.562961\",\n \"0.56069493\",\n \"0.55532384\",\n \"0.553526\",\n \"0.55058277\",\n \"0.55049014\",\n \"0.5500583\",\n \"0.54995525\",\n \"0.5498738\",\n \"0.5488026\",\n \"0.5484205\",\n \"0.5465231\",\n \"0.54482704\",\n \"0.54474604\",\n \"0.5439524\",\n \"0.5437433\",\n \"0.5411883\",\n \"0.54025173\",\n \"0.5400063\",\n \"0.5396782\",\n \"0.53957283\",\n \"0.5386288\",\n \"0.53853744\",\n \"0.53819704\",\n \"0.5379532\",\n \"0.5375368\",\n \"0.53706974\",\n \"0.5357772\",\n \"0.5357553\",\n \"0.53528166\",\n \"0.53500855\",\n \"0.53436923\",\n \"0.53356695\",\n \"0.53328496\",\n \"0.5323467\",\n \"0.5321846\",\n \"0.53203213\",\n \"0.5316763\",\n \"0.5316719\",\n \"0.5309998\",\n \"0.5302317\",\n \"0.52967733\",\n \"0.52858394\",\n \"0.5283218\",\n \"0.5283218\",\n \"0.52693903\",\n \"0.52597433\",\n \"0.5247994\",\n \"0.5245924\",\n \"0.52450895\",\n \"0.52430606\",\n \"0.52294904\",\n \"0.52178115\",\n \"0.5213663\",\n \"0.5212705\",\n \"0.5201619\",\n \"0.5197682\",\n \"0.5196524\",\n \"0.5195905\",\n \"0.51943135\",\n \"0.51905495\",\n \"0.5166667\",\n \"0.5164814\",\n \"0.5163982\",\n \"0.51632905\",\n \"0.5162029\",\n \"0.51546454\",\n \"0.51447856\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6081941"},"document_rank":{"kind":"string","value":"12"}}}],"truncated":false,"partial":true},"paginationData":{"pageIndex":261,"numItemsPerPage":100,"numTotalItems":136513,"offset":26100,"length":100}},"jwt":"eyJhbGciOiJFZERTQSIsImtpZCI6Im1sR1pFYktIVHRVSGRhX1RRdEczQ0N1S3k5ME9Qd25DNHY5elRjM3FVYzgifQ.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc4MzUwMjExNCwianRpIjoiZTYxNDU2MjktN2MyYS00ZWEyLWJlNmQtMzE2ODdkYmI4NjE4Iiwic3ViIjoiL2RhdGFzZXRzL25vbWljLWFpL2Nvcm5zdGFjay1qYXZhLXYxIiwiZXhwIjoxNzgzNTA1NzE0LCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.TRc7GAjZRuqFIZv2_y4Woee5kDBTfgjJArACXHomNTuxbQKKYlKcWAH7qbZoHf6h0pgUb-mfwA5nSndQ3F7TCw","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 |
|---|---|---|---|---|---|---|
public Hdf5VolatileShortArrayLoader getShortArrayLoader() // REMOVED Checks whether the given image data is present in the hdf5. Missing data may be caused by missing partition files | public boolean existsImageData( final ViewLevelId id )
{
return getDimsAndExistence( id ).exists();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Test\n public void testLoadArrayDesign() throws PlatformLoadingException, AffymetrixCdfReadException {\n checkLoadArrayDesign(TestArrayDesignFiles.HG_U133_PLUS_2_CDF_FILE,\n TestArrayDesignFiles.HG_U133_PLUS_2_ANNOTATION_FILE);\n }",
"@Test\n public void testmagicNumbersForBigData... | [
"0.49289873",
"0.4839912",
"0.48364797",
"0.48168164",
"0.4797382",
"0.478427",
"0.4759996",
"0.47474092",
"0.4732234",
"0.47153866",
"0.4686918",
"0.46776426",
"0.46371982",
"0.46312422",
"0.46046105",
"0.45885438",
"0.45747393",
"0.45715347",
"0.45577306",
"0.4552559",
"0.4... | 0.0 | -1 |
the voxel size is not stored in the hdf5 | @Override
public VoxelDimensions getVoxelSize( final int timepointId )
{
return null;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public int get_size() {\r\n return this.dimension * 2 * sizeof_float + 4 * sizeof_float + sizeof_dimension + sizeof_int;\r\n }",
"public int size() {\n\treturn slices*rows*columns;\n}",
"public int getCellsUniverseSize(){\r\n return cellsUniverse.size();\r\n }",
"@Override\n public int g... | [
"0.6599207",
"0.6586686",
"0.6574869",
"0.6514291",
"0.63936824",
"0.61874914",
"0.6135377",
"0.6117144",
"0.6086963",
"0.6048025",
"0.6042399",
"0.60114104",
"0.60112447",
"0.59962827",
"0.5988488",
"0.5979548",
"0.5975258",
"0.59671646",
"0.592885",
"0.592885",
"0.592885",
... | 0.6161216 | 6 |
TODO Autogenerated method stub | public void onAccuracyChanged(Sensor sensor, int accuracy) {
} | {
"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.66708666",
"0.65675074",
"0.65229905",
"0.6481001",
"0.64770633",
"0.64584893",
"0.6413091",
"0.63764185",
"0.6275735",
"0.62541914",
"0.6236919",
"0.6223816",
"0.62017626",
"0.61944294",
"0.61944294",
"0.61920846",
"0.61867654",
"0.6173323",
"0.61328775",
"0.61276996",
"0... | 0.0 | -1 |
TODO Autogenerated method stub | @Override
protected void onStop() {
super.onStop();
sensormanager.unregisterListener(sensorEventListener);
} | {
"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
protected void onResume() {
Sensor orientationSensor = sensormanager.getDefaultSensor(Sensor.TYPE_GYROSCOPE);
sensormanager.registerListener(sensorEventListener, orientationSensor, SensorManager.SENSOR_DELAY_NORMAL);
Sensor accelerometerSensor = sensormanager.getDefaultSensor(Sens... | {
"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 onClick(DialogInterface dialog, int which) {
Message msg = new Message();
msg.what = 1;
add_address_handler.sendMessage(msg);
} | {
"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 onClick(DialogInterface dialog, int which) {
Message msg = new Message();
msg.what = 0;
add_address_handler.sendMessage(msg);
} | {
"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.66708666",
"0.65675074",
"0.65229905",
"0.6481001",
"0.64770633",
"0.64584893",
"0.6413091",
"0.63764185",
"0.6275735",
"0.62541914",
"0.6236919",
"0.6223816",
"0.62017626",
"0.61944294",
"0.61944294",
"0.61920846",
"0.61867654",
"0.6173323",
"0.61328775",
"0.61276996",
"0... | 0.0 | -1 |
TODO Autogenerated method stub | @Override
public void onClick(DialogInterface dialog, int which) {
Message msg = new Message();
msg.what = 1;
set_handler.sendMessage(msg);
} | {
"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 onClick(DialogInterface dialog, int which) {
Message msg = new Message();
msg.what = 0;
set_handler.sendMessage(msg);
} | {
"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 / LinkedHashMap contains only unique elements. maintains insertion order. may have only one null key and multiple null values. | public static void main(String[] args) {
Map<Integer, String> friends = new LinkedHashMap<Integer, String>();
friends.put(1, "Rohith");
friends.put(null, "Sai");
friends.put(3, null);
friends.put(4, null);
System.out.println("The number of entries in the LinkedHashMap is:"+" "+friends.size()+"\n");... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Test\n\tpublic void testLinkedHashMap() {\n\t\tLinkedHashMap lhm = new LinkedHashMap();\n\t\tlhm.put(\"evyaan\", 700);\n\t\tlhm.put(\"varun\", 100);\n\t\tlhm.put(\"dolly\", 300);\n\t\tlhm.put(\"vaishu\", 400);\n\t\tlhm.put(\"vaishu\", 300);\n\t\tlhm.put(null, 500);\n\t\tlhm.put(null, 600);\n\n\t\tassertEquals(\"{... | [
"0.6921599",
"0.61451256",
"0.58819604",
"0.58261526",
"0.58189535",
"0.5675276",
"0.56403315",
"0.5627586",
"0.5626552",
"0.55787677",
"0.5551871",
"0.5514184",
"0.54697704",
"0.54110324",
"0.5391335",
"0.5389245",
"0.53875864",
"0.5382618",
"0.53729016",
"0.5337766",
"0.532... | 0.0 | -1 |
Initializes a new widget instance with the supplied name. This is a constructor. It is a special method that is called when an object/instance is created. It should initialize all of the instance members. | public Widget(String widgetName) {
/*
* THIS - The "this" keyword refers to the current instance. Here, we set this object's widget
* name to whatever was passed in to the constructor.
*
* Using this keyword helps indicate when code is referencing an instance member versus a local
* variabl... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Widget() {\n /*\n * THIS - You can use the \"this\" keyword as a method too, which will call the appropriate\n * constructor. This lets you reuse the initialization code you have written in a different\n * constructor.\n */\n this(\"Widget\");\n }",
"public Widget() {\r\n\t\t\r\n\t\... | [
"0.7334273",
"0.6446221",
"0.6362409",
"0.631342",
"0.62234485",
"0.620474",
"0.6173383",
"0.6150293",
"0.60695225",
"0.60665226",
"0.60562354",
"0.6036493",
"0.6017311",
"0.59872013",
"0.59087515",
"0.5899531",
"0.58600056",
"0.5843963",
"0.5825141",
"0.5815155",
"0.5806007"... | 0.7689424 | 0 |
Initializes a new widget instance. This is an example of overloading. You can provide methods with the same name, but different parameters. They should do the same thing! A good way to ensure this is to call the other overloaded method from this one. Method overloading is a form of polymorphism ("many forms"). This is ... | public Widget() {
/*
* THIS - You can use the "this" keyword as a method too, which will call the appropriate
* constructor. This lets you reuse the initialization code you have written in a different
* constructor.
*/
this("Widget");
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Widget(String widgetName) {\n /*\n * THIS - The \"this\" keyword refers to the current instance. Here, we set this object's widget\n * name to whatever was passed in to the constructor.\n *\n * Using this keyword helps indicate when code is referencing an instance member versus a local\n ... | [
"0.623092",
"0.6182773",
"0.6165028",
"0.5797286",
"0.56724316",
"0.562757",
"0.5605376",
"0.55967677",
"0.5555295",
"0.5500736",
"0.5458013",
"0.5454354",
"0.54466075",
"0.5446378",
"0.5435339",
"0.54140896",
"0.54032654",
"0.5343326",
"0.53166145",
"0.531415",
"0.5310804",
... | 0.73376244 | 0 |
Returns the number of widgets initialized. This is a static method or class method A static method may not access any instance members. The method itself does not require an instance to be created, and can be accessed through the class name. If the method does not access any instance members, make sure you make it stat... | public static int numWidgets() {
return Widget.numWidgets;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public int getWidgetCount() {\n return widgets.size(); \n }",
"public static int getCount() {\r\n\t\treturn count;\r\n\t}",
"public static int getCount() {\r\n\t\treturn count;\r\n\t}",
"public static int getCount() {\r\n\t\treturn count;\r\n\t}",
"public static int getCount() {\n\t\treturn count;\n\t... | [
"0.7532562",
"0.6278238",
"0.6278238",
"0.6278238",
"0.6219192",
"0.6189509",
"0.6167659",
"0.61564285",
"0.6152713",
"0.6112086",
"0.6096204",
"0.6037833",
"0.6037833",
"0.6037833",
"0.6032293",
"0.6032293",
"0.60310066",
"0.602951",
"0.59889454",
"0.5986303",
"0.5967168",
... | 0.7713648 | 0 |
Returns the widget names as a list. This is an example of a safe get method. Instead of returning the reference to our private mutable data directly, it is first made unmodifiable. While code in this class will still be able to mutate the data, code outside of this class will not. | public static List<String> getNames() {
return Collections.unmodifiableList(widgetNames);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public List<Widget> getWidgets() {\n return widgets;\n }",
"private ArrayList<String> getNames() {\n\t\tNameDialog n = new NameDialog();\n\t\tnameList = new ArrayList<String>();\n\t\ttry {\n\t\t\tnameList = n.getNames(inputs[1]);\n\t\t}catch(GameException ex) {\n\t\t\tview.close();\n\t\t\tmenuStage.show();\n... | [
"0.6652034",
"0.6110098",
"0.6067214",
"0.6059456",
"0.5747976",
"0.5718807",
"0.57073545",
"0.5706569",
"0.57060677",
"0.56900895",
"0.5688733",
"0.5684359",
"0.5684216",
"0.5632794",
"0.56310517",
"0.558958",
"0.55660963",
"0.5548847",
"0.5529691",
"0.55195063",
"0.55069476... | 0.8295028 | 0 |
Returns the widget name. This is an example nonstatic or instance method, which can only be accessed through an actual instance. It is also a safe get method since String is an immutable type. | public String getName() {
return this.widgetName;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public String getName() {\r\n\t\treturn GDAssemblerUI.getText(UI_TEXT);\r\n\t}",
"public String getName() {\n if (name == null && !nameExplicitlySet) {\n synchronized(this) {\n if (name == null && !nameExplicitlySet)\n name = constructComponentName();\n ... | [
"0.6519288",
"0.63395095",
"0.62802917",
"0.6211586",
"0.61606187",
"0.6050292",
"0.60472715",
"0.6032716",
"0.60123646",
"0.5988568",
"0.59720105",
"0.596985",
"0.5961973",
"0.59592605",
"0.5924139",
"0.5919351",
"0.5916858",
"0.5916858",
"0.5916858",
"0.59134895",
"0.590351... | 0.77990097 | 0 |
Returns whether the supplied name is valid. This is an example of a private static helper method. Helper methods are not visible outside of the class and are meant to "help" the other public methods in this class. | private static boolean validName(String name) {
return name != null && !name.strip().isBlank();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private boolean isNameValid(String name) {\n\n }",
"public boolean checkName(String name)\n {\n return true;\n }",
"public boolean isValidName(String name)\r\n {\r\n // check for illegal combinations of characters\r\n // this is probably not a complete check, but hopefully it is good enough\r\n ... | [
"0.8656496",
"0.8032742",
"0.7958487",
"0.79131925",
"0.78772825",
"0.78110784",
"0.7789111",
"0.7654023",
"0.7633365",
"0.76084435",
"0.7584658",
"0.75827175",
"0.7569277",
"0.75619197",
"0.7535715",
"0.751364",
"0.74723136",
"0.7372152",
"0.73268574",
"0.72861814",
"0.72694... | 0.7559545 | 14 |
Called when the activity is first created. | @Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState, R.layout.goodscheck_view);
Log.i(TAG, "onCreate()");
Intent intent = getIntent();
gj = intent.getStringExtra("gj");
zw = intent.getStringExtra("zw");
birthday_s = intent.getStringExtra("birthday_s");
ssdw = i... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n\tpublic void onActivityCreated(Bundle savedInstanceState) {\n\t\tsuper.onActivityCreated(savedInstanceState);\n\t\tinit();\n\t}",
"@Override\r\n\tpublic void onActivityCreated(Bundle savedInstanceState) {\n\t\tsuper.onActivityCreated(savedInstanceState);\r\n\t}",
"@Override\n\tpublic void onActivit... | [
"0.791686",
"0.77270156",
"0.7693263",
"0.7693263",
"0.7693263",
"0.7693263",
"0.7693263",
"0.7693263",
"0.7637394",
"0.7637394",
"0.7629958",
"0.76189965",
"0.76189965",
"0.7543775",
"0.7540053",
"0.7540053",
"0.7539505",
"0.75269467",
"0.75147736",
"0.7509639",
"0.7500879",... | 0.0 | -1 |
TODO Autogenerated method stub | @Override
public void offLineResult(Pair<Boolean, Object> res, int offLineRequestType) {
Log.i(TAG, "offLineResult()offLineRequestType:" + offLineRequestType
+ ",res.second" + (res.second != null));
if (res.first) {
offLineToast(getString(R.string.save_success));
finish();
} else {
offLineToast((Str... | {
"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 onClick(DialogInterface arg0, int arg1,
boolean arg2) {
states[arg1] = arg2;
} | {
"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.66708666",
"0.65675074",
"0.65229905",
"0.6481001",
"0.64770633",
"0.64584893",
"0.6413091",
"0.63764185",
"0.6275735",
"0.62541914",
"0.6236919",
"0.6223816",
"0.62017626",
"0.61944294",
"0.61944294",
"0.61920846",
"0.61867654",
"0.6173323",
"0.61328775",
"0.61276996",
"0... | 0.0 | -1 |
TODO Autogenerated method stub | @Override
public void onClick(DialogInterface arg0, int arg1) {
StringBuffer text = new StringBuffer();
int num = states.length;
if (num > 0) {
for (int i = 0; i < num; i++) {
if (states[i]) {
if (text.length() > 0) {
text.append(";");
}
text.a... | {
"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: Warning this method won't work in the case the id fields are not set | @Override
public boolean equals(Object object) {
if (!(object instanceof Physician)) {
return false;
}
Physician other = (Physician) object;
if ((this.physicianId == null && other.physicianId != null) || (this.physicianId != null && !this.physicianId.equals(other.phy... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void setId(Integer id) { this.id = id; }",
"private Integer getId() { return this.id; }",
"public void setId(int id){ this.id = id; }",
"public void setId(Long id) {this.id = id;}",
"public void setId(Long id) {this.id = id;}",
"public void setID(String idIn) {this.id = idIn;}",
"public void se... | [
"0.68954784",
"0.68378097",
"0.6704338",
"0.66405046",
"0.66405046",
"0.6591173",
"0.6577649",
"0.6577649",
"0.657354",
"0.657354",
"0.657354",
"0.657354",
"0.657354",
"0.657354",
"0.65609664",
"0.65609664",
"0.6543523",
"0.65234846",
"0.6514877",
"0.6486739",
"0.64767367",
... | 0.0 | -1 |
Games for each comp | public WorkflowConfiguration() {
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Games game();",
"public Collection<Game> getAllActiveGames() {\n return gameRepository.findAllActive();\n }",
"public void compare(){\n\t\tboolean gameOver = false;\n\t\tfor (int j = 0; j < player.size(); j++){\n\t\t\t/**\n\t\t\t * gameover screen\n\t\t\t */\n\t\t\tif (player.get(j) != input.get(j)){... | [
"0.6022599",
"0.58579236",
"0.57952803",
"0.5791329",
"0.56975895",
"0.566204",
"0.5634355",
"0.5633005",
"0.5630129",
"0.56194377",
"0.5611854",
"0.55959266",
"0.55832654",
"0.55700564",
"0.5525293",
"0.5514421",
"0.55070347",
"0.54858845",
"0.5474273",
"0.54696506",
"0.5365... | 0.0 | -1 |
Created by Oscar on 14/12/15. | public interface Interactor extends Runnable {
void run();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public void perish() {\n \n }",
"@Override\n\tpublic void grabar() {\n\t\t\n\t}",
"public final void mo51373a() {\n }",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"private stendhal() {\n\t}",
"@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"@Override\r\n... | [
"0.604507",
"0.60224456",
"0.59214926",
"0.5915868",
"0.58510923",
"0.58192044",
"0.57963574",
"0.57881856",
"0.57881856",
"0.57253265",
"0.57133347",
"0.5702901",
"0.56991017",
"0.5698771",
"0.56957316",
"0.5692372",
"0.56568927",
"0.56441015",
"0.5638698",
"0.5638698",
"0.5... | 0.0 | -1 |
String courseType = "D"; | public void unEnrollUsers() {
CourseTypeTemplate courseTypeTemplate = getCourseTypeTemplate(courseType);
if (courseTypeTemplate.isPastCourse.equals("true")){
String targetCourse = getFullCourseName("Coures" + courseType);
List<String> ins = getFullNameUsers(courseTypeTemplate.in... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public String getCourse(char type)\n\t{\n\t\tString strCourse;\n\t\tswitch(type)\n\t\t{\n\t\t\tcase 'd':\n\t\t\tcase 'D':\n\t\t\t\tstrCourse = courseDesc;\n\t\t\t\tbreak;\n\t\t\tcase 'n':\n\t\t\tcase 'N':\n\t\t\t\tstrCourse= courseNum;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tstrCourse= (\"invalid\");\n\t\t}\n\t\t... | [
"0.70658666",
"0.65401417",
"0.63398093",
"0.61230904",
"0.60879827",
"0.5935489",
"0.5895553",
"0.5851151",
"0.5788975",
"0.5769569",
"0.5743182",
"0.57195145",
"0.57187",
"0.5718112",
"0.5698222",
"0.56632036",
"0.5628376",
"0.55630827",
"0.5539338",
"0.55301625",
"0.551830... | 0.0 | -1 |
TODO Autogenerated method stub | public Locale getLocale() {
return Locale.US;
} | {
"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 | public static Language getAD_Language() {
return null;
} | {
"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 | public boolean isBaseLanguage() {
return false;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override\r\n\t\t\tpublic void annadir() {\n\r\n\t\t\t}",
"@Override\n\tpublic void anular() {\n\n\t}",
"@Override\n\tprotected void getExr... | [
"0.66708666",
"0.65675074",
"0.65229905",
"0.6481001",
"0.64770633",
"0.64584893",
"0.6413091",
"0.63764185",
"0.6275735",
"0.62541914",
"0.6236919",
"0.6223816",
"0.62017626",
"0.61944294",
"0.61944294",
"0.61920846",
"0.61867654",
"0.6173323",
"0.61328775",
"0.61276996",
"0... | 0.0 | -1 |
TODO Autogenerated method stub | public String getName() {
return null;
} | {
"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 |
Flagged in 'occlude.dat'. Roof. | private void setTfaData() { // Set fields from tfa.
dims[0] = (byte)(1 + (tfa[2]&7));
dims[1] = (byte)(1 + ((tfa[2]>>3)&7));
dims[2] = (byte)((tfa[0] >> 5)&7);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void addOcclusion(int start, int end) {\n\t\tocclusions.add(new IntPair(start,end));\n\t}",
"public boolean removeOcclusion(IntPair occl) {\n\t\tint i = occlusions.indexOf(occl);\n\t\tif(i != -1) {\n\t\t\tocclusions.remove(i);\n\t\t\treturn true;\n\t\t} else return false;\n\t}",
"public static void conc... | [
"0.5265005",
"0.49650878",
"0.49108154",
"0.48270494",
"0.48157755",
"0.47362876",
"0.4674602",
"0.465504",
"0.45871428",
"0.45595923",
"0.45303655",
"0.44870892",
"0.43964592",
"0.4375919",
"0.43728405",
"0.4346069",
"0.43347815",
"0.43320894",
"0.43270358",
"0.43200237",
"0... | 0.0 | -1 |
Get tile dims., flipped for reflected (bit 5) frames. | public int get3dXtiles(int framenum)
{ return dims[(framenum >> 5)&1]; } | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static int getTileSize(){\n\t\treturn tileDim;\n\t}",
"public static int getTileBits() {\n return TILE_BITS;\n }",
"int getTileSize();",
"public static int getTileBitSize() {\n return TILE_BIT_SIZE;\n }",
"public static float getHalfTileHeight() {\r\n\t\treturn 32;\r\n\t}",
"public static ... | [
"0.64743155",
"0.60858905",
"0.6037613",
"0.58960533",
"0.58704126",
"0.5815007",
"0.57038516",
"0.5690907",
"0.5688821",
"0.5669538",
"0.5653968",
"0.56510305",
"0.5638021",
"0.56289256",
"0.56248814",
"0.5581276",
"0.55758",
"0.55503356",
"0.55358213",
"0.5520683",
"0.55179... | 0.7121797 | 0 |
Returns x<<8 + y, as bytes. Sets x to 255 if there is no weapon offset | public int getWeaponOffset(int frame) {
int x, y;
if (weaponOffsets == null) {
x = y = 255;
} else {
// x could be 255 (see read_info())
x = weaponOffsets[frame * 2]&0xff;
y = weaponOffsets[frame * 2 + 1]&0xff;
}
return (x<<8)|y;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private static byte int2(int x) { return (byte)(x >> 16); }",
"public int toMapOffset(int x, int y) {\r\n\t\treturn (x - y) * 65 + (x - y + 1) / 2 - x;\r\n\t}",
"@Override\n public byte[] pack() {\n // If data not set\n if (m_ptLoc == null)\n return (null);\n \n byte[]... | [
"0.56450665",
"0.5600083",
"0.55378985",
"0.5489602",
"0.54011023",
"0.53924716",
"0.5354334",
"0.5318388",
"0.5311825",
"0.5295557",
"0.5291558",
"0.5283369",
"0.52619356",
"0.52531064",
"0.52457595",
"0.52157885",
"0.5201324",
"0.51990646",
"0.5197079",
"0.51962864",
"0.518... | 0.64247155 | 0 |
Seat is a special case. | public int getRotatedFrame(int curframe, int quads) {
if (bargeType == barge_seat) {
int dir = curframe%4; // Current dir (0-3).
return (curframe - dir) + (dir + quads)%4;
} else if (isBargePart()) // Piece of a barge?
switch (quads) {
case 1:
return (curframe^32)^((curframe&32) != 0 ? 3 : 1);
c... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public String getSeat() {\n\t\t\treturn seat;\n\t\t}",
"public Seat getSeat()\r\n\t{\r\n\t\tif( seat != null )\r\n\t\t{\r\n\t\t\treturn seat;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\treturn null;\r\n\r\n\t\t}\r\n\t}",
"public void setSeat( Seat seat )\r\n\t{\r\n\t\tthis.seat = seat;\r\n\t}",
"@Override\n pu... | [
"0.76662374",
"0.7563037",
"0.74859774",
"0.74600047",
"0.7386302",
"0.7377039",
"0.7205508",
"0.71725905",
"0.7142114",
"0.7091709",
"0.7065016",
"0.69085413",
"0.6793126",
"0.6792232",
"0.6690881",
"0.6666064",
"0.66577286",
"0.6614039",
"0.65921766",
"0.6589444",
"0.655644... | 0.0 | -1 |
Read Exult text data for bodies. | private static void readBodiesTextDataFile(ShapeInfo info[],
DataUtils.IDReaderFunctor idReader, int game) {
final String sections[] = {"bodyshapes", "bodylist"};
final DataUtils.BaseReader readers[] = {
new DataUtils.FunctorMultidataReader(info,
new ShapeFlagsReader(is_body), null, idReader, false... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void parseRawText() {\n\t\t//1-new lines\n\t\t//2-pageObjects\n\t\t//3-sections\n\t\t//Clear any residual data.\n\t\tlinePositions.clear();\n\t\tsections.clear();\n\t\tpageObjects.clear();\n\t\tcategories.clear();\n\t\tinterwikis.clear();\n\t\t\n\t\t//Generate data.\n\t\tparsePageForNewLines();\n\t\tparseP... | [
"0.59200484",
"0.58721143",
"0.5770956",
"0.5625826",
"0.55821055",
"0.54813397",
"0.53969324",
"0.5340903",
"0.53205085",
"0.5296061",
"0.5296061",
"0.5296061",
"0.5296061",
"0.52666783",
"0.52576697",
"0.52371705",
"0.5217008",
"0.52140677",
"0.52089703",
"0.51995033",
"0.5... | 0.6568505 | 0 |
Read Exult text data for paperdolls. | private static void readPaperdollTextDataFile(ShapeInfo info[],
DataUtils.IDReaderFunctor idReader, int game) {
final String sections[] = {"characters", "items"};
final DataUtils.BaseReader readers[] = {
new DataUtils.FunctorMultidataReader(info,
new PaperdollNpc(), null, new PaperdollNpcIDReader()... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void main(String[] args) {\n try {\n readHouseTxt();\n } catch (ParseException e) {\n e.printStackTrace();\n }\n\n\n\n\n }",
"@Override\n public void readDataFromTxtFile()\n throws NumberFormatException, DepartmentC... | [
"0.59297705",
"0.58062327",
"0.55702835",
"0.55424494",
"0.5457696",
"0.544415",
"0.5330135",
"0.5324054",
"0.5291038",
"0.52549803",
"0.5250284",
"0.52223384",
"0.522064",
"0.52089983",
"0.5181811",
"0.5170439",
"0.5151528",
"0.5121888",
"0.51083326",
"0.5103856",
"0.5099181... | 0.6343441 | 0 |
Read in Exult text data. | private static void readShapeInfoTextDataFile(ShapeInfo info[],
DataUtils.IDReaderFunctor idReader, int game) {
final String sections[] = {
"explosions", "shape_sfx", "animation",
"usecode_events", "mountain_tops", "monster_food", "actor_flags",
"effective_hps", "lightweight_object", "warmth_data",
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public void readDataFromTxtFile()\n throws NumberFormatException, DepartmentCreationException, EmployeeCreationException {\n\n }",
"private void get_text() {\n InputStream inputStream = JsonUtil.class.getClassLoader().getResourceAsStream(\"data.txt\");\n BufferedReader ... | [
"0.6619347",
"0.65532106",
"0.6337849",
"0.6281336",
"0.61926925",
"0.61765426",
"0.59790903",
"0.5918158",
"0.5896291",
"0.58875805",
"0.58110505",
"0.5789645",
"0.5787994",
"0.5756723",
"0.572125",
"0.571157",
"0.5687471",
"0.56833816",
"0.56368065",
"0.562924",
"0.56135017... | 0.0 | -1 |
Sets the value of the Wizard object's key | public void setKey(int key); | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void setValue() {\r\n this.value = ComponentTranslator.getResourceBundle().getString(\r\n key.toString());\r\n }",
"public void setInitialKey(java.lang.String value) {\r\n\t\tBase.set(this.model, this.getResource(), INITIALKEY, value);\r\n\t}",
"void setKey(String key);",
"void setKey(java.... | [
"0.6283768",
"0.60117006",
"0.60026324",
"0.58662444",
"0.58282894",
"0.5820734",
"0.5798316",
"0.5788469",
"0.5776609",
"0.5776168",
"0.5764217",
"0.574146",
"0.5723928",
"0.5723928",
"0.5723928",
"0.5717245",
"0.5684729",
"0.56597465",
"0.5648239",
"0.56473124",
"0.5646547"... | 0.56474876 | 20 |
Locks the Wizard object's takeDamage method | public void lock(int key); | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n\tpublic void takeDamage(double damage) {\n\n\t}",
"public void takeDamage(int damage);",
"public void takeDamage(double damage){\n damage -= this.armor;\n this.health -= damage;\n }",
"public void takeDamage (double damage)\n {\n getComponent(HealthC.class).decrease(dam... | [
"0.65976024",
"0.651304",
"0.63097316",
"0.62298673",
"0.6200588",
"0.6190407",
"0.6142914",
"0.61268586",
"0.61026794",
"0.60656744",
"0.60271573",
"0.6016611",
"0.60131514",
"0.59824675",
"0.59543836",
"0.5946668",
"0.5945539",
"0.594338",
"0.59305996",
"0.5925282",
"0.5871... | 0.0 | -1 |
Unlocks the Wizard object's takeDamage method | public void unlock(int key); | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"void unlockDoor() {\n }",
"public abstract void unlock();",
"public void takeDamage (double damage)\n {\n getComponent(HealthC.class).decrease(damage);\n if (getComponent(HealthC.class).isDead())\n {\n setActive(false);\n }\n }",
"public void takeDamage(double ... | [
"0.6555479",
"0.6474246",
"0.6423045",
"0.6399857",
"0.6383134",
"0.6371408",
"0.6306352",
"0.6298745",
"0.62802184",
"0.62335956",
"0.62311393",
"0.622632",
"0.62093663",
"0.6179434",
"0.6119057",
"0.6114248",
"0.6074274",
"0.6068851",
"0.6033617",
"0.60115576",
"0.5957168",... | 0.53385264 | 79 |
Gets the lock status of the Wizard object | public boolean isLocked(); | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public long getLockStatus() {\r\n return lockStatus;\r\n }",
"public Integer getLockFlag() {\n return lockFlag;\n }",
"public Integer getLockFlag() {\n return lockFlag;\n }",
"public Integer getLockFlag() {\n return lockFlag;\n }",
"public boolean getLocked() {\n\t\t... | [
"0.74067235",
"0.673895",
"0.673895",
"0.673895",
"0.6645746",
"0.66396934",
"0.6545532",
"0.6532255",
"0.65202487",
"0.6508495",
"0.6507292",
"0.6481157",
"0.64656436",
"0.6459838",
"0.6455127",
"0.637813",
"0.6355597",
"0.63331586",
"0.63331586",
"0.62672937",
"0.62466335",... | 0.62445694 | 21 |
TODO Autogenerated method stub | public static void main(String[] args) {
BankAccount accOne = new BankAccount.Builder(1234L)
.withOwner("Person 1")
.atBranch("Branch 1")
.openingBalance(1234.0)
.atInterestRate(4.3)
.build();
BankAccount accTwo = new BankAccount.Builder(1256L)
.withOwner("Person 2")
.atB... | {
"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 |
Recupera todos los contactos del ContentProvider Contacts. | private List<Contact> getContactsList() {
List<Contact> contactsList = new ArrayList<>();
ContentResolver cr = getActivity().getContentResolver();
// Obtiene toda la informarciónd de los contactos
Cursor cursor = getActivity().getContentResolver().query(
ContactsContract.Contacts.CONTENT_URI, null, null,... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public List<Contact> getAllContacts();",
"@Override\n\tpublic List<Contact> getAllContacts() {\n\t\t\n\t\treturn repository.findAll();\n\t}",
"public ArrayList<Contact> getAllContacts(){\r\n\t\t\r\n\t\tArrayList<Contact> contacts = new ArrayList<Contact>();\r\n\t\tSQLiteDatabase db = this.getReadableDatabase()... | [
"0.7561245",
"0.73938495",
"0.72893167",
"0.71539676",
"0.7153375",
"0.7115745",
"0.7098653",
"0.7087454",
"0.70134974",
"0.6959015",
"0.6937929",
"0.6935485",
"0.6935088",
"0.69244117",
"0.69218767",
"0.6915378",
"0.6907375",
"0.68799645",
"0.68598187",
"0.68568146",
"0.6835... | 0.7326784 | 2 |
Utility method used to create the ComponentUI. | public static ComponentUI createUI(JComponent pComponent)
{
return new OSDarkLAFComboBoxUI();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void createUIComponents() {\n }",
"private void createUIComponents() {\n }",
"private void createUIComponents() {\n }",
"private void createUIComponents() {\n }",
"private void createUIComponents() {\n }",
"private void createUIComponents() {\n }",
"private void createUIComponen... | [
"0.79249716",
"0.7873889",
"0.7873889",
"0.7873889",
"0.7873889",
"0.7873889",
"0.7873889",
"0.7873889",
"0.7873889",
"0.7873889",
"0.7873889",
"0.7873889",
"0.7873889",
"0.7873889",
"0.7873889",
"0.7873889",
"0.7873889",
"0.7873889",
"0.7873889",
"0.7583897",
"0.7521149",
... | 0.725337 | 23 |
Creates a new button bound to the supplied combo box, initialized with the supplied icon. | public OSDarkLAFComboBoxButton(JComboBox<Object> comboBox, Icon ic, boolean editable, CellRendererPane renderPane, JList<Object> list)
{
super(comboBox, ic, editable, renderPane, list);
myEffectListener = new MouseRolloverEffectListener();
addMouseListener(myEffectListe... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public BenButton(Icon ico) {\n\t\tsuper(ico);\n\t\tsetVisible(true);\n\t}",
"public static JButton createDropDownButton( Icon icon, JPopupMenu dropDownMenu ) {\n return new DropDownButton( icon, dropDownMenu );\n }",
"public ToolButton createToolButton(Icon icon, Icon selectedIcon,\n ... | [
"0.63982433",
"0.6299599",
"0.6194981",
"0.6171433",
"0.61689997",
"0.6152815",
"0.6000819",
"0.59498537",
"0.58779955",
"0.5867038",
"0.585642",
"0.5829736",
"0.5800155",
"0.5792125",
"0.5759019",
"0.5747383",
"0.57352096",
"0.5688751",
"0.5680774",
"0.5678363",
"0.56710696"... | 0.5748969 | 15 |
Paints the button using icons. | protected void paintWithIcons(Graphics graph)
{
final boolean isLeftToRight = comboBox.getComponentOrientation().isLeftToRight();
if (ui != null)
{
final Graphics g = graph == null ? null : graph.create();
try
{
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void paintIcon(Component c, Graphics g, int x, int y)\r\n/* 164: */ {\r\n/* 165:198 */ Graphics2D g2 = (Graphics2D)g;\r\n/* 166:199 */ AbstractButton rb = (AbstractButton)c;\r\n/* 167:200 */ ButtonModel model = rb.getModel();\r\n/* 168:201 */ boolean paintFocus = ((model.isArm... | [
"0.7090718",
"0.70379",
"0.69086814",
"0.6876679",
"0.67045534",
"0.6580188",
"0.63733435",
"0.63695633",
"0.6266258",
"0.6254045",
"0.62441784",
"0.6237613",
"0.61986023",
"0.6196424",
"0.6178903",
"0.61715376",
"0.6162158",
"0.6151492",
"0.6141974",
"0.6132097",
"0.6129298"... | 0.5776083 | 49 |
Creates a new combo box editor. | public OSDarkLAFComboBoxEditor()
{
super();
editor.setBorder(OSDarkLAFBorders.getComboEditorBorder());
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static JComboBox createComboBox() {\n JComboBox comboBox = new JComboBox();\n initFormWidget(comboBox);\n comboBox.setBackground(Color.WHITE);\n return comboBox;\n }",
"private void initCombobox() {\n comboConstructeur = new ComboBox<>();\n comboConstructeur.se... | [
"0.7398025",
"0.67553586",
"0.6648251",
"0.6637498",
"0.6635039",
"0.6574598",
"0.65732783",
"0.64679444",
"0.641965",
"0.64160615",
"0.62910146",
"0.6285709",
"0.62720907",
"0.62174666",
"0.62037283",
"0.6203496",
"0.6197637",
"0.61933863",
"0.6181831",
"0.6115788",
"0.60952... | 0.6682101 | 2 |
Repaints the parent component. | protected void repaint()
{
if (null != comboBox && null != comboBox.getParent())
{
comboBox.getParent().repaint(comboBox.getX() - 5, comboBox.getY() - 5, comboBox.getWidth() + 10,
comboBox.getHeight() + 10);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void repaint() { if(_parent!=null) _parent.repaint(this); }",
"@Override\n\tpublic void repaint() {\n\t\tsuper.repaint();\n\t}",
"@Override\r\n\tpublic void repaint() {\n\t\tsuper.repaint();\r\n\t}",
"@Override\r\n\tpublic void repaint() {\n\t\tsuper.repaint();\r\n\t}",
"public void requestRedraw()... | [
"0.8384913",
"0.7426964",
"0.74193376",
"0.74193376",
"0.7398062",
"0.7148783",
"0.7041429",
"0.6783303",
"0.67821324",
"0.670341",
"0.66807085",
"0.6678503",
"0.6638089",
"0.655136",
"0.64938414",
"0.6484863",
"0.62522936",
"0.62275666",
"0.62230384",
"0.6217584",
"0.6187714... | 0.6814206 | 7 |
TODO Autogenerated method stub | protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {
doGet(request, response);
} | {
"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.66708666",
"0.65675074",
"0.65229905",
"0.6481001",
"0.64770633",
"0.64584893",
"0.6413091",
"0.63764185",
"0.6275735",
"0.62541914",
"0.6236919",
"0.6223816",
"0.62017626",
"0.61944294",
"0.61944294",
"0.61920846",
"0.61867654",
"0.6173323",
"0.61328775",
"0.61276996",
"0... | 0.0 | -1 |
Tarkistaa, onko kyseinen opiskelija tallennettu tietokantaan. | private boolean studentExists(int student) throws SQLException {
String sql = "SELECT * FROM student WHERE student_num ==?";
try (PreparedStatement ps = c.prepareStatement(sql)) {
ps.setInt(1, student);
ResultSet results = ps.executeQuery();
return results.next();
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void tallennaTiedostoon() {\n viitearkisto.tallenna();\n }",
"public void klikkaa(Tavarat tavarat, Klikattava klikattava);",
"void tampilKarakterA();",
"@Test\n public void yksiVasemmalle() {\n char[][] kartta = Labyrintti.lueLabyrintti(\"src/main/resources/labyrinttiTestiVasen.tx... | [
"0.78256035",
"0.70974296",
"0.6984758",
"0.6978232",
"0.6963671",
"0.67752457",
"0.67474353",
"0.6714032",
"0.6705565",
"0.664104",
"0.66322386",
"0.66291714",
"0.6605427",
"0.6578006",
"0.65357137",
"0.6467845",
"0.645312",
"0.64067173",
"0.6376284",
"0.6336188",
"0.6321931... | 0.0 | -1 |
Idea idea = ideaRepository.findById(ideaService.getIdeaById(idea)); Idea entity = ideaService.getIdeaById(ideaId.get()); note.setIdeaId(idea.getIdeaId()); | @PostMapping("/addnote")
private String saveNote(Note note, Idea idea) {
noteService.save(note);
// System.out.println(idea.getIdeaId());
return "notes";
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public ProjectIdea getProjectIdea(int id){\n //String sql = \"SELECT * FROM project_idea WHERE idea_id = ?\";\n try{\n ProjectIdea result = super.queryForId(id);\n return result;\n } catch(SQLException e){\n System.out.println(e.getMessage());\n }\n ... | [
"0.6473609",
"0.62556076",
"0.61396885",
"0.6100366",
"0.60669017",
"0.58851075",
"0.58632314",
"0.5849174",
"0.5828086",
"0.5807386",
"0.5803274",
"0.5791577",
"0.5784117",
"0.5772259",
"0.574717",
"0.5735107",
"0.57308686",
"0.57133585",
"0.5699137",
"0.56646603",
"0.566198... | 0.6421153 | 1 |
Write your solution here | public boolean canPermutePalindrome(String input) {
if (input == null) {
return false;
}
if (input.length() == 0) {
return true;
}
char[] temp = input.toCharArray();
// StringBuilder sol = new StringBuilder();
boolean[] result = new boolean... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void generateSolution() {\n\t\t// TODO\n\n\t}",
"public void solution() {\n\t\t\n\t}",
"public void findSolution() {\n\n\t\t// TODO\n\t}",
"public static String solution() {\r\n\t\treturn \"73162890\";\r\n\t}",
"public static void main(String[] args) {\n\t\tSystem.out.println(solution());\r\n\t}",
... | [
"0.75719035",
"0.74944717",
"0.6431267",
"0.6300665",
"0.6254568",
"0.61911374",
"0.60910475",
"0.6049933",
"0.60051423",
"0.6002172",
"0.5965524",
"0.5956326",
"0.5955198",
"0.59388304",
"0.5937435",
"0.5905292",
"0.5895413",
"0.5895027",
"0.58842075",
"0.58707607",
"0.58511... | 0.0 | -1 |
/ Re do following homework with pojo. Use Jackson annotations if needed. send a get request to student id 23401 as a path parameter and accept header application/json verify status code=200 /content type=c /ContentEncoding = gzip verify Date header exists assert that firstName Vera batch 14 section 12 | @Test
public void test1() {
Student student = given().accept(ContentType.JSON)
.pathParam("id", 23401)
.when()
.get("http://api.cybertektraining.com/student/{id}")
.then().statusCode(200)
.and().contentType("application/json;charset=UTF-8")
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Test(priority=2)\r\n\t\tpublic void getStudentIDSerialization() {\r\n\t\t\tgiven()\r\n\t\t\t\t.contentType(ContentType.JSON)\r\n\t\t\t.when()\r\n\t\t\t\t.get(\"http://localhost:8085/student/102\")\r\n\t\t\t.then()\r\n\t\t\t\t.statusCode(200)\r\n\t\t\t\t.assertThat()\r\n\t\t\t\t.body(\"id\",equalTo(\"102\"));\r\n\... | [
"0.7454808",
"0.70801973",
"0.7025775",
"0.6663219",
"0.6651668",
"0.6393794",
"0.6393348",
"0.63189346",
"0.6223356",
"0.62213266",
"0.61947834",
"0.6193018",
"0.6172275",
"0.611423",
"0.60561216",
"0.6049143",
"0.60199994",
"0.6015054",
"0.60032976",
"0.5973113",
"0.5967766... | 0.7523591 | 0 |
TODO fix this by removing offers using remove offers from wallet with user a odAdmin. | @Override
public boolean removeOffersForCard(OfferCard offerCard) {
getOfferOfferCardAssocDAO().removeOffersForCard(offerCard);
getOfferDAO().removeOffersForCard(offerCard);
return true;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public boolean onOptionsItemSelected(MenuItem item) {\n int id = item.getItemId();\n switch (item.getItemId()) {\n case R.id.action_edit:\n Intent in = new Intent(getContext(), addoffers.class);\n in.putExtra(\"object\", offer);\n ... | [
"0.57589865",
"0.5700408",
"0.54473567",
"0.5386098",
"0.5378324",
"0.52646005",
"0.52225846",
"0.5198829",
"0.51443106",
"0.51171523",
"0.5089586",
"0.50709003",
"0.50625753",
"0.50139695",
"0.500107",
"0.49127397",
"0.4900759",
"0.4899",
"0.48962036",
"0.4883647",
"0.486928... | 0.55177003 | 2 |
menggunakan notifyDataSetChanged() untuk memberitahu adapter bahwa ada perubahan pada data set | public void updateDataSet(ArrayList<BiddingResources> biddingPeringkatList)
{
this.biddingPeringkatList = biddingPeringkatList;
notifyDataSetChanged();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\r\n\tpublic void notifyDataSetChanged() {\n\t\tsuper.notifyDataSetChanged();\r\n\t\tLog.v(\"DEBUG\", \"CHANGE\");\r\n\t}",
"@Override\r\n public void onDataSetChanged() {\n }",
"public void onDataSetChanged();",
"public void notifyChanged() {\n notifyDataSetChanged(... | [
"0.8080663",
"0.7959745",
"0.7812742",
"0.7809355",
"0.7767204",
"0.7702397",
"0.75334877",
"0.7451612",
"0.7424184",
"0.7354019",
"0.7304636",
"0.7225377",
"0.72142154",
"0.71785086",
"0.7128823",
"0.69370776",
"0.693177",
"0.68663037",
"0.686332",
"0.68623734",
"0.6862018",... | 0.65678257 | 40 |
Dao for store operations | public interface StoreDao {
public List<Store> getStoreList();
public Store getStore(int idStore);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public interface StoreDao {\n /**\n * 判断shopId是否存在\n * @param id\n * @return boolean\n */\n boolean isStoreIdExists(String id);\n /**\n * 返回图片\n * @param clothId\n * @return User\n */\n String getStoreClothById(String clothId);\n}",
"public interface StorageDao {\n\n ... | [
"0.74416596",
"0.736505",
"0.71560204",
"0.7091581",
"0.70715845",
"0.69807416",
"0.6958995",
"0.6877637",
"0.6817975",
"0.6809105",
"0.67989737",
"0.67814857",
"0.6778931",
"0.6764195",
"0.676205",
"0.6745783",
"0.67441523",
"0.6739828",
"0.6735139",
"0.6718891",
"0.6715551"... | 0.7816724 | 0 |
Created by MK on 2017/12/28. | public interface SongView {
public void success(SongBean bean);
public void failure(String mes);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public void perish() {\n \n }",
"private stendhal() {\n\t}",
"@Override\n\tpublic void grabar() {\n\t\t\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void init() {\n\n }",
"@Override\r\n\tpublic void tires() {\n\t\t\r\n\t}",
"@Override\r\n\tpubli... | [
"0.58660865",
"0.57925415",
"0.568185",
"0.56081504",
"0.55686617",
"0.55668753",
"0.5536767",
"0.5536767",
"0.5526079",
"0.5490722",
"0.548831",
"0.54738146",
"0.5473413",
"0.5469466",
"0.54694015",
"0.5464072",
"0.5464072",
"0.5464072",
"0.5464072",
"0.5464072",
"0.5464072"... | 0.0 | -1 |
Generates three random numbers that correspond to the combination needed to unlock the combination lock. Sets the global array (current_combination) to the randomly selected values for use throughout the app. Sets the current_combination_label to display the current combination | private void generateRandomCombination() {
Random num_generator = new Random();
//First combo number should not be in range -5 to 5.
int temp_combo_one;
do {
temp_combo_one = num_generator.nextInt(40);
} while (temp_combo_one >= -5 && temp_combo_one <= 5);
/... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private int getCurrentCombo() {\n\n int current_combo = 0;\n\n //Configure first combination number\n //Gyroscope gives negative readings when the phone is rotated CW\n //Make current combo negative to force user to spin CW\n if (correct_count == 0) {\n current_combo =... | [
"0.6025602",
"0.584042",
"0.5538009",
"0.5491653",
"0.51289207",
"0.5083914",
"0.5058864",
"0.49856606",
"0.49850357",
"0.49470034",
"0.48834845",
"0.4876508",
"0.48633346",
"0.4831841",
"0.48314524",
"0.48271385",
"0.48221445",
"0.47970575",
"0.47724518",
"0.4771392",
"0.476... | 0.764869 | 0 |
Returns the necessary number of degrees that the user must spin the phone to land on a combination number. | private int getCurrentCombo() {
int current_combo = 0;
//Configure first combination number
//Gyroscope gives negative readings when the phone is rotated CW
//Make current combo negative to force user to spin CW
if (correct_count == 0) {
current_combo = -(current_co... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private int degreeFromCoefficients(int numOfCoefficients) {\n return (int) (0.5*(-1 + (int)(Math.sqrt(1+8*numOfCoefficients))))-1;\n }",
"double getDegreesCoolingPerMBPerK();",
"int getStartRotationDegree();",
"int getDegree();",
"int getDegree();",
"public static int getDegree(){\r\n in... | [
"0.5820625",
"0.554992",
"0.55319816",
"0.55273086",
"0.55273086",
"0.5477329",
"0.53891665",
"0.52498144",
"0.52394205",
"0.5201028",
"0.5184053",
"0.5115364",
"0.50494176",
"0.5049251",
"0.5033181",
"0.50169015",
"0.49917927",
"0.498692",
"0.49708483",
"0.4969068",
"0.49587... | 0.6654472 | 0 |
Set arrow to initial orientation. Arrow will be pointing to the right. | private void resetArrow() {
arrow.setRotation(0);
arrow.setScaleX(1);
arrow.setRotation(-45);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void flipArrow() {\n arrow.setRotation(0);\n arrow.setScaleX(-1);\n arrow.setRotation(50);\n }",
"public void resetAngle() {\n\t\t//this.angle = (this.orientation % 4 + 4) * (90);\n\t\tthis.angle = this.orientation * 90*-1;\n\t\tthis.tweenAngle.setCurrentValue(this.angle);\n\t\tth... | [
"0.65378094",
"0.63114434",
"0.6277968",
"0.6205387",
"0.615024",
"0.61228365",
"0.60894734",
"0.6018887",
"0.5995302",
"0.59704804",
"0.59334314",
"0.5866341",
"0.5845411",
"0.58390003",
"0.5832477",
"0.5790656",
"0.5772084",
"0.5765276",
"0.5739983",
"0.57321507",
"0.572514... | 0.75534534 | 0 |
Flip the arrow from the original orientation. Arrow will be pointing to the left. | private void flipArrow() {
arrow.setRotation(0);
arrow.setScaleX(-1);
arrow.setRotation(50);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void flip()\r\n\t{\r\n\t\tif(heading == Direction.WEST)\r\n\t\t{\r\n\t\t\tsetDirection(Direction.EAST);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tsetDirection(Direction.WEST);\r\n\t\t}\r\n\t}",
"private void resetArrow() {\n arrow.setRotation(0);\n arrow.setScaleX(1);\n arrow.setRotatio... | [
"0.70145285",
"0.68558496",
"0.68341154",
"0.6668473",
"0.6601033",
"0.6535242",
"0.64761984",
"0.64464206",
"0.64117277",
"0.6402971",
"0.63353723",
"0.62906027",
"0.6203962",
"0.6194287",
"0.6117039",
"0.60933715",
"0.60907745",
"0.6084566",
"0.6079471",
"0.6075171",
"0.604... | 0.8097008 | 0 |
Return meta information about a document. Can be called after find document methods call Consider the use of ResourceList instead. | LinksInformation getLinksInformation(Iterable<T> resources, QueryParams queryParams); | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public edu.ustb.sei.mde.morel.resource.morel.IMorelMetaInformation getMetaInformation();",
"@Override\n public RavenJObject getMetadata() {\n return metadata;\n }",
"Metadata getMetaData();",
"public ResourceContent getMetadata() throws IOException;",
"@Override\n\tpublic DocumentWithMeta getSysDocume... | [
"0.6690508",
"0.6411975",
"0.63658416",
"0.6282427",
"0.6220282",
"0.62068003",
"0.6163792",
"0.61573386",
"0.61358225",
"0.61230934",
"0.60849106",
"0.60799605",
"0.60405236",
"0.60380924",
"0.60235256",
"0.60235256",
"0.60235256",
"0.60235256",
"0.60235256",
"0.6007346",
"0... | 0.0 | -1 |
Creates new form NodeInfoInternalFrame FIXME change way of transfer IConfigurerPrx | public NodePropertiesInternalFrame(Map<String, String> _info, String _nodeName, IConfigurerPrx _config) {
initComponents();
this.setClosable(true);
this.setTitle(_nodeName + " - properties");
initInfo(_info);
config = _config;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private Node createFrameHolder(Data<X,Y> dataItem){\n Node frameHolder = dataItem.getNode();\n if (frameHolder == null){\n frameHolder = new StackPane();\n dataItem.setNode(frameHolder);\n }\n frameHolder.getStyleClass().add(getStyleClass(dataItem.getExtraValue()))... | [
"0.58630425",
"0.5482073",
"0.52583665",
"0.5234179",
"0.52043575",
"0.51817983",
"0.51681066",
"0.5164251",
"0.513464",
"0.5127828",
"0.5114953",
"0.5081794",
"0.5079927",
"0.5046918",
"0.504621",
"0.503386",
"0.50304216",
"0.50265616",
"0.5011709",
"0.49655667",
"0.49547952... | 0.6633878 | 0 |
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() {
btnCloseProperties = new javax.swing.JButton();
jTabbedPane1 = new javax.swing.JTabbedPane();
jPanel1 = new javax.swing.JPanel();
... | {
"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.73192346",
"0.7290526",
"0.7290526",
"0.7290526",
"0.7285891",
"0.72480357",
"0.7213616",
"0.7207808",
"0.71955067",
"0.71891475",
"0.71844363",
"0.7159038",
"0.71474695",
"0.7092269",
"0.7079923",
"0.70560205",
"0.69864315",
"0.697697",
"0.69552195",
"0.6953691",
"0.69458... | 0.0 | -1 |
End of variables declaration//GENEND:variables | private void initInfo(Map<String, String> _info) {
this.jlCPU.setText(_info.get("Model"));// FIXME may be very long name
this.jlCores.setText(_info.get("TotalCores"));
this.jlVendor.setText(_info.get("Vendor"));
this.jlFrequency.setText(_info.get("Mhz") + " MHz");
this.jlRAM.setT... | {
"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}",
"public void mo217... | [
"0.63617",
"0.6280625",
"0.61909467",
"0.6095729",
"0.6092663",
"0.607037",
"0.60523474",
"0.605212",
"0.6002499",
"0.59878224",
"0.5970378",
"0.59679425",
"0.5967425",
"0.5965642",
"0.596177",
"0.5942055",
"0.5908757",
"0.589693",
"0.589137",
"0.5882839",
"0.58795726",
"0.... | 0.0 | -1 |
Remember, skins can be created at runtime so we don't want to override any that a user might have already put into the factory. | public static void setupDialogSkinsDefaults()
{
if(! dialogSkins.containsKey("default"))
addDialogSkin("default", new StandardDialogSkin());
if(! dialogSkins.containsKey("hand-held"))
addDialogSkin("hand-held", new HandHeldDialogSkin());
haveDialogSkinsDefaults = true;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"protected void initSkins()\n {\n synchronized (this)\n {\n _skins = new HashMap<SkinMetadata, Skin>();\n }\n }",
"Sku sku();",
"public Sku() {\n\t}",
"interface WithSku {\n /**\n * Specifies the sku property: The resource model definition representing SKU.\n ... | [
"0.6560729",
"0.59525037",
"0.5697428",
"0.56894857",
"0.56832665",
"0.56785303",
"0.5672331",
"0.5639644",
"0.5598695",
"0.55461526",
"0.5530313",
"0.5520928",
"0.54962385",
"0.53744704",
"0.5369531",
"0.53298783",
"0.53007144",
"0.52367824",
"0.51968426",
"0.5174694",
"0.51... | 0.5002395 | 35 |
GET ID DE CONTACTS | public int getContactIdByEmail(String email) {
HttpGet request = new HttpGet(QueryId(email));
credential(request);
try {
String jsonResponse = connectionHttp.ConnectionResponse(request);
ObjectMapper om = new ObjectMapper();
JsonNode nodes = om.readTree(jsonResponse... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public String getAllContactId() {\n return getContact().getUid();\n }",
"@Override\r\n\tpublic Integer getId() {\n\t\treturn this.codContacto;\r\n\t}",
"public String getIdContacto() {\r\n\t\treturn idContacto;\r\n\t}",
"public int getContactID() {\r\n return contactID;\r\n }",
"public int ge... | [
"0.68381184",
"0.66474414",
"0.6480509",
"0.64386976",
"0.64024127",
"0.6354994",
"0.6218593",
"0.62052983",
"0.6163498",
"0.61597747",
"0.61249536",
"0.61150855",
"0.61128074",
"0.6083756",
"0.6066356",
"0.60175073",
"0.59986794",
"0.5975664",
"0.5955927",
"0.595124",
"0.585... | 0.0 | -1 |
void editNewsTitle(String id,String title); void editNewsContent(String id,String content); void editNewsAttactLink(String id,String attactLink); void editNews(String id,String title,String content,String attactLink); | void deleleNews(String id); | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\r\n\tpublic void updateNewsById(News aNews) {\n\t\tConnection conn = null;\r\n\t\tPreparedStatement pstmt = null;\r\n\t\ttry {\r\n\t\t\t\r\n\t\t\tString sql = \"update news set title=?, content=?, fk_topic_id=? where id = ?\";\r\n\t\t\tconn = SimpleDBUtil.getConnection();\r\n\t\t\tpstmt = conn.prepareSta... | [
"0.7172001",
"0.6625491",
"0.65230405",
"0.6317043",
"0.62922114",
"0.626683",
"0.61836743",
"0.61615455",
"0.6155554",
"0.6054691",
"0.60504353",
"0.60294807",
"0.6021158",
"0.6010034",
"0.6000058",
"0.59950167",
"0.59885967",
"0.58665305",
"0.5842",
"0.5826985",
"0.5802678"... | 0.5745301 | 25 |
reqid is the id used when subscribing | public Message newCancelMarketStreamRequest(String reqID , List<Instrument> symbols) {
log.info("newCxlMarketStreamRequest called");
MarketDataRequest request = new MarketDataRequest();
request.setField(new MDReqID(reqID));
request.setField(new SubscriptionRequestType(SubscriptionReques... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"void subscribe(String id);",
"@Override\n\tpublic void onRequestStart(String reqId) {\n\t\t\n\t}",
"java.lang.String getRequestID();",
"public String getIdrequest() {\r\n\t\treturn idrequest;\r\n\t}",
"private void requestServerId() {\n connection.startClient(lbInfo.getIp(), lbInfo.getPort());\n ... | [
"0.6445259",
"0.6292163",
"0.6056656",
"0.58552426",
"0.5828017",
"0.5802748",
"0.57969505",
"0.57875615",
"0.5771764",
"0.571784",
"0.56848586",
"0.56558776",
"0.56484985",
"0.56299543",
"0.561513",
"0.5568559",
"0.5510396",
"0.5510226",
"0.5457249",
"0.54437727",
"0.5443447... | 0.0 | -1 |
The Package for the model. It contains accessors for the meta objects to represent each class, each feature of each class, each operation of each class, each enum, and each data type | public interface NeoEpsilonPackage extends EPackage {
/**
* The package name.
* <!-- begin-user-doc -->
* <!-- end-user-doc -->
* @generated
*/
String eNAME = "NeoEpsilon";
/**
* The package namespace URI.
* <!-- begin-user-doc -->
* <!-- end-user-doc -->
* @generated
*/
String eNS_URI = "http:... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"IoT_metamodelPackage getIoT_metamodelPackage();",
"public void createPackageContents()\n {\n if (isCreated) return;\n isCreated = true;\n\n // Create classes and their features\n modelEClass = createEClass(MODEL);\n createEReference(modelEClass, MODEL__AGENT);\n\n agentEClass = createEClass(AG... | [
"0.6440476",
"0.61842614",
"0.61518157",
"0.6078748",
"0.6047495",
"0.6046447",
"0.60233986",
"0.6010338",
"0.6009404",
"0.6009124",
"0.5993905",
"0.5986726",
"0.5985098",
"0.5983781",
"0.596943",
"0.5965927",
"0.5953665",
"0.5951791",
"0.59491247",
"0.5941394",
"0.5933421",
... | 0.0 | -1 |
Returns the factory that creates the instances of the model. | NeoEpsilonFactory getNeoEpsilonFactory(); | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"ModelsFactory getModelsFactory();",
"public ObjectifyFactory factory() {\n return ofy().factory();\n }",
"TestModelFactory getTestModelFactory();",
"BehaviouralModelFactory getBehaviouralModelFactory();",
"public static Factory factory() {\n return ext_dbf::new;\n }",
"public ValueFactory<K... | [
"0.7365279",
"0.7147646",
"0.7042554",
"0.66732574",
"0.66433585",
"0.6542524",
"0.6426967",
"0.6378293",
"0.63225335",
"0.62815636",
"0.6185782",
"0.61756575",
"0.6168043",
"0.6150566",
"0.61496305",
"0.61323225",
"0.6131665",
"0.6126879",
"0.61266255",
"0.6124763",
"0.61157... | 0.0 | -1 |
Defines literals for the meta objects that represent each class, each feature of each class, each operation of each class, each enum, and each data type | interface Literals {
/**
* The meta object literal for the '{@link NeoEpsilon.impl.ShelfImpl <em>Shelf</em>}' class.
* <!-- begin-user-doc -->
* <!-- end-user-doc -->
* @see NeoEpsilon.impl.ShelfImpl
* @see NeoEpsilon.impl.NeoEpsilonPackageImpl#getShelf()
* @generated
*/
EClass SHELF = eINSTANC... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void generateCoreTypes() {\n\t\tvoidDt = new VoidDataType(progDataTypes);\n\t\tArrayList<TypeMap> typeList = new ArrayList<>();\n\t\ttypeList.add(new TypeMap(DataType.DEFAULT, \"undefined\", \"unknown\", false, false));\n\n\t\tfor (DataType dt : Undefined.getUndefinedDataTypes()) {\n\t\t\ttypeList.add(new ... | [
"0.5967662",
"0.59546417",
"0.5850874",
"0.5848948",
"0.5812678",
"0.57160336",
"0.57074887",
"0.5677265",
"0.55510944",
"0.5546431",
"0.55364335",
"0.55305713",
"0.5517766",
"0.5500278",
"0.54963756",
"0.54699326",
"0.54664516",
"0.5455503",
"0.5453679",
"0.54526377",
"0.543... | 0.5331572 | 30 |
Tiempo de caducidad del objeto despues de haberlo comprado EN DIAS | @Range(min = 0)
@NotNull
public Integer getExpiration() {
return this.expiration;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public cola_de_un_banco(){// se crea nuestro metodo costructor \r\n primero=null;//se crea el tipo de indicaciones con valor... | [
"0.6330798",
"0.6290751",
"0.6120632",
"0.6102813",
"0.59905875",
"0.5899692",
"0.58941495",
"0.5882718",
"0.5881507",
"0.58788687",
"0.5874168",
"0.5844634",
"0.5804361",
"0.5781086",
"0.57708955",
"0.5767902",
"0.5757928",
"0.5720149",
"0.5717141",
"0.5703879",
"0.56997347"... | 0.0 | -1 |
Es usado por si un objeto se quiere dejar de vender para borrarlo una vez no lo este usando ningun jugador | public boolean getOnSell() {
return this.onSell;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void borrarZonaObjetivoAtaque() {\n\t\t\n\t}",
"public void borrarZonaObjetivoMovimiento() {\n\t\t\n\t}",
"public boolean remover(Veterinario obj) throws ClassNotFoundException, SQLException{\n VeterinarioDAO dao = new VeterinarioDAO();\n return dao.remover(obj);\n }",
"public void el... | [
"0.73825985",
"0.7143902",
"0.70206326",
"0.7013128",
"0.6979177",
"0.6872783",
"0.6826755",
"0.68099904",
"0.679496",
"0.67907566",
"0.6733354",
"0.6685408",
"0.6624211",
"0.6622935",
"0.66140133",
"0.6575705",
"0.6553398",
"0.6528083",
"0.65223753",
"0.65150696",
"0.6497431... | 0.0 | -1 |
/ access modifiers changed from: protected | public void onNewResultImpl(@Nullable EncodedImage encodedImage, int i) {
if (!this.mIsCancelled) {
boolean isLast = isLast(i);
if (encodedImage == null) {
if (isLast) {
getConsumer().onNewResult(null, 1);
}
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n protected void prot() {\n }",
"private stendhal() {\n\t}",
"@Override\n\tpublic void grabar() {\n\t\t\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"@Override... | [
"0.7375736",
"0.7042321",
"0.6922649",
"0.6909494",
"0.68470824",
"0.6830288",
"0.68062353",
"0.6583185",
"0.6539446",
"0.65011257",
"0.64917654",
"0.64917654",
"0.64733833",
"0.6438831",
"0.64330196",
"0.64330196",
"0.64295477",
"0.6426414",
"0.6420484",
"0.64083177",
"0.640... | 0.0 | -1 |
/ access modifiers changed from: private | public static TriState shouldTransform(ImageRequest imageRequest, EncodedImage encodedImage, boolean z) {
if (encodedImage == null || encodedImage.getImageFormat() == ImageFormat.UNKNOWN) {
return TriState.UNSET;
}
if (encodedImage.getImageFormat() != DefaultImageFormats.JPEG) {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private stendhal() {\n\t}",
"@Override\n protected void prot() {\n }",
"private Rekenhulp()\n\t{\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override\n\tpublic void grabar() {\n\t\t\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void func_104... | [
"0.70451087",
"0.66481936",
"0.66338545",
"0.6534467",
"0.6533057",
"0.63756114",
"0.6368523",
"0.63063055",
"0.6244554",
"0.62261415",
"0.62046665",
"0.61776316",
"0.6142759",
"0.6131381",
"0.6131381",
"0.61274433",
"0.610919",
"0.610797",
"0.60792845",
"0.6062989",
"0.60593... | 0.0 | -1 |
/ access modifiers changed from: private | public static int getSoftwareNumerator(ImageRequest imageRequest, EncodedImage encodedImage, boolean z) {
int i;
int i2;
if (!z) {
return 8;
}
ResizeOptions resizeOptions = imageRequest.getResizeOptions();
if (resizeOptions == null) {
return 8;
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private stendhal() {\n\t}",
"@Override\n protected void prot() {\n }",
"private Rekenhulp()\n\t{\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override\n\tpublic void grabar() {\n\t\t\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void func_104... | [
"0.7044735",
"0.66479045",
"0.6633232",
"0.65343255",
"0.65324754",
"0.63757193",
"0.6367789",
"0.63065237",
"0.6244171",
"0.622592",
"0.62049985",
"0.61766696",
"0.614237",
"0.6130815",
"0.6130815",
"0.6127483",
"0.6108821",
"0.61083317",
"0.607937",
"0.60626495",
"0.6058102... | 0.0 | -1 |
/ access modifiers changed from: private | public static int getRotationAngle(RotationOptions rotationOptions, EncodedImage encodedImage) {
if (!rotationOptions.rotationEnabled()) {
return 0;
}
int extractOrientationFromMetadata = extractOrientationFromMetadata(encodedImage);
if (rotationOptions.useImageMetadata()) {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private stendhal() {\n\t}",
"@Override\n protected void prot() {\n }",
"private Rekenhulp()\n\t{\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override\n\tpublic void grabar() {\n\t\t\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void func_104... | [
"0.70451087",
"0.66481936",
"0.66338545",
"0.6534467",
"0.6533057",
"0.63756114",
"0.6368523",
"0.63063055",
"0.6244554",
"0.62261415",
"0.62046665",
"0.61776316",
"0.6142759",
"0.6131381",
"0.6131381",
"0.61274433",
"0.610919",
"0.610797",
"0.60792845",
"0.6062989",
"0.60593... | 0.0 | -1 |
/ access modifiers changed from: private | public static int getForceRotatedInvertedExifOrientation(RotationOptions rotationOptions, EncodedImage encodedImage) {
int indexOf = INVERTED_EXIF_ORIENTATIONS.indexOf(Integer.valueOf(encodedImage.getExifOrientation()));
if (indexOf >= 0) {
int i = 0;
if (!rotationOptions.useImag... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private stendhal() {\n\t}",
"@Override\n protected void prot() {\n }",
"private Rekenhulp()\n\t{\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override\n\tpublic void grabar() {\n\t\t\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void func_104... | [
"0.70451087",
"0.66481936",
"0.66338545",
"0.6534467",
"0.6533057",
"0.63756114",
"0.6368523",
"0.63063055",
"0.6244554",
"0.62261415",
"0.62046665",
"0.61776316",
"0.6142759",
"0.6131381",
"0.6131381",
"0.61274433",
"0.610919",
"0.610797",
"0.60792845",
"0.6062989",
"0.60593... | 0.0 | -1 |
Get the test result, as if the mutant is alive or not | @Override
public boolean getTest(int testCase, int testReq) {
Object expected;
try {
expected = testingMethod.invoke(oracle, parameters[testCase]);
} catch (IllegalAccessException | IllegalArgumentException | InvocationTargetException ex) {
//TODO
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public boolean getResult() {\r\n\treturn result;\r\n }",
"public CrashTestStatus.TestResult testResult() {\n try {\n final Duration testTimeout = mDuration.plus(MAX_TEST_DELAY_BEFORE_HANG);\n boolean completed =\n mTestStatus.waitForCompletion(testTimeout.toMillis(), TimeUnit.MILLISE... | [
"0.6194428",
"0.6061565",
"0.60271883",
"0.60271883",
"0.60271883",
"0.60244215",
"0.6013242",
"0.59943694",
"0.59943694",
"0.59943694",
"0.59943694",
"0.59943694",
"0.59943694",
"0.59943694",
"0.59943694",
"0.59943694",
"0.59943694",
"0.59943694",
"0.59943694",
"0.59728086",
... | 0.0 | -1 |
Quantity of test cases | @Override
public int getTestCaseTotal() {
return parameters.length;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private int getTotalTestCase() {\n\t\treturn passedtests.size() + failedtests.size() + skippedtests.size();\n\t}",
"public int countTestCases() {\n return 1;\n }",
"@Override\n public int countTestCases()\n {\n return 1;//_testCaseCount;\n }",
"@BeforeSuite\n\tpublic void numofTestC... | [
"0.8127178",
"0.7690387",
"0.767373",
"0.73459023",
"0.71904665",
"0.6965162",
"0.67968386",
"0.6713906",
"0.6672379",
"0.6655219",
"0.6655219",
"0.6654489",
"0.66299933",
"0.6623119",
"0.66224",
"0.6600818",
"0.65775824",
"0.65370494",
"0.65071",
"0.64955324",
"0.6459901",
... | 0.6903725 | 6 |
Quantity of requirements in the mutants | @Override
public int getRequirementTotal() {
return mutants.length;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public int getNumMutants() {\n\t\tint count = 0;\n\t\tfor (Bacteria ind : this.inds) {\n\t\t\tif (ind.hasMutator()) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t\treturn count;\n\t}",
"public int getQuantityRequired(){\n return quantityRequired1;\n }",
"public double totalQuantity() {\r\n\t\tdouble t = 0;\... | [
"0.6242897",
"0.61366355",
"0.6039102",
"0.603605",
"0.59939146",
"0.5971893",
"0.59399664",
"0.5939677",
"0.5937302",
"0.5937302",
"0.59253454",
"0.587897",
"0.5873418",
"0.5870315",
"0.5833592",
"0.5833224",
"0.581285",
"0.57948786",
"0.57901907",
"0.57815176",
"0.57711345"... | 0.8178091 | 0 |
Cancel the task after performing necessary functions | public void cancelTask(){
if(main.teleporting.containsKey(teleporter.getName())){
main.teleporting.remove(teleporter.getName());
}
this.cancel();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public synchronized void cancel() {\n }",
"public void cancel();",
"public void cancel();",
"public void cancel();",
"public void cancel();",
"public void cancel();",
"public void cancel();",
"void cancel();",
"void cancel();",
"void cancel();",
"void cancel();",
"void cancel();",
"p... | [
"0.7725736",
"0.76723635",
"0.76723635",
"0.76723635",
"0.76723635",
"0.76723635",
"0.76723635",
"0.7632109",
"0.7632109",
"0.7632109",
"0.7632109",
"0.7632109",
"0.76144403",
"0.75208795",
"0.74570787",
"0.7427249",
"0.74024206",
"0.7388433",
"0.738745",
"0.7378789",
"0.7368... | 0.72661066 | 34 |
Get the player who is teleporting | public Player getTeleporter(){
return teleporter;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Player getToTeleportTo(){\n\t\treturn toTeleportTo;\n\t}",
"public Player getPlayer() {\r\n return world.getPlayer();\r\n }",
"public Player getToPlayer()\n {\n // RETURN the CardMessage's toPlayer\n return this.toPlayer;\n }",
"private static Player getThroughWhomSendMes... | [
"0.78534853",
"0.72453636",
"0.68095464",
"0.67642283",
"0.6744623",
"0.66897464",
"0.66897464",
"0.66294837",
"0.6614613",
"0.65715855",
"0.65670705",
"0.6538905",
"0.653809",
"0.65298927",
"0.65214485",
"0.6517485",
"0.6517485",
"0.65155655",
"0.65105724",
"0.6492011",
"0.6... | 0.79930454 | 0 |
Get the player who is getting teleported to | public Player getToTeleportTo(){
return toTeleportTo;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Player getTeleporter(){\n\t\treturn teleporter;\n\t}",
"public Player getPlayer() {\r\n return world.getPlayer();\r\n }",
"public Player getToPlayer()\n {\n // RETURN the CardMessage's toPlayer\n return this.toPlayer;\n }",
"private static Player getThroughWhomSendMessage... | [
"0.79146725",
"0.74310756",
"0.7100344",
"0.69669443",
"0.6866757",
"0.6816406",
"0.6816406",
"0.6802785",
"0.67907697",
"0.67886347",
"0.67777467",
"0.6776557",
"0.6744223",
"0.67229766",
"0.6710063",
"0.6708276",
"0.66842157",
"0.6665995",
"0.66657436",
"0.66657436",
"0.665... | 0.7807819 | 1 |
/ Test only the persistence of the NoDupPersistencePriorityQueue implementation | public static void testPersistence()throws Exception {
Queue queue = new InMemoryQueue();
// queue.init("com.mysql.jdbc.Driver",
// "jdbc:mysql://127.0.0.1/queue?user=root",
// "jdbc:mysql://127.0.0.1/mysql?user=root", "queue",
// true);
for (int i = 0; i < 1; i++){
queue.clear();
System.out.printl... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Test\n public void testAdd() throws Exception {\n this.queue = new HeapPriorityQueue<Person>(5); \n this.queue.add(new Person(\"Four\"), 4);\n this.queue.add(new Person(\"Five\"), 5);\n boolean actualResult = this.queue.isEmpty();\n \n boolean expectedResult = false; ... | [
"0.6358659",
"0.6165168",
"0.589144",
"0.5868712",
"0.5811212",
"0.5807312",
"0.5801717",
"0.5768661",
"0.5762837",
"0.575709",
"0.56402034",
"0.5635015",
"0.5606637",
"0.5590245",
"0.55741763",
"0.5549371",
"0.5538752",
"0.5530597",
"0.553048",
"0.55119234",
"0.5511432",
"... | 0.5871543 | 3 |
/ Test only the persistence of the NoDupPersistencePriorityQueue implementation | public static void testPersistenceAndPriority() {
Map l = new TreeMap();
l.put("http://www.google.it/", new Double(1.1));
l.put("http://www.federicovigna.it/", new Double(1.4));
l.put("http://localhost/php/cliniquefitness/", new Double(1.1));
l.put("http://www.yahoo.it/", new Double(0.9));
/*
Downloader d... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Test\n public void testAdd() throws Exception {\n this.queue = new HeapPriorityQueue<Person>(5); \n this.queue.add(new Person(\"Four\"), 4);\n this.queue.add(new Person(\"Five\"), 5);\n boolean actualResult = this.queue.isEmpty();\n \n boolean expectedResult = false; ... | [
"0.6358659",
"0.589144",
"0.5871543",
"0.5868712",
"0.5811212",
"0.5807312",
"0.5801717",
"0.5768661",
"0.5762837",
"0.575709",
"0.56402034",
"0.5635015",
"0.5606637",
"0.5590245",
"0.55741763",
"0.5549371",
"0.5538752",
"0.5530597",
"0.553048",
"0.55119234",
"0.5511432",
"... | 0.6165168 | 1 |
/ Test the Resource implementation in a Temp file | public static void testResourceFile() {
ArrayList l = new ArrayList();
l.add("http://www.google.it");
l.add("http://www.microsoft.com");
/*
Downloader d = new Downloader(1);
logger
.log(
Level.INFO,
"TEST ResourceFile implementation. Url downloaded will be temporary saved to system temp direc... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"protected abstract T createTestResource();",
"public static File CreateTempFile(String fileName, String resourcePath) throws IOException {\n \n /*if (tempDirectoryPath == null) {\n tempDirectoryPath = Files.createTempDirectory(null);\n System.getSecurityManager().checkDelete(t... | [
"0.6975735",
"0.6615205",
"0.64293355",
"0.642715",
"0.61250454",
"0.6123537",
"0.60169667",
"0.6002969",
"0.5826515",
"0.58167124",
"0.5787355",
"0.57686865",
"0.5762641",
"0.5748557",
"0.5748214",
"0.57400346",
"0.5670702",
"0.56673306",
"0.5663522",
"0.56507",
"0.56465876"... | 0.66020495 | 2 |
Configure ViewResolvers to deliver preferred views. | @Override
public void configureViewResolvers(ViewResolverRegistry registry) {
TilesViewResolver viewResolver = new TilesViewResolver();
registry.viewResolver(viewResolver);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"void setViewResolver(ViewResolver resolver);",
"@Override\n public void configureViewResolvers(ViewResolverRegistry registry) {\n ThymeleafViewResolver resolver = new ThymeleafViewResolver();\n resolver.setTemplateEngine(templateEngine());\n registry.viewResolver(resolver);\n }",
"@B... | [
"0.6659435",
"0.632472",
"0.61493903",
"0.60108876",
"0.5929191",
"0.58932424",
"0.5885693",
"0.58820164",
"0.57568777",
"0.5749839",
"0.5736996",
"0.571589",
"0.5578897",
"0.54533124",
"0.5431441",
"0.5411929",
"0.5375739",
"0.52904373",
"0.5262009",
"0.5246829",
"0.5212155"... | 0.6618856 | 1 |
We only wanna post what table the customer is going to be using at the resturang. | public Dinnertable(int dinnertableid){
this.dinnertableid = dinnertableid;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\r\n\tprotected String getTable() {\n\t\treturn TABLE;\r\n\t}",
"public String getTable()\n {\n return table;\n }",
"public String getTable() {\r\n \t\treturn \"reservation\";\r\n \t}",
"@Override\n\tpublic void getFields(List<String> table) {\n\t\t\n\t}",
"public String getTable()... | [
"0.61441964",
"0.5881328",
"0.58266276",
"0.5749459",
"0.5641072",
"0.5539925",
"0.5513948",
"0.5489055",
"0.5488188",
"0.54854447",
"0.5476948",
"0.5462819",
"0.5416044",
"0.54147625",
"0.5413758",
"0.54134357",
"0.5411358",
"0.5389798",
"0.53773093",
"0.5361823",
"0.5360804... | 0.0 | -1 |
Get list of customers | public List<CustomerModel> readDatabase() throws Exception{
List<CustomerModel> list = new ArrayList<CustomerModel>();
try{
log.info("Loading MySql driver");
Class.forName("com.mysql.jdbc.Driver");
log.info("Setting up connection with db");
connect= DriverManager.getConnection("jdbc:mysql://localhost:3306/apidft","r... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@RequestMapping(value = \"/v2/customers\", method = RequestMethod.GET)\r\n\tpublic List<Customer> customers() {\r\n JPAQuery<?> query = new JPAQuery<Void>(em);\r\n QCustomer qcustomer = QCustomer.customer;\r\n List<Customer> customers = (List<Customer>) query.from(qcustomer).fetch();\r\n ... | [
"0.86592007",
"0.858046",
"0.8475807",
"0.84252495",
"0.83957046",
"0.8250507",
"0.81755584",
"0.81558037",
"0.8141979",
"0.8115641",
"0.8105593",
"0.80478543",
"0.8044103",
"0.80312246",
"0.8006057",
"0.79934764",
"0.7975166",
"0.79699093",
"0.796012",
"0.79354113",
"0.79340... | 0.0 | -1 |
Get customer by ID | public CustomerModel findById(int id) throws Exception {
String sql = "SELECT * FROM customer WHERE ID = ?";
CustomerModel customer = null;
try {
log.info("Loading MySql driver");
Class.forName("com.mysql.jdbc.Driver");
log.info("Setting up connection with db");
conne... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Customer getCustomerById(final Long id);",
"@Override\n\tpublic Customer getCustomer(Integer id) {\n\t\treturn customerDao.findById(id);\n\t}",
"@Override\n\tpublic Customer retrieveCustomer(Integer id) {\n\n\t\tCustomer customer = new Customer();\n\n\t\tfor (Customer cust : customers) {\n\t\t\tif (cust.getId(... | [
"0.88547707",
"0.8343305",
"0.83405435",
"0.8235855",
"0.82040226",
"0.820297",
"0.8197596",
"0.8192001",
"0.8164878",
"0.81354153",
"0.8038435",
"0.80206954",
"0.8017736",
"0.7970872",
"0.79622626",
"0.7945709",
"0.7940183",
"0.7874591",
"0.7836421",
"0.77816904",
"0.7770806... | 0.0 | -1 |
aka SpanLogTracingConfig. Configuration of a single log event in a traced span. | @ConfigBean
public interface FakeSpanLogTracingConfig extends FakeTraceableConfig {
// /**
// * Disabled traced span log.
// */
// public static final FakeSpanLogTracingConfigBean DISABLED = FakeSpanLogTracingConfigBean.builder("disabled").enabled(false).build();
// /**
// * Enabled traced span log... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"EventWriterConfig getConfig();",
"@Override\n public void configure(Map<String, ?> config) {\n KafkaSpanDecorator customDecorator = \n (KafkaSpanDecorator)config.get(\"kafka.producer.decorator\");\n \n if (customDecorator != null) {\n decorators.add(customDecorator);... | [
"0.5581276",
"0.54712135",
"0.5450715",
"0.5227052",
"0.51532084",
"0.49563476",
"0.4837869",
"0.48057854",
"0.4790885",
"0.47471374",
"0.47426647",
"0.46900877",
"0.4609255",
"0.46089247",
"0.4608828",
"0.4519988",
"0.45039976",
"0.44930917",
"0.4461678",
"0.44615373",
"0.44... | 0.717434 | 0 |
TileEntitySniffer te = (TileEntitySniffer)world.getTileEntity(x, y, z); TileEntitySniffer te = (TileEntitySniffer)_world.getTileEntity(new BlockPos(_x, _y, _z)); / Switches the ID, return a new GUI. | @Override
public Object getClientGuiElement(int _ID, EntityPlayer _player, World _world, int _x, int _y, int _z)
{
switch(_ID)
{
case 0:
return new GuiTalentScreen();
default:
break;
}
return null;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public Object getClientGuiElement(int id, EntityPlayer player, World world,int x, int y, int z) {\n TileEntity tileEntity = world.getBlockTileEntity(x, y, z);\n if(tileEntity instanceof TileEntityBioCarbonizer){\n return new GuiBioCarbonizer(player.inventory,... | [
"0.66999805",
"0.6656264",
"0.64782095",
"0.6378586",
"0.6241614",
"0.61572987",
"0.61049855",
"0.6039534",
"0.60197306",
"0.59283495",
"0.59263057",
"0.5917354",
"0.583406",
"0.5786218",
"0.5781674",
"0.5621782",
"0.558318",
"0.55548024",
"0.55445385",
"0.55440766",
"0.55371... | 0.5870766 | 12 |
Whenever it is not able to find any handler for the request(404) | @ExceptionHandler(NoHandlerFoundException.class)
public ModelAndView handlerNoHandlerFoundException() {
ModelAndView mv = new ModelAndView("/clientViews/page");
mv.addObject("title","404 Error Page");
mv.addObject("error404", true);
return mv;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@ExceptionHandler(NoHandlerFoundException.class)\n public ModelAndView handleError404(Exception e) {\n ModelAndView model = new ModelAndView(\"genericError\");\n model.addObject(\"errCode\", \"404\");\n model.addObject(\"errMsg\", \"Zadana stranka nebyla na serveru bikeo.cz na... | [
"0.6701636",
"0.6636213",
"0.6629656",
"0.63023674",
"0.6289047",
"0.62868446",
"0.62792563",
"0.6252742",
"0.6191789",
"0.61693233",
"0.612497",
"0.60710776",
"0.6045403",
"0.6020872",
"0.60026413",
"0.599807",
"0.59832823",
"0.593264",
"0.5927612",
"0.5901842",
"0.5894914",... | 0.71736604 | 0 |
funcion que muestra un pop up al dar error e inicio de sesion | private void showAlert() {
AlertDialog.Builder alert = new AlertDialog.Builder(this);
alert.setMessage("Error al autenticar usuario");
alert.setPositiveButton("Aceptar", null);
AlertDialog pop = alert.create();
alert.show();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public String cerrarSesion(){\n FacesContext.getCurrentInstance().getExternalContext().invalidateSession();\r\n \r\n FacesMessage facesMessage = new FacesMessage(FacesMessage.SEVERITY_INFO, \"Sesión Cerrada\", \"Sesión Cerrada\");\r\n FacesContext.getCurrentInstance().addMessage(null, f... | [
"0.6605491",
"0.6485562",
"0.64777887",
"0.6450165",
"0.6356615",
"0.63465154",
"0.6335549",
"0.6286176",
"0.6207395",
"0.61484516",
"0.6142425",
"0.6086624",
"0.60726297",
"0.60653365",
"0.6063994",
"0.6042531",
"0.604111",
"0.6019842",
"0.59605783",
"0.59590274",
"0.5952030... | 0.65379786 | 1 |
funcion que pasa a la pantalla Home | private void showHome(String user){
Intent home = new Intent(this, HomeActivity.class);
home.putExtra("email", user);
startActivity(home);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void goHome();",
"String getOssHomepage();",
"String home();",
"protected void callHome() {\n\t\tIntent intent = new Intent(this, AdminHome.class);\r\n\t\tstartActivity(intent);\r\n\t}",
"public void home_index()\n {\n Home.index(homer);\n }",
"private void controladorHome(Controlador control... | [
"0.75576174",
"0.7143405",
"0.68635535",
"0.6848384",
"0.68474436",
"0.68299836",
"0.67505085",
"0.6628225",
"0.6549451",
"0.64783806",
"0.64624274",
"0.644763",
"0.64325887",
"0.63915145",
"0.63259435",
"0.63116175",
"0.62795085",
"0.62673104",
"0.6246196",
"0.6237688",
"0.6... | 0.5694487 | 84 |
Tree is an interface that should be implemented by all trees. | public interface Tree<T extends Comparable<T>> {
public boolean isEmpty();
public int size();
public T min();
public T max();
public boolean contains(T element);
public boolean add(T element);
public boolean remove(T element);
public Iterator<T> traverse(TreeTraversalOrder order);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public interface Tree {\n\n //查找节点\n Node find(int val);\n\n //插入新节点\n boolean insert(int val);\n\n //中序遍历\n void infixOrder(Node current);\n\n //前序遍历\n void preOrder(Node current);\n\n //后序遍历\n void postOrder(Node current);\n\n //找到最大值\n Node findMax();\n\n //找到最小值\n Node... | [
"0.7726013",
"0.7395538",
"0.7384544",
"0.71659404",
"0.7146552",
"0.71192265",
"0.6947367",
"0.68130565",
"0.6779357",
"0.6719812",
"0.66755986",
"0.66392714",
"0.65505713",
"0.6534005",
"0.6513212",
"0.64961827",
"0.64960265",
"0.6462345",
"0.6455866",
"0.64484715",
"0.6399... | 0.77069265 | 1 |
/ Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. | public static void main(String[] args) {
TruckTour sol1 = new TruckTour();
sol1.process();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\r\n\t\tSolution s = new Solution();\r\n\t}",
"public static void main(String[] args) throws IOException {\n\t\t//Scanner in = new Scanner(System.in);\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in... | [
"0.7527976",
"0.7303336",
"0.72607845",
"0.7235645",
"0.71771896",
"0.7173708",
"0.7021257",
"0.7021257",
"0.6892989",
"0.6870499",
"0.6857013",
"0.68230754",
"0.68217313",
"0.68089324",
"0.6807614",
"0.68048334",
"0.67823637",
"0.6769391",
"0.6755574",
"0.6752626",
"0.675013... | 0.0 | -1 |
private Map, Vertex> previous; Creates a StreetSearcher object. | public StreetSearcher() {
vertices = new HashMap<>();
graph = new SparseGraph<>();
//double smDistance = 0;
//previous = new HashMap<>();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Vertex getPrevious(){\n return previous;\n }",
"@Override\n\t//loc1 is the start location,loc2 is the destination\n\tpublic ArrayList<MapCoordinate> bfsSearch(MapCoordinate loc1, MapCoordinate loc2, Map m) {\n\t\tSystem.out.println(\"come into bfsSearch\");\n\t\tif(m.isAgentHasAxe() && m.isAgent... | [
"0.5627445",
"0.55323344",
"0.5339006",
"0.53070784",
"0.5228151",
"0.51851505",
"0.5169838",
"0.51343405",
"0.5123293",
"0.510184",
"0.50734395",
"0.5063662",
"0.5061977",
"0.50599587",
"0.5056774",
"0.50472885",
"0.5046267",
"0.5041834",
"0.49829865",
"0.49800807",
"0.49718... | 0.7586039 | 0 |
Get the path by tracing labels back from end to start. | private List<Edge<String>> getPath(Vertex<String> end,
Vertex<String> start) {
if (graph.label(end) != null) {
List<Edge<String>> path = new ArrayList<>();
Vertex<String> cur = end;
Edge<String> road;
while (cur != start) {
road = (Edge<String>) ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"protected LinkedList<IVertex<String>> getPath(IVertex<String> target) {\n\n LinkedList<IVertex<String>> path = new LinkedList<IVertex<String>>();\n\n IVertex<String> step = target;\n\n // check if a path exists\n if (predecessors.get(step) == null) {\n return null;\n }\n path.a... | [
"0.60260016",
"0.59370637",
"0.5937007",
"0.58844805",
"0.5817005",
"0.58126265",
"0.5801257",
"0.5786069",
"0.56865394",
"0.55991036",
"0.55725574",
"0.5541935",
"0.55298626",
"0.5526854",
"0.55133563",
"0.5501968",
"0.5496783",
"0.5468478",
"0.5462103",
"0.5378485",
"0.5377... | 0.6432541 | 0 |
Print the path found. | private void printPath(List<Edge<String>> path,
double totalDistance) {
if (path == null) {
System.out.println("No path found");
return;
}
System.out.println("Total Distance: " + totalDistance);
for (int i = path.size() - 1; i >= 0; i--) {
System.out.println(p... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void printPath(){\n\t\tListIterator<Path> listIterator =temp.listIterator();\n\t\twhile(listIterator.hasNext()){\n\t\t\tSystem.out.print(listIterator.next().getPos()+\" \");\n\t\t}\n\t}",
"public void printPath() {\n System.out.print(\"Path: \");\n for (int i = 0; i < parents.size(); i++) {\... | [
"0.7210239",
"0.67714804",
"0.6730696",
"0.6634288",
"0.65731144",
"0.648892",
"0.6418824",
"0.6374114",
"0.63300073",
"0.6317806",
"0.6148213",
"0.61161673",
"0.6072567",
"0.60206854",
"0.59955037",
"0.59786135",
"0.5966822",
"0.59166485",
"0.5879695",
"0.587811",
"0.5811798... | 0.6081941 | 12 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.