listarCategorias() {\\n\\t\\tArrayList<Categoria> categorias = new ArrayList<Categoria>();\\n\\t\\t\\n\\t\\tCursor c = db.query(RecordatoriosSQLHelper.CATEGORIAS_TABLE,\\n\\t\\t\\t\\tnull, null, null, null, null, null);\\n\\t\\t\\n\\t\\twhile (c.moveToNext()) {\\n\\t\\t\\tCategoria cat = getACategory(c);\\n\\t\\t\\tcategorias.add(cat);\\n\\t\\t}\\n\\t\\t\\n\\t\\tc.close();\\n\\t\\treturn categorias;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c2feb69642875e6fadd23b5b82ce9636\",\n \"score\": \"0.5479871\",\n \"text\": \"@Override\\r\\n public String getCategoria() {\\r\\n this.categoria = \\\"Livro\\\";\\r\\n \\r\\n return categoria;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"679781ba578522ef681011ab9db92d00\",\n \"score\": \"0.5478615\",\n \"text\": \"public void getCategories() {\\n URL.getCategories(getActivity(), String.valueOf(home.subParentId), String.valueOf(count), new URL.CategoryApiResponse() {\\n @Override\\n public void gotResponse(String response) {\\n try {\\n JSONObject object = new JSONObject(response);\\n if (object.getString(\\\"status\\\").equalsIgnoreCase(\\\"success\\\")) {\\n JSONArray data = object.getJSONArray(\\\"data\\\");\\n for (int i = 0; i < data.length(); i++) {\\n JSONObject details = data.getJSONObject(i);\\n\\n boolean isChecked = false;\\n for (int j = 0; j < home.selectedProducts.size(); j++) {\\n if (home.selectedProducts.get(j).CategoryId == details.getInt(\\\"category_id\\\")) {\\n isChecked = true;\\n }\\n }\\n\\n productList.add(new ProductList(details.getInt(\\\"category_id\\\"), details.getInt(\\\"parent_id\\\"), details.getString(\\\"name\\\"), details.getString(\\\"description\\\"), details.getString(\\\"image\\\"), isChecked));\\n }\\n\\n if (count < object.getInt(\\\"lastPage\\\")) {\\n count++;\\n getCategories();\\n }\\n } else {\\n\\n getProducts();\\n\\n }\\n\\n ad.notifyDataSetChanged();\\n\\n } catch (Exception exception) {\\n exception.printStackTrace();\\n Log.d(\\\"log\\\", \\\"GET PARENT CATEGORY API JSON EXCEPTION\\\");\\n Constants.showToast(getActivity(), getString(R.string.msg_failed_to_load));\\n }\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba5223de3c0a670f3f7ac53a3c010530\",\n \"score\": \"0.54653406\",\n \"text\": \"List<Categoria> buscarTodas();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"882ee3da2c6ad4dbc9b6c388a87570b7\",\n \"score\": \"0.5456314\",\n \"text\": \"public static void generateProductCategories()\\n\\t{\\n\\t\\tcategories=new ArrayList<ProductCategory>();\\n\\t\\tcategories.add(new ProductCategory(\\\"Bauturi Alcoolice\\\", Type.Alcoholic, R.drawable.alcohol));\\n\\t\\tcategories.add(new ProductCategory(\\\"Bauturi Nealcoolice\\\", Type.NonAlcoholic, R.drawable.non_alcoholic));\\n\\t\\tcategories.add(new ProductCategory(\\\"Mancaruri gatite\\\", Type.MainDish, R.drawable.main_dish));\\n\\t\\tcategories.add(new ProductCategory(\\\"Supe/Ciorbe\\\",Type.Soup, R.drawable.soup));\\n\\t\\tcategories.add(new ProductCategory(\\\"Deserturi\\\", Type.Dessert, R.drawable.dessert));\\n\\t\\tcategories.add(new ProductCategory(\\\"Diverse\\\", Type.Other, R.drawable.other));\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b887db8ad8cd49fed9d3f50558f4f73\",\n \"score\": \"0.5445168\",\n \"text\": \"java.util.List<Googleplay.CategoryProto> \\n getSubCategoriesList();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01b0f0a01fb4265b8831c31500152c26\",\n \"score\": \"0.5443002\",\n \"text\": \"public abstract List<InCompare> getSubSelects();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f9437eacc158e68e73e3a87f60ace02\",\n \"score\": \"0.5433996\",\n \"text\": \"public ArrayList<String> kategorier() {\\n ArrayList<String> kategorier = new ArrayList<String>();\\n try {\\n aapneForbindelse();\\n setning = forbindelse.prepareStatement(sqlKategori);\\n res = setning.executeQuery();\\n while (res.next()) {\\n if (!(res.getString(1).equals(\\\"\\\"))) {\\n kategorier.add(res.getString(1));\\n }\\n }\\n\\n } catch (SQLException e) {\\n Opprydder.skrivMelding(e,\\\"kategorier()\\\");\\n } finally {\\n stengForbindelse();\\n Opprydder.lukkSetning(setning);\\n }\\n return kategorier;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c55a2253cd5a3b9ce733e980772d56df\",\n \"score\": \"0.54262567\",\n \"text\": \"public List<Categories> getCat(String mainCat)\\n {\\n List<Categories> selectedCat = new ArrayList<Categories>();\\n\\n //Make db connection and excecute query\\n SQLiteDatabase db=this.getReadableDatabase();\\n mainCat.replace(\\\"-\\\", \\\"\\\\\\\\-\\\");\\n Cursor c = db.rawQuery(\\\"SELECT * FROM category WHERE mainCat = '\\\" + mainCat + \\\"'\\\", null);\\n\\n //Iterate through all results and insert returned categories into selectedCat\\n if (c.moveToFirst())\\n {\\n do {\\n String name = c.getString(0);\\n String number = c.getString(1);\\n String path = c.getString(2);\\n boolean hasClassifieds = (c.getInt(5) == 1);\\n boolean hasLegal = (c.getInt(4) == 1);\\n boolean isRestricted = (c.getInt(3) == 1);\\n String mainCatVal = c.getString(6);\\n selectedCat.add(new Categories(name,number,path,hasClassifieds,hasLegal,isRestricted,mainCatVal));\\n } while (c.moveToNext());\\n }\\n db.close();\\n\\n //Return the selected categories\\n return selectedCat;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9fabd34328c67e2e33b8f086344c8fcf\",\n \"score\": \"0.5424877\",\n \"text\": \"List<MmallCategory> selectAll();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9beb250fb263623fa407fc2f84018800\",\n \"score\": \"0.54238826\",\n \"text\": \"public VueCategories() {\\n\\t\\t//Créer un objet pour récupérer le texte saisit.\\n\\t\\tclavier = new Clavier(System.in);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac6df7c88ec82c0738b6fda9730a3648\",\n \"score\": \"0.54101926\",\n \"text\": \"void specialCategorySelected(int _val);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f11bb2b95a549e3a703365df632b4853\",\n \"score\": \"0.54075974\",\n \"text\": \"public List<String> getCategories();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8f04baab3009e8a8856c84ab8597cd00\",\n \"score\": \"0.5394896\",\n \"text\": \"public VistaPeliculaCategoria() throws SQLException {\\n initComponents();\\n \\n Conexion.getInstance();\\n Listar();\\n ComboBox();\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7b192411728c1cfb10ed9b24b15fc15\",\n \"score\": \"0.53866845\",\n \"text\": \"void mostrarComboCategoria(){\\n Statement st;\\n try{\\n st = cn.createStatement();\\n ResultSet rs = st.executeQuery(\\\"select distinct categoria from curso\\\");\\n while(rs.next()){\\n this.comboBox12.addItem(rs.getString(\\\"categoria\\\"));\\n }\\n\\n }catch (SQLException ex){\\n Logger.getLogger(CursandoFuerte.class.getName()).log(Level.SEVERE, null, ex);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11a4619f795780a7100b0ffe3c6efade\",\n \"score\": \"0.5382711\",\n \"text\": \"public ArrayList<Category> getCategories(){\\n ResultSet results = null;\\n GestionSql gdb = new GestionSql();\\n ArrayList<Category> categories = new ArrayList<Category>();\\n Category category = null;\\n try {\\n gdb.openConnection();\\n String sql = \\\"SELECT id,Name,Photo_path, Disabled FROM Category WHERE 1\\\";\\n results = gdb.executeSQL(sql);\\n \\n try{\\n while (results.next()) {\\n category = new Category(results.getInt(\\\"id\\\"), results.getString(\\\"Name\\\"), results.getString(\\\"Photo_path\\\"), results.getInt(\\\"Disabled\\\"));\\n categories.add(category);\\n }\\n }catch(Exception e){\\n System.out.println(\\\"Erro al extraer las categorias de la base de datoa al arrayList\\\");\\n return null;\\n }\\n gdb.closeConnection();\\n } catch (Exception e) {\\n System.out.println(\\\"Error al conectarse a la base de datos\\\");\\n e.printStackTrace();\\n }\\n return categories;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f09dcf3d6a829505ea3f766e26adf2cd\",\n \"score\": \"0.53811216\",\n \"text\": \"List<String> getCategories();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"860214cdd69621f573a6bfb3845acc33\",\n \"score\": \"0.5376846\",\n \"text\": \"private List<Category> createCategories() {\\r\\n\\t\\t\\r\\n\\t\\t// Initialize\\r\\n\\t\\tList<Category> categories = new ArrayList<Category>();\\r\\n\\t\\t\\r\\n\\t\\t// Build the categories\\r\\n\\t\\tint categoryCount = 1 + (int)(Math.random() * 3);\\r\\n\\t\\tfor (int i=1; i<=categoryCount; i++) {\\r\\n\\t\\t\\tCategory category = new Category();\\r\\n\\t\\t\\tcategory.setName(\\\"CAT\\\" + i);\\r\\n\\t\\t\\tcategory.setImageUrl(\\\"http://icons.iconarchive.com/icons/tpdkdesign.net/refresh-cl/256/System-Java-icon.png\\\");\\r\\n\\t\\t\\tList<Recommendation> recommendations = new ArrayList<Recommendation>();\\r\\n\\t\\t\\tint recommendationCount = 1 + (int)(Math.random() * 5);\\r\\n\\t\\t\\tfor (int j=1; j<=recommendationCount; j++) {\\r\\n\\t\\t\\t\\tRecommendation recommendation = new Recommendation();\\r\\n\\t\\t\\t\\trecommendation.setEntityName(\\\"Place \\\" + j);\\r\\n\\t\\t\\t\\trecommendation.setDescription(\\\"Description of place \\\" + j);\\r\\n\\t\\t\\t\\trecommendation.setImageUrl(\\\"http://icons.iconarchive.com/icons/tpdkdesign.net/refresh-cl/256/System-Java-icon.png\\\");\\r\\n\\t\\t\\t\\trecommendation.setEntityUrl(\\\"http://www.google.com\\\");\\r\\n\\t\\t\\t\\trecommendations.add(recommendation);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tcategory.setRecommendations(recommendations);\\r\\n\\t\\t\\tcategories.add(category);\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t// Return value to caller\\r\\n\\t\\treturn categories;\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eded34dc352cef0d67ab07f255f3a4b6\",\n \"score\": \"0.5374397\",\n \"text\": \"@Test\\n public void testGetCategories()\\n {\\n LinearMultiCategorizer<String> instance = new LinearMultiCategorizer<String>();\\n assertTrue(instance.getCategories().isEmpty());\\n\\n instance.getPrototypes().put(\\\"a\\\", new LinearBinaryCategorizer());\\n instance.getPrototypes().put(\\\"b\\\", new LinearBinaryCategorizer());\\n instance.getPrototypes().put(\\\"c\\\", new LinearBinaryCategorizer());\\n assertEquals(new HashSet<String>(Arrays.asList(\\\"a\\\", \\\"b\\\", \\\"c\\\")),\\n instance.getCategories());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa22579252914cd4c66f1552ded33887\",\n \"score\": \"0.53563684\",\n \"text\": \"public void fillCatSet(){\\r\\n\\t\\t\\tcatSet.add(\\\"Active Life\\\");catSet.add(\\\"Arts & Entertainment\\\"); catSet.add(\\\"Automotive\\\"); \\r\\n\\t\\t\\tcatSet.add(\\\"Car Rental\\\");catSet.add(\\\"Cafes\\\"); catSet.add(\\\"Beauty & Spas\\\"); catSet.add(\\\"Convenience Stores\\\"); \\r\\n\\t\\t\\tcatSet.add(\\\"Dentists\\\");catSet.add(\\\"Doctors\\\"); catSet.add(\\\"Drugstores\\\"); catSet.add(\\\"Department Stores\\\"); \\r\\n\\t\\t\\tcatSet.add(\\\"Education\\\"); catSet.add(\\\"Event Planning & Services\\\"); catSet.add(\\\"Flowers & Gifts\\\"); \\r\\n\\t\\t\\tcatSet.add(\\\"Food\\\"); catSet.add(\\\"Health & Medical\\\");catSet.add(\\\"Home Services\\\"); catSet.add(\\\"Home & Garden\\\"); \\r\\n\\t\\t\\tcatSet.add(\\\"Hospitals\\\"); catSet.add(\\\"Hotels & Travel\\\");catSet.add(\\\"Hardware Stores\\\"); catSet.add(\\\"Grocery\\\"); \\r\\n\\t\\t\\tcatSet.add(\\\"Medical Centers\\\"); catSet.add(\\\"Nurseries & Gardening\\\");catSet.add(\\\"Nightlife\\\"); \\r\\n\\t\\t\\tcatSet.add(\\\"Restaurants\\\"); catSet.add(\\\"Shopping\\\"); catSet.add(\\\"Transportation\\\");\\r\\n\\t\\t\\t\\r\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"84e66c223bc370fa2909f464978f489b\",\n \"score\": \"0.5356009\",\n \"text\": \"public Tab_kategorie[] getAllKategories(){\\n\\t\\tTab_kategorie.allKategories.clear();\\n\\t\\t\\n\\t\\t//Statement erzeugen & loschchicken\\n\\t\\tString stmt = \\\"SELECT * FROM kategorie\\\";\\n\\t\\trequestData(stmt);\\n\\t\\t\\n\\t\\t//Alle abgefragten Kategorien in die ArrayList eintragen\\n\\t\\ttry{\\n\\t\\t\\twhile(sqlResult.next()){\\n\\t\\t\\t\\tString kategorie =sqlResult.getString(\\\"bezeichnung\\\");\\n\\t\\t\\t\\tTab_kategorie.allKategories.add(new Tab_kategorie(kategorie));\\n\\t\\t\\t}\\n\\t\\t}catch(SQLException e){}\\n\\t\\t\\n\\t\\treturn Tab_kategorie.allKategories.toArray(new Tab_kategorie[Tab_kategorie.allKategories.size()]);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e7af3b9c33233f9c27476cab33ec6e2b\",\n \"score\": \"0.5353575\",\n \"text\": \"@POST(\\\"insurance/sub-categories\\\") Call<SubCategoriesResponse> getSubCategories(\\n @Body ApiCallsHandler.SimpleInsuranceRequest simpleInsuranceRequest);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a04cf2bab4d2fbad1708285aac782f1e\",\n \"score\": \"0.5353321\",\n \"text\": \"private ArrayList<Category> getCategorias(int id) {\\n categorias = dbHelper.getCategoriasPonto(id);\\n Log.d(\\\"categorias\\\", valueOf(categorias));\\n return categorias;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3aa929bd875c28a180731d7644b1c704\",\n \"score\": \"0.5350672\",\n \"text\": \"public void setSubCategoryViaID(int id)\\n {\\n Secretary.startFxn(\\\"CatalogVO.setSubCategoryViaID(\\\"+id+\\\")\\\");\\n this.categoryVO.setSubCategoryViaID(id);\\n Secretary.endFxn(\\\"CatalogVO.setSubCategoryViaID(\\\"+id+\\\")\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d60e42686e4fcaf84b8e79cae95e05c\",\n \"score\": \"0.53500515\",\n \"text\": \"public void initSubCategoryList() {\\n categoriesNotFoundView.setVisibility(GONE);\\n if (!NetworkUtils.isInternetConnectionEstablished(getContext())) {\\n handleNoInternet();\\n return;\\n }\\n progressBar.setVisibility(View.VISIBLE);\\n if (isParentCategory) {\\n compositeDisposable.add(categoryClient.getParentCategoryList(\\\"Category:\\\"+categoryName)\\n .subscribeOn(Schedulers.io())\\n .observeOn(AndroidSchedulers.mainThread())\\n .timeout(TIMEOUT_SECONDS, TimeUnit.SECONDS)\\n .collect(ArrayList<String>::new, ArrayList::add)\\n .subscribe(this::handleSuccess, this::handleError));\\n } else {\\n compositeDisposable.add(categoryClient.getSubCategoryList(\\\"Category:\\\"+categoryName)\\n .subscribeOn(Schedulers.io())\\n .observeOn(AndroidSchedulers.mainThread())\\n .timeout(TIMEOUT_SECONDS, TimeUnit.SECONDS)\\n .collect(ArrayList<String>::new, ArrayList::add)\\n .subscribe(this::handleSuccess, this::handleError));\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc462b8561f378f6b91d6af3d4a40f18\",\n \"score\": \"0.5334819\",\n \"text\": \"public List<Categoria> listarCategoriaPorDescricao(CategoriaRequest categoriaRequest){\\n return categoriaRepository.findAllByDescricaoContains(categoriaRequest.getDescricao());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b743e6dc63c2a2eb7d190e11fbd8d25c\",\n \"score\": \"0.53303367\",\n \"text\": \"List<CocoCategory> selectByExample(CocoCategoryExample example);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02c28ab334a96ef4a000cfe6dd80616c\",\n \"score\": \"0.5325657\",\n \"text\": \"Categories getQuestionaire();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"13e4c4431bfd48000e7528ab8165d96b\",\n \"score\": \"0.5323031\",\n \"text\": \"public List<SelectItem> getCargaCatalogos() {\\r\\n\\t\\tlistCatalog = new ArrayList<SelectItem>();\\r\\n\\t\\t\\r\\n\\t\\tlistCatalog.add(new SelectItem(0, \\\"Selecciona una opción\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(1, \\\"Unidades de Reparto\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(2, \\\"Modelo de Camioneta\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(3, \\\"Marca de Camioneta\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(4, \\\"Asignación de Unidad de Reparto\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(5, \\\"Ruta\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(6, \\\"Tipo de Ruta\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(7, \\\"Representante por Ruta\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(8, \\\"Asignación de Rutas\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(9, \\\"HandHeld - Dispositivo Movil\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(10, \\\"Empleado\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(11, \\\"Puesto\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(12, \\\"Linea de Transporte\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(13, \\\"Informante\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(14, \\\"SubBodega\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(15, \\\"Destinatario\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(16, \\\"Tipo Destinatario\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(17, \\\"Reporte por Tipo Destinatario\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(18, \\\"Reporte\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(19, \\\"LDC - Parametros\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(20, \\\"Usuario\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(21, \\\"Perfil\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(22, \\\"Denominaciones\\\"));\\r\\n\\t\\tlistCatalog.add(new SelectItem(23, \\\"Rutas Alternas\\\"));\\r\\n\\t\\t/* Valida el Mapa de Permisos - Se agregan elementos de acuerdo a Permiso */\\r\\n\\t\\tlistCatalog = validaCatalogosPermitidos();\\r\\n\\t\\treturn listCatalog;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"214f94774d2b453759b0a1abfa39dac6\",\n \"score\": \"0.53178674\",\n \"text\": \"public abstract int[] selectedFeaturesSubset();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f92705aba414ca0ccc600eaa41434da\",\n \"score\": \"0.5316905\",\n \"text\": \"@SuppressWarnings(\\\"unchecked\\\")\\n\\tpublic List<DropDownModel> getGItemSubCategoryList(String id) {\\n\\t\\tlogger.info(\\\"Method : getGItemSubCategoryList starts\\\");\\n\\t\\tList<DropDownModel> itemSubCategoryList = new ArrayList<DropDownModel>();\\n\\t\\tString value = \\\"SET @p_itemCategory='\\\" + id + \\\"';\\\";\\n\\t\\ttry {\\n\\t\\t\\tList<Object[]> x = entityManager.createNamedStoredProcedureQuery(\\\"inventoryGoodsReturnRoutines\\\")\\n\\t\\t\\t\\t\\t.setParameter(\\\"actionType\\\", \\\"getItemSubCategory\\\").setParameter(\\\"actionValue\\\", value)\\n\\t\\t\\t\\t\\t.getResultList();\\n\\n\\t\\t\\tfor (Object[] m : x) {\\n\\t\\t\\t\\tDropDownModel dropDownModel = new DropDownModel(m[0], m[1]);\\n\\t\\t\\t\\titemSubCategoryList.add(dropDownModel);\\n\\t\\t\\t}\\n\\n\\t\\t} catch (Exception e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\n\\t\\tlogger.info(\\\"Method : getGItemSubCategoryList ends\\\");\\n\\t\\treturn itemSubCategoryList;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"480aa85c831a5a2b3a5681e46f8edd85\",\n \"score\": \"0.53145593\",\n \"text\": \"public ArrayList<SubCategory> getSubcategories() {\\n\\t\\tif(subcategories == null)\\n\\t\\t\\tsubcategories = HCdbManager.getDb().getSubCategories(id);\\n\\t\\treturn subcategories;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce473fef0b8a44fe232093d7f53b4039\",\n \"score\": \"0.5313193\",\n \"text\": \"boolean hasSubCategoryDisplay();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c591d3099cceb5a488705beb68d73881\",\n \"score\": \"0.5305489\",\n \"text\": \"public List<Categoria> getCategorias() {\\n return this.colossal.getAllCategorias();\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c621e70c620a342cb1be4c0a508ff2dd\",\n \"score\": \"0.5300959\",\n \"text\": \"public ArrayList<Subset> getSubsets(){return subsets;}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b31f302fbd1a97d227fd16d3bc93cff3\",\n \"score\": \"0.52903944\",\n \"text\": \"public Categorical() {\\n initComponents();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7562ab8f1d3d098ff8e319e77f91722\",\n \"score\": \"0.5288172\",\n \"text\": \"public void setNextSubCategory()\\n {\\n //Secretary.startFxn(\\\"CatalogVO.setNextSubCategory()\\\");\\n this.categoryVO.setNextSubCategory();\\n //Secretary.endFxn(\\\"CatalogVO.setNextSubCategory()\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef05599d872cd0cce6d2b7fd1ab89607\",\n \"score\": \"0.52826357\",\n \"text\": \"public void inicialitzar(){\\r\\n\\r\\n valorExtes=this.categ().substring(1);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd2febc480a965e6f7470676c0faa073\",\n \"score\": \"0.5267951\",\n \"text\": \"private void agregarCategorias(List<Categorias> catExistentes, Productos producto) {\\n\\t\\tfor (Categorias cat : catExistentes) {\\n\\t\\t\\tcat.getProductos().add(producto);\\n\\t\\t\\tproducto.getCategorias().add(cat);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd327f764e962e125e7214c7a057faab\",\n \"score\": \"0.52673846\",\n \"text\": \"private Categoria escolheCategoria(String categoria) {\\r\\n\\t\\tswitch (categoria.toLowerCase()) {\\r\\n\\t\\tcase \\\"higiene pessoal\\\":\\r\\n\\t\\t\\treturn Categoria.higiene;\\r\\n\\t\\tcase \\\"limpeza\\\":\\r\\n\\t\\t\\treturn Categoria.limpeza;\\r\\n\\t\\tcase \\\"alimento industrializado\\\":\\r\\n\\t\\t\\treturn Categoria.industrializado;\\r\\n\\t\\tcase \\\"alimento nao industrializado\\\":\\r\\n\\t\\t\\treturn Categoria.N_industrializado;\\r\\n\\t\\tdefault:\\r\\n\\t\\t\\treturn null;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff8bee3f7d3865602df016617c59d0ab\",\n \"score\": \"0.52473664\",\n \"text\": \"public negocio.Categoria buscarCategoria(int idCategoria)\\r\\n\\t{\\r\\n\\t\\t//SE RECORRE CADA CATEGORIA DEL ARRAY\\r\\n\\t\\tfor(negocio.Categoria categoriaNegocio: this.categorias)\\r\\n\\t\\t{\\r\\n\\t\\t\\t//COMPARA LAS CATEGORIAS POR SU ID\\r\\n\\t\\t\\t//SI SON IGUALES DEVUELVE LA CATEGORIA\\r\\n\\t\\t\\tif(categoriaNegocio.getIdCategoria() == idCategoria)\\r\\n\\t\\t\\t\\treturn categoriaNegocio;\\r\\n\\t\\t}\\r\\n\\t\\t//EN CASO DE NO ENCONTRARLA DEVUELVE NULO\\r\\n\\t\\treturn null;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"474adbd068104612a837ec1c8ad62c42\",\n \"score\": \"0.5244695\",\n \"text\": \"private void populateCategoryComboBoxes(List<Category> returnedCategory) {\\n clearAllComboBoxes();\\n for(Category cat : returnedCategory){\\n FamillionView.this.applicationFrame.reportByCategoryPanel.comboBoxCategory.addItem(cat);\\n FamillionView.this.applicationFrame.addCostPanel.comboBoxCategory.addItem(cat);\\n FamillionView.this.applicationFrame.manageCategoriesPanel.comboBoxCategoryName.addItem(cat);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3deed04e48e64964838c2111691c4154\",\n \"score\": \"0.52285\",\n \"text\": \"public List<CategoriesEntity> categorizeOperations() {\\n\\t\\t\\n\\t\\t// Get banking ops from excel file\\n\\t\\tList<BankingOperationsEntity> bankingOperations = convertDataFromExcelToList();\\n\\t\\tList<CategoriesEntity> categories = new ArrayList<>();\\n\\t\\t\\n\\t\\t\\n\\t\\tList<BankingOperationsEntity> uberOperations = new ArrayList<>();\\n\\t\\tList<BankingOperationsEntity> amazonOperations = new ArrayList<>();\\n\\t\\tList<BankingOperationsEntity> lufthansaOperations = new ArrayList<>();\\n\\t\\tList<BankingOperationsEntity> lillydooOperations = new ArrayList<>();\\n\\t\\tList<BankingOperationsEntity> lclOperations = new ArrayList<>();\\n\\t\\tList<BankingOperationsEntity> deliverooOperations = new ArrayList<>();\\n\\t\\tList<BankingOperationsEntity> carrefourOperations = new ArrayList<>();\\n\\t\\tList<BankingOperationsEntity> cashOperations = new ArrayList<>();\\n\\n\\n\\n\\t\\tDouble sumOfUberOperations = 0.00;\\n\\t\\tDouble sumOfAmazonOperations = 0.00;\\n\\t\\tDouble sumOfLufthansaOperations = 0.00;\\n\\t\\tDouble sumOfLillydooOperations = 0.00;\\n\\t\\tDouble sumOfLclOperations = 0.00;\\n\\t\\tDouble sumOfDeliverooOperations = 0.00;\\n\\t\\tDouble sumOfCarrefourOperations = 0.00;\\n\\t\\tDouble sumOfCashOperations = 0.00;\\n\\n\\n\\t\\t// list of categories and categorized ops (category name and sum of ops)\\n\\t\\tfor (BankingOperationsEntity bankingOp : bankingOperations) {\\t\\t\\t\\t\\n\\t\\t\\tif(bankingOp.getBankingOperationLabel().toLowerCase().contains(StringConst.UBER.toLowerCase())) {\\n\\t\\t\\t\\tuberOperations.add(bankingOp);\\n\\t\\t\\t\\tsumOfUberOperations += -(bankingOp.getBankingOperationValue());\\n\\t\\t\\t}\\n\\t\\t\\tif(bankingOp.getBankingOperationLabel().toLowerCase().contains(StringConst.AMAZON.toLowerCase())) {\\n\\t\\t\\t\\tamazonOperations.add(bankingOp);\\n\\t\\t\\t\\tsumOfAmazonOperations += -(bankingOp.getBankingOperationValue());\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\tif(bankingOp.getBankingOperationLabel().toLowerCase().contains(StringConst.LUFTHANSA.toLowerCase())) {\\n\\t\\t\\t\\tlufthansaOperations.add(bankingOp);\\n\\t\\t\\t\\tsumOfLufthansaOperations += -(bankingOp.getBankingOperationValue());\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\tif(bankingOp.getBankingOperationLabel().toLowerCase().contains(StringConst.LILLYDOO.toLowerCase())) {\\n\\t\\t\\t\\tlillydooOperations.add(bankingOp);\\n\\t\\t\\t\\tsumOfLillydooOperations += -(bankingOp.getBankingOperationValue());\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\tif(bankingOp.getBankingOperationLabel().toLowerCase().contains(StringConst.LCL.toLowerCase())) {\\n\\t\\t\\t\\tlclOperations.add(bankingOp);\\n\\t\\t\\t\\tsumOfLclOperations += -(bankingOp.getBankingOperationValue());\\n\\t\\t\\t}\\n\\t\\t\\tif(bankingOp.getBankingOperationLabel().toLowerCase().contains(StringConst.DELIVEROO.toLowerCase())) {\\n\\t\\t\\t\\tdeliverooOperations.add(bankingOp);\\n\\t\\t\\t\\tsumOfDeliverooOperations += -(bankingOp.getBankingOperationValue());\\n\\t\\t\\t}\\n\\t\\t\\tif(bankingOp.getBankingOperationLabel().toLowerCase().contains(StringConst.CARREFOUR.toLowerCase())) {\\n\\t\\t\\t\\tcarrefourOperations.add(bankingOp);\\n\\t\\t\\t\\tsumOfCarrefourOperations += -(bankingOp.getBankingOperationValue());\\n\\t\\t\\t}\\n\\t\\t\\tif(bankingOp.getBankingOperationLabel().toLowerCase().contains(StringConst.CASH.toLowerCase())) {\\n\\t\\t\\t\\tcashOperations.add(bankingOp);\\n\\t\\t\\t\\tsumOfCashOperations += -(bankingOp.getBankingOperationValue());\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tcategories.add(new CategoriesEntity(StringConst.UBER, sumOfUberOperations));\\n\\t\\tcategories.add(new CategoriesEntity(StringConst.AMAZON, sumOfAmazonOperations));\\n\\t\\tcategories.add(new CategoriesEntity(StringConst.LUFTHANSA, sumOfLufthansaOperations));\\n\\t\\tcategories.add(new CategoriesEntity(StringConst.LILLYDOO, sumOfLillydooOperations));\\n\\t\\tcategories.add(new CategoriesEntity(StringConst.LCL, sumOfLclOperations));\\n\\t\\tcategories.add(new CategoriesEntity(StringConst.DELIVEROO, sumOfDeliverooOperations));\\n\\t\\tcategories.add(new CategoriesEntity(StringConst.CARREFOUR, sumOfCarrefourOperations));\\n\\t\\tcategories.add(new CategoriesEntity(StringConst.CASH, -sumOfCashOperations));\\n\\n\\t\\treturn categories;\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8fe19d00798c24f54b9a7bcf56e532cb\",\n \"score\": \"0.5222465\",\n \"text\": \"private ObservableList<String> generateInitialSubCategory(){\\r\\n return FXCollections.observableArrayList(model.CategoryDAO.getInitialSubCategory(mainCategory.getValue()));\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e108eed208fc7549fc7baf51c4399da0\",\n \"score\": \"0.5201677\",\n \"text\": \"public SubCategory() {\\n initComponents();\\n rBtnCode.setSelected(true);\\n txt_SubCategoryCode.requestFocus();\\n model_SubCategoryTable = (DefaultTableModel) TableSubCategory.getModel();\\n loadCategoriesToCombo();\\n LoadSubCategories();\\n panel1.setToolTipText(\\\"Press right mouse click to refresh.\\\");\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"74138ef4ca243114e1571246a5cb7b36\",\n \"score\": \"0.5201645\",\n \"text\": \"public void setSubcategories(ArrayList<SubCategory> subcategories) {\\n\\t\\tthis.subcategories = subcategories;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e14b6170f5cc1d46728ceb9626ecaf61\",\n \"score\": \"0.5195598\",\n \"text\": \"public void subCategoryIteratorReset()\\n {\\n Secretary.startFxn(\\\"CatalogVO.subCategoryIteratorReset()\\\");\\n this.categoryVO.subCategoryIteratorReset();\\n //this.categoryIterator = this.categories.values().iterator();\\n Secretary.endFxn(\\\"CatalogVO.subCategoryIteratorReset()\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c472bd0d99083f9df2b1c83ac218ba02\",\n \"score\": \"0.5190945\",\n \"text\": \"public void subCatOnClick(){\\n\\t\\tSystem.out.println(\\\"clicked on \\\" + subCatList.getSelectionModel().getSelectedItem());\\t\\t\\t\\t\\t\\n\\t\\tselectedList.add(new PosSelectionModel(subCatList.getSelectionModel().getSelectedItem(),92.0));\\n\\t//\\tsetTableData();\\n\\t\\t//productColumn.setCellValueFactory(new PropertyValueFactory<PosSelectionModel,String>(\\\"subProductName\\\"));\\n\\t//\\ttableView.setItems(selectedList);\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8a1a6c6595524534169478f2f92626c\",\n \"score\": \"0.5190722\",\n \"text\": \"@SuppressWarnings(\\\"unchecked\\\")\\n // <editor-fold defaultstate=\\\"collapsed\\\" desc=\\\"Generated Code\\\">//GEN-BEGIN:initComponents\\n private void initComponents() {\\n\\n jScrollPane1 = new javax.swing.JScrollPane();\\n arbol = new javax.swing.JTree();\\n jScrollPane2 = new javax.swing.JScrollPane();\\n listaCategorias = new javax.swing.JList();\\n botonAgregar = new javax.swing.JButton();\\n botonQuitar = new javax.swing.JButton();\\n jLabel1 = new javax.swing.JLabel();\\n mostrarImagen1 = new javax.swing.JLabel();\\n mostrarImagen2 = new javax.swing.JLabel();\\n mostrarImagen3 = new javax.swing.JLabel();\\n jLabel5 = new javax.swing.JLabel();\\n botonImagen1 = new javax.swing.JButton();\\n botonImagen2 = new javax.swing.JButton();\\n botonImagen3 = new javax.swing.JButton();\\n botonAceptar = new javax.swing.JButton();\\n jButton7 = new javax.swing.JButton();\\n\\n jScrollPane1.setViewportView(arbol);\\n\\n jScrollPane2.setViewportView(listaCategorias);\\n\\n botonAgregar.setText(\\\"Agregar\\\");\\n botonAgregar.addActionListener(new java.awt.event.ActionListener() {\\n public void actionPerformed(java.awt.event.ActionEvent evt) {\\n botonAgregarActionPerformed(evt);\\n }\\n });\\n\\n botonQuitar.setText(\\\"Quitar\\\");\\n botonQuitar.addActionListener(new java.awt.event.ActionListener() {\\n public void actionPerformed(java.awt.event.ActionEvent evt) {\\n botonQuitarActionPerformed(evt);\\n }\\n });\\n\\n jLabel1.setText(\\\"CATEGORIAS\\\");\\n\\n jLabel5.setText(\\\"IMAGENES\\\");\\n\\n botonImagen1.setText(\\\"Imagen 1\\\");\\n botonImagen1.addActionListener(new java.awt.event.ActionListener() {\\n public void actionPerformed(java.awt.event.ActionEvent evt) {\\n botonImagen1ActionPerformed(evt);\\n }\\n });\\n\\n botonImagen2.setText(\\\"Imagen 2\\\");\\n botonImagen2.addActionListener(new java.awt.event.ActionListener() {\\n public void actionPerformed(java.awt.event.ActionEvent evt) {\\n botonImagen2ActionPerformed(evt);\\n }\\n });\\n\\n botonImagen3.setText(\\\"Imagen 3\\\");\\n botonImagen3.addActionListener(new java.awt.event.ActionListener() {\\n public void actionPerformed(java.awt.event.ActionEvent evt) {\\n botonImagen3ActionPerformed(evt);\\n }\\n });\\n\\n botonAceptar.setText(\\\"Aceptar\\\");\\n botonAceptar.addActionListener(new java.awt.event.ActionListener() {\\n public void actionPerformed(java.awt.event.ActionEvent evt) {\\n botonAceptarActionPerformed(evt);\\n }\\n });\\n\\n jButton7.setText(\\\"Atras\\\");\\n jButton7.addActionListener(new java.awt.event.ActionListener() {\\n public void actionPerformed(java.awt.event.ActionEvent evt) {\\n jButton7ActionPerformed(evt);\\n }\\n });\\n\\n javax.swing.GroupLayout layout = new javax.swing.GroupLayout(getContentPane());\\n getContentPane().setLayout(layout);\\n layout.setHorizontalGroup(\\n layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addGroup(layout.createSequentialGroup()\\n .addContainerGap()\\n .addComponent(jScrollPane1, javax.swing.GroupLayout.PREFERRED_SIZE, 169, javax.swing.GroupLayout.PREFERRED_SIZE)\\n .addGroup(layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addGroup(layout.createSequentialGroup()\\n .addGap(0, 0, Short.MAX_VALUE)\\n .addGroup(layout.createParallelGroup(javax.swing.GroupLayout.Alignment.TRAILING)\\n .addComponent(mostrarImagen2, javax.swing.GroupLayout.PREFERRED_SIZE, 72, javax.swing.GroupLayout.PREFERRED_SIZE)\\n .addComponent(botonImagen2)\\n .addComponent(jLabel5))\\n .addGap(72, 72, 72)\\n .addGroup(layout.createParallelGroup(javax.swing.GroupLayout.Alignment.TRAILING)\\n .addComponent(mostrarImagen3, javax.swing.GroupLayout.PREFERRED_SIZE, 72, javax.swing.GroupLayout.PREFERRED_SIZE)\\n .addComponent(botonImagen3))\\n .addGap(50, 50, 50))\\n .addGroup(layout.createSequentialGroup()\\n .addGroup(layout.createParallelGroup(javax.swing.GroupLayout.Alignment.TRAILING)\\n .addComponent(jLabel1)\\n .addGroup(layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addComponent(botonAgregar, javax.swing.GroupLayout.PREFERRED_SIZE, 108, javax.swing.GroupLayout.PREFERRED_SIZE)\\n .addComponent(botonQuitar, javax.swing.GroupLayout.PREFERRED_SIZE, 108, javax.swing.GroupLayout.PREFERRED_SIZE)))\\n .addGap(18, 18, 18)\\n .addComponent(jScrollPane2, javax.swing.GroupLayout.PREFERRED_SIZE, 0, Short.MAX_VALUE)\\n .addContainerGap())))\\n .addGroup(layout.createSequentialGroup()\\n .addGap(54, 54, 54)\\n .addGroup(layout.createParallelGroup(javax.swing.GroupLayout.Alignment.TRAILING)\\n .addComponent(mostrarImagen1, javax.swing.GroupLayout.PREFERRED_SIZE, 72, javax.swing.GroupLayout.PREFERRED_SIZE)\\n .addComponent(botonImagen1))\\n .addContainerGap(363, Short.MAX_VALUE))\\n .addGroup(layout.createSequentialGroup()\\n .addContainerGap(javax.swing.GroupLayout.DEFAULT_SIZE, Short.MAX_VALUE)\\n .addComponent(jButton7, javax.swing.GroupLayout.PREFERRED_SIZE, 100, javax.swing.GroupLayout.PREFERRED_SIZE)\\n .addGap(71, 71, 71)\\n .addComponent(botonAceptar, javax.swing.GroupLayout.PREFERRED_SIZE, 100, javax.swing.GroupLayout.PREFERRED_SIZE)\\n .addGap(102, 102, 102))\\n );\\n layout.setVerticalGroup(\\n layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addGroup(layout.createSequentialGroup()\\n .addContainerGap()\\n .addComponent(jLabel1)\\n .addPreferredGap(javax.swing.LayoutStyle.ComponentPlacement.RELATED, 15, Short.MAX_VALUE)\\n .addGroup(layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addGroup(layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING, false)\\n .addComponent(jScrollPane1, javax.swing.GroupLayout.PREFERRED_SIZE, 0, Short.MAX_VALUE)\\n .addComponent(jScrollPane2, javax.swing.GroupLayout.PREFERRED_SIZE, 161, javax.swing.GroupLayout.PREFERRED_SIZE))\\n .addGroup(layout.createSequentialGroup()\\n .addGap(28, 28, 28)\\n .addComponent(botonAgregar)\\n .addGap(39, 39, 39)\\n .addComponent(botonQuitar)))\\n .addGap(7, 7, 7)\\n .addComponent(jLabel5)\\n .addPreferredGap(javax.swing.LayoutStyle.ComponentPlacement.RELATED)\\n .addGroup(layout.createParallelGroup(javax.swing.GroupLayout.Alignment.LEADING)\\n .addComponent(mostrarImagen1, javax.swing.GroupLayout.PREFERRED_SIZE, 75, javax.swing.GroupLayout.PREFERRED_SIZE)\\n .addComponent(mostrarImagen2, javax.swing.GroupLayout.Alignment.TRAILING, javax.swing.GroupLayout.PREFERRED_SIZE, 75, javax.swing.GroupLayout.PREFERRED_SIZE)\\n .addComponent(mostrarImagen3, javax.swing.GroupLayout.PREFERRED_SIZE, 75, javax.swing.GroupLayout.PREFERRED_SIZE))\\n .addPreferredGap(javax.swing.LayoutStyle.ComponentPlacement.RELATED)\\n .addGroup(layout.createParallelGroup(javax.swing.GroupLayout.Alignment.BASELINE)\\n .addComponent(botonImagen1)\\n .addComponent(botonImagen2)\\n .addComponent(botonImagen3))\\n .addPreferredGap(javax.swing.LayoutStyle.ComponentPlacement.RELATED)\\n .addGroup(layout.createParallelGroup(javax.swing.GroupLayout.Alignment.BASELINE)\\n .addComponent(botonAceptar)\\n .addComponent(jButton7)))\\n );\\n\\n pack();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5d0c7f97c55623ff700ca3ea8a0c243\",\n \"score\": \"0.5186925\",\n \"text\": \"List<DishCategory> getAllCategory();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8de25bf20e94b97d9bf753e9cde9d343\",\n \"score\": \"0.5186211\",\n \"text\": \"public String getCategorie() {\\n return categorie;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2affc595d582dcc2534be71b61c18493\",\n \"score\": \"0.51801085\",\n \"text\": \"public List<LaundryCategory> laundryCategory();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"883f34fae5bb22c7bdcd78d1293066ab\",\n \"score\": \"0.51739675\",\n \"text\": \"void queryTreeCategory() {\\n Map<String, Object> params = new HashMap<>();\\n params.put(\\\"parentId\\\", \\\"1\\\");\\n getModel().getTreeCategory(params, new BaseResponse() {\\n @Override\\n public void onSuccess(ResultBean bean) {\\n JSONObject data = bean.getJSONObject();\\n String jsonList = data.optString(\\\"list\\\");\\n List<GoodsCategory> categoryList = FastjsonUtils.toList(jsonList, GoodsCategory.class);\\n getView().setCategoryTitle(categoryList);\\n }\\n @Override\\n public void onError(String errMsg) {\\n\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a7e22073c64b51877291766c974bc11\",\n \"score\": \"0.51668674\",\n \"text\": \"public NodoCategoria(String categoria,NodoCategoria puntero){\\n this.categoria = categoria;\\n this.siguiente = puntero;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75cd586908c3554c1d456dee25b938c5\",\n \"score\": \"0.5166617\",\n \"text\": \"public List<SubcategoriaProducto> autocompletarSubcategoriaProducto(String consulta)\\r\\n/* 127: */ {\\r\\n/* 128:174 */ List<SubcategoriaProducto> lista = new ArrayList();\\r\\n/* 129: */ \\r\\n/* 130:176 */ HashMap<String, String> filters = new HashMap();\\r\\n/* 131:177 */ filters.put(\\\"nombre\\\", \\\"%\\\" + consulta.trim());\\r\\n/* 132: */ \\r\\n/* 133:179 */ lista = this.servicioSubcategoriaProducto.obtenerListaCombo(\\\"nombre\\\", true, filters);\\r\\n/* 134: */ \\r\\n/* 135:181 */ return lista;\\r\\n/* 136: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd3fa88334ca83b360ef52f42cec112c\",\n \"score\": \"0.51612157\",\n \"text\": \"@Generated(hash = 1090732649)\\n public synchronized void resetCategorias() {\\n categorias = null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a341f2689aafbe3c85679f92be590471\",\n \"score\": \"0.5154356\",\n \"text\": \"private static String getCategories(String page) {\\n StringBuilder categories = new StringBuilder();\\n Matcher m = Pattern.compile(\\\"\\\\\\\\[\\\\\\\\[Category:\\\\\\\\s*([\\\\\\\\w\\\\\\\\d\\\\\\\\s\\\\\\\\u00E0-\\\\\\\\u00FC-]*)\\\\\\\\]\\\\\\\\]*\\\").matcher(page);\\n while(m.find()) {\\n categories.append(m.group(1)).append(\\\", \\\");\\n }\\n try {\\n categories.deleteCharAt(categories.length()-2);\\n } catch(StringIndexOutOfBoundsException e) {\\n e.printStackTrace();\\n }\\n return categories.toString();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"521af54ec5f263319725ece2cdfe5775\",\n \"score\": \"0.5149054\",\n \"text\": \"public Categoria() {\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"634838553f4bad45702e357c7d3d1fbc\",\n \"score\": \"0.51465464\",\n \"text\": \"public PanelCategorias(TpvFrame frame) {\\n this.frame = frame;\\n initComponents();\\n acciones = new AccionesCategorias(this);\\n acciones.activaTabla();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c178650abc3d61c54a3ddad5d6d42bd\",\n \"score\": \"0.5142768\",\n \"text\": \"public JComboBox createNewSubsetNameSelector() {\\n \\n /* Get a selector containing the names of all existing subsets. */\\n JComboBox selector = subsets_.makeComboBox();\\n \\n /* Doctor its model so that it excludes RowSubset.ALL. */\\n final ComboBoxModel baseModel = selector.getModel();\\n Object item0 = baseModel.getElementAt( 0 );\\n if ( item0 == RowSubset.ALL ) {\\n selector.setModel( new ComboBoxModel() {\\n public int getSize() {\\n return baseModel.getSize() - 1;\\n }\\n public Object getElementAt( int index ) {\\n return baseModel.getElementAt( index >= 0 ? index + 1\\n : index );\\n }\\n public Object getSelectedItem() {\\n return baseModel.getSelectedItem();\\n }\\n public void setSelectedItem( Object item ) {\\n baseModel.setSelectedItem( item );\\n }\\n public void addListDataListener( ListDataListener lr ) {\\n baseModel.addListDataListener( lr );\\n }\\n public void removeListDataListener( ListDataListener lr ) {\\n baseModel.removeListDataListener( lr );\\n }\\n } );\\n }\\n else {\\n assert false;\\n }\\n \\n /* Set it editable. */\\n selector.setEditable( true );\\n \\n /* Set no initial default. */\\n selector.setSelectedItem( null );\\n \\n /* Return. */\\n return selector;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a270b877a0f442b573539c1de47b8736\",\n \"score\": \"0.5133457\",\n \"text\": \"@Override\\r\\n\\tpublic List<IndicadorCategoriaCompetencia> listar() {\\n\\t\\treturn null;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60347215b243e82026509d45c74d0969\",\n \"score\": \"0.5131889\",\n \"text\": \"public List<Categoria> getCategorias() {\\r\\n\\t\\treturn servicioCategoria.listar();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b9c95e6a32a202b73b051dfbe6ed56be\",\n \"score\": \"0.51225585\",\n \"text\": \"@Override\\r\\n\\tpublic List<AllcategoryDTO> getAllCategories() {\\n\\t\\t\\t\\tList<Allcategories> allCategories = festivedao.getFestiveCategories();\\r\\n\\t\\t\\t\\tList<Config> config=festivedao.getcategoryconfig(1);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tList<AllcategoryDTO> CategoryDTO = new ArrayList<AllcategoryDTO>();\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tallCategories.forEach(item->{config.forEach(it->{\\r\\n\\t\\t\\t\\t\\tAllcategoryDTO fsCategoryDTO = new AllcategoryDTO();\\r\\n\\t\\t\\t\\t\\tString url=(it.getConfigurl()).concat(item.getImageUrl());\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tfsCategoryDTO.setImageUrl(url);\\r\\n\\t\\t\\t\\t\\tfsCategoryDTO.setCategoryId(item.getCategoryId());\\r\\n\\t\\t\\t\\t\\tfsCategoryDTO.setCategoryName(item.getCategoryName());\\r\\n\\t\\t\\t\\t\\t//fsCategoryDTO.setImageUrl(item.getImageUrl());\\r\\n\\t\\t\\t\\t\\tfsCategoryDTO.setPositionOrder(item.getPositionOrder());\\r\\n\\t\\t\\t\\t\\tfsCategoryDTO.setIsAvailable(item.getisAvailable());\\r\\n\\t\\t\\t\\t\\tCategoryDTO.add(fsCategoryDTO);\\r\\n\\t\\t\\t\\t});});\\r\\n\\t\\t\\t\\t/*config.forEach(it->{\\r\\n\\t\\t\\t\\t\\tAllcategoryDTO DTO = new AllcategoryDTO();\\r\\n\\t\\t\\t\\t\\tDTO.setConfigUrl(it.getConfigurl());\\r\\n\\t\\t\\t\\t\\tCategoryDTO.add(DTO);\\r\\n\\t\\t\\t\\t});*/\\r\\n\\t\\t\\t\\treturn CategoryDTO;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5186d0fdccd5ff0e668dd7a1f71f44e1\",\n \"score\": \"0.5121314\",\n \"text\": \"public Category getSubCategory() {\\r\\n\\t\\treturn subCategory;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09783a6434eda8ff9439aed53433442b\",\n \"score\": \"0.5113598\",\n \"text\": \"@Override\\n\\tpublic List<Categorie> getCategorieKeyword(Categorie cate) {\\n\\t\\treturn dao.selectCategories(cate);\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983498,"cells":{"query_id":{"kind":"string","value":"c48f365cbc171c1402648e487330c415"},"query":{"kind":"string","value":"ensures an appropriate distribution of nodes at each level"},"positive_passages":{"kind":"list like","value":[{"docid":"b07d963e6de1f65c6f6406873efa483e","score":"0.0","text":"private int getLevelForNextInsert(){\r\n\t\tint level;\r\n\t\tint nodesAtLevel;\r\n\t\tfor (level = 0; targetNodesAtLevel(level) > 0;level++){\r\n\t\t\tif(level < levelCounts.size()) nodesAtLevel = levelCounts.get(level);\r\n\t\t\telse nodesAtLevel = 0;\r\n\t\t\tif (nodesAtLevel < targetNodesAtLevel(level)) return (int)level;\r\n\t\t}\r\n\t\treturn 0; \r\n\t}","title":""}],"string":"[\n {\n \"docid\": \"b07d963e6de1f65c6f6406873efa483e\",\n \"score\": \"0.0\",\n \"text\": \"private int getLevelForNextInsert(){\\r\\n\\t\\tint level;\\r\\n\\t\\tint nodesAtLevel;\\r\\n\\t\\tfor (level = 0; targetNodesAtLevel(level) > 0;level++){\\r\\n\\t\\t\\tif(level < levelCounts.size()) nodesAtLevel = levelCounts.get(level);\\r\\n\\t\\t\\telse nodesAtLevel = 0;\\r\\n\\t\\t\\tif (nodesAtLevel < targetNodesAtLevel(level)) return (int)level;\\r\\n\\t\\t}\\r\\n\\t\\treturn 0; \\r\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"9ae87aba1f7988b5283c5bc3e9e30d89","score":"0.67660534","text":"private int targetNodesAtLevel(int level){\r\n\t\treturn (int)Math.round((float)size/Math.pow(2.0, level+1));\r\n\t}","title":""},{"docid":"20b0d52f28038518e9ffca84c579646c","score":"0.62952304","text":"private void actualizeProbabilities() {\r\n\t\tdouble proba = 1.0/children.size();\r\n\t\tfor(Path path : children){\r\n\t\t\tpath.setProbability(proba);\r\n\t\t}\r\n\t}","title":""},{"docid":"4269f300c699a675acb0d383ad136363","score":"0.6250802","text":"protected abstract double logNodeProbability(Node node, int taxonCount);","title":""},{"docid":"58e0888d4784af9f45bdc37c114afd15","score":"0.6132892","text":"public void reshapeProbabilities(){\r\n\t\tdouble total = 0.0;\r\n\t\tfor(Path path : children){\r\n\t\t\ttotal += path.getProbability();\r\n\t\t}\r\n\t\tfor(Path path : children){\r\n\t\t\tpath.setProbability(path.getProbability()/total);\r\n\t\t}\r\n\t}","title":""},{"docid":"44971a727247562c1ee13a606bf6f66c","score":"0.61132395","text":"public double find_density()\n{ double density=0.0;\n double tweight=0.0;\n double n=ProteinChain.size();\n for (Protein ProteinChain1 : ProteinChain) \n { double pweight=0.0;\n for(Node tempNode:ProteinChain1.neighbours)\n {pweight=pweight++;\n }\n tweight=tweight+pweight;\n\n }\n density= tweight/(n*(n-1));\n return density;\n}","title":""},{"docid":"9149f6b557fc6cb5986de0d3289f317b","score":"0.6057186","text":"int getFixedNodesCount();","title":""},{"docid":"b2cb07d05f7415d45907085137109099","score":"0.60489696","text":"public void generateRandomTree()\n {\n //assigns each existing node with a possitive integer\n int counter = 1;\n \n //first level and second level(depth 0 & 1): always there\n tree[0] = counter;\n counter ++;\n \n tree[1] = counter;\n counter ++;\n \n tree[2] = counter;\n counter ++;\n \n //third level and after (depth >=2): probability: 0.75^(depth-1)\n //-1: doesnt exist\n //0: not filled / determined yet (default)\n //possitive integers: node exists \n \n for (int depth = 2; depth <= DEPTH; depth ++)\n {\n //finds out the start and end of the current level\n int start = (int)Math.pow(2, depth)-1;\n int end = (int)Math.pow(2, depth+1)-1;\n \n for (int i = start ; i < end ; i++){\n \n // if this node can't possibly exist (parent doesn't exist), make its children into -1\n if (tree[i] == -1){\n if ( 2*i+2 < capacity) tree[2*i+1] = tree[2*(i+1)] = -1;\n }\n \n //if parent exist, then generate the child according to probablility\n else { \n \n // we set the probability as (3/4)^(depth-1)\n // so nodes at depth = 2 has (3/4) probability to exist\n // nodes at depth = 2 has (9/16) probability to exist\n // nodes at depth = 2 has (27/64), and so on.\n \n //generate random number according to denominator, 4^(depth-1)\n int random = (int)(Math.random()*Math.pow(4, depth-1));\n \n //The tree node exists if it is less than 3^(depth-1)\n if (random <= Math.pow(3, depth-1)){\n tree[i] = counter;\n counter++;\n \n // if it doesnt exist,\n //make the node itself and its children into -1\n } else {\n tree[i] = -1;\n if ( 2*i+2 < capacity) tree[2*i+1] = tree[2*(i+1)] = -1;\n }\n \n }\n }\n \n }\n \n }","title":""},{"docid":"d78f9b7ac024df3038a614d275ae48ee","score":"0.601045","text":"protected void setNormalStressNodes() {\n mNormalStressNodes = new TreeMap<>();\n mNormalStressNodesO = new TreeMap<>();\n\n for(BigDecimal n : mXNodes){\n\n try {\n\n // Normal Stress\n // N(i) / A\n // mInnerHorizontalForceNodes[n] / ( crossSectionArea ) * 10000\n // (N)/(cm^2)\n\n mNormalStressNodes.put(n, mInnerHorizontalForceNodes.get(n).divide(mCrossSection.getArea_of_section(CrossSection.Unit.DEFAULT),12,RoundingMode.HALF_EVEN).multiply(new BigDecimal(10000)));\n\n mNormalStressNodesO.put( n, mNormalStressNodes.get(n).setScale(3,RoundingMode.HALF_EVEN) );\n System.out.println(\"setNormalStressNodes() : Success : n = \" + n);\n }catch(Exception e){\n System.out.println(\"setNormalStressNodes() : Failed : n = \" + n + \" : \"+mInnerHorizontalForceNodes.get(n));\n System.out.println(e);\n }\n\n }\n }","title":""},{"docid":"50323bdd1e363c37c08c2cebcc2e2df4","score":"0.59420043","text":"public static final int getTotalRequiredNodes(int levels)\n {\n if(levels<1) return -1;\n \n return (int)(Math.pow(2, levels+1)-1);\n }","title":""},{"docid":"67c7ba34e1d1337a8ac6a8c9295a9a03","score":"0.5927317","text":"public double likelyhood(List<Node> nodes, ArrayList<ArrayList<Integer>> dataset) {\n\t\tList<Double> setVals = new ArrayList<Double>();\n\t\tfor(ArrayList<Integer> set : dataset) {\n\t\t\tList<Double> nodeVals = new ArrayList<Double>();\n\t\t\tfor(Node n : nodes) {\n//\t\t\t\tSystem.out.println(\"NODE: - \" + n.getIdentifier());\n\t\t\t\t// find the probability of the parents of this node matching the dataset\n\t\t\t\tdouble tempVal = 0;\n\t\t\t\tList<Node> parents = n.getParents(); // summon 'rents\n\t\t\t\tif(parents.isEmpty()) { // do we have parents?\n\t\t\t\t\t// if we don't then our value is at the null key\n\t\t\t\t\tif(set.get(n.getNodePos()) == 1) nodeVals.add(n.getValue(null));\n\t\t\t\t\tif(set.get(n.getNodePos()) == 0) nodeVals.add(1 - n.getValue(null)); // negate the value if the set has a false value\n//\t\t\t\t\tSystem.out.println(\"We got this val: \" + nodeVals.get(nodeVals.size()-1));\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n//\t\t\t\tSystem.out.println(\"We have Parent's see: \" + n.getParents());\n\t\t\t\tList<Boolean> valOfParentsinSet = new ArrayList<Boolean>();\n\t\t\t\tfor(Node pNode : parents) { // figure out what values our parents should have\n\t\t\t\t\tif(set.get(pNode.getNodePos()) == 1) valOfParentsinSet.add(true);\n\t\t\t\t\telse if(set.get(pNode.getNodePos()) == 0) valOfParentsinSet.add(false);\n\t\t\t\t}\n//\t\t\t\tSystem.out.println(\"Val of rents\" + valOfParentsinSet);\n\t\t\t\t\n\t\t\t\t// add the expected value of us given our parents in the data set and negate it if necessary\n\t\t\t\tif(set.get(n.getNodePos()) == 1) nodeVals.add(n.getValue(valOfParentsinSet));\n\t\t\t\tif(set.get(n.getNodePos()) == 0) nodeVals.add(1 - n.getValue(valOfParentsinSet));\n\t\t\t\t\n//\t\t\t\tSystem.out.println(\"We got this val: \" + nodeVals.get(nodeVals.size()-1));\n\t\t\t}\n\t\t\t// Total all the node's values\n\t\t\tdouble totalForSet = 1;\n//\t\t\tSystem.out.println(\"NodeVals: \" + nodeVals);\n\t\t\tfor(Double d : nodeVals) {\n\t\t\t\ttotalForSet = totalForSet * d;\n\t\t\t}\n\t\t\tsetVals.add(totalForSet);\n\t\t}\n\t\t// total all the dataset's values\n//\t\tSystem.out.println(\"Each Set's Values: \" + setVals);\n\t\tdouble total = 1;\n\t\tfor(Double d : setVals) {\n\t\t\ttotal = total * d;\n\t\t}\n\t\treturn total;\n\t}","title":""},{"docid":"170465765f1677cb802f73584ba4ea53","score":"0.5847764","text":"protected void setNormalBendingStressNodes() {\n mNormalBendingStressNodes = new TreeMap<>();\n mNormalBendingStressNodesO = new TreeMap<>();\n\n for(BigDecimal n : mXNodes){\n\n try {\n\n // Normal Bending Stress\n // (My) / (I)\n // ( mInnerBendingMomentNodes[n] * 0.5 * depthOfSection ) / ( secondMomentOfAreaX )\n // (Nm.mm)/(cm^4)\n\n mNormalBendingStressNodes.put(n, mInnerBendingMomentNodes.get(n)\n .multiply(\n new BigDecimal(0.5)\n .multiply(mCrossSection.depth_of_section)\n ).divide(\n mCrossSection.sec_moment_area_x, 12, RoundingMode.HALF_EVEN\n\n // Konversi (Nm.mm)/(cm^4) ke (N/m^2)\n ).multiply(new BigDecimal(100000))\n );\n\n mNormalBendingStressNodesO.put( n, mNormalBendingStressNodes.get(n).setScale(3,RoundingMode.HALF_EVEN) );\n }catch(Exception e){\n System.out.println(e);\n }\n\n\n\n //System.out.println(\"Inner Normal Bending Stress on \" + n + \" : M : \"+mInnerBendingMomentNodes.get(n)+\" , y : \"+mCrossSection.depth_of_section+\" , I : \"+mCrossSection.sec_moment_area_x+\" \" + mInnerBendingMomentNodes.get(n) + \" \" + mCrossSection.depth_of_section + \" \" + mCrossSection.sec_moment_area_x + \" = \" + mNormalBendingStressNodes.get(n) + \" ; \" );\n\n }\n }","title":""},{"docid":"e1812f0125b4d4b1c2ffce58764b7ad7","score":"0.584189","text":"public void setNodeDist(double nodeDist) {\n this.nodeDist = nodeDist;\n }","title":""},{"docid":"3ad70a30611097e63e07d2bdf2072fa6","score":"0.58386034","text":"@Test\n void nodeSize() {\n weighted_graph g = makeGraph(10,0,1) ;\n Assertions.assertEquals(10,g.nodeSize());\n g.removeNode(0);\n Assertions.assertEquals(9,g.nodeSize());\n g.addNode(9);\n Assertions.assertEquals(9,g.nodeSize());\n g.addNode(10);\n Assertions.assertEquals(10,g.nodeSize());\n }","title":""},{"docid":"bf71e069d6ee1acce6c0a56946bce2b5","score":"0.5832157","text":"@Before\n public void initialize() {\n N1.addConnection(N2);\n N1.addConnection(N6);\n\n //Add connections for nodeTwo\n N2.addConnection(N3);\n\n //Add connections for nodeThree\n N3.addConnection(N9);\n\n //Add connections for nodeFour\n N4.addConnection(N7);\n N4.addConnection(N5);\n\n //Add connections for nodeFive\n N5.addConnection(N8);\n\n //Add connections for nodeSix\n\n //Add connections for nodeSeven\n N7.addConnection(N6);\n N7.addConnection(N8);\n N7.addConnection(N10);\n\n //Add connections for nodeEight\n N8.addConnection(N9);\n\n //Add connections for nodeNine\n N9.addConnection(N15);\n N9.addConnection(N9_2);\n\n //Add connections for nodeTen\n N10.addConnection(N11);\n\n //Add connections for nodeEleven\n N11.addConnection(N14);\n\n //Add connections for nodeTwelve\n N12.addConnection(N13);\n N12.addConnection(N16);\n\n //Add connections for nodeThirteen\n N13.addConnection(N14);\n N13.addConnection(N17);\n\n //Add connections for nodeFourteen\n N14.addConnection(N15);\n N14.addConnection(N18);\n\n //Add connections for nodeFifteen\n\n //Add connections for nodeSixteen\n N16.addConnection(N17);\n\n //Add connections for nodeSeventeen\n N17.addConnection(N20);\n\n //Add connections for nodeEighteen\n N18.addConnection(N19);\n N18.addConnection(N21);\n\n //Add connections for nodeNineteen\n N19.addConnection(N22);\n\n //Add connections for nodeTwenty\n N20.addConnection(N21);\n N20.addConnection(N20_2);\n\n //Add connections for nodeTwentyOne\n N21.addConnection(N23);\n N21.addConnection(N22);\n\n //Add connections for nodeTwentyTwo\n\n //Add connections for nodeTwentyThree\n\n //Add connections for nodeOne_1\n N1_2.addConnection(N2_2);\n N1_2.addConnection(N6_2);\n\n //Add connections for nodeTwo_2\n N2_2.addConnection(N3_2);\n\n //Add connections for nodeThree_2\n N3_2.addConnection(N9_2);\n\n //Add connections for nodeFour_2\n N4_2.addConnection(N7_2);\n N4_2.addConnection(N5_2);\n\n //Add connections for nodeFive_2\n N5_2.addConnection(N8_2);\n\n //Add connections for nodeSix_2\n\n //Add connections for nodeSeven_2\n N7_2.addConnection(N6_2);\n N7_2.addConnection(N8_2);\n N7_2.addConnection(N10_2);\n\n //Add connections for nodeEight_2\n N8_2.addConnection(N9_2);\n\n //Add connections for nodeNine_2\n N9_2.addConnection(N15_2);\n\n //Add connections for nodeTen_2\n N10_2.addConnection(N11_2);\n\n //Add connections for nodeEleven_2\n N11_2.addConnection(N14_2);\n\n //Add connections for nodeTwelve_2\n N12_2.addConnection(N13_2);\n N12_2.addConnection(N16_2);\n\n //Add connections for nodeThirteen_2\n N13_2.addConnection(N14_2);\n N13_2.addConnection(N17_2);\n\n //Add connections for nodeFourteen_2\n N14_2.addConnection(N15_2);\n N14_2.addConnection(N18_2);\n\n //Add connections for nodeFifteen_2\n\n //Add connections for nodeSixteen_2\n N16_2.addConnection(N17_2);\n\n //Add connections for nodeSeventeen_2\n N17_2.addConnection(N20_2);\n\n //Add connections for nodeEighteen_2\n N18_2.addConnection(N19_2);\n N18_2.addConnection(N21_2);\n\n //Add connections for nodeNineteen_2\n N19_2.addConnection(N22_2);\n\n //Add connections for nodeTwenty_2\n N20_2.addConnection(N21_2);\n\n //Add connections for nodeTwentyOne_2\n N21_2.addConnection(N23_2);\n N21_2.addConnection(N22_2);\n\n //Add connections for nodeTwentyTwo_2\n\n //Add connections for nodeTwentyThree_2\n\n }","title":""},{"docid":"e31eef0dbba34131dd2299d49d9e97cd","score":"0.5817861","text":"private void computeNodeWeights() {\n\t\tHashMap<Integer, Double> nodeWeights = new HashMap<Integer, Double>();\n\t\t\n\t\tList<Node> nodes = this.getAllNodes();\n\t\t\n\t\t// init the scores (random as of now)\n\t\tfor(Node n : nodes) {\n\t\t\tnodeWeights.put(n.getID(), Math.random());\n\t\t}\n\t\t\n\t\t// iterate over all nodes until the difference is negligible\n\t\tdouble diff = 10;\n\t\t// TODO choose some threshold here for accuracy desired\n\t\twhile(diff >= 1) {\n\t\t\tHashMap<Integer, Double> nodeWeightsTemp = new HashMap<Integer, Double>();\n\t\t\tdiff = 0;\n\t\t\t\n\t\t\tfor(Node n : nodes) {\n\t\t\t\tint nodeId = n.getID();\n\t\t\t\tdouble n_score = 0;\n\t\t\t\t\n\t\t\t\t// get all edges for node\n\t\t\t\tList<Edge> edges = n.getEdges();\n\t\t\t\tfor(Edge e : edges) {\n\t\t\t\t\t// get node at the other end of the edge\n\t\t\t\t\tlong neighborNodeId = e.getIncidentNodeId(nodeId);\n\t\t\t\t\t// neighbor node\n\t\t\t\t\tNode neighborNode = this.nodes.get((int)neighborNodeId);\n\t\t\t\t\t// get outdegree of neighbor node\n\t\t\t\t\tint outdegree = neighborNode.getOutDegree();\n\t\t\t\t\t// update n_score\n\t\t\t\t\t// TODO need to take the edge weight into account\n\t\t\t\t\tn_score += ((double)nodeWeights.get((int)neighborNodeId)/(double)outdegree);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tdouble nodeWeight = (1-D) + D*(n_score);\n\t\t\t\tnodeWeightsTemp.put(nodeId, nodeWeight);\n\t\t\t\tn.setWeight(nodeWeight);\n\t\t\t\tdiff += Math.abs(nodeWeights.get(nodeId) - nodeWeight);\n\t\t\t}\n\t\t\t\n\t\t\tnodeWeights = nodeWeightsTemp;\n\t\t\t// normalize difference\n\t\t\tdiff = (diff/nodes.size());\n\t\t}\n\t}","title":""},{"docid":"c3011b0aa41b6cee13a7f3a980a30482","score":"0.58037955","text":"public void komplett() {\n\t\tthis.computeNodeWeights();\n\t}","title":""},{"docid":"d9567a4bd1d547f74809eb2b468252cf","score":"0.57930756","text":"public Set<Node> initialiseArticulation() {\n\t\tfor (Entry<Integer, Node> entry : nodes.entrySet()) {\n\t\t\tentry.getValue().count = Integer.MAX_VALUE;\n\t\t}\n\t\t// get the first node\n\t\tNode start = nodes.values().iterator().next();\n\t\tstart.count = 0;\n\t\tint numSubtrees = 0;\n\t\t\n\t\t// call articulation points on all relevant nodes\n\t\tfor (Node neighbour : start.getNeighbours()) {\n\t\t\tif (neighbour.count == Integer.MAX_VALUE) {\n\t\t\t\titerArticulationPoints(neighbour, start);\n\t\t\t\tnumSubtrees++;\n\t\t\t}\n\t\t}\n\t\tif (numSubtrees > 1) {\n\t\t\tarticulationPoints.add(start);\n\t\t}\n\t\treturn articulationPoints;\n\t}","title":""},{"docid":"fd38cd2dfd00af32e2e587d5e6158450","score":"0.57911134","text":"protected abstract double logTreeProbability(final int taxonCount);","title":""},{"docid":"776e20f6258aafd204e1f51dc74cd1af","score":"0.5770822","text":"public void prepareNodeChildren(TreeNode node, float skew) {\n\n int size = node.children.size();\n\n if (size == 0) { return; }\n\n float newScore = (float) 0.0;\n int currentMoveIndex = -1;\n ArrayList<TreeNode> nodesToChange = new ArrayList<TreeNode>();\n int i = 0;\n\n // if (node.depth == 2) { System.out.println(size); }\n\n while (i < size) {\n\n TreeNode child = node.children.get(i);\n\n // if (node.depth == 2) { System.out.println(child.currentScore); }\n\n if (child.moveIndex != currentMoveIndex) {\n\n // Fill out all the values\n\n int listSize = nodesToChange.size();\n float totalScore = (float) 0.0;\n\n for (int j = 0; j < listSize; j++) {\n\n totalScore += nodesToChange.get(j).currentScore * nodesToChange.get(j).probability;\n\n // if (node.depth == 2) { System.out.println(nodesToChange.get(j).currentScore); }\n\n\n }\n // if (totalScore == 0) {System.out.println(\"YEETUS0\");}\n\n // if (node.depth == 1 && ) { totalScore += skew; }\n\n for (int j = 0; j < listSize; j++) {\n\n nodesToChange.get(j).currentScore = totalScore;\n\n }\n\n currentMoveIndex = child.moveIndex;\n nodesToChange = new ArrayList<TreeNode>();\n\n }\n\n nodesToChange.add(child);\n i++;\n\n }\n\n // Since last arraylist won't be processed in the loop.\n\n int listSize = nodesToChange.size();\n float totalScore = (float) 0.0;\n\n for (int j = 0; j < listSize; j++) {\n\n totalScore += nodesToChange.get(j).currentScore * nodesToChange.get(j).probability;\n\n }\n\n // if (totalScore == 0) {System.out.println(\"YEETUS1\");}\n\n for (int j = 0; j < listSize; j++) {\n\n nodesToChange.get(j).currentScore = totalScore;\n\n }\n\n // if (node.depth == 2) { System.out.println(node.currentScore); /* System.exit(0); */ }\n\n }","title":""},{"docid":"7eceef2f7e743aab5711fdf6032c89f7","score":"0.5759885","text":"public void mutate(){\n double chance=rng.simpleDouble();\n if(chance>.8)\n mutateTopology();\n else\n mutateWeights();\n }","title":""},{"docid":"8ad24b6d7fd61e2de39cbf5c7bae871c","score":"0.57542145","text":"protected void setMaxPrincipalStressCMaxNodes(){\n mMaxPrincipalStressCMaxNodes = new TreeMap<>();\n mMaxPrincipalStressCMaxNodesO = new TreeMap<>();\n\n\n for(BigDecimal n : mXNodes){\n\n // Perhitungan Average Stress di c = y\n // (total_normal_stress_x + total_normal_stress_y)/2\n // total_normal_stress_y = 0 ( Tidak dihitung, dianggap nol )\n\n BigDecimal avgStress = new BigDecimal(1)\n .multiply(\n\n // Total Tegangan Normal Sumbu x\n mNormalStressNodes.get(n).abs()\n .add( mNormalBendingStressNodes.get(n).abs() )\n\n // Total Tegangan Normal Sumbu y\n .add( new BigDecimal(0) )\n )\n .divide( new BigDecimal(2),12,RoundingMode.HALF_EVEN );\n\n\n BigDecimal maxInPlaneShearStressPow2 = new BigDecimal(1)\n .multiply(\n new BigDecimal(1)\n .multiply(\n new BigDecimal(1)\n .multiply(\n // Total Tegangan Normal Sumbu x\n mNormalStressNodes.get(n).abs()\n .add( mNormalBendingStressNodes.get(n).abs() )\n\n // Total Tegangan Normal Sumbu y\n .subtract( new BigDecimal(0) )\n )\n\n // Dibagi 2\n .divide( new BigDecimal(2),12,RoundingMode.HALF_EVEN )\n )\n // Pangkat 2\n .pow(2)\n )\n .add(\n // Tegangan Geser XY di Ujung Batang = 0\n new BigDecimal(0).pow(2)\n );\n\n try{\n BigDecimal maxInPlaneShearStress;\n\n if(maxInPlaneShearStressPow2.setScale(6,RoundingMode.FLOOR).compareTo(new BigDecimal(0.000000)) < 1)\n {\n maxInPlaneShearStress = new BigDecimal(0);\n }else{\n maxInPlaneShearStress = BigDecimalMath.sqrt(maxInPlaneShearStressPow2);\n }\n\n BigDecimal maxPrincipalStress = avgStress.add(maxInPlaneShearStress);\n\n System.out.println(avgStress + \" + \" + maxInPlaneShearStress + \" = \" + avgStress.add(maxInPlaneShearStress));\n\n mMaxPrincipalStressCMaxNodes.put(n,maxPrincipalStress);\n mMaxPrincipalStressCMaxNodesO.put(n, mMaxPrincipalStressCMaxNodes.get(n).setScale(3,RoundingMode.HALF_EVEN));\n //System.out.println(\"n : \"+n+\" \"+ mNormalBendingStressNodes.get(n)+\" Principal Stress c = y : \"+avgStress+\" + \"+maxInPlaneShearStress+\" = \"+maxPrincipalStress);\n\n if(mMaxPrincipalStressCMaxValue == null){\n mMaxPrincipalStressCMaxValue = maxPrincipalStress.abs();\n mMaxPrincipalStressCMaxLocation = n;\n }else{\n if(mMaxPrincipalStressCMaxValue.compareTo(maxPrincipalStress)<1){\n mMaxPrincipalStressCMaxValue = maxPrincipalStress.abs();\n mMaxPrincipalStressCMaxLocation = n;\n }\n }\n }catch(Exception e){\n System.out.println(e);\n }\n\n }\n\n System.out.println(\"==============================================================\");\n\n }","title":""},{"docid":"507c4ee1b7e40f64b94906470633309c","score":"0.5703047","text":"@Override\r\n\tpublic int getNumNodes() {\r\n\t\treturn nodeMap.size();\r\n\t}","title":""},{"docid":"3f3bda763fead37db0090b045f5f8b02","score":"0.57018393","text":"@Override\n public double[] distributionForInstance(Instance instance) {\n\n if (main_Attribute == null) {\n return class_Distribution;\n } else {\n if (main_Attribute.isNumeric()) {\n if (instance.isMissing(main_Attribute)) {\n return child_Nodes[splitController.getMostCommon()].distributionForInstance(instance);\n } else if (instance.value(main_Attribute) <= numericValues[main_Attribute.index()]) {\n return child_Nodes[0].distributionForInstance(instance); \n } else {\n return child_Nodes[1].distributionForInstance(instance); \n }\n } else {\n return child_Nodes[(int) instance.value(main_Attribute)].\n distributionForInstance(instance);\n }\n }\n }","title":""},{"docid":"4ca3514bb0635189a0e94183f55154d2","score":"0.56994253","text":"void initializeWeight() {\n if (_weight != 0)\n return;\n double max = 1.0 / (Math.sqrt(_childNode.fanIn()));\n _weight = RandomWeight.INSTANCE.nextDouble(-max, max);\n }","title":""},{"docid":"535f43fbb11fc14faf5ea69c006931fb","score":"0.5686457","text":"void doCountProbabilitiesForLeaf(NodeData node, int nSamples, boolean dprint)\n\t{\n\t\t/*\n\t\tint nTaxonID = node.m_tree.getTaxonIndex(node.m_tree.getNodeTaxon(node.m_nodeRef));\n\t\tif (nTaxonID != node.getTaxonID()) {\n\t\t\tint h =3;\n\t\t\th++;\n\t\t}\n\t\tint n = new Integer((String)node.m_tree.getTaxon(nTaxonID).getAttribute(\"totalcount\"));\n\t\tif (n != nSamples) {\n\t\t\tint h =3;\n\t\t\th++;\n\t\t\n\t\t}\n\t\t*/\n\t\t//node.m_n = nSamples;\n\t\tnode.resize(nSamples);\n//\t\tnode.m_Nb[nSamples] = 1.0;\n//\t\tif( dprint ) {\n//\t\t\tSystem.out.println(node.getNr() + \" n=\" + node.m_n + \" u1.Nb \" + Arrays.toString(node.m_Nb));\n//\t\t}\n\t}","title":""},{"docid":"d096266e5a251fce9c1e1c4f7d437d17","score":"0.5685083","text":"public void update() {\n for (int i = 0; i < numNodes; i++){\n nodes.get(i).Update();\n }\n\n if (numNodes <= 0) {\n counter -= 1;\n if (counter <= 0){\n CreateNode();\n counter = maxCounter;\n }\n }\n }","title":""},{"docid":"5652091d468ec949e3aec43f93b3564a","score":"0.5670887","text":"private void defaultWeightForEachNode() {\n for (node_data defaultedNode : this.g.getV()) {\n setWeightToDefault(defaultedNode);\n }\n }","title":""},{"docid":"3623170c9b4eaa45a8f973840e51e6fb","score":"0.5660523","text":"protected void createXNodes(){\n int divider = 200;\n\n // Menentukan jarak antar titik\n BigDecimal step = mInput.getBeamLength().divide(new BigDecimal(divider), 4, RoundingMode.HALF_EVEN);\n\n // Inisiasi TreeSet xnodes sebagai penampung titik-titik pengujian\n mXNodes = new TreeSet<>();\n\n // Mengisi TreeSet xnodes dengan titik-titik pengujian\n for(int i=0;i<=divider;i++){\n\n // Titik-titik pengujian merupakan hasil kali titik pengujian ke n , dengan step\n mXNodes.add(new BigDecimal(i).multiply(step));\n }\n\n // Memasukan titik massa beban ke TreeSet xnodes\n mXNodes.add(mInput.getForcePosition().setScale(3,RoundingMode.HALF_EVEN));\n\n // Memasukan 0.999 * titik massa beban ke TreeSet xnodes\n mXNodes.add( mInput.getForcePosition().multiply(new BigDecimal(1000)).subtract(new BigDecimal(1)).divide(new BigDecimal(1000)) );\n\n // Memasukan 0.999 * panjang beam ke TreeSet xnodes\n mXNodes.add( mInput.getBeamLength().multiply(new BigDecimal(1000)).subtract(new BigDecimal(1)).divide(new BigDecimal(1000)) );\n\n if(mInput.getSimulationID()==3){\n // Memasukan Ltx ke TreeSet xnodes\n mXNodes.add(mInput.getLTx().setScale(3,RoundingMode.HALF_EVEN));\n\n // Memasukan 0.999 * Ltx ke TreeSet xnodes\n mXNodes.add( mInput.getLTx().multiply(new BigDecimal(1000)).subtract(new BigDecimal(1)).divide(new BigDecimal(1000)) );\n }\n\n // Menguji titik-titik pengujian yang telah dibuat\n for(BigDecimal xnode: mXNodes){\n // System.out.println(xnode);\n }\n }","title":""},{"docid":"c7836032a5aa1e48ab723de77ef27bfd","score":"0.56428796","text":"int getNumberOfNodes();","title":""},{"docid":"d966f0ccafb3667d476da0fb6cb541ca","score":"0.56381315","text":"private void createRUSHTree() {\n\t\tfor (int i = 1; i <= 10; ++i) {\n\t\t\tif (this.root == null) {\n\t\t\t\tNode newNode = getNewNode();\n\t\t\t\tthis.root = newNode;\n\t\t\t} else {\n\t\t\t\tNode newNode = getNewNode();\n\t\t\t\tthis.addClusterNode(newNode);\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(\"height = \" + getHeightOfTree(this.root));\n\t}","title":""},{"docid":"f998bd0374682f8f9f82c62130413cad","score":"0.5623814","text":"private double[] getClassDistribution(myC45 node) {\n double [] dist = new double[node.dataset.numClasses()];\n Enumeration instEnum = node.dataset.enumerateInstances();\n while (instEnum.hasMoreElements()) {\n Instance inst = (Instance) instEnum.nextElement();\n dist[(int) inst.classValue()]++;\n }\n Utils.normalize(dist);\n return dist;\n }","title":""},{"docid":"88594cf03c2f543cd623795af11ad93e","score":"0.5617742","text":"protected void setMaxPrincipalStressCZeroNodes(){\n mMaxPrincipalStressCZeroNodes = new TreeMap<>();\n mMaxPrincipalStressCZeroNodesO = new TreeMap<>();\n\n for(BigDecimal n : mXNodes){\n\n // Perhitungan Average Stress di c = 0\n // (total_normal_stress_x + total_normal_stress_y)/2\n // total_normal_stress_y = 0 ( Tidak dihitung, dianggap nol )\n\n BigDecimal avgStress = new BigDecimal(1)\n .multiply(\n\n // Total Tegangan Normal Sumbu x\n // Pada c = 0 , Tegangan Normal sumbu x akibat Momen Lentur = 0\n // Sehingga yang dihitung hanya Tegangan Normal sumbu x\n mNormalStressNodes.get(n)\n\n\n // Total Tegangan Normal Sumbu y\n .add( new BigDecimal(0) )\n )\n .divide( new BigDecimal(2),12,RoundingMode.HALF_EVEN );\n\n BigDecimal maxInPlaneShearStressPow2 = new BigDecimal(1)\n .multiply(\n new BigDecimal(1)\n .multiply(\n new BigDecimal(1)\n .multiply(\n // Total Tegangan Normal Sumbu x\n // Pada c = 0 , Tegangan Normal sumbu x akibat Momen Lentur = 0\n // Sehingga yang dihitung hanya Tegangan Normal sumbu x\n mNormalStressNodes.get(n)\n\n // Total Tegangan Normal Sumbu y\n .subtract( new BigDecimal(0) )\n )\n\n // Dibagi 2\n .divide( new BigDecimal(2),12,RoundingMode.HALF_EVEN )\n )\n // Pangkat 2\n .pow(2)\n )\n .add(\n // Tegangan Geser XY di c = 0\n mShearStressNodes.get(n).pow(2)\n );\n\n try{\n BigDecimal maxInPlaneShearStress;\n\n if(maxInPlaneShearStressPow2.setScale(6,RoundingMode.FLOOR).compareTo(new BigDecimal(0.000000)) < 1)\n {\n maxInPlaneShearStress = new BigDecimal(0);\n }else{\n maxInPlaneShearStress = BigDecimalMath.sqrt(maxInPlaneShearStressPow2);\n }\n\n BigDecimal maxPrincipalStress = avgStress.add(maxInPlaneShearStress);\n\n mMaxPrincipalStressCZeroNodes.put(n,maxPrincipalStress);\n mMaxPrincipalStressCZeroNodesO.put(n, mMaxPrincipalStressCZeroNodes.get(n).setScale(3,RoundingMode.HALF_EVEN));\n //System.out.println(\"n : \"+n+\" \"+ mNormalBendingStressNodes.get(n)+\" Principal Stress c = 0 : \"+avgStress+\" + \"+maxInPlaneShearStress+\" = \"+maxPrincipalStress);\n\n if(mMaxPrincipalStressCZeroValue == null){\n mMaxPrincipalStressCZeroValue = maxPrincipalStress.abs();\n mMaxPrincipalStressCZeroLocation = n;\n }else{\n if(mMaxPrincipalStressCZeroValue.compareTo(maxPrincipalStress)<1){\n mMaxPrincipalStressCZeroValue = maxPrincipalStress.abs();\n mMaxPrincipalStressCZeroLocation = n;\n }\n }\n }catch(Exception e){\n e.printStackTrace();\n }\n\n }\n\n\n }","title":""},{"docid":"b0e036aa36cf5c71bc922e8ef242e72f","score":"0.56152874","text":"static void numberOfNodes(int s, int e)\n {\n count1[s] = 1;\n for(Integer u: adj[s])\n {\n // condition to omit reverse path\n // path from children to parent\n if(u == e)\n continue;\n \n // recursive call for DFS\n numberOfNodes(u ,s);\n \n // update count[] value of parent using \n // its children\n count1[s] += count1[u];\n }\n }","title":""},{"docid":"9f0451e265455aa1673e525833be525e","score":"0.5605676","text":"public int numNodes();","title":""},{"docid":"c16df58755a1f7cd2afa61b3028bbc8b","score":"0.560284","text":"public double getSmallWorldProperty(Graph graph){\n\t\t\t\n\t\tdouble LRand = 0;\n\t\tdouble CRand = 0;\n\t\tGraph randomGraph;\n\t\t\n\t\tfor(int j = 0; j < 100; j++){\n\t\t\trandomGraph = new SingleGraph(\"Random graph\");\n\t\t\tGenerator gen = new RandomGenerator(Toolkit.averageDegree(graph));\n\t\t\tgen.addSink(randomGraph);\n\t\t\tgen.begin();\n\t\t\tfor (int i = 0; i < graph.getNodeCount(); i++)\n\t\t\t\tgen.nextEvents();\n\t\t\tgen.end();\n\t\t\t\n\t\t\tIterator<Edge> edgeIt = randomGraph.getEdgeIterator();\n\t\t\twhile(edgeIt.hasNext()){\n\t\t\t\tEdge edge = edgeIt.next();\n\t\t\t\tedge.addAttribute(\"length\",1);\n\t\t\t}\n\t\t\n\t\t\tLRand += this.getCharacteristicPathPength(randomGraph);\n\t\t\tCRand += Toolkit.averageClusteringCoefficient(randomGraph);\n\t\t\t\n\t\t\tif(randomGraph.getNodeCount() > graph.getNodeCount()){\n\t\t\t\tint limit = randomGraph.getNodeCount()-graph.getNodeCount();\n\t\t\t\tint i= 0;\n\t\t\t\twhile(i < limit){\n\t\t\t\t\tNode node = Toolkit.randomNode(randomGraph);\n\t\t\t\t\tif(node.getDegree() > 1){\n\t\t\t\t\t\trandomGraph.removeNode(node);\n\t\t\t\t\t\ti++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(randomGraph.getEdgeCount() != graph.getEdgeCount()){\n\t\t\t\tNode node1 = null;\n\t\t\t\tNode node2 = null;\n\t\t\t\tint edgeLimit = randomGraph.getEdgeCount() - graph.getEdgeCount();\n\t\t\t\t\n\t\t\t\tif(edgeLimit < 0){\n\t\t\t\t\t//We've got to add some edges!\n\t\t\t\t\twhile(edgeLimit != 0){\n\t\t\t\t\t\twhile(node1 == node2){\n\t\t\t\t\t\t\tnode1 = Toolkit.randomNode(randomGraph);\n\t\t\t\t\t\t\tnode2 = Toolkit.randomNode(randomGraph);\t\n\t\t\t\t\t\t}\n\t\t\t\t\t\ttry{\n\t\t\t\t\t\t\trandomGraph.addEdge(String.valueOf(randomGraph.getEdgeCount()+1), node1, node2);\n\t\t\t\t\t\t\tedgeLimit +=1;\n\t\t\t\t\t\t}catch(Exception e){\n\t\t\t\t\t\t\t//bad code :( but easy code :),\n\t\t\t\t\t\t\t//You get enter this catch when trying to add an edge between two nodes that all ready exists.\n\t\t\t\t\t\t\tnode1 = null;\n\t\t\t\t\t\t\tnode2 = null;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t}else if(edgeLimit > 0){\n\t\t\t\t\t//We've got to remove some edges!\t\n\t\t\t\t\twhile(edgeLimit != 0){\n\t\t\t\t\t\tEdge edge = Toolkit.randomEdge(randomGraph);\n\t\t\t\t\t\trandomGraph.removeEdge(edge);\n\t\t\t\t\t\tedgeLimit -= 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\trandomGraph.clear();\n\t\t}\n\t\tLRand = LRand/20;\n\t\tCRand = CRand/20;\n\t\tdouble L = this.getCharacteristicPathPength(graph);\n\t\tdouble C = Toolkit.averageClusteringCoefficient(graph);\n\t\t\n\t\tdouble smallW = (C/CRand)/(L/LRand);\t\n\t\t\n\t\treturn smallW;\n\t}","title":""},{"docid":"963a224d3b24930c9db5a998d308d360","score":"0.56014454","text":"int getLevelForDist (\n double dist\n );","title":""},{"docid":"7381976d67dbb9ffcc9bbfd99d3285ce","score":"0.559398","text":"private void calculateTopLevels() {\n Queue<MutableNode> queue = wip.getNodesList().stream()\n .filter(x -> x.getIncomingEdges().isEmpty())\n .collect(Collectors.toCollection(LinkedList::new));\n\n while (!queue.isEmpty()) {\n val node = queue.poll();\n val topLevel = node.getIncomingEdges().keySet()\n .stream()\n .mapToInt(Node::getTopLevel)\n .max()\n .orElse(0) + node.getWeight();\n node.setTopLevel(topLevel);\n\n for (val node2 : node.getOutgoingEdges().keySet()) {\n queue.offer((MutableNode) node2);\n }\n }\n }","title":""},{"docid":"a09f42d6b6dbe53a342e57779836f6bd","score":"0.5588147","text":"private void initDepth(){\n Dijkstra dijkstra = new Dijkstra(Dijkstra.Element.EDGE, \"result\", null);\n dijkstra.init(tree);\n dijkstra.setSource(tree.getNode(rootId));\n dijkstra.compute();\n for(Node n:tree.getNodeSet()){\n int depth = (int)dijkstra.getPathLength(n);\n n.addAttribute(\"depth\",depth);\n //System.out.printf(\"%s->%s:%d%n\", dijkstra.getSource(), n, (int)dijkstra.getPathLength(n));\n if (depth > maxDepth) maxDepth = depth;\n if(depthMap.containsKey(depth)) depthMap.get(depth).add(n.getId());\n else{\n Set<String> temp = new HashSet<>();\n temp.add(n.getId());\n depthMap.put(depth,temp);\n }\n }\n }","title":""},{"docid":"499738e386b06d9208f84757cd081551","score":"0.55869603","text":"public int getNodesGenerated();","title":""},{"docid":"e26ad82f89629b2ec2e21e3a8439b3d4","score":"0.55572325","text":"public static void grow(DefaultMutableTreeNode node, int depth, Random rand, int maxNodes) {\r\n\r\n\t\tExpression exp = (Expression) node.getUserObject();\r\n\r\n\t\t// ako je node terminal odmah se izlazi iz funkcije\r\n\t\tif (exp.status == Status.TERMINAL) {\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tIFunction fun = (IFunction) node.getUserObject();\r\n\r\n\t\tif (node.isRoot()) {\r\n\t\t\temptySpaces = fun.getNumberOfOutputs();\r\n\t\t\tcurrentNodes = 1;\r\n\t\t}\r\n\r\n\t\t// stvaranje terminala ako je maksimalna dubina\r\n\t\tif (depth == 0 || maxNodes < currentNodes + emptySpaces) {\r\n\r\n\t\t\tfor (int i = 0; i < fun.getNumberOfOutputs(); i++) {\r\n\r\n\t\t\t\tExpression e = terminals.get(rand.nextInt(terminals.size())).duplicate();\r\n\t\t\t\tfun.addOutput(e);\r\n\t\t\t\tnode.add(new DefaultMutableTreeNode(e));\r\n\t\t\t\tcurrentNodes += 1;\r\n\t\t\t\temptySpaces -= 1;\r\n\t\t\t}\r\n\r\n\t\t\treturn;\r\n\r\n\t\t} else {\r\n\r\n\t\t\t// ako je razina != 0 onda se stvara ili terminal ili funkciju\r\n\t\t\tfor (int i = 0; i < fun.getNumberOfOutputs(); i++) {\r\n\r\n\t\t\t\tExpression e = rand.nextFloat() > 0.5 ? terminals.get(rand.nextInt(terminals.size())).duplicate()\r\n\t\t\t\t\t\t: functions.get(rand.nextInt(functions.size())).duplicate();\r\n\r\n\t\t\t\tif (maxNodes <= currentNodes + emptySpaces) {\r\n\r\n\t\t\t\t\te = terminals.get(rand.nextInt(terminals.size())).duplicate();\r\n\t\t\t\t\tfun.addOutput(e);\r\n\t\t\t\t\tnode.add(new DefaultMutableTreeNode(e));\r\n\t\t\t\t\temptySpaces -= 1;\r\n\t\t\t\t\tcurrentNodes += 1;\r\n\r\n\t\t\t\t} else {\r\n\r\n\t\t\t\t\tfun.addOutput(e);\r\n\t\t\t\t\tnode.add(new DefaultMutableTreeNode(e));\r\n\r\n\t\t\t\t\tif (e.status == Status.FUNCTION) {\r\n\t\t\t\t\t\temptySpaces += ((IFunction) e).getNumberOfOutputs();\r\n\t\t\t\t\t\temptySpaces -= 1;\r\n\t\t\t\t\t\tcurrentNodes += 1;\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\temptySpaces -= 1;\r\n\t\t\t\t\t\tcurrentNodes += 1;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t// dohvat novo dodanih cvorova\r\n\t\tEnumeration<DefaultMutableTreeNode> en = node.children();\r\n\r\n\t\t// za svaki dohvaceni cvor se rekurzivno generiraju novi cvorovi ovisno\r\n\t\t// o broju funkcija koje neki cvor moze imati i dubini na kojoj se cvor nalazi\r\n\t\twhile (en.hasMoreElements()) {\r\n\r\n\t\t\tDefaultMutableTreeNode child = en.nextElement();\r\n\r\n\t\t\tgrow(child, depth - 1, rand, maxNodes);\r\n\t\t}\r\n\t}","title":""},{"docid":"fe5523908cd43b842495a390931135ec","score":"0.5555347","text":"private double calcNodeEntropy(ArrayList<Data> data2) {\n\t\treturn 0;\n\t}","title":""},{"docid":"af5e0a3d990114187506406891bd9d42","score":"0.5553604","text":"private void createMaps() {\n\t\t//Long beginTime = System.currentTimeMillis();\n\t\tassumeGraphFinished = true;\n\n\t\t// initialize now to avoid the containsKey() checks later\n\t\tfor (NodeType node: getNodes()) \n\t\t\tdistMap.put(node, new HashMap<NodeType,Byte>());\n\n\t\tMap<NodeType,Byte> nodeDist = null; \n\t\tMap<NodeType,Byte> neighbor1Dist = null; \n\t\tMap<NodeType,Byte> neighbor2Dist = null; \n\n\t\tfor (NodeType node: getNodes()) {\n\n\t\t\tboolean distPut = false;\n\t\t\t\n\t\t\t// to minimize the number of gets\n\t\t\tnodeDist = distMap.get(node);\n\n\t\t\tfor (NodeType neighbor1: getNeighbors(node)) {\n\n\t\t\t\t// to minimize the number of gets\n\t\t\t\tneighbor1Dist = distMap.get(neighbor1);\n\n\t\t\t\tnodeDist.put(neighbor1,(byte)1);\n\t\t\t\tneighbor1Dist.put(node,(byte)1);\n\n\t\t\t\tfor (NodeType neighbor2: getNeighbors(node)) {\n\n\t\t\t\t\tif ( neighbor1 == neighbor2 )\n\t\t\t\t\t\tcontinue;\n\t\t\t\n\t\t\t\t\t// to minimize the number of gets\n\t\t\t\t\tneighbor2Dist = distMap.get(neighbor2);\n\n\t\t\t\t\t// only add new dist/prob if it hasn't already been set\n\t\t\t\t\t// if it has been set once, we know that it has been set\n\t\t\t\t\t// with the min possible value.\n\n\t\t\t\t\t// only check one direction because we always set both\n\t\t\t\t\t// at a given time.\n\n\t\t\t\t\tif ( !neighbor1Dist.containsKey(neighbor2) ) {\n\t\t\t\t\t\tneighbor1Dist.put(neighbor2,(byte)2);\n\t\t\t\t\t\tneighbor2Dist.put(neighbor1,(byte)2);\n\t\t\t\t\t}\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//Long totalTime = System.currentTimeMillis() - beginTime;\n\t\t//System.out.println(\"createMap duration: \" + totalTime + \" for size: \" + probMap.size());\n\t}","title":""},{"docid":"b565845db205ef0d8c93a44070f63d67","score":"0.5542694","text":"private void maxValueWeight() {\n\t\tCollection<node_data> nodes = g.getV();\n\t\tfor(node_data a: nodes)\n\t\t\ta.setWeight(Double.MAX_VALUE);\n\t}","title":""},{"docid":"235244ff62118497ea01627625ae3983","score":"0.55383354","text":"private void mutateLayer(Layer l, double probability, double majorprobability){\n Random random = new Random();\n for(Neuron n : l.getNeurons()){\n for(IncomingNeuron in : n.getIncominglinks()){\n int r = random.nextInt(100);\n if(r < probability){\n r = random.nextInt(100);\n if(r < majorprobability){\n double delta = (random.nextDouble()-0.5)*2*majormutationmax;\n in.setWeight(in.getWeight()+delta);\n if(delta < 0 ){neg++;}else{pos++;}\n }else{\n r = random.nextInt(100);\n if(r < 10){\n double delta = (random.nextDouble()-0.5)*2*extrememutationmax;\n in.setWeight(in.getWeight()+ delta);\n if(delta < 0 ){neg++;}else{pos++;}\n }else{\n double delta = (random.nextDouble()-0.5)*2*slightmutationmax;\n in.setWeight(in.getWeight()+ delta);\n if(delta < 0 ){neg++;}else{pos++;}\n }\n }\n }\n }\n }\n }","title":""},{"docid":"a86cd7a38f932bb692210197a5467ba5","score":"0.5533851","text":"public void setLevels() throws Exception {\n\n if(nodes.size() == 0) {\n throw new Exception(\"Nie zaladowano wezlow.\");\n }\n\n //Kolejka wezlow do etykietowania.\n List<Node> nodesToCount = new ArrayList<>();\n\n //Dla korzeni (ostatnich wezlow) ustawia poziom na 1 i dodaje poprzedników do kolejki.\n for(Node node : nodes) {\n if(node.getNextNodes().size() == 0) {\n node.setLevel(1);\n List<Node> previousNodes = node.getPreviousNodes();\n for(Node previousNode : previousNodes) {\n if(!nodesToCount.contains(previousNode)) {\n nodesToCount.add(previousNode);\n }\n }\n }\n }\n\n //Wylicza poziomy dla pozostalych wezlow.\n while(nodesToCount.size() > 0) {\n\n Node node = nodesToCount.get(0);\n int maximum = 0;\n\n //Wyznacza maksymalny poziom wsrod nastepnikow.\n List<Node> nextNodes = node.getNextNodes();\n for(Node nextNode : nextNodes) {\n if(nextNode.getLevel() > maximum) {\n maximum = nextNode.getLevel();\n }\n }\n\n node.setLevel(maximum + 1);\n\n //Dodaje kolejnych poprzednikow do kolejki.\n List<Node> previousNodes = node.getPreviousNodes();\n\n for(Node previousNode : previousNodes) {\n if(!nodesToCount.contains(previousNode)) {\n nodesToCount.add(previousNode);\n }\n }\n\n nodesToCount.remove(0);\n }\n }","title":""},{"docid":"df34a4602cdc619816839ef1f084c00a","score":"0.55308145","text":"private void constructTrees() {\n\t\tfinal HashMap<Integer, Integer> minDis = new HashMap<Integer, Integer>();\r\n\t\tint maxId = 0;\r\n\t\tfor (final Variable v : this.view.varMap.values()) {\r\n\t\t\tif (v.id > maxId) {\r\n\t\t\t\tmaxId = v.id;\r\n\t\t\t}\r\n\t\t}\r\n\t\tmaxId++;\r\n\t\tfor (final Variable v : this.view.varMap.values()) {\r\n\t\t\tif (v.fixed) {\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\tfinal ArrayList<Variable> queue = new ArrayList<Variable>();\r\n\t\t\tqueue.add(v);\r\n\t\t\tminDis.put(v.id * maxId + v.id, 0);\r\n\t\t\tfinal HashSet<Integer> visited = new HashSet<Integer>();\r\n\t\t\tvisited.add(v.id);\r\n\t\t\twhile (!queue.isEmpty()) {\r\n\t\t\t\tfinal Variable var = queue.remove(0);\r\n\t\t\t\tfor (final Constraint c : var.neighbors) {\r\n\t\t\t\t\tfinal Variable n = c.getNeighbor(var);\r\n\t\t\t\t\tif (n.fixed) {\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (!visited.contains(n.id)) {\r\n\t\t\t\t\t\tqueue.add(n);\r\n\t\t\t\t\t\tfinal int depth = minDis.get(v.id * maxId + var.id);\r\n\t\t\t\t\t\tvisited.add(n.id);\r\n\t\t\t\t\t\tminDis.put(v.id * maxId + n.id, depth + 1);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfinal HashSet<Integer> pSet = new HashSet<Integer>();\r\n\t\tfinal HashSet<Integer> cSet = new HashSet<Integer>();\r\n\t\tfor (final Constraint c : this.self.neighbors) {\r\n\t\t\tfinal Variable n = c.getNeighbor(this.self);\r\n\t\t\tif (!n.fixed) {\r\n\t\t\t\tcSet.add(n.id);\r\n\t\t\t}\r\n\t\t}\r\n\t\tthis.enumerate(pSet, cSet, minDis, maxId);\r\n\t}","title":""},{"docid":"5e51e995b554cfe5dd4bab08816e0552","score":"0.5521069","text":"public static void check(){\n Digraph g = new Digraph(13);\n g.addEdge(4, 2);\n g.addEdge(2, 3);\n g.addEdge(3, 2);\n g.addEdge(6, 0);\n g.addEdge(0, 1);\n g.addEdge(2, 0);\n g.addEdge(11, 12);\n g.addEdge(12, 9);\n g.addEdge(9, 10);\n g.addEdge(9, 11);\n g.addEdge(7, 9);\n g.addEdge(10, 12);\n g.addEdge(11, 4);\n g.addEdge(4, 3);\n g.addEdge(3, 5);\n g.addEdge(6, 8);\n g.addEdge(8, 6);\n g.addEdge(5, 4);\n g.addEdge(0, 5);\n g.addEdge(6, 4);\n g.addEdge(6, 9);\n g.addEdge(7, 6);\n\n BreadthFirstPaths bfp = new BreadthFirstPaths(g, 0);\n StdOut.printf(\"From 0 to %d: %d\\n\", 0, bfp.distTo(0));\n StdOut.printf(\"From 0 to %d: %d\\n\", 1, bfp.distTo(1));\n StdOut.printf(\"From 0 to %d: %d\\n\", 2, bfp.distTo(2));\n StdOut.printf(\"From 0 to %d: %d\\n\", 3, bfp.distTo(3));\n StdOut.printf(\"From 0 to %d: %d\\n\", 4, bfp.distTo(4));\n StdOut.printf(\"From 0 to %d: %d\\n\", 5, bfp.distTo(5));\n StdOut.printf(\"From 0 to %d: %d\\n\", 6, bfp.distTo(6));\n StdOut.printf(\"From 0 to %d: %d\\n\", 8, bfp.distTo(8));\n StdOut.printf(\"From 0 to %d: %d\\n\", 9, bfp.distTo(9));\n StdOut.printf(\"From 0 to %d: %d\\n\", 10, bfp.distTo(10));\n StdOut.printf(\"From 0 to %d: %d\\n\\n\", 11, bfp.distTo(11));\n\n BreadthFirstPaths bfp1 = new BreadthFirstPaths(g, 7);\n StdOut.printf(\"From 7 to %d: %d\\n\", 0, bfp1.distTo(0));\n StdOut.printf(\"From 7 to %d: %d\\n\", 1, bfp1.distTo(1));\n StdOut.printf(\"From 7 to %d: %d\\n\", 6, bfp1.distTo(6));\n StdOut.printf(\"From 7 to %d: %d\\n\", 8, bfp1.distTo(8));\n StdOut.printf(\"From 7 to %d: %d\\n\", 12, bfp1.distTo(12));\n }","title":""},{"docid":"f4f9d5d5b55e4d5eff15ae29cdc1c84f","score":"0.5502089","text":"public void doGenerate() {\r\n\r\n\tint n = (int) getLongParameter(pN.name);\r\n\tlong dimSize = getLongParameter(pDimSize.name);\r\n\r\n\tboolean hasMore = true;\r\n\tint currNode[] = new int[n];\r\n\r\n\t// Set the index in each dimension to be 0 first\r\n\tfor (int i = 0; i < n; i++)\r\n\t currNode[i] = 0;\r\n\r\n\t// Systematically loop through all nodes indexed by their\r\n\t// position in the n-dimensional grid, adding edges\r\n\t// between adjacent nodes\r\n\twhile (hasMore) {\r\n\r\n\t // First find the next node\r\n\t for (int i = 0; i < n; i++) {\r\n\t\tif (currNode[i] < dimSize - 1) {\r\n\t\t currNode[i]++;\r\n\t\t break;\r\n\t\t} else {\r\n\t\t currNode[i] = 0;\r\n\t\t if(i == n - 1)\r\n\t\t\thasMore = false;\r\n\t\t}\r\n\t }\r\n\r\n\t int node1 = translateIndices(currNode, dimSize, n);\r\n\r\n\t // Now add one to each dimension in the node and\r\n\t // add edges back and forth\r\n\t for (int i = 0; i < n; i++) {\r\n\t\tif (currNode[i] + 1 < dimSize) {\r\n\t\t currNode[i]++;\r\n\t\t int node2 = translateIndices(currNode, dimSize, n);\r\n\r\n\t\t // Add the edges to the graph\r\n\t\t addEdge(node1, node2);\r\n\t\t addEdge(node2, node1);\r\n\r\n\t\t // Reset currNode to the currentNode\r\n\t\t currNode[i]--;\r\n\t\t}\r\n\t }\r\n\t}\r\n }","title":""},{"docid":"ab97e1f704a23d65997f9025bfb716b9","score":"0.54845965","text":"protected abstract void addNodes(Node root, double factor, Collection<Node> nodes,\n Snapshot snapshot, String selectedLabel, boolean takeSnapshot);","title":""},{"docid":"c36d578bacd77e2f1837184540e443ee","score":"0.54802424","text":"int getNodesCount();","title":""},{"docid":"689416931aff71f8720a1f27b33e1c48","score":"0.5471129","text":"protected int weight( Node n )\n { return n.isConcrete() ? 0 : n.equals( Node.ANY ) ? 5 : bound.contains( n ) ? 1 : 4; }","title":""},{"docid":"5fe1e2bebf7c2511c0295e56a79e2d47","score":"0.5464879","text":"public static void simulate() {\n\t\t\n\t\t// Build a list of non evidence node!\n\t\tArrayList<BNNode> nonEvidenceNodes = new ArrayList<>();\n\t\tfor (BNNode node : BNNode.nodes) {\n\t\t\tif (!node.isEvidence) {\n\t\t\t\tnonEvidenceNodes.add(node);\n\t\t\t}\n\t\t}\n\t\t\n\t\t// Randomly assign them. Initialization does not really matter!\n\t\tRandom random = new Random();\n\t\tfor (BNNode node : nonEvidenceNodes) {\n\t\t\tnode.value = random.nextBoolean();\n\t\t}\n\t\t\n\t\t// Initialize the statistic variables\n\t\tint totalNENs = nonEvidenceNodes.size();\n\t\tint[] trueCounts = new int[totalNENs];\n\t\tdouble[] totalCPs = new double[totalNENs];\n\t\t\n\t\t// For each iterations\n\t\tfor (int i= 0; i < iterations; i++) {\n\t\t\t\n\t\t\t// Loop through non evidence node and update!\n\t\t\t// For each non evidence node index ..\n\t\t\tfor (int j = 0; j < totalNENs; j++) {\n\t\t\t\tBNNode node = nonEvidenceNodes.get(j);\n\t\t\t\t// Set the node to true\n\t\t\t\tnode.value = true;\n\t\t\t\t// Compute CPT entry (without normalizaing constant). (CPT Return the probs that the node is true)\n\t\t\t\tdouble trueCP = node.cptLookup();\n\t\t\t\t\n\t\t\t\t// For each child\n\t\t\t\tfor (int k = 0; k < node.children.length; k++) {\n\t\t\t\t\t// Multiply this child CPT entry (or 1 minus that if the child is false)\n\t\t\t\t\tif (node.children[k].value) { \n\t\t\t\t\t\ttrueCP *= node.children[k].cptLookup();\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttrueCP *= (1 - node.children[k].cptLookup());\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Set the node to false\n\t\t\t\tnode.value = false;\n\t\t\t\t// Compute CPT entry (without normalizaing constant). (CPT Return the probs that the node is true)\n\t\t\t\tdouble falseCP = 1 - node.cptLookup();\n\t\t\t\t\n\t\t\t\t// For each child\n\t\t\t\tfor (int k = 0; k < node.children.length; k++) {\n\t\t\t\t\t// Multiply this child CPT entry (or 1 minus that if the child is false)\n\t\t\t\t\tif (node.children[k].value) { \n\t\t\t\t\t\tfalseCP *= node.children[k].cptLookup();\n\t\t\t\t\t} else {\n\t\t\t\t\t\tfalseCP *= (1 - node.children[k].cptLookup());\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Computing normalization to get the probability of the node being true ...\n\t\t\t\tdouble normalizationSum = trueCP + falseCP;\n\t\t\t\ttrueCP /= normalizationSum;\n\t\t\t\tfalseCP /= normalizationSum;\n\t\t\t\t// .. add this to the conditional probs total for that node ...\n\t\t\t\ttotalCPs[j] += trueCP;\n\t\t\t\t// ... pick a new random variable value for the node according to that probs.\n\t\t\t\tnode.value = random.nextDouble() < trueCP;\n\t\t\t\t// ... and tally the assignment if it's true!\n\t\t\t\tif (node.value) {\n\t\t\t\t\ttrueCounts[j] ++;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\t// Report estimates with given frequency!\n\t\t\tif ((i + 1) % reportFrequency == 0 || i == iterations - 1) {\n\t\t\t\tSystem.out.println(\"__________________________________\");\n\t\t\t\tSystem.out.println(\"After iteration \" + (i + 1) + \":\");\n\t\t\t\tSystem.out.println(\"Variable, Average Conditional Probability, Fraction True\");\n\t\t\t\tfor (int j = 0; j < totalNENs; j++) {\n\t\t\t\t\tBNNode node = nonEvidenceNodes.get(j);\n\t\t\t\t\tSystem.out.println(node.name + \", \" + totalCPs[j] / (i + 1) + \", \"\n\t\t\t\t\t\t\t+ trueCounts[j] / ((double) i + 1));\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\t\n\t}","title":""},{"docid":"7a924b5354d4a179e300209a6586aafa","score":"0.5459062","text":"public void updateFitness() {\r\n\t\tnew Level(this.m_grid).init_neighbors();\r\n\t\tint fitness = 0;\r\n\t\tfor (int i = 0; i < this.m_grid.length; i++) {\r\n\t\t\tfor (int y = 0; y < this.m_grid[0].length; y++) {\r\n\t\t\t\tfitness += this.m_grid[i][y].numberOfConnection();\r\n\t\t\t}\r\n\t\t}\r\n\t\tthis.m_fitness = fitness;\r\n\t}","title":""},{"docid":"b2f47dbb124b8685aaac4f0391fb0b9c","score":"0.5452123","text":"public void run() {\n\t\tPopulation population = new Population(population_size);\r\n\r\n\t\t// Determine fitness for each child in population\r\n\t\tfor (int i = 0; i < population_size; i++) {\r\n\t\t\tIndividual child = population.getIndividual(i);\r\n\t\t\tdouble fitness = (double) evaluation_.evaluate(child.genome);\r\n\r\n\t\t\tchild.setFitness(fitness);\r\n\t\t\tevals++;\r\n\t\t}\r\n\r\n\t\t// Sort algorithm that sorts the children on fitness from min to max.\r\n\t\tpopulation.sort(population_size);\r\n\r\n\r\n\t\tCluster clusters = new Cluster(num_of_clusters);\r\n\t\tif (use_k_means){\r\n\t\t\tclusters.cluster_convergence(population);\r\n\t\t}\r\n\r\n\t\t// Cluster cluster = new Cluster(num_of_clusters);\r\n\r\n\r\n\t\t// // Initialize random individuals that function as the initial cluster means\r\n\t\t// double clusters[][] = create_population(num_of_clusters);\r\n\t\t// cluster_count_array = new int[num_of_clusters];\r\n\t\t// for (int i = 0; i < num_of_clusters; i++){\r\n\t\t// \tcluster_count_array[i] = 0;\r\n\t\t// }\r\n\t\t//\r\n\t\t// if (use_k_means){\r\n\t\t//\r\n\t\t// \t\t\t// Arange population to clusters\r\n\t\t// \t\t\tint max_cluster_iterations = 10;\r\n\t\t// \t\t\tint iterations_counter = 0;\r\n\t\t// \t\t\tint correction_counter;\r\n\t\t// \t\t\tdo {\r\n\t\t// \t\t\t\titerations_counter++;\r\n\t\t// \t\t\t\t// Create copy of clusters\r\n\t\t// \t\t\t\tdouble[][] clusters_clone = new double[num_of_clusters][10];\r\n\t\t// \t\t\t\tfor (int i = 0; i < num_of_clusters; i++){\r\n\t\t// \t\t\t\t\tclusters_clone[i] = Arrays.copyOf(clusters[i],clusters[i].length);\r\n\t\t// \t\t\t\t}\r\n\t\t// \t\t\t\t// Arange all individuals of population to a certain cluster\r\n\t\t// \t\t\t\tsurvival_chances = arange_children_to_clusters(population, survival_chances, clusters);\r\n\t\t// \t\t\t\t// Rearange clusters by recalculating the mean\r\n\t\t// \t\t\t\tclusters = rearrange_clusters(population, survival_chances, clusters);\r\n\t\t//\r\n\t\t//\r\n\t\t// \t\t\t\tSystem.out.println(Arrays.toString(clusters[0]));\r\n\t\t// \t\t\t\tSystem.out.println(Arrays.toString(clusters_clone[0]));\r\n\t\t// \t\t\t\tSystem.out.println(\"\\n\");\r\n\t\t//\r\n\t\t// \t\t\t\tcorrection_counter = 0;\r\n\t\t// \t\t\t\tfor (int i = 0; i < num_of_clusters; i++){\r\n\t\t// \t\t\t\t\tif (Arrays.equals(clusters_clone[i],clusters[i])){\r\n\t\t// \t\t\t\t\t\tcorrection_counter++;\r\n\t\t// \t\t\t\t\t}\r\n\t\t// \t\t\t\t}\r\n\t\t// \t\t\t} while (iterations_counter < max_cluster_iterations || correction_counter != num_of_clusters);\r\n\t\t// \t\t}\r\n\r\n\t\twhile (evals < evaluations_limit_) {\r\n\r\n\t\t\tIndividual old_best_person = population.getIndividual(population_size - 1);\r\n\r\n\t\t\t// Select who are going to be parents.\r\n\t\t\tPopulation parents = population.tournament_selection(amount_parents, population_size, tournament_size, clusters);\r\n\r\n\t\t\t// Guarantee that the best individual reproduces\r\n\t\t\t// parents[parents.length-1] = sorted_survival_chances[sorted_survival_chances.length-1];\r\n\t\t\tSystem.out.println(parents.pop_size);\r\n\t\t\tparents.getIndividual(0).getCluster();\r\n\t\t\tif (use_k_means) {\r\n\t\t\t\tif (mutate_big) {\r\n\t\t\t\t\tRandom random = new Random();\r\n\t\t\t\t\tint r = random.nextInt(num_of_clusters-1)+1;\r\n\t\t\t\t\tSystem.out.println(\"randomised\");\r\n\t\t\t\t\tSystem.out.println(r);\r\n\t\t\t\t\tint parents_counter = 0;\r\n\t\t\t\t\tfor (int i = 0; i < population.pop_size; i++) {\r\n\t\t\t\t\t\tif(population.getIndividual(i).getCluster() == r){\r\n\t\t\t\t\t\t\tSystem.out.println(parents.pop_size);\r\n\t\t\t\t\t\t\tparents.setIndividual(parents_counter, population.getIndividual(i));\r\n\t\t\t\t\t\t\tparents_counter++;\r\n\t\t\t\t\t\t\tif(parents_counter > parents.pop_size){\r\n\t\t\t\t\t\t\t\tparents_counter = 0;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\t// Increase cluster counts with a punishment to speed up the neighbourhood exploration proces.\r\n\t\t\t\t\tclusters.cluster_count_array[r] = clusters.cluster_count_array[r] + 2*parents.pop_size;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\r\n\t\t\tPopulation new_children = new Population(amount_parents);\r\n\r\n\t\t\tif (multiple_parents) {\r\n\t\t\t\tnew_children = create_children_from_multiple_parents(parents, amount_parents);\r\n\t\t\t} else {\r\n\t\t\t\tnew_children = create_n_children(parents, amount_parents);\r\n\t\t\t}\r\n\r\n\t\t\tif (mutate_big) {\r\n\t\t\t\tdouble chance = get_random_double(0, 1);\r\n\t\t\t\tif (chance < 0.5) {\r\n\t\t\t\t\tnew_children = inversion_mutation(new_children);\r\n\t\t\t\t} else {\r\n\t\t\t\t\tnew_children = insertion_mutation(new_children);\r\n\t\t\t\t}\r\n\t\t\t} else {\r\n\t\t\t\tnew_children = small_mutation(new_children, num_of_mutations);\r\n\t\t\t}\r\n\t\t\tpopulation.replace_worst(new_children, multiple_parents, amount_parents);\r\n\t\t\t// population = survivor_selection(sorted_survival_chances, population, new_children);\r\n\r\n\t\t\t// Score new_children\r\n\t\t\tfor (int i = 0; i < amount_parents; i ++) {\r\n\t\t\t\tIndividual child = new_children.getIndividual(i);\r\n\t\t\t\tdouble fitness = (double) evaluation_.evaluate(child.genome);\r\n\t\t\t\tchild.setFitness(fitness);\r\n\t\t\t\tevals++;\r\n\t\t\t}\r\n\r\n\t\t\t// Sort population\r\n\t\t\tpopulation.sort(population_size);\r\n\r\n\t\t\tIndividual new_best_person = population.getIndividual(population_size - 1);\r\n\r\n\t\t\t// If there's no new best score for \"num_of_unchanged_best\", perform bigger mutations on the children\r\n\t\t\tif (new_best_person == old_best_person) {\r\n\t\t\t\tnum_of_unchanged_best ++;\r\n\t\t\t\tif (num_of_unchanged_best == max_of_unchanged_best){\r\n\t\t\t\t\tmutate_big = true;\r\n\t\t\t\t}\r\n\t\t\t} else {\r\n\t\t\t\tnum_of_unchanged_best = 0;\r\n\t\t\t\tmutate_big = false;\r\n\t\t\t}\r\n\r\n\t\t\t// Run for python plot code\r\n\t\t\tprint_average_score(population, population_size);\r\n\t\t}\r\n\r\n\t\t// System.out.println(\"SWAG\");\r\n\t\t// int least_used_cluster_index = 0;\r\n\t\t// System.out.println(cluster_count_array[0]);\r\n\t\t// for(int i = 1; i < num_of_clusters; i++) {\r\n\t\t// \tSystem.out.println(cluster_count_array[i]);\r\n\t\t// \tif (cluster_count_array[i] < cluster_count_array[least_used_cluster_index]) {\r\n\t\t// \t\tleast_used_cluster_index = i;\r\n\t\t// \t}\r\n\t\t// }\r\n\t\t// System.out.println(least_used_cluster_index);\r\n\t\t// // survival_chances = arange_children_to_clusters(population, survival_chances, clusters);\r\n\t\t// // for (int i = 0; i < survival_chances.length; i++) {\r\n\t\t// // \tSystem.out.println(Arrays.toString(sorted_survival_chances[i]));\r\n\t\t// // clusters = rearrange_clusters(population, survival_chances, clusters);\r\n\t\t//\r\n\t\t// // for (int i = 0; i < clusters.length; i++) {\r\n\t\t// // \tSystem.out.print(i);\r\n\t\t// // \tSystem.out.println(Arrays.toString(clusters[i]));\r\n\t\t// for (int c2 = 0; c2 < clusters.length; c2++){\r\n\t\t// \tfor (int c = 0; c < population.length; c++){\r\n\t\t// \t\tif ((int) sorted_survival_chances[c][2] == c2){\r\n\t\t// \t\t\tSystem.out.println(Arrays.toString(sorted_survival_chances[c]));\r\n\t\t// \t\t}\r\n\t\t// \t}\r\n\t\t// }\r\n\r\n\r\n\t}","title":""},{"docid":"cebbade0da435e7c82df5527ca3887fc","score":"0.5416567","text":"protected void generateLevel() {\r\n\r\n\t\t}","title":""},{"docid":"5c049330c93db4a6df4a89de2813b83b","score":"0.54083824","text":"@Override\n public int nodeSize() {\n return this.nodes_of_graph.size();\n }","title":""},{"docid":"4aec006b45ab69a3a2cdc718f5b9bcec","score":"0.5408375","text":"public static void main(String[] args) {\n\t\tNode n1 = new Node(10);\n\n\t\tNode n2 = new Node(5);\n\n\t\tNode n3 = new Node(50);\n\n\t\tNode n4 = new Node(1);\n\n\t\tNode n5 = new Node(40);\n\n\t\tNode n6 = new Node(100);\n\n\t\tn1.setLeft(n2);\n\n\t\tn1.setRight(n3);\n\n\t\tn2.setLeft(n4);\n\n\t\tn3.setRight(n5);\n\n\t\tn3.setLeft(n6);\n\t\t\n\t\tSystem.out.println(getCount(n1, 5, 45));\n\n\t}","title":""},{"docid":"63a464b52b45fe6ad8d4fad890cb8f71","score":"0.5399008","text":"public void initialize(){\r\n\t\tP = new HashSet<>();\r\n\t\tS = new HashSet<>();\r\n\t\tL = new HashMap<>();\r\n\t\tPR = new HashMap<>();\r\n\t\tperplexity = new ArrayList<>();\r\n\t\tN = M.size();\r\n\t\tfor(int node: M.keySet()) {\r\n\t\t\tL.put(node, 0);\r\n\t\t}\r\n\t\tfor(int node: M.keySet()) {\r\n\t\t\tP.add(node);\r\n\t\t\tif(M.get(node).isEmpty()) {\r\n\t\t\t\tS.add(node);\r\n\t\t\t}\r\n\t\t\tfor(int q: M.get(node)) {\t//q = countLinkOut\r\n\t\t\t\tL.put(q, L.get(q)+1);\r\n\t\t\t}\r\n\t\t\tPR.put(node, 1.0/N);\r\n\t\t}\r\n\t\ttest();\r\n\t}","title":""},{"docid":"c105f9c8dc94bf5720a0df0d4aade324","score":"0.5394164","text":"protected void generateLevel() {\r\n\t\t\r\n\t}","title":""},{"docid":"002b2f5b9782bceea5142db682017583","score":"0.53825206","text":"private void goDeeper() {\n\t\tthis.scaling *= config.getVerticalScaleFactor();\n\t}","title":""},{"docid":"41fa1ec4859883cf32133f997fed8840","score":"0.5380675","text":"private static InstanceNode[] max_dpa(int numNodes, int degree, int maxValue, int maxDegree, int minDistance, int communicationRadius) {\r\n\t\tdouble r = Math.sqrt((degree * Math.pow((maxValue*2), 2))/((numNodes-1)*Math.PI)) + 15;\t\t\r\n\r\n\t\tInstanceNode[] nodes = new InstanceNode[0];\r\n\r\n\t\t//\t\twhile (!connected) {\r\n\t\tint x = (int) ((Math.random() * (maxValue*2)) - maxValue);\r\n\t\tint y = (int) ((Math.random() * (maxValue*2)) - maxValue);\r\n\r\n\t\tArrayList<InstanceNode> set = new ArrayList<InstanceNode>();\r\n\r\n\t\tInstanceNode p1 = new InstanceNode();\r\n\t\tp1.node = 1;\r\n\t\tp1.x_coord = x;\r\n\t\tp1.y_coord = y;\r\n\t\tp1.battery = 0; //Temporarily use to record degree\r\n\t\tp1.demand = 1;\r\n\r\n\t\tset.add(p1);\r\n\r\n\t\tfor (int k = 2; k<=numNodes+1; k++) {\r\n\t\t\tboolean placed = false;\r\n\r\n\t\t\twhile (!placed) {\r\n\t\t\t\tx = (int) ((Math.random() * (maxValue*2)) - maxValue);\r\n\t\t\t\ty = (int) ((Math.random() * (maxValue*2)) - maxValue);\r\n\r\n\t\t\t\tInstanceNode newNode = new InstanceNode();\r\n\t\t\t\tnewNode.node = k;\r\n\t\t\t\tnewNode.x_coord = x;\r\n\t\t\t\tnewNode.y_coord = y;\r\n\t\t\t\tnewNode.demand = 1;\r\n\t\t\t\tnewNode.battery = 0;\r\n\r\n\t\t\t\tArrayList<Integer> degreeUp = new ArrayList<Integer>();\r\n\r\n\t\t\t\tboolean proximityTest = false;\r\n\t\t\t\tboolean degreeTest = true;\r\n\t\t\t\tfor (int i = 0; i< set.size(); i++) {\r\n\t\t\t\t\tif (newNode.getDistance(set.get(i)) <= r && newNode.getDistance(set.get(i)) > minDistance) {\r\n\t\t\t\t\t\tproximityTest = true;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (newNode.getDistance(set.get(i)) <= communicationRadius && set.get(i).battery < maxDegree) {\r\n\t\t\t\t\t\tif (set.get(i).battery < maxDegree) {\r\n\t\t\t\t\t\t\tdegreeUp.add(i);\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\tdegreeTest = false;\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t} \r\n\t\t\t\t}\r\n\r\n\t\t\t\tplaced = proximityTest && degreeTest;\r\n\r\n\t\t\t\tif (placed) {\r\n\t\t\t\t\tfor(int i = 0; i < degreeUp.size(); i++) {\r\n\t\t\t\t\t\tset.get(degreeUp.get(i)).battery++;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tnewNode.battery = degreeUp.size();\r\n\t\t\t\t\tset.add(newNode);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tnodes = set.toArray(new InstanceNode[0]);\r\n\t\t//\t\t\tconnected = true;\r\n\t\t//\t\t\t//Other stuff in the original algorithm goes here. Seeing how this performs without the check at the end\r\n\t\t//\t\t}\r\n\r\n\t\tfor (int i = 0; i < nodes.length; i++) {\r\n\t\t\tnodes[i].battery = (int) Math.floor(((Math.random()*100 + 1)));\r\n\t\t}\r\n\r\n\t\treturn nodes;\r\n\t}","title":""},{"docid":"776168172b00f0439224cdafa398d4aa","score":"0.5369961","text":"public final int getNodeFactor() {\n\t\treturn nodeFactor;\n\t}","title":""},{"docid":"541ab7d1f9a945be303e9c0ac5d4c2c7","score":"0.5368098","text":"private void updateDepth() {\n this.depth = (int) (Math.log(size) / Math.log(2));\n }","title":""},{"docid":"7d9f646b78c0609a7e518bdd4b132f79","score":"0.5366353","text":"private void buildMap() {\n\t\tRandom rand = new Random();\r\n\t\tmap = new Node[this.height][this.width]; // an Array of Array of Nodes\r\n\t\tint maxPercentage = 100;\r\n\t\t\r\n\t\tfor (int i = 0; i < height; i++) {\r\n\t\t\tfor (int j = 0; j < width; j++) {\r\n\t\t\t\tint num = rand.nextInt(maxPercentage);\r\n\t\t\t\tif (num <= getPercent()) {\r\n\t\t\t\t\tmap[i][j] = new Node(false, j, i);\r\n\t\t\t\t}\r\n\t\t\t\telse {\r\n\t\t\t\t\tmap[i][j] = new Node(true, j, i);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tboatTreasureGenerator();\r\n\t\t\r\n\t}","title":""},{"docid":"bf442228272ab3d9f2169e0c746adfb4","score":"0.53625214","text":"protected void updateInternalNodesWeightsPreOrder() {\n if (internalNodes.size() == 0) {\n return;\n }\n try {\n for (MultiSwitchWildcardPattern mswp : internalNodes.values()) {\n //find children\n WildcardPattern left = mswp.getWildcardPattern().clone().goDown(false);\n WildcardPattern right = mswp.getWildcardPattern().clone().goDown(true);\n MultiSwitchWildcardPattern leftMswp = monitors.get(left);\n if (leftMswp == null) {\n leftMswp = internalNodes.get(left);\n }\n MultiSwitchWildcardPattern rightMswp = monitors.get(right);\n if (rightMswp == null) {\n rightMswp = internalNodes.get(right);\n }\n\n //add their weight\n mswp.setWeight(leftMswp.getWeight() + rightMswp.getWeight());\n }\n } catch (WildcardPattern.InvalidWildCardValue invalidWildCardValue) {\n //as it is only internal nodes this exception should not happen\n invalidWildCardValue.printStackTrace();\n }\n }","title":""},{"docid":"9f04ea7102067bc1f13ac1b5848e23ca","score":"0.53603345","text":"private void initialise() {\n List<DAGNode> nodes = new ArrayList<>();\n nodes.add(root);\n hashedNodes.put(root.toString(), root);\n\n int index = 0;\n int counter = 0;\n long totalCombinations = kAnonymity.getDataset().getTaxonomyTreeCombinations();\n\n // While there are nodes we have no checked. The size increases as we find more\n while (index < nodes.size()) {\n counter++;\n if (counter % 10 == 0) {\n System.out.print(\"\\rGenerating all combinations: \" + (100 * counter / totalCombinations) + \"%\" );\n }\n DAGNode current = nodes.get(index);\n\n // For each of the attributes in the generalisation\n List<FullDomainLevel> generalisations = current.getGeneralisations();\n for (int i = 0; i < generalisations.size(); i++) {\n FullDomainLevel generalisation = generalisations.get(i);\n Tree tree = generalisation.getTree();\n int level = generalisation.getLevel();\n\n // If the level can be generalised further, do it and add it to the DAG\n if (level > 0) {\n List<FullDomainLevel> nextGens = new ArrayList<>(generalisations);\n FullDomainLevel nextGen = new FullDomainLevel(tree, level - 1);\n nextGens.set(i, nextGen);\n DAGNode next = findNode(nodes, new DAGNode(nextGens));\n current.addChild(next);\n }\n }\n\n index++;\n }\n\n System.out.println(\"\\rFinished Generating the directed acyclic graph (DAG) node connections! In total generated \" + counter + \"/\" + totalCombinations + \" necessary combinations.\");\n }","title":""},{"docid":"3f38be3dd0c0b0523d35aa62e4a4a633","score":"0.53450567","text":"public void updateLevel() {\n for(Entity each : entities) {\n for(Obstacle block : obstacles) {\n if(!block.hasCollided((Node) each)) {\n each.setCenterX(each.getCenterX()+5);\n }\n }\n }\n }","title":""},{"docid":"99ccb47eef71f6a72d1717b27f64a0ce","score":"0.5327293","text":"private void calculateBottomLevels() {\n Queue<Node> queue = new ArrayDeque<>();\n\n // Add all the exit nodes\n for (Node n : nodes.values()) {\n if (!children.containsKey(n) || children.get(n).isEmpty()) {\n queue.add(n);\n bottomLevels.put(n, n.getCost());\n }\n }\n\n while (!queue.isEmpty()) {\n Node node = queue.poll();\n int cost = bottomLevels.get(node);\n\n for (Node n : parents.get(node)) {\n int newCost = n.getCost() + cost;\n int currentCost = 0;\n if (bottomLevels.containsKey(n))\n currentCost = bottomLevels.get(n);\n\n if (newCost > currentCost) {\n bottomLevels.put(n, newCost);\n queue.add(n);\n }\n }\n }\n }","title":""},{"docid":"ff32118d6992da5c5e268f52225c3819","score":"0.5327011","text":"public void chebyshevNodes() {\n for (int i = 0; i < nodes[0].length; i++)\n nodes[0][i] = Math.cos( (double) (2*i + 1) / (2*(nodes[0].length)) * Math.PI);\n }","title":""},{"docid":"ac840b40159554e1de318fa78a1af49c","score":"0.5325946","text":"public void setTasksPerLevel(LinkedList<int[]> tasksPerLevel){\n this.tasksPerLevel = tasksPerLevel;\n }","title":""},{"docid":"abebec889c74d676dba289d1b0826797","score":"0.5325315","text":"void createEdges() {\n \t\n \tfor(int i=0; i<map.keySet().size()*1.3; i++) {\n \t\tgraph.addEdge(new Double(Math.random()), randomNodo(), randomNodo(), EdgeType.DIRECTED);\n \t}\n }","title":""},{"docid":"fff6be743848dd52a6cc01d808fe7130","score":"0.53101325","text":"public void updateAllNodeAttribute() {\r\n\t\tArrayList<Node> arr = new ArrayList<Node>();\r\n\t\tarr = collectAllNodes(root, arr);\r\n\t\tfor (int i = 0; i < arr.size(); i++) {\r\n\t\t\tarr.get(i).nodeSize = getSize(arr.get(i));\r\n\t\t\tarr.get(i).nodeHeight = getHeight(arr.get(i));\r\n\t\t}\r\n\t}","title":""},{"docid":"928d65a0706f9c2d735b0b05e89b9619","score":"0.53082824","text":"private void kruskal() {\n\t\tDisjointSet.makeset(nodelist);\n\t\tComparator<UndirectedEdge> comparator;\n\t\tcomparator = new Comparator<UndirectedEdge>() {\n\n\t\t\t@Override\n\t\t\tpublic int compare(UndirectedEdge o1, UndirectedEdge o2) {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\treturn o1.getWeight() - o2.getWeight();\n\t\t\t}\n\t\t};\n\n\t\tCollections.sort(edgelist, comparator);\n\t\tint cost = 0;\n\t\tfor (UndirectedEdge edge : edgelist) {\n\t\t\tWeightedNode first = edge.getFirst();\n\t\t\tWeightedNode sec = edge.getSecond();\n\t\t\tif (!DisjointSet.findSet(first).equals(DisjointSet.findSet(sec))) {\n\t\t\t\tDisjointSet.union(first, sec);\n\t\t\t\tcost += edge.getWeight();\n\t\t\t\tSystem.out.println(\"Taken \" + edge);\n\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(\"total cost is : \" + cost);\n\n\t}","title":""},{"docid":"0df449817476b3c37fcc41aad50c5d12","score":"0.53041536","text":"public Individual(int nodeAmount, int inputAmount, int outputAmount, int functionSet, int levelsBack) {\r\n\t\tthis.inputAmount = inputAmount;\r\n\t\tthis.functionSet = functionSet;\r\n\t\tthis.levelsBack = levelsBack;\r\n\r\n\t\tnodes = new ArrayList<>();\r\n\t\tfor (int i = 0; i < nodeAmount; i++) {\r\n\t\t\tint function;\r\n\t\t\tint input1;\r\n\t\t\tint input2;\r\n\t\t\tfunction = ThreadLocalRandom.current().nextInt(1, Functions.getNrFunctions(functionSet) + 1);\r\n\r\n\t\t\tif (levelsBack <= 0) {\r\n\t\t\t\t// i = current position of Node\r\n\t\t\t\t// inputAmout + i = adress of current Node\r\n\t\t\t\t// upper Bound of ThreadLocalRandom.current().nextInt is\r\n\t\t\t\t// exclusive!\r\n\t\t\t\tinput1 = ThreadLocalRandom.current().nextInt(0, inputAmount + i);\r\n\t\t\t\tinput2 = ThreadLocalRandom.current().nextInt(0, inputAmount + i);\r\n\t\t\t} else {\r\n\t\t\t\tint currentlevelsBackMax = levelsBack;\r\n\t\t\t\tif (currentlevelsBackMax >= i)\r\n\t\t\t\t\tcurrentlevelsBackMax = i;\r\n\r\n\t\t\t\tinput1 = ThreadLocalRandom.current().nextInt(0, inputAmount + currentlevelsBackMax);\r\n\t\t\t\tif (input1 >= inputAmount) {\r\n\t\t\t\t\t// input now only contains the chosen levelsBack-value\r\n\t\t\t\t\tinput1 -= inputAmount;\r\n\t\t\t\t\t// get the node-adress of the referenced node, relative to\r\n\t\t\t\t\t// the current one\r\n\t\t\t\t\t// position of the current node = inputAmount + i\r\n\t\t\t\t\tinput1 = inputAmount + i - input1 - 1;\r\n\t\t\t\t}\r\n\t\t\t\tinput2 = ThreadLocalRandom.current().nextInt(0, inputAmount + currentlevelsBackMax);\r\n\t\t\t\tif (input2 >= inputAmount) {\r\n\t\t\t\t\tinput2 -= inputAmount;\r\n\t\t\t\t\tinput2 = inputAmount + i - input2 - 1;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tnodes.add(new Node(function, input1, input2));\r\n\t\t}\r\n\t\toutput = new int[outputAmount];\r\n\t\tfor (int i = 0; i < outputAmount; i++) {\r\n\t\t\tif (levelsBack <= 0) {\r\n\t\t\t\toutput[i] = ThreadLocalRandom.current().nextInt(0, inputAmount + nodeAmount);\r\n\t\t\t} else {\r\n\t\t\t\tint currentlevelsBackMax = levelsBack;\r\n\t\t\t\tif (currentlevelsBackMax >= nodes.size())\r\n\t\t\t\t\tcurrentlevelsBackMax = nodes.size();\r\n\r\n\t\t\t\tint inputOfOutput = ThreadLocalRandom.current().nextInt(0, inputAmount + currentlevelsBackMax);\r\n\t\t\t\tif (inputOfOutput >= inputAmount) {\r\n\t\t\t\t\t// node doesnt use an input as input\r\n\t\t\t\t\t// but another node\r\n\t\t\t\t\tinputOfOutput -= inputAmount;\r\n\t\t\t\t\t// get the number of levelsback\r\n\t\t\t\t\tinputOfOutput = inputAmount + nodeAmount - inputOfOutput - 1;\r\n\t\t\t\t}\r\n\t\t\t\toutput[i] = inputOfOutput;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\thasFitness = false;\r\n\t\tusedNodesHasBeenCalculated = false;\r\n\t}","title":""},{"docid":"03b2bbc3dfa773d2b1085c24fef95f8a","score":"0.5303984","text":"public static void full(DefaultMutableTreeNode node, int depth, Random rand, int maxNodes) {\r\n\r\n\t\tif (((Expression) node.getUserObject()).status == Status.TERMINAL)\r\n\t\t\treturn;\r\n\r\n\t\tIFunction fun = (IFunction) node.getUserObject();\r\n\r\n\t\tif (node.isRoot()) {\r\n\t\t\temptySpaces = fun.getNumberOfOutputs();\r\n\t\t\tcurrentNodes = 1;\r\n\t\t}\r\n\r\n\t\t// ako je dubina 0 moraju se generirati terminali\r\n\t\tif (depth == 0 || currentNodes + emptySpaces == maxNodes) {\r\n\r\n\t\t\tfor (int i = 0; i < fun.getNumberOfOutputs(); i++) {\r\n\r\n\t\t\t\tExpression e = terminals.get(rand.nextInt(terminals.size())).duplicate();\r\n\t\t\t\tfun.addOutput(e);\r\n\t\t\t\tnode.add(new DefaultMutableTreeNode(e));\r\n\t\t\t\tcurrentNodes += 1;\r\n\t\t\t\temptySpaces -= 1;\r\n\t\t\t}\r\n\r\n\t\t\treturn;\r\n\r\n\t\t} else {\r\n\t\t\t// dubina nije 0, generiraju se funkcije\r\n\t\t\tfor (int i = 0; i < fun.getNumberOfOutputs(); i++) {\r\n\r\n\t\t\t\tExpression e = functions.get(rand.nextInt(functions.size())).duplicate();\r\n\r\n\t\t\t\t// potrebno staviti terminale\r\n\t\t\t\tif (maxNodes < currentNodes + emptySpaces + ((IFunction) e).getNumberOfOutputs()) {\r\n\r\n\t\t\t\t\te = terminals.get(rand.nextInt(terminals.size())).duplicate();\r\n\t\t\t\t\tfun.addOutput(e);\r\n\t\t\t\t\tnode.add(new DefaultMutableTreeNode(e));\r\n\t\t\t\t\temptySpaces -= 1;\r\n\t\t\t\t\tcurrentNodes += 1;\r\n\r\n\t\t\t\t} else {\r\n\r\n\t\t\t\t\tfun.addOutput(e);\r\n\t\t\t\t\tnode.add(new DefaultMutableTreeNode(e));\r\n\t\t\t\t\temptySpaces += ((IFunction) e).getNumberOfOutputs();\r\n\t\t\t\t\temptySpaces -= 1;\r\n\t\t\t\t\tcurrentNodes += 1;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t// dohvat novo dodanih cvorova\r\n\t\tEnumeration<DefaultMutableTreeNode> en = node.children();\r\n\r\n\t\t// za svaki dohvaceni cvor se rekurzivno generiraju novi cvorovi ovisno\r\n\t\t// o broju funkcija koje neki cvor moze imati i dubini na kojoj se cvor nalazi\r\n\t\twhile (en.hasMoreElements()) {\r\n\r\n\t\t\tDefaultMutableTreeNode child = en.nextElement();\r\n\r\n\t\t\tfull(child, depth - 1, rand, maxNodes);\r\n\t\t}\r\n\t}","title":""},{"docid":"b2ef725e645cab836d7dce0bf3b1df06","score":"0.5295591","text":"private void initNodes(){\n nodes = new Integer[getNumberOfNodes()];\n\n for(int i = 0; i <= nodes.length - 1; i++){\n nodes[i] = i;\n }\n }","title":""},{"docid":"f643a06d3ed6dedc3dc111d014b0dff4","score":"0.52894795","text":"private void makeTree(Instances data, Default default_data, ArrayList<Attribute> used) throws Exception {\n // Initialize variables\n dataset = data;\n usedAttributes = new ArrayList<>();\n if (used != null){\n usedAttributes = used;\n for (int i = 0; i < usedAttributes.size(); i++) {\n dataset.deleteAttributeAt(usedAttributes.get(i).index());\n }\n }\n numericValues = new double[dataset.numAttributes()];\n //System.out.println(data);\n \n // Check if no instances have reached this node. Missing Value\n if (dataset.numInstances() == 0) {\n main_Attribute = null;\n m_ClassValue = default_data.classValue();\n m_ClassAttribute = default_data.classAttribute();\n class_Distribution = new double[dataset.numClasses()];\n return;\n }\n \n //Make leaf if all attributes has been used, use most common class\n if (usedAttributes.size() == dataset.numAttributes()) {\n class_Distribution = new double[dataset.numClasses()];\n Enumeration classEnum = dataset.enumerateAttributes();\n while (classEnum.hasMoreElements()) {\n Instance inst = (Instance) classEnum.nextElement(); \n class_Distribution[(int) inst.classIndex()]++;\n } \n double chosenClass = Utils.maxIndex(class_Distribution);\n main_Attribute = null;\n m_ClassValue = chosenClass;\n m_ClassAttribute = dataset.classAttribute();\n return; \n }\n \n // Compute attribute with maximum information gain.\n // If attribute is continuous valued, define discrete values for attribute\n double[] infoGains = new double[dataset.numAttributes()];\n double[] gainRatios = new double[dataset.numAttributes()];\n Enumeration attEnum = dataset.enumerateAttributes();\n while (attEnum.hasMoreElements()) {\n Attribute att = (Attribute) attEnum.nextElement();\n if (att.isNumeric()) {\n infoGains[att.index()] = calculateNumeric(dataset, att);\n gainRatios[att.index()] = infoGains[att.index()] / \n computeSplitInfoNumeric(dataset, att, numericValues[att.index()]);\n } else {\n infoGains[att.index()] = computeInfoGain(dataset, att);\n gainRatios[att.index()] = infoGains[att.index()] / computeSplitInfo(dataset,att);\n }\n }\n main_Attribute = data.attribute(Utils.maxIndex(gainRatios));\n usedAttributes.add(main_Attribute);\n //for (int i = 0; i < numericValues.length; i++)\n //System.out.println(gainRatios[i]);\n \n // Make leaf if information gain is zero. \n // Otherwise create successors.\n if (Utils.eq(infoGains[main_Attribute.index()], 0)) {\n main_Attribute = null;\n class_Distribution = getClassDistribution(this);\n m_ClassValue = Utils.maxIndex(class_Distribution);\n m_ClassAttribute = dataset.classAttribute();\n } else { \n if (!main_Attribute.isNumeric()) {\n child_Nodes = new myC45[main_Attribute.numValues()];\n splitController.splitData(data, main_Attribute);\n splitController.handleMissingValues(data, main_Attribute);\n } else {\n child_Nodes = new myC45[2];\n splitController.splitDataNumeric(data, main_Attribute, numericValues[main_Attribute.index()]);\n splitController.handleMissingValuesNumeric(data, main_Attribute, numericValues[main_Attribute.index()]);\n }\n \n Instances[] splitData = splitController.getSplit();\n //System.out.println(splitData);\n for (int j = 0; j < child_Nodes.length; j++) {\n child_Nodes[j] = new myC45();\n child_Nodes[j].makeTree(splitData[j], default_data, used);\n }\n }\n }","title":""},{"docid":"4d40e7a267b536eae93dc59696b6183a","score":"0.5286031","text":"public double tuneTreesCoeffs()\n{ \n assert(Context.XData.length == Context.Target.length);\n// if(this.evaluated) return this.fitness;\n \n Iterator<Node> nodItr=this.iterator();\n int ii=0;\n while(nodItr.hasNext()){\n Node tmpNode=nodItr.next();\n if(tmpNode.getPrimitive().getArity()==0\n && !tmpNode.getPrimitive().getName().startsWith(\"X\"))\n ii++;//find the number of constants\n }\n if(ii<=1)\n return this.evaluateTree();//i.e. no coefficients to be tuned by GA so evaluate the ind only\n int[] constIndex=new int[ii];//keeps the indices of constants in this tree\n double[] constants=new double[ii];//this array would keep the constants for the interim (a temp array for best combo)\n int jj=0;\n \n for(ii=0;ii<this.size();ii++){\n if(this.get(ii).getPrimitive().getArity()==0\n && !this.get(ii).getPrimitive().getName().startsWith(\"X\")){\n constIndex[jj]=ii;//this loop copies the indices to the array\n constants[jj]=Double.valueOf(this.get(ii).getPrimitive().getName());\n jj++;\n } \n } \n //Initialize the GA here\n Nursery nurse=new Nursery();\n ArrayList<Genotype> pop=nurse.initializePopulation(100, constIndex.length, -6, +6);//should initialize a population\n for(int i=0;i<50;i++){//numGens is chosen to be 150\n ArrayList<Genotype> childPop=nurse.applySelectionTournament(pop,4);\n nurse.applySinglePointCrossover(childPop,constIndex.length,0.8);\n nurse.applyMutationUniform(childPop,constIndex.length,0.2);\n pop.addAll(childPop);//append the two pops here\n for(int j=0;j<pop.size();j++){\n if(pop.get(j).getEvaluatedFlag()==false){//if it has not been evaluated\n double[] tmpGenes=pop.get(j).getGenotype();\n for(int k=0;k<constIndex.length;k++)\n this.get(constIndex[k]).getPrimitive().setName(Double.toString(tmpGenes[k]));//insert the genes into tree\n double[] evolved=this.interpretTree(Context.XData); \n if(evolved.length!=Context.Target.length){\n double tmpEvolved=evolved[0];//if everything that is returned is a constant\n evolved=new double[Context.Target.length];\n for(int z=0;z<Context.Target.length;z++)\n evolved[z]=tmpEvolved;\n } \n double[] slope_n_intercept=new double[2];\n linearScaling(slope_n_intercept, evolved, Context.Target);\n\n // this.trainingResult=new double[evolved.length];\n double tmpFitness=0;\n double res;\n for(int ij=0; ij<Context.Target.length;ij++){\n res=Context.Target[ij]-(slope_n_intercept[0]*evolved[ij]+slope_n_intercept[1]);\n tmpFitness+=res*res;\n }\n tmpFitness=tmpFitness/evolved.length;\n if(Double.isNaN(tmpFitness) || Double.isInfinite(tmpFitness))\n tmpFitness=Double.MAX_VALUE;\n if(tmpFitness<this.fitness){\n this.fitness=tmpFitness;\n\n this.slope=slope_n_intercept[0];\n this.intercept=slope_n_intercept[1];\n for(int k=0;k<tmpGenes.length;k++)\n constants[k]=tmpGenes[k];\n }\n pop.get(j).setFitness(tmpFitness);\n if(Double.isNaN(tmpFitness) || Double.isInfinite(tmpFitness))\n {\n this.fitness=Double.MAX_VALUE;//assign a very large fitness\n pop.get(j).setFitness(Double.MAX_VALUE);\n }\n pop.get(j).setEvaluated(true);\n }// if getEvaluated\n }\n nurse.applySurvival(pop);\n }\n for(int i=0;i<constants.length;i++)\n this.get(constIndex[i]).getPrimitive().setName(Double.toString(constants[i]));//set the coeffs in the tree\n \n// System.out.println(\"Current best \"+this.fitness);\n this.valid = true;\n this.evaluated=true;\n return this.fitness;\n}","title":""},{"docid":"862f030349694b9af24b90feb6cfa3f1","score":"0.5280878","text":"public static void cost(Map<Node, List<Node>> playerGraph, Node player,\n List<Map<Node, List<Node>>> enemyGraphs, List<Node> enemies, int depth, List<Node> evaluated) {\n\n Node temp = null;\n Map<Node, List<Node>> tempGraph = null;\n\n if (depth == 0 || evaluated.contains(player) || enemies.contains(player)) return;\n\n temp = nodes.get(player.x + player.y * WIDTH);\n\n int nodesCloserToPlayer = 0;\n int divider = 1;\n\n tempGraph = newGraph(player, enemies);\n voronoiDiagramLayer(tempGraph , player, enemyGraphs, enemies, evaluated);\n\n nodesCloserToPlayer = 0;\n for (Node node: neighbors.keySet()) if (node.symbol == '+') nodesCloserToPlayer++;\n\n for(Node e: enemies) if (tempGraph.keySet().contains(e)) divider++;\n\n\n if (divider > 1) player.cost = nodesCloserToPlayer + (tempGraph.size() - divider);\n else player.cost = (tempGraph.size() - divider) * 2;\n\n // second\n //player.cost = nodesCloserToPlayer + (tempGraph.size() - divider);\n\n //third\n //player.cost = nodesCloserToPlayer + (tempGraph.size() - divider * 5);\n\n //4tg\n //player.cost = nodesCloserToPlayer + ((tempGraph.size() + divider) / divider) + divider * 5;\n\n // most current\n\n//\n// player.cost = tempGraph.size() + (nodesCloserToPlayer) / ( divider * divider);\n temp.cost = player.cost;\n\n evaluated.add(player);\n\n List<Node> children = playerGraph.get(player);\n\n for(Node child : children) {\n\n if (child.value != -1) continue;\n\n temp = nodes.get(child.x + child.y * WIDTH);\n temp.value = player.value;\n child.value = temp.value;\n\n cost(playerGraph, child, enemyGraphs, enemies, depth - 1, evaluated);\n\n temp.value = -1;\n child.value = temp.value;\n }\n }","title":""},{"docid":"05387ca1ddc7b5d616c7347903bdf712","score":"0.52777296","text":"public int numberNodes(){\n\treturn numberNodes(root);\n }","title":""},{"docid":"177939c7055f2bcaa78a21c3ca65365f","score":"0.5270561","text":"private void initialization() {\n\t\tdominatingSet = new ArrayList<Integer>();\n\n\t\tdominatedMap = new HashMap<Integer, Boolean>(this.numOfVertices);\n\t\tvoteMap = new HashMap<Integer, Float>(this.numOfVertices);\n\t\tweightMap = new HashMap<Integer, Float>(this.numOfVertices);\n\t\tCollection<Integer> vertices = g.getVertices();\n\t\t// calculate vote for each vertex and initialize weight map\n\t\tfor (Integer v : vertices) {\n\t\t\tdominatedMap.put(v, false);\n\t\t\tint degree = g.degree(v);\n\t\t\tfloat vote = 1.0f / (1 + degree);\n\t\t\tvoteMap.put(v, vote);\n\t\t\tweightMap.put(v, vote);\n\t\t}\n\t\t// calculate weight for each vertex\n\t\tfor (Integer v : vertices) {\n\t\t\tCollection<Integer> vNeig = g.getNeighbors(v);\n\t\t\tfloat weightv = weightMap.get(v);\n\t\t\tfor (Integer u : vNeig) {\n\t\t\t\tfloat voteu = voteMap.get(u);\n\t\t\t\tweightv += voteu;\n\t\t\t}\n\t\t\tweightMap.put(v, weightv);\n\t\t}\n\t}","title":""},{"docid":"9a321a8e468af21c6035bf178d86de26","score":"0.5269661","text":"@Test\n public void testEvenDistribution() {\n Map<Integer, TDataNodeConfiguration> availableDataNodeMap = new ConcurrentHashMap<>();\n Map<Integer, Double> freeSpaceMap = new ConcurrentHashMap<>();\n Random random = new Random();\n // Set 6 DataNodes\n for (int i = 0; i < 6; i++) {\n availableDataNodeMap.put(\n i, new TDataNodeConfiguration().setLocation(new TDataNodeLocation().setDataNodeId(i)));\n freeSpaceMap.put(i, random.nextDouble());\n }\n\n /* Allocate 6 RegionGroups */\n List<TRegionReplicaSet> allocatedRegionGroups = new ArrayList<>();\n for (int index = 0; index < 6; index++) {\n TRegionReplicaSet newRegionGroup =\n ALLOCATOR.generateOptimalRegionReplicasDistribution(\n availableDataNodeMap,\n freeSpaceMap,\n allocatedRegionGroups,\n TEST_REPLICATION_FACTOR,\n new TConsensusGroupId(TConsensusGroupType.DataRegion, index));\n allocatedRegionGroups.add(newRegionGroup);\n }\n\n /* Check result */\n Map<Integer, AtomicInteger> regionCounter = new ConcurrentHashMap<>();\n allocatedRegionGroups.forEach(\n regionReplicaSet ->\n regionReplicaSet\n .getDataNodeLocations()\n .forEach(\n dataNodeLocation ->\n regionCounter\n .computeIfAbsent(\n dataNodeLocation.getDataNodeId(), empty -> new AtomicInteger(0))\n .getAndIncrement()));\n // Each DataNode should have exactly 3 Regions since the all 18 Regions are distributed to 6\n // DataNodes evenly\n Assert.assertEquals(6, regionCounter.size());\n regionCounter.forEach((dataNodeId, regionCount) -> Assert.assertEquals(3, regionCount.get()));\n }","title":""},{"docid":"d125894ceaaf1ffdc6a197bc9109a92a","score":"0.5267755","text":"private void updateG() {\n\t\tthis.g = this.parent.g + arcCost(this.parent);\n\t\tif (this.children == null)\n\t\t\treturn;\n\t\t\n\t\tfor (PuzzleNode pn : children)\n\t\t\tpn.updateG(); //horay for recursive propagation.\n\t}","title":""},{"docid":"7c4c0a54174998c66bf7f85b7a324f89","score":"0.52668417","text":"public void setWeight(Node node, HashMap<Coordinate, MapTile> map) {\n\t\tMapTile tile = map.get(node.coord);\n\t\tif (tile instanceof LavaTrap) {\n\t\t\tnode.setWeight( Double.POSITIVE_INFINITY + node.parent.weight);\n\t\t}else {\n\t\t\tITileWeight weights = TileWeightFactory.getInstance().getWeight(tile);\n\t\t\tnode.setWeight(weights.getWeight(node, map) + node.parent.weight);\n\t\t}\n\t\t\n\t}","title":""},{"docid":"a1e5071827e12eaffc56a94fcbb3a5ad","score":"0.52659726","text":"void layout() {\n findLevels();\n\n rationalise();\n\n for (Level l : levels) {\n l.calcInitialPositions();\n }\n\n orderNodesInLevels();\n\n calcLevelLocations();\n\n int minStart = Integer.MAX_VALUE;\n\n for (Level l : levels) {\n minStart = Math.min(minStart, l.getStart());\n }\n\n for (Level l : levels) {\n l.shiftLeft(minStart);\n }\n\n for (Level l : levels) {\n withinLevelSize = Math.max(withinLevelSize, l.getWidth());\n }\n\n storeLayoutNodes();\n\n storeLayoutEdges();\n }","title":""},{"docid":"fbf53bce26fc1cc63888e8af36a10951","score":"0.52657056","text":"public void generate() {\n\t\tList<S> survivors = getSurvivors();\n\t\t\n\t\tPriorityQueue<S> newGeneration = \n\t\t\t\tnew PriorityQueue<S>(generationSize, comparator);\n\t\t// artificially add the best so far so we don't lose progress\n\t\tif (best != null) newGeneration.add(best);\n\t\t\n\t\tdouble[] normedScores = new double[survivors.size()];\n\t\t\n\t\tdouble min = Double.POSITIVE_INFINITY;\n\t\tfor(int i=0; i<survivors.size(); i++) {\n\t\t\tnormedScores[i] = survivors.get(i).score();\n\t\t\tif(normedScores[i] < min) \n\t\t\t\tmin = normedScores[i];\n\t\t}\n\t\t\n\t\tif(min < 0) {\n\t\t\tfor(int i=0; i<normedScores.length; i++) {\n\t\t\t\tnormedScores[i] += -min + 1; //shift values so they're all >0\n\t\t\t\t//so normalizing doesn't invert negative values\n\t\t\t}\n\t\t}\n\t\t\n\t\tdouble sum = 0;\n\t\tfor(int i=0; i<normedScores.length; i++) sum += normedScores[i];\n\t\t//want to choose the best with a higher likelihood than the worst\n\t\t//of the survivors\n\t\t\n\t\t//Each member is chosen as a parent with likelihood proportional\n\t\t//to its contribution to the gene pool\n\t\tfor(int i=0; i<normedScores.length; i++) {\n\t\t\tRandom r = new Random();\n\t\t\tdouble x = r.nextDouble() * sum;\n\t\t\tdouble y = r.nextDouble() * sum;\n\t\t\tdouble accum = 0;\n\t\t\t\n\t\t\tint p=-1, q=-1; //indices of the parents we choose for this child\n\t\t\tfor(int j=0; accum < x || accum < y; j++) { \n\t\t\t\t//we won't run off the end of the array because the scores\n\t\t\t\t//sum to 1, and both x and y are <1.\n\t\t\t\taccum += normedScores[j];\n\t\t\t\tif(p == -1 && accum >= x) p=j; //update only the first time\n\t\t\t\tif(q == -1 && accum >= y) q=j;\n\t\t\t}\n\t\t\t\n\t\t\t//we chose parents j and k\n\t\t\tS child = survivors.get(p).mate(survivors.get(q), mutationRate);\n\t\t\tnewGeneration.add(child);\n\t\t}\n\t\t\n\t\tgenerationCounter++;\n\t\tcurrentGeneration = newGeneration;\n\t\tif(best == null || currentGeneration.peek().score() >= best.score())\n\t\t\tbest = currentGeneration.peek();\n\t}","title":""},{"docid":"830d150348bb0d257fa1c4a5c90c676d","score":"0.5255091","text":"public int getNbNodes()\n\t{\n\t\treturn stats.getNbNodes();\n\t}","title":""},{"docid":"97708b6900b25e7caa8d51e3feff6099","score":"0.52489096","text":"int getNodeCount();","title":""},{"docid":"f12b7593c01a72bd4b8f6d660b89bbdf","score":"0.52442926","text":"@Override\r\n\tpublic void runFunc() {\n\t\tSystem.out.println(numTrees(6));\r\n\t}","title":""},{"docid":"ee132b5d3ee28f673fc391dfc7054693","score":"0.5235468","text":"protected Vector[] linearPartition(Vector entries) {\r\n int n = entries.size();\r\n assert (n > ctree.M);\r\n\r\n int n0 = ctree.rand.nextInt(n);\r\n Graph g0 = childGraphAt(n0); // g0\r\n\r\n // choose g1\r\n double dmax = 0;\r\n int n1 = -1;\r\n for (int i = 0; i < n; i++) {\r\n Graph g = childGraphAt(i);\r\n if (i == n0) {\r\n continue;\r\n }\r\n double d = dist(g0, g);\r\n if (d > dmax) {\r\n dmax = d;\r\n n1 = i;\r\n }\r\n }\r\n Graph g1 = childGraphAt(n1);\r\n\r\n // choose g2\r\n dmax = 0;\r\n int n2 = -1;\r\n double[] dist = new double[n];\r\n for (int i = 0; i < n; i++) {\r\n Graph g = childGraphAt(i);\r\n if (i == n1) {\r\n continue;\r\n }\r\n double d = dist(g1, g);\r\n if (d > dmax) {\r\n dmax = d;\r\n n2 = i;\r\n }\r\n dist[i] = d; // distance to g1\r\n }\r\n Graph g2 = childGraphAt(n2);\r\n\r\n // compute d(g,g1)-d(g,g2)\r\n for (int i = 0; i < n; i++) {\r\n Graph g = childGraphAt(i);\r\n dist[i] = dist[i] - dist(g2, g);\r\n }\r\n\r\n // sort in ascedning order\r\n int[] order = new int[n];\r\n for (int i = 0; i < n; i++) {\r\n order[i] = i;\r\n }\r\n for (int i = 0; i < n - 1; i++) {\r\n for (int j = i + 1; j < n; j++) {\r\n if (dist[i] > dist[j]) {\r\n double temp = dist[i]; // swap i,j\r\n dist[i] = dist[j];\r\n dist[j] = temp;\r\n int temp2 = order[i];\r\n order[i] = order[j];\r\n order[j] = temp2;\r\n }\r\n }\r\n }\r\n\r\n // find a middle point to partition\r\n int mid;\r\n for (mid = ctree.m; mid < n - ctree.m; mid++) {\r\n if (dist[mid] > 0 || (dist[mid] == 0 && mid > n / 2)) {\r\n break;\r\n }\r\n }\r\n\r\n Vector vect1 = new Vector(ctree.M + 1);\r\n Vector vect2 = new Vector(ctree.M + 1);\r\n for (int i = 0; i < mid; i++) {\r\n vect1.addElement(entries.elementAt(order[i]));\r\n }\r\n for (int i = mid; i < n; i++) {\r\n vect2.addElement(entries.elementAt(order[i]));\r\n }\r\n return new Vector[] {vect1, vect2};\r\n }","title":""},{"docid":"6a7c48c0ef68c7091ed968bbf94fefad","score":"0.5228146","text":"public static C4_5DecisionNode createNode(Samples samples)\r\n\t{\r\n\t\tdouble bestEntropy = -1000.0;\r\n\t\tdouble bestDivider = 0.0;\r\n\t\tAttribute bestAttribute = null;\r\n\t\t\r\n\t\tList<Attribute> attributes = samples.getAtts();\r\n\t\r\n\t\t\r\n\t\tfor(Attribute a:attributes)\r\n\t\t\tif(!a.equals(samples.getClassAttribute()))\r\n\t\t\t{\r\n\t\t\t\tif (a instanceof Nominal) {\r\n\t\t\t\t\tNominal nominal = (Nominal) a;\r\n\t\t\t\t\tdouble entropy = Entropy.nominalEntropy(samples, nominal);\r\n\t\t\t\t\tif(entropy>bestEntropy)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tbestEntropy = entropy;\r\n\t\t\t\t\t\tbestAttribute = nominal;\r\n\t\t\t\t\t}\t\r\n\t\t\t\t}\r\n\t\t\t\telse if (a instanceof Numeric) {\r\n\t\t\t\t\tNumeric numeric = (Numeric) a;\r\n\t\t\t\t\tif(samples.size()<=DIV_POINTS_COUNT)\r\n\t\t\t\t\t\tfor (Sample sample : samples) \r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tObject o = sample.get(samples.getAtts().indexOf(numeric));\r\n\t\t\t\t\t\t\tif(o!=null)\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tdouble div = (Double)sample.get(samples.getAtts().indexOf(numeric));\r\n\t\t\t\t\t\t\t\tdouble entropy = Entropy.numericEntropy(samples, numeric, div);\r\n\t\t\t\t\t\t\t\tif(entropy>bestEntropy)\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\tbestDivider = div;\r\n\t\t\t\t\t\t\t\t\tbestEntropy = entropy;\r\n\t\t\t\t\t\t\t\t\tbestAttribute = numeric;\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tRandom r = new Random(0);\r\n\t\t\t\t\t\tint i = DIV_POINTS_COUNT;\r\n\t\t\t\t\t\twhile(i-->0)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tSample sample = samples.get(r.nextInt(samples.size())); \r\n\t\t\t\t\t\t\tdouble div = (Double)sample.get(sample.getSamples().getAtts().indexOf(numeric));\r\n\t\t\t\t\t\t\tdouble entropy = Entropy.numericEntropy(samples, numeric, div);\r\n\t\t\t\t\t\t\tif(entropy>bestEntropy)\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tbestDivider = div;\r\n\t\t\t\t\t\t\t\tbestEntropy = entropy;\r\n\t\t\t\t\t\t\t\tbestAttribute = numeric;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\r\n\r\n\t\tif(bestAttribute==null)\r\n\t\t{\r\n\t\t\treturn new C4_5DecisionLeaf(samples);\r\n\t\t}\r\n\t\t\r\n\t\tif (bestAttribute instanceof Nominal) {\r\n\t\t\tNominal nominal = (Nominal) bestAttribute;\r\n\t\t\treturn new C4_5NominalNode(samples,nominal);\r\n\t\t}\r\n\t\telse if (bestAttribute instanceof Numeric) {\r\n\t\t\tNumeric numeric = (Numeric) bestAttribute;\r\n\t\t\treturn new C4_5NumericNode(samples,numeric,bestDivider);\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\tthrow new IllegalArgumentException(\"Unknown attribute type\");\r\n\t\t\r\n\t}","title":""},{"docid":"3e7430d8c6ab0ab53875ea930d445dbb","score":"0.5222605","text":"public double scoreLnGam(Node node, Set<Node> parents, BayesPm bayesPmMod,\n BayesIm bayesIm) {\n // System.out.println(\"In Cache scoreLnGam \");\n // System.out.print(\"Processing node \" + node.getName() + \" with parents \");\n\n // for (Iterator itp = parents.iterator(); itp.hasNext();) {\n // System.out.print(((Node) itp.next()).getName() + \" \");\n // }\n // System.out.println();\n\n //A factor of a model is determined by a node and its parents in that model.\n //The NodeParentsPair inner class provides a means to instantiate such\n //a pair so that it can be used as an argument to the Map scores.\n NodeParentsPair nodeAndParents = new NodeParentsPair(node, parents);\n double score;\n\n //If the score of this factor has already been computed and stored, retrieve it from the\n //Map scores.\n if (scores.containsKey(nodeAndParents)) {\n System.out.println(\n node + \" Score came from map--counts not computed.\");\n score = scores.get(nodeAndParents);\n\n return score;\n }\n else { //otherwise compute it and store it in the map.\n\n //String[] varNames = dataSet.getVariableNames();\n\n //Create arrays for storing observed counts and prior probabilities for\n //this factor. In observedCounts and priorProbs, for instance, there will be as\n //many rows as there are combinations of values of the parents and\n //as many columns as there are categories of the child variable.\n Node[] parentArray = new Node[parents.size()];\n for (int i = 0; i < parentArray.length; i++) {\n parentArray[i] = (Node) (parents.toArray()[i]);\n }\n\n /*\n int numRows = 1;\n for (int i = 0; i < parentArray.length; i++) {\n String name = parentArray[i].getName();\n\n int index = getVarIndex(name);\n //int numCats = ((DiscreteVariable) variables.get(index)).getNumSplits();\n int numCats = bayesPm.getNumSplits(parentArray[i]);\n numRows *= numCats;\n }\n */\n\n BayesIm bayesImMod = new MlBayesIm(bayesPmMod);\n int numRows = bayesImMod.getNumRows(bayesImMod.getNodeIndex(node));\n\n double[][] priorProbs;\n double[] priorProbsRowSum;\n\n observedCounts = new double[numRows][];\n priorProbs = new double[numRows][];\n\n //The following two arrays are used to store the sum of the counts and\n //prior probablities for each row.\n double[] observedCountsRowSum = new double[numRows];\n priorProbsRowSum = new double[numRows];\n\n //The int index will be the index of the variable associated with node\n //in dataset.\n// int index = getVarIndex(name);\n //System.out.println(\"NAME: \" + name);\n //int numCols = ((DiscreteVariable) variables.get(index)).getNumSplits();\n int numCols = bayesPm.getNumCategories(node);\n\n //Initialize the observed counts and prior probabilities arrays.\n for (int j = 0; j < numRows; j++) {\n\n observedCountsRowSum[j] = 0;\n priorProbsRowSum[j] = 0;\n\n observedCounts[j] = new double[numCols];\n priorProbs[j] = new double[numCols];\n }\n\n //At this point set values in observedCounts according to the cases in the dataset.\n if (bayesIm == null) {\n computeObservedCounts(node, parentArray);\n }\n else\n //computeObservedCountsMD(node, bayesPmMod, bayesIm);\n {\n computeObservedCountsMD(node, bayesPmMod, bayesIm);\n }\n\n //Set all priorProbs (i.e. estimated counts) to 1.0. Eventually they may be\n //supplied as a parameter of the constructor of this class.\n for (int j = 0; j < numRows; j++) {\n for (int k = 0; k < numCols; k++)\n //priorProbs[j][k] = 1.0;\n {\n priorProbs[j][k] = 1.0 /\n (numRows * numCols); //Per David Danks 12/21/04\n }\n }\n\n for (int j = 0; j < numRows; j++) {\n // System.out.print(\"Observed counts row \" + j);\n for (int k = 0; k < numCols; k++) {\n\n //DEBUG PRINT:\n // System.out.print(\" \" + observedCounts[j][k]);\n\n observedCountsRowSum[j] += observedCounts[j][k];\n priorProbsRowSum[j] += priorProbs[j][k];\n }\n // System.out.println();\n }\n\n //The loops below compute the products on page 25 of the Heckerman et al. paper.\n //Actually sums are computed since logarithms of the terms are used. That is\n //why the log gamma function (lngamma) is used.\n double sum = 0.0;\n\n// int n = nodes.length; //The number of factors (i.e. variables).\n\n for (int j = 0; j < numRows; j++) {\n\n try {\n double numerator = ProbUtils.lngamma(priorProbsRowSum[j]);\n double denom = ProbUtils.lngamma(\n priorProbsRowSum[j] + observedCountsRowSum[j]);\n\n //gammln is a slightly more accurate method than lngamma.\n //double numerator = ProbUtils.gammln(priorProbsRowSum[j]);\n //double denom =\n // ProbUtils.gammln(priorProbsRowSum[j] + observedCountsRowSum[j]);\n\n //System.out.println(\"num = \" + numerator + \" denom = \" + denom);\n sum += (numerator - denom);\n }\n catch (Exception e) {\n e.printStackTrace();\n }\n\n //double prodk = 1.0;\n double sumk = 0.0;\n for (int k = 0; k < numCols; k++) {\n try {\n sumk += ProbUtils.lngamma(\n priorProbs[j][k] + observedCounts[j][k]) -\n ProbUtils.lngamma(priorProbs[j][k]);\n\n /* Debug print\n if(Double.isNaN(sumk)) {\n System.out.println(\"sumk is Nan\");\n System.out.println(priorProbs[j][k] + \" \" + observedCounts[j][k]);\n }\n */\n\n //sumk += ProbUtils.gammln(priorProbs[j][k] + observedCounts[j][k]) -\n // ProbUtils.gammln(priorProbs[j][k]);\n }\n catch (Exception e) {\n e.printStackTrace();\n }\n }\n\n sum += sumk;\n }\n\n score = sum;\n\n }\n\n //Store the node and parents pair and the score in the scores Map.\n //Also return the score.\n Double scoreDouble = score;\n scores.put(nodeAndParents, scoreDouble);\n\n //System.out.println(\"For node \" + node.getName() + \" with parents \" + parents);\n //System.out.println(\"Score = \" + score);\n return score;\n }","title":""},{"docid":"e531bb5b3776b7b54851befbdbb70941","score":"0.5216921","text":"public void determinePartitions( Callback c ){\n int currentDepth = 0;\n GraphNode node;\n GraphNode parent;\n GraphNode child;\n int depth = 0;\n List levelList = new java.util.LinkedList();\n String currentLabel = null;\n int i = 0,partitionNum = 0;\n\n\n mLogger.log( \"Starting Graph Traversal\", LogManager.INFO_MESSAGE_LEVEL );\n //set the depth of the dummy root as 0\n mRoot.setDepth( currentDepth );\n\n mQueue.addLast( mRoot );\n\n while( !mQueue.isEmpty() ){\n node = (GraphNode)mQueue.getFirst();\n depth = node.getDepth();\n currentLabel = getLabel( node );\n if(currentDepth < depth){\n //a new level starts\n currentDepth++;\n levelList.clear();\n }\n\n //get the partition for the label\n Partition p = null;\n if( mPartitionMap.containsKey( currentLabel ) ){\n p = (Partition)mPartitionMap.get( currentLabel );\n }\n else {\n p = new Partition();\n if( currentDepth > 0 ){\n partitionNum++;\n p.setIndex( partitionNum );\n p.setID(getPartitionID( partitionNum ));\n mPartitionMap.put( currentLabel, p );\n }\n }\n\n if( p.lastAddedNode()!= null && depth > p.lastAddedNode().getDepth() + 1 ){\n throw new RuntimeException( \"Invalid labelled graph\" );\n /*\n //partition with current label has been fully\n //constructed. write out the existing partition\n\n //create a new partition\n Partition newp = new Partition();\n newp.addNode(node);\n mPartitionMap.put(currentLabel,newp);\n */\n }\n else if(currentDepth > 0){\n //add to the existing partition for the current label\n p.addNode(node);\n //also associate the partition id with the node\n node.getBag().add( LabelBag.PARTITION_KEY,p.getID() );\n }\n\n\n mLogger.log(\"Adding to level \" + currentDepth + \" \"\n + node.getID(),LogManager.DEBUG_MESSAGE_LEVEL);\n levelList.add( node );\n\n\n node.setColor( GraphNode.BLACK_COLOR );\n for( Iterator it = node.getChildren().iterator(); it.hasNext(); ){\n child = (GraphNode)it.next();\n if(!child.isColor( GraphNode.GRAY_COLOR ) &&\n child.parentsColored( GraphNode.BLACK_COLOR ) ){\n mLogger.log( \"Adding to queue \" + child.getID(),\n LogManager.DEBUG_MESSAGE_LEVEL );\n child.setDepth( depth + 1 );\n child.setColor( GraphNode.GRAY_COLOR );\n mQueue.addLast( child );\n }\n\n }\n node = (GraphNode)mQueue.removeFirst();\n mLogger.log( \"Removed \" + node.getID(),\n LogManager.DEBUG_MESSAGE_LEVEL );\n }\n mLogger.log( \"Starting Graph Traversal - DONE\",\n LogManager.INFO_MESSAGE_LEVEL );\n\n for( Iterator it = mPartitionMap.entrySet().iterator(); it.hasNext(); ){\n Map.Entry entry = (Map.Entry)it.next();\n Partition p = (Partition)entry.getValue();\n p.constructPartition();\n mLogger.log( \"Partition is \" + p.getNodeIDs() + \" corresponding to label \" +\n entry.getKey(),\n LogManager.DEBUG_MESSAGE_LEVEL );\n \n //PM-745 set whether a single sized partition was associated with a label\n //or not. any partition of size > 1 has to have a label assoicated.\n boolean hasAssociatedLabel = true;\n if( p.getSize() == 1 ){\n //for single sized partitions look into the last added node\n //and check whether the label is equal the node id\n GraphNode n = p.lastAddedNode();\n if( this.getLabel( n ).equals( n.getID() ) ){\n //user did not associated a specific label key\n hasAssociatedLabel = false ;\n }\n }\n p.doesHaveAssociatedLabel( hasAssociatedLabel );\n \n //call the callback\n c.cbPartition( p );\n }\n\n mLogger.log( \"Determining relations between partitions\",\n LogManager.INFO_MESSAGE_LEVEL );\n //construct the relations\n for( Iterator it = mPartitionMap.entrySet().iterator(); it.hasNext(); ){\n Map.Entry entry = (Map.Entry) it.next();\n Partition p = (Partition) entry.getValue();\n List roots = p.getRootNodes();\n Set parentPartitions = new HashSet( roots.size() );\n\n //get the Root nodes for each partition and\n //for each root, determine the partitions of it's parents\n for( Iterator rootIt = roots.iterator(); rootIt.hasNext(); ){\n node = (GraphNode)rootIt.next();\n for( Iterator parentsIt = node.getParents().iterator(); parentsIt.hasNext(); ){\n parent = (GraphNode)parentsIt.next();\n //the parents partition id is parent for the\n //partition containing the root\n parentPartitions.add( parent.getBag().get( LabelBag.PARTITION_KEY ) );\n }\n }\n \n //write out all the parents of the partition\n if(!parentPartitions.isEmpty()){\n c.cbParents( p.getID(), new ArrayList( parentPartitions ) );\n }\n }\n mLogger.log( \"Determining relations between partitions - DONE\",\n LogManager.INFO_MESSAGE_LEVEL );\n\n //done with the partitioning\n c.cbDone();\n }","title":""},{"docid":"651b8a905205b04a9c6031eba31f7a28","score":"0.5213281","text":"public void draw() {\n if (root == null) return;\n class NodeWithLimitations {\n final Node node;\n final double x0;\n final double y0;\n final double x1;\n final double y1;\n NodeWithLimitations(Node node, double x0, double y0, double x1, double y1) {\n this.node = node;\n this.x0 = x0;\n this.y0 = y0;\n this.x1 = x1;\n this.y1 = y1;\n }\n public String toString() {\n return node.p.toString() + \"[\" + x0 + \", \" + y0 + \", \" + x1 + \", \" + y1 + \"]\";\n }\n };\n Queue<NodeWithLimitations> bfs = new Queue<NodeWithLimitations>();\n NodeWithLimitations node = null;\n bfs.enqueue(new NodeWithLimitations(root, 0, 0, 1, 1));\n while (!bfs.isEmpty()) {\n node = bfs.dequeue();\n StdDraw.setPenColor(StdDraw.BLACK);\n StdDraw.setPenRadius(.01);\n node.node.p.draw();\n \n StdDraw.setPenRadius(.005);\n if (node.node.v) {\n StdDraw.setPenColor(StdDraw.RED);\n StdDraw.line(node.node.p.x(), node.y0, node.node.p.x(), node.y1);\n } else {\n StdDraw.setPenColor(StdDraw.BLUE);\n StdDraw.line(node.x0, node.node.p.y(), node.x1, node.node.p.y());\n }\n if (node.node.lb != null) {\n NodeWithLimitations tmp = null;\n if (node.node.v) {\n tmp = new NodeWithLimitations(node.node.lb, node.x0, node.y0, node.node.p.x(), node.y1);\n } else {\n tmp = new NodeWithLimitations(node.node.lb, node.x0, node.y0, node.x1, node.node.p.y());\n }\n bfs.enqueue(tmp);\n }\n if (node.node.rt != null) {\n NodeWithLimitations tmp = null;\n if (node.node.v) {\n tmp = new NodeWithLimitations(node.node.rt, node.node.p.x(), node.y0, node.x1, node.y1);\n } else {\n tmp = new NodeWithLimitations(node.node.rt, node.x0, node.node.p.y(), node.x1, node.y1);\n }\n bfs.enqueue(tmp);\n }\n }\n }","title":""},{"docid":"90f37d0f258aca5a92980abb09e5ca0c","score":"0.5208705","text":"void doCountProbabilitiesForInternal(NodeData node, NodeData u1, NodeData u2, Double [] coalescenceRate, boolean dprint)throws Exception {\n//\t\tint n1 = u1.m_n;\n//\t\tint n2 = u2.m_n;\n\t\tint n1 = u1.getSize();\n\t\tint n2 = u2.getSize();\n\t\tint n = n1+n2;\n\t\tnode.resize(n);\n\n\n\t\tdouble g1 = coalescenceRate[u1.getNr()];//u1.gamma();\n\t\tdouble g2 = coalescenceRate[u2.getNr()];//u2.gamma();\n\t\tdouble t1 = u1.t();\n\t\tdouble t2 = u2.t();\n\n\n//\t\tu1.m_Nt = computeTavareProbs(g1*t1, u1.m_Nb);\n//\t\tu2.m_Nt = computeTavareProbs(g2*t2, u2.m_Nb);\n\n//\t\tif( dprint ) {\n//\t\t\tdouble sum = 0.0;\n//\t\t\tSystem.out.println(\"g1,t1 \" + g1 + \" \" + t1 + \" g2,t2 \" + g2 + \" \" + t2);\n//\t\t\tsum = 0.0;\tfor (int i = 0; i < u1.m_Nb.length; i++) {sum += u1.m_Nb[i];}\n//\t\t\tSystem.out.println(u1.getNr() + \" u1.Nb \" + u1.m_Nb.length + \" sum=\"+sum + \" \" + Arrays.toString(u1.m_Nb)); \n//\t\t\tsum = 0.0;\tfor (int i = 0; i < u1.m_Nt.length; i++) {sum += u1.m_Nt[i];}\n//\t\t\tSystem.out.println(u1.getNr() + \" u1.Nt \" + u1.m_Nt.length + \" sum=\"+sum + \" \" + Arrays.toString(u1.m_Nt));\n//\t\t\tsum = 0.0;\tfor (int i = 0; i < u2.m_Nb.length; i++) {sum += u2.m_Nb[i];}\n//\t\t\tSystem.out.println(u2.getNr() + \" u2.Nb \" + u2.m_Nb.length + \" sum=\"+sum + \" \" + Arrays.toString(u2.m_Nb));\n//\t\t\tsum = 0.0;\tfor (int i = 0; i < u2.m_Nt.length; i++) {sum += u2.m_Nt[i];}\n//\t\t\tSystem.out.println(u2.getNr() + \" u2.Nt \" + u2.m_Nt.length + \" sum=\"+sum + \" \" + Arrays.toString(u2.m_Nt)); \n//\t\t}\n\n\t\t//std::fill(Nb.begin(), Nb.end(), 0.0);\n\t\t//node.Nb = new double[n1+n2+1];\n//\t\tfor(int i1 = 1;i1<=n1;i1++) {\n//\t\t\tfor(int i2 = 1;i2<=n2;i2++) {\n//\t\t\t\tnode.m_Nb[i1+i2] += u1.m_Nt[i1]*u2.m_Nt[i2];\n//\t\t\t}\n//\t\t}\n//\t\tif( dprint ) {\n//\t\t\tdouble sum = 0.0;for (int i = 0; i < node.m_Nb.length; i++) {sum += node.m_Nb[i];}\n//\t\t\tSystem.out.println(node.getNr() + \" node.Nb \" + node.m_Nb.length + \" sum=\"+sum + \" \" + Arrays.toString(node.m_Nb));\n//\t\t}\n\t}","title":""},{"docid":"40ae859bf4f62a8afd0cc794aae41193","score":"0.52084535","text":"public void getPosteriorDistributionOf(FiniteStates V) {\n \n NodeList NotRemoved;\n FiniteStates X, Y;\n Relation R;\n RelationList RLtemp;\n //PotentialTree Pot;\n Potential Pot;\n PairTable P;\n int i, j, k, p, pos, s;\n\n NotRemoved = new NodeList();\n P = new PairTable();\n \n s = network.getNodeList().size();\n for (i=0 ; i<s ; i++) {\n X = (FiniteStates)network.getNodeList().elementAt(i);\n //if ((observations.indexOf(X) == -1) && (X!=V)) {\n if ((!observations.isObserved(X)) && (X!=V)) {\n NotRemoved.insertNode(X);\n P.addElement(X);\n }\n }\n\n \n //CurrentRelations = getInitialRelations();\n CurrentRelations = getInitialRelations(V);\n\n \n /* Now restrict the valuations to the obervations */\n\n if (observations.size() > 0)\n CurrentRelations.restrictToObservations(observations);\n //restrictToObservations(CurrentRelations);\n \n for (i=0 ; i<CurrentRelations.size() ; i++)\n P.addRelation(CurrentRelations.elementAt(i));\n\n \n for (i=NotRemoved.size() ; i>0 ; i--) {\n X = P.nextToRemove();\n NotRemoved.removeNode(X);\n P.removeVariable(X);\n RLtemp = CurrentRelations.getRelationsOfAndRemove(X);\n \n if(RLtemp.size()>0) {\n R = RLtemp.elementAt(0);\n P.removeRelation(R);\n Pot=R.getValues();\n \n for (j=1 ; j<RLtemp.size() ; j++) {\n R = RLtemp.elementAt(j);\n P.removeRelation(R);\n //Pot = Pot.combine((PotentialTree)R.getValues());\n Pot=combine(Pot,R.getValues());\n }\n \n Pot=addVariable(Pot,X);\n Pot=transformAfterAdding(Pot);\n \n //System.out.println(\"He borrado \"+X.Name);\n R = new Relation();\n R.setKind(\"potential\");\n R.getVariables().nodes = (Vector)Pot.getVariables().clone();\n R.setValues(Pot);\n CurrentRelations.insertRelation(R);\n P.addRelation(R);\n }\n }\n \n /* After this, CurrentRelations must only contain relations\n for variable V */\n \n RLtemp = CurrentRelations.getRelationsOf(V);\n \n R = RLtemp.elementAt(0);\n P.removeRelation(R);\n //Pot = (PotentialTree)R.getValues();\n Pot = R.getValues();\n\n for (j=1 ; j<RLtemp.size() ; j++) {\n R = RLtemp.elementAt(j);\n P.removeRelation(R);\n //Pot = Pot.combine((PotentialTree)R.getValues());\n Pot=combine(Pot,R.getValues());\n }\n //Pot.limitBound(limitForPrunning);\n Pot=transformAfterEliminating(Pot);\n \n results.addElement(Pot);\n}","title":""},{"docid":"bbc0e9635af205111c33f5dac7559552","score":"0.5203985","text":"@java.lang.Override\n public int getNodeCount() {\n return node_.size();\n }","title":""},{"docid":"43188360f881ecfc46451b31ed9a5570","score":"0.5196347","text":"public int getNumNodes() {\n return numNodes;\n }","title":""},{"docid":"8256378ebad1ff0d32ddf3b5f56cd891","score":"0.5193533","text":"@Override\n\tpublic int getNodeCount() {\n\t\treturn nodeCount;\n\t}","title":""},{"docid":"f86b99103d6b4e9ceaae4318b30884c8","score":"0.51927865","text":"public double generateDirection() {\n\t\ttempNodes = new ArrayList<Node>();\n\t\tRandom r = new Random();\n\t\t\n\t\t// for every edge in the minimum spanning tree (this.tree)\n\t\tfor(int i=0; i<tree.size();i++) {\n\t\t\t// Extract the nodes from the edges\n\t\t\tNode one = new Node(tree.get(i).getStart());\n\t\t\tNode two = new Node(tree.get(i).getEnd());\n\t\t\t// randomly make one of the nodes a parent and the other a child\n\t\t\tif(r.nextInt(2)==1) {\n\t\t \t// if not already referenced the other way around\n\t\t\t\tif(!two.getParents().contains(one)) {\n\t\t\t\t\tone.addParent(two);\n\t\t\t\t}\n\t\t } else {\n\t\t \t// if not already referenced the other way around\n\t\t \tif(!one.getParents().contains(two)) {\n\t\t \t\ttwo.addParent(one);\n\t\t \t}\n\t\t }\n\t\t if(!tempNodes.contains(one)) {\n\t\t \ttempNodes.add(one);\n\t\t }\n\t\t if(!tempNodes.contains(two)) {\n\t\t \ttempNodes.add(two);\n\t\t } \n\t\t}\n\t\t// calculate cpt for all of tempNodes\n\t\tfor(Node n : tempNodes) {\n\t\t\tfindCPT(n, dataset);\n\t\t}\n\t\t// Check the log-likelihood of tempNodes\n\t\treturn log_likelihood(tempNodes, dataset);\n\t\t\n\t}","title":""},{"docid":"a0ae28359fffac2eab797cf1fac49da1","score":"0.51916426","text":"public int getNumNodes() {\n return nodes.size();\n }","title":""}],"string":"[\n {\n \"docid\": \"9ae87aba1f7988b5283c5bc3e9e30d89\",\n \"score\": \"0.67660534\",\n \"text\": \"private int targetNodesAtLevel(int level){\\r\\n\\t\\treturn (int)Math.round((float)size/Math.pow(2.0, level+1));\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"20b0d52f28038518e9ffca84c579646c\",\n \"score\": \"0.62952304\",\n \"text\": \"private void actualizeProbabilities() {\\r\\n\\t\\tdouble proba = 1.0/children.size();\\r\\n\\t\\tfor(Path path : children){\\r\\n\\t\\t\\tpath.setProbability(proba);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4269f300c699a675acb0d383ad136363\",\n \"score\": \"0.6250802\",\n \"text\": \"protected abstract double logNodeProbability(Node node, int taxonCount);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58e0888d4784af9f45bdc37c114afd15\",\n \"score\": \"0.6132892\",\n \"text\": \"public void reshapeProbabilities(){\\r\\n\\t\\tdouble total = 0.0;\\r\\n\\t\\tfor(Path path : children){\\r\\n\\t\\t\\ttotal += path.getProbability();\\r\\n\\t\\t}\\r\\n\\t\\tfor(Path path : children){\\r\\n\\t\\t\\tpath.setProbability(path.getProbability()/total);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44971a727247562c1ee13a606bf6f66c\",\n \"score\": \"0.61132395\",\n \"text\": \"public double find_density()\\n{ double density=0.0;\\n double tweight=0.0;\\n double n=ProteinChain.size();\\n for (Protein ProteinChain1 : ProteinChain) \\n { double pweight=0.0;\\n for(Node tempNode:ProteinChain1.neighbours)\\n {pweight=pweight++;\\n }\\n tweight=tweight+pweight;\\n\\n }\\n density= tweight/(n*(n-1));\\n return density;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9149f6b557fc6cb5986de0d3289f317b\",\n \"score\": \"0.6057186\",\n \"text\": \"int getFixedNodesCount();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2cb07d05f7415d45907085137109099\",\n \"score\": \"0.60489696\",\n \"text\": \"public void generateRandomTree()\\n {\\n //assigns each existing node with a possitive integer\\n int counter = 1;\\n \\n //first level and second level(depth 0 & 1): always there\\n tree[0] = counter;\\n counter ++;\\n \\n tree[1] = counter;\\n counter ++;\\n \\n tree[2] = counter;\\n counter ++;\\n \\n //third level and after (depth >=2): probability: 0.75^(depth-1)\\n //-1: doesnt exist\\n //0: not filled / determined yet (default)\\n //possitive integers: node exists \\n \\n for (int depth = 2; depth <= DEPTH; depth ++)\\n {\\n //finds out the start and end of the current level\\n int start = (int)Math.pow(2, depth)-1;\\n int end = (int)Math.pow(2, depth+1)-1;\\n \\n for (int i = start ; i < end ; i++){\\n \\n // if this node can't possibly exist (parent doesn't exist), make its children into -1\\n if (tree[i] == -1){\\n if ( 2*i+2 < capacity) tree[2*i+1] = tree[2*(i+1)] = -1;\\n }\\n \\n //if parent exist, then generate the child according to probablility\\n else { \\n \\n // we set the probability as (3/4)^(depth-1)\\n // so nodes at depth = 2 has (3/4) probability to exist\\n // nodes at depth = 2 has (9/16) probability to exist\\n // nodes at depth = 2 has (27/64), and so on.\\n \\n //generate random number according to denominator, 4^(depth-1)\\n int random = (int)(Math.random()*Math.pow(4, depth-1));\\n \\n //The tree node exists if it is less than 3^(depth-1)\\n if (random <= Math.pow(3, depth-1)){\\n tree[i] = counter;\\n counter++;\\n \\n // if it doesnt exist,\\n //make the node itself and its children into -1\\n } else {\\n tree[i] = -1;\\n if ( 2*i+2 < capacity) tree[2*i+1] = tree[2*(i+1)] = -1;\\n }\\n \\n }\\n }\\n \\n }\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d78f9b7ac024df3038a614d275ae48ee\",\n \"score\": \"0.601045\",\n \"text\": \"protected void setNormalStressNodes() {\\n mNormalStressNodes = new TreeMap<>();\\n mNormalStressNodesO = new TreeMap<>();\\n\\n for(BigDecimal n : mXNodes){\\n\\n try {\\n\\n // Normal Stress\\n // N(i) / A\\n // mInnerHorizontalForceNodes[n] / ( crossSectionArea ) * 10000\\n // (N)/(cm^2)\\n\\n mNormalStressNodes.put(n, mInnerHorizontalForceNodes.get(n).divide(mCrossSection.getArea_of_section(CrossSection.Unit.DEFAULT),12,RoundingMode.HALF_EVEN).multiply(new BigDecimal(10000)));\\n\\n mNormalStressNodesO.put( n, mNormalStressNodes.get(n).setScale(3,RoundingMode.HALF_EVEN) );\\n System.out.println(\\\"setNormalStressNodes() : Success : n = \\\" + n);\\n }catch(Exception e){\\n System.out.println(\\\"setNormalStressNodes() : Failed : n = \\\" + n + \\\" : \\\"+mInnerHorizontalForceNodes.get(n));\\n System.out.println(e);\\n }\\n\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"50323bdd1e363c37c08c2cebcc2e2df4\",\n \"score\": \"0.59420043\",\n \"text\": \"public static final int getTotalRequiredNodes(int levels)\\n {\\n if(levels<1) return -1;\\n \\n return (int)(Math.pow(2, levels+1)-1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67c7ba34e1d1337a8ac6a8c9295a9a03\",\n \"score\": \"0.5927317\",\n \"text\": \"public double likelyhood(List<Node> nodes, ArrayList<ArrayList<Integer>> dataset) {\\n\\t\\tList<Double> setVals = new ArrayList<Double>();\\n\\t\\tfor(ArrayList<Integer> set : dataset) {\\n\\t\\t\\tList<Double> nodeVals = new ArrayList<Double>();\\n\\t\\t\\tfor(Node n : nodes) {\\n//\\t\\t\\t\\tSystem.out.println(\\\"NODE: - \\\" + n.getIdentifier());\\n\\t\\t\\t\\t// find the probability of the parents of this node matching the dataset\\n\\t\\t\\t\\tdouble tempVal = 0;\\n\\t\\t\\t\\tList<Node> parents = n.getParents(); // summon 'rents\\n\\t\\t\\t\\tif(parents.isEmpty()) { // do we have parents?\\n\\t\\t\\t\\t\\t// if we don't then our value is at the null key\\n\\t\\t\\t\\t\\tif(set.get(n.getNodePos()) == 1) nodeVals.add(n.getValue(null));\\n\\t\\t\\t\\t\\tif(set.get(n.getNodePos()) == 0) nodeVals.add(1 - n.getValue(null)); // negate the value if the set has a false value\\n//\\t\\t\\t\\t\\tSystem.out.println(\\\"We got this val: \\\" + nodeVals.get(nodeVals.size()-1));\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n//\\t\\t\\t\\tSystem.out.println(\\\"We have Parent's see: \\\" + n.getParents());\\n\\t\\t\\t\\tList<Boolean> valOfParentsinSet = new ArrayList<Boolean>();\\n\\t\\t\\t\\tfor(Node pNode : parents) { // figure out what values our parents should have\\n\\t\\t\\t\\t\\tif(set.get(pNode.getNodePos()) == 1) valOfParentsinSet.add(true);\\n\\t\\t\\t\\t\\telse if(set.get(pNode.getNodePos()) == 0) valOfParentsinSet.add(false);\\n\\t\\t\\t\\t}\\n//\\t\\t\\t\\tSystem.out.println(\\\"Val of rents\\\" + valOfParentsinSet);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// add the expected value of us given our parents in the data set and negate it if necessary\\n\\t\\t\\t\\tif(set.get(n.getNodePos()) == 1) nodeVals.add(n.getValue(valOfParentsinSet));\\n\\t\\t\\t\\tif(set.get(n.getNodePos()) == 0) nodeVals.add(1 - n.getValue(valOfParentsinSet));\\n\\t\\t\\t\\t\\n//\\t\\t\\t\\tSystem.out.println(\\\"We got this val: \\\" + nodeVals.get(nodeVals.size()-1));\\n\\t\\t\\t}\\n\\t\\t\\t// Total all the node's values\\n\\t\\t\\tdouble totalForSet = 1;\\n//\\t\\t\\tSystem.out.println(\\\"NodeVals: \\\" + nodeVals);\\n\\t\\t\\tfor(Double d : nodeVals) {\\n\\t\\t\\t\\ttotalForSet = totalForSet * d;\\n\\t\\t\\t}\\n\\t\\t\\tsetVals.add(totalForSet);\\n\\t\\t}\\n\\t\\t// total all the dataset's values\\n//\\t\\tSystem.out.println(\\\"Each Set's Values: \\\" + setVals);\\n\\t\\tdouble total = 1;\\n\\t\\tfor(Double d : setVals) {\\n\\t\\t\\ttotal = total * d;\\n\\t\\t}\\n\\t\\treturn total;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"170465765f1677cb802f73584ba4ea53\",\n \"score\": \"0.5847764\",\n \"text\": \"protected void setNormalBendingStressNodes() {\\n mNormalBendingStressNodes = new TreeMap<>();\\n mNormalBendingStressNodesO = new TreeMap<>();\\n\\n for(BigDecimal n : mXNodes){\\n\\n try {\\n\\n // Normal Bending Stress\\n // (My) / (I)\\n // ( mInnerBendingMomentNodes[n] * 0.5 * depthOfSection ) / ( secondMomentOfAreaX )\\n // (Nm.mm)/(cm^4)\\n\\n mNormalBendingStressNodes.put(n, mInnerBendingMomentNodes.get(n)\\n .multiply(\\n new BigDecimal(0.5)\\n .multiply(mCrossSection.depth_of_section)\\n ).divide(\\n mCrossSection.sec_moment_area_x, 12, RoundingMode.HALF_EVEN\\n\\n // Konversi (Nm.mm)/(cm^4) ke (N/m^2)\\n ).multiply(new BigDecimal(100000))\\n );\\n\\n mNormalBendingStressNodesO.put( n, mNormalBendingStressNodes.get(n).setScale(3,RoundingMode.HALF_EVEN) );\\n }catch(Exception e){\\n System.out.println(e);\\n }\\n\\n\\n\\n //System.out.println(\\\"Inner Normal Bending Stress on \\\" + n + \\\" : M : \\\"+mInnerBendingMomentNodes.get(n)+\\\" , y : \\\"+mCrossSection.depth_of_section+\\\" , I : \\\"+mCrossSection.sec_moment_area_x+\\\" \\\" + mInnerBendingMomentNodes.get(n) + \\\" \\\" + mCrossSection.depth_of_section + \\\" \\\" + mCrossSection.sec_moment_area_x + \\\" = \\\" + mNormalBendingStressNodes.get(n) + \\\" ; \\\" );\\n\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1812f0125b4d4b1c2ffce58764b7ad7\",\n \"score\": \"0.584189\",\n \"text\": \"public void setNodeDist(double nodeDist) {\\n this.nodeDist = nodeDist;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ad70a30611097e63e07d2bdf2072fa6\",\n \"score\": \"0.58386034\",\n \"text\": \"@Test\\n void nodeSize() {\\n weighted_graph g = makeGraph(10,0,1) ;\\n Assertions.assertEquals(10,g.nodeSize());\\n g.removeNode(0);\\n Assertions.assertEquals(9,g.nodeSize());\\n g.addNode(9);\\n Assertions.assertEquals(9,g.nodeSize());\\n g.addNode(10);\\n Assertions.assertEquals(10,g.nodeSize());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bf71e069d6ee1acce6c0a56946bce2b5\",\n \"score\": \"0.5832157\",\n \"text\": \"@Before\\n public void initialize() {\\n N1.addConnection(N2);\\n N1.addConnection(N6);\\n\\n //Add connections for nodeTwo\\n N2.addConnection(N3);\\n\\n //Add connections for nodeThree\\n N3.addConnection(N9);\\n\\n //Add connections for nodeFour\\n N4.addConnection(N7);\\n N4.addConnection(N5);\\n\\n //Add connections for nodeFive\\n N5.addConnection(N8);\\n\\n //Add connections for nodeSix\\n\\n //Add connections for nodeSeven\\n N7.addConnection(N6);\\n N7.addConnection(N8);\\n N7.addConnection(N10);\\n\\n //Add connections for nodeEight\\n N8.addConnection(N9);\\n\\n //Add connections for nodeNine\\n N9.addConnection(N15);\\n N9.addConnection(N9_2);\\n\\n //Add connections for nodeTen\\n N10.addConnection(N11);\\n\\n //Add connections for nodeEleven\\n N11.addConnection(N14);\\n\\n //Add connections for nodeTwelve\\n N12.addConnection(N13);\\n N12.addConnection(N16);\\n\\n //Add connections for nodeThirteen\\n N13.addConnection(N14);\\n N13.addConnection(N17);\\n\\n //Add connections for nodeFourteen\\n N14.addConnection(N15);\\n N14.addConnection(N18);\\n\\n //Add connections for nodeFifteen\\n\\n //Add connections for nodeSixteen\\n N16.addConnection(N17);\\n\\n //Add connections for nodeSeventeen\\n N17.addConnection(N20);\\n\\n //Add connections for nodeEighteen\\n N18.addConnection(N19);\\n N18.addConnection(N21);\\n\\n //Add connections for nodeNineteen\\n N19.addConnection(N22);\\n\\n //Add connections for nodeTwenty\\n N20.addConnection(N21);\\n N20.addConnection(N20_2);\\n\\n //Add connections for nodeTwentyOne\\n N21.addConnection(N23);\\n N21.addConnection(N22);\\n\\n //Add connections for nodeTwentyTwo\\n\\n //Add connections for nodeTwentyThree\\n\\n //Add connections for nodeOne_1\\n N1_2.addConnection(N2_2);\\n N1_2.addConnection(N6_2);\\n\\n //Add connections for nodeTwo_2\\n N2_2.addConnection(N3_2);\\n\\n //Add connections for nodeThree_2\\n N3_2.addConnection(N9_2);\\n\\n //Add connections for nodeFour_2\\n N4_2.addConnection(N7_2);\\n N4_2.addConnection(N5_2);\\n\\n //Add connections for nodeFive_2\\n N5_2.addConnection(N8_2);\\n\\n //Add connections for nodeSix_2\\n\\n //Add connections for nodeSeven_2\\n N7_2.addConnection(N6_2);\\n N7_2.addConnection(N8_2);\\n N7_2.addConnection(N10_2);\\n\\n //Add connections for nodeEight_2\\n N8_2.addConnection(N9_2);\\n\\n //Add connections for nodeNine_2\\n N9_2.addConnection(N15_2);\\n\\n //Add connections for nodeTen_2\\n N10_2.addConnection(N11_2);\\n\\n //Add connections for nodeEleven_2\\n N11_2.addConnection(N14_2);\\n\\n //Add connections for nodeTwelve_2\\n N12_2.addConnection(N13_2);\\n N12_2.addConnection(N16_2);\\n\\n //Add connections for nodeThirteen_2\\n N13_2.addConnection(N14_2);\\n N13_2.addConnection(N17_2);\\n\\n //Add connections for nodeFourteen_2\\n N14_2.addConnection(N15_2);\\n N14_2.addConnection(N18_2);\\n\\n //Add connections for nodeFifteen_2\\n\\n //Add connections for nodeSixteen_2\\n N16_2.addConnection(N17_2);\\n\\n //Add connections for nodeSeventeen_2\\n N17_2.addConnection(N20_2);\\n\\n //Add connections for nodeEighteen_2\\n N18_2.addConnection(N19_2);\\n N18_2.addConnection(N21_2);\\n\\n //Add connections for nodeNineteen_2\\n N19_2.addConnection(N22_2);\\n\\n //Add connections for nodeTwenty_2\\n N20_2.addConnection(N21_2);\\n\\n //Add connections for nodeTwentyOne_2\\n N21_2.addConnection(N23_2);\\n N21_2.addConnection(N22_2);\\n\\n //Add connections for nodeTwentyTwo_2\\n\\n //Add connections for nodeTwentyThree_2\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e31eef0dbba34131dd2299d49d9e97cd\",\n \"score\": \"0.5817861\",\n \"text\": \"private void computeNodeWeights() {\\n\\t\\tHashMap<Integer, Double> nodeWeights = new HashMap<Integer, Double>();\\n\\t\\t\\n\\t\\tList<Node> nodes = this.getAllNodes();\\n\\t\\t\\n\\t\\t// init the scores (random as of now)\\n\\t\\tfor(Node n : nodes) {\\n\\t\\t\\tnodeWeights.put(n.getID(), Math.random());\\n\\t\\t}\\n\\t\\t\\n\\t\\t// iterate over all nodes until the difference is negligible\\n\\t\\tdouble diff = 10;\\n\\t\\t// TODO choose some threshold here for accuracy desired\\n\\t\\twhile(diff >= 1) {\\n\\t\\t\\tHashMap<Integer, Double> nodeWeightsTemp = new HashMap<Integer, Double>();\\n\\t\\t\\tdiff = 0;\\n\\t\\t\\t\\n\\t\\t\\tfor(Node n : nodes) {\\n\\t\\t\\t\\tint nodeId = n.getID();\\n\\t\\t\\t\\tdouble n_score = 0;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// get all edges for node\\n\\t\\t\\t\\tList<Edge> edges = n.getEdges();\\n\\t\\t\\t\\tfor(Edge e : edges) {\\n\\t\\t\\t\\t\\t// get node at the other end of the edge\\n\\t\\t\\t\\t\\tlong neighborNodeId = e.getIncidentNodeId(nodeId);\\n\\t\\t\\t\\t\\t// neighbor node\\n\\t\\t\\t\\t\\tNode neighborNode = this.nodes.get((int)neighborNodeId);\\n\\t\\t\\t\\t\\t// get outdegree of neighbor node\\n\\t\\t\\t\\t\\tint outdegree = neighborNode.getOutDegree();\\n\\t\\t\\t\\t\\t// update n_score\\n\\t\\t\\t\\t\\t// TODO need to take the edge weight into account\\n\\t\\t\\t\\t\\tn_score += ((double)nodeWeights.get((int)neighborNodeId)/(double)outdegree);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tdouble nodeWeight = (1-D) + D*(n_score);\\n\\t\\t\\t\\tnodeWeightsTemp.put(nodeId, nodeWeight);\\n\\t\\t\\t\\tn.setWeight(nodeWeight);\\n\\t\\t\\t\\tdiff += Math.abs(nodeWeights.get(nodeId) - nodeWeight);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tnodeWeights = nodeWeightsTemp;\\n\\t\\t\\t// normalize difference\\n\\t\\t\\tdiff = (diff/nodes.size());\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3011b0aa41b6cee13a7f3a980a30482\",\n \"score\": \"0.58037955\",\n \"text\": \"public void komplett() {\\n\\t\\tthis.computeNodeWeights();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d9567a4bd1d547f74809eb2b468252cf\",\n \"score\": \"0.57930756\",\n \"text\": \"public Set<Node> initialiseArticulation() {\\n\\t\\tfor (Entry<Integer, Node> entry : nodes.entrySet()) {\\n\\t\\t\\tentry.getValue().count = Integer.MAX_VALUE;\\n\\t\\t}\\n\\t\\t// get the first node\\n\\t\\tNode start = nodes.values().iterator().next();\\n\\t\\tstart.count = 0;\\n\\t\\tint numSubtrees = 0;\\n\\t\\t\\n\\t\\t// call articulation points on all relevant nodes\\n\\t\\tfor (Node neighbour : start.getNeighbours()) {\\n\\t\\t\\tif (neighbour.count == Integer.MAX_VALUE) {\\n\\t\\t\\t\\titerArticulationPoints(neighbour, start);\\n\\t\\t\\t\\tnumSubtrees++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (numSubtrees > 1) {\\n\\t\\t\\tarticulationPoints.add(start);\\n\\t\\t}\\n\\t\\treturn articulationPoints;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd38cd2dfd00af32e2e587d5e6158450\",\n \"score\": \"0.57911134\",\n \"text\": \"protected abstract double logTreeProbability(final int taxonCount);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"776e20f6258aafd204e1f51dc74cd1af\",\n \"score\": \"0.5770822\",\n \"text\": \"public void prepareNodeChildren(TreeNode node, float skew) {\\n\\n int size = node.children.size();\\n\\n if (size == 0) { return; }\\n\\n float newScore = (float) 0.0;\\n int currentMoveIndex = -1;\\n ArrayList<TreeNode> nodesToChange = new ArrayList<TreeNode>();\\n int i = 0;\\n\\n // if (node.depth == 2) { System.out.println(size); }\\n\\n while (i < size) {\\n\\n TreeNode child = node.children.get(i);\\n\\n // if (node.depth == 2) { System.out.println(child.currentScore); }\\n\\n if (child.moveIndex != currentMoveIndex) {\\n\\n // Fill out all the values\\n\\n int listSize = nodesToChange.size();\\n float totalScore = (float) 0.0;\\n\\n for (int j = 0; j < listSize; j++) {\\n\\n totalScore += nodesToChange.get(j).currentScore * nodesToChange.get(j).probability;\\n\\n // if (node.depth == 2) { System.out.println(nodesToChange.get(j).currentScore); }\\n\\n\\n }\\n // if (totalScore == 0) {System.out.println(\\\"YEETUS0\\\");}\\n\\n // if (node.depth == 1 && ) { totalScore += skew; }\\n\\n for (int j = 0; j < listSize; j++) {\\n\\n nodesToChange.get(j).currentScore = totalScore;\\n\\n }\\n\\n currentMoveIndex = child.moveIndex;\\n nodesToChange = new ArrayList<TreeNode>();\\n\\n }\\n\\n nodesToChange.add(child);\\n i++;\\n\\n }\\n\\n // Since last arraylist won't be processed in the loop.\\n\\n int listSize = nodesToChange.size();\\n float totalScore = (float) 0.0;\\n\\n for (int j = 0; j < listSize; j++) {\\n\\n totalScore += nodesToChange.get(j).currentScore * nodesToChange.get(j).probability;\\n\\n }\\n\\n // if (totalScore == 0) {System.out.println(\\\"YEETUS1\\\");}\\n\\n for (int j = 0; j < listSize; j++) {\\n\\n nodesToChange.get(j).currentScore = totalScore;\\n\\n }\\n\\n // if (node.depth == 2) { System.out.println(node.currentScore); /* System.exit(0); */ }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7eceef2f7e743aab5711fdf6032c89f7\",\n \"score\": \"0.5759885\",\n \"text\": \"public void mutate(){\\n double chance=rng.simpleDouble();\\n if(chance>.8)\\n mutateTopology();\\n else\\n mutateWeights();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ad24b6d7fd61e2de39cbf5c7bae871c\",\n \"score\": \"0.57542145\",\n \"text\": \"protected void setMaxPrincipalStressCMaxNodes(){\\n mMaxPrincipalStressCMaxNodes = new TreeMap<>();\\n mMaxPrincipalStressCMaxNodesO = new TreeMap<>();\\n\\n\\n for(BigDecimal n : mXNodes){\\n\\n // Perhitungan Average Stress di c = y\\n // (total_normal_stress_x + total_normal_stress_y)/2\\n // total_normal_stress_y = 0 ( Tidak dihitung, dianggap nol )\\n\\n BigDecimal avgStress = new BigDecimal(1)\\n .multiply(\\n\\n // Total Tegangan Normal Sumbu x\\n mNormalStressNodes.get(n).abs()\\n .add( mNormalBendingStressNodes.get(n).abs() )\\n\\n // Total Tegangan Normal Sumbu y\\n .add( new BigDecimal(0) )\\n )\\n .divide( new BigDecimal(2),12,RoundingMode.HALF_EVEN );\\n\\n\\n BigDecimal maxInPlaneShearStressPow2 = new BigDecimal(1)\\n .multiply(\\n new BigDecimal(1)\\n .multiply(\\n new BigDecimal(1)\\n .multiply(\\n // Total Tegangan Normal Sumbu x\\n mNormalStressNodes.get(n).abs()\\n .add( mNormalBendingStressNodes.get(n).abs() )\\n\\n // Total Tegangan Normal Sumbu y\\n .subtract( new BigDecimal(0) )\\n )\\n\\n // Dibagi 2\\n .divide( new BigDecimal(2),12,RoundingMode.HALF_EVEN )\\n )\\n // Pangkat 2\\n .pow(2)\\n )\\n .add(\\n // Tegangan Geser XY di Ujung Batang = 0\\n new BigDecimal(0).pow(2)\\n );\\n\\n try{\\n BigDecimal maxInPlaneShearStress;\\n\\n if(maxInPlaneShearStressPow2.setScale(6,RoundingMode.FLOOR).compareTo(new BigDecimal(0.000000)) < 1)\\n {\\n maxInPlaneShearStress = new BigDecimal(0);\\n }else{\\n maxInPlaneShearStress = BigDecimalMath.sqrt(maxInPlaneShearStressPow2);\\n }\\n\\n BigDecimal maxPrincipalStress = avgStress.add(maxInPlaneShearStress);\\n\\n System.out.println(avgStress + \\\" + \\\" + maxInPlaneShearStress + \\\" = \\\" + avgStress.add(maxInPlaneShearStress));\\n\\n mMaxPrincipalStressCMaxNodes.put(n,maxPrincipalStress);\\n mMaxPrincipalStressCMaxNodesO.put(n, mMaxPrincipalStressCMaxNodes.get(n).setScale(3,RoundingMode.HALF_EVEN));\\n //System.out.println(\\\"n : \\\"+n+\\\" \\\"+ mNormalBendingStressNodes.get(n)+\\\" Principal Stress c = y : \\\"+avgStress+\\\" + \\\"+maxInPlaneShearStress+\\\" = \\\"+maxPrincipalStress);\\n\\n if(mMaxPrincipalStressCMaxValue == null){\\n mMaxPrincipalStressCMaxValue = maxPrincipalStress.abs();\\n mMaxPrincipalStressCMaxLocation = n;\\n }else{\\n if(mMaxPrincipalStressCMaxValue.compareTo(maxPrincipalStress)<1){\\n mMaxPrincipalStressCMaxValue = maxPrincipalStress.abs();\\n mMaxPrincipalStressCMaxLocation = n;\\n }\\n }\\n }catch(Exception e){\\n System.out.println(e);\\n }\\n\\n }\\n\\n System.out.println(\\\"==============================================================\\\");\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"507c4ee1b7e40f64b94906470633309c\",\n \"score\": \"0.5703047\",\n \"text\": \"@Override\\r\\n\\tpublic int getNumNodes() {\\r\\n\\t\\treturn nodeMap.size();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f3bda763fead37db0090b045f5f8b02\",\n \"score\": \"0.57018393\",\n \"text\": \"@Override\\n public double[] distributionForInstance(Instance instance) {\\n\\n if (main_Attribute == null) {\\n return class_Distribution;\\n } else {\\n if (main_Attribute.isNumeric()) {\\n if (instance.isMissing(main_Attribute)) {\\n return child_Nodes[splitController.getMostCommon()].distributionForInstance(instance);\\n } else if (instance.value(main_Attribute) <= numericValues[main_Attribute.index()]) {\\n return child_Nodes[0].distributionForInstance(instance); \\n } else {\\n return child_Nodes[1].distributionForInstance(instance); \\n }\\n } else {\\n return child_Nodes[(int) instance.value(main_Attribute)].\\n distributionForInstance(instance);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ca3514bb0635189a0e94183f55154d2\",\n \"score\": \"0.56994253\",\n \"text\": \"void initializeWeight() {\\n if (_weight != 0)\\n return;\\n double max = 1.0 / (Math.sqrt(_childNode.fanIn()));\\n _weight = RandomWeight.INSTANCE.nextDouble(-max, max);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"535f43fbb11fc14faf5ea69c006931fb\",\n \"score\": \"0.5686457\",\n \"text\": \"void doCountProbabilitiesForLeaf(NodeData node, int nSamples, boolean dprint)\\n\\t{\\n\\t\\t/*\\n\\t\\tint nTaxonID = node.m_tree.getTaxonIndex(node.m_tree.getNodeTaxon(node.m_nodeRef));\\n\\t\\tif (nTaxonID != node.getTaxonID()) {\\n\\t\\t\\tint h =3;\\n\\t\\t\\th++;\\n\\t\\t}\\n\\t\\tint n = new Integer((String)node.m_tree.getTaxon(nTaxonID).getAttribute(\\\"totalcount\\\"));\\n\\t\\tif (n != nSamples) {\\n\\t\\t\\tint h =3;\\n\\t\\t\\th++;\\n\\t\\t\\n\\t\\t}\\n\\t\\t*/\\n\\t\\t//node.m_n = nSamples;\\n\\t\\tnode.resize(nSamples);\\n//\\t\\tnode.m_Nb[nSamples] = 1.0;\\n//\\t\\tif( dprint ) {\\n//\\t\\t\\tSystem.out.println(node.getNr() + \\\" n=\\\" + node.m_n + \\\" u1.Nb \\\" + Arrays.toString(node.m_Nb));\\n//\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d096266e5a251fce9c1e1c4f7d437d17\",\n \"score\": \"0.5685083\",\n \"text\": \"public void update() {\\n for (int i = 0; i < numNodes; i++){\\n nodes.get(i).Update();\\n }\\n\\n if (numNodes <= 0) {\\n counter -= 1;\\n if (counter <= 0){\\n CreateNode();\\n counter = maxCounter;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5652091d468ec949e3aec43f93b3564a\",\n \"score\": \"0.5670887\",\n \"text\": \"private void defaultWeightForEachNode() {\\n for (node_data defaultedNode : this.g.getV()) {\\n setWeightToDefault(defaultedNode);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3623170c9b4eaa45a8f973840e51e6fb\",\n \"score\": \"0.5660523\",\n \"text\": \"protected void createXNodes(){\\n int divider = 200;\\n\\n // Menentukan jarak antar titik\\n BigDecimal step = mInput.getBeamLength().divide(new BigDecimal(divider), 4, RoundingMode.HALF_EVEN);\\n\\n // Inisiasi TreeSet xnodes sebagai penampung titik-titik pengujian\\n mXNodes = new TreeSet<>();\\n\\n // Mengisi TreeSet xnodes dengan titik-titik pengujian\\n for(int i=0;i<=divider;i++){\\n\\n // Titik-titik pengujian merupakan hasil kali titik pengujian ke n , dengan step\\n mXNodes.add(new BigDecimal(i).multiply(step));\\n }\\n\\n // Memasukan titik massa beban ke TreeSet xnodes\\n mXNodes.add(mInput.getForcePosition().setScale(3,RoundingMode.HALF_EVEN));\\n\\n // Memasukan 0.999 * titik massa beban ke TreeSet xnodes\\n mXNodes.add( mInput.getForcePosition().multiply(new BigDecimal(1000)).subtract(new BigDecimal(1)).divide(new BigDecimal(1000)) );\\n\\n // Memasukan 0.999 * panjang beam ke TreeSet xnodes\\n mXNodes.add( mInput.getBeamLength().multiply(new BigDecimal(1000)).subtract(new BigDecimal(1)).divide(new BigDecimal(1000)) );\\n\\n if(mInput.getSimulationID()==3){\\n // Memasukan Ltx ke TreeSet xnodes\\n mXNodes.add(mInput.getLTx().setScale(3,RoundingMode.HALF_EVEN));\\n\\n // Memasukan 0.999 * Ltx ke TreeSet xnodes\\n mXNodes.add( mInput.getLTx().multiply(new BigDecimal(1000)).subtract(new BigDecimal(1)).divide(new BigDecimal(1000)) );\\n }\\n\\n // Menguji titik-titik pengujian yang telah dibuat\\n for(BigDecimal xnode: mXNodes){\\n // System.out.println(xnode);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7836032a5aa1e48ab723de77ef27bfd\",\n \"score\": \"0.56428796\",\n \"text\": \"int getNumberOfNodes();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d966f0ccafb3667d476da0fb6cb541ca\",\n \"score\": \"0.56381315\",\n \"text\": \"private void createRUSHTree() {\\n\\t\\tfor (int i = 1; i <= 10; ++i) {\\n\\t\\t\\tif (this.root == null) {\\n\\t\\t\\t\\tNode newNode = getNewNode();\\n\\t\\t\\t\\tthis.root = newNode;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tNode newNode = getNewNode();\\n\\t\\t\\t\\tthis.addClusterNode(newNode);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tSystem.out.println(\\\"height = \\\" + getHeightOfTree(this.root));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f998bd0374682f8f9f82c62130413cad\",\n \"score\": \"0.5623814\",\n \"text\": \"private double[] getClassDistribution(myC45 node) {\\n double [] dist = new double[node.dataset.numClasses()];\\n Enumeration instEnum = node.dataset.enumerateInstances();\\n while (instEnum.hasMoreElements()) {\\n Instance inst = (Instance) instEnum.nextElement();\\n dist[(int) inst.classValue()]++;\\n }\\n Utils.normalize(dist);\\n return dist;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"88594cf03c2f543cd623795af11ad93e\",\n \"score\": \"0.5617742\",\n \"text\": \"protected void setMaxPrincipalStressCZeroNodes(){\\n mMaxPrincipalStressCZeroNodes = new TreeMap<>();\\n mMaxPrincipalStressCZeroNodesO = new TreeMap<>();\\n\\n for(BigDecimal n : mXNodes){\\n\\n // Perhitungan Average Stress di c = 0\\n // (total_normal_stress_x + total_normal_stress_y)/2\\n // total_normal_stress_y = 0 ( Tidak dihitung, dianggap nol )\\n\\n BigDecimal avgStress = new BigDecimal(1)\\n .multiply(\\n\\n // Total Tegangan Normal Sumbu x\\n // Pada c = 0 , Tegangan Normal sumbu x akibat Momen Lentur = 0\\n // Sehingga yang dihitung hanya Tegangan Normal sumbu x\\n mNormalStressNodes.get(n)\\n\\n\\n // Total Tegangan Normal Sumbu y\\n .add( new BigDecimal(0) )\\n )\\n .divide( new BigDecimal(2),12,RoundingMode.HALF_EVEN );\\n\\n BigDecimal maxInPlaneShearStressPow2 = new BigDecimal(1)\\n .multiply(\\n new BigDecimal(1)\\n .multiply(\\n new BigDecimal(1)\\n .multiply(\\n // Total Tegangan Normal Sumbu x\\n // Pada c = 0 , Tegangan Normal sumbu x akibat Momen Lentur = 0\\n // Sehingga yang dihitung hanya Tegangan Normal sumbu x\\n mNormalStressNodes.get(n)\\n\\n // Total Tegangan Normal Sumbu y\\n .subtract( new BigDecimal(0) )\\n )\\n\\n // Dibagi 2\\n .divide( new BigDecimal(2),12,RoundingMode.HALF_EVEN )\\n )\\n // Pangkat 2\\n .pow(2)\\n )\\n .add(\\n // Tegangan Geser XY di c = 0\\n mShearStressNodes.get(n).pow(2)\\n );\\n\\n try{\\n BigDecimal maxInPlaneShearStress;\\n\\n if(maxInPlaneShearStressPow2.setScale(6,RoundingMode.FLOOR).compareTo(new BigDecimal(0.000000)) < 1)\\n {\\n maxInPlaneShearStress = new BigDecimal(0);\\n }else{\\n maxInPlaneShearStress = BigDecimalMath.sqrt(maxInPlaneShearStressPow2);\\n }\\n\\n BigDecimal maxPrincipalStress = avgStress.add(maxInPlaneShearStress);\\n\\n mMaxPrincipalStressCZeroNodes.put(n,maxPrincipalStress);\\n mMaxPrincipalStressCZeroNodesO.put(n, mMaxPrincipalStressCZeroNodes.get(n).setScale(3,RoundingMode.HALF_EVEN));\\n //System.out.println(\\\"n : \\\"+n+\\\" \\\"+ mNormalBendingStressNodes.get(n)+\\\" Principal Stress c = 0 : \\\"+avgStress+\\\" + \\\"+maxInPlaneShearStress+\\\" = \\\"+maxPrincipalStress);\\n\\n if(mMaxPrincipalStressCZeroValue == null){\\n mMaxPrincipalStressCZeroValue = maxPrincipalStress.abs();\\n mMaxPrincipalStressCZeroLocation = n;\\n }else{\\n if(mMaxPrincipalStressCZeroValue.compareTo(maxPrincipalStress)<1){\\n mMaxPrincipalStressCZeroValue = maxPrincipalStress.abs();\\n mMaxPrincipalStressCZeroLocation = n;\\n }\\n }\\n }catch(Exception e){\\n e.printStackTrace();\\n }\\n\\n }\\n\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0e036aa36cf5c71bc922e8ef242e72f\",\n \"score\": \"0.56152874\",\n \"text\": \"static void numberOfNodes(int s, int e)\\n {\\n count1[s] = 1;\\n for(Integer u: adj[s])\\n {\\n // condition to omit reverse path\\n // path from children to parent\\n if(u == e)\\n continue;\\n \\n // recursive call for DFS\\n numberOfNodes(u ,s);\\n \\n // update count[] value of parent using \\n // its children\\n count1[s] += count1[u];\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f0451e265455aa1673e525833be525e\",\n \"score\": \"0.5605676\",\n \"text\": \"public int numNodes();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c16df58755a1f7cd2afa61b3028bbc8b\",\n \"score\": \"0.560284\",\n \"text\": \"public double getSmallWorldProperty(Graph graph){\\n\\t\\t\\t\\n\\t\\tdouble LRand = 0;\\n\\t\\tdouble CRand = 0;\\n\\t\\tGraph randomGraph;\\n\\t\\t\\n\\t\\tfor(int j = 0; j < 100; j++){\\n\\t\\t\\trandomGraph = new SingleGraph(\\\"Random graph\\\");\\n\\t\\t\\tGenerator gen = new RandomGenerator(Toolkit.averageDegree(graph));\\n\\t\\t\\tgen.addSink(randomGraph);\\n\\t\\t\\tgen.begin();\\n\\t\\t\\tfor (int i = 0; i < graph.getNodeCount(); i++)\\n\\t\\t\\t\\tgen.nextEvents();\\n\\t\\t\\tgen.end();\\n\\t\\t\\t\\n\\t\\t\\tIterator<Edge> edgeIt = randomGraph.getEdgeIterator();\\n\\t\\t\\twhile(edgeIt.hasNext()){\\n\\t\\t\\t\\tEdge edge = edgeIt.next();\\n\\t\\t\\t\\tedge.addAttribute(\\\"length\\\",1);\\n\\t\\t\\t}\\n\\t\\t\\n\\t\\t\\tLRand += this.getCharacteristicPathPength(randomGraph);\\n\\t\\t\\tCRand += Toolkit.averageClusteringCoefficient(randomGraph);\\n\\t\\t\\t\\n\\t\\t\\tif(randomGraph.getNodeCount() > graph.getNodeCount()){\\n\\t\\t\\t\\tint limit = randomGraph.getNodeCount()-graph.getNodeCount();\\n\\t\\t\\t\\tint i= 0;\\n\\t\\t\\t\\twhile(i < limit){\\n\\t\\t\\t\\t\\tNode node = Toolkit.randomNode(randomGraph);\\n\\t\\t\\t\\t\\tif(node.getDegree() > 1){\\n\\t\\t\\t\\t\\t\\trandomGraph.removeNode(node);\\n\\t\\t\\t\\t\\t\\ti++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(randomGraph.getEdgeCount() != graph.getEdgeCount()){\\n\\t\\t\\t\\tNode node1 = null;\\n\\t\\t\\t\\tNode node2 = null;\\n\\t\\t\\t\\tint edgeLimit = randomGraph.getEdgeCount() - graph.getEdgeCount();\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(edgeLimit < 0){\\n\\t\\t\\t\\t\\t//We've got to add some edges!\\n\\t\\t\\t\\t\\twhile(edgeLimit != 0){\\n\\t\\t\\t\\t\\t\\twhile(node1 == node2){\\n\\t\\t\\t\\t\\t\\t\\tnode1 = Toolkit.randomNode(randomGraph);\\n\\t\\t\\t\\t\\t\\t\\tnode2 = Toolkit.randomNode(randomGraph);\\t\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\ttry{\\n\\t\\t\\t\\t\\t\\t\\trandomGraph.addEdge(String.valueOf(randomGraph.getEdgeCount()+1), node1, node2);\\n\\t\\t\\t\\t\\t\\t\\tedgeLimit +=1;\\n\\t\\t\\t\\t\\t\\t}catch(Exception e){\\n\\t\\t\\t\\t\\t\\t\\t//bad code :( but easy code :),\\n\\t\\t\\t\\t\\t\\t\\t//You get enter this catch when trying to add an edge between two nodes that all ready exists.\\n\\t\\t\\t\\t\\t\\t\\tnode1 = null;\\n\\t\\t\\t\\t\\t\\t\\tnode2 = null;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}else if(edgeLimit > 0){\\n\\t\\t\\t\\t\\t//We've got to remove some edges!\\t\\n\\t\\t\\t\\t\\twhile(edgeLimit != 0){\\n\\t\\t\\t\\t\\t\\tEdge edge = Toolkit.randomEdge(randomGraph);\\n\\t\\t\\t\\t\\t\\trandomGraph.removeEdge(edge);\\n\\t\\t\\t\\t\\t\\tedgeLimit -= 1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\trandomGraph.clear();\\n\\t\\t}\\n\\t\\tLRand = LRand/20;\\n\\t\\tCRand = CRand/20;\\n\\t\\tdouble L = this.getCharacteristicPathPength(graph);\\n\\t\\tdouble C = Toolkit.averageClusteringCoefficient(graph);\\n\\t\\t\\n\\t\\tdouble smallW = (C/CRand)/(L/LRand);\\t\\n\\t\\t\\n\\t\\treturn smallW;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"963a224d3b24930c9db5a998d308d360\",\n \"score\": \"0.56014454\",\n \"text\": \"int getLevelForDist (\\n double dist\\n );\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7381976d67dbb9ffcc9bbfd99d3285ce\",\n \"score\": \"0.559398\",\n \"text\": \"private void calculateTopLevels() {\\n Queue<MutableNode> queue = wip.getNodesList().stream()\\n .filter(x -> x.getIncomingEdges().isEmpty())\\n .collect(Collectors.toCollection(LinkedList::new));\\n\\n while (!queue.isEmpty()) {\\n val node = queue.poll();\\n val topLevel = node.getIncomingEdges().keySet()\\n .stream()\\n .mapToInt(Node::getTopLevel)\\n .max()\\n .orElse(0) + node.getWeight();\\n node.setTopLevel(topLevel);\\n\\n for (val node2 : node.getOutgoingEdges().keySet()) {\\n queue.offer((MutableNode) node2);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a09f42d6b6dbe53a342e57779836f6bd\",\n \"score\": \"0.5588147\",\n \"text\": \"private void initDepth(){\\n Dijkstra dijkstra = new Dijkstra(Dijkstra.Element.EDGE, \\\"result\\\", null);\\n dijkstra.init(tree);\\n dijkstra.setSource(tree.getNode(rootId));\\n dijkstra.compute();\\n for(Node n:tree.getNodeSet()){\\n int depth = (int)dijkstra.getPathLength(n);\\n n.addAttribute(\\\"depth\\\",depth);\\n //System.out.printf(\\\"%s->%s:%d%n\\\", dijkstra.getSource(), n, (int)dijkstra.getPathLength(n));\\n if (depth > maxDepth) maxDepth = depth;\\n if(depthMap.containsKey(depth)) depthMap.get(depth).add(n.getId());\\n else{\\n Set<String> temp = new HashSet<>();\\n temp.add(n.getId());\\n depthMap.put(depth,temp);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"499738e386b06d9208f84757cd081551\",\n \"score\": \"0.55869603\",\n \"text\": \"public int getNodesGenerated();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e26ad82f89629b2ec2e21e3a8439b3d4\",\n \"score\": \"0.55572325\",\n \"text\": \"public static void grow(DefaultMutableTreeNode node, int depth, Random rand, int maxNodes) {\\r\\n\\r\\n\\t\\tExpression exp = (Expression) node.getUserObject();\\r\\n\\r\\n\\t\\t// ako je node terminal odmah se izlazi iz funkcije\\r\\n\\t\\tif (exp.status == Status.TERMINAL) {\\r\\n\\t\\t\\treturn;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tIFunction fun = (IFunction) node.getUserObject();\\r\\n\\r\\n\\t\\tif (node.isRoot()) {\\r\\n\\t\\t\\temptySpaces = fun.getNumberOfOutputs();\\r\\n\\t\\t\\tcurrentNodes = 1;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// stvaranje terminala ako je maksimalna dubina\\r\\n\\t\\tif (depth == 0 || maxNodes < currentNodes + emptySpaces) {\\r\\n\\r\\n\\t\\t\\tfor (int i = 0; i < fun.getNumberOfOutputs(); i++) {\\r\\n\\r\\n\\t\\t\\t\\tExpression e = terminals.get(rand.nextInt(terminals.size())).duplicate();\\r\\n\\t\\t\\t\\tfun.addOutput(e);\\r\\n\\t\\t\\t\\tnode.add(new DefaultMutableTreeNode(e));\\r\\n\\t\\t\\t\\tcurrentNodes += 1;\\r\\n\\t\\t\\t\\temptySpaces -= 1;\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\treturn;\\r\\n\\r\\n\\t\\t} else {\\r\\n\\r\\n\\t\\t\\t// ako je razina != 0 onda se stvara ili terminal ili funkciju\\r\\n\\t\\t\\tfor (int i = 0; i < fun.getNumberOfOutputs(); i++) {\\r\\n\\r\\n\\t\\t\\t\\tExpression e = rand.nextFloat() > 0.5 ? terminals.get(rand.nextInt(terminals.size())).duplicate()\\r\\n\\t\\t\\t\\t\\t\\t: functions.get(rand.nextInt(functions.size())).duplicate();\\r\\n\\r\\n\\t\\t\\t\\tif (maxNodes <= currentNodes + emptySpaces) {\\r\\n\\r\\n\\t\\t\\t\\t\\te = terminals.get(rand.nextInt(terminals.size())).duplicate();\\r\\n\\t\\t\\t\\t\\tfun.addOutput(e);\\r\\n\\t\\t\\t\\t\\tnode.add(new DefaultMutableTreeNode(e));\\r\\n\\t\\t\\t\\t\\temptySpaces -= 1;\\r\\n\\t\\t\\t\\t\\tcurrentNodes += 1;\\r\\n\\r\\n\\t\\t\\t\\t} else {\\r\\n\\r\\n\\t\\t\\t\\t\\tfun.addOutput(e);\\r\\n\\t\\t\\t\\t\\tnode.add(new DefaultMutableTreeNode(e));\\r\\n\\r\\n\\t\\t\\t\\t\\tif (e.status == Status.FUNCTION) {\\r\\n\\t\\t\\t\\t\\t\\temptySpaces += ((IFunction) e).getNumberOfOutputs();\\r\\n\\t\\t\\t\\t\\t\\temptySpaces -= 1;\\r\\n\\t\\t\\t\\t\\t\\tcurrentNodes += 1;\\r\\n\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\temptySpaces -= 1;\\r\\n\\t\\t\\t\\t\\t\\tcurrentNodes += 1;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// dohvat novo dodanih cvorova\\r\\n\\t\\tEnumeration<DefaultMutableTreeNode> en = node.children();\\r\\n\\r\\n\\t\\t// za svaki dohvaceni cvor se rekurzivno generiraju novi cvorovi ovisno\\r\\n\\t\\t// o broju funkcija koje neki cvor moze imati i dubini na kojoj se cvor nalazi\\r\\n\\t\\twhile (en.hasMoreElements()) {\\r\\n\\r\\n\\t\\t\\tDefaultMutableTreeNode child = en.nextElement();\\r\\n\\r\\n\\t\\t\\tgrow(child, depth - 1, rand, maxNodes);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe5523908cd43b842495a390931135ec\",\n \"score\": \"0.5555347\",\n \"text\": \"private double calcNodeEntropy(ArrayList<Data> data2) {\\n\\t\\treturn 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af5e0a3d990114187506406891bd9d42\",\n \"score\": \"0.5553604\",\n \"text\": \"private void createMaps() {\\n\\t\\t//Long beginTime = System.currentTimeMillis();\\n\\t\\tassumeGraphFinished = true;\\n\\n\\t\\t// initialize now to avoid the containsKey() checks later\\n\\t\\tfor (NodeType node: getNodes()) \\n\\t\\t\\tdistMap.put(node, new HashMap<NodeType,Byte>());\\n\\n\\t\\tMap<NodeType,Byte> nodeDist = null; \\n\\t\\tMap<NodeType,Byte> neighbor1Dist = null; \\n\\t\\tMap<NodeType,Byte> neighbor2Dist = null; \\n\\n\\t\\tfor (NodeType node: getNodes()) {\\n\\n\\t\\t\\tboolean distPut = false;\\n\\t\\t\\t\\n\\t\\t\\t// to minimize the number of gets\\n\\t\\t\\tnodeDist = distMap.get(node);\\n\\n\\t\\t\\tfor (NodeType neighbor1: getNeighbors(node)) {\\n\\n\\t\\t\\t\\t// to minimize the number of gets\\n\\t\\t\\t\\tneighbor1Dist = distMap.get(neighbor1);\\n\\n\\t\\t\\t\\tnodeDist.put(neighbor1,(byte)1);\\n\\t\\t\\t\\tneighbor1Dist.put(node,(byte)1);\\n\\n\\t\\t\\t\\tfor (NodeType neighbor2: getNeighbors(node)) {\\n\\n\\t\\t\\t\\t\\tif ( neighbor1 == neighbor2 )\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\n\\t\\t\\t\\t\\t// to minimize the number of gets\\n\\t\\t\\t\\t\\tneighbor2Dist = distMap.get(neighbor2);\\n\\n\\t\\t\\t\\t\\t// only add new dist/prob if it hasn't already been set\\n\\t\\t\\t\\t\\t// if it has been set once, we know that it has been set\\n\\t\\t\\t\\t\\t// with the min possible value.\\n\\n\\t\\t\\t\\t\\t// only check one direction because we always set both\\n\\t\\t\\t\\t\\t// at a given time.\\n\\n\\t\\t\\t\\t\\tif ( !neighbor1Dist.containsKey(neighbor2) ) {\\n\\t\\t\\t\\t\\t\\tneighbor1Dist.put(neighbor2,(byte)2);\\n\\t\\t\\t\\t\\t\\tneighbor2Dist.put(neighbor1,(byte)2);\\n\\t\\t\\t\\t\\t}\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//Long totalTime = System.currentTimeMillis() - beginTime;\\n\\t\\t//System.out.println(\\\"createMap duration: \\\" + totalTime + \\\" for size: \\\" + probMap.size());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b565845db205ef0d8c93a44070f63d67\",\n \"score\": \"0.5542694\",\n \"text\": \"private void maxValueWeight() {\\n\\t\\tCollection<node_data> nodes = g.getV();\\n\\t\\tfor(node_data a: nodes)\\n\\t\\t\\ta.setWeight(Double.MAX_VALUE);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"235244ff62118497ea01627625ae3983\",\n \"score\": \"0.55383354\",\n \"text\": \"private void mutateLayer(Layer l, double probability, double majorprobability){\\n Random random = new Random();\\n for(Neuron n : l.getNeurons()){\\n for(IncomingNeuron in : n.getIncominglinks()){\\n int r = random.nextInt(100);\\n if(r < probability){\\n r = random.nextInt(100);\\n if(r < majorprobability){\\n double delta = (random.nextDouble()-0.5)*2*majormutationmax;\\n in.setWeight(in.getWeight()+delta);\\n if(delta < 0 ){neg++;}else{pos++;}\\n }else{\\n r = random.nextInt(100);\\n if(r < 10){\\n double delta = (random.nextDouble()-0.5)*2*extrememutationmax;\\n in.setWeight(in.getWeight()+ delta);\\n if(delta < 0 ){neg++;}else{pos++;}\\n }else{\\n double delta = (random.nextDouble()-0.5)*2*slightmutationmax;\\n in.setWeight(in.getWeight()+ delta);\\n if(delta < 0 ){neg++;}else{pos++;}\\n }\\n }\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a86cd7a38f932bb692210197a5467ba5\",\n \"score\": \"0.5533851\",\n \"text\": \"public void setLevels() throws Exception {\\n\\n if(nodes.size() == 0) {\\n throw new Exception(\\\"Nie zaladowano wezlow.\\\");\\n }\\n\\n //Kolejka wezlow do etykietowania.\\n List<Node> nodesToCount = new ArrayList<>();\\n\\n //Dla korzeni (ostatnich wezlow) ustawia poziom na 1 i dodaje poprzedników do kolejki.\\n for(Node node : nodes) {\\n if(node.getNextNodes().size() == 0) {\\n node.setLevel(1);\\n List<Node> previousNodes = node.getPreviousNodes();\\n for(Node previousNode : previousNodes) {\\n if(!nodesToCount.contains(previousNode)) {\\n nodesToCount.add(previousNode);\\n }\\n }\\n }\\n }\\n\\n //Wylicza poziomy dla pozostalych wezlow.\\n while(nodesToCount.size() > 0) {\\n\\n Node node = nodesToCount.get(0);\\n int maximum = 0;\\n\\n //Wyznacza maksymalny poziom wsrod nastepnikow.\\n List<Node> nextNodes = node.getNextNodes();\\n for(Node nextNode : nextNodes) {\\n if(nextNode.getLevel() > maximum) {\\n maximum = nextNode.getLevel();\\n }\\n }\\n\\n node.setLevel(maximum + 1);\\n\\n //Dodaje kolejnych poprzednikow do kolejki.\\n List<Node> previousNodes = node.getPreviousNodes();\\n\\n for(Node previousNode : previousNodes) {\\n if(!nodesToCount.contains(previousNode)) {\\n nodesToCount.add(previousNode);\\n }\\n }\\n\\n nodesToCount.remove(0);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"df34a4602cdc619816839ef1f084c00a\",\n \"score\": \"0.55308145\",\n \"text\": \"private void constructTrees() {\\n\\t\\tfinal HashMap<Integer, Integer> minDis = new HashMap<Integer, Integer>();\\r\\n\\t\\tint maxId = 0;\\r\\n\\t\\tfor (final Variable v : this.view.varMap.values()) {\\r\\n\\t\\t\\tif (v.id > maxId) {\\r\\n\\t\\t\\t\\tmaxId = v.id;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tmaxId++;\\r\\n\\t\\tfor (final Variable v : this.view.varMap.values()) {\\r\\n\\t\\t\\tif (v.fixed) {\\r\\n\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tfinal ArrayList<Variable> queue = new ArrayList<Variable>();\\r\\n\\t\\t\\tqueue.add(v);\\r\\n\\t\\t\\tminDis.put(v.id * maxId + v.id, 0);\\r\\n\\t\\t\\tfinal HashSet<Integer> visited = new HashSet<Integer>();\\r\\n\\t\\t\\tvisited.add(v.id);\\r\\n\\t\\t\\twhile (!queue.isEmpty()) {\\r\\n\\t\\t\\t\\tfinal Variable var = queue.remove(0);\\r\\n\\t\\t\\t\\tfor (final Constraint c : var.neighbors) {\\r\\n\\t\\t\\t\\t\\tfinal Variable n = c.getNeighbor(var);\\r\\n\\t\\t\\t\\t\\tif (n.fixed) {\\r\\n\\t\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tif (!visited.contains(n.id)) {\\r\\n\\t\\t\\t\\t\\t\\tqueue.add(n);\\r\\n\\t\\t\\t\\t\\t\\tfinal int depth = minDis.get(v.id * maxId + var.id);\\r\\n\\t\\t\\t\\t\\t\\tvisited.add(n.id);\\r\\n\\t\\t\\t\\t\\t\\tminDis.put(v.id * maxId + n.id, depth + 1);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tfinal HashSet<Integer> pSet = new HashSet<Integer>();\\r\\n\\t\\tfinal HashSet<Integer> cSet = new HashSet<Integer>();\\r\\n\\t\\tfor (final Constraint c : this.self.neighbors) {\\r\\n\\t\\t\\tfinal Variable n = c.getNeighbor(this.self);\\r\\n\\t\\t\\tif (!n.fixed) {\\r\\n\\t\\t\\t\\tcSet.add(n.id);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tthis.enumerate(pSet, cSet, minDis, maxId);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e51e995b554cfe5dd4bab08816e0552\",\n \"score\": \"0.5521069\",\n \"text\": \"public static void check(){\\n Digraph g = new Digraph(13);\\n g.addEdge(4, 2);\\n g.addEdge(2, 3);\\n g.addEdge(3, 2);\\n g.addEdge(6, 0);\\n g.addEdge(0, 1);\\n g.addEdge(2, 0);\\n g.addEdge(11, 12);\\n g.addEdge(12, 9);\\n g.addEdge(9, 10);\\n g.addEdge(9, 11);\\n g.addEdge(7, 9);\\n g.addEdge(10, 12);\\n g.addEdge(11, 4);\\n g.addEdge(4, 3);\\n g.addEdge(3, 5);\\n g.addEdge(6, 8);\\n g.addEdge(8, 6);\\n g.addEdge(5, 4);\\n g.addEdge(0, 5);\\n g.addEdge(6, 4);\\n g.addEdge(6, 9);\\n g.addEdge(7, 6);\\n\\n BreadthFirstPaths bfp = new BreadthFirstPaths(g, 0);\\n StdOut.printf(\\\"From 0 to %d: %d\\\\n\\\", 0, bfp.distTo(0));\\n StdOut.printf(\\\"From 0 to %d: %d\\\\n\\\", 1, bfp.distTo(1));\\n StdOut.printf(\\\"From 0 to %d: %d\\\\n\\\", 2, bfp.distTo(2));\\n StdOut.printf(\\\"From 0 to %d: %d\\\\n\\\", 3, bfp.distTo(3));\\n StdOut.printf(\\\"From 0 to %d: %d\\\\n\\\", 4, bfp.distTo(4));\\n StdOut.printf(\\\"From 0 to %d: %d\\\\n\\\", 5, bfp.distTo(5));\\n StdOut.printf(\\\"From 0 to %d: %d\\\\n\\\", 6, bfp.distTo(6));\\n StdOut.printf(\\\"From 0 to %d: %d\\\\n\\\", 8, bfp.distTo(8));\\n StdOut.printf(\\\"From 0 to %d: %d\\\\n\\\", 9, bfp.distTo(9));\\n StdOut.printf(\\\"From 0 to %d: %d\\\\n\\\", 10, bfp.distTo(10));\\n StdOut.printf(\\\"From 0 to %d: %d\\\\n\\\\n\\\", 11, bfp.distTo(11));\\n\\n BreadthFirstPaths bfp1 = new BreadthFirstPaths(g, 7);\\n StdOut.printf(\\\"From 7 to %d: %d\\\\n\\\", 0, bfp1.distTo(0));\\n StdOut.printf(\\\"From 7 to %d: %d\\\\n\\\", 1, bfp1.distTo(1));\\n StdOut.printf(\\\"From 7 to %d: %d\\\\n\\\", 6, bfp1.distTo(6));\\n StdOut.printf(\\\"From 7 to %d: %d\\\\n\\\", 8, bfp1.distTo(8));\\n StdOut.printf(\\\"From 7 to %d: %d\\\\n\\\", 12, bfp1.distTo(12));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f4f9d5d5b55e4d5eff15ae29cdc1c84f\",\n \"score\": \"0.5502089\",\n \"text\": \"public void doGenerate() {\\r\\n\\r\\n\\tint n = (int) getLongParameter(pN.name);\\r\\n\\tlong dimSize = getLongParameter(pDimSize.name);\\r\\n\\r\\n\\tboolean hasMore = true;\\r\\n\\tint currNode[] = new int[n];\\r\\n\\r\\n\\t// Set the index in each dimension to be 0 first\\r\\n\\tfor (int i = 0; i < n; i++)\\r\\n\\t currNode[i] = 0;\\r\\n\\r\\n\\t// Systematically loop through all nodes indexed by their\\r\\n\\t// position in the n-dimensional grid, adding edges\\r\\n\\t// between adjacent nodes\\r\\n\\twhile (hasMore) {\\r\\n\\r\\n\\t // First find the next node\\r\\n\\t for (int i = 0; i < n; i++) {\\r\\n\\t\\tif (currNode[i] < dimSize - 1) {\\r\\n\\t\\t currNode[i]++;\\r\\n\\t\\t break;\\r\\n\\t\\t} else {\\r\\n\\t\\t currNode[i] = 0;\\r\\n\\t\\t if(i == n - 1)\\r\\n\\t\\t\\thasMore = false;\\r\\n\\t\\t}\\r\\n\\t }\\r\\n\\r\\n\\t int node1 = translateIndices(currNode, dimSize, n);\\r\\n\\r\\n\\t // Now add one to each dimension in the node and\\r\\n\\t // add edges back and forth\\r\\n\\t for (int i = 0; i < n; i++) {\\r\\n\\t\\tif (currNode[i] + 1 < dimSize) {\\r\\n\\t\\t currNode[i]++;\\r\\n\\t\\t int node2 = translateIndices(currNode, dimSize, n);\\r\\n\\r\\n\\t\\t // Add the edges to the graph\\r\\n\\t\\t addEdge(node1, node2);\\r\\n\\t\\t addEdge(node2, node1);\\r\\n\\r\\n\\t\\t // Reset currNode to the currentNode\\r\\n\\t\\t currNode[i]--;\\r\\n\\t\\t}\\r\\n\\t }\\r\\n\\t}\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab97e1f704a23d65997f9025bfb716b9\",\n \"score\": \"0.54845965\",\n \"text\": \"protected abstract void addNodes(Node root, double factor, Collection<Node> nodes,\\n Snapshot snapshot, String selectedLabel, boolean takeSnapshot);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c36d578bacd77e2f1837184540e443ee\",\n \"score\": \"0.54802424\",\n \"text\": \"int getNodesCount();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"689416931aff71f8720a1f27b33e1c48\",\n \"score\": \"0.5471129\",\n \"text\": \"protected int weight( Node n )\\n { return n.isConcrete() ? 0 : n.equals( Node.ANY ) ? 5 : bound.contains( n ) ? 1 : 4; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5fe1e2bebf7c2511c0295e56a79e2d47\",\n \"score\": \"0.5464879\",\n \"text\": \"public static void simulate() {\\n\\t\\t\\n\\t\\t// Build a list of non evidence node!\\n\\t\\tArrayList<BNNode> nonEvidenceNodes = new ArrayList<>();\\n\\t\\tfor (BNNode node : BNNode.nodes) {\\n\\t\\t\\tif (!node.isEvidence) {\\n\\t\\t\\t\\tnonEvidenceNodes.add(node);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t// Randomly assign them. Initialization does not really matter!\\n\\t\\tRandom random = new Random();\\n\\t\\tfor (BNNode node : nonEvidenceNodes) {\\n\\t\\t\\tnode.value = random.nextBoolean();\\n\\t\\t}\\n\\t\\t\\n\\t\\t// Initialize the statistic variables\\n\\t\\tint totalNENs = nonEvidenceNodes.size();\\n\\t\\tint[] trueCounts = new int[totalNENs];\\n\\t\\tdouble[] totalCPs = new double[totalNENs];\\n\\t\\t\\n\\t\\t// For each iterations\\n\\t\\tfor (int i= 0; i < iterations; i++) {\\n\\t\\t\\t\\n\\t\\t\\t// Loop through non evidence node and update!\\n\\t\\t\\t// For each non evidence node index ..\\n\\t\\t\\tfor (int j = 0; j < totalNENs; j++) {\\n\\t\\t\\t\\tBNNode node = nonEvidenceNodes.get(j);\\n\\t\\t\\t\\t// Set the node to true\\n\\t\\t\\t\\tnode.value = true;\\n\\t\\t\\t\\t// Compute CPT entry (without normalizaing constant). (CPT Return the probs that the node is true)\\n\\t\\t\\t\\tdouble trueCP = node.cptLookup();\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// For each child\\n\\t\\t\\t\\tfor (int k = 0; k < node.children.length; k++) {\\n\\t\\t\\t\\t\\t// Multiply this child CPT entry (or 1 minus that if the child is false)\\n\\t\\t\\t\\t\\tif (node.children[k].value) { \\n\\t\\t\\t\\t\\t\\ttrueCP *= node.children[k].cptLookup();\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\ttrueCP *= (1 - node.children[k].cptLookup());\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Set the node to false\\n\\t\\t\\t\\tnode.value = false;\\n\\t\\t\\t\\t// Compute CPT entry (without normalizaing constant). (CPT Return the probs that the node is true)\\n\\t\\t\\t\\tdouble falseCP = 1 - node.cptLookup();\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// For each child\\n\\t\\t\\t\\tfor (int k = 0; k < node.children.length; k++) {\\n\\t\\t\\t\\t\\t// Multiply this child CPT entry (or 1 minus that if the child is false)\\n\\t\\t\\t\\t\\tif (node.children[k].value) { \\n\\t\\t\\t\\t\\t\\tfalseCP *= node.children[k].cptLookup();\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tfalseCP *= (1 - node.children[k].cptLookup());\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Computing normalization to get the probability of the node being true ...\\n\\t\\t\\t\\tdouble normalizationSum = trueCP + falseCP;\\n\\t\\t\\t\\ttrueCP /= normalizationSum;\\n\\t\\t\\t\\tfalseCP /= normalizationSum;\\n\\t\\t\\t\\t// .. add this to the conditional probs total for that node ...\\n\\t\\t\\t\\ttotalCPs[j] += trueCP;\\n\\t\\t\\t\\t// ... pick a new random variable value for the node according to that probs.\\n\\t\\t\\t\\tnode.value = random.nextDouble() < trueCP;\\n\\t\\t\\t\\t// ... and tally the assignment if it's true!\\n\\t\\t\\t\\tif (node.value) {\\n\\t\\t\\t\\t\\ttrueCounts[j] ++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Report estimates with given frequency!\\n\\t\\t\\tif ((i + 1) % reportFrequency == 0 || i == iterations - 1) {\\n\\t\\t\\t\\tSystem.out.println(\\\"__________________________________\\\");\\n\\t\\t\\t\\tSystem.out.println(\\\"After iteration \\\" + (i + 1) + \\\":\\\");\\n\\t\\t\\t\\tSystem.out.println(\\\"Variable, Average Conditional Probability, Fraction True\\\");\\n\\t\\t\\t\\tfor (int j = 0; j < totalNENs; j++) {\\n\\t\\t\\t\\t\\tBNNode node = nonEvidenceNodes.get(j);\\n\\t\\t\\t\\t\\tSystem.out.println(node.name + \\\", \\\" + totalCPs[j] / (i + 1) + \\\", \\\"\\n\\t\\t\\t\\t\\t\\t\\t+ trueCounts[j] / ((double) i + 1));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a924b5354d4a179e300209a6586aafa\",\n \"score\": \"0.5459062\",\n \"text\": \"public void updateFitness() {\\r\\n\\t\\tnew Level(this.m_grid).init_neighbors();\\r\\n\\t\\tint fitness = 0;\\r\\n\\t\\tfor (int i = 0; i < this.m_grid.length; i++) {\\r\\n\\t\\t\\tfor (int y = 0; y < this.m_grid[0].length; y++) {\\r\\n\\t\\t\\t\\tfitness += this.m_grid[i][y].numberOfConnection();\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tthis.m_fitness = fitness;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2f47dbb124b8685aaac4f0391fb0b9c\",\n \"score\": \"0.5452123\",\n \"text\": \"public void run() {\\n\\t\\tPopulation population = new Population(population_size);\\r\\n\\r\\n\\t\\t// Determine fitness for each child in population\\r\\n\\t\\tfor (int i = 0; i < population_size; i++) {\\r\\n\\t\\t\\tIndividual child = population.getIndividual(i);\\r\\n\\t\\t\\tdouble fitness = (double) evaluation_.evaluate(child.genome);\\r\\n\\r\\n\\t\\t\\tchild.setFitness(fitness);\\r\\n\\t\\t\\tevals++;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// Sort algorithm that sorts the children on fitness from min to max.\\r\\n\\t\\tpopulation.sort(population_size);\\r\\n\\r\\n\\r\\n\\t\\tCluster clusters = new Cluster(num_of_clusters);\\r\\n\\t\\tif (use_k_means){\\r\\n\\t\\t\\tclusters.cluster_convergence(population);\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// Cluster cluster = new Cluster(num_of_clusters);\\r\\n\\r\\n\\r\\n\\t\\t// // Initialize random individuals that function as the initial cluster means\\r\\n\\t\\t// double clusters[][] = create_population(num_of_clusters);\\r\\n\\t\\t// cluster_count_array = new int[num_of_clusters];\\r\\n\\t\\t// for (int i = 0; i < num_of_clusters; i++){\\r\\n\\t\\t// \\tcluster_count_array[i] = 0;\\r\\n\\t\\t// }\\r\\n\\t\\t//\\r\\n\\t\\t// if (use_k_means){\\r\\n\\t\\t//\\r\\n\\t\\t// \\t\\t\\t// Arange population to clusters\\r\\n\\t\\t// \\t\\t\\tint max_cluster_iterations = 10;\\r\\n\\t\\t// \\t\\t\\tint iterations_counter = 0;\\r\\n\\t\\t// \\t\\t\\tint correction_counter;\\r\\n\\t\\t// \\t\\t\\tdo {\\r\\n\\t\\t// \\t\\t\\t\\titerations_counter++;\\r\\n\\t\\t// \\t\\t\\t\\t// Create copy of clusters\\r\\n\\t\\t// \\t\\t\\t\\tdouble[][] clusters_clone = new double[num_of_clusters][10];\\r\\n\\t\\t// \\t\\t\\t\\tfor (int i = 0; i < num_of_clusters; i++){\\r\\n\\t\\t// \\t\\t\\t\\t\\tclusters_clone[i] = Arrays.copyOf(clusters[i],clusters[i].length);\\r\\n\\t\\t// \\t\\t\\t\\t}\\r\\n\\t\\t// \\t\\t\\t\\t// Arange all individuals of population to a certain cluster\\r\\n\\t\\t// \\t\\t\\t\\tsurvival_chances = arange_children_to_clusters(population, survival_chances, clusters);\\r\\n\\t\\t// \\t\\t\\t\\t// Rearange clusters by recalculating the mean\\r\\n\\t\\t// \\t\\t\\t\\tclusters = rearrange_clusters(population, survival_chances, clusters);\\r\\n\\t\\t//\\r\\n\\t\\t//\\r\\n\\t\\t// \\t\\t\\t\\tSystem.out.println(Arrays.toString(clusters[0]));\\r\\n\\t\\t// \\t\\t\\t\\tSystem.out.println(Arrays.toString(clusters_clone[0]));\\r\\n\\t\\t// \\t\\t\\t\\tSystem.out.println(\\\"\\\\n\\\");\\r\\n\\t\\t//\\r\\n\\t\\t// \\t\\t\\t\\tcorrection_counter = 0;\\r\\n\\t\\t// \\t\\t\\t\\tfor (int i = 0; i < num_of_clusters; i++){\\r\\n\\t\\t// \\t\\t\\t\\t\\tif (Arrays.equals(clusters_clone[i],clusters[i])){\\r\\n\\t\\t// \\t\\t\\t\\t\\t\\tcorrection_counter++;\\r\\n\\t\\t// \\t\\t\\t\\t\\t}\\r\\n\\t\\t// \\t\\t\\t\\t}\\r\\n\\t\\t// \\t\\t\\t} while (iterations_counter < max_cluster_iterations || correction_counter != num_of_clusters);\\r\\n\\t\\t// \\t\\t}\\r\\n\\r\\n\\t\\twhile (evals < evaluations_limit_) {\\r\\n\\r\\n\\t\\t\\tIndividual old_best_person = population.getIndividual(population_size - 1);\\r\\n\\r\\n\\t\\t\\t// Select who are going to be parents.\\r\\n\\t\\t\\tPopulation parents = population.tournament_selection(amount_parents, population_size, tournament_size, clusters);\\r\\n\\r\\n\\t\\t\\t// Guarantee that the best individual reproduces\\r\\n\\t\\t\\t// parents[parents.length-1] = sorted_survival_chances[sorted_survival_chances.length-1];\\r\\n\\t\\t\\tSystem.out.println(parents.pop_size);\\r\\n\\t\\t\\tparents.getIndividual(0).getCluster();\\r\\n\\t\\t\\tif (use_k_means) {\\r\\n\\t\\t\\t\\tif (mutate_big) {\\r\\n\\t\\t\\t\\t\\tRandom random = new Random();\\r\\n\\t\\t\\t\\t\\tint r = random.nextInt(num_of_clusters-1)+1;\\r\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"randomised\\\");\\r\\n\\t\\t\\t\\t\\tSystem.out.println(r);\\r\\n\\t\\t\\t\\t\\tint parents_counter = 0;\\r\\n\\t\\t\\t\\t\\tfor (int i = 0; i < population.pop_size; i++) {\\r\\n\\t\\t\\t\\t\\t\\tif(population.getIndividual(i).getCluster() == r){\\r\\n\\t\\t\\t\\t\\t\\t\\tSystem.out.println(parents.pop_size);\\r\\n\\t\\t\\t\\t\\t\\t\\tparents.setIndividual(parents_counter, population.getIndividual(i));\\r\\n\\t\\t\\t\\t\\t\\t\\tparents_counter++;\\r\\n\\t\\t\\t\\t\\t\\t\\tif(parents_counter > parents.pop_size){\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tparents_counter = 0;\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t// Increase cluster counts with a punishment to speed up the neighbourhood exploration proces.\\r\\n\\t\\t\\t\\t\\tclusters.cluster_count_array[r] = clusters.cluster_count_array[r] + 2*parents.pop_size;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\r\\n\\t\\t\\tPopulation new_children = new Population(amount_parents);\\r\\n\\r\\n\\t\\t\\tif (multiple_parents) {\\r\\n\\t\\t\\t\\tnew_children = create_children_from_multiple_parents(parents, amount_parents);\\r\\n\\t\\t\\t} else {\\r\\n\\t\\t\\t\\tnew_children = create_n_children(parents, amount_parents);\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\tif (mutate_big) {\\r\\n\\t\\t\\t\\tdouble chance = get_random_double(0, 1);\\r\\n\\t\\t\\t\\tif (chance < 0.5) {\\r\\n\\t\\t\\t\\t\\tnew_children = inversion_mutation(new_children);\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\tnew_children = insertion_mutation(new_children);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t} else {\\r\\n\\t\\t\\t\\tnew_children = small_mutation(new_children, num_of_mutations);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tpopulation.replace_worst(new_children, multiple_parents, amount_parents);\\r\\n\\t\\t\\t// population = survivor_selection(sorted_survival_chances, population, new_children);\\r\\n\\r\\n\\t\\t\\t// Score new_children\\r\\n\\t\\t\\tfor (int i = 0; i < amount_parents; i ++) {\\r\\n\\t\\t\\t\\tIndividual child = new_children.getIndividual(i);\\r\\n\\t\\t\\t\\tdouble fitness = (double) evaluation_.evaluate(child.genome);\\r\\n\\t\\t\\t\\tchild.setFitness(fitness);\\r\\n\\t\\t\\t\\tevals++;\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t// Sort population\\r\\n\\t\\t\\tpopulation.sort(population_size);\\r\\n\\r\\n\\t\\t\\tIndividual new_best_person = population.getIndividual(population_size - 1);\\r\\n\\r\\n\\t\\t\\t// If there's no new best score for \\\"num_of_unchanged_best\\\", perform bigger mutations on the children\\r\\n\\t\\t\\tif (new_best_person == old_best_person) {\\r\\n\\t\\t\\t\\tnum_of_unchanged_best ++;\\r\\n\\t\\t\\t\\tif (num_of_unchanged_best == max_of_unchanged_best){\\r\\n\\t\\t\\t\\t\\tmutate_big = true;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t} else {\\r\\n\\t\\t\\t\\tnum_of_unchanged_best = 0;\\r\\n\\t\\t\\t\\tmutate_big = false;\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t// Run for python plot code\\r\\n\\t\\t\\tprint_average_score(population, population_size);\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// System.out.println(\\\"SWAG\\\");\\r\\n\\t\\t// int least_used_cluster_index = 0;\\r\\n\\t\\t// System.out.println(cluster_count_array[0]);\\r\\n\\t\\t// for(int i = 1; i < num_of_clusters; i++) {\\r\\n\\t\\t// \\tSystem.out.println(cluster_count_array[i]);\\r\\n\\t\\t// \\tif (cluster_count_array[i] < cluster_count_array[least_used_cluster_index]) {\\r\\n\\t\\t// \\t\\tleast_used_cluster_index = i;\\r\\n\\t\\t// \\t}\\r\\n\\t\\t// }\\r\\n\\t\\t// System.out.println(least_used_cluster_index);\\r\\n\\t\\t// // survival_chances = arange_children_to_clusters(population, survival_chances, clusters);\\r\\n\\t\\t// // for (int i = 0; i < survival_chances.length; i++) {\\r\\n\\t\\t// // \\tSystem.out.println(Arrays.toString(sorted_survival_chances[i]));\\r\\n\\t\\t// // clusters = rearrange_clusters(population, survival_chances, clusters);\\r\\n\\t\\t//\\r\\n\\t\\t// // for (int i = 0; i < clusters.length; i++) {\\r\\n\\t\\t// // \\tSystem.out.print(i);\\r\\n\\t\\t// // \\tSystem.out.println(Arrays.toString(clusters[i]));\\r\\n\\t\\t// for (int c2 = 0; c2 < clusters.length; c2++){\\r\\n\\t\\t// \\tfor (int c = 0; c < population.length; c++){\\r\\n\\t\\t// \\t\\tif ((int) sorted_survival_chances[c][2] == c2){\\r\\n\\t\\t// \\t\\t\\tSystem.out.println(Arrays.toString(sorted_survival_chances[c]));\\r\\n\\t\\t// \\t\\t}\\r\\n\\t\\t// \\t}\\r\\n\\t\\t// }\\r\\n\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cebbade0da435e7c82df5527ca3887fc\",\n \"score\": \"0.5416567\",\n \"text\": \"protected void generateLevel() {\\r\\n\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c049330c93db4a6df4a89de2813b83b\",\n \"score\": \"0.54083824\",\n \"text\": \"@Override\\n public int nodeSize() {\\n return this.nodes_of_graph.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4aec006b45ab69a3a2cdc718f5b9bcec\",\n \"score\": \"0.5408375\",\n \"text\": \"public static void main(String[] args) {\\n\\t\\tNode n1 = new Node(10);\\n\\n\\t\\tNode n2 = new Node(5);\\n\\n\\t\\tNode n3 = new Node(50);\\n\\n\\t\\tNode n4 = new Node(1);\\n\\n\\t\\tNode n5 = new Node(40);\\n\\n\\t\\tNode n6 = new Node(100);\\n\\n\\t\\tn1.setLeft(n2);\\n\\n\\t\\tn1.setRight(n3);\\n\\n\\t\\tn2.setLeft(n4);\\n\\n\\t\\tn3.setRight(n5);\\n\\n\\t\\tn3.setLeft(n6);\\n\\t\\t\\n\\t\\tSystem.out.println(getCount(n1, 5, 45));\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63a464b52b45fe6ad8d4fad890cb8f71\",\n \"score\": \"0.5399008\",\n \"text\": \"public void initialize(){\\r\\n\\t\\tP = new HashSet<>();\\r\\n\\t\\tS = new HashSet<>();\\r\\n\\t\\tL = new HashMap<>();\\r\\n\\t\\tPR = new HashMap<>();\\r\\n\\t\\tperplexity = new ArrayList<>();\\r\\n\\t\\tN = M.size();\\r\\n\\t\\tfor(int node: M.keySet()) {\\r\\n\\t\\t\\tL.put(node, 0);\\r\\n\\t\\t}\\r\\n\\t\\tfor(int node: M.keySet()) {\\r\\n\\t\\t\\tP.add(node);\\r\\n\\t\\t\\tif(M.get(node).isEmpty()) {\\r\\n\\t\\t\\t\\tS.add(node);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tfor(int q: M.get(node)) {\\t//q = countLinkOut\\r\\n\\t\\t\\t\\tL.put(q, L.get(q)+1);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tPR.put(node, 1.0/N);\\r\\n\\t\\t}\\r\\n\\t\\ttest();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c105f9c8dc94bf5720a0df0d4aade324\",\n \"score\": \"0.5394164\",\n \"text\": \"protected void generateLevel() {\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"002b2f5b9782bceea5142db682017583\",\n \"score\": \"0.53825206\",\n \"text\": \"private void goDeeper() {\\n\\t\\tthis.scaling *= config.getVerticalScaleFactor();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41fa1ec4859883cf32133f997fed8840\",\n \"score\": \"0.5380675\",\n \"text\": \"private static InstanceNode[] max_dpa(int numNodes, int degree, int maxValue, int maxDegree, int minDistance, int communicationRadius) {\\r\\n\\t\\tdouble r = Math.sqrt((degree * Math.pow((maxValue*2), 2))/((numNodes-1)*Math.PI)) + 15;\\t\\t\\r\\n\\r\\n\\t\\tInstanceNode[] nodes = new InstanceNode[0];\\r\\n\\r\\n\\t\\t//\\t\\twhile (!connected) {\\r\\n\\t\\tint x = (int) ((Math.random() * (maxValue*2)) - maxValue);\\r\\n\\t\\tint y = (int) ((Math.random() * (maxValue*2)) - maxValue);\\r\\n\\r\\n\\t\\tArrayList<InstanceNode> set = new ArrayList<InstanceNode>();\\r\\n\\r\\n\\t\\tInstanceNode p1 = new InstanceNode();\\r\\n\\t\\tp1.node = 1;\\r\\n\\t\\tp1.x_coord = x;\\r\\n\\t\\tp1.y_coord = y;\\r\\n\\t\\tp1.battery = 0; //Temporarily use to record degree\\r\\n\\t\\tp1.demand = 1;\\r\\n\\r\\n\\t\\tset.add(p1);\\r\\n\\r\\n\\t\\tfor (int k = 2; k<=numNodes+1; k++) {\\r\\n\\t\\t\\tboolean placed = false;\\r\\n\\r\\n\\t\\t\\twhile (!placed) {\\r\\n\\t\\t\\t\\tx = (int) ((Math.random() * (maxValue*2)) - maxValue);\\r\\n\\t\\t\\t\\ty = (int) ((Math.random() * (maxValue*2)) - maxValue);\\r\\n\\r\\n\\t\\t\\t\\tInstanceNode newNode = new InstanceNode();\\r\\n\\t\\t\\t\\tnewNode.node = k;\\r\\n\\t\\t\\t\\tnewNode.x_coord = x;\\r\\n\\t\\t\\t\\tnewNode.y_coord = y;\\r\\n\\t\\t\\t\\tnewNode.demand = 1;\\r\\n\\t\\t\\t\\tnewNode.battery = 0;\\r\\n\\r\\n\\t\\t\\t\\tArrayList<Integer> degreeUp = new ArrayList<Integer>();\\r\\n\\r\\n\\t\\t\\t\\tboolean proximityTest = false;\\r\\n\\t\\t\\t\\tboolean degreeTest = true;\\r\\n\\t\\t\\t\\tfor (int i = 0; i< set.size(); i++) {\\r\\n\\t\\t\\t\\t\\tif (newNode.getDistance(set.get(i)) <= r && newNode.getDistance(set.get(i)) > minDistance) {\\r\\n\\t\\t\\t\\t\\t\\tproximityTest = true;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tif (newNode.getDistance(set.get(i)) <= communicationRadius && set.get(i).battery < maxDegree) {\\r\\n\\t\\t\\t\\t\\t\\tif (set.get(i).battery < maxDegree) {\\r\\n\\t\\t\\t\\t\\t\\t\\tdegreeUp.add(i);\\r\\n\\t\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\t\\tdegreeTest = false;\\r\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\tplaced = proximityTest && degreeTest;\\r\\n\\r\\n\\t\\t\\t\\tif (placed) {\\r\\n\\t\\t\\t\\t\\tfor(int i = 0; i < degreeUp.size(); i++) {\\r\\n\\t\\t\\t\\t\\t\\tset.get(degreeUp.get(i)).battery++;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\tnewNode.battery = degreeUp.size();\\r\\n\\t\\t\\t\\t\\tset.add(newNode);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tnodes = set.toArray(new InstanceNode[0]);\\r\\n\\t\\t//\\t\\t\\tconnected = true;\\r\\n\\t\\t//\\t\\t\\t//Other stuff in the original algorithm goes here. Seeing how this performs without the check at the end\\r\\n\\t\\t//\\t\\t}\\r\\n\\r\\n\\t\\tfor (int i = 0; i < nodes.length; i++) {\\r\\n\\t\\t\\tnodes[i].battery = (int) Math.floor(((Math.random()*100 + 1)));\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\treturn nodes;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"776168172b00f0439224cdafa398d4aa\",\n \"score\": \"0.5369961\",\n \"text\": \"public final int getNodeFactor() {\\n\\t\\treturn nodeFactor;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"541ab7d1f9a945be303e9c0ac5d4c2c7\",\n \"score\": \"0.5368098\",\n \"text\": \"private void updateDepth() {\\n this.depth = (int) (Math.log(size) / Math.log(2));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d9f646b78c0609a7e518bdd4b132f79\",\n \"score\": \"0.5366353\",\n \"text\": \"private void buildMap() {\\n\\t\\tRandom rand = new Random();\\r\\n\\t\\tmap = new Node[this.height][this.width]; // an Array of Array of Nodes\\r\\n\\t\\tint maxPercentage = 100;\\r\\n\\t\\t\\r\\n\\t\\tfor (int i = 0; i < height; i++) {\\r\\n\\t\\t\\tfor (int j = 0; j < width; j++) {\\r\\n\\t\\t\\t\\tint num = rand.nextInt(maxPercentage);\\r\\n\\t\\t\\t\\tif (num <= getPercent()) {\\r\\n\\t\\t\\t\\t\\tmap[i][j] = new Node(false, j, i);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\tmap[i][j] = new Node(true, j, i);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tboatTreasureGenerator();\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bf442228272ab3d9f2169e0c746adfb4\",\n \"score\": \"0.53625214\",\n \"text\": \"protected void updateInternalNodesWeightsPreOrder() {\\n if (internalNodes.size() == 0) {\\n return;\\n }\\n try {\\n for (MultiSwitchWildcardPattern mswp : internalNodes.values()) {\\n //find children\\n WildcardPattern left = mswp.getWildcardPattern().clone().goDown(false);\\n WildcardPattern right = mswp.getWildcardPattern().clone().goDown(true);\\n MultiSwitchWildcardPattern leftMswp = monitors.get(left);\\n if (leftMswp == null) {\\n leftMswp = internalNodes.get(left);\\n }\\n MultiSwitchWildcardPattern rightMswp = monitors.get(right);\\n if (rightMswp == null) {\\n rightMswp = internalNodes.get(right);\\n }\\n\\n //add their weight\\n mswp.setWeight(leftMswp.getWeight() + rightMswp.getWeight());\\n }\\n } catch (WildcardPattern.InvalidWildCardValue invalidWildCardValue) {\\n //as it is only internal nodes this exception should not happen\\n invalidWildCardValue.printStackTrace();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f04ea7102067bc1f13ac1b5848e23ca\",\n \"score\": \"0.53603345\",\n \"text\": \"private void initialise() {\\n List<DAGNode> nodes = new ArrayList<>();\\n nodes.add(root);\\n hashedNodes.put(root.toString(), root);\\n\\n int index = 0;\\n int counter = 0;\\n long totalCombinations = kAnonymity.getDataset().getTaxonomyTreeCombinations();\\n\\n // While there are nodes we have no checked. The size increases as we find more\\n while (index < nodes.size()) {\\n counter++;\\n if (counter % 10 == 0) {\\n System.out.print(\\\"\\\\rGenerating all combinations: \\\" + (100 * counter / totalCombinations) + \\\"%\\\" );\\n }\\n DAGNode current = nodes.get(index);\\n\\n // For each of the attributes in the generalisation\\n List<FullDomainLevel> generalisations = current.getGeneralisations();\\n for (int i = 0; i < generalisations.size(); i++) {\\n FullDomainLevel generalisation = generalisations.get(i);\\n Tree tree = generalisation.getTree();\\n int level = generalisation.getLevel();\\n\\n // If the level can be generalised further, do it and add it to the DAG\\n if (level > 0) {\\n List<FullDomainLevel> nextGens = new ArrayList<>(generalisations);\\n FullDomainLevel nextGen = new FullDomainLevel(tree, level - 1);\\n nextGens.set(i, nextGen);\\n DAGNode next = findNode(nodes, new DAGNode(nextGens));\\n current.addChild(next);\\n }\\n }\\n\\n index++;\\n }\\n\\n System.out.println(\\\"\\\\rFinished Generating the directed acyclic graph (DAG) node connections! In total generated \\\" + counter + \\\"/\\\" + totalCombinations + \\\" necessary combinations.\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f38be3dd0c0b0523d35aa62e4a4a633\",\n \"score\": \"0.53450567\",\n \"text\": \"public void updateLevel() {\\n for(Entity each : entities) {\\n for(Obstacle block : obstacles) {\\n if(!block.hasCollided((Node) each)) {\\n each.setCenterX(each.getCenterX()+5);\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"99ccb47eef71f6a72d1717b27f64a0ce\",\n \"score\": \"0.5327293\",\n \"text\": \"private void calculateBottomLevels() {\\n Queue<Node> queue = new ArrayDeque<>();\\n\\n // Add all the exit nodes\\n for (Node n : nodes.values()) {\\n if (!children.containsKey(n) || children.get(n).isEmpty()) {\\n queue.add(n);\\n bottomLevels.put(n, n.getCost());\\n }\\n }\\n\\n while (!queue.isEmpty()) {\\n Node node = queue.poll();\\n int cost = bottomLevels.get(node);\\n\\n for (Node n : parents.get(node)) {\\n int newCost = n.getCost() + cost;\\n int currentCost = 0;\\n if (bottomLevels.containsKey(n))\\n currentCost = bottomLevels.get(n);\\n\\n if (newCost > currentCost) {\\n bottomLevels.put(n, newCost);\\n queue.add(n);\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff32118d6992da5c5e268f52225c3819\",\n \"score\": \"0.5327011\",\n \"text\": \"public void chebyshevNodes() {\\n for (int i = 0; i < nodes[0].length; i++)\\n nodes[0][i] = Math.cos( (double) (2*i + 1) / (2*(nodes[0].length)) * Math.PI);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac840b40159554e1de318fa78a1af49c\",\n \"score\": \"0.5325946\",\n \"text\": \"public void setTasksPerLevel(LinkedList<int[]> tasksPerLevel){\\n this.tasksPerLevel = tasksPerLevel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"abebec889c74d676dba289d1b0826797\",\n \"score\": \"0.5325315\",\n \"text\": \"void createEdges() {\\n \\t\\n \\tfor(int i=0; i<map.keySet().size()*1.3; i++) {\\n \\t\\tgraph.addEdge(new Double(Math.random()), randomNodo(), randomNodo(), EdgeType.DIRECTED);\\n \\t}\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fff6be743848dd52a6cc01d808fe7130\",\n \"score\": \"0.53101325\",\n \"text\": \"public void updateAllNodeAttribute() {\\r\\n\\t\\tArrayList<Node> arr = new ArrayList<Node>();\\r\\n\\t\\tarr = collectAllNodes(root, arr);\\r\\n\\t\\tfor (int i = 0; i < arr.size(); i++) {\\r\\n\\t\\t\\tarr.get(i).nodeSize = getSize(arr.get(i));\\r\\n\\t\\t\\tarr.get(i).nodeHeight = getHeight(arr.get(i));\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"928d65a0706f9c2d735b0b05e89b9619\",\n \"score\": \"0.53082824\",\n \"text\": \"private void kruskal() {\\n\\t\\tDisjointSet.makeset(nodelist);\\n\\t\\tComparator<UndirectedEdge> comparator;\\n\\t\\tcomparator = new Comparator<UndirectedEdge>() {\\n\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic int compare(UndirectedEdge o1, UndirectedEdge o2) {\\n\\t\\t\\t\\t// TODO Auto-generated method stub\\n\\t\\t\\t\\treturn o1.getWeight() - o2.getWeight();\\n\\t\\t\\t}\\n\\t\\t};\\n\\n\\t\\tCollections.sort(edgelist, comparator);\\n\\t\\tint cost = 0;\\n\\t\\tfor (UndirectedEdge edge : edgelist) {\\n\\t\\t\\tWeightedNode first = edge.getFirst();\\n\\t\\t\\tWeightedNode sec = edge.getSecond();\\n\\t\\t\\tif (!DisjointSet.findSet(first).equals(DisjointSet.findSet(sec))) {\\n\\t\\t\\t\\tDisjointSet.union(first, sec);\\n\\t\\t\\t\\tcost += edge.getWeight();\\n\\t\\t\\t\\tSystem.out.println(\\\"Taken \\\" + edge);\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tSystem.out.println(\\\"total cost is : \\\" + cost);\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0df449817476b3c37fcc41aad50c5d12\",\n \"score\": \"0.53041536\",\n \"text\": \"public Individual(int nodeAmount, int inputAmount, int outputAmount, int functionSet, int levelsBack) {\\r\\n\\t\\tthis.inputAmount = inputAmount;\\r\\n\\t\\tthis.functionSet = functionSet;\\r\\n\\t\\tthis.levelsBack = levelsBack;\\r\\n\\r\\n\\t\\tnodes = new ArrayList<>();\\r\\n\\t\\tfor (int i = 0; i < nodeAmount; i++) {\\r\\n\\t\\t\\tint function;\\r\\n\\t\\t\\tint input1;\\r\\n\\t\\t\\tint input2;\\r\\n\\t\\t\\tfunction = ThreadLocalRandom.current().nextInt(1, Functions.getNrFunctions(functionSet) + 1);\\r\\n\\r\\n\\t\\t\\tif (levelsBack <= 0) {\\r\\n\\t\\t\\t\\t// i = current position of Node\\r\\n\\t\\t\\t\\t// inputAmout + i = adress of current Node\\r\\n\\t\\t\\t\\t// upper Bound of ThreadLocalRandom.current().nextInt is\\r\\n\\t\\t\\t\\t// exclusive!\\r\\n\\t\\t\\t\\tinput1 = ThreadLocalRandom.current().nextInt(0, inputAmount + i);\\r\\n\\t\\t\\t\\tinput2 = ThreadLocalRandom.current().nextInt(0, inputAmount + i);\\r\\n\\t\\t\\t} else {\\r\\n\\t\\t\\t\\tint currentlevelsBackMax = levelsBack;\\r\\n\\t\\t\\t\\tif (currentlevelsBackMax >= i)\\r\\n\\t\\t\\t\\t\\tcurrentlevelsBackMax = i;\\r\\n\\r\\n\\t\\t\\t\\tinput1 = ThreadLocalRandom.current().nextInt(0, inputAmount + currentlevelsBackMax);\\r\\n\\t\\t\\t\\tif (input1 >= inputAmount) {\\r\\n\\t\\t\\t\\t\\t// input now only contains the chosen levelsBack-value\\r\\n\\t\\t\\t\\t\\tinput1 -= inputAmount;\\r\\n\\t\\t\\t\\t\\t// get the node-adress of the referenced node, relative to\\r\\n\\t\\t\\t\\t\\t// the current one\\r\\n\\t\\t\\t\\t\\t// position of the current node = inputAmount + i\\r\\n\\t\\t\\t\\t\\tinput1 = inputAmount + i - input1 - 1;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tinput2 = ThreadLocalRandom.current().nextInt(0, inputAmount + currentlevelsBackMax);\\r\\n\\t\\t\\t\\tif (input2 >= inputAmount) {\\r\\n\\t\\t\\t\\t\\tinput2 -= inputAmount;\\r\\n\\t\\t\\t\\t\\tinput2 = inputAmount + i - input2 - 1;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tnodes.add(new Node(function, input1, input2));\\r\\n\\t\\t}\\r\\n\\t\\toutput = new int[outputAmount];\\r\\n\\t\\tfor (int i = 0; i < outputAmount; i++) {\\r\\n\\t\\t\\tif (levelsBack <= 0) {\\r\\n\\t\\t\\t\\toutput[i] = ThreadLocalRandom.current().nextInt(0, inputAmount + nodeAmount);\\r\\n\\t\\t\\t} else {\\r\\n\\t\\t\\t\\tint currentlevelsBackMax = levelsBack;\\r\\n\\t\\t\\t\\tif (currentlevelsBackMax >= nodes.size())\\r\\n\\t\\t\\t\\t\\tcurrentlevelsBackMax = nodes.size();\\r\\n\\r\\n\\t\\t\\t\\tint inputOfOutput = ThreadLocalRandom.current().nextInt(0, inputAmount + currentlevelsBackMax);\\r\\n\\t\\t\\t\\tif (inputOfOutput >= inputAmount) {\\r\\n\\t\\t\\t\\t\\t// node doesnt use an input as input\\r\\n\\t\\t\\t\\t\\t// but another node\\r\\n\\t\\t\\t\\t\\tinputOfOutput -= inputAmount;\\r\\n\\t\\t\\t\\t\\t// get the number of levelsback\\r\\n\\t\\t\\t\\t\\tinputOfOutput = inputAmount + nodeAmount - inputOfOutput - 1;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\toutput[i] = inputOfOutput;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\thasFitness = false;\\r\\n\\t\\tusedNodesHasBeenCalculated = false;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03b2bbc3dfa773d2b1085c24fef95f8a\",\n \"score\": \"0.5303984\",\n \"text\": \"public static void full(DefaultMutableTreeNode node, int depth, Random rand, int maxNodes) {\\r\\n\\r\\n\\t\\tif (((Expression) node.getUserObject()).status == Status.TERMINAL)\\r\\n\\t\\t\\treturn;\\r\\n\\r\\n\\t\\tIFunction fun = (IFunction) node.getUserObject();\\r\\n\\r\\n\\t\\tif (node.isRoot()) {\\r\\n\\t\\t\\temptySpaces = fun.getNumberOfOutputs();\\r\\n\\t\\t\\tcurrentNodes = 1;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// ako je dubina 0 moraju se generirati terminali\\r\\n\\t\\tif (depth == 0 || currentNodes + emptySpaces == maxNodes) {\\r\\n\\r\\n\\t\\t\\tfor (int i = 0; i < fun.getNumberOfOutputs(); i++) {\\r\\n\\r\\n\\t\\t\\t\\tExpression e = terminals.get(rand.nextInt(terminals.size())).duplicate();\\r\\n\\t\\t\\t\\tfun.addOutput(e);\\r\\n\\t\\t\\t\\tnode.add(new DefaultMutableTreeNode(e));\\r\\n\\t\\t\\t\\tcurrentNodes += 1;\\r\\n\\t\\t\\t\\temptySpaces -= 1;\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\treturn;\\r\\n\\r\\n\\t\\t} else {\\r\\n\\t\\t\\t// dubina nije 0, generiraju se funkcije\\r\\n\\t\\t\\tfor (int i = 0; i < fun.getNumberOfOutputs(); i++) {\\r\\n\\r\\n\\t\\t\\t\\tExpression e = functions.get(rand.nextInt(functions.size())).duplicate();\\r\\n\\r\\n\\t\\t\\t\\t// potrebno staviti terminale\\r\\n\\t\\t\\t\\tif (maxNodes < currentNodes + emptySpaces + ((IFunction) e).getNumberOfOutputs()) {\\r\\n\\r\\n\\t\\t\\t\\t\\te = terminals.get(rand.nextInt(terminals.size())).duplicate();\\r\\n\\t\\t\\t\\t\\tfun.addOutput(e);\\r\\n\\t\\t\\t\\t\\tnode.add(new DefaultMutableTreeNode(e));\\r\\n\\t\\t\\t\\t\\temptySpaces -= 1;\\r\\n\\t\\t\\t\\t\\tcurrentNodes += 1;\\r\\n\\r\\n\\t\\t\\t\\t} else {\\r\\n\\r\\n\\t\\t\\t\\t\\tfun.addOutput(e);\\r\\n\\t\\t\\t\\t\\tnode.add(new DefaultMutableTreeNode(e));\\r\\n\\t\\t\\t\\t\\temptySpaces += ((IFunction) e).getNumberOfOutputs();\\r\\n\\t\\t\\t\\t\\temptySpaces -= 1;\\r\\n\\t\\t\\t\\t\\tcurrentNodes += 1;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// dohvat novo dodanih cvorova\\r\\n\\t\\tEnumeration<DefaultMutableTreeNode> en = node.children();\\r\\n\\r\\n\\t\\t// za svaki dohvaceni cvor se rekurzivno generiraju novi cvorovi ovisno\\r\\n\\t\\t// o broju funkcija koje neki cvor moze imati i dubini na kojoj se cvor nalazi\\r\\n\\t\\twhile (en.hasMoreElements()) {\\r\\n\\r\\n\\t\\t\\tDefaultMutableTreeNode child = en.nextElement();\\r\\n\\r\\n\\t\\t\\tfull(child, depth - 1, rand, maxNodes);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2ef725e645cab836d7dce0bf3b1df06\",\n \"score\": \"0.5295591\",\n \"text\": \"private void initNodes(){\\n nodes = new Integer[getNumberOfNodes()];\\n\\n for(int i = 0; i <= nodes.length - 1; i++){\\n nodes[i] = i;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f643a06d3ed6dedc3dc111d014b0dff4\",\n \"score\": \"0.52894795\",\n \"text\": \"private void makeTree(Instances data, Default default_data, ArrayList<Attribute> used) throws Exception {\\n // Initialize variables\\n dataset = data;\\n usedAttributes = new ArrayList<>();\\n if (used != null){\\n usedAttributes = used;\\n for (int i = 0; i < usedAttributes.size(); i++) {\\n dataset.deleteAttributeAt(usedAttributes.get(i).index());\\n }\\n }\\n numericValues = new double[dataset.numAttributes()];\\n //System.out.println(data);\\n \\n // Check if no instances have reached this node. Missing Value\\n if (dataset.numInstances() == 0) {\\n main_Attribute = null;\\n m_ClassValue = default_data.classValue();\\n m_ClassAttribute = default_data.classAttribute();\\n class_Distribution = new double[dataset.numClasses()];\\n return;\\n }\\n \\n //Make leaf if all attributes has been used, use most common class\\n if (usedAttributes.size() == dataset.numAttributes()) {\\n class_Distribution = new double[dataset.numClasses()];\\n Enumeration classEnum = dataset.enumerateAttributes();\\n while (classEnum.hasMoreElements()) {\\n Instance inst = (Instance) classEnum.nextElement(); \\n class_Distribution[(int) inst.classIndex()]++;\\n } \\n double chosenClass = Utils.maxIndex(class_Distribution);\\n main_Attribute = null;\\n m_ClassValue = chosenClass;\\n m_ClassAttribute = dataset.classAttribute();\\n return; \\n }\\n \\n // Compute attribute with maximum information gain.\\n // If attribute is continuous valued, define discrete values for attribute\\n double[] infoGains = new double[dataset.numAttributes()];\\n double[] gainRatios = new double[dataset.numAttributes()];\\n Enumeration attEnum = dataset.enumerateAttributes();\\n while (attEnum.hasMoreElements()) {\\n Attribute att = (Attribute) attEnum.nextElement();\\n if (att.isNumeric()) {\\n infoGains[att.index()] = calculateNumeric(dataset, att);\\n gainRatios[att.index()] = infoGains[att.index()] / \\n computeSplitInfoNumeric(dataset, att, numericValues[att.index()]);\\n } else {\\n infoGains[att.index()] = computeInfoGain(dataset, att);\\n gainRatios[att.index()] = infoGains[att.index()] / computeSplitInfo(dataset,att);\\n }\\n }\\n main_Attribute = data.attribute(Utils.maxIndex(gainRatios));\\n usedAttributes.add(main_Attribute);\\n //for (int i = 0; i < numericValues.length; i++)\\n //System.out.println(gainRatios[i]);\\n \\n // Make leaf if information gain is zero. \\n // Otherwise create successors.\\n if (Utils.eq(infoGains[main_Attribute.index()], 0)) {\\n main_Attribute = null;\\n class_Distribution = getClassDistribution(this);\\n m_ClassValue = Utils.maxIndex(class_Distribution);\\n m_ClassAttribute = dataset.classAttribute();\\n } else { \\n if (!main_Attribute.isNumeric()) {\\n child_Nodes = new myC45[main_Attribute.numValues()];\\n splitController.splitData(data, main_Attribute);\\n splitController.handleMissingValues(data, main_Attribute);\\n } else {\\n child_Nodes = new myC45[2];\\n splitController.splitDataNumeric(data, main_Attribute, numericValues[main_Attribute.index()]);\\n splitController.handleMissingValuesNumeric(data, main_Attribute, numericValues[main_Attribute.index()]);\\n }\\n \\n Instances[] splitData = splitController.getSplit();\\n //System.out.println(splitData);\\n for (int j = 0; j < child_Nodes.length; j++) {\\n child_Nodes[j] = new myC45();\\n child_Nodes[j].makeTree(splitData[j], default_data, used);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d40e7a267b536eae93dc59696b6183a\",\n \"score\": \"0.5286031\",\n \"text\": \"public double tuneTreesCoeffs()\\n{ \\n assert(Context.XData.length == Context.Target.length);\\n// if(this.evaluated) return this.fitness;\\n \\n Iterator<Node> nodItr=this.iterator();\\n int ii=0;\\n while(nodItr.hasNext()){\\n Node tmpNode=nodItr.next();\\n if(tmpNode.getPrimitive().getArity()==0\\n && !tmpNode.getPrimitive().getName().startsWith(\\\"X\\\"))\\n ii++;//find the number of constants\\n }\\n if(ii<=1)\\n return this.evaluateTree();//i.e. no coefficients to be tuned by GA so evaluate the ind only\\n int[] constIndex=new int[ii];//keeps the indices of constants in this tree\\n double[] constants=new double[ii];//this array would keep the constants for the interim (a temp array for best combo)\\n int jj=0;\\n \\n for(ii=0;ii<this.size();ii++){\\n if(this.get(ii).getPrimitive().getArity()==0\\n && !this.get(ii).getPrimitive().getName().startsWith(\\\"X\\\")){\\n constIndex[jj]=ii;//this loop copies the indices to the array\\n constants[jj]=Double.valueOf(this.get(ii).getPrimitive().getName());\\n jj++;\\n } \\n } \\n //Initialize the GA here\\n Nursery nurse=new Nursery();\\n ArrayList<Genotype> pop=nurse.initializePopulation(100, constIndex.length, -6, +6);//should initialize a population\\n for(int i=0;i<50;i++){//numGens is chosen to be 150\\n ArrayList<Genotype> childPop=nurse.applySelectionTournament(pop,4);\\n nurse.applySinglePointCrossover(childPop,constIndex.length,0.8);\\n nurse.applyMutationUniform(childPop,constIndex.length,0.2);\\n pop.addAll(childPop);//append the two pops here\\n for(int j=0;j<pop.size();j++){\\n if(pop.get(j).getEvaluatedFlag()==false){//if it has not been evaluated\\n double[] tmpGenes=pop.get(j).getGenotype();\\n for(int k=0;k<constIndex.length;k++)\\n this.get(constIndex[k]).getPrimitive().setName(Double.toString(tmpGenes[k]));//insert the genes into tree\\n double[] evolved=this.interpretTree(Context.XData); \\n if(evolved.length!=Context.Target.length){\\n double tmpEvolved=evolved[0];//if everything that is returned is a constant\\n evolved=new double[Context.Target.length];\\n for(int z=0;z<Context.Target.length;z++)\\n evolved[z]=tmpEvolved;\\n } \\n double[] slope_n_intercept=new double[2];\\n linearScaling(slope_n_intercept, evolved, Context.Target);\\n\\n // this.trainingResult=new double[evolved.length];\\n double tmpFitness=0;\\n double res;\\n for(int ij=0; ij<Context.Target.length;ij++){\\n res=Context.Target[ij]-(slope_n_intercept[0]*evolved[ij]+slope_n_intercept[1]);\\n tmpFitness+=res*res;\\n }\\n tmpFitness=tmpFitness/evolved.length;\\n if(Double.isNaN(tmpFitness) || Double.isInfinite(tmpFitness))\\n tmpFitness=Double.MAX_VALUE;\\n if(tmpFitness<this.fitness){\\n this.fitness=tmpFitness;\\n\\n this.slope=slope_n_intercept[0];\\n this.intercept=slope_n_intercept[1];\\n for(int k=0;k<tmpGenes.length;k++)\\n constants[k]=tmpGenes[k];\\n }\\n pop.get(j).setFitness(tmpFitness);\\n if(Double.isNaN(tmpFitness) || Double.isInfinite(tmpFitness))\\n {\\n this.fitness=Double.MAX_VALUE;//assign a very large fitness\\n pop.get(j).setFitness(Double.MAX_VALUE);\\n }\\n pop.get(j).setEvaluated(true);\\n }// if getEvaluated\\n }\\n nurse.applySurvival(pop);\\n }\\n for(int i=0;i<constants.length;i++)\\n this.get(constIndex[i]).getPrimitive().setName(Double.toString(constants[i]));//set the coeffs in the tree\\n \\n// System.out.println(\\\"Current best \\\"+this.fitness);\\n this.valid = true;\\n this.evaluated=true;\\n return this.fitness;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"862f030349694b9af24b90feb6cfa3f1\",\n \"score\": \"0.5280878\",\n \"text\": \"public static void cost(Map<Node, List<Node>> playerGraph, Node player,\\n List<Map<Node, List<Node>>> enemyGraphs, List<Node> enemies, int depth, List<Node> evaluated) {\\n\\n Node temp = null;\\n Map<Node, List<Node>> tempGraph = null;\\n\\n if (depth == 0 || evaluated.contains(player) || enemies.contains(player)) return;\\n\\n temp = nodes.get(player.x + player.y * WIDTH);\\n\\n int nodesCloserToPlayer = 0;\\n int divider = 1;\\n\\n tempGraph = newGraph(player, enemies);\\n voronoiDiagramLayer(tempGraph , player, enemyGraphs, enemies, evaluated);\\n\\n nodesCloserToPlayer = 0;\\n for (Node node: neighbors.keySet()) if (node.symbol == '+') nodesCloserToPlayer++;\\n\\n for(Node e: enemies) if (tempGraph.keySet().contains(e)) divider++;\\n\\n\\n if (divider > 1) player.cost = nodesCloserToPlayer + (tempGraph.size() - divider);\\n else player.cost = (tempGraph.size() - divider) * 2;\\n\\n // second\\n //player.cost = nodesCloserToPlayer + (tempGraph.size() - divider);\\n\\n //third\\n //player.cost = nodesCloserToPlayer + (tempGraph.size() - divider * 5);\\n\\n //4tg\\n //player.cost = nodesCloserToPlayer + ((tempGraph.size() + divider) / divider) + divider * 5;\\n\\n // most current\\n\\n//\\n// player.cost = tempGraph.size() + (nodesCloserToPlayer) / ( divider * divider);\\n temp.cost = player.cost;\\n\\n evaluated.add(player);\\n\\n List<Node> children = playerGraph.get(player);\\n\\n for(Node child : children) {\\n\\n if (child.value != -1) continue;\\n\\n temp = nodes.get(child.x + child.y * WIDTH);\\n temp.value = player.value;\\n child.value = temp.value;\\n\\n cost(playerGraph, child, enemyGraphs, enemies, depth - 1, evaluated);\\n\\n temp.value = -1;\\n child.value = temp.value;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"05387ca1ddc7b5d616c7347903bdf712\",\n \"score\": \"0.52777296\",\n \"text\": \"public int numberNodes(){\\n\\treturn numberNodes(root);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"177939c7055f2bcaa78a21c3ca65365f\",\n \"score\": \"0.5270561\",\n \"text\": \"private void initialization() {\\n\\t\\tdominatingSet = new ArrayList<Integer>();\\n\\n\\t\\tdominatedMap = new HashMap<Integer, Boolean>(this.numOfVertices);\\n\\t\\tvoteMap = new HashMap<Integer, Float>(this.numOfVertices);\\n\\t\\tweightMap = new HashMap<Integer, Float>(this.numOfVertices);\\n\\t\\tCollection<Integer> vertices = g.getVertices();\\n\\t\\t// calculate vote for each vertex and initialize weight map\\n\\t\\tfor (Integer v : vertices) {\\n\\t\\t\\tdominatedMap.put(v, false);\\n\\t\\t\\tint degree = g.degree(v);\\n\\t\\t\\tfloat vote = 1.0f / (1 + degree);\\n\\t\\t\\tvoteMap.put(v, vote);\\n\\t\\t\\tweightMap.put(v, vote);\\n\\t\\t}\\n\\t\\t// calculate weight for each vertex\\n\\t\\tfor (Integer v : vertices) {\\n\\t\\t\\tCollection<Integer> vNeig = g.getNeighbors(v);\\n\\t\\t\\tfloat weightv = weightMap.get(v);\\n\\t\\t\\tfor (Integer u : vNeig) {\\n\\t\\t\\t\\tfloat voteu = voteMap.get(u);\\n\\t\\t\\t\\tweightv += voteu;\\n\\t\\t\\t}\\n\\t\\t\\tweightMap.put(v, weightv);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a321a8e468af21c6035bf178d86de26\",\n \"score\": \"0.5269661\",\n \"text\": \"@Test\\n public void testEvenDistribution() {\\n Map<Integer, TDataNodeConfiguration> availableDataNodeMap = new ConcurrentHashMap<>();\\n Map<Integer, Double> freeSpaceMap = new ConcurrentHashMap<>();\\n Random random = new Random();\\n // Set 6 DataNodes\\n for (int i = 0; i < 6; i++) {\\n availableDataNodeMap.put(\\n i, new TDataNodeConfiguration().setLocation(new TDataNodeLocation().setDataNodeId(i)));\\n freeSpaceMap.put(i, random.nextDouble());\\n }\\n\\n /* Allocate 6 RegionGroups */\\n List<TRegionReplicaSet> allocatedRegionGroups = new ArrayList<>();\\n for (int index = 0; index < 6; index++) {\\n TRegionReplicaSet newRegionGroup =\\n ALLOCATOR.generateOptimalRegionReplicasDistribution(\\n availableDataNodeMap,\\n freeSpaceMap,\\n allocatedRegionGroups,\\n TEST_REPLICATION_FACTOR,\\n new TConsensusGroupId(TConsensusGroupType.DataRegion, index));\\n allocatedRegionGroups.add(newRegionGroup);\\n }\\n\\n /* Check result */\\n Map<Integer, AtomicInteger> regionCounter = new ConcurrentHashMap<>();\\n allocatedRegionGroups.forEach(\\n regionReplicaSet ->\\n regionReplicaSet\\n .getDataNodeLocations()\\n .forEach(\\n dataNodeLocation ->\\n regionCounter\\n .computeIfAbsent(\\n dataNodeLocation.getDataNodeId(), empty -> new AtomicInteger(0))\\n .getAndIncrement()));\\n // Each DataNode should have exactly 3 Regions since the all 18 Regions are distributed to 6\\n // DataNodes evenly\\n Assert.assertEquals(6, regionCounter.size());\\n regionCounter.forEach((dataNodeId, regionCount) -> Assert.assertEquals(3, regionCount.get()));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d125894ceaaf1ffdc6a197bc9109a92a\",\n \"score\": \"0.5267755\",\n \"text\": \"private void updateG() {\\n\\t\\tthis.g = this.parent.g + arcCost(this.parent);\\n\\t\\tif (this.children == null)\\n\\t\\t\\treturn;\\n\\t\\t\\n\\t\\tfor (PuzzleNode pn : children)\\n\\t\\t\\tpn.updateG(); //horay for recursive propagation.\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c4c0a54174998c66bf7f85b7a324f89\",\n \"score\": \"0.52668417\",\n \"text\": \"public void setWeight(Node node, HashMap<Coordinate, MapTile> map) {\\n\\t\\tMapTile tile = map.get(node.coord);\\n\\t\\tif (tile instanceof LavaTrap) {\\n\\t\\t\\tnode.setWeight( Double.POSITIVE_INFINITY + node.parent.weight);\\n\\t\\t}else {\\n\\t\\t\\tITileWeight weights = TileWeightFactory.getInstance().getWeight(tile);\\n\\t\\t\\tnode.setWeight(weights.getWeight(node, map) + node.parent.weight);\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1e5071827e12eaffc56a94fcbb3a5ad\",\n \"score\": \"0.52659726\",\n \"text\": \"void layout() {\\n findLevels();\\n\\n rationalise();\\n\\n for (Level l : levels) {\\n l.calcInitialPositions();\\n }\\n\\n orderNodesInLevels();\\n\\n calcLevelLocations();\\n\\n int minStart = Integer.MAX_VALUE;\\n\\n for (Level l : levels) {\\n minStart = Math.min(minStart, l.getStart());\\n }\\n\\n for (Level l : levels) {\\n l.shiftLeft(minStart);\\n }\\n\\n for (Level l : levels) {\\n withinLevelSize = Math.max(withinLevelSize, l.getWidth());\\n }\\n\\n storeLayoutNodes();\\n\\n storeLayoutEdges();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fbf53bce26fc1cc63888e8af36a10951\",\n \"score\": \"0.52657056\",\n \"text\": \"public void generate() {\\n\\t\\tList<S> survivors = getSurvivors();\\n\\t\\t\\n\\t\\tPriorityQueue<S> newGeneration = \\n\\t\\t\\t\\tnew PriorityQueue<S>(generationSize, comparator);\\n\\t\\t// artificially add the best so far so we don't lose progress\\n\\t\\tif (best != null) newGeneration.add(best);\\n\\t\\t\\n\\t\\tdouble[] normedScores = new double[survivors.size()];\\n\\t\\t\\n\\t\\tdouble min = Double.POSITIVE_INFINITY;\\n\\t\\tfor(int i=0; i<survivors.size(); i++) {\\n\\t\\t\\tnormedScores[i] = survivors.get(i).score();\\n\\t\\t\\tif(normedScores[i] < min) \\n\\t\\t\\t\\tmin = normedScores[i];\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(min < 0) {\\n\\t\\t\\tfor(int i=0; i<normedScores.length; i++) {\\n\\t\\t\\t\\tnormedScores[i] += -min + 1; //shift values so they're all >0\\n\\t\\t\\t\\t//so normalizing doesn't invert negative values\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tdouble sum = 0;\\n\\t\\tfor(int i=0; i<normedScores.length; i++) sum += normedScores[i];\\n\\t\\t//want to choose the best with a higher likelihood than the worst\\n\\t\\t//of the survivors\\n\\t\\t\\n\\t\\t//Each member is chosen as a parent with likelihood proportional\\n\\t\\t//to its contribution to the gene pool\\n\\t\\tfor(int i=0; i<normedScores.length; i++) {\\n\\t\\t\\tRandom r = new Random();\\n\\t\\t\\tdouble x = r.nextDouble() * sum;\\n\\t\\t\\tdouble y = r.nextDouble() * sum;\\n\\t\\t\\tdouble accum = 0;\\n\\t\\t\\t\\n\\t\\t\\tint p=-1, q=-1; //indices of the parents we choose for this child\\n\\t\\t\\tfor(int j=0; accum < x || accum < y; j++) { \\n\\t\\t\\t\\t//we won't run off the end of the array because the scores\\n\\t\\t\\t\\t//sum to 1, and both x and y are <1.\\n\\t\\t\\t\\taccum += normedScores[j];\\n\\t\\t\\t\\tif(p == -1 && accum >= x) p=j; //update only the first time\\n\\t\\t\\t\\tif(q == -1 && accum >= y) q=j;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t//we chose parents j and k\\n\\t\\t\\tS child = survivors.get(p).mate(survivors.get(q), mutationRate);\\n\\t\\t\\tnewGeneration.add(child);\\n\\t\\t}\\n\\t\\t\\n\\t\\tgenerationCounter++;\\n\\t\\tcurrentGeneration = newGeneration;\\n\\t\\tif(best == null || currentGeneration.peek().score() >= best.score())\\n\\t\\t\\tbest = currentGeneration.peek();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"830d150348bb0d257fa1c4a5c90c676d\",\n \"score\": \"0.5255091\",\n \"text\": \"public int getNbNodes()\\n\\t{\\n\\t\\treturn stats.getNbNodes();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"97708b6900b25e7caa8d51e3feff6099\",\n \"score\": \"0.52489096\",\n \"text\": \"int getNodeCount();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f12b7593c01a72bd4b8f6d660b89bbdf\",\n \"score\": \"0.52442926\",\n \"text\": \"@Override\\r\\n\\tpublic void runFunc() {\\n\\t\\tSystem.out.println(numTrees(6));\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee132b5d3ee28f673fc391dfc7054693\",\n \"score\": \"0.5235468\",\n \"text\": \"protected Vector[] linearPartition(Vector entries) {\\r\\n int n = entries.size();\\r\\n assert (n > ctree.M);\\r\\n\\r\\n int n0 = ctree.rand.nextInt(n);\\r\\n Graph g0 = childGraphAt(n0); // g0\\r\\n\\r\\n // choose g1\\r\\n double dmax = 0;\\r\\n int n1 = -1;\\r\\n for (int i = 0; i < n; i++) {\\r\\n Graph g = childGraphAt(i);\\r\\n if (i == n0) {\\r\\n continue;\\r\\n }\\r\\n double d = dist(g0, g);\\r\\n if (d > dmax) {\\r\\n dmax = d;\\r\\n n1 = i;\\r\\n }\\r\\n }\\r\\n Graph g1 = childGraphAt(n1);\\r\\n\\r\\n // choose g2\\r\\n dmax = 0;\\r\\n int n2 = -1;\\r\\n double[] dist = new double[n];\\r\\n for (int i = 0; i < n; i++) {\\r\\n Graph g = childGraphAt(i);\\r\\n if (i == n1) {\\r\\n continue;\\r\\n }\\r\\n double d = dist(g1, g);\\r\\n if (d > dmax) {\\r\\n dmax = d;\\r\\n n2 = i;\\r\\n }\\r\\n dist[i] = d; // distance to g1\\r\\n }\\r\\n Graph g2 = childGraphAt(n2);\\r\\n\\r\\n // compute d(g,g1)-d(g,g2)\\r\\n for (int i = 0; i < n; i++) {\\r\\n Graph g = childGraphAt(i);\\r\\n dist[i] = dist[i] - dist(g2, g);\\r\\n }\\r\\n\\r\\n // sort in ascedning order\\r\\n int[] order = new int[n];\\r\\n for (int i = 0; i < n; i++) {\\r\\n order[i] = i;\\r\\n }\\r\\n for (int i = 0; i < n - 1; i++) {\\r\\n for (int j = i + 1; j < n; j++) {\\r\\n if (dist[i] > dist[j]) {\\r\\n double temp = dist[i]; // swap i,j\\r\\n dist[i] = dist[j];\\r\\n dist[j] = temp;\\r\\n int temp2 = order[i];\\r\\n order[i] = order[j];\\r\\n order[j] = temp2;\\r\\n }\\r\\n }\\r\\n }\\r\\n\\r\\n // find a middle point to partition\\r\\n int mid;\\r\\n for (mid = ctree.m; mid < n - ctree.m; mid++) {\\r\\n if (dist[mid] > 0 || (dist[mid] == 0 && mid > n / 2)) {\\r\\n break;\\r\\n }\\r\\n }\\r\\n\\r\\n Vector vect1 = new Vector(ctree.M + 1);\\r\\n Vector vect2 = new Vector(ctree.M + 1);\\r\\n for (int i = 0; i < mid; i++) {\\r\\n vect1.addElement(entries.elementAt(order[i]));\\r\\n }\\r\\n for (int i = mid; i < n; i++) {\\r\\n vect2.addElement(entries.elementAt(order[i]));\\r\\n }\\r\\n return new Vector[] {vect1, vect2};\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a7c48c0ef68c7091ed968bbf94fefad\",\n \"score\": \"0.5228146\",\n \"text\": \"public static C4_5DecisionNode createNode(Samples samples)\\r\\n\\t{\\r\\n\\t\\tdouble bestEntropy = -1000.0;\\r\\n\\t\\tdouble bestDivider = 0.0;\\r\\n\\t\\tAttribute bestAttribute = null;\\r\\n\\t\\t\\r\\n\\t\\tList<Attribute> attributes = samples.getAtts();\\r\\n\\t\\r\\n\\t\\t\\r\\n\\t\\tfor(Attribute a:attributes)\\r\\n\\t\\t\\tif(!a.equals(samples.getClassAttribute()))\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif (a instanceof Nominal) {\\r\\n\\t\\t\\t\\t\\tNominal nominal = (Nominal) a;\\r\\n\\t\\t\\t\\t\\tdouble entropy = Entropy.nominalEntropy(samples, nominal);\\r\\n\\t\\t\\t\\t\\tif(entropy>bestEntropy)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tbestEntropy = entropy;\\r\\n\\t\\t\\t\\t\\t\\tbestAttribute = nominal;\\r\\n\\t\\t\\t\\t\\t}\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse if (a instanceof Numeric) {\\r\\n\\t\\t\\t\\t\\tNumeric numeric = (Numeric) a;\\r\\n\\t\\t\\t\\t\\tif(samples.size()<=DIV_POINTS_COUNT)\\r\\n\\t\\t\\t\\t\\t\\tfor (Sample sample : samples) \\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tObject o = sample.get(samples.getAtts().indexOf(numeric));\\r\\n\\t\\t\\t\\t\\t\\t\\tif(o!=null)\\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tdouble div = (Double)sample.get(samples.getAtts().indexOf(numeric));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tdouble entropy = Entropy.numericEntropy(samples, numeric, div);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif(entropy>bestEntropy)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tbestDivider = div;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tbestEntropy = entropy;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tbestAttribute = numeric;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tRandom r = new Random(0);\\r\\n\\t\\t\\t\\t\\t\\tint i = DIV_POINTS_COUNT;\\r\\n\\t\\t\\t\\t\\t\\twhile(i-->0)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tSample sample = samples.get(r.nextInt(samples.size())); \\r\\n\\t\\t\\t\\t\\t\\t\\tdouble div = (Double)sample.get(sample.getSamples().getAtts().indexOf(numeric));\\r\\n\\t\\t\\t\\t\\t\\t\\tdouble entropy = Entropy.numericEntropy(samples, numeric, div);\\r\\n\\t\\t\\t\\t\\t\\t\\tif(entropy>bestEntropy)\\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tbestDivider = div;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tbestEntropy = entropy;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tbestAttribute = numeric;\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\r\\n\\r\\n\\t\\tif(bestAttribute==null)\\r\\n\\t\\t{\\r\\n\\t\\t\\treturn new C4_5DecisionLeaf(samples);\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tif (bestAttribute instanceof Nominal) {\\r\\n\\t\\t\\tNominal nominal = (Nominal) bestAttribute;\\r\\n\\t\\t\\treturn new C4_5NominalNode(samples,nominal);\\r\\n\\t\\t}\\r\\n\\t\\telse if (bestAttribute instanceof Numeric) {\\r\\n\\t\\t\\tNumeric numeric = (Numeric) bestAttribute;\\r\\n\\t\\t\\treturn new C4_5NumericNode(samples,numeric,bestDivider);\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tthrow new IllegalArgumentException(\\\"Unknown attribute type\\\");\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e7430d8c6ab0ab53875ea930d445dbb\",\n \"score\": \"0.5222605\",\n \"text\": \"public double scoreLnGam(Node node, Set<Node> parents, BayesPm bayesPmMod,\\n BayesIm bayesIm) {\\n // System.out.println(\\\"In Cache scoreLnGam \\\");\\n // System.out.print(\\\"Processing node \\\" + node.getName() + \\\" with parents \\\");\\n\\n // for (Iterator itp = parents.iterator(); itp.hasNext();) {\\n // System.out.print(((Node) itp.next()).getName() + \\\" \\\");\\n // }\\n // System.out.println();\\n\\n //A factor of a model is determined by a node and its parents in that model.\\n //The NodeParentsPair inner class provides a means to instantiate such\\n //a pair so that it can be used as an argument to the Map scores.\\n NodeParentsPair nodeAndParents = new NodeParentsPair(node, parents);\\n double score;\\n\\n //If the score of this factor has already been computed and stored, retrieve it from the\\n //Map scores.\\n if (scores.containsKey(nodeAndParents)) {\\n System.out.println(\\n node + \\\" Score came from map--counts not computed.\\\");\\n score = scores.get(nodeAndParents);\\n\\n return score;\\n }\\n else { //otherwise compute it and store it in the map.\\n\\n //String[] varNames = dataSet.getVariableNames();\\n\\n //Create arrays for storing observed counts and prior probabilities for\\n //this factor. In observedCounts and priorProbs, for instance, there will be as\\n //many rows as there are combinations of values of the parents and\\n //as many columns as there are categories of the child variable.\\n Node[] parentArray = new Node[parents.size()];\\n for (int i = 0; i < parentArray.length; i++) {\\n parentArray[i] = (Node) (parents.toArray()[i]);\\n }\\n\\n /*\\n int numRows = 1;\\n for (int i = 0; i < parentArray.length; i++) {\\n String name = parentArray[i].getName();\\n\\n int index = getVarIndex(name);\\n //int numCats = ((DiscreteVariable) variables.get(index)).getNumSplits();\\n int numCats = bayesPm.getNumSplits(parentArray[i]);\\n numRows *= numCats;\\n }\\n */\\n\\n BayesIm bayesImMod = new MlBayesIm(bayesPmMod);\\n int numRows = bayesImMod.getNumRows(bayesImMod.getNodeIndex(node));\\n\\n double[][] priorProbs;\\n double[] priorProbsRowSum;\\n\\n observedCounts = new double[numRows][];\\n priorProbs = new double[numRows][];\\n\\n //The following two arrays are used to store the sum of the counts and\\n //prior probablities for each row.\\n double[] observedCountsRowSum = new double[numRows];\\n priorProbsRowSum = new double[numRows];\\n\\n //The int index will be the index of the variable associated with node\\n //in dataset.\\n// int index = getVarIndex(name);\\n //System.out.println(\\\"NAME: \\\" + name);\\n //int numCols = ((DiscreteVariable) variables.get(index)).getNumSplits();\\n int numCols = bayesPm.getNumCategories(node);\\n\\n //Initialize the observed counts and prior probabilities arrays.\\n for (int j = 0; j < numRows; j++) {\\n\\n observedCountsRowSum[j] = 0;\\n priorProbsRowSum[j] = 0;\\n\\n observedCounts[j] = new double[numCols];\\n priorProbs[j] = new double[numCols];\\n }\\n\\n //At this point set values in observedCounts according to the cases in the dataset.\\n if (bayesIm == null) {\\n computeObservedCounts(node, parentArray);\\n }\\n else\\n //computeObservedCountsMD(node, bayesPmMod, bayesIm);\\n {\\n computeObservedCountsMD(node, bayesPmMod, bayesIm);\\n }\\n\\n //Set all priorProbs (i.e. estimated counts) to 1.0. Eventually they may be\\n //supplied as a parameter of the constructor of this class.\\n for (int j = 0; j < numRows; j++) {\\n for (int k = 0; k < numCols; k++)\\n //priorProbs[j][k] = 1.0;\\n {\\n priorProbs[j][k] = 1.0 /\\n (numRows * numCols); //Per David Danks 12/21/04\\n }\\n }\\n\\n for (int j = 0; j < numRows; j++) {\\n // System.out.print(\\\"Observed counts row \\\" + j);\\n for (int k = 0; k < numCols; k++) {\\n\\n //DEBUG PRINT:\\n // System.out.print(\\\" \\\" + observedCounts[j][k]);\\n\\n observedCountsRowSum[j] += observedCounts[j][k];\\n priorProbsRowSum[j] += priorProbs[j][k];\\n }\\n // System.out.println();\\n }\\n\\n //The loops below compute the products on page 25 of the Heckerman et al. paper.\\n //Actually sums are computed since logarithms of the terms are used. That is\\n //why the log gamma function (lngamma) is used.\\n double sum = 0.0;\\n\\n// int n = nodes.length; //The number of factors (i.e. variables).\\n\\n for (int j = 0; j < numRows; j++) {\\n\\n try {\\n double numerator = ProbUtils.lngamma(priorProbsRowSum[j]);\\n double denom = ProbUtils.lngamma(\\n priorProbsRowSum[j] + observedCountsRowSum[j]);\\n\\n //gammln is a slightly more accurate method than lngamma.\\n //double numerator = ProbUtils.gammln(priorProbsRowSum[j]);\\n //double denom =\\n // ProbUtils.gammln(priorProbsRowSum[j] + observedCountsRowSum[j]);\\n\\n //System.out.println(\\\"num = \\\" + numerator + \\\" denom = \\\" + denom);\\n sum += (numerator - denom);\\n }\\n catch (Exception e) {\\n e.printStackTrace();\\n }\\n\\n //double prodk = 1.0;\\n double sumk = 0.0;\\n for (int k = 0; k < numCols; k++) {\\n try {\\n sumk += ProbUtils.lngamma(\\n priorProbs[j][k] + observedCounts[j][k]) -\\n ProbUtils.lngamma(priorProbs[j][k]);\\n\\n /* Debug print\\n if(Double.isNaN(sumk)) {\\n System.out.println(\\\"sumk is Nan\\\");\\n System.out.println(priorProbs[j][k] + \\\" \\\" + observedCounts[j][k]);\\n }\\n */\\n\\n //sumk += ProbUtils.gammln(priorProbs[j][k] + observedCounts[j][k]) -\\n // ProbUtils.gammln(priorProbs[j][k]);\\n }\\n catch (Exception e) {\\n e.printStackTrace();\\n }\\n }\\n\\n sum += sumk;\\n }\\n\\n score = sum;\\n\\n }\\n\\n //Store the node and parents pair and the score in the scores Map.\\n //Also return the score.\\n Double scoreDouble = score;\\n scores.put(nodeAndParents, scoreDouble);\\n\\n //System.out.println(\\\"For node \\\" + node.getName() + \\\" with parents \\\" + parents);\\n //System.out.println(\\\"Score = \\\" + score);\\n return score;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e531bb5b3776b7b54851befbdbb70941\",\n \"score\": \"0.5216921\",\n \"text\": \"public void determinePartitions( Callback c ){\\n int currentDepth = 0;\\n GraphNode node;\\n GraphNode parent;\\n GraphNode child;\\n int depth = 0;\\n List levelList = new java.util.LinkedList();\\n String currentLabel = null;\\n int i = 0,partitionNum = 0;\\n\\n\\n mLogger.log( \\\"Starting Graph Traversal\\\", LogManager.INFO_MESSAGE_LEVEL );\\n //set the depth of the dummy root as 0\\n mRoot.setDepth( currentDepth );\\n\\n mQueue.addLast( mRoot );\\n\\n while( !mQueue.isEmpty() ){\\n node = (GraphNode)mQueue.getFirst();\\n depth = node.getDepth();\\n currentLabel = getLabel( node );\\n if(currentDepth < depth){\\n //a new level starts\\n currentDepth++;\\n levelList.clear();\\n }\\n\\n //get the partition for the label\\n Partition p = null;\\n if( mPartitionMap.containsKey( currentLabel ) ){\\n p = (Partition)mPartitionMap.get( currentLabel );\\n }\\n else {\\n p = new Partition();\\n if( currentDepth > 0 ){\\n partitionNum++;\\n p.setIndex( partitionNum );\\n p.setID(getPartitionID( partitionNum ));\\n mPartitionMap.put( currentLabel, p );\\n }\\n }\\n\\n if( p.lastAddedNode()!= null && depth > p.lastAddedNode().getDepth() + 1 ){\\n throw new RuntimeException( \\\"Invalid labelled graph\\\" );\\n /*\\n //partition with current label has been fully\\n //constructed. write out the existing partition\\n\\n //create a new partition\\n Partition newp = new Partition();\\n newp.addNode(node);\\n mPartitionMap.put(currentLabel,newp);\\n */\\n }\\n else if(currentDepth > 0){\\n //add to the existing partition for the current label\\n p.addNode(node);\\n //also associate the partition id with the node\\n node.getBag().add( LabelBag.PARTITION_KEY,p.getID() );\\n }\\n\\n\\n mLogger.log(\\\"Adding to level \\\" + currentDepth + \\\" \\\"\\n + node.getID(),LogManager.DEBUG_MESSAGE_LEVEL);\\n levelList.add( node );\\n\\n\\n node.setColor( GraphNode.BLACK_COLOR );\\n for( Iterator it = node.getChildren().iterator(); it.hasNext(); ){\\n child = (GraphNode)it.next();\\n if(!child.isColor( GraphNode.GRAY_COLOR ) &&\\n child.parentsColored( GraphNode.BLACK_COLOR ) ){\\n mLogger.log( \\\"Adding to queue \\\" + child.getID(),\\n LogManager.DEBUG_MESSAGE_LEVEL );\\n child.setDepth( depth + 1 );\\n child.setColor( GraphNode.GRAY_COLOR );\\n mQueue.addLast( child );\\n }\\n\\n }\\n node = (GraphNode)mQueue.removeFirst();\\n mLogger.log( \\\"Removed \\\" + node.getID(),\\n LogManager.DEBUG_MESSAGE_LEVEL );\\n }\\n mLogger.log( \\\"Starting Graph Traversal - DONE\\\",\\n LogManager.INFO_MESSAGE_LEVEL );\\n\\n for( Iterator it = mPartitionMap.entrySet().iterator(); it.hasNext(); ){\\n Map.Entry entry = (Map.Entry)it.next();\\n Partition p = (Partition)entry.getValue();\\n p.constructPartition();\\n mLogger.log( \\\"Partition is \\\" + p.getNodeIDs() + \\\" corresponding to label \\\" +\\n entry.getKey(),\\n LogManager.DEBUG_MESSAGE_LEVEL );\\n \\n //PM-745 set whether a single sized partition was associated with a label\\n //or not. any partition of size > 1 has to have a label assoicated.\\n boolean hasAssociatedLabel = true;\\n if( p.getSize() == 1 ){\\n //for single sized partitions look into the last added node\\n //and check whether the label is equal the node id\\n GraphNode n = p.lastAddedNode();\\n if( this.getLabel( n ).equals( n.getID() ) ){\\n //user did not associated a specific label key\\n hasAssociatedLabel = false ;\\n }\\n }\\n p.doesHaveAssociatedLabel( hasAssociatedLabel );\\n \\n //call the callback\\n c.cbPartition( p );\\n }\\n\\n mLogger.log( \\\"Determining relations between partitions\\\",\\n LogManager.INFO_MESSAGE_LEVEL );\\n //construct the relations\\n for( Iterator it = mPartitionMap.entrySet().iterator(); it.hasNext(); ){\\n Map.Entry entry = (Map.Entry) it.next();\\n Partition p = (Partition) entry.getValue();\\n List roots = p.getRootNodes();\\n Set parentPartitions = new HashSet( roots.size() );\\n\\n //get the Root nodes for each partition and\\n //for each root, determine the partitions of it's parents\\n for( Iterator rootIt = roots.iterator(); rootIt.hasNext(); ){\\n node = (GraphNode)rootIt.next();\\n for( Iterator parentsIt = node.getParents().iterator(); parentsIt.hasNext(); ){\\n parent = (GraphNode)parentsIt.next();\\n //the parents partition id is parent for the\\n //partition containing the root\\n parentPartitions.add( parent.getBag().get( LabelBag.PARTITION_KEY ) );\\n }\\n }\\n \\n //write out all the parents of the partition\\n if(!parentPartitions.isEmpty()){\\n c.cbParents( p.getID(), new ArrayList( parentPartitions ) );\\n }\\n }\\n mLogger.log( \\\"Determining relations between partitions - DONE\\\",\\n LogManager.INFO_MESSAGE_LEVEL );\\n\\n //done with the partitioning\\n c.cbDone();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"651b8a905205b04a9c6031eba31f7a28\",\n \"score\": \"0.5213281\",\n \"text\": \"public void draw() {\\n if (root == null) return;\\n class NodeWithLimitations {\\n final Node node;\\n final double x0;\\n final double y0;\\n final double x1;\\n final double y1;\\n NodeWithLimitations(Node node, double x0, double y0, double x1, double y1) {\\n this.node = node;\\n this.x0 = x0;\\n this.y0 = y0;\\n this.x1 = x1;\\n this.y1 = y1;\\n }\\n public String toString() {\\n return node.p.toString() + \\\"[\\\" + x0 + \\\", \\\" + y0 + \\\", \\\" + x1 + \\\", \\\" + y1 + \\\"]\\\";\\n }\\n };\\n Queue<NodeWithLimitations> bfs = new Queue<NodeWithLimitations>();\\n NodeWithLimitations node = null;\\n bfs.enqueue(new NodeWithLimitations(root, 0, 0, 1, 1));\\n while (!bfs.isEmpty()) {\\n node = bfs.dequeue();\\n StdDraw.setPenColor(StdDraw.BLACK);\\n StdDraw.setPenRadius(.01);\\n node.node.p.draw();\\n \\n StdDraw.setPenRadius(.005);\\n if (node.node.v) {\\n StdDraw.setPenColor(StdDraw.RED);\\n StdDraw.line(node.node.p.x(), node.y0, node.node.p.x(), node.y1);\\n } else {\\n StdDraw.setPenColor(StdDraw.BLUE);\\n StdDraw.line(node.x0, node.node.p.y(), node.x1, node.node.p.y());\\n }\\n if (node.node.lb != null) {\\n NodeWithLimitations tmp = null;\\n if (node.node.v) {\\n tmp = new NodeWithLimitations(node.node.lb, node.x0, node.y0, node.node.p.x(), node.y1);\\n } else {\\n tmp = new NodeWithLimitations(node.node.lb, node.x0, node.y0, node.x1, node.node.p.y());\\n }\\n bfs.enqueue(tmp);\\n }\\n if (node.node.rt != null) {\\n NodeWithLimitations tmp = null;\\n if (node.node.v) {\\n tmp = new NodeWithLimitations(node.node.rt, node.node.p.x(), node.y0, node.x1, node.y1);\\n } else {\\n tmp = new NodeWithLimitations(node.node.rt, node.x0, node.node.p.y(), node.x1, node.y1);\\n }\\n bfs.enqueue(tmp);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"90f37d0f258aca5a92980abb09e5ca0c\",\n \"score\": \"0.5208705\",\n \"text\": \"void doCountProbabilitiesForInternal(NodeData node, NodeData u1, NodeData u2, Double [] coalescenceRate, boolean dprint)throws Exception {\\n//\\t\\tint n1 = u1.m_n;\\n//\\t\\tint n2 = u2.m_n;\\n\\t\\tint n1 = u1.getSize();\\n\\t\\tint n2 = u2.getSize();\\n\\t\\tint n = n1+n2;\\n\\t\\tnode.resize(n);\\n\\n\\n\\t\\tdouble g1 = coalescenceRate[u1.getNr()];//u1.gamma();\\n\\t\\tdouble g2 = coalescenceRate[u2.getNr()];//u2.gamma();\\n\\t\\tdouble t1 = u1.t();\\n\\t\\tdouble t2 = u2.t();\\n\\n\\n//\\t\\tu1.m_Nt = computeTavareProbs(g1*t1, u1.m_Nb);\\n//\\t\\tu2.m_Nt = computeTavareProbs(g2*t2, u2.m_Nb);\\n\\n//\\t\\tif( dprint ) {\\n//\\t\\t\\tdouble sum = 0.0;\\n//\\t\\t\\tSystem.out.println(\\\"g1,t1 \\\" + g1 + \\\" \\\" + t1 + \\\" g2,t2 \\\" + g2 + \\\" \\\" + t2);\\n//\\t\\t\\tsum = 0.0;\\tfor (int i = 0; i < u1.m_Nb.length; i++) {sum += u1.m_Nb[i];}\\n//\\t\\t\\tSystem.out.println(u1.getNr() + \\\" u1.Nb \\\" + u1.m_Nb.length + \\\" sum=\\\"+sum + \\\" \\\" + Arrays.toString(u1.m_Nb)); \\n//\\t\\t\\tsum = 0.0;\\tfor (int i = 0; i < u1.m_Nt.length; i++) {sum += u1.m_Nt[i];}\\n//\\t\\t\\tSystem.out.println(u1.getNr() + \\\" u1.Nt \\\" + u1.m_Nt.length + \\\" sum=\\\"+sum + \\\" \\\" + Arrays.toString(u1.m_Nt));\\n//\\t\\t\\tsum = 0.0;\\tfor (int i = 0; i < u2.m_Nb.length; i++) {sum += u2.m_Nb[i];}\\n//\\t\\t\\tSystem.out.println(u2.getNr() + \\\" u2.Nb \\\" + u2.m_Nb.length + \\\" sum=\\\"+sum + \\\" \\\" + Arrays.toString(u2.m_Nb));\\n//\\t\\t\\tsum = 0.0;\\tfor (int i = 0; i < u2.m_Nt.length; i++) {sum += u2.m_Nt[i];}\\n//\\t\\t\\tSystem.out.println(u2.getNr() + \\\" u2.Nt \\\" + u2.m_Nt.length + \\\" sum=\\\"+sum + \\\" \\\" + Arrays.toString(u2.m_Nt)); \\n//\\t\\t}\\n\\n\\t\\t//std::fill(Nb.begin(), Nb.end(), 0.0);\\n\\t\\t//node.Nb = new double[n1+n2+1];\\n//\\t\\tfor(int i1 = 1;i1<=n1;i1++) {\\n//\\t\\t\\tfor(int i2 = 1;i2<=n2;i2++) {\\n//\\t\\t\\t\\tnode.m_Nb[i1+i2] += u1.m_Nt[i1]*u2.m_Nt[i2];\\n//\\t\\t\\t}\\n//\\t\\t}\\n//\\t\\tif( dprint ) {\\n//\\t\\t\\tdouble sum = 0.0;for (int i = 0; i < node.m_Nb.length; i++) {sum += node.m_Nb[i];}\\n//\\t\\t\\tSystem.out.println(node.getNr() + \\\" node.Nb \\\" + node.m_Nb.length + \\\" sum=\\\"+sum + \\\" \\\" + Arrays.toString(node.m_Nb));\\n//\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40ae859bf4f62a8afd0cc794aae41193\",\n \"score\": \"0.52084535\",\n \"text\": \"public void getPosteriorDistributionOf(FiniteStates V) {\\n \\n NodeList NotRemoved;\\n FiniteStates X, Y;\\n Relation R;\\n RelationList RLtemp;\\n //PotentialTree Pot;\\n Potential Pot;\\n PairTable P;\\n int i, j, k, p, pos, s;\\n\\n NotRemoved = new NodeList();\\n P = new PairTable();\\n \\n s = network.getNodeList().size();\\n for (i=0 ; i<s ; i++) {\\n X = (FiniteStates)network.getNodeList().elementAt(i);\\n //if ((observations.indexOf(X) == -1) && (X!=V)) {\\n if ((!observations.isObserved(X)) && (X!=V)) {\\n NotRemoved.insertNode(X);\\n P.addElement(X);\\n }\\n }\\n\\n \\n //CurrentRelations = getInitialRelations();\\n CurrentRelations = getInitialRelations(V);\\n\\n \\n /* Now restrict the valuations to the obervations */\\n\\n if (observations.size() > 0)\\n CurrentRelations.restrictToObservations(observations);\\n //restrictToObservations(CurrentRelations);\\n \\n for (i=0 ; i<CurrentRelations.size() ; i++)\\n P.addRelation(CurrentRelations.elementAt(i));\\n\\n \\n for (i=NotRemoved.size() ; i>0 ; i--) {\\n X = P.nextToRemove();\\n NotRemoved.removeNode(X);\\n P.removeVariable(X);\\n RLtemp = CurrentRelations.getRelationsOfAndRemove(X);\\n \\n if(RLtemp.size()>0) {\\n R = RLtemp.elementAt(0);\\n P.removeRelation(R);\\n Pot=R.getValues();\\n \\n for (j=1 ; j<RLtemp.size() ; j++) {\\n R = RLtemp.elementAt(j);\\n P.removeRelation(R);\\n //Pot = Pot.combine((PotentialTree)R.getValues());\\n Pot=combine(Pot,R.getValues());\\n }\\n \\n Pot=addVariable(Pot,X);\\n Pot=transformAfterAdding(Pot);\\n \\n //System.out.println(\\\"He borrado \\\"+X.Name);\\n R = new Relation();\\n R.setKind(\\\"potential\\\");\\n R.getVariables().nodes = (Vector)Pot.getVariables().clone();\\n R.setValues(Pot);\\n CurrentRelations.insertRelation(R);\\n P.addRelation(R);\\n }\\n }\\n \\n /* After this, CurrentRelations must only contain relations\\n for variable V */\\n \\n RLtemp = CurrentRelations.getRelationsOf(V);\\n \\n R = RLtemp.elementAt(0);\\n P.removeRelation(R);\\n //Pot = (PotentialTree)R.getValues();\\n Pot = R.getValues();\\n\\n for (j=1 ; j<RLtemp.size() ; j++) {\\n R = RLtemp.elementAt(j);\\n P.removeRelation(R);\\n //Pot = Pot.combine((PotentialTree)R.getValues());\\n Pot=combine(Pot,R.getValues());\\n }\\n //Pot.limitBound(limitForPrunning);\\n Pot=transformAfterEliminating(Pot);\\n \\n results.addElement(Pot);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bbc0e9635af205111c33f5dac7559552\",\n \"score\": \"0.5203985\",\n \"text\": \"@java.lang.Override\\n public int getNodeCount() {\\n return node_.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43188360f881ecfc46451b31ed9a5570\",\n \"score\": \"0.5196347\",\n \"text\": \"public int getNumNodes() {\\n return numNodes;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8256378ebad1ff0d32ddf3b5f56cd891\",\n \"score\": \"0.5193533\",\n \"text\": \"@Override\\n\\tpublic int getNodeCount() {\\n\\t\\treturn nodeCount;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f86b99103d6b4e9ceaae4318b30884c8\",\n \"score\": \"0.51927865\",\n \"text\": \"public double generateDirection() {\\n\\t\\ttempNodes = new ArrayList<Node>();\\n\\t\\tRandom r = new Random();\\n\\t\\t\\n\\t\\t// for every edge in the minimum spanning tree (this.tree)\\n\\t\\tfor(int i=0; i<tree.size();i++) {\\n\\t\\t\\t// Extract the nodes from the edges\\n\\t\\t\\tNode one = new Node(tree.get(i).getStart());\\n\\t\\t\\tNode two = new Node(tree.get(i).getEnd());\\n\\t\\t\\t// randomly make one of the nodes a parent and the other a child\\n\\t\\t\\tif(r.nextInt(2)==1) {\\n\\t\\t \\t// if not already referenced the other way around\\n\\t\\t\\t\\tif(!two.getParents().contains(one)) {\\n\\t\\t\\t\\t\\tone.addParent(two);\\n\\t\\t\\t\\t}\\n\\t\\t } else {\\n\\t\\t \\t// if not already referenced the other way around\\n\\t\\t \\tif(!one.getParents().contains(two)) {\\n\\t\\t \\t\\ttwo.addParent(one);\\n\\t\\t \\t}\\n\\t\\t }\\n\\t\\t if(!tempNodes.contains(one)) {\\n\\t\\t \\ttempNodes.add(one);\\n\\t\\t }\\n\\t\\t if(!tempNodes.contains(two)) {\\n\\t\\t \\ttempNodes.add(two);\\n\\t\\t } \\n\\t\\t}\\n\\t\\t// calculate cpt for all of tempNodes\\n\\t\\tfor(Node n : tempNodes) {\\n\\t\\t\\tfindCPT(n, dataset);\\n\\t\\t}\\n\\t\\t// Check the log-likelihood of tempNodes\\n\\t\\treturn log_likelihood(tempNodes, dataset);\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a0ae28359fffac2eab797cf1fac49da1\",\n \"score\": \"0.51916426\",\n \"text\": \"public int getNumNodes() {\\n return nodes.size();\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983499,"cells":{"query_id":{"kind":"string","value":"137b05f6508eac16cb33c075aa8517e0"},"query":{"kind":"string","value":"Library construction does not need to care whether their are or are not any entry points."},"positive_passages":{"kind":"list like","value":[{"docid":"c7ade3967d79db56a8bcd9b9590a00f4","score":"0.0","text":"@Override\n protected void checkEntryPoints(String[] entryPointTypeNames, String[] additionalRootTypes) {\n }","title":""}],"string":"[\n {\n \"docid\": \"c7ade3967d79db56a8bcd9b9590a00f4\",\n \"score\": \"0.0\",\n \"text\": \"@Override\\n protected void checkEntryPoints(String[] entryPointTypeNames, String[] additionalRootTypes) {\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"33ed194d6499f4a427c4daf3b642c37e","score":"0.6940886","text":"Library createLibrary();","title":""},{"docid":"33ed194d6499f4a427c4daf3b642c37e","score":"0.6940886","text":"Library createLibrary();","title":""},{"docid":"33ed194d6499f4a427c4daf3b642c37e","score":"0.6940886","text":"Library createLibrary();","title":""},{"docid":"71b9557d52414eb7b22e3ed5a7b91c09","score":"0.63748235","text":"public Library() {\n\t}","title":""},{"docid":"f11d4892e70efdc30e3d99f183c0289d","score":"0.6339665","text":"private ProverLib() {\n\t\t// no instance\n\t}","title":""},{"docid":"ec83b296c2fe13ac2119f8472a7ef8fc","score":"0.63163424","text":"private void libSetup() {\n String osName = System.getProperty(\"os.name\");\n if (osName.equals(\"Linux\")) {\n ensureLib(\"/tmp/lib64\", \"libc++.so\", RUNTIME_TOOLS_DIR + \"linux/lib64/libc++.so\");\n } else if (osName.startsWith(\"Windows\")) {\n ensureLib(System.getProperty(\"java.io.tmpdir\"), \"libwinpthread-1.dll\", WINDOWS_PTHEAD_DLL);\n }\n }","title":""},{"docid":"f3a5d782fc67da3eb0613fb3ccf1058a","score":"0.6135249","text":"public static void main(String[] args) {\n\t\tnew LibraryManagement();\n\n\t}","title":""},{"docid":"5573b21545039f9e01ee99186a8a7447","score":"0.60538393","text":"public static void setupLibrary() {\r\n // for DAV (over http and https)\r\n DAVRepositoryFactory.setup();\r\n\r\n // for SVN (over svn and svn+ssh)\r\n SVNRepositoryFactoryImpl.setup();\r\n\r\n // For File \r\n FSRepositoryFactory.setup();\r\n }","title":""},{"docid":"addc80ad5e2855468c01a88c5c19526c","score":"0.60498357","text":"private OSGiUtils() {}","title":""},{"docid":"7c7005f62209a605e6e4d4e9572b624e","score":"0.5972195","text":"public static void init() {}","title":""},{"docid":"1f14a058399050af1b7fa8c6cf317389","score":"0.5970045","text":"private AppUtils() {\n\t\t\n\t}","title":""},{"docid":"82444bb638937edfdb13445fc79885d0","score":"0.5961496","text":"private MainLogic() {\n\t}","title":""},{"docid":"cc3a497fe2a313f597cb4919101d59f8","score":"0.5945706","text":"void onStartBuildingLibrary();","title":""},{"docid":"a5ac0e7da2f70e8112015a6929a021be","score":"0.5937935","text":"private AppUtility() {}","title":""},{"docid":"1a2bbd265ec0a2508bde4ad4438b7a47","score":"0.59285617","text":"static public interface Loader { public void loadLibrary(String libname); }","title":""},{"docid":"ac6da3c1d1b3ce67a176f230f32b1b69","score":"0.5901416","text":"public codeLib() {\n }","title":""},{"docid":"d918de5c4785777e303da6054bcd32e1","score":"0.58750093","text":"private DefinitionsFactoryUtil() {\n }","title":""},{"docid":"0472224f37b34edf59bff73f7e34694f","score":"0.5857855","text":"protected abstract void attachImplementationAndInitialize();","title":""},{"docid":"f23105242bdbcfd1a7234dfaec1d7c10","score":"0.5832047","text":"mainDeclared createmainDeclared();","title":""},{"docid":"9016de972864e5a2c6f755001f4fc8b3","score":"0.58281296","text":"EntryPointSpec createEntryPointSpec();","title":""},{"docid":"8752935f4b47f79bbd2abd530c7c8ad0","score":"0.5815104","text":"private final synchronized void init() {\r\n if (hasInit)\r\n return;\r\n if (init0() != 1) {\r\n throw new PaloException(\"failed to initialize native palo-library.\");\r\n }\r\n hasInit = true;\r\n }","title":""},{"docid":"689a837673ec7dd833f7d7a75ceb64ec","score":"0.57994527","text":"private BuiltInTypeObjectFactory() {\n }","title":""},{"docid":"ebed963a60e5cb8a73644dcdb7a5d3d8","score":"0.5777394","text":"public abstract void init();","title":""},{"docid":"ebed963a60e5cb8a73644dcdb7a5d3d8","score":"0.5777394","text":"public abstract void init();","title":""},{"docid":"ebed963a60e5cb8a73644dcdb7a5d3d8","score":"0.5777394","text":"public abstract void init();","title":""},{"docid":"ebed963a60e5cb8a73644dcdb7a5d3d8","score":"0.5777394","text":"public abstract void init();","title":""},{"docid":"ebed963a60e5cb8a73644dcdb7a5d3d8","score":"0.5777394","text":"public abstract void init();","title":""},{"docid":"ebed963a60e5cb8a73644dcdb7a5d3d8","score":"0.5777394","text":"public abstract void init();","title":""},{"docid":"ebed963a60e5cb8a73644dcdb7a5d3d8","score":"0.5777394","text":"public abstract void init();","title":""},{"docid":"ebed963a60e5cb8a73644dcdb7a5d3d8","score":"0.5777394","text":"public abstract void init();","title":""},{"docid":"ebed963a60e5cb8a73644dcdb7a5d3d8","score":"0.5777394","text":"public abstract void init();","title":""},{"docid":"ebed963a60e5cb8a73644dcdb7a5d3d8","score":"0.5777394","text":"public abstract void init();","title":""},{"docid":"ebed963a60e5cb8a73644dcdb7a5d3d8","score":"0.5777394","text":"public abstract void init();","title":""},{"docid":"ebed963a60e5cb8a73644dcdb7a5d3d8","score":"0.5777394","text":"public abstract void init();","title":""},{"docid":"ebed963a60e5cb8a73644dcdb7a5d3d8","score":"0.5777394","text":"public abstract void init();","title":""},{"docid":"2a1d3c9127594ab53ffe01cf8de8a58a","score":"0.5775816","text":"private BytelandUtil() {\n\t}","title":""},{"docid":"a800bf88766287243d030ac55d1e80d8","score":"0.57635915","text":"protected abstract void init();","title":""},{"docid":"a800bf88766287243d030ac55d1e80d8","score":"0.57635915","text":"protected abstract void init();","title":""},{"docid":"8d91d5022162f1fc844eeb9a86fb6183","score":"0.57227397","text":"private Utils() {\r\n\t}","title":""},{"docid":"c97fd5ef140c777dc9d9322bcb6db736","score":"0.57218915","text":"void onInitialized(ILibrary library);","title":""},{"docid":"2d0824e923a5d66806b3bad0940abbd3","score":"0.57036203","text":"private Utils() {}","title":""},{"docid":"2d0824e923a5d66806b3bad0940abbd3","score":"0.57036203","text":"private Utils() {}","title":""},{"docid":"4e41b9fea0a703b164b1d0c244130f13","score":"0.57005674","text":"public void init();","title":""},{"docid":"4e41b9fea0a703b164b1d0c244130f13","score":"0.57005674","text":"public void init();","title":""},{"docid":"4e41b9fea0a703b164b1d0c244130f13","score":"0.57005674","text":"public void init();","title":""},{"docid":"4e41b9fea0a703b164b1d0c244130f13","score":"0.57005674","text":"public void init();","title":""},{"docid":"4e41b9fea0a703b164b1d0c244130f13","score":"0.57005674","text":"public void init();","title":""},{"docid":"4e41b9fea0a703b164b1d0c244130f13","score":"0.57005674","text":"public void init();","title":""},{"docid":"4e41b9fea0a703b164b1d0c244130f13","score":"0.57005674","text":"public void init();","title":""},{"docid":"4e41b9fea0a703b164b1d0c244130f13","score":"0.57005674","text":"public void init();","title":""},{"docid":"4e41b9fea0a703b164b1d0c244130f13","score":"0.57005674","text":"public void init();","title":""},{"docid":"4e41b9fea0a703b164b1d0c244130f13","score":"0.57005674","text":"public void init();","title":""},{"docid":"4e41b9fea0a703b164b1d0c244130f13","score":"0.57005674","text":"public void init();","title":""},{"docid":"4e41b9fea0a703b164b1d0c244130f13","score":"0.57005674","text":"public void init();","title":""},{"docid":"4e41b9fea0a703b164b1d0c244130f13","score":"0.57005674","text":"public void init();","title":""},{"docid":"4e41b9fea0a703b164b1d0c244130f13","score":"0.57005674","text":"public void init();","title":""},{"docid":"6db694ae9c8799610c80b08c71020791","score":"0.56978565","text":"public static void init(BundleContext context) {\n\t\ttry {\n\t\t\tString libPath = \"/natives/\"+getSystemDescriptor();\n\t\t\t\n\t\t\tif (isJar(NativesUtils.class)) {\n\t\t\t\t// Set library path to new temporary location.\n\t\t\t\tString jarPath = new File(NativesUtils.class.getProtectionDomain()\n\t\t\t\t\t\t.getCodeSource().getLocation().toURI()).getParent();\n\t\t\t\tSystem.setProperty(\"java.library.path\", \n\t\t\t\t\t\tSystem.getProperty(\"java.library.path\") \n\t\t\t\t\t\t+ File.pathSeparator + jarPath + \"/\" + libPath);\n\n\t\t\t\tString dst = new File(getRootPath(NativesUtils.class)).getParent();\n\t\t\t\tPath path = null;\n\t\t\t\tURI uri = NativesUtils.class.getResource(libPath).toURI();\n\t\t\t\t\n\t\t\t\tFileSystem fileSystem = null;\n\t\t\t\tif (\"jar\".equals(uri.getScheme())) {\n\t\t\t\t\t// Try to get the file system if it exists.\n\t\t\t\t\ttry {\n\t\t\t\t\t\tfileSystem = FileSystems.getFileSystem(uri);\n\t\t\t\t\t} catch (Exception e) {\n\t\t\t\t\t\t// For some reason, exception is thrown in either case: when \n\t\t\t\t\t\t// there is no filesystem of that name, but also when it already\n\t\t\t\t\t\t// exists. Exception must be ignored for first attempted case.\n\t\t\t\t\t\t// (otherwise one would be logged every time)\n\t\t\t\t\t}\n\n\t\t\t\t\tif (fileSystem == null)\n\t\t\t\t\t\tfileSystem = FileSystems.newFileSystem(uri,\n\t\t\t\t\t\t\t\tCollections.<String, Object> emptyMap());\n\t\t\t\t\tpath = fileSystem.getPath(libPath + \"/\"); // NOSONAR\n\t\t\t\t} else {\n\t\t\t\t\tpath = Paths.get(uri);\n\t\t\t\t}\n\n\t\t\t\t// Copy all native libraries next to jar being executed.\n\t\t\t\ttry (Stream<Path> walk = Files.walk(path, 1)) {\n\t\t\t\t\tfor (Iterator<Path> it = walk.iterator(); it.hasNext();) {\n\t\t\t\t\t\tPath filePath = it.next();\n\t\t\t\t\t\tString fileName = filePath.getFileName().toString();\n\t\t\t\t\t\tif (!fileName.contains(\".\")) continue;\n\t\t\t\t\t\textractResource(filePath.toString(),\n\t\t\t\t\t\t\t\tdst + libPath + \"/\" + fileName, false);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if (isBundle(NativesUtils.class)) {\n\t\t\t\t// Set library path to new temporary location next to currently executed jar/project.\n\t\t\t\tSystem.setProperty(\"java.library.path\", \n\t\t\t\t\t\tSystem.getProperty(\"java.library.path\") \n\t\t\t\t\t\t+ File.pathSeparator + new File(\".\").getAbsolutePath() + \"/\" + libPath);\n\n\t\t\t\tfor (Bundle bundle : context.getBundles()) {\n\t\t\t\t\t\n\t\t\t\t\t// Locate explicitly jogamp wrapper bundle. Could potentially go looking at \n\t\t\t\t\t// all paths loading any native stuff with complying os and architecture getting\n\t\t\t\t\t// rid of this hardcoded path.\n\t\t\t\t\tif (!bundle.getSymbolicName().equals(\"org.example.repack.jogamp\")) continue;\n\t\t\t\t\t\n\t\t\t\t\tEnumeration<String> paths = bundle.getEntryPaths(libPath);\n\t\t\t\t\tif (paths == null) continue;\n\t\t\t\t\t\n\t\t\t\t\twhile (paths.hasMoreElements()) {\n\t\t\t\t\t\tString path = paths.nextElement();\n\t\t\t\t\t\tURL url = bundle.getResource(path);\n\t\t\t\t\t\t\n\t\t\t\t\t\t// Copy byte by byte in runtime root.\n\t\t\t\t\t\ttry (InputStream in = url.openConnection().getInputStream()) {\n\t\t\t\t\t\t\tFile target = new File(path);\n\t\t\t\t\t\t\ttarget.getParentFile().mkdirs();\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\ttry (FileOutputStream out = new FileOutputStream(target)) {\n\t\t\t\t\t\t\t\tint nbytes = 0;\n\t\t\t\t\t\t\t byte[] buffer = new byte[1024*8];\n\t\t\t\t\t\t while ((nbytes = in.read(buffer)) != -1) {\n\t\t\t\t\t\t out.write(buffer, 0, nbytes);\n\t\t\t\t\t\t }\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}","title":""},{"docid":"51fefaab553d5fda71cd020a65c6babb","score":"0.5690854","text":"private Utilities() {\n }","title":""},{"docid":"229a70d481924829deec962d4aa9542c","score":"0.5685532","text":"public void init() {}","title":""},{"docid":"7a5a49c40b1a216bbd8eb7729f1406d7","score":"0.5684366","text":"private LafSupport() {\r\n }","title":""},{"docid":"55efe24a5974d3dd471387ab6cafecc1","score":"0.56645995","text":"public static void initSoot()\n {\n Options.v().set_output_format(Options.output_format_none);\n Options.v().set_src_prec(Options.src_prec_apk);\n\n Options.v().set_allow_phantom_refs(true);\n Options.v().set_whole_program(true);\n\n Scene.v().addBasicClass(\"java.io.PrintStream\", SootClass.SIGNATURES);\n Scene.v().addBasicClass(\"java.lang.System\", SootClass.SIGNATURES);\n Scene.v().loadNecessaryClasses();\n }","title":""},{"docid":"5cefbadea83be11ad13c33ddfc3b004d","score":"0.5662325","text":"private Util() {\n\t}","title":""},{"docid":"5cefbadea83be11ad13c33ddfc3b004d","score":"0.5662325","text":"private Util() {\n\t}","title":""},{"docid":"c8c954ab0ce5c267dbc4672dd1668d83","score":"0.56412584","text":"private Engine() {\n\t}","title":""},{"docid":"2c43efe9b070d23c609d1bf5096c4eae","score":"0.56375736","text":"void init();","title":""},{"docid":"2c43efe9b070d23c609d1bf5096c4eae","score":"0.56375736","text":"void init();","title":""},{"docid":"2c43efe9b070d23c609d1bf5096c4eae","score":"0.56375736","text":"void init();","title":""},{"docid":"2c43efe9b070d23c609d1bf5096c4eae","score":"0.56375736","text":"void init();","title":""},{"docid":"2c43efe9b070d23c609d1bf5096c4eae","score":"0.56375736","text":"void init();","title":""},{"docid":"2c43efe9b070d23c609d1bf5096c4eae","score":"0.56375736","text":"void init();","title":""},{"docid":"2c43efe9b070d23c609d1bf5096c4eae","score":"0.56375736","text":"void init();","title":""},{"docid":"2c43efe9b070d23c609d1bf5096c4eae","score":"0.56375736","text":"void init();","title":""},{"docid":"2c43efe9b070d23c609d1bf5096c4eae","score":"0.56375736","text":"void init();","title":""},{"docid":"2c43efe9b070d23c609d1bf5096c4eae","score":"0.56375736","text":"void init();","title":""},{"docid":"2c43efe9b070d23c609d1bf5096c4eae","score":"0.56375736","text":"void init();","title":""},{"docid":"fc05566b1b356cb07df286a21333cc1a","score":"0.56340253","text":"private AssemblerFactory() {\n \t// Do nothing.\n }","title":""},{"docid":"cf68909aed2c6135a0029cd36e9966e9","score":"0.56249654","text":"private Tools() {\n\t\t}","title":""},{"docid":"5c8b834f383792ea5e1ae4a153690806","score":"0.5608335","text":"private IOTools() {\n }","title":""},{"docid":"9a3f6d010c21f4cb10444b9685b69f87","score":"0.5605368","text":"private main() {\n }","title":""},{"docid":"590006b81a8418b925f2f70f136a1635","score":"0.5603487","text":"abstract public void init();","title":""},{"docid":"9f279ebd0a45275a7d4e7f46c0a4be67","score":"0.5601893","text":"boolean hasLibrary();","title":""},{"docid":"f53cf6d2b7c0e9dd9c53938c52908ca1","score":"0.56016433","text":"private MicroEngine() {\n }","title":""},{"docid":"558f6a79ba4221dee2990e65f2dbd841","score":"0.55967325","text":"private Utilities( )\n {\n }","title":""},{"docid":"16ef9c145e1140f37543396dd4b741ed","score":"0.5596413","text":"private void init() {\n registerTagLibrary(\"\",ReallyStaticTagLibrary.INSTANCE);\n registerTagLibrary(\"this\",ThisTagLibrary.INSTANCE);\n\n if (DISABLE_BEANUTILS_CLASS_SUPPRESSION) {\n /* In case our existing workarounds in StaplerTagLibrary for IncludeTag aren't enough */\n PropertyUtilsBean propertyUtilsBean = BeanUtilsBean.getInstance().getPropertyUtils();\n propertyUtilsBean.removeBeanIntrospector(SuppressPropertiesBeanIntrospector.SUPPRESS_CLASS);\n }\n }","title":""},{"docid":"20d50200fe6966bcd3ea612bf35bc24a","score":"0.55811024","text":"private ExampleSubsystem() {\n }","title":""},{"docid":"c6c9a87a6d85f68ff96f073e82ee4ef4","score":"0.5576673","text":"default void init() {}","title":""},{"docid":"9b01c03760d4fa868d2d4e089718bf15","score":"0.55756307","text":"private AtlasGeneratorHelper()\n {\n }","title":""},{"docid":"cb37426a5fa05369bb82c2806d25e903","score":"0.55719805","text":"private void init() {\n\t\tRDFWriterRegistry.getInstance().add( new CLPWriterFactory() );\n\t\tRDFParserRegistry.getInstance().add( new CLPParserFactory() );\n\t\tRDFWriterRegistry.getInstance().add( new TurtleWriterFactory() );\n\t\tRDFParserRegistry.getInstance().add( new TurtleParserFactory() );\n\t\tRDFWriterRegistry.getInstance().add( new RDFXMLWriterFactory() );\n\t\tRDFParserRegistry.getInstance().add( new RDFXMLParserFactory() );\n\t}","title":""},{"docid":"5e0537b1a570aadf23cab1b2d42de2a8","score":"0.55699027","text":"public abstract void externalize();","title":""},{"docid":"d6d19293f35ac046d0202718c98f1852","score":"0.5567073","text":"private ProcessFunctions()\n\t{\n\t}","title":""},{"docid":"a4a9b2d9232f3c627510ff81df7b9653","score":"0.55576557","text":"public abstract void initialization();","title":""},{"docid":"36e400a516499204257ae497b7df4f8f","score":"0.5556701","text":"private Util() {}","title":""},{"docid":"2fc0d21c53f36a80644a77447c4cb706","score":"0.55433613","text":"public MainApplication() {}","title":""},{"docid":"464201002fa878d8797b5f2a6e5b2c76","score":"0.5540447","text":"private VanillaIceCreamFactory() {}","title":""},{"docid":"88132c4c5dd769f1e24a21b5c1a70de8","score":"0.55307883","text":"private ClassUtil() {\r\n\t}","title":""},{"docid":"fe41847454d8e4e0e4eaca7d8a3b40bd","score":"0.5524408","text":"private void recupererMain() {\n\t}","title":""},{"docid":"fda147e4ae4b45691e17bb52f75190d9","score":"0.5522055","text":"public static void init() {\n\n\t}","title":""},{"docid":"5499a9dd482c8b3c59f11526484d82fb","score":"0.55201286","text":"public static void main(String[] args) {\n\n\n\n\n\n\n new Main().init();\n\n }","title":""},{"docid":"50071b36549af1b893ead68807d7da8c","score":"0.55134696","text":"protected void initLibrarySearcher() {\n\n\t\t_librarySearcher = new SimpleLibrarySearcher(_library,\n\t\t\t\t_librarySearchPane);\n\t\tif (_librarySearcher == null) {\n\t\t\tSystem.out\n\t\t\t\t\t.println(\"error: librarySearcher is null. This \"\n\t\t\t\t\t\t\t+ \"problem can be fixed by adding a librarySearcherFactory \"\n\t\t\t\t\t\t\t+ \"property in the configuration.xml file.\");\n\t\t}\n\n\t}","title":""},{"docid":"19e237679df2af599f7110eca3a1fe63","score":"0.5504659","text":"public Main() {\r\n }","title":""},{"docid":"3c7b23b71a269c84d94273b681966e22","score":"0.55030614","text":"private QueryToolRuntime()\n\t{ init(); }","title":""}],"string":"[\n {\n \"docid\": \"33ed194d6499f4a427c4daf3b642c37e\",\n \"score\": \"0.6940886\",\n \"text\": \"Library createLibrary();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"33ed194d6499f4a427c4daf3b642c37e\",\n \"score\": \"0.6940886\",\n \"text\": \"Library createLibrary();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"33ed194d6499f4a427c4daf3b642c37e\",\n \"score\": \"0.6940886\",\n \"text\": \"Library createLibrary();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"71b9557d52414eb7b22e3ed5a7b91c09\",\n \"score\": \"0.63748235\",\n \"text\": \"public Library() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f11d4892e70efdc30e3d99f183c0289d\",\n \"score\": \"0.6339665\",\n \"text\": \"private ProverLib() {\\n\\t\\t// no instance\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec83b296c2fe13ac2119f8472a7ef8fc\",\n \"score\": \"0.63163424\",\n \"text\": \"private void libSetup() {\\n String osName = System.getProperty(\\\"os.name\\\");\\n if (osName.equals(\\\"Linux\\\")) {\\n ensureLib(\\\"/tmp/lib64\\\", \\\"libc++.so\\\", RUNTIME_TOOLS_DIR + \\\"linux/lib64/libc++.so\\\");\\n } else if (osName.startsWith(\\\"Windows\\\")) {\\n ensureLib(System.getProperty(\\\"java.io.tmpdir\\\"), \\\"libwinpthread-1.dll\\\", WINDOWS_PTHEAD_DLL);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3a5d782fc67da3eb0613fb3ccf1058a\",\n \"score\": \"0.6135249\",\n \"text\": \"public static void main(String[] args) {\\n\\t\\tnew LibraryManagement();\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5573b21545039f9e01ee99186a8a7447\",\n \"score\": \"0.60538393\",\n \"text\": \"public static void setupLibrary() {\\r\\n // for DAV (over http and https)\\r\\n DAVRepositoryFactory.setup();\\r\\n\\r\\n // for SVN (over svn and svn+ssh)\\r\\n SVNRepositoryFactoryImpl.setup();\\r\\n\\r\\n // For File \\r\\n FSRepositoryFactory.setup();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"addc80ad5e2855468c01a88c5c19526c\",\n \"score\": \"0.60498357\",\n \"text\": \"private OSGiUtils() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c7005f62209a605e6e4d4e9572b624e\",\n \"score\": \"0.5972195\",\n \"text\": \"public static void init() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f14a058399050af1b7fa8c6cf317389\",\n \"score\": \"0.5970045\",\n \"text\": \"private AppUtils() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82444bb638937edfdb13445fc79885d0\",\n \"score\": \"0.5961496\",\n \"text\": \"private MainLogic() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc3a497fe2a313f597cb4919101d59f8\",\n \"score\": \"0.5945706\",\n \"text\": \"void onStartBuildingLibrary();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5ac0e7da2f70e8112015a6929a021be\",\n \"score\": \"0.5937935\",\n \"text\": \"private AppUtility() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a2bbd265ec0a2508bde4ad4438b7a47\",\n \"score\": \"0.59285617\",\n \"text\": \"static public interface Loader { public void loadLibrary(String libname); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac6da3c1d1b3ce67a176f230f32b1b69\",\n \"score\": \"0.5901416\",\n \"text\": \"public codeLib() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d918de5c4785777e303da6054bcd32e1\",\n \"score\": \"0.58750093\",\n \"text\": \"private DefinitionsFactoryUtil() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0472224f37b34edf59bff73f7e34694f\",\n \"score\": \"0.5857855\",\n \"text\": \"protected abstract void attachImplementationAndInitialize();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f23105242bdbcfd1a7234dfaec1d7c10\",\n \"score\": \"0.5832047\",\n \"text\": \"mainDeclared createmainDeclared();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9016de972864e5a2c6f755001f4fc8b3\",\n \"score\": \"0.58281296\",\n \"text\": \"EntryPointSpec createEntryPointSpec();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8752935f4b47f79bbd2abd530c7c8ad0\",\n \"score\": \"0.5815104\",\n \"text\": \"private final synchronized void init() {\\r\\n if (hasInit)\\r\\n return;\\r\\n if (init0() != 1) {\\r\\n throw new PaloException(\\\"failed to initialize native palo-library.\\\");\\r\\n }\\r\\n hasInit = true;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"689a837673ec7dd833f7d7a75ceb64ec\",\n \"score\": \"0.57994527\",\n \"text\": \"private BuiltInTypeObjectFactory() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebed963a60e5cb8a73644dcdb7a5d3d8\",\n \"score\": \"0.5777394\",\n \"text\": \"public abstract void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebed963a60e5cb8a73644dcdb7a5d3d8\",\n \"score\": \"0.5777394\",\n \"text\": \"public abstract void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebed963a60e5cb8a73644dcdb7a5d3d8\",\n \"score\": \"0.5777394\",\n \"text\": \"public abstract void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebed963a60e5cb8a73644dcdb7a5d3d8\",\n \"score\": \"0.5777394\",\n \"text\": \"public abstract void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebed963a60e5cb8a73644dcdb7a5d3d8\",\n \"score\": \"0.5777394\",\n \"text\": \"public abstract void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebed963a60e5cb8a73644dcdb7a5d3d8\",\n \"score\": \"0.5777394\",\n \"text\": \"public abstract void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebed963a60e5cb8a73644dcdb7a5d3d8\",\n \"score\": \"0.5777394\",\n \"text\": \"public abstract void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebed963a60e5cb8a73644dcdb7a5d3d8\",\n \"score\": \"0.5777394\",\n \"text\": \"public abstract void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebed963a60e5cb8a73644dcdb7a5d3d8\",\n \"score\": \"0.5777394\",\n \"text\": \"public abstract void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebed963a60e5cb8a73644dcdb7a5d3d8\",\n \"score\": \"0.5777394\",\n \"text\": \"public abstract void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebed963a60e5cb8a73644dcdb7a5d3d8\",\n \"score\": \"0.5777394\",\n \"text\": \"public abstract void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebed963a60e5cb8a73644dcdb7a5d3d8\",\n \"score\": \"0.5777394\",\n \"text\": \"public abstract void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebed963a60e5cb8a73644dcdb7a5d3d8\",\n \"score\": \"0.5777394\",\n \"text\": \"public abstract void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a1d3c9127594ab53ffe01cf8de8a58a\",\n \"score\": \"0.5775816\",\n \"text\": \"private BytelandUtil() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a800bf88766287243d030ac55d1e80d8\",\n \"score\": \"0.57635915\",\n \"text\": \"protected abstract void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a800bf88766287243d030ac55d1e80d8\",\n \"score\": \"0.57635915\",\n \"text\": \"protected abstract void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d91d5022162f1fc844eeb9a86fb6183\",\n \"score\": \"0.57227397\",\n \"text\": \"private Utils() {\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c97fd5ef140c777dc9d9322bcb6db736\",\n \"score\": \"0.57218915\",\n \"text\": \"void onInitialized(ILibrary library);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d0824e923a5d66806b3bad0940abbd3\",\n \"score\": \"0.57036203\",\n \"text\": \"private Utils() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d0824e923a5d66806b3bad0940abbd3\",\n \"score\": \"0.57036203\",\n \"text\": \"private Utils() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e41b9fea0a703b164b1d0c244130f13\",\n \"score\": \"0.57005674\",\n \"text\": \"public void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e41b9fea0a703b164b1d0c244130f13\",\n \"score\": \"0.57005674\",\n \"text\": \"public void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e41b9fea0a703b164b1d0c244130f13\",\n \"score\": \"0.57005674\",\n \"text\": \"public void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e41b9fea0a703b164b1d0c244130f13\",\n \"score\": \"0.57005674\",\n \"text\": \"public void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e41b9fea0a703b164b1d0c244130f13\",\n \"score\": \"0.57005674\",\n \"text\": \"public void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e41b9fea0a703b164b1d0c244130f13\",\n \"score\": \"0.57005674\",\n \"text\": \"public void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e41b9fea0a703b164b1d0c244130f13\",\n \"score\": \"0.57005674\",\n \"text\": \"public void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e41b9fea0a703b164b1d0c244130f13\",\n \"score\": \"0.57005674\",\n \"text\": \"public void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e41b9fea0a703b164b1d0c244130f13\",\n \"score\": \"0.57005674\",\n \"text\": \"public void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e41b9fea0a703b164b1d0c244130f13\",\n \"score\": \"0.57005674\",\n \"text\": \"public void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e41b9fea0a703b164b1d0c244130f13\",\n \"score\": \"0.57005674\",\n \"text\": \"public void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e41b9fea0a703b164b1d0c244130f13\",\n \"score\": \"0.57005674\",\n \"text\": \"public void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e41b9fea0a703b164b1d0c244130f13\",\n \"score\": \"0.57005674\",\n \"text\": \"public void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e41b9fea0a703b164b1d0c244130f13\",\n \"score\": \"0.57005674\",\n \"text\": \"public void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6db694ae9c8799610c80b08c71020791\",\n \"score\": \"0.56978565\",\n \"text\": \"public static void init(BundleContext context) {\\n\\t\\ttry {\\n\\t\\t\\tString libPath = \\\"/natives/\\\"+getSystemDescriptor();\\n\\t\\t\\t\\n\\t\\t\\tif (isJar(NativesUtils.class)) {\\n\\t\\t\\t\\t// Set library path to new temporary location.\\n\\t\\t\\t\\tString jarPath = new File(NativesUtils.class.getProtectionDomain()\\n\\t\\t\\t\\t\\t\\t.getCodeSource().getLocation().toURI()).getParent();\\n\\t\\t\\t\\tSystem.setProperty(\\\"java.library.path\\\", \\n\\t\\t\\t\\t\\t\\tSystem.getProperty(\\\"java.library.path\\\") \\n\\t\\t\\t\\t\\t\\t+ File.pathSeparator + jarPath + \\\"/\\\" + libPath);\\n\\n\\t\\t\\t\\tString dst = new File(getRootPath(NativesUtils.class)).getParent();\\n\\t\\t\\t\\tPath path = null;\\n\\t\\t\\t\\tURI uri = NativesUtils.class.getResource(libPath).toURI();\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tFileSystem fileSystem = null;\\n\\t\\t\\t\\tif (\\\"jar\\\".equals(uri.getScheme())) {\\n\\t\\t\\t\\t\\t// Try to get the file system if it exists.\\n\\t\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\t\\tfileSystem = FileSystems.getFileSystem(uri);\\n\\t\\t\\t\\t\\t} catch (Exception e) {\\n\\t\\t\\t\\t\\t\\t// For some reason, exception is thrown in either case: when \\n\\t\\t\\t\\t\\t\\t// there is no filesystem of that name, but also when it already\\n\\t\\t\\t\\t\\t\\t// exists. Exception must be ignored for first attempted case.\\n\\t\\t\\t\\t\\t\\t// (otherwise one would be logged every time)\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif (fileSystem == null)\\n\\t\\t\\t\\t\\t\\tfileSystem = FileSystems.newFileSystem(uri,\\n\\t\\t\\t\\t\\t\\t\\t\\tCollections.<String, Object> emptyMap());\\n\\t\\t\\t\\t\\tpath = fileSystem.getPath(libPath + \\\"/\\\"); // NOSONAR\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tpath = Paths.get(uri);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// Copy all native libraries next to jar being executed.\\n\\t\\t\\t\\ttry (Stream<Path> walk = Files.walk(path, 1)) {\\n\\t\\t\\t\\t\\tfor (Iterator<Path> it = walk.iterator(); it.hasNext();) {\\n\\t\\t\\t\\t\\t\\tPath filePath = it.next();\\n\\t\\t\\t\\t\\t\\tString fileName = filePath.getFileName().toString();\\n\\t\\t\\t\\t\\t\\tif (!fileName.contains(\\\".\\\")) continue;\\n\\t\\t\\t\\t\\t\\textractResource(filePath.toString(),\\n\\t\\t\\t\\t\\t\\t\\t\\tdst + libPath + \\\"/\\\" + fileName, false);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else if (isBundle(NativesUtils.class)) {\\n\\t\\t\\t\\t// Set library path to new temporary location next to currently executed jar/project.\\n\\t\\t\\t\\tSystem.setProperty(\\\"java.library.path\\\", \\n\\t\\t\\t\\t\\t\\tSystem.getProperty(\\\"java.library.path\\\") \\n\\t\\t\\t\\t\\t\\t+ File.pathSeparator + new File(\\\".\\\").getAbsolutePath() + \\\"/\\\" + libPath);\\n\\n\\t\\t\\t\\tfor (Bundle bundle : context.getBundles()) {\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Locate explicitly jogamp wrapper bundle. Could potentially go looking at \\n\\t\\t\\t\\t\\t// all paths loading any native stuff with complying os and architecture getting\\n\\t\\t\\t\\t\\t// rid of this hardcoded path.\\n\\t\\t\\t\\t\\tif (!bundle.getSymbolicName().equals(\\\"org.example.repack.jogamp\\\")) continue;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tEnumeration<String> paths = bundle.getEntryPaths(libPath);\\n\\t\\t\\t\\t\\tif (paths == null) continue;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\twhile (paths.hasMoreElements()) {\\n\\t\\t\\t\\t\\t\\tString path = paths.nextElement();\\n\\t\\t\\t\\t\\t\\tURL url = bundle.getResource(path);\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t// Copy byte by byte in runtime root.\\n\\t\\t\\t\\t\\t\\ttry (InputStream in = url.openConnection().getInputStream()) {\\n\\t\\t\\t\\t\\t\\t\\tFile target = new File(path);\\n\\t\\t\\t\\t\\t\\t\\ttarget.getParentFile().mkdirs();\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\ttry (FileOutputStream out = new FileOutputStream(target)) {\\n\\t\\t\\t\\t\\t\\t\\t\\tint nbytes = 0;\\n\\t\\t\\t\\t\\t\\t\\t byte[] buffer = new byte[1024*8];\\n\\t\\t\\t\\t\\t\\t while ((nbytes = in.read(buffer)) != -1) {\\n\\t\\t\\t\\t\\t\\t out.write(buffer, 0, nbytes);\\n\\t\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t} catch (Exception e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51fefaab553d5fda71cd020a65c6babb\",\n \"score\": \"0.5690854\",\n \"text\": \"private Utilities() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"229a70d481924829deec962d4aa9542c\",\n \"score\": \"0.5685532\",\n \"text\": \"public void init() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a5a49c40b1a216bbd8eb7729f1406d7\",\n \"score\": \"0.5684366\",\n \"text\": \"private LafSupport() {\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55efe24a5974d3dd471387ab6cafecc1\",\n \"score\": \"0.56645995\",\n \"text\": \"public static void initSoot()\\n {\\n Options.v().set_output_format(Options.output_format_none);\\n Options.v().set_src_prec(Options.src_prec_apk);\\n\\n Options.v().set_allow_phantom_refs(true);\\n Options.v().set_whole_program(true);\\n\\n Scene.v().addBasicClass(\\\"java.io.PrintStream\\\", SootClass.SIGNATURES);\\n Scene.v().addBasicClass(\\\"java.lang.System\\\", SootClass.SIGNATURES);\\n Scene.v().loadNecessaryClasses();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5cefbadea83be11ad13c33ddfc3b004d\",\n \"score\": \"0.5662325\",\n \"text\": \"private Util() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5cefbadea83be11ad13c33ddfc3b004d\",\n \"score\": \"0.5662325\",\n \"text\": \"private Util() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c8c954ab0ce5c267dbc4672dd1668d83\",\n \"score\": \"0.56412584\",\n \"text\": \"private Engine() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c43efe9b070d23c609d1bf5096c4eae\",\n \"score\": \"0.56375736\",\n \"text\": \"void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c43efe9b070d23c609d1bf5096c4eae\",\n \"score\": \"0.56375736\",\n \"text\": \"void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c43efe9b070d23c609d1bf5096c4eae\",\n \"score\": \"0.56375736\",\n \"text\": \"void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c43efe9b070d23c609d1bf5096c4eae\",\n \"score\": \"0.56375736\",\n \"text\": \"void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c43efe9b070d23c609d1bf5096c4eae\",\n \"score\": \"0.56375736\",\n \"text\": \"void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c43efe9b070d23c609d1bf5096c4eae\",\n \"score\": \"0.56375736\",\n \"text\": \"void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c43efe9b070d23c609d1bf5096c4eae\",\n \"score\": \"0.56375736\",\n \"text\": \"void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c43efe9b070d23c609d1bf5096c4eae\",\n \"score\": \"0.56375736\",\n \"text\": \"void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c43efe9b070d23c609d1bf5096c4eae\",\n \"score\": \"0.56375736\",\n \"text\": \"void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c43efe9b070d23c609d1bf5096c4eae\",\n \"score\": \"0.56375736\",\n \"text\": \"void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c43efe9b070d23c609d1bf5096c4eae\",\n \"score\": \"0.56375736\",\n \"text\": \"void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc05566b1b356cb07df286a21333cc1a\",\n \"score\": \"0.56340253\",\n \"text\": \"private AssemblerFactory() {\\n \\t// Do nothing.\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cf68909aed2c6135a0029cd36e9966e9\",\n \"score\": \"0.56249654\",\n \"text\": \"private Tools() {\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c8b834f383792ea5e1ae4a153690806\",\n \"score\": \"0.5608335\",\n \"text\": \"private IOTools() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a3f6d010c21f4cb10444b9685b69f87\",\n \"score\": \"0.5605368\",\n \"text\": \"private main() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"590006b81a8418b925f2f70f136a1635\",\n \"score\": \"0.5603487\",\n \"text\": \"abstract public void init();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f279ebd0a45275a7d4e7f46c0a4be67\",\n \"score\": \"0.5601893\",\n \"text\": \"boolean hasLibrary();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f53cf6d2b7c0e9dd9c53938c52908ca1\",\n \"score\": \"0.56016433\",\n \"text\": \"private MicroEngine() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"558f6a79ba4221dee2990e65f2dbd841\",\n \"score\": \"0.55967325\",\n \"text\": \"private Utilities( )\\n {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16ef9c145e1140f37543396dd4b741ed\",\n \"score\": \"0.5596413\",\n \"text\": \"private void init() {\\n registerTagLibrary(\\\"\\\",ReallyStaticTagLibrary.INSTANCE);\\n registerTagLibrary(\\\"this\\\",ThisTagLibrary.INSTANCE);\\n\\n if (DISABLE_BEANUTILS_CLASS_SUPPRESSION) {\\n /* In case our existing workarounds in StaplerTagLibrary for IncludeTag aren't enough */\\n PropertyUtilsBean propertyUtilsBean = BeanUtilsBean.getInstance().getPropertyUtils();\\n propertyUtilsBean.removeBeanIntrospector(SuppressPropertiesBeanIntrospector.SUPPRESS_CLASS);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"20d50200fe6966bcd3ea612bf35bc24a\",\n \"score\": \"0.55811024\",\n \"text\": \"private ExampleSubsystem() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6c9a87a6d85f68ff96f073e82ee4ef4\",\n \"score\": \"0.5576673\",\n \"text\": \"default void init() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b01c03760d4fa868d2d4e089718bf15\",\n \"score\": \"0.55756307\",\n \"text\": \"private AtlasGeneratorHelper()\\n {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb37426a5fa05369bb82c2806d25e903\",\n \"score\": \"0.55719805\",\n \"text\": \"private void init() {\\n\\t\\tRDFWriterRegistry.getInstance().add( new CLPWriterFactory() );\\n\\t\\tRDFParserRegistry.getInstance().add( new CLPParserFactory() );\\n\\t\\tRDFWriterRegistry.getInstance().add( new TurtleWriterFactory() );\\n\\t\\tRDFParserRegistry.getInstance().add( new TurtleParserFactory() );\\n\\t\\tRDFWriterRegistry.getInstance().add( new RDFXMLWriterFactory() );\\n\\t\\tRDFParserRegistry.getInstance().add( new RDFXMLParserFactory() );\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e0537b1a570aadf23cab1b2d42de2a8\",\n \"score\": \"0.55699027\",\n \"text\": \"public abstract void externalize();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d6d19293f35ac046d0202718c98f1852\",\n \"score\": \"0.5567073\",\n \"text\": \"private ProcessFunctions()\\n\\t{\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4a9b2d9232f3c627510ff81df7b9653\",\n \"score\": \"0.55576557\",\n \"text\": \"public abstract void initialization();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36e400a516499204257ae497b7df4f8f\",\n \"score\": \"0.5556701\",\n \"text\": \"private Util() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2fc0d21c53f36a80644a77447c4cb706\",\n \"score\": \"0.55433613\",\n \"text\": \"public MainApplication() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"464201002fa878d8797b5f2a6e5b2c76\",\n \"score\": \"0.5540447\",\n \"text\": \"private VanillaIceCreamFactory() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"88132c4c5dd769f1e24a21b5c1a70de8\",\n \"score\": \"0.55307883\",\n \"text\": \"private ClassUtil() {\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe41847454d8e4e0e4eaca7d8a3b40bd\",\n \"score\": \"0.5524408\",\n \"text\": \"private void recupererMain() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fda147e4ae4b45691e17bb52f75190d9\",\n \"score\": \"0.5522055\",\n \"text\": \"public static void init() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5499a9dd482c8b3c59f11526484d82fb\",\n \"score\": \"0.55201286\",\n \"text\": \"public static void main(String[] args) {\\n\\n\\n\\n\\n\\n\\n new Main().init();\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"50071b36549af1b893ead68807d7da8c\",\n \"score\": \"0.55134696\",\n \"text\": \"protected void initLibrarySearcher() {\\n\\n\\t\\t_librarySearcher = new SimpleLibrarySearcher(_library,\\n\\t\\t\\t\\t_librarySearchPane);\\n\\t\\tif (_librarySearcher == null) {\\n\\t\\t\\tSystem.out\\n\\t\\t\\t\\t\\t.println(\\\"error: librarySearcher is null. This \\\"\\n\\t\\t\\t\\t\\t\\t\\t+ \\\"problem can be fixed by adding a librarySearcherFactory \\\"\\n\\t\\t\\t\\t\\t\\t\\t+ \\\"property in the configuration.xml file.\\\");\\n\\t\\t}\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19e237679df2af599f7110eca3a1fe63\",\n \"score\": \"0.5504659\",\n \"text\": \"public Main() {\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7b23b71a269c84d94273b681966e22\",\n \"score\": \"0.55030614\",\n \"text\": \"private QueryToolRuntime()\\n\\t{ init(); }\",\n \"title\": \"\"\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":9834,"numItemsPerPage":100,"numTotalItems":995064,"offset":983400,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTUyMjU2MSwic3ViIjoiL2RhdGFzZXRzL250aGFrdXIvY29ybnN0YWNrLWphdmEtdjEtdGV2YXRyb24tMU0iLCJleHAiOjE3Nzk1MjYxNjEsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.V87HprjrlC7a1-kTaXgbj4oqGerX5GNQ2jq9b0_FOInk-_jyG135WzewFjFfOBvN96sFRS79TnH3jbZb2maEAw","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":995064,"numBytesParquet":17569818855}]},"discussionsStats":{"closed":0,"open":0,"total":0},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
query_id stringlengths 32 32 | query stringlengths 7 129k | positive_passages listlengths 1 1 | negative_passages listlengths 88 101 |
|---|---|---|---|
0a4e73d07d4272a851dc5aff8cc4e790 | Busca a quantidade de candidatos a partir de um nome. | [
{
"docid": "342ee2c103cb329972e97a9eed16ac99",
"score": "0.4556597",
"text": "public int verificaVotacaoCandidato(String candidato) throws SQLException {\r\n\t\tSQL = \"SELECT COUNT(candidato) AS qtde FROM votacao_candidatos WHERE votacao_candidatos.candidato = '\" + candidato + \"'\";\r\n\t\tresultado ... | [
{
"docid": "292ae83fa931cbf27d84cc0bb8be91bf",
"score": "0.6119095",
"text": "public int quantidadeVotacaoCandidatos(String cargo) throws SQLException {\r\n\t\tSQL = \"SELECT COUNT(votacao_candidatos.candidato) AS qtde FROM votacao_candidatos WHERE votacao_candidatos.cargo = '\" + cargo + \"'\";\r\n\t\t... |
acbf32587796fe600a8604c370d7a849 | Sort groups for user based on groups with settings and groups with permission to edit for the highest priority. | [
{
"docid": "b7ed585e9a596b073c1f7c2f90975944",
"score": "0.6938962",
"text": "private List<UserGroup> sortUserGroupsForUser(List<UserGroup> userGroupList) {\n List<UserGroup> newUserGroupList = new ArrayList<>();\n\n // Remove all without settings and permissions. \n List<UserGroup>... | [
{
"docid": "835b5b4cad93b03688071ac6043cdf31",
"score": "0.69161654",
"text": "protected void sortGroups() {\n\t\tCollections.sort( _groups, _groupComparator );\n\t}",
"title": ""
},
{
"docid": "d3bc7c66a385e4b6296b167948cb7fea",
"score": "0.57078886",
"text": "private List<Solution>... |
b61d5fd53f4889ec617a7aac6372d44d | / access modifiers changed from: private | [
{
"docid": "e62fe8a0e1bf9858a62247e010394a48",
"score": "0.0",
"text": "public void setPath(String value) {\n value.getClass();\n this.path_ = value;\n }",
"title": ""
}
] | [
{
"docid": "ffe5fe3cec40acf4b0b07ea257dfa06a",
"score": "0.68335724",
"text": "private void apparence()\r\n\t\t{\r\n\r\n\t\t}",
"title": ""
},
{
"docid": "838a915c9ea69d56cc37df198cff9cb2",
"score": "0.66884047",
"text": "@Override\n\t\t\t\tpublic void pintar() {\n\t\t\t\t\t\n\t\t\t\... |
2157de21c309de7d3adc9d72d9e15dbf | Meant to be called after loading a map. Restores checkboxes and name from map. | [
{
"docid": "6944bb1a7f7a4f762648f6d9e23d243b",
"score": "0.6323734",
"text": "private void loadWorldParameters() {\n levelNameTextfield.setText(map.getMapName());\n socialDistancingCheckbox.setSelected(map.isSocialDistancing());\n betterMedicineCheckbox.setSelected(map.isBetterMedic... | [
{
"docid": "cad89622c163d3e099c528a0a8be6971",
"score": "0.5948867",
"text": "private void loadMapDown() {\n }",
"title": ""
},
{
"docid": "5bf078e6d6a5d27c54b5bb4e83e7c911",
"score": "0.5948705",
"text": "private void setWorldParameters() {\n map.setMapName(levelNameTextfi... |
76f405e87033eadd5f4b8cdb9201120e | ========================================================================= Metoda main ========================================================================= | [
{
"docid": "9e082106f5e4de74a8bdcd61bd6c26ea",
"score": "0.0",
"text": "public static void main(String[] args) {\n Diagram diagram = new Diagram(SKATLE, POVEZAVE, D_PAPIR, W_SKATLA);\n diagram.sproziRisanje(args);\n }",
"title": ""
}
] | [
{
"docid": "ef7391ab57d1bdd1056604d34f971ecd",
"score": "0.69852567",
"text": "private Main() {\r\n\t}",
"title": ""
},
{
"docid": "b8d6c5e12309d23812e345c93be48114",
"score": "0.69052196",
"text": "public Main() {\n\t\tSystem.out.println(\"Metodo Automatico\");\n\t}",
"title": "... |
76c59ad87e4279b2562dc577a1c1f0ee | Test case number: 6 /Coverage entropy=0.6931471805599453 | [
{
"docid": "03c648f05e75a09ecf0492710d1f4d5e",
"score": "0.0",
"text": "@Test(timeout = 4000)\n public void test006() throws Throwable {\n Contract contract0 = new Contract();\n String string0 = EWrapperMsgGenerator.updatePortfolio(contract0, 0, 268.2991227339088, (-1767.6927709924375), (-1... | [
{
"docid": "750e0b888368d1201125a579d4689914",
"score": "0.6810724",
"text": "@Test(timeout = 4000)\n public void test015() throws Throwable {\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\n Instances instances0 = textDirectoryLoader0.getDataSet();\n TestInsta... |
3fd1eddb3382250b00740f6437c9e366 | Used to unregister an EventListener in all events. | [
{
"docid": "d9bfd8694663257e2fd8bec21269b391",
"score": "0.8195423",
"text": "public final void unregisterEventListener(Object eventListener) {\n for (EventType eventType : events) {\n eventType.eventListenerContainer.remove(eventListener);\n }\n }",
"title": ""
}
] | [
{
"docid": "7637c8da3a3d008f86c0f7b6298abfc5",
"score": "0.80083483",
"text": "public void unregister() {\n removeListener(this);\n }",
"title": ""
},
{
"docid": "16a6162a6c2f033a15d4ec710ab56ee9",
"score": "0.8006291",
"text": "public void unregisterEvents()\r\n {\r\n ... |
6cebb4f2f5df511efb752c10f61ae570 | String fileType = f.getName().substring(f.getName().lastIndexOf(".") + 1,f.getName().length()).toLowerCase(); called by readZip() | [
{
"docid": "2aabbb57ab67bc0561a063a6231721f1",
"score": "0.0",
"text": "public void unzip(File f) throws Exception {\r\n String destDir = workplace + \"/temp/\";\r\n File tmp = new File(destDir);\r\n if(!tmp.exists())tmp.mkdir();\r\n byte b[] = new byte [1024];\r\n int... | [
{
"docid": "c5b7a4b6477f3cc3b37aea8d2d1c9b79",
"score": "0.76274467",
"text": "private String getTypeFromExtension()\n {\n String filename = getFileName();\n String ext = \"\";\n\n if (filename != null && filename.length() > 0)\n {\n int index = filename.lastInd... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "682768854e2427a3da9e99a274cd26c2",
"score": "0.0",
"text": "public void setNClob(int parameterIndex, Reader reader, long length)\n\t\t\tthrows SQLException {\n\t\t\n\t}",
"title": ""
}
] | [
{
"docid": "1acc57d42c31dee937ac33ea6f2a5b0b",
"score": "0.68399656",
"text": "@Override\r\n\tpublic void comer() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "0c69424878be03e50f19e2ca61ef640b",
"score": "0.68002176",
"text": "@Override\r\n\tpublic void leggi() {\n\t\t\r\n\t}",
"ti... |
71968c3089f08ac6ff97e63e71c8d075 | A list of snapshot names created in this schedule. string prefix = 3; | [
{
"docid": "b2c868ce7c2157e2a282a3d7bc8c5037",
"score": "0.0",
"text": "public Builder setPrefix(java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n\n prefix_ = value;\n onChanged();\n return this;\n }",
"title":... | [
{
"docid": "cb5947f0bcfb8e21207a8f6e098ea936",
"score": "0.6053179",
"text": "public String snapshotName() {\n return String.format(\"snapshot %s\", Snapshots.filenameFromSnapshotId(snapshotId()));\n }",
"title": ""
},
{
"docid": "86295b70d19fe773daac68fe99df1883",
"score": "0.... |
8e92c3f9ec82f4e8e21ca8168c30c650 | Specifies the vertex attributes. | [
{
"docid": "cc6a6c40e70442b0fa559d925d7a2542",
"score": "0.8042779",
"text": "private void specifyVertexAttributes() {\n /* Specify Vertex Pointer */\n int posAttrib = program.getAttributeLocation(\"position\");\n program.enableVertexAttribute(posAttrib);\n program.pointVerte... | [
{
"docid": "8a4345e51214dfc7970ba71bd0da3381",
"score": "0.7945169",
"text": "private static void specifyVertexAttributes() {\n\t\tint posAttrib = program.getAttributeLocation(\"position\");\n\t\tprogram.enableVertexAttribute(posAttrib);\n\t\tprogram.pointVertexAttribute(posAttrib, 2, 11 * Float.BYTES, ... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "4a8e215b9ad8e7aa0e5540929b014055",
"score": "0.0",
"text": "public static void main(String[] args) {\n\t\tHero.battlewin();\n\t\tADhero.battlewin();\n\t}",
"title": ""
}
] | [
{
"docid": "b7c706d331e2b507ec0ff8404ad87dc7",
"score": "0.69742316",
"text": "@Override\r\n\t\t\tpublic void crispel() {\n\t\t\t\t\r\n\t\t\t}",
"title": ""
},
{
"docid": "76b3966c8e3f64884c4127d1a3df09a8",
"score": "0.68059677",
"text": "@Override\r\n\t\t\tpublic void maruti() {\n\t... |
9ee5288f6b791614f023fb34b0cee461 | Returns the signed distance of a given point p to the given plane (startend) The distance returned is negative when its on the right side of the plane. | [
{
"docid": "d8d594bdec966928a8f8292746b42777",
"score": "0.832462",
"text": "double planeSignedDistance(Vector start, Vector end, Vector p) {\r\n\t\tdouble dx = end.x - start.x;\r\n\t\tdouble dy = end.y - start.y;\r\n\t\tdouble length = Math.sqrt(dx * dx + dy * dy);\r\n\t\treturn (dy * (start.x - p.x) -... | [
{
"docid": "2feaa49261752706746e667b18cb50d9",
"score": "0.6714498",
"text": "public double getSignedDistance(Pnt2d p) {\n\t\tdouble dx = p.getX() - this.xc;\n\t\tdouble dy = p.getY() - this.yc;\n\t\tdouble rp = Math.hypot(dx, dy);\n\t\treturn rp - this.r;\n\t}",
"title": ""
},
{
"docid": "4... |
a5a84bad175ebfafe96f6ec94792f251 | Creates new form Accused_phone | [
{
"docid": "a460a20e6c996127637f59a12e7c1347",
"score": "0.0",
"text": "public Accused_phone() {\n initComponents();\n String user = \"root\";\n String password = \"12345\";\n String url = \"jdbc:mysql://localhost/mydb?user=\"+user+\"&password=\"+password;\n \n \n tr... | [
{
"docid": "5735dbee7ee0df3612fa1273c23c7b4f",
"score": "0.63536316",
"text": "PhoneNumber createPhoneNumber();",
"title": ""
},
{
"docid": "563e0ba5b3b44846baf0f1eaded4ae1b",
"score": "0.62721336",
"text": "public PharmaCoPhone() {\n\t}",
"title": ""
},
{
"docid": "6d712... |
03900c50acc139952c1983823549bd0d | Creates Bollinger Bands indicator on the scroller. | [
{
"docid": "37313bf4b95eeb9b1f954cf418b743e8",
"score": "0.50389475",
"text": "public BBands bbands(TableMapping mapping4, Number period3, Number deviation, StockSeriesType upperSeriesType, StockSeriesType lowerSeriesType, StockSeriesType middleSeriesType) {\n if (jsBase == null) {\n t... | [
{
"docid": "88b160ce718f540873091964e78ca07d",
"score": "0.5772311",
"text": "private void createBlotter() {\n\t\tGridLayout gridLayout2 = new GridLayout();\n\t\tgridLayout2.marginHeight = 15;\n\t\tgridLayout2.marginWidth = 15;\n\t\tGridData gridData1 = new org.eclipse.swt.layout.GridData();\n\t\tgridDa... |
485c34ddf44599785d8cf6cbbe99e600 | getter for the VisualizationViewer | [
{
"docid": "3ddaec36c87baca663c23faeaf375b8b",
"score": "0.8006338",
"text": "public VisualizationViewer<Vertex, Edge> getVisualizationViewer() {\n\t\treturn mVViewerList.get(0);\n\t}",
"title": ""
}
] | [
{
"docid": "d0aef16ea06a0d6479738e074412d618",
"score": "0.77002317",
"text": "public Visualization getVisualization() {\n\n return this.visualization;\n }",
"title": ""
},
{
"docid": "0af1701719a93ed80d6a8044bd0d9137",
"score": "0.75209874",
"text": "protected GraphicalVie... |
59b038881e59c8f93a954017e77af9fd | count number of record in News table | [
{
"docid": "2aa51f2596963bd58a63b3cd0a00d506",
"score": "0.69857603",
"text": "public int countDB() throws Exception {\n String query = \"select COUNT(*) as numberrecord from News where delete_Status = 0\";\n int numberofrecord = 0;\n DBContext dbManager = new DBContext();\n ... | [
{
"docid": "7f3f5f9ea64903e17a5d7915cac5f87f",
"score": "0.72524565",
"text": "public int countArticle(){\n\n DatabaseHelper databaseHelper = DatabaseHelper.getInstance(this.mExecutionContext);\n SQLiteDatabase sqLiteDatabase = databaseHelper.getReadableDatabase();\n\n Cursor Count... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "372eeaea3575bbaf0f3a17b791bdd575",
"score": "0.0",
"text": "@Override\n public void onResume() {\n super.onResume();\n LogUtil.d(\"MainActivity\", \"RecordFragment onResume \");\n getActivity().registerReceiver(receiver, new IntentFilter(ConnectivityManager.CONNECTIVI... | [
{
"docid": "ef1b6c3f597a66c59960d73eadee6f25",
"score": "0.6904447",
"text": "private void apparence()\n\t\t{\n\n\t\t}",
"title": ""
},
{
"docid": "4862518dedb9e169c3cc620e5ebe04c5",
"score": "0.6696056",
"text": "@Override\r\n\tpublic void atura() {\n\t\t\r\n\t}",
"title": ""
... |
11896c0afdd3c08eb4877ce394e11466 | Set the sub category type ID of this record, as decoded from the third chunk in the PLOG record | [
{
"docid": "aabc3bd2b71312f7a38fc894e8d62897",
"score": "0.60565436",
"text": "public void setSubTypeId (int subTypeId) {\n this.subTypeId = subTypeId;\n }",
"title": ""
}
] | [
{
"docid": "a76d7d1cb24e803c557874e4e559ad0b",
"score": "0.62003475",
"text": "void setSubID(java.lang.String subID);",
"title": ""
},
{
"docid": "4a739396f54ea9afdc3200faf9d4d148",
"score": "0.6127473",
"text": "public void setSubType(String subType) {\n this.subType = subTyp... |
f04e52d18da717afab16f29790a6f485 | This method was generated by MyBatis Generator. This method corresponds to the database table t_ctr_lucky_draw_history | [
{
"docid": "352e89f29a02a511286726b7864056f3",
"score": "0.0",
"text": "protected Criteria createCriteriaInternal() {\n Criteria criteria = new Criteria();\n return criteria;\n }",
"title": ""
}
] | [
{
"docid": "176ad74f7ad3e0684d140d7edca812d3",
"score": "0.54868495",
"text": "public ResultSet getDataHistory()\r\n\t{\r\n\t\tString SQL = \"SELECT SUCHWORTE FROM HISTORY\";\r\n\t\t\t\t\r\n\t\treturn DBConnection.executeQuery(SQL);\r\n\t}",
"title": ""
},
{
"docid": "f69f20598a65bc2ec9e16bc... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "1bcfc34057c447ea7afb5e87311f441f",
"score": "0.0",
"text": "@Override\r\n\tpublic String toString() {\n\t\treturn null;\r\n\t}",
"title": ""
}
] | [
{
"docid": "63a51b9825ac81396e1d7ad0b9f3ed82",
"score": "0.6866318",
"text": "@Override\n\tpublic void 군무() {\n\t\t\n\t}",
"title": ""
},
{
"docid": "15ae679aae74424c73fde647cf4332f6",
"score": "0.68461496",
"text": "@Override\r\n\t\t\tpublic void hissetmek() {\n\r\n\t\t\t}",
"ti... |
e7f7c8033316dc5d572d4dab3684ed17 | Hiding the controller constructor. | [
{
"docid": "1b979f093c5f984b706a8c88db545d2b",
"score": "0.83431166",
"text": "private Controller() { }",
"title": ""
}
] | [
{
"docid": "2be7b62818e66e333ab06153f5473863",
"score": "0.85392135",
"text": "private Controller(){\n //nothing to do\n\t}",
"title": ""
},
{
"docid": "31795f6764e88a6eaefb8b6d4185be41",
"score": "0.83212656",
"text": "private Controller() {\r\n }",
"title": ""
},
... |
3cc690af1158506d48bd8fd69e11a799 | Reload configuration from file on disk. | [
{
"docid": "a383f28081bf1156cfe5003f2fa7e455",
"score": "0.61342156",
"text": "public void reload() {\n if(file.exists()) {\n try {\n object = (JsonObject) parser.parse(new FileReader(file));\n } catch(Exception e) {\n e.printStackTrace();\n ... | [
{
"docid": "f99cdb58f82a4fbb5c80738647c0f2b7",
"score": "0.7919165",
"text": "public void reload() {\n if (this.configFile == null) {\n this.configFile = new File(this.plugin.getDataFolder(), this.name);\n }\n\n this.config = YamlConfiguration.loadConfiguration(this.confi... |
609f55004a256e1d7c74cc18e6e8a891 | Asserts that the closeServer does nothing because the server is already closed. | [
{
"docid": "d00ca14bc0fd241d4e348851cf84ec3d",
"score": "0.7961429",
"text": "@Test\n\tpublic void testCloseClosedServer() throws IOException {\n\t\twrapper.closeServer();\n\n\t\tverifyStartsAndCloses(0, 0);\n\t}",
"title": ""
}
] | [
{
"docid": "47537d1e09928b86665a69afa7686e44",
"score": "0.70878476",
"text": "@Test\n\tpublic void testStartCloseServer() throws IOException {\n\t\twrapper.startServer();\n\t\twrapper.closeServer();\n\n\t\tverifyStartsAndCloses(1, 1);\n\t}",
"title": ""
},
{
"docid": "34a4b47c7e9f373c0dc7c8... |
727007db673abf5a08eb80cdafcb62af | An example of a method replace this comment with your own | [
{
"docid": "b387df3665e57bac67ff2623e5f92bdc",
"score": "0.0",
"text": "public int getHijos(){\n return super.getHijos();\n \n }",
"title": ""
}
] | [
{
"docid": "41e50fb9a0b417818374927eb02c67f1",
"score": "0.67338276",
"text": "protected void mo5608a() {\n }",
"title": ""
},
{
"docid": "4e49f5db36ca664153e54380025b85d4",
"score": "0.6670087",
"text": "protected boolean method_21825() {\n }",
"title": ""
},
{
"doci... |
b9113e16fe5ddc7822e464a7d9c70ed1 | Returns a list of all StatisticsConfig files. | [
{
"docid": "9d73e2d158c325b0e73ef5a30ed5b60c",
"score": "0.7020704",
"text": "public List<StatisticsConfig> getConfigurations() {\n return configurations;\n }",
"title": ""
}
] | [
{
"docid": "54c351bdfe6463aa5d8bcb6d2f7a0e39",
"score": "0.67856175",
"text": "List<String> getConfigFilePaths();",
"title": ""
},
{
"docid": "7427ef06a2f11e7eb989b3d884d6cc9c",
"score": "0.60742265",
"text": "public List<ProgressConfigurationType> getAllConfigurations();",
"titl... |
11dee947505c8f67b0f3ffa22b1e4334 | Converts the methods of the inventory class into a string | [
{
"docid": "65580acd4607933a226af01eb9141241",
"score": "0.0",
"text": "@Override\r\n public String toString(){\r\n return String.format(\"Item ID: %7s Item Name:%6s QOH:%3d Price: $%4.2f\",id ,name,qoh ,sellPrice);\r\n}",
"title": ""
}
] | [
{
"docid": "dbb77bdcd501d53bf70d4fab83c9fe25",
"score": "0.65380746",
"text": "public String inventoryToString(){\n String inventoryString = \"\";\n for(int i = 0; i < 2; i++){\n inventoryString += inventory[i].getName() + \" \" + inventory[i].getPrice() + \" \" + inventory[i].g... |
4b3b689ae96ac95bdc713e06ecfb6d8a | create a method to draw a line across the middle row | [
{
"docid": "29408e5d38c287fe83d516f54424190a",
"score": "0.7287575",
"text": "public void middleRowLine(int x1, int y1, int x2, int y2){\n\t\t// draw line\n\t\tcanvas.strokeWeight(2);\n\t\tcanvas.line(x1,y1,x2,y2);\n\t}",
"title": ""
}
] | [
{
"docid": "f612b0a3e09414e12da3d1e99e3dd9a4",
"score": "0.7175931",
"text": "public void drawMidLine(){\r\n\t\t\r\n\t\tint width = 5;\r\n\t\tint height = 30;\r\n\t\t\r\n\t\tchangeColor(white);\r\n\t\tfor(int y = 0; y< 500; y+=40){\r\n\t\t\tdrawSolidRectangle(297.5,y,width,height);\r\n\t\t}\r\n\t\t\r\n\... |
05c03c07e1b30648c919b931d221df74 | $ANTLR end synpred129_InternalRoute $ANTLR start synpred133_InternalRoute | [
{
"docid": "910ef48e404c2c345f3354eceb80b154",
"score": "0.5546737",
"text": "public final void synpred133_InternalRoute_fragment() throws RecognitionException { \n // ../org.xtext.httprouting.ui/src-gen/org/xtext/httprouting/ui/contentassist/antlr/internal/InternalRoute.g:13970:2: ( rule__XRet... | [
{
"docid": "47055544a84594bb46f9f88e1a1d4f7a",
"score": "0.7182502",
"text": "public final boolean synpred27_InternalRoute() {\n state.backtracking++;\n int start = input.mark();\n try {\n synpred27_InternalRoute_fragment(); // can never throw exception\n } catch (... |
dd5e0fb929f8b0ad6af91af179db4cb7 | Get current vgtid position of a specific keyspace/shard, or of all shards from a specific keyspace | [
{
"docid": "faa4a4b4eb3ee5be9a7bb10265904c53",
"score": "0.7074183",
"text": "protected Binlogdata.VGtid getPosition() {\n Binlogdata.VGtid.Builder builder = Binlogdata.VGtid.newBuilder();\n if (shards.isEmpty()) {\n Binlogdata.ShardGtid shardGtid = Binlogdata.ShardGtid.newBuild... | [
{
"docid": "15187a19eccadaacb57b91b3816e8a10",
"score": "0.6053965",
"text": "int getShard();",
"title": ""
},
{
"docid": "db20ea2c94e4650d5841d4148f5f4138",
"score": "0.5688444",
"text": "public int getShard() {\n return shard_;\n }",
"title": ""
},
{
"do... |
3c67c5187e0e42300fee6b8d8b31b0f1 | Convert text to voice | [
{
"docid": "8f33175247f7da781b61b45f262b2322",
"score": "0.62692606",
"text": "public static void oralOutput(String text)\n\t{\n\t\tSystem.setProperty(\"mbrola.base\",\"E:\\\\Automation\\\\mbrola\");\n\t\tVoiceManager vm=VoiceManager.getInstance();\n\t\tVoice v=vm.getVoice(\"mbrola_us1\"); //or kevin16\... | [
{
"docid": "506a54168ea5ae61f42a17fe22407eca",
"score": "0.7178406",
"text": "private void ConvertTextToSpeech(String voice1) {\n text=voice1;\n //text = et.getText().toString();\n if (text == null || \"\".equals(text)) {\n tts.speak(text, TextToSpeech.QUEUE_FLUSH, null);... |
6470a46cb8daf30cc9ea06d2f442c03f | / access modifiers changed from: packageprivate | [
{
"docid": "baac7a0599ec51156b1de9fbd447c866",
"score": "0.0",
"text": "public boolean isDone() {\n return this.mCoreTask.getStatus() == AsyncTask.Status.FINISHED;\n }",
"title": ""
}
] | [
{
"docid": "f5fd4f1b89ecbb54b8b64a1b9e40552c",
"score": "0.6724544",
"text": "protected void mo7431b() {\n }",
"title": ""
},
{
"docid": "53e341f0a65f5f2314974705ff4b401c",
"score": "0.65332055",
"text": "private Ab(){\n\t\t\n\t}",
"title": ""
},
{
"docid": "6f28b85882... |
63499c24759d65c0fdf25144b6d4e58a | the method which have created it | [
{
"docid": "a738cca5d46d15d5b2c10df4e95ccb55",
"score": "0.0",
"text": "public String getType() {\r\n\t\treturn type;\r\n\t}",
"title": ""
}
] | [
{
"docid": "18593091750e42f268fe6eeac3c48f57",
"score": "0.64968127",
"text": "private static final void function()\n\t\t\t\t{\n\t\t\t\t\t\n\t\t\t\t}",
"title": ""
},
{
"docid": "9527a325e4b9b57c013af577caa656fc",
"score": "0.6488901",
"text": "public void method_6044() {}",
"tit... |
ae06f691b7d5aca966cab76f24324203 | User cancelled the dialog | [
{
"docid": "b3931c8128d56e64b76dc30717f86930",
"score": "0.0",
"text": "public void onClick(DialogInterface dialog, int id) {\n }",
"title": ""
}
] | [
{
"docid": "475bdf181f7743f1bce1187dc42e165c",
"score": "0.8829482",
"text": "public void cancel() {\n\t\tcancelDialog();\r\n\t}",
"title": ""
},
{
"docid": "fe8c0cd0172f4e68d7c794b41846b262",
"score": "0.8409997",
"text": "public void dialogCancelled();",
"title": ""
},
{
... |
bf22d144421348048e1f889367a3c223 | TODO iFlags is ignored right now | [
{
"docid": "e4134bece53c1adcf91eee5a5f90cb00",
"score": "0.0",
"text": "public String getAttribute(String name, int iFlags) {\n\t\treturn getDElement().getAttribute(name);\r\n\t}",
"title": ""
}
] | [
{
"docid": "ddcaa37169865a927c1fd46f74d4f25e",
"score": "0.67022645",
"text": "int getFlags();",
"title": ""
},
{
"docid": "ddcaa37169865a927c1fd46f74d4f25e",
"score": "0.67022645",
"text": "int getFlags();",
"title": ""
},
{
"docid": "7a1eb1aabc107e00be69c6ba743de0c1",
... |
38b7399a4979c95ab4bc3e2eff23270d | // Hack Control. // Set the hack to be displayed in this view. This can be called multiple times to change hacks. | [
{
"docid": "db208d7590616ca590d79c15adb52aef",
"score": "0.587262",
"text": "void setHack(EyeCandy hack) {\n eyeCandy = hack;\n \n if (screenWidth > 0 && screenHeight > 0)\n eyeCandy.setConfiguration(screenWidth, screenHeight, screenConfig);\n }",
"title": ""
... | [
{
"docid": "a78904ac463f02f12a74ed7d71d1b310",
"score": "0.52031714",
"text": "void register(final SimpleHack<?> hack) {\n\t\tthis.hacks.add(hack);\n\t}",
"title": ""
},
{
"docid": "035d15c8ca905f8d2d5dcf9ceee96a66",
"score": "0.48518395",
"text": "public void setControlView() {\n\t\... |
d49938f92c164254c641264caf7d99b5 | Reads the data from the specified fileName in the constructor note: calling trim on returned string is necessary to remove any unused bits which can corrupt the link used in the http request | [
{
"docid": "e2524700a71b18bc229240e29a750809",
"score": "0.59959",
"text": "public String readFile() throws IOException {\n\t\tbyte[] bytes = new byte[50];\n\t\tFileInputStream fileInputStream = new FileInputStream(new File(this.path + \"/\"\n\t\t\t\t+ this.fileName));\n\t\tfileInputStream.read(bytes);\... | [
{
"docid": "15dd56f3970cbfbfe0aac21de4369a22",
"score": "0.66987354",
"text": "private static String read(String fileName) throws Exception{\n FileInputStream f = new FileInputStream(fileName);\n BufferedReader r = new BufferedReader (new InputStreamReader(f));\n StringBuilder sb = new StringB... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "74e153fae3a6798ea829f4b4b0843803",
"score": "0.0",
"text": "@Override\r\n\tpublic List<Employee> saveUpdatedEmployee(Employee employee) {\n\t\tList<Employee> empDetailsupdated=employeeDao.getupdatedEmployeeDetails(employee);\r\n\t\treturn empDetailsupdated;\r\n\r\n\t}",
"title": ""
}
] | [
{
"docid": "9208773f8d675a45ef2786d0cb668514",
"score": "0.654538",
"text": "@Override\n\tpublic void addiion() {\n\t\t\n\t}",
"title": ""
},
{
"docid": "80d20df1cc75d8fa96c12c49a757fc43",
"score": "0.65323734",
"text": "@Override\n\tprotected void getExras() {\n\t\t\n\t}",
"titl... |
f0ccc2731c5b8d9f8ef4691a05ba19ff | Test case number: 48 /Coverage entropy=1.467796044911352 | [
{
"docid": "483f7f08ff9920a05363884b6929f863",
"score": "0.0",
"text": "@Test(timeout = 4000)\n public void test048() throws Throwable {\n StringReader stringReader0 = new StringReader(\"e{JqE.=qvh`n>'4A*xK\");\n JavaCharStream javaCharStream0 = new JavaCharStream(stringReader0);\n Jav... | [
{
"docid": "750e0b888368d1201125a579d4689914",
"score": "0.6677907",
"text": "@Test(timeout = 4000)\n public void test015() throws Throwable {\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\n Instances instances0 = textDirectoryLoader0.getDataSet();\n TestInsta... |
4a47238e99e549ea12973b236a95081f | Get the display name from the address. | [
{
"docid": "26e37e676ec984c2ca1e13f62ccbcc48",
"score": "0.8157737",
"text": "public String getDisplayName() {\n return address.getDisplayName();\n }",
"title": ""
}
] | [
{
"docid": "48aeae88e1bbb26789f4eed7fd4e0e65",
"score": "0.7730581",
"text": "public String getDisplayName()\n {\n String displayName = this.displayName;\n\n if ((displayName == null) || (displayName.length() < 1)) {\n String address = getAddress();\n\n if ((addres... |
701c1bc3f832c26c944678288aef43e2 | This is a setter method to set the value of the canBeEnpassanted variable. | [
{
"docid": "b5039229b977a226848999cfcef6079b",
"score": "0.78774726",
"text": "public void setCanBeEnpassanted(boolean b) {\n\t\tthis.canBeEnpassanted = b;\n\t}",
"title": ""
}
] | [
{
"docid": "59c545168f9ed9da73b753f22a38ba04",
"score": "0.738476",
"text": "public void setWillEnpassant (boolean b) {\n\t\tthis.willEnpassant = b;\n\t}",
"title": ""
},
{
"docid": "7576b18b415f8fc21ed6fb83cf725b27",
"score": "0.6937637",
"text": "public boolean getCanBeEnpassanted(... |
49d4fa244db9afdca1eb33ecf35684ea | repeated .ComboListItemInfo cbo_list_32 = 1; | [
{
"docid": "62688d3f8772faae8a50dc7218891c85",
"score": "0.0",
"text": "public int getCboList32Count() {\n return cboList32_.size();\n }",
"title": ""
}
] | [
{
"docid": "8d9220e447b90108badf41f7d8f45f98",
"score": "0.733025",
"text": "nta.med.service.ihis.proto.CommonModelProto.ComboListItemInfo getCboList34(int index);",
"title": ""
},
{
"docid": "588cd427f2f796ca759e91fe8646ded3",
"score": "0.72699744",
"text": "nta.med.service.ihis.pro... |
7f6ce1169fa2ea40bc68a75db6906cec | Method used to find a UUID from the CUCM In addition it stores all the UUID found to avoid to Interrogate the CUCM twice | [
{
"docid": "dda6f97a5eeebfc058c4b34547af468a",
"score": "0.5564303",
"text": "public static com.cisco.axl.api._10.XFkType getUUIDV105(itemType type, String itemName) throws Exception\r\n\t\t{\r\n\t\tVariables.getLogger().debug(\"Get UUID from CUCM : \"+type+\" \"+itemName);\r\n\t\t\r\n\t\tif((itemName =... | [
{
"docid": "d518011ed5cdefc21a3f14df8d39e814",
"score": "0.6472044",
"text": "public void getUUID(){\n BluetoothDevice bluetoothDevice = bluetoothAdapter.getRemoteDevice(deviceMAC);\n\n // Finding the correct UUID for the bluetooth device\n ParcelUuid[] parcelUuid = bluetoothDevice.... |
214154a7b48e98bc8a1e34c17710d6d7 | TODO I think this shouldn't exist and task names should be returned TODO from the uri call, mby I'm wrong. | [
{
"docid": "85d668124f6d126ab1804bbd6404b571",
"score": "0.5737524",
"text": "private static String findTaskNameFromLink(List<String> taskNameList, String taskLink) {\n for (String name : taskNameList) {\n if (taskLink.contains(name)) {\n name = Character.toUpperCase(nam... | [
{
"docid": "c9ed1e805dafc6ac70b1dfa09c285c6a",
"score": "0.63410914",
"text": "@Path(\"{task}\")\npublic TaskResource getTask(@PathParam(\"task\") String id) {\nreturn new TaskResource(uriInfo, request, id);\n}",
"title": ""
},
{
"docid": "49a40826bbcc34484b40002f7d9bd635",
"score": "0.6... |
432169c7f1abff574ebc1296cb67560d | This function creates a new JunitJSON object that will be converted to a JSON file in main(). | [
{
"docid": "0a8214a6b562b9458db845732e77aabd",
"score": "0.7167791",
"text": "private static JunitJSON createJunitJSON(ArrayList<Testsuite> testsuiteList) {\r\n JunitJSON junitJSON = new JunitJSON();\r\n ArrayList<FeedbackItems> feedbackItemsList = new ArrayList<>();\r\n ArrayList<O... | [
{
"docid": "f222faace5bedb2f7af5175364b1ac99",
"score": "0.65166223",
"text": "@Test\n public void loadJson() {\n }",
"title": ""
},
{
"docid": "3c1cd1293c0358031553a9f9b8a6fc0a",
"score": "0.642235",
"text": "@Test\n void importFromJSON() {\n }",
"title": ""
},
{... |
aff1144c73a2659dad2700165496a886 | Sets the service provider code. | [
{
"docid": "88336271e266709fea323cb8138afa4b",
"score": "0.8486612",
"text": "public void setServiceProviderCode(String serviceProviderCode)\n\t{\n\t\tthis.serviceProviderCode = serviceProviderCode;\n\t}",
"title": ""
}
] | [
{
"docid": "243368542ae895c3fd104f8b30cd261f",
"score": "0.67581874",
"text": "public void setServiceProvider(Object serviceProvider) {\r\n \t\tthis.serviceProvider = serviceProvider;\r\n \t}",
"title": ""
},
{
"docid": "3a2c701bef7c98aea19414e2f6af22d8",
"score": "0.6724027",
"text"... |
1b0db9a86fbc30535f4932272842fb48 | / renamed from: a | [
{
"docid": "9b52ee5dc47a04810c1629b9b4c947a5",
"score": "0.0",
"text": "public boolean mo11124a(Object obj) throws IOException, IllegalAccessException {\n boolean z = false;\n if (!this.f6188b) {\n return false;\n }\n if (this.f6179d.get(obj) !=... | [
{
"docid": "8c202bef975a1ce9b229619975cdce2f",
"score": "0.6234015",
"text": "public interface aacac {\n /* renamed from: a */\n void mo29386a(String str);\n}",
"title": ""
},
{
"docid": "d9afe0b047b7674b49c3d401ac2542aa",
"score": "0.62241286",
"text": "public interface C4823a... |
4eb2b0a20bebb8a707e03966dde96ef7 | pre: input the path of directory post: output the files in this directory in assending natural order. | [
{
"docid": "043538d1e3056853700e7ad4df9ff392",
"score": "0.5510546",
"text": "public static PriorityQueue<String> getAllFiles(String dirPath) {\r\n\t\tPriorityQueue<String> allFiles = new PriorityQueue<String>();\r\n\t\tString file;\r\n\t\tFile folder = new File(dirPath);\r\n\t\tFile[] listOfFiles = fol... | [
{
"docid": "a9c80b58263db654b3be0a3004154c2b",
"score": "0.62540984",
"text": "public static void listInImperativeSytle(){\r\n\t\tList<File> files = new ArrayList<>();\r\n\r\n\t\tFile[] filesInCurrentDir = new File(\".\").listFiles();\r\n\r\n\t\tfor (File file : filesInCurrentDir) {\r\n\t\t\tFile[] file... |
73cb728311b8e1568ff845c915ecfef7 | remove an entity by id | [
{
"docid": "6c95dd2560e20b5d5538f004bc867c4f",
"score": "0.7491765",
"text": "@WebMethod(operationName = \"removeById\")\n\tvoid removeById(@WebParam(name = \"id\") Id id) throws BOException;",
"title": ""
}
] | [
{
"docid": "6b102aea62b87774e30f5facf3d791a5",
"score": "0.82982856",
"text": "public void remove(int id){\n EstudianteEntity estudianteEliminar = entityManager.find(EstudianteEntity.class, id);\n entityManager.remove(estudianteEliminar);\n }",
"title": ""
},
{
"docid": "... |
f1ba9fbef29a030b11e516fcf4f010ad | Do not go to the charging station if more than 90% of the battery still remains | [
{
"docid": "2b54d036bd2e4214702ee68c5c6af7d1",
"score": "0.0",
"text": "private double determineChargeBenefits(ChargerReservation chargerReservation, long arrivalAtChargingStation, double batteryLevel) {\n if (batteryLevel / battery.getMaxCapacity() > 0.9) {\n return 0;\n }\n\n ... | [
{
"docid": "f37147665b0ae0d549f62f6ff649c8d4",
"score": "0.72918147",
"text": "@Override\n\tpublic boolean needsToCharge() {\n\t\treturn batteryCharge <= 10;\n\t}",
"title": ""
},
{
"docid": "16c5216c218006e3ebef1cb78490fa3d",
"score": "0.6881617",
"text": "public void charge() {\n ... |
b646ac850df59cb2385d608eb5ca661c | The data type of the parameter. For example, integer: | [
{
"docid": "fb2682a84fd96fea85183ad4880c9d6e",
"score": "0.0",
"text": "public Parameter withDataType(String dataType) {\n setDataType(dataType);\n return this;\n }",
"title": ""
}
] | [
{
"docid": "93d39d2c0adee4ac046eeaed25d4f132",
"score": "0.7332625",
"text": "public CType get_data_type();",
"title": ""
},
{
"docid": "5487387d0bce7c1c9ab5efd738fd3f40",
"score": "0.72929746",
"text": "int getDataTypeValue();",
"title": ""
},
{
"docid": "5487387d0bce7c1... |
3579596403ef62d4b43c3b0e963bc47d | Body that's either text/plain or application/json. | [
{
"docid": "6148a3653665450eb412aeef9e9701ae",
"score": "0.5094637",
"text": "@ServiceMethod(returns = ReturnType.SINGLE)\n public String putTextAndJsonBody(ContentType3 contentType, String message) {\n return putTextAndJsonBodyWithResponse(contentType, message, Context.NONE).getValue();\n ... | [
{
"docid": "ea6bd943f5515093336ada458d522300",
"score": "0.6791353",
"text": "public RequestBody convertPlainString(String data){\n RequestBody plainString = RequestBody.create(MediaType.parse(\"text/plain\"), data);\n return plainString;\n }",
"title": ""
},
{
"docid": "d1... |
15a469773f1fbf02b390d8d1ac79dd78 | Protected Sets a copy of a properties map to this builder instance. | [
{
"docid": "2aefb8c857ff0224f30f67baa8e975bc",
"score": "0.70115864",
"text": "protected void setProperties(Map properties)\r\n {\r\n this.properties = new HashMap(properties);\r\n }",
"title": ""
}
] | [
{
"docid": "295008511bff2fb6ad0e12b4acac47dd",
"score": "0.73482525",
"text": "public void setProperties(Map newProperties);",
"title": ""
},
{
"docid": "1d74ad10b034fe79bf6dd7b4abb9a9cd",
"score": "0.70348865",
"text": "void setProperties(final Map<String, Object> properties);",
... |
05c75da10cfcde9680d1dc774cba591b | Crea un Resultado y lo persiste. | [
{
"docid": "60c5744730114a0df83a6e57f044ddac",
"score": "0.63277274",
"text": "public Resultado CrearResultado(int Resultado, Estudiante EstudianteResultado, Evaluacion EvaluacionResultado){\r\n Resultado resultado = new Resultado(Resultado, EstudianteResultado, EvaluacionResultado);\r\n i... | [
{
"docid": "b5816e3b087a403a751539c23a37dd6f",
"score": "0.6319931",
"text": "@Override\n protected ContaSerie preencheObjeto(ResultSet resultado) {\n ContaSerie tmp = new ContaSerie();\n SerieDAO daoSerie = new SerieDAO();\n Serie serie = new Serie();\n ... |
81d26450dd96ab5724314b7890323e23 | 0 no repeat 1 repeat list 2 repeat one | [
{
"docid": "51dafc222a2d5138127d6b101db0e9d4",
"score": "0.0",
"text": "@Override\n public void onCompletion(MediaPlayer mediaPlayer) {\n\n if (new StorageUtil(getApplicationContext()).getRepeatStatus() == 0) {\n skipToNextNoRepeatList();\n updateMetaData();\n ... | [
{
"docid": "0802462bd782c9e8800470277f990f62",
"score": "0.619951",
"text": "public static void printNonRepeat() {\n\t\tSet<Integer> repeating = new LinkedHashSet<Integer>();\n\t\tList<Integer> nonRepeating = new ArrayList<Integer>();\n\t\tScanner s = new Scanner(System.in);\n\t\tint i= 0;\n\t\twhile(i<... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "719da9d51769c7ddcc92c04c05e44646",
"score": "0.0",
"text": "@Override\n\t\t\tpublic void mousePressed(MouseEvent e) {\n\t\t\t\t\n\t\t\t}",
"title": ""
}
] | [
{
"docid": "63a51b9825ac81396e1d7ad0b9f3ed82",
"score": "0.68664503",
"text": "@Override\n\tpublic void 군무() {\n\t\t\n\t}",
"title": ""
},
{
"docid": "15ae679aae74424c73fde647cf4332f6",
"score": "0.6846375",
"text": "@Override\r\n\t\t\tpublic void hissetmek() {\n\r\n\t\t\t}",
"ti... |
a48376bd6efe8e358bf5aef74ff316c3 | Created by Administrator on 2017/3/29. | [
{
"docid": "c755803a96717072abd5fd34b294dfb1",
"score": "0.0",
"text": "@Service\npublic interface CSDNInformationService {\n\n void addCSDNInformation(InformationEntity entity);\n\n List<InformationEntity> getAllInformation();\n\n List<InformationEntity> getInformationList(int start,int count)... | [
{
"docid": "ef1b6c3f597a66c59960d73eadee6f25",
"score": "0.64958096",
"text": "private void apparence()\n\t\t{\n\n\t\t}",
"title": ""
},
{
"docid": "d07c1f5c9d405e36c1ebf9e7e586652e",
"score": "0.59903604",
"text": "private Solution() {\n /** Not using this function**/\n ... |
61202da982ff6b91e3f669797a52d4b9 | Method for determining the direction of light | [
{
"docid": "0f4fc75a2ec6810508d7c61bc0e6806f",
"score": "0.0",
"text": "@Override\n\tpublic Vector3 directionFrom(final Point3 point) {\n\t\tif (point == null) {\n\t\t\tthrow new IllegalArgumentException(\"Point is null!\");\n\t\t}\n\t\t// normale zwischen point und position\n\t\treturn position.sub(poi... | [
{
"docid": "1e82a1735a73a8f8bc5004fbb8545803",
"score": "0.7101804",
"text": "public double getDirection()\n {\n double a=direction;\n while(a>=360)a-=360;\n while(a<0)a+=360;\n return a;\n }",
"title": ""
},
{
"docid": "04109cae4d9e258622ef902d2ffb96bb",
... |
b0bf448326365b1afeb24601bd65bac1 | repeated int64 seatwork_id = 2; | [
{
"docid": "31508c374c28614651912e8a4f1ffd0a",
"score": "0.5354748",
"text": "public java.util.List<java.lang.Long>\n getSeatworkIdList() {\n return seatworkId_;\n }",
"title": ""
}
] | [
{
"docid": "c2b2a2fea4afb16dee5f1316635b3e50",
"score": "0.6879277",
"text": "long getSeatworkId();",
"title": ""
},
{
"docid": "c2b2a2fea4afb16dee5f1316635b3e50",
"score": "0.6879277",
"text": "long getSeatworkId();",
"title": ""
},
{
"docid": "52f5d4f74eadaa3006e236bf7a... |
ddbf013eac4f461240a7ceb66094eca5 | A method that changes the color of the background. Precondition: The code passed in should be a valid, 6digit hexadecimal color. | [
{
"docid": "a16cf0a5e28239073a18b970d4959afa",
"score": "0.8164868",
"text": "private void changeColor(String code){\n\t\t// if there is not a code passed into\n\t\t// the method, handle this by setting the\n\t\t// background to the default color.\n\t\tif (code.isEmpty()){\n\t\t\tlanding.setBackground(D... | [
{
"docid": "52bb7d6690c8aec28aa6996744b7ba76",
"score": "0.6899499",
"text": "@Override\n public void setBackgroundColour(int backgroundColor) {\n }",
"title": ""
},
{
"docid": "09e0d46ddc26fdecaa2501983f6fb415",
"score": "0.6885303",
"text": "public void background(int... |
aad23aa1e2be67b94dcb3f336ab4019e | Created by qqq34 on 2016/2/17. | [
{
"docid": "a61d0629b3dda02bd685d457cffc940d",
"score": "0.0",
"text": "@ActivityScope\n@Component(modules = FragmentSignUpModule.class,dependencies = AppComponent.class)\npublic interface FragmentSignUpComponent {\n FragmentSignUp inject(FragmentSignUp fragmentSignUp);\n}",
"title": ""
}
] | [
{
"docid": "0c69424878be03e50f19e2ca61ef640b",
"score": "0.6245046",
"text": "@Override\r\n\tpublic void leggi() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "1e34493fdecb11f6bbc24ef12eea2281",
"score": "0.60936445",
"text": "public void mo27791d() {\n }",
"title": ""
},
... |
7c23e821471ff95e7560c45a4f838dd6 | Time Complexity is O(n) | [
{
"docid": "7ad6e3e720fa1e4673e13f481a7b4550",
"score": "0.0",
"text": "public static String[] generateBinary(int number) {\n String[] result = new String[number];\n Queue<String> queue = new Queue<>(number + 1);\n queue.enqueue(\"1\"); // First enqueue \"1\"\n\n\n for (int ... | [
{
"docid": "1176a1ee790d0d48ec007728a8a05ccb",
"score": "0.6212996",
"text": "private static int f(int n) {\n\t\tint[] sum = new int [n];\n\t\tint index = 0;\n\t\tfor (int i = 2; i < n; i++) {\n\t\t\tif(check(i)){\n\t\t\t\tsum[index ++] = i;\n\t\t\t}\n\t\t}\n\t\tint count = 0;\n\t\t \n\t\tfor (int i = 0... |
7cec771a020637efa8e6bf5e1db3b97f | ATTENTION: This was autogenerated to implement the App Indexing API. See for more information. | [
{
"docid": "8bedb700b12878197a2e4a33fee1104b",
"score": "0.5707996",
"text": "public Action getIndexApiAction() {\r\n Thing object = new Thing.Builder()\r\n .setName(\"SearchResults Page\") // TODO(edao): Define a title for the content shown.\r\n // TODO(edao): Make sure this auto-gener... | [
{
"docid": "e129a2c569731f1da4d863d7eea27580",
"score": "0.6613478",
"text": "public long index();",
"title": ""
},
{
"docid": "c7b8b039d19b092c745012e9ddc5ccfb",
"score": "0.6507686",
"text": "public void setupIndex() {\n }",
"title": ""
},
{
"docid": "83ebc933621f267... |
7009e767f3c03c0d14a788906007eeb7 | Remove the workers created etc. | [
{
"docid": "bdb873c8e479b15d6e8abb2369317680",
"score": "0.0",
"text": "public void test99TearDownDatabase() throws Exception {\n \n // removeWorker(getSignerIdCMSSigner1());\n }",
"title": ""
}
] | [
{
"docid": "85f3b1d5029645862d3a7bd586a45377",
"score": "0.68154967",
"text": "protected void cleanUp() {\n \t\tfor (IPQueueControl queue : getQueueControls()) {\n \t\t\tremoveQueue(queue);\n \t\t}\n \t\tfor (IPMachineControl machine : getMachineControls()) {\n \t\t\tremoveMachine(machine);\n \t\t}\n \t... |
c37c6d6a3bc72173d9bf778a25656b20 | Super realistic simulation of a data request to HealthDoc. | [
{
"docid": "22a14a5b80b6c7ba1a8fbdbfa6c27055",
"score": "0.6364549",
"text": "private void simulatedDataRequest(DataRequest.RequestType rType){\n System.out.println(\"Sending request for \" + rType);\n System.out.println(\"Packaging with session info.\");\n System.out.println(\"Encrypting.\");\... | [
{
"docid": "4eefde33613b556059d89ea59ada6f4d",
"score": "0.622378",
"text": "@Override\n\tpublic void requestData() {\n\n\t}",
"title": ""
},
{
"docid": "332c048f627b392a4cfe80cc446784f5",
"score": "0.60916865",
"text": "@Override\n public void requestData() {\n dataInterac... |
14b58006248190b546b4e727e877b20e | This method was generated by MyBatis Generator. This method sets the value of the database column fc_ds_biz_order.pay_trade_no | [
{
"docid": "6cbfea9caa5d88a67d186315076c151a",
"score": "0.68735987",
"text": "public void setPayTradeNo(Long payTradeNo) {\n this.payTradeNo = payTradeNo;\n }",
"title": ""
}
] | [
{
"docid": "0e84766972e3ffdd4de3481309da6b42",
"score": "0.695186",
"text": "public void setTradeNo(String tradeNo) {\n this.tradeNo = tradeNo;\n }",
"title": ""
},
{
"docid": "fc5c0d45df3d0867b6123b6471a14f58",
"score": "0.6114053",
"text": "public Long getPayTradeNo() {\n... |
a22b04888a1253d54523624e57b3dbee | Passing some request headers | [
{
"docid": "ea418f85f3cd24c4bf84c82059b16187",
"score": "0.0",
"text": "@Override\n public Map<String, String> getHeaders() throws AuthFailureError {\n HashMap<String, String> headers = new HashMap<String, String>();\n headers.put(\"Content-Type\", \"application/... | [
{
"docid": "9e828d72b941007e71ff953bf168c781",
"score": "0.740781",
"text": "protected void setRequestHeaders(HttpGet request) {}",
"title": ""
},
{
"docid": "61947376e8ee6a776e8909ec66988e55",
"score": "0.7253353",
"text": "void processRequestHeader(ConfigRequirement require, String... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "086f250c80f598541c096a485790d992",
"score": "0.0",
"text": "@Override\r\n\t//Draws the bullet\r\n\tpublic void render(Graphics g) {\n\t\tg.setColor(Color.WHITE);\r\n\t\tg.fillRect((int) x, (int) y, 16, 16);\r\n\t}",
"title": ""
}
] | [
{
"docid": "f4bccec648e6eb25ae6f4d7165ffc5a1",
"score": "0.7037216",
"text": "@Override\n\t\t\tpublic void Goruntule() {\n\t\t\t\t\n\t\t\t}",
"title": ""
},
{
"docid": "27bc40cf2c5e26e0bf8b70807e0bcaed",
"score": "0.68683225",
"text": "@Override\r\n\tpublic void caminar() {\n\t\t\r\n... |
c54bfdc3409a1a7081ce51426b108f41 | Returns the extension of this entry. | [
{
"docid": "2ec582e3a85e7076e533261ce35e317e",
"score": "0.8089652",
"text": "public String getExtension()\r\n\t{\r\n\t\treturn this.extension;\r\n\t}",
"title": ""
}
] | [
{
"docid": "e2e205649a1675ce9995398f0b5bead1",
"score": "0.818649",
"text": "public String getExtension() {\n return getExtension();\n }",
"title": ""
},
{
"docid": "d78f38d1c439468698430e6b37aa465b",
"score": "0.8057085",
"text": "public String getExtension() {\n re... |
cef0b300fb5da13e50b8a1bc15b322ec | Displays the welcome message from Normal Mode to Deck Mode. | [
{
"docid": "68bab49266e5d38467a1dbb0a506c426",
"score": "0.641457",
"text": "public static void printDeckWelcome(int index, Deck deck) {\n printMessage(DECK_WELCOME_LINE + \"[\" + index + \"] \" + deck.getName());\n }",
"title": ""
}
] | [
{
"docid": "4c6321b01a7e4b980dcf251a739f3a94",
"score": "0.7756892",
"text": "public void welcome() {\n System.out.println(\"\\n---------------------------------------------------------------------\" +\n \"\\n\\tBienvenue sur le plateau de Donjon et Dragons !!!\" +\n ... |
08ed2ed19b07bfd60321cbe0f0d550ec | Trying to cancel CREATE INDEX command. | [
{
"docid": "3054ed6a4364afaeb31f09b4b8b5fcc8",
"score": "0.68509316",
"text": "@Test\n public void testCreateIndexCancellationUnsupported() throws Exception {\n checkCreateIndexCancellationUnsupported(false);\n }",
"title": ""
}
] | [
{
"docid": "0e75b9337e920aa22301632113282a53",
"score": "0.7070842",
"text": "private void checkCancelled() throws IgniteCheckedException {\n if (cancel != null && cancel.isCancelled())\n throw new IgniteCheckedException(\"Index creation was cancelled.\");\n }",
"title": ""
},... |
0ad2426f7c38879709ab08a6c71cda74 | List list = new ArrayList(); list.add("aaa"); list.add("bbb"); list.add("ccc"); String s = splice(list,""); System.out.println(s); System.out.println( getCountAppearInString("aaabbbccc","")); | [
{
"docid": "b2181a7f300b0668f13118bb4137de98",
"score": "0.0",
"text": "public static void main(String[] args) {\n String s = CommonUtils.bytes2kb(323);\r\n System.out.println(s);\r\n }",
"title": ""
}
] | [
{
"docid": "cc226284b59ff9f71cfb69a60c67d009",
"score": "0.62345785",
"text": "int getStringList01Count();",
"title": ""
},
{
"docid": "0feda580b36204c7801b59da65880dc4",
"score": "0.5873477",
"text": "public static void dublicatesFromList (ArrayList <String> givenString) {\n\n\n ... |
43652f5a458cb36bc3df93ef318761f2 | The number of subsequent error polls (failed due some error) that should happen before the backoffMultipler should kickin. The option will be converted to a int type. Group: scheduler | [
{
"docid": "c54bdefb05aa666a12b6a5f99613d7ae",
"score": "0.0",
"text": "default S3EndpointConsumerBuilder backoffErrorThreshold(\n String backoffErrorThreshold) {\n doSetProperty(\"backoffErrorThreshold\", backoffErrorThreshold);\n return this;\n }",
"titl... | [
{
"docid": "255a281b7e066a40e2f33c1198225763",
"score": "0.6501206",
"text": "int getRetryCount();",
"title": ""
},
{
"docid": "6d6878984f99d8554e70226c9f5e61f2",
"score": "0.62994194",
"text": "int getRetryAttempts();",
"title": ""
},
{
"docid": "a354a732ff1056dff4ce2562... |
e75d02cd5c9b068f3e6bfa5d34f7cd68 | Returns true if value held by this model has changed since the last call to reset or the last time a value came up from the inner model. | [
{
"docid": "2b12ff1fcaf7a35b833e9f6852dd19c6",
"score": "0.0",
"text": "boolean isDirty();",
"title": ""
}
] | [
{
"docid": "95df375e771b0cdbe09a8aad95ff8aaf",
"score": "0.7027683",
"text": "protected boolean isChanged()\n\t{\n\t\treturn this.changed;\n\t}",
"title": ""
},
{
"docid": "f20544e6b145ea8f4165d34eadc39b92",
"score": "0.68510056",
"text": "boolean hasChangedValue();",
"title": ""... |
748b5576547db248122db82f9448665a | Metodo que genera una conexion a la base de datos de mysql con los valores pre definidos Excepciones : No Aplica | [
{
"docid": "c5ac9ba3b702700ef92d216fb7fc2e9a",
"score": "0.7165448",
"text": "public Connection generarConexion() throws SQLException {\n\t\t// Variable donde se almacena la conexion a la base de datos\n\t\tConnection conexion = null;\n\t\t// Valida que el driver de mysql sea valido antes de interntar c... | [
{
"docid": "0873596ef63d19f4abf6c8f8b5b522e5",
"score": "0.7720607",
"text": "public conexion() {\n\t\tbd = vg.baseDeDatos;\n\t\tuser = vg.usuarioMysql;\n\t\tpass = vg.passMysql;\n\t}",
"title": ""
},
{
"docid": "a2fb9db1581d1df5ee074c1839aac414",
"score": "0.7319745",
"text": "bd(St... |
8a0afba9209dd5e51ea2c66fbe568a57 | / / / / / / / / / / / / | [
{
"docid": "45aa2af8c717eebd5eb1b89a891edfab",
"score": "0.0",
"text": "protected IOContext _createContext(Object paramObject, boolean paramBoolean)\n/* */ {\n/* 1373 */ return new IOContext(_getBufferRecycler(), paramObject, paramBoolean);\n/* */ }",
"title": ""
}
] | [
{
"docid": "c4947249f564a8b23a47e2c447581677",
"score": "0.5708909",
"text": "private static void divide() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "ccaf5f7aff0d6de105f523c68f63383c",
"score": "0.5338361",
"text": "private void cathc() {\n\t\t\r\n\t}",
"title": ""
},
{
... |
323b09fdb520632c30b83b2c8f9dd4bb | i = the index of the selected row | [
{
"docid": "35863bdf01fe5038201053adf444168c",
"score": "0.0",
"text": "@Override\n\t \t\t\t public void actionPerformed(ActionEvent e) {\n\t \t\t\t int i = Stable.getSelectedRow();\n\t \t\t\t \n\t \t\t\t if(i >= 0) \n\t \t\t\t ... | [
{
"docid": "74671a3f5ed958d51c7a073c0de384d9",
"score": "0.7090076",
"text": "public void setSelectedRow(int r){\n\t\t\n\t}",
"title": ""
},
{
"docid": "68c7ad53541febb48c58255a08a478a4",
"score": "0.7004783",
"text": "public int getSelectedRow() {\n return selectedRow;\n }... |
25fb76e09299ba8e3521427a6d45dd57 | That is why genPath is used instead for those situations. The map is generated a single time to show every possible path to take to a single tile. Instead of individually pathfinding each of the hundreds of units, you pathfind the map, and the units simply follow the map. GenPath follows the flowfield map generated by ... | [
{
"docid": "13842b66e0265f2aa95cbd7bb50f1e7d",
"score": "0.72292984",
"text": "public void genPath(GameManager gm){\n Path.clear();\n int SearchTile = CenterTile;\n if(gm.getFlowField() == null){\n return;\n }\n while(gm.getFlowField()[SearchTile] != 0){\n ... | [
{
"docid": "7e648bbe289e96817c95138a15cb2017",
"score": "0.6929986",
"text": "@Test\n\tpublic void testSimplePath() {\n\t\tTileMap map = new TileMap(3, 3);\n\t\tmap.setCell(1, 1, true);\n\t\tmap.setCell(1, 2, true);\n\t\t// robots\n\t\tList<MobileRobot> robots = new ArrayList<>();\n\t\trobots.add(create... |
6766ca0f6e19e144316138ce0c334333 | private static ArrayList rectangles = new ArrayList (); | [
{
"docid": "5b895b57731f5897e824fb738c5e7925",
"score": "0.0",
"text": "public void createIsipship() {\r\n\t\tRandom randomGenerator = new Random();\r\n\t\tint posX = 840;\r\n\t\tint randomPosY = randomGenerator.nextInt(480); \r\n\t\tIsipEngineer isipEngineer = new IsipEngineer(posX, randomPosY);\r\n\t\... | [
{
"docid": "b2c3979c4e08c22d51bb4c4d15e69137",
"score": "0.67251027",
"text": "private ArrayList<Figure> getRectangleData(){\n\n ArrayList<Figure> getRectangleData = new ArrayList<>();\n\n getRectangleData.add(new Rectangle(\"First rectangle\", Color.RED, 2, 3));\n getRectangle... |
402eba58776450e31bbd2e7755981d54 | Handles all HTTP POST requests to this servlet | [
{
"docid": "34060741069da257dd200f5fafdc293b",
"score": "0.0",
"text": "@Override\n protected void doPost(HttpServletRequest req, HttpServletResponse resp) {\n switch (req.getRequestURI()){\n case \"/reimbursement/create\":\n new ReimbursementCreateController(req, res... | [
{
"docid": "30911a5aefbf239e965722f33e1b6647",
"score": "0.7535941",
"text": "@Override\r\n\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\n\t\tdoPost(req, resp);\r\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "f40b6cf0a2e2767a683b... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "c4e6db64fd46ce53703bb03bf6254e5d",
"score": "0.0",
"text": "@Override\r\n\tpublic void setDureeContrat(int dureeContrat) {\n\t\tthis.dureeContrat = dureeContrat;\r\n\t}",
"title": ""
}
] | [
{
"docid": "e5fa0eebc721dea67da872fd14413bc7",
"score": "0.69744676",
"text": "@Override\n\tpublic void formule() {\n\t\t\n\t}",
"title": ""
},
{
"docid": "8b7f87c22e268a87686c66398c2c442b",
"score": "0.6936331",
"text": "@Override\r\n\t\t\tpublic void atras() {\n\t\t\t\t\r\n\t\t\t}"... |
02d03ce0922f144475e9ae73957ccd32 | Updates appropriate variables to represent a zoom. Does not update the image, just sets new limits | [
{
"docid": "dce7764c3d4cfe7a180da245c7c6f520",
"score": "0.0",
"text": "private void doPixelZoom(double factor, double pixelCentreX, double pixelCentreY) {\n /*\n * The centre of the zoom in co-ordinate space\n */\n double coordCentreX = minX + (pixelCentreX / getFitWidth()... | [
{
"docid": "e8de700c442b66e17d3f1912e4499a52",
"score": "0.7275187",
"text": "public void setZoomValue( int zoomValue );",
"title": ""
},
{
"docid": "cb1e2332b6868f9c75ea4d6e6f47bb53",
"score": "0.72722507",
"text": "public void updateZoom() {\n\t\tif (AceUniverse.getSettings().conta... |
2f68814cfcb5dfb7b5924094eb5100c3 | Returns all rows from the T_DEVICE_INFO table that match the criteria 'RAMUNIT = :ramunit'. | [
{
"docid": "03c3033ef2641a4d2364e72d8dd2c599",
"score": "0.76732844",
"text": "public List<TDeviceInfo> findWhereRamunitEquals(String ramunit) throws TDeviceInfoDaoException;",
"title": ""
}
] | [
{
"docid": "6ab2bd35842f9d64108e94c1da90f38b",
"score": "0.7112079",
"text": "public List<TDeviceInfo> findWhereNvramunitEquals(String nvramunit) throws TDeviceInfoDaoException;",
"title": ""
},
{
"docid": "71284286970c9ecd775bb6263bb6d2ed",
"score": "0.69917727",
"text": "public Lis... |
303503a32b99df4e2971899780390f9f | Created by Syed Murtaza Mehdi on 21/12/2015. | [
{
"docid": "b40ff0f0cab26abb308e347afeb9f586",
"score": "0.0",
"text": "public interface communicator {\n public void respond(int i);\n}",
"title": ""
}
] | [
{
"docid": "ffe5fe3cec40acf4b0b07ea257dfa06a",
"score": "0.64209557",
"text": "private void apparence()\r\n\t\t{\r\n\r\n\t\t}",
"title": ""
},
{
"docid": "db6adf52deb87c2723f80c6df873c47d",
"score": "0.6310938",
"text": "public void mo4741aD() {\n }",
"title": ""
},
{
... |
6da70c717e648bb8b7b47d037f33296e | / renamed from: com.ss.android.ad.splash.core.video.a.c$f | [
{
"docid": "cdf5b9f7c9d6e0f6d81f4d4006cc461f",
"score": "0.0",
"text": "public interface C19074f {\n /* renamed from: c */\n void mo50700c(C19068c cVar);\n }",
"title": ""
}
] | [
{
"docid": "e1b84034cd23a2ffe0c4bcba16b4d83f",
"score": "0.7101197",
"text": "private void m123762b() {\n C33187a aVar;\n if (VERSION.SDK_INT >= 21) {\n this.textureVideoView.setClipToOutline(true);\n this.textureVideoView.setOutlineProvider(new C43070ds(C23486n.m7712... |
41d0e3bba585918c04d102a64673ddd1 | Ensure the constructor is abstract. | [
{
"docid": "77d0fb4862da7bc3fe2ab32643823196",
"score": "0.68234247",
"text": "@Test\n public void testConstructor() throws Exception {\n Constructor<AbstractBolt> constructor = AbstractBolt.class\n .getDeclaredConstructor();\n\n // Must not be accessible (abstract)\n ... | [
{
"docid": "3b552c59e339e1e0b4f29422c24c2da2",
"score": "0.7241201",
"text": "public abstractEx()\r\n\t{\r\n\t\tSystem.out.println(\"Iam constructor of abstract class\");\r\n\t}",
"title": ""
},
{
"docid": "f00628585b4600a30b5ab3689441f7aa",
"score": "0.70877284",
"text": "public Stu... |
7e9e1b10cdaebcf65dda17dfe9fde144 | Starts specified in config browser, maximizes window | [
{
"docid": "44e3c48426f72a9ad8040550d784289b",
"score": "0.0",
"text": "protected void launchDriver() throws MalformedURLException {\n\n switch (SessionPrototype.getClient()) {\n case IE:\n startInternetExplorer();\n break;\n case FF:\n ... | [
{
"docid": "81c05d859158b835cbe9f8de364dbae4",
"score": "0.68453425",
"text": "private void maximizeWindow() {\n if(dependencyContainer.propertiesManager.getPropertyAsBoolean(\"windows.maximize\")) {\n dependencyContainer.webDriverManager.getDriver().manage().window().maximize();\n ... |
7028519a71aa69be197c043df03c0acb | Echo a command to output with its parameters | [
{
"docid": "2928dacc66e1880d73000bd59786f1d8",
"score": "0.6464537",
"text": "public void printCommand(String[] token)\r\n {\r\n System.out.print(token[0]);\r\n\r\n for (int i = 1; i < token.length; ++i)\r\n {\r\n System.out.print(\" \" + token[i]);\r\n }\r\n\r\... | [
{
"docid": "a9a5cb1a1aaef5a14e609c4b182f9377",
"score": "0.6420897",
"text": "@Override\r\n\t\tpublic void doCommand(String[] args) {\r\n\t\t\tm.doCommand(\"display\", args);\r\n\t\t}",
"title": ""
},
{
"docid": "1417bace75a9bef1149b3cad5b8f8169",
"score": "0.638504",
"text": "public... |
77a534e3f36a2b3e4d97bd9913721ca9 | Get context by name. | [
{
"docid": "afe5cac0c1547e443e1ed98bde37d12a",
"score": "0.63889503",
"text": "public static MessageContext context(String contextName) {\n return MessagesUtils.context(contextName);\n }",
"title": ""
}
] | [
{
"docid": "8ab4359b6ae8876f7315c6a3a91dfdd4",
"score": "0.6859823",
"text": "java.lang.String getContextName();",
"title": ""
},
{
"docid": "ed88772e38f0e0ee1c58627f33ea17b8",
"score": "0.67962587",
"text": "String getContextName();",
"title": ""
},
{
"docid": "00e4f153f... |
5e5a981082e3b1ae8b9674f3e68fe530 | Set the value related to the column: POSTCODE | [
{
"docid": "ff7139a75fd9d719ee54964f72a6d418",
"score": "0.6976237",
"text": "public void setPostcode (java.lang.String postcode) {\n\t\tthis.postcode = postcode;\n\t}",
"title": ""
}
] | [
{
"docid": "5b0841d8264985f22358a455e9809b1d",
"score": "0.72240984",
"text": "public void setPostCode(String postCode) {\n this.postCode = postCode;\n }",
"title": ""
},
{
"docid": "3b3e05c26b6444df129eda11916ce620",
"score": "0.71512973",
"text": "public void setPostCode(... |
01c3a3c5a2ad44e4608e4f35d8ea4b20 | One sol / TODO check this logic This is also called Optimum GAME strategy | [
{
"docid": "2fa2e962989e2b16336546f23488ff05",
"score": "0.0",
"text": "public int maxcoin2(int[] A) {\n\n\t\tif (A == null || A.length == 0) {\n\t\t\treturn 0;\n\t\t}\n\n\t\tint n = A.length;\n\t\tint sol[][] = new int[n][n];\n\n\t\tfor (int length = 0; length < n; length++) {\n\t\t\tfor (int i = 0, j ... | [
{
"docid": "b46900513e2dcd8b16f0c2679ab9948a",
"score": "0.6933038",
"text": "public void solveGame() {\n\n\n fillWithZeroes();\n fillSudoku();\n solver.solve(this);\n checkBoard();\n logger1.debug(exceptBundle.getString(\"created\"));\n }",
"title": ""
},
{... |
570364e96a3bbfa619a0a89099ccc1a9 | Get the entity's meta packet. | [
{
"docid": "d3c6a985d7920b0c6027957ba3e16600",
"score": "0.65686965",
"text": "public Object getMetaPacket(Object watcher) {\n\n\n Object packet = null;\n try {\n Class<?> DataWatcher = NMSUtils.getNMSClass(\"DataWatcher\");\n\n Class<?> PacketPlayOutEntityMetadata = ... | [
{
"docid": "929acde776a39cace534f065a8d4b3f7",
"score": "0.7533041",
"text": "public EntityMeta getEntityMeta(){\n\t\t\n\t\treturn this.meta;\n\t}",
"title": ""
},
{
"docid": "92105e431151e9cd39cb560621e60b80",
"score": "0.6537322",
"text": "@Nullable\n public String getMetaData() {... |
fe474828e3c8ad98a4268352b7c4533a | Check question one answers . | [
{
"docid": "482d2cc2b72352f6c1805e15d84f628d",
"score": "0.0",
"text": "private String getQuestionOneUserInput() {\n userInputLastName = (EditText) findViewById ( R.id.answerInputUserLanguage );\n String name = userInputLastName.getText ().toString ();\n return name;\n }",
"t... | [
{
"docid": "c9bf78054136e4644af678c67e8fb398",
"score": "0.7656475",
"text": "boolean hasAnswer();",
"title": ""
},
{
"docid": "c9bf78054136e4644af678c67e8fb398",
"score": "0.7656475",
"text": "boolean hasAnswer();",
"title": ""
},
{
"docid": "c9bf78054136e4644af678c67e8f... |
d213e0b7a4e4fe53978d7f776c42c0fe | Runs the ray tracer. Takes scene file, output image file and image size as input. | [
{
"docid": "24647d993a230fed903486570c8136e5",
"score": "0.7761569",
"text": "public static void main(String[] args) {\r\n\r\n try {\r\n\r\n RayTracer tracer = new RayTracer();\r\n\r\n // Default values:\r\n tracer.imageWidth = 500;\r\n tracer.imageHeig... | [
{
"docid": "6a8f9d92ed0d2f955c55b8c0bc193af4",
"score": "0.63576514",
"text": "public RayTracerEngine(Dimension image_size, Scene scene, Camera camera) {\n\t\tthis.scene = scene;\n\t\tthis.camera = camera;\n\t\tthis.width = image_size.width;\n\t\tthis.height = image_size.height;\n\t\tforward = new Vecto... |
16b0bcc2f74ab9916b0962d8d67f03c9 | Inherit java doc for IRSequence | [
{
"docid": "cca0dce48d325ad09aa6ad3ab47c7a96",
"score": "0.0",
"text": "@Override\r\n public boolean isVariable() {\r\n return sequence.isVariable();\r\n }",
"title": ""
}
] | [
{
"docid": "e127497ac20a0f5ed3f2e63173193cc2",
"score": "0.68863857",
"text": "@Override\r\n public void visitSequence(Sequence sequence) {\n }",
"title": ""
},
{
"docid": "8a838266646a1da81fe0829b46371441",
"score": "0.61371756",
"text": "Sequence createSequence();",
"titl... |
7fc23e093e212f3ea616518aa10efc29 | If the thread is presently running a Runnable of any kind, blocks until the Runnable has finished running. Else returns immediately. Returns true if the worker was working on some Runnable, else false. | [
{
"docid": "b8ae3ab59c3648506776a5367ca3effc",
"score": "0.5790518",
"text": "public boolean join(Worker thread)\n {\n return ((Node)thread).joinRunnable();\n }",
"title": ""
}
] | [
{
"docid": "b5472c611096fbab9b62802661caeacd",
"score": "0.6871424",
"text": "boolean joinRunnable()\n {\n synchronized(runLock)\n {\n if (toRun != null)\n return joinRunnable(toRun);\n else return false;\n ... |
fb0c8dad629784e6d03ba68c1a728497 | constructor / this assumes that cpool has been extended by one and passed in to be updated / list is a Vector of Local_Variable_Tables | [
{
"docid": "cde7549382c8cd27b64bd64ec7c461bf",
"score": "0.6379626",
"text": "public StackAllocLocalVariables_Attribute(Local_Variable_Table lvt[], Vector list, Cp_Info cpool[]) {\n\n attribute_length = 2 + (10*list.size()); \n if ((cpool.length-1) > 32767) {\n\tSystem.err.println(\"ERROR In conve... | [
{
"docid": "364cf5a38f262ea5c70b6a48bf8a1524",
"score": "0.57359844",
"text": "public void addElements(Vector list) {\n\n /* Code_Attribute.updateAttributeLength must be called after using this method */\n\n if (list == null || list.size() == 0) return;\n if (table_length != 0) {\n home:... |
44f33bdc3ab9a75d0f7777bdcb2ecac0 | Selecciona las subcategira de una categoria de despesa | [
{
"docid": "b94fe3dcbc000021190614743bbdf804",
"score": "0.0",
"text": "public String[] getCatDesValores(String grupo) {\n try {\n String[] valores;\n ResultSet sent = EjecutarSentencia(\"SELECT * FROM categoriades WHERE grupo = '\" + grupo + \"'\");\n sent.first(... | [
{
"docid": "30e410da387a7a354bcc8a8e2f522d5c",
"score": "0.6843692",
"text": "public FiltroSubCategoria() {\r\n }",
"title": ""
},
{
"docid": "b81fd8ba2cdc6b16bf506a3c217eecec",
"score": "0.6708218",
"text": "public void buscarSubCategoria() {\n int codigo = Integer.parseIn... |
c48f365cbc171c1402648e487330c415 | ensures an appropriate distribution of nodes at each level | [
{
"docid": "b07d963e6de1f65c6f6406873efa483e",
"score": "0.0",
"text": "private int getLevelForNextInsert(){\r\n\t\tint level;\r\n\t\tint nodesAtLevel;\r\n\t\tfor (level = 0; targetNodesAtLevel(level) > 0;level++){\r\n\t\t\tif(level < levelCounts.size()) nodesAtLevel = levelCounts.get(level);\r\n\t\t\te... | [
{
"docid": "9ae87aba1f7988b5283c5bc3e9e30d89",
"score": "0.67660534",
"text": "private int targetNodesAtLevel(int level){\r\n\t\treturn (int)Math.round((float)size/Math.pow(2.0, level+1));\r\n\t}",
"title": ""
},
{
"docid": "20b0d52f28038518e9ffca84c579646c",
"score": "0.62952304",
"... |
137b05f6508eac16cb33c075aa8517e0 | Library construction does not need to care whether their are or are not any entry points. | [
{
"docid": "c7ade3967d79db56a8bcd9b9590a00f4",
"score": "0.0",
"text": "@Override\n protected void checkEntryPoints(String[] entryPointTypeNames, String[] additionalRootTypes) {\n }",
"title": ""
}
] | [
{
"docid": "33ed194d6499f4a427c4daf3b642c37e",
"score": "0.6940886",
"text": "Library createLibrary();",
"title": ""
},
{
"docid": "33ed194d6499f4a427c4daf3b642c37e",
"score": "0.6940886",
"text": "Library createLibrary();",
"title": ""
},
{
"docid": "33ed194d6499f4a427c4... |