styleImage = SHIELD_IMAGE;\n case HEALTH_INCREASE -> styleImage = HEALTH_INCREASE_IMAGE;\n case LASER -> styleImage = LASER_IMAGE;\n case POWER_SHOT_TWICE -> styleImage = POWER_SHOT_TWICE_IMAGE;\n case POWER_SHOT_TRIPLE -> styleImage = POWER_SHOT_TRIPLE_IMAGE;\n }\n }","title":""},{"docid":"d3248cdd11f8c4c84065e7c64c420a50","score":"0.4561566","text":"public boolean isSetChannel() {\n return this.channel != null;\n }","title":""},{"docid":"d3248cdd11f8c4c84065e7c64c420a50","score":"0.4561566","text":"public boolean isSetChannel() {\n return this.channel != null;\n }","title":""},{"docid":"d3248cdd11f8c4c84065e7c64c420a50","score":"0.4561566","text":"public boolean isSetChannel() {\n return this.channel != null;\n }","title":""},{"docid":"d3248cdd11f8c4c84065e7c64c420a50","score":"0.4561566","text":"public boolean isSetChannel() {\n return this.channel != null;\n }","title":""},{"docid":"254d6fc2accc9126a603b2d380cd1cee","score":"0.45613724","text":"public void setItem(final Channel channel)\n {\n super.setItem(channel);\n\n mNameConfigurationEditor.setItem(channel);\n mSourceConfigurationEditor.setItem(channel);\n mDecodeConfigurationEditor.setItem(channel);\n mAuxDecodeConfigurationEditor.setItem(channel);\n mEventLogConfigurationEditor.setItem(channel);\n mRecordConfigurationEditor.setItem(channel);\n\n if (channel != null)\n {\n mChannelName.setText(\"Channel: \" + channel.getName());\n mEnableButton.setText(channel.getEnabled() ? \"Disable\" : \"Enable\");\n mEnableButton.setEnabled(true);\n mEnableButton.setBackground(channel.getEnabled() ? Color.GREEN : getBackground());\n }\n else\n {\n mChannelName.setText(\"Channel: \");\n mEnableButton.setText(\"Enable\");\n mEnableButton.setEnabled(false);\n mEnableButton.setBackground(getBackground());\n }\n }","title":""},{"docid":"ea3488a8ee584f93d9bb7d6da164f10a","score":"0.45599705","text":"void disableChannel();","title":""},{"docid":"2b80b73c0e578c16e7951fb1c3e5512f","score":"0.45446116","text":"public ChessBoard(String gamestate_filename, PlayerTypes playerTypes) {\n\t\tinitUI(false);// TODO fullscreen\n\t\tthis.playerTypes = playerTypes;\n\t\tinitGame(NewGameType.LOAD, playerTypes);\n\t}","title":""},{"docid":"9da9746f6f292ee408f897dbba6ec333","score":"0.45420453","text":"@Override\n \tpublic void channelStateChanged(Channel state, Current __current) {\n \n \t}","title":""},{"docid":"b7b67b1c4c5d3aa2d035673c683b7c95","score":"0.4525735","text":"private static ModeFlags getModesFromChannel(Channel channel) throws InvalidValueException {\n ModeFlags modes;\n if (channel instanceof ReadableByteChannel) {\n if (channel instanceof WritableByteChannel) {\n modes = new ModeFlags(RDWR);\n } else {\n modes = new ModeFlags(RDONLY);\n }\n } else if (channel instanceof WritableByteChannel) {\n modes = new ModeFlags(WRONLY);\n } else {\n // FIXME: I don't like this\n modes = new ModeFlags(RDWR);\n }\n \n return modes;\n }","title":""},{"docid":"25a0d950847767d5e118d33597c5bae8","score":"0.45165378","text":"private boolean configureChannelMap()\n {\n boolean useJavaTVChannelMap = false;\n \n try\n {\n // Get the value of the config_file arg\n m_strChannelFile = m_args.getStringArg(CONFIG_FILE);\n displayMessage(\"RiExerciser channel file -> \" + m_strChannelFile);\n\n FileInputStream fis = new FileInputStream(m_strChannelFile);\n ArgParser fopts = new ArgParser(fis);\n fis.close();\n\n // Check to see if we should use the Java TV channel map.\n try\n {\n String value = fopts.getStringArg(USE_JAVA_TV);\n if (value.equalsIgnoreCase(\"true\"))\n {\n useJavaTVChannelMap = true;\n }\n else if (value.equalsIgnoreCase(\"false\"))\n {\n useJavaTVChannelMap = false;\n }\n else\n {\n useJavaTVChannelMap = false;\n }\n }\n catch (Exception e)\n {\n useJavaTVChannelMap = false;\n displayMessage(\"Exception in configureChannelMap \" + e);\n }\n }\n catch (FileNotFoundException fnfex)\n {\n displayMessage(\"Rixerciser channel file \" + m_strChannelFile + \" not found\");\n m_strChannelFile = \"\";\n }\n catch (IOException e)\n {\n displayMessage(e.toString());\n }\n catch (Exception e)\n {\n displayMessage(\"Unable to find config_file arg\");\n }\n return useJavaTVChannelMap;\n }","title":""},{"docid":"ff6303100f3f64787f454d74023c64c4","score":"0.45145556","text":"public boolean isChannel()\n {\n return isChannel;\n }","title":""},{"docid":"1ca14d115769a7f4e23ecea253754b7f","score":"0.45009747","text":"public void initVolumeStyleProperty() {\n GPm gpmChunk = getGPmChunk(GPmType.STYLE_ATTRIBUTES);\n int volumeStyle = getValueSlideControl(gpmChunk.getHexData(StyleFunction.VOLUME.getDataBytePosition()));\n setVolumeStyle(volumeStyle);\n }","title":""},{"docid":"eeca7a400bb2d6cbd143d0e4236d7264","score":"0.44913197","text":"private void initSettingsButtons(){\n BufferedImage img;\r\n float x, y;\r\n SpriteType sT;\r\n Sprite s;\r\n \r\n PropertiesManager props = PropertiesManager.getPropertiesManager();\r\n String imgPath = props.getProperty(PathXPropertyType.PATH_IMG);\r\n \r\n //Settings Sound Toggle\r\n sT = new SpriteType(SOUND_TOGGLE_BUTTON_TYPE);\r\n img = loadImage(imgPath + props.getProperty(PathXPropertyType.IMAGE_BUTTON_TOGGLE_OFF));\r\n sT.addState(PathXSpriteState.DISABLED.toString(), img);\r\n sT.addState(PathXSpriteState.MOUSE_OVER.toString(), img);\r\n img = loadImage(imgPath + props.getProperty(PathXPropertyType.IMAGE_BUTTON_TOGGLE_ON));\r\n sT.addState(PathXSpriteState.ENABLED.toString(), img);\r\n x = PathXConstants.SOUND_TOGGLE_X;\r\n y = PathXConstants.SOUND_TOGGLE_Y;\r\n s = new Sprite(sT, x, y, 0, 0, INVISIBLE.toString());\r\n s.setEnabled(false);\r\n guiButtons.put(SOUND_TOGGLE_BUTTON_TYPE, s);\r\n \r\n //Settings Music Toggle\r\n sT = new SpriteType(MUSIC_TOGGLE_BUTTON_TYPE);\r\n img = loadImage(imgPath + props.getProperty(PathXPropertyType.IMAGE_BUTTON_TOGGLE_OFF));\r\n sT.addState(PathXSpriteState.DISABLED.toString(), img);\r\n sT.addState(PathXSpriteState.MOUSE_OVER.toString(), img);\r\n img = loadImage(imgPath + props.getProperty(PathXPropertyType.IMAGE_BUTTON_TOGGLE_ON));\r\n sT.addState(PathXSpriteState.ENABLED.toString(), img);\r\n x = PathXConstants.MUSIC_TOGGLE_X;\r\n y = PathXConstants.MUSIC_TOGGLE_Y;\r\n s = new Sprite(sT, x, y, 0, 0, INVISIBLE.toString());\r\n s.setEnabled(false);\r\n guiButtons.put(MUSIC_TOGGLE_BUTTON_TYPE, s);\r\n }","title":""},{"docid":"679ff445d9ecc63466396277ec00c872","score":"0.44832855","text":"void setChannelListToLoading();","title":""},{"docid":"8b9997035dd1700b36b03f920f62ca29","score":"0.44632015","text":"private void setState(ChannelState state) {\n this.state = state;\n }","title":""},{"docid":"74795860a728563254d7d7fb5a75fff9","score":"0.4450875","text":"public void loadChannels(Configuration config) {\r\n\t\tList<String> channels = config.getStringList(\"channels\");\r\n\t\tif (channels != null) {\r\n\t\t\tfor (String s : channels) {\r\n\t\t\t\tChatColor color = ChatColor.GOLD;\r\n\t\t\t\tString permission = \"*\";\r\n\t\t\t\tString identifier = s;\r\n\t\t\t\tint type = 1; //1 - Normal, 2 - Privileged, 3 - Announcement\r\n\t\t\t\tList<String> messages = new ArrayList<String>();;\r\n\t\t\t\tint frequency = 1000;\r\n\t\t\t\t//Get color definition.\r\n\t\t\t\tif (config.getString(s + \".color\") != null) {\r\n\t\t\t\t\tcolor = ChatColor.valueOf(config.getString(s + \".color\"));\r\n\t\t\t\t\tif (color == null)\r\n\t\t\t\t\t\tcolor = ChatColor.GOLD;\r\n\t\t\t\t}\r\n\t\t\t\t//Get permission definition.\r\n\t\t\t\tif (config.getString(s + \".permission\") != null) {\r\n\t\t\t\t\tpermission = config.getString(s + \".permission\");\r\n\t\t\t\t}\r\n\t\t\t\t//Get identifier definition.\r\n\t\t\t\tif (config.getString(s + \".identifier\") != null) {\r\n\t\t\t\t\tidentifier = config.getString(s + \".identifier\");\r\n\t\t\t\t}\r\n\t\t\t\t//Get type definition.\r\n\t\t\t\tif (config.getInt(s + \".type\") > 0) {\r\n\t\t\t\t\ttype = config.getInt(s + \".type\");\r\n\t\t\t\t}\r\n\t\t\t\t//\r\n\t\t\t\tif (type == 3) {\r\n\t\t\t\t\tif (config.getStringList(s + \".announcements\") != null) \r\n\t\t\t\t\t\tmessages = config.getStringList(s + \".announcements\");\r\n\t\t\t\t\tif (config.getInt(s + \".frequency\") > 0)\r\n\t\t\t\t\t\tfrequency = config.getInt(s + \".frequency\");\r\n\t\t\t\t}\r\n\t\t\t\tswitch (type) {\r\n\t\t\t\t\tcase 1:\r\n\t\t\t\t\t\tchatChannels.put(s, new NormalChannel(s, identifier, color, permission));\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\tcase 2:\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\tcase 3:\r\n\t\t\t\t\t\tchatChannels.put(s, new AnnouncementChannel(s, identifier, \r\n\t\t\t\t\t\t\t\tcolor, permission, messages, frequency, plugin));\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t} else AlfChat.log(Level.WARNING, \"No channels section defined!\");\r\n\t\t\r\n\t\tDEFAULT_CHANNEL = config.getString(\"default\");\r\n\t\tGUEST_CHANNEL = config.getString(\"guest\");\r\n\t\t\r\n\t\tif (DEFAULT_CHANNEL == null) {\r\n\t\t\tAlfChat.log(Level.WARNING, \"No default channel defined!\");\r\n\t\t\tDEFAULT_CHANNEL = this.chatChannels.values().iterator().next().getName();\r\n\t\t}\r\n\t\telse {\r\n\t\t\tAlfChat.log(Level.INFO, \"Loaded the default channel: \" + DEFAULT_CHANNEL);\r\n\t\t}\r\n\t\t\r\n\t\tif (GUEST_CHANNEL == null) {\r\n\t\t\tAlfChat.log(Level.WARNING, \"No guest channel defined!\");\r\n\t\t\tGUEST_CHANNEL = DEFAULT_CHANNEL;\r\n\t\t}\r\n\t\telse {\r\n\t\t\tAlfChat.log(Level.INFO, \"Loaded the guest channel: \" + GUEST_CHANNEL);\r\n\t\t}\r\n\t}","title":""},{"docid":"679f4328dfb7b0dce464434f1b208b02","score":"0.44450265","text":"public void setChannelId(int channelId) {\n this.channelId = channelId;\n }","title":""},{"docid":"f71c853720d5336a24f788745976152b","score":"0.44437563","text":"public void setStyleTypeFilter(int type)\r\n\t{\r\n\tcurrentFilter=type;\r\n\t\r\n\t}","title":""},{"docid":"f6ffb850e23b3e42e87057d11b65fb0d","score":"0.44384998","text":"public void setGreen(boolean b) {greenCh=b;}","title":""},{"docid":"3adea726c5b224a5ce1b5db0fc8eee87","score":"0.4437832","text":"@RequiresApi(api = Build.VERSION_CODES.O)\n private void createChannel() {\n NotificationChannel channel = new NotificationChannel(channelId, channelName, NotificationManager.IMPORTANCE_DEFAULT);\n channel.enableVibration(true);\n channel.enableLights(true);\n channel.setLightColor(R.color.colorPrimary);\n channel.setLockscreenVisibility(Notification.VISIBILITY_PRIVATE);\n getManager().createNotificationChannel(channel);\n\n }","title":""},{"docid":"f8b06de91af9616730ba0cfa87ee9064","score":"0.44298705","text":"public void initThemeListener() {\n if (usedSettings.getTheme().equals(\"Orange\")) {\n toggleTheme.setChecked(true);\n applyTheme(\"Orange\");\n } else {\n toggleTheme.setChecked(false);\n applyTheme(\"Green\");\n }\n\n /* Set listener for applying changes when button is toggled. */\n toggleTheme.setOnCheckedChangeListener(new CompoundButton.OnCheckedChangeListener() {\n public void onCheckedChanged(CompoundButton buttonView, boolean isChecked) {\n\n if (isChecked) {\n usedSettings.setTheme(\"Orange\");\n applyPreferences(\"Orange\");\n applyTheme(\"Orange\");\n } else {\n usedSettings.setTheme(\"Green\");\n applyPreferences(\"Green\");\n applyTheme(\"Green\");\n } // Add another color here\n }\n });\n }","title":""},{"docid":"5a759041ea95f0684164bc1a16b2d5f8","score":"0.44265628","text":"public void setStyle(String myStyle)\n {\n this._myStyle = myStyle;\n }","title":""},{"docid":"d69177ecaea90657c100e89ff5842b51","score":"0.4410251","text":"@Test\n\t void testGetChannel_notOpening() throws Exception {\n\t\t// given\n\t\tassertThat(cut.isOpen()).isFalse();\n\t\tcut.read();\n\t\t// when\n\t\tfinal FileChannel actual = cut.getChannel();\n\t\t// then\n\t\tassertThat(cut.isOpen()).isTrue();\n\t\tassertThat(actual.position()).isEqualTo(1);\n\t}","title":""},{"docid":"870f7a8eb5f616d5060e0e6e661b930b","score":"0.4383768","text":"public boolean isChannel(){\n return channel == null;\n }","title":""},{"docid":"9009e8360cb828c5d5092a5f17471a2f","score":"0.4377992","text":"public void setChannel(int[][] channel, int channelNo);","title":""},{"docid":"cc974629f8c7aa267abee984aec18648","score":"0.4371987","text":"private void initStates() {\n greenState = new StateFactoryMethod().stateFactoryMethod(\"GREEN\");\n yellowState = new StateFactoryMethod().stateFactoryMethod(\"YELLOW\");\n redState = new StateFactoryMethod().stateFactoryMethod(\"RED\");\n currentState = new StateFactoryMethod().stateFactoryMethod(\"OFF\");\n previousState = new StateFactoryMethod().stateFactoryMethod(\"RED\");\n }","title":""},{"docid":"3196b838b5a838ede63c243a7763ae45","score":"0.43675643","text":"private int setActiveChannel()\n\t{\t\n\t\tactiveChannel++;\n\t\t//Channel 10 (9 when counting from 0) is reserved for percusion instruments\n\t\tif(activeChannel == 9) activeChannel = 10;\n\t\tif(activeChannel >= 16) activeChannel = 0;\n\t\treturn activeChannel;\n\t}","title":""},{"docid":"30a98fc7f25e6c7bcb332e93ba9a468b","score":"0.43631962","text":"public void setNotifyStyle(String key, boolean bEnable);","title":""},{"docid":"172d0bcd31ec656e6f7c17962ed6c973","score":"0.43596408","text":"public void setChannelName(String channelName) {\n this.channelName = channelName;\n }","title":""},{"docid":"14f7781f77d5ad1cbf80245152cf8c65","score":"0.4356868","text":"public void setChannel(String channel) {\n this.channel = channel == null ? null : channel.trim();\n }","title":""},{"docid":"14f7781f77d5ad1cbf80245152cf8c65","score":"0.4356868","text":"public void setChannel(String channel) {\n this.channel = channel == null ? null : channel.trim();\n }","title":""},{"docid":"e6485b18495eea89a9bfbd3249f293de","score":"0.43530753","text":"public void setAtvChannel(java.lang.String atvChannel) {\n this.atvChannel = atvChannel;\n }","title":""},{"docid":"dff276082b881e589dbaa095c0b789c1","score":"0.43503472","text":"ChannelType createChannelType();","title":""},{"docid":"4f49165f2c4a8a82dd9abc169995aec4","score":"0.4348217","text":"private void init(AttributeSet attrs, int defStyle) {\n setHapticFeedbackEnabled(true);\n chess = new Chess(getContext());\n }","title":""},{"docid":"951df45009693120a708b6c6295565bd","score":"0.4326298","text":"public void setColorDisabled(){\n this.isColored = false;\n changedSettings = true;\n }","title":""},{"docid":"396e24ab251791d86c47399494d05669","score":"0.43186724","text":"private void getAllChannels(){\n this.channelNames = new String[] {\"channel1\", \"channel2\", \"channel3\", \"channel4\", \"channel5\", \"channel6\", \"channel7\", \"channel8\"};\n }","title":""},{"docid":"323e5b7554f0c07fb9f1abe905aae6cf","score":"0.43155974","text":"public void setChannelId(Integer channelId) {\r\n this.channelId = channelId;\r\n }","title":""},{"docid":"1907a143ecbaaf4e56632cc654922a36","score":"0.4308619","text":"private void initFlags() {\n for(ETeamColor color : ETeamColor.values()){\n Coordinate flagStart = SnowmanMapInfo.getFlagStart(SnowmanMapInfo.DEFAULT, color);\n Coordinate flagGoal = SnowmanMapInfo.getFlagGoal(SnowmanMapInfo.DEFAULT, color);\n SnowmanFlag flag =\n entityFactory.createSnowmanFlag(color,\n flagGoal.getX(),\n flagGoal.getY()); \n flag.setLocation(flagStart.getX(), flagStart.getY());\n ManagedReference<SnowmanFlag> ref =\n appContext.getDataManager().createReference(flag);\n flagRefs.put(flag.getID(), ref);\n }\n }","title":""},{"docid":"9aba8408558213abbbe4e7d31a054289","score":"0.43034858","text":"public Channel(final Server newServer, final ChannelInfo newChannelInfo) {\n super();\n \n channelInfo = newChannelInfo;\n server = newServer;\n \n configManager = new ConfigManager(server.getIrcd(), server.getNetwork(),\n server.getName(), channelInfo.getName());\n \n configManager.addChangeListener(\"channel\", this);\n configManager.addChangeListener(\"ui\", \"shownickcoloursintext\", this);\n \n topics = new RollingList<Topic>(configManager.getOptionInt(\"channel\",\n \"topichistorysize\", 10));\n \n sendWho = configManager.getOptionBool(\"channel\", \"sendwho\", false);\n showModePrefix = configManager.getOptionBool(\"channel\", \"showmodeprefix\", false);\n showColours = configManager.getOptionBool(\"ui\", \"shownickcoloursintext\", false);\n \n icon = IconManager.getIconManager().getIcon(\"channel\");\n \n tabCompleter = new TabCompleter(server.getTabCompleter());\n tabCompleter.addEntries(CommandManager.getCommandNames(CommandType.TYPE_CHANNEL));\n tabCompleter.addEntries(CommandManager.getCommandNames(CommandType.TYPE_CHAT));\n \n window = Main.getUI().getChannel(Channel.this);\n WindowManager.addWindow(server.getFrame(), window);\n window.setFrameIcon(icon);\n window.getInputHandler().setTabCompleter(tabCompleter);\n \n eventHandler = new ChannelEventHandler(this);\n \n registerCallbacks();\n \n ActionManager.processEvent(CoreActionType.CHANNEL_OPENED, null, this);\n \n updateTitle();\n selfJoin();\n }","title":""},{"docid":"2a3447a0035f91e184d43f77a6e348c7","score":"0.42936382","text":"@Test\n public void testTokenChannel() throws Exception {\n CharStream charStream = CharStreams.fromStream(ClassLoader.getSystemResourceAsStream(\"channel.testdata\"));\n com.luogh.antlr.ChannelExprLexer lexer = new com.luogh.antlr.ChannelExprLexer(charStream);\n CommonTokenStream commonTokenStream = new CommonTokenStream(lexer);\n commonTokenStream.fill();\n Assert.assertArrayEquals(new String[]{\"DEFAULT_TOKEN_CHANNEL\", \"HIDDEN\"}, lexer.getChannelNames());\n }","title":""},{"docid":"4044e35dd59c92771a1ca76acba8a083","score":"0.4291905","text":"@Override\n\tpublic void setChannel(Channel channel) {\n\t\t\n\t\tthis.channel = (ChannelShell)channel;\n\t\t\n\t}","title":""},{"docid":"a3cf14dde53601f329f7ff6b6ae31936","score":"0.42828202","text":"public void sendPlayoffFilteredStream(String channel, BufferedReader is) {\n try {\n String inputLine;\n int i = 0;\n \n while ((inputLine = is.readLine()) != null) {\n if(isFirstRun) {\n this.playoffs.add(i, inputLine); \n } \n else {\n //print only changed lines\n if(this.playoffs.size() > i && this.playoffs.get(i).equals(inputLine)) {\n inputLine = null;\n }\n else {\n if(this.playoffs.size() > i)\n this.playoffs.set(i, inputLine);\n else\n this.playoffs.add(i, inputLine);\n }\n }\n i++; \n inputLine = filterPlayoffLine(inputLine);\n \n if(inputLine != null ) \n this.sendMessage0(channel, \"Playoff: \" + inputLine); \n }\n is.close();\n this.isFirstRun = false;\n \n } catch (IOException e) {\n System.out.println(\"IOException: \" + e);\n }\n \n return;\n }","title":""},{"docid":"d732f0830eab59fba943edda92cbee93","score":"0.42728996","text":"int getChannel();","title":""},{"docid":"d732f0830eab59fba943edda92cbee93","score":"0.42728996","text":"int getChannel();","title":""},{"docid":"853d5ea96cc6a45eae554c72fb858c40","score":"0.4272623","text":"public boolean isSettingChannel() {\n return isSettingChannel;\n }","title":""},{"docid":"30f89433fd99a18935480d21cf3427b1","score":"0.4272115","text":"public void playChannelSound(String action) {\n if (action.equals(\"join\")) {\n setChannelSoundFile(ModelBuilder.class.getResource(ROOT_PATH + \"/sounds/channelAction/join.wav\"));\n } else {\n setChannelSoundFile(ModelBuilder.class.getResource(ROOT_PATH + \"/sounds/channelAction/left.wav\"));\n }\n if (clip != null) {\n clip.stop();\n }\n try {\n AudioInputStream audioInputStream = AudioSystem.getAudioInputStream(new BufferedInputStream(getChannelSoundFile().openStream()));\n clip = AudioSystem.getClip();\n clip.open(audioInputStream);\n FloatControl gainControl = (FloatControl) clip.getControl(FloatControl.Type.MASTER_GAIN);\n gainControl.setValue(0.0f);\n clip.start();\n } catch (Exception ex) {\n ex.printStackTrace();\n }\n }","title":""},{"docid":"28acd241561f0514e9c5828679a7afdc","score":"0.42677042","text":"@Test\n\t void testGetChannel() throws Exception {\n\t\t// given\n\t\tassertThat(cut.isOpen()).isFalse();\n\t\t// when\n\t\tfinal FileChannel actual = cut.getChannel();\n\t\t// then\n\t\tassertThat(cut.isOpen()).isTrue();\n\t\tassertThat(actual.position()).isEqualTo(0);\n\t}","title":""},{"docid":"397af0d9c9714af40ef2f8f90fffb298","score":"0.426358","text":"public void setStyle(int val){\r\n\t\tif (val == 1){\r\n\t\t\tstyle = new MancalaStyle1();\r\n\t\t}\r\n\t\telse if (val == 2){\r\n\t\t\tstyle = new MancalaStyle2();\r\n\t\t}\r\n\t\tcBoard = style.colorOfBoard();\r\n\t\tcPocket = style.colorOfPockets();\r\n\r\n\t\tnotifyListeners();\r\n\t}","title":""},{"docid":"2580d01a0e5c5648df6835293772525a","score":"0.4262526","text":"public void setVolumeSliderStyle(String style) {\n\t\tvolumeSlider.setStyle(style);\n\t}","title":""},{"docid":"a3b3d1b79f98ea9dc8ad3eaf621a2133","score":"0.42611977","text":"public ChannelSpec(int frequency) {\n this.frequency = frequency;\n passive = false;\n dwellTimeMS = 0;\n }","title":""},{"docid":"ce76f843632c8577749928a10387aef2","score":"0.4260561","text":"public Current(int channel) {\n\t\tsuper(channel);\n\t}","title":""},{"docid":"ef369937ad8218ceead19fa514826d19","score":"0.42598763","text":"public void setChannel(String channel) {\n builder.channelSet(Collections.singletonList(channel));\n }","title":""},{"docid":"a071a36b0d1ac907539891705aac236a","score":"0.4257103","text":"private void setVoiceChannel(Guild guild, TextChannel channel, String chanName) {\n //Scans through the VoiceChannels in this Guild, looking for one with a case-insensitive matching name.\n voiceChannel = guild.getVoiceChannels().stream().filter(\n vChan -> vChan.getName().equalsIgnoreCase(chanName))\n .findFirst().orElse(null); //If there isn't a matching name, return null.\n if (voiceChannel == null)\n {\n channel.sendMessage(\"There isn't a VoiceChannel called: '\" + chanName + \"'\");\n return;\n }\n try {\n guild.getAudioManager().openAudioConnection(voiceChannel);\n }catch (Exception e){e.printStackTrace();}\n }","title":""},{"docid":"2f3fb8dc27cb4426eeb47e97ed20f558","score":"0.4254004","text":"public ColorFinder() {\r\n \t//Set the member variables\r\n \tdb = new ColorDB(SIMPLIFIED_DB);\r\n \ttext = \"\";\r\n \tpic = new Picture(\"banana_ripeningchart.jpg\"); //Default picture\r\n \t\r\n \t// Create the TTS agent\r\n \tttsAgent = new ColorRead(\"Kevin16\");\r\n \t\r\n }","title":""},{"docid":"6c30e8f0cfaac213b8740f32f8cd1215","score":"0.42400125","text":"public void setChannel(Long channel) {\n this.channel = channel;\n }","title":""},{"docid":"7e3914714f70809766d49255418debb1","score":"0.42228872","text":"public static void focusChannel(Player p, Channel channel) \n {\n focusChannel(p, channel.getName());\n }","title":""},{"docid":"60bd63bbc652412a16e45c2b34bd8956","score":"0.42217198","text":"public void setEnableColoring(boolean b){\n\t\tthis.enableColoring=b; //for the current type\r\n\t}","title":""},{"docid":"3313b38d0121c32fe40d131e5fe73011","score":"0.4206553","text":"public void addChannelToBitmask(byte channel) {\r\n\t\tswitch(channel) {\r\n\t\t\tcase SPINESensorConstants.CH1: this.channelBitmask |= SPINESensorConstants.CH1_ONLY; break; \r\n\t\t\tcase SPINESensorConstants.CH2: this.channelBitmask |= SPINESensorConstants.CH2_ONLY; break;\r\n\t\t\tcase SPINESensorConstants.CH3: this.channelBitmask |= SPINESensorConstants.CH3_ONLY; break;\r\n\t\t\tcase SPINESensorConstants.CH4: this.channelBitmask |= SPINESensorConstants.CH4_ONLY; break;\r\n\t\t}\t\t\r\n\t}","title":""},{"docid":"93d2b0da21b35c558f90164fccad824c","score":"0.42038321","text":"public void getColorsForTypesFromFile(CasAnnotationViewer viewer, File aStyleMapFile) {\n List<Color> colorList = new ArrayList<>();\n ArrayList<String> typeList = new ArrayList<>();\n ArrayList<String> notCheckedList = new ArrayList<>();\n ArrayList<String> hiddenList = new ArrayList<>();\n hiddenList.add(\"uima.cpm.FileLocation\");\n\n if (aStyleMapFile.exists()) {\n\n FileInputStream stream = null;\n Document parse = null;\n try {\n stream = new FileInputStream(aStyleMapFile);\n DocumentBuilder db = DocumentBuilderFactory.newInstance().newDocumentBuilder();\n parse = db.parse(stream);\n } catch ( ParserConfigurationException | FactoryConfigurationError | SAXException | IOException e) {\n throw new UIMARuntimeException(e);\n }\n Node node0 = parse.getDocumentElement();\n // Node node1 = getFirstChildByName(parse.getDocumentElement(),\n // \"styleMap\");\n // String node1Name = node1.getNodeName();\n\n NodeList nodeList = node0.getChildNodes();\n ColorParser cParser = new ColorParser();\n for (int i = 0; i < nodeList.getLength(); i++) {\n Node node = nodeList.item(i);\n String nodeName = node.getNodeName();\n if (nodeName.equals(\"rule\")) {\n NodeList childrenList = node.getChildNodes();\n String type = \"\";\n String label = \"\";\n StyleMapEntry sme = null;\n String colorText = \"\";\n for (int j = 0; j < childrenList.getLength(); j++) {\n Node child = childrenList.item(j);\n String childName = child.getNodeName();\n if (childName.equals(\"pattern\")) {\n type = getTextValue(child);\n }\n if (childName.equals(\"label\")) {\n label = getTextValue(child);\n }\n if (childName.equals(\"style\")) {\n colorText = getTextValue(child);\n }\n\n }\n sme = cParser.parseAndAssignColors(type, label, label, colorText);\n if (!sme.getChecked()) {\n notCheckedList.add(sme.getAnnotationTypeName());\n }\n if (!sme.getHidden()) {\n colorList.add(sme.getBackground());\n typeList.add(sme.getAnnotationTypeName());\n } else {\n hiddenList.add(sme.getAnnotationTypeName());\n }\n\n }\n }\n\n if (stream != null)\n try {\n stream.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n viewer.assignColorsFromList(colorList, typeList);\n viewer.assignCheckedFromList(notCheckedList);\n String[] hiddenArr = new String[hiddenList.size()];\n hiddenList.toArray(hiddenArr);\n viewer.setHiddenTypes(hiddenArr);\n }\n\n }","title":""},{"docid":"1f91e6723468ce31f9c931ef83017fa9","score":"0.4203148","text":"public int enableStateWatcher(String name);","title":""},{"docid":"eff8cfb483a9e26756992616afc6c14a","score":"0.42005342","text":"void addChannelType(ChannelType channelType);","title":""},{"docid":"a1ed74af62db303b129833a88ea8df91","score":"0.41957134","text":"public int getChannel()\n {\n return f_nChannel;\n }","title":""},{"docid":"669f082ee2c2ba81a19e86c386716bd2","score":"0.41893762","text":"private void updateChannelList(final List<String> channels)\n {\n if (!channels.isEmpty())\n {\n getView().clearChannelList();\n\n getView().addChannel(\"All\");\n\n // update list box.\n for (String channel : channels)\n {\n getView().addChannel(channel);\n }\n\n // default is first item \"All\".\n getView().selectChannel(0);\n\n // Enable plot button, since there is data to be plotted.\n getView().enablePlotButton();\n\n } else\n {\n getView().setChannelListToNoData();\n }\n }","title":""},{"docid":"4eceadb8b2a9d1501ddc14b01a72958d","score":"0.41867015","text":"void play(int channel);","title":""},{"docid":"4f5d8491008f378ecc1f5b60667f230f","score":"0.41827","text":"public ChannelState getState();","title":""},{"docid":"1e2af1ac0ed1cd576aa7812d89cbdeb8","score":"0.41754866","text":"@Override\n\t\t\t\tpublic void channelStateUpdate(AnyDataChannel channel) {\n\t\t\t\t\t\n\t\t\t\t}","title":""},{"docid":"3aaed31aaba3a0d229e7fda41d5dab2d","score":"0.41749477","text":"public void init() {\n\t\tif (m_closedLoopMode) {\n\t\t\tsetClosedLoopMode();\n\t\t} else {\n\t\t\tsetOpenLoopMode();\n\t\t}\n\t}","title":""},{"docid":"8da463eae5a53e21a7addb080cce7beb","score":"0.41694003","text":"@Override\n public void init() {\n\n\t// default conditions like ignore non experimental items, wrong answers etc\n\tif (!ignoreIncorrectResponseItems.isSelected()) {\n\t this.ignoreIncorrectResponseItems.setSelected(true);\n\t FilterControlsPanelHandler.checkFilterIncorrectResponseCheckBox();\n\t}\n\n\tif (!ignoreNonExpItemsCheckBox.isSelected()) {\n\t this.ignoreNonExpItemsCheckBox.setSelected(true);\n\t FilterControlsPanelHandler.checkIgnoreNonExpItemsCheckBox();\n\n\t}\n\n\tif (!ignoreNonCtlRelItemsCheckBox.isSelected()) {\n\t this.ignoreNonCtlRelItemsCheckBox.setSelected(true);\n\n\t}\n\n\tif (!ignoreReactionTimeAboveCheckBox.isSelected()) {\n\t this.ignoreReactionTimeAboveCheckBox.setSelected(false);\n\t}\n\n\tif (!ignoreReactionTimeBelowCheckBox.isSelected()) {\n\t this.ignoreReactionTimeBelowCheckBox.setSelected(false);\n\t}\n\n\tif (!ignoreReactionTimeAboveTextField.isEnabled()) {\n\t this.ignoreReactionTimeAboveTextField.setEnabled(false);\n\t}\n\n\tif (!ignoreReactionTimeBelowTextField.isEnabled()) {\n\t this.ignoreReactionTimeBelowTextField.setEnabled(false);\n\t}\n\n\tif (insertMeanColumnCheckbox.isSelected()) {\n\t this.insertMeanColumnCheckbox.setSelected(false);\n\t}\n\tif (insertMeanColumnCheckbox.isEnabled() == false) {\n\t insertMeanColumnCheckbox.setEnabled(true);\n\t}\n\tif (insertStandardDeviationsColumnCheckBox.isSelected()) {\n\t this.insertStandardDeviationsColumnCheckBox.setSelected(false);\n\t}\n\tif (insertZScoreColumnCheckBox.isSelected()) {\n\t this.insertZScoreColumnCheckBox.setSelected(false);\n\t}\n\n }","title":""},{"docid":"6dedd35a990335916bb1e45fa6751669","score":"0.41659325","text":"public boolean isOpen() {\n return channel.isOpen();\n }","title":""},{"docid":"01416f7b959bc294ad80ba6eade52052","score":"0.416436","text":"public void setChannel(com.jeecms.cms.entity.CmsChannel channel) {\n this.channel = channel;\n }","title":""},{"docid":"21bf215c90b06b6a9f27daea01345290","score":"0.41599405","text":"@PostConstruct\n public void init() {\n Channel channel = new Channel();\n RateLimiter limiter = new RateLimiter();\n limiter.setTimeInSecs(timeInSecs);\n limiter.setNoOfRequests(defaultRequestCount);\n limiter.setLastBlockTime(0);\n channel.addApiLimit(Constants.DEFAULT_KEY, limiter);\n BufferedReader br = null;\n String line = \"\";\n String cvsSplitBy = \",\";\n try {\n br = new BufferedReader(new FileReader(filePath));\n br.readLine();\n while ((line = br.readLine()) != null) {\n String[] row = line.split(cvsSplitBy);\n RateLimiter rL = new RateLimiter();\n String key = row[0];\n rL.setTimeInSecs(Integer.parseInt(row[2]));\n rL.setNoOfRequests(Integer.parseInt(row[1]));\n rL.setLastBlockTime(0);\n channel.addApiLimit(key, rL);\n }\n } catch (FileNotFoundException e) {\n LOG.error(\"File not found at {}\", filePath);\n } catch (IOException e) {\n LOG.error(\"IOException occured \", e);\n } finally {\n if (br != null) {\n try {\n br.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n }\n this.channel = channel;\n }","title":""},{"docid":"2440c41a6ff2d6468265f06266136837","score":"0.41560373","text":"public boolean isGreen() { return greenCh; }","title":""},{"docid":"b566e4a53d1efb2a7bf98f376c4f39d9","score":"0.41551688","text":"public static void focusChannel(Player p, String channel)\n {\n if(!isJoined(p, channel.toLowerCase()))\n {\n joinChannel(p, channel.toLowerCase());\n }\n focusedChannel.put(p, getChannel(channel.toLowerCase()));\n }","title":""},{"docid":"fe97a4e893eaefb816b13cf5ff14bdd7","score":"0.4155163","text":"@Test\n public void testInitialize() {\n assertTrue(muteButton.getStyleClass().contains(\"mute-release\"));\n assertFalse(muteButton.getStyleClass().contains(\"mute-pressed\"));\n }","title":""},{"docid":"919c71f4cb582f1b08a9cc9d8961fe1b","score":"0.41518173","text":"private void ensureChannelModeDefinitionExistence(Character mode, char modeType) {\n ChannelModeDefinition newModeDef = new ChannelModeDefinition(mode, modeType);\n \n if(!getChannelModes().contains(newModeDef)) {\n getChannelModes().add(newModeDef);\n }\n }","title":""},{"docid":"abd73867f4f6fcd68e66ef0a69a04813","score":"0.41506767","text":"public abstract int chooseStyle();","title":""},{"docid":"65ee2f43fbf6337c17f171f474214b6b","score":"0.41488704","text":"void setChannelChangeHandler(final ChangeHandler changeHandler);","title":""},{"docid":"d0822b3ec7535750515f08684b38ab1a","score":"0.41486695","text":"public int getChannel(){\r\n\t\treturn channel;\r\n\t}","title":""},{"docid":"5f897ec7faed8019887ecfa853540024","score":"0.413299","text":"public ProcessSetupLightStatus()\r\n\t{\r\n\t\tsetSupportedActions(EnumSet.of(LCActionTypeEnum.UPDATE_LIGHT_STATUS));\r\n\t}","title":""},{"docid":"3dbd2ce2e898d85ea9acd577a9525748","score":"0.412798","text":"private void initializeEditorSyntaxStyles() {\n SyntaxStyle syntaxStyle[] = SyntaxUtilities.getDefaultSyntaxStyles();\n int tokens = syntaxStyle.length;\n syntaxStyleColorSettingsKeys = new String[tokens];\n syntaxStyleBoldSettingsKeys = new String[tokens];\n syntaxStyleItalicSettingsKeys = new String[tokens];\n defaultSyntaxStyleColorSettingsValues = new String[tokens];\n defaultSyntaxStyleBoldSettingsValues = new boolean[tokens];\n defaultSyntaxStyleItalicSettingsValues = new boolean[tokens];\n syntaxStyleColorSettingsValues = new String[tokens];\n syntaxStyleBoldSettingsValues = new boolean[tokens];\n syntaxStyleItalicSettingsValues = new boolean[tokens];\n for (int i = 0; i < tokens; i++) {\n syntaxStyleColorSettingsKeys[i] = SYNTAX_STYLE_COLOR_PREFIX + i;\n syntaxStyleBoldSettingsKeys[i] = SYNTAX_STYLE_BOLD_PREFIX + i;\n syntaxStyleItalicSettingsKeys[i] = SYNTAX_STYLE_ITALIC_PREFIX + i;\n syntaxStyleColorSettingsValues[i] =\n defaultSyntaxStyleColorSettingsValues[i] = syntaxStyle[i].getColorAsHexString();\n syntaxStyleBoldSettingsValues[i] =\n defaultSyntaxStyleBoldSettingsValues[i] = syntaxStyle[i].isBold();\n syntaxStyleItalicSettingsValues[i] =\n defaultSyntaxStyleItalicSettingsValues[i] = syntaxStyle[i].isItalic();\n }\n }","title":""},{"docid":"452616030da499c7ff5ef50fd7e063ee","score":"0.41272268","text":"public void setChannelType(final String channelType) {\r\n if (null != channelType && !\"\".equals(channelType)) {\r\n this.attributesMap.put(\"type\", channelType.toUpperCase());\r\n }\r\n }","title":""}],"string":"[\n {\n \"docid\": \"7b19055a880e061504f1ee1dcc573c67\",\n \"score\": \"0.57543314\",\n \"text\": \"public void transferIsChannelEnabledProperty(StyleChannel styleChannel) {\\n /*\\n * The StyleChannel with the channel number can be activated or disabled\\n * using the following approach:\\n * 1. Take the current channelCombinationNumber.\\n * 2. If channel is activated and should be disabled: subtract 2^(channelNumber - 1)\\n * If channel is disabled and should be activated: add 2^(channelNumber - 1)\\n *\\n * Example for the approach based on channel 3 and channelCombinationNumber 0C.\\n * In this channelCombinationNumber 0C channel 3 is activated. User wants to disable it, so\\n * subtract 2^(3 - 1) = 4. 0C means 12 as an integer. 12 - 4 gives 8, so the new\\n * channelCombinationNumber would be 08.\\n */\\n GPm gpmChunk = getGPmChunk(GPmType.STYLE_ATTRIBUTES);\\n channelCombination = gpmChunk.getHexData(StyleFunction.CHANNEL_COMBINATION.getDataBytePosition()); // the channel combination number (hex value)\\n int channelCombinationNumber = Integer.parseInt(channelCombination, 16); // the channel combination number (as an Integer)\\n int channelNumber = styleChannel.getChannelNumber();\\n int power = (int) Math.pow(2, channelNumber - 1);\\n\\n boolean isChannelActive = isChannelEnabled(styleChannel);\\n this.initIsChannelEnabledProperty(styleChannel); // unbind before doing this!\\n boolean wasChannelActive = isChannelEnabled(styleChannel);\\n\\n if (wasChannelActive && !isChannelActive) {\\n channelCombinationNumber -= power;\\n }\\n else if (!wasChannelActive && isChannelActive) {\\n channelCombinationNumber += power;\\n }\\n\\n//\\t\\tint channelCombinationNumber = 0;// set all channels inactive\\n//\\t\\tif (areChannelsActive.get(channelNumber - 1))\\n//\\t\\t\\tchannelCombinationNumber += power; // then check if the current channel should be active and add power; if it is disabled, nothing else has to be done\\n\\n // upload channelCombination (hex value representation)\\n channelCombination = Formatter.formatIntToHex(channelCombinationNumber, 1);\\n // upload the data of the gpmChunk\\n gpmChunk.changeHexDataByte(StyleFunction.CHANNEL_COMBINATION.getDataBytePosition(), channelCombination);\\n setChannelEnabled(styleChannel, isChannelActive);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af5eba9ad24a0843db9fd211655cc488\",\n \"score\": \"0.57183295\",\n \"text\": \"public StyleChannel getChannel() {\\n return channel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"885fe026bae85aaa20c26bc0914771eb\",\n \"score\": \"0.52313197\",\n \"text\": \"void setupChannel();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cad2e81246ccd9041eeee4161447794a\",\n \"score\": \"0.51551425\",\n \"text\": \"public void initVolumeProperty(StyleChannel styleChannel) {\\n GPm gpmChunk = getGPmChunk(GPmType.STYLE_ATTRIBUTES);\\n int volume = getValueSlideControl(gpmChunk.getHexData(styleChannel.getChannelNumber() + 12 /* position of data byte for the first channel is 13 */));\\n setVolume(styleChannel, volume);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3f11c8dad8ba1506993bb81d18fe656\",\n \"score\": \"0.508613\",\n \"text\": \"public void setChannel(Channel channel) {\\n this.channel = channel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"455f229a4db7a44e95cab33ccab46d17\",\n \"score\": \"0.50360906\",\n \"text\": \"public void setChannel(String channel){\\n this.channel = channel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7b314be48fdb90dd8adfbeb0eb6d8fc\",\n \"score\": \"0.49429178\",\n \"text\": \"public void setChannel(String channel) {\\n this.channel = channel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7b314be48fdb90dd8adfbeb0eb6d8fc\",\n \"score\": \"0.49429178\",\n \"text\": \"public void setChannel(String channel) {\\n this.channel = channel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dec9b043644dbc91884f98c9d522f0f7\",\n \"score\": \"0.48845252\",\n \"text\": \"public void setChannel(int station){\\r\\n \\t\\tchannel = station;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"93c15914c0aca8826f0b31cb049c04da\",\n \"score\": \"0.48437524\",\n \"text\": \"public void setColorEnabled(){\\n this.isColored = true;\\n changedSettings = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd0f6c226bfdd4a5ac3c8053d6a68f6b\",\n \"score\": \"0.4774065\",\n \"text\": \"public void setChannelNumber(java.lang.Integer channelNumber) {\\r\\n this.channelNumber = channelNumber;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4136c6ddb909d34e6ff6fceed699e060\",\n \"score\": \"0.47649717\",\n \"text\": \"public void setChannelDisplayed(int channel, boolean enable) {\\r\\n\\t\\tignoreChannel[channel] = !enable;\\r\\n\\t\\tclear();\\r\\n\\t\\tfindNotes();\\r\\n\\t\\tupdate();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9c1d039f62d46237fccdf1f82cd75f8\",\n \"score\": \"0.47428444\",\n \"text\": \"void initStyle();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b33c182a778f00877c72c391f35bcd0\",\n \"score\": \"0.47070894\",\n \"text\": \"public static void initializeGame (boolean colour, Socket s) {\\n CHESS_WINDOW = new ChessBoardWindow(colour);\\n CHESS_WINDOW.open();\\n CHESS_WINDOW.initializeBoard(CHESS_TILES);\\n ReadThread r = new ReadThread(s);\\n r.start();\\n WriteThread w = new WriteThread(s);\\n w.start();\\n socket = s;\\n alliedTurn = colour; \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b10e1f558acc240395931684bf2df2ff\",\n \"score\": \"0.46994588\",\n \"text\": \"private SwitchImpl(final CCUChannel channel, final int channelNumber, final int iseId, final String name, final String serialNumber) {\\n\\t\\tsuper(channel, DatapointType.STATE, channelNumber, iseId, name, serialNumber);\\n\\t\\t\\n\\t\\tthis.state = this.getState(Boolean::parseBoolean);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"199e3e8476f935844e6f91b571b2f44f\",\n \"score\": \"0.46950576\",\n \"text\": \"public ChannelListProviderImpl() {\\n\\t\\tFile configDir = new File(Configuration.CONFIG_DIR_PATH);\\n\\t\\tFile[] files = configDir.listFiles(new FileFilter() {\\n\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic boolean accept(File pathname) {\\n\\t\\t\\t\\treturn pathname.isFile() && pathname.getName().toLowerCase().endsWith(\\\".\\\" + SETTINGS_FILE_EXTENSION);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\tif (files == null || files.length == 0) {\\n\\t\\t\\tLOG.info(\\\"No settings file found at [\\\" + configDir + \\\"]\\\");\\n\\t\\t} else {\\n\\t\\t\\treadChannelListEntries(files[0]);\\n\\t\\t\\tif (config.getChannelListType() != null) {\\n\\t\\t\\t\\tselectChannelList(config.getChannelListType());\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14e3092b80a16e4d1effe7136a4c6a8a\",\n \"score\": \"0.46783432\",\n \"text\": \"private static void setChannel() {\\n\\t\\tnotificationChannel = new NotificationChannel(CHANNEL_ID, CHANNEL_NAME, NotificationManager.IMPORTANCE_DEFAULT);\\n\\t\\tnotificationChannel.setDescription(CHANNEL_DESCRIPTION);\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e2ed5e39f0100028da746c3620ec488\",\n \"score\": \"0.45951042\",\n \"text\": \"public void setChannel(int channel) {\\r\\n\\t\\tnoteChannel = channel;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19b9532856d6abd82c5c5d7f5e012c5b\",\n \"score\": \"0.45628956\",\n \"text\": \"public void styleFinder() {\\n switch (style) {\\n case SHIELD -> styleImage = SHIELD_IMAGE;\\n case HEALTH_INCREASE -> styleImage = HEALTH_INCREASE_IMAGE;\\n case LASER -> styleImage = LASER_IMAGE;\\n case POWER_SHOT_TWICE -> styleImage = POWER_SHOT_TWICE_IMAGE;\\n case POWER_SHOT_TRIPLE -> styleImage = POWER_SHOT_TRIPLE_IMAGE;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3248cdd11f8c4c84065e7c64c420a50\",\n \"score\": \"0.4561566\",\n \"text\": \"public boolean isSetChannel() {\\n return this.channel != null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3248cdd11f8c4c84065e7c64c420a50\",\n \"score\": \"0.4561566\",\n \"text\": \"public boolean isSetChannel() {\\n return this.channel != null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3248cdd11f8c4c84065e7c64c420a50\",\n \"score\": \"0.4561566\",\n \"text\": \"public boolean isSetChannel() {\\n return this.channel != null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3248cdd11f8c4c84065e7c64c420a50\",\n \"score\": \"0.4561566\",\n \"text\": \"public boolean isSetChannel() {\\n return this.channel != null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"254d6fc2accc9126a603b2d380cd1cee\",\n \"score\": \"0.45613724\",\n \"text\": \"public void setItem(final Channel channel)\\n {\\n super.setItem(channel);\\n\\n mNameConfigurationEditor.setItem(channel);\\n mSourceConfigurationEditor.setItem(channel);\\n mDecodeConfigurationEditor.setItem(channel);\\n mAuxDecodeConfigurationEditor.setItem(channel);\\n mEventLogConfigurationEditor.setItem(channel);\\n mRecordConfigurationEditor.setItem(channel);\\n\\n if (channel != null)\\n {\\n mChannelName.setText(\\\"Channel: \\\" + channel.getName());\\n mEnableButton.setText(channel.getEnabled() ? \\\"Disable\\\" : \\\"Enable\\\");\\n mEnableButton.setEnabled(true);\\n mEnableButton.setBackground(channel.getEnabled() ? Color.GREEN : getBackground());\\n }\\n else\\n {\\n mChannelName.setText(\\\"Channel: \\\");\\n mEnableButton.setText(\\\"Enable\\\");\\n mEnableButton.setEnabled(false);\\n mEnableButton.setBackground(getBackground());\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea3488a8ee584f93d9bb7d6da164f10a\",\n \"score\": \"0.45599705\",\n \"text\": \"void disableChannel();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b80b73c0e578c16e7951fb1c3e5512f\",\n \"score\": \"0.45446116\",\n \"text\": \"public ChessBoard(String gamestate_filename, PlayerTypes playerTypes) {\\n\\t\\tinitUI(false);// TODO fullscreen\\n\\t\\tthis.playerTypes = playerTypes;\\n\\t\\tinitGame(NewGameType.LOAD, playerTypes);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9da9746f6f292ee408f897dbba6ec333\",\n \"score\": \"0.45420453\",\n \"text\": \"@Override\\n \\tpublic void channelStateChanged(Channel state, Current __current) {\\n \\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7b67b1c4c5d3aa2d035673c683b7c95\",\n \"score\": \"0.4525735\",\n \"text\": \"private static ModeFlags getModesFromChannel(Channel channel) throws InvalidValueException {\\n ModeFlags modes;\\n if (channel instanceof ReadableByteChannel) {\\n if (channel instanceof WritableByteChannel) {\\n modes = new ModeFlags(RDWR);\\n } else {\\n modes = new ModeFlags(RDONLY);\\n }\\n } else if (channel instanceof WritableByteChannel) {\\n modes = new ModeFlags(WRONLY);\\n } else {\\n // FIXME: I don't like this\\n modes = new ModeFlags(RDWR);\\n }\\n \\n return modes;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"25a0d950847767d5e118d33597c5bae8\",\n \"score\": \"0.45165378\",\n \"text\": \"private boolean configureChannelMap()\\n {\\n boolean useJavaTVChannelMap = false;\\n \\n try\\n {\\n // Get the value of the config_file arg\\n m_strChannelFile = m_args.getStringArg(CONFIG_FILE);\\n displayMessage(\\\"RiExerciser channel file -> \\\" + m_strChannelFile);\\n\\n FileInputStream fis = new FileInputStream(m_strChannelFile);\\n ArgParser fopts = new ArgParser(fis);\\n fis.close();\\n\\n // Check to see if we should use the Java TV channel map.\\n try\\n {\\n String value = fopts.getStringArg(USE_JAVA_TV);\\n if (value.equalsIgnoreCase(\\\"true\\\"))\\n {\\n useJavaTVChannelMap = true;\\n }\\n else if (value.equalsIgnoreCase(\\\"false\\\"))\\n {\\n useJavaTVChannelMap = false;\\n }\\n else\\n {\\n useJavaTVChannelMap = false;\\n }\\n }\\n catch (Exception e)\\n {\\n useJavaTVChannelMap = false;\\n displayMessage(\\\"Exception in configureChannelMap \\\" + e);\\n }\\n }\\n catch (FileNotFoundException fnfex)\\n {\\n displayMessage(\\\"Rixerciser channel file \\\" + m_strChannelFile + \\\" not found\\\");\\n m_strChannelFile = \\\"\\\";\\n }\\n catch (IOException e)\\n {\\n displayMessage(e.toString());\\n }\\n catch (Exception e)\\n {\\n displayMessage(\\\"Unable to find config_file arg\\\");\\n }\\n return useJavaTVChannelMap;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff6303100f3f64787f454d74023c64c4\",\n \"score\": \"0.45145556\",\n \"text\": \"public boolean isChannel()\\n {\\n return isChannel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1ca14d115769a7f4e23ecea253754b7f\",\n \"score\": \"0.45009747\",\n \"text\": \"public void initVolumeStyleProperty() {\\n GPm gpmChunk = getGPmChunk(GPmType.STYLE_ATTRIBUTES);\\n int volumeStyle = getValueSlideControl(gpmChunk.getHexData(StyleFunction.VOLUME.getDataBytePosition()));\\n setVolumeStyle(volumeStyle);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eeca7a400bb2d6cbd143d0e4236d7264\",\n \"score\": \"0.44913197\",\n \"text\": \"private void initSettingsButtons(){\\n BufferedImage img;\\r\\n float x, y;\\r\\n SpriteType sT;\\r\\n Sprite s;\\r\\n \\r\\n PropertiesManager props = PropertiesManager.getPropertiesManager();\\r\\n String imgPath = props.getProperty(PathXPropertyType.PATH_IMG);\\r\\n \\r\\n //Settings Sound Toggle\\r\\n sT = new SpriteType(SOUND_TOGGLE_BUTTON_TYPE);\\r\\n img = loadImage(imgPath + props.getProperty(PathXPropertyType.IMAGE_BUTTON_TOGGLE_OFF));\\r\\n sT.addState(PathXSpriteState.DISABLED.toString(), img);\\r\\n sT.addState(PathXSpriteState.MOUSE_OVER.toString(), img);\\r\\n img = loadImage(imgPath + props.getProperty(PathXPropertyType.IMAGE_BUTTON_TOGGLE_ON));\\r\\n sT.addState(PathXSpriteState.ENABLED.toString(), img);\\r\\n x = PathXConstants.SOUND_TOGGLE_X;\\r\\n y = PathXConstants.SOUND_TOGGLE_Y;\\r\\n s = new Sprite(sT, x, y, 0, 0, INVISIBLE.toString());\\r\\n s.setEnabled(false);\\r\\n guiButtons.put(SOUND_TOGGLE_BUTTON_TYPE, s);\\r\\n \\r\\n //Settings Music Toggle\\r\\n sT = new SpriteType(MUSIC_TOGGLE_BUTTON_TYPE);\\r\\n img = loadImage(imgPath + props.getProperty(PathXPropertyType.IMAGE_BUTTON_TOGGLE_OFF));\\r\\n sT.addState(PathXSpriteState.DISABLED.toString(), img);\\r\\n sT.addState(PathXSpriteState.MOUSE_OVER.toString(), img);\\r\\n img = loadImage(imgPath + props.getProperty(PathXPropertyType.IMAGE_BUTTON_TOGGLE_ON));\\r\\n sT.addState(PathXSpriteState.ENABLED.toString(), img);\\r\\n x = PathXConstants.MUSIC_TOGGLE_X;\\r\\n y = PathXConstants.MUSIC_TOGGLE_Y;\\r\\n s = new Sprite(sT, x, y, 0, 0, INVISIBLE.toString());\\r\\n s.setEnabled(false);\\r\\n guiButtons.put(MUSIC_TOGGLE_BUTTON_TYPE, s);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"679ff445d9ecc63466396277ec00c872\",\n \"score\": \"0.44832855\",\n \"text\": \"void setChannelListToLoading();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b9997035dd1700b36b03f920f62ca29\",\n \"score\": \"0.44632015\",\n \"text\": \"private void setState(ChannelState state) {\\n this.state = state;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"74795860a728563254d7d7fb5a75fff9\",\n \"score\": \"0.4450875\",\n \"text\": \"public void loadChannels(Configuration config) {\\r\\n\\t\\tList<String> channels = config.getStringList(\\\"channels\\\");\\r\\n\\t\\tif (channels != null) {\\r\\n\\t\\t\\tfor (String s : channels) {\\r\\n\\t\\t\\t\\tChatColor color = ChatColor.GOLD;\\r\\n\\t\\t\\t\\tString permission = \\\"*\\\";\\r\\n\\t\\t\\t\\tString identifier = s;\\r\\n\\t\\t\\t\\tint type = 1; //1 - Normal, 2 - Privileged, 3 - Announcement\\r\\n\\t\\t\\t\\tList<String> messages = new ArrayList<String>();;\\r\\n\\t\\t\\t\\tint frequency = 1000;\\r\\n\\t\\t\\t\\t//Get color definition.\\r\\n\\t\\t\\t\\tif (config.getString(s + \\\".color\\\") != null) {\\r\\n\\t\\t\\t\\t\\tcolor = ChatColor.valueOf(config.getString(s + \\\".color\\\"));\\r\\n\\t\\t\\t\\t\\tif (color == null)\\r\\n\\t\\t\\t\\t\\t\\tcolor = ChatColor.GOLD;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t//Get permission definition.\\r\\n\\t\\t\\t\\tif (config.getString(s + \\\".permission\\\") != null) {\\r\\n\\t\\t\\t\\t\\tpermission = config.getString(s + \\\".permission\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t//Get identifier definition.\\r\\n\\t\\t\\t\\tif (config.getString(s + \\\".identifier\\\") != null) {\\r\\n\\t\\t\\t\\t\\tidentifier = config.getString(s + \\\".identifier\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t//Get type definition.\\r\\n\\t\\t\\t\\tif (config.getInt(s + \\\".type\\\") > 0) {\\r\\n\\t\\t\\t\\t\\ttype = config.getInt(s + \\\".type\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t//\\r\\n\\t\\t\\t\\tif (type == 3) {\\r\\n\\t\\t\\t\\t\\tif (config.getStringList(s + \\\".announcements\\\") != null) \\r\\n\\t\\t\\t\\t\\t\\tmessages = config.getStringList(s + \\\".announcements\\\");\\r\\n\\t\\t\\t\\t\\tif (config.getInt(s + \\\".frequency\\\") > 0)\\r\\n\\t\\t\\t\\t\\t\\tfrequency = config.getInt(s + \\\".frequency\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tswitch (type) {\\r\\n\\t\\t\\t\\t\\tcase 1:\\r\\n\\t\\t\\t\\t\\t\\tchatChannels.put(s, new NormalChannel(s, identifier, color, permission));\\r\\n\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\tcase 2:\\r\\n\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\tcase 3:\\r\\n\\t\\t\\t\\t\\t\\tchatChannels.put(s, new AnnouncementChannel(s, identifier, \\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcolor, permission, messages, frequency, plugin));\\r\\n\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t} else AlfChat.log(Level.WARNING, \\\"No channels section defined!\\\");\\r\\n\\t\\t\\r\\n\\t\\tDEFAULT_CHANNEL = config.getString(\\\"default\\\");\\r\\n\\t\\tGUEST_CHANNEL = config.getString(\\\"guest\\\");\\r\\n\\t\\t\\r\\n\\t\\tif (DEFAULT_CHANNEL == null) {\\r\\n\\t\\t\\tAlfChat.log(Level.WARNING, \\\"No default channel defined!\\\");\\r\\n\\t\\t\\tDEFAULT_CHANNEL = this.chatChannels.values().iterator().next().getName();\\r\\n\\t\\t}\\r\\n\\t\\telse {\\r\\n\\t\\t\\tAlfChat.log(Level.INFO, \\\"Loaded the default channel: \\\" + DEFAULT_CHANNEL);\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tif (GUEST_CHANNEL == null) {\\r\\n\\t\\t\\tAlfChat.log(Level.WARNING, \\\"No guest channel defined!\\\");\\r\\n\\t\\t\\tGUEST_CHANNEL = DEFAULT_CHANNEL;\\r\\n\\t\\t}\\r\\n\\t\\telse {\\r\\n\\t\\t\\tAlfChat.log(Level.INFO, \\\"Loaded the guest channel: \\\" + GUEST_CHANNEL);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"679f4328dfb7b0dce464434f1b208b02\",\n \"score\": \"0.44450265\",\n \"text\": \"public void setChannelId(int channelId) {\\n this.channelId = channelId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f71c853720d5336a24f788745976152b\",\n \"score\": \"0.44437563\",\n \"text\": \"public void setStyleTypeFilter(int type)\\r\\n\\t{\\r\\n\\tcurrentFilter=type;\\r\\n\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f6ffb850e23b3e42e87057d11b65fb0d\",\n \"score\": \"0.44384998\",\n \"text\": \"public void setGreen(boolean b) {greenCh=b;}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3adea726c5b224a5ce1b5db0fc8eee87\",\n \"score\": \"0.4437832\",\n \"text\": \"@RequiresApi(api = Build.VERSION_CODES.O)\\n private void createChannel() {\\n NotificationChannel channel = new NotificationChannel(channelId, channelName, NotificationManager.IMPORTANCE_DEFAULT);\\n channel.enableVibration(true);\\n channel.enableLights(true);\\n channel.setLightColor(R.color.colorPrimary);\\n channel.setLockscreenVisibility(Notification.VISIBILITY_PRIVATE);\\n getManager().createNotificationChannel(channel);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8b06de91af9616730ba0cfa87ee9064\",\n \"score\": \"0.44298705\",\n \"text\": \"public void initThemeListener() {\\n if (usedSettings.getTheme().equals(\\\"Orange\\\")) {\\n toggleTheme.setChecked(true);\\n applyTheme(\\\"Orange\\\");\\n } else {\\n toggleTheme.setChecked(false);\\n applyTheme(\\\"Green\\\");\\n }\\n\\n /* Set listener for applying changes when button is toggled. */\\n toggleTheme.setOnCheckedChangeListener(new CompoundButton.OnCheckedChangeListener() {\\n public void onCheckedChanged(CompoundButton buttonView, boolean isChecked) {\\n\\n if (isChecked) {\\n usedSettings.setTheme(\\\"Orange\\\");\\n applyPreferences(\\\"Orange\\\");\\n applyTheme(\\\"Orange\\\");\\n } else {\\n usedSettings.setTheme(\\\"Green\\\");\\n applyPreferences(\\\"Green\\\");\\n applyTheme(\\\"Green\\\");\\n } // Add another color here\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a759041ea95f0684164bc1a16b2d5f8\",\n \"score\": \"0.44265628\",\n \"text\": \"public void setStyle(String myStyle)\\n {\\n this._myStyle = myStyle;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d69177ecaea90657c100e89ff5842b51\",\n \"score\": \"0.4410251\",\n \"text\": \"@Test\\n\\t void testGetChannel_notOpening() throws Exception {\\n\\t\\t// given\\n\\t\\tassertThat(cut.isOpen()).isFalse();\\n\\t\\tcut.read();\\n\\t\\t// when\\n\\t\\tfinal FileChannel actual = cut.getChannel();\\n\\t\\t// then\\n\\t\\tassertThat(cut.isOpen()).isTrue();\\n\\t\\tassertThat(actual.position()).isEqualTo(1);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"870f7a8eb5f616d5060e0e6e661b930b\",\n \"score\": \"0.4383768\",\n \"text\": \"public boolean isChannel(){\\n return channel == null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9009e8360cb828c5d5092a5f17471a2f\",\n \"score\": \"0.4377992\",\n \"text\": \"public void setChannel(int[][] channel, int channelNo);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc974629f8c7aa267abee984aec18648\",\n \"score\": \"0.4371987\",\n \"text\": \"private void initStates() {\\n greenState = new StateFactoryMethod().stateFactoryMethod(\\\"GREEN\\\");\\n yellowState = new StateFactoryMethod().stateFactoryMethod(\\\"YELLOW\\\");\\n redState = new StateFactoryMethod().stateFactoryMethod(\\\"RED\\\");\\n currentState = new StateFactoryMethod().stateFactoryMethod(\\\"OFF\\\");\\n previousState = new StateFactoryMethod().stateFactoryMethod(\\\"RED\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3196b838b5a838ede63c243a7763ae45\",\n \"score\": \"0.43675643\",\n \"text\": \"private int setActiveChannel()\\n\\t{\\t\\n\\t\\tactiveChannel++;\\n\\t\\t//Channel 10 (9 when counting from 0) is reserved for percusion instruments\\n\\t\\tif(activeChannel == 9) activeChannel = 10;\\n\\t\\tif(activeChannel >= 16) activeChannel = 0;\\n\\t\\treturn activeChannel;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"30a98fc7f25e6c7bcb332e93ba9a468b\",\n \"score\": \"0.43631962\",\n \"text\": \"public void setNotifyStyle(String key, boolean bEnable);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"172d0bcd31ec656e6f7c17962ed6c973\",\n \"score\": \"0.43596408\",\n \"text\": \"public void setChannelName(String channelName) {\\n this.channelName = channelName;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14f7781f77d5ad1cbf80245152cf8c65\",\n \"score\": \"0.4356868\",\n \"text\": \"public void setChannel(String channel) {\\n this.channel = channel == null ? null : channel.trim();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14f7781f77d5ad1cbf80245152cf8c65\",\n \"score\": \"0.4356868\",\n \"text\": \"public void setChannel(String channel) {\\n this.channel = channel == null ? null : channel.trim();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6485b18495eea89a9bfbd3249f293de\",\n \"score\": \"0.43530753\",\n \"text\": \"public void setAtvChannel(java.lang.String atvChannel) {\\n this.atvChannel = atvChannel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dff276082b881e589dbaa095c0b789c1\",\n \"score\": \"0.43503472\",\n \"text\": \"ChannelType createChannelType();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f49165f2c4a8a82dd9abc169995aec4\",\n \"score\": \"0.4348217\",\n \"text\": \"private void init(AttributeSet attrs, int defStyle) {\\n setHapticFeedbackEnabled(true);\\n chess = new Chess(getContext());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"951df45009693120a708b6c6295565bd\",\n \"score\": \"0.4326298\",\n \"text\": \"public void setColorDisabled(){\\n this.isColored = false;\\n changedSettings = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"396e24ab251791d86c47399494d05669\",\n \"score\": \"0.43186724\",\n \"text\": \"private void getAllChannels(){\\n this.channelNames = new String[] {\\\"channel1\\\", \\\"channel2\\\", \\\"channel3\\\", \\\"channel4\\\", \\\"channel5\\\", \\\"channel6\\\", \\\"channel7\\\", \\\"channel8\\\"};\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"323e5b7554f0c07fb9f1abe905aae6cf\",\n \"score\": \"0.43155974\",\n \"text\": \"public void setChannelId(Integer channelId) {\\r\\n this.channelId = channelId;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1907a143ecbaaf4e56632cc654922a36\",\n \"score\": \"0.4308619\",\n \"text\": \"private void initFlags() {\\n for(ETeamColor color : ETeamColor.values()){\\n Coordinate flagStart = SnowmanMapInfo.getFlagStart(SnowmanMapInfo.DEFAULT, color);\\n Coordinate flagGoal = SnowmanMapInfo.getFlagGoal(SnowmanMapInfo.DEFAULT, color);\\n SnowmanFlag flag =\\n entityFactory.createSnowmanFlag(color,\\n flagGoal.getX(),\\n flagGoal.getY()); \\n flag.setLocation(flagStart.getX(), flagStart.getY());\\n ManagedReference<SnowmanFlag> ref =\\n appContext.getDataManager().createReference(flag);\\n flagRefs.put(flag.getID(), ref);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9aba8408558213abbbe4e7d31a054289\",\n \"score\": \"0.43034858\",\n \"text\": \"public Channel(final Server newServer, final ChannelInfo newChannelInfo) {\\n super();\\n \\n channelInfo = newChannelInfo;\\n server = newServer;\\n \\n configManager = new ConfigManager(server.getIrcd(), server.getNetwork(),\\n server.getName(), channelInfo.getName());\\n \\n configManager.addChangeListener(\\\"channel\\\", this);\\n configManager.addChangeListener(\\\"ui\\\", \\\"shownickcoloursintext\\\", this);\\n \\n topics = new RollingList<Topic>(configManager.getOptionInt(\\\"channel\\\",\\n \\\"topichistorysize\\\", 10));\\n \\n sendWho = configManager.getOptionBool(\\\"channel\\\", \\\"sendwho\\\", false);\\n showModePrefix = configManager.getOptionBool(\\\"channel\\\", \\\"showmodeprefix\\\", false);\\n showColours = configManager.getOptionBool(\\\"ui\\\", \\\"shownickcoloursintext\\\", false);\\n \\n icon = IconManager.getIconManager().getIcon(\\\"channel\\\");\\n \\n tabCompleter = new TabCompleter(server.getTabCompleter());\\n tabCompleter.addEntries(CommandManager.getCommandNames(CommandType.TYPE_CHANNEL));\\n tabCompleter.addEntries(CommandManager.getCommandNames(CommandType.TYPE_CHAT));\\n \\n window = Main.getUI().getChannel(Channel.this);\\n WindowManager.addWindow(server.getFrame(), window);\\n window.setFrameIcon(icon);\\n window.getInputHandler().setTabCompleter(tabCompleter);\\n \\n eventHandler = new ChannelEventHandler(this);\\n \\n registerCallbacks();\\n \\n ActionManager.processEvent(CoreActionType.CHANNEL_OPENED, null, this);\\n \\n updateTitle();\\n selfJoin();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a3447a0035f91e184d43f77a6e348c7\",\n \"score\": \"0.42936382\",\n \"text\": \"@Test\\n public void testTokenChannel() throws Exception {\\n CharStream charStream = CharStreams.fromStream(ClassLoader.getSystemResourceAsStream(\\\"channel.testdata\\\"));\\n com.luogh.antlr.ChannelExprLexer lexer = new com.luogh.antlr.ChannelExprLexer(charStream);\\n CommonTokenStream commonTokenStream = new CommonTokenStream(lexer);\\n commonTokenStream.fill();\\n Assert.assertArrayEquals(new String[]{\\\"DEFAULT_TOKEN_CHANNEL\\\", \\\"HIDDEN\\\"}, lexer.getChannelNames());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4044e35dd59c92771a1ca76acba8a083\",\n \"score\": \"0.4291905\",\n \"text\": \"@Override\\n\\tpublic void setChannel(Channel channel) {\\n\\t\\t\\n\\t\\tthis.channel = (ChannelShell)channel;\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3cf14dde53601f329f7ff6b6ae31936\",\n \"score\": \"0.42828202\",\n \"text\": \"public void sendPlayoffFilteredStream(String channel, BufferedReader is) {\\n try {\\n String inputLine;\\n int i = 0;\\n \\n while ((inputLine = is.readLine()) != null) {\\n if(isFirstRun) {\\n this.playoffs.add(i, inputLine); \\n } \\n else {\\n //print only changed lines\\n if(this.playoffs.size() > i && this.playoffs.get(i).equals(inputLine)) {\\n inputLine = null;\\n }\\n else {\\n if(this.playoffs.size() > i)\\n this.playoffs.set(i, inputLine);\\n else\\n this.playoffs.add(i, inputLine);\\n }\\n }\\n i++; \\n inputLine = filterPlayoffLine(inputLine);\\n \\n if(inputLine != null ) \\n this.sendMessage0(channel, \\\"Playoff: \\\" + inputLine); \\n }\\n is.close();\\n this.isFirstRun = false;\\n \\n } catch (IOException e) {\\n System.out.println(\\\"IOException: \\\" + e);\\n }\\n \\n return;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d732f0830eab59fba943edda92cbee93\",\n \"score\": \"0.42728996\",\n \"text\": \"int getChannel();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d732f0830eab59fba943edda92cbee93\",\n \"score\": \"0.42728996\",\n \"text\": \"int getChannel();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"853d5ea96cc6a45eae554c72fb858c40\",\n \"score\": \"0.4272623\",\n \"text\": \"public boolean isSettingChannel() {\\n return isSettingChannel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"30f89433fd99a18935480d21cf3427b1\",\n \"score\": \"0.4272115\",\n \"text\": \"public void playChannelSound(String action) {\\n if (action.equals(\\\"join\\\")) {\\n setChannelSoundFile(ModelBuilder.class.getResource(ROOT_PATH + \\\"/sounds/channelAction/join.wav\\\"));\\n } else {\\n setChannelSoundFile(ModelBuilder.class.getResource(ROOT_PATH + \\\"/sounds/channelAction/left.wav\\\"));\\n }\\n if (clip != null) {\\n clip.stop();\\n }\\n try {\\n AudioInputStream audioInputStream = AudioSystem.getAudioInputStream(new BufferedInputStream(getChannelSoundFile().openStream()));\\n clip = AudioSystem.getClip();\\n clip.open(audioInputStream);\\n FloatControl gainControl = (FloatControl) clip.getControl(FloatControl.Type.MASTER_GAIN);\\n gainControl.setValue(0.0f);\\n clip.start();\\n } catch (Exception ex) {\\n ex.printStackTrace();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28acd241561f0514e9c5828679a7afdc\",\n \"score\": \"0.42677042\",\n \"text\": \"@Test\\n\\t void testGetChannel() throws Exception {\\n\\t\\t// given\\n\\t\\tassertThat(cut.isOpen()).isFalse();\\n\\t\\t// when\\n\\t\\tfinal FileChannel actual = cut.getChannel();\\n\\t\\t// then\\n\\t\\tassertThat(cut.isOpen()).isTrue();\\n\\t\\tassertThat(actual.position()).isEqualTo(0);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"397af0d9c9714af40ef2f8f90fffb298\",\n \"score\": \"0.426358\",\n \"text\": \"public void setStyle(int val){\\r\\n\\t\\tif (val == 1){\\r\\n\\t\\t\\tstyle = new MancalaStyle1();\\r\\n\\t\\t}\\r\\n\\t\\telse if (val == 2){\\r\\n\\t\\t\\tstyle = new MancalaStyle2();\\r\\n\\t\\t}\\r\\n\\t\\tcBoard = style.colorOfBoard();\\r\\n\\t\\tcPocket = style.colorOfPockets();\\r\\n\\r\\n\\t\\tnotifyListeners();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2580d01a0e5c5648df6835293772525a\",\n \"score\": \"0.4262526\",\n \"text\": \"public void setVolumeSliderStyle(String style) {\\n\\t\\tvolumeSlider.setStyle(style);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3b3d1b79f98ea9dc8ad3eaf621a2133\",\n \"score\": \"0.42611977\",\n \"text\": \"public ChannelSpec(int frequency) {\\n this.frequency = frequency;\\n passive = false;\\n dwellTimeMS = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce76f843632c8577749928a10387aef2\",\n \"score\": \"0.4260561\",\n \"text\": \"public Current(int channel) {\\n\\t\\tsuper(channel);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef369937ad8218ceead19fa514826d19\",\n \"score\": \"0.42598763\",\n \"text\": \"public void setChannel(String channel) {\\n builder.channelSet(Collections.singletonList(channel));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a071a36b0d1ac907539891705aac236a\",\n \"score\": \"0.4257103\",\n \"text\": \"private void setVoiceChannel(Guild guild, TextChannel channel, String chanName) {\\n //Scans through the VoiceChannels in this Guild, looking for one with a case-insensitive matching name.\\n voiceChannel = guild.getVoiceChannels().stream().filter(\\n vChan -> vChan.getName().equalsIgnoreCase(chanName))\\n .findFirst().orElse(null); //If there isn't a matching name, return null.\\n if (voiceChannel == null)\\n {\\n channel.sendMessage(\\\"There isn't a VoiceChannel called: '\\\" + chanName + \\\"'\\\");\\n return;\\n }\\n try {\\n guild.getAudioManager().openAudioConnection(voiceChannel);\\n }catch (Exception e){e.printStackTrace();}\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f3fb8dc27cb4426eeb47e97ed20f558\",\n \"score\": \"0.4254004\",\n \"text\": \"public ColorFinder() {\\r\\n \\t//Set the member variables\\r\\n \\tdb = new ColorDB(SIMPLIFIED_DB);\\r\\n \\ttext = \\\"\\\";\\r\\n \\tpic = new Picture(\\\"banana_ripeningchart.jpg\\\"); //Default picture\\r\\n \\t\\r\\n \\t// Create the TTS agent\\r\\n \\tttsAgent = new ColorRead(\\\"Kevin16\\\");\\r\\n \\t\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c30e8f0cfaac213b8740f32f8cd1215\",\n \"score\": \"0.42400125\",\n \"text\": \"public void setChannel(Long channel) {\\n this.channel = channel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e3914714f70809766d49255418debb1\",\n \"score\": \"0.42228872\",\n \"text\": \"public static void focusChannel(Player p, Channel channel) \\n {\\n focusChannel(p, channel.getName());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60bd63bbc652412a16e45c2b34bd8956\",\n \"score\": \"0.42217198\",\n \"text\": \"public void setEnableColoring(boolean b){\\n\\t\\tthis.enableColoring=b; //for the current type\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3313b38d0121c32fe40d131e5fe73011\",\n \"score\": \"0.4206553\",\n \"text\": \"public void addChannelToBitmask(byte channel) {\\r\\n\\t\\tswitch(channel) {\\r\\n\\t\\t\\tcase SPINESensorConstants.CH1: this.channelBitmask |= SPINESensorConstants.CH1_ONLY; break; \\r\\n\\t\\t\\tcase SPINESensorConstants.CH2: this.channelBitmask |= SPINESensorConstants.CH2_ONLY; break;\\r\\n\\t\\t\\tcase SPINESensorConstants.CH3: this.channelBitmask |= SPINESensorConstants.CH3_ONLY; break;\\r\\n\\t\\t\\tcase SPINESensorConstants.CH4: this.channelBitmask |= SPINESensorConstants.CH4_ONLY; break;\\r\\n\\t\\t}\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"93d2b0da21b35c558f90164fccad824c\",\n \"score\": \"0.42038321\",\n \"text\": \"public void getColorsForTypesFromFile(CasAnnotationViewer viewer, File aStyleMapFile) {\\n List<Color> colorList = new ArrayList<>();\\n ArrayList<String> typeList = new ArrayList<>();\\n ArrayList<String> notCheckedList = new ArrayList<>();\\n ArrayList<String> hiddenList = new ArrayList<>();\\n hiddenList.add(\\\"uima.cpm.FileLocation\\\");\\n\\n if (aStyleMapFile.exists()) {\\n\\n FileInputStream stream = null;\\n Document parse = null;\\n try {\\n stream = new FileInputStream(aStyleMapFile);\\n DocumentBuilder db = DocumentBuilderFactory.newInstance().newDocumentBuilder();\\n parse = db.parse(stream);\\n } catch ( ParserConfigurationException | FactoryConfigurationError | SAXException | IOException e) {\\n throw new UIMARuntimeException(e);\\n }\\n Node node0 = parse.getDocumentElement();\\n // Node node1 = getFirstChildByName(parse.getDocumentElement(),\\n // \\\"styleMap\\\");\\n // String node1Name = node1.getNodeName();\\n\\n NodeList nodeList = node0.getChildNodes();\\n ColorParser cParser = new ColorParser();\\n for (int i = 0; i < nodeList.getLength(); i++) {\\n Node node = nodeList.item(i);\\n String nodeName = node.getNodeName();\\n if (nodeName.equals(\\\"rule\\\")) {\\n NodeList childrenList = node.getChildNodes();\\n String type = \\\"\\\";\\n String label = \\\"\\\";\\n StyleMapEntry sme = null;\\n String colorText = \\\"\\\";\\n for (int j = 0; j < childrenList.getLength(); j++) {\\n Node child = childrenList.item(j);\\n String childName = child.getNodeName();\\n if (childName.equals(\\\"pattern\\\")) {\\n type = getTextValue(child);\\n }\\n if (childName.equals(\\\"label\\\")) {\\n label = getTextValue(child);\\n }\\n if (childName.equals(\\\"style\\\")) {\\n colorText = getTextValue(child);\\n }\\n\\n }\\n sme = cParser.parseAndAssignColors(type, label, label, colorText);\\n if (!sme.getChecked()) {\\n notCheckedList.add(sme.getAnnotationTypeName());\\n }\\n if (!sme.getHidden()) {\\n colorList.add(sme.getBackground());\\n typeList.add(sme.getAnnotationTypeName());\\n } else {\\n hiddenList.add(sme.getAnnotationTypeName());\\n }\\n\\n }\\n }\\n\\n if (stream != null)\\n try {\\n stream.close();\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n viewer.assignColorsFromList(colorList, typeList);\\n viewer.assignCheckedFromList(notCheckedList);\\n String[] hiddenArr = new String[hiddenList.size()];\\n hiddenList.toArray(hiddenArr);\\n viewer.setHiddenTypes(hiddenArr);\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f91e6723468ce31f9c931ef83017fa9\",\n \"score\": \"0.4203148\",\n \"text\": \"public int enableStateWatcher(String name);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eff8cfb483a9e26756992616afc6c14a\",\n \"score\": \"0.42005342\",\n \"text\": \"void addChannelType(ChannelType channelType);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1ed74af62db303b129833a88ea8df91\",\n \"score\": \"0.41957134\",\n \"text\": \"public int getChannel()\\n {\\n return f_nChannel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"669f082ee2c2ba81a19e86c386716bd2\",\n \"score\": \"0.41893762\",\n \"text\": \"private void updateChannelList(final List<String> channels)\\n {\\n if (!channels.isEmpty())\\n {\\n getView().clearChannelList();\\n\\n getView().addChannel(\\\"All\\\");\\n\\n // update list box.\\n for (String channel : channels)\\n {\\n getView().addChannel(channel);\\n }\\n\\n // default is first item \\\"All\\\".\\n getView().selectChannel(0);\\n\\n // Enable plot button, since there is data to be plotted.\\n getView().enablePlotButton();\\n\\n } else\\n {\\n getView().setChannelListToNoData();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4eceadb8b2a9d1501ddc14b01a72958d\",\n \"score\": \"0.41867015\",\n \"text\": \"void play(int channel);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f5d8491008f378ecc1f5b60667f230f\",\n \"score\": \"0.41827\",\n \"text\": \"public ChannelState getState();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e2af1ac0ed1cd576aa7812d89cbdeb8\",\n \"score\": \"0.41754866\",\n \"text\": \"@Override\\n\\t\\t\\t\\tpublic void channelStateUpdate(AnyDataChannel channel) {\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3aaed31aaba3a0d229e7fda41d5dab2d\",\n \"score\": \"0.41749477\",\n \"text\": \"public void init() {\\n\\t\\tif (m_closedLoopMode) {\\n\\t\\t\\tsetClosedLoopMode();\\n\\t\\t} else {\\n\\t\\t\\tsetOpenLoopMode();\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8da463eae5a53e21a7addb080cce7beb\",\n \"score\": \"0.41694003\",\n \"text\": \"@Override\\n public void init() {\\n\\n\\t// default conditions like ignore non experimental items, wrong answers etc\\n\\tif (!ignoreIncorrectResponseItems.isSelected()) {\\n\\t this.ignoreIncorrectResponseItems.setSelected(true);\\n\\t FilterControlsPanelHandler.checkFilterIncorrectResponseCheckBox();\\n\\t}\\n\\n\\tif (!ignoreNonExpItemsCheckBox.isSelected()) {\\n\\t this.ignoreNonExpItemsCheckBox.setSelected(true);\\n\\t FilterControlsPanelHandler.checkIgnoreNonExpItemsCheckBox();\\n\\n\\t}\\n\\n\\tif (!ignoreNonCtlRelItemsCheckBox.isSelected()) {\\n\\t this.ignoreNonCtlRelItemsCheckBox.setSelected(true);\\n\\n\\t}\\n\\n\\tif (!ignoreReactionTimeAboveCheckBox.isSelected()) {\\n\\t this.ignoreReactionTimeAboveCheckBox.setSelected(false);\\n\\t}\\n\\n\\tif (!ignoreReactionTimeBelowCheckBox.isSelected()) {\\n\\t this.ignoreReactionTimeBelowCheckBox.setSelected(false);\\n\\t}\\n\\n\\tif (!ignoreReactionTimeAboveTextField.isEnabled()) {\\n\\t this.ignoreReactionTimeAboveTextField.setEnabled(false);\\n\\t}\\n\\n\\tif (!ignoreReactionTimeBelowTextField.isEnabled()) {\\n\\t this.ignoreReactionTimeBelowTextField.setEnabled(false);\\n\\t}\\n\\n\\tif (insertMeanColumnCheckbox.isSelected()) {\\n\\t this.insertMeanColumnCheckbox.setSelected(false);\\n\\t}\\n\\tif (insertMeanColumnCheckbox.isEnabled() == false) {\\n\\t insertMeanColumnCheckbox.setEnabled(true);\\n\\t}\\n\\tif (insertStandardDeviationsColumnCheckBox.isSelected()) {\\n\\t this.insertStandardDeviationsColumnCheckBox.setSelected(false);\\n\\t}\\n\\tif (insertZScoreColumnCheckBox.isSelected()) {\\n\\t this.insertZScoreColumnCheckBox.setSelected(false);\\n\\t}\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dedd35a990335916bb1e45fa6751669\",\n \"score\": \"0.41659325\",\n \"text\": \"public boolean isOpen() {\\n return channel.isOpen();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01416f7b959bc294ad80ba6eade52052\",\n \"score\": \"0.416436\",\n \"text\": \"public void setChannel(com.jeecms.cms.entity.CmsChannel channel) {\\n this.channel = channel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21bf215c90b06b6a9f27daea01345290\",\n \"score\": \"0.41599405\",\n \"text\": \"@PostConstruct\\n public void init() {\\n Channel channel = new Channel();\\n RateLimiter limiter = new RateLimiter();\\n limiter.setTimeInSecs(timeInSecs);\\n limiter.setNoOfRequests(defaultRequestCount);\\n limiter.setLastBlockTime(0);\\n channel.addApiLimit(Constants.DEFAULT_KEY, limiter);\\n BufferedReader br = null;\\n String line = \\\"\\\";\\n String cvsSplitBy = \\\",\\\";\\n try {\\n br = new BufferedReader(new FileReader(filePath));\\n br.readLine();\\n while ((line = br.readLine()) != null) {\\n String[] row = line.split(cvsSplitBy);\\n RateLimiter rL = new RateLimiter();\\n String key = row[0];\\n rL.setTimeInSecs(Integer.parseInt(row[2]));\\n rL.setNoOfRequests(Integer.parseInt(row[1]));\\n rL.setLastBlockTime(0);\\n channel.addApiLimit(key, rL);\\n }\\n } catch (FileNotFoundException e) {\\n LOG.error(\\\"File not found at {}\\\", filePath);\\n } catch (IOException e) {\\n LOG.error(\\\"IOException occured \\\", e);\\n } finally {\\n if (br != null) {\\n try {\\n br.close();\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n }\\n }\\n this.channel = channel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2440c41a6ff2d6468265f06266136837\",\n \"score\": \"0.41560373\",\n \"text\": \"public boolean isGreen() { return greenCh; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b566e4a53d1efb2a7bf98f376c4f39d9\",\n \"score\": \"0.41551688\",\n \"text\": \"public static void focusChannel(Player p, String channel)\\n {\\n if(!isJoined(p, channel.toLowerCase()))\\n {\\n joinChannel(p, channel.toLowerCase());\\n }\\n focusedChannel.put(p, getChannel(channel.toLowerCase()));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe97a4e893eaefb816b13cf5ff14bdd7\",\n \"score\": \"0.4155163\",\n \"text\": \"@Test\\n public void testInitialize() {\\n assertTrue(muteButton.getStyleClass().contains(\\\"mute-release\\\"));\\n assertFalse(muteButton.getStyleClass().contains(\\\"mute-pressed\\\"));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"919c71f4cb582f1b08a9cc9d8961fe1b\",\n \"score\": \"0.41518173\",\n \"text\": \"private void ensureChannelModeDefinitionExistence(Character mode, char modeType) {\\n ChannelModeDefinition newModeDef = new ChannelModeDefinition(mode, modeType);\\n \\n if(!getChannelModes().contains(newModeDef)) {\\n getChannelModes().add(newModeDef);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"abd73867f4f6fcd68e66ef0a69a04813\",\n \"score\": \"0.41506767\",\n \"text\": \"public abstract int chooseStyle();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65ee2f43fbf6337c17f171f474214b6b\",\n \"score\": \"0.41488704\",\n \"text\": \"void setChannelChangeHandler(final ChangeHandler changeHandler);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0822b3ec7535750515f08684b38ab1a\",\n \"score\": \"0.41486695\",\n \"text\": \"public int getChannel(){\\r\\n\\t\\treturn channel;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f897ec7faed8019887ecfa853540024\",\n \"score\": \"0.413299\",\n \"text\": \"public ProcessSetupLightStatus()\\r\\n\\t{\\r\\n\\t\\tsetSupportedActions(EnumSet.of(LCActionTypeEnum.UPDATE_LIGHT_STATUS));\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3dbd2ce2e898d85ea9acd577a9525748\",\n \"score\": \"0.412798\",\n \"text\": \"private void initializeEditorSyntaxStyles() {\\n SyntaxStyle syntaxStyle[] = SyntaxUtilities.getDefaultSyntaxStyles();\\n int tokens = syntaxStyle.length;\\n syntaxStyleColorSettingsKeys = new String[tokens];\\n syntaxStyleBoldSettingsKeys = new String[tokens];\\n syntaxStyleItalicSettingsKeys = new String[tokens];\\n defaultSyntaxStyleColorSettingsValues = new String[tokens];\\n defaultSyntaxStyleBoldSettingsValues = new boolean[tokens];\\n defaultSyntaxStyleItalicSettingsValues = new boolean[tokens];\\n syntaxStyleColorSettingsValues = new String[tokens];\\n syntaxStyleBoldSettingsValues = new boolean[tokens];\\n syntaxStyleItalicSettingsValues = new boolean[tokens];\\n for (int i = 0; i < tokens; i++) {\\n syntaxStyleColorSettingsKeys[i] = SYNTAX_STYLE_COLOR_PREFIX + i;\\n syntaxStyleBoldSettingsKeys[i] = SYNTAX_STYLE_BOLD_PREFIX + i;\\n syntaxStyleItalicSettingsKeys[i] = SYNTAX_STYLE_ITALIC_PREFIX + i;\\n syntaxStyleColorSettingsValues[i] =\\n defaultSyntaxStyleColorSettingsValues[i] = syntaxStyle[i].getColorAsHexString();\\n syntaxStyleBoldSettingsValues[i] =\\n defaultSyntaxStyleBoldSettingsValues[i] = syntaxStyle[i].isBold();\\n syntaxStyleItalicSettingsValues[i] =\\n defaultSyntaxStyleItalicSettingsValues[i] = syntaxStyle[i].isItalic();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"452616030da499c7ff5ef50fd7e063ee\",\n \"score\": \"0.41272268\",\n \"text\": \"public void setChannelType(final String channelType) {\\r\\n if (null != channelType && !\\\"\\\".equals(channelType)) {\\r\\n this.attributesMap.put(\\\"type\\\", channelType.toUpperCase());\\r\\n }\\r\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983784,"cells":{"query_id":{"kind":"string","value":"941a83a9b1e255bc6a9c9a369c5ae6d0"},"query":{"kind":"string","value":"/ End of public methods."},"positive_passages":{"kind":"list like","value":[{"docid":"a6bdf94bca8183bbb07d9fbfd856b099","score":"0.0","text":"public AllocDotField_Node(WholeProgPAG pag, Alloc_Node base, SparkField field) {\n\t\tsuper(pag, field, field.getType());\n\t\tthis.base = base;\n\t\tthis.field = field;\n\t\tbase.addField(this, field);\n\t}","title":""}],"string":"[\n {\n \"docid\": \"a6bdf94bca8183bbb07d9fbfd856b099\",\n \"score\": \"0.0\",\n \"text\": \"public AllocDotField_Node(WholeProgPAG pag, Alloc_Node base, SparkField field) {\\n\\t\\tsuper(pag, field, field.getType());\\n\\t\\tthis.base = base;\\n\\t\\tthis.field = field;\\n\\t\\tbase.addField(this, field);\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"33d41636b65afa8267c9085dae3d1a2d","score":"0.69293857","text":"private void apparence() {\r\n\r\n\t}","title":""},{"docid":"05a606445504484958a1c21e14b7198e","score":"0.6602753","text":"@Override\r\n\tpublic void sapace() {\n\t\t\r\n\t}","title":""},{"docid":"0b5b11f4251ace8b3d0f5ead186f7beb","score":"0.6506007","text":"@Override\n\tpublic void comer() {\n\t\t\n\t}","title":""},{"docid":"8619203d4867f5c6d05eb9a5354405c0","score":"0.64682996","text":"@Override\n\t\tpublic void pintate() {\n\t\t\t\n\t\t}","title":""},{"docid":"8619203d4867f5c6d05eb9a5354405c0","score":"0.64682996","text":"@Override\n\t\tpublic void pintate() {\n\t\t\t\n\t\t}","title":""},{"docid":"6c2fa45ab362625ae567ee8a229630a4","score":"0.6296283","text":"@Override\n\tprotected void interr() {\n\t}","title":""},{"docid":"ffd8193c9cf73515d0f9301b9a7d8817","score":"0.627647","text":"@Override\n\tpublic void morrer() {\n\n\t}","title":""},{"docid":"10ead2e988bf977cb8edb2bacf974891","score":"0.6253405","text":"@Override\n\tprotected void init() {\n\t\t\n\t}","title":""},{"docid":"10ead2e988bf977cb8edb2bacf974891","score":"0.6253405","text":"@Override\n\tprotected void init() {\n\t\t\n\t}","title":""},{"docid":"10ead2e988bf977cb8edb2bacf974891","score":"0.6253405","text":"@Override\n\tprotected void init() {\n\t\t\n\t}","title":""},{"docid":"10ead2e988bf977cb8edb2bacf974891","score":"0.6253405","text":"@Override\n\tprotected void init() {\n\t\t\n\t}","title":""},{"docid":"10ead2e988bf977cb8edb2bacf974891","score":"0.6253405","text":"@Override\n\tprotected void init() {\n\t\t\n\t}","title":""},{"docid":"4e49f5db36ca664153e54380025b85d4","score":"0.62506264","text":"protected boolean method_21825() {\n }","title":""},{"docid":"132ebee1d663aa8e1c0ab776375c437a","score":"0.62292033","text":"Support support();","title":""},{"docid":"80d20df1cc75d8fa96c12c49a757fc43","score":"0.614233","text":"@Override\n\tprotected void getExras() {\n\t\t\n\t}","title":""},{"docid":"118f2b8a20f48999973063ac332d07d3","score":"0.61369824","text":"@Override\r\n\t\t\tpublic void atras() {\n\r\n\t\t\t}","title":""},{"docid":"41e50fb9a0b417818374927eb02c67f1","score":"0.6113139","text":"protected void mo5608a() {\n }","title":""},{"docid":"963cb7748259d6cd136153dd9086abb9","score":"0.6111294","text":"@Override\r\n\t\t\tpublic void Main() {\n\r\n\t\t\t}","title":""},{"docid":"f2fe8a59406298fe7e97b543f2bf8186","score":"0.6088425","text":"@Override\r\n \tpublic void init() {\r\n \t}","title":""},{"docid":"ebfe1bb4dd1c0618c0fad36d9f7674b4","score":"0.6061302","text":"@Override\n protected void initialize() {\n\n }","title":""},{"docid":"b62a7c8e0bb1090171742c543bf4b253","score":"0.60608834","text":"@Override\n\tpublic void entrenar() {\n\t\t\n\t}","title":""},{"docid":"0cc40600dd2e7cb9f56bd77995e01fc3","score":"0.60386795","text":"@Override\n\tpublic void Miow() {\n\t\t\n\t}","title":""},{"docid":"b941b399a338e8c204f1063e54a94824","score":"0.6027641","text":"public void mo7103g() {\n }","title":""},{"docid":"b941b399a338e8c204f1063e54a94824","score":"0.6027641","text":"public void mo7103g() {\n }","title":""},{"docid":"b941b399a338e8c204f1063e54a94824","score":"0.6027641","text":"public void mo7103g() {\n }","title":""},{"docid":"689ef8ddcd6ccd288c197d21cadd4bee","score":"0.59985524","text":"@Override\n public final void entertain() {\n }","title":""},{"docid":"c16c8d1ea4a8c8572e4aa91460503742","score":"0.5992215","text":"private void Initalization() {\n\t\t\n\t}","title":""},{"docid":"f49ed6756be41155bd7261ea2ff6564b","score":"0.5991568","text":"@Override\n\t\t\t\tpublic void init() {\n\n\t\t\t\t}","title":""},{"docid":"f49ed6756be41155bd7261ea2ff6564b","score":"0.5991568","text":"@Override\n\t\t\t\tpublic void init() {\n\n\t\t\t\t}","title":""},{"docid":"f49ed6756be41155bd7261ea2ff6564b","score":"0.5991568","text":"@Override\n\t\t\t\tpublic void init() {\n\n\t\t\t\t}","title":""},{"docid":"87929e8b046b6fb5c754312beec7ed1c","score":"0.5984384","text":"@Override\n protected void initialize() {\n }","title":""},{"docid":"87929e8b046b6fb5c754312beec7ed1c","score":"0.5984384","text":"@Override\n protected void initialize() {\n }","title":""},{"docid":"87929e8b046b6fb5c754312beec7ed1c","score":"0.5984384","text":"@Override\n protected void initialize() {\n }","title":""},{"docid":"87929e8b046b6fb5c754312beec7ed1c","score":"0.5984384","text":"@Override\n protected void initialize() {\n }","title":""},{"docid":"87929e8b046b6fb5c754312beec7ed1c","score":"0.5984384","text":"@Override\n protected void initialize() {\n }","title":""},{"docid":"87929e8b046b6fb5c754312beec7ed1c","score":"0.5984384","text":"@Override\n protected void initialize() {\n }","title":""},{"docid":"87929e8b046b6fb5c754312beec7ed1c","score":"0.5984384","text":"@Override\n protected void initialize() {\n }","title":""},{"docid":"87929e8b046b6fb5c754312beec7ed1c","score":"0.5984384","text":"@Override\n protected void initialize() {\n }","title":""},{"docid":"87929e8b046b6fb5c754312beec7ed1c","score":"0.5984384","text":"@Override\n protected void initialize() {\n }","title":""},{"docid":"87929e8b046b6fb5c754312beec7ed1c","score":"0.5984384","text":"@Override\n protected void initialize() {\n }","title":""},{"docid":"87929e8b046b6fb5c754312beec7ed1c","score":"0.5984384","text":"@Override\n protected void initialize() {\n }","title":""},{"docid":"0adb5f1f1c75684eab047201533dcfe7","score":"0.59666127","text":"protected void mo5609b() {\n }","title":""},{"docid":"0d3bf6f2ee77f787007ba6b4021b5721","score":"0.59598017","text":"protected void olha()\r\n\t{\r\n\t\t\r\n\t}","title":""},{"docid":"518a761521ca9f5cb8a8055b32b72cda","score":"0.5946503","text":"@Override\n\tprotected void initialize() {\n\t\t\n\t}","title":""},{"docid":"518a761521ca9f5cb8a8055b32b72cda","score":"0.5946503","text":"@Override\n\tprotected void initialize() {\n\t\t\n\t}","title":""},{"docid":"770d423e40bf5782a700bc181e8b8a1e","score":"0.593603","text":"@Override\n\tvoid init() {\n\t\t\n\t}","title":""},{"docid":"770d423e40bf5782a700bc181e8b8a1e","score":"0.593603","text":"@Override\n\tvoid init() {\n\t\t\n\t}","title":""},{"docid":"fa1a013b1df2f5f1062e1cc971135645","score":"0.59311134","text":"@Override\n\tpublic void mamar() {\n\t\t\n\t}","title":""},{"docid":"ab92bad46db05153eb5c2eb626d0c4f9","score":"0.5922092","text":"@Override\n public void init() {\n\n \n }","title":""},{"docid":"5783648f118108797828ca2085091ef9","score":"0.5921263","text":"@Override\n protected void initialize() {\n \n }","title":""},{"docid":"235772828b460a414a66709e6096b938","score":"0.5920685","text":"@Override\r\n protected void initialize() {\r\n }","title":""},{"docid":"2b2c76cb338654ad1be7624777cf25f2","score":"0.5906812","text":"private HelperMethods(){}","title":""},{"docid":"67e1a422c8d1e74f6601c8a6d1aaa237","score":"0.59039515","text":"@Override\n\tpublic void apagar() {\n\n\t}","title":""},{"docid":"e022c47f335a39c6bdb94a0f49a4e940","score":"0.5896263","text":"@Override\r\n\tpublic void parar() {\n\t\t\r\n\t}","title":""},{"docid":"a5600ed00582d8ca8d293829dcfd6c38","score":"0.5890996","text":"private void Syso() {\n\r\n\t}","title":""},{"docid":"c47723cc77bfdfbeac347959926f9a12","score":"0.5867715","text":"@Override\n protected void initialize() {\n\n }","title":""},{"docid":"ee560894ec78b1bf45ae9e3ecbdfc890","score":"0.58612955","text":"private static void get() {\n\n\n\t\t\n\t}","title":""},{"docid":"588ab475e29950e8a1944c4a28fe2189","score":"0.58523136","text":"public void mo7036d() {\n }","title":""},{"docid":"daa5f496c8f0f870f389bb4913bbdc3c","score":"0.5838995","text":"public void epingler() {\n\n\t}","title":""},{"docid":"a613dcce17453a8e1eed3b984b6b35b1","score":"0.5835124","text":"@Override\n\tpublic void composant() {\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5834005","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5834005","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5834005","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5834005","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5834005","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5834005","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5834005","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"c86f446a8bd6af19f88cc011fdf2ffd4","score":"0.58287174","text":"public void asustar() {\n // TODO implement here\n \n }","title":""},{"docid":"4cc1f71fd505c7eebea6574cd6adc40c","score":"0.58267677","text":"@Override\n\tpublic void limpar() {\n\n\t}","title":""},{"docid":"e071ca9eec75058b3213adadf2f930b9","score":"0.5818598","text":"public final void mo8109b() {\n }","title":""},{"docid":"b8d886581a76c72e11ab317e6cb6e2a8","score":"0.5817228","text":"@Override\r\n public void rechercher() {\n }","title":""},{"docid":"80b5722cdc9efe11a305e92ea813ac0f","score":"0.58067656","text":"@Override\r\n\tpublic void inter() {\n\t\t\r\n\t}","title":""},{"docid":"32d0d506f2de2532fe4789f006c84da0","score":"0.5802741","text":"@Override\n\tpublic void bicar() {\n\t\t\n\t}","title":""},{"docid":"27e4479db2c37a2e77fe796119b66d4b","score":"0.57826626","text":"@Override\r\n\t\t\tpublic void adelante() {\n\r\n\t\t\t}","title":""},{"docid":"b4074a0ee84b41daa041fd6441831097","score":"0.576769","text":"private Util(){\n\t \n }","title":""},{"docid":"9f7ae565c79188ee275e5778abe03250","score":"0.5758817","text":"@Override\r\n\tprotected void initialize() {\n\r\n\t}","title":""},{"docid":"0694b71fd24e10a480fa3f3dcd28b3ca","score":"0.5758213","text":"public void mo7243j() {\n }","title":""},{"docid":"0694b71fd24e10a480fa3f3dcd28b3ca","score":"0.5758213","text":"public void mo7243j() {\n }","title":""},{"docid":"6f653341cfc7d30c8418e4b72116f7e2","score":"0.5753499","text":"public void mo5201a() {\n }","title":""},{"docid":"b044552fe4d8d8225d09361b41fbea3a","score":"0.57510334","text":"public void mo5201a() {\n }","title":""},{"docid":"9d2f44c3ebe1fb8de1ac4ae677e2d851","score":"0.57467884","text":"@Override\r\n\tpublic void dibujar() {\n\t\t\r\n\t}","title":""},{"docid":"2d614ed2ee5b3120f5ee8b427542ddc3","score":"0.5744767","text":"@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","title":""},{"docid":"2d614ed2ee5b3120f5ee8b427542ddc3","score":"0.5744767","text":"@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","title":""},{"docid":"2d614ed2ee5b3120f5ee8b427542ddc3","score":"0.5744767","text":"@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","title":""},{"docid":"b2a793cd2e6ec37a2fdb27c90d87a493","score":"0.5739434","text":"@Override\r\n\tprotected void initialize() {\n\t\t\r\n\t}","title":""},{"docid":"b2a793cd2e6ec37a2fdb27c90d87a493","score":"0.5739434","text":"@Override\r\n\tprotected void initialize() {\n\t\t\r\n\t}","title":""},{"docid":"b2a793cd2e6ec37a2fdb27c90d87a493","score":"0.5739434","text":"@Override\r\n\tprotected void initialize() {\n\t\t\r\n\t}","title":""},{"docid":"8acd985dadc65be1408801664d9b1bad","score":"0.5738885","text":"@Override\n\tprotected void steering() {\n\n\t}","title":""},{"docid":"04d0aeb098081b73e97a99da1b060497","score":"0.5738478","text":"@Override\n protected void initialize() {\n }","title":""},{"docid":"fcfbf321ff3e4c56b4e383ce15e49dbb","score":"0.5733936","text":"@Override\r\n\tpublic void obtersaida()\r\n\t{\n\t}","title":""},{"docid":"b14d9313b224be37257260448fc816d3","score":"0.5732729","text":"@Override\n\tpublic void breathes()\n\t{\n\n\t}","title":""},{"docid":"5f8a01420c3b769f848e71ae8c2279bc","score":"0.5732545","text":"@Override\n\tpublic void visitEnd() {\n\t\t\n\t}","title":""},{"docid":"900d30c04323cde584c73c5ffa48d9cf","score":"0.57236737","text":"@Override\n\t\tpublic void visitEnd() {\n\n\t\t}","title":""},{"docid":"5520272328fa400fa18980560e283bbe","score":"0.57178736","text":"private void initialize() {\n\t\t\n\t\t\n\t}","title":""},{"docid":"b143ffd983be4c8f41702b8f934b6f32","score":"0.5713451","text":"@Override\r\n\tpublic void init() {\n\r\n\t}","title":""},{"docid":"b143ffd983be4c8f41702b8f934b6f32","score":"0.5713451","text":"@Override\r\n\tpublic void init() {\n\r\n\t}","title":""},{"docid":"b143ffd983be4c8f41702b8f934b6f32","score":"0.5713451","text":"@Override\r\n\tpublic void init() {\n\r\n\t}","title":""},{"docid":"b143ffd983be4c8f41702b8f934b6f32","score":"0.5713451","text":"@Override\r\n\tpublic void init() {\n\r\n\t}","title":""},{"docid":"9781c90863e9dc9781fafcc4dc828136","score":"0.57127655","text":"public void mo7839l() {\n }","title":""},{"docid":"9781c90863e9dc9781fafcc4dc828136","score":"0.57127655","text":"public void mo7839l() {\n }","title":""},{"docid":"6527effc431dac52b6dba729e0887c97","score":"0.57101613","text":"private Early()\r\n\t{}","title":""}],"string":"[\n {\n \"docid\": \"33d41636b65afa8267c9085dae3d1a2d\",\n \"score\": \"0.69293857\",\n \"text\": \"private void apparence() {\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"05a606445504484958a1c21e14b7198e\",\n \"score\": \"0.6602753\",\n \"text\": \"@Override\\r\\n\\tpublic void sapace() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b5b11f4251ace8b3d0f5ead186f7beb\",\n \"score\": \"0.6506007\",\n \"text\": \"@Override\\n\\tpublic void comer() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8619203d4867f5c6d05eb9a5354405c0\",\n \"score\": \"0.64682996\",\n \"text\": \"@Override\\n\\t\\tpublic void pintate() {\\n\\t\\t\\t\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8619203d4867f5c6d05eb9a5354405c0\",\n \"score\": \"0.64682996\",\n \"text\": \"@Override\\n\\t\\tpublic void pintate() {\\n\\t\\t\\t\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c2fa45ab362625ae567ee8a229630a4\",\n \"score\": \"0.6296283\",\n \"text\": \"@Override\\n\\tprotected void interr() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ffd8193c9cf73515d0f9301b9a7d8817\",\n \"score\": \"0.627647\",\n \"text\": \"@Override\\n\\tpublic void morrer() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10ead2e988bf977cb8edb2bacf974891\",\n \"score\": \"0.6253405\",\n \"text\": \"@Override\\n\\tprotected void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10ead2e988bf977cb8edb2bacf974891\",\n \"score\": \"0.6253405\",\n \"text\": \"@Override\\n\\tprotected void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10ead2e988bf977cb8edb2bacf974891\",\n \"score\": \"0.6253405\",\n \"text\": \"@Override\\n\\tprotected void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10ead2e988bf977cb8edb2bacf974891\",\n \"score\": \"0.6253405\",\n \"text\": \"@Override\\n\\tprotected void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10ead2e988bf977cb8edb2bacf974891\",\n \"score\": \"0.6253405\",\n \"text\": \"@Override\\n\\tprotected void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e49f5db36ca664153e54380025b85d4\",\n \"score\": \"0.62506264\",\n \"text\": \"protected boolean method_21825() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"132ebee1d663aa8e1c0ab776375c437a\",\n \"score\": \"0.62292033\",\n \"text\": \"Support support();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80d20df1cc75d8fa96c12c49a757fc43\",\n \"score\": \"0.614233\",\n \"text\": \"@Override\\n\\tprotected void getExras() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"118f2b8a20f48999973063ac332d07d3\",\n \"score\": \"0.61369824\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void atras() {\\n\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41e50fb9a0b417818374927eb02c67f1\",\n \"score\": \"0.6113139\",\n \"text\": \"protected void mo5608a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"963cb7748259d6cd136153dd9086abb9\",\n \"score\": \"0.6111294\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void Main() {\\n\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f2fe8a59406298fe7e97b543f2bf8186\",\n \"score\": \"0.6088425\",\n \"text\": \"@Override\\r\\n \\tpublic void init() {\\r\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebfe1bb4dd1c0618c0fad36d9f7674b4\",\n \"score\": \"0.6061302\",\n \"text\": \"@Override\\n protected void initialize() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b62a7c8e0bb1090171742c543bf4b253\",\n \"score\": \"0.60608834\",\n \"text\": \"@Override\\n\\tpublic void entrenar() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0cc40600dd2e7cb9f56bd77995e01fc3\",\n \"score\": \"0.60386795\",\n \"text\": \"@Override\\n\\tpublic void Miow() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b941b399a338e8c204f1063e54a94824\",\n \"score\": \"0.6027641\",\n \"text\": \"public void mo7103g() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b941b399a338e8c204f1063e54a94824\",\n \"score\": \"0.6027641\",\n \"text\": \"public void mo7103g() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b941b399a338e8c204f1063e54a94824\",\n \"score\": \"0.6027641\",\n \"text\": \"public void mo7103g() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"689ef8ddcd6ccd288c197d21cadd4bee\",\n \"score\": \"0.59985524\",\n \"text\": \"@Override\\n public final void entertain() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c16c8d1ea4a8c8572e4aa91460503742\",\n \"score\": \"0.5992215\",\n \"text\": \"private void Initalization() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f49ed6756be41155bd7261ea2ff6564b\",\n \"score\": \"0.5991568\",\n \"text\": \"@Override\\n\\t\\t\\t\\tpublic void init() {\\n\\n\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f49ed6756be41155bd7261ea2ff6564b\",\n \"score\": \"0.5991568\",\n \"text\": \"@Override\\n\\t\\t\\t\\tpublic void init() {\\n\\n\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f49ed6756be41155bd7261ea2ff6564b\",\n \"score\": \"0.5991568\",\n \"text\": \"@Override\\n\\t\\t\\t\\tpublic void init() {\\n\\n\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87929e8b046b6fb5c754312beec7ed1c\",\n \"score\": \"0.5984384\",\n \"text\": \"@Override\\n protected void initialize() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87929e8b046b6fb5c754312beec7ed1c\",\n \"score\": \"0.5984384\",\n \"text\": \"@Override\\n protected void initialize() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87929e8b046b6fb5c754312beec7ed1c\",\n \"score\": \"0.5984384\",\n \"text\": \"@Override\\n protected void initialize() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87929e8b046b6fb5c754312beec7ed1c\",\n \"score\": \"0.5984384\",\n \"text\": \"@Override\\n protected void initialize() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87929e8b046b6fb5c754312beec7ed1c\",\n \"score\": \"0.5984384\",\n \"text\": \"@Override\\n protected void initialize() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87929e8b046b6fb5c754312beec7ed1c\",\n \"score\": \"0.5984384\",\n \"text\": \"@Override\\n protected void initialize() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87929e8b046b6fb5c754312beec7ed1c\",\n \"score\": \"0.5984384\",\n \"text\": \"@Override\\n protected void initialize() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87929e8b046b6fb5c754312beec7ed1c\",\n \"score\": \"0.5984384\",\n \"text\": \"@Override\\n protected void initialize() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87929e8b046b6fb5c754312beec7ed1c\",\n \"score\": \"0.5984384\",\n \"text\": \"@Override\\n protected void initialize() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87929e8b046b6fb5c754312beec7ed1c\",\n \"score\": \"0.5984384\",\n \"text\": \"@Override\\n protected void initialize() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87929e8b046b6fb5c754312beec7ed1c\",\n \"score\": \"0.5984384\",\n \"text\": \"@Override\\n protected void initialize() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0adb5f1f1c75684eab047201533dcfe7\",\n \"score\": \"0.59666127\",\n \"text\": \"protected void mo5609b() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d3bf6f2ee77f787007ba6b4021b5721\",\n \"score\": \"0.59598017\",\n \"text\": \"protected void olha()\\r\\n\\t{\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"518a761521ca9f5cb8a8055b32b72cda\",\n \"score\": \"0.5946503\",\n \"text\": \"@Override\\n\\tprotected void initialize() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"518a761521ca9f5cb8a8055b32b72cda\",\n \"score\": \"0.5946503\",\n \"text\": \"@Override\\n\\tprotected void initialize() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"770d423e40bf5782a700bc181e8b8a1e\",\n \"score\": \"0.593603\",\n \"text\": \"@Override\\n\\tvoid init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"770d423e40bf5782a700bc181e8b8a1e\",\n \"score\": \"0.593603\",\n \"text\": \"@Override\\n\\tvoid init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa1a013b1df2f5f1062e1cc971135645\",\n \"score\": \"0.59311134\",\n \"text\": \"@Override\\n\\tpublic void mamar() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab92bad46db05153eb5c2eb626d0c4f9\",\n \"score\": \"0.5922092\",\n \"text\": \"@Override\\n public void init() {\\n\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5783648f118108797828ca2085091ef9\",\n \"score\": \"0.5921263\",\n \"text\": \"@Override\\n protected void initialize() {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"235772828b460a414a66709e6096b938\",\n \"score\": \"0.5920685\",\n \"text\": \"@Override\\r\\n protected void initialize() {\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b2c76cb338654ad1be7624777cf25f2\",\n \"score\": \"0.5906812\",\n \"text\": \"private HelperMethods(){}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67e1a422c8d1e74f6601c8a6d1aaa237\",\n \"score\": \"0.59039515\",\n \"text\": \"@Override\\n\\tpublic void apagar() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e022c47f335a39c6bdb94a0f49a4e940\",\n \"score\": \"0.5896263\",\n \"text\": \"@Override\\r\\n\\tpublic void parar() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5600ed00582d8ca8d293829dcfd6c38\",\n \"score\": \"0.5890996\",\n \"text\": \"private void Syso() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c47723cc77bfdfbeac347959926f9a12\",\n \"score\": \"0.5867715\",\n \"text\": \"@Override\\n protected void initialize() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee560894ec78b1bf45ae9e3ecbdfc890\",\n \"score\": \"0.58612955\",\n \"text\": \"private static void get() {\\n\\n\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"588ab475e29950e8a1944c4a28fe2189\",\n \"score\": \"0.58523136\",\n \"text\": \"public void mo7036d() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"daa5f496c8f0f870f389bb4913bbdc3c\",\n \"score\": \"0.5838995\",\n \"text\": \"public void epingler() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a613dcce17453a8e1eed3b984b6b35b1\",\n \"score\": \"0.5835124\",\n \"text\": \"@Override\\n\\tpublic void composant() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5834005\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5834005\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5834005\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5834005\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5834005\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5834005\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5834005\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c86f446a8bd6af19f88cc011fdf2ffd4\",\n \"score\": \"0.58287174\",\n \"text\": \"public void asustar() {\\n // TODO implement here\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4cc1f71fd505c7eebea6574cd6adc40c\",\n \"score\": \"0.58267677\",\n \"text\": \"@Override\\n\\tpublic void limpar() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e071ca9eec75058b3213adadf2f930b9\",\n \"score\": \"0.5818598\",\n \"text\": \"public final void mo8109b() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8d886581a76c72e11ab317e6cb6e2a8\",\n \"score\": \"0.5817228\",\n \"text\": \"@Override\\r\\n public void rechercher() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80b5722cdc9efe11a305e92ea813ac0f\",\n \"score\": \"0.58067656\",\n \"text\": \"@Override\\r\\n\\tpublic void inter() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"32d0d506f2de2532fe4789f006c84da0\",\n \"score\": \"0.5802741\",\n \"text\": \"@Override\\n\\tpublic void bicar() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27e4479db2c37a2e77fe796119b66d4b\",\n \"score\": \"0.57826626\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void adelante() {\\n\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b4074a0ee84b41daa041fd6441831097\",\n \"score\": \"0.576769\",\n \"text\": \"private Util(){\\n\\t \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f7ae565c79188ee275e5778abe03250\",\n \"score\": \"0.5758817\",\n \"text\": \"@Override\\r\\n\\tprotected void initialize() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0694b71fd24e10a480fa3f3dcd28b3ca\",\n \"score\": \"0.5758213\",\n \"text\": \"public void mo7243j() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0694b71fd24e10a480fa3f3dcd28b3ca\",\n \"score\": \"0.5758213\",\n \"text\": \"public void mo7243j() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f653341cfc7d30c8418e4b72116f7e2\",\n \"score\": \"0.5753499\",\n \"text\": \"public void mo5201a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b044552fe4d8d8225d09361b41fbea3a\",\n \"score\": \"0.57510334\",\n \"text\": \"public void mo5201a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d2f44c3ebe1fb8de1ac4ae677e2d851\",\n \"score\": \"0.57467884\",\n \"text\": \"@Override\\r\\n\\tpublic void dibujar() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d614ed2ee5b3120f5ee8b427542ddc3\",\n \"score\": \"0.5744767\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d614ed2ee5b3120f5ee8b427542ddc3\",\n \"score\": \"0.5744767\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d614ed2ee5b3120f5ee8b427542ddc3\",\n \"score\": \"0.5744767\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2a793cd2e6ec37a2fdb27c90d87a493\",\n \"score\": \"0.5739434\",\n \"text\": \"@Override\\r\\n\\tprotected void initialize() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2a793cd2e6ec37a2fdb27c90d87a493\",\n \"score\": \"0.5739434\",\n \"text\": \"@Override\\r\\n\\tprotected void initialize() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2a793cd2e6ec37a2fdb27c90d87a493\",\n \"score\": \"0.5739434\",\n \"text\": \"@Override\\r\\n\\tprotected void initialize() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8acd985dadc65be1408801664d9b1bad\",\n \"score\": \"0.5738885\",\n \"text\": \"@Override\\n\\tprotected void steering() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04d0aeb098081b73e97a99da1b060497\",\n \"score\": \"0.5738478\",\n \"text\": \"@Override\\n protected void initialize() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fcfbf321ff3e4c56b4e383ce15e49dbb\",\n \"score\": \"0.5733936\",\n \"text\": \"@Override\\r\\n\\tpublic void obtersaida()\\r\\n\\t{\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b14d9313b224be37257260448fc816d3\",\n \"score\": \"0.5732729\",\n \"text\": \"@Override\\n\\tpublic void breathes()\\n\\t{\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f8a01420c3b769f848e71ae8c2279bc\",\n \"score\": \"0.5732545\",\n \"text\": \"@Override\\n\\tpublic void visitEnd() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"900d30c04323cde584c73c5ffa48d9cf\",\n \"score\": \"0.57236737\",\n \"text\": \"@Override\\n\\t\\tpublic void visitEnd() {\\n\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5520272328fa400fa18980560e283bbe\",\n \"score\": \"0.57178736\",\n \"text\": \"private void initialize() {\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b143ffd983be4c8f41702b8f934b6f32\",\n \"score\": \"0.5713451\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b143ffd983be4c8f41702b8f934b6f32\",\n \"score\": \"0.5713451\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b143ffd983be4c8f41702b8f934b6f32\",\n \"score\": \"0.5713451\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b143ffd983be4c8f41702b8f934b6f32\",\n \"score\": \"0.5713451\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9781c90863e9dc9781fafcc4dc828136\",\n \"score\": \"0.57127655\",\n \"text\": \"public void mo7839l() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9781c90863e9dc9781fafcc4dc828136\",\n \"score\": \"0.57127655\",\n \"text\": \"public void mo7839l() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6527effc431dac52b6dba729e0887c97\",\n \"score\": \"0.57101613\",\n \"text\": \"private Early()\\r\\n\\t{}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983785,"cells":{"query_id":{"kind":"string","value":"4661f8a211424449b249c111dc37be4e"},"query":{"kind":"string","value":"This function will visualize the declared dependencies in a graph"},"positive_passages":{"kind":"list like","value":[{"docid":"efb15152ac9e4135f07cb39cb0e7fa3b","score":"0.5758654","text":"private DirectedSparseMultigraph dependencyTreeToGraph() {\n\n\t\tDirectedSparseMultigraph g = new DirectedSparseMultigraph();\n\n\t\tfor (ArrayList<DependantTask> levelarray : ordered) {\n\t\t\tif (levelarray.size() > 0) {\n\t\t\t\tfor (DependantTask task : levelarray) {\n\t\t\t\t\tg.addVertex(task);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (ArrayList<DependantTask> levelarray : ordered) {\n\t\t\tfor (DependantTask task : levelarray) {\n\t\t\t\tfor (DependantTask childtask : task.depends_on_tasks) {\n\t\t\t\t\tg.addEdge(task.name + \" - \" + childtask.name, task, childtask);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn g;\n\n\t}","title":""}],"string":"[\n {\n \"docid\": \"efb15152ac9e4135f07cb39cb0e7fa3b\",\n \"score\": \"0.5758654\",\n \"text\": \"private DirectedSparseMultigraph dependencyTreeToGraph() {\\n\\n\\t\\tDirectedSparseMultigraph g = new DirectedSparseMultigraph();\\n\\n\\t\\tfor (ArrayList<DependantTask> levelarray : ordered) {\\n\\t\\t\\tif (levelarray.size() > 0) {\\n\\t\\t\\t\\tfor (DependantTask task : levelarray) {\\n\\t\\t\\t\\t\\tg.addVertex(task);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (ArrayList<DependantTask> levelarray : ordered) {\\n\\t\\t\\tfor (DependantTask task : levelarray) {\\n\\t\\t\\t\\tfor (DependantTask childtask : task.depends_on_tasks) {\\n\\t\\t\\t\\t\\tg.addEdge(task.name + \\\" - \\\" + childtask.name, task, childtask);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn g;\\n\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"60e2eea778f4f7db4128ccfacc2c1672","score":"0.6612193","text":"public String getDisplayName() {\n\t\treturn \"Dependency Graph\";\n\t}","title":""},{"docid":"03ce15b4ac899659612ccc8517602886","score":"0.6586445","text":"protected void printContainerDependencies() {\n MapIterator<?, HelmChart> it = chartsReferenced.mapIterator();\n try {\n while (it.hasNext()) {\n it.next();\n HelmChart h = it.getValue();\n for (HelmDeploymentContainer c : h.getContainers()) {\n getPrinter().printChartToImageDependency(h, c.getImage());\n }\n }\n } catch (ChartMapException e) {\n logger.error(LOG_FORMAT_2, \"Error printing image dependencies: \", e.getMessage());\n }\n }","title":""},{"docid":"8e562a87ef0b8f07444a0d6ee32aef60","score":"0.64627314","text":"public void printGraph();","title":""},{"docid":"441dc47ee5421e6cf058b1fd89dfb1bd","score":"0.64369416","text":"public void printGraph(){\n\t}","title":""},{"docid":"8fa9a2cef67dd08de3445741218e0c6d","score":"0.64160943","text":"public interface DependencyGraphBuilder {\n\n\t/**\n\t * Build the dependency graph\n\t * \n\t * @param artifacts\n\t * a set of artifacts to use as starting points when building the\n\t * graph\n\t * @param perNodeColouring\n\t * set to true to colour nodes by group from a fixed palette,\n\t * cycling if there are more groups than entries in the palette\n\t * @param showGroupsAsCluster\n\t * set to true to force artifacts in the same group to be\n\t * clustered in the graph\n\t * @param compactClusters\n\t * set to true to only show clusters with direct artifact\n\t * children, false to show all clusters leading to an artifact\n\t * @param removeTransitiveDependencies\n\t * set to true to remove any direct dependencies which are\n\t * entirely implied by (mandatory) transitive dependencies\n\t * @param showOptionalDependencies\n\t * set to true to show optional dependencies between artifacts in\n\t * the graph as dotted lines, false to not show them at all\n\t * @param convergeSystemArtifacts\n\t * set to true to force any dependencies on an artifact with a\n\t * corresponding system artifact to use the system artifact\n\t * instead\n\t * @param excludedArtifacts\n\t * a set of artifacts which should act as 'stop' conditions in\n\t * the dependency graph and which will not be included in the\n\t * result. These may be mandatory dependencies that are removed\n\t * from the visualisation to produce a cleaner layout,\n\t * particularly the case for logging and similar APIs where\n\t * almost all artifacts will have a dependency on them. Use null\n\t * to use the default set of excluded artifacts defined in the\n\t * application context for this bean, or an empty set to\n\t * explicitly assert that there should be no exclusions\n\t * @return a dot format string which can be rendered to show dependency\n\t * information\n\t */\n\tString getDependencyGraph(Set<ArtifactIdentifier> artifacts,\n\t\t\tboolean perNodeColouring, boolean showGroupsAsCluster,\n\t\t\tboolean compactClusters, boolean removeTransitiveDependencies,\n\t\t\tboolean showOptionalDependencies, boolean convergeSystemArtifacts,\n\t\t\tSet<ArtifactIdentifier> excludedArtifacts);\n\n}","title":""},{"docid":"041f8b142ca631748532f07d3dc637a0","score":"0.6306204","text":"public interface DependencyGraphs {\n\n /**\n * Returns the compile dependency graph.\n */\n @NonNull\n List<GraphItem> getCompileDependencies();\n\n /**\n * Returns the package dependency graph.\n *\n * Only valid in full dependency mode.\n */\n @NonNull\n List<GraphItem> getPackageDependencies();\n\n /**\n * Returns the list of provided libraries.\n *\n * The values in the list match the values returned by {@link GraphItem#getArtifactAddress()}\n * and {@link Library#getArtifactAddress()}.\n *\n * Only valid in full dependency mode.\n */\n @NonNull\n List<String> getProvidedLibraries();\n\n /**\n * Returns the list of skipped libraries.\n *\n * The values in the list match the values returned by {@link GraphItem#getArtifactAddress()}\n * and {@link Library#getArtifactAddress()}.\n *\n * Only valid in full dependency mode.\n */\n @NonNull\n List<String> getSkippedLibraries();\n\n}","title":""},{"docid":"5935d44d63530c0f7212162f5fb40dea","score":"0.62563044","text":"public void showGraph() {\n\r\n\t}","title":""},{"docid":"b00f5ce6b7cfdf3f03e70961e9e79644","score":"0.6031264","text":"String getDependencyGraph(Set<ArtifactIdentifier> artifacts,\n\t\t\tboolean perNodeColouring, boolean showGroupsAsCluster,\n\t\t\tboolean compactClusters, boolean removeTransitiveDependencies,\n\t\t\tboolean showOptionalDependencies, boolean convergeSystemArtifacts,\n\t\t\tSet<ArtifactIdentifier> excludedArtifacts);","title":""},{"docid":"185fd57fd49b5f0f257d6618ec2f4bee","score":"0.59732175","text":"protected void printChartDependencies(HelmChart parent) {\n try {\n if (parent.getNameFull().equals(chart.getNameFull())) {\n getPrinter().printSectionHeader(\"Chart Dependencies\");\n }\n if (parent.getDiscoveredDependencies() != null) {\n // Print the chart to chart dependencies recursively\n boolean stable = isStable(parent, false); // check if the parent chart is stable\n for (HelmChart dependent : parent.getDiscoveredDependencies()) {\n if (!chartsDependenciesPrinted.contains(parent.getNameFull() + \"_\" + dependent.getNameFull())) {\n getPrinter().printChartToChartDependency(parent, dependent);\n // if the parent is stable and the child is not then print a message if verbose\n if (stable && !isStable(dependent, true) && isVerbose()) {\n getPrinter().printComment(\"WARNING: Chart \" + parent.getNameFull() + \" is stable but depends on \"\n + dependent.getNameFull() + \" which may not be stable\");\n }\n chartsDependenciesPrinted.add(parent.getNameFull() + \"_\" + dependent.getNameFull());\n }\n printChartDependencies(dependent); // recursion\n }\n }\n } catch (ChartMapException e) {\n logger.error(LOG_FORMAT_2, \"Error printing chart dependencies: \", e.getMessage());\n }\n }","title":""},{"docid":"576028e47a9ee601b7ba73ac08fb0929","score":"0.59556407","text":"public void transitiveClosure() {\n for (int i = 0; i < noOfVertices; i++) {\n dfsUtil(i, i);\n }\n for (int i = 0; i < noOfVertices; i++) {\n System.out.println(Arrays.toString(tc[i]));\n }\n }","title":""},{"docid":"9bd86d40237894b9577d526cb7e26154","score":"0.59263074","text":"public void printGraph(){\n\tSystem.out.println(\"Graph:\");\n\toriginal.printGraph();\n\tSystem.out.print('\\n');\n }","title":""},{"docid":"b417986662defe2cdec7d06aa9b48efc","score":"0.5870137","text":"private DirectedSparseMultigraph dependencyTreeToSimpleGraph() {\n\n\t\tDirectedSparseMultigraph g = new DirectedSparseMultigraph();\n\n\t\tHashMap<Class, HashMap<Class, Integer>> classmap = new HashMap<>();\n\n\t\tfor (ArrayList<DependantTask> levelarray : ordered) {\n\t\t\tif (levelarray.size() > 0) {\n\t\t\t\tfor (DependantTask task : levelarray) {\n\n\t\t\t\t\tHashMap<Class, Integer> classconnectionsmap;\n\t\t\t\t\tclassconnectionsmap = classmap.get(task.getClass());\n\n\t\t\t\t\tif (classconnectionsmap == null) {\n\t\t\t\t\t\tclassconnectionsmap = new HashMap<>();\n\t\t\t\t\t\tclassmap.put(task.getClass(), classconnectionsmap);\n\t\t\t\t\t}\n\t\t\t\t\tfor (DependantTask childtask : task.depends_on_tasks) {\n\t\t\t\t\t\tInteger classconnections;\n\t\t\t\t\t\tclassconnections = classconnectionsmap.get(childtask.getClass());\n\n\t\t\t\t\t\tif (classconnections == null) {\n\t\t\t\t\t\t\tclassconnectionsmap.put(childtask.getClass(), 1);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tclassconnectionsmap.put(childtask.getClass(), classconnections + 1);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (Map.Entry<Class, HashMap<Class, Integer>> vertice : classmap.entrySet()) {\n\t\t\tg.addVertex(general.getClassShortName(vertice.getKey()));\n\t\t}\n\n\t\tfor (Map.Entry<Class, HashMap<Class, Integer>> vertice : classmap.entrySet()) {\n\n\t\t\tfor (Map.Entry<Class, Integer> edge : vertice.getValue().entrySet()) {\n\t\t\t\tEdgeName edgename = new EdgeName(edge.getValue().toString());\n\t\t\t\tg.addEdge(edgename, general.getClassShortName(edge.getKey()), general.getClassShortName(vertice.getKey()));\n\t\t\t}\n\n\t\t}\n\t\treturn g;\n\n\t}","title":""},{"docid":"5f3d8496a8dd23c4aeaaf7e796a8d836","score":"0.5802345","text":"@SuppressWarnings({ \"OverlyNestedMethod\" })\n private void writeDotDependencies(Map<Node, List<Dependency>> dependencies, Collection<String> lines) throws IOException\n {\n Set<Node> set = dependencies.keySet();\n Collection<String> resultSet = new HashSet<String>();\n\n for (Object aSet : set)\n {\n Dependency theNode = (Dependency) aSet;\n\n if (theNode instanceof NodeWithDependancies)\n {\n if (theNode.shouldPrint(preferences))\n {\n NodeWithDependancies node = (NodeWithDependancies) theNode;\n String niceName = node.getNiceName();\n List<Dependency> dependentNodes = node.getDepends();\n\n for (Dependency dependantNode : dependentNodes)\n {\n if (dependantNode.getName() != null)\n {\n String dependantNodeNiceName = dependantNode.getNiceName();\n String dependencyExtraInfo = dependantNode.getDependencyExtraInfo();\n\n if (dependantNode.shouldPrint(preferences))\n {\n String line = \"\\t\\t\" + niceName + \" -> \" + dependantNodeNiceName + dependencyExtraInfo + ';';\n\n resultSet.add(line);\n }\n }\n }\n }\n }\n } // end for\n\n for (Object aResultSet : resultSet)\n {\n String line = (String) aResultSet;\n\n lines.add(line);\n }\n }","title":""},{"docid":"e47b7bda3565647d2a2b42b51d209143","score":"0.578766","text":"@Test\n public void generateGraphVizFile() {\n try (ScanResult scanResult = new ClassGraph().whitelistPackages(ROOT_PACKAGE).enableAllInfo().scan()) {\n final String dotFile = scanResult.getAllClasses().generateGraphVizDotFile(20, 20);\n assertThat(dotFile).contains(\"\\\"\" + ClsSub.class.getName() + \"\\\" -> \\\"\" + Cls.class.getName() + \"\\\"\");\n }\n }","title":""},{"docid":"304672154962f14c6ccce71aace2e2a2","score":"0.5732783","text":"private void checkFeatureDependencies(\r\n\t\t\tDirectedGraph<DependencyNode, ValueContainerEdge<ConfigSet>> dependencyGraph) {\r\n\t\tSet<FeatureDependency> featureDependencySet = new HashSet<FeatureDependency>();\r\n\t\t\r\n\t\tSet<DependencyNode> sourceVertexSet = dependencyGraph.vertexSet();\r\n\t\tfor (DependencyNode srcNode : sourceVertexSet) {\r\n\r\n\t\t\tif (!srcNode.isInSelection()) {\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\tKShortestPaths<DependencyNode, ValueContainerEdge<ConfigSet>> shortestPaths = new KShortestPaths<DependencyNode, ValueContainerEdge<ConfigSet>>(dependencyGraph, srcNode, MAX_PATHS);\r\n\t\t\tSet<DependencyNode> targetVertexSet = dependencyGraph.vertexSet();\r\n\t\t\tfor (DependencyNode tgtNode : targetVertexSet) {\r\n\t\t\t\t\r\n\t\t\t\tif (tgtNode.equals(srcNode)) { // || tgtNode.getConfigSet().isTrueSet()) {\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tList<GraphPath<DependencyNode, ValueContainerEdge<ConfigSet>>> paths = shortestPaths.getPaths(tgtNode);\r\n\t\t\t\t// If no paths between the nodes were found, then just move on to the next pair of nodes.\r\n\t\t\t\tif (paths == null) {\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tfor (GraphPath<DependencyNode, ValueContainerEdge<ConfigSet>> path : paths) {\r\n\t\t\t\t\tConfigSet configAccumulator = null;\r\n\t\t\t\t\tList<ValueContainerEdge<ConfigSet>> edgeList = path.getEdgeList();\r\n\t\t\t\t\tfor (ValueContainerEdge<ConfigSet> edge : edgeList) {\r\n\t\t\t\t\t\tConfigSet value = edge.getValue();\r\n\t\t\t\t\t\tif (configAccumulator == null) {\r\n\t\t\t\t\t\t\tconfigAccumulator = value;\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\tconfigAccumulator = configAccumulator.and(value);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tint startLine = srcNode.getPosition().getStartLine() - 1;\r\n\t\t\t\t\tString message = null;\r\n\t\t\t\t\ttry {\r\n\t\t\t\t\t\tIDocument document = getDocument(srcNode.getPosition().getFilePath());\r\n\t\t\t\t\t\tmessage = document.get(document.getLineOffset(startLine), document.getLineLength(startLine)).toString().trim();\r\n\t\t\t\t\t\tmessage = document.get(document.getLineOffset(startLine), document.getLineLength(startLine)).toString().trim();\r\n\t\t\t\t\t} catch (BadLocationException e) {\r\n\t\t\t\t\t\te.printStackTrace();\r\n\t\t\t\t\t\tmessage = \"Unknown\";\r\n\t\t\t\t\t} catch (CoreException e) {\r\n\t\t\t\t\t\te.printStackTrace();\r\n\t\t\t\t\t\tmessage = \"Unknown\";\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n//\t\t\t\t\t\tif (!configAccumulator.isValid())\r\n//\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\r\n\t\t\t\t\tFeatureDependency auxFeature = new FeatureDependency()\r\n\t\t\t\t\t\t\t.setFile(ResourceUtil.getIFile(tgtNode.getPosition().getFilePath()))\r\n\t\t\t\t\t\t\t.setFeature(tgtNode.getFeatureSet()\r\n\t\t\t\t\t\t\t.toString())\r\n\t\t\t\t\t\t\t.setLineNumber(tgtNode.getPosition().getStartLine())\r\n\t\t\t\t\t\t\t.setMessage(message)\r\n\t\t\t\t\t\t\t.setConfiguration(configAccumulator);\r\n\t\t\t\t\t\r\n\t\t\t\t\t/*\r\n\t\t\t\t\t * Do not create an IMarker if an equivalent FeatureDependency already exists.\r\n\t\t\t\t\t */\r\n\t\t\t\t\tif (!featureDependencySet.add(auxFeature)){\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\t/*\r\n\t\t\t\t\t * If the IMarker could not be created, remove the corresponding\r\n\t\t\t\t\t * FeatureDependency from the set.\r\n\t\t\t\t\t */\r\n\t\t\t\t\tIMarker createdMarker = EmergoMarker.createMarker(auxFeature);\r\n\t\t\t\t\tif (createdMarker == null) {\r\n\t\t\t\t\t\tfeatureDependencySet.remove(auxFeature);\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\t/*\r\n\t\t\t\t\t * Store a mapping for each created marker to a corresponding graph\r\n\t\t\t\t\t * that represent a \"dependency path\". \r\n\t\t\t\t\t * \r\n\t\t\t\t\t * TODO: There may exist more than on dependency path for 2 given\r\n\t\t\t\t\t * nodes. How can this be represented/shown to the user?\r\n\t\t\t\t\t */\r\n\t\t\t\t\tif (dependencyGraphMapping.get(createdMarker) == null) {\r\n\t\t\t\t\t\tDirectedGraph<DependencyNode, ValueContainerEdge<ConfigSet>> pathAsGraph = new DirectedMultigraph<DependencyNode, ValueContainerEdge<ConfigSet>>((Class<? extends ValueContainerEdge<ConfigSet>>) ValueContainerEdge.class);\r\n\t\t\t\t\t\tfor (ValueContainerEdge<ConfigSet> edge : edgeList) {\r\n\t\t\t\t\t\t\tDependencyNode edgeSource = dependencyGraph.getEdgeSource(edge);\r\n\t\t\t\t\t\t\tDependencyNode edgeTarget = dependencyGraph.getEdgeTarget(edge);\r\n\t\t\t\t\t\t\tpathAsGraph.addVertex(edgeSource);\r\n\t\t\t\t\t\t\tpathAsGraph.addVertex(edgeTarget);\r\n\t\t\t\t\t\t\tpathAsGraph.addEdge(edgeSource, edgeTarget).setValue(edge.getValue());\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tdependencyGraphMapping.put(createdMarker, pathAsGraph);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tupdateTree();\r\n\t}","title":""},{"docid":"a4d1663dc1194323d828e3e4051986ff","score":"0.5696503","text":"public void printGraph(){\r\n StdDraw.clear();\r\n Range xx = findRangeX();\r\n Range yy = findRangeY();\r\n double rightScaleX = ((xx.get_max()-xx.get_min())*0.04);\r\n double rightScaleY = ((yy.get_max()-yy.get_min())*0.04);\r\n StdDraw.setPenColor(Color.BLUE);\r\n StdDraw.setPenRadius(0.15);\r\n DGraph d = this.graph;\r\n if(d!=null) {\r\n Iterator it = d.getV().iterator();\r\n while (it.hasNext()) {\r\n node_data temp = (node_data)it.next();\r\n Point3D p = temp.getLocation();\r\n StdDraw.filledCircle(p.x(), p.y(),rightScaleX*0.2);\r\n StdDraw.text(p.x(), p.y() +rightScaleX*0.3, \"\" + temp.getKey());\r\n }\r\n StdDraw.setPenColor(Color.BLACK);\r\n StdDraw.setPenRadius(0.003);\r\n Iterator it1 = d.getV().iterator();\r\n while(it1.hasNext()){\r\n node_data temp1 = (node_data)it1.next();\r\n if(d.getE(temp1.getKey())!=null){\r\n Iterator it2 = d.getE(temp1.getKey()).iterator();\r\n while(it2.hasNext()){\r\n edge_data temp2 = (edge_data)it2.next();\r\n if(temp2!=null){\r\n StdDraw.setPenRadius(0.003);\r\n StdDraw.setPenColor(Color.RED);\r\n double weight = temp2.getWeight();\r\n node_data srcNode = d.getNode(temp2.getSrc());\r\n node_data dstNode = d.getNode(temp2.getDest());\r\n Point3D srcP = srcNode.getLocation();\r\n Point3D dstP = dstNode.getLocation();\r\n StdDraw.line(srcP.x(), srcP.y(), dstP.x(), dstP.y());\r\n\r\n double x = 0.2*srcP.x()+0.8*dstP.x();\r\n double y = 0.2*srcP.y() + 0.8*dstP.y();\r\n StdDraw.setPenColor(Color.BLACK);\r\n StdDraw.text(x,y, \"\" + weight);\r\n\r\n StdDraw.setPenColor(Color.YELLOW);\r\n StdDraw.setPenRadius(0.15);\r\n double x1 = 0.1*srcP.x()+0.9*dstP.x();\r\n double y1 = 0.1*srcP.y()+0.9*dstP.y();\r\n StdDraw.filledCircle(x1,y1,rightScaleX*0.2);\r\n\r\n }\r\n\r\n }\r\n }\r\n }\r\n\r\n }\r\n\r\n }","title":""},{"docid":"a574f9962a4ed7b55a834d59ef23e357","score":"0.5694189","text":"@Override\n public boolean calculateDependencies(GoalGraph graph, Collection<ModelGoal> dependencies) {\n ModelPath parent = getPath().getParent();\n if (parent != null) {\n // TODO - should be >= self closed\n dependencies.add(graph.nodeAtState(new NodeAtState(parent, SelfClosed)));\n }\n return true;\n }","title":""},{"docid":"e2cb57c172551e2674c99427c4e1f66e","score":"0.56772953","text":"private void constructDependencyGraph() {\n MainApplication app = MainApplication.getApplication();\n ObjectGraph graph = app.getObjectGraph();\n graph.inject(this);\n }","title":""},{"docid":"262927d946992e92de597ce20f6f5d73","score":"0.5647745","text":"@NonNull\n List<GraphItem> getCompileDependencies();","title":""},{"docid":"d2d1f50510c77dfd5aa9477264bb7ab1","score":"0.56253284","text":"public void printGraph() {\n\n if(vertexMap == null || vertexMap.size() <= 0) {\n System.out.println(\"The network is currently empty, there are no vertices or edges.\");\n }\n else {\n for(Vertex v : vertexMap.values()) {\n String vertexName = v.name.substring(0, 1).toUpperCase() + v.name.substring(1);\n System.out.print(vertexName);\n\n // Indicate that the vertex is down.\n if(v.status == false) {\n System.out.print(\" DOWN\");\n }\n\n Collections.sort(v.adj, new EdgeComparator());\n\n for(Edge e : v.adj) {\n String edgeName = e.dest.name.substring(0, 1).toUpperCase() + e.dest.name.substring(1);\n System.out.print(\"\\n \" + edgeName + \" \" + e.dist);\n if(!e.status) { System.out.print(\" DOWN\"); }\n }\n System.out.print(\"\\n\");\n }\n }\n\n }","title":""},{"docid":"8c10f88f51d106725a0d7b3319855da5","score":"0.5616498","text":"public void determineOrder ()\n {\n for (EquationSet p : parts) p.determineOrder ();\n\n // Reset variables for analysis\n ordered = new ArrayList<Variable> ();\n for (Variable v : variables)\n {\n v.before = new ArrayList<Variable> ();\n v.priority = 0;\n }\n\n // Determine order constraints for each variable separately\n for (Variable v : variables) v.setBefore (false);\n\n // Assign depth in dependency tree, processing variables with the most ordering constraints first\n PriorityQueue<Variable> queueDependency = new PriorityQueue<Variable> (variables.size (), new Comparator<Variable> ()\n {\n public int compare (Variable a, Variable b)\n {\n return b.before.size () - a.before.size ();\n }\n });\n queueDependency.addAll (variables);\n for (Variable v = queueDependency.poll (); v != null; v = queueDependency.poll ())\n {\n v.setPriority (1, null);\n }\n\n // Assemble dependency tree into flat list\n PriorityQueue<Variable> queuePriority = new PriorityQueue<Variable> (variables.size (), new Comparator<Variable> ()\n {\n public int compare (Variable a, Variable b)\n {\n return a.priority - b.priority;\n }\n });\n queuePriority.addAll (variables);\n for (Variable v = queuePriority.poll (); v != null; v = queuePriority.poll ())\n {\n ordered.add (v);\n }\n\n // Tag any circular dependencies\n int count = ordered.size ();\n for (int index = 0; index < count; index++)\n {\n Variable v = ordered.get (index);\n if (v.uses == null) continue;\n for (Variable u : v.uses.keySet ())\n {\n if ( u.container == this // must be in same equation set for order to matter\n && ! (u.name.equals (v.name) && u.order == v.order + 1) // must not be my derivative\n && ! u.hasAttribute (\"temporary\") // temporaries follow the opposite rule on ordering, so don't consider them here\n && ordered.indexOf (u) < index) // and finally, is it actually ahead of me in the ordering?\n {\n Backend.err.get ().println (\"Cyclic dependency: \" + v.name + \" comes after \" + u.name);\n u.addAttribute (\"cycle\"); // must be buffered; otherwise we will get the \"after\" value rather than \"before\"\n }\n }\n }\n }","title":""},{"docid":"b71c5f23431bc2d83d819d31e8b9c3b5","score":"0.5603539","text":"public void display()\n {\n adjacencyList();\n }","title":""},{"docid":"cde971178cdd7862e1463014d20372f4","score":"0.55866975","text":"public void printGraph() {\n for (IR.Reg node : undirectedGraph.keySet()) {\n System.out.print(\"\\nNode: \" + node.toString() + \"\\n\");\n System.out.print(\"[\");\n IR.Reg[] temp = undirectedGraph.get(node).toArray(new IR.Reg[undirectedGraph.get(node).size()]);\n int counter = 1;\n for (IR.Reg o : temp) {\n if (counter < temp.length) {\n System.out.print(o.toString() + \", \");\n counter++;\n } else {\n System.out.print(o.toString());\n }\n }\n System.out.println(\"]\");\n }\n }","title":""},{"docid":"dc7f88f0a0946ab0032138ed0eff5919","score":"0.55850077","text":"public static void main(String[] args) {\r\n System.out.println(DEPENDENT.toPrettyString());\r\n }","title":""},{"docid":"b84f8c3c4b1bd1841e87b2e997844fd4","score":"0.55669796","text":"public String getUrlName() {\n\t\treturn \"DependencyGraph\";\n\t}","title":""},{"docid":"9b318aab6ae79d05f92a2ab47ebb35fd","score":"0.5566077","text":"public void printGraph() {\n\n for (int v = 0; v < this.V; v++) {\n System.out.println(\"Adjacency list of vertex \" + v);\n System.out.print(\"head\");\n for (adjListNode pCrawl : this.adjListArray[v]) {\n System.out.print(\"---> \" + pCrawl.getV() + \" , weight: \" + pCrawl.getWeight());\n }\n System.out.println(\"\\n\");\n }\n }","title":""},{"docid":"f0b0cccdd2c3f3dd79195dc9ec320edc","score":"0.55632764","text":"@Override\n\tpublic String toString() {\n\treturn this.getName_dep();\n\t}","title":""},{"docid":"09035c76b72fd7271f2c80eccfa41bf4","score":"0.556043","text":"public boolean calculateDependencies(GoalGraph graph, Collection<ModelGoal> dependencies) {\n return true;\n }","title":""},{"docid":"15c31df2f928a422cba806eff9de3cb0","score":"0.55582106","text":"void printInterdependency(ArrayList<Node> networkA, ArrayList<Node> networkB){\n\t\t\n\t\ttry{\n\t\t\tPrintStream ps = new PrintStream(\"test-dependency.txt\");\n\t\t\t\n\t\t\tps.println(\"Network A: \");\n\t\t\tfor (int i = 0; i < networkA.size(); i++){\n\t\t\t\tps.print(\"[\" + networkA.get(i).getIndex() + \"]\" + \": \");\n\t\t\t\tps.println(networkA.get(i).getDependency());\n\t\t\t}\n\t\t\tps.println();\n\t\t\t\n\t\t\tps.println(\"Network B: \");\n\t\t\tfor (int i = 0; i < networkA.size(); i++){\n\t\t\t\tps.print(\"[\" + networkB.get(i).getIndex() + \"]\" + \": \");\n\t\t\t\tps.println(networkB.get(i).getDependency());\n\t\t\t}\n\t\t\t\n\t\t\tps.close();\n\t\t\t\n\t\t}\n\t\tcatch (FileNotFoundException e){\n\t\t\te.printStackTrace();\n\t\t}\n\t\t\n\t}","title":""},{"docid":"51efb8ac197d35312ca578b36ba46c1f","score":"0.554977","text":"private void adjacencyList()\n {\n Iterator<DSAGraphNode<E> > iter = nodes.iterator();\n\n System.out.println(\"\\n\");\n while(iter.hasNext())\n {\n DSAGraphNode<E> node = iter.next();\n System.out.print(node.getLabel() +\": \");\n node.display();\n }\n }","title":""},{"docid":"d42d2a47be1b2ac305e7ac97d2ee440c","score":"0.5548519","text":"public static void main(String[] args) throws NullPointerException {\n ListenableGraph<String, SetInfo> graph =\r\n new ListenableDirectedGraph<String, SetInfo>(\r\n SetInfo.class);\r\n \r\n Scanner input = new Scanner(System.in);\r\n\r\n // create a visualization using JGraph, via an adapter\r\n //jgxAdapter = new JGraphXAdapter<String, SetInfo>(graph);\r\n\r\n String Edinburgh = \"Edinburgh\";\r\n String Heathrow = \"Heathrow\";\r\n String Amsterdam = \"Amsterdam\";\r\n String Boston = \"Boston\";\r\n String Chicago = \"Chicago\";\r\n String Montreal = \"Montreal\";\r\n String Toronto = \"Toronto\";\r\n String New_Delhi = \"New_Delhi\";\r\n String Shanghai = \"Shanghai\";\r\n String Hong_Kong = \"Hong_Kong\";\r\n \r\n graph.addVertex(Edinburgh);\r\n graph.addVertex(Heathrow);\r\n graph.addVertex(Amsterdam);\r\n graph.addVertex(Boston);\r\n graph.addVertex(Chicago);\r\n graph.addVertex(Montreal);\r\n graph.addVertex(Toronto);\r\n graph.addVertex(New_Delhi);\r\n graph.addVertex(Shanghai);\r\n graph.addVertex(Hong_Kong);\r\n \r\n SetInfo e1 = new SetInfo(\"BK780\", 1030, 1130, 0130, 110);graph.addEdge(\"Edinburgh\", \"Heathrow\", e1);\r\n SetInfo e2 = new SetInfo(\"AL901\", 1030, 1530, 0230, 230);graph.addEdge(\"Heathrow\", \"Boston\", e2);\r\n SetInfo e3 = new SetInfo(\"NM198\", 1800, 1930, 0130, 100);graph.addEdge(\"Boston\", \"Montreal\", e3);\r\n SetInfo e4 = new SetInfo(\"BT986\", 2200, 2330, 0130, 90);graph.addEdge(\"Montreal\", \"Toronto\", e4);\r\n SetInfo e5 = new SetInfo(\"JI116\", 0700, 1000, 0300, 100);graph.addEdge(\"Heathrow\", \"Amsterdam\", e5);\r\n SetInfo e6 = new SetInfo(\"TY7309\", 1000, 1400, 0400, 150);graph.addEdge(\"Boston\", \"Chicago\", e6);\r\n SetInfo e7 = new SetInfo(\"VO664\", 1900, 2130, 0230, 560);graph.addEdge(\"Edinburgh\", \"Chicago\", e7);\r\n SetInfo e8 = new SetInfo(\"EQ387\", 1100, 1430, 0330, 430);graph.addEdge(\"New_Delhi\", \"Shanghai\", e8);\r\n SetInfo e9 = new SetInfo(\"UI690\", 2000, 2337, 0337, 230);graph.addEdge(\"Shanghai\", \"Hong_Kong\", e9);\r\n \r\n System.out.println(\"Please enter the first airport\");\r\n String vertex1 = input.next();\r\n System.out.println(\"Please enter the second airport\");\r\n String vertex2 = input.next();\r\n System.out.println();\r\n System.out.println(\"Leg Leave At On Arrive At\");\r\n\t \r\n int i = 1;\r\n int totalCost = 0;\r\n int totalHour = 0;\r\n int totalMinute = 0;\r\n if(vertex1 != null && vertex2 != null){\r\n List<SetInfo> shortest_path = DijkstraShortestPath.findPathBetween(graph, vertex1, vertex2);\r\n for(SetInfo s : shortest_path){\r\n if(s == e1){\r\n \t System.out.print(i + \". \");\r\n \t System.out.printf(\"%-10.10s %-10.10s %-10.10s %-10.10s %-10.10s\", \r\n \t\t\t Edinburgh, e1.getDeparture(), e1.getFlight(), Heathrow, e1.getArrival());\r\n \t totalCost = totalCost + e1.getTicket();\r\n \t int e1Hour = e1.setHour(e1.getFlightDuration());\r\n \t int e1Minute = e1.setMinute(e1.getFlightDuration());\r\n \t totalHour = totalHour + e1Hour;\r\n \t totalMinute = totalMinute + e1Minute;\r\n }\r\n if(s == e2){\r\n \t System.out.print(i + \". \");\r\n \t System.out.printf(\"%-10.10s %-10.10s %-10.10s %-10.10s %-10.10s\", \r\n \t\t\t Heathrow, e2.getDeparture(), e2.getFlight(), Boston, e2.getArrival());\r\n \t totalCost = totalCost + e2.getTicket();\r\n \t int e2Hour = e2.setHour(e2.getFlightDuration());\r\n \t int e2Minute = e2.setMinute(e2.getFlightDuration());\r\n \t totalHour = totalHour + e2Hour;\r\n \t totalMinute = totalMinute + e2Minute;\r\n }\r\n if(s == e3){\r\n \t System.out.print(i + \". \");\r\n \t System.out.printf(\"%-10.10s %-10.10s %-10.10s %-10.10s %-10.10s\", \r\n \t\t\t Boston, e3.getDeparture(), e3.getFlight(), Montreal, e3.getArrival());\r\n \t totalCost = totalCost + e3.getTicket();\r\n \t int e3Hour = e3.setHour(e3.getFlightDuration());\r\n \t int e3Minute = e3.setMinute(e3.getFlightDuration());\r\n \t totalHour = totalHour + e3Hour;\r\n \t totalMinute = totalMinute + e3Minute;\r\n }\r\n if(s == e4){\r\n \t System.out.print(i + \". \");\r\n \t System.out.printf(\"%-10.10s %-10.10s %-10.10s %-10.10s %-10.10s\", \r\n \t\t\t Montreal, e4.getDeparture(), e4.getFlight(), Toronto, e4.getArrival());\r\n \t totalCost = totalCost + e4.getTicket();\r\n \t int e4Hour = e4.setHour(e4.getFlightDuration());\r\n \t int e4Minute = e4.setMinute(e4.getFlightDuration());\r\n \t totalHour = totalHour + e4Hour;\r\n \t totalMinute = totalMinute + e4Minute;\r\n }\r\n if(s == e5){\r\n \t System.out.print(i + \". \");\r\n \t System.out.printf(\"%-10.10s %-10.10s %-10.10s %-10.10s %-10.10s\", \r\n \t\t\t Heathrow, e5.getDeparture(), e5.getFlight(), Amsterdam, e5.getArrival());\r\n \t totalCost = totalCost + e5.getTicket();\r\n \t int e5Hour = e5.setHour(e5.getFlightDuration());\r\n \t int e5Minute = e5.setMinute(e5.getFlightDuration());\r\n \t totalHour = totalHour + e5Hour;\r\n \t totalMinute = totalMinute + e5Minute;\r\n }\r\n if(s == e6){\r\n \t System.out.print(i + \". \");\r\n \t System.out.printf(\"%-10.10s %-10.10s %-10.10s %-10.10s %-10.10s\", \r\n \t\t\t Boston, e6.getDeparture(), e6.getFlight(), Chicago, e6.getArrival());\r\n \t totalCost = totalCost + e6.getTicket();\r\n \t int e6Hour = e6.setHour(e6.getFlightDuration());\r\n \t int e6Minute = e6.setMinute(e6.getFlightDuration());\r\n \t totalHour = totalHour + e6Hour;\r\n \t totalMinute = totalMinute + e6Minute;\r\n }\r\n if(s == e7){\r\n \t System.out.print(i + \". \");\r\n \t System.out.printf(\"%-10.10s %-10.10s %-10.10s %-10.10s %-10.10s\", \r\n \t\t\t Edinburgh, e7.getDeparture(), e7.getFlight(), Chicago, e7.getArrival());\r\n \t totalCost = totalCost + e7.getTicket();\r\n \t int e7Hour = e7.setHour(e7.getFlightDuration());\r\n \t int e7Minute = e7.setMinute(e7.getFlightDuration());\r\n \t totalHour = totalHour + e7Hour;\r\n \t totalMinute = totalMinute + e7Minute;\r\n }\r\n if(s == e8){\r\n \t System.out.print(i + \". \");\r\n \t System.out.printf(\"%-10.10s %-10.10s %-10.10s %-10.10s %-10.10s\", \r\n \t\t\t New_Delhi, e8.getDeparture(), e8.getFlight(), Shanghai, e8.getArrival());\r\n \t totalCost = totalCost + e8.getTicket();\r\n \t int e8Hour = e8.setHour(e8.getFlightDuration());\r\n \t int e8Minute = e8.setMinute(e8.getFlightDuration());\r\n \t totalHour = totalHour + e8Hour;\r\n \t totalMinute = totalMinute + e8Minute;\r\n }\r\n if(s == e9){\r\n \t System.out.print(i + \". \");\r\n \t System.out.printf(\"%-10.10s %-10.10s %-10.10s %-10.10s %-10.10s\", \r\n \t\t\t Shanghai, e9.getDeparture(), e9.getFlight(), Hong_Kong, e9.getArrival());\r\n \t totalCost = totalCost + e9.getTicket();\r\n \t int e9Hour = e9.setHour(e9.getFlightDuration());\r\n \t int e9Minute = e9.setMinute(e9.getFlightDuration());\r\n \t totalHour = totalHour + e9Hour;\r\n \t totalMinute = totalMinute + e9Minute;\r\n }\r\n i++;\r\n System.out.println();\r\n }\r\n System.out.printf(\"Total cost of the journy = £\"\r\n \t\t+ \"%s\", totalCost);\r\n }\r\n if(totalMinute<60)\r\n \tSystem.out.printf(\"\\nTotal time in the air = %s%shrs\", totalHour, totalMinute);\r\n else if(totalMinute>=60){\r\n \ttotalHour = totalHour + 1;\r\n \ttotalMinute = 60-(120-totalMinute);\r\n \tif(totalMinute > 9)\r\n \tSystem.out.printf(\"\\nTotal time in the air = %s%shrs\", totalHour, totalMinute);\r\n \tif(totalMinute < 10){\r\n System.out.printf(\"\\nTotal time in the air = %s0%shrs\", totalHour, totalMinute);\t\r\n }\r\n \t\r\n }\r\n \r\n \r\n \r\n \r\n }","title":""},{"docid":"2c8aed0887fa8109cf71ca30b5b045b6","score":"0.5529679","text":"public static void main(String[] args){\n Graph g = new Graph(8); \n // g.addEdge(1,2,0.9); \n // g.addEdge(2,3,1.5); \n // g.addEdge(3,4,1.5); \n // g.addEdge(4,1,0.5); \n // g.addEdge(2,1,(49/45)); \n // g.addEdge(1,5,0.7); \n // g.addEdge(5,1,(4/3)); \n\n g.addEdge(0,1,0); \n g.addEdge(1,2,0); \n g.addEdge(1,4,0); \n g.addEdge(1,5,0); \n g.addEdge(2,3,0); \n g.addEdge(2,6,0); \n g.addEdge(3,2,0); \n g.addEdge(3,7,0); \n g.addEdge(4,0,0); \n g.addEdge(4,5,0); \n g.addEdge(5,6,0); \n g.addEdge(6,5,0); \n g.addEdge(6,7,0); \n g.addEdge(7,7,0); \n\n\n // g.addEdge(0,4,0); \n // g.addEdge(1,0,0); \n // g.addEdge(2,1,0); \n // g.addEdge(2,3,0); \n // g.addEdge(3,2,0); \n // g.addEdge(4,1,0); \n // g.addEdge(5,4,0); \n // g.addEdge(5,1,0); \n // g.addEdge(5,6,0); \n // g.addEdge(6,2,0); \n // g.addEdge(6,5,0); \n // g.addEdge(7,3,0); \n // g.addEdge(7,6,0); \n // g.addEdge(7,7,0); \n\n\n\n\n // ArrayList<Graph> SCCGs = g.getSCCs();\n\n // for( ArrayList<Integer> C: SCCs)\n // {\n // System.out.println(C);\n // }\n \n\n\n for(ArrayList<Integer> list: g.adj)\n {\n System.out.println(list);\n }\n \n // g.DFS(false, null);\n // // for(Vertix v: g.V)\n // // {\n // // System.out.println(v.id+\" \"+v.f);\n // // }\n // for(int i=0; i<8; i++)\n // {\n // Vertix v = g.V.get(i);\n // ArrayList<Integer> list = g.adj[i];\n // System.out.print(v.id+\" \");\n // System.out.print(list);\n // System.out.println(\" \"+ v.d +\" \"+v.f+\" \"+v.color);\n // }\n // System.out.println();\n // Graph tg = g.getTranspose();\n // tg.DFS(true, g.V);\n // // for(ArrayList<Integer> list: tg.adj)\n // // {\n // // System.out.println(list);\n // // }\n // for(int i=0; i<8; i++)\n // {\n // Vertix v = tg.V.get(i);\n // ArrayList<Integer> list = tg.adj[i];\n // System.out.print(v.id+\" \");\n // System.out.print(list);\n // System.out.println(\" \"+ v.d +\" \"+v.f+\" \"+v.color);\n // }\n\n\n // \n\n // // tg.DFS();\n // for(Vertix v: tg.V)\n // {\n // System.out.println(v.id+\" \"+v.f);\n // }\n \n\n // for(ArrayList<Integer> list: tg.adj)\n // {\n // System.out.println(list);\n // }\n \n // g.SCC();\n\n \n }","title":""},{"docid":"88b6b7f1abfc1403a08296d8aed6fde1","score":"0.5528322","text":"public void printGraph() {\n\n\t\tfor (T vertex : verticesMap.keySet()) {\n\t\t\tif (verticesMap.get(vertex).size() != 0) {\n\t\t\t\tfor (T edges : verticesMap.get(vertex)) {\n\t\t\t\t\tSystem.out.println(vertex + \" -> \" + edges + \" \");\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tSystem.out.println(vertex + \" -> \" + \" \");\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"140bab947b16e59bf33a62235af96263","score":"0.5526422","text":"private Map<ResolvedModule, Set<ResolvedModule>> makeGraph(Configuration cf) {\n\n int moduleCount = nameToReference.size();\n\n // the \"reads\" graph starts as a module dependence graph and\n // is iteratively updated to be the readability graph\n Map<ResolvedModule, Set<ResolvedModule>> g1 = HashMap.newHashMap(moduleCount);\n\n // the \"requires transitive\" graph, contains requires transitive edges only\n Map<ResolvedModule, Set<ResolvedModule>> g2;\n\n // need \"requires transitive\" from the modules in parent configurations\n // as there may be selected modules that have a dependency on modules in\n // the parent configuration.\n if (ModuleLayer.boot() == null) {\n g2 = HashMap.newHashMap(moduleCount);\n } else {\n g2 = parents.stream()\n .flatMap(Configuration::configurations)\n .distinct()\n .flatMap(c ->\n c.modules().stream().flatMap(m1 ->\n m1.descriptor().requires().stream()\n .filter(r -> r.modifiers().contains(Modifier.TRANSITIVE))\n .flatMap(r -> {\n Optional<ResolvedModule> m2 = c.findModule(r.name());\n assert m2.isPresent()\n || r.modifiers().contains(Modifier.STATIC);\n return m2.stream();\n })\n .map(m2 -> Map.entry(m1, m2))\n )\n )\n // stream of m1->m2\n .collect(Collectors.groupingBy(Map.Entry::getKey,\n HashMap::new,\n Collectors.mapping(Map.Entry::getValue, Collectors.toSet())\n ));\n }\n\n // populate g1 and g2 with the dependences from the selected modules\n\n Map<String, ResolvedModule> nameToResolved = HashMap.newHashMap(moduleCount);\n\n for (ModuleReference mref : nameToReference.values()) {\n ModuleDescriptor descriptor = mref.descriptor();\n String name = descriptor.name();\n\n ResolvedModule m1 = computeIfAbsent(nameToResolved, name, cf, mref);\n\n Set<ResolvedModule> reads = new HashSet<>();\n Set<ResolvedModule> requiresTransitive = new HashSet<>();\n\n for (ModuleDescriptor.Requires requires : descriptor.requires()) {\n String dn = requires.name();\n\n ResolvedModule m2;\n ModuleReference mref2 = nameToReference.get(dn);\n if (mref2 != null) {\n // same configuration\n m2 = computeIfAbsent(nameToResolved, dn, cf, mref2);\n } else {\n // parent configuration\n m2 = findInParent(dn);\n if (m2 == null) {\n assert requires.modifiers().contains(Modifier.STATIC);\n continue;\n }\n\n // m2 is automatic module in parent configuration => m1 reads\n // all automatic modules that m2 reads.\n if (m2.descriptor().isAutomatic()) {\n m2.reads().stream()\n .filter(d -> d.descriptor().isAutomatic())\n .forEach(reads::add);\n }\n }\n\n // m1 requires m2 => m1 reads m2\n reads.add(m2);\n\n // m1 requires transitive m2\n if (requires.modifiers().contains(Modifier.TRANSITIVE)) {\n requiresTransitive.add(m2);\n }\n\n }\n\n // automatic modules read all selected modules and all modules\n // in parent configurations\n if (descriptor.isAutomatic()) {\n\n // reads all selected modules\n // `requires transitive` all selected automatic modules\n for (ModuleReference mref2 : nameToReference.values()) {\n ModuleDescriptor descriptor2 = mref2.descriptor();\n String name2 = descriptor2.name();\n\n if (!name.equals(name2)) {\n ResolvedModule m2\n = computeIfAbsent(nameToResolved, name2, cf, mref2);\n reads.add(m2);\n if (descriptor2.isAutomatic())\n requiresTransitive.add(m2);\n }\n }\n\n // reads all modules in parent configurations\n // `requires transitive` all automatic modules in parent\n // configurations\n for (Configuration parent : parents) {\n parent.configurations()\n .map(Configuration::modules)\n .flatMap(Set::stream)\n .forEach(m -> {\n reads.add(m);\n if (m.reference().descriptor().isAutomatic())\n requiresTransitive.add(m);\n });\n }\n }\n\n g1.put(m1, reads);\n g2.put(m1, requiresTransitive);\n }\n\n // Iteratively update g1 until there are no more requires transitive\n // to propagate\n boolean changed;\n List<ResolvedModule> toAdd = new ArrayList<>();\n do {\n changed = false;\n for (Set<ResolvedModule> m1Reads : g1.values()) {\n for (ResolvedModule m2 : m1Reads) {\n Set<ResolvedModule> m2RequiresTransitive = g2.get(m2);\n if (m2RequiresTransitive != null) {\n for (ResolvedModule m3 : m2RequiresTransitive) {\n if (!m1Reads.contains(m3)) {\n // m1 reads m2, m2 requires transitive m3\n // => need to add m1 reads m3\n toAdd.add(m3);\n }\n }\n }\n }\n if (!toAdd.isEmpty()) {\n m1Reads.addAll(toAdd);\n toAdd.clear();\n changed = true;\n }\n }\n } while (changed);\n\n return g1;\n }","title":""},{"docid":"9aee1f80bb93efd079b75443dec2570a","score":"0.5525068","text":"public void print_graph() {\r\n print_graph(graph, vertexes);\r\n }","title":""},{"docid":"65e237a28d2ec33c6eca19b7c8f37df2","score":"0.552158","text":"public static DependencyGraph getCompleteDependencies(Artifact artifact)\n throws DependencyCollectionException, DependencyResolutionException {\n \n // root node\n DependencyNode node = resolveCompileTimeDependencies(artifact); \n DependencyGraph graph = new DependencyGraph();\n fullPreorder(new Stack<>(), node, graph);\n \n return graph;\n }","title":""},{"docid":"b2a6b5abfcd210ab8b0acf919b2bb63b","score":"0.55143243","text":"String inheritanceDependancies(PogoDeviceClass cls) {\n\t\tString code = \n\t\t\t\"#=============================================================================\\n\" +\n\t\t\t\"# Following are dependancies of the inherited classes used by project\\n\" +\n\t\t\t\"#\\n\";\n\t\tfor (Inheritance inher : cls.getDescription().getInheritances()) {\n\t\t\tif (inheritanceUtils.isInheritanceClass(inher)) {\n\t\t\t\tcode += \"\\n\" +\n\t\t\t\t\t\t\"#------------ Object files dependancies for \" +inher.getClassname()+\" class ------------\\n\";\n\t\t\t\tcode += classIncludeDir(inher.getClassname()) + \" = \\\\\\n\";\n\t\t\t\tcode += \"\t\t$(\" + classHomeDir(inher.getClassname()) + \")/\" + inher.getClassname() + \".h \\\\\\n\"; \n\t\t\t\tcode += \"\t\t$(\" + classHomeDir(inher.getClassname()) + \")/\" + inher.getClassname() + \"Class.h\\n\";\n\t\t\t\tcode += dependanciesObject(inher.getClassname(), \"\");\n\t\t\t\tcode += dependanciesObject(inher.getClassname(), \"Class\");\n\t\t\t\tcode += dependanciesObject(inher.getClassname(), \"StateMachine\");\n\n\t\t\t\t/*\tToDo additional for inheritance ?\n\t\t\t\tfor (AdditionalFile file : cls.getAdditionalFiles()) {\n\t\t\t\t\tcode += dependanciesObjectAddFile(cls.getName(), file.getName());\n\t\t\t\t}\n\t\t\t\t*/\n\t\t\t}\n\t\t}\n\n\t\tcode += \"\\nSVC_INHERITANCE_INCL = \";\n\t\tfor (Inheritance inheritance : cls.getDescription().getInheritances()) {\n\t\t\tif (inheritanceUtils.isInheritanceClass(inheritance)) {\n\t\t\t\tcode+= \" $(\" + classIncludeDir(inheritance.getClassname()) + \")\";\n\t\t\t}\n\t\t}\n\t\tcode += \"\\n\";\n\n\t\treturn code;\n\t}","title":""},{"docid":"855e36e07c2f8b70e8fb74114f8c112d","score":"0.5503551","text":"public void buildOrder(List<Node[]> dependencies) {\n Map<Node, Set<Node>> dependencyMap = new HashMap<>();\n for(Node[] dep: dependencies){\n if(dependencyMap.containsKey(dep[0])){\n dependencyMap.get(dep[0]).add(dep[1]);\n } else {\n Set<Node> set = new HashSet<>();\n set.add(dep[1]);\n dependencyMap.put(dep[0], set);\n }\n }\n\n Set<Node> visited = new HashSet<>();\n Set<Node> visiting = new HashSet<>();\n Deque<Node> stack = new ArrayDeque<>();\n\n for(Node n: nodes){\n if(!visited.contains(n)&& !visiting.contains(n)){\n stack.addLast(n);\n visited.add(n);\n for(Node preReq: dependencyMap.get(n)){\n if(!visited.contains(n)&& !visiting.contains(n)){\n stack.addLast(preReq);\n visiting.add(preReq);\n }\n }\n }\n\n while(!visiting.isEmpty()){\n// Node n = stack.getLast();\n// if()\n }\n }\n\n }","title":""},{"docid":"d0a8298b6b23f5ac8202c7c2af8d95e6","score":"0.55004334","text":"public static DirectedGraph get_dg1() {DirectedGraph dg = new DirectedGraph();for (int i = 1; i <= 22; i++)\tdg.addVertice(i);dg.addDirectedEdges(1, 2);dg.addDirectedEdges(3, 2);dg.addDirectedEdges(12, 2);dg.addDirectedEdges(13, 2);dg.addDirectedEdges(14, 2);dg.addDirectedEdges(15, 2);dg.addDirectedEdges(16, 2);dg.addDirectedEdges(1, 3);dg.addDirectedEdges(2, 3);dg.addDirectedEdges(4, 3);dg.addDirectedEdges(12, 3);dg.addDirectedEdges(13, 3);dg.addDirectedEdges(14, 3);dg.addDirectedEdges(15, 3);dg.addDirectedEdges(16, 3);dg.addDirectedEdges(1, 4);dg.addDirectedEdges(3, 4);dg.addDirectedEdges(5, 4);dg.addDirectedEdges(6, 4);dg.addDirectedEdges(12, 4);dg.addDirectedEdges(13, 4);dg.addDirectedEdges(14, 4);dg.addDirectedEdges(15, 4);dg.addDirectedEdges(16, 4);dg.addDirectedEdges(17, 4);dg.addDirectedEdges(18, 4);dg.addDirectedEdges(19, 4);dg.addDirectedEdges(1, 5);dg.addDirectedEdges(4, 5);dg.addDirectedEdges(6, 5);dg.addDirectedEdges(12, 5);dg.addDirectedEdges(13, 5);dg.addDirectedEdges(14, 5);dg.addDirectedEdges(15, 5);dg.addDirectedEdges(16, 5);dg.addDirectedEdges(17, 5);dg.addDirectedEdges(18, 5);dg.addDirectedEdges(19, 5);dg.addDirectedEdges(1, 6);dg.addDirectedEdges(4, 6);dg.addDirectedEdges(5, 6);dg.addDirectedEdges(7, 6);dg.addDirectedEdges(13, 6);dg.addDirectedEdges(14, 6);dg.addDirectedEdges(15, 6);dg.addDirectedEdges(16, 6);dg.addDirectedEdges(17, 6);dg.addDirectedEdges(18, 6);dg.addDirectedEdges(19, 6);dg.addDirectedEdges(1, 7);dg.addDirectedEdges(6, 7);dg.addDirectedEdges(8, 7);dg.addDirectedEdges(13, 7);dg.addDirectedEdges(14, 7);dg.addDirectedEdges(15, 7);dg.addDirectedEdges(16, 7);dg.addDirectedEdges(17, 7);dg.addDirectedEdges(18, 7);dg.addDirectedEdges(19, 7);dg.addDirectedEdges(20, 7);dg.addDirectedEdges(21, 7);dg.addDirectedEdges(1, 8);dg.addDirectedEdges(7, 8);dg.addDirectedEdges(9, 8);dg.addDirectedEdges(14, 8);dg.addDirectedEdges(15, 8);dg.addDirectedEdges(16, 8);dg.addDirectedEdges(17, 8);dg.addDirectedEdges(18, 8);dg.addDirectedEdges(19, 8);dg.addDirectedEdges(20, 8);dg.addDirectedEdges(21, 8);dg.addDirectedEdges(1, 9);dg.addDirectedEdges(8, 9);dg.addDirectedEdges(10, 9);dg.addDirectedEdges(14, 9);dg.addDirectedEdges(15, 9);dg.addDirectedEdges(16, 9);dg.addDirectedEdges(17, 9);dg.addDirectedEdges(18, 9);dg.addDirectedEdges(19, 9);dg.addDirectedEdges(20, 9);dg.addDirectedEdges(21, 9);dg.addDirectedEdges(22, 9);dg.addDirectedEdges(1, 10);dg.addDirectedEdges(9, 10);dg.addDirectedEdges(15, 10);dg.addDirectedEdges(16, 10);dg.addDirectedEdges(18, 10);dg.addDirectedEdges(19, 10);dg.addDirectedEdges(20, 10);dg.addDirectedEdges(21, 10);dg.addDirectedEdges(22, 10);dg.addDirectedEdges(1, 11);dg.addDirectedEdges(16, 11);dg.addDirectedEdges(19, 11);dg.addDirectedEdges(21, 11);dg.addDirectedEdges(22, 11);dg.addDirectedEdges(1, 12);dg.addDirectedEdges(2, 12);dg.addDirectedEdges(3, 12);dg.addDirectedEdges(4, 12);dg.addDirectedEdges(5, 12);dg.addDirectedEdges(13, 12);dg.addDirectedEdges(14, 12);dg.addDirectedEdges(15, 12);dg.addDirectedEdges(16, 12);dg.addDirectedEdges(1, 13);dg.addDirectedEdges(2, 13);dg.addDirectedEdges(3, 13);dg.addDirectedEdges(4, 13);dg.addDirectedEdges(5, 13);dg.addDirectedEdges(6, 13);dg.addDirectedEdges(7, 13);dg.addDirectedEdges(12, 13);dg.addDirectedEdges(14, 13);dg.addDirectedEdges(15, 13);dg.addDirectedEdges(16, 13);dg.addDirectedEdges(1, 14);dg.addDirectedEdges(2, 14);dg.addDirectedEdges(3, 14);dg.addDirectedEdges(4, 14);dg.addDirectedEdges(5, 14);dg.addDirectedEdges(6, 14);dg.addDirectedEdges(7, 14);dg.addDirectedEdges(8, 14);dg.addDirectedEdges(9, 14);dg.addDirectedEdges(12, 14);dg.addDirectedEdges(13, 14);dg.addDirectedEdges(15, 14);dg.addDirectedEdges(16, 14);dg.addDirectedEdges(17, 14);dg.addDirectedEdges(1, 15);dg.addDirectedEdges(2, 15);dg.addDirectedEdges(3, 15);dg.addDirectedEdges(4, 15);dg.addDirectedEdges(5, 15);dg.addDirectedEdges(6, 15);dg.addDirectedEdges(7, 15);dg.addDirectedEdges(8, 15);dg.addDirectedEdges(9, 15);dg.addDirectedEdges(10, 15);dg.addDirectedEdges(12, 15);dg.addDirectedEdges(13, 15);dg.addDirectedEdges(14, 15);dg.addDirectedEdges(16, 15);dg.addDirectedEdges(17, 15);dg.addDirectedEdges(18, 15);dg.addDirectedEdges(20, 15);dg.addDirectedEdges(1, 16);dg.addDirectedEdges(2, 16);dg.addDirectedEdges(3, 16);dg.addDirectedEdges(4, 16);dg.addDirectedEdges(5, 16);dg.addDirectedEdges(6, 16);dg.addDirectedEdges(7, 16);dg.addDirectedEdges(8, 16);dg.addDirectedEdges(9, 16);dg.addDirectedEdges(10, 16);dg.addDirectedEdges(11, 16);dg.addDirectedEdges(12, 16);dg.addDirectedEdges(13, 16);dg.addDirectedEdges(14, 16);dg.addDirectedEdges(15, 16);dg.addDirectedEdges(17, 16);dg.addDirectedEdges(18, 16);dg.addDirectedEdges(19, 16);dg.addDirectedEdges(20, 16);dg.addDirectedEdges(21, 16);dg.addDirectedEdges(22, 16);dg.addDirectedEdges(1, 17);dg.addDirectedEdges(4, 17);dg.addDirectedEdges(5, 17);dg.addDirectedEdges(6, 17);dg.addDirectedEdges(7, 17);dg.addDirectedEdges(8, 17);dg.addDirectedEdges(9, 17);dg.addDirectedEdges(14, 17);dg.addDirectedEdges(15, 17);dg.addDirectedEdges(16, 17);dg.addDirectedEdges(18, 17);dg.addDirectedEdges(19, 17);dg.addDirectedEdges(1, 18);dg.addDirectedEdges(4, 18);dg.addDirectedEdges(5, 18);dg.addDirectedEdges(6, 18);dg.addDirectedEdges(7, 18);dg.addDirectedEdges(8, 18);dg.addDirectedEdges(9, 18);dg.addDirectedEdges(10, 18);dg.addDirectedEdges(15, 18);dg.addDirectedEdges(16, 18);dg.addDirectedEdges(17, 18);dg.addDirectedEdges(19, 18);dg.addDirectedEdges(20, 18);dg.addDirectedEdges(1, 19);dg.addDirectedEdges(4, 19);dg.addDirectedEdges(5, 19);dg.addDirectedEdges(6, 19);dg.addDirectedEdges(7, 19);dg.addDirectedEdges(8, 19);dg.addDirectedEdges(9, 19);dg.addDirectedEdges(10, 19);dg.addDirectedEdges(11, 19);dg.addDirectedEdges(16, 19);dg.addDirectedEdges(17, 19);dg.addDirectedEdges(18, 19);dg.addDirectedEdges(20, 19);dg.addDirectedEdges(21, 19);dg.addDirectedEdges(22, 19);dg.addDirectedEdges(1, 20);dg.addDirectedEdges(7, 20);dg.addDirectedEdges(8, 20);dg.addDirectedEdges(9, 20);dg.addDirectedEdges(10, 20);dg.addDirectedEdges(15, 20);dg.addDirectedEdges(16, 20);dg.addDirectedEdges(18, 20);dg.addDirectedEdges(19, 20);dg.addDirectedEdges(21, 20);dg.addDirectedEdges(1, 21);dg.addDirectedEdges(7, 21);dg.addDirectedEdges(8, 21);dg.addDirectedEdges(9, 21);dg.addDirectedEdges(10, 21);dg.addDirectedEdges(11, 21);dg.addDirectedEdges(16, 21);dg.addDirectedEdges(19, 21);dg.addDirectedEdges(20, 21);dg.addDirectedEdges(22, 21);dg.addDirectedEdges(1, 22);dg.addDirectedEdges(9, 22);dg.addDirectedEdges(10, 22);dg.addDirectedEdges(11, 22);dg.addDirectedEdges(16, 22);dg.addDirectedEdges(19, 22);dg.addDirectedEdges(21, 22);return dg;}","title":""},{"docid":"01585240d81c7d23136495e530e0dddd","score":"0.548937","text":"public static void main(String[] args) {\n Graph myGraph = new Graph();\n myGraph = createGraph();\n\n //Print out all elements of the Graph\n for (Vertex myVertex : myGraph.getAdjVertices().keySet()) {\n System.out.println(myVertex.label);\n }\n System.out.println();\n\n\n //EXAMPLE FROM MOODLE (FLIGHTS)\n //Create a new Graph based on the copied code. The new Graph is related to the network of airports in South Africa\n\n Graph flightGraph = new Graph();\n flightGraph = createAirportsGraph();\n\n //Print out all elements of the new Graph\n for (Vertex myVertex : flightGraph.getAdjVertices().keySet()) {\n System.out.println(myVertex.label);\n }\n System.out.println();\n\n\n //Write an algorithm that calculates how many direct flights are in the Graph (in total).\n int directFlights = 0;\n for (Vertex myVertex : flightGraph.getAdjVertices().keySet()) {\n for (Vertex flight : flightGraph.getAdjVertices(myVertex.label)) {\n directFlights++;\n }\n }\n System.out.println(\"Total number of direct flights: \" + directFlights);\n System.out.println();\n\n\n //Print out all airports which are connected to “Cape Town” airport with direct flight.\n System.out.println(\"Direct flights from \\\"Cape Town\\\": \");\n for (Vertex directFlightCT : flightGraph.getAdjVertices(\"Cape Town\")) {\n System.out.println(directFlightCT.label);\n }\n System.out.println();\n\n\n //Write an algorithm that calculates how many direct flights are from Jo’burg airport.\n\n int directFlightsJB = 0;\n for (Vertex directFlightJB : flightGraph.getAdjVertices(\"Jo'burg\")) {\n directFlightsJB++;\n }\n System.out.println(\"Number of direct flights from \\\"Jo'burg\\\": \" + directFlightsJB);\n System.out.println();\n\n\n\n\n\n\n\n\n\n\n }","title":""},{"docid":"a7459bdb579c1ae1c9612e460c272d93","score":"0.5478908","text":"@Override\n public NDependencies solve() {\n for (RootInfo rootInfo : pending) {\n addRootDefinition0(rootInfo.dependency, rootInfo.def, session);\n }\n pending.clear();\n List<NDependencyTreeNodeBuild> mergedRootNodeBuilders = new ArrayList<>();\n List<NDependencyTreeNodeBuild> nonMergedRootNodeBuilders = new ArrayList<>();\n Queue<NDependencyTreeNodeBuild> queue = new ArrayDeque<>();\n Set<NId> sourceIds = new LinkedHashSet<>();\n LinkedHashSet<NDependency> immediates = new LinkedHashSet<>();\n NDependencyInfoSet mergedVisitedSet = new NDependencyInfoSet();\n NDependencyInfoSet nonMergedVisitedSet = new NDependencyInfoSet();\n NDependencyFilter effDependencyFilter = null;\n NDependencyFilters filter = NDependencyFilters.of(session);\n if (dependencyFilter == null) {\n effDependencyFilter = filter.always();\n } else {\n effDependencyFilter = dependencyFilter;\n }\n for (NDependencyTreeNodeBuild currentNode : defs) {\n NId id = currentNode.getEffectiveId();\n if (sourceIds.add(id)) {\n// sourceIds.add(id);\n if (mergedVisitedSet.add(currentNode.key)) {\n mergedRootNodeBuilders.add(currentNode);\n List<NDependency> immediate = CoreFilterUtils.filterDependencies(id,\n currentNode.getEffectiveDescriptor().getDependencies(),\n effDependencyFilter, session);\n immediates.addAll(immediate);\n for (NDependency dependency : currentNode.def.getEffectiveDescriptor().get(session).getDependencies()) {\n dependency = dependency.builder().setProperty(\"provided-by\", currentNode.id.toString()).build();\n// if(dependency.toId().contains(\"jai_imageio\")){\n// System.out.print(\"\");\n// }\n NDependency effDependency = dependency.builder()\n .setScope(combineScopes(currentNode.effDependency.getScope(), dependency.getScope()))\n .build();\n if (effDependencyFilter.acceptDependency(currentNode.def.getId(), effDependency, session)\n && !currentNode.exclusions.contains(dependency.toId().getShortId())\n ) {\n NDefinition def2 = null;\n try {\n def2 = NSearchCommand.of(session)\n .addId(dependency.toId())\n .setEffective(true)\n .setContent(shouldIncludeContent)\n .setLatest(true).getResultDefinitions().findFirst().get();\n } catch (NNotFoundException ex) {\n //\n }\n if(def2!=null){\n effDependency=effDependency\n .builder()\n .setVersion(def2.getId().getVersion());\n }\n NDependencyTreeNodeBuild info = new NDependencyTreeNodeBuild(currentNode, def2, dependency, effDependency, currentNode.depth + 1, session);\n info.exclusions.addAll(currentNode.exclusions);\n for (NId exclusion : dependency.getExclusions()) {\n info.exclusions.add(exclusion.getShortId());\n }\n currentNode.children.add(info);\n nonMergedRootNodeBuilders.add(info);\n queue.add(info);\n }\n }\n }\n }\n }\n NDependencyTreeNodeBuild currentNode;\n while (!queue.isEmpty()) {\n currentNode = queue.remove();\n NDependencyInfo nextId = currentNode.key;\n if (!mergedVisitedSet.contains(nextId) && nonMergedVisitedSet.add(nextId)) {\n mergedVisitedSet.add(nextId);//ensure added to merged!\n NDescriptor effectiveDescriptor = currentNode.getEffectiveDescriptor();\n if (effectiveDescriptor != null) {\n for (NDependency dependency : effectiveDescriptor.getDependencies()) {\n dependency = dependency.builder().setProperty(\"provided-by\", currentNode.id.toString()).build();\n// if(dependency.toId().contains(\"jai_imageio\")){\n// System.out.print(\"\");\n// }\n NDependency effDependency = dependency.builder()\n .setScope(combineScopes(currentNode.effDependency.getScope(), dependency.getScope()))\n .build();\n if (effDependencyFilter.acceptDependency(\n currentNode.getEffectiveId(), effDependency, session\n ) && !currentNode.exclusions.contains(dependency.toId().getShortId())) {\n NDefinition def2 = null;\n try {\n def2 = NSearchCommand.of(session)\n .addId(dependency.toId())\n .setEffective(true)\n .setContent(shouldIncludeContent)\n .setLatest(true).getResultDefinitions().findFirst().orNull();\n } catch (NNotFoundException ex) {\n //\n }\n if(def2!=null){\n effDependency=effDependency\n .builder()\n .setVersion(def2.getId().getVersion());\n }\n NDependencyTreeNodeBuild info = new NDependencyTreeNodeBuild(currentNode, def2, dependency,effDependency, currentNode.depth + 1, session);\n info.exclusions.addAll(currentNode.exclusions);\n for (NId exclusion : dependency.getExclusions()) {\n info.exclusions.add(exclusion.getShortId());\n }\n currentNode.children.add(info);\n if(!mergedVisitedSet.contains(info.key)) {\n queue.add(info);\n }\n }\n }\n }\n } else {\n currentNode.alreadyVisited = true;\n }\n }\n List<NDependencyTreeNode> mergedRootNodes = mergedRootNodeBuilders.stream().map(NDependencyTreeNodeBuild::build).collect(Collectors.toList());\n List<NDependencyTreeNode> nonMergedRootNodes = nonMergedRootNodeBuilders.stream().map(NDependencyTreeNodeBuild::build).collect(Collectors.toList());\n final NDependency[] mergedDepsList = mergedVisitedSet.visitedSet.values().stream().map(NDependencyInfo::getDependency)\n .toArray(NDependency[]::new);\n final NDependency[] nonMergedDepsList = nonMergedVisitedSet.visitedSet.values().stream().map(NDependencyInfo::getDependency)\n .toArray(NDependency[]::new);\n return new DefaultNDependencies(\n getName(),\n sourceIds.toArray(new NId[0]), effDependencyFilter,\n immediates.toArray(new NDependency[0]),\n nonMergedDepsList,\n nonMergedRootNodes.toArray(new NDependencyTreeNode[0]),\n mergedDepsList,\n mergedRootNodes.toArray(new NDependencyTreeNode[0]),\n e-> NElements.of(e).ofString(\"solver\"),session\n );\n }","title":""},{"docid":"ab5edb40ddbe0df5b86cc05a27ecf380","score":"0.5470395","text":"@SuppressWarnings(value = {})\n\t public void show()\n\t {\n//\t\t System.out.println(\"hierarchy!!!\");\n//\t\t for(Shape shape:objects){ \n//\t\t\t Circle circle=(Circle)shape;\n//\t\t\t System.out.println(\"(\"+circle.getPosition().getX()+\",\"+circle.getPosition().getY()+\")\"+\",\"+circle.getR());\n//\t\t }\n\t\t for (int i = 0; i < nodes.length; i++) {\n\t\t\t if (nodes[i] != null) {\n\t\t\t nodes[i].show();\n\t\t\t //nodes[i] = null;\n\t\t\t // System.out.println(\"#\");\n\t\t\t \n\t\t\t }\n\t\t\t else\n\t\t\t System.out.println(\"#\");\n\t\t\t \n\t\t\t }System.out.println(\"@\");\n\t }","title":""},{"docid":"ca185da10ef0a73be2d2f0df5428bdd4","score":"0.54631793","text":"public interface Graph extends AutoCloseable {\n /**\n * 获取图的ID\n *\n * @return\n */\n int id();\n\n /**\n * 获取图的名字\n *\n * @return\n */\n String name();\n\n /**\n * 获取所有节点\n *\n * @return\n */\n List<Node> listNodes();\n\n /**\n * 获取所有type类型的节点\n *\n * @param type\n * @return\n */\n List<Node> listNodes(String type);\n\n /**\n * 根据类型和Id返回节点\n */\n Node getNode(String type, String id);\n\n /**\n * 根据头节点id,尾节点id返回关系\n **/\n Relation getRelation(String headType, String headId, String tailType, String tailId, String type);\n\n /**\n *\n */\n List<Relation> getRelations(String tailType, String relType);\n /**\n * 根据指定的查询条件，进行关系子图查询\n * @param relQuerySpec\n * @return\n */\n //RelationGraph queryRelation(RelQuerySpec relQuerySpec);\n\n\n /**\n * 创建一个新的节点，由参数指定name和type，系统生生ID\n *\n * @param id\n * @param type\n * @return\n */\n Node newNode(String type, String id, int value);\n\n\n /**\n * 删除指定类型的边\n *\n * @param headType\n * @param headId\n * @param tailType\n * @param tailId\n */\n void deleteRelation(String headType, String headId, String tailType, String tailId, String relationType);\n\n /**\n * 清空整个图的数据\n */\n void clear();\n\n /**\n * 根据头节点,尾节点新建一条边\n *\n * @param headType\n * @param headId\n * @param tailType\n * @param tailId\n * @param relationType\n * @return\n */\n public Relation newRelation(String headType, String headId, String tailType, String tailId, String relationType, int val);\n\n /**\n * 返回当前图的meta\n *\n * @return\n */\n public GraphMeta graphMeta();\n\n\n List<Node> getNodesInTwoLevel(GDBNode start);\n\n\n /**\n * 查询图中节点个数\n */\n public long getNodeCount();\n\n /***\n *查询图中关系个数\n */\n\n public long getRelCount();\n\n\n /**\n * 根据节点的sname,attributes检索节点\n */\n\n public List<GDBNode> query(int nodeType, List<QueryMap> queries, int start, int len);\n\n /**\n * 根据节点的sname,attributes检索节点个数\n */\n\n public long queryCount(int nodeType, List<QueryMap> queries);\n\n /**\n * 返回图中节点各种类型的个数信息\n * */\n\n /**\n * 返回图中关系各种类型的个数信息\n */\n Map<String, Long> getNodeTypeCount();\n\n Map<String, Long> getRelationTypeCount();\n\n List<Node> shortestPath(GDBNode start , GDBNode end);\n\n void delete();\n}","title":""},{"docid":"80e22b27fa6a0df311932aa04a2d1728","score":"0.5459342","text":"public static void main(String[] args){\n In in = new In(\"rosalind_dag.txt\");\n int x = in.readInt();//number of graphs\n for(int i=0;i<x;i++) {\n int v = in.readInt();//number of vertices in the first graph\n int e = in.readInt();//number of edges in the first graph.\n Acyclic g = new Acyclic(v + 1);\n for (int j = 0; j < e; j++) {//read all the edge pairs until we get to the next graph\n int p = in.readInt();\n int q = in.readInt();\n g.addEdge(p, q);\n }\n boolean flag=true;\n for(int k=1;k<v+1;k++) {\n for(int neighbor:neighbors[k]) {\n flag = g.traverseDepthFirst(k, neighbor);\n }\n if(!flag){\n break;\n }\n }\n if(flag){\n StdOut.print(\"1 \");\n }else{\n StdOut.print(\"-1 \");\n }\n }\n }","title":""},{"docid":"f67853f2575abfa95a647d7dadf722c5","score":"0.5441345","text":"public static void transitiveClosure() {\r\n\r\n\t\tfor (int i = 0; i < graph.vertexCount; i++) {\r\n\t\t\ttransitiveHelper(i, i);\r\n\t\t}\r\n\r\n\t\tfor (int row = 0; row < graph.vertexCount; row++) {\r\n\t\t\tfor (int col = 0; col < graph.vertexCount; col++) {\r\n\t\t\t\tSystem.out.print(transitiveClosure[row][col]);\r\n\t\t\t}\r\n\t\t\tSystem.out.println(\"\\n\");\r\n\t\t}\r\n\r\n\t}","title":""},{"docid":"a9532012a4c6dea713702c9e721b8d39","score":"0.54404336","text":"private void detectCycles() {\n visited = new HashSet<>();\n visitPath = new LinkedHashSet<>(); // preserve insertion order\n for (ModuleReference mref : nameToReference.values()) {\n visit(mref.descriptor());\n }\n visited.clear();\n }","title":""},{"docid":"5bb3a9d1fb00b2422369eb0791f5ee65","score":"0.5400103","text":"protected void printCharts() {\n MapIterator<?, HelmChart> it = chartsReferenced.mapIterator();\n IChartMapPrinter p = getPrinter();\n try {\n if (chartsReferenced.size() == 1) {\n p.printSectionHeader(\"There is one referenced Helm Chart\");\n } else {\n p.printSectionHeader(\"There are \" + chartsReferenced.size() + \" referenced Helm Charts\");\n }\n while (it.hasNext()) {\n it.next();\n p.printChart(it.getValue());\n }\n } catch (ChartMapException e) {\n logger.error(\"IOException printing charts: {} \", e.getMessage());\n }\n }","title":""},{"docid":"3adf6de88b3081ff932346e6221ef802","score":"0.53989214","text":"@NonNull\n List<GraphItem> getPackageDependencies();","title":""},{"docid":"24ce569319d89ebcbf464b05264ca3ec","score":"0.5387147","text":"public String graph() {\n StringBuilder s = new StringBuilder();\n s.append(v + \" 个顶点, \" + e + \" 条边 \" + NEWLINE);\n for (int i = 0; i < v; i++) {\n s.append(i + \": \");\n for (int w : adj[i]) {\n s.append(w + \" \");\n }\n s.append(NEWLINE);\n }\n return s.toString();\n }","title":""},{"docid":"b8a3526dc4f02277e7fe8f53a3c4e810","score":"0.53804666","text":"public void printSemanticGraph(String text) {\n\t\tAnnotation document = new Annotation(text);\r\n\r\n\t\t// run all Annotators on this text\r\n\t\tProperties props = new Properties();\r\n\t\tprops.setProperty(\"annotators\", \"tokenize, ssplit, pos, lemma, ner, parse, dcoref\");\r\n\t\tStanfordCoreNLP pipeline = new StanfordCoreNLP(props);\r\n\t\tpipeline.annotate(document);\r\n\t\t// for each sentence you can get a list of collapsed dependencies as follows\r\n\t\t// a CoreMap is essentially a Map that uses class objects as keys and has values with custom types \r\n\t\t List < CoreMap > sentences = document.get(SentencesAnnotation.class);\r\n\t\t for (CoreMap sentence: sentences) {\r\n\t\t \t// traversing the words in the current sentence // a CoreLabel is a CoreMap with additional token-specific methods \r\n//\t\t \tfor (CoreLabel token: sentence.get(TokensAnnotation.class)) {\r\n//\t\t \t\t// this is the text of the token \r\n//\t\t \t\tString word = token.get(TextAnnotation.class); // this is the POS tag of the token \r\n//\t\t \t\tString pos = token.get(PartOfSpeechAnnotation.class); // this is the NER label of the token \r\n//\t\t \t\tString ne = token.get(NamedEntityTagAnnotation.class);\r\n//\t\t \t} // this is the parse tree of the current sentence \r\n//\t\t \tTree tree = sentence.get(TreeAnnotation.class); // this is the Stanford dependency graph of the current sentence \r\n\t\t \tSemanticGraph dependencies = sentence.get(CollapsedCCProcessedDependenciesAnnotation.class);\r\n\t\t \tint egde = dependencies.edgeCount();\r\n\t\t \tSystem.out.println(\"EDGE: \" +egde);\r\n\t\t \tIterator<SemanticGraphEdge> itr = dependencies.edgeIterable().iterator();\r\n\t\t \twhile(itr.hasNext())\r\n\t\t \t{\r\n\t\t \t\tSystem.out.println(\"SematicGraphEdge: \" + itr.next());\r\n\t\t \t}\r\n\t\t \t\r\n\t\t \tSystem.out.println(\"Sematic Graph: \" + dependencies.toFormattedString());\r\n\t\t } // This is the coreference link graph // Each chain stores a set of mentions that link to each other, // along with a method for getting the most representative mention // Both sentence and token offsets start at 1! \r\n\t }","title":""},{"docid":"9dacb9f0d6db3dee250c7b4700df25b5","score":"0.5368693","text":"public void display() {\n\t\n\t\tSystem.out.println(\"Graph is bipartite\");\n\t\n\t\n}","title":""},{"docid":"604f838e390026a59a1e953fcd80c3ae","score":"0.53637516","text":"void report() {\n fNodes.forEach(new Consumer<Node>() {\n @Override\n public void accept(Node node) {\n System.out.print(node.toString());\n }\n\n });\n fEdges.forEach(new Consumer<Edge>() {\n @Override\n public void accept(Edge edge) {\n System.out.print(edge.toString());\n }\n });\n }","title":""},{"docid":"4b2ae65935480f3d16a75c6508aa0ed8","score":"0.535927","text":"public static void generateFlowchart() {\n \tIterator<DataModelObj> iterator = methodDeclObjList.iterator();\r\n while (iterator.hasNext()) {\r\n \tDataModelObj methObj = iterator.next();\r\n \t//int methId=methObj.getId();\r\n \t//String currentMethName=methObj.getMethodName();\r\n \t//System.out.println(methId + currentMethName);\r\n if (methObj.getMethodName().equals(\"main\")) {\r\n \t//System.out.println(\"main found\");\r\n \tString [] currMethText = methObj.getMethodDeclText();\r\n \tfor (int i = 0;i < currMethText.length;i++) {\r\n \t\t\tString methStr=currMethText[i]; \t\t\t\r\n \t\t\tif (methStr.contains(\"(\") && methStr.contains(\")\") && !methStr.contains(\"main\")) {\r\n \t\t\t\t//System.out.println(methStr);\r\n \t\t\t}\r\n \t}\r\n }\r\n }\r\n \t/*try {\r\n \t\tfor (FlowchartObj curMeth : methodDeclObjList) {\r\n \t\t\tString currentMethName=curMeth.getMethodName();\r\n \t\t\tint methId=curMeth.getId();\r\n \t\t\t//System.out.println(currObj);\r\n \t\t\t//String currentMethName = ((FlowchartObj) currObj).getMethodName();\r\n \t\t\tSystem.out.println(methId + currentMethName);\r\n \t\t\tif (currentMethName == \"main\") {\r\n \t\t\t\tString [] currentMethText = FlowchartObj.getMethodDeclText();\r\n \t\t\t}\r\n \t\t}\r\n \t\t\r\n \t\t\r\n \t\t\r\n \t\t}\r\n \t} catch (Exception e) {\r\n \t\tSystem.out.print(\"FlowchartObj Exception\");\r\n }*/\r\n \t\r\n }","title":""},{"docid":"f7a6922a1a2bcc5f9f927ec21a2c9dd1","score":"0.53480333","text":"public Set<RdfGraph> getNamedGraphs();","title":""},{"docid":"63bde26d13cdb6b4375bef7ea7b702e5","score":"0.5339289","text":"G getGraph();","title":""},{"docid":"223ef88993c19cd8bbcd8554c7ff2486","score":"0.5320959","text":"public void print() {\n Iterator unitIt = graph.iterator();\n while(unitIt.hasNext()){\n Unit s = (Unit) unitIt.next();\n Map<Local, Definition> set = getFlowBefore(s);\n int level = 2;\n if(s.toString().trim().equals(\"return\"))\n level = 3;\n\n debug(\"Unit: \" + s.toString(), level);\n for(Map.Entry<Local, Definition> entry : set.entrySet()){\n String output = entry.getKey().getName() + \":\" + entry.getValue().toString();\n debug(output, level);\n }\n }\n\t}","title":""},{"docid":"a83e569b070dda8495476942299898cf","score":"0.5316148","text":"private static void setAdjacents(int projectID,Graph graph ){\n List<TaskModel> dependencies = null;\n for(Node n : graph.nodes){\n dependencies = n.getData().task.getDependencies();\n for(TaskModel t:dependencies){\n graph.addDirectedEdge(graph.getNodeByID(t.getTaskId()),n);\n }\n }\n\n }","title":""},{"docid":"1617ce16307f608f06139a47223f6fda","score":"0.5314265","text":"private static String listDeps (List dependencyList) {\n StringBuffer sb = new StringBuffer ();\n Iterator iter = dependencyList.iterator ();\n while (iter.hasNext ()) {\n Object o = iter.next ();\n \n // Test that the user really passed in a Class. Versions\n // prior to 2.2 received Strings instead, and any user that\n // used the code would find it broken.\n if (o != null && o instanceof Class) {\n sb.append (((Class) o).getName ());\n } else {\n sb.append (o);\n }\n \n if (iter.hasNext ()) {\n sb.append (\" -> \");\n }\n }\n \n return sb.toString ();\n }","title":""},{"docid":"6927ee403e70ff0ecdc693c1ad0d0e79","score":"0.5312889","text":"public void printGraph(){\n\t\t\n\t\tSystem.out.println( \"\\n\\nThe Program Blocks Representation\\n\\n \" + m_blocks.toString() );\n\t\tSystem.out.println( \"\\n\\nForward edges Representation\\n\\n \" + m_blocks.getNextEdges());\n\t\tSystem.out.println( \"\\n\\nBackward edges nodes Representation\\n\\n \" + m_blocks.getPreviousEdges() + \"\\n\\n\");\t\t\n\t}","title":""},{"docid":"e8247b41ab4b6ac5b45a7a864fa8be95","score":"0.53103346","text":"Graph getGraph();","title":""},{"docid":"28a8e0215f5bebcd1f3642726ff7e827","score":"0.53037494","text":"void graph(Injector injector) throws IOException;","title":""},{"docid":"47c81524a9154c13bf30d1a9e1074874","score":"0.52929294","text":"public void print() {\n\t\tIterator<Integer> iterator = V.keySet().iterator();\n\t\tSystem.out.println(\"\\n-----------graph----------------\");\n\t\twhile (iterator.hasNext()) {\n\t\t\tVertex v = V.get(iterator.next());\n\t\t\tSystem.out.println(\"Vertex: \" + v.getNameString() + \", degree=\"\n\t\t\t\t\t+ v.getDegree());\n\t\t\tfor (Edge e : v.edges) {\n\t\t\t\tSystem.out.print(\"\\t\\t\");\n\t\t\t\te.print();\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"88d2c2678e1803f59d65a24a3c0398e1","score":"0.52894896","text":"static void showGraph(ArrayList<ArrayList<Integer>> graph) {\n for(int i=0;i< graph.size(); i++ ){\n System.out.print(\"Vertex : \" + i + \" : \");\n for(int j = 0; j < graph.get(i).size(); j++) {\n System.out.print(\" -> \"+ graph.get(i).get(j));\n }\n }\n }","title":""},{"docid":"786a2f3e996c450d297c1d2c986bd88c","score":"0.52854776","text":"private Vector<String> createGraph(){\n\t\tentityGraphMaker = new EntityGraphProcessor(sqlMgr);\n\t\tentityGraphMaker.createGraph();\n\t\treturn entityGraphMaker.getFactTables();\n\t}","title":""},{"docid":"4132b364c2d2eb0e4a2c577f523be047","score":"0.52735823","text":"int getDependenciesCount();","title":""},{"docid":"023f03d987c9cd1bfdc4c1acf96855cd","score":"0.52647704","text":"public static void printGraph(Graph g) {\n StringBuilder sb = new StringBuilder();\n sb.append(\"========== Graph Visualizer ==========\\n\");\n sb.append(\"(V):\\t|\\t(E):\\n\");\n for(Object o : g.getVertices()) {\n sb.append(o.toString() + \"\\t\\t|\\t\");\n StringBuilder adjBuilder = new StringBuilder();\n for(Object adj : g.getAdjacent(o)) {\n if(adjBuilder.length() > 0) {\n adjBuilder.append(\", \");\n }\n adjBuilder.append(adj.toString());\n adjBuilder.append(\"(\" + g.getEdgeCost(o, adj) + \")\");\n }\n sb.append(adjBuilder.toString() + \"\\n\");\n }\n System.out.println(sb.toString());\n }","title":""},{"docid":"8371092a4a8c6e967a3f83cdd3702479","score":"0.5250286","text":"Set<String> getDependencies();","title":""},{"docid":"4652c6df6c7820b996eb68bcb60bc124","score":"0.524953","text":"public static ImmutableGraph<FileDescriptorProto> buildDependencyGraph(\n FileDescriptorSet fileDescriptorSet) {\n\n MutableGraph<FileDescriptorProto> dependenciesGraph =\n buildFileDescriptorsGraph(fileDescriptorSet);\n\n ImmutableMap<String, FileDescriptorProto> knownDescriptors =\n buildFileDescriptorsMapping(fileDescriptorSet);\n\n fileDescriptorSet.getFileList().forEach(descriptorProto -> processFileDescriptor(dependenciesGraph, knownDescriptors, descriptorProto));\n\n Conditions.checkState(\n !Graphs.hasCycle(dependenciesGraph),\n CircularDependenciesException::new);\n\n return ImmutableGraph.copyOf(dependenciesGraph);\n }","title":""},{"docid":"8d1c90f08c9367e25ad6825827e63f70","score":"0.524804","text":"public void cumulateDependencyViolations(ModelTree mt) {\n \t// calculate state unallowed/allowed dependencies for the tree\n \t\t// compute unallowed dependency marks\n \t\tfor(ModuleNode mn : mt.getModules()) {\n \t\t\tboolean mnUnallowed = false;\n \t\t\tfor(PackageNode pn : mn.getPackages()) {\n \t\t\t\tboolean pnUnallowed = false;\n \t\t\t\tfor (ClassNode cn : pn.getClasses()) {\n \t\t\t\t\tif (cn instanceof DependentClassNode) {\n \t\t\t\t\t\tDependentClassNode dcn = (DependentClassNode) cn;\n \t\t\t\t\t\t\n \t\t\t\t\t\tDependenciesTreeModel dtm = new DependenciesTreeModel();\n \t\t\t\t\t\tdtm.setRoot(createModel(dcn, mt, dtm));\n \t\t\t\t\t\tdcn.getClassDependency().setUnallowedDependency(((UnallowedOrAllowedDependency) dtm.getRoot()).isUnallowedDependency()); \n \t\t\t\t\t\tdcn.setDependenciesTreeModel(dtm);\n \t\t\t\t\t\t\n \t\t\t\t\t\tif (dcn.getClassDependency().isUnallowedDependency()) {\n \t\t\t\t\t\t\tpnUnallowed = true;\n \t\t\t\t\t\t\tmnUnallowed = true;\n \t\t\t\t\t\t}\n \t\t\t\t\t\t\n \t\t\t\t\t\tdtm = new DependenciesTreeModel();\n \t\t\t\t\t\tdtm.setRoot(createIncomingModel(dcn, mt, dtm));\n \t\t\t\t\t\tdcn.setIncomingDependenciesTreeModel(dtm);\n \t\t\t\t\t}\n \t\t\t\t}\n \t\t\t\t\n \t\t\t\tif (pn instanceof DependentPackageNode) {\n \t\t\t\t\t((DependentPackageNode) pn).setUnallowedDependency(pnUnallowed);\n \t\t\t\t}\n \t\t\t}\n \n \t\t\tif (mn instanceof DependentModuleNode) {\n \t\t\t\t((DependentModuleNode) mn).setUnallowedDependency(mnUnallowed);\n \t\t\t}\n \t\t}\n \t}","title":""},{"docid":"5b4690b9afb3805820d6adaac8b59738","score":"0.5247962","text":"public static void main(String[] args) {\n generator = new Random();\n\n\n ListGraph graph = CreateDirectedAcyclicGraph();\n FrmGraph frm = new FrmGraph(graph,70);\n\n\n //-- undirected ve acyclic metodları hatalı\n if ( is_undirected(graph)) {\n System.out.println(\"Graph is undirected\");\n }\n else {\n System.out.println(\"Graph is directed\");\n }\n\n if ( is_acyclic_graph(graph)) {\n System.out.println(\"Graph is acyclic\");\n }\n else {\n System.out.println(\"Graph is cyclic\");\n }\n\n\n }","title":""},{"docid":"2ac1027f4a569a982c3f1d64e1936f6c","score":"0.5239291","text":"public Graph getGraph();","title":""},{"docid":"9891672e78e24adf39782ae572f39fa0","score":"0.5237613","text":"private void displayNodeColors() {\n System.out.println(\"Displaying all room names...\");\n for(Node i : mGraph)\n System.out.println(i.getRoomName());\n }","title":""},{"docid":"8722b7183d4bb1b3b85cf8fe78b7d5b2","score":"0.52348155","text":"private void clearDependencies() {\n depend.removeAllElements();\n try {\n removeAllReferences();\n }\n catch (VisADException exc) { }\n catch (RemoteException exc) { }\n }","title":""},{"docid":"62d9e6dcaf0a33cee868e553690d7404","score":"0.52252924","text":"public ModelTree getModelTree(DependencyVisitor dv) throws OverlappingModulesDefinitionException {\n \tDefaultModelTree result = new DefaultModelTree();\n \t\n \t// build ModelTree\n \tfor(String packagename : dv.getPackages().keySet()) {\n \n \t\t// get the module for this package\n \t\t\tString packagemodule = getMatchingModule(packagename+\"/Dummy\");\n \t\t\t\n \t\t\tboolean packageUnassigned = false;\n \t\t\tif (packagemodule == null) {\n \t\t\t\tpackagemodule = \"unassigned\";\n \t\t\t\tpackageUnassigned = true;\n \t\t\t}\n \t\t\t\n \t\t\tModuleNode module = result.getModule(packagemodule);\n \t\t\t\n \t\t\tif (module == null) {\n \t\t\t\tmodule = new DependentModuleNode(packagemodule, packageUnassigned);\n \t\t\t\tresult.add(module);\n \t\t\t}\n \t\t\t\n \t\t\t// add the new package node\n \t\tDefaultPackageNode packagenode = new DependentPackageNode(packagename);\n \t\t\tmodule.add(packagenode);\n \n \t\tfor(String classname : dv.getPackages().get(packagename)) {\n \t\t\t// add class nodes for all packages\n \t\t\tpackagenode.add(new DependentClassNode(new ClassDependency(classname)));\n \t\t}\n \t}\n \n \t// add dependencies\n \tfor(String classname : dv.getDependencies().keySet()) {\n \t\tfor(String dep : dv.getDependencies().get(classname).keySet()) {\n \t\t\t// create ClassDependency\n \t\t\tClassDependency cd = new ClassDependency(dep);\n \t\t\t\n \t\t\tfor(Integer line : dv.getDependencies().get(classname).get(dep)) {\n \t\t\t\tcd.addLineNumber(line);\n \t\t\t}\n \n \t\t\tcd.setUnallowedDependency(isUnallowedDependency(classname, dep));\n \t\t\t\n \t\t\t// and add it to the ClassNode\n \t\t\t\tClassNode cn = result.getClassNode(classname);\n \t\t\t\tif (cn != null) {\n \t\t\t\t\tcn.addClassDependency(cd);\n \t\t\t\t} else {\n \t\t\t\t\tSystem.out.println(\"Class \"+classname+\" not found (to \"+dep+\")!\");\n \t\t\t\t}\n \t\t}\n \t}\n \n \tcumulateDependencyViolations(result);\n \t\n \treturn result;\n }","title":""},{"docid":"1911eac64148d1dcbf8b006a8fad1b4b","score":"0.52248025","text":"private void displayWorkflow(Workflow w) {\r\n Graph graph = new Graph(w.getWorkflowName(), Graph.DIGRAPH);\r\n nodes.clear();\r\n //Create the nodes\r\n w.getWorkflowStepList().forEach(step -> {\r\n addStep(step, graph);\r\n //Now add the links\r\n step.getSourceTransitions().forEach(t -> {\r\n addStep(t.getWorkflowStepSource(), graph);\r\n addStep(t.getWorkflowStepTarget(), graph);\r\n Subgraph.Edge edge\r\n = graph.addEdge(nodes.get(t.getWorkflowStepSource()\r\n .getWorkflowStepPK().getId()),\r\n nodes.get(t.getWorkflowStepTarget()\r\n .getWorkflowStepPK().getId()));\r\n edge.setParam(\"label\", TRANSLATOR.translate(t.getTransitionName()));\r\n //Workaround https://github.com/pontusbostrom/VaadinGraphvizComponent/issues/9\r\n edge.setDest(nodes.get(t.getWorkflowStepTarget()\r\n .getWorkflowStepPK().getId()));\r\n edges.put(TRANSLATOR.translate(t.getTransitionName()),\r\n new AbstractMap.SimpleEntry<>(\r\n nodes.get(t.getWorkflowStepSource()\r\n .getWorkflowStepPK().getId()), edge));\r\n });\r\n });\r\n diagram.drawGraph(graph);\r\n }","title":""},{"docid":"88fc73a199a284b5e263ebd7c4392919","score":"0.5219778","text":"public void printVerteces() {\n sortVertices();\n System.out.println(\"Adjacent Vertices of every vertex: \\n\");\n int i = 0;\n while (vertexlist[i] != null) {\n System.out.print(\"Vertex \" + i + \" {\" + vertexlist[i].label + \"} - VISIT: \" + vertexlist[i].wasVisited\n + \" - ADJACENCY: \");\n int numberOfAdj = 0;\n // we need another loop to find all the verteces that connected to the vertex\n int j = 0;\n while (vertexlist[j] != null) {\n if (adjMat[i][j] != 0) {\n if (numberOfAdj == 0) {\n // in this case first adjacent will be printed\n System.out.print(j);\n } else {\n System.out.print(\", \" + j); // only the first number has no comm before it\n }\n numberOfAdj++;\n }\n j++;\n }\n System.out.println();\n i++;\n }\n }","title":""},{"docid":"bdd3edacd5fdbbb6363841cfb793c59e","score":"0.5181404","text":"public static void main(String[] args) {\n\n\t\t Graph<String> g = new Graph<String>();\n\t\t g.addVertex(\"A\");\n\t\t g.addVertex(\"B\");\n\t\t g.addVertex(\"C\");\n\t\t g.addVertex(\"D\");\n\t\t g.addVertex(\"E\");\n\t\t g.addArc(\"A\", \"B\", 1);\n\t\t g.addArc(\"A\", \"C\", 3);\n\t\t g.addArc(\"B\", \"C\", 1);\n\t\t g.addArc(\"B\", \"D\", 8);\n\t\t g.addArc(\"C\", \"D\", 2);\n\t\t g.addArc(\"A\", \"E\", 1);\n\t\t g.addArc(\"E\", \"C\", 1);\n\t\t g.addArc(\"E\", \"D\", 1);\n\t\t System.out.println(g.countCycles());\n\t\t// System.out.println(g.countCycles(\"A\"));\n\n\t\t// Automata automata = new Automata(\"q0\", false);\n\t\t// automata.addState(\"q1\", false);\n\t\t// automata.addState(\"q2\", true);\n\t\t// automata.addState(\"q3\", false);\n\t\t// automata.addState(\"q4\", true);\n\t\t// automata.addTransition(\"a\", \"q0\", \"q1\");\n\t\t// automata.addTransition(\"b\", \"q1\", \"q1\");\n\t\t// automata.addTransition(\"b\", \"q1\", \"q2\");\n\t\t// automata.addTransition(\"c\", \"q1\", \"q3\");\n\t\t// automata.addTransition(\"a\", \"q3\", \"q4\");\n\t\t// System.out.println(\"estos tienen que ser false\");\n\t\t// System.out.println(automata.isAccepted(\"a\"));\n\t\t// System.out.println(automata.isAccepted(\"ad\"));\n\t\t// System.out.println(automata.isAccepted(\"abbba\"));\n\t\t// System.out.println(automata.isAccepted(\"abbcab\"));\n\t\t// System.out.println(automata.isAccepted(\"abbbc\"));\n\t\t// System.out.println(\"estos tienen que ser true\");\n\t\t// System.out.println(automata.isAccepted(\"ab\"));\n\t\t// System.out.println(automata.isAccepted(\"abb\"));\n\t\t// System.out.println(automata.isAccepted(\"abbbb\"));\n\t\t// System.out.println(automata.isAccepted(\"abbbca\"));\n\t}","title":""},{"docid":"e37f608c6b80d350ad7dda759a140a04","score":"0.51716024","text":"public void updateGraph() {\n\t\tgetChildren().addAll(graphFactory.getGraphicalElements());\n\t}","title":""},{"docid":"4da73a8946a30062bd90611da98285d4","score":"0.51676685","text":"public void printNodes()\n {\n\t System.out.println(\"Nodi del grafo:\");\n\t\n\t for(Object o : nodes)\n\t {\n\t\t if(o instanceof Topic)\n\t\t\t //System.out.println(((Topic)o)+\" \"+((Topic)o).getLabel()); \n\t\t System.out.println(((Topic)o)); \n\t\t else\n\t\t\t if(o instanceof Type)\n\t\t\t\t System.out.println(((Type)o).toString());\n\t }\n }","title":""},{"docid":"539eef364742d2274dc0e11dbdc9f520","score":"0.5159781","text":"public static void main(String[] args){\n int[] mainnodes=new int[]{4,3,1,7,8};\n GraphAdj g = new GraphAdj(mainnodes);\n \n g.addDirecEdge(0,1);\n g.addDirecEdge(0,2);\n g.addDirecEdge(1,4);\n g.addDirecEdge(2,1);\n g.addDirecEdge(2,4);\n g.addDirecEdge(3,0);\n g.addDirecEdge(3,2);\n g.addDirecEdge(3,4);\n \n System.out.println(\"Adjacency List\");\n g.print();\n \n System.out.println();\n \n \n GraphMat g2 = new GraphMat(mainnodes);\n \n g2.addDirecEdge(0,1);\n g2.addDirecEdge(0,2);\n g2.addDirecEdge(1,4);\n g2.addDirecEdge(2,1);\n g2.addDirecEdge(2,4);\n g2.addDirecEdge(3,0);\n g2.addDirecEdge(3,2);\n g2.addDirecEdge(3,4);\n \n System.out.println(\"Adjacency Matrix\");\n g2.print();\n \n \n System.out.println();\n \n \n GraphAdj g3 = new GraphAdj(mainnodes);\n \n g3.addDirecEdge(0,1);\n g3.addDirecEdge(0,2);\n g3.addDirecEdge(1,4);\n g3.addDirecEdge(2,1);\n g3.addDirecEdge(2,4);\n g3.addDirecEdge(3,0);\n g3.addDirecEdge(3,2);\n g3.addDirecEdge(3,4);\n \n System.out.println();\n System.out.println(\"BFS\");\n System.out.println(g3.BFS(0));\n System.out.println();\n \n \n GraphAdj g4 = new GraphAdj(6);\n \n g4.addDirecEdge(0,1);\n g4.addDirecEdge(0,3);\n g4.addDirecEdge(1,4);\n g4.addDirecEdge(2,4);\n g4.addDirecEdge(2,5);\n g4.addDirecEdge(3,1);\n g4.addDirecEdge(4,3);\n g4.addDirecEdge(5,5);\n \n System.out.println(\"DFS\");\n g4.doDFS();\n \n \n //Toological Sort\n \n String[] names=new String[]{\"Foundation\",\"Walls\",\"Plumbing\",\"Windows\",\"Roofs\",\"Decoration\"};\n GraphAdj g5 = new GraphAdj(names);\n \n g5.addDirecEdge(0,1);\n g5.addDirecEdge(1,2);\n g5.addDirecEdge(1,3);\n g5.addDirecEdge(1,4);\n g5.addDirecEdge(2,5);\n g5.addDirecEdge(3,5);\n g5.addDirecEdge(4,5);\n \n TopoList sorted = g5.TopSort();\n System.out.println();\n System.out.println(\"Topographical Sort\");\n sorted.print();\n \n\n \n \n \n \n GraphAdj g6 = new GraphAdj(8);\n g6.addDirecEdge(0,1);\n g6.addDirecEdge(1,2);\n g6.addDirecEdge(1,4);\n g6.addDirecEdge(1,5);\n g6.addDirecEdge(2,3);\n g6.addDirecEdge(2,6);\n g6.addDirecEdge(3,2);\n g6.addDirecEdge(3,7);\n g6.addDirecEdge(4,0);\n g6.addDirecEdge(4,5);\n g6.addDirecEdge(5,6);\n g6.addDirecEdge(6,5);\n g6.addDirecEdge(6,7);\n g6.addDirecEdge(7,7);\n \n System.out.println();\n System.out.println(\"SCC\");\n \n SCList res=g6.sepSCC();\n res.print();\n \n \n \n }","title":""},{"docid":"ebbc852f3dbe6c5519043e8dcb94f070","score":"0.5155594","text":"private void displayGraph(String type, boolean selected){\n\t\ttry{\n\t\t\tif(selected && type.equals(\"er\"))\n\t\t\t\tentityGraphMaker.graphUI.displayGraph();\n\t\t\tif(selected && type.equals(\"dim\"))\n\t\t\t\tdimensionalGraphMaker.graphUI.displayGraph();\n\n\t\t}catch(NullPointerException e){\n\t\t\tSystem.out.println(\"DB Graph not yet created\");\n\t\t}\n\t}","title":""},{"docid":"33ef8dda1095ca442d5397190dd83dfa","score":"0.5155034","text":"public static void printComponent(JGraph c) {\n new GraphPrint(c).print();\n }","title":""},{"docid":"4eb65b57429aa1655293aeb4396e732b","score":"0.5145565","text":"public void printAdjLists()\n {\n for(int i = 0; i < n; i++)\n {\n System.out.print(\"Adj list of vertex \" + i + \": \");\n Vertex v = adj[i];\n while(v != null)\n {\n if (v.next != null)\n System.out.print(v.id + \"->\");\n else\n System.out.print(v.id);\n v = v.next;\n }\n System.out.println();\n }\n System.out.println();\n }","title":""},{"docid":"6265bb11b5837c6d6215608d953c6368","score":"0.51450044","text":"public HashMap<String,HashSet<String>> transitiveclosure(){\n\t\tHashMap<String, HashSet<String>> rNodeset = new HashMap<String, HashSet<String>>();\n\t\tfor(String n:this.vertexSet()){\n\t\t\tHashSet<String> hset = (HashSet<String>) this.bfsreturn(n).keySet();\n\t\t\trNodeset.put(n, hset);\n\t\t\tSystem.out.println(n+\" reachable nodes number \" + rNodeset.get(n).size());\n\t\t}\n\t\treturn rNodeset;\n\t}","title":""},{"docid":"fec7fe06ebd9aa0f150a7fbb016c4bb1","score":"0.51434195","text":"public Collection getDeps()\r\n/* 72: */ {\r\n/* 73: 91 */ return this.deps;\r\n/* 74: */ }","title":""},{"docid":"f7ba6c839725458acdacd77eb0b9c8ce","score":"0.51310694","text":"Set<String> getDependencies(Node question);","title":""},{"docid":"290bf8db3ea1e8f1a5b536464b50510b","score":"0.5126919","text":"private void _computePortDepth(DirectedAcyclicGraph dependencyGraph) {\n // local variable to turn on/off debugging messages\n boolean verbose = false;\n\n // The following topologicalSort can be smarter.\n // In particular, the dependency between ports belonging\n // to the same actor may be considered.\n Object[] sort = dependencyGraph.topologicalSort();\n int numberOfPorts = sort.length;\n\n if (_debugging && verbose) {\n _debug(\"## Result of topological sort (highest depth to lowest):\");\n }\n\n // Allocate a new hash table with the size equal to the\n // number of IO ports sorted.\n _portToDepth = new Hashtable(numberOfPorts);\n\n LinkedList ports = new LinkedList();\n\n // Assign depths to ports based on the topological sorting result.\n // Each port is assigned a depth.\n for (int i = 0; i < numberOfPorts; i++) {\n IOPort ioPort = (IOPort) sort[i];\n ports.add(ioPort);\n int depth = i;\n Actor portContainer = (Actor) ioPort.getContainer();\n // The output ports of the composite actor that contains\n // this director are set to the highest depth\n // (the lowest priority) and the input ports are given\n // the highest priorities because they are sources.\n if (portContainer.equals(getContainer())) {\n if (ioPort.isOutput()) {\n depth += numberOfPorts;\n } else {\n depth -= numberOfPorts;\n }\n }\n\n // Insert the hashtable entry.\n _portToDepth.put(ioPort, Integer.valueOf(depth));\n if (_debugging && verbose) {\n _debug(((Nameable) ioPort).getFullName(), \"depth: \" + depth);\n }\n }\n\n if (_debugging && verbose) {\n _debug(\"## adjusting port depths based \"\n + \"on the strictness constraints.\");\n }\n\n LinkedList actorsWithPortDepthsAdjusted = new LinkedList();\n\n // Adjust the port depths based on the strictness constraints.\n // The ruls is that if an output depends on several inputs directly,\n // all inputs must have the same depth, the biggest one.\n for (int i = sort.length - 1; i >= 0; i--) {\n IOPort ioPort = (IOPort) sort[i];\n // Get the container actor of the current output port.\n Actor portContainer = (Actor) ioPort.getContainer();\n // we skip the ports of the container and their depths are handled\n // by the upper level executive director of this container.\n if (portContainer.equals(getContainer())) {\n continue;\n }\n // Normally, we adjust port depths based on output ports.\n // However, if this input port belongs to a sink actor, and\n // the sink actor has more than one input ports, adjust the depths\n // of all the input ports to their maximum value.\n // For exmaple, the XYPlotter in the WirelessSoundDetection demo.\n // By default, all composite actors are non-strict. However, if\n // a composite actor declares its strictness with an attribute,\n // we adjust its input ports depths to their maximum. One example\n // is the ModalModel.\n // A third case is that if a composite actor has some of its input\n // ports as parameter ports and the others as reguler IO ports,\n // we need to adjust the depths of paramter ports also.\n // The TimedSinewave (with SDF implementation) is an example.\n // Since this actor is supposed to be a strict actor, we need to\n // add a strictness marker such that the depths of all its inputs\n // are adjusted to their maximum value.\n // For non-strict composite actors, one solution is to iterate\n // each output port and find all the parameter ports that affect\n // that output port. Note that a parameter may depend on another\n // parameter at the same level of hierarchy, which makes the\n // analysis harder. One reference will be the context analysis by\n // Steve.\n // I prefer to leave the parameter analysis to be independent of the\n // function dependency analysis. 02/2005 hyzheng\n\n // Find the set of the ports that need depths adjusted.\n List inputPorts;\n if (ioPort.isInput()) {\n boolean depthNeedsAdjusted = false;\n int numberOfOutputPorts = portContainer.outputPortList().size();\n // If an actor has no output ports, adjustment is necessary.\n if (numberOfOutputPorts == 0) {\n depthNeedsAdjusted = true;\n }\n // If the actor declares itself as a strict actor,\n // adjustment is necessary.\n if (portContainer.isStrict()) {\n depthNeedsAdjusted = true;\n }\n if (depthNeedsAdjusted) {\n // If depth needs adjusted:\n inputPorts = portContainer.inputPortList();\n if (inputPorts.size() <= 1) {\n // If the sink actor has only one input port, there is\n // no need to adjust its depth.\n continue;\n }\n // If the depths of the input ports of this acotr\n // have been adjusted, skip it. Otherwise, add it into the\n // list actorsWithPortDepthsAdjusted.\n if (actorsWithPortDepthsAdjusted.contains(portContainer)) {\n continue;\n } else {\n actorsWithPortDepthsAdjusted.add(portContainer);\n }\n } else {\n continue;\n }\n } else {\n // The ioPort is an output port.\n // Get the function dependency of the container actor\n FunctionDependency functionDependency = portContainer\n .getFunctionDependency();\n inputPorts = functionDependency\n .getInputPortsDependentOn(ioPort);\n }\n // Iterate all input ports the current output depends on,\n // find their maximum depth.\n Iterator inputsIterator = inputPorts.iterator();\n int maximumPortDepth = -1;\n while (inputsIterator.hasNext()) {\n Object object = inputsIterator.next();\n IOPort input = (IOPort) object;\n int inputPortDepth = ports.indexOf(input);\n if (maximumPortDepth < inputPortDepth) {\n maximumPortDepth = inputPortDepth;\n }\n }\n // Set the depths of the input ports to the maximum one.\n inputsIterator = inputPorts.iterator();\n while (inputsIterator.hasNext()) {\n IOPort input = (IOPort) inputsIterator.next();\n if (_debugging && verbose) {\n _debug(((Nameable) input).getFullName(),\n \"depth is adjusted to: \" + maximumPortDepth);\n }\n // Insert the port the hashtable entry.\n _portToDepth.put(input, Integer.valueOf(maximumPortDepth));\n }\n }\n if (_debugging) {\n _debug(\"## End of topological sort of ports.\");\n }\n }","title":""},{"docid":"f9a0d201706d9be536f7b7865863c5c2","score":"0.5122656","text":"public static void dfsPrintTrace(Graph g) {\n\t\tboolean [] marked = new boolean[g.V()];\n\t dfsPrintTrace(g, 0, marked, 0);\n\t}","title":""},{"docid":"87c3edfeedf543a897cc80214a1a5614","score":"0.5121842","text":"public String prettyPrint(InclusionDependency ind) {\n StringBuffer sb = new StringBuffer();\n IdUtils idUtils = this.metadataStore.getIdUtils();\n int depSchemaId = idUtils.getSchemaId(ind.getTargetReference().getDependentColumns()[0]);\n Schema depSchema = this.metadataStore.getSchemaById(depSchemaId);\n int depTableId = idUtils.getTableId(ind.getTargetReference().getDependentColumns()[0]);\n Table depTable = depSchema.getTableById(depTableId);\n sb.append(depTable.getName()).append(\"[\");\n String separator = \"\";\n for (int columnId : ind.getTargetReference().getDependentColumns()) {\n sb.append(separator).append(depTable.getColumnById(columnId).getName());\n separator = \", \";\n }\n sb.append(\"] < \");\n int refSchemaId = idUtils.getSchemaId(ind.getTargetReference().getReferencedColumns()[0]);\n Schema refSchema = this.metadataStore.getSchemaById(refSchemaId);\n int refTableId = idUtils.getTableId(ind.getTargetReference().getReferencedColumns()[0]);\n Table refTable = refSchema.getTableById(refTableId);\n sb.append(refTable.getName()).append(\"[\");\n separator = \"\";\n for (int columnId : ind.getTargetReference().getReferencedColumns()) {\n sb.append(separator).append(refTable.getColumnById(columnId).getName());\n separator = \", \";\n }\n sb.append(\"]\");\n return sb.toString();\n }","title":""},{"docid":"e5fcf1f2b0e2c9893ebf66a1b814fede","score":"0.51203895","text":"private void showGraph()\n {\n container.getChildren().remove(1);\n container.getChildren().add(barchart);\n container.setVgrow(barchart, Priority.ALWAYS);\n }","title":""},{"docid":"219ffc8f3e78a0f6b8e268b3bf0fa8ad","score":"0.51203525","text":"public void addEdges() {\n\n // subCoord == subject coordinate\n // depCoord == dependency coordinate\n int subCoord = 0;\n int depCoord = 0;\n String subject, dependency;\n\n // arrPos == array position\n // for each entry, do\n for (int arrPos = 0; arrPos < subjectGraph.length; arrPos++) {\n\n subject = subjectGraph[arrPos].get(0);\n\n // depNum == dependency number\n // for each dependency, do\n for (int depNum = 1; depNum < subjectGraph[arrPos].size(); depNum++) {\n\n dependency = subjectGraph[arrPos].get(depNum);\n\n // subInd == subject index\n // get subject's and its dependency position in the subject list\n for (int subInd = 0; subInd < subjectIndex.size(); subInd++) {\n\n if (subject.compareTo(subjectIndex.get(subInd)) == 0) {\n\n subCoord = subInd;\n\n } else if (dependency.compareTo(subjectIndex.get(subInd)) == 0) {\n\n depCoord = subInd;\n\n }\n }\n\n vertices[subCoord][depCoord] = 1;\n\n }\n }\n }","title":""},{"docid":"012d5320fb512312406cebd4b66b4426","score":"0.51179373","text":"public abstract List<Dependants> getAllDependants();","title":""},{"docid":"cd63bab1ead3d34a5b8872776d1a82b2","score":"0.51152086","text":"protected void showList() {\n for (int i = 0; i < visited.size(); i++) {\n System.err.print(visited.get(i).getId() + \"\\t\");\n System.err.println(visited.get(i).getLabel());\n }\n }","title":""},{"docid":"bcb62940d901e750c47239ba133b8d2c","score":"0.51112336","text":"@Override\n public String toString() {\n return String.format(\"%s\", this.dep);\n }","title":""},{"docid":"3a0249d79aad0bfd3f01fc8390cf50e6","score":"0.5107522","text":"public static DependencyGraph getTransitiveDependencies(Artifact artifact)\n throws DependencyCollectionException, DependencyResolutionException {\n \n // root node\n DependencyNode node = resolveCompileTimeDependencies(artifact); \n DependencyGraph graph = new DependencyGraph();\n preorder(new Stack<>(), node, graph);\n \n return graph;\n }","title":""},{"docid":"82bd602762866c16318cf8c977f3a0e8","score":"0.5100805","text":"public static void main(String[] args) {\n\t\tGraph g = new Graph();\n\t\tfor(int i = 0; i <= 5; i++) {\n\t\t\tg.addKnoten();\n\t\t}\n\t\t\n\t\tg.addKante(1,3,10);\n\t\tg.addKante(2,1,1);\n\t\tg.addKante(2,4,7);\n\t\tg.addKante(3,1,3);\n\t\tg.addKante(3,2,4);\n\t\tg.addKante(3,4,2);\n\t\tg.addKante(5,3,1);\n\t\tg.addKante(5,4,2);\n\t\t\n\t\tSystem.out.println(g);\n\t\t\n\t\tint[] vorg = g.tiefensuche(2);\n\t\tfor(int i = 0; i < vorg.length; i++) {\n\t\t\tSystem.out.println((i) + \" \" + vorg[i]);\n\t\t}\n\t\t\n\t\tvorg = g.breitensuche(2);\n\t\tfor(int i = 0; i < vorg.length; i++) {\n\t\t\tSystem.out.println((i) + \" \" + vorg[i]);\n\t\t}\n\t\t\n\t\tGraph g2 = new Graph(7);\n\t\tg2.addUngerichteteKante(1,2,10);\n\t\tg2.addUngerichteteKante(1,4,9);\n\t\tg2.addUngerichteteKante(2,3,5);\n\t\tg2.addUngerichteteKante(2,5,4);\n\t\tg2.addUngerichteteKante(2,4,3);\n\t\tg2.addUngerichteteKante(3,5,10);\n\t\tg2.addUngerichteteKante(4,5,8);\n\t\tg2.addUngerichteteKante(4,6,6);\n\t\tg2.addUngerichteteKante(5,6,2);\n\t\tg2.addUngerichteteKante(5,7,7);\n\t\tg2.addUngerichteteKante(6,7,11);\n\t\tGraph minSpanTree = g2.kruskal();\n\t\tSystem.out.println(minSpanTree);\n\t\t\n\t\tGraph g3 = new Graph(8);\n\t\tg3.addUngerichteteKante(1,2,3);\n\t\tg3.addUngerichteteKante(1,3,45);\n\t\tg3.addUngerichteteKante(2,3,28);\n\t\tg3.addUngerichteteKante(2,4,26);\n\t\tg3.addUngerichteteKante(3,8,25);\n\t\tg3.addUngerichteteKante(3,5,16);\n\t\tg3.addUngerichteteKante(4,5,7);\n\t\tg3.addUngerichteteKante(4,6,21);\n\t\tg3.addUngerichteteKante(5,7,27);\n\t\tg3.addUngerichteteKante(6,7,14);\n\t\tg3.addUngerichteteKante(7,8,5);\n\t\t\n\t\tint[] vor = g3.dijkstra(1);\n\t\tfor(int i = 0; i < vor.length; i++) {\n\t\t\tSystem.out.println(i + \" : \" + vor[i]);\n\t\t}\n\t\t\n\t\tint[][] floyd = g3.floyd_warshall();\n\t\tfor(int i = 1; i < floyd.length; i++) {\n\t\t\tfor(int j = 1; j < floyd.length; j++) {\n\t\t\t\tSystem.out.print(floyd[i][j] + \" \");\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t}\n\t}","title":""},{"docid":"4169cde3766f822498d516dbd8cfb0b0","score":"0.5099115","text":"public void printGraph() {\n System.out.println(\"The graph has \" + n + \" vertices.\");\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (edges[i][j])\n System.out.print(1 + \" \");\n if (!edges[i][j])\n System.out.print(0 + \" \");\n if (j == (n - 1)) System.out.println();\n\n }\n }\n }","title":""},{"docid":"e82b694b12d7275fd84374454f8a87c1","score":"0.50914276","text":"Set<String> getRequiredDependencies();","title":""},{"docid":"54c56870731ad8613e384e2b03472189","score":"0.5090526","text":"public interface Graph {\n}","title":""},{"docid":"54c56870731ad8613e384e2b03472189","score":"0.5090526","text":"public interface Graph {\n}","title":""}],"string":"[\n {\n \"docid\": \"60e2eea778f4f7db4128ccfacc2c1672\",\n \"score\": \"0.6612193\",\n \"text\": \"public String getDisplayName() {\\n\\t\\treturn \\\"Dependency Graph\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03ce15b4ac899659612ccc8517602886\",\n \"score\": \"0.6586445\",\n \"text\": \"protected void printContainerDependencies() {\\n MapIterator<?, HelmChart> it = chartsReferenced.mapIterator();\\n try {\\n while (it.hasNext()) {\\n it.next();\\n HelmChart h = it.getValue();\\n for (HelmDeploymentContainer c : h.getContainers()) {\\n getPrinter().printChartToImageDependency(h, c.getImage());\\n }\\n }\\n } catch (ChartMapException e) {\\n logger.error(LOG_FORMAT_2, \\\"Error printing image dependencies: \\\", e.getMessage());\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e562a87ef0b8f07444a0d6ee32aef60\",\n \"score\": \"0.64627314\",\n \"text\": \"public void printGraph();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"441dc47ee5421e6cf058b1fd89dfb1bd\",\n \"score\": \"0.64369416\",\n \"text\": \"public void printGraph(){\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8fa9a2cef67dd08de3445741218e0c6d\",\n \"score\": \"0.64160943\",\n \"text\": \"public interface DependencyGraphBuilder {\\n\\n\\t/**\\n\\t * Build the dependency graph\\n\\t * \\n\\t * @param artifacts\\n\\t * a set of artifacts to use as starting points when building the\\n\\t * graph\\n\\t * @param perNodeColouring\\n\\t * set to true to colour nodes by group from a fixed palette,\\n\\t * cycling if there are more groups than entries in the palette\\n\\t * @param showGroupsAsCluster\\n\\t * set to true to force artifacts in the same group to be\\n\\t * clustered in the graph\\n\\t * @param compactClusters\\n\\t * set to true to only show clusters with direct artifact\\n\\t * children, false to show all clusters leading to an artifact\\n\\t * @param removeTransitiveDependencies\\n\\t * set to true to remove any direct dependencies which are\\n\\t * entirely implied by (mandatory) transitive dependencies\\n\\t * @param showOptionalDependencies\\n\\t * set to true to show optional dependencies between artifacts in\\n\\t * the graph as dotted lines, false to not show them at all\\n\\t * @param convergeSystemArtifacts\\n\\t * set to true to force any dependencies on an artifact with a\\n\\t * corresponding system artifact to use the system artifact\\n\\t * instead\\n\\t * @param excludedArtifacts\\n\\t * a set of artifacts which should act as 'stop' conditions in\\n\\t * the dependency graph and which will not be included in the\\n\\t * result. These may be mandatory dependencies that are removed\\n\\t * from the visualisation to produce a cleaner layout,\\n\\t * particularly the case for logging and similar APIs where\\n\\t * almost all artifacts will have a dependency on them. Use null\\n\\t * to use the default set of excluded artifacts defined in the\\n\\t * application context for this bean, or an empty set to\\n\\t * explicitly assert that there should be no exclusions\\n\\t * @return a dot format string which can be rendered to show dependency\\n\\t * information\\n\\t */\\n\\tString getDependencyGraph(Set<ArtifactIdentifier> artifacts,\\n\\t\\t\\tboolean perNodeColouring, boolean showGroupsAsCluster,\\n\\t\\t\\tboolean compactClusters, boolean removeTransitiveDependencies,\\n\\t\\t\\tboolean showOptionalDependencies, boolean convergeSystemArtifacts,\\n\\t\\t\\tSet<ArtifactIdentifier> excludedArtifacts);\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"041f8b142ca631748532f07d3dc637a0\",\n \"score\": \"0.6306204\",\n \"text\": \"public interface DependencyGraphs {\\n\\n /**\\n * Returns the compile dependency graph.\\n */\\n @NonNull\\n List<GraphItem> getCompileDependencies();\\n\\n /**\\n * Returns the package dependency graph.\\n *\\n * Only valid in full dependency mode.\\n */\\n @NonNull\\n List<GraphItem> getPackageDependencies();\\n\\n /**\\n * Returns the list of provided libraries.\\n *\\n * The values in the list match the values returned by {@link GraphItem#getArtifactAddress()}\\n * and {@link Library#getArtifactAddress()}.\\n *\\n * Only valid in full dependency mode.\\n */\\n @NonNull\\n List<String> getProvidedLibraries();\\n\\n /**\\n * Returns the list of skipped libraries.\\n *\\n * The values in the list match the values returned by {@link GraphItem#getArtifactAddress()}\\n * and {@link Library#getArtifactAddress()}.\\n *\\n * Only valid in full dependency mode.\\n */\\n @NonNull\\n List<String> getSkippedLibraries();\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5935d44d63530c0f7212162f5fb40dea\",\n \"score\": \"0.62563044\",\n \"text\": \"public void showGraph() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b00f5ce6b7cfdf3f03e70961e9e79644\",\n \"score\": \"0.6031264\",\n \"text\": \"String getDependencyGraph(Set<ArtifactIdentifier> artifacts,\\n\\t\\t\\tboolean perNodeColouring, boolean showGroupsAsCluster,\\n\\t\\t\\tboolean compactClusters, boolean removeTransitiveDependencies,\\n\\t\\t\\tboolean showOptionalDependencies, boolean convergeSystemArtifacts,\\n\\t\\t\\tSet<ArtifactIdentifier> excludedArtifacts);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"185fd57fd49b5f0f257d6618ec2f4bee\",\n \"score\": \"0.59732175\",\n \"text\": \"protected void printChartDependencies(HelmChart parent) {\\n try {\\n if (parent.getNameFull().equals(chart.getNameFull())) {\\n getPrinter().printSectionHeader(\\\"Chart Dependencies\\\");\\n }\\n if (parent.getDiscoveredDependencies() != null) {\\n // Print the chart to chart dependencies recursively\\n boolean stable = isStable(parent, false); // check if the parent chart is stable\\n for (HelmChart dependent : parent.getDiscoveredDependencies()) {\\n if (!chartsDependenciesPrinted.contains(parent.getNameFull() + \\\"_\\\" + dependent.getNameFull())) {\\n getPrinter().printChartToChartDependency(parent, dependent);\\n // if the parent is stable and the child is not then print a message if verbose\\n if (stable && !isStable(dependent, true) && isVerbose()) {\\n getPrinter().printComment(\\\"WARNING: Chart \\\" + parent.getNameFull() + \\\" is stable but depends on \\\"\\n + dependent.getNameFull() + \\\" which may not be stable\\\");\\n }\\n chartsDependenciesPrinted.add(parent.getNameFull() + \\\"_\\\" + dependent.getNameFull());\\n }\\n printChartDependencies(dependent); // recursion\\n }\\n }\\n } catch (ChartMapException e) {\\n logger.error(LOG_FORMAT_2, \\\"Error printing chart dependencies: \\\", e.getMessage());\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"576028e47a9ee601b7ba73ac08fb0929\",\n \"score\": \"0.59556407\",\n \"text\": \"public void transitiveClosure() {\\n for (int i = 0; i < noOfVertices; i++) {\\n dfsUtil(i, i);\\n }\\n for (int i = 0; i < noOfVertices; i++) {\\n System.out.println(Arrays.toString(tc[i]));\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9bd86d40237894b9577d526cb7e26154\",\n \"score\": \"0.59263074\",\n \"text\": \"public void printGraph(){\\n\\tSystem.out.println(\\\"Graph:\\\");\\n\\toriginal.printGraph();\\n\\tSystem.out.print('\\\\n');\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b417986662defe2cdec7d06aa9b48efc\",\n \"score\": \"0.5870137\",\n \"text\": \"private DirectedSparseMultigraph dependencyTreeToSimpleGraph() {\\n\\n\\t\\tDirectedSparseMultigraph g = new DirectedSparseMultigraph();\\n\\n\\t\\tHashMap<Class, HashMap<Class, Integer>> classmap = new HashMap<>();\\n\\n\\t\\tfor (ArrayList<DependantTask> levelarray : ordered) {\\n\\t\\t\\tif (levelarray.size() > 0) {\\n\\t\\t\\t\\tfor (DependantTask task : levelarray) {\\n\\n\\t\\t\\t\\t\\tHashMap<Class, Integer> classconnectionsmap;\\n\\t\\t\\t\\t\\tclassconnectionsmap = classmap.get(task.getClass());\\n\\n\\t\\t\\t\\t\\tif (classconnectionsmap == null) {\\n\\t\\t\\t\\t\\t\\tclassconnectionsmap = new HashMap<>();\\n\\t\\t\\t\\t\\t\\tclassmap.put(task.getClass(), classconnectionsmap);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tfor (DependantTask childtask : task.depends_on_tasks) {\\n\\t\\t\\t\\t\\t\\tInteger classconnections;\\n\\t\\t\\t\\t\\t\\tclassconnections = classconnectionsmap.get(childtask.getClass());\\n\\n\\t\\t\\t\\t\\t\\tif (classconnections == null) {\\n\\t\\t\\t\\t\\t\\t\\tclassconnectionsmap.put(childtask.getClass(), 1);\\n\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\tclassconnectionsmap.put(childtask.getClass(), classconnections + 1);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (Map.Entry<Class, HashMap<Class, Integer>> vertice : classmap.entrySet()) {\\n\\t\\t\\tg.addVertex(general.getClassShortName(vertice.getKey()));\\n\\t\\t}\\n\\n\\t\\tfor (Map.Entry<Class, HashMap<Class, Integer>> vertice : classmap.entrySet()) {\\n\\n\\t\\t\\tfor (Map.Entry<Class, Integer> edge : vertice.getValue().entrySet()) {\\n\\t\\t\\t\\tEdgeName edgename = new EdgeName(edge.getValue().toString());\\n\\t\\t\\t\\tg.addEdge(edgename, general.getClassShortName(edge.getKey()), general.getClassShortName(vertice.getKey()));\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t\\treturn g;\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f3d8496a8dd23c4aeaaf7e796a8d836\",\n \"score\": \"0.5802345\",\n \"text\": \"@SuppressWarnings({ \\\"OverlyNestedMethod\\\" })\\n private void writeDotDependencies(Map<Node, List<Dependency>> dependencies, Collection<String> lines) throws IOException\\n {\\n Set<Node> set = dependencies.keySet();\\n Collection<String> resultSet = new HashSet<String>();\\n\\n for (Object aSet : set)\\n {\\n Dependency theNode = (Dependency) aSet;\\n\\n if (theNode instanceof NodeWithDependancies)\\n {\\n if (theNode.shouldPrint(preferences))\\n {\\n NodeWithDependancies node = (NodeWithDependancies) theNode;\\n String niceName = node.getNiceName();\\n List<Dependency> dependentNodes = node.getDepends();\\n\\n for (Dependency dependantNode : dependentNodes)\\n {\\n if (dependantNode.getName() != null)\\n {\\n String dependantNodeNiceName = dependantNode.getNiceName();\\n String dependencyExtraInfo = dependantNode.getDependencyExtraInfo();\\n\\n if (dependantNode.shouldPrint(preferences))\\n {\\n String line = \\\"\\\\t\\\\t\\\" + niceName + \\\" -> \\\" + dependantNodeNiceName + dependencyExtraInfo + ';';\\n\\n resultSet.add(line);\\n }\\n }\\n }\\n }\\n }\\n } // end for\\n\\n for (Object aResultSet : resultSet)\\n {\\n String line = (String) aResultSet;\\n\\n lines.add(line);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e47b7bda3565647d2a2b42b51d209143\",\n \"score\": \"0.578766\",\n \"text\": \"@Test\\n public void generateGraphVizFile() {\\n try (ScanResult scanResult = new ClassGraph().whitelistPackages(ROOT_PACKAGE).enableAllInfo().scan()) {\\n final String dotFile = scanResult.getAllClasses().generateGraphVizDotFile(20, 20);\\n assertThat(dotFile).contains(\\\"\\\\\\\"\\\" + ClsSub.class.getName() + \\\"\\\\\\\" -> \\\\\\\"\\\" + Cls.class.getName() + \\\"\\\\\\\"\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"304672154962f14c6ccce71aace2e2a2\",\n \"score\": \"0.5732783\",\n \"text\": \"private void checkFeatureDependencies(\\r\\n\\t\\t\\tDirectedGraph<DependencyNode, ValueContainerEdge<ConfigSet>> dependencyGraph) {\\r\\n\\t\\tSet<FeatureDependency> featureDependencySet = new HashSet<FeatureDependency>();\\r\\n\\t\\t\\r\\n\\t\\tSet<DependencyNode> sourceVertexSet = dependencyGraph.vertexSet();\\r\\n\\t\\tfor (DependencyNode srcNode : sourceVertexSet) {\\r\\n\\r\\n\\t\\t\\tif (!srcNode.isInSelection()) {\\r\\n\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tKShortestPaths<DependencyNode, ValueContainerEdge<ConfigSet>> shortestPaths = new KShortestPaths<DependencyNode, ValueContainerEdge<ConfigSet>>(dependencyGraph, srcNode, MAX_PATHS);\\r\\n\\t\\t\\tSet<DependencyNode> targetVertexSet = dependencyGraph.vertexSet();\\r\\n\\t\\t\\tfor (DependencyNode tgtNode : targetVertexSet) {\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif (tgtNode.equals(srcNode)) { // || tgtNode.getConfigSet().isTrueSet()) {\\r\\n\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\tList<GraphPath<DependencyNode, ValueContainerEdge<ConfigSet>>> paths = shortestPaths.getPaths(tgtNode);\\r\\n\\t\\t\\t\\t// If no paths between the nodes were found, then just move on to the next pair of nodes.\\r\\n\\t\\t\\t\\tif (paths == null) {\\r\\n\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tfor (GraphPath<DependencyNode, ValueContainerEdge<ConfigSet>> path : paths) {\\r\\n\\t\\t\\t\\t\\tConfigSet configAccumulator = null;\\r\\n\\t\\t\\t\\t\\tList<ValueContainerEdge<ConfigSet>> edgeList = path.getEdgeList();\\r\\n\\t\\t\\t\\t\\tfor (ValueContainerEdge<ConfigSet> edge : edgeList) {\\r\\n\\t\\t\\t\\t\\t\\tConfigSet value = edge.getValue();\\r\\n\\t\\t\\t\\t\\t\\tif (configAccumulator == null) {\\r\\n\\t\\t\\t\\t\\t\\t\\tconfigAccumulator = value;\\r\\n\\t\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\t\\tconfigAccumulator = configAccumulator.and(value);\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tint startLine = srcNode.getPosition().getStartLine() - 1;\\r\\n\\t\\t\\t\\t\\tString message = null;\\r\\n\\t\\t\\t\\t\\ttry {\\r\\n\\t\\t\\t\\t\\t\\tIDocument document = getDocument(srcNode.getPosition().getFilePath());\\r\\n\\t\\t\\t\\t\\t\\tmessage = document.get(document.getLineOffset(startLine), document.getLineLength(startLine)).toString().trim();\\r\\n\\t\\t\\t\\t\\t\\tmessage = document.get(document.getLineOffset(startLine), document.getLineLength(startLine)).toString().trim();\\r\\n\\t\\t\\t\\t\\t} catch (BadLocationException e) {\\r\\n\\t\\t\\t\\t\\t\\te.printStackTrace();\\r\\n\\t\\t\\t\\t\\t\\tmessage = \\\"Unknown\\\";\\r\\n\\t\\t\\t\\t\\t} catch (CoreException e) {\\r\\n\\t\\t\\t\\t\\t\\te.printStackTrace();\\r\\n\\t\\t\\t\\t\\t\\tmessage = \\\"Unknown\\\";\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n//\\t\\t\\t\\t\\t\\tif (!configAccumulator.isValid())\\r\\n//\\t\\t\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tFeatureDependency auxFeature = new FeatureDependency()\\r\\n\\t\\t\\t\\t\\t\\t\\t.setFile(ResourceUtil.getIFile(tgtNode.getPosition().getFilePath()))\\r\\n\\t\\t\\t\\t\\t\\t\\t.setFeature(tgtNode.getFeatureSet()\\r\\n\\t\\t\\t\\t\\t\\t\\t.toString())\\r\\n\\t\\t\\t\\t\\t\\t\\t.setLineNumber(tgtNode.getPosition().getStartLine())\\r\\n\\t\\t\\t\\t\\t\\t\\t.setMessage(message)\\r\\n\\t\\t\\t\\t\\t\\t\\t.setConfiguration(configAccumulator);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t/*\\r\\n\\t\\t\\t\\t\\t * Do not create an IMarker if an equivalent FeatureDependency already exists.\\r\\n\\t\\t\\t\\t\\t */\\r\\n\\t\\t\\t\\t\\tif (!featureDependencySet.add(auxFeature)){\\r\\n\\t\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t/*\\r\\n\\t\\t\\t\\t\\t * If the IMarker could not be created, remove the corresponding\\r\\n\\t\\t\\t\\t\\t * FeatureDependency from the set.\\r\\n\\t\\t\\t\\t\\t */\\r\\n\\t\\t\\t\\t\\tIMarker createdMarker = EmergoMarker.createMarker(auxFeature);\\r\\n\\t\\t\\t\\t\\tif (createdMarker == null) {\\r\\n\\t\\t\\t\\t\\t\\tfeatureDependencySet.remove(auxFeature);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t/*\\r\\n\\t\\t\\t\\t\\t * Store a mapping for each created marker to a corresponding graph\\r\\n\\t\\t\\t\\t\\t * that represent a \\\"dependency path\\\". \\r\\n\\t\\t\\t\\t\\t * \\r\\n\\t\\t\\t\\t\\t * TODO: There may exist more than on dependency path for 2 given\\r\\n\\t\\t\\t\\t\\t * nodes. How can this be represented/shown to the user?\\r\\n\\t\\t\\t\\t\\t */\\r\\n\\t\\t\\t\\t\\tif (dependencyGraphMapping.get(createdMarker) == null) {\\r\\n\\t\\t\\t\\t\\t\\tDirectedGraph<DependencyNode, ValueContainerEdge<ConfigSet>> pathAsGraph = new DirectedMultigraph<DependencyNode, ValueContainerEdge<ConfigSet>>((Class<? extends ValueContainerEdge<ConfigSet>>) ValueContainerEdge.class);\\r\\n\\t\\t\\t\\t\\t\\tfor (ValueContainerEdge<ConfigSet> edge : edgeList) {\\r\\n\\t\\t\\t\\t\\t\\t\\tDependencyNode edgeSource = dependencyGraph.getEdgeSource(edge);\\r\\n\\t\\t\\t\\t\\t\\t\\tDependencyNode edgeTarget = dependencyGraph.getEdgeTarget(edge);\\r\\n\\t\\t\\t\\t\\t\\t\\tpathAsGraph.addVertex(edgeSource);\\r\\n\\t\\t\\t\\t\\t\\t\\tpathAsGraph.addVertex(edgeTarget);\\r\\n\\t\\t\\t\\t\\t\\t\\tpathAsGraph.addEdge(edgeSource, edgeTarget).setValue(edge.getValue());\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\tdependencyGraphMapping.put(createdMarker, pathAsGraph);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tupdateTree();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d1663dc1194323d828e3e4051986ff\",\n \"score\": \"0.5696503\",\n \"text\": \"public void printGraph(){\\r\\n StdDraw.clear();\\r\\n Range xx = findRangeX();\\r\\n Range yy = findRangeY();\\r\\n double rightScaleX = ((xx.get_max()-xx.get_min())*0.04);\\r\\n double rightScaleY = ((yy.get_max()-yy.get_min())*0.04);\\r\\n StdDraw.setPenColor(Color.BLUE);\\r\\n StdDraw.setPenRadius(0.15);\\r\\n DGraph d = this.graph;\\r\\n if(d!=null) {\\r\\n Iterator it = d.getV().iterator();\\r\\n while (it.hasNext()) {\\r\\n node_data temp = (node_data)it.next();\\r\\n Point3D p = temp.getLocation();\\r\\n StdDraw.filledCircle(p.x(), p.y(),rightScaleX*0.2);\\r\\n StdDraw.text(p.x(), p.y() +rightScaleX*0.3, \\\"\\\" + temp.getKey());\\r\\n }\\r\\n StdDraw.setPenColor(Color.BLACK);\\r\\n StdDraw.setPenRadius(0.003);\\r\\n Iterator it1 = d.getV().iterator();\\r\\n while(it1.hasNext()){\\r\\n node_data temp1 = (node_data)it1.next();\\r\\n if(d.getE(temp1.getKey())!=null){\\r\\n Iterator it2 = d.getE(temp1.getKey()).iterator();\\r\\n while(it2.hasNext()){\\r\\n edge_data temp2 = (edge_data)it2.next();\\r\\n if(temp2!=null){\\r\\n StdDraw.setPenRadius(0.003);\\r\\n StdDraw.setPenColor(Color.RED);\\r\\n double weight = temp2.getWeight();\\r\\n node_data srcNode = d.getNode(temp2.getSrc());\\r\\n node_data dstNode = d.getNode(temp2.getDest());\\r\\n Point3D srcP = srcNode.getLocation();\\r\\n Point3D dstP = dstNode.getLocation();\\r\\n StdDraw.line(srcP.x(), srcP.y(), dstP.x(), dstP.y());\\r\\n\\r\\n double x = 0.2*srcP.x()+0.8*dstP.x();\\r\\n double y = 0.2*srcP.y() + 0.8*dstP.y();\\r\\n StdDraw.setPenColor(Color.BLACK);\\r\\n StdDraw.text(x,y, \\\"\\\" + weight);\\r\\n\\r\\n StdDraw.setPenColor(Color.YELLOW);\\r\\n StdDraw.setPenRadius(0.15);\\r\\n double x1 = 0.1*srcP.x()+0.9*dstP.x();\\r\\n double y1 = 0.1*srcP.y()+0.9*dstP.y();\\r\\n StdDraw.filledCircle(x1,y1,rightScaleX*0.2);\\r\\n\\r\\n }\\r\\n\\r\\n }\\r\\n }\\r\\n }\\r\\n\\r\\n }\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a574f9962a4ed7b55a834d59ef23e357\",\n \"score\": \"0.5694189\",\n \"text\": \"@Override\\n public boolean calculateDependencies(GoalGraph graph, Collection<ModelGoal> dependencies) {\\n ModelPath parent = getPath().getParent();\\n if (parent != null) {\\n // TODO - should be >= self closed\\n dependencies.add(graph.nodeAtState(new NodeAtState(parent, SelfClosed)));\\n }\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e2cb57c172551e2674c99427c4e1f66e\",\n \"score\": \"0.56772953\",\n \"text\": \"private void constructDependencyGraph() {\\n MainApplication app = MainApplication.getApplication();\\n ObjectGraph graph = app.getObjectGraph();\\n graph.inject(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"262927d946992e92de597ce20f6f5d73\",\n \"score\": \"0.5647745\",\n \"text\": \"@NonNull\\n List<GraphItem> getCompileDependencies();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2d1f50510c77dfd5aa9477264bb7ab1\",\n \"score\": \"0.56253284\",\n \"text\": \"public void printGraph() {\\n\\n if(vertexMap == null || vertexMap.size() <= 0) {\\n System.out.println(\\\"The network is currently empty, there are no vertices or edges.\\\");\\n }\\n else {\\n for(Vertex v : vertexMap.values()) {\\n String vertexName = v.name.substring(0, 1).toUpperCase() + v.name.substring(1);\\n System.out.print(vertexName);\\n\\n // Indicate that the vertex is down.\\n if(v.status == false) {\\n System.out.print(\\\" DOWN\\\");\\n }\\n\\n Collections.sort(v.adj, new EdgeComparator());\\n\\n for(Edge e : v.adj) {\\n String edgeName = e.dest.name.substring(0, 1).toUpperCase() + e.dest.name.substring(1);\\n System.out.print(\\\"\\\\n \\\" + edgeName + \\\" \\\" + e.dist);\\n if(!e.status) { System.out.print(\\\" DOWN\\\"); }\\n }\\n System.out.print(\\\"\\\\n\\\");\\n }\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c10f88f51d106725a0d7b3319855da5\",\n \"score\": \"0.5616498\",\n \"text\": \"public void determineOrder ()\\n {\\n for (EquationSet p : parts) p.determineOrder ();\\n\\n // Reset variables for analysis\\n ordered = new ArrayList<Variable> ();\\n for (Variable v : variables)\\n {\\n v.before = new ArrayList<Variable> ();\\n v.priority = 0;\\n }\\n\\n // Determine order constraints for each variable separately\\n for (Variable v : variables) v.setBefore (false);\\n\\n // Assign depth in dependency tree, processing variables with the most ordering constraints first\\n PriorityQueue<Variable> queueDependency = new PriorityQueue<Variable> (variables.size (), new Comparator<Variable> ()\\n {\\n public int compare (Variable a, Variable b)\\n {\\n return b.before.size () - a.before.size ();\\n }\\n });\\n queueDependency.addAll (variables);\\n for (Variable v = queueDependency.poll (); v != null; v = queueDependency.poll ())\\n {\\n v.setPriority (1, null);\\n }\\n\\n // Assemble dependency tree into flat list\\n PriorityQueue<Variable> queuePriority = new PriorityQueue<Variable> (variables.size (), new Comparator<Variable> ()\\n {\\n public int compare (Variable a, Variable b)\\n {\\n return a.priority - b.priority;\\n }\\n });\\n queuePriority.addAll (variables);\\n for (Variable v = queuePriority.poll (); v != null; v = queuePriority.poll ())\\n {\\n ordered.add (v);\\n }\\n\\n // Tag any circular dependencies\\n int count = ordered.size ();\\n for (int index = 0; index < count; index++)\\n {\\n Variable v = ordered.get (index);\\n if (v.uses == null) continue;\\n for (Variable u : v.uses.keySet ())\\n {\\n if ( u.container == this // must be in same equation set for order to matter\\n && ! (u.name.equals (v.name) && u.order == v.order + 1) // must not be my derivative\\n && ! u.hasAttribute (\\\"temporary\\\") // temporaries follow the opposite rule on ordering, so don't consider them here\\n && ordered.indexOf (u) < index) // and finally, is it actually ahead of me in the ordering?\\n {\\n Backend.err.get ().println (\\\"Cyclic dependency: \\\" + v.name + \\\" comes after \\\" + u.name);\\n u.addAttribute (\\\"cycle\\\"); // must be buffered; otherwise we will get the \\\"after\\\" value rather than \\\"before\\\"\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b71c5f23431bc2d83d819d31e8b9c3b5\",\n \"score\": \"0.5603539\",\n \"text\": \"public void display()\\n {\\n adjacencyList();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cde971178cdd7862e1463014d20372f4\",\n \"score\": \"0.55866975\",\n \"text\": \"public void printGraph() {\\n for (IR.Reg node : undirectedGraph.keySet()) {\\n System.out.print(\\\"\\\\nNode: \\\" + node.toString() + \\\"\\\\n\\\");\\n System.out.print(\\\"[\\\");\\n IR.Reg[] temp = undirectedGraph.get(node).toArray(new IR.Reg[undirectedGraph.get(node).size()]);\\n int counter = 1;\\n for (IR.Reg o : temp) {\\n if (counter < temp.length) {\\n System.out.print(o.toString() + \\\", \\\");\\n counter++;\\n } else {\\n System.out.print(o.toString());\\n }\\n }\\n System.out.println(\\\"]\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc7f88f0a0946ab0032138ed0eff5919\",\n \"score\": \"0.55850077\",\n \"text\": \"public static void main(String[] args) {\\r\\n System.out.println(DEPENDENT.toPrettyString());\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b84f8c3c4b1bd1841e87b2e997844fd4\",\n \"score\": \"0.55669796\",\n \"text\": \"public String getUrlName() {\\n\\t\\treturn \\\"DependencyGraph\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b318aab6ae79d05f92a2ab47ebb35fd\",\n \"score\": \"0.5566077\",\n \"text\": \"public void printGraph() {\\n\\n for (int v = 0; v < this.V; v++) {\\n System.out.println(\\\"Adjacency list of vertex \\\" + v);\\n System.out.print(\\\"head\\\");\\n for (adjListNode pCrawl : this.adjListArray[v]) {\\n System.out.print(\\\"---> \\\" + pCrawl.getV() + \\\" , weight: \\\" + pCrawl.getWeight());\\n }\\n System.out.println(\\\"\\\\n\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0b0cccdd2c3f3dd79195dc9ec320edc\",\n \"score\": \"0.55632764\",\n \"text\": \"@Override\\n\\tpublic String toString() {\\n\\treturn this.getName_dep();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09035c76b72fd7271f2c80eccfa41bf4\",\n \"score\": \"0.556043\",\n \"text\": \"public boolean calculateDependencies(GoalGraph graph, Collection<ModelGoal> dependencies) {\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"15c31df2f928a422cba806eff9de3cb0\",\n \"score\": \"0.55582106\",\n \"text\": \"void printInterdependency(ArrayList<Node> networkA, ArrayList<Node> networkB){\\n\\t\\t\\n\\t\\ttry{\\n\\t\\t\\tPrintStream ps = new PrintStream(\\\"test-dependency.txt\\\");\\n\\t\\t\\t\\n\\t\\t\\tps.println(\\\"Network A: \\\");\\n\\t\\t\\tfor (int i = 0; i < networkA.size(); i++){\\n\\t\\t\\t\\tps.print(\\\"[\\\" + networkA.get(i).getIndex() + \\\"]\\\" + \\\": \\\");\\n\\t\\t\\t\\tps.println(networkA.get(i).getDependency());\\n\\t\\t\\t}\\n\\t\\t\\tps.println();\\n\\t\\t\\t\\n\\t\\t\\tps.println(\\\"Network B: \\\");\\n\\t\\t\\tfor (int i = 0; i < networkA.size(); i++){\\n\\t\\t\\t\\tps.print(\\\"[\\\" + networkB.get(i).getIndex() + \\\"]\\\" + \\\": \\\");\\n\\t\\t\\t\\tps.println(networkB.get(i).getDependency());\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tps.close();\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\tcatch (FileNotFoundException e){\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51efb8ac197d35312ca578b36ba46c1f\",\n \"score\": \"0.554977\",\n \"text\": \"private void adjacencyList()\\n {\\n Iterator<DSAGraphNode<E> > iter = nodes.iterator();\\n\\n System.out.println(\\\"\\\\n\\\");\\n while(iter.hasNext())\\n {\\n DSAGraphNode<E> node = iter.next();\\n System.out.print(node.getLabel() +\\\": \\\");\\n node.display();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d42d2a47be1b2ac305e7ac97d2ee440c\",\n \"score\": \"0.5548519\",\n \"text\": \"public static void main(String[] args) throws NullPointerException {\\n ListenableGraph<String, SetInfo> graph =\\r\\n new ListenableDirectedGraph<String, SetInfo>(\\r\\n SetInfo.class);\\r\\n \\r\\n Scanner input = new Scanner(System.in);\\r\\n\\r\\n // create a visualization using JGraph, via an adapter\\r\\n //jgxAdapter = new JGraphXAdapter<String, SetInfo>(graph);\\r\\n\\r\\n String Edinburgh = \\\"Edinburgh\\\";\\r\\n String Heathrow = \\\"Heathrow\\\";\\r\\n String Amsterdam = \\\"Amsterdam\\\";\\r\\n String Boston = \\\"Boston\\\";\\r\\n String Chicago = \\\"Chicago\\\";\\r\\n String Montreal = \\\"Montreal\\\";\\r\\n String Toronto = \\\"Toronto\\\";\\r\\n String New_Delhi = \\\"New_Delhi\\\";\\r\\n String Shanghai = \\\"Shanghai\\\";\\r\\n String Hong_Kong = \\\"Hong_Kong\\\";\\r\\n \\r\\n graph.addVertex(Edinburgh);\\r\\n graph.addVertex(Heathrow);\\r\\n graph.addVertex(Amsterdam);\\r\\n graph.addVertex(Boston);\\r\\n graph.addVertex(Chicago);\\r\\n graph.addVertex(Montreal);\\r\\n graph.addVertex(Toronto);\\r\\n graph.addVertex(New_Delhi);\\r\\n graph.addVertex(Shanghai);\\r\\n graph.addVertex(Hong_Kong);\\r\\n \\r\\n SetInfo e1 = new SetInfo(\\\"BK780\\\", 1030, 1130, 0130, 110);graph.addEdge(\\\"Edinburgh\\\", \\\"Heathrow\\\", e1);\\r\\n SetInfo e2 = new SetInfo(\\\"AL901\\\", 1030, 1530, 0230, 230);graph.addEdge(\\\"Heathrow\\\", \\\"Boston\\\", e2);\\r\\n SetInfo e3 = new SetInfo(\\\"NM198\\\", 1800, 1930, 0130, 100);graph.addEdge(\\\"Boston\\\", \\\"Montreal\\\", e3);\\r\\n SetInfo e4 = new SetInfo(\\\"BT986\\\", 2200, 2330, 0130, 90);graph.addEdge(\\\"Montreal\\\", \\\"Toronto\\\", e4);\\r\\n SetInfo e5 = new SetInfo(\\\"JI116\\\", 0700, 1000, 0300, 100);graph.addEdge(\\\"Heathrow\\\", \\\"Amsterdam\\\", e5);\\r\\n SetInfo e6 = new SetInfo(\\\"TY7309\\\", 1000, 1400, 0400, 150);graph.addEdge(\\\"Boston\\\", \\\"Chicago\\\", e6);\\r\\n SetInfo e7 = new SetInfo(\\\"VO664\\\", 1900, 2130, 0230, 560);graph.addEdge(\\\"Edinburgh\\\", \\\"Chicago\\\", e7);\\r\\n SetInfo e8 = new SetInfo(\\\"EQ387\\\", 1100, 1430, 0330, 430);graph.addEdge(\\\"New_Delhi\\\", \\\"Shanghai\\\", e8);\\r\\n SetInfo e9 = new SetInfo(\\\"UI690\\\", 2000, 2337, 0337, 230);graph.addEdge(\\\"Shanghai\\\", \\\"Hong_Kong\\\", e9);\\r\\n \\r\\n System.out.println(\\\"Please enter the first airport\\\");\\r\\n String vertex1 = input.next();\\r\\n System.out.println(\\\"Please enter the second airport\\\");\\r\\n String vertex2 = input.next();\\r\\n System.out.println();\\r\\n System.out.println(\\\"Leg Leave At On Arrive At\\\");\\r\\n\\t \\r\\n int i = 1;\\r\\n int totalCost = 0;\\r\\n int totalHour = 0;\\r\\n int totalMinute = 0;\\r\\n if(vertex1 != null && vertex2 != null){\\r\\n List<SetInfo> shortest_path = DijkstraShortestPath.findPathBetween(graph, vertex1, vertex2);\\r\\n for(SetInfo s : shortest_path){\\r\\n if(s == e1){\\r\\n \\t System.out.print(i + \\\". \\\");\\r\\n \\t System.out.printf(\\\"%-10.10s %-10.10s %-10.10s %-10.10s %-10.10s\\\", \\r\\n \\t\\t\\t Edinburgh, e1.getDeparture(), e1.getFlight(), Heathrow, e1.getArrival());\\r\\n \\t totalCost = totalCost + e1.getTicket();\\r\\n \\t int e1Hour = e1.setHour(e1.getFlightDuration());\\r\\n \\t int e1Minute = e1.setMinute(e1.getFlightDuration());\\r\\n \\t totalHour = totalHour + e1Hour;\\r\\n \\t totalMinute = totalMinute + e1Minute;\\r\\n }\\r\\n if(s == e2){\\r\\n \\t System.out.print(i + \\\". \\\");\\r\\n \\t System.out.printf(\\\"%-10.10s %-10.10s %-10.10s %-10.10s %-10.10s\\\", \\r\\n \\t\\t\\t Heathrow, e2.getDeparture(), e2.getFlight(), Boston, e2.getArrival());\\r\\n \\t totalCost = totalCost + e2.getTicket();\\r\\n \\t int e2Hour = e2.setHour(e2.getFlightDuration());\\r\\n \\t int e2Minute = e2.setMinute(e2.getFlightDuration());\\r\\n \\t totalHour = totalHour + e2Hour;\\r\\n \\t totalMinute = totalMinute + e2Minute;\\r\\n }\\r\\n if(s == e3){\\r\\n \\t System.out.print(i + \\\". \\\");\\r\\n \\t System.out.printf(\\\"%-10.10s %-10.10s %-10.10s %-10.10s %-10.10s\\\", \\r\\n \\t\\t\\t Boston, e3.getDeparture(), e3.getFlight(), Montreal, e3.getArrival());\\r\\n \\t totalCost = totalCost + e3.getTicket();\\r\\n \\t int e3Hour = e3.setHour(e3.getFlightDuration());\\r\\n \\t int e3Minute = e3.setMinute(e3.getFlightDuration());\\r\\n \\t totalHour = totalHour + e3Hour;\\r\\n \\t totalMinute = totalMinute + e3Minute;\\r\\n }\\r\\n if(s == e4){\\r\\n \\t System.out.print(i + \\\". \\\");\\r\\n \\t System.out.printf(\\\"%-10.10s %-10.10s %-10.10s %-10.10s %-10.10s\\\", \\r\\n \\t\\t\\t Montreal, e4.getDeparture(), e4.getFlight(), Toronto, e4.getArrival());\\r\\n \\t totalCost = totalCost + e4.getTicket();\\r\\n \\t int e4Hour = e4.setHour(e4.getFlightDuration());\\r\\n \\t int e4Minute = e4.setMinute(e4.getFlightDuration());\\r\\n \\t totalHour = totalHour + e4Hour;\\r\\n \\t totalMinute = totalMinute + e4Minute;\\r\\n }\\r\\n if(s == e5){\\r\\n \\t System.out.print(i + \\\". \\\");\\r\\n \\t System.out.printf(\\\"%-10.10s %-10.10s %-10.10s %-10.10s %-10.10s\\\", \\r\\n \\t\\t\\t Heathrow, e5.getDeparture(), e5.getFlight(), Amsterdam, e5.getArrival());\\r\\n \\t totalCost = totalCost + e5.getTicket();\\r\\n \\t int e5Hour = e5.setHour(e5.getFlightDuration());\\r\\n \\t int e5Minute = e5.setMinute(e5.getFlightDuration());\\r\\n \\t totalHour = totalHour + e5Hour;\\r\\n \\t totalMinute = totalMinute + e5Minute;\\r\\n }\\r\\n if(s == e6){\\r\\n \\t System.out.print(i + \\\". \\\");\\r\\n \\t System.out.printf(\\\"%-10.10s %-10.10s %-10.10s %-10.10s %-10.10s\\\", \\r\\n \\t\\t\\t Boston, e6.getDeparture(), e6.getFlight(), Chicago, e6.getArrival());\\r\\n \\t totalCost = totalCost + e6.getTicket();\\r\\n \\t int e6Hour = e6.setHour(e6.getFlightDuration());\\r\\n \\t int e6Minute = e6.setMinute(e6.getFlightDuration());\\r\\n \\t totalHour = totalHour + e6Hour;\\r\\n \\t totalMinute = totalMinute + e6Minute;\\r\\n }\\r\\n if(s == e7){\\r\\n \\t System.out.print(i + \\\". \\\");\\r\\n \\t System.out.printf(\\\"%-10.10s %-10.10s %-10.10s %-10.10s %-10.10s\\\", \\r\\n \\t\\t\\t Edinburgh, e7.getDeparture(), e7.getFlight(), Chicago, e7.getArrival());\\r\\n \\t totalCost = totalCost + e7.getTicket();\\r\\n \\t int e7Hour = e7.setHour(e7.getFlightDuration());\\r\\n \\t int e7Minute = e7.setMinute(e7.getFlightDuration());\\r\\n \\t totalHour = totalHour + e7Hour;\\r\\n \\t totalMinute = totalMinute + e7Minute;\\r\\n }\\r\\n if(s == e8){\\r\\n \\t System.out.print(i + \\\". \\\");\\r\\n \\t System.out.printf(\\\"%-10.10s %-10.10s %-10.10s %-10.10s %-10.10s\\\", \\r\\n \\t\\t\\t New_Delhi, e8.getDeparture(), e8.getFlight(), Shanghai, e8.getArrival());\\r\\n \\t totalCost = totalCost + e8.getTicket();\\r\\n \\t int e8Hour = e8.setHour(e8.getFlightDuration());\\r\\n \\t int e8Minute = e8.setMinute(e8.getFlightDuration());\\r\\n \\t totalHour = totalHour + e8Hour;\\r\\n \\t totalMinute = totalMinute + e8Minute;\\r\\n }\\r\\n if(s == e9){\\r\\n \\t System.out.print(i + \\\". \\\");\\r\\n \\t System.out.printf(\\\"%-10.10s %-10.10s %-10.10s %-10.10s %-10.10s\\\", \\r\\n \\t\\t\\t Shanghai, e9.getDeparture(), e9.getFlight(), Hong_Kong, e9.getArrival());\\r\\n \\t totalCost = totalCost + e9.getTicket();\\r\\n \\t int e9Hour = e9.setHour(e9.getFlightDuration());\\r\\n \\t int e9Minute = e9.setMinute(e9.getFlightDuration());\\r\\n \\t totalHour = totalHour + e9Hour;\\r\\n \\t totalMinute = totalMinute + e9Minute;\\r\\n }\\r\\n i++;\\r\\n System.out.println();\\r\\n }\\r\\n System.out.printf(\\\"Total cost of the journy = £\\\"\\r\\n \\t\\t+ \\\"%s\\\", totalCost);\\r\\n }\\r\\n if(totalMinute<60)\\r\\n \\tSystem.out.printf(\\\"\\\\nTotal time in the air = %s%shrs\\\", totalHour, totalMinute);\\r\\n else if(totalMinute>=60){\\r\\n \\ttotalHour = totalHour + 1;\\r\\n \\ttotalMinute = 60-(120-totalMinute);\\r\\n \\tif(totalMinute > 9)\\r\\n \\tSystem.out.printf(\\\"\\\\nTotal time in the air = %s%shrs\\\", totalHour, totalMinute);\\r\\n \\tif(totalMinute < 10){\\r\\n System.out.printf(\\\"\\\\nTotal time in the air = %s0%shrs\\\", totalHour, totalMinute);\\t\\r\\n }\\r\\n \\t\\r\\n }\\r\\n \\r\\n \\r\\n \\r\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c8aed0887fa8109cf71ca30b5b045b6\",\n \"score\": \"0.5529679\",\n \"text\": \"public static void main(String[] args){\\n Graph g = new Graph(8); \\n // g.addEdge(1,2,0.9); \\n // g.addEdge(2,3,1.5); \\n // g.addEdge(3,4,1.5); \\n // g.addEdge(4,1,0.5); \\n // g.addEdge(2,1,(49/45)); \\n // g.addEdge(1,5,0.7); \\n // g.addEdge(5,1,(4/3)); \\n\\n g.addEdge(0,1,0); \\n g.addEdge(1,2,0); \\n g.addEdge(1,4,0); \\n g.addEdge(1,5,0); \\n g.addEdge(2,3,0); \\n g.addEdge(2,6,0); \\n g.addEdge(3,2,0); \\n g.addEdge(3,7,0); \\n g.addEdge(4,0,0); \\n g.addEdge(4,5,0); \\n g.addEdge(5,6,0); \\n g.addEdge(6,5,0); \\n g.addEdge(6,7,0); \\n g.addEdge(7,7,0); \\n\\n\\n // g.addEdge(0,4,0); \\n // g.addEdge(1,0,0); \\n // g.addEdge(2,1,0); \\n // g.addEdge(2,3,0); \\n // g.addEdge(3,2,0); \\n // g.addEdge(4,1,0); \\n // g.addEdge(5,4,0); \\n // g.addEdge(5,1,0); \\n // g.addEdge(5,6,0); \\n // g.addEdge(6,2,0); \\n // g.addEdge(6,5,0); \\n // g.addEdge(7,3,0); \\n // g.addEdge(7,6,0); \\n // g.addEdge(7,7,0); \\n\\n\\n\\n\\n // ArrayList<Graph> SCCGs = g.getSCCs();\\n\\n // for( ArrayList<Integer> C: SCCs)\\n // {\\n // System.out.println(C);\\n // }\\n \\n\\n\\n for(ArrayList<Integer> list: g.adj)\\n {\\n System.out.println(list);\\n }\\n \\n // g.DFS(false, null);\\n // // for(Vertix v: g.V)\\n // // {\\n // // System.out.println(v.id+\\\" \\\"+v.f);\\n // // }\\n // for(int i=0; i<8; i++)\\n // {\\n // Vertix v = g.V.get(i);\\n // ArrayList<Integer> list = g.adj[i];\\n // System.out.print(v.id+\\\" \\\");\\n // System.out.print(list);\\n // System.out.println(\\\" \\\"+ v.d +\\\" \\\"+v.f+\\\" \\\"+v.color);\\n // }\\n // System.out.println();\\n // Graph tg = g.getTranspose();\\n // tg.DFS(true, g.V);\\n // // for(ArrayList<Integer> list: tg.adj)\\n // // {\\n // // System.out.println(list);\\n // // }\\n // for(int i=0; i<8; i++)\\n // {\\n // Vertix v = tg.V.get(i);\\n // ArrayList<Integer> list = tg.adj[i];\\n // System.out.print(v.id+\\\" \\\");\\n // System.out.print(list);\\n // System.out.println(\\\" \\\"+ v.d +\\\" \\\"+v.f+\\\" \\\"+v.color);\\n // }\\n\\n\\n // \\n\\n // // tg.DFS();\\n // for(Vertix v: tg.V)\\n // {\\n // System.out.println(v.id+\\\" \\\"+v.f);\\n // }\\n \\n\\n // for(ArrayList<Integer> list: tg.adj)\\n // {\\n // System.out.println(list);\\n // }\\n \\n // g.SCC();\\n\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"88b6b7f1abfc1403a08296d8aed6fde1\",\n \"score\": \"0.5528322\",\n \"text\": \"public void printGraph() {\\n\\n\\t\\tfor (T vertex : verticesMap.keySet()) {\\n\\t\\t\\tif (verticesMap.get(vertex).size() != 0) {\\n\\t\\t\\t\\tfor (T edges : verticesMap.get(vertex)) {\\n\\t\\t\\t\\t\\tSystem.out.println(vertex + \\\" -> \\\" + edges + \\\" \\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tSystem.out.println(vertex + \\\" -> \\\" + \\\" \\\");\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"140bab947b16e59bf33a62235af96263\",\n \"score\": \"0.5526422\",\n \"text\": \"private Map<ResolvedModule, Set<ResolvedModule>> makeGraph(Configuration cf) {\\n\\n int moduleCount = nameToReference.size();\\n\\n // the \\\"reads\\\" graph starts as a module dependence graph and\\n // is iteratively updated to be the readability graph\\n Map<ResolvedModule, Set<ResolvedModule>> g1 = HashMap.newHashMap(moduleCount);\\n\\n // the \\\"requires transitive\\\" graph, contains requires transitive edges only\\n Map<ResolvedModule, Set<ResolvedModule>> g2;\\n\\n // need \\\"requires transitive\\\" from the modules in parent configurations\\n // as there may be selected modules that have a dependency on modules in\\n // the parent configuration.\\n if (ModuleLayer.boot() == null) {\\n g2 = HashMap.newHashMap(moduleCount);\\n } else {\\n g2 = parents.stream()\\n .flatMap(Configuration::configurations)\\n .distinct()\\n .flatMap(c ->\\n c.modules().stream().flatMap(m1 ->\\n m1.descriptor().requires().stream()\\n .filter(r -> r.modifiers().contains(Modifier.TRANSITIVE))\\n .flatMap(r -> {\\n Optional<ResolvedModule> m2 = c.findModule(r.name());\\n assert m2.isPresent()\\n || r.modifiers().contains(Modifier.STATIC);\\n return m2.stream();\\n })\\n .map(m2 -> Map.entry(m1, m2))\\n )\\n )\\n // stream of m1->m2\\n .collect(Collectors.groupingBy(Map.Entry::getKey,\\n HashMap::new,\\n Collectors.mapping(Map.Entry::getValue, Collectors.toSet())\\n ));\\n }\\n\\n // populate g1 and g2 with the dependences from the selected modules\\n\\n Map<String, ResolvedModule> nameToResolved = HashMap.newHashMap(moduleCount);\\n\\n for (ModuleReference mref : nameToReference.values()) {\\n ModuleDescriptor descriptor = mref.descriptor();\\n String name = descriptor.name();\\n\\n ResolvedModule m1 = computeIfAbsent(nameToResolved, name, cf, mref);\\n\\n Set<ResolvedModule> reads = new HashSet<>();\\n Set<ResolvedModule> requiresTransitive = new HashSet<>();\\n\\n for (ModuleDescriptor.Requires requires : descriptor.requires()) {\\n String dn = requires.name();\\n\\n ResolvedModule m2;\\n ModuleReference mref2 = nameToReference.get(dn);\\n if (mref2 != null) {\\n // same configuration\\n m2 = computeIfAbsent(nameToResolved, dn, cf, mref2);\\n } else {\\n // parent configuration\\n m2 = findInParent(dn);\\n if (m2 == null) {\\n assert requires.modifiers().contains(Modifier.STATIC);\\n continue;\\n }\\n\\n // m2 is automatic module in parent configuration => m1 reads\\n // all automatic modules that m2 reads.\\n if (m2.descriptor().isAutomatic()) {\\n m2.reads().stream()\\n .filter(d -> d.descriptor().isAutomatic())\\n .forEach(reads::add);\\n }\\n }\\n\\n // m1 requires m2 => m1 reads m2\\n reads.add(m2);\\n\\n // m1 requires transitive m2\\n if (requires.modifiers().contains(Modifier.TRANSITIVE)) {\\n requiresTransitive.add(m2);\\n }\\n\\n }\\n\\n // automatic modules read all selected modules and all modules\\n // in parent configurations\\n if (descriptor.isAutomatic()) {\\n\\n // reads all selected modules\\n // `requires transitive` all selected automatic modules\\n for (ModuleReference mref2 : nameToReference.values()) {\\n ModuleDescriptor descriptor2 = mref2.descriptor();\\n String name2 = descriptor2.name();\\n\\n if (!name.equals(name2)) {\\n ResolvedModule m2\\n = computeIfAbsent(nameToResolved, name2, cf, mref2);\\n reads.add(m2);\\n if (descriptor2.isAutomatic())\\n requiresTransitive.add(m2);\\n }\\n }\\n\\n // reads all modules in parent configurations\\n // `requires transitive` all automatic modules in parent\\n // configurations\\n for (Configuration parent : parents) {\\n parent.configurations()\\n .map(Configuration::modules)\\n .flatMap(Set::stream)\\n .forEach(m -> {\\n reads.add(m);\\n if (m.reference().descriptor().isAutomatic())\\n requiresTransitive.add(m);\\n });\\n }\\n }\\n\\n g1.put(m1, reads);\\n g2.put(m1, requiresTransitive);\\n }\\n\\n // Iteratively update g1 until there are no more requires transitive\\n // to propagate\\n boolean changed;\\n List<ResolvedModule> toAdd = new ArrayList<>();\\n do {\\n changed = false;\\n for (Set<ResolvedModule> m1Reads : g1.values()) {\\n for (ResolvedModule m2 : m1Reads) {\\n Set<ResolvedModule> m2RequiresTransitive = g2.get(m2);\\n if (m2RequiresTransitive != null) {\\n for (ResolvedModule m3 : m2RequiresTransitive) {\\n if (!m1Reads.contains(m3)) {\\n // m1 reads m2, m2 requires transitive m3\\n // => need to add m1 reads m3\\n toAdd.add(m3);\\n }\\n }\\n }\\n }\\n if (!toAdd.isEmpty()) {\\n m1Reads.addAll(toAdd);\\n toAdd.clear();\\n changed = true;\\n }\\n }\\n } while (changed);\\n\\n return g1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9aee1f80bb93efd079b75443dec2570a\",\n \"score\": \"0.5525068\",\n \"text\": \"public void print_graph() {\\r\\n print_graph(graph, vertexes);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65e237a28d2ec33c6eca19b7c8f37df2\",\n \"score\": \"0.552158\",\n \"text\": \"public static DependencyGraph getCompleteDependencies(Artifact artifact)\\n throws DependencyCollectionException, DependencyResolutionException {\\n \\n // root node\\n DependencyNode node = resolveCompileTimeDependencies(artifact); \\n DependencyGraph graph = new DependencyGraph();\\n fullPreorder(new Stack<>(), node, graph);\\n \\n return graph;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2a6b5abfcd210ab8b0acf919b2bb63b\",\n \"score\": \"0.55143243\",\n \"text\": \"String inheritanceDependancies(PogoDeviceClass cls) {\\n\\t\\tString code = \\n\\t\\t\\t\\\"#=============================================================================\\\\n\\\" +\\n\\t\\t\\t\\\"# Following are dependancies of the inherited classes used by project\\\\n\\\" +\\n\\t\\t\\t\\\"#\\\\n\\\";\\n\\t\\tfor (Inheritance inher : cls.getDescription().getInheritances()) {\\n\\t\\t\\tif (inheritanceUtils.isInheritanceClass(inher)) {\\n\\t\\t\\t\\tcode += \\\"\\\\n\\\" +\\n\\t\\t\\t\\t\\t\\t\\\"#------------ Object files dependancies for \\\" +inher.getClassname()+\\\" class ------------\\\\n\\\";\\n\\t\\t\\t\\tcode += classIncludeDir(inher.getClassname()) + \\\" = \\\\\\\\\\\\n\\\";\\n\\t\\t\\t\\tcode += \\\"\\t\\t$(\\\" + classHomeDir(inher.getClassname()) + \\\")/\\\" + inher.getClassname() + \\\".h \\\\\\\\\\\\n\\\"; \\n\\t\\t\\t\\tcode += \\\"\\t\\t$(\\\" + classHomeDir(inher.getClassname()) + \\\")/\\\" + inher.getClassname() + \\\"Class.h\\\\n\\\";\\n\\t\\t\\t\\tcode += dependanciesObject(inher.getClassname(), \\\"\\\");\\n\\t\\t\\t\\tcode += dependanciesObject(inher.getClassname(), \\\"Class\\\");\\n\\t\\t\\t\\tcode += dependanciesObject(inher.getClassname(), \\\"StateMachine\\\");\\n\\n\\t\\t\\t\\t/*\\tToDo additional for inheritance ?\\n\\t\\t\\t\\tfor (AdditionalFile file : cls.getAdditionalFiles()) {\\n\\t\\t\\t\\t\\tcode += dependanciesObjectAddFile(cls.getName(), file.getName());\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t*/\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tcode += \\\"\\\\nSVC_INHERITANCE_INCL = \\\";\\n\\t\\tfor (Inheritance inheritance : cls.getDescription().getInheritances()) {\\n\\t\\t\\tif (inheritanceUtils.isInheritanceClass(inheritance)) {\\n\\t\\t\\t\\tcode+= \\\" $(\\\" + classIncludeDir(inheritance.getClassname()) + \\\")\\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcode += \\\"\\\\n\\\";\\n\\n\\t\\treturn code;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"855e36e07c2f8b70e8fb74114f8c112d\",\n \"score\": \"0.5503551\",\n \"text\": \"public void buildOrder(List<Node[]> dependencies) {\\n Map<Node, Set<Node>> dependencyMap = new HashMap<>();\\n for(Node[] dep: dependencies){\\n if(dependencyMap.containsKey(dep[0])){\\n dependencyMap.get(dep[0]).add(dep[1]);\\n } else {\\n Set<Node> set = new HashSet<>();\\n set.add(dep[1]);\\n dependencyMap.put(dep[0], set);\\n }\\n }\\n\\n Set<Node> visited = new HashSet<>();\\n Set<Node> visiting = new HashSet<>();\\n Deque<Node> stack = new ArrayDeque<>();\\n\\n for(Node n: nodes){\\n if(!visited.contains(n)&& !visiting.contains(n)){\\n stack.addLast(n);\\n visited.add(n);\\n for(Node preReq: dependencyMap.get(n)){\\n if(!visited.contains(n)&& !visiting.contains(n)){\\n stack.addLast(preReq);\\n visiting.add(preReq);\\n }\\n }\\n }\\n\\n while(!visiting.isEmpty()){\\n// Node n = stack.getLast();\\n// if()\\n }\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0a8298b6b23f5ac8202c7c2af8d95e6\",\n \"score\": \"0.55004334\",\n \"text\": \"public static DirectedGraph get_dg1() {DirectedGraph dg = new DirectedGraph();for (int i = 1; i <= 22; i++)\\tdg.addVertice(i);dg.addDirectedEdges(1, 2);dg.addDirectedEdges(3, 2);dg.addDirectedEdges(12, 2);dg.addDirectedEdges(13, 2);dg.addDirectedEdges(14, 2);dg.addDirectedEdges(15, 2);dg.addDirectedEdges(16, 2);dg.addDirectedEdges(1, 3);dg.addDirectedEdges(2, 3);dg.addDirectedEdges(4, 3);dg.addDirectedEdges(12, 3);dg.addDirectedEdges(13, 3);dg.addDirectedEdges(14, 3);dg.addDirectedEdges(15, 3);dg.addDirectedEdges(16, 3);dg.addDirectedEdges(1, 4);dg.addDirectedEdges(3, 4);dg.addDirectedEdges(5, 4);dg.addDirectedEdges(6, 4);dg.addDirectedEdges(12, 4);dg.addDirectedEdges(13, 4);dg.addDirectedEdges(14, 4);dg.addDirectedEdges(15, 4);dg.addDirectedEdges(16, 4);dg.addDirectedEdges(17, 4);dg.addDirectedEdges(18, 4);dg.addDirectedEdges(19, 4);dg.addDirectedEdges(1, 5);dg.addDirectedEdges(4, 5);dg.addDirectedEdges(6, 5);dg.addDirectedEdges(12, 5);dg.addDirectedEdges(13, 5);dg.addDirectedEdges(14, 5);dg.addDirectedEdges(15, 5);dg.addDirectedEdges(16, 5);dg.addDirectedEdges(17, 5);dg.addDirectedEdges(18, 5);dg.addDirectedEdges(19, 5);dg.addDirectedEdges(1, 6);dg.addDirectedEdges(4, 6);dg.addDirectedEdges(5, 6);dg.addDirectedEdges(7, 6);dg.addDirectedEdges(13, 6);dg.addDirectedEdges(14, 6);dg.addDirectedEdges(15, 6);dg.addDirectedEdges(16, 6);dg.addDirectedEdges(17, 6);dg.addDirectedEdges(18, 6);dg.addDirectedEdges(19, 6);dg.addDirectedEdges(1, 7);dg.addDirectedEdges(6, 7);dg.addDirectedEdges(8, 7);dg.addDirectedEdges(13, 7);dg.addDirectedEdges(14, 7);dg.addDirectedEdges(15, 7);dg.addDirectedEdges(16, 7);dg.addDirectedEdges(17, 7);dg.addDirectedEdges(18, 7);dg.addDirectedEdges(19, 7);dg.addDirectedEdges(20, 7);dg.addDirectedEdges(21, 7);dg.addDirectedEdges(1, 8);dg.addDirectedEdges(7, 8);dg.addDirectedEdges(9, 8);dg.addDirectedEdges(14, 8);dg.addDirectedEdges(15, 8);dg.addDirectedEdges(16, 8);dg.addDirectedEdges(17, 8);dg.addDirectedEdges(18, 8);dg.addDirectedEdges(19, 8);dg.addDirectedEdges(20, 8);dg.addDirectedEdges(21, 8);dg.addDirectedEdges(1, 9);dg.addDirectedEdges(8, 9);dg.addDirectedEdges(10, 9);dg.addDirectedEdges(14, 9);dg.addDirectedEdges(15, 9);dg.addDirectedEdges(16, 9);dg.addDirectedEdges(17, 9);dg.addDirectedEdges(18, 9);dg.addDirectedEdges(19, 9);dg.addDirectedEdges(20, 9);dg.addDirectedEdges(21, 9);dg.addDirectedEdges(22, 9);dg.addDirectedEdges(1, 10);dg.addDirectedEdges(9, 10);dg.addDirectedEdges(15, 10);dg.addDirectedEdges(16, 10);dg.addDirectedEdges(18, 10);dg.addDirectedEdges(19, 10);dg.addDirectedEdges(20, 10);dg.addDirectedEdges(21, 10);dg.addDirectedEdges(22, 10);dg.addDirectedEdges(1, 11);dg.addDirectedEdges(16, 11);dg.addDirectedEdges(19, 11);dg.addDirectedEdges(21, 11);dg.addDirectedEdges(22, 11);dg.addDirectedEdges(1, 12);dg.addDirectedEdges(2, 12);dg.addDirectedEdges(3, 12);dg.addDirectedEdges(4, 12);dg.addDirectedEdges(5, 12);dg.addDirectedEdges(13, 12);dg.addDirectedEdges(14, 12);dg.addDirectedEdges(15, 12);dg.addDirectedEdges(16, 12);dg.addDirectedEdges(1, 13);dg.addDirectedEdges(2, 13);dg.addDirectedEdges(3, 13);dg.addDirectedEdges(4, 13);dg.addDirectedEdges(5, 13);dg.addDirectedEdges(6, 13);dg.addDirectedEdges(7, 13);dg.addDirectedEdges(12, 13);dg.addDirectedEdges(14, 13);dg.addDirectedEdges(15, 13);dg.addDirectedEdges(16, 13);dg.addDirectedEdges(1, 14);dg.addDirectedEdges(2, 14);dg.addDirectedEdges(3, 14);dg.addDirectedEdges(4, 14);dg.addDirectedEdges(5, 14);dg.addDirectedEdges(6, 14);dg.addDirectedEdges(7, 14);dg.addDirectedEdges(8, 14);dg.addDirectedEdges(9, 14);dg.addDirectedEdges(12, 14);dg.addDirectedEdges(13, 14);dg.addDirectedEdges(15, 14);dg.addDirectedEdges(16, 14);dg.addDirectedEdges(17, 14);dg.addDirectedEdges(1, 15);dg.addDirectedEdges(2, 15);dg.addDirectedEdges(3, 15);dg.addDirectedEdges(4, 15);dg.addDirectedEdges(5, 15);dg.addDirectedEdges(6, 15);dg.addDirectedEdges(7, 15);dg.addDirectedEdges(8, 15);dg.addDirectedEdges(9, 15);dg.addDirectedEdges(10, 15);dg.addDirectedEdges(12, 15);dg.addDirectedEdges(13, 15);dg.addDirectedEdges(14, 15);dg.addDirectedEdges(16, 15);dg.addDirectedEdges(17, 15);dg.addDirectedEdges(18, 15);dg.addDirectedEdges(20, 15);dg.addDirectedEdges(1, 16);dg.addDirectedEdges(2, 16);dg.addDirectedEdges(3, 16);dg.addDirectedEdges(4, 16);dg.addDirectedEdges(5, 16);dg.addDirectedEdges(6, 16);dg.addDirectedEdges(7, 16);dg.addDirectedEdges(8, 16);dg.addDirectedEdges(9, 16);dg.addDirectedEdges(10, 16);dg.addDirectedEdges(11, 16);dg.addDirectedEdges(12, 16);dg.addDirectedEdges(13, 16);dg.addDirectedEdges(14, 16);dg.addDirectedEdges(15, 16);dg.addDirectedEdges(17, 16);dg.addDirectedEdges(18, 16);dg.addDirectedEdges(19, 16);dg.addDirectedEdges(20, 16);dg.addDirectedEdges(21, 16);dg.addDirectedEdges(22, 16);dg.addDirectedEdges(1, 17);dg.addDirectedEdges(4, 17);dg.addDirectedEdges(5, 17);dg.addDirectedEdges(6, 17);dg.addDirectedEdges(7, 17);dg.addDirectedEdges(8, 17);dg.addDirectedEdges(9, 17);dg.addDirectedEdges(14, 17);dg.addDirectedEdges(15, 17);dg.addDirectedEdges(16, 17);dg.addDirectedEdges(18, 17);dg.addDirectedEdges(19, 17);dg.addDirectedEdges(1, 18);dg.addDirectedEdges(4, 18);dg.addDirectedEdges(5, 18);dg.addDirectedEdges(6, 18);dg.addDirectedEdges(7, 18);dg.addDirectedEdges(8, 18);dg.addDirectedEdges(9, 18);dg.addDirectedEdges(10, 18);dg.addDirectedEdges(15, 18);dg.addDirectedEdges(16, 18);dg.addDirectedEdges(17, 18);dg.addDirectedEdges(19, 18);dg.addDirectedEdges(20, 18);dg.addDirectedEdges(1, 19);dg.addDirectedEdges(4, 19);dg.addDirectedEdges(5, 19);dg.addDirectedEdges(6, 19);dg.addDirectedEdges(7, 19);dg.addDirectedEdges(8, 19);dg.addDirectedEdges(9, 19);dg.addDirectedEdges(10, 19);dg.addDirectedEdges(11, 19);dg.addDirectedEdges(16, 19);dg.addDirectedEdges(17, 19);dg.addDirectedEdges(18, 19);dg.addDirectedEdges(20, 19);dg.addDirectedEdges(21, 19);dg.addDirectedEdges(22, 19);dg.addDirectedEdges(1, 20);dg.addDirectedEdges(7, 20);dg.addDirectedEdges(8, 20);dg.addDirectedEdges(9, 20);dg.addDirectedEdges(10, 20);dg.addDirectedEdges(15, 20);dg.addDirectedEdges(16, 20);dg.addDirectedEdges(18, 20);dg.addDirectedEdges(19, 20);dg.addDirectedEdges(21, 20);dg.addDirectedEdges(1, 21);dg.addDirectedEdges(7, 21);dg.addDirectedEdges(8, 21);dg.addDirectedEdges(9, 21);dg.addDirectedEdges(10, 21);dg.addDirectedEdges(11, 21);dg.addDirectedEdges(16, 21);dg.addDirectedEdges(19, 21);dg.addDirectedEdges(20, 21);dg.addDirectedEdges(22, 21);dg.addDirectedEdges(1, 22);dg.addDirectedEdges(9, 22);dg.addDirectedEdges(10, 22);dg.addDirectedEdges(11, 22);dg.addDirectedEdges(16, 22);dg.addDirectedEdges(19, 22);dg.addDirectedEdges(21, 22);return dg;}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01585240d81c7d23136495e530e0dddd\",\n \"score\": \"0.548937\",\n \"text\": \"public static void main(String[] args) {\\n Graph myGraph = new Graph();\\n myGraph = createGraph();\\n\\n //Print out all elements of the Graph\\n for (Vertex myVertex : myGraph.getAdjVertices().keySet()) {\\n System.out.println(myVertex.label);\\n }\\n System.out.println();\\n\\n\\n //EXAMPLE FROM MOODLE (FLIGHTS)\\n //Create a new Graph based on the copied code. The new Graph is related to the network of airports in South Africa\\n\\n Graph flightGraph = new Graph();\\n flightGraph = createAirportsGraph();\\n\\n //Print out all elements of the new Graph\\n for (Vertex myVertex : flightGraph.getAdjVertices().keySet()) {\\n System.out.println(myVertex.label);\\n }\\n System.out.println();\\n\\n\\n //Write an algorithm that calculates how many direct flights are in the Graph (in total).\\n int directFlights = 0;\\n for (Vertex myVertex : flightGraph.getAdjVertices().keySet()) {\\n for (Vertex flight : flightGraph.getAdjVertices(myVertex.label)) {\\n directFlights++;\\n }\\n }\\n System.out.println(\\\"Total number of direct flights: \\\" + directFlights);\\n System.out.println();\\n\\n\\n //Print out all airports which are connected to “Cape Town” airport with direct flight.\\n System.out.println(\\\"Direct flights from \\\\\\\"Cape Town\\\\\\\": \\\");\\n for (Vertex directFlightCT : flightGraph.getAdjVertices(\\\"Cape Town\\\")) {\\n System.out.println(directFlightCT.label);\\n }\\n System.out.println();\\n\\n\\n //Write an algorithm that calculates how many direct flights are from Jo’burg airport.\\n\\n int directFlightsJB = 0;\\n for (Vertex directFlightJB : flightGraph.getAdjVertices(\\\"Jo'burg\\\")) {\\n directFlightsJB++;\\n }\\n System.out.println(\\\"Number of direct flights from \\\\\\\"Jo'burg\\\\\\\": \\\" + directFlightsJB);\\n System.out.println();\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7459bdb579c1ae1c9612e460c272d93\",\n \"score\": \"0.5478908\",\n \"text\": \"@Override\\n public NDependencies solve() {\\n for (RootInfo rootInfo : pending) {\\n addRootDefinition0(rootInfo.dependency, rootInfo.def, session);\\n }\\n pending.clear();\\n List<NDependencyTreeNodeBuild> mergedRootNodeBuilders = new ArrayList<>();\\n List<NDependencyTreeNodeBuild> nonMergedRootNodeBuilders = new ArrayList<>();\\n Queue<NDependencyTreeNodeBuild> queue = new ArrayDeque<>();\\n Set<NId> sourceIds = new LinkedHashSet<>();\\n LinkedHashSet<NDependency> immediates = new LinkedHashSet<>();\\n NDependencyInfoSet mergedVisitedSet = new NDependencyInfoSet();\\n NDependencyInfoSet nonMergedVisitedSet = new NDependencyInfoSet();\\n NDependencyFilter effDependencyFilter = null;\\n NDependencyFilters filter = NDependencyFilters.of(session);\\n if (dependencyFilter == null) {\\n effDependencyFilter = filter.always();\\n } else {\\n effDependencyFilter = dependencyFilter;\\n }\\n for (NDependencyTreeNodeBuild currentNode : defs) {\\n NId id = currentNode.getEffectiveId();\\n if (sourceIds.add(id)) {\\n// sourceIds.add(id);\\n if (mergedVisitedSet.add(currentNode.key)) {\\n mergedRootNodeBuilders.add(currentNode);\\n List<NDependency> immediate = CoreFilterUtils.filterDependencies(id,\\n currentNode.getEffectiveDescriptor().getDependencies(),\\n effDependencyFilter, session);\\n immediates.addAll(immediate);\\n for (NDependency dependency : currentNode.def.getEffectiveDescriptor().get(session).getDependencies()) {\\n dependency = dependency.builder().setProperty(\\\"provided-by\\\", currentNode.id.toString()).build();\\n// if(dependency.toId().contains(\\\"jai_imageio\\\")){\\n// System.out.print(\\\"\\\");\\n// }\\n NDependency effDependency = dependency.builder()\\n .setScope(combineScopes(currentNode.effDependency.getScope(), dependency.getScope()))\\n .build();\\n if (effDependencyFilter.acceptDependency(currentNode.def.getId(), effDependency, session)\\n && !currentNode.exclusions.contains(dependency.toId().getShortId())\\n ) {\\n NDefinition def2 = null;\\n try {\\n def2 = NSearchCommand.of(session)\\n .addId(dependency.toId())\\n .setEffective(true)\\n .setContent(shouldIncludeContent)\\n .setLatest(true).getResultDefinitions().findFirst().get();\\n } catch (NNotFoundException ex) {\\n //\\n }\\n if(def2!=null){\\n effDependency=effDependency\\n .builder()\\n .setVersion(def2.getId().getVersion());\\n }\\n NDependencyTreeNodeBuild info = new NDependencyTreeNodeBuild(currentNode, def2, dependency, effDependency, currentNode.depth + 1, session);\\n info.exclusions.addAll(currentNode.exclusions);\\n for (NId exclusion : dependency.getExclusions()) {\\n info.exclusions.add(exclusion.getShortId());\\n }\\n currentNode.children.add(info);\\n nonMergedRootNodeBuilders.add(info);\\n queue.add(info);\\n }\\n }\\n }\\n }\\n }\\n NDependencyTreeNodeBuild currentNode;\\n while (!queue.isEmpty()) {\\n currentNode = queue.remove();\\n NDependencyInfo nextId = currentNode.key;\\n if (!mergedVisitedSet.contains(nextId) && nonMergedVisitedSet.add(nextId)) {\\n mergedVisitedSet.add(nextId);//ensure added to merged!\\n NDescriptor effectiveDescriptor = currentNode.getEffectiveDescriptor();\\n if (effectiveDescriptor != null) {\\n for (NDependency dependency : effectiveDescriptor.getDependencies()) {\\n dependency = dependency.builder().setProperty(\\\"provided-by\\\", currentNode.id.toString()).build();\\n// if(dependency.toId().contains(\\\"jai_imageio\\\")){\\n// System.out.print(\\\"\\\");\\n// }\\n NDependency effDependency = dependency.builder()\\n .setScope(combineScopes(currentNode.effDependency.getScope(), dependency.getScope()))\\n .build();\\n if (effDependencyFilter.acceptDependency(\\n currentNode.getEffectiveId(), effDependency, session\\n ) && !currentNode.exclusions.contains(dependency.toId().getShortId())) {\\n NDefinition def2 = null;\\n try {\\n def2 = NSearchCommand.of(session)\\n .addId(dependency.toId())\\n .setEffective(true)\\n .setContent(shouldIncludeContent)\\n .setLatest(true).getResultDefinitions().findFirst().orNull();\\n } catch (NNotFoundException ex) {\\n //\\n }\\n if(def2!=null){\\n effDependency=effDependency\\n .builder()\\n .setVersion(def2.getId().getVersion());\\n }\\n NDependencyTreeNodeBuild info = new NDependencyTreeNodeBuild(currentNode, def2, dependency,effDependency, currentNode.depth + 1, session);\\n info.exclusions.addAll(currentNode.exclusions);\\n for (NId exclusion : dependency.getExclusions()) {\\n info.exclusions.add(exclusion.getShortId());\\n }\\n currentNode.children.add(info);\\n if(!mergedVisitedSet.contains(info.key)) {\\n queue.add(info);\\n }\\n }\\n }\\n }\\n } else {\\n currentNode.alreadyVisited = true;\\n }\\n }\\n List<NDependencyTreeNode> mergedRootNodes = mergedRootNodeBuilders.stream().map(NDependencyTreeNodeBuild::build).collect(Collectors.toList());\\n List<NDependencyTreeNode> nonMergedRootNodes = nonMergedRootNodeBuilders.stream().map(NDependencyTreeNodeBuild::build).collect(Collectors.toList());\\n final NDependency[] mergedDepsList = mergedVisitedSet.visitedSet.values().stream().map(NDependencyInfo::getDependency)\\n .toArray(NDependency[]::new);\\n final NDependency[] nonMergedDepsList = nonMergedVisitedSet.visitedSet.values().stream().map(NDependencyInfo::getDependency)\\n .toArray(NDependency[]::new);\\n return new DefaultNDependencies(\\n getName(),\\n sourceIds.toArray(new NId[0]), effDependencyFilter,\\n immediates.toArray(new NDependency[0]),\\n nonMergedDepsList,\\n nonMergedRootNodes.toArray(new NDependencyTreeNode[0]),\\n mergedDepsList,\\n mergedRootNodes.toArray(new NDependencyTreeNode[0]),\\n e-> NElements.of(e).ofString(\\\"solver\\\"),session\\n );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab5edb40ddbe0df5b86cc05a27ecf380\",\n \"score\": \"0.5470395\",\n \"text\": \"@SuppressWarnings(value = {})\\n\\t public void show()\\n\\t {\\n//\\t\\t System.out.println(\\\"hierarchy!!!\\\");\\n//\\t\\t for(Shape shape:objects){ \\n//\\t\\t\\t Circle circle=(Circle)shape;\\n//\\t\\t\\t System.out.println(\\\"(\\\"+circle.getPosition().getX()+\\\",\\\"+circle.getPosition().getY()+\\\")\\\"+\\\",\\\"+circle.getR());\\n//\\t\\t }\\n\\t\\t for (int i = 0; i < nodes.length; i++) {\\n\\t\\t\\t if (nodes[i] != null) {\\n\\t\\t\\t nodes[i].show();\\n\\t\\t\\t //nodes[i] = null;\\n\\t\\t\\t // System.out.println(\\\"#\\\");\\n\\t\\t\\t \\n\\t\\t\\t }\\n\\t\\t\\t else\\n\\t\\t\\t System.out.println(\\\"#\\\");\\n\\t\\t\\t \\n\\t\\t\\t }System.out.println(\\\"@\\\");\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca185da10ef0a73be2d2f0df5428bdd4\",\n \"score\": \"0.54631793\",\n \"text\": \"public interface Graph extends AutoCloseable {\\n /**\\n * 获取图的ID\\n *\\n * @return\\n */\\n int id();\\n\\n /**\\n * 获取图的名字\\n *\\n * @return\\n */\\n String name();\\n\\n /**\\n * 获取所有节点\\n *\\n * @return\\n */\\n List<Node> listNodes();\\n\\n /**\\n * 获取所有type类型的节点\\n *\\n * @param type\\n * @return\\n */\\n List<Node> listNodes(String type);\\n\\n /**\\n * 根据类型和Id返回节点\\n */\\n Node getNode(String type, String id);\\n\\n /**\\n * 根据头节点id,尾节点id返回关系\\n **/\\n Relation getRelation(String headType, String headId, String tailType, String tailId, String type);\\n\\n /**\\n *\\n */\\n List<Relation> getRelations(String tailType, String relType);\\n /**\\n * 根据指定的查询条件，进行关系子图查询\\n * @param relQuerySpec\\n * @return\\n */\\n //RelationGraph queryRelation(RelQuerySpec relQuerySpec);\\n\\n\\n /**\\n * 创建一个新的节点，由参数指定name和type，系统生生ID\\n *\\n * @param id\\n * @param type\\n * @return\\n */\\n Node newNode(String type, String id, int value);\\n\\n\\n /**\\n * 删除指定类型的边\\n *\\n * @param headType\\n * @param headId\\n * @param tailType\\n * @param tailId\\n */\\n void deleteRelation(String headType, String headId, String tailType, String tailId, String relationType);\\n\\n /**\\n * 清空整个图的数据\\n */\\n void clear();\\n\\n /**\\n * 根据头节点,尾节点新建一条边\\n *\\n * @param headType\\n * @param headId\\n * @param tailType\\n * @param tailId\\n * @param relationType\\n * @return\\n */\\n public Relation newRelation(String headType, String headId, String tailType, String tailId, String relationType, int val);\\n\\n /**\\n * 返回当前图的meta\\n *\\n * @return\\n */\\n public GraphMeta graphMeta();\\n\\n\\n List<Node> getNodesInTwoLevel(GDBNode start);\\n\\n\\n /**\\n * 查询图中节点个数\\n */\\n public long getNodeCount();\\n\\n /***\\n *查询图中关系个数\\n */\\n\\n public long getRelCount();\\n\\n\\n /**\\n * 根据节点的sname,attributes检索节点\\n */\\n\\n public List<GDBNode> query(int nodeType, List<QueryMap> queries, int start, int len);\\n\\n /**\\n * 根据节点的sname,attributes检索节点个数\\n */\\n\\n public long queryCount(int nodeType, List<QueryMap> queries);\\n\\n /**\\n * 返回图中节点各种类型的个数信息\\n * */\\n\\n /**\\n * 返回图中关系各种类型的个数信息\\n */\\n Map<String, Long> getNodeTypeCount();\\n\\n Map<String, Long> getRelationTypeCount();\\n\\n List<Node> shortestPath(GDBNode start , GDBNode end);\\n\\n void delete();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80e22b27fa6a0df311932aa04a2d1728\",\n \"score\": \"0.5459342\",\n \"text\": \"public static void main(String[] args){\\n In in = new In(\\\"rosalind_dag.txt\\\");\\n int x = in.readInt();//number of graphs\\n for(int i=0;i<x;i++) {\\n int v = in.readInt();//number of vertices in the first graph\\n int e = in.readInt();//number of edges in the first graph.\\n Acyclic g = new Acyclic(v + 1);\\n for (int j = 0; j < e; j++) {//read all the edge pairs until we get to the next graph\\n int p = in.readInt();\\n int q = in.readInt();\\n g.addEdge(p, q);\\n }\\n boolean flag=true;\\n for(int k=1;k<v+1;k++) {\\n for(int neighbor:neighbors[k]) {\\n flag = g.traverseDepthFirst(k, neighbor);\\n }\\n if(!flag){\\n break;\\n }\\n }\\n if(flag){\\n StdOut.print(\\\"1 \\\");\\n }else{\\n StdOut.print(\\\"-1 \\\");\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f67853f2575abfa95a647d7dadf722c5\",\n \"score\": \"0.5441345\",\n \"text\": \"public static void transitiveClosure() {\\r\\n\\r\\n\\t\\tfor (int i = 0; i < graph.vertexCount; i++) {\\r\\n\\t\\t\\ttransitiveHelper(i, i);\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tfor (int row = 0; row < graph.vertexCount; row++) {\\r\\n\\t\\t\\tfor (int col = 0; col < graph.vertexCount; col++) {\\r\\n\\t\\t\\t\\tSystem.out.print(transitiveClosure[row][col]);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tSystem.out.println(\\\"\\\\n\\\");\\r\\n\\t\\t}\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9532012a4c6dea713702c9e721b8d39\",\n \"score\": \"0.54404336\",\n \"text\": \"private void detectCycles() {\\n visited = new HashSet<>();\\n visitPath = new LinkedHashSet<>(); // preserve insertion order\\n for (ModuleReference mref : nameToReference.values()) {\\n visit(mref.descriptor());\\n }\\n visited.clear();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5bb3a9d1fb00b2422369eb0791f5ee65\",\n \"score\": \"0.5400103\",\n \"text\": \"protected void printCharts() {\\n MapIterator<?, HelmChart> it = chartsReferenced.mapIterator();\\n IChartMapPrinter p = getPrinter();\\n try {\\n if (chartsReferenced.size() == 1) {\\n p.printSectionHeader(\\\"There is one referenced Helm Chart\\\");\\n } else {\\n p.printSectionHeader(\\\"There are \\\" + chartsReferenced.size() + \\\" referenced Helm Charts\\\");\\n }\\n while (it.hasNext()) {\\n it.next();\\n p.printChart(it.getValue());\\n }\\n } catch (ChartMapException e) {\\n logger.error(\\\"IOException printing charts: {} \\\", e.getMessage());\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3adf6de88b3081ff932346e6221ef802\",\n \"score\": \"0.53989214\",\n \"text\": \"@NonNull\\n List<GraphItem> getPackageDependencies();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24ce569319d89ebcbf464b05264ca3ec\",\n \"score\": \"0.5387147\",\n \"text\": \"public String graph() {\\n StringBuilder s = new StringBuilder();\\n s.append(v + \\\" 个顶点, \\\" + e + \\\" 条边 \\\" + NEWLINE);\\n for (int i = 0; i < v; i++) {\\n s.append(i + \\\": \\\");\\n for (int w : adj[i]) {\\n s.append(w + \\\" \\\");\\n }\\n s.append(NEWLINE);\\n }\\n return s.toString();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8a3526dc4f02277e7fe8f53a3c4e810\",\n \"score\": \"0.53804666\",\n \"text\": \"public void printSemanticGraph(String text) {\\n\\t\\tAnnotation document = new Annotation(text);\\r\\n\\r\\n\\t\\t// run all Annotators on this text\\r\\n\\t\\tProperties props = new Properties();\\r\\n\\t\\tprops.setProperty(\\\"annotators\\\", \\\"tokenize, ssplit, pos, lemma, ner, parse, dcoref\\\");\\r\\n\\t\\tStanfordCoreNLP pipeline = new StanfordCoreNLP(props);\\r\\n\\t\\tpipeline.annotate(document);\\r\\n\\t\\t// for each sentence you can get a list of collapsed dependencies as follows\\r\\n\\t\\t// a CoreMap is essentially a Map that uses class objects as keys and has values with custom types \\r\\n\\t\\t List < CoreMap > sentences = document.get(SentencesAnnotation.class);\\r\\n\\t\\t for (CoreMap sentence: sentences) {\\r\\n\\t\\t \\t// traversing the words in the current sentence // a CoreLabel is a CoreMap with additional token-specific methods \\r\\n//\\t\\t \\tfor (CoreLabel token: sentence.get(TokensAnnotation.class)) {\\r\\n//\\t\\t \\t\\t// this is the text of the token \\r\\n//\\t\\t \\t\\tString word = token.get(TextAnnotation.class); // this is the POS tag of the token \\r\\n//\\t\\t \\t\\tString pos = token.get(PartOfSpeechAnnotation.class); // this is the NER label of the token \\r\\n//\\t\\t \\t\\tString ne = token.get(NamedEntityTagAnnotation.class);\\r\\n//\\t\\t \\t} // this is the parse tree of the current sentence \\r\\n//\\t\\t \\tTree tree = sentence.get(TreeAnnotation.class); // this is the Stanford dependency graph of the current sentence \\r\\n\\t\\t \\tSemanticGraph dependencies = sentence.get(CollapsedCCProcessedDependenciesAnnotation.class);\\r\\n\\t\\t \\tint egde = dependencies.edgeCount();\\r\\n\\t\\t \\tSystem.out.println(\\\"EDGE: \\\" +egde);\\r\\n\\t\\t \\tIterator<SemanticGraphEdge> itr = dependencies.edgeIterable().iterator();\\r\\n\\t\\t \\twhile(itr.hasNext())\\r\\n\\t\\t \\t{\\r\\n\\t\\t \\t\\tSystem.out.println(\\\"SematicGraphEdge: \\\" + itr.next());\\r\\n\\t\\t \\t}\\r\\n\\t\\t \\t\\r\\n\\t\\t \\tSystem.out.println(\\\"Sematic Graph: \\\" + dependencies.toFormattedString());\\r\\n\\t\\t } // This is the coreference link graph // Each chain stores a set of mentions that link to each other, // along with a method for getting the most representative mention // Both sentence and token offsets start at 1! \\r\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dacb9f0d6db3dee250c7b4700df25b5\",\n \"score\": \"0.5368693\",\n \"text\": \"public void display() {\\n\\t\\n\\t\\tSystem.out.println(\\\"Graph is bipartite\\\");\\n\\t\\n\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"604f838e390026a59a1e953fcd80c3ae\",\n \"score\": \"0.53637516\",\n \"text\": \"void report() {\\n fNodes.forEach(new Consumer<Node>() {\\n @Override\\n public void accept(Node node) {\\n System.out.print(node.toString());\\n }\\n\\n });\\n fEdges.forEach(new Consumer<Edge>() {\\n @Override\\n public void accept(Edge edge) {\\n System.out.print(edge.toString());\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b2ae65935480f3d16a75c6508aa0ed8\",\n \"score\": \"0.535927\",\n \"text\": \"public static void generateFlowchart() {\\n \\tIterator<DataModelObj> iterator = methodDeclObjList.iterator();\\r\\n while (iterator.hasNext()) {\\r\\n \\tDataModelObj methObj = iterator.next();\\r\\n \\t//int methId=methObj.getId();\\r\\n \\t//String currentMethName=methObj.getMethodName();\\r\\n \\t//System.out.println(methId + currentMethName);\\r\\n if (methObj.getMethodName().equals(\\\"main\\\")) {\\r\\n \\t//System.out.println(\\\"main found\\\");\\r\\n \\tString [] currMethText = methObj.getMethodDeclText();\\r\\n \\tfor (int i = 0;i < currMethText.length;i++) {\\r\\n \\t\\t\\tString methStr=currMethText[i]; \\t\\t\\t\\r\\n \\t\\t\\tif (methStr.contains(\\\"(\\\") && methStr.contains(\\\")\\\") && !methStr.contains(\\\"main\\\")) {\\r\\n \\t\\t\\t\\t//System.out.println(methStr);\\r\\n \\t\\t\\t}\\r\\n \\t}\\r\\n }\\r\\n }\\r\\n \\t/*try {\\r\\n \\t\\tfor (FlowchartObj curMeth : methodDeclObjList) {\\r\\n \\t\\t\\tString currentMethName=curMeth.getMethodName();\\r\\n \\t\\t\\tint methId=curMeth.getId();\\r\\n \\t\\t\\t//System.out.println(currObj);\\r\\n \\t\\t\\t//String currentMethName = ((FlowchartObj) currObj).getMethodName();\\r\\n \\t\\t\\tSystem.out.println(methId + currentMethName);\\r\\n \\t\\t\\tif (currentMethName == \\\"main\\\") {\\r\\n \\t\\t\\t\\tString [] currentMethText = FlowchartObj.getMethodDeclText();\\r\\n \\t\\t\\t}\\r\\n \\t\\t}\\r\\n \\t\\t\\r\\n \\t\\t\\r\\n \\t\\t\\r\\n \\t\\t}\\r\\n \\t} catch (Exception e) {\\r\\n \\t\\tSystem.out.print(\\\"FlowchartObj Exception\\\");\\r\\n }*/\\r\\n \\t\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7a6922a1a2bcc5f9f927ec21a2c9dd1\",\n \"score\": \"0.53480333\",\n \"text\": \"public Set<RdfGraph> getNamedGraphs();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63bde26d13cdb6b4375bef7ea7b702e5\",\n \"score\": \"0.5339289\",\n \"text\": \"G getGraph();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"223ef88993c19cd8bbcd8554c7ff2486\",\n \"score\": \"0.5320959\",\n \"text\": \"public void print() {\\n Iterator unitIt = graph.iterator();\\n while(unitIt.hasNext()){\\n Unit s = (Unit) unitIt.next();\\n Map<Local, Definition> set = getFlowBefore(s);\\n int level = 2;\\n if(s.toString().trim().equals(\\\"return\\\"))\\n level = 3;\\n\\n debug(\\\"Unit: \\\" + s.toString(), level);\\n for(Map.Entry<Local, Definition> entry : set.entrySet()){\\n String output = entry.getKey().getName() + \\\":\\\" + entry.getValue().toString();\\n debug(output, level);\\n }\\n }\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a83e569b070dda8495476942299898cf\",\n \"score\": \"0.5316148\",\n \"text\": \"private static void setAdjacents(int projectID,Graph graph ){\\n List<TaskModel> dependencies = null;\\n for(Node n : graph.nodes){\\n dependencies = n.getData().task.getDependencies();\\n for(TaskModel t:dependencies){\\n graph.addDirectedEdge(graph.getNodeByID(t.getTaskId()),n);\\n }\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1617ce16307f608f06139a47223f6fda\",\n \"score\": \"0.5314265\",\n \"text\": \"private static String listDeps (List dependencyList) {\\n StringBuffer sb = new StringBuffer ();\\n Iterator iter = dependencyList.iterator ();\\n while (iter.hasNext ()) {\\n Object o = iter.next ();\\n \\n // Test that the user really passed in a Class. Versions\\n // prior to 2.2 received Strings instead, and any user that\\n // used the code would find it broken.\\n if (o != null && o instanceof Class) {\\n sb.append (((Class) o).getName ());\\n } else {\\n sb.append (o);\\n }\\n \\n if (iter.hasNext ()) {\\n sb.append (\\\" -> \\\");\\n }\\n }\\n \\n return sb.toString ();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6927ee403e70ff0ecdc693c1ad0d0e79\",\n \"score\": \"0.5312889\",\n \"text\": \"public void printGraph(){\\n\\t\\t\\n\\t\\tSystem.out.println( \\\"\\\\n\\\\nThe Program Blocks Representation\\\\n\\\\n \\\" + m_blocks.toString() );\\n\\t\\tSystem.out.println( \\\"\\\\n\\\\nForward edges Representation\\\\n\\\\n \\\" + m_blocks.getNextEdges());\\n\\t\\tSystem.out.println( \\\"\\\\n\\\\nBackward edges nodes Representation\\\\n\\\\n \\\" + m_blocks.getPreviousEdges() + \\\"\\\\n\\\\n\\\");\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8247b41ab4b6ac5b45a7a864fa8be95\",\n \"score\": \"0.53103346\",\n \"text\": \"Graph getGraph();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28a8e0215f5bebcd1f3642726ff7e827\",\n \"score\": \"0.53037494\",\n \"text\": \"void graph(Injector injector) throws IOException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47c81524a9154c13bf30d1a9e1074874\",\n \"score\": \"0.52929294\",\n \"text\": \"public void print() {\\n\\t\\tIterator<Integer> iterator = V.keySet().iterator();\\n\\t\\tSystem.out.println(\\\"\\\\n-----------graph----------------\\\");\\n\\t\\twhile (iterator.hasNext()) {\\n\\t\\t\\tVertex v = V.get(iterator.next());\\n\\t\\t\\tSystem.out.println(\\\"Vertex: \\\" + v.getNameString() + \\\", degree=\\\"\\n\\t\\t\\t\\t\\t+ v.getDegree());\\n\\t\\t\\tfor (Edge e : v.edges) {\\n\\t\\t\\t\\tSystem.out.print(\\\"\\\\t\\\\t\\\");\\n\\t\\t\\t\\te.print();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"88d2c2678e1803f59d65a24a3c0398e1\",\n \"score\": \"0.52894896\",\n \"text\": \"static void showGraph(ArrayList<ArrayList<Integer>> graph) {\\n for(int i=0;i< graph.size(); i++ ){\\n System.out.print(\\\"Vertex : \\\" + i + \\\" : \\\");\\n for(int j = 0; j < graph.get(i).size(); j++) {\\n System.out.print(\\\" -> \\\"+ graph.get(i).get(j));\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"786a2f3e996c450d297c1d2c986bd88c\",\n \"score\": \"0.52854776\",\n \"text\": \"private Vector<String> createGraph(){\\n\\t\\tentityGraphMaker = new EntityGraphProcessor(sqlMgr);\\n\\t\\tentityGraphMaker.createGraph();\\n\\t\\treturn entityGraphMaker.getFactTables();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4132b364c2d2eb0e4a2c577f523be047\",\n \"score\": \"0.52735823\",\n \"text\": \"int getDependenciesCount();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"023f03d987c9cd1bfdc4c1acf96855cd\",\n \"score\": \"0.52647704\",\n \"text\": \"public static void printGraph(Graph g) {\\n StringBuilder sb = new StringBuilder();\\n sb.append(\\\"========== Graph Visualizer ==========\\\\n\\\");\\n sb.append(\\\"(V):\\\\t|\\\\t(E):\\\\n\\\");\\n for(Object o : g.getVertices()) {\\n sb.append(o.toString() + \\\"\\\\t\\\\t|\\\\t\\\");\\n StringBuilder adjBuilder = new StringBuilder();\\n for(Object adj : g.getAdjacent(o)) {\\n if(adjBuilder.length() > 0) {\\n adjBuilder.append(\\\", \\\");\\n }\\n adjBuilder.append(adj.toString());\\n adjBuilder.append(\\\"(\\\" + g.getEdgeCost(o, adj) + \\\")\\\");\\n }\\n sb.append(adjBuilder.toString() + \\\"\\\\n\\\");\\n }\\n System.out.println(sb.toString());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8371092a4a8c6e967a3f83cdd3702479\",\n \"score\": \"0.5250286\",\n \"text\": \"Set<String> getDependencies();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4652c6df6c7820b996eb68bcb60bc124\",\n \"score\": \"0.524953\",\n \"text\": \"public static ImmutableGraph<FileDescriptorProto> buildDependencyGraph(\\n FileDescriptorSet fileDescriptorSet) {\\n\\n MutableGraph<FileDescriptorProto> dependenciesGraph =\\n buildFileDescriptorsGraph(fileDescriptorSet);\\n\\n ImmutableMap<String, FileDescriptorProto> knownDescriptors =\\n buildFileDescriptorsMapping(fileDescriptorSet);\\n\\n fileDescriptorSet.getFileList().forEach(descriptorProto -> processFileDescriptor(dependenciesGraph, knownDescriptors, descriptorProto));\\n\\n Conditions.checkState(\\n !Graphs.hasCycle(dependenciesGraph),\\n CircularDependenciesException::new);\\n\\n return ImmutableGraph.copyOf(dependenciesGraph);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d1c90f08c9367e25ad6825827e63f70\",\n \"score\": \"0.524804\",\n \"text\": \"public void cumulateDependencyViolations(ModelTree mt) {\\n \\t// calculate state unallowed/allowed dependencies for the tree\\n \\t\\t// compute unallowed dependency marks\\n \\t\\tfor(ModuleNode mn : mt.getModules()) {\\n \\t\\t\\tboolean mnUnallowed = false;\\n \\t\\t\\tfor(PackageNode pn : mn.getPackages()) {\\n \\t\\t\\t\\tboolean pnUnallowed = false;\\n \\t\\t\\t\\tfor (ClassNode cn : pn.getClasses()) {\\n \\t\\t\\t\\t\\tif (cn instanceof DependentClassNode) {\\n \\t\\t\\t\\t\\t\\tDependentClassNode dcn = (DependentClassNode) cn;\\n \\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\tDependenciesTreeModel dtm = new DependenciesTreeModel();\\n \\t\\t\\t\\t\\t\\tdtm.setRoot(createModel(dcn, mt, dtm));\\n \\t\\t\\t\\t\\t\\tdcn.getClassDependency().setUnallowedDependency(((UnallowedOrAllowedDependency) dtm.getRoot()).isUnallowedDependency()); \\n \\t\\t\\t\\t\\t\\tdcn.setDependenciesTreeModel(dtm);\\n \\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\tif (dcn.getClassDependency().isUnallowedDependency()) {\\n \\t\\t\\t\\t\\t\\t\\tpnUnallowed = true;\\n \\t\\t\\t\\t\\t\\t\\tmnUnallowed = true;\\n \\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\tdtm = new DependenciesTreeModel();\\n \\t\\t\\t\\t\\t\\tdtm.setRoot(createIncomingModel(dcn, mt, dtm));\\n \\t\\t\\t\\t\\t\\tdcn.setIncomingDependenciesTreeModel(dtm);\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t}\\n \\t\\t\\t\\t\\n \\t\\t\\t\\tif (pn instanceof DependentPackageNode) {\\n \\t\\t\\t\\t\\t((DependentPackageNode) pn).setUnallowedDependency(pnUnallowed);\\n \\t\\t\\t\\t}\\n \\t\\t\\t}\\n \\n \\t\\t\\tif (mn instanceof DependentModuleNode) {\\n \\t\\t\\t\\t((DependentModuleNode) mn).setUnallowedDependency(mnUnallowed);\\n \\t\\t\\t}\\n \\t\\t}\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b4690b9afb3805820d6adaac8b59738\",\n \"score\": \"0.5247962\",\n \"text\": \"public static void main(String[] args) {\\n generator = new Random();\\n\\n\\n ListGraph graph = CreateDirectedAcyclicGraph();\\n FrmGraph frm = new FrmGraph(graph,70);\\n\\n\\n //-- undirected ve acyclic metodları hatalı\\n if ( is_undirected(graph)) {\\n System.out.println(\\\"Graph is undirected\\\");\\n }\\n else {\\n System.out.println(\\\"Graph is directed\\\");\\n }\\n\\n if ( is_acyclic_graph(graph)) {\\n System.out.println(\\\"Graph is acyclic\\\");\\n }\\n else {\\n System.out.println(\\\"Graph is cyclic\\\");\\n }\\n\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ac1027f4a569a982c3f1d64e1936f6c\",\n \"score\": \"0.5239291\",\n \"text\": \"public Graph getGraph();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9891672e78e24adf39782ae572f39fa0\",\n \"score\": \"0.5237613\",\n \"text\": \"private void displayNodeColors() {\\n System.out.println(\\\"Displaying all room names...\\\");\\n for(Node i : mGraph)\\n System.out.println(i.getRoomName());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8722b7183d4bb1b3b85cf8fe78b7d5b2\",\n \"score\": \"0.52348155\",\n \"text\": \"private void clearDependencies() {\\n depend.removeAllElements();\\n try {\\n removeAllReferences();\\n }\\n catch (VisADException exc) { }\\n catch (RemoteException exc) { }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"62d9e6dcaf0a33cee868e553690d7404\",\n \"score\": \"0.52252924\",\n \"text\": \"public ModelTree getModelTree(DependencyVisitor dv) throws OverlappingModulesDefinitionException {\\n \\tDefaultModelTree result = new DefaultModelTree();\\n \\t\\n \\t// build ModelTree\\n \\tfor(String packagename : dv.getPackages().keySet()) {\\n \\n \\t\\t// get the module for this package\\n \\t\\t\\tString packagemodule = getMatchingModule(packagename+\\\"/Dummy\\\");\\n \\t\\t\\t\\n \\t\\t\\tboolean packageUnassigned = false;\\n \\t\\t\\tif (packagemodule == null) {\\n \\t\\t\\t\\tpackagemodule = \\\"unassigned\\\";\\n \\t\\t\\t\\tpackageUnassigned = true;\\n \\t\\t\\t}\\n \\t\\t\\t\\n \\t\\t\\tModuleNode module = result.getModule(packagemodule);\\n \\t\\t\\t\\n \\t\\t\\tif (module == null) {\\n \\t\\t\\t\\tmodule = new DependentModuleNode(packagemodule, packageUnassigned);\\n \\t\\t\\t\\tresult.add(module);\\n \\t\\t\\t}\\n \\t\\t\\t\\n \\t\\t\\t// add the new package node\\n \\t\\tDefaultPackageNode packagenode = new DependentPackageNode(packagename);\\n \\t\\t\\tmodule.add(packagenode);\\n \\n \\t\\tfor(String classname : dv.getPackages().get(packagename)) {\\n \\t\\t\\t// add class nodes for all packages\\n \\t\\t\\tpackagenode.add(new DependentClassNode(new ClassDependency(classname)));\\n \\t\\t}\\n \\t}\\n \\n \\t// add dependencies\\n \\tfor(String classname : dv.getDependencies().keySet()) {\\n \\t\\tfor(String dep : dv.getDependencies().get(classname).keySet()) {\\n \\t\\t\\t// create ClassDependency\\n \\t\\t\\tClassDependency cd = new ClassDependency(dep);\\n \\t\\t\\t\\n \\t\\t\\tfor(Integer line : dv.getDependencies().get(classname).get(dep)) {\\n \\t\\t\\t\\tcd.addLineNumber(line);\\n \\t\\t\\t}\\n \\n \\t\\t\\tcd.setUnallowedDependency(isUnallowedDependency(classname, dep));\\n \\t\\t\\t\\n \\t\\t\\t// and add it to the ClassNode\\n \\t\\t\\t\\tClassNode cn = result.getClassNode(classname);\\n \\t\\t\\t\\tif (cn != null) {\\n \\t\\t\\t\\t\\tcn.addClassDependency(cd);\\n \\t\\t\\t\\t} else {\\n \\t\\t\\t\\t\\tSystem.out.println(\\\"Class \\\"+classname+\\\" not found (to \\\"+dep+\\\")!\\\");\\n \\t\\t\\t\\t}\\n \\t\\t}\\n \\t}\\n \\n \\tcumulateDependencyViolations(result);\\n \\t\\n \\treturn result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1911eac64148d1dcbf8b006a8fad1b4b\",\n \"score\": \"0.52248025\",\n \"text\": \"private void displayWorkflow(Workflow w) {\\r\\n Graph graph = new Graph(w.getWorkflowName(), Graph.DIGRAPH);\\r\\n nodes.clear();\\r\\n //Create the nodes\\r\\n w.getWorkflowStepList().forEach(step -> {\\r\\n addStep(step, graph);\\r\\n //Now add the links\\r\\n step.getSourceTransitions().forEach(t -> {\\r\\n addStep(t.getWorkflowStepSource(), graph);\\r\\n addStep(t.getWorkflowStepTarget(), graph);\\r\\n Subgraph.Edge edge\\r\\n = graph.addEdge(nodes.get(t.getWorkflowStepSource()\\r\\n .getWorkflowStepPK().getId()),\\r\\n nodes.get(t.getWorkflowStepTarget()\\r\\n .getWorkflowStepPK().getId()));\\r\\n edge.setParam(\\\"label\\\", TRANSLATOR.translate(t.getTransitionName()));\\r\\n //Workaround https://github.com/pontusbostrom/VaadinGraphvizComponent/issues/9\\r\\n edge.setDest(nodes.get(t.getWorkflowStepTarget()\\r\\n .getWorkflowStepPK().getId()));\\r\\n edges.put(TRANSLATOR.translate(t.getTransitionName()),\\r\\n new AbstractMap.SimpleEntry<>(\\r\\n nodes.get(t.getWorkflowStepSource()\\r\\n .getWorkflowStepPK().getId()), edge));\\r\\n });\\r\\n });\\r\\n diagram.drawGraph(graph);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"88fc73a199a284b5e263ebd7c4392919\",\n \"score\": \"0.5219778\",\n \"text\": \"public void printVerteces() {\\n sortVertices();\\n System.out.println(\\\"Adjacent Vertices of every vertex: \\\\n\\\");\\n int i = 0;\\n while (vertexlist[i] != null) {\\n System.out.print(\\\"Vertex \\\" + i + \\\" {\\\" + vertexlist[i].label + \\\"} - VISIT: \\\" + vertexlist[i].wasVisited\\n + \\\" - ADJACENCY: \\\");\\n int numberOfAdj = 0;\\n // we need another loop to find all the verteces that connected to the vertex\\n int j = 0;\\n while (vertexlist[j] != null) {\\n if (adjMat[i][j] != 0) {\\n if (numberOfAdj == 0) {\\n // in this case first adjacent will be printed\\n System.out.print(j);\\n } else {\\n System.out.print(\\\", \\\" + j); // only the first number has no comm before it\\n }\\n numberOfAdj++;\\n }\\n j++;\\n }\\n System.out.println();\\n i++;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bdd3edacd5fdbbb6363841cfb793c59e\",\n \"score\": \"0.5181404\",\n \"text\": \"public static void main(String[] args) {\\n\\n\\t\\t Graph<String> g = new Graph<String>();\\n\\t\\t g.addVertex(\\\"A\\\");\\n\\t\\t g.addVertex(\\\"B\\\");\\n\\t\\t g.addVertex(\\\"C\\\");\\n\\t\\t g.addVertex(\\\"D\\\");\\n\\t\\t g.addVertex(\\\"E\\\");\\n\\t\\t g.addArc(\\\"A\\\", \\\"B\\\", 1);\\n\\t\\t g.addArc(\\\"A\\\", \\\"C\\\", 3);\\n\\t\\t g.addArc(\\\"B\\\", \\\"C\\\", 1);\\n\\t\\t g.addArc(\\\"B\\\", \\\"D\\\", 8);\\n\\t\\t g.addArc(\\\"C\\\", \\\"D\\\", 2);\\n\\t\\t g.addArc(\\\"A\\\", \\\"E\\\", 1);\\n\\t\\t g.addArc(\\\"E\\\", \\\"C\\\", 1);\\n\\t\\t g.addArc(\\\"E\\\", \\\"D\\\", 1);\\n\\t\\t System.out.println(g.countCycles());\\n\\t\\t// System.out.println(g.countCycles(\\\"A\\\"));\\n\\n\\t\\t// Automata automata = new Automata(\\\"q0\\\", false);\\n\\t\\t// automata.addState(\\\"q1\\\", false);\\n\\t\\t// automata.addState(\\\"q2\\\", true);\\n\\t\\t// automata.addState(\\\"q3\\\", false);\\n\\t\\t// automata.addState(\\\"q4\\\", true);\\n\\t\\t// automata.addTransition(\\\"a\\\", \\\"q0\\\", \\\"q1\\\");\\n\\t\\t// automata.addTransition(\\\"b\\\", \\\"q1\\\", \\\"q1\\\");\\n\\t\\t// automata.addTransition(\\\"b\\\", \\\"q1\\\", \\\"q2\\\");\\n\\t\\t// automata.addTransition(\\\"c\\\", \\\"q1\\\", \\\"q3\\\");\\n\\t\\t// automata.addTransition(\\\"a\\\", \\\"q3\\\", \\\"q4\\\");\\n\\t\\t// System.out.println(\\\"estos tienen que ser false\\\");\\n\\t\\t// System.out.println(automata.isAccepted(\\\"a\\\"));\\n\\t\\t// System.out.println(automata.isAccepted(\\\"ad\\\"));\\n\\t\\t// System.out.println(automata.isAccepted(\\\"abbba\\\"));\\n\\t\\t// System.out.println(automata.isAccepted(\\\"abbcab\\\"));\\n\\t\\t// System.out.println(automata.isAccepted(\\\"abbbc\\\"));\\n\\t\\t// System.out.println(\\\"estos tienen que ser true\\\");\\n\\t\\t// System.out.println(automata.isAccepted(\\\"ab\\\"));\\n\\t\\t// System.out.println(automata.isAccepted(\\\"abb\\\"));\\n\\t\\t// System.out.println(automata.isAccepted(\\\"abbbb\\\"));\\n\\t\\t// System.out.println(automata.isAccepted(\\\"abbbca\\\"));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e37f608c6b80d350ad7dda759a140a04\",\n \"score\": \"0.51716024\",\n \"text\": \"public void updateGraph() {\\n\\t\\tgetChildren().addAll(graphFactory.getGraphicalElements());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4da73a8946a30062bd90611da98285d4\",\n \"score\": \"0.51676685\",\n \"text\": \"public void printNodes()\\n {\\n\\t System.out.println(\\\"Nodi del grafo:\\\");\\n\\t\\n\\t for(Object o : nodes)\\n\\t {\\n\\t\\t if(o instanceof Topic)\\n\\t\\t\\t //System.out.println(((Topic)o)+\\\" \\\"+((Topic)o).getLabel()); \\n\\t\\t System.out.println(((Topic)o)); \\n\\t\\t else\\n\\t\\t\\t if(o instanceof Type)\\n\\t\\t\\t\\t System.out.println(((Type)o).toString());\\n\\t }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"539eef364742d2274dc0e11dbdc9f520\",\n \"score\": \"0.5159781\",\n \"text\": \"public static void main(String[] args){\\n int[] mainnodes=new int[]{4,3,1,7,8};\\n GraphAdj g = new GraphAdj(mainnodes);\\n \\n g.addDirecEdge(0,1);\\n g.addDirecEdge(0,2);\\n g.addDirecEdge(1,4);\\n g.addDirecEdge(2,1);\\n g.addDirecEdge(2,4);\\n g.addDirecEdge(3,0);\\n g.addDirecEdge(3,2);\\n g.addDirecEdge(3,4);\\n \\n System.out.println(\\\"Adjacency List\\\");\\n g.print();\\n \\n System.out.println();\\n \\n \\n GraphMat g2 = new GraphMat(mainnodes);\\n \\n g2.addDirecEdge(0,1);\\n g2.addDirecEdge(0,2);\\n g2.addDirecEdge(1,4);\\n g2.addDirecEdge(2,1);\\n g2.addDirecEdge(2,4);\\n g2.addDirecEdge(3,0);\\n g2.addDirecEdge(3,2);\\n g2.addDirecEdge(3,4);\\n \\n System.out.println(\\\"Adjacency Matrix\\\");\\n g2.print();\\n \\n \\n System.out.println();\\n \\n \\n GraphAdj g3 = new GraphAdj(mainnodes);\\n \\n g3.addDirecEdge(0,1);\\n g3.addDirecEdge(0,2);\\n g3.addDirecEdge(1,4);\\n g3.addDirecEdge(2,1);\\n g3.addDirecEdge(2,4);\\n g3.addDirecEdge(3,0);\\n g3.addDirecEdge(3,2);\\n g3.addDirecEdge(3,4);\\n \\n System.out.println();\\n System.out.println(\\\"BFS\\\");\\n System.out.println(g3.BFS(0));\\n System.out.println();\\n \\n \\n GraphAdj g4 = new GraphAdj(6);\\n \\n g4.addDirecEdge(0,1);\\n g4.addDirecEdge(0,3);\\n g4.addDirecEdge(1,4);\\n g4.addDirecEdge(2,4);\\n g4.addDirecEdge(2,5);\\n g4.addDirecEdge(3,1);\\n g4.addDirecEdge(4,3);\\n g4.addDirecEdge(5,5);\\n \\n System.out.println(\\\"DFS\\\");\\n g4.doDFS();\\n \\n \\n //Toological Sort\\n \\n String[] names=new String[]{\\\"Foundation\\\",\\\"Walls\\\",\\\"Plumbing\\\",\\\"Windows\\\",\\\"Roofs\\\",\\\"Decoration\\\"};\\n GraphAdj g5 = new GraphAdj(names);\\n \\n g5.addDirecEdge(0,1);\\n g5.addDirecEdge(1,2);\\n g5.addDirecEdge(1,3);\\n g5.addDirecEdge(1,4);\\n g5.addDirecEdge(2,5);\\n g5.addDirecEdge(3,5);\\n g5.addDirecEdge(4,5);\\n \\n TopoList sorted = g5.TopSort();\\n System.out.println();\\n System.out.println(\\\"Topographical Sort\\\");\\n sorted.print();\\n \\n\\n \\n \\n \\n \\n GraphAdj g6 = new GraphAdj(8);\\n g6.addDirecEdge(0,1);\\n g6.addDirecEdge(1,2);\\n g6.addDirecEdge(1,4);\\n g6.addDirecEdge(1,5);\\n g6.addDirecEdge(2,3);\\n g6.addDirecEdge(2,6);\\n g6.addDirecEdge(3,2);\\n g6.addDirecEdge(3,7);\\n g6.addDirecEdge(4,0);\\n g6.addDirecEdge(4,5);\\n g6.addDirecEdge(5,6);\\n g6.addDirecEdge(6,5);\\n g6.addDirecEdge(6,7);\\n g6.addDirecEdge(7,7);\\n \\n System.out.println();\\n System.out.println(\\\"SCC\\\");\\n \\n SCList res=g6.sepSCC();\\n res.print();\\n \\n \\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebbc852f3dbe6c5519043e8dcb94f070\",\n \"score\": \"0.5155594\",\n \"text\": \"private void displayGraph(String type, boolean selected){\\n\\t\\ttry{\\n\\t\\t\\tif(selected && type.equals(\\\"er\\\"))\\n\\t\\t\\t\\tentityGraphMaker.graphUI.displayGraph();\\n\\t\\t\\tif(selected && type.equals(\\\"dim\\\"))\\n\\t\\t\\t\\tdimensionalGraphMaker.graphUI.displayGraph();\\n\\n\\t\\t}catch(NullPointerException e){\\n\\t\\t\\tSystem.out.println(\\\"DB Graph not yet created\\\");\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"33ef8dda1095ca442d5397190dd83dfa\",\n \"score\": \"0.5155034\",\n \"text\": \"public static void printComponent(JGraph c) {\\n new GraphPrint(c).print();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4eb65b57429aa1655293aeb4396e732b\",\n \"score\": \"0.5145565\",\n \"text\": \"public void printAdjLists()\\n {\\n for(int i = 0; i < n; i++)\\n {\\n System.out.print(\\\"Adj list of vertex \\\" + i + \\\": \\\");\\n Vertex v = adj[i];\\n while(v != null)\\n {\\n if (v.next != null)\\n System.out.print(v.id + \\\"->\\\");\\n else\\n System.out.print(v.id);\\n v = v.next;\\n }\\n System.out.println();\\n }\\n System.out.println();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6265bb11b5837c6d6215608d953c6368\",\n \"score\": \"0.51450044\",\n \"text\": \"public HashMap<String,HashSet<String>> transitiveclosure(){\\n\\t\\tHashMap<String, HashSet<String>> rNodeset = new HashMap<String, HashSet<String>>();\\n\\t\\tfor(String n:this.vertexSet()){\\n\\t\\t\\tHashSet<String> hset = (HashSet<String>) this.bfsreturn(n).keySet();\\n\\t\\t\\trNodeset.put(n, hset);\\n\\t\\t\\tSystem.out.println(n+\\\" reachable nodes number \\\" + rNodeset.get(n).size());\\n\\t\\t}\\n\\t\\treturn rNodeset;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fec7fe06ebd9aa0f150a7fbb016c4bb1\",\n \"score\": \"0.51434195\",\n \"text\": \"public Collection getDeps()\\r\\n/* 72: */ {\\r\\n/* 73: 91 */ return this.deps;\\r\\n/* 74: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7ba6c839725458acdacd77eb0b9c8ce\",\n \"score\": \"0.51310694\",\n \"text\": \"Set<String> getDependencies(Node question);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"290bf8db3ea1e8f1a5b536464b50510b\",\n \"score\": \"0.5126919\",\n \"text\": \"private void _computePortDepth(DirectedAcyclicGraph dependencyGraph) {\\n // local variable to turn on/off debugging messages\\n boolean verbose = false;\\n\\n // The following topologicalSort can be smarter.\\n // In particular, the dependency between ports belonging\\n // to the same actor may be considered.\\n Object[] sort = dependencyGraph.topologicalSort();\\n int numberOfPorts = sort.length;\\n\\n if (_debugging && verbose) {\\n _debug(\\\"## Result of topological sort (highest depth to lowest):\\\");\\n }\\n\\n // Allocate a new hash table with the size equal to the\\n // number of IO ports sorted.\\n _portToDepth = new Hashtable(numberOfPorts);\\n\\n LinkedList ports = new LinkedList();\\n\\n // Assign depths to ports based on the topological sorting result.\\n // Each port is assigned a depth.\\n for (int i = 0; i < numberOfPorts; i++) {\\n IOPort ioPort = (IOPort) sort[i];\\n ports.add(ioPort);\\n int depth = i;\\n Actor portContainer = (Actor) ioPort.getContainer();\\n // The output ports of the composite actor that contains\\n // this director are set to the highest depth\\n // (the lowest priority) and the input ports are given\\n // the highest priorities because they are sources.\\n if (portContainer.equals(getContainer())) {\\n if (ioPort.isOutput()) {\\n depth += numberOfPorts;\\n } else {\\n depth -= numberOfPorts;\\n }\\n }\\n\\n // Insert the hashtable entry.\\n _portToDepth.put(ioPort, Integer.valueOf(depth));\\n if (_debugging && verbose) {\\n _debug(((Nameable) ioPort).getFullName(), \\\"depth: \\\" + depth);\\n }\\n }\\n\\n if (_debugging && verbose) {\\n _debug(\\\"## adjusting port depths based \\\"\\n + \\\"on the strictness constraints.\\\");\\n }\\n\\n LinkedList actorsWithPortDepthsAdjusted = new LinkedList();\\n\\n // Adjust the port depths based on the strictness constraints.\\n // The ruls is that if an output depends on several inputs directly,\\n // all inputs must have the same depth, the biggest one.\\n for (int i = sort.length - 1; i >= 0; i--) {\\n IOPort ioPort = (IOPort) sort[i];\\n // Get the container actor of the current output port.\\n Actor portContainer = (Actor) ioPort.getContainer();\\n // we skip the ports of the container and their depths are handled\\n // by the upper level executive director of this container.\\n if (portContainer.equals(getContainer())) {\\n continue;\\n }\\n // Normally, we adjust port depths based on output ports.\\n // However, if this input port belongs to a sink actor, and\\n // the sink actor has more than one input ports, adjust the depths\\n // of all the input ports to their maximum value.\\n // For exmaple, the XYPlotter in the WirelessSoundDetection demo.\\n // By default, all composite actors are non-strict. However, if\\n // a composite actor declares its strictness with an attribute,\\n // we adjust its input ports depths to their maximum. One example\\n // is the ModalModel.\\n // A third case is that if a composite actor has some of its input\\n // ports as parameter ports and the others as reguler IO ports,\\n // we need to adjust the depths of paramter ports also.\\n // The TimedSinewave (with SDF implementation) is an example.\\n // Since this actor is supposed to be a strict actor, we need to\\n // add a strictness marker such that the depths of all its inputs\\n // are adjusted to their maximum value.\\n // For non-strict composite actors, one solution is to iterate\\n // each output port and find all the parameter ports that affect\\n // that output port. Note that a parameter may depend on another\\n // parameter at the same level of hierarchy, which makes the\\n // analysis harder. One reference will be the context analysis by\\n // Steve.\\n // I prefer to leave the parameter analysis to be independent of the\\n // function dependency analysis. 02/2005 hyzheng\\n\\n // Find the set of the ports that need depths adjusted.\\n List inputPorts;\\n if (ioPort.isInput()) {\\n boolean depthNeedsAdjusted = false;\\n int numberOfOutputPorts = portContainer.outputPortList().size();\\n // If an actor has no output ports, adjustment is necessary.\\n if (numberOfOutputPorts == 0) {\\n depthNeedsAdjusted = true;\\n }\\n // If the actor declares itself as a strict actor,\\n // adjustment is necessary.\\n if (portContainer.isStrict()) {\\n depthNeedsAdjusted = true;\\n }\\n if (depthNeedsAdjusted) {\\n // If depth needs adjusted:\\n inputPorts = portContainer.inputPortList();\\n if (inputPorts.size() <= 1) {\\n // If the sink actor has only one input port, there is\\n // no need to adjust its depth.\\n continue;\\n }\\n // If the depths of the input ports of this acotr\\n // have been adjusted, skip it. Otherwise, add it into the\\n // list actorsWithPortDepthsAdjusted.\\n if (actorsWithPortDepthsAdjusted.contains(portContainer)) {\\n continue;\\n } else {\\n actorsWithPortDepthsAdjusted.add(portContainer);\\n }\\n } else {\\n continue;\\n }\\n } else {\\n // The ioPort is an output port.\\n // Get the function dependency of the container actor\\n FunctionDependency functionDependency = portContainer\\n .getFunctionDependency();\\n inputPorts = functionDependency\\n .getInputPortsDependentOn(ioPort);\\n }\\n // Iterate all input ports the current output depends on,\\n // find their maximum depth.\\n Iterator inputsIterator = inputPorts.iterator();\\n int maximumPortDepth = -1;\\n while (inputsIterator.hasNext()) {\\n Object object = inputsIterator.next();\\n IOPort input = (IOPort) object;\\n int inputPortDepth = ports.indexOf(input);\\n if (maximumPortDepth < inputPortDepth) {\\n maximumPortDepth = inputPortDepth;\\n }\\n }\\n // Set the depths of the input ports to the maximum one.\\n inputsIterator = inputPorts.iterator();\\n while (inputsIterator.hasNext()) {\\n IOPort input = (IOPort) inputsIterator.next();\\n if (_debugging && verbose) {\\n _debug(((Nameable) input).getFullName(),\\n \\\"depth is adjusted to: \\\" + maximumPortDepth);\\n }\\n // Insert the port the hashtable entry.\\n _portToDepth.put(input, Integer.valueOf(maximumPortDepth));\\n }\\n }\\n if (_debugging) {\\n _debug(\\\"## End of topological sort of ports.\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f9a0d201706d9be536f7b7865863c5c2\",\n \"score\": \"0.5122656\",\n \"text\": \"public static void dfsPrintTrace(Graph g) {\\n\\t\\tboolean [] marked = new boolean[g.V()];\\n\\t dfsPrintTrace(g, 0, marked, 0);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87c3edfeedf543a897cc80214a1a5614\",\n \"score\": \"0.5121842\",\n \"text\": \"public String prettyPrint(InclusionDependency ind) {\\n StringBuffer sb = new StringBuffer();\\n IdUtils idUtils = this.metadataStore.getIdUtils();\\n int depSchemaId = idUtils.getSchemaId(ind.getTargetReference().getDependentColumns()[0]);\\n Schema depSchema = this.metadataStore.getSchemaById(depSchemaId);\\n int depTableId = idUtils.getTableId(ind.getTargetReference().getDependentColumns()[0]);\\n Table depTable = depSchema.getTableById(depTableId);\\n sb.append(depTable.getName()).append(\\\"[\\\");\\n String separator = \\\"\\\";\\n for (int columnId : ind.getTargetReference().getDependentColumns()) {\\n sb.append(separator).append(depTable.getColumnById(columnId).getName());\\n separator = \\\", \\\";\\n }\\n sb.append(\\\"] < \\\");\\n int refSchemaId = idUtils.getSchemaId(ind.getTargetReference().getReferencedColumns()[0]);\\n Schema refSchema = this.metadataStore.getSchemaById(refSchemaId);\\n int refTableId = idUtils.getTableId(ind.getTargetReference().getReferencedColumns()[0]);\\n Table refTable = refSchema.getTableById(refTableId);\\n sb.append(refTable.getName()).append(\\\"[\\\");\\n separator = \\\"\\\";\\n for (int columnId : ind.getTargetReference().getReferencedColumns()) {\\n sb.append(separator).append(refTable.getColumnById(columnId).getName());\\n separator = \\\", \\\";\\n }\\n sb.append(\\\"]\\\");\\n return sb.toString();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5fcf1f2b0e2c9893ebf66a1b814fede\",\n \"score\": \"0.51203895\",\n \"text\": \"private void showGraph()\\n {\\n container.getChildren().remove(1);\\n container.getChildren().add(barchart);\\n container.setVgrow(barchart, Priority.ALWAYS);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"219ffc8f3e78a0f6b8e268b3bf0fa8ad\",\n \"score\": \"0.51203525\",\n \"text\": \"public void addEdges() {\\n\\n // subCoord == subject coordinate\\n // depCoord == dependency coordinate\\n int subCoord = 0;\\n int depCoord = 0;\\n String subject, dependency;\\n\\n // arrPos == array position\\n // for each entry, do\\n for (int arrPos = 0; arrPos < subjectGraph.length; arrPos++) {\\n\\n subject = subjectGraph[arrPos].get(0);\\n\\n // depNum == dependency number\\n // for each dependency, do\\n for (int depNum = 1; depNum < subjectGraph[arrPos].size(); depNum++) {\\n\\n dependency = subjectGraph[arrPos].get(depNum);\\n\\n // subInd == subject index\\n // get subject's and its dependency position in the subject list\\n for (int subInd = 0; subInd < subjectIndex.size(); subInd++) {\\n\\n if (subject.compareTo(subjectIndex.get(subInd)) == 0) {\\n\\n subCoord = subInd;\\n\\n } else if (dependency.compareTo(subjectIndex.get(subInd)) == 0) {\\n\\n depCoord = subInd;\\n\\n }\\n }\\n\\n vertices[subCoord][depCoord] = 1;\\n\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"012d5320fb512312406cebd4b66b4426\",\n \"score\": \"0.51179373\",\n \"text\": \"public abstract List<Dependants> getAllDependants();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd63bab1ead3d34a5b8872776d1a82b2\",\n \"score\": \"0.51152086\",\n \"text\": \"protected void showList() {\\n for (int i = 0; i < visited.size(); i++) {\\n System.err.print(visited.get(i).getId() + \\\"\\\\t\\\");\\n System.err.println(visited.get(i).getLabel());\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bcb62940d901e750c47239ba133b8d2c\",\n \"score\": \"0.51112336\",\n \"text\": \"@Override\\n public String toString() {\\n return String.format(\\\"%s\\\", this.dep);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a0249d79aad0bfd3f01fc8390cf50e6\",\n \"score\": \"0.5107522\",\n \"text\": \"public static DependencyGraph getTransitiveDependencies(Artifact artifact)\\n throws DependencyCollectionException, DependencyResolutionException {\\n \\n // root node\\n DependencyNode node = resolveCompileTimeDependencies(artifact); \\n DependencyGraph graph = new DependencyGraph();\\n preorder(new Stack<>(), node, graph);\\n \\n return graph;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82bd602762866c16318cf8c977f3a0e8\",\n \"score\": \"0.5100805\",\n \"text\": \"public static void main(String[] args) {\\n\\t\\tGraph g = new Graph();\\n\\t\\tfor(int i = 0; i <= 5; i++) {\\n\\t\\t\\tg.addKnoten();\\n\\t\\t}\\n\\t\\t\\n\\t\\tg.addKante(1,3,10);\\n\\t\\tg.addKante(2,1,1);\\n\\t\\tg.addKante(2,4,7);\\n\\t\\tg.addKante(3,1,3);\\n\\t\\tg.addKante(3,2,4);\\n\\t\\tg.addKante(3,4,2);\\n\\t\\tg.addKante(5,3,1);\\n\\t\\tg.addKante(5,4,2);\\n\\t\\t\\n\\t\\tSystem.out.println(g);\\n\\t\\t\\n\\t\\tint[] vorg = g.tiefensuche(2);\\n\\t\\tfor(int i = 0; i < vorg.length; i++) {\\n\\t\\t\\tSystem.out.println((i) + \\\" \\\" + vorg[i]);\\n\\t\\t}\\n\\t\\t\\n\\t\\tvorg = g.breitensuche(2);\\n\\t\\tfor(int i = 0; i < vorg.length; i++) {\\n\\t\\t\\tSystem.out.println((i) + \\\" \\\" + vorg[i]);\\n\\t\\t}\\n\\t\\t\\n\\t\\tGraph g2 = new Graph(7);\\n\\t\\tg2.addUngerichteteKante(1,2,10);\\n\\t\\tg2.addUngerichteteKante(1,4,9);\\n\\t\\tg2.addUngerichteteKante(2,3,5);\\n\\t\\tg2.addUngerichteteKante(2,5,4);\\n\\t\\tg2.addUngerichteteKante(2,4,3);\\n\\t\\tg2.addUngerichteteKante(3,5,10);\\n\\t\\tg2.addUngerichteteKante(4,5,8);\\n\\t\\tg2.addUngerichteteKante(4,6,6);\\n\\t\\tg2.addUngerichteteKante(5,6,2);\\n\\t\\tg2.addUngerichteteKante(5,7,7);\\n\\t\\tg2.addUngerichteteKante(6,7,11);\\n\\t\\tGraph minSpanTree = g2.kruskal();\\n\\t\\tSystem.out.println(minSpanTree);\\n\\t\\t\\n\\t\\tGraph g3 = new Graph(8);\\n\\t\\tg3.addUngerichteteKante(1,2,3);\\n\\t\\tg3.addUngerichteteKante(1,3,45);\\n\\t\\tg3.addUngerichteteKante(2,3,28);\\n\\t\\tg3.addUngerichteteKante(2,4,26);\\n\\t\\tg3.addUngerichteteKante(3,8,25);\\n\\t\\tg3.addUngerichteteKante(3,5,16);\\n\\t\\tg3.addUngerichteteKante(4,5,7);\\n\\t\\tg3.addUngerichteteKante(4,6,21);\\n\\t\\tg3.addUngerichteteKante(5,7,27);\\n\\t\\tg3.addUngerichteteKante(6,7,14);\\n\\t\\tg3.addUngerichteteKante(7,8,5);\\n\\t\\t\\n\\t\\tint[] vor = g3.dijkstra(1);\\n\\t\\tfor(int i = 0; i < vor.length; i++) {\\n\\t\\t\\tSystem.out.println(i + \\\" : \\\" + vor[i]);\\n\\t\\t}\\n\\t\\t\\n\\t\\tint[][] floyd = g3.floyd_warshall();\\n\\t\\tfor(int i = 1; i < floyd.length; i++) {\\n\\t\\t\\tfor(int j = 1; j < floyd.length; j++) {\\n\\t\\t\\t\\tSystem.out.print(floyd[i][j] + \\\" \\\");\\n\\t\\t\\t}\\n\\t\\t\\tSystem.out.println();\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4169cde3766f822498d516dbd8cfb0b0\",\n \"score\": \"0.5099115\",\n \"text\": \"public void printGraph() {\\n System.out.println(\\\"The graph has \\\" + n + \\\" vertices.\\\");\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < n; j++) {\\n if (edges[i][j])\\n System.out.print(1 + \\\" \\\");\\n if (!edges[i][j])\\n System.out.print(0 + \\\" \\\");\\n if (j == (n - 1)) System.out.println();\\n\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e82b694b12d7275fd84374454f8a87c1\",\n \"score\": \"0.50914276\",\n \"text\": \"Set<String> getRequiredDependencies();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54c56870731ad8613e384e2b03472189\",\n \"score\": \"0.5090526\",\n \"text\": \"public interface Graph {\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54c56870731ad8613e384e2b03472189\",\n \"score\": \"0.5090526\",\n \"text\": \"public interface Graph {\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983786,"cells":{"query_id":{"kind":"string","value":"d37be5f4369bfeca94a5379e97847099"},"query":{"kind":"string","value":"optional .CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData custom_game_data = 35;"},"positive_passages":{"kind":"list like","value":[{"docid":"53ac847606c8ac1a5b6eabe72184705a","score":"0.5598239","text":"public boolean hasCustomGameData() {\n return ((bitField0_ & 0x10000000) == 0x10000000);\n }","title":""}],"string":"[\n {\n \"docid\": \"53ac847606c8ac1a5b6eabe72184705a\",\n \"score\": \"0.5598239\",\n \"text\": \"public boolean hasCustomGameData() {\\n return ((bitField0_ & 0x10000000) == 0x10000000);\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"b906a705d8a420e96604dc697de0c824","score":"0.92373806","text":"DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData getCustomGameData();","title":""},{"docid":"6e5ef9a56bba1ced203aef79a9fce18a","score":"0.895631","text":"DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData getCustomGameData();","title":""},{"docid":"fef87fb6f7a83bfda671e2428274e5d1","score":"0.8772675","text":"DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameDataOrBuilder getCustomGameDataOrBuilder();","title":""},{"docid":"3b576d811b978bf177388cb175760666","score":"0.8624269","text":"DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameDataOrBuilder getCustomGameDataOrBuilder();","title":""},{"docid":"30d4bd0ebcd43852e86988f4b7440f72","score":"0.7958039","text":"public DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameDataOrBuilder getCustomGameDataOrBuilder() {\n return customGameData_ == null ? DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.getDefaultInstance() : customGameData_;\n }","title":""},{"docid":"caa0552de80a99cb94c91baed92c3a49","score":"0.7947443","text":"public Builder setCustomGameData(DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData value) {\n if (customGameDataBuilder_ == null) {\n if (value == null) {\n throw new NullPointerException();\n }\n customGameData_ = value;\n onChanged();\n } else {\n customGameDataBuilder_.setMessage(value);\n }\n bitField1_ |= 0x00000008;\n return this;\n }","title":""},{"docid":"166dc214bc4ead85259c75bdb9a2c448","score":"0.7946721","text":"public DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameDataOrBuilder getCustomGameDataOrBuilder() {\n if (customGameDataBuilder_ != null) {\n return customGameDataBuilder_.getMessageOrBuilder();\n } else {\n return customGameData_ == null ?\n DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.getDefaultInstance() : customGameData_;\n }\n }","title":""},{"docid":"3c90fc1f000b5e104be3137ae9f68c4d","score":"0.7898464","text":"public DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData getCustomGameData() {\n if (customGameDataBuilder_ == null) {\n return customGameData_ == null ? DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.getDefaultInstance() : customGameData_;\n } else {\n return customGameDataBuilder_.getMessage();\n }\n }","title":""},{"docid":"fe35950786d23e4edefc57ec652cc02a","score":"0.7750593","text":"public DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData getCustomGameData() {\n return customGameData_ == null ? DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.getDefaultInstance() : customGameData_;\n }","title":""},{"docid":"f61e992f3e7a6a86864bdc8af4aa8878","score":"0.7654383","text":"public Builder setCustomGameData(DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData value) {\n if (customGameDataBuilder_ == null) {\n if (value == null) {\n throw new NullPointerException();\n }\n customGameData_ = value;\n onChanged();\n } else {\n customGameDataBuilder_.setMessage(value);\n }\n bitField0_ |= 0x80000000;\n return this;\n }","title":""},{"docid":"bcb13d0ad626f7b0fe8a93c0452de5c7","score":"0.7651595","text":"public DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameDataOrBuilder getCustomGameDataOrBuilder() {\n return customGameData_ == null ? DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.getDefaultInstance() : customGameData_;\n }","title":""},{"docid":"2ec35b6ebb472540623f6b8ee7ed6a2b","score":"0.7610598","text":"public DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameDataOrBuilder getCustomGameDataOrBuilder() {\n if (customGameDataBuilder_ != null) {\n return customGameDataBuilder_.getMessageOrBuilder();\n } else {\n return customGameData_ == null ?\n DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.getDefaultInstance() : customGameData_;\n }\n }","title":""},{"docid":"7dc0ec0607356fee2662a3f3e529aae3","score":"0.7605351","text":"public DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData getCustomGameData() {\n if (customGameDataBuilder_ == null) {\n return customGameData_ == null ? DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.getDefaultInstance() : customGameData_;\n } else {\n return customGameDataBuilder_.getMessage();\n }\n }","title":""},{"docid":"ada1778d85ce8f90bf5811c654c775a6","score":"0.7441946","text":"public DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData getCustomGameData() {\n return customGameData_ == null ? DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.getDefaultInstance() : customGameData_;\n }","title":""},{"docid":"c123492e68f300a635b3df60c857ddd6","score":"0.7052848","text":"public Builder mergeCustomGameData(DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData value) {\n if (customGameDataBuilder_ == null) {\n if (((bitField1_ & 0x00000008) == 0x00000008) &&\n customGameData_ != null &&\n customGameData_ != DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.getDefaultInstance()) {\n customGameData_ =\n DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.newBuilder(customGameData_).mergeFrom(value).buildPartial();\n } else {\n customGameData_ = value;\n }\n onChanged();\n } else {\n customGameDataBuilder_.mergeFrom(value);\n }\n bitField1_ |= 0x00000008;\n return this;\n }","title":""},{"docid":"ac997d1efcdd09fa0ccf6adb5250bf89","score":"0.6701431","text":"public Builder setCustomGameData(\n DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.Builder builderForValue) {\n if (customGameDataBuilder_ == null) {\n customGameData_ = builderForValue.build();\n onChanged();\n } else {\n customGameDataBuilder_.setMessage(builderForValue.build());\n }\n bitField1_ |= 0x00000008;\n return this;\n }","title":""},{"docid":"3742d547f8a3b4881905ae4db3a16af9","score":"0.6528706","text":"public DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.Builder getCustomGameDataBuilder() {\n bitField1_ |= 0x00000008;\n onChanged();\n return getCustomGameDataFieldBuilder().getBuilder();\n }","title":""},{"docid":"cf999ea9605f2044c4c9a3861ff10bb2","score":"0.6528206","text":"public Builder mergeCustomGameData(DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData value) {\n if (customGameDataBuilder_ == null) {\n if (((bitField0_ & 0x80000000) == 0x80000000) &&\n customGameData_ != null &&\n customGameData_ != DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.getDefaultInstance()) {\n customGameData_ =\n DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.newBuilder(customGameData_).mergeFrom(value).buildPartial();\n } else {\n customGameData_ = value;\n }\n onChanged();\n } else {\n customGameDataBuilder_.mergeFrom(value);\n }\n bitField0_ |= 0x80000000;\n return this;\n }","title":""},{"docid":"cebdb627f15c4145cc443e864e0e076d","score":"0.64180994","text":"public DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.Builder getCustomGameDataBuilder() {\n bitField0_ |= 0x80000000;\n onChanged();\n return getCustomGameDataFieldBuilder().getBuilder();\n }","title":""},{"docid":"3a017261634c9d983ddb5ffaf6d40f13","score":"0.63737065","text":"DotaGcmessagesServer.CMsgGameServerInfo.CustomGames getAllowCustomGames();","title":""},{"docid":"e500e10416f4e79d1035eeef3b73d2c1","score":"0.6293375","text":"public Builder setCustomGameData(\n DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.Builder builderForValue) {\n if (customGameDataBuilder_ == null) {\n customGameData_ = builderForValue.build();\n onChanged();\n } else {\n customGameDataBuilder_.setMessage(builderForValue.build());\n }\n bitField0_ |= 0x80000000;\n return this;\n }","title":""},{"docid":"457de3c6755b14f22a1baaad701a966a","score":"0.5989643","text":"private com.google.protobuf.SingleFieldBuilderV3<\n DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData, DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.Builder, DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameDataOrBuilder> \n getCustomGameDataFieldBuilder() {\n if (customGameDataBuilder_ == null) {\n customGameDataBuilder_ = new com.google.protobuf.SingleFieldBuilderV3<\n DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData, DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.Builder, DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameDataOrBuilder>(\n getCustomGameData(),\n getParentForChildren(),\n isClean());\n customGameData_ = null;\n }\n return customGameDataBuilder_;\n }","title":""},{"docid":"df40c0c5345ed856527a54488dac6e13","score":"0.5985041","text":"private com.google.protobuf.SingleFieldBuilderV3<\n DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData, DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.Builder, DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameDataOrBuilder> \n getCustomGameDataFieldBuilder() {\n if (customGameDataBuilder_ == null) {\n customGameDataBuilder_ = new com.google.protobuf.SingleFieldBuilderV3<\n DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData, DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.Builder, DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameDataOrBuilder>(\n getCustomGameData(),\n getParentForChildren(),\n isClean());\n customGameData_ = null;\n }\n return customGameDataBuilder_;\n }","title":""},{"docid":"5ed6a96773a575bdcf7c6e63de5d676f","score":"0.59581846","text":"public long getCustomGameId() {\n return customGameId_;\n }","title":""},{"docid":"64961cfbaf88a0bd44bbb61ce06aae09","score":"0.59508055","text":"public long getCustomGameId() {\n return customGameId_;\n }","title":""},{"docid":"65717ce0c5605db66bdf6f627f85ae00","score":"0.5730324","text":"DotaGcmessagesServer.CMsgGameServerSaveGameResult.Result getResult();","title":""},{"docid":"4f71ad41151d756eb51d7dd69aa00120","score":"0.57067454","text":"private CMsgGameMatchSignOut(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\n super(builder);\n }","title":""},{"docid":"487c3499f0810ee364c9fdd21c197259","score":"0.5677838","text":"DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer getPlayers(int index);","title":""},{"docid":"8277d5b70dc11d53a0f8533f7bf5932b","score":"0.5670033","text":"public boolean hasCustomGameData() {\n return ((bitField0_ & 0x04000000) == 0x04000000);\n }","title":""},{"docid":"71df7e59dc16897a56011d57a41c903e","score":"0.56635773","text":"public Builder clearCustomGameData() {\n if (customGameDataBuilder_ == null) {\n customGameData_ = null;\n onChanged();\n } else {\n customGameDataBuilder_.clear();\n }\n bitField0_ = (bitField0_ & ~0x80000000);\n return this;\n }","title":""},{"docid":"cd7b0e75a0b6a58d1009e9fc6b4f73a7","score":"0.5611093","text":"private CMsgGameMatchSignoutResponse(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\n super(builder);\n }","title":""},{"docid":"b0bb1f420381d18f8bace38be94071cc","score":"0.55945414","text":"public Builder clearCustomGameId() {\n bitField0_ = (bitField0_ & ~0x00000010);\n customGameId_ = 0L;\n onChanged();\n return this;\n }","title":""},{"docid":"8396e9e35456749e62dba2ae9362f85c","score":"0.55828583","text":"public DotaGcmessagesServer.CMsgGameServerInfo.CustomGames getAllowCustomGames() {\n DotaGcmessagesServer.CMsgGameServerInfo.CustomGames result = DotaGcmessagesServer.CMsgGameServerInfo.CustomGames.valueOf(allowCustomGames_);\n return result == null ? DotaGcmessagesServer.CMsgGameServerInfo.CustomGames.BOTH : result;\n }","title":""},{"docid":"b685e7b31966e79e6f1b7109b44afab2","score":"0.5578113","text":"long getCustomGameId();","title":""},{"docid":"e1acc954e47de04b7b3ea45de4587b50","score":"0.5567807","text":"public boolean hasCustomGameData() {\n return ((bitField0_ & 0x80000000) == 0x80000000);\n }","title":""},{"docid":"ff89451116dedc459d5ecc09af8fd5a8","score":"0.5566863","text":"DotaGcmessagesServer.CMsgGameMatchSignoutResponse.CAdditionalSignoutMsg getAdditionalMsgs(int index);","title":""},{"docid":"431897a1dc2ced87425ea1162102d4ab","score":"0.5560262","text":"public DotaGcmessagesServer.CMsgGameServerInfo.CustomGames getAllowCustomGames() {\n DotaGcmessagesServer.CMsgGameServerInfo.CustomGames result = DotaGcmessagesServer.CMsgGameServerInfo.CustomGames.valueOf(allowCustomGames_);\n return result == null ? DotaGcmessagesServer.CMsgGameServerInfo.CustomGames.BOTH : result;\n }","title":""},{"docid":"3d15d21f30cb37cedc4260175543f0cc","score":"0.55426264","text":"public Builder clearCustomGameData() {\n if (customGameDataBuilder_ == null) {\n customGameData_ = null;\n onChanged();\n } else {\n customGameDataBuilder_.clear();\n }\n bitField1_ = (bitField1_ & ~0x00000008);\n return this;\n }","title":""},{"docid":"9001606e9cf283d6979e750878679711","score":"0.548966","text":"public boolean hasCustomGameData() {\n return ((bitField1_ & 0x00000008) == 0x00000008);\n }","title":""},{"docid":"41529f8f3869cd83bba84705a07a4aff","score":"0.5443262","text":"DotaGcmessagesServer.CMsgGameMatchSignOut.CAdditionalSignoutMsg getAdditionalMsgs(int index);","title":""},{"docid":"42bd6bfbc217a1bb20d8e31bb0da9205","score":"0.5434564","text":"DotaGcmessagesServer.CMsgSignOutUpdatePlayerChallenge.Challenge getCompleted(int index);","title":""},{"docid":"4304563f46d997c5a26a11d8fee0132c","score":"0.54272944","text":"@Override\n\tpublic void onGameCancelled(Game game) {\n\t\t\n\t}","title":""},{"docid":"474fc8e87f1b6b0819c1940b5863f01d","score":"0.54137707","text":"public boolean hasCustomGameId() {\n return ((bitField0_ & 0x00000010) == 0x00000010);\n }","title":""},{"docid":"32f9193dd9ab8cbcb2c6acdffb1d87e9","score":"0.5412381","text":"DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam getTeams(int index);","title":""},{"docid":"70aec9d07ebdc331e2ac3f0175153f5c","score":"0.5410974","text":"public boolean hasCustomGameId() {\n return ((bitField0_ & 0x00000010) == 0x00000010);\n }","title":""},{"docid":"b8f262a7fbefb3aa570b146acfd7e851","score":"0.5310824","text":"private CCustomGameData(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\n super(builder);\n }","title":""},{"docid":"26b9be0d9f61bc6eb35ba91155a0b4b1","score":"0.5287965","text":"com.google.protobuf.ByteString getSaveGameData();","title":""},{"docid":"26b9be0d9f61bc6eb35ba91155a0b4b1","score":"0.5287965","text":"com.google.protobuf.ByteString getSaveGameData();","title":""},{"docid":"7e4f722f369660fd17a3a1e2bafd4ad3","score":"0.52336204","text":"public Builder setCustomGameId(long value) {\n bitField0_ |= 0x00000010;\n customGameId_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"4149135f2b802a2073244bfcc947aed5","score":"0.5225814","text":"private void clearGameID() {\n bitField0_ = (bitField0_ & ~0x00000002);\n gameID_ = getDefaultInstance().getGameID();\n }","title":""},{"docid":"4352ef02be3d93007c893ee0cee0a95c","score":"0.52133626","text":"DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayerOrBuilder getPlayersOrBuilder(\n int index);","title":""},{"docid":"f883206f99cdd63fcd5b1a91dcc43eb9","score":"0.5198591","text":"private CCustomGameData(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\n super(builder);\n }","title":""},{"docid":"4233d9361f6dcdb22532b290168842e4","score":"0.5194446","text":"public abstract void lostGame(Game game, String secretcode);","title":""},{"docid":"6430ca38dd039be623c2a0629803cae3","score":"0.5186139","text":"boolean hasCustomGameData();","title":""},{"docid":"6430ca38dd039be623c2a0629803cae3","score":"0.5186139","text":"boolean hasCustomGameData();","title":""},{"docid":"18343270ed79c23aa769157e7acccef4","score":"0.5160001","text":"DotaGcmessagesServer.CMsgSignOutUpdatePlayerChallenge.Challenge getRerolled(int index);","title":""},{"docid":"7f9ec05196bfe0e37119bd7411be6373","score":"0.51221395","text":"public GameFinishedMessage(\n boolean win,\n int yourTeamPoints,\n int otherTeamPoints,\n Map<String, Integer> newEloPerUsername) {\n super();\n this.win = win;\n this.yourTeamPoints = yourTeamPoints;\n this.otherTeamPoints = otherTeamPoints;\n this.newEloPerUsername = newEloPerUsername;\n }","title":""},{"docid":"99330fae98d44209d4834d9c35168f30","score":"0.5115196","text":"public CompressibleData getGameUserData() {\r\n return gameUserData==null?null:gameUserData.data;\r\n }","title":""},{"docid":"3177d723e322bf5441ce58adfc20f0dd","score":"0.51135725","text":"grpc.client.AppOuterClass.AppOrBuilder getGameOrBuilder();","title":""},{"docid":"2f2cb4d213bf536bff719a024b3e5026","score":"0.51097","text":"DotaGcmessagesServer.CMsgDOTALiveScoreboardUpdate.Team getTeamGood();","title":""},{"docid":"65a53b8eea1a7e25139ae347229f3111","score":"0.5106066","text":"public void endGame() {\n if (network != null) {\n Message m = new Message();\n m.eventType = Constants.M_GAME_OVER;\n m.PlayerID = prev_player;\n network.sendToAllDevices(m, new SalutCallback() {\n @Override\n public void call() {\n\n }\n });\n }\n\n bridge.sendDataToView(Constants.M_GAME_OVER, prev_player);\n\n }","title":""},{"docid":"1d46a1db132002f62bed743fb8e8d599","score":"0.51035595","text":"public void cancelGame() {\n client.send(\"Cancel&\" + game.getId() + \"&\" + game.getName());\n }","title":""},{"docid":"3c5f6b855791764bdbccac236c23a88d","score":"0.5087403","text":"void sendEndGameInfo(boolean isWin);","title":""},{"docid":"35f5babd9dfd846034b81fa057b9ba00","score":"0.5078222","text":"protocol.Protocol.GameOrBuilder getGameOrBuilder();","title":""},{"docid":"00801e62c0b0f928b7b5924abe4cf86b","score":"0.50645703","text":"private MessageEmbed buildRandomGameEmbed(Application game, int commonGames, ArrayList<User> noGames, ArrayList<User> users, String footer) {\n AppInfo appInfo = game.getAppInfo();\n return new EmbedBuilder()\n .setTitle(\"Steam Random | \" + appInfo.getSummary(), appInfo.getStoreUrl())\n .setThumbnail(SteamStore.STEAM_LOGO)\n .setImage(game.getThumbnail())\n .setDescription(buildDescription(game, commonGames, noGames, users))\n .setColor(EmbedHelper.BLUE)\n .addField(\"Concurrent Players\", game.formatConcurrentPlayers(), true)\n .setFooter(footer)\n .build();\n }","title":""},{"docid":"b30d0b2b036ac7231ddeb66ab52a9403","score":"0.50519323","text":"@Override\n\tpublic void onGameExit() {\n\n\t}","title":""},{"docid":"e4976bd5348b4c278bbfd8122095ff90","score":"0.5045119","text":"DotaGcmessagesServer.CMsgDOTALiveScoreboardUpdate.Team getTeamBad();","title":""},{"docid":"7426757b4a3a53317b0484d734f031f2","score":"0.50389224","text":"public Builder clearAllowCustomGames() {\n bitField0_ = (bitField0_ & ~0x00400000);\n allowCustomGames_ = 0;\n onChanged();\n return this;\n }","title":""},{"docid":"3eea60eb9b2c2cbb43caec3ac57834bd","score":"0.5038336","text":"public boolean hasAllowCustomGames() {\n return ((bitField0_ & 0x00400000) == 0x00400000);\n }","title":""},{"docid":"c400d7d26b76786793f8f24e25018f5a","score":"0.50364137","text":"@Override\n\tpublic void exitGame(GamePlayerInterface player) {\n\n\t}","title":""},{"docid":"7f70a65d857e1d7fbf0b63d8a293defc","score":"0.50126463","text":"public boolean hasAllowCustomGames() {\n return ((bitField0_ & 0x00400000) == 0x00400000);\n }","title":""},{"docid":"c18d9751fbdc12e9d8b5dafdae91f6d0","score":"0.49926707","text":"private CMsgGameMatchSignOutPermissionResponse(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\n super(builder);\n }","title":""},{"docid":"b6358d3fa3fea0f91be2080e39a6701c","score":"0.49888328","text":"public com.google.protobuf.ByteString getSaveGameData() {\n return saveGameData_;\n }","title":""},{"docid":"b6358d3fa3fea0f91be2080e39a6701c","score":"0.49884704","text":"public com.google.protobuf.ByteString getSaveGameData() {\n return saveGameData_;\n }","title":""},{"docid":"b767905aa16b20194df0a116d41a78b9","score":"0.49789673","text":"java.util.List<? extends DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayerOrBuilder> \n getPlayersOrBuilderList();","title":""},{"docid":"a4bcf2cfad23273ed9872b317bef5c4a","score":"0.49708518","text":"private void quitGame() {\n\t\tLog.d(TAG, \"quitGame\");\n\t\t// Send message to competitor.\n\t\tbyte[] data = ProtocolEncoder.encodeQuitGame();\n\t\tsendMessageToAllCompetitor(data);\n\t\tfinish();\n\t}","title":""},{"docid":"4a2dfa7ed49bba5db78edc104c431fb3","score":"0.49573126","text":"@Override\r\n\tprotected void netvsRecvEndGameStats(String[] message) {\r\n\t\tint seatID = Integer.parseInt(message[2]);\r\n\t\tint playerID = netvsGetPlayerIDbySeatID(seatID);\r\n\r\n\t\tif((playerID != 0) || (netvsIsWatch())) {\r\n\t\t\tGameEngine engine = owner.engine[playerID];\r\n\r\n\t\t\tfloat tempGarbageSend = Float.parseFloat(message[5]);\r\n\t\t\tgarbageSent[playerID] = (int)(tempGarbageSend * GARBAGE_DENOMINATOR);\r\n\r\n\t\t\tplayerAPL[playerID] = Float.parseFloat(message[6]);\r\n\t\t\tplayerAPM[playerID] = Float.parseFloat(message[7]);\r\n\t\t\tengine.statistics.lines = Integer.parseInt(message[8]);\r\n\t\t\tengine.statistics.lpm = Float.parseFloat(message[9]);\r\n\t\t\tengine.statistics.totalPieceLocked = Integer.parseInt(message[10]);\r\n\t\t\tengine.statistics.pps = Float.parseFloat(message[11]);\r\n\t\t\tengine.statistics.time = Integer.parseInt(message[12]);\r\n\r\n\t\t\tnetvsPlayerResultReceived[playerID] = true;\r\n\t\t}\r\n\t}","title":""},{"docid":"493f196249b4ff333b560757155ddeae","score":"0.49544057","text":"DotaGcmessagesServer.CMsgSignOutCommunicationSummary.PlayerCommunication getPlayers(int index);","title":""},{"docid":"8860be5c9a845cdbf08a08ebdb65d846","score":"0.493535","text":"private CMsgSignOutUpdatePlayerChallenge(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\n super(builder);\n }","title":""},{"docid":"c70a178ec09f6dc67f2d2b3e7739ca57","score":"0.49199423","text":"java.util.List<DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer> \n getPlayersList();","title":""},{"docid":"c21cd0637337e7b206673ec3528b81f2","score":"0.49160025","text":"@Override\n\tpublic void exitGame() {\n\n\t}","title":""},{"docid":"41adb3a868d220457809f5a7991d7289","score":"0.49159002","text":"private void setGameIDBytes(\n com.google.protobuf.ByteString value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000002;\n gameID_ = value.toStringUtf8();\n }","title":""},{"docid":"a43975f24b283b4e6d4a1d1e0a7bc8e1","score":"0.4913366","text":"DotaGcmessagesCommon.CMsgDOTARealtimeGameStats getCurrent();","title":""},{"docid":"d366c25970d695578b6c237023054010","score":"0.4888714","text":"public Builder setAllowCustomGames(DotaGcmessagesServer.CMsgGameServerInfo.CustomGames value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00400000;\n allowCustomGames_ = value.getNumber();\n onChanged();\n return this;\n }","title":""},{"docid":"94a37ca8264051b72c9a376107a2ea45","score":"0.48799625","text":"public void gameDataReceived(String accountId, GameKeyValuePairs gameKeyValuePairs)\n\t{\n\t\tgameDataReceived(accountId, gameKeyValuePairs, -1);\n\t}","title":""},{"docid":"4155a986d036b1f482aebbcf53ffc298","score":"0.48758987","text":"com.google.protobuf.ByteString\n getGameidBytes();","title":""},{"docid":"ff8ddc9829fcc9efb188b9e943bcc5b0","score":"0.4875854","text":"private void endGame() {\n clockPanel.stopClock();\n timer.stop();\n state = GameState.WELCOME;\n message.showMessage(MessageLabel.GAME_OVER);\n message.setBounds(0, getHeight() / 4, getWidth(), getHeight() / 2);\n\n }","title":""},{"docid":"7025c9969e03308b01127f2e7ea86ec8","score":"0.48732","text":"@Override\n\tpublic String getGame() {\n\t\treturn null;\n\t}","title":""},{"docid":"d1eb2395ed681aca6e5f86b3d2e39ff1","score":"0.4862798","text":"public com.google.protobuf.ByteString getSaveGameData() {\n return saveGameData_;\n }","title":""},{"docid":"d1eb2395ed681aca6e5f86b3d2e39ff1","score":"0.48622435","text":"public com.google.protobuf.ByteString getSaveGameData() {\n return saveGameData_;\n }","title":""},{"docid":"f5618ab04d124ab95d3e5da68b02be36","score":"0.48485115","text":"private void endGame() {\n Intent intent = new Intent(MainGameMultiActivity.this, EndFrameMultiActivity.class);\n intent.putExtra(EndFrameMultiActivity.PLAYER1T1_NAME, score.getPlayer1T1Name());\n intent.putExtra(EndFrameMultiActivity.PLAYER2T1_NAME, score.getPlayer2T1Name());\n intent.putExtra(EndFrameMultiActivity.PLAYER1T2_NAME, score.getPlayer1T2Name());\n intent.putExtra(EndFrameMultiActivity.PLAYER2T2_NAME, score.getPlayer2T2Name());\n\n intent.putExtra(EndFrameMultiActivity.PLAYER1T1_SCORE, score.getPlayer1T1Score());\n intent.putExtra(EndFrameMultiActivity.PLAYER2T1_SCORE, score.getPlayer2T1Score());\n intent.putExtra(EndFrameMultiActivity.PLAYER1T2_SCORE, score.getPlayer1T2Score());\n intent.putExtra(EndFrameMultiActivity.PLAYER2T2_SCORE, score.getPlayer2T2Score());\n\n intent.putExtra(EndFrameMultiActivity.TEAM1_SCORE, score.getTeam1Score());\n intent.putExtra(EndFrameMultiActivity.TEAM2_SCORE, score.getTeam2Score());\n\n intent.putExtra(EndFrameMultiActivity.PLAYER1T1_IMAGE, p1t1Image);\n intent.putExtra(EndFrameMultiActivity.PLAYER2T1_IMAGE, p2t1Image);\n intent.putExtra(EndFrameMultiActivity.PLAYER1T2_IMAGE, p1t2Image);\n intent.putExtra(EndFrameMultiActivity.PLAYER2T2_IMAGE, p2t2Image);\n\n startActivity(intent);\n }","title":""},{"docid":"344b84683240c56e39992d8835d1edbc","score":"0.4842835","text":"@Override\n public Game scoreEndOfGame(Game game) {\n return null;\n }","title":""},{"docid":"a61d8e0816fb84fd3ac454897441b95a","score":"0.48422793","text":"DotaGcmessagesServer.CMsgConnectedPlayers.SendReason getSendReason();","title":""},{"docid":"fe82d8a9f3433a089daa29d5125d001d","score":"0.48396468","text":"@Override\n\tpublic void onGameLost(Game game) {\n\t\t\n\t}","title":""},{"docid":"e9ece7267d094c3de5bbdb835091fc2a","score":"0.4834128","text":"DotaGcmessagesServer.CMsgDOTACNY2015EventPointUsage.PointUsage getLosingTeamUsage();","title":""},{"docid":"958eb7c12b6b2577e84d775d88e35569","score":"0.48319724","text":"private CMsgSignOutPlayerStats(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\n super(builder);\n }","title":""},{"docid":"0e567840e650d202170b52d788b2935a","score":"0.48313087","text":"DotaGcmessagesServer.CMsgSignOutXPCoins.Player getPlayers(int index);","title":""},{"docid":"e54a9934b4e8a8ac1127147efd37da51","score":"0.48107275","text":"private CNewGameParameters(){}","title":""},{"docid":"f93e6e13a1e78c84e4b069683de5cd96","score":"0.48035875","text":"protected boolean processGameInfo(GameInfoStruct data) {\n return false;\n }","title":""},{"docid":"31528f9a0cfd00877895c230a266fad8","score":"0.47811326","text":"@Override\n\tpublic void onGameOver() {\n\t}","title":""}],"string":"[\n {\n \"docid\": \"b906a705d8a420e96604dc697de0c824\",\n \"score\": \"0.92373806\",\n \"text\": \"DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData getCustomGameData();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e5ef9a56bba1ced203aef79a9fce18a\",\n \"score\": \"0.895631\",\n \"text\": \"DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData getCustomGameData();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fef87fb6f7a83bfda671e2428274e5d1\",\n \"score\": \"0.8772675\",\n \"text\": \"DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameDataOrBuilder getCustomGameDataOrBuilder();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b576d811b978bf177388cb175760666\",\n \"score\": \"0.8624269\",\n \"text\": \"DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameDataOrBuilder getCustomGameDataOrBuilder();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"30d4bd0ebcd43852e86988f4b7440f72\",\n \"score\": \"0.7958039\",\n \"text\": \"public DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameDataOrBuilder getCustomGameDataOrBuilder() {\\n return customGameData_ == null ? DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.getDefaultInstance() : customGameData_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"caa0552de80a99cb94c91baed92c3a49\",\n \"score\": \"0.7947443\",\n \"text\": \"public Builder setCustomGameData(DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData value) {\\n if (customGameDataBuilder_ == null) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n customGameData_ = value;\\n onChanged();\\n } else {\\n customGameDataBuilder_.setMessage(value);\\n }\\n bitField1_ |= 0x00000008;\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"166dc214bc4ead85259c75bdb9a2c448\",\n \"score\": \"0.7946721\",\n \"text\": \"public DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameDataOrBuilder getCustomGameDataOrBuilder() {\\n if (customGameDataBuilder_ != null) {\\n return customGameDataBuilder_.getMessageOrBuilder();\\n } else {\\n return customGameData_ == null ?\\n DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.getDefaultInstance() : customGameData_;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c90fc1f000b5e104be3137ae9f68c4d\",\n \"score\": \"0.7898464\",\n \"text\": \"public DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData getCustomGameData() {\\n if (customGameDataBuilder_ == null) {\\n return customGameData_ == null ? DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.getDefaultInstance() : customGameData_;\\n } else {\\n return customGameDataBuilder_.getMessage();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe35950786d23e4edefc57ec652cc02a\",\n \"score\": \"0.7750593\",\n \"text\": \"public DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData getCustomGameData() {\\n return customGameData_ == null ? DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.getDefaultInstance() : customGameData_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f61e992f3e7a6a86864bdc8af4aa8878\",\n \"score\": \"0.7654383\",\n \"text\": \"public Builder setCustomGameData(DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData value) {\\n if (customGameDataBuilder_ == null) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n customGameData_ = value;\\n onChanged();\\n } else {\\n customGameDataBuilder_.setMessage(value);\\n }\\n bitField0_ |= 0x80000000;\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bcb13d0ad626f7b0fe8a93c0452de5c7\",\n \"score\": \"0.7651595\",\n \"text\": \"public DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameDataOrBuilder getCustomGameDataOrBuilder() {\\n return customGameData_ == null ? DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.getDefaultInstance() : customGameData_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ec35b6ebb472540623f6b8ee7ed6a2b\",\n \"score\": \"0.7610598\",\n \"text\": \"public DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameDataOrBuilder getCustomGameDataOrBuilder() {\\n if (customGameDataBuilder_ != null) {\\n return customGameDataBuilder_.getMessageOrBuilder();\\n } else {\\n return customGameData_ == null ?\\n DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.getDefaultInstance() : customGameData_;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7dc0ec0607356fee2662a3f3e529aae3\",\n \"score\": \"0.7605351\",\n \"text\": \"public DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData getCustomGameData() {\\n if (customGameDataBuilder_ == null) {\\n return customGameData_ == null ? DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.getDefaultInstance() : customGameData_;\\n } else {\\n return customGameDataBuilder_.getMessage();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ada1778d85ce8f90bf5811c654c775a6\",\n \"score\": \"0.7441946\",\n \"text\": \"public DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData getCustomGameData() {\\n return customGameData_ == null ? DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.getDefaultInstance() : customGameData_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c123492e68f300a635b3df60c857ddd6\",\n \"score\": \"0.7052848\",\n \"text\": \"public Builder mergeCustomGameData(DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData value) {\\n if (customGameDataBuilder_ == null) {\\n if (((bitField1_ & 0x00000008) == 0x00000008) &&\\n customGameData_ != null &&\\n customGameData_ != DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.getDefaultInstance()) {\\n customGameData_ =\\n DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.newBuilder(customGameData_).mergeFrom(value).buildPartial();\\n } else {\\n customGameData_ = value;\\n }\\n onChanged();\\n } else {\\n customGameDataBuilder_.mergeFrom(value);\\n }\\n bitField1_ |= 0x00000008;\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac997d1efcdd09fa0ccf6adb5250bf89\",\n \"score\": \"0.6701431\",\n \"text\": \"public Builder setCustomGameData(\\n DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.Builder builderForValue) {\\n if (customGameDataBuilder_ == null) {\\n customGameData_ = builderForValue.build();\\n onChanged();\\n } else {\\n customGameDataBuilder_.setMessage(builderForValue.build());\\n }\\n bitField1_ |= 0x00000008;\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3742d547f8a3b4881905ae4db3a16af9\",\n \"score\": \"0.6528706\",\n \"text\": \"public DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.Builder getCustomGameDataBuilder() {\\n bitField1_ |= 0x00000008;\\n onChanged();\\n return getCustomGameDataFieldBuilder().getBuilder();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cf999ea9605f2044c4c9a3861ff10bb2\",\n \"score\": \"0.6528206\",\n \"text\": \"public Builder mergeCustomGameData(DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData value) {\\n if (customGameDataBuilder_ == null) {\\n if (((bitField0_ & 0x80000000) == 0x80000000) &&\\n customGameData_ != null &&\\n customGameData_ != DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.getDefaultInstance()) {\\n customGameData_ =\\n DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.newBuilder(customGameData_).mergeFrom(value).buildPartial();\\n } else {\\n customGameData_ = value;\\n }\\n onChanged();\\n } else {\\n customGameDataBuilder_.mergeFrom(value);\\n }\\n bitField0_ |= 0x80000000;\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cebdb627f15c4145cc443e864e0e076d\",\n \"score\": \"0.64180994\",\n \"text\": \"public DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.Builder getCustomGameDataBuilder() {\\n bitField0_ |= 0x80000000;\\n onChanged();\\n return getCustomGameDataFieldBuilder().getBuilder();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a017261634c9d983ddb5ffaf6d40f13\",\n \"score\": \"0.63737065\",\n \"text\": \"DotaGcmessagesServer.CMsgGameServerInfo.CustomGames getAllowCustomGames();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e500e10416f4e79d1035eeef3b73d2c1\",\n \"score\": \"0.6293375\",\n \"text\": \"public Builder setCustomGameData(\\n DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.Builder builderForValue) {\\n if (customGameDataBuilder_ == null) {\\n customGameData_ = builderForValue.build();\\n onChanged();\\n } else {\\n customGameDataBuilder_.setMessage(builderForValue.build());\\n }\\n bitField0_ |= 0x80000000;\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"457de3c6755b14f22a1baaad701a966a\",\n \"score\": \"0.5989643\",\n \"text\": \"private com.google.protobuf.SingleFieldBuilderV3<\\n DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData, DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.Builder, DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameDataOrBuilder> \\n getCustomGameDataFieldBuilder() {\\n if (customGameDataBuilder_ == null) {\\n customGameDataBuilder_ = new com.google.protobuf.SingleFieldBuilderV3<\\n DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData, DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData.Builder, DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameDataOrBuilder>(\\n getCustomGameData(),\\n getParentForChildren(),\\n isClean());\\n customGameData_ = null;\\n }\\n return customGameDataBuilder_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"df40c0c5345ed856527a54488dac6e13\",\n \"score\": \"0.5985041\",\n \"text\": \"private com.google.protobuf.SingleFieldBuilderV3<\\n DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData, DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.Builder, DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameDataOrBuilder> \\n getCustomGameDataFieldBuilder() {\\n if (customGameDataBuilder_ == null) {\\n customGameDataBuilder_ = new com.google.protobuf.SingleFieldBuilderV3<\\n DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData, DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData.Builder, DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameDataOrBuilder>(\\n getCustomGameData(),\\n getParentForChildren(),\\n isClean());\\n customGameData_ = null;\\n }\\n return customGameDataBuilder_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ed6a96773a575bdcf7c6e63de5d676f\",\n \"score\": \"0.59581846\",\n \"text\": \"public long getCustomGameId() {\\n return customGameId_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64961cfbaf88a0bd44bbb61ce06aae09\",\n \"score\": \"0.59508055\",\n \"text\": \"public long getCustomGameId() {\\n return customGameId_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65717ce0c5605db66bdf6f627f85ae00\",\n \"score\": \"0.5730324\",\n \"text\": \"DotaGcmessagesServer.CMsgGameServerSaveGameResult.Result getResult();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f71ad41151d756eb51d7dd69aa00120\",\n \"score\": \"0.57067454\",\n \"text\": \"private CMsgGameMatchSignOut(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\\n super(builder);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"487c3499f0810ee364c9fdd21c197259\",\n \"score\": \"0.5677838\",\n \"text\": \"DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer getPlayers(int index);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8277d5b70dc11d53a0f8533f7bf5932b\",\n \"score\": \"0.5670033\",\n \"text\": \"public boolean hasCustomGameData() {\\n return ((bitField0_ & 0x04000000) == 0x04000000);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"71df7e59dc16897a56011d57a41c903e\",\n \"score\": \"0.56635773\",\n \"text\": \"public Builder clearCustomGameData() {\\n if (customGameDataBuilder_ == null) {\\n customGameData_ = null;\\n onChanged();\\n } else {\\n customGameDataBuilder_.clear();\\n }\\n bitField0_ = (bitField0_ & ~0x80000000);\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd7b0e75a0b6a58d1009e9fc6b4f73a7\",\n \"score\": \"0.5611093\",\n \"text\": \"private CMsgGameMatchSignoutResponse(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\\n super(builder);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0bb1f420381d18f8bace38be94071cc\",\n \"score\": \"0.55945414\",\n \"text\": \"public Builder clearCustomGameId() {\\n bitField0_ = (bitField0_ & ~0x00000010);\\n customGameId_ = 0L;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8396e9e35456749e62dba2ae9362f85c\",\n \"score\": \"0.55828583\",\n \"text\": \"public DotaGcmessagesServer.CMsgGameServerInfo.CustomGames getAllowCustomGames() {\\n DotaGcmessagesServer.CMsgGameServerInfo.CustomGames result = DotaGcmessagesServer.CMsgGameServerInfo.CustomGames.valueOf(allowCustomGames_);\\n return result == null ? DotaGcmessagesServer.CMsgGameServerInfo.CustomGames.BOTH : result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b685e7b31966e79e6f1b7109b44afab2\",\n \"score\": \"0.5578113\",\n \"text\": \"long getCustomGameId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1acc954e47de04b7b3ea45de4587b50\",\n \"score\": \"0.5567807\",\n \"text\": \"public boolean hasCustomGameData() {\\n return ((bitField0_ & 0x80000000) == 0x80000000);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff89451116dedc459d5ecc09af8fd5a8\",\n \"score\": \"0.5566863\",\n \"text\": \"DotaGcmessagesServer.CMsgGameMatchSignoutResponse.CAdditionalSignoutMsg getAdditionalMsgs(int index);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"431897a1dc2ced87425ea1162102d4ab\",\n \"score\": \"0.5560262\",\n \"text\": \"public DotaGcmessagesServer.CMsgGameServerInfo.CustomGames getAllowCustomGames() {\\n DotaGcmessagesServer.CMsgGameServerInfo.CustomGames result = DotaGcmessagesServer.CMsgGameServerInfo.CustomGames.valueOf(allowCustomGames_);\\n return result == null ? DotaGcmessagesServer.CMsgGameServerInfo.CustomGames.BOTH : result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d15d21f30cb37cedc4260175543f0cc\",\n \"score\": \"0.55426264\",\n \"text\": \"public Builder clearCustomGameData() {\\n if (customGameDataBuilder_ == null) {\\n customGameData_ = null;\\n onChanged();\\n } else {\\n customGameDataBuilder_.clear();\\n }\\n bitField1_ = (bitField1_ & ~0x00000008);\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9001606e9cf283d6979e750878679711\",\n \"score\": \"0.548966\",\n \"text\": \"public boolean hasCustomGameData() {\\n return ((bitField1_ & 0x00000008) == 0x00000008);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41529f8f3869cd83bba84705a07a4aff\",\n \"score\": \"0.5443262\",\n \"text\": \"DotaGcmessagesServer.CMsgGameMatchSignOut.CAdditionalSignoutMsg getAdditionalMsgs(int index);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"42bd6bfbc217a1bb20d8e31bb0da9205\",\n \"score\": \"0.5434564\",\n \"text\": \"DotaGcmessagesServer.CMsgSignOutUpdatePlayerChallenge.Challenge getCompleted(int index);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4304563f46d997c5a26a11d8fee0132c\",\n \"score\": \"0.54272944\",\n \"text\": \"@Override\\n\\tpublic void onGameCancelled(Game game) {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"474fc8e87f1b6b0819c1940b5863f01d\",\n \"score\": \"0.54137707\",\n \"text\": \"public boolean hasCustomGameId() {\\n return ((bitField0_ & 0x00000010) == 0x00000010);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"32f9193dd9ab8cbcb2c6acdffb1d87e9\",\n \"score\": \"0.5412381\",\n \"text\": \"DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam getTeams(int index);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70aec9d07ebdc331e2ac3f0175153f5c\",\n \"score\": \"0.5410974\",\n \"text\": \"public boolean hasCustomGameId() {\\n return ((bitField0_ & 0x00000010) == 0x00000010);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8f262a7fbefb3aa570b146acfd7e851\",\n \"score\": \"0.5310824\",\n \"text\": \"private CCustomGameData(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\\n super(builder);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26b9be0d9f61bc6eb35ba91155a0b4b1\",\n \"score\": \"0.5287965\",\n \"text\": \"com.google.protobuf.ByteString getSaveGameData();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26b9be0d9f61bc6eb35ba91155a0b4b1\",\n \"score\": \"0.5287965\",\n \"text\": \"com.google.protobuf.ByteString getSaveGameData();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e4f722f369660fd17a3a1e2bafd4ad3\",\n \"score\": \"0.52336204\",\n \"text\": \"public Builder setCustomGameId(long value) {\\n bitField0_ |= 0x00000010;\\n customGameId_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4149135f2b802a2073244bfcc947aed5\",\n \"score\": \"0.5225814\",\n \"text\": \"private void clearGameID() {\\n bitField0_ = (bitField0_ & ~0x00000002);\\n gameID_ = getDefaultInstance().getGameID();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4352ef02be3d93007c893ee0cee0a95c\",\n \"score\": \"0.52133626\",\n \"text\": \"DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayerOrBuilder getPlayersOrBuilder(\\n int index);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f883206f99cdd63fcd5b1a91dcc43eb9\",\n \"score\": \"0.5198591\",\n \"text\": \"private CCustomGameData(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\\n super(builder);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4233d9361f6dcdb22532b290168842e4\",\n \"score\": \"0.5194446\",\n \"text\": \"public abstract void lostGame(Game game, String secretcode);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6430ca38dd039be623c2a0629803cae3\",\n \"score\": \"0.5186139\",\n \"text\": \"boolean hasCustomGameData();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6430ca38dd039be623c2a0629803cae3\",\n \"score\": \"0.5186139\",\n \"text\": \"boolean hasCustomGameData();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"18343270ed79c23aa769157e7acccef4\",\n \"score\": \"0.5160001\",\n \"text\": \"DotaGcmessagesServer.CMsgSignOutUpdatePlayerChallenge.Challenge getRerolled(int index);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f9ec05196bfe0e37119bd7411be6373\",\n \"score\": \"0.51221395\",\n \"text\": \"public GameFinishedMessage(\\n boolean win,\\n int yourTeamPoints,\\n int otherTeamPoints,\\n Map<String, Integer> newEloPerUsername) {\\n super();\\n this.win = win;\\n this.yourTeamPoints = yourTeamPoints;\\n this.otherTeamPoints = otherTeamPoints;\\n this.newEloPerUsername = newEloPerUsername;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"99330fae98d44209d4834d9c35168f30\",\n \"score\": \"0.5115196\",\n \"text\": \"public CompressibleData getGameUserData() {\\r\\n return gameUserData==null?null:gameUserData.data;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3177d723e322bf5441ce58adfc20f0dd\",\n \"score\": \"0.51135725\",\n \"text\": \"grpc.client.AppOuterClass.AppOrBuilder getGameOrBuilder();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f2cb4d213bf536bff719a024b3e5026\",\n \"score\": \"0.51097\",\n \"text\": \"DotaGcmessagesServer.CMsgDOTALiveScoreboardUpdate.Team getTeamGood();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65a53b8eea1a7e25139ae347229f3111\",\n \"score\": \"0.5106066\",\n \"text\": \"public void endGame() {\\n if (network != null) {\\n Message m = new Message();\\n m.eventType = Constants.M_GAME_OVER;\\n m.PlayerID = prev_player;\\n network.sendToAllDevices(m, new SalutCallback() {\\n @Override\\n public void call() {\\n\\n }\\n });\\n }\\n\\n bridge.sendDataToView(Constants.M_GAME_OVER, prev_player);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d46a1db132002f62bed743fb8e8d599\",\n \"score\": \"0.51035595\",\n \"text\": \"public void cancelGame() {\\n client.send(\\\"Cancel&\\\" + game.getId() + \\\"&\\\" + game.getName());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c5f6b855791764bdbccac236c23a88d\",\n \"score\": \"0.5087403\",\n \"text\": \"void sendEndGameInfo(boolean isWin);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35f5babd9dfd846034b81fa057b9ba00\",\n \"score\": \"0.5078222\",\n \"text\": \"protocol.Protocol.GameOrBuilder getGameOrBuilder();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00801e62c0b0f928b7b5924abe4cf86b\",\n \"score\": \"0.50645703\",\n \"text\": \"private MessageEmbed buildRandomGameEmbed(Application game, int commonGames, ArrayList<User> noGames, ArrayList<User> users, String footer) {\\n AppInfo appInfo = game.getAppInfo();\\n return new EmbedBuilder()\\n .setTitle(\\\"Steam Random | \\\" + appInfo.getSummary(), appInfo.getStoreUrl())\\n .setThumbnail(SteamStore.STEAM_LOGO)\\n .setImage(game.getThumbnail())\\n .setDescription(buildDescription(game, commonGames, noGames, users))\\n .setColor(EmbedHelper.BLUE)\\n .addField(\\\"Concurrent Players\\\", game.formatConcurrentPlayers(), true)\\n .setFooter(footer)\\n .build();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b30d0b2b036ac7231ddeb66ab52a9403\",\n \"score\": \"0.50519323\",\n \"text\": \"@Override\\n\\tpublic void onGameExit() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4976bd5348b4c278bbfd8122095ff90\",\n \"score\": \"0.5045119\",\n \"text\": \"DotaGcmessagesServer.CMsgDOTALiveScoreboardUpdate.Team getTeamBad();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7426757b4a3a53317b0484d734f031f2\",\n \"score\": \"0.50389224\",\n \"text\": \"public Builder clearAllowCustomGames() {\\n bitField0_ = (bitField0_ & ~0x00400000);\\n allowCustomGames_ = 0;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3eea60eb9b2c2cbb43caec3ac57834bd\",\n \"score\": \"0.5038336\",\n \"text\": \"public boolean hasAllowCustomGames() {\\n return ((bitField0_ & 0x00400000) == 0x00400000);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c400d7d26b76786793f8f24e25018f5a\",\n \"score\": \"0.50364137\",\n \"text\": \"@Override\\n\\tpublic void exitGame(GamePlayerInterface player) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f70a65d857e1d7fbf0b63d8a293defc\",\n \"score\": \"0.50126463\",\n \"text\": \"public boolean hasAllowCustomGames() {\\n return ((bitField0_ & 0x00400000) == 0x00400000);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c18d9751fbdc12e9d8b5dafdae91f6d0\",\n \"score\": \"0.49926707\",\n \"text\": \"private CMsgGameMatchSignOutPermissionResponse(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\\n super(builder);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b6358d3fa3fea0f91be2080e39a6701c\",\n \"score\": \"0.49888328\",\n \"text\": \"public com.google.protobuf.ByteString getSaveGameData() {\\n return saveGameData_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b6358d3fa3fea0f91be2080e39a6701c\",\n \"score\": \"0.49884704\",\n \"text\": \"public com.google.protobuf.ByteString getSaveGameData() {\\n return saveGameData_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b767905aa16b20194df0a116d41a78b9\",\n \"score\": \"0.49789673\",\n \"text\": \"java.util.List<? extends DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayerOrBuilder> \\n getPlayersOrBuilderList();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4bcf2cfad23273ed9872b317bef5c4a\",\n \"score\": \"0.49708518\",\n \"text\": \"private void quitGame() {\\n\\t\\tLog.d(TAG, \\\"quitGame\\\");\\n\\t\\t// Send message to competitor.\\n\\t\\tbyte[] data = ProtocolEncoder.encodeQuitGame();\\n\\t\\tsendMessageToAllCompetitor(data);\\n\\t\\tfinish();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a2dfa7ed49bba5db78edc104c431fb3\",\n \"score\": \"0.49573126\",\n \"text\": \"@Override\\r\\n\\tprotected void netvsRecvEndGameStats(String[] message) {\\r\\n\\t\\tint seatID = Integer.parseInt(message[2]);\\r\\n\\t\\tint playerID = netvsGetPlayerIDbySeatID(seatID);\\r\\n\\r\\n\\t\\tif((playerID != 0) || (netvsIsWatch())) {\\r\\n\\t\\t\\tGameEngine engine = owner.engine[playerID];\\r\\n\\r\\n\\t\\t\\tfloat tempGarbageSend = Float.parseFloat(message[5]);\\r\\n\\t\\t\\tgarbageSent[playerID] = (int)(tempGarbageSend * GARBAGE_DENOMINATOR);\\r\\n\\r\\n\\t\\t\\tplayerAPL[playerID] = Float.parseFloat(message[6]);\\r\\n\\t\\t\\tplayerAPM[playerID] = Float.parseFloat(message[7]);\\r\\n\\t\\t\\tengine.statistics.lines = Integer.parseInt(message[8]);\\r\\n\\t\\t\\tengine.statistics.lpm = Float.parseFloat(message[9]);\\r\\n\\t\\t\\tengine.statistics.totalPieceLocked = Integer.parseInt(message[10]);\\r\\n\\t\\t\\tengine.statistics.pps = Float.parseFloat(message[11]);\\r\\n\\t\\t\\tengine.statistics.time = Integer.parseInt(message[12]);\\r\\n\\r\\n\\t\\t\\tnetvsPlayerResultReceived[playerID] = true;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"493f196249b4ff333b560757155ddeae\",\n \"score\": \"0.49544057\",\n \"text\": \"DotaGcmessagesServer.CMsgSignOutCommunicationSummary.PlayerCommunication getPlayers(int index);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8860be5c9a845cdbf08a08ebdb65d846\",\n \"score\": \"0.493535\",\n \"text\": \"private CMsgSignOutUpdatePlayerChallenge(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\\n super(builder);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c70a178ec09f6dc67f2d2b3e7739ca57\",\n \"score\": \"0.49199423\",\n \"text\": \"java.util.List<DotaGcmessagesServer.CMsgGameMatchSignOut.CTeam.CPlayer> \\n getPlayersList();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c21cd0637337e7b206673ec3528b81f2\",\n \"score\": \"0.49160025\",\n \"text\": \"@Override\\n\\tpublic void exitGame() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41adb3a868d220457809f5a7991d7289\",\n \"score\": \"0.49159002\",\n \"text\": \"private void setGameIDBytes(\\n com.google.protobuf.ByteString value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000002;\\n gameID_ = value.toStringUtf8();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a43975f24b283b4e6d4a1d1e0a7bc8e1\",\n \"score\": \"0.4913366\",\n \"text\": \"DotaGcmessagesCommon.CMsgDOTARealtimeGameStats getCurrent();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d366c25970d695578b6c237023054010\",\n \"score\": \"0.4888714\",\n \"text\": \"public Builder setAllowCustomGames(DotaGcmessagesServer.CMsgGameServerInfo.CustomGames value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00400000;\\n allowCustomGames_ = value.getNumber();\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"94a37ca8264051b72c9a376107a2ea45\",\n \"score\": \"0.48799625\",\n \"text\": \"public void gameDataReceived(String accountId, GameKeyValuePairs gameKeyValuePairs)\\n\\t{\\n\\t\\tgameDataReceived(accountId, gameKeyValuePairs, -1);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4155a986d036b1f482aebbcf53ffc298\",\n \"score\": \"0.48758987\",\n \"text\": \"com.google.protobuf.ByteString\\n getGameidBytes();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff8ddc9829fcc9efb188b9e943bcc5b0\",\n \"score\": \"0.4875854\",\n \"text\": \"private void endGame() {\\n clockPanel.stopClock();\\n timer.stop();\\n state = GameState.WELCOME;\\n message.showMessage(MessageLabel.GAME_OVER);\\n message.setBounds(0, getHeight() / 4, getWidth(), getHeight() / 2);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7025c9969e03308b01127f2e7ea86ec8\",\n \"score\": \"0.48732\",\n \"text\": \"@Override\\n\\tpublic String getGame() {\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1eb2395ed681aca6e5f86b3d2e39ff1\",\n \"score\": \"0.4862798\",\n \"text\": \"public com.google.protobuf.ByteString getSaveGameData() {\\n return saveGameData_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1eb2395ed681aca6e5f86b3d2e39ff1\",\n \"score\": \"0.48622435\",\n \"text\": \"public com.google.protobuf.ByteString getSaveGameData() {\\n return saveGameData_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f5618ab04d124ab95d3e5da68b02be36\",\n \"score\": \"0.48485115\",\n \"text\": \"private void endGame() {\\n Intent intent = new Intent(MainGameMultiActivity.this, EndFrameMultiActivity.class);\\n intent.putExtra(EndFrameMultiActivity.PLAYER1T1_NAME, score.getPlayer1T1Name());\\n intent.putExtra(EndFrameMultiActivity.PLAYER2T1_NAME, score.getPlayer2T1Name());\\n intent.putExtra(EndFrameMultiActivity.PLAYER1T2_NAME, score.getPlayer1T2Name());\\n intent.putExtra(EndFrameMultiActivity.PLAYER2T2_NAME, score.getPlayer2T2Name());\\n\\n intent.putExtra(EndFrameMultiActivity.PLAYER1T1_SCORE, score.getPlayer1T1Score());\\n intent.putExtra(EndFrameMultiActivity.PLAYER2T1_SCORE, score.getPlayer2T1Score());\\n intent.putExtra(EndFrameMultiActivity.PLAYER1T2_SCORE, score.getPlayer1T2Score());\\n intent.putExtra(EndFrameMultiActivity.PLAYER2T2_SCORE, score.getPlayer2T2Score());\\n\\n intent.putExtra(EndFrameMultiActivity.TEAM1_SCORE, score.getTeam1Score());\\n intent.putExtra(EndFrameMultiActivity.TEAM2_SCORE, score.getTeam2Score());\\n\\n intent.putExtra(EndFrameMultiActivity.PLAYER1T1_IMAGE, p1t1Image);\\n intent.putExtra(EndFrameMultiActivity.PLAYER2T1_IMAGE, p2t1Image);\\n intent.putExtra(EndFrameMultiActivity.PLAYER1T2_IMAGE, p1t2Image);\\n intent.putExtra(EndFrameMultiActivity.PLAYER2T2_IMAGE, p2t2Image);\\n\\n startActivity(intent);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"344b84683240c56e39992d8835d1edbc\",\n \"score\": \"0.4842835\",\n \"text\": \"@Override\\n public Game scoreEndOfGame(Game game) {\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a61d8e0816fb84fd3ac454897441b95a\",\n \"score\": \"0.48422793\",\n \"text\": \"DotaGcmessagesServer.CMsgConnectedPlayers.SendReason getSendReason();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe82d8a9f3433a089daa29d5125d001d\",\n \"score\": \"0.48396468\",\n \"text\": \"@Override\\n\\tpublic void onGameLost(Game game) {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9ece7267d094c3de5bbdb835091fc2a\",\n \"score\": \"0.4834128\",\n \"text\": \"DotaGcmessagesServer.CMsgDOTACNY2015EventPointUsage.PointUsage getLosingTeamUsage();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"958eb7c12b6b2577e84d775d88e35569\",\n \"score\": \"0.48319724\",\n \"text\": \"private CMsgSignOutPlayerStats(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\\n super(builder);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e567840e650d202170b52d788b2935a\",\n \"score\": \"0.48313087\",\n \"text\": \"DotaGcmessagesServer.CMsgSignOutXPCoins.Player getPlayers(int index);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e54a9934b4e8a8ac1127147efd37da51\",\n \"score\": \"0.48107275\",\n \"text\": \"private CNewGameParameters(){}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f93e6e13a1e78c84e4b069683de5cd96\",\n \"score\": \"0.48035875\",\n \"text\": \"protected boolean processGameInfo(GameInfoStruct data) {\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31528f9a0cfd00877895c230a266fad8\",\n \"score\": \"0.47811326\",\n \"text\": \"@Override\\n\\tpublic void onGameOver() {\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983787,"cells":{"query_id":{"kind":"string","value":"93f4c23479b827e942147ba3ae9cc015"},"query":{"kind":"string","value":"ActionListener for handling accessibility profile updates."},"positive_passages":{"kind":"list like","value":[{"docid":"17277f33db380162b675e0a5af9aa1c2","score":"0.74461704","text":"public void update(ActionEvent event)\n {\n AccessibilityProfile.ColorContrast colorContrast =\n isHighContrast() ?\n AccessibilityProfile.ColorContrast.HIGH : \n AccessibilityProfile.ColorContrast.STANDARD;\n\n AccessibilityProfile.FontSize fontSize =\n isLargeFonts() ?\n AccessibilityProfile.FontSize.LARGE : \n AccessibilityProfile.FontSize.MEDIUM;\n \n _accProfile = AccessibilityProfile.getInstance(colorContrast, fontSize);\n }","title":""}],"string":"[\n {\n \"docid\": \"17277f33db380162b675e0a5af9aa1c2\",\n \"score\": \"0.74461704\",\n \"text\": \"public void update(ActionEvent event)\\n {\\n AccessibilityProfile.ColorContrast colorContrast =\\n isHighContrast() ?\\n AccessibilityProfile.ColorContrast.HIGH : \\n AccessibilityProfile.ColorContrast.STANDARD;\\n\\n AccessibilityProfile.FontSize fontSize =\\n isLargeFonts() ?\\n AccessibilityProfile.FontSize.LARGE : \\n AccessibilityProfile.FontSize.MEDIUM;\\n \\n _accProfile = AccessibilityProfile.getInstance(colorContrast, fontSize);\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"872add5b83229a399098991fc67e430d","score":"0.63148534","text":"void profileEdited(MutableProfile profile);","title":""},{"docid":"c919ac5c2c1cefafdea8c5891b0e6983","score":"0.6112209","text":"public void handleUpdateProfilePanel() {\n updateProfilePanels();\n }","title":""},{"docid":"bfbdad391b7fce59fb341cdf988e2d55","score":"0.59467167","text":"private void button_showProfileActionPerformed(ActionEvent e) {\n\t\tMain1.profileScreen();\n\t}","title":""},{"docid":"269ce268c7dc95722fcd8131eaf515fd","score":"0.58746266","text":"public void userProfile(ActionEvent event)\n {\n try\n {\n ViewLoader view = new ViewLoader(Context.getInstance().getDisplayView());\n view.loadView(\"UserProfile\");\n }\n catch (Exception ex)\n {\n Logger.getLogger(HomeViewController.class.getName()).log(Level.SEVERE, null, ex);\n }\n\n }","title":""},{"docid":"2f0c82c0cd67c898dd2e20b50ff575da","score":"0.5851635","text":"public void handleProfileChanged() {\n updateProfilePanels();\n clearDateLabel();\n clearCaloriePanels();\n }","title":""},{"docid":"1f27918b9a3cf3d38cfa1f117f91f7e2","score":"0.5696775","text":"public void onAccessibilityEvent(AccessibilityEvent event);","title":""},{"docid":"93001c9276dd6ecfce95fb8f4dfce440","score":"0.56948215","text":"public void clickProfile() {\n\n\t\ttry {\n\t\t\tTestLog.log.info(\"Clicking Profile\");\n\t\t\tdrpProfileOption.click();\n\t\t\tTestLog.log.info(\"Clicked\");\n\n\t\t} catch (Exception ex) {\n\t\t\tSystem.out.println(\"Clicking Profile failed\");\n\t\t}\n\n\t}","title":""},{"docid":"4a77530078db15551dfd3fb600f545f4","score":"0.5669357","text":"@Override\n public boolean onProfileChanged(View view, IProfile profile, boolean current) {\n return true;\n }","title":""},{"docid":"5bcd635dc2ec075b13b8fe71acb701e8","score":"0.5635232","text":"@Override\n public void actionPerformed(ActionEvent event) {\n FileChooser chooser = Platform.getPlatform().getFileChooser();\n AlertDialog alert = Platform.getPlatform().getAlertDialog();\n String path;\n if (text.isEnabled()) {\n path = text.getText();\n }\n else {\n path = System.getProperty(\"user.home\");\n }\n File file = new File(path);\n file = chooser.openFile(\n LOCALE.get(\"DisplayProfileDialogTitle\"), file, null, null\n );\n if (file != null) {\n if (! file.isFile()) {\n alert.showAlert(\n null,\n '\\\"' + file.getName() + \"\\\" is not a file.\",\n \"A color profile is a file, \" +\n \"usually ending with \\\".icc\\\" or \\\".icm\\\".\",\n AlertDialog.WARNING_ALERT,\n \"OK\"\n );\n return;\n }\n try {\n ICC_Profile.getInstance(file.getAbsolutePath());\n }\n catch (IOException e) {\n alert.showAlert(\n null,\n '\\\"' + file.getName() + \"\\\" could not be read.\",\n e.getClass().getName() + \": \" + e.getMessage(),\n AlertDialog.WARNING_ALERT,\n \"OK\"\n );\n return;\n }\n catch (IllegalArgumentException e) {\n alert.showAlert(\n null,\n '\\\"' + file.getName() + \"\\\" is not a valid color profile.\",\n e.getClass().getName() + \": \" + e.getMessage(),\n AlertDialog.WARNING_ALERT,\n \"OK\"\n );\n return;\n }\n path = file.getAbsolutePath();\n text.setText(path);\n text.setEnabled(true);\n alert.showAlert(\n null,\n \"Display color profile \\\"\" + file.getName() + \"\\\" accepted.\",\n \"You must now restart LightZone for your new display \" +\n \"profile to take effect.\",\n AlertDialog.WARNING_ALERT,\n \"OK\"\n );\n }\n }","title":""},{"docid":"7924620fd948d98817b0b7973b66d553","score":"0.55586576","text":"public void click_profileLink() {\n\tprofileLink.click();\n\t}","title":""},{"docid":"75831a5963ddab9dbfabee3ccfcdbaa6","score":"0.5529457","text":"void updateProfilePanels() {\n profileCardPanel.update(logic.getMyFitnessBuddy().getPerson());\n profileListPanel.update(logic.getFilteredPersonList());\n }","title":""},{"docid":"e57c872a934986990bcf860c063f7268","score":"0.55071294","text":"public void registraAssociatedProfileController(MenuController mc){\n jbEditProfile.addActionListener(mc);\n jbEditProfile.setActionCommand(\"EDIT\");\n\n jbAccountPreferences.addActionListener(mc);\n jbAccountPreferences.setActionCommand(\"ACCOUNT PREFERENCES\");\n }","title":""},{"docid":"207d6dd7aff9c330a1dd9bd94c015180","score":"0.5504887","text":"void profileAdded(MutableProfile profile);","title":""},{"docid":"ec06377a2608a570408884331b98d3bd","score":"0.54627347","text":"public void actionPerformed(ActionEvent e) {\n\t\tObject source = e.getSource();\n\t\tif (source == addButton) {\t\n\t\t\tif (faceDB.containsProfile(nameField.getText())) {\n\t\t\t\tFacePamphletProfile profile = new FacePamphletProfile(nameField.getText());\n\t\t\t\tfaceDB.addProfile(profile);\n\t\t\t\tprintln(\"Add: profile for \" + nameField.getText() + \" already exists: \" + faceDB.getProfile(nameField.getText()).toString());\n\t\t\t} else {\n\t\t\t\tFacePamphletProfile profile = new FacePamphletProfile(nameField.getText());\n\t\t\t\tfaceDB.addProfile(profile);\n\t\t\t\tprintln(\"Add: new profile: \" + faceDB.getProfile(nameField.getText()).toString());\n\t\t\t}\n\t\t} else if (source == deleteButton) {\n\t\t\tif (faceDB.containsProfile(nameField.getText())) {\n\t\t\t\tfaceDB.deleteProfile(nameField.getText());\n\t\t\t\tprintln(\"Delete: profile of \" + nameField.getText() + \" deleted\");\n\t\t\t} else {\n\t\t\t\tprintln(\"Delete: profile with name \" + nameField.getText() + \" does not exist\");\n\t\t\t}\n\t\t} else if (source == lookupButton) {\n\t\t\tif (faceDB.containsProfile(nameField.getText())) {\n\t\t\t\tprintln(\"Lookup: \" + faceDB.getProfile(nameField.getText()).toString());\n\t\t\t} else {\n\t\t\t\tprintln(\"Lookup: profile with name \" + nameField.getText() + \" does not exist\");\n\t\t\t}\n\t\t} else if (source == changeStatusButton || source == changeStatusField) {\n\t\t\tprintln(\"Change Status: \" + changeStatusField.getText());\n\t\t} else if (source == changePictureButton || source == changePictureField) {\n\t\t\tprintln(\"Change Picture: \" + changePictureField.getText());\n\t\t} else if (source == addFriendButton || source == addFriendField) {\n\t\t\tprintln(\"Add Friend: \" + addFriendField.getText());\n\t\t}\n\t}","title":""},{"docid":"b64919c542e7eaf2bd12c977a7156c0f","score":"0.5397815","text":"public void enterProfilePage() {\r\n\t\tclick(lnkUserProfile);\r\n\t\tclick(btnMyAccount);\r\n\t}","title":""},{"docid":"9a59afface0b42f0ac4301d7f425f0e0","score":"0.53834844","text":"@Override\n public void actionPerformed(ActionEvent e) {\n reportAUser(isGuest, guidemo, sm, idC, cmc);\n }","title":""},{"docid":"48e52dfe64c67ee7625b427c1160c000","score":"0.5365094","text":"private void updateProfilePanel() {\n //System.out.println(\"Profile Panel Shown\");\n firstNameProfileLabel.setText(\"First Name: Haibo\");\n lastNameProfileLabel.setText(\"Last Name: Zeng\");\n emailProfileLabel.setText(\"Email: \" + clientRequest.getEmail());\n usernameProfileLabel.setText(\"Username: \" + clientRequest.getUsername());\n accountNumberProfileLabel.setText(clientRequest.getAccountNumber());\n fundsProfileLabel.setText(\"$324345\");\n try {\n numberOfChipsProfileLabel.setText(clientRequest.getUsersWorth(clientRequest.getUsername()));\n } catch (RemoteException ex) {} catch (SQLException ex) {}\n ipProfileLabel.setText(GUIClient.getIp());\n\n avatarProfileLabel.setIcon(clientRequest.getAvatar(clientRequest.getUsername()));\n }","title":""},{"docid":"e30e3929d80eec168efcf3cb00b8773f","score":"0.5337776","text":"public AccessibilityProfile getAccessibilityProfile()\n {\n return _accProfile;\n }","title":""},{"docid":"440fa296633cce5c6c5e14ade3665ba2","score":"0.5326488","text":"@Override\n\t\t\tpublic void actionPerformed(ActionEvent arg0) {\n\t\t\t\tBeanResources.getInstance().accountManager(null);\n\n\t\t\t\t// change panel\n\t\t\t\tGUIManager.addWelcomeToFrame();\n\t\t\t}","title":""},{"docid":"8e9aedee7a7df7f4b73f21466fc18bb5","score":"0.53223133","text":"void profileSelectionChanged(Optional<MutableProfile> profile);","title":""},{"docid":"cf772243d69a01ffd1520be8fa22bd67","score":"0.53207034","text":"public void doProfilesUpdate() {\r\n\t\tLog.d(TAG, \"Do profile update\");\r\n\t\tthis.profileAdapter.clear();\r\n\t\tfor (RouterProfile routerProfile : this.routerPreferencesHandler.getRouterProfiles()) {\r\n\t\t\tLog.d(TAG, \"Adding Profile to adapter: \" + routerProfile);\r\n\t\t\tthis.profileAdapter.add(routerProfile);\r\n\t\t}\r\n\r\n\t\tif (!profileAdapter.isEmpty())\r\n\t\t\tthis.emptyProfilesTextView.setVisibility(View.GONE);\r\n\r\n\t\tthis.profileAdapter.notifyDataSetChanged();\r\n\t}","title":""},{"docid":"52e16ea6f3ccd80404d065c5df4cea4e","score":"0.53153217","text":"public void sceneProfile(ActionEvent event) {\n ChangeScene.change(event, \"/Scenes/Profile.fxml\");\n }","title":""},{"docid":"814a513e2c9d44f084f5717b73db638b","score":"0.5308236","text":"@Override\n\tpublic void onUserProfileUpdate(User arg0) {\n\n\t}","title":""},{"docid":"e3b105d4412dd5cc3feb40fd888d9df0","score":"0.5301436","text":"protected void eventDeviceAccess(GCFNumber pimmgr_id, GCFEnum access_type, GCFString profile) throws MessageBrokerException\n {\n }","title":""},{"docid":"d49abd94d3ea4dd234b46ff3f27865ec","score":"0.5298893","text":"@Override\n public void apply() {\n SwingUtil.setEnabled(chckbxmntmToggleSidebar.isSelected(), chckbxmntmToggleActionButtons, chckbxmntmToggleAvailableProfiles);\n\n // West JPanel - Toggled by the 'Toggle Sidebar' menu item.\n SwingUtil.setVisible(chckbxmntmToggleSidebar.isSelected(), westJPanel);\n\n // Available Profiles - Only when the menu item is selected.\n SwingUtil.setVisible(chckbxmntmToggleAvailableProfiles.isSelected(), availableProfilesJList);\n\n // Action Buttons - Only when the menu item is selected.\n SwingUtil.setVisible(chckbxmntmToggleActionButtons.isSelected(), availableProfilesNorthButtonJPanel);\n\n // Action Buttons & File Menu\n // - New Profile - always available\n // - Load, Delete Profile - Only if a profile is selected\n final boolean isAProfileSelected = availableProfilesJList.getSelectedIndex() >= 0;\n SwingUtil.setEnabled(isAProfileSelected, loadProfileJButton, deleteProfileJButton, mntmLoadProfile, mntmDeleteProfile);\n\n // Action Buttons - New Password, Close Profile - Only if a profile is active (not the default)\n final boolean isAProfileActive = activeProfile.isNotDefault();\n SwingUtil.setEnabled(isAProfileActive, closeProfileJButton, mntmCloseProfile, newPasswordJBbutton);\n\n // Action Buttons - View, Edit, Delete Password - Only if a password is selected\n final boolean isAPasswordSelected = storedPasswordsJTable.getSelectedRow() >= 0;\n SwingUtil.setEnabled(isAPasswordSelected, viewPasswordJButton, editPasswordJButton, deletePasswordJButton, mntmViewPassword, mntmEditPassword, mntmDeletePassword);\n\n // - Delete Database - Only if menu item in Edit is enabled.\n SwingUtil.setEnabled(chckbxmntmEnableDeleteDatabase.isSelected(), deleteDatabaseJButton);\n\n // - Update the active profile text to match the current profile\n activeProfileJLabel.setText(activeProfile.get().getProfileName());\n }","title":""},{"docid":"f0b092f42b63e670a8b93ec76a408e91","score":"0.52984315","text":"public void addCreateProfileListener(EventHandler<ActionEvent> handler) {\n\t\tcrtProfile.setOnAction(handler);\n\t}","title":""},{"docid":"a402783b1d6742d0719213e5e6030b1d","score":"0.52770823","text":"public void onShowAchievementsRequested() {\n\t\t\n\t}","title":""},{"docid":"9e39ea4d9306d44ef752a9580a019fbb","score":"0.52640504","text":"public final void updateAccessStatistics() {\r\n elementEvictionData.updateLastAccessTime(System.currentTimeMillis(), this);\r\n HIT_COUNT_UPDATER.incrementAndGet(this);\r\n }","title":""},{"docid":"903478f6bc66718dc330895a9e5d3300","score":"0.5211879","text":"@Override\n public void updateNetworkProfile(final NetworkProfile networkProfile) {\n\n }","title":""},{"docid":"fa800ab706ad143fa017c23ebabbe222","score":"0.52089405","text":"@Override\n public void update(@NotNull AnActionEvent event) {\n }","title":""},{"docid":"9b4b4471c2522999656bc4554d7f4c1d","score":"0.5200406","text":"@Override\n public void onUserProfileUpdate(User arg0) {\n \n }","title":""},{"docid":"3bc93936751c452558ad4c1a2c1f27cc","score":"0.51849306","text":"private void button_adv_userInfoActionPerformed(ActionEvent e) {\n\t\tMain1.myDetailsScreen();\n\t}","title":""},{"docid":"a2cbb27e165f140b23b5af9cba832fa5","score":"0.51833713","text":"@Override\n public void onProfileSelected(User user) {\n }","title":""},{"docid":"03e5b3807116344852c7f579b94cb5a7","score":"0.5174885","text":"@Override\r\n\t\tpublic void actionPerformed(ActionEvent arg0) {\n\t\t\tSystem.out.println(\"Im called\");\r\n\t\t\tUserProfile userProfile = new UserProfile();\r\n\t\t\tuserProfile.setName(txtName.getText());\r\n\t\t\tuserProfile.setAge(Integer.parseInt(txtAge.getText()));\r\n\t\t\tuserProfile.setUsername(txtUsername.getText());\r\n\t\t\tsaveUser(userProfile);\r\n\r\n\t\t}","title":""},{"docid":"e4f7456e23c13590425151bc5837ac1c","score":"0.5168435","text":"@Test(priority =4)\n\tpublic void myProfileUpdate() throws InterruptedException {\n\t\thomePage.myProfileUpdate();\n\t\tMyProfilePage myprofile = new MyProfilePage();\n\t\tmyprofile.personalDetails();\n\t}","title":""},{"docid":"e4b9d7e42d7f55a070fe6a7ec15f93a5","score":"0.51679885","text":"@Override\n public boolean onProfileChanged(View view, IProfile profile, boolean current) {\n if (profile instanceof IDrawerItem && profile.getIdentifier() == PROFILE_SETTING) {\n int count = 100 + headerResult.getProfiles().size() + 1;\n IProfile newProfile = new ProfileDrawerItem().withNameShown(true).withName(\"Batman\" + count).withEmail(\"batman\" + count + \"@gmail.com\").withIcon(R.drawable.profile5).withIdentifier(count);\n if (headerResult.getProfiles() != null) {\n //we know that there are 2 setting elements. set the new profile above them ;)\n headerResult.addProfile(newProfile, headerResult.getProfiles().size() - 2);\n } else {\n headerResult.addProfiles(newProfile);\n }\n }\n\n //false if you have not consumed the event and it should close the drawer\n return false;\n }","title":""},{"docid":"2b1564304e23fdcffdcbfd7adf044ed0","score":"0.513904","text":"@Override\n public void actionPerformed(ActionEvent e) {\n seeUsersInHomeCity(isGuest, guidemo, sm, cmc);\n }","title":""},{"docid":"7c3b0e198f6fa01de1ab487699245d34","score":"0.5137682","text":"@Override\n\tpublic void updateAccessedWebPage() {\n\t\t\n\t}","title":""},{"docid":"8e8304043c9af6f0fc9827dc7c63ad31","score":"0.5110425","text":"void selectedProfileNicknameEdited(String oldNickname, String newNickname);","title":""},{"docid":"d4e50583564e7490bfe1cbe946679390","score":"0.5097836","text":"private void profilePanelComponentShown(java.awt.event.ComponentEvent evt) {//GEN-FIRST:event_profilePanelComponentShown\n updateProfilePanel();\n }","title":""},{"docid":"164fc83764797a1cd002c5324ac8ea16","score":"0.507752","text":"private void updateUI(FirebaseUser account){\n\n getLocationPermission();\n\n if(account != null){\n Intent intent = new Intent(this, MapsActivity.class);\n startActivity(intent);\n\n }\n\n }","title":""},{"docid":"6f87941d237af0a37a04eed86a1372e5","score":"0.50757027","text":"@FXML\n public void seeStats(ActionEvent actionEvent) {\n statsSetter();\n }","title":""},{"docid":"acd949b25796d4003c25482506c77df6","score":"0.5061032","text":"public void gotoProfile() {\n Intent intent = new Intent(this, ProfileActivity.class);\n startActivity(intent);\n }","title":""},{"docid":"c02126232d828b07979f464b1edf6c16","score":"0.5053737","text":"@Override\n\tpublic void update(PolicyArea policyArea)\n\t{\n\t\tperson.notifyPerson(policyArea.getName());\n\t}","title":""},{"docid":"f0d4d8bb03f6142929dcd8c05fad9c00","score":"0.50454247","text":"private void updateProfile() {\n profile.setKcal(Integer.parseInt(kcal.getText().toString()));\n profile.setFat(Integer.parseInt(fat.getText().toString()));\n profile.setCarbs(Integer.parseInt(carbs.getText().toString()));\n profile.setSugar(Integer.parseInt(sugar.getText().toString()));\n profile.setProtein(Integer.parseInt(protein.getText().toString()));\n\n profile.weight = Float.parseFloat(weight.getText().toString());\n profile.height = Integer.parseInt(height.getText().toString());\n profile.age = Integer.parseInt(age.getText().toString());\n profile.male = this.male.isChecked();\n\n profileViewModel.update(profile);\n }","title":""},{"docid":"72edda1c82ed566999bfdebdb0009609","score":"0.503659","text":"@FXML\r\n\tpublic void HandleProfileEvent(MouseEvent event) throws IOException {\r\n\t\tString pathtoFXML = \"C:\\\\Users\\\\Hardik\\\\Desktop\\\\Docs\\\\Eclipse\\\\PVZ\\\\src\\\\ProfileWindow.fxml\";\r\n\t\tFXMLLoader loader = new FXMLLoader();\r\n\t\tFileInputStream fxmlStream = new FileInputStream(pathtoFXML);\r\n\t\tAnchorPane root = (AnchorPane) loader.load(fxmlStream);\r\n\t\tMainMenu.mainStage.setScene(new Scene(root));\r\n\t}","title":""},{"docid":"572af9725ba3135ba316c52f8dcfb4ad","score":"0.5034967","text":"@Override\n public void actionPerformed(ActionEvent e) {\n findTheRatingForUser(isGuest, guidemo, sm, cmc, idC);\n }","title":""},{"docid":"2b9b524a4460e47436ea3671f9ffc3f2","score":"0.5032548","text":"@Override\r\n\tpublic void LibInfoManagement(ActionEvent event) {\n\t\tif (EnumAdminRole.BookManager.Cmp(null, Integer.parseInt(IMP_Login.getLoginReader().getRdAdminRoles()))) {\r\n\t\t\tback.addReturn(UI_Factory.BookIO, \"借阅管理\", 0, ops);\r\n\t\t\tUI_Factory.BookSearch.showUI(stage, \"图书信息管理\");\r\n\t\t} else {\r\n\t\t\tmessage.showMessage(\"提示\", \"您没有权限\");\r\n\t\t\tmessage.showAndWait();\r\n\t\t}\r\n\t}","title":""},{"docid":"30998a9884d3d99ed11b221470d96ed8","score":"0.50314176","text":"private void updateUI() {\n kcal.setText(\"\" + profile.getKcal());\n fat.setText(\"\" + profile.getFat());\n carbs.setText(\"\" + profile.getCarbs());\n sugar.setText(\"\" + profile.getSugar());\n protein.setText(\"\" + profile.getProtein());\n\n weight.setText(\"\" + profile.weight);\n height.setText(\"\" + profile.height);\n age.setText(\"\" + profile.age);\n male.setChecked(profile.male);\n female.setChecked(!profile.male);\n }","title":""},{"docid":"aa0fcef248d8e74d658964971c5b27e1","score":"0.5017666","text":"public void m61015a(ProfileScreenSource profileScreenSource) {\n this.profileView.a(profileScreenSource);\n }","title":""},{"docid":"2574cd1dbb7d5acc9f725723121c8950","score":"0.5015149","text":"public static void activateProfile (FileObject profile) {\n try {\n activateProfile (profile.getURL ());\n } catch (Exception ex) {\n org.openide.ErrorManager.getDefault().notify (ex);\n }\n }","title":""},{"docid":"1f7fcffe456eb6bdafb5d1e5465db68b","score":"0.50124747","text":"@Override\n public void onSuccess(UserProfile updateProfile) {\n clientCache.remove(\n originalProfile.getOwnerId() + WebConstants.USER_PROFILE_SUFFIX\n );\n // update the profile in the user session data\n authController.updateCachedProfile(originalProfile);\n setIsEditingMode(false);\n callback.invoke();\n if (goToAccountSettingsAfterSave) {\n globalAppState\n .getPlaceChanger()\n .goTo(\n new Profile(originalProfile.getOwnerId(), ProfileArea.SETTINGS)\n );\n }\n }","title":""},{"docid":"7f549e0fb960a3fb19557de2b9fabda4","score":"0.5007787","text":"public void clickProfileUser(){\n waitForElement(driver, PlatformPreviewDocumentPageUI.bntProfileUser, 10);\n clickToElement(driver, PlatformPreviewDocumentPageUI.bntProfileUser);\n sleep(3);\n switchOtherWindow(driver);\n }","title":""},{"docid":"8f1900547b1dcb8e5aa8aaad7a7fa771","score":"0.50060624","text":"@Test\n\tpublic void Profile_02() throws InterruptedException\n\t{\n\t\tProfilePage pp = PageFactory.initElements(driver, ProfilePage.class);\n\t\t\n\t\tpp.takeApicFromFolder();\n\t\t\n\t\t//Assert.assertEquals(mp.getWebViewTitle(), \"Latest Updates\",\"title is not found\");\n\t\t\n\t\t//no assertion, if this test case can thorough all step, it means passed\n\t}","title":""},{"docid":"db23fbaf0022dbb707566ff811308670","score":"0.4988316","text":"@Override\n public void updateProfileView(String[] response) {\n userProfileTitle.setText(\"Profile of: \" + response[0] + \" (\" + response[1] + \")\");\n\n if (response[1].equals(\"trial\")){\n Text t = new Text(\"Create a non-trial account to edit your profile.\");\n profileHBox.getChildren().add(t);\n }\n else{\n Button changePassword = constructPasswordChangeButton();\n profileHBox.getChildren().add(changePassword);\n }\n\n if (response[1].equals(\"admin\")){\n Button banUser = constructBanButton();\n profileHBox.getChildren().add(banUser);\n }\n\n stage.show();\n }","title":""},{"docid":"186ee2ae0938f4ea1fafdd0a8dec424b","score":"0.49779874","text":"public void bankInspectorOption(){\n viewer.sendMessageToManagerButton.addActionListener(e -> {\n viewer.changePage(viewer.inspectorOptions, viewer.sendManagerMsg);\n });\n sendMessageToManager();\n viewer.seeAllTransactionsButton.addActionListener(e -> {\n viewer.changePage(viewer.inspectorOptions, viewer.allTransactions);\n });\n seeAllTransactions();\n viewer.checkClientsAccountButton.addActionListener(e -> {\n viewer.changePage(viewer.inspectorOptions, viewer.clientSummary);\n });\n checkClientsAccount();\n viewer.moreOptionsButton.addActionListener(e -> {\n viewer.changePage(viewer.inspectorOptions, viewer.clientOptions);\n });\n clientOption();\n viewer.logOutInspector.addActionListener(e -> {\n viewer.changePage(viewer.inspectorOptions, viewer.welcomePage);\n viewer.removeAL(viewer.sendMessageToManagerButton);\n viewer.removeAL(viewer.seeAllTransactionsButton);\n viewer.removeAL(viewer.checkClientsAccountButton);\n viewer.removeAL(viewer.moreOptionsButton);\n });\n }","title":""},{"docid":"42346fbe46f87d900c79f7c4cff0f8b2","score":"0.49704775","text":"@Override\n public void actionPerformed(ActionEvent e) {\n viewFriends(isGuest, guidemo, sm, cmc);\n }","title":""},{"docid":"ac0a8031cc05d0501976bf47254df87d","score":"0.49676707","text":"void selectedProfileNicknameAdded(String nickname);","title":""},{"docid":"187e64d9369650b61f1b3d3878117c7f","score":"0.49672398","text":"private void displayProfileProvisionPromptScreen(){\n Button btnEnableMngProfile;\n Button btnSkipProfile;\n\n btnEnableMngProfile = (Button) findViewById(R.id.btnSetupWorkProfile);\n btnEnableMngProfile.setTag(TAG_BTN_ENABLE_PROFILE);\n btnEnableMngProfile.setOnClickListener(onClickListenerButtonClicked);\n\n btnSkipProfile = (Button) findViewById(R.id.btnSkipProfile);\n btnSkipProfile.setTag(TAG_BTN_SKIP_PROFILE);\n btnSkipProfile.setOnClickListener(onClickListenerButtonClicked);\n }","title":""},{"docid":"bc3ec2786351e7b32df4bfeb2a4b525c","score":"0.49660268","text":"@Override\n\t\t\tpublic void onClick(View v) {\n\t\t\t\tToast.makeText(activity, \"Profile Click\", Toast.LENGTH_SHORT)\n\t\t\t\t\t\t.show();\n\t\t\t\tshowProfile();\n\t\t\t}","title":""},{"docid":"c7463397dd899106e4fd6ad4addc8a43","score":"0.4963665","text":"@Override\n public void actionPerformed(ActionEvent e) {\n respondToFriendRequests(isGuest, guidemo, sm, cmc, idC);\n }","title":""},{"docid":"5c07053d57df2fba59c7501ed92b0e31","score":"0.4955955","text":"@Override\n\t\t\tpublic void actionPerformed(ActionEvent arg0) {\n\t\t\t\tupdate();\n\t\t\t}","title":""},{"docid":"baca8222fc1e81c2493e5e2d8c4d4c02","score":"0.4938431","text":"void onchangeAvatarButtonClicked();","title":""},{"docid":"820db79e4cc9b0544f4673f754bbad12","score":"0.49311402","text":"private void seeAllEventsAd (ActionEvent evt) {\n }","title":""},{"docid":"676ad9c8ead0bcc35b96459e8df248a0","score":"0.4930486","text":"boolean updateProfileFromLead(Profile profile);","title":""},{"docid":"f0d00b2a2d576036081cf962e5c02862","score":"0.49291098","text":"public static void activateProfile(URL profile) throws Exception {\n if (profile.equals (previousProfile)) {\n return;\n }\n INSTANCE.activate(profile);\n }","title":""},{"docid":"392fa9406fb9a832efef81c8687edf76","score":"0.49281377","text":"@Override\n \t\t\tpublic void handle(ActionEvent event) {\n \t\t\t\tUpDeviceInfo();\n \t\t\n \t\t\t\ts_QueryDeviceActivenessService.restart();\n \t\t\t}","title":""},{"docid":"ca97893b83dedb1ebb1a212dae5fe57b","score":"0.49277547","text":"ActivationListener getActiveLayerChangeListener();","title":""},{"docid":"2c0b0480244131fb05f602386442077d","score":"0.49214062","text":"public void viewProfile() {\n if (contributor == null) {\n throwArgumentContributorException();\n }\n\n Log.i(\"Infogue/Contributor\", \"View ID : \"+contributor.getId() + \" Username : \" + contributor.getUsername());\n\n Intent profileIntent = new Intent(context, ProfileActivity.class);\n profileIntent.putExtra(SessionManager.KEY_ID, contributor.getId());\n profileIntent.putExtra(SessionManager.KEY_USERNAME, contributor.getUsername());\n profileIntent.putExtra(SessionManager.KEY_NAME, contributor.getName());\n profileIntent.putExtra(SessionManager.KEY_LOCATION, contributor.getLocation());\n profileIntent.putExtra(SessionManager.KEY_ABOUT, contributor.getAbout());\n profileIntent.putExtra(SessionManager.KEY_AVATAR, contributor.getAvatar());\n profileIntent.putExtra(SessionManager.KEY_COVER, contributor.getCover());\n profileIntent.putExtra(SessionManager.KEY_STATUS, contributor.getStatus());\n profileIntent.putExtra(SessionManager.KEY_ARTICLE, contributor.getArticle());\n profileIntent.putExtra(SessionManager.KEY_FOLLOWER, contributor.getFollowers());\n profileIntent.putExtra(SessionManager.KEY_FOLLOWING, contributor.getFollowing());\n profileIntent.putExtra(SessionManager.KEY_IS_FOLLOWING, contributor.isFollowing());\n\n if (context instanceof FragmentActivity) {\n ((FragmentActivity) context).startActivityForResult(profileIntent, ProfileActivity.PROFILE_RESULT_CODE);\n } else {\n throwInstanceException();\n }\n }","title":""},{"docid":"f53074aaa910d314fe165c04d3f4f119","score":"0.4917763","text":"void update () {\n\t\tif (enterUpdate()) {\r\n\t\t\tdo {\r\n\t\t\t\tTYPE value = valueprovider.getCurrentValue();\r\n\t\t\t\tif (element != null) {\r\n\t\t\t\t\tif (iterator != null) {\r\n\t\t\t\t\t\titerator.unregisterListener(this);\r\n\t\t\t\t\t\titerator = null;\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\tif (interaction != null) {\r\n\t\t\t\t\t\tinteraction.dispose();\r\n\t\t\t\t\t\tinteraction = null;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tboolean success = false;\r\n\t\t\t\t\tdo {\r\n\t\t\t\t\t\tEvent event = engine.createInstance(eventType);\r\n\t\t\t\t\t\tif (event != null) {\r\n\t\t\t\t\t\t\tParameter param = event.getParameter(parameter);\r\n\t\t\t\t\t\t\tif (param != null) {\r\n\t\t\t\t\t\t\t\tparam.setValue(value);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\titerator = engine.getInteractions(element, event);\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tsuccess = true;\r\n\t\t\t\t\t\ttry {\r\n\t\t\t\t\t\t\titerator.registerListener(this);\r\n\t\t\t\t\t\t\tif (iterator.hasNext()) {\r\n\t\t\t\t\t\t\t\tinteraction = iterator.next();\r\n\t\t\t\t\t\t\t} \r\n\t\t\t\t\t\t} catch (InvalidStateException e) {\r\n\t\t\t\t\t\t\titerator.unregisterListener(this);\r\n\t\t\t\t\t\t\titerator.dispose();\r\n\t\t\t\t\t\t\tsuccess = false;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t} while (!success);\r\n\r\n\t\t\t\t\tif (interaction != null) {\r\n\t\t\t\t\t\tthis.setEnabled(true);\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tthis.setEnabled(false);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t} while (!leaveUpdate());\r\n\t\t}\r\n\t}","title":""},{"docid":"9805c98198cb485341d802147deec775","score":"0.49137163","text":"public void actionPerformed(ActionEvent ae)\r\n \t{\r\n \t\tthis.update();\r\n \t}","title":""},{"docid":"a191187316fa46c7b67e25ac4d3f3065","score":"0.4892956","text":"@Override\n public void onSuccessfulWikidataEdit() {\n if (wikidataP18EditListener != null) {\n wikidataP18EditListener.onWikidataEditSuccessful();\n }\n }","title":""},{"docid":"599a44919657ec10ca53bcc8a353f300","score":"0.48866296","text":"void accessReviewChangesPage();","title":""},{"docid":"cc8dc11dc38ae3ded399193a5f8322d3","score":"0.4885102","text":"private void updateUi() {\n // configure the preferences that are allowed to be modified by the user\n updatePreferenceAccessFromPowerLevel();\n\n // need to run on the UI thread to be taken into account\n // when updatePreferenceUiValues() will be performed\n getActivity().runOnUiThread(new Runnable() {\n @Override\n public void run() {\n // disable listener during preferences update, otherwise it will\n // be seen as a user action..\n enableSharedPreferenceListener(false);\n }\n });\n\n getActivity().runOnUiThread(new Runnable() {\n @Override\n public void run() {\n // set settings UI values\n updatePreferenceUiValues();\n\n // re enable preferences listener..\n enableSharedPreferenceListener(true);\n }\n });\n }","title":""},{"docid":"bf7ae40ce177b0d9a48ea383573477b3","score":"0.48745114","text":"@Override\n public void actionPerformed(ActionEvent ae) {\n //\n // \"OK\" - Switch to the selected account\n // \"cancel\" - Cancel the request\n //\n try {\n String action = ae.getActionCommand();\n switch (action) {\n case \"ok\":\n String account = (String)accountField.getSelectedItem();\n if (account != null)\n account = account.toUpperCase().trim();\n if (account == null || account.length() == 0) {\n JOptionPane.showMessageDialog(this, \"No account selected\", \"Error\",\n JOptionPane.ERROR_MESSAGE);\n } else {\n if (account.startsWith(\"NXT-\")) {\n accountId = Utils.parseAccountRsId(account);\n } else {\n accountId = Long.parseUnsignedLong(account);\n }\n }\n setVisible(false);\n dispose();\n break;\n case \"cancel\":\n setVisible(false);\n dispose();\n break;\n }\n } catch (NumberFormatException | IdentifierException exc) {\n JOptionPane.showMessageDialog(this, \"Invalid account\", \"Error\", JOptionPane.ERROR_MESSAGE);\n } catch (Exception exc) {\n Main.log.error(\"Exception while processing action event\", exc);\n Main.logException(\"Exception while processing action event\", exc);\n }\n }","title":""},{"docid":"6c7fbd5f5fcaf6d700dd1ad650907e8a","score":"0.4871531","text":"@FXML\n public void Profil(ActionEvent event) throws IOException {\n AnchorPane pane = FXMLLoader.load(getClass().getResource(\"ProfilPage.fxml\"));\n ANchorProfil.getChildren().setAll(pane);\n \n }","title":""},{"docid":"4b008664715ee9ea1fe2f71a5bc98780","score":"0.4869081","text":"private void viewProfile() {\n Doctor doctor = doctors.get(LIST_ITEM_POSITION);\n Intent t = new Intent(context, ProfileActivity.class);\n t.putExtra(INTENT_EXTRA, doctor);\n startActivity(t);\n }","title":""},{"docid":"034458fbc5387d788f976aadcc2bb06d","score":"0.48654684","text":"void onActivate(MainController controller, Display display);","title":""},{"docid":"b1f39239204a5b94f755580b20cfb4fc","score":"0.4864196","text":"void fireEvent(int type, Profile profile) throws RemoteException;","title":""},{"docid":"a50565ceece43585c0ec29bc634ce083","score":"0.4852321","text":"void updatePolicy(State state, Action action);","title":""},{"docid":"591bda65ebd623ed46abd3313c01028d","score":"0.48441088","text":"@Override\n public void actionPerformed(ActionEvent e) {\n writeAReview(isGuest, guidemo, sm, idC, cmc);\n }","title":""},{"docid":"39dd5386121ba71cb8d0942712c93246","score":"0.48430842","text":"public abstract void clickStatusUpdateTextField();","title":""},{"docid":"2ef36b1ece59347a9f17e1534434371d","score":"0.48383483","text":"@Override\n protected void beforeActivityLaunched(){\n PC = new ProfileController();\n AC = new AccountController();\n }","title":""},{"docid":"ebe70524358733095db5ede64d81fd22","score":"0.4838022","text":"@Override\r\n\tpublic void changedUpdate(DocumentEvent e) {\n\t\tupdateButtonEnabledStatus(loginButton, text);\r\n\r\n\t}","title":""},{"docid":"3f310306a2be7779730d043c57be5348","score":"0.4832128","text":"@Override\n public void actionPerformed(ActionEvent e) {\n update();\n }","title":""},{"docid":"a58d91ab1d078ac6affd1388bc4114f2","score":"0.48247713","text":"@Override\n protected void onCurrentProfileChanged(Profile profile, Profile profile2) {\n Log.v(\"facebook - profile\", profile2.getFirstName());\n sessionWritter(profile2);\n mProfileTracker.stopTracking();\n }","title":""},{"docid":"d17583dc32e85d68e72fed7952390316","score":"0.4820452","text":"public void onProfileClick(View v) {\n\t\tIntent intent = new Intent(this, EditProfile.class);\n\t\tString message;\n\n\t\tRelativeLayout l2 = (RelativeLayout) v;\n\t\tTextView tvPname = (TextView) l2.getChildAt(0);\n\t\tmessage = tvPname.getText().toString();\n\t\tintent.putExtra(EXTRA_MESSAGE, message);\n\t\tstartActivity(intent);\n\t}","title":""},{"docid":"5ed2993fae02c29a80dcd45bebf7e198","score":"0.48163754","text":"void accessUserPemissionsPage();","title":""},{"docid":"36049375ac218c3581272bd5414fff41","score":"0.4814716","text":"@Test\n\tpublic void Profile_01() throws InterruptedException\n\t{\n\t\tProfilePage pp = PageFactory.initElements(driver, ProfilePage.class);\n\t\t\n\t\tpp.takeAPicFromCamera();\n\t\t\n\t\t//Assert.assertEquals(mp.getWebViewTitle(), \"Latest Updates\",\"title is not found\");\n\t\t\n\t\t//no assertion, if this test case can thorough all step, it means passed\n\t}","title":""},{"docid":"ef97f34b5376f70d824f2b907fb8d1ec","score":"0.4813768","text":"void selectedProfileHighlightAdded(String highlight);","title":""},{"docid":"adc57c6b1d673791101f4d8a70f15123","score":"0.4813006","text":"@Override\n public void updateNicProfile(final NicProfile profile, final Network network) {\n\n }","title":""},{"docid":"30361a1fc8e6b9f12bd62df2055f79df","score":"0.48019457","text":"public void onEditProfileClicked(View v){\n editProfileImageView.setVisibility(View.INVISIBLE);\n confirmButton.setVisibility(View.VISIBLE);\n cancelButton.setVisibility(View.VISIBLE);\n isInEditMode = true;\n toggleEditable(nameEditText);\n toggleEditable(gpaEditText);\n toggleEditable(bioEditText);\n toggleEditable(interestsEditText);\n toggleEditable(emailEditText);\n //do NOT toggleEditable(coursesEditText)\n //only edit courses through the edit courses screen\n }","title":""},{"docid":"9aa8ff37142765f4b636943740159f80","score":"0.47947302","text":"@SuppressLint(\"SetTextI18n\")\n private void updateProfileData() {\n Drawable avatar =\n AppCompatResources.getDrawable(getActivity(), R.drawable.logo_avatar_anonymous);\n mView.getAccountImageView().setImageDrawable(avatar);\n mConsentTextTracker.setTextNonRecordable(mView.getAccountNameView(), \"John Doe\");\n mConsentTextTracker.setTextNonRecordable(\n mView.getAccountEmailView(), \"john.doe@example.com\");\n }","title":""},{"docid":"ead8cf36078cef56f5029bf62d3b2600","score":"0.47926813","text":"public void onProfileView(MenuItem item) {\n Intent i = new Intent(this, ProfileActivity.class);\n startActivity(i);\n }","title":""},{"docid":"ead8cf36078cef56f5029bf62d3b2600","score":"0.47926813","text":"public void onProfileView(MenuItem item) {\n Intent i = new Intent(this, ProfileActivity.class);\n startActivity(i);\n }","title":""},{"docid":"915a1bb4c72b3826cfdb8a6149fd38c6","score":"0.47828078","text":"public abstract void goToStatusUpdate();","title":""},{"docid":"cbc8fe3d92579cbdc619c8c50b3b0d48","score":"0.4782307","text":"@Override\r\n\tpublic void onAdhocStateUpdated(AdhocStateEnum state, String info) {\n\t\t\r\n\t}","title":""},{"docid":"b0a0da39034b90826ced1349e1d35682","score":"0.47804737","text":"private void addRateUsEvent() {\n /*09th July 2019, Resolved Pyze library issue*/\n HashMap<String, Object> customattributes = new HashMap<String, Object>();\n customattributes.put(\"RateUsMenu\", \"Clicked\");\n\n if (isNavigationScreenActive)\n PyzeEvents.postCustomEventWithAttributes(\"Rated_Users\", customattributes);\n }","title":""},{"docid":"9d10de01608e981f7b8d1389762fdaa4","score":"0.47772726","text":"void updateEventAttendees(Event evt);","title":""},{"docid":"9ae7f1816d6b7fa6b88807e041848e67","score":"0.4766224","text":"private void updateUI() {\n // Update score panel\n window.getScorePanel().updateScore(game.getTime());\n\n // Update cooldown timers\n window.getAbilityBar().updateAbilities(game.getCurrentLevel().getPlayer().getAbilities());\n }","title":""}],"string":"[\n {\n \"docid\": \"872add5b83229a399098991fc67e430d\",\n \"score\": \"0.63148534\",\n \"text\": \"void profileEdited(MutableProfile profile);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c919ac5c2c1cefafdea8c5891b0e6983\",\n \"score\": \"0.6112209\",\n \"text\": \"public void handleUpdateProfilePanel() {\\n updateProfilePanels();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bfbdad391b7fce59fb341cdf988e2d55\",\n \"score\": \"0.59467167\",\n \"text\": \"private void button_showProfileActionPerformed(ActionEvent e) {\\n\\t\\tMain1.profileScreen();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"269ce268c7dc95722fcd8131eaf515fd\",\n \"score\": \"0.58746266\",\n \"text\": \"public void userProfile(ActionEvent event)\\n {\\n try\\n {\\n ViewLoader view = new ViewLoader(Context.getInstance().getDisplayView());\\n view.loadView(\\\"UserProfile\\\");\\n }\\n catch (Exception ex)\\n {\\n Logger.getLogger(HomeViewController.class.getName()).log(Level.SEVERE, null, ex);\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f0c82c0cd67c898dd2e20b50ff575da\",\n \"score\": \"0.5851635\",\n \"text\": \"public void handleProfileChanged() {\\n updateProfilePanels();\\n clearDateLabel();\\n clearCaloriePanels();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f27918b9a3cf3d38cfa1f117f91f7e2\",\n \"score\": \"0.5696775\",\n \"text\": \"public void onAccessibilityEvent(AccessibilityEvent event);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"93001c9276dd6ecfce95fb8f4dfce440\",\n \"score\": \"0.56948215\",\n \"text\": \"public void clickProfile() {\\n\\n\\t\\ttry {\\n\\t\\t\\tTestLog.log.info(\\\"Clicking Profile\\\");\\n\\t\\t\\tdrpProfileOption.click();\\n\\t\\t\\tTestLog.log.info(\\\"Clicked\\\");\\n\\n\\t\\t} catch (Exception ex) {\\n\\t\\t\\tSystem.out.println(\\\"Clicking Profile failed\\\");\\n\\t\\t}\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a77530078db15551dfd3fb600f545f4\",\n \"score\": \"0.5669357\",\n \"text\": \"@Override\\n public boolean onProfileChanged(View view, IProfile profile, boolean current) {\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5bcd635dc2ec075b13b8fe71acb701e8\",\n \"score\": \"0.5635232\",\n \"text\": \"@Override\\n public void actionPerformed(ActionEvent event) {\\n FileChooser chooser = Platform.getPlatform().getFileChooser();\\n AlertDialog alert = Platform.getPlatform().getAlertDialog();\\n String path;\\n if (text.isEnabled()) {\\n path = text.getText();\\n }\\n else {\\n path = System.getProperty(\\\"user.home\\\");\\n }\\n File file = new File(path);\\n file = chooser.openFile(\\n LOCALE.get(\\\"DisplayProfileDialogTitle\\\"), file, null, null\\n );\\n if (file != null) {\\n if (! file.isFile()) {\\n alert.showAlert(\\n null,\\n '\\\\\\\"' + file.getName() + \\\"\\\\\\\" is not a file.\\\",\\n \\\"A color profile is a file, \\\" +\\n \\\"usually ending with \\\\\\\".icc\\\\\\\" or \\\\\\\".icm\\\\\\\".\\\",\\n AlertDialog.WARNING_ALERT,\\n \\\"OK\\\"\\n );\\n return;\\n }\\n try {\\n ICC_Profile.getInstance(file.getAbsolutePath());\\n }\\n catch (IOException e) {\\n alert.showAlert(\\n null,\\n '\\\\\\\"' + file.getName() + \\\"\\\\\\\" could not be read.\\\",\\n e.getClass().getName() + \\\": \\\" + e.getMessage(),\\n AlertDialog.WARNING_ALERT,\\n \\\"OK\\\"\\n );\\n return;\\n }\\n catch (IllegalArgumentException e) {\\n alert.showAlert(\\n null,\\n '\\\\\\\"' + file.getName() + \\\"\\\\\\\" is not a valid color profile.\\\",\\n e.getClass().getName() + \\\": \\\" + e.getMessage(),\\n AlertDialog.WARNING_ALERT,\\n \\\"OK\\\"\\n );\\n return;\\n }\\n path = file.getAbsolutePath();\\n text.setText(path);\\n text.setEnabled(true);\\n alert.showAlert(\\n null,\\n \\\"Display color profile \\\\\\\"\\\" + file.getName() + \\\"\\\\\\\" accepted.\\\",\\n \\\"You must now restart LightZone for your new display \\\" +\\n \\\"profile to take effect.\\\",\\n AlertDialog.WARNING_ALERT,\\n \\\"OK\\\"\\n );\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7924620fd948d98817b0b7973b66d553\",\n \"score\": \"0.55586576\",\n \"text\": \"public void click_profileLink() {\\n\\tprofileLink.click();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75831a5963ddab9dbfabee3ccfcdbaa6\",\n \"score\": \"0.5529457\",\n \"text\": \"void updateProfilePanels() {\\n profileCardPanel.update(logic.getMyFitnessBuddy().getPerson());\\n profileListPanel.update(logic.getFilteredPersonList());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e57c872a934986990bcf860c063f7268\",\n \"score\": \"0.55071294\",\n \"text\": \"public void registraAssociatedProfileController(MenuController mc){\\n jbEditProfile.addActionListener(mc);\\n jbEditProfile.setActionCommand(\\\"EDIT\\\");\\n\\n jbAccountPreferences.addActionListener(mc);\\n jbAccountPreferences.setActionCommand(\\\"ACCOUNT PREFERENCES\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"207d6dd7aff9c330a1dd9bd94c015180\",\n \"score\": \"0.5504887\",\n \"text\": \"void profileAdded(MutableProfile profile);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec06377a2608a570408884331b98d3bd\",\n \"score\": \"0.54627347\",\n \"text\": \"public void actionPerformed(ActionEvent e) {\\n\\t\\tObject source = e.getSource();\\n\\t\\tif (source == addButton) {\\t\\n\\t\\t\\tif (faceDB.containsProfile(nameField.getText())) {\\n\\t\\t\\t\\tFacePamphletProfile profile = new FacePamphletProfile(nameField.getText());\\n\\t\\t\\t\\tfaceDB.addProfile(profile);\\n\\t\\t\\t\\tprintln(\\\"Add: profile for \\\" + nameField.getText() + \\\" already exists: \\\" + faceDB.getProfile(nameField.getText()).toString());\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tFacePamphletProfile profile = new FacePamphletProfile(nameField.getText());\\n\\t\\t\\t\\tfaceDB.addProfile(profile);\\n\\t\\t\\t\\tprintln(\\\"Add: new profile: \\\" + faceDB.getProfile(nameField.getText()).toString());\\n\\t\\t\\t}\\n\\t\\t} else if (source == deleteButton) {\\n\\t\\t\\tif (faceDB.containsProfile(nameField.getText())) {\\n\\t\\t\\t\\tfaceDB.deleteProfile(nameField.getText());\\n\\t\\t\\t\\tprintln(\\\"Delete: profile of \\\" + nameField.getText() + \\\" deleted\\\");\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tprintln(\\\"Delete: profile with name \\\" + nameField.getText() + \\\" does not exist\\\");\\n\\t\\t\\t}\\n\\t\\t} else if (source == lookupButton) {\\n\\t\\t\\tif (faceDB.containsProfile(nameField.getText())) {\\n\\t\\t\\t\\tprintln(\\\"Lookup: \\\" + faceDB.getProfile(nameField.getText()).toString());\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tprintln(\\\"Lookup: profile with name \\\" + nameField.getText() + \\\" does not exist\\\");\\n\\t\\t\\t}\\n\\t\\t} else if (source == changeStatusButton || source == changeStatusField) {\\n\\t\\t\\tprintln(\\\"Change Status: \\\" + changeStatusField.getText());\\n\\t\\t} else if (source == changePictureButton || source == changePictureField) {\\n\\t\\t\\tprintln(\\\"Change Picture: \\\" + changePictureField.getText());\\n\\t\\t} else if (source == addFriendButton || source == addFriendField) {\\n\\t\\t\\tprintln(\\\"Add Friend: \\\" + addFriendField.getText());\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b64919c542e7eaf2bd12c977a7156c0f\",\n \"score\": \"0.5397815\",\n \"text\": \"public void enterProfilePage() {\\r\\n\\t\\tclick(lnkUserProfile);\\r\\n\\t\\tclick(btnMyAccount);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a59afface0b42f0ac4301d7f425f0e0\",\n \"score\": \"0.53834844\",\n \"text\": \"@Override\\n public void actionPerformed(ActionEvent e) {\\n reportAUser(isGuest, guidemo, sm, idC, cmc);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48e52dfe64c67ee7625b427c1160c000\",\n \"score\": \"0.5365094\",\n \"text\": \"private void updateProfilePanel() {\\n //System.out.println(\\\"Profile Panel Shown\\\");\\n firstNameProfileLabel.setText(\\\"First Name: Haibo\\\");\\n lastNameProfileLabel.setText(\\\"Last Name: Zeng\\\");\\n emailProfileLabel.setText(\\\"Email: \\\" + clientRequest.getEmail());\\n usernameProfileLabel.setText(\\\"Username: \\\" + clientRequest.getUsername());\\n accountNumberProfileLabel.setText(clientRequest.getAccountNumber());\\n fundsProfileLabel.setText(\\\"$324345\\\");\\n try {\\n numberOfChipsProfileLabel.setText(clientRequest.getUsersWorth(clientRequest.getUsername()));\\n } catch (RemoteException ex) {} catch (SQLException ex) {}\\n ipProfileLabel.setText(GUIClient.getIp());\\n\\n avatarProfileLabel.setIcon(clientRequest.getAvatar(clientRequest.getUsername()));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e30e3929d80eec168efcf3cb00b8773f\",\n \"score\": \"0.5337776\",\n \"text\": \"public AccessibilityProfile getAccessibilityProfile()\\n {\\n return _accProfile;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"440fa296633cce5c6c5e14ade3665ba2\",\n \"score\": \"0.5326488\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void actionPerformed(ActionEvent arg0) {\\n\\t\\t\\t\\tBeanResources.getInstance().accountManager(null);\\n\\n\\t\\t\\t\\t// change panel\\n\\t\\t\\t\\tGUIManager.addWelcomeToFrame();\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e9aedee7a7df7f4b73f21466fc18bb5\",\n \"score\": \"0.53223133\",\n \"text\": \"void profileSelectionChanged(Optional<MutableProfile> profile);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cf772243d69a01ffd1520be8fa22bd67\",\n \"score\": \"0.53207034\",\n \"text\": \"public void doProfilesUpdate() {\\r\\n\\t\\tLog.d(TAG, \\\"Do profile update\\\");\\r\\n\\t\\tthis.profileAdapter.clear();\\r\\n\\t\\tfor (RouterProfile routerProfile : this.routerPreferencesHandler.getRouterProfiles()) {\\r\\n\\t\\t\\tLog.d(TAG, \\\"Adding Profile to adapter: \\\" + routerProfile);\\r\\n\\t\\t\\tthis.profileAdapter.add(routerProfile);\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tif (!profileAdapter.isEmpty())\\r\\n\\t\\t\\tthis.emptyProfilesTextView.setVisibility(View.GONE);\\r\\n\\r\\n\\t\\tthis.profileAdapter.notifyDataSetChanged();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52e16ea6f3ccd80404d065c5df4cea4e\",\n \"score\": \"0.53153217\",\n \"text\": \"public void sceneProfile(ActionEvent event) {\\n ChangeScene.change(event, \\\"/Scenes/Profile.fxml\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"814a513e2c9d44f084f5717b73db638b\",\n \"score\": \"0.5308236\",\n \"text\": \"@Override\\n\\tpublic void onUserProfileUpdate(User arg0) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e3b105d4412dd5cc3feb40fd888d9df0\",\n \"score\": \"0.5301436\",\n \"text\": \"protected void eventDeviceAccess(GCFNumber pimmgr_id, GCFEnum access_type, GCFString profile) throws MessageBrokerException\\n {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d49abd94d3ea4dd234b46ff3f27865ec\",\n \"score\": \"0.5298893\",\n \"text\": \"@Override\\n public void apply() {\\n SwingUtil.setEnabled(chckbxmntmToggleSidebar.isSelected(), chckbxmntmToggleActionButtons, chckbxmntmToggleAvailableProfiles);\\n\\n // West JPanel - Toggled by the 'Toggle Sidebar' menu item.\\n SwingUtil.setVisible(chckbxmntmToggleSidebar.isSelected(), westJPanel);\\n\\n // Available Profiles - Only when the menu item is selected.\\n SwingUtil.setVisible(chckbxmntmToggleAvailableProfiles.isSelected(), availableProfilesJList);\\n\\n // Action Buttons - Only when the menu item is selected.\\n SwingUtil.setVisible(chckbxmntmToggleActionButtons.isSelected(), availableProfilesNorthButtonJPanel);\\n\\n // Action Buttons & File Menu\\n // - New Profile - always available\\n // - Load, Delete Profile - Only if a profile is selected\\n final boolean isAProfileSelected = availableProfilesJList.getSelectedIndex() >= 0;\\n SwingUtil.setEnabled(isAProfileSelected, loadProfileJButton, deleteProfileJButton, mntmLoadProfile, mntmDeleteProfile);\\n\\n // Action Buttons - New Password, Close Profile - Only if a profile is active (not the default)\\n final boolean isAProfileActive = activeProfile.isNotDefault();\\n SwingUtil.setEnabled(isAProfileActive, closeProfileJButton, mntmCloseProfile, newPasswordJBbutton);\\n\\n // Action Buttons - View, Edit, Delete Password - Only if a password is selected\\n final boolean isAPasswordSelected = storedPasswordsJTable.getSelectedRow() >= 0;\\n SwingUtil.setEnabled(isAPasswordSelected, viewPasswordJButton, editPasswordJButton, deletePasswordJButton, mntmViewPassword, mntmEditPassword, mntmDeletePassword);\\n\\n // - Delete Database - Only if menu item in Edit is enabled.\\n SwingUtil.setEnabled(chckbxmntmEnableDeleteDatabase.isSelected(), deleteDatabaseJButton);\\n\\n // - Update the active profile text to match the current profile\\n activeProfileJLabel.setText(activeProfile.get().getProfileName());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0b092f42b63e670a8b93ec76a408e91\",\n \"score\": \"0.52984315\",\n \"text\": \"public void addCreateProfileListener(EventHandler<ActionEvent> handler) {\\n\\t\\tcrtProfile.setOnAction(handler);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a402783b1d6742d0719213e5e6030b1d\",\n \"score\": \"0.52770823\",\n \"text\": \"public void onShowAchievementsRequested() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e39ea4d9306d44ef752a9580a019fbb\",\n \"score\": \"0.52640504\",\n \"text\": \"public final void updateAccessStatistics() {\\r\\n elementEvictionData.updateLastAccessTime(System.currentTimeMillis(), this);\\r\\n HIT_COUNT_UPDATER.incrementAndGet(this);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"903478f6bc66718dc330895a9e5d3300\",\n \"score\": \"0.5211879\",\n \"text\": \"@Override\\n public void updateNetworkProfile(final NetworkProfile networkProfile) {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa800ab706ad143fa017c23ebabbe222\",\n \"score\": \"0.52089405\",\n \"text\": \"@Override\\n public void update(@NotNull AnActionEvent event) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b4b4471c2522999656bc4554d7f4c1d\",\n \"score\": \"0.5200406\",\n \"text\": \"@Override\\n public void onUserProfileUpdate(User arg0) {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3bc93936751c452558ad4c1a2c1f27cc\",\n \"score\": \"0.51849306\",\n \"text\": \"private void button_adv_userInfoActionPerformed(ActionEvent e) {\\n\\t\\tMain1.myDetailsScreen();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a2cbb27e165f140b23b5af9cba832fa5\",\n \"score\": \"0.51833713\",\n \"text\": \"@Override\\n public void onProfileSelected(User user) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03e5b3807116344852c7f579b94cb5a7\",\n \"score\": \"0.5174885\",\n \"text\": \"@Override\\r\\n\\t\\tpublic void actionPerformed(ActionEvent arg0) {\\n\\t\\t\\tSystem.out.println(\\\"Im called\\\");\\r\\n\\t\\t\\tUserProfile userProfile = new UserProfile();\\r\\n\\t\\t\\tuserProfile.setName(txtName.getText());\\r\\n\\t\\t\\tuserProfile.setAge(Integer.parseInt(txtAge.getText()));\\r\\n\\t\\t\\tuserProfile.setUsername(txtUsername.getText());\\r\\n\\t\\t\\tsaveUser(userProfile);\\r\\n\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4f7456e23c13590425151bc5837ac1c\",\n \"score\": \"0.5168435\",\n \"text\": \"@Test(priority =4)\\n\\tpublic void myProfileUpdate() throws InterruptedException {\\n\\t\\thomePage.myProfileUpdate();\\n\\t\\tMyProfilePage myprofile = new MyProfilePage();\\n\\t\\tmyprofile.personalDetails();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4b9d7e42d7f55a070fe6a7ec15f93a5\",\n \"score\": \"0.51679885\",\n \"text\": \"@Override\\n public boolean onProfileChanged(View view, IProfile profile, boolean current) {\\n if (profile instanceof IDrawerItem && profile.getIdentifier() == PROFILE_SETTING) {\\n int count = 100 + headerResult.getProfiles().size() + 1;\\n IProfile newProfile = new ProfileDrawerItem().withNameShown(true).withName(\\\"Batman\\\" + count).withEmail(\\\"batman\\\" + count + \\\"@gmail.com\\\").withIcon(R.drawable.profile5).withIdentifier(count);\\n if (headerResult.getProfiles() != null) {\\n //we know that there are 2 setting elements. set the new profile above them ;)\\n headerResult.addProfile(newProfile, headerResult.getProfiles().size() - 2);\\n } else {\\n headerResult.addProfiles(newProfile);\\n }\\n }\\n\\n //false if you have not consumed the event and it should close the drawer\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b1564304e23fdcffdcbfd7adf044ed0\",\n \"score\": \"0.513904\",\n \"text\": \"@Override\\n public void actionPerformed(ActionEvent e) {\\n seeUsersInHomeCity(isGuest, guidemo, sm, cmc);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c3b0e198f6fa01de1ab487699245d34\",\n \"score\": \"0.5137682\",\n \"text\": \"@Override\\n\\tpublic void updateAccessedWebPage() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e8304043c9af6f0fc9827dc7c63ad31\",\n \"score\": \"0.5110425\",\n \"text\": \"void selectedProfileNicknameEdited(String oldNickname, String newNickname);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4e50583564e7490bfe1cbe946679390\",\n \"score\": \"0.5097836\",\n \"text\": \"private void profilePanelComponentShown(java.awt.event.ComponentEvent evt) {//GEN-FIRST:event_profilePanelComponentShown\\n updateProfilePanel();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"164fc83764797a1cd002c5324ac8ea16\",\n \"score\": \"0.507752\",\n \"text\": \"private void updateUI(FirebaseUser account){\\n\\n getLocationPermission();\\n\\n if(account != null){\\n Intent intent = new Intent(this, MapsActivity.class);\\n startActivity(intent);\\n\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f87941d237af0a37a04eed86a1372e5\",\n \"score\": \"0.50757027\",\n \"text\": \"@FXML\\n public void seeStats(ActionEvent actionEvent) {\\n statsSetter();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"acd949b25796d4003c25482506c77df6\",\n \"score\": \"0.5061032\",\n \"text\": \"public void gotoProfile() {\\n Intent intent = new Intent(this, ProfileActivity.class);\\n startActivity(intent);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c02126232d828b07979f464b1edf6c16\",\n \"score\": \"0.5053737\",\n \"text\": \"@Override\\n\\tpublic void update(PolicyArea policyArea)\\n\\t{\\n\\t\\tperson.notifyPerson(policyArea.getName());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0d4d8bb03f6142929dcd8c05fad9c00\",\n \"score\": \"0.50454247\",\n \"text\": \"private void updateProfile() {\\n profile.setKcal(Integer.parseInt(kcal.getText().toString()));\\n profile.setFat(Integer.parseInt(fat.getText().toString()));\\n profile.setCarbs(Integer.parseInt(carbs.getText().toString()));\\n profile.setSugar(Integer.parseInt(sugar.getText().toString()));\\n profile.setProtein(Integer.parseInt(protein.getText().toString()));\\n\\n profile.weight = Float.parseFloat(weight.getText().toString());\\n profile.height = Integer.parseInt(height.getText().toString());\\n profile.age = Integer.parseInt(age.getText().toString());\\n profile.male = this.male.isChecked();\\n\\n profileViewModel.update(profile);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"72edda1c82ed566999bfdebdb0009609\",\n \"score\": \"0.503659\",\n \"text\": \"@FXML\\r\\n\\tpublic void HandleProfileEvent(MouseEvent event) throws IOException {\\r\\n\\t\\tString pathtoFXML = \\\"C:\\\\\\\\Users\\\\\\\\Hardik\\\\\\\\Desktop\\\\\\\\Docs\\\\\\\\Eclipse\\\\\\\\PVZ\\\\\\\\src\\\\\\\\ProfileWindow.fxml\\\";\\r\\n\\t\\tFXMLLoader loader = new FXMLLoader();\\r\\n\\t\\tFileInputStream fxmlStream = new FileInputStream(pathtoFXML);\\r\\n\\t\\tAnchorPane root = (AnchorPane) loader.load(fxmlStream);\\r\\n\\t\\tMainMenu.mainStage.setScene(new Scene(root));\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"572af9725ba3135ba316c52f8dcfb4ad\",\n \"score\": \"0.5034967\",\n \"text\": \"@Override\\n public void actionPerformed(ActionEvent e) {\\n findTheRatingForUser(isGuest, guidemo, sm, cmc, idC);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b9b524a4460e47436ea3671f9ffc3f2\",\n \"score\": \"0.5032548\",\n \"text\": \"@Override\\r\\n\\tpublic void LibInfoManagement(ActionEvent event) {\\n\\t\\tif (EnumAdminRole.BookManager.Cmp(null, Integer.parseInt(IMP_Login.getLoginReader().getRdAdminRoles()))) {\\r\\n\\t\\t\\tback.addReturn(UI_Factory.BookIO, \\\"借阅管理\\\", 0, ops);\\r\\n\\t\\t\\tUI_Factory.BookSearch.showUI(stage, \\\"图书信息管理\\\");\\r\\n\\t\\t} else {\\r\\n\\t\\t\\tmessage.showMessage(\\\"提示\\\", \\\"您没有权限\\\");\\r\\n\\t\\t\\tmessage.showAndWait();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"30998a9884d3d99ed11b221470d96ed8\",\n \"score\": \"0.50314176\",\n \"text\": \"private void updateUI() {\\n kcal.setText(\\\"\\\" + profile.getKcal());\\n fat.setText(\\\"\\\" + profile.getFat());\\n carbs.setText(\\\"\\\" + profile.getCarbs());\\n sugar.setText(\\\"\\\" + profile.getSugar());\\n protein.setText(\\\"\\\" + profile.getProtein());\\n\\n weight.setText(\\\"\\\" + profile.weight);\\n height.setText(\\\"\\\" + profile.height);\\n age.setText(\\\"\\\" + profile.age);\\n male.setChecked(profile.male);\\n female.setChecked(!profile.male);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa0fcef248d8e74d658964971c5b27e1\",\n \"score\": \"0.5017666\",\n \"text\": \"public void m61015a(ProfileScreenSource profileScreenSource) {\\n this.profileView.a(profileScreenSource);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2574cd1dbb7d5acc9f725723121c8950\",\n \"score\": \"0.5015149\",\n \"text\": \"public static void activateProfile (FileObject profile) {\\n try {\\n activateProfile (profile.getURL ());\\n } catch (Exception ex) {\\n org.openide.ErrorManager.getDefault().notify (ex);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7fcffe456eb6bdafb5d1e5465db68b\",\n \"score\": \"0.50124747\",\n \"text\": \"@Override\\n public void onSuccess(UserProfile updateProfile) {\\n clientCache.remove(\\n originalProfile.getOwnerId() + WebConstants.USER_PROFILE_SUFFIX\\n );\\n // update the profile in the user session data\\n authController.updateCachedProfile(originalProfile);\\n setIsEditingMode(false);\\n callback.invoke();\\n if (goToAccountSettingsAfterSave) {\\n globalAppState\\n .getPlaceChanger()\\n .goTo(\\n new Profile(originalProfile.getOwnerId(), ProfileArea.SETTINGS)\\n );\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f549e0fb960a3fb19557de2b9fabda4\",\n \"score\": \"0.5007787\",\n \"text\": \"public void clickProfileUser(){\\n waitForElement(driver, PlatformPreviewDocumentPageUI.bntProfileUser, 10);\\n clickToElement(driver, PlatformPreviewDocumentPageUI.bntProfileUser);\\n sleep(3);\\n switchOtherWindow(driver);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8f1900547b1dcb8e5aa8aaad7a7fa771\",\n \"score\": \"0.50060624\",\n \"text\": \"@Test\\n\\tpublic void Profile_02() throws InterruptedException\\n\\t{\\n\\t\\tProfilePage pp = PageFactory.initElements(driver, ProfilePage.class);\\n\\t\\t\\n\\t\\tpp.takeApicFromFolder();\\n\\t\\t\\n\\t\\t//Assert.assertEquals(mp.getWebViewTitle(), \\\"Latest Updates\\\",\\\"title is not found\\\");\\n\\t\\t\\n\\t\\t//no assertion, if this test case can thorough all step, it means passed\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db23fbaf0022dbb707566ff811308670\",\n \"score\": \"0.4988316\",\n \"text\": \"@Override\\n public void updateProfileView(String[] response) {\\n userProfileTitle.setText(\\\"Profile of: \\\" + response[0] + \\\" (\\\" + response[1] + \\\")\\\");\\n\\n if (response[1].equals(\\\"trial\\\")){\\n Text t = new Text(\\\"Create a non-trial account to edit your profile.\\\");\\n profileHBox.getChildren().add(t);\\n }\\n else{\\n Button changePassword = constructPasswordChangeButton();\\n profileHBox.getChildren().add(changePassword);\\n }\\n\\n if (response[1].equals(\\\"admin\\\")){\\n Button banUser = constructBanButton();\\n profileHBox.getChildren().add(banUser);\\n }\\n\\n stage.show();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"186ee2ae0938f4ea1fafdd0a8dec424b\",\n \"score\": \"0.49779874\",\n \"text\": \"public void bankInspectorOption(){\\n viewer.sendMessageToManagerButton.addActionListener(e -> {\\n viewer.changePage(viewer.inspectorOptions, viewer.sendManagerMsg);\\n });\\n sendMessageToManager();\\n viewer.seeAllTransactionsButton.addActionListener(e -> {\\n viewer.changePage(viewer.inspectorOptions, viewer.allTransactions);\\n });\\n seeAllTransactions();\\n viewer.checkClientsAccountButton.addActionListener(e -> {\\n viewer.changePage(viewer.inspectorOptions, viewer.clientSummary);\\n });\\n checkClientsAccount();\\n viewer.moreOptionsButton.addActionListener(e -> {\\n viewer.changePage(viewer.inspectorOptions, viewer.clientOptions);\\n });\\n clientOption();\\n viewer.logOutInspector.addActionListener(e -> {\\n viewer.changePage(viewer.inspectorOptions, viewer.welcomePage);\\n viewer.removeAL(viewer.sendMessageToManagerButton);\\n viewer.removeAL(viewer.seeAllTransactionsButton);\\n viewer.removeAL(viewer.checkClientsAccountButton);\\n viewer.removeAL(viewer.moreOptionsButton);\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"42346fbe46f87d900c79f7c4cff0f8b2\",\n \"score\": \"0.49704775\",\n \"text\": \"@Override\\n public void actionPerformed(ActionEvent e) {\\n viewFriends(isGuest, guidemo, sm, cmc);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac0a8031cc05d0501976bf47254df87d\",\n \"score\": \"0.49676707\",\n \"text\": \"void selectedProfileNicknameAdded(String nickname);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"187e64d9369650b61f1b3d3878117c7f\",\n \"score\": \"0.49672398\",\n \"text\": \"private void displayProfileProvisionPromptScreen(){\\n Button btnEnableMngProfile;\\n Button btnSkipProfile;\\n\\n btnEnableMngProfile = (Button) findViewById(R.id.btnSetupWorkProfile);\\n btnEnableMngProfile.setTag(TAG_BTN_ENABLE_PROFILE);\\n btnEnableMngProfile.setOnClickListener(onClickListenerButtonClicked);\\n\\n btnSkipProfile = (Button) findViewById(R.id.btnSkipProfile);\\n btnSkipProfile.setTag(TAG_BTN_SKIP_PROFILE);\\n btnSkipProfile.setOnClickListener(onClickListenerButtonClicked);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc3ec2786351e7b32df4bfeb2a4b525c\",\n \"score\": \"0.49660268\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void onClick(View v) {\\n\\t\\t\\t\\tToast.makeText(activity, \\\"Profile Click\\\", Toast.LENGTH_SHORT)\\n\\t\\t\\t\\t\\t\\t.show();\\n\\t\\t\\t\\tshowProfile();\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7463397dd899106e4fd6ad4addc8a43\",\n \"score\": \"0.4963665\",\n \"text\": \"@Override\\n public void actionPerformed(ActionEvent e) {\\n respondToFriendRequests(isGuest, guidemo, sm, cmc, idC);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c07053d57df2fba59c7501ed92b0e31\",\n \"score\": \"0.4955955\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void actionPerformed(ActionEvent arg0) {\\n\\t\\t\\t\\tupdate();\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"baca8222fc1e81c2493e5e2d8c4d4c02\",\n \"score\": \"0.4938431\",\n \"text\": \"void onchangeAvatarButtonClicked();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"820db79e4cc9b0544f4673f754bbad12\",\n \"score\": \"0.49311402\",\n \"text\": \"private void seeAllEventsAd (ActionEvent evt) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"676ad9c8ead0bcc35b96459e8df248a0\",\n \"score\": \"0.4930486\",\n \"text\": \"boolean updateProfileFromLead(Profile profile);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0d00b2a2d576036081cf962e5c02862\",\n \"score\": \"0.49291098\",\n \"text\": \"public static void activateProfile(URL profile) throws Exception {\\n if (profile.equals (previousProfile)) {\\n return;\\n }\\n INSTANCE.activate(profile);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"392fa9406fb9a832efef81c8687edf76\",\n \"score\": \"0.49281377\",\n \"text\": \"@Override\\n \\t\\t\\tpublic void handle(ActionEvent event) {\\n \\t\\t\\t\\tUpDeviceInfo();\\n \\t\\t\\n \\t\\t\\t\\ts_QueryDeviceActivenessService.restart();\\n \\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca97893b83dedb1ebb1a212dae5fe57b\",\n \"score\": \"0.49277547\",\n \"text\": \"ActivationListener getActiveLayerChangeListener();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c0b0480244131fb05f602386442077d\",\n \"score\": \"0.49214062\",\n \"text\": \"public void viewProfile() {\\n if (contributor == null) {\\n throwArgumentContributorException();\\n }\\n\\n Log.i(\\\"Infogue/Contributor\\\", \\\"View ID : \\\"+contributor.getId() + \\\" Username : \\\" + contributor.getUsername());\\n\\n Intent profileIntent = new Intent(context, ProfileActivity.class);\\n profileIntent.putExtra(SessionManager.KEY_ID, contributor.getId());\\n profileIntent.putExtra(SessionManager.KEY_USERNAME, contributor.getUsername());\\n profileIntent.putExtra(SessionManager.KEY_NAME, contributor.getName());\\n profileIntent.putExtra(SessionManager.KEY_LOCATION, contributor.getLocation());\\n profileIntent.putExtra(SessionManager.KEY_ABOUT, contributor.getAbout());\\n profileIntent.putExtra(SessionManager.KEY_AVATAR, contributor.getAvatar());\\n profileIntent.putExtra(SessionManager.KEY_COVER, contributor.getCover());\\n profileIntent.putExtra(SessionManager.KEY_STATUS, contributor.getStatus());\\n profileIntent.putExtra(SessionManager.KEY_ARTICLE, contributor.getArticle());\\n profileIntent.putExtra(SessionManager.KEY_FOLLOWER, contributor.getFollowers());\\n profileIntent.putExtra(SessionManager.KEY_FOLLOWING, contributor.getFollowing());\\n profileIntent.putExtra(SessionManager.KEY_IS_FOLLOWING, contributor.isFollowing());\\n\\n if (context instanceof FragmentActivity) {\\n ((FragmentActivity) context).startActivityForResult(profileIntent, ProfileActivity.PROFILE_RESULT_CODE);\\n } else {\\n throwInstanceException();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f53074aaa910d314fe165c04d3f4f119\",\n \"score\": \"0.4917763\",\n \"text\": \"void update () {\\n\\t\\tif (enterUpdate()) {\\r\\n\\t\\t\\tdo {\\r\\n\\t\\t\\t\\tTYPE value = valueprovider.getCurrentValue();\\r\\n\\t\\t\\t\\tif (element != null) {\\r\\n\\t\\t\\t\\t\\tif (iterator != null) {\\r\\n\\t\\t\\t\\t\\t\\titerator.unregisterListener(this);\\r\\n\\t\\t\\t\\t\\t\\titerator = null;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif (interaction != null) {\\r\\n\\t\\t\\t\\t\\t\\tinteraction.dispose();\\r\\n\\t\\t\\t\\t\\t\\tinteraction = null;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\tboolean success = false;\\r\\n\\t\\t\\t\\t\\tdo {\\r\\n\\t\\t\\t\\t\\t\\tEvent event = engine.createInstance(eventType);\\r\\n\\t\\t\\t\\t\\t\\tif (event != null) {\\r\\n\\t\\t\\t\\t\\t\\t\\tParameter param = event.getParameter(parameter);\\r\\n\\t\\t\\t\\t\\t\\t\\tif (param != null) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tparam.setValue(value);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\titerator = engine.getInteractions(element, event);\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tsuccess = true;\\r\\n\\t\\t\\t\\t\\t\\ttry {\\r\\n\\t\\t\\t\\t\\t\\t\\titerator.registerListener(this);\\r\\n\\t\\t\\t\\t\\t\\t\\tif (iterator.hasNext()) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tinteraction = iterator.next();\\r\\n\\t\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t} catch (InvalidStateException e) {\\r\\n\\t\\t\\t\\t\\t\\t\\titerator.unregisterListener(this);\\r\\n\\t\\t\\t\\t\\t\\t\\titerator.dispose();\\r\\n\\t\\t\\t\\t\\t\\t\\tsuccess = false;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t} while (!success);\\r\\n\\r\\n\\t\\t\\t\\t\\tif (interaction != null) {\\r\\n\\t\\t\\t\\t\\t\\tthis.setEnabled(true);\\r\\n\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\tthis.setEnabled(false);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t} while (!leaveUpdate());\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9805c98198cb485341d802147deec775\",\n \"score\": \"0.49137163\",\n \"text\": \"public void actionPerformed(ActionEvent ae)\\r\\n \\t{\\r\\n \\t\\tthis.update();\\r\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a191187316fa46c7b67e25ac4d3f3065\",\n \"score\": \"0.4892956\",\n \"text\": \"@Override\\n public void onSuccessfulWikidataEdit() {\\n if (wikidataP18EditListener != null) {\\n wikidataP18EditListener.onWikidataEditSuccessful();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"599a44919657ec10ca53bcc8a353f300\",\n \"score\": \"0.48866296\",\n \"text\": \"void accessReviewChangesPage();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc8dc11dc38ae3ded399193a5f8322d3\",\n \"score\": \"0.4885102\",\n \"text\": \"private void updateUi() {\\n // configure the preferences that are allowed to be modified by the user\\n updatePreferenceAccessFromPowerLevel();\\n\\n // need to run on the UI thread to be taken into account\\n // when updatePreferenceUiValues() will be performed\\n getActivity().runOnUiThread(new Runnable() {\\n @Override\\n public void run() {\\n // disable listener during preferences update, otherwise it will\\n // be seen as a user action..\\n enableSharedPreferenceListener(false);\\n }\\n });\\n\\n getActivity().runOnUiThread(new Runnable() {\\n @Override\\n public void run() {\\n // set settings UI values\\n updatePreferenceUiValues();\\n\\n // re enable preferences listener..\\n enableSharedPreferenceListener(true);\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bf7ae40ce177b0d9a48ea383573477b3\",\n \"score\": \"0.48745114\",\n \"text\": \"@Override\\n public void actionPerformed(ActionEvent ae) {\\n //\\n // \\\"OK\\\" - Switch to the selected account\\n // \\\"cancel\\\" - Cancel the request\\n //\\n try {\\n String action = ae.getActionCommand();\\n switch (action) {\\n case \\\"ok\\\":\\n String account = (String)accountField.getSelectedItem();\\n if (account != null)\\n account = account.toUpperCase().trim();\\n if (account == null || account.length() == 0) {\\n JOptionPane.showMessageDialog(this, \\\"No account selected\\\", \\\"Error\\\",\\n JOptionPane.ERROR_MESSAGE);\\n } else {\\n if (account.startsWith(\\\"NXT-\\\")) {\\n accountId = Utils.parseAccountRsId(account);\\n } else {\\n accountId = Long.parseUnsignedLong(account);\\n }\\n }\\n setVisible(false);\\n dispose();\\n break;\\n case \\\"cancel\\\":\\n setVisible(false);\\n dispose();\\n break;\\n }\\n } catch (NumberFormatException | IdentifierException exc) {\\n JOptionPane.showMessageDialog(this, \\\"Invalid account\\\", \\\"Error\\\", JOptionPane.ERROR_MESSAGE);\\n } catch (Exception exc) {\\n Main.log.error(\\\"Exception while processing action event\\\", exc);\\n Main.logException(\\\"Exception while processing action event\\\", exc);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c7fbd5f5fcaf6d700dd1ad650907e8a\",\n \"score\": \"0.4871531\",\n \"text\": \"@FXML\\n public void Profil(ActionEvent event) throws IOException {\\n AnchorPane pane = FXMLLoader.load(getClass().getResource(\\\"ProfilPage.fxml\\\"));\\n ANchorProfil.getChildren().setAll(pane);\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b008664715ee9ea1fe2f71a5bc98780\",\n \"score\": \"0.4869081\",\n \"text\": \"private void viewProfile() {\\n Doctor doctor = doctors.get(LIST_ITEM_POSITION);\\n Intent t = new Intent(context, ProfileActivity.class);\\n t.putExtra(INTENT_EXTRA, doctor);\\n startActivity(t);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"034458fbc5387d788f976aadcc2bb06d\",\n \"score\": \"0.48654684\",\n \"text\": \"void onActivate(MainController controller, Display display);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1f39239204a5b94f755580b20cfb4fc\",\n \"score\": \"0.4864196\",\n \"text\": \"void fireEvent(int type, Profile profile) throws RemoteException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a50565ceece43585c0ec29bc634ce083\",\n \"score\": \"0.4852321\",\n \"text\": \"void updatePolicy(State state, Action action);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"591bda65ebd623ed46abd3313c01028d\",\n \"score\": \"0.48441088\",\n \"text\": \"@Override\\n public void actionPerformed(ActionEvent e) {\\n writeAReview(isGuest, guidemo, sm, idC, cmc);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39dd5386121ba71cb8d0942712c93246\",\n \"score\": \"0.48430842\",\n \"text\": \"public abstract void clickStatusUpdateTextField();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ef36b1ece59347a9f17e1534434371d\",\n \"score\": \"0.48383483\",\n \"text\": \"@Override\\n protected void beforeActivityLaunched(){\\n PC = new ProfileController();\\n AC = new AccountController();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebe70524358733095db5ede64d81fd22\",\n \"score\": \"0.4838022\",\n \"text\": \"@Override\\r\\n\\tpublic void changedUpdate(DocumentEvent e) {\\n\\t\\tupdateButtonEnabledStatus(loginButton, text);\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f310306a2be7779730d043c57be5348\",\n \"score\": \"0.4832128\",\n \"text\": \"@Override\\n public void actionPerformed(ActionEvent e) {\\n update();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a58d91ab1d078ac6affd1388bc4114f2\",\n \"score\": \"0.48247713\",\n \"text\": \"@Override\\n protected void onCurrentProfileChanged(Profile profile, Profile profile2) {\\n Log.v(\\\"facebook - profile\\\", profile2.getFirstName());\\n sessionWritter(profile2);\\n mProfileTracker.stopTracking();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d17583dc32e85d68e72fed7952390316\",\n \"score\": \"0.4820452\",\n \"text\": \"public void onProfileClick(View v) {\\n\\t\\tIntent intent = new Intent(this, EditProfile.class);\\n\\t\\tString message;\\n\\n\\t\\tRelativeLayout l2 = (RelativeLayout) v;\\n\\t\\tTextView tvPname = (TextView) l2.getChildAt(0);\\n\\t\\tmessage = tvPname.getText().toString();\\n\\t\\tintent.putExtra(EXTRA_MESSAGE, message);\\n\\t\\tstartActivity(intent);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ed2993fae02c29a80dcd45bebf7e198\",\n \"score\": \"0.48163754\",\n \"text\": \"void accessUserPemissionsPage();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36049375ac218c3581272bd5414fff41\",\n \"score\": \"0.4814716\",\n \"text\": \"@Test\\n\\tpublic void Profile_01() throws InterruptedException\\n\\t{\\n\\t\\tProfilePage pp = PageFactory.initElements(driver, ProfilePage.class);\\n\\t\\t\\n\\t\\tpp.takeAPicFromCamera();\\n\\t\\t\\n\\t\\t//Assert.assertEquals(mp.getWebViewTitle(), \\\"Latest Updates\\\",\\\"title is not found\\\");\\n\\t\\t\\n\\t\\t//no assertion, if this test case can thorough all step, it means passed\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef97f34b5376f70d824f2b907fb8d1ec\",\n \"score\": \"0.4813768\",\n \"text\": \"void selectedProfileHighlightAdded(String highlight);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"adc57c6b1d673791101f4d8a70f15123\",\n \"score\": \"0.4813006\",\n \"text\": \"@Override\\n public void updateNicProfile(final NicProfile profile, final Network network) {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"30361a1fc8e6b9f12bd62df2055f79df\",\n \"score\": \"0.48019457\",\n \"text\": \"public void onEditProfileClicked(View v){\\n editProfileImageView.setVisibility(View.INVISIBLE);\\n confirmButton.setVisibility(View.VISIBLE);\\n cancelButton.setVisibility(View.VISIBLE);\\n isInEditMode = true;\\n toggleEditable(nameEditText);\\n toggleEditable(gpaEditText);\\n toggleEditable(bioEditText);\\n toggleEditable(interestsEditText);\\n toggleEditable(emailEditText);\\n //do NOT toggleEditable(coursesEditText)\\n //only edit courses through the edit courses screen\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9aa8ff37142765f4b636943740159f80\",\n \"score\": \"0.47947302\",\n \"text\": \"@SuppressLint(\\\"SetTextI18n\\\")\\n private void updateProfileData() {\\n Drawable avatar =\\n AppCompatResources.getDrawable(getActivity(), R.drawable.logo_avatar_anonymous);\\n mView.getAccountImageView().setImageDrawable(avatar);\\n mConsentTextTracker.setTextNonRecordable(mView.getAccountNameView(), \\\"John Doe\\\");\\n mConsentTextTracker.setTextNonRecordable(\\n mView.getAccountEmailView(), \\\"john.doe@example.com\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ead8cf36078cef56f5029bf62d3b2600\",\n \"score\": \"0.47926813\",\n \"text\": \"public void onProfileView(MenuItem item) {\\n Intent i = new Intent(this, ProfileActivity.class);\\n startActivity(i);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ead8cf36078cef56f5029bf62d3b2600\",\n \"score\": \"0.47926813\",\n \"text\": \"public void onProfileView(MenuItem item) {\\n Intent i = new Intent(this, ProfileActivity.class);\\n startActivity(i);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"915a1bb4c72b3826cfdb8a6149fd38c6\",\n \"score\": \"0.47828078\",\n \"text\": \"public abstract void goToStatusUpdate();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cbc8fe3d92579cbdc619c8c50b3b0d48\",\n \"score\": \"0.4782307\",\n \"text\": \"@Override\\r\\n\\tpublic void onAdhocStateUpdated(AdhocStateEnum state, String info) {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0a0da39034b90826ced1349e1d35682\",\n \"score\": \"0.47804737\",\n \"text\": \"private void addRateUsEvent() {\\n /*09th July 2019, Resolved Pyze library issue*/\\n HashMap<String, Object> customattributes = new HashMap<String, Object>();\\n customattributes.put(\\\"RateUsMenu\\\", \\\"Clicked\\\");\\n\\n if (isNavigationScreenActive)\\n PyzeEvents.postCustomEventWithAttributes(\\\"Rated_Users\\\", customattributes);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d10de01608e981f7b8d1389762fdaa4\",\n \"score\": \"0.47772726\",\n \"text\": \"void updateEventAttendees(Event evt);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ae7f1816d6b7fa6b88807e041848e67\",\n \"score\": \"0.4766224\",\n \"text\": \"private void updateUI() {\\n // Update score panel\\n window.getScorePanel().updateScore(game.getTime());\\n\\n // Update cooldown timers\\n window.getAbilityBar().updateAbilities(game.getCurrentLevel().getPlayer().getAbilities());\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983788,"cells":{"query_id":{"kind":"string","value":"bb784a6f4371c5f22ccd4087cf91f47e"},"query":{"kind":"string","value":"Compares two AVLs and checks to see if the trees are the same. If the trees have the same data in a different arrangement, this method should return false. This will only return true if the tree is in the exact same arrangement as the other tree. You may assume that you won't get an AVL with a different generic type. For example, if this AVL holds Strings, then you will not get as an input an AVL that holds Integers. Be sure to also implement the other general checks that .equals() should check as well."},"positive_passages":{"kind":"list like","value":[{"docid":"f78d3018504cc8a03acfab5fb4a075fb","score":"0.7223043","text":"public boolean equals(Object other) {\n if (other == null) {\n return false;\n }\n if (!(other instanceof AVL)) {\n return false;\n }\n AVLNode<T> node1 = root;\n AVL<T> bst2 = (AVL<T>) other;\n AVLNode<T> node2 = bst2.root;\n if (node1 == null && bst2 == null) {\n return false;\n }\n return equalsRecursive(node1, node2);\n }","title":""}],"string":"[\n {\n \"docid\": \"f78d3018504cc8a03acfab5fb4a075fb\",\n \"score\": \"0.7223043\",\n \"text\": \"public boolean equals(Object other) {\\n if (other == null) {\\n return false;\\n }\\n if (!(other instanceof AVL)) {\\n return false;\\n }\\n AVLNode<T> node1 = root;\\n AVL<T> bst2 = (AVL<T>) other;\\n AVLNode<T> node2 = bst2.root;\\n if (node1 == null && bst2 == null) {\\n return false;\\n }\\n return equalsRecursive(node1, node2);\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"53d3c4147cee1674ad264ce4f552af78","score":"0.6627099","text":"private Boolean compare(AVLTree a, AVLTree b){\n if(a.key>b.key || (a.key==b.key && a.address>b.address))return true;\n return false;\n }","title":""},{"docid":"a7bad778ae5923a0f66590b4c8c7fef5","score":"0.65687704","text":"private boolean equalsRecursive(AVLNode<T> node1, AVLNode<T> node2) {\n\n if (node1 == null && node2 == null) {\n return true;\n }\n if (node1 != null && node2 != null) {\n return (node1.getData().equals(node2.getData())\n && equalsRecursive(node1.getLeft(), node2.getLeft())\n && equalsRecursive(node1.getRight(), node2.getRight()));\n }\n return false;\n }","title":""},{"docid":"cd4522344afc6879195a11f54031b952","score":"0.6407485","text":"private static boolean sameTree(Node a, Node b) {\n\t\t// null checking. if both null, true. else if one null, false \n\t\tif (a == null && b == null) {\n\t\t\treturn true; \n\t\t} else if (a == null || b == null) {\n\t\t\treturn false; \n\t\t}\n\n\t\t// neither are null. check values and if necessary, left and right subtrees. \n\t\tif (a.val != b.val) {\n\t\t\treturn false; \n\t\t} else {\n\t\t\treturn sameTree(a.left, b.left) && sameTree(a.right, b.right); \n\t\t}\n\t}","title":""},{"docid":"3eadbbb8f95e287e9587bd860523f562","score":"0.63124084","text":"static boolean similar(BinaryNode t1, BinaryNode t2)\n {\n \n //If both are empty then it is true.\n if (t1 == null && t2 == null) \n {\n return true;\n }\n //If both are not empty then compare the values in the nodes\n else if (t1 != null && t2 != null) \n { \n return t1.element == t2.element && similar(t1.left, t2.left) && similar(t1.right, t2.right); \n } \n //If one is empty and one is not, or if different values then return false\n else\n {\n return false; \n }\n \n }","title":""},{"docid":"3613181f163cb73309223d93b5562bd1","score":"0.6213623","text":"public boolean CompareTrees(Node<T> node1, Node<T> node2) {\n\t\tif (node1 == null || node2 == null) return node1==node2;\n\t\t\n\t\t//if the value within the nodes are not the same we return false\n\t\tif(node1.getData().compareTo(node2.getData()) != 0) return false;\n\t\t\n\t\treturn CompareTrees(node1.getLeftChild(), node2.getLeftChild()) && CompareTrees(node1.getRightChild(), node2.getRightChild());\n\t}","title":""},{"docid":"cf02e05ec186ac0164f2bc73129b771a","score":"0.6170447","text":"private boolean matchTree(TreeNode t1, TreeNode t2){\n\t\tif(t1 == null && t2 == null){\n\t\t\treturn true; //Reached end of tree.\n\t\t}else if(t1 == null || t2 == null){\n\t\t\treturn false;\n\t\t}else if(t1.data != t2.data){\n\t\t\treturn false;\n\t\t}else{\n\t\t\treturn matchTree(t1.left, t2.left) && matchTree(t1.right, t2.right);\n\t\t} \n\t}","title":""},{"docid":"f4901336184fdf58c9b7a9301ce6f001","score":"0.604296","text":"@Test\n public void testContainsAll1() {\n System.out.println(\"ContainsAll test #1\");\n AVLTree<Integer> tree1 = new AVLTree();\n tree1.add(10);\n tree1.add(20);\n tree1.add(5);\n AVLTree<Integer> tree2 = new AVLTree();\n tree2.add(5);\n tree2.add(20);\n tree2.add(10);\n if (tree1.containsAll(tree2)) {\n System.out.println(\"Successful\");\n } else {\n fail(\"Test is not passed\");\n }\n }","title":""},{"docid":"36196d96238e455e66e00213564c87a5","score":"0.6004641","text":"@Test\n public void testContainsAll3() {\n System.out.println(\"ContainsAll test #3\");\n AVLTree<Integer> tree1 = new AVLTree();\n tree1.add(10);\n tree1.add(20);\n tree1.add(5);\n AVLTree<Integer> tree2 = new AVLTree();\n tree2.add(5);\n tree2.add(20);\n tree2.add(10);\n tree2.add(120);\n if (!tree1.containsAll(tree2)) {\n System.out.println(\"Successful\");\n } else {\n fail(\"Test is not passed\");\n }\n }","title":""},{"docid":"b93cfc3ed87de870fc8825f336bc2685","score":"0.5997673","text":"@Test\n public void testContainsAll2() {\n System.out.println(\"ContainsAll test #2\");\n AVLTree<Integer> tree1 = new AVLTree();\n tree1.add(10);\n tree1.add(20);\n tree1.add(5);\n AVLTree<Integer> tree2 = new AVLTree();\n tree2.add(3);\n tree2.add(4);\n if (!tree1.containsAll(tree2)) {\n System.out.println(\"Successful\");\n } else {\n fail(\"Test is not passed\");\n }\n }","title":""},{"docid":"231279661085d925839c78c8bc9dff42","score":"0.5906788","text":"public static void compareTrees() {\n int N = 10000000;\n System.out.print( \"UNEVEN DISTRIBUTION\\n\" );\n System.out.printf( \"%26s\", \"inserting..\\n\" );\n System.out.printf( \"%-10s%7s%13s| %6s%13s\\n\", \"n\", \"height\", \"BST Tree\", \"height\", \"AVL Tree\" );\n for ( int n = 1000; n <= N; n *= 10 ) {\n BinarySearchTree< Integer > bst = new BinarySearchTree<>();\n BinarySearchTree< Integer > avl = new AVLTree<>();\n int[] array = generateRandomValuesNormal( n );\n long startBst = System.currentTimeMillis();\n for ( Integer element : array ) {\n bst.insert( element );\n }\n long endBst = System.currentTimeMillis() - startBst;\n long startAvl = System.currentTimeMillis();\n for ( Integer element : array ) {\n avl.insert( element );\n }\n long endAvl = System.currentTimeMillis() - startAvl;\n System.out.printf( \"%-9d:%7d%10d ms| %6d%10d ms\\n\", n, bst.getRootHeight(), endBst, avl.getRootHeight(), endAvl );\n }\n\n BinarySearchTree< Integer > tree1;\n BinarySearchTree< Integer > tree2;\n\n System.out.printf( \"%16s\\n\", \"K test..\" );\n System.out.printf( \"%-10s%7s%13s| %6s%13s\\n\", \"k\", \"height\", \"BST Tree\", \"height\", \"AVL Tree\" );\n for ( int n = 1000; n <= N; n *= 10 ) {\n int[] sharedValues = generateRandomValuesNormal( n );\n tree1 = populateTree( new BinarySearchTree< Integer >(), sharedValues );\n tree2 = populateTree( new AVLTree< Integer >(), sharedValues );\n System.out.print( \"\\n [ n : \" + n + \" ]\\n\" );\n\n for ( int k = 1000; k <= N; k *= 10 ) {\n int[] array = generateRandomValues( k );\n long start1 = System.currentTimeMillis();\n for ( Integer element : array ) {\n tree1.contains( element );\n }\n\n long end1 = System.currentTimeMillis() - start1;\n long start2 = System.currentTimeMillis();\n for ( Integer element : array ) {\n tree2.contains( element );\n }\n long end2 = System.currentTimeMillis() - start2;\n System.out.printf( \"%-9d:%7d%10d ms| %6d%10d ms\\n\", k, tree1.getRootHeight(), end1, tree2.getRootHeight(), end2 );\n }\n }\n System.out.printf( \"\\n%16s\", \"M tests..\" );\n for ( int x = 1; x <= 8; x += 2 ) {\n System.out.print( \"\\n [ \" + x * 10 + \"% insertions and \" + ( 10 - x ) * 10 + \"% searches ]\\n\" );\n System.out.printf( \"%-10s%7s%13s| %6s%13s\\n\", \"m\", \"height\", \"BST Tree\", \"height\", \"AVL Tree\" );\n\n for ( int m = 100000; m <= N; m *= 10 ) {\n Integer[] values = new Integer[ m / 2 ];// make integer array\n for ( int i = 0; i < ( x * m / ( 20 ) ); i++ ) {\n values[ i ] = 1;\n }\n ArrayList< Integer > value = new ArrayList<>( Arrays.asList( values ) );\n Random rand = new Random( System.currentTimeMillis() );\n Collections.shuffle( value, rand );\n int[] array = generateRandomValues( m / 2 );\n int[] array2 = generateRandomValuesNormal( N );\n tree1 = populateTree( new BinarySearchTree< Integer >(), array2 );\n long start1 = System.currentTimeMillis();\n for ( int i = 0; i < array.length; i++ ) {\n if ( value.get( i ) == null ) {\n tree1.contains( array[ i ] );\n } else {\n tree1.insert( array[ i ] );\n }\n }\n long end1 = System.currentTimeMillis() - start1;\n tree2 = populateTree( new AVLTree< Integer >(), array2 );\n long start2 = System.currentTimeMillis();\n for ( int i = 0; i < array.length; i++ ) {\n if ( value.get( i ) == null ) {\n tree2.contains( array[ i ] );\n } else {\n tree2.insert( array[ i ] );\n }\n }\n long end2 = System.currentTimeMillis() - start2;\n System.out.printf( \"%-9d:%7d%10d ms| %6d%10d ms\\n\", m / 2, tree1.getRootHeight(), end1, tree2.getRootHeight(), end2 );\n }\n }\n\n }","title":""},{"docid":"64ef94b3b2d4c072d9c07bafcd102045","score":"0.5897633","text":"public static boolean compare(Dataset dataset1, Dataset dataset2, boolean verbose) {\n if (dataset1 == null){\n if (dataset2 == null){\n return true;\n } else {\n if (verbose){\n logger.info(\"Dataset 1 is null while Dataset 2 is:\");\n logger.info(dataset2);\n }\n return false;\n } \n } else {\n if (dataset2 == null){\n if (verbose){\n logger.info(\"Dataset 2 is null while Dataset 1 is:\");\n logger.info(dataset1);\n }\n return false;\n } \n }\n Set<URI> defaultGraphs1 = dataset1.getDefaultGraphs();\n Set<URI> defaultGraphs2 = dataset2.getDefaultGraphs();\n //ystem.out.println(\"defaultGraphs\");\n //ystem.out.println(defaultGraphs1);\n //ystem.out.println(defaultGraphs2);\n if (!(defaultGraphs1.equals(defaultGraphs2))){\n if (verbose){\n logger.info(\"*** defaultGraphs do not match ***\");\n }\n return false;\n }\n Set<URI> namedGraphs1 = dataset1.getNamedGraphs();\n Set<URI> namedGraphs2 = dataset2.getNamedGraphs();\n //ystem.out.println(\"namedGraphs\");\n //ystem.out.println(namedGraphs1);\n //ystem.out.println(namedGraphs2);\n if (!(namedGraphs1.equals(namedGraphs2))){\n if (verbose){\n logger.info(\"*** namedGraphs do not match ***\");\n }\n return false;\n }\n return true;\n }","title":""},{"docid":"a56c9f1b5244ac02e8bb14474a2735df","score":"0.58614594","text":"public boolean equals(DataStructure otherStructure);","title":""},{"docid":"a34a5ae2692bdb804f700b99fc52ee21","score":"0.5860964","text":"public boolean isMirror(TreeNode Tree1, TreeNode Tree2){\n if(Tree1==null && Tree2==null)\r\n return true;\r\n //Both tree are not equal to null\r\n //left tree and right tree values are equal\r\n if(Tree1!=null && Tree2!=null && Tree1.val==Tree2.val)\r\n return (isMirror(Tree1.left,Tree2.right) &&\r\n isMirror(Tree1.right,Tree2.left));\r\n return false;\r\n }","title":""},{"docid":"afef43fdbe087f80c408778faa901e70","score":"0.58473647","text":"@Test\n public void testRetainAll2() {\n System.out.println(\"RetainAll test #2\");\n AVLTree<Integer> tree1 = new AVLTree();\n tree1.add(1);\n tree1.add(2);\n tree1.add(3);\n AVLTree<Integer> tree2 = new AVLTree();\n tree2.add(4);\n tree2.add(5);\n tree2.add(6);\n boolean res = tree1.retainAll(tree2);\n System.out.println(tree1.isEmpty());\n if (res && tree1.isEmpty()) {\n System.out.println(\"Successful\");\n } else {\n fail(\"Test is not passed\");\n }\n }","title":""},{"docid":"b84c852ef479f77b7c5854e027ec717b","score":"0.5795632","text":"public boolean treeEquals(GPTree tree)\n {\n return child.rootedTreeEquals(tree.child);\n }","title":""},{"docid":"214c58ea7462cb70b3eb4c8417cb9c4b","score":"0.57674915","text":"private boolean myequals(XML left, XML right) {\n\t\tXML[] lChildren = left.getChildren();\n\t\tXML[] rChildren = right.getChildren();\n\t\tSet<String> lset = new HashSet<String>();\n\t\tSet<String> lnotset = new HashSet<String>();\n\t\tSet<String> rset = new HashSet<String>();\n\t\tSet<String> rnotset = new HashSet<String>();\n\t\tfor(XML lChild : lChildren){\n\t\t\tif(lChild.getName().equals(\"not\")){\n\t\t\t\tlnotset.add(lChild.getChild(0).getName());\n\t\t\t}\n\t\t\telse{\n\t\t\t\tlset.add(lChild.getName());\n\t\t\t}\n\t\t}\n\t\tfor(XML rChild : rChildren){\n\t\t\tif(rChild.getName().equals(\"not\")){\n\t\t\t\trnotset.add(rChild.getChild(0).getName());\n\t\t\t}\n\t\t\telse{\n\t\t\t\trset.add(rChild.getName());\n\t\t\t}\n\t\t}\n\t\tif(lset.equals(rset) && lnotset.equals(rnotset)){\n\t\t\treturn true;\n\t\t}\n\t\telse return false;\n\t}","title":""},{"docid":"046f31178eef120397425e88e47df348","score":"0.5667982","text":"public boolean compare(AncestorEquation ae1, AncestorEquation ae2){//if ae2 is prior to ae1,return true\r\n \t//four cases\r\n \tif(ae1.getClass()==Assignment.class){//if ae1 is assignment\r\n \t\tAssignment an1=(Assignment)ae1;\r\n \t\tArrayList<Signal> as=getRightSignals(an1);\r\n \t\tif(ae2.getClass()==Assignment.class){//if ae2 is assignment\r\n \t\t\tAssignment an2=(Assignment)ae2;\r\n \t\t\tif(as.contains(an2.left)==true)//if lhs of ae2 is in the rhs of ae1, return true\r\n \t\t\t\treturn true;\r\n \t\t}\r\n \t\telse if(ae2.getClass()==ReducedNF.class){//if ae2 is the definition of class\r\n \t\t\tClockEquivalenceClass cec=((ReducedNF)ae2).left;\r\n \t\t\tif(cec.getAssigns().contains(an1)){//if the assignments in lhs of ae2 contains ae1,return true\r\n \t\t\t\treturn true;\r\n \t\t\t}\r\n \t\t}\r\n \t}\r\n \telse if(ae1.getClass()==ReducedNF.class){//if ae1 is definition of class\r\n \t\tReducedNF rnf=(ReducedNF)ae1;\r\n \t\tif(ae2.getClass()==Assignment.class){//if ae2 is assignment \t\t\t\r\n \t\t\tAssignment an=(Assignment)ae2;\r\n \t\t\tif(rnf.term1==null && rnf.term2==null)\r\n \t\t\t\treturn false;\r\n \t\t\telse{//if in ae1 there are signals\r\n \t\t\t\tSignal s1=null;\r\n \t\t\t\tSignal s2=null;\r\n \t\t\t\tif(rnf.term1!=null){\r\n \t\t\t\t\ts1=rnf.term1.sig;\r\n \t\t\t\t}\r\n \t\t\t\tif(rnf.term2!=null){\r\n \t\t\t\t\ts2=rnf.term2.sig;\r\n \t\t\t\t}\r\n \t\t\t\tif(s1!=null){//if s1 is the lhs of ae2, return true\r\n \t\t\t\t\tif(an.left==s1)\r\n \t\t\t\t\t\treturn true;\r\n \t\t\t\t}\r\n \t\t\t\tif(s2!=null){//if s2 is the lhs of ae2, return true\r\n \t\t\t\t\tif(an.left==s2){\r\n \t\t\t\t\t\treturn true;\r\n \t\t\t\t\t}\r\n \t\t\t\t}\r\n \t\t\t}\r\n \t\t}\r\n \t\telse if(ae2.getClass()==ReducedNF.class){//if ae2 is definition of class\r\n \t\t\tReducedNF rnf2=(ReducedNF)(ae2);\r\n \t\t\t//if lhs of ae2 is one of the rhs in ae1,return true\r\n \t\t\tif(rnf.right1!=null){\r\n \t\t\t\tif(rnf.right1==rnf2.left)\r\n \t\t\t\t\treturn true;\r\n \t\t\t}\r\n \t\t\tif(rnf.right2!=null){\r\n \t\t\t\tif(rnf.right2==rnf2.left)\r\n \t\t\t\t\treturn true;\r\n \t\t\t}\r\n \t\t}\r\n \t}\r\n \treturn false;\r\n }","title":""},{"docid":"3927d336a19c740c28947c05765c9f6f","score":"0.56619847","text":"@Test\n public void testRetainAll1() {\n System.out.println(\"RetainAll test #1\");\n AVLTree<Integer> tree1 = new AVLTree();\n tree1.add(1);\n tree1.add(2);\n tree1.add(3);\n AVLTree<Integer> tree2 = new AVLTree();\n tree2.add(1);\n tree2.add(2);\n tree2.add(3);\n boolean res = tree1.retainAll(tree2);\n if (!res) {\n System.out.println(\"Successful\");\n } else {\n fail(\"Test is not passed\");\n }\n }","title":""},{"docid":"646ff5dbebf166e12e5627933093751f","score":"0.5655728","text":"public boolean equals(Object other) {\n if (this == other)\n return true;\n \n \n if (other == null)\n return false;\n \n if (!(other.getClass() == this.getClass()))\n return false;\n\n Cons<A, B> b = (Cons<A, B>) other;\n\n if ((length != b.length) || (hashCode() != b.hashCode()))\n return false;\n\n Cons<A, B> a = this;\n\n // TODO: We should traverse the recursive structure\n //in order to avoid exponential time (for instance\n //by traversing a list where 2 pointers refer to the\n //next element).\n\n \n while (a != null) {\n if (a.getClass() != b.getClass())\n return false;\n if (!elementEquals(a.a0, b.a0))\n return false;\n if (!elementEquals(a.a1, b.a1))\n return false;\n if (!elementEquals(a.a2, b.a2))\n return false;\n if (!elementEquals(a.a3, b.a3))\n return false;\n\n a = a.next;\n b = b.next;\n }// `while`\n return true;\n }","title":""},{"docid":"9f91b8b0b1286ba5b136e3f3e0dbf0de","score":"0.5635209","text":"@Test\n\tpublic void testEqualsOneNodeDiffVals() {\n\t\tLinkedList<Integer> ll11 = new LinkedList<Integer>();\n\t\tLinkedList<Integer> ll2 = new LinkedList<Integer>();\n\t\tll11.addToFront(new Node<Integer>(new Integer(1)));\n\t\tll2.addToFront(new Node<Integer>(new Integer(2)));\n\t\tassertFalse(ll11.equals(ll2));\n\t}","title":""},{"docid":"310b36653ec4a6bdc55d91ebb5f9a547","score":"0.56285626","text":"public boolean isMirror(TreeNode t1, TreeNode t2){\n if(t1 == null && t2 == null) return true;\n if(t1 == null || t2 == null) return false;\n\n /**\n * Assign left part to one tree & right part to another tree,\n * also assign right part to it, and check if these are equal recursively\n * */\n\n return (t1.val == t2.val && isMirror(t1.left, t2.right) && isMirror(t1.right, t2.left));\n }","title":""},{"docid":"9a34d500d6e4f014b74bb29c67844dfc","score":"0.56238115","text":"public boolean myEquals(BSTNode<T> that)\r\n { \r\n // Guardian if-statements\r\n if(val.compareTo(that.val) != 0){return false;}\r\n \r\n // if only one has left/right\r\n else if((left == null && that.left != null) || (left != null && that.left == null)){return false;}\r\n else if((right == null && that.right != null) || (right != null && that.right == null)){return false;}\r\n \r\n // if both nodes have no children, return true\r\n if(left == null && right == null && that.left == null && that.right == null){return true;}\r\n \r\n // call on left subtree, store answer\r\n boolean leftEquals = true;\r\n if(left != null){\r\n leftEquals = left.myEquals(that.left);\r\n }\r\n \r\n // call on right subtree, store answer\r\n boolean rightEquals = true;\r\n if(right != null){\r\n rightEquals = right.myEquals(that.right);\r\n }\r\n \r\n if(left != null && right != null){return(leftEquals && rightEquals);}\r\n else if(left != null){return leftEquals;}\r\n else{return rightEquals;}\r\n \r\n \r\n // if(left != null && that.left != null){return left.myEquals(that.left);}\r\n// //else if(left == null && that.left == null){return true;}\r\n// else if((left == null && that.left != null) || (left != null && that.left == null)){return false;}\r\n// \r\n// \r\n// \r\n// if(right != null && that.right != null){return right.myEquals(that.right);} \r\n// //else if(right == null && that.right == null){return true;}\r\n// else if((right == null && that.right != null) || (right != null && that.right == null)){return false;} \r\n// \r\n// return true; // need to add conditions so it doesn't always return true\r\n }","title":""},{"docid":"219714f775ba2e109fde56cf9ccf1def","score":"0.56219596","text":"@Test\n public void testAddAll2() {\n System.out.println(\"AddAll test #2\");\n AVLTree<Integer> tree1 = new AVLTree();\n tree1.add(1);\n tree1.add(2);\n tree1.add(3);\n AVLTree<Integer> tree2 = new AVLTree();\n tree2.add(4);\n tree2.add(5);\n tree2.add(6);\n boolean res = tree1.addAll(tree2);\n AVLTree<Integer> tree3 = new AVLTree();\n tree3.add(1);\n tree3.add(2);\n tree3.add(3);\n tree3.add(4);\n tree3.add(5);\n tree3.add(6);\n if (res && tree1.containsAll(tree3)) {\n System.out.println(\"Successful\");\n } else {\n fail(\"Test is not passed\");\n }\n }","title":""},{"docid":"908d2f5db498e80badd8571cb82ab4d3","score":"0.5609152","text":"public boolean isSameTree(TreeNode p, TreeNode q){\n List<Integer> first = BFS(p);\n List<Integer> second = BFS(q);\n if(first.size() != second.size()) return false;\n for (int i = 0; i < first.size(); i++) {\n if(first.get(i) == null && second.get(i) == null) continue;\n else if (first.get(i) == null || second.get(i) == null) return false;\n else if(first.get(i).intValue() != second.get(i).intValue()) return false;\n }\n return true;\n }","title":""},{"docid":"8d8c25750b2fe61947bf43997d46ad76","score":"0.56040543","text":"@Test\n public void testAddAll1() {\n System.out.println(\"AddAll test #1\");\n AVLTree<Integer> tree1 = new AVLTree();\n tree1.add(10);\n tree1.add(20);\n tree1.add(5);\n AVLTree<Integer> tree2 = new AVLTree();\n tree2.add(5);\n tree2.add(20);\n tree2.add(10);\n tree2.add(120);\n boolean res = tree1.addAll(tree2);\n if (res && tree1.containsAll(tree2)) {\n System.out.println(\"Successful\");\n } else {\n fail(\"Test is not passed\");\n }\n }","title":""},{"docid":"08c122f9ff370530d15446ced8c59c49","score":"0.55604786","text":"public static <T extends Type> boolean equal(List<T> lt1, List<T> lt2) {\n if (lt1.size() != lt2.size()) {\n return false;\n }\n for (int i = 0; i < lt1.size(); i++) {\n Type cit = lt1.get(i);\n if (!lt2.stream().filter(c -> equal(c, cit)).findFirst().isPresent()) {\n return false;\n }\n }\n return true;\n }","title":""},{"docid":"e8cda4d58bf5c8f5e2f543d773cfe11f","score":"0.5539881","text":"public boolean compareGraphs(double[][] graph1, double[][] graph2) {\n if (graph1 == null || graph2 == null) {\n return false;\n }\n for (int i = 0; i < graph1.length; i++) {\n if ((graph1[i][0] != graph2[i][0]) || (graph1[i][1] != graph2[i][1])) {\n return false;\n }\n }\n return true;\n }","title":""},{"docid":"07e94d10d68f8a7bd2644b06e81bc453","score":"0.5531613","text":"@Test\n public void testRemoveAll2() {\n System.out.println(\"RemoveAll test #2\");\n AVLTree<Integer> tree1 = new AVLTree();\n tree1.add(1);\n tree1.add(2);\n tree1.add(3);\n AVLTree<Integer> tree2 = new AVLTree();\n tree2.add(1);\n tree2.add(2);\n AVLTree<Integer> tree3 = new AVLTree();\n tree3.add(3);\n boolean res = tree1.removeAll(tree2);\n if (res && tree3.containsAll(tree1)) {\n System.out.println(\"Successful\");\n } else {\n fail(\"Test is not passed\");\n }\n }","title":""},{"docid":"87f027bfc083120361964a3ffc303e46","score":"0.5523713","text":"public static void main(String[] args) {\n\t\troot = null;\n\t\troot2 = null;\n\t\tint[] values = {50,40,70,30,45};\n\t\tfor(int i=0;i<values.length;i++)\n\t\t{\n\t\t\troot = insertTree(root,values[i]);\n\t\t}\n\t\tint[] values2 = {55,40,70,30,45};\n\t\tfor(int i=0;i<values.length;i++)\n\t\t{\n\t\t\troot2 = insertTree(root2,values[i]);\n\t\t}\n\t\ttraverseInorder(root);\n\t\tif(checkIfSimilar(root,root2))\n\t\t{\n\t\t\tSystem.out.println(\"Trees are similar\");\n\t\t}\n\t\t\n\t}","title":""},{"docid":"fd3f2496c6fe33067d76ea6d18198f17","score":"0.55154514","text":"private boolean equals(Node node1, Node node2) {\n\t\tif (node1 == null || node2 == null) { // If either node is null, return their comparison\n\t\t\tif(node1 == node2) {\n\t\t\t\treturn true;\n\t\t\t} else {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\tif (!node1.data.equals(node2.data)) { // If corresponding nodes !=\n\t\t\treturn false;\n\t\t}\n\n\t\treturn equals(node1.left, node2.left) && equals(node1.right, node2.right);\n\t}","title":""},{"docid":"b1f3cd596ba8f9e265b65e8b783aca35","score":"0.5513198","text":"@Override\n public boolean equals(Object o){\n if(!(o instanceof Alignment)){\n return false;\n }\n Alignment a2 = (Alignment) o;\n for (Node n1 : this.getAlignedNodesNet1()){\n for(Node n2 : this.getAlignedNodesNet2()){\n if(this.isMapped(n1,n2) && !a2.isMapped(n1,n2) || !this.isMapped(n1,n2) && a2.isMapped(n1,n2)){\n return false;\n }\n }\n }\n\n for (Node n1 : a2.getAlignedNodesNet1()){\n for(Node n2 : a2.getAlignedNodesNet2()){\n if(this.isMapped(n1,n2) && !a2.isMapped(n1,n2) || !this.isMapped(n1,n2) && a2.isMapped(n1,n2)){\n return false;\n }\n }\n }\n return true;\n }","title":""},{"docid":"b5884319a657f5d8eb74a07c9ad9b299","score":"0.5504544","text":"public static <T extends ElkEntity> boolean equals(\n\t\t\tfinal Taxonomy<T> taxonomy1, final Taxonomy<T> taxonomy2) {\n\n\t\tif (taxonomy1 == null) {\n\t\t\treturn taxonomy2 == null;\n\t\t}\n\t\tif (taxonomy2 == null) {\n\t\t\treturn false;\n\t\t}\n\n\t\t// Each node must have the same sets of members, parents and children\n\n\t\tfinal Set<? extends TaxonomyNode<T>> nodes1 = taxonomy1.getNodes();\n\t\tfinal Set<? extends TaxonomyNode<T>> nodes2 = taxonomy2.getNodes();\n\n\t\tif (nodes1.size() != nodes2.size()) {\n\t\t\treturn false;\n\t\t}\n\t\tfor (final TaxonomyNode<T> node1 : nodes1) {\n\n\t\t\tfinal T thisMember = node1.getCanonicalMember();\n\t\t\tfinal TaxonomyNode<T> node2 = taxonomy2.getNode(thisMember);\n\t\t\tif (node2 == null) {\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t// Members\n\t\t\tif (node1.size() != node2.size()) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tfor (final T member : node1) {\n\t\t\t\tif (!node2.contains(member)) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Parents\n\t\t\tfinal Set<? extends TaxonomyNode<T>> parents1 = node1\n\t\t\t\t\t.getDirectSuperNodes();\n\t\t\tfinal Set<? extends TaxonomyNode<T>> parents2 = node2\n\t\t\t\t\t.getDirectSuperNodes();\n\t\t\tif (parents1.size() != parents2.size()) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tfor (final TaxonomyNode<T> parent1 : parents1) {\n\t\t\t\t// While all nodes must be the same, it is sufficient to compare\n\t\t\t\t// canonical members.\n\t\t\t\tfinal TaxonomyNode<T> parent2 = taxonomy2\n\t\t\t\t\t\t.getNode(parent1.getCanonicalMember());\n\t\t\t\t/*\n\t\t\t\t * otherParent is a node from taxonomy2 (or null), so\n\t\t\t\t * contains(Object) on a node set from taxonomy2 should work for\n\t\t\t\t * it as expected.\n\t\t\t\t */\n\t\t\t\tif (!parents2.contains(parent2)) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Children\n\t\t\tfinal Set<? extends TaxonomyNode<T>> children1 = node1\n\t\t\t\t\t.getDirectSubNodes();\n\t\t\tfinal Set<? extends TaxonomyNode<T>> children2 = node2\n\t\t\t\t\t.getDirectSubNodes();\n\t\t\tif (children1.size() != children2.size()) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tfor (final TaxonomyNode<T> child1 : children1) {\n\t\t\t\t// While all nodes must be the same, it is sufficient to compare\n\t\t\t\t// canonical members.\n\t\t\t\tfinal TaxonomyNode<T> child2 = taxonomy2\n\t\t\t\t\t\t.getNode(child1.getCanonicalMember());\n\t\t\t\t/*\n\t\t\t\t * otherParent is a node from taxonomy2 (or null), so\n\t\t\t\t * contains(Object) on a node set from taxonomy2 should work for\n\t\t\t\t * it as expected.\n\t\t\t\t */\n\t\t\t\tif (!children2.contains(child2)) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t\t// No difference found ;-)\n\t\treturn true;\n\t}","title":""},{"docid":"01bf08340efd033b3bdc927f0f5d4883","score":"0.5461961","text":"@Test\r\n\tpublic void checkEquality() {\r\n\r\n\t\tBasicTestTree object = new BasicTestTree();\r\n\t\tBasicTestTree equalObject = new BasicTestTree();\r\n\t\tBasicTestTree unequalObject = null;\r\n\r\n\t\t// ---- Check bad arguments to equals. ---- //\r\n\t\t// Check the default equals method.\r\n\t\tassertFalse(object.equals(unequalObject));\r\n\t\tassertFalse(object.equals(\"some string\"));\r\n\t\t// Check the tree equals method.\r\n\t\tassertFalse(object.equals(unequalObject, false));\r\n\t\tassertFalse(object.equals(unequalObject, true));\r\n\t\t// ---------------------------------------- //\r\n\r\n\t\t// ---- Check the base case: two single nodes. ---- //\r\n\t\t// The references are not the same.\r\n\t\tassertNotSame(object, equalObject);\r\n\r\n\t\t// Check the default equals method in both directions.\r\n\t\t// Reflexive check.\r\n\t\tassertTrue(object.equals(object));\r\n\t\t// Symmetric check.\r\n\t\tassertTrue(object.equals(equalObject));\r\n\t\tassertTrue(equalObject.equals(object));\r\n\t\t// Check the tree equals method in both directions.\r\n\t\t// Reflexive check.\r\n\t\tassertTrue(object.equals(object, false));\r\n\t\tassertTrue(object.equals(object, true));\r\n\t\t// Symmetric check.\r\n\t\tassertTrue(object.equals(equalObject, false));\r\n\t\tassertTrue(object.equals(equalObject, true));\r\n\t\tassertTrue(equalObject.equals(object, false));\r\n\t\tassertTrue(equalObject.equals(object, true));\r\n\r\n\t\t// Check their hash codes!\r\n\t\tassertEquals(object.hashCode(), equalObject.hashCode());\r\n\t\tassertEquals(object.hashCode(false), equalObject.hashCode(false));\r\n\t\tassertEquals(object.hashCode(true), equalObject.hashCode(true));\r\n\t\t// ------------------------------------------------ //\r\n\r\n\t\t// ---- Try changing the properties. ---- //\r\n\t\tunequalObject = new BasicTestTree();\r\n\t\tobject.property = \"derp\";\r\n\t\tequalObject.property = \"derp\";\r\n\r\n\t\t// The references are not the same.\r\n\t\tassertNotSame(object, equalObject);\r\n\t\tassertNotSame(object, unequalObject);\r\n\t\tassertNotSame(equalObject, unequalObject);\r\n\r\n\t\t// The next tests check equality between object and equalObject.\r\n\r\n\t\t// Check the default equals method in both directions.\r\n\t\t// Reflexive check.\r\n\t\tassertTrue(object.equals(object));\r\n\t\t// Symmetric check.\r\n\t\tassertTrue(object.equals(equalObject));\r\n\t\tassertTrue(equalObject.equals(object));\r\n\t\t// Check the tree equals method in both directions.\r\n\t\t// Reflexive check.\r\n\t\tassertTrue(object.equals(object, false));\r\n\t\tassertTrue(object.equals(object, true));\r\n\t\t// Symmetric check.\r\n\t\tassertTrue(object.equals(equalObject, false));\r\n\t\tassertTrue(object.equals(equalObject, true));\r\n\t\tassertTrue(equalObject.equals(object, false));\r\n\t\tassertTrue(equalObject.equals(object, true));\r\n\r\n\t\t// Check their hash codes!\r\n\t\tassertEquals(object.hashCode(), equalObject.hashCode());\r\n\t\tassertEquals(object.hashCode(false), equalObject.hashCode(false));\r\n\t\tassertEquals(object.hashCode(true), equalObject.hashCode(true));\r\n\r\n\t\t// The next tests check inequality between object and unequalObject and\r\n\t\t// between equalObject and unequalObject.\r\n\r\n\t\t// Check the default equals against the unequal object.\r\n\t\tassertFalse(object.equals(unequalObject));\r\n\t\tassertFalse(unequalObject.equals(object));\r\n\t\tassertFalse(equalObject.equals(unequalObject));\r\n\t\tassertFalse(unequalObject.equals(equalObject));\r\n\r\n\t\t// Check the tree equals against the unequal object.\r\n\t\tassertFalse(object.equals(unequalObject, false));\r\n\t\tassertFalse(object.equals(unequalObject, true));\r\n\t\tassertFalse(unequalObject.equals(object, false));\r\n\t\tassertFalse(unequalObject.equals(object, true));\r\n\t\tassertFalse(equalObject.equals(unequalObject, false));\r\n\t\tassertFalse(equalObject.equals(unequalObject, true));\r\n\t\tassertFalse(unequalObject.equals(equalObject, false));\r\n\t\tassertFalse(unequalObject.equals(equalObject, true));\r\n\r\n\t\t// Check their hash codes!\r\n\t\tassertFalse(object.hashCode() == unequalObject.hashCode());\r\n\t\tassertFalse(object.hashCode(false) == unequalObject.hashCode(false));\r\n\t\tassertFalse(object.hashCode(true) == unequalObject.hashCode(true));\r\n\t\tassertFalse(equalObject.hashCode() == unequalObject.hashCode());\r\n\t\tassertFalse(\r\n\t\t\t\tequalObject.hashCode(false) == unequalObject.hashCode(false));\r\n\t\tassertFalse(equalObject.hashCode(true) == unequalObject.hashCode(true));\r\n\t\t// -------------------------------------- //\r\n\r\n\t\t// ---- Try a more complicated tree. ---- //\r\n\t\tBasicTestTree tree1;\r\n\t\tBasicTestTree tree2;\r\n\r\n\t\t// Create a tree with 4 elements as follows:\r\n\t\t// Breadth first order: ABCD, A has children B and C, C has child D.\r\n\t\tobject = new BasicTestTree();\r\n\t\tobject.property = \"A\";\r\n\t\ttree1 = new BasicTestTree();\r\n\t\ttree1.property = \"B\";\r\n\t\tobject.addChild(tree1);\r\n\t\ttree1 = new BasicTestTree();\r\n\t\ttree1.property = \"C\";\r\n\t\tobject.addChild(tree1);\r\n\t\ttree2 = new BasicTestTree();\r\n\t\ttree2.property = \"D\";\r\n\t\ttree1.addChild(tree2);\r\n\r\n\t\t// Duplicate the tree for the equals tree.\r\n\t\tequalObject = new BasicTestTree();\r\n\t\tequalObject.property = \"A\";\r\n\t\ttree1 = new BasicTestTree();\r\n\t\ttree1.property = \"B\";\r\n\t\tequalObject.addChild(tree1);\r\n\t\ttree1 = new BasicTestTree();\r\n\t\ttree1.property = \"C\";\r\n\t\tequalObject.addChild(tree1);\r\n\t\ttree2 = new BasicTestTree();\r\n\t\ttree2.property = \"D\";\r\n\t\ttree1.addChild(tree2);\r\n\r\n\t\t// For an unequal tree, create a different tree with the same\r\n\t\t// breadth-first order (just add all nodes to A).\r\n\t\tunequalObject = new BasicTestTree();\r\n\t\tunequalObject.property = \"A\";\r\n\t\ttree1 = new BasicTestTree();\r\n\t\ttree1.property = \"B\";\r\n\t\tunequalObject.addChild(tree1);\r\n\t\ttree1 = new BasicTestTree();\r\n\t\ttree1.property = \"C\";\r\n\t\tunequalObject.addChild(tree1);\r\n\t\ttree2 = new BasicTestTree();\r\n\t\ttree2.property = \"D\";\r\n\t\tunequalObject.addChild(tree2); // Different!\r\n\r\n\t\t// The references are not the same.\r\n\t\tassertNotSame(object, equalObject);\r\n\t\tassertNotSame(object, unequalObject);\r\n\t\tassertNotSame(equalObject, unequalObject);\r\n\r\n\t\t// The next tests check equality between object and equalObject.\r\n\r\n\t\t// Check the default equals method in both directions.\r\n\t\t// Reflexive check.\r\n\t\tassertTrue(object.equals(object));\r\n\t\t// Symmetric check.\r\n\t\tassertTrue(object.equals(equalObject));\r\n\t\tassertTrue(equalObject.equals(object));\r\n\t\t// Check the tree equals method in both directions.\r\n\t\t// Reflexive check.\r\n\t\tassertTrue(object.equals(object, false));\r\n\t\tassertTrue(object.equals(object, true));\r\n\t\t// Symmetric check.\r\n\t\tassertTrue(object.equals(equalObject, false));\r\n\t\tassertTrue(object.equals(equalObject, true));\r\n\t\tassertTrue(equalObject.equals(object, false));\r\n\t\tassertTrue(equalObject.equals(object, true));\r\n\r\n\t\t// Check their hash codes!\r\n\t\tassertEquals(object.hashCode(), equalObject.hashCode());\r\n\t\tassertEquals(object.hashCode(false), equalObject.hashCode(false));\r\n\t\tassertEquals(object.hashCode(true), equalObject.hashCode(true));\r\n\r\n\t\t// The next tests check inequality between object and unequalObject and\r\n\t\t// between equalObject and unequalObject.\r\n\r\n\t\t// Check the default equals against the unequal object.\r\n\t\t// Note: This will return true because the tree's structure is not\r\n\t\t// tested!\r\n\t\tassertTrue(object.equals(unequalObject));\r\n\t\tassertTrue(unequalObject.equals(object));\r\n\t\tassertTrue(equalObject.equals(unequalObject));\r\n\t\tassertTrue(unequalObject.equals(equalObject));\r\n\r\n\t\t// Check the tree equals against the unequal object.\r\n\t\t// Note: When passing in fullTree as false, the tree's structure is not\r\n\t\t// tested!\r\n\t\tassertTrue(object.equals(unequalObject, false));\r\n\t\tassertFalse(object.equals(unequalObject, true));\r\n\t\tassertTrue(unequalObject.equals(object, false));\r\n\t\tassertFalse(unequalObject.equals(object, true));\r\n\t\tassertTrue(equalObject.equals(unequalObject, false));\r\n\t\tassertFalse(equalObject.equals(unequalObject, true));\r\n\t\tassertTrue(unequalObject.equals(equalObject, false));\r\n\t\tassertFalse(unequalObject.equals(equalObject, true));\r\n\r\n\t\t// Check their hash codes! Note: The hash codes will be equal for the\r\n\t\t// default hashCode() and the tree hashCode() with fullTree set to\r\n\t\t// false, since only the node itself, and not its subtree, is hashed.\r\n\t\tassertTrue(object.hashCode() == unequalObject.hashCode());\r\n\t\tassertTrue(object.hashCode(false) == unequalObject.hashCode(false));\r\n\t\tassertFalse(object.hashCode(true) == unequalObject.hashCode(true));\r\n\t\tassertTrue(equalObject.hashCode() == unequalObject.hashCode());\r\n\t\tassertTrue(\r\n\t\t\t\tequalObject.hashCode(false) == unequalObject.hashCode(false));\r\n\t\tassertFalse(equalObject.hashCode(true) == unequalObject.hashCode(true));\r\n\t\t// -------------------------------------- //\r\n\r\n\t\t// ---- Try comparing against another type of BasicTree. ---- //\r\n\t\tFakeBasicTestTree fakeObject = new FakeBasicTestTree();\r\n\t\tassertFalse(object.equals(fakeObject));\r\n\t\t// ---------------------------------------------------------- //\r\n\r\n\t\treturn;\r\n\t}","title":""},{"docid":"26120eea184077e9aa12cabe3d6f6721","score":"0.54612845","text":"public static boolean isIdentical(Node<?> firstTreeHead,\n\t\t\tNode<?> secondTreeHead) {\n\t\t\n\t\tif (firstTreeHead != null && secondTreeHead != null) {\n\t\t\tif (firstTreeHead.element == secondTreeHead.element) {\n\t\t\t\tboolean isLeftIdentical = isIdentical(\n\t\t\t\t\t\tfirstTreeHead.left, secondTreeHead.left);\n\t\t\t\tboolean isRightIdentical = isIdentical(\n\t\t\t\t\t\tfirstTreeHead.right, secondTreeHead.right);\n\t\t\t\treturn isLeftIdentical && isRightIdentical;\n\t\t\t}\n\t\t} else if (firstTreeHead == null && secondTreeHead == null) {\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}","title":""},{"docid":"c55b6f67774eca73f9f331bfdc01569b","score":"0.54317474","text":"private boolean compareArrayList(ArrayList<Item> one, ArrayList<Item> two){\n if(one.size()!=two.size()){\n return false;\n }\n for(int i = 0; i<one.size(); i++){\n if(!(one.get(i).getId().equals(two.get(i).getId()))){\n return false;\n }\n if(!(one.get(i).getType().equals(two.get(i).getType()))){\n return false;\n }\n if(!(Arrays.equals(one.get(i).getTypeVariables(), two.get(i).getTypeVariables()))){\n return false;\n }\n if(!(one.get(i).getManuID().equals(two.get(i).getManuID()))){\n return false;\n }\n if(!(one.get(i).getPrice().equals(two.get(i).getPrice()))){\n return false;\n }\n }\n return true;\n }","title":""},{"docid":"9ab13d2e50cb4e1a9e5b24ad58f6a57c","score":"0.54247415","text":"protected boolean childrenEqual(Node node1, Node node2) {\n\n boolean equal = false;\n\n childrenCheck: {\n NodeList node1Children = node1.getChildNodes();\n NodeList node2Children = node2.getChildNodes();\n\n if (node1Children == null || node2Children == null) {\n break childrenCheck;\n }\n\n if (node1Children.getLength() != node2Children.getLength()) {\n break childrenCheck;\n }\n\n // compare all the childrens\n equal = true;\n\n for (int i = 0; i < node1Children.getLength(); i++) {\n if (!compareNode(node1Children.item(i),\n node2Children.item(i))) {\n equal = false;\n break childrenCheck;\n }\n }\n }\n\n return equal;\n }","title":""},{"docid":"ad62abd40be3c62677001a263f4e9851","score":"0.5419724","text":"public int compareTo(Object other) {\n if (this == other)\n return 0;\n if (other instanceof DataBag) {\n DataBag bOther = (DataBag) other;\n if (this.size() != bOther.size()) {\n if (this.size() > bOther.size()) return 1;\n else return -1;\n }\n\n // Ugh, this is bogus. But I have to know if two bags have the\n // same tuples, regardless of order. Hopefully most of the\n // time the size check above will prevent this.\n // If either bag isn't already sorted, create a sorted bag out\n // of it so I can guarantee order.\n DataBag thisClone;\n DataBag otherClone;\n if (this instanceof SortedDataBag ||\n this instanceof DistinctDataBag) {\n thisClone = this;\n } else {\n thisClone = new SortedDataBag(null);\n Iterator<Tuple> i = iterator();\n while (i.hasNext()) thisClone.add(i.next());\n }\n if (other instanceof SortedDataBag ||\n other instanceof DistinctDataBag) {\n otherClone = bOther;\n } else {\n otherClone = new SortedDataBag(null);\n Iterator<Tuple> i = bOther.iterator();\n while (i.hasNext()) otherClone.add(i.next());\n }\n Iterator<Tuple> thisIt = thisClone.iterator();\n Iterator<Tuple> otherIt = otherClone.iterator();\n while (thisIt.hasNext() && otherIt.hasNext()) {\n Tuple thisT = thisIt.next();\n Tuple otherT = otherIt.next();\n \n int c = thisT.compareTo(otherT);\n if (c != 0) return c;\n }\n \n return 0; // if we got this far, they must be equal\n } else {\n return DataType.compare(this, other);\n }\n }","title":""},{"docid":"81fbbc879b0326aed05a7734b34f76b9","score":"0.54193366","text":"protected boolean compareNode(Node node1, Node node2) {\n boolean equal = false;\n\n nodeCheck: {\n\n if (node1 == null || node2 == null) {\n break nodeCheck;\n }\n\n // nodevalue is short\n if (node1.getNodeType() != node2.getNodeType()) {\n break nodeCheck;\n }\n\n // nodeName will not be null\n if (!node1.getNodeName().equals(node2.getNodeName())) {\n break nodeCheck;\n }\n\n // nodeValue can be null for a lot of type of cells\n if (node1.getNodeValue() == null && node2.getNodeValue() == null) {\n // empty\n } else if (node1.getNodeValue() == null ||\n node2.getNodeValue() == null) {\n break nodeCheck;\n } else if (!node1.getNodeValue().equals(node2.getNodeValue())) {\n break nodeCheck;\n }\n\n // try to compare attributes \n if (!attributesEqual(node1, node2)) {\n break nodeCheck;\n }\n\n // don't need to compare if both node do not have children\n if (!node1.hasChildNodes() && !node2.hasChildNodes()) {\n equal = true;\n break nodeCheck;\n // don't need to compare if one node has children but not the other\n } else if (!node1.hasChildNodes() || !node2.hasChildNodes()) {\n equal = false;\n break nodeCheck;\n // need to compare if both node has children \n } else if (!childrenEqual(node1, node2)) {\n break nodeCheck;\n }\n\n equal = true;\n }\n\n return equal;\n }","title":""},{"docid":"cced44d3d98b7baa90e464d29fff03fd","score":"0.5389329","text":"public void testEquality() throws Exception\r\n {\r\n // null parameter\r\n DataObject dobj1 = getRootDataObject(\"data\", \"copy1.xml\");\r\n DataObject dobj2 = getRootDataObject(\"data\", \"copy2.xml\");\r\n assertFalse(equalityHelper.equalShallow(dobj1, null));\r\n assertFalse(equalityHelper.equal(dobj1, null));\r\n assertTrue(equalityHelper.equalShallow(null, null));\r\n assertTrue(equalityHelper.equal(null, null));\r\n // two data objects of different types\r\n assertFalse(equalityHelper.equalShallow(dobj1, dobj2));\r\n assertFalse(equalityHelper.equal(dobj1, dobj2));\r\n }","title":""},{"docid":"da12643ee6dfa365095d44dd6c09f028","score":"0.53852373","text":"@Override\n public int compare(Object object1, Object object2) {\n ArrayList<ArrayList<Comparable>> array1 = (ArrayList<ArrayList<Comparable>>) object1;\n ArrayList<ArrayList<Comparable>> array2 = (ArrayList<ArrayList<Comparable>>) object2;\n assert array1.size() > 0 && array2.size() > 0 : \"Empty ArrayList\"; //Ensures that any bugs that happen can be easily resolved\n //First checks if the sizes are the same\n if (array1.size() < array2.size()) {\n return -1;\n } else if (array1.size() > array2.size()) {\n return 1;\n }\n if (array1.get(0).size() < array2.get(0).size()) {\n return -1;\n } else if (array1.get(0).size() > array2.get(0).size()) {\n return 1;\n }\n //Same sizes; checks for content\n for (int i = 0; i < array1.size(); i++) { //Goes thru every single index of both arrays and compare then\n for (int j = 0; j < array1.get(0).size(); j++) {\n //If index by index they are not the same\n if (array1.get(i).get(j).compareTo(array2.get(i).get(j)) > 0) {\n return 1;\n } else if (array1.get(i).get(j).compareTo(array2.get(i).get(j)) < 0) {\n return -1;\n }\n }\n }\n return 0;\n }","title":""},{"docid":"ed17f58a20cb849686225f3d3842f04a","score":"0.53778696","text":"public static Boolean isEqual(Object left, Object right, EvaluationContext ctx ) {\n if ( left == null || right == null ) {\n return left == right;\n }\n\n // spec defines that \"a=[a]\", i.e., singleton collections should be treated as the single element\n // and vice-versa\n if( left instanceof Collection && !(right instanceof Collection) && ((Collection)left).size() == 1 ) {\n left = ((Collection)left).toArray()[0];\n } else if( right instanceof Collection && !(left instanceof Collection) && ((Collection)right).size()==1 ) {\n right = ((Collection) right).toArray()[0];\n }\n\n if( left instanceof Range && right instanceof Range ) {\n return isEqual( (Range)left, (Range) right );\n } else if( left instanceof Iterable && right instanceof Iterable ) {\n return isEqual( (Iterable)left, (Iterable) right );\n } else if( left instanceof Map && right instanceof Map ) {\n return isEqual( (Map)left, (Map) right );\n } else if (left instanceof ChronoPeriod && right instanceof ChronoPeriod) {\n // periods have special compare semantics in FEEL as it ignores \"days\". Only months and years are compared\n Long l = ComparablePeriod.toTotalMonths((ChronoPeriod) left);\n Long r = ComparablePeriod.toTotalMonths((ChronoPeriod) right);\n return isEqual(l, r);\n } else if (left instanceof TemporalAccessor && right instanceof TemporalAccessor) {\n // Handle specific cases when both time / datetime\n TemporalAccessor l = (TemporalAccessor) left;\n TemporalAccessor r = (TemporalAccessor) right;\n if (BuiltInType.determineTypeFromInstance(left) == BuiltInType.TIME && BuiltInType.determineTypeFromInstance(right) == BuiltInType.TIME) {\n return isEqual(valuet(l), valuet(r));\n } else if (BuiltInType.determineTypeFromInstance(left) == BuiltInType.DATE_TIME && BuiltInType.determineTypeFromInstance(right) == BuiltInType.DATE_TIME) {\n return isEqual(valuedt(l, r.query(TemporalQueries.zone())), valuedt(r, l.query(TemporalQueries.zone())));\n } // fallback; continue:\n }\n return compare( left, right, ctx, (l, r) -> l.compareTo( r ) == 0 );\n }","title":""},{"docid":"397e1b0d3a706e94988852662c2c7796","score":"0.53617805","text":"@Test\n public void testRemoveAll1() {\n System.out.println(\"RemoveAll test #1\");\n AVLTree<Integer> tree1 = new AVLTree();\n tree1.add(1);\n tree1.add(2);\n tree1.add(3);\n AVLTree<Integer> tree2 = new AVLTree();\n tree2.add(4);\n tree2.add(5);\n tree2.add(6);\n boolean res = tree1.removeAll(tree2);\n if (!res) {\n System.out.println(\"Successful\");\n } else {\n fail(\"Test is not passed\");\n }\n }","title":""},{"docid":"77e0348637d9d789a064ed43bac6e999","score":"0.5351761","text":"public static boolean equal(Type r1, Type r2) {\n if (Objects.equals(r1, r2)) {\n return true; //if they are ALREADY equal, return true\n }\n if (r1 == null || r2 == null) {\n //System.out.println( \"ONE NULL\" );\n return false;\n }\n if( r1.getClass() != r2.getClass() ){\n return false;\n }\n if( r1.isUnionType() && r2.isUnionType() ){ //UnionTypes \"A | B\" == \"B | A\"\n UnionType ut1 = r1.asUnionType();\n UnionType ut2 = r2.asUnionType();\n NodeList<ReferenceType> rts1 = ut1.getElements();\n NodeList<ReferenceType> rts2 = ut2.getElements();\n if( rts1.size() != rts2.size() ){\n return false;\n }\n return rts1.stream().allMatch( r-> rts2.stream().anyMatch(a-> equal(a, r)));\n }\n //if ONE or the OTHER is fully\n boolean r1FullyQualified = r1.asString().contains(\".\");\n boolean r2FullyQualified = r2.asString().contains(\".\");\n\n //OK, what I have to do is tokenize based on < > , space\n //ok, really... what I have to do is \"build\" tokens\n //XOR, if ONE or the OTHER (NOT BOTH or NEITHER) are fully qualified\n if ((r1FullyQualified || r2FullyQualified) && !(r1FullyQualified && r2FullyQualified)) {\n List<String> r1Toks = tokenize(r1.asString());\n List<String> r2Toks = tokenize(r2.asString());\n if (r1Toks.size() != r2Toks.size()) {\n return false;\n }\n for (int i = 0; i < r1Toks.size(); i++) {\n if (!r1Toks.get(i).equals(r2Toks.get(i))) {\n r1FullyQualified = r1Toks.get(i).contains(\".\");\n r2FullyQualified = r2Toks.get(i).contains(\".\");\n\n if ((r1FullyQualified || r2FullyQualified) && !(r1FullyQualified && r2FullyQualified)) {\n String s1 = r1Toks.get(i);\n if (s1.contains(\".\")) {\n s1 = s1.substring(s1.lastIndexOf(\".\") + 1);\n }\n String s2 = r2Toks.get(i);\n if (s2.contains(\".\")) {\n s2 = s2.substring(s2.lastIndexOf(\".\") + 1);\n }\n //\n if (!s1.equals(s2)) {\n return false;\n }\n }\n }\n }\n return true;\n }\n //here we could have both types that have '.'s but one is from an inner class\n // i.e.\n // _typeRef _t1 = _typeRef.of(\"_enum._constant\");\n // _typeRef _t2 = _typeRef.of(\"org.jdraft._enum._constant\");\n //ok... lets parse out the first\n\n List<String> t1s = tokenize(r1);\n List<String> t2s = tokenize(r2);\n if (t1s.size() != t2s.size()) {\n return false;\n }\n String s1n = t1s.get(0); //get the first (type) token\n String s2n = t2s.get(0); //get the second (type) token\n int dotIndex1 = s1n.lastIndexOf('.');\n int dotIndex2 = s2n.lastIndexOf('.');\n if( dotIndex1 > 0 ){ //this means BOTH must be qualified (partially or otherwise)\n //Log.info( \"BOTH PARTIALLY QUALIFIED\");\n if( s1n.contains(s2n) || s2n.contains(s1n) ){ //compare that either one contains the other JUST THE NAME NOT GENERICS\n //String normalizedName = s1n.substring(dotIndex);\n String t1 = r1.asString().substring(dotIndex1+1);\n String t2 = r2.asString().substring(dotIndex2+1);\n //call types equal on the SIMPLE type name and (potentially) any generics after it\n return equal( of(t1), of(t2));\n }\n }\n return false;\n }","title":""},{"docid":"86992611cd0d4d0d48f1105bcee4ea5f","score":"0.53502303","text":"@Test\n public void equalToTest(){\n NeapolitanCard c1 = new NeapolitanCard('1','B');\n NeapolitanCard c2 = new NeapolitanCard('1','B');\n NeapolitanCard c3 = new NeapolitanCard('K','B');\n NeapolitanCard c4 = new NeapolitanCard('1','G');\n NeapolitanCard c5 = new NeapolitanCard('4','G');\n\n assertTrue(c1.equalTo(c2));\n assertTrue(!c1.equalTo(c3));\n assertTrue(!c1.equalTo(c4));\n assertTrue(!c1.equalTo(c5));\n\n for(int i = 0; i < cardsCollection1.length; i++){\n for(int j = 0; j < cardsCollection1.length;j++){\n if(i == j)\n assertTrue(cardsCollection1[i].equalTo(cardsCollection1[j]));\n else\n assertTrue(!cardsCollection1[i].equalTo(cardsCollection1[j]));\n }\n }\n }","title":""},{"docid":"6a1a076ce8eb1920f8426795e3ac0da7","score":"0.534387","text":"public static boolean sameAs (RadioStation lhs, RadioStation rhs)\n {\n RadioOBJComparator comparator = new RadioOBJComparator();\n if (comparator.compare(lhs,rhs) == 0)\n return true;\n else\n return false;\n }","title":""},{"docid":"40a9f6ecc6c94b2714585bbe48f7739a","score":"0.5343375","text":"@Override\n public boolean equals(Object o) {\n if (this == o) return true;\n if (o == null || getClass() != o.getClass()) return false;\n AU au = (AU) o;\n return Objects.equals(left, au.left) &&\n Objects.equals(right, au.right);\n }","title":""},{"docid":"590172ff1a9a6fd53ff9f3e878b23102","score":"0.5336628","text":"public boolean equalValues() {\n\n try {\n ValueParser vp = new ValueParser(actual);\n ValueTagParser vtp = new ValueTagParser(expected);\n // TODO - what if the number of values in the actual and expected are different ?\n if (vtp.hasNext()) {\n String actualValue = vp.nextValue();\n String expectedValue = vtp.next();\n // System.out.println( actualValue + \" =? \" + expectedValue );\n boolean result = ValueComparator.compareTolerance(actualValue,\n expectedValue);\n if (!result) {\n return false;\n }\n }\n return true;\n } catch (Exception e) {\n // TODO - Decide how to handle the exception\n return false;\n }\n }","title":""},{"docid":"9a41b03297243a744e4b5464df1e10e8","score":"0.53359115","text":"public boolean similar(Object other) {\n/* 1258 */ if (!(other instanceof JSONArray)) {\n/* 1259 */ return false;\n/* */ }\n/* 1261 */ int len = length();\n/* 1262 */ if (len != ((JSONArray)other).length()) {\n/* 1263 */ return false;\n/* */ }\n/* 1265 */ for (int i = 0; i < len; i++) {\n/* 1266 */ Object valueThis = this.myArrayList.get(i);\n/* 1267 */ Object valueOther = ((JSONArray)other).myArrayList.get(i);\n/* 1268 */ if (valueThis != valueOther) {\n/* */ \n/* */ \n/* 1271 */ if (valueThis == null) {\n/* 1272 */ return false;\n/* */ }\n/* 1274 */ if (valueThis instanceof JSONObject) {\n/* 1275 */ if (!((JSONObject)valueThis).similar(valueOther)) {\n/* 1276 */ return false;\n/* */ }\n/* 1278 */ } else if (valueThis instanceof JSONArray) {\n/* 1279 */ if (!((JSONArray)valueThis).similar(valueOther)) {\n/* 1280 */ return false;\n/* */ }\n/* 1282 */ } else if (!valueThis.equals(valueOther)) {\n/* 1283 */ return false;\n/* */ } \n/* */ } \n/* 1286 */ } return true;\n/* */ }","title":""},{"docid":"a210ba025a913836ee1b458127134844","score":"0.532939","text":"public static <V extends Comparable<V>, E extends Comparable<E>> boolean isIsomorphic(GraphIsomorphismVertex<V,E> root1, GraphIsomorphismVertex<V,E> root2){\n\t\treturn isIsomorphic(root1, root2, new HashSet<Integer>(), new HashSet<Integer>());\n\t}","title":""},{"docid":"cc31c018676311011d591e4c38aa6e24","score":"0.5322149","text":"@Test\n public void equals() {\n assertTrue(PROJECT_BOOK_WITH_UI.equals(PROJECT_BOOK_WITH_UI));\n\n // different types -> returns false\n assertFalse(PROJECT_BOOK_WITH_UI.equals(\"1\"));\n\n // null -> return false\n assertFalse(PROJECT_BOOK_WITH_UI.equals(null));\n\n //same viewMode, project, predicate, comparator -> return true\n ProjectBookWithUi sameProjectbookWithUi = new ProjectBookWithUi(new ProjectBook(), ViewMode.TASKS,\n VALID_PROJECT, Model.PREDICATE_SHOW_ALL_TRACKED_ITEMS, NAME_COMPARE, true, USER_PREFS, true);\n assertTrue(PROJECT_BOOK_WITH_UI.equals(sameProjectbookWithUi));\n\n //same viewMode, both projects null, same predicate, same comparator -> return true\n ProjectBookWithUi nullProjectBookWithUi =\n new ProjectBookWithUi(new ProjectBook(), ViewMode.TASKS, null,\n Model.PREDICATE_SHOW_ALL_TRACKED_ITEMS, NAME_COMPARE, true, USER_PREFS, true);\n sameProjectbookWithUi = new ProjectBookWithUi(new ProjectBook(), ViewMode.TASKS,\n null, Model.PREDICATE_SHOW_ALL_TRACKED_ITEMS, NAME_COMPARE, true, USER_PREFS, true);\n assertTrue(nullProjectBookWithUi.equals(sameProjectbookWithUi));\n\n // different viewMode -> return false\n ProjectBookWithUi differentProjectbookWithUi = new ProjectBookWithUi(new ProjectBook(), ViewMode.PROJECTS,\n VALID_PROJECT, Model.PREDICATE_SHOW_ALL_TRACKED_ITEMS, NAME_COMPARE, true, USER_PREFS, true);\n assertFalse(PROJECT_BOOK_WITH_UI.equals(differentProjectbookWithUi));\n\n // different project -> returns false\n Project otherProject = new ProjectBuilder().withName(\"OTHER\").build();\n differentProjectbookWithUi = new ProjectBookWithUi(new ProjectBook(), ViewMode.TASKS,\n otherProject, Model.PREDICATE_SHOW_ALL_TRACKED_ITEMS, NAME_COMPARE, true, USER_PREFS, true);\n assertFalse(PROJECT_BOOK_WITH_UI.equals(differentProjectbookWithUi));\n\n // different tags visibility -> returns false\n differentProjectbookWithUi = new ProjectBookWithUi(new ProjectBook(), ViewMode.TASKS,\n VALID_PROJECT, Model.PREDICATE_SHOW_ALL_TRACKED_ITEMS, NAME_COMPARE, false, USER_PREFS, true);\n assertFalse(PROJECT_BOOK_WITH_UI.equals(differentProjectbookWithUi));\n\n // different predicate -> returns false\n Predicate<TrackedItem> completePredicate =\n new CompletionStatusPredicate(FindType.ALL, Arrays.asList(CompletionStatusPredicate.INCOMPLETE_KEYWORD));\n differentProjectbookWithUi = new ProjectBookWithUi(new ProjectBook(), ViewMode.TASKS,\n otherProject, completePredicate, NAME_COMPARE, true, USER_PREFS, true);\n assertFalse(PROJECT_BOOK_WITH_UI.equals(differentProjectbookWithUi));\n\n // different user prefs -> returns false\n ReadOnlyUserPrefs otherUserPrefs =\n new UserPrefs().returnChangedGuiThemeSettings(new GuiThemeSettings(new Theme(Theme.ThemeType.LIGHT)));\n differentProjectbookWithUi = new ProjectBookWithUi(new ProjectBook(), ViewMode.TASKS,\n VALID_PROJECT, Model.PREDICATE_SHOW_ALL_TRACKED_ITEMS, NAME_COMPARE, true, otherUserPrefs, true);\n assertFalse(PROJECT_BOOK_WITH_UI.equals(differentProjectbookWithUi));\n\n // different sort by completion status -> returns false\n differentProjectbookWithUi = new ProjectBookWithUi(new ProjectBook(), ViewMode.TASKS,\n VALID_PROJECT, Model.PREDICATE_SHOW_ALL_TRACKED_ITEMS, NAME_COMPARE, true, otherUserPrefs, false);\n assertFalse(PROJECT_BOOK_WITH_UI.equals(differentProjectbookWithUi));\n }","title":""},{"docid":"e1c3b1b0ef750a048e2761057deb3324","score":"0.5316336","text":"@Test\n\tpublic void testNestedIdenticalXmls(){\n\t\tString xml1=\"<?xml version=\\\"1.0\\\"?> <node> <element att1=\\\"a\\\" att2=\\\"b\\\"/><element>Test</element></node>\";\n\t\tString xml2=\"<?xml version=\\\"1.0\\\"?> <node> <element att1=\\\"a\\\" att2=\\\"b\\\"/><element>Test</element></node>\";\n\t\tassertTrue(xmlComparator.isXmlEqual(xml1, xml2));\n\t}","title":""},{"docid":"7b344a13d4d2907faa0b1a073f66dbd4","score":"0.5311372","text":"@Test\n\tpublic void testEqualsSameData() {\n\t\tLinkedList<Integer> ll_321 = new LinkedList<Integer>();\n\t\tLinkedList<Integer> ll_321_2 = new LinkedList<Integer>();\n\t\t\n\t\tll_321.addToFront(new Node<Integer>(new Integer(1)));\n\t\tll_321.addToFront(new Node<Integer>(new Integer(2)));\n\t\tll_321.addToFront(new Node<Integer>(new Integer(3)));\n\t\t\n\t\tll_321_2.addToFront(new Node<Integer>(new Integer(1)));\n\t\tll_321_2.addToFront(new Node<Integer>(new Integer(2)));\n\t\tll_321_2.addToFront(new Node<Integer>(new Integer(3)));\n\t\t\n\t\tassertTrue(ll_321.equals(ll_321_2));\n\t\n\t}","title":""},{"docid":"72e6548395a8031f6646ae601227f2d1","score":"0.53107387","text":"private static <T> boolean deepEquals(Collection<T> col1, Collection<T> col2) {\n\t\tif (col1.size() != col2.size()) return false;\n\t\tfinal Iterator<T> it1 = col1.iterator();\n\t\tfinal Iterator<T> it2 = col2.iterator();\n\t\twhile(it1.hasNext() && it2.hasNext()) {\n\t\t\tif (! it1.next().equals(it2.next())) return false;\n\t\t}\n\t\treturn true;\n\t}","title":""},{"docid":"79e71e43218ff4f532e1ccb1a0474fca","score":"0.5298799","text":"public static void main(String[] args) {\n\t\t\r\n\t\tint[] arr1 = {1,1};\r\n\t\tint[] arr2 = {1,-1,1};\r\n\r\n\t\tSolution sl = new Solution();\r\n\t\tTreeNode root1 = new TreeNode(arr1[0]);\r\n\t\troot1 = insertLevelOrder(arr1, root1, 0);\r\n\r\n\t\tTreeNode root2 = new TreeNode(arr2[0]);\r\n\t\troot2 = insertLevelOrder(arr2, root2, 0);\r\n\r\n\t\t//inOrder(root1);\r\n\t\t//System.out.println();\r\n\t\t\r\n\t\tSystem.out.println(sl.isSameTree(root1, root2));\r\n\t\tSystem.out.print(\" \");\r\n\t}","title":""},{"docid":"967b832df0eb86ca2cac64bc63573748","score":"0.5296544","text":"protected boolean compare(Object a, Object b)\n {\n if(a == null || b == null)\n {\n if(a != null || b != null)\n return false;\n } else\n {\n if(a.getClass().isArray() && b.getClass().isArray())\n return Arrays.equals((Object[])a, (Object[])b);\n if(a instanceof String && b instanceof String)\n return ((String)a).equalsIgnoreCase((String)b);\n if(!a.equals(b))\n return false;\n }\n return true;\n }","title":""},{"docid":"483bfd7380bfe137ec2a0176de8a8330","score":"0.52706754","text":"<T> boolean isEqual(final T src1, final T src2);","title":""},{"docid":"6758e8e6d13698df0ceadfaab55018e1","score":"0.52460474","text":"@Test \n\tpublic void testNestedSimilarXmls(){\n\t\tString xml1=\"<?xml version=\\\"1.0\\\"?>\"+\"\\n\"+\"<node> <element att1=\\\"a\\\" att2=\\\"b\\\"/><element>Test</element></node>\";\n\t\tString xml2=\"<?xml \"+\"\\n\"+\"version=\\\"1.0\\\"?> <node><element att2='b\\' att1='a\\' /> <element>Test</element></node>\";\n\t\tassertTrue(xmlComparator.isXmlEqual(xml1, xml2));\n\t}","title":""},{"docid":"d5bc265502387dfe0045ae44a7a4c60e","score":"0.5243042","text":"public boolean leetcode101(TreeNode root) {\n if (root == null) {\n return true;\n }\n Queue<TreeNode> queue1 = new LinkedList<>();\n Queue<TreeNode> queue2 = new LinkedList<>();\n queue1.offer(root.left);\n queue2.offer(root.right);\n while (queue1.size() != 0 && queue2.size() != 0) {\n TreeNode node1 = queue1.poll();\n TreeNode node2 = queue2.poll();\n if(node1 == null && node2 == null){\n continue;\n } else if (node1 == null || node2 == null || node1.val != node2.val) {\n return false;\n }\n queue1.offer(node1.left);\n queue1.offer(node1.right);\n queue2.offer(node2.right);\n queue2.offer(node2.left);\n }\n return true;\n }","title":""},{"docid":"ffa698d1242b36045ba65209154ba48f","score":"0.52378774","text":"@Override\n\tpublic boolean equals(Object object) {\n\t\tif(object == this) return true;\n\t\tif(!(object instanceof Tree)) return false;\n\n\t\tTree tree = (Tree)object;\n\t\tboolean b = tree.data.equals(data);\n\t\tif(tree.left != null) b = (b && tree.left.equals(left));\n\t\tif(tree.right != null) b = (b && tree.right.equals(right));\n\t\tif(tree.parent != null) b = (b && tree.parent.equals(parent));\n\t\tb = (b && tree.size() == size);\n\t\treturn b;\n\t}","title":""},{"docid":"7c654bf389deddc3aea789dea8162f0f","score":"0.5237531","text":"public boolean equals(Stack other) {\n\t\t\n\t\tif(elements() == other.elements()){\n\t\t\tfor(int i = 0; i < other.elements(); i++){\n\t\t\t\t\n\t\t\t\tif(stack[i] != other.stack[i]){\n\t\t\t\t\t\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t}else{\n\t\t\t\n\t\t\treturn false;\n\t\t\t\n\t\t}\n\t\t\n\t\treturn true;\n\t\t\n\t}","title":""},{"docid":"c6e059562898966134da61f416a545e0","score":"0.52373934","text":"@Test\n\tpublic void testEqualsOneNodeSameVals() {\n\t\tLinkedList<Integer> ll11 = new LinkedList<Integer>();\n\t\tLinkedList<Integer> ll12 = new LinkedList<Integer>();\n\t\tll11.addToFront(new Node<Integer>(new Integer(1)));\n\t\tll12.addToFront(new Node<Integer>(new Integer(1)));\n\t\tassertEquals(ll11, ll12);\n\t}","title":""},{"docid":"907512d7aa4b5df34f5b10610a2b9f9e","score":"0.5230538","text":"public static boolean equals(Tensor t1, Tensor t2, double delta) {\n if (t1 == t2)\n return true;\n if (t2 == null)\n return false;\n if (!Arrays.equals(t1.dims, t2.dims))\n return false;\n if (!t1.s.equals(t2.s))\n return false;\n if (t1.values.length != t2.values.length)\n return false;\n for (int i=0; i<t1.values.length; i++) {\n if (!t1.s.eq(t1.values[i], t2.values[i], delta))\n return false;\n }\n return true;\n }","title":""},{"docid":"60707d6dc6936c19ba9045508301a754","score":"0.522957","text":"public void testCompareTo() {\n nd1.distance(1.2);\n nd2.distance(32.89);\n assertTrue(nd1.compareTo(nd2) < 0);\n assertTrue(nd2.compareTo(nd1) > 0);\n nd2.distance(1.2);\n assertTrue(nd1.compareTo(nd1) == 0);\n }","title":""},{"docid":"b141ac73072238ba93fe3e8fb315c636","score":"0.5226988","text":"private static boolean isEqual(Object left, Object right) {\n if (left instanceof HintonNull && right instanceof HintonNull)\n return true;\n if (left instanceof HintonNull)\n return false;\n\n return ((NativeType) left).getRaw().equals(((NativeType) right).getRaw());\n }","title":""},{"docid":"e1d5bc0550e3e040962078b30b092a7d","score":"0.5206157","text":"private Node evalEqFunction(Node root, HashMap<String,ArrayDeque<Node>> alist) {\n if(root.left==null || root.right==null || root.lexToken!=null) {\n System.out.println(\"EQ error: Expecting a list, but got an atom instead.\");\n System.exit(0);\n }\n\n Node lop = eval(evalCarFunction(root, alist), alist);\n Node rop = eval(evalCarFunction(evalCdrFunction(root, alist), alist), alist);\n Node nullop = eval (evalCdrFunction(evalCdrFunction(root, alist), alist) , alist);\n\n if(nullop.lexToken==null || !nullop.lexToken.getLiteralValue().equals(\"NIL\")) {\n System.out.println(\"EQ error: Too many parameters.\");\n System.exit(0);\n }\n\n Node ret = new Node(new LexToken(LexTokenID.ATOM, false));\n if(lop.lexToken==null || rop.lexToken==null) {\n System.out.println(\"EQ error: atom expected but got a list.\");\n System.exit(0);\n }\n if(lop.lexToken.isNumericAtom ^ rop.lexToken.isNumericAtom) {\n System.out.println(\"EQ error: Numeric Atom cannot be compared to Literal Atom\");\n System.exit(0);\n }\n if(lop.lexToken.isNumericAtom) {\n lop = evalInt(lop, alist);\n rop = evalInt(rop, alist);\n if (lop.lexToken.getNumericValue() == rop.lexToken.getNumericValue()) {\n ret.lexToken.setLiteralValue(\"T\");\n ret.isList = false;\n ret.isInnerList = false;\n } else {\n ret.lexToken.setLiteralValue(\"NIL\");\n ret.isList = true;\n ret.isInnerList = true;\n }\n } else {\n if (lop.lexToken.getLiteralValue().equals(rop.lexToken.getLiteralValue())) {\n ret.lexToken.setLiteralValue(\"T\");\n ret.isList = false;\n ret.isInnerList = false;\n } else {\n ret.lexToken.setLiteralValue(\"NIL\");\n ret.isList = true;\n ret.isInnerList = true;\n }\n\n }\n\n return ret;\n }","title":""},{"docid":"0f773ad0966d3e24237f2123b7e2133d","score":"0.52036476","text":"public boolean compare(ClassName other) {\n\t\tif (!name.equals(other.name)) {\n\t\t\treturn false;\n\t\t}\n\t\tif (arrayDimension != other.arrayDimension) {\n\t\t\treturn false;\n\t\t}\n\t\tif (nestedSubParameters == null) {\n\t\t\tif (other.nestedSubParameters != null) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t} else {\n\t\t\tif (other.nestedSubParameters == null || nestedSubParameters.size() != other.nestedSubParameters.size()) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}","title":""},{"docid":"0edb273de8db1c4574344b41888b104d","score":"0.52016896","text":"public static void main(String[] args) {\n\t\tint[] array1 = {1, 2, 1, 3, 1, 1, 5};\n\t\tint[] array2 = {2, 3, 1};\n\t\t\n\t\tTreeNode t1 = AssortedMethods.createTreeFromArray(array1);\n\t\tTreeNode t2 = AssortedMethods.createTreeFromArray(array2);\n\n\t\tif (containsTree(t1, t2)) {\n\t\t\tSystem.out.println(\"t2 is a subtree of t1\");\n\t\t} else {\n\t\t\tSystem.out.println(\"t2 is not a subtree of t1\");\n\t\t}\n\n int[] array3 = {1, 2, 3};\n\t\tTreeNode t3 = AssortedMethods.createTreeFromArray(array1);\n\t\tTreeNode t4 = AssortedMethods.createTreeFromArray(array3);\n\n\t\tif (containsTree(t3, t4)) {\n\t\t\tSystem.out.println(\"t4 is a subtree of t3\");\n\t\t} else {\n\t\t\tSystem.out.println(\"t4 is not a subtree of t3\");\n\t\t}\n }","title":""},{"docid":"2fed1c24590af0df8023caf5dbd3eb16","score":"0.5195195","text":"@Test\n\tpublic void testNestedDifferentXmls() {\n\t\tString xml1=\"<?xml version=\\\"1.0\\\"?> <node> <element att1=\\\"a\\\" att2=\\\"b\\\"/><element>Test</element></node>\";\n\t\tString xml2=\"<?xml version=\\\"1.0\\\"?> <node> <element>Test</element> <element att1=\\\"a\\\" att2=\\\"b\\\"/></node>\";\n\t\tassertFalse(xmlComparator.isXmlEqual(xml1, xml2));\n\t}","title":""},{"docid":"06fdcfffdb7f718c25a672f90af586c4","score":"0.5193629","text":"private static int comparetreeterms(Pattern a, Pattern b) {\n\tName ta = a.op(), tb = b.op();\n\n\tif (ta.term() != tb.term()) return 0; /* different kind */\n\tif (!ta.term()) return 1; /* both are non-terminals */\n\tif (((Term)ta).esn() != ((Term)tb).esn()) return 0; /* different terminals */\n\tif (a.left() != null && b.left() != null)\n\t if (comparetreeterms(a.left(), b.left()) == 0) return 0;\n\tif (a.right() != null && b.right() != null)\n\t if (comparetreeterms(a.right(), b.right()) == 0) return 0;\n\treturn 1;\n }","title":""},{"docid":"94540959aa57ac300b31ef29a73f8737","score":"0.51866674","text":"static boolean isEqual(Library o1, Library o2) {\n if (!o1.getPages().equals(o2.getPages())) return false;\n if (!o1.getYear().equals(o2.getYear())) return false;\n if (!o1.getQuantity().equals(o2.getQuantity())) return false;\n if (!o1.getBook().equals(o2.getBook())) return false;\n return o1.getPublisher().equals(o2.getPublisher());\n }","title":""},{"docid":"8643526e0d0a08d0ee34ff5d94251113","score":"0.5181962","text":"public boolean inLaws(T gp1, T gp2){\n if (result.length == 0){\n throw new EmptyCollectionException (\"The tree is empty.\");\n }\n \n if(appears (gp1) == false || appears (gp2) == false){\n return false;\n }\n \n return \n (getOffspring(getOffspring(gp1)) == getOffspring(getOffspring(gp2)));\n }","title":""},{"docid":"0a8f6810f26eac2b1a2b076d42d2c63d","score":"0.51800436","text":"private boolean similarAS(AgentState[] as1, AgentState[] as2){\n\t\tboolean result = true;\n\t\tfor(short i = 0; i<asSize; i++){\n\t\t\tresult = result && as1[i].getStateValue().sameSV(as2[i].getStateValue());\n\t\t}\n\t\treturn result;\n\t}","title":""},{"docid":"07bd983fe5bb16d8b54ade68df46e8d0","score":"0.5178466","text":"@Test\n public void testAVL2Unchanged() throws InvalidBalanceException, EmptyTreeException {\n tree = new AVLGTree<>(2);\n tree.insert(20);\n tree.insert(10);\n tree.insert(5); // Should *NOT* trigger a right rotation about the root or any rotation for that matter!\n assertEquals(\"In an AVL-2 tree with three descending order integers inserted, \" +\n \"the new root was not the expected one.\", Integer.valueOf(20), tree.getRoot()); // Root should be unchanged\n assertEquals(\"In an AVL-2 tree with three descending order integers inserted, \" +\n \"the new height was not the expected one.\", 2, tree.getHeight()); // Height of 2 expected\n }","title":""},{"docid":"03c159f08b9aaa885a6055ee1e03fa74","score":"0.51712537","text":"public static void main(String[] args) {\r\n SameTree obj = new SameTree();\r\n TreeNode t1 = new TreeNode(5);\r\n TreeNode t2 = new TreeNode(5);\r\n t1.right = new TreeNode(7);\r\n t2.right = new TreeNode(7);\r\n t1.left = new TreeNode(4);\r\n t2.left = new TreeNode(4);\r\n System.out.println(obj.isSameTree(t1,t2));\r\n }","title":""},{"docid":"5172f4a4a29c8f4728f38e77f0b2f3e0","score":"0.51654583","text":"public interface AVLInterface<T extends Comparable<? super T>> {\n /**\n * Add the data as a leaf in the AVL. Should traverse the tree to find the\n * appropriate location. If the data being added already exists in the tree,\n * do nothing.\n *\n * @throws java.lang.IllegalArgumentException if the data is null\n * @param data the data to be added\n */\n void add(T data);\n\n /**\n * Removes the data from the tree. There are 3 cases to consider:\n * 1: the data is a leaf. In this case, simply remove it.\n * 2: the data has one child. In this case, simply replace the node with\n * the child node.\n * 3: the data has 2 children. There are generally two approaches:\n * replacing the data with either the largest element in the left subtree\n * (commonly called the predecessor), or replacing it with the smallest\n * element in the right subtree (commonly called the successor). For this\n * assignment, use the predecessor.\n *\n * This method must run in O(2 log n) or better.\n *\n * @throws java.lang.IllegalArgumentException if the data is null\n * @throws java.util.NoSuchElementException if the data is not in the AVL\n * @param data data to remove from the tree\n * @return the data removed from the tree. Do not return the same data\n * that was passed in. Return the data that was stored in the tree.\n */\n T remove(T data);\n\n /**\n * Returns the data in the tree matching the parameter passed in.\n * (Think carefully: should you use .equals or == ?)\n *\n * @throws java.lang.IllegalArgumentException if the data is null\n * @throws java.util.NoSuchElementException if the data is not in the AVL\n * @param data data to get in the AVL tree\n * @return the data in the tree equal to the parameter. Do not return the\n * same data that was passed in. Return the data that was stored in the\n * tree.\n */\n T get(T data);\n\n /**\n * Returns whether or not the parameter is contained within the tree.\n *\n * @throws java.lang.IllegalArgumentException if the data is null\n * @param data data to find in the AVL tree\n * @return whether or not the parameter is contained within the tree\n */\n boolean contains(T data);\n\n /**\n * Get the number of elements in the tree.\n *\n * @return the number of elements in the tree\n */\n int size();\n\n /**\n * Get the preorder traversal of the tree.\n *\n * @return a preorder traversal of the tree, or an empty list\n */\n List<T> preorder();\n\n /**\n * Get the postorder traversal of the tree.\n *\n * @return a postorder traversal of the tree, or an empty list\n */\n List<T> postorder();\n\n /**\n * Get the inorder traversal of the tree.\n *\n * @return an inorder traversal of the tree, or an empty list\n */\n List<T> inorder();\n\n /**\n * Get the level order traversal of the tree.\n *\n * @return a level order traversal of the tree, or an empty list\n */\n List<T> levelorder();\n\n /**\n * Clear the tree.\n */\n void clear();\n\n /**\n * Calculate and return the height of the root of the tree. A node's\n * height is defined as max(left.height, right.height) + 1. A leaf node has\n * a height of 0.\n *\n * @return the height of the root of the tree, -1 if the tree is empty\n */\n int height();\n\n /**\n * Calculate the depth of the node containing the data.\n * The depth of the node is defined as (parent node's depth)+1. The depth of\n * the root node is 1.\n *\n * @throws java.lang.IllegalArgumentException if data is null\n * @throws java.util.NoSuchElementException if the data is not in the tree.\n * @param data data to calculate the depth of\n * @return the depth of the node containing the data if it is in the tree\n */\n int depth(T data);\n}","title":""},{"docid":"3d1c74686406b652cb2944178122a7b8","score":"0.51653695","text":"public boolean equals(DoublyLinkedList<E> other) {\n if(this.size!=other.size){\n return false;\n }\n ListNode<E> current1=front;\n ListNode<E> current2=other.front;\n while(this.front!=null){\n if(current1.data!=current2.data)\n {\n return false;\n }\n this.front=front.next;\n other.front=other.front.next;\n }\n return true;\n }","title":""},{"docid":"11b056e9386f8206b17b93e3fd9b0ca3","score":"0.5165274","text":"public boolean match(Object other) {\n Exception ex1;\n boolean z;\n NetObject netObject;\n Object obj = this;\n if (other == null) {\n return true;\n }\n boolean z2 = false;\n if (!getClass().equals(other.getClass())) {\n return false;\n }\n GenericObject that = (GenericObject) other;\n Class<?> hisclass = other.getClass();\n Class<?> myclass = getClass();\n Class<?> hisclass2 = hisclass;\n while (true) {\n Field[] fields = myclass.getDeclaredFields();\n Field[] hisfields = hisclass2.getDeclaredFields();\n int i = z2;\n while (true) {\n int i2 = i;\n if (i2 >= fields.length) {\n break;\n }\n Field f = fields[i2];\n Field g = hisfields[i2];\n if ((f.getModifiers() & 2) != 2) {\n Class<?> fieldType = f.getType();\n String fieldName = f.getName();\n if (!(fieldName.compareTo(\"stringRepresentation\") == 0 || fieldName.compareTo(\"indentation\") == 0)) {\n try {\n if (fieldType.isPrimitive()) {\n String fname = fieldType.toString();\n if (fname.compareTo(\"int\") == 0) {\n try {\n if (f.getInt(obj) != g.getInt(that)) {\n return false;\n }\n } catch (IllegalAccessException e) {\n ex1 = e;\n z = false;\n InternalErrorHandler.handleException(ex1);\n i = i2 + 1;\n z2 = z;\n netObject = this;\n }\n } else if (fname.compareTo(\"short\") == 0) {\n if (f.getShort(obj) != g.getShort(that)) {\n return false;\n }\n } else if (fname.compareTo(\"char\") == 0) {\n if (f.getChar(obj) != g.getChar(that)) {\n return false;\n }\n } else if (fname.compareTo(\"long\") == 0) {\n if (f.getLong(obj) != g.getLong(that)) {\n return false;\n }\n } else if (fname.compareTo(\"boolean\") == 0) {\n if (f.getBoolean(obj) != g.getBoolean(that)) {\n return false;\n }\n } else if (fname.compareTo(\"double\") == 0) {\n if (f.getDouble(obj) != g.getDouble(that)) {\n return false;\n }\n } else if (fname.compareTo(\"float\") == 0 && f.getFloat(obj) != g.getFloat(that)) {\n return false;\n }\n }\n Object myObj = f.get(obj);\n Object hisObj = g.get(that);\n if (hisObj != null && myObj == null) {\n return false;\n }\n if (hisObj != null || myObj == null) {\n if (hisObj != null || myObj != null) {\n if ((hisObj instanceof String) && (myObj instanceof String)) {\n if (!((String) hisObj).equals(\"\")) {\n if (((String) myObj).compareToIgnoreCase((String) hisObj) != 0) {\n return false;\n }\n }\n } else if (GenericObject.isMySubclass(myObj.getClass()) && GenericObject.isMySubclass(hisObj.getClass()) && myObj.getClass().equals(hisObj.getClass()) && ((GenericObject) hisObj).getMatcher() != null) {\n if (!((GenericObject) hisObj).getMatcher().match(((GenericObject) myObj).encode())) {\n return false;\n }\n } else if (GenericObject.isMySubclass(myObj.getClass()) && !((GenericObject) myObj).match(hisObj)) {\n return false;\n } else {\n if (GenericObjectList.isMySubclass(myObj.getClass()) && !((GenericObjectList) myObj).match(hisObj)) {\n return false;\n }\n }\n }\n }\n z = false;\n i = i2 + 1;\n z2 = z;\n netObject = this;\n z = false;\n } catch (IllegalAccessException e2) {\n ex1 = e2;\n z = z2;\n InternalErrorHandler.handleException(ex1);\n i = i2 + 1;\n z2 = z;\n netObject = this;\n }\n i = i2 + 1;\n z2 = z;\n netObject = this;\n }\n }\n z = z2;\n i = i2 + 1;\n z2 = z;\n netObject = this;\n }\n myclass = myclass.getSuperclass();\n hisclass2 = hisclass2.getSuperclass();\n z2 = z;\n netObject = this;\n }\n }","title":""},{"docid":"75b4d8df924ace48d4353576ad987158","score":"0.5160566","text":"public void assertStructureSame(Database other)\r\n\t{\r\n\t\tif(this.tables.size()!=other.tables.size())\r\n\t\t{\r\n\t\t\tthrow new DatabaseMismatchException(\"Different number of tables: \" + this.tables.size() + \"<>\" + other.tables.size());\r\n\t\t}\r\n\t\tIterator<Table> itThis = tables.iterator();\r\n\t\tIterator<Table> itOther = other.tables.iterator();\r\n\t\twhile(itThis.hasNext())\r\n\t\t{\r\n\t\t\tTable thisTable = itThis.next();\r\n\t\t\tTable otherTable = itOther.next();\r\n\t\t\tif(!thisTable.name.equals(otherTable.name))\r\n\t\t\t{\r\n\t\t\t\tthrow new DatabaseMismatchException(\"Different table names: \" + thisTable.name + \"<>\" + otherTable.name);\r\n\t\t\t}\r\n\t\t\tthisTable.assertStructureSame(otherTable);\r\n\t\t}\r\n\t}","title":""},{"docid":"5f67dcede1c7dbbafde24fafab762e2c","score":"0.5157504","text":"protected boolean isStructurallyEquivalent(Vertex v1, Vertex v2) {\n\t\t\n\t\tcount ++;\n\t\t\n\t\tif( v1.degree() != v2.degree()) {\n\t\t\treturn false;\n\t\t}\n\n\t\tSet n1 = new HashSet(v1.getPredecessors());\n\t\tn1.remove(v2);\n\t\tn1.remove(v1);\n\t\tSet n2 = new HashSet(v2.getPredecessors());\n\t\tn2.remove(v1);\n\t\tn2.remove(v2);\n\n\t\tSet o1 = new HashSet(v1.getSuccessors());\n\t\tSet o2 = new HashSet(v2.getSuccessors());\n\t\to1.remove(v1);\n\t\to1.remove(v2);\n\t\to2.remove(v1);\n\t\to2.remove(v2);\n\n\t\t// this neglects self-loops and directed edges from 1 to other\n\t\tboolean b = (n1.equals(n2) && o1.equals(o2));\n\t\tif (!b)\n\t\t\treturn b;\n\t\t\n\t\t// if there's a directed edge v1->v2 then there's a directed edge v2->v1\n\t\tb &= ( v1.isSuccessorOf(v2) == v1.isSuccessorOf(v2));\n\t\t\n\t\t// self-loop check\n\t\tb &= ( v1.isSuccessorOf(v1) == v2.isSuccessorOf(v2));\n\n\t\treturn b;\n\n\t}","title":""},{"docid":"6fd9dbaa63b2d70bde8ef51d04d8981c","score":"0.5153127","text":"@Test\n public void testAVLChanged() throws InvalidBalanceException, EmptyTreeException {\n tree = new AVLGTree<>(2);\n tree.insert(20);\n tree.insert(10);\n tree.insert(5);\n tree.insert(1); // Should trigger a right rotation about the root.\n assertEquals(\"In an AVL-2 tree with four descending order integers inserted, \" +\n \"the new root was not the expected one.\", Integer.valueOf(10), tree.getRoot()); // Root should change to 10\n assertEquals(\"In an AVL-2 tree with four descending order integers inserted, \" +\n \"the new height was not the expected one.\", 2, tree.getHeight()); // Height of 2 expected\n }","title":""},{"docid":"67bfd4ba74d5920d871bc5b21849fd03","score":"0.51521754","text":"@Test\r\n public void testIsEqual() throws Exception {\r\n Serializer serializer = new Persister();\r\n \r\n Taxonomy tax1 = serializer.read(Taxonomy.class, readTaxFile());\r\n Taxonomy tax2 = serializer.read(Taxonomy.class, readTaxFile());\r\n assertTrue(taxEquals(tax1, tax2));\r\n \r\n tax2.getDialogModes().add(0, \"NOPE\");\r\n assertFalse(taxEquals(tax1, tax2));\r\n tax2.getDialogModes().remove(0);\r\n assertTrue(taxEquals(tax1, tax2));\r\n \r\n tax2.getDialogActs().get(0).getSubtypes().add(0, \"ROCK!\");\r\n assertFalse(taxEquals(tax1, tax2));\r\n tax2.getDialogActs().get(0).getSubtypes().remove(0);\r\n assertTrue(taxEquals(tax1, tax2));\r\n tax2.getDialogActs().remove(0);\r\n assertFalse(taxEquals(tax1, tax2));\r\n }","title":""},{"docid":"13a123a6c211cacc8f08df5f97494d5c","score":"0.51471657","text":"private boolean compareUnorderedCollection(Collection collectionA, Collection collectionB, RecursiveObject recursiveObject) {\n Map<Integer, Collection> map = collection2Map(collectionB);\n\n for (Object item : collectionA) {\n Collection other = map.get(ReflectionUtils.deepHashCode(item));\n // fail fast: item not even found in other Collection, no need to continue.\n if (other == null || other.isEmpty()) {\n return false;\n }\n\n // no hash collision, items must be equivalent or isDeepEquals is false\n if (other.size() == 1) {\n recursiveObject.push(new DualObject(item, other.iterator().next()));\n } else {\n // hash collision: try all collided items against the current item (if 1 equals, we are good - remove it\n // from collision list, making further comparisons faster)\n if (!isContained(item, other)) {\n return false;\n }\n }\n }\n\n return true;\n }","title":""},{"docid":"3603c69c4be1a395ef0416abe852dc45","score":"0.51435745","text":"public boolean equals(SinglyLinkedList otherList) {\r\n\t\t/* if two sizes are different, return false */\r\n\t\tif (otherList.size() != numElements) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\tSingleNode cursor1 = this.head;\r\n\t\tSingleNode cursor2 = otherList.head;\r\n\r\n\t\t/* Traverse two lists */\r\n\t\twhile (cursor1 != null && cursor2 != null) {\r\n\t\t\tif (!cursor1.data.equals(cursor2.data)) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t\tcursor1 = cursor1.next;\r\n\t\t\tcursor2 = cursor2.next;\r\n\t\t}\r\n\r\n\t\treturn true;\r\n\t}","title":""},{"docid":"33e79a2f87c8094367282e1a07444554","score":"0.5138416","text":"public boolean isSameTree(TreeNode p, TreeNode q) {\n if(p==null && q == null){\n return true;\n }\n //then here is XOR\n if(p==null || q ==null){\n return false;\n }\n \n return helper(p,q);\n }","title":""},{"docid":"40a8f3d6185b7b1fdaf6ab6ff82d0047","score":"0.51349664","text":"public boolean isDeepEquals(Object a, Object b) {\n return doDeepCompare(a, b);\n }","title":""},{"docid":"a88700192c4d3bed20daebdb43960d97","score":"0.51324683","text":"@Test\n\tpublic void testNotEqualsDiffData() {\n\t\tLinkedList<Integer> ll_3elems = new LinkedList<Integer>();\n\t\tLinkedList<Integer> ll_321 = new LinkedList<Integer>();\n\t\tll_3elems.addToFront(new Node<Integer>(new Integer(3)));\n\t\tll_3elems.addToFront(new Node<Integer>(new Integer(2)));\n\t\tll_3elems.addToFront(new Node<Integer>(new Integer(1)));\n\t\t\n\t\tll_321.addToFront(new Node<Integer>(new Integer(1)));\n\t\tll_321.addToFront(new Node<Integer>(new Integer(2)));\n\t\tll_321.addToFront(new Node<Integer>(new Integer(3)));\n\t\tassertFalse(ll_321.equals(ll_3elems));\n\t}","title":""},{"docid":"559f832bf860d00716735eaa14f913d8","score":"0.5125449","text":"public boolean deepEquals(Expression expr) {\n/* 217 */ if (!isSameClass(expr)) {\n/* 218 */ return false;\n/* */ }\n/* 220 */ NodeTest nt = (NodeTest)expr;\n/* */ \n/* 222 */ if (null != nt.m_name) {\n/* */ \n/* 224 */ if (null == this.m_name)\n/* 225 */ return false; \n/* 226 */ if (!nt.m_name.equals(this.m_name)) {\n/* 227 */ return false;\n/* */ }\n/* 229 */ } else if (null != this.m_name) {\n/* 230 */ return false;\n/* */ } \n/* 232 */ if (null != nt.m_namespace) {\n/* */ \n/* 234 */ if (null == this.m_namespace)\n/* 235 */ return false; \n/* 236 */ if (!nt.m_namespace.equals(this.m_namespace)) {\n/* 237 */ return false;\n/* */ }\n/* 239 */ } else if (null != this.m_namespace) {\n/* 240 */ return false;\n/* */ } \n/* 242 */ if (this.m_whatToShow != nt.m_whatToShow) {\n/* 243 */ return false;\n/* */ }\n/* 245 */ if (this.m_isTotallyWild != nt.m_isTotallyWild) {\n/* 246 */ return false;\n/* */ }\n/* 248 */ return true;\n/* */ }","title":""},{"docid":"db0e7e100dc0af3431536bc6ef190937","score":"0.5114137","text":"private boolean areEqual(Object actual, Object other) {\n return comparisonStrategy.areEqual(actual, other);\n }","title":""},{"docid":"eb4eec317e7d5d17ae8852cd14a038a2","score":"0.51117975","text":"public boolean isEqualNode(Node arg) {\n/* 865 */ if (!super.isEqualNode(arg)) {\n/* 866 */ return false;\n/* */ }\n/* */ \n/* */ \n/* */ \n/* 871 */ Node child1 = getFirstChild();\n/* 872 */ Node child2 = arg.getFirstChild();\n/* 873 */ while (child1 != null && child2 != null) {\n/* 874 */ if (!((NodeImpl)child1).isEqualNode(child2)) {\n/* 875 */ return false;\n/* */ }\n/* 877 */ child1 = child1.getNextSibling();\n/* 878 */ child2 = child2.getNextSibling();\n/* */ } \n/* 880 */ if (child1 != child2) {\n/* 881 */ return false;\n/* */ }\n/* 883 */ return true;\n/* */ }","title":""},{"docid":"1cee3e7773349d4cd3542de1713009d0","score":"0.5108015","text":"private double equal() {\n double score = Integer.MAX_VALUE-K;\n if (superClass == Number.class) {\n score = Math.abs((double)left - (double)right);\n }\n if (superClass == CharSequence.class) {\n score = stringEqualsDistance((String) left, (String)right);\n }\n if (superClass == Boolean.class) {\n score = left == right ? 0 : 1;\n }\n return (score == 0) ? 0 : score;// + K;\n }","title":""},{"docid":"3a07b04a7285b929d89de0a4b7ce5637","score":"0.51075804","text":"boolean equals(List L){\n\n\t\tif(L.length != this.length){ //checks the lengths of each List\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tif(L.length > 0){ //checks each element of the list and compares\n\t\t\tthis.moveFront(); //to the other list\n\t\t\tL.moveFront();\n\t\t\tint k = 1;\n\t\t\twhile(k <= L.length){ //comparisons\n\t\t\t\tint thisIndex = this.get();\n\t\t\t\tint LIndex = L.get();\n\t\t\t\tif(thisIndex != LIndex){\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tL.moveNext(); //incrementing both lists\n\t\t\t\tthis.moveNext();\n\t\t\t\tk++;\n\t\t\t}\n\t\t}\n\n\t\treturn true; //if the program makes it through all the above code the lists are equal\n\n\t}","title":""},{"docid":"48d0c48ba56d13d09c29ce1b46d0cf90","score":"0.5095804","text":"public ArrayList<RavensAttribute> compare() {\n\t\tfor(int j = 0; j < obj1.getAttributes().size(); j++) {\n\t\t\tRavensAttribute attr1 = obj1.getAttributes().get(j);\n\t\t\tString attr1Name = attr1.getName();\n\t\t\tString attr1Value = attr1.getValue();\n\t\t\tif(!attrMap2.containsKey(attr1Name) || !attrMap3.containsKey(attr1Name)) {\t//Scenario where Object1 attrMap doesn't contain the category of attr1\n\t\t\t\tif(!diffList.contains(attr1)) {\n\t\t\t\t\tdiffList.add(attr1);\n\t\t\t\t}\n\t\t\t} else {\t//Scenario where Object1 Map does contain it, but they have differing values\n\t\t\t\tString attr2Value = attrMap2.get(attr1Name);\n\t\t\t\tString attr3Value = attrMap3.get(attr1Name);\n\t\t\t\tif(!attr2Value.equals(attr1Value) || !attr3Value.equals(attr1Value)) {\n\t\t\t\t\tif(!diffList.contains(attr1)) {\n\t\t\t\t\t\tdiffList.add(attr1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(int i = 0; i < obj2.getAttributes().size(); i++) {\n\t\t\tRavensAttribute attr2 = obj2.getAttributes().get(i);\n\t\t\tString attr2Name = obj2.getAttributes().get(i).getName();\n\t\t\tString attr2Value = obj2.getAttributes().get(i).getValue();\n\t\t\tif(!attrMap1.containsKey(attr2Name) || !attrMap3.containsKey(attr2Name)) {\t//Scenario where Object1 attrMap doesn't contain the category of attr2\n\t\t\t\tif(!diffList.contains(attr2)) {\n\t\t\t\t\tdiffList.add(attr2);\n\t\t\t\t}\n\t\t\t} else {\t//Scenario where Object1 Map does contain it, but they have differing values\n\t\t\t\tString attr1Value = attrMap1.get(attr2Name);\n\t\t\t\tString attr3Value = attrMap3.get(attr2Name);\n\t\t\t\tif(!attr1Value.equals(attr2Value) || !attr3Value.equals(attr2Value)) {\n\t\t\t\t\tif(!diffList.contains(attr2)) {\n\t\t\t\t\t\tdiffList.add(attr2);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(int i = 0; i < obj3.getAttributes().size(); i++) {\n\t\t\tRavensAttribute attr3 = obj3.getAttributes().get(i);\n\t\t\tString attr3Name = obj3.getAttributes().get(i).getName();\n\t\t\tString attr3Value = obj3.getAttributes().get(i).getValue();\n\t\t\tif(!attrMap1.containsKey(attr3Name) || !attrMap2.containsKey(attr3Name)) {\t//Scenario where Object1 attrMap doesn't contain the category of attr2\n\t\t\t\tif(!diffList.contains(attr3)) {\n\t\t\t\t\tdiffList.add(attr3);\n\t\t\t\t}\n\t\t\t} else {\t//Scenario where Object1 Map does contain it, but they have differing values\n\t\t\t\tString attr1Value = attrMap1.get(attr3Name);\n\t\t\t\tString attr2Value = attrMap2.get(attr3Name);\n\t\t\t\tif(!attr1Value.equals(attr3Value) || !attr2Value.equals(attr3Value)) {\n\t\t\t\t\tif(!diffList.contains(attr3)) {\n\t\t\t\t\t\tdiffList.add(attr3);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(diffList.contains(\"angle\")) {\n\t\t\thasAngle = true;\n\t\t}\n\t\treturn diffList;\n\t}","title":""},{"docid":"24c29bf07d11b0283c35b0c02b0c1b14","score":"0.50942975","text":"public boolean equals (ArrayList otherList)\n {\n if(this.size == otherList.size && this.toString().equals(otherList.toString()))\n /* Each element in each class will have its own toString method that represents\n * that class so if I were to compare the strings it should return true if they're\n * the same\n */\n {\n return true;\n }\n else //If neither size nor information matches, method returns false:\n {\n return false;\n }\n }","title":""},{"docid":"3254b1bb2ab7ff2f26b9f6b4eef18eb9","score":"0.5083777","text":"@Override\n public int compare(GraphObject a, GraphObject b) {\n return Utility.compareGraphObjects(a, b, sortFields, collator);\n }","title":""},{"docid":"2435429299a85f65ce3cd38986fc9932","score":"0.5080112","text":"public boolean equals(Tensor other, double delta) {\n return equals(this, other, delta);\n }","title":""},{"docid":"5e4bb81da7f0aa319d069967e236c742","score":"0.5078282","text":"public boolean isEqual(Type t1, Type t2) { return t1.equals(t2) || (isSubtype(t1, t2) && isSubtype(t2, t1)); }","title":""},{"docid":"750b82e5038431a8a1de364dea0b4641","score":"0.50688064","text":"public boolean equals(Object that) {\n Object obj = that;\n if (!getClass().equals(that.getClass())) {\n return false;\n }\n Class<?> myclass = getClass();\n Class<?> hisclass = that.getClass();\n Class<?> myclass2 = myclass;\n while (true) {\n Field[] fields = myclass2.getDeclaredFields();\n Field[] hisfields = hisclass.getDeclaredFields();\n int i = 0;\n while (true) {\n int i2 = i;\n if (i2 >= fields.length) {\n break;\n }\n Field f = fields[i2];\n Field g = hisfields[i2];\n if ((f.getModifiers() & 2) != 2) {\n Class<?> fieldType = f.getType();\n String fieldName = f.getName();\n if (!(fieldName.compareTo(\"stringRepresentation\") == 0 || fieldName.compareTo(\"indentation\") == 0)) {\n try {\n if (fieldType.isPrimitive()) {\n String fname = fieldType.toString();\n if (fname.compareTo(\"int\") == 0) {\n if (f.getInt(this) != g.getInt(obj)) {\n return false;\n }\n } else if (fname.compareTo(\"short\") == 0) {\n if (f.getShort(this) != g.getShort(obj)) {\n return false;\n }\n } else if (fname.compareTo(\"char\") == 0) {\n if (f.getChar(this) != g.getChar(obj)) {\n return false;\n }\n } else if (fname.compareTo(\"long\") == 0) {\n if (f.getLong(this) != g.getLong(obj)) {\n return false;\n }\n } else if (fname.compareTo(\"boolean\") == 0) {\n if (f.getBoolean(this) != g.getBoolean(obj)) {\n return false;\n }\n } else if (fname.compareTo(\"double\") == 0) {\n if (f.getDouble(this) != g.getDouble(obj)) {\n return false;\n }\n } else if (fname.compareTo(\"float\") == 0 && f.getFloat(this) != g.getFloat(obj)) {\n return false;\n }\n } else if (g.get(obj) != f.get(this)) {\n if (f.get(this) == null && g.get(obj) != null) {\n return false;\n }\n if ((g.get(obj) == null && f.get(obj) != null) || !f.get(this).equals(g.get(obj))) {\n return false;\n }\n }\n } catch (IllegalAccessException ex1) {\n InternalErrorHandler.handleException(ex1);\n }\n }\n }\n i = i2 + 1;\n }\n myclass2 = myclass2.getSuperclass();\n hisclass = hisclass.getSuperclass();\n }\n }","title":""},{"docid":"d574fd55afb6d1370095007dcf4fc1bc","score":"0.5067343","text":"private boolean isMirrorImage(BTNode<E> firstTreeRoot,\n\t\t\tBTNode<E> secondTreeRoot) {\n\t\tif (firstTreeRoot == null && secondTreeRoot == null) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (firstTreeRoot == null || secondTreeRoot == null) {\n\t\t\treturn false;\n\t\t}\n\n\t\treturn secondTreeRoot.getData().toString()\n\t\t\t\t.equals(firstTreeRoot.getData().toString())\n\t\t\t\t&& isMirrorImage(firstTreeRoot.getLeft(),\n\t\t\t\t\t\tsecondTreeRoot.getRight())\n\t\t\t\t&& isMirrorImage(firstTreeRoot.getRight(),\n\t\t\t\t\t\tsecondTreeRoot.getLeft());\n\t}","title":""},{"docid":"8f05c428fd41406fd70bceb95cd89e7a","score":"0.5067016","text":"public boolean equals(Object other){\n\n if(other == null) {\n return false;\n }\n if(this.getClass() != other.getClass()) {\n return false;\n }\n\n Solution otherSolution = (Solution) other;\n\n if(width != otherSolution.width ||\n height != otherSolution.height ||\n currentIndex != otherSolution.currentIndex) {\n return false;\n }\n\n for(int i = 0; i < height ; i++){\n for(int j = 0; j < width; j++) {\n if(board[i][j] != otherSolution.board[i][j]){\n return false;\n }\n }\n }\n\n return true;\n\n }","title":""},{"docid":"82760745d01c85624d1a09e665f2dbf0","score":"0.5059235","text":"@SuppressWarnings(\"unchecked\")\n\t@Override\n\tpublic boolean equals(Object o) {\n\t\tboolean otherContainsAllThis = true;\n\t\tTreeSet<E> testSet = new TreeSet<>();\n\n\t\t// check that they're the same class\n\t\tif (o.getClass().isInstance(testSet)) {\n\n\t\t\tTreeSet<E> secondSet = (TreeSet<E>) o;\n\t\t\tIterator<E> itr = iterator();\n\t\t\tIterator<E> itr2 = secondSet.iterator();\n\n\t\t\t// check that they're the same size\n\t\t\tif (this.size() == secondSet.size()) {\n\n\t\t\t\t// check that they contain all the same elements\n\t\t\t\twhile (itr.hasNext()) {\n\t\t\t\t\tif (!secondSet.contains(itr.next())) {\n\t\t\t\t\t\totherContainsAllThis = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\treturn false; // not the same size\n\t\t\t}\n\t\t\treturn otherContainsAllThis; // return all elements are the same\n\n\t\t} else {\n\t\t\treturn false; // unequal types\n\t\t}\n\t}","title":""}],"string":"[\n {\n \"docid\": \"53d3c4147cee1674ad264ce4f552af78\",\n \"score\": \"0.6627099\",\n \"text\": \"private Boolean compare(AVLTree a, AVLTree b){\\n if(a.key>b.key || (a.key==b.key && a.address>b.address))return true;\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7bad778ae5923a0f66590b4c8c7fef5\",\n \"score\": \"0.65687704\",\n \"text\": \"private boolean equalsRecursive(AVLNode<T> node1, AVLNode<T> node2) {\\n\\n if (node1 == null && node2 == null) {\\n return true;\\n }\\n if (node1 != null && node2 != null) {\\n return (node1.getData().equals(node2.getData())\\n && equalsRecursive(node1.getLeft(), node2.getLeft())\\n && equalsRecursive(node1.getRight(), node2.getRight()));\\n }\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd4522344afc6879195a11f54031b952\",\n \"score\": \"0.6407485\",\n \"text\": \"private static boolean sameTree(Node a, Node b) {\\n\\t\\t// null checking. if both null, true. else if one null, false \\n\\t\\tif (a == null && b == null) {\\n\\t\\t\\treturn true; \\n\\t\\t} else if (a == null || b == null) {\\n\\t\\t\\treturn false; \\n\\t\\t}\\n\\n\\t\\t// neither are null. check values and if necessary, left and right subtrees. \\n\\t\\tif (a.val != b.val) {\\n\\t\\t\\treturn false; \\n\\t\\t} else {\\n\\t\\t\\treturn sameTree(a.left, b.left) && sameTree(a.right, b.right); \\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3eadbbb8f95e287e9587bd860523f562\",\n \"score\": \"0.63124084\",\n \"text\": \"static boolean similar(BinaryNode t1, BinaryNode t2)\\n {\\n \\n //If both are empty then it is true.\\n if (t1 == null && t2 == null) \\n {\\n return true;\\n }\\n //If both are not empty then compare the values in the nodes\\n else if (t1 != null && t2 != null) \\n { \\n return t1.element == t2.element && similar(t1.left, t2.left) && similar(t1.right, t2.right); \\n } \\n //If one is empty and one is not, or if different values then return false\\n else\\n {\\n return false; \\n }\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3613181f163cb73309223d93b5562bd1\",\n \"score\": \"0.6213623\",\n \"text\": \"public boolean CompareTrees(Node<T> node1, Node<T> node2) {\\n\\t\\tif (node1 == null || node2 == null) return node1==node2;\\n\\t\\t\\n\\t\\t//if the value within the nodes are not the same we return false\\n\\t\\tif(node1.getData().compareTo(node2.getData()) != 0) return false;\\n\\t\\t\\n\\t\\treturn CompareTrees(node1.getLeftChild(), node2.getLeftChild()) && CompareTrees(node1.getRightChild(), node2.getRightChild());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cf02e05ec186ac0164f2bc73129b771a\",\n \"score\": \"0.6170447\",\n \"text\": \"private boolean matchTree(TreeNode t1, TreeNode t2){\\n\\t\\tif(t1 == null && t2 == null){\\n\\t\\t\\treturn true; //Reached end of tree.\\n\\t\\t}else if(t1 == null || t2 == null){\\n\\t\\t\\treturn false;\\n\\t\\t}else if(t1.data != t2.data){\\n\\t\\t\\treturn false;\\n\\t\\t}else{\\n\\t\\t\\treturn matchTree(t1.left, t2.left) && matchTree(t1.right, t2.right);\\n\\t\\t} \\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f4901336184fdf58c9b7a9301ce6f001\",\n \"score\": \"0.604296\",\n \"text\": \"@Test\\n public void testContainsAll1() {\\n System.out.println(\\\"ContainsAll test #1\\\");\\n AVLTree<Integer> tree1 = new AVLTree();\\n tree1.add(10);\\n tree1.add(20);\\n tree1.add(5);\\n AVLTree<Integer> tree2 = new AVLTree();\\n tree2.add(5);\\n tree2.add(20);\\n tree2.add(10);\\n if (tree1.containsAll(tree2)) {\\n System.out.println(\\\"Successful\\\");\\n } else {\\n fail(\\\"Test is not passed\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36196d96238e455e66e00213564c87a5\",\n \"score\": \"0.6004641\",\n \"text\": \"@Test\\n public void testContainsAll3() {\\n System.out.println(\\\"ContainsAll test #3\\\");\\n AVLTree<Integer> tree1 = new AVLTree();\\n tree1.add(10);\\n tree1.add(20);\\n tree1.add(5);\\n AVLTree<Integer> tree2 = new AVLTree();\\n tree2.add(5);\\n tree2.add(20);\\n tree2.add(10);\\n tree2.add(120);\\n if (!tree1.containsAll(tree2)) {\\n System.out.println(\\\"Successful\\\");\\n } else {\\n fail(\\\"Test is not passed\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b93cfc3ed87de870fc8825f336bc2685\",\n \"score\": \"0.5997673\",\n \"text\": \"@Test\\n public void testContainsAll2() {\\n System.out.println(\\\"ContainsAll test #2\\\");\\n AVLTree<Integer> tree1 = new AVLTree();\\n tree1.add(10);\\n tree1.add(20);\\n tree1.add(5);\\n AVLTree<Integer> tree2 = new AVLTree();\\n tree2.add(3);\\n tree2.add(4);\\n if (!tree1.containsAll(tree2)) {\\n System.out.println(\\\"Successful\\\");\\n } else {\\n fail(\\\"Test is not passed\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"231279661085d925839c78c8bc9dff42\",\n \"score\": \"0.5906788\",\n \"text\": \"public static void compareTrees() {\\n int N = 10000000;\\n System.out.print( \\\"UNEVEN DISTRIBUTION\\\\n\\\" );\\n System.out.printf( \\\"%26s\\\", \\\"inserting..\\\\n\\\" );\\n System.out.printf( \\\"%-10s%7s%13s| %6s%13s\\\\n\\\", \\\"n\\\", \\\"height\\\", \\\"BST Tree\\\", \\\"height\\\", \\\"AVL Tree\\\" );\\n for ( int n = 1000; n <= N; n *= 10 ) {\\n BinarySearchTree< Integer > bst = new BinarySearchTree<>();\\n BinarySearchTree< Integer > avl = new AVLTree<>();\\n int[] array = generateRandomValuesNormal( n );\\n long startBst = System.currentTimeMillis();\\n for ( Integer element : array ) {\\n bst.insert( element );\\n }\\n long endBst = System.currentTimeMillis() - startBst;\\n long startAvl = System.currentTimeMillis();\\n for ( Integer element : array ) {\\n avl.insert( element );\\n }\\n long endAvl = System.currentTimeMillis() - startAvl;\\n System.out.printf( \\\"%-9d:%7d%10d ms| %6d%10d ms\\\\n\\\", n, bst.getRootHeight(), endBst, avl.getRootHeight(), endAvl );\\n }\\n\\n BinarySearchTree< Integer > tree1;\\n BinarySearchTree< Integer > tree2;\\n\\n System.out.printf( \\\"%16s\\\\n\\\", \\\"K test..\\\" );\\n System.out.printf( \\\"%-10s%7s%13s| %6s%13s\\\\n\\\", \\\"k\\\", \\\"height\\\", \\\"BST Tree\\\", \\\"height\\\", \\\"AVL Tree\\\" );\\n for ( int n = 1000; n <= N; n *= 10 ) {\\n int[] sharedValues = generateRandomValuesNormal( n );\\n tree1 = populateTree( new BinarySearchTree< Integer >(), sharedValues );\\n tree2 = populateTree( new AVLTree< Integer >(), sharedValues );\\n System.out.print( \\\"\\\\n [ n : \\\" + n + \\\" ]\\\\n\\\" );\\n\\n for ( int k = 1000; k <= N; k *= 10 ) {\\n int[] array = generateRandomValues( k );\\n long start1 = System.currentTimeMillis();\\n for ( Integer element : array ) {\\n tree1.contains( element );\\n }\\n\\n long end1 = System.currentTimeMillis() - start1;\\n long start2 = System.currentTimeMillis();\\n for ( Integer element : array ) {\\n tree2.contains( element );\\n }\\n long end2 = System.currentTimeMillis() - start2;\\n System.out.printf( \\\"%-9d:%7d%10d ms| %6d%10d ms\\\\n\\\", k, tree1.getRootHeight(), end1, tree2.getRootHeight(), end2 );\\n }\\n }\\n System.out.printf( \\\"\\\\n%16s\\\", \\\"M tests..\\\" );\\n for ( int x = 1; x <= 8; x += 2 ) {\\n System.out.print( \\\"\\\\n [ \\\" + x * 10 + \\\"% insertions and \\\" + ( 10 - x ) * 10 + \\\"% searches ]\\\\n\\\" );\\n System.out.printf( \\\"%-10s%7s%13s| %6s%13s\\\\n\\\", \\\"m\\\", \\\"height\\\", \\\"BST Tree\\\", \\\"height\\\", \\\"AVL Tree\\\" );\\n\\n for ( int m = 100000; m <= N; m *= 10 ) {\\n Integer[] values = new Integer[ m / 2 ];// make integer array\\n for ( int i = 0; i < ( x * m / ( 20 ) ); i++ ) {\\n values[ i ] = 1;\\n }\\n ArrayList< Integer > value = new ArrayList<>( Arrays.asList( values ) );\\n Random rand = new Random( System.currentTimeMillis() );\\n Collections.shuffle( value, rand );\\n int[] array = generateRandomValues( m / 2 );\\n int[] array2 = generateRandomValuesNormal( N );\\n tree1 = populateTree( new BinarySearchTree< Integer >(), array2 );\\n long start1 = System.currentTimeMillis();\\n for ( int i = 0; i < array.length; i++ ) {\\n if ( value.get( i ) == null ) {\\n tree1.contains( array[ i ] );\\n } else {\\n tree1.insert( array[ i ] );\\n }\\n }\\n long end1 = System.currentTimeMillis() - start1;\\n tree2 = populateTree( new AVLTree< Integer >(), array2 );\\n long start2 = System.currentTimeMillis();\\n for ( int i = 0; i < array.length; i++ ) {\\n if ( value.get( i ) == null ) {\\n tree2.contains( array[ i ] );\\n } else {\\n tree2.insert( array[ i ] );\\n }\\n }\\n long end2 = System.currentTimeMillis() - start2;\\n System.out.printf( \\\"%-9d:%7d%10d ms| %6d%10d ms\\\\n\\\", m / 2, tree1.getRootHeight(), end1, tree2.getRootHeight(), end2 );\\n }\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64ef94b3b2d4c072d9c07bafcd102045\",\n \"score\": \"0.5897633\",\n \"text\": \"public static boolean compare(Dataset dataset1, Dataset dataset2, boolean verbose) {\\n if (dataset1 == null){\\n if (dataset2 == null){\\n return true;\\n } else {\\n if (verbose){\\n logger.info(\\\"Dataset 1 is null while Dataset 2 is:\\\");\\n logger.info(dataset2);\\n }\\n return false;\\n } \\n } else {\\n if (dataset2 == null){\\n if (verbose){\\n logger.info(\\\"Dataset 2 is null while Dataset 1 is:\\\");\\n logger.info(dataset1);\\n }\\n return false;\\n } \\n }\\n Set<URI> defaultGraphs1 = dataset1.getDefaultGraphs();\\n Set<URI> defaultGraphs2 = dataset2.getDefaultGraphs();\\n //ystem.out.println(\\\"defaultGraphs\\\");\\n //ystem.out.println(defaultGraphs1);\\n //ystem.out.println(defaultGraphs2);\\n if (!(defaultGraphs1.equals(defaultGraphs2))){\\n if (verbose){\\n logger.info(\\\"*** defaultGraphs do not match ***\\\");\\n }\\n return false;\\n }\\n Set<URI> namedGraphs1 = dataset1.getNamedGraphs();\\n Set<URI> namedGraphs2 = dataset2.getNamedGraphs();\\n //ystem.out.println(\\\"namedGraphs\\\");\\n //ystem.out.println(namedGraphs1);\\n //ystem.out.println(namedGraphs2);\\n if (!(namedGraphs1.equals(namedGraphs2))){\\n if (verbose){\\n logger.info(\\\"*** namedGraphs do not match ***\\\");\\n }\\n return false;\\n }\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a56c9f1b5244ac02e8bb14474a2735df\",\n \"score\": \"0.58614594\",\n \"text\": \"public boolean equals(DataStructure otherStructure);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a34a5ae2692bdb804f700b99fc52ee21\",\n \"score\": \"0.5860964\",\n \"text\": \"public boolean isMirror(TreeNode Tree1, TreeNode Tree2){\\n if(Tree1==null && Tree2==null)\\r\\n return true;\\r\\n //Both tree are not equal to null\\r\\n //left tree and right tree values are equal\\r\\n if(Tree1!=null && Tree2!=null && Tree1.val==Tree2.val)\\r\\n return (isMirror(Tree1.left,Tree2.right) &&\\r\\n isMirror(Tree1.right,Tree2.left));\\r\\n return false;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"afef43fdbe087f80c408778faa901e70\",\n \"score\": \"0.58473647\",\n \"text\": \"@Test\\n public void testRetainAll2() {\\n System.out.println(\\\"RetainAll test #2\\\");\\n AVLTree<Integer> tree1 = new AVLTree();\\n tree1.add(1);\\n tree1.add(2);\\n tree1.add(3);\\n AVLTree<Integer> tree2 = new AVLTree();\\n tree2.add(4);\\n tree2.add(5);\\n tree2.add(6);\\n boolean res = tree1.retainAll(tree2);\\n System.out.println(tree1.isEmpty());\\n if (res && tree1.isEmpty()) {\\n System.out.println(\\\"Successful\\\");\\n } else {\\n fail(\\\"Test is not passed\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b84c852ef479f77b7c5854e027ec717b\",\n \"score\": \"0.5795632\",\n \"text\": \"public boolean treeEquals(GPTree tree)\\n {\\n return child.rootedTreeEquals(tree.child);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"214c58ea7462cb70b3eb4c8417cb9c4b\",\n \"score\": \"0.57674915\",\n \"text\": \"private boolean myequals(XML left, XML right) {\\n\\t\\tXML[] lChildren = left.getChildren();\\n\\t\\tXML[] rChildren = right.getChildren();\\n\\t\\tSet<String> lset = new HashSet<String>();\\n\\t\\tSet<String> lnotset = new HashSet<String>();\\n\\t\\tSet<String> rset = new HashSet<String>();\\n\\t\\tSet<String> rnotset = new HashSet<String>();\\n\\t\\tfor(XML lChild : lChildren){\\n\\t\\t\\tif(lChild.getName().equals(\\\"not\\\")){\\n\\t\\t\\t\\tlnotset.add(lChild.getChild(0).getName());\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tlset.add(lChild.getName());\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(XML rChild : rChildren){\\n\\t\\t\\tif(rChild.getName().equals(\\\"not\\\")){\\n\\t\\t\\t\\trnotset.add(rChild.getChild(0).getName());\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\trset.add(rChild.getName());\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(lset.equals(rset) && lnotset.equals(rnotset)){\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\telse return false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"046f31178eef120397425e88e47df348\",\n \"score\": \"0.5667982\",\n \"text\": \"public boolean compare(AncestorEquation ae1, AncestorEquation ae2){//if ae2 is prior to ae1,return true\\r\\n \\t//four cases\\r\\n \\tif(ae1.getClass()==Assignment.class){//if ae1 is assignment\\r\\n \\t\\tAssignment an1=(Assignment)ae1;\\r\\n \\t\\tArrayList<Signal> as=getRightSignals(an1);\\r\\n \\t\\tif(ae2.getClass()==Assignment.class){//if ae2 is assignment\\r\\n \\t\\t\\tAssignment an2=(Assignment)ae2;\\r\\n \\t\\t\\tif(as.contains(an2.left)==true)//if lhs of ae2 is in the rhs of ae1, return true\\r\\n \\t\\t\\t\\treturn true;\\r\\n \\t\\t}\\r\\n \\t\\telse if(ae2.getClass()==ReducedNF.class){//if ae2 is the definition of class\\r\\n \\t\\t\\tClockEquivalenceClass cec=((ReducedNF)ae2).left;\\r\\n \\t\\t\\tif(cec.getAssigns().contains(an1)){//if the assignments in lhs of ae2 contains ae1,return true\\r\\n \\t\\t\\t\\treturn true;\\r\\n \\t\\t\\t}\\r\\n \\t\\t}\\r\\n \\t}\\r\\n \\telse if(ae1.getClass()==ReducedNF.class){//if ae1 is definition of class\\r\\n \\t\\tReducedNF rnf=(ReducedNF)ae1;\\r\\n \\t\\tif(ae2.getClass()==Assignment.class){//if ae2 is assignment \\t\\t\\t\\r\\n \\t\\t\\tAssignment an=(Assignment)ae2;\\r\\n \\t\\t\\tif(rnf.term1==null && rnf.term2==null)\\r\\n \\t\\t\\t\\treturn false;\\r\\n \\t\\t\\telse{//if in ae1 there are signals\\r\\n \\t\\t\\t\\tSignal s1=null;\\r\\n \\t\\t\\t\\tSignal s2=null;\\r\\n \\t\\t\\t\\tif(rnf.term1!=null){\\r\\n \\t\\t\\t\\t\\ts1=rnf.term1.sig;\\r\\n \\t\\t\\t\\t}\\r\\n \\t\\t\\t\\tif(rnf.term2!=null){\\r\\n \\t\\t\\t\\t\\ts2=rnf.term2.sig;\\r\\n \\t\\t\\t\\t}\\r\\n \\t\\t\\t\\tif(s1!=null){//if s1 is the lhs of ae2, return true\\r\\n \\t\\t\\t\\t\\tif(an.left==s1)\\r\\n \\t\\t\\t\\t\\t\\treturn true;\\r\\n \\t\\t\\t\\t}\\r\\n \\t\\t\\t\\tif(s2!=null){//if s2 is the lhs of ae2, return true\\r\\n \\t\\t\\t\\t\\tif(an.left==s2){\\r\\n \\t\\t\\t\\t\\t\\treturn true;\\r\\n \\t\\t\\t\\t\\t}\\r\\n \\t\\t\\t\\t}\\r\\n \\t\\t\\t}\\r\\n \\t\\t}\\r\\n \\t\\telse if(ae2.getClass()==ReducedNF.class){//if ae2 is definition of class\\r\\n \\t\\t\\tReducedNF rnf2=(ReducedNF)(ae2);\\r\\n \\t\\t\\t//if lhs of ae2 is one of the rhs in ae1,return true\\r\\n \\t\\t\\tif(rnf.right1!=null){\\r\\n \\t\\t\\t\\tif(rnf.right1==rnf2.left)\\r\\n \\t\\t\\t\\t\\treturn true;\\r\\n \\t\\t\\t}\\r\\n \\t\\t\\tif(rnf.right2!=null){\\r\\n \\t\\t\\t\\tif(rnf.right2==rnf2.left)\\r\\n \\t\\t\\t\\t\\treturn true;\\r\\n \\t\\t\\t}\\r\\n \\t\\t}\\r\\n \\t}\\r\\n \\treturn false;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3927d336a19c740c28947c05765c9f6f\",\n \"score\": \"0.56619847\",\n \"text\": \"@Test\\n public void testRetainAll1() {\\n System.out.println(\\\"RetainAll test #1\\\");\\n AVLTree<Integer> tree1 = new AVLTree();\\n tree1.add(1);\\n tree1.add(2);\\n tree1.add(3);\\n AVLTree<Integer> tree2 = new AVLTree();\\n tree2.add(1);\\n tree2.add(2);\\n tree2.add(3);\\n boolean res = tree1.retainAll(tree2);\\n if (!res) {\\n System.out.println(\\\"Successful\\\");\\n } else {\\n fail(\\\"Test is not passed\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"646ff5dbebf166e12e5627933093751f\",\n \"score\": \"0.5655728\",\n \"text\": \"public boolean equals(Object other) {\\n if (this == other)\\n return true;\\n \\n \\n if (other == null)\\n return false;\\n \\n if (!(other.getClass() == this.getClass()))\\n return false;\\n\\n Cons<A, B> b = (Cons<A, B>) other;\\n\\n if ((length != b.length) || (hashCode() != b.hashCode()))\\n return false;\\n\\n Cons<A, B> a = this;\\n\\n // TODO: We should traverse the recursive structure\\n //in order to avoid exponential time (for instance\\n //by traversing a list where 2 pointers refer to the\\n //next element).\\n\\n \\n while (a != null) {\\n if (a.getClass() != b.getClass())\\n return false;\\n if (!elementEquals(a.a0, b.a0))\\n return false;\\n if (!elementEquals(a.a1, b.a1))\\n return false;\\n if (!elementEquals(a.a2, b.a2))\\n return false;\\n if (!elementEquals(a.a3, b.a3))\\n return false;\\n\\n a = a.next;\\n b = b.next;\\n }// `while`\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f91b8b0b1286ba5b136e3f3e0dbf0de\",\n \"score\": \"0.5635209\",\n \"text\": \"@Test\\n\\tpublic void testEqualsOneNodeDiffVals() {\\n\\t\\tLinkedList<Integer> ll11 = new LinkedList<Integer>();\\n\\t\\tLinkedList<Integer> ll2 = new LinkedList<Integer>();\\n\\t\\tll11.addToFront(new Node<Integer>(new Integer(1)));\\n\\t\\tll2.addToFront(new Node<Integer>(new Integer(2)));\\n\\t\\tassertFalse(ll11.equals(ll2));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"310b36653ec4a6bdc55d91ebb5f9a547\",\n \"score\": \"0.56285626\",\n \"text\": \"public boolean isMirror(TreeNode t1, TreeNode t2){\\n if(t1 == null && t2 == null) return true;\\n if(t1 == null || t2 == null) return false;\\n\\n /**\\n * Assign left part to one tree & right part to another tree,\\n * also assign right part to it, and check if these are equal recursively\\n * */\\n\\n return (t1.val == t2.val && isMirror(t1.left, t2.right) && isMirror(t1.right, t2.left));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a34d500d6e4f014b74bb29c67844dfc\",\n \"score\": \"0.56238115\",\n \"text\": \"public boolean myEquals(BSTNode<T> that)\\r\\n { \\r\\n // Guardian if-statements\\r\\n if(val.compareTo(that.val) != 0){return false;}\\r\\n \\r\\n // if only one has left/right\\r\\n else if((left == null && that.left != null) || (left != null && that.left == null)){return false;}\\r\\n else if((right == null && that.right != null) || (right != null && that.right == null)){return false;}\\r\\n \\r\\n // if both nodes have no children, return true\\r\\n if(left == null && right == null && that.left == null && that.right == null){return true;}\\r\\n \\r\\n // call on left subtree, store answer\\r\\n boolean leftEquals = true;\\r\\n if(left != null){\\r\\n leftEquals = left.myEquals(that.left);\\r\\n }\\r\\n \\r\\n // call on right subtree, store answer\\r\\n boolean rightEquals = true;\\r\\n if(right != null){\\r\\n rightEquals = right.myEquals(that.right);\\r\\n }\\r\\n \\r\\n if(left != null && right != null){return(leftEquals && rightEquals);}\\r\\n else if(left != null){return leftEquals;}\\r\\n else{return rightEquals;}\\r\\n \\r\\n \\r\\n // if(left != null && that.left != null){return left.myEquals(that.left);}\\r\\n// //else if(left == null && that.left == null){return true;}\\r\\n// else if((left == null && that.left != null) || (left != null && that.left == null)){return false;}\\r\\n// \\r\\n// \\r\\n// \\r\\n// if(right != null && that.right != null){return right.myEquals(that.right);} \\r\\n// //else if(right == null && that.right == null){return true;}\\r\\n// else if((right == null && that.right != null) || (right != null && that.right == null)){return false;} \\r\\n// \\r\\n// return true; // need to add conditions so it doesn't always return true\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"219714f775ba2e109fde56cf9ccf1def\",\n \"score\": \"0.56219596\",\n \"text\": \"@Test\\n public void testAddAll2() {\\n System.out.println(\\\"AddAll test #2\\\");\\n AVLTree<Integer> tree1 = new AVLTree();\\n tree1.add(1);\\n tree1.add(2);\\n tree1.add(3);\\n AVLTree<Integer> tree2 = new AVLTree();\\n tree2.add(4);\\n tree2.add(5);\\n tree2.add(6);\\n boolean res = tree1.addAll(tree2);\\n AVLTree<Integer> tree3 = new AVLTree();\\n tree3.add(1);\\n tree3.add(2);\\n tree3.add(3);\\n tree3.add(4);\\n tree3.add(5);\\n tree3.add(6);\\n if (res && tree1.containsAll(tree3)) {\\n System.out.println(\\\"Successful\\\");\\n } else {\\n fail(\\\"Test is not passed\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"908d2f5db498e80badd8571cb82ab4d3\",\n \"score\": \"0.5609152\",\n \"text\": \"public boolean isSameTree(TreeNode p, TreeNode q){\\n List<Integer> first = BFS(p);\\n List<Integer> second = BFS(q);\\n if(first.size() != second.size()) return false;\\n for (int i = 0; i < first.size(); i++) {\\n if(first.get(i) == null && second.get(i) == null) continue;\\n else if (first.get(i) == null || second.get(i) == null) return false;\\n else if(first.get(i).intValue() != second.get(i).intValue()) return false;\\n }\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d8c25750b2fe61947bf43997d46ad76\",\n \"score\": \"0.56040543\",\n \"text\": \"@Test\\n public void testAddAll1() {\\n System.out.println(\\\"AddAll test #1\\\");\\n AVLTree<Integer> tree1 = new AVLTree();\\n tree1.add(10);\\n tree1.add(20);\\n tree1.add(5);\\n AVLTree<Integer> tree2 = new AVLTree();\\n tree2.add(5);\\n tree2.add(20);\\n tree2.add(10);\\n tree2.add(120);\\n boolean res = tree1.addAll(tree2);\\n if (res && tree1.containsAll(tree2)) {\\n System.out.println(\\\"Successful\\\");\\n } else {\\n fail(\\\"Test is not passed\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"08c122f9ff370530d15446ced8c59c49\",\n \"score\": \"0.55604786\",\n \"text\": \"public static <T extends Type> boolean equal(List<T> lt1, List<T> lt2) {\\n if (lt1.size() != lt2.size()) {\\n return false;\\n }\\n for (int i = 0; i < lt1.size(); i++) {\\n Type cit = lt1.get(i);\\n if (!lt2.stream().filter(c -> equal(c, cit)).findFirst().isPresent()) {\\n return false;\\n }\\n }\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8cda4d58bf5c8f5e2f543d773cfe11f\",\n \"score\": \"0.5539881\",\n \"text\": \"public boolean compareGraphs(double[][] graph1, double[][] graph2) {\\n if (graph1 == null || graph2 == null) {\\n return false;\\n }\\n for (int i = 0; i < graph1.length; i++) {\\n if ((graph1[i][0] != graph2[i][0]) || (graph1[i][1] != graph2[i][1])) {\\n return false;\\n }\\n }\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07e94d10d68f8a7bd2644b06e81bc453\",\n \"score\": \"0.5531613\",\n \"text\": \"@Test\\n public void testRemoveAll2() {\\n System.out.println(\\\"RemoveAll test #2\\\");\\n AVLTree<Integer> tree1 = new AVLTree();\\n tree1.add(1);\\n tree1.add(2);\\n tree1.add(3);\\n AVLTree<Integer> tree2 = new AVLTree();\\n tree2.add(1);\\n tree2.add(2);\\n AVLTree<Integer> tree3 = new AVLTree();\\n tree3.add(3);\\n boolean res = tree1.removeAll(tree2);\\n if (res && tree3.containsAll(tree1)) {\\n System.out.println(\\\"Successful\\\");\\n } else {\\n fail(\\\"Test is not passed\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87f027bfc083120361964a3ffc303e46\",\n \"score\": \"0.5523713\",\n \"text\": \"public static void main(String[] args) {\\n\\t\\troot = null;\\n\\t\\troot2 = null;\\n\\t\\tint[] values = {50,40,70,30,45};\\n\\t\\tfor(int i=0;i<values.length;i++)\\n\\t\\t{\\n\\t\\t\\troot = insertTree(root,values[i]);\\n\\t\\t}\\n\\t\\tint[] values2 = {55,40,70,30,45};\\n\\t\\tfor(int i=0;i<values.length;i++)\\n\\t\\t{\\n\\t\\t\\troot2 = insertTree(root2,values[i]);\\n\\t\\t}\\n\\t\\ttraverseInorder(root);\\n\\t\\tif(checkIfSimilar(root,root2))\\n\\t\\t{\\n\\t\\t\\tSystem.out.println(\\\"Trees are similar\\\");\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd3f2496c6fe33067d76ea6d18198f17\",\n \"score\": \"0.55154514\",\n \"text\": \"private boolean equals(Node node1, Node node2) {\\n\\t\\tif (node1 == null || node2 == null) { // If either node is null, return their comparison\\n\\t\\t\\tif(node1 == node2) {\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif (!node1.data.equals(node2.data)) { // If corresponding nodes !=\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\n\\t\\treturn equals(node1.left, node2.left) && equals(node1.right, node2.right);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1f3cd596ba8f9e265b65e8b783aca35\",\n \"score\": \"0.5513198\",\n \"text\": \"@Override\\n public boolean equals(Object o){\\n if(!(o instanceof Alignment)){\\n return false;\\n }\\n Alignment a2 = (Alignment) o;\\n for (Node n1 : this.getAlignedNodesNet1()){\\n for(Node n2 : this.getAlignedNodesNet2()){\\n if(this.isMapped(n1,n2) && !a2.isMapped(n1,n2) || !this.isMapped(n1,n2) && a2.isMapped(n1,n2)){\\n return false;\\n }\\n }\\n }\\n\\n for (Node n1 : a2.getAlignedNodesNet1()){\\n for(Node n2 : a2.getAlignedNodesNet2()){\\n if(this.isMapped(n1,n2) && !a2.isMapped(n1,n2) || !this.isMapped(n1,n2) && a2.isMapped(n1,n2)){\\n return false;\\n }\\n }\\n }\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5884319a657f5d8eb74a07c9ad9b299\",\n \"score\": \"0.5504544\",\n \"text\": \"public static <T extends ElkEntity> boolean equals(\\n\\t\\t\\tfinal Taxonomy<T> taxonomy1, final Taxonomy<T> taxonomy2) {\\n\\n\\t\\tif (taxonomy1 == null) {\\n\\t\\t\\treturn taxonomy2 == null;\\n\\t\\t}\\n\\t\\tif (taxonomy2 == null) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\n\\t\\t// Each node must have the same sets of members, parents and children\\n\\n\\t\\tfinal Set<? extends TaxonomyNode<T>> nodes1 = taxonomy1.getNodes();\\n\\t\\tfinal Set<? extends TaxonomyNode<T>> nodes2 = taxonomy2.getNodes();\\n\\n\\t\\tif (nodes1.size() != nodes2.size()) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\tfor (final TaxonomyNode<T> node1 : nodes1) {\\n\\n\\t\\t\\tfinal T thisMember = node1.getCanonicalMember();\\n\\t\\t\\tfinal TaxonomyNode<T> node2 = taxonomy2.getNode(thisMember);\\n\\t\\t\\tif (node2 == null) {\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Members\\n\\t\\t\\tif (node1.size() != node2.size()) {\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t\\tfor (final T member : node1) {\\n\\t\\t\\t\\tif (!node2.contains(member)) {\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Parents\\n\\t\\t\\tfinal Set<? extends TaxonomyNode<T>> parents1 = node1\\n\\t\\t\\t\\t\\t.getDirectSuperNodes();\\n\\t\\t\\tfinal Set<? extends TaxonomyNode<T>> parents2 = node2\\n\\t\\t\\t\\t\\t.getDirectSuperNodes();\\n\\t\\t\\tif (parents1.size() != parents2.size()) {\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t\\tfor (final TaxonomyNode<T> parent1 : parents1) {\\n\\t\\t\\t\\t// While all nodes must be the same, it is sufficient to compare\\n\\t\\t\\t\\t// canonical members.\\n\\t\\t\\t\\tfinal TaxonomyNode<T> parent2 = taxonomy2\\n\\t\\t\\t\\t\\t\\t.getNode(parent1.getCanonicalMember());\\n\\t\\t\\t\\t/*\\n\\t\\t\\t\\t * otherParent is a node from taxonomy2 (or null), so\\n\\t\\t\\t\\t * contains(Object) on a node set from taxonomy2 should work for\\n\\t\\t\\t\\t * it as expected.\\n\\t\\t\\t\\t */\\n\\t\\t\\t\\tif (!parents2.contains(parent2)) {\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Children\\n\\t\\t\\tfinal Set<? extends TaxonomyNode<T>> children1 = node1\\n\\t\\t\\t\\t\\t.getDirectSubNodes();\\n\\t\\t\\tfinal Set<? extends TaxonomyNode<T>> children2 = node2\\n\\t\\t\\t\\t\\t.getDirectSubNodes();\\n\\t\\t\\tif (children1.size() != children2.size()) {\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t\\tfor (final TaxonomyNode<T> child1 : children1) {\\n\\t\\t\\t\\t// While all nodes must be the same, it is sufficient to compare\\n\\t\\t\\t\\t// canonical members.\\n\\t\\t\\t\\tfinal TaxonomyNode<T> child2 = taxonomy2\\n\\t\\t\\t\\t\\t\\t.getNode(child1.getCanonicalMember());\\n\\t\\t\\t\\t/*\\n\\t\\t\\t\\t * otherParent is a node from taxonomy2 (or null), so\\n\\t\\t\\t\\t * contains(Object) on a node set from taxonomy2 should work for\\n\\t\\t\\t\\t * it as expected.\\n\\t\\t\\t\\t */\\n\\t\\t\\t\\tif (!children2.contains(child2)) {\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\t// No difference found ;-)\\n\\t\\treturn true;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01bf08340efd033b3bdc927f0f5d4883\",\n \"score\": \"0.5461961\",\n \"text\": \"@Test\\r\\n\\tpublic void checkEquality() {\\r\\n\\r\\n\\t\\tBasicTestTree object = new BasicTestTree();\\r\\n\\t\\tBasicTestTree equalObject = new BasicTestTree();\\r\\n\\t\\tBasicTestTree unequalObject = null;\\r\\n\\r\\n\\t\\t// ---- Check bad arguments to equals. ---- //\\r\\n\\t\\t// Check the default equals method.\\r\\n\\t\\tassertFalse(object.equals(unequalObject));\\r\\n\\t\\tassertFalse(object.equals(\\\"some string\\\"));\\r\\n\\t\\t// Check the tree equals method.\\r\\n\\t\\tassertFalse(object.equals(unequalObject, false));\\r\\n\\t\\tassertFalse(object.equals(unequalObject, true));\\r\\n\\t\\t// ---------------------------------------- //\\r\\n\\r\\n\\t\\t// ---- Check the base case: two single nodes. ---- //\\r\\n\\t\\t// The references are not the same.\\r\\n\\t\\tassertNotSame(object, equalObject);\\r\\n\\r\\n\\t\\t// Check the default equals method in both directions.\\r\\n\\t\\t// Reflexive check.\\r\\n\\t\\tassertTrue(object.equals(object));\\r\\n\\t\\t// Symmetric check.\\r\\n\\t\\tassertTrue(object.equals(equalObject));\\r\\n\\t\\tassertTrue(equalObject.equals(object));\\r\\n\\t\\t// Check the tree equals method in both directions.\\r\\n\\t\\t// Reflexive check.\\r\\n\\t\\tassertTrue(object.equals(object, false));\\r\\n\\t\\tassertTrue(object.equals(object, true));\\r\\n\\t\\t// Symmetric check.\\r\\n\\t\\tassertTrue(object.equals(equalObject, false));\\r\\n\\t\\tassertTrue(object.equals(equalObject, true));\\r\\n\\t\\tassertTrue(equalObject.equals(object, false));\\r\\n\\t\\tassertTrue(equalObject.equals(object, true));\\r\\n\\r\\n\\t\\t// Check their hash codes!\\r\\n\\t\\tassertEquals(object.hashCode(), equalObject.hashCode());\\r\\n\\t\\tassertEquals(object.hashCode(false), equalObject.hashCode(false));\\r\\n\\t\\tassertEquals(object.hashCode(true), equalObject.hashCode(true));\\r\\n\\t\\t// ------------------------------------------------ //\\r\\n\\r\\n\\t\\t// ---- Try changing the properties. ---- //\\r\\n\\t\\tunequalObject = new BasicTestTree();\\r\\n\\t\\tobject.property = \\\"derp\\\";\\r\\n\\t\\tequalObject.property = \\\"derp\\\";\\r\\n\\r\\n\\t\\t// The references are not the same.\\r\\n\\t\\tassertNotSame(object, equalObject);\\r\\n\\t\\tassertNotSame(object, unequalObject);\\r\\n\\t\\tassertNotSame(equalObject, unequalObject);\\r\\n\\r\\n\\t\\t// The next tests check equality between object and equalObject.\\r\\n\\r\\n\\t\\t// Check the default equals method in both directions.\\r\\n\\t\\t// Reflexive check.\\r\\n\\t\\tassertTrue(object.equals(object));\\r\\n\\t\\t// Symmetric check.\\r\\n\\t\\tassertTrue(object.equals(equalObject));\\r\\n\\t\\tassertTrue(equalObject.equals(object));\\r\\n\\t\\t// Check the tree equals method in both directions.\\r\\n\\t\\t// Reflexive check.\\r\\n\\t\\tassertTrue(object.equals(object, false));\\r\\n\\t\\tassertTrue(object.equals(object, true));\\r\\n\\t\\t// Symmetric check.\\r\\n\\t\\tassertTrue(object.equals(equalObject, false));\\r\\n\\t\\tassertTrue(object.equals(equalObject, true));\\r\\n\\t\\tassertTrue(equalObject.equals(object, false));\\r\\n\\t\\tassertTrue(equalObject.equals(object, true));\\r\\n\\r\\n\\t\\t// Check their hash codes!\\r\\n\\t\\tassertEquals(object.hashCode(), equalObject.hashCode());\\r\\n\\t\\tassertEquals(object.hashCode(false), equalObject.hashCode(false));\\r\\n\\t\\tassertEquals(object.hashCode(true), equalObject.hashCode(true));\\r\\n\\r\\n\\t\\t// The next tests check inequality between object and unequalObject and\\r\\n\\t\\t// between equalObject and unequalObject.\\r\\n\\r\\n\\t\\t// Check the default equals against the unequal object.\\r\\n\\t\\tassertFalse(object.equals(unequalObject));\\r\\n\\t\\tassertFalse(unequalObject.equals(object));\\r\\n\\t\\tassertFalse(equalObject.equals(unequalObject));\\r\\n\\t\\tassertFalse(unequalObject.equals(equalObject));\\r\\n\\r\\n\\t\\t// Check the tree equals against the unequal object.\\r\\n\\t\\tassertFalse(object.equals(unequalObject, false));\\r\\n\\t\\tassertFalse(object.equals(unequalObject, true));\\r\\n\\t\\tassertFalse(unequalObject.equals(object, false));\\r\\n\\t\\tassertFalse(unequalObject.equals(object, true));\\r\\n\\t\\tassertFalse(equalObject.equals(unequalObject, false));\\r\\n\\t\\tassertFalse(equalObject.equals(unequalObject, true));\\r\\n\\t\\tassertFalse(unequalObject.equals(equalObject, false));\\r\\n\\t\\tassertFalse(unequalObject.equals(equalObject, true));\\r\\n\\r\\n\\t\\t// Check their hash codes!\\r\\n\\t\\tassertFalse(object.hashCode() == unequalObject.hashCode());\\r\\n\\t\\tassertFalse(object.hashCode(false) == unequalObject.hashCode(false));\\r\\n\\t\\tassertFalse(object.hashCode(true) == unequalObject.hashCode(true));\\r\\n\\t\\tassertFalse(equalObject.hashCode() == unequalObject.hashCode());\\r\\n\\t\\tassertFalse(\\r\\n\\t\\t\\t\\tequalObject.hashCode(false) == unequalObject.hashCode(false));\\r\\n\\t\\tassertFalse(equalObject.hashCode(true) == unequalObject.hashCode(true));\\r\\n\\t\\t// -------------------------------------- //\\r\\n\\r\\n\\t\\t// ---- Try a more complicated tree. ---- //\\r\\n\\t\\tBasicTestTree tree1;\\r\\n\\t\\tBasicTestTree tree2;\\r\\n\\r\\n\\t\\t// Create a tree with 4 elements as follows:\\r\\n\\t\\t// Breadth first order: ABCD, A has children B and C, C has child D.\\r\\n\\t\\tobject = new BasicTestTree();\\r\\n\\t\\tobject.property = \\\"A\\\";\\r\\n\\t\\ttree1 = new BasicTestTree();\\r\\n\\t\\ttree1.property = \\\"B\\\";\\r\\n\\t\\tobject.addChild(tree1);\\r\\n\\t\\ttree1 = new BasicTestTree();\\r\\n\\t\\ttree1.property = \\\"C\\\";\\r\\n\\t\\tobject.addChild(tree1);\\r\\n\\t\\ttree2 = new BasicTestTree();\\r\\n\\t\\ttree2.property = \\\"D\\\";\\r\\n\\t\\ttree1.addChild(tree2);\\r\\n\\r\\n\\t\\t// Duplicate the tree for the equals tree.\\r\\n\\t\\tequalObject = new BasicTestTree();\\r\\n\\t\\tequalObject.property = \\\"A\\\";\\r\\n\\t\\ttree1 = new BasicTestTree();\\r\\n\\t\\ttree1.property = \\\"B\\\";\\r\\n\\t\\tequalObject.addChild(tree1);\\r\\n\\t\\ttree1 = new BasicTestTree();\\r\\n\\t\\ttree1.property = \\\"C\\\";\\r\\n\\t\\tequalObject.addChild(tree1);\\r\\n\\t\\ttree2 = new BasicTestTree();\\r\\n\\t\\ttree2.property = \\\"D\\\";\\r\\n\\t\\ttree1.addChild(tree2);\\r\\n\\r\\n\\t\\t// For an unequal tree, create a different tree with the same\\r\\n\\t\\t// breadth-first order (just add all nodes to A).\\r\\n\\t\\tunequalObject = new BasicTestTree();\\r\\n\\t\\tunequalObject.property = \\\"A\\\";\\r\\n\\t\\ttree1 = new BasicTestTree();\\r\\n\\t\\ttree1.property = \\\"B\\\";\\r\\n\\t\\tunequalObject.addChild(tree1);\\r\\n\\t\\ttree1 = new BasicTestTree();\\r\\n\\t\\ttree1.property = \\\"C\\\";\\r\\n\\t\\tunequalObject.addChild(tree1);\\r\\n\\t\\ttree2 = new BasicTestTree();\\r\\n\\t\\ttree2.property = \\\"D\\\";\\r\\n\\t\\tunequalObject.addChild(tree2); // Different!\\r\\n\\r\\n\\t\\t// The references are not the same.\\r\\n\\t\\tassertNotSame(object, equalObject);\\r\\n\\t\\tassertNotSame(object, unequalObject);\\r\\n\\t\\tassertNotSame(equalObject, unequalObject);\\r\\n\\r\\n\\t\\t// The next tests check equality between object and equalObject.\\r\\n\\r\\n\\t\\t// Check the default equals method in both directions.\\r\\n\\t\\t// Reflexive check.\\r\\n\\t\\tassertTrue(object.equals(object));\\r\\n\\t\\t// Symmetric check.\\r\\n\\t\\tassertTrue(object.equals(equalObject));\\r\\n\\t\\tassertTrue(equalObject.equals(object));\\r\\n\\t\\t// Check the tree equals method in both directions.\\r\\n\\t\\t// Reflexive check.\\r\\n\\t\\tassertTrue(object.equals(object, false));\\r\\n\\t\\tassertTrue(object.equals(object, true));\\r\\n\\t\\t// Symmetric check.\\r\\n\\t\\tassertTrue(object.equals(equalObject, false));\\r\\n\\t\\tassertTrue(object.equals(equalObject, true));\\r\\n\\t\\tassertTrue(equalObject.equals(object, false));\\r\\n\\t\\tassertTrue(equalObject.equals(object, true));\\r\\n\\r\\n\\t\\t// Check their hash codes!\\r\\n\\t\\tassertEquals(object.hashCode(), equalObject.hashCode());\\r\\n\\t\\tassertEquals(object.hashCode(false), equalObject.hashCode(false));\\r\\n\\t\\tassertEquals(object.hashCode(true), equalObject.hashCode(true));\\r\\n\\r\\n\\t\\t// The next tests check inequality between object and unequalObject and\\r\\n\\t\\t// between equalObject and unequalObject.\\r\\n\\r\\n\\t\\t// Check the default equals against the unequal object.\\r\\n\\t\\t// Note: This will return true because the tree's structure is not\\r\\n\\t\\t// tested!\\r\\n\\t\\tassertTrue(object.equals(unequalObject));\\r\\n\\t\\tassertTrue(unequalObject.equals(object));\\r\\n\\t\\tassertTrue(equalObject.equals(unequalObject));\\r\\n\\t\\tassertTrue(unequalObject.equals(equalObject));\\r\\n\\r\\n\\t\\t// Check the tree equals against the unequal object.\\r\\n\\t\\t// Note: When passing in fullTree as false, the tree's structure is not\\r\\n\\t\\t// tested!\\r\\n\\t\\tassertTrue(object.equals(unequalObject, false));\\r\\n\\t\\tassertFalse(object.equals(unequalObject, true));\\r\\n\\t\\tassertTrue(unequalObject.equals(object, false));\\r\\n\\t\\tassertFalse(unequalObject.equals(object, true));\\r\\n\\t\\tassertTrue(equalObject.equals(unequalObject, false));\\r\\n\\t\\tassertFalse(equalObject.equals(unequalObject, true));\\r\\n\\t\\tassertTrue(unequalObject.equals(equalObject, false));\\r\\n\\t\\tassertFalse(unequalObject.equals(equalObject, true));\\r\\n\\r\\n\\t\\t// Check their hash codes! Note: The hash codes will be equal for the\\r\\n\\t\\t// default hashCode() and the tree hashCode() with fullTree set to\\r\\n\\t\\t// false, since only the node itself, and not its subtree, is hashed.\\r\\n\\t\\tassertTrue(object.hashCode() == unequalObject.hashCode());\\r\\n\\t\\tassertTrue(object.hashCode(false) == unequalObject.hashCode(false));\\r\\n\\t\\tassertFalse(object.hashCode(true) == unequalObject.hashCode(true));\\r\\n\\t\\tassertTrue(equalObject.hashCode() == unequalObject.hashCode());\\r\\n\\t\\tassertTrue(\\r\\n\\t\\t\\t\\tequalObject.hashCode(false) == unequalObject.hashCode(false));\\r\\n\\t\\tassertFalse(equalObject.hashCode(true) == unequalObject.hashCode(true));\\r\\n\\t\\t// -------------------------------------- //\\r\\n\\r\\n\\t\\t// ---- Try comparing against another type of BasicTree. ---- //\\r\\n\\t\\tFakeBasicTestTree fakeObject = new FakeBasicTestTree();\\r\\n\\t\\tassertFalse(object.equals(fakeObject));\\r\\n\\t\\t// ---------------------------------------------------------- //\\r\\n\\r\\n\\t\\treturn;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26120eea184077e9aa12cabe3d6f6721\",\n \"score\": \"0.54612845\",\n \"text\": \"public static boolean isIdentical(Node<?> firstTreeHead,\\n\\t\\t\\tNode<?> secondTreeHead) {\\n\\t\\t\\n\\t\\tif (firstTreeHead != null && secondTreeHead != null) {\\n\\t\\t\\tif (firstTreeHead.element == secondTreeHead.element) {\\n\\t\\t\\t\\tboolean isLeftIdentical = isIdentical(\\n\\t\\t\\t\\t\\t\\tfirstTreeHead.left, secondTreeHead.left);\\n\\t\\t\\t\\tboolean isRightIdentical = isIdentical(\\n\\t\\t\\t\\t\\t\\tfirstTreeHead.right, secondTreeHead.right);\\n\\t\\t\\t\\treturn isLeftIdentical && isRightIdentical;\\n\\t\\t\\t}\\n\\t\\t} else if (firstTreeHead == null && secondTreeHead == null) {\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c55b6f67774eca73f9f331bfdc01569b\",\n \"score\": \"0.54317474\",\n \"text\": \"private boolean compareArrayList(ArrayList<Item> one, ArrayList<Item> two){\\n if(one.size()!=two.size()){\\n return false;\\n }\\n for(int i = 0; i<one.size(); i++){\\n if(!(one.get(i).getId().equals(two.get(i).getId()))){\\n return false;\\n }\\n if(!(one.get(i).getType().equals(two.get(i).getType()))){\\n return false;\\n }\\n if(!(Arrays.equals(one.get(i).getTypeVariables(), two.get(i).getTypeVariables()))){\\n return false;\\n }\\n if(!(one.get(i).getManuID().equals(two.get(i).getManuID()))){\\n return false;\\n }\\n if(!(one.get(i).getPrice().equals(two.get(i).getPrice()))){\\n return false;\\n }\\n }\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ab13d2e50cb4e1a9e5b24ad58f6a57c\",\n \"score\": \"0.54247415\",\n \"text\": \"protected boolean childrenEqual(Node node1, Node node2) {\\n\\n boolean equal = false;\\n\\n childrenCheck: {\\n NodeList node1Children = node1.getChildNodes();\\n NodeList node2Children = node2.getChildNodes();\\n\\n if (node1Children == null || node2Children == null) {\\n break childrenCheck;\\n }\\n\\n if (node1Children.getLength() != node2Children.getLength()) {\\n break childrenCheck;\\n }\\n\\n // compare all the childrens\\n equal = true;\\n\\n for (int i = 0; i < node1Children.getLength(); i++) {\\n if (!compareNode(node1Children.item(i),\\n node2Children.item(i))) {\\n equal = false;\\n break childrenCheck;\\n }\\n }\\n }\\n\\n return equal;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ad62abd40be3c62677001a263f4e9851\",\n \"score\": \"0.5419724\",\n \"text\": \"public int compareTo(Object other) {\\n if (this == other)\\n return 0;\\n if (other instanceof DataBag) {\\n DataBag bOther = (DataBag) other;\\n if (this.size() != bOther.size()) {\\n if (this.size() > bOther.size()) return 1;\\n else return -1;\\n }\\n\\n // Ugh, this is bogus. But I have to know if two bags have the\\n // same tuples, regardless of order. Hopefully most of the\\n // time the size check above will prevent this.\\n // If either bag isn't already sorted, create a sorted bag out\\n // of it so I can guarantee order.\\n DataBag thisClone;\\n DataBag otherClone;\\n if (this instanceof SortedDataBag ||\\n this instanceof DistinctDataBag) {\\n thisClone = this;\\n } else {\\n thisClone = new SortedDataBag(null);\\n Iterator<Tuple> i = iterator();\\n while (i.hasNext()) thisClone.add(i.next());\\n }\\n if (other instanceof SortedDataBag ||\\n other instanceof DistinctDataBag) {\\n otherClone = bOther;\\n } else {\\n otherClone = new SortedDataBag(null);\\n Iterator<Tuple> i = bOther.iterator();\\n while (i.hasNext()) otherClone.add(i.next());\\n }\\n Iterator<Tuple> thisIt = thisClone.iterator();\\n Iterator<Tuple> otherIt = otherClone.iterator();\\n while (thisIt.hasNext() && otherIt.hasNext()) {\\n Tuple thisT = thisIt.next();\\n Tuple otherT = otherIt.next();\\n \\n int c = thisT.compareTo(otherT);\\n if (c != 0) return c;\\n }\\n \\n return 0; // if we got this far, they must be equal\\n } else {\\n return DataType.compare(this, other);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81fbbc879b0326aed05a7734b34f76b9\",\n \"score\": \"0.54193366\",\n \"text\": \"protected boolean compareNode(Node node1, Node node2) {\\n boolean equal = false;\\n\\n nodeCheck: {\\n\\n if (node1 == null || node2 == null) {\\n break nodeCheck;\\n }\\n\\n // nodevalue is short\\n if (node1.getNodeType() != node2.getNodeType()) {\\n break nodeCheck;\\n }\\n\\n // nodeName will not be null\\n if (!node1.getNodeName().equals(node2.getNodeName())) {\\n break nodeCheck;\\n }\\n\\n // nodeValue can be null for a lot of type of cells\\n if (node1.getNodeValue() == null && node2.getNodeValue() == null) {\\n // empty\\n } else if (node1.getNodeValue() == null ||\\n node2.getNodeValue() == null) {\\n break nodeCheck;\\n } else if (!node1.getNodeValue().equals(node2.getNodeValue())) {\\n break nodeCheck;\\n }\\n\\n // try to compare attributes \\n if (!attributesEqual(node1, node2)) {\\n break nodeCheck;\\n }\\n\\n // don't need to compare if both node do not have children\\n if (!node1.hasChildNodes() && !node2.hasChildNodes()) {\\n equal = true;\\n break nodeCheck;\\n // don't need to compare if one node has children but not the other\\n } else if (!node1.hasChildNodes() || !node2.hasChildNodes()) {\\n equal = false;\\n break nodeCheck;\\n // need to compare if both node has children \\n } else if (!childrenEqual(node1, node2)) {\\n break nodeCheck;\\n }\\n\\n equal = true;\\n }\\n\\n return equal;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cced44d3d98b7baa90e464d29fff03fd\",\n \"score\": \"0.5389329\",\n \"text\": \"public void testEquality() throws Exception\\r\\n {\\r\\n // null parameter\\r\\n DataObject dobj1 = getRootDataObject(\\\"data\\\", \\\"copy1.xml\\\");\\r\\n DataObject dobj2 = getRootDataObject(\\\"data\\\", \\\"copy2.xml\\\");\\r\\n assertFalse(equalityHelper.equalShallow(dobj1, null));\\r\\n assertFalse(equalityHelper.equal(dobj1, null));\\r\\n assertTrue(equalityHelper.equalShallow(null, null));\\r\\n assertTrue(equalityHelper.equal(null, null));\\r\\n // two data objects of different types\\r\\n assertFalse(equalityHelper.equalShallow(dobj1, dobj2));\\r\\n assertFalse(equalityHelper.equal(dobj1, dobj2));\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da12643ee6dfa365095d44dd6c09f028\",\n \"score\": \"0.53852373\",\n \"text\": \"@Override\\n public int compare(Object object1, Object object2) {\\n ArrayList<ArrayList<Comparable>> array1 = (ArrayList<ArrayList<Comparable>>) object1;\\n ArrayList<ArrayList<Comparable>> array2 = (ArrayList<ArrayList<Comparable>>) object2;\\n assert array1.size() > 0 && array2.size() > 0 : \\\"Empty ArrayList\\\"; //Ensures that any bugs that happen can be easily resolved\\n //First checks if the sizes are the same\\n if (array1.size() < array2.size()) {\\n return -1;\\n } else if (array1.size() > array2.size()) {\\n return 1;\\n }\\n if (array1.get(0).size() < array2.get(0).size()) {\\n return -1;\\n } else if (array1.get(0).size() > array2.get(0).size()) {\\n return 1;\\n }\\n //Same sizes; checks for content\\n for (int i = 0; i < array1.size(); i++) { //Goes thru every single index of both arrays and compare then\\n for (int j = 0; j < array1.get(0).size(); j++) {\\n //If index by index they are not the same\\n if (array1.get(i).get(j).compareTo(array2.get(i).get(j)) > 0) {\\n return 1;\\n } else if (array1.get(i).get(j).compareTo(array2.get(i).get(j)) < 0) {\\n return -1;\\n }\\n }\\n }\\n return 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed17f58a20cb849686225f3d3842f04a\",\n \"score\": \"0.53778696\",\n \"text\": \"public static Boolean isEqual(Object left, Object right, EvaluationContext ctx ) {\\n if ( left == null || right == null ) {\\n return left == right;\\n }\\n\\n // spec defines that \\\"a=[a]\\\", i.e., singleton collections should be treated as the single element\\n // and vice-versa\\n if( left instanceof Collection && !(right instanceof Collection) && ((Collection)left).size() == 1 ) {\\n left = ((Collection)left).toArray()[0];\\n } else if( right instanceof Collection && !(left instanceof Collection) && ((Collection)right).size()==1 ) {\\n right = ((Collection) right).toArray()[0];\\n }\\n\\n if( left instanceof Range && right instanceof Range ) {\\n return isEqual( (Range)left, (Range) right );\\n } else if( left instanceof Iterable && right instanceof Iterable ) {\\n return isEqual( (Iterable)left, (Iterable) right );\\n } else if( left instanceof Map && right instanceof Map ) {\\n return isEqual( (Map)left, (Map) right );\\n } else if (left instanceof ChronoPeriod && right instanceof ChronoPeriod) {\\n // periods have special compare semantics in FEEL as it ignores \\\"days\\\". Only months and years are compared\\n Long l = ComparablePeriod.toTotalMonths((ChronoPeriod) left);\\n Long r = ComparablePeriod.toTotalMonths((ChronoPeriod) right);\\n return isEqual(l, r);\\n } else if (left instanceof TemporalAccessor && right instanceof TemporalAccessor) {\\n // Handle specific cases when both time / datetime\\n TemporalAccessor l = (TemporalAccessor) left;\\n TemporalAccessor r = (TemporalAccessor) right;\\n if (BuiltInType.determineTypeFromInstance(left) == BuiltInType.TIME && BuiltInType.determineTypeFromInstance(right) == BuiltInType.TIME) {\\n return isEqual(valuet(l), valuet(r));\\n } else if (BuiltInType.determineTypeFromInstance(left) == BuiltInType.DATE_TIME && BuiltInType.determineTypeFromInstance(right) == BuiltInType.DATE_TIME) {\\n return isEqual(valuedt(l, r.query(TemporalQueries.zone())), valuedt(r, l.query(TemporalQueries.zone())));\\n } // fallback; continue:\\n }\\n return compare( left, right, ctx, (l, r) -> l.compareTo( r ) == 0 );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"397e1b0d3a706e94988852662c2c7796\",\n \"score\": \"0.53617805\",\n \"text\": \"@Test\\n public void testRemoveAll1() {\\n System.out.println(\\\"RemoveAll test #1\\\");\\n AVLTree<Integer> tree1 = new AVLTree();\\n tree1.add(1);\\n tree1.add(2);\\n tree1.add(3);\\n AVLTree<Integer> tree2 = new AVLTree();\\n tree2.add(4);\\n tree2.add(5);\\n tree2.add(6);\\n boolean res = tree1.removeAll(tree2);\\n if (!res) {\\n System.out.println(\\\"Successful\\\");\\n } else {\\n fail(\\\"Test is not passed\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77e0348637d9d789a064ed43bac6e999\",\n \"score\": \"0.5351761\",\n \"text\": \"public static boolean equal(Type r1, Type r2) {\\n if (Objects.equals(r1, r2)) {\\n return true; //if they are ALREADY equal, return true\\n }\\n if (r1 == null || r2 == null) {\\n //System.out.println( \\\"ONE NULL\\\" );\\n return false;\\n }\\n if( r1.getClass() != r2.getClass() ){\\n return false;\\n }\\n if( r1.isUnionType() && r2.isUnionType() ){ //UnionTypes \\\"A | B\\\" == \\\"B | A\\\"\\n UnionType ut1 = r1.asUnionType();\\n UnionType ut2 = r2.asUnionType();\\n NodeList<ReferenceType> rts1 = ut1.getElements();\\n NodeList<ReferenceType> rts2 = ut2.getElements();\\n if( rts1.size() != rts2.size() ){\\n return false;\\n }\\n return rts1.stream().allMatch( r-> rts2.stream().anyMatch(a-> equal(a, r)));\\n }\\n //if ONE or the OTHER is fully\\n boolean r1FullyQualified = r1.asString().contains(\\\".\\\");\\n boolean r2FullyQualified = r2.asString().contains(\\\".\\\");\\n\\n //OK, what I have to do is tokenize based on < > , space\\n //ok, really... what I have to do is \\\"build\\\" tokens\\n //XOR, if ONE or the OTHER (NOT BOTH or NEITHER) are fully qualified\\n if ((r1FullyQualified || r2FullyQualified) && !(r1FullyQualified && r2FullyQualified)) {\\n List<String> r1Toks = tokenize(r1.asString());\\n List<String> r2Toks = tokenize(r2.asString());\\n if (r1Toks.size() != r2Toks.size()) {\\n return false;\\n }\\n for (int i = 0; i < r1Toks.size(); i++) {\\n if (!r1Toks.get(i).equals(r2Toks.get(i))) {\\n r1FullyQualified = r1Toks.get(i).contains(\\\".\\\");\\n r2FullyQualified = r2Toks.get(i).contains(\\\".\\\");\\n\\n if ((r1FullyQualified || r2FullyQualified) && !(r1FullyQualified && r2FullyQualified)) {\\n String s1 = r1Toks.get(i);\\n if (s1.contains(\\\".\\\")) {\\n s1 = s1.substring(s1.lastIndexOf(\\\".\\\") + 1);\\n }\\n String s2 = r2Toks.get(i);\\n if (s2.contains(\\\".\\\")) {\\n s2 = s2.substring(s2.lastIndexOf(\\\".\\\") + 1);\\n }\\n //\\n if (!s1.equals(s2)) {\\n return false;\\n }\\n }\\n }\\n }\\n return true;\\n }\\n //here we could have both types that have '.'s but one is from an inner class\\n // i.e.\\n // _typeRef _t1 = _typeRef.of(\\\"_enum._constant\\\");\\n // _typeRef _t2 = _typeRef.of(\\\"org.jdraft._enum._constant\\\");\\n //ok... lets parse out the first\\n\\n List<String> t1s = tokenize(r1);\\n List<String> t2s = tokenize(r2);\\n if (t1s.size() != t2s.size()) {\\n return false;\\n }\\n String s1n = t1s.get(0); //get the first (type) token\\n String s2n = t2s.get(0); //get the second (type) token\\n int dotIndex1 = s1n.lastIndexOf('.');\\n int dotIndex2 = s2n.lastIndexOf('.');\\n if( dotIndex1 > 0 ){ //this means BOTH must be qualified (partially or otherwise)\\n //Log.info( \\\"BOTH PARTIALLY QUALIFIED\\\");\\n if( s1n.contains(s2n) || s2n.contains(s1n) ){ //compare that either one contains the other JUST THE NAME NOT GENERICS\\n //String normalizedName = s1n.substring(dotIndex);\\n String t1 = r1.asString().substring(dotIndex1+1);\\n String t2 = r2.asString().substring(dotIndex2+1);\\n //call types equal on the SIMPLE type name and (potentially) any generics after it\\n return equal( of(t1), of(t2));\\n }\\n }\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86992611cd0d4d0d48f1105bcee4ea5f\",\n \"score\": \"0.53502303\",\n \"text\": \"@Test\\n public void equalToTest(){\\n NeapolitanCard c1 = new NeapolitanCard('1','B');\\n NeapolitanCard c2 = new NeapolitanCard('1','B');\\n NeapolitanCard c3 = new NeapolitanCard('K','B');\\n NeapolitanCard c4 = new NeapolitanCard('1','G');\\n NeapolitanCard c5 = new NeapolitanCard('4','G');\\n\\n assertTrue(c1.equalTo(c2));\\n assertTrue(!c1.equalTo(c3));\\n assertTrue(!c1.equalTo(c4));\\n assertTrue(!c1.equalTo(c5));\\n\\n for(int i = 0; i < cardsCollection1.length; i++){\\n for(int j = 0; j < cardsCollection1.length;j++){\\n if(i == j)\\n assertTrue(cardsCollection1[i].equalTo(cardsCollection1[j]));\\n else\\n assertTrue(!cardsCollection1[i].equalTo(cardsCollection1[j]));\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a1a076ce8eb1920f8426795e3ac0da7\",\n \"score\": \"0.534387\",\n \"text\": \"public static boolean sameAs (RadioStation lhs, RadioStation rhs)\\n {\\n RadioOBJComparator comparator = new RadioOBJComparator();\\n if (comparator.compare(lhs,rhs) == 0)\\n return true;\\n else\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40a9f6ecc6c94b2714585bbe48f7739a\",\n \"score\": \"0.5343375\",\n \"text\": \"@Override\\n public boolean equals(Object o) {\\n if (this == o) return true;\\n if (o == null || getClass() != o.getClass()) return false;\\n AU au = (AU) o;\\n return Objects.equals(left, au.left) &&\\n Objects.equals(right, au.right);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"590172ff1a9a6fd53ff9f3e878b23102\",\n \"score\": \"0.5336628\",\n \"text\": \"public boolean equalValues() {\\n\\n try {\\n ValueParser vp = new ValueParser(actual);\\n ValueTagParser vtp = new ValueTagParser(expected);\\n // TODO - what if the number of values in the actual and expected are different ?\\n if (vtp.hasNext()) {\\n String actualValue = vp.nextValue();\\n String expectedValue = vtp.next();\\n // System.out.println( actualValue + \\\" =? \\\" + expectedValue );\\n boolean result = ValueComparator.compareTolerance(actualValue,\\n expectedValue);\\n if (!result) {\\n return false;\\n }\\n }\\n return true;\\n } catch (Exception e) {\\n // TODO - Decide how to handle the exception\\n return false;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a41b03297243a744e4b5464df1e10e8\",\n \"score\": \"0.53359115\",\n \"text\": \"public boolean similar(Object other) {\\n/* 1258 */ if (!(other instanceof JSONArray)) {\\n/* 1259 */ return false;\\n/* */ }\\n/* 1261 */ int len = length();\\n/* 1262 */ if (len != ((JSONArray)other).length()) {\\n/* 1263 */ return false;\\n/* */ }\\n/* 1265 */ for (int i = 0; i < len; i++) {\\n/* 1266 */ Object valueThis = this.myArrayList.get(i);\\n/* 1267 */ Object valueOther = ((JSONArray)other).myArrayList.get(i);\\n/* 1268 */ if (valueThis != valueOther) {\\n/* */ \\n/* */ \\n/* 1271 */ if (valueThis == null) {\\n/* 1272 */ return false;\\n/* */ }\\n/* 1274 */ if (valueThis instanceof JSONObject) {\\n/* 1275 */ if (!((JSONObject)valueThis).similar(valueOther)) {\\n/* 1276 */ return false;\\n/* */ }\\n/* 1278 */ } else if (valueThis instanceof JSONArray) {\\n/* 1279 */ if (!((JSONArray)valueThis).similar(valueOther)) {\\n/* 1280 */ return false;\\n/* */ }\\n/* 1282 */ } else if (!valueThis.equals(valueOther)) {\\n/* 1283 */ return false;\\n/* */ } \\n/* */ } \\n/* 1286 */ } return true;\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a210ba025a913836ee1b458127134844\",\n \"score\": \"0.532939\",\n \"text\": \"public static <V extends Comparable<V>, E extends Comparable<E>> boolean isIsomorphic(GraphIsomorphismVertex<V,E> root1, GraphIsomorphismVertex<V,E> root2){\\n\\t\\treturn isIsomorphic(root1, root2, new HashSet<Integer>(), new HashSet<Integer>());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc31c018676311011d591e4c38aa6e24\",\n \"score\": \"0.5322149\",\n \"text\": \"@Test\\n public void equals() {\\n assertTrue(PROJECT_BOOK_WITH_UI.equals(PROJECT_BOOK_WITH_UI));\\n\\n // different types -> returns false\\n assertFalse(PROJECT_BOOK_WITH_UI.equals(\\\"1\\\"));\\n\\n // null -> return false\\n assertFalse(PROJECT_BOOK_WITH_UI.equals(null));\\n\\n //same viewMode, project, predicate, comparator -> return true\\n ProjectBookWithUi sameProjectbookWithUi = new ProjectBookWithUi(new ProjectBook(), ViewMode.TASKS,\\n VALID_PROJECT, Model.PREDICATE_SHOW_ALL_TRACKED_ITEMS, NAME_COMPARE, true, USER_PREFS, true);\\n assertTrue(PROJECT_BOOK_WITH_UI.equals(sameProjectbookWithUi));\\n\\n //same viewMode, both projects null, same predicate, same comparator -> return true\\n ProjectBookWithUi nullProjectBookWithUi =\\n new ProjectBookWithUi(new ProjectBook(), ViewMode.TASKS, null,\\n Model.PREDICATE_SHOW_ALL_TRACKED_ITEMS, NAME_COMPARE, true, USER_PREFS, true);\\n sameProjectbookWithUi = new ProjectBookWithUi(new ProjectBook(), ViewMode.TASKS,\\n null, Model.PREDICATE_SHOW_ALL_TRACKED_ITEMS, NAME_COMPARE, true, USER_PREFS, true);\\n assertTrue(nullProjectBookWithUi.equals(sameProjectbookWithUi));\\n\\n // different viewMode -> return false\\n ProjectBookWithUi differentProjectbookWithUi = new ProjectBookWithUi(new ProjectBook(), ViewMode.PROJECTS,\\n VALID_PROJECT, Model.PREDICATE_SHOW_ALL_TRACKED_ITEMS, NAME_COMPARE, true, USER_PREFS, true);\\n assertFalse(PROJECT_BOOK_WITH_UI.equals(differentProjectbookWithUi));\\n\\n // different project -> returns false\\n Project otherProject = new ProjectBuilder().withName(\\\"OTHER\\\").build();\\n differentProjectbookWithUi = new ProjectBookWithUi(new ProjectBook(), ViewMode.TASKS,\\n otherProject, Model.PREDICATE_SHOW_ALL_TRACKED_ITEMS, NAME_COMPARE, true, USER_PREFS, true);\\n assertFalse(PROJECT_BOOK_WITH_UI.equals(differentProjectbookWithUi));\\n\\n // different tags visibility -> returns false\\n differentProjectbookWithUi = new ProjectBookWithUi(new ProjectBook(), ViewMode.TASKS,\\n VALID_PROJECT, Model.PREDICATE_SHOW_ALL_TRACKED_ITEMS, NAME_COMPARE, false, USER_PREFS, true);\\n assertFalse(PROJECT_BOOK_WITH_UI.equals(differentProjectbookWithUi));\\n\\n // different predicate -> returns false\\n Predicate<TrackedItem> completePredicate =\\n new CompletionStatusPredicate(FindType.ALL, Arrays.asList(CompletionStatusPredicate.INCOMPLETE_KEYWORD));\\n differentProjectbookWithUi = new ProjectBookWithUi(new ProjectBook(), ViewMode.TASKS,\\n otherProject, completePredicate, NAME_COMPARE, true, USER_PREFS, true);\\n assertFalse(PROJECT_BOOK_WITH_UI.equals(differentProjectbookWithUi));\\n\\n // different user prefs -> returns false\\n ReadOnlyUserPrefs otherUserPrefs =\\n new UserPrefs().returnChangedGuiThemeSettings(new GuiThemeSettings(new Theme(Theme.ThemeType.LIGHT)));\\n differentProjectbookWithUi = new ProjectBookWithUi(new ProjectBook(), ViewMode.TASKS,\\n VALID_PROJECT, Model.PREDICATE_SHOW_ALL_TRACKED_ITEMS, NAME_COMPARE, true, otherUserPrefs, true);\\n assertFalse(PROJECT_BOOK_WITH_UI.equals(differentProjectbookWithUi));\\n\\n // different sort by completion status -> returns false\\n differentProjectbookWithUi = new ProjectBookWithUi(new ProjectBook(), ViewMode.TASKS,\\n VALID_PROJECT, Model.PREDICATE_SHOW_ALL_TRACKED_ITEMS, NAME_COMPARE, true, otherUserPrefs, false);\\n assertFalse(PROJECT_BOOK_WITH_UI.equals(differentProjectbookWithUi));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1c3b1b0ef750a048e2761057deb3324\",\n \"score\": \"0.5316336\",\n \"text\": \"@Test\\n\\tpublic void testNestedIdenticalXmls(){\\n\\t\\tString xml1=\\\"<?xml version=\\\\\\\"1.0\\\\\\\"?> <node> <element att1=\\\\\\\"a\\\\\\\" att2=\\\\\\\"b\\\\\\\"/><element>Test</element></node>\\\";\\n\\t\\tString xml2=\\\"<?xml version=\\\\\\\"1.0\\\\\\\"?> <node> <element att1=\\\\\\\"a\\\\\\\" att2=\\\\\\\"b\\\\\\\"/><element>Test</element></node>\\\";\\n\\t\\tassertTrue(xmlComparator.isXmlEqual(xml1, xml2));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b344a13d4d2907faa0b1a073f66dbd4\",\n \"score\": \"0.5311372\",\n \"text\": \"@Test\\n\\tpublic void testEqualsSameData() {\\n\\t\\tLinkedList<Integer> ll_321 = new LinkedList<Integer>();\\n\\t\\tLinkedList<Integer> ll_321_2 = new LinkedList<Integer>();\\n\\t\\t\\n\\t\\tll_321.addToFront(new Node<Integer>(new Integer(1)));\\n\\t\\tll_321.addToFront(new Node<Integer>(new Integer(2)));\\n\\t\\tll_321.addToFront(new Node<Integer>(new Integer(3)));\\n\\t\\t\\n\\t\\tll_321_2.addToFront(new Node<Integer>(new Integer(1)));\\n\\t\\tll_321_2.addToFront(new Node<Integer>(new Integer(2)));\\n\\t\\tll_321_2.addToFront(new Node<Integer>(new Integer(3)));\\n\\t\\t\\n\\t\\tassertTrue(ll_321.equals(ll_321_2));\\n\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"72e6548395a8031f6646ae601227f2d1\",\n \"score\": \"0.53107387\",\n \"text\": \"private static <T> boolean deepEquals(Collection<T> col1, Collection<T> col2) {\\n\\t\\tif (col1.size() != col2.size()) return false;\\n\\t\\tfinal Iterator<T> it1 = col1.iterator();\\n\\t\\tfinal Iterator<T> it2 = col2.iterator();\\n\\t\\twhile(it1.hasNext() && it2.hasNext()) {\\n\\t\\t\\tif (! it1.next().equals(it2.next())) return false;\\n\\t\\t}\\n\\t\\treturn true;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"79e71e43218ff4f532e1ccb1a0474fca\",\n \"score\": \"0.5298799\",\n \"text\": \"public static void main(String[] args) {\\n\\t\\t\\r\\n\\t\\tint[] arr1 = {1,1};\\r\\n\\t\\tint[] arr2 = {1,-1,1};\\r\\n\\r\\n\\t\\tSolution sl = new Solution();\\r\\n\\t\\tTreeNode root1 = new TreeNode(arr1[0]);\\r\\n\\t\\troot1 = insertLevelOrder(arr1, root1, 0);\\r\\n\\r\\n\\t\\tTreeNode root2 = new TreeNode(arr2[0]);\\r\\n\\t\\troot2 = insertLevelOrder(arr2, root2, 0);\\r\\n\\r\\n\\t\\t//inOrder(root1);\\r\\n\\t\\t//System.out.println();\\r\\n\\t\\t\\r\\n\\t\\tSystem.out.println(sl.isSameTree(root1, root2));\\r\\n\\t\\tSystem.out.print(\\\" \\\");\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"967b832df0eb86ca2cac64bc63573748\",\n \"score\": \"0.5296544\",\n \"text\": \"protected boolean compare(Object a, Object b)\\n {\\n if(a == null || b == null)\\n {\\n if(a != null || b != null)\\n return false;\\n } else\\n {\\n if(a.getClass().isArray() && b.getClass().isArray())\\n return Arrays.equals((Object[])a, (Object[])b);\\n if(a instanceof String && b instanceof String)\\n return ((String)a).equalsIgnoreCase((String)b);\\n if(!a.equals(b))\\n return false;\\n }\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"483bfd7380bfe137ec2a0176de8a8330\",\n \"score\": \"0.52706754\",\n \"text\": \"<T> boolean isEqual(final T src1, final T src2);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6758e8e6d13698df0ceadfaab55018e1\",\n \"score\": \"0.52460474\",\n \"text\": \"@Test \\n\\tpublic void testNestedSimilarXmls(){\\n\\t\\tString xml1=\\\"<?xml version=\\\\\\\"1.0\\\\\\\"?>\\\"+\\\"\\\\n\\\"+\\\"<node> <element att1=\\\\\\\"a\\\\\\\" att2=\\\\\\\"b\\\\\\\"/><element>Test</element></node>\\\";\\n\\t\\tString xml2=\\\"<?xml \\\"+\\\"\\\\n\\\"+\\\"version=\\\\\\\"1.0\\\\\\\"?> <node><element att2='b\\\\' att1='a\\\\' /> <element>Test</element></node>\\\";\\n\\t\\tassertTrue(xmlComparator.isXmlEqual(xml1, xml2));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d5bc265502387dfe0045ae44a7a4c60e\",\n \"score\": \"0.5243042\",\n \"text\": \"public boolean leetcode101(TreeNode root) {\\n if (root == null) {\\n return true;\\n }\\n Queue<TreeNode> queue1 = new LinkedList<>();\\n Queue<TreeNode> queue2 = new LinkedList<>();\\n queue1.offer(root.left);\\n queue2.offer(root.right);\\n while (queue1.size() != 0 && queue2.size() != 0) {\\n TreeNode node1 = queue1.poll();\\n TreeNode node2 = queue2.poll();\\n if(node1 == null && node2 == null){\\n continue;\\n } else if (node1 == null || node2 == null || node1.val != node2.val) {\\n return false;\\n }\\n queue1.offer(node1.left);\\n queue1.offer(node1.right);\\n queue2.offer(node2.right);\\n queue2.offer(node2.left);\\n }\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ffa698d1242b36045ba65209154ba48f\",\n \"score\": \"0.52378774\",\n \"text\": \"@Override\\n\\tpublic boolean equals(Object object) {\\n\\t\\tif(object == this) return true;\\n\\t\\tif(!(object instanceof Tree)) return false;\\n\\n\\t\\tTree tree = (Tree)object;\\n\\t\\tboolean b = tree.data.equals(data);\\n\\t\\tif(tree.left != null) b = (b && tree.left.equals(left));\\n\\t\\tif(tree.right != null) b = (b && tree.right.equals(right));\\n\\t\\tif(tree.parent != null) b = (b && tree.parent.equals(parent));\\n\\t\\tb = (b && tree.size() == size);\\n\\t\\treturn b;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c654bf389deddc3aea789dea8162f0f\",\n \"score\": \"0.5237531\",\n \"text\": \"public boolean equals(Stack other) {\\n\\t\\t\\n\\t\\tif(elements() == other.elements()){\\n\\t\\t\\tfor(int i = 0; i < other.elements(); i++){\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(stack[i] != other.stack[i]){\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\t\\n\\t\\t\\treturn false;\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn true;\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6e059562898966134da61f416a545e0\",\n \"score\": \"0.52373934\",\n \"text\": \"@Test\\n\\tpublic void testEqualsOneNodeSameVals() {\\n\\t\\tLinkedList<Integer> ll11 = new LinkedList<Integer>();\\n\\t\\tLinkedList<Integer> ll12 = new LinkedList<Integer>();\\n\\t\\tll11.addToFront(new Node<Integer>(new Integer(1)));\\n\\t\\tll12.addToFront(new Node<Integer>(new Integer(1)));\\n\\t\\tassertEquals(ll11, ll12);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"907512d7aa4b5df34f5b10610a2b9f9e\",\n \"score\": \"0.5230538\",\n \"text\": \"public static boolean equals(Tensor t1, Tensor t2, double delta) {\\n if (t1 == t2)\\n return true;\\n if (t2 == null)\\n return false;\\n if (!Arrays.equals(t1.dims, t2.dims))\\n return false;\\n if (!t1.s.equals(t2.s))\\n return false;\\n if (t1.values.length != t2.values.length)\\n return false;\\n for (int i=0; i<t1.values.length; i++) {\\n if (!t1.s.eq(t1.values[i], t2.values[i], delta))\\n return false;\\n }\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60707d6dc6936c19ba9045508301a754\",\n \"score\": \"0.522957\",\n \"text\": \"public void testCompareTo() {\\n nd1.distance(1.2);\\n nd2.distance(32.89);\\n assertTrue(nd1.compareTo(nd2) < 0);\\n assertTrue(nd2.compareTo(nd1) > 0);\\n nd2.distance(1.2);\\n assertTrue(nd1.compareTo(nd1) == 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b141ac73072238ba93fe3e8fb315c636\",\n \"score\": \"0.5226988\",\n \"text\": \"private static boolean isEqual(Object left, Object right) {\\n if (left instanceof HintonNull && right instanceof HintonNull)\\n return true;\\n if (left instanceof HintonNull)\\n return false;\\n\\n return ((NativeType) left).getRaw().equals(((NativeType) right).getRaw());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1d5bc0550e3e040962078b30b092a7d\",\n \"score\": \"0.5206157\",\n \"text\": \"private Node evalEqFunction(Node root, HashMap<String,ArrayDeque<Node>> alist) {\\n if(root.left==null || root.right==null || root.lexToken!=null) {\\n System.out.println(\\\"EQ error: Expecting a list, but got an atom instead.\\\");\\n System.exit(0);\\n }\\n\\n Node lop = eval(evalCarFunction(root, alist), alist);\\n Node rop = eval(evalCarFunction(evalCdrFunction(root, alist), alist), alist);\\n Node nullop = eval (evalCdrFunction(evalCdrFunction(root, alist), alist) , alist);\\n\\n if(nullop.lexToken==null || !nullop.lexToken.getLiteralValue().equals(\\\"NIL\\\")) {\\n System.out.println(\\\"EQ error: Too many parameters.\\\");\\n System.exit(0);\\n }\\n\\n Node ret = new Node(new LexToken(LexTokenID.ATOM, false));\\n if(lop.lexToken==null || rop.lexToken==null) {\\n System.out.println(\\\"EQ error: atom expected but got a list.\\\");\\n System.exit(0);\\n }\\n if(lop.lexToken.isNumericAtom ^ rop.lexToken.isNumericAtom) {\\n System.out.println(\\\"EQ error: Numeric Atom cannot be compared to Literal Atom\\\");\\n System.exit(0);\\n }\\n if(lop.lexToken.isNumericAtom) {\\n lop = evalInt(lop, alist);\\n rop = evalInt(rop, alist);\\n if (lop.lexToken.getNumericValue() == rop.lexToken.getNumericValue()) {\\n ret.lexToken.setLiteralValue(\\\"T\\\");\\n ret.isList = false;\\n ret.isInnerList = false;\\n } else {\\n ret.lexToken.setLiteralValue(\\\"NIL\\\");\\n ret.isList = true;\\n ret.isInnerList = true;\\n }\\n } else {\\n if (lop.lexToken.getLiteralValue().equals(rop.lexToken.getLiteralValue())) {\\n ret.lexToken.setLiteralValue(\\\"T\\\");\\n ret.isList = false;\\n ret.isInnerList = false;\\n } else {\\n ret.lexToken.setLiteralValue(\\\"NIL\\\");\\n ret.isList = true;\\n ret.isInnerList = true;\\n }\\n\\n }\\n\\n return ret;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f773ad0966d3e24237f2123b7e2133d\",\n \"score\": \"0.52036476\",\n \"text\": \"public boolean compare(ClassName other) {\\n\\t\\tif (!name.equals(other.name)) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\tif (arrayDimension != other.arrayDimension) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\tif (nestedSubParameters == null) {\\n\\t\\t\\tif (other.nestedSubParameters != null) {\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\tif (other.nestedSubParameters == null || nestedSubParameters.size() != other.nestedSubParameters.size()) {\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn true;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0edb273de8db1c4574344b41888b104d\",\n \"score\": \"0.52016896\",\n \"text\": \"public static void main(String[] args) {\\n\\t\\tint[] array1 = {1, 2, 1, 3, 1, 1, 5};\\n\\t\\tint[] array2 = {2, 3, 1};\\n\\t\\t\\n\\t\\tTreeNode t1 = AssortedMethods.createTreeFromArray(array1);\\n\\t\\tTreeNode t2 = AssortedMethods.createTreeFromArray(array2);\\n\\n\\t\\tif (containsTree(t1, t2)) {\\n\\t\\t\\tSystem.out.println(\\\"t2 is a subtree of t1\\\");\\n\\t\\t} else {\\n\\t\\t\\tSystem.out.println(\\\"t2 is not a subtree of t1\\\");\\n\\t\\t}\\n\\n int[] array3 = {1, 2, 3};\\n\\t\\tTreeNode t3 = AssortedMethods.createTreeFromArray(array1);\\n\\t\\tTreeNode t4 = AssortedMethods.createTreeFromArray(array3);\\n\\n\\t\\tif (containsTree(t3, t4)) {\\n\\t\\t\\tSystem.out.println(\\\"t4 is a subtree of t3\\\");\\n\\t\\t} else {\\n\\t\\t\\tSystem.out.println(\\\"t4 is not a subtree of t3\\\");\\n\\t\\t}\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2fed1c24590af0df8023caf5dbd3eb16\",\n \"score\": \"0.5195195\",\n \"text\": \"@Test\\n\\tpublic void testNestedDifferentXmls() {\\n\\t\\tString xml1=\\\"<?xml version=\\\\\\\"1.0\\\\\\\"?> <node> <element att1=\\\\\\\"a\\\\\\\" att2=\\\\\\\"b\\\\\\\"/><element>Test</element></node>\\\";\\n\\t\\tString xml2=\\\"<?xml version=\\\\\\\"1.0\\\\\\\"?> <node> <element>Test</element> <element att1=\\\\\\\"a\\\\\\\" att2=\\\\\\\"b\\\\\\\"/></node>\\\";\\n\\t\\tassertFalse(xmlComparator.isXmlEqual(xml1, xml2));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"06fdcfffdb7f718c25a672f90af586c4\",\n \"score\": \"0.5193629\",\n \"text\": \"private static int comparetreeterms(Pattern a, Pattern b) {\\n\\tName ta = a.op(), tb = b.op();\\n\\n\\tif (ta.term() != tb.term()) return 0; /* different kind */\\n\\tif (!ta.term()) return 1; /* both are non-terminals */\\n\\tif (((Term)ta).esn() != ((Term)tb).esn()) return 0; /* different terminals */\\n\\tif (a.left() != null && b.left() != null)\\n\\t if (comparetreeterms(a.left(), b.left()) == 0) return 0;\\n\\tif (a.right() != null && b.right() != null)\\n\\t if (comparetreeterms(a.right(), b.right()) == 0) return 0;\\n\\treturn 1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"94540959aa57ac300b31ef29a73f8737\",\n \"score\": \"0.51866674\",\n \"text\": \"static boolean isEqual(Library o1, Library o2) {\\n if (!o1.getPages().equals(o2.getPages())) return false;\\n if (!o1.getYear().equals(o2.getYear())) return false;\\n if (!o1.getQuantity().equals(o2.getQuantity())) return false;\\n if (!o1.getBook().equals(o2.getBook())) return false;\\n return o1.getPublisher().equals(o2.getPublisher());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8643526e0d0a08d0ee34ff5d94251113\",\n \"score\": \"0.5181962\",\n \"text\": \"public boolean inLaws(T gp1, T gp2){\\n if (result.length == 0){\\n throw new EmptyCollectionException (\\\"The tree is empty.\\\");\\n }\\n \\n if(appears (gp1) == false || appears (gp2) == false){\\n return false;\\n }\\n \\n return \\n (getOffspring(getOffspring(gp1)) == getOffspring(getOffspring(gp2)));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a8f6810f26eac2b1a2b076d42d2c63d\",\n \"score\": \"0.51800436\",\n \"text\": \"private boolean similarAS(AgentState[] as1, AgentState[] as2){\\n\\t\\tboolean result = true;\\n\\t\\tfor(short i = 0; i<asSize; i++){\\n\\t\\t\\tresult = result && as1[i].getStateValue().sameSV(as2[i].getStateValue());\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07bd983fe5bb16d8b54ade68df46e8d0\",\n \"score\": \"0.5178466\",\n \"text\": \"@Test\\n public void testAVL2Unchanged() throws InvalidBalanceException, EmptyTreeException {\\n tree = new AVLGTree<>(2);\\n tree.insert(20);\\n tree.insert(10);\\n tree.insert(5); // Should *NOT* trigger a right rotation about the root or any rotation for that matter!\\n assertEquals(\\\"In an AVL-2 tree with three descending order integers inserted, \\\" +\\n \\\"the new root was not the expected one.\\\", Integer.valueOf(20), tree.getRoot()); // Root should be unchanged\\n assertEquals(\\\"In an AVL-2 tree with three descending order integers inserted, \\\" +\\n \\\"the new height was not the expected one.\\\", 2, tree.getHeight()); // Height of 2 expected\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03c159f08b9aaa885a6055ee1e03fa74\",\n \"score\": \"0.51712537\",\n \"text\": \"public static void main(String[] args) {\\r\\n SameTree obj = new SameTree();\\r\\n TreeNode t1 = new TreeNode(5);\\r\\n TreeNode t2 = new TreeNode(5);\\r\\n t1.right = new TreeNode(7);\\r\\n t2.right = new TreeNode(7);\\r\\n t1.left = new TreeNode(4);\\r\\n t2.left = new TreeNode(4);\\r\\n System.out.println(obj.isSameTree(t1,t2));\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5172f4a4a29c8f4728f38e77f0b2f3e0\",\n \"score\": \"0.51654583\",\n \"text\": \"public interface AVLInterface<T extends Comparable<? super T>> {\\n /**\\n * Add the data as a leaf in the AVL. Should traverse the tree to find the\\n * appropriate location. If the data being added already exists in the tree,\\n * do nothing.\\n *\\n * @throws java.lang.IllegalArgumentException if the data is null\\n * @param data the data to be added\\n */\\n void add(T data);\\n\\n /**\\n * Removes the data from the tree. There are 3 cases to consider:\\n * 1: the data is a leaf. In this case, simply remove it.\\n * 2: the data has one child. In this case, simply replace the node with\\n * the child node.\\n * 3: the data has 2 children. There are generally two approaches:\\n * replacing the data with either the largest element in the left subtree\\n * (commonly called the predecessor), or replacing it with the smallest\\n * element in the right subtree (commonly called the successor). For this\\n * assignment, use the predecessor.\\n *\\n * This method must run in O(2 log n) or better.\\n *\\n * @throws java.lang.IllegalArgumentException if the data is null\\n * @throws java.util.NoSuchElementException if the data is not in the AVL\\n * @param data data to remove from the tree\\n * @return the data removed from the tree. Do not return the same data\\n * that was passed in. Return the data that was stored in the tree.\\n */\\n T remove(T data);\\n\\n /**\\n * Returns the data in the tree matching the parameter passed in.\\n * (Think carefully: should you use .equals or == ?)\\n *\\n * @throws java.lang.IllegalArgumentException if the data is null\\n * @throws java.util.NoSuchElementException if the data is not in the AVL\\n * @param data data to get in the AVL tree\\n * @return the data in the tree equal to the parameter. Do not return the\\n * same data that was passed in. Return the data that was stored in the\\n * tree.\\n */\\n T get(T data);\\n\\n /**\\n * Returns whether or not the parameter is contained within the tree.\\n *\\n * @throws java.lang.IllegalArgumentException if the data is null\\n * @param data data to find in the AVL tree\\n * @return whether or not the parameter is contained within the tree\\n */\\n boolean contains(T data);\\n\\n /**\\n * Get the number of elements in the tree.\\n *\\n * @return the number of elements in the tree\\n */\\n int size();\\n\\n /**\\n * Get the preorder traversal of the tree.\\n *\\n * @return a preorder traversal of the tree, or an empty list\\n */\\n List<T> preorder();\\n\\n /**\\n * Get the postorder traversal of the tree.\\n *\\n * @return a postorder traversal of the tree, or an empty list\\n */\\n List<T> postorder();\\n\\n /**\\n * Get the inorder traversal of the tree.\\n *\\n * @return an inorder traversal of the tree, or an empty list\\n */\\n List<T> inorder();\\n\\n /**\\n * Get the level order traversal of the tree.\\n *\\n * @return a level order traversal of the tree, or an empty list\\n */\\n List<T> levelorder();\\n\\n /**\\n * Clear the tree.\\n */\\n void clear();\\n\\n /**\\n * Calculate and return the height of the root of the tree. A node's\\n * height is defined as max(left.height, right.height) + 1. A leaf node has\\n * a height of 0.\\n *\\n * @return the height of the root of the tree, -1 if the tree is empty\\n */\\n int height();\\n\\n /**\\n * Calculate the depth of the node containing the data.\\n * The depth of the node is defined as (parent node's depth)+1. The depth of\\n * the root node is 1.\\n *\\n * @throws java.lang.IllegalArgumentException if data is null\\n * @throws java.util.NoSuchElementException if the data is not in the tree.\\n * @param data data to calculate the depth of\\n * @return the depth of the node containing the data if it is in the tree\\n */\\n int depth(T data);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d1c74686406b652cb2944178122a7b8\",\n \"score\": \"0.51653695\",\n \"text\": \"public boolean equals(DoublyLinkedList<E> other) {\\n if(this.size!=other.size){\\n return false;\\n }\\n ListNode<E> current1=front;\\n ListNode<E> current2=other.front;\\n while(this.front!=null){\\n if(current1.data!=current2.data)\\n {\\n return false;\\n }\\n this.front=front.next;\\n other.front=other.front.next;\\n }\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11b056e9386f8206b17b93e3fd9b0ca3\",\n \"score\": \"0.5165274\",\n \"text\": \"public boolean match(Object other) {\\n Exception ex1;\\n boolean z;\\n NetObject netObject;\\n Object obj = this;\\n if (other == null) {\\n return true;\\n }\\n boolean z2 = false;\\n if (!getClass().equals(other.getClass())) {\\n return false;\\n }\\n GenericObject that = (GenericObject) other;\\n Class<?> hisclass = other.getClass();\\n Class<?> myclass = getClass();\\n Class<?> hisclass2 = hisclass;\\n while (true) {\\n Field[] fields = myclass.getDeclaredFields();\\n Field[] hisfields = hisclass2.getDeclaredFields();\\n int i = z2;\\n while (true) {\\n int i2 = i;\\n if (i2 >= fields.length) {\\n break;\\n }\\n Field f = fields[i2];\\n Field g = hisfields[i2];\\n if ((f.getModifiers() & 2) != 2) {\\n Class<?> fieldType = f.getType();\\n String fieldName = f.getName();\\n if (!(fieldName.compareTo(\\\"stringRepresentation\\\") == 0 || fieldName.compareTo(\\\"indentation\\\") == 0)) {\\n try {\\n if (fieldType.isPrimitive()) {\\n String fname = fieldType.toString();\\n if (fname.compareTo(\\\"int\\\") == 0) {\\n try {\\n if (f.getInt(obj) != g.getInt(that)) {\\n return false;\\n }\\n } catch (IllegalAccessException e) {\\n ex1 = e;\\n z = false;\\n InternalErrorHandler.handleException(ex1);\\n i = i2 + 1;\\n z2 = z;\\n netObject = this;\\n }\\n } else if (fname.compareTo(\\\"short\\\") == 0) {\\n if (f.getShort(obj) != g.getShort(that)) {\\n return false;\\n }\\n } else if (fname.compareTo(\\\"char\\\") == 0) {\\n if (f.getChar(obj) != g.getChar(that)) {\\n return false;\\n }\\n } else if (fname.compareTo(\\\"long\\\") == 0) {\\n if (f.getLong(obj) != g.getLong(that)) {\\n return false;\\n }\\n } else if (fname.compareTo(\\\"boolean\\\") == 0) {\\n if (f.getBoolean(obj) != g.getBoolean(that)) {\\n return false;\\n }\\n } else if (fname.compareTo(\\\"double\\\") == 0) {\\n if (f.getDouble(obj) != g.getDouble(that)) {\\n return false;\\n }\\n } else if (fname.compareTo(\\\"float\\\") == 0 && f.getFloat(obj) != g.getFloat(that)) {\\n return false;\\n }\\n }\\n Object myObj = f.get(obj);\\n Object hisObj = g.get(that);\\n if (hisObj != null && myObj == null) {\\n return false;\\n }\\n if (hisObj != null || myObj == null) {\\n if (hisObj != null || myObj != null) {\\n if ((hisObj instanceof String) && (myObj instanceof String)) {\\n if (!((String) hisObj).equals(\\\"\\\")) {\\n if (((String) myObj).compareToIgnoreCase((String) hisObj) != 0) {\\n return false;\\n }\\n }\\n } else if (GenericObject.isMySubclass(myObj.getClass()) && GenericObject.isMySubclass(hisObj.getClass()) && myObj.getClass().equals(hisObj.getClass()) && ((GenericObject) hisObj).getMatcher() != null) {\\n if (!((GenericObject) hisObj).getMatcher().match(((GenericObject) myObj).encode())) {\\n return false;\\n }\\n } else if (GenericObject.isMySubclass(myObj.getClass()) && !((GenericObject) myObj).match(hisObj)) {\\n return false;\\n } else {\\n if (GenericObjectList.isMySubclass(myObj.getClass()) && !((GenericObjectList) myObj).match(hisObj)) {\\n return false;\\n }\\n }\\n }\\n }\\n z = false;\\n i = i2 + 1;\\n z2 = z;\\n netObject = this;\\n z = false;\\n } catch (IllegalAccessException e2) {\\n ex1 = e2;\\n z = z2;\\n InternalErrorHandler.handleException(ex1);\\n i = i2 + 1;\\n z2 = z;\\n netObject = this;\\n }\\n i = i2 + 1;\\n z2 = z;\\n netObject = this;\\n }\\n }\\n z = z2;\\n i = i2 + 1;\\n z2 = z;\\n netObject = this;\\n }\\n myclass = myclass.getSuperclass();\\n hisclass2 = hisclass2.getSuperclass();\\n z2 = z;\\n netObject = this;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75b4d8df924ace48d4353576ad987158\",\n \"score\": \"0.5160566\",\n \"text\": \"public void assertStructureSame(Database other)\\r\\n\\t{\\r\\n\\t\\tif(this.tables.size()!=other.tables.size())\\r\\n\\t\\t{\\r\\n\\t\\t\\tthrow new DatabaseMismatchException(\\\"Different number of tables: \\\" + this.tables.size() + \\\"<>\\\" + other.tables.size());\\r\\n\\t\\t}\\r\\n\\t\\tIterator<Table> itThis = tables.iterator();\\r\\n\\t\\tIterator<Table> itOther = other.tables.iterator();\\r\\n\\t\\twhile(itThis.hasNext())\\r\\n\\t\\t{\\r\\n\\t\\t\\tTable thisTable = itThis.next();\\r\\n\\t\\t\\tTable otherTable = itOther.next();\\r\\n\\t\\t\\tif(!thisTable.name.equals(otherTable.name))\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tthrow new DatabaseMismatchException(\\\"Different table names: \\\" + thisTable.name + \\\"<>\\\" + otherTable.name);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tthisTable.assertStructureSame(otherTable);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f67dcede1c7dbbafde24fafab762e2c\",\n \"score\": \"0.5157504\",\n \"text\": \"protected boolean isStructurallyEquivalent(Vertex v1, Vertex v2) {\\n\\t\\t\\n\\t\\tcount ++;\\n\\t\\t\\n\\t\\tif( v1.degree() != v2.degree()) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\n\\t\\tSet n1 = new HashSet(v1.getPredecessors());\\n\\t\\tn1.remove(v2);\\n\\t\\tn1.remove(v1);\\n\\t\\tSet n2 = new HashSet(v2.getPredecessors());\\n\\t\\tn2.remove(v1);\\n\\t\\tn2.remove(v2);\\n\\n\\t\\tSet o1 = new HashSet(v1.getSuccessors());\\n\\t\\tSet o2 = new HashSet(v2.getSuccessors());\\n\\t\\to1.remove(v1);\\n\\t\\to1.remove(v2);\\n\\t\\to2.remove(v1);\\n\\t\\to2.remove(v2);\\n\\n\\t\\t// this neglects self-loops and directed edges from 1 to other\\n\\t\\tboolean b = (n1.equals(n2) && o1.equals(o2));\\n\\t\\tif (!b)\\n\\t\\t\\treturn b;\\n\\t\\t\\n\\t\\t// if there's a directed edge v1->v2 then there's a directed edge v2->v1\\n\\t\\tb &= ( v1.isSuccessorOf(v2) == v1.isSuccessorOf(v2));\\n\\t\\t\\n\\t\\t// self-loop check\\n\\t\\tb &= ( v1.isSuccessorOf(v1) == v2.isSuccessorOf(v2));\\n\\n\\t\\treturn b;\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6fd9dbaa63b2d70bde8ef51d04d8981c\",\n \"score\": \"0.5153127\",\n \"text\": \"@Test\\n public void testAVLChanged() throws InvalidBalanceException, EmptyTreeException {\\n tree = new AVLGTree<>(2);\\n tree.insert(20);\\n tree.insert(10);\\n tree.insert(5);\\n tree.insert(1); // Should trigger a right rotation about the root.\\n assertEquals(\\\"In an AVL-2 tree with four descending order integers inserted, \\\" +\\n \\\"the new root was not the expected one.\\\", Integer.valueOf(10), tree.getRoot()); // Root should change to 10\\n assertEquals(\\\"In an AVL-2 tree with four descending order integers inserted, \\\" +\\n \\\"the new height was not the expected one.\\\", 2, tree.getHeight()); // Height of 2 expected\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67bfd4ba74d5920d871bc5b21849fd03\",\n \"score\": \"0.51521754\",\n \"text\": \"@Test\\r\\n public void testIsEqual() throws Exception {\\r\\n Serializer serializer = new Persister();\\r\\n \\r\\n Taxonomy tax1 = serializer.read(Taxonomy.class, readTaxFile());\\r\\n Taxonomy tax2 = serializer.read(Taxonomy.class, readTaxFile());\\r\\n assertTrue(taxEquals(tax1, tax2));\\r\\n \\r\\n tax2.getDialogModes().add(0, \\\"NOPE\\\");\\r\\n assertFalse(taxEquals(tax1, tax2));\\r\\n tax2.getDialogModes().remove(0);\\r\\n assertTrue(taxEquals(tax1, tax2));\\r\\n \\r\\n tax2.getDialogActs().get(0).getSubtypes().add(0, \\\"ROCK!\\\");\\r\\n assertFalse(taxEquals(tax1, tax2));\\r\\n tax2.getDialogActs().get(0).getSubtypes().remove(0);\\r\\n assertTrue(taxEquals(tax1, tax2));\\r\\n tax2.getDialogActs().remove(0);\\r\\n assertFalse(taxEquals(tax1, tax2));\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"13a123a6c211cacc8f08df5f97494d5c\",\n \"score\": \"0.51471657\",\n \"text\": \"private boolean compareUnorderedCollection(Collection collectionA, Collection collectionB, RecursiveObject recursiveObject) {\\n Map<Integer, Collection> map = collection2Map(collectionB);\\n\\n for (Object item : collectionA) {\\n Collection other = map.get(ReflectionUtils.deepHashCode(item));\\n // fail fast: item not even found in other Collection, no need to continue.\\n if (other == null || other.isEmpty()) {\\n return false;\\n }\\n\\n // no hash collision, items must be equivalent or isDeepEquals is false\\n if (other.size() == 1) {\\n recursiveObject.push(new DualObject(item, other.iterator().next()));\\n } else {\\n // hash collision: try all collided items against the current item (if 1 equals, we are good - remove it\\n // from collision list, making further comparisons faster)\\n if (!isContained(item, other)) {\\n return false;\\n }\\n }\\n }\\n\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3603c69c4be1a395ef0416abe852dc45\",\n \"score\": \"0.51435745\",\n \"text\": \"public boolean equals(SinglyLinkedList otherList) {\\r\\n\\t\\t/* if two sizes are different, return false */\\r\\n\\t\\tif (otherList.size() != numElements) {\\r\\n\\t\\t\\treturn false;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tSingleNode cursor1 = this.head;\\r\\n\\t\\tSingleNode cursor2 = otherList.head;\\r\\n\\r\\n\\t\\t/* Traverse two lists */\\r\\n\\t\\twhile (cursor1 != null && cursor2 != null) {\\r\\n\\t\\t\\tif (!cursor1.data.equals(cursor2.data)) {\\r\\n\\t\\t\\t\\treturn false;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tcursor1 = cursor1.next;\\r\\n\\t\\t\\tcursor2 = cursor2.next;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\treturn true;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"33e79a2f87c8094367282e1a07444554\",\n \"score\": \"0.5138416\",\n \"text\": \"public boolean isSameTree(TreeNode p, TreeNode q) {\\n if(p==null && q == null){\\n return true;\\n }\\n //then here is XOR\\n if(p==null || q ==null){\\n return false;\\n }\\n \\n return helper(p,q);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40a8f3d6185b7b1fdaf6ab6ff82d0047\",\n \"score\": \"0.51349664\",\n \"text\": \"public boolean isDeepEquals(Object a, Object b) {\\n return doDeepCompare(a, b);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a88700192c4d3bed20daebdb43960d97\",\n \"score\": \"0.51324683\",\n \"text\": \"@Test\\n\\tpublic void testNotEqualsDiffData() {\\n\\t\\tLinkedList<Integer> ll_3elems = new LinkedList<Integer>();\\n\\t\\tLinkedList<Integer> ll_321 = new LinkedList<Integer>();\\n\\t\\tll_3elems.addToFront(new Node<Integer>(new Integer(3)));\\n\\t\\tll_3elems.addToFront(new Node<Integer>(new Integer(2)));\\n\\t\\tll_3elems.addToFront(new Node<Integer>(new Integer(1)));\\n\\t\\t\\n\\t\\tll_321.addToFront(new Node<Integer>(new Integer(1)));\\n\\t\\tll_321.addToFront(new Node<Integer>(new Integer(2)));\\n\\t\\tll_321.addToFront(new Node<Integer>(new Integer(3)));\\n\\t\\tassertFalse(ll_321.equals(ll_3elems));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"559f832bf860d00716735eaa14f913d8\",\n \"score\": \"0.5125449\",\n \"text\": \"public boolean deepEquals(Expression expr) {\\n/* 217 */ if (!isSameClass(expr)) {\\n/* 218 */ return false;\\n/* */ }\\n/* 220 */ NodeTest nt = (NodeTest)expr;\\n/* */ \\n/* 222 */ if (null != nt.m_name) {\\n/* */ \\n/* 224 */ if (null == this.m_name)\\n/* 225 */ return false; \\n/* 226 */ if (!nt.m_name.equals(this.m_name)) {\\n/* 227 */ return false;\\n/* */ }\\n/* 229 */ } else if (null != this.m_name) {\\n/* 230 */ return false;\\n/* */ } \\n/* 232 */ if (null != nt.m_namespace) {\\n/* */ \\n/* 234 */ if (null == this.m_namespace)\\n/* 235 */ return false; \\n/* 236 */ if (!nt.m_namespace.equals(this.m_namespace)) {\\n/* 237 */ return false;\\n/* */ }\\n/* 239 */ } else if (null != this.m_namespace) {\\n/* 240 */ return false;\\n/* */ } \\n/* 242 */ if (this.m_whatToShow != nt.m_whatToShow) {\\n/* 243 */ return false;\\n/* */ }\\n/* 245 */ if (this.m_isTotallyWild != nt.m_isTotallyWild) {\\n/* 246 */ return false;\\n/* */ }\\n/* 248 */ return true;\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db0e7e100dc0af3431536bc6ef190937\",\n \"score\": \"0.5114137\",\n \"text\": \"private boolean areEqual(Object actual, Object other) {\\n return comparisonStrategy.areEqual(actual, other);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb4eec317e7d5d17ae8852cd14a038a2\",\n \"score\": \"0.51117975\",\n \"text\": \"public boolean isEqualNode(Node arg) {\\n/* 865 */ if (!super.isEqualNode(arg)) {\\n/* 866 */ return false;\\n/* */ }\\n/* */ \\n/* */ \\n/* */ \\n/* 871 */ Node child1 = getFirstChild();\\n/* 872 */ Node child2 = arg.getFirstChild();\\n/* 873 */ while (child1 != null && child2 != null) {\\n/* 874 */ if (!((NodeImpl)child1).isEqualNode(child2)) {\\n/* 875 */ return false;\\n/* */ }\\n/* 877 */ child1 = child1.getNextSibling();\\n/* 878 */ child2 = child2.getNextSibling();\\n/* */ } \\n/* 880 */ if (child1 != child2) {\\n/* 881 */ return false;\\n/* */ }\\n/* 883 */ return true;\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1cee3e7773349d4cd3542de1713009d0\",\n \"score\": \"0.5108015\",\n \"text\": \"private double equal() {\\n double score = Integer.MAX_VALUE-K;\\n if (superClass == Number.class) {\\n score = Math.abs((double)left - (double)right);\\n }\\n if (superClass == CharSequence.class) {\\n score = stringEqualsDistance((String) left, (String)right);\\n }\\n if (superClass == Boolean.class) {\\n score = left == right ? 0 : 1;\\n }\\n return (score == 0) ? 0 : score;// + K;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a07b04a7285b929d89de0a4b7ce5637\",\n \"score\": \"0.51075804\",\n \"text\": \"boolean equals(List L){\\n\\n\\t\\tif(L.length != this.length){ //checks the lengths of each List\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(L.length > 0){ //checks each element of the list and compares\\n\\t\\t\\tthis.moveFront(); //to the other list\\n\\t\\t\\tL.moveFront();\\n\\t\\t\\tint k = 1;\\n\\t\\t\\twhile(k <= L.length){ //comparisons\\n\\t\\t\\t\\tint thisIndex = this.get();\\n\\t\\t\\t\\tint LIndex = L.get();\\n\\t\\t\\t\\tif(thisIndex != LIndex){\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tL.moveNext(); //incrementing both lists\\n\\t\\t\\t\\tthis.moveNext();\\n\\t\\t\\t\\tk++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn true; //if the program makes it through all the above code the lists are equal\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48d0c48ba56d13d09c29ce1b46d0cf90\",\n \"score\": \"0.5095804\",\n \"text\": \"public ArrayList<RavensAttribute> compare() {\\n\\t\\tfor(int j = 0; j < obj1.getAttributes().size(); j++) {\\n\\t\\t\\tRavensAttribute attr1 = obj1.getAttributes().get(j);\\n\\t\\t\\tString attr1Name = attr1.getName();\\n\\t\\t\\tString attr1Value = attr1.getValue();\\n\\t\\t\\tif(!attrMap2.containsKey(attr1Name) || !attrMap3.containsKey(attr1Name)) {\\t//Scenario where Object1 attrMap doesn't contain the category of attr1\\n\\t\\t\\t\\tif(!diffList.contains(attr1)) {\\n\\t\\t\\t\\t\\tdiffList.add(attr1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\t//Scenario where Object1 Map does contain it, but they have differing values\\n\\t\\t\\t\\tString attr2Value = attrMap2.get(attr1Name);\\n\\t\\t\\t\\tString attr3Value = attrMap3.get(attr1Name);\\n\\t\\t\\t\\tif(!attr2Value.equals(attr1Value) || !attr3Value.equals(attr1Value)) {\\n\\t\\t\\t\\t\\tif(!diffList.contains(attr1)) {\\n\\t\\t\\t\\t\\t\\tdiffList.add(attr1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor(int i = 0; i < obj2.getAttributes().size(); i++) {\\n\\t\\t\\tRavensAttribute attr2 = obj2.getAttributes().get(i);\\n\\t\\t\\tString attr2Name = obj2.getAttributes().get(i).getName();\\n\\t\\t\\tString attr2Value = obj2.getAttributes().get(i).getValue();\\n\\t\\t\\tif(!attrMap1.containsKey(attr2Name) || !attrMap3.containsKey(attr2Name)) {\\t//Scenario where Object1 attrMap doesn't contain the category of attr2\\n\\t\\t\\t\\tif(!diffList.contains(attr2)) {\\n\\t\\t\\t\\t\\tdiffList.add(attr2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\t//Scenario where Object1 Map does contain it, but they have differing values\\n\\t\\t\\t\\tString attr1Value = attrMap1.get(attr2Name);\\n\\t\\t\\t\\tString attr3Value = attrMap3.get(attr2Name);\\n\\t\\t\\t\\tif(!attr1Value.equals(attr2Value) || !attr3Value.equals(attr2Value)) {\\n\\t\\t\\t\\t\\tif(!diffList.contains(attr2)) {\\n\\t\\t\\t\\t\\t\\tdiffList.add(attr2);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor(int i = 0; i < obj3.getAttributes().size(); i++) {\\n\\t\\t\\tRavensAttribute attr3 = obj3.getAttributes().get(i);\\n\\t\\t\\tString attr3Name = obj3.getAttributes().get(i).getName();\\n\\t\\t\\tString attr3Value = obj3.getAttributes().get(i).getValue();\\n\\t\\t\\tif(!attrMap1.containsKey(attr3Name) || !attrMap2.containsKey(attr3Name)) {\\t//Scenario where Object1 attrMap doesn't contain the category of attr2\\n\\t\\t\\t\\tif(!diffList.contains(attr3)) {\\n\\t\\t\\t\\t\\tdiffList.add(attr3);\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\t//Scenario where Object1 Map does contain it, but they have differing values\\n\\t\\t\\t\\tString attr1Value = attrMap1.get(attr3Name);\\n\\t\\t\\t\\tString attr2Value = attrMap2.get(attr3Name);\\n\\t\\t\\t\\tif(!attr1Value.equals(attr3Value) || !attr2Value.equals(attr3Value)) {\\n\\t\\t\\t\\t\\tif(!diffList.contains(attr3)) {\\n\\t\\t\\t\\t\\t\\tdiffList.add(attr3);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(diffList.contains(\\\"angle\\\")) {\\n\\t\\t\\thasAngle = true;\\n\\t\\t}\\n\\t\\treturn diffList;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24c29bf07d11b0283c35b0c02b0c1b14\",\n \"score\": \"0.50942975\",\n \"text\": \"public boolean equals (ArrayList otherList)\\n {\\n if(this.size == otherList.size && this.toString().equals(otherList.toString()))\\n /* Each element in each class will have its own toString method that represents\\n * that class so if I were to compare the strings it should return true if they're\\n * the same\\n */\\n {\\n return true;\\n }\\n else //If neither size nor information matches, method returns false:\\n {\\n return false;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3254b1bb2ab7ff2f26b9f6b4eef18eb9\",\n \"score\": \"0.5083777\",\n \"text\": \"@Override\\n public int compare(GraphObject a, GraphObject b) {\\n return Utility.compareGraphObjects(a, b, sortFields, collator);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2435429299a85f65ce3cd38986fc9932\",\n \"score\": \"0.5080112\",\n \"text\": \"public boolean equals(Tensor other, double delta) {\\n return equals(this, other, delta);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e4bb81da7f0aa319d069967e236c742\",\n \"score\": \"0.5078282\",\n \"text\": \"public boolean isEqual(Type t1, Type t2) { return t1.equals(t2) || (isSubtype(t1, t2) && isSubtype(t2, t1)); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"750b82e5038431a8a1de364dea0b4641\",\n \"score\": \"0.50688064\",\n \"text\": \"public boolean equals(Object that) {\\n Object obj = that;\\n if (!getClass().equals(that.getClass())) {\\n return false;\\n }\\n Class<?> myclass = getClass();\\n Class<?> hisclass = that.getClass();\\n Class<?> myclass2 = myclass;\\n while (true) {\\n Field[] fields = myclass2.getDeclaredFields();\\n Field[] hisfields = hisclass.getDeclaredFields();\\n int i = 0;\\n while (true) {\\n int i2 = i;\\n if (i2 >= fields.length) {\\n break;\\n }\\n Field f = fields[i2];\\n Field g = hisfields[i2];\\n if ((f.getModifiers() & 2) != 2) {\\n Class<?> fieldType = f.getType();\\n String fieldName = f.getName();\\n if (!(fieldName.compareTo(\\\"stringRepresentation\\\") == 0 || fieldName.compareTo(\\\"indentation\\\") == 0)) {\\n try {\\n if (fieldType.isPrimitive()) {\\n String fname = fieldType.toString();\\n if (fname.compareTo(\\\"int\\\") == 0) {\\n if (f.getInt(this) != g.getInt(obj)) {\\n return false;\\n }\\n } else if (fname.compareTo(\\\"short\\\") == 0) {\\n if (f.getShort(this) != g.getShort(obj)) {\\n return false;\\n }\\n } else if (fname.compareTo(\\\"char\\\") == 0) {\\n if (f.getChar(this) != g.getChar(obj)) {\\n return false;\\n }\\n } else if (fname.compareTo(\\\"long\\\") == 0) {\\n if (f.getLong(this) != g.getLong(obj)) {\\n return false;\\n }\\n } else if (fname.compareTo(\\\"boolean\\\") == 0) {\\n if (f.getBoolean(this) != g.getBoolean(obj)) {\\n return false;\\n }\\n } else if (fname.compareTo(\\\"double\\\") == 0) {\\n if (f.getDouble(this) != g.getDouble(obj)) {\\n return false;\\n }\\n } else if (fname.compareTo(\\\"float\\\") == 0 && f.getFloat(this) != g.getFloat(obj)) {\\n return false;\\n }\\n } else if (g.get(obj) != f.get(this)) {\\n if (f.get(this) == null && g.get(obj) != null) {\\n return false;\\n }\\n if ((g.get(obj) == null && f.get(obj) != null) || !f.get(this).equals(g.get(obj))) {\\n return false;\\n }\\n }\\n } catch (IllegalAccessException ex1) {\\n InternalErrorHandler.handleException(ex1);\\n }\\n }\\n }\\n i = i2 + 1;\\n }\\n myclass2 = myclass2.getSuperclass();\\n hisclass = hisclass.getSuperclass();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d574fd55afb6d1370095007dcf4fc1bc\",\n \"score\": \"0.5067343\",\n \"text\": \"private boolean isMirrorImage(BTNode<E> firstTreeRoot,\\n\\t\\t\\tBTNode<E> secondTreeRoot) {\\n\\t\\tif (firstTreeRoot == null && secondTreeRoot == null) {\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\n\\t\\tif (firstTreeRoot == null || secondTreeRoot == null) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\n\\t\\treturn secondTreeRoot.getData().toString()\\n\\t\\t\\t\\t.equals(firstTreeRoot.getData().toString())\\n\\t\\t\\t\\t&& isMirrorImage(firstTreeRoot.getLeft(),\\n\\t\\t\\t\\t\\t\\tsecondTreeRoot.getRight())\\n\\t\\t\\t\\t&& isMirrorImage(firstTreeRoot.getRight(),\\n\\t\\t\\t\\t\\t\\tsecondTreeRoot.getLeft());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8f05c428fd41406fd70bceb95cd89e7a\",\n \"score\": \"0.5067016\",\n \"text\": \"public boolean equals(Object other){\\n\\n if(other == null) {\\n return false;\\n }\\n if(this.getClass() != other.getClass()) {\\n return false;\\n }\\n\\n Solution otherSolution = (Solution) other;\\n\\n if(width != otherSolution.width ||\\n height != otherSolution.height ||\\n currentIndex != otherSolution.currentIndex) {\\n return false;\\n }\\n\\n for(int i = 0; i < height ; i++){\\n for(int j = 0; j < width; j++) {\\n if(board[i][j] != otherSolution.board[i][j]){\\n return false;\\n }\\n }\\n }\\n\\n return true;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82760745d01c85624d1a09e665f2dbf0\",\n \"score\": \"0.5059235\",\n \"text\": \"@SuppressWarnings(\\\"unchecked\\\")\\n\\t@Override\\n\\tpublic boolean equals(Object o) {\\n\\t\\tboolean otherContainsAllThis = true;\\n\\t\\tTreeSet<E> testSet = new TreeSet<>();\\n\\n\\t\\t// check that they're the same class\\n\\t\\tif (o.getClass().isInstance(testSet)) {\\n\\n\\t\\t\\tTreeSet<E> secondSet = (TreeSet<E>) o;\\n\\t\\t\\tIterator<E> itr = iterator();\\n\\t\\t\\tIterator<E> itr2 = secondSet.iterator();\\n\\n\\t\\t\\t// check that they're the same size\\n\\t\\t\\tif (this.size() == secondSet.size()) {\\n\\n\\t\\t\\t\\t// check that they contain all the same elements\\n\\t\\t\\t\\twhile (itr.hasNext()) {\\n\\t\\t\\t\\t\\tif (!secondSet.contains(itr.next())) {\\n\\t\\t\\t\\t\\t\\totherContainsAllThis = false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn false; // not the same size\\n\\t\\t\\t}\\n\\t\\t\\treturn otherContainsAllThis; // return all elements are the same\\n\\n\\t\\t} else {\\n\\t\\t\\treturn false; // unequal types\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983789,"cells":{"query_id":{"kind":"string","value":"60ef5205a3b572ca6a9287d2bfe40fd9"},"query":{"kind":"string","value":"Test case number: 133 /Coverage entropy=1.5498260458782016"},"positive_passages":{"kind":"list like","value":[{"docid":"8cf0fa1db1dd9bf855415c2db2487ed9","score":"0.0","text":"@Test(timeout = 4000)\n public void test133() throws Throwable {\n XmlEntityRef xmlEntityRef0 = new XmlEntityRef(\"oo;##i GP*]\");\n // Undeclared exception!\n try { \n xmlEntityRef0.strong();\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n }\n }","title":""}],"string":"[\n {\n \"docid\": \"8cf0fa1db1dd9bf855415c2db2487ed9\",\n \"score\": \"0.0\",\n \"text\": \"@Test(timeout = 4000)\\n public void test133() throws Throwable {\\n XmlEntityRef xmlEntityRef0 = new XmlEntityRef(\\\"oo;##i GP*]\\\");\\n // Undeclared exception!\\n try { \\n xmlEntityRef0.strong();\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n }\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"293ba69276f6fd0cfa2f9a49e5aac4cb","score":"0.678258","text":"@Test(timeout = 4000)\n public void test16() throws Throwable {\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\n Instances instances0 = textDirectoryLoader0.getStructure();\n double[] doubleArray0 = new double[7];\n BinarySparseInstance binarySparseInstance0 = new BinarySparseInstance((-916.4121), doubleArray0);\n TestInstances testInstances0 = new TestInstances();\n EvoSuiteFile evoSuiteFile0 = new EvoSuiteFile(\"/home/ubuntu/evosuite_readability_gen/projects/107_weka\");\n FileSystemHandling.appendStringToFile(evoSuiteFile0, \"premature end of file\");\n testInstances0.generate(\".arff\");\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\n FileSystemHandling.appendLineToFile((EvoSuiteFile) null, \".arff\");\n double double0 = evaluation0.SFMeanPriorEntropy();\n double double1 = evaluation0.m_SumPredicted;\n double double2 = evaluation0.precision((-359));\n assertNotEquals(double2, double0, 0.01);\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\n assertEquals(0.0, double2, 0.01);\n }","title":""},{"docid":"fe2c88e93b06984ab138fd42b4ed1b18","score":"0.6732048","text":"public void testEntropy() {\n Assert.assertEquals(1.0, InformationTheory.entropy(new long[] { 5, 5 }));\n Assert.assertEquals(1.0,\n InformationTheory.entropy(new long[] { 15, 15 }));\n\n // When one class has probability 1.0 then there is no uncertainty about\n // the random variable,\n // thus the variable has zero bits of entropy.\n Assert.assertEquals(0.0,\n InformationTheory.entropy(new long[] { 5, 0, 0 }));\n\n // Given a random variable X, with P(X = 0) = 0.25 and P(X = 1) = 0.75.\n // The entropy of X will be less\n // than 1.0 as that is the case with the most uncertainty. The entropy\n // is 0.81127812445.\n Assert.assertEquals(0.8112781244591328,\n InformationTheory.entropy(new long[] { 1, 3 }));\n\n // Tests with strings.\n Assert.assertEquals(0.0, InformationTheory.entropy(\"aaaAAAaaaAaAaaAA\"));\n Assert.assertEquals(1.0, InformationTheory.entropy(\"abababab\"));\n Assert.assertEquals(1.584962500721156,\n InformationTheory.entropy(\"aBCAbc\"));\n Assert.assertEquals(0.8112781244591328,\n InformationTheory.entropy(\"AbBb\"));\n }","title":""},{"docid":"a2e3757641bd6a84b7086bbeb5b739fb","score":"0.67148536","text":"@Test(timeout = 4000)\n public void test09() throws Throwable {\n TestInstances testInstances0 = new TestInstances();\n Instances instances0 = testInstances0.generate(\"`pFO*%3e[eMQb_PAPL\");\n Instances instances1 = new Instances(instances0, (-2));\n Evaluation evaluation0 = new Evaluation(instances0);\n CostSensitiveClassifier costSensitiveClassifier0 = new CostSensitiveClassifier();\n MockRandom mockRandom0 = new MockRandom((-1));\n Evaluation evaluation1 = new Evaluation(instances0);\n boolean boolean0 = evaluation0.m_CoverageStatisticsAvailable;\n Instances instances2 = new Instances(instances1, 2);\n Evaluation evaluation2 = new Evaluation(instances0);\n double double0 = evaluation1.sizeOfPredictedRegions();\n assertEquals(Double.NaN, double0, 0.01);\n \n double double1 = evaluation0.fMeasure(1);\n assertEquals(0.0, double1, 0.01);\n }","title":""},{"docid":"ab57dce9f779d82d18442c60b036051d","score":"0.6696005","text":"@Test(timeout = 4000)\n public void test07() throws Throwable {\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\n textDirectoryLoader0.getDataSet();\n Instances instances0 = textDirectoryLoader0.getDataSet();\n TestInstances testInstances0 = new TestInstances();\n testInstances0.generate(\"\\tOutputs the distribution instead of only the prediction\\n\");\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\n double double0 = evaluation0.m_TotalCoverage;\n double double1 = evaluation0.SFEntropyGain();\n assertEquals(0.0, double1, 0.01);\n \n double double2 = evaluation0.truePositiveRate((-1882));\n assertEquals(0.0, double2, 0.01);\n }","title":""},{"docid":"4ae121561ca64670796d46b9493b84d4","score":"0.66406065","text":"@Test(timeout = 4000)\n public void test19() throws Throwable {\n TestInstances testInstances0 = new TestInstances();\n Instances instances0 = testInstances0.generate(\"No result for query: \");\n instances0.enumerateAttributes();\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\n \n evaluation0.useNoPriors();\n double double0 = evaluation0.m_TotalSizeOfRegions;\n double double1 = evaluation0.KBInformation();\n assertEquals(Double.NaN, double1, 0.01);\n }","title":""},{"docid":"058e0bec34732f6e4d85785bc14b4d7d","score":"0.6603057","text":"@Test(timeout = 4000)\n public void test16() throws Throwable {\n FileSystemHandling.shouldAllThrowIOExceptions();\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer((Clusterer) null);\n makeDensityBasedClusterer0.getCapabilities();\n String string0 = makeDensityBasedClusterer0.toString();\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\n assertEquals(\"No clusterer built yet!\", string0);\n }","title":""},{"docid":"542e8d167964be20093aaf728b0a4a9e","score":"0.6579574","text":"@Test(timeout = 4000)\n public void test01() throws Throwable {\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer();\n String string0 = makeDensityBasedClusterer0.getRevision();\n assertEquals(\"8034\", string0);\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\n }","title":""},{"docid":"577825f1487ee631c7bd9382f5a4f5b2","score":"0.6567856","text":"@Test(timeout = 4000)\n public void test13() throws Throwable {\n Cobweb cobweb0 = new Cobweb();\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer(cobweb0);\n Capabilities capabilities0 = cobweb0.getCapabilities();\n TestInstances testInstances0 = TestInstances.forCapabilities(capabilities0);\n Instances instances0 = testInstances0.generate();\n makeDensityBasedClusterer0.buildClusterer(instances0);\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\n }","title":""},{"docid":"943a0e69b8ae5c4c07d9d14feca2c969","score":"0.6507515","text":"@Test(timeout = 4000)\n public void test20() throws Throwable {\n Discretize discretize0 = new Discretize();\n discretize0.setBins(396);\n discretize0.setBins((-1908874351));\n discretize0.getCapabilities();\n discretize0.setMakeBinary(true);\n discretize0.setOutputFormat();\n discretize0.setFindNumBins(true);\n discretize0.setFindNumBins(true);\n discretize0.setUseEqualFrequency(true);\n discretize0.getCutPoints((-1908874351));\n discretize0.getUseBinNumbers();\n discretize0.getOptions();\n assertEquals((-1908874351), discretize0.getBins());\n }","title":""},{"docid":"a258ad99218b5dd1d631706658f8fd41","score":"0.650374","text":"@Test(timeout = 4000)\n public void test49() throws Throwable {\n CostSensitiveClassifier costSensitiveClassifier0 = new CostSensitiveClassifier();\n assertEquals(1, CostSensitiveClassifier.MATRIX_ON_DEMAND);\n assertEquals(2, CostSensitiveClassifier.MATRIX_SUPPLIED);\n assertNotNull(costSensitiveClassifier0);\n assertEquals(0, costSensitiveClassifier0.graphType());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", costSensitiveClassifier0.debugTipText());\n assertEquals(\"The base classifier to be used.\", costSensitiveClassifier0.classifierTipText());\n assertEquals(1, costSensitiveClassifier0.getSeed());\n assertEquals(\"Sets the directory where cost files are loaded from. This option is used when the costMatrixSource is set to \\\"On Demand\\\".\", costSensitiveClassifier0.onDemandDirectoryTipText());\n assertEquals(\"Sets the cost matrix explicitly. This matrix is used if the costMatrixSource property is set to \\\"Supplied\\\".\", costSensitiveClassifier0.costMatrixTipText());\n assertFalse(costSensitiveClassifier0.getMinimizeExpectedCost());\n assertFalse(costSensitiveClassifier0.getDebug());\n assertEquals(\"The random number seed to be used.\", costSensitiveClassifier0.seedTipText());\n assertEquals(\"A metaclassifier that makes its base classifier cost-sensitive. Two methods can be used to introduce cost-sensitivity: reweighting training instances according to the total cost assigned to each class; or predicting the class with minimum expected misclassification cost (rather than the most likely class). Performance can often be improved by using a Bagged classifier to improve the probability estimates of the base classifier.\", costSensitiveClassifier0.globalInfo());\n assertEquals(\"Sets whether the minimum expected cost criteria will be used. If this is false, the training data will be reweighted according to the costs assigned to each class. If true, the minimum expected cost criteria will be used.\", costSensitiveClassifier0.minimizeExpectedCostTipText());\n \n CostMatrix costMatrix0 = costSensitiveClassifier0.getCostMatrix();\n assertEquals(1, CostSensitiveClassifier.MATRIX_ON_DEMAND);\n assertEquals(2, CostSensitiveClassifier.MATRIX_SUPPLIED);\n assertNotNull(costMatrix0);\n assertEquals(0, costSensitiveClassifier0.graphType());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", costSensitiveClassifier0.debugTipText());\n assertEquals(\"The base classifier to be used.\", costSensitiveClassifier0.classifierTipText());\n assertEquals(1, costSensitiveClassifier0.getSeed());\n assertEquals(\"Sets the directory where cost files are loaded from. This option is used when the costMatrixSource is set to \\\"On Demand\\\".\", costSensitiveClassifier0.onDemandDirectoryTipText());\n assertEquals(\"Sets the cost matrix explicitly. This matrix is used if the costMatrixSource property is set to \\\"Supplied\\\".\", costSensitiveClassifier0.costMatrixTipText());\n assertFalse(costSensitiveClassifier0.getMinimizeExpectedCost());\n assertFalse(costSensitiveClassifier0.getDebug());\n assertEquals(\"The random number seed to be used.\", costSensitiveClassifier0.seedTipText());\n assertEquals(\"A metaclassifier that makes its base classifier cost-sensitive. Two methods can be used to introduce cost-sensitivity: reweighting training instances according to the total cost assigned to each class; or predicting the class with minimum expected misclassification cost (rather than the most likely class). Performance can often be improved by using a Bagged classifier to improve the probability estimates of the base classifier.\", costSensitiveClassifier0.globalInfo());\n assertEquals(\"Sets whether the minimum expected cost criteria will be used. If this is false, the training data will be reweighted according to the costs assigned to each class. If true, the minimum expected cost criteria will be used.\", costSensitiveClassifier0.minimizeExpectedCostTipText());\n assertEquals(1, costMatrix0.numRows());\n assertEquals(1, costMatrix0.numColumns());\n assertEquals(1, costMatrix0.size());\n \n int[] intArray0 = new int[5];\n intArray0[0] = 106;\n boolean boolean0 = FileSystemHandling.createFolder((EvoSuiteFile) null);\n assertFalse(boolean0);\n \n intArray0[2] = 1;\n double[] doubleArray0 = new double[0];\n BinarySparseInstance binarySparseInstance0 = new BinarySparseInstance(1, doubleArray0);\n assertEquals(6, AbstractInstance.s_numericAfterDecimalPoint);\n assertArrayEquals(new double[] {}, doubleArray0, 0.01);\n assertNotNull(binarySparseInstance0);\n assertEquals(0, doubleArray0.length);\n assertEquals(1.0, binarySparseInstance0.weight(), 0.01);\n assertEquals(0, binarySparseInstance0.numAttributes());\n assertEquals(0, binarySparseInstance0.numValues());\n \n String string0 = Evaluation.makeOptionString(costSensitiveClassifier0, true);\n assertEquals(1, CostSensitiveClassifier.MATRIX_ON_DEMAND);\n assertEquals(2, CostSensitiveClassifier.MATRIX_SUPPLIED);\n assertNotNull(string0);\n assertEquals(0, costSensitiveClassifier0.graphType());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", costSensitiveClassifier0.debugTipText());\n assertEquals(\"The base classifier to be used.\", costSensitiveClassifier0.classifierTipText());\n assertEquals(1, costSensitiveClassifier0.getSeed());\n assertEquals(\"Sets the directory where cost files are loaded from. This option is used when the costMatrixSource is set to \\\"On Demand\\\".\", costSensitiveClassifier0.onDemandDirectoryTipText());\n assertEquals(\"Sets the cost matrix explicitly. This matrix is used if the costMatrixSource property is set to \\\"Supplied\\\".\", costSensitiveClassifier0.costMatrixTipText());\n assertFalse(costSensitiveClassifier0.getMinimizeExpectedCost());\n assertFalse(costSensitiveClassifier0.getDebug());\n assertEquals(\"The random number seed to be used.\", costSensitiveClassifier0.seedTipText());\n assertEquals(\"A metaclassifier that makes its base classifier cost-sensitive. Two methods can be used to introduce cost-sensitivity: reweighting training instances according to the total cost assigned to each class; or predicting the class with minimum expected misclassification cost (rather than the most likely class). Performance can often be improved by using a Bagged classifier to improve the probability estimates of the base classifier.\", costSensitiveClassifier0.globalInfo());\n assertEquals(\"Sets whether the minimum expected cost criteria will be used. If this is false, the training data will be reweighted according to the costs assigned to each class. If true, the minimum expected cost criteria will be used.\", costSensitiveClassifier0.minimizeExpectedCostTipText());\n }","title":""},{"docid":"5865b4fa796be08c04fa73d3e84571f9","score":"0.64777064","text":"@Test(timeout = 4000)\n public void test21() throws Throwable {\n TestInstances testInstances0 = new TestInstances();\n Instances instances0 = testInstances0.generate(\"main\");\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\n FileSystemHandling.appendStringToFile((EvoSuiteFile) null, \" \");\n double double0 = evaluation0.m_SumAbsErr;\n double double1 = evaluation0.weightedAreaUnderROC();\n assertEquals(Double.NaN, double1, 0.01);\n \n double double2 = evaluation0.SFPriorEntropy();\n assertEquals(0.0, double2, 0.01);\n assertNotEquals(double2, double1, 0.01);\n }","title":""},{"docid":"261c1a78f361cd2fbb7dd98b6a2438f8","score":"0.64552796","text":"@Test(timeout = 4000)\n public void test05() throws Throwable {\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\n TestInstances testInstances0 = new TestInstances();\n Instances instances0 = testInstances0.generate();\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\n double double0 = evaluation0.priorEntropy();\n assertEquals(0.9940302114769565, double0, 0.01);\n \n evaluation0.m_MinTarget = (double) (-1);\n FileSystemHandling.appendStringToFile((EvoSuiteFile) null, \".arff\");\n double double1 = evaluation0.errorRate();\n assertEquals(Double.NaN, double1, 0.01);\n }","title":""},{"docid":"0015a2c67353710b6198c9b22e24da6e","score":"0.64335436","text":"@Test(timeout = 4000)\n public void test17() throws Throwable {\n String[] stringArray0 = new String[6];\n stringArray0[0] = \"%,\";\n stringArray0[1] = \"globalInfo\";\n stringArray0[2] = \"-x <number of folds>\\n\";\n stringArray0[3] = \"PUbE-/HYe+}KX$@,\";\n stringArray0[4] = \" * @param instanceInfo the format of the data to convert\\n\";\n stringArray0[5] = \"\\tSets index of class attribute (default: last).\\n\";\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\n Instances instances0 = textDirectoryLoader0.getDataSet();\n Evaluation evaluation0 = new Evaluation(instances0);\n textDirectoryLoader0.setOutputFilename(false);\n double double0 = evaluation0.matthewsCorrelationCoefficient(14);\n double double1 = evaluation0.weightedAreaUnderROC();\n assertNotEquals(double1, double0, 0.01);\n \n evaluation0.setDiscardPredictions(false);\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\n }","title":""},{"docid":"9606bbc9a8fc9e84c2d9d6f165fd8146","score":"0.6425031","text":"@Test(timeout = 4000)\n public void test16() throws Throwable {\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\n Instances instances0 = textDirectoryLoader0.getStructure();\n Evaluation evaluation0 = new Evaluation(instances0);\n boolean boolean0 = evaluation0.getDiscardPredictions();\n assertFalse(boolean0);\n \n double double0 = evaluation0.KBRelativeInformation();\n double double1 = evaluation0.rootMeanPriorSquaredError();\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\n assertEquals(double1, double0, 0.01);\n assertEquals(Double.NaN, double1, 0.01);\n }","title":""},{"docid":"8e36c0448c1c9fe72731e22083796ca4","score":"0.6399707","text":"@Test(timeout = 4000)\n public void test29() throws Throwable {\n Discretize discretize0 = new Discretize();\n Attribute attribute0 = new Attribute((String) null);\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\n arrayList0.add(attribute0);\n discretize0.m_IgnoreClass = true;\n Instances instances0 = new Instances(\"date\", arrayList0, 1866);\n attribute0.indexOfValue(\"first-last\");\n discretize0.setInputFormat(instances0);\n discretize0.getFindNumBins();\n discretize0.setBins(4595);\n discretize0.batchFinished();\n attribute0.enumerateValues();\n discretize0.setOutputFormat();\n discretize0.setOutputFormat();\n assertEquals(4595, discretize0.getBins());\n }","title":""},{"docid":"e882f69ba9513daacf3984b8d52a5d6b","score":"0.6389301","text":"@Test(timeout = 4000)\n public void test15() throws Throwable {\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\n Instances instances0 = textDirectoryLoader0.getStructure();\n EvoSuiteFile evoSuiteFile0 = new EvoSuiteFile(\"/home/ubuntu/evosuite_readability_gen/projects/107_weka\");\n FileSystemHandling.createFolder(evoSuiteFile0);\n CostSensitiveClassifier costSensitiveClassifier0 = new CostSensitiveClassifier();\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\n evaluation0.toCumulativeMarginDistributionString();\n System.setCurrentTimeMillis(0L);\n }","title":""},{"docid":"b3f3a3e641f6fe0613efafd9ae7b9e94","score":"0.6380977","text":"@Test(timeout = 4000)\n public void test14() throws Throwable {\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\n textDirectoryLoader0.getDataSet();\n Instances instances0 = textDirectoryLoader0.getDataSet();\n double[] doubleArray0 = new double[7];\n doubleArray0[0] = 1700.48;\n doubleArray0[1] = 1700.48;\n doubleArray0[2] = 1700.48;\n doubleArray0[3] = (-495.726371966089);\n doubleArray0[4] = 0.07500000298023224;\n doubleArray0[5] = 0.07500000298023224;\n doubleArray0[6] = 0.07500000298023224;\n BinarySparseInstance binarySparseInstance0 = new BinarySparseInstance(0.07500000298023224, doubleArray0);\n BinarySparseInstance binarySparseInstance1 = new BinarySparseInstance((SparseInstance) binarySparseInstance0);\n GaussianProcesses gaussianProcesses0 = new GaussianProcesses();\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\n RegressionByDiscretization regressionByDiscretization0 = new RegressionByDiscretization();\n evaluation0.areaUnderROC((-99));\n boolean boolean0 = evaluation0.equals((Object) null);\n assertFalse(boolean0);\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\n }","title":""},{"docid":"f7216c30d81651d12cc3df0cff2b7f1a","score":"0.63757724","text":"@Test(timeout = 4000)\n public void test11() throws Throwable {\n TestInstances testInstances0 = new TestInstances();\n Instances instances0 = testInstances0.generate(\" \");\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\n evaluation0.useNoPriors();\n instances0.getRandomNumberGenerator((-1));\n double double0 = Evaluation.MIN_SF_PROB;\n boolean boolean0 = evaluation0.equals(evaluation0);\n assertTrue(boolean0);\n \n double double1 = evaluation0.coverageOfTestCasesByPredictedRegions();\n double double2 = evaluation0.unweightedMacroFmeasure();\n assertEquals(double2, double1, 0.01);\n assertEquals(Double.NaN, double2, 0.01);\n }","title":""},{"docid":"3540934932a0844126fb5fbd5fbb97c1","score":"0.63733184","text":"@Test(timeout = 4000)\n public void test23() throws Throwable {\n Discretize discretize0 = new Discretize();\n discretize0.setBins((-1636));\n discretize0.m_MakeBinary = false;\n discretize0.getCapabilities();\n discretize0.setInvertSelection(true);\n discretize0.setMakeBinary(true);\n discretize0.setOutputFormat();\n discretize0.listOptions();\n discretize0.listOptions();\n discretize0.setFindNumBins(true);\n discretize0.setUseEqualFrequency(true);\n discretize0.getCutPoints((-1636));\n discretize0.getUseBinNumbers();\n discretize0.getDesiredWeightOfInstancesPerInterval();\n discretize0.getOptions();\n assertTrue(discretize0.getMakeBinary());\n }","title":""},{"docid":"0c46b709a20a6bcf5c47d640ef41d9e9","score":"0.6353928","text":"@Test(timeout = 4000)\n public void test35() throws Throwable {\n Discretize discretize0 = new Discretize();\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\n Attribute attribute0 = new Attribute(\"`v\", 1461);\n arrayList0.add(attribute0);\n discretize0.m_FindNumBins = true;\n UnaryOperator.identity();\n Instances instances0 = new Instances(\"`v\", arrayList0, 1);\n discretize0.setInputFormat(instances0);\n Discretize discretize1 = new Discretize();\n assertFalse(discretize1.getFindNumBins());\n \n discretize0.setInputFormat(instances0);\n discretize0.calculateCutPoints();\n assertTrue(discretize0.getFindNumBins());\n }","title":""},{"docid":"73292a1991f91072888a609ef0b4ae05","score":"0.6348158","text":"public double[] runTest() {\n\t\tallVariable = data.buildAllVariable();\n//\t\ttargetGeneSetVariable = targetGeneSetVariable.recreate(allVariable);\n\t\ttargetGeneSetVariable.recreate(allVariable);\n\n\t\tfinalTargetGeneAmount = targetGeneSetVariable.size();\n\t\t\n\t\t// Collect structure distributions\n\t\tstarttime = System.currentTimeMillis();\n\t\tStructureProbabilityDistributionEvaluator evaluator = new StructureProbabilityDistributionEvaluator(isConsideringMarkovBlanket, isConsideringAllStructure, independencyPValueThreshold, data, allVariable, targetGeneSetVariable, sampleClass, numberOfProbableStructure, equivalentSampleSize, probabilityPowerFactor, maxParentAmount, priorWeight, edgeDirFixed, includeNeighbor, priorDirectionality, resamplingRate);\n\t\tdouble[][] distribution = evaluator.getProbabilityDistribution();\n\t\t\n//\t\tSystem.out.println(\"Calculating JS divergence\\n\"); \n\n\t\tJS = JensenShannon.divergence(distribution[0], distribution[1]) / log2; // JS = [0, 1];\n\t\tendtime = System.currentTimeMillis() - starttime;\n\t\tSystem.out.println(\"Total time:\" + endtime + \"ms\"); \t\n//\t\tSystem.out.println(JS);\n\t\t\n\t\tdouble[] permutedJS = new double[numberOfPermutation];\n\t\tint caseLargerThanEqualToJS = 0;\n\t\tint nPermutationExit = (int)Math.ceil(numberOfPermutation * pValueThreshold * 2); // 2 is just safety factor\n\n\t\tif (!isSilent) {\n\t\t\tSystem.out.println(\"JS:\\t\" + JS);\n\t\t\tSystem.out.println(\"Running permutation...\");\n\t\t}\n\t\t\n\t\t// Collect JS divergences with randomly permuted sample labels.\n\t\tif (RuntimeConfiguration.IS_WRITING_LOG) {\n\t\t\ttry {\n\t\t\t\t// TODO: need to re-write this part to be consistent with the other part.\n\t\t\t\tBufferedWriter bw = new BufferedWriter(new FileWriter(\"log.txt\"));\n\t\t\t\tint permuted = 0;\n\n\t\t\t\tfor (int i = 0; i < numberOfPermutation; i++) {\n\t\t\t\t\tSampleClass permutedClass = sampleClass.permutedCopy();\n\t\t\t\t\tStructureProbabilityDistributionEvaluator permutationEvaluator = new StructureProbabilityDistributionEvaluator(isConsideringMarkovBlanket, isConsideringAllStructure, independencyPValueThreshold, data, allVariable, targetGeneSetVariable, permutedClass, numberOfProbableStructure, equivalentSampleSize, probabilityPowerFactor, maxParentAmount, priorWeight, edgeDirFixed, includeNeighbor, priorDirectionality, resamplingRate);\n\t\t\t\t\tdouble[][] permutedDistribution = permutationEvaluator.getProbabilityDistribution();\n\t\t\t\t\tpermutedJS[i] = JensenShannon.divergence(permutedDistribution[0], permutedDistribution[1]) / log2;\n\t\t\t\t\t\n\t\t\t\t\tif (RuntimeConfiguration.IS_DEBUG_MODE_LV2)\n\t\t\t\t\t\tSystem.out.print(\"Permutation \" + (i + 1) + \":\\t\" + permutedJS[i]);\n\t\t\t\t\t\n\t\t\t\t\tbw.write(\"Permutation \" + (i + 1) + \":\\t\" + permutedJS[i] + \"\\n\");\n\n\t\t\t\t\tif (permutedJS[i] >= JS) {\n\t\t\t\t\t\tcaseLargerThanEqualToJS++;\n\n\t\t\t\t\t\tif (RuntimeConfiguration.IS_DEBUG_MODE_LV2)\n\t\t\t\t\t\t\tSystem.out.println(\"\\t\" + caseLargerThanEqualToJS + \"th Hit\");\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (RuntimeConfiguration.IS_DEBUG_MODE_LV2)\n\t\t\t\t\t\t\tSystem.out.println(\"\");\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tpermuted++;\n\t\t\t\t}\n\n\t\t\t\tpValue = ((double) caseLargerThanEqualToJS)/((double) permuted);\n\t\t\t\tpermutedAmount = permuted;\n\t\t\t\tSystem.out.println(\"Statistic:\\t\" + JS + \"\\tp-value:\\t\" + pValue);\n\t\t\t\tbw.write(\"Statistic:\\t\" + JS + \"\\tp-value:\\t\" + pValue + \"\\n\");\n\t\t\t\tbw.close();\n\t\t\t} catch (Exception e) {\n\t\t\t\tSystem.out.println(e);\n\t\t\t\tSystem.exit(-1);\n\t\t\t}\n\t\t} else {\n\t\t\tint permuted = 0;\n\t\t\tfor (int i = 0; i < numberOfPermutation; i++) {\n\t\t\t\tSampleClass permutedClass = sampleClass.permutedCopy();\n\t\t\t\tStructureProbabilityDistributionEvaluator permutationEvaluator = new StructureProbabilityDistributionEvaluator(isConsideringMarkovBlanket, isConsideringAllStructure, independencyPValueThreshold, data, allVariable, targetGeneSetVariable, permutedClass, numberOfProbableStructure, equivalentSampleSize, probabilityPowerFactor, maxParentAmount, priorWeight, edgeDirFixed, includeNeighbor, priorDirectionality, resamplingRate);\n\t\t\t\tdouble[][] permutedDistribution = permutationEvaluator.getProbabilityDistribution();\n\t\t\t\tpermutedJS[i] = JensenShannon.divergence(permutedDistribution[0], permutedDistribution[1]) / log2;\n\n\t\t\t\tif (Double.isNaN(permutedJS[i])) {\n\t\t\t\t\tpermutedJS[i]=0;\n//\t\t\t\t\tSystem.out.print(\"NaN JS likely from 2 identical networks\\n\");\n\t\t\t\t};\n\t\t\t\t\n\t\t\t\t\n\t\t\t\tif (!isSilent)\n\t\t\t\t\tSystem.out.print(\"Permutation \" + (i + 1) + \":\\t\" + permutedJS[i]);\n\t\t\t\t\n\t\t\t\tpermuted++;\n\t\t\t\t\n\t\t\t\tif (permutedJS[i] >= JS) {\n\t\t\t\t\tcaseLargerThanEqualToJS++;\n\t\t\t\t\t\n\t\t\t\t\tif (!approximatePermutations & quickPermutationEnabled & permuted > 100 &\n\t\t\t\t\t\t\t(caseLargerThanEqualToJS > nPermutationExit)) \n\t\t\t\t\t\tbreak; // permutation stops since there is no possibility to go below pValueThreshold;\n\t\t\t\t\tif (!isSilent)\n\t\t\t\t\t\tSystem.out.println(\"\\t\" + caseLargerThanEqualToJS + \" hit\");\n\t\t\t\t} else {\n\t\t\t\t\tif (!isSilent)\n\t\t\t\t\t\tSystem.out.println(\"\");\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tpValue = caseLargerThanEqualToJS/((double) permuted);\n\t\t\tpermutedAmount = permuted;\n\t\t\t\n\t\t\tif ((permuted==numberOfPermutation) && (approximatePermutations)) {\n\t\t\t\tJSmean = Stat.mean(permutedJS);\n\t\t\t\tJSvariance = Stat.variance(permutedJS);\n\t\t\t\talpha = (((1-JSmean)/JSvariance) - (1/JSmean))*JSmean*JSmean;\n\t\t\t\tbeta = alpha*((1/JSmean)-1);\n\t\t\t\tSystem.out.println(\"JSmean:\" + JSmean + \" JSvariance:\" + JSvariance);\n\t\t\t\tSystem.out.println(\"alpha:\" + alpha + \" beta:\" + beta);\n\t\t\t\tbetaderivedpValue = 1-Stat.betaCDF(alpha,beta,JS);\n\t\t\t\tpValue=betaderivedpValue;\n\t\t\t\tSystem.out.println(\" beta-derived JS p-val:\" + betaderivedpValue);\n\t\t\t}\n\t\t\t\n\t\t\tif (!isSilent)\n\t\t\t\tSystem.out.println(\"Statistic:\\t\" + JS + \"\\tp-value:\\t\" + pValue);\n\t\t}\n\n\t\tif (networkToBeWritten & (pValue < pValueThreshold))\n\t\t\tevaluator.writeNetworkToFile(targetGeneSetVariable.getName());\n\n double[] statistic = new double[3];\n statistic[0] = JS;\n statistic[1] = pValue;\n statistic[2] = permutedAmount; // in many cases, actual # of permutations << specified #\n\n\t\treturn statistic;\n\t}","title":""},{"docid":"12c2e6ac47844cf1b18a82e3156e2273","score":"0.63400507","text":"@Test(timeout = 4000)\n public void test37() throws Throwable {\n JRip jRip0 = new JRip();\n Attribute attribute0 = new Attribute(\"+)L:_gsC5=KdtxFhf\", \" has \");\n JRip jRip1 = new JRip();\n JRip.RipperRule jRip_RipperRule0 = jRip1.new RipperRule();\n String string0 = jRip_RipperRule0.toString(attribute0);\n assertEquals((-1.0), jRip_RipperRule0.getConsequent(), 0.01);\n assertEquals(\" => +)L:_gsC5=KdtxFhf=\", string0);\n \n FileSystemHandling.setPermissions((EvoSuiteFile) null, false, false, false);\n double[] doubleArray0 = new double[8];\n doubleArray0[0] = (double) 1;\n doubleArray0[1] = (double) 1;\n doubleArray0[2] = (double) 1;\n doubleArray0[3] = (double) 2;\n doubleArray0[4] = (double) 3;\n doubleArray0[5] = (double) 2;\n doubleArray0[6] = (double) 0;\n doubleArray0[7] = (double) 1;\n SparseInstance sparseInstance0 = new SparseInstance((-208.0), doubleArray0);\n ArrayList<String> arrayList0 = new ArrayList<String>();\n sparseInstance0.setMissing(attribute0);\n Attribute attribute1 = new Attribute(\"@attribute\", arrayList0);\n JRip.NominalAntd jRip_NominalAntd0 = jRip1.new NominalAntd(attribute1);\n FileSystemHandling.shouldThrowIOException((EvoSuiteFile) null);\n jRip_NominalAntd0.covers(sparseInstance0);\n boolean boolean0 = jRip_NominalAntd0.covers(sparseInstance0);\n FileSystemHandling.appendLineToFile((EvoSuiteFile) null, \";iuy\");\n BayesNet bayesNet0 = new BayesNet();\n JRip.NumericAntd jRip_NumericAntd0 = jRip0.new NumericAntd(attribute0);\n boolean boolean1 = jRip_NumericAntd0.covers(sparseInstance0);\n assertEquals(1L, jRip0.getSeed());\n assertTrue(jRip0.getUsePruning());\n assertTrue(jRip0.getCheckErrorRate());\n assertEquals(Double.NaN, jRip_NumericAntd0.getAttrValue(), 0.01);\n assertEquals(2.0, jRip0.getMinNo(), 0.01);\n assertEquals(3, jRip0.getFolds());\n assertEquals(2, jRip0.getOptimizations());\n assertEquals(Double.NaN, jRip_NumericAntd0.getAccu(), 0.01);\n assertEquals(0.0, jRip_NumericAntd0.getMaxInfoGain(), 0.01);\n assertFalse(jRip0.getDebug());\n assertEquals(Double.NaN, jRip_NumericAntd0.getSplitPoint(), 0.01);\n assertTrue(boolean1 == boolean0);\n assertEquals(Double.NaN, jRip_NumericAntd0.getCover(), 0.01);\n assertEquals(Double.NaN, jRip_NumericAntd0.getAccuRate(), 0.01);\n assertFalse(boolean1);\n }","title":""},{"docid":"32a55edf6fcc00fd4084cbed82d0024a","score":"0.6330822","text":"@Test(timeout = 4000)\n public void test15() throws Throwable {\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer();\n Capabilities capabilities0 = makeDensityBasedClusterer0.getCapabilities();\n TestInstances testInstances0 = TestInstances.forCapabilities(capabilities0);\n Instances instances0 = testInstances0.generate();\n makeDensityBasedClusterer0.buildClusterer(instances0);\n makeDensityBasedClusterer0.toString();\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\n }","title":""},{"docid":"519639a85094353aea322f4b93f6d0c7","score":"0.6320759","text":"@Test(timeout = 4000)\n public void test13() throws Throwable {\n Discretize discretize0 = new Discretize();\n String string0 = discretize0.getRevision();\n assertEquals(\"8964\", string0);\n \n discretize0.setOutputFormat();\n String[] stringArray0 = discretize0.getOptions();\n Discretize discretize1 = new Discretize(\"8964\");\n discretize1.setOptions(stringArray0);\n assertEquals(10, discretize1.getBins());\n assertFalse(discretize1.getFindNumBins());\n assertEquals(6, stringArray0.length);\n assertFalse(discretize1.getMakeBinary());\n assertFalse(discretize1.getUseEqualFrequency());\n assertEquals((-1.0), discretize1.getDesiredWeightOfInstancesPerInterval(), 0.01);\n }","title":""},{"docid":"a9461d29e785d4a69e9adb9e66dc6a79","score":"0.63086176","text":"@Test(timeout = 4000)\n public void test34() throws Throwable {\n JRip jRip0 = new JRip();\n Attribute attribute0 = new Attribute(\"eus|D4*|\", \"\");\n JRip.RipperRule jRip_RipperRule0 = jRip0.new RipperRule();\n jRip_RipperRule0.copy();\n jRip_RipperRule0.toString(attribute0);\n JRip.NominalAntd jRip_NominalAntd0 = jRip0.new NominalAntd(attribute0);\n assertEquals(0.0, jRip_NominalAntd0.getMaxInfoGain(), 0.01);\n \n jRip_NominalAntd0.maxInfoGain = (double) 2;\n double double0 = jRip_NominalAntd0.getCover();\n assertEquals(Double.NaN, double0, 0.01);\n }","title":""},{"docid":"5a41160f8045d49742b5a4dd14c3571b","score":"0.62343353","text":"@Test(timeout = 4000)\n public void test13() throws Throwable {\n TestInstances testInstances0 = new TestInstances();\n Instances instances0 = testInstances0.generate(\"XxD\");\n Evaluation.handleCostOption(\"\", (-2141));\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\n \n evaluation0.useNoPriors();\n assertEquals(Double.NaN, evaluation0.SFEntropyGain(), 0.01);\n }","title":""},{"docid":"a48a5c1084f71246164cb1044f304449","score":"0.6192641","text":"@Test(timeout = 4000)\n public void test08() throws Throwable {\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer();\n String string0 = makeDensityBasedClusterer0.toString();\n assertEquals(\"No clusterer built yet!\", string0);\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\n }","title":""},{"docid":"2b2003d86fc5a40c399a08677c953104","score":"0.6188288","text":"float getTestLineCoverageResult(Run<?, ?> run);","title":""},{"docid":"d463ccff8c001eeb9e15539f8ffe87be","score":"0.61848086","text":"@Test(timeout = 4000)\n public void test12() throws Throwable {\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer();\n makeDensityBasedClusterer0.defaultClustererString();\n String[] stringArray0 = makeDensityBasedClusterer0.getOptions();\n makeDensityBasedClusterer0.setOptions(stringArray0);\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\n assertEquals(13, stringArray0.length);\n }","title":""},{"docid":"30c9e58787f7158c90fa681cffad432c","score":"0.61728907","text":"@Test(timeout = 4000)\n public void test71() throws Throwable {\n TestInstances testInstances0 = new TestInstances();\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertNotNull(testInstances0);\n assertEquals(20, testInstances0.getNumInstances());\n assertFalse(testInstances0.getNoClass());\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\n assertEquals(2, testInstances0.getNumNominalValues());\n assertFalse(testInstances0.getMultiInstance());\n assertEquals(0, testInstances0.getNumDate());\n assertEquals(10, testInstances0.getNumInstancesRelational());\n assertEquals(0, testInstances0.getNumRelationalNumeric());\n assertEquals(0, testInstances0.getNumNumeric());\n assertEquals(1, testInstances0.getNumRelationalNominal());\n assertEquals(0, testInstances0.getNumRelationalString());\n assertEquals(0, testInstances0.getNumString());\n assertEquals((-1), testInstances0.getClassIndex());\n assertEquals(1, testInstances0.getSeed());\n assertEquals(\" \", testInstances0.getWordSeparators());\n assertEquals(\"Testdata\", testInstances0.getRelation());\n assertEquals(0, testInstances0.getNumRelational());\n assertEquals(1, testInstances0.getNumNominal());\n assertEquals(0, testInstances0.getNumRelationalDate());\n assertEquals(1, testInstances0.getClassType());\n assertEquals(2, testInstances0.getNumClasses());\n assertEquals(2, testInstances0.getNumAttributes());\n \n SMOreg sMOreg0 = new SMOreg();\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertNotNull(sMOreg0);\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n \n Enumeration enumeration0 = sMOreg0.enumerateMeasures();\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertNotNull(enumeration0);\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n \n Capabilities capabilities0 = sMOreg0.getCapabilities();\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertNotNull(capabilities0);\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n \n TestInstances testInstances1 = TestInstances.forCapabilities(capabilities0);\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertNotNull(testInstances1);\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals((-1), testInstances1.getClassIndex());\n assertEquals(1, testInstances1.getSeed());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertFalse(testInstances1.getMultiInstance());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertFalse(testInstances1.getNoClass());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(0, testInstances1.getClassType());\n assertEquals(0, testInstances1.getNumRelational());\n assertNotSame(testInstances1, testInstances0);\n \n GlobalInfoJavadoc globalInfoJavadoc0 = new GlobalInfoJavadoc();\n assertNotNull(globalInfoJavadoc0);\n assertEquals(\"weka.core.Javadoc\", globalInfoJavadoc0.getClassname());\n assertTrue(globalInfoJavadoc0.getUseStars());\n assertEquals(\"\", globalInfoJavadoc0.getDir());\n assertFalse(globalInfoJavadoc0.getSilent());\n \n Instances instances0 = testInstances1.generate(\"4_\");\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertNotNull(instances0);\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals((-1), testInstances1.getClassIndex());\n assertEquals(1, testInstances1.getSeed());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertFalse(testInstances1.getMultiInstance());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertFalse(testInstances1.getNoClass());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(0, testInstances1.getClassType());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(20, instances0.size());\n assertEquals(2, instances0.classIndex());\n assertEquals(20, instances0.numInstances());\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(1, instances0.numClasses());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(3, instances0.numAttributes());\n assertNotSame(testInstances1, testInstances0);\n \n Evaluation evaluation0 = new Evaluation(instances0);\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertNotNull(evaluation0);\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals((-1), testInstances1.getClassIndex());\n assertEquals(1, testInstances1.getSeed());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertFalse(testInstances1.getMultiInstance());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertFalse(testInstances1.getNoClass());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(0, testInstances1.getClassType());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(20, instances0.size());\n assertEquals(2, instances0.classIndex());\n assertEquals(20, instances0.numInstances());\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(1, instances0.numClasses());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(3, instances0.numAttributes());\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\n assertFalse(evaluation0.getDiscardPredictions());\n assertEquals(0.0, evaluation0.correct(), 0.01);\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\n \n double double0 = evaluation0.correlationCoefficient();\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals(Double.NaN, double0, 0.01);\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals((-1), testInstances1.getClassIndex());\n assertEquals(1, testInstances1.getSeed());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertFalse(testInstances1.getMultiInstance());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertFalse(testInstances1.getNoClass());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(0, testInstances1.getClassType());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(20, instances0.size());\n assertEquals(2, instances0.classIndex());\n assertEquals(20, instances0.numInstances());\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(1, instances0.numClasses());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(3, instances0.numAttributes());\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\n assertFalse(evaluation0.getDiscardPredictions());\n assertEquals(0.0, evaluation0.correct(), 0.01);\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\n assertNotSame(testInstances1, testInstances0);\n \n MockRandom mockRandom0 = new MockRandom((-830L));\n assertNotNull(mockRandom0);\n \n try { \n evaluation0.crossValidateModel((Classifier) sMOreg0, instances0, 97, (Random) mockRandom0, (Object[]) sMOreg0.TAGS_FILTER);\n fail(\"Expecting exception: ClassCastException\");\n \n } catch(ClassCastException e) {\n //\n // weka.core.Tag cannot be cast to weka.classifiers.evaluation.output.prediction.AbstractOutput\n //\n verifyException(\"weka.classifiers.Evaluation\", e);\n }\n }","title":""},{"docid":"1f7682e3c4f11c1dc64e771f481412b4","score":"0.617022","text":"@Test(timeout = 4000)\n public void test52() throws Throwable {\n TestInstances testInstances0 = new TestInstances();\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertNotNull(testInstances0);\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\n assertEquals(20, testInstances0.getNumInstances());\n assertFalse(testInstances0.getNoClass());\n assertFalse(testInstances0.getMultiInstance());\n assertEquals(2, testInstances0.getNumNominalValues());\n assertEquals(10, testInstances0.getNumInstancesRelational());\n assertEquals(0, testInstances0.getNumNumeric());\n assertEquals(0, testInstances0.getNumRelationalNumeric());\n assertEquals(0, testInstances0.getNumRelationalString());\n assertEquals(1, testInstances0.getNumRelationalNominal());\n assertEquals((-1), testInstances0.getClassIndex());\n assertEquals(0, testInstances0.getNumString());\n assertEquals(1, testInstances0.getSeed());\n assertEquals(2, testInstances0.getNumClasses());\n assertEquals(\" \", testInstances0.getWordSeparators());\n assertEquals(\"Testdata\", testInstances0.getRelation());\n assertEquals(0, testInstances0.getNumRelational());\n assertEquals(0, testInstances0.getNumDate());\n assertEquals(1, testInstances0.getNumNominal());\n assertEquals(0, testInstances0.getNumRelationalDate());\n assertEquals(1, testInstances0.getClassType());\n assertEquals(2, testInstances0.getNumAttributes());\n \n CostSensitiveClassifier costSensitiveClassifier0 = new CostSensitiveClassifier();\n assertEquals(1, CostSensitiveClassifier.MATRIX_ON_DEMAND);\n assertEquals(2, CostSensitiveClassifier.MATRIX_SUPPLIED);\n assertNotNull(costSensitiveClassifier0);\n assertEquals(\"Sets whether the minimum expected cost criteria will be used. If this is false, the training data will be reweighted according to the costs assigned to each class. If true, the minimum expected cost criteria will be used.\", costSensitiveClassifier0.minimizeExpectedCostTipText());\n assertFalse(costSensitiveClassifier0.getDebug());\n assertEquals(\"A metaclassifier that makes its base classifier cost-sensitive. Two methods can be used to introduce cost-sensitivity: reweighting training instances according to the total cost assigned to each class; or predicting the class with minimum expected misclassification cost (rather than the most likely class). Performance can often be improved by using a Bagged classifier to improve the probability estimates of the base classifier.\", costSensitiveClassifier0.globalInfo());\n assertEquals(\"The base classifier to be used.\", costSensitiveClassifier0.classifierTipText());\n assertEquals(0, costSensitiveClassifier0.graphType());\n assertEquals(\"Sets the directory where cost files are loaded from. This option is used when the costMatrixSource is set to \\\"On Demand\\\".\", costSensitiveClassifier0.onDemandDirectoryTipText());\n assertEquals(\"Sets the cost matrix explicitly. This matrix is used if the costMatrixSource property is set to \\\"Supplied\\\".\", costSensitiveClassifier0.costMatrixTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", costSensitiveClassifier0.debugTipText());\n assertEquals(\"The random number seed to be used.\", costSensitiveClassifier0.seedTipText());\n assertFalse(costSensitiveClassifier0.getMinimizeExpectedCost());\n assertEquals(1, costSensitiveClassifier0.getSeed());\n \n AdaBoostM1 adaBoostM1_0 = new AdaBoostM1();\n assertNotNull(adaBoostM1_0);\n assertEquals(\"The number of iterations to be performed.\", adaBoostM1_0.numIterationsTipText());\n assertEquals(\"The base classifier to be used.\", adaBoostM1_0.classifierTipText());\n assertEquals(\"Whether resampling is used instead of reweighting.\", adaBoostM1_0.useResamplingTipText());\n assertFalse(adaBoostM1_0.getDebug());\n assertEquals(100, adaBoostM1_0.getWeightThreshold());\n assertEquals(10, adaBoostM1_0.getNumIterations());\n assertFalse(adaBoostM1_0.getUseResampling());\n assertEquals(\"The random number seed to be used.\", adaBoostM1_0.seedTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", adaBoostM1_0.debugTipText());\n assertEquals(1, adaBoostM1_0.getSeed());\n assertEquals(\"Weight threshold for weight pruning.\", adaBoostM1_0.weightThresholdTipText());\n \n try { \n Evaluation.wekaStaticWrapper(adaBoostM1_0, \"XxD\");\n fail(\"Expecting exception: Exception\");\n \n } catch(Exception e) {\n //\n // No model built yet\n //\n verifyException(\"weka.classifiers.meta.AdaBoostM1\", e);\n }\n }","title":""},{"docid":"015940c97e80189f8d955310fe44e088","score":"0.61693543","text":"@Test(timeout = 4000)\n public void test12() throws Throwable {\n Discretize discretize0 = new Discretize(\"\");\n discretize0.getCapabilities();\n FileSystemHandling.createFolder((EvoSuiteFile) null);\n discretize0.getBinRangesString((-1952257859));\n String[] stringArray0 = new String[1];\n stringArray0[0] = \"weka/core/Capabilities.props\";\n discretize0.setOptions(stringArray0);\n discretize0.findNumBinsTipText();\n // Undeclared exception!\n try { \n discretize0.findNumBins(24);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"weka.filters.unsupervised.attribute.Discretize\", e);\n }\n }","title":""},{"docid":"dfe1e5c358a54e6dce5a28e8203c85b3","score":"0.6167638","text":"@Test(timeout = 4000)\n public void test17() throws Throwable {\n Discretize discretize0 = new Discretize();\n assertFalse(discretize0.getUseBinNumbers());\n \n discretize0.m_UseBinNumbers = false;\n discretize0.getCapabilities();\n discretize0.getCutPoints(1108);\n discretize0.getOptions();\n discretize0.setInvertSelection(true);\n String string0 = discretize0.desiredWeightOfInstancesPerIntervalTipText();\n assertEquals(\"Sets the desired weight of instances per interval for equal-frequency binning.\", string0);\n \n String string1 = discretize0.getRevision();\n assertEquals(\"8964\", string1);\n \n String string2 = discretize0.attributeIndicesTipText();\n assertEquals(\"Specify range of attributes to act on. This is a comma separated list of attribute indices, with \\\"first\\\" and \\\"last\\\" valid values. Specify an inclusive range with \\\"-\\\". E.g: \\\"first-3,5,6-10,last\\\".\", string2);\n \n String[] stringArray0 = discretize0.getOptions();\n assertEquals(10, discretize0.getBins());\n assertEquals((-1.0), discretize0.getDesiredWeightOfInstancesPerInterval(), 0.01);\n assertEquals(7, stringArray0.length);\n }","title":""},{"docid":"eed61d1535db9de440262d4c3d46de0c","score":"0.6143958","text":"@Test(timeout = 4000)\n public void test08() throws Throwable {\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\n Instances instances0 = textDirectoryLoader0.getStructure();\n MockRandom mockRandom0 = new MockRandom();\n instances0.randomize(mockRandom0);\n Evaluation evaluation0 = new Evaluation(instances0);\n double double0 = evaluation0.incorrect();\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\n assertEquals(0.0, double0, 0.01);\n }","title":""},{"docid":"6ef7819011288756f63af9ced7b226df","score":"0.61312807","text":"@Test\n public void get_car_models_more_expensive_than_100000_euro(){\n }","title":""},{"docid":"a8e6828f11c99b3f2db2d255f9ab3b96","score":"0.61259663","text":"@Test(timeout = 4000)\n public void test16() throws Throwable {\n JRip jRip0 = new JRip();\n String[] stringArray0 = jRip0.getOptions();\n jRip0.minNoTipText();\n jRip0.setOptions(stringArray0);\n JRip.main(stringArray0);\n assertEquals(11, stringArray0.length);\n \n int int0 = jRip0.getOptimizations();\n assertEquals(2, int0);\n assertEquals(3, jRip0.getFolds());\n assertFalse(jRip0.getDebug());\n assertEquals(2.0, jRip0.getMinNo(), 0.01);\n assertEquals(1L, jRip0.getSeed());\n \n JRip jRip1 = new JRip();\n Attribute attribute0 = new Attribute(\"$e&/ClR\", 45);\n JRip.NumericAntd jRip_NumericAntd0 = jRip1.new NumericAntd(attribute0);\n String string0 = jRip_NumericAntd0.getRevision();\n assertEquals(Double.NaN, jRip_NumericAntd0.getAttrValue(), 0.01);\n assertEquals(Double.NaN, jRip_NumericAntd0.getSplitPoint(), 0.01);\n assertTrue(jRip1.getUsePruning());\n assertEquals(Double.NaN, jRip_NumericAntd0.getAccu(), 0.01);\n assertEquals(\"8118\", string0);\n assertEquals(Double.NaN, jRip_NumericAntd0.getCover(), 0.01);\n }","title":""},{"docid":"e5a0f99c3bbda92904bdd5145c0df945","score":"0.6121873","text":"@Test(timeout = 4000)\n public void test36() throws Throwable {\n Discretize discretize0 = new Discretize();\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\n Attribute attribute0 = new Attribute(\"Number of bins.\", 1461);\n arrayList0.add(attribute0);\n UnaryOperator.identity();\n Instances instances0 = new Instances(\"Number of bins.\", arrayList0, 1);\n attribute0.indexOfValue((String) null);\n discretize0.setInputFormat(instances0);\n discretize0.batchFinished();\n SparseInstance sparseInstance0 = new SparseInstance(1);\n SparseInstance sparseInstance1 = new SparseInstance((Instance) sparseInstance0);\n boolean boolean0 = discretize0.input(sparseInstance0);\n discretize0.calculateCutPoints();\n assertFalse(discretize0.isNewBatch());\n \n boolean boolean1 = discretize0.batchFinished();\n assertTrue(boolean1 == boolean0);\n }","title":""},{"docid":"fe170a83deb371e45daa9642ede1efce","score":"0.61137927","text":"@Test(timeout = 4000)\n public void test14() throws Throwable {\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer((Clusterer) null);\n String[] stringArray0 = makeDensityBasedClusterer0.getOptions();\n assertEquals(5, stringArray0.length);\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\n }","title":""},{"docid":"08a7594730e4c82f9a7d84f0ad648c95","score":"0.61081076","text":"@Test(timeout = 4000)\n public void test12() throws Throwable {\n TestInstances testInstances0 = new TestInstances();\n Instances instances0 = testInstances0.generate(\"XxD\");\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\n evaluation0.useNoPriors();\n double double0 = evaluation0.m_ConfLevel;\n Evaluation evaluation1 = new Evaluation(instances0, (CostMatrix) null);\n evaluation1.pctUnclassified();\n boolean boolean0 = evaluation0.m_NoPriors;\n double double1 = evaluation0.rootRelativeSquaredError();\n assertEquals(Double.NaN, evaluation0.SFEntropyGain(), 0.01);\n assertEquals(Double.NaN, double1, 0.01);\n }","title":""},{"docid":"67f5dfa15a82caca7b0ed71d56d012fb","score":"0.6099175","text":"@Test(timeout = 4000)\n public void test06() throws Throwable {\n TestInstances testInstances0 = new TestInstances();\n testInstances0.setNumRelationalNominal(2446);\n testInstances0.setWordSeparators(\"\");\n FileSystemHandling.shouldAllThrowIOExceptions();\n FileSystemHandling.createFolder((EvoSuiteFile) null);\n Instances instances0 = testInstances0.generate();\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\n double double0 = evaluation0.m_MinTarget;\n double double1 = evaluation0.m_TotalCoverage;\n double double2 = evaluation0.falseNegativeRate((-1));\n double double3 = evaluation0.falsePositiveRate((-100));\n assertEquals(double3, double2, 0.01);\n assertEquals(0.0, double3, 0.01);\n }","title":""},{"docid":"c0e6cab59f9bf780889d2f8e2b54b365","score":"0.6078963","text":"@Test(timeout = 4000)\n public void test46() throws Throwable {\n Discretize discretize0 = new Discretize();\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\n Attribute attribute0 = new Attribute(\"Number of bins.\", 1461);\n arrayList0.add(attribute0);\n UnaryOperator.identity();\n Instances instances0 = new Instances(\"Number of bins.\", arrayList0, 1);\n instances0.setClassIndex(0);\n attribute0.indexOfValue((String) null);\n discretize0.setInputFormat(instances0);\n discretize0.batchFinished();\n BinarySparseInstance binarySparseInstance0 = new BinarySparseInstance(1);\n SparseInstance sparseInstance0 = new SparseInstance((Instance) binarySparseInstance0);\n discretize0.input(binarySparseInstance0);\n discretize0.calculateCutPoints();\n assertFalse(discretize0.isNewBatch());\n }","title":""},{"docid":"4e7145d6ca0628bca32da8cfecbe5a9a","score":"0.6077001","text":"public void testGetTotalNoKnowledge() throws Exception {\n }","title":""},{"docid":"70a1c73a4f8b3b945d843a973de18cbb","score":"0.607237","text":"@Test(timeout = 4000)\n public void test31() throws Throwable {\n JRip jRip0 = new JRip();\n double[] doubleArray0 = new double[6];\n doubleArray0[0] = (-6.78214234);\n doubleArray0[1] = (-6.78214234);\n doubleArray0[2] = (-6.78214234);\n doubleArray0[3] = (-6.78214234);\n doubleArray0[4] = (-6.78214234);\n doubleArray0[5] = (-6.78214234);\n FileSystemHandling.setPermissions((EvoSuiteFile) null, false, false, false);\n SparseInstance sparseInstance0 = new SparseInstance((-6.78214234), doubleArray0);\n ArrayList<String> arrayList0 = new ArrayList<String>();\n Attribute attribute0 = new Attribute(\"Should never happen: oldDLin optmz. stage NaN or infinite!\", arrayList0);\n JRip.NominalAntd jRip_NominalAntd0 = jRip0.new NominalAntd(attribute0);\n jRip_NominalAntd0.value = (double) 1;\n jRip_NominalAntd0.covers(sparseInstance0);\n jRip_NominalAntd0.covers(sparseInstance0);\n FileSystemHandling.appendLineToFile((EvoSuiteFile) null, \"numeric\");\n try { \n AbstractClassifier.makeCopies(jRip0, (-871));\n fail(\"Expecting exception: NegativeArraySizeException\");\n \n } catch(NegativeArraySizeException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"weka.classifiers.AbstractClassifier\", e);\n }\n }","title":""},{"docid":"9fa78a8f01936c06cf55eb531e7d60a7","score":"0.60704255","text":"@Test(timeout = 4000)\n public void test09() throws Throwable {\n Discretize discretize0 = new Discretize();\n assertFalse(discretize0.getMakeBinary());\n \n discretize0.m_MakeBinary = false;\n String string0 = discretize0.getRevision();\n assertEquals((-1.0), discretize0.getDesiredWeightOfInstancesPerInterval(), 0.01);\n assertFalse(discretize0.getUseBinNumbers());\n assertFalse(discretize0.getFindNumBins());\n assertFalse(discretize0.getUseEqualFrequency());\n assertEquals(10, discretize0.getBins());\n assertEquals(\"8964\", string0);\n }","title":""},{"docid":"7cb18d815dbf45f4c017ecfac01a83e6","score":"0.60649717","text":"private CoverageInApproximationMeasure () {\n\t}","title":""},{"docid":"ece48bfb72769cc66ee816c2cc33d7ad","score":"0.605959","text":"@Test(timeout = 4000)\n public void test16() throws Throwable {\n Discretize discretize0 = new Discretize();\n discretize0.m_MakeBinary = true;\n Range range0 = new Range(\"N%'IFzAe\");\n discretize0.m_DiscretizeCols = range0;\n String[] stringArray0 = discretize0.getOptions();\n discretize0.setFindNumBins(false);\n discretize0.getUseBinNumbers();\n int[] intArray0 = new int[8];\n intArray0[0] = (-606);\n intArray0[1] = 6;\n intArray0[2] = (-797);\n intArray0[3] = 1298;\n discretize0.m_MakeBinary = false;\n intArray0[4] = 2402;\n discretize0.setOptions(stringArray0);\n assertTrue(discretize0.getMakeBinary());\n }","title":""},{"docid":"322b3948c4881191a4f93cd81f012505","score":"0.60394984","text":"@Test(timeout = 4000)\n public void test29() throws Throwable {\n JRip jRip0 = new JRip();\n JRip.RipperRule jRip_RipperRule0 = jRip0.new RipperRule();\n jRip_RipperRule0.hasAntds();\n jRip0.setSeed(0L);\n jRip_RipperRule0.hasAntds();\n jRip_RipperRule0.getRevision();\n byte[] byteArray0 = new byte[4];\n byteArray0[0] = (byte) (-100);\n byteArray0[1] = (byte)3;\n byteArray0[2] = (byte) (-88);\n byteArray0[3] = (byte) (-13);\n FileSystemHandling.shouldThrowIOException((EvoSuiteFile) null);\n Attribute attribute0 = new Attribute((String) null, (List<String>) null, 1397);\n AbstractClassifier.makeCopy(jRip0);\n Attribute.main((String[]) null);\n attribute0.copy(\"8118\");\n Attribute attribute1 = attribute0.copy((String) null);\n JRip.NumericAntd jRip_NumericAntd0 = jRip0.new NumericAntd(attribute1);\n jRip_NumericAntd0.toString();\n JRip.NominalAntd jRip_NominalAntd0 = jRip0.new NominalAntd(attribute0);\n InputMappedClassifier inputMappedClassifier0 = new InputMappedClassifier();\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\n Instances instances0 = new Instances(\"real\", arrayList0, 1);\n Instances instances1 = inputMappedClassifier0.getModelHeader(instances0);\n jRip_NominalAntd0.getAccu();\n jRip_NumericAntd0.splitData(instances1, 436.4912687, 3);\n try { \n jRip0.rulesetForOneClass((-3754.8701213941), instances1, 0, 0.0);\n fail(\"Expecting exception: RuntimeException\");\n \n } catch(RuntimeException e) {\n //\n // Class index is negative (not set)!\n //\n verifyException(\"weka.core.Instances\", e);\n }\n }","title":""},{"docid":"310ec3658ade1fc24c9e655cca7b7d42","score":"0.6034082","text":"@Test(timeout = 4000)\n public void test03() throws Throwable {\n TestInstances testInstances0 = new TestInstances();\n Instances instances0 = testInstances0.generate(\"D\");\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\n evaluation0.m_ClassIsNominal = false;\n evaluation0.useNoPriors();\n try { \n evaluation0.priorEntropy();\n fail(\"Expecting exception: Exception\");\n \n } catch(Exception e) {\n //\n // Can't compute entropy of class prior: class numeric!\n //\n verifyException(\"weka.classifiers.Evaluation\", e);\n }\n }","title":""},{"docid":"a5afbf3bf021ec300c0dd1790508cf00","score":"0.6033466","text":"@Test(timeout = 4000)\n public void test17() throws Throwable {\n TestInstances testInstances0 = new TestInstances();\n testInstances0.generate(\"ma:n\");\n Instances instances0 = testInstances0.generate(\"@relation\");\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\n Evaluation evaluation1 = new Evaluation(instances0, (CostMatrix) null);\n double double0 = evaluation1.m_Incorrect;\n Evaluation evaluation2 = new Evaluation(instances0, (CostMatrix) null);\n String string0 = evaluation2.toMatrixString();\n assertEquals(\"=== Confusion Matrix ===\\n\\n a b <-- classified as\\n 0 0 | a = class1\\n 0 0 | b = class2\\n\", string0);\n assertEquals(0.0, evaluation2.SFSchemeEntropy(), 0.01);\n }","title":""},{"docid":"6a2b23a73106338b94fea70d155e490e","score":"0.6031164","text":"@Test(timeout = 4000)\n public void test15() throws Throwable {\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\n Instances instances0 = textDirectoryLoader0.getStructure();\n Evaluation evaluation0 = new Evaluation(instances0);\n boolean boolean0 = evaluation0.getDiscardPredictions();\n assertFalse(boolean0);\n \n textDirectoryLoader0.reset();\n double double0 = evaluation0.KBRelativeInformation();\n assertEquals(Double.NaN, double0, 0.01);\n \n double[][] doubleArray0 = evaluation0.confusionMatrix();\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\n assertEquals(0, doubleArray0.length);\n }","title":""},{"docid":"ba92d7962df3861de3e2c9ec5258cc68","score":"0.6026941","text":"@Test(timeout = 4000)\n public void test01() throws Throwable {\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\n Instances instances0 = textDirectoryLoader0.getStructure();\n instances0.sort((-1751));\n Evaluation evaluation0 = new Evaluation(instances0);\n double[] doubleArray0 = evaluation0.getClassPriors();\n assertNotNull(doubleArray0);\n \n double double0 = evaluation0.weightedAreaUnderROC();\n assertEquals(Double.NaN, double0, 0.01);\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\n }","title":""},{"docid":"3863e4a0dd8868efa099c0f3ef87eb15","score":"0.6018713","text":"@Test(timeout = 4000)\n public void test13() throws Throwable {\n Discretize discretize0 = new Discretize();\n discretize0.m_MakeBinary = true;\n Range range0 = new Range(\"N%'IFzAe\");\n discretize0.m_DiscretizeCols = range0;\n discretize0.getOptions();\n discretize0.setFindNumBins(false);\n discretize0.getUseBinNumbers();\n assertTrue(discretize0.getMakeBinary());\n \n int[] intArray0 = new int[8];\n intArray0[0] = (-606);\n intArray0[1] = 6;\n intArray0[2] = (-797);\n intArray0[3] = 1298;\n discretize0.m_MakeBinary = false;\n intArray0[4] = 2402;\n intArray0[5] = 735;\n intArray0[6] = 0;\n intArray0[7] = (-1323);\n BinarySparseInstance binarySparseInstance0 = new BinarySparseInstance(2405.40515, intArray0, 2402);\n BinarySparseInstance binarySparseInstance1 = new BinarySparseInstance((SparseInstance) binarySparseInstance0);\n discretize0.setUseEqualFrequency(false);\n discretize0.setAttributeIndicesArray(intArray0);\n assertEquals((-1.0), discretize0.getDesiredWeightOfInstancesPerInterval(), 0.01);\n }","title":""},{"docid":"22acf1c94713368ba2332d760e8f4148","score":"0.60166585","text":"@Test(timeout = 4000)\n public void test06() throws Throwable {\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer();\n makeDensityBasedClusterer0.setNumClusters(537);\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\n }","title":""},{"docid":"a250b39a3842bd4be8213bba834be390","score":"0.60126483","text":"@Test(timeout = 4000)\n public void test18() throws Throwable {\n Discretize discretize0 = new Discretize();\n discretize0.getCutPoints(3282);\n assertFalse(discretize0.getMakeBinary());\n assertFalse(discretize0.getFindNumBins());\n assertEquals((-1.0), discretize0.getDesiredWeightOfInstancesPerInterval(), 0.01);\n assertEquals(10, discretize0.getBins());\n assertFalse(discretize0.getUseBinNumbers());\n assertFalse(discretize0.getUseEqualFrequency());\n }","title":""},{"docid":"59ab2ccb1e7026563baaf9b5e2446116","score":"0.6011401","text":"@Test(timeout = 4000)\n public void test17() throws Throwable {\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer((Clusterer) null);\n makeDensityBasedClusterer0.listOptions();\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\n }","title":""},{"docid":"1a2ed9ffe8827c91d7d2ca957cc0660c","score":"0.60113716","text":"@Test(timeout = 4000)\n public void test35() throws Throwable {\n SMOreg sMOreg0 = new SMOreg();\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertNotNull(sMOreg0);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n \n Capabilities capabilities0 = sMOreg0.getCapabilities();\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertNotNull(capabilities0);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n \n TestInstances testInstances0 = TestInstances.forCapabilities(capabilities0);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertNotNull(testInstances0);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertEquals(0, testInstances0.getClassType());\n assertEquals(1, testInstances0.getSeed());\n assertEquals(1, testInstances0.getNumRelationalNominal());\n assertEquals((-1), testInstances0.getClassIndex());\n assertEquals(0, testInstances0.getNumRelationalString());\n assertEquals(1, testInstances0.getNumRelationalNumeric());\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\n assertEquals(1, testInstances0.getNumNumeric());\n assertEquals(0, testInstances0.getNumString());\n assertEquals(2, testInstances0.getNumClasses());\n assertFalse(testInstances0.getNoClass());\n assertFalse(testInstances0.getMultiInstance());\n assertEquals(3, testInstances0.getNumAttributes());\n assertEquals(10, testInstances0.getNumInstancesRelational());\n assertEquals(20, testInstances0.getNumInstances());\n assertEquals(\" \", testInstances0.getWordSeparators());\n assertEquals(\"Testdata\", testInstances0.getRelation());\n assertEquals(0, testInstances0.getNumRelational());\n assertEquals(0, testInstances0.getNumDate());\n assertEquals(1, testInstances0.getNumNominal());\n assertEquals(0, testInstances0.getNumRelationalDate());\n assertEquals(2, testInstances0.getNumNominalValues());\n \n Instances instances0 = testInstances0.generate(\"getTechnicalInformation\");\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertNotNull(instances0);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertEquals(0, testInstances0.getClassType());\n assertEquals(1, testInstances0.getSeed());\n assertEquals(1, testInstances0.getNumRelationalNominal());\n assertEquals((-1), testInstances0.getClassIndex());\n assertEquals(0, testInstances0.getNumRelationalString());\n assertEquals(1, testInstances0.getNumRelationalNumeric());\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\n assertEquals(1, testInstances0.getNumNumeric());\n assertEquals(0, testInstances0.getNumString());\n assertEquals(2, testInstances0.getNumClasses());\n assertFalse(testInstances0.getNoClass());\n assertFalse(testInstances0.getMultiInstance());\n assertEquals(3, testInstances0.getNumAttributes());\n assertEquals(10, testInstances0.getNumInstancesRelational());\n assertEquals(20, testInstances0.getNumInstances());\n assertEquals(\" \", testInstances0.getWordSeparators());\n assertEquals(\"Testdata\", testInstances0.getRelation());\n assertEquals(0, testInstances0.getNumRelational());\n assertEquals(0, testInstances0.getNumDate());\n assertEquals(1, testInstances0.getNumNominal());\n assertEquals(0, testInstances0.getNumRelationalDate());\n assertEquals(2, testInstances0.getNumNominalValues());\n assertEquals(3, instances0.numAttributes());\n assertEquals(20, instances0.numInstances());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(20, instances0.size());\n assertEquals(1, instances0.numClasses());\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(2, instances0.classIndex());\n \n Capabilities capabilities1 = capabilities0.getClassCapabilities();\n assertFalse(capabilities1.equals((Object)capabilities0));\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertNotNull(capabilities1);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertFalse(capabilities1.hasDependencies());\n assertEquals(1, capabilities1.getMinimumNumberInstances());\n assertNotSame(capabilities0, capabilities1);\n assertNotSame(capabilities1, capabilities0);\n \n CostSensitiveClassifier costSensitiveClassifier0 = new CostSensitiveClassifier();\n assertEquals(1, CostSensitiveClassifier.MATRIX_ON_DEMAND);\n assertEquals(2, CostSensitiveClassifier.MATRIX_SUPPLIED);\n assertNotNull(costSensitiveClassifier0);\n assertEquals(\"Sets whether the minimum expected cost criteria will be used. If this is false, the training data will be reweighted according to the costs assigned to each class. If true, the minimum expected cost criteria will be used.\", costSensitiveClassifier0.minimizeExpectedCostTipText());\n assertFalse(costSensitiveClassifier0.getDebug());\n assertEquals(\"A metaclassifier that makes its base classifier cost-sensitive. Two methods can be used to introduce cost-sensitivity: reweighting training instances according to the total cost assigned to each class; or predicting the class with minimum expected misclassification cost (rather than the most likely class). Performance can often be improved by using a Bagged classifier to improve the probability estimates of the base classifier.\", costSensitiveClassifier0.globalInfo());\n assertEquals(0, costSensitiveClassifier0.graphType());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", costSensitiveClassifier0.debugTipText());\n assertEquals(\"The base classifier to be used.\", costSensitiveClassifier0.classifierTipText());\n assertEquals(\"Sets the directory where cost files are loaded from. This option is used when the costMatrixSource is set to \\\"On Demand\\\".\", costSensitiveClassifier0.onDemandDirectoryTipText());\n assertEquals(\"Sets the cost matrix explicitly. This matrix is used if the costMatrixSource property is set to \\\"Supplied\\\".\", costSensitiveClassifier0.costMatrixTipText());\n assertEquals(\"The random number seed to be used.\", costSensitiveClassifier0.seedTipText());\n assertFalse(costSensitiveClassifier0.getMinimizeExpectedCost());\n assertEquals(1, costSensitiveClassifier0.getSeed());\n \n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\n assertFalse(capabilities0.equals((Object)capabilities1));\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertNotNull(evaluation0);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertEquals(0, testInstances0.getClassType());\n assertEquals(1, testInstances0.getSeed());\n assertEquals(1, testInstances0.getNumRelationalNominal());\n assertEquals((-1), testInstances0.getClassIndex());\n assertEquals(0, testInstances0.getNumRelationalString());\n assertEquals(1, testInstances0.getNumRelationalNumeric());\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\n assertEquals(1, testInstances0.getNumNumeric());\n assertEquals(0, testInstances0.getNumString());\n assertEquals(2, testInstances0.getNumClasses());\n assertFalse(testInstances0.getNoClass());\n assertFalse(testInstances0.getMultiInstance());\n assertEquals(3, testInstances0.getNumAttributes());\n assertEquals(10, testInstances0.getNumInstancesRelational());\n assertEquals(20, testInstances0.getNumInstances());\n assertEquals(\" \", testInstances0.getWordSeparators());\n assertEquals(\"Testdata\", testInstances0.getRelation());\n assertEquals(0, testInstances0.getNumRelational());\n assertEquals(0, testInstances0.getNumDate());\n assertEquals(1, testInstances0.getNumNominal());\n assertEquals(0, testInstances0.getNumRelationalDate());\n assertEquals(2, testInstances0.getNumNominalValues());\n assertEquals(3, instances0.numAttributes());\n assertEquals(20, instances0.numInstances());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(20, instances0.size());\n assertEquals(1, instances0.numClasses());\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(2, instances0.classIndex());\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\n assertEquals(0.0, evaluation0.correct(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\n assertFalse(evaluation0.getDiscardPredictions());\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\n \n double[] doubleArray0 = evaluation0.makeDistribution(1);\n assertFalse(capabilities0.equals((Object)capabilities1));\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertArrayEquals(new double[] {1.0}, doubleArray0, 0.01);\n assertNotNull(doubleArray0);\n assertEquals(1, doubleArray0.length);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertEquals(0, testInstances0.getClassType());\n assertEquals(1, testInstances0.getSeed());\n assertEquals(1, testInstances0.getNumRelationalNominal());\n assertEquals((-1), testInstances0.getClassIndex());\n assertEquals(0, testInstances0.getNumRelationalString());\n assertEquals(1, testInstances0.getNumRelationalNumeric());\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\n assertEquals(1, testInstances0.getNumNumeric());\n assertEquals(0, testInstances0.getNumString());\n assertEquals(2, testInstances0.getNumClasses());\n assertFalse(testInstances0.getNoClass());\n assertFalse(testInstances0.getMultiInstance());\n assertEquals(3, testInstances0.getNumAttributes());\n assertEquals(10, testInstances0.getNumInstancesRelational());\n assertEquals(20, testInstances0.getNumInstances());\n assertEquals(\" \", testInstances0.getWordSeparators());\n assertEquals(\"Testdata\", testInstances0.getRelation());\n assertEquals(0, testInstances0.getNumRelational());\n assertEquals(0, testInstances0.getNumDate());\n assertEquals(1, testInstances0.getNumNominal());\n assertEquals(0, testInstances0.getNumRelationalDate());\n assertEquals(2, testInstances0.getNumNominalValues());\n assertEquals(3, instances0.numAttributes());\n assertEquals(20, instances0.numInstances());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(20, instances0.size());\n assertEquals(1, instances0.numClasses());\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(2, instances0.classIndex());\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\n assertEquals(0.0, evaluation0.correct(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\n assertFalse(evaluation0.getDiscardPredictions());\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\n assertNotSame(capabilities0, capabilities1);\n \n double double0 = evaluation0.SFSchemeEntropy();\n assertFalse(capabilities0.equals((Object)capabilities1));\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertEquals(0.0, double0, 0.01);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertEquals(0, testInstances0.getClassType());\n assertEquals(1, testInstances0.getSeed());\n assertEquals(1, testInstances0.getNumRelationalNominal());\n assertEquals((-1), testInstances0.getClassIndex());\n assertEquals(0, testInstances0.getNumRelationalString());\n assertEquals(1, testInstances0.getNumRelationalNumeric());\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\n assertEquals(1, testInstances0.getNumNumeric());\n assertEquals(0, testInstances0.getNumString());\n assertEquals(2, testInstances0.getNumClasses());\n assertFalse(testInstances0.getNoClass());\n assertFalse(testInstances0.getMultiInstance());\n assertEquals(3, testInstances0.getNumAttributes());\n assertEquals(10, testInstances0.getNumInstancesRelational());\n assertEquals(20, testInstances0.getNumInstances());\n assertEquals(\" \", testInstances0.getWordSeparators());\n assertEquals(\"Testdata\", testInstances0.getRelation());\n assertEquals(0, testInstances0.getNumRelational());\n assertEquals(0, testInstances0.getNumDate());\n assertEquals(1, testInstances0.getNumNominal());\n assertEquals(0, testInstances0.getNumRelationalDate());\n assertEquals(2, testInstances0.getNumNominalValues());\n assertEquals(3, instances0.numAttributes());\n assertEquals(20, instances0.numInstances());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(20, instances0.size());\n assertEquals(1, instances0.numClasses());\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(2, instances0.classIndex());\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\n assertEquals(0.0, evaluation0.correct(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\n assertFalse(evaluation0.getDiscardPredictions());\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\n assertNotSame(capabilities0, capabilities1);\n }","title":""},{"docid":"292890fb056962e07f94e054ad38ff03","score":"0.60043997","text":"@Test(timeout = 4000)\n public void test14() throws Throwable {\n JRip jRip0 = new JRip();\n Attribute attribute0 = new Attribute(\"115-123\", 0);\n JRip.NumericAntd jRip_NumericAntd0 = jRip0.new NumericAntd(attribute0);\n double double0 = jRip_NumericAntd0.getSplitPoint();\n assertFalse(jRip0.getDebug());\n assertEquals(Double.NaN, double0, 0.01);\n assertEquals(Double.NaN, jRip_NumericAntd0.getAttrValue(), 0.01);\n assertEquals(3, jRip0.getFolds());\n assertEquals(Double.NaN, jRip_NumericAntd0.getAccuRate(), 0.01);\n assertEquals(2.0, jRip0.getMinNo(), 0.01);\n assertEquals(2, jRip0.getOptimizations());\n assertEquals(0.0, jRip_NumericAntd0.getMaxInfoGain(), 0.01);\n assertTrue(jRip0.getCheckErrorRate());\n assertEquals(1L, jRip0.getSeed());\n assertTrue(jRip0.getUsePruning());\n assertEquals(Double.NaN, jRip_NumericAntd0.getCover(), 0.01);\n assertEquals(Double.NaN, jRip_NumericAntd0.getAccu(), 0.01);\n }","title":""},{"docid":"ecbcc880339fdc7ef47a23ad3c2d8c01","score":"0.5999325","text":"@Test(timeout = 4000)\n public void test13() throws Throwable {\n JRip jRip0 = new JRip();\n AbstractClassifier.makeCopies(jRip0, 0);\n String string0 = jRip0.optimizationsTipText();\n assertEquals(\"The number of optimization runs.\", string0);\n \n JRip.RipperRule jRip_RipperRule0 = jRip0.new RipperRule();\n String string1 = jRip_RipperRule0.getRevision();\n assertEquals((-1.0), jRip_RipperRule0.getConsequent(), 0.01);\n assertTrue(jRip0.getCheckErrorRate());\n assertEquals(2, jRip0.getOptimizations());\n assertFalse(jRip0.getDebug());\n assertEquals(3, jRip0.getFolds());\n assertEquals(\"8118\", string1);\n assertEquals(1L, jRip0.getSeed());\n assertTrue(jRip0.getUsePruning());\n assertEquals(2.0, jRip0.getMinNo(), 0.01);\n }","title":""},{"docid":"228d99a24935a06513904247893ecec1","score":"0.59972507","text":"@Test(timeout = 4000)\n public void test12() throws Throwable {\n Discretize discretize0 = new Discretize();\n String[] stringArray0 = discretize0.getOptions();\n assertEquals(6, stringArray0.length);\n \n discretize0.getBinRangesString(4714);\n assertEquals((-1.0), discretize0.getDesiredWeightOfInstancesPerInterval(), 0.01);\n assertEquals(10, discretize0.getBins());\n }","title":""},{"docid":"ab957abbb79498d72037caaf222a92ce","score":"0.5996688","text":"@Test\n public void hctConverCostTest() {\n // TODO: test hctConverCost\n }","title":""},{"docid":"51a2f18a1e3a8b6b83fb530741abc4f7","score":"0.59845144","text":"@Test void minimalObservationTest() {\n\t\tstandardTest(6);\n\t}","title":""},{"docid":"a587423d053a7469d1ffd14f02a364ba","score":"0.597597","text":"@Test\r\n public void testCalculateFitness() {\r\n System.out.println(\"calculateFitness\");\r\n String candidateString = \" \";\r\n Chromosome instance = new Chromosome(candidateString);\r\n double expResult = 1.01;\r\n double result = instance.calculateFitness(instance.getCandidateString());\r\n if(expResult>=result)\r\n assertEquals(expResult, result,1.01);\r\n else\r\n fail(\"No passed\");\r\n }","title":""},{"docid":"8cbe7e9502943ea5c0ea39ea3ce7ff38","score":"0.59702927","text":"@Test(timeout = 4000)\n public void test24() throws Throwable {\n Discretize discretize0 = new Discretize(\"General options:\\n\\n-h\\n\\tGet help on available options.\\n\\t(use -b -h for help on batch mode.)\\n-i <file>\\n\\tThe name of the file containing input instances.\\n\\tIf not supplied then instances will be read from stdin.\\n-o <file>\\n\\tThe name of the file output instances will be written to.\\n\\tIf not supplied then instances will be written to stdout.\\n-c <class index>\\n\\tThe number of the attribute to use as the class.\\n\\t\\\"first\\\" and \\\"last\\\" are also valid entries.\\n\\tIf not supplied then no class is assigned.\");\n discretize0.setOutputFormat();\n discretize0.setFindNumBins(true);\n discretize0.setFindNumBins(false);\n discretize0.m_MakeBinary = true;\n double[][] doubleArray0 = new double[7][0];\n double[] doubleArray1 = new double[0];\n doubleArray0[0] = doubleArray1;\n double[] doubleArray2 = new double[4];\n doubleArray2[0] = (double) 933;\n doubleArray2[1] = (double) 933;\n doubleArray2[2] = (double) 933;\n doubleArray2[3] = (double) 933;\n doubleArray0[1] = doubleArray2;\n double[] doubleArray3 = new double[4];\n doubleArray3[0] = (double) 933;\n doubleArray3[1] = (double) 933;\n doubleArray3[2] = (double) 933;\n doubleArray3[3] = (double) 933;\n doubleArray0[2] = doubleArray3;\n double[] doubleArray4 = new double[9];\n doubleArray4[0] = (double) 933;\n doubleArray4[1] = (double) 933;\n doubleArray4[2] = (double) 933;\n doubleArray4[3] = (double) 933;\n doubleArray4[4] = (double) 933;\n doubleArray4[5] = (-1.7976931348623157E308);\n doubleArray4[6] = (double) 933;\n doubleArray4[7] = (double) 933;\n doubleArray4[8] = (-327.5);\n doubleArray0[3] = doubleArray4;\n double[] doubleArray5 = new double[1];\n doubleArray5[0] = (-1.7976931348623157E308);\n doubleArray0[4] = doubleArray5;\n double[] doubleArray6 = new double[5];\n doubleArray6[0] = (-1730.9912419);\n doubleArray6[1] = (double) 933;\n doubleArray6[2] = (double) 933;\n doubleArray6[3] = (double) 933;\n doubleArray6[4] = (double) 933;\n doubleArray0[5] = doubleArray6;\n double[] doubleArray7 = new double[0];\n doubleArray0[6] = doubleArray7;\n discretize0.m_CutPoints = doubleArray0;\n // Undeclared exception!\n try { \n discretize0.getCutPoints(933);\n fail(\"Expecting exception: ArrayIndexOutOfBoundsException\");\n \n } catch(ArrayIndexOutOfBoundsException e) {\n //\n // 933\n //\n verifyException(\"weka.filters.unsupervised.attribute.Discretize\", e);\n }\n }","title":""},{"docid":"58ad5ddbeab8d3f05faaf4d5777ba0e2","score":"0.59610665","text":"@Test(timeout = 4000)\n public void test07() throws Throwable {\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer();\n String[] stringArray0 = new String[0];\n makeDensityBasedClusterer0.setOptions(stringArray0);\n String[] stringArray1 = makeDensityBasedClusterer0.getOptions();\n assertEquals(13, stringArray1.length);\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\n }","title":""},{"docid":"b501dba621e25a02218970efad771f59","score":"0.5945148","text":"@Test(timeout = 4000)\n public void test40() throws Throwable {\n Discretize discretize0 = new Discretize();\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\n Attribute attribute0 = new Attribute(\"Number of bins.\", 1461);\n arrayList0.add(attribute0);\n UnaryOperator.identity();\n Instances instances0 = new Instances(\"Number of bins.\", arrayList0, 9);\n boolean boolean0 = discretize0.setInputFormat(instances0);\n boolean boolean1 = discretize0.batchFinished();\n assertTrue(boolean1 == boolean0);\n \n String string0 = discretize0.getBinRangesString(0);\n assertEquals(\"All\", string0);\n \n discretize0.setOutputFormat();\n assertEquals(10, discretize0.getBins());\n assertFalse(discretize0.getFindNumBins());\n assertEquals((-1.0), discretize0.getDesiredWeightOfInstancesPerInterval(), 0.01);\n assertFalse(discretize0.getUseEqualFrequency());\n assertFalse(discretize0.getUseBinNumbers());\n }","title":""},{"docid":"0773cbe7a945665bfce20477e863dd69","score":"0.59418565","text":"@Test(timeout = 4000)\n public void test20() throws Throwable {\n SMOreg sMOreg0 = new SMOreg();\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\n FileSystemHandling.shouldAllThrowIOExceptions();\n Instances instances0 = textDirectoryLoader0.getStructure();\n CostSensitiveClassifier costSensitiveClassifier0 = new CostSensitiveClassifier();\n costSensitiveClassifier0.getCostMatrix();\n CostMatrix costMatrix0 = new CostMatrix(0);\n Evaluation evaluation0 = new Evaluation(instances0, costMatrix0);\n double double0 = evaluation0.weightedAreaUnderROC();\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\n assertEquals(Double.NaN, double0, 0.01);\n }","title":""},{"docid":"c02038636c61523058c8a0ace5c78ebc","score":"0.59372187","text":"@Test(timeout = 4000)\n public void test11() throws Throwable {\n System.setCurrentTimeMillis(0L);\n String[] stringArray0 = new String[9];\n stringArray0[0] = \"\";\n stringArray0[1] = \"_/N:=opih\";\n stringArray0[2] = \"4NbZCskq0tdE-,s2\";\n stringArray0[3] = \"\";\n stringArray0[4] = \"-Y\";\n stringArray0[5] = \" appears to be missing.\";\n stringArray0[6] = \"\";\n stringArray0[7] = \"first-last\";\n stringArray0[8] = \" @oHfv9gPYTE:$s#\";\n Discretize.main(stringArray0);\n Discretize discretize0 = new Discretize(\"2,-550,2147483646\");\n // Undeclared exception!\n try { \n discretize0.calculateCutPointsByEqualWidthBinning((-1659));\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"weka.filters.unsupervised.attribute.Discretize\", e);\n }\n }","title":""},{"docid":"844667a7940b666206a9f53779ef84f7","score":"0.5937021","text":"@Test(timeout = 4000)\n public void test37() throws Throwable {\n Discretize discretize0 = new Discretize();\n Range range0 = new Range();\n discretize0.m_DiscretizeCols = range0;\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\n Attribute attribute0 = new Attribute(\"Number of bins.\", 1461);\n arrayList0.add(attribute0);\n UnaryOperator.identity();\n Instances instances0 = new Instances(\"Number of bins.\", arrayList0, 1);\n discretize0.setInputFormat(instances0);\n discretize0.batchFinished();\n SparseInstance sparseInstance0 = new SparseInstance(4);\n SparseInstance sparseInstance1 = new SparseInstance((Instance) sparseInstance0);\n discretize0.input(sparseInstance1);\n discretize0.calculateCutPoints();\n assertFalse(discretize0.isNewBatch());\n }","title":""},{"docid":"4799357087b5c6fa957e8c32a0539adc","score":"0.59216356","text":"@Test(timeout = 4000)\n public void test73() throws Throwable {\n TestInstances testInstances0 = new TestInstances();\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertNotNull(testInstances0);\n assertEquals(2, testInstances0.getNumNominalValues());\n assertEquals(10, testInstances0.getNumInstancesRelational());\n assertEquals(0, testInstances0.getNumRelationalString());\n assertFalse(testInstances0.getNoClass());\n assertFalse(testInstances0.getMultiInstance());\n assertEquals(1, testInstances0.getNumNominal());\n assertEquals(0, testInstances0.getNumRelationalDate());\n assertEquals(1, testInstances0.getSeed());\n assertEquals(\"Testdata\", testInstances0.getRelation());\n assertEquals(1, testInstances0.getClassType());\n assertEquals(0, testInstances0.getNumRelational());\n assertEquals(\" \", testInstances0.getWordSeparators());\n assertEquals(20, testInstances0.getNumInstances());\n assertEquals(0, testInstances0.getNumDate());\n assertEquals(2, testInstances0.getNumAttributes());\n assertEquals(2, testInstances0.getNumClasses());\n assertEquals((-1), testInstances0.getClassIndex());\n assertEquals(1, testInstances0.getNumRelationalNominal());\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\n assertEquals(0, testInstances0.getNumNumeric());\n assertEquals(0, testInstances0.getNumRelationalNumeric());\n assertEquals(0, testInstances0.getNumString());\n \n SMOreg sMOreg0 = new SMOreg();\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertNotNull(sMOreg0);\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n \n Capabilities capabilities0 = sMOreg0.getCapabilities();\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertNotNull(capabilities0);\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n \n TestInstances testInstances1 = TestInstances.forCapabilities(capabilities0);\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertNotNull(testInstances1);\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertEquals(0, testInstances1.getClassType());\n assertFalse(testInstances1.getNoClass());\n assertEquals((-1), testInstances1.getClassIndex());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(1, testInstances1.getSeed());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertFalse(testInstances1.getMultiInstance());\n assertNotSame(testInstances1, testInstances0);\n \n Instances instances0 = testInstances1.generate(\"X/\\\\\");\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertNotNull(instances0);\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertEquals(0, testInstances1.getClassType());\n assertFalse(testInstances1.getNoClass());\n assertEquals((-1), testInstances1.getClassIndex());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(1, testInstances1.getSeed());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertFalse(testInstances1.getMultiInstance());\n assertEquals(3, instances0.numAttributes());\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(2, instances0.classIndex());\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(1, instances0.numClasses());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertEquals(20, instances0.size());\n assertEquals(20, instances0.numInstances());\n assertNotSame(testInstances1, testInstances0);\n \n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertNotNull(evaluation0);\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertEquals(0, testInstances1.getClassType());\n assertFalse(testInstances1.getNoClass());\n assertEquals((-1), testInstances1.getClassIndex());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(1, testInstances1.getSeed());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertFalse(testInstances1.getMultiInstance());\n assertEquals(3, instances0.numAttributes());\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(2, instances0.classIndex());\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(1, instances0.numClasses());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertEquals(20, instances0.size());\n assertEquals(20, instances0.numInstances());\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\n assertEquals(0.0, evaluation0.correct(), 0.01);\n assertFalse(evaluation0.getDiscardPredictions());\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\n \n evaluation0.useNoPriors();\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertEquals(0, testInstances1.getClassType());\n assertFalse(testInstances1.getNoClass());\n assertEquals((-1), testInstances1.getClassIndex());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(1, testInstances1.getSeed());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertFalse(testInstances1.getMultiInstance());\n assertEquals(3, instances0.numAttributes());\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(2, instances0.classIndex());\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(1, instances0.numClasses());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertEquals(20, instances0.size());\n assertEquals(20, instances0.numInstances());\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\n assertEquals(0.0, evaluation0.correct(), 0.01);\n assertFalse(evaluation0.getDiscardPredictions());\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFEntropyGain(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFPriorEntropy(), 0.01);\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\n assertNotSame(testInstances1, testInstances0);\n \n evaluation0.addNumericTrainClass((-1.7976931348623157E308), 0.17499999701976776);\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertEquals(0, testInstances1.getClassType());\n assertFalse(testInstances1.getNoClass());\n assertEquals((-1), testInstances1.getClassIndex());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(1, testInstances1.getSeed());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertFalse(testInstances1.getMultiInstance());\n assertEquals(3, instances0.numAttributes());\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(2, instances0.classIndex());\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(1, instances0.numClasses());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertEquals(20, instances0.size());\n assertEquals(20, instances0.numInstances());\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\n assertEquals(0.0, evaluation0.correct(), 0.01);\n assertFalse(evaluation0.getDiscardPredictions());\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFEntropyGain(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFPriorEntropy(), 0.01);\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\n assertNotSame(testInstances1, testInstances0);\n \n Evaluation evaluation1 = new Evaluation(instances0);\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertTrue(evaluation1.equals((Object)evaluation0));\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertNotNull(evaluation1);\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertEquals(0, testInstances1.getClassType());\n assertFalse(testInstances1.getNoClass());\n assertEquals((-1), testInstances1.getClassIndex());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(1, testInstances1.getSeed());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertFalse(testInstances1.getMultiInstance());\n assertEquals(3, instances0.numAttributes());\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(2, instances0.classIndex());\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(1, instances0.numClasses());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertEquals(20, instances0.size());\n assertEquals(20, instances0.numInstances());\n assertEquals(0.0, evaluation1.incorrect(), 0.01);\n assertEquals(Double.NaN, evaluation1.meanAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation1.pctIncorrect(), 0.01);\n assertEquals(Double.NaN, evaluation1.avgCost(), 0.01);\n assertEquals(Double.NaN, evaluation1.SFMeanPriorEntropy(), 0.01);\n assertEquals(0.0, evaluation1.SFPriorEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation1.meanPriorAbsoluteError(), 0.01);\n assertEquals(0.0, evaluation1.totalCost(), 0.01);\n assertEquals(Double.NaN, evaluation1.errorRate(), 0.01);\n assertEquals(0.0, evaluation1.SFEntropyGain(), 0.01);\n assertEquals(Double.NaN, evaluation1.rootMeanPriorSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation1.SFMeanEntropyGain(), 0.01);\n assertEquals(0.0, evaluation1.correct(), 0.01);\n assertFalse(evaluation1.getDiscardPredictions());\n assertEquals(Double.NaN, evaluation1.coverageOfTestCasesByPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation1.rootMeanSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation1.relativeAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation1.SFMeanSchemeEntropy(), 0.01);\n assertEquals(0.0, evaluation1.SFSchemeEntropy(), 0.01);\n assertEquals(0.0, evaluation1.numInstances(), 0.01);\n assertEquals(Double.NaN, evaluation1.pctUnclassified(), 0.01);\n assertEquals(Double.NaN, evaluation1.pctCorrect(), 0.01);\n assertEquals(0.0, evaluation1.unclassified(), 0.01);\n assertEquals(Double.NaN, evaluation1.sizeOfPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation1.rootRelativeSquaredError(), 0.01);\n \n String string0 = sMOreg0.toString();\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertNotNull(string0);\n assertEquals(\"SMOreg: No model built yet.\", string0);\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n \n double double0 = evaluation0.correlationCoefficient();\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertTrue(evaluation0.equals((Object)evaluation1));\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertEquals(Double.NaN, double0, 0.01);\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertEquals(0, testInstances1.getClassType());\n assertFalse(testInstances1.getNoClass());\n assertEquals((-1), testInstances1.getClassIndex());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(1, testInstances1.getSeed());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertFalse(testInstances1.getMultiInstance());\n assertEquals(3, instances0.numAttributes());\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(2, instances0.classIndex());\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(1, instances0.numClasses());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertEquals(20, instances0.size());\n assertEquals(20, instances0.numInstances());\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\n assertEquals(0.0, evaluation0.correct(), 0.01);\n assertFalse(evaluation0.getDiscardPredictions());\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFEntropyGain(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFPriorEntropy(), 0.01);\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\n assertNotSame(testInstances1, testInstances0);\n assertNotSame(evaluation0, evaluation1);\n \n double double1 = evaluation0.SFMeanEntropyGain();\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertTrue(evaluation0.equals((Object)evaluation1));\n assertEquals(double1, double0, 0.01);\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertEquals(Double.NaN, double1, 0.01);\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertEquals(0, testInstances1.getClassType());\n assertFalse(testInstances1.getNoClass());\n assertEquals((-1), testInstances1.getClassIndex());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(1, testInstances1.getSeed());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertFalse(testInstances1.getMultiInstance());\n assertEquals(3, instances0.numAttributes());\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(2, instances0.classIndex());\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(1, instances0.numClasses());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertEquals(20, instances0.size());\n assertEquals(20, instances0.numInstances());\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\n assertEquals(0.0, evaluation0.correct(), 0.01);\n assertFalse(evaluation0.getDiscardPredictions());\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFEntropyGain(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFPriorEntropy(), 0.01);\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\n assertNotSame(testInstances1, testInstances0);\n assertNotSame(evaluation0, evaluation1);\n }","title":""},{"docid":"b66ab4b5d8d01e16840a547b07de5d68","score":"0.59196484","text":"@Test(timeout = 4000)\n public void test01() throws Throwable {\n Discretize discretize0 = new Discretize();\n String string0 = discretize0.getRevision();\n assertEquals((-1.0), discretize0.getDesiredWeightOfInstancesPerInterval(), 0.01);\n assertFalse(discretize0.getUseBinNumbers());\n assertFalse(discretize0.getUseEqualFrequency());\n assertEquals(\"8964\", string0);\n assertFalse(discretize0.getFindNumBins());\n assertEquals(10, discretize0.getBins());\n assertFalse(discretize0.getMakeBinary());\n }","title":""},{"docid":"143019379099c6c9b60add3e4bdb1705","score":"0.59189874","text":"@Test(timeout = 4000)\n public void test09() throws Throwable {\n JRip jRip0 = new JRip();\n jRip0.debugTipText();\n AbstractClassifier.makeCopies(jRip0, 78);\n jRip0.getCheckErrorRate();\n jRip0.setCheckErrorRate(true);\n int int0 = 200003;\n BinarySparseInstance binarySparseInstance0 = new BinarySparseInstance(200003);\n }","title":""},{"docid":"798275cc0bedd7cabeb6932ec6ff8969","score":"0.59171474","text":"@Test(timeout = 4000)\n public void test14() throws Throwable {\n Discretize discretize0 = new Discretize(\"\");\n discretize0.m_IgnoreClass = true;\n discretize0.invertSelectionTipText();\n discretize0.getOptions();\n discretize0.getRevision();\n // Undeclared exception!\n try { \n discretize0.findNumBins(1989);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"weka.filters.unsupervised.attribute.Discretize\", e);\n }\n }","title":""},{"docid":"df953b339487772ea7c243195f8c5b8c","score":"0.5911588","text":"@Test(groups=\"10s\", timeOut=60000)\n\tpublic void test6(){\n\t\ttest(16,3,2,4,4,1);\n\t\ttest(32,3,2,2,3,0);\n\t}","title":""},{"docid":"c89c9c7f91a3caabf3cf81f5e860a611","score":"0.59093946","text":"@Test(timeout = 4000)\n public void test38() throws Throwable {\n Discretize discretize0 = new Discretize();\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\n Attribute attribute0 = new Attribute(\"Number of bins.\", 1461);\n arrayList0.add(attribute0);\n UnaryOperator.identity();\n Instances instances0 = new Instances(\"Number of bins.\", arrayList0, 0);\n discretize0.setInputFormat(instances0);\n discretize0.batchFinished();\n SparseInstance sparseInstance0 = new SparseInstance(0);\n SparseInstance sparseInstance1 = new SparseInstance((Instance) sparseInstance0);\n discretize0.input(sparseInstance1);\n discretize0.input(sparseInstance1);\n discretize0.calculateCutPoints();\n assertFalse(discretize0.isNewBatch());\n }","title":""},{"docid":"3ad7d4cf5f4d5635de0be5902084f262","score":"0.58993185","text":"@Test(timeout = 4000)\n public void test05() throws Throwable {\n Discretize discretize0 = new Discretize();\n discretize0.m_UseBinNumbers = false;\n discretize0.getCapabilities();\n discretize0.globalInfo();\n discretize0.setUseBinNumbers(true);\n assertTrue(discretize0.getUseBinNumbers());\n }","title":""},{"docid":"f17ad1cc43c1a5659a39c62a88027e03","score":"0.5890477","text":"public void testCalculateStatsReasonableCase() {\n int nodeId = 0;\n DiscoveryNodes.Builder discoBuilder = DiscoveryNodes.builder();\n DiscoveryNode leader = newNode(nodeId++, DiscoveryNodeRole.MASTER_ROLE);\n discoBuilder.add(leader);\n discoBuilder.masterNodeId(leader.getId());\n\n DiscoveryNode hotNode1 = newNode(nodeId++, DiscoveryNodeRole.DATA_HOT_NODE_ROLE);\n discoBuilder.add(hotNode1);\n DiscoveryNode hotNode2 = newNode(nodeId++, DiscoveryNodeRole.DATA_HOT_NODE_ROLE);\n discoBuilder.add(hotNode2);\n DiscoveryNode hotNode3 = newNode(nodeId++, DiscoveryNodeRole.DATA_HOT_NODE_ROLE);\n discoBuilder.add(hotNode3);\n DiscoveryNode warmNode1 = newNode(nodeId++, DiscoveryNodeRole.DATA_WARM_NODE_ROLE);\n discoBuilder.add(warmNode1);\n DiscoveryNode warmNode2 = newNode(nodeId++, DiscoveryNodeRole.DATA_WARM_NODE_ROLE);\n discoBuilder.add(warmNode2);\n DiscoveryNode warmNode3 = newNode(nodeId++, DiscoveryNodeRole.DATA_WARM_NODE_ROLE);\n discoBuilder.add(warmNode3);\n DiscoveryNode warmNode4 = newNode(nodeId++, DiscoveryNodeRole.DATA_WARM_NODE_ROLE);\n discoBuilder.add(warmNode4);\n DiscoveryNode warmNode5 = newNode(nodeId++, DiscoveryNodeRole.DATA_WARM_NODE_ROLE);\n discoBuilder.add(warmNode5);\n DiscoveryNode coldNode1 = newNode(nodeId, DiscoveryNodeRole.DATA_COLD_NODE_ROLE);\n discoBuilder.add(coldNode1);\n\n discoBuilder.localNodeId(hotNode1.getId());\n\n // Indices: 1 Hot index, 2 Warm indices, 3 Cold indices\n Metadata.Builder metadataBuilder = Metadata.builder();\n RoutingTable.Builder routingTableBuilder = RoutingTable.builder();\n\n IndexMetadata hotIndex1 = indexMetadata(\"hot_index_1\", 3, 1, DataTier.DATA_HOT);\n metadataBuilder.put(hotIndex1, false).generateClusterUuidIfNeeded();\n {\n IndexRoutingTable.Builder indexRoutingTableBuilder = IndexRoutingTable.builder(hotIndex1.getIndex());\n routeTestShardToNodes(hotIndex1, 0, indexRoutingTableBuilder, hotNode1, hotNode2);\n routeTestShardToNodes(hotIndex1, 1, indexRoutingTableBuilder, hotNode2, hotNode3);\n routeTestShardToNodes(hotIndex1, 2, indexRoutingTableBuilder, hotNode3, hotNode1);\n routingTableBuilder.add(indexRoutingTableBuilder.build());\n }\n\n IndexMetadata warmIndex1 = indexMetadata(\"warm_index_1\", 1, 1, DataTier.DATA_WARM);\n metadataBuilder.put(warmIndex1, false).generateClusterUuidIfNeeded();\n {\n IndexRoutingTable.Builder indexRoutingTableBuilder = IndexRoutingTable.builder(warmIndex1.getIndex());\n routeTestShardToNodes(warmIndex1, 0, indexRoutingTableBuilder, warmNode1, warmNode2);\n routingTableBuilder.add(indexRoutingTableBuilder.build());\n }\n IndexMetadata warmIndex2 = indexMetadata(\"warm_index_2\", 1, 1, DataTier.DATA_WARM);\n metadataBuilder.put(warmIndex2, false).generateClusterUuidIfNeeded();\n {\n IndexRoutingTable.Builder indexRoutingTableBuilder = IndexRoutingTable.builder(warmIndex2.getIndex());\n routeTestShardToNodes(warmIndex2, 0, indexRoutingTableBuilder, warmNode3, warmNode4);\n routingTableBuilder.add(indexRoutingTableBuilder.build());\n }\n\n IndexMetadata coldIndex1 = indexMetadata(\"cold_index_1\", 1, 0, DataTier.DATA_COLD);\n metadataBuilder.put(coldIndex1, false).generateClusterUuidIfNeeded();\n {\n IndexRoutingTable.Builder indexRoutingTableBuilder = IndexRoutingTable.builder(coldIndex1.getIndex());\n routeTestShardToNodes(coldIndex1, 0, indexRoutingTableBuilder, coldNode1);\n routingTableBuilder.add(indexRoutingTableBuilder.build());\n }\n IndexMetadata coldIndex2 = indexMetadata(\"cold_index_2\", 1, 0, DataTier.DATA_COLD);\n metadataBuilder.put(coldIndex2, false).generateClusterUuidIfNeeded();\n {\n IndexRoutingTable.Builder indexRoutingTableBuilder = IndexRoutingTable.builder(coldIndex2.getIndex());\n routeTestShardToNodes(coldIndex2, 0, indexRoutingTableBuilder, coldNode1);\n routingTableBuilder.add(indexRoutingTableBuilder.build());\n }\n IndexMetadata coldIndex3 = indexMetadata(\"cold_index_3\", 1, 0, DataTier.DATA_COLD);\n metadataBuilder.put(coldIndex3, false).generateClusterUuidIfNeeded();\n {\n IndexRoutingTable.Builder indexRoutingTableBuilder = IndexRoutingTable.builder(coldIndex3.getIndex());\n routeTestShardToNodes(coldIndex3, 0, indexRoutingTableBuilder, coldNode1);\n routingTableBuilder.add(indexRoutingTableBuilder.build());\n }\n\n // Cluster State and create stats responses\n ClusterState clusterState = ClusterState.builder(new ClusterName(\"test\"))\n .nodes(discoBuilder)\n .metadata(metadataBuilder)\n .routingTable(routingTableBuilder.build())\n .build();\n\n long byteSize = randomLongBetween(1024L, 1024L * 1024L * 1024L * 30L); // 1 KB to 30 GB\n long docCount = randomLongBetween(100L, 100000000L); // one hundred to one hundred million\n List<NodeStats> nodeStatsList = buildNodeStats(clusterState, byteSize, docCount);\n\n // Calculate usage\n Map<String, String> indexByTier = DataTiersUsageTransportAction.tierIndices(clusterState.metadata().indices());\n Map<String, DataTiersFeatureSetUsage.TierSpecificStats> tierSpecificStats = DataTiersUsageTransportAction.calculateStats(\n nodeStatsList,\n indexByTier,\n clusterState.getRoutingNodes()\n );\n\n // Verify - Node and Index stats are both collected\n assertThat(tierSpecificStats.size(), is(3));\n\n DataTiersFeatureSetUsage.TierSpecificStats hotStats = tierSpecificStats.get(DataTier.DATA_HOT);\n assertThat(hotStats, is(notNullValue()));\n assertThat(hotStats.nodeCount, is(3));\n assertThat(hotStats.indexCount, is(1));\n assertThat(hotStats.totalShardCount, is(6));\n assertThat(hotStats.docCount, is(6 * docCount));\n assertThat(hotStats.totalByteCount, is(6 * byteSize));\n assertThat(hotStats.primaryShardCount, is(3));\n assertThat(hotStats.primaryByteCount, is(3 * byteSize));\n assertThat(hotStats.primaryByteCountMedian, is(byteSize)); // All same size\n assertThat(hotStats.primaryShardBytesMAD, is(0L)); // All same size\n\n DataTiersFeatureSetUsage.TierSpecificStats warmStats = tierSpecificStats.get(DataTier.DATA_WARM);\n assertThat(warmStats, is(notNullValue()));\n assertThat(warmStats.nodeCount, is(5));\n assertThat(warmStats.indexCount, is(2));\n assertThat(warmStats.totalShardCount, is(4));\n assertThat(warmStats.docCount, is(4 * docCount));\n assertThat(warmStats.totalByteCount, is(4 * byteSize));\n assertThat(warmStats.primaryShardCount, is(2));\n assertThat(warmStats.primaryByteCount, is(2 * byteSize));\n assertThat(warmStats.primaryByteCountMedian, is(byteSize)); // All same size\n assertThat(warmStats.primaryShardBytesMAD, is(0L)); // All same size\n\n DataTiersFeatureSetUsage.TierSpecificStats coldStats = tierSpecificStats.get(DataTier.DATA_COLD);\n assertThat(coldStats, is(notNullValue()));\n assertThat(coldStats.nodeCount, is(1));\n assertThat(coldStats.indexCount, is(3));\n assertThat(coldStats.totalShardCount, is(3));\n assertThat(coldStats.docCount, is(3 * docCount));\n assertThat(coldStats.totalByteCount, is(3 * byteSize));\n assertThat(coldStats.primaryShardCount, is(3));\n assertThat(coldStats.primaryByteCount, is(3 * byteSize));\n assertThat(coldStats.primaryByteCountMedian, is(byteSize)); // All same size\n assertThat(coldStats.primaryShardBytesMAD, is(0L)); // All same size\n }","title":""},{"docid":"1738af4ce415f19f84d0b2aa1935d721","score":"0.5889058","text":"@Test(timeout = 4000)\n public void test01() throws Throwable {\n String string0 = \"\";\n Discretize discretize0 = new Discretize(\"\");\n Range range0 = new Range();\n discretize0.m_DiscretizeCols = range0;\n discretize0.getCapabilities();\n double double0 = (-3169.352147658);\n discretize0.setDesiredWeightOfInstancesPerInterval((-3169.352147658));\n discretize0.getInvertSelection();\n discretize0.listOptions();\n int int0 = 0;\n discretize0.setBins(1324);\n discretize0.getBinRangesString(0);\n // Undeclared exception!\n try { \n discretize0.calculateCutPointsByEqualWidthBinning(0);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"weka.filters.unsupervised.attribute.Discretize\", e);\n }\n }","title":""},{"docid":"9a984fcd2004751febc49a766fc1cb4d","score":"0.5860569","text":"@Test(timeout = 4000)\n public void test79() throws Throwable {\n TestInstances testInstances0 = new TestInstances();\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertNotNull(testInstances0);\n assertEquals(0, testInstances0.getNumRelationalDate());\n assertEquals(2, testInstances0.getNumClasses());\n assertEquals(0, testInstances0.getNumNumeric());\n assertEquals(2, testInstances0.getNumAttributes());\n assertEquals(0, testInstances0.getNumRelational());\n assertEquals(0, testInstances0.getNumString());\n assertFalse(testInstances0.getNoClass());\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\n assertEquals((-1), testInstances0.getClassIndex());\n assertEquals(\" \", testInstances0.getWordSeparators());\n assertEquals(0, testInstances0.getNumRelationalNumeric());\n assertEquals(\"Testdata\", testInstances0.getRelation());\n assertEquals(0, testInstances0.getNumRelationalString());\n assertEquals(0, testInstances0.getNumDate());\n assertEquals(1, testInstances0.getClassType());\n assertEquals(2, testInstances0.getNumNominalValues());\n assertEquals(1, testInstances0.getNumNominal());\n assertEquals(20, testInstances0.getNumInstances());\n assertFalse(testInstances0.getMultiInstance());\n assertEquals(10, testInstances0.getNumInstancesRelational());\n assertEquals(1, testInstances0.getNumRelationalNominal());\n assertEquals(1, testInstances0.getSeed());\n \n SMOreg sMOreg0 = new SMOreg();\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertNotNull(sMOreg0);\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n \n Capabilities capabilities0 = sMOreg0.getCapabilities();\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertNotNull(capabilities0);\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n \n TestInstances testInstances1 = TestInstances.forCapabilities(capabilities0);\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertNotNull(testInstances1);\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals(1, testInstances1.getSeed());\n assertFalse(testInstances1.getMultiInstance());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getClassType());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals((-1), testInstances1.getClassIndex());\n assertFalse(testInstances1.getNoClass());\n assertNotSame(testInstances1, testInstances0);\n \n Instances instances0 = testInstances1.generate(\"X/\\\\\");\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertNotNull(instances0);\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals(1, testInstances1.getSeed());\n assertFalse(testInstances1.getMultiInstance());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getClassType());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals((-1), testInstances1.getClassIndex());\n assertFalse(testInstances1.getNoClass());\n assertEquals(20, instances0.numInstances());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(20, instances0.size());\n assertEquals(3, instances0.numAttributes());\n assertEquals(2, instances0.classIndex());\n assertEquals(1, instances0.numClasses());\n assertEquals(\"Testdata\", instances0.relationName());\n assertNotSame(testInstances1, testInstances0);\n \n Evaluation evaluation0 = new Evaluation(instances0);\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertNotNull(evaluation0);\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals(1, testInstances1.getSeed());\n assertFalse(testInstances1.getMultiInstance());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getClassType());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals((-1), testInstances1.getClassIndex());\n assertFalse(testInstances1.getNoClass());\n assertEquals(20, instances0.numInstances());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(20, instances0.size());\n assertEquals(3, instances0.numAttributes());\n assertEquals(2, instances0.classIndex());\n assertEquals(1, instances0.numClasses());\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\n assertEquals(0.0, evaluation0.correct(), 0.01);\n assertFalse(evaluation0.getDiscardPredictions());\n \n String string0 = sMOreg0.toString();\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertNotNull(string0);\n assertEquals(\"SMOreg: No model built yet.\", string0);\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n \n char[] charArray0 = new char[8];\n charArray0[0] = 'i';\n charArray0[1] = '!';\n charArray0[2] = '!';\n charArray0[3] = 'm';\n charArray0[4] = ',';\n charArray0[5] = 'S';\n charArray0[6] = 'f';\n charArray0[7] = '(';\n String string1 = evaluation0.num2ShortID((-1591), charArray0, 0);\n assertFalse(string1.equals((Object)string0));\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertArrayEquals(new char[] {'i', '!', '!', 'm', ',', 'S', 'f', '('}, charArray0);\n assertNotNull(string1);\n assertEquals(\"\", string1);\n assertEquals(8, charArray0.length);\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals(1, testInstances1.getSeed());\n assertFalse(testInstances1.getMultiInstance());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getClassType());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals((-1), testInstances1.getClassIndex());\n assertFalse(testInstances1.getNoClass());\n assertEquals(20, instances0.numInstances());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(20, instances0.size());\n assertEquals(3, instances0.numAttributes());\n assertEquals(2, instances0.classIndex());\n assertEquals(1, instances0.numClasses());\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\n assertEquals(0.0, evaluation0.correct(), 0.01);\n assertFalse(evaluation0.getDiscardPredictions());\n assertNotSame(testInstances1, testInstances0);\n \n double double0 = (-2.0);\n LibSVMLoader libSVMLoader0 = new LibSVMLoader();\n assertNotNull(libSVMLoader0);\n assertEquals(\"libsvm data files\", libSVMLoader0.getFileDescription());\n assertEquals(\".libsvm\", libSVMLoader0.getFileExtension());\n assertEquals(\"http://\", libSVMLoader0.retrieveURL());\n assertFalse(libSVMLoader0.getUseRelativePath());\n assertEquals(\"Use relative rather than absolute paths\", libSVMLoader0.useRelativePathTipText());\n assertEquals(\"Reads a source that is in libsvm format.\\n\\nFor more information about libsvm see:\\n\\nhttp://www.csie.ntu.edu.tw/~cjlin/libsvm/\", libSVMLoader0.globalInfo());\n \n try { \n libSVMLoader0.getNextInstance(instances0);\n fail(\"Expecting exception: IOException\");\n \n } catch(IOException e) {\n //\n // LibSVMLoader can't read data sets incrementally.\n //\n verifyException(\"weka.core.converters.LibSVMLoader\", e);\n }\n }","title":""},{"docid":"b0dbe56070fc12d30ff378e2cb9f5c15","score":"0.5855894","text":"public void testRCo() {\n\t\tFile projectDir = new File(testDirectoryPath);\n\t\t\n\t\tDirExplorer.Filter javaFilter = new JavaFilter();\n\t\tDirExplorer.FileHandler sourceFileHandler = new SingleMetricFileHandler(projectDir, new NoHExtractor());\n\t\t\n\t\tnew DirExplorer(javaFilter, sourceFileHandler).explore(projectDir);\t\t\n\t\t\n\t\tAssert.assertEquals(2.0/8, MeasureDataset.getMeasure(\"NoHTest\", MetricSuite.NoH));\n\t}","title":""},{"docid":"05b0e482e2b6c9b1d7c3ff915921cac2","score":"0.58547693","text":"@Test(timeout = 4000)\n public void test12() throws Throwable {\n JRip jRip0 = new JRip();\n LinkedList<String> linkedList0 = new LinkedList<String>();\n Attribute attribute0 = new Attribute(\"49CkIL.|l=bjwvi\", linkedList0);\n JRip.NumericAntd jRip_NumericAntd0 = jRip0.new NumericAntd(attribute0);\n jRip_NumericAntd0.getRevision();\n JRip.RipperRule jRip_RipperRule0 = jRip0.new RipperRule();\n jRip_RipperRule0.setConsequent(2);\n assertEquals(2.0, jRip_RipperRule0.getConsequent(), 0.01);\n }","title":""},{"docid":"dece273f3ac59033f48f65a6dd569488","score":"0.58538","text":"@Test(timeout = 4000)\n public void test18() throws Throwable {\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\n Instances instances0 = textDirectoryLoader0.getStructure();\n MockRandom mockRandom0 = new MockRandom(0L);\n instances0.randomize(mockRandom0);\n Evaluation evaluation0 = new Evaluation(instances0);\n evaluation0.getDiscardPredictions();\n double double0 = evaluation0.KBRelativeInformation();\n evaluation0.m_TrainClassWeights = null;\n double double1 = evaluation0.fMeasure(3);\n assertEquals(0.0, double1, 0.01);\n \n double double2 = evaluation0.weightedFalseNegativeRate();\n assertEquals(double2, double0, 0.01);\n assertEquals(Double.NaN, double2, 0.01);\n }","title":""},{"docid":"848831e37816f54984642c335e048562","score":"0.5853747","text":"@Test(timeout = 4000)\n public void test24() throws Throwable {\n Discretize discretize0 = new Discretize();\n double[][] doubleArray0 = new double[15][1];\n Discretize discretize1 = new Discretize();\n discretize0.m_CutPoints = doubleArray0;\n String string0 = discretize0.getBinRangesString(12);\n assertEquals(10, discretize0.getBins());\n assertFalse(discretize0.getUseBinNumbers());\n assertEquals(\"(-inf-0],(0-inf)\", string0);\n assertFalse(discretize0.getMakeBinary());\n assertEquals((-1.0), discretize0.getDesiredWeightOfInstancesPerInterval(), 0.01);\n }","title":""},{"docid":"5dca8706f8f172e6a41a8b99bb0b6549","score":"0.58527625","text":"@Test(timeout = 4000)\n public void test16() throws Throwable {\n NucleotideSequence nucleotideSequence0 = mock(NucleotideSequence.class, new ViolatedAssumptionAnswer());\n doReturn(175L).when(nucleotideSequence0).getLength();\n QualitySequence qualitySequence0 = mock(QualitySequence.class, new ViolatedAssumptionAnswer());\n doReturn(175L).when(qualitySequence0).getLength();\n PositionSequence positionSequence0 = mock(PositionSequence.class, new ViolatedAssumptionAnswer());\n DefaultPhd defaultPhd0 = new DefaultPhd(\"\", nucleotideSequence0, qualitySequence0, positionSequence0);\n Map<String, String> map0 = defaultPhd0.getComments();\n ArtificialPhd artificialPhd0 = ArtificialPhd.createNewbler454Phd(\"R5TB\", nucleotideSequence0, qualitySequence0, map0);\n PositionSequence positionSequence1 = artificialPhd0.getPositionSequence();\n DefaultPhd defaultPhd1 = new DefaultPhd(\"R5TB\", nucleotideSequence0, qualitySequence0, positionSequence1, map0);\n PhdBuilder phdBuilder0 = new PhdBuilder(defaultPhd0);\n phdBuilder0.peaks(positionSequence1);\n byte[] byteArray0 = new byte[5];\n byteArray0[0] = (byte) (-68);\n byteArray0[1] = (byte)111;\n byteArray0[2] = (byte) (-4);\n byteArray0[3] = (byte)15;\n byteArray0[4] = (byte)19;\n short[] shortArray0 = new short[6];\n shortArray0[0] = (short) (byte) (-68);\n shortArray0[2] = (short) (byte) (-68);\n shortArray0[3] = (short) (byte) (-68);\n shortArray0[4] = (short) (byte)15;\n shortArray0[5] = (short) (byte)111;\n NucleotideSequence nucleotideSequence1 = mock(NucleotideSequence.class, new ViolatedAssumptionAnswer());\n QualitySequence qualitySequence1 = mock(QualitySequence.class, new ViolatedAssumptionAnswer());\n doReturn(0L, 0L, 0L, 0L).when(qualitySequence1).getLength();\n DefaultChannel defaultChannel0 = new DefaultChannel(qualitySequence1, positionSequence1);\n DefaultChannelGroup defaultChannelGroup0 = new DefaultChannelGroup(defaultChannel0, defaultChannel0, defaultChannel0, defaultChannel0);\n BasicChromatogram basicChromatogram0 = new BasicChromatogram(\"etPR7P\\\"dO\", nucleotideSequence1, qualitySequence1, positionSequence1, defaultChannelGroup0);\n PhdBuilder phdBuilder1 = new PhdBuilder(basicChromatogram0);\n BasicChromatogram basicChromatogram1 = null;\n try {\n basicChromatogram1 = new BasicChromatogram(\"\", \"\", byteArray0, positionSequence1, defaultChannelGroup0, map0);\n fail(\"Expecting exception: IllegalArgumentException\");\n \n } catch(IllegalArgumentException e) {\n //\n // qualityScore of our range -68\n //\n verifyException(\"org.jcvi.jillion.core.qual.PhredQuality\", e);\n }\n }","title":""},{"docid":"f348c86b4f7be1904cd3e1509f25e6b8","score":"0.5845019","text":"@Test(timeout = 4000)\n public void test12() throws Throwable {\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\n Instances instances0 = textDirectoryLoader0.getStructure();\n String[] stringArray0 = new String[6];\n stringArray0[0] = \".bsi\";\n stringArray0[1] = \".arff\";\n stringArray0[2] = \"@data\";\n stringArray0[3] = \" public Capabilities getCapabilities() {\\n\";\n stringArray0[4] = \"@data\";\n stringArray0[5] = \".arff\";\n textDirectoryLoader0.setOptions(stringArray0);\n Evaluation evaluation0 = new Evaluation(instances0);\n double double0 = evaluation0.weightedAreaUnderROC();\n double double1 = evaluation0.avgCost();\n assertEquals(double1, double0, 0.01);\n assertEquals(Double.NaN, double1, 0.01);\n }","title":""},{"docid":"3236cd49e0c488ae17a1ea545f1575ba","score":"0.5840496","text":"@Test(timeout = 4000)\n public void test09() throws Throwable {\n Discretize discretize0 = new Discretize();\n discretize0.setIgnoreClass(true);\n discretize0.m_NumBins = 115;\n discretize0.setOutputFormat();\n discretize0.setInvertSelection(false);\n discretize0.setUseBinNumbers(true);\n Filter.runFilter(discretize0, (String[]) null);\n discretize0.setIgnoreClass(true);\n discretize0.binsTipText();\n discretize0.invertSelectionTipText();\n double[] doubleArray0 = new double[8];\n doubleArray0[0] = (double) 115;\n doubleArray0[1] = (double) 115;\n doubleArray0[2] = (double) 115;\n doubleArray0[3] = (double) 10;\n doubleArray0[4] = (double) 10;\n doubleArray0[5] = (double) 10;\n doubleArray0[6] = 1349.216915;\n doubleArray0[7] = 1349.216915;\n SparseInstance sparseInstance0 = new SparseInstance(1349.216915, doubleArray0);\n BinarySparseInstance binarySparseInstance0 = new BinarySparseInstance((Instance) sparseInstance0);\n SparseInstance sparseInstance1 = new SparseInstance((Instance) binarySparseInstance0);\n discretize0.useEqualFrequencyTipText();\n discretize0.makeBinaryTipText();\n discretize0.setAttributeIndices(\"If set to true, equal-frequency binning will be used instead of equal-width binning.\");\n discretize0.getInvertSelection();\n // Undeclared exception!\n try { \n discretize0.calculateCutPointsByEqualWidthBinning((-2049));\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"weka.filters.unsupervised.attribute.Discretize\", e);\n }\n }","title":""},{"docid":"063aa340960b8168bce15f35d502cc87","score":"0.58318055","text":"@Test(timeout = 4000)\n public void test02() throws Throwable {\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer();\n String string0 = makeDensityBasedClusterer0.clustererTipText();\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\n assertEquals(\"the clusterer to wrap\", string0);\n }","title":""},{"docid":"2c9fb4f30ab3b8ca6244c6d06a531c49","score":"0.5829034","text":"@Test(timeout = 4000)\n public void test16() throws Throwable {\n FileSystemHandling.setPermissions((EvoSuiteFile) null, false, false, true);\n FileSystemHandling.shouldAllThrowIOExceptions();\n Discretize discretize0 = new Discretize();\n assertFalse(discretize0.getFindNumBins());\n \n discretize0.m_FindNumBins = true;\n discretize0.getOptions();\n assertTrue(discretize0.getFindNumBins());\n }","title":""},{"docid":"fe451d4b4f23e18e94f915edad76f3d4","score":"0.5821665","text":"@Test(timeout = 4000)\n public void test19() throws Throwable {\n JRip jRip0 = new JRip();\n jRip0.getOptions();\n int int0 = 0;\n jRip0.setFolds(0);\n Utils.log2 = (double) 0;\n JRip jRip1 = (JRip)AbstractClassifier.makeCopy(jRip0);\n jRip1.enumerateMeasures();\n jRip1.getUsePruning();\n try { \n jRip0.buildClassifier((Instances) null);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"weka.core.Capabilities\", e);\n }\n }","title":""},{"docid":"e8fdb4cf6f6d9303c65a72c82db45c8c","score":"0.58149165","text":"@Test(timeout = 4000)\n public void test30() throws Throwable {\n JRip jRip0 = new JRip();\n Attribute attribute0 = new Attribute(\"eus|D4*|\", \"\");\n JRip.RipperRule jRip_RipperRule0 = jRip0.new RipperRule();\n JRip.RipperRule jRip_RipperRule1 = jRip0.new RipperRule();\n assertEquals((-1.0), jRip_RipperRule1.getConsequent(), 0.01);\n \n JRip.NumericAntd jRip_NumericAntd0 = jRip0.new NumericAntd(attribute0);\n JRip.NumericAntd jRip_NumericAntd1 = (JRip.NumericAntd)jRip_NumericAntd0.copy();\n assertEquals(3, jRip0.getFolds());\n assertEquals(2, jRip0.getOptimizations());\n assertEquals(2.0, jRip0.getMinNo(), 0.01);\n assertEquals(Double.NaN, jRip_NumericAntd1.getAccu(), 0.01);\n assertEquals(Double.NaN, jRip_NumericAntd1.getAccuRate(), 0.01);\n assertTrue(jRip0.getCheckErrorRate());\n assertNotSame(jRip_NumericAntd1, jRip_NumericAntd0);\n assertEquals(1L, jRip0.getSeed());\n assertTrue(jRip0.getUsePruning());\n assertEquals(Double.NaN, jRip_NumericAntd1.getAttrValue(), 0.01);\n assertEquals(0.0, jRip_NumericAntd1.getMaxInfoGain(), 0.01);\n assertFalse(jRip0.getDebug());\n assertEquals(Double.NaN, jRip_NumericAntd1.getCover(), 0.01);\n assertEquals(Double.NaN, jRip_NumericAntd1.getSplitPoint(), 0.01);\n }","title":""},{"docid":"eb0c9396d136499a757120e134a8e000","score":"0.5814749","text":"@Test\n public void testGetCounterCode() {\n System.out.println(\"getCounterCode\");\n Simulation instance = new Simulation();\n int expResult = instance.getCounterCode();\n int result = instance.getCounterCode();\n assertEquals(expResult, result);\n }","title":""},{"docid":"bb58c1e63e9f6280b718bec09919c374","score":"0.58145565","text":"@Test(timeout = 4000)\n public void test17() throws Throwable {\n Discretize discretize0 = new Discretize();\n String[] stringArray0 = new String[6];\n stringArray0[0] = \"u?4!4@63BR]xDvOG}*\";\n stringArray0[1] = \"zH$v#KP\";\n stringArray0[2] = \"Pn2VY2VAsU+.h0W\";\n stringArray0[3] = \"g-$I's_z@{'\";\n stringArray0[4] = \"-R\";\n stringArray0[5] = \"d7i`V\";\n discretize0.setOptions(stringArray0);\n assertFalse(discretize0.getUseEqualFrequency());\n assertFalse(discretize0.getMakeBinary());\n assertFalse(discretize0.getFindNumBins());\n assertEquals((-1.0), discretize0.getDesiredWeightOfInstancesPerInterval(), 0.01);\n assertEquals(10, discretize0.getBins());\n assertFalse(discretize0.getUseBinNumbers());\n }","title":""},{"docid":"3e0e5273a2439ee9791ba5aeb2e81fd4","score":"0.58081084","text":"@Test\n public void TestTopBottomN() {\n Scope.enter();\n double[] checkPercent = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; //, 11, 12, 13, 14, 15, 17, 19}; // complete test\n int numRuns = 1;\n double testPercent = 0; // store test percentage\n Frame topLong = null, topFloat = null, bottomLong = null, bottomFloat = null;\n\n // load in the datasets with the answers\n _train = parseTestFile(Key.make(\"topbottom\"), \"smalldata/jira/TopBottomN.csv.zip\");\n topFloat = parseTestFile(Key.make(\"top20\"), \"smalldata/jira/Top20Per.csv.zip\");\n topLong = topFloat.extractFrame(0, 1);\n bottomFloat = parseTestFile(Key.make(\"bottom20\"), \"smalldata/jira/Bottom20Per.csv.zip\");\n bottomLong = bottomFloat.extractFrame(0, 1);\n\n Scope.track(_train);\n Scope.track(topLong);\n Scope.track(topFloat);\n Scope.track(bottomFloat);\n Scope.track(bottomLong);\n\n try {\n for (int index = 0; index < numRuns; index++) { // randomly choose 4 percentages to test\n testPercent = checkPercent[_rand.nextInt(checkPercent.length)];\n int testNo = _rand.nextInt(4);\n Log.info(\"Percentage is \" + testPercent);\n if (testNo == 0) {\n Log.info(\"Testing top N long.\");\n testTopBottom(topLong, testPercent, 1, \"0\", _tolerance);\n }\n if (testNo == 1) {\n Log.info(\"Testing top N float.\");\n testTopBottom(topFloat, testPercent, 1, \"1\", _tolerance); // test top % Float\n }\n if (testNo == 2) {\n Log.info(\"Testing bottom N long.\");\n testTopBottom(bottomLong, testPercent, -1, \"0\", _tolerance); // test bottom % Long\n }\n if (testNo == 3) {\n Log.info(\"Testing bottom N float.\");\n testTopBottom(bottomFloat, testPercent, -1, \"1\", _tolerance); // test bottom % Float\n }\n }\n } finally {\n Scope.exit();\n }\n }","title":""},{"docid":"6c4818ad3619a0ba133cb8394dde155f","score":"0.5805535","text":"@Test(timeout = 4000)\n public void test08() throws Throwable {\n Discretize discretize0 = new Discretize();\n discretize0.m_UseBinNumbers = false;\n discretize0.getCapabilities();\n discretize0.getCutPoints(1108);\n discretize0.setUseEqualFrequency(true);\n discretize0.getOptions();\n // Undeclared exception!\n try { \n discretize0.numPendingOutput();\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // No output instance format defined\n //\n verifyException(\"weka.filters.Filter\", e);\n }\n }","title":""},{"docid":"8025683fa29d449303f1e0ab6715aaa4","score":"0.580025","text":"@Test(timeout = 4000)\n public void test43() throws Throwable {\n Discretize discretize0 = new Discretize();\n Attribute attribute0 = new Attribute((String) null);\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\n arrayList0.add(attribute0);\n discretize0.m_IgnoreClass = true;\n Instances instances0 = new Instances(\"date\", arrayList0, 88);\n int int0 = discretize0.m_ClassIndex;\n discretize0.setInputFormat(instances0);\n discretize0.setBins(4595);\n discretize0.getFindNumBins();\n discretize0.setBins((-1));\n // Undeclared exception!\n try { \n discretize0.calculateCutPointsByEqualWidthBinning(2);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"weka.filters.unsupervised.attribute.Discretize\", e);\n }\n }","title":""},{"docid":"26bf6fe01e1f66495b24d77b67e2812d","score":"0.57926476","text":"@Test(timeout = 4000)\n public void test30() throws Throwable {\n Discretize discretize0 = new Discretize();\n EvoSuiteFile evoSuiteFile0 = new EvoSuiteFile(\"/home/ubuntu/wekafiles/props/Capabilities.props\");\n FileSystemHandling.appendStringToFile(evoSuiteFile0, \"O\");\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\n Attribute attribute0 = new Attribute(\"Number of bins.\", 1461);\n arrayList0.add(attribute0);\n Instances instances0 = new Instances(\"Number of bins.\", arrayList0, 1);\n discretize0.setInputFormat(instances0);\n double[] doubleArray0 = new double[3];\n int[] intArray0 = new int[9];\n intArray0[0] = 0;\n intArray0[1] = 3;\n intArray0[2] = 0;\n intArray0[3] = 0;\n intArray0[4] = 1461;\n intArray0[5] = 0;\n intArray0[6] = 0;\n intArray0[7] = 1461;\n intArray0[8] = 1;\n SparseInstance sparseInstance0 = new SparseInstance(1, doubleArray0, intArray0, 1);\n // Undeclared exception!\n try { \n discretize0.input(sparseInstance0);\n fail(\"Expecting exception: IllegalArgumentException\");\n \n } catch(IllegalArgumentException e) {\n //\n // Instance has no dataset assigned!!\n //\n verifyException(\"weka.core.RelationalLocator\", e);\n }\n }","title":""},{"docid":"3aeaa90e1e8975559ffcf79b63e6d6f3","score":"0.5790018","text":"@Test(timeout = 4000)\n public void test33() throws Throwable {\n Discretize discretize0 = new Discretize();\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\n Attribute attribute0 = new Attribute(\"Number of bins.\", 1461);\n arrayList0.add(attribute0);\n UnaryOperator.identity();\n Instances instances0 = new Instances(\"Number of bins.\", arrayList0, 1);\n discretize0.setInputFormat(instances0);\n discretize0.batchFinished();\n SparseInstance sparseInstance0 = new SparseInstance(0);\n SparseInstance sparseInstance1 = new SparseInstance((Instance) sparseInstance0);\n discretize0.input(sparseInstance1);\n discretize0.calculateCutPoints();\n // Undeclared exception!\n try { \n discretize0.findNumBins(1);\n fail(\"Expecting exception: ArrayIndexOutOfBoundsException\");\n \n } catch(ArrayIndexOutOfBoundsException e) {\n //\n // 1\n //\n verifyException(\"weka.filters.unsupervised.attribute.Discretize\", e);\n }\n }","title":""},{"docid":"e30940aeed4182ca0f6b3c820cac35a5","score":"0.57852906","text":"@Test(timeout = 4000)\n public void test47() throws Throwable {\n TestInstances testInstances0 = new TestInstances();\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertNotNull(testInstances0);\n assertEquals(2, testInstances0.getNumNominalValues());\n assertEquals(0, testInstances0.getNumDate());\n assertEquals(\" \", testInstances0.getWordSeparators());\n assertEquals(0, testInstances0.getNumRelationalNumeric());\n assertEquals(\"Testdata\", testInstances0.getRelation());\n assertEquals(20, testInstances0.getNumInstances());\n assertEquals(0, testInstances0.getNumRelationalString());\n assertEquals(1, testInstances0.getNumNominal());\n assertEquals(1, testInstances0.getClassType());\n assertEquals((-1), testInstances0.getClassIndex());\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\n assertFalse(testInstances0.getNoClass());\n assertEquals(2, testInstances0.getNumAttributes());\n assertEquals(0, testInstances0.getNumNumeric());\n assertEquals(0, testInstances0.getNumString());\n assertEquals(0, testInstances0.getNumRelationalDate());\n assertEquals(2, testInstances0.getNumClasses());\n assertEquals(0, testInstances0.getNumRelational());\n assertEquals(1, testInstances0.getSeed());\n assertEquals(1, testInstances0.getNumRelationalNominal());\n assertFalse(testInstances0.getMultiInstance());\n assertEquals(10, testInstances0.getNumInstancesRelational());\n \n SMOreg sMOreg0 = new SMOreg();\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertNotNull(sMOreg0);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n \n Capabilities capabilities0 = sMOreg0.getCapabilities();\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertNotNull(capabilities0);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n \n TestInstances testInstances1 = TestInstances.forCapabilities(capabilities0);\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertNotNull(testInstances1);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(0, testInstances1.getClassType());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals((-1), testInstances1.getClassIndex());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertFalse(testInstances1.getMultiInstance());\n assertFalse(testInstances1.getNoClass());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertEquals(1, testInstances1.getSeed());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertNotSame(testInstances1, testInstances0);\n \n Instances instances0 = testInstances1.generate(\"v5;/_&:;#I,\");\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertNotNull(instances0);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(0, testInstances1.getClassType());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals((-1), testInstances1.getClassIndex());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertFalse(testInstances1.getMultiInstance());\n assertFalse(testInstances1.getNoClass());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertEquals(1, testInstances1.getSeed());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(20, instances0.numInstances());\n assertEquals(1, instances0.numClasses());\n assertEquals(2, instances0.classIndex());\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(20, instances0.size());\n assertEquals(3, instances0.numAttributes());\n assertNotSame(testInstances1, testInstances0);\n \n Capabilities capabilities1 = capabilities0.getClassCapabilities();\n assertFalse(capabilities1.equals((Object)capabilities0));\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertNotNull(capabilities1);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertEquals(1, capabilities1.getMinimumNumberInstances());\n assertFalse(capabilities1.hasDependencies());\n assertNotSame(capabilities0, capabilities1);\n assertNotSame(capabilities1, capabilities0);\n \n CostSensitiveClassifier costSensitiveClassifier0 = new CostSensitiveClassifier();\n assertEquals(2, CostSensitiveClassifier.MATRIX_SUPPLIED);\n assertEquals(1, CostSensitiveClassifier.MATRIX_ON_DEMAND);\n assertNotNull(costSensitiveClassifier0);\n assertEquals(\"The base classifier to be used.\", costSensitiveClassifier0.classifierTipText());\n assertEquals(\"Sets the directory where cost files are loaded from. This option is used when the costMatrixSource is set to \\\"On Demand\\\".\", costSensitiveClassifier0.onDemandDirectoryTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", costSensitiveClassifier0.debugTipText());\n assertFalse(costSensitiveClassifier0.getMinimizeExpectedCost());\n assertEquals(1, costSensitiveClassifier0.getSeed());\n assertEquals(0, costSensitiveClassifier0.graphType());\n assertEquals(\"Sets the cost matrix explicitly. This matrix is used if the costMatrixSource property is set to \\\"Supplied\\\".\", costSensitiveClassifier0.costMatrixTipText());\n assertFalse(costSensitiveClassifier0.getDebug());\n assertEquals(\"A metaclassifier that makes its base classifier cost-sensitive. Two methods can be used to introduce cost-sensitivity: reweighting training instances according to the total cost assigned to each class; or predicting the class with minimum expected misclassification cost (rather than the most likely class). Performance can often be improved by using a Bagged classifier to improve the probability estimates of the base classifier.\", costSensitiveClassifier0.globalInfo());\n assertEquals(\"The random number seed to be used.\", costSensitiveClassifier0.seedTipText());\n assertEquals(\"Sets whether the minimum expected cost criteria will be used. If this is false, the training data will be reweighted according to the costs assigned to each class. If true, the minimum expected cost criteria will be used.\", costSensitiveClassifier0.minimizeExpectedCostTipText());\n \n CostMatrix costMatrix0 = costSensitiveClassifier0.getCostMatrix();\n assertEquals(2, CostSensitiveClassifier.MATRIX_SUPPLIED);\n assertEquals(1, CostSensitiveClassifier.MATRIX_ON_DEMAND);\n assertNotNull(costMatrix0);\n assertEquals(\"The base classifier to be used.\", costSensitiveClassifier0.classifierTipText());\n assertEquals(\"Sets the directory where cost files are loaded from. This option is used when the costMatrixSource is set to \\\"On Demand\\\".\", costSensitiveClassifier0.onDemandDirectoryTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", costSensitiveClassifier0.debugTipText());\n assertFalse(costSensitiveClassifier0.getMinimizeExpectedCost());\n assertEquals(1, costSensitiveClassifier0.getSeed());\n assertEquals(0, costSensitiveClassifier0.graphType());\n assertEquals(\"Sets the cost matrix explicitly. This matrix is used if the costMatrixSource property is set to \\\"Supplied\\\".\", costSensitiveClassifier0.costMatrixTipText());\n assertFalse(costSensitiveClassifier0.getDebug());\n assertEquals(\"A metaclassifier that makes its base classifier cost-sensitive. Two methods can be used to introduce cost-sensitivity: reweighting training instances according to the total cost assigned to each class; or predicting the class with minimum expected misclassification cost (rather than the most likely class). Performance can often be improved by using a Bagged classifier to improve the probability estimates of the base classifier.\", costSensitiveClassifier0.globalInfo());\n assertEquals(\"The random number seed to be used.\", costSensitiveClassifier0.seedTipText());\n assertEquals(\"Sets whether the minimum expected cost criteria will be used. If this is false, the training data will be reweighted according to the costs assigned to each class. If true, the minimum expected cost criteria will be used.\", costSensitiveClassifier0.minimizeExpectedCostTipText());\n assertEquals(1, costMatrix0.numRows());\n assertEquals(1, costMatrix0.size());\n assertEquals(1, costMatrix0.numColumns());\n \n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\n assertFalse(capabilities0.equals((Object)capabilities1));\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertNotNull(evaluation0);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(0, testInstances1.getClassType());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals((-1), testInstances1.getClassIndex());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertFalse(testInstances1.getMultiInstance());\n assertFalse(testInstances1.getNoClass());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertEquals(1, testInstances1.getSeed());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(20, instances0.numInstances());\n assertEquals(1, instances0.numClasses());\n assertEquals(2, instances0.classIndex());\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(20, instances0.size());\n assertEquals(3, instances0.numAttributes());\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\n assertEquals(0.0, evaluation0.correct(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\n assertFalse(evaluation0.getDiscardPredictions());\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\n \n double double0 = evaluation0.errorRate();\n assertFalse(capabilities0.equals((Object)capabilities1));\n assertFalse(testInstances1.equals((Object)testInstances0));\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\n assertEquals(2, SMOreg.FILTER_NONE);\n assertEquals((-2), TestInstances.NO_CLASS);\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\n assertEquals(Double.NaN, double0, 0.01);\n assertEquals(\"Determines how/if the data will be transformed.\", sMOreg0.filterTypeTipText());\n assertEquals(\"If set to true, classifier may output additional info to the console.\", sMOreg0.debugTipText());\n assertEquals(\"The complexity parameter C.\", sMOreg0.cTipText());\n assertEquals(\"The kernel to use.\", sMOreg0.kernelTipText());\n assertEquals(1.0, sMOreg0.getC(), 0.01);\n assertFalse(sMOreg0.getDebug());\n assertEquals(\"The learning algorithm.\", sMOreg0.regOptimizerTipText());\n assertTrue(capabilities0.hasDependencies());\n assertEquals(1, capabilities0.getMinimumNumberInstances());\n assertEquals(3, testInstances1.getNumAttributes());\n assertEquals(1, testInstances1.getNumNumeric());\n assertEquals(0, testInstances1.getNumString());\n assertEquals(0, testInstances1.getClassType());\n assertEquals(1, testInstances1.getNumNominal());\n assertEquals(0, testInstances1.getNumRelationalDate());\n assertEquals((-1), testInstances1.getClassIndex());\n assertEquals(2, testInstances1.getNumClasses());\n assertEquals(20, testInstances1.getNumInstances());\n assertEquals(\" \", testInstances1.getWordSeparators());\n assertEquals(\"Testdata\", testInstances1.getRelation());\n assertEquals(0, testInstances1.getNumRelational());\n assertEquals(0, testInstances1.getNumDate());\n assertEquals(2, testInstances1.getNumNominalValues());\n assertFalse(testInstances1.getMultiInstance());\n assertFalse(testInstances1.getNoClass());\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\n assertEquals(10, testInstances1.getNumInstancesRelational());\n assertEquals(1, testInstances1.getSeed());\n assertEquals(1, testInstances1.getNumRelationalNominal());\n assertEquals(1, testInstances1.getNumRelationalNumeric());\n assertEquals(0, testInstances1.getNumRelationalString());\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\n assertEquals(\"Testdata\", instances0.relationName());\n assertEquals(20, instances0.numInstances());\n assertEquals(1, instances0.numClasses());\n assertEquals(2, instances0.classIndex());\n assertFalse(instances0.checkForStringAttributes());\n assertEquals(20, instances0.size());\n assertEquals(3, instances0.numAttributes());\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\n assertEquals(0.0, evaluation0.correct(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\n assertFalse(evaluation0.getDiscardPredictions());\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\n assertNotSame(capabilities0, capabilities1);\n assertNotSame(testInstances1, testInstances0);\n }","title":""},{"docid":"7c5247f437b87228f72a4da6439c711e","score":"0.57836074","text":"@Test(timeout = 4000)\n public void test08() throws Throwable {\n Discretize discretize0 = new Discretize();\n boolean boolean0 = true;\n discretize0.setUseEqualFrequency(true);\n discretize0.globalInfo();\n discretize0.findNumBinsTipText();\n discretize0.setAttributeIndices(\"Optimize number of equal-width bins using leave-one-out. Doesn't work for equal-frequency binning\");\n int int0 = (-576);\n discretize0.setBins((-576));\n discretize0.setOutputFormat();\n discretize0.getUseBinNumbers();\n discretize0.m_UseEqualFrequency = true;\n discretize0.getBinRangesString(0);\n discretize0.globalInfo();\n discretize0.getMakeBinary();\n // Undeclared exception!\n try { \n discretize0.batchFinished();\n fail(\"Expecting exception: IllegalStateException\");\n \n } catch(IllegalStateException e) {\n //\n // No input instance format defined\n //\n verifyException(\"weka.filters.unsupervised.attribute.Discretize\", e);\n }\n }","title":""},{"docid":"5e573f79f9b459289a116d0422fbee3d","score":"0.5781802","text":"@Test(timeout = 4000)\n public void test34() throws Throwable {\n Discretize discretize0 = new Discretize();\n discretize0.m_DesiredWeightOfInstancesPerInterval = 482.4959;\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\n Attribute attribute0 = new Attribute(\"Number of bins.\");\n arrayList0.add(attribute0);\n Instances instances0 = new Instances(\"Att:\", arrayList0, 3);\n discretize0.setInputFormat(instances0);\n // Undeclared exception!\n try { \n discretize0.calculateCutPointsByEqualFrequencyBinning(0);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"weka.filters.unsupervised.attribute.Discretize\", e);\n }\n }","title":""},{"docid":"c8e5ef151b3eb31dfbecb9ac87c058ac","score":"0.5781538","text":"@Test\n\tpublic void testCoherenceRandom() {\n\t\tRandom rand = new Random();\n\t\tfor(int i = 0; i < 100; i++) {\n\t\t\tHashMap<String, Double> req = new HashMap<String, Double>();\n\t\t\tdouble px0 = rand.nextDouble();\n\t\t\treq.put(\"px0\", px0);\n\t\t\tHashMap<String, Double> solMax = amoeba.maximize(req);\n\t\t\treq.put(\"px1\", solMax.get(\"px1\"));\n\t\t\treq.put(\"px2\", solMax.get(\"px2\"));\n\t\t\treq.put(\"oracle\", 0.0);\n\t\t\tdouble res = amoeba.request(req);\n\t\t\tassertEquals(Round.round(solMax.get(\"oracle\"), 8), Round.round(res, 8));\t\t\t\n\t\t}\n\t}","title":""},{"docid":"c2c10b8867126e96c7641ffcfd104303","score":"0.5779588","text":"@Test(timeout = 4000)\n public void test05() throws Throwable {\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer();\n Capabilities capabilities0 = makeDensityBasedClusterer0.getCapabilities();\n MakeDensityBasedClusterer makeDensityBasedClusterer1 = new MakeDensityBasedClusterer(makeDensityBasedClusterer0);\n TestInstances testInstances0 = TestInstances.forCapabilities(capabilities0);\n Instances instances0 = testInstances0.generate();\n assertEquals(2, instances0.numAttributes());\n \n makeDensityBasedClusterer1.buildClusterer(instances0);\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\n assertEquals(1.0E-6, makeDensityBasedClusterer1.getMinStdDev(), 0.01);\n }","title":""}],"string":"[\n {\n \"docid\": \"293ba69276f6fd0cfa2f9a49e5aac4cb\",\n \"score\": \"0.678258\",\n \"text\": \"@Test(timeout = 4000)\\n public void test16() throws Throwable {\\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\\n Instances instances0 = textDirectoryLoader0.getStructure();\\n double[] doubleArray0 = new double[7];\\n BinarySparseInstance binarySparseInstance0 = new BinarySparseInstance((-916.4121), doubleArray0);\\n TestInstances testInstances0 = new TestInstances();\\n EvoSuiteFile evoSuiteFile0 = new EvoSuiteFile(\\\"/home/ubuntu/evosuite_readability_gen/projects/107_weka\\\");\\n FileSystemHandling.appendStringToFile(evoSuiteFile0, \\\"premature end of file\\\");\\n testInstances0.generate(\\\".arff\\\");\\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\\n FileSystemHandling.appendLineToFile((EvoSuiteFile) null, \\\".arff\\\");\\n double double0 = evaluation0.SFMeanPriorEntropy();\\n double double1 = evaluation0.m_SumPredicted;\\n double double2 = evaluation0.precision((-359));\\n assertNotEquals(double2, double0, 0.01);\\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\\n assertEquals(0.0, double2, 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe2c88e93b06984ab138fd42b4ed1b18\",\n \"score\": \"0.6732048\",\n \"text\": \"public void testEntropy() {\\n Assert.assertEquals(1.0, InformationTheory.entropy(new long[] { 5, 5 }));\\n Assert.assertEquals(1.0,\\n InformationTheory.entropy(new long[] { 15, 15 }));\\n\\n // When one class has probability 1.0 then there is no uncertainty about\\n // the random variable,\\n // thus the variable has zero bits of entropy.\\n Assert.assertEquals(0.0,\\n InformationTheory.entropy(new long[] { 5, 0, 0 }));\\n\\n // Given a random variable X, with P(X = 0) = 0.25 and P(X = 1) = 0.75.\\n // The entropy of X will be less\\n // than 1.0 as that is the case with the most uncertainty. The entropy\\n // is 0.81127812445.\\n Assert.assertEquals(0.8112781244591328,\\n InformationTheory.entropy(new long[] { 1, 3 }));\\n\\n // Tests with strings.\\n Assert.assertEquals(0.0, InformationTheory.entropy(\\\"aaaAAAaaaAaAaaAA\\\"));\\n Assert.assertEquals(1.0, InformationTheory.entropy(\\\"abababab\\\"));\\n Assert.assertEquals(1.584962500721156,\\n InformationTheory.entropy(\\\"aBCAbc\\\"));\\n Assert.assertEquals(0.8112781244591328,\\n InformationTheory.entropy(\\\"AbBb\\\"));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a2e3757641bd6a84b7086bbeb5b739fb\",\n \"score\": \"0.67148536\",\n \"text\": \"@Test(timeout = 4000)\\n public void test09() throws Throwable {\\n TestInstances testInstances0 = new TestInstances();\\n Instances instances0 = testInstances0.generate(\\\"`pFO*%3e[eMQb_PAPL\\\");\\n Instances instances1 = new Instances(instances0, (-2));\\n Evaluation evaluation0 = new Evaluation(instances0);\\n CostSensitiveClassifier costSensitiveClassifier0 = new CostSensitiveClassifier();\\n MockRandom mockRandom0 = new MockRandom((-1));\\n Evaluation evaluation1 = new Evaluation(instances0);\\n boolean boolean0 = evaluation0.m_CoverageStatisticsAvailable;\\n Instances instances2 = new Instances(instances1, 2);\\n Evaluation evaluation2 = new Evaluation(instances0);\\n double double0 = evaluation1.sizeOfPredictedRegions();\\n assertEquals(Double.NaN, double0, 0.01);\\n \\n double double1 = evaluation0.fMeasure(1);\\n assertEquals(0.0, double1, 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab57dce9f779d82d18442c60b036051d\",\n \"score\": \"0.6696005\",\n \"text\": \"@Test(timeout = 4000)\\n public void test07() throws Throwable {\\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\\n textDirectoryLoader0.getDataSet();\\n Instances instances0 = textDirectoryLoader0.getDataSet();\\n TestInstances testInstances0 = new TestInstances();\\n testInstances0.generate(\\\"\\\\tOutputs the distribution instead of only the prediction\\\\n\\\");\\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\\n double double0 = evaluation0.m_TotalCoverage;\\n double double1 = evaluation0.SFEntropyGain();\\n assertEquals(0.0, double1, 0.01);\\n \\n double double2 = evaluation0.truePositiveRate((-1882));\\n assertEquals(0.0, double2, 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ae121561ca64670796d46b9493b84d4\",\n \"score\": \"0.66406065\",\n \"text\": \"@Test(timeout = 4000)\\n public void test19() throws Throwable {\\n TestInstances testInstances0 = new TestInstances();\\n Instances instances0 = testInstances0.generate(\\\"No result for query: \\\");\\n instances0.enumerateAttributes();\\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\\n \\n evaluation0.useNoPriors();\\n double double0 = evaluation0.m_TotalSizeOfRegions;\\n double double1 = evaluation0.KBInformation();\\n assertEquals(Double.NaN, double1, 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"058e0bec34732f6e4d85785bc14b4d7d\",\n \"score\": \"0.6603057\",\n \"text\": \"@Test(timeout = 4000)\\n public void test16() throws Throwable {\\n FileSystemHandling.shouldAllThrowIOExceptions();\\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer((Clusterer) null);\\n makeDensityBasedClusterer0.getCapabilities();\\n String string0 = makeDensityBasedClusterer0.toString();\\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\\n assertEquals(\\\"No clusterer built yet!\\\", string0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"542e8d167964be20093aaf728b0a4a9e\",\n \"score\": \"0.6579574\",\n \"text\": \"@Test(timeout = 4000)\\n public void test01() throws Throwable {\\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer();\\n String string0 = makeDensityBasedClusterer0.getRevision();\\n assertEquals(\\\"8034\\\", string0);\\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"577825f1487ee631c7bd9382f5a4f5b2\",\n \"score\": \"0.6567856\",\n \"text\": \"@Test(timeout = 4000)\\n public void test13() throws Throwable {\\n Cobweb cobweb0 = new Cobweb();\\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer(cobweb0);\\n Capabilities capabilities0 = cobweb0.getCapabilities();\\n TestInstances testInstances0 = TestInstances.forCapabilities(capabilities0);\\n Instances instances0 = testInstances0.generate();\\n makeDensityBasedClusterer0.buildClusterer(instances0);\\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"943a0e69b8ae5c4c07d9d14feca2c969\",\n \"score\": \"0.6507515\",\n \"text\": \"@Test(timeout = 4000)\\n public void test20() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n discretize0.setBins(396);\\n discretize0.setBins((-1908874351));\\n discretize0.getCapabilities();\\n discretize0.setMakeBinary(true);\\n discretize0.setOutputFormat();\\n discretize0.setFindNumBins(true);\\n discretize0.setFindNumBins(true);\\n discretize0.setUseEqualFrequency(true);\\n discretize0.getCutPoints((-1908874351));\\n discretize0.getUseBinNumbers();\\n discretize0.getOptions();\\n assertEquals((-1908874351), discretize0.getBins());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a258ad99218b5dd1d631706658f8fd41\",\n \"score\": \"0.650374\",\n \"text\": \"@Test(timeout = 4000)\\n public void test49() throws Throwable {\\n CostSensitiveClassifier costSensitiveClassifier0 = new CostSensitiveClassifier();\\n assertEquals(1, CostSensitiveClassifier.MATRIX_ON_DEMAND);\\n assertEquals(2, CostSensitiveClassifier.MATRIX_SUPPLIED);\\n assertNotNull(costSensitiveClassifier0);\\n assertEquals(0, costSensitiveClassifier0.graphType());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", costSensitiveClassifier0.debugTipText());\\n assertEquals(\\\"The base classifier to be used.\\\", costSensitiveClassifier0.classifierTipText());\\n assertEquals(1, costSensitiveClassifier0.getSeed());\\n assertEquals(\\\"Sets the directory where cost files are loaded from. This option is used when the costMatrixSource is set to \\\\\\\"On Demand\\\\\\\".\\\", costSensitiveClassifier0.onDemandDirectoryTipText());\\n assertEquals(\\\"Sets the cost matrix explicitly. This matrix is used if the costMatrixSource property is set to \\\\\\\"Supplied\\\\\\\".\\\", costSensitiveClassifier0.costMatrixTipText());\\n assertFalse(costSensitiveClassifier0.getMinimizeExpectedCost());\\n assertFalse(costSensitiveClassifier0.getDebug());\\n assertEquals(\\\"The random number seed to be used.\\\", costSensitiveClassifier0.seedTipText());\\n assertEquals(\\\"A metaclassifier that makes its base classifier cost-sensitive. Two methods can be used to introduce cost-sensitivity: reweighting training instances according to the total cost assigned to each class; or predicting the class with minimum expected misclassification cost (rather than the most likely class). Performance can often be improved by using a Bagged classifier to improve the probability estimates of the base classifier.\\\", costSensitiveClassifier0.globalInfo());\\n assertEquals(\\\"Sets whether the minimum expected cost criteria will be used. If this is false, the training data will be reweighted according to the costs assigned to each class. If true, the minimum expected cost criteria will be used.\\\", costSensitiveClassifier0.minimizeExpectedCostTipText());\\n \\n CostMatrix costMatrix0 = costSensitiveClassifier0.getCostMatrix();\\n assertEquals(1, CostSensitiveClassifier.MATRIX_ON_DEMAND);\\n assertEquals(2, CostSensitiveClassifier.MATRIX_SUPPLIED);\\n assertNotNull(costMatrix0);\\n assertEquals(0, costSensitiveClassifier0.graphType());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", costSensitiveClassifier0.debugTipText());\\n assertEquals(\\\"The base classifier to be used.\\\", costSensitiveClassifier0.classifierTipText());\\n assertEquals(1, costSensitiveClassifier0.getSeed());\\n assertEquals(\\\"Sets the directory where cost files are loaded from. This option is used when the costMatrixSource is set to \\\\\\\"On Demand\\\\\\\".\\\", costSensitiveClassifier0.onDemandDirectoryTipText());\\n assertEquals(\\\"Sets the cost matrix explicitly. This matrix is used if the costMatrixSource property is set to \\\\\\\"Supplied\\\\\\\".\\\", costSensitiveClassifier0.costMatrixTipText());\\n assertFalse(costSensitiveClassifier0.getMinimizeExpectedCost());\\n assertFalse(costSensitiveClassifier0.getDebug());\\n assertEquals(\\\"The random number seed to be used.\\\", costSensitiveClassifier0.seedTipText());\\n assertEquals(\\\"A metaclassifier that makes its base classifier cost-sensitive. Two methods can be used to introduce cost-sensitivity: reweighting training instances according to the total cost assigned to each class; or predicting the class with minimum expected misclassification cost (rather than the most likely class). Performance can often be improved by using a Bagged classifier to improve the probability estimates of the base classifier.\\\", costSensitiveClassifier0.globalInfo());\\n assertEquals(\\\"Sets whether the minimum expected cost criteria will be used. If this is false, the training data will be reweighted according to the costs assigned to each class. If true, the minimum expected cost criteria will be used.\\\", costSensitiveClassifier0.minimizeExpectedCostTipText());\\n assertEquals(1, costMatrix0.numRows());\\n assertEquals(1, costMatrix0.numColumns());\\n assertEquals(1, costMatrix0.size());\\n \\n int[] intArray0 = new int[5];\\n intArray0[0] = 106;\\n boolean boolean0 = FileSystemHandling.createFolder((EvoSuiteFile) null);\\n assertFalse(boolean0);\\n \\n intArray0[2] = 1;\\n double[] doubleArray0 = new double[0];\\n BinarySparseInstance binarySparseInstance0 = new BinarySparseInstance(1, doubleArray0);\\n assertEquals(6, AbstractInstance.s_numericAfterDecimalPoint);\\n assertArrayEquals(new double[] {}, doubleArray0, 0.01);\\n assertNotNull(binarySparseInstance0);\\n assertEquals(0, doubleArray0.length);\\n assertEquals(1.0, binarySparseInstance0.weight(), 0.01);\\n assertEquals(0, binarySparseInstance0.numAttributes());\\n assertEquals(0, binarySparseInstance0.numValues());\\n \\n String string0 = Evaluation.makeOptionString(costSensitiveClassifier0, true);\\n assertEquals(1, CostSensitiveClassifier.MATRIX_ON_DEMAND);\\n assertEquals(2, CostSensitiveClassifier.MATRIX_SUPPLIED);\\n assertNotNull(string0);\\n assertEquals(0, costSensitiveClassifier0.graphType());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", costSensitiveClassifier0.debugTipText());\\n assertEquals(\\\"The base classifier to be used.\\\", costSensitiveClassifier0.classifierTipText());\\n assertEquals(1, costSensitiveClassifier0.getSeed());\\n assertEquals(\\\"Sets the directory where cost files are loaded from. This option is used when the costMatrixSource is set to \\\\\\\"On Demand\\\\\\\".\\\", costSensitiveClassifier0.onDemandDirectoryTipText());\\n assertEquals(\\\"Sets the cost matrix explicitly. This matrix is used if the costMatrixSource property is set to \\\\\\\"Supplied\\\\\\\".\\\", costSensitiveClassifier0.costMatrixTipText());\\n assertFalse(costSensitiveClassifier0.getMinimizeExpectedCost());\\n assertFalse(costSensitiveClassifier0.getDebug());\\n assertEquals(\\\"The random number seed to be used.\\\", costSensitiveClassifier0.seedTipText());\\n assertEquals(\\\"A metaclassifier that makes its base classifier cost-sensitive. Two methods can be used to introduce cost-sensitivity: reweighting training instances according to the total cost assigned to each class; or predicting the class with minimum expected misclassification cost (rather than the most likely class). Performance can often be improved by using a Bagged classifier to improve the probability estimates of the base classifier.\\\", costSensitiveClassifier0.globalInfo());\\n assertEquals(\\\"Sets whether the minimum expected cost criteria will be used. If this is false, the training data will be reweighted according to the costs assigned to each class. If true, the minimum expected cost criteria will be used.\\\", costSensitiveClassifier0.minimizeExpectedCostTipText());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5865b4fa796be08c04fa73d3e84571f9\",\n \"score\": \"0.64777064\",\n \"text\": \"@Test(timeout = 4000)\\n public void test21() throws Throwable {\\n TestInstances testInstances0 = new TestInstances();\\n Instances instances0 = testInstances0.generate(\\\"main\\\");\\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\\n FileSystemHandling.appendStringToFile((EvoSuiteFile) null, \\\" \\\");\\n double double0 = evaluation0.m_SumAbsErr;\\n double double1 = evaluation0.weightedAreaUnderROC();\\n assertEquals(Double.NaN, double1, 0.01);\\n \\n double double2 = evaluation0.SFPriorEntropy();\\n assertEquals(0.0, double2, 0.01);\\n assertNotEquals(double2, double1, 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"261c1a78f361cd2fbb7dd98b6a2438f8\",\n \"score\": \"0.64552796\",\n \"text\": \"@Test(timeout = 4000)\\n public void test05() throws Throwable {\\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\\n TestInstances testInstances0 = new TestInstances();\\n Instances instances0 = testInstances0.generate();\\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\\n double double0 = evaluation0.priorEntropy();\\n assertEquals(0.9940302114769565, double0, 0.01);\\n \\n evaluation0.m_MinTarget = (double) (-1);\\n FileSystemHandling.appendStringToFile((EvoSuiteFile) null, \\\".arff\\\");\\n double double1 = evaluation0.errorRate();\\n assertEquals(Double.NaN, double1, 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0015a2c67353710b6198c9b22e24da6e\",\n \"score\": \"0.64335436\",\n \"text\": \"@Test(timeout = 4000)\\n public void test17() throws Throwable {\\n String[] stringArray0 = new String[6];\\n stringArray0[0] = \\\"%,\\\";\\n stringArray0[1] = \\\"globalInfo\\\";\\n stringArray0[2] = \\\"-x <number of folds>\\\\n\\\";\\n stringArray0[3] = \\\"PUbE-/HYe+}KX$@,\\\";\\n stringArray0[4] = \\\" * @param instanceInfo the format of the data to convert\\\\n\\\";\\n stringArray0[5] = \\\"\\\\tSets index of class attribute (default: last).\\\\n\\\";\\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\\n Instances instances0 = textDirectoryLoader0.getDataSet();\\n Evaluation evaluation0 = new Evaluation(instances0);\\n textDirectoryLoader0.setOutputFilename(false);\\n double double0 = evaluation0.matthewsCorrelationCoefficient(14);\\n double double1 = evaluation0.weightedAreaUnderROC();\\n assertNotEquals(double1, double0, 0.01);\\n \\n evaluation0.setDiscardPredictions(false);\\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9606bbc9a8fc9e84c2d9d6f165fd8146\",\n \"score\": \"0.6425031\",\n \"text\": \"@Test(timeout = 4000)\\n public void test16() throws Throwable {\\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\\n Instances instances0 = textDirectoryLoader0.getStructure();\\n Evaluation evaluation0 = new Evaluation(instances0);\\n boolean boolean0 = evaluation0.getDiscardPredictions();\\n assertFalse(boolean0);\\n \\n double double0 = evaluation0.KBRelativeInformation();\\n double double1 = evaluation0.rootMeanPriorSquaredError();\\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\\n assertEquals(double1, double0, 0.01);\\n assertEquals(Double.NaN, double1, 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e36c0448c1c9fe72731e22083796ca4\",\n \"score\": \"0.6399707\",\n \"text\": \"@Test(timeout = 4000)\\n public void test29() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n Attribute attribute0 = new Attribute((String) null);\\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\\n arrayList0.add(attribute0);\\n discretize0.m_IgnoreClass = true;\\n Instances instances0 = new Instances(\\\"date\\\", arrayList0, 1866);\\n attribute0.indexOfValue(\\\"first-last\\\");\\n discretize0.setInputFormat(instances0);\\n discretize0.getFindNumBins();\\n discretize0.setBins(4595);\\n discretize0.batchFinished();\\n attribute0.enumerateValues();\\n discretize0.setOutputFormat();\\n discretize0.setOutputFormat();\\n assertEquals(4595, discretize0.getBins());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e882f69ba9513daacf3984b8d52a5d6b\",\n \"score\": \"0.6389301\",\n \"text\": \"@Test(timeout = 4000)\\n public void test15() throws Throwable {\\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\\n Instances instances0 = textDirectoryLoader0.getStructure();\\n EvoSuiteFile evoSuiteFile0 = new EvoSuiteFile(\\\"/home/ubuntu/evosuite_readability_gen/projects/107_weka\\\");\\n FileSystemHandling.createFolder(evoSuiteFile0);\\n CostSensitiveClassifier costSensitiveClassifier0 = new CostSensitiveClassifier();\\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\\n evaluation0.toCumulativeMarginDistributionString();\\n System.setCurrentTimeMillis(0L);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b3f3a3e641f6fe0613efafd9ae7b9e94\",\n \"score\": \"0.6380977\",\n \"text\": \"@Test(timeout = 4000)\\n public void test14() throws Throwable {\\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\\n textDirectoryLoader0.getDataSet();\\n Instances instances0 = textDirectoryLoader0.getDataSet();\\n double[] doubleArray0 = new double[7];\\n doubleArray0[0] = 1700.48;\\n doubleArray0[1] = 1700.48;\\n doubleArray0[2] = 1700.48;\\n doubleArray0[3] = (-495.726371966089);\\n doubleArray0[4] = 0.07500000298023224;\\n doubleArray0[5] = 0.07500000298023224;\\n doubleArray0[6] = 0.07500000298023224;\\n BinarySparseInstance binarySparseInstance0 = new BinarySparseInstance(0.07500000298023224, doubleArray0);\\n BinarySparseInstance binarySparseInstance1 = new BinarySparseInstance((SparseInstance) binarySparseInstance0);\\n GaussianProcesses gaussianProcesses0 = new GaussianProcesses();\\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\\n RegressionByDiscretization regressionByDiscretization0 = new RegressionByDiscretization();\\n evaluation0.areaUnderROC((-99));\\n boolean boolean0 = evaluation0.equals((Object) null);\\n assertFalse(boolean0);\\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7216c30d81651d12cc3df0cff2b7f1a\",\n \"score\": \"0.63757724\",\n \"text\": \"@Test(timeout = 4000)\\n public void test11() throws Throwable {\\n TestInstances testInstances0 = new TestInstances();\\n Instances instances0 = testInstances0.generate(\\\" \\\");\\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\\n evaluation0.useNoPriors();\\n instances0.getRandomNumberGenerator((-1));\\n double double0 = Evaluation.MIN_SF_PROB;\\n boolean boolean0 = evaluation0.equals(evaluation0);\\n assertTrue(boolean0);\\n \\n double double1 = evaluation0.coverageOfTestCasesByPredictedRegions();\\n double double2 = evaluation0.unweightedMacroFmeasure();\\n assertEquals(double2, double1, 0.01);\\n assertEquals(Double.NaN, double2, 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3540934932a0844126fb5fbd5fbb97c1\",\n \"score\": \"0.63733184\",\n \"text\": \"@Test(timeout = 4000)\\n public void test23() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n discretize0.setBins((-1636));\\n discretize0.m_MakeBinary = false;\\n discretize0.getCapabilities();\\n discretize0.setInvertSelection(true);\\n discretize0.setMakeBinary(true);\\n discretize0.setOutputFormat();\\n discretize0.listOptions();\\n discretize0.listOptions();\\n discretize0.setFindNumBins(true);\\n discretize0.setUseEqualFrequency(true);\\n discretize0.getCutPoints((-1636));\\n discretize0.getUseBinNumbers();\\n discretize0.getDesiredWeightOfInstancesPerInterval();\\n discretize0.getOptions();\\n assertTrue(discretize0.getMakeBinary());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c46b709a20a6bcf5c47d640ef41d9e9\",\n \"score\": \"0.6353928\",\n \"text\": \"@Test(timeout = 4000)\\n public void test35() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\\n Attribute attribute0 = new Attribute(\\\"`v\\\", 1461);\\n arrayList0.add(attribute0);\\n discretize0.m_FindNumBins = true;\\n UnaryOperator.identity();\\n Instances instances0 = new Instances(\\\"`v\\\", arrayList0, 1);\\n discretize0.setInputFormat(instances0);\\n Discretize discretize1 = new Discretize();\\n assertFalse(discretize1.getFindNumBins());\\n \\n discretize0.setInputFormat(instances0);\\n discretize0.calculateCutPoints();\\n assertTrue(discretize0.getFindNumBins());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73292a1991f91072888a609ef0b4ae05\",\n \"score\": \"0.6348158\",\n \"text\": \"public double[] runTest() {\\n\\t\\tallVariable = data.buildAllVariable();\\n//\\t\\ttargetGeneSetVariable = targetGeneSetVariable.recreate(allVariable);\\n\\t\\ttargetGeneSetVariable.recreate(allVariable);\\n\\n\\t\\tfinalTargetGeneAmount = targetGeneSetVariable.size();\\n\\t\\t\\n\\t\\t// Collect structure distributions\\n\\t\\tstarttime = System.currentTimeMillis();\\n\\t\\tStructureProbabilityDistributionEvaluator evaluator = new StructureProbabilityDistributionEvaluator(isConsideringMarkovBlanket, isConsideringAllStructure, independencyPValueThreshold, data, allVariable, targetGeneSetVariable, sampleClass, numberOfProbableStructure, equivalentSampleSize, probabilityPowerFactor, maxParentAmount, priorWeight, edgeDirFixed, includeNeighbor, priorDirectionality, resamplingRate);\\n\\t\\tdouble[][] distribution = evaluator.getProbabilityDistribution();\\n\\t\\t\\n//\\t\\tSystem.out.println(\\\"Calculating JS divergence\\\\n\\\"); \\n\\n\\t\\tJS = JensenShannon.divergence(distribution[0], distribution[1]) / log2; // JS = [0, 1];\\n\\t\\tendtime = System.currentTimeMillis() - starttime;\\n\\t\\tSystem.out.println(\\\"Total time:\\\" + endtime + \\\"ms\\\"); \\t\\n//\\t\\tSystem.out.println(JS);\\n\\t\\t\\n\\t\\tdouble[] permutedJS = new double[numberOfPermutation];\\n\\t\\tint caseLargerThanEqualToJS = 0;\\n\\t\\tint nPermutationExit = (int)Math.ceil(numberOfPermutation * pValueThreshold * 2); // 2 is just safety factor\\n\\n\\t\\tif (!isSilent) {\\n\\t\\t\\tSystem.out.println(\\\"JS:\\\\t\\\" + JS);\\n\\t\\t\\tSystem.out.println(\\\"Running permutation...\\\");\\n\\t\\t}\\n\\t\\t\\n\\t\\t// Collect JS divergences with randomly permuted sample labels.\\n\\t\\tif (RuntimeConfiguration.IS_WRITING_LOG) {\\n\\t\\t\\ttry {\\n\\t\\t\\t\\t// TODO: need to re-write this part to be consistent with the other part.\\n\\t\\t\\t\\tBufferedWriter bw = new BufferedWriter(new FileWriter(\\\"log.txt\\\"));\\n\\t\\t\\t\\tint permuted = 0;\\n\\n\\t\\t\\t\\tfor (int i = 0; i < numberOfPermutation; i++) {\\n\\t\\t\\t\\t\\tSampleClass permutedClass = sampleClass.permutedCopy();\\n\\t\\t\\t\\t\\tStructureProbabilityDistributionEvaluator permutationEvaluator = new StructureProbabilityDistributionEvaluator(isConsideringMarkovBlanket, isConsideringAllStructure, independencyPValueThreshold, data, allVariable, targetGeneSetVariable, permutedClass, numberOfProbableStructure, equivalentSampleSize, probabilityPowerFactor, maxParentAmount, priorWeight, edgeDirFixed, includeNeighbor, priorDirectionality, resamplingRate);\\n\\t\\t\\t\\t\\tdouble[][] permutedDistribution = permutationEvaluator.getProbabilityDistribution();\\n\\t\\t\\t\\t\\tpermutedJS[i] = JensenShannon.divergence(permutedDistribution[0], permutedDistribution[1]) / log2;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif (RuntimeConfiguration.IS_DEBUG_MODE_LV2)\\n\\t\\t\\t\\t\\t\\tSystem.out.print(\\\"Permutation \\\" + (i + 1) + \\\":\\\\t\\\" + permutedJS[i]);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tbw.write(\\\"Permutation \\\" + (i + 1) + \\\":\\\\t\\\" + permutedJS[i] + \\\"\\\\n\\\");\\n\\n\\t\\t\\t\\t\\tif (permutedJS[i] >= JS) {\\n\\t\\t\\t\\t\\t\\tcaseLargerThanEqualToJS++;\\n\\n\\t\\t\\t\\t\\t\\tif (RuntimeConfiguration.IS_DEBUG_MODE_LV2)\\n\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"\\\\t\\\" + caseLargerThanEqualToJS + \\\"th Hit\\\");\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tif (RuntimeConfiguration.IS_DEBUG_MODE_LV2)\\n\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"\\\");\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tpermuted++;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tpValue = ((double) caseLargerThanEqualToJS)/((double) permuted);\\n\\t\\t\\t\\tpermutedAmount = permuted;\\n\\t\\t\\t\\tSystem.out.println(\\\"Statistic:\\\\t\\\" + JS + \\\"\\\\tp-value:\\\\t\\\" + pValue);\\n\\t\\t\\t\\tbw.write(\\\"Statistic:\\\\t\\\" + JS + \\\"\\\\tp-value:\\\\t\\\" + pValue + \\\"\\\\n\\\");\\n\\t\\t\\t\\tbw.close();\\n\\t\\t\\t} catch (Exception e) {\\n\\t\\t\\t\\tSystem.out.println(e);\\n\\t\\t\\t\\tSystem.exit(-1);\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\tint permuted = 0;\\n\\t\\t\\tfor (int i = 0; i < numberOfPermutation; i++) {\\n\\t\\t\\t\\tSampleClass permutedClass = sampleClass.permutedCopy();\\n\\t\\t\\t\\tStructureProbabilityDistributionEvaluator permutationEvaluator = new StructureProbabilityDistributionEvaluator(isConsideringMarkovBlanket, isConsideringAllStructure, independencyPValueThreshold, data, allVariable, targetGeneSetVariable, permutedClass, numberOfProbableStructure, equivalentSampleSize, probabilityPowerFactor, maxParentAmount, priorWeight, edgeDirFixed, includeNeighbor, priorDirectionality, resamplingRate);\\n\\t\\t\\t\\tdouble[][] permutedDistribution = permutationEvaluator.getProbabilityDistribution();\\n\\t\\t\\t\\tpermutedJS[i] = JensenShannon.divergence(permutedDistribution[0], permutedDistribution[1]) / log2;\\n\\n\\t\\t\\t\\tif (Double.isNaN(permutedJS[i])) {\\n\\t\\t\\t\\t\\tpermutedJS[i]=0;\\n//\\t\\t\\t\\t\\tSystem.out.print(\\\"NaN JS likely from 2 identical networks\\\\n\\\");\\n\\t\\t\\t\\t};\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (!isSilent)\\n\\t\\t\\t\\t\\tSystem.out.print(\\\"Permutation \\\" + (i + 1) + \\\":\\\\t\\\" + permutedJS[i]);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tpermuted++;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (permutedJS[i] >= JS) {\\n\\t\\t\\t\\t\\tcaseLargerThanEqualToJS++;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif (!approximatePermutations & quickPermutationEnabled & permuted > 100 &\\n\\t\\t\\t\\t\\t\\t\\t(caseLargerThanEqualToJS > nPermutationExit)) \\n\\t\\t\\t\\t\\t\\tbreak; // permutation stops since there is no possibility to go below pValueThreshold;\\n\\t\\t\\t\\t\\tif (!isSilent)\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"\\\\t\\\" + caseLargerThanEqualToJS + \\\" hit\\\");\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tif (!isSilent)\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tpValue = caseLargerThanEqualToJS/((double) permuted);\\n\\t\\t\\tpermutedAmount = permuted;\\n\\t\\t\\t\\n\\t\\t\\tif ((permuted==numberOfPermutation) && (approximatePermutations)) {\\n\\t\\t\\t\\tJSmean = Stat.mean(permutedJS);\\n\\t\\t\\t\\tJSvariance = Stat.variance(permutedJS);\\n\\t\\t\\t\\talpha = (((1-JSmean)/JSvariance) - (1/JSmean))*JSmean*JSmean;\\n\\t\\t\\t\\tbeta = alpha*((1/JSmean)-1);\\n\\t\\t\\t\\tSystem.out.println(\\\"JSmean:\\\" + JSmean + \\\" JSvariance:\\\" + JSvariance);\\n\\t\\t\\t\\tSystem.out.println(\\\"alpha:\\\" + alpha + \\\" beta:\\\" + beta);\\n\\t\\t\\t\\tbetaderivedpValue = 1-Stat.betaCDF(alpha,beta,JS);\\n\\t\\t\\t\\tpValue=betaderivedpValue;\\n\\t\\t\\t\\tSystem.out.println(\\\" beta-derived JS p-val:\\\" + betaderivedpValue);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif (!isSilent)\\n\\t\\t\\t\\tSystem.out.println(\\\"Statistic:\\\\t\\\" + JS + \\\"\\\\tp-value:\\\\t\\\" + pValue);\\n\\t\\t}\\n\\n\\t\\tif (networkToBeWritten & (pValue < pValueThreshold))\\n\\t\\t\\tevaluator.writeNetworkToFile(targetGeneSetVariable.getName());\\n\\n double[] statistic = new double[3];\\n statistic[0] = JS;\\n statistic[1] = pValue;\\n statistic[2] = permutedAmount; // in many cases, actual # of permutations << specified #\\n\\n\\t\\treturn statistic;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"12c2e6ac47844cf1b18a82e3156e2273\",\n \"score\": \"0.63400507\",\n \"text\": \"@Test(timeout = 4000)\\n public void test37() throws Throwable {\\n JRip jRip0 = new JRip();\\n Attribute attribute0 = new Attribute(\\\"+)L:_gsC5=KdtxFhf\\\", \\\" has \\\");\\n JRip jRip1 = new JRip();\\n JRip.RipperRule jRip_RipperRule0 = jRip1.new RipperRule();\\n String string0 = jRip_RipperRule0.toString(attribute0);\\n assertEquals((-1.0), jRip_RipperRule0.getConsequent(), 0.01);\\n assertEquals(\\\" => +)L:_gsC5=KdtxFhf=\\\", string0);\\n \\n FileSystemHandling.setPermissions((EvoSuiteFile) null, false, false, false);\\n double[] doubleArray0 = new double[8];\\n doubleArray0[0] = (double) 1;\\n doubleArray0[1] = (double) 1;\\n doubleArray0[2] = (double) 1;\\n doubleArray0[3] = (double) 2;\\n doubleArray0[4] = (double) 3;\\n doubleArray0[5] = (double) 2;\\n doubleArray0[6] = (double) 0;\\n doubleArray0[7] = (double) 1;\\n SparseInstance sparseInstance0 = new SparseInstance((-208.0), doubleArray0);\\n ArrayList<String> arrayList0 = new ArrayList<String>();\\n sparseInstance0.setMissing(attribute0);\\n Attribute attribute1 = new Attribute(\\\"@attribute\\\", arrayList0);\\n JRip.NominalAntd jRip_NominalAntd0 = jRip1.new NominalAntd(attribute1);\\n FileSystemHandling.shouldThrowIOException((EvoSuiteFile) null);\\n jRip_NominalAntd0.covers(sparseInstance0);\\n boolean boolean0 = jRip_NominalAntd0.covers(sparseInstance0);\\n FileSystemHandling.appendLineToFile((EvoSuiteFile) null, \\\";iuy\\\");\\n BayesNet bayesNet0 = new BayesNet();\\n JRip.NumericAntd jRip_NumericAntd0 = jRip0.new NumericAntd(attribute0);\\n boolean boolean1 = jRip_NumericAntd0.covers(sparseInstance0);\\n assertEquals(1L, jRip0.getSeed());\\n assertTrue(jRip0.getUsePruning());\\n assertTrue(jRip0.getCheckErrorRate());\\n assertEquals(Double.NaN, jRip_NumericAntd0.getAttrValue(), 0.01);\\n assertEquals(2.0, jRip0.getMinNo(), 0.01);\\n assertEquals(3, jRip0.getFolds());\\n assertEquals(2, jRip0.getOptimizations());\\n assertEquals(Double.NaN, jRip_NumericAntd0.getAccu(), 0.01);\\n assertEquals(0.0, jRip_NumericAntd0.getMaxInfoGain(), 0.01);\\n assertFalse(jRip0.getDebug());\\n assertEquals(Double.NaN, jRip_NumericAntd0.getSplitPoint(), 0.01);\\n assertTrue(boolean1 == boolean0);\\n assertEquals(Double.NaN, jRip_NumericAntd0.getCover(), 0.01);\\n assertEquals(Double.NaN, jRip_NumericAntd0.getAccuRate(), 0.01);\\n assertFalse(boolean1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"32a55edf6fcc00fd4084cbed82d0024a\",\n \"score\": \"0.6330822\",\n \"text\": \"@Test(timeout = 4000)\\n public void test15() throws Throwable {\\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer();\\n Capabilities capabilities0 = makeDensityBasedClusterer0.getCapabilities();\\n TestInstances testInstances0 = TestInstances.forCapabilities(capabilities0);\\n Instances instances0 = testInstances0.generate();\\n makeDensityBasedClusterer0.buildClusterer(instances0);\\n makeDensityBasedClusterer0.toString();\\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"519639a85094353aea322f4b93f6d0c7\",\n \"score\": \"0.6320759\",\n \"text\": \"@Test(timeout = 4000)\\n public void test13() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n String string0 = discretize0.getRevision();\\n assertEquals(\\\"8964\\\", string0);\\n \\n discretize0.setOutputFormat();\\n String[] stringArray0 = discretize0.getOptions();\\n Discretize discretize1 = new Discretize(\\\"8964\\\");\\n discretize1.setOptions(stringArray0);\\n assertEquals(10, discretize1.getBins());\\n assertFalse(discretize1.getFindNumBins());\\n assertEquals(6, stringArray0.length);\\n assertFalse(discretize1.getMakeBinary());\\n assertFalse(discretize1.getUseEqualFrequency());\\n assertEquals((-1.0), discretize1.getDesiredWeightOfInstancesPerInterval(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9461d29e785d4a69e9adb9e66dc6a79\",\n \"score\": \"0.63086176\",\n \"text\": \"@Test(timeout = 4000)\\n public void test34() throws Throwable {\\n JRip jRip0 = new JRip();\\n Attribute attribute0 = new Attribute(\\\"eus|D4*|\\\", \\\"\\\");\\n JRip.RipperRule jRip_RipperRule0 = jRip0.new RipperRule();\\n jRip_RipperRule0.copy();\\n jRip_RipperRule0.toString(attribute0);\\n JRip.NominalAntd jRip_NominalAntd0 = jRip0.new NominalAntd(attribute0);\\n assertEquals(0.0, jRip_NominalAntd0.getMaxInfoGain(), 0.01);\\n \\n jRip_NominalAntd0.maxInfoGain = (double) 2;\\n double double0 = jRip_NominalAntd0.getCover();\\n assertEquals(Double.NaN, double0, 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a41160f8045d49742b5a4dd14c3571b\",\n \"score\": \"0.62343353\",\n \"text\": \"@Test(timeout = 4000)\\n public void test13() throws Throwable {\\n TestInstances testInstances0 = new TestInstances();\\n Instances instances0 = testInstances0.generate(\\\"XxD\\\");\\n Evaluation.handleCostOption(\\\"\\\", (-2141));\\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\\n \\n evaluation0.useNoPriors();\\n assertEquals(Double.NaN, evaluation0.SFEntropyGain(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a48a5c1084f71246164cb1044f304449\",\n \"score\": \"0.6192641\",\n \"text\": \"@Test(timeout = 4000)\\n public void test08() throws Throwable {\\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer();\\n String string0 = makeDensityBasedClusterer0.toString();\\n assertEquals(\\\"No clusterer built yet!\\\", string0);\\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b2003d86fc5a40c399a08677c953104\",\n \"score\": \"0.6188288\",\n \"text\": \"float getTestLineCoverageResult(Run<?, ?> run);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d463ccff8c001eeb9e15539f8ffe87be\",\n \"score\": \"0.61848086\",\n \"text\": \"@Test(timeout = 4000)\\n public void test12() throws Throwable {\\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer();\\n makeDensityBasedClusterer0.defaultClustererString();\\n String[] stringArray0 = makeDensityBasedClusterer0.getOptions();\\n makeDensityBasedClusterer0.setOptions(stringArray0);\\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\\n assertEquals(13, stringArray0.length);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"30c9e58787f7158c90fa681cffad432c\",\n \"score\": \"0.61728907\",\n \"text\": \"@Test(timeout = 4000)\\n public void test71() throws Throwable {\\n TestInstances testInstances0 = new TestInstances();\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertNotNull(testInstances0);\\n assertEquals(20, testInstances0.getNumInstances());\\n assertFalse(testInstances0.getNoClass());\\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\\n assertEquals(2, testInstances0.getNumNominalValues());\\n assertFalse(testInstances0.getMultiInstance());\\n assertEquals(0, testInstances0.getNumDate());\\n assertEquals(10, testInstances0.getNumInstancesRelational());\\n assertEquals(0, testInstances0.getNumRelationalNumeric());\\n assertEquals(0, testInstances0.getNumNumeric());\\n assertEquals(1, testInstances0.getNumRelationalNominal());\\n assertEquals(0, testInstances0.getNumRelationalString());\\n assertEquals(0, testInstances0.getNumString());\\n assertEquals((-1), testInstances0.getClassIndex());\\n assertEquals(1, testInstances0.getSeed());\\n assertEquals(\\\" \\\", testInstances0.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances0.getRelation());\\n assertEquals(0, testInstances0.getNumRelational());\\n assertEquals(1, testInstances0.getNumNominal());\\n assertEquals(0, testInstances0.getNumRelationalDate());\\n assertEquals(1, testInstances0.getClassType());\\n assertEquals(2, testInstances0.getNumClasses());\\n assertEquals(2, testInstances0.getNumAttributes());\\n \\n SMOreg sMOreg0 = new SMOreg();\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertNotNull(sMOreg0);\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n \\n Enumeration enumeration0 = sMOreg0.enumerateMeasures();\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertNotNull(enumeration0);\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n \\n Capabilities capabilities0 = sMOreg0.getCapabilities();\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertNotNull(capabilities0);\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n \\n TestInstances testInstances1 = TestInstances.forCapabilities(capabilities0);\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertNotNull(testInstances1);\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertEquals(1, testInstances1.getSeed());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertFalse(testInstances1.getMultiInstance());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(0, testInstances1.getClassType());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertNotSame(testInstances1, testInstances0);\\n \\n GlobalInfoJavadoc globalInfoJavadoc0 = new GlobalInfoJavadoc();\\n assertNotNull(globalInfoJavadoc0);\\n assertEquals(\\\"weka.core.Javadoc\\\", globalInfoJavadoc0.getClassname());\\n assertTrue(globalInfoJavadoc0.getUseStars());\\n assertEquals(\\\"\\\", globalInfoJavadoc0.getDir());\\n assertFalse(globalInfoJavadoc0.getSilent());\\n \\n Instances instances0 = testInstances1.generate(\\\"4_\\\");\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertNotNull(instances0);\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertEquals(1, testInstances1.getSeed());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertFalse(testInstances1.getMultiInstance());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(0, testInstances1.getClassType());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(20, instances0.size());\\n assertEquals(2, instances0.classIndex());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(3, instances0.numAttributes());\\n assertNotSame(testInstances1, testInstances0);\\n \\n Evaluation evaluation0 = new Evaluation(instances0);\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertNotNull(evaluation0);\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertEquals(1, testInstances1.getSeed());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertFalse(testInstances1.getMultiInstance());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(0, testInstances1.getClassType());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(20, instances0.size());\\n assertEquals(2, instances0.classIndex());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(3, instances0.numAttributes());\\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\\n assertFalse(evaluation0.getDiscardPredictions());\\n assertEquals(0.0, evaluation0.correct(), 0.01);\\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\\n \\n double double0 = evaluation0.correlationCoefficient();\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals(Double.NaN, double0, 0.01);\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertEquals(1, testInstances1.getSeed());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertFalse(testInstances1.getMultiInstance());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(0, testInstances1.getClassType());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(20, instances0.size());\\n assertEquals(2, instances0.classIndex());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(3, instances0.numAttributes());\\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\\n assertFalse(evaluation0.getDiscardPredictions());\\n assertEquals(0.0, evaluation0.correct(), 0.01);\\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\\n assertNotSame(testInstances1, testInstances0);\\n \\n MockRandom mockRandom0 = new MockRandom((-830L));\\n assertNotNull(mockRandom0);\\n \\n try { \\n evaluation0.crossValidateModel((Classifier) sMOreg0, instances0, 97, (Random) mockRandom0, (Object[]) sMOreg0.TAGS_FILTER);\\n fail(\\\"Expecting exception: ClassCastException\\\");\\n \\n } catch(ClassCastException e) {\\n //\\n // weka.core.Tag cannot be cast to weka.classifiers.evaluation.output.prediction.AbstractOutput\\n //\\n verifyException(\\\"weka.classifiers.Evaluation\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7682e3c4f11c1dc64e771f481412b4\",\n \"score\": \"0.617022\",\n \"text\": \"@Test(timeout = 4000)\\n public void test52() throws Throwable {\\n TestInstances testInstances0 = new TestInstances();\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertNotNull(testInstances0);\\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\\n assertEquals(20, testInstances0.getNumInstances());\\n assertFalse(testInstances0.getNoClass());\\n assertFalse(testInstances0.getMultiInstance());\\n assertEquals(2, testInstances0.getNumNominalValues());\\n assertEquals(10, testInstances0.getNumInstancesRelational());\\n assertEquals(0, testInstances0.getNumNumeric());\\n assertEquals(0, testInstances0.getNumRelationalNumeric());\\n assertEquals(0, testInstances0.getNumRelationalString());\\n assertEquals(1, testInstances0.getNumRelationalNominal());\\n assertEquals((-1), testInstances0.getClassIndex());\\n assertEquals(0, testInstances0.getNumString());\\n assertEquals(1, testInstances0.getSeed());\\n assertEquals(2, testInstances0.getNumClasses());\\n assertEquals(\\\" \\\", testInstances0.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances0.getRelation());\\n assertEquals(0, testInstances0.getNumRelational());\\n assertEquals(0, testInstances0.getNumDate());\\n assertEquals(1, testInstances0.getNumNominal());\\n assertEquals(0, testInstances0.getNumRelationalDate());\\n assertEquals(1, testInstances0.getClassType());\\n assertEquals(2, testInstances0.getNumAttributes());\\n \\n CostSensitiveClassifier costSensitiveClassifier0 = new CostSensitiveClassifier();\\n assertEquals(1, CostSensitiveClassifier.MATRIX_ON_DEMAND);\\n assertEquals(2, CostSensitiveClassifier.MATRIX_SUPPLIED);\\n assertNotNull(costSensitiveClassifier0);\\n assertEquals(\\\"Sets whether the minimum expected cost criteria will be used. If this is false, the training data will be reweighted according to the costs assigned to each class. If true, the minimum expected cost criteria will be used.\\\", costSensitiveClassifier0.minimizeExpectedCostTipText());\\n assertFalse(costSensitiveClassifier0.getDebug());\\n assertEquals(\\\"A metaclassifier that makes its base classifier cost-sensitive. Two methods can be used to introduce cost-sensitivity: reweighting training instances according to the total cost assigned to each class; or predicting the class with minimum expected misclassification cost (rather than the most likely class). Performance can often be improved by using a Bagged classifier to improve the probability estimates of the base classifier.\\\", costSensitiveClassifier0.globalInfo());\\n assertEquals(\\\"The base classifier to be used.\\\", costSensitiveClassifier0.classifierTipText());\\n assertEquals(0, costSensitiveClassifier0.graphType());\\n assertEquals(\\\"Sets the directory where cost files are loaded from. This option is used when the costMatrixSource is set to \\\\\\\"On Demand\\\\\\\".\\\", costSensitiveClassifier0.onDemandDirectoryTipText());\\n assertEquals(\\\"Sets the cost matrix explicitly. This matrix is used if the costMatrixSource property is set to \\\\\\\"Supplied\\\\\\\".\\\", costSensitiveClassifier0.costMatrixTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", costSensitiveClassifier0.debugTipText());\\n assertEquals(\\\"The random number seed to be used.\\\", costSensitiveClassifier0.seedTipText());\\n assertFalse(costSensitiveClassifier0.getMinimizeExpectedCost());\\n assertEquals(1, costSensitiveClassifier0.getSeed());\\n \\n AdaBoostM1 adaBoostM1_0 = new AdaBoostM1();\\n assertNotNull(adaBoostM1_0);\\n assertEquals(\\\"The number of iterations to be performed.\\\", adaBoostM1_0.numIterationsTipText());\\n assertEquals(\\\"The base classifier to be used.\\\", adaBoostM1_0.classifierTipText());\\n assertEquals(\\\"Whether resampling is used instead of reweighting.\\\", adaBoostM1_0.useResamplingTipText());\\n assertFalse(adaBoostM1_0.getDebug());\\n assertEquals(100, adaBoostM1_0.getWeightThreshold());\\n assertEquals(10, adaBoostM1_0.getNumIterations());\\n assertFalse(adaBoostM1_0.getUseResampling());\\n assertEquals(\\\"The random number seed to be used.\\\", adaBoostM1_0.seedTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", adaBoostM1_0.debugTipText());\\n assertEquals(1, adaBoostM1_0.getSeed());\\n assertEquals(\\\"Weight threshold for weight pruning.\\\", adaBoostM1_0.weightThresholdTipText());\\n \\n try { \\n Evaluation.wekaStaticWrapper(adaBoostM1_0, \\\"XxD\\\");\\n fail(\\\"Expecting exception: Exception\\\");\\n \\n } catch(Exception e) {\\n //\\n // No model built yet\\n //\\n verifyException(\\\"weka.classifiers.meta.AdaBoostM1\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"015940c97e80189f8d955310fe44e088\",\n \"score\": \"0.61693543\",\n \"text\": \"@Test(timeout = 4000)\\n public void test12() throws Throwable {\\n Discretize discretize0 = new Discretize(\\\"\\\");\\n discretize0.getCapabilities();\\n FileSystemHandling.createFolder((EvoSuiteFile) null);\\n discretize0.getBinRangesString((-1952257859));\\n String[] stringArray0 = new String[1];\\n stringArray0[0] = \\\"weka/core/Capabilities.props\\\";\\n discretize0.setOptions(stringArray0);\\n discretize0.findNumBinsTipText();\\n // Undeclared exception!\\n try { \\n discretize0.findNumBins(24);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"weka.filters.unsupervised.attribute.Discretize\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dfe1e5c358a54e6dce5a28e8203c85b3\",\n \"score\": \"0.6167638\",\n \"text\": \"@Test(timeout = 4000)\\n public void test17() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n assertFalse(discretize0.getUseBinNumbers());\\n \\n discretize0.m_UseBinNumbers = false;\\n discretize0.getCapabilities();\\n discretize0.getCutPoints(1108);\\n discretize0.getOptions();\\n discretize0.setInvertSelection(true);\\n String string0 = discretize0.desiredWeightOfInstancesPerIntervalTipText();\\n assertEquals(\\\"Sets the desired weight of instances per interval for equal-frequency binning.\\\", string0);\\n \\n String string1 = discretize0.getRevision();\\n assertEquals(\\\"8964\\\", string1);\\n \\n String string2 = discretize0.attributeIndicesTipText();\\n assertEquals(\\\"Specify range of attributes to act on. This is a comma separated list of attribute indices, with \\\\\\\"first\\\\\\\" and \\\\\\\"last\\\\\\\" valid values. Specify an inclusive range with \\\\\\\"-\\\\\\\". E.g: \\\\\\\"first-3,5,6-10,last\\\\\\\".\\\", string2);\\n \\n String[] stringArray0 = discretize0.getOptions();\\n assertEquals(10, discretize0.getBins());\\n assertEquals((-1.0), discretize0.getDesiredWeightOfInstancesPerInterval(), 0.01);\\n assertEquals(7, stringArray0.length);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eed61d1535db9de440262d4c3d46de0c\",\n \"score\": \"0.6143958\",\n \"text\": \"@Test(timeout = 4000)\\n public void test08() throws Throwable {\\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\\n Instances instances0 = textDirectoryLoader0.getStructure();\\n MockRandom mockRandom0 = new MockRandom();\\n instances0.randomize(mockRandom0);\\n Evaluation evaluation0 = new Evaluation(instances0);\\n double double0 = evaluation0.incorrect();\\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\\n assertEquals(0.0, double0, 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ef7819011288756f63af9ced7b226df\",\n \"score\": \"0.61312807\",\n \"text\": \"@Test\\n public void get_car_models_more_expensive_than_100000_euro(){\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8e6828f11c99b3f2db2d255f9ab3b96\",\n \"score\": \"0.61259663\",\n \"text\": \"@Test(timeout = 4000)\\n public void test16() throws Throwable {\\n JRip jRip0 = new JRip();\\n String[] stringArray0 = jRip0.getOptions();\\n jRip0.minNoTipText();\\n jRip0.setOptions(stringArray0);\\n JRip.main(stringArray0);\\n assertEquals(11, stringArray0.length);\\n \\n int int0 = jRip0.getOptimizations();\\n assertEquals(2, int0);\\n assertEquals(3, jRip0.getFolds());\\n assertFalse(jRip0.getDebug());\\n assertEquals(2.0, jRip0.getMinNo(), 0.01);\\n assertEquals(1L, jRip0.getSeed());\\n \\n JRip jRip1 = new JRip();\\n Attribute attribute0 = new Attribute(\\\"$e&/ClR\\\", 45);\\n JRip.NumericAntd jRip_NumericAntd0 = jRip1.new NumericAntd(attribute0);\\n String string0 = jRip_NumericAntd0.getRevision();\\n assertEquals(Double.NaN, jRip_NumericAntd0.getAttrValue(), 0.01);\\n assertEquals(Double.NaN, jRip_NumericAntd0.getSplitPoint(), 0.01);\\n assertTrue(jRip1.getUsePruning());\\n assertEquals(Double.NaN, jRip_NumericAntd0.getAccu(), 0.01);\\n assertEquals(\\\"8118\\\", string0);\\n assertEquals(Double.NaN, jRip_NumericAntd0.getCover(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5a0f99c3bbda92904bdd5145c0df945\",\n \"score\": \"0.6121873\",\n \"text\": \"@Test(timeout = 4000)\\n public void test36() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\\n Attribute attribute0 = new Attribute(\\\"Number of bins.\\\", 1461);\\n arrayList0.add(attribute0);\\n UnaryOperator.identity();\\n Instances instances0 = new Instances(\\\"Number of bins.\\\", arrayList0, 1);\\n attribute0.indexOfValue((String) null);\\n discretize0.setInputFormat(instances0);\\n discretize0.batchFinished();\\n SparseInstance sparseInstance0 = new SparseInstance(1);\\n SparseInstance sparseInstance1 = new SparseInstance((Instance) sparseInstance0);\\n boolean boolean0 = discretize0.input(sparseInstance0);\\n discretize0.calculateCutPoints();\\n assertFalse(discretize0.isNewBatch());\\n \\n boolean boolean1 = discretize0.batchFinished();\\n assertTrue(boolean1 == boolean0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe170a83deb371e45daa9642ede1efce\",\n \"score\": \"0.61137927\",\n \"text\": \"@Test(timeout = 4000)\\n public void test14() throws Throwable {\\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer((Clusterer) null);\\n String[] stringArray0 = makeDensityBasedClusterer0.getOptions();\\n assertEquals(5, stringArray0.length);\\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"08a7594730e4c82f9a7d84f0ad648c95\",\n \"score\": \"0.61081076\",\n \"text\": \"@Test(timeout = 4000)\\n public void test12() throws Throwable {\\n TestInstances testInstances0 = new TestInstances();\\n Instances instances0 = testInstances0.generate(\\\"XxD\\\");\\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\\n evaluation0.useNoPriors();\\n double double0 = evaluation0.m_ConfLevel;\\n Evaluation evaluation1 = new Evaluation(instances0, (CostMatrix) null);\\n evaluation1.pctUnclassified();\\n boolean boolean0 = evaluation0.m_NoPriors;\\n double double1 = evaluation0.rootRelativeSquaredError();\\n assertEquals(Double.NaN, evaluation0.SFEntropyGain(), 0.01);\\n assertEquals(Double.NaN, double1, 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67f5dfa15a82caca7b0ed71d56d012fb\",\n \"score\": \"0.6099175\",\n \"text\": \"@Test(timeout = 4000)\\n public void test06() throws Throwable {\\n TestInstances testInstances0 = new TestInstances();\\n testInstances0.setNumRelationalNominal(2446);\\n testInstances0.setWordSeparators(\\\"\\\");\\n FileSystemHandling.shouldAllThrowIOExceptions();\\n FileSystemHandling.createFolder((EvoSuiteFile) null);\\n Instances instances0 = testInstances0.generate();\\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\\n double double0 = evaluation0.m_MinTarget;\\n double double1 = evaluation0.m_TotalCoverage;\\n double double2 = evaluation0.falseNegativeRate((-1));\\n double double3 = evaluation0.falsePositiveRate((-100));\\n assertEquals(double3, double2, 0.01);\\n assertEquals(0.0, double3, 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c0e6cab59f9bf780889d2f8e2b54b365\",\n \"score\": \"0.6078963\",\n \"text\": \"@Test(timeout = 4000)\\n public void test46() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\\n Attribute attribute0 = new Attribute(\\\"Number of bins.\\\", 1461);\\n arrayList0.add(attribute0);\\n UnaryOperator.identity();\\n Instances instances0 = new Instances(\\\"Number of bins.\\\", arrayList0, 1);\\n instances0.setClassIndex(0);\\n attribute0.indexOfValue((String) null);\\n discretize0.setInputFormat(instances0);\\n discretize0.batchFinished();\\n BinarySparseInstance binarySparseInstance0 = new BinarySparseInstance(1);\\n SparseInstance sparseInstance0 = new SparseInstance((Instance) binarySparseInstance0);\\n discretize0.input(binarySparseInstance0);\\n discretize0.calculateCutPoints();\\n assertFalse(discretize0.isNewBatch());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e7145d6ca0628bca32da8cfecbe5a9a\",\n \"score\": \"0.6077001\",\n \"text\": \"public void testGetTotalNoKnowledge() throws Exception {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70a1c73a4f8b3b945d843a973de18cbb\",\n \"score\": \"0.607237\",\n \"text\": \"@Test(timeout = 4000)\\n public void test31() throws Throwable {\\n JRip jRip0 = new JRip();\\n double[] doubleArray0 = new double[6];\\n doubleArray0[0] = (-6.78214234);\\n doubleArray0[1] = (-6.78214234);\\n doubleArray0[2] = (-6.78214234);\\n doubleArray0[3] = (-6.78214234);\\n doubleArray0[4] = (-6.78214234);\\n doubleArray0[5] = (-6.78214234);\\n FileSystemHandling.setPermissions((EvoSuiteFile) null, false, false, false);\\n SparseInstance sparseInstance0 = new SparseInstance((-6.78214234), doubleArray0);\\n ArrayList<String> arrayList0 = new ArrayList<String>();\\n Attribute attribute0 = new Attribute(\\\"Should never happen: oldDLin optmz. stage NaN or infinite!\\\", arrayList0);\\n JRip.NominalAntd jRip_NominalAntd0 = jRip0.new NominalAntd(attribute0);\\n jRip_NominalAntd0.value = (double) 1;\\n jRip_NominalAntd0.covers(sparseInstance0);\\n jRip_NominalAntd0.covers(sparseInstance0);\\n FileSystemHandling.appendLineToFile((EvoSuiteFile) null, \\\"numeric\\\");\\n try { \\n AbstractClassifier.makeCopies(jRip0, (-871));\\n fail(\\\"Expecting exception: NegativeArraySizeException\\\");\\n \\n } catch(NegativeArraySizeException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"weka.classifiers.AbstractClassifier\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9fa78a8f01936c06cf55eb531e7d60a7\",\n \"score\": \"0.60704255\",\n \"text\": \"@Test(timeout = 4000)\\n public void test09() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n assertFalse(discretize0.getMakeBinary());\\n \\n discretize0.m_MakeBinary = false;\\n String string0 = discretize0.getRevision();\\n assertEquals((-1.0), discretize0.getDesiredWeightOfInstancesPerInterval(), 0.01);\\n assertFalse(discretize0.getUseBinNumbers());\\n assertFalse(discretize0.getFindNumBins());\\n assertFalse(discretize0.getUseEqualFrequency());\\n assertEquals(10, discretize0.getBins());\\n assertEquals(\\\"8964\\\", string0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7cb18d815dbf45f4c017ecfac01a83e6\",\n \"score\": \"0.60649717\",\n \"text\": \"private CoverageInApproximationMeasure () {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ece48bfb72769cc66ee816c2cc33d7ad\",\n \"score\": \"0.605959\",\n \"text\": \"@Test(timeout = 4000)\\n public void test16() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n discretize0.m_MakeBinary = true;\\n Range range0 = new Range(\\\"N%'IFzAe\\\");\\n discretize0.m_DiscretizeCols = range0;\\n String[] stringArray0 = discretize0.getOptions();\\n discretize0.setFindNumBins(false);\\n discretize0.getUseBinNumbers();\\n int[] intArray0 = new int[8];\\n intArray0[0] = (-606);\\n intArray0[1] = 6;\\n intArray0[2] = (-797);\\n intArray0[3] = 1298;\\n discretize0.m_MakeBinary = false;\\n intArray0[4] = 2402;\\n discretize0.setOptions(stringArray0);\\n assertTrue(discretize0.getMakeBinary());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"322b3948c4881191a4f93cd81f012505\",\n \"score\": \"0.60394984\",\n \"text\": \"@Test(timeout = 4000)\\n public void test29() throws Throwable {\\n JRip jRip0 = new JRip();\\n JRip.RipperRule jRip_RipperRule0 = jRip0.new RipperRule();\\n jRip_RipperRule0.hasAntds();\\n jRip0.setSeed(0L);\\n jRip_RipperRule0.hasAntds();\\n jRip_RipperRule0.getRevision();\\n byte[] byteArray0 = new byte[4];\\n byteArray0[0] = (byte) (-100);\\n byteArray0[1] = (byte)3;\\n byteArray0[2] = (byte) (-88);\\n byteArray0[3] = (byte) (-13);\\n FileSystemHandling.shouldThrowIOException((EvoSuiteFile) null);\\n Attribute attribute0 = new Attribute((String) null, (List<String>) null, 1397);\\n AbstractClassifier.makeCopy(jRip0);\\n Attribute.main((String[]) null);\\n attribute0.copy(\\\"8118\\\");\\n Attribute attribute1 = attribute0.copy((String) null);\\n JRip.NumericAntd jRip_NumericAntd0 = jRip0.new NumericAntd(attribute1);\\n jRip_NumericAntd0.toString();\\n JRip.NominalAntd jRip_NominalAntd0 = jRip0.new NominalAntd(attribute0);\\n InputMappedClassifier inputMappedClassifier0 = new InputMappedClassifier();\\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\\n Instances instances0 = new Instances(\\\"real\\\", arrayList0, 1);\\n Instances instances1 = inputMappedClassifier0.getModelHeader(instances0);\\n jRip_NominalAntd0.getAccu();\\n jRip_NumericAntd0.splitData(instances1, 436.4912687, 3);\\n try { \\n jRip0.rulesetForOneClass((-3754.8701213941), instances1, 0, 0.0);\\n fail(\\\"Expecting exception: RuntimeException\\\");\\n \\n } catch(RuntimeException e) {\\n //\\n // Class index is negative (not set)!\\n //\\n verifyException(\\\"weka.core.Instances\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"310ec3658ade1fc24c9e655cca7b7d42\",\n \"score\": \"0.6034082\",\n \"text\": \"@Test(timeout = 4000)\\n public void test03() throws Throwable {\\n TestInstances testInstances0 = new TestInstances();\\n Instances instances0 = testInstances0.generate(\\\"D\\\");\\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\\n evaluation0.m_ClassIsNominal = false;\\n evaluation0.useNoPriors();\\n try { \\n evaluation0.priorEntropy();\\n fail(\\\"Expecting exception: Exception\\\");\\n \\n } catch(Exception e) {\\n //\\n // Can't compute entropy of class prior: class numeric!\\n //\\n verifyException(\\\"weka.classifiers.Evaluation\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5afbf3bf021ec300c0dd1790508cf00\",\n \"score\": \"0.6033466\",\n \"text\": \"@Test(timeout = 4000)\\n public void test17() throws Throwable {\\n TestInstances testInstances0 = new TestInstances();\\n testInstances0.generate(\\\"ma:n\\\");\\n Instances instances0 = testInstances0.generate(\\\"@relation\\\");\\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\\n Evaluation evaluation1 = new Evaluation(instances0, (CostMatrix) null);\\n double double0 = evaluation1.m_Incorrect;\\n Evaluation evaluation2 = new Evaluation(instances0, (CostMatrix) null);\\n String string0 = evaluation2.toMatrixString();\\n assertEquals(\\\"=== Confusion Matrix ===\\\\n\\\\n a b <-- classified as\\\\n 0 0 | a = class1\\\\n 0 0 | b = class2\\\\n\\\", string0);\\n assertEquals(0.0, evaluation2.SFSchemeEntropy(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a2b23a73106338b94fea70d155e490e\",\n \"score\": \"0.6031164\",\n \"text\": \"@Test(timeout = 4000)\\n public void test15() throws Throwable {\\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\\n Instances instances0 = textDirectoryLoader0.getStructure();\\n Evaluation evaluation0 = new Evaluation(instances0);\\n boolean boolean0 = evaluation0.getDiscardPredictions();\\n assertFalse(boolean0);\\n \\n textDirectoryLoader0.reset();\\n double double0 = evaluation0.KBRelativeInformation();\\n assertEquals(Double.NaN, double0, 0.01);\\n \\n double[][] doubleArray0 = evaluation0.confusionMatrix();\\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\\n assertEquals(0, doubleArray0.length);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba92d7962df3861de3e2c9ec5258cc68\",\n \"score\": \"0.6026941\",\n \"text\": \"@Test(timeout = 4000)\\n public void test01() throws Throwable {\\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\\n Instances instances0 = textDirectoryLoader0.getStructure();\\n instances0.sort((-1751));\\n Evaluation evaluation0 = new Evaluation(instances0);\\n double[] doubleArray0 = evaluation0.getClassPriors();\\n assertNotNull(doubleArray0);\\n \\n double double0 = evaluation0.weightedAreaUnderROC();\\n assertEquals(Double.NaN, double0, 0.01);\\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3863e4a0dd8868efa099c0f3ef87eb15\",\n \"score\": \"0.6018713\",\n \"text\": \"@Test(timeout = 4000)\\n public void test13() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n discretize0.m_MakeBinary = true;\\n Range range0 = new Range(\\\"N%'IFzAe\\\");\\n discretize0.m_DiscretizeCols = range0;\\n discretize0.getOptions();\\n discretize0.setFindNumBins(false);\\n discretize0.getUseBinNumbers();\\n assertTrue(discretize0.getMakeBinary());\\n \\n int[] intArray0 = new int[8];\\n intArray0[0] = (-606);\\n intArray0[1] = 6;\\n intArray0[2] = (-797);\\n intArray0[3] = 1298;\\n discretize0.m_MakeBinary = false;\\n intArray0[4] = 2402;\\n intArray0[5] = 735;\\n intArray0[6] = 0;\\n intArray0[7] = (-1323);\\n BinarySparseInstance binarySparseInstance0 = new BinarySparseInstance(2405.40515, intArray0, 2402);\\n BinarySparseInstance binarySparseInstance1 = new BinarySparseInstance((SparseInstance) binarySparseInstance0);\\n discretize0.setUseEqualFrequency(false);\\n discretize0.setAttributeIndicesArray(intArray0);\\n assertEquals((-1.0), discretize0.getDesiredWeightOfInstancesPerInterval(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"22acf1c94713368ba2332d760e8f4148\",\n \"score\": \"0.60166585\",\n \"text\": \"@Test(timeout = 4000)\\n public void test06() throws Throwable {\\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer();\\n makeDensityBasedClusterer0.setNumClusters(537);\\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a250b39a3842bd4be8213bba834be390\",\n \"score\": \"0.60126483\",\n \"text\": \"@Test(timeout = 4000)\\n public void test18() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n discretize0.getCutPoints(3282);\\n assertFalse(discretize0.getMakeBinary());\\n assertFalse(discretize0.getFindNumBins());\\n assertEquals((-1.0), discretize0.getDesiredWeightOfInstancesPerInterval(), 0.01);\\n assertEquals(10, discretize0.getBins());\\n assertFalse(discretize0.getUseBinNumbers());\\n assertFalse(discretize0.getUseEqualFrequency());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"59ab2ccb1e7026563baaf9b5e2446116\",\n \"score\": \"0.6011401\",\n \"text\": \"@Test(timeout = 4000)\\n public void test17() throws Throwable {\\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer((Clusterer) null);\\n makeDensityBasedClusterer0.listOptions();\\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a2ed9ffe8827c91d7d2ca957cc0660c\",\n \"score\": \"0.60113716\",\n \"text\": \"@Test(timeout = 4000)\\n public void test35() throws Throwable {\\n SMOreg sMOreg0 = new SMOreg();\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertNotNull(sMOreg0);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n \\n Capabilities capabilities0 = sMOreg0.getCapabilities();\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertNotNull(capabilities0);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n \\n TestInstances testInstances0 = TestInstances.forCapabilities(capabilities0);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertNotNull(testInstances0);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertEquals(0, testInstances0.getClassType());\\n assertEquals(1, testInstances0.getSeed());\\n assertEquals(1, testInstances0.getNumRelationalNominal());\\n assertEquals((-1), testInstances0.getClassIndex());\\n assertEquals(0, testInstances0.getNumRelationalString());\\n assertEquals(1, testInstances0.getNumRelationalNumeric());\\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\\n assertEquals(1, testInstances0.getNumNumeric());\\n assertEquals(0, testInstances0.getNumString());\\n assertEquals(2, testInstances0.getNumClasses());\\n assertFalse(testInstances0.getNoClass());\\n assertFalse(testInstances0.getMultiInstance());\\n assertEquals(3, testInstances0.getNumAttributes());\\n assertEquals(10, testInstances0.getNumInstancesRelational());\\n assertEquals(20, testInstances0.getNumInstances());\\n assertEquals(\\\" \\\", testInstances0.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances0.getRelation());\\n assertEquals(0, testInstances0.getNumRelational());\\n assertEquals(0, testInstances0.getNumDate());\\n assertEquals(1, testInstances0.getNumNominal());\\n assertEquals(0, testInstances0.getNumRelationalDate());\\n assertEquals(2, testInstances0.getNumNominalValues());\\n \\n Instances instances0 = testInstances0.generate(\\\"getTechnicalInformation\\\");\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertNotNull(instances0);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertEquals(0, testInstances0.getClassType());\\n assertEquals(1, testInstances0.getSeed());\\n assertEquals(1, testInstances0.getNumRelationalNominal());\\n assertEquals((-1), testInstances0.getClassIndex());\\n assertEquals(0, testInstances0.getNumRelationalString());\\n assertEquals(1, testInstances0.getNumRelationalNumeric());\\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\\n assertEquals(1, testInstances0.getNumNumeric());\\n assertEquals(0, testInstances0.getNumString());\\n assertEquals(2, testInstances0.getNumClasses());\\n assertFalse(testInstances0.getNoClass());\\n assertFalse(testInstances0.getMultiInstance());\\n assertEquals(3, testInstances0.getNumAttributes());\\n assertEquals(10, testInstances0.getNumInstancesRelational());\\n assertEquals(20, testInstances0.getNumInstances());\\n assertEquals(\\\" \\\", testInstances0.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances0.getRelation());\\n assertEquals(0, testInstances0.getNumRelational());\\n assertEquals(0, testInstances0.getNumDate());\\n assertEquals(1, testInstances0.getNumNominal());\\n assertEquals(0, testInstances0.getNumRelationalDate());\\n assertEquals(2, testInstances0.getNumNominalValues());\\n assertEquals(3, instances0.numAttributes());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(20, instances0.size());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(2, instances0.classIndex());\\n \\n Capabilities capabilities1 = capabilities0.getClassCapabilities();\\n assertFalse(capabilities1.equals((Object)capabilities0));\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertNotNull(capabilities1);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertFalse(capabilities1.hasDependencies());\\n assertEquals(1, capabilities1.getMinimumNumberInstances());\\n assertNotSame(capabilities0, capabilities1);\\n assertNotSame(capabilities1, capabilities0);\\n \\n CostSensitiveClassifier costSensitiveClassifier0 = new CostSensitiveClassifier();\\n assertEquals(1, CostSensitiveClassifier.MATRIX_ON_DEMAND);\\n assertEquals(2, CostSensitiveClassifier.MATRIX_SUPPLIED);\\n assertNotNull(costSensitiveClassifier0);\\n assertEquals(\\\"Sets whether the minimum expected cost criteria will be used. If this is false, the training data will be reweighted according to the costs assigned to each class. If true, the minimum expected cost criteria will be used.\\\", costSensitiveClassifier0.minimizeExpectedCostTipText());\\n assertFalse(costSensitiveClassifier0.getDebug());\\n assertEquals(\\\"A metaclassifier that makes its base classifier cost-sensitive. Two methods can be used to introduce cost-sensitivity: reweighting training instances according to the total cost assigned to each class; or predicting the class with minimum expected misclassification cost (rather than the most likely class). Performance can often be improved by using a Bagged classifier to improve the probability estimates of the base classifier.\\\", costSensitiveClassifier0.globalInfo());\\n assertEquals(0, costSensitiveClassifier0.graphType());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", costSensitiveClassifier0.debugTipText());\\n assertEquals(\\\"The base classifier to be used.\\\", costSensitiveClassifier0.classifierTipText());\\n assertEquals(\\\"Sets the directory where cost files are loaded from. This option is used when the costMatrixSource is set to \\\\\\\"On Demand\\\\\\\".\\\", costSensitiveClassifier0.onDemandDirectoryTipText());\\n assertEquals(\\\"Sets the cost matrix explicitly. This matrix is used if the costMatrixSource property is set to \\\\\\\"Supplied\\\\\\\".\\\", costSensitiveClassifier0.costMatrixTipText());\\n assertEquals(\\\"The random number seed to be used.\\\", costSensitiveClassifier0.seedTipText());\\n assertFalse(costSensitiveClassifier0.getMinimizeExpectedCost());\\n assertEquals(1, costSensitiveClassifier0.getSeed());\\n \\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\\n assertFalse(capabilities0.equals((Object)capabilities1));\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertNotNull(evaluation0);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertEquals(0, testInstances0.getClassType());\\n assertEquals(1, testInstances0.getSeed());\\n assertEquals(1, testInstances0.getNumRelationalNominal());\\n assertEquals((-1), testInstances0.getClassIndex());\\n assertEquals(0, testInstances0.getNumRelationalString());\\n assertEquals(1, testInstances0.getNumRelationalNumeric());\\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\\n assertEquals(1, testInstances0.getNumNumeric());\\n assertEquals(0, testInstances0.getNumString());\\n assertEquals(2, testInstances0.getNumClasses());\\n assertFalse(testInstances0.getNoClass());\\n assertFalse(testInstances0.getMultiInstance());\\n assertEquals(3, testInstances0.getNumAttributes());\\n assertEquals(10, testInstances0.getNumInstancesRelational());\\n assertEquals(20, testInstances0.getNumInstances());\\n assertEquals(\\\" \\\", testInstances0.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances0.getRelation());\\n assertEquals(0, testInstances0.getNumRelational());\\n assertEquals(0, testInstances0.getNumDate());\\n assertEquals(1, testInstances0.getNumNominal());\\n assertEquals(0, testInstances0.getNumRelationalDate());\\n assertEquals(2, testInstances0.getNumNominalValues());\\n assertEquals(3, instances0.numAttributes());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(20, instances0.size());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(2, instances0.classIndex());\\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\\n assertEquals(0.0, evaluation0.correct(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\\n assertFalse(evaluation0.getDiscardPredictions());\\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\\n \\n double[] doubleArray0 = evaluation0.makeDistribution(1);\\n assertFalse(capabilities0.equals((Object)capabilities1));\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertArrayEquals(new double[] {1.0}, doubleArray0, 0.01);\\n assertNotNull(doubleArray0);\\n assertEquals(1, doubleArray0.length);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertEquals(0, testInstances0.getClassType());\\n assertEquals(1, testInstances0.getSeed());\\n assertEquals(1, testInstances0.getNumRelationalNominal());\\n assertEquals((-1), testInstances0.getClassIndex());\\n assertEquals(0, testInstances0.getNumRelationalString());\\n assertEquals(1, testInstances0.getNumRelationalNumeric());\\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\\n assertEquals(1, testInstances0.getNumNumeric());\\n assertEquals(0, testInstances0.getNumString());\\n assertEquals(2, testInstances0.getNumClasses());\\n assertFalse(testInstances0.getNoClass());\\n assertFalse(testInstances0.getMultiInstance());\\n assertEquals(3, testInstances0.getNumAttributes());\\n assertEquals(10, testInstances0.getNumInstancesRelational());\\n assertEquals(20, testInstances0.getNumInstances());\\n assertEquals(\\\" \\\", testInstances0.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances0.getRelation());\\n assertEquals(0, testInstances0.getNumRelational());\\n assertEquals(0, testInstances0.getNumDate());\\n assertEquals(1, testInstances0.getNumNominal());\\n assertEquals(0, testInstances0.getNumRelationalDate());\\n assertEquals(2, testInstances0.getNumNominalValues());\\n assertEquals(3, instances0.numAttributes());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(20, instances0.size());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(2, instances0.classIndex());\\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\\n assertEquals(0.0, evaluation0.correct(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\\n assertFalse(evaluation0.getDiscardPredictions());\\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\\n assertNotSame(capabilities0, capabilities1);\\n \\n double double0 = evaluation0.SFSchemeEntropy();\\n assertFalse(capabilities0.equals((Object)capabilities1));\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertEquals(0.0, double0, 0.01);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertEquals(0, testInstances0.getClassType());\\n assertEquals(1, testInstances0.getSeed());\\n assertEquals(1, testInstances0.getNumRelationalNominal());\\n assertEquals((-1), testInstances0.getClassIndex());\\n assertEquals(0, testInstances0.getNumRelationalString());\\n assertEquals(1, testInstances0.getNumRelationalNumeric());\\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\\n assertEquals(1, testInstances0.getNumNumeric());\\n assertEquals(0, testInstances0.getNumString());\\n assertEquals(2, testInstances0.getNumClasses());\\n assertFalse(testInstances0.getNoClass());\\n assertFalse(testInstances0.getMultiInstance());\\n assertEquals(3, testInstances0.getNumAttributes());\\n assertEquals(10, testInstances0.getNumInstancesRelational());\\n assertEquals(20, testInstances0.getNumInstances());\\n assertEquals(\\\" \\\", testInstances0.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances0.getRelation());\\n assertEquals(0, testInstances0.getNumRelational());\\n assertEquals(0, testInstances0.getNumDate());\\n assertEquals(1, testInstances0.getNumNominal());\\n assertEquals(0, testInstances0.getNumRelationalDate());\\n assertEquals(2, testInstances0.getNumNominalValues());\\n assertEquals(3, instances0.numAttributes());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(20, instances0.size());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(2, instances0.classIndex());\\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\\n assertEquals(0.0, evaluation0.correct(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\\n assertFalse(evaluation0.getDiscardPredictions());\\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\\n assertNotSame(capabilities0, capabilities1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"292890fb056962e07f94e054ad38ff03\",\n \"score\": \"0.60043997\",\n \"text\": \"@Test(timeout = 4000)\\n public void test14() throws Throwable {\\n JRip jRip0 = new JRip();\\n Attribute attribute0 = new Attribute(\\\"115-123\\\", 0);\\n JRip.NumericAntd jRip_NumericAntd0 = jRip0.new NumericAntd(attribute0);\\n double double0 = jRip_NumericAntd0.getSplitPoint();\\n assertFalse(jRip0.getDebug());\\n assertEquals(Double.NaN, double0, 0.01);\\n assertEquals(Double.NaN, jRip_NumericAntd0.getAttrValue(), 0.01);\\n assertEquals(3, jRip0.getFolds());\\n assertEquals(Double.NaN, jRip_NumericAntd0.getAccuRate(), 0.01);\\n assertEquals(2.0, jRip0.getMinNo(), 0.01);\\n assertEquals(2, jRip0.getOptimizations());\\n assertEquals(0.0, jRip_NumericAntd0.getMaxInfoGain(), 0.01);\\n assertTrue(jRip0.getCheckErrorRate());\\n assertEquals(1L, jRip0.getSeed());\\n assertTrue(jRip0.getUsePruning());\\n assertEquals(Double.NaN, jRip_NumericAntd0.getCover(), 0.01);\\n assertEquals(Double.NaN, jRip_NumericAntd0.getAccu(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ecbcc880339fdc7ef47a23ad3c2d8c01\",\n \"score\": \"0.5999325\",\n \"text\": \"@Test(timeout = 4000)\\n public void test13() throws Throwable {\\n JRip jRip0 = new JRip();\\n AbstractClassifier.makeCopies(jRip0, 0);\\n String string0 = jRip0.optimizationsTipText();\\n assertEquals(\\\"The number of optimization runs.\\\", string0);\\n \\n JRip.RipperRule jRip_RipperRule0 = jRip0.new RipperRule();\\n String string1 = jRip_RipperRule0.getRevision();\\n assertEquals((-1.0), jRip_RipperRule0.getConsequent(), 0.01);\\n assertTrue(jRip0.getCheckErrorRate());\\n assertEquals(2, jRip0.getOptimizations());\\n assertFalse(jRip0.getDebug());\\n assertEquals(3, jRip0.getFolds());\\n assertEquals(\\\"8118\\\", string1);\\n assertEquals(1L, jRip0.getSeed());\\n assertTrue(jRip0.getUsePruning());\\n assertEquals(2.0, jRip0.getMinNo(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"228d99a24935a06513904247893ecec1\",\n \"score\": \"0.59972507\",\n \"text\": \"@Test(timeout = 4000)\\n public void test12() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n String[] stringArray0 = discretize0.getOptions();\\n assertEquals(6, stringArray0.length);\\n \\n discretize0.getBinRangesString(4714);\\n assertEquals((-1.0), discretize0.getDesiredWeightOfInstancesPerInterval(), 0.01);\\n assertEquals(10, discretize0.getBins());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab957abbb79498d72037caaf222a92ce\",\n \"score\": \"0.5996688\",\n \"text\": \"@Test\\n public void hctConverCostTest() {\\n // TODO: test hctConverCost\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51a2f18a1e3a8b6b83fb530741abc4f7\",\n \"score\": \"0.59845144\",\n \"text\": \"@Test void minimalObservationTest() {\\n\\t\\tstandardTest(6);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a587423d053a7469d1ffd14f02a364ba\",\n \"score\": \"0.597597\",\n \"text\": \"@Test\\r\\n public void testCalculateFitness() {\\r\\n System.out.println(\\\"calculateFitness\\\");\\r\\n String candidateString = \\\" \\\";\\r\\n Chromosome instance = new Chromosome(candidateString);\\r\\n double expResult = 1.01;\\r\\n double result = instance.calculateFitness(instance.getCandidateString());\\r\\n if(expResult>=result)\\r\\n assertEquals(expResult, result,1.01);\\r\\n else\\r\\n fail(\\\"No passed\\\");\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8cbe7e9502943ea5c0ea39ea3ce7ff38\",\n \"score\": \"0.59702927\",\n \"text\": \"@Test(timeout = 4000)\\n public void test24() throws Throwable {\\n Discretize discretize0 = new Discretize(\\\"General options:\\\\n\\\\n-h\\\\n\\\\tGet help on available options.\\\\n\\\\t(use -b -h for help on batch mode.)\\\\n-i <file>\\\\n\\\\tThe name of the file containing input instances.\\\\n\\\\tIf not supplied then instances will be read from stdin.\\\\n-o <file>\\\\n\\\\tThe name of the file output instances will be written to.\\\\n\\\\tIf not supplied then instances will be written to stdout.\\\\n-c <class index>\\\\n\\\\tThe number of the attribute to use as the class.\\\\n\\\\t\\\\\\\"first\\\\\\\" and \\\\\\\"last\\\\\\\" are also valid entries.\\\\n\\\\tIf not supplied then no class is assigned.\\\");\\n discretize0.setOutputFormat();\\n discretize0.setFindNumBins(true);\\n discretize0.setFindNumBins(false);\\n discretize0.m_MakeBinary = true;\\n double[][] doubleArray0 = new double[7][0];\\n double[] doubleArray1 = new double[0];\\n doubleArray0[0] = doubleArray1;\\n double[] doubleArray2 = new double[4];\\n doubleArray2[0] = (double) 933;\\n doubleArray2[1] = (double) 933;\\n doubleArray2[2] = (double) 933;\\n doubleArray2[3] = (double) 933;\\n doubleArray0[1] = doubleArray2;\\n double[] doubleArray3 = new double[4];\\n doubleArray3[0] = (double) 933;\\n doubleArray3[1] = (double) 933;\\n doubleArray3[2] = (double) 933;\\n doubleArray3[3] = (double) 933;\\n doubleArray0[2] = doubleArray3;\\n double[] doubleArray4 = new double[9];\\n doubleArray4[0] = (double) 933;\\n doubleArray4[1] = (double) 933;\\n doubleArray4[2] = (double) 933;\\n doubleArray4[3] = (double) 933;\\n doubleArray4[4] = (double) 933;\\n doubleArray4[5] = (-1.7976931348623157E308);\\n doubleArray4[6] = (double) 933;\\n doubleArray4[7] = (double) 933;\\n doubleArray4[8] = (-327.5);\\n doubleArray0[3] = doubleArray4;\\n double[] doubleArray5 = new double[1];\\n doubleArray5[0] = (-1.7976931348623157E308);\\n doubleArray0[4] = doubleArray5;\\n double[] doubleArray6 = new double[5];\\n doubleArray6[0] = (-1730.9912419);\\n doubleArray6[1] = (double) 933;\\n doubleArray6[2] = (double) 933;\\n doubleArray6[3] = (double) 933;\\n doubleArray6[4] = (double) 933;\\n doubleArray0[5] = doubleArray6;\\n double[] doubleArray7 = new double[0];\\n doubleArray0[6] = doubleArray7;\\n discretize0.m_CutPoints = doubleArray0;\\n // Undeclared exception!\\n try { \\n discretize0.getCutPoints(933);\\n fail(\\\"Expecting exception: ArrayIndexOutOfBoundsException\\\");\\n \\n } catch(ArrayIndexOutOfBoundsException e) {\\n //\\n // 933\\n //\\n verifyException(\\\"weka.filters.unsupervised.attribute.Discretize\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58ad5ddbeab8d3f05faaf4d5777ba0e2\",\n \"score\": \"0.59610665\",\n \"text\": \"@Test(timeout = 4000)\\n public void test07() throws Throwable {\\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer();\\n String[] stringArray0 = new String[0];\\n makeDensityBasedClusterer0.setOptions(stringArray0);\\n String[] stringArray1 = makeDensityBasedClusterer0.getOptions();\\n assertEquals(13, stringArray1.length);\\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b501dba621e25a02218970efad771f59\",\n \"score\": \"0.5945148\",\n \"text\": \"@Test(timeout = 4000)\\n public void test40() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\\n Attribute attribute0 = new Attribute(\\\"Number of bins.\\\", 1461);\\n arrayList0.add(attribute0);\\n UnaryOperator.identity();\\n Instances instances0 = new Instances(\\\"Number of bins.\\\", arrayList0, 9);\\n boolean boolean0 = discretize0.setInputFormat(instances0);\\n boolean boolean1 = discretize0.batchFinished();\\n assertTrue(boolean1 == boolean0);\\n \\n String string0 = discretize0.getBinRangesString(0);\\n assertEquals(\\\"All\\\", string0);\\n \\n discretize0.setOutputFormat();\\n assertEquals(10, discretize0.getBins());\\n assertFalse(discretize0.getFindNumBins());\\n assertEquals((-1.0), discretize0.getDesiredWeightOfInstancesPerInterval(), 0.01);\\n assertFalse(discretize0.getUseEqualFrequency());\\n assertFalse(discretize0.getUseBinNumbers());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0773cbe7a945665bfce20477e863dd69\",\n \"score\": \"0.59418565\",\n \"text\": \"@Test(timeout = 4000)\\n public void test20() throws Throwable {\\n SMOreg sMOreg0 = new SMOreg();\\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\\n FileSystemHandling.shouldAllThrowIOExceptions();\\n Instances instances0 = textDirectoryLoader0.getStructure();\\n CostSensitiveClassifier costSensitiveClassifier0 = new CostSensitiveClassifier();\\n costSensitiveClassifier0.getCostMatrix();\\n CostMatrix costMatrix0 = new CostMatrix(0);\\n Evaluation evaluation0 = new Evaluation(instances0, costMatrix0);\\n double double0 = evaluation0.weightedAreaUnderROC();\\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\\n assertEquals(Double.NaN, double0, 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c02038636c61523058c8a0ace5c78ebc\",\n \"score\": \"0.59372187\",\n \"text\": \"@Test(timeout = 4000)\\n public void test11() throws Throwable {\\n System.setCurrentTimeMillis(0L);\\n String[] stringArray0 = new String[9];\\n stringArray0[0] = \\\"\\\";\\n stringArray0[1] = \\\"_/N:=opih\\\";\\n stringArray0[2] = \\\"4NbZCskq0tdE-,s2\\\";\\n stringArray0[3] = \\\"\\\";\\n stringArray0[4] = \\\"-Y\\\";\\n stringArray0[5] = \\\" appears to be missing.\\\";\\n stringArray0[6] = \\\"\\\";\\n stringArray0[7] = \\\"first-last\\\";\\n stringArray0[8] = \\\" @oHfv9gPYTE:$s#\\\";\\n Discretize.main(stringArray0);\\n Discretize discretize0 = new Discretize(\\\"2,-550,2147483646\\\");\\n // Undeclared exception!\\n try { \\n discretize0.calculateCutPointsByEqualWidthBinning((-1659));\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"weka.filters.unsupervised.attribute.Discretize\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"844667a7940b666206a9f53779ef84f7\",\n \"score\": \"0.5937021\",\n \"text\": \"@Test(timeout = 4000)\\n public void test37() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n Range range0 = new Range();\\n discretize0.m_DiscretizeCols = range0;\\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\\n Attribute attribute0 = new Attribute(\\\"Number of bins.\\\", 1461);\\n arrayList0.add(attribute0);\\n UnaryOperator.identity();\\n Instances instances0 = new Instances(\\\"Number of bins.\\\", arrayList0, 1);\\n discretize0.setInputFormat(instances0);\\n discretize0.batchFinished();\\n SparseInstance sparseInstance0 = new SparseInstance(4);\\n SparseInstance sparseInstance1 = new SparseInstance((Instance) sparseInstance0);\\n discretize0.input(sparseInstance1);\\n discretize0.calculateCutPoints();\\n assertFalse(discretize0.isNewBatch());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4799357087b5c6fa957e8c32a0539adc\",\n \"score\": \"0.59216356\",\n \"text\": \"@Test(timeout = 4000)\\n public void test73() throws Throwable {\\n TestInstances testInstances0 = new TestInstances();\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertNotNull(testInstances0);\\n assertEquals(2, testInstances0.getNumNominalValues());\\n assertEquals(10, testInstances0.getNumInstancesRelational());\\n assertEquals(0, testInstances0.getNumRelationalString());\\n assertFalse(testInstances0.getNoClass());\\n assertFalse(testInstances0.getMultiInstance());\\n assertEquals(1, testInstances0.getNumNominal());\\n assertEquals(0, testInstances0.getNumRelationalDate());\\n assertEquals(1, testInstances0.getSeed());\\n assertEquals(\\\"Testdata\\\", testInstances0.getRelation());\\n assertEquals(1, testInstances0.getClassType());\\n assertEquals(0, testInstances0.getNumRelational());\\n assertEquals(\\\" \\\", testInstances0.getWordSeparators());\\n assertEquals(20, testInstances0.getNumInstances());\\n assertEquals(0, testInstances0.getNumDate());\\n assertEquals(2, testInstances0.getNumAttributes());\\n assertEquals(2, testInstances0.getNumClasses());\\n assertEquals((-1), testInstances0.getClassIndex());\\n assertEquals(1, testInstances0.getNumRelationalNominal());\\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\\n assertEquals(0, testInstances0.getNumNumeric());\\n assertEquals(0, testInstances0.getNumRelationalNumeric());\\n assertEquals(0, testInstances0.getNumString());\\n \\n SMOreg sMOreg0 = new SMOreg();\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertNotNull(sMOreg0);\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n \\n Capabilities capabilities0 = sMOreg0.getCapabilities();\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertNotNull(capabilities0);\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n \\n TestInstances testInstances1 = TestInstances.forCapabilities(capabilities0);\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertNotNull(testInstances1);\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertEquals(0, testInstances1.getClassType());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(1, testInstances1.getSeed());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertFalse(testInstances1.getMultiInstance());\\n assertNotSame(testInstances1, testInstances0);\\n \\n Instances instances0 = testInstances1.generate(\\\"X/\\\\\\\\\\\");\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertNotNull(instances0);\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertEquals(0, testInstances1.getClassType());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(1, testInstances1.getSeed());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertFalse(testInstances1.getMultiInstance());\\n assertEquals(3, instances0.numAttributes());\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(2, instances0.classIndex());\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertEquals(20, instances0.size());\\n assertEquals(20, instances0.numInstances());\\n assertNotSame(testInstances1, testInstances0);\\n \\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertNotNull(evaluation0);\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertEquals(0, testInstances1.getClassType());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(1, testInstances1.getSeed());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertFalse(testInstances1.getMultiInstance());\\n assertEquals(3, instances0.numAttributes());\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(2, instances0.classIndex());\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertEquals(20, instances0.size());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\\n assertEquals(0.0, evaluation0.correct(), 0.01);\\n assertFalse(evaluation0.getDiscardPredictions());\\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\\n \\n evaluation0.useNoPriors();\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertEquals(0, testInstances1.getClassType());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(1, testInstances1.getSeed());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertFalse(testInstances1.getMultiInstance());\\n assertEquals(3, instances0.numAttributes());\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(2, instances0.classIndex());\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertEquals(20, instances0.size());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\\n assertEquals(0.0, evaluation0.correct(), 0.01);\\n assertFalse(evaluation0.getDiscardPredictions());\\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFEntropyGain(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFPriorEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\\n assertNotSame(testInstances1, testInstances0);\\n \\n evaluation0.addNumericTrainClass((-1.7976931348623157E308), 0.17499999701976776);\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertEquals(0, testInstances1.getClassType());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(1, testInstances1.getSeed());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertFalse(testInstances1.getMultiInstance());\\n assertEquals(3, instances0.numAttributes());\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(2, instances0.classIndex());\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertEquals(20, instances0.size());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\\n assertEquals(0.0, evaluation0.correct(), 0.01);\\n assertFalse(evaluation0.getDiscardPredictions());\\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFEntropyGain(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFPriorEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\\n assertNotSame(testInstances1, testInstances0);\\n \\n Evaluation evaluation1 = new Evaluation(instances0);\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertTrue(evaluation1.equals((Object)evaluation0));\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertNotNull(evaluation1);\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertEquals(0, testInstances1.getClassType());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(1, testInstances1.getSeed());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertFalse(testInstances1.getMultiInstance());\\n assertEquals(3, instances0.numAttributes());\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(2, instances0.classIndex());\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertEquals(20, instances0.size());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(0.0, evaluation1.incorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation1.meanAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation1.pctIncorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation1.avgCost(), 0.01);\\n assertEquals(Double.NaN, evaluation1.SFMeanPriorEntropy(), 0.01);\\n assertEquals(0.0, evaluation1.SFPriorEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation1.meanPriorAbsoluteError(), 0.01);\\n assertEquals(0.0, evaluation1.totalCost(), 0.01);\\n assertEquals(Double.NaN, evaluation1.errorRate(), 0.01);\\n assertEquals(0.0, evaluation1.SFEntropyGain(), 0.01);\\n assertEquals(Double.NaN, evaluation1.rootMeanPriorSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation1.SFMeanEntropyGain(), 0.01);\\n assertEquals(0.0, evaluation1.correct(), 0.01);\\n assertFalse(evaluation1.getDiscardPredictions());\\n assertEquals(Double.NaN, evaluation1.coverageOfTestCasesByPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation1.rootMeanSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation1.relativeAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation1.SFMeanSchemeEntropy(), 0.01);\\n assertEquals(0.0, evaluation1.SFSchemeEntropy(), 0.01);\\n assertEquals(0.0, evaluation1.numInstances(), 0.01);\\n assertEquals(Double.NaN, evaluation1.pctUnclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation1.pctCorrect(), 0.01);\\n assertEquals(0.0, evaluation1.unclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation1.sizeOfPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation1.rootRelativeSquaredError(), 0.01);\\n \\n String string0 = sMOreg0.toString();\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertNotNull(string0);\\n assertEquals(\\\"SMOreg: No model built yet.\\\", string0);\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n \\n double double0 = evaluation0.correlationCoefficient();\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertTrue(evaluation0.equals((Object)evaluation1));\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertEquals(Double.NaN, double0, 0.01);\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertEquals(0, testInstances1.getClassType());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(1, testInstances1.getSeed());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertFalse(testInstances1.getMultiInstance());\\n assertEquals(3, instances0.numAttributes());\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(2, instances0.classIndex());\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertEquals(20, instances0.size());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\\n assertEquals(0.0, evaluation0.correct(), 0.01);\\n assertFalse(evaluation0.getDiscardPredictions());\\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFEntropyGain(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFPriorEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\\n assertNotSame(testInstances1, testInstances0);\\n assertNotSame(evaluation0, evaluation1);\\n \\n double double1 = evaluation0.SFMeanEntropyGain();\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertTrue(evaluation0.equals((Object)evaluation1));\\n assertEquals(double1, double0, 0.01);\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertEquals(Double.NaN, double1, 0.01);\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertEquals(0, testInstances1.getClassType());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(1, testInstances1.getSeed());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertFalse(testInstances1.getMultiInstance());\\n assertEquals(3, instances0.numAttributes());\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(2, instances0.classIndex());\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertEquals(20, instances0.size());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\\n assertEquals(0.0, evaluation0.correct(), 0.01);\\n assertFalse(evaluation0.getDiscardPredictions());\\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFEntropyGain(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFPriorEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\\n assertNotSame(testInstances1, testInstances0);\\n assertNotSame(evaluation0, evaluation1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b66ab4b5d8d01e16840a547b07de5d68\",\n \"score\": \"0.59196484\",\n \"text\": \"@Test(timeout = 4000)\\n public void test01() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n String string0 = discretize0.getRevision();\\n assertEquals((-1.0), discretize0.getDesiredWeightOfInstancesPerInterval(), 0.01);\\n assertFalse(discretize0.getUseBinNumbers());\\n assertFalse(discretize0.getUseEqualFrequency());\\n assertEquals(\\\"8964\\\", string0);\\n assertFalse(discretize0.getFindNumBins());\\n assertEquals(10, discretize0.getBins());\\n assertFalse(discretize0.getMakeBinary());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"143019379099c6c9b60add3e4bdb1705\",\n \"score\": \"0.59189874\",\n \"text\": \"@Test(timeout = 4000)\\n public void test09() throws Throwable {\\n JRip jRip0 = new JRip();\\n jRip0.debugTipText();\\n AbstractClassifier.makeCopies(jRip0, 78);\\n jRip0.getCheckErrorRate();\\n jRip0.setCheckErrorRate(true);\\n int int0 = 200003;\\n BinarySparseInstance binarySparseInstance0 = new BinarySparseInstance(200003);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"798275cc0bedd7cabeb6932ec6ff8969\",\n \"score\": \"0.59171474\",\n \"text\": \"@Test(timeout = 4000)\\n public void test14() throws Throwable {\\n Discretize discretize0 = new Discretize(\\\"\\\");\\n discretize0.m_IgnoreClass = true;\\n discretize0.invertSelectionTipText();\\n discretize0.getOptions();\\n discretize0.getRevision();\\n // Undeclared exception!\\n try { \\n discretize0.findNumBins(1989);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"weka.filters.unsupervised.attribute.Discretize\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"df953b339487772ea7c243195f8c5b8c\",\n \"score\": \"0.5911588\",\n \"text\": \"@Test(groups=\\\"10s\\\", timeOut=60000)\\n\\tpublic void test6(){\\n\\t\\ttest(16,3,2,4,4,1);\\n\\t\\ttest(32,3,2,2,3,0);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c89c9c7f91a3caabf3cf81f5e860a611\",\n \"score\": \"0.59093946\",\n \"text\": \"@Test(timeout = 4000)\\n public void test38() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\\n Attribute attribute0 = new Attribute(\\\"Number of bins.\\\", 1461);\\n arrayList0.add(attribute0);\\n UnaryOperator.identity();\\n Instances instances0 = new Instances(\\\"Number of bins.\\\", arrayList0, 0);\\n discretize0.setInputFormat(instances0);\\n discretize0.batchFinished();\\n SparseInstance sparseInstance0 = new SparseInstance(0);\\n SparseInstance sparseInstance1 = new SparseInstance((Instance) sparseInstance0);\\n discretize0.input(sparseInstance1);\\n discretize0.input(sparseInstance1);\\n discretize0.calculateCutPoints();\\n assertFalse(discretize0.isNewBatch());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ad7d4cf5f4d5635de0be5902084f262\",\n \"score\": \"0.58993185\",\n \"text\": \"@Test(timeout = 4000)\\n public void test05() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n discretize0.m_UseBinNumbers = false;\\n discretize0.getCapabilities();\\n discretize0.globalInfo();\\n discretize0.setUseBinNumbers(true);\\n assertTrue(discretize0.getUseBinNumbers());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f17ad1cc43c1a5659a39c62a88027e03\",\n \"score\": \"0.5890477\",\n \"text\": \"public void testCalculateStatsReasonableCase() {\\n int nodeId = 0;\\n DiscoveryNodes.Builder discoBuilder = DiscoveryNodes.builder();\\n DiscoveryNode leader = newNode(nodeId++, DiscoveryNodeRole.MASTER_ROLE);\\n discoBuilder.add(leader);\\n discoBuilder.masterNodeId(leader.getId());\\n\\n DiscoveryNode hotNode1 = newNode(nodeId++, DiscoveryNodeRole.DATA_HOT_NODE_ROLE);\\n discoBuilder.add(hotNode1);\\n DiscoveryNode hotNode2 = newNode(nodeId++, DiscoveryNodeRole.DATA_HOT_NODE_ROLE);\\n discoBuilder.add(hotNode2);\\n DiscoveryNode hotNode3 = newNode(nodeId++, DiscoveryNodeRole.DATA_HOT_NODE_ROLE);\\n discoBuilder.add(hotNode3);\\n DiscoveryNode warmNode1 = newNode(nodeId++, DiscoveryNodeRole.DATA_WARM_NODE_ROLE);\\n discoBuilder.add(warmNode1);\\n DiscoveryNode warmNode2 = newNode(nodeId++, DiscoveryNodeRole.DATA_WARM_NODE_ROLE);\\n discoBuilder.add(warmNode2);\\n DiscoveryNode warmNode3 = newNode(nodeId++, DiscoveryNodeRole.DATA_WARM_NODE_ROLE);\\n discoBuilder.add(warmNode3);\\n DiscoveryNode warmNode4 = newNode(nodeId++, DiscoveryNodeRole.DATA_WARM_NODE_ROLE);\\n discoBuilder.add(warmNode4);\\n DiscoveryNode warmNode5 = newNode(nodeId++, DiscoveryNodeRole.DATA_WARM_NODE_ROLE);\\n discoBuilder.add(warmNode5);\\n DiscoveryNode coldNode1 = newNode(nodeId, DiscoveryNodeRole.DATA_COLD_NODE_ROLE);\\n discoBuilder.add(coldNode1);\\n\\n discoBuilder.localNodeId(hotNode1.getId());\\n\\n // Indices: 1 Hot index, 2 Warm indices, 3 Cold indices\\n Metadata.Builder metadataBuilder = Metadata.builder();\\n RoutingTable.Builder routingTableBuilder = RoutingTable.builder();\\n\\n IndexMetadata hotIndex1 = indexMetadata(\\\"hot_index_1\\\", 3, 1, DataTier.DATA_HOT);\\n metadataBuilder.put(hotIndex1, false).generateClusterUuidIfNeeded();\\n {\\n IndexRoutingTable.Builder indexRoutingTableBuilder = IndexRoutingTable.builder(hotIndex1.getIndex());\\n routeTestShardToNodes(hotIndex1, 0, indexRoutingTableBuilder, hotNode1, hotNode2);\\n routeTestShardToNodes(hotIndex1, 1, indexRoutingTableBuilder, hotNode2, hotNode3);\\n routeTestShardToNodes(hotIndex1, 2, indexRoutingTableBuilder, hotNode3, hotNode1);\\n routingTableBuilder.add(indexRoutingTableBuilder.build());\\n }\\n\\n IndexMetadata warmIndex1 = indexMetadata(\\\"warm_index_1\\\", 1, 1, DataTier.DATA_WARM);\\n metadataBuilder.put(warmIndex1, false).generateClusterUuidIfNeeded();\\n {\\n IndexRoutingTable.Builder indexRoutingTableBuilder = IndexRoutingTable.builder(warmIndex1.getIndex());\\n routeTestShardToNodes(warmIndex1, 0, indexRoutingTableBuilder, warmNode1, warmNode2);\\n routingTableBuilder.add(indexRoutingTableBuilder.build());\\n }\\n IndexMetadata warmIndex2 = indexMetadata(\\\"warm_index_2\\\", 1, 1, DataTier.DATA_WARM);\\n metadataBuilder.put(warmIndex2, false).generateClusterUuidIfNeeded();\\n {\\n IndexRoutingTable.Builder indexRoutingTableBuilder = IndexRoutingTable.builder(warmIndex2.getIndex());\\n routeTestShardToNodes(warmIndex2, 0, indexRoutingTableBuilder, warmNode3, warmNode4);\\n routingTableBuilder.add(indexRoutingTableBuilder.build());\\n }\\n\\n IndexMetadata coldIndex1 = indexMetadata(\\\"cold_index_1\\\", 1, 0, DataTier.DATA_COLD);\\n metadataBuilder.put(coldIndex1, false).generateClusterUuidIfNeeded();\\n {\\n IndexRoutingTable.Builder indexRoutingTableBuilder = IndexRoutingTable.builder(coldIndex1.getIndex());\\n routeTestShardToNodes(coldIndex1, 0, indexRoutingTableBuilder, coldNode1);\\n routingTableBuilder.add(indexRoutingTableBuilder.build());\\n }\\n IndexMetadata coldIndex2 = indexMetadata(\\\"cold_index_2\\\", 1, 0, DataTier.DATA_COLD);\\n metadataBuilder.put(coldIndex2, false).generateClusterUuidIfNeeded();\\n {\\n IndexRoutingTable.Builder indexRoutingTableBuilder = IndexRoutingTable.builder(coldIndex2.getIndex());\\n routeTestShardToNodes(coldIndex2, 0, indexRoutingTableBuilder, coldNode1);\\n routingTableBuilder.add(indexRoutingTableBuilder.build());\\n }\\n IndexMetadata coldIndex3 = indexMetadata(\\\"cold_index_3\\\", 1, 0, DataTier.DATA_COLD);\\n metadataBuilder.put(coldIndex3, false).generateClusterUuidIfNeeded();\\n {\\n IndexRoutingTable.Builder indexRoutingTableBuilder = IndexRoutingTable.builder(coldIndex3.getIndex());\\n routeTestShardToNodes(coldIndex3, 0, indexRoutingTableBuilder, coldNode1);\\n routingTableBuilder.add(indexRoutingTableBuilder.build());\\n }\\n\\n // Cluster State and create stats responses\\n ClusterState clusterState = ClusterState.builder(new ClusterName(\\\"test\\\"))\\n .nodes(discoBuilder)\\n .metadata(metadataBuilder)\\n .routingTable(routingTableBuilder.build())\\n .build();\\n\\n long byteSize = randomLongBetween(1024L, 1024L * 1024L * 1024L * 30L); // 1 KB to 30 GB\\n long docCount = randomLongBetween(100L, 100000000L); // one hundred to one hundred million\\n List<NodeStats> nodeStatsList = buildNodeStats(clusterState, byteSize, docCount);\\n\\n // Calculate usage\\n Map<String, String> indexByTier = DataTiersUsageTransportAction.tierIndices(clusterState.metadata().indices());\\n Map<String, DataTiersFeatureSetUsage.TierSpecificStats> tierSpecificStats = DataTiersUsageTransportAction.calculateStats(\\n nodeStatsList,\\n indexByTier,\\n clusterState.getRoutingNodes()\\n );\\n\\n // Verify - Node and Index stats are both collected\\n assertThat(tierSpecificStats.size(), is(3));\\n\\n DataTiersFeatureSetUsage.TierSpecificStats hotStats = tierSpecificStats.get(DataTier.DATA_HOT);\\n assertThat(hotStats, is(notNullValue()));\\n assertThat(hotStats.nodeCount, is(3));\\n assertThat(hotStats.indexCount, is(1));\\n assertThat(hotStats.totalShardCount, is(6));\\n assertThat(hotStats.docCount, is(6 * docCount));\\n assertThat(hotStats.totalByteCount, is(6 * byteSize));\\n assertThat(hotStats.primaryShardCount, is(3));\\n assertThat(hotStats.primaryByteCount, is(3 * byteSize));\\n assertThat(hotStats.primaryByteCountMedian, is(byteSize)); // All same size\\n assertThat(hotStats.primaryShardBytesMAD, is(0L)); // All same size\\n\\n DataTiersFeatureSetUsage.TierSpecificStats warmStats = tierSpecificStats.get(DataTier.DATA_WARM);\\n assertThat(warmStats, is(notNullValue()));\\n assertThat(warmStats.nodeCount, is(5));\\n assertThat(warmStats.indexCount, is(2));\\n assertThat(warmStats.totalShardCount, is(4));\\n assertThat(warmStats.docCount, is(4 * docCount));\\n assertThat(warmStats.totalByteCount, is(4 * byteSize));\\n assertThat(warmStats.primaryShardCount, is(2));\\n assertThat(warmStats.primaryByteCount, is(2 * byteSize));\\n assertThat(warmStats.primaryByteCountMedian, is(byteSize)); // All same size\\n assertThat(warmStats.primaryShardBytesMAD, is(0L)); // All same size\\n\\n DataTiersFeatureSetUsage.TierSpecificStats coldStats = tierSpecificStats.get(DataTier.DATA_COLD);\\n assertThat(coldStats, is(notNullValue()));\\n assertThat(coldStats.nodeCount, is(1));\\n assertThat(coldStats.indexCount, is(3));\\n assertThat(coldStats.totalShardCount, is(3));\\n assertThat(coldStats.docCount, is(3 * docCount));\\n assertThat(coldStats.totalByteCount, is(3 * byteSize));\\n assertThat(coldStats.primaryShardCount, is(3));\\n assertThat(coldStats.primaryByteCount, is(3 * byteSize));\\n assertThat(coldStats.primaryByteCountMedian, is(byteSize)); // All same size\\n assertThat(coldStats.primaryShardBytesMAD, is(0L)); // All same size\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1738af4ce415f19f84d0b2aa1935d721\",\n \"score\": \"0.5889058\",\n \"text\": \"@Test(timeout = 4000)\\n public void test01() throws Throwable {\\n String string0 = \\\"\\\";\\n Discretize discretize0 = new Discretize(\\\"\\\");\\n Range range0 = new Range();\\n discretize0.m_DiscretizeCols = range0;\\n discretize0.getCapabilities();\\n double double0 = (-3169.352147658);\\n discretize0.setDesiredWeightOfInstancesPerInterval((-3169.352147658));\\n discretize0.getInvertSelection();\\n discretize0.listOptions();\\n int int0 = 0;\\n discretize0.setBins(1324);\\n discretize0.getBinRangesString(0);\\n // Undeclared exception!\\n try { \\n discretize0.calculateCutPointsByEqualWidthBinning(0);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"weka.filters.unsupervised.attribute.Discretize\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a984fcd2004751febc49a766fc1cb4d\",\n \"score\": \"0.5860569\",\n \"text\": \"@Test(timeout = 4000)\\n public void test79() throws Throwable {\\n TestInstances testInstances0 = new TestInstances();\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertNotNull(testInstances0);\\n assertEquals(0, testInstances0.getNumRelationalDate());\\n assertEquals(2, testInstances0.getNumClasses());\\n assertEquals(0, testInstances0.getNumNumeric());\\n assertEquals(2, testInstances0.getNumAttributes());\\n assertEquals(0, testInstances0.getNumRelational());\\n assertEquals(0, testInstances0.getNumString());\\n assertFalse(testInstances0.getNoClass());\\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\\n assertEquals((-1), testInstances0.getClassIndex());\\n assertEquals(\\\" \\\", testInstances0.getWordSeparators());\\n assertEquals(0, testInstances0.getNumRelationalNumeric());\\n assertEquals(\\\"Testdata\\\", testInstances0.getRelation());\\n assertEquals(0, testInstances0.getNumRelationalString());\\n assertEquals(0, testInstances0.getNumDate());\\n assertEquals(1, testInstances0.getClassType());\\n assertEquals(2, testInstances0.getNumNominalValues());\\n assertEquals(1, testInstances0.getNumNominal());\\n assertEquals(20, testInstances0.getNumInstances());\\n assertFalse(testInstances0.getMultiInstance());\\n assertEquals(10, testInstances0.getNumInstancesRelational());\\n assertEquals(1, testInstances0.getNumRelationalNominal());\\n assertEquals(1, testInstances0.getSeed());\\n \\n SMOreg sMOreg0 = new SMOreg();\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertNotNull(sMOreg0);\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n \\n Capabilities capabilities0 = sMOreg0.getCapabilities();\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertNotNull(capabilities0);\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n \\n TestInstances testInstances1 = TestInstances.forCapabilities(capabilities0);\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertNotNull(testInstances1);\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals(1, testInstances1.getSeed());\\n assertFalse(testInstances1.getMultiInstance());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getClassType());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertFalse(testInstances1.getNoClass());\\n assertNotSame(testInstances1, testInstances0);\\n \\n Instances instances0 = testInstances1.generate(\\\"X/\\\\\\\\\\\");\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertNotNull(instances0);\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals(1, testInstances1.getSeed());\\n assertFalse(testInstances1.getMultiInstance());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getClassType());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(20, instances0.size());\\n assertEquals(3, instances0.numAttributes());\\n assertEquals(2, instances0.classIndex());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertNotSame(testInstances1, testInstances0);\\n \\n Evaluation evaluation0 = new Evaluation(instances0);\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertNotNull(evaluation0);\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals(1, testInstances1.getSeed());\\n assertFalse(testInstances1.getMultiInstance());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getClassType());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(20, instances0.size());\\n assertEquals(3, instances0.numAttributes());\\n assertEquals(2, instances0.classIndex());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\\n assertEquals(0.0, evaluation0.correct(), 0.01);\\n assertFalse(evaluation0.getDiscardPredictions());\\n \\n String string0 = sMOreg0.toString();\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertNotNull(string0);\\n assertEquals(\\\"SMOreg: No model built yet.\\\", string0);\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n \\n char[] charArray0 = new char[8];\\n charArray0[0] = 'i';\\n charArray0[1] = '!';\\n charArray0[2] = '!';\\n charArray0[3] = 'm';\\n charArray0[4] = ',';\\n charArray0[5] = 'S';\\n charArray0[6] = 'f';\\n charArray0[7] = '(';\\n String string1 = evaluation0.num2ShortID((-1591), charArray0, 0);\\n assertFalse(string1.equals((Object)string0));\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertArrayEquals(new char[] {'i', '!', '!', 'm', ',', 'S', 'f', '('}, charArray0);\\n assertNotNull(string1);\\n assertEquals(\\\"\\\", string1);\\n assertEquals(8, charArray0.length);\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals(1, testInstances1.getSeed());\\n assertFalse(testInstances1.getMultiInstance());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getClassType());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(20, instances0.size());\\n assertEquals(3, instances0.numAttributes());\\n assertEquals(2, instances0.classIndex());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\\n assertEquals(0.0, evaluation0.correct(), 0.01);\\n assertFalse(evaluation0.getDiscardPredictions());\\n assertNotSame(testInstances1, testInstances0);\\n \\n double double0 = (-2.0);\\n LibSVMLoader libSVMLoader0 = new LibSVMLoader();\\n assertNotNull(libSVMLoader0);\\n assertEquals(\\\"libsvm data files\\\", libSVMLoader0.getFileDescription());\\n assertEquals(\\\".libsvm\\\", libSVMLoader0.getFileExtension());\\n assertEquals(\\\"http://\\\", libSVMLoader0.retrieveURL());\\n assertFalse(libSVMLoader0.getUseRelativePath());\\n assertEquals(\\\"Use relative rather than absolute paths\\\", libSVMLoader0.useRelativePathTipText());\\n assertEquals(\\\"Reads a source that is in libsvm format.\\\\n\\\\nFor more information about libsvm see:\\\\n\\\\nhttp://www.csie.ntu.edu.tw/~cjlin/libsvm/\\\", libSVMLoader0.globalInfo());\\n \\n try { \\n libSVMLoader0.getNextInstance(instances0);\\n fail(\\\"Expecting exception: IOException\\\");\\n \\n } catch(IOException e) {\\n //\\n // LibSVMLoader can't read data sets incrementally.\\n //\\n verifyException(\\\"weka.core.converters.LibSVMLoader\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0dbe56070fc12d30ff378e2cb9f5c15\",\n \"score\": \"0.5855894\",\n \"text\": \"public void testRCo() {\\n\\t\\tFile projectDir = new File(testDirectoryPath);\\n\\t\\t\\n\\t\\tDirExplorer.Filter javaFilter = new JavaFilter();\\n\\t\\tDirExplorer.FileHandler sourceFileHandler = new SingleMetricFileHandler(projectDir, new NoHExtractor());\\n\\t\\t\\n\\t\\tnew DirExplorer(javaFilter, sourceFileHandler).explore(projectDir);\\t\\t\\n\\t\\t\\n\\t\\tAssert.assertEquals(2.0/8, MeasureDataset.getMeasure(\\\"NoHTest\\\", MetricSuite.NoH));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"05b0e482e2b6c9b1d7c3ff915921cac2\",\n \"score\": \"0.58547693\",\n \"text\": \"@Test(timeout = 4000)\\n public void test12() throws Throwable {\\n JRip jRip0 = new JRip();\\n LinkedList<String> linkedList0 = new LinkedList<String>();\\n Attribute attribute0 = new Attribute(\\\"49CkIL.|l=bjwvi\\\", linkedList0);\\n JRip.NumericAntd jRip_NumericAntd0 = jRip0.new NumericAntd(attribute0);\\n jRip_NumericAntd0.getRevision();\\n JRip.RipperRule jRip_RipperRule0 = jRip0.new RipperRule();\\n jRip_RipperRule0.setConsequent(2);\\n assertEquals(2.0, jRip_RipperRule0.getConsequent(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dece273f3ac59033f48f65a6dd569488\",\n \"score\": \"0.58538\",\n \"text\": \"@Test(timeout = 4000)\\n public void test18() throws Throwable {\\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\\n Instances instances0 = textDirectoryLoader0.getStructure();\\n MockRandom mockRandom0 = new MockRandom(0L);\\n instances0.randomize(mockRandom0);\\n Evaluation evaluation0 = new Evaluation(instances0);\\n evaluation0.getDiscardPredictions();\\n double double0 = evaluation0.KBRelativeInformation();\\n evaluation0.m_TrainClassWeights = null;\\n double double1 = evaluation0.fMeasure(3);\\n assertEquals(0.0, double1, 0.01);\\n \\n double double2 = evaluation0.weightedFalseNegativeRate();\\n assertEquals(double2, double0, 0.01);\\n assertEquals(Double.NaN, double2, 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"848831e37816f54984642c335e048562\",\n \"score\": \"0.5853747\",\n \"text\": \"@Test(timeout = 4000)\\n public void test24() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n double[][] doubleArray0 = new double[15][1];\\n Discretize discretize1 = new Discretize();\\n discretize0.m_CutPoints = doubleArray0;\\n String string0 = discretize0.getBinRangesString(12);\\n assertEquals(10, discretize0.getBins());\\n assertFalse(discretize0.getUseBinNumbers());\\n assertEquals(\\\"(-inf-0],(0-inf)\\\", string0);\\n assertFalse(discretize0.getMakeBinary());\\n assertEquals((-1.0), discretize0.getDesiredWeightOfInstancesPerInterval(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5dca8706f8f172e6a41a8b99bb0b6549\",\n \"score\": \"0.58527625\",\n \"text\": \"@Test(timeout = 4000)\\n public void test16() throws Throwable {\\n NucleotideSequence nucleotideSequence0 = mock(NucleotideSequence.class, new ViolatedAssumptionAnswer());\\n doReturn(175L).when(nucleotideSequence0).getLength();\\n QualitySequence qualitySequence0 = mock(QualitySequence.class, new ViolatedAssumptionAnswer());\\n doReturn(175L).when(qualitySequence0).getLength();\\n PositionSequence positionSequence0 = mock(PositionSequence.class, new ViolatedAssumptionAnswer());\\n DefaultPhd defaultPhd0 = new DefaultPhd(\\\"\\\", nucleotideSequence0, qualitySequence0, positionSequence0);\\n Map<String, String> map0 = defaultPhd0.getComments();\\n ArtificialPhd artificialPhd0 = ArtificialPhd.createNewbler454Phd(\\\"R5TB\\\", nucleotideSequence0, qualitySequence0, map0);\\n PositionSequence positionSequence1 = artificialPhd0.getPositionSequence();\\n DefaultPhd defaultPhd1 = new DefaultPhd(\\\"R5TB\\\", nucleotideSequence0, qualitySequence0, positionSequence1, map0);\\n PhdBuilder phdBuilder0 = new PhdBuilder(defaultPhd0);\\n phdBuilder0.peaks(positionSequence1);\\n byte[] byteArray0 = new byte[5];\\n byteArray0[0] = (byte) (-68);\\n byteArray0[1] = (byte)111;\\n byteArray0[2] = (byte) (-4);\\n byteArray0[3] = (byte)15;\\n byteArray0[4] = (byte)19;\\n short[] shortArray0 = new short[6];\\n shortArray0[0] = (short) (byte) (-68);\\n shortArray0[2] = (short) (byte) (-68);\\n shortArray0[3] = (short) (byte) (-68);\\n shortArray0[4] = (short) (byte)15;\\n shortArray0[5] = (short) (byte)111;\\n NucleotideSequence nucleotideSequence1 = mock(NucleotideSequence.class, new ViolatedAssumptionAnswer());\\n QualitySequence qualitySequence1 = mock(QualitySequence.class, new ViolatedAssumptionAnswer());\\n doReturn(0L, 0L, 0L, 0L).when(qualitySequence1).getLength();\\n DefaultChannel defaultChannel0 = new DefaultChannel(qualitySequence1, positionSequence1);\\n DefaultChannelGroup defaultChannelGroup0 = new DefaultChannelGroup(defaultChannel0, defaultChannel0, defaultChannel0, defaultChannel0);\\n BasicChromatogram basicChromatogram0 = new BasicChromatogram(\\\"etPR7P\\\\\\\"dO\\\", nucleotideSequence1, qualitySequence1, positionSequence1, defaultChannelGroup0);\\n PhdBuilder phdBuilder1 = new PhdBuilder(basicChromatogram0);\\n BasicChromatogram basicChromatogram1 = null;\\n try {\\n basicChromatogram1 = new BasicChromatogram(\\\"\\\", \\\"\\\", byteArray0, positionSequence1, defaultChannelGroup0, map0);\\n fail(\\\"Expecting exception: IllegalArgumentException\\\");\\n \\n } catch(IllegalArgumentException e) {\\n //\\n // qualityScore of our range -68\\n //\\n verifyException(\\\"org.jcvi.jillion.core.qual.PhredQuality\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f348c86b4f7be1904cd3e1509f25e6b8\",\n \"score\": \"0.5845019\",\n \"text\": \"@Test(timeout = 4000)\\n public void test12() throws Throwable {\\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\\n Instances instances0 = textDirectoryLoader0.getStructure();\\n String[] stringArray0 = new String[6];\\n stringArray0[0] = \\\".bsi\\\";\\n stringArray0[1] = \\\".arff\\\";\\n stringArray0[2] = \\\"@data\\\";\\n stringArray0[3] = \\\" public Capabilities getCapabilities() {\\\\n\\\";\\n stringArray0[4] = \\\"@data\\\";\\n stringArray0[5] = \\\".arff\\\";\\n textDirectoryLoader0.setOptions(stringArray0);\\n Evaluation evaluation0 = new Evaluation(instances0);\\n double double0 = evaluation0.weightedAreaUnderROC();\\n double double1 = evaluation0.avgCost();\\n assertEquals(double1, double0, 0.01);\\n assertEquals(Double.NaN, double1, 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3236cd49e0c488ae17a1ea545f1575ba\",\n \"score\": \"0.5840496\",\n \"text\": \"@Test(timeout = 4000)\\n public void test09() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n discretize0.setIgnoreClass(true);\\n discretize0.m_NumBins = 115;\\n discretize0.setOutputFormat();\\n discretize0.setInvertSelection(false);\\n discretize0.setUseBinNumbers(true);\\n Filter.runFilter(discretize0, (String[]) null);\\n discretize0.setIgnoreClass(true);\\n discretize0.binsTipText();\\n discretize0.invertSelectionTipText();\\n double[] doubleArray0 = new double[8];\\n doubleArray0[0] = (double) 115;\\n doubleArray0[1] = (double) 115;\\n doubleArray0[2] = (double) 115;\\n doubleArray0[3] = (double) 10;\\n doubleArray0[4] = (double) 10;\\n doubleArray0[5] = (double) 10;\\n doubleArray0[6] = 1349.216915;\\n doubleArray0[7] = 1349.216915;\\n SparseInstance sparseInstance0 = new SparseInstance(1349.216915, doubleArray0);\\n BinarySparseInstance binarySparseInstance0 = new BinarySparseInstance((Instance) sparseInstance0);\\n SparseInstance sparseInstance1 = new SparseInstance((Instance) binarySparseInstance0);\\n discretize0.useEqualFrequencyTipText();\\n discretize0.makeBinaryTipText();\\n discretize0.setAttributeIndices(\\\"If set to true, equal-frequency binning will be used instead of equal-width binning.\\\");\\n discretize0.getInvertSelection();\\n // Undeclared exception!\\n try { \\n discretize0.calculateCutPointsByEqualWidthBinning((-2049));\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"weka.filters.unsupervised.attribute.Discretize\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"063aa340960b8168bce15f35d502cc87\",\n \"score\": \"0.58318055\",\n \"text\": \"@Test(timeout = 4000)\\n public void test02() throws Throwable {\\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer();\\n String string0 = makeDensityBasedClusterer0.clustererTipText();\\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\\n assertEquals(\\\"the clusterer to wrap\\\", string0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c9fb4f30ab3b8ca6244c6d06a531c49\",\n \"score\": \"0.5829034\",\n \"text\": \"@Test(timeout = 4000)\\n public void test16() throws Throwable {\\n FileSystemHandling.setPermissions((EvoSuiteFile) null, false, false, true);\\n FileSystemHandling.shouldAllThrowIOExceptions();\\n Discretize discretize0 = new Discretize();\\n assertFalse(discretize0.getFindNumBins());\\n \\n discretize0.m_FindNumBins = true;\\n discretize0.getOptions();\\n assertTrue(discretize0.getFindNumBins());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe451d4b4f23e18e94f915edad76f3d4\",\n \"score\": \"0.5821665\",\n \"text\": \"@Test(timeout = 4000)\\n public void test19() throws Throwable {\\n JRip jRip0 = new JRip();\\n jRip0.getOptions();\\n int int0 = 0;\\n jRip0.setFolds(0);\\n Utils.log2 = (double) 0;\\n JRip jRip1 = (JRip)AbstractClassifier.makeCopy(jRip0);\\n jRip1.enumerateMeasures();\\n jRip1.getUsePruning();\\n try { \\n jRip0.buildClassifier((Instances) null);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"weka.core.Capabilities\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8fdb4cf6f6d9303c65a72c82db45c8c\",\n \"score\": \"0.58149165\",\n \"text\": \"@Test(timeout = 4000)\\n public void test30() throws Throwable {\\n JRip jRip0 = new JRip();\\n Attribute attribute0 = new Attribute(\\\"eus|D4*|\\\", \\\"\\\");\\n JRip.RipperRule jRip_RipperRule0 = jRip0.new RipperRule();\\n JRip.RipperRule jRip_RipperRule1 = jRip0.new RipperRule();\\n assertEquals((-1.0), jRip_RipperRule1.getConsequent(), 0.01);\\n \\n JRip.NumericAntd jRip_NumericAntd0 = jRip0.new NumericAntd(attribute0);\\n JRip.NumericAntd jRip_NumericAntd1 = (JRip.NumericAntd)jRip_NumericAntd0.copy();\\n assertEquals(3, jRip0.getFolds());\\n assertEquals(2, jRip0.getOptimizations());\\n assertEquals(2.0, jRip0.getMinNo(), 0.01);\\n assertEquals(Double.NaN, jRip_NumericAntd1.getAccu(), 0.01);\\n assertEquals(Double.NaN, jRip_NumericAntd1.getAccuRate(), 0.01);\\n assertTrue(jRip0.getCheckErrorRate());\\n assertNotSame(jRip_NumericAntd1, jRip_NumericAntd0);\\n assertEquals(1L, jRip0.getSeed());\\n assertTrue(jRip0.getUsePruning());\\n assertEquals(Double.NaN, jRip_NumericAntd1.getAttrValue(), 0.01);\\n assertEquals(0.0, jRip_NumericAntd1.getMaxInfoGain(), 0.01);\\n assertFalse(jRip0.getDebug());\\n assertEquals(Double.NaN, jRip_NumericAntd1.getCover(), 0.01);\\n assertEquals(Double.NaN, jRip_NumericAntd1.getSplitPoint(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb0c9396d136499a757120e134a8e000\",\n \"score\": \"0.5814749\",\n \"text\": \"@Test\\n public void testGetCounterCode() {\\n System.out.println(\\\"getCounterCode\\\");\\n Simulation instance = new Simulation();\\n int expResult = instance.getCounterCode();\\n int result = instance.getCounterCode();\\n assertEquals(expResult, result);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb58c1e63e9f6280b718bec09919c374\",\n \"score\": \"0.58145565\",\n \"text\": \"@Test(timeout = 4000)\\n public void test17() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n String[] stringArray0 = new String[6];\\n stringArray0[0] = \\\"u?4!4@63BR]xDvOG}*\\\";\\n stringArray0[1] = \\\"zH$v#KP\\\";\\n stringArray0[2] = \\\"Pn2VY2VAsU+.h0W\\\";\\n stringArray0[3] = \\\"g-$I's_z@{'\\\";\\n stringArray0[4] = \\\"-R\\\";\\n stringArray0[5] = \\\"d7i`V\\\";\\n discretize0.setOptions(stringArray0);\\n assertFalse(discretize0.getUseEqualFrequency());\\n assertFalse(discretize0.getMakeBinary());\\n assertFalse(discretize0.getFindNumBins());\\n assertEquals((-1.0), discretize0.getDesiredWeightOfInstancesPerInterval(), 0.01);\\n assertEquals(10, discretize0.getBins());\\n assertFalse(discretize0.getUseBinNumbers());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e0e5273a2439ee9791ba5aeb2e81fd4\",\n \"score\": \"0.58081084\",\n \"text\": \"@Test\\n public void TestTopBottomN() {\\n Scope.enter();\\n double[] checkPercent = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; //, 11, 12, 13, 14, 15, 17, 19}; // complete test\\n int numRuns = 1;\\n double testPercent = 0; // store test percentage\\n Frame topLong = null, topFloat = null, bottomLong = null, bottomFloat = null;\\n\\n // load in the datasets with the answers\\n _train = parseTestFile(Key.make(\\\"topbottom\\\"), \\\"smalldata/jira/TopBottomN.csv.zip\\\");\\n topFloat = parseTestFile(Key.make(\\\"top20\\\"), \\\"smalldata/jira/Top20Per.csv.zip\\\");\\n topLong = topFloat.extractFrame(0, 1);\\n bottomFloat = parseTestFile(Key.make(\\\"bottom20\\\"), \\\"smalldata/jira/Bottom20Per.csv.zip\\\");\\n bottomLong = bottomFloat.extractFrame(0, 1);\\n\\n Scope.track(_train);\\n Scope.track(topLong);\\n Scope.track(topFloat);\\n Scope.track(bottomFloat);\\n Scope.track(bottomLong);\\n\\n try {\\n for (int index = 0; index < numRuns; index++) { // randomly choose 4 percentages to test\\n testPercent = checkPercent[_rand.nextInt(checkPercent.length)];\\n int testNo = _rand.nextInt(4);\\n Log.info(\\\"Percentage is \\\" + testPercent);\\n if (testNo == 0) {\\n Log.info(\\\"Testing top N long.\\\");\\n testTopBottom(topLong, testPercent, 1, \\\"0\\\", _tolerance);\\n }\\n if (testNo == 1) {\\n Log.info(\\\"Testing top N float.\\\");\\n testTopBottom(topFloat, testPercent, 1, \\\"1\\\", _tolerance); // test top % Float\\n }\\n if (testNo == 2) {\\n Log.info(\\\"Testing bottom N long.\\\");\\n testTopBottom(bottomLong, testPercent, -1, \\\"0\\\", _tolerance); // test bottom % Long\\n }\\n if (testNo == 3) {\\n Log.info(\\\"Testing bottom N float.\\\");\\n testTopBottom(bottomFloat, testPercent, -1, \\\"1\\\", _tolerance); // test bottom % Float\\n }\\n }\\n } finally {\\n Scope.exit();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c4818ad3619a0ba133cb8394dde155f\",\n \"score\": \"0.5805535\",\n \"text\": \"@Test(timeout = 4000)\\n public void test08() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n discretize0.m_UseBinNumbers = false;\\n discretize0.getCapabilities();\\n discretize0.getCutPoints(1108);\\n discretize0.setUseEqualFrequency(true);\\n discretize0.getOptions();\\n // Undeclared exception!\\n try { \\n discretize0.numPendingOutput();\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // No output instance format defined\\n //\\n verifyException(\\\"weka.filters.Filter\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8025683fa29d449303f1e0ab6715aaa4\",\n \"score\": \"0.580025\",\n \"text\": \"@Test(timeout = 4000)\\n public void test43() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n Attribute attribute0 = new Attribute((String) null);\\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\\n arrayList0.add(attribute0);\\n discretize0.m_IgnoreClass = true;\\n Instances instances0 = new Instances(\\\"date\\\", arrayList0, 88);\\n int int0 = discretize0.m_ClassIndex;\\n discretize0.setInputFormat(instances0);\\n discretize0.setBins(4595);\\n discretize0.getFindNumBins();\\n discretize0.setBins((-1));\\n // Undeclared exception!\\n try { \\n discretize0.calculateCutPointsByEqualWidthBinning(2);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"weka.filters.unsupervised.attribute.Discretize\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26bf6fe01e1f66495b24d77b67e2812d\",\n \"score\": \"0.57926476\",\n \"text\": \"@Test(timeout = 4000)\\n public void test30() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n EvoSuiteFile evoSuiteFile0 = new EvoSuiteFile(\\\"/home/ubuntu/wekafiles/props/Capabilities.props\\\");\\n FileSystemHandling.appendStringToFile(evoSuiteFile0, \\\"O\\\");\\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\\n Attribute attribute0 = new Attribute(\\\"Number of bins.\\\", 1461);\\n arrayList0.add(attribute0);\\n Instances instances0 = new Instances(\\\"Number of bins.\\\", arrayList0, 1);\\n discretize0.setInputFormat(instances0);\\n double[] doubleArray0 = new double[3];\\n int[] intArray0 = new int[9];\\n intArray0[0] = 0;\\n intArray0[1] = 3;\\n intArray0[2] = 0;\\n intArray0[3] = 0;\\n intArray0[4] = 1461;\\n intArray0[5] = 0;\\n intArray0[6] = 0;\\n intArray0[7] = 1461;\\n intArray0[8] = 1;\\n SparseInstance sparseInstance0 = new SparseInstance(1, doubleArray0, intArray0, 1);\\n // Undeclared exception!\\n try { \\n discretize0.input(sparseInstance0);\\n fail(\\\"Expecting exception: IllegalArgumentException\\\");\\n \\n } catch(IllegalArgumentException e) {\\n //\\n // Instance has no dataset assigned!!\\n //\\n verifyException(\\\"weka.core.RelationalLocator\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3aeaa90e1e8975559ffcf79b63e6d6f3\",\n \"score\": \"0.5790018\",\n \"text\": \"@Test(timeout = 4000)\\n public void test33() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\\n Attribute attribute0 = new Attribute(\\\"Number of bins.\\\", 1461);\\n arrayList0.add(attribute0);\\n UnaryOperator.identity();\\n Instances instances0 = new Instances(\\\"Number of bins.\\\", arrayList0, 1);\\n discretize0.setInputFormat(instances0);\\n discretize0.batchFinished();\\n SparseInstance sparseInstance0 = new SparseInstance(0);\\n SparseInstance sparseInstance1 = new SparseInstance((Instance) sparseInstance0);\\n discretize0.input(sparseInstance1);\\n discretize0.calculateCutPoints();\\n // Undeclared exception!\\n try { \\n discretize0.findNumBins(1);\\n fail(\\\"Expecting exception: ArrayIndexOutOfBoundsException\\\");\\n \\n } catch(ArrayIndexOutOfBoundsException e) {\\n //\\n // 1\\n //\\n verifyException(\\\"weka.filters.unsupervised.attribute.Discretize\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e30940aeed4182ca0f6b3c820cac35a5\",\n \"score\": \"0.57852906\",\n \"text\": \"@Test(timeout = 4000)\\n public void test47() throws Throwable {\\n TestInstances testInstances0 = new TestInstances();\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertNotNull(testInstances0);\\n assertEquals(2, testInstances0.getNumNominalValues());\\n assertEquals(0, testInstances0.getNumDate());\\n assertEquals(\\\" \\\", testInstances0.getWordSeparators());\\n assertEquals(0, testInstances0.getNumRelationalNumeric());\\n assertEquals(\\\"Testdata\\\", testInstances0.getRelation());\\n assertEquals(20, testInstances0.getNumInstances());\\n assertEquals(0, testInstances0.getNumRelationalString());\\n assertEquals(1, testInstances0.getNumNominal());\\n assertEquals(1, testInstances0.getClassType());\\n assertEquals((-1), testInstances0.getClassIndex());\\n assertEquals(2, testInstances0.getNumRelationalNominalValues());\\n assertFalse(testInstances0.getNoClass());\\n assertEquals(2, testInstances0.getNumAttributes());\\n assertEquals(0, testInstances0.getNumNumeric());\\n assertEquals(0, testInstances0.getNumString());\\n assertEquals(0, testInstances0.getNumRelationalDate());\\n assertEquals(2, testInstances0.getNumClasses());\\n assertEquals(0, testInstances0.getNumRelational());\\n assertEquals(1, testInstances0.getSeed());\\n assertEquals(1, testInstances0.getNumRelationalNominal());\\n assertFalse(testInstances0.getMultiInstance());\\n assertEquals(10, testInstances0.getNumInstancesRelational());\\n \\n SMOreg sMOreg0 = new SMOreg();\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertNotNull(sMOreg0);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n \\n Capabilities capabilities0 = sMOreg0.getCapabilities();\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertNotNull(capabilities0);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n \\n TestInstances testInstances1 = TestInstances.forCapabilities(capabilities0);\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertNotNull(testInstances1);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(0, testInstances1.getClassType());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertFalse(testInstances1.getMultiInstance());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertEquals(1, testInstances1.getSeed());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertNotSame(testInstances1, testInstances0);\\n \\n Instances instances0 = testInstances1.generate(\\\"v5;/_&:;#I,\\\");\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertNotNull(instances0);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(0, testInstances1.getClassType());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertFalse(testInstances1.getMultiInstance());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertEquals(1, testInstances1.getSeed());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(2, instances0.classIndex());\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(20, instances0.size());\\n assertEquals(3, instances0.numAttributes());\\n assertNotSame(testInstances1, testInstances0);\\n \\n Capabilities capabilities1 = capabilities0.getClassCapabilities();\\n assertFalse(capabilities1.equals((Object)capabilities0));\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertNotNull(capabilities1);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertEquals(1, capabilities1.getMinimumNumberInstances());\\n assertFalse(capabilities1.hasDependencies());\\n assertNotSame(capabilities0, capabilities1);\\n assertNotSame(capabilities1, capabilities0);\\n \\n CostSensitiveClassifier costSensitiveClassifier0 = new CostSensitiveClassifier();\\n assertEquals(2, CostSensitiveClassifier.MATRIX_SUPPLIED);\\n assertEquals(1, CostSensitiveClassifier.MATRIX_ON_DEMAND);\\n assertNotNull(costSensitiveClassifier0);\\n assertEquals(\\\"The base classifier to be used.\\\", costSensitiveClassifier0.classifierTipText());\\n assertEquals(\\\"Sets the directory where cost files are loaded from. This option is used when the costMatrixSource is set to \\\\\\\"On Demand\\\\\\\".\\\", costSensitiveClassifier0.onDemandDirectoryTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", costSensitiveClassifier0.debugTipText());\\n assertFalse(costSensitiveClassifier0.getMinimizeExpectedCost());\\n assertEquals(1, costSensitiveClassifier0.getSeed());\\n assertEquals(0, costSensitiveClassifier0.graphType());\\n assertEquals(\\\"Sets the cost matrix explicitly. This matrix is used if the costMatrixSource property is set to \\\\\\\"Supplied\\\\\\\".\\\", costSensitiveClassifier0.costMatrixTipText());\\n assertFalse(costSensitiveClassifier0.getDebug());\\n assertEquals(\\\"A metaclassifier that makes its base classifier cost-sensitive. Two methods can be used to introduce cost-sensitivity: reweighting training instances according to the total cost assigned to each class; or predicting the class with minimum expected misclassification cost (rather than the most likely class). Performance can often be improved by using a Bagged classifier to improve the probability estimates of the base classifier.\\\", costSensitiveClassifier0.globalInfo());\\n assertEquals(\\\"The random number seed to be used.\\\", costSensitiveClassifier0.seedTipText());\\n assertEquals(\\\"Sets whether the minimum expected cost criteria will be used. If this is false, the training data will be reweighted according to the costs assigned to each class. If true, the minimum expected cost criteria will be used.\\\", costSensitiveClassifier0.minimizeExpectedCostTipText());\\n \\n CostMatrix costMatrix0 = costSensitiveClassifier0.getCostMatrix();\\n assertEquals(2, CostSensitiveClassifier.MATRIX_SUPPLIED);\\n assertEquals(1, CostSensitiveClassifier.MATRIX_ON_DEMAND);\\n assertNotNull(costMatrix0);\\n assertEquals(\\\"The base classifier to be used.\\\", costSensitiveClassifier0.classifierTipText());\\n assertEquals(\\\"Sets the directory where cost files are loaded from. This option is used when the costMatrixSource is set to \\\\\\\"On Demand\\\\\\\".\\\", costSensitiveClassifier0.onDemandDirectoryTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", costSensitiveClassifier0.debugTipText());\\n assertFalse(costSensitiveClassifier0.getMinimizeExpectedCost());\\n assertEquals(1, costSensitiveClassifier0.getSeed());\\n assertEquals(0, costSensitiveClassifier0.graphType());\\n assertEquals(\\\"Sets the cost matrix explicitly. This matrix is used if the costMatrixSource property is set to \\\\\\\"Supplied\\\\\\\".\\\", costSensitiveClassifier0.costMatrixTipText());\\n assertFalse(costSensitiveClassifier0.getDebug());\\n assertEquals(\\\"A metaclassifier that makes its base classifier cost-sensitive. Two methods can be used to introduce cost-sensitivity: reweighting training instances according to the total cost assigned to each class; or predicting the class with minimum expected misclassification cost (rather than the most likely class). Performance can often be improved by using a Bagged classifier to improve the probability estimates of the base classifier.\\\", costSensitiveClassifier0.globalInfo());\\n assertEquals(\\\"The random number seed to be used.\\\", costSensitiveClassifier0.seedTipText());\\n assertEquals(\\\"Sets whether the minimum expected cost criteria will be used. If this is false, the training data will be reweighted according to the costs assigned to each class. If true, the minimum expected cost criteria will be used.\\\", costSensitiveClassifier0.minimizeExpectedCostTipText());\\n assertEquals(1, costMatrix0.numRows());\\n assertEquals(1, costMatrix0.size());\\n assertEquals(1, costMatrix0.numColumns());\\n \\n Evaluation evaluation0 = new Evaluation(instances0, (CostMatrix) null);\\n assertFalse(capabilities0.equals((Object)capabilities1));\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertNotNull(evaluation0);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(0, testInstances1.getClassType());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertFalse(testInstances1.getMultiInstance());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertEquals(1, testInstances1.getSeed());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(2, instances0.classIndex());\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(20, instances0.size());\\n assertEquals(3, instances0.numAttributes());\\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\\n assertEquals(0.0, evaluation0.correct(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\\n assertFalse(evaluation0.getDiscardPredictions());\\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\\n \\n double double0 = evaluation0.errorRate();\\n assertFalse(capabilities0.equals((Object)capabilities1));\\n assertFalse(testInstances1.equals((Object)testInstances0));\\n assertEquals(1, SMOreg.FILTER_STANDARDIZE);\\n assertEquals(0, SMOreg.FILTER_NORMALIZE);\\n assertEquals(2, SMOreg.FILTER_NONE);\\n assertEquals((-2), TestInstances.NO_CLASS);\\n assertEquals((-1), TestInstances.CLASS_IS_LAST);\\n assertEquals(Double.NaN, double0, 0.01);\\n assertEquals(\\\"Determines how/if the data will be transformed.\\\", sMOreg0.filterTypeTipText());\\n assertEquals(\\\"If set to true, classifier may output additional info to the console.\\\", sMOreg0.debugTipText());\\n assertEquals(\\\"The complexity parameter C.\\\", sMOreg0.cTipText());\\n assertEquals(\\\"The kernel to use.\\\", sMOreg0.kernelTipText());\\n assertEquals(1.0, sMOreg0.getC(), 0.01);\\n assertFalse(sMOreg0.getDebug());\\n assertEquals(\\\"The learning algorithm.\\\", sMOreg0.regOptimizerTipText());\\n assertTrue(capabilities0.hasDependencies());\\n assertEquals(1, capabilities0.getMinimumNumberInstances());\\n assertEquals(3, testInstances1.getNumAttributes());\\n assertEquals(1, testInstances1.getNumNumeric());\\n assertEquals(0, testInstances1.getNumString());\\n assertEquals(0, testInstances1.getClassType());\\n assertEquals(1, testInstances1.getNumNominal());\\n assertEquals(0, testInstances1.getNumRelationalDate());\\n assertEquals((-1), testInstances1.getClassIndex());\\n assertEquals(2, testInstances1.getNumClasses());\\n assertEquals(20, testInstances1.getNumInstances());\\n assertEquals(\\\" \\\", testInstances1.getWordSeparators());\\n assertEquals(\\\"Testdata\\\", testInstances1.getRelation());\\n assertEquals(0, testInstances1.getNumRelational());\\n assertEquals(0, testInstances1.getNumDate());\\n assertEquals(2, testInstances1.getNumNominalValues());\\n assertFalse(testInstances1.getMultiInstance());\\n assertFalse(testInstances1.getNoClass());\\n assertEquals(2, testInstances1.getNumRelationalNominalValues());\\n assertEquals(10, testInstances1.getNumInstancesRelational());\\n assertEquals(1, testInstances1.getSeed());\\n assertEquals(1, testInstances1.getNumRelationalNominal());\\n assertEquals(1, testInstances1.getNumRelationalNumeric());\\n assertEquals(0, testInstances1.getNumRelationalString());\\n assertEquals(20.0, instances0.sumOfWeights(), 0.01);\\n assertEquals(\\\"Testdata\\\", instances0.relationName());\\n assertEquals(20, instances0.numInstances());\\n assertEquals(1, instances0.numClasses());\\n assertEquals(2, instances0.classIndex());\\n assertFalse(instances0.checkForStringAttributes());\\n assertEquals(20, instances0.size());\\n assertEquals(3, instances0.numAttributes());\\n assertEquals(0.0, evaluation0.incorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.sizeOfPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctIncorrect(), 0.01);\\n assertEquals(Double.NaN, evaluation0.meanPriorAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.errorRate(), 0.01);\\n assertEquals(Double.NaN, evaluation0.avgCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanSchemeEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.numInstances(), 0.01);\\n assertEquals(Double.NaN, evaluation0.coverageOfTestCasesByPredictedRegions(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctCorrect(), 0.01);\\n assertEquals(0.0, evaluation0.SFSchemeEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.SFEntropyGain(), 0.01);\\n assertEquals(0.0, evaluation0.correct(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanPriorSquaredError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.SFMeanEntropyGain(), 0.01);\\n assertFalse(evaluation0.getDiscardPredictions());\\n assertEquals(Double.NaN, evaluation0.SFMeanPriorEntropy(), 0.01);\\n assertEquals(0.0, evaluation0.SFPriorEntropy(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootRelativeSquaredError(), 0.01);\\n assertEquals(0.0, evaluation0.unclassified(), 0.01);\\n assertEquals(Double.NaN, evaluation0.pctUnclassified(), 0.01);\\n assertEquals(0.0, evaluation0.totalCost(), 0.01);\\n assertEquals(Double.NaN, evaluation0.relativeAbsoluteError(), 0.01);\\n assertEquals(Double.NaN, evaluation0.rootMeanSquaredError(), 0.01);\\n assertNotSame(capabilities0, capabilities1);\\n assertNotSame(testInstances1, testInstances0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c5247f437b87228f72a4da6439c711e\",\n \"score\": \"0.57836074\",\n \"text\": \"@Test(timeout = 4000)\\n public void test08() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n boolean boolean0 = true;\\n discretize0.setUseEqualFrequency(true);\\n discretize0.globalInfo();\\n discretize0.findNumBinsTipText();\\n discretize0.setAttributeIndices(\\\"Optimize number of equal-width bins using leave-one-out. Doesn't work for equal-frequency binning\\\");\\n int int0 = (-576);\\n discretize0.setBins((-576));\\n discretize0.setOutputFormat();\\n discretize0.getUseBinNumbers();\\n discretize0.m_UseEqualFrequency = true;\\n discretize0.getBinRangesString(0);\\n discretize0.globalInfo();\\n discretize0.getMakeBinary();\\n // Undeclared exception!\\n try { \\n discretize0.batchFinished();\\n fail(\\\"Expecting exception: IllegalStateException\\\");\\n \\n } catch(IllegalStateException e) {\\n //\\n // No input instance format defined\\n //\\n verifyException(\\\"weka.filters.unsupervised.attribute.Discretize\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e573f79f9b459289a116d0422fbee3d\",\n \"score\": \"0.5781802\",\n \"text\": \"@Test(timeout = 4000)\\n public void test34() throws Throwable {\\n Discretize discretize0 = new Discretize();\\n discretize0.m_DesiredWeightOfInstancesPerInterval = 482.4959;\\n ArrayList<Attribute> arrayList0 = new ArrayList<Attribute>();\\n Attribute attribute0 = new Attribute(\\\"Number of bins.\\\");\\n arrayList0.add(attribute0);\\n Instances instances0 = new Instances(\\\"Att:\\\", arrayList0, 3);\\n discretize0.setInputFormat(instances0);\\n // Undeclared exception!\\n try { \\n discretize0.calculateCutPointsByEqualFrequencyBinning(0);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"weka.filters.unsupervised.attribute.Discretize\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c8e5ef151b3eb31dfbecb9ac87c058ac\",\n \"score\": \"0.5781538\",\n \"text\": \"@Test\\n\\tpublic void testCoherenceRandom() {\\n\\t\\tRandom rand = new Random();\\n\\t\\tfor(int i = 0; i < 100; i++) {\\n\\t\\t\\tHashMap<String, Double> req = new HashMap<String, Double>();\\n\\t\\t\\tdouble px0 = rand.nextDouble();\\n\\t\\t\\treq.put(\\\"px0\\\", px0);\\n\\t\\t\\tHashMap<String, Double> solMax = amoeba.maximize(req);\\n\\t\\t\\treq.put(\\\"px1\\\", solMax.get(\\\"px1\\\"));\\n\\t\\t\\treq.put(\\\"px2\\\", solMax.get(\\\"px2\\\"));\\n\\t\\t\\treq.put(\\\"oracle\\\", 0.0);\\n\\t\\t\\tdouble res = amoeba.request(req);\\n\\t\\t\\tassertEquals(Round.round(solMax.get(\\\"oracle\\\"), 8), Round.round(res, 8));\\t\\t\\t\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c2c10b8867126e96c7641ffcfd104303\",\n \"score\": \"0.5779588\",\n \"text\": \"@Test(timeout = 4000)\\n public void test05() throws Throwable {\\n MakeDensityBasedClusterer makeDensityBasedClusterer0 = new MakeDensityBasedClusterer();\\n Capabilities capabilities0 = makeDensityBasedClusterer0.getCapabilities();\\n MakeDensityBasedClusterer makeDensityBasedClusterer1 = new MakeDensityBasedClusterer(makeDensityBasedClusterer0);\\n TestInstances testInstances0 = TestInstances.forCapabilities(capabilities0);\\n Instances instances0 = testInstances0.generate();\\n assertEquals(2, instances0.numAttributes());\\n \\n makeDensityBasedClusterer1.buildClusterer(instances0);\\n assertEquals(1.0E-6, makeDensityBasedClusterer0.getMinStdDev(), 0.01);\\n assertEquals(1.0E-6, makeDensityBasedClusterer1.getMinStdDev(), 0.01);\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983790,"cells":{"query_id":{"kind":"string","value":"253ca2125a8a60cb8732200a7797b0e3"},"query":{"kind":"string","value":"optional string ymd_first = 3;"},"positive_passages":{"kind":"list like","value":[{"docid":"5702ae5bb65ad904986dbe31d9c7bfcd","score":"0.51106757","text":"public boolean hasYmdFirst() {\n return ((bitField0_ & 0x00000004) == 0x00000004);\n }","title":""}],"string":"[\n {\n \"docid\": \"5702ae5bb65ad904986dbe31d9c7bfcd\",\n \"score\": \"0.51106757\",\n \"text\": \"public boolean hasYmdFirst() {\\n return ((bitField0_ & 0x00000004) == 0x00000004);\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"9efad77e1f6c2ef5a5b30f1c53fc1315","score":"0.71269006","text":"public Builder setYmdFirst(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000004;\n ymdFirst_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"9efad77e1f6c2ef5a5b30f1c53fc1315","score":"0.71269006","text":"public Builder setYmdFirst(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000004;\n ymdFirst_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"c559638915570405ed909b0c583db000","score":"0.7079175","text":"public Builder setYmdFirst(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000002;\n ymdFirst_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"c559638915570405ed909b0c583db000","score":"0.7079175","text":"public Builder setYmdFirst(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000002;\n ymdFirst_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"005c8180a6e0c9fca94a38dc1ce3ced4","score":"0.6920783","text":"java.lang.String getYmdFirst();","title":""},{"docid":"005c8180a6e0c9fca94a38dc1ce3ced4","score":"0.6920783","text":"java.lang.String getYmdFirst();","title":""},{"docid":"005c8180a6e0c9fca94a38dc1ce3ced4","score":"0.6920783","text":"java.lang.String getYmdFirst();","title":""},{"docid":"005c8180a6e0c9fca94a38dc1ce3ced4","score":"0.6920783","text":"java.lang.String getYmdFirst();","title":""},{"docid":"58b18dc804a42adfd0e1189df0368754","score":"0.64123887","text":"public java.lang.String getYmdFirst() {\n java.lang.Object ref = ymdFirst_;\n if (ref instanceof java.lang.String) {\n return (java.lang.String) ref;\n } else {\n com.google.protobuf.ByteString bs = \n (com.google.protobuf.ByteString) ref;\n java.lang.String s = bs.toStringUtf8();\n if (bs.isValidUtf8()) {\n ymdFirst_ = s;\n }\n return s;\n }\n }","title":""},{"docid":"58b18dc804a42adfd0e1189df0368754","score":"0.64123887","text":"public java.lang.String getYmdFirst() {\n java.lang.Object ref = ymdFirst_;\n if (ref instanceof java.lang.String) {\n return (java.lang.String) ref;\n } else {\n com.google.protobuf.ByteString bs = \n (com.google.protobuf.ByteString) ref;\n java.lang.String s = bs.toStringUtf8();\n if (bs.isValidUtf8()) {\n ymdFirst_ = s;\n }\n return s;\n }\n }","title":""},{"docid":"58b18dc804a42adfd0e1189df0368754","score":"0.6411399","text":"public java.lang.String getYmdFirst() {\n java.lang.Object ref = ymdFirst_;\n if (ref instanceof java.lang.String) {\n return (java.lang.String) ref;\n } else {\n com.google.protobuf.ByteString bs = \n (com.google.protobuf.ByteString) ref;\n java.lang.String s = bs.toStringUtf8();\n if (bs.isValidUtf8()) {\n ymdFirst_ = s;\n }\n return s;\n }\n }","title":""},{"docid":"58b18dc804a42adfd0e1189df0368754","score":"0.64111704","text":"public java.lang.String getYmdFirst() {\n java.lang.Object ref = ymdFirst_;\n if (ref instanceof java.lang.String) {\n return (java.lang.String) ref;\n } else {\n com.google.protobuf.ByteString bs = \n (com.google.protobuf.ByteString) ref;\n java.lang.String s = bs.toStringUtf8();\n if (bs.isValidUtf8()) {\n ymdFirst_ = s;\n }\n return s;\n }\n }","title":""},{"docid":"1bd1ab9668108583de7ca4da272e165a","score":"0.634512","text":"public java.lang.String getYmdFirst() {\n java.lang.Object ref = ymdFirst_;\n if (!(ref instanceof java.lang.String)) {\n java.lang.String s = ((com.google.protobuf.ByteString) ref)\n .toStringUtf8();\n ymdFirst_ = s;\n return s;\n } else {\n return (java.lang.String) ref;\n }\n }","title":""},{"docid":"1bd1ab9668108583de7ca4da272e165a","score":"0.63442457","text":"public java.lang.String getYmdFirst() {\n java.lang.Object ref = ymdFirst_;\n if (!(ref instanceof java.lang.String)) {\n java.lang.String s = ((com.google.protobuf.ByteString) ref)\n .toStringUtf8();\n ymdFirst_ = s;\n return s;\n } else {\n return (java.lang.String) ref;\n }\n }","title":""},{"docid":"1bd1ab9668108583de7ca4da272e165a","score":"0.63442457","text":"public java.lang.String getYmdFirst() {\n java.lang.Object ref = ymdFirst_;\n if (!(ref instanceof java.lang.String)) {\n java.lang.String s = ((com.google.protobuf.ByteString) ref)\n .toStringUtf8();\n ymdFirst_ = s;\n return s;\n } else {\n return (java.lang.String) ref;\n }\n }","title":""},{"docid":"1bd1ab9668108583de7ca4da272e165a","score":"0.634377","text":"public java.lang.String getYmdFirst() {\n java.lang.Object ref = ymdFirst_;\n if (!(ref instanceof java.lang.String)) {\n java.lang.String s = ((com.google.protobuf.ByteString) ref)\n .toStringUtf8();\n ymdFirst_ = s;\n return s;\n } else {\n return (java.lang.String) ref;\n }\n }","title":""},{"docid":"0e7957e5520a9eeedd01c16b6a04e5e9","score":"0.62410796","text":"public com.google.protobuf.ByteString\n getYmdFirstBytes() {\n java.lang.Object ref = ymdFirst_;\n if (ref instanceof String) {\n com.google.protobuf.ByteString b = \n com.google.protobuf.ByteString.copyFromUtf8(\n (java.lang.String) ref);\n ymdFirst_ = b;\n return b;\n } else {\n return (com.google.protobuf.ByteString) ref;\n }\n }","title":""},{"docid":"0e7957e5520a9eeedd01c16b6a04e5e9","score":"0.62404567","text":"public com.google.protobuf.ByteString\n getYmdFirstBytes() {\n java.lang.Object ref = ymdFirst_;\n if (ref instanceof String) {\n com.google.protobuf.ByteString b = \n com.google.protobuf.ByteString.copyFromUtf8(\n (java.lang.String) ref);\n ymdFirst_ = b;\n return b;\n } else {\n return (com.google.protobuf.ByteString) ref;\n }\n }","title":""},{"docid":"0e7957e5520a9eeedd01c16b6a04e5e9","score":"0.6239399","text":"public com.google.protobuf.ByteString\n getYmdFirstBytes() {\n java.lang.Object ref = ymdFirst_;\n if (ref instanceof String) {\n com.google.protobuf.ByteString b = \n com.google.protobuf.ByteString.copyFromUtf8(\n (java.lang.String) ref);\n ymdFirst_ = b;\n return b;\n } else {\n return (com.google.protobuf.ByteString) ref;\n }\n }","title":""},{"docid":"0e7957e5520a9eeedd01c16b6a04e5e9","score":"0.6239399","text":"public com.google.protobuf.ByteString\n getYmdFirstBytes() {\n java.lang.Object ref = ymdFirst_;\n if (ref instanceof String) {\n com.google.protobuf.ByteString b = \n com.google.protobuf.ByteString.copyFromUtf8(\n (java.lang.String) ref);\n ymdFirst_ = b;\n return b;\n } else {\n return (com.google.protobuf.ByteString) ref;\n }\n }","title":""},{"docid":"5109ca097637e4fcb30b9e88153314bc","score":"0.61807084","text":"public com.google.protobuf.ByteString\n getYmdFirstBytes() {\n java.lang.Object ref = ymdFirst_;\n if (ref instanceof java.lang.String) {\n com.google.protobuf.ByteString b = \n com.google.protobuf.ByteString.copyFromUtf8(\n (java.lang.String) ref);\n ymdFirst_ = b;\n return b;\n } else {\n return (com.google.protobuf.ByteString) ref;\n }\n }","title":""},{"docid":"5109ca097637e4fcb30b9e88153314bc","score":"0.6180481","text":"public com.google.protobuf.ByteString\n getYmdFirstBytes() {\n java.lang.Object ref = ymdFirst_;\n if (ref instanceof java.lang.String) {\n com.google.protobuf.ByteString b = \n com.google.protobuf.ByteString.copyFromUtf8(\n (java.lang.String) ref);\n ymdFirst_ = b;\n return b;\n } else {\n return (com.google.protobuf.ByteString) ref;\n }\n }","title":""},{"docid":"5109ca097637e4fcb30b9e88153314bc","score":"0.6180481","text":"public com.google.protobuf.ByteString\n getYmdFirstBytes() {\n java.lang.Object ref = ymdFirst_;\n if (ref instanceof java.lang.String) {\n com.google.protobuf.ByteString b = \n com.google.protobuf.ByteString.copyFromUtf8(\n (java.lang.String) ref);\n ymdFirst_ = b;\n return b;\n } else {\n return (com.google.protobuf.ByteString) ref;\n }\n }","title":""},{"docid":"5109ca097637e4fcb30b9e88153314bc","score":"0.6180088","text":"public com.google.protobuf.ByteString\n getYmdFirstBytes() {\n java.lang.Object ref = ymdFirst_;\n if (ref instanceof java.lang.String) {\n com.google.protobuf.ByteString b = \n com.google.protobuf.ByteString.copyFromUtf8(\n (java.lang.String) ref);\n ymdFirst_ = b;\n return b;\n } else {\n return (com.google.protobuf.ByteString) ref;\n }\n }","title":""},{"docid":"be7be26cff605037808fad65c25226a6","score":"0.6148161","text":"java.lang.String getYmdLast();","title":""},{"docid":"be7be26cff605037808fad65c25226a6","score":"0.6148161","text":"java.lang.String getYmdLast();","title":""},{"docid":"be7be26cff605037808fad65c25226a6","score":"0.6148161","text":"java.lang.String getYmdLast();","title":""},{"docid":"be7be26cff605037808fad65c25226a6","score":"0.6148161","text":"java.lang.String getYmdLast();","title":""},{"docid":"fe74cc1fc24a36c8196fba5eb810e044","score":"0.6029377","text":"boolean hasYmdFirst();","title":""},{"docid":"fe74cc1fc24a36c8196fba5eb810e044","score":"0.6029377","text":"boolean hasYmdFirst();","title":""},{"docid":"fe74cc1fc24a36c8196fba5eb810e044","score":"0.6029377","text":"boolean hasYmdFirst();","title":""},{"docid":"fe74cc1fc24a36c8196fba5eb810e044","score":"0.6029377","text":"boolean hasYmdFirst();","title":""},{"docid":"b8b758b85b89affa8cf8a60b1e51d0a4","score":"0.59261596","text":"public Builder setYmdFirstBytes(\n com.google.protobuf.ByteString value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000002;\n ymdFirst_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"b8b758b85b89affa8cf8a60b1e51d0a4","score":"0.5924452","text":"public Builder setYmdFirstBytes(\n com.google.protobuf.ByteString value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000002;\n ymdFirst_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"be47fc307c0e1b8755e9e594bcf8373c","score":"0.5901251","text":"public Builder setYmdFirstBytes(\n com.google.protobuf.ByteString value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000004;\n ymdFirst_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"be47fc307c0e1b8755e9e594bcf8373c","score":"0.5901251","text":"public Builder setYmdFirstBytes(\n com.google.protobuf.ByteString value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000004;\n ymdFirst_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"e2172f09a413d89f240e50a1e83e4fc6","score":"0.57370985","text":"public Builder setYmdLast(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000004;\n ymdLast_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"e2172f09a413d89f240e50a1e83e4fc6","score":"0.57360595","text":"public Builder setYmdLast(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000004;\n ymdLast_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"6664455e8bbb8e034d48da59a77bb7f6","score":"0.57108635","text":"public Builder setYmdLast(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000008;\n ymdLast_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"6664455e8bbb8e034d48da59a77bb7f6","score":"0.57108635","text":"public Builder setYmdLast(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000008;\n ymdLast_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"7ea50d1c9a04b6120e9aa28e500ae350","score":"0.56798047","text":"public Builder clearYmdFirst() {\n bitField0_ = (bitField0_ & ~0x00000002);\n ymdFirst_ = getDefaultInstance().getYmdFirst();\n onChanged();\n return this;\n }","title":""},{"docid":"7ea50d1c9a04b6120e9aa28e500ae350","score":"0.5678288","text":"public Builder clearYmdFirst() {\n bitField0_ = (bitField0_ & ~0x00000002);\n ymdFirst_ = getDefaultInstance().getYmdFirst();\n onChanged();\n return this;\n }","title":""},{"docid":"a6ac15e444df3f58e8e694245036163b","score":"0.56772643","text":"public Builder clearYmdFirst() {\n bitField0_ = (bitField0_ & ~0x00000004);\n ymdFirst_ = getDefaultInstance().getYmdFirst();\n onChanged();\n return this;\n }","title":""},{"docid":"a6ac15e444df3f58e8e694245036163b","score":"0.56772643","text":"public Builder clearYmdFirst() {\n bitField0_ = (bitField0_ & ~0x00000004);\n ymdFirst_ = getDefaultInstance().getYmdFirst();\n onChanged();\n return this;\n }","title":""},{"docid":"d58206edebf296db987195d0641afcad","score":"0.5485234","text":"com.google.protobuf.ByteString\n getYmdFirstBytes();","title":""},{"docid":"d58206edebf296db987195d0641afcad","score":"0.5485234","text":"com.google.protobuf.ByteString\n getYmdFirstBytes();","title":""},{"docid":"d58206edebf296db987195d0641afcad","score":"0.5485234","text":"com.google.protobuf.ByteString\n getYmdFirstBytes();","title":""},{"docid":"d58206edebf296db987195d0641afcad","score":"0.5485234","text":"com.google.protobuf.ByteString\n getYmdFirstBytes();","title":""},{"docid":"cd8e60ae9be7e32d75d77103ebfa9793","score":"0.527128","text":"public int getStartYear(){ return yearLabels[0];}","title":""},{"docid":"0c3f26d343fe016004727404c5fbf975","score":"0.5229837","text":"private String init_Date(String rtn_fmt) {\n int[] iymd = {0,0,0};\n Calendar c = Calendar.getInstance();\n iymd[0] = c.get(Calendar.YEAR);\n iymd[1] = c.get(Calendar.MONTH);\n iymd[2] = c.get(Calendar.DAY_OF_MONTH);\n String initDate = \"\";\n if (rtn_fmt.equalsIgnoreCase(\"yyyy-mm-dd\")) {\n initDate=String.format(\"%04d-%02d-%02d\", iymd[0],iymd[1]+1, iymd[2]);\n } else if (rtn_fmt.equalsIgnoreCase(\"yyyym\")) {\n initDate=String.format(\"%04d%02d\", iymd[0],iymd[1]+1);\n }\n return initDate;\n }","title":""},{"docid":"e927a03049f240777c2acfd8d06144ef","score":"0.52173436","text":"java.lang.String getHoCodeYmd();","title":""},{"docid":"d7dbc72334bc1f97e5e4d7a5604e6109","score":"0.5192698","text":"public String getFirstDateOfNextMonth(String pattern) {\r\n\r\n\t\tCalendar c = Calendar.getInstance();\r\n\t\tc.setTime(new Date());\r\n\t\tc.add(Calendar.MONTH, 1);\r\n\t\tc.set(Calendar.DAY_OF_MONTH, 1);\r\n\r\n\t\treturn new SimpleDateFormat(pattern).format(c.getTime());\r\n\t}","title":""},{"docid":"fda05ca091af3a7096b0a74e10a55ea2","score":"0.5179664","text":"public String getFirstPublicationDate(){return mFirstPublicationDate;}","title":""},{"docid":"9c262b45d6812618971f2bf6a5df2f7a","score":"0.5164895","text":"public String getYyyymmdd() {\n return yyyymmdd;\n }","title":""},{"docid":"567776e575e539231c057863fe9aa4db","score":"0.5156302","text":"java.lang.String getBuseoYmd();","title":""},{"docid":"567776e575e539231c057863fe9aa4db","score":"0.5156302","text":"java.lang.String getBuseoYmd();","title":""},{"docid":"567776e575e539231c057863fe9aa4db","score":"0.5156302","text":"java.lang.String getBuseoYmd();","title":""},{"docid":"567776e575e539231c057863fe9aa4db","score":"0.5156302","text":"java.lang.String getBuseoYmd();","title":""},{"docid":"567776e575e539231c057863fe9aa4db","score":"0.5156302","text":"java.lang.String getBuseoYmd();","title":""},{"docid":"567776e575e539231c057863fe9aa4db","score":"0.5156302","text":"java.lang.String getBuseoYmd();","title":""},{"docid":"c8dc308cdaa23f68448c1397fb0c2654","score":"0.51529676","text":"private String fileDT()\r\n {\r\n String DateTime = new java.util.Date().toString();\r\n String reformatDT =\r\n DateTime.substring(24,28)+\r\n decodeMonth(DateTime.substring(4,7))+\r\n DateTime.substring(8,10)+\r\n DateTime.substring(11,13)+\r\n DateTime.substring(14,16)+\r\n DateTime.substring(17,19);\r\n return reformatDT;\r\n }","title":""},{"docid":"0c65f7bcd7bc5790c2f5232e9638824b","score":"0.5144444","text":"java.lang.String getDoctorYmd();","title":""},{"docid":"0c65f7bcd7bc5790c2f5232e9638824b","score":"0.5144444","text":"java.lang.String getDoctorYmd();","title":""},{"docid":"3b9d04a67fe2470c78cda3e2abd889c3","score":"0.5104965","text":"public java.lang.String getYmdLast() {\n java.lang.Object ref = ymdLast_;\n if (!(ref instanceof java.lang.String)) {\n java.lang.String s = ((com.google.protobuf.ByteString) ref)\n .toStringUtf8();\n ymdLast_ = s;\n return s;\n } else {\n return (java.lang.String) ref;\n }\n }","title":""},{"docid":"3b9d04a67fe2470c78cda3e2abd889c3","score":"0.5104965","text":"public java.lang.String getYmdLast() {\n java.lang.Object ref = ymdLast_;\n if (!(ref instanceof java.lang.String)) {\n java.lang.String s = ((com.google.protobuf.ByteString) ref)\n .toStringUtf8();\n ymdLast_ = s;\n return s;\n } else {\n return (java.lang.String) ref;\n }\n }","title":""},{"docid":"3b9d04a67fe2470c78cda3e2abd889c3","score":"0.5104024","text":"public java.lang.String getYmdLast() {\n java.lang.Object ref = ymdLast_;\n if (!(ref instanceof java.lang.String)) {\n java.lang.String s = ((com.google.protobuf.ByteString) ref)\n .toStringUtf8();\n ymdLast_ = s;\n return s;\n } else {\n return (java.lang.String) ref;\n }\n }","title":""},{"docid":"3b9d04a67fe2470c78cda3e2abd889c3","score":"0.510323","text":"public java.lang.String getYmdLast() {\n java.lang.Object ref = ymdLast_;\n if (!(ref instanceof java.lang.String)) {\n java.lang.String s = ((com.google.protobuf.ByteString) ref)\n .toStringUtf8();\n ymdLast_ = s;\n return s;\n } else {\n return (java.lang.String) ref;\n }\n }","title":""},{"docid":"ed8afffd15e37cb697d0af5b6a7b32a0","score":"0.50766903","text":"public boolean hasYmdFirst() {\n return ((bitField0_ & 0x00000002) == 0x00000002);\n }","title":""},{"docid":"ed8afffd15e37cb697d0af5b6a7b32a0","score":"0.50761396","text":"public boolean hasYmdFirst() {\n return ((bitField0_ & 0x00000002) == 0x00000002);\n }","title":""},{"docid":"b82971a7377833015d184b5d53c35f0b","score":"0.5074967","text":"public java.lang.String getYmdLast() {\n java.lang.Object ref = ymdLast_;\n if (ref instanceof java.lang.String) {\n return (java.lang.String) ref;\n } else {\n com.google.protobuf.ByteString bs = \n (com.google.protobuf.ByteString) ref;\n java.lang.String s = bs.toStringUtf8();\n if (bs.isValidUtf8()) {\n ymdLast_ = s;\n }\n return s;\n }\n }","title":""},{"docid":"b82971a7377833015d184b5d53c35f0b","score":"0.50743985","text":"public java.lang.String getYmdLast() {\n java.lang.Object ref = ymdLast_;\n if (ref instanceof java.lang.String) {\n return (java.lang.String) ref;\n } else {\n com.google.protobuf.ByteString bs = \n (com.google.protobuf.ByteString) ref;\n java.lang.String s = bs.toStringUtf8();\n if (bs.isValidUtf8()) {\n ymdLast_ = s;\n }\n return s;\n }\n }","title":""},{"docid":"b82971a7377833015d184b5d53c35f0b","score":"0.50743985","text":"public java.lang.String getYmdLast() {\n java.lang.Object ref = ymdLast_;\n if (ref instanceof java.lang.String) {\n return (java.lang.String) ref;\n } else {\n com.google.protobuf.ByteString bs = \n (com.google.protobuf.ByteString) ref;\n java.lang.String s = bs.toStringUtf8();\n if (bs.isValidUtf8()) {\n ymdLast_ = s;\n }\n return s;\n }\n }","title":""},{"docid":"b82971a7377833015d184b5d53c35f0b","score":"0.5073879","text":"public java.lang.String getYmdLast() {\n java.lang.Object ref = ymdLast_;\n if (ref instanceof java.lang.String) {\n return (java.lang.String) ref;\n } else {\n com.google.protobuf.ByteString bs = \n (com.google.protobuf.ByteString) ref;\n java.lang.String s = bs.toStringUtf8();\n if (bs.isValidUtf8()) {\n ymdLast_ = s;\n }\n return s;\n }\n }","title":""},{"docid":"2042ecfe60399077ba02ee43ced7a80d","score":"0.5053694","text":"public boolean hasYmdFirst() {\n return ((bitField0_ & 0x00000004) == 0x00000004);\n }","title":""},{"docid":"2042ecfe60399077ba02ee43ced7a80d","score":"0.5053694","text":"public boolean hasYmdFirst() {\n return ((bitField0_ & 0x00000004) == 0x00000004);\n }","title":""},{"docid":"ac9652bf5b5ef5c8ce123ad7779e4d4c","score":"0.504315","text":"public Builder setBuseoYmd(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000004;\n buseoYmd_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"ac9652bf5b5ef5c8ce123ad7779e4d4c","score":"0.504315","text":"public Builder setBuseoYmd(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000004;\n buseoYmd_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"c2862903a21b973e4f1b4552cd324eb0","score":"0.50274205","text":"public static String monthName( int month ) { String monthName = \"error\";\nif ( month == 1 ) monthName = \"January\";\nelseif(month==2) monthName = \"February\";\nelseif(month==3) monthName = \"March\";\nelseif(month==4) monthName = \"April\";\nelseif(month==5) monthName = \"May\"; elseif(month==6)\nmonthName = \"June\"; elseif(month==7)\nmonthName = \"July\"; elseif(month==8)\nmonthName = \"August\"; elseif(month==9)\nmonthName = \"September\"; elseif(month==10)\nmonthName = \"October\"; elseif(month==11)\nmonthName = \"November\"; elseif(month==12)\n monthName = \"December\";\nExercise 38: Thirty Days Revisited with Javadoc 149\nreturn\n/**\n * Returns\n *\n * @author\n * @param\n * @return\n */\nmonthName;\nthe number of days in a given month.\n}","title":""},{"docid":"c54c3b431a447216564950d5f95cef9b","score":"0.50245035","text":"public boolean hasYmdFirst() {\n return ((bitField0_ & 0x00000002) == 0x00000002);\n }","title":""},{"docid":"8ce73e502e48e776dc7dc109664f16d4","score":"0.50238264","text":"public Builder setHoCodeYmd(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000002;\n hoCodeYmd_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"c54c3b431a447216564950d5f95cef9b","score":"0.50236213","text":"public boolean hasYmdFirst() {\n return ((bitField0_ & 0x00000002) == 0x00000002);\n }","title":""},{"docid":"91884c534ea07ec03b4c4c3b60fd7770","score":"0.50041723","text":"boolean hasYm();","title":""},{"docid":"91884c534ea07ec03b4c4c3b60fd7770","score":"0.50041723","text":"boolean hasYm();","title":""},{"docid":"a5e340af2f5b6e02ad508a85d7438991","score":"0.49907735","text":"public Builder setBuseoYmd(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000002;\n buseoYmd_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"a5e340af2f5b6e02ad508a85d7438991","score":"0.49904373","text":"public Builder setBuseoYmd(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000002;\n buseoYmd_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"a5e340af2f5b6e02ad508a85d7438991","score":"0.4990419","text":"public Builder setBuseoYmd(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000002;\n buseoYmd_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"a5e340af2f5b6e02ad508a85d7438991","score":"0.4988933","text":"public Builder setBuseoYmd(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000002;\n buseoYmd_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"7425f0280d5883d568f133ddf5a1fe9e","score":"0.4976501","text":"private String formatLast (String last)\r\n {\r\n\t return formatFirst (last);\r\n }","title":""},{"docid":"d682489cbb840fde51fb63ab4b673a11","score":"0.49708387","text":"public void testJavaDocClaims() {\n DateTime dt1 = new DateTime(\"3:21pm on January 26, 1969\");\n DateTime dt2 = new DateTime(\"26-Jan-1969 03:21 PM\");\n DateTime dt3 = new DateTime(\"1/26/69 15:21\");\n DateTime dt4 = new DateTime(\"1969.01.26 15.21\");\n DateTime dt5 = new DateTime(\"el 26 de enero de 1969 15.21\");\n assertEquals(dt1, dt2);\n assertEquals(dt1, dt3);\n assertEquals(dt1, dt4);\n assertEquals(dt1, dt5);\n }","title":""},{"docid":"c033ecb98048989820f7f908add3391c","score":"0.49680996","text":"public Builder setDoctorYmd(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000008;\n doctorYmd_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"c033ecb98048989820f7f908add3391c","score":"0.4966849","text":"public Builder setDoctorYmd(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000008;\n doctorYmd_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"8af4c7b956f99c7e2722eea14ef8846a","score":"0.49591652","text":"default YodaValue first(){\n return NONE;\n }","title":""},{"docid":"3ed6e4bfee69c09da6b54a44a8c78058","score":"0.49365512","text":"public static void main(String args[]) {\n\t\tDate date= new Date();\r\n\t\tSystem.out.println(getNextMonth());\r\n\t\t\r\n\t\tSystem.out.println(formatDate(date, \"yyyyMMddHHmmss\"));\r\n\t}","title":""},{"docid":"ed2faef3dbbdf3e1d12e858901306454","score":"0.4919232","text":"public void setBestBeforeText(){\n String best_before;\n if(details.getValue().best_before == null){\n best_before = \"-\";\n }else{\n //best_before = details.getValue().best_before.toString();\n Calendar calendar = new GregorianCalendar();\n calendar.setTimeInMillis(details.getValue().best_before * 1000);\n best_before = calendar.get(Calendar.YEAR) + \"-\" + (calendar.get(Calendar.MONTH)+1) + \"-\" + calendar.get(Calendar.DAY_OF_MONTH);\n }\n TextView best_beforeText = (TextView) view.findViewById(R.id.product_best_before);\n best_beforeText.setText(R.string.expirationDate);\n best_beforeText.setText(best_beforeText.getText() + best_before);\n }","title":""},{"docid":"974b1b4c9163e78e238bfe06443fe7f3","score":"0.49089414","text":"int getStartYearForDocumentElement();","title":""},{"docid":"4a79018707ab8720a820d1abd3dd2e47","score":"0.48951223","text":"public String getFirstDateOfPreviousMonth(String pattern) {\r\n\r\n\t\tCalendar c = Calendar.getInstance();\r\n\t\tc.setTime(new Date());\r\n\t\tc.add(Calendar.MONTH, -1);\r\n\t\tc.set(Calendar.DAY_OF_MONTH, 1);\r\n\r\n\t\treturn new SimpleDateFormat(pattern).format(c.getTime());\r\n\t}","title":""},{"docid":"26de5c645b7493ba33add7eb7a89ba53","score":"0.48946375","text":"public static void main(String[] args) throws ParseException {\n System.out.println(getDateAddOne(\"2018-02-28\"));\n System.out.println(getMonthFirstDay(2018, 1));\n }","title":""},{"docid":"af443394e5382d6987441103782cad67","score":"0.48735687","text":"@Test\n public void getFormattedTextFieldStartDistinct() {\n SimpleDateFormat formatDate = new SimpleDateFormat(\"MM-dd-yyyy\");\n try {\n Date date = formatDate.parse(\"12-12-2018\");\n panel.setDateChooserFrom(date);\n } catch (ParseException e) {\n System.out.println(\"Exception:\" + e.getMessage());\n }\n assertNotEquals(\"11-12-2018\", panel.getFormattedTextFieldStart());\n }","title":""},{"docid":"717f32e2b72e0ca8c1127162dd381926","score":"0.48718143","text":"public Phd(String n, int y, int m) {\r\n assert n.length() > 0;\r\n assert y > 1000;\r\n assert m > 0 && m < 13;\r\n name= n;\r\n year= y;\r\n month= m;\r\n advisor1= null;\r\n advisor2= null;\r\n advisees= 0;\r\n }","title":""}],"string":"[\n {\n \"docid\": \"9efad77e1f6c2ef5a5b30f1c53fc1315\",\n \"score\": \"0.71269006\",\n \"text\": \"public Builder setYmdFirst(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000004;\\n ymdFirst_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9efad77e1f6c2ef5a5b30f1c53fc1315\",\n \"score\": \"0.71269006\",\n \"text\": \"public Builder setYmdFirst(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000004;\\n ymdFirst_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c559638915570405ed909b0c583db000\",\n \"score\": \"0.7079175\",\n \"text\": \"public Builder setYmdFirst(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000002;\\n ymdFirst_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c559638915570405ed909b0c583db000\",\n \"score\": \"0.7079175\",\n \"text\": \"public Builder setYmdFirst(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000002;\\n ymdFirst_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"005c8180a6e0c9fca94a38dc1ce3ced4\",\n \"score\": \"0.6920783\",\n \"text\": \"java.lang.String getYmdFirst();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"005c8180a6e0c9fca94a38dc1ce3ced4\",\n \"score\": \"0.6920783\",\n \"text\": \"java.lang.String getYmdFirst();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"005c8180a6e0c9fca94a38dc1ce3ced4\",\n \"score\": \"0.6920783\",\n \"text\": \"java.lang.String getYmdFirst();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"005c8180a6e0c9fca94a38dc1ce3ced4\",\n \"score\": \"0.6920783\",\n \"text\": \"java.lang.String getYmdFirst();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58b18dc804a42adfd0e1189df0368754\",\n \"score\": \"0.64123887\",\n \"text\": \"public java.lang.String getYmdFirst() {\\n java.lang.Object ref = ymdFirst_;\\n if (ref instanceof java.lang.String) {\\n return (java.lang.String) ref;\\n } else {\\n com.google.protobuf.ByteString bs = \\n (com.google.protobuf.ByteString) ref;\\n java.lang.String s = bs.toStringUtf8();\\n if (bs.isValidUtf8()) {\\n ymdFirst_ = s;\\n }\\n return s;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58b18dc804a42adfd0e1189df0368754\",\n \"score\": \"0.64123887\",\n \"text\": \"public java.lang.String getYmdFirst() {\\n java.lang.Object ref = ymdFirst_;\\n if (ref instanceof java.lang.String) {\\n return (java.lang.String) ref;\\n } else {\\n com.google.protobuf.ByteString bs = \\n (com.google.protobuf.ByteString) ref;\\n java.lang.String s = bs.toStringUtf8();\\n if (bs.isValidUtf8()) {\\n ymdFirst_ = s;\\n }\\n return s;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58b18dc804a42adfd0e1189df0368754\",\n \"score\": \"0.6411399\",\n \"text\": \"public java.lang.String getYmdFirst() {\\n java.lang.Object ref = ymdFirst_;\\n if (ref instanceof java.lang.String) {\\n return (java.lang.String) ref;\\n } else {\\n com.google.protobuf.ByteString bs = \\n (com.google.protobuf.ByteString) ref;\\n java.lang.String s = bs.toStringUtf8();\\n if (bs.isValidUtf8()) {\\n ymdFirst_ = s;\\n }\\n return s;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58b18dc804a42adfd0e1189df0368754\",\n \"score\": \"0.64111704\",\n \"text\": \"public java.lang.String getYmdFirst() {\\n java.lang.Object ref = ymdFirst_;\\n if (ref instanceof java.lang.String) {\\n return (java.lang.String) ref;\\n } else {\\n com.google.protobuf.ByteString bs = \\n (com.google.protobuf.ByteString) ref;\\n java.lang.String s = bs.toStringUtf8();\\n if (bs.isValidUtf8()) {\\n ymdFirst_ = s;\\n }\\n return s;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1bd1ab9668108583de7ca4da272e165a\",\n \"score\": \"0.634512\",\n \"text\": \"public java.lang.String getYmdFirst() {\\n java.lang.Object ref = ymdFirst_;\\n if (!(ref instanceof java.lang.String)) {\\n java.lang.String s = ((com.google.protobuf.ByteString) ref)\\n .toStringUtf8();\\n ymdFirst_ = s;\\n return s;\\n } else {\\n return (java.lang.String) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1bd1ab9668108583de7ca4da272e165a\",\n \"score\": \"0.63442457\",\n \"text\": \"public java.lang.String getYmdFirst() {\\n java.lang.Object ref = ymdFirst_;\\n if (!(ref instanceof java.lang.String)) {\\n java.lang.String s = ((com.google.protobuf.ByteString) ref)\\n .toStringUtf8();\\n ymdFirst_ = s;\\n return s;\\n } else {\\n return (java.lang.String) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1bd1ab9668108583de7ca4da272e165a\",\n \"score\": \"0.63442457\",\n \"text\": \"public java.lang.String getYmdFirst() {\\n java.lang.Object ref = ymdFirst_;\\n if (!(ref instanceof java.lang.String)) {\\n java.lang.String s = ((com.google.protobuf.ByteString) ref)\\n .toStringUtf8();\\n ymdFirst_ = s;\\n return s;\\n } else {\\n return (java.lang.String) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1bd1ab9668108583de7ca4da272e165a\",\n \"score\": \"0.634377\",\n \"text\": \"public java.lang.String getYmdFirst() {\\n java.lang.Object ref = ymdFirst_;\\n if (!(ref instanceof java.lang.String)) {\\n java.lang.String s = ((com.google.protobuf.ByteString) ref)\\n .toStringUtf8();\\n ymdFirst_ = s;\\n return s;\\n } else {\\n return (java.lang.String) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e7957e5520a9eeedd01c16b6a04e5e9\",\n \"score\": \"0.62410796\",\n \"text\": \"public com.google.protobuf.ByteString\\n getYmdFirstBytes() {\\n java.lang.Object ref = ymdFirst_;\\n if (ref instanceof String) {\\n com.google.protobuf.ByteString b = \\n com.google.protobuf.ByteString.copyFromUtf8(\\n (java.lang.String) ref);\\n ymdFirst_ = b;\\n return b;\\n } else {\\n return (com.google.protobuf.ByteString) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e7957e5520a9eeedd01c16b6a04e5e9\",\n \"score\": \"0.62404567\",\n \"text\": \"public com.google.protobuf.ByteString\\n getYmdFirstBytes() {\\n java.lang.Object ref = ymdFirst_;\\n if (ref instanceof String) {\\n com.google.protobuf.ByteString b = \\n com.google.protobuf.ByteString.copyFromUtf8(\\n (java.lang.String) ref);\\n ymdFirst_ = b;\\n return b;\\n } else {\\n return (com.google.protobuf.ByteString) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e7957e5520a9eeedd01c16b6a04e5e9\",\n \"score\": \"0.6239399\",\n \"text\": \"public com.google.protobuf.ByteString\\n getYmdFirstBytes() {\\n java.lang.Object ref = ymdFirst_;\\n if (ref instanceof String) {\\n com.google.protobuf.ByteString b = \\n com.google.protobuf.ByteString.copyFromUtf8(\\n (java.lang.String) ref);\\n ymdFirst_ = b;\\n return b;\\n } else {\\n return (com.google.protobuf.ByteString) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e7957e5520a9eeedd01c16b6a04e5e9\",\n \"score\": \"0.6239399\",\n \"text\": \"public com.google.protobuf.ByteString\\n getYmdFirstBytes() {\\n java.lang.Object ref = ymdFirst_;\\n if (ref instanceof String) {\\n com.google.protobuf.ByteString b = \\n com.google.protobuf.ByteString.copyFromUtf8(\\n (java.lang.String) ref);\\n ymdFirst_ = b;\\n return b;\\n } else {\\n return (com.google.protobuf.ByteString) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5109ca097637e4fcb30b9e88153314bc\",\n \"score\": \"0.61807084\",\n \"text\": \"public com.google.protobuf.ByteString\\n getYmdFirstBytes() {\\n java.lang.Object ref = ymdFirst_;\\n if (ref instanceof java.lang.String) {\\n com.google.protobuf.ByteString b = \\n com.google.protobuf.ByteString.copyFromUtf8(\\n (java.lang.String) ref);\\n ymdFirst_ = b;\\n return b;\\n } else {\\n return (com.google.protobuf.ByteString) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5109ca097637e4fcb30b9e88153314bc\",\n \"score\": \"0.6180481\",\n \"text\": \"public com.google.protobuf.ByteString\\n getYmdFirstBytes() {\\n java.lang.Object ref = ymdFirst_;\\n if (ref instanceof java.lang.String) {\\n com.google.protobuf.ByteString b = \\n com.google.protobuf.ByteString.copyFromUtf8(\\n (java.lang.String) ref);\\n ymdFirst_ = b;\\n return b;\\n } else {\\n return (com.google.protobuf.ByteString) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5109ca097637e4fcb30b9e88153314bc\",\n \"score\": \"0.6180481\",\n \"text\": \"public com.google.protobuf.ByteString\\n getYmdFirstBytes() {\\n java.lang.Object ref = ymdFirst_;\\n if (ref instanceof java.lang.String) {\\n com.google.protobuf.ByteString b = \\n com.google.protobuf.ByteString.copyFromUtf8(\\n (java.lang.String) ref);\\n ymdFirst_ = b;\\n return b;\\n } else {\\n return (com.google.protobuf.ByteString) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5109ca097637e4fcb30b9e88153314bc\",\n \"score\": \"0.6180088\",\n \"text\": \"public com.google.protobuf.ByteString\\n getYmdFirstBytes() {\\n java.lang.Object ref = ymdFirst_;\\n if (ref instanceof java.lang.String) {\\n com.google.protobuf.ByteString b = \\n com.google.protobuf.ByteString.copyFromUtf8(\\n (java.lang.String) ref);\\n ymdFirst_ = b;\\n return b;\\n } else {\\n return (com.google.protobuf.ByteString) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be7be26cff605037808fad65c25226a6\",\n \"score\": \"0.6148161\",\n \"text\": \"java.lang.String getYmdLast();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be7be26cff605037808fad65c25226a6\",\n \"score\": \"0.6148161\",\n \"text\": \"java.lang.String getYmdLast();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be7be26cff605037808fad65c25226a6\",\n \"score\": \"0.6148161\",\n \"text\": \"java.lang.String getYmdLast();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be7be26cff605037808fad65c25226a6\",\n \"score\": \"0.6148161\",\n \"text\": \"java.lang.String getYmdLast();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe74cc1fc24a36c8196fba5eb810e044\",\n \"score\": \"0.6029377\",\n \"text\": \"boolean hasYmdFirst();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe74cc1fc24a36c8196fba5eb810e044\",\n \"score\": \"0.6029377\",\n \"text\": \"boolean hasYmdFirst();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe74cc1fc24a36c8196fba5eb810e044\",\n \"score\": \"0.6029377\",\n \"text\": \"boolean hasYmdFirst();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe74cc1fc24a36c8196fba5eb810e044\",\n \"score\": \"0.6029377\",\n \"text\": \"boolean hasYmdFirst();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8b758b85b89affa8cf8a60b1e51d0a4\",\n \"score\": \"0.59261596\",\n \"text\": \"public Builder setYmdFirstBytes(\\n com.google.protobuf.ByteString value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000002;\\n ymdFirst_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8b758b85b89affa8cf8a60b1e51d0a4\",\n \"score\": \"0.5924452\",\n \"text\": \"public Builder setYmdFirstBytes(\\n com.google.protobuf.ByteString value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000002;\\n ymdFirst_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be47fc307c0e1b8755e9e594bcf8373c\",\n \"score\": \"0.5901251\",\n \"text\": \"public Builder setYmdFirstBytes(\\n com.google.protobuf.ByteString value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000004;\\n ymdFirst_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be47fc307c0e1b8755e9e594bcf8373c\",\n \"score\": \"0.5901251\",\n \"text\": \"public Builder setYmdFirstBytes(\\n com.google.protobuf.ByteString value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000004;\\n ymdFirst_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e2172f09a413d89f240e50a1e83e4fc6\",\n \"score\": \"0.57370985\",\n \"text\": \"public Builder setYmdLast(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000004;\\n ymdLast_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e2172f09a413d89f240e50a1e83e4fc6\",\n \"score\": \"0.57360595\",\n \"text\": \"public Builder setYmdLast(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000004;\\n ymdLast_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6664455e8bbb8e034d48da59a77bb7f6\",\n \"score\": \"0.57108635\",\n \"text\": \"public Builder setYmdLast(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000008;\\n ymdLast_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6664455e8bbb8e034d48da59a77bb7f6\",\n \"score\": \"0.57108635\",\n \"text\": \"public Builder setYmdLast(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000008;\\n ymdLast_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ea50d1c9a04b6120e9aa28e500ae350\",\n \"score\": \"0.56798047\",\n \"text\": \"public Builder clearYmdFirst() {\\n bitField0_ = (bitField0_ & ~0x00000002);\\n ymdFirst_ = getDefaultInstance().getYmdFirst();\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ea50d1c9a04b6120e9aa28e500ae350\",\n \"score\": \"0.5678288\",\n \"text\": \"public Builder clearYmdFirst() {\\n bitField0_ = (bitField0_ & ~0x00000002);\\n ymdFirst_ = getDefaultInstance().getYmdFirst();\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6ac15e444df3f58e8e694245036163b\",\n \"score\": \"0.56772643\",\n \"text\": \"public Builder clearYmdFirst() {\\n bitField0_ = (bitField0_ & ~0x00000004);\\n ymdFirst_ = getDefaultInstance().getYmdFirst();\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6ac15e444df3f58e8e694245036163b\",\n \"score\": \"0.56772643\",\n \"text\": \"public Builder clearYmdFirst() {\\n bitField0_ = (bitField0_ & ~0x00000004);\\n ymdFirst_ = getDefaultInstance().getYmdFirst();\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d58206edebf296db987195d0641afcad\",\n \"score\": \"0.5485234\",\n \"text\": \"com.google.protobuf.ByteString\\n getYmdFirstBytes();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d58206edebf296db987195d0641afcad\",\n \"score\": \"0.5485234\",\n \"text\": \"com.google.protobuf.ByteString\\n getYmdFirstBytes();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d58206edebf296db987195d0641afcad\",\n \"score\": \"0.5485234\",\n \"text\": \"com.google.protobuf.ByteString\\n getYmdFirstBytes();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d58206edebf296db987195d0641afcad\",\n \"score\": \"0.5485234\",\n \"text\": \"com.google.protobuf.ByteString\\n getYmdFirstBytes();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd8e60ae9be7e32d75d77103ebfa9793\",\n \"score\": \"0.527128\",\n \"text\": \"public int getStartYear(){ return yearLabels[0];}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c3f26d343fe016004727404c5fbf975\",\n \"score\": \"0.5229837\",\n \"text\": \"private String init_Date(String rtn_fmt) {\\n int[] iymd = {0,0,0};\\n Calendar c = Calendar.getInstance();\\n iymd[0] = c.get(Calendar.YEAR);\\n iymd[1] = c.get(Calendar.MONTH);\\n iymd[2] = c.get(Calendar.DAY_OF_MONTH);\\n String initDate = \\\"\\\";\\n if (rtn_fmt.equalsIgnoreCase(\\\"yyyy-mm-dd\\\")) {\\n initDate=String.format(\\\"%04d-%02d-%02d\\\", iymd[0],iymd[1]+1, iymd[2]);\\n } else if (rtn_fmt.equalsIgnoreCase(\\\"yyyym\\\")) {\\n initDate=String.format(\\\"%04d%02d\\\", iymd[0],iymd[1]+1);\\n }\\n return initDate;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e927a03049f240777c2acfd8d06144ef\",\n \"score\": \"0.52173436\",\n \"text\": \"java.lang.String getHoCodeYmd();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7dbc72334bc1f97e5e4d7a5604e6109\",\n \"score\": \"0.5192698\",\n \"text\": \"public String getFirstDateOfNextMonth(String pattern) {\\r\\n\\r\\n\\t\\tCalendar c = Calendar.getInstance();\\r\\n\\t\\tc.setTime(new Date());\\r\\n\\t\\tc.add(Calendar.MONTH, 1);\\r\\n\\t\\tc.set(Calendar.DAY_OF_MONTH, 1);\\r\\n\\r\\n\\t\\treturn new SimpleDateFormat(pattern).format(c.getTime());\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fda05ca091af3a7096b0a74e10a55ea2\",\n \"score\": \"0.5179664\",\n \"text\": \"public String getFirstPublicationDate(){return mFirstPublicationDate;}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c262b45d6812618971f2bf6a5df2f7a\",\n \"score\": \"0.5164895\",\n \"text\": \"public String getYyyymmdd() {\\n return yyyymmdd;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"567776e575e539231c057863fe9aa4db\",\n \"score\": \"0.5156302\",\n \"text\": \"java.lang.String getBuseoYmd();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"567776e575e539231c057863fe9aa4db\",\n \"score\": \"0.5156302\",\n \"text\": \"java.lang.String getBuseoYmd();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"567776e575e539231c057863fe9aa4db\",\n \"score\": \"0.5156302\",\n \"text\": \"java.lang.String getBuseoYmd();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"567776e575e539231c057863fe9aa4db\",\n \"score\": \"0.5156302\",\n \"text\": \"java.lang.String getBuseoYmd();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"567776e575e539231c057863fe9aa4db\",\n \"score\": \"0.5156302\",\n \"text\": \"java.lang.String getBuseoYmd();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"567776e575e539231c057863fe9aa4db\",\n \"score\": \"0.5156302\",\n \"text\": \"java.lang.String getBuseoYmd();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c8dc308cdaa23f68448c1397fb0c2654\",\n \"score\": \"0.51529676\",\n \"text\": \"private String fileDT()\\r\\n {\\r\\n String DateTime = new java.util.Date().toString();\\r\\n String reformatDT =\\r\\n DateTime.substring(24,28)+\\r\\n decodeMonth(DateTime.substring(4,7))+\\r\\n DateTime.substring(8,10)+\\r\\n DateTime.substring(11,13)+\\r\\n DateTime.substring(14,16)+\\r\\n DateTime.substring(17,19);\\r\\n return reformatDT;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c65f7bcd7bc5790c2f5232e9638824b\",\n \"score\": \"0.5144444\",\n \"text\": \"java.lang.String getDoctorYmd();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c65f7bcd7bc5790c2f5232e9638824b\",\n \"score\": \"0.5144444\",\n \"text\": \"java.lang.String getDoctorYmd();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b9d04a67fe2470c78cda3e2abd889c3\",\n \"score\": \"0.5104965\",\n \"text\": \"public java.lang.String getYmdLast() {\\n java.lang.Object ref = ymdLast_;\\n if (!(ref instanceof java.lang.String)) {\\n java.lang.String s = ((com.google.protobuf.ByteString) ref)\\n .toStringUtf8();\\n ymdLast_ = s;\\n return s;\\n } else {\\n return (java.lang.String) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b9d04a67fe2470c78cda3e2abd889c3\",\n \"score\": \"0.5104965\",\n \"text\": \"public java.lang.String getYmdLast() {\\n java.lang.Object ref = ymdLast_;\\n if (!(ref instanceof java.lang.String)) {\\n java.lang.String s = ((com.google.protobuf.ByteString) ref)\\n .toStringUtf8();\\n ymdLast_ = s;\\n return s;\\n } else {\\n return (java.lang.String) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b9d04a67fe2470c78cda3e2abd889c3\",\n \"score\": \"0.5104024\",\n \"text\": \"public java.lang.String getYmdLast() {\\n java.lang.Object ref = ymdLast_;\\n if (!(ref instanceof java.lang.String)) {\\n java.lang.String s = ((com.google.protobuf.ByteString) ref)\\n .toStringUtf8();\\n ymdLast_ = s;\\n return s;\\n } else {\\n return (java.lang.String) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b9d04a67fe2470c78cda3e2abd889c3\",\n \"score\": \"0.510323\",\n \"text\": \"public java.lang.String getYmdLast() {\\n java.lang.Object ref = ymdLast_;\\n if (!(ref instanceof java.lang.String)) {\\n java.lang.String s = ((com.google.protobuf.ByteString) ref)\\n .toStringUtf8();\\n ymdLast_ = s;\\n return s;\\n } else {\\n return (java.lang.String) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed8afffd15e37cb697d0af5b6a7b32a0\",\n \"score\": \"0.50766903\",\n \"text\": \"public boolean hasYmdFirst() {\\n return ((bitField0_ & 0x00000002) == 0x00000002);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed8afffd15e37cb697d0af5b6a7b32a0\",\n \"score\": \"0.50761396\",\n \"text\": \"public boolean hasYmdFirst() {\\n return ((bitField0_ & 0x00000002) == 0x00000002);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b82971a7377833015d184b5d53c35f0b\",\n \"score\": \"0.5074967\",\n \"text\": \"public java.lang.String getYmdLast() {\\n java.lang.Object ref = ymdLast_;\\n if (ref instanceof java.lang.String) {\\n return (java.lang.String) ref;\\n } else {\\n com.google.protobuf.ByteString bs = \\n (com.google.protobuf.ByteString) ref;\\n java.lang.String s = bs.toStringUtf8();\\n if (bs.isValidUtf8()) {\\n ymdLast_ = s;\\n }\\n return s;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b82971a7377833015d184b5d53c35f0b\",\n \"score\": \"0.50743985\",\n \"text\": \"public java.lang.String getYmdLast() {\\n java.lang.Object ref = ymdLast_;\\n if (ref instanceof java.lang.String) {\\n return (java.lang.String) ref;\\n } else {\\n com.google.protobuf.ByteString bs = \\n (com.google.protobuf.ByteString) ref;\\n java.lang.String s = bs.toStringUtf8();\\n if (bs.isValidUtf8()) {\\n ymdLast_ = s;\\n }\\n return s;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b82971a7377833015d184b5d53c35f0b\",\n \"score\": \"0.50743985\",\n \"text\": \"public java.lang.String getYmdLast() {\\n java.lang.Object ref = ymdLast_;\\n if (ref instanceof java.lang.String) {\\n return (java.lang.String) ref;\\n } else {\\n com.google.protobuf.ByteString bs = \\n (com.google.protobuf.ByteString) ref;\\n java.lang.String s = bs.toStringUtf8();\\n if (bs.isValidUtf8()) {\\n ymdLast_ = s;\\n }\\n return s;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b82971a7377833015d184b5d53c35f0b\",\n \"score\": \"0.5073879\",\n \"text\": \"public java.lang.String getYmdLast() {\\n java.lang.Object ref = ymdLast_;\\n if (ref instanceof java.lang.String) {\\n return (java.lang.String) ref;\\n } else {\\n com.google.protobuf.ByteString bs = \\n (com.google.protobuf.ByteString) ref;\\n java.lang.String s = bs.toStringUtf8();\\n if (bs.isValidUtf8()) {\\n ymdLast_ = s;\\n }\\n return s;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2042ecfe60399077ba02ee43ced7a80d\",\n \"score\": \"0.5053694\",\n \"text\": \"public boolean hasYmdFirst() {\\n return ((bitField0_ & 0x00000004) == 0x00000004);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2042ecfe60399077ba02ee43ced7a80d\",\n \"score\": \"0.5053694\",\n \"text\": \"public boolean hasYmdFirst() {\\n return ((bitField0_ & 0x00000004) == 0x00000004);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac9652bf5b5ef5c8ce123ad7779e4d4c\",\n \"score\": \"0.504315\",\n \"text\": \"public Builder setBuseoYmd(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000004;\\n buseoYmd_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac9652bf5b5ef5c8ce123ad7779e4d4c\",\n \"score\": \"0.504315\",\n \"text\": \"public Builder setBuseoYmd(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000004;\\n buseoYmd_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c2862903a21b973e4f1b4552cd324eb0\",\n \"score\": \"0.50274205\",\n \"text\": \"public static String monthName( int month ) { String monthName = \\\"error\\\";\\nif ( month == 1 ) monthName = \\\"January\\\";\\nelseif(month==2) monthName = \\\"February\\\";\\nelseif(month==3) monthName = \\\"March\\\";\\nelseif(month==4) monthName = \\\"April\\\";\\nelseif(month==5) monthName = \\\"May\\\"; elseif(month==6)\\nmonthName = \\\"June\\\"; elseif(month==7)\\nmonthName = \\\"July\\\"; elseif(month==8)\\nmonthName = \\\"August\\\"; elseif(month==9)\\nmonthName = \\\"September\\\"; elseif(month==10)\\nmonthName = \\\"October\\\"; elseif(month==11)\\nmonthName = \\\"November\\\"; elseif(month==12)\\n monthName = \\\"December\\\";\\nExercise 38: Thirty Days Revisited with Javadoc 149\\nreturn\\n/**\\n * Returns\\n *\\n * @author\\n * @param\\n * @return\\n */\\nmonthName;\\nthe number of days in a given month.\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c54c3b431a447216564950d5f95cef9b\",\n \"score\": \"0.50245035\",\n \"text\": \"public boolean hasYmdFirst() {\\n return ((bitField0_ & 0x00000002) == 0x00000002);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ce73e502e48e776dc7dc109664f16d4\",\n \"score\": \"0.50238264\",\n \"text\": \"public Builder setHoCodeYmd(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000002;\\n hoCodeYmd_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c54c3b431a447216564950d5f95cef9b\",\n \"score\": \"0.50236213\",\n \"text\": \"public boolean hasYmdFirst() {\\n return ((bitField0_ & 0x00000002) == 0x00000002);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"91884c534ea07ec03b4c4c3b60fd7770\",\n \"score\": \"0.50041723\",\n \"text\": \"boolean hasYm();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"91884c534ea07ec03b4c4c3b60fd7770\",\n \"score\": \"0.50041723\",\n \"text\": \"boolean hasYm();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5e340af2f5b6e02ad508a85d7438991\",\n \"score\": \"0.49907735\",\n \"text\": \"public Builder setBuseoYmd(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000002;\\n buseoYmd_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5e340af2f5b6e02ad508a85d7438991\",\n \"score\": \"0.49904373\",\n \"text\": \"public Builder setBuseoYmd(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000002;\\n buseoYmd_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5e340af2f5b6e02ad508a85d7438991\",\n \"score\": \"0.4990419\",\n \"text\": \"public Builder setBuseoYmd(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000002;\\n buseoYmd_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5e340af2f5b6e02ad508a85d7438991\",\n \"score\": \"0.4988933\",\n \"text\": \"public Builder setBuseoYmd(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000002;\\n buseoYmd_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7425f0280d5883d568f133ddf5a1fe9e\",\n \"score\": \"0.4976501\",\n \"text\": \"private String formatLast (String last)\\r\\n {\\r\\n\\t return formatFirst (last);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d682489cbb840fde51fb63ab4b673a11\",\n \"score\": \"0.49708387\",\n \"text\": \"public void testJavaDocClaims() {\\n DateTime dt1 = new DateTime(\\\"3:21pm on January 26, 1969\\\");\\n DateTime dt2 = new DateTime(\\\"26-Jan-1969 03:21 PM\\\");\\n DateTime dt3 = new DateTime(\\\"1/26/69 15:21\\\");\\n DateTime dt4 = new DateTime(\\\"1969.01.26 15.21\\\");\\n DateTime dt5 = new DateTime(\\\"el 26 de enero de 1969 15.21\\\");\\n assertEquals(dt1, dt2);\\n assertEquals(dt1, dt3);\\n assertEquals(dt1, dt4);\\n assertEquals(dt1, dt5);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c033ecb98048989820f7f908add3391c\",\n \"score\": \"0.49680996\",\n \"text\": \"public Builder setDoctorYmd(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000008;\\n doctorYmd_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c033ecb98048989820f7f908add3391c\",\n \"score\": \"0.4966849\",\n \"text\": \"public Builder setDoctorYmd(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000008;\\n doctorYmd_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8af4c7b956f99c7e2722eea14ef8846a\",\n \"score\": \"0.49591652\",\n \"text\": \"default YodaValue first(){\\n return NONE;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ed6e4bfee69c09da6b54a44a8c78058\",\n \"score\": \"0.49365512\",\n \"text\": \"public static void main(String args[]) {\\n\\t\\tDate date= new Date();\\r\\n\\t\\tSystem.out.println(getNextMonth());\\r\\n\\t\\t\\r\\n\\t\\tSystem.out.println(formatDate(date, \\\"yyyyMMddHHmmss\\\"));\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed2faef3dbbdf3e1d12e858901306454\",\n \"score\": \"0.4919232\",\n \"text\": \"public void setBestBeforeText(){\\n String best_before;\\n if(details.getValue().best_before == null){\\n best_before = \\\"-\\\";\\n }else{\\n //best_before = details.getValue().best_before.toString();\\n Calendar calendar = new GregorianCalendar();\\n calendar.setTimeInMillis(details.getValue().best_before * 1000);\\n best_before = calendar.get(Calendar.YEAR) + \\\"-\\\" + (calendar.get(Calendar.MONTH)+1) + \\\"-\\\" + calendar.get(Calendar.DAY_OF_MONTH);\\n }\\n TextView best_beforeText = (TextView) view.findViewById(R.id.product_best_before);\\n best_beforeText.setText(R.string.expirationDate);\\n best_beforeText.setText(best_beforeText.getText() + best_before);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"974b1b4c9163e78e238bfe06443fe7f3\",\n \"score\": \"0.49089414\",\n \"text\": \"int getStartYearForDocumentElement();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a79018707ab8720a820d1abd3dd2e47\",\n \"score\": \"0.48951223\",\n \"text\": \"public String getFirstDateOfPreviousMonth(String pattern) {\\r\\n\\r\\n\\t\\tCalendar c = Calendar.getInstance();\\r\\n\\t\\tc.setTime(new Date());\\r\\n\\t\\tc.add(Calendar.MONTH, -1);\\r\\n\\t\\tc.set(Calendar.DAY_OF_MONTH, 1);\\r\\n\\r\\n\\t\\treturn new SimpleDateFormat(pattern).format(c.getTime());\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26de5c645b7493ba33add7eb7a89ba53\",\n \"score\": \"0.48946375\",\n \"text\": \"public static void main(String[] args) throws ParseException {\\n System.out.println(getDateAddOne(\\\"2018-02-28\\\"));\\n System.out.println(getMonthFirstDay(2018, 1));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af443394e5382d6987441103782cad67\",\n \"score\": \"0.48735687\",\n \"text\": \"@Test\\n public void getFormattedTextFieldStartDistinct() {\\n SimpleDateFormat formatDate = new SimpleDateFormat(\\\"MM-dd-yyyy\\\");\\n try {\\n Date date = formatDate.parse(\\\"12-12-2018\\\");\\n panel.setDateChooserFrom(date);\\n } catch (ParseException e) {\\n System.out.println(\\\"Exception:\\\" + e.getMessage());\\n }\\n assertNotEquals(\\\"11-12-2018\\\", panel.getFormattedTextFieldStart());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"717f32e2b72e0ca8c1127162dd381926\",\n \"score\": \"0.48718143\",\n \"text\": \"public Phd(String n, int y, int m) {\\r\\n assert n.length() > 0;\\r\\n assert y > 1000;\\r\\n assert m > 0 && m < 13;\\r\\n name= n;\\r\\n year= y;\\r\\n month= m;\\r\\n advisor1= null;\\r\\n advisor2= null;\\r\\n advisees= 0;\\r\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983791,"cells":{"query_id":{"kind":"string","value":"93e2d7a3f1aa9809770046544f7f10c9"},"query":{"kind":"string","value":"Called when the action mode is created; startActionMode() was called"},"positive_passages":{"kind":"list like","value":[{"docid":"2aae101b4fe92d5bd25796eca7e90c05","score":"0.6373288","text":"@Override\r\n public boolean onCreateActionMode(ActionMode mode, Menu menu) {\r\n // Inflate a menu resource providing context menu items\r\n MenuInflater inflater = mode.getMenuInflater();\r\n inflater.inflate(R.menu.server_menu, menu);\r\n return true;\r\n }","title":""}],"string":"[\n {\n \"docid\": \"2aae101b4fe92d5bd25796eca7e90c05\",\n \"score\": \"0.6373288\",\n \"text\": \"@Override\\r\\n public boolean onCreateActionMode(ActionMode mode, Menu menu) {\\r\\n // Inflate a menu resource providing context menu items\\r\\n MenuInflater inflater = mode.getMenuInflater();\\r\\n inflater.inflate(R.menu.server_menu, menu);\\r\\n return true;\\r\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"7c6ed4a1032144f61bc428f5c33b4348","score":"0.7515797","text":"private void enableActionMode()\n {\n if (actionMode == null)\n {\n actionMode = Objects.requireNonNull(getActivity()).startActionMode(actionModeCallback);\n }\n }","title":""},{"docid":"353c20d7ddf65dbc4d100561c8c8f5f9","score":"0.7233073","text":"public void onActionModeFinished(ActionMode mode) {\n\t}","title":""},{"docid":"b4854ddc609a0bb62c002410cc3f7386","score":"0.7152921","text":"@Override\n public boolean onCreateActionMode(ActionMode mode, Menu menu) {\n\n return true;\n }","title":""},{"docid":"a3a8b60e5db732cf152061183ab6ca33","score":"0.7147411","text":"@Override\n public boolean onCreateActionMode(ActionMode mode, Menu menu) {\n return true;\n }","title":""},{"docid":"ffb319971694792c39e15a207b404368","score":"0.71072173","text":"@Override\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\n\n return true;\n }","title":""},{"docid":"96702d6b8857cd873c3695f6287a47c4","score":"0.69912714","text":"@Override\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\n return false;\n }","title":""},{"docid":"08be6c9caabc0f80e415e2ead82cb5f7","score":"0.6933123","text":"@Override\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\n // Here you can perform updates to the CAB due to\n // an invalidate() request\n return false;\n }","title":""},{"docid":"c1bfb2fe46b9b84d46edb4afbc0bc602","score":"0.69088554","text":"@Override\n public boolean onPrepareActionMode(ActionMode arg0, Menu arg1) {\n return false;\n }","title":""},{"docid":"6268a744aa59b1dcbec03fd883b7620a","score":"0.6894943","text":"@Override\n\t public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\n\t return false; // Return false if nothing is done\n\t }","title":""},{"docid":"611e7f6676417e7cc0610a904131e79f","score":"0.6889988","text":"@Override\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\n return false;\n }","title":""},{"docid":"611e7f6676417e7cc0610a904131e79f","score":"0.6889988","text":"@Override\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\n return false;\n }","title":""},{"docid":"822916b1c762b9c5023ba3f711940254","score":"0.6888842","text":"@Override\n public boolean onPrepareActionMode(ActionMode actionMode, Menu menu) {\n return false;\n }","title":""},{"docid":"174797ab242e8e08c9cbba6d755e6671","score":"0.68726176","text":"@Override\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\n return false; // Return false if nothing is done\n }","title":""},{"docid":"b3752b5eb22bf6c736f7678135eef93e","score":"0.68628025","text":"@Override\r\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\r\n return false; // Return false if nothing is done\r\n }","title":""},{"docid":"00907d74dfb2cdb22256c3549eeebf91","score":"0.68161154","text":"@Override\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\n return false; // Return false if nothing is done\n }","title":""},{"docid":"00907d74dfb2cdb22256c3549eeebf91","score":"0.68161154","text":"@Override\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\n return false; // Return false if nothing is done\n }","title":""},{"docid":"00907d74dfb2cdb22256c3549eeebf91","score":"0.68161154","text":"@Override\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\n return false; // Return false if nothing is done\n }","title":""},{"docid":"d3661c81352671ebbe45de1a794aa8c0","score":"0.679971","text":"@Override\r\n\t\tpublic boolean onPrepareActionMode(ActionMode mode, Menu menu) {\r\n\t\t\tmActionMode = mode;\r\n\t\t\tdrawListView(true,selectedIndex);\r\n\t\t\treturn true; // Return false if nothing is done\r\n\t\t}","title":""},{"docid":"46561d836afa6153cdbaef36c018477f","score":"0.6792259","text":"@Override\n\t\tpublic boolean onPrepareActionMode(ActionMode mode, Menu menu) {\n\t\t\treturn false;\n\t\t}","title":""},{"docid":"d7731d82e4a3130b409317caf229206a","score":"0.6782186","text":"@Override\r\n public void initActions() {\r\n }","title":""},{"docid":"ba321e5ce685bb7dcc45b9e859a615de","score":"0.67528516","text":"@Override\n public void onSupportActionModeStarted(ActionMode mode) {\n freezeToolbar();\n super.onSupportActionModeStarted(mode);\n }","title":""},{"docid":"cdb7ff35a672f01a02d28c6939100629","score":"0.6719517","text":"@Override\n\tpublic boolean onPrepareActionMode(ActionMode mode, Menu menu) {\n\t\treturn false;\n\t}","title":""},{"docid":"1082004b93dee5bfb9ba7a4a37d4b9dc","score":"0.6713764","text":"@Override\n public void onDestroyActionMode(ActionMode mode) {\n }","title":""},{"docid":"659b8d426cb54379903afc0c4c6c128f","score":"0.6704862","text":"@Override\n public boolean onCreateActionMode(ActionMode mode, Menu menu) {\n context_menu = menu;\n return true;\n }","title":""},{"docid":"087023ccf5137f4f229d7ee562ff5815","score":"0.6699114","text":"@Override\n\t\tpublic boolean onPrepareActionMode(ActionMode mode, Menu menu) {\n\t\t\treturn false; // Return false if nothing is done\n\t\t}","title":""},{"docid":"087023ccf5137f4f229d7ee562ff5815","score":"0.6699114","text":"@Override\n\t\tpublic boolean onPrepareActionMode(ActionMode mode, Menu menu) {\n\t\t\treturn false; // Return false if nothing is done\n\t\t}","title":""},{"docid":"087023ccf5137f4f229d7ee562ff5815","score":"0.6699114","text":"@Override\n\t\tpublic boolean onPrepareActionMode(ActionMode mode, Menu menu) {\n\t\t\treturn false; // Return false if nothing is done\n\t\t}","title":""},{"docid":"4189528cdc762368523bad9f499d93e2","score":"0.66758776","text":"@Override\n public void onDestroyActionMode(ActionMode mode) {\n }","title":""},{"docid":"4189528cdc762368523bad9f499d93e2","score":"0.66758776","text":"@Override\n public void onDestroyActionMode(ActionMode mode) {\n }","title":""},{"docid":"912e94fae0d4d2d77f8105365716051b","score":"0.6667088","text":"@Override\n\t\tpublic void onDestroyActionMode(ActionMode mode) {\n\t\t\t\n\t\t}","title":""},{"docid":"7e34add37ba2c8c7d49784e1c9ab7a26","score":"0.66420037","text":"@Override\n\t\t\t\tpublic void onDestroyActionMode(ActionMode mode)\n\t\t\t\t{\n\t\t\t\t}","title":""},{"docid":"bbfb2f40a84c87cbfb11439b40c7ac17","score":"0.6635431","text":"@Override\n public void onDestroyActionMode(ActionMode mode) {\n\n }","title":""},{"docid":"163f2958cc5c8d37e9571bed6ef911f5","score":"0.66330016","text":"public void onDestroyActionMode(ActionMode mode) {\n\t\t\t}","title":""},{"docid":"101dbdf446d6ea2aa0d773c133bbc4c2","score":"0.6606243","text":"@Override\n public void onDestroyActionMode(ActionMode mode) {\n }","title":""},{"docid":"babdff81e63c9c3d0b4a667590ba36b5","score":"0.65655917","text":"public void runMode() {\n\tchAssocAction.setEnabled(false);\n\taddTrackAction.setEnabled(false);\n\teditTrackAction.setEnabled(false);\n\tdeleteTrackAction.setEnabled(false);\n\tclearTracksAction.setEnabled(false);\n }","title":""},{"docid":"3dffb397171d02a86364fff518071c8a","score":"0.6552923","text":"@Override\n\t public boolean onCreateActionMode(ActionMode mode, Menu menu) {\n\t // Inflate a menu resource providing context menu items\n\t MenuInflater inflater = mode.getMenuInflater();\n\t inflater.inflate(R.menu.browser_actionbar, menu);\n\t return true;\n\t }","title":""},{"docid":"e0cea86fb164cd133e3543c58ebb8db2","score":"0.6544749","text":"private void setupCustomAction() {\n\n\t\tmodelManipulator.init ();\n\n\t}","title":""},{"docid":"170e907e28f681f7dad2787dfa9d12b8","score":"0.65248996","text":"public void onStartAction(String action) {\n\t}","title":""},{"docid":"bcc5ecae9c013a6ab46d6942ceea4d03","score":"0.6523886","text":"public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\n\t\t\t\treturn false;\n\t\t\t}","title":""},{"docid":"8a35fb20a3a0046cfbd395b431535a65","score":"0.65179163","text":"@Override\n\tpublic void onDestroyActionMode(ActionMode mode) {\n\n\t}","title":""},{"docid":"494d2a513d9dd39d34e256d767cae0b2","score":"0.6507521","text":"@Override\n\tpublic boolean onCreateActionMode(ActionMode mode, Menu menu) {\n\t\tMenuInflater inflater = mode.getMenuInflater();\n\t\tinflater.inflate(R.menu.context, menu);\n\t\treturn true;\n\t}","title":""},{"docid":"192bb7705826ac8fb1b157cc35341551","score":"0.64945024","text":"@Override\n public void onDestroyActionMode(ActionMode actionMode) {\n }","title":""},{"docid":"2b86213b2b3896d5264e17a16084db4c","score":"0.64912176","text":"public void initAction()\n\t{\n\t}","title":""},{"docid":"c128bdbc5b78ab7a64977007a654ad95","score":"0.64655507","text":"protected void init_actions()\n {\n action_obj = new CUP_actions();\n }","title":""},{"docid":"b917764190902e7a46eb34df9fa88b14","score":"0.6427504","text":"@Override\n\tpublic void createQuickAction() {\n\t\tsuper.createQuickAction();\n\t}","title":""},{"docid":"1c3f259f45d7970f93b9bbe76cbfa4b6","score":"0.6420088","text":"@Override\r\n public void onDestroyActionMode(ActionMode mode) {\r\n mActionMode = null;\r\n }","title":""},{"docid":"0a340d46e79727b51d69514a186dc5c7","score":"0.63951683","text":"@Override\n\t\t\tpublic void onClick(View arg0) {\n\t\t\t\tif(mMode==null){\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\tmMode = startActionMode( new ImpActionMode());\n\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\telse{\n\t\t\t\t\t//Toast.makeText(getApplicationContext(), \"MATANDO!!\", Toast.LENGTH_SHORT).show();\n\t\t\t\t\tmMode.finish();\n\t\t\t\t\tmMode=null;\n\t\t\t\t}\n\t\t\t\t\t\n\t\t\t}","title":""},{"docid":"dcbe5569017d5618f04f5e01b8494d33","score":"0.6366071","text":"@Override\n\t\tpublic void onDestroyActionMode(ActionMode mode) {\n\t\t\tmActionMode = null;\n\t\t}","title":""},{"docid":"cbb281cf96975e64ae927bc9481e9ac4","score":"0.6360978","text":"public void startSelection()\n {\n activity.startSupportActionMode(new ActionModeWrapper());\n }","title":""},{"docid":"e510729a3effb2a37951962d34bf39ec","score":"0.6337542","text":"protected void init_actions()\r\n {\r\n action_obj = new CUP$JojaphvizCup2$actions(this);\r\n }","title":""},{"docid":"2a529dc06ea2abf96b38a12183d4daa3","score":"0.632168","text":"protected void init_actions() {\n\t\taction_obj = new CUP$ScriptSplitter$actions(this);\n\t}","title":""},{"docid":"73800be1d55e398ad286e7fc2e202434","score":"0.6320578","text":"@Override\n public boolean onCreateActionMode(ActionMode mode, Menu menu) {\n // Inflate a menu resource providing context menu items\n MenuInflater inflater = mode.getMenuInflater();\n inflater.inflate(R.menu.context_menu, menu);\n return true;\n }","title":""},{"docid":"73800be1d55e398ad286e7fc2e202434","score":"0.6320578","text":"@Override\n public boolean onCreateActionMode(ActionMode mode, Menu menu) {\n // Inflate a menu resource providing context menu items\n MenuInflater inflater = mode.getMenuInflater();\n inflater.inflate(R.menu.context_menu, menu);\n return true;\n }","title":""},{"docid":"f8ec813b3eb566ea28c86db12a15250e","score":"0.63203627","text":"@SuppressLint(\"ResourceAsColor\")\n private void enableActionMode(int position)\n {\n if (actionMode == null)\n {\n actionMode = Objects.requireNonNull(getActivity()).startActionMode(actionModeCallback);\n }\n toggleSelection(position);\n }","title":""},{"docid":"2aab9d1c7cc73d49ebd515cc51d4fb1e","score":"0.6318835","text":"public boolean dispatchOnCreate() {\n this.mMenu.stopDispatchingItemsChanged();\n try {\n boolean onCreateActionMode = this.mCallback.onCreateActionMode(this, this.mMenu);\n this.mMenu.startDispatchingItemsChanged();\n return onCreateActionMode;\n } catch (Throwable th) {\n Throwable th2 = th;\n this.mMenu.startDispatchingItemsChanged();\n throw th2;\n }\n }","title":""},{"docid":"81c8019cd05c99e5c162e4d57f8946c5","score":"0.6298498","text":"@Override\n public boolean onPrepareActionMode(ActionMode actionMode, Menu menu) {\n actionMode.setTitle(\"Delete Tweets\");\n return false;\n }","title":""},{"docid":"67eee05d5ef4767ebc9cade7e8603b9d","score":"0.6277779","text":"@Override\n\t\tpublic boolean onCreateActionMode(ActionMode mode, Menu menu) {\n\t\t\t// Inflate a menu resource providing context menu items\n\t\t\tMenuInflater inflater = mode.getMenuInflater();\n\t\t\tinflater.inflate(R.menu.main, menu);\n\t\t\treturn true;\n\t\t}","title":""},{"docid":"3e3bec0857b4d3c158ed7bc218be959b","score":"0.6271024","text":"@Override\r\n\t\tpublic void onDestroyActionMode(ActionMode mode) {\r\n\t\t\tselectedIndex = -1;\r\n\t\t\tdrawListView(false,selectedIndex);\r\n\t\t\tmActionMode = null;\r\n\t\t}","title":""},{"docid":"6a6a720cdc9aec383fb43eb1957c5a15","score":"0.6246899","text":"@Override\n public void onDestroyActionMode(ActionMode mode) {\n mActionMode = null;\n selectedItem = -1;\n }","title":""},{"docid":"264fc5c131aafa763236cf1b199dce35","score":"0.6233604","text":"@Override\n\t\tpublic boolean onCreateActionMode(ActionMode mode, Menu menu) {\n\t\t\tnr = 0;\n\t\t\t/*MenuInflater inflater = mode.getMenuInflater();\n\t\t\tinflater.inflate(R.menu.menu_info, menu);*/\n\n\t\t\tmenu.clear();\n\t\t\tselectStatMenuItem = menu.add(100, 200000, 100, \"全选\");\n\t\t\tselectStatMenuItem.setShowAsAction(MenuItem.SHOW_AS_ACTION_ALWAYS);\n\t\t\tif(menuNameArray != null) {\n\t\t\t\tfor(int i = 0; i < menuNameArray.length; i++) {\n\t\t\t\t\tmenu.add(100, 200000 + i, i, menuNameArray[i]).setShowAsAction(MenuItem.SHOW_AS_ACTION_IF_ROOM);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn true;\n\t\t}","title":""},{"docid":"39aee607b14fc432228b4bb96eb7db1f","score":"0.6230242","text":"@Override\n\tprotected void setActions() {\n\t\t\n\t}","title":""},{"docid":"c80ae2ceb5d9706fa99ed5376e79000f","score":"0.62200946","text":"public abstract void onChooseMode(String mode);","title":""},{"docid":"463a47ee425afef238f2844f3ad06045","score":"0.621246","text":"@Override\n\t\tpublic boolean onCreateActionMode(ActionMode mode, Menu menu) {\n\t\t\t// Inflate a menu resource providing context menu items\n\t\t\tmode.setTitle(\"Options\");\n\t\t\tMenuInflater inflater = mode.getMenuInflater();\n\t\t\tinflater.inflate(R.menu.listmenu, menu);\n\t\t\treturn true;\n\t\t}","title":""},{"docid":"a3da0284d28d84cafbb7881adb5d8436","score":"0.6208114","text":"@Override\n public void onDestroyActionMode(ActionMode actionMode) {\n adapter.setActionMode(false);\n }","title":""},{"docid":"3f7b5930c9045e14643ce007099721a1","score":"0.6199754","text":"protected void init_actions()\r\n {\r\n action_obj = new CUP$Sintax$actions(this);\r\n }","title":""},{"docid":"5cceda51982cf9047429ecd0f3640809","score":"0.61931705","text":"protected void init_actions()\n {\n action_obj = new CUP$WavefunctionParser$actions(this);\n }","title":""},{"docid":"d9bbbb314cb2f76877848d03099d8f2c","score":"0.6185116","text":"protected void init_actions()\n {\n action_obj = new CUP$FnPlotParser$actions(this);\n }","title":""},{"docid":"44aa37da9661163abf1456d1bad144a0","score":"0.6171844","text":"@Override\n\t\tpublic void onDestroyActionMode(ActionMode mode) {\n\t\t\thideSystemUI();\n\t\t\tmActionMode = null;\n\t\t}","title":""},{"docid":"fed5d1be14a09e16336021eece4dc38a","score":"0.6170039","text":"@Override\n public boolean onCreateActionMode(ActionMode actionMode, Menu menu) {\n MenuInflater inflater = actionMode.getMenuInflater();\n inflater.inflate(R.menu.delete_list_context, menu);\n adapter.setActionMode(true);\n return true;\n }","title":""},{"docid":"03b8f1f742de203144ef5aa94b53257a","score":"0.6168713","text":"@Override\n\t\t\t\tpublic boolean onCreateActionMode(ActionMode mode, Menu menu)\n\t\t\t\t{\n\t\t\t\t\tMenuInflater inflater = mode.getMenuInflater();\n\t\t\t\t\tinflater.inflate(R.menu.context_customerlist_listitem, menu);\n\t\t\t\t\t\n\t\t\t\t\treturn true;\n\t\t\t\t}","title":""},{"docid":"33512116af9e43dc7e7cc2b668017c72","score":"0.61547786","text":"@Override\n\t\tpublic boolean onCreateActionMode(ActionMode mode, Menu menu) {\n\t\t\t// Inflate a menu resource providing context menu items\n\t\t\tMenuInflater inflater = mode.getMenuInflater();\n\t\t\tinflater.inflate(R.menu.submit_menu, menu);\n\n\t\t\treturn true;\n\t\t}","title":""},{"docid":"d7d17787435cf4807756220efeb7414c","score":"0.6148771","text":"public boolean onCreateActionMode(ActionMode mode, Menu menu) {\n\t\t\t\tMenuInflater inflater = mode.getMenuInflater();\n\t\t\t\tinflater.inflate(R.menu.crime_list_item_context, menu);\n\t\t\t\treturn true;\n\t\t\t}","title":""},{"docid":"2bd27151ec8afcaea81aca922d342b19","score":"0.61482483","text":"@Override\n public void onDestroyActionMode(ActionMode mode) {\n actionMenu = null;\n }","title":""},{"docid":"77b6feb5bebdc6f86bb974a1ae9b3f63","score":"0.61374015","text":"protected void init_actions()\n {\n action_obj = new CUP$OCLParser$actions(this);\n }","title":""},{"docid":"eb20ec3cd668cc0396c063c2c7b0f7ac","score":"0.61343145","text":"protected void init_actions()\n {\n action_obj = new CUP$javacup$actions(this);\n }","title":""},{"docid":"111647dda18c3262c03dafa5d1a06d05","score":"0.6125896","text":"protected void init_actions()\n {\n action_obj = new CUP$MJParser$actions(this);\n }","title":""},{"docid":"f62386afc54cb5ab14a982ae37c74e58","score":"0.6124093","text":"protected void init_actions()\r\n {\r\n action_obj = new CUP$Sintactico$actions(this);\r\n }","title":""},{"docid":"7bbb23804193806282484984e338f0ea","score":"0.6123975","text":"@Override\r\n\t\tpublic void start() {\n\t\t\tinitStart(mode);\t\t\r\n\t\t}","title":""},{"docid":"3e4f708f35c565238ff7e965ffdda8d4","score":"0.61232847","text":"@Override\n public void startAction() {\n mainController.getCurrentGameManager().transformSelectedArmyForceToSelectedTerritory();\n MapController.actionBeenTaken = true;\n }","title":""},{"docid":"3dddca1858b767b941cf0a73d9e6b0c3","score":"0.6120721","text":"@Override\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\n\n mode.setTitle(getResources().getString(R.string.OverlaysSelected));\n return false;\n }","title":""},{"docid":"0d572cf7a94f5660e0d0f9232d3f866f","score":"0.6117574","text":"protected void init_actions()\n {\n action_obj = new CUP$SyntacticRules$actions(this);\n }","title":""},{"docid":"1fb37f73b838ccc4b4d6417c905277b8","score":"0.61103016","text":"@Override\n public boolean onCreateActionMode(ActionMode mode, Menu menu) {\n MenuInflater inflater = mode.getMenuInflater();\n inflater.inflate(R.menu.contextual_tecnicas, menu);\n mode.setTitle(\"Select Items\");\n return true;\n }","title":""},{"docid":"470fd14013cd232b37e93fabf2f0ea1f","score":"0.6109293","text":"public void actionPerformed(ActionEvent event) {\r\n\t\t\t\tAnyMode.any();\t// calls AnyMode class\r\n\t\t\t}","title":""},{"docid":"998a818b0979a81c540169d2d7349fdd","score":"0.61050874","text":"public AclAction() {\n\t\t// TODO Auto-generated constructor stub\n\t}","title":""},{"docid":"e762da5c01d89addbee7e453c194375d","score":"0.60940075","text":"protected void init_actions()\r\n {\r\n action_obj = new CUP$CtxParser$actions(this);\r\n }","title":""},{"docid":"e4793bac117bf882971f79d07f48588b","score":"0.6093814","text":"@TargetApi(Build.VERSION_CODES.ICE_CREAM_SANDWICH)\n\t@Override\n\tpublic boolean onCreateActionMode(ActionMode mode, Menu menu) {\n\t\tmode.setTitle(\"0\");\n MenuInflater inflater = mode.getMenuInflater();\n inflater.inflate(R.menu.gallery_popmenu, menu);\n \n\t\treturn true;\n\t}","title":""},{"docid":"0f86213b34afa2f1ab54809cab325e1e","score":"0.60836184","text":"private void makeActions() {\n this.skypeAction = new SkypeAction(this.viewer);\r\n this.inviteAction = new InviteAction(this.viewer);\r\n this.renameContactAction = new RenameContactAction(this.viewer);\r\n this.deleteContactAction = new DeleteContactAction(this.viewer);\r\n }","title":""},{"docid":"dc4ed37a2cd6ab819392a09ac2fc61f2","score":"0.6083108","text":"public final void createActions() {\n\tchAssocAction = new QAction(tr(\"&Change DMX Association\"), this);\n\tchAssocAction\n\t\t.setStatusTip(tr(\"Change DMX Channel Association for the sound module\"));\n\tchAssocAction.triggered.connect(this, \"setAssoc()\");\n\tchAssocAction.setEnabled(false);\n\n\ttestSoundAction = new QAction(tr(\"&Test Sound Output\"), this);\n\ttestSoundAction\n\t\t.setStatusTip(tr(\"Perform a test of the sound setup on this system\"));\n\ttestSoundAction.triggered.connect(this, \"soundTest()\");\n\ttestSoundAction.setEnabled(false);\n\n\taddTrackAction = new QAction(tr(\"&Add Track\"), this);\n\taddTrackAction.setStatusTip(tr(\"Add a new track the show\"));\n\taddTrackAction.triggered.connect(this, \"addTrack()\");\n\taddTrackAction.setEnabled(false);\n\n\teditTrackAction = new QAction(tr(\"&Edit Track\"), this);\n\teditTrackAction\n\t\t.setStatusTip(tr(\"Edit an existing track within the show\"));\n\teditTrackAction.triggered.connect(this, \"editTrack()\");\n\teditTrackAction.setEnabled(false);\n\n\tdeleteTrackAction = new QAction(tr(\"&Delete Track\"), this);\n\tdeleteTrackAction.setStatusTip(tr(\"Remove a track from the show\"));\n\tdeleteTrackAction.triggered.connect(this, \"deleteTrack()\");\n\tdeleteTrackAction.setEnabled(false);\n\n\tclearTracksAction = new QAction(tr(\"&Clear Tracks\"), this);\n\tclearTracksAction.setStatusTip(tr(\"Remove all tracks from the show\"));\n\tclearTracksAction.triggered.connect(this, \"clearTracks()\");\n\tclearTracksAction.setEnabled(false);\n }","title":""},{"docid":"8ef7313e0ec54725ed5a23661ca2a925","score":"0.6058521","text":"protected void init_actions() {\n action_obj = new CUP$Parser$actions(this);\n }","title":""},{"docid":"46cefa50c085f0353bcab1ba645a2859","score":"0.6052224","text":"private void makeActions() {\n\t\tAction settingAction = new Action() {\n\t\t\tpublic void run() {\n\t\t\t\tfireChartSetting();\n\t\t\t}\n\t\t};\n\t\tsettingAction.setText(Messages.chartSettingTxt);\n\t\tsettingAction.setToolTipText(Messages.chartSettingTxt);\n\t\tsettingAction.setImageDescriptor(CubridManagerUIPlugin.getImageDescriptor(\"icons/action/setting-small.png\"));\n\n\t\tfinal IActionBars bars = getViewSite().getActionBars();\n\t\tIToolBarManager manager = bars.getToolBarManager();\n\n\t\tmanager.add(settingAction);\n\t}","title":""},{"docid":"a1a81580baba8c9dff6d1da0f28a3e95","score":"0.6050945","text":"protected void init_actions()\n {\n action_obj = new CUP$Sintactico$actions(this);\n }","title":""},{"docid":"a1a81580baba8c9dff6d1da0f28a3e95","score":"0.6050945","text":"protected void init_actions()\n {\n action_obj = new CUP$Sintactico$actions(this);\n }","title":""},{"docid":"1a216ccf130a56ee53b47a3b0ab9a0d0","score":"0.60496265","text":"private void createActions ()\r\n {\r\n closeAction = new CloseAction ();\r\n iconifyAction = new IconifyAction ();\r\n restoreAction = new RestoreAction ();\r\n maximizeAction = new MaximizeAction ();\r\n }","title":""},{"docid":"68b575eb35dc389099ef6c57ce947a8d","score":"0.6040202","text":"@Override\n\t\t\tpublic boolean onCreateActionMode(ActionMode mode, Menu menu) {\n\t\t\t\tmode.setTitle(\"Select Items\");\n\t\t\t\tmode.setSubtitle(\"1 item selected\");\n\t\t\t\tMenuInflater inflater = mode.getMenuInflater();\n\t\t\t\tinflater.inflate(R.menu.context_menu, menu);\n\t\t\t\treturn true;\n\t\t\t}","title":""},{"docid":"8c69d752d248a8c3168eb2e694761674","score":"0.60331935","text":"protected void init_actions()\n {\n action_obj = new CUP$Parser$actions(this);\n }","title":""},{"docid":"8c69d752d248a8c3168eb2e694761674","score":"0.60331935","text":"protected void init_actions()\n {\n action_obj = new CUP$Parser$actions(this);\n }","title":""},{"docid":"a6eb555ec777be57529a5ba27e929ce1","score":"0.60322094","text":"@Override\r\n\t\tpublic boolean onCreateActionMode(ActionMode mode, Menu menu) {\r\n\t\t\tMenuInflater inflater = getActivity().getMenuInflater();\r\n\t\t\tinflater.inflate(R.menu.list_fragment_contextual_menu, menu);\r\n\t\t\treturn true;\r\n\t\t}","title":""},{"docid":"0ccf9aac4f136c1470a080cdd572fd1b","score":"0.603096","text":"protected void init_actions()\n {\n action_obj = new CUP$ParserGk$actions(this);\n }","title":""},{"docid":"76706f199215a79dbbcbaa5d15a313b0","score":"0.60305625","text":"protected void init_actions()\r\n {\r\n action_obj = new CUP$sintacticoGXML$actions(this);\r\n }","title":""},{"docid":"3537e472658b13563508bf411a3d969a","score":"0.60174394","text":"@Override\n public void onDestroyActionMode(ActionMode mode) {\n mClickedView.setBackgroundColor(Color.parseColor(\"#FFFFFF\"));\n mActionMode = null;\n }","title":""}],"string":"[\n {\n \"docid\": \"7c6ed4a1032144f61bc428f5c33b4348\",\n \"score\": \"0.7515797\",\n \"text\": \"private void enableActionMode()\\n {\\n if (actionMode == null)\\n {\\n actionMode = Objects.requireNonNull(getActivity()).startActionMode(actionModeCallback);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"353c20d7ddf65dbc4d100561c8c8f5f9\",\n \"score\": \"0.7233073\",\n \"text\": \"public void onActionModeFinished(ActionMode mode) {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b4854ddc609a0bb62c002410cc3f7386\",\n \"score\": \"0.7152921\",\n \"text\": \"@Override\\n public boolean onCreateActionMode(ActionMode mode, Menu menu) {\\n\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3a8b60e5db732cf152061183ab6ca33\",\n \"score\": \"0.7147411\",\n \"text\": \"@Override\\n public boolean onCreateActionMode(ActionMode mode, Menu menu) {\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ffb319971694792c39e15a207b404368\",\n \"score\": \"0.71072173\",\n \"text\": \"@Override\\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\n\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96702d6b8857cd873c3695f6287a47c4\",\n \"score\": \"0.69912714\",\n \"text\": \"@Override\\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"08be6c9caabc0f80e415e2ead82cb5f7\",\n \"score\": \"0.6933123\",\n \"text\": \"@Override\\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\n // Here you can perform updates to the CAB due to\\n // an invalidate() request\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c1bfb2fe46b9b84d46edb4afbc0bc602\",\n \"score\": \"0.69088554\",\n \"text\": \"@Override\\n public boolean onPrepareActionMode(ActionMode arg0, Menu arg1) {\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6268a744aa59b1dcbec03fd883b7620a\",\n \"score\": \"0.6894943\",\n \"text\": \"@Override\\n\\t public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\n\\t return false; // Return false if nothing is done\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"611e7f6676417e7cc0610a904131e79f\",\n \"score\": \"0.6889988\",\n \"text\": \"@Override\\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"611e7f6676417e7cc0610a904131e79f\",\n \"score\": \"0.6889988\",\n \"text\": \"@Override\\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"822916b1c762b9c5023ba3f711940254\",\n \"score\": \"0.6888842\",\n \"text\": \"@Override\\n public boolean onPrepareActionMode(ActionMode actionMode, Menu menu) {\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"174797ab242e8e08c9cbba6d755e6671\",\n \"score\": \"0.68726176\",\n \"text\": \"@Override\\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\n return false; // Return false if nothing is done\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b3752b5eb22bf6c736f7678135eef93e\",\n \"score\": \"0.68628025\",\n \"text\": \"@Override\\r\\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\r\\n return false; // Return false if nothing is done\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00907d74dfb2cdb22256c3549eeebf91\",\n \"score\": \"0.68161154\",\n \"text\": \"@Override\\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\n return false; // Return false if nothing is done\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00907d74dfb2cdb22256c3549eeebf91\",\n \"score\": \"0.68161154\",\n \"text\": \"@Override\\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\n return false; // Return false if nothing is done\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00907d74dfb2cdb22256c3549eeebf91\",\n \"score\": \"0.68161154\",\n \"text\": \"@Override\\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\n return false; // Return false if nothing is done\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3661c81352671ebbe45de1a794aa8c0\",\n \"score\": \"0.679971\",\n \"text\": \"@Override\\r\\n\\t\\tpublic boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\r\\n\\t\\t\\tmActionMode = mode;\\r\\n\\t\\t\\tdrawListView(true,selectedIndex);\\r\\n\\t\\t\\treturn true; // Return false if nothing is done\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46561d836afa6153cdbaef36c018477f\",\n \"score\": \"0.6792259\",\n \"text\": \"@Override\\n\\t\\tpublic boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\n\\t\\t\\treturn false;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7731d82e4a3130b409317caf229206a\",\n \"score\": \"0.6782186\",\n \"text\": \"@Override\\r\\n public void initActions() {\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba321e5ce685bb7dcc45b9e859a615de\",\n \"score\": \"0.67528516\",\n \"text\": \"@Override\\n public void onSupportActionModeStarted(ActionMode mode) {\\n freezeToolbar();\\n super.onSupportActionModeStarted(mode);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cdb7ff35a672f01a02d28c6939100629\",\n \"score\": \"0.6719517\",\n \"text\": \"@Override\\n\\tpublic boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1082004b93dee5bfb9ba7a4a37d4b9dc\",\n \"score\": \"0.6713764\",\n \"text\": \"@Override\\n public void onDestroyActionMode(ActionMode mode) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"659b8d426cb54379903afc0c4c6c128f\",\n \"score\": \"0.6704862\",\n \"text\": \"@Override\\n public boolean onCreateActionMode(ActionMode mode, Menu menu) {\\n context_menu = menu;\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"087023ccf5137f4f229d7ee562ff5815\",\n \"score\": \"0.6699114\",\n \"text\": \"@Override\\n\\t\\tpublic boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\n\\t\\t\\treturn false; // Return false if nothing is done\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"087023ccf5137f4f229d7ee562ff5815\",\n \"score\": \"0.6699114\",\n \"text\": \"@Override\\n\\t\\tpublic boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\n\\t\\t\\treturn false; // Return false if nothing is done\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"087023ccf5137f4f229d7ee562ff5815\",\n \"score\": \"0.6699114\",\n \"text\": \"@Override\\n\\t\\tpublic boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\n\\t\\t\\treturn false; // Return false if nothing is done\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4189528cdc762368523bad9f499d93e2\",\n \"score\": \"0.66758776\",\n \"text\": \"@Override\\n public void onDestroyActionMode(ActionMode mode) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4189528cdc762368523bad9f499d93e2\",\n \"score\": \"0.66758776\",\n \"text\": \"@Override\\n public void onDestroyActionMode(ActionMode mode) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"912e94fae0d4d2d77f8105365716051b\",\n \"score\": \"0.6667088\",\n \"text\": \"@Override\\n\\t\\tpublic void onDestroyActionMode(ActionMode mode) {\\n\\t\\t\\t\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e34add37ba2c8c7d49784e1c9ab7a26\",\n \"score\": \"0.66420037\",\n \"text\": \"@Override\\n\\t\\t\\t\\tpublic void onDestroyActionMode(ActionMode mode)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bbfb2f40a84c87cbfb11439b40c7ac17\",\n \"score\": \"0.6635431\",\n \"text\": \"@Override\\n public void onDestroyActionMode(ActionMode mode) {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"163f2958cc5c8d37e9571bed6ef911f5\",\n \"score\": \"0.66330016\",\n \"text\": \"public void onDestroyActionMode(ActionMode mode) {\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"101dbdf446d6ea2aa0d773c133bbc4c2\",\n \"score\": \"0.6606243\",\n \"text\": \"@Override\\n public void onDestroyActionMode(ActionMode mode) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"babdff81e63c9c3d0b4a667590ba36b5\",\n \"score\": \"0.65655917\",\n \"text\": \"public void runMode() {\\n\\tchAssocAction.setEnabled(false);\\n\\taddTrackAction.setEnabled(false);\\n\\teditTrackAction.setEnabled(false);\\n\\tdeleteTrackAction.setEnabled(false);\\n\\tclearTracksAction.setEnabled(false);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3dffb397171d02a86364fff518071c8a\",\n \"score\": \"0.6552923\",\n \"text\": \"@Override\\n\\t public boolean onCreateActionMode(ActionMode mode, Menu menu) {\\n\\t // Inflate a menu resource providing context menu items\\n\\t MenuInflater inflater = mode.getMenuInflater();\\n\\t inflater.inflate(R.menu.browser_actionbar, menu);\\n\\t return true;\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0cea86fb164cd133e3543c58ebb8db2\",\n \"score\": \"0.6544749\",\n \"text\": \"private void setupCustomAction() {\\n\\n\\t\\tmodelManipulator.init ();\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"170e907e28f681f7dad2787dfa9d12b8\",\n \"score\": \"0.65248996\",\n \"text\": \"public void onStartAction(String action) {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bcc5ecae9c013a6ab46d6942ceea4d03\",\n \"score\": \"0.6523886\",\n \"text\": \"public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a35fb20a3a0046cfbd395b431535a65\",\n \"score\": \"0.65179163\",\n \"text\": \"@Override\\n\\tpublic void onDestroyActionMode(ActionMode mode) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"494d2a513d9dd39d34e256d767cae0b2\",\n \"score\": \"0.6507521\",\n \"text\": \"@Override\\n\\tpublic boolean onCreateActionMode(ActionMode mode, Menu menu) {\\n\\t\\tMenuInflater inflater = mode.getMenuInflater();\\n\\t\\tinflater.inflate(R.menu.context, menu);\\n\\t\\treturn true;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"192bb7705826ac8fb1b157cc35341551\",\n \"score\": \"0.64945024\",\n \"text\": \"@Override\\n public void onDestroyActionMode(ActionMode actionMode) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b86213b2b3896d5264e17a16084db4c\",\n \"score\": \"0.64912176\",\n \"text\": \"public void initAction()\\n\\t{\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c128bdbc5b78ab7a64977007a654ad95\",\n \"score\": \"0.64655507\",\n \"text\": \"protected void init_actions()\\n {\\n action_obj = new CUP_actions();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b917764190902e7a46eb34df9fa88b14\",\n \"score\": \"0.6427504\",\n \"text\": \"@Override\\n\\tpublic void createQuickAction() {\\n\\t\\tsuper.createQuickAction();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c3f259f45d7970f93b9bbe76cbfa4b6\",\n \"score\": \"0.6420088\",\n \"text\": \"@Override\\r\\n public void onDestroyActionMode(ActionMode mode) {\\r\\n mActionMode = null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a340d46e79727b51d69514a186dc5c7\",\n \"score\": \"0.63951683\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void onClick(View arg0) {\\n\\t\\t\\t\\tif(mMode==null){\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tmMode = startActionMode( new ImpActionMode());\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t//Toast.makeText(getApplicationContext(), \\\"MATANDO!!\\\", Toast.LENGTH_SHORT).show();\\n\\t\\t\\t\\t\\tmMode.finish();\\n\\t\\t\\t\\t\\tmMode=null;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dcbe5569017d5618f04f5e01b8494d33\",\n \"score\": \"0.6366071\",\n \"text\": \"@Override\\n\\t\\tpublic void onDestroyActionMode(ActionMode mode) {\\n\\t\\t\\tmActionMode = null;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cbb281cf96975e64ae927bc9481e9ac4\",\n \"score\": \"0.6360978\",\n \"text\": \"public void startSelection()\\n {\\n activity.startSupportActionMode(new ActionModeWrapper());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e510729a3effb2a37951962d34bf39ec\",\n \"score\": \"0.6337542\",\n \"text\": \"protected void init_actions()\\r\\n {\\r\\n action_obj = new CUP$JojaphvizCup2$actions(this);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a529dc06ea2abf96b38a12183d4daa3\",\n \"score\": \"0.632168\",\n \"text\": \"protected void init_actions() {\\n\\t\\taction_obj = new CUP$ScriptSplitter$actions(this);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73800be1d55e398ad286e7fc2e202434\",\n \"score\": \"0.6320578\",\n \"text\": \"@Override\\n public boolean onCreateActionMode(ActionMode mode, Menu menu) {\\n // Inflate a menu resource providing context menu items\\n MenuInflater inflater = mode.getMenuInflater();\\n inflater.inflate(R.menu.context_menu, menu);\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73800be1d55e398ad286e7fc2e202434\",\n \"score\": \"0.6320578\",\n \"text\": \"@Override\\n public boolean onCreateActionMode(ActionMode mode, Menu menu) {\\n // Inflate a menu resource providing context menu items\\n MenuInflater inflater = mode.getMenuInflater();\\n inflater.inflate(R.menu.context_menu, menu);\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8ec813b3eb566ea28c86db12a15250e\",\n \"score\": \"0.63203627\",\n \"text\": \"@SuppressLint(\\\"ResourceAsColor\\\")\\n private void enableActionMode(int position)\\n {\\n if (actionMode == null)\\n {\\n actionMode = Objects.requireNonNull(getActivity()).startActionMode(actionModeCallback);\\n }\\n toggleSelection(position);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2aab9d1c7cc73d49ebd515cc51d4fb1e\",\n \"score\": \"0.6318835\",\n \"text\": \"public boolean dispatchOnCreate() {\\n this.mMenu.stopDispatchingItemsChanged();\\n try {\\n boolean onCreateActionMode = this.mCallback.onCreateActionMode(this, this.mMenu);\\n this.mMenu.startDispatchingItemsChanged();\\n return onCreateActionMode;\\n } catch (Throwable th) {\\n Throwable th2 = th;\\n this.mMenu.startDispatchingItemsChanged();\\n throw th2;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81c8019cd05c99e5c162e4d57f8946c5\",\n \"score\": \"0.6298498\",\n \"text\": \"@Override\\n public boolean onPrepareActionMode(ActionMode actionMode, Menu menu) {\\n actionMode.setTitle(\\\"Delete Tweets\\\");\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67eee05d5ef4767ebc9cade7e8603b9d\",\n \"score\": \"0.6277779\",\n \"text\": \"@Override\\n\\t\\tpublic boolean onCreateActionMode(ActionMode mode, Menu menu) {\\n\\t\\t\\t// Inflate a menu resource providing context menu items\\n\\t\\t\\tMenuInflater inflater = mode.getMenuInflater();\\n\\t\\t\\tinflater.inflate(R.menu.main, menu);\\n\\t\\t\\treturn true;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e3bec0857b4d3c158ed7bc218be959b\",\n \"score\": \"0.6271024\",\n \"text\": \"@Override\\r\\n\\t\\tpublic void onDestroyActionMode(ActionMode mode) {\\r\\n\\t\\t\\tselectedIndex = -1;\\r\\n\\t\\t\\tdrawListView(false,selectedIndex);\\r\\n\\t\\t\\tmActionMode = null;\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a6a720cdc9aec383fb43eb1957c5a15\",\n \"score\": \"0.6246899\",\n \"text\": \"@Override\\n public void onDestroyActionMode(ActionMode mode) {\\n mActionMode = null;\\n selectedItem = -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"264fc5c131aafa763236cf1b199dce35\",\n \"score\": \"0.6233604\",\n \"text\": \"@Override\\n\\t\\tpublic boolean onCreateActionMode(ActionMode mode, Menu menu) {\\n\\t\\t\\tnr = 0;\\n\\t\\t\\t/*MenuInflater inflater = mode.getMenuInflater();\\n\\t\\t\\tinflater.inflate(R.menu.menu_info, menu);*/\\n\\n\\t\\t\\tmenu.clear();\\n\\t\\t\\tselectStatMenuItem = menu.add(100, 200000, 100, \\\"全选\\\");\\n\\t\\t\\tselectStatMenuItem.setShowAsAction(MenuItem.SHOW_AS_ACTION_ALWAYS);\\n\\t\\t\\tif(menuNameArray != null) {\\n\\t\\t\\t\\tfor(int i = 0; i < menuNameArray.length; i++) {\\n\\t\\t\\t\\t\\tmenu.add(100, 200000 + i, i, menuNameArray[i]).setShowAsAction(MenuItem.SHOW_AS_ACTION_IF_ROOM);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn true;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39aee607b14fc432228b4bb96eb7db1f\",\n \"score\": \"0.6230242\",\n \"text\": \"@Override\\n\\tprotected void setActions() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c80ae2ceb5d9706fa99ed5376e79000f\",\n \"score\": \"0.62200946\",\n \"text\": \"public abstract void onChooseMode(String mode);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"463a47ee425afef238f2844f3ad06045\",\n \"score\": \"0.621246\",\n \"text\": \"@Override\\n\\t\\tpublic boolean onCreateActionMode(ActionMode mode, Menu menu) {\\n\\t\\t\\t// Inflate a menu resource providing context menu items\\n\\t\\t\\tmode.setTitle(\\\"Options\\\");\\n\\t\\t\\tMenuInflater inflater = mode.getMenuInflater();\\n\\t\\t\\tinflater.inflate(R.menu.listmenu, menu);\\n\\t\\t\\treturn true;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3da0284d28d84cafbb7881adb5d8436\",\n \"score\": \"0.6208114\",\n \"text\": \"@Override\\n public void onDestroyActionMode(ActionMode actionMode) {\\n adapter.setActionMode(false);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f7b5930c9045e14643ce007099721a1\",\n \"score\": \"0.6199754\",\n \"text\": \"protected void init_actions()\\r\\n {\\r\\n action_obj = new CUP$Sintax$actions(this);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5cceda51982cf9047429ecd0f3640809\",\n \"score\": \"0.61931705\",\n \"text\": \"protected void init_actions()\\n {\\n action_obj = new CUP$WavefunctionParser$actions(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d9bbbb314cb2f76877848d03099d8f2c\",\n \"score\": \"0.6185116\",\n \"text\": \"protected void init_actions()\\n {\\n action_obj = new CUP$FnPlotParser$actions(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44aa37da9661163abf1456d1bad144a0\",\n \"score\": \"0.6171844\",\n \"text\": \"@Override\\n\\t\\tpublic void onDestroyActionMode(ActionMode mode) {\\n\\t\\t\\thideSystemUI();\\n\\t\\t\\tmActionMode = null;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fed5d1be14a09e16336021eece4dc38a\",\n \"score\": \"0.6170039\",\n \"text\": \"@Override\\n public boolean onCreateActionMode(ActionMode actionMode, Menu menu) {\\n MenuInflater inflater = actionMode.getMenuInflater();\\n inflater.inflate(R.menu.delete_list_context, menu);\\n adapter.setActionMode(true);\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03b8f1f742de203144ef5aa94b53257a\",\n \"score\": \"0.6168713\",\n \"text\": \"@Override\\n\\t\\t\\t\\tpublic boolean onCreateActionMode(ActionMode mode, Menu menu)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tMenuInflater inflater = mode.getMenuInflater();\\n\\t\\t\\t\\t\\tinflater.inflate(R.menu.context_customerlist_listitem, menu);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"33512116af9e43dc7e7cc2b668017c72\",\n \"score\": \"0.61547786\",\n \"text\": \"@Override\\n\\t\\tpublic boolean onCreateActionMode(ActionMode mode, Menu menu) {\\n\\t\\t\\t// Inflate a menu resource providing context menu items\\n\\t\\t\\tMenuInflater inflater = mode.getMenuInflater();\\n\\t\\t\\tinflater.inflate(R.menu.submit_menu, menu);\\n\\n\\t\\t\\treturn true;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7d17787435cf4807756220efeb7414c\",\n \"score\": \"0.6148771\",\n \"text\": \"public boolean onCreateActionMode(ActionMode mode, Menu menu) {\\n\\t\\t\\t\\tMenuInflater inflater = mode.getMenuInflater();\\n\\t\\t\\t\\tinflater.inflate(R.menu.crime_list_item_context, menu);\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2bd27151ec8afcaea81aca922d342b19\",\n \"score\": \"0.61482483\",\n \"text\": \"@Override\\n public void onDestroyActionMode(ActionMode mode) {\\n actionMenu = null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77b6feb5bebdc6f86bb974a1ae9b3f63\",\n \"score\": \"0.61374015\",\n \"text\": \"protected void init_actions()\\n {\\n action_obj = new CUP$OCLParser$actions(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb20ec3cd668cc0396c063c2c7b0f7ac\",\n \"score\": \"0.61343145\",\n \"text\": \"protected void init_actions()\\n {\\n action_obj = new CUP$javacup$actions(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"111647dda18c3262c03dafa5d1a06d05\",\n \"score\": \"0.6125896\",\n \"text\": \"protected void init_actions()\\n {\\n action_obj = new CUP$MJParser$actions(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f62386afc54cb5ab14a982ae37c74e58\",\n \"score\": \"0.6124093\",\n \"text\": \"protected void init_actions()\\r\\n {\\r\\n action_obj = new CUP$Sintactico$actions(this);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7bbb23804193806282484984e338f0ea\",\n \"score\": \"0.6123975\",\n \"text\": \"@Override\\r\\n\\t\\tpublic void start() {\\n\\t\\t\\tinitStart(mode);\\t\\t\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e4f708f35c565238ff7e965ffdda8d4\",\n \"score\": \"0.61232847\",\n \"text\": \"@Override\\n public void startAction() {\\n mainController.getCurrentGameManager().transformSelectedArmyForceToSelectedTerritory();\\n MapController.actionBeenTaken = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3dddca1858b767b941cf0a73d9e6b0c3\",\n \"score\": \"0.6120721\",\n \"text\": \"@Override\\n public boolean onPrepareActionMode(ActionMode mode, Menu menu) {\\n\\n mode.setTitle(getResources().getString(R.string.OverlaysSelected));\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d572cf7a94f5660e0d0f9232d3f866f\",\n \"score\": \"0.6117574\",\n \"text\": \"protected void init_actions()\\n {\\n action_obj = new CUP$SyntacticRules$actions(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1fb37f73b838ccc4b4d6417c905277b8\",\n \"score\": \"0.61103016\",\n \"text\": \"@Override\\n public boolean onCreateActionMode(ActionMode mode, Menu menu) {\\n MenuInflater inflater = mode.getMenuInflater();\\n inflater.inflate(R.menu.contextual_tecnicas, menu);\\n mode.setTitle(\\\"Select Items\\\");\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"470fd14013cd232b37e93fabf2f0ea1f\",\n \"score\": \"0.6109293\",\n \"text\": \"public void actionPerformed(ActionEvent event) {\\r\\n\\t\\t\\t\\tAnyMode.any();\\t// calls AnyMode class\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"998a818b0979a81c540169d2d7349fdd\",\n \"score\": \"0.61050874\",\n \"text\": \"public AclAction() {\\n\\t\\t// TODO Auto-generated constructor stub\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e762da5c01d89addbee7e453c194375d\",\n \"score\": \"0.60940075\",\n \"text\": \"protected void init_actions()\\r\\n {\\r\\n action_obj = new CUP$CtxParser$actions(this);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4793bac117bf882971f79d07f48588b\",\n \"score\": \"0.6093814\",\n \"text\": \"@TargetApi(Build.VERSION_CODES.ICE_CREAM_SANDWICH)\\n\\t@Override\\n\\tpublic boolean onCreateActionMode(ActionMode mode, Menu menu) {\\n\\t\\tmode.setTitle(\\\"0\\\");\\n MenuInflater inflater = mode.getMenuInflater();\\n inflater.inflate(R.menu.gallery_popmenu, menu);\\n \\n\\t\\treturn true;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f86213b34afa2f1ab54809cab325e1e\",\n \"score\": \"0.60836184\",\n \"text\": \"private void makeActions() {\\n this.skypeAction = new SkypeAction(this.viewer);\\r\\n this.inviteAction = new InviteAction(this.viewer);\\r\\n this.renameContactAction = new RenameContactAction(this.viewer);\\r\\n this.deleteContactAction = new DeleteContactAction(this.viewer);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc4ed37a2cd6ab819392a09ac2fc61f2\",\n \"score\": \"0.6083108\",\n \"text\": \"public final void createActions() {\\n\\tchAssocAction = new QAction(tr(\\\"&Change DMX Association\\\"), this);\\n\\tchAssocAction\\n\\t\\t.setStatusTip(tr(\\\"Change DMX Channel Association for the sound module\\\"));\\n\\tchAssocAction.triggered.connect(this, \\\"setAssoc()\\\");\\n\\tchAssocAction.setEnabled(false);\\n\\n\\ttestSoundAction = new QAction(tr(\\\"&Test Sound Output\\\"), this);\\n\\ttestSoundAction\\n\\t\\t.setStatusTip(tr(\\\"Perform a test of the sound setup on this system\\\"));\\n\\ttestSoundAction.triggered.connect(this, \\\"soundTest()\\\");\\n\\ttestSoundAction.setEnabled(false);\\n\\n\\taddTrackAction = new QAction(tr(\\\"&Add Track\\\"), this);\\n\\taddTrackAction.setStatusTip(tr(\\\"Add a new track the show\\\"));\\n\\taddTrackAction.triggered.connect(this, \\\"addTrack()\\\");\\n\\taddTrackAction.setEnabled(false);\\n\\n\\teditTrackAction = new QAction(tr(\\\"&Edit Track\\\"), this);\\n\\teditTrackAction\\n\\t\\t.setStatusTip(tr(\\\"Edit an existing track within the show\\\"));\\n\\teditTrackAction.triggered.connect(this, \\\"editTrack()\\\");\\n\\teditTrackAction.setEnabled(false);\\n\\n\\tdeleteTrackAction = new QAction(tr(\\\"&Delete Track\\\"), this);\\n\\tdeleteTrackAction.setStatusTip(tr(\\\"Remove a track from the show\\\"));\\n\\tdeleteTrackAction.triggered.connect(this, \\\"deleteTrack()\\\");\\n\\tdeleteTrackAction.setEnabled(false);\\n\\n\\tclearTracksAction = new QAction(tr(\\\"&Clear Tracks\\\"), this);\\n\\tclearTracksAction.setStatusTip(tr(\\\"Remove all tracks from the show\\\"));\\n\\tclearTracksAction.triggered.connect(this, \\\"clearTracks()\\\");\\n\\tclearTracksAction.setEnabled(false);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ef7313e0ec54725ed5a23661ca2a925\",\n \"score\": \"0.6058521\",\n \"text\": \"protected void init_actions() {\\n action_obj = new CUP$Parser$actions(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46cefa50c085f0353bcab1ba645a2859\",\n \"score\": \"0.6052224\",\n \"text\": \"private void makeActions() {\\n\\t\\tAction settingAction = new Action() {\\n\\t\\t\\tpublic void run() {\\n\\t\\t\\t\\tfireChartSetting();\\n\\t\\t\\t}\\n\\t\\t};\\n\\t\\tsettingAction.setText(Messages.chartSettingTxt);\\n\\t\\tsettingAction.setToolTipText(Messages.chartSettingTxt);\\n\\t\\tsettingAction.setImageDescriptor(CubridManagerUIPlugin.getImageDescriptor(\\\"icons/action/setting-small.png\\\"));\\n\\n\\t\\tfinal IActionBars bars = getViewSite().getActionBars();\\n\\t\\tIToolBarManager manager = bars.getToolBarManager();\\n\\n\\t\\tmanager.add(settingAction);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1a81580baba8c9dff6d1da0f28a3e95\",\n \"score\": \"0.6050945\",\n \"text\": \"protected void init_actions()\\n {\\n action_obj = new CUP$Sintactico$actions(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1a81580baba8c9dff6d1da0f28a3e95\",\n \"score\": \"0.6050945\",\n \"text\": \"protected void init_actions()\\n {\\n action_obj = new CUP$Sintactico$actions(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a216ccf130a56ee53b47a3b0ab9a0d0\",\n \"score\": \"0.60496265\",\n \"text\": \"private void createActions ()\\r\\n {\\r\\n closeAction = new CloseAction ();\\r\\n iconifyAction = new IconifyAction ();\\r\\n restoreAction = new RestoreAction ();\\r\\n maximizeAction = new MaximizeAction ();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68b575eb35dc389099ef6c57ce947a8d\",\n \"score\": \"0.6040202\",\n \"text\": \"@Override\\n\\t\\t\\tpublic boolean onCreateActionMode(ActionMode mode, Menu menu) {\\n\\t\\t\\t\\tmode.setTitle(\\\"Select Items\\\");\\n\\t\\t\\t\\tmode.setSubtitle(\\\"1 item selected\\\");\\n\\t\\t\\t\\tMenuInflater inflater = mode.getMenuInflater();\\n\\t\\t\\t\\tinflater.inflate(R.menu.context_menu, menu);\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c69d752d248a8c3168eb2e694761674\",\n \"score\": \"0.60331935\",\n \"text\": \"protected void init_actions()\\n {\\n action_obj = new CUP$Parser$actions(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c69d752d248a8c3168eb2e694761674\",\n \"score\": \"0.60331935\",\n \"text\": \"protected void init_actions()\\n {\\n action_obj = new CUP$Parser$actions(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6eb555ec777be57529a5ba27e929ce1\",\n \"score\": \"0.60322094\",\n \"text\": \"@Override\\r\\n\\t\\tpublic boolean onCreateActionMode(ActionMode mode, Menu menu) {\\r\\n\\t\\t\\tMenuInflater inflater = getActivity().getMenuInflater();\\r\\n\\t\\t\\tinflater.inflate(R.menu.list_fragment_contextual_menu, menu);\\r\\n\\t\\t\\treturn true;\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0ccf9aac4f136c1470a080cdd572fd1b\",\n \"score\": \"0.603096\",\n \"text\": \"protected void init_actions()\\n {\\n action_obj = new CUP$ParserGk$actions(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"76706f199215a79dbbcbaa5d15a313b0\",\n \"score\": \"0.60305625\",\n \"text\": \"protected void init_actions()\\r\\n {\\r\\n action_obj = new CUP$sintacticoGXML$actions(this);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3537e472658b13563508bf411a3d969a\",\n \"score\": \"0.60174394\",\n \"text\": \"@Override\\n public void onDestroyActionMode(ActionMode mode) {\\n mClickedView.setBackgroundColor(Color.parseColor(\\\"#FFFFFF\\\"));\\n mActionMode = null;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983792,"cells":{"query_id":{"kind":"string","value":"56343b78db00fe4fdf6c21720529db6c"},"query":{"kind":"string","value":"Handles the HTTP POST method."},"positive_passages":{"kind":"list like","value":[{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.0","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""}],"string":"[\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.0\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"9d82bd438ca885e91ee42f441f6a67c0","score":"0.73963165","text":"@Override\n\tpublic void doPost(Request request, Response response) {\n\t\t\n\t}","title":""},{"docid":"5e0c4bf9984bc451fe093fb1141f9960","score":"0.7392475","text":"@Override\n\tpublic void doPost(HttpServletRequest request,\n\t\t\tHttpServletResponse response) {\n\t\t\n\t}","title":""},{"docid":"fa0a4e6113c48e69e694b8276b2df75d","score":"0.7276118","text":"public void post();","title":""},{"docid":"74a1d39844f5b754acc70bd7450dc4c3","score":"0.69006836","text":"@Override\n\tprotected Method getMethod() {\n\t\treturn Method.POST;\n\t}","title":""},{"docid":"642e06de032be2a42df6cae66b584bd1","score":"0.6672056","text":"@Override\n\tpublic void post() {\n\t\tRestAssured.post(this.config.domain+this.config.path).\n\t\tthen().\n\t\t\tstatusCode(405);\n\t}","title":""},{"docid":"9e7009b13b90e5ab2a40ea95227a085f","score":"0.6666394","text":"@Override\n protected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\n log.debug(\"Post method\");\n process(req, resp);\n }","title":""},{"docid":"48df90c4c28d036e55a40b91d3afe9cc","score":"0.66319716","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response) {\n processGetRequest(request, response);\n }","title":""},{"docid":"04b3be29df82bc0728f643a8f81a8628","score":"0.66038","text":"@Override\n\t\tprotected void doPost(HttpServletRequest request, HttpServletResponse response)\n\t\t\t\tthrows ServletException, IOException {\n\t\t\tsuper.doPost(request, response);\n\t\t}","title":""},{"docid":"04b3be29df82bc0728f643a8f81a8628","score":"0.66038","text":"@Override\n\t\tprotected void doPost(HttpServletRequest request, HttpServletResponse response)\n\t\t\t\tthrows ServletException, IOException {\n\t\t\tsuper.doPost(request, response);\n\t\t}","title":""},{"docid":"5b878d55dac7a93ea3b26fd4782bbf24","score":"0.65904385","text":"public void doPost() {\n\t\t\n\t\tRestClient restClient = new RestClient(url);\n\t\tRequestView request = new RequestView();\n\t\trequest.setKey1(\"foo\");\n\t\trequest.setKey2(\"bar\");\n\t\tResponseView response = restClient.post(request, ResponseView.class);\n\t}","title":""},{"docid":"86247b5b89d39537b5c3299d14e9f444","score":"0.6590143","text":"public void postHandle(HttpServletRequest request, HttpServletResponse response) throws Exception {\n\t}","title":""},{"docid":"f40b6cf0a2e2767a683b14ddf07499f1","score":"0.6561377","text":"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\n }","title":""},{"docid":"37339971bf2b0019d1c66db1068226d4","score":"0.65408474","text":"@Override\n\tpublic void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\n\t\t\n\t}","title":""},{"docid":"6563ac4d9c91fb470ad53250b53f0567","score":"0.6527252","text":"@Override\n\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp)\n\t\t\tthrows ServletException, IOException {\n\t\tsuper.doPost(req, resp);\n\t}","title":""},{"docid":"e90bf965cfd387f30c166261e7a4d604","score":"0.6526384","text":"@Override\n public void postHandle(WebRequest request, ModelMap model) throws Exception {\n\n }","title":""},{"docid":"4531e701d0b4153ce5bb28debb13f94b","score":"0.65190226","text":"public void doPost(HttpServletRequest request, HttpServletResponse response)\r\n\t\t\tthrows ServletException, IOException {\r\n\r\n\t\t\r\n\t}","title":""},{"docid":"5d77964080d3f2a26741bf1b92e7517e","score":"0.64845836","text":"public void doPost(HttpServletRequest request, HttpServletResponse response)\n\tthrows ServletException, IOException;","title":""},{"docid":"55edde437763cec2bc18f7e3522f01e2","score":"0.64827436","text":"@Override\r\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\r\n throws ServletException, IOException {\r\n }","title":""},{"docid":"55edde437763cec2bc18f7e3522f01e2","score":"0.64827436","text":"@Override\r\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\r\n throws ServletException, IOException {\r\n }","title":""},{"docid":"55edde437763cec2bc18f7e3522f01e2","score":"0.64827436","text":"@Override\r\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\r\n throws ServletException, IOException {\r\n }","title":""},{"docid":"20fdf0305affa3ce4e79ebf49413aa51","score":"0.6474492","text":"public abstract String post(HaDasReq type, HaJsonHttpParams params,\n\t\t\tHaHandler handler) throws Exception;","title":""},{"docid":"dac34781d6c5dbddce97d08d1d3e7c99","score":"0.6453584","text":"@Override\r\n\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\n\t\tsuper.doPost(req, resp);\r\n\t}","title":""},{"docid":"dac34781d6c5dbddce97d08d1d3e7c99","score":"0.6453584","text":"@Override\r\n\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\n\t\tsuper.doPost(req, resp);\r\n\t}","title":""},{"docid":"dac34781d6c5dbddce97d08d1d3e7c99","score":"0.6453584","text":"@Override\r\n\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\n\t\tsuper.doPost(req, resp);\r\n\t}","title":""},{"docid":"dac34781d6c5dbddce97d08d1d3e7c99","score":"0.6453584","text":"@Override\r\n\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\n\t\tsuper.doPost(req, resp);\r\n\t}","title":""},{"docid":"dac34781d6c5dbddce97d08d1d3e7c99","score":"0.6453584","text":"@Override\r\n\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\n\t\tsuper.doPost(req, resp);\r\n\t}","title":""},{"docid":"038eeb6b4f161b0458d3f7c94f3d90a7","score":"0.6438884","text":"public void doPost(HttpServletRequest request, HttpServletResponse response)\n\t\t\tthrows ServletException, IOException {\n\t\t\n\t}","title":""},{"docid":"cee296d08743936acb94a3ad0cf8cdea","score":"0.6437031","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n \n }","title":""},{"docid":"cee296d08743936acb94a3ad0cf8cdea","score":"0.6437031","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n \n }","title":""},{"docid":"c74456693c4ab889a9546e2fbfb4e1df","score":"0.6433175","text":"protected void doPost(HttpServletRequest request,\r\n\t\t\tHttpServletResponse response) throws ServletException, IOException {\n\t}","title":""},{"docid":"46ed5b49f691b4a4d1ff0aaf7cf9bec7","score":"0.6419544","text":"@Override\n\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\n\t\tsuper.doPost(req, resp);\n\t}","title":""},{"docid":"46ed5b49f691b4a4d1ff0aaf7cf9bec7","score":"0.6419544","text":"@Override\n\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\n\t\tsuper.doPost(req, resp);\n\t}","title":""},{"docid":"46ed5b49f691b4a4d1ff0aaf7cf9bec7","score":"0.6419544","text":"@Override\n\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\n\t\tsuper.doPost(req, resp);\n\t}","title":""},{"docid":"dd22f7e92443148811ce86625a6d9a17","score":"0.641335","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n }","title":""},{"docid":"dd22f7e92443148811ce86625a6d9a17","score":"0.641335","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n }","title":""},{"docid":"335ccd6bf49781ce7783d4966f0b466f","score":"0.6409106","text":"@Override\r\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\r\n throws ServletException, IOException {\r\n \r\n \r\n }","title":""},{"docid":"7dbb1788945fa69e70f61af503d6958c","score":"0.6403473","text":"public void doPost(HttpServletRequest request, HttpServletResponse response)\r\n\t\t\tthrows ServletException, IOException {\r\n\t}","title":""},{"docid":"901b607d3bd07a91b0d79e66b3fd5181","score":"0.6399753","text":"@Override\r\n\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException \r\n\t{\n\t\tsuper.doPost(req, resp);\r\n\t}","title":""},{"docid":"64188dfd583ef2ada467b4753333dd3a","score":"0.63778377","text":"public void doPost(HttpServletRequest request, HttpServletResponse response) throws IOException {\n generateResponse(request, response);\n }","title":""},{"docid":"fbfa9587b95cdbfee621b80c606ab32c","score":"0.63758326","text":"public void doPost(HttpServletRequest request, HttpServletResponse response)\n\t\t\tthrows ServletException, IOException {\n\t}","title":""},{"docid":"ab4ab48c3fc472b78da5b8f3bca00874","score":"0.63666916","text":"@Override\r\n\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\n\r\n\t}","title":""},{"docid":"d2b0259e8eb253bc46dec828eb18d044","score":"0.6364525","text":"@Override\r\n\tpublic int getHttpMethod() {\n\t\treturn Method.POST;\r\n\t}","title":""},{"docid":"59ae833d7e7416680c4f6ab432bece51","score":"0.6356407","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n\n }","title":""},{"docid":"d725ea93a308cd619ff09d490b3fccab","score":"0.63543916","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\n \n \n }","title":""},{"docid":"4c8ba28815cdf216fc623126e5fb4094","score":"0.63538176","text":"@Override\n public void checkedDoPost(HttpServletRequest req, HttpServletResponse resp)\n throws ServletException, IOException {\n\n }","title":""},{"docid":"8ef5fec919e114bc72478d40bfdb4113","score":"0.63310295","text":"public Response POST() throws IOException {\n\t\tURLConnection connection = null;\n\t\ttry {\n\t\t\tconnection = connect();\n\t\t\tsetRequestMethod(connection, \"POST\");\n\t\t\tconnection.setDoOutput(true);\n\t\t\tconnection.setUseCaches(false);\n\t\t\tapplyRequestProperties(connection);\n\t\t\taddBody(connection);\n\t\t\tResponse response = Response.parse(connection);\n\t\t\treturn response;\n\t\t} catch (IOException e) {\n\t\t\tthrow e;\n\t\t} finally {\n\t\t\tdisconnect(connection);\n\t\t}\n\t}","title":""},{"docid":"4051f43be894c62d1687e690d207d4fe","score":"0.6300909","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n \n\n }","title":""},{"docid":"119430eb111ccfff5400bdb533f1070d","score":"0.6289261","text":"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\n\t}","title":""},{"docid":"119430eb111ccfff5400bdb533f1070d","score":"0.6289261","text":"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\n\t}","title":""},{"docid":"119430eb111ccfff5400bdb533f1070d","score":"0.6289261","text":"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\n\t}","title":""},{"docid":"119430eb111ccfff5400bdb533f1070d","score":"0.6289261","text":"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\n\t}","title":""},{"docid":"119430eb111ccfff5400bdb533f1070d","score":"0.6289261","text":"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\n\t}","title":""},{"docid":"119430eb111ccfff5400bdb533f1070d","score":"0.6289261","text":"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\n\t}","title":""},{"docid":"119430eb111ccfff5400bdb533f1070d","score":"0.6289261","text":"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\n\t}","title":""},{"docid":"119430eb111ccfff5400bdb533f1070d","score":"0.6289261","text":"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\n\t}","title":""},{"docid":"6a8c9425c0e130f3a8ea50286460bb13","score":"0.62870914","text":"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\n\n\t}","title":""},{"docid":"61316eef448886ba20cfa74e26bc8c7e","score":"0.62687194","text":"@Override\n\tpublic void postHandle(HttpServletRequest request,\n\t\t\tHttpServletResponse response, Object handler,\n\t\t\tModelAndView modelAndView) throws Exception {\n\n\t}","title":""},{"docid":"5c64354fb132340cb9ca5b49135122d7","score":"0.6217897","text":"@Override\r\n\tpublic void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\r\n\t\t\tModelAndView modelAndView) throws Exception {\n\t\t\r\n\t}","title":""},{"docid":"35b2e88d36e8d572dba583b2db6b7400","score":"0.6216915","text":"@Override\n protected void processPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\n }","title":""},{"docid":"acf68a4ec9343e8df26de6730ef16f45","score":"0.6204782","text":"@Override\n public int getHttpType() {\n return Request.Method.POST;\n }","title":""},{"docid":"d31e9298ce6cca09fea921204c8a5a43","score":"0.62019205","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n \n processRequest(request, response);\n \n }","title":""},{"docid":"f08490ed03a199914cf9a62045102c53","score":"0.6198361","text":"abstract PostResponse executePost(String url, List<String[]> postParams) throws IOException;","title":""},{"docid":"a6bb379480f36316b9b993f10750c725","score":"0.61927575","text":"private static void post() {\n\t\tClient client = ClientBuilder.newBuilder().build();\n\n\t\tWebTarget target = client.target(\"http://localhost:8080/sample-app/echo/post\");\n\t\tfinal Builder request = target.request();\n\t\tfinal Response response = request.post(Entity.entity(\"Scott\", MediaType.TEXT_PLAIN_TYPE ));\n\n\t\tEchoMessage em = response.readEntity(EchoMessage.class);\n\t\tSystem.out.println(\"response from post:\\n\\t\" + em);\n\t\tresponse.close();\n\t}","title":""},{"docid":"0c0973e05093fcef3be5d678bd272ac7","score":"0.617968","text":"protected void doServicePost(HttpServletRequest req,\n\t\t\tHttpServletResponse resp) throws ServletException, IOException,\n\t\t\tServiceException {\n\t\tPrintWriter out = resp.getWriter();\n\t\tout.print(\"I POST you :)\");\n\t}","title":""},{"docid":"793119cd497e4d8c20260aa271d565a7","score":"0.61790967","text":"public void doPost (HttpServletRequest request, HttpServletResponse response) throws IOException\n\t{\n\t\t// Perform same action as get method\n\t\tdoGet(request, response);\n\t}","title":""},{"docid":"c523df16b4b6849614103d45a7c1c48e","score":"0.61782616","text":"@Override\r\n\tpublic void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\r\n\t\t\tModelAndView modelAndView) throws Exception {\n\r\n\t}","title":""},{"docid":"ed88c84754fbbe07cb8a49239865c20a","score":"0.61704135","text":"protected void doPost( HttpServletRequest request,\n HttpServletResponse response)\n throws ServletException, IOException {\n process( request, response );\n }","title":""},{"docid":"da63fccedc99715e6d3a8be3d8e3d73b","score":"0.6157372","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException\n , IOException {\n processRequest(request, response);\n }","title":""},{"docid":"3b3a5b09770324751ba6839c11d7a54a","score":"0.6150264","text":"public void doPost(HttpServletRequest request,\r\n HttpServletResponse response)\r\n throws ServletException, IOException\r\n {\r\n\t \r\n\t doService(request, response); \r\n\t \r\n }","title":""},{"docid":"2cbed6cadae1f00bc8fbeaedf9252dbc","score":"0.6147714","text":"public void doPost(HttpServletRequest request, HttpServletResponse response) {\n\t\tdoGet(request, response);\n\t}","title":""},{"docid":"7ebf910f82d7e4f8e63a44068326b230","score":"0.61469334","text":"public boolean doPost(PostModel post);","title":""},{"docid":"85c60ad345e4fea0ff3629020cb9143e","score":"0.6139552","text":"protected void doPost(HttpServletRequest request, HttpServletResponse response)\r\n throws ServletException, java.io.IOException {\r\n processRequest(request, response);\r\n \r\n }","title":""},{"docid":"63db9efdf379a3337acc4cdab7755f28","score":"0.61375105","text":"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\n\t\t// TODO Auto-generated method stub\n\t}","title":""},{"docid":"16a8284ea77d524e9e3b2773fd1d3ca6","score":"0.61348385","text":"@Override\r\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\r\n throws ServletException, IOException {\r\n // processRequest(request, response);\r\n }","title":""},{"docid":"95485e8d7e79e44f6c11a46789418e2d","score":"0.61308676","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"95485e8d7e79e44f6c11a46789418e2d","score":"0.61308676","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"95485e8d7e79e44f6c11a46789418e2d","score":"0.61308676","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"be94ce9f2730c7da46402ee992ab35b3","score":"0.611571","text":"@Override\n public void postHandle(\n HttpServletRequest request, HttpServletResponse response, Object handler, ModelAndView modelAndView)\n throws Exception {\n }","title":""},{"docid":"1fac2ca46f04694adc9b13924fa21dc2","score":"0.6113763","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n \n }","title":""},{"docid":"0d60e56d30805cd3335fa7e9ee869c3a","score":"0.61126125","text":"@Override\n\tpublic void postHandle(HttpServletRequest request,\n HttpServletResponse response, Object handler,\n ModelAndView modelAndView)\n\t\t\tthrows Exception {\n\t\t\n\t}","title":""},{"docid":"73da9289a85b4dd4febd166a5c00a984","score":"0.611121","text":"@Override\n\tpublic void doPost(String path, HttpServletRequest request,\n\t\t\tHttpServletResponse response) throws Exception {\n\t\t// TODO Auto-generated method stub\n\t\tString orderId = request.getParameter(\"orderId\");\n\t\tSystem.out.println(\"new WS \"+orderId);\n\t\t\n\t\t\n\t\t// Calling Stored Procedure ecom_order_post3\n\t\tfinal List parameters = new ArrayList();\n\t\tparameters.add(orderId);\n\t final String procedureName = \"idsd_dc_post1\";System.out.println(\"procedure \"+orderId);\n\t try {\n\t\t CallStoredProcedure.getInstance().call(procedureName, parameters, null, true, false);\n\t\t \tSystem.out.println(\"Procedure called successfully for the PO \"+orderId);\n\t } catch (Exception e3) {\n\t\t\te3.printStackTrace();\n\t\t}\n\t final String res = \"received\";\n\t\t// write to the response\n\t\tresponse.setContentType(\"text/html\");\n\t\tresponse.setCharacterEncoding(\"utf-8\");\n\t\tfinal Writer w = response.getWriter();\n\t\tw.write(res);\n\t\tw.close();\n\t}","title":""},{"docid":"e7c3d2167cdbfddeded746fc4e1d0453","score":"0.61019367","text":"@Override\n\tpublic void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\n\t\t\tModelAndView modelAndView) throws Exception {\n\t}","title":""},{"docid":"53d43a013a590667e47f8878aa9d7698","score":"0.60986763","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n \n processRequest(request, response);\n }","title":""},{"docid":"ec8b7217a7ea7570a6349c1a80bc5c1d","score":"0.6097553","text":"@Override\n\tpublic void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\n\t\t\tModelAndView modelAndView) throws Exception {\n\t\t\n\t}","title":""},{"docid":"ec8b7217a7ea7570a6349c1a80bc5c1d","score":"0.6097553","text":"@Override\n\tpublic void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\n\t\t\tModelAndView modelAndView) throws Exception {\n\t\t\n\t}","title":""},{"docid":"45c0cc8f7f9f6f0f05a33cf307d35b92","score":"0.60973674","text":"@Override\n\tpublic void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\n\t\t\tModelAndView modelAndView) throws Exception {\n\n\t}","title":""},{"docid":"45c0cc8f7f9f6f0f05a33cf307d35b92","score":"0.60973674","text":"@Override\n\tpublic void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\n\t\t\tModelAndView modelAndView) throws Exception {\n\n\t}","title":""},{"docid":"45c0cc8f7f9f6f0f05a33cf307d35b92","score":"0.60973674","text":"@Override\n\tpublic void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\n\t\t\tModelAndView modelAndView) throws Exception {\n\n\t}","title":""},{"docid":"45c0cc8f7f9f6f0f05a33cf307d35b92","score":"0.60973674","text":"@Override\n\tpublic void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\n\t\t\tModelAndView modelAndView) throws Exception {\n\n\t}","title":""},{"docid":"c80ba9499ec01079592c2ff1b6bcbe02","score":"0.60963386","text":"@Override\n protected void doPost\n (HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a481cfddbb562e1d83e0aba4c11fbcc5","score":"0.6090176","text":"protected void doPost( HttpServletRequest request, HttpServletResponse response )\n throws ServletException, IOException {\n \n\t\tprocessRequest( request, response );\n }","title":""},{"docid":"9d8a6ab5be71e3efdfbeb4b5781fd775","score":"0.6089922","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"8359c75cf2b168eea7891062007c141e","score":"0.6085909","text":"@Override\n public void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\n ModelAndView modelAndView) throws Exception {\n\n }","title":""},{"docid":"2d789e3092d92e7fa6d71b18087b47fc","score":"0.6084683","text":"public void doPost (HttpServletRequest req, HttpServletResponse res) throws IOException {\n \tdoGet (req, res);\n }","title":""},{"docid":"12c5b7fae4f928144543046528502fac","score":"0.6079923","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n // processRequest(request, response);\n }","title":""},{"docid":"3a748e9ae33c4f34d75c2c6e31cd5325","score":"0.60790914","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n\n }","title":""},{"docid":"610c56fdfeb2173a073cbfa0eeefd1af","score":"0.60779023","text":"protected void doPost(HttpServletRequest request, \n HttpServletResponse response)\n throws ServletException, IOException\n {\n processRequest(request, response);\n }","title":""},{"docid":"b4e3bbbd21a0824348312caa6c6bf152","score":"0.6066315","text":"public void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\n ModelAndView modelAndView) throws Exception {\n \n }","title":""},{"docid":"a24088f49b1215451c587a254c519f9d","score":"0.6061478","text":"public void execPost() {\n\t\texecGet();\n\t}","title":""},{"docid":"0d08751a34c14352462a2f72d96da228","score":"0.60543543","text":"protected void doPost(HttpServletRequest request, HttpServletResponse response)\r\n throws ServletException, IOException {\r\n processRequest(request, response);\r\n }","title":""},{"docid":"0d08751a34c14352462a2f72d96da228","score":"0.60543543","text":"protected void doPost(HttpServletRequest request, HttpServletResponse response)\r\n throws ServletException, IOException {\r\n processRequest(request, response);\r\n }","title":""}],"string":"[\n {\n \"docid\": \"9d82bd438ca885e91ee42f441f6a67c0\",\n \"score\": \"0.73963165\",\n \"text\": \"@Override\\n\\tpublic void doPost(Request request, Response response) {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e0c4bf9984bc451fe093fb1141f9960\",\n \"score\": \"0.7392475\",\n \"text\": \"@Override\\n\\tpublic void doPost(HttpServletRequest request,\\n\\t\\t\\tHttpServletResponse response) {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa0a4e6113c48e69e694b8276b2df75d\",\n \"score\": \"0.7276118\",\n \"text\": \"public void post();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"74a1d39844f5b754acc70bd7450dc4c3\",\n \"score\": \"0.69006836\",\n \"text\": \"@Override\\n\\tprotected Method getMethod() {\\n\\t\\treturn Method.POST;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"642e06de032be2a42df6cae66b584bd1\",\n \"score\": \"0.6672056\",\n \"text\": \"@Override\\n\\tpublic void post() {\\n\\t\\tRestAssured.post(this.config.domain+this.config.path).\\n\\t\\tthen().\\n\\t\\t\\tstatusCode(405);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e7009b13b90e5ab2a40ea95227a085f\",\n \"score\": \"0.6666394\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\\n log.debug(\\\"Post method\\\");\\n process(req, resp);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48df90c4c28d036e55a40b91d3afe9cc\",\n \"score\": \"0.66319716\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response) {\\n processGetRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04b3be29df82bc0728f643a8f81a8628\",\n \"score\": \"0.66038\",\n \"text\": \"@Override\\n\\t\\tprotected void doPost(HttpServletRequest request, HttpServletResponse response)\\n\\t\\t\\t\\tthrows ServletException, IOException {\\n\\t\\t\\tsuper.doPost(request, response);\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04b3be29df82bc0728f643a8f81a8628\",\n \"score\": \"0.66038\",\n \"text\": \"@Override\\n\\t\\tprotected void doPost(HttpServletRequest request, HttpServletResponse response)\\n\\t\\t\\t\\tthrows ServletException, IOException {\\n\\t\\t\\tsuper.doPost(request, response);\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b878d55dac7a93ea3b26fd4782bbf24\",\n \"score\": \"0.65904385\",\n \"text\": \"public void doPost() {\\n\\t\\t\\n\\t\\tRestClient restClient = new RestClient(url);\\n\\t\\tRequestView request = new RequestView();\\n\\t\\trequest.setKey1(\\\"foo\\\");\\n\\t\\trequest.setKey2(\\\"bar\\\");\\n\\t\\tResponseView response = restClient.post(request, ResponseView.class);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86247b5b89d39537b5c3299d14e9f444\",\n \"score\": \"0.6590143\",\n \"text\": \"public void postHandle(HttpServletRequest request, HttpServletResponse response) throws Exception {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f40b6cf0a2e2767a683b14ddf07499f1\",\n \"score\": \"0.6561377\",\n \"text\": \"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37339971bf2b0019d1c66db1068226d4\",\n \"score\": \"0.65408474\",\n \"text\": \"@Override\\n\\tpublic void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6563ac4d9c91fb470ad53250b53f0567\",\n \"score\": \"0.6527252\",\n \"text\": \"@Override\\n\\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp)\\n\\t\\t\\tthrows ServletException, IOException {\\n\\t\\tsuper.doPost(req, resp);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e90bf965cfd387f30c166261e7a4d604\",\n \"score\": \"0.6526384\",\n \"text\": \"@Override\\n public void postHandle(WebRequest request, ModelMap model) throws Exception {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4531e701d0b4153ce5bb28debb13f94b\",\n \"score\": \"0.65190226\",\n \"text\": \"public void doPost(HttpServletRequest request, HttpServletResponse response)\\r\\n\\t\\t\\tthrows ServletException, IOException {\\r\\n\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d77964080d3f2a26741bf1b92e7517e\",\n \"score\": \"0.64845836\",\n \"text\": \"public void doPost(HttpServletRequest request, HttpServletResponse response)\\n\\tthrows ServletException, IOException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55edde437763cec2bc18f7e3522f01e2\",\n \"score\": \"0.64827436\",\n \"text\": \"@Override\\r\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\r\\n throws ServletException, IOException {\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55edde437763cec2bc18f7e3522f01e2\",\n \"score\": \"0.64827436\",\n \"text\": \"@Override\\r\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\r\\n throws ServletException, IOException {\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55edde437763cec2bc18f7e3522f01e2\",\n \"score\": \"0.64827436\",\n \"text\": \"@Override\\r\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\r\\n throws ServletException, IOException {\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"20fdf0305affa3ce4e79ebf49413aa51\",\n \"score\": \"0.6474492\",\n \"text\": \"public abstract String post(HaDasReq type, HaJsonHttpParams params,\\n\\t\\t\\tHaHandler handler) throws Exception;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dac34781d6c5dbddce97d08d1d3e7c99\",\n \"score\": \"0.6453584\",\n \"text\": \"@Override\\r\\n\\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\\n\\t\\tsuper.doPost(req, resp);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dac34781d6c5dbddce97d08d1d3e7c99\",\n \"score\": \"0.6453584\",\n \"text\": \"@Override\\r\\n\\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\\n\\t\\tsuper.doPost(req, resp);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dac34781d6c5dbddce97d08d1d3e7c99\",\n \"score\": \"0.6453584\",\n \"text\": \"@Override\\r\\n\\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\\n\\t\\tsuper.doPost(req, resp);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dac34781d6c5dbddce97d08d1d3e7c99\",\n \"score\": \"0.6453584\",\n \"text\": \"@Override\\r\\n\\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\\n\\t\\tsuper.doPost(req, resp);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dac34781d6c5dbddce97d08d1d3e7c99\",\n \"score\": \"0.6453584\",\n \"text\": \"@Override\\r\\n\\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\\n\\t\\tsuper.doPost(req, resp);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"038eeb6b4f161b0458d3f7c94f3d90a7\",\n \"score\": \"0.6438884\",\n \"text\": \"public void doPost(HttpServletRequest request, HttpServletResponse response)\\n\\t\\t\\tthrows ServletException, IOException {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cee296d08743936acb94a3ad0cf8cdea\",\n \"score\": \"0.6437031\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cee296d08743936acb94a3ad0cf8cdea\",\n \"score\": \"0.6437031\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c74456693c4ab889a9546e2fbfb4e1df\",\n \"score\": \"0.6433175\",\n \"text\": \"protected void doPost(HttpServletRequest request,\\r\\n\\t\\t\\tHttpServletResponse response) throws ServletException, IOException {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46ed5b49f691b4a4d1ff0aaf7cf9bec7\",\n \"score\": \"0.6419544\",\n \"text\": \"@Override\\n\\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\\n\\t\\tsuper.doPost(req, resp);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46ed5b49f691b4a4d1ff0aaf7cf9bec7\",\n \"score\": \"0.6419544\",\n \"text\": \"@Override\\n\\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\\n\\t\\tsuper.doPost(req, resp);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46ed5b49f691b4a4d1ff0aaf7cf9bec7\",\n \"score\": \"0.6419544\",\n \"text\": \"@Override\\n\\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\\n\\t\\tsuper.doPost(req, resp);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dd22f7e92443148811ce86625a6d9a17\",\n \"score\": \"0.641335\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dd22f7e92443148811ce86625a6d9a17\",\n \"score\": \"0.641335\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"335ccd6bf49781ce7783d4966f0b466f\",\n \"score\": \"0.6409106\",\n \"text\": \"@Override\\r\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\r\\n throws ServletException, IOException {\\r\\n \\r\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7dbb1788945fa69e70f61af503d6958c\",\n \"score\": \"0.6403473\",\n \"text\": \"public void doPost(HttpServletRequest request, HttpServletResponse response)\\r\\n\\t\\t\\tthrows ServletException, IOException {\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"901b607d3bd07a91b0d79e66b3fd5181\",\n \"score\": \"0.6399753\",\n \"text\": \"@Override\\r\\n\\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException \\r\\n\\t{\\n\\t\\tsuper.doPost(req, resp);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64188dfd583ef2ada467b4753333dd3a\",\n \"score\": \"0.63778377\",\n \"text\": \"public void doPost(HttpServletRequest request, HttpServletResponse response) throws IOException {\\n generateResponse(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fbfa9587b95cdbfee621b80c606ab32c\",\n \"score\": \"0.63758326\",\n \"text\": \"public void doPost(HttpServletRequest request, HttpServletResponse response)\\n\\t\\t\\tthrows ServletException, IOException {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab4ab48c3fc472b78da5b8f3bca00874\",\n \"score\": \"0.63666916\",\n \"text\": \"@Override\\r\\n\\tprotected void doPost(HttpServletRequest req, HttpServletResponse resp) throws ServletException, IOException {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2b0259e8eb253bc46dec828eb18d044\",\n \"score\": \"0.6364525\",\n \"text\": \"@Override\\r\\n\\tpublic int getHttpMethod() {\\n\\t\\treturn Method.POST;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"59ae833d7e7416680c4f6ab432bece51\",\n \"score\": \"0.6356407\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d725ea93a308cd619ff09d490b3fccab\",\n \"score\": \"0.63543916\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\\n \\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c8ba28815cdf216fc623126e5fb4094\",\n \"score\": \"0.63538176\",\n \"text\": \"@Override\\n public void checkedDoPost(HttpServletRequest req, HttpServletResponse resp)\\n throws ServletException, IOException {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ef5fec919e114bc72478d40bfdb4113\",\n \"score\": \"0.63310295\",\n \"text\": \"public Response POST() throws IOException {\\n\\t\\tURLConnection connection = null;\\n\\t\\ttry {\\n\\t\\t\\tconnection = connect();\\n\\t\\t\\tsetRequestMethod(connection, \\\"POST\\\");\\n\\t\\t\\tconnection.setDoOutput(true);\\n\\t\\t\\tconnection.setUseCaches(false);\\n\\t\\t\\tapplyRequestProperties(connection);\\n\\t\\t\\taddBody(connection);\\n\\t\\t\\tResponse response = Response.parse(connection);\\n\\t\\t\\treturn response;\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\tthrow e;\\n\\t\\t} finally {\\n\\t\\t\\tdisconnect(connection);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4051f43be894c62d1687e690d207d4fe\",\n \"score\": \"0.6300909\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n \\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"119430eb111ccfff5400bdb533f1070d\",\n \"score\": \"0.6289261\",\n \"text\": \"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"119430eb111ccfff5400bdb533f1070d\",\n \"score\": \"0.6289261\",\n \"text\": \"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"119430eb111ccfff5400bdb533f1070d\",\n \"score\": \"0.6289261\",\n \"text\": \"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"119430eb111ccfff5400bdb533f1070d\",\n \"score\": \"0.6289261\",\n \"text\": \"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"119430eb111ccfff5400bdb533f1070d\",\n \"score\": \"0.6289261\",\n \"text\": \"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"119430eb111ccfff5400bdb533f1070d\",\n \"score\": \"0.6289261\",\n \"text\": \"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"119430eb111ccfff5400bdb533f1070d\",\n \"score\": \"0.6289261\",\n \"text\": \"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"119430eb111ccfff5400bdb533f1070d\",\n \"score\": \"0.6289261\",\n \"text\": \"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a8c9425c0e130f3a8ea50286460bb13\",\n \"score\": \"0.62870914\",\n \"text\": \"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"61316eef448886ba20cfa74e26bc8c7e\",\n \"score\": \"0.62687194\",\n \"text\": \"@Override\\n\\tpublic void postHandle(HttpServletRequest request,\\n\\t\\t\\tHttpServletResponse response, Object handler,\\n\\t\\t\\tModelAndView modelAndView) throws Exception {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c64354fb132340cb9ca5b49135122d7\",\n \"score\": \"0.6217897\",\n \"text\": \"@Override\\r\\n\\tpublic void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\\r\\n\\t\\t\\tModelAndView modelAndView) throws Exception {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35b2e88d36e8d572dba583b2db6b7400\",\n \"score\": \"0.6216915\",\n \"text\": \"@Override\\n protected void processPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"acf68a4ec9343e8df26de6730ef16f45\",\n \"score\": \"0.6204782\",\n \"text\": \"@Override\\n public int getHttpType() {\\n return Request.Method.POST;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d31e9298ce6cca09fea921204c8a5a43\",\n \"score\": \"0.62019205\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n \\n processRequest(request, response);\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f08490ed03a199914cf9a62045102c53\",\n \"score\": \"0.6198361\",\n \"text\": \"abstract PostResponse executePost(String url, List<String[]> postParams) throws IOException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6bb379480f36316b9b993f10750c725\",\n \"score\": \"0.61927575\",\n \"text\": \"private static void post() {\\n\\t\\tClient client = ClientBuilder.newBuilder().build();\\n\\n\\t\\tWebTarget target = client.target(\\\"http://localhost:8080/sample-app/echo/post\\\");\\n\\t\\tfinal Builder request = target.request();\\n\\t\\tfinal Response response = request.post(Entity.entity(\\\"Scott\\\", MediaType.TEXT_PLAIN_TYPE ));\\n\\n\\t\\tEchoMessage em = response.readEntity(EchoMessage.class);\\n\\t\\tSystem.out.println(\\\"response from post:\\\\n\\\\t\\\" + em);\\n\\t\\tresponse.close();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c0973e05093fcef3be5d678bd272ac7\",\n \"score\": \"0.617968\",\n \"text\": \"protected void doServicePost(HttpServletRequest req,\\n\\t\\t\\tHttpServletResponse resp) throws ServletException, IOException,\\n\\t\\t\\tServiceException {\\n\\t\\tPrintWriter out = resp.getWriter();\\n\\t\\tout.print(\\\"I POST you :)\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"793119cd497e4d8c20260aa271d565a7\",\n \"score\": \"0.61790967\",\n \"text\": \"public void doPost (HttpServletRequest request, HttpServletResponse response) throws IOException\\n\\t{\\n\\t\\t// Perform same action as get method\\n\\t\\tdoGet(request, response);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c523df16b4b6849614103d45a7c1c48e\",\n \"score\": \"0.61782616\",\n \"text\": \"@Override\\r\\n\\tpublic void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\\r\\n\\t\\t\\tModelAndView modelAndView) throws Exception {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed88c84754fbbe07cb8a49239865c20a\",\n \"score\": \"0.61704135\",\n \"text\": \"protected void doPost( HttpServletRequest request,\\n HttpServletResponse response)\\n throws ServletException, IOException {\\n process( request, response );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da63fccedc99715e6d3a8be3d8e3d73b\",\n \"score\": \"0.6157372\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException\\n , IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b3a5b09770324751ba6839c11d7a54a\",\n \"score\": \"0.6150264\",\n \"text\": \"public void doPost(HttpServletRequest request,\\r\\n HttpServletResponse response)\\r\\n throws ServletException, IOException\\r\\n {\\r\\n\\t \\r\\n\\t doService(request, response); \\r\\n\\t \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2cbed6cadae1f00bc8fbeaedf9252dbc\",\n \"score\": \"0.6147714\",\n \"text\": \"public void doPost(HttpServletRequest request, HttpServletResponse response) {\\n\\t\\tdoGet(request, response);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ebf910f82d7e4f8e63a44068326b230\",\n \"score\": \"0.61469334\",\n \"text\": \"public boolean doPost(PostModel post);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"85c60ad345e4fea0ff3629020cb9143e\",\n \"score\": \"0.6139552\",\n \"text\": \"protected void doPost(HttpServletRequest request, HttpServletResponse response)\\r\\n throws ServletException, java.io.IOException {\\r\\n processRequest(request, response);\\r\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63db9efdf379a3337acc4cdab7755f28\",\n \"score\": \"0.61375105\",\n \"text\": \"protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\\n\\t\\t// TODO Auto-generated method stub\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16a8284ea77d524e9e3b2773fd1d3ca6\",\n \"score\": \"0.61348385\",\n \"text\": \"@Override\\r\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\r\\n throws ServletException, IOException {\\r\\n // processRequest(request, response);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95485e8d7e79e44f6c11a46789418e2d\",\n \"score\": \"0.61308676\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95485e8d7e79e44f6c11a46789418e2d\",\n \"score\": \"0.61308676\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95485e8d7e79e44f6c11a46789418e2d\",\n \"score\": \"0.61308676\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be94ce9f2730c7da46402ee992ab35b3\",\n \"score\": \"0.611571\",\n \"text\": \"@Override\\n public void postHandle(\\n HttpServletRequest request, HttpServletResponse response, Object handler, ModelAndView modelAndView)\\n throws Exception {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1fac2ca46f04694adc9b13924fa21dc2\",\n \"score\": \"0.6113763\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d60e56d30805cd3335fa7e9ee869c3a\",\n \"score\": \"0.61126125\",\n \"text\": \"@Override\\n\\tpublic void postHandle(HttpServletRequest request,\\n HttpServletResponse response, Object handler,\\n ModelAndView modelAndView)\\n\\t\\t\\tthrows Exception {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73da9289a85b4dd4febd166a5c00a984\",\n \"score\": \"0.611121\",\n \"text\": \"@Override\\n\\tpublic void doPost(String path, HttpServletRequest request,\\n\\t\\t\\tHttpServletResponse response) throws Exception {\\n\\t\\t// TODO Auto-generated method stub\\n\\t\\tString orderId = request.getParameter(\\\"orderId\\\");\\n\\t\\tSystem.out.println(\\\"new WS \\\"+orderId);\\n\\t\\t\\n\\t\\t\\n\\t\\t// Calling Stored Procedure ecom_order_post3\\n\\t\\tfinal List parameters = new ArrayList();\\n\\t\\tparameters.add(orderId);\\n\\t final String procedureName = \\\"idsd_dc_post1\\\";System.out.println(\\\"procedure \\\"+orderId);\\n\\t try {\\n\\t\\t CallStoredProcedure.getInstance().call(procedureName, parameters, null, true, false);\\n\\t\\t \\tSystem.out.println(\\\"Procedure called successfully for the PO \\\"+orderId);\\n\\t } catch (Exception e3) {\\n\\t\\t\\te3.printStackTrace();\\n\\t\\t}\\n\\t final String res = \\\"received\\\";\\n\\t\\t// write to the response\\n\\t\\tresponse.setContentType(\\\"text/html\\\");\\n\\t\\tresponse.setCharacterEncoding(\\\"utf-8\\\");\\n\\t\\tfinal Writer w = response.getWriter();\\n\\t\\tw.write(res);\\n\\t\\tw.close();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e7c3d2167cdbfddeded746fc4e1d0453\",\n \"score\": \"0.61019367\",\n \"text\": \"@Override\\n\\tpublic void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\\n\\t\\t\\tModelAndView modelAndView) throws Exception {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"53d43a013a590667e47f8878aa9d7698\",\n \"score\": \"0.60986763\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n \\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec8b7217a7ea7570a6349c1a80bc5c1d\",\n \"score\": \"0.6097553\",\n \"text\": \"@Override\\n\\tpublic void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\\n\\t\\t\\tModelAndView modelAndView) throws Exception {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec8b7217a7ea7570a6349c1a80bc5c1d\",\n \"score\": \"0.6097553\",\n \"text\": \"@Override\\n\\tpublic void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\\n\\t\\t\\tModelAndView modelAndView) throws Exception {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"45c0cc8f7f9f6f0f05a33cf307d35b92\",\n \"score\": \"0.60973674\",\n \"text\": \"@Override\\n\\tpublic void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\\n\\t\\t\\tModelAndView modelAndView) throws Exception {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"45c0cc8f7f9f6f0f05a33cf307d35b92\",\n \"score\": \"0.60973674\",\n \"text\": \"@Override\\n\\tpublic void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\\n\\t\\t\\tModelAndView modelAndView) throws Exception {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"45c0cc8f7f9f6f0f05a33cf307d35b92\",\n \"score\": \"0.60973674\",\n \"text\": \"@Override\\n\\tpublic void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\\n\\t\\t\\tModelAndView modelAndView) throws Exception {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"45c0cc8f7f9f6f0f05a33cf307d35b92\",\n \"score\": \"0.60973674\",\n \"text\": \"@Override\\n\\tpublic void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\\n\\t\\t\\tModelAndView modelAndView) throws Exception {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c80ba9499ec01079592c2ff1b6bcbe02\",\n \"score\": \"0.60963386\",\n \"text\": \"@Override\\n protected void doPost\\n (HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a481cfddbb562e1d83e0aba4c11fbcc5\",\n \"score\": \"0.6090176\",\n \"text\": \"protected void doPost( HttpServletRequest request, HttpServletResponse response )\\n throws ServletException, IOException {\\n \\n\\t\\tprocessRequest( request, response );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d8a6ab5be71e3efdfbeb4b5781fd775\",\n \"score\": \"0.6089922\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8359c75cf2b168eea7891062007c141e\",\n \"score\": \"0.6085909\",\n \"text\": \"@Override\\n public void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\\n ModelAndView modelAndView) throws Exception {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d789e3092d92e7fa6d71b18087b47fc\",\n \"score\": \"0.6084683\",\n \"text\": \"public void doPost (HttpServletRequest req, HttpServletResponse res) throws IOException {\\n \\tdoGet (req, res);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"12c5b7fae4f928144543046528502fac\",\n \"score\": \"0.6079923\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n // processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a748e9ae33c4f34d75c2c6e31cd5325\",\n \"score\": \"0.60790914\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"610c56fdfeb2173a073cbfa0eeefd1af\",\n \"score\": \"0.60779023\",\n \"text\": \"protected void doPost(HttpServletRequest request, \\n HttpServletResponse response)\\n throws ServletException, IOException\\n {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b4e3bbbd21a0824348312caa6c6bf152\",\n \"score\": \"0.6066315\",\n \"text\": \"public void postHandle(HttpServletRequest request, HttpServletResponse response, Object handler,\\n ModelAndView modelAndView) throws Exception {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a24088f49b1215451c587a254c519f9d\",\n \"score\": \"0.6061478\",\n \"text\": \"public void execPost() {\\n\\t\\texecGet();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d08751a34c14352462a2f72d96da228\",\n \"score\": \"0.60543543\",\n \"text\": \"protected void doPost(HttpServletRequest request, HttpServletResponse response)\\r\\n throws ServletException, IOException {\\r\\n processRequest(request, response);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d08751a34c14352462a2f72d96da228\",\n \"score\": \"0.60543543\",\n \"text\": \"protected void doPost(HttpServletRequest request, HttpServletResponse response)\\r\\n throws ServletException, IOException {\\r\\n processRequest(request, response);\\r\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983793,"cells":{"query_id":{"kind":"string","value":"125d2e0f6998136f45d366d90dbfe993"},"query":{"kind":"string","value":"This method handles POST requests. Create a new request and queues it for processing."},"positive_passages":{"kind":"list like","value":[{"docid":"ce125d5e2955d1336f337ea5e78ea1a2","score":"0.0","text":"@POST\n\t@Path(\"/add/{word}\")\n\t@Produces(MediaType.APPLICATION_JSON)\n\tpublic Map<String, Object> postAddRequest(@PathParam(\"word\") String word, String definition) throws InterruptedException;","title":""}],"string":"[\n {\n \"docid\": \"ce125d5e2955d1336f337ea5e78ea1a2\",\n \"score\": \"0.0\",\n \"text\": \"@POST\\n\\t@Path(\\\"/add/{word}\\\")\\n\\t@Produces(MediaType.APPLICATION_JSON)\\n\\tpublic Map<String, Object> postAddRequest(@PathParam(\\\"word\\\") String word, String definition) throws InterruptedException;\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"d608572a87b844dcafe05df04ce21656","score":"0.6647176","text":"public static void postRequest(Request req) {\n lazyInitialize();\n requestQueue.enqueue(req);\n }","title":""},{"docid":"280d7d1935ce3b3426889f556f2759b6","score":"0.64517665","text":"@Override\n public void postRequest(ThumbnailRequest request, Object item)\n {\n synchronized(mRequestHandles)\n {\n if(!mRequestHandles.containsKey(request))\n {\n Future<?> requestHandle = mWorkerPool.submit(new ThumbnailProcessJob(request,mDeviceId));\n mRequestHandles.put(request, requestHandle);\n }\n }\n }","title":""},{"docid":"65498fd0c44ab7f02f73e2018ca33680","score":"0.6351619","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response) {\n processPostRequest(request, response);\n }","title":""},{"docid":"48df90c4c28d036e55a40b91d3afe9cc","score":"0.63404644","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response) {\n processGetRequest(request, response);\n }","title":""},{"docid":"941340758c8b3fc38564ded1c6c19fa6","score":"0.63223","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response) throws IOException {\n doRequest(request, response);\n }","title":""},{"docid":"2f1f84fca26e1a63c7c966e5397532be","score":"0.62868875","text":"private void makePostRequest() {\n final JSONObject postParams = new JSONObject();\n try {\n postParams.put(\"data1\", \"Hello\");\n postParams.put(\"data2\", \"World\");\n } catch (JSONException e) {\n e.printStackTrace();\n }\n\n JsonObjectRequest postRequest = new JsonObjectRequest(Request.Method.POST, URL + \"push-app\", postParams,\n new Response.Listener<JSONObject>() {\n @Override\n public void onResponse(JSONObject response) {\n text.setText(response.toString());\n }\n }, new Response.ErrorListener() {\n @Override\n public void onErrorResponse(VolleyError error) {\n text.setText(\"Error getting data from server after push request.\");\n }\n }) {\n public byte[] getBody() {\n try {\n String stringifyParams = postParams.toString();\n return stringifyParams == null ? null : stringifyParams.getBytes(\"utf-8\");\n } catch (UnsupportedEncodingException uee) {\n return null;\n }\n }\n };\n queue.add(postRequest);\n }","title":""},{"docid":"5fb7c1bc5687924c16107bd9f53a377b","score":"0.6202149","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequestPOST(request, response);\n }","title":""},{"docid":"000755762c1bcef6fc1a33a5b2b90339","score":"0.61729795","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"55cd8d909830419ab32bfa156856d21b","score":"0.61724234","text":"@Override\n public void run() {\n String result = postData(mReqUrl, mReqData, mHandler);\n\n }","title":""},{"docid":"8797f43477f38a0c04973dea7cc72296","score":"0.6164559","text":"protected abstract JsonObject onPost(final HttpRequest request, final JsonObject body, final JsonObject parameters);","title":""},{"docid":"3839fca8740fd6d630e7b543334b5b08","score":"0.615134","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\n \tlog.debug(\"HTTP Verb: POST\");\n \t \n resourceHandler = createHandler(request, response);\n resourceHandler.handle(DAPResourceHandler.POST);\n }","title":""},{"docid":"c591d6bc82ac0eca69c18d4e2c669c13","score":"0.61458397","text":"public void onPost() {\r\n if (module != null) {\r\n Module t = module.floor();\r\n if (t != null) {\r\n Model m = t.getModel(Model.METHOD_POST, uri);\r\n if (m != null) {\r\n m.dispatch(uri, req, resp, method);\r\n return;\r\n }\r\n }\r\n }\r\n\r\n String uri = req.getRequestURI();\r\n while (uri.indexOf(\"//\") > -1) {\r\n uri = uri.replaceAll(\"//\", \"/\");\r\n }\r\n Model mo = new DefaultModel();\r\n mo.module = Module.load(0);\r\n mo.copy(this);\r\n mo.dispatch(uri, req, resp, method);\r\n\r\n }","title":""},{"docid":"aacec7a8cfc2e42f4dc7ddca5dbe3011","score":"0.6136828","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"53d43a013a590667e47f8878aa9d7698","score":"0.6098374","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n \n processRequest(request, response);\n }","title":""},{"docid":"aad9b0e55a8b06153fb84bb4f27d4520","score":"0.60748804","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"8279f667853ad99cb3872e9ddc06ef26","score":"0.607288","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"8279f667853ad99cb3872e9ddc06ef26","score":"0.607288","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"8279f667853ad99cb3872e9ddc06ef26","score":"0.607288","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"95485e8d7e79e44f6c11a46789418e2d","score":"0.60608685","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"95485e8d7e79e44f6c11a46789418e2d","score":"0.60608685","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"9d8a6ab5be71e3efdfbeb4b5781fd775","score":"0.6024657","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"40653abebcdabc73780de348bc23d98e","score":"0.60207266","text":"@Override\n protected HttpUriRequest createHttpRequest() throws LiveOperationException {\n final HttpPost request = new HttpPost(this.requestUri.toString());\n\n request.setEntity(this.entity);\n\n return request;\n }","title":""},{"docid":"e58e7b164b3b9df8f33db38099c25dec","score":"0.59992915","text":"@Override\r\n\tpublic void doPost(Request request, Response response) throws Exception {\n\t\tsuper.doPost(request, response);\r\n\t}","title":""},{"docid":"62d2863b7ab90e0fcb95e63af21c1335","score":"0.59901893","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException\n {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""},{"docid":"a4d6191746ad49b4def8ce5d514d3b1a","score":"0.5974749","text":"@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }","title":""}],"string":"[\n {\n \"docid\": \"d608572a87b844dcafe05df04ce21656\",\n \"score\": \"0.6647176\",\n \"text\": \"public static void postRequest(Request req) {\\n lazyInitialize();\\n requestQueue.enqueue(req);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"280d7d1935ce3b3426889f556f2759b6\",\n \"score\": \"0.64517665\",\n \"text\": \"@Override\\n public void postRequest(ThumbnailRequest request, Object item)\\n {\\n synchronized(mRequestHandles)\\n {\\n if(!mRequestHandles.containsKey(request))\\n {\\n Future<?> requestHandle = mWorkerPool.submit(new ThumbnailProcessJob(request,mDeviceId));\\n mRequestHandles.put(request, requestHandle);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65498fd0c44ab7f02f73e2018ca33680\",\n \"score\": \"0.6351619\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response) {\\n processPostRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48df90c4c28d036e55a40b91d3afe9cc\",\n \"score\": \"0.63404644\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response) {\\n processGetRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"941340758c8b3fc38564ded1c6c19fa6\",\n \"score\": \"0.63223\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response) throws IOException {\\n doRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f1f84fca26e1a63c7c966e5397532be\",\n \"score\": \"0.62868875\",\n \"text\": \"private void makePostRequest() {\\n final JSONObject postParams = new JSONObject();\\n try {\\n postParams.put(\\\"data1\\\", \\\"Hello\\\");\\n postParams.put(\\\"data2\\\", \\\"World\\\");\\n } catch (JSONException e) {\\n e.printStackTrace();\\n }\\n\\n JsonObjectRequest postRequest = new JsonObjectRequest(Request.Method.POST, URL + \\\"push-app\\\", postParams,\\n new Response.Listener<JSONObject>() {\\n @Override\\n public void onResponse(JSONObject response) {\\n text.setText(response.toString());\\n }\\n }, new Response.ErrorListener() {\\n @Override\\n public void onErrorResponse(VolleyError error) {\\n text.setText(\\\"Error getting data from server after push request.\\\");\\n }\\n }) {\\n public byte[] getBody() {\\n try {\\n String stringifyParams = postParams.toString();\\n return stringifyParams == null ? null : stringifyParams.getBytes(\\\"utf-8\\\");\\n } catch (UnsupportedEncodingException uee) {\\n return null;\\n }\\n }\\n };\\n queue.add(postRequest);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5fb7c1bc5687924c16107bd9f53a377b\",\n \"score\": \"0.6202149\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequestPOST(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"000755762c1bcef6fc1a33a5b2b90339\",\n \"score\": \"0.61729795\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55cd8d909830419ab32bfa156856d21b\",\n \"score\": \"0.61724234\",\n \"text\": \"@Override\\n public void run() {\\n String result = postData(mReqUrl, mReqData, mHandler);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8797f43477f38a0c04973dea7cc72296\",\n \"score\": \"0.6164559\",\n \"text\": \"protected abstract JsonObject onPost(final HttpRequest request, final JsonObject body, final JsonObject parameters);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3839fca8740fd6d630e7b543334b5b08\",\n \"score\": \"0.615134\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException {\\n \\tlog.debug(\\\"HTTP Verb: POST\\\");\\n \\t \\n resourceHandler = createHandler(request, response);\\n resourceHandler.handle(DAPResourceHandler.POST);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c591d6bc82ac0eca69c18d4e2c669c13\",\n \"score\": \"0.61458397\",\n \"text\": \"public void onPost() {\\r\\n if (module != null) {\\r\\n Module t = module.floor();\\r\\n if (t != null) {\\r\\n Model m = t.getModel(Model.METHOD_POST, uri);\\r\\n if (m != null) {\\r\\n m.dispatch(uri, req, resp, method);\\r\\n return;\\r\\n }\\r\\n }\\r\\n }\\r\\n\\r\\n String uri = req.getRequestURI();\\r\\n while (uri.indexOf(\\\"//\\\") > -1) {\\r\\n uri = uri.replaceAll(\\\"//\\\", \\\"/\\\");\\r\\n }\\r\\n Model mo = new DefaultModel();\\r\\n mo.module = Module.load(0);\\r\\n mo.copy(this);\\r\\n mo.dispatch(uri, req, resp, method);\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aacec7a8cfc2e42f4dc7ddca5dbe3011\",\n \"score\": \"0.6136828\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"53d43a013a590667e47f8878aa9d7698\",\n \"score\": \"0.6098374\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n \\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aad9b0e55a8b06153fb84bb4f27d4520\",\n \"score\": \"0.60748804\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8279f667853ad99cb3872e9ddc06ef26\",\n \"score\": \"0.607288\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8279f667853ad99cb3872e9ddc06ef26\",\n \"score\": \"0.607288\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8279f667853ad99cb3872e9ddc06ef26\",\n \"score\": \"0.607288\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95485e8d7e79e44f6c11a46789418e2d\",\n \"score\": \"0.60608685\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95485e8d7e79e44f6c11a46789418e2d\",\n \"score\": \"0.60608685\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d8a6ab5be71e3efdfbeb4b5781fd775\",\n \"score\": \"0.6024657\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40653abebcdabc73780de348bc23d98e\",\n \"score\": \"0.60207266\",\n \"text\": \"@Override\\n protected HttpUriRequest createHttpRequest() throws LiveOperationException {\\n final HttpPost request = new HttpPost(this.requestUri.toString());\\n\\n request.setEntity(this.entity);\\n\\n return request;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e58e7b164b3b9df8f33db38099c25dec\",\n \"score\": \"0.59992915\",\n \"text\": \"@Override\\r\\n\\tpublic void doPost(Request request, Response response) throws Exception {\\n\\t\\tsuper.doPost(request, response);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"62d2863b7ab90e0fcb95e63af21c1335\",\n \"score\": \"0.59901893\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException\\n {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d6191746ad49b4def8ce5d514d3b1a\",\n \"score\": \"0.5974749\",\n \"text\": \"@Override\\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n processRequest(request, response);\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983794,"cells":{"query_id":{"kind":"string","value":"74bb3ffc7f1f3082ebf3f02f57e3c868"},"query":{"kind":"string","value":"Setup the test environment."},"positive_passages":{"kind":"list like","value":[{"docid":"c5cb7f87c6d0f7d6dd2dffb0ae0f30ca","score":"0.0","text":"@Before\n public void setUp() throws Exception {\n MockitoAnnotations.initMocks(this);\n\n mWifiConfigStore =\n new WifiConfigStoreLegacy(\n mWifiNetworkHistory, mWifiSupplicantControl, mIpconfigStore);\n }","title":""}],"string":"[\n {\n \"docid\": \"c5cb7f87c6d0f7d6dd2dffb0ae0f30ca\",\n \"score\": \"0.0\",\n \"text\": \"@Before\\n public void setUp() throws Exception {\\n MockitoAnnotations.initMocks(this);\\n\\n mWifiConfigStore =\\n new WifiConfigStoreLegacy(\\n mWifiNetworkHistory, mWifiSupplicantControl, mIpconfigStore);\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"4d9aa912e200215d515caa9048fecb17","score":"0.7824294","text":"@Override\n protected void setupEnvironment(final TestDestinationEnv testEnv) {\n }","title":""},{"docid":"c1fbdbcd5bef06328e577899a3f03374","score":"0.74080944","text":"@Before\n\tpublic void setupTest() {\n\t\tregister = new TypeEnvironment();\n\t}","title":""},{"docid":"103adfde55c3a2079a271e331dbfa912","score":"0.7389861","text":"@BeforeClass\n public static void setup ()\n throws Exception {\n BaseTest.setup();\n }","title":""},{"docid":"451cea069883a3401f7d81740964ba99","score":"0.73688716","text":"@BeforeMethod\n\tpublic void setup() {\n\t\tstart();\n\t\tConfiguration.setProperties(\"TestBaidu\");\n\t}","title":""},{"docid":"f64f3b0dd1b7b6ff386c49fbc2d98ab4","score":"0.7327833","text":"@BeforeClass\n\tpublic static void setup() {\n\t\n\n\t}","title":""},{"docid":"241ced6b9ad6a10251c6f13e7a900c20","score":"0.72431386","text":"public void setUp() {\n }","title":""},{"docid":"31ba4da62c0b882a2ca8be17dceae769","score":"0.7230289","text":"@Before\n public void setup() throws Exception {\n\n /**\n * Prerequisites\n */\n\n }","title":""},{"docid":"36a88f097c1daffb61f9ac83b965b040","score":"0.72301865","text":"@BeforeClass\r\n\tpublic void setup() {\n\t\tdriver=BrowserFactory.startApplication(driver, config.getBrowser(),config.getStagingURL());\r\n\r\n\t}","title":""},{"docid":"daf81a08e612f8cf2ae03ff1c4a3eafd","score":"0.722648","text":"@BeforeClass\r\n public static void setup() throws TechnicalException, SettingException {\r\n persistenceFactory = new PersistenceFactory(\"testAgentSystem\");\r\n }","title":""},{"docid":"1166112973e76d88b1d9874081c79d52","score":"0.7212878","text":"public void setUp() {}","title":""},{"docid":"5ec77ee0e8d129633ce7365f1c444e4b","score":"0.7175038","text":"@BeforeEach\n\tpublic void setUp() throws Exception {\n\t\tfileSystem = Jimfs.newFileSystem(Configuration.unix());\n\n\t\tPath projectPath = fileSystem.getPath(\"/project\");\n\t\tFiles.createDirectory(projectPath);\n\n\t\t// Set up the environment\n\t\tenv = new Environment.Builder(fileSystem)\n\t\t\t\t.out(System.out)\n\t\t\t\t.err(System.err)\n\t\t\t\t.in(System.in)\n\t\t\t\t.userDir(rootPath)\n\t\t\t\t.editorCommand(\"dummyEditor\")\n\t\t\t\t.build();\n\t}","title":""},{"docid":"10d582640061cde829e3b711067badb3","score":"0.71710986","text":"@BeforeClass\n public static void setup() {\n\n }","title":""},{"docid":"0594211377b0d3ddb72067dbed7c13ba","score":"0.71639884","text":"protected void setUp() {\n\t}","title":""},{"docid":"63a60a05194d83e4fc019392c259ed45","score":"0.71619195","text":"protected void setUp() {\n }","title":""},{"docid":"63a60a05194d83e4fc019392c259ed45","score":"0.71619195","text":"protected void setUp() {\n }","title":""},{"docid":"63a60a05194d83e4fc019392c259ed45","score":"0.71619195","text":"protected void setUp() {\n }","title":""},{"docid":"fbf0adc08d7ab590f21365745633f8ac","score":"0.7160037","text":"@BeforeTest\n\tpublic void testSetup() {\n\n\t\ttry {\n\t\t\tdriver=\tlaunchBrowser();\n\t\t\tdriver.get(config.getProperty(\"baseURL\"));\n\t\t\thome = new HomePage(driver);\n\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}","title":""},{"docid":"37d09e96946aecc0dfbeec01366d4874","score":"0.7155423","text":"@Before\n\tpublic void setup() {\n\t}","title":""},{"docid":"37d09e96946aecc0dfbeec01366d4874","score":"0.7155423","text":"@Before\n\tpublic void setup() {\n\t}","title":""},{"docid":"7ae8617576eb95c4f7ab8c915f3b7c0c","score":"0.7142238","text":"@Before\r\n\tpublic void setup() {\r\n\t\t// The JSON fixtures and test class name will match, except the Test suffix\r\n\t\tString fixtureFolder = getClass().getSimpleName();\r\n\t\tfixtureFolder = fixtureFolder.substring(0, fixtureFolder.length() - 4);\r\n\t\tsetupCaller(port, fixtureFolder);\r\n\t}","title":""},{"docid":"55bfd4a63d7efe143bdbfa3e24bfdb60","score":"0.71351355","text":"public void setUp() {\r\n }","title":""},{"docid":"329a8bfe95c6922b61c904cc845d055f","score":"0.7089553","text":"@EventListener(ApplicationReadyEvent.class)\n\tpublic void setUp() {\n\t\t// check if testdata should be created or not\n\t\tif (!getConfig().isTestModeEnabled()) {\n\t\t\treturn;\n\t\t}\n\n\t\tstartupMockServer();\n\t}","title":""},{"docid":"1b7865d31fbc3aa1c7a07b95c30b1ab4","score":"0.708103","text":"public void setup() throws Exception {\n\t\tsugar().knowledgeBase.api.create();\n\t\t\n\t\t// Create a KB record with name as the TestName\n\t\tFieldSet kbData = new FieldSet();\n\t\tkbData.put(\"name\", testName);\n\t\tsugar().knowledgeBase.api.create(kbData);\n\t\t\n\t\t// Login as admin\n\t\tsugar().login();\n\n\t\t// Enable Knowledge Base module\n\t\tsugar().admin.enableModuleDisplayViaJs(sugar().knowledgeBase);\n\n\t\t// Logout as admin\n\t\tsugar().logout();\n\t}","title":""},{"docid":"572313a069546213eba69272710d8ae3","score":"0.70702416","text":"protected void setUp()\r\n {\r\n }","title":""},{"docid":"a9d1ecb8c605a405917c7adbfa9e8928","score":"0.7065383","text":"private void createEnvironment()\n {\n if(AbstractEnvironment.AUTO_START_SERVER)\n {\n try\n {\n this.create();\n }\n catch (EnvironmentException ex)\n {\n log.error(\"Error to create the test environment!\", ex);\n }\n }\n }","title":""},{"docid":"e42966842ed7f821293c69cf7de78206","score":"0.7061169","text":"private void setupEnvironment() {\n try {\n setupEntities();\n } catch (NoSuchMethodException\n | InvocationTargetException\n | IllegalAccessException\n | InstantiationException e1) {\n e1.printStackTrace();\n }\n }","title":""},{"docid":"14d646c1ac3063917dca32eb7d94ea1e","score":"0.7061036","text":"private static void setupTestEnv() {\n // during the tests we run with 100K prealloc in the logs.\n // on windows systems prealloc of 64M was seen to take ~15seconds\n // resulting in test failure (client timeout on first session).\n // set env and directly in order to handle static init/gc issues\n System.setProperty(\"zookeeper.preAllocSize\", \"100\");\n System.setProperty(\"zookeeper.4lw.commands.whitelist\", \"*\");\n FileTxnLog.setPreallocSize(100 * 1024);\n }","title":""},{"docid":"6c959794f066108b730b96a5fa7a2b18","score":"0.7060784","text":"protected void setUp() {\n\n\n\n\t\ttry {\n\n\n\n\t\t\tsession = new EPPSession();\n\n\t\t\tsession.setClientID(Environment.getProperty(\"EPP.Test.clientId\", \"ClientX\"));\n\t\t\tsession.setPassword(Environment.getProperty(\"EPP.Test.password\", \"foo-BAR2\"));\n\n\n\n\t\t}\n\n\t\tcatch (Exception e) {\n\n\n\n\t\t\te.printStackTrace();\n\n\t\t\tAssert.fail(\"Error initializing the session: \" + e);\n\n\t\t}\n\n\n\n\t\tinitSession();\n\n //System.out.println(\"out init\");\n\n\t\tnameWatch = new EPPNameWatch(session);\n\n\n\n\t}","title":""},{"docid":"d2b2874e415fcc7835cc738ade6813b4","score":"0.7038367","text":"public void setup() throws Exception {\n\t}","title":""},{"docid":"edd3241eb3f5031efc3f654a8f274b43","score":"0.7030592","text":"@Before\n\tpublic void Setup() {\n\t\t\n\t}","title":""},{"docid":"bb627e670c1e6106acebcf09fd945247","score":"0.7002263","text":"@Before\n\tpublic void setup() {\n\t\ttestTenant = new Tenant();\n\t\t\n\t\ttestTenant.setCompanyName(companyName);\n\t\ttestTenant.setBucketName(bucketName);\n\n//\t\ttestTenant.setTenantId(tenantId);\n\t\ttestTenant.setCreatedBy(createdBy);\n\t\ttestTenant.setCreatedDate(createdDate);\n\t\ttestTenant.setLastUpdatedBy(lastUpdatedBy);\n\t\ttestTenant.setLastUpdatedDate(lastUpdatedDate);\n\t\ttestTenant.setVersionNumber(versionNumber);\n\t\t\n\t\t// resets the sequences so that Ids should be consistent every time a test runs.\n\t\ttestUtil.resetSequences(\"docs\");\n\t\ttestUtil.resetSequences(\"doc_links\");\n\t\ttestUtil.resetSequences(\"tenants\");\n\t}","title":""},{"docid":"bc86bdfc83b301c5873fc1a09d5e6319","score":"0.69888765","text":"@BeforeClass\r\n\tpublic static void setup() throws Exception {\n\t\tLogging.configure();\r\n\r\n\t\tLogging.logger.info(\"In the setup() method.\");\r\n\t\tLogging.logger.info(\"A new test suite has started.\");\r\n\r\n\t\t// Opening browser using Selenium WebDriver\r\n\t\tdriver = ReusableComponents.openBrowser();\r\n\t\tLogging.logger.info(\"ChromeDriver has opened Amazon.\");\r\n\r\n\t}","title":""},{"docid":"44ec89f1c37a0f6bb3cb531d6f567ce7","score":"0.69884735","text":"@Test\n public void setup() throws Exception {\n\n if (sampleStoreFile.exists()) { //For testing start fresh\n sampleStoreFile.delete();\n }\n sampleStore = new SampleStore(sampleStoreFile);\n\n memoryAllocator();\n\n enrollUsersSetup(sampleStore); //This enrolls users with fabric ca and setups sample store to get users later.\n runFabricTest(sampleStore); //Runs Fabric tests with constructing channels, joining peers, exercising chaincode\n\n }","title":""},{"docid":"a34a3a53af555a737d12d15802662e2e","score":"0.69663656","text":"static void setUp()\n\t{\n\t\tglobals.ppu.setUp();\n\t\tglobals.sa1.setUp();\n\t\tglobals.memory.setUp();\n\t\tglobals.apu.setUp();\n\t\tglobals.sounddata.setUp();\n\t\tglobals.cpu.setUp();\n\t\tglobals.dma.setUp();\n\t\tglobals.gamedisplay.setUp();\n\t\tglobals.cpuexecutor.setUp();\n\t\tglobals.rtc.setUp();\n\t\tglobals.controls.setUp();\n\t}","title":""},{"docid":"c16a5598eecbbae86bc6b6a7a4b90861","score":"0.69624054","text":"@Before\n public void setup() {\n LOGGER.info(\"Started the application\");\n }","title":""},{"docid":"fa62c8377ce7075aa146373ae9bda764","score":"0.6956651","text":"@BeforeClass\n public static void setup() {\n ViralSimulationData.init(new ViralSimulation(new InputLayer(false)));\n }","title":""},{"docid":"8da9bb3a5a9c4ddd363799595826735c","score":"0.69555765","text":"@Before\n public void setup() throws Exception {\n File baseDir = new File(GeonamesHarvesterTest.class.getResource(\"/\")\n .toURI());\n System.setProperty(\"test.dir\", baseDir.getAbsolutePath());\n\n ram = PluginManager.getStorage(\"ram\");\n ram.init(\"{}\");\n }","title":""},{"docid":"4f89c85c39831102dd6e82a9ec0e07d6","score":"0.69453436","text":"@Before\n public void setup() throws Exception {\n\n /*\n * As class can only have a single @RunWith annotation, we cannot use both:\n * @RunWith(SpringJUnit4ClassRunner.class)\n * and\n * @RunWith(JUnitParamsRunner.class)\n *\n * To ensure Spring Context load we need to manually do what the spring runner would do for us ...\n */\n this.testContextManager = new TestContextManager(getClass());\n this.testContextManager.prepareTestInstance(this);\n\n documentum.setCredentials(new UserCredentials(repositoryUsername, repositoryPassword));\n documentum.setDocBase(repositoryName);\n }","title":""},{"docid":"b2b9725a935b3ebedcd9301c7a64008d","score":"0.6923262","text":"@BeforeClass\n\tpublic void setup() {\n\t\ttry {\n\n\t\t\tString rootPath = System.getProperty(\"user.dir\") + \"/src/test/resources/config/\";\n\n\t\t\tPropertyConfigurator.configure(rootPath + \"log4j.properties\");\n\t\t\tlogger = Logger.getLogger(TestSetup.class);// added Logger\n\t\t\tlogger.setLevel(Level.DEBUG);\n\t\t\tprop.load(new FileInputStream(new File(rootPath + \"config.properties\")));\n\n\t\t\turl = prop.getProperty(\"url\");\n\t\t\tinfo = prop.getProperty(\"info\");\n\t\t\tlogger.info(\"===================================\");\n\t\t\tlogger.info(\"Info --- \" + info);\n\t\t\tlogger.info(\"===================================\");\n\n\t\t\tRestAssured.baseURI = url;\n\n\t\t} catch (FileNotFoundException f) {\n\t\t\tlogger.error(\"Error: \" + f);\n\t\t} catch (IOException io) {\n\t\t\tlogger.error(\"Error: \" + io);\n\t\t}\n\t}","title":""},{"docid":"7bc8fc397ac164ab1fd66531a68f45de","score":"0.69175804","text":"@BeforeClass\n public static void setupClass() throws Exception {\n\n // instantiate properties\n properties = ConfigUtility.getConfigProperties();\n\n // instantiate required services\n projectService = new ProjectClientRest(properties);\n contentService = new ContentClientRest(properties);\n securityService = new SecurityClientRest(properties);\n\n // test run.config.ts has viewer user\n testUser = properties.getProperty(\"viewer.user\");\n testPassword = properties.getProperty(\"viewer.password\");\n\n // test run.config.ts has admin user\n adminUser = properties.getProperty(\"admin.user\");\n adminPassword = properties.getProperty(\"admin.password\");\n\n if (testUser == null || testUser.isEmpty()) {\n throw new Exception(\"Test prerequisite: viewer.user must be specified\");\n }\n if (testPassword == null || testPassword.isEmpty()) {\n throw new Exception(\n \"Test prerequisite: viewer.password must be specified\");\n }\n if (adminUser == null || adminUser.isEmpty()) {\n throw new Exception(\"Test prerequisite: admin.user must be specified\");\n }\n if (adminPassword == null || adminPassword.isEmpty()) {\n throw new Exception(\"Test prerequisite: admin.password must be specified\");\n }\n\n }","title":""},{"docid":"8262b0505083ac041f390c9000f329ff","score":"0.69140935","text":"@Before\n\t\tpublic void prepare() {\n\t\t\ttester = new WebTester();\n\t\t\ttester.setBaseUrl(\"http://localhost:8080/CC/\");\n\t\t}","title":""},{"docid":"74032b4a0fdd424df8d1ada9600a3c30","score":"0.69135237","text":"protected void setup() {\n \n }","title":""},{"docid":"6e5a42af321ae1bbe8d84d7c5e7651ef","score":"0.6913393","text":"public void setUp() throws Exception {\n }","title":""},{"docid":"08cce5d17aa3ac836c89decd544446fc","score":"0.690887","text":"@BeforeClass\n public static void setUp() {\n debugSettings = DebugSettings.getInstance();\n }","title":""},{"docid":"abe1f712e80e0b069110597794937e53","score":"0.69085985","text":"@BeforeAll\r\n public void setUp(){\n engineSystem = new EngineSystem();\r\n }","title":""},{"docid":"905ea5f12fd211f1a77e67208bf0b695","score":"0.68952686","text":"protected void setUp() throws Exception\n {\n\t// ...\n }","title":""},{"docid":"a2b81dc1066ace947d07aaa5e8c30402","score":"0.6894303","text":"@BeforeClass\n public static void setBeforeClassSetUp() {\n\n }","title":""},{"docid":"0a15808c7844ec4cbd731981c2922a8d","score":"0.68909514","text":"@BeforeClass\r\n\tpublic static void setupClass() {\r\n\r\n\t}","title":""},{"docid":"816a5b0ebd8db9ba96bd0d2f790f14ab","score":"0.68891865","text":"@BeforeClass\r\n\tpublic static void setup() throws Exception {\n\t\tPropertyConfigurator.configure(\"log4j.properties.unittest\");\r\n\r\n\t\t// Setup the output directory so the test won't fail if it was deleted.\r\n\t\tProblemRunner.checkDirs(\"testOutput\");\r\n\r\n\t\t// Now setup the multiplexer problem\r\n\t\tmux = new Multiplexer();\r\n\t\tconfig = new Config(\"src/test/resources/multiplexer.properties\");\r\n\t\tcontext = new Context(config);\r\n\t\tmux.init(context);\r\n\r\n\t\t// Make sure config points to the test output directory\r\n\t\tconfig.setOutputDir(\"testOutput\");\r\n\r\n\t\t// Setup the GPs\r\n\t\tgp = new GP(context);\r\n\t\tlayeredGP = new LayeredGP(context);\r\n\t\tparetoGP = new ParetoGP(context);\r\n\t}","title":""},{"docid":"5f57d668819e4f942cee54f35f3aeb62","score":"0.68697065","text":"protected void setUp() throws Exception {\r\n\r\n }","title":""},{"docid":"35d59be6670f9842a50493f7eefd0c4c","score":"0.68665683","text":"protected final void setUp() throws Exception\n {\n watchdog = createWatchdog();\n watchdog.start();\n\n if (verbose)\n {\n System.out.println(StringMessageUtils.getBoilerPlate(\"Testing: \" + toString(), '=', 80));\n }\n\n MuleManager.getConfiguration().getDefaultThreadingProfile().setDoThreading(false);\n MuleManager.getConfiguration().setServerUrl(StringUtils.EMPTY);\n\n try\n {\n if (getTestInfo().getRunCount() == 0)\n {\n if (getTestInfo().isDisposeManagerPerSuite())\n {\n // We dispose here jut in case\n disposeManager();\n }\n suitePreSetUp();\n }\n if (!getTestInfo().isDisposeManagerPerSuite())\n {\n // We dispose here jut in case\n disposeManager();\n }\n doSetUp();\n if (getTestInfo().getRunCount() == 0)\n {\n suitePostSetUp();\n }\n }\n catch (Exception e)\n {\n getTestInfo().incRunCount();\n throw e;\n }\n }","title":""},{"docid":"6742d33b09579d23271be995997c9607","score":"0.68649125","text":"@Override\n\tprotected void setUp() {\n\t}","title":""},{"docid":"7f14a1dcb69ddc695a796390b00d7606","score":"0.686448","text":"void setUp();","title":""},{"docid":"6833fa96c6e4093c496482c262df7a65","score":"0.6862389","text":"@BeforeClass\n\tpublic void setUpClass() {\n\t\ttest = new TestSessionInitiator(System.getProperty(\"datafile\", \"MTX_smoke_qaf_testData.yml\"));\n\t\ttest.launchApplication();\n\t}","title":""},{"docid":"39660b65364153ab97f6f157a9c710b6","score":"0.6860343","text":"@Override\r\n public void setUp() throws Exception {\r\n super.setUp();\r\n ConfigHelper.initialConfigManager();\r\n }","title":""},{"docid":"aad96dfb80ca869e3d5a898e2eb1dc73","score":"0.68547004","text":"protected void setUp() throws java.lang.Exception {\r\n verbose(\"\\n================================================\");\r\n verbose(\"Test suite '\"+_test.getName()+\"': setting up test '\" + _name+\"'\");\r\n verbose(\"================================================\\n\");\r\n\r\n // Set up and run the source generator so we can test using the generated source\r\n _sourceGenerator.setXMLContext(getXMLContext());\r\n _sourceGenerator.setUp();\r\n _sourceGenerator.runTest();\r\n\r\n // Set up the root class\r\n _rootClass = _test.getClassLoader().loadClass(_rootClassName);\r\n }","title":""},{"docid":"23b123e35f49a6529afcd09d5dc668b9","score":"0.68493044","text":"public void setUp() throws Exception\r\n\t{\r\n\t}","title":""},{"docid":"4788f7ceaed8293708e2aeef727558fa","score":"0.6849127","text":"protected abstract void setUp();","title":""},{"docid":"2226b72e02b694d175941a2e1e740866","score":"0.6841809","text":"static void ensureSetup() {\n }","title":""},{"docid":"6ae2976e8235843f95b39cb7becfbe31","score":"0.68293756","text":"@Override\n\tprotected void setUp() throws Exception {\n\t\tsuper.setUp();\n\t}","title":""},{"docid":"d66a38e39b728c7981f9fe6bbdb618ee","score":"0.682805","text":"protected void setup(){}","title":""},{"docid":"fd9af18eeed56da9c8a12ddfddb8ff0f","score":"0.6816694","text":"protected void setUp()\n throws Exception\n {\n super.setUp();\n }","title":""},{"docid":"449f56194779e5a203b01bf07ef90cf7","score":"0.6814755","text":"@BeforeEach\n\tpublic final void setup() throws Exception {\n\t\tbs = new KjedetBSTre<>();\n\t}","title":""},{"docid":"f23703781afd07cb7ab99e441895046a","score":"0.68124944","text":"@Before\n\tpublic void setUp() {\n\t\thelper.setUp();\n\t\tDegreeModuleLogic\n\t\t\t\t.initDatastore(DegreeModuleLogic.getDummySessionInfo());\n\t}","title":""},{"docid":"a7a8cd7744ad53282bb62507b0dc9c58","score":"0.68114233","text":"@Before\n public void setUp() throws Exception {\n String resources = this.getClass().getResource(\"resources.xml\").getPath();\n String resourcesXSD = this.getClass().getResource(\"resources_schema.xsd\").getPath();\n String project = this.getClass().getResource(\"project.xml\").getPath();\n String projectXSD = this.getClass().getResource(\"project_schema.xsd\").getPath();\n System.setProperty(COMPSsConstants.LANG, COMPSsConstants.Lang.PYTHON.name());\n System.setProperty(COMPSsConstants.RES_FILE, resources);\n System.setProperty(COMPSsConstants.RES_SCHEMA, resourcesXSD);\n System.setProperty(COMPSsConstants.PROJ_FILE, project);\n System.setProperty(COMPSsConstants.PROJ_SCHEMA, projectXSD);\n\n this.rt = new COMPSsRuntimeImpl();\n this.rt.startIT();\n }","title":""},{"docid":"778074ea67b736b817c2f39ec63eb976","score":"0.6808364","text":"@Before\n\tpublic void setup() {\n\t\tMockitoAnnotations.initMocks(this);\n\t\tnew HeadlessLauncher().launch();\n\n\t\tgrid = new Grid(true);\n\t\tgrid.setTile(12, 2);\n\t\tgrid.setTile(13, 1);\n\t\tgrid.setDifficulty(Difficulty.HARD);\n\t\tTwentyFourtyGame.setState(RunningState.getInstance());\n\t}","title":""},{"docid":"a4d35b6a72d66c409c5eb146e2b53aa3","score":"0.68081886","text":"@BeforeClass\n public static void setUp() throws Exception {\n setUp(\"Testing Channel Setting parameters - View DNIS parameters\",\n \"Liliya Fedorova\", true);\n }","title":""},{"docid":"8605bfaf59515da51c953a82add9ae24","score":"0.6785244","text":"@BeforeClass\n public static void setup() {\n String port = System.getProperty(\"server.port\");\n if (port == null) {\n RestAssured.port = Integer.valueOf(8080);\n }\n else{\n RestAssured.port = Integer.valueOf(port);\n }\n\n\n String basePath = System.getProperty(\"server.base\");\n if(basePath==null){\n basePath = \"/api/Errors/4313\";\n }\n RestAssured.basePath = basePath;\n\n String baseHost = System.getProperty(\"server.host\");\n if(baseHost==null){\n baseHost = \"https://pe-dev-vh.mcoe.davita.com/api/swagger/docs/v1\";\n }\n RestAssured.baseURI = baseHost;\n\n }","title":""},{"docid":"e61ba2a3a660de9c0dcb4162f41bfb12","score":"0.67761004","text":"@BeforeClass\n public static void setup() {\n final Archive classes = Archive.archive()\n .add(Api.class)\n .add(Movie.class)\n .add(MovieStore.class)\n .add(MovieResource.class)\n .add(MovieAdminResource.class);\n\n // Place the classes where you would want\n // them in a Tomcat install\n final Server server = Server.builder()\n // This effectively creates a webapp called ROOT\n .add(\"webapps/ROOT/WEB-INF/classes\", classes)\n .add(\"webapps/ROOT/WEB-INF/web.xml\", new File(\"src/main/webapp/WEB-INF/web.xml\"))\n .add(\"conf/tomcat-users.xml\", new File(\"src/main/resources/conf/tomcat-users.xml\"))\n .build();\n\n serverURI = server.getURI();\n }","title":""},{"docid":"b48af97422b962512f8947755d8b1d9e","score":"0.6774632","text":"@BeforeClass\n\tpublic static void setup() throws Exception {\n\t\tString testDataDir = System.getProperty(\"test.data.dir\");\n\t\tif (testDataDir == null) {\n\t\t\tthrow new Exception(\"Please define the test.data.dir system property.\");\n\t\t}\n\t\t\n\t\ttestDir = new File(testDataDir);\n\t\tif (! (testDir.exists() && testDir.isDirectory())) {\n\t\t\tthrow new Exception(\"Invalid path to the test data directory: \" + testDataDir);\n\t\t}\n\t}","title":""},{"docid":"03cbdcc90983c0ee0016e301ef1d4967","score":"0.67737585","text":"protected void setUp() throws Exception\r\n\t{\r\n\t}","title":""},{"docid":"39225a58a1feb6b9a55b8665a1b210a0","score":"0.6760868","text":"@Before\r\n public void setUp() throws Exception {\r\n super.setUp();\r\n TestHelper.cleanupEnvironment();\r\n instance = new MockStudioOrSoftwareContestAction();\r\n instance.prepare();\r\n }","title":""},{"docid":"dee1a51ab9ab88176c6b5778ea4c04ae","score":"0.67524034","text":"@Before public void setUp() {\n }","title":""},{"docid":"dee1a51ab9ab88176c6b5778ea4c04ae","score":"0.67524034","text":"@Before public void setUp() {\n }","title":""},{"docid":"dee1a51ab9ab88176c6b5778ea4c04ae","score":"0.67524034","text":"@Before public void setUp() {\n }","title":""},{"docid":"dee1a51ab9ab88176c6b5778ea4c04ae","score":"0.67524034","text":"@Before public void setUp() {\n }","title":""},{"docid":"dee1a51ab9ab88176c6b5778ea4c04ae","score":"0.67524034","text":"@Before public void setUp() {\n }","title":""},{"docid":"dee1a51ab9ab88176c6b5778ea4c04ae","score":"0.67524034","text":"@Before public void setUp() {\n }","title":""},{"docid":"ec73e167dfbef52dc293e8342f2e75ec","score":"0.6751984","text":"@BeforeEach\n public void setup() {\n appUser = new AppUser();\n appUser.setEmail(\"m.b.spasov@student.tudelft.nl\");\n appUser.setPassword(\"1234\");\n role = new Role();\n appUsers = new HashSet<>();\n appUsers.add(appUser);\n role.setAppUsers(appUsers);\n role.setName(\"Manager\");\n roleSet = new HashSet<>();\n roleSet.add(role);\n appUser.setRoles(roleSet);\n }","title":""},{"docid":"531692add1ba8932cc9e64356f1fc0b2","score":"0.6751213","text":"public void Setup() {}","title":""},{"docid":"5166a37a72e22f267b3e6bee41d47e2c","score":"0.67501837","text":"@BeforeClass\n public static void oneTimeSetUp() {\n }","title":""},{"docid":"5166a37a72e22f267b3e6bee41d47e2c","score":"0.67501837","text":"@BeforeClass\n public static void oneTimeSetUp() {\n }","title":""},{"docid":"3b337b798ce1d8bc1fabe970c1c7b07a","score":"0.6739395","text":"@Override\n protected void setUp() throws Exception {\n super.setUp();\n }","title":""},{"docid":"b2484f210ea8209f4d1158fb09cb00b7","score":"0.67387176","text":"@BeforeClass\n\tpublic static void setup()\n\t{\n\t\t\n\t\ttry\n\t\t{\n\t\t\t// Test 5 step 10 must have this user configured\n\t\t\tMessage ohieCr05Step10 = CrMessageUtil.loadMessage(\"OHIE-CR-05-10\");\n\t\t\tMessage response = CrMessageUtil.sendMessage(ohieCr05Step10);\n\t\t\tTerser responseTerser = new Terser(response);\n\t\t\tCrMessageUtil.assertAccepted(responseTerser);\n\t\t\t\n\t\t}\n\t\tcatch(Exception e)\n\t\t{\n\t\t\te.printStackTrace();\n\t\t\t//log.error(e);\n\t\t\tfail();\n\t\t}\n\t\t\n\t}","title":""},{"docid":"13052495c42cc6db4811cf025775206a","score":"0.6737027","text":"protected void setup() {\n\t}","title":""},{"docid":"13052495c42cc6db4811cf025775206a","score":"0.6737027","text":"protected void setup() {\n\t}","title":""},{"docid":"09cdb02cd139f670a9da6db0e837fa1a","score":"0.67285806","text":"@BeforeClass\n public static void setup() {\n deleteProductSyncTestData(CTP_TARGET_CLIENT);\n productType = createProductType(PRODUCT_TYPE_RESOURCE_PATH, CTP_TARGET_CLIENT);\n }","title":""},{"docid":"21f1d38b7f390dcafbeef0a0c6bd1d15","score":"0.6719624","text":"@Before\n\tpublic void setUp() {\n\t}","title":""},{"docid":"21f1d38b7f390dcafbeef0a0c6bd1d15","score":"0.6719624","text":"@Before\n\tpublic void setUp() {\n\t}","title":""},{"docid":"21f1d38b7f390dcafbeef0a0c6bd1d15","score":"0.6719624","text":"@Before\n\tpublic void setUp() {\n\t}","title":""},{"docid":"21f1d38b7f390dcafbeef0a0c6bd1d15","score":"0.6719624","text":"@Before\n\tpublic void setUp() {\n\t}","title":""},{"docid":"21f1d38b7f390dcafbeef0a0c6bd1d15","score":"0.6719624","text":"@Before\n\tpublic void setUp() {\n\t}","title":""},{"docid":"c69caa6b5ddf5da93a7c3939d6a625e6","score":"0.6718376","text":"@BeforeTest\r\n\tpublic void setUp() {\r\n\r\n\t\tstartBrowser();\r\n\t\t\r\n\t}","title":""},{"docid":"4b52727aea59506d1b379fc3446d510d","score":"0.67056745","text":"@BeforeAll\n public static void setUp() {\n System.setProperty(\"org.jooq.no-logo\", \"true\");\n System.setProperty(\"org.jooq.no-tips\", \"true\");\n\n // Set a default log level\n // System.setProperty(\"org.slf4j.simpleLogger.defaultLogLevel\", \"DEBUG\");\n\n BaseTest.config = Configuration.load();\n BaseTest.apiFactory = DSLContextAPIFactory.build(BaseTest.config);\n }","title":""},{"docid":"bdd4e51c83616cec5b7952ab085026c9","score":"0.6697608","text":"protected void setup() {\n\n }","title":""},{"docid":"5570f24ebca39a86b43938d363a9a296","score":"0.66922355","text":"@Before\r\n\tpublic void setUp() throws Exception {\r\n\t}","title":""},{"docid":"1b761c0500d09659d015092e39823e01","score":"0.6679402","text":"@BeforeClass\n public static void setUpBeforeClass() {\n ss = createTopology(NUM_SWITCH, NUM_PORTS, NUM_LINKS, NUM_HOSTS);\n }","title":""},{"docid":"0b63d0a7cb94543d2f444e312c4a5d95","score":"0.66784364","text":"@Before\n public void setup() {\n TestApplication.getApplication().setPlatform(UAirship.ANDROID_PLATFORM);\n }","title":""},{"docid":"ad6d236c78d02bb1372994718eb025c1","score":"0.66778255","text":"@Before \r\n\tpublic void setupTest() throws FileNotFoundException, IOException, FHIRException {\n\t\tTestingUtilities.fixedpath = \"//Users//oliveregger//fhir//trunk//build\";\r\n\t\tif (context == null)\r\n\t\t\t\tcontext = SimpleWorkerContext\r\n\t\t\t\t\t.fromPack(Utilities.path(TestingUtilities.home(), \"publish\", \"igpack.zip\"));\r\n\r\n\t\tTestingUtilities.context = new SimpleWorkerContext(context);\r\n\t\tfhirPathEngine = new FHIRPathEngine(TestingUtilities.context);\r\n\t\tstructureMapUtilites = new StructureMapUtilities(TestingUtilities.context, maps, mappingServices);\r\n\t}","title":""},{"docid":"9463bdf298b564a046543a1be698eecb","score":"0.6671788","text":"public static void testMultiEnvironment() {\n \n }","title":""},{"docid":"deeaa19988ae664858dccfffca47fd4a","score":"0.6670207","text":"@BeforeClass\n public static void setUp() {\n setUp(\n \"Add Terms and conditions in CsAdmin and verify new values in OpayWeb.\",\n \"Liliya Gafurova\", true);\n }","title":""}],"string":"[\n {\n \"docid\": \"4d9aa912e200215d515caa9048fecb17\",\n \"score\": \"0.7824294\",\n \"text\": \"@Override\\n protected void setupEnvironment(final TestDestinationEnv testEnv) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c1fbdbcd5bef06328e577899a3f03374\",\n \"score\": \"0.74080944\",\n \"text\": \"@Before\\n\\tpublic void setupTest() {\\n\\t\\tregister = new TypeEnvironment();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"103adfde55c3a2079a271e331dbfa912\",\n \"score\": \"0.7389861\",\n \"text\": \"@BeforeClass\\n public static void setup ()\\n throws Exception {\\n BaseTest.setup();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"451cea069883a3401f7d81740964ba99\",\n \"score\": \"0.73688716\",\n \"text\": \"@BeforeMethod\\n\\tpublic void setup() {\\n\\t\\tstart();\\n\\t\\tConfiguration.setProperties(\\\"TestBaidu\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f64f3b0dd1b7b6ff386c49fbc2d98ab4\",\n \"score\": \"0.7327833\",\n \"text\": \"@BeforeClass\\n\\tpublic static void setup() {\\n\\t\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"241ced6b9ad6a10251c6f13e7a900c20\",\n \"score\": \"0.72431386\",\n \"text\": \"public void setUp() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31ba4da62c0b882a2ca8be17dceae769\",\n \"score\": \"0.7230289\",\n \"text\": \"@Before\\n public void setup() throws Exception {\\n\\n /**\\n * Prerequisites\\n */\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36a88f097c1daffb61f9ac83b965b040\",\n \"score\": \"0.72301865\",\n \"text\": \"@BeforeClass\\r\\n\\tpublic void setup() {\\n\\t\\tdriver=BrowserFactory.startApplication(driver, config.getBrowser(),config.getStagingURL());\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"daf81a08e612f8cf2ae03ff1c4a3eafd\",\n \"score\": \"0.722648\",\n \"text\": \"@BeforeClass\\r\\n public static void setup() throws TechnicalException, SettingException {\\r\\n persistenceFactory = new PersistenceFactory(\\\"testAgentSystem\\\");\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1166112973e76d88b1d9874081c79d52\",\n \"score\": \"0.7212878\",\n \"text\": \"public void setUp() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ec77ee0e8d129633ce7365f1c444e4b\",\n \"score\": \"0.7175038\",\n \"text\": \"@BeforeEach\\n\\tpublic void setUp() throws Exception {\\n\\t\\tfileSystem = Jimfs.newFileSystem(Configuration.unix());\\n\\n\\t\\tPath projectPath = fileSystem.getPath(\\\"/project\\\");\\n\\t\\tFiles.createDirectory(projectPath);\\n\\n\\t\\t// Set up the environment\\n\\t\\tenv = new Environment.Builder(fileSystem)\\n\\t\\t\\t\\t.out(System.out)\\n\\t\\t\\t\\t.err(System.err)\\n\\t\\t\\t\\t.in(System.in)\\n\\t\\t\\t\\t.userDir(rootPath)\\n\\t\\t\\t\\t.editorCommand(\\\"dummyEditor\\\")\\n\\t\\t\\t\\t.build();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10d582640061cde829e3b711067badb3\",\n \"score\": \"0.71710986\",\n \"text\": \"@BeforeClass\\n public static void setup() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0594211377b0d3ddb72067dbed7c13ba\",\n \"score\": \"0.71639884\",\n \"text\": \"protected void setUp() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63a60a05194d83e4fc019392c259ed45\",\n \"score\": \"0.71619195\",\n \"text\": \"protected void setUp() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63a60a05194d83e4fc019392c259ed45\",\n \"score\": \"0.71619195\",\n \"text\": \"protected void setUp() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63a60a05194d83e4fc019392c259ed45\",\n \"score\": \"0.71619195\",\n \"text\": \"protected void setUp() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fbf0adc08d7ab590f21365745633f8ac\",\n \"score\": \"0.7160037\",\n \"text\": \"@BeforeTest\\n\\tpublic void testSetup() {\\n\\n\\t\\ttry {\\n\\t\\t\\tdriver=\\tlaunchBrowser();\\n\\t\\t\\tdriver.get(config.getProperty(\\\"baseURL\\\"));\\n\\t\\t\\thome = new HomePage(driver);\\n\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37d09e96946aecc0dfbeec01366d4874\",\n \"score\": \"0.7155423\",\n \"text\": \"@Before\\n\\tpublic void setup() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37d09e96946aecc0dfbeec01366d4874\",\n \"score\": \"0.7155423\",\n \"text\": \"@Before\\n\\tpublic void setup() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ae8617576eb95c4f7ab8c915f3b7c0c\",\n \"score\": \"0.7142238\",\n \"text\": \"@Before\\r\\n\\tpublic void setup() {\\r\\n\\t\\t// The JSON fixtures and test class name will match, except the Test suffix\\r\\n\\t\\tString fixtureFolder = getClass().getSimpleName();\\r\\n\\t\\tfixtureFolder = fixtureFolder.substring(0, fixtureFolder.length() - 4);\\r\\n\\t\\tsetupCaller(port, fixtureFolder);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55bfd4a63d7efe143bdbfa3e24bfdb60\",\n \"score\": \"0.71351355\",\n \"text\": \"public void setUp() {\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"329a8bfe95c6922b61c904cc845d055f\",\n \"score\": \"0.7089553\",\n \"text\": \"@EventListener(ApplicationReadyEvent.class)\\n\\tpublic void setUp() {\\n\\t\\t// check if testdata should be created or not\\n\\t\\tif (!getConfig().isTestModeEnabled()) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\tstartupMockServer();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b7865d31fbc3aa1c7a07b95c30b1ab4\",\n \"score\": \"0.708103\",\n \"text\": \"public void setup() throws Exception {\\n\\t\\tsugar().knowledgeBase.api.create();\\n\\t\\t\\n\\t\\t// Create a KB record with name as the TestName\\n\\t\\tFieldSet kbData = new FieldSet();\\n\\t\\tkbData.put(\\\"name\\\", testName);\\n\\t\\tsugar().knowledgeBase.api.create(kbData);\\n\\t\\t\\n\\t\\t// Login as admin\\n\\t\\tsugar().login();\\n\\n\\t\\t// Enable Knowledge Base module\\n\\t\\tsugar().admin.enableModuleDisplayViaJs(sugar().knowledgeBase);\\n\\n\\t\\t// Logout as admin\\n\\t\\tsugar().logout();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"572313a069546213eba69272710d8ae3\",\n \"score\": \"0.70702416\",\n \"text\": \"protected void setUp()\\r\\n {\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9d1ecb8c605a405917c7adbfa9e8928\",\n \"score\": \"0.7065383\",\n \"text\": \"private void createEnvironment()\\n {\\n if(AbstractEnvironment.AUTO_START_SERVER)\\n {\\n try\\n {\\n this.create();\\n }\\n catch (EnvironmentException ex)\\n {\\n log.error(\\\"Error to create the test environment!\\\", ex);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e42966842ed7f821293c69cf7de78206\",\n \"score\": \"0.7061169\",\n \"text\": \"private void setupEnvironment() {\\n try {\\n setupEntities();\\n } catch (NoSuchMethodException\\n | InvocationTargetException\\n | IllegalAccessException\\n | InstantiationException e1) {\\n e1.printStackTrace();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14d646c1ac3063917dca32eb7d94ea1e\",\n \"score\": \"0.7061036\",\n \"text\": \"private static void setupTestEnv() {\\n // during the tests we run with 100K prealloc in the logs.\\n // on windows systems prealloc of 64M was seen to take ~15seconds\\n // resulting in test failure (client timeout on first session).\\n // set env and directly in order to handle static init/gc issues\\n System.setProperty(\\\"zookeeper.preAllocSize\\\", \\\"100\\\");\\n System.setProperty(\\\"zookeeper.4lw.commands.whitelist\\\", \\\"*\\\");\\n FileTxnLog.setPreallocSize(100 * 1024);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c959794f066108b730b96a5fa7a2b18\",\n \"score\": \"0.7060784\",\n \"text\": \"protected void setUp() {\\n\\n\\n\\n\\t\\ttry {\\n\\n\\n\\n\\t\\t\\tsession = new EPPSession();\\n\\n\\t\\t\\tsession.setClientID(Environment.getProperty(\\\"EPP.Test.clientId\\\", \\\"ClientX\\\"));\\n\\t\\t\\tsession.setPassword(Environment.getProperty(\\\"EPP.Test.password\\\", \\\"foo-BAR2\\\"));\\n\\n\\n\\n\\t\\t}\\n\\n\\t\\tcatch (Exception e) {\\n\\n\\n\\n\\t\\t\\te.printStackTrace();\\n\\n\\t\\t\\tAssert.fail(\\\"Error initializing the session: \\\" + e);\\n\\n\\t\\t}\\n\\n\\n\\n\\t\\tinitSession();\\n\\n //System.out.println(\\\"out init\\\");\\n\\n\\t\\tnameWatch = new EPPNameWatch(session);\\n\\n\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2b2874e415fcc7835cc738ade6813b4\",\n \"score\": \"0.7038367\",\n \"text\": \"public void setup() throws Exception {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"edd3241eb3f5031efc3f654a8f274b43\",\n \"score\": \"0.7030592\",\n \"text\": \"@Before\\n\\tpublic void Setup() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb627e670c1e6106acebcf09fd945247\",\n \"score\": \"0.7002263\",\n \"text\": \"@Before\\n\\tpublic void setup() {\\n\\t\\ttestTenant = new Tenant();\\n\\t\\t\\n\\t\\ttestTenant.setCompanyName(companyName);\\n\\t\\ttestTenant.setBucketName(bucketName);\\n\\n//\\t\\ttestTenant.setTenantId(tenantId);\\n\\t\\ttestTenant.setCreatedBy(createdBy);\\n\\t\\ttestTenant.setCreatedDate(createdDate);\\n\\t\\ttestTenant.setLastUpdatedBy(lastUpdatedBy);\\n\\t\\ttestTenant.setLastUpdatedDate(lastUpdatedDate);\\n\\t\\ttestTenant.setVersionNumber(versionNumber);\\n\\t\\t\\n\\t\\t// resets the sequences so that Ids should be consistent every time a test runs.\\n\\t\\ttestUtil.resetSequences(\\\"docs\\\");\\n\\t\\ttestUtil.resetSequences(\\\"doc_links\\\");\\n\\t\\ttestUtil.resetSequences(\\\"tenants\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc86bdfc83b301c5873fc1a09d5e6319\",\n \"score\": \"0.69888765\",\n \"text\": \"@BeforeClass\\r\\n\\tpublic static void setup() throws Exception {\\n\\t\\tLogging.configure();\\r\\n\\r\\n\\t\\tLogging.logger.info(\\\"In the setup() method.\\\");\\r\\n\\t\\tLogging.logger.info(\\\"A new test suite has started.\\\");\\r\\n\\r\\n\\t\\t// Opening browser using Selenium WebDriver\\r\\n\\t\\tdriver = ReusableComponents.openBrowser();\\r\\n\\t\\tLogging.logger.info(\\\"ChromeDriver has opened Amazon.\\\");\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44ec89f1c37a0f6bb3cb531d6f567ce7\",\n \"score\": \"0.69884735\",\n \"text\": \"@Test\\n public void setup() throws Exception {\\n\\n if (sampleStoreFile.exists()) { //For testing start fresh\\n sampleStoreFile.delete();\\n }\\n sampleStore = new SampleStore(sampleStoreFile);\\n\\n memoryAllocator();\\n\\n enrollUsersSetup(sampleStore); //This enrolls users with fabric ca and setups sample store to get users later.\\n runFabricTest(sampleStore); //Runs Fabric tests with constructing channels, joining peers, exercising chaincode\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a34a3a53af555a737d12d15802662e2e\",\n \"score\": \"0.69663656\",\n \"text\": \"static void setUp()\\n\\t{\\n\\t\\tglobals.ppu.setUp();\\n\\t\\tglobals.sa1.setUp();\\n\\t\\tglobals.memory.setUp();\\n\\t\\tglobals.apu.setUp();\\n\\t\\tglobals.sounddata.setUp();\\n\\t\\tglobals.cpu.setUp();\\n\\t\\tglobals.dma.setUp();\\n\\t\\tglobals.gamedisplay.setUp();\\n\\t\\tglobals.cpuexecutor.setUp();\\n\\t\\tglobals.rtc.setUp();\\n\\t\\tglobals.controls.setUp();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c16a5598eecbbae86bc6b6a7a4b90861\",\n \"score\": \"0.69624054\",\n \"text\": \"@Before\\n public void setup() {\\n LOGGER.info(\\\"Started the application\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa62c8377ce7075aa146373ae9bda764\",\n \"score\": \"0.6956651\",\n \"text\": \"@BeforeClass\\n public static void setup() {\\n ViralSimulationData.init(new ViralSimulation(new InputLayer(false)));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8da9bb3a5a9c4ddd363799595826735c\",\n \"score\": \"0.69555765\",\n \"text\": \"@Before\\n public void setup() throws Exception {\\n File baseDir = new File(GeonamesHarvesterTest.class.getResource(\\\"/\\\")\\n .toURI());\\n System.setProperty(\\\"test.dir\\\", baseDir.getAbsolutePath());\\n\\n ram = PluginManager.getStorage(\\\"ram\\\");\\n ram.init(\\\"{}\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f89c85c39831102dd6e82a9ec0e07d6\",\n \"score\": \"0.69453436\",\n \"text\": \"@Before\\n public void setup() throws Exception {\\n\\n /*\\n * As class can only have a single @RunWith annotation, we cannot use both:\\n * @RunWith(SpringJUnit4ClassRunner.class)\\n * and\\n * @RunWith(JUnitParamsRunner.class)\\n *\\n * To ensure Spring Context load we need to manually do what the spring runner would do for us ...\\n */\\n this.testContextManager = new TestContextManager(getClass());\\n this.testContextManager.prepareTestInstance(this);\\n\\n documentum.setCredentials(new UserCredentials(repositoryUsername, repositoryPassword));\\n documentum.setDocBase(repositoryName);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2b9725a935b3ebedcd9301c7a64008d\",\n \"score\": \"0.6923262\",\n \"text\": \"@BeforeClass\\n\\tpublic void setup() {\\n\\t\\ttry {\\n\\n\\t\\t\\tString rootPath = System.getProperty(\\\"user.dir\\\") + \\\"/src/test/resources/config/\\\";\\n\\n\\t\\t\\tPropertyConfigurator.configure(rootPath + \\\"log4j.properties\\\");\\n\\t\\t\\tlogger = Logger.getLogger(TestSetup.class);// added Logger\\n\\t\\t\\tlogger.setLevel(Level.DEBUG);\\n\\t\\t\\tprop.load(new FileInputStream(new File(rootPath + \\\"config.properties\\\")));\\n\\n\\t\\t\\turl = prop.getProperty(\\\"url\\\");\\n\\t\\t\\tinfo = prop.getProperty(\\\"info\\\");\\n\\t\\t\\tlogger.info(\\\"===================================\\\");\\n\\t\\t\\tlogger.info(\\\"Info --- \\\" + info);\\n\\t\\t\\tlogger.info(\\\"===================================\\\");\\n\\n\\t\\t\\tRestAssured.baseURI = url;\\n\\n\\t\\t} catch (FileNotFoundException f) {\\n\\t\\t\\tlogger.error(\\\"Error: \\\" + f);\\n\\t\\t} catch (IOException io) {\\n\\t\\t\\tlogger.error(\\\"Error: \\\" + io);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7bc8fc397ac164ab1fd66531a68f45de\",\n \"score\": \"0.69175804\",\n \"text\": \"@BeforeClass\\n public static void setupClass() throws Exception {\\n\\n // instantiate properties\\n properties = ConfigUtility.getConfigProperties();\\n\\n // instantiate required services\\n projectService = new ProjectClientRest(properties);\\n contentService = new ContentClientRest(properties);\\n securityService = new SecurityClientRest(properties);\\n\\n // test run.config.ts has viewer user\\n testUser = properties.getProperty(\\\"viewer.user\\\");\\n testPassword = properties.getProperty(\\\"viewer.password\\\");\\n\\n // test run.config.ts has admin user\\n adminUser = properties.getProperty(\\\"admin.user\\\");\\n adminPassword = properties.getProperty(\\\"admin.password\\\");\\n\\n if (testUser == null || testUser.isEmpty()) {\\n throw new Exception(\\\"Test prerequisite: viewer.user must be specified\\\");\\n }\\n if (testPassword == null || testPassword.isEmpty()) {\\n throw new Exception(\\n \\\"Test prerequisite: viewer.password must be specified\\\");\\n }\\n if (adminUser == null || adminUser.isEmpty()) {\\n throw new Exception(\\\"Test prerequisite: admin.user must be specified\\\");\\n }\\n if (adminPassword == null || adminPassword.isEmpty()) {\\n throw new Exception(\\\"Test prerequisite: admin.password must be specified\\\");\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8262b0505083ac041f390c9000f329ff\",\n \"score\": \"0.69140935\",\n \"text\": \"@Before\\n\\t\\tpublic void prepare() {\\n\\t\\t\\ttester = new WebTester();\\n\\t\\t\\ttester.setBaseUrl(\\\"http://localhost:8080/CC/\\\");\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"74032b4a0fdd424df8d1ada9600a3c30\",\n \"score\": \"0.69135237\",\n \"text\": \"protected void setup() {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e5a42af321ae1bbe8d84d7c5e7651ef\",\n \"score\": \"0.6913393\",\n \"text\": \"public void setUp() throws Exception {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"08cce5d17aa3ac836c89decd544446fc\",\n \"score\": \"0.690887\",\n \"text\": \"@BeforeClass\\n public static void setUp() {\\n debugSettings = DebugSettings.getInstance();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"abe1f712e80e0b069110597794937e53\",\n \"score\": \"0.69085985\",\n \"text\": \"@BeforeAll\\r\\n public void setUp(){\\n engineSystem = new EngineSystem();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"905ea5f12fd211f1a77e67208bf0b695\",\n \"score\": \"0.68952686\",\n \"text\": \"protected void setUp() throws Exception\\n {\\n\\t// ...\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a2b81dc1066ace947d07aaa5e8c30402\",\n \"score\": \"0.6894303\",\n \"text\": \"@BeforeClass\\n public static void setBeforeClassSetUp() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a15808c7844ec4cbd731981c2922a8d\",\n \"score\": \"0.68909514\",\n \"text\": \"@BeforeClass\\r\\n\\tpublic static void setupClass() {\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"816a5b0ebd8db9ba96bd0d2f790f14ab\",\n \"score\": \"0.68891865\",\n \"text\": \"@BeforeClass\\r\\n\\tpublic static void setup() throws Exception {\\n\\t\\tPropertyConfigurator.configure(\\\"log4j.properties.unittest\\\");\\r\\n\\r\\n\\t\\t// Setup the output directory so the test won't fail if it was deleted.\\r\\n\\t\\tProblemRunner.checkDirs(\\\"testOutput\\\");\\r\\n\\r\\n\\t\\t// Now setup the multiplexer problem\\r\\n\\t\\tmux = new Multiplexer();\\r\\n\\t\\tconfig = new Config(\\\"src/test/resources/multiplexer.properties\\\");\\r\\n\\t\\tcontext = new Context(config);\\r\\n\\t\\tmux.init(context);\\r\\n\\r\\n\\t\\t// Make sure config points to the test output directory\\r\\n\\t\\tconfig.setOutputDir(\\\"testOutput\\\");\\r\\n\\r\\n\\t\\t// Setup the GPs\\r\\n\\t\\tgp = new GP(context);\\r\\n\\t\\tlayeredGP = new LayeredGP(context);\\r\\n\\t\\tparetoGP = new ParetoGP(context);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f57d668819e4f942cee54f35f3aeb62\",\n \"score\": \"0.68697065\",\n \"text\": \"protected void setUp() throws Exception {\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35d59be6670f9842a50493f7eefd0c4c\",\n \"score\": \"0.68665683\",\n \"text\": \"protected final void setUp() throws Exception\\n {\\n watchdog = createWatchdog();\\n watchdog.start();\\n\\n if (verbose)\\n {\\n System.out.println(StringMessageUtils.getBoilerPlate(\\\"Testing: \\\" + toString(), '=', 80));\\n }\\n\\n MuleManager.getConfiguration().getDefaultThreadingProfile().setDoThreading(false);\\n MuleManager.getConfiguration().setServerUrl(StringUtils.EMPTY);\\n\\n try\\n {\\n if (getTestInfo().getRunCount() == 0)\\n {\\n if (getTestInfo().isDisposeManagerPerSuite())\\n {\\n // We dispose here jut in case\\n disposeManager();\\n }\\n suitePreSetUp();\\n }\\n if (!getTestInfo().isDisposeManagerPerSuite())\\n {\\n // We dispose here jut in case\\n disposeManager();\\n }\\n doSetUp();\\n if (getTestInfo().getRunCount() == 0)\\n {\\n suitePostSetUp();\\n }\\n }\\n catch (Exception e)\\n {\\n getTestInfo().incRunCount();\\n throw e;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6742d33b09579d23271be995997c9607\",\n \"score\": \"0.68649125\",\n \"text\": \"@Override\\n\\tprotected void setUp() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f14a1dcb69ddc695a796390b00d7606\",\n \"score\": \"0.686448\",\n \"text\": \"void setUp();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6833fa96c6e4093c496482c262df7a65\",\n \"score\": \"0.6862389\",\n \"text\": \"@BeforeClass\\n\\tpublic void setUpClass() {\\n\\t\\ttest = new TestSessionInitiator(System.getProperty(\\\"datafile\\\", \\\"MTX_smoke_qaf_testData.yml\\\"));\\n\\t\\ttest.launchApplication();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39660b65364153ab97f6f157a9c710b6\",\n \"score\": \"0.6860343\",\n \"text\": \"@Override\\r\\n public void setUp() throws Exception {\\r\\n super.setUp();\\r\\n ConfigHelper.initialConfigManager();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aad96dfb80ca869e3d5a898e2eb1dc73\",\n \"score\": \"0.68547004\",\n \"text\": \"protected void setUp() throws java.lang.Exception {\\r\\n verbose(\\\"\\\\n================================================\\\");\\r\\n verbose(\\\"Test suite '\\\"+_test.getName()+\\\"': setting up test '\\\" + _name+\\\"'\\\");\\r\\n verbose(\\\"================================================\\\\n\\\");\\r\\n\\r\\n // Set up and run the source generator so we can test using the generated source\\r\\n _sourceGenerator.setXMLContext(getXMLContext());\\r\\n _sourceGenerator.setUp();\\r\\n _sourceGenerator.runTest();\\r\\n\\r\\n // Set up the root class\\r\\n _rootClass = _test.getClassLoader().loadClass(_rootClassName);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"23b123e35f49a6529afcd09d5dc668b9\",\n \"score\": \"0.68493044\",\n \"text\": \"public void setUp() throws Exception\\r\\n\\t{\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4788f7ceaed8293708e2aeef727558fa\",\n \"score\": \"0.6849127\",\n \"text\": \"protected abstract void setUp();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2226b72e02b694d175941a2e1e740866\",\n \"score\": \"0.6841809\",\n \"text\": \"static void ensureSetup() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ae2976e8235843f95b39cb7becfbe31\",\n \"score\": \"0.68293756\",\n \"text\": \"@Override\\n\\tprotected void setUp() throws Exception {\\n\\t\\tsuper.setUp();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d66a38e39b728c7981f9fe6bbdb618ee\",\n \"score\": \"0.682805\",\n \"text\": \"protected void setup(){}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd9af18eeed56da9c8a12ddfddb8ff0f\",\n \"score\": \"0.6816694\",\n \"text\": \"protected void setUp()\\n throws Exception\\n {\\n super.setUp();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"449f56194779e5a203b01bf07ef90cf7\",\n \"score\": \"0.6814755\",\n \"text\": \"@BeforeEach\\n\\tpublic final void setup() throws Exception {\\n\\t\\tbs = new KjedetBSTre<>();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f23703781afd07cb7ab99e441895046a\",\n \"score\": \"0.68124944\",\n \"text\": \"@Before\\n\\tpublic void setUp() {\\n\\t\\thelper.setUp();\\n\\t\\tDegreeModuleLogic\\n\\t\\t\\t\\t.initDatastore(DegreeModuleLogic.getDummySessionInfo());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7a8cd7744ad53282bb62507b0dc9c58\",\n \"score\": \"0.68114233\",\n \"text\": \"@Before\\n public void setUp() throws Exception {\\n String resources = this.getClass().getResource(\\\"resources.xml\\\").getPath();\\n String resourcesXSD = this.getClass().getResource(\\\"resources_schema.xsd\\\").getPath();\\n String project = this.getClass().getResource(\\\"project.xml\\\").getPath();\\n String projectXSD = this.getClass().getResource(\\\"project_schema.xsd\\\").getPath();\\n System.setProperty(COMPSsConstants.LANG, COMPSsConstants.Lang.PYTHON.name());\\n System.setProperty(COMPSsConstants.RES_FILE, resources);\\n System.setProperty(COMPSsConstants.RES_SCHEMA, resourcesXSD);\\n System.setProperty(COMPSsConstants.PROJ_FILE, project);\\n System.setProperty(COMPSsConstants.PROJ_SCHEMA, projectXSD);\\n\\n this.rt = new COMPSsRuntimeImpl();\\n this.rt.startIT();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"778074ea67b736b817c2f39ec63eb976\",\n \"score\": \"0.6808364\",\n \"text\": \"@Before\\n\\tpublic void setup() {\\n\\t\\tMockitoAnnotations.initMocks(this);\\n\\t\\tnew HeadlessLauncher().launch();\\n\\n\\t\\tgrid = new Grid(true);\\n\\t\\tgrid.setTile(12, 2);\\n\\t\\tgrid.setTile(13, 1);\\n\\t\\tgrid.setDifficulty(Difficulty.HARD);\\n\\t\\tTwentyFourtyGame.setState(RunningState.getInstance());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4d35b6a72d66c409c5eb146e2b53aa3\",\n \"score\": \"0.68081886\",\n \"text\": \"@BeforeClass\\n public static void setUp() throws Exception {\\n setUp(\\\"Testing Channel Setting parameters - View DNIS parameters\\\",\\n \\\"Liliya Fedorova\\\", true);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8605bfaf59515da51c953a82add9ae24\",\n \"score\": \"0.6785244\",\n \"text\": \"@BeforeClass\\n public static void setup() {\\n String port = System.getProperty(\\\"server.port\\\");\\n if (port == null) {\\n RestAssured.port = Integer.valueOf(8080);\\n }\\n else{\\n RestAssured.port = Integer.valueOf(port);\\n }\\n\\n\\n String basePath = System.getProperty(\\\"server.base\\\");\\n if(basePath==null){\\n basePath = \\\"/api/Errors/4313\\\";\\n }\\n RestAssured.basePath = basePath;\\n\\n String baseHost = System.getProperty(\\\"server.host\\\");\\n if(baseHost==null){\\n baseHost = \\\"https://pe-dev-vh.mcoe.davita.com/api/swagger/docs/v1\\\";\\n }\\n RestAssured.baseURI = baseHost;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e61ba2a3a660de9c0dcb4162f41bfb12\",\n \"score\": \"0.67761004\",\n \"text\": \"@BeforeClass\\n public static void setup() {\\n final Archive classes = Archive.archive()\\n .add(Api.class)\\n .add(Movie.class)\\n .add(MovieStore.class)\\n .add(MovieResource.class)\\n .add(MovieAdminResource.class);\\n\\n // Place the classes where you would want\\n // them in a Tomcat install\\n final Server server = Server.builder()\\n // This effectively creates a webapp called ROOT\\n .add(\\\"webapps/ROOT/WEB-INF/classes\\\", classes)\\n .add(\\\"webapps/ROOT/WEB-INF/web.xml\\\", new File(\\\"src/main/webapp/WEB-INF/web.xml\\\"))\\n .add(\\\"conf/tomcat-users.xml\\\", new File(\\\"src/main/resources/conf/tomcat-users.xml\\\"))\\n .build();\\n\\n serverURI = server.getURI();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b48af97422b962512f8947755d8b1d9e\",\n \"score\": \"0.6774632\",\n \"text\": \"@BeforeClass\\n\\tpublic static void setup() throws Exception {\\n\\t\\tString testDataDir = System.getProperty(\\\"test.data.dir\\\");\\n\\t\\tif (testDataDir == null) {\\n\\t\\t\\tthrow new Exception(\\\"Please define the test.data.dir system property.\\\");\\n\\t\\t}\\n\\t\\t\\n\\t\\ttestDir = new File(testDataDir);\\n\\t\\tif (! (testDir.exists() && testDir.isDirectory())) {\\n\\t\\t\\tthrow new Exception(\\\"Invalid path to the test data directory: \\\" + testDataDir);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03cbdcc90983c0ee0016e301ef1d4967\",\n \"score\": \"0.67737585\",\n \"text\": \"protected void setUp() throws Exception\\r\\n\\t{\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39225a58a1feb6b9a55b8665a1b210a0\",\n \"score\": \"0.6760868\",\n \"text\": \"@Before\\r\\n public void setUp() throws Exception {\\r\\n super.setUp();\\r\\n TestHelper.cleanupEnvironment();\\r\\n instance = new MockStudioOrSoftwareContestAction();\\r\\n instance.prepare();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dee1a51ab9ab88176c6b5778ea4c04ae\",\n \"score\": \"0.67524034\",\n \"text\": \"@Before public void setUp() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dee1a51ab9ab88176c6b5778ea4c04ae\",\n \"score\": \"0.67524034\",\n \"text\": \"@Before public void setUp() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dee1a51ab9ab88176c6b5778ea4c04ae\",\n \"score\": \"0.67524034\",\n \"text\": \"@Before public void setUp() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dee1a51ab9ab88176c6b5778ea4c04ae\",\n \"score\": \"0.67524034\",\n \"text\": \"@Before public void setUp() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dee1a51ab9ab88176c6b5778ea4c04ae\",\n \"score\": \"0.67524034\",\n \"text\": \"@Before public void setUp() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dee1a51ab9ab88176c6b5778ea4c04ae\",\n \"score\": \"0.67524034\",\n \"text\": \"@Before public void setUp() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec73e167dfbef52dc293e8342f2e75ec\",\n \"score\": \"0.6751984\",\n \"text\": \"@BeforeEach\\n public void setup() {\\n appUser = new AppUser();\\n appUser.setEmail(\\\"m.b.spasov@student.tudelft.nl\\\");\\n appUser.setPassword(\\\"1234\\\");\\n role = new Role();\\n appUsers = new HashSet<>();\\n appUsers.add(appUser);\\n role.setAppUsers(appUsers);\\n role.setName(\\\"Manager\\\");\\n roleSet = new HashSet<>();\\n roleSet.add(role);\\n appUser.setRoles(roleSet);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"531692add1ba8932cc9e64356f1fc0b2\",\n \"score\": \"0.6751213\",\n \"text\": \"public void Setup() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5166a37a72e22f267b3e6bee41d47e2c\",\n \"score\": \"0.67501837\",\n \"text\": \"@BeforeClass\\n public static void oneTimeSetUp() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5166a37a72e22f267b3e6bee41d47e2c\",\n \"score\": \"0.67501837\",\n \"text\": \"@BeforeClass\\n public static void oneTimeSetUp() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b337b798ce1d8bc1fabe970c1c7b07a\",\n \"score\": \"0.6739395\",\n \"text\": \"@Override\\n protected void setUp() throws Exception {\\n super.setUp();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2484f210ea8209f4d1158fb09cb00b7\",\n \"score\": \"0.67387176\",\n \"text\": \"@BeforeClass\\n\\tpublic static void setup()\\n\\t{\\n\\t\\t\\n\\t\\ttry\\n\\t\\t{\\n\\t\\t\\t// Test 5 step 10 must have this user configured\\n\\t\\t\\tMessage ohieCr05Step10 = CrMessageUtil.loadMessage(\\\"OHIE-CR-05-10\\\");\\n\\t\\t\\tMessage response = CrMessageUtil.sendMessage(ohieCr05Step10);\\n\\t\\t\\tTerser responseTerser = new Terser(response);\\n\\t\\t\\tCrMessageUtil.assertAccepted(responseTerser);\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\tcatch(Exception e)\\n\\t\\t{\\n\\t\\t\\te.printStackTrace();\\n\\t\\t\\t//log.error(e);\\n\\t\\t\\tfail();\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"13052495c42cc6db4811cf025775206a\",\n \"score\": \"0.6737027\",\n \"text\": \"protected void setup() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"13052495c42cc6db4811cf025775206a\",\n \"score\": \"0.6737027\",\n \"text\": \"protected void setup() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09cdb02cd139f670a9da6db0e837fa1a\",\n \"score\": \"0.67285806\",\n \"text\": \"@BeforeClass\\n public static void setup() {\\n deleteProductSyncTestData(CTP_TARGET_CLIENT);\\n productType = createProductType(PRODUCT_TYPE_RESOURCE_PATH, CTP_TARGET_CLIENT);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21f1d38b7f390dcafbeef0a0c6bd1d15\",\n \"score\": \"0.6719624\",\n \"text\": \"@Before\\n\\tpublic void setUp() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21f1d38b7f390dcafbeef0a0c6bd1d15\",\n \"score\": \"0.6719624\",\n \"text\": \"@Before\\n\\tpublic void setUp() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21f1d38b7f390dcafbeef0a0c6bd1d15\",\n \"score\": \"0.6719624\",\n \"text\": \"@Before\\n\\tpublic void setUp() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21f1d38b7f390dcafbeef0a0c6bd1d15\",\n \"score\": \"0.6719624\",\n \"text\": \"@Before\\n\\tpublic void setUp() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21f1d38b7f390dcafbeef0a0c6bd1d15\",\n \"score\": \"0.6719624\",\n \"text\": \"@Before\\n\\tpublic void setUp() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c69caa6b5ddf5da93a7c3939d6a625e6\",\n \"score\": \"0.6718376\",\n \"text\": \"@BeforeTest\\r\\n\\tpublic void setUp() {\\r\\n\\r\\n\\t\\tstartBrowser();\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b52727aea59506d1b379fc3446d510d\",\n \"score\": \"0.67056745\",\n \"text\": \"@BeforeAll\\n public static void setUp() {\\n System.setProperty(\\\"org.jooq.no-logo\\\", \\\"true\\\");\\n System.setProperty(\\\"org.jooq.no-tips\\\", \\\"true\\\");\\n\\n // Set a default log level\\n // System.setProperty(\\\"org.slf4j.simpleLogger.defaultLogLevel\\\", \\\"DEBUG\\\");\\n\\n BaseTest.config = Configuration.load();\\n BaseTest.apiFactory = DSLContextAPIFactory.build(BaseTest.config);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bdd4e51c83616cec5b7952ab085026c9\",\n \"score\": \"0.6697608\",\n \"text\": \"protected void setup() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5570f24ebca39a86b43938d363a9a296\",\n \"score\": \"0.66922355\",\n \"text\": \"@Before\\r\\n\\tpublic void setUp() throws Exception {\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b761c0500d09659d015092e39823e01\",\n \"score\": \"0.6679402\",\n \"text\": \"@BeforeClass\\n public static void setUpBeforeClass() {\\n ss = createTopology(NUM_SWITCH, NUM_PORTS, NUM_LINKS, NUM_HOSTS);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b63d0a7cb94543d2f444e312c4a5d95\",\n \"score\": \"0.66784364\",\n \"text\": \"@Before\\n public void setup() {\\n TestApplication.getApplication().setPlatform(UAirship.ANDROID_PLATFORM);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ad6d236c78d02bb1372994718eb025c1\",\n \"score\": \"0.66778255\",\n \"text\": \"@Before \\r\\n\\tpublic void setupTest() throws FileNotFoundException, IOException, FHIRException {\\n\\t\\tTestingUtilities.fixedpath = \\\"//Users//oliveregger//fhir//trunk//build\\\";\\r\\n\\t\\tif (context == null)\\r\\n\\t\\t\\t\\tcontext = SimpleWorkerContext\\r\\n\\t\\t\\t\\t\\t.fromPack(Utilities.path(TestingUtilities.home(), \\\"publish\\\", \\\"igpack.zip\\\"));\\r\\n\\r\\n\\t\\tTestingUtilities.context = new SimpleWorkerContext(context);\\r\\n\\t\\tfhirPathEngine = new FHIRPathEngine(TestingUtilities.context);\\r\\n\\t\\tstructureMapUtilites = new StructureMapUtilities(TestingUtilities.context, maps, mappingServices);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9463bdf298b564a046543a1be698eecb\",\n \"score\": \"0.6671788\",\n \"text\": \"public static void testMultiEnvironment() {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"deeaa19988ae664858dccfffca47fd4a\",\n \"score\": \"0.6670207\",\n \"text\": \"@BeforeClass\\n public static void setUp() {\\n setUp(\\n \\\"Add Terms and conditions in CsAdmin and verify new values in OpayWeb.\\\",\\n \\\"Liliya Gafurova\\\", true);\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983795,"cells":{"query_id":{"kind":"string","value":"359c7fd9aff9f940ec6163fe2cddf6a6"},"query":{"kind":"string","value":"Display the banner screen"},"positive_passages":{"kind":"list like","value":[{"docid":"d53afc40cded927e06bac07c4b257e82","score":"0.0","text":"public void startProgram() {\n this.displayBanner();\n // promt the player to enter their name Retriere the name of the player\n String playersName = this.getPlayersName();\n \n // create and save the plare object\n Player player = ProgramControl.createPlayer(playersName);\n \n // Display a personalized welcome\n this.displayWelcomeMessage(player);\n // Display the Main menu.\n \n MainMenuView mainMenuView = new MainMenuView();\n mainMenuView.display();\n }","title":""}],"string":"[\n {\n \"docid\": \"d53afc40cded927e06bac07c4b257e82\",\n \"score\": \"0.0\",\n \"text\": \"public void startProgram() {\\n this.displayBanner();\\n // promt the player to enter their name Retriere the name of the player\\n String playersName = this.getPlayersName();\\n \\n // create and save the plare object\\n Player player = ProgramControl.createPlayer(playersName);\\n \\n // Display a personalized welcome\\n this.displayWelcomeMessage(player);\\n // Display the Main menu.\\n \\n MainMenuView mainMenuView = new MainMenuView();\\n mainMenuView.display();\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"bb0359cc4aa1f943ef631c8802d400f9","score":"0.7908571","text":"private void displayBanner() {\n\t\tConfigManager configManager = ConfigManager.getInstance();\n\n\t\tString appName = configManager.getRunnerConfig().getString(\n\t\t\t\tConfigConstants.RUNNER_CONFIG_NAME);\n\n\t\tString appKey = configManager.getRunnerConfig().getString(\n\t\t\t\tConfigConstants.RUNNER_CONFIG_SERVER_KEY);\n\n\t\tString appVersion = configManager.getRunnerConfig().getString(\n\t\t\t\tConfigConstants.RUNNER_CONFIG_VERSION);\n\n\t\tlog.info(appName + \"(\" + appKey + \") \" + appVersion + \"\\n\");\n\t}","title":""},{"docid":"4226eee40333d1421e697bf1cbdd128a","score":"0.69716984","text":"public void showBannerAd1() {\n\t\thandler.post(new Runnable(){\n\t @Override\n\t public void run(){\n\t \t\n\t \tAdControlManager.showBannerAd1();\n\t }\n\t\t});\t\t\n\t}","title":""},{"docid":"75d96b3075849d2189b112e04e157e4b","score":"0.69193643","text":"public void displayExitSystemBanner() {\n io.print(\"==============================================================\");\n io.print(\" * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * \");\n io.print(\"==============================================================\");\n io.print(\"============FLOORING-RESOURCE-MANAGEMENT-SYSTEMS==============\");\n io.print(\"==========================SWC-CORP============================\");\n io.print(\"==============================================================\");\n io.print(\" * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * \");\n io.print(\"==============================================================\");\n io.print(\"=======================SO LONG FOR NOW========================\");\n }","title":""},{"docid":"15891dc0781b2f506470b2957fefcc2a","score":"0.6720862","text":"public BannersScreen() {\n\n\t\tmerchUI = new MerchandisingUIIdentifiers();\n\t\tmerchData = new MerchandisingUIData();\n\t}","title":""},{"docid":"dfe2269de024a3e3188db58ae1c1b71f","score":"0.6653859","text":"public void displayCreateBanner() {\n io.print(\"===== Create an Order =====\");\n }","title":""},{"docid":"a81189a82e164a2984afbd4ee03db01a","score":"0.6607817","text":"private void addBanner()\n {\n banner = new VBox();\n Label title = new Label(\"High Card!\");\n Label playerTitle = new Label(\"Player 1\" + \"\\t\" + \"\\t\" + \"\\t\" + \"\\t\" + \"\\t\" + \"\\t\" + \"\\t\" + \"Player2\");\n banner.setAlignment(Pos.CENTER);\n banner.getChildren().addAll(title, playerTitle);\n }","title":""},{"docid":"0d58749b22167ac47122e146b3b215e8","score":"0.64637125","text":"public void displayOrdersBanner() {\n io.print(\"============== *** Display Orders *** ==============\");\n }","title":""},{"docid":"8e14af66d8e10a7661d2d36428751f8d","score":"0.6440308","text":"UIViewController greystripeBannerDisplayViewController();","title":""},{"docid":"74a9d15f3843485f5bf2fa383139f831","score":"0.63903826","text":"public void display() {\r\n setVisible(true);\r\n }","title":""},{"docid":"e00e22f63d2640744307abb5cd46624c","score":"0.6368941","text":"private void loadBanner() {\n AdRequest adRequest =\n new AdRequest.Builder().build();\n\n AdSize adSize = AdSize.SMART_BANNER;\n // Step 4 - Set the adaptive ad size on the ad view.\n adView.setAdSize(adSize);\n\n // Step 5 - Start loading the ad in the background.\n\n adView.loadAd(adRequest);\n }","title":""},{"docid":"94212d25380c27100a74369c6c3d2c16","score":"0.6345785","text":"@Override\n public void onAdOpened() {\n Log.e(TAG, \"Banner onAdOpened: \");\n // covers the screen.\n }","title":""},{"docid":"9c15cfffa3decc97dbcea2e27a5081b2","score":"0.627872","text":"public void display()\n {\n // Make sure image is fully loaded, waiting if necessary.\n try { mt.waitForID(0); }\n catch (InterruptedException ex) { }\n\n if (mt.isErrorID(0))\n {\n unload();\n slidePanel.setMessage(\"Slide missing!\");\n }\n\n // Update the enabled/disabled status of the transport buttons\n updateButtons();\n\n // Display the slide\n slidePanel.setImage(image);\n\n // Update the caption at the bottom of the screen\n captionPanel.setText(caption);\n }","title":""},{"docid":"ec08d3212f83b07bb25cc53a6aec760a","score":"0.625291","text":"private void setUpBanner() {\n try {\r\n Bitmap bitmap = getBannerBitmap();\r\n if (!EmbeddedValues.IS_PLAY_STORE_BUILD) {\r\n saveBanner(bitmap);\r\n }\r\n\r\n // If we successfully got the banner image set it and it's background\r\n if (bitmap != null) {\r\n m_banner.setImageBitmap(bitmap);\r\n m_banner.setBackgroundColor(getMostCommonColor(bitmap));\r\n }\r\n } catch (IOException e) {\r\n // Ignore failure\r\n }\r\n }","title":""},{"docid":"bc020b3748bf6c7b8cc2f74b5a4e45a5","score":"0.62459046","text":"private void display() {\r\n\t\tsetVisible(true);\r\n\t}","title":""},{"docid":"d361708d12e9963fd9ba64e556a151f0","score":"0.6240765","text":"public void showWallAd1() {\n\t\thandler.post(new Runnable(){\n\t @Override\n\t public void run(){\n\t \tAdControlManager.showAdcropsWall();\n\t }\n\t\t});\t\t\n\t}","title":""},{"docid":"36f6607d9f96209b884f9e9cf9834cfc","score":"0.6237151","text":"@Override\n\tpublic void show() {\n\t\tbatch = new SpriteBatch();\n\t\t\n\t\t// load up the splash background texture\n\t\tsplashScreen = GameManager.getTexture(\"SplashBg.png\");\n\t\t\n\t\t// setup the screen width and height variables\n\t\tDEVICE_WIDTH = GameManager.getWidth(false);\n\t\tDEVICE_HEIGHT = GameManager.getHeight(false);\n\t\t\n\t\t// create the game camera object\n\t\tCAMERA = GameManager.getCamera(DEVICE_WIDTH, DEVICE_HEIGHT);\n\t}","title":""},{"docid":"268bc119f0683d17d16a37c7ac9bbdf9","score":"0.623255","text":"public static void showUI()\n {\n \tif (statsShowing)\n \t{\n \t\tshowStats();\n \t}\n \tshowNPCText();\n \tshowMenus();\n \tshowBags();\n }","title":""},{"docid":"0147f0c05be5b30bfce41f43f79115ba","score":"0.61819917","text":"private void showScreen(Graphics g) {\n g.setFont(font);\n drawPage(g);\n drawThumNail(g);\n g.setFont(CustomCanvas.font);\n iMenu.drawScreen(g, itemFocused, lastitemFocused, iCustomPopup.isMessageFocused(),null);\n iBannerHandler.drawScreen(g, itemFocused);\n }","title":""},{"docid":"72a4075fd7229d60804476db3fdf62e5","score":"0.610856","text":"public void displayUserBanner(User user){\n ViewGroup bannerForeground = findById(bannerContainer, R.id.banner_foreground);\n bannerContainer.removeView(bannerForeground);\n // add user info, logout button\n View loggedInForeground = inflater.inflate(\n R.layout.nav_drawer_banner_logged_in, bannerContainer);\n TextView nameLabel = findById(loggedInForeground, R.id.user_name);\n TextView emailLabel = findById(loggedInForeground, R.id.user_email);\n nameLabel.setText(user.getFullName());\n emailLabel.setText(user.getEmail());\n findById(loggedInForeground, R.id.logout_button).setOnClickListener(new View.OnClickListener() {\n @Override\n public void onClick(View v) {\n userManager.logout();\n displayLogoutBanner();\n }\n });\n }","title":""},{"docid":"2a0ce9d2d66c54b91f1d5e46918c2728","score":"0.6079471","text":"@Override\n public void run() {\n displayAds();\n }","title":""},{"docid":"b3d5588ddcfd9b28893f4b7aa3a7d736","score":"0.60744417","text":"private void display() {\n refreshMenu();\n UserInterface.print(getOutput().toString());\n }","title":""},{"docid":"8baefaa146d79e81ef5cf426147cac50","score":"0.6066989","text":"public void Display() {\n\t\tSystem.out.println(\"It's My Mercedes-Benz Car.\");\n\t}","title":""},{"docid":"b1d7a3aad804388bcd75b96398b72862","score":"0.60596937","text":"public void showConnectionScreen() {\n try {\n // Load connection overview.\n FXMLLoader loader = new FXMLLoader();\n loader.setLocation(MainApp.class.getResource(\"view/ConnectionScreen.fxml\"));\n GridPane connectionScreen = (GridPane) loader.load();\n\n\t\t\t // Give the controller access to the main app.\n\t\t ConnectionScreenController controller = loader.getController();\n\t\t controller.setMainApp(this);\n\n\t\t\t // Set person overview into the center of root layout.\n\t\t\trootLayout.setCenter(connectionScreen);\n\n } catch (IOException e) {\n e.printStackTrace();\n }\n }","title":""},{"docid":"fccce1ba7e4580402bdcfec7cf5f26e8","score":"0.6018109","text":"public void displayPanel() {\n displayPanel = new JPanel();\r\n displayLabel = new JLabel();\r\n displayLabel.setIcon(logoIcon);\r\n displayPanel.setLayout(new BorderLayout());\r\n displayPanel.add(displayLabel, BorderLayout.CENTER);\r\n displayPanel.setBackground(gray);\r\n }","title":""},{"docid":"9fdffe668b159af099e7826ad00fd195","score":"0.6005879","text":"public void show();","title":""},{"docid":"14eaf9e5b1fc0918ec67e5a637d0de0d","score":"0.60032135","text":"@Override\r\n\tpublic void display() {\n\t\tSystem.out.println(\"Welcome\");\r\n\t}","title":""},{"docid":"06be6a0b9c5c2df9ca86a9a3930e38ae","score":"0.600039","text":"public void run() {\n\t\t\t\tUIManager.put(\"swing.boldMetal\", Boolean.FALSE);\n\t\t\t\ttry {\n\t\t\t\t\tShowScreen();\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}","title":""},{"docid":"9b73e1b9a74e3ae9175f3fe31728b781","score":"0.59996617","text":"public void display() {\n\t\thome();\n\t\tdata();\n\t}","title":""},{"docid":"88d2cb732bd54ff3e86eb9aeb7e0d635","score":"0.5986566","text":"@Override\r\n\tpublic void show() {\n\t\t\r\n\t\tSystem.out.println(\"Welcome\");\r\n\t}","title":""},{"docid":"9dceb7f3318ddd84c36031db4e366ca6","score":"0.5976347","text":"public void showWelcome() {\n printLogo();\n printGreeting();\n }","title":""},{"docid":"449800d5411cf7e6fe0bc09b4ec0863a","score":"0.5956255","text":"public void displayEditBanner() {\n io.print(\"===== Edit an Order =====\");\n }","title":""},{"docid":"31c0b54c6d5880f90cdfb62bf23026fb","score":"0.594824","text":"private void display(String agent){\n display(agent, false);\n }","title":""},{"docid":"5cb05039d9b1238232dcde9d03f59def","score":"0.5947626","text":"private void displayCover()\n {\n try\n {\n this.coverNotePane.setContent(new ImageView(new Image(new FileInputStream(this.book.getCoverImagePath()))));\n }\n catch (FileNotFoundException | NullPointerException e)\n {\n this.coverNotePane.setContent(null);\n System.err.println(\"No cover image.\");\n }\n\n this.errorBox.setText(\"\");\n }","title":""},{"docid":"be8b5af4bca5abecaa102bb04ba4fa49","score":"0.59359","text":"public void displayBook() {\n int locX = 100;\n int locY = 100;\n final int WIDTH = 100;\n final int HEIGHT = 100;\n \n UI.drawImage(this.image, locX, locY, WIDTH, HEIGHT);\n }","title":""},{"docid":"06be22e8ad20a227b6b2af3deb30b089","score":"0.592019","text":"public void DisplayMainMenu()\n\t{\n\t\tmFrame.getContentPane().add(mainMenuView, BorderLayout.CENTER);\t\n\t\tmenuBar.setVisibleTrue();\n\t}","title":""},{"docid":"96480a5a815703426f2d985cae14b5ff","score":"0.59191394","text":"public void display ()\r\n\t{}","title":""},{"docid":"cfa83ae1200b6a12e9f1cb10247764d5","score":"0.5919091","text":"public static void display() {\n\t\t\tSystem.out.println(\"Display is UHD\");\n\t\t\t}","title":""},{"docid":"0b005a732c749f93d95c4fe843c65ad9","score":"0.59139115","text":"@Override\r\n\tpublic void show() {\n\t\t\r\n\t}","title":""},{"docid":"0b005a732c749f93d95c4fe843c65ad9","score":"0.59139115","text":"@Override\r\n\tpublic void show() {\n\t\t\r\n\t}","title":""},{"docid":"0b005a732c749f93d95c4fe843c65ad9","score":"0.59139115","text":"@Override\r\n\tpublic void show() {\n\t\t\r\n\t}","title":""},{"docid":"0b005a732c749f93d95c4fe843c65ad9","score":"0.59139115","text":"@Override\r\n\tpublic void show() {\n\t\t\r\n\t}","title":""},{"docid":"367424eece7601d1cd130770638f0edd","score":"0.5909243","text":"@Override\r\n\tpublic void display() {\n\t\t\r\n\t}","title":""},{"docid":"367424eece7601d1cd130770638f0edd","score":"0.5909243","text":"@Override\r\n\tpublic void display() {\n\t\t\r\n\t}","title":""},{"docid":"367424eece7601d1cd130770638f0edd","score":"0.5909243","text":"@Override\r\n\tpublic void display() {\n\t\t\r\n\t}","title":""},{"docid":"367424eece7601d1cd130770638f0edd","score":"0.5909243","text":"@Override\r\n\tpublic void display() {\n\t\t\r\n\t}","title":""},{"docid":"649ec6c8e24712027fb8bb431edb8c6d","score":"0.58928925","text":"public void display() {\n\t\tSystem.out.println(\"== Farm City :: Welcome ==\");\n\t\tSystem.out.println(\"1. Register\");\n\t\tSystem.out.println(\"2. Login\");\n\t\tSystem.out.println(\"3. Exit\");\n\t\tSystem.out.println();\n\t}","title":""},{"docid":"d882eb33b7257c8d371058b2dc582096","score":"0.58895266","text":"LoopMeBanner(Context context, String appKey) {\n super(context, appKey);\n\n mViewController = new ViewController(this);\n\n Utils.init(context);\n DebugController.init(context);\n\n Logging.out(LOG_TAG, \"Start creating banner with app key: \" + appKey);\n }","title":""},{"docid":"549d1880757389147b88f003f82cca3d","score":"0.5889055","text":"public void displayRemoveBanner() {\n io.print(\"===== Remove an Order =====\");\n }","title":""},{"docid":"3bf421c17726d099586ed11d775889f1","score":"0.5888572","text":"@Override\n\tpublic void display() {\n\t\t\n\t\t\n\t}","title":""},{"docid":"dfb1d375c07173b90e84057d575693ae","score":"0.5888368","text":"@Override\n public void onAdLoaded() {\n adView.setVisibility(View.VISIBLE);\n\n }","title":""},{"docid":"8c1ae7a3754357d5da4d1a176a1b9148","score":"0.5887277","text":"public void showTitleScreen() {\n\t\tui.titleNamePanel.setVisible(true);\n\t\tui.journeyButtonPanel.setVisible(true);\n\t\t\n\t\t//HIDE THE GAME SCREEN\n\t\tui.mainTextPanel.setVisible(false);\n\t\tui.choiceButtonPanel.setVisible(false);\n\t\tui.playerInfoPanel.setVisible(false);\t\n\t}","title":""},{"docid":"3ceb58d5671ad3e2e682e719b12bdc56","score":"0.58845854","text":"@Override\n public void onAdLoaded(View view) {\n\n //Find the banner in the layout and clear previous creative\n ((FrameLayout) findViewById(R.id.banner)).removeAllViews();\n\n //Find the banner in the layout and show loaded creative in it\n ((FrameLayout) findViewById(R.id.banner)).addView(view);\n }","title":""},{"docid":"44ff949e886976870ec7615e821eac55","score":"0.58611155","text":"private void showAllEnollmentScreen() {\n\t\t\n\t}","title":""},{"docid":"e0d9b52261f0a1f39d60da7ed455a851","score":"0.58537596","text":"public void initBallAndBanner(){\n\n bouncyBall.setBallX(gameViewWidth / 2);\n bouncyBall.setBallY(bottomY - bouncyBall.getBallRadius());\n\n\t\t// initialize the coordinates of the banner\n // (bannerX,bannerY) is the center of banner\n\n\t\tbanner.setBannerX(gameViewWidth / 2);\n\t\tbanner.setBannerY(bottomY + banner.getBannerHeight()/2);\n\t}","title":""},{"docid":"95b6f9db7340c04b63fba69d2c4cdcd7","score":"0.58472127","text":"@Override\n\tpublic void display() {\n\t\tSystem.out.println(\"I am a rubber duck\");\n\t\t\n\t}","title":""},{"docid":"955cbb84979045c55291e58aecec69b3","score":"0.5846276","text":"@Override\n public void present() {\n _graphics.clear(_backgroudnColor.getBackgroundColor());\n _backgroudnColor.present();\n\n arrowsBackgroundPresent();\n menuPresent();\n\n pointsString.present();\n _score.present();\n buttonsPresent();\n\n _whiteFlash.present();\n _blackBands.present();\n }","title":""},{"docid":"ae63370fe7eab3d1c150564847f21547","score":"0.584475","text":"public void showWelcome() {\n String logo = \" ____ _ \\n\"\n + \"| _ \\\\ _ _| | _\\n\"\n + \"| | | | | | | |/ /\\n\"\n + \"| |_| | |_| | < \\n\"\n + \"|____/ \\\\__,_|_|\\\\_\\\\\\n\";\n System.out.println(logo);\n\n String greeting = \"Hello! I'm Duk\\n\"\n + \"What must I do for you?\\n\";\n System.out.println(greeting);\n\n if (dialogContainer != null) {\n printDukeDialog(greeting);\n }\n }","title":""},{"docid":"98c60997aa3e5647340fa0b6942fb646","score":"0.5844555","text":"public void Display() \r\n\t{\r\n\t\tSystem.out.println(\"Type: Gift Card\");\r\n\t\tSystem.out.println(\"Price: $\" + getPrice());\r\n\t\tSystem.out.println(\"Quantity: \" + getQuantity());\r\n\t\tSystem.out.println(\"Title: \" + getTitle());\r\n\t\tSystem.out.println(\"Label: \" + label);\r\n\t\tSystem.out.println(\"Manufacturer: \" + manufacturer);\r\n\t}","title":""},{"docid":"bc7b3d5a372eec846c6760372be99813","score":"0.5842945","text":"@Override\n\tpublic void show() {\n\t\t\n\t}","title":""},{"docid":"bc7b3d5a372eec846c6760372be99813","score":"0.5842945","text":"@Override\n\tpublic void show() {\n\t\t\n\t}","title":""},{"docid":"bc7b3d5a372eec846c6760372be99813","score":"0.5842945","text":"@Override\n\tpublic void show() {\n\t\t\n\t}","title":""},{"docid":"bc7b3d5a372eec846c6760372be99813","score":"0.5842945","text":"@Override\n\tpublic void show() {\n\t\t\n\t}","title":""},{"docid":"bc7b3d5a372eec846c6760372be99813","score":"0.5842945","text":"@Override\n\tpublic void show() {\n\t\t\n\t}","title":""},{"docid":"bc7b3d5a372eec846c6760372be99813","score":"0.5842945","text":"@Override\n\tpublic void show() {\n\t\t\n\t}","title":""},{"docid":"bc7b3d5a372eec846c6760372be99813","score":"0.5842945","text":"@Override\n\tpublic void show() {\n\t\t\n\t}","title":""},{"docid":"973baaf033d5ecbea6cb21767b54608f","score":"0.58325034","text":"@Override protected void startup() {\r\n show(new JerboView(this));\r\n }","title":""},{"docid":"ba28ddf3cb43602dc25b4b031f610781","score":"0.58322984","text":"private void setBanner(Document doc, Course courseToExport) {\r\n Node bannerNode = getNodeWithId(doc, HTML.Tag.DIV.toString(), ID_BANNER);\r\n String bannerText = courseToExport.getSubject().toString() + \" \" + courseToExport.getNumber();\r\n bannerText += LINE_BREAK + courseToExport.getTitle();\r\n bannerNode.setTextContent(bannerText);\r\n }","title":""},{"docid":"d9e038ffead6ae7c64e4450282ca96af","score":"0.5828451","text":"public static void display()\r\n\t{\n\t}","title":""},{"docid":"aa60e210b918bf9299d0285976b5aa7f","score":"0.5824436","text":"@Override\n\tpublic void show() {\n\t\tbatch = new SpriteBatch();\n\t\ttexture = new Texture(Gdx.files.internal(\"data/screens/win.png\"));\n\t\tsprite = new Sprite(texture);\n\t\twhite = new BitmapFont(Gdx.files.internal(\"data/fonts/white.fnt\"), false);\n\t\twhite.setColor(Color.BLACK);\n\t\tatlas = new TextureAtlas(\"data/buttons/button.pack\");\n\t\tskin= new Skin();\n\t\tskin.addRegions(atlas);\n\n\t}","title":""},{"docid":"49f91c4a0321ea030765c80df0497b96","score":"0.58219075","text":"@Override\n\tpublic void show()\n\t{\n\n\t}","title":""},{"docid":"b564bf67615c76d3a8fa06656d50bfb0","score":"0.5819367","text":"private void show() {\n\n StdDraw.show(0);\n }","title":""},{"docid":"03cbf3d43e2950a9156e3c20ebbc3335","score":"0.5814493","text":"@Override\n public void display() {\n \n }","title":""},{"docid":"8eb344409cff258736d8bb36c0ba3684","score":"0.5811708","text":"void willPresentScreen (GADBannerView view);","title":""},{"docid":"92577d08d78e302ea8a7309f674cce97","score":"0.5809388","text":"private void displayMenu() {\n System.out.println(\"**********************************\");\n System.out.println(\"*** Robocode Tester Menu ***\");\n System.out.println(\"**********************************\");\n System.out.println(\"*1) Single Battle ***\");\n System.out.println(\"**********************************\");\n System.out.println(\"*2) Multi Battle ***\");\n System.out.println(\"**********************************\");\n System.out.println(\"*3 Exit ***\");\n System.out.println(\"**********************************\");\n }","title":""},{"docid":"d1e66119d880cf25738e2042181824ab","score":"0.5803443","text":"public void displayMenu() {\n System.out.println(\"\\nHere's what you can do: \");\n System.out.println(\"1. Start a Supertrump Game\");\n System.out.println(\"2. View Instructions\");\n System.out.println(\"3. About the Supertrump Game\");\n System.out.println(\"4. Exit the program\");\n }","title":""},{"docid":"7911330dc24b2f12a958aaf687472a45","score":"0.5803277","text":"public void display()\n {\n JFrame myFrame = new JFrame(\"BlackJack\");\n myFrame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\n myFrame.setContentPane(this);\n myFrame.setPreferredSize(new Dimension(700,550));\n\n //Display the window.\n myFrame.pack();\n myFrame.setVisible(true);\n\n }","title":""},{"docid":"c3f50af2cbff40b7fc7ba9ac8a801e30","score":"0.5803014","text":"@Override\n public void onAdClosed() {\n showBannerAd();\n }","title":""},{"docid":"5622a435e8bee468ff103130a55fcdb5","score":"0.5802422","text":"public void show() {\n show(true);\n }","title":""},{"docid":"aadf9257a457f1efda2a1740c2a64994","score":"0.5791574","text":"public void displayInterstitial() {\n if (interstitial.isLoaded()) {\n interstitial.show();\n }\n }","title":""},{"docid":"0b1d2956b4544edd368cf40d8ea532d0","score":"0.57891566","text":"@Override\n public void onAdLoaded(Ad ad) {\n View adView1 = NativeBannerAdView.render(NonPrimaryIcici.this, mNativeBannerAxis1, NativeBannerAdView.Type.HEIGHT_100);\n LinearLayout nativeBannerAdContainer1 = findViewById(R.id.native_banksiciciNP1);\n // Add the Native Banner Ad View to your ad container\n nativeBannerAdContainer1.addView(adView1);\n }","title":""},{"docid":"827baf7f5ea928465066ba6ab02fe649","score":"0.5787498","text":"@Override\r\n\tpublic void show()\r\n\t{\n\r\n\t}","title":""},{"docid":"c03358f203262b0a1f456116563410ff","score":"0.5787493","text":"public void display()\n\t{\n\t\tMinecraft.getMinecraft().getSoundHandler().stopSounds();\n\t\tMinecraft.getMinecraft().displayGuiScreen(GuiHandler.fake_menu);\n\t}","title":""},{"docid":"4e3c828adeabd29b4dff5fbf63d764bc","score":"0.5785109","text":"public void display();","title":""},{"docid":"4e3c828adeabd29b4dff5fbf63d764bc","score":"0.5785109","text":"public void display();","title":""},{"docid":"4e3c828adeabd29b4dff5fbf63d764bc","score":"0.5785109","text":"public void display();","title":""},{"docid":"4e3c828adeabd29b4dff5fbf63d764bc","score":"0.5785109","text":"public void display();","title":""},{"docid":"4e3c828adeabd29b4dff5fbf63d764bc","score":"0.5785109","text":"public void display();","title":""},{"docid":"4e3c828adeabd29b4dff5fbf63d764bc","score":"0.5785109","text":"public void display();","title":""},{"docid":"0b8781d7b5ac99282939265e9457d6dc","score":"0.5784681","text":"@Override\r\n public void show() {\r\n this.showTitlePart(UP_TITLE);\r\n this.showTitlePart(MIDDLE_TITLE);\r\n this.showTitlePart(DOWN_TITLE);\r\n this.showPedestal();\r\n this.showColumns();\r\n this.showStaircase();\r\n }","title":""},{"docid":"9bf743a16ac6551af0062c6df2c9dbb5","score":"0.57830113","text":"public void showSplash() {\r\n JPanel content = (JPanel)getContentPane();\r\n content.setBackground(Color.white);\r\n\r\n // Set the window's bounds, centering the window\r\n int width = 600;\r\n int height =338;\r\n Dimension screen = Toolkit.getDefaultToolkit().getScreenSize();\r\n int x = (screen.width-width)/2;\r\n int y = (screen.height-height)/2;\r\n setBounds(x,y,width,height);\r\n\r\n // Build the splash screen\r\n JLabel label = new JLabel(new ImageIcon(\"pic\\\\LOGAN.gif\"));\r\n JLabel copyrt = new JLabel\r\n (\"LOGAN\", JLabel.CENTER);\r\n copyrt.setFont(new Font(\"Sans-Serif\", Font.BOLD, 12));\r\n content.add(label, BorderLayout.CENTER);\r\n content.add(copyrt, BorderLayout.SOUTH);\r\n Color oraRed = new Color(156, 20, 20, 255);\r\n content.setBorder(BorderFactory.createLineBorder(oraRed, 3));\r\n\r\n // Display it\r\n setVisible(true);\r\n\r\n // Wait a little while, maybe while loading resources\r\n try { Thread.sleep(duration); } catch (Exception e) {}\r\n\r\n setVisible(false);\r\n }","title":""},{"docid":"694b952005cbacf05dcb26b13d0925a8","score":"0.57771164","text":"boolean greystripeBannerAutoload();","title":""},{"docid":"73a6dac807a13c721daa0cef045f758c","score":"0.5776752","text":"public void showLogo();","title":""},{"docid":"162aef24a9aed72c38bc6f62d078b74b","score":"0.5764814","text":"public void displayInterstitial() {\n if (interstitial.isLoaded()) {\n interstitial.show();\n }\n }","title":""},{"docid":"162aef24a9aed72c38bc6f62d078b74b","score":"0.5764814","text":"public void displayInterstitial() {\n if (interstitial.isLoaded()) {\n interstitial.show();\n }\n }","title":""},{"docid":"4ca42781ab61c88c11eac3c4379819df","score":"0.5761666","text":"public void show() {\n show(DEFAULT_CONTROLLER_TIMEOUT);\n }","title":""},{"docid":"48c3e14c74dcb197b0c06020aae15dd5","score":"0.5753016","text":"public void display() {\n this.displayBanner();\n \n // prompt the player to enter their name Retrieve the name of the player\n String playersName = this.getInput();\n \n this.doAction(playersName);\n \n }","title":""},{"docid":"cfecfa8da77fbcc81ef7cb6437c57847","score":"0.5749766","text":"@Override\n public void onAdLoaded(Ad ad) {\n View adView1 = NativeBannerAdView.render(NonPrimaryIcici.this, mNativeBannerAxis2, NativeBannerAdView.Type.HEIGHT_100);\n LinearLayout nativeBannerAdContainer1 = findViewById(R.id.native_banksiciciNP2);\n // Add the Native Banner Ad View to your ad container\n nativeBannerAdContainer1.addView(adView1);\n }","title":""},{"docid":"6e5dd6de8538a992ce56a07ad595b481","score":"0.57303214","text":"@Override\n\tpublic void show() {\n\n\t}","title":""},{"docid":"6e5dd6de8538a992ce56a07ad595b481","score":"0.57303214","text":"@Override\n\tpublic void show() {\n\n\t}","title":""},{"docid":"6e5dd6de8538a992ce56a07ad595b481","score":"0.57303214","text":"@Override\n\tpublic void show() {\n\n\t}","title":""},{"docid":"6e5dd6de8538a992ce56a07ad595b481","score":"0.57303214","text":"@Override\n\tpublic void show() {\n\n\t}","title":""}],"string":"[\n {\n \"docid\": \"bb0359cc4aa1f943ef631c8802d400f9\",\n \"score\": \"0.7908571\",\n \"text\": \"private void displayBanner() {\\n\\t\\tConfigManager configManager = ConfigManager.getInstance();\\n\\n\\t\\tString appName = configManager.getRunnerConfig().getString(\\n\\t\\t\\t\\tConfigConstants.RUNNER_CONFIG_NAME);\\n\\n\\t\\tString appKey = configManager.getRunnerConfig().getString(\\n\\t\\t\\t\\tConfigConstants.RUNNER_CONFIG_SERVER_KEY);\\n\\n\\t\\tString appVersion = configManager.getRunnerConfig().getString(\\n\\t\\t\\t\\tConfigConstants.RUNNER_CONFIG_VERSION);\\n\\n\\t\\tlog.info(appName + \\\"(\\\" + appKey + \\\") \\\" + appVersion + \\\"\\\\n\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4226eee40333d1421e697bf1cbdd128a\",\n \"score\": \"0.69716984\",\n \"text\": \"public void showBannerAd1() {\\n\\t\\thandler.post(new Runnable(){\\n\\t @Override\\n\\t public void run(){\\n\\t \\t\\n\\t \\tAdControlManager.showBannerAd1();\\n\\t }\\n\\t\\t});\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75d96b3075849d2189b112e04e157e4b\",\n \"score\": \"0.69193643\",\n \"text\": \"public void displayExitSystemBanner() {\\n io.print(\\\"==============================================================\\\");\\n io.print(\\\" * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * \\\");\\n io.print(\\\"==============================================================\\\");\\n io.print(\\\"============FLOORING-RESOURCE-MANAGEMENT-SYSTEMS==============\\\");\\n io.print(\\\"==========================SWC-CORP============================\\\");\\n io.print(\\\"==============================================================\\\");\\n io.print(\\\" * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * \\\");\\n io.print(\\\"==============================================================\\\");\\n io.print(\\\"=======================SO LONG FOR NOW========================\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"15891dc0781b2f506470b2957fefcc2a\",\n \"score\": \"0.6720862\",\n \"text\": \"public BannersScreen() {\\n\\n\\t\\tmerchUI = new MerchandisingUIIdentifiers();\\n\\t\\tmerchData = new MerchandisingUIData();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dfe2269de024a3e3188db58ae1c1b71f\",\n \"score\": \"0.6653859\",\n \"text\": \"public void displayCreateBanner() {\\n io.print(\\\"===== Create an Order =====\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a81189a82e164a2984afbd4ee03db01a\",\n \"score\": \"0.6607817\",\n \"text\": \"private void addBanner()\\n {\\n banner = new VBox();\\n Label title = new Label(\\\"High Card!\\\");\\n Label playerTitle = new Label(\\\"Player 1\\\" + \\\"\\\\t\\\" + \\\"\\\\t\\\" + \\\"\\\\t\\\" + \\\"\\\\t\\\" + \\\"\\\\t\\\" + \\\"\\\\t\\\" + \\\"\\\\t\\\" + \\\"Player2\\\");\\n banner.setAlignment(Pos.CENTER);\\n banner.getChildren().addAll(title, playerTitle);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d58749b22167ac47122e146b3b215e8\",\n \"score\": \"0.64637125\",\n \"text\": \"public void displayOrdersBanner() {\\n io.print(\\\"============== *** Display Orders *** ==============\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e14af66d8e10a7661d2d36428751f8d\",\n \"score\": \"0.6440308\",\n \"text\": \"UIViewController greystripeBannerDisplayViewController();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"74a9d15f3843485f5bf2fa383139f831\",\n \"score\": \"0.63903826\",\n \"text\": \"public void display() {\\r\\n setVisible(true);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e00e22f63d2640744307abb5cd46624c\",\n \"score\": \"0.6368941\",\n \"text\": \"private void loadBanner() {\\n AdRequest adRequest =\\n new AdRequest.Builder().build();\\n\\n AdSize adSize = AdSize.SMART_BANNER;\\n // Step 4 - Set the adaptive ad size on the ad view.\\n adView.setAdSize(adSize);\\n\\n // Step 5 - Start loading the ad in the background.\\n\\n adView.loadAd(adRequest);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"94212d25380c27100a74369c6c3d2c16\",\n \"score\": \"0.6345785\",\n \"text\": \"@Override\\n public void onAdOpened() {\\n Log.e(TAG, \\\"Banner onAdOpened: \\\");\\n // covers the screen.\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c15cfffa3decc97dbcea2e27a5081b2\",\n \"score\": \"0.627872\",\n \"text\": \"public void display()\\n {\\n // Make sure image is fully loaded, waiting if necessary.\\n try { mt.waitForID(0); }\\n catch (InterruptedException ex) { }\\n\\n if (mt.isErrorID(0))\\n {\\n unload();\\n slidePanel.setMessage(\\\"Slide missing!\\\");\\n }\\n\\n // Update the enabled/disabled status of the transport buttons\\n updateButtons();\\n\\n // Display the slide\\n slidePanel.setImage(image);\\n\\n // Update the caption at the bottom of the screen\\n captionPanel.setText(caption);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec08d3212f83b07bb25cc53a6aec760a\",\n \"score\": \"0.625291\",\n \"text\": \"private void setUpBanner() {\\n try {\\r\\n Bitmap bitmap = getBannerBitmap();\\r\\n if (!EmbeddedValues.IS_PLAY_STORE_BUILD) {\\r\\n saveBanner(bitmap);\\r\\n }\\r\\n\\r\\n // If we successfully got the banner image set it and it's background\\r\\n if (bitmap != null) {\\r\\n m_banner.setImageBitmap(bitmap);\\r\\n m_banner.setBackgroundColor(getMostCommonColor(bitmap));\\r\\n }\\r\\n } catch (IOException e) {\\r\\n // Ignore failure\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc020b3748bf6c7b8cc2f74b5a4e45a5\",\n \"score\": \"0.62459046\",\n \"text\": \"private void display() {\\r\\n\\t\\tsetVisible(true);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d361708d12e9963fd9ba64e556a151f0\",\n \"score\": \"0.6240765\",\n \"text\": \"public void showWallAd1() {\\n\\t\\thandler.post(new Runnable(){\\n\\t @Override\\n\\t public void run(){\\n\\t \\tAdControlManager.showAdcropsWall();\\n\\t }\\n\\t\\t});\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36f6607d9f96209b884f9e9cf9834cfc\",\n \"score\": \"0.6237151\",\n \"text\": \"@Override\\n\\tpublic void show() {\\n\\t\\tbatch = new SpriteBatch();\\n\\t\\t\\n\\t\\t// load up the splash background texture\\n\\t\\tsplashScreen = GameManager.getTexture(\\\"SplashBg.png\\\");\\n\\t\\t\\n\\t\\t// setup the screen width and height variables\\n\\t\\tDEVICE_WIDTH = GameManager.getWidth(false);\\n\\t\\tDEVICE_HEIGHT = GameManager.getHeight(false);\\n\\t\\t\\n\\t\\t// create the game camera object\\n\\t\\tCAMERA = GameManager.getCamera(DEVICE_WIDTH, DEVICE_HEIGHT);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"268bc119f0683d17d16a37c7ac9bbdf9\",\n \"score\": \"0.623255\",\n \"text\": \"public static void showUI()\\n {\\n \\tif (statsShowing)\\n \\t{\\n \\t\\tshowStats();\\n \\t}\\n \\tshowNPCText();\\n \\tshowMenus();\\n \\tshowBags();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0147f0c05be5b30bfce41f43f79115ba\",\n \"score\": \"0.61819917\",\n \"text\": \"private void showScreen(Graphics g) {\\n g.setFont(font);\\n drawPage(g);\\n drawThumNail(g);\\n g.setFont(CustomCanvas.font);\\n iMenu.drawScreen(g, itemFocused, lastitemFocused, iCustomPopup.isMessageFocused(),null);\\n iBannerHandler.drawScreen(g, itemFocused);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"72a4075fd7229d60804476db3fdf62e5\",\n \"score\": \"0.610856\",\n \"text\": \"public void displayUserBanner(User user){\\n ViewGroup bannerForeground = findById(bannerContainer, R.id.banner_foreground);\\n bannerContainer.removeView(bannerForeground);\\n // add user info, logout button\\n View loggedInForeground = inflater.inflate(\\n R.layout.nav_drawer_banner_logged_in, bannerContainer);\\n TextView nameLabel = findById(loggedInForeground, R.id.user_name);\\n TextView emailLabel = findById(loggedInForeground, R.id.user_email);\\n nameLabel.setText(user.getFullName());\\n emailLabel.setText(user.getEmail());\\n findById(loggedInForeground, R.id.logout_button).setOnClickListener(new View.OnClickListener() {\\n @Override\\n public void onClick(View v) {\\n userManager.logout();\\n displayLogoutBanner();\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a0ce9d2d66c54b91f1d5e46918c2728\",\n \"score\": \"0.6079471\",\n \"text\": \"@Override\\n public void run() {\\n displayAds();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b3d5588ddcfd9b28893f4b7aa3a7d736\",\n \"score\": \"0.60744417\",\n \"text\": \"private void display() {\\n refreshMenu();\\n UserInterface.print(getOutput().toString());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8baefaa146d79e81ef5cf426147cac50\",\n \"score\": \"0.6066989\",\n \"text\": \"public void Display() {\\n\\t\\tSystem.out.println(\\\"It's My Mercedes-Benz Car.\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1d7a3aad804388bcd75b96398b72862\",\n \"score\": \"0.60596937\",\n \"text\": \"public void showConnectionScreen() {\\n try {\\n // Load connection overview.\\n FXMLLoader loader = new FXMLLoader();\\n loader.setLocation(MainApp.class.getResource(\\\"view/ConnectionScreen.fxml\\\"));\\n GridPane connectionScreen = (GridPane) loader.load();\\n\\n\\t\\t\\t // Give the controller access to the main app.\\n\\t\\t ConnectionScreenController controller = loader.getController();\\n\\t\\t controller.setMainApp(this);\\n\\n\\t\\t\\t // Set person overview into the center of root layout.\\n\\t\\t\\trootLayout.setCenter(connectionScreen);\\n\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fccce1ba7e4580402bdcfec7cf5f26e8\",\n \"score\": \"0.6018109\",\n \"text\": \"public void displayPanel() {\\n displayPanel = new JPanel();\\r\\n displayLabel = new JLabel();\\r\\n displayLabel.setIcon(logoIcon);\\r\\n displayPanel.setLayout(new BorderLayout());\\r\\n displayPanel.add(displayLabel, BorderLayout.CENTER);\\r\\n displayPanel.setBackground(gray);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9fdffe668b159af099e7826ad00fd195\",\n \"score\": \"0.6005879\",\n \"text\": \"public void show();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14eaf9e5b1fc0918ec67e5a637d0de0d\",\n \"score\": \"0.60032135\",\n \"text\": \"@Override\\r\\n\\tpublic void display() {\\n\\t\\tSystem.out.println(\\\"Welcome\\\");\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"06be6a0b9c5c2df9ca86a9a3930e38ae\",\n \"score\": \"0.600039\",\n \"text\": \"public void run() {\\n\\t\\t\\t\\tUIManager.put(\\\"swing.boldMetal\\\", Boolean.FALSE);\\n\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\tShowScreen();\\n\\t\\t\\t\\t} catch (Exception e) {\\n\\t\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b73e1b9a74e3ae9175f3fe31728b781\",\n \"score\": \"0.59996617\",\n \"text\": \"public void display() {\\n\\t\\thome();\\n\\t\\tdata();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"88d2cb732bd54ff3e86eb9aeb7e0d635\",\n \"score\": \"0.5986566\",\n \"text\": \"@Override\\r\\n\\tpublic void show() {\\n\\t\\t\\r\\n\\t\\tSystem.out.println(\\\"Welcome\\\");\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dceb7f3318ddd84c36031db4e366ca6\",\n \"score\": \"0.5976347\",\n \"text\": \"public void showWelcome() {\\n printLogo();\\n printGreeting();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"449800d5411cf7e6fe0bc09b4ec0863a\",\n \"score\": \"0.5956255\",\n \"text\": \"public void displayEditBanner() {\\n io.print(\\\"===== Edit an Order =====\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31c0b54c6d5880f90cdfb62bf23026fb\",\n \"score\": \"0.594824\",\n \"text\": \"private void display(String agent){\\n display(agent, false);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5cb05039d9b1238232dcde9d03f59def\",\n \"score\": \"0.5947626\",\n \"text\": \"private void displayCover()\\n {\\n try\\n {\\n this.coverNotePane.setContent(new ImageView(new Image(new FileInputStream(this.book.getCoverImagePath()))));\\n }\\n catch (FileNotFoundException | NullPointerException e)\\n {\\n this.coverNotePane.setContent(null);\\n System.err.println(\\\"No cover image.\\\");\\n }\\n\\n this.errorBox.setText(\\\"\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be8b5af4bca5abecaa102bb04ba4fa49\",\n \"score\": \"0.59359\",\n \"text\": \"public void displayBook() {\\n int locX = 100;\\n int locY = 100;\\n final int WIDTH = 100;\\n final int HEIGHT = 100;\\n \\n UI.drawImage(this.image, locX, locY, WIDTH, HEIGHT);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"06be22e8ad20a227b6b2af3deb30b089\",\n \"score\": \"0.592019\",\n \"text\": \"public void DisplayMainMenu()\\n\\t{\\n\\t\\tmFrame.getContentPane().add(mainMenuView, BorderLayout.CENTER);\\t\\n\\t\\tmenuBar.setVisibleTrue();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96480a5a815703426f2d985cae14b5ff\",\n \"score\": \"0.59191394\",\n \"text\": \"public void display ()\\r\\n\\t{}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cfa83ae1200b6a12e9f1cb10247764d5\",\n \"score\": \"0.5919091\",\n \"text\": \"public static void display() {\\n\\t\\t\\tSystem.out.println(\\\"Display is UHD\\\");\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b005a732c749f93d95c4fe843c65ad9\",\n \"score\": \"0.59139115\",\n \"text\": \"@Override\\r\\n\\tpublic void show() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b005a732c749f93d95c4fe843c65ad9\",\n \"score\": \"0.59139115\",\n \"text\": \"@Override\\r\\n\\tpublic void show() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b005a732c749f93d95c4fe843c65ad9\",\n \"score\": \"0.59139115\",\n \"text\": \"@Override\\r\\n\\tpublic void show() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b005a732c749f93d95c4fe843c65ad9\",\n \"score\": \"0.59139115\",\n \"text\": \"@Override\\r\\n\\tpublic void show() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"367424eece7601d1cd130770638f0edd\",\n \"score\": \"0.5909243\",\n \"text\": \"@Override\\r\\n\\tpublic void display() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"367424eece7601d1cd130770638f0edd\",\n \"score\": \"0.5909243\",\n \"text\": \"@Override\\r\\n\\tpublic void display() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"367424eece7601d1cd130770638f0edd\",\n \"score\": \"0.5909243\",\n \"text\": \"@Override\\r\\n\\tpublic void display() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"367424eece7601d1cd130770638f0edd\",\n \"score\": \"0.5909243\",\n \"text\": \"@Override\\r\\n\\tpublic void display() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"649ec6c8e24712027fb8bb431edb8c6d\",\n \"score\": \"0.58928925\",\n \"text\": \"public void display() {\\n\\t\\tSystem.out.println(\\\"== Farm City :: Welcome ==\\\");\\n\\t\\tSystem.out.println(\\\"1. Register\\\");\\n\\t\\tSystem.out.println(\\\"2. Login\\\");\\n\\t\\tSystem.out.println(\\\"3. Exit\\\");\\n\\t\\tSystem.out.println();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d882eb33b7257c8d371058b2dc582096\",\n \"score\": \"0.58895266\",\n \"text\": \"LoopMeBanner(Context context, String appKey) {\\n super(context, appKey);\\n\\n mViewController = new ViewController(this);\\n\\n Utils.init(context);\\n DebugController.init(context);\\n\\n Logging.out(LOG_TAG, \\\"Start creating banner with app key: \\\" + appKey);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"549d1880757389147b88f003f82cca3d\",\n \"score\": \"0.5889055\",\n \"text\": \"public void displayRemoveBanner() {\\n io.print(\\\"===== Remove an Order =====\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3bf421c17726d099586ed11d775889f1\",\n \"score\": \"0.5888572\",\n \"text\": \"@Override\\n\\tpublic void display() {\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dfb1d375c07173b90e84057d575693ae\",\n \"score\": \"0.5888368\",\n \"text\": \"@Override\\n public void onAdLoaded() {\\n adView.setVisibility(View.VISIBLE);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c1ae7a3754357d5da4d1a176a1b9148\",\n \"score\": \"0.5887277\",\n \"text\": \"public void showTitleScreen() {\\n\\t\\tui.titleNamePanel.setVisible(true);\\n\\t\\tui.journeyButtonPanel.setVisible(true);\\n\\t\\t\\n\\t\\t//HIDE THE GAME SCREEN\\n\\t\\tui.mainTextPanel.setVisible(false);\\n\\t\\tui.choiceButtonPanel.setVisible(false);\\n\\t\\tui.playerInfoPanel.setVisible(false);\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ceb58d5671ad3e2e682e719b12bdc56\",\n \"score\": \"0.58845854\",\n \"text\": \"@Override\\n public void onAdLoaded(View view) {\\n\\n //Find the banner in the layout and clear previous creative\\n ((FrameLayout) findViewById(R.id.banner)).removeAllViews();\\n\\n //Find the banner in the layout and show loaded creative in it\\n ((FrameLayout) findViewById(R.id.banner)).addView(view);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44ff949e886976870ec7615e821eac55\",\n \"score\": \"0.58611155\",\n \"text\": \"private void showAllEnollmentScreen() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0d9b52261f0a1f39d60da7ed455a851\",\n \"score\": \"0.58537596\",\n \"text\": \"public void initBallAndBanner(){\\n\\n bouncyBall.setBallX(gameViewWidth / 2);\\n bouncyBall.setBallY(bottomY - bouncyBall.getBallRadius());\\n\\n\\t\\t// initialize the coordinates of the banner\\n // (bannerX,bannerY) is the center of banner\\n\\n\\t\\tbanner.setBannerX(gameViewWidth / 2);\\n\\t\\tbanner.setBannerY(bottomY + banner.getBannerHeight()/2);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95b6f9db7340c04b63fba69d2c4cdcd7\",\n \"score\": \"0.58472127\",\n \"text\": \"@Override\\n\\tpublic void display() {\\n\\t\\tSystem.out.println(\\\"I am a rubber duck\\\");\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"955cbb84979045c55291e58aecec69b3\",\n \"score\": \"0.5846276\",\n \"text\": \"@Override\\n public void present() {\\n _graphics.clear(_backgroudnColor.getBackgroundColor());\\n _backgroudnColor.present();\\n\\n arrowsBackgroundPresent();\\n menuPresent();\\n\\n pointsString.present();\\n _score.present();\\n buttonsPresent();\\n\\n _whiteFlash.present();\\n _blackBands.present();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae63370fe7eab3d1c150564847f21547\",\n \"score\": \"0.584475\",\n \"text\": \"public void showWelcome() {\\n String logo = \\\" ____ _ \\\\n\\\"\\n + \\\"| _ \\\\\\\\ _ _| | _\\\\n\\\"\\n + \\\"| | | | | | | |/ /\\\\n\\\"\\n + \\\"| |_| | |_| | < \\\\n\\\"\\n + \\\"|____/ \\\\\\\\__,_|_|\\\\\\\\_\\\\\\\\\\\\n\\\";\\n System.out.println(logo);\\n\\n String greeting = \\\"Hello! I'm Duk\\\\n\\\"\\n + \\\"What must I do for you?\\\\n\\\";\\n System.out.println(greeting);\\n\\n if (dialogContainer != null) {\\n printDukeDialog(greeting);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98c60997aa3e5647340fa0b6942fb646\",\n \"score\": \"0.5844555\",\n \"text\": \"public void Display() \\r\\n\\t{\\r\\n\\t\\tSystem.out.println(\\\"Type: Gift Card\\\");\\r\\n\\t\\tSystem.out.println(\\\"Price: $\\\" + getPrice());\\r\\n\\t\\tSystem.out.println(\\\"Quantity: \\\" + getQuantity());\\r\\n\\t\\tSystem.out.println(\\\"Title: \\\" + getTitle());\\r\\n\\t\\tSystem.out.println(\\\"Label: \\\" + label);\\r\\n\\t\\tSystem.out.println(\\\"Manufacturer: \\\" + manufacturer);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc7b3d5a372eec846c6760372be99813\",\n \"score\": \"0.5842945\",\n \"text\": \"@Override\\n\\tpublic void show() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc7b3d5a372eec846c6760372be99813\",\n \"score\": \"0.5842945\",\n \"text\": \"@Override\\n\\tpublic void show() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc7b3d5a372eec846c6760372be99813\",\n \"score\": \"0.5842945\",\n \"text\": \"@Override\\n\\tpublic void show() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc7b3d5a372eec846c6760372be99813\",\n \"score\": \"0.5842945\",\n \"text\": \"@Override\\n\\tpublic void show() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc7b3d5a372eec846c6760372be99813\",\n \"score\": \"0.5842945\",\n \"text\": \"@Override\\n\\tpublic void show() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc7b3d5a372eec846c6760372be99813\",\n \"score\": \"0.5842945\",\n \"text\": \"@Override\\n\\tpublic void show() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc7b3d5a372eec846c6760372be99813\",\n \"score\": \"0.5842945\",\n \"text\": \"@Override\\n\\tpublic void show() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"973baaf033d5ecbea6cb21767b54608f\",\n \"score\": \"0.58325034\",\n \"text\": \"@Override protected void startup() {\\r\\n show(new JerboView(this));\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba28ddf3cb43602dc25b4b031f610781\",\n \"score\": \"0.58322984\",\n \"text\": \"private void setBanner(Document doc, Course courseToExport) {\\r\\n Node bannerNode = getNodeWithId(doc, HTML.Tag.DIV.toString(), ID_BANNER);\\r\\n String bannerText = courseToExport.getSubject().toString() + \\\" \\\" + courseToExport.getNumber();\\r\\n bannerText += LINE_BREAK + courseToExport.getTitle();\\r\\n bannerNode.setTextContent(bannerText);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d9e038ffead6ae7c64e4450282ca96af\",\n \"score\": \"0.5828451\",\n \"text\": \"public static void display()\\r\\n\\t{\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa60e210b918bf9299d0285976b5aa7f\",\n \"score\": \"0.5824436\",\n \"text\": \"@Override\\n\\tpublic void show() {\\n\\t\\tbatch = new SpriteBatch();\\n\\t\\ttexture = new Texture(Gdx.files.internal(\\\"data/screens/win.png\\\"));\\n\\t\\tsprite = new Sprite(texture);\\n\\t\\twhite = new BitmapFont(Gdx.files.internal(\\\"data/fonts/white.fnt\\\"), false);\\n\\t\\twhite.setColor(Color.BLACK);\\n\\t\\tatlas = new TextureAtlas(\\\"data/buttons/button.pack\\\");\\n\\t\\tskin= new Skin();\\n\\t\\tskin.addRegions(atlas);\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49f91c4a0321ea030765c80df0497b96\",\n \"score\": \"0.58219075\",\n \"text\": \"@Override\\n\\tpublic void show()\\n\\t{\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b564bf67615c76d3a8fa06656d50bfb0\",\n \"score\": \"0.5819367\",\n \"text\": \"private void show() {\\n\\n StdDraw.show(0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03cbf3d43e2950a9156e3c20ebbc3335\",\n \"score\": \"0.5814493\",\n \"text\": \"@Override\\n public void display() {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8eb344409cff258736d8bb36c0ba3684\",\n \"score\": \"0.5811708\",\n \"text\": \"void willPresentScreen (GADBannerView view);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"92577d08d78e302ea8a7309f674cce97\",\n \"score\": \"0.5809388\",\n \"text\": \"private void displayMenu() {\\n System.out.println(\\\"**********************************\\\");\\n System.out.println(\\\"*** Robocode Tester Menu ***\\\");\\n System.out.println(\\\"**********************************\\\");\\n System.out.println(\\\"*1) Single Battle ***\\\");\\n System.out.println(\\\"**********************************\\\");\\n System.out.println(\\\"*2) Multi Battle ***\\\");\\n System.out.println(\\\"**********************************\\\");\\n System.out.println(\\\"*3 Exit ***\\\");\\n System.out.println(\\\"**********************************\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1e66119d880cf25738e2042181824ab\",\n \"score\": \"0.5803443\",\n \"text\": \"public void displayMenu() {\\n System.out.println(\\\"\\\\nHere's what you can do: \\\");\\n System.out.println(\\\"1. Start a Supertrump Game\\\");\\n System.out.println(\\\"2. View Instructions\\\");\\n System.out.println(\\\"3. About the Supertrump Game\\\");\\n System.out.println(\\\"4. Exit the program\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7911330dc24b2f12a958aaf687472a45\",\n \"score\": \"0.5803277\",\n \"text\": \"public void display()\\n {\\n JFrame myFrame = new JFrame(\\\"BlackJack\\\");\\n myFrame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\\n myFrame.setContentPane(this);\\n myFrame.setPreferredSize(new Dimension(700,550));\\n\\n //Display the window.\\n myFrame.pack();\\n myFrame.setVisible(true);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3f50af2cbff40b7fc7ba9ac8a801e30\",\n \"score\": \"0.5803014\",\n \"text\": \"@Override\\n public void onAdClosed() {\\n showBannerAd();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5622a435e8bee468ff103130a55fcdb5\",\n \"score\": \"0.5802422\",\n \"text\": \"public void show() {\\n show(true);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aadf9257a457f1efda2a1740c2a64994\",\n \"score\": \"0.5791574\",\n \"text\": \"public void displayInterstitial() {\\n if (interstitial.isLoaded()) {\\n interstitial.show();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b1d2956b4544edd368cf40d8ea532d0\",\n \"score\": \"0.57891566\",\n \"text\": \"@Override\\n public void onAdLoaded(Ad ad) {\\n View adView1 = NativeBannerAdView.render(NonPrimaryIcici.this, mNativeBannerAxis1, NativeBannerAdView.Type.HEIGHT_100);\\n LinearLayout nativeBannerAdContainer1 = findViewById(R.id.native_banksiciciNP1);\\n // Add the Native Banner Ad View to your ad container\\n nativeBannerAdContainer1.addView(adView1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"827baf7f5ea928465066ba6ab02fe649\",\n \"score\": \"0.5787498\",\n \"text\": \"@Override\\r\\n\\tpublic void show()\\r\\n\\t{\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c03358f203262b0a1f456116563410ff\",\n \"score\": \"0.5787493\",\n \"text\": \"public void display()\\n\\t{\\n\\t\\tMinecraft.getMinecraft().getSoundHandler().stopSounds();\\n\\t\\tMinecraft.getMinecraft().displayGuiScreen(GuiHandler.fake_menu);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e3c828adeabd29b4dff5fbf63d764bc\",\n \"score\": \"0.5785109\",\n \"text\": \"public void display();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e3c828adeabd29b4dff5fbf63d764bc\",\n \"score\": \"0.5785109\",\n \"text\": \"public void display();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e3c828adeabd29b4dff5fbf63d764bc\",\n \"score\": \"0.5785109\",\n \"text\": \"public void display();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e3c828adeabd29b4dff5fbf63d764bc\",\n \"score\": \"0.5785109\",\n \"text\": \"public void display();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e3c828adeabd29b4dff5fbf63d764bc\",\n \"score\": \"0.5785109\",\n \"text\": \"public void display();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e3c828adeabd29b4dff5fbf63d764bc\",\n \"score\": \"0.5785109\",\n \"text\": \"public void display();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b8781d7b5ac99282939265e9457d6dc\",\n \"score\": \"0.5784681\",\n \"text\": \"@Override\\r\\n public void show() {\\r\\n this.showTitlePart(UP_TITLE);\\r\\n this.showTitlePart(MIDDLE_TITLE);\\r\\n this.showTitlePart(DOWN_TITLE);\\r\\n this.showPedestal();\\r\\n this.showColumns();\\r\\n this.showStaircase();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9bf743a16ac6551af0062c6df2c9dbb5\",\n \"score\": \"0.57830113\",\n \"text\": \"public void showSplash() {\\r\\n JPanel content = (JPanel)getContentPane();\\r\\n content.setBackground(Color.white);\\r\\n\\r\\n // Set the window's bounds, centering the window\\r\\n int width = 600;\\r\\n int height =338;\\r\\n Dimension screen = Toolkit.getDefaultToolkit().getScreenSize();\\r\\n int x = (screen.width-width)/2;\\r\\n int y = (screen.height-height)/2;\\r\\n setBounds(x,y,width,height);\\r\\n\\r\\n // Build the splash screen\\r\\n JLabel label = new JLabel(new ImageIcon(\\\"pic\\\\\\\\LOGAN.gif\\\"));\\r\\n JLabel copyrt = new JLabel\\r\\n (\\\"LOGAN\\\", JLabel.CENTER);\\r\\n copyrt.setFont(new Font(\\\"Sans-Serif\\\", Font.BOLD, 12));\\r\\n content.add(label, BorderLayout.CENTER);\\r\\n content.add(copyrt, BorderLayout.SOUTH);\\r\\n Color oraRed = new Color(156, 20, 20, 255);\\r\\n content.setBorder(BorderFactory.createLineBorder(oraRed, 3));\\r\\n\\r\\n // Display it\\r\\n setVisible(true);\\r\\n\\r\\n // Wait a little while, maybe while loading resources\\r\\n try { Thread.sleep(duration); } catch (Exception e) {}\\r\\n\\r\\n setVisible(false);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"694b952005cbacf05dcb26b13d0925a8\",\n \"score\": \"0.57771164\",\n \"text\": \"boolean greystripeBannerAutoload();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73a6dac807a13c721daa0cef045f758c\",\n \"score\": \"0.5776752\",\n \"text\": \"public void showLogo();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"162aef24a9aed72c38bc6f62d078b74b\",\n \"score\": \"0.5764814\",\n \"text\": \"public void displayInterstitial() {\\n if (interstitial.isLoaded()) {\\n interstitial.show();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"162aef24a9aed72c38bc6f62d078b74b\",\n \"score\": \"0.5764814\",\n \"text\": \"public void displayInterstitial() {\\n if (interstitial.isLoaded()) {\\n interstitial.show();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ca42781ab61c88c11eac3c4379819df\",\n \"score\": \"0.5761666\",\n \"text\": \"public void show() {\\n show(DEFAULT_CONTROLLER_TIMEOUT);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48c3e14c74dcb197b0c06020aae15dd5\",\n \"score\": \"0.5753016\",\n \"text\": \"public void display() {\\n this.displayBanner();\\n \\n // prompt the player to enter their name Retrieve the name of the player\\n String playersName = this.getInput();\\n \\n this.doAction(playersName);\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cfecfa8da77fbcc81ef7cb6437c57847\",\n \"score\": \"0.5749766\",\n \"text\": \"@Override\\n public void onAdLoaded(Ad ad) {\\n View adView1 = NativeBannerAdView.render(NonPrimaryIcici.this, mNativeBannerAxis2, NativeBannerAdView.Type.HEIGHT_100);\\n LinearLayout nativeBannerAdContainer1 = findViewById(R.id.native_banksiciciNP2);\\n // Add the Native Banner Ad View to your ad container\\n nativeBannerAdContainer1.addView(adView1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e5dd6de8538a992ce56a07ad595b481\",\n \"score\": \"0.57303214\",\n \"text\": \"@Override\\n\\tpublic void show() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e5dd6de8538a992ce56a07ad595b481\",\n \"score\": \"0.57303214\",\n \"text\": \"@Override\\n\\tpublic void show() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e5dd6de8538a992ce56a07ad595b481\",\n \"score\": \"0.57303214\",\n \"text\": \"@Override\\n\\tpublic void show() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e5dd6de8538a992ce56a07ad595b481\",\n \"score\": \"0.57303214\",\n \"text\": \"@Override\\n\\tpublic void show() {\\n\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983796,"cells":{"query_id":{"kind":"string","value":"688d0223b38c7d35b7204be9f77a2639"},"query":{"kind":"string","value":"1. Usage Node as linkedlist node for hashmap entry for quick access 2. DLL so we can add, remove at O(1) 3. Use fake node as DLL head, tail to avoid edge case check!"},"positive_passages":{"kind":"list like","value":[{"docid":"988ff52b27771081a1f7318e3c746e29","score":"0.0","text":"public LRUCache(int capacity) {\n size = 0;\n cap = capacity;\n cache = new HashMap();\n // Usage of fake node to avoid edge cases check!\n head = new Node();\n tail = new Node();\n head.next = tail;\n tail.prev = head;\n }","title":""}],"string":"[\n {\n \"docid\": \"988ff52b27771081a1f7318e3c746e29\",\n \"score\": \"0.0\",\n \"text\": \"public LRUCache(int capacity) {\\n size = 0;\\n cap = capacity;\\n cache = new HashMap();\\n // Usage of fake node to avoid edge cases check!\\n head = new Node();\\n tail = new Node();\\n head.next = tail;\\n tail.prev = head;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"c6ed785dd47819e175303f8c8b280386","score":"0.6234371","text":"private DLL_node add(DLL_node head) throws IOException {\r\n DLL_node temp = new DLL_node();\r\n temp.set_next(head);\r\n if(head != null)\r\n head.set_previous(temp);\r\n temp.set_previous(null);\r\n head = temp;\r\n return head;\r\n }","title":""},{"docid":"c487a8ad20efb5e927d8fc22542b97f1","score":"0.6059705","text":"@Override\r\n\tpublic void addNode(node_data n) \r\n\t{\t\t\r\n\t\tif(!nodesInGraph.containsKey(n.getKey()))\r\n\t\t{\r\n\t\t\tnodesInGraph.put(n.getKey(), n);\r\n\t\t\tpointers.put(n.getKey(), new LinkedList<node_data>());\r\n\t\t\tneighbors.put(n.getKey(), new LinkedList<node_data>());\r\n\t\t\tmcCounter++;\r\n\t\t}\r\n\t}","title":""},{"docid":"c0024b590803282eb4a718cf53ce201d","score":"0.60418713","text":"private node<T> reUse(Object data){\n node<T> current;\n current = Dhead;\n if(Dsize>1){\n for(int i=0; i<Dsize-2 ;++i){\n current=current.next;\n }\n node<T> temp;\n temp=current.next;\n current.next=null;\n Dsize--;\n temp.data=(T) data;\n return temp;\n }\n else if(Dsize==1){\n Dsize--;\n node<T> temp;\n temp=Dhead;\n Dhead=null;\n return temp;\n }\n else{\n return null;\n }\n \n \n }","title":""},{"docid":"3732bb90a253cf94356c546ad4d9030f","score":"0.6040222","text":"private void add(LRUCache.Node node) {\n LRUCache.Node next = head.next;\n head.next = node;\n node.next = next;\n node.prev = head;\n next.prev = node;\n }","title":""},{"docid":"0b48ac536f647a73b69305d5c57b0390","score":"0.60131043","text":"@Override\n\t\tboolean insert(HashPair item) {\n\n\t\t\tDLList bucketList = hashTable[hash(item.key,hashTable.length)];\n\t\t\tDLNode temp = bucketList.search(item);\n\t\t\t//System.out.println(bucketList);\n\t\t\t\n\t\t\tif(temp != null)\n\t\t\t\tbucketList.remove(temp);\n\t\t\t\n\t\t\t\tbucketList.append(new DLNode(item));\t\t\t \n\t\t\t\treturn true;\n\t\t\t\n\t\t\t\n\t\t}","title":""},{"docid":"366de00af7a208bdfa36463e38ad89eb","score":"0.5991759","text":"public Node copyRandomList2(Node head) {\n\n Map<Node, Node> map = new HashMap<>();\n\n Node curr = head;\n while (curr != null) {\n map.put(curr, new Node(curr.val, null, null));\n curr = curr.next;\n }\n\n curr = head;\n while (curr != null) {\n Node copy = map.get(curr);\n copy.next = map.get(curr.next);\n copy.random = map.get(curr.random);\n\n curr = curr.next;\n }\n\n return map.get(head);\n }","title":""},{"docid":"a387333c846c998e8a1e6c6ad5fb5c90","score":"0.58868235","text":"public LNode cloneWithHashMap(LNode head) {\n\t\tMap<LNode,LNode> copyMap= new HashMap<>();\n\t\tLNode curr = head;\n\t\twhile(curr!=null) {\n\t\t\tLNode node = new LNode(curr.val);\n\t\t\tcopyMap.put(curr,node);\t\n\t\t\tcurr = curr.next;\n\t\t}\n\t\tcurr = head;\n\t\twhile(curr!=null) {\n\t\t\tLNode copy = copyMap.get(curr);\n\t\t\tcopy.next = copyMap.get(curr.next);\n\t\t\tcopy.random = copyMap.get(curr.random);\n\t\t\tcurr = curr.next;\n\t\t}\n\t\treturn copyMap.get(head);\n\t\t\n\t}","title":""},{"docid":"e0d76c6102ececf9d272a1a0bbceaf00","score":"0.5877029","text":"protected AbstractHashedMap.HashEntry createEntry(AbstractHashedMap.HashEntry next, int hashCode, Object key, Object value) {\n/* 273 */ return new LinkEntry(next, hashCode, key, value);\n/* */ }","title":""},{"docid":"1693a6fcf07be0431b41ad1c8f4e427c","score":"0.584042","text":"public Node copyRandomList(Node head) {\n HashMap<Node, Node> visitedHash = new HashMap<Node, Node>();\n Node dummy = new Node();\n\n //pointer to traverse the list\n Node cur = dummy;\n //traverse the original list\n while(head != null){\n //copy the current node if necessary\n if(!visitedHash.containsKey(head)){\n //visitedHash.put(head, new Node(head.val, null, null));\n visitedHash.put(head, new Node());\n visitedHash.get(head).val = head.val;\n// System.out.println(head.val);\n// System.out.println(visitedHash.get(head).val);\n\n }\n\n\n cur.next = visitedHash.get(head);\n //copy the random node if necessary\n if(head.random != null){\n if(!visitedHash.containsKey(head.random)){\n visitedHash.put(head.random, new Node(head.random.val, null, null));\n }\n cur.next.random = visitedHash.get(head.random);\n }\n\n head = head.next;\n cur = cur.next;\n\n }\n\n return dummy.next;\n }","title":""},{"docid":"05c453950685570cc8513b1bedfe2180","score":"0.58339083","text":"public void put(int key, int value) {\n int hash = hash(key);\n if(null == map[hash]){\n map[hash] = new ListNode(Integer.MIN_VALUE,Integer.MIN_VALUE);\n }\n ListNode start = map[hash], current = start.next, prev = start;\n if(null == current){\n start.next = new ListNode(key,value);\n return;\n }\n boolean found = false;\n while(null != current){\n if(current.key == key){\n found = true;\n current.value = value;\n return;\n }\n prev = current;\n current = current.next;\n }\n if(!found){\n prev.next = new ListNode(key,value);\n }\n }","title":""},{"docid":"f3bee7c7f0cf82c022c0eaac1dafb80e","score":"0.58307105","text":"public RandomListNode copyRandomList(RandomListNode head) {\n Map<RandomListNode, RandomListNode> map = new HashMap();\n RandomListNode node = head;\n\n //loop for the first time: copy the node themselves with only labels\n while (node != null) {\n map.put(node, new RandomListNode(node.label));\n node = node.next;\n }\n\n //loop for the second time: copy random and next pointers\n node = head;\n while (node != null) {\n map.get(node).next = map.get(node.next);\n map.get(node).random = map.get(node.random);\n node = node.next;\n }\n\n return map.get(head);\n }","title":""},{"docid":"a75cdf2879b430185dfdaf419153ca27","score":"0.5810319","text":"private static Node deleteDupsWithDataStructureInPlaceMod(Node node) {\n if(node == null) return null;\n if(node.next == null) return node;\n\n // create set to maintain all distinct values and use to check for deletion candidates\n Set<Integer> seen = new HashSet<>();\n\n Node head = node; // maintain head to return\n Node prev = null;\n\n while(node != null){\n if(seen.contains(node.value)){\n prev.next = node.next; // this is fine because the next is either another node or the end.\n }\n else{\n seen.add(node.value);\n }\n prev = node;\n node = node.next;\n }\n\n return head;\n }","title":""},{"docid":"563ec60f856ef545e7bcc7649aa0b173","score":"0.57952416","text":"private final Node registerNode(Node newNode)\n/* */ {\n/* 140 */ if (this.state == State.BUILDING_FAST) {\n/* 141 */ return newNode;\n/* */ }\n/* */ \n/* 144 */ Node oldNode = (Node)this.nodes.get(newNode);\n/* 145 */ if (oldNode != null) {\n/* 146 */ return oldNode;\n/* */ }\n/* */ \n/* */ \n/* 150 */ oldNode = (Node)this.nodes.put(newNode, newNode);\n/* 151 */ assert (oldNode == null);\n/* 152 */ return newNode;\n/* */ }","title":""},{"docid":"b282c3c50196fe270030acfb98eaac5d","score":"0.57813144","text":"public static Node deleteDups(Node head){\n\n\n Node temp = head, prev;\n HashMap<Integer, Boolean> hmap = new HashMap<>();\n while(temp!=null) {\n hmap.put(temp.data, true);\n temp = temp.next;\n }\n temp = head.next;\n prev = head;\n while(temp!=null){\n if(hmap.containsKey(temp.data)){\n if(hmap.get(temp.data)==true){\n hmap.put(temp.data, false);\n }\n else{\n prev.next = temp.next;\n prev = temp;\n }\n }\n else {\n prev = temp;\n }\n temp = temp.next;\n\n }\n return head;\n }","title":""},{"docid":"bb78e174923678a3aad59015863bdedc","score":"0.5776131","text":"public interface IFPTree_Node<T> {\n\n Map<T, IFPTree_Node> getNodes();\n\n int getCount();\n\n void setCount(int newCount);\n\n int getPatternCount ();\n\n T getName();\n\n IFPTree_Node<T> getLink ();\n\n void setLink (IFPTree_Node<T> link);\n\n IFPTree_Node<T> getParent ();\n\n HashMap<LinkedList<IFPTree_Node<T>>, Integer> getAncestors ();\n\n void updateCount ();\n}","title":""},{"docid":"3c9a1a73da87d86946984e069cbca91b","score":"0.57706153","text":"public static Node solution(Node head) {\r\n if (head == null) return null;\r\n Node copyHead = new Node(0), curr = copyHead;\r\n int i = 0;\r\n Map<Node, Integer> oldNodeToIndexMap = new HashMap<>();\r\n List<Node> oldRandomList = new ArrayList<>();\r\n List<Node> newNodeList = new ArrayList<>();\r\n // first round only create the new deep copy of next\r\n while (head != null) {\r\n curr.next = new Node(head.val);\r\n oldNodeToIndexMap.put(head, i);\r\n oldRandomList.add(head.random);\r\n curr = curr.next;\r\n newNodeList.add(curr);\r\n head = head.next;\r\n ++i;\r\n }\r\n for (i = 0; i < oldRandomList.size(); ++i) {\r\n Node randomNode = oldRandomList.get(i);\r\n if (randomNode == null) continue;\r\n Integer index = oldNodeToIndexMap.get(randomNode);\r\n if (index != null) {\r\n newNodeList.get(i).random = newNodeList.get(index);\r\n }\r\n }\r\n return copyHead.next;\r\n }","title":""},{"docid":"0b41c6837f03f64ab8bc85a4eac4116e","score":"0.57663214","text":"private static void traverseAndAddToLinkedList(ListNode res) {\n\t\n }","title":""},{"docid":"3b62bb921b58e2d19eafd4a24e9e4aeb","score":"0.5762674","text":"public void NNLLookup(int TarNode){\n\t\t\n\t}","title":""},{"docid":"0769b2533b9cba92f328860d77d4dcd0","score":"0.5755117","text":"private void addNode(DoubleLinkedNode node) {\n\n node.pre = head;\n node.post = head.post;\n\n head.post.pre = node;\n head.post = node;\n }","title":""},{"docid":"d1145ca31ef571a49a62083096bf05d5","score":"0.5745305","text":"private static Node deleteDupsWithoutDataStructure(Node node){\n if(node == null || node.next == null) return node;\n\n Node head = node;\n\n while(node != null){\n int val = node.value;\n\n Node runnerPrev = node;\n Node runner = node.next;\n while(runner != null){\n if(runner.value == val){\n runnerPrev.next = runner.next;\n runner = runnerPrev;\n }\n\n runnerPrev = runner;\n runner = runner.next;\n\n }\n node = node.next;\n }\n return head;\n }","title":""},{"docid":"54305079fe46ca55a008c0f19a110558","score":"0.57357675","text":"public static void main(String[] args) {\n\n// List<Integer> list = new LinkedList<>();\n// list.add(20);\n// list.add(0,10);\n// list.add(30);\n// list.add(list.size(), 40);\n//// list.remove(1);\n// System.out.println(list);\n\n HashMap<String, String> stringStringHashMap = new HashMap<>();\n// new LinkedList<>()\n\n\n }","title":""},{"docid":"5fd50c843b11647e97058416db8cfde6","score":"0.5727919","text":"@Test\n\tpublic void testSinglyLinkedList(){\n\t\tSystem.out.println(\"Length \"+linkedList.lengthOfLinkedList());\n\t\tlinkedList.traverse();\n\t\tlinkedList.addAfter(21, 90);\n\t\tSystem.out.println(\"Length \"+linkedList.lengthOfLinkedList());\n\t\tlinkedList.traverse();\n\t\tlinkedList.addAfter(67, 42);\n\t\tSystem.out.println(\"Length \"+linkedList.lengthOfLinkedList());\n\t\tlinkedList.traverse();\n\t\tlinkedList.deleteAfter(49);\n\t\tSystem.out.println(\"Length \"+linkedList.lengthOfLinkedList());\n\t\tlinkedList.traverse();\n\t\tSystem.out.println(\"Mid Node Brute Method \"+linkedList.findMidNodeBruteMethod().getValue());\n\t\tSystem.out.println(\"Mid Node \"+linkedList.findMidNode().getValue());\n\n\t\t\n\t\tlinkedList.deleteFront();\n\t\tSystem.out.println(\"Length \"+linkedList.lengthOfLinkedList());\n\t\tlinkedList.traverse();\n\t\tSystem.out.println(\"Mid Node Brute Method \"+linkedList.findMidNodeBruteMethod().getValue());\n\t\tSystem.out.println(\"Mid Node \"+linkedList.findMidNode().getValue());\n\t\t\n\t\tlinkedList.reverse();\n\t\tlinkedList.traverse();\n\t\t\n\t\tlinkedList.swap(12, 45);\n\t\tlinkedList.traverse();\n\t\t\n\t\t// creating a loop in linked list\n\t\tSystem.out.println(\"Head = \"+linkedList.head.getValue() );\n\t\tSystem.out.println(\"Tail = \"+linkedList.tail.getValue() );\n\t\tlinkedList.tail.setNextRef(linkedList.head.getNextRef().getNextRef());\n\t\tlinkedList.detectLoop();\n\t\tlinkedList.traverse();\n\n\t}","title":""},{"docid":"0e175e61e6466250beed84d01969b624","score":"0.5719096","text":"public static void main(String[] args) {\n\t\t\r\n\tSinglyLinkedList linkedList = new SinglyLinkedList();\r\n\t\r\n\tfor (int i = 1; i < 8; i++) {\r\n\t\tlinkedList.insertAtEnd(i);\r\n\t}\r\n\t\r\n\t\r\n\tint k = 3;\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t// Solution with one pointer and two traverser\r\n\t\r\n//\tint n = 0;\r\n//\t\r\n//\tNode node = linkedList.getHead();\r\n//\t\r\n//\twhile(node != null) {\r\n//\t\tn++;\r\n//\t\tnode = node.getNext();\r\n//\t}\r\n//\t\r\n//\tif(n-k+1>0) {\r\n//\t\tnode = linkedList.getHead();\r\n//\t\tint i = 1;\r\n//\t\twhile(i<=n-k) {\r\n//\t\t\tnode = node.getNext();\r\n//\t\t\ti++;\r\n//\t\t}\r\n//\t\t\r\n//\t\tSystem.out.println(node.getData());\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t// Solution with two pointers and one traverser\r\n\t\r\n\t\r\n\tlinkedList.display();\r\n\tSystem.out.println();\r\n\t\r\n\tNode fast = linkedList.getHead();\r\n\tNode slow = linkedList.getHead();\r\n\t\r\n\t\r\n\tint i = 1;\t\r\n\twhile(i<k) {\r\n\t\tfast = fast.getNext();\r\n\t\ti++;\r\n\t}\r\n\t\r\n\twhile(fast.getNext() != null) {\r\n\t\t\r\n\t\tfast = fast.getNext();\r\n\t\tslow = slow.getNext();\r\n\t\t\r\n\t}\r\n\t\r\n\tlinkedList.display();\r\n\tSystem.out.println();\r\n\t\r\n\t \tSystem.out.println(slow.getData());\r\n\t}","title":""},{"docid":"802c636992675f31c3006b1406e5fb5a","score":"0.5707903","text":"public HashNode<K,V> getListNode(K key){\n\n\t\t// ADD CODE BELOW HERE\n\n\t\tHashNode <K, V> curr = head;\n\t\twhile(curr != null) {\n\t\t\tif(curr.getKey().equals(key)) {\n\t\t\t\treturn curr;\n\t\t\t}\n\t\t\tcurr=curr.getNext();\n\n\t\t}\n\t\treturn null;\n\n\t\t// ADD CODE ABOVE HERE\n\t}","title":""},{"docid":"84589eb8bee2873f42d0b6acdad0ccf4","score":"0.57006705","text":"@Override\r\n public ListNode searchNode(Integer key) {\r\n\r\n\t//Your code goes here\r\n if(!contains(key)){\r\n return null;\r\n }\r\n if(root.key==key){//if its by the front already or is single node\r\n ListNode placeholder=root;\r\n placeholder=new ListNode(root.key, root.data);\r\n calculateData();\r\n return placeholder;\r\n }\r\n else{\r\n ListNode placeholder;\r\n ListNode trans= root;\r\n ListNode prev=trans;\r\n ListNode prev2=prev;\r\n while(trans.key!=key){\r\n prev2=prev;\r\n prev=trans;\r\n trans=trans.next;\r\n }\r\n if(prev2!=prev){\r\n //placeholder=trans;\r\n placeholder=new ListNode(trans.key, trans.data);\r\n prev.next=trans.next;\r\n prev2.next=trans;\r\n trans.next=prev;\r\n //calculateData();\r\n //return placeholder\r\n }\r\n else{\r\n //placeholder=trans;\r\n placeholder=new ListNode(trans.key, trans.data);\r\n prev.next=trans.next;\r\n trans.next=prev;\r\n root=trans;\r\n //calculateData();\r\n\r\n\r\n }\r\n\r\n\r\n calculateData();\r\n return placeholder;\r\n\r\n\r\n }\r\n\r\n }","title":""},{"docid":"a29625efbbb06852599e39193d014d3d","score":"0.56777936","text":"public static void deleteDuplicate(Node node){\r\n\t\tHashtable<Integer, Boolean> table = new Hashtable<Integer, Boolean>();\r\n\t\tNode runner = node;\r\n\t\tif(node == null) return;\r\n\t\ttable.put(node.data, true);\r\n\t\t\r\n\t\twhile(runner.next!=null){\r\n\t\t\tif(table.contains(runner.next.data)){\r\n\t\t\t\trunner.next = runner.next.next;\r\n\t\t\t}\r\n\t\t\telse if(!table.contains(runner.next.data)){\r\n\t\t\t\ttable.put(runner.next.data, true);\r\n\t\t\t}\r\n\t\t\trunner = runner.next;\r\n\t\t}\r\n\t}","title":""},{"docid":"92a09291c802346b307a2d108914dd25","score":"0.5669202","text":"private void addNode(DLinkedNode node) {\n node.prev = head;\n node.next = head.next;\n\n head.next.prev = node;\n head.next = node;\n }","title":""},{"docid":"2c7d117c4754dd84741bccda599e6d8e","score":"0.5649626","text":"public void set(int key, int value) {\r\n if (map.containsKey(key)) {\r\n DLLNode oldNode = map.get(key);\r\n oldNode.value = value;\r\n remove(oldNode);\r\n setHead(oldNode);\r\n } else {\r\n // insert\r\n DLLNode newNode = new DLLNode(key, value);\r\n if (map.size() >= capacity) {\r\n map.remove(end.key);\r\n remove(end);\r\n }\r\n setHead(newNode);\r\n map.put(key, newNode);\r\n }\r\n }","title":""},{"docid":"4e4b152703cb6760e46275a8ae162dc3","score":"0.564656","text":"private void addNode(DoublyLinkedList node) {\n node.prev = head;\n }","title":""},{"docid":"f9155f735d23d55a0f86394a4708effc","score":"0.56399393","text":"public static void main(String [] args)\n {\n Node n1 = new Node(new Integer(6));\n Node n2 = new Node(new Integer(11));\n\n /* \"hook up\" the nodes\n head will be a a new Node refence \n referring to the to the first node \n (containing 6)\n the next/last node will be the node containing 11\n */\n Node head;\n n1.setNext(n2);\n head=n1;\n \n /* insert a new Node containing 13 into the list\n as the 2nd element\n */\n Node newNode = new Node(new Integer(13), head.getNext());\n head.setNext(newNode);\n n1=n2=null;\n \n /* insert a new Node, containing 10 at the end of the\n list \n To do this, create a new Node reference, called prev.\n prev will start at head. as long as prev->next does\n not equal null, keep moving down the list. When \n the loop ends, prev will refer to the last item \n in the list. How do you use this to add the new node?\n */\n newNode = new Node(new Integer(10));\n Node prev=head;\n while (prev.getNext() != null)\n {\n prev = prev.getNext();\n }\n prev.setNext(newNode); // next already contains null\n /* complete method displayList below \n test it out by displaying current list*/\n// displayList(head);\n /* write a loop that searches the list (starting at head) for\n The first occurrence of the Node containing Integer 11. \n At the end of the loop, a Node reference curr should hold a\n reference to the Node containing 11 or null if no such Node\n exists. Hint : this should be helpful in your find method of \n your linked list.\n */ \n// Integer toFind = new Integer(11); \n// Node curr = head;\n// while (!curr.getItem().equals(toFind))\n// {\n// curr = curr.getNext();\n// }\n \n /* now modify the previous loop with also manage a prev reference.\n At the end of the loop, curr will hold a reference to the desired \n Node, prev will hold a reference to the Node that precedes the Node\n reference by curr.\n */\n Integer toFind = new Integer(11); \n Node curr = head;\n prev = null;\n while (!curr.getItem().equals(toFind))\n {\n prev = curr;\n curr = curr.getNext();\n }\n\n \n }","title":""},{"docid":"eb21a6bd1da19814f144a39644db0edd","score":"0.5639303","text":"public RandomListNode copyRandomList(RandomListNode head) {\n HashMap<RandomListNode, RandomListNode> map = new HashMap<>();\n RandomListNode cur = head;\n while (cur != null) { // copy points\n map.put(cur, new RandomListNode(cur.label));\n cur = cur.next;\n }\n cur = head;\n while (cur != null) { // connect lines\n map.get(cur).next = map.get(cur.next);\n map.get(cur).random = map.get(cur.random);\n cur = cur.next;\n }\n return map.get(head);\n}","title":""},{"docid":"c5115d4b584f90753765c50c1a503796","score":"0.5629344","text":"interface ListNode {\n int getItem();\n ListNode getNext();\n void setNext(ListNode next);\n }","title":""},{"docid":"4492add27d498e09cf2e4e598960052a","score":"0.5619852","text":"Map<Long, NodeEntry> getNodeMap();","title":""},{"docid":"ad8ff91f869a047ec6ad25cc51550f6a","score":"0.5617803","text":"public ListNode deleteDuplicatesII(ListNode head) {\n //刚开始可以用hashmap存起来，然后在map里的都删除，但这样显得没啥技术含量\n //这个版本感觉写的不简洁啊\n if(head==null||head.next==null)\n return head;\n ListNode first=new ListNode(Integer.MIN_VALUE);\n ListNode p=first;\n ListNode q=head;\n ListNode qq=head.next;\n while(qq!=null){\n if(qq.val==q.val){\n while(qq!=null && qq.next!=null && qq.val==qq.next.val)\n qq=qq.next;\n p.next=qq.next;\n q=qq!=null?qq.next:null;\n qq=q!=null?q.next:null;\n }else{\n p.next=q;\n p=p.next;\n q=qq;\n qq=qq.next;\n }\n }\n return first.next;\n\n }","title":""},{"docid":"271ff873e6187696e6ef4137c94b1bca","score":"0.55998003","text":"private void addHead(Node node){\n Node after = head.next;\n head.next = node;\n node.prev = head;\n node.next = after;\n after.prev = node;\n }","title":""},{"docid":"19638fbd77698d30936d70a2cb93c09c","score":"0.5593997","text":"public void inc(String key) {\n\t\t\tInteger cnt = map.get(key);\n\t\t\tif (cnt == null) {\n\t\t\t\tcnt = 1;\n\t\t\t\tListNode listNode = listNodeMap.get(cnt);\n\t\t\t\tif (listNode == null) {\n\t\t\t\t\tlistNode = new ListNode();\n\t\t\t\t\tlistNodeMap.put(cnt, listNode);\n\t\t\t\t\tif (tail == null) {\n\t\t\t\t\t\t// tail ==null，那head肯定==null\n\t\t\t\t\t\thead = tail = listNode;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttail.next = listNode;\n\t\t\t\t\t\tlistNode.pre = tail;\n\t\t\t\t\t\ttail = listNode;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tlistNode.keys.add(key);\n\t\t\t} else {\n\t\t\t\t// 处理原来这个key所在的listNode;\n\t\t\t\tListNode listNode = listNodeMap.get(cnt);\n\t\t\t\tListNode pre = listNode.pre;\n\t\t\t\tlistNode.keys.remove(key);\n\t\t\t\tif (listNode.keys.size() <= 0) {\n\t\t\t\t\tthis.delListNode(listNode, cnt);\n\t\t\t\t}\n\t\t\t\tcnt++;\n\t\t\t\tlistNode = listNodeMap.get(cnt);\n\t\t\t\tif (listNode == null) {\n\t\t\t\t\tlistNode = new ListNode();\n\t\t\t\t\tlistNodeMap.put(cnt, listNode);\n\t\t\t\t\tif (pre == null) {\n\t\t\t\t\t\t// 当前是最大的元素\n\t\t\t\t\t\tif (head != null) {\n\t\t\t\t\t\t\tlistNode.next = head;\n\t\t\t\t\t\t\thead.pre = listNode;\n\t\t\t\t\t\t}\n\t\t\t\t\t\thead = listNode;\n\t\t\t\t\t\tif (tail == null) {\n\t\t\t\t\t\t\ttail = listNode;\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tListNode next = pre.next;\n\t\t\t\t\t\tif (next != null) {\n\t\t\t\t\t\t\tlistNode.pre = pre;\n\t\t\t\t\t\t\tlistNode.next = next;\n\t\t\t\t\t\t\tnext.pre = listNode;\n\t\t\t\t\t\t\tpre.next = listNode;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tlistNode.pre = pre;\n\t\t\t\t\t\t\tlistNode.next = null;\n\t\t\t\t\t\t\tpre.next = listNode;\n\t\t\t\t\t\t\ttail = listNode;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tlistNode.keys.add(key);\n\t\t\t}\n\n\t\t\tmap.put(key, cnt);\n\t\t}","title":""},{"docid":"4a76b164283400ae3f09968400676fa6","score":"0.5592055","text":"Node<K,V> newNode(int hash, K key, V value, Node<K,V> next) {\n return new Node<>(hash, key, value, next);\n }","title":""},{"docid":"e9ff9a5a6b98dff0caf352fc406c87af","score":"0.5584462","text":"public interface List<T extends Comparable<T>> extends Iterable<T> {\n\n\n class Node<T> {\n public T data;\n public Node<T> next;\n\n public Node(T value) {\n this.data = value;\n this.next = null;\n }\n\n @Override\n public String toString(){\n return String.valueOf(data);\n }\n }\n\n void deleteAt(int pos);\n\n void insertBefore(T value, int pos);\n\n void insertAfter(T value, int pos);\n\n void appendBack(T value);\n\n //brute_n_3 force\n void reverseBrute();\n\n void reverse();\n\n void clear();\n\n Node deleteElements(int val);\n\n void reverseStack();\n\n T get(int index);\n\n void print();\n\n int size();\n\n void introduceCycleForTest();\n\n Node findCycle();\n\n T set(int j, T t);\n\n void toArray(T[] array);\n\n Node<T> deleteFront();\n\n Node<T> deleteBack();\n\n void appendFront(T t);\n\n boolean orderedElementsFound(List<T> subList);\n\n void insertInOrder(T data);\n}","title":""},{"docid":"0676fcd7789649253f7d7b015de37ffa","score":"0.55826443","text":"private void evict(){\n if(head == null) return;\n map.remove(head.key);\n if(head == tail){\n head = null;\n tail = null;\n }else{\n Node temp = head.next;\n temp.prev = null;\n head.next = null;\n head = temp;\n }\n num--;\n }","title":""},{"docid":"9ad5b1e951eee71dcd11df22766dc0b0","score":"0.55714583","text":"private Node link(Node n1, Node n2) {\n if (n1 == null) return n2;\n else if (n2 == null) return n1;\n else if (n1 == n2) return n1;\n \n int c = n1.key.compareTo(n2.key);\n if (c < 0) {\n addChild(n1, n2);\n return n1;\n } \n else {\n addChild(n2, n1);\n return n2;\n }\n }","title":""},{"docid":"ee3a1906c82039ed5c40fb79af0eeee9","score":"0.5559335","text":"public void addAtHead(int val) {\n ListNode newHead = new ListNode(val);\n newHead.next = head;\n head = newHead;\n}","title":""},{"docid":"de5b4aa320226d97f61ca73943d84b41","score":"0.55586135","text":"private void rehash() {\n System.out.println(\"brb busy...Re-Hashing\");\n REAL_SIZE = 0;\n MapNode<T>[] temp = bucket;\n bucket = new MapNode[bucket.length*2];\n for (int i = 0; i < temp.length; i++) {\n if (temp[i] != null) {\n MapNode<T> node = temp[i];\n put(node.v, node.k);\n }\n }\n }","title":""},{"docid":"9c7f845a83550453e55c3e5f80c0e33f","score":"0.55517167","text":"MapNode<T> getMapNode(String key){\n return bucket[getHashIndex(key)];\n }","title":""},{"docid":"8bff8983384be014b3b7718229c1f5ad","score":"0.5548966","text":"public interface Linklist {\n public Boolean isEmpty();\n public void addElementAtTop(int data);\n public void printListFromStart();\n public void reverseList();\n public void reverseListItteratively();\n public Integer middleOfList();\n public int count();\n}","title":""},{"docid":"504d87528e0fe2919ddbf96f1032e18c","score":"0.5543908","text":"public void remove(int key) {\n int hash = hash(key);\n if(null == map[hash]){\n return;\n }\n ListNode start = map[hash], current = start.next, prev = start;\n if(null == current){\n return;\n }\n while(null != current){\n if(current.key == key){\n ListNode next = current.next;\n if(null == next){\n prev.next = null;\n }else{\n current.key = next.key;\n current.value = next.value;\n current.next = next.next;\n }\n return;\n }\n prev = current;\n current = current.next;\n }\n \n }","title":""},{"docid":"37a3412a6b0ff10bf07ce2ec705927ab","score":"0.55438477","text":"public final kotlinx.coroutines.internal.LockFreeLinkedListNode a(kotlinx.coroutines.internal.OpDescriptor r7) {\n /*\n r6 = this;\n L_0x0000:\n java.lang.Object r0 = r6._prev\n kotlinx.coroutines.internal.LockFreeLinkedListNode r0 = (kotlinx.coroutines.internal.LockFreeLinkedListNode) r0\n r1 = 0\n r2 = r0\n L_0x0006:\n r3 = r1\n L_0x0007:\n java.lang.Object r4 = r2._next\n if (r4 != r6) goto L_0x0018\n if (r0 != r2) goto L_0x000e\n return r2\n L_0x000e:\n java.util.concurrent.atomic.AtomicReferenceFieldUpdater r1 = kotlinx.coroutines.internal.LockFreeLinkedListNode.b\n boolean r0 = r1.compareAndSet(r6, r0, r2)\n if (r0 != 0) goto L_0x0017\n goto L_0x0000\n L_0x0017:\n return r2\n L_0x0018:\n boolean r5 = r6.isRemoved()\n if (r5 == 0) goto L_0x001f\n return r1\n L_0x001f:\n if (r4 != r7) goto L_0x0022\n return r2\n L_0x0022:\n boolean r5 = r4 instanceof kotlinx.coroutines.internal.OpDescriptor\n if (r5 == 0) goto L_0x0038\n if (r7 == 0) goto L_0x0032\n r0 = r4\n kotlinx.coroutines.internal.OpDescriptor r0 = (kotlinx.coroutines.internal.OpDescriptor) r0\n boolean r0 = r7.isEarlierThan(r0)\n if (r0 == 0) goto L_0x0032\n return r1\n L_0x0032:\n kotlinx.coroutines.internal.OpDescriptor r4 = (kotlinx.coroutines.internal.OpDescriptor) r4\n r4.perform(r2)\n goto L_0x0000\n L_0x0038:\n boolean r5 = r4 instanceof u6.a.k0.b\n if (r5 == 0) goto L_0x0052\n if (r3 == 0) goto L_0x004d\n java.util.concurrent.atomic.AtomicReferenceFieldUpdater r5 = kotlinx.coroutines.internal.LockFreeLinkedListNode.a\n u6.a.k0.b r4 = (u6.a.k0.b) r4\n kotlinx.coroutines.internal.LockFreeLinkedListNode r4 = r4.a\n boolean r2 = r5.compareAndSet(r3, r2, r4)\n if (r2 != 0) goto L_0x004b\n goto L_0x0000\n L_0x004b:\n r2 = r3\n goto L_0x0006\n L_0x004d:\n java.lang.Object r2 = r2._prev\n kotlinx.coroutines.internal.LockFreeLinkedListNode r2 = (kotlinx.coroutines.internal.LockFreeLinkedListNode) r2\n goto L_0x0007\n L_0x0052:\n */\n // java.lang.String r3 = \"null cannot be cast to non-null type kotlinx.coroutines.internal.Node /* = kotlinx.coroutines.internal.LockFreeLinkedListNode */\"\n /*\n java.util.Objects.requireNonNull(r4, r3)\n kotlinx.coroutines.internal.LockFreeLinkedListNode r4 = (kotlinx.coroutines.internal.LockFreeLinkedListNode) r4\n r3 = r2\n r2 = r4\n goto L_0x0007\n */\n throw new UnsupportedOperationException(\"Method not decompiled: kotlinx.coroutines.internal.LockFreeLinkedListNode.a(kotlinx.coroutines.internal.OpDescriptor):kotlinx.coroutines.internal.LockFreeLinkedListNode\");\n }","title":""},{"docid":"81866e137b37a018dd0972811f5f8cb5","score":"0.55417186","text":"protected void addEntry(AbstractHashedMap.HashEntry entry, int hashIndex) {\n/* 253 */ LinkEntry link = (LinkEntry)entry;\n/* 254 */ link.after = this.header;\n/* 255 */ link.before = this.header.before;\n/* 256 */ this.header.before.after = link;\n/* 257 */ this.header.before = link;\n/* 258 */ this.data[hashIndex] = entry;\n/* */ }","title":""},{"docid":"79277f057dccfc7e9e6244e3c65b5230","score":"0.55393654","text":"public void put(int key, int value) {\n int index = getHashValue(key);\n if (buckets[index] == null) {\n buckets[index] = new ListNode(key, value);\n } else {\n if (buckets[index].key == key) {\n buckets[index].value = value;\n return;\n }\n ListNode preNode = findPreNode(buckets[index], key);\n if (preNode.next == null) {\n preNode.next = new ListNode(key, value);\n } else {\n preNode.next.value = value;\n }\n }\n }","title":""},{"docid":"8e2947f4b948bcb1a9c9d9498fa9ea18","score":"0.5532107","text":"public void testRemove() {\n dll.add(\"one\");\n dll.add(\"two\");\n dll.add(\"three\");\n dll.head();\n dll.next();\n dll.next();\n\n dll.remove();\n\n assertEquals(2, dll.size());\n assertEquals(\"one\", dll.current().data());\n assertEquals(\"three\", dll.next());\n }","title":""},{"docid":"b0a396b88e813ce22e74215195139b4e","score":"0.55300987","text":"public void setNext(DLLNode newNext);","title":""},{"docid":"15c73c2b7e5200e24ab40c5b0c9cd174","score":"0.55208355","text":"public Node copy(Node head){\n if(head == null){\n return null;\n }\n\n Node dummy = new Node(0);\n Node cur = dummy;\n\n //maintains the mapping between the node in the original list\n //and the corresponding node in the new list\n Map<Node, Node> map = new HashMap<>();\n while(head != null){\n if(!map.containsKey(head)){\n map.put(head, new Node(head.val));\n }\n //connect the copied node to the deep copy list\n cur.next = map.get(head);\n //copy the random node if necessary\n if(head.random != null){\n if(!map.containsKey(head.random)){\n map.put(head.random, new Node(head.random.val));\n }\n\n // connect the copied node to the deep copy list\n cur.next.random = map.get(head.random);\n\n }\n head = head.next;\n cur = cur.next;\n }\n return dummy.next;\n }","title":""},{"docid":"f0d4ef81da174cad486a65d968a2fc1e","score":"0.55157447","text":"protected LinkEntry(AbstractHashedMap.HashEntry next, int hashCode, Object key, Object value) {\n/* 519 */ super(next, hashCode, key, value);\n/* */ }","title":""},{"docid":"a98544b2dc28f6ea446ab575ab4b5f86","score":"0.5511776","text":"public static LinkedListNode removeDuplicates2(LinkedListNode node) {\n\t\tLinkedListNode head = node;\n\t\tHashMap<Integer, Integer> map = new HashMap<Integer, Integer>();\n\t\twhile (node.next != null) {\n\t\t\tif (map.containsKey((int)node.data)) {\n\t\t\t\tnode.pre.next = node.next;\n\t\t\t\tnode.next.pre = node.pre;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tmap.put((int)node.data, 1);\n\t\t\t}\n\t\t\tnode = node.next;\n\t\t}\n\t\treturn head;\n\t}","title":""},{"docid":"f7d99647b43142c01505763d15f05994","score":"0.55064976","text":"private Node<E> nodeAt(int index)\n {\n if (index >= 0 && index < size) {\n Node<E> temp = head;\n for (int i = 0; i < index; i++) // traverse the list\n temp = temp.next;\n return temp;\n } else {\n throw new IndexOutOfBoundsException();\n }\n }","title":""},{"docid":"3ea21f5ea836d09d424391554b0e0d80","score":"0.55048835","text":"@Override\n\tpublic boolean add(T elem) {\n\t\tif (elem == null || find(elem) != null) {\n\t\t\treturn false;\n\t\t}\n\n\t\t/*\n\t\t * PREVIOUSLY REFACTORED CODE int counter = 0; int position =\n\t\t * probing(elem, counter); HashNode<T> node = table[position]; while\n\t\t * (node != null && node.getState() == HashNode.FULL) { position =\n\t\t * probing(elem, counter); node = table[position]; counter++; }\n\t\t */\n\t\t\n\t\t\n\t\tint position = 0;\n\t\tint counter = 0;\n\t\tHashNode<T> node = null;\n\t\t\n\t\t// repeat until we find a null, empty or deleted node\n\t\tdo {\n\t\t\tposition = probing(elem, counter);\n\t\t\tnode = table[position];\n\t\t\tcounter++;\n\t\t} while (node != null && node.getState() == HashNode.FULL);\n\n\t\t// set the info for the new node\n\t\ttable[position] = new HashNode<T>();\n\t\ttable[position].setInfo(elem);\n\t\tnumElements++;\n\t\tupsize();\n\n\t\treturn true;\n\t}","title":""},{"docid":"aebe3efd221fc0a2ee19d9a8c549dc54","score":"0.54898953","text":"public RandomListNode copy(RandomListNode head) {\n\t\tif (head == null) {\n\t\t\treturn head;\n\t\t}\n\t\t// copy the head at first\n\t\tRandomListNode oldCur = head;\n\t\tRandomListNode newCur = new RandomListNode(oldCur.value);\n\t\t// keep newHead and return it in the end\n\t\tRandomListNode newHead = newCur;\n\t\t// record 1-1 relation\n\t\tMap<RandomListNode, RandomListNode> map = new HashMap<>();\n\t\tmap.put(oldCur, newCur);\n\n\t\twhile (oldCur != null) {\n\t\t\tRandomListNode next = oldCur.next;\n\t\t\tif (next != null) {\n\t\t\t\tRandomListNode nextCopy = map.get(next);\n\t\t\t\tif (nextCopy == null) {\n\t\t\t\t\tnextCopy = new RandomListNode(next.value);\n\t\t\t\t\tmap.put(next, nextCopy);\n\t\t\t\t}\n\t\t\t\tnewCur.next = nextCopy;\n\t\t\t}\n\n\t\t\tRandomListNode random = oldCur.random;\n\t\t\tif (random != null) {\n\t\t\t\tRandomListNode randomCopy = map.get(random);\n\t\t\t\tif (randomCopy == null) {\n\t\t\t\t\trandomCopy = new RandomListNode(random.value);\n\t\t\t\t\tmap.put(random, randomCopy);\n\t\t\t\t}\n\t\t\t\tnewCur.random = randomCopy;\n\t\t\t}\n\n\t\t\toldCur = oldCur.next;\n\t\t\tnewCur = newCur.next;\n\t\t}\n\n\t\treturn newHead;\n\t}","title":""},{"docid":"3e9053e7856709f7180b9ba196ef271f","score":"0.5487365","text":"private void headToHeadLink(Graph dag, Vector index){\n\nNodeList nodes,nbX,nbY,subDsep;\nHashtable sepSet;\nLinkList links;\nLink delLink,newLink;\nint i,j,z,pos;\nNode nodeX,nodeY,nodeZ;\nboolean directedXY,directedYZ;\n\nnodes = dag.getNodeList();\nlinks = dag.getLinkList();\n\n for(i=0;i< nodes.size();i++){\n nodeX = (Node) nodes.elementAt(i);\n nbX = dag.neighbours(nodeX);\n for(j=0 ; j< nbX.size() ; j++){\n\t nodeY = (Node) nbX.elementAt(j);\n\t nbY = dag.neighbours(nodeY);\n\t nbY.removeNode(nodeX);\n\t for(z=0 ; z < nbY.size() ;z++){\n\t nodeZ = (Node) nbY.elementAt(z);\n\t if( nbX.getId(nodeZ) == -1 ){ // No adyacentes X y Z\n\t\t pos = nodes.getId(nodeX);\n\t\t sepSet = (Hashtable)index.elementAt(pos);\n\t\t subDsep = (NodeList)sepSet.get(nodeZ);\n\t\t if((subDsep!=null)&&(subDsep.getId(nodeY) == -1)){\n\t\t delLink = links.getLinks(nodeX.getName(),nodeY.getName());\n\t\t if(delLink == null){\n\t\t\t delLink = links.getLinks(nodeY.getName(),nodeX.getName());\n\t\t }\n\t\t directedXY = delLink.getDirected();\n\t\t if(!directedXY){\n\t\t try {\n\t\t\t dag.removeLink(delLink);\n\t\t\t dag.createLink(nodeX,nodeY);\n\t\t\t }\n\t\t\t catch (InvalidEditException iee) {};\n\t\t }\n\t\t delLink = links.getLinks(nodeY.getName(),nodeZ.getName());\n\t\t if(delLink == null){ \n\t\t\t delLink = links.getLinks(nodeZ.getName(),nodeY.getName());\n\t\t }\n\t\t directedYZ = delLink.getDirected();\n\t\t if(!directedYZ){\n\t\t try {\n\t\t\t dag.removeLink(delLink);\n\t\t\t dag.createLink(nodeZ,nodeY);\n\t\t\t }\n\t\t\t catch (InvalidEditException iee) {};\n\t\t\t\n\t\t }\n\t\t }\n\t\t \n\t }\n\t }\n }\n }\n}","title":""},{"docid":"96d4f5edf42da3f1c54ecbf4c21cf7c7","score":"0.5483802","text":"public abstract Node getNodeMappedTo(int index);","title":""},{"docid":"8c61a58636560f26ad4090ea9e143021","score":"0.5475807","text":"Node<K, V> insert(Node<K, V> par, Node<K, V> nod, Node<K, V> prv, Node<K, V> nxt, Node<K, V> put, boolean rpl) {\r\n\t\tint cr; // compare result\r\n\r\n\t\tif (nod == null) {\r\n\t\t\tput.left = null;\r\n\t\t\tput.right = null;\r\n\t\t\tput.balancer = random.nextInt();\r\n\t\t\tsize++;\r\n\t\t\tlinkNode(nod, prv, nxt, put);\r\n\t\t\treturn put;\r\n\t\t} else if ((cr = nod.compareKey(put.getKey())) < 0) {\r\n\t\t\tnod.right = insert(nod, nod.right, nod, nod.next, put, rpl);\r\n\t\t\tif (nod.balancer > nod.right.balancer) {\r\n\t\t\t\tnod = promoteRight(nod);\r\n\t\t\t}\r\n\t\t\treturn nod;\r\n\t\t} else if (cr > 0) {\r\n\t\t\tnod.left = insert(nod, nod.left, nod.prev, nod, put, rpl);\r\n\t\t\tif (nod.balancer > nod.left.balancer) {\r\n\t\t\t\tnod = promoteLeft(nod);\r\n\t\t\t}\r\n\t\t\treturn nod;\r\n\t\t} else /* cr==0 */ {\r\n\t\t\tif (!rpl) {\r\n\t\t\t\tthrow new Escape(Escape.OBJNOTFND, \"Node<K,V> already exists in the tree (\" + nod + \")\");\r\n\t\t\t}\r\n\t\t\tput.left = nod.left;\r\n\t\t\tput.right = nod.right;\r\n\t\t\tput.balancer = nod.balancer;\r\n\t\t\tlinkNode(nod, prv, nxt, put);\r\n\t\t\treturn put;\r\n\t\t}\r\n\t}","title":""},{"docid":"4ccfd45ffd3b7cb2b4add9bd318c8e32","score":"0.5464186","text":"interface Node<T> {\n /** Get the size of the node, that is how many data elements it holds */\n int size ();\n \n /** Get the MBR of this node */\n MBR getMBR (MBRConverter<T> converter);\n \n /** Visit this node and add the leafs to the found list and add \n * any child nodes to the list of nodes to expand.\n */\n void expand (MBR mbr, MBRConverter<T> converter, \n\t\t List<T> found, List<Node<T>> nodesToExpand);\n \n /** Find nodes that intersect with the given MBR.\n */\n void find (MBR mbr, MBRConverter<T> converter, List<T> result);\n}","title":""},{"docid":"17b23363a7501f22ea08a68181e23eef","score":"0.5461086","text":"public static void main(String[] args) {\n\n\n LinkedList l2=new LinkedList();\n l2.push(6);\n l2.push(5);\n // l2.push(4);\n // l2.push(3);\n l2.push(4);\n l2.push(3);\n l2.push(2);\n l2.push(1);\n //l2.insert_afterData(3, 10);\n System.out.println(\"Insert here\");\n // l2.printList();\n // System.out.println();\n //System.out.println(\"Delete here\");\n //l2.DeleteKey(5);\n //l2.printList();\n //l2.calcSize();\n //l2.calcFrequency(); \n //l2.swapNodes(5, 6);\n l2.printList();\n }","title":""},{"docid":"b960a67de40d7ad367f46e991f8f9b64","score":"0.5450352","text":"@Override\n public void addNode(node_data n)\n {\n if(!this._nodes.containsKey(n.getKey()))\n {\n this._nodes.put(n.getKey(),n);\n mc++;\n }\n }","title":""},{"docid":"99781a2c562e1fa7d8838b07dabb0562","score":"0.5450142","text":"Node(int key) { // sentinel constructor\n this.item = null;\n this.key = key;\n this.next = null;\n this.marked = false;\n this.tagged = false;\n this.lock = new ReentrantLock();\n }","title":""},{"docid":"9ad56c7fa2524efa3cbb3d2b89080b59","score":"0.5446001","text":"@Override\n public void addNode(node_data n) {\n if (n != null) {\n Vmap.put(n.getKey(), n);\n HashMap<Integer, edge_data> Emap1 = new HashMap<Integer, edge_data>();\n HashMap<Integer, edge_data> Emap2 = new HashMap<Integer, edge_data>();\n SEmap.put(n.getKey(), Emap1);\n DEmap.put(n.getKey(), Emap2);\n MCcounter++;\n }\n }","title":""},{"docid":"bfab03fb30e0364788d642c65a21c9ea","score":"0.54454035","text":"private void remove(Node node) {\n if (node == head) head = head.next;\n if (node == tail) tail = tail.prev;\n removeNodeBindings(node);\n }","title":""},{"docid":"dec2380639be623c620bfe3fde48de2f","score":"0.54452884","text":"private void add(Node node) {\n Node next = head.next;\n head.next = node;\n node.next = next;\n node.prev = head;\n next.prev = node;\n }","title":""},{"docid":"fa15ffe3647e2d33832555a317503d43","score":"0.5443756","text":"MyLinkedNode getHead() { return head; }","title":""},{"docid":"19099e8d1584f55e3ff4f0001dd21bb1","score":"0.544191","text":"private Node<T> node(int index) {\n \tNode<T> x = first;\n \tfor(int i = 0; i < index - 1; i++) {\n \t\tx = x.next;\n \t}\n \treturn x;\n }","title":""},{"docid":"1e6b710259bd5ffa2e37f4a4d27d92dc","score":"0.54376334","text":"private Node find(int key) {\n Node p = bucket[key % DEFAULT_CAPACITY];\n while (p != null && p.key != key) p = p.next;\n\n return p;\n }","title":""},{"docid":"f1fc016cbad980db69da069e2205fd51","score":"0.5432567","text":"private Node<T, E> findNode(T key) {\n Node<T, E> node = buckets[getBucketNumber(key)];\n\n while (node != null && !node.key.equals(key)) {\n node = node.next;\n }\n\n return node;\n }","title":""},{"docid":"d466f98c2b037f2e7fde75b87f995f95","score":"0.5430269","text":"public void addNode(String word, Integer value) {\n int whichBucket = whichBucket(word);\n LLNode head = hashMap.get(whichBucket);\n LLNode newNode = new LLNode(word, value);\n\n //if the word is already in the hashMap it will just increment count for it by 1\n if (lookUp(newNode.getKey())) {\n while (head != null) {\n if (head.getKey().equals(word)) {\n head.setValue(1 + head.getValue());\n }\n head = head.next;\n }\n }\n // if word is not in the hashmap, it will add it to the hashmap\n else {\n newNode.next = head;\n hashMap.set(whichBucket, newNode);\n size++;\n }\n }","title":""},{"docid":"85652b693cbe8888c2effe642042e193","score":"0.5425547","text":"private void reversePRHelper(Node node){\n if(node == null) return;\n\n reversePRHelper(node.next);\n\n if(node == tail){\n //nothing to add\n } else {\n node.next.next = node;\n }\n }","title":""},{"docid":"8cd5df3779c1a647235a1fc85df7ea88","score":"0.54246914","text":"public static void main(String[] args) {\n Map<String, Integer> map = new LinkedListMap<>(5);\n map.insert(\"one\", 1);\n map.insert(\"two\", 2);\n System.out.println(map);\n System.out.println(map.size());\n map.insert(\"three\", 3);\n map.insert(\"four\", 4);\n map.insert(\"five\", 5);\n map.insert(\"six\", 6);\n map.insert(\"seven\", 7);\n map.insert(\"eight\", 8);\n map.insert(\"nine\", 9);\n System.out.println(map.size());\n System.out.println(map.hasValue(9));\n System.out.println(map.hasKey(\"three\"));\n map.delete(\"three\");\n// System.out.println(map.hasKey(\"three\"));\n System.out.println(map.get(\"nine\"));\n System.out.println(map);\n }","title":""},{"docid":"40ca142056a8dedddf82072dde372cf0","score":"0.5424267","text":"@tags.LinkedList\n @tags.HashTable\n @tags.Company.Amazon\n @tags.Company.Bloomberg\n @tags.Company.Microsoft\n @tags.Company.Uber\n @tags.Status.OK\n public RandomListNode copyRandomList(RandomListNode head) {\n // copy nodes and append copy after each original node\n RandomListNode current = head;\n while (current != null) {\n RandomListNode copy = new RandomListNode(current.label);\n copy.next = current.next;\n current.next = copy;\n current = copy.next;\n }\n\n // copy random pointer\n current = head;\n while (current != null) {\n if (current.random != null) {\n current.next.random = current.random.next;\n }\n current = current.next.next;\n }\n\n // separate the 2 lists\n RandomListNode dummy = new RandomListNode(0);\n RandomListNode prev = dummy;\n current = head;\n while (current != null) {\n prev.next = current.next;\n current.next = current.next.next;\n current = current.next;\n prev = prev.next;\n }\n\n return dummy.next;\n }","title":""},{"docid":"5c8571a7a281653e76957271786e2db8","score":"0.5421797","text":"@Override\r\n public boolean add(E o) {\r\n Node<E> newnode = new Node(o);\r\n if (head==null || (head.data.compareTo(newnode.data)>0)){\r\n newnode.next=head;\r\n head = newnode;\r\n incrementcounter();\r\n return true;\r\n }\r\n Node<E> currentnode = head;\r\n Node<E> previousnode = null;\r\n while (currentnode!=null){\r\n if (currentnode.data.compareTo(newnode.data)>0){\r\n previousnode.next = newnode;\r\n newnode.next=currentnode;\r\n incrementcounter();\r\n return true;\r\n }\r\n previousnode = currentnode;\r\n currentnode = currentnode.next;\r\n }\r\n previousnode.next=newnode;\r\n incrementcounter();\r\n return true;\r\n }","title":""},{"docid":"8b8f4efdda57c8548d86fbc38fb80be0","score":"0.54195994","text":"private void addNode (Node current, Node toAdd) {\r\n toAdd.prev = current.prev;\r\n toAdd.next = current;\r\n \r\n current.prev.next = toAdd;\r\n current.prev = toAdd;\r\n \r\n this.modCount++;\r\n this.size++;\r\n }","title":""},{"docid":"d6ff61d060243199c11cca0017fcacf6","score":"0.54183024","text":"public interface Node<T extends Comparable<T>> {\n\n /**\n *\n * @param other other Node to compare keys with\n * @return -1 less\n * 0 equal\n * 1 greater\n */\n int compareNode(Node<T> other);\n\n /**\n *\n * @return this nodes Key\n *\n */\n T getKey();\n\n\n /**\n *\n * @return this node's Value\n */\n Object getValue();\n\n Node<T> getL();\n\n Node<T> getR();\n\n void setL(Node<T> n);\n\n void setR(Node<T> n);\n\n int getCount();\n\n int getMaxDepth();\n\n /**\n *\n * @return\n */\n Node<T> rotateR();\n\n Node<T> rotateL();\n\n String printTree(int keylength_hint);\n\n}","title":""},{"docid":"c1aff6f343e30d5f281500fe8269aeff","score":"0.54124457","text":"Node getNode(String key){\n //hash the string\n int h = hash(key);\n //bitwise & to fit it in the array\n int i = h&(table.length-1);\n //search for node and get it\n for(Node e = table[i]; e!= null; e = e.next){\n if(key.equals(e.key)){\n return e;\n }\n }\n //otherwise return null\n return null;\n }","title":""},{"docid":"69409b5e1ca070de0f7bc05878f60cd2","score":"0.5412047","text":"private int hash(Node<K, V> key) {\n return hashCode() % hashTable.length;\n }","title":""},{"docid":"b4e10722af388c434dff7923cb1d4d2d","score":"0.5407256","text":"protected Entry(int hash, K key, int value, Entry<K> next)\r\n\t\t{\r\n\t\t\tthis.hash = hash;\r\n\t\t\tthis.key = key;\r\n\t\t\tthis.value = value;\r\n\t\t\tthis.next = next;\r\n\t\t}","title":""},{"docid":"678705acbbc7ad022f51f4a29d5b9f75","score":"0.5402046","text":"private static Node addLinkeList(Node node1, Node node2) {\n\t\tNode nextNode=null;\n\t\tif(node1.link != null && node2.link !=null){\n\t\t\tnextNode = addLinkeList(node1.link, node2.link);\n\t\t}else if(node1.link != null && node2.link ==null){\n\t\t\tnextNode = addLinkeList(node1.link, node2);\n\t\t}else if(node1.link == null && node2.link !=null){\n\t\t\tnextNode = addLinkeList(node1, node2.link);\n\t\t}\n\t\t/*else if(node1.link == null || node2.link ==null){\n\t\t\tNode addNode=new Node(node1.data+node2.data);\n\t\t\taddNode.link=null;\n\t\t\treturn addNode;\n\t\t}*/\n\t\tint result=node1.data+node2.data+carry;\n\t\tNode addNode=new Node(result%10);\n\t\tcarry=result/10;\n\t\taddNode.link=nextNode;\n\t\treturn addNode;\n\t\t\n\t\t\n\t}","title":""},{"docid":"6acdaa32e5312d5408820139f1a1c5f6","score":"0.5399767","text":"private static void testMySimpleLinkedList() {\n MySimpleLinkedList<String> mySimpleLinkedList = new MySimpleLinkedList<>();\n mySimpleLinkedList.add(\"one\");\n mySimpleLinkedList.add(\"two\");\n mySimpleLinkedList.add(\"three\");\n mySimpleLinkedList.add(\"four\");\n System.out.println(mySimpleLinkedList.toString());\n\n System.out.println(\"first: \" + mySimpleLinkedList.getFirst().toString());\n System.out.println(\"last: \" + mySimpleLinkedList.getLast().toString());\n\n mySimpleLinkedList.removeEntry(\"three\");\n System.out.println(mySimpleLinkedList.toString());\n\n mySimpleLinkedList.removeEntry(1);\n System.out.println(mySimpleLinkedList.toString());\n\n mySimpleLinkedList.removeEntry(\"zzz\");\n System.out.println(mySimpleLinkedList.toString());\n\n try {\n mySimpleLinkedList.removeEntry(3);\n\n } catch (IndexOutOfBoundsException e) {\n e.printStackTrace();\n System.out.println(\"An error has occurred!\");\n }\n System.out.println(mySimpleLinkedList.toString());\n }","title":""},{"docid":"906ff4c60a2bfacd5e626c4afce821e1","score":"0.5397412","text":"@SuppressWarnings(\"unchecked\")\n\tpublic static void addNode(BigInteger ip) {\n\t\t//System.out.println(\"addNode: \" + ip);\n\t\t\n\t\tif(isSharedNode(ip)) {\n\t\t\tSystem.out.println(\" it has already been a shared node!\");\n\t\t\tSystem.out.println(\" returns failed\");\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tNode shareNode = new Node(ip);\n\t\tBigInteger base = new BigInteger(\"2\");\n\t\tBigInteger moder = base.pow(bitNumber);\n\t\t\n\t\t// build finger table\n\t\tfor(int j=0; j<bitNumber; j++) {\n\t\t\tint index = j;\n\t\t\tBigInteger jThSuccessor = ip.add(base.pow(j)).mod(moder);\n\t\t\t\n\t\t\tFingerTableItem ftItem = new FingerTableItem(index, jThSuccessor, buildSuccessor(jThSuccessor, ip));\n\t\t\tshareNode.getFingerTable().add(ftItem);\n\t\t}\n\t\t\n\t\t\n\t\t// add new shared node into list\n\t\tsharedNodes.add(shareNode);\n\t\tCollections.sort(sharedNodes);\n\t\t\n\t\t// update successor of all shared nodes\n\t\tupdateSuccessor();\n\t\t\n\t\t//printShardNodesInfo();\n\t\t\n\t\tSystem.out.println(\" returns success\");\n\t}","title":""},{"docid":"496396eb1c07fed5e13d5259b954e476","score":"0.5396921","text":"private void fixList(Node<E> t, Node<E> h) {\n Node<E> curNodeNext;\n Node<E> curNode = t;\n while (h == this.head && curNode != h) {\n curNodeNext = curNode.getNext();\n curNodeNext.setPrev(curNode);\n curNode = curNode.getNext();\n }\n }","title":""},{"docid":"b348a0eba5216e591a66b8271e6f2d95","score":"0.53914016","text":"private LLNode<E> findNode(int index) {\r\n\t\tLLNode<E> node = null;\r\n\t\tnode = head.next;\r\n\t\tfor (int i=0; i<index; i++) {\r\n\t\t\t node = node.next;\r\n\t\t}\r\n\t\treturn node;\r\n\t}","title":""},{"docid":"d2ff547196533128c39625a32df7f1b5","score":"0.539016","text":"void put(String k, String n, double s, List<String> cat){\n int h = hash(k);\n int i = h & (table.length-1);\n for(Node e = table[i]; e!= null; e = e.next){\n if(k.equals(e.key)){\n e.name = n;\n return;\n }\n }\n //create new node after finding spot\n Node p = new Node(k,n,s,cat,table[i], this);\n table[i] = p;\n count++;\n }","title":""},{"docid":"9c4092b2bced45499888ac439a7c013c","score":"0.5386715","text":"protected DListNode<T> newNode(T item, DList<T> list,\n DListNode<T> prev, DListNode<T> next) {\n return new DListNode<T>(item, list, prev, next);\n }","title":""},{"docid":"9e605d5ba7b2af20a88b00fbe6125c69","score":"0.5384841","text":"public interface LinkedListNode<T> extends GenericNode<T> {\n LinkedListNode<T> getNext();\n void setNext(LinkedListNode<T> next);\n}","title":""},{"docid":"58537291be6a1c20d1794959a2e17935","score":"0.53832805","text":"static <KeyType, ValueType> LinkedList<ValueType> hashtableToLinkedList(Hashtable<KeyType,ValueType> hash)\n\t{\n\t\t/*This next section was inspired by Adamski's answer to a question on Stackoverflow:\n\t\tstackoverflow.com/question/2351331/iterating-hashtable-in-java\n\t\t */\n\t\tLinkedList<ValueType> newList = new LinkedList<ValueType>();\n\t\tIterator<Entry<KeyType, ValueType>> iter = hash.entrySet().iterator();\n\n\t\twhile(iter.hasNext())\n\t\t{\n\t\t\tMap.Entry<KeyType, ValueType> entry = iter.next();\n\t\t\tValueType current = entry.getValue();\n\n\t\t\tnewList.add(current);\n\t\t}\n\t\treturn newList;\n\t}","title":""},{"docid":"9fa6418a94fa5e2d0d6c65876c5dd64c","score":"0.5382502","text":"public void add(KeyValuePair<K,V> pair , int index){\r\n\r\n\t\tNode<K,V> entry=new Node<K,V>(pair);\r\n\t\t//if head is null\r\n\t\tif(isEmpty(index)){\r\n\t\t\tstorage[index]=entry;\r\n\t\t}else{\r\n\t\t\tNode<K,V> current = storage[index];\r\n\r\n\t\t\twhile(current.next != null){\r\n\t\t\t\tcurrent = current.next;\r\n\t\t\t}\r\n\t\t\tcurrent.next=entry;\r\n\t\t}\r\n\r\n\t}","title":""},{"docid":"d31a0e51de961a45895015f55c5cc612","score":"0.53821194","text":"protected DListNode newNode(Object item, DListNode prev, DListNode next) {\n\t\treturn new DListNode(item, prev, next);\n\t}","title":""},{"docid":"062c4280decad4efe852aa688c60a232","score":"0.53720045","text":"private ListNode getNode(int index) {\r\n\t\tif (index < FIRST_POSITION || index > size - 1) {\r\n\t\t\tthrow new IndexOutOfBoundsException(\r\n\t\t\t\t\t\"Given index must not be negative nor bigger than the collection's size decremented by one.\");\r\n\t\t}\r\n\r\n\t\tListNode tempNode = new ListNode();\r\n\r\n\t\tif (index < size / PARTITION_FACTOR) {\r\n\t\t\tint i = FIRST_POSITION;\r\n\r\n\t\t\tfor (tempNode = first; tempNode != null; tempNode = tempNode.next) {\r\n\t\t\t\tif (i == index) {\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\r\n\t\t\t\ti++;\r\n\t\t\t}\r\n\t\t} else {\r\n\t\t\tint i = size - 1;\r\n\r\n\t\t\tfor (tempNode = last; tempNode != null; tempNode = tempNode.previous) {\r\n\t\t\t\tif (i == index) {\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\r\n\t\t\t\ti--;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn tempNode;\r\n\t}","title":""},{"docid":"26429e92b82d4d9602c43235369a0f46","score":"0.53699815","text":"public Entry insert(Object key, Object value) {\n // Replace the following line with your solution.\n //System.out.println(\"old graph\");\n //System.out.println(this);\n\n Entry entry = new Entry();\n entry.key = key;\n entry.value = value;\n int compressedCode = this.compFunction(key.hashCode());\n dict[compressedCode].insertBack(entry);\n size++;\n // System.out.println(\"load fact before : \" + loadFactor());\n //System.out.println(this);\n if ((loadFactor() <= 0.3 || loadFactor() >= 1.0) && size > 9) {\n // System.out.println(\"Enlarging Now\");\n resize();\n // System.out.println(\"load fact: \" + loadFactor());\n //System.out.println(\"graph after resizing\");\n //System.out.println(this);\n }\n return entry;\n }","title":""},{"docid":"710f70979f3fa86c0be514464aecfdfa","score":"0.53698635","text":"private void addNode(int data) {\n Node newNode = new Node(data); \n \n //Checks if the list is empty \n if(head == null) { \n //If list is empty, both head and tail will point to new node \n head = newNode; \n tail = newNode; \n } \n else { \n //newNode will be added after tail such that tail's next will point to newNode \n tail.next = newNode; \n //newNode will become new tail of the list \n tail = newNode; \n\t\t\n\t}\n\n}","title":""},{"docid":"95e5f9b610675e2f8fa2e4e854d1e233","score":"0.53685206","text":"private Node (Entry<P, D> e) {\n\t\t\tentry = e;\n\t\t\te.node = this;\n\t\t}","title":""},{"docid":"1c04a67eb9c69338487728ee47bd7a04","score":"0.53602964","text":"public void append(int new_data) \n{ \n\t/* allocate the node and put it in data and set next as null */ \n\tNode new_node = new Node(new_data); \n\n/* 4 if linked list is empty then make new node as head */\nif(head == null)\n{ \nhead = new Node(new_data); \nreturn; \n}\n/* 4. the new node is going to be last node so make next of it as null */ \nnew_node.next = null; \n\n/* 5. Else traverse till the last node */ \nNode last = head; \nwhile (last.next != null)\n\tlast = last.next; \n\n/* 6. change the next of last node */ \nlast.next = new_node; \nreturn; \n}","title":""},{"docid":"7d8078082b051bb65499f693cf404d3a","score":"0.53592086","text":"@Test\n public void testOneLinkedAdd() {\n MyLinkedList<String> llist = (MyLinkedList)(Object)list;\n llist.clear();\n assertEquals(llist.size(), 0);\n assertSame(llist.getHead().getNext(), llist.getTail());\n assertSame(llist.getHead(), llist.getTail().getPrev());\n list.add(\"foo\");\n assertEquals(llist.size(), 1);\n\n // there should be a new node following the head.\n MyLinkedNode<String> fooNode = llist.getHead().getNext();\n assertNotSame(fooNode, llist.getTail());\n assertEquals(fooNode.getValue(), \"foo\");\n assertSame(llist.getTail().getPrev(), fooNode);\n }","title":""},{"docid":"a947dcdc70c28f7eef740bca76bc353d","score":"0.53561604","text":"public static void main(String[] args) {\n \r\n Node head=null;\r\n head=insertIntoList(head,20,\"abc\");\r\n insertIntoList(head,30,\"abc\");\r\n insertIntoList(head,40,\"abc\");\r\n insertIntoList(head,50,\"abc\");\r\n insertIntoList(head,60,\"abc\");\r\n insertIntoList(head,70,\"abc\");\r\n head=insertStart(head,80,\"pqr\");\r\n \r\n head=InsertAtK(head, 3,38,\"rst\");\r\n insertAtkfromEnd(head, 1, 23, \"pqr\");\r\n InsertKend2(head, 2, 100, \"qws\");\r\n head=delete(head, 1);\r\n printListRec(head);\r\n // printList(head);\r\n\r\n // System.out.println(head.data+\" -> \"+head.nextRef.data+\" -> \"\r\n // +head.nextRef.nextRef.data+\" -> \"+head.nextRef.nextRef.nextRef.data);\r\n // // System.out.println(second.data);\r\n // System.out.println(head.nextRef.data);\r\n\r\n\r\n }","title":""},{"docid":"ae4c0e9046b889e60e2c2759ad10bafe","score":"0.53546524","text":"private static <V> Node<V> put(Node<V> h, int key, V value) { \n\t\tif (h == null) return Node.mkRed(key, value);\n\n\t\tint cmp = compareTo(key, h.key);\n\t\tif (cmp < 0) h = h.setLeft(put(h.left, key, value)); \n\t\telse if (cmp > 0) h = h.setRight(put(h.right, key, value));\n\t\telse h = h.setValue(value);\n\n\t\t// fix-up any right-leaning links\n\t\tif (isRed(h.right) && isBlack(h.left)) h = h.rotateLeft();\n\t\tif (isRed(h.left) && isRed(h.left.left)) h = h.rotateRight();\n\t\tif (isRed(h.left) && isRed(h.right)) h = h.flipColors();\n\t\t\n\t\treturn h.fixSize();\n\t}","title":""},{"docid":"5a5dd8256580c31c1e255fb768fdf082","score":"0.53523076","text":"public void add(Bee data){\n if(head == null){ //C1\n head = new Node(data); //C2\n end = new Node(data); //C3\n head.head = head; //C3\n end.head = head; //C4\n }\n else{\n Node newHead = new Node(data); //C5\n newHead.next = head; //C6\n head = newHead; //C7\n newHead.head = newHead; //C8\n }\n length = length + 1; //C9\n }","title":""},{"docid":"4573bca360550b789a4c493348c964d6","score":"0.53509253","text":"private Node(int key, Object data) {\n this.key = key;\n this.data = new LLList();\n this.data.addItem(data, 0);\n this.left = null;\n this.right = null;\n }","title":""}],"string":"[\n {\n \"docid\": \"c6ed785dd47819e175303f8c8b280386\",\n \"score\": \"0.6234371\",\n \"text\": \"private DLL_node add(DLL_node head) throws IOException {\\r\\n DLL_node temp = new DLL_node();\\r\\n temp.set_next(head);\\r\\n if(head != null)\\r\\n head.set_previous(temp);\\r\\n temp.set_previous(null);\\r\\n head = temp;\\r\\n return head;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c487a8ad20efb5e927d8fc22542b97f1\",\n \"score\": \"0.6059705\",\n \"text\": \"@Override\\r\\n\\tpublic void addNode(node_data n) \\r\\n\\t{\\t\\t\\r\\n\\t\\tif(!nodesInGraph.containsKey(n.getKey()))\\r\\n\\t\\t{\\r\\n\\t\\t\\tnodesInGraph.put(n.getKey(), n);\\r\\n\\t\\t\\tpointers.put(n.getKey(), new LinkedList<node_data>());\\r\\n\\t\\t\\tneighbors.put(n.getKey(), new LinkedList<node_data>());\\r\\n\\t\\t\\tmcCounter++;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c0024b590803282eb4a718cf53ce201d\",\n \"score\": \"0.60418713\",\n \"text\": \"private node<T> reUse(Object data){\\n node<T> current;\\n current = Dhead;\\n if(Dsize>1){\\n for(int i=0; i<Dsize-2 ;++i){\\n current=current.next;\\n }\\n node<T> temp;\\n temp=current.next;\\n current.next=null;\\n Dsize--;\\n temp.data=(T) data;\\n return temp;\\n }\\n else if(Dsize==1){\\n Dsize--;\\n node<T> temp;\\n temp=Dhead;\\n Dhead=null;\\n return temp;\\n }\\n else{\\n return null;\\n }\\n \\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3732bb90a253cf94356c546ad4d9030f\",\n \"score\": \"0.6040222\",\n \"text\": \"private void add(LRUCache.Node node) {\\n LRUCache.Node next = head.next;\\n head.next = node;\\n node.next = next;\\n node.prev = head;\\n next.prev = node;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b48ac536f647a73b69305d5c57b0390\",\n \"score\": \"0.60131043\",\n \"text\": \"@Override\\n\\t\\tboolean insert(HashPair item) {\\n\\n\\t\\t\\tDLList bucketList = hashTable[hash(item.key,hashTable.length)];\\n\\t\\t\\tDLNode temp = bucketList.search(item);\\n\\t\\t\\t//System.out.println(bucketList);\\n\\t\\t\\t\\n\\t\\t\\tif(temp != null)\\n\\t\\t\\t\\tbucketList.remove(temp);\\n\\t\\t\\t\\n\\t\\t\\t\\tbucketList.append(new DLNode(item));\\t\\t\\t \\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"366de00af7a208bdfa36463e38ad89eb\",\n \"score\": \"0.5991759\",\n \"text\": \"public Node copyRandomList2(Node head) {\\n\\n Map<Node, Node> map = new HashMap<>();\\n\\n Node curr = head;\\n while (curr != null) {\\n map.put(curr, new Node(curr.val, null, null));\\n curr = curr.next;\\n }\\n\\n curr = head;\\n while (curr != null) {\\n Node copy = map.get(curr);\\n copy.next = map.get(curr.next);\\n copy.random = map.get(curr.random);\\n\\n curr = curr.next;\\n }\\n\\n return map.get(head);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a387333c846c998e8a1e6c6ad5fb5c90\",\n \"score\": \"0.58868235\",\n \"text\": \"public LNode cloneWithHashMap(LNode head) {\\n\\t\\tMap<LNode,LNode> copyMap= new HashMap<>();\\n\\t\\tLNode curr = head;\\n\\t\\twhile(curr!=null) {\\n\\t\\t\\tLNode node = new LNode(curr.val);\\n\\t\\t\\tcopyMap.put(curr,node);\\t\\n\\t\\t\\tcurr = curr.next;\\n\\t\\t}\\n\\t\\tcurr = head;\\n\\t\\twhile(curr!=null) {\\n\\t\\t\\tLNode copy = copyMap.get(curr);\\n\\t\\t\\tcopy.next = copyMap.get(curr.next);\\n\\t\\t\\tcopy.random = copyMap.get(curr.random);\\n\\t\\t\\tcurr = curr.next;\\n\\t\\t}\\n\\t\\treturn copyMap.get(head);\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0d76c6102ececf9d272a1a0bbceaf00\",\n \"score\": \"0.5877029\",\n \"text\": \"protected AbstractHashedMap.HashEntry createEntry(AbstractHashedMap.HashEntry next, int hashCode, Object key, Object value) {\\n/* 273 */ return new LinkEntry(next, hashCode, key, value);\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1693a6fcf07be0431b41ad1c8f4e427c\",\n \"score\": \"0.584042\",\n \"text\": \"public Node copyRandomList(Node head) {\\n HashMap<Node, Node> visitedHash = new HashMap<Node, Node>();\\n Node dummy = new Node();\\n\\n //pointer to traverse the list\\n Node cur = dummy;\\n //traverse the original list\\n while(head != null){\\n //copy the current node if necessary\\n if(!visitedHash.containsKey(head)){\\n //visitedHash.put(head, new Node(head.val, null, null));\\n visitedHash.put(head, new Node());\\n visitedHash.get(head).val = head.val;\\n// System.out.println(head.val);\\n// System.out.println(visitedHash.get(head).val);\\n\\n }\\n\\n\\n cur.next = visitedHash.get(head);\\n //copy the random node if necessary\\n if(head.random != null){\\n if(!visitedHash.containsKey(head.random)){\\n visitedHash.put(head.random, new Node(head.random.val, null, null));\\n }\\n cur.next.random = visitedHash.get(head.random);\\n }\\n\\n head = head.next;\\n cur = cur.next;\\n\\n }\\n\\n return dummy.next;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"05c453950685570cc8513b1bedfe2180\",\n \"score\": \"0.58339083\",\n \"text\": \"public void put(int key, int value) {\\n int hash = hash(key);\\n if(null == map[hash]){\\n map[hash] = new ListNode(Integer.MIN_VALUE,Integer.MIN_VALUE);\\n }\\n ListNode start = map[hash], current = start.next, prev = start;\\n if(null == current){\\n start.next = new ListNode(key,value);\\n return;\\n }\\n boolean found = false;\\n while(null != current){\\n if(current.key == key){\\n found = true;\\n current.value = value;\\n return;\\n }\\n prev = current;\\n current = current.next;\\n }\\n if(!found){\\n prev.next = new ListNode(key,value);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3bee7c7f0cf82c022c0eaac1dafb80e\",\n \"score\": \"0.58307105\",\n \"text\": \"public RandomListNode copyRandomList(RandomListNode head) {\\n Map<RandomListNode, RandomListNode> map = new HashMap();\\n RandomListNode node = head;\\n\\n //loop for the first time: copy the node themselves with only labels\\n while (node != null) {\\n map.put(node, new RandomListNode(node.label));\\n node = node.next;\\n }\\n\\n //loop for the second time: copy random and next pointers\\n node = head;\\n while (node != null) {\\n map.get(node).next = map.get(node.next);\\n map.get(node).random = map.get(node.random);\\n node = node.next;\\n }\\n\\n return map.get(head);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a75cdf2879b430185dfdaf419153ca27\",\n \"score\": \"0.5810319\",\n \"text\": \"private static Node deleteDupsWithDataStructureInPlaceMod(Node node) {\\n if(node == null) return null;\\n if(node.next == null) return node;\\n\\n // create set to maintain all distinct values and use to check for deletion candidates\\n Set<Integer> seen = new HashSet<>();\\n\\n Node head = node; // maintain head to return\\n Node prev = null;\\n\\n while(node != null){\\n if(seen.contains(node.value)){\\n prev.next = node.next; // this is fine because the next is either another node or the end.\\n }\\n else{\\n seen.add(node.value);\\n }\\n prev = node;\\n node = node.next;\\n }\\n\\n return head;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"563ec60f856ef545e7bcc7649aa0b173\",\n \"score\": \"0.57952416\",\n \"text\": \"private final Node registerNode(Node newNode)\\n/* */ {\\n/* 140 */ if (this.state == State.BUILDING_FAST) {\\n/* 141 */ return newNode;\\n/* */ }\\n/* */ \\n/* 144 */ Node oldNode = (Node)this.nodes.get(newNode);\\n/* 145 */ if (oldNode != null) {\\n/* 146 */ return oldNode;\\n/* */ }\\n/* */ \\n/* */ \\n/* 150 */ oldNode = (Node)this.nodes.put(newNode, newNode);\\n/* 151 */ assert (oldNode == null);\\n/* 152 */ return newNode;\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b282c3c50196fe270030acfb98eaac5d\",\n \"score\": \"0.57813144\",\n \"text\": \"public static Node deleteDups(Node head){\\n\\n\\n Node temp = head, prev;\\n HashMap<Integer, Boolean> hmap = new HashMap<>();\\n while(temp!=null) {\\n hmap.put(temp.data, true);\\n temp = temp.next;\\n }\\n temp = head.next;\\n prev = head;\\n while(temp!=null){\\n if(hmap.containsKey(temp.data)){\\n if(hmap.get(temp.data)==true){\\n hmap.put(temp.data, false);\\n }\\n else{\\n prev.next = temp.next;\\n prev = temp;\\n }\\n }\\n else {\\n prev = temp;\\n }\\n temp = temp.next;\\n\\n }\\n return head;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb78e174923678a3aad59015863bdedc\",\n \"score\": \"0.5776131\",\n \"text\": \"public interface IFPTree_Node<T> {\\n\\n Map<T, IFPTree_Node> getNodes();\\n\\n int getCount();\\n\\n void setCount(int newCount);\\n\\n int getPatternCount ();\\n\\n T getName();\\n\\n IFPTree_Node<T> getLink ();\\n\\n void setLink (IFPTree_Node<T> link);\\n\\n IFPTree_Node<T> getParent ();\\n\\n HashMap<LinkedList<IFPTree_Node<T>>, Integer> getAncestors ();\\n\\n void updateCount ();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c9a1a73da87d86946984e069cbca91b\",\n \"score\": \"0.57706153\",\n \"text\": \"public static Node solution(Node head) {\\r\\n if (head == null) return null;\\r\\n Node copyHead = new Node(0), curr = copyHead;\\r\\n int i = 0;\\r\\n Map<Node, Integer> oldNodeToIndexMap = new HashMap<>();\\r\\n List<Node> oldRandomList = new ArrayList<>();\\r\\n List<Node> newNodeList = new ArrayList<>();\\r\\n // first round only create the new deep copy of next\\r\\n while (head != null) {\\r\\n curr.next = new Node(head.val);\\r\\n oldNodeToIndexMap.put(head, i);\\r\\n oldRandomList.add(head.random);\\r\\n curr = curr.next;\\r\\n newNodeList.add(curr);\\r\\n head = head.next;\\r\\n ++i;\\r\\n }\\r\\n for (i = 0; i < oldRandomList.size(); ++i) {\\r\\n Node randomNode = oldRandomList.get(i);\\r\\n if (randomNode == null) continue;\\r\\n Integer index = oldNodeToIndexMap.get(randomNode);\\r\\n if (index != null) {\\r\\n newNodeList.get(i).random = newNodeList.get(index);\\r\\n }\\r\\n }\\r\\n return copyHead.next;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b41c6837f03f64ab8bc85a4eac4116e\",\n \"score\": \"0.57663214\",\n \"text\": \"private static void traverseAndAddToLinkedList(ListNode res) {\\n\\t\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b62bb921b58e2d19eafd4a24e9e4aeb\",\n \"score\": \"0.5762674\",\n \"text\": \"public void NNLLookup(int TarNode){\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0769b2533b9cba92f328860d77d4dcd0\",\n \"score\": \"0.5755117\",\n \"text\": \"private void addNode(DoubleLinkedNode node) {\\n\\n node.pre = head;\\n node.post = head.post;\\n\\n head.post.pre = node;\\n head.post = node;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1145ca31ef571a49a62083096bf05d5\",\n \"score\": \"0.5745305\",\n \"text\": \"private static Node deleteDupsWithoutDataStructure(Node node){\\n if(node == null || node.next == null) return node;\\n\\n Node head = node;\\n\\n while(node != null){\\n int val = node.value;\\n\\n Node runnerPrev = node;\\n Node runner = node.next;\\n while(runner != null){\\n if(runner.value == val){\\n runnerPrev.next = runner.next;\\n runner = runnerPrev;\\n }\\n\\n runnerPrev = runner;\\n runner = runner.next;\\n\\n }\\n node = node.next;\\n }\\n return head;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54305079fe46ca55a008c0f19a110558\",\n \"score\": \"0.57357675\",\n \"text\": \"public static void main(String[] args) {\\n\\n// List<Integer> list = new LinkedList<>();\\n// list.add(20);\\n// list.add(0,10);\\n// list.add(30);\\n// list.add(list.size(), 40);\\n//// list.remove(1);\\n// System.out.println(list);\\n\\n HashMap<String, String> stringStringHashMap = new HashMap<>();\\n// new LinkedList<>()\\n\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5fd50c843b11647e97058416db8cfde6\",\n \"score\": \"0.5727919\",\n \"text\": \"@Test\\n\\tpublic void testSinglyLinkedList(){\\n\\t\\tSystem.out.println(\\\"Length \\\"+linkedList.lengthOfLinkedList());\\n\\t\\tlinkedList.traverse();\\n\\t\\tlinkedList.addAfter(21, 90);\\n\\t\\tSystem.out.println(\\\"Length \\\"+linkedList.lengthOfLinkedList());\\n\\t\\tlinkedList.traverse();\\n\\t\\tlinkedList.addAfter(67, 42);\\n\\t\\tSystem.out.println(\\\"Length \\\"+linkedList.lengthOfLinkedList());\\n\\t\\tlinkedList.traverse();\\n\\t\\tlinkedList.deleteAfter(49);\\n\\t\\tSystem.out.println(\\\"Length \\\"+linkedList.lengthOfLinkedList());\\n\\t\\tlinkedList.traverse();\\n\\t\\tSystem.out.println(\\\"Mid Node Brute Method \\\"+linkedList.findMidNodeBruteMethod().getValue());\\n\\t\\tSystem.out.println(\\\"Mid Node \\\"+linkedList.findMidNode().getValue());\\n\\n\\t\\t\\n\\t\\tlinkedList.deleteFront();\\n\\t\\tSystem.out.println(\\\"Length \\\"+linkedList.lengthOfLinkedList());\\n\\t\\tlinkedList.traverse();\\n\\t\\tSystem.out.println(\\\"Mid Node Brute Method \\\"+linkedList.findMidNodeBruteMethod().getValue());\\n\\t\\tSystem.out.println(\\\"Mid Node \\\"+linkedList.findMidNode().getValue());\\n\\t\\t\\n\\t\\tlinkedList.reverse();\\n\\t\\tlinkedList.traverse();\\n\\t\\t\\n\\t\\tlinkedList.swap(12, 45);\\n\\t\\tlinkedList.traverse();\\n\\t\\t\\n\\t\\t// creating a loop in linked list\\n\\t\\tSystem.out.println(\\\"Head = \\\"+linkedList.head.getValue() );\\n\\t\\tSystem.out.println(\\\"Tail = \\\"+linkedList.tail.getValue() );\\n\\t\\tlinkedList.tail.setNextRef(linkedList.head.getNextRef().getNextRef());\\n\\t\\tlinkedList.detectLoop();\\n\\t\\tlinkedList.traverse();\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e175e61e6466250beed84d01969b624\",\n \"score\": \"0.5719096\",\n \"text\": \"public static void main(String[] args) {\\n\\t\\t\\r\\n\\tSinglyLinkedList linkedList = new SinglyLinkedList();\\r\\n\\t\\r\\n\\tfor (int i = 1; i < 8; i++) {\\r\\n\\t\\tlinkedList.insertAtEnd(i);\\r\\n\\t}\\r\\n\\t\\r\\n\\t\\r\\n\\tint k = 3;\\r\\n\\t\\r\\n\\t\\r\\n\\t\\r\\n\\t\\r\\n\\t// Solution with one pointer and two traverser\\r\\n\\t\\r\\n//\\tint n = 0;\\r\\n//\\t\\r\\n//\\tNode node = linkedList.getHead();\\r\\n//\\t\\r\\n//\\twhile(node != null) {\\r\\n//\\t\\tn++;\\r\\n//\\t\\tnode = node.getNext();\\r\\n//\\t}\\r\\n//\\t\\r\\n//\\tif(n-k+1>0) {\\r\\n//\\t\\tnode = linkedList.getHead();\\r\\n//\\t\\tint i = 1;\\r\\n//\\t\\twhile(i<=n-k) {\\r\\n//\\t\\t\\tnode = node.getNext();\\r\\n//\\t\\t\\ti++;\\r\\n//\\t\\t}\\r\\n//\\t\\t\\r\\n//\\t\\tSystem.out.println(node.getData());\\r\\n\\t\\r\\n\\t\\r\\n\\t\\r\\n\\t\\r\\n\\t// Solution with two pointers and one traverser\\r\\n\\t\\r\\n\\t\\r\\n\\tlinkedList.display();\\r\\n\\tSystem.out.println();\\r\\n\\t\\r\\n\\tNode fast = linkedList.getHead();\\r\\n\\tNode slow = linkedList.getHead();\\r\\n\\t\\r\\n\\t\\r\\n\\tint i = 1;\\t\\r\\n\\twhile(i<k) {\\r\\n\\t\\tfast = fast.getNext();\\r\\n\\t\\ti++;\\r\\n\\t}\\r\\n\\t\\r\\n\\twhile(fast.getNext() != null) {\\r\\n\\t\\t\\r\\n\\t\\tfast = fast.getNext();\\r\\n\\t\\tslow = slow.getNext();\\r\\n\\t\\t\\r\\n\\t}\\r\\n\\t\\r\\n\\tlinkedList.display();\\r\\n\\tSystem.out.println();\\r\\n\\t\\r\\n\\t \\tSystem.out.println(slow.getData());\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"802c636992675f31c3006b1406e5fb5a\",\n \"score\": \"0.5707903\",\n \"text\": \"public HashNode<K,V> getListNode(K key){\\n\\n\\t\\t// ADD CODE BELOW HERE\\n\\n\\t\\tHashNode <K, V> curr = head;\\n\\t\\twhile(curr != null) {\\n\\t\\t\\tif(curr.getKey().equals(key)) {\\n\\t\\t\\t\\treturn curr;\\n\\t\\t\\t}\\n\\t\\t\\tcurr=curr.getNext();\\n\\n\\t\\t}\\n\\t\\treturn null;\\n\\n\\t\\t// ADD CODE ABOVE HERE\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"84589eb8bee2873f42d0b6acdad0ccf4\",\n \"score\": \"0.57006705\",\n \"text\": \"@Override\\r\\n public ListNode searchNode(Integer key) {\\r\\n\\r\\n\\t//Your code goes here\\r\\n if(!contains(key)){\\r\\n return null;\\r\\n }\\r\\n if(root.key==key){//if its by the front already or is single node\\r\\n ListNode placeholder=root;\\r\\n placeholder=new ListNode(root.key, root.data);\\r\\n calculateData();\\r\\n return placeholder;\\r\\n }\\r\\n else{\\r\\n ListNode placeholder;\\r\\n ListNode trans= root;\\r\\n ListNode prev=trans;\\r\\n ListNode prev2=prev;\\r\\n while(trans.key!=key){\\r\\n prev2=prev;\\r\\n prev=trans;\\r\\n trans=trans.next;\\r\\n }\\r\\n if(prev2!=prev){\\r\\n //placeholder=trans;\\r\\n placeholder=new ListNode(trans.key, trans.data);\\r\\n prev.next=trans.next;\\r\\n prev2.next=trans;\\r\\n trans.next=prev;\\r\\n //calculateData();\\r\\n //return placeholder\\r\\n }\\r\\n else{\\r\\n //placeholder=trans;\\r\\n placeholder=new ListNode(trans.key, trans.data);\\r\\n prev.next=trans.next;\\r\\n trans.next=prev;\\r\\n root=trans;\\r\\n //calculateData();\\r\\n\\r\\n\\r\\n }\\r\\n\\r\\n\\r\\n calculateData();\\r\\n return placeholder;\\r\\n\\r\\n\\r\\n }\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a29625efbbb06852599e39193d014d3d\",\n \"score\": \"0.56777936\",\n \"text\": \"public static void deleteDuplicate(Node node){\\r\\n\\t\\tHashtable<Integer, Boolean> table = new Hashtable<Integer, Boolean>();\\r\\n\\t\\tNode runner = node;\\r\\n\\t\\tif(node == null) return;\\r\\n\\t\\ttable.put(node.data, true);\\r\\n\\t\\t\\r\\n\\t\\twhile(runner.next!=null){\\r\\n\\t\\t\\tif(table.contains(runner.next.data)){\\r\\n\\t\\t\\t\\trunner.next = runner.next.next;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse if(!table.contains(runner.next.data)){\\r\\n\\t\\t\\t\\ttable.put(runner.next.data, true);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\trunner = runner.next;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"92a09291c802346b307a2d108914dd25\",\n \"score\": \"0.5669202\",\n \"text\": \"private void addNode(DLinkedNode node) {\\n node.prev = head;\\n node.next = head.next;\\n\\n head.next.prev = node;\\n head.next = node;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c7d117c4754dd84741bccda599e6d8e\",\n \"score\": \"0.5649626\",\n \"text\": \"public void set(int key, int value) {\\r\\n if (map.containsKey(key)) {\\r\\n DLLNode oldNode = map.get(key);\\r\\n oldNode.value = value;\\r\\n remove(oldNode);\\r\\n setHead(oldNode);\\r\\n } else {\\r\\n // insert\\r\\n DLLNode newNode = new DLLNode(key, value);\\r\\n if (map.size() >= capacity) {\\r\\n map.remove(end.key);\\r\\n remove(end);\\r\\n }\\r\\n setHead(newNode);\\r\\n map.put(key, newNode);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e4b152703cb6760e46275a8ae162dc3\",\n \"score\": \"0.564656\",\n \"text\": \"private void addNode(DoublyLinkedList node) {\\n node.prev = head;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f9155f735d23d55a0f86394a4708effc\",\n \"score\": \"0.56399393\",\n \"text\": \"public static void main(String [] args)\\n {\\n Node n1 = new Node(new Integer(6));\\n Node n2 = new Node(new Integer(11));\\n\\n /* \\\"hook up\\\" the nodes\\n head will be a a new Node refence \\n referring to the to the first node \\n (containing 6)\\n the next/last node will be the node containing 11\\n */\\n Node head;\\n n1.setNext(n2);\\n head=n1;\\n \\n /* insert a new Node containing 13 into the list\\n as the 2nd element\\n */\\n Node newNode = new Node(new Integer(13), head.getNext());\\n head.setNext(newNode);\\n n1=n2=null;\\n \\n /* insert a new Node, containing 10 at the end of the\\n list \\n To do this, create a new Node reference, called prev.\\n prev will start at head. as long as prev->next does\\n not equal null, keep moving down the list. When \\n the loop ends, prev will refer to the last item \\n in the list. How do you use this to add the new node?\\n */\\n newNode = new Node(new Integer(10));\\n Node prev=head;\\n while (prev.getNext() != null)\\n {\\n prev = prev.getNext();\\n }\\n prev.setNext(newNode); // next already contains null\\n /* complete method displayList below \\n test it out by displaying current list*/\\n// displayList(head);\\n /* write a loop that searches the list (starting at head) for\\n The first occurrence of the Node containing Integer 11. \\n At the end of the loop, a Node reference curr should hold a\\n reference to the Node containing 11 or null if no such Node\\n exists. Hint : this should be helpful in your find method of \\n your linked list.\\n */ \\n// Integer toFind = new Integer(11); \\n// Node curr = head;\\n// while (!curr.getItem().equals(toFind))\\n// {\\n// curr = curr.getNext();\\n// }\\n \\n /* now modify the previous loop with also manage a prev reference.\\n At the end of the loop, curr will hold a reference to the desired \\n Node, prev will hold a reference to the Node that precedes the Node\\n reference by curr.\\n */\\n Integer toFind = new Integer(11); \\n Node curr = head;\\n prev = null;\\n while (!curr.getItem().equals(toFind))\\n {\\n prev = curr;\\n curr = curr.getNext();\\n }\\n\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb21a6bd1da19814f144a39644db0edd\",\n \"score\": \"0.5639303\",\n \"text\": \"public RandomListNode copyRandomList(RandomListNode head) {\\n HashMap<RandomListNode, RandomListNode> map = new HashMap<>();\\n RandomListNode cur = head;\\n while (cur != null) { // copy points\\n map.put(cur, new RandomListNode(cur.label));\\n cur = cur.next;\\n }\\n cur = head;\\n while (cur != null) { // connect lines\\n map.get(cur).next = map.get(cur.next);\\n map.get(cur).random = map.get(cur.random);\\n cur = cur.next;\\n }\\n return map.get(head);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5115d4b584f90753765c50c1a503796\",\n \"score\": \"0.5629344\",\n \"text\": \"interface ListNode {\\n int getItem();\\n ListNode getNext();\\n void setNext(ListNode next);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4492add27d498e09cf2e4e598960052a\",\n \"score\": \"0.5619852\",\n \"text\": \"Map<Long, NodeEntry> getNodeMap();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ad8ff91f869a047ec6ad25cc51550f6a\",\n \"score\": \"0.5617803\",\n \"text\": \"public ListNode deleteDuplicatesII(ListNode head) {\\n //刚开始可以用hashmap存起来，然后在map里的都删除，但这样显得没啥技术含量\\n //这个版本感觉写的不简洁啊\\n if(head==null||head.next==null)\\n return head;\\n ListNode first=new ListNode(Integer.MIN_VALUE);\\n ListNode p=first;\\n ListNode q=head;\\n ListNode qq=head.next;\\n while(qq!=null){\\n if(qq.val==q.val){\\n while(qq!=null && qq.next!=null && qq.val==qq.next.val)\\n qq=qq.next;\\n p.next=qq.next;\\n q=qq!=null?qq.next:null;\\n qq=q!=null?q.next:null;\\n }else{\\n p.next=q;\\n p=p.next;\\n q=qq;\\n qq=qq.next;\\n }\\n }\\n return first.next;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"271ff873e6187696e6ef4137c94b1bca\",\n \"score\": \"0.55998003\",\n \"text\": \"private void addHead(Node node){\\n Node after = head.next;\\n head.next = node;\\n node.prev = head;\\n node.next = after;\\n after.prev = node;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19638fbd77698d30936d70a2cb93c09c\",\n \"score\": \"0.5593997\",\n \"text\": \"public void inc(String key) {\\n\\t\\t\\tInteger cnt = map.get(key);\\n\\t\\t\\tif (cnt == null) {\\n\\t\\t\\t\\tcnt = 1;\\n\\t\\t\\t\\tListNode listNode = listNodeMap.get(cnt);\\n\\t\\t\\t\\tif (listNode == null) {\\n\\t\\t\\t\\t\\tlistNode = new ListNode();\\n\\t\\t\\t\\t\\tlistNodeMap.put(cnt, listNode);\\n\\t\\t\\t\\t\\tif (tail == null) {\\n\\t\\t\\t\\t\\t\\t// tail ==null，那head肯定==null\\n\\t\\t\\t\\t\\t\\thead = tail = listNode;\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\ttail.next = listNode;\\n\\t\\t\\t\\t\\t\\tlistNode.pre = tail;\\n\\t\\t\\t\\t\\t\\ttail = listNode;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tlistNode.keys.add(key);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t// 处理原来这个key所在的listNode;\\n\\t\\t\\t\\tListNode listNode = listNodeMap.get(cnt);\\n\\t\\t\\t\\tListNode pre = listNode.pre;\\n\\t\\t\\t\\tlistNode.keys.remove(key);\\n\\t\\t\\t\\tif (listNode.keys.size() <= 0) {\\n\\t\\t\\t\\t\\tthis.delListNode(listNode, cnt);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcnt++;\\n\\t\\t\\t\\tlistNode = listNodeMap.get(cnt);\\n\\t\\t\\t\\tif (listNode == null) {\\n\\t\\t\\t\\t\\tlistNode = new ListNode();\\n\\t\\t\\t\\t\\tlistNodeMap.put(cnt, listNode);\\n\\t\\t\\t\\t\\tif (pre == null) {\\n\\t\\t\\t\\t\\t\\t// 当前是最大的元素\\n\\t\\t\\t\\t\\t\\tif (head != null) {\\n\\t\\t\\t\\t\\t\\t\\tlistNode.next = head;\\n\\t\\t\\t\\t\\t\\t\\thead.pre = listNode;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\thead = listNode;\\n\\t\\t\\t\\t\\t\\tif (tail == null) {\\n\\t\\t\\t\\t\\t\\t\\ttail = listNode;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tListNode next = pre.next;\\n\\t\\t\\t\\t\\t\\tif (next != null) {\\n\\t\\t\\t\\t\\t\\t\\tlistNode.pre = pre;\\n\\t\\t\\t\\t\\t\\t\\tlistNode.next = next;\\n\\t\\t\\t\\t\\t\\t\\tnext.pre = listNode;\\n\\t\\t\\t\\t\\t\\t\\tpre.next = listNode;\\n\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\tlistNode.pre = pre;\\n\\t\\t\\t\\t\\t\\t\\tlistNode.next = null;\\n\\t\\t\\t\\t\\t\\t\\tpre.next = listNode;\\n\\t\\t\\t\\t\\t\\t\\ttail = listNode;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tlistNode.keys.add(key);\\n\\t\\t\\t}\\n\\n\\t\\t\\tmap.put(key, cnt);\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a76b164283400ae3f09968400676fa6\",\n \"score\": \"0.5592055\",\n \"text\": \"Node<K,V> newNode(int hash, K key, V value, Node<K,V> next) {\\n return new Node<>(hash, key, value, next);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9ff9a5a6b98dff0caf352fc406c87af\",\n \"score\": \"0.5584462\",\n \"text\": \"public interface List<T extends Comparable<T>> extends Iterable<T> {\\n\\n\\n class Node<T> {\\n public T data;\\n public Node<T> next;\\n\\n public Node(T value) {\\n this.data = value;\\n this.next = null;\\n }\\n\\n @Override\\n public String toString(){\\n return String.valueOf(data);\\n }\\n }\\n\\n void deleteAt(int pos);\\n\\n void insertBefore(T value, int pos);\\n\\n void insertAfter(T value, int pos);\\n\\n void appendBack(T value);\\n\\n //brute_n_3 force\\n void reverseBrute();\\n\\n void reverse();\\n\\n void clear();\\n\\n Node deleteElements(int val);\\n\\n void reverseStack();\\n\\n T get(int index);\\n\\n void print();\\n\\n int size();\\n\\n void introduceCycleForTest();\\n\\n Node findCycle();\\n\\n T set(int j, T t);\\n\\n void toArray(T[] array);\\n\\n Node<T> deleteFront();\\n\\n Node<T> deleteBack();\\n\\n void appendFront(T t);\\n\\n boolean orderedElementsFound(List<T> subList);\\n\\n void insertInOrder(T data);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0676fcd7789649253f7d7b015de37ffa\",\n \"score\": \"0.55826443\",\n \"text\": \"private void evict(){\\n if(head == null) return;\\n map.remove(head.key);\\n if(head == tail){\\n head = null;\\n tail = null;\\n }else{\\n Node temp = head.next;\\n temp.prev = null;\\n head.next = null;\\n head = temp;\\n }\\n num--;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ad5b1e951eee71dcd11df22766dc0b0\",\n \"score\": \"0.55714583\",\n \"text\": \"private Node link(Node n1, Node n2) {\\n if (n1 == null) return n2;\\n else if (n2 == null) return n1;\\n else if (n1 == n2) return n1;\\n \\n int c = n1.key.compareTo(n2.key);\\n if (c < 0) {\\n addChild(n1, n2);\\n return n1;\\n } \\n else {\\n addChild(n2, n1);\\n return n2;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee3a1906c82039ed5c40fb79af0eeee9\",\n \"score\": \"0.5559335\",\n \"text\": \"public void addAtHead(int val) {\\n ListNode newHead = new ListNode(val);\\n newHead.next = head;\\n head = newHead;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de5b4aa320226d97f61ca73943d84b41\",\n \"score\": \"0.55586135\",\n \"text\": \"private void rehash() {\\n System.out.println(\\\"brb busy...Re-Hashing\\\");\\n REAL_SIZE = 0;\\n MapNode<T>[] temp = bucket;\\n bucket = new MapNode[bucket.length*2];\\n for (int i = 0; i < temp.length; i++) {\\n if (temp[i] != null) {\\n MapNode<T> node = temp[i];\\n put(node.v, node.k);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c7f845a83550453e55c3e5f80c0e33f\",\n \"score\": \"0.55517167\",\n \"text\": \"MapNode<T> getMapNode(String key){\\n return bucket[getHashIndex(key)];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bff8983384be014b3b7718229c1f5ad\",\n \"score\": \"0.5548966\",\n \"text\": \"public interface Linklist {\\n public Boolean isEmpty();\\n public void addElementAtTop(int data);\\n public void printListFromStart();\\n public void reverseList();\\n public void reverseListItteratively();\\n public Integer middleOfList();\\n public int count();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"504d87528e0fe2919ddbf96f1032e18c\",\n \"score\": \"0.5543908\",\n \"text\": \"public void remove(int key) {\\n int hash = hash(key);\\n if(null == map[hash]){\\n return;\\n }\\n ListNode start = map[hash], current = start.next, prev = start;\\n if(null == current){\\n return;\\n }\\n while(null != current){\\n if(current.key == key){\\n ListNode next = current.next;\\n if(null == next){\\n prev.next = null;\\n }else{\\n current.key = next.key;\\n current.value = next.value;\\n current.next = next.next;\\n }\\n return;\\n }\\n prev = current;\\n current = current.next;\\n }\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37a3412a6b0ff10bf07ce2ec705927ab\",\n \"score\": \"0.55438477\",\n \"text\": \"public final kotlinx.coroutines.internal.LockFreeLinkedListNode a(kotlinx.coroutines.internal.OpDescriptor r7) {\\n /*\\n r6 = this;\\n L_0x0000:\\n java.lang.Object r0 = r6._prev\\n kotlinx.coroutines.internal.LockFreeLinkedListNode r0 = (kotlinx.coroutines.internal.LockFreeLinkedListNode) r0\\n r1 = 0\\n r2 = r0\\n L_0x0006:\\n r3 = r1\\n L_0x0007:\\n java.lang.Object r4 = r2._next\\n if (r4 != r6) goto L_0x0018\\n if (r0 != r2) goto L_0x000e\\n return r2\\n L_0x000e:\\n java.util.concurrent.atomic.AtomicReferenceFieldUpdater r1 = kotlinx.coroutines.internal.LockFreeLinkedListNode.b\\n boolean r0 = r1.compareAndSet(r6, r0, r2)\\n if (r0 != 0) goto L_0x0017\\n goto L_0x0000\\n L_0x0017:\\n return r2\\n L_0x0018:\\n boolean r5 = r6.isRemoved()\\n if (r5 == 0) goto L_0x001f\\n return r1\\n L_0x001f:\\n if (r4 != r7) goto L_0x0022\\n return r2\\n L_0x0022:\\n boolean r5 = r4 instanceof kotlinx.coroutines.internal.OpDescriptor\\n if (r5 == 0) goto L_0x0038\\n if (r7 == 0) goto L_0x0032\\n r0 = r4\\n kotlinx.coroutines.internal.OpDescriptor r0 = (kotlinx.coroutines.internal.OpDescriptor) r0\\n boolean r0 = r7.isEarlierThan(r0)\\n if (r0 == 0) goto L_0x0032\\n return r1\\n L_0x0032:\\n kotlinx.coroutines.internal.OpDescriptor r4 = (kotlinx.coroutines.internal.OpDescriptor) r4\\n r4.perform(r2)\\n goto L_0x0000\\n L_0x0038:\\n boolean r5 = r4 instanceof u6.a.k0.b\\n if (r5 == 0) goto L_0x0052\\n if (r3 == 0) goto L_0x004d\\n java.util.concurrent.atomic.AtomicReferenceFieldUpdater r5 = kotlinx.coroutines.internal.LockFreeLinkedListNode.a\\n u6.a.k0.b r4 = (u6.a.k0.b) r4\\n kotlinx.coroutines.internal.LockFreeLinkedListNode r4 = r4.a\\n boolean r2 = r5.compareAndSet(r3, r2, r4)\\n if (r2 != 0) goto L_0x004b\\n goto L_0x0000\\n L_0x004b:\\n r2 = r3\\n goto L_0x0006\\n L_0x004d:\\n java.lang.Object r2 = r2._prev\\n kotlinx.coroutines.internal.LockFreeLinkedListNode r2 = (kotlinx.coroutines.internal.LockFreeLinkedListNode) r2\\n goto L_0x0007\\n L_0x0052:\\n */\\n // java.lang.String r3 = \\\"null cannot be cast to non-null type kotlinx.coroutines.internal.Node /* = kotlinx.coroutines.internal.LockFreeLinkedListNode */\\\"\\n /*\\n java.util.Objects.requireNonNull(r4, r3)\\n kotlinx.coroutines.internal.LockFreeLinkedListNode r4 = (kotlinx.coroutines.internal.LockFreeLinkedListNode) r4\\n r3 = r2\\n r2 = r4\\n goto L_0x0007\\n */\\n throw new UnsupportedOperationException(\\\"Method not decompiled: kotlinx.coroutines.internal.LockFreeLinkedListNode.a(kotlinx.coroutines.internal.OpDescriptor):kotlinx.coroutines.internal.LockFreeLinkedListNode\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81866e137b37a018dd0972811f5f8cb5\",\n \"score\": \"0.55417186\",\n \"text\": \"protected void addEntry(AbstractHashedMap.HashEntry entry, int hashIndex) {\\n/* 253 */ LinkEntry link = (LinkEntry)entry;\\n/* 254 */ link.after = this.header;\\n/* 255 */ link.before = this.header.before;\\n/* 256 */ this.header.before.after = link;\\n/* 257 */ this.header.before = link;\\n/* 258 */ this.data[hashIndex] = entry;\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"79277f057dccfc7e9e6244e3c65b5230\",\n \"score\": \"0.55393654\",\n \"text\": \"public void put(int key, int value) {\\n int index = getHashValue(key);\\n if (buckets[index] == null) {\\n buckets[index] = new ListNode(key, value);\\n } else {\\n if (buckets[index].key == key) {\\n buckets[index].value = value;\\n return;\\n }\\n ListNode preNode = findPreNode(buckets[index], key);\\n if (preNode.next == null) {\\n preNode.next = new ListNode(key, value);\\n } else {\\n preNode.next.value = value;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e2947f4b948bcb1a9c9d9498fa9ea18\",\n \"score\": \"0.5532107\",\n \"text\": \"public void testRemove() {\\n dll.add(\\\"one\\\");\\n dll.add(\\\"two\\\");\\n dll.add(\\\"three\\\");\\n dll.head();\\n dll.next();\\n dll.next();\\n\\n dll.remove();\\n\\n assertEquals(2, dll.size());\\n assertEquals(\\\"one\\\", dll.current().data());\\n assertEquals(\\\"three\\\", dll.next());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0a396b88e813ce22e74215195139b4e\",\n \"score\": \"0.55300987\",\n \"text\": \"public void setNext(DLLNode newNext);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"15c73c2b7e5200e24ab40c5b0c9cd174\",\n \"score\": \"0.55208355\",\n \"text\": \"public Node copy(Node head){\\n if(head == null){\\n return null;\\n }\\n\\n Node dummy = new Node(0);\\n Node cur = dummy;\\n\\n //maintains the mapping between the node in the original list\\n //and the corresponding node in the new list\\n Map<Node, Node> map = new HashMap<>();\\n while(head != null){\\n if(!map.containsKey(head)){\\n map.put(head, new Node(head.val));\\n }\\n //connect the copied node to the deep copy list\\n cur.next = map.get(head);\\n //copy the random node if necessary\\n if(head.random != null){\\n if(!map.containsKey(head.random)){\\n map.put(head.random, new Node(head.random.val));\\n }\\n\\n // connect the copied node to the deep copy list\\n cur.next.random = map.get(head.random);\\n\\n }\\n head = head.next;\\n cur = cur.next;\\n }\\n return dummy.next;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0d4ef81da174cad486a65d968a2fc1e\",\n \"score\": \"0.55157447\",\n \"text\": \"protected LinkEntry(AbstractHashedMap.HashEntry next, int hashCode, Object key, Object value) {\\n/* 519 */ super(next, hashCode, key, value);\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a98544b2dc28f6ea446ab575ab4b5f86\",\n \"score\": \"0.5511776\",\n \"text\": \"public static LinkedListNode removeDuplicates2(LinkedListNode node) {\\n\\t\\tLinkedListNode head = node;\\n\\t\\tHashMap<Integer, Integer> map = new HashMap<Integer, Integer>();\\n\\t\\twhile (node.next != null) {\\n\\t\\t\\tif (map.containsKey((int)node.data)) {\\n\\t\\t\\t\\tnode.pre.next = node.next;\\n\\t\\t\\t\\tnode.next.pre = node.pre;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tmap.put((int)node.data, 1);\\n\\t\\t\\t}\\n\\t\\t\\tnode = node.next;\\n\\t\\t}\\n\\t\\treturn head;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7d99647b43142c01505763d15f05994\",\n \"score\": \"0.55064976\",\n \"text\": \"private Node<E> nodeAt(int index)\\n {\\n if (index >= 0 && index < size) {\\n Node<E> temp = head;\\n for (int i = 0; i < index; i++) // traverse the list\\n temp = temp.next;\\n return temp;\\n } else {\\n throw new IndexOutOfBoundsException();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ea21f5ea836d09d424391554b0e0d80\",\n \"score\": \"0.55048835\",\n \"text\": \"@Override\\n\\tpublic boolean add(T elem) {\\n\\t\\tif (elem == null || find(elem) != null) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\n\\t\\t/*\\n\\t\\t * PREVIOUSLY REFACTORED CODE int counter = 0; int position =\\n\\t\\t * probing(elem, counter); HashNode<T> node = table[position]; while\\n\\t\\t * (node != null && node.getState() == HashNode.FULL) { position =\\n\\t\\t * probing(elem, counter); node = table[position]; counter++; }\\n\\t\\t */\\n\\t\\t\\n\\t\\t\\n\\t\\tint position = 0;\\n\\t\\tint counter = 0;\\n\\t\\tHashNode<T> node = null;\\n\\t\\t\\n\\t\\t// repeat until we find a null, empty or deleted node\\n\\t\\tdo {\\n\\t\\t\\tposition = probing(elem, counter);\\n\\t\\t\\tnode = table[position];\\n\\t\\t\\tcounter++;\\n\\t\\t} while (node != null && node.getState() == HashNode.FULL);\\n\\n\\t\\t// set the info for the new node\\n\\t\\ttable[position] = new HashNode<T>();\\n\\t\\ttable[position].setInfo(elem);\\n\\t\\tnumElements++;\\n\\t\\tupsize();\\n\\n\\t\\treturn true;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aebe3efd221fc0a2ee19d9a8c549dc54\",\n \"score\": \"0.54898953\",\n \"text\": \"public RandomListNode copy(RandomListNode head) {\\n\\t\\tif (head == null) {\\n\\t\\t\\treturn head;\\n\\t\\t}\\n\\t\\t// copy the head at first\\n\\t\\tRandomListNode oldCur = head;\\n\\t\\tRandomListNode newCur = new RandomListNode(oldCur.value);\\n\\t\\t// keep newHead and return it in the end\\n\\t\\tRandomListNode newHead = newCur;\\n\\t\\t// record 1-1 relation\\n\\t\\tMap<RandomListNode, RandomListNode> map = new HashMap<>();\\n\\t\\tmap.put(oldCur, newCur);\\n\\n\\t\\twhile (oldCur != null) {\\n\\t\\t\\tRandomListNode next = oldCur.next;\\n\\t\\t\\tif (next != null) {\\n\\t\\t\\t\\tRandomListNode nextCopy = map.get(next);\\n\\t\\t\\t\\tif (nextCopy == null) {\\n\\t\\t\\t\\t\\tnextCopy = new RandomListNode(next.value);\\n\\t\\t\\t\\t\\tmap.put(next, nextCopy);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tnewCur.next = nextCopy;\\n\\t\\t\\t}\\n\\n\\t\\t\\tRandomListNode random = oldCur.random;\\n\\t\\t\\tif (random != null) {\\n\\t\\t\\t\\tRandomListNode randomCopy = map.get(random);\\n\\t\\t\\t\\tif (randomCopy == null) {\\n\\t\\t\\t\\t\\trandomCopy = new RandomListNode(random.value);\\n\\t\\t\\t\\t\\tmap.put(random, randomCopy);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tnewCur.random = randomCopy;\\n\\t\\t\\t}\\n\\n\\t\\t\\toldCur = oldCur.next;\\n\\t\\t\\tnewCur = newCur.next;\\n\\t\\t}\\n\\n\\t\\treturn newHead;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e9053e7856709f7180b9ba196ef271f\",\n \"score\": \"0.5487365\",\n \"text\": \"private void headToHeadLink(Graph dag, Vector index){\\n\\nNodeList nodes,nbX,nbY,subDsep;\\nHashtable sepSet;\\nLinkList links;\\nLink delLink,newLink;\\nint i,j,z,pos;\\nNode nodeX,nodeY,nodeZ;\\nboolean directedXY,directedYZ;\\n\\nnodes = dag.getNodeList();\\nlinks = dag.getLinkList();\\n\\n for(i=0;i< nodes.size();i++){\\n nodeX = (Node) nodes.elementAt(i);\\n nbX = dag.neighbours(nodeX);\\n for(j=0 ; j< nbX.size() ; j++){\\n\\t nodeY = (Node) nbX.elementAt(j);\\n\\t nbY = dag.neighbours(nodeY);\\n\\t nbY.removeNode(nodeX);\\n\\t for(z=0 ; z < nbY.size() ;z++){\\n\\t nodeZ = (Node) nbY.elementAt(z);\\n\\t if( nbX.getId(nodeZ) == -1 ){ // No adyacentes X y Z\\n\\t\\t pos = nodes.getId(nodeX);\\n\\t\\t sepSet = (Hashtable)index.elementAt(pos);\\n\\t\\t subDsep = (NodeList)sepSet.get(nodeZ);\\n\\t\\t if((subDsep!=null)&&(subDsep.getId(nodeY) == -1)){\\n\\t\\t delLink = links.getLinks(nodeX.getName(),nodeY.getName());\\n\\t\\t if(delLink == null){\\n\\t\\t\\t delLink = links.getLinks(nodeY.getName(),nodeX.getName());\\n\\t\\t }\\n\\t\\t directedXY = delLink.getDirected();\\n\\t\\t if(!directedXY){\\n\\t\\t try {\\n\\t\\t\\t dag.removeLink(delLink);\\n\\t\\t\\t dag.createLink(nodeX,nodeY);\\n\\t\\t\\t }\\n\\t\\t\\t catch (InvalidEditException iee) {};\\n\\t\\t }\\n\\t\\t delLink = links.getLinks(nodeY.getName(),nodeZ.getName());\\n\\t\\t if(delLink == null){ \\n\\t\\t\\t delLink = links.getLinks(nodeZ.getName(),nodeY.getName());\\n\\t\\t }\\n\\t\\t directedYZ = delLink.getDirected();\\n\\t\\t if(!directedYZ){\\n\\t\\t try {\\n\\t\\t\\t dag.removeLink(delLink);\\n\\t\\t\\t dag.createLink(nodeZ,nodeY);\\n\\t\\t\\t }\\n\\t\\t\\t catch (InvalidEditException iee) {};\\n\\t\\t\\t\\n\\t\\t }\\n\\t\\t }\\n\\t\\t \\n\\t }\\n\\t }\\n }\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96d4f5edf42da3f1c54ecbf4c21cf7c7\",\n \"score\": \"0.5483802\",\n \"text\": \"public abstract Node getNodeMappedTo(int index);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c61a58636560f26ad4090ea9e143021\",\n \"score\": \"0.5475807\",\n \"text\": \"Node<K, V> insert(Node<K, V> par, Node<K, V> nod, Node<K, V> prv, Node<K, V> nxt, Node<K, V> put, boolean rpl) {\\r\\n\\t\\tint cr; // compare result\\r\\n\\r\\n\\t\\tif (nod == null) {\\r\\n\\t\\t\\tput.left = null;\\r\\n\\t\\t\\tput.right = null;\\r\\n\\t\\t\\tput.balancer = random.nextInt();\\r\\n\\t\\t\\tsize++;\\r\\n\\t\\t\\tlinkNode(nod, prv, nxt, put);\\r\\n\\t\\t\\treturn put;\\r\\n\\t\\t} else if ((cr = nod.compareKey(put.getKey())) < 0) {\\r\\n\\t\\t\\tnod.right = insert(nod, nod.right, nod, nod.next, put, rpl);\\r\\n\\t\\t\\tif (nod.balancer > nod.right.balancer) {\\r\\n\\t\\t\\t\\tnod = promoteRight(nod);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\treturn nod;\\r\\n\\t\\t} else if (cr > 0) {\\r\\n\\t\\t\\tnod.left = insert(nod, nod.left, nod.prev, nod, put, rpl);\\r\\n\\t\\t\\tif (nod.balancer > nod.left.balancer) {\\r\\n\\t\\t\\t\\tnod = promoteLeft(nod);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\treturn nod;\\r\\n\\t\\t} else /* cr==0 */ {\\r\\n\\t\\t\\tif (!rpl) {\\r\\n\\t\\t\\t\\tthrow new Escape(Escape.OBJNOTFND, \\\"Node<K,V> already exists in the tree (\\\" + nod + \\\")\\\");\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tput.left = nod.left;\\r\\n\\t\\t\\tput.right = nod.right;\\r\\n\\t\\t\\tput.balancer = nod.balancer;\\r\\n\\t\\t\\tlinkNode(nod, prv, nxt, put);\\r\\n\\t\\t\\treturn put;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ccfd45ffd3b7cb2b4add9bd318c8e32\",\n \"score\": \"0.5464186\",\n \"text\": \"interface Node<T> {\\n /** Get the size of the node, that is how many data elements it holds */\\n int size ();\\n \\n /** Get the MBR of this node */\\n MBR getMBR (MBRConverter<T> converter);\\n \\n /** Visit this node and add the leafs to the found list and add \\n * any child nodes to the list of nodes to expand.\\n */\\n void expand (MBR mbr, MBRConverter<T> converter, \\n\\t\\t List<T> found, List<Node<T>> nodesToExpand);\\n \\n /** Find nodes that intersect with the given MBR.\\n */\\n void find (MBR mbr, MBRConverter<T> converter, List<T> result);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17b23363a7501f22ea08a68181e23eef\",\n \"score\": \"0.5461086\",\n \"text\": \"public static void main(String[] args) {\\n\\n\\n LinkedList l2=new LinkedList();\\n l2.push(6);\\n l2.push(5);\\n // l2.push(4);\\n // l2.push(3);\\n l2.push(4);\\n l2.push(3);\\n l2.push(2);\\n l2.push(1);\\n //l2.insert_afterData(3, 10);\\n System.out.println(\\\"Insert here\\\");\\n // l2.printList();\\n // System.out.println();\\n //System.out.println(\\\"Delete here\\\");\\n //l2.DeleteKey(5);\\n //l2.printList();\\n //l2.calcSize();\\n //l2.calcFrequency(); \\n //l2.swapNodes(5, 6);\\n l2.printList();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b960a67de40d7ad367f46e991f8f9b64\",\n \"score\": \"0.5450352\",\n \"text\": \"@Override\\n public void addNode(node_data n)\\n {\\n if(!this._nodes.containsKey(n.getKey()))\\n {\\n this._nodes.put(n.getKey(),n);\\n mc++;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"99781a2c562e1fa7d8838b07dabb0562\",\n \"score\": \"0.5450142\",\n \"text\": \"Node(int key) { // sentinel constructor\\n this.item = null;\\n this.key = key;\\n this.next = null;\\n this.marked = false;\\n this.tagged = false;\\n this.lock = new ReentrantLock();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ad56c7fa2524efa3cbb3d2b89080b59\",\n \"score\": \"0.5446001\",\n \"text\": \"@Override\\n public void addNode(node_data n) {\\n if (n != null) {\\n Vmap.put(n.getKey(), n);\\n HashMap<Integer, edge_data> Emap1 = new HashMap<Integer, edge_data>();\\n HashMap<Integer, edge_data> Emap2 = new HashMap<Integer, edge_data>();\\n SEmap.put(n.getKey(), Emap1);\\n DEmap.put(n.getKey(), Emap2);\\n MCcounter++;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bfab03fb30e0364788d642c65a21c9ea\",\n \"score\": \"0.54454035\",\n \"text\": \"private void remove(Node node) {\\n if (node == head) head = head.next;\\n if (node == tail) tail = tail.prev;\\n removeNodeBindings(node);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dec2380639be623c620bfe3fde48de2f\",\n \"score\": \"0.54452884\",\n \"text\": \"private void add(Node node) {\\n Node next = head.next;\\n head.next = node;\\n node.next = next;\\n node.prev = head;\\n next.prev = node;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa15ffe3647e2d33832555a317503d43\",\n \"score\": \"0.5443756\",\n \"text\": \"MyLinkedNode getHead() { return head; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19099e8d1584f55e3ff4f0001dd21bb1\",\n \"score\": \"0.544191\",\n \"text\": \"private Node<T> node(int index) {\\n \\tNode<T> x = first;\\n \\tfor(int i = 0; i < index - 1; i++) {\\n \\t\\tx = x.next;\\n \\t}\\n \\treturn x;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e6b710259bd5ffa2e37f4a4d27d92dc\",\n \"score\": \"0.54376334\",\n \"text\": \"private Node find(int key) {\\n Node p = bucket[key % DEFAULT_CAPACITY];\\n while (p != null && p.key != key) p = p.next;\\n\\n return p;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f1fc016cbad980db69da069e2205fd51\",\n \"score\": \"0.5432567\",\n \"text\": \"private Node<T, E> findNode(T key) {\\n Node<T, E> node = buckets[getBucketNumber(key)];\\n\\n while (node != null && !node.key.equals(key)) {\\n node = node.next;\\n }\\n\\n return node;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d466f98c2b037f2e7fde75b87f995f95\",\n \"score\": \"0.5430269\",\n \"text\": \"public void addNode(String word, Integer value) {\\n int whichBucket = whichBucket(word);\\n LLNode head = hashMap.get(whichBucket);\\n LLNode newNode = new LLNode(word, value);\\n\\n //if the word is already in the hashMap it will just increment count for it by 1\\n if (lookUp(newNode.getKey())) {\\n while (head != null) {\\n if (head.getKey().equals(word)) {\\n head.setValue(1 + head.getValue());\\n }\\n head = head.next;\\n }\\n }\\n // if word is not in the hashmap, it will add it to the hashmap\\n else {\\n newNode.next = head;\\n hashMap.set(whichBucket, newNode);\\n size++;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"85652b693cbe8888c2effe642042e193\",\n \"score\": \"0.5425547\",\n \"text\": \"private void reversePRHelper(Node node){\\n if(node == null) return;\\n\\n reversePRHelper(node.next);\\n\\n if(node == tail){\\n //nothing to add\\n } else {\\n node.next.next = node;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8cd5df3779c1a647235a1fc85df7ea88\",\n \"score\": \"0.54246914\",\n \"text\": \"public static void main(String[] args) {\\n Map<String, Integer> map = new LinkedListMap<>(5);\\n map.insert(\\\"one\\\", 1);\\n map.insert(\\\"two\\\", 2);\\n System.out.println(map);\\n System.out.println(map.size());\\n map.insert(\\\"three\\\", 3);\\n map.insert(\\\"four\\\", 4);\\n map.insert(\\\"five\\\", 5);\\n map.insert(\\\"six\\\", 6);\\n map.insert(\\\"seven\\\", 7);\\n map.insert(\\\"eight\\\", 8);\\n map.insert(\\\"nine\\\", 9);\\n System.out.println(map.size());\\n System.out.println(map.hasValue(9));\\n System.out.println(map.hasKey(\\\"three\\\"));\\n map.delete(\\\"three\\\");\\n// System.out.println(map.hasKey(\\\"three\\\"));\\n System.out.println(map.get(\\\"nine\\\"));\\n System.out.println(map);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40ca142056a8dedddf82072dde372cf0\",\n \"score\": \"0.5424267\",\n \"text\": \"@tags.LinkedList\\n @tags.HashTable\\n @tags.Company.Amazon\\n @tags.Company.Bloomberg\\n @tags.Company.Microsoft\\n @tags.Company.Uber\\n @tags.Status.OK\\n public RandomListNode copyRandomList(RandomListNode head) {\\n // copy nodes and append copy after each original node\\n RandomListNode current = head;\\n while (current != null) {\\n RandomListNode copy = new RandomListNode(current.label);\\n copy.next = current.next;\\n current.next = copy;\\n current = copy.next;\\n }\\n\\n // copy random pointer\\n current = head;\\n while (current != null) {\\n if (current.random != null) {\\n current.next.random = current.random.next;\\n }\\n current = current.next.next;\\n }\\n\\n // separate the 2 lists\\n RandomListNode dummy = new RandomListNode(0);\\n RandomListNode prev = dummy;\\n current = head;\\n while (current != null) {\\n prev.next = current.next;\\n current.next = current.next.next;\\n current = current.next;\\n prev = prev.next;\\n }\\n\\n return dummy.next;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c8571a7a281653e76957271786e2db8\",\n \"score\": \"0.5421797\",\n \"text\": \"@Override\\r\\n public boolean add(E o) {\\r\\n Node<E> newnode = new Node(o);\\r\\n if (head==null || (head.data.compareTo(newnode.data)>0)){\\r\\n newnode.next=head;\\r\\n head = newnode;\\r\\n incrementcounter();\\r\\n return true;\\r\\n }\\r\\n Node<E> currentnode = head;\\r\\n Node<E> previousnode = null;\\r\\n while (currentnode!=null){\\r\\n if (currentnode.data.compareTo(newnode.data)>0){\\r\\n previousnode.next = newnode;\\r\\n newnode.next=currentnode;\\r\\n incrementcounter();\\r\\n return true;\\r\\n }\\r\\n previousnode = currentnode;\\r\\n currentnode = currentnode.next;\\r\\n }\\r\\n previousnode.next=newnode;\\r\\n incrementcounter();\\r\\n return true;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b8f4efdda57c8548d86fbc38fb80be0\",\n \"score\": \"0.54195994\",\n \"text\": \"private void addNode (Node current, Node toAdd) {\\r\\n toAdd.prev = current.prev;\\r\\n toAdd.next = current;\\r\\n \\r\\n current.prev.next = toAdd;\\r\\n current.prev = toAdd;\\r\\n \\r\\n this.modCount++;\\r\\n this.size++;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d6ff61d060243199c11cca0017fcacf6\",\n \"score\": \"0.54183024\",\n \"text\": \"public interface Node<T extends Comparable<T>> {\\n\\n /**\\n *\\n * @param other other Node to compare keys with\\n * @return -1 less\\n * 0 equal\\n * 1 greater\\n */\\n int compareNode(Node<T> other);\\n\\n /**\\n *\\n * @return this nodes Key\\n *\\n */\\n T getKey();\\n\\n\\n /**\\n *\\n * @return this node's Value\\n */\\n Object getValue();\\n\\n Node<T> getL();\\n\\n Node<T> getR();\\n\\n void setL(Node<T> n);\\n\\n void setR(Node<T> n);\\n\\n int getCount();\\n\\n int getMaxDepth();\\n\\n /**\\n *\\n * @return\\n */\\n Node<T> rotateR();\\n\\n Node<T> rotateL();\\n\\n String printTree(int keylength_hint);\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c1aff6f343e30d5f281500fe8269aeff\",\n \"score\": \"0.54124457\",\n \"text\": \"Node getNode(String key){\\n //hash the string\\n int h = hash(key);\\n //bitwise & to fit it in the array\\n int i = h&(table.length-1);\\n //search for node and get it\\n for(Node e = table[i]; e!= null; e = e.next){\\n if(key.equals(e.key)){\\n return e;\\n }\\n }\\n //otherwise return null\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69409b5e1ca070de0f7bc05878f60cd2\",\n \"score\": \"0.5412047\",\n \"text\": \"private int hash(Node<K, V> key) {\\n return hashCode() % hashTable.length;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b4e10722af388c434dff7923cb1d4d2d\",\n \"score\": \"0.5407256\",\n \"text\": \"protected Entry(int hash, K key, int value, Entry<K> next)\\r\\n\\t\\t{\\r\\n\\t\\t\\tthis.hash = hash;\\r\\n\\t\\t\\tthis.key = key;\\r\\n\\t\\t\\tthis.value = value;\\r\\n\\t\\t\\tthis.next = next;\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"678705acbbc7ad022f51f4a29d5b9f75\",\n \"score\": \"0.5402046\",\n \"text\": \"private static Node addLinkeList(Node node1, Node node2) {\\n\\t\\tNode nextNode=null;\\n\\t\\tif(node1.link != null && node2.link !=null){\\n\\t\\t\\tnextNode = addLinkeList(node1.link, node2.link);\\n\\t\\t}else if(node1.link != null && node2.link ==null){\\n\\t\\t\\tnextNode = addLinkeList(node1.link, node2);\\n\\t\\t}else if(node1.link == null && node2.link !=null){\\n\\t\\t\\tnextNode = addLinkeList(node1, node2.link);\\n\\t\\t}\\n\\t\\t/*else if(node1.link == null || node2.link ==null){\\n\\t\\t\\tNode addNode=new Node(node1.data+node2.data);\\n\\t\\t\\taddNode.link=null;\\n\\t\\t\\treturn addNode;\\n\\t\\t}*/\\n\\t\\tint result=node1.data+node2.data+carry;\\n\\t\\tNode addNode=new Node(result%10);\\n\\t\\tcarry=result/10;\\n\\t\\taddNode.link=nextNode;\\n\\t\\treturn addNode;\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6acdaa32e5312d5408820139f1a1c5f6\",\n \"score\": \"0.5399767\",\n \"text\": \"private static void testMySimpleLinkedList() {\\n MySimpleLinkedList<String> mySimpleLinkedList = new MySimpleLinkedList<>();\\n mySimpleLinkedList.add(\\\"one\\\");\\n mySimpleLinkedList.add(\\\"two\\\");\\n mySimpleLinkedList.add(\\\"three\\\");\\n mySimpleLinkedList.add(\\\"four\\\");\\n System.out.println(mySimpleLinkedList.toString());\\n\\n System.out.println(\\\"first: \\\" + mySimpleLinkedList.getFirst().toString());\\n System.out.println(\\\"last: \\\" + mySimpleLinkedList.getLast().toString());\\n\\n mySimpleLinkedList.removeEntry(\\\"three\\\");\\n System.out.println(mySimpleLinkedList.toString());\\n\\n mySimpleLinkedList.removeEntry(1);\\n System.out.println(mySimpleLinkedList.toString());\\n\\n mySimpleLinkedList.removeEntry(\\\"zzz\\\");\\n System.out.println(mySimpleLinkedList.toString());\\n\\n try {\\n mySimpleLinkedList.removeEntry(3);\\n\\n } catch (IndexOutOfBoundsException e) {\\n e.printStackTrace();\\n System.out.println(\\\"An error has occurred!\\\");\\n }\\n System.out.println(mySimpleLinkedList.toString());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"906ff4c60a2bfacd5e626c4afce821e1\",\n \"score\": \"0.5397412\",\n \"text\": \"@SuppressWarnings(\\\"unchecked\\\")\\n\\tpublic static void addNode(BigInteger ip) {\\n\\t\\t//System.out.println(\\\"addNode: \\\" + ip);\\n\\t\\t\\n\\t\\tif(isSharedNode(ip)) {\\n\\t\\t\\tSystem.out.println(\\\" it has already been a shared node!\\\");\\n\\t\\t\\tSystem.out.println(\\\" returns failed\\\");\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t\\n\\t\\tNode shareNode = new Node(ip);\\n\\t\\tBigInteger base = new BigInteger(\\\"2\\\");\\n\\t\\tBigInteger moder = base.pow(bitNumber);\\n\\t\\t\\n\\t\\t// build finger table\\n\\t\\tfor(int j=0; j<bitNumber; j++) {\\n\\t\\t\\tint index = j;\\n\\t\\t\\tBigInteger jThSuccessor = ip.add(base.pow(j)).mod(moder);\\n\\t\\t\\t\\n\\t\\t\\tFingerTableItem ftItem = new FingerTableItem(index, jThSuccessor, buildSuccessor(jThSuccessor, ip));\\n\\t\\t\\tshareNode.getFingerTable().add(ftItem);\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\t// add new shared node into list\\n\\t\\tsharedNodes.add(shareNode);\\n\\t\\tCollections.sort(sharedNodes);\\n\\t\\t\\n\\t\\t// update successor of all shared nodes\\n\\t\\tupdateSuccessor();\\n\\t\\t\\n\\t\\t//printShardNodesInfo();\\n\\t\\t\\n\\t\\tSystem.out.println(\\\" returns success\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"496396eb1c07fed5e13d5259b954e476\",\n \"score\": \"0.5396921\",\n \"text\": \"private void fixList(Node<E> t, Node<E> h) {\\n Node<E> curNodeNext;\\n Node<E> curNode = t;\\n while (h == this.head && curNode != h) {\\n curNodeNext = curNode.getNext();\\n curNodeNext.setPrev(curNode);\\n curNode = curNode.getNext();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b348a0eba5216e591a66b8271e6f2d95\",\n \"score\": \"0.53914016\",\n \"text\": \"private LLNode<E> findNode(int index) {\\r\\n\\t\\tLLNode<E> node = null;\\r\\n\\t\\tnode = head.next;\\r\\n\\t\\tfor (int i=0; i<index; i++) {\\r\\n\\t\\t\\t node = node.next;\\r\\n\\t\\t}\\r\\n\\t\\treturn node;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2ff547196533128c39625a32df7f1b5\",\n \"score\": \"0.539016\",\n \"text\": \"void put(String k, String n, double s, List<String> cat){\\n int h = hash(k);\\n int i = h & (table.length-1);\\n for(Node e = table[i]; e!= null; e = e.next){\\n if(k.equals(e.key)){\\n e.name = n;\\n return;\\n }\\n }\\n //create new node after finding spot\\n Node p = new Node(k,n,s,cat,table[i], this);\\n table[i] = p;\\n count++;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c4092b2bced45499888ac439a7c013c\",\n \"score\": \"0.5386715\",\n \"text\": \"protected DListNode<T> newNode(T item, DList<T> list,\\n DListNode<T> prev, DListNode<T> next) {\\n return new DListNode<T>(item, list, prev, next);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e605d5ba7b2af20a88b00fbe6125c69\",\n \"score\": \"0.5384841\",\n \"text\": \"public interface LinkedListNode<T> extends GenericNode<T> {\\n LinkedListNode<T> getNext();\\n void setNext(LinkedListNode<T> next);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58537291be6a1c20d1794959a2e17935\",\n \"score\": \"0.53832805\",\n \"text\": \"static <KeyType, ValueType> LinkedList<ValueType> hashtableToLinkedList(Hashtable<KeyType,ValueType> hash)\\n\\t{\\n\\t\\t/*This next section was inspired by Adamski's answer to a question on Stackoverflow:\\n\\t\\tstackoverflow.com/question/2351331/iterating-hashtable-in-java\\n\\t\\t */\\n\\t\\tLinkedList<ValueType> newList = new LinkedList<ValueType>();\\n\\t\\tIterator<Entry<KeyType, ValueType>> iter = hash.entrySet().iterator();\\n\\n\\t\\twhile(iter.hasNext())\\n\\t\\t{\\n\\t\\t\\tMap.Entry<KeyType, ValueType> entry = iter.next();\\n\\t\\t\\tValueType current = entry.getValue();\\n\\n\\t\\t\\tnewList.add(current);\\n\\t\\t}\\n\\t\\treturn newList;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9fa6418a94fa5e2d0d6c65876c5dd64c\",\n \"score\": \"0.5382502\",\n \"text\": \"public void add(KeyValuePair<K,V> pair , int index){\\r\\n\\r\\n\\t\\tNode<K,V> entry=new Node<K,V>(pair);\\r\\n\\t\\t//if head is null\\r\\n\\t\\tif(isEmpty(index)){\\r\\n\\t\\t\\tstorage[index]=entry;\\r\\n\\t\\t}else{\\r\\n\\t\\t\\tNode<K,V> current = storage[index];\\r\\n\\r\\n\\t\\t\\twhile(current.next != null){\\r\\n\\t\\t\\t\\tcurrent = current.next;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tcurrent.next=entry;\\r\\n\\t\\t}\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d31a0e51de961a45895015f55c5cc612\",\n \"score\": \"0.53821194\",\n \"text\": \"protected DListNode newNode(Object item, DListNode prev, DListNode next) {\\n\\t\\treturn new DListNode(item, prev, next);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"062c4280decad4efe852aa688c60a232\",\n \"score\": \"0.53720045\",\n \"text\": \"private ListNode getNode(int index) {\\r\\n\\t\\tif (index < FIRST_POSITION || index > size - 1) {\\r\\n\\t\\t\\tthrow new IndexOutOfBoundsException(\\r\\n\\t\\t\\t\\t\\t\\\"Given index must not be negative nor bigger than the collection's size decremented by one.\\\");\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tListNode tempNode = new ListNode();\\r\\n\\r\\n\\t\\tif (index < size / PARTITION_FACTOR) {\\r\\n\\t\\t\\tint i = FIRST_POSITION;\\r\\n\\r\\n\\t\\t\\tfor (tempNode = first; tempNode != null; tempNode = tempNode.next) {\\r\\n\\t\\t\\t\\tif (i == index) {\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\ti++;\\r\\n\\t\\t\\t}\\r\\n\\t\\t} else {\\r\\n\\t\\t\\tint i = size - 1;\\r\\n\\r\\n\\t\\t\\tfor (tempNode = last; tempNode != null; tempNode = tempNode.previous) {\\r\\n\\t\\t\\t\\tif (i == index) {\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\ti--;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\treturn tempNode;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26429e92b82d4d9602c43235369a0f46\",\n \"score\": \"0.53699815\",\n \"text\": \"public Entry insert(Object key, Object value) {\\n // Replace the following line with your solution.\\n //System.out.println(\\\"old graph\\\");\\n //System.out.println(this);\\n\\n Entry entry = new Entry();\\n entry.key = key;\\n entry.value = value;\\n int compressedCode = this.compFunction(key.hashCode());\\n dict[compressedCode].insertBack(entry);\\n size++;\\n // System.out.println(\\\"load fact before : \\\" + loadFactor());\\n //System.out.println(this);\\n if ((loadFactor() <= 0.3 || loadFactor() >= 1.0) && size > 9) {\\n // System.out.println(\\\"Enlarging Now\\\");\\n resize();\\n // System.out.println(\\\"load fact: \\\" + loadFactor());\\n //System.out.println(\\\"graph after resizing\\\");\\n //System.out.println(this);\\n }\\n return entry;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"710f70979f3fa86c0be514464aecfdfa\",\n \"score\": \"0.53698635\",\n \"text\": \"private void addNode(int data) {\\n Node newNode = new Node(data); \\n \\n //Checks if the list is empty \\n if(head == null) { \\n //If list is empty, both head and tail will point to new node \\n head = newNode; \\n tail = newNode; \\n } \\n else { \\n //newNode will be added after tail such that tail's next will point to newNode \\n tail.next = newNode; \\n //newNode will become new tail of the list \\n tail = newNode; \\n\\t\\t\\n\\t}\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95e5f9b610675e2f8fa2e4e854d1e233\",\n \"score\": \"0.53685206\",\n \"text\": \"private Node (Entry<P, D> e) {\\n\\t\\t\\tentry = e;\\n\\t\\t\\te.node = this;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c04a67eb9c69338487728ee47bd7a04\",\n \"score\": \"0.53602964\",\n \"text\": \"public void append(int new_data) \\n{ \\n\\t/* allocate the node and put it in data and set next as null */ \\n\\tNode new_node = new Node(new_data); \\n\\n/* 4 if linked list is empty then make new node as head */\\nif(head == null)\\n{ \\nhead = new Node(new_data); \\nreturn; \\n}\\n/* 4. the new node is going to be last node so make next of it as null */ \\nnew_node.next = null; \\n\\n/* 5. Else traverse till the last node */ \\nNode last = head; \\nwhile (last.next != null)\\n\\tlast = last.next; \\n\\n/* 6. change the next of last node */ \\nlast.next = new_node; \\nreturn; \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d8078082b051bb65499f693cf404d3a\",\n \"score\": \"0.53592086\",\n \"text\": \"@Test\\n public void testOneLinkedAdd() {\\n MyLinkedList<String> llist = (MyLinkedList)(Object)list;\\n llist.clear();\\n assertEquals(llist.size(), 0);\\n assertSame(llist.getHead().getNext(), llist.getTail());\\n assertSame(llist.getHead(), llist.getTail().getPrev());\\n list.add(\\\"foo\\\");\\n assertEquals(llist.size(), 1);\\n\\n // there should be a new node following the head.\\n MyLinkedNode<String> fooNode = llist.getHead().getNext();\\n assertNotSame(fooNode, llist.getTail());\\n assertEquals(fooNode.getValue(), \\\"foo\\\");\\n assertSame(llist.getTail().getPrev(), fooNode);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a947dcdc70c28f7eef740bca76bc353d\",\n \"score\": \"0.53561604\",\n \"text\": \"public static void main(String[] args) {\\n \\r\\n Node head=null;\\r\\n head=insertIntoList(head,20,\\\"abc\\\");\\r\\n insertIntoList(head,30,\\\"abc\\\");\\r\\n insertIntoList(head,40,\\\"abc\\\");\\r\\n insertIntoList(head,50,\\\"abc\\\");\\r\\n insertIntoList(head,60,\\\"abc\\\");\\r\\n insertIntoList(head,70,\\\"abc\\\");\\r\\n head=insertStart(head,80,\\\"pqr\\\");\\r\\n \\r\\n head=InsertAtK(head, 3,38,\\\"rst\\\");\\r\\n insertAtkfromEnd(head, 1, 23, \\\"pqr\\\");\\r\\n InsertKend2(head, 2, 100, \\\"qws\\\");\\r\\n head=delete(head, 1);\\r\\n printListRec(head);\\r\\n // printList(head);\\r\\n\\r\\n // System.out.println(head.data+\\\" -> \\\"+head.nextRef.data+\\\" -> \\\"\\r\\n // +head.nextRef.nextRef.data+\\\" -> \\\"+head.nextRef.nextRef.nextRef.data);\\r\\n // // System.out.println(second.data);\\r\\n // System.out.println(head.nextRef.data);\\r\\n\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae4c0e9046b889e60e2c2759ad10bafe\",\n \"score\": \"0.53546524\",\n \"text\": \"private static <V> Node<V> put(Node<V> h, int key, V value) { \\n\\t\\tif (h == null) return Node.mkRed(key, value);\\n\\n\\t\\tint cmp = compareTo(key, h.key);\\n\\t\\tif (cmp < 0) h = h.setLeft(put(h.left, key, value)); \\n\\t\\telse if (cmp > 0) h = h.setRight(put(h.right, key, value));\\n\\t\\telse h = h.setValue(value);\\n\\n\\t\\t// fix-up any right-leaning links\\n\\t\\tif (isRed(h.right) && isBlack(h.left)) h = h.rotateLeft();\\n\\t\\tif (isRed(h.left) && isRed(h.left.left)) h = h.rotateRight();\\n\\t\\tif (isRed(h.left) && isRed(h.right)) h = h.flipColors();\\n\\t\\t\\n\\t\\treturn h.fixSize();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a5dd8256580c31c1e255fb768fdf082\",\n \"score\": \"0.53523076\",\n \"text\": \"public void add(Bee data){\\n if(head == null){ //C1\\n head = new Node(data); //C2\\n end = new Node(data); //C3\\n head.head = head; //C3\\n end.head = head; //C4\\n }\\n else{\\n Node newHead = new Node(data); //C5\\n newHead.next = head; //C6\\n head = newHead; //C7\\n newHead.head = newHead; //C8\\n }\\n length = length + 1; //C9\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4573bca360550b789a4c493348c964d6\",\n \"score\": \"0.53509253\",\n \"text\": \"private Node(int key, Object data) {\\n this.key = key;\\n this.data = new LLList();\\n this.data.addItem(data, 0);\\n this.left = null;\\n this.right = null;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983797,"cells":{"query_id":{"kind":"string","value":"339e5e63caa8a5598f27adf84fa088eb"},"query":{"kind":"string","value":"Postconcats the matrix with the specified matrix. M' = other M"},"positive_passages":{"kind":"list like","value":[{"docid":"ced693cfe88198808c0c170890fd81ee","score":"0.7107306","text":"public boolean postConcat(Matrix other) {\n addTransform(other.mValues);\n \n return true;\n }","title":""}],"string":"[\n {\n \"docid\": \"ced693cfe88198808c0c170890fd81ee\",\n \"score\": \"0.7107306\",\n \"text\": \"public boolean postConcat(Matrix other) {\\n addTransform(other.mValues);\\n \\n return true;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"679dc34300c9664c771571760a8f3b48","score":"0.6288829","text":"public boolean preConcat(Matrix other) {\n Matrix m = new Matrix(other);\n other.addTransform(mValues);\n set(m);\n \n return true;\n }","title":""},{"docid":"d421762318139099ad94023cdb86aff1","score":"0.5857409","text":"Matrix mult(Matrix M)\n {\n equalSizes(M,\"mult()\");//checks the pre-condition\n Matrix m=M.copy();\n Matrix rtn=new Matrix(this.getSize());//create a new matrix of the same size as this matrix\n Matrix mt=m.transpose();//transpose the passed matrix\n List NZrows=new List();//list to hold the indicies of all rows in this matrix \n List cp=new List();//holds the rows of M.transpose which are not empty\n //these rows are subject to dot() (as zero rows would only yeild a zero entry for rtn, and don't need to be accounted for)\n for(c=1;c<=this.getSize();c++)//cycle through each row of this matrix, and of the transposed M \n {\n if(!this.getRow(c).isEmpty())//if a row of the matrix is not empty, then note that in the List\n {\n NZrows.append(c);\n }\n if(!mt.getRow(c).isEmpty())\n {\n cp.append(c);\n }\n }\n for(NZrows.moveTo(0);NZrows.getIndex()>=0;NZrows.moveNext())//for each non-empty row in this matrix\n {\n int r=(int)NZrows.getElement();\n for(cp.moveTo(0);cp.getIndex()>=0;cp.moveNext())//and for each non-empty row in M.transpose()\n {\n int cl=(int)cp.getElement();\n double d=dot(this.getRow(r),mt.getRow(cl));//find the dot product of all non-empty rows\n if(d!=0.0)//if it's not zero\n {\n rtn.changeEntry(r,cl,d);//place it in the appropriate place in the new matrix\n }\n }\n }\n return rtn;\n }","title":""},{"docid":"362d23ffcd9e8f5bb4ed303fa0a2d874","score":"0.5777699","text":"Matrix multiply(Matrix other) {\n Matrix c = new Matrix(size);\n int n = size;\n for (int i = 0; i < n; i++)\n for (int j = 0; j < n; j++)\n for (int k = 0; k < n; k++)\n c.data[i][j] += data[i][k] * other.data[k][j];\n return c;\n }","title":""},{"docid":"e49c59756e1b7045b6a0081737d3714f","score":"0.5691651","text":"Matrix mult(Matrix M) throws RuntimeException {\n\n if (getSize() != M.getSize())\n throw new RuntimeException(\"Matrix.java: mult() - matrices are different sizes\");\n\n M = M.transpose();\n\n Matrix res = new Matrix(size);\n\n for (int i = 0; i < size; i++) {\n if (rows[i].length() != size)\n continue;\n else {\n for (int j = 0; j < size; j++)\n res.changeEntry(i, j, dot(this.rows[i], M.rows[i]));\n }\n }\n return res;\n }","title":""},{"docid":"ecb93a0889c852e0a4df0f332104ee4c","score":"0.5581454","text":"public void concatMatrix(AffineTransform at) {\n if (!at.isIdentity()) {\n writeTJ();\n StringBuffer sb = new StringBuffer();\n writeAffineTransform(at, sb);\n sb.append(\" cm\\n\");\n write(sb);\n }\n }","title":""},{"docid":"f08e2d13a921e22bafdaa011713f1be7","score":"0.5548942","text":"public static Matrix Transpose(Matrix M){\n Matrix hasil = new Matrix(Matrix.GetKol(M), Matrix.GetRow(M));\n\n for(int i = 0; i < Matrix.GetRow(hasil); i++){\n for(int j = 0; j < Matrix.GetKol(hasil); j++){\n Matrix.SetElmt(hasil, i, j, Matrix.GetElmt(M, j, i));\n }\n }\n return hasil;\n }","title":""},{"docid":"836c2c39505fd5fe5e97935641cbe0ae","score":"0.548826","text":"public Matrix multiply(Matrix other) {\n if (getColumnCount() != other.getRowCount()) {\n throw new IllegalArgumentException(other + \" must have \" + getColumnCount() + \" rows!\");\n }\n double[][] entries = new double[getRowCount()][other.getColumnCount()];\n int numRows = getRowCount();\n int numCols = getColumnCount();\n for (int i = 0; i < numRows; ++i) {\n for (int j = 0; j < numCols; ++j) {\n entries[i][j] = getRow(i).dot4D(other.getColumn(j));\n }\n }\n return new Matrix(entries);\n }","title":""},{"docid":"f3b270b53c24295efb7bb70894303fd4","score":"0.53778124","text":"public Matrix mulMatrix(Matrix m1 , Matrix m2){\n \t int dim = m1.getDimension(); //the dimension of the adjacency matrix\n \t Matrix matrix = new Matrix(dim); //a matrix to save the powered matrix to it \n \t //makes the row*column multiplications\n \t ArrayList<Double> list = new ArrayList<Double>();\n \t for (int i=0;i<dim;i++){\n for (int j=0;j<dim;j++){ \n for (int k=0;k<dim;k++){\n list.add(m1.getValueOf(i, k)+m2.getValueOf(k, j));\n } \n matrix.setEdge(i, j, getMax(list));\n list.clear();\n }\n }\n\treturn matrix; \n }","title":""},{"docid":"8bb3fdefaf06752c8810b621add39249","score":"0.53608567","text":"Matrix add(Matrix M)\n {\n equalSizes(M,\"add()\");//check pre-condition\n Matrix m=M.copy();//create a copy of the passed matrix, this avoids creating erroes if the passed matrix points to this matrix\n Matrix rtn=new Matrix(this.getSize());//create a new matrix that is the same size as the two matricies being added\n for(c=1;c<=this.getSize();c++)//cycle through all the rows in these two matricies\n {\n List this_l=this.getRow(c);\n List that_l=m.getRow(c);\n this_l.moveTo(0);\n that_l.moveTo(0);\n while(this_l.getIndex()>=0&&that_l.getIndex()>=0)//cycle through all the entries in these\n {\n Entry one=(Entry) this_l.getElement();\n Entry two=(Entry) that_l.getElement();\n int col1=one.column;\n int col2=two.column;\n if(col1==col2)//if both rows have entries in the same column, the sum of these entries becomes the value of the corresponding entry in the new matrix\n {\n rtn.changeEntry(c,col1,one.value+two.value);\n this_l.moveNext();//continue cycling\n that_l.moveNext();\n }\n else if(col1>col2)//if one row has an entry in the column while the other has a zero\n {\n rtn.changeEntry(c,col2,two.value);//then the corresponding entry in the new matrix becomes that of the value in the matrix without the zero entry \n that_l.moveNext();//don't cycle through the other row, because zero entries are not recorded\n }\n else if(col1<col2)\n {\n rtn.changeEntry(c,col1,one.value);\n this_l.moveNext();\n }\n }\n while(this_l.getIndex()>=0)//if one row reaches its final entry before the other\n //cycle through the remaining entries in the unended row and copy them to the new matrix\n {\n Entry one=(Entry) this_l.getElement();\n rtn.changeEntry(c,one.column,one.value);\n this_l.moveNext();\n }\n while(that_l.getIndex()>=0)\n {\n Entry two=(Entry) that_l.getElement();\n rtn.changeEntry(c,two.column,two.value);\n that_l.moveNext();\n }\n }\n return rtn;\n }","title":""},{"docid":"be9c01aef2d0c80d942eaba5220da209","score":"0.53542197","text":"public boolean setConcat(Matrix a, Matrix b) {\n if (a == this) {\n preConcat(b);\n } else if (b == this) {\n postConcat(b);\n } else {\n Matrix tmp = new Matrix(b);\n tmp.addTransform(a.mValues);\n set(tmp);\n }\n \n return true;\n }","title":""},{"docid":"c3db409ecfd7429b5d4c0460c00bf790","score":"0.5311808","text":"Matrix multiplyFaster(Matrix other) {\n Matrix c = new Matrix(size);\n int n = size;\n for (int i = 0; i < n; i++)\n for (int k = 0; k < n; k++)\n for (int j = 0; j < n; j++)\n c.data[i][j] += data[i][k] * other.data[k][j];\n return c;\n }","title":""},{"docid":"961d802dea351ebb2a0f942a8595fb36","score":"0.5241591","text":"public static DoubleMatrix compose(DoubleMatrix[][] input) {\n\t\tint nr = input.length;\n\t\tint nc = input[0].length;\n\t\tint[] numberOfColumns = new int[nc];\n\t\tint[] numberOfRows = new int[nr];\n\t\tint totalrows = 0;\n\t\tint totalcols = 0;\n\t\t\n\t\tfor (int r = 0; r < nr; r++) {\n\t\t\tnumberOfRows[r] = input[r][0].numberOfRows();\n\t\t\ttotalrows += numberOfRows[r];\n\t\t}\n\n\t\tfor (int c = 0; c < nc; c++) {\n\t\t\tnumberOfColumns[c] = input[0][c].numberOfColumns();\n\t\t\ttotalcols += numberOfColumns[c];\n\t\t}\n\n\t\tBlasDoubleMatrix[][] matrices = new BlasDoubleMatrix[nr][nc];\n\t\tfor (int r = 0; r < nr; r++) {\n\t\t\tfor (int c = 0; c < nc; c++) {\n\t\t\t\tif (input[r][c].numberOfRows() != numberOfRows[r] || input[r][c].numberOfColumns() != numberOfColumns[c]) \n\t\t\t\t\tthrow new IllegalArgumentException(\"Incongruent matrices input to BlasDoubleMatrix.compose\");\n\t\t\t\tmatrices[r][c] = (BlasDoubleMatrix) input[r][c];\n\t\t\t}\n\t\t}\n\t\t\n\t\t//create the new double[] and copy the old stuff to it\n\t\tint resultSize = totalrows * totalcols;\n\t\tdouble[] result = new double[resultSize];\n\t\tint ptr0 = 0;\n\t\tfor (int c = 0; c < nc; c++) {\n\t\t\tint nc2 = numberOfColumns[c];\n\t\t\tint ptr1 = 0;\n\t\t\tfor (int r = 0; r < nr; r++) {\n\t\t\t\tint srcptr = 0;\n\t\t\t\tint destptr = ptr0 + ptr1; \n\t\t\t\tfor (int c2 = 0; c2 < nc2; c2++) {\n\t\t\t\t\tSystem.arraycopy(matrices[r][c].myMatrix, srcptr, result, destptr, numberOfRows[r]);\n\t\t\t\t\tsrcptr += numberOfRows[r];\n\t\t\t\t\tdestptr += totalrows;\n\t\t\t\t}\n\t\t\t\tptr1 += numberOfRows[r];\n\t\t\t}\n\t\t\tptr0 += totalrows * numberOfColumns[c];\n\t\t}\n\t\t\n\t\treturn BlasDoubleMatrix.getInstance(totalrows, totalcols, result, true);\n\t}","title":""},{"docid":"1df22cac5f84c799bb17cc3ba7041cdc","score":"0.52356017","text":"public static void applyMatrix(PApplet renderer, PGraphicsOpenGL pgraphics3D, Matrix m) {\n switch (RENDERER_STATE) {\n case PROCESSING_MATRIX_MODE:\n pgraphics3D.modelview.apply(\n m.m00, m.m01, m.m02, m.m03,\n m.m10, m.m11, m.m12, m.m13,\n m.m20, m.m21, m.m22, m.m23,\n m.m30, m.m31, m.m32, m.m33\n );\n break;\n case OPENGL_MATRIX_MODE:\n GL2 gl = getGL();\n ctm[0] = m.m00;\n ctm[1] = m.m10;\n ctm[2] = m.m20;\n ctm[3] = m.m30;\n\n ctm[4] = m.m01;\n ctm[5] = m.m11;\n ctm[6] = m.m21;\n ctm[7] = m.m31;\n\n ctm[8] = m.m02;\n ctm[9] = m.m12;\n ctm[10] = m.m22;\n ctm[11] = m.m32;\n\n ctm[12] = m.m03;\n ctm[13] = m.m13;\n ctm[14] = m.m23;\n ctm[15] = m.m33;\n\n // apply this m and get to work\n gl.glMultMatrixf(ctm, 0);\n break;\n default:\n break;\n }\n\n }","title":""},{"docid":"a6272ac4cc180c95b992640a411e10ec","score":"0.5144203","text":"protected static double[][] multiplyMatrix(double[][] mat1, double[][] mat2) {\n // Prekondisi kolom mat1 = baris mat2\n int rows1 = mat1.length;\n int cols1 = mat1[0].length;\n int rows2 = mat2.length;\n int cols2 = mat2[0].length;\n double[][] newMat = new double[rows1][cols2];\n\n for (int i = 0; i < newMat.length; i++) {\n for (int j = 0; j < newMat[0].length; j++) {\n newMat[i][j] = 0;\n for (int k = 0; k < cols1; k++) {\n newMat[i][j] += mat1[i][k] * mat2[k][j];\n }\n }\n }\n return newMat;\n }","title":""},{"docid":"09f5bdf81c7952cdfac6996617339966","score":"0.5119241","text":"public Matrix mult(Matrix M){\n\t\tMatrix mult = new Matrix(size);\t\t\t\t\t\t\t\t// create new matrix to hold the matrix product\n\t\tMatrix mTran = M.transpose();\t\t\t\t\t\t\t\t// create new matrix to hold transpose matrix M (to turn its columns into rows)\n\t\tfor (int i = 1; i <= size; i++){\t\t\t\t\t\t\t// iterate through matrix's rows\n\t\t\tfor (int counter = 1; counter <= size; counter++){\t\t// iterate through M's columns\n\t\t\t\tdouble dotProd = dot(row[i], mTran.row[counter]);\t// create a dot product variable to hold the value of the dot product of the matrix's row and matrix M's column\n\t\t\t\tif (dotProd != 0.0){\t\t\t\t\t\t\t\t// if the dot product variable is not zero\n\t\t\t\t\tmult.changeEntry(i, counter, dotProd);\t\t\t// add it to the corresponding position in the matrix\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t}\n\t\treturn mult;\t\t\t\t\t\t\t\t\t\t\t\t// return the product matrix\n\t}","title":""},{"docid":"0aa843eb2225cece073cfd75ce1fb096","score":"0.5103117","text":"public void reflectX() {\n System.out.println(\"a\");\n int[][] temp=mtx;\n int k=0;\n for(int i=0; i<size; i++){\n for(int j=size-1; j>=0; j--){\n mtx[j][i]=temp[k][i];\n k++;\n }\n k=0;\n } \n //System.out.println(\"a\");\n }","title":""},{"docid":"5ca7ad29aad4f3b03d0431657f9b478e","score":"0.50981987","text":"public Matrix transpose() {\r\n\t\tMatrix A = new Matrix(N, M);\r\n\t\tfor (int i = 0; i < M; i++)\r\n\t\t\tfor (int j = 0; j < N; j++)\r\n\t\t\t\tA.data[j][i] = this.data[i][j];\r\n\t\treturn A;\r\n\t}","title":""},{"docid":"6159ef0307cd687a95359d4ac2473126","score":"0.5065055","text":"@Override\n\tpublic SparseM multiplication(SparseM otherM) {\n\t\treturn null;\n\t}","title":""},{"docid":"5d882db185a6b888ea30cbe2fa2454db","score":"0.5061114","text":"void setTransfoMatrix(Matrix4 m);","title":""},{"docid":"86663b0a937a1fea7e66aa702994fa3a","score":"0.50483304","text":"public ComplexMatrix transpose(){\n ComplexMatrix nmatrix= new ComplexMatrix(n,m);\n\n for(int i=0;i<m;i++){\n for(int j=0;j<n;j++){\n try {\n nmatrix.put(j,i,matrix[i][j]);\n } catch (ComplexException e) {\n e.printStackTrace();\n }\n }\n\n }\n return nmatrix;\n }","title":""},{"docid":"bbf763df19ed214fab212e92fb336848","score":"0.5042208","text":"private void reorder() {\n final int m = inputMatrix.getRows();\n final int n = inputMatrix.getColumns();\n\n int i;\n int j;\n int k;\n int s;\n int inc = 1;\n double sw;\n final double[] su = new double[m];\n final double[] sv = new double[n];\n\n do {\n inc *= 3;\n inc++;\n } while (inc <= n);\n do {\n inc /= 3;\n for (i = inc; i < n; i++) {\n sw = w[i];\n for (k = 0; k < m; k++) {\n su[k] = u.getElementAt(k, i);\n }\n for (k = 0; k < n; k++) {\n sv[k] = v.getElementAt(k, i);\n }\n j = i;\n while (w[j - inc] < sw) {\n w[j] = w[j - inc];\n for (k = 0; k < m; k++) {\n u.setElementAt(k, j, u.getElementAt(k, j - inc));\n }\n for (k = 0; k < n; k++) {\n v.setElementAt(k, j, v.getElementAt(k, j - inc));\n }\n j -= inc;\n if (j < inc) {\n break;\n }\n }\n w[j] = sw;\n for (k = 0; k < m; k++) {\n u.setElementAt(k, j, su[k]);\n }\n for (k = 0; k < n; k++) {\n v.setElementAt(k, j, sv[k]);\n }\n }\n } while (inc > 1);\n\n for (k = 0; k < n; k++) {\n s = 0;\n for (i = 0; i < m; i++) {\n if (u.getElementAt(i, k) < 0.0) {\n s++;\n }\n }\n for (j = 0; j < n; j++) {\n if (v.getElementAt(j, k) < 0.0) {\n s++;\n }\n }\n if (s > (m + n) / 2) {\n for (i = 0; i < m; i++) {\n u.setElementAt(i, k, -u.getElementAt(i, k));\n }\n for (j = 0; j < n; j++) {\n v.setElementAt(j, k, -v.getElementAt(j, k));\n }\n }\n }\n }","title":""},{"docid":"2e117e75a75100649e2c0d6117395b92","score":"0.5038113","text":"Matrix sub(Matrix M)\n {\n equalSizes(M,\"sub()\");//check pre-condition\n /*\n * a-b=a+(-b)\n */\n return this.add(M.scalarMult(-1));\n }","title":""},{"docid":"cea83140ee03a1fa8b4c406fdb55e9c7","score":"0.5035715","text":"static void transpose(int [][] matrix ) {\n\t\tfinal int R = matrix.length, C = matrix[0].length;\n\t\tint k = 1;\n\t\tfor (int r = 0; r < R - 1 ; r++) { // -1 because of L share (upside down) and elements at diagonal are unchanged\n\t\t\tfor (int c = r + 1; c < R; c++) {\n\t\t\t\t//System.out.println(\"K=\" + k++);\n\t\t\t\tint t = matrix[c][r];\n\t\t\t\tmatrix[c][r] = matrix[r][c]; \n\t\t\t\tmatrix[r][c] = t;\n\t\t\t}\n\t\t}\n\t\tprint(matrix);\n\t}","title":""},{"docid":"a3f0fab284da18b135622ea42ea7596e","score":"0.5018322","text":"public Matrix add(Matrix M){\n\t\tMatrix add = new Matrix(size);\t\t\t\t\t\t\t\t// create a new matrix object to hold matrix sum\n\t\tif (equals(M)){\t\t\t\t\t\t\t\t\t\t\t\t// if the matrices are the same (ie A + A)\n\t\t\tadd = scalarMult(2);\t\t\t\t\t\t\t\t\t// return a scalar multiple of that matrix \n\t\t}\n\t\telse {\n\t\t\tfor (int i = 1; i <= size; i++){\n\t\t\t\t// List newrow = new List();\t\t\t\t\t\t// create a new list object (temporary) to hold each row\n\t\t\t\trow[i].moveFront();\t\t\t\t\t\t\t\t\t// move cursor of this matrix to the front\n\t\t\t\tM.row[i].moveFront();\t\t\t\t\t\t\t\t// move cursor of matrix M to the front (both cursors are now in the same place)\n\t\t\t\twhile (row[i].get() != null || M.row[i].get() != null){\t// while both cursors are not null\n\t\t\t\t\tEntry oldRow = (Entry) row[i].get();\t\t\t// entry object for the old row's cursor data\n\t\t\t\t\tEntry argOldRow = (Entry) M.row[i].get();\t\t// entry object for tha argument old row's cursor data\n\t\t\t\t\tif (row[i].get() != null && M.row[i].get() == null){\n\t\t\t\t\t\tadd.changeEntry(i, oldRow.getColumn(), oldRow.getEntry());\n\t\t\t\t\t\trow[i].moveNext();\n\t\t\t\t\t}\n\t\t\t\t\telse if (row[i].get() == null && M.row[i].get() != null){\n\t\t\t\t\t\tadd.changeEntry(i, argOldRow.getColumn(), argOldRow.getEntry());\n\t\t\t\t\t\tM.row[i].moveNext();\n\t\t\t\t\t}\n\t\t\t\t\telse if (oldRow.getColumn() == argOldRow.getColumn()){\t// if both cursors have the same column\n\t\t\t\t\t\t// newrow.append(e);\t\t\t\t\t\t// append the entry to the temporary list object\n\t\t\t\t\t\tadd.changeEntry(i, oldRow.getColumn(), oldRow.getEntry()+argOldRow.getEntry());\n\t\t\t\t\t\trow[i].moveNext();\t\t\t\t\t\t\t// move both cursors to the next position\n\t\t\t\t\t\tM.row[i].moveNext();\n\t\t\t\t\t}\n\t\t\t\t\telse if (oldRow.getColumn() < argOldRow.getColumn()){\t// if the column number on the first matrix is less than the M matrix\n\t\t\t\t\t\t// newrow.append(e);\t\t\t\t\t\t// append the entry to the temporary list object\n\t\t\t\t\t\tadd.changeEntry(i, oldRow.getColumn(), oldRow.getEntry());\n\t\t\t\t\t\trow[i].moveNext();\t\t\t\t\t\t\t// move the first matrix's cursor to the next position\n\t\t\t\t\t}\n\t\t\t\t\telse if (oldRow.getColumn() > argOldRow.getColumn()){\t// if the column number on the first matrix is greater than the M matrix\n\t\t\t\t\t\t// newrow.append(e);\t\t\t\t\t\t// append the entry to the temporary list object\n\t\t\t\t\t\tadd.changeEntry(i, argOldRow.getColumn(), argOldRow.getEntry());\n\t\t\t\t\t\tM.row[i].moveNext();\t\t\t\t\t\t// move the M matrix's cursor to the next position\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t// add.row[i] = newrow;\t\t\t\t\t\t\t\t\t// set that row's list equal to the new list\n\t\t\t}\n\t\t}\n\t\treturn add;\t\t\t\t\t\t\t\t\t\t\t\t\t// return the addition matrix\n\t}","title":""},{"docid":"7a9f1b7b0cec6cb6744150d66c654e3c","score":"0.5015176","text":"public Matrix transpose() {\n Matrix A = new Matrix(N, M);\n for (int i = 0; i < M; i++)\n for (int j = 0; j < N; j++)\n A.data[j][i] = this.data[i][j];\n return A;\n }","title":""},{"docid":"d3ed65aa7160f2b25c7db4820bacf3d3","score":"0.4995673","text":"public static Matrix transpose(Matrix m1) {\r\n double[][] transpose = new double[m1.getWidth()][m1.getHeight()];\r\n for (int i = 0; i < m1.getHeight(); i++) {\r\n for (int j = 0; j < m1.getWidth(); j++) {\r\n transpose[j][i] = m1.get(i, j);\r\n }\r\n }\r\n return new Matrix(transpose);\r\n }","title":""},{"docid":"55b5cb6eeb17c40791e87d5ce309feb3","score":"0.49729285","text":"public AffineTransform multiply(AffineTransform other)\n{\n AffineTransform trans = new AffineTransform();\n \n trans.m_transform[0] = other.m_transform[0] * m_transform[0] + other.m_transform[1] * m_transform[2];\n trans.m_transform[1] = other.m_transform[0] * m_transform[1] + other.m_transform[1] * m_transform[3];\n trans.m_transform[2] = other.m_transform[2] * m_transform[0] + other.m_transform[3] * m_transform[2];\n trans.m_transform[3] = other.m_transform[2] * m_transform[1] + other.m_transform[3] * m_transform[3];\n trans.m_transform[4] = other.m_transform[4] * m_transform[0] + other.m_transform[5] * m_transform[2] + m_transform[4];\n trans.m_transform[5] = other.m_transform[4] * m_transform[1] + other.m_transform[5] * m_transform[3] + m_transform[5];\n\n setMatrix(trans.m_transform);\n return this;\n}","title":""},{"docid":"5cd03d24b41d392057006b43c7046b61","score":"0.49659994","text":"Matrix add(Matrix M) throws RuntimeException {\n\n if (getSize() != M.getSize())\n throw new RuntimeException(\"Matrix.java: add() - matrices are different sizes\");\n\n if (this.equals(M))\n return this.scalarMult(2);\n\n Matrix res = M.copy();\n\n for (int i = 0; i < rows.length; i++) {\n res.rows[i] = addRow(1, i + 1, this.rows[i], res.rows[i]);\n }\n\n return res;\n }","title":""},{"docid":"313028f84dadbb25a6229fbef50dccf7","score":"0.4961017","text":"public GMatrix transpose () {\n\t\tGMatrix reMat = new GMatrix( this );\n\t\tint temp=reMat.n; reMat.n=reMat.m; reMat.m=temp;\n\t\t\n\t\tfor(int i = 0; i < n; i ++) {\n\t\t\tfor(int j = 0;j < m; j ++) {\n\t\t\t\treMat.safeSet(j, i, safeGet(i, j));\n\t\t\t}\n\t\t}\n\t\treturn reMat;\n\t}","title":""},{"docid":"0a4c1c2b88ce340ec39fa9560907b1d3","score":"0.49553302","text":"public static Matrix multiply2M(Matrix m1, Matrix m2) {\n\t\tMatrix tmp = new Matrix(m1.getDimensionY(), m2.getDimensionX());\n\t\tif(isMultipliable(m1, m2)) {\n\t\t\tfor(int x = 0; x < tmp.getDimensionX(); x++) {\n\t\t\t\tfor(int y = 0; y < tmp.getDimensionY(); y++) {\n\t\t\t\t\tBigDecimal[] tmpX = m1.getRow(y);\n\t\t\t\t\tBigDecimal[] tmpY = m2.getColum(x);\n\t\t\t\t\tBigDecimal tmpZ = new BigDecimal(0);\n\t\t\t\t\tfor(int k = 0; k < tmpX.length; k++) {\n\t\t\t\t\t\ttmpZ = tmpZ.add(tmpX[k].multiply(tmpY[k]));\n\t\t\t\t\t}\n\t\t\t\t\ttmp.setCell(x, y, tmpZ); \n\t\t\t\t}\n\t\t\t}\n\t\t}else {\n\t\t\tSystem.out.println(\"Error\");\n\t\t}\n\t\treturn tmp;\n\t}","title":""},{"docid":"b7d4173a8d841c29f6e33ac7fd2b5582","score":"0.49538997","text":"public Matrix matrix_inverse(Matrix a){\n \n Matrix merge = new Matrix(a.get_rows(),a.get_collumns()*2);\n for(int i=0;i<a.get_rows();i++){\n for(int j=0;j<a.get_collumns();j++){\n merge.set_element(a.get_element(i,j),i,j);\n }\n }\n int modulo = merge.get_rows();\n for(int i=0;i<merge.get_rows();i++){\n for(int j=a.get_collumns();j<merge.get_collumns();j++){\n if(j%modulo==0){\n merge.set_element(1,i,j);\n }\n else{\n merge.set_element(0,i,j);\n }\n }\n modulo++;\n }\n merge = reduced_row_echelon_form(merge);\n Matrix result = new Matrix(a.get_rows(),a.get_collumns());\n for(int i=0;i<result.get_rows();i++){\n for(int j=0;j<result.get_collumns();j++){\n result.set_element(merge.get_element(i,j+result.get_rows()),i,j);\n }\n }\n return result;\n \n }","title":""},{"docid":"9dad03d59eef216b92d11010b99a4bfd","score":"0.49351373","text":"private void fixTrans(Matrix matrix, Drawable drawable) {\n float[] m = new float[9];\n matrix.getValues(m);\n float transX = m[Matrix.MTRANS_X];\n float transY = m[Matrix.MTRANS_Y];\n RectF rectF = getDisplayRect(matrix, drawable);\n float fixTransX = getFixTrans(transX, getWidth(), rectF.width());\n float fixTransY = getFixTrans(transY, getHeight(), rectF.height());\n\n if (fixTransX != 0 || fixTransY != 0) {\n mMatrix.postTranslate(fixTransX, fixTransY);\n }\n }","title":""},{"docid":"b628eb7601bbb3a22acc1f326bb2a020","score":"0.48982927","text":"private static void rotateInplace(int[][] matrix) {\n int size = matrix.length;\n int layer = size/2;\n for(int i=0; i<layer; i++){\n for(int j=i; j<size-i-1; j++){\n int tmp = matrix[i][j];\n\n matrix[i][j] = matrix[size-j-1][i];\n matrix[size-1-j][i] = matrix[size-1-i][size-1-j];\n matrix[size-1-i][size-1-j] = matrix[j][size-1-i];\n matrix[j][size-1-i] = tmp;\n }\n }\n\n for(int i=0; i<size; i++){\n for(int j=0; j<size; j++){\n System.out.print(matrix[i][j] + \" \");\n }\n System.out.println();\n }\n }","title":""},{"docid":"43a595c263d98e291886f5ddda75f24e","score":"0.4896939","text":"public ComplexMatrix adjoint(){\n return this.conjugation().transpose();\n }","title":""},{"docid":"33a158ddb92b7843affdbe941b277090","score":"0.4882829","text":"@Override\n\tpublic Matrix operate(Matrix m) {\n\t\tif (!m.isSquare()) {\n\t\t\tnotInvertable(m);\n\t\t}\n\t\t\n\t\t//Create augmented matrix: [m|I]\n\t\tMatrix augmented = new Matrix(m.getRows(), m.getCols() * 2);\n\t\tfor (int r = 0; r < augmented.getRows(); r++) {\n\t\t\tfor (int c = 0; c < augmented.getRows() / 2; c++) {\n\t\t\t\taugmented.set(r, c, m.get(r, c));\n\t\t\t}\n\t\t\taugmented.set(r, r + augmented.getRows() / 2, 1);\n\t\t}\n\t\t\n\t\t//Apply row reduction\n\t\tMatrix reduced = rowReduction(augmented);\n\t\t\n\t\t//Get the inverse section of the reduced matrix;\n\t\tMatrix inverse = new Matrix(m.getRows(), m.getCols());\n\t\tfor (int r = 0; r < reduced.getRows(); r++) {\n\t\t\tfor (int c = m.getCols(); c < reduced.getRows(); c++) {\n\t\t\t\tinverse.set(r, c - m.getCols(), reduced.get(r, c));\n\t\t\t}\n\t\t}\n\t\t\n\t\t//Verify that inverse is actually an inverse\n\t\tif (!multiply(inverse, m).equals(newIdentityMatrix(m.getRows()))) {\n\t\t\tnotInvertable(m);\n\t\t}\n\t\t\n\t\treturn inverse;\n\t}","title":""},{"docid":"ce2b1c762e29f503dfa879d6db06829f","score":"0.48791578","text":"public static Matrix upper(Matrix m1) {\r\n double[][] upper = new double[m1.getHeight()][m1.getWidth()];\r\n for (int i = 0; i < m1.getHeight(); i++) {\r\n for (int j = 0; j < m1.getWidth(); j++) {\r\n if (j > i) {\r\n upper[i][j] = m1.get(i, j);\r\n }\r\n }\r\n }\r\n return new Matrix(upper);\r\n }","title":""},{"docid":"c4c65e14d7f244ee701fbb7ec0787cc1","score":"0.48716083","text":"public Matrix plus(Matrix m)\n\t{\n\t\tif(m.numRows != numRows || m.numColumns != numColumns) {\n\t\t\treturn null;\n\t\t}\n\t\t\n\t\t//Creates a new multidimensional array to hold new values. \n\t\tint[][] test = new int[m.numRows][m.numColumns];\n\t\t//Creates a new matrix using the multidimensional array values. \n\t\tMatrix returnMatrix = new Matrix(test);\n\t\t//Loops through the matrices, adding the values to the return matrix's values\n\t\tfor(int i = 0; i < numRows; i++) {\n\t\t\tfor(int j = 0; j < numColumns; j++) {\n\t\t\t\treturnMatrix.data[i][j] = data[i][j] + m.data[i][j];\n\t\t\t}\n\t\t}\n\t\treturn returnMatrix; //Returns the new matrix created with updated values.\n\t}","title":""},{"docid":"2930bded7fdaaafc4992f830c9848d7f","score":"0.4863786","text":"Matrix copy()\n {\n Matrix rtn=new Matrix(this.getSize());//create new matrix\n for(c=1;c<=this.getSize();c++)//cycle through all the rows in this\n {\n List l=this.getRow(c);\n for(l.moveTo(0);l.getIndex()>=0;l.moveNext())//then cycle through each entry in these rows\n {\n Entry e=(Entry) l.getElement();//create new entries with the same data as the ones in this matrix\n rtn.getRow(c).append(new Entry(e.column,e.value));//and append them to the proper place in the new Magrix\n }\n }\n return rtn;\n }","title":""},{"docid":"36a57f2b81a5a899adb02a65a703ce46","score":"0.48632917","text":"public Matrix sub(Matrix M){\n\t\tMatrix sub = M.scalarMult(-1);\t\t\t\t\t\t\t\t// set sub matrix to the -1 scalar mult of the M matrix \n\t\treturn add(sub);\t\t\t\t\t\t\t\t\t\t\t// return the sub matrix (which is the sum of this and the sub matrix)\n\t}","title":""},{"docid":"e75547bac97c45601b67946d96b66722","score":"0.48625112","text":"Matrix transpose()\n {\n Matrix rtn=new Matrix(this.getSize());//create new matrix that is the same size as this one\n for(c=1;c<=this.getSize();c++)//cycle through each row in this matrix\n {\n List l=this.getRow(c);\n for(l.moveTo(0);l.getIndex()>=0;l.moveNext())//cycle through each entry in this row\n {\n Entry i=(Entry) l.getElement();\n rtn.changeEntry(i.column,c,i.value);//swap the column and row values of the Entry in this matrix and place the transposed entry into the new matrix\n }\n }\n return rtn;\n }","title":""},{"docid":"e5cf8d9317158ea3688cd2e607563a4c","score":"0.4862128","text":"public void fillMatrix() {\r\n\t\tfor(int i = 0; i < matrix.length; ++i)\r\n\t\t\tfor(int j = 0; j < matrix[i].length; ++j)\r\n\t\t\t\tmatrix[i][j] = lcs(i,j);\r\n\t}","title":""},{"docid":"1c58b2814e6f4f4085f52a67295c6b69","score":"0.4847351","text":"protected static double[][] squareMatFromAugmented(double[][] mat) {\n int rows = mat.length;\n int cols = mat[0].length;\n double[][] newMat = new double[rows][rows];\n\n for (int i = 0; i < rows; i++) {\n for (int j = 0; j < rows; j++) {\n newMat[i][j] = mat[i][j];\n }\n }\n return newMat;\n }","title":""},{"docid":"caff628316572af73afdff27ae235393","score":"0.48464406","text":"public ComplexMatrix conjugation(){\n ComplexMatrix nmatrix= new ComplexMatrix(m,n);\n\n for(int i=0;i<m;i++){\n for(int j=0;j<n;j++){\n try {\n nmatrix.put(i,j,matrix[i][j].conjugation());\n } catch (ComplexException e) {\n e.printStackTrace();\n }\n }\n\n }\n return nmatrix;\n\n }","title":""},{"docid":"2c20f60b6ff425af6991e13b6e705339","score":"0.4843693","text":"public static Matrix transpose(Matrix m) {\n\t\tMatrix end = new Matrix(m.getDimensionX());\n\t\tfor(int i = 0; i < m.getDimensionX(); i++) {\n\t\t\tend.setColum(m.getRow(i), i);\n\t\t}\n\t\treturn end;\n\t}","title":""},{"docid":"04969f3c3625fe5c3e91e1d6ac7d26e6","score":"0.48402452","text":"public static void transposeMatrix(int[][] matrix) {\n\n int size = matrix.length;\n\n int i = 0, j = 0;\n\n while(i < size && j < size){\n int temp = matrix[i][j];\n matrix[i][j] = matrix[j][i];\n matrix[j][i] = temp;\n\n if(i == size - 1){\n j++;\n }else {\n i++;\n }\n\n }\n\n }","title":""},{"docid":"3450b7108e20a5ce5ad03f06c4c554b6","score":"0.48333624","text":"private void enlarge(){\n V[] newValues = (V[]) new Object[values.length + ENLARGING_SIZE];\n for(int i = 0; i < values.length; i++)\n newValues[i] = values[i];\n\n double[][] newMatrix = new double[matrix.length + ENLARGING_SIZE][matrix.length + ENLARGING_SIZE];\n for(int i = 0; i < matrix.length; i++){\n for(int j = 0; j < matrix.length; j++){\n newMatrix[i][j] = matrix[i][j];\n }\n }\n values = newValues;\n matrix = newMatrix;\n }","title":""},{"docid":"fa4e1c092aaac8491b7d93747df2df2b","score":"0.48179442","text":"static long[][] transpose(long[][] matrix) {\n\t\tfor (int i = 0; i < matrix.length; i++) {\n\t\t\tfor (int j = i + 1; j < matrix.length; j++) {\n\t\t\t\tlong temp = matrix[j][i];\n\t\t\t\tmatrix[j][i] = matrix[i][j];\n\t\t\t\tmatrix[i][j] = temp;\n\t\t\t}\n\t\t}\n\t\treturn matrix;\n\t}","title":""},{"docid":"8194aa6f366bd9692ad5cb9142c48636","score":"0.48143306","text":"public Matrix multiply(Matrix m2) throws RuntimeException {\r\n //this.size = (A,B)\r\n //m2.size = (C,D)\r\n //result.size = (A, D)\r\n Matrix result = new Matrix(this.getRows(), m2.getCols());\r\n result.empty();\r\n double res;\r\n if (this.getCols() == m2.getRows()) {//B === C\r\n for (int i = 0; i < result.getRows(); i++) {\r\n for (int j = 0; j < result.getCols(); j++) {\r\n for (int k = 0; k < this.getCols(); k++) {\r\n res = (this.getElement(i, k) * m2.getElement(k, j));\r\n res += result.getElement(i, j);\r\n result.setElement(i, j, res);\r\n }\r\n }\r\n }\r\n } else {\r\n throw InvalidMultiplicationException;\r\n }\r\n return result;\r\n }","title":""},{"docid":"cfaafe00029b915a2a5d74024626fd8f","score":"0.47841573","text":"public void rotate(int[][] matrix) {\n // public void rotate2(int[][] matrix) {\n int n = matrix.length;\n for (int i = 0; i < (n + 1) / 2; i++) {\n for (int j = 0; j < n / 2; j++) {\n int tmp = matrix[i][j];\n matrix[i][j] = matrix[n - 1 - j][i];\n matrix[n - 1 - j][i] = matrix[n - 1 - i][n - 1 - j];\n // matrix[n - 1 -(n - 1 - j)][n - 1 - i] = matrix[j][n - 1 - i]\n matrix[n - 1 - i][n - 1 - j] = matrix[j][n - 1 - i];\n matrix[j][n - 1 - i] = tmp;\n }\n }\n\n }","title":""},{"docid":"113f90db44f776fb71c22219ccd241e5","score":"0.47806272","text":"public SquareMatrix multiply(SquareMatrix other) {\n if (other == null) {\n throw new IllegalArgumentException(\"SquareMatrix other must not be null\");\n }\n if (values.length != other.values.length) {\n throw new IllegalArgumentException(\"Dimensions do not match!\");\n }\n SquareMatrix result = newEmptyInstance();\n for (int i = 0; i < size(); i++) {\n for (int k = 0; k < size(); k++) {\n // c_{i,k} = \\sum_{j=0}^{n} a_{i,j} * b_{j,k}\n double sum = 0D;\n for (int j = 0; j < size(); j++) {\n sum += get(i, j) * other.get(j, k);\n }\n result.set(i, k, sum);\n }\n }\n return result;\n }","title":""},{"docid":"d2fc1e2a588d93c4ec10f78930a19b48","score":"0.47747752","text":"public static <T> void mergeByColumn(Matrix2<T> main, Matrix2<T> other) {\n if (main.getRowCount() != other.getRowCount()) {\n throw new IllegalArgumentException(\"width must be equals.\");\n }\n fillColumn(main, other.getColumnCount(), null, Matrix2.ElementProvider.ofMatrix(other));\n }","title":""},{"docid":"b45ecbe5c5df8c653279510a0472db98","score":"0.47724673","text":"public BitMatrix2D concat(BitMatrix2D bm) {\n if (ROWS != bm.ROWS) {\n throw new IllegalArgumentException();\n }\n boolean[][] resMat = new boolean[this.ROWS][bm.COLUMNS + this.COLUMNS];\n for (int i = 0; i < ROWS; i++) {\n for (int j = 0; j < COLUMNS; j++) {\n resMat[i][j] = this.array[i][j];\n }\n }\n for (int i = 0; i < bm.ROWS; i++) {\n for (int j = 0; j < bm.COLUMNS; j++) {\n resMat[i][j + COLUMNS] = bm.array[i][j];\n }\n }\n return new BitMatrix2D(resMat);\n }","title":""},{"docid":"502cc1a521c5b15d16ecdb9fedfdf799","score":"0.47605836","text":"private void addTransform(float[] matrix) {\n float[] tmp = new float[9];\n \n // first row \n tmp[0] = matrix[0] * mValues[0] + matrix[1] * mValues[3] + matrix[2] * mValues[6];\n tmp[1] = matrix[0] * mValues[1] + matrix[1] * mValues[4] + matrix[2] * mValues[7];\n tmp[2] = matrix[0] * mValues[2] + matrix[1] * mValues[5] + matrix[2] * mValues[8];\n \n // 2nd row\n tmp[3] = matrix[3] * mValues[0] + matrix[4] * mValues[3] + matrix[5] * mValues[6];\n tmp[4] = matrix[3] * mValues[1] + matrix[4] * mValues[4] + matrix[5] * mValues[7];\n tmp[5] = matrix[3] * mValues[2] + matrix[4] * mValues[5] + matrix[5] * mValues[8];\n \n // 3rd row\n tmp[6] = matrix[6] * mValues[0] + matrix[7] * mValues[3] + matrix[8] * mValues[6];\n tmp[7] = matrix[6] * mValues[1] + matrix[7] * mValues[4] + matrix[8] * mValues[7];\n tmp[8] = matrix[6] * mValues[2] + matrix[7] * mValues[5] + matrix[8] * mValues[8];\n\n // copy the result over to mValues\n mValues = tmp;\n }","title":""},{"docid":"acb9e6fb4450148c5f3e9c28afb072c6","score":"0.47452083","text":"public void copy(Matrix4f pm) {\n _11 = pm._11;\n _12 = pm._12;\n _13 = pm._13;\n _14 = pm._14;\n _21 = pm._21;\n _22 = pm._22;\n _23 = pm._23;\n _24 = pm._24;\n _31 = pm._31;\n _32 = pm._32;\n _33 = pm._33;\n _34 = pm._34;\n _41 = pm._41;\n _42 = pm._42;\n _43 = pm._43;\n _44 = pm._44;\n }","title":""},{"docid":"cd90311c25c212fffb908cfe731db7d4","score":"0.47395468","text":"public void updateMatrix(){\n\t\t\n\t\tif (!plane.isDefined()){\n\t\t\t//force plane matrix for Drawables creation\n\t\t\tplaneMatrix = CoordMatrix4x4.IDENTITY;\n\t\t\ttransformedMatrix = CoordMatrix4x4.IDENTITY;\n\t\t\tinverseTransformedMatrix = CoordMatrix4x4.IDENTITY;\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tif(transform==null) //transform has not already been set\n\t\t\ttransform = CoordMatrix4x4.IDENTITY;\n\t\t\n\t\t//planeMatrix = plane.getCoordSys().getMatrixOrthonormal();\t\n\t\tplaneMatrix = plane.getCoordSys().getDrawingMatrix();\t\n\n\t\ttransformedMatrix = planeMatrix.mul(transform);//transform.mul(planeMatrix);\t\n\t\tinverseTransformedMatrix = transformedMatrix.inverse();\n\t\t\n\t}","title":""},{"docid":"897f6191f52507ceaa88cff4e9e02c98","score":"0.47256464","text":"public static boolean invert(Matrix4f pm, Matrix4f pdest) {\n\n float det;\n float idet;\n\n float a11, a12, a13, a14;\n float a21, a22, a23, a24;\n float a31, a32, a33, a34;\n float a41, a42, a43, a44;\n //\n // if determinant of matrix is 0, matrix is not regular\n //\n det = determinant(pm);\n if (det == 0)\n return false;\n //\n // build the reciprocal of the determinant\n //\n idet = 1.0f / det;\n //\n // build the adjuncts\n //\n a11 = ((pm._22 * pm._33 * pm._44) + (pm._23 * pm._34 * pm._42) + (pm._24\n * pm._32 * pm._43))\n - ((pm._24 * pm._33 * pm._42) + (pm._22 * pm._34 * pm._43) + (pm._23\n * pm._32 * pm._44));\n\n a21 = ((pm._21 * pm._33 * pm._44) + (pm._23 * pm._34 * pm._41) + (pm._24\n * pm._31 * pm._43))\n - ((pm._24 * pm._33 * pm._41) + (pm._21 * pm._34 * pm._43) + (pm._23\n * pm._31 * pm._44));\n\n a31 = ((pm._21 * pm._32 * pm._44) + (pm._22 * pm._34 * pm._41) + (pm._24\n * pm._31 * pm._42))\n - ((pm._24 * pm._32 * pm._41) + (pm._21 * pm._34 * pm._42) + (pm._22\n * pm._31 * pm._44));\n\n a41 = ((pm._21 * pm._32 * pm._43) + (pm._22 * pm._33 * pm._41) + (pm._23\n * pm._31 * pm._42))\n - ((pm._23 * pm._32 * pm._41) + (pm._21 * pm._33 * pm._42) + (pm._22\n * pm._31 * pm._43));\n //\n //\n a12 = ((pm._12 * pm._33 * pm._44) + (pm._13 * pm._34 * pm._42) + (pm._14\n * pm._32 * pm._43))\n - ((pm._14 * pm._33 * pm._42) + (pm._12 * pm._34 * pm._43) + (pm._13\n * pm._32 * pm._44));\n\n a22 = ((pm._11 * pm._33 * pm._44) + (pm._13 * pm._34 * pm._41) + (pm._14\n * pm._31 * pm._43))\n - ((pm._14 * pm._33 * pm._41) + (pm._11 * pm._34 * pm._43) + (pm._13\n * pm._31 * pm._44));\n\n a32 = ((pm._11 * pm._32 * pm._44) + (pm._12 * pm._34 * pm._41) + (pm._14\n * pm._31 * pm._42))\n - ((pm._14 * pm._32 * pm._41) + (pm._11 * pm._34 * pm._42) + (pm._12\n * pm._31 * pm._44));\n\n a42 = ((pm._11 * pm._32 * pm._43) + (pm._12 * pm._33 * pm._41) + (pm._13\n * pm._31 * pm._42))\n - ((pm._13 * pm._32 * pm._41) + (pm._11 * pm._33 * pm._42) + (pm._12\n * pm._31 * pm._43));\n //\n //\n a13 = ((pm._12 * pm._23 * pm._44) + (pm._13 * pm._24 * pm._42) + (pm._14\n * pm._22 * pm._43))\n - ((pm._14 * pm._23 * pm._42) + (pm._12 * pm._24 * pm._43) + (pm._13\n * pm._22 * pm._44));\n\n a23 = ((pm._11 * pm._23 * pm._44) + (pm._13 * pm._24 * pm._41) + (pm._14\n * pm._21 * pm._43))\n - ((pm._14 * pm._23 * pm._41) + (pm._11 * pm._24 * pm._43) + (pm._13\n * pm._21 * pm._44));\n\n a33 = ((pm._11 * pm._22 * pm._44) + (pm._12 * pm._24 * pm._41) + (pm._14\n * pm._21 * pm._42))\n - ((pm._14 * pm._22 * pm._41) + (pm._11 * pm._24 * pm._42) + (pm._12\n * pm._21 * pm._44));\n\n a43 = ((pm._11 * pm._22 * pm._43) + (pm._12 * pm._23 * pm._41) + (pm._13\n * pm._21 * pm._42))\n - ((pm._13 * pm._22 * pm._41) + (pm._11 * pm._23 * pm._42) + (pm._12\n * pm._21 * pm._43));\n //\n //\n a14 = ((pm._12 * pm._23 * pm._34) + (pm._13 * pm._24 * pm._32) + (pm._14\n * pm._22 * pm._33))\n - ((pm._14 * pm._23 * pm._32) + (pm._12 * pm._24 * pm._33) + (pm._13\n * pm._22 * pm._34));\n\n a24 = ((pm._11 * pm._23 * pm._34) + (pm._13 * pm._24 * pm._31) + (pm._14\n * pm._21 * pm._33))\n - ((pm._14 * pm._23 * pm._31) + (pm._11 * pm._24 * pm._33) + (pm._13\n * pm._21 * pm._34));\n\n a34 = ((pm._11 * pm._22 * pm._34) + (pm._12 * pm._24 * pm._31) + (pm._14\n * pm._21 * pm._32))\n - ((pm._14 * pm._22 * pm._31) + (pm._11 * pm._24 * pm._32) + (pm._12\n * pm._21 * pm._34));\n\n a44 = ((pm._11 * pm._22 * pm._33) + (pm._12 * pm._23 * pm._31) + (pm._13\n * pm._21 * pm._32))\n - ((pm._13 * pm._22 * pm._31) + (pm._11 * pm._23 * pm._32) + (pm._12\n * pm._21 * pm._33));\n //\n\n pdest._11 = (+a11) * idet;\n pdest._12 = (-a12) * idet;\n pdest._13 = (+a13) * idet;\n pdest._14 = (-a14) * idet;\n //\n pdest._21 = (-a21) * idet;\n pdest._22 = (+a22) * idet;\n pdest._23 = (-a23) * idet;\n pdest._24 = (+a24) * idet;\n //\n pdest._31 = (+a31) * idet;\n pdest._32 = (-a32) * idet;\n pdest._33 = (+a33) * idet;\n pdest._34 = (-a34) * idet;\n //\n pdest._41 = (-a41) * idet;\n pdest._42 = (+a42) * idet;\n pdest._43 = (-a43) * idet;\n pdest._44 = (+a44) * idet;\n\n return true;\n }","title":""},{"docid":"a2d7ed44a95487e03e6145e308cbbbe7","score":"0.47250172","text":"public static void transpose(int m[][]) {\n\t int i, o, placeholder;\n\t for(i=0; i<m.length; i++){\n\t for(o=0; o<i; o++){\n\t placeholder = m[i][o];\n\t m[i][o] = m[o][i];\n\t m[o][i] = placeholder;\n\t }\n\t }\n }","title":""},{"docid":"b99141fea870b0a413c250dd0b67805b","score":"0.47073343","text":"@Override\n\tpublic SparseM addition(SparseM otherM) {\n\t\treturn null;\n\t}","title":""},{"docid":"ed09c46dd6119a32bafef17707f30643","score":"0.47003865","text":"public static Matrix MatrixMultiply(Matrix a, Matrix b) \n {\n //If both a and b are both normal matrixes, do normal matrix multiplication\n if(a.columns == b.rows)\n {\n //Make new matrix with the same amount of columns as shape B and the same amount of rows as A\n Matrix newMatrix = new Matrix(a.rows, b.columns);\n //Multiply the matrices\n for (int colB = 0; colB < b.columns; colB++)\n {\n for(int rowA = 0; rowA < a.rows; rowA++)\n {\n double sum = 0.0;\n for(int colA = 0; colA < a.columns; colA++)\n {\n double multiple = (double)a.get(rowA, colA) * (double)b.get(colA, colB);\n sum += multiple;\n }\n newMatrix.set(rowA, colB, sum);\n }\n }\n //Return the new matrix\n return newMatrix;\n }\n return null; \n }","title":""},{"docid":"2c328f05a3af61f62d3db26a4aced037","score":"0.46915585","text":"private double[] mulMat(double[][] A, double[] B){\n double[] last = new double[N];\n for(int i = 0; i < N; ++i) {\n for (int k = 0; k < N; ++k) {\n last[i] += A[i][k] * B[k];\n }\n }\n\n return last;\n }","title":""},{"docid":"c701e8cbea1aa8936b20f4c94c20351d","score":"0.4681323","text":"Matrix sub(Matrix M) throws RuntimeException {\n\n if (getSize() != M.getSize())\n throw new RuntimeException(\"Matrix.java: sub() - matrices are different sizes\");\n\n Matrix res = M.copy();\n\n for (int i = 0; i < rows.length; i++) {\n List<Entry> a = rows[i];\n List<Entry> b = res.rows[i];\n a.moveFront();\n b.moveFront();\n for (a.moveTo(0); a.index() != -1; a.moveNext()) {\n Entry e = a.get();\n int col = e.column;\n double diff = e.value;\n int index = res.getEntryIndex(i + 1, col);\n if (index != -1) {\n b.moveTo(index);\n Entry temp = b.get();\n\n if(temp.value < 0)\n diff = temp.value;\n else\n diff -= temp.value;\n }\n res.changeEntry(i + 1, col, diff);\n }\n \n }\n\n return res;\n }","title":""},{"docid":"f916eb914afc71f69e5fd2fb8a063d82","score":"0.46775138","text":"public Matrix solve(Matrix rhs) {\r\n\t\tif (M != N || rhs.M != N || rhs.N != 1)\r\n\t\t\tthrow new RuntimeException(\"Illegal matrix dimensions:\\nM1xN1 = \" + M + \"x\" + N + \" and M2xN2 = \" + rhs.M + \"x\" + rhs.N);\r\n\r\n\t\t// create copies of the data\r\n\t\tMatrix A = new Matrix(this);\r\n\t\tMatrix b = new Matrix(rhs);\r\n\r\n\t\t// Gaussian elimination with partial pivoting\r\n\t\tfor (int i = 0; i < N; i++) {\r\n\r\n\t\t\t// find pivot row and swap\r\n\t\t\tint max = i;\r\n\t\t\tfor (int j = i + 1; j < N; j++)\r\n\t\t\t\tif (Math.abs(A.data[j][i]) > Math.abs(A.data[max][i]))\r\n\t\t\t\t\tmax = j;\r\n\t\t\tA.swap(i, max);\r\n\t\t\tb.swap(i, max);\r\n\r\n\t\t\t// singular\r\n\t\t\tif (A.data[i][i] == 0.0) throw new RuntimeException(\"Matrix is singular.\");\r\n\r\n\t\t\t// pivot within b\r\n\t\t\tfor (int j = i + 1; j < N; j++)\r\n\t\t\t\tb.data[j][0] -= b.data[i][0] * A.data[j][i] / A.data[i][i];\r\n\r\n\t\t\t// pivot within A\r\n\t\t\tfor (int j = i + 1; j < N; j++) {\r\n\t\t\t\tdouble m = A.data[j][i] / A.data[i][i];\r\n\t\t\t\tfor (int k = i+1; k < N; k++) {\r\n\t\t\t\t\tA.data[j][k] -= A.data[i][k] * m;\r\n\t\t\t\t}\r\n\t\t\t\tA.data[j][i] = 0.0;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t// back substitution\r\n\t\tMatrix x = new Matrix(N, 1);\r\n\t\tfor (int j = N - 1; j >= 0; j--) {\r\n\t\t\tdouble t = 0.0;\r\n\t\t\tfor (int k = j + 1; k < N; k++)\r\n\t\t\t\tt += A.data[j][k] * x.data[k][0];\r\n\t\t\tx.data[j][0] = (b.data[j][0] - t) / A.data[j][j];\r\n\t\t}\r\n\t\treturn x;\r\n\r\n\t}","title":""},{"docid":"c06dfcbd25176cc6eead85d702e3275d","score":"0.46772483","text":"public void setProductionMatrix(Matrix m){\n alphaProductionMatrix = m;\n betaProductionMatrix = compress.getCompressedMatrix(m,\"SUM\");\n }","title":""},{"docid":"0decce20ea9e76453accb86e7189e52d","score":"0.46701","text":"public static void TulisMatrix(Matrix M) {\n for (int i = NBrsMin; i < M.nbrs; i++) {\n for (int j = NKolMin; j < M.nkol; j++) {\n if (j == M.nkol - 1) {\n System.out.println(M.data[i][j]+\"\\n\");\n } \n else {\n System.out.print(M.data[i][j]+\" \");\n }\n }\n }\n }","title":""},{"docid":"b56028d5a6091ee8905c853a094d4f4e","score":"0.46616292","text":"public static void mult(Xform result, Xform op1, Xform op2)\r\n {\n \r\n result.matrix[0 * 4 + 0] = \r\n op1.matrix[0 * 4 + 0] * op2.matrix[0 * 4 + 0] +\r\n op1.matrix[0 * 4 + 1] * op2.matrix[1 * 4 + 0] +\r\n op1.matrix[0 * 4 + 2] * op2.matrix[2 * 4 + 0] +\r\n op1.matrix[0 * 4 + 3] * op2.matrix[3 * 4 + 0];\r\n \r\n result.matrix[0 * 4 + 1] = \r\n op1.matrix[0 * 4 + 0] * op2.matrix[0 * 4 + 1] +\r\n op1.matrix[0 * 4 + 1] * op2.matrix[1 * 4 + 1] +\r\n op1.matrix[0 * 4 + 2] * op2.matrix[2 * 4 + 1] +\r\n op1.matrix[0 * 4 + 3] * op2.matrix[3 * 4 + 1];\r\n \r\n result.matrix[0 * 4 + 2] = \r\n op1.matrix[0 * 4 + 0] * op2.matrix[0 * 4 + 2] +\r\n op1.matrix[0 * 4 + 1] * op2.matrix[1 * 4 + 2] +\r\n op1.matrix[0 * 4 + 2] * op2.matrix[2 * 4 + 2] +\r\n op1.matrix[0 * 4 + 3] * op2.matrix[3 * 4 + 2];\r\n \r\n result.matrix[0 * 4 + 3] = \r\n op1.matrix[0 * 4 + 0] * op2.matrix[0 * 4 + 3] +\r\n op1.matrix[0 * 4 + 1] * op2.matrix[1 * 4 + 3] +\r\n op1.matrix[0 * 4 + 2] * op2.matrix[2 * 4 + 3] +\r\n op1.matrix[0 * 4 + 3] * op2.matrix[3 * 4 + 3];\r\n \r\n \r\n result.matrix[1 * 4 + 0] = \r\n op1.matrix[1 * 4 + 0] * op2.matrix[0 * 4 + 0] +\r\n op1.matrix[1 * 4 + 1] * op2.matrix[1 * 4 + 0] +\r\n op1.matrix[1 * 4 + 2] * op2.matrix[2 * 4 + 0] +\r\n op1.matrix[1 * 4 + 3] * op2.matrix[3 * 4 + 0];\r\n \r\n result.matrix[1 * 4 + 1] = \r\n op1.matrix[1 * 4 + 0] * op2.matrix[0 * 4 + 1] +\r\n op1.matrix[1 * 4 + 1] * op2.matrix[1 * 4 + 1] +\r\n op1.matrix[1 * 4 + 2] * op2.matrix[2 * 4 + 1] +\r\n op1.matrix[1 * 4 + 3] * op2.matrix[3 * 4 + 1];\r\n \r\n result.matrix[1 * 4 + 2] = \r\n op1.matrix[1 * 4 + 0] * op2.matrix[0 * 4 + 2] +\r\n op1.matrix[1 * 4 + 1] * op2.matrix[1 * 4 + 2] +\r\n op1.matrix[1 * 4 + 2] * op2.matrix[2 * 4 + 2] +\r\n op1.matrix[1 * 4 + 3] * op2.matrix[3 * 4 + 2];\r\n \r\n result.matrix[1 * 4 + 3] = \r\n op1.matrix[1 * 4 + 0] * op2.matrix[0 * 4 + 3] +\r\n op1.matrix[1 * 4 + 1] * op2.matrix[1 * 4 + 3] +\r\n op1.matrix[1 * 4 + 2] * op2.matrix[2 * 4 + 3] +\r\n op1.matrix[1 * 4 + 3] * op2.matrix[3 * 4 + 3];\r\n \r\n \r\n result.matrix[2 * 4 + 0] = \r\n op1.matrix[2 * 4 + 0] * op2.matrix[0 * 4 + 0] +\r\n op1.matrix[2 * 4 + 1] * op2.matrix[1 * 4 + 0] +\r\n op1.matrix[2 * 4 + 2] * op2.matrix[2 * 4 + 0] +\r\n op1.matrix[2 * 4 + 3] * op2.matrix[3 * 4 + 0];\r\n \r\n result.matrix[2 * 4 + 1] = \r\n op1.matrix[2 * 4 + 0] * op2.matrix[0 * 4 + 1] +\r\n op1.matrix[2 * 4 + 1] * op2.matrix[1 * 4 + 1] +\r\n op1.matrix[2 * 4 + 2] * op2.matrix[2 * 4 + 1] +\r\n op1.matrix[2 * 4 + 3] * op2.matrix[3 * 4 + 1];\r\n \r\n result.matrix[2 * 4 + 2] = \r\n op1.matrix[2 * 4 + 0] * op2.matrix[0 * 4 + 2] +\r\n op1.matrix[2 * 4 + 1] * op2.matrix[1 * 4 + 2] +\r\n op1.matrix[2 * 4 + 2] * op2.matrix[2 * 4 + 2] +\r\n op1.matrix[2 * 4 + 3] * op2.matrix[3 * 4 + 2];\r\n \r\n result.matrix[2 * 4 + 3] = \r\n op1.matrix[2 * 4 + 0] * op2.matrix[0 * 4 + 3] +\r\n op1.matrix[2 * 4 + 1] * op2.matrix[1 * 4 + 3] +\r\n op1.matrix[2 * 4 + 2] * op2.matrix[2 * 4 + 3] +\r\n op1.matrix[2 * 4 + 3] * op2.matrix[3 * 4 + 3];\r\n \r\n \r\n result.matrix[3 * 4 + 0] = \r\n op1.matrix[3 * 4 + 0] * op2.matrix[0 * 4 + 0] +\r\n op1.matrix[3 * 4 + 1] * op2.matrix[1 * 4 + 0] +\r\n op1.matrix[3 * 4 + 2] * op2.matrix[2 * 4 + 0] +\r\n op1.matrix[3 * 4 + 3] * op2.matrix[3 * 4 + 0];\r\n \r\n result.matrix[3 * 4 + 1] = \r\n op1.matrix[3 * 4 + 0] * op2.matrix[0 * 4 + 1] +\r\n op1.matrix[3 * 4 + 1] * op2.matrix[1 * 4 + 1] +\r\n op1.matrix[3 * 4 + 2] * op2.matrix[2 * 4 + 1] +\r\n op1.matrix[3 * 4 + 3] * op2.matrix[3 * 4 + 1];\r\n \r\n result.matrix[3 * 4 + 2] = \r\n op1.matrix[3 * 4 + 0] * op2.matrix[0 * 4 + 2] +\r\n op1.matrix[3 * 4 + 1] * op2.matrix[1 * 4 + 2] +\r\n op1.matrix[3 * 4 + 2] * op2.matrix[2 * 4 + 2] +\r\n op1.matrix[3 * 4 + 3] * op2.matrix[3 * 4 + 2];\r\n \r\n result.matrix[3 * 4 + 3] = \r\n op1.matrix[3 * 4 + 0] * op2.matrix[0 * 4 + 3] +\r\n op1.matrix[3 * 4 + 1] * op2.matrix[1 * 4 + 3] +\r\n op1.matrix[3 * 4 + 2] * op2.matrix[2 * 4 + 3] +\r\n op1.matrix[3 * 4 + 3] * op2.matrix[3 * 4 + 3];\r\n \r\n }","title":""},{"docid":"d26d6a3135049d8ff3b55c4ffa7b1739","score":"0.4642076","text":"public Matrix plus(Matrix B) {\r\n\t\tMatrix A = this;\r\n\t\tif (B.M != A.M || B.N != A.N) throw new RuntimeException(\"Illegal matrix dimensions.\");\r\n\t\tMatrix C = new Matrix(M, N);\r\n\t\tfor (int i = 0; i < M; i++)\r\n\t\t\tfor (int j = 0; j < N; j++)\r\n\t\t\t\tC.data[i][j] = A.data[i][j] + B.data[i][j];\r\n\t\treturn C;\r\n\t}","title":""},{"docid":"7d213a2d029a58980e1771de904093e6","score":"0.46419102","text":"public ooMatrix multiply(ooMatrix second){\n\t\tooMatrix result = new ooMatrix(this.row, this.column);\n\t\tfor(int i=0; i<this.row; i++){\n\t\t\tfor(int j=0; j<this.column; j++){\n\t\t\t\tint sum = 0;\n\t\t\t\tfor(int k=0; k<this.column; k++){\n\t\t\t\t\tsum += this.data[i][k] * second.data[k][j];\n\t\t\t\t}\n\t\t\t\tresult.data[i][j] = sum;\n\t\t\t}\n\t\t}\n\treturn result;\n\t}","title":""},{"docid":"b4a7c5236140697281721842126bbff7","score":"0.4635606","text":"public ObjectMatrix2D assign(ObjectMatrix2D source) {\n\t// overriden for performance only\n\tif (! (source instanceof DenseObjectMatrix2D)) {\n\t\treturn super.assign(source);\n\t}\n\tDenseObjectMatrix2D other = (DenseObjectMatrix2D) source;\n\tif (other==this) return this; // nothing to do\n\tcheckShape(other);\n\t\n\tif (this.isNoView && other.isNoView) { // quickest\n\t\tSystem.arraycopy(other.elements, 0, this.elements, 0, this.elements.length);\n\t\treturn this;\n\t}\n\t\n\tif (haveSharedCells(other)) {\n\t\tObjectMatrix2D c = other.copy();\n\t\tif (! (c instanceof DenseObjectMatrix2D)) { // should not happen\n\t\t\treturn super.assign(other);\n\t\t}\n\t\tother = (DenseObjectMatrix2D) c;\n\t}\n\t\n\tfinal Object[] elems = this.elements;\n\tfinal Object[] otherElems = other.elements;\n\tif (elements==null || otherElems==null) throw new InternalError();\n\tint cs = this.columnStride;\n\tint ocs = other.columnStride;\n\tint rs = this.rowStride;\n\tint ors = other.rowStride;\n\n\tint otherIndex = other.index(0,0);\n\tint index = index(0,0);\n\tfor (int row=rows; --row >= 0; ) {\n\t\tfor (int i=index, j=otherIndex, column=columns; --column >= 0; ) {\n\t\t\telems[i] = otherElems[j];\n\t\t\ti += cs;\n\t\t\tj += ocs;\n\t\t}\n\t\tindex += rs;\n\t\totherIndex += ors;\n\t}\n\treturn this;\n}","title":""},{"docid":"fb6a5e233ded25307a88829a8ce71dc3","score":"0.4630829","text":"Matrix copy() {\n Matrix res = new Matrix(size);\n for (int i = 0; i < size; i++) {\n List<Entry> list = rows[i];\n for (list.moveTo(0); list.index() != -1; list.moveNext()) {\n Entry entry = list.get();\n // System.out.println(\"Append\");\n res.rows[i].append(entry);\n res.nnz++;\n }\n }\n res.nnz = getNNZ();\n return res;\n }","title":""},{"docid":"e830de119b1c6e4de2266a3a663d6add","score":"0.46290135","text":"public void combineUp() {\r\n\t\tfor(int c=0; c<board.length; c++) {\r\n\t\t\tint[]col = getCol(board,c);\r\n\t\t\tfor(int r = 0; r<board.length-1; r++) {\r\n\t\t\t\t\tfor(int i=r+1; i<board[0].length; i++) {\r\n\t\t\t\tif(col[r]==col[i]&&Math.abs(i-c)==1) {\r\n\t\t\t\t\tcol[r] += col[i];\r\n\t\t\t\t\tcol[i] = 0;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t\tfor(int r =0; r<board.length;r++){\r\n\t\t\t\tboard[r][c] = col[r];\r\n\t\t}\r\n\t}\r\n\t}","title":""},{"docid":"9c4f161b1932bdecf4edb17884437387","score":"0.46186772","text":"public static Matrix33 matrixMultiply(Matrix33 m1, Matrix33 m2) {\n return new Matrix33(m1.xx*m2.xx + m1.xy*m2.yx + m1.xz*m2.zx,\n m1.xx*m2.xy + m1.xy*m2.yy + m1.xz*m2.zy,\n m1.xx*m2.xz + m1.xy*m2.yz + m1.xz*m2.zz,\n m1.yx*m2.xx + m1.yy*m2.yx + m1.yz*m2.zx,\n m1.yx*m2.xy + m1.yy*m2.yy + m1.yz*m2.zy,\n m1.yx*m2.xz + m1.yy*m2.yz + m1.yz*m2.zz,\n m1.zx*m2.xx + m1.zy*m2.yx + m1.zz*m2.zx,\n m1.zx*m2.xy + m1.zy*m2.yy + m1.zz*m2.zy,\n m1.zx*m2.xz + m1.zy*m2.yz + m1.zz*m2.zz);\n }","title":""},{"docid":"d03d882adb7e603d4e4f31843b0bb2fe","score":"0.46158051","text":"public void applyTransform(Matrix m) {\n for (int i = 0; i < nPoints(); i++) {\n Point v = new Point(getPoint(i));\n v.apply(m);\n setPoint(i, v);\n }\n }","title":""},{"docid":"cf4a38120b1dc96da236166e975554a6","score":"0.4613035","text":"private void transpose(char[][] matrix) {\n int start = 1;\n for (int x = 0; x < matrix.length-1; x++){\n for (int y = start; y < matrix[x].length; y++){\n char tmp = matrix[x][y];\n matrix[x][y] = matrix[y][x];\n matrix[y][x] = tmp;\n }\n start++;\n }\n }","title":""},{"docid":"0f0513e15a4e70895f1ad177dff678bb","score":"0.4612895","text":"public Matrix solve(Matrix rhs) {\n if (M != N || rhs.M != N || rhs.N != 1)\n throw new RuntimeException(\"Illegal matrix dimensions.\");\n\n // create copies of the data\n Matrix A = new Matrix(this);\n Matrix b = new Matrix(rhs);\n\n // Gaussian elimination with partial pivoting\n for (int i = 0; i < N; i++) {\n\n // find pivot row and swap\n int max = i;\n for (int j = i + 1; j < N; j++)\n if (Math.abs(A.data[j][i]) > Math.abs(A.data[max][i]))\n max = j;\n A.swap(i, max);\n b.swap(i, max);\n\n // singular\n if (A.data[i][i] == 0.0) throw new RuntimeException(\"Matrix is singular.\");\n\n // pivot within b\n for (int j = i + 1; j < N; j++)\n b.data[j][0] -= b.data[i][0] * A.data[j][i] / A.data[i][i];\n\n // pivot within A\n for (int j = i + 1; j < N; j++) {\n double m = A.data[j][i] / A.data[i][i];\n for (int k = i+1; k < N; k++) {\n A.data[j][k] -= A.data[i][k] * m;\n }\n A.data[j][i] = 0.0;\n }\n }\n\n // back substitution\n Matrix x = new Matrix(N, 1);\n for (int j = N - 1; j >= 0; j--) {\n double t = 0.0;\n for (int k = j + 1; k < N; k++)\n t += A.data[j][k] * x.data[k][0];\n x.data[j][0] = (b.data[j][0] - t) / A.data[j][j];\n }\n return x;\n\n }","title":""},{"docid":"b6867ae00802c351fd08b831bc08ef63","score":"0.4596329","text":"public Matrix plus(Matrix B) {\n Matrix A = this;\n if (B.M != A.M || B.N != A.N) throw new RuntimeException(\"Illegal matrix dimensions.\");\n Matrix C = new Matrix(M, N);\n for (int i = 0; i < M; i++)\n for (int j = 0; j < N; j++)\n C.data[i][j] = A.data[i][j] + B.data[i][j];\n return C;\n }","title":""},{"docid":"b3e436856ffd03ba0fc67baa77813d26","score":"0.45901176","text":"public static void inflate() {\n double[] sum = new double[dimensions];\n /* multiplication of two matrices of the same size can be defined by multiplying the corresponding entries \n and this is known as the Hadamard product.*/\n for (int j = 0; j < dimensions; j++) {\n for (int i = 0; i < dimensions; i++) {\n sum[j] += Math.pow(transMatrix.get(i).c[j], inflate);\n }\n }\n for (int j = 0; j < dimensions; j++) {\n for (int i = 0; i < dimensions; i++) {\n transMatrix.get(i).c[j] = Math.pow(transMatrix.get(i).c[j], inflate) / sum[j];\n }\n }\n }","title":""},{"docid":"0a8404af6632d754efcd4741d912816e","score":"0.4589601","text":"public void remove(int index){\n\t\tbyte[][] newmatrix = new byte[matrix.length-1][matrix.length-1];//create new matrix that is smaller by one\n\t\tfor(int i = 0; i < index; i++){\n\t\t\tfor(int j = 0; j < index; j++){\n\t\t\t\tnewmatrix[i][j] = matrix[i][j];\n\t\t\t}\n\t\t\tfor(int j = index +1; j < matrix.length; j++){\n\t\t\t\tnewmatrix[i][j-1] = matrix[i][j];\n\t\t\t}\n\t\t}\n\t\tfor(int i = index +1; i < matrix.length; i++){\n\t\t\tfor(int j = 0; j < index; j++){\n\t\t\t\tnewmatrix[i-1][j] = matrix[i][j];\n\t\t\t}\n\t\t\tfor(int j = index +1; j < matrix.length; j++){\n\t\t\t\tnewmatrix[i-1][j-1] = matrix[i][j];\n\t\t\t}\n\t\t}\n\t\tmatrix = newmatrix;\n\t}","title":""},{"docid":"316a3263533e512ffd26257d70a5c665","score":"0.4587354","text":"private static int[][] transpose(int[][] matrix) {\n int row=matrix.length;\n int col=matrix[0].length;\n\n for (int i = 0; i < matrix.length; i++) {\n for (int j = i; j < matrix[0].length; j++) {\n int temp=matrix[i][j];\n matrix[i][j]=matrix[j][i];\n matrix[j][i]=temp;\n }\n }\n return matrix;\n }","title":""},{"docid":"f9557e9fc979169417aa112648ccfdaf","score":"0.45870134","text":"void dgemm(TransposeType transA, TransposeType transB, int m, int n, int k, double alpha, double[] matA, int offsetA, int ldA, double[] matB, int offsetB, int ldB, double beta, double[] matC, int offsetC, int ldC);","title":""},{"docid":"b1f7bdccbefa7cfbd6ab9cc8e3427946","score":"0.45838457","text":"public void updateMatrix(boolean deep) {\n\t\tMat4 parentMatrix = (parent == null) ? new Mat4(1.0f) : parent.matrix;\r\n\r\n\t\t// Redoslijed operacija u ovom sistemu. Moze da bude i drugaciji,\r\n\t\t// zavisno\r\n\t\t// potreba aplikacije koju pravimo.\r\n\r\n\t\tMat4 mat = new Mat4(parentMatrix);\r\n\t\tmat = mat.translate(position);\r\n\r\n\t\tmat = mat.scale(scale);\r\n\r\n\t\tmat = mat.multiply(Matrices.rotate(yaw, new Vec3(0.0f, 1.0f, 0.0f)));\r\n\t\tmat = mat.multiply(Matrices.rotate(pitch, new Vec3(1.0f, 0.0f, 0.0f)));\r\n\t\tmat = mat.multiply(Matrices.rotate(roll, new Vec3(0.0f, 0.0f, -1.0f)));\r\n\r\n\t\tmatrix = mat;\r\n\t\tmatrix.store(matBuffModel);\r\n\t\tmatBuffModel.flip();\r\n\r\n\t\t// Vektore orijentacije ponovo dobijamo transformisanjem jedinicnih\r\n\t\t// vektora\r\n\t\t// Vec4 forward4 = new Vec4(0.0f, 0.0f, -1.0f, 0.0f).multiplyTP(matrix);\r\n\t\t// Vec4 up4 = new Vec4(0.0f, 1.0f, 0.0f, 0.0f).multiplyTP(matrix);\r\n\t\t// Vec4 right4 = new Vec4(1.0f, 0.0f, 0.0f, 0.0f).multiplyTP(matrix);\r\n\r\n\t\t// up = new Vec3(up4.x, up4.y, up4.z);\r\n\t\t// right = new Vec3(right4.x, right4.y, right4.z);\r\n\t\t// forward = new Vec3(forward4.x, forward4.y, forward4.z);\r\n\r\n\t\t// Deep znaci rekurzivno azuriranje i svih child objekata\r\n\t\tif (deep) {\r\n\t\t\tfor (GameObject child : children)\r\n\t\t\t\tchild.updateMatrix(true);\r\n\t\t}\r\n\t}","title":""},{"docid":"28fd513df9cc2ff74ede1833b252abda","score":"0.45777178","text":"public abstract void writeMatrix();","title":""},{"docid":"c5f0188d54198bc3c790e16c8f4e6f46","score":"0.45692974","text":"public static void rotate(int[][] matrix) {\n int len = matrix.length;\n for(int i = 0; i != len/2; i ++){\n for(int j = i; j != len -i-1 ; j ++){\n int temp = matrix[i][j];\n matrix[i][j] = matrix[len-j-1][i];\n matrix[len-j-1][i] = matrix[len-i-1][len-j-1];\n matrix[len-i-1][len-j-1] = matrix[j][len-i-1];\n matrix[j][len-i-1] = temp;\n }\n }\n for(int i = 0; i < len; i ++) {\n for (int j = 0; j < len; j++)\n System.out.print(matrix[i][j]);\n System.out.println(\"\");\n }\n return;\n }","title":""},{"docid":"d90fc4a577c1aa8805f8a44fc9b0a7da","score":"0.45686042","text":"public static void main(String[] args) {\n\n\t\tint a[][] = new int[3][3];\n\t\tint m[][] = new int[3][3];\n\t\tint i,j,n;\n\t\t\n\t\t\n\t\tSystem.out.println(\"Enter elments in matrix: \");\n\t\t\n\t\tScanner sc = new Scanner(System.in);\n\t\t\n\t\tfor(i=0;i<3;i++)\n\t\t{\n\t\t\tfor(j=0;j<3;j++)\n\t\t\t{\n\t\t\t\tSystem.out.println(\"Enter elements in [\"+i+\"]\"+\"[\"+j+\"] :\");\n\t\t\t\ta[i][j] = sc.nextInt();\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\tSystem.out.println(\"Matrix is : \");\n\t\t\n\t\tfor(i=0;i<3;i++)\n\t\t{\n\t\t\tfor(j=0;j<3;j++)\n\t\t\t{\n\t\t\t\tSystem.out.print(a[i][j]+\" \");\n\t\t\t\n\t\t\t\t\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t\t\n\t\t}\n\t\t\n\t\tfor(i=0;i<3;i++)\n\t\t{\n\t\t\tn=3-1;\n\t\t\tfor(j=0;j<3;j++)\n\t\t\t{\n\t\t\t\tm[i][j] = m[i][j]+a[i][n];\n\t\t\t\tn--;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\tSystem.out.println(\"Mirror Matrix is : \");\n\t\t\n\t\tfor(i=0;i<3;i++)\n\t\t{\n\t\t\tfor(j=0;j<3;j++)\n\t\t\t{\n\t\t\t\tSystem.out.print(m[i][j]+\" \");\n\t\t\t\n\t\t\t\t\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t\t\n\t\t}\n\t\t\n\t\t\n\t}","title":""},{"docid":"54d9781321e358094f662846db1868d6","score":"0.4565218","text":"public static double [][] transposeMatrix(double [][] m){\n\t\tdouble [][] m2 = new double[m[0].length][m.length];\n\t\t\n\t\tfor(int i = 0; i < m.length; i++){\n\t\t\tfor(int j = 0; j < m[i].length; j++){\n\t\t\t\tm2[j][i] = m[i][j];\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn m2;\n\t}","title":""},{"docid":"948a5a5ac34801084415593bf9022c65","score":"0.4562813","text":"private void addToMatracies(DoubleMatrix inputExample, DoubleMatrix outputExample)\n\t{\n\t\tif (X == null)\n\t\t{\n\t\t\tX = new DoubleMatrix(inputExample.toArray()); \n\t\t\tY = new DoubleMatrix(outputExample.toArray());\n\t\t}\n\t\telse if (X.getColumns() == NNL_width*NNL_height && Y.getColumns() == NN_L.getTopology()[NN_L.getTopology().length-1] )\n\t\t{\n\t\t\tX = DoubleMatrix.concatVertically(X,inputExample);\n\t\t\tY = DoubleMatrix.concatVertically(Y, outputExample);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (debug)\n\t\t\t{\n\t\t\t\tSystem.out.println(\"ERROR IN addToMatracies: sizes of X or sizes of Y are not correct.\");\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"43d1bb92043a01cff6af08a0c422b7a2","score":"0.45612493","text":"public void resetModelMatrices() {\n\t\toldModelMat.identity();\n\t\tmodelMat.identity();\n\t}","title":""},{"docid":"bc9b7942cc8e6b03ae1dd31505e8e0e9","score":"0.455234","text":"private static Matrix relu(Matrix input) {\n for(int row = 0; row < input.getRowDimension(); row++) {\n for(int column = 0; column < input.getColumnDimension(); column++) {\n if(input.get(row, column) < 0) input.set(row, column, 0);\n }\n }\n return input;\n }","title":""},{"docid":"fa9fee27d6ef6a2b8059012d1631f2c9","score":"0.45498762","text":"Matrix transpose() {\n\n Matrix res = new Matrix(size);\n\n for (int i = 0; i < size; i++) {\n List<Entry> a = rows[i];\n for (a.moveTo(0); a.index() != -1; a.moveNext()) {\n Entry e = a.get();\n int currCol = e.column;\n res.changeEntry(currCol, i + 1, e.value);\n }\n }\n return res;\n }","title":""},{"docid":"c6126dd414eea48594e0921992a2eaae","score":"0.4540723","text":"public void rotate(int[][] matrix) {\n if(matrix==null || matrix.length<=1)\n return;\n int N = matrix.length;\n int[][] res = new int[N][N];\n for(int i=0; i<N; i++){\n for(int j=0; j<N; j++)\n res[j][N-1-i] = matrix[i][j];\n }\n for(int i=0;i<N;i++){\n for(int j=0; j<N; j++)\n matrix[i][j] = res[i][j];\n }\n }","title":""},{"docid":"6c43e0caee04a72845617e640a6e824f","score":"0.45404488","text":"public void cal()\n\t{\t\t\n\t\tr=ROW;\n\t\tfor(i=0,k=r;i<ROW;i++,k--)\n\t\t{\n\t\t\tn=1;\t\t\t\t\n\t\t\tfor(j=i+1,l=r;j<r;j++,l--)\n\t\t\t{\n\t\t\t\tmat[i][j]=mat[i][j-1]; // Column right\n\t\t\t\tmat[j][i]=mat[i][j-1]; // Row Down\t\t\t\t\n\t\t\t\tmat[l-1][k-1]=mat[r-n][r-n]; // Row Up\n\t\t\t\tmat[k-1][l-1]=mat[r-n][r-n]; // Column left\t\t\t\t\t\n\t\t\t}\n\t\t\tn++;\n\t\t\tr--;\t\t\t\t\n\t\t}\t\t\t\n\t}","title":""},{"docid":"39c43495ec012d723628464b260d000e","score":"0.4540012","text":"public void rotate(int[][] matrix) {\n int n = matrix.length;\n for(int r = 0; r < n / 2; r++)\n for(int c = r; c < n - 1 - r; c++){\n int tmp = matrix[n - 1 - c][r];\n matrix[n - 1 - c][r] = matrix[n - 1 - r][n - 1 - c];\n matrix[n - 1 - r][n - 1 - c] = matrix[c][n - 1- r];\n matrix[c][n - 1 - r] = matrix[r][c];\n matrix[r][c] = tmp;\n }\n }","title":""},{"docid":"d7e511f0bef2b9361a7d645e0416f6a8","score":"0.45314455","text":"public void rotate(int[][] matrix) {\n int n = matrix.length;\n for(int i=0; i<(n/2); i++){\n for(int j=0; j<((n+1)/2); j++){\n int tmp = matrix[i][j];\n matrix[i][j]=matrix[n-1-j][i];\n matrix[n-1-j][i]=matrix[n-1-i][n-1-j];\n matrix[n-1-i][n-1-j]=matrix[j][n-1-i];\n matrix[j][n-1-i]=tmp;\n }\n }\n return;\n }","title":""},{"docid":"b5585fda7c26eaf228c188892dde3d1a","score":"0.45291525","text":"private void copiarMatriz(int [][]argNew,int [][]argCopy){\r\n //Parámetros nuevo arreglo (vacio),arreglo con los datos a copiar\r\n for (int i = 0; i < argCopy.length; i++) {\r\n for (int j = 0; j < argCopy.length; j++) {\r\n argNew[i][j]=argCopy[i][j];\r\n }\r\n }\r\n\r\n }","title":""},{"docid":"5ad5cc63c54a98ae6ea0ef61a756abd9","score":"0.4525711","text":"public Matrix add(Matrix m) {\n if (numCols() != m.numCols() || numRows() != m.numRows()) {\n return null;\n }\n Matrix c = new Matrix(numRows(), numCols());\n for (int i=0; i<numRows(); i++) {\n for (int j=0; j<numCols(); j++) {\n c.setValue(i, j, get(i, j) + m.get(i, j));\n }\n }\n return c;\n }","title":""},{"docid":"cc6db080982f902e7d04f554fdea8466","score":"0.4519805","text":"public static Matrix multiply(Matrix A, Matrix B) {\n\n\t\tif (A.col != B.row) \n\t\t\tthrow new RuntimeException(\"Illegal matrix dimensions.\");\n\t\t\n\t\tMatrix C = new Matrix(A.row, B.col); \n for (int i = 0; i < C.row; i++)\n for (int j = 0; j < C.col; j++)\n for (int k = 0; k < A.col; k++)\n C.data[i][j] += (A.data[i][k] * B.data[k][j]);\n return C;\n\t}","title":""},{"docid":"a9b1070d675c24cb7edad6256035fef6","score":"0.4513649","text":"public Matrix add(Matrix B){\n\t\tassert n == B.n && m == B.m;\n\t\tMatrix C = new Matrix(m,n);\n\t\tfor(int i = 0; i < m; i++){\n\t\t\tfor(int j = 0; j < n; j++){\n\t\t\t\tC.set(i,j,this.get(i,j)+B.get(i,j));\n\t\t\t}\n\t\t}\n\t\treturn C;\n\t}","title":""},{"docid":"ed2f92df8e304d8a930ec8c675b9d79f","score":"0.45106044","text":"public static void normalise() {\n double csum;\n for (int j = 0; j < dimensions; j++) {\n csum = 0;\n for (int k = 0; k < dimensions; k++) {\n csum = csum + transMatrix.get(k).c[j];\n }\n for (int i = 0; i < dimensions; i++) {\n transMatrix.get(i).c[j] = transMatrix.get(i).c[j] / csum;\n }\n }\n }","title":""},{"docid":"c51dcc8581b4f62658d978792a5bf9ec","score":"0.45098534","text":"public void getMvpMatrix(float[] matrix, int offset) { System.arraycopy(this.mMvpMatrix, 0, matrix, offset, this.mMvpMatrix.length); }","title":""},{"docid":"3ee270b81b495d776aa28327f6866dcb","score":"0.4506049","text":"public int[][] updateMatrix(int[][] m) {\n int row = m.length, col = m[0].length;\n boolean[][] vis = new boolean[row][col];\n for(int i = 0; i < row; i++){\n for(int j = 0; j < col; j++){\n if(m[i][j] != 0) m[i][j] = distance(m, i, j, vis);\n }\n }\n return m;\n }","title":""},{"docid":"fd15c86174437ab96596ac633e16a228","score":"0.4500451","text":"public Matrix(double[][] mtrx){\n\t\tm = mtrx.length;\n\t\tn = mtrx[0].length;\n\t\tA = new double[m][n];\n\t\tfor(int i = 0; i < mtrx.length; i++){\n\t\t\tfor(int j = 0; j < mtrx[0].length; j++){\n\t\t\t\tA[i][j] = mtrx[i][j];\n\t\t\t}\n\t\t}\n\t}","title":""}],"string":"[\n {\n \"docid\": \"679dc34300c9664c771571760a8f3b48\",\n \"score\": \"0.6288829\",\n \"text\": \"public boolean preConcat(Matrix other) {\\n Matrix m = new Matrix(other);\\n other.addTransform(mValues);\\n set(m);\\n \\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d421762318139099ad94023cdb86aff1\",\n \"score\": \"0.5857409\",\n \"text\": \"Matrix mult(Matrix M)\\n {\\n equalSizes(M,\\\"mult()\\\");//checks the pre-condition\\n Matrix m=M.copy();\\n Matrix rtn=new Matrix(this.getSize());//create a new matrix of the same size as this matrix\\n Matrix mt=m.transpose();//transpose the passed matrix\\n List NZrows=new List();//list to hold the indicies of all rows in this matrix \\n List cp=new List();//holds the rows of M.transpose which are not empty\\n //these rows are subject to dot() (as zero rows would only yeild a zero entry for rtn, and don't need to be accounted for)\\n for(c=1;c<=this.getSize();c++)//cycle through each row of this matrix, and of the transposed M \\n {\\n if(!this.getRow(c).isEmpty())//if a row of the matrix is not empty, then note that in the List\\n {\\n NZrows.append(c);\\n }\\n if(!mt.getRow(c).isEmpty())\\n {\\n cp.append(c);\\n }\\n }\\n for(NZrows.moveTo(0);NZrows.getIndex()>=0;NZrows.moveNext())//for each non-empty row in this matrix\\n {\\n int r=(int)NZrows.getElement();\\n for(cp.moveTo(0);cp.getIndex()>=0;cp.moveNext())//and for each non-empty row in M.transpose()\\n {\\n int cl=(int)cp.getElement();\\n double d=dot(this.getRow(r),mt.getRow(cl));//find the dot product of all non-empty rows\\n if(d!=0.0)//if it's not zero\\n {\\n rtn.changeEntry(r,cl,d);//place it in the appropriate place in the new matrix\\n }\\n }\\n }\\n return rtn;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"362d23ffcd9e8f5bb4ed303fa0a2d874\",\n \"score\": \"0.5777699\",\n \"text\": \"Matrix multiply(Matrix other) {\\n Matrix c = new Matrix(size);\\n int n = size;\\n for (int i = 0; i < n; i++)\\n for (int j = 0; j < n; j++)\\n for (int k = 0; k < n; k++)\\n c.data[i][j] += data[i][k] * other.data[k][j];\\n return c;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e49c59756e1b7045b6a0081737d3714f\",\n \"score\": \"0.5691651\",\n \"text\": \"Matrix mult(Matrix M) throws RuntimeException {\\n\\n if (getSize() != M.getSize())\\n throw new RuntimeException(\\\"Matrix.java: mult() - matrices are different sizes\\\");\\n\\n M = M.transpose();\\n\\n Matrix res = new Matrix(size);\\n\\n for (int i = 0; i < size; i++) {\\n if (rows[i].length() != size)\\n continue;\\n else {\\n for (int j = 0; j < size; j++)\\n res.changeEntry(i, j, dot(this.rows[i], M.rows[i]));\\n }\\n }\\n return res;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ecb93a0889c852e0a4df0f332104ee4c\",\n \"score\": \"0.5581454\",\n \"text\": \"public void concatMatrix(AffineTransform at) {\\n if (!at.isIdentity()) {\\n writeTJ();\\n StringBuffer sb = new StringBuffer();\\n writeAffineTransform(at, sb);\\n sb.append(\\\" cm\\\\n\\\");\\n write(sb);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f08e2d13a921e22bafdaa011713f1be7\",\n \"score\": \"0.5548942\",\n \"text\": \"public static Matrix Transpose(Matrix M){\\n Matrix hasil = new Matrix(Matrix.GetKol(M), Matrix.GetRow(M));\\n\\n for(int i = 0; i < Matrix.GetRow(hasil); i++){\\n for(int j = 0; j < Matrix.GetKol(hasil); j++){\\n Matrix.SetElmt(hasil, i, j, Matrix.GetElmt(M, j, i));\\n }\\n }\\n return hasil;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"836c2c39505fd5fe5e97935641cbe0ae\",\n \"score\": \"0.548826\",\n \"text\": \"public Matrix multiply(Matrix other) {\\n if (getColumnCount() != other.getRowCount()) {\\n throw new IllegalArgumentException(other + \\\" must have \\\" + getColumnCount() + \\\" rows!\\\");\\n }\\n double[][] entries = new double[getRowCount()][other.getColumnCount()];\\n int numRows = getRowCount();\\n int numCols = getColumnCount();\\n for (int i = 0; i < numRows; ++i) {\\n for (int j = 0; j < numCols; ++j) {\\n entries[i][j] = getRow(i).dot4D(other.getColumn(j));\\n }\\n }\\n return new Matrix(entries);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3b270b53c24295efb7bb70894303fd4\",\n \"score\": \"0.53778124\",\n \"text\": \"public Matrix mulMatrix(Matrix m1 , Matrix m2){\\n \\t int dim = m1.getDimension(); //the dimension of the adjacency matrix\\n \\t Matrix matrix = new Matrix(dim); //a matrix to save the powered matrix to it \\n \\t //makes the row*column multiplications\\n \\t ArrayList<Double> list = new ArrayList<Double>();\\n \\t for (int i=0;i<dim;i++){\\n for (int j=0;j<dim;j++){ \\n for (int k=0;k<dim;k++){\\n list.add(m1.getValueOf(i, k)+m2.getValueOf(k, j));\\n } \\n matrix.setEdge(i, j, getMax(list));\\n list.clear();\\n }\\n }\\n\\treturn matrix; \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bb3fdefaf06752c8810b621add39249\",\n \"score\": \"0.53608567\",\n \"text\": \"Matrix add(Matrix M)\\n {\\n equalSizes(M,\\\"add()\\\");//check pre-condition\\n Matrix m=M.copy();//create a copy of the passed matrix, this avoids creating erroes if the passed matrix points to this matrix\\n Matrix rtn=new Matrix(this.getSize());//create a new matrix that is the same size as the two matricies being added\\n for(c=1;c<=this.getSize();c++)//cycle through all the rows in these two matricies\\n {\\n List this_l=this.getRow(c);\\n List that_l=m.getRow(c);\\n this_l.moveTo(0);\\n that_l.moveTo(0);\\n while(this_l.getIndex()>=0&&that_l.getIndex()>=0)//cycle through all the entries in these\\n {\\n Entry one=(Entry) this_l.getElement();\\n Entry two=(Entry) that_l.getElement();\\n int col1=one.column;\\n int col2=two.column;\\n if(col1==col2)//if both rows have entries in the same column, the sum of these entries becomes the value of the corresponding entry in the new matrix\\n {\\n rtn.changeEntry(c,col1,one.value+two.value);\\n this_l.moveNext();//continue cycling\\n that_l.moveNext();\\n }\\n else if(col1>col2)//if one row has an entry in the column while the other has a zero\\n {\\n rtn.changeEntry(c,col2,two.value);//then the corresponding entry in the new matrix becomes that of the value in the matrix without the zero entry \\n that_l.moveNext();//don't cycle through the other row, because zero entries are not recorded\\n }\\n else if(col1<col2)\\n {\\n rtn.changeEntry(c,col1,one.value);\\n this_l.moveNext();\\n }\\n }\\n while(this_l.getIndex()>=0)//if one row reaches its final entry before the other\\n //cycle through the remaining entries in the unended row and copy them to the new matrix\\n {\\n Entry one=(Entry) this_l.getElement();\\n rtn.changeEntry(c,one.column,one.value);\\n this_l.moveNext();\\n }\\n while(that_l.getIndex()>=0)\\n {\\n Entry two=(Entry) that_l.getElement();\\n rtn.changeEntry(c,two.column,two.value);\\n that_l.moveNext();\\n }\\n }\\n return rtn;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be9c01aef2d0c80d942eaba5220da209\",\n \"score\": \"0.53542197\",\n \"text\": \"public boolean setConcat(Matrix a, Matrix b) {\\n if (a == this) {\\n preConcat(b);\\n } else if (b == this) {\\n postConcat(b);\\n } else {\\n Matrix tmp = new Matrix(b);\\n tmp.addTransform(a.mValues);\\n set(tmp);\\n }\\n \\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3db409ecfd7429b5d4c0460c00bf790\",\n \"score\": \"0.5311808\",\n \"text\": \"Matrix multiplyFaster(Matrix other) {\\n Matrix c = new Matrix(size);\\n int n = size;\\n for (int i = 0; i < n; i++)\\n for (int k = 0; k < n; k++)\\n for (int j = 0; j < n; j++)\\n c.data[i][j] += data[i][k] * other.data[k][j];\\n return c;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"961d802dea351ebb2a0f942a8595fb36\",\n \"score\": \"0.5241591\",\n \"text\": \"public static DoubleMatrix compose(DoubleMatrix[][] input) {\\n\\t\\tint nr = input.length;\\n\\t\\tint nc = input[0].length;\\n\\t\\tint[] numberOfColumns = new int[nc];\\n\\t\\tint[] numberOfRows = new int[nr];\\n\\t\\tint totalrows = 0;\\n\\t\\tint totalcols = 0;\\n\\t\\t\\n\\t\\tfor (int r = 0; r < nr; r++) {\\n\\t\\t\\tnumberOfRows[r] = input[r][0].numberOfRows();\\n\\t\\t\\ttotalrows += numberOfRows[r];\\n\\t\\t}\\n\\n\\t\\tfor (int c = 0; c < nc; c++) {\\n\\t\\t\\tnumberOfColumns[c] = input[0][c].numberOfColumns();\\n\\t\\t\\ttotalcols += numberOfColumns[c];\\n\\t\\t}\\n\\n\\t\\tBlasDoubleMatrix[][] matrices = new BlasDoubleMatrix[nr][nc];\\n\\t\\tfor (int r = 0; r < nr; r++) {\\n\\t\\t\\tfor (int c = 0; c < nc; c++) {\\n\\t\\t\\t\\tif (input[r][c].numberOfRows() != numberOfRows[r] || input[r][c].numberOfColumns() != numberOfColumns[c]) \\n\\t\\t\\t\\t\\tthrow new IllegalArgumentException(\\\"Incongruent matrices input to BlasDoubleMatrix.compose\\\");\\n\\t\\t\\t\\tmatrices[r][c] = (BlasDoubleMatrix) input[r][c];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t//create the new double[] and copy the old stuff to it\\n\\t\\tint resultSize = totalrows * totalcols;\\n\\t\\tdouble[] result = new double[resultSize];\\n\\t\\tint ptr0 = 0;\\n\\t\\tfor (int c = 0; c < nc; c++) {\\n\\t\\t\\tint nc2 = numberOfColumns[c];\\n\\t\\t\\tint ptr1 = 0;\\n\\t\\t\\tfor (int r = 0; r < nr; r++) {\\n\\t\\t\\t\\tint srcptr = 0;\\n\\t\\t\\t\\tint destptr = ptr0 + ptr1; \\n\\t\\t\\t\\tfor (int c2 = 0; c2 < nc2; c2++) {\\n\\t\\t\\t\\t\\tSystem.arraycopy(matrices[r][c].myMatrix, srcptr, result, destptr, numberOfRows[r]);\\n\\t\\t\\t\\t\\tsrcptr += numberOfRows[r];\\n\\t\\t\\t\\t\\tdestptr += totalrows;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tptr1 += numberOfRows[r];\\n\\t\\t\\t}\\n\\t\\t\\tptr0 += totalrows * numberOfColumns[c];\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn BlasDoubleMatrix.getInstance(totalrows, totalcols, result, true);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1df22cac5f84c799bb17cc3ba7041cdc\",\n \"score\": \"0.52356017\",\n \"text\": \"public static void applyMatrix(PApplet renderer, PGraphicsOpenGL pgraphics3D, Matrix m) {\\n switch (RENDERER_STATE) {\\n case PROCESSING_MATRIX_MODE:\\n pgraphics3D.modelview.apply(\\n m.m00, m.m01, m.m02, m.m03,\\n m.m10, m.m11, m.m12, m.m13,\\n m.m20, m.m21, m.m22, m.m23,\\n m.m30, m.m31, m.m32, m.m33\\n );\\n break;\\n case OPENGL_MATRIX_MODE:\\n GL2 gl = getGL();\\n ctm[0] = m.m00;\\n ctm[1] = m.m10;\\n ctm[2] = m.m20;\\n ctm[3] = m.m30;\\n\\n ctm[4] = m.m01;\\n ctm[5] = m.m11;\\n ctm[6] = m.m21;\\n ctm[7] = m.m31;\\n\\n ctm[8] = m.m02;\\n ctm[9] = m.m12;\\n ctm[10] = m.m22;\\n ctm[11] = m.m32;\\n\\n ctm[12] = m.m03;\\n ctm[13] = m.m13;\\n ctm[14] = m.m23;\\n ctm[15] = m.m33;\\n\\n // apply this m and get to work\\n gl.glMultMatrixf(ctm, 0);\\n break;\\n default:\\n break;\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6272ac4cc180c95b992640a411e10ec\",\n \"score\": \"0.5144203\",\n \"text\": \"protected static double[][] multiplyMatrix(double[][] mat1, double[][] mat2) {\\n // Prekondisi kolom mat1 = baris mat2\\n int rows1 = mat1.length;\\n int cols1 = mat1[0].length;\\n int rows2 = mat2.length;\\n int cols2 = mat2[0].length;\\n double[][] newMat = new double[rows1][cols2];\\n\\n for (int i = 0; i < newMat.length; i++) {\\n for (int j = 0; j < newMat[0].length; j++) {\\n newMat[i][j] = 0;\\n for (int k = 0; k < cols1; k++) {\\n newMat[i][j] += mat1[i][k] * mat2[k][j];\\n }\\n }\\n }\\n return newMat;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09f5bdf81c7952cdfac6996617339966\",\n \"score\": \"0.5119241\",\n \"text\": \"public Matrix mult(Matrix M){\\n\\t\\tMatrix mult = new Matrix(size);\\t\\t\\t\\t\\t\\t\\t\\t// create new matrix to hold the matrix product\\n\\t\\tMatrix mTran = M.transpose();\\t\\t\\t\\t\\t\\t\\t\\t// create new matrix to hold transpose matrix M (to turn its columns into rows)\\n\\t\\tfor (int i = 1; i <= size; i++){\\t\\t\\t\\t\\t\\t\\t// iterate through matrix's rows\\n\\t\\t\\tfor (int counter = 1; counter <= size; counter++){\\t\\t// iterate through M's columns\\n\\t\\t\\t\\tdouble dotProd = dot(row[i], mTran.row[counter]);\\t// create a dot product variable to hold the value of the dot product of the matrix's row and matrix M's column\\n\\t\\t\\t\\tif (dotProd != 0.0){\\t\\t\\t\\t\\t\\t\\t\\t// if the dot product variable is not zero\\n\\t\\t\\t\\t\\tmult.changeEntry(i, counter, dotProd);\\t\\t\\t// add it to the corresponding position in the matrix\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\treturn mult;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// return the product matrix\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0aa843eb2225cece073cfd75ce1fb096\",\n \"score\": \"0.5103117\",\n \"text\": \"public void reflectX() {\\n System.out.println(\\\"a\\\");\\n int[][] temp=mtx;\\n int k=0;\\n for(int i=0; i<size; i++){\\n for(int j=size-1; j>=0; j--){\\n mtx[j][i]=temp[k][i];\\n k++;\\n }\\n k=0;\\n } \\n //System.out.println(\\\"a\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ca7ad29aad4f3b03d0431657f9b478e\",\n \"score\": \"0.50981987\",\n \"text\": \"public Matrix transpose() {\\r\\n\\t\\tMatrix A = new Matrix(N, M);\\r\\n\\t\\tfor (int i = 0; i < M; i++)\\r\\n\\t\\t\\tfor (int j = 0; j < N; j++)\\r\\n\\t\\t\\t\\tA.data[j][i] = this.data[i][j];\\r\\n\\t\\treturn A;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6159ef0307cd687a95359d4ac2473126\",\n \"score\": \"0.5065055\",\n \"text\": \"@Override\\n\\tpublic SparseM multiplication(SparseM otherM) {\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d882db185a6b888ea30cbe2fa2454db\",\n \"score\": \"0.5061114\",\n \"text\": \"void setTransfoMatrix(Matrix4 m);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86663b0a937a1fea7e66aa702994fa3a\",\n \"score\": \"0.50483304\",\n \"text\": \"public ComplexMatrix transpose(){\\n ComplexMatrix nmatrix= new ComplexMatrix(n,m);\\n\\n for(int i=0;i<m;i++){\\n for(int j=0;j<n;j++){\\n try {\\n nmatrix.put(j,i,matrix[i][j]);\\n } catch (ComplexException e) {\\n e.printStackTrace();\\n }\\n }\\n\\n }\\n return nmatrix;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bbf763df19ed214fab212e92fb336848\",\n \"score\": \"0.5042208\",\n \"text\": \"private void reorder() {\\n final int m = inputMatrix.getRows();\\n final int n = inputMatrix.getColumns();\\n\\n int i;\\n int j;\\n int k;\\n int s;\\n int inc = 1;\\n double sw;\\n final double[] su = new double[m];\\n final double[] sv = new double[n];\\n\\n do {\\n inc *= 3;\\n inc++;\\n } while (inc <= n);\\n do {\\n inc /= 3;\\n for (i = inc; i < n; i++) {\\n sw = w[i];\\n for (k = 0; k < m; k++) {\\n su[k] = u.getElementAt(k, i);\\n }\\n for (k = 0; k < n; k++) {\\n sv[k] = v.getElementAt(k, i);\\n }\\n j = i;\\n while (w[j - inc] < sw) {\\n w[j] = w[j - inc];\\n for (k = 0; k < m; k++) {\\n u.setElementAt(k, j, u.getElementAt(k, j - inc));\\n }\\n for (k = 0; k < n; k++) {\\n v.setElementAt(k, j, v.getElementAt(k, j - inc));\\n }\\n j -= inc;\\n if (j < inc) {\\n break;\\n }\\n }\\n w[j] = sw;\\n for (k = 0; k < m; k++) {\\n u.setElementAt(k, j, su[k]);\\n }\\n for (k = 0; k < n; k++) {\\n v.setElementAt(k, j, sv[k]);\\n }\\n }\\n } while (inc > 1);\\n\\n for (k = 0; k < n; k++) {\\n s = 0;\\n for (i = 0; i < m; i++) {\\n if (u.getElementAt(i, k) < 0.0) {\\n s++;\\n }\\n }\\n for (j = 0; j < n; j++) {\\n if (v.getElementAt(j, k) < 0.0) {\\n s++;\\n }\\n }\\n if (s > (m + n) / 2) {\\n for (i = 0; i < m; i++) {\\n u.setElementAt(i, k, -u.getElementAt(i, k));\\n }\\n for (j = 0; j < n; j++) {\\n v.setElementAt(j, k, -v.getElementAt(j, k));\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e117e75a75100649e2c0d6117395b92\",\n \"score\": \"0.5038113\",\n \"text\": \"Matrix sub(Matrix M)\\n {\\n equalSizes(M,\\\"sub()\\\");//check pre-condition\\n /*\\n * a-b=a+(-b)\\n */\\n return this.add(M.scalarMult(-1));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cea83140ee03a1fa8b4c406fdb55e9c7\",\n \"score\": \"0.5035715\",\n \"text\": \"static void transpose(int [][] matrix ) {\\n\\t\\tfinal int R = matrix.length, C = matrix[0].length;\\n\\t\\tint k = 1;\\n\\t\\tfor (int r = 0; r < R - 1 ; r++) { // -1 because of L share (upside down) and elements at diagonal are unchanged\\n\\t\\t\\tfor (int c = r + 1; c < R; c++) {\\n\\t\\t\\t\\t//System.out.println(\\\"K=\\\" + k++);\\n\\t\\t\\t\\tint t = matrix[c][r];\\n\\t\\t\\t\\tmatrix[c][r] = matrix[r][c]; \\n\\t\\t\\t\\tmatrix[r][c] = t;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprint(matrix);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3f0fab284da18b135622ea42ea7596e\",\n \"score\": \"0.5018322\",\n \"text\": \"public Matrix add(Matrix M){\\n\\t\\tMatrix add = new Matrix(size);\\t\\t\\t\\t\\t\\t\\t\\t// create a new matrix object to hold matrix sum\\n\\t\\tif (equals(M)){\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// if the matrices are the same (ie A + A)\\n\\t\\t\\tadd = scalarMult(2);\\t\\t\\t\\t\\t\\t\\t\\t\\t// return a scalar multiple of that matrix \\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tfor (int i = 1; i <= size; i++){\\n\\t\\t\\t\\t// List newrow = new List();\\t\\t\\t\\t\\t\\t// create a new list object (temporary) to hold each row\\n\\t\\t\\t\\trow[i].moveFront();\\t\\t\\t\\t\\t\\t\\t\\t\\t// move cursor of this matrix to the front\\n\\t\\t\\t\\tM.row[i].moveFront();\\t\\t\\t\\t\\t\\t\\t\\t// move cursor of matrix M to the front (both cursors are now in the same place)\\n\\t\\t\\t\\twhile (row[i].get() != null || M.row[i].get() != null){\\t// while both cursors are not null\\n\\t\\t\\t\\t\\tEntry oldRow = (Entry) row[i].get();\\t\\t\\t// entry object for the old row's cursor data\\n\\t\\t\\t\\t\\tEntry argOldRow = (Entry) M.row[i].get();\\t\\t// entry object for tha argument old row's cursor data\\n\\t\\t\\t\\t\\tif (row[i].get() != null && M.row[i].get() == null){\\n\\t\\t\\t\\t\\t\\tadd.changeEntry(i, oldRow.getColumn(), oldRow.getEntry());\\n\\t\\t\\t\\t\\t\\trow[i].moveNext();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (row[i].get() == null && M.row[i].get() != null){\\n\\t\\t\\t\\t\\t\\tadd.changeEntry(i, argOldRow.getColumn(), argOldRow.getEntry());\\n\\t\\t\\t\\t\\t\\tM.row[i].moveNext();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (oldRow.getColumn() == argOldRow.getColumn()){\\t// if both cursors have the same column\\n\\t\\t\\t\\t\\t\\t// newrow.append(e);\\t\\t\\t\\t\\t\\t// append the entry to the temporary list object\\n\\t\\t\\t\\t\\t\\tadd.changeEntry(i, oldRow.getColumn(), oldRow.getEntry()+argOldRow.getEntry());\\n\\t\\t\\t\\t\\t\\trow[i].moveNext();\\t\\t\\t\\t\\t\\t\\t// move both cursors to the next position\\n\\t\\t\\t\\t\\t\\tM.row[i].moveNext();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (oldRow.getColumn() < argOldRow.getColumn()){\\t// if the column number on the first matrix is less than the M matrix\\n\\t\\t\\t\\t\\t\\t// newrow.append(e);\\t\\t\\t\\t\\t\\t// append the entry to the temporary list object\\n\\t\\t\\t\\t\\t\\tadd.changeEntry(i, oldRow.getColumn(), oldRow.getEntry());\\n\\t\\t\\t\\t\\t\\trow[i].moveNext();\\t\\t\\t\\t\\t\\t\\t// move the first matrix's cursor to the next position\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (oldRow.getColumn() > argOldRow.getColumn()){\\t// if the column number on the first matrix is greater than the M matrix\\n\\t\\t\\t\\t\\t\\t// newrow.append(e);\\t\\t\\t\\t\\t\\t// append the entry to the temporary list object\\n\\t\\t\\t\\t\\t\\tadd.changeEntry(i, argOldRow.getColumn(), argOldRow.getEntry());\\n\\t\\t\\t\\t\\t\\tM.row[i].moveNext();\\t\\t\\t\\t\\t\\t// move the M matrix's cursor to the next position\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t// add.row[i] = newrow;\\t\\t\\t\\t\\t\\t\\t\\t\\t// set that row's list equal to the new list\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn add;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// return the addition matrix\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a9f1b7b0cec6cb6744150d66c654e3c\",\n \"score\": \"0.5015176\",\n \"text\": \"public Matrix transpose() {\\n Matrix A = new Matrix(N, M);\\n for (int i = 0; i < M; i++)\\n for (int j = 0; j < N; j++)\\n A.data[j][i] = this.data[i][j];\\n return A;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3ed65aa7160f2b25c7db4820bacf3d3\",\n \"score\": \"0.4995673\",\n \"text\": \"public static Matrix transpose(Matrix m1) {\\r\\n double[][] transpose = new double[m1.getWidth()][m1.getHeight()];\\r\\n for (int i = 0; i < m1.getHeight(); i++) {\\r\\n for (int j = 0; j < m1.getWidth(); j++) {\\r\\n transpose[j][i] = m1.get(i, j);\\r\\n }\\r\\n }\\r\\n return new Matrix(transpose);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55b5cb6eeb17c40791e87d5ce309feb3\",\n \"score\": \"0.49729285\",\n \"text\": \"public AffineTransform multiply(AffineTransform other)\\n{\\n AffineTransform trans = new AffineTransform();\\n \\n trans.m_transform[0] = other.m_transform[0] * m_transform[0] + other.m_transform[1] * m_transform[2];\\n trans.m_transform[1] = other.m_transform[0] * m_transform[1] + other.m_transform[1] * m_transform[3];\\n trans.m_transform[2] = other.m_transform[2] * m_transform[0] + other.m_transform[3] * m_transform[2];\\n trans.m_transform[3] = other.m_transform[2] * m_transform[1] + other.m_transform[3] * m_transform[3];\\n trans.m_transform[4] = other.m_transform[4] * m_transform[0] + other.m_transform[5] * m_transform[2] + m_transform[4];\\n trans.m_transform[5] = other.m_transform[4] * m_transform[1] + other.m_transform[5] * m_transform[3] + m_transform[5];\\n\\n setMatrix(trans.m_transform);\\n return this;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5cd03d24b41d392057006b43c7046b61\",\n \"score\": \"0.49659994\",\n \"text\": \"Matrix add(Matrix M) throws RuntimeException {\\n\\n if (getSize() != M.getSize())\\n throw new RuntimeException(\\\"Matrix.java: add() - matrices are different sizes\\\");\\n\\n if (this.equals(M))\\n return this.scalarMult(2);\\n\\n Matrix res = M.copy();\\n\\n for (int i = 0; i < rows.length; i++) {\\n res.rows[i] = addRow(1, i + 1, this.rows[i], res.rows[i]);\\n }\\n\\n return res;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"313028f84dadbb25a6229fbef50dccf7\",\n \"score\": \"0.4961017\",\n \"text\": \"public GMatrix transpose () {\\n\\t\\tGMatrix reMat = new GMatrix( this );\\n\\t\\tint temp=reMat.n; reMat.n=reMat.m; reMat.m=temp;\\n\\t\\t\\n\\t\\tfor(int i = 0; i < n; i ++) {\\n\\t\\t\\tfor(int j = 0;j < m; j ++) {\\n\\t\\t\\t\\treMat.safeSet(j, i, safeGet(i, j));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn reMat;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a4c1c2b88ce340ec39fa9560907b1d3\",\n \"score\": \"0.49553302\",\n \"text\": \"public static Matrix multiply2M(Matrix m1, Matrix m2) {\\n\\t\\tMatrix tmp = new Matrix(m1.getDimensionY(), m2.getDimensionX());\\n\\t\\tif(isMultipliable(m1, m2)) {\\n\\t\\t\\tfor(int x = 0; x < tmp.getDimensionX(); x++) {\\n\\t\\t\\t\\tfor(int y = 0; y < tmp.getDimensionY(); y++) {\\n\\t\\t\\t\\t\\tBigDecimal[] tmpX = m1.getRow(y);\\n\\t\\t\\t\\t\\tBigDecimal[] tmpY = m2.getColum(x);\\n\\t\\t\\t\\t\\tBigDecimal tmpZ = new BigDecimal(0);\\n\\t\\t\\t\\t\\tfor(int k = 0; k < tmpX.length; k++) {\\n\\t\\t\\t\\t\\t\\ttmpZ = tmpZ.add(tmpX[k].multiply(tmpY[k]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\ttmp.setCell(x, y, tmpZ); \\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}else {\\n\\t\\t\\tSystem.out.println(\\\"Error\\\");\\n\\t\\t}\\n\\t\\treturn tmp;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7d4173a8d841c29f6e33ac7fd2b5582\",\n \"score\": \"0.49538997\",\n \"text\": \"public Matrix matrix_inverse(Matrix a){\\n \\n Matrix merge = new Matrix(a.get_rows(),a.get_collumns()*2);\\n for(int i=0;i<a.get_rows();i++){\\n for(int j=0;j<a.get_collumns();j++){\\n merge.set_element(a.get_element(i,j),i,j);\\n }\\n }\\n int modulo = merge.get_rows();\\n for(int i=0;i<merge.get_rows();i++){\\n for(int j=a.get_collumns();j<merge.get_collumns();j++){\\n if(j%modulo==0){\\n merge.set_element(1,i,j);\\n }\\n else{\\n merge.set_element(0,i,j);\\n }\\n }\\n modulo++;\\n }\\n merge = reduced_row_echelon_form(merge);\\n Matrix result = new Matrix(a.get_rows(),a.get_collumns());\\n for(int i=0;i<result.get_rows();i++){\\n for(int j=0;j<result.get_collumns();j++){\\n result.set_element(merge.get_element(i,j+result.get_rows()),i,j);\\n }\\n }\\n return result;\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dad03d59eef216b92d11010b99a4bfd\",\n \"score\": \"0.49351373\",\n \"text\": \"private void fixTrans(Matrix matrix, Drawable drawable) {\\n float[] m = new float[9];\\n matrix.getValues(m);\\n float transX = m[Matrix.MTRANS_X];\\n float transY = m[Matrix.MTRANS_Y];\\n RectF rectF = getDisplayRect(matrix, drawable);\\n float fixTransX = getFixTrans(transX, getWidth(), rectF.width());\\n float fixTransY = getFixTrans(transY, getHeight(), rectF.height());\\n\\n if (fixTransX != 0 || fixTransY != 0) {\\n mMatrix.postTranslate(fixTransX, fixTransY);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b628eb7601bbb3a22acc1f326bb2a020\",\n \"score\": \"0.48982927\",\n \"text\": \"private static void rotateInplace(int[][] matrix) {\\n int size = matrix.length;\\n int layer = size/2;\\n for(int i=0; i<layer; i++){\\n for(int j=i; j<size-i-1; j++){\\n int tmp = matrix[i][j];\\n\\n matrix[i][j] = matrix[size-j-1][i];\\n matrix[size-1-j][i] = matrix[size-1-i][size-1-j];\\n matrix[size-1-i][size-1-j] = matrix[j][size-1-i];\\n matrix[j][size-1-i] = tmp;\\n }\\n }\\n\\n for(int i=0; i<size; i++){\\n for(int j=0; j<size; j++){\\n System.out.print(matrix[i][j] + \\\" \\\");\\n }\\n System.out.println();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43a595c263d98e291886f5ddda75f24e\",\n \"score\": \"0.4896939\",\n \"text\": \"public ComplexMatrix adjoint(){\\n return this.conjugation().transpose();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"33a158ddb92b7843affdbe941b277090\",\n \"score\": \"0.4882829\",\n \"text\": \"@Override\\n\\tpublic Matrix operate(Matrix m) {\\n\\t\\tif (!m.isSquare()) {\\n\\t\\t\\tnotInvertable(m);\\n\\t\\t}\\n\\t\\t\\n\\t\\t//Create augmented matrix: [m|I]\\n\\t\\tMatrix augmented = new Matrix(m.getRows(), m.getCols() * 2);\\n\\t\\tfor (int r = 0; r < augmented.getRows(); r++) {\\n\\t\\t\\tfor (int c = 0; c < augmented.getRows() / 2; c++) {\\n\\t\\t\\t\\taugmented.set(r, c, m.get(r, c));\\n\\t\\t\\t}\\n\\t\\t\\taugmented.set(r, r + augmented.getRows() / 2, 1);\\n\\t\\t}\\n\\t\\t\\n\\t\\t//Apply row reduction\\n\\t\\tMatrix reduced = rowReduction(augmented);\\n\\t\\t\\n\\t\\t//Get the inverse section of the reduced matrix;\\n\\t\\tMatrix inverse = new Matrix(m.getRows(), m.getCols());\\n\\t\\tfor (int r = 0; r < reduced.getRows(); r++) {\\n\\t\\t\\tfor (int c = m.getCols(); c < reduced.getRows(); c++) {\\n\\t\\t\\t\\tinverse.set(r, c - m.getCols(), reduced.get(r, c));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t//Verify that inverse is actually an inverse\\n\\t\\tif (!multiply(inverse, m).equals(newIdentityMatrix(m.getRows()))) {\\n\\t\\t\\tnotInvertable(m);\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn inverse;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce2b1c762e29f503dfa879d6db06829f\",\n \"score\": \"0.48791578\",\n \"text\": \"public static Matrix upper(Matrix m1) {\\r\\n double[][] upper = new double[m1.getHeight()][m1.getWidth()];\\r\\n for (int i = 0; i < m1.getHeight(); i++) {\\r\\n for (int j = 0; j < m1.getWidth(); j++) {\\r\\n if (j > i) {\\r\\n upper[i][j] = m1.get(i, j);\\r\\n }\\r\\n }\\r\\n }\\r\\n return new Matrix(upper);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c4c65e14d7f244ee701fbb7ec0787cc1\",\n \"score\": \"0.48716083\",\n \"text\": \"public Matrix plus(Matrix m)\\n\\t{\\n\\t\\tif(m.numRows != numRows || m.numColumns != numColumns) {\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t\\t\\n\\t\\t//Creates a new multidimensional array to hold new values. \\n\\t\\tint[][] test = new int[m.numRows][m.numColumns];\\n\\t\\t//Creates a new matrix using the multidimensional array values. \\n\\t\\tMatrix returnMatrix = new Matrix(test);\\n\\t\\t//Loops through the matrices, adding the values to the return matrix's values\\n\\t\\tfor(int i = 0; i < numRows; i++) {\\n\\t\\t\\tfor(int j = 0; j < numColumns; j++) {\\n\\t\\t\\t\\treturnMatrix.data[i][j] = data[i][j] + m.data[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn returnMatrix; //Returns the new matrix created with updated values.\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2930bded7fdaaafc4992f830c9848d7f\",\n \"score\": \"0.4863786\",\n \"text\": \"Matrix copy()\\n {\\n Matrix rtn=new Matrix(this.getSize());//create new matrix\\n for(c=1;c<=this.getSize();c++)//cycle through all the rows in this\\n {\\n List l=this.getRow(c);\\n for(l.moveTo(0);l.getIndex()>=0;l.moveNext())//then cycle through each entry in these rows\\n {\\n Entry e=(Entry) l.getElement();//create new entries with the same data as the ones in this matrix\\n rtn.getRow(c).append(new Entry(e.column,e.value));//and append them to the proper place in the new Magrix\\n }\\n }\\n return rtn;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36a57f2b81a5a899adb02a65a703ce46\",\n \"score\": \"0.48632917\",\n \"text\": \"public Matrix sub(Matrix M){\\n\\t\\tMatrix sub = M.scalarMult(-1);\\t\\t\\t\\t\\t\\t\\t\\t// set sub matrix to the -1 scalar mult of the M matrix \\n\\t\\treturn add(sub);\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// return the sub matrix (which is the sum of this and the sub matrix)\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e75547bac97c45601b67946d96b66722\",\n \"score\": \"0.48625112\",\n \"text\": \"Matrix transpose()\\n {\\n Matrix rtn=new Matrix(this.getSize());//create new matrix that is the same size as this one\\n for(c=1;c<=this.getSize();c++)//cycle through each row in this matrix\\n {\\n List l=this.getRow(c);\\n for(l.moveTo(0);l.getIndex()>=0;l.moveNext())//cycle through each entry in this row\\n {\\n Entry i=(Entry) l.getElement();\\n rtn.changeEntry(i.column,c,i.value);//swap the column and row values of the Entry in this matrix and place the transposed entry into the new matrix\\n }\\n }\\n return rtn;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5cf8d9317158ea3688cd2e607563a4c\",\n \"score\": \"0.4862128\",\n \"text\": \"public void fillMatrix() {\\r\\n\\t\\tfor(int i = 0; i < matrix.length; ++i)\\r\\n\\t\\t\\tfor(int j = 0; j < matrix[i].length; ++j)\\r\\n\\t\\t\\t\\tmatrix[i][j] = lcs(i,j);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c58b2814e6f4f4085f52a67295c6b69\",\n \"score\": \"0.4847351\",\n \"text\": \"protected static double[][] squareMatFromAugmented(double[][] mat) {\\n int rows = mat.length;\\n int cols = mat[0].length;\\n double[][] newMat = new double[rows][rows];\\n\\n for (int i = 0; i < rows; i++) {\\n for (int j = 0; j < rows; j++) {\\n newMat[i][j] = mat[i][j];\\n }\\n }\\n return newMat;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"caff628316572af73afdff27ae235393\",\n \"score\": \"0.48464406\",\n \"text\": \"public ComplexMatrix conjugation(){\\n ComplexMatrix nmatrix= new ComplexMatrix(m,n);\\n\\n for(int i=0;i<m;i++){\\n for(int j=0;j<n;j++){\\n try {\\n nmatrix.put(i,j,matrix[i][j].conjugation());\\n } catch (ComplexException e) {\\n e.printStackTrace();\\n }\\n }\\n\\n }\\n return nmatrix;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c20f60b6ff425af6991e13b6e705339\",\n \"score\": \"0.4843693\",\n \"text\": \"public static Matrix transpose(Matrix m) {\\n\\t\\tMatrix end = new Matrix(m.getDimensionX());\\n\\t\\tfor(int i = 0; i < m.getDimensionX(); i++) {\\n\\t\\t\\tend.setColum(m.getRow(i), i);\\n\\t\\t}\\n\\t\\treturn end;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04969f3c3625fe5c3e91e1d6ac7d26e6\",\n \"score\": \"0.48402452\",\n \"text\": \"public static void transposeMatrix(int[][] matrix) {\\n\\n int size = matrix.length;\\n\\n int i = 0, j = 0;\\n\\n while(i < size && j < size){\\n int temp = matrix[i][j];\\n matrix[i][j] = matrix[j][i];\\n matrix[j][i] = temp;\\n\\n if(i == size - 1){\\n j++;\\n }else {\\n i++;\\n }\\n\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3450b7108e20a5ce5ad03f06c4c554b6\",\n \"score\": \"0.48333624\",\n \"text\": \"private void enlarge(){\\n V[] newValues = (V[]) new Object[values.length + ENLARGING_SIZE];\\n for(int i = 0; i < values.length; i++)\\n newValues[i] = values[i];\\n\\n double[][] newMatrix = new double[matrix.length + ENLARGING_SIZE][matrix.length + ENLARGING_SIZE];\\n for(int i = 0; i < matrix.length; i++){\\n for(int j = 0; j < matrix.length; j++){\\n newMatrix[i][j] = matrix[i][j];\\n }\\n }\\n values = newValues;\\n matrix = newMatrix;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa4e1c092aaac8491b7d93747df2df2b\",\n \"score\": \"0.48179442\",\n \"text\": \"static long[][] transpose(long[][] matrix) {\\n\\t\\tfor (int i = 0; i < matrix.length; i++) {\\n\\t\\t\\tfor (int j = i + 1; j < matrix.length; j++) {\\n\\t\\t\\t\\tlong temp = matrix[j][i];\\n\\t\\t\\t\\tmatrix[j][i] = matrix[i][j];\\n\\t\\t\\t\\tmatrix[i][j] = temp;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn matrix;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8194aa6f366bd9692ad5cb9142c48636\",\n \"score\": \"0.48143306\",\n \"text\": \"public Matrix multiply(Matrix m2) throws RuntimeException {\\r\\n //this.size = (A,B)\\r\\n //m2.size = (C,D)\\r\\n //result.size = (A, D)\\r\\n Matrix result = new Matrix(this.getRows(), m2.getCols());\\r\\n result.empty();\\r\\n double res;\\r\\n if (this.getCols() == m2.getRows()) {//B === C\\r\\n for (int i = 0; i < result.getRows(); i++) {\\r\\n for (int j = 0; j < result.getCols(); j++) {\\r\\n for (int k = 0; k < this.getCols(); k++) {\\r\\n res = (this.getElement(i, k) * m2.getElement(k, j));\\r\\n res += result.getElement(i, j);\\r\\n result.setElement(i, j, res);\\r\\n }\\r\\n }\\r\\n }\\r\\n } else {\\r\\n throw InvalidMultiplicationException;\\r\\n }\\r\\n return result;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cfaafe00029b915a2a5d74024626fd8f\",\n \"score\": \"0.47841573\",\n \"text\": \"public void rotate(int[][] matrix) {\\n // public void rotate2(int[][] matrix) {\\n int n = matrix.length;\\n for (int i = 0; i < (n + 1) / 2; i++) {\\n for (int j = 0; j < n / 2; j++) {\\n int tmp = matrix[i][j];\\n matrix[i][j] = matrix[n - 1 - j][i];\\n matrix[n - 1 - j][i] = matrix[n - 1 - i][n - 1 - j];\\n // matrix[n - 1 -(n - 1 - j)][n - 1 - i] = matrix[j][n - 1 - i]\\n matrix[n - 1 - i][n - 1 - j] = matrix[j][n - 1 - i];\\n matrix[j][n - 1 - i] = tmp;\\n }\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"113f90db44f776fb71c22219ccd241e5\",\n \"score\": \"0.47806272\",\n \"text\": \"public SquareMatrix multiply(SquareMatrix other) {\\n if (other == null) {\\n throw new IllegalArgumentException(\\\"SquareMatrix other must not be null\\\");\\n }\\n if (values.length != other.values.length) {\\n throw new IllegalArgumentException(\\\"Dimensions do not match!\\\");\\n }\\n SquareMatrix result = newEmptyInstance();\\n for (int i = 0; i < size(); i++) {\\n for (int k = 0; k < size(); k++) {\\n // c_{i,k} = \\\\sum_{j=0}^{n} a_{i,j} * b_{j,k}\\n double sum = 0D;\\n for (int j = 0; j < size(); j++) {\\n sum += get(i, j) * other.get(j, k);\\n }\\n result.set(i, k, sum);\\n }\\n }\\n return result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2fc1e2a588d93c4ec10f78930a19b48\",\n \"score\": \"0.47747752\",\n \"text\": \"public static <T> void mergeByColumn(Matrix2<T> main, Matrix2<T> other) {\\n if (main.getRowCount() != other.getRowCount()) {\\n throw new IllegalArgumentException(\\\"width must be equals.\\\");\\n }\\n fillColumn(main, other.getColumnCount(), null, Matrix2.ElementProvider.ofMatrix(other));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b45ecbe5c5df8c653279510a0472db98\",\n \"score\": \"0.47724673\",\n \"text\": \"public BitMatrix2D concat(BitMatrix2D bm) {\\n if (ROWS != bm.ROWS) {\\n throw new IllegalArgumentException();\\n }\\n boolean[][] resMat = new boolean[this.ROWS][bm.COLUMNS + this.COLUMNS];\\n for (int i = 0; i < ROWS; i++) {\\n for (int j = 0; j < COLUMNS; j++) {\\n resMat[i][j] = this.array[i][j];\\n }\\n }\\n for (int i = 0; i < bm.ROWS; i++) {\\n for (int j = 0; j < bm.COLUMNS; j++) {\\n resMat[i][j + COLUMNS] = bm.array[i][j];\\n }\\n }\\n return new BitMatrix2D(resMat);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"502cc1a521c5b15d16ecdb9fedfdf799\",\n \"score\": \"0.47605836\",\n \"text\": \"private void addTransform(float[] matrix) {\\n float[] tmp = new float[9];\\n \\n // first row \\n tmp[0] = matrix[0] * mValues[0] + matrix[1] * mValues[3] + matrix[2] * mValues[6];\\n tmp[1] = matrix[0] * mValues[1] + matrix[1] * mValues[4] + matrix[2] * mValues[7];\\n tmp[2] = matrix[0] * mValues[2] + matrix[1] * mValues[5] + matrix[2] * mValues[8];\\n \\n // 2nd row\\n tmp[3] = matrix[3] * mValues[0] + matrix[4] * mValues[3] + matrix[5] * mValues[6];\\n tmp[4] = matrix[3] * mValues[1] + matrix[4] * mValues[4] + matrix[5] * mValues[7];\\n tmp[5] = matrix[3] * mValues[2] + matrix[4] * mValues[5] + matrix[5] * mValues[8];\\n \\n // 3rd row\\n tmp[6] = matrix[6] * mValues[0] + matrix[7] * mValues[3] + matrix[8] * mValues[6];\\n tmp[7] = matrix[6] * mValues[1] + matrix[7] * mValues[4] + matrix[8] * mValues[7];\\n tmp[8] = matrix[6] * mValues[2] + matrix[7] * mValues[5] + matrix[8] * mValues[8];\\n\\n // copy the result over to mValues\\n mValues = tmp;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"acb9e6fb4450148c5f3e9c28afb072c6\",\n \"score\": \"0.47452083\",\n \"text\": \"public void copy(Matrix4f pm) {\\n _11 = pm._11;\\n _12 = pm._12;\\n _13 = pm._13;\\n _14 = pm._14;\\n _21 = pm._21;\\n _22 = pm._22;\\n _23 = pm._23;\\n _24 = pm._24;\\n _31 = pm._31;\\n _32 = pm._32;\\n _33 = pm._33;\\n _34 = pm._34;\\n _41 = pm._41;\\n _42 = pm._42;\\n _43 = pm._43;\\n _44 = pm._44;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd90311c25c212fffb908cfe731db7d4\",\n \"score\": \"0.47395468\",\n \"text\": \"public void updateMatrix(){\\n\\t\\t\\n\\t\\tif (!plane.isDefined()){\\n\\t\\t\\t//force plane matrix for Drawables creation\\n\\t\\t\\tplaneMatrix = CoordMatrix4x4.IDENTITY;\\n\\t\\t\\ttransformedMatrix = CoordMatrix4x4.IDENTITY;\\n\\t\\t\\tinverseTransformedMatrix = CoordMatrix4x4.IDENTITY;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(transform==null) //transform has not already been set\\n\\t\\t\\ttransform = CoordMatrix4x4.IDENTITY;\\n\\t\\t\\n\\t\\t//planeMatrix = plane.getCoordSys().getMatrixOrthonormal();\\t\\n\\t\\tplaneMatrix = plane.getCoordSys().getDrawingMatrix();\\t\\n\\n\\t\\ttransformedMatrix = planeMatrix.mul(transform);//transform.mul(planeMatrix);\\t\\n\\t\\tinverseTransformedMatrix = transformedMatrix.inverse();\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"897f6191f52507ceaa88cff4e9e02c98\",\n \"score\": \"0.47256464\",\n \"text\": \"public static boolean invert(Matrix4f pm, Matrix4f pdest) {\\n\\n float det;\\n float idet;\\n\\n float a11, a12, a13, a14;\\n float a21, a22, a23, a24;\\n float a31, a32, a33, a34;\\n float a41, a42, a43, a44;\\n //\\n // if determinant of matrix is 0, matrix is not regular\\n //\\n det = determinant(pm);\\n if (det == 0)\\n return false;\\n //\\n // build the reciprocal of the determinant\\n //\\n idet = 1.0f / det;\\n //\\n // build the adjuncts\\n //\\n a11 = ((pm._22 * pm._33 * pm._44) + (pm._23 * pm._34 * pm._42) + (pm._24\\n * pm._32 * pm._43))\\n - ((pm._24 * pm._33 * pm._42) + (pm._22 * pm._34 * pm._43) + (pm._23\\n * pm._32 * pm._44));\\n\\n a21 = ((pm._21 * pm._33 * pm._44) + (pm._23 * pm._34 * pm._41) + (pm._24\\n * pm._31 * pm._43))\\n - ((pm._24 * pm._33 * pm._41) + (pm._21 * pm._34 * pm._43) + (pm._23\\n * pm._31 * pm._44));\\n\\n a31 = ((pm._21 * pm._32 * pm._44) + (pm._22 * pm._34 * pm._41) + (pm._24\\n * pm._31 * pm._42))\\n - ((pm._24 * pm._32 * pm._41) + (pm._21 * pm._34 * pm._42) + (pm._22\\n * pm._31 * pm._44));\\n\\n a41 = ((pm._21 * pm._32 * pm._43) + (pm._22 * pm._33 * pm._41) + (pm._23\\n * pm._31 * pm._42))\\n - ((pm._23 * pm._32 * pm._41) + (pm._21 * pm._33 * pm._42) + (pm._22\\n * pm._31 * pm._43));\\n //\\n //\\n a12 = ((pm._12 * pm._33 * pm._44) + (pm._13 * pm._34 * pm._42) + (pm._14\\n * pm._32 * pm._43))\\n - ((pm._14 * pm._33 * pm._42) + (pm._12 * pm._34 * pm._43) + (pm._13\\n * pm._32 * pm._44));\\n\\n a22 = ((pm._11 * pm._33 * pm._44) + (pm._13 * pm._34 * pm._41) + (pm._14\\n * pm._31 * pm._43))\\n - ((pm._14 * pm._33 * pm._41) + (pm._11 * pm._34 * pm._43) + (pm._13\\n * pm._31 * pm._44));\\n\\n a32 = ((pm._11 * pm._32 * pm._44) + (pm._12 * pm._34 * pm._41) + (pm._14\\n * pm._31 * pm._42))\\n - ((pm._14 * pm._32 * pm._41) + (pm._11 * pm._34 * pm._42) + (pm._12\\n * pm._31 * pm._44));\\n\\n a42 = ((pm._11 * pm._32 * pm._43) + (pm._12 * pm._33 * pm._41) + (pm._13\\n * pm._31 * pm._42))\\n - ((pm._13 * pm._32 * pm._41) + (pm._11 * pm._33 * pm._42) + (pm._12\\n * pm._31 * pm._43));\\n //\\n //\\n a13 = ((pm._12 * pm._23 * pm._44) + (pm._13 * pm._24 * pm._42) + (pm._14\\n * pm._22 * pm._43))\\n - ((pm._14 * pm._23 * pm._42) + (pm._12 * pm._24 * pm._43) + (pm._13\\n * pm._22 * pm._44));\\n\\n a23 = ((pm._11 * pm._23 * pm._44) + (pm._13 * pm._24 * pm._41) + (pm._14\\n * pm._21 * pm._43))\\n - ((pm._14 * pm._23 * pm._41) + (pm._11 * pm._24 * pm._43) + (pm._13\\n * pm._21 * pm._44));\\n\\n a33 = ((pm._11 * pm._22 * pm._44) + (pm._12 * pm._24 * pm._41) + (pm._14\\n * pm._21 * pm._42))\\n - ((pm._14 * pm._22 * pm._41) + (pm._11 * pm._24 * pm._42) + (pm._12\\n * pm._21 * pm._44));\\n\\n a43 = ((pm._11 * pm._22 * pm._43) + (pm._12 * pm._23 * pm._41) + (pm._13\\n * pm._21 * pm._42))\\n - ((pm._13 * pm._22 * pm._41) + (pm._11 * pm._23 * pm._42) + (pm._12\\n * pm._21 * pm._43));\\n //\\n //\\n a14 = ((pm._12 * pm._23 * pm._34) + (pm._13 * pm._24 * pm._32) + (pm._14\\n * pm._22 * pm._33))\\n - ((pm._14 * pm._23 * pm._32) + (pm._12 * pm._24 * pm._33) + (pm._13\\n * pm._22 * pm._34));\\n\\n a24 = ((pm._11 * pm._23 * pm._34) + (pm._13 * pm._24 * pm._31) + (pm._14\\n * pm._21 * pm._33))\\n - ((pm._14 * pm._23 * pm._31) + (pm._11 * pm._24 * pm._33) + (pm._13\\n * pm._21 * pm._34));\\n\\n a34 = ((pm._11 * pm._22 * pm._34) + (pm._12 * pm._24 * pm._31) + (pm._14\\n * pm._21 * pm._32))\\n - ((pm._14 * pm._22 * pm._31) + (pm._11 * pm._24 * pm._32) + (pm._12\\n * pm._21 * pm._34));\\n\\n a44 = ((pm._11 * pm._22 * pm._33) + (pm._12 * pm._23 * pm._31) + (pm._13\\n * pm._21 * pm._32))\\n - ((pm._13 * pm._22 * pm._31) + (pm._11 * pm._23 * pm._32) + (pm._12\\n * pm._21 * pm._33));\\n //\\n\\n pdest._11 = (+a11) * idet;\\n pdest._12 = (-a12) * idet;\\n pdest._13 = (+a13) * idet;\\n pdest._14 = (-a14) * idet;\\n //\\n pdest._21 = (-a21) * idet;\\n pdest._22 = (+a22) * idet;\\n pdest._23 = (-a23) * idet;\\n pdest._24 = (+a24) * idet;\\n //\\n pdest._31 = (+a31) * idet;\\n pdest._32 = (-a32) * idet;\\n pdest._33 = (+a33) * idet;\\n pdest._34 = (-a34) * idet;\\n //\\n pdest._41 = (-a41) * idet;\\n pdest._42 = (+a42) * idet;\\n pdest._43 = (-a43) * idet;\\n pdest._44 = (+a44) * idet;\\n\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a2d7ed44a95487e03e6145e308cbbbe7\",\n \"score\": \"0.47250172\",\n \"text\": \"public static void transpose(int m[][]) {\\n\\t int i, o, placeholder;\\n\\t for(i=0; i<m.length; i++){\\n\\t for(o=0; o<i; o++){\\n\\t placeholder = m[i][o];\\n\\t m[i][o] = m[o][i];\\n\\t m[o][i] = placeholder;\\n\\t }\\n\\t }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b99141fea870b0a413c250dd0b67805b\",\n \"score\": \"0.47073343\",\n \"text\": \"@Override\\n\\tpublic SparseM addition(SparseM otherM) {\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed09c46dd6119a32bafef17707f30643\",\n \"score\": \"0.47003865\",\n \"text\": \"public static Matrix MatrixMultiply(Matrix a, Matrix b) \\n {\\n //If both a and b are both normal matrixes, do normal matrix multiplication\\n if(a.columns == b.rows)\\n {\\n //Make new matrix with the same amount of columns as shape B and the same amount of rows as A\\n Matrix newMatrix = new Matrix(a.rows, b.columns);\\n //Multiply the matrices\\n for (int colB = 0; colB < b.columns; colB++)\\n {\\n for(int rowA = 0; rowA < a.rows; rowA++)\\n {\\n double sum = 0.0;\\n for(int colA = 0; colA < a.columns; colA++)\\n {\\n double multiple = (double)a.get(rowA, colA) * (double)b.get(colA, colB);\\n sum += multiple;\\n }\\n newMatrix.set(rowA, colB, sum);\\n }\\n }\\n //Return the new matrix\\n return newMatrix;\\n }\\n return null; \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c328f05a3af61f62d3db26a4aced037\",\n \"score\": \"0.46915585\",\n \"text\": \"private double[] mulMat(double[][] A, double[] B){\\n double[] last = new double[N];\\n for(int i = 0; i < N; ++i) {\\n for (int k = 0; k < N; ++k) {\\n last[i] += A[i][k] * B[k];\\n }\\n }\\n\\n return last;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c701e8cbea1aa8936b20f4c94c20351d\",\n \"score\": \"0.4681323\",\n \"text\": \"Matrix sub(Matrix M) throws RuntimeException {\\n\\n if (getSize() != M.getSize())\\n throw new RuntimeException(\\\"Matrix.java: sub() - matrices are different sizes\\\");\\n\\n Matrix res = M.copy();\\n\\n for (int i = 0; i < rows.length; i++) {\\n List<Entry> a = rows[i];\\n List<Entry> b = res.rows[i];\\n a.moveFront();\\n b.moveFront();\\n for (a.moveTo(0); a.index() != -1; a.moveNext()) {\\n Entry e = a.get();\\n int col = e.column;\\n double diff = e.value;\\n int index = res.getEntryIndex(i + 1, col);\\n if (index != -1) {\\n b.moveTo(index);\\n Entry temp = b.get();\\n\\n if(temp.value < 0)\\n diff = temp.value;\\n else\\n diff -= temp.value;\\n }\\n res.changeEntry(i + 1, col, diff);\\n }\\n \\n }\\n\\n return res;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f916eb914afc71f69e5fd2fb8a063d82\",\n \"score\": \"0.46775138\",\n \"text\": \"public Matrix solve(Matrix rhs) {\\r\\n\\t\\tif (M != N || rhs.M != N || rhs.N != 1)\\r\\n\\t\\t\\tthrow new RuntimeException(\\\"Illegal matrix dimensions:\\\\nM1xN1 = \\\" + M + \\\"x\\\" + N + \\\" and M2xN2 = \\\" + rhs.M + \\\"x\\\" + rhs.N);\\r\\n\\r\\n\\t\\t// create copies of the data\\r\\n\\t\\tMatrix A = new Matrix(this);\\r\\n\\t\\tMatrix b = new Matrix(rhs);\\r\\n\\r\\n\\t\\t// Gaussian elimination with partial pivoting\\r\\n\\t\\tfor (int i = 0; i < N; i++) {\\r\\n\\r\\n\\t\\t\\t// find pivot row and swap\\r\\n\\t\\t\\tint max = i;\\r\\n\\t\\t\\tfor (int j = i + 1; j < N; j++)\\r\\n\\t\\t\\t\\tif (Math.abs(A.data[j][i]) > Math.abs(A.data[max][i]))\\r\\n\\t\\t\\t\\t\\tmax = j;\\r\\n\\t\\t\\tA.swap(i, max);\\r\\n\\t\\t\\tb.swap(i, max);\\r\\n\\r\\n\\t\\t\\t// singular\\r\\n\\t\\t\\tif (A.data[i][i] == 0.0) throw new RuntimeException(\\\"Matrix is singular.\\\");\\r\\n\\r\\n\\t\\t\\t// pivot within b\\r\\n\\t\\t\\tfor (int j = i + 1; j < N; j++)\\r\\n\\t\\t\\t\\tb.data[j][0] -= b.data[i][0] * A.data[j][i] / A.data[i][i];\\r\\n\\r\\n\\t\\t\\t// pivot within A\\r\\n\\t\\t\\tfor (int j = i + 1; j < N; j++) {\\r\\n\\t\\t\\t\\tdouble m = A.data[j][i] / A.data[i][i];\\r\\n\\t\\t\\t\\tfor (int k = i+1; k < N; k++) {\\r\\n\\t\\t\\t\\t\\tA.data[j][k] -= A.data[i][k] * m;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tA.data[j][i] = 0.0;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// back substitution\\r\\n\\t\\tMatrix x = new Matrix(N, 1);\\r\\n\\t\\tfor (int j = N - 1; j >= 0; j--) {\\r\\n\\t\\t\\tdouble t = 0.0;\\r\\n\\t\\t\\tfor (int k = j + 1; k < N; k++)\\r\\n\\t\\t\\t\\tt += A.data[j][k] * x.data[k][0];\\r\\n\\t\\t\\tx.data[j][0] = (b.data[j][0] - t) / A.data[j][j];\\r\\n\\t\\t}\\r\\n\\t\\treturn x;\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c06dfcbd25176cc6eead85d702e3275d\",\n \"score\": \"0.46772483\",\n \"text\": \"public void setProductionMatrix(Matrix m){\\n alphaProductionMatrix = m;\\n betaProductionMatrix = compress.getCompressedMatrix(m,\\\"SUM\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0decce20ea9e76453accb86e7189e52d\",\n \"score\": \"0.46701\",\n \"text\": \"public static void TulisMatrix(Matrix M) {\\n for (int i = NBrsMin; i < M.nbrs; i++) {\\n for (int j = NKolMin; j < M.nkol; j++) {\\n if (j == M.nkol - 1) {\\n System.out.println(M.data[i][j]+\\\"\\\\n\\\");\\n } \\n else {\\n System.out.print(M.data[i][j]+\\\" \\\");\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b56028d5a6091ee8905c853a094d4f4e\",\n \"score\": \"0.46616292\",\n \"text\": \"public static void mult(Xform result, Xform op1, Xform op2)\\r\\n {\\n \\r\\n result.matrix[0 * 4 + 0] = \\r\\n op1.matrix[0 * 4 + 0] * op2.matrix[0 * 4 + 0] +\\r\\n op1.matrix[0 * 4 + 1] * op2.matrix[1 * 4 + 0] +\\r\\n op1.matrix[0 * 4 + 2] * op2.matrix[2 * 4 + 0] +\\r\\n op1.matrix[0 * 4 + 3] * op2.matrix[3 * 4 + 0];\\r\\n \\r\\n result.matrix[0 * 4 + 1] = \\r\\n op1.matrix[0 * 4 + 0] * op2.matrix[0 * 4 + 1] +\\r\\n op1.matrix[0 * 4 + 1] * op2.matrix[1 * 4 + 1] +\\r\\n op1.matrix[0 * 4 + 2] * op2.matrix[2 * 4 + 1] +\\r\\n op1.matrix[0 * 4 + 3] * op2.matrix[3 * 4 + 1];\\r\\n \\r\\n result.matrix[0 * 4 + 2] = \\r\\n op1.matrix[0 * 4 + 0] * op2.matrix[0 * 4 + 2] +\\r\\n op1.matrix[0 * 4 + 1] * op2.matrix[1 * 4 + 2] +\\r\\n op1.matrix[0 * 4 + 2] * op2.matrix[2 * 4 + 2] +\\r\\n op1.matrix[0 * 4 + 3] * op2.matrix[3 * 4 + 2];\\r\\n \\r\\n result.matrix[0 * 4 + 3] = \\r\\n op1.matrix[0 * 4 + 0] * op2.matrix[0 * 4 + 3] +\\r\\n op1.matrix[0 * 4 + 1] * op2.matrix[1 * 4 + 3] +\\r\\n op1.matrix[0 * 4 + 2] * op2.matrix[2 * 4 + 3] +\\r\\n op1.matrix[0 * 4 + 3] * op2.matrix[3 * 4 + 3];\\r\\n \\r\\n \\r\\n result.matrix[1 * 4 + 0] = \\r\\n op1.matrix[1 * 4 + 0] * op2.matrix[0 * 4 + 0] +\\r\\n op1.matrix[1 * 4 + 1] * op2.matrix[1 * 4 + 0] +\\r\\n op1.matrix[1 * 4 + 2] * op2.matrix[2 * 4 + 0] +\\r\\n op1.matrix[1 * 4 + 3] * op2.matrix[3 * 4 + 0];\\r\\n \\r\\n result.matrix[1 * 4 + 1] = \\r\\n op1.matrix[1 * 4 + 0] * op2.matrix[0 * 4 + 1] +\\r\\n op1.matrix[1 * 4 + 1] * op2.matrix[1 * 4 + 1] +\\r\\n op1.matrix[1 * 4 + 2] * op2.matrix[2 * 4 + 1] +\\r\\n op1.matrix[1 * 4 + 3] * op2.matrix[3 * 4 + 1];\\r\\n \\r\\n result.matrix[1 * 4 + 2] = \\r\\n op1.matrix[1 * 4 + 0] * op2.matrix[0 * 4 + 2] +\\r\\n op1.matrix[1 * 4 + 1] * op2.matrix[1 * 4 + 2] +\\r\\n op1.matrix[1 * 4 + 2] * op2.matrix[2 * 4 + 2] +\\r\\n op1.matrix[1 * 4 + 3] * op2.matrix[3 * 4 + 2];\\r\\n \\r\\n result.matrix[1 * 4 + 3] = \\r\\n op1.matrix[1 * 4 + 0] * op2.matrix[0 * 4 + 3] +\\r\\n op1.matrix[1 * 4 + 1] * op2.matrix[1 * 4 + 3] +\\r\\n op1.matrix[1 * 4 + 2] * op2.matrix[2 * 4 + 3] +\\r\\n op1.matrix[1 * 4 + 3] * op2.matrix[3 * 4 + 3];\\r\\n \\r\\n \\r\\n result.matrix[2 * 4 + 0] = \\r\\n op1.matrix[2 * 4 + 0] * op2.matrix[0 * 4 + 0] +\\r\\n op1.matrix[2 * 4 + 1] * op2.matrix[1 * 4 + 0] +\\r\\n op1.matrix[2 * 4 + 2] * op2.matrix[2 * 4 + 0] +\\r\\n op1.matrix[2 * 4 + 3] * op2.matrix[3 * 4 + 0];\\r\\n \\r\\n result.matrix[2 * 4 + 1] = \\r\\n op1.matrix[2 * 4 + 0] * op2.matrix[0 * 4 + 1] +\\r\\n op1.matrix[2 * 4 + 1] * op2.matrix[1 * 4 + 1] +\\r\\n op1.matrix[2 * 4 + 2] * op2.matrix[2 * 4 + 1] +\\r\\n op1.matrix[2 * 4 + 3] * op2.matrix[3 * 4 + 1];\\r\\n \\r\\n result.matrix[2 * 4 + 2] = \\r\\n op1.matrix[2 * 4 + 0] * op2.matrix[0 * 4 + 2] +\\r\\n op1.matrix[2 * 4 + 1] * op2.matrix[1 * 4 + 2] +\\r\\n op1.matrix[2 * 4 + 2] * op2.matrix[2 * 4 + 2] +\\r\\n op1.matrix[2 * 4 + 3] * op2.matrix[3 * 4 + 2];\\r\\n \\r\\n result.matrix[2 * 4 + 3] = \\r\\n op1.matrix[2 * 4 + 0] * op2.matrix[0 * 4 + 3] +\\r\\n op1.matrix[2 * 4 + 1] * op2.matrix[1 * 4 + 3] +\\r\\n op1.matrix[2 * 4 + 2] * op2.matrix[2 * 4 + 3] +\\r\\n op1.matrix[2 * 4 + 3] * op2.matrix[3 * 4 + 3];\\r\\n \\r\\n \\r\\n result.matrix[3 * 4 + 0] = \\r\\n op1.matrix[3 * 4 + 0] * op2.matrix[0 * 4 + 0] +\\r\\n op1.matrix[3 * 4 + 1] * op2.matrix[1 * 4 + 0] +\\r\\n op1.matrix[3 * 4 + 2] * op2.matrix[2 * 4 + 0] +\\r\\n op1.matrix[3 * 4 + 3] * op2.matrix[3 * 4 + 0];\\r\\n \\r\\n result.matrix[3 * 4 + 1] = \\r\\n op1.matrix[3 * 4 + 0] * op2.matrix[0 * 4 + 1] +\\r\\n op1.matrix[3 * 4 + 1] * op2.matrix[1 * 4 + 1] +\\r\\n op1.matrix[3 * 4 + 2] * op2.matrix[2 * 4 + 1] +\\r\\n op1.matrix[3 * 4 + 3] * op2.matrix[3 * 4 + 1];\\r\\n \\r\\n result.matrix[3 * 4 + 2] = \\r\\n op1.matrix[3 * 4 + 0] * op2.matrix[0 * 4 + 2] +\\r\\n op1.matrix[3 * 4 + 1] * op2.matrix[1 * 4 + 2] +\\r\\n op1.matrix[3 * 4 + 2] * op2.matrix[2 * 4 + 2] +\\r\\n op1.matrix[3 * 4 + 3] * op2.matrix[3 * 4 + 2];\\r\\n \\r\\n result.matrix[3 * 4 + 3] = \\r\\n op1.matrix[3 * 4 + 0] * op2.matrix[0 * 4 + 3] +\\r\\n op1.matrix[3 * 4 + 1] * op2.matrix[1 * 4 + 3] +\\r\\n op1.matrix[3 * 4 + 2] * op2.matrix[2 * 4 + 3] +\\r\\n op1.matrix[3 * 4 + 3] * op2.matrix[3 * 4 + 3];\\r\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d26d6a3135049d8ff3b55c4ffa7b1739\",\n \"score\": \"0.4642076\",\n \"text\": \"public Matrix plus(Matrix B) {\\r\\n\\t\\tMatrix A = this;\\r\\n\\t\\tif (B.M != A.M || B.N != A.N) throw new RuntimeException(\\\"Illegal matrix dimensions.\\\");\\r\\n\\t\\tMatrix C = new Matrix(M, N);\\r\\n\\t\\tfor (int i = 0; i < M; i++)\\r\\n\\t\\t\\tfor (int j = 0; j < N; j++)\\r\\n\\t\\t\\t\\tC.data[i][j] = A.data[i][j] + B.data[i][j];\\r\\n\\t\\treturn C;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d213a2d029a58980e1771de904093e6\",\n \"score\": \"0.46419102\",\n \"text\": \"public ooMatrix multiply(ooMatrix second){\\n\\t\\tooMatrix result = new ooMatrix(this.row, this.column);\\n\\t\\tfor(int i=0; i<this.row; i++){\\n\\t\\t\\tfor(int j=0; j<this.column; j++){\\n\\t\\t\\t\\tint sum = 0;\\n\\t\\t\\t\\tfor(int k=0; k<this.column; k++){\\n\\t\\t\\t\\t\\tsum += this.data[i][k] * second.data[k][j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tresult.data[i][j] = sum;\\n\\t\\t\\t}\\n\\t\\t}\\n\\treturn result;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b4a7c5236140697281721842126bbff7\",\n \"score\": \"0.4635606\",\n \"text\": \"public ObjectMatrix2D assign(ObjectMatrix2D source) {\\n\\t// overriden for performance only\\n\\tif (! (source instanceof DenseObjectMatrix2D)) {\\n\\t\\treturn super.assign(source);\\n\\t}\\n\\tDenseObjectMatrix2D other = (DenseObjectMatrix2D) source;\\n\\tif (other==this) return this; // nothing to do\\n\\tcheckShape(other);\\n\\t\\n\\tif (this.isNoView && other.isNoView) { // quickest\\n\\t\\tSystem.arraycopy(other.elements, 0, this.elements, 0, this.elements.length);\\n\\t\\treturn this;\\n\\t}\\n\\t\\n\\tif (haveSharedCells(other)) {\\n\\t\\tObjectMatrix2D c = other.copy();\\n\\t\\tif (! (c instanceof DenseObjectMatrix2D)) { // should not happen\\n\\t\\t\\treturn super.assign(other);\\n\\t\\t}\\n\\t\\tother = (DenseObjectMatrix2D) c;\\n\\t}\\n\\t\\n\\tfinal Object[] elems = this.elements;\\n\\tfinal Object[] otherElems = other.elements;\\n\\tif (elements==null || otherElems==null) throw new InternalError();\\n\\tint cs = this.columnStride;\\n\\tint ocs = other.columnStride;\\n\\tint rs = this.rowStride;\\n\\tint ors = other.rowStride;\\n\\n\\tint otherIndex = other.index(0,0);\\n\\tint index = index(0,0);\\n\\tfor (int row=rows; --row >= 0; ) {\\n\\t\\tfor (int i=index, j=otherIndex, column=columns; --column >= 0; ) {\\n\\t\\t\\telems[i] = otherElems[j];\\n\\t\\t\\ti += cs;\\n\\t\\t\\tj += ocs;\\n\\t\\t}\\n\\t\\tindex += rs;\\n\\t\\totherIndex += ors;\\n\\t}\\n\\treturn this;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb6a5e233ded25307a88829a8ce71dc3\",\n \"score\": \"0.4630829\",\n \"text\": \"Matrix copy() {\\n Matrix res = new Matrix(size);\\n for (int i = 0; i < size; i++) {\\n List<Entry> list = rows[i];\\n for (list.moveTo(0); list.index() != -1; list.moveNext()) {\\n Entry entry = list.get();\\n // System.out.println(\\\"Append\\\");\\n res.rows[i].append(entry);\\n res.nnz++;\\n }\\n }\\n res.nnz = getNNZ();\\n return res;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e830de119b1c6e4de2266a3a663d6add\",\n \"score\": \"0.46290135\",\n \"text\": \"public void combineUp() {\\r\\n\\t\\tfor(int c=0; c<board.length; c++) {\\r\\n\\t\\t\\tint[]col = getCol(board,c);\\r\\n\\t\\t\\tfor(int r = 0; r<board.length-1; r++) {\\r\\n\\t\\t\\t\\t\\tfor(int i=r+1; i<board[0].length; i++) {\\r\\n\\t\\t\\t\\tif(col[r]==col[i]&&Math.abs(i-c)==1) {\\r\\n\\t\\t\\t\\t\\tcol[r] += col[i];\\r\\n\\t\\t\\t\\t\\tcol[i] = 0;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t\\tfor(int r =0; r<board.length;r++){\\r\\n\\t\\t\\t\\tboard[r][c] = col[r];\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c4f161b1932bdecf4edb17884437387\",\n \"score\": \"0.46186772\",\n \"text\": \"public static Matrix33 matrixMultiply(Matrix33 m1, Matrix33 m2) {\\n return new Matrix33(m1.xx*m2.xx + m1.xy*m2.yx + m1.xz*m2.zx,\\n m1.xx*m2.xy + m1.xy*m2.yy + m1.xz*m2.zy,\\n m1.xx*m2.xz + m1.xy*m2.yz + m1.xz*m2.zz,\\n m1.yx*m2.xx + m1.yy*m2.yx + m1.yz*m2.zx,\\n m1.yx*m2.xy + m1.yy*m2.yy + m1.yz*m2.zy,\\n m1.yx*m2.xz + m1.yy*m2.yz + m1.yz*m2.zz,\\n m1.zx*m2.xx + m1.zy*m2.yx + m1.zz*m2.zx,\\n m1.zx*m2.xy + m1.zy*m2.yy + m1.zz*m2.zy,\\n m1.zx*m2.xz + m1.zy*m2.yz + m1.zz*m2.zz);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d03d882adb7e603d4e4f31843b0bb2fe\",\n \"score\": \"0.46158051\",\n \"text\": \"public void applyTransform(Matrix m) {\\n for (int i = 0; i < nPoints(); i++) {\\n Point v = new Point(getPoint(i));\\n v.apply(m);\\n setPoint(i, v);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cf4a38120b1dc96da236166e975554a6\",\n \"score\": \"0.4613035\",\n \"text\": \"private void transpose(char[][] matrix) {\\n int start = 1;\\n for (int x = 0; x < matrix.length-1; x++){\\n for (int y = start; y < matrix[x].length; y++){\\n char tmp = matrix[x][y];\\n matrix[x][y] = matrix[y][x];\\n matrix[y][x] = tmp;\\n }\\n start++;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f0513e15a4e70895f1ad177dff678bb\",\n \"score\": \"0.4612895\",\n \"text\": \"public Matrix solve(Matrix rhs) {\\n if (M != N || rhs.M != N || rhs.N != 1)\\n throw new RuntimeException(\\\"Illegal matrix dimensions.\\\");\\n\\n // create copies of the data\\n Matrix A = new Matrix(this);\\n Matrix b = new Matrix(rhs);\\n\\n // Gaussian elimination with partial pivoting\\n for (int i = 0; i < N; i++) {\\n\\n // find pivot row and swap\\n int max = i;\\n for (int j = i + 1; j < N; j++)\\n if (Math.abs(A.data[j][i]) > Math.abs(A.data[max][i]))\\n max = j;\\n A.swap(i, max);\\n b.swap(i, max);\\n\\n // singular\\n if (A.data[i][i] == 0.0) throw new RuntimeException(\\\"Matrix is singular.\\\");\\n\\n // pivot within b\\n for (int j = i + 1; j < N; j++)\\n b.data[j][0] -= b.data[i][0] * A.data[j][i] / A.data[i][i];\\n\\n // pivot within A\\n for (int j = i + 1; j < N; j++) {\\n double m = A.data[j][i] / A.data[i][i];\\n for (int k = i+1; k < N; k++) {\\n A.data[j][k] -= A.data[i][k] * m;\\n }\\n A.data[j][i] = 0.0;\\n }\\n }\\n\\n // back substitution\\n Matrix x = new Matrix(N, 1);\\n for (int j = N - 1; j >= 0; j--) {\\n double t = 0.0;\\n for (int k = j + 1; k < N; k++)\\n t += A.data[j][k] * x.data[k][0];\\n x.data[j][0] = (b.data[j][0] - t) / A.data[j][j];\\n }\\n return x;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b6867ae00802c351fd08b831bc08ef63\",\n \"score\": \"0.4596329\",\n \"text\": \"public Matrix plus(Matrix B) {\\n Matrix A = this;\\n if (B.M != A.M || B.N != A.N) throw new RuntimeException(\\\"Illegal matrix dimensions.\\\");\\n Matrix C = new Matrix(M, N);\\n for (int i = 0; i < M; i++)\\n for (int j = 0; j < N; j++)\\n C.data[i][j] = A.data[i][j] + B.data[i][j];\\n return C;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b3e436856ffd03ba0fc67baa77813d26\",\n \"score\": \"0.45901176\",\n \"text\": \"public static void inflate() {\\n double[] sum = new double[dimensions];\\n /* multiplication of two matrices of the same size can be defined by multiplying the corresponding entries \\n and this is known as the Hadamard product.*/\\n for (int j = 0; j < dimensions; j++) {\\n for (int i = 0; i < dimensions; i++) {\\n sum[j] += Math.pow(transMatrix.get(i).c[j], inflate);\\n }\\n }\\n for (int j = 0; j < dimensions; j++) {\\n for (int i = 0; i < dimensions; i++) {\\n transMatrix.get(i).c[j] = Math.pow(transMatrix.get(i).c[j], inflate) / sum[j];\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a8404af6632d754efcd4741d912816e\",\n \"score\": \"0.4589601\",\n \"text\": \"public void remove(int index){\\n\\t\\tbyte[][] newmatrix = new byte[matrix.length-1][matrix.length-1];//create new matrix that is smaller by one\\n\\t\\tfor(int i = 0; i < index; i++){\\n\\t\\t\\tfor(int j = 0; j < index; j++){\\n\\t\\t\\t\\tnewmatrix[i][j] = matrix[i][j];\\n\\t\\t\\t}\\n\\t\\t\\tfor(int j = index +1; j < matrix.length; j++){\\n\\t\\t\\t\\tnewmatrix[i][j-1] = matrix[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i = index +1; i < matrix.length; i++){\\n\\t\\t\\tfor(int j = 0; j < index; j++){\\n\\t\\t\\t\\tnewmatrix[i-1][j] = matrix[i][j];\\n\\t\\t\\t}\\n\\t\\t\\tfor(int j = index +1; j < matrix.length; j++){\\n\\t\\t\\t\\tnewmatrix[i-1][j-1] = matrix[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmatrix = newmatrix;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"316a3263533e512ffd26257d70a5c665\",\n \"score\": \"0.4587354\",\n \"text\": \"private static int[][] transpose(int[][] matrix) {\\n int row=matrix.length;\\n int col=matrix[0].length;\\n\\n for (int i = 0; i < matrix.length; i++) {\\n for (int j = i; j < matrix[0].length; j++) {\\n int temp=matrix[i][j];\\n matrix[i][j]=matrix[j][i];\\n matrix[j][i]=temp;\\n }\\n }\\n return matrix;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f9557e9fc979169417aa112648ccfdaf\",\n \"score\": \"0.45870134\",\n \"text\": \"void dgemm(TransposeType transA, TransposeType transB, int m, int n, int k, double alpha, double[] matA, int offsetA, int ldA, double[] matB, int offsetB, int ldB, double beta, double[] matC, int offsetC, int ldC);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1f7bdccbefa7cfbd6ab9cc8e3427946\",\n \"score\": \"0.45838457\",\n \"text\": \"public void updateMatrix(boolean deep) {\\n\\t\\tMat4 parentMatrix = (parent == null) ? new Mat4(1.0f) : parent.matrix;\\r\\n\\r\\n\\t\\t// Redoslijed operacija u ovom sistemu. Moze da bude i drugaciji,\\r\\n\\t\\t// zavisno\\r\\n\\t\\t// potreba aplikacije koju pravimo.\\r\\n\\r\\n\\t\\tMat4 mat = new Mat4(parentMatrix);\\r\\n\\t\\tmat = mat.translate(position);\\r\\n\\r\\n\\t\\tmat = mat.scale(scale);\\r\\n\\r\\n\\t\\tmat = mat.multiply(Matrices.rotate(yaw, new Vec3(0.0f, 1.0f, 0.0f)));\\r\\n\\t\\tmat = mat.multiply(Matrices.rotate(pitch, new Vec3(1.0f, 0.0f, 0.0f)));\\r\\n\\t\\tmat = mat.multiply(Matrices.rotate(roll, new Vec3(0.0f, 0.0f, -1.0f)));\\r\\n\\r\\n\\t\\tmatrix = mat;\\r\\n\\t\\tmatrix.store(matBuffModel);\\r\\n\\t\\tmatBuffModel.flip();\\r\\n\\r\\n\\t\\t// Vektore orijentacije ponovo dobijamo transformisanjem jedinicnih\\r\\n\\t\\t// vektora\\r\\n\\t\\t// Vec4 forward4 = new Vec4(0.0f, 0.0f, -1.0f, 0.0f).multiplyTP(matrix);\\r\\n\\t\\t// Vec4 up4 = new Vec4(0.0f, 1.0f, 0.0f, 0.0f).multiplyTP(matrix);\\r\\n\\t\\t// Vec4 right4 = new Vec4(1.0f, 0.0f, 0.0f, 0.0f).multiplyTP(matrix);\\r\\n\\r\\n\\t\\t// up = new Vec3(up4.x, up4.y, up4.z);\\r\\n\\t\\t// right = new Vec3(right4.x, right4.y, right4.z);\\r\\n\\t\\t// forward = new Vec3(forward4.x, forward4.y, forward4.z);\\r\\n\\r\\n\\t\\t// Deep znaci rekurzivno azuriranje i svih child objekata\\r\\n\\t\\tif (deep) {\\r\\n\\t\\t\\tfor (GameObject child : children)\\r\\n\\t\\t\\t\\tchild.updateMatrix(true);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28fd513df9cc2ff74ede1833b252abda\",\n \"score\": \"0.45777178\",\n \"text\": \"public abstract void writeMatrix();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5f0188d54198bc3c790e16c8f4e6f46\",\n \"score\": \"0.45692974\",\n \"text\": \"public static void rotate(int[][] matrix) {\\n int len = matrix.length;\\n for(int i = 0; i != len/2; i ++){\\n for(int j = i; j != len -i-1 ; j ++){\\n int temp = matrix[i][j];\\n matrix[i][j] = matrix[len-j-1][i];\\n matrix[len-j-1][i] = matrix[len-i-1][len-j-1];\\n matrix[len-i-1][len-j-1] = matrix[j][len-i-1];\\n matrix[j][len-i-1] = temp;\\n }\\n }\\n for(int i = 0; i < len; i ++) {\\n for (int j = 0; j < len; j++)\\n System.out.print(matrix[i][j]);\\n System.out.println(\\\"\\\");\\n }\\n return;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d90fc4a577c1aa8805f8a44fc9b0a7da\",\n \"score\": \"0.45686042\",\n \"text\": \"public static void main(String[] args) {\\n\\n\\t\\tint a[][] = new int[3][3];\\n\\t\\tint m[][] = new int[3][3];\\n\\t\\tint i,j,n;\\n\\t\\t\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"Enter elments in matrix: \\\");\\n\\t\\t\\n\\t\\tScanner sc = new Scanner(System.in);\\n\\t\\t\\n\\t\\tfor(i=0;i<3;i++)\\n\\t\\t{\\n\\t\\t\\tfor(j=0;j<3;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tSystem.out.println(\\\"Enter elements in [\\\"+i+\\\"]\\\"+\\\"[\\\"+j+\\\"] :\\\");\\n\\t\\t\\t\\ta[i][j] = sc.nextInt();\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"Matrix is : \\\");\\n\\t\\t\\n\\t\\tfor(i=0;i<3;i++)\\n\\t\\t{\\n\\t\\t\\tfor(j=0;j<3;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tSystem.out.print(a[i][j]+\\\" \\\");\\n\\t\\t\\t\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\tSystem.out.println();\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor(i=0;i<3;i++)\\n\\t\\t{\\n\\t\\t\\tn=3-1;\\n\\t\\t\\tfor(j=0;j<3;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tm[i][j] = m[i][j]+a[i][n];\\n\\t\\t\\t\\tn--;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"Mirror Matrix is : \\\");\\n\\t\\t\\n\\t\\tfor(i=0;i<3;i++)\\n\\t\\t{\\n\\t\\t\\tfor(j=0;j<3;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tSystem.out.print(m[i][j]+\\\" \\\");\\n\\t\\t\\t\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\tSystem.out.println();\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54d9781321e358094f662846db1868d6\",\n \"score\": \"0.4565218\",\n \"text\": \"public static double [][] transposeMatrix(double [][] m){\\n\\t\\tdouble [][] m2 = new double[m[0].length][m.length];\\n\\t\\t\\n\\t\\tfor(int i = 0; i < m.length; i++){\\n\\t\\t\\tfor(int j = 0; j < m[i].length; j++){\\n\\t\\t\\t\\tm2[j][i] = m[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn m2;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"948a5a5ac34801084415593bf9022c65\",\n \"score\": \"0.4562813\",\n \"text\": \"private void addToMatracies(DoubleMatrix inputExample, DoubleMatrix outputExample)\\n\\t{\\n\\t\\tif (X == null)\\n\\t\\t{\\n\\t\\t\\tX = new DoubleMatrix(inputExample.toArray()); \\n\\t\\t\\tY = new DoubleMatrix(outputExample.toArray());\\n\\t\\t}\\n\\t\\telse if (X.getColumns() == NNL_width*NNL_height && Y.getColumns() == NN_L.getTopology()[NN_L.getTopology().length-1] )\\n\\t\\t{\\n\\t\\t\\tX = DoubleMatrix.concatVertically(X,inputExample);\\n\\t\\t\\tY = DoubleMatrix.concatVertically(Y, outputExample);\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tif (debug)\\n\\t\\t\\t{\\n\\t\\t\\t\\tSystem.out.println(\\\"ERROR IN addToMatracies: sizes of X or sizes of Y are not correct.\\\");\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43d1bb92043a01cff6af08a0c422b7a2\",\n \"score\": \"0.45612493\",\n \"text\": \"public void resetModelMatrices() {\\n\\t\\toldModelMat.identity();\\n\\t\\tmodelMat.identity();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc9b7942cc8e6b03ae1dd31505e8e0e9\",\n \"score\": \"0.455234\",\n \"text\": \"private static Matrix relu(Matrix input) {\\n for(int row = 0; row < input.getRowDimension(); row++) {\\n for(int column = 0; column < input.getColumnDimension(); column++) {\\n if(input.get(row, column) < 0) input.set(row, column, 0);\\n }\\n }\\n return input;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa9fee27d6ef6a2b8059012d1631f2c9\",\n \"score\": \"0.45498762\",\n \"text\": \"Matrix transpose() {\\n\\n Matrix res = new Matrix(size);\\n\\n for (int i = 0; i < size; i++) {\\n List<Entry> a = rows[i];\\n for (a.moveTo(0); a.index() != -1; a.moveNext()) {\\n Entry e = a.get();\\n int currCol = e.column;\\n res.changeEntry(currCol, i + 1, e.value);\\n }\\n }\\n return res;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6126dd414eea48594e0921992a2eaae\",\n \"score\": \"0.4540723\",\n \"text\": \"public void rotate(int[][] matrix) {\\n if(matrix==null || matrix.length<=1)\\n return;\\n int N = matrix.length;\\n int[][] res = new int[N][N];\\n for(int i=0; i<N; i++){\\n for(int j=0; j<N; j++)\\n res[j][N-1-i] = matrix[i][j];\\n }\\n for(int i=0;i<N;i++){\\n for(int j=0; j<N; j++)\\n matrix[i][j] = res[i][j];\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c43e0caee04a72845617e640a6e824f\",\n \"score\": \"0.45404488\",\n \"text\": \"public void cal()\\n\\t{\\t\\t\\n\\t\\tr=ROW;\\n\\t\\tfor(i=0,k=r;i<ROW;i++,k--)\\n\\t\\t{\\n\\t\\t\\tn=1;\\t\\t\\t\\t\\n\\t\\t\\tfor(j=i+1,l=r;j<r;j++,l--)\\n\\t\\t\\t{\\n\\t\\t\\t\\tmat[i][j]=mat[i][j-1]; // Column right\\n\\t\\t\\t\\tmat[j][i]=mat[i][j-1]; // Row Down\\t\\t\\t\\t\\n\\t\\t\\t\\tmat[l-1][k-1]=mat[r-n][r-n]; // Row Up\\n\\t\\t\\t\\tmat[k-1][l-1]=mat[r-n][r-n]; // Column left\\t\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\tn++;\\n\\t\\t\\tr--;\\t\\t\\t\\t\\n\\t\\t}\\t\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39c43495ec012d723628464b260d000e\",\n \"score\": \"0.4540012\",\n \"text\": \"public void rotate(int[][] matrix) {\\n int n = matrix.length;\\n for(int r = 0; r < n / 2; r++)\\n for(int c = r; c < n - 1 - r; c++){\\n int tmp = matrix[n - 1 - c][r];\\n matrix[n - 1 - c][r] = matrix[n - 1 - r][n - 1 - c];\\n matrix[n - 1 - r][n - 1 - c] = matrix[c][n - 1- r];\\n matrix[c][n - 1 - r] = matrix[r][c];\\n matrix[r][c] = tmp;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7e511f0bef2b9361a7d645e0416f6a8\",\n \"score\": \"0.45314455\",\n \"text\": \"public void rotate(int[][] matrix) {\\n int n = matrix.length;\\n for(int i=0; i<(n/2); i++){\\n for(int j=0; j<((n+1)/2); j++){\\n int tmp = matrix[i][j];\\n matrix[i][j]=matrix[n-1-j][i];\\n matrix[n-1-j][i]=matrix[n-1-i][n-1-j];\\n matrix[n-1-i][n-1-j]=matrix[j][n-1-i];\\n matrix[j][n-1-i]=tmp;\\n }\\n }\\n return;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5585fda7c26eaf228c188892dde3d1a\",\n \"score\": \"0.45291525\",\n \"text\": \"private void copiarMatriz(int [][]argNew,int [][]argCopy){\\r\\n //Parámetros nuevo arreglo (vacio),arreglo con los datos a copiar\\r\\n for (int i = 0; i < argCopy.length; i++) {\\r\\n for (int j = 0; j < argCopy.length; j++) {\\r\\n argNew[i][j]=argCopy[i][j];\\r\\n }\\r\\n }\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ad5cc63c54a98ae6ea0ef61a756abd9\",\n \"score\": \"0.4525711\",\n \"text\": \"public Matrix add(Matrix m) {\\n if (numCols() != m.numCols() || numRows() != m.numRows()) {\\n return null;\\n }\\n Matrix c = new Matrix(numRows(), numCols());\\n for (int i=0; i<numRows(); i++) {\\n for (int j=0; j<numCols(); j++) {\\n c.setValue(i, j, get(i, j) + m.get(i, j));\\n }\\n }\\n return c;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc6db080982f902e7d04f554fdea8466\",\n \"score\": \"0.4519805\",\n \"text\": \"public static Matrix multiply(Matrix A, Matrix B) {\\n\\n\\t\\tif (A.col != B.row) \\n\\t\\t\\tthrow new RuntimeException(\\\"Illegal matrix dimensions.\\\");\\n\\t\\t\\n\\t\\tMatrix C = new Matrix(A.row, B.col); \\n for (int i = 0; i < C.row; i++)\\n for (int j = 0; j < C.col; j++)\\n for (int k = 0; k < A.col; k++)\\n C.data[i][j] += (A.data[i][k] * B.data[k][j]);\\n return C;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9b1070d675c24cb7edad6256035fef6\",\n \"score\": \"0.4513649\",\n \"text\": \"public Matrix add(Matrix B){\\n\\t\\tassert n == B.n && m == B.m;\\n\\t\\tMatrix C = new Matrix(m,n);\\n\\t\\tfor(int i = 0; i < m; i++){\\n\\t\\t\\tfor(int j = 0; j < n; j++){\\n\\t\\t\\t\\tC.set(i,j,this.get(i,j)+B.get(i,j));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn C;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed2f92df8e304d8a930ec8c675b9d79f\",\n \"score\": \"0.45106044\",\n \"text\": \"public static void normalise() {\\n double csum;\\n for (int j = 0; j < dimensions; j++) {\\n csum = 0;\\n for (int k = 0; k < dimensions; k++) {\\n csum = csum + transMatrix.get(k).c[j];\\n }\\n for (int i = 0; i < dimensions; i++) {\\n transMatrix.get(i).c[j] = transMatrix.get(i).c[j] / csum;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c51dcc8581b4f62658d978792a5bf9ec\",\n \"score\": \"0.45098534\",\n \"text\": \"public void getMvpMatrix(float[] matrix, int offset) { System.arraycopy(this.mMvpMatrix, 0, matrix, offset, this.mMvpMatrix.length); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ee270b81b495d776aa28327f6866dcb\",\n \"score\": \"0.4506049\",\n \"text\": \"public int[][] updateMatrix(int[][] m) {\\n int row = m.length, col = m[0].length;\\n boolean[][] vis = new boolean[row][col];\\n for(int i = 0; i < row; i++){\\n for(int j = 0; j < col; j++){\\n if(m[i][j] != 0) m[i][j] = distance(m, i, j, vis);\\n }\\n }\\n return m;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd15c86174437ab96596ac633e16a228\",\n \"score\": \"0.4500451\",\n \"text\": \"public Matrix(double[][] mtrx){\\n\\t\\tm = mtrx.length;\\n\\t\\tn = mtrx[0].length;\\n\\t\\tA = new double[m][n];\\n\\t\\tfor(int i = 0; i < mtrx.length; i++){\\n\\t\\t\\tfor(int j = 0; j < mtrx[0].length; j++){\\n\\t\\t\\t\\tA[i][j] = mtrx[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983798,"cells":{"query_id":{"kind":"string","value":"25197b4cf814864ecd440f23b9149cb3"},"query":{"kind":"string","value":"TODO Autogenerated method stub"},"positive_passages":{"kind":"list like","value":[{"docid":"558b3ff80d653f40039b2dfdddd1f7cf","score":"0.0","text":"@Override\n\tpublic Sence save(Sence t) {\n\t\treturn null;\n\t}","title":""}],"string":"[\n {\n \"docid\": \"558b3ff80d653f40039b2dfdddd1f7cf\",\n \"score\": \"0.0\",\n \"text\": \"@Override\\n\\tpublic Sence save(Sence t) {\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"d7194e467f51e022c107531d8614b6a3","score":"0.6905833","text":"@Override\r\n\tpublic void anular() {\n\t\t\r\n\t}","title":""},{"docid":"941cb2826e3c700358fcaba402e6bb01","score":"0.66775143","text":"@Override\r\n\tpublic void hissetmek() {\n\r\n\t}","title":""},{"docid":"63918b2e510c9040bbddcac00095b41a","score":"0.6605982","text":"private void recuperation() {\n\t\t\n\t}","title":""},{"docid":"0b5b11f4251ace8b3d0f5ead186f7beb","score":"0.65677965","text":"@Override\n\tpublic void comer() {\n\t\t\n\t}","title":""},{"docid":"6a98c5d2724fce37914819c5694da3c3","score":"0.6509783","text":"@Override\r\n\tpublic void anular() {\n\r\n\t}","title":""},{"docid":"dae8b602ea36995333bfb23acf8fc88d","score":"0.6496443","text":"@Override\n\tpublic void respire() {\n\n\t}","title":""},{"docid":"5f8d37aee09bc1e9959f768d6eb0183c","score":"0.6481211","text":"@Override\r\n\t\t\tpublic void annadir() {\n\r\n\t\t\t}","title":""},{"docid":"f099266a753a2faacd6b8dfa57904378","score":"0.64321727","text":"@Override\r\n\tpublic void courrir() {\n\t}","title":""},{"docid":"69ade76a69c0f6c07e66b5d0e5136eb3","score":"0.6425563","text":"@Override\r\n\tpublic void grabar() {\n\t\t\r\n\t}","title":""},{"docid":"c2f383f280f298416bf45e72c374ecfa","score":"0.64127725","text":"@Override\r\n\tpublic void anularFact() {\n\t\t\r\n\t}","title":""},{"docid":"1068dc3e7725abba37b41c9a52dee06b","score":"0.6386121","text":"@Override\r\n\tpublic void tatmak() {\n\r\n\t}","title":""},{"docid":"6141981a3ecff744fc5ac85a76ccce98","score":"0.63590497","text":"@Override\r\n\tpublic void avlan() {\n\t\t\r\n\t}","title":""},{"docid":"98fb55d46118273a6e8a6d23841c620d","score":"0.6327681","text":"@Override\n\tpublic void eati() {\n\t\t\n\t}","title":""},{"docid":"0792d032a803e20f3b87637fd91001d5","score":"0.62811846","text":"@Override\n\tpublic void getSugary() {\n\n\t}","title":""},{"docid":"177192b7240b496ba5aefdfed60037c9","score":"0.6276059","text":"@Override\n\tpublic void nadar() {\n\t\t\n\t}","title":""},{"docid":"1f7c82e188acf30d59f88faf08cf24ac","score":"0.623686","text":"@Override\r\n\t\t\tpublic void ayuda() {\n\r\n\t\t\t}","title":""},{"docid":"1f7c82e188acf30d59f88faf08cf24ac","score":"0.623686","text":"@Override\r\n\t\t\tpublic void ayuda() {\n\r\n\t\t\t}","title":""},{"docid":"1f7c82e188acf30d59f88faf08cf24ac","score":"0.623686","text":"@Override\r\n\t\t\tpublic void ayuda() {\n\r\n\t\t\t}","title":""},{"docid":"b7cead8eab6faf887c06d3b10c67267c","score":"0.620242","text":"@Override\n\t\t\tprotected void readyRun() {\n\t\t\t\t\n\t\t\t}","title":""},{"docid":"b7cead8eab6faf887c06d3b10c67267c","score":"0.620242","text":"@Override\n\t\t\tprotected void readyRun() {\n\t\t\t\t\n\t\t\t}","title":""},{"docid":"a8ee8a5581ce765ec4ab398c0459e014","score":"0.61750215","text":"@Override\r\n\tpublic void koklama() {\n\r\n\t}","title":""},{"docid":"0e69410f7365f8e3379273ee4419fb49","score":"0.6149904","text":"@Override\r\n\tprotected void init() \r\n\t{\n\t\t\r\n\t}","title":""},{"docid":"d65d6c17fb978c0d576ada2c03cd49fe","score":"0.61387193","text":"@Override\n\tpublic void apagar() {\n\t\t\n\t}","title":""},{"docid":"8bae22ac805011d799a49bd7b5316540","score":"0.612467","text":"@Override\n public int describeContents() {\n // Auto-generated method stub\n return 0;\n }","title":""},{"docid":"8c5b7f2508d01c106c784ecca7153f46","score":"0.6119395","text":"@Override\n\tvoid comer() {\n\t\t\n\t}","title":""},{"docid":"7bc643d9ac7542f10430da7f200395d4","score":"0.610188","text":"@Override\n\tpublic void fiyat() {\n\t\t\n\t}","title":""},{"docid":"7dadb1a7e45c020b2193294044375a9d","score":"0.60646844","text":"@Override\r\n \tpublic void init() {\n \t\t\r\n \t}","title":""},{"docid":"04771723ee2c07e5fa5fe8c322190beb","score":"0.60607964","text":"@Override\n\tpublic void affichage() {\n\t\t\n\t}","title":""},{"docid":"b7f027eb6ff62218a28c15c608504db7","score":"0.6055265","text":"@Override\n\tpublic void cafeteria() {\n\t\t\n\t}","title":""},{"docid":"ae645a2585d37e320a8854cbd4c60db8","score":"0.60353535","text":"@Override\n\tpublic void afficher() {\n\n\t}","title":""},{"docid":"9dd1bbd8c949b94d0e93b83bfc68c88a","score":"0.6021345","text":"@Override\n\tpublic void aeronoticalinfo() {\n\t\t\n\t}","title":""},{"docid":"2762ca3c2d0df2e43c2974f74b6f5794","score":"0.6013198","text":"public void mo23507LF() {\n }","title":""},{"docid":"a6c2db17f79f35f8fc3b8e99eee9ab48","score":"0.60124713","text":"@Override\r\n\tprotected void init() {\n\t\t\r\n\t}","title":""},{"docid":"e8c159f9ce46ed87e18031b3ec3ef04c","score":"0.5983872","text":"@Override\n\t\t\tprotected void realiceElCaso() {\n\t\t\t\t\n\t\t\t}","title":""},{"docid":"e8c159f9ce46ed87e18031b3ec3ef04c","score":"0.5983872","text":"@Override\n\t\t\tprotected void realiceElCaso() {\n\t\t\t\t\n\t\t\t}","title":""},{"docid":"119b459aa82980ed18ed9f73e4c0c1f6","score":"0.5970375","text":"public void mo8248e() {\n }","title":""},{"docid":"c7fe9cc2a6c42140d48d92c4796a998c","score":"0.5924626","text":"@Override\r\n\t\t\t\t\t\tpublic void visitEnd() {\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t}","title":""},{"docid":"8b18fd12dbb5303a665e92c25393fb78","score":"0.59239364","text":"@Override\n\tprotected void initData() {\n\t\t\n\t}","title":""},{"docid":"8b18fd12dbb5303a665e92c25393fb78","score":"0.59239364","text":"@Override\n\tprotected void initData() {\n\t\t\n\t}","title":""},{"docid":"092f51e9c99cd4188e1aae23e1830dfd","score":"0.58991617","text":"protected void func_70626_be() {}","title":""},{"docid":"ab499170bffb402933a50d63a97e69dd","score":"0.5896488","text":"@Override\r\n\tprotected void init() {\n\t}","title":""},{"docid":"77d32d2a2070d9c3117ff146ac04f114","score":"0.5891585","text":"@Override\r\n\tpublic void climaChuvoso() {\n\r\n\t}","title":""},{"docid":"4790ff4cb67532ccdfaae8968e73fbc3","score":"0.58832747","text":"@Override\n protected void initData() {\n\n\n }","title":""},{"docid":"023182f0f855d46c66b41a6d83583efa","score":"0.5871911","text":"@Override\r\n\tpublic void singen() {\n\t\t\r\n\t}","title":""},{"docid":"8d96d27dfdf5b1a8cc8b8a7627c83bc1","score":"0.5869012","text":"@Override\n public void afficher() {\n\n }","title":""},{"docid":"298aa14afe5846b172f76bcf90564013","score":"0.58663046","text":"@Override\n\tprotected void initAfterData() {\n\t\t\n\t}","title":""},{"docid":"e065a728f99482f0172c0250b07109a9","score":"0.58587575","text":"public void MIENTRAS() {\r\n\t}","title":""},{"docid":"4967494f628119c8d3a4740e09278944","score":"0.5857751","text":"@Override\r\n\tprotected void initData() {\n\r\n\t}","title":""},{"docid":"6c15d2233a095a738527f0099df0e328","score":"0.58534765","text":"@Override\n\tprotected void onLoadComplete() {\n\t\t\n\t}","title":""},{"docid":"7da3b15ef60da758589933b21890a100","score":"0.5835782","text":"@Override\n\t\t\tpublic void buscar() {\n\n\t\t\t}","title":""},{"docid":"d56c498b25d1ea77dc09f49efcf80f6c","score":"0.58347356","text":"@Override\r\n\tpublic void aumentaFatorAcidade() {\n\r\n\t}","title":""},{"docid":"e57f005733f2eb8590150b3f4542b844","score":"0.5810564","text":"@Override\n\tprotected void getData() {\n\t\t\n\t}","title":""},{"docid":"da813fa08844d9ea0dcf6109d766cb06","score":"0.5810359","text":"@Override\n public void geefOpleidingNiveau() {\n }","title":""},{"docid":"d1236089c8974701d0acd37b2cad6d5b","score":"0.5809914","text":"@Override\n\tpublic void init(){\n\t\t\n\t}","title":""},{"docid":"ac3fa8f374744c1d8419fb42b093eb87","score":"0.58098364","text":"@Override\n public void ATOM() {\n\n }","title":""},{"docid":"9d2f44c3ebe1fb8de1ac4ae677e2d851","score":"0.5806823","text":"@Override\r\n\tpublic void dibujar() {\n\t\t\r\n\t}","title":""},{"docid":"17bf5dfb3822657f7beb964bbcaf351d","score":"0.58010787","text":"private void getdata() {\n\t\t\r\n\t\t\r\n\t}","title":""},{"docid":"c1cba83b623b4186565c3383ace251b9","score":"0.5798524","text":"@Override\n public void RES() {\n\n }","title":""},{"docid":"5783648f118108797828ca2085091ef9","score":"0.5793788","text":"@Override\n protected void initialize() {\n \n }","title":""},{"docid":"beee84210d56979d0068a8094fb2a5bd","score":"0.5792378","text":"@Override\r\n\tprotected void initData() {\n\t\t\r\n\t}","title":""},{"docid":"04320a5131c4ec5a83b61f5170f3303b","score":"0.578828","text":"private void refreash() {\n\t\t\t\n\t\t}","title":""},{"docid":"54b1134554bc066c34ed30a72adb660c","score":"0.57844025","text":"@Override\n\tprotected void initData() {\n\n\t}","title":""},{"docid":"54b1134554bc066c34ed30a72adb660c","score":"0.57844025","text":"@Override\n\tprotected void initData() {\n\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5774479","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5774479","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5774479","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5774479","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5774479","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5774479","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5774479","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"96aa62cb7c02dc761fce03adeea3bae6","score":"0.5768868","text":"public void consumidor() {\n\t\t\n\t\t\n\t}","title":""},{"docid":"518a761521ca9f5cb8a8055b32b72cda","score":"0.57596046","text":"@Override\n\tprotected void initialize() {\n\t\t\n\t}","title":""},{"docid":"2d614ed2ee5b3120f5ee8b427542ddc3","score":"0.575025","text":"@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","title":""},{"docid":"2d614ed2ee5b3120f5ee8b427542ddc3","score":"0.575025","text":"@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","title":""},{"docid":"2d614ed2ee5b3120f5ee8b427542ddc3","score":"0.575025","text":"@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","title":""},{"docid":"2d614ed2ee5b3120f5ee8b427542ddc3","score":"0.575025","text":"@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","title":""},{"docid":"2d614ed2ee5b3120f5ee8b427542ddc3","score":"0.575025","text":"@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","title":""},{"docid":"2d614ed2ee5b3120f5ee8b427542ddc3","score":"0.575025","text":"@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","title":""},{"docid":"2d614ed2ee5b3120f5ee8b427542ddc3","score":"0.575025","text":"@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","title":""},{"docid":"2d614ed2ee5b3120f5ee8b427542ddc3","score":"0.575025","text":"@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","title":""},{"docid":"2d614ed2ee5b3120f5ee8b427542ddc3","score":"0.575025","text":"@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","title":""},{"docid":"b143ffd983be4c8f41702b8f934b6f32","score":"0.57337177","text":"@Override\r\n\tpublic void init() {\n\r\n\t}","title":""},{"docid":"b143ffd983be4c8f41702b8f934b6f32","score":"0.57337177","text":"@Override\r\n\tpublic void init() {\n\r\n\t}","title":""},{"docid":"b143ffd983be4c8f41702b8f934b6f32","score":"0.57337177","text":"@Override\r\n\tpublic void init() {\n\r\n\t}","title":""},{"docid":"b143ffd983be4c8f41702b8f934b6f32","score":"0.57337177","text":"@Override\r\n\tpublic void init() {\n\r\n\t}","title":""},{"docid":"b143ffd983be4c8f41702b8f934b6f32","score":"0.57337177","text":"@Override\r\n\tpublic void init() {\n\r\n\t}","title":""},{"docid":"f76cff0faf8f5cac2bb5c9fa073b3900","score":"0.5732497","text":"private static void ispisiRemi() {\n\t\t\n\t}","title":""},{"docid":"0da844a8d21284fc890b9866b17625b3","score":"0.5729389","text":"public void auton() {\r\n\r\n\t\t}","title":""},{"docid":"3b42107e523d1f2c0adecfee5c69fe91","score":"0.5726736","text":"@Override\r\n\t\t\tpublic String toString() {\n\t\t\t\treturn null;\r\n\t\t\t}","title":""},{"docid":"3b42107e523d1f2c0adecfee5c69fe91","score":"0.5726736","text":"@Override\r\n\t\t\tpublic String toString() {\n\t\t\t\treturn null;\r\n\t\t\t}","title":""},{"docid":"3b42107e523d1f2c0adecfee5c69fe91","score":"0.5726736","text":"@Override\r\n\t\t\tpublic String toString() {\n\t\t\t\treturn null;\r\n\t\t\t}","title":""},{"docid":"e0989255fd1af22841693489e1afa33b","score":"0.57214063","text":"public void mo24349a() {\n }","title":""},{"docid":"b860b78be8e10589ee5bd58e2ab7be8e","score":"0.57196456","text":"@Override\r\n\tpublic void autonomous() {\r\n\t\t\r\n\t}","title":""},{"docid":"a937c607590931387a357d03c3b0eef4","score":"0.5715831","text":"@Override\n\tprotected void initialize() {\n\n\t}","title":""},{"docid":"08ff281f85800b58e0eb77195be25bfc","score":"0.5708199","text":"public void finito() {\n\t\t\r\n\t}","title":""},{"docid":"7aadbda143e84de0144f7a8dadde423d","score":"0.5701067","text":"@Override\n protected void initData() {\n\n }","title":""},{"docid":"24b649f4fd4e2e8f4e195b19c09f4c8b","score":"0.56936413","text":"@Override\n public void FUNMAYORQ() {\n\n }","title":""},{"docid":"b3c7aad07c4af0cfec14c4b0f0f289ef","score":"0.5692504","text":"@Override\n\tpublic void arb() {\n\n\t}","title":""},{"docid":"8657ef720f12b2480d4363be4e46781e","score":"0.5691313","text":"protected boolean method_4310() {\r\n return true;\r\n }","title":""},{"docid":"9f7ae565c79188ee275e5778abe03250","score":"0.56881124","text":"@Override\r\n\tprotected void initialize() {\n\r\n\t}","title":""},{"docid":"45fd99bd8793c6d67c4f276a27b4fdca","score":"0.5685153","text":"@Override public int getDefensa(){\n\n return 0;\n\n }","title":""}],"string":"[\n {\n \"docid\": \"d7194e467f51e022c107531d8614b6a3\",\n \"score\": \"0.6905833\",\n \"text\": \"@Override\\r\\n\\tpublic void anular() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"941cb2826e3c700358fcaba402e6bb01\",\n \"score\": \"0.66775143\",\n \"text\": \"@Override\\r\\n\\tpublic void hissetmek() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63918b2e510c9040bbddcac00095b41a\",\n \"score\": \"0.6605982\",\n \"text\": \"private void recuperation() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b5b11f4251ace8b3d0f5ead186f7beb\",\n \"score\": \"0.65677965\",\n \"text\": \"@Override\\n\\tpublic void comer() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a98c5d2724fce37914819c5694da3c3\",\n \"score\": \"0.6509783\",\n \"text\": \"@Override\\r\\n\\tpublic void anular() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dae8b602ea36995333bfb23acf8fc88d\",\n \"score\": \"0.6496443\",\n \"text\": \"@Override\\n\\tpublic void respire() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f8d37aee09bc1e9959f768d6eb0183c\",\n \"score\": \"0.6481211\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void annadir() {\\n\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f099266a753a2faacd6b8dfa57904378\",\n \"score\": \"0.64321727\",\n \"text\": \"@Override\\r\\n\\tpublic void courrir() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69ade76a69c0f6c07e66b5d0e5136eb3\",\n \"score\": \"0.6425563\",\n \"text\": \"@Override\\r\\n\\tpublic void grabar() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c2f383f280f298416bf45e72c374ecfa\",\n \"score\": \"0.64127725\",\n \"text\": \"@Override\\r\\n\\tpublic void anularFact() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1068dc3e7725abba37b41c9a52dee06b\",\n \"score\": \"0.6386121\",\n \"text\": \"@Override\\r\\n\\tpublic void tatmak() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6141981a3ecff744fc5ac85a76ccce98\",\n \"score\": \"0.63590497\",\n \"text\": \"@Override\\r\\n\\tpublic void avlan() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98fb55d46118273a6e8a6d23841c620d\",\n \"score\": \"0.6327681\",\n \"text\": \"@Override\\n\\tpublic void eati() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0792d032a803e20f3b87637fd91001d5\",\n \"score\": \"0.62811846\",\n \"text\": \"@Override\\n\\tpublic void getSugary() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"177192b7240b496ba5aefdfed60037c9\",\n \"score\": \"0.6276059\",\n \"text\": \"@Override\\n\\tpublic void nadar() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7c82e188acf30d59f88faf08cf24ac\",\n \"score\": \"0.623686\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void ayuda() {\\n\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7c82e188acf30d59f88faf08cf24ac\",\n \"score\": \"0.623686\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void ayuda() {\\n\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7c82e188acf30d59f88faf08cf24ac\",\n \"score\": \"0.623686\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void ayuda() {\\n\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7cead8eab6faf887c06d3b10c67267c\",\n \"score\": \"0.620242\",\n \"text\": \"@Override\\n\\t\\t\\tprotected void readyRun() {\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7cead8eab6faf887c06d3b10c67267c\",\n \"score\": \"0.620242\",\n \"text\": \"@Override\\n\\t\\t\\tprotected void readyRun() {\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8ee8a5581ce765ec4ab398c0459e014\",\n \"score\": \"0.61750215\",\n \"text\": \"@Override\\r\\n\\tpublic void koklama() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e69410f7365f8e3379273ee4419fb49\",\n \"score\": \"0.6149904\",\n \"text\": \"@Override\\r\\n\\tprotected void init() \\r\\n\\t{\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d65d6c17fb978c0d576ada2c03cd49fe\",\n \"score\": \"0.61387193\",\n \"text\": \"@Override\\n\\tpublic void apagar() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bae22ac805011d799a49bd7b5316540\",\n \"score\": \"0.612467\",\n \"text\": \"@Override\\n public int describeContents() {\\n // Auto-generated method stub\\n return 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c5b7f2508d01c106c784ecca7153f46\",\n \"score\": \"0.6119395\",\n \"text\": \"@Override\\n\\tvoid comer() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7bc643d9ac7542f10430da7f200395d4\",\n \"score\": \"0.610188\",\n \"text\": \"@Override\\n\\tpublic void fiyat() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7dadb1a7e45c020b2193294044375a9d\",\n \"score\": \"0.60646844\",\n \"text\": \"@Override\\r\\n \\tpublic void init() {\\n \\t\\t\\r\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04771723ee2c07e5fa5fe8c322190beb\",\n \"score\": \"0.60607964\",\n \"text\": \"@Override\\n\\tpublic void affichage() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7f027eb6ff62218a28c15c608504db7\",\n \"score\": \"0.6055265\",\n \"text\": \"@Override\\n\\tpublic void cafeteria() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae645a2585d37e320a8854cbd4c60db8\",\n \"score\": \"0.60353535\",\n \"text\": \"@Override\\n\\tpublic void afficher() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dd1bbd8c949b94d0e93b83bfc68c88a\",\n \"score\": \"0.6021345\",\n \"text\": \"@Override\\n\\tpublic void aeronoticalinfo() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2762ca3c2d0df2e43c2974f74b6f5794\",\n \"score\": \"0.6013198\",\n \"text\": \"public void mo23507LF() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6c2db17f79f35f8fc3b8e99eee9ab48\",\n \"score\": \"0.60124713\",\n \"text\": \"@Override\\r\\n\\tprotected void init() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8c159f9ce46ed87e18031b3ec3ef04c\",\n \"score\": \"0.5983872\",\n \"text\": \"@Override\\n\\t\\t\\tprotected void realiceElCaso() {\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8c159f9ce46ed87e18031b3ec3ef04c\",\n \"score\": \"0.5983872\",\n \"text\": \"@Override\\n\\t\\t\\tprotected void realiceElCaso() {\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"119b459aa82980ed18ed9f73e4c0c1f6\",\n \"score\": \"0.5970375\",\n \"text\": \"public void mo8248e() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7fe9cc2a6c42140d48d92c4796a998c\",\n \"score\": \"0.5924626\",\n \"text\": \"@Override\\r\\n\\t\\t\\t\\t\\t\\tpublic void visitEnd() {\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b18fd12dbb5303a665e92c25393fb78\",\n \"score\": \"0.59239364\",\n \"text\": \"@Override\\n\\tprotected void initData() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b18fd12dbb5303a665e92c25393fb78\",\n \"score\": \"0.59239364\",\n \"text\": \"@Override\\n\\tprotected void initData() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"092f51e9c99cd4188e1aae23e1830dfd\",\n \"score\": \"0.58991617\",\n \"text\": \"protected void func_70626_be() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab499170bffb402933a50d63a97e69dd\",\n \"score\": \"0.5896488\",\n \"text\": \"@Override\\r\\n\\tprotected void init() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77d32d2a2070d9c3117ff146ac04f114\",\n \"score\": \"0.5891585\",\n \"text\": \"@Override\\r\\n\\tpublic void climaChuvoso() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4790ff4cb67532ccdfaae8968e73fbc3\",\n \"score\": \"0.58832747\",\n \"text\": \"@Override\\n protected void initData() {\\n\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"023182f0f855d46c66b41a6d83583efa\",\n \"score\": \"0.5871911\",\n \"text\": \"@Override\\r\\n\\tpublic void singen() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d96d27dfdf5b1a8cc8b8a7627c83bc1\",\n \"score\": \"0.5869012\",\n \"text\": \"@Override\\n public void afficher() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"298aa14afe5846b172f76bcf90564013\",\n \"score\": \"0.58663046\",\n \"text\": \"@Override\\n\\tprotected void initAfterData() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e065a728f99482f0172c0250b07109a9\",\n \"score\": \"0.58587575\",\n \"text\": \"public void MIENTRAS() {\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4967494f628119c8d3a4740e09278944\",\n \"score\": \"0.5857751\",\n \"text\": \"@Override\\r\\n\\tprotected void initData() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c15d2233a095a738527f0099df0e328\",\n \"score\": \"0.58534765\",\n \"text\": \"@Override\\n\\tprotected void onLoadComplete() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7da3b15ef60da758589933b21890a100\",\n \"score\": \"0.5835782\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void buscar() {\\n\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d56c498b25d1ea77dc09f49efcf80f6c\",\n \"score\": \"0.58347356\",\n \"text\": \"@Override\\r\\n\\tpublic void aumentaFatorAcidade() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e57f005733f2eb8590150b3f4542b844\",\n \"score\": \"0.5810564\",\n \"text\": \"@Override\\n\\tprotected void getData() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da813fa08844d9ea0dcf6109d766cb06\",\n \"score\": \"0.5810359\",\n \"text\": \"@Override\\n public void geefOpleidingNiveau() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1236089c8974701d0acd37b2cad6d5b\",\n \"score\": \"0.5809914\",\n \"text\": \"@Override\\n\\tpublic void init(){\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac3fa8f374744c1d8419fb42b093eb87\",\n \"score\": \"0.58098364\",\n \"text\": \"@Override\\n public void ATOM() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d2f44c3ebe1fb8de1ac4ae677e2d851\",\n \"score\": \"0.5806823\",\n \"text\": \"@Override\\r\\n\\tpublic void dibujar() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17bf5dfb3822657f7beb964bbcaf351d\",\n \"score\": \"0.58010787\",\n \"text\": \"private void getdata() {\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c1cba83b623b4186565c3383ace251b9\",\n \"score\": \"0.5798524\",\n \"text\": \"@Override\\n public void RES() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5783648f118108797828ca2085091ef9\",\n \"score\": \"0.5793788\",\n \"text\": \"@Override\\n protected void initialize() {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"beee84210d56979d0068a8094fb2a5bd\",\n \"score\": \"0.5792378\",\n \"text\": \"@Override\\r\\n\\tprotected void initData() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04320a5131c4ec5a83b61f5170f3303b\",\n \"score\": \"0.578828\",\n \"text\": \"private void refreash() {\\n\\t\\t\\t\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54b1134554bc066c34ed30a72adb660c\",\n \"score\": \"0.57844025\",\n \"text\": \"@Override\\n\\tprotected void initData() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54b1134554bc066c34ed30a72adb660c\",\n \"score\": \"0.57844025\",\n \"text\": \"@Override\\n\\tprotected void initData() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5774479\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5774479\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5774479\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5774479\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5774479\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5774479\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5774479\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96aa62cb7c02dc761fce03adeea3bae6\",\n \"score\": \"0.5768868\",\n \"text\": \"public void consumidor() {\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"518a761521ca9f5cb8a8055b32b72cda\",\n \"score\": \"0.57596046\",\n \"text\": \"@Override\\n\\tprotected void initialize() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d614ed2ee5b3120f5ee8b427542ddc3\",\n \"score\": \"0.575025\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d614ed2ee5b3120f5ee8b427542ddc3\",\n \"score\": \"0.575025\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d614ed2ee5b3120f5ee8b427542ddc3\",\n \"score\": \"0.575025\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d614ed2ee5b3120f5ee8b427542ddc3\",\n \"score\": \"0.575025\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d614ed2ee5b3120f5ee8b427542ddc3\",\n \"score\": \"0.575025\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d614ed2ee5b3120f5ee8b427542ddc3\",\n \"score\": \"0.575025\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d614ed2ee5b3120f5ee8b427542ddc3\",\n \"score\": \"0.575025\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d614ed2ee5b3120f5ee8b427542ddc3\",\n \"score\": \"0.575025\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d614ed2ee5b3120f5ee8b427542ddc3\",\n \"score\": \"0.575025\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b143ffd983be4c8f41702b8f934b6f32\",\n \"score\": \"0.57337177\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b143ffd983be4c8f41702b8f934b6f32\",\n \"score\": \"0.57337177\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b143ffd983be4c8f41702b8f934b6f32\",\n \"score\": \"0.57337177\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b143ffd983be4c8f41702b8f934b6f32\",\n \"score\": \"0.57337177\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b143ffd983be4c8f41702b8f934b6f32\",\n \"score\": \"0.57337177\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f76cff0faf8f5cac2bb5c9fa073b3900\",\n \"score\": \"0.5732497\",\n \"text\": \"private static void ispisiRemi() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0da844a8d21284fc890b9866b17625b3\",\n \"score\": \"0.5729389\",\n \"text\": \"public void auton() {\\r\\n\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b42107e523d1f2c0adecfee5c69fe91\",\n \"score\": \"0.5726736\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic String toString() {\\n\\t\\t\\t\\treturn null;\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b42107e523d1f2c0adecfee5c69fe91\",\n \"score\": \"0.5726736\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic String toString() {\\n\\t\\t\\t\\treturn null;\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b42107e523d1f2c0adecfee5c69fe91\",\n \"score\": \"0.5726736\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic String toString() {\\n\\t\\t\\t\\treturn null;\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0989255fd1af22841693489e1afa33b\",\n \"score\": \"0.57214063\",\n \"text\": \"public void mo24349a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b860b78be8e10589ee5bd58e2ab7be8e\",\n \"score\": \"0.57196456\",\n \"text\": \"@Override\\r\\n\\tpublic void autonomous() {\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a937c607590931387a357d03c3b0eef4\",\n \"score\": \"0.5715831\",\n \"text\": \"@Override\\n\\tprotected void initialize() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"08ff281f85800b58e0eb77195be25bfc\",\n \"score\": \"0.5708199\",\n \"text\": \"public void finito() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7aadbda143e84de0144f7a8dadde423d\",\n \"score\": \"0.5701067\",\n \"text\": \"@Override\\n protected void initData() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24b649f4fd4e2e8f4e195b19c09f4c8b\",\n \"score\": \"0.56936413\",\n \"text\": \"@Override\\n public void FUNMAYORQ() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b3c7aad07c4af0cfec14c4b0f0f289ef\",\n \"score\": \"0.5692504\",\n \"text\": \"@Override\\n\\tpublic void arb() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8657ef720f12b2480d4363be4e46781e\",\n \"score\": \"0.5691313\",\n \"text\": \"protected boolean method_4310() {\\r\\n return true;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f7ae565c79188ee275e5778abe03250\",\n \"score\": \"0.56881124\",\n \"text\": \"@Override\\r\\n\\tprotected void initialize() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"45fd99bd8793c6d67c4f276a27b4fdca\",\n \"score\": \"0.5685153\",\n \"text\": \"@Override public int getDefensa(){\\n\\n return 0;\\n\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983799,"cells":{"query_id":{"kind":"string","value":"adb33a220f69a1a6c40e72c3325e61f0"},"query":{"kind":"string","value":"Root node constructor. Creates the root node."},"positive_passages":{"kind":"list like","value":[{"docid":"0604520525c2c62a36857e93ad50e255","score":"0.0","text":"public Node81918309(Board board, int[] move) {\r\n\t\tnodeBoard = board;\r\n\t\tnodeMove = move;\r\n\t\tparent = null;\r\n\t\tchildren = new ArrayList<Node81918309>();\r\n\t\tnodeDepth = 0;\r\n\t\tnodePlayerId = enemyId;\r\n\t}","title":""}],"string":"[\n {\n \"docid\": \"0604520525c2c62a36857e93ad50e255\",\n \"score\": \"0.0\",\n \"text\": \"public Node81918309(Board board, int[] move) {\\r\\n\\t\\tnodeBoard = board;\\r\\n\\t\\tnodeMove = move;\\r\\n\\t\\tparent = null;\\r\\n\\t\\tchildren = new ArrayList<Node81918309>();\\r\\n\\t\\tnodeDepth = 0;\\r\\n\\t\\tnodePlayerId = enemyId;\\r\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"d95d58924523f10506b606a0a8dbaf03","score":"0.7153047","text":"public RootNode() {\n super(new ExplorerTree(topName));\n this.setValue(\"nodeType\", \"Top\");\n// this.setValue(\"networkName\", topName);\n setIconBase(\"org/qview/gui/TopIcon\");\n// setIcon(Utilities.loadImage(\"org/qview/gui/TopIcon.gif\", true));\n super.setName(topName);\n setDisplayName(topName);\n this.key = this.getName();\n setShortDescription(bundle.getString(\"HINT_NBNode\"));\n// this.setHidden(true);\n NBNodes.put(this.getName(), this);\n }","title":""},{"docid":"e4a906a8e4abcb33bff299080b583982","score":"0.6962713","text":"Root createRoot();","title":""},{"docid":"00ad1b628cb5c058e61cc6f360f3bbc0","score":"0.6898416","text":"public Tree()\n {\n root = null;\n }","title":""},{"docid":"2f510cc3f1c31502803f990b6854b6af","score":"0.6768121","text":"public TrinaryTree(){\n\t\t//Create an empty root node\n\t\troot = null;\n\t}","title":""},{"docid":"f34501c29a91498f5d474f4675515146","score":"0.675498","text":"private RedBlackNode initializeRoot() {\r\n\t\tif (root == null) {\r\n\t\t\troot = RedBlackNode.NilNode;\r\n\t\t}\r\n\t\treturn root;\r\n\t}","title":""},{"docid":"20b8164c50a0699b1a402f85998b681a","score":"0.67174727","text":"public Node(){}","title":""},{"docid":"20b8164c50a0699b1a402f85998b681a","score":"0.67174727","text":"public Node(){}","title":""},{"docid":"974853b43cb081d769188d0b4bb56177","score":"0.671106","text":"public Node<AnyType> getRoot(){\r\n\t\treturn root;\t\t\r\n\t}","title":""},{"docid":"365028a6f62753b0dc2285effd55b1fa","score":"0.6704914","text":"public RedBlackTree() {\r\n\t\tinitializeRoot();\r\n\t}","title":""},{"docid":"b0135af77ec200e1af577a45873d5ab0","score":"0.67006314","text":"public MorseTree() {\n this.overallRoot = new MorseTreeNode(\"start\");\n create(overallRoot);\n\n }","title":""},{"docid":"e92254a0c81f17e9d4480d6c749c9c40","score":"0.66929317","text":"public MorseTree() {\n this.root = new Node<>(null);\n }","title":""},{"docid":"ddfa588dd83d353b1942d509b1e41217","score":"0.667653","text":"public Question_211() {\n root = new TreeNode();\n }","title":""},{"docid":"6978f9d1ceea6997657e66e8d5b3b63b","score":"0.6670389","text":"public Node() {\n\t\t\tthis(null);\n\t\t}","title":""},{"docid":"77f28f4c40ba94652a74f278e314669e","score":"0.6658853","text":"public DirectoryTree() {\n\t\t\n\t\troot = new DirectoryNode();\n\t\troot.setName(\"root\");\n\t\tcursor = root;\n\t\t\n\t}","title":""},{"docid":"2079b5e5bbef0ed81558ffac9457728c","score":"0.66069216","text":"public Node()\r\n\t\t{\r\n\t\t\t// TODO \r\n\t\t}","title":""},{"docid":"ee3b281ebdbba94f7dbe5fd9bd72a903","score":"0.66008896","text":"public LinkedBinaryTree() {\n\troot = new BTNode<T>(null,null,null);\n }","title":""},{"docid":"0d5218be1dc19e0b9a04001765067368","score":"0.65886474","text":"public AVLNode<T> getRoot()\n\t\t{\n\t\t\treturn root;\n\t\t}","title":""},{"docid":"c55aa8dfc55abda0d754a96ea99e3a4c","score":"0.656081","text":"public BinaryTree() {\r\n\t\tthis(0);\r\n\t}","title":""},{"docid":"a9f759bceb5ddbba75e5a649b44e119b","score":"0.65555954","text":"public DNode getRootNode(){\n\t\treturn root;\n\t}","title":""},{"docid":"595a3a888589c66217174cdaf96b9dd0","score":"0.65505487","text":"public BinaryTree() {\n\t\tsuper.root = null;\n\t}","title":""},{"docid":"c5f6af7b2d654a55d7eceef817710e94","score":"0.65505403","text":"public Tree(Object rootData)\n {\n root = new Node();\n root.data = rootData;\n root.children = new ArrayList<>();\n }","title":""},{"docid":"feee1eb5162c7d5ef19e1aaece08a96f","score":"0.6547663","text":"public RBTree() {\n\n\t\t//setting nil node to be black\n\t\tnil = new Node(0, 0, 0);\n\t\tnil.setColor(1);\n\t\t\n\t\troot = nil; //to start with\n\t\tnil.setLeft(nil);\t\n\t\tnil.setRight(nil);\t\t\n\t\tnil.setParent(nil);\t\t\n\n\t\t//intialize the size and height of tree\n\t\tsize = 0;\n\t}","title":""},{"docid":"c4b4954b0bf7f510ab4a31585352a36a","score":"0.65458566","text":"public Tree()\t{ nRoot = null; pRoot = null; }","title":""},{"docid":"bee7b8317f6b05506c528bd44c628390","score":"0.6545578","text":"public binarytree()\n{\n\troot = null; //default constructor, with no node added\n}","title":""},{"docid":"c5ed5b29e9df6b7d31592b2b65f7cba2","score":"0.65406823","text":"public LeetCode211() {\n this.root = new Node();\n }","title":""},{"docid":"8e9076871ce78d9241af6e45c4c6e517","score":"0.6522037","text":"@Override\r\n public AVLNode<T> getRoot() {\n return root;\r\n }","title":""},{"docid":"5caf0776ad1de9473b912a1f69904876","score":"0.651949","text":"public AVLNode<T> getRoot() {\n return root;\n }","title":""},{"docid":"4af027f27410f59457890a1d09346e68","score":"0.65071714","text":"public Node() {}","title":""},{"docid":"4af027f27410f59457890a1d09346e68","score":"0.65071714","text":"public Node() {}","title":""},{"docid":"4af027f27410f59457890a1d09346e68","score":"0.65071714","text":"public Node() {}","title":""},{"docid":"d8c3e173637476b03cf0a41d02c52271","score":"0.65016526","text":"public BinaryTree()\n\t{\n\t\troot = null;\n\t\tnumberOfNodes = 0;\n\t}","title":""},{"docid":"63c9b16064a2ab0e87fade87bded8a26","score":"0.64909625","text":"public BST() {\n sentinel = new Node(null, null);\n root = sentinel;\n }","title":""},{"docid":"f680b8dd81160d8f4e92d622689cb1da","score":"0.64885676","text":"public S5droidTree() {\n root = new Node();\n root.startLine = 0;\n root.endLine = Integer.MAX_VALUE;\n root.isBlock = true;\n root.children = new ArrayList<>(256);\n curr = root;\n }","title":""},{"docid":"3d59298587d6a79a1497b5f079e1be0d","score":"0.6480616","text":"public BinaryTree() {\n root = null;\n }","title":""},{"docid":"671092d30720418fdd56ddd8a511d42a","score":"0.64578396","text":"public Node getRoot(){\n return root;\n }","title":""},{"docid":"3e6b57c56e6b54c431e8253e904b6cdb","score":"0.6448742","text":"public Node<T> getRoot() {\n\t\treturn root;\n\t}","title":""},{"docid":"3e6b57c56e6b54c431e8253e904b6cdb","score":"0.6448742","text":"public Node<T> getRoot() {\n\t\treturn root;\n\t}","title":""},{"docid":"ae9efe285657890186bf87b660d2ee30","score":"0.6448081","text":"public Node getRoot() {\n\t\treturn root;\n\t}","title":""},{"docid":"ae9efe285657890186bf87b660d2ee30","score":"0.6448081","text":"public Node getRoot() {\n\t\treturn root;\n\t}","title":""},{"docid":"ae9efe285657890186bf87b660d2ee30","score":"0.6448081","text":"public Node getRoot() {\n\t\treturn root;\n\t}","title":""},{"docid":"52c05343d8732e1c227d98e2b3680a74","score":"0.6447325","text":"public DirectoryTree(){\r\n root = new DirectoryNode();\r\n root.setName(\"root\");\r\n cursor = root;\r\n }","title":""},{"docid":"56c835b52033124b526ef1a34ffdbd95","score":"0.6443491","text":"@Override\n public AVLNode<T> getRoot() {\n return root;\n }","title":""},{"docid":"56c835b52033124b526ef1a34ffdbd95","score":"0.6443491","text":"@Override\n public AVLNode<T> getRoot() {\n return root;\n }","title":""},{"docid":"de1a6c261fb8dee3a1dbf87cf369e58b","score":"0.6420139","text":"public RBTree() {\n root = null;\n }","title":""},{"docid":"0b0db95136d66cd4d9c928e8c3ee4afd","score":"0.63996685","text":"public Node getRoot() {\n return root;\n }","title":""},{"docid":"0b0db95136d66cd4d9c928e8c3ee4afd","score":"0.63996685","text":"public Node getRoot() {\n return root;\n }","title":""},{"docid":"55df715f863ed764c4708ea1b4aa7fbc","score":"0.63891315","text":"public Node() {\n }","title":""},{"docid":"6898cab99ebc2e8e6f4a5e9683e452aa","score":"0.638308","text":"public BinaryNode getRoot() {\n\t\treturn root;\n\t}","title":""},{"docid":"0bf6a2896089560533d1d5fb81713197","score":"0.6373276","text":"public HeterogeneousNode getRoot() {\r\n\t\treturn root;\r\n\t}","title":""},{"docid":"c0cec899b602037904a93a823d4adfe6","score":"0.6372826","text":"public KdTree() {\n this.root = null;\n this.rect = new RectHV(0.0, 0.0, 1.0, 1.0);\n }","title":""},{"docid":"4244cc777d3798ad923e352285283302","score":"0.6371072","text":"Node getRoot()\n {\n return root;\n }","title":""},{"docid":"da41e588e7bfa956e6b3a7687b7e8fbd","score":"0.6370934","text":"public BST() {\n\t\troot = null;\n\t}","title":""},{"docid":"c10a2d35e22642e3df7d58bfb28f19a1","score":"0.63702476","text":"public Root(String rootName, String NodeName, String element,int address) {\n\t\tsuper(NodeName, element,address);\n\t\tthis.rootName = rootName;\n\t\tstoreageNodes = new ArrayList<Node>();\n\t\tstorageEdges = new ArrayList<Edge>();\n\t}","title":""},{"docid":"a8c8161c2bccbba8daef82ba8c68d6e6","score":"0.63655055","text":"public Root(String rootName,String NodeName, String element) {\n\t\tsuper(NodeName, element);\n\t\t// TODO Auto-generated constructor stub\n\t\tthis.rootName = rootName;\n\t\tstoreageNodes = new ArrayList<Node>();\n\t\tstorageEdges = new ArrayList<Edge>();\n\t\t\n\t}","title":""},{"docid":"9e157ee1a9519067dacfab1f3438450d","score":"0.6361997","text":"public Node getRoot();","title":""},{"docid":"0200af48e3e2c310322fbfdb3e86a9d9","score":"0.6359166","text":"public KdTree() {\n\t\tsize = 0;\n\t\troot = null;\n\t}","title":""},{"docid":"fa619cbb45d7835915af0b35c1adaf34","score":"0.633779","text":"public AVLNode getRoot() {\n return this.root;\n }","title":""},{"docid":"cbc1cfef0f05da3282751a9ca8cfd598","score":"0.6334677","text":"public BinaryTree(){\r\n root = null;\r\n }","title":""},{"docid":"d3ba9c49221e07e620f41e292023c558","score":"0.6315899","text":"public Node<T> getRoot()\r\n {\r\n return root;\r\n }","title":""},{"docid":"2fa945b46228613d07f95210027288b7","score":"0.6307858","text":"public TupleNode getRoot(){\r\n\t\t\treturn root;\r\n\t\t}","title":""},{"docid":"a42c663d54d43c5ec0d61996eaf2e5d5","score":"0.63075036","text":"public KdTree() {\n root = null;\n size = 0;\n }","title":""},{"docid":"19bd80e874821202dacb49672a44688f","score":"0.6299864","text":"Node()\n {\n\n }","title":""},{"docid":"1a091dedc7eea2a6eeeaa2b84679c0b4","score":"0.6279005","text":"public AVLTree() {\n\t\tthis.root = null;\n\t\tnumOfElements = 0;\n\t}","title":""},{"docid":"f86849d0d11163ee06364c8635091c21","score":"0.62784004","text":"public Trie() {\r\n root = new TrieNode(); //root declared as a TrieNode\r\n }","title":""},{"docid":"7b610be4f49908f662e705442a8470f4","score":"0.6275146","text":"public Node ()\n {\n }","title":""},{"docid":"b46b624d3d69a6d5de6f02bcb2dc2f6e","score":"0.6269753","text":"public BaseTreeNode() {\n this(\"-\", 0);\n }","title":""},{"docid":"11b3767f1bf87d46cd1a50c1e634fa8a","score":"0.6264132","text":"public BSTree()\n\t{\n\t\troot = null;\n\t\tcount = 0;\n\t}","title":""},{"docid":"e087b0fd9ec3928bbcda9a427732df28","score":"0.62377506","text":"Node() \r\n {\r\n parent = this;\r\n left = null;\r\n mid = null;\r\n right = null;\r\n q = null;\r\n }","title":""},{"docid":"c878a3eb194645a8a9c8715cefab80c9","score":"0.62372047","text":"public CgenNode root() {\n return get(TreeConstants.Object_);\n }","title":""},{"docid":"5ea2fa8507fc991f8532a15dc9ac07a0","score":"0.62263274","text":"protected AVLNode getRoot() {\n return (AVLNode) root;\n }","title":""},{"docid":"0d8b5c89b99c42d1586a8031b95037de","score":"0.6217051","text":"public KdTree()\n {\n this.root = null;\n this.size = 0;\n \n }","title":""},{"docid":"d2d201137bee59134449b55c5478c26a","score":"0.62135994","text":"public BST()\n\t{\n\t\troot = null;\n\t}","title":""},{"docid":"7fe9ba10a540e8e99145e11f03f27f7b","score":"0.62124306","text":"public ExpressionTree()\n {\n root = null;\n }","title":""},{"docid":"081e7c67580cbd80addb2fcda44f8c61","score":"0.6203407","text":"public BST() {\n this.root = null;\n this.size = 0;\n }","title":""},{"docid":"3e663f47a42d225270664fad9d9cd7e2","score":"0.62012833","text":"protected GeneralTree(Node < E > root) {\r\n super(root);\r\n }","title":""},{"docid":"40029efbd04342af1328fcf948e6ae5e","score":"0.6192769","text":"public HuffNode getRoot() {\r\n return root;\r\n }","title":""},{"docid":"26426bfa3a2a6e0ba594e00447d38c3d","score":"0.61911255","text":"public RedBlackTree() {\n\t\troot = null;\n\t}","title":""},{"docid":"a82059a30e368226dd328899691f2f1e","score":"0.6190694","text":"public void setRoot(Node root){\n this.root = root;\n }","title":""},{"docid":"1db4b4410793d2735da0f3f4a56adfad","score":"0.61884356","text":"public Node()\n {\n references = new Node[26];\n for (int i = 0; i < references.length; i++)\n {\n references[i] = null;\n }\n prefixes = 0;\n words = 0;\n term = new Term(\"\", 0);\n }","title":""},{"docid":"651755d24ab8c3c9de6fb2a8a0cfa89d","score":"0.61730546","text":"public DefaultTreeNode() {\r\n\t\tm_numDescendants = 0;\r\n m_parentEdge = null;\r\n\t\tm_parent = null;\r\n\t}","title":""},{"docid":"a5410f102a5fa5712679fd42593933c9","score":"0.6162497","text":"public BinaryTree() {}","title":""},{"docid":"e6d63a49caf5b0ed0716ef50b83a366e","score":"0.61611867","text":"public EvolutionaryTree(){\n\t\troot = new DefaultMutableTreeNode();\n\t}","title":""},{"docid":"ab301bb8b7376b25facc7b1d93832f6f","score":"0.61515325","text":"@Override\r\n\tpublic Node getRootNode() {\n\t\treturn null;\r\n\t}","title":""},{"docid":"25eef8a171642e4331af4d9a8a678f70","score":"0.61460924","text":"public void setRoot(Node root) {\n this.root = root;\n }","title":""},{"docid":"45f1eee7b782b5cb853e791c84947e39","score":"0.6143614","text":"public BinaryTree()\r\n { this.root = null;\r\n this.leftChild = null;\r\n this.rightChild = null;\r\n }","title":""},{"docid":"2d2415024b8aeab52561b4f589859c31","score":"0.6140033","text":"public void makeEmpty()\n {\n root = new RopeNode(\"\");\n }","title":""},{"docid":"25219e040488aa1258d2bf232879bf88","score":"0.6128877","text":"public Tree(int value){\n root = new Node(value);\n }","title":""},{"docid":"c6bb794adfa650c0b9084d2e8e0106e7","score":"0.61149555","text":"@Override\r\n\tpublic TreeNode<String> getRoot() {\r\n\t\treturn root;\r\n\t}","title":""},{"docid":"5169249f511113829bb12a1a056ac3c9","score":"0.6112821","text":"public MagicDictionary() {\n root=new TreeNode();\n }","title":""},{"docid":"7df4fb5e8ca6842b5be8e04ba26b4929","score":"0.60896116","text":"public MyBST () {\n\t\troot = null;\n\t\tsize = 0;\n\t}","title":""},{"docid":"0394209b2b79a8f470c40bea3597bbc4","score":"0.6089248","text":"public Node getRoot() {\n\t\treturn this.root;\n\t}","title":""},{"docid":"e2477aa689d64b44e5ab18614824b6a2","score":"0.6085639","text":"public BinaryTree() {\n super();\n }","title":""},{"docid":"b20e99dc7634a31d8ee557f4ceea9fb4","score":"0.6076209","text":"@Override\r\n\tpublic BinaryTreeNode<Key, Value> getRoot() {\n\t\treturn root;\r\n\t}","title":""},{"docid":"3da34ad632b8a57c9144651ac6021e14","score":"0.60740095","text":"protected static XMLTreeNode createRootNode(XMLTreeModel model, Element actual) {\r\n return new XMLTreeNode(model, null, new TreePath(actual), actual, null, null);\r\n }","title":""},{"docid":"644402bccbf81c416262d99147aac58d","score":"0.6069921","text":"public Trie() {\n root = new Node();\n }","title":""},{"docid":"644402bccbf81c416262d99147aac58d","score":"0.6069921","text":"public Trie() {\n root = new Node();\n }","title":""},{"docid":"644402bccbf81c416262d99147aac58d","score":"0.6069921","text":"public Trie() {\n root = new Node();\n }","title":""},{"docid":"11702b4abdf2001935bffbbbb9a7cfdd","score":"0.6068471","text":"public Zone() {\n\t\t_parent = null;\n\t\t_id = ROOT;\n\t\t_name = \"<root>\";\n\n\t\t// Always belongs to \"self\"\n\t\t//\n\t\t_isSelf = true;\n\n Zones.setRoot(this);\n\t}","title":""},{"docid":"97c44d22481b492a0fd607c8ad991340","score":"0.60641295","text":"public SimpleNode(){\n\t\tvalue = new Node();\n\t\tnext = null;\n\t}","title":""},{"docid":"0ad61243f5cc641d88924da0687a7a99","score":"0.60536075","text":"public Dictionary()\n\t{\n\t\t// Set next index to 0\n\t\t_nextIndex = 0;\n\t\t// Use next index to create root node\n\t\t_root = new Node(_nextIndex, (byte)0);\n\t\t// Increase next index \n\t\t_nextIndex++;\n\t\t// Set current node to root node\n\t\t_current = _root;\n\t}","title":""},{"docid":"9538afe73128f5b707d426371ee151a8","score":"0.6052884","text":"public Trie() {\n root = new TrieNode();\n }","title":""}],"string":"[\n {\n \"docid\": \"d95d58924523f10506b606a0a8dbaf03\",\n \"score\": \"0.7153047\",\n \"text\": \"public RootNode() {\\n super(new ExplorerTree(topName));\\n this.setValue(\\\"nodeType\\\", \\\"Top\\\");\\n// this.setValue(\\\"networkName\\\", topName);\\n setIconBase(\\\"org/qview/gui/TopIcon\\\");\\n// setIcon(Utilities.loadImage(\\\"org/qview/gui/TopIcon.gif\\\", true));\\n super.setName(topName);\\n setDisplayName(topName);\\n this.key = this.getName();\\n setShortDescription(bundle.getString(\\\"HINT_NBNode\\\"));\\n// this.setHidden(true);\\n NBNodes.put(this.getName(), this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4a906a8e4abcb33bff299080b583982\",\n \"score\": \"0.6962713\",\n \"text\": \"Root createRoot();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00ad1b628cb5c058e61cc6f360f3bbc0\",\n \"score\": \"0.6898416\",\n \"text\": \"public Tree()\\n {\\n root = null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f510cc3f1c31502803f990b6854b6af\",\n \"score\": \"0.6768121\",\n \"text\": \"public TrinaryTree(){\\n\\t\\t//Create an empty root node\\n\\t\\troot = null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f34501c29a91498f5d474f4675515146\",\n \"score\": \"0.675498\",\n \"text\": \"private RedBlackNode initializeRoot() {\\r\\n\\t\\tif (root == null) {\\r\\n\\t\\t\\troot = RedBlackNode.NilNode;\\r\\n\\t\\t}\\r\\n\\t\\treturn root;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"20b8164c50a0699b1a402f85998b681a\",\n \"score\": \"0.67174727\",\n \"text\": \"public Node(){}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"20b8164c50a0699b1a402f85998b681a\",\n \"score\": \"0.67174727\",\n \"text\": \"public Node(){}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"974853b43cb081d769188d0b4bb56177\",\n \"score\": \"0.671106\",\n \"text\": \"public Node<AnyType> getRoot(){\\r\\n\\t\\treturn root;\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"365028a6f62753b0dc2285effd55b1fa\",\n \"score\": \"0.6704914\",\n \"text\": \"public RedBlackTree() {\\r\\n\\t\\tinitializeRoot();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0135af77ec200e1af577a45873d5ab0\",\n \"score\": \"0.67006314\",\n \"text\": \"public MorseTree() {\\n this.overallRoot = new MorseTreeNode(\\\"start\\\");\\n create(overallRoot);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e92254a0c81f17e9d4480d6c749c9c40\",\n \"score\": \"0.66929317\",\n \"text\": \"public MorseTree() {\\n this.root = new Node<>(null);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ddfa588dd83d353b1942d509b1e41217\",\n \"score\": \"0.667653\",\n \"text\": \"public Question_211() {\\n root = new TreeNode();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6978f9d1ceea6997657e66e8d5b3b63b\",\n \"score\": \"0.6670389\",\n \"text\": \"public Node() {\\n\\t\\t\\tthis(null);\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77f28f4c40ba94652a74f278e314669e\",\n \"score\": \"0.6658853\",\n \"text\": \"public DirectoryTree() {\\n\\t\\t\\n\\t\\troot = new DirectoryNode();\\n\\t\\troot.setName(\\\"root\\\");\\n\\t\\tcursor = root;\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2079b5e5bbef0ed81558ffac9457728c\",\n \"score\": \"0.66069216\",\n \"text\": \"public Node()\\r\\n\\t\\t{\\r\\n\\t\\t\\t// TODO \\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee3b281ebdbba94f7dbe5fd9bd72a903\",\n \"score\": \"0.66008896\",\n \"text\": \"public LinkedBinaryTree() {\\n\\troot = new BTNode<T>(null,null,null);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d5218be1dc19e0b9a04001765067368\",\n \"score\": \"0.65886474\",\n \"text\": \"public AVLNode<T> getRoot()\\n\\t\\t{\\n\\t\\t\\treturn root;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c55aa8dfc55abda0d754a96ea99e3a4c\",\n \"score\": \"0.656081\",\n \"text\": \"public BinaryTree() {\\r\\n\\t\\tthis(0);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9f759bceb5ddbba75e5a649b44e119b\",\n \"score\": \"0.65555954\",\n \"text\": \"public DNode getRootNode(){\\n\\t\\treturn root;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"595a3a888589c66217174cdaf96b9dd0\",\n \"score\": \"0.65505487\",\n \"text\": \"public BinaryTree() {\\n\\t\\tsuper.root = null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5f6af7b2d654a55d7eceef817710e94\",\n \"score\": \"0.65505403\",\n \"text\": \"public Tree(Object rootData)\\n {\\n root = new Node();\\n root.data = rootData;\\n root.children = new ArrayList<>();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"feee1eb5162c7d5ef19e1aaece08a96f\",\n \"score\": \"0.6547663\",\n \"text\": \"public RBTree() {\\n\\n\\t\\t//setting nil node to be black\\n\\t\\tnil = new Node(0, 0, 0);\\n\\t\\tnil.setColor(1);\\n\\t\\t\\n\\t\\troot = nil; //to start with\\n\\t\\tnil.setLeft(nil);\\t\\n\\t\\tnil.setRight(nil);\\t\\t\\n\\t\\tnil.setParent(nil);\\t\\t\\n\\n\\t\\t//intialize the size and height of tree\\n\\t\\tsize = 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c4b4954b0bf7f510ab4a31585352a36a\",\n \"score\": \"0.65458566\",\n \"text\": \"public Tree()\\t{ nRoot = null; pRoot = null; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bee7b8317f6b05506c528bd44c628390\",\n \"score\": \"0.6545578\",\n \"text\": \"public binarytree()\\n{\\n\\troot = null; //default constructor, with no node added\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5ed5b29e9df6b7d31592b2b65f7cba2\",\n \"score\": \"0.65406823\",\n \"text\": \"public LeetCode211() {\\n this.root = new Node();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e9076871ce78d9241af6e45c4c6e517\",\n \"score\": \"0.6522037\",\n \"text\": \"@Override\\r\\n public AVLNode<T> getRoot() {\\n return root;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5caf0776ad1de9473b912a1f69904876\",\n \"score\": \"0.651949\",\n \"text\": \"public AVLNode<T> getRoot() {\\n return root;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4af027f27410f59457890a1d09346e68\",\n \"score\": \"0.65071714\",\n \"text\": \"public Node() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4af027f27410f59457890a1d09346e68\",\n \"score\": \"0.65071714\",\n \"text\": \"public Node() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4af027f27410f59457890a1d09346e68\",\n \"score\": \"0.65071714\",\n \"text\": \"public Node() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d8c3e173637476b03cf0a41d02c52271\",\n \"score\": \"0.65016526\",\n \"text\": \"public BinaryTree()\\n\\t{\\n\\t\\troot = null;\\n\\t\\tnumberOfNodes = 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63c9b16064a2ab0e87fade87bded8a26\",\n \"score\": \"0.64909625\",\n \"text\": \"public BST() {\\n sentinel = new Node(null, null);\\n root = sentinel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f680b8dd81160d8f4e92d622689cb1da\",\n \"score\": \"0.64885676\",\n \"text\": \"public S5droidTree() {\\n root = new Node();\\n root.startLine = 0;\\n root.endLine = Integer.MAX_VALUE;\\n root.isBlock = true;\\n root.children = new ArrayList<>(256);\\n curr = root;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d59298587d6a79a1497b5f079e1be0d\",\n \"score\": \"0.6480616\",\n \"text\": \"public BinaryTree() {\\n root = null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"671092d30720418fdd56ddd8a511d42a\",\n \"score\": \"0.64578396\",\n \"text\": \"public Node getRoot(){\\n return root;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e6b57c56e6b54c431e8253e904b6cdb\",\n \"score\": \"0.6448742\",\n \"text\": \"public Node<T> getRoot() {\\n\\t\\treturn root;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e6b57c56e6b54c431e8253e904b6cdb\",\n \"score\": \"0.6448742\",\n \"text\": \"public Node<T> getRoot() {\\n\\t\\treturn root;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae9efe285657890186bf87b660d2ee30\",\n \"score\": \"0.6448081\",\n \"text\": \"public Node getRoot() {\\n\\t\\treturn root;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae9efe285657890186bf87b660d2ee30\",\n \"score\": \"0.6448081\",\n \"text\": \"public Node getRoot() {\\n\\t\\treturn root;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae9efe285657890186bf87b660d2ee30\",\n \"score\": \"0.6448081\",\n \"text\": \"public Node getRoot() {\\n\\t\\treturn root;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52c05343d8732e1c227d98e2b3680a74\",\n \"score\": \"0.6447325\",\n \"text\": \"public DirectoryTree(){\\r\\n root = new DirectoryNode();\\r\\n root.setName(\\\"root\\\");\\r\\n cursor = root;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"56c835b52033124b526ef1a34ffdbd95\",\n \"score\": \"0.6443491\",\n \"text\": \"@Override\\n public AVLNode<T> getRoot() {\\n return root;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"56c835b52033124b526ef1a34ffdbd95\",\n \"score\": \"0.6443491\",\n \"text\": \"@Override\\n public AVLNode<T> getRoot() {\\n return root;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de1a6c261fb8dee3a1dbf87cf369e58b\",\n \"score\": \"0.6420139\",\n \"text\": \"public RBTree() {\\n root = null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b0db95136d66cd4d9c928e8c3ee4afd\",\n \"score\": \"0.63996685\",\n \"text\": \"public Node getRoot() {\\n return root;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b0db95136d66cd4d9c928e8c3ee4afd\",\n \"score\": \"0.63996685\",\n \"text\": \"public Node getRoot() {\\n return root;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55df715f863ed764c4708ea1b4aa7fbc\",\n \"score\": \"0.63891315\",\n \"text\": \"public Node() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6898cab99ebc2e8e6f4a5e9683e452aa\",\n \"score\": \"0.638308\",\n \"text\": \"public BinaryNode getRoot() {\\n\\t\\treturn root;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0bf6a2896089560533d1d5fb81713197\",\n \"score\": \"0.6373276\",\n \"text\": \"public HeterogeneousNode getRoot() {\\r\\n\\t\\treturn root;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c0cec899b602037904a93a823d4adfe6\",\n \"score\": \"0.6372826\",\n \"text\": \"public KdTree() {\\n this.root = null;\\n this.rect = new RectHV(0.0, 0.0, 1.0, 1.0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4244cc777d3798ad923e352285283302\",\n \"score\": \"0.6371072\",\n \"text\": \"Node getRoot()\\n {\\n return root;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da41e588e7bfa956e6b3a7687b7e8fbd\",\n \"score\": \"0.6370934\",\n \"text\": \"public BST() {\\n\\t\\troot = null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c10a2d35e22642e3df7d58bfb28f19a1\",\n \"score\": \"0.63702476\",\n \"text\": \"public Root(String rootName, String NodeName, String element,int address) {\\n\\t\\tsuper(NodeName, element,address);\\n\\t\\tthis.rootName = rootName;\\n\\t\\tstoreageNodes = new ArrayList<Node>();\\n\\t\\tstorageEdges = new ArrayList<Edge>();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8c8161c2bccbba8daef82ba8c68d6e6\",\n \"score\": \"0.63655055\",\n \"text\": \"public Root(String rootName,String NodeName, String element) {\\n\\t\\tsuper(NodeName, element);\\n\\t\\t// TODO Auto-generated constructor stub\\n\\t\\tthis.rootName = rootName;\\n\\t\\tstoreageNodes = new ArrayList<Node>();\\n\\t\\tstorageEdges = new ArrayList<Edge>();\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e157ee1a9519067dacfab1f3438450d\",\n \"score\": \"0.6361997\",\n \"text\": \"public Node getRoot();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0200af48e3e2c310322fbfdb3e86a9d9\",\n \"score\": \"0.6359166\",\n \"text\": \"public KdTree() {\\n\\t\\tsize = 0;\\n\\t\\troot = null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa619cbb45d7835915af0b35c1adaf34\",\n \"score\": \"0.633779\",\n \"text\": \"public AVLNode getRoot() {\\n return this.root;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cbc1cfef0f05da3282751a9ca8cfd598\",\n \"score\": \"0.6334677\",\n \"text\": \"public BinaryTree(){\\r\\n root = null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3ba9c49221e07e620f41e292023c558\",\n \"score\": \"0.6315899\",\n \"text\": \"public Node<T> getRoot()\\r\\n {\\r\\n return root;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2fa945b46228613d07f95210027288b7\",\n \"score\": \"0.6307858\",\n \"text\": \"public TupleNode getRoot(){\\r\\n\\t\\t\\treturn root;\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a42c663d54d43c5ec0d61996eaf2e5d5\",\n \"score\": \"0.63075036\",\n \"text\": \"public KdTree() {\\n root = null;\\n size = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19bd80e874821202dacb49672a44688f\",\n \"score\": \"0.6299864\",\n \"text\": \"Node()\\n {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a091dedc7eea2a6eeeaa2b84679c0b4\",\n \"score\": \"0.6279005\",\n \"text\": \"public AVLTree() {\\n\\t\\tthis.root = null;\\n\\t\\tnumOfElements = 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f86849d0d11163ee06364c8635091c21\",\n \"score\": \"0.62784004\",\n \"text\": \"public Trie() {\\r\\n root = new TrieNode(); //root declared as a TrieNode\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b610be4f49908f662e705442a8470f4\",\n \"score\": \"0.6275146\",\n \"text\": \"public Node ()\\n {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b46b624d3d69a6d5de6f02bcb2dc2f6e\",\n \"score\": \"0.6269753\",\n \"text\": \"public BaseTreeNode() {\\n this(\\\"-\\\", 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11b3767f1bf87d46cd1a50c1e634fa8a\",\n \"score\": \"0.6264132\",\n \"text\": \"public BSTree()\\n\\t{\\n\\t\\troot = null;\\n\\t\\tcount = 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e087b0fd9ec3928bbcda9a427732df28\",\n \"score\": \"0.62377506\",\n \"text\": \"Node() \\r\\n {\\r\\n parent = this;\\r\\n left = null;\\r\\n mid = null;\\r\\n right = null;\\r\\n q = null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c878a3eb194645a8a9c8715cefab80c9\",\n \"score\": \"0.62372047\",\n \"text\": \"public CgenNode root() {\\n return get(TreeConstants.Object_);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ea2fa8507fc991f8532a15dc9ac07a0\",\n \"score\": \"0.62263274\",\n \"text\": \"protected AVLNode getRoot() {\\n return (AVLNode) root;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d8b5c89b99c42d1586a8031b95037de\",\n \"score\": \"0.6217051\",\n \"text\": \"public KdTree()\\n {\\n this.root = null;\\n this.size = 0;\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2d201137bee59134449b55c5478c26a\",\n \"score\": \"0.62135994\",\n \"text\": \"public BST()\\n\\t{\\n\\t\\troot = null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7fe9ba10a540e8e99145e11f03f27f7b\",\n \"score\": \"0.62124306\",\n \"text\": \"public ExpressionTree()\\n {\\n root = null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"081e7c67580cbd80addb2fcda44f8c61\",\n \"score\": \"0.6203407\",\n \"text\": \"public BST() {\\n this.root = null;\\n this.size = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e663f47a42d225270664fad9d9cd7e2\",\n \"score\": \"0.62012833\",\n \"text\": \"protected GeneralTree(Node < E > root) {\\r\\n super(root);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40029efbd04342af1328fcf948e6ae5e\",\n \"score\": \"0.6192769\",\n \"text\": \"public HuffNode getRoot() {\\r\\n return root;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26426bfa3a2a6e0ba594e00447d38c3d\",\n \"score\": \"0.61911255\",\n \"text\": \"public RedBlackTree() {\\n\\t\\troot = null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a82059a30e368226dd328899691f2f1e\",\n \"score\": \"0.6190694\",\n \"text\": \"public void setRoot(Node root){\\n this.root = root;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1db4b4410793d2735da0f3f4a56adfad\",\n \"score\": \"0.61884356\",\n \"text\": \"public Node()\\n {\\n references = new Node[26];\\n for (int i = 0; i < references.length; i++)\\n {\\n references[i] = null;\\n }\\n prefixes = 0;\\n words = 0;\\n term = new Term(\\\"\\\", 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"651755d24ab8c3c9de6fb2a8a0cfa89d\",\n \"score\": \"0.61730546\",\n \"text\": \"public DefaultTreeNode() {\\r\\n\\t\\tm_numDescendants = 0;\\r\\n m_parentEdge = null;\\r\\n\\t\\tm_parent = null;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5410f102a5fa5712679fd42593933c9\",\n \"score\": \"0.6162497\",\n \"text\": \"public BinaryTree() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6d63a49caf5b0ed0716ef50b83a366e\",\n \"score\": \"0.61611867\",\n \"text\": \"public EvolutionaryTree(){\\n\\t\\troot = new DefaultMutableTreeNode();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab301bb8b7376b25facc7b1d93832f6f\",\n \"score\": \"0.61515325\",\n \"text\": \"@Override\\r\\n\\tpublic Node getRootNode() {\\n\\t\\treturn null;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"25eef8a171642e4331af4d9a8a678f70\",\n \"score\": \"0.61460924\",\n \"text\": \"public void setRoot(Node root) {\\n this.root = root;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"45f1eee7b782b5cb853e791c84947e39\",\n \"score\": \"0.6143614\",\n \"text\": \"public BinaryTree()\\r\\n { this.root = null;\\r\\n this.leftChild = null;\\r\\n this.rightChild = null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d2415024b8aeab52561b4f589859c31\",\n \"score\": \"0.6140033\",\n \"text\": \"public void makeEmpty()\\n {\\n root = new RopeNode(\\\"\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"25219e040488aa1258d2bf232879bf88\",\n \"score\": \"0.6128877\",\n \"text\": \"public Tree(int value){\\n root = new Node(value);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6bb794adfa650c0b9084d2e8e0106e7\",\n \"score\": \"0.61149555\",\n \"text\": \"@Override\\r\\n\\tpublic TreeNode<String> getRoot() {\\r\\n\\t\\treturn root;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5169249f511113829bb12a1a056ac3c9\",\n \"score\": \"0.6112821\",\n \"text\": \"public MagicDictionary() {\\n root=new TreeNode();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7df4fb5e8ca6842b5be8e04ba26b4929\",\n \"score\": \"0.60896116\",\n \"text\": \"public MyBST () {\\n\\t\\troot = null;\\n\\t\\tsize = 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0394209b2b79a8f470c40bea3597bbc4\",\n \"score\": \"0.6089248\",\n \"text\": \"public Node getRoot() {\\n\\t\\treturn this.root;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e2477aa689d64b44e5ab18614824b6a2\",\n \"score\": \"0.6085639\",\n \"text\": \"public BinaryTree() {\\n super();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b20e99dc7634a31d8ee557f4ceea9fb4\",\n \"score\": \"0.6076209\",\n \"text\": \"@Override\\r\\n\\tpublic BinaryTreeNode<Key, Value> getRoot() {\\n\\t\\treturn root;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3da34ad632b8a57c9144651ac6021e14\",\n \"score\": \"0.60740095\",\n \"text\": \"protected static XMLTreeNode createRootNode(XMLTreeModel model, Element actual) {\\r\\n return new XMLTreeNode(model, null, new TreePath(actual), actual, null, null);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"644402bccbf81c416262d99147aac58d\",\n \"score\": \"0.6069921\",\n \"text\": \"public Trie() {\\n root = new Node();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"644402bccbf81c416262d99147aac58d\",\n \"score\": \"0.6069921\",\n \"text\": \"public Trie() {\\n root = new Node();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"644402bccbf81c416262d99147aac58d\",\n \"score\": \"0.6069921\",\n \"text\": \"public Trie() {\\n root = new Node();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11702b4abdf2001935bffbbbb9a7cfdd\",\n \"score\": \"0.6068471\",\n \"text\": \"public Zone() {\\n\\t\\t_parent = null;\\n\\t\\t_id = ROOT;\\n\\t\\t_name = \\\"<root>\\\";\\n\\n\\t\\t// Always belongs to \\\"self\\\"\\n\\t\\t//\\n\\t\\t_isSelf = true;\\n\\n Zones.setRoot(this);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"97c44d22481b492a0fd607c8ad991340\",\n \"score\": \"0.60641295\",\n \"text\": \"public SimpleNode(){\\n\\t\\tvalue = new Node();\\n\\t\\tnext = null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0ad61243f5cc641d88924da0687a7a99\",\n \"score\": \"0.60536075\",\n \"text\": \"public Dictionary()\\n\\t{\\n\\t\\t// Set next index to 0\\n\\t\\t_nextIndex = 0;\\n\\t\\t// Use next index to create root node\\n\\t\\t_root = new Node(_nextIndex, (byte)0);\\n\\t\\t// Increase next index \\n\\t\\t_nextIndex++;\\n\\t\\t// Set current node to root node\\n\\t\\t_current = _root;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9538afe73128f5b707d426371ee151a8\",\n \"score\": \"0.6052884\",\n \"text\": \"public Trie() {\\n root = new TrieNode();\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":9837,"numItemsPerPage":100,"numTotalItems":995064,"offset":983700,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTUwNzQ4Miwic3ViIjoiL2RhdGFzZXRzL250aGFrdXIvY29ybnN0YWNrLWphdmEtdjEtdGV2YXRyb24tMU0iLCJleHAiOjE3Nzk1MTEwODIsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.8O4a4ulJ_z3UjmQsfayyDNXwWB_KT26ltmyrir_L7FEZDn9iIWRC63xeFYDQBmKRMgviVrhwatYkyJFrqSxGAg","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 |
|---|---|---|---|
6470a46cb8daf30cc9ea06d2f442c03f | / access modifiers changed from: packageprivate | [
{
"docid": "8b1dc6597b1fd686492241904b2e0ff1",
"score": "0.0",
"text": "public void rename(String str) {\r\n if (needsSyncData()) {\r\n synchronizeData();\r\n }\r\n this.name = str;\r\n reconcileDefaultAttributes();\r\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... |
108165e0628bf16831c0c6beda89f468 | Broadcast packet to all visible players. | [
{
"docid": "72a11e28a7133eeaa35457610230130e",
"score": "0.58621013",
"text": "public static void broadcastPacket(final Player player, final AionServerPacket packet, final boolean toSelf) {\n\t\tif(toSelf) {\n\t\t\tsendPacket(player, packet);\n\t\t}\n\n\t\tbroadcastPacket(player, packet);\n\t}",
"ti... | [
{
"docid": "bb1371d26e7107649c4bdb5037b2b743",
"score": "0.76351655",
"text": "private void broadcastPlayers(DatagramPacket packet) {\n\t\tint port = packet.getPort();\n\t\tInetAddress address = packet.getAddress();\n\t\tServerClient associatedID;\n\t\tbyte[] playerAttributes;\n\n\t\tfor (HashMap.Entry<... |
515eb6a82c94911393db7df294f1b70d | Lanzado cada vez que el proveedor cambia su estado, que puede variar entre OUT_OF_SERVICE, TEMPORARILY_UNAVAILABLE, AVAILABLE. | [
{
"docid": "1c9b8e1b11d1bf40bba159e05c237d85",
"score": "0.0",
"text": "@Override\n\t\t\tpublic void onStatusChanged(String provider, int status, Bundle extras) {\n\t\t\t\tLog.i(\"LocAndroid\", \"Provider Status: \" + status);\t\t\t\t\n\t\t\t}",
"title": ""
}
] | [
{
"docid": "edfae7ac3b31bcf70379957c47b0f213",
"score": "0.60192835",
"text": "public boolean isOperational();",
"title": ""
},
{
"docid": "709b24d0dd350e679c4116d14503b9e6",
"score": "0.5900967",
"text": "public IsUseEnum getStatus() {\n return status;\n }",
"title": "... |
8f5f7f533b3e80189096f29811d42649 | Extract the first String that can be identified from a component. | [
{
"docid": "89bdb56660602fc4cf03b659c6565dff",
"score": "0.4972539",
"text": "public static String getText(Component component) {\n\t\tif (component instanceof JTextComponent)\n\t\t\treturn ((JTextComponent) component).getText();\n\t\tif (component instanceof JLabel)\n\t\t\treturn ((JLabel) component).g... | [
{
"docid": "c61f746080af736eef356612192d82c2",
"score": "0.6236541",
"text": "Optional<String> firstPart();",
"title": ""
},
{
"docid": "38bc571930d9968443e76927ea08cfab",
"score": "0.5888531",
"text": "public String first() {\n if (parts.size() > 0)\n return parts.... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "14444c5743b576d3661a13e58b9baaca",
"score": "0.0",
"text": "@Override\r\n\tpublic boolean login(String uid, String password) {\n\t\treturn false;\r\n\t}",
"title": ""
}
] | [
{
"docid": "81005989525ec80103fbaf46f9c37779",
"score": "0.6695466",
"text": "@Override\n\tpublic void agit() {\n\n\t}",
"title": ""
},
{
"docid": "0b5b11f4251ace8b3d0f5ead186f7beb",
"score": "0.65689754",
"text": "@Override\n\tpublic void comer() {\n\t\t\n\t}",
"title": ""
},
... |
6f3982aff22c8bd231f9b2ff723a8f1a | Returns the receiver's inmemory map of MDReqID to request instrument. | [
{
"docid": "b48990d7f37a57fa02d21209e53925ac",
"score": "0.73197246",
"text": "private Map<String,Instrument> getReqIDMap()\r\n {\r\n return mReqIDMap;\r\n }",
"title": ""
}
] | [
{
"docid": "12ed40f9c2ab189091569229c6748f66",
"score": "0.6223404",
"text": "private Map<Instrument,Message> getInstrumentMap()\r\n {\r\n return mInstrumentMap;\r\n }",
"title": ""
},
{
"docid": "7bedd42bb44a82561a41d6f422f05993",
"score": "0.5973486",
"text": "protecte... |
5e185150f8b61ce5105970ef4a853eb6 | This method is called from within the constructor to initialize the form. WARNING: Do NOT modify this code. The content of this method is always regenerated by the Form Editor. | [
{
"docid": "b6d8be9957b255c79ca2dd0a5ef07175",
"score": "0.0",
"text": "@SuppressWarnings(\"unchecked\")\n // <editor-fold defaultstate=\"collapsed\" desc=\"Generated Code\">//GEN-BEGIN:initComponents\n private void initComponents() {\n\n jPanel1 = new javax.swing.JPanel();\n jLabel1... | [
{
"docid": "5f8540ed063cf75672e07098d5395e1e",
"score": "0.76998043",
"text": "private void initComponents() {//GEN-BEGIN:initComponents\n\n }",
"title": ""
},
{
"docid": "37a5472d5b0f35cf64a077bc1dd978c4",
"score": "0.73206544",
"text": "public Form() {\n initComponents();... |
d320c644abc41b08933b53b2a8a19c80 | Request to send data | [
{
"docid": "01d0eb1e1ce35e53aa263fcc74b58a64",
"score": "0.0",
"text": "private void sendDataToPhpDatabase(final PersonModel model, final View view) {\n StringRequest insertRequest = new StringRequest(Request.Method.POST, getResources().getString(R.string.insert_new_person), new Response.Listener... | [
{
"docid": "2bbadc8b804e3d9a1a6c44f76ff38181",
"score": "0.72153926",
"text": "protected byte[] request(byte[] data)\n {\n socket.send(data);\n return socket.recv();\n }",
"title": ""
},
{
"docid": "63d5d43d0fbdfc7063fa4f6b1deab67e",
"score": "0.6839205",
"text": ... |
b31c0f30c4d655a436f92fd466972f14 | Devuelve la cantidad de duplas que hay en la tabla | [
{
"docid": "e7dfe3d45e311972c72e1fb33cc963b5",
"score": "0.0",
"text": "public int getN(){\n\t\treturn sizeN;\n\t}",
"title": ""
}
] | [
{
"docid": "49d98a07a692adf5c6480b872bdfbf29",
"score": "0.63496953",
"text": "public int getNumberDuplicateRecords() {\n return numberDuplicateRecords;\n }",
"title": ""
},
{
"docid": "067ea1fdc5234f217e942bf08c308abd",
"score": "0.6054125",
"text": "int getInputItemDupeCo... |
9daf8dde0349c6191588f854aec8ea26 | constructors Constructor for circle | [
{
"docid": "e21cfbc023469cfe271d3aaa35f36d08",
"score": "0.79852176",
"text": "public Circle(int radius)\r\n\t{\r\n\t\tthis.radius = radius;\r\n\t}",
"title": ""
}
] | [
{
"docid": "45bf41d4f854b4d4835489e82ddfdc67",
"score": "0.8644068",
"text": "public Circle(){\n this(DEFAULT_X, DEFAULT_Y, DEFAULT_COLOR, DEFAULT_RADIUS);\n\n }",
"title": ""
},
{
"docid": "753b73ab17639512f3323982fb209d0f",
"score": "0.8566302",
"text": "public Circle(){\... |
3cc21096b6eca779a688539d1968913e | Handle action bar item clicks here. The action bar will automatically handle clicks on the Home/Up button, so long as you specify a parent activity in AndroidManifest.xml. | [
{
"docid": "2d7d5b9a550bb258b680a9b860c017a8",
"score": "0.0",
"text": "@Override\n\tpublic boolean onOptionsItemSelected(MenuItem item) {\n\t\tint id = item.getItemId();\n\t\tif (id == R.id.action_settings) {\n\t\t\treturn true;\n\t\t}\n\t\treturn super.onOptionsItemSelected(item);\n\t}",
"title": ... | [
{
"docid": "a14fb57b2097bc7f79b9b27f92a2d60b",
"score": "0.79093057",
"text": "@Override\n public boolean onOptionsItemSelected(MenuItem item) {\n\n\n\n switch (item.getItemId()) {\n case android.R.id.home:\n // app icon in action bar clicked; go Home\n ... |
4776f5a93ab932206e8c6301421031cf | Sets this object's ThreadPool field to be the input argument | [
{
"docid": "a2a8b5fd76089f7e1130cd97cc425748",
"score": "0.0",
"text": "public void initializeDownloaderTask(ImageManager photoManager, MyImageView imageView, boolean cacheFlag) {\n sPhotoManager = photoManager;\n\n // Instantiates the weak reference to the incoming view\n mImageWea... | [
{
"docid": "6f03d92827a8b41756d91a9c97c22861",
"score": "0.6969834",
"text": "public void setThreadPoolSize(int threadPoolSize);",
"title": ""
},
{
"docid": "8a59dceacc4520a7aec7deab5de10a4d",
"score": "0.6780708",
"text": "ThreadPool getThreadPool( ThreadPool pool );",
"title": ... |
6eb24511764ddf261389d0943ad588e7 | Provide a suitable constructor (depends on the kind of dataset) | [
{
"docid": "248de70b01e4225b12cf976726d397d7",
"score": "0.0",
"text": "public MovieAdapter(List<MovieModelView> movieModelViews) {\n this.movieModelViews = movieModelViews;\n }",
"title": ""
}
] | [
{
"docid": "4143bb3cf91dad64de4b889d78c4f2b3",
"score": "0.6370994",
"text": "public Data() {}",
"title": ""
},
{
"docid": "a237ba1fad16996fb9f286962c5abb94",
"score": "0.6367306",
"text": "public Datum() {\n }",
"title": ""
},
{
"docid": "a237ba1fad16996fb9f286962c5ab... |
6e6ac07b696369918f7d9c32afd6263a | Write code here that turns the phrase above into concrete actions | [
{
"docid": "f6fe8b3832e27d7e2c9fa20a59b18e9c",
"score": "0.0",
"text": "@When(\"^the user open Automation Home page$\")\r\n\tpublic void the_user_open_Automation_Home_page() throws Throwable {\n\t w.Homepage1();\r\n\t}",
"title": ""
}
] | [
{
"docid": "1a63d124077e30a2530ceb97570d4849",
"score": "0.6989324",
"text": "abstract protected String performAction(String input);",
"title": ""
},
{
"docid": "2b24799cfbae9a2538024b8515e67eb8",
"score": "0.64658433",
"text": "@Override\r\n\tpublic void action() {\n\t\t\r\n\t}",
... |
c21e9926e29c0a99d8eff0f6215250cc | Log.d(TAG, "ActivitySaveInstanceState" + activity.getClass().getSimpleName()); | [
{
"docid": "b407e207c0845fc1512f02a132b008f0",
"score": "0.78357136",
"text": "@Override\n public void onActivitySaveInstanceState(Activity activity, Bundle outState) {\n }",
"title": ""
}
] | [
{
"docid": "984240a9af06ac63f3a76ffeec2fb76a",
"score": "0.8171431",
"text": "@Override\n public void onActivitySaveInstanceState(Activity activity, Bundle outState) {\n }",
"title": ""
},
{
"docid": "3e99c8c1cc6d066de33c4a68dd7b3a4c",
"score": "0.7789171",
"text": "@Override\n... |
1f54d08673eb637b0f00791bcb4938d3 | $ANTLR end "rule__XFeatureCall__Group__0__Impl" $ANTLR start "rule__XFeatureCall__Group__1" ../de.nie.fin.ui/srcgen/de/nie/fin/ui/contentassist/antlr/internal/InternalFin.g:13119:1: rule__XFeatureCall__Group__1 : rule__XFeatureCall__Group__1__Impl rule__XFeatureCall__Group__2 ; | [
{
"docid": "e56282ed0d68b358da1201c1dd333173",
"score": "0.7855651",
"text": "public final void rule__XFeatureCall__Group__1() throws RecognitionException {\r\n\r\n \t\tint stackSize = keepStackSize();\r\n \r\n try {\r\n // ../de.nie.fin.ui/src-gen/de/nie/fin/ui/conte... | [
{
"docid": "22cdbb3a1819d76f46db91adb1d886e8",
"score": "0.80141073",
"text": "public final void rule__XFeatureCall__Group__1() throws RecognitionException {\n\n \t\tint stackSize = keepStackSize();\n \n try {\n // ../org.xtext.lwc.instances.ui/src-gen/org/xtext/lwc/i... |
f61336599c4402844d77aaae120438f3 | Validates entry fields according to current mode. | [
{
"docid": "06d0523f2d695ce4798283d9bd1759a9",
"score": "0.5357446",
"text": "public boolean validate() throws Exception {\r\n String mode = _mode == null ? \"\" : _mode;\r\n if (mode.equals(\"add\")) {\r\n // Verify row with duplicate primary key combination does not exist.\r\n... | [
{
"docid": "824355bc06da5f6486b394d213bdec12",
"score": "0.7294962",
"text": "private boolean checkForValidEntry() {\n\t\tif (gameDescriptionArea.getText().isEmpty()) {\n\t\t\treturn false;\n\t\t}\n\t\tfor (int i = 0; i < textfields.length; i++) {\n\t\t\tif (textfields[i].getText().isEmpty()) {\n\t\t\t\... |
6e7ecccebd1f008b27458a9b6c8db095 | repeated .CMsgDOTATournamentInfo.PhaseGroup group_list = 7; | [
{
"docid": "490db29d4ca0b10095bdb7fc09eeacae",
"score": "0.5856251",
"text": "public java.util.List<? extends MsgGCClientTournament.CMsgDOTATournamentInfo.PhaseGroupOrBuilder>\n getGroupListOrBuilderList() {\n if (groupListBuilder_ != null) {\n return groupListBuilder_.ge... | [
{
"docid": "348b4c9b850c9e43e885f7096f92ac74",
"score": "0.7020135",
"text": "MsgGCClientTournament.CMsgDOTATournamentInfo.PhaseGroup getGroupList(int index);",
"title": ""
},
{
"docid": "8978b7e0442e47250b0266a68d1dc1f7",
"score": "0.66316587",
"text": "java.util.List<MsgGCClientTou... |
4c4f505899d703a17e610abd655484a4 | Initializing the DatagramSocket Class. | [
{
"docid": "25919f5d46b347fc8d9f6eef78b9f5e1",
"score": "0.0",
"text": "public static void main(String[] args) throws IOException \r\n\t{\n\t\tDatagramSocket Socket = new DatagramSocket(1019);\r\n\t\t\r\n\t\t// Declaring and Initializing a byte array.\r\n byte[] get_Byte = new byte[70800];\r\n\r\... | [
{
"docid": "fe1d391fd5a2be478c2d081b320707d8",
"score": "0.7179974",
"text": "void setUpSocket() throws IOException {\n socket = new DatagramSocket(port);\n}",
"title": ""
},
{
"docid": "531f9022e3445c1c356b686b72ac72f0",
"score": "0.701001",
"text": "private static void initializ... |
0a31527f846b0d0ad7daf4413e6cc29d | Receive message from socket channel. | [
{
"docid": "01ef8889c936648f1d232b545adf4c5a",
"score": "0.58801186",
"text": "synchronized boolean receive() throws IOException {\n if (this.ch == null) {\n logger.debug(this.name + \"> no channel\");\n return false;\n }\n\n int len = 0;\n ByteBuffer bu... | [
{
"docid": "6eed7f66782712540c2dc9eff1a09cd8",
"score": "0.7066527",
"text": "void receive(String channel, String message, String senderId);",
"title": ""
},
{
"docid": "993cb6ae4c5bf68e871583a87daec272",
"score": "0.7041523",
"text": "protected boolean receive(SocketChannel socket) ... |
5dd517b05b47f9c6d985cfadf5e8b05e | The method uploads multiple files into the server and returns back with a zipped file with all the contents | [
{
"docid": "8093881d048d248ad9e24f45cd17d807",
"score": "0.7414424",
"text": "@ApiOperation(value=\"uploads a list of files and responds with a zip\")\n\t@RequestMapping(value = \"/uploadMultiFile\", method = RequestMethod.POST,produces=\"application/zip\")\n\tpublic ResponseEntity<Resource> submit(@Req... | [
{
"docid": "3d6b07eaa51546bc243ffaf27d496693",
"score": "0.683168",
"text": "@Override\n public void run(String... args) {\n String[] files = new String[]{\"one.jpg\"};\n assembleZip(files, \"zipFile.zip\");\n\n//Upload file\n// s3Services.uploadFile(\"one.jpg\", \"/9j/4AAQSkZJRg... |
f6c6ae36d6f3d0ba52d7176ea201ec5a | repeated string order_hashes = 1; | [
{
"docid": "ed488b27dc7e377b68830df419ae6728",
"score": "0.64394736",
"text": "int getOrderHashesCount();",
"title": ""
}
] | [
{
"docid": "e93de436d0cbada6930984e87766e0f8",
"score": "0.6968184",
"text": "java.lang.String getOrderHashes(int index);",
"title": ""
},
{
"docid": "e93de436d0cbada6930984e87766e0f8",
"score": "0.6968184",
"text": "java.lang.String getOrderHashes(int index);",
"title": ""
},
... |
acd37caebbcd17817b9a4facbe2bfb71 | Replace the contents of a view (invoked by the layout manager) | [
{
"docid": "c1d367a36d89ccff8ba271341faa53e5",
"score": "0.0",
"text": "@Override\n public void onBindViewHolder(ViewHolder viewHolder, final int position) {\n\n // Get element from your dataset at this position and replace the\n // contents of the view with that element\n ImageC... | [
{
"docid": "3862e7e39156a10ad114a82910b94362",
"score": "0.7053408",
"text": "public abstract void updateView(View view);",
"title": ""
},
{
"docid": "88506303966ca71030f14b6644ff73cb",
"score": "0.7008885",
"text": "void setView(View view);",
"title": ""
},
{
"docid": "3... |
913d0a0682896c366b4a73cd3b64ce87 | Instantiates a new service. | [
{
"docid": "53d248bdc9013f4ead95c8abd4a657b7",
"score": "0.6354939",
"text": "public Service() {\r\n name = null;\r\n maximumCapacity = 0;\r\n }",
"title": ""
}
] | [
{
"docid": "ade9fabba4fb2fb53f2a5086043d1e00",
"score": "0.72381103",
"text": "public service() {\n }",
"title": ""
},
{
"docid": "c98f669f13c9e4e348d0f0962540bc93",
"score": "0.71500397",
"text": "public HelloService()\n\t{\n\t\tSystem.out.println(\"***** HelloService instance cr... |
e24ca4a509bd8b7ed61e43f57c7b1317 | Metodo con complejidad n cuadratica. | [
{
"docid": "28bebfe78bac1470df07936b2f8f39ae",
"score": "0.6907173",
"text": "public void cuadratica1(int n) {\n\t\tfor (int i=0; i<=n; i++) {\n\t\t\tfor(int j=0; j<=n; j++) {\n\t\t\t\tSystem.out.println(\"Ejecutando...\"+ i + \" \"+ j);\n\t\t\t}\n\t\t}\n\t}",
"title": ""
}
] | [
{
"docid": "b6b077ae73271a5dc00fd0378a977a4c",
"score": "0.6552724",
"text": "public static int trinome (int n) { return 2*n*n + 3*n + 5 ; }",
"title": ""
},
{
"docid": "fbabb2aa4b02faac3fcbd0c45bea8e09",
"score": "0.6341282",
"text": "public void cuadratica2(int n) {\n\t\tfor (int i... |
21c72d330623d7b82d82d4a7a18f3e99 | Checks if the CommandArgumentList has all of the command arguments another CommandArgumentList has | [
{
"docid": "663d0603477856b1813924519b0a5fbb",
"score": "0.7822411",
"text": "public boolean hasArgument(@NotNull CommandArgumentList arguments) {\n for (CommandArgument command : arguments) {\n if (!this.hasArgument(command)) {\n return false;\n }\n }\... | [
{
"docid": "8a6eae4687af08994238997f1d361031",
"score": "0.69343185",
"text": "private boolean checkArguments(ApplicationArguments args) {\n if (args.getNonOptionArgs().contains(\"help\")) {\n logHelp();\n return false;\n }\n if (!args.containsOption(\"file\"))... |
e45419c24e32ba4e305c163104d3f89b | Get the debug value. | [
{
"docid": "e6dd33989289cc1ba901dacfd58228e4",
"score": "0.609497",
"text": "public List<ResponseDebugInfo> debug() {\r\n return this.debug;\r\n }",
"title": ""
}
] | [
{
"docid": "167bddc30853846464cff6b642ae7215",
"score": "0.7261418",
"text": "protected Debug getDebug()\n {\n return ioRoot.dbgOpt1;\n }",
"title": ""
},
{
"docid": "3f2f69e860102d38ca18e24d93323913",
"score": "0.69830304",
"text": "public int getDebugLevel()\n {\n return _... |
fdd7060a224844fabda7db0b56b54721 | Get a description of the object | [
{
"docid": "9711deedd04f2bd4077eae39e9f8406a",
"score": "0.0",
"text": "public String getDescription() {\n\treturn \"A set of pixel values along with a description of where in the sky they come from.\";\n }",
"title": ""
}
] | [
{
"docid": "80a549e616629280e5a74b6dd4191560",
"score": "0.83319736",
"text": "Object getDescription();",
"title": ""
},
{
"docid": "a00ff2c2c4bf45578af4ab728367a07c",
"score": "0.80087197",
"text": "String description();",
"title": ""
},
{
"docid": "a00ff2c2c4bf45578af4a... |
4254f3b9fbda84b705a9e93c4681483d | Functie voor het inserten van een nieuwe afspeellijst. | [
{
"docid": "0bf4cebaa9dd4cdb124a74ff0475206d",
"score": "0.0",
"text": "public static boolean insertAfspeellijst(int profileId, String naam) {\n try {\n\n Connection conn = maakVerbinding();\n if (!verbinding) return false;\n\n String query = \"INSERT INTO afspeel... | [
{
"docid": "ce73b4f3d92944f6b32b5ba54f845f1a",
"score": "0.7531594",
"text": "@Override\r\n\tpublic void insertar() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "68cd08567dc817d9c8b538221b9e104a",
"score": "0.71675587",
"text": "@Override\n\tpublic void insert() {\n\t\t\n\t}",
"tit... |
fdf6190b18762479bd4fd44cfb13d5e3 | Gets the hash code of this abstract planner properties bean based on its aggregated properties. | [
{
"docid": "0df7f8de5455e30cd2ddb6fa40586d0f",
"score": "0.0",
"text": "@Override\n\tpublic int hashCode() {\n\t\treturn Objects.hash(this.costPolicy, this.riskPolicy);\n\t}",
"title": ""
}
] | [
{
"docid": "ee89229c52d3e2f603ecd4d7d48a134e",
"score": "0.6817831",
"text": "public int computeHashCode() {\n\t\t\t//-----------------------------------------\n\t\t\t// Regular State\n\t\t\t//-----------------------------------------\n\t\t\t//Only battery values for the current agent matters\n\t\t\tObj... |
29d747312158f0c1e6fff13dec1fd7bc | Processes each line of the input source. | [
{
"docid": "fde364182e80b3290973cc8fc4baf955",
"score": "0.58149576",
"text": "public abstract void processInput(final InputSource input) throws IOException, SAXException;",
"title": ""
}
] | [
{
"docid": "004b7010872a1bf3cd96993aa524a13e",
"score": "0.6858976",
"text": "@Override\n\tpublic void preProcessLine(String line) throws LineFilter.FilterException {\n\t\tfor (String outLine : processLine(line)) {}\n\t}",
"title": ""
},
{
"docid": "f1bd67de99928e3e07cb0e3e08972583",
"sc... |
ed8e071c34c6a73e00fd0599977fb5f5 | Backported to support Grails < 2.4 | [
{
"docid": "147610ff99b7afc335128f2e19b83a3b",
"score": "0.0",
"text": "public static String userlandGetMemberStringValue(AnnotationNode node, String name, String defaultValue) {\n final String STRING = \"<DummyUndefinedMarkerString-DoNotUse>\"; // from groovy.transform.Undefined\n final E... | [
{
"docid": "2a550f8458794d16824f204804d00e1c",
"score": "0.48920792",
"text": "@Override\n public void visitClassContext(ClassContext classContext) {\n }",
"title": ""
},
{
"docid": "39132efb6b42f8ec625d96ff6226d80b",
"score": "0.488085",
"text": "@Override\n\tprotected void la... |
bc971becf67876083231d5b92feb2949 | System.out.println("in handling " + isConfirmed); | [
{
"docid": "0f1ffe9945f5d27b1d38a65acb5ee569",
"score": "0.0",
"text": "@Override\n public RawDecree handle(Segment parcel) throws CommandSyntaxException {\n if (isConfirmed) {\n return nextHandler.handle(parcel);\n }else {\n boolean isLimited = false;\n ... | [
{
"docid": "5cd643a94e2874bc8d5fd4782f3da137",
"score": "0.7594672",
"text": "boolean isConfirmed();",
"title": ""
},
{
"docid": "40076f5f384e0ddf7fa0d535e72196cd",
"score": "0.65924776",
"text": "public Boolean isConfirmed() {\n return confirmed;\n }",
"title": ""
},
{
... |
690a1454403d70cc1690030b232c1ed8 | Metodo para remover um elemento da Lista | [
{
"docid": "c8d344337870448920c23334c57c840e",
"score": "0.8037496",
"text": "public void remover(Elemento e);",
"title": ""
}
] | [
{
"docid": "2493de7e320cf0ec834207c6145c8310",
"score": "0.7640619",
"text": "public static void remover() {\n WEvento.listar();\n WEvento.confirmar_Id();\n\n for (int i = 0; i < WEvento.list.size(); i++) {\n if (WEvento.list.get(i).getEvento_ID() == opcao) {\n ... |
39c3340957cc47868f1350593bf0bf65 | Metodo che scrive all'interno di un pdf | [
{
"docid": "914f27f8508e516ec34495a965d3ebcf",
"score": "0.6364216",
"text": "private void createDocument(float x, float y, String text){\n File pdf = new File(this.fileName);\n try {\n PDDocument doc = PDDocument.load(pdf);\n PDPage page = doc.getPage... | [
{
"docid": "7e0cd81130d4b295f36dfd673b39b5ba",
"score": "0.7343678",
"text": "public void MostraPDF() {\n\t\tControladorDocumentacio.obreManualPDF();\n\t}",
"title": ""
},
{
"docid": "43ac9c9c1f64c20391d90a4b02b0e0a7",
"score": "0.71455646",
"text": "public void pdfPrestamos() throws... |
4832a1f4c7008e6e77d51a8ac4cc42b3 | Creates a 1D texture out of 4D Simplex Noise. NOTE : This method produces a greyscale image. It calculates the value of each channel as the scaled 0255 range value from the output from a 2D Simplex function. | [
{
"docid": "659dbd413bd1b725f23f5401d076dcbb",
"score": "0.5134344",
"text": "public Texture(int width, float xOffset, float yOffset, float zOffset, float wOffset, float xIncrement) {\r\n\t\txOffset = Maths.max(xOffset, 0);\r\n\t\tyOffset = Maths.max(yOffset, 0);\r\n\t\tzOffset = Maths.max(zOffset, 0);\... | [
{
"docid": "aac44af090284ee5cceb22e2a963bfb3",
"score": "0.5714131",
"text": "public void greyScale(){\n\n double ww[]=new double[3];\n for(int i=0;i<width;i++)\n {\n\n for(int j=0;j<height;j++)\n {\n\n raster.getPixel(i, j, pixels);\n\n ... |
9ed9c9b7aeecf463a30f4de960524b26 | Create an aliased public.node table reference | [
{
"docid": "b6eb3c47b24de31a94ce5f5c760dc4c9",
"score": "0.5424024",
"text": "public Node(Name alias) {\n this(alias, NODE);\n }",
"title": ""
}
] | [
{
"docid": "b2a46916b2e883c969be4e450d3d44e3",
"score": "0.66586787",
"text": "static final public void TableAliasVariable() throws ParseException {\n /*@bgen(jjtree) dbRelAliasName */\n SimpleNode jjtn000 = new SimpleNode(JJTDBRELALIASNAME);\n boolean jjtc000 = true;\n jjtree.openNodeScope(jjtn000);... |
ace6ca956166fce88086b5c8410d4d05 | Sets all game data to hold the values of a new game. | [
{
"docid": "7d4696687550aebca41a2dcc6d450a14",
"score": "0.0",
"text": "public void reset() {\n\t\tthis.cycleCounter = 0;\n\t\tthis.asteroidsLimit = 7;\n this.objects = new ArrayList<>();\n players.forEach((k, p)-> {p.reset(); objects.add(p.getShip());});\n\t}",
"title": ""
}
] | [
{
"docid": "263030e6d6839d400e38af6452e510e7",
"score": "0.7530465",
"text": "private static void initializeGameData() {\n\t\tgameData = new GameData();\n\t\tgameData.loadData();\n\t}",
"title": ""
},
{
"docid": "c41e2abf156e3c83bc49aa9cb0e84c32",
"score": "0.7098804",
"text": "prote... |
a00dcc9dfde3aa44715c980f4722345f | Auto generated setter method | [
{
"docid": "cb639d2769e3be0e0317c02ba51b7b09",
"score": "0.0",
"text": "public void setTipo(java.lang.String param){\r\n localTipoTracker = true;\r\n \r\n this.localTipo=param;\r\n ... | [
{
"docid": "8541b1cf741ee8244d45d2fd755acdb3",
"score": "0.7789626",
"text": "public abstract void set();",
"title": ""
},
{
"docid": "7926260a33dacb33748cc5896367fecc",
"score": "0.7313697",
"text": "public void set()\n\t\t{\n\t\t}",
"title": ""
},
{
"docid": "103930d9bb... |
efdf4a30707dda34fd2c49f35009d085 | Creates a new Linux process representation from another Linux process representation. | [
{
"docid": "0e296262e00bfc0291d3db2deb2f0348",
"score": "0.5890514",
"text": "public LinuxProcessHandle(long pid) {\n _process = LinuxProcess.fromPid(pid);\n }",
"title": ""
}
] | [
{
"docid": "1dc3758c7a8c43291bbf3ccbca3b7e7c",
"score": "0.6550236",
"text": "Process createProcess();",
"title": ""
},
{
"docid": "be60c9a30418a5a1680b25d18c880471",
"score": "0.599367",
"text": "LinuxProcessHandle(LinuxProcess lp) {\n _process = lp;\n }",
"title": ""
... |
09209c01d6229996df42b3133d7ed81c | Set the Alignment property. | [
{
"docid": "a12c6f7e92836a348f66c516373710bc",
"score": "0.8227691",
"text": "public void setAlignment(String value) {\n alignment = value;\n stateChanged();\n }",
"title": ""
}
] | [
{
"docid": "21e3ff81ff91f8a007034a0c1fb4785f",
"score": "0.81482667",
"text": "public void setAlignment (Alignment alignment) {\n this.alignment = alignment;\n repaint ();\n }",
"title": ""
},
{
"docid": "14bce39ef6f3989c5fb1247b0a610037",
"score": "0.8073285",
"text... |
4c4148105ebe1d76150f857d032093c6 | method getting all recipes from DB. | [
{
"docid": "c08e059b451c8384170423003acf70f7",
"score": "0.7828178",
"text": "@Override\n public List<Recipe> getAll() {\n return transaction((Session session) -> {\n return session.createSQLQuery(\"select * from recipe\").addEntity(Recipe.class).list();\n });\n }",
"t... | [
{
"docid": "f394c39398b8ac24174fdef8179a7491",
"score": "0.806621",
"text": "public List<Recipe> getAllRecipes() {\n List<Recipe> recipes = new ArrayList<>();\n Cursor cursor = database.query(SQLHelper.TABLE_RECIPE, null, null, null, null, null, null);\n cursor.moveToFirst();\n ... |
c45ac26269c3e13f340b68d816d90211 | Getter for the league Vector | [
{
"docid": "789bb5823cdcdd7e40e0a9dc0d9e8779",
"score": "0.8386389",
"text": "public Vector<League> getLeagueVector()\n\t{\n\t\treturn leagues;\n\t}",
"title": ""
}
] | [
{
"docid": "92b889eda81c8f93a16bb589d4f674df",
"score": "0.69773954",
"text": "public Vector getVector() {\n return this.vector;\n }",
"title": ""
},
{
"docid": "01d169252baba2c477d94269a964e4bb",
"score": "0.66798145",
"text": "public Vector<Team> getTeamVector()\n\t{\n\t\tretur... |
06d3e46ce4f3dceb8be1543f12753d18 | optional .PlayerAvatar avatar = 8; | [
{
"docid": "f8cf2a10a9677b2d9d79a71184e343a3",
"score": "0.57670903",
"text": "public Builder setAvatar(\n Pokemon.PlayerAvatar.Builder builderForValue) {\n if (avatarBuilder_ == null) {\n avatar_ = builderForValue.build();\n onChanged();\n } else {\n av... | [
{
"docid": "3b2cb7e45245439d553fa4222997e6a0",
"score": "0.72260714",
"text": "Pokemon.PlayerAvatar getAvatar();",
"title": ""
},
{
"docid": "3145e7d68c21d5aa70c863afabfa783d",
"score": "0.7030081",
"text": "Pokemon.PlayerAvatarOrBuilder getAvatarOrBuilder();",
"title": ""
},
... |
92d52e4527d7c912089eec9a63d49a90 | Creates a new ConfigModel | [
{
"docid": "df35bf3bdb3ea31c98d2919e6fff5be5",
"score": "0.0",
"text": "public static AreaValidator of(Object owner, String name, boolean required) {\n return new Builder(name, owner).setRequired().build();\n }",
"title": ""
}
] | [
{
"docid": "1cb2ce901764756aacd929d0a57cc60d",
"score": "0.67455924",
"text": "Model createModel();",
"title": ""
},
{
"docid": "1cb2ce901764756aacd929d0a57cc60d",
"score": "0.67455924",
"text": "Model createModel();",
"title": ""
},
{
"docid": "1cb2ce901764756aacd929d0a5... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "1a3305986131a89f618abbded826f4a9",
"score": "0.0",
"text": "@Override\n\tpublic int getCount() {\n\t\treturn items.size()+3;\n\t}",
"title": ""
}
] | [
{
"docid": "1acc57d42c31dee937ac33ea6f2a5b0b",
"score": "0.68410474",
"text": "@Override\r\n\tpublic void comer() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "118f2b8a20f48999973063ac332d07d3",
"score": "0.65663373",
"text": "@Override\r\n\t\t\tpublic void atras() {\n\r\n\t\t\t}",
... |
1321ffc2ed33a2872710761e55060078 | Transfers all transferable content from this component to the target component. | [
{
"docid": "ecd72bc8083513a2610bc6c3ac19dee8",
"score": "0.0",
"text": "default void into(ItemComponent target, int count, Direction extractionDirection, Direction insertionDirection) {\n\t\tfor (int sourceSlot = 0; sourceSlot < getSize(); ++sourceSlot) {\n\t\t\tItemStack sourceStack = getStack(sourceSl... | [
{
"docid": "373e6843871c88f928554b2dccfb9d84",
"score": "0.596097",
"text": "public void doTransfer() throws IOException;",
"title": ""
},
{
"docid": "565899ab38d6cca9f90cd2a2faee9cb2",
"score": "0.5774864",
"text": "@Override\n public void transfer() {\n to.clear();\n d... |
d6617bb06477ae281800de35a79196cf | Add an advice for after throwing | [
{
"docid": "7f4badd4f930abd2d12712fba8c95e7c",
"score": "0.62078404",
"text": "@AfterThrowing(\n\t\t\tpointcut=\"execution(* com.vaha1st.aopdemo.dao.AccountDAO.findAccounts(..))\",\n\t\t\tthrowing=\"theExc\")\n\tpublic void afterThrowingFindAccountsAdvice(JoinPoint joinPoint, Throwable theExc) {\n\t\t\n... | [
{
"docid": "26d451943df5de16f57ee210e477f602",
"score": "0.7973285",
"text": "@Override\n protected void afterThrowing(Advice advice) {\n }",
"title": ""
},
{
"docid": "26d451943df5de16f57ee210e477f602",
"score": "0.7973285",
"text": "@Override\n... |
141d5fe985f955d9b0425801b563a1e7 | this is called to return if the algorithm was solved and returns the variable solved. | [
{
"docid": "5b3b258933d794a15aa5e64347ae6440",
"score": "0.73301864",
"text": "@Override\n\tpublic boolean solved() {\n\n\t\treturn solved;\n\t}",
"title": ""
}
] | [
{
"docid": "aaf8c0f4eb092151543b96bf19e9943d",
"score": "0.7319801",
"text": "public int solve() {\n\t\tlong begin_time = System.currentTimeMillis();\n\t\tBoolean unsolvable = grid_unsolvable();\n\t\tif(unsolvable) {\n\t\t\treturn 0;\n\t\t}\n\t\trecursive_helper(0);\n\t\tlong end_time = System.currentTi... |
5cab6933b14776d50d62ab323d42bc31 | TODO fix move references | [
{
"docid": "f4fea66f7f197bf0332efafa11f5d2b7",
"score": "0.0",
"text": "@Override\n\t\tpublic void fromJSON(HashMap<String, Object> json) {\n\t\t\tString evolve = (String) json.get(\"evolvesTo\");\n\n\t\t\tif(evolve != null)\n\t\t\t\tevolvesTo = basePokemon.get(evolve);\n\n\t\t}",
"title": ""
}
] | [
{
"docid": "603f0a18e57250d8f455d8cee02b8630",
"score": "0.59710693",
"text": "@Override\r\n public void Refuel() {\n \r\n }",
"title": ""
},
{
"docid": "95ffa256b098e9b494cb96d4874e063f",
"score": "0.59046334",
"text": "@Override\n\tvoid refuel() {\n\n\t}",
"title":... |
688adb7ea9ed86815706a34cbec26ad8 | EXPERIMENTAL does not work for large T values or polygons near the poles Returns "relative" intersection of aircraft and moving segment, that is the place on the polygon where the intersection will occur. This is not the location in space/time where the actual intersection will occur. To obtain that position, a transla... | [
{
"docid": "62437e14d90c2f59fd5555af8e21ebeb",
"score": "0.5640664",
"text": "public static Position intersectionMovingSegment(Position so, Velocity vo, Position si, \n\t\t\tPosition si2, Velocity vi, double T) {\n\t\t//f.pln(\"\\n $$ intersectionMovingSegment: vo = \"+vo+\" vi = \"+vi+\" T = \"+T);\t ... | [
{
"docid": "81a2408f7e195a5717e9986a632baa91",
"score": "0.59999216",
"text": "public Point interpolate(double t)\n {\n double seg = t * path.length();\n double phi = start.getYaw();\n double v;\n\n Point s = new Point(0, 0, start.getYaw());\n\n if (!path.reverse)\n... |
5fc9377f0703661e37e09ee1380a6a5c | Gets the Module Identifier. | [
{
"docid": "be4fe710f5393009d295742535b83f19",
"score": "0.7450492",
"text": "public int getModuleId() {\n return moduleId;\n }",
"title": ""
}
] | [
{
"docid": "85bf6e5d2bdb5784d70cd50379dccb14",
"score": "0.8150588",
"text": "ModuleIdentifier getModuleIdentifier();",
"title": ""
},
{
"docid": "893096ae0a299ca07774b439e1a6dbb5",
"score": "0.7938339",
"text": "public java.lang.String getModuleID(){\n return moduleId ;\n... |
ba93d4c05f0dabecdc290308233210f4 | / Prints the inventory of a specific ArrayList of objects Uses the generic type T to specify the exact type of item program will be printing the inventory of. | [
{
"docid": "8c684adf87e87c3995daf02d938b178a",
"score": "0.7369638",
"text": "public static <T extends Item> void printInventory(Inventory<T> item) {\n\t\tfor (int i=0; i<item.inventory.size(); i++) {\n\t\t\tSystem.out.println(item.inventory.get(i).toString());\n\t\t}\n\t}",
"title": ""
}
] | [
{
"docid": "2de8186b3e664ad6c550dd4a5f92c6a2",
"score": "0.7503019",
"text": "public void printInventory(){\n // Print Inventory information\n System.out.print(\"Inventory contains: \");\n for(int i = 0; i < itemList.size(); i++){ System.out.print(itemList.get(i).getName() + \" \");... |
34e65aa46c28f0414de436130bdf4cde | Starts this service to perform action Baz with the given parameters. If the service is already performing a task this action will be queued. | [
{
"docid": "0b1a5df82da29b42fc5b98857b33657f",
"score": "0.52202487",
"text": "public static void startActionBaz(Context context, String param1, String param2) {\n Intent intent = new Intent(context, GetPasswordService.class);\n intent.setAction(ACTION_BAZ);\n intent.putExtra(EXTRA_... | [
{
"docid": "e31dffb4aa6f413593b9f71d713feb63",
"score": "0.58378434",
"text": "public void startExecuting()\n {\n super.startExecuting();\n this.archer.setHoldingBow(true);\n }",
"title": ""
},
{
"docid": "db78a89da4b561cc14999d21ef5abb75",
"score": "0.5834824",
"... |
d502bfdd7c93eda22f0d4cd28c66a74d | Generates the implementation application. | [
{
"docid": "92c991de3411675e9c72e3bfda7ff075",
"score": "0.65209466",
"text": "public Application<Task, Dependency> generateImplAppl(Application<Task, Dependency> specAppl) {\n\t\tApplication<Task, Dependency> result = new Application<>();\n\t\t// copy all vertices\n\t\tfor (Task t : specAppl) {\n\t\t\t... | [
{
"docid": "f418fc475a9cd418966476b7d5a76e8c",
"score": "0.65132976",
"text": "@Test\n void codegenHelloWorldApplication() {\n ApplicationCreator creator = this.applicationCreator;\n ServiceInfoCriteria allServices = ServiceInfoCriteria.builder().build();\n\n InjectionServices in... |
1dc8ab04852e2f7b604ff7a2f287c22d | Test the equals() method of the Icmpv6TypeCriterion class. | [
{
"docid": "3122c0f969010c894e70a9e4ed551edb",
"score": "0.80488604",
"text": "@Test\n public void testIcmpv6TypeCriterionEquals() {\n new EqualsTester()\n .addEqualityGroup(matchIcmpv6Type1, sameAsMatchIcmpv6Type1)\n .addEqualityGroup(matchIcmpv6Type2)\n ... | [
{
"docid": "13b18140ed8ad1f2f6015882f6dd4ab0",
"score": "0.7327024",
"text": "@Test\n public void testIcmpv6CodeCriterionEquals() {\n new EqualsTester()\n .addEqualityGroup(matchIcmpv6Code1, sameAsMatchIcmpv6Code1)\n .addEqualityGroup(matchIcmpv6Code2)\n ... |
8baca9a90ecf49c294099f5a9c7b7774 | Unfortunately when TabHost changes the current tab, it kindly also takes care of putting focus on it when not in touch mode. The jerk. This hack tries to prevent this from pulling focus out of our ViewPager. | [
{
"docid": "98ea3948b795013d64267bff3855531f",
"score": "0.56381094",
"text": "@Override\n\tpublic void onPageSelected(int position) throws NotFoundException {\n\t\tTabWidget widget = mTabHost.getTabWidget();\n\t\tint oldFocusability = widget.getDescendantFocusability();\n\t\twidget.setDescendantFocusab... | [
{
"docid": "e80f162a1f1af697478250c161a1b90e",
"score": "0.699767",
"text": "@Override\n public void onPageSelected(int position) {\n TabWidget widget = mTabHost.getTabWidget();\n int oldFocusability = widget.getDescendantFocusability();\n widget.setDescendantFocu... |
9d9cf2fddfddc0df639201ceb94eb2a3 | repeated .gravity.v1.MsgValsetConfirm confirms = 1; | [
{
"docid": "8d7d3808bfc7bfafb6aad194493f3dc3",
"score": "0.6368922",
"text": "gravity.v1.Msgs.MsgValsetConfirmOrBuilder getConfirmsOrBuilder(\n int index);",
"title": ""
}
] | [
{
"docid": "43808f4eb0ae5f3ed7322774acf469d3",
"score": "0.72911215",
"text": "gravity.v1.Msgs.MsgValsetConfirm getConfirm();",
"title": ""
},
{
"docid": "a37b81dd87f91b516aa2511f4e7eed32",
"score": "0.70696867",
"text": "gravity.v1.Msgs.MsgValsetConfirmOrBuilder getConfirmOrBuilder(... |
ece73e5f018874ff3dd7afaf2ae7a1f0 | Returning if the year is a leap year. | [
{
"docid": "c934198e7904e75d6c2f5c54f563b46a",
"score": "0.8615893",
"text": "public boolean isLeapYear()\n {\n return (year % 4 == 0 && year % 100 != 0 || year % 400 == 0);\n }",
"title": ""
}
] | [
{
"docid": "f246eb03c495fc08bd7190d54760e6c8",
"score": "0.8718557",
"text": "private boolean isLeapYear() {\n\t\t\n\t\treturn (year % 400 == 0 || ((year % 4 == 0) && (year % 100 != 0)));\n\t}",
"title": ""
},
{
"docid": "eb2149b2fdf870585c73f16597fc0bf5",
"score": "0.8657693",
"text... |
ad69920365e643732b23dde492bd1baf | This method was generated by MyBatis Generator. This method returns the value of the database column user_week_status.loyal_status | [
{
"docid": "cfe0487b18064699656451a17bc6a1cc",
"score": "0.5657019",
"text": "public Byte getLoyal_status() {\r\n return loyal_status;\r\n }",
"title": ""
}
] | [
{
"docid": "8cbb4c2d1c65521103f0c384f74461d7",
"score": "0.6011513",
"text": "public Integer getWeekStatusId()\n\t{\n\t\treturn weekStatusId;\n\t}",
"title": ""
},
{
"docid": "18a5eb185bfa4dd7287e961c22a2718b",
"score": "0.580115",
"text": "public Integer getInactive_weeks() {\r\n ... |
0f2a17a5b14edbda22e23a68ceb88cf4 | STORED IN THE module's MainController | [
{
"docid": "9f4d33e79364d21b479057cd5f4068af",
"score": "0.0",
"text": "public Mkurmhs getSelectedKurikulumMahasiswa() {\n\t\treturn getKurikulumProdiMainCtrl().getSelectedKurikulumMahasiswa();\r\n\t}",
"title": ""
}
] | [
{
"docid": "6a9181edac1a46f0e714a640dff6c3ee",
"score": "0.7195884",
"text": "private MainController() {}",
"title": ""
},
{
"docid": "fb00e67ad12ee851c64520778fbac4f9",
"score": "0.6678027",
"text": "private void AdministratorController() {\n\n\t}",
"title": ""
},
{
"doc... |
314373d50a7f4f70380d6bf7006dcc2a | Reset the address and bytes left in the memory writer to new values | [
{
"docid": "0e9b0259936acba46ba7b469f7640338",
"score": "0.6207133",
"text": "UnsafeMemoryReader resetTo(long address, long bytesLeft) {\n this.address = address;\n this.bytesLeft = bytesLeft;\n return this;\n }",
"title": ""
}
] | [
{
"docid": "c970b636dc34c0ccaa9a1b28c6438342",
"score": "0.7094721",
"text": "public void resetMemory(){\n this.memory = 0;\n }",
"title": ""
},
{
"docid": "589c8ca69d089c69eabbfa97d270161d",
"score": "0.64905596",
"text": "public void reset() {\r\n\t\tm_offset = 0;\r\n\t}"... |
84c3b71235428f821a8d3b574a9ebc57 | Return the type ref of the super of the given type | [
{
"docid": "4eab6c5b72c5a246968ac6cd2e1b3a55",
"score": "0.7116273",
"text": "static public TypeRef getSuperRefOf(Engine pEngine, TypeRef TRef) {\n\t\tif(TRef == null) return null;\n\t\ttry { pEngine.getTypeManager().ensureTypeInitialized(TRef); } catch(Exception E) { return null; }\n\t\tType T = TRef.g... | [
{
"docid": "35a6d7bf247031404cf978234e6156ea",
"score": "0.7248677",
"text": "String getSuperType();",
"title": ""
},
{
"docid": "2341688322767efb5ac27a5a997191a2",
"score": "0.70954376",
"text": "static public TypeRef getSuperRefOf(Engine pEngine, Type T) {\n\t\tif(T == null) return... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "2bb332398c179f13eb5075d9dce45116",
"score": "0.0",
"text": "private void getListRoomsAvailableinHotel(HttpServletRequest request, HttpServletResponse response) throws ServletException, IOException, Exception {\n\t\tString url=\"/WEB-INF/views/reserve.jsp\";\n\n\t\tint hotelId = Integer.parse... | [
{
"docid": "da34ed11fe7c5649b3cd0bdad6dca5df",
"score": "0.7115143",
"text": "@Override\n\t\tpublic void 비행() {\n\t\t\t\n\t\t}",
"title": ""
},
{
"docid": "99cfe01c5035e9a9ca6dafada0e4a005",
"score": "0.67343336",
"text": "@Override\r\n\tpublic void caminar() {\r\n\t\t// TODO Auto-g... |
12aabcdc63eb9d4c46f902d8ff64cc53 | This method was generated by MyBatis Generator. This method corresponds to the database table member_activity | [
{
"docid": "bffbaa0d945c4e99229abf7147833a37",
"score": "0.0",
"text": "public void setLimitEnd(int limitEnd) {\n this.limitEnd=limitEnd;\n }",
"title": ""
}
] | [
{
"docid": "b82df3f4f930a2297890019bc402f109",
"score": "0.5801003",
"text": "void memberAddedToTeam(Long teamId, Long memberId, Date activityDate);",
"title": ""
},
{
"docid": "bf551e98d327877f1b0c09540eec2d97",
"score": "0.5695934",
"text": "public PaginatorDataTable<ActivityInstan... |
26f3eb839174a41449f7ccd650ba5a0d | A helper method to check if economy is currently enabled. | [
{
"docid": "053f180342f3fe0d51c62a94bcad7d20",
"score": "0.8158343",
"text": "public static boolean useEconomy() {\n \t\treturn useEconomy;\n \t}",
"title": ""
}
] | [
{
"docid": "52e429994f3ed31b387843614a55dd4b",
"score": "0.8510003",
"text": "public static boolean isEconomyAvailable(){\n return economy != null;\n }",
"title": ""
},
{
"docid": "2d85e133a4ad187bcef80f2bc3ad1d68",
"score": "0.75762314",
"text": "private boolean setupEcono... |
aaef7163b0038674b77fcd243059ea38 | Method to send the request | [
{
"docid": "0aa34c42a56cecf5f8ef5d2ad3969125",
"score": "0.67097485",
"text": "private void sendRequest(String methodName) throws Exception{\n\t\tURL u = null;\n\t\tHttpURLConnection httpURLConnection = null;\n\t\tOutputStreamWriter wr = null;\n\t\ttry{\n\t\t\tu = new URL (\"http://localhost:8080/VendMa... | [
{
"docid": "b53533332cfe26fb95dd01403fa31bd1",
"score": "0.70724326",
"text": "@Override\n public void run() {\n request.printRequest();\n String method = request.getMethod();\n String bodyType = request.getBodyType();\n try {\n connection = (HttpURLConnection) ... |
be3652656b06f325fa18cd164facc150 | Sets the showTranslations attribute of the DisplayHelper object | [
{
"docid": "1c7c2364ac250c15de8c8afcdd33cc6d",
"score": "0.68706924",
"text": "public void setShowTranslations(boolean showTranslations) {\n\t\tthis.showTranslations = showTranslations;\n\t}",
"title": ""
}
] | [
{
"docid": "0ee02c1d264193f7f48ed313277a6296",
"score": "0.6598141",
"text": "public boolean getShowTranslations() {\n\t\treturn showTranslations;\n\t}",
"title": ""
},
{
"docid": "7e0fb505b25384afad02df54001acd3d",
"score": "0.56499064",
"text": "void onTranslationEnabled();",
"... |
72699e4e4e041ca6ea6a11aba4da3c77 | this should have been provided to us javadoc'd | [
{
"docid": "0efecbd9b590944dce40564de487a530",
"score": "0.0",
"text": "public TestHantoCoordinate(int x, int y)\n\t\t{\n\t\t\tthis.x = x;\n\t\t\tthis.y = y;\n\t\t}",
"title": ""
}
] | [
{
"docid": "35e5940d13f06d1f0d6a21cf2739c70a",
"score": "0.6343898",
"text": "public function() {}",
"title": ""
},
{
"docid": "c4efc9f9911178a27ec9261384d5f141",
"score": "0.6109525",
"text": "public void mo12644zk() {\n }",
"title": ""
},
{
"docid": "5d259e9a9ed3... |
44b1789769b63998e34dc43a731ca0a1 | Set the isArchiveEnabled property: The value that indicates whether archiving is enabled or not. | [
{
"docid": "1308c6865f11a716acdec266f372df78",
"score": "0.7470506",
"text": "public RunUpdateParameters withIsArchiveEnabled(Boolean isArchiveEnabled) {\n this.isArchiveEnabled = isArchiveEnabled;\n return this;\n }",
"title": ""
}
] | [
{
"docid": "2feb230f05ba83d00f89beb13f4886b9",
"score": "0.83278906",
"text": "public void setArchive(boolean isArchive) {\n\t\tthis.isArchive = isArchive;\n\t}",
"title": ""
},
{
"docid": "c013871bf0a0efd4fb270dbfd275fd9b",
"score": "0.8160575",
"text": "public Boolean isArchiveEnab... |
f784b39c39d4a73c7e6f3d98e887b30e | / Method under test: submitForPublishing Test Type : Positive Sub Type : validAsset_libNotLogged() | [
{
"docid": "d8f2797f20f941771d27225a3e3a5243",
"score": "0.84229714",
"text": "@Test\n public void testSubmitForPublishing_validAsset_libNotLogged() throws Exception {\n try {\n AssetInfo assetInfo = assetCreator.getAssetAsAssetInfo(\"SystemAsset\");\n AssetKey assetKey = new Asse... | [
{
"docid": "fed3785d1ba13e6af121746c0579ec5b",
"score": "0.738025",
"text": "@Test\n public void testSubmitForPublishing_invalidLogin() throws Exception {\n try {\n AssetInfo assetInfo = assetCreator.getAssetAsAssetInfo(\"Common\");\n AssetKey assetKey = new AssetKey();\n ... |
7d5bb1d94cdfa78fea78c209b1e989e5 | Otwiera Activity do wyboru zawodnika | [
{
"docid": "c9abd9ccad4b2c1787fb47329e372cf0",
"score": "0.0",
"text": "public void chooseAthlete(View view) {\n Intent athlChooseIntent = new Intent(this,AthletesActivity.class);\n startActivityForResult(athlChooseIntent, 1);\n }",
"title": ""
}
] | [
{
"docid": "28dd9672aef74f6f130fe94a84573198",
"score": "0.6576245",
"text": "@Override\n public void onActivityStarted(Activity activity) {\n\n }",
"title": ""
},
{
"docid": "b4a16954cf261322a1018a1f7d452e1f",
"score": "0.6544881",
"text": "public stati... |
372dc8ba44203bfa822ac9e9bc1702ee | $ANTLR end "rule__XTypeLiteral__TypeAssignment_3" $ANTLR start "rule__XTypeLiteral__ArrayDimensionsAssignment_4" InternalDroneScript.g:19056:1: rule__XTypeLiteral__ArrayDimensionsAssignment_4 : ( ruleArrayBrackets ) ; | [
{
"docid": "e63f6ce9ae80540598950cdbb344b578",
"score": "0.86047447",
"text": "public final void rule__XTypeLiteral__ArrayDimensionsAssignment_4() throws RecognitionException {\r\n\r\n \t\tint stackSize = keepStackSize();\r\n \t\r\n try {\r\n // InternalDroneScript.g:1906... | [
{
"docid": "f606587847bfcf0854b4e725c0110dc9",
"score": "0.82796186",
"text": "public final void rule__XTypeLiteral__ArrayDimensionsAssignment_4() throws RecognitionException {\r\n\r\n \t\tint stackSize = keepStackSize();\r\n \r\n try {\r\n // ../de.nie.fin.ui/src-gen... |
625eb78ec658c91016603956f80d9aed | Get the underlying byte data where this record is contained. | [
{
"docid": "de3e2fc50c116348063a2a0ace3366d2",
"score": "0.7295272",
"text": "public ByteData getByteData() {\n return byteData;\n }",
"title": ""
}
] | [
{
"docid": "5731508f7f3d2d1a747fbe908e289dc3",
"score": "0.71492594",
"text": "public byte[] getBytes() {\n\t\treturn m_dataBytes;\n\t}",
"title": ""
},
{
"docid": "cd3edefd2ca3a17468777b663fa5c688",
"score": "0.71283025",
"text": "public java.nio.ByteBuffer getData() {\n return d... |
01846641866387f69113ba06da13aeec | This program determines weather a circle is inside a second circle, overlapping it, or does not | [
{
"docid": "3ec73a9dbb31ad1829222e4128c18612",
"score": "0.6221204",
"text": "public static void main(String[] args) {\n\t\t\n\t\tdouble circle1X, circle1Y, circle1Radius, circle2X, circle2Y, circle2Radius, distance;\n\t\t\n\t\t//get inputs\n\t\tScanner input = new Scanner(System.in);\n\t\tSystem.out.pr... | [
{
"docid": "dacb0c2369564cb4bfe05420352ac6d7",
"score": "0.711796",
"text": "public void determineOverlap()\n {\n\t\t\t\t boolean touching = false;\n\t\t\t boolean die = false;\n\t\t\t //make int variables:\n\t\t\t int h;//h\n\t\t\t int k;//k\n\t\t\t int circlex;//circlex\n\t\... |
ec876a6fb84e019872e7590d186da98a | Created with IntelliJ IDEA. User: harsha Date: 6/7/13 Time: 12:33 PM To change this template use File | Settings | File Templates. | [
{
"docid": "30600c2b8d3154a5057cd689a2e48708",
"score": "0.0",
"text": "public interface AiravataClientAPIService {\n /**\n * Get all workflows available in the apache airavata server\n * @return workflow list\n * @throws PortalException\n */\n public List<Workflow> getAllWorkflows... | [
{
"docid": "1260bf70decb91faff8466bae6765ba2",
"score": "0.62560755",
"text": "private stendhal() {\n\t}",
"title": ""
},
{
"docid": "ea8460c7314de45803a19bf7c984d4bf",
"score": "0.59919107",
"text": "@Override\n public void perish() {\n \n }",
"title": ""
},
{
... |
fb1af6cfa7a93851c67b57efe8021189 | Loads indices from provided LinkedList | [
{
"docid": "6aa02a2f92f90e7e9c7952f09b38388e",
"score": "0.0",
"text": "public void setIndex(LinkedList<Tuple> index) throws ExecException {\n this.index = index;\n }",
"title": ""
}
] | [
{
"docid": "4cd6bd69077003969f1fbad6deb5c7fc",
"score": "0.58106655",
"text": "@Test\r\n\tpublic void testIndexedLinkedList() {\n\t}",
"title": ""
},
{
"docid": "6299697113b2e90336ab188e2807b234",
"score": "0.5604149",
"text": "IntegerListInterface getIndex(int n);",
"title": ""
... |
fb07ba5868c141499316d61523093df2 | Invoked prior to replacing a region of text in the specified Document. Subclasses that want to conditionally allow replace should override this and only call supers implementation as necessary, or call directly into the FilterBypass. | [
{
"docid": "8292a0784ab85098702cd720cd0067a2",
"score": "0.52563035",
"text": "public void replace(FilterBypass fb, int offset, int length, String text,\n AttributeSet attrs) throws BadLocationException {\n fb.replace(offset, length, text, attrs);\n }",
"title": ""
... | [
{
"docid": "2786188112425efc989a1312522eee08",
"score": "0.64310443",
"text": "void replace(DocumentFilter.FilterBypass fb, int offset,\n int length, String text,\n AttributeSet attrs) throws BadLocationException {\n if (ignoreDocumentMutate) {\n ... |
b88ea27862ad837c8a3dbf16334832c2 | Determine score of placing a ship at this certain position | [
{
"docid": "de7b449decc05033ee8dac8d8446d8df",
"score": "0.0",
"text": "void updateScore(int[][] pGrid, int i, int j, int len, int dir, int weight) {\n int score = 0;\n\n for (int k = 0; k < len; k++) {\n int val;\n try {\n switch (dir) {\n ... | [
{
"docid": "7e0511fbe917c5f12232f467401a8360",
"score": "0.6349846",
"text": "public int getScore(int pos){\n return leaderBoard.get(pos - 1).score;\n }",
"title": ""
},
{
"docid": "97b20b01e9ff488499fd18d901d0ccc2",
"score": "0.6335282",
"text": "@Test\n public void testG... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "9eba75f2e4d0bbf6117476b3701babca",
"score": "0.0",
"text": "@Override\n\tpublic void onHideScene() {\n\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... |
4d6d48e3d87faf3c5911cdab5b6b0e52 | Returns the item's category based on its material | [
{
"docid": "97f8e8df7afda8417810566d2d14fd81",
"score": "0.67457795",
"text": "public static String getCategory(ItemStack item, boolean verifySpecials){\r\n\t\tString matName = item.getType().toString().toLowerCase();\r\n\t\tif(InventoryUtils.compareItems(item, Recipes.getRepairGem()) && EnchantManager.... | [
{
"docid": "20b3dba7fcdb98d210db4d02ee044466",
"score": "0.6553461",
"text": "public String getItem_category() {\n return item_category;\n }",
"title": ""
},
{
"docid": "20717c6b0e09daca8f1df98232957e8b",
"score": "0.6512265",
"text": "java.lang.String getCategory();",
... |
f2fc4f0ac9f83a523e3cde98a55f2714 | $ANTLR end "rule__Role__Group__0" $ANTLR start "rule__Role__Group__0__Impl" ../br.ufrn.dimap.ProcessDslLanguage.ui/srcgen/br/ufrn/dimap/ui/contentassist/antlr/internal/InternalProcessDsl.g:1988:1: rule__Role__Group__0__Impl : ( 'name' ) ; | [
{
"docid": "d983fd5013c9deab9754ce4c7cafb8e4",
"score": "0.7791811",
"text": "public final void rule__Role__Group__0__Impl() throws RecognitionException {\r\n\r\n \t\tint stackSize = keepStackSize();\r\n \r\n try {\r\n // ../br.ufrn.dimap.ProcessDslLanguage.ui/src-gen... | [
{
"docid": "8e55234b9ad89f45914857348376e133",
"score": "0.67986405",
"text": "public final void rule__Practice__Group__1__Impl() throws RecognitionException {\r\n\r\n \t\tint stackSize = keepStackSize();\r\n \r\n try {\r\n // ../br.ufrn.dimap.ProcessDslLanguage.ui/sr... |
e55b3fd4b4d259dcefec06be695a07bf | Created by Thomas Lewis on 2/24/19. | [
{
"docid": "fd03f3d96cad1858bbfbfaf2b533403e",
"score": "0.0",
"text": "public interface IDeckPresenter {\n void faceUpCardPressed(Integer pos);\n void deckPressed();\n}",
"title": ""
}
] | [
{
"docid": "c8ceec30e6f3ebd2fb8cab39b477d3f3",
"score": "0.6007609",
"text": "private static void sapxep() {\n\t\t\n\t}",
"title": ""
},
{
"docid": "663ac6f718361fb243bf093a1c7ded6a",
"score": "0.5924309",
"text": "@Override\r\n\tprotected void Goukakyuu() {\n\t\t\r\n\t}",
"title... |
8677cf6a1f2b46d83bb3e6b0e43ceedb | ||||||||||||||||||||||||||||| |||| Channels On/Off |||| ||||||||||||||||||||||||||||| Initializes the state (active or disabled) of the given StyleChannel by searching in the file. | [
{
"docid": "19f532b869e209d39bd1837ee11b06d2",
"score": "0.6824584",
"text": "public void initIsChannelEnabledProperty(StyleChannel styleChannel) {\n /*\n * The StyleChannel with the channel number is active if the channelNumber\n * appears in the progression which can be describe... | [
{
"docid": "7b19055a880e061504f1ee1dcc573c67",
"score": "0.57543314",
"text": "public void transferIsChannelEnabledProperty(StyleChannel styleChannel) {\n /*\n * The StyleChannel with the channel number can be activated or disabled\n * using the following approach:\n * 1. ... |
941a83a9b1e255bc6a9c9a369c5ae6d0 | / End of public methods. | [
{
"docid": "a6bdf94bca8183bbb07d9fbfd856b099",
"score": "0.0",
"text": "public AllocDotField_Node(WholeProgPAG pag, Alloc_Node base, SparkField field) {\n\t\tsuper(pag, field, field.getType());\n\t\tthis.base = base;\n\t\tthis.field = field;\n\t\tbase.addField(this, field);\n\t}",
"title": ""
}
] | [
{
"docid": "33d41636b65afa8267c9085dae3d1a2d",
"score": "0.69293857",
"text": "private void apparence() {\r\n\r\n\t}",
"title": ""
},
{
"docid": "05a606445504484958a1c21e14b7198e",
"score": "0.6602753",
"text": "@Override\r\n\tpublic void sapace() {\n\t\t\r\n\t}",
"title": ""
}... |
4661f8a211424449b249c111dc37be4e | This function will visualize the declared dependencies in a graph | [
{
"docid": "efb15152ac9e4135f07cb39cb0e7fa3b",
"score": "0.5758654",
"text": "private DirectedSparseMultigraph dependencyTreeToGraph() {\n\n\t\tDirectedSparseMultigraph g = new DirectedSparseMultigraph();\n\n\t\tfor (ArrayList<DependantTask> levelarray : ordered) {\n\t\t\tif (levelarray.size() > 0) {\n\... | [
{
"docid": "60e2eea778f4f7db4128ccfacc2c1672",
"score": "0.6612193",
"text": "public String getDisplayName() {\n\t\treturn \"Dependency Graph\";\n\t}",
"title": ""
},
{
"docid": "03ce15b4ac899659612ccc8517602886",
"score": "0.6586445",
"text": "protected void printContainerDependenci... |
d37be5f4369bfeca94a5379e97847099 | optional .CMsgGameMatchSignOut.CTeam.CPlayer.CCustomGameData custom_game_data = 35; | [
{
"docid": "53ac847606c8ac1a5b6eabe72184705a",
"score": "0.5598239",
"text": "public boolean hasCustomGameData() {\n return ((bitField0_ & 0x10000000) == 0x10000000);\n }",
"title": ""
}
] | [
{
"docid": "b906a705d8a420e96604dc697de0c824",
"score": "0.92373806",
"text": "DotaGcmessagesServer.CMsgGameMatchSignOut.CCustomGameData getCustomGameData();",
"title": ""
},
{
"docid": "6e5ef9a56bba1ced203aef79a9fce18a",
"score": "0.895631",
"text": "DotaGcmessagesServer.CMsgGameMat... |
93f4c23479b827e942147ba3ae9cc015 | ActionListener for handling accessibility profile updates. | [
{
"docid": "17277f33db380162b675e0a5af9aa1c2",
"score": "0.74461704",
"text": "public void update(ActionEvent event)\n {\n AccessibilityProfile.ColorContrast colorContrast =\n isHighContrast() ?\n AccessibilityProfile.ColorContrast.HIGH : \n AccessibilityProfile.ColorContrast.STAN... | [
{
"docid": "872add5b83229a399098991fc67e430d",
"score": "0.63148534",
"text": "void profileEdited(MutableProfile profile);",
"title": ""
},
{
"docid": "c919ac5c2c1cefafdea8c5891b0e6983",
"score": "0.6112209",
"text": "public void handleUpdateProfilePanel() {\n updateProfilePan... |
bb784a6f4371c5f22ccd4087cf91f47e | Compares two AVLs and checks to see if the trees are the same. If the trees have the same data in a different arrangement, this method should return false. This will only return true if the tree is in the exact same arrangement as the other tree. You may assume that you won't get an AVL with a different generic type. F... | [
{
"docid": "f78d3018504cc8a03acfab5fb4a075fb",
"score": "0.7223043",
"text": "public boolean equals(Object other) {\n if (other == null) {\n return false;\n }\n if (!(other instanceof AVL)) {\n return false;\n }\n AVLNode<T> node1 = root;\n ... | [
{
"docid": "53d3c4147cee1674ad264ce4f552af78",
"score": "0.6627099",
"text": "private Boolean compare(AVLTree a, AVLTree b){\n if(a.key>b.key || (a.key==b.key && a.address>b.address))return true;\n return false;\n }",
"title": ""
},
{
"docid": "a7bad778ae5923a0f66590b4c8c7fe... |
60ef5205a3b572ca6a9287d2bfe40fd9 | Test case number: 133 /Coverage entropy=1.5498260458782016 | [
{
"docid": "8cf0fa1db1dd9bf855415c2db2487ed9",
"score": "0.0",
"text": "@Test(timeout = 4000)\n public void test133() throws Throwable {\n XmlEntityRef xmlEntityRef0 = new XmlEntityRef(\"oo;##i GP*]\");\n // Undeclared exception!\n try { \n xmlEntityRef0.strong();\n fail(... | [
{
"docid": "293ba69276f6fd0cfa2f9a49e5aac4cb",
"score": "0.678258",
"text": "@Test(timeout = 4000)\n public void test16() throws Throwable {\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\n Instances instances0 = textDirectoryLoader0.getStructure();\n double[] ... |
253ca2125a8a60cb8732200a7797b0e3 | optional string ymd_first = 3; | [
{
"docid": "5702ae5bb65ad904986dbe31d9c7bfcd",
"score": "0.51106757",
"text": "public boolean hasYmdFirst() {\n return ((bitField0_ & 0x00000004) == 0x00000004);\n }",
"title": ""
}
] | [
{
"docid": "9efad77e1f6c2ef5a5b30f1c53fc1315",
"score": "0.71269006",
"text": "public Builder setYmdFirst(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000004;\n ymdFirst_ = value;\n onChanged();\n ... |
93e2d7a3f1aa9809770046544f7f10c9 | Called when the action mode is created; startActionMode() was called | [
{
"docid": "2aae101b4fe92d5bd25796eca7e90c05",
"score": "0.6373288",
"text": "@Override\r\n public boolean onCreateActionMode(ActionMode mode, Menu menu) {\r\n // Inflate a menu resource providing context menu items\r\n MenuInflater inflater = mode.getMenuInflater();\r\n ... | [
{
"docid": "7c6ed4a1032144f61bc428f5c33b4348",
"score": "0.7515797",
"text": "private void enableActionMode()\n {\n if (actionMode == null)\n {\n actionMode = Objects.requireNonNull(getActivity()).startActionMode(actionModeCallback);\n }\n }",
"title": ""
},
... |
56343b78db00fe4fdf6c21720529db6c | Handles the HTTP POST method. | [
{
"docid": "a4d6191746ad49b4def8ce5d514d3b1a",
"score": "0.0",
"text": "@Override\n protected void doPost(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }",
"title": ""
}
] | [
{
"docid": "9d82bd438ca885e91ee42f441f6a67c0",
"score": "0.73963165",
"text": "@Override\n\tpublic void doPost(Request request, Response response) {\n\t\t\n\t}",
"title": ""
},
{
"docid": "5e0c4bf9984bc451fe093fb1141f9960",
"score": "0.7392475",
"text": "@Override\n\tpublic void doPo... |
125d2e0f6998136f45d366d90dbfe993 | This method handles POST requests. Create a new request and queues it for processing. | [
{
"docid": "ce125d5e2955d1336f337ea5e78ea1a2",
"score": "0.0",
"text": "@POST\n\t@Path(\"/add/{word}\")\n\t@Produces(MediaType.APPLICATION_JSON)\n\tpublic Map<String, Object> postAddRequest(@PathParam(\"word\") String word, String definition) throws InterruptedException;",
"title": ""
}
] | [
{
"docid": "d608572a87b844dcafe05df04ce21656",
"score": "0.6647176",
"text": "public static void postRequest(Request req) {\n lazyInitialize();\n requestQueue.enqueue(req);\n }",
"title": ""
},
{
"docid": "280d7d1935ce3b3426889f556f2759b6",
"score": "0.64517665",
"te... |
74bb3ffc7f1f3082ebf3f02f57e3c868 | Setup the test environment. | [
{
"docid": "c5cb7f87c6d0f7d6dd2dffb0ae0f30ca",
"score": "0.0",
"text": "@Before\n public void setUp() throws Exception {\n MockitoAnnotations.initMocks(this);\n\n mWifiConfigStore =\n new WifiConfigStoreLegacy(\n mWifiNetworkHistory, mWifiSupplicant... | [
{
"docid": "4d9aa912e200215d515caa9048fecb17",
"score": "0.7824294",
"text": "@Override\n protected void setupEnvironment(final TestDestinationEnv testEnv) {\n }",
"title": ""
},
{
"docid": "c1fbdbcd5bef06328e577899a3f03374",
"score": "0.74080944",
"text": "@Before\n\tpublic void s... |
359c7fd9aff9f940ec6163fe2cddf6a6 | Display the banner screen | [
{
"docid": "d53afc40cded927e06bac07c4b257e82",
"score": "0.0",
"text": "public void startProgram() {\n this.displayBanner();\n // promt the player to enter their name Retriere the name of the player\n String playersName = this.getPlayersName();\n \n // create and save ... | [
{
"docid": "bb0359cc4aa1f943ef631c8802d400f9",
"score": "0.7908571",
"text": "private void displayBanner() {\n\t\tConfigManager configManager = ConfigManager.getInstance();\n\n\t\tString appName = configManager.getRunnerConfig().getString(\n\t\t\t\tConfigConstants.RUNNER_CONFIG_NAME);\n\n\t\tString appK... |
688d0223b38c7d35b7204be9f77a2639 | 1. Usage Node as linkedlist node for hashmap entry for quick access 2. DLL so we can add, remove at O(1) 3. Use fake node as DLL head, tail to avoid edge case check! | [
{
"docid": "988ff52b27771081a1f7318e3c746e29",
"score": "0.0",
"text": "public LRUCache(int capacity) {\n size = 0;\n cap = capacity;\n cache = new HashMap();\n // Usage of fake node to avoid edge cases check!\n head = new Node();\n tail = new Node();\n h... | [
{
"docid": "c6ed785dd47819e175303f8c8b280386",
"score": "0.6234371",
"text": "private DLL_node add(DLL_node head) throws IOException {\r\n DLL_node temp = new DLL_node();\r\n temp.set_next(head);\r\n if(head != null)\r\n head.set_previous(temp);\r\n temp.set_previo... |
339e5e63caa8a5598f27adf84fa088eb | Postconcats the matrix with the specified matrix. M' = other M | [
{
"docid": "ced693cfe88198808c0c170890fd81ee",
"score": "0.7107306",
"text": "public boolean postConcat(Matrix other) {\n addTransform(other.mValues);\n \n return true;\n }",
"title": ""
}
] | [
{
"docid": "679dc34300c9664c771571760a8f3b48",
"score": "0.6288829",
"text": "public boolean preConcat(Matrix other) {\n Matrix m = new Matrix(other);\n other.addTransform(mValues);\n set(m);\n \n return true;\n }",
"title": ""
},
{
"docid": "d4217623181... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "558b3ff80d653f40039b2dfdddd1f7cf",
"score": "0.0",
"text": "@Override\n\tpublic Sence save(Sence t) {\n\t\treturn null;\n\t}",
"title": ""
}
] | [
{
"docid": "d7194e467f51e022c107531d8614b6a3",
"score": "0.6905833",
"text": "@Override\r\n\tpublic void anular() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "941cb2826e3c700358fcaba402e6bb01",
"score": "0.66775143",
"text": "@Override\r\n\tpublic void hissetmek() {\n\r\n\t}",
"ti... |
adb33a220f69a1a6c40e72c3325e61f0 | Root node constructor. Creates the root node. | [
{
"docid": "0604520525c2c62a36857e93ad50e255",
"score": "0.0",
"text": "public Node81918309(Board board, int[] move) {\r\n\t\tnodeBoard = board;\r\n\t\tnodeMove = move;\r\n\t\tparent = null;\r\n\t\tchildren = new ArrayList<Node81918309>();\r\n\t\tnodeDepth = 0;\r\n\t\tnodePlayerId = enemyId;\r\n\t}",
... | [
{
"docid": "d95d58924523f10506b606a0a8dbaf03",
"score": "0.7153047",
"text": "public RootNode() {\n super(new ExplorerTree(topName));\n this.setValue(\"nodeType\", \"Top\");\n// this.setValue(\"networkName\", topName);\n setIconBase(\"org/qview/gui/TopIcon\");\n// setI... |