r.getEmployee().getName().contains( \\\"Ester\\\" ) ).findFirst().get()\\n .getEmployee().getAvailability() );\\n assertEquals( \\\"100\\\", nextWeek.getResources().stream().filter( r -> r.getEmployee().getName().contains( \\\"Carey\\\" ) ).findFirst().get()\\n .getEmployee().getAvailability() ); // --> Ability to increase employees on break/vacation\\n assertEquals( \\\"D, 20, 2\\\", nextWeek.getSchedules().get( 0 ).getTask() );\\n assertEquals( 3200, nextWeek.getCost(), 0 );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26bfd5310f4414aa7948cb0d9d38f581\",\n \"score\": \"0.5973784\",\n \"text\": \"@Test\\n public void simulationTest_multipleWeeks_noOvertime() throws Exception {\\n Week currentWeek = new Week();\\n currentWeek.setResources(\\n projectManagementSimulator.getInitialEmployees().stream().map( Resource::fromEmployee ).collect( Collectors.toList() ) );\\n currentWeek.setSchedules( projectManagementSimulator.selectCurrentSchedule( projectManagementSimulator.getInitialSchedule(), 1 ) );\\n Week nextWeek = projectManagementSimulator.simulateWeek( currentWeek );\\n Week twoWeeks = projectManagementSimulator.simulateWeek( nextWeek );\\n\\n // assert resources availability updated\\n assertEquals( \\\"50\\\", twoWeeks.getResources().stream().filter( r -> r.getEmployee().getName().contains( \\\"Ester\\\" ) ).findFirst().get()\\n .getEmployee().getAvailability() );\\n assertEquals( \\\"75\\\", twoWeeks.getResources().stream().filter( r -> r.getEmployee().getName().contains( \\\"Carey\\\" ) ).findFirst().get()\\n .getEmployee().getAvailability() ); // --> Ability to increase employees on break/vacation\\n assertEquals( \\\"D, 0, 2\\\", twoWeeks.getSchedules().get( 0 ).getTask() );\\n assertEquals( 8800, twoWeeks.getCost(), 0 );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"def2ff2e9aa5dcde013f21125ec5eb75\",\n \"score\": \"0.590727\",\n \"text\": \"@Test\\n public void simulationTest_multipleTasks_noOvertime() throws Exception {\\n Week currentWeek = new Week();\\n currentWeek.setResources(\\n projectManagementSimulator.getInitialEmployees().stream().map( Resource::fromEmployee ).collect( Collectors.toList() ) );\\n currentWeek.setSchedules( projectManagementSimulator.selectCurrentSchedule( projectManagementSimulator.getInitialSchedule(), 2 ) );\\n Week nextWeek = projectManagementSimulator.simulateWeek( currentWeek );\\n\\n // assert resources availability updated\\n assertEquals( \\\"50\\\", nextWeek.getResources().stream().filter( r -> r.getEmployee().getName().contains( \\\"Stacey\\\" ) ).findFirst().get()\\n .getEmployee().getAvailability() );\\n assertEquals( \\\"75\\\", nextWeek.getResources().stream().filter( r -> r.getEmployee().getName().contains( \\\"George\\\" ) ).findFirst().get()\\n .getEmployee().getAvailability() ); // --> Ability to increase employees on break/vacation\\n // Note: Neither task is completed in this simulation of a single week.\\n assertEquals( \\\"P, 181, 2\\\", nextWeek.getSchedules().get( 0 ).getTask() );\\n assertEquals( \\\"N, 70, 1\\\", nextWeek.getSchedules().get( 1 ).getTask() );\\n // This is the cost only of the week simulated. Do not worry about priority 1 costs.\\n assertEquals( 2400, nextWeek.getCost(), 0 );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6295e3241020ee145cacfb2689a56d6\",\n \"score\": \"0.5861414\",\n \"text\": \"static void test2() {\\n\\n System.out.println( \\\"Begin test2. ===============================\\\\n\\\" );\\n\\n Thread init = Thread.currentThread(); // init spawns the Woolies\\n\\n // Create a TrollsBridge of capacity 3.\\n TrollsBridge trollBridge = new TrollsBridge( 3 );\\n\\n // Set an optional, test delay to stagger the start of each woolie.\\n int delay = 1000;\\n\\n // Create the Woolies and store them in an array.\\n Thread peds[] = {\\n new Woolie( \\\"Abomasnow\\\", 3, SIDE_ONE, trollBridge ),\\n new Woolie( \\\"Blastoise\\\", 4, SIDE_TWO, trollBridge ),\\n new Woolie( \\\"Charizard\\\", 7, SIDE_ONE, trollBridge ),\\n new Woolie( \\\"Diancie\\\", 5, SIDE_TWO, trollBridge ),\\n new Woolie( \\\"Elgyem\\\", 2, SIDE_ONE, trollBridge ),\\n new Woolie( \\\"Feraligatr\\\", 7, SIDE_TWO, trollBridge ),\\n new Woolie( \\\"Gengar\\\", 8, SIDE_ONE, trollBridge ),\\n new Woolie( \\\"Heracross\\\", 10, SIDE_TWO, trollBridge ),\\n new Woolie( \\\"Igglybuff\\\", 3, SIDE_ONE, trollBridge ),\\n new Woolie( \\\"Jumpluff\\\", 4, SIDE_TWO, trollBridge ),\\n new Woolie( \\\"Kangaskhan\\\", 9, SIDE_ONE, trollBridge ),\\n new Woolie( \\\"Lucario\\\", 7, SIDE_TWO, trollBridge ),\\n new Woolie( \\\"Medicham\\\", 6, SIDE_ONE, trollBridge ),\\n };\\n\\n for ( int j = 0; j < peds.length; ++j ) {\\n // Run them by calling their start() method.\\n try {\\n peds[j].start();\\n init.sleep( delay );\\n }\\n catch ( InterruptedException e ) {\\n System.err.println( \\\"Abort. Unexpected thread interruption.\\\" );\\n break;\\n }\\n }\\n // Now, the test must give the woolies time to finish their crossings.\\n for ( int j = 0; j < peds.length; ++j ) {\\n try {\\n peds[j].join();\\n }\\n catch ( InterruptedException e ) {\\n System.err.println( \\\"Abort. Unexpected thread interruption.\\\" );\\n break;\\n }\\n }\\n System.out.println( \\\"\\\\n=============================== End test2.\\\" );\\n return;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f462337b5ab8e5ea7ad235f8e4693ff\",\n \"score\": \"0.5837825\",\n \"text\": \"@Test\\n public void test() {\\n final int numberOfHosts = 2;\\n final int computeNodesPerHost = 2;\\n final int numberOfComputeNodes = numberOfHosts * computeNodesPerHost;\\n String clusterId = \\\"limitTestPowerAllOnAllOff\\\";\\n \\n setTimeout((computeNodesPerHost * LIMIT_CYCLE_TIME) + TEST_WARM_UP_TIME);\\n \\n _orchestrator = BasicScenario.getOrchestrator(numberOfHosts, 0);\\n \\n /* create a serengeti setup */\\n Serengeti serengeti = new Serengeti(getClass().getName()+\\\"-vApp\\\", _orchestrator);\\n _clusterA = serengeti.createCluster(clusterId);\\n \\n @SuppressWarnings(\\\"unchecked\\\")\\n List<Host> hosts = (List<Host>) _orchestrator.get(Host.class);\\n for (Host host : hosts) {\\n _clusterA.createComputeNodes(computeNodesPerHost, host);\\n }\\n \\n /* power on the master node */\\n _clusterA.powerOn();\\n \\n /* start the system */\\n startVHM();\\n \\n /* register the cluster as an event producer. This will cause us to generate the limit instruction */\\n _vhm.registerEventProducer(_clusterA);\\n \\n /* wait for VHM to register the VMs */\\n Set<String> vms;\\n do {\\n try {\\n Thread.sleep(500);\\n } catch (InterruptedException e) {}\\n ClusterMap map = getAndReadLockClusterMap();\\n /* we really care about number of VMs in the cluster but we know that they're starting powered off at this point */\\n vms = map.listComputeVMsForClusterAndPowerState(clusterId, false);\\n unlockClusterMap(map);\\n } while ((vms == null || vms.size() < numberOfComputeNodes) && timeout() > 0);\\n \\n assertNotNull(\\\"No VMs register in cluster map\\\", vms);\\n assertEquals(\\\"Not enough VMs registered in cluster map\\\", numberOfComputeNodes, vms.size());\\n \\n /* power on the compute nodes */\\n _clusterA.setMinInstances(numberOfComputeNodes);\\n \\n /* wait for all the VMs to be powered on */\\n while (_clusterA.getCurrentInstances() < numberOfComputeNodes && timeout() >= 0) {\\n _orchestrator.waitForConfigurationUpdate(timeout());\\n }\\n \\n assertTrue(\\\"Test timed out waiting for minInstances to power on\\\", _clusterA.getCurrentInstances() == numberOfComputeNodes);\\n \\n /* power off the compute nodes */\\n _clusterA.setMinInstances(0);\\n \\n /* wait for all the VMs to be powered on */\\n while (_clusterA.getCurrentInstances() > 0 && timeout() >= 0) {\\n _orchestrator.waitForConfigurationUpdate(timeout());\\n }\\n \\n assertTrue(\\\"Test timed out waiting for minInstances to power off\\\", _clusterA.getCurrentInstances() == 0);\\n \\n _vhm.stop(true);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5abe13e68aa9b0f75bb94948bc45489\",\n \"score\": \"0.5823655\",\n \"text\": \"@Test(timeout=60000)\\n public void testCtime() throws Exception {\\n Configuration conf = new Configuration();\\n MiniDFSCluster cluster = null;\\n try {\\n final long pre = Time.now();\\n cluster = new MiniDFSCluster.Builder(conf).numDataNodes(1).build();\\n cluster.waitActive();\\n final long post = Time.now();\\n final long ctime = cluster.getNamesystem().getCTime();\\n\\n assertTrue(pre <= ctime);\\n assertTrue(ctime <= post);\\n } finally {\\n if (cluster != null) {\\n cluster.shutdown();\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70fb8cba1a6690b38013634a099972b0\",\n \"score\": \"0.5813657\",\n \"text\": \"@Before\\n public void setup() throws Exception {\\n for (int i = 0; i < 5; i++) {\\n createTask(UUID.randomUUID().toString(), UUID.randomUUID().toString(),\\n UUID.randomUUID().toString(), UUID.randomUUID().toString(), UUID.randomUUID().toString());\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb7a6f3ec45df437098944ee27673554\",\n \"score\": \"0.5780638\",\n \"text\": \"private static void CreateProcesses() {\\n for (int i = 0; i < 8; i++){\\n processes[i] = new Process(times[i], i);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a80c7f9102a1bd1a3483f353dd32577\",\n \"score\": \"0.57748634\",\n \"text\": \"public static void main(final String... args) {\\n try {\\n final int nbIter = 1000 * 1000;\\n long elapsed_1 = 0L;\\n long elapsed_2 = 0L;\\n final TestUuid tu = new TestUuid();\\n long start = System.nanoTime();\\n for (int i = 0; i < nbIter; i++) tu.generate1();\\n elapsed_1 = (System.nanoTime() - start) / 1_000_000L;\\n System.out.println(\\\"Test 1 : \\\" + elapsed_1 + \\\" ms\\\");\\n start = System.nanoTime();\\n for (int i = 0; i < nbIter; i++) tu.generate2();\\n elapsed_2 = (System.nanoTime() - start) / 1_000_000L;\\n System.out.println(\\\"Test 2 : \\\" + elapsed_2 + \\\" ms\\\");\\n } catch (final Exception e) {\\n e.printStackTrace();\\n }\\n System.exit(0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10c55faea59cd7c500da3f72ed80c73a\",\n \"score\": \"0.57735103\",\n \"text\": \"public static void main(String[] args) throws Exception {\\n Properties properties = new Properties();\\n properties.load(RunInstance.class.getResourceAsStream(\\\"/AwsCredentials.properties\\\"));\\n BasicAWSCredentials bawsc = new BasicAWSCredentials(properties.getProperty(\\\"accessKey\\\"), properties.getProperty(\\\"secretKey\\\"));\\n AmazonEC2Client ec2 = new AmazonEC2Client(bawsc);\\n AmazonElasticLoadBalancingClient elb = new AmazonElasticLoadBalancingClient(bawsc);\\n AmazonAutoScalingClient asClient = new AmazonAutoScalingClient(bawsc);\\n AmazonCloudWatchClient cwc = new AmazonCloudWatchClient(bawsc);\\n\\n ELB ELB = new ELB();\\n\\n double rps;\\n Instance LG = ELB.launchLG(ec2);\\n // Instance LG = getInstanceFromInstanceId(ec2,\\\"i-0b5eebf1\\\");\\n String elbDNS = ELB.launchLB(elb);\\n // String elbDNS = \\\"loader-1275008100.us-east-1.elb.amazonaws.com\\\";\\n List<Runnable> cleanupTasks = AutoScallingGroup.createAutoScalingGroup(asClient, ec2, cwc);\\n Thread.sleep(120000);\\n String testID = \\\"\\\";\\n String testID2 = \\\"\\\";\\n int n=0;\\n\\n do {\\n testID = getTestID(LG, elbDNS);\\n rps = warmUp(LG, testID);\\n n++;\\n System.out.println(\\\"Warm up \\\" + n +\\\": rps average = \\\"+rps);\\n\\n } while (rps < 980);\\n\\n\\n\\n testID2 = startTest(LG,elbDNS);\\n Thread.sleep(3000000);\\n\\n if (testEnd(LG, testID2) == true) {\\n terminateAll(cleanupTasks);\\n } else {\\n Thread.sleep(120000);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d04948b96a5f805daf8857f1d5535f3\",\n \"score\": \"0.5771217\",\n \"text\": \"@Test\\n public void elapsedRuntimeTest() {\\n // TODO: test elapsedRuntime\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5f852646303692a505ea45693e3624e\",\n \"score\": \"0.5748188\",\n \"text\": \"@Test\\n public void testGetByCreation() throws InterruptedException {\\n\\n //make t1 created 10ms before the second task.\\n data.task().insertTask(new Task(\\\"task2\\\", 5, 5,LocalDateTime.now()), () -> {});\\n Thread.sleep(10);\\n Task t1 = new Task(\\\"task\\\", 5, 5, LocalDateTime.now());\\n data.task().insertTask(t1, () -> {});\\n taskSorter.getTasksByCreation(tasks -> {\\n assertEquals(\\\"Task sorter is improperly getting completed tasks by creation!\\\",\\n tasks.iterator().next(), t1);\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4c4dfa52e527e6a720a46f32cc7bb7e\",\n \"score\": \"0.5729531\",\n \"text\": \"public Simulacion() {\\n initComponents();\\n tiempo_inicial = System.currentTimeMillis();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7dae9c1e83b27721cc1980a25a6d2a45\",\n \"score\": \"0.5725068\",\n \"text\": \"@Test(timeout = 300_000)\\n public void testMultiThreaded() throws Exception {\\n\\n List<Thread> threads = new ArrayList<>();\\n\\n threads.add(startVectorManipulationThread(50000, -141428));\\n threads.add(startVectorManipulationThread(50000, -141430));\\n threads.add(startVectorManipulationThread(50000, -16768));\\n threads.add(startVectorManipulationThread(50000, -499952));\\n threads.add(startVectorManipulationThread(50000, -499955));\\n\\n for (Thread thread : threads) {\\n thread.join();\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"23008674640dced7357c96de4bc4c828\",\n \"score\": \"0.5706953\",\n \"text\": \"@Test\\n\\tpublic void testCanTrackPassageOfTime() throws InterruptedException {\\n\\t\\tSimpleTimer st = new SimpleTimer(1000);\\n\\t\\tLifeForm e = new MockLifeForm(\\\"bob\\\",20);\\n\\t\\tst.addTimeObserver(e);\\n\\t\\tst.start();\\n\\t\\tThread.sleep(250); //1/4 a second diff from the simpletimer sleep.\\n\\t\\tfor (int x=0; x < 5; x++){\\n\\t\\t\\tassertEquals(x, e.myTime);\\n\\t\\t\\tThread.sleep(1000);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a53d7b6ea28f776c2188ee7f19ebf77\",\n \"score\": \"0.5667328\",\n \"text\": \"@Test\\n public void simulationTest_withOvertime() throws Exception {\\n Week currentWeek = new Week();\\n currentWeek.setResources( projectManagementSimulator.getInitialEmployees().stream().map( Resource::fromEmployee ).map( Resource::overtime )\\n .collect( Collectors.toList() ) );\\n currentWeek.setSchedules( projectManagementSimulator.selectCurrentSchedule( projectManagementSimulator.getInitialSchedule(), 1 ) );\\n Week nextWeek = projectManagementSimulator.simulateWeek( currentWeek );\\n\\n // assert resources availability updated\\n assertEquals( \\\"50\\\", nextWeek.getResources().stream().filter( r -> r.getEmployee().getName().contains( \\\"Ester\\\" ) ).findFirst().get()\\n .getEmployee().getAvailability() );\\n assertEquals( \\\"100\\\", nextWeek.getResources().stream().filter( r -> r.getEmployee().getName().contains( \\\"Carey\\\" ) ).findFirst().get()\\n .getEmployee().getAvailability() ); // --> Ability to increase employees on break/vacation\\n assertEquals( \\\"D, 0, 2\\\", nextWeek.getSchedules().get( 0 ).getTask() );\\n assertEquals( 7200, nextWeek.getCost(), 0 );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e2edae8ac6bb15bd74495d15ac28846b\",\n \"score\": \"0.5654272\",\n \"text\": \"@Test(timeout=300000)\\n public void test3() throws Throwable {\\n Future<?> future = executor.submit(new Runnable(){ \\n @Override public void run() { \\n try {\\n byte[] byteArray0 = new byte[1];\\n SerialBlob serialBlob0 = new SerialBlob(byteArray0);\\n ByteArrayInputStream byteArrayInputStream0 = (ByteArrayInputStream)serialBlob0.getBinaryStream();\\n Console console0 = new Console((RmiJmxClient) null, (InputStream) byteArrayInputStream0, true, true);\\n VirtualDatabaseAdmin virtualDatabaseAdmin0 = new VirtualDatabaseAdmin(console0);\\n virtualDatabaseAdmin0.addExpertCommands();\\n assertEquals(\\\"VirtualDatabase Administration\\\", virtualDatabaseAdmin0.getDescriptionString());\\n } catch(Throwable t) {\\n // Need to catch declared exceptions\\n }\\n } \\n });\\n future.get(4000, TimeUnit.MILLISECONDS);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03fb2bac742dc5d1642a54a9c3c993fc\",\n \"score\": \"0.56428504\",\n \"text\": \"@Test(enabled = false)\\n public void test20ThreadsAcross50MapsWith1SecondExpiration() throws Throwable {\\n putTest(20, 50, 1000);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16c5246a5c0f0dcc4f72c8a3fedf85b8\",\n \"score\": \"0.56418806\",\n \"text\": \"public static void main(String[] args) throws Exception {\\n long tin=System.currentTimeMillis();\\n ArrayList<Double> numeros=new ArrayList<Double>();\\n for ( int cantidad=0; cantidad< 10*1000*1000; cantidad++ ){\\n double numeroAleatorio = ( Math.random() * cantidad );\\n numeros.add(numeroAleatorio);\\n //Thread.sleep(0,1);\\n/// Syste.gc(); FEO FEO \\n }\\n long tout=System.currentTimeMillis();\\n// System.out.println(\\\"El resultado es: \\\" + numeros);\\n System.out.println(\\\"Calculo realizado en : \\\" + (tout-tin) + \\\" milisegundos\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae95f3542bbc134d6d67db9d81e9d41c\",\n \"score\": \"0.5625267\",\n \"text\": \"int createTest(int arrangerID, int clsID, int subID, int testDuration, String startTime);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6cde3eae801b20d051b78cca20db9f94\",\n \"score\": \"0.5615762\",\n \"text\": \"public void testIntervalGen() {\\n sch.execute();\\n sch.scheduleActionAtInterval(.4, this, \\\"actionMethod\\\");\\n for (int i = 0; i < 10; i++) {\\n sch.execute();\\n }\\n\\n for (int i = 0; i < 10; i++) {\\n assertEquals(.4 * (i + 1), results.get(i), 0.01);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64ff194c7c83d4a2451c15b36e4a2d5a\",\n \"score\": \"0.55865043\",\n \"text\": \"@Test\\n\\tpublic void run() {\\n\\t\\tint count = 0;\\n\\t\\ttry {\\n\\t\\t\\tfor(int i = 0; i < 5; i++) {\\n\\t\\t\\t\\tcount += 500;\\n\\t\\t\\t\\tThread.sleep(500);\\n\\t\\t\\t}\\n\\t\\t}catch(InterruptedException e) {}\\n\\t\\t\\n\\t\\tassertEquals(2500, count);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a72abd98c0927c01a892ff1068906d3a\",\n \"score\": \"0.55832046\",\n \"text\": \"@Test(timeout = 5000)\\n public void graphTest_runtime() {\\n int v=10000*30, e=v*5;\\n weighted_graph g = graph_creator(v,e,1);\\n // while(true) {;}\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48d794f8acb8eb88e52983f2bde921ee\",\n \"score\": \"0.5565743\",\n \"text\": \"public void testStartAndStopEvictor() throws Exception {\\n pool.setMaxIdle(6);\\n pool.setMaxActive(6);\\n pool.setNumTestsPerEvictionRun(6);\\n pool.setMinEvictableIdleTimeMillis(100L);\\n\\n for(int j=0;j<2;j++) {\\n // populate the pool\\n {\\n Object[] active = new Object[6];\\n for(int i=0;i<6;i++) {\\n active[i] = pool.borrowObject();\\n }\\n for(int i=0;i<6;i++) {\\n pool.returnObject(active[i]);\\n }\\n }\\n \\n // note that it stays populated\\n assertEquals(\\\"Should have 6 idle\\\",6,pool.getNumIdle());\\n \\n // start the evictor\\n pool.setTimeBetweenEvictionRunsMillis(50L);\\n \\n // wait a second (well, .2 seconds)\\n try { Thread.sleep(200L); } catch(Exception e) { }\\n \\n // assert that the evictor has cleared out the pool\\n assertEquals(\\\"Should have 0 idle\\\",0,pool.getNumIdle());\\n \\n // stop the evictor \\n pool.startEvictor(0L);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f076cb39f5f64b1afd7d1f5817d546fd\",\n \"score\": \"0.5563559\",\n \"text\": \"@Test(enabled = false)\\n public void test50ThreadsAcross10MapsWith1SecondExpiration() throws Throwable {\\n putTest(50, 10, 1000);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"510bf8ce0727f1ffa290d0dced61a2c9\",\n \"score\": \"0.554452\",\n \"text\": \"private void createAndMonitorThreads() throws Exception {\\n boolean timeIsUp = false;\\n \\n /**\\n * We're going to create concept/date processing threads, 7 of them \\n * always, and start them separately. This thread will check on each \\n * thread every second, and unless it was asked to be rescheduled, it \\n * will check whether it was rescheduled at the beginning of creating a \\n * new processing thread. \\n */\\n int counter = 0; \\n int total = 0;\\n\\n // Get parameters\\n String originalParams = project.get(\\\"PARAMS\\\").toString();\\n String[] params = originalParams.split(\\\",\\\",-1);\\n String beginDateParam = params[0].isEmpty() ? \\\"20110301000000\\\" : params[0];\\n\\n /**\\n * If no endDate parameter is specified it will run through the\\n * current date.\\n */\\n String endDateParam = params[1].isEmpty() ? DT_FORMAT.format(new Date()) : params[1];\\n\\n // Variables for tracking process\\n beginDate = DT_FORMAT.parse(beginDateParam);\\n endDate = DT_FORMAT.parse(endDateParam);\\n\\n System.out.println(HUMAN_DATETIME.format(new Date().getTime()) + \\\": Started processing\\\");\\n log(HUMAN_DATETIME.format(new Date().getTime()) + \\\": Started processing\\\");\\n\\n /**\\n * Get concept statuses\\n * Including DISTINCT in query because we only want to count each\\n * concept once.\\n */\\n HashMap[] concepts = SQLUtilities.getTableHashedArray(datadb,\\n \\\"SELECT\\\\n\\\" +\\n \\\" DISTINCT CONCEPT_CD\\\\n\\\" +\\n \\\" ,CONCEPT_ID\\\\n\\\" +\\n \\\" ,UNITS_CD\\\\n\\\" +\\n \\\" ,PROCESSED_THROUGH\\\\n\\\" +\\n \\\"FROM\\\\n\\\" +\\n \\\" \\\" + aggSchema + \\\".AGGREGATE_FACT\\\\n\\\" +\\n \\\"WHERE\\\\n\\\" +\\n \\\" TRUNC(TO_DATE('\\\" + endDateParam + \\\"','yyyymmddhh24miss')) - TRUNC(PROCESSED_THROUGH) > 0\\\\n\\\" +\\n \\\" OR PROCESSED_THROUGH IS NULL\\\\n\\\" +\\n \\\"ORDER BY\\\\n\\\" +\\n \\\" CONCEPT_ID\\\");\\n\\n /**\\n * Establish a total number of concept/dates by iterating through concepts\\n * and then iterating through processedThrough+1 to endDate. Running sum.\\n * This lets us get the progress %.\\n */\\n for(HashMap concept : concepts) {\\n Date processedThrough = (Date) concept.get(\\\"PROCESSED_THROUGH\\\");\\n \\n for(Date dateCursor = processedThrough != null ? addDays(processedThrough,1) : beginDate; \\n dateCursor.before(endDate) || dateCursor.equals(endDate); \\n dateCursor = addDays(dateCursor,1)) {\\n\\n total++;\\n }\\n }\\n\\n /**\\n * Only create threads for one concept at a time. This is so when \\n * threads move into different concepts the progress tracking doesn't\\n * get too complicated. At worst the last thread of a concept waits for\\n * the others to finish before moving on to a new concept.\\n */\\n for(HashMap concept : concepts) {\\n LinkedList<Thread> workers = new LinkedList<Thread>();\\n String conceptCode = concept.get(\\\"CONCEPT_CD\\\").toString();\\n String unitsCode = concept.get(\\\"UNITS_CD\\\").toString();\\n Date processedThrough = (Date) concept.get(\\\"PROCESSED_THROUGH\\\");\\n \\n System.out.println(HUMAN_DATETIME.format(new Date().getTime()) + \\\": Analyzing \\\" + conceptCode + \\\"(\\\" + unitsCode + \\\").\\\");\\n log(HUMAN_DATETIME.format(new Date().getTime()) + \\\": Analyzing \\\" + conceptCode + \\\"(\\\" + unitsCode + \\\").\\\"); \\n \\n /**\\n * Get the previously established values so we can merge results. \\n * There should be a row for each combo.\\n */ \\n HashMap[] conceptAggregates = SQLUtilities.getTableHashedArray(datadb,\\n \\\"SELECT \\\"\\n + \\\" COMBO_ID \\\"\\n + \\\",CONCEPT_CD \\\"\\n + \\\",UNITS_CD \\\"\\n + \\\",PROCESSED_THROUGH \\\"\\n + \\\",EARLIEST_COLDATE \\\"\\n + \\\",LATEST_COLDATE \\\"\\n + \\\",CONCEPT_COUNT \\\"\\n + \\\",PATIENT_COUNT \\\"\\n + \\\",MIN_VALUE \\\"\\n + \\\",MAX_VALUE \\\"\\n + \\\",AVERAGE \\\"\\n + \\\",STDDEV \\\"\\n + \\\",ABNORMAL_TOTAL \\\"\\n + \\\",ABNORMAL_LOW \\\"\\n + \\\",ABNORMAL_HIGH \\\"\\n + \\\",ABNORMAL_OTHER \\\"\\n + \\\"FROM \\\" + aggSchema + \\\".AGGREGATE_FACT \\\"\\n + \\\"WHERE \\\"\\n + \\\"CONCEPT_CD = '\\\" + concept.get(\\\"CONCEPT_CD\\\").toString() + \\\"' \\\"\\n + \\\"AND UNITS_CD = '\\\" + concept.get(\\\"UNITS_CD\\\").toString() + \\\"' \\\"\\n + \\\"ORDER BY CONCEPT_ID, COMBO_ID\\\");\\n\\n // Reinitialize tracking variables for this concept\\n lastDateProcessed = processedThrough != null ? processedThrough : addDays(beginDate,-1);\\n numProcessed = 0;\\n numUpdated = 0;\\n \\n earliestColDate = new Date[comboLookup.length];\\n latestColDate = new Date[comboLookup.length];\\n conceptCount = new int[comboLookup.length];\\n patientCount = new int[comboLookup.length];\\n minValue = new BigDecimal[comboLookup.length];\\n maxValue = new BigDecimal[comboLookup.length];\\n average = new BigDecimal[comboLookup.length];\\n stddev = new BigDecimal[comboLookup.length];\\n abnormalTotal = new int[comboLookup.length];\\n abnormalLow = new int[comboLookup.length];\\n abnormalHigh = new int[comboLookup.length];\\n abnormalOther = new int[comboLookup.length];\\n \\n // Initialize values to their stored state\\n for(HashMap conceptAggregate : conceptAggregates) {\\n int comboID = Integer.parseInt(conceptAggregate.get(\\\"COMBO_ID\\\").toString());\\n \\n if(conceptAggregate.get(\\\"EARLIEST_COLDATE\\\") != null) {\\n earliestColDate[comboID] = HUMAN_DATETIME.parse(conceptAggregate.get(\\\"EARLIEST_COLDATE\\\").toString());\\n }\\n \\n if(conceptAggregate.get(\\\"LATEST_COLDATE\\\") != null) {\\n latestColDate[comboID] = HUMAN_DATETIME.parse(conceptAggregate.get(\\\"LATEST_COLDATE\\\").toString());\\n }\\n \\n if(conceptAggregate.get(\\\"CONCEPT_COUNT\\\") != null) {\\n conceptCount[comboID] = Integer.parseInt(conceptAggregate.get(\\\"CONCEPT_COUNT\\\").toString());\\n }\\n \\n // Distinct patient counts can't be incremented, so set to 0 and requery entire dataset\\n patientCount[comboID] = 0;\\n \\n if(conceptAggregate.get(\\\"MIN_VALUE\\\") != null) {\\n minValue[comboID] = new BigDecimal(conceptAggregate.get(\\\"MIN_VALUE\\\").toString());\\n }\\n \\n if(conceptAggregate.get(\\\"MAX_VALUE\\\") != null) {\\n maxValue[comboID] = new BigDecimal(conceptAggregate.get(\\\"MAX_VALUE\\\").toString());\\n }\\n \\n if(conceptAggregate.get(\\\"AVERAGE\\\") != null) {\\n average[comboID] = new BigDecimal(conceptAggregate.get(\\\"AVERAGE\\\").toString());\\n }\\n \\n if(conceptAggregate.get(\\\"STDDEV\\\") != null) {\\n stddev[comboID] = new BigDecimal(conceptAggregate.get(\\\"STDDEV\\\").toString());\\n }\\n \\n if(conceptAggregate.get(\\\"ABNORMAL_TOTAL\\\") != null) {\\n abnormalTotal[comboID] = Integer.parseInt(conceptAggregate.get(\\\"ABNORMAL_TOTAL\\\").toString());\\n }\\n \\n if(conceptAggregate.get(\\\"ABNORMAL_LOW\\\") != null) {\\n abnormalLow[comboID] = Integer.parseInt(conceptAggregate.get(\\\"ABNORMAL_LOW\\\").toString());\\n }\\n \\n if(conceptAggregate.get(\\\"ABNORMAL_HIGH\\\") != null) {\\n abnormalHigh[comboID] = Integer.parseInt(conceptAggregate.get(\\\"ABNORMAL_HIGH\\\").toString());\\n }\\n \\n if(conceptAggregate.get(\\\"ABNORMAL_OTHER\\\") != null) {\\n abnormalOther[comboID] = Integer.parseInt(conceptAggregate.get(\\\"ABNORMAL_OTHER\\\").toString());\\n }\\n }\\n \\n // Build list of threads, one for each collection date in the concept that hasn't been identified\\n for(Date dateCursor = processedThrough != null ? addDays(processedThrough,1) : beginDate; \\n dateCursor.before(endDate) || dateCursor.equals(endDate); \\n dateCursor = addDays(dateCursor,1)) {\\n workers.add(new DataDictionaryThread(this, conceptCode, unitsCode, dateCursor));\\n }\\n\\n // Start and monitor threads\\n while( workers.size() > 0 ) {\\n boolean displayFinish = false;\\n int numberAlive = 0;\\n Iterator<Thread> i = workers.iterator();\\n\\n // Iterate over remaining threads\\n while (i.hasNext()) {\\n Thread worker = i.next();\\n Thread.State state = worker.getState();\\n if( state == state.TERMINATED ){\\n i.remove();\\n counter++;\\n displayFinish = true;\\n\\n // Log progress for roughly every 3 months of a concept processed\\n if( counter % 90 == 0 ) {\\n log(\\\"Finished \\\" + (counter) + \\\" concept dates\\\");\\n }\\n } else if( state != state.NEW ) {\\n numberAlive ++;\\n // Remove the thread if we are in an unrunnable state and it is NEW (unstarted)\\n } else if( state == state.NEW && !isRunnable() ) {\\n i.remove();\\n }\\n }\\n\\n // We have entered an unrunnable state for the first time\\n if(!timeIsUp && !isRunnable() ){\\n log(\\\"-------------Time's up!------------\\\");\\n timeIsUp = true;\\n }\\n\\n if( displayFinish & timeIsUp){\\n log(\\\"Thread has finished, time is up. \\\" + numberAlive + \\\" still running.\\\");\\n }\\n\\n // Start threads until there is a full compliment as long as there are NEW threads and time is not up\\n for( int news = numberAlive; !timeIsUp && news < this.maxThreads && news < workers.size() ; news++ ) {\\n // Search for a thread to start\\n for (Thread worker : workers ) {\\n if( worker.getState() == Thread.State.NEW ) {\\n worker.start();\\n break;\\n }\\n }\\n } \\n sleep(2500); \\n this.updateStatus(\\\"Running\\\",(int)((100.0*counter)/(0.01+total)));\\n \\n } //while there are threads (collection dates)\\n \\n // Update the fact for current concept\\n System.out.println(HUMAN_DATETIME.format(new Date().getTime()) + \\\": Running statistics for \\\" + conceptCode + \\\"(\\\" + unitsCode + \\\").\\\");\\n log(HUMAN_DATETIME.format(new Date().getTime()) + \\\": Running statistics for \\\" + conceptCode + \\\"(\\\" + unitsCode + \\\").\\\");\\n updateAggFact(conceptCode,unitsCode);\\n \\n \\n \\n // Update the ontology with the concept's new statistics\\n String conceptHeader = getConceptHeader(conceptCode, unitsCode);\\n \\n if(!conceptHeader.equals(\\\"~EMPTY~\\\")) {\\n System.out.println(HUMAN_DATETIME.format(new Date().getTime()) + \\\": Generating HTML for \\\" + conceptCode + \\\"(\\\" + unitsCode + \\\").\\\");\\n log(HUMAN_DATETIME.format(new Date().getTime()) + \\\": Generating HTML for \\\" + conceptCode + \\\"(\\\" + unitsCode + \\\").\\\");\\n\\n updateOntologyStats(conceptCode,\\n conceptHeader + \\n getConceptStatTable(conceptCode, unitsCode, \\\"Overview\\\",\\\"@\\\",\\\"COMBO_DESCRIPTION\\\") + \\n getConceptStatTable(conceptCode, unitsCode, \\\"Gender\\\",\\\"SEX_CD\\\",\\\"COMBO_DESCRIPTION\\\") + \\n getConceptStatTable(conceptCode, unitsCode, \\\"Age x Gender\\\",\\\"SEX_CD\\\",\\\"AGE_BRACKET\\\") + \\n getConceptStatTable(conceptCode, unitsCode, \\\"Age x Race\\\",\\\"RACE_CD\\\",\\\"AGE_BRACKET\\\") + \\n getConceptStatTable(conceptCode, unitsCode, \\\"Ethnicity\\\",\\\"ETHNIC_CD\\\",\\\"COMBO_DESCRIPTION\\\") + \\n getConceptFooter());\\n } else {\\n System.out.println(HUMAN_DATETIME.format(new Date().getTime()) + \\\": No entry in ontology for \\\" + conceptCode + \\\"(\\\" + unitsCode + \\\").\\\");\\n log(HUMAN_DATETIME.format(new Date().getTime()) + \\\": No entry in ontology for \\\" + conceptCode + \\\"(\\\" + unitsCode + \\\").\\\");\\n }\\n \\n System.out.println(HUMAN_DATETIME.format(new Date().getTime()) + \\\": Finished \\\" + conceptCode + \\\"(\\\" + unitsCode + \\\"). \\\" + numProcessed + \\\" lines processed, \\\" + numUpdated + \\\" observations modified.\\\");\\n log(HUMAN_DATETIME.format(new Date().getTime()) + \\\": Finished \\\" + conceptCode + \\\"(\\\" + unitsCode + \\\"). \\\" + numProcessed + \\\" lines processed, \\\" + numUpdated + \\\" observations modified.\\\");\\n \\n // We do another check here so we don't needlessly queue up more \\n // threads for the remaining concepts if we just hit an unrunnable \\n // state.\\n if(!isRunnable() && !timeIsUp) {\\n log(\\\"-------------Time is up!------------\\\");\\n timeIsUp = true;\\n System.out.println(HUMAN_DATETIME.format(new Date().getTime()) + \\\": I should stop now: Concept\\\");\\n log(HUMAN_DATETIME.format(new Date().getTime()) + \\\": I should stop now: Concept\\\");\\n break;\\n } else if(!isRunnable() && timeIsUp) {\\n System.out.println(HUMAN_DATETIME.format(new Date().getTime()) + \\\": I should stop now: Concept\\\");\\n log(HUMAN_DATETIME.format(new Date().getTime()) + \\\": I should stop now: Concept\\\");\\n break;\\n }\\n } // End of concept\\n \\n log(\\\"Done processing, \\\"+ counter+ \\\" concept dates processed.\\\");\\n totalConceptDatesProcessed += counter;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d7a58d8f5ac50f5960082eda952d7af\",\n \"score\": \"0.5541611\",\n \"text\": \"public void runTestProcedure()\\n {\\n\\t\\t/*\\n\\t\\t * INT departed, DOM arrival 1 Leg Duty.\\n\\t\\t */\\n \\tLeg l1 = this.generateLegInstance(101, apCDG, apVAN,\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tLocalDateTime.of(2014, Month.JANUARY, 1, 14, 40), \\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tLocalDateTime.of(2014, Month.JANUARY, 1, 19, 0), \\\"320\\\");\\t//\\t260\\n\\n \\tDuty d = this.generateDutyInstance(2, l1);\\n\\n\\t\\tassertTrue(d.getBlockTimeInMins() == 260);\\n\\t\\tassertTrue(d.getNumOfLegs() == 1);\\n\\t\\tassertTrue(d.getBlockTimeInMinsActive() == 260);\\n\\t\\tassertTrue(d.getNumOfLegsActive() == 1);\\n\\t\\tassertTrue(d.getNumOfLegsIntToDom() == 1);\\n\\t\\tassertTrue(d.getNumOfLegsDomToInt() == 0);\\n\\t\\tassertTrue(d.getNumOfCriticalLegs() == 1);\\n\\t\\tassertTrue(d.getNumOfAgDg() == 0);\\n\\t\\tassertTrue(d.getNumOfSpecialFlights() == 0);\\n\\t\\tassertTrue(d.getNumOfAnyHomebaseTouch() == 0);\\n\\t\\tassertTrue(d.getNumOfDomTouch() == 0);\\n\\t\\tassertTrue(d.getNumOfIntTouch() == 0);\\n\\t\\tassertTrue(d.getNumOfAcChanges() == 0);\\n\\t\\tassertTrue(d.getLongConnDiff() == 0);\\n\\n\\t\\tassertTrue(d.getBriefDurationInMins(hbNdxIST) == 60);\\n//\\t\\tassertTrue(d.getBriefDurationInMins(hbNdxSAW) == 60);\\n\\t\\tassertTrue(d.getDebriefDurationInMins(hbNdxIST) == 30);\\n\\n\\t\\tassertTrue(d.getBriefTime(hbNdxIST).isEqual(LocalDateTime.of(2014, Month.JANUARY, 1, 13, 40)));\\n//\\t\\tassertTrue(d.getBriefTime(hbNdxSAW).isEqual(LocalDateTime.of(2014, Month.JANUARY, 1, 13, 40)));\\n\\t\\tassertTrue(d.getDebriefTime(hbNdxIST).isEqual(LocalDateTime.of(2014, Month.JANUARY, 1, 19, 30)));\\n\\n\\t\\tassertTrue(d.getBriefDayBeginning(hbNdxIST).isEqual(LocalDateTime.of(2014, Month.JANUARY, 1, 0, 0)));\\n//\\t\\tassertTrue(d.getBriefDayBeginning(hbNdxSAW).isEqual(LocalDateTime.of(2014, Month.JANUARY, 1, 0, 0)));\\n\\t\\tassertTrue(d.getDebriefDayEnding(hbNdxIST).isEqual(LocalDateTime.of(2014, Month.JANUARY, 1, 23, 59, 59)));\\n\\n\\t\\tassertTrue(d.getBriefDay(hbNdxIST).isEqual(LocalDate.of(2014, Month.JANUARY, 1)));\\n//\\t\\tassertTrue(d.getBriefDay(hbNdxSAW).isEqual(LocalDate.of(2014, Month.JANUARY, 1)));\\n\\t\\tassertTrue(d.getDebriefDay(hbNdxIST).isEqual(LocalDate.of(2014, Month.JANUARY, 1)));\\n\\n\\t\\tassertTrue(d.getDutyDurationInMins(hbNdxIST) == 350);\\n//\\t\\tassertTrue(d.getDutyDurationInMins(hbNdxSAW) == 350);\\n\\n\\t\\tassertTrue(d.getNumOfDaysTouched(hbNdxIST) == 1);\\n//\\t\\tassertTrue(d.getNumOfDaysTouched(hbNdxSAW) == 1);\\n\\n\\t\\tassertFalse(d.isEr());\\n\\n\\t\\tassertTrue(d.getRestDurationInMins(hbNdxIST) == 660);\\n//\\t\\tassertTrue(d.getRestDurationInMins(hbNdxSAW) == 660);\\n\\n\\t\\tassertTrue(d.getNextBriefTime(hbNdxIST).isEqual(LocalDateTime.of(2014, Month.JANUARY, 1, 19, 30).plusMinutes(660)));\\n//\\t\\tassertTrue(d.getNextBriefTime(hbNdxSAW).isEqual(LocalDateTime.of(2014, Month.JANUARY, 1, 19, 30).plusMinutes(660)));\\n\\n\\t\\tassertTrue(d.getAugmented(hbNdxIST) == 0);\\n//\\t\\tassertTrue(d.getAugmented(hbNdxSAW) == 0);\\n\\n\\t\\tassertFalse(d.isEarly(hbNdxIST));\\n//\\t\\tassertFalse(d.isEarly(hbNdxSAW));\\n\\n\\t\\tassertFalse(d.isHard(hbNdxIST));\\n//\\t\\tassertFalse(d.isHard(hbNdxSAW));\\n\\n\\t\\t/*\\n\\t\\t * INT departed, DOM arrival 1 Leg Duty.\\n\\t\\t */\\n\\t\\tLeg l2 = this.generateLegInstance(101, apAYT, apIST, \\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tLocalDateTime.of(2014, Month.JANUARY, 1, 20, 30), \\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tLocalDateTime.of(2014, Month.JANUARY, 1, 22, 0), \\\"320\\\");\\t//\\t90\\n\\t\\tthis.dutyRuleContext.getAggregatorProxy().appendFw(d, l2);\\n\\n\\t\\tassertTrue(d.getBlockTimeInMins() == 350);\\n\\t\\tassertTrue(d.getNumOfLegs() == 2);\\n\\t\\tassertTrue(d.getBlockTimeInMinsActive() == 350);\\n\\t\\tassertTrue(d.getNumOfLegsActive() == 2);\\n\\t\\tassertTrue(d.getNumOfLegsIntToDom() == 1);\\n\\t\\tassertTrue(d.getNumOfLegsDomToInt() == 0);\\n\\t\\tassertTrue(d.getNumOfCriticalLegs() == 1);\\n\\t\\tassertTrue(d.getNumOfAgDg() == 0);\\n\\t\\tassertTrue(d.getNumOfSpecialFlights() == 0);\\n\\t\\tassertTrue(d.getNumOfAnyHomebaseTouch() == 0);\\n\\t\\tassertTrue(d.getNumOfDomTouch() == 1);\\n\\t\\tassertTrue(d.getNumOfIntTouch() == 0);\\n\\t\\tassertTrue(d.getNumOfAcChanges() == 0);\\n\\t\\tassertTrue(d.getLongConnDiff() == 0);\\n\\n\\t\\tassertTrue(d.getBriefDurationInMins(hbNdxIST) == 60);\\n//\\t\\tassertTrue(d.getBriefDurationInMins(hbNdxSAW) == 60);\\n\\t\\tassertTrue(d.getDebriefDurationInMins(hbNdxIST) == 30);\\n\\n\\t\\tassertTrue(d.getBriefTime(hbNdxIST).isEqual(LocalDateTime.of(2014, Month.JANUARY, 1, 13, 40)));\\n//\\t\\tassertTrue(d.getBriefTime(hbNdxSAW).isEqual(LocalDateTime.of(2014, Month.JANUARY, 1, 13, 40)));\\n\\t\\tassertTrue(d.getDebriefTime(hbNdxIST).isEqual(LocalDateTime.of(2014, Month.JANUARY, 1, 22, 30)));\\n\\n\\t\\tassertTrue(d.getBriefDayBeginning(hbNdxIST).isEqual(LocalDateTime.of(2014, Month.JANUARY, 1, 0, 0)));\\n//\\t\\tassertTrue(d.getBriefDayBeginning(hbNdxSAW).isEqual(LocalDateTime.of(2014, Month.JANUARY, 1, 0, 0)));\\n\\t\\tassertTrue(d.getDebriefDayEnding(hbNdxIST).isEqual(LocalDateTime.of(2014, Month.JANUARY, 1, 23, 59, 59)));\\n\\n\\t\\tassertTrue(d.getBriefDay(hbNdxIST).isEqual(LocalDate.of(2014, Month.JANUARY, 1)));\\n//\\t\\tassertTrue(d.getBriefDay(hbNdxSAW).isEqual(LocalDate.of(2014, Month.JANUARY, 1)));\\n\\t\\tassertTrue(d.getDebriefDay(hbNdxIST).isEqual(LocalDate.of(2014, Month.JANUARY, 1)));\\n\\n\\t\\tassertTrue(d.getDutyDurationInMins(hbNdxIST) == 530);\\n//\\t\\tassertTrue(d.getDutyDurationInMins(hbNdxSAW) == 530);\\n\\n\\t\\tassertTrue(d.getNumOfDaysTouched(hbNdxIST) == 1);\\n//\\t\\tassertTrue(d.getNumOfDaysTouched(hbNdxSAW) == 1);\\n\\n\\t\\tassertFalse(d.isEr());\\n\\n\\t\\tassertTrue(d.getRestDurationInMins(hbNdxIST) == 780);\\n//\\t\\tassertTrue(d.getRestDurationInMins(hbNdxSAW) == 760);\\n\\n\\t\\tassertTrue(d.getNextBriefTime(hbNdxIST).isEqual(LocalDateTime.of(2014, Month.JANUARY, 1, 22, 30).plusMinutes(780)));\\n//\\t\\tassertTrue(d.getNextBriefTime(hbNdxSAW).isEqual(LocalDateTime.of(2014, Month.JANUARY, 1, 22, 30).plusMinutes(760)));\\n\\n\\t\\tassertTrue(d.getAugmented(hbNdxIST) == 0);\\n//\\t\\tassertTrue(d.getAugmented(hbNdxSAW) == 0);\\n\\n\\t\\tassertFalse(d.isEarly(hbNdxIST));\\n//\\t\\tassertFalse(d.isEarly(hbNdxSAW));\\n\\n\\t\\tassertFalse(d.isHard(hbNdxIST));\\n//\\t\\tassertFalse(d.isHard(hbNdxSAW));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a101cb2718e2660598ceb943c4520c3\",\n \"score\": \"0.55398905\",\n \"text\": \"@Test\\r\\n\\tpublic void TimeseriesGeneratorsIncrementing(){\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\tReport.setupLaTeXLoggers(\\\"reports/layer2/report5.tex\\\");\\r\\n\\t\\t\\t} catch (IOException e) {\\r\\n\\t\\t\\t\\te.printStackTrace();\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t\\t//////////////the actual tests///////////////////////\\r\\n\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tExampleTimeseriesGenerator gen1 = new ExampleTimeseriesGenerator(0.6, 5,100);\\r\\n\\t\\t\\tExampleTimeseriesGenerator gen2 = new ExampleTimeseriesGenerator(0.4, 5,100);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//setup sets of experiments\\r\\n\\t\\t\\tSingleArtefactExperiments<TimeseriesGeneratorOutput<PairGeneratorOutput>> gen1Exp = new SingleArtefactExperiments<TimeseriesGeneratorOutput<PairGeneratorOutput>>(gen1, \\\"test1\\\");\\r\\n\\t\\t\\tSingleArtefactExperiments<TimeseriesGeneratorOutput<PairGeneratorOutput>> gen2Exp = new SingleArtefactExperiments<TimeseriesGeneratorOutput<PairGeneratorOutput>>(gen2, \\\"test2\\\");\\r\\n\\r\\n\\t\\t\\tSetOfComparisons<TimeseriesGeneratorOutput<PairGeneratorOutput>> gen1gen2Comp = new SetOfComparisons<TimeseriesGeneratorOutput<PairGeneratorOutput>>(gen1Exp,gen2Exp);\\r\\n\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tMersenneTwister ran = new MersenneTwister(0);\\r\\n\\t\\t\\tResult res = Layer2.run(gen1gen2Comp, 0.05, false, false, new SimpleIncrementing(20,100), ran).get(0);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t/////////////////separately create the expected results to compare against/////////////////////////////////////////\\r\\n\\t\\t\\tMersenneTwister ranTest = new MersenneTwister(0);\\r\\n\\t\\t\\tlong [] seeds = new long [ 200 ];\\r\\n\\t\\t\\tfor( int i=0; i<200; ++i )\\r\\n\\t\\t\\t\\tseeds[ i ] = ranTest.nextLong();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//generate first 20\\t\\t\\r\\n\\t\\t\\tList<Double> artificialResults1FinalGen = new ArrayList<Double>();\\r\\n\\t\\t\\tList<Double> artificialResults2FinalGen = new ArrayList<Double>();\\r\\n\\t\\t\\tfor(int i =0; i < 40; i+=2){\\r\\n\\t\\t\\t\\tartificialResults1FinalGen.add(artificiallyCreateTimeseries(new MersenneTwister(seeds[i]), 0.6, 5, 100).get(99).getFirst());\\r\\n\\t\\t\\t\\tartificialResults2FinalGen.add(artificiallyCreateTimeseries(new MersenneTwister(seeds[i+1]), 0.4, 5, 100).get(99).getFirst());\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t//compare using first 20\\r\\n\\t\\t\\tResult resTest = Layer1.compare(artificialResults1FinalGen, artificialResults2FinalGen, 0.05, false, null);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//generate further results\\r\\n\\t\\t\\tint i = 40;\\r\\n\\t\\t\\twhile(resTest == null || !resTest.isSignificant() && i < 200){\\r\\n\\t\\t\\t\\tfor(int i2 = 0; i2 < 40; i2+= 2){\\r\\n\\t\\t\\t\\t\\tartificialResults1FinalGen.add(artificiallyCreateTimeseries(new MersenneTwister(seeds[i + i2]), 0.6, 5, 100).get(99).getFirst());\\r\\n\\t\\t\\t\\t\\tartificialResults2FinalGen.add(artificiallyCreateTimeseries(new MersenneTwister(seeds[i + i2 +1]), 0.4, 5, 100).get(99).getFirst());\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t//compare additional result each time\\r\\n\\t\\t\\t\\tresTest = Layer1.compare(artificialResults1FinalGen, artificialResults2FinalGen, 0.05, false, null);\\r\\n\\t\\t\\t\\ti+=40;\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t///////////////////////compare significance etc.////////////////////////////////////////////\\r\\n\\t\\t\\tassertEquals(\\\"test result obtained directly from Layer 1 must match result obtained via Layer 2 (pValue)\\\", resTest.getPValue(), res.getPValue(), 0);\\r\\n\\t\\t\\tassertEquals(\\\"test result obtained directly from Layer 1 must match result obtained via Layer 2 (effect size)\\\", resTest.getEffectSize(), res.getEffectSize(), 0);\\r\\n\\t\\t\\tassertEquals(\\\"test result obtained directly from Layer 1 must match result obtained via Layer 2 (order)\\\", resTest.getOrder(), res.getOrder());\\r\\n\\t\\t\\tassertEquals(\\\"test result obtained directly from Layer 1 must match result obtained via Layer 2 (significance)\\\", resTest.isSignificant(), res.isSignificant());\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b5f13fdbfba678c7b8bd132744def5a\",\n \"score\": \"0.55308497\",\n \"text\": \"@Test\\n\\t@TestOrder(5)\\n\\tpublic void testPopulateVMI1() {\\n\\t\\tassertNotNull(conceptInstanceA1 = createInstance(conceptA, vmi1, \\\"ConceptInstanceA1\\\"));\\n\\t\\tassertNotNull(conceptInstanceA2 = createInstance(conceptA, vmi1, \\\"ConceptInstanceA2\\\"));\\n\\t\\tassertNotNull(conceptInstanceB1 = createInstance(conceptB, conceptInstanceA1, \\\"ConceptInstanceB1\\\"));\\n\\t\\tassertNotNull(conceptInstanceB2 = createInstance(conceptB, conceptInstanceA1, \\\"ConceptInstanceB2\\\"));\\n\\t\\tassertNotNull(conceptInstanceB3 = createInstance(conceptB, conceptInstanceA2, \\\"ConceptInstanceB3\\\"));\\n\\t\\tassertNotNull(conceptInstanceC1 = createInstance(conceptC, conceptInstanceB1, \\\"ConceptInstanceC1\\\"));\\n\\t\\tassertNotNull(conceptInstanceC2 = createInstance(conceptC, conceptInstanceB1, \\\"ConceptInstanceC2\\\"));\\n\\t\\tassertNotNull(conceptInstanceC3 = createInstance(conceptC, conceptInstanceB2, \\\"ConceptInstanceC2\\\"));\\n\\t\\tSystem.out.println(\\\"conceptInstanceA1=\\\" + conceptInstanceA1.getStringRepresentation());\\n\\t\\tSystem.out.println(\\\"conceptInstanceA2=\\\" + conceptInstanceA2.getStringRepresentation());\\n\\t\\tSystem.out.println(\\\"conceptInstanceB1=\\\" + conceptInstanceB1.getStringRepresentation());\\n\\t\\tSystem.out.println(\\\"conceptInstanceB2=\\\" + conceptInstanceB2.getStringRepresentation());\\n\\t\\tSystem.out.println(\\\"conceptInstanceB3=\\\" + conceptInstanceB3.getStringRepresentation());\\n\\t\\tSystem.out.println(\\\"conceptInstanceC1=\\\" + conceptInstanceC1.getStringRepresentation());\\n\\t\\tSystem.out.println(\\\"conceptInstanceC2=\\\" + conceptInstanceC2.getStringRepresentation());\\n\\t\\tSystem.out.println(\\\"conceptInstanceC3=\\\" + conceptInstanceC3.getStringRepresentation());\\n\\n\\t\\tassertEquals(\\\"ConceptInstanceA1\\\", conceptInstanceA1.getFlexoPropertyValue(\\\"a1\\\"));\\n\\t\\tassertEquals(\\\"ConceptInstanceA1\\\", conceptInstanceA1.getFlexoActor(\\\"a1\\\"));\\n\\t\\tassertEquals(7, (long) conceptInstanceA1.getFlexoPropertyValue(\\\"a2\\\"));\\n\\t\\tassertEquals(7, (long) conceptInstanceA1.getFlexoActor(\\\"a2\\\"));\\n\\n\\t\\tassertEquals(\\\"ConceptInstanceB1\\\", conceptInstanceB1.getFlexoPropertyValue(\\\"b1\\\"));\\n\\t\\tassertEquals(\\\"ConceptInstanceB1\\\", conceptInstanceB1.getFlexoActor(\\\"b1\\\"));\\n\\t\\tassertEquals(\\\"ConceptInstanceA1\\\", conceptInstanceB1.getFlexoPropertyValue(\\\"a1\\\"));\\n\\t\\tassertEquals(\\\"ConceptInstanceA1\\\", conceptInstanceB1.getFlexoActor(\\\"a1\\\"));\\n\\n\\t\\tassertEquals(\\\"ConceptInstanceC1\\\", conceptInstanceC1.getFlexoPropertyValue(\\\"c1\\\"));\\n\\t\\tassertEquals(\\\"ConceptInstanceC1\\\", conceptInstanceC1.getFlexoActor(\\\"c1\\\"));\\n\\t\\tassertEquals(\\\"ConceptInstanceB1\\\", conceptInstanceC1.getFlexoPropertyValue(\\\"b1\\\"));\\n\\t\\tassertEquals(\\\"ConceptInstanceB1\\\", conceptInstanceC1.getFlexoActor(\\\"b1\\\"));\\n\\t\\tassertEquals(\\\"ConceptInstanceA1\\\", conceptInstanceC1.getFlexoPropertyValue(\\\"a1\\\"));\\n\\t\\tassertEquals(\\\"ConceptInstanceA1\\\", conceptInstanceC1.getFlexoActor(\\\"a1\\\"));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f9174d90a071c0cf423727cc83b345a\",\n \"score\": \"0.55276364\",\n \"text\": \"@Test\\n void initComponents() {\\n\\n long startTime = java.util.Calendar.getInstance().getTimeInMillis();\\n new NewRequests(\\\"9000\\\").initComponents();\\n long endTime = java.util.Calendar.getInstance().getTimeInMillis();\\n\\n // Testing the GUI initialization time is less than 5 seconds.\\n assertTrue(endTime - startTime <= 5000);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66b13f75cecdd05f22e5dc302286ee89\",\n \"score\": \"0.5526855\",\n \"text\": \"public static void main(String[] args) {\\n for(int i=0;i<3;i++){\\n new Thread(new Runnable() {\\n @Override\\n public void run() {\\n SingleTon2 singleTon=SingleTon2.getInstance();\\n System.out.println(singleTon.hashCode());\\n }\\n }).start();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5fbf091717562179fde051fbb53edfbc\",\n \"score\": \"0.5517964\",\n \"text\": \"public static void selfTest(){\\n\\n\\t\\tLib.debug(ReactTestChar, \\\"\\\\n\\\\n******* Testing: Task 5 (ReactWater) *******\\\\n\\\");\\n\\t\\tLib.debug(ReactTestChar, \\\"\\\\nCreating hydrogen and oxygen...\\\\n\\\");\\n\\n\\n\\t\\t//Create class to test functionality and some threads\\n\\t\\tReactWater motherNature = new ReactWater();\\n\\t\\tKThread h1, h2, h3, h4, h5, o1, o2, o3, o4, o5;\\n\\n\\t\\t//Test Case 1: 2h and 1o\\n\\t\\tLib.debug(ReactTestChar, \\\"TestCase1: Enough materials for 1 water molecule\\\\nSuccessful if one water is made.\\\");\\n\\n\\t\\t//initalise\\n\\t\\th1 = new KThread();\\n\\t\\th2 = new KThread();\\n\\t\\to1 = new KThread();\\n\\n\\t\\th1.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run(){\\n\\t\\t\\t\\tmotherNature.hReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\th2.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run(){\\n\\t\\t\\t\\tmotherNature.hReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\to1.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run() {\\n\\t\\t\\t\\tmotherNature.oReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\n\\t\\th1.fork();\\n\\t\\th2.fork();\\n\\t\\to1.fork();\\n\\n\\t\\to1.join();\\n\\n\\t\\t//Test Case 2: 1o multiple (more than 4)h\\n\\t\\tLib.debug(ReactTestChar, \\\"\\\\nTestCase2: Abundance of Hydrogen\\\\nSuccessful if one water is made.\\\");\\n\\n\\t\\t//initalise\\n\\t\\th1 = new KThread();\\n\\t\\th2 = new KThread();\\n\\t\\th3 = new KThread();\\n\\t\\th4 = new KThread();\\n\\t\\th5 = new KThread();\\n\\n\\t\\to1 = new KThread();\\n\\n\\t\\th1.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run(){\\n\\t\\t\\t\\tmotherNature.hReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\th2.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run(){\\n\\t\\t\\t\\tmotherNature.hReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\th3.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run(){\\n\\t\\t\\t\\tmotherNature.hReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\th4.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run(){\\n\\t\\t\\t\\tmotherNature.hReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\th5.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run() {\\n\\t\\t\\t\\tmotherNature.hReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\n\\t\\to1.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run() {\\n\\t\\t\\t\\tmotherNature.oReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\n\\t\\th1.fork();\\n\\t\\th2.fork();\\n\\t\\th3.fork();\\n\\t\\th4.fork();\\n\\t\\th5.fork();\\n\\n\\t\\to1.fork();\\n\\t\\to1.join();\\n\\n\\n\\n\\t\\t//Test Case 3: 2h multiple (more than2)o\\n\\t\\tLib.debug(ReactTestChar, \\\"\\\\nTestCase3: Abundance of Oxygen\\\\nSuccessful if one water is made.\\\");\\n\\n\\t\\t//initalise\\n\\t\\tmotherNature.reset();\\n\\t\\to1 = new KThread();\\n\\t\\to2 = new KThread();\\n\\t\\to3 = new KThread();\\n\\t\\to4 = new KThread();\\n\\t\\to5 = new KThread();\\n\\n\\t\\th1 = new KThread();\\n\\t\\th2 = new KThread();\\n\\n\\t\\th1.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run(){\\n\\t\\t\\t\\tmotherNature.hReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\th2.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run(){\\n\\t\\t\\t\\tmotherNature.hReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\to1.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run(){\\n\\t\\t\\t\\tmotherNature.oReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\to2.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run(){\\n\\t\\t\\t\\tmotherNature.oReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\to3.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run() {\\n\\t\\t\\t\\tmotherNature.oReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\n\\t\\to4.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run() {\\n\\t\\t\\t\\tmotherNature.oReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\to5.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run() {\\n\\t\\t\\t\\tmotherNature.oReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\n\\t\\t\\n\\t\\th1.fork();\\n\\t\\th2.fork();\\n\\n\\t\\to1.fork();\\n\\t\\to2.fork();\\n\\t\\to3.fork();\\n\\t\\to4.fork();\\n\\t\\to5.fork();\\n\\n\\t\\to1.join();\\n\\n\\n\\n\\t\\t//Test Case 4: many of both o and h\\n\\t\\tLib.debug(ReactTestChar, \\\"\\\\nTestCase4: Abundance of both\\\\nSuccessful if two waters are made.\\\");\\n\\n\\t\\t//initalise\\n\\t\\tmotherNature.reset();\\n\\t\\th1 = new KThread();\\n\\t\\th2 = new KThread();\\n\\t\\th3 = new KThread();\\n\\t\\th4 = new KThread();\\n\\t\\th5 = new KThread();\\n\\n\\t\\to1 = new KThread();\\n\\t\\to2 = new KThread();\\n\\t\\to3 = new KThread();\\n\\t\\to4 = new KThread();\\n\\t\\to5 = new KThread();\\n\\n\\t\\th1.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run(){\\n\\t\\t\\t\\tmotherNature.hReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\th2.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run(){\\n\\t\\t\\t\\tmotherNature.hReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\th3.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run(){\\n\\t\\t\\t\\tmotherNature.hReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\th4.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run(){\\n\\t\\t\\t\\tmotherNature.hReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\th5.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run() {\\n\\t\\t\\t\\tmotherNature.hReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\t// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \\n\\t\\to1.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run(){\\n\\t\\t\\t\\tmotherNature.oReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\to2.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run(){\\n\\t\\t\\t\\tmotherNature.oReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\to3.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run() {\\n\\t\\t\\t\\tmotherNature.oReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\n\\t\\to4.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run() {\\n\\t\\t\\t\\tmotherNature.oReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\to5.setTarget(new Runnable() {\\n\\t\\t\\tpublic void run() {\\n\\t\\t\\t\\tmotherNature.oReady();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\to1.fork();\\n\\t\\to2.fork();\\n\\t\\to3.fork();\\n\\t\\to4.fork();\\n\\t\\to5.fork();\\n\\n\\t\\th1.fork();\\n\\t\\th2.fork();\\n\\t\\th3.fork();\\n\\t\\th4.fork();\\n\\t\\th5.fork();\\n\\n\\t\\to1.join();\\n\\t\\to2.join();\\n\\t\\to3.join();\\n\\t\\to4.join();\\n\\t\\to5.join();\\n\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f788edb92844044fb1b51f2bb80c4215\",\n \"score\": \"0.5515455\",\n \"text\": \"static void test0() {\\n\\n System.out.println( \\\"Begin test0. ===============================\\\\n\\\" );\\n Thread init = Thread.currentThread(); // init spawns the Woolies\\n\\n // Create a TrollsBridge of capacity 3.\\n TrollsBridge trollBridge = new TrollsBridge( 3 );\\n\\n // Set an optional, test delay to stagger the start of each woolie.\\n int delay = 1000;\\n\\n // Create the Woolies and store them in an array.\\n Thread peds[] = {\\n new Woolie( \\\"Al\\\", 3, SIDE_ONE, trollBridge ),\\n new Woolie( \\\"Bob\\\", 4, SIDE_TWO, trollBridge ),\\n };\\n\\n for ( int j = 0; j < peds.length; ++j ) {\\n // Run them by calling their start() method.\\n try {\\n peds[j].start();\\n init.sleep( delay );\\n }\\n catch ( InterruptedException e ) {\\n System.err.println( \\\"Abort. Unexpected thread interruption.\\\" );\\n break;\\n }\\n }\\n // Now, the test must give the woolies time to finish their crossings.\\n for ( int j = 0; j < peds.length; ++j ) {\\n try {\\n peds[j].join();\\n }\\n catch ( InterruptedException e ) {\\n System.err.println( \\\"Abort. Unexpected thread interruption.\\\" );\\n break;\\n }\\n }\\n System.out.println( \\\"\\\\n=============================== End test0.\\\" );\\n return;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b12d65033426995597092a635091d0b7\",\n \"score\": \"0.5513231\",\n \"text\": \"public static void main(String[] args) {\\n Thread t1 = new Thread(new Runnable() {\\n @Override\\n public void run() {\\n MySingletonFactory threadDemo1 = MySingletonFactory.getSingletonInstance(\\\"thread1Instance\\\");\\n System.out.println(threadDemo1.getInstanceName());\\n }\\n });\\n\\n Thread t2 = new Thread(() -> { // new Runnable() {} replaced with lambda\\n MySingletonFactory threadDemo2 = MySingletonFactory.getSingletonInstance(\\\"thread2Instance\\\");\\n System.out.println(threadDemo2.getInstanceName());\\n });\\n\\n Thread t3 = new Thread(() -> {\\n MySingletonFactory threadDemo3 = MySingletonFactory.getSingletonInstance(\\\"thread3Instance\\\");\\n System.out.println(threadDemo3.getInstanceName());\\n });\\n\\n t1.start();\\n t2.start();\\n t3.start();\\n\\n //Order and occurrence will be completely random\\n\\n /* o/p:\\n thread2Instance\\n thread3Instance\\n thread3Instance\\n */\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7d60803205a0dbc295f1b26cebc6767\",\n \"score\": \"0.551022\",\n \"text\": \"@Test\\n\\tpublic void multipleSpontaneousTest() throws BIPException {\\n\\n\\t\\tfinal int noIterations = 5;\\n\\t\\tfinal int noOfMilisecondsBetweenS = 10;\\n\\t\\tfinal int executorLoopDelay = 1000;\\n\\n\\t\\tBIPGlue bipGlue = new GlueBuilder() {\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void configure() {\\n\\n\\t\\t\\t\\tport(PSSComponent.class, \\\"p\\\").requires(RComponent.class, \\\"r\\\");\\n\\t\\t\\t\\tport(PSSComponent.class, \\\"p\\\").accepts(RComponent.class, \\\"r\\\");\\n\\n\\t\\t\\t\\tport(RComponent.class, \\\"r\\\").accepts(PSSComponent.class, \\\"p\\\");\\n\\n\\t\\t\\t\\tport(RComponent.class, \\\"r\\\").requires(PSSComponent.class, \\\"p\\\");\\n\\n\\t\\t\\t}\\n\\n\\t\\t}.build();\\n\\n\\t\\tBIPEngine engine = engineFactory.create(\\\"myEngine\\\", bipGlue);\\n\\n\\t\\t// Component P that does not need enable signals.\\n\\n\\t\\tPSSComponent pComponent = new PSSComponent(true);\\n\\n\\t\\tfinal BIPActor pExecutor = engine.register(pComponent, \\\"pComponent\\\", true);\\n\\n\\t\\t// Component R\\n\\n\\t\\tRComponent rComponent = new RComponent();\\n\\n\\t\\tfinal BIPActor rExecutor = engine.register(rComponent, \\\"rComponent\\\", true);\\n\\n\\t\\tThread testDriver1 = new Thread(new Runnable() {\\n\\n\\t\\t\\tpublic void run() {\\n\\n\\t\\t\\t\\tRandom random = new Random(100);\\n\\t\\t\\t\\tfor (int i = 0; i < noIterations; i++) {\\n\\t\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\t\\tThread.sleep(random.nextInt(noOfMilisecondsBetweenS));\\n\\t\\t\\t\\t\\t} catch (InterruptedException e) {\\n\\t\\t\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t// This spontaneous signal can be a bit problematic as the\\n\\t\\t\\t\\t\\t// guard is never true,\\n\\n\\t\\t\\t\\t\\tpExecutor.inform(\\\"s1\\\");\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t}, \\\"TestDriver1\\\");\\n\\n\\t\\tThread testDriver2 = new Thread(new Runnable() {\\n\\n\\t\\t\\tpublic void run() {\\n\\n\\t\\t\\t\\tRandom random = new Random(100);\\n\\t\\t\\t\\tfor (int i = 0; i < noIterations; i++) {\\n\\t\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\t\\tThread.sleep(random.nextInt(noOfMilisecondsBetweenS));\\n\\t\\t\\t\\t\\t} catch (InterruptedException e) {\\n\\t\\t\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t// This spontaneous signal can be a bit problematic as the\\n\\t\\t\\t\\t\\t// guard is never true,\\n\\n\\t\\t\\t\\t\\tpExecutor.inform(\\\"s1\\\");\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t}, \\\"TestDriver2\\\");\\n\\n\\t\\tThread testDriver3 = new Thread(new Runnable() {\\n\\n\\t\\t\\tpublic void run() {\\n\\n\\t\\t\\t\\tRandom random = new Random(100);\\n\\t\\t\\t\\tfor (int i = 0; i < noIterations; i++) {\\n\\t\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\t\\tThread.sleep(random.nextInt(noOfMilisecondsBetweenS));\\n\\t\\t\\t\\t\\t} catch (InterruptedException e) {\\n\\t\\t\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t// This spontaneous signal can be a bit problematic as the\\n\\t\\t\\t\\t\\t// guard is never true,\\n\\n\\t\\t\\t\\t\\tpExecutor.inform(\\\"s2\\\");\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t}, \\\"TestDriver3\\\");\\n\\n\\t\\tThread testDriver4 = new Thread(new Runnable() {\\n\\n\\t\\t\\tpublic void run() {\\n\\n\\t\\t\\t\\tRandom random = new Random(100);\\n\\t\\t\\t\\tfor (int i = 0; i < noIterations; i++) {\\n\\t\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\t\\tThread.sleep(random.nextInt(noOfMilisecondsBetweenS));\\n\\t\\t\\t\\t\\t} catch (InterruptedException e) {\\n\\t\\t\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t// This spontaneous signal can be a bit problematic as the\\n\\t\\t\\t\\t\\t// guard is never true,\\n\\n\\t\\t\\t\\t\\trExecutor.inform(\\\"s\\\");\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t}, \\\"TestDriver4\\\");\\n\\n\\t\\tengine.specifyGlue(bipGlue);\\n\\t\\tengine.start();\\n\\n\\t\\ttestDriver1.start();\\n\\t\\ttestDriver2.start();\\n\\t\\ttestDriver3.start();\\n\\t\\ttestDriver4.start();\\n\\n\\t\\tint sleepCounter = 0;\\n\\n\\t\\tengine.execute();\\n\\n\\t\\twhile (pComponent.pCounter < noIterations) {\\n\\t\\t\\tfinal int internalSleep = 20000;\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tThread.sleep(internalSleep);\\n\\t\\t\\t} catch (InterruptedException e) {\\n\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t}\\n\\t\\t\\tsleepCounter++;\\n\\t\\t\\tif (sleepCounter > 2 * noOfMilisecondsBetweenS * noIterations / internalSleep + executorLoopDelay\\n\\t\\t\\t\\t\\t* noIterations * 2 / internalSleep + 1)\\n\\t\\t\\t\\tbreak;\\n\\t\\t}\\n\\n\\t\\tengine.stop();\\n\\t\\tengineFactory.destroy(engine);\\n\\n\\t\\tassertEquals(noIterations * 2, pComponent.spontaneousEnableCounter);\\n\\t\\tassertEquals(noIterations, pComponent.spontaneousDisableCounter);\\n\\t\\tassertEquals(noIterations, pComponent.pCounter);\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f78f4462955f803b8f4ea34afca86c0\",\n \"score\": \"0.5496727\",\n \"text\": \"static void test1() {\\n\\n System.out.println( \\\"Begin test1. ===============================\\\\n\\\" );\\n\\n Thread init = Thread.currentThread(); // init spawns the Woolies\\n\\n // Create a TrollsBridge of capacity 3.\\n TrollsBridge trollBridge = new TrollsBridge( 3 );\\n\\n int delay = 1000;\\n\\n // Create the Woolies and store them in an array.\\n Thread peds[] = {\\n new Woolie( \\\"Al\\\", 3, SIDE_ONE, trollBridge ),\\n new Woolie( \\\"Bob\\\", 2, SIDE_ONE, trollBridge ),\\n new Woolie( \\\"Cathy\\\", 2, SIDE_TWO, trollBridge ),\\n new Woolie( \\\"Doris\\\", 3, SIDE_TWO, trollBridge ),\\n new Woolie( \\\"Edith\\\", 3, SIDE_ONE, trollBridge ),\\n new Woolie( \\\"Fred\\\", 2, SIDE_TWO, trollBridge ),\\n };\\n\\n for ( int j = 0; j < peds.length; ++j ) {\\n // Run them by calling their start() method.\\n try {\\n peds[j].start();\\n init.sleep( delay ); // delay start of next woolie\\n }\\n catch ( InterruptedException e ) {\\n System.err.println( \\\"Abort. Unexpected thread interruption.\\\" );\\n }\\n }\\n // Now, the test must give the woolies time to finish their crossings.\\n for ( int j = 0; j < peds.length; ++j ) {\\n try {\\n peds[j].join(); // wait for next woolie to finish\\n }\\n catch ( InterruptedException e ) {\\n System.err.println( \\\"Abort. Unexpected thread interruption.\\\" );\\n }\\n }\\n\\n System.out.println( \\\"\\\\n=============================== End test1.\\\" );\\n return;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b667ae59d559619426286fa5dc695daa\",\n \"score\": \"0.54932857\",\n \"text\": \"@Test(timeout = 10000)\\n public void testImpactSeed() {\\n\\n \\tlong seed1 = getSeed();\\n \\tlong seed2 = getSeed();\\n\\t\\twhile (seed1 == seed2) {\\n\\t\\t\\tseed2 = getSeed();\\n\\t\\t}\\n\\t\\tIExecution exec = getExecution();\\n\\t\\t\\n\\t\\t// are the properties ok ? \\n\\t\\tIGenlabGraph g1 = generateGraph(seed1, lib, exec);\\n\\t\\t\\n\\t\\t// let's generate it with another seed\\n\\t\\tIGenlabGraph g2 = generateGraph(seed2, lib, exec);\\n\\t\\t\\n\\t\\t// these graph should be different\\n\\t\\tAssert.assertFalse(\\n\\t\\t\\t\\t\\\"two graphs generated with different seeds should be different\\\", \\n\\t\\t\\t\\tlib.computeIsomorphicm(g1, g2, exec)\\n\\t\\t\\t\\t);\\n\\t\\t\\n\\t\\t// let's generate another one with the first seed\\n\\t\\tIGenlabGraph g3 = generateGraph(seed1, lib, exec);\\n\\t\\t\\n\\t\\t// these graph should be similar\\n\\t\\tAssert.assertTrue(\\n\\t\\t\\t\\t\\\"two graphs generated with the same seed should be similar\\\",\\n\\t\\t\\t\\tlib.computeIsomorphicm(g1, g3, exec)\\n\\t\\t\\t\\t);\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4371dad3089ef3d4558625002b757d24\",\n \"score\": \"0.54681987\",\n \"text\": \"@Before public void setUp() throws InterruptedException {\\n\\t\\thelloWorld42Writeable = new File(\\\"helloWorld\\\", 42, true);\\n\\t\\thelloWorld43Writeable = new File(\\\"helloWorld\\\", 43, true);\\n\\t\\thelloWorld44Writeable = new File(\\\"helloWorld\\\", 44, true);\\n\\t\\t\\n\\t\\thelloWorld42NotWriteable = new File(\\\"helloWorld\\\", 42, false);\\n\\t\\t\\n\\t\\ttimeTest1 = new File(\\\"time\\\", 1, true);\\n\\t\\ttimeTest3 = new File(\\\"time\\\", 3, true);\\n\\t\\t\\n\\t\\tTimeUnit.SECONDS.sleep(1);\\n\\t\\ttimeTest1.setName(\\\"nextTime\\\");\\n\\t\\tTimeUnit.SECONDS.sleep(1);\\n\\t\\ttimeTest3.setName(\\\"nextTime\\\");\\n\\t\\ttimeTest2 = new File(\\\"time\\\", 2, true);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c37cabf387efc1b92df2f3f6c726bbbc\",\n \"score\": \"0.54543406\",\n \"text\": \"@Override\\n public void run() {\\n while (true) {\\n try {\\n System.out.println(\\\"Waiting for instance \\\"+ newInstanceId + \\\" to be running - inside dedicated Thread\\\");\\n Thread.sleep(10000);\\n } catch (InterruptedException e) {\\n System.out.println(\\\"An error occurred on Thread.Sleep in AutoScaling.launchNewInstance()\\\");\\n }\\n final Instance instanceAwaitingLaunch = getInstanceStatusCode(newInstanceId);\\n final int statusCode = instanceAwaitingLaunch.getState().getCode();\\n if (statusCode > 16) {\\n //If the cargo is the maximum long, then the check will fail and the request will try to use/create another instance\\n runningInstances.remove(newInstanceId, newSystemInstance);\\n newSystemInstance.status = SystemInstance.DUMMY_STATUS; // DUMMY state invalidates the instance\\n break;\\n } else if (statusCode == 16) {\\n newSystemInstance.publicIPAddress = instanceAwaitingLaunch.getPublicIpAddress();\\n synchronized (autoScalerLock){\\n try {\\n autoScalerLock.wait(10000);\\n } catch (InterruptedException e) {\\n\\n }\\n newSystemInstance.status = SystemInstance.RUNNING_STATUS;\\n autoScalerLock.notifyAll();\\n }\\n System.out.println(\\\"Instance created (inside thread) with IP \\\" + newSystemInstance.publicIPAddress);\\n break;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d9d1547e1f3ab0cf0929779043d77bb\",\n \"score\": \"0.54505074\",\n \"text\": \"@Test(enabled = false, dataProvider = \\\"StateTest\\\")\\n public void testStateTest(final StateTest test) throws InterruptedException {\\n final StateMonitoringThreadFactory factory = new StateMonitoringThreadFactory(test.getNStates());\\n final ExecutorService threadPool = Executors.newFixedThreadPool(test.getNStates(), factory);\\n\\n logger.warn(\\\"Running \\\" + test);\\n synchronized (GLOBAL_LOCK) {\\n //logger.warn(\\\" Have lock\\\");\\n for ( final Thread.State threadToRunState : test.getStatesForThreads() )\\n threadPool.submit(new StateTestThread(threadToRunState));\\n\\n // lock has to be here for the whole running of the activeThreads but end before the sleep so the blocked activeThreads\\n // can block for their allotted time\\n threadPool.shutdown();\\n Thread.sleep(THREAD_TARGET_DURATION_IN_MILLISECOND);\\n }\\n //logger.warn(\\\" Releasing lock\\\");\\n threadPool.awaitTermination(10, TimeUnit.SECONDS);\\n //logger.warn(\\\" done awaiting termination\\\");\\n //logger.warn(\\\" waiting for all activeThreads to complete\\\");\\n factory.waitForAllThreadsToComplete();\\n //logger.warn(\\\" done waiting for activeThreads\\\");\\n\\n // make sure we counted everything properly\\n final long totalTime = factory.getTotalTime();\\n final long minTime = (long)(THREAD_TARGET_DURATION_IN_MILLISECOND * 0.5) * test.getNStates();\\n final long maxTime = (long)(THREAD_TARGET_DURATION_IN_MILLISECOND * 1.5) * test.getNStates();\\n //logger.warn(\\\"Testing total time\\\");\\n Assert.assertTrue(totalTime >= minTime, \\\"Factory results not properly accumulated: totalTime = \\\" + totalTime + \\\" < minTime = \\\" + minTime);\\n Assert.assertTrue(totalTime <= maxTime, \\\"Factory results not properly accumulated: totalTime = \\\" + totalTime + \\\" > maxTime = \\\" + maxTime);\\n\\n for (final Thread.State state : StateMonitoringThreadFactory.TRACKED_STATES ) {\\n final double min = test.minStateFraction(state);\\n final double max = test.maxStateFraction(state);\\n final double obs = factory.getStateFraction(state);\\n// logger.warn(\\\" Checking \\\" + state\\n// + \\\" min \\\" + String.format(\\\"%.2f\\\", min)\\n// + \\\" max \\\" + String.format(\\\"%.2f\\\", max)\\n// + \\\" obs \\\" + String.format(\\\"%.2f\\\", obs)\\n// + \\\" factor = \\\" + factory);\\n Assert.assertTrue(obs >= min, \\\"Too little time spent in state \\\" + state + \\\" obs \\\" + obs + \\\" min \\\" + min);\\n Assert.assertTrue(obs <= max, \\\"Too much time spent in state \\\" + state + \\\" obs \\\" + obs + \\\" max \\\" + min);\\n }\\n\\n // we actually ran the expected number of activeThreads\\n Assert.assertEquals(factory.getNThreadsCreated(), test.getNStates());\\n\\n // should be called to ensure we don't format / NPE on output\\n factory.printUsageInformation(logger, Priority.INFO);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8fa05e5c882245f35cbb7762ce9b1db9\",\n \"score\": \"0.54433775\",\n \"text\": \"@Before\\r\\n\\tpublic void setUp() throws Exception \\r\\n\\t{\\r\\n\\t\\ttetrisObject = new Tetris();\\r\\n\\t\\ttetrisObject.random = new Random();\\r\\n\\t\\ttetrisObject.gameSpeed = 1.0f;\\r\\n\\t\\ttetrisObject.logicTimer = new Clock(tetrisObject.gameSpeed);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a6bd9261f713135693784196982692c\",\n \"score\": \"0.5430726\",\n \"text\": \"public static void main(String[] args) {\\n\\n for (int i = 0; i < 1000; i++) {\\n new Thread(() -> {\\n System.out.println(SingletonDemo03.getInstance().hashCode());\\n }).start();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c72652d2e8479d85b937f3133c8a5e6c\",\n \"score\": \"0.54270786\",\n \"text\": \"public void testBeginningAtGen() {\\n sch.scheduleActionBeginning(1, this, \\\"actionMethod\\\");\\n sch.scheduleActionAt(5.43, this, \\\"actionMethod\\\");\\n for (int i = 0; i < 10; i++) {\\n sch.execute();\\n }\\n\\n for (int i = 0; i < 5; i++) {\\n assertEquals(i + 1, results.get(i), 0.0);\\n }\\n\\n assertEquals(5.43, results.get(5), 0.0);\\n\\n for (int i = 6; i < results.size(); i++) {\\n assertEquals(i, results.get(i), 0.0);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c4b61fc9a8b1c5e5b4750a1fba3934b\",\n \"score\": \"0.54246515\",\n \"text\": \"public static void main(String[] args)\\n {\\n autoTest();\\n //Instant end = Instant.now();\\n //out.println(\\\"usec \\\"+ChronoUnit.MICROS.between(start, end)); \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bff1153adb0a32b3dd8f635d65086b5e\",\n \"score\": \"0.54200375\",\n \"text\": \"@Test\\n public void timeTest() throws InterruptedException {\\n Assert.assertTrue(true);\\n long recentUnix = System.currentTimeMillis();\\n long diff = recentUnix - currentUnix;\\n long seconds = TimeUnit.SECONDS.convert(diff, TimeUnit.MILLISECONDS) + 3;\\n\\n final Map<String, Integer> coinIDs = new HashMap<String, Integer>();\\n long cacheExpiryTime = 2; //2 seconds\\n if(seconds > cacheExpiryTime) {\\n final Map<String, Object> listings = api.getListings();\\n if (listings != null && !listings.isEmpty()) {\\n final List<Object> dataList = (List<Object>) listings.get(\\\"data\\\");\\n for (Object dataobject : dataList) {\\n Map<String, Object> map = (Map<String, Object>) dataobject;\\n final Integer id = (Integer) map.get(\\\"id\\\");\\n final String symbol = (String) map.get(\\\"symbol\\\");\\n if (!coinIDs.containsKey(symbol) && !coinIDs.containsValue(id)) {\\n coinIDs.put(symbol, id);\\n }\\n }\\n }\\n }\\n\\n Assert.assertFalse(coinIDs.isEmpty());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4151c3d1138d8fc1922e2e858af4fe76\",\n \"score\": \"0.54181063\",\n \"text\": \"static void test3() {\\n\\n System.out.println( \\\"Begin test3. ===============================\\\\n\\\" );\\n\\n Thread init = Thread.currentThread(); // init spawns the Woolies\\n\\n // Create a TrollsBridge of capacity 3.\\n TrollsBridge trollBridge = new TrollsBridge( 3 );\\n\\n // Set an optional, test delay to stagger the start of each woolie.\\n int delay = 1000;\\n\\n // Create the Woolies and store them in an array.\\n Thread peds[] = {\\n new Woolie( \\\"Arceus\\\", 3, SIDE_ONE, trollBridge ),\\n new Woolie( \\\"Bulbasaur\\\", 4, SIDE_TWO, trollBridge ),\\n new Woolie( \\\"Cresselia\\\", 7, SIDE_ONE, trollBridge),\\n new Woolie( \\\"Darkrai\\\", 2, SIDE_TWO, trollBridge),\\n new Woolie( \\\"Entei\\\", 7, SIDE_ONE, trollBridge),\\n new Woolie( \\\"Ferrothorn\\\",3, SIDE_TWO, trollBridge),\\n new Woolie( \\\"Genesect\\\", 2, SIDE_ONE, trollBridge),\\n new Woolie( \\\"Heatran\\\", 9, SIDE_TWO, trollBridge),\\n new Woolie( \\\"Infernape\\\", 7, SIDE_ONE, trollBridge),\\n new Woolie( \\\"Jirachi\\\", 10, SIDE_TWO, trollBridge),\\n new Woolie( \\\"Keldeo\\\", 4, SIDE_ONE, trollBridge),\\n new Woolie( \\\"Landorus\\\", 7, SIDE_TWO, trollBridge),\\n new Woolie( \\\"Mew\\\", 5, SIDE_ONE, trollBridge),\\n new Woolie( \\\"Nidoking\\\" , 8, SIDE_TWO, trollBridge),\\n new Woolie( \\\"Omanyte\\\", 9, SIDE_ONE, trollBridge),\\n new Woolie( \\\"Palkia\\\", 3, SIDE_TWO, trollBridge),\\n new Woolie( \\\"Quilava\\\", 4, SIDE_ONE, trollBridge),\\n new Woolie( \\\"Regigigas\\\", 6, SIDE_TWO, trollBridge),\\n new Woolie( \\\"Shaymin\\\", 7, SIDE_ONE, trollBridge),\\n new Woolie( \\\"Terrakion\\\", 8, SIDE_TWO, trollBridge),\\n new Woolie( \\\"Uxie\\\", 5, SIDE_ONE, trollBridge),\\n new Woolie( \\\"Volcanion\\\", 3, SIDE_TWO, trollBridge),\\n new Woolie( \\\"Weavile\\\", 4, SIDE_ONE, trollBridge),\\n new Woolie( \\\"Xerneas\\\", 2, SIDE_TWO, trollBridge),\\n new Woolie( \\\"Yveltal\\\", 9, SIDE_ONE, trollBridge),\\n new Woolie( \\\"Zygarde\\\", 7, SIDE_TWO, trollBridge),\\n };\\n\\n for ( int j = 0; j < peds.length; ++j ) {\\n // Run them by calling their start() method.\\n try {\\n peds[j].start();\\n init.sleep( delay );\\n }\\n catch ( InterruptedException e ) {\\n System.err.println( \\\"Abort. Unexpected thread interruption.\\\" );\\n break;\\n }\\n }\\n // Now, the test must give the woolies time to finish their crossings.\\n for ( int j = 0; j < peds.length; ++j ) {\\n try {\\n peds[j].join();\\n }\\n catch ( InterruptedException e ) {\\n System.err.println( \\\"Abort. Unexpected thread interruption.\\\" );\\n break;\\n }\\n }\\n System.out.println( \\\"\\\\n=============================== End test3.\\\" );\\n return;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2605a6d226876d04b69414804508e5de\",\n \"score\": \"0.5416426\",\n \"text\": \"private static void runTests() {\\n // Warm up the thread pool.\\n warmUpThreadPool();\\n\\n // Iterate thru the implementation strategies and test them.\\n for (var test : TestsToRun.values()) {\\n System.out.println(\\\"Starting \\\" + test);\\n\\n // Delete any the filtered images from the previous run.\\n deleteAllFiles(mFilters);\\n\\n // Create a list of lists that contains all the image URLs\\n // to obtain and process.\\n var urlLists = Options.instance()\\n .getUrlLists();\\n\\n // Make an ImageTaskGang object via the factory method.\\n ImageTaskGang taskGang = makeImageTaskGang(mFilters,\\n urlLists,\\n test);\\n\\n // Run the garbage collector here to avoid perturbing the\\n // test.\\n System.gc();\\n\\n // Start running the test.\\n RunTimer\\n .timeRun(taskGang,\\n test.toString());\\n\\n System.out.println(\\\"Ending \\\" + test);\\n }\\n\\n // Print out the timing results.\\n System.out.println(RunTimer.getTimingResults());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b6f65f28c9357be0c9977c9e85d42677\",\n \"score\": \"0.5410381\",\n \"text\": \"public void createTimedSimulatedBeacons(){\\n\\t\\tif (USE_SIMULATED_IBEACONS){\\n\\t\\t\\tiBeacons = new ArrayList<IBeacon>();\\n\\t\\t\\tIBeacon iBeacon1 = new IBeacon(\\\"DF7E1C79-43E9-44FF-886F-1D1F7DA6997A\\\".toLowerCase(), 1, 1);\\n\\t\\t\\tIBeacon iBeacon2 = new IBeacon(\\\"DF7E1C79-43E9-44FF-886F-1D1F7DA6997B\\\".toLowerCase(), 1, 2);\\n\\t\\t\\tIBeacon iBeacon3 = new IBeacon(\\\"DF7E1C79-43E9-44FF-886F-1D1F7DA6997C\\\".toLowerCase(), 1, 3);\\n\\t\\t\\tIBeacon iBeacon4 = new IBeacon(\\\"DF7E1C79-43E9-44FF-886F-1D1F7DA6997D\\\".toLowerCase(), 1, 4);\\n\\t\\t\\tiBeacons.add(iBeacon1);\\n\\t\\t\\tiBeacons.add(iBeacon2);\\n\\t\\t\\tiBeacons.add(iBeacon3);\\n\\t\\t\\tiBeacons.add(iBeacon4);\\n\\t\\t\\t\\n\\t\\t\\tfinal List<IBeacon> finalIBeacons = new ArrayList<IBeacon>(iBeacons);\\n\\n\\t\\t\\t//Clearing iBeacons list to prevent all iBeacons from appearing immediately.\\n\\t\\t\\t//These will be added back into the iBeacons list from finalIBeacons later.\\n\\t\\t\\tiBeacons.clear();\\n\\n\\t\\t\\tscheduleTaskExecutor= Executors.newScheduledThreadPool(5);\\n\\n\\t\\t\\t// This schedules an iBeacon to appear every 10 seconds:\\n\\t\\t\\tscheduleTaskExecutor.scheduleAtFixedRate(new Runnable() {\\n\\t\\t\\t\\tpublic void run() {\\n\\t\\t\\t\\t\\ttry{\\n\\t\\t\\t\\t\\t\\t//putting a single iBeacon back into the iBeacons list.\\n\\t\\t\\t\\t\\t\\tif (finalIBeacons.size() > iBeacons.size())\\n\\t\\t\\t\\t\\t\\t\\tiBeacons.add(finalIBeacons.get(iBeacons.size()));\\n\\t\\t\\t\\t\\t\\telse \\n\\t\\t\\t\\t\\t\\t\\tscheduleTaskExecutor.shutdown();\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t}catch(Exception e){\\n\\t\\t\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}, 0, 10, TimeUnit.SECONDS);\\n\\t\\t} \\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6973aaecc72b7a328fcd7aea75b7ac56\",\n \"score\": \"0.5395855\",\n \"text\": \"public static void timeTrial() {\\n\\t\\t\\n\\t\\tlong maxTime = 60000,\\n\\t\\t\\t timeElapsed = 0;\\n\\t\\tint counter = 4,\\n\\t\\t\\tmaxSteps = 100;\\n\\t\\tBoard b = null;\\n\\t\\twhile (timeElapsed < maxTime) {\\n\\t\\t\\tb = new Board(counter, maxSteps);\\n\\t\\t\\tb.doSteps();\\n\\t\\t\\ttimeElapsed = b.getTimeTaken();\\n\\t\\t\\tSystem.out.println(\\\"K=\\\"+counter+\\\"; \\\"+b.isOptimal()+\\\"; \\\"+timeElapsed +\\\" ms\\\");\\n\\t\\t\\tcounter++;\\n\\t\\t}\\n\\t\\tSystem.out.println(\\\"K=\\\"+counter+\\\"; \\\"+b.isOptimal()+\\\"; \\\"+timeElapsed +\\\" ms\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd1f0f7659c3c0998af6444b2676af39\",\n \"score\": \"0.53955203\",\n \"text\": \"@Test(timeout = 60000)\\n\\tpublic void testNonContagionBetweenThreads() {\\n\\t\\t\\n\\t\\tfinal int paralellThreads = 3;\\n\\t\\tfinal long theSeed = getSeed();\\n\\t\\tfinal int lenghtSeriesToTest=10;\\n\\t\\t\\n\\t\\tTestRandomnessRunnable[] pThreads = new TestRandomnessRunnable[paralellThreads];\\n\\t\\t\\n\\t\\t// init the threads\\n\\t\\tfor (int i=0; i<paralellThreads; i++) {\\n\\t\\t\\tpThreads[i] = new TestRandomnessRunnable(theSeed, lenghtSeriesToTest);\\n\\t\\t}\\n\\t\\t\\n\\t\\t// start the threads\\n\\t\\tfor (int i=0; i<paralellThreads; i++) {\\n\\t\\t\\tpThreads[i].start();\\n\\t\\t}\\n\\t\\t\\n\\t\\t// now wait for all of them\\n\\t\\tSystem.out.println(\\\"waiting for threads to finish...\\\");\\n\\t\\twhile (true) {\\n\\t\\t\\tboolean all_finished = true;\\n\\t\\t\\tfor (int i=0; i<paralellThreads; i++) {\\n\\t\\t\\t\\tif (!pThreads[i].finished) {\\n\\t\\t\\t\\t\\tall_finished = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (all_finished) \\n\\t\\t\\t\\tbreak;\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tThread.sleep(50);\\n\\t\\t\\t} catch (InterruptedException e) {\\n\\t\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t// analyze results: are the series the same ? \\n\\t\\tfor (int i=0; i<paralellThreads-1; i++) {\\n\\t\\t\\t\\n\\t\\t\\tfor (int j=0; j<lenghtSeriesToTest; j++) {\\n\\t\\t\\t\\tAssert.assertTrue(\\n\\t\\t\\t\\t\\t\\t\\\"with lib \\\"+lib.getClass().getCanonicalName()+\\\", random graph diverged despite of the same evolution of seeds; so the random number generator is shared between the different threads\\\",\\n\\t\\t\\t\\t\\t\\tlib.computeIsomorphicm(\\n\\t\\t\\t\\t\\t\\t\\t\\tpThreads[i].generated[j], \\n\\t\\t\\t\\t\\t\\t\\t\\tpThreads[i+1].generated[j], \\n\\t\\t\\t\\t\\t\\t\\t\\tgetExecution()\\n\\t\\t\\t\\t\\t\\t\\t\\t)\\n\\t\\t\\t\\t\\t\\t);\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\t// ok\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc589e09b11c3101fcd596b8aa0583c6\",\n \"score\": \"0.53861994\",\n \"text\": \"@Test(timeout=1000)\\n\\tpublic void testSingleton(){\\n\\t\\tMoneyFactory mf = MoneyFactory.getInstance();\\n\\t\\tMoneyFactory mf2 = MoneyFactory.getInstance();\\n\\t\\tassertTrue(mf==mf2);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65c51b225223e76271f7268faa56309d\",\n \"score\": \"0.53826004\",\n \"text\": \"@Test( expected = TooManyHoursException.class )\\n public void simulationTest_tooManyHoursOfOvertime() throws Exception {\\n Week currentWeek = new Week();\\n currentWeek.setResources( projectManagementSimulator.getInitialEmployees().stream().map( Resource::fromEmployee ).map( Resource::tooMany )\\n .collect( Collectors.toList() ) );\\n currentWeek.setSchedules( projectManagementSimulator.selectCurrentSchedule( projectManagementSimulator.getInitialSchedule(), 1 ) );\\n projectManagementSimulator.simulateWeek( currentWeek );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"45fbc26460e36801e54eba327a1c70a3\",\n \"score\": \"0.5381199\",\n \"text\": \"public void createRandomMatches(){\\n for (int i = 0; i < 30; i++){\\n Random rand = new Random();\\n int index_team1 = rand.nextInt(teams.size());\\n int index_team2 = rand.nextInt(teams.size());\\n WorldCupTeam team1 = teams.get(index_team1);\\n WorldCupTeam team2 = teams.get(index_team2);\\n int score1 = rand.nextInt(7);\\n int score2 = rand.nextInt(7);\\n \\n addMatch(team1,team2,score1,score2);\\n \\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"716fdee59906db38da12f83fd5c3bf8b\",\n \"score\": \"0.5378476\",\n \"text\": \"public void testBegInterval() {\\n //System.out.println(\\\"\\\\nbeg and interval\\\");\\n action.setName(\\\"beg action\\\");\\n Action a = new Action(sch);\\n a.setName(\\\"a - interval 2\\\");\\n Action b = new Action(sch);\\n b.setName(\\\"b - interval 4\\\");\\n\\n sch.scheduleActionAtInterval(2, a);\\n sch.scheduleActionAtInterval(4, b);\\n sch.scheduleActionBeginning(1, action);\\n\\n for (int i = 0; i < 12; i++) {\\n sch.execute();\\n }\\n\\n assertEquals(actionList.get(0), action);\\n Object o = actionList.get(1);\\n assertTrue(o.equals(action) || o.equals(a));\\n o = actionList.get(2);\\n assertTrue(o.equals(action) || o.equals(a));\\n\\n o = actionList.get(3);\\n assertTrue(o.equals(action));\\n\\n o = actionList.get(4);\\n assertTrue(o.equals(action) || o.equals(a) || o.equals(b));\\n o = actionList.get(5);\\n assertTrue(o.equals(action) || o.equals(a) || o.equals(b));\\n o = actionList.get(6);\\n assertTrue(o.equals(action) || o.equals(a) || o.equals(b));\\n\\n actionList.get(8);\\n assertTrue(o.equals(action) || o.equals(a));\\n o = actionList.get(9);\\n assertTrue(o.equals(action) || o.equals(a));\\n\\n o = actionList.get(10);\\n assertTrue(o.equals(action));\\n\\n o = actionList.get(11);\\n assertTrue(o.equals(action) || o.equals(a) || o.equals(b));\\n o = actionList.get(12);\\n assertTrue(o.equals(action) || o.equals(a) || o.equals(b));\\n o = actionList.get(13);\\n assertTrue(o.equals(action) || o.equals(a) || o.equals(b));\\n\\n o = actionList.get(14);\\n assertTrue(o.equals(action));\\n\\n actionList.get(15);\\n assertTrue(o.equals(action) || o.equals(a));\\n o = actionList.get(16);\\n assertTrue(o.equals(action) || o.equals(a));\\n\\n o = actionList.get(17);\\n assertTrue(o.equals(action));\\n\\n o = actionList.get(18);\\n assertTrue(o.equals(action) || o.equals(a) || o.equals(b));\\n o = actionList.get(19);\\n assertTrue(o.equals(action) || o.equals(a) || o.equals(b));\\n o = actionList.get(20);\\n assertTrue(o.equals(action) || o.equals(a) || o.equals(b));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d816a39dcccd749d9c4873b75b44f4b3\",\n \"score\": \"0.53772455\",\n \"text\": \"public void manyParallelNaive() {\\n long start = System.currentTimeMillis();\\n CompletableFuture<?>[] futures = new CompletableFuture<?>[1000];\\n for (int i = 0; i < futures.length; i++) {\\n int index = i;\\n futures[i] = CompletableFuture.supplyAsync(() -> {\\n try {\\n Thread.sleep(index / 10);\\n } catch (InterruptedException e) {\\n e.printStackTrace();\\n }\\n return null;\\n });\\n }\\n CompletableFuture.allOf(futures).join();\\n long end = System.currentTimeMillis();\\n assertTrue(end - start >= 100, \\\"Delay was not long enough\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"680f7b1a2ffa57771ac153f9b72a7b26\",\n \"score\": \"0.5372723\",\n \"text\": \"@RequestMapping(\\\"/startcreatingobjects/{timeToWait}\\\")\\n public void startCreatingObjects(@PathVariable int timeToWait) {\\n\\n taskExecutor.execute(() -> {\\n Map m = new HashMap();\\n while (true) {\\n for (int i = 0; i < NUMBER_OF_OBJECTS_TO_CREATE; i++) {\\n m.put(new Key(i), new MyNormalObject());\\n }\\n\\n System.out.println(\\\"Created objects\\\");\\n\\n // Wait for the given amount of time\\n try {\\n Thread.sleep(timeToWait);\\n } catch (InterruptedException e) {\\n e.printStackTrace();\\n }\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9d28e88f9ee885d15f19b63a8e426cf\",\n \"score\": \"0.537135\",\n \"text\": \"public void testAtConGen() {\\n sch.scheduleActionBeginning(1, this, \\\"actionMethod\\\");\\n sch.scheduleActionAt(2, this, \\\"actionMethodTag\\\");\\n\\n for (int j = 0; j < 25; j++) {\\n for (int i = 0; i < 10; i++) {\\n sch.execute();\\n }\\n\\n assertEquals(1, results.get(0), 0.0);\\n double res = results.get(1);\\n assertTrue(res == 999 || res == 2.0);\\n\\n res = results.get(2);\\n assertTrue(res == 999 || res == 2.0);\\n\\n\\n for (int i = 3; i < 11; i++) {\\n assertEquals(i, results.get(i), 0.0);\\n }\\n\\n setUp();\\n sch.scheduleActionBeginning(1, this, \\\"actionMethod\\\");\\n sch.scheduleActionAt(2, this, \\\"actionMethodTag\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c4dcae5336399a11e7cded55c2519080\",\n \"score\": \"0.53700733\",\n \"text\": \"@Test\\n public void pollingFrequencyTest() {\\n Service testServiceOne = new Service(\\\"Test-service-one\\\", \\\"127.0.0.1\\\", 8080, 0, 0, true);\\n Caller testCallerOne = new Caller(\\\"Caller-one\\\", 0);\\n Registry testRegistryOne = new Registry(\\\"Test-registry-one\\\", testCallerOne, testServiceOne, 9000);\\n ServiceRegister.getInstance().registerService(testRegistryOne);\\n\\n for (int i = 0; i < 10; i++) {\\n if (Monitor.checkPollingTime(testRegistryOne.getName())) { \\n testRegistryOne.setLastPollingTime(System.currentTimeMillis());\\n testRegistryOne.getService().setLastPollingTime(System.currentTimeMillis());\\n Runnable r = new ServiceStateChecker(testRegistryOne.getName());\\n new Thread(r).start();\\n //Since the polling frequency is 10 seconds, during 10 iteration it should be only \\n //first time allows to poll the service.\\n Assert.assertTrue(i==0);\\n }\\n }\\n //After test complete, clear the service register.\\n ServiceRegister.getInstance().reset();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4319864857286a82ad3826f951b4d41\",\n \"score\": \"0.53694427\",\n \"text\": \"private double testInstanceVar() {\\n instanceVar = new LocalClass();\\n\\n long start = currentTimeMillis();\\n for (int i = 0; i < N; i++) {\\n instanceVar.someFunc();\\n }\\n\\n long elapsed = currentTimeMillis() - start;\\n\\n double avg = (elapsed * 1000.0) / N;\\n\\n // System.out.println(\\\"elapsed time = \\\" + elapsed + \\\"ms\\\");\\n // System.out.println(avg + \\\" microseconds per execution\\\");\\n\\n return avg;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"91b33694d9d863e7d216bd5b813358cb\",\n \"score\": \"0.5367897\",\n \"text\": \"public static void main(String args[])\\n {\\n Simulation testSim = new Simulation();\\n Customer testCustomer;\\n int testTime = 0;\\n\\n if (testSim.numWaiting() == 0)\\n System.out.println(\\\"numWaiting--------------Pass\\\");\\n else\\n System.out.println(\\\"numWaiting--------------Fail\\\");\\n\\n if (testSim.numWithNoWait() == 0)\\n System.out.println(\\\"numWithNoWait-----------Pass\\\");\\n else\\n System.out.println(\\\"numWithNoWait-----------Fail\\\");\\n\\n if (testSim.calculateAverageWait() == 0)\\n System.out.println(\\\"calculateAverageWait----Pass\\\");\\n else\\n System.out.println(\\\"calculateAverageWait----Fail\\\");\\n\\n if (testSim.getTime() == 0)\\n System.out.println(\\\"getTime-----------------Pass\\\");\\n else\\n System.out.println(\\\"getTime-----------------Fail\\\");\\n\\n if (testSim.numServed() == 0)\\n System.out.println(\\\"numServed---------------Pass\\\");\\n else\\n System.out.println(\\\"numServed---------------Fail\\\");\\n\\n if (testSim.totalWaitTime() == 0)\\n System.out.println(\\\"totalWaitTime-----------Pass\\\");\\n else\\n System.out.println(\\\"totalWaitTime-----------Fail\\\");\\n\\n if (testSim.isHelpingCustomer())\\n System.out.println(\\\"isHelpingCustomer-------Fail\\\");\\n else\\n System.out.println(\\\"isHelpingCustomer-------Pass\\\");\\n\\n if (testSim.curCustomer().equals(\\\"none\\\"))\\n System.out.println(\\\"curCustomer-------------Pass\\\");\\n else\\n System.out.println(\\\"curCustomer-------------Fail\\\");\\n\\n testSim.advanceTime(1);\\n testTime += 1;\\n if (testSim.getTime() == testTime)\\n System.out.println(\\\"advanceTime-------------Pass\\\");\\n else\\n System.out.println(\\\"advanceTime-------------Fail\\\");\\n\\n testSim.advanceTime(-1);\\n if (testSim.getTime() == testTime)\\n System.out.println(\\\"advanceTime-------------Pass\\\");\\n else\\n System.out.println(\\\"advanceTime-------------Fail\\\");\\n\\n testSim.advanceTime(0);\\n if (testSim.getTime() == testTime)\\n System.out.println(\\\"advanceTime-------------Pass\\\");\\n else\\n System.out.println(\\\"advanceTime-------------Fail\\\");\\n \\n if (testSim.getTime() == 1)\\n System.out.println(\\\"getTime-----------------Pass\\\");\\n else\\n System.out.println(\\\"getTime-----------------Fail\\\");\\n\\n testCustomer = new Customer(testTime);\\n testSim.addCustomer(testCustomer);\\n if (testSim.numWithNoWait() == 1)\\n System.out.println(\\\"numWithNoWait-----------Pass\\\");\\n else\\n System.out.println(\\\"numWithNoWait-----------Fail\\\");\\n testSim.serveCustomer();\\n\\n if (testSim.numServed() == 1)\\n System.out.println(\\\"numServed---------------Pass\\\");\\n else\\n System.out.println(\\\"numServed---------------Fail\\\");\\n \\n for (int i = 0; i < MAX_LINE_LENGTH + 1; i++)\\n {\\n testCustomer = new Customer(testTime);\\n if (testSim.addCustomer(testCustomer))\\n System.out.println(\\\"addCustomer-------------Pass\\\");\\n else\\n System.out.println(\\\"addCustomer-------------Fail\\\");\\n }\\n\\n testCustomer = new Customer(testTime);\\n if (testSim.addCustomer(testCustomer))\\n System.out.println(\\\"addCustomer-------------Fail\\\");\\n else\\n System.out.println(\\\"addCustomer-------------Pass\\\");\\n\\n if (testSim.isHelpingCustomer())\\n System.out.println(\\\"isHelpingCustomer-------Pass\\\");\\n else\\n System.out.println(\\\"isHelpingCustomer-------Fail\\\");\\n\\n if (testSim.numWaiting() == 5)\\n System.out.println(\\\"numWaiting--------------Pass\\\");\\n else\\n System.out.println(\\\"numWaiting--------------Fail\\\");\\n\\n int numServed = testSim.peopleCompleted;\\n while (testSim.isHelpingCustomer())\\n {\\n testSim.serveCustomer();\\n if (numServed < testSim.peopleCompleted)\\n {\\n numServed = testSim.peopleCompleted;\\n System.out.println(\\\"serveCustomer-----------Pass\\\");\\n }\\n else\\n {\\n numServed = testSim.peopleCompleted;\\n System.out.println(\\\"serveCustomer-----------Fail\\\");\\n }\\n }\\n if (testSim.numServed() == 7)\\n System.out.println(\\\"numServed---------------Pass\\\");\\n else\\n System.out.println(\\\"numServed---------------Fail\\\");\\n\\n testCustomer = new Customer(testTime);\\n testSim.addCustomer(testCustomer);\\n if (testSim.curCustomer().equals(testCustomer.toString()))\\n System.out.println(\\\"curCustomer-------------Pass\\\");\\n else\\n System.out.println(\\\"curCustomer-------------Fail\\\");\\n testSim.serveCustomer();\\n \\n if (testSim.numServed() == 8)\\n System.out.println(\\\"numServed---------------Pass\\\");\\n else\\n System.out.println(\\\"numServed---------------Fail\\\");\\n\\n //Preping for first average test\\n testSim.curTime = 0;\\n testSim.peopleCompleted = 0;\\n testSim.peopleNoWait = 0;\\n testSim.peopleThatHadToWait = 0;\\n testSim.sumOfWaitTime = 0;\\n if (testSim.calculateAverageWait() == 0)\\n System.out.println(\\\"calculateAverageWait----Pass\\\");\\n else\\n System.out.println(\\\"calculateAverageWait----Fail\\\");\\n\\n//prepping for second average test\\n testSim.curTime = 7;\\n testSim.peopleCompleted = 1;\\n testSim.peopleNoWait = 1;\\n testSim.peopleThatHadToWait = 1;\\n testSim.sumOfWaitTime = 1;\\n if (testSim.calculateAverageWait() == 1.0)\\n System.out.println(\\\"calculateAverageWait----Pass\\\");\\n else\\n System.out.println(\\\"calculateAverageWait----Fail\\\");\\n\\n //prepping for third average test\\n testSim.curTime = 9;\\n testSim.peopleCompleted = 2;\\n testSim.peopleNoWait = 1;\\n testSim.peopleThatHadToWait = 2;\\n testSim.sumOfWaitTime = 1;\\n if (testSim.calculateAverageWait() == 0.5)\\n System.out.println(\\\"calculateAverageWait----Pass\\\");\\n else\\n System.out.println(\\\"calculateAverageWait----Fail\\\");\\n\\n//prepping for fourth average test\\n testSim.curTime = 13;\\n testSim.peopleCompleted = 3;\\n testSim.peopleNoWait = 1;\\n testSim.peopleThatHadToWait = 3;\\n testSim.sumOfWaitTime = 7;\\n if (testSim.calculateAverageWait() == 2.3333333333333335)\\n System.out.println(\\\"calculateAverageWait----Pass\\\");\\n else\\n System.out.println(\\\"calculateAverageWait----Fail\\\");\\n\\n//prepping for fifth average test\\n testSim.curTime = 22;\\n testSim.peopleCompleted = 8;\\n testSim.peopleNoWait = 1;\\n testSim.peopleThatHadToWait = 7;\\n testSim.sumOfWaitTime = 36;\\n if (testSim.calculateAverageWait() == 5.142857142857143)\\n System.out.println(\\\"calculateAverageWait----Pass\\\");\\n else\\n System.out.println(\\\"calculateAverageWait----Fail\\\");\\n\\n//prepping for sixth average test\\n testSim.curTime = 22;\\n testSim.peopleCompleted = 8;\\n testSim.peopleNoWait = 1;\\n testSim.peopleThatHadToWait = 7;\\n testSim.sumOfWaitTime = 36;\\n if (testSim.calculateAverageWait() == 5.142857142857143)\\n System.out.println(\\\"calculateAverageWait----Pass\\\");\\n else\\n System.out.println(\\\"calculateAverageWait----Fail\\\");\\n//using last setup to check the remaining methods\\n if (testSim.totalWaitTime() == 36)\\n System.out.println(\\\"totalWaitTime-----------Pass\\\");\\n else\\n System.out.println(\\\"totalWaitTime-----------Fail\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c699e610c6d621b996c2df8f43ec1fc\",\n \"score\": \"0.5367066\",\n \"text\": \"@Test\\n public void timer_isCorrect() throws InterruptedException\\n {\\n //Initialize parameters\\n createDefaultTimer();\\n try\\n {\\n mTimer.setTimerValue(5 * 1000);\\n mTimer.setIntervalValue(1 * 1000);\\n mTimer.setTimerRandom(false,\\n RandomStyleEnum.REGULAR,\\n 5 * 1000,\\n 10 * 1000,\\n 3);\\n mTimer.setLimitedHold(false, 10*1000);\\n\\n } catch (Exception e)\\n {\\n e.printStackTrace();\\n }\\n\\n //Initialize expected\\n long expectedTimerValue = 0;\\n long expectedIntervalValue = 0;\\n int expectedNumberOfIterations = 5;\\n\\n runTimer();\\n\\n //Verify end values are correct\\n assertEquals(expectedTimerValue, mTimer.getCurrentTimerValue());\\n assertEquals(expectedIntervalValue, mTimer.getCurrentIntervalValue());\\n assertEquals(expectedNumberOfIterations, mTimer.getCurrentIterationValue());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51fbfc3e39923d61ea5a8054de06d12b\",\n \"score\": \"0.53665006\",\n \"text\": \"@Test(timeout=1000)\\n public void testCreateMoney1() throws Exception {\\n for (int i = 0; i < notMoneyString.length; i++) {\\n assertFalse(\\\"notMoneyString\\\", creatingMoney(notMoneyString[i],moneyFactory));\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ead88f0d60b3c0bf6d8ffea25e2a0e7f\",\n \"score\": \"0.53664\",\n \"text\": \"public void stopCreate() {\\n hasStopped = false;\\n long inTime = System.currentTimeMillis();\\n doCreate = false;\\n while ((!hasStopped) && ((System.currentTimeMillis() - inTime) < 2000)) {\\n try {\\n Thread.sleep((long) 200);\\n } catch (Exception e) {\\n System.err.println(\\\"Interrupted sleep. How annoying!\\\");\\n }\\n }\\n if (!hasStopped) {\\n System.out.println(\\\"Unable to stop creation\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14375048ab533e8c1e30605fe8415565\",\n \"score\": \"0.53630847\",\n \"text\": \"@Test\\n public void invocationOfSumByGroupWith1000Hamsters() {\\n for (int i = 0; i < 100; i++) {\\n (new Thread(new TestHamster())).start();\\n LOGGER.info(\\\"Thread started #\\\"+i);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41c809d1c29166072e00f8ee5f8b7e6a\",\n \"score\": \"0.53573215\",\n \"text\": \"@Test\\n void illegalThreadStateExceptionTest2() throws ChartMapException, IOException{\\n ChartMap cm2 = new ChartMap(ChartOption.CHARTNAME, TEST_CHART_NAME, \\\"target/illegalThreadStateExceptionTest2.puml\\\", null, TIMEOUT_DEFAULT);\\n ChartMap scm2 = spy(cm2);\\n scm2.print();\\n ProcessBuilder pb2 = new ProcessBuilder(\\\"foo\\\", \\\"bar\\\");\\n ProcessBuilder spb2 = spy(pb2);\\n Process p2 = Runtime.getRuntime().exec(new String[] { \\\"echo\\\", \\\"illegalThreadStateExceptionTest2\\\" });\\n Process sp2 = spy(p2);\\n doThrow(IllegalThreadStateException.class).when(sp2).exitValue();\\n doReturn(sp2).when(spb2).start();\\n doReturn(spb2).when(scm2).getProcessBuilder(any(), any());\\n assertThrows(ChartMapException.class, () -> scm2.getHelmClientInformation());\\n System.out.println(\\\"IllegalThreadStateException -> ChartMapException thrown as expected in getHelmClientInformation\\\");\\n System.out.println(new Throwable().getStackTrace()[0].getMethodName().concat(\\\" completed\\\"));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"15f50ba9b17e05a34a5044a8a1365128\",\n \"score\": \"0.5352423\",\n \"text\": \"@Test\\n public void testRun() {\\n System.out.println(\\\"de.geekinbusiness.excelbreaker.BruteForceJobTest.testRun()\\\");\\n for (int i = 0; i < 2; i++) {\\n System.out.println(\\\"Start Job \\\" + i);\\n BruteForceJob bruteForceJob = new BruteForceJob(i, new testBooleanSup());\\n bruteForceJob.run();\\n }\\n System.out.println(\\\"Started all Jobs\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03b2361794eab27350f86a82708315cd\",\n \"score\": \"0.53466755\",\n \"text\": \"public void startSQLTest() throws Exception {\\n \\t\\tint size = this.clients.size();\\n \\t\\tint j=0;\\n \\t\\tint[] classList = new int[25];\\n \\t\\tint[] subList = classList;\\n \\t\\tfor (int i=0; i<25; i++) {\\n \\t\\t\\tclassList[i] = i+1;\\n \\t\\t}\\n \\t\\t\\n \\t\\tfor (KVStore client : clients) {\\n \\t\\t\\tif(size == 1) {\\n \\t\\t\\t\\tsubList = classList;\\n \\t\\t\\t}\\n \\t\\t\\tif(size == 5) {\\n \\t\\t\\t\\tsubList = Arrays.copyOfRange(classList, j*25/size, j*25/size+4);\\n \\t\\t\\t}\\n \\t\\t\\tif(size == 25) {\\n \\t\\t\\t\\tsubList = Arrays.copyOfRange(classList, j*25/size, j*25/size);\\n \\t\\t\\t}\\n\\t\\t\\tClientCreateSession createSession = new ClientCreateSession(client,subList);\\n\\t\\t\\tthis.createSessions.add(createSession);\\n\\n\\t\\t\\tClientInsertSession insertSession = new ClientInsertSession(client,subList);\\n\\t\\t\\tthis.insertSessions.add(insertSession);\\n\\t\\t\\tClientUpdateSession updateSession = new ClientUpdateSession(client,subList);\\n\\t\\t\\tthis.updateSessions.add(updateSession);\\n\\t\\t\\tClientSelectSession selectSession = new ClientSelectSession(client,subList);\\n\\t\\t\\tthis.selectSessions.add(selectSession);\\n\\t\\t\\tClientDeleteSession deleteSession = new ClientDeleteSession(client,subList);\\n\\t\\t\\tthis.deleteSessions.add(deleteSession);\\n\\t\\t\\t\\n\\t\\t\\tClientDropSession dropSession = new ClientDropSession(client,subList);\\n\\t\\t\\tthis.dropSessions.add(dropSession);\\n \\t\\t\\tj+=1;\\n \\t\\t}\\n \\t\\t//create latency\\n \\t\\tlong start = System.nanoTime();\\n \\t\\tfor (ClientCreateSession session : createSessions) {\\n \\t\\t\\tsession.start();\\n \\t\\t}\\n \\t\\twhile (true) {\\n \\t\\t\\tif (this.createSessions.isEmpty()) {\\n \\t\\t\\t\\tbreak;\\n \\t\\t\\t}\\n \\t\\t\\t//wait for the client session to be finished\\n \\t\\tThread.sleep(100);\\n \\t\\t\\tfor (Iterator<ClientCreateSession> iterator = createSessions.iterator(); iterator.hasNext(); ) {\\n \\t\\t\\t\\tClientCreateSession session = iterator.next();\\n \\t\\t\\t\\tif (session.finishFlag()) {\\n \\t\\t\\t\\t\\titerator.remove();\\n \\t\\t\\t\\t}\\n \\t\\t\\t}\\n \\t\\t}\\n \\t\\tlong end = System.nanoTime();\\n \\t\\tthis.totalCreateLatency = end-start;\\n \\t\\t//insert latency\\n \\t\\tstart = System.nanoTime();\\n \\t\\tfor (ClientInsertSession session : insertSessions) {\\n \\t\\t\\tsession.start();\\n \\t\\t}\\n \\t\\twhile (true) {\\n \\t\\t\\tif (this.insertSessions.isEmpty()) {\\n \\t\\t\\t\\tbreak;\\n \\t\\t\\t}\\n \\t\\t\\t//wait for the client session to be finished\\n \\t\\tThread.sleep(500);\\n \\t\\t\\tfor (Iterator<ClientInsertSession> iterator = insertSessions.iterator(); iterator.hasNext(); ) {\\n \\t\\t\\t\\tClientInsertSession session = iterator.next();\\n \\t\\t\\t\\tif (session.finishFlag()) {\\n \\t\\t\\t\\t\\titerator.remove();\\n \\t\\t\\t\\t}\\n \\t\\t\\t}\\n \\t\\t}\\n \\t\\tend = System.nanoTime();\\n \\t\\tthis.totalInsertLatency = end-start;\\n \\t\\t\\n \\t\\t//add nodes and remove nodes here\\n \\t\\tthis.addRemoveTest();\\n \\t\\t\\n \\t\\t//update latency\\n \\t\\tstart = System.nanoTime();\\n \\t\\tfor (ClientUpdateSession session : updateSessions) {\\n \\t\\t\\tsession.start();\\n \\t\\t}\\n \\t\\twhile (true) {\\n \\t\\t\\tif (this.updateSessions.isEmpty()) {\\n \\t\\t\\t\\tbreak;\\n \\t\\t\\t}\\n \\t\\t\\t//wait for the client session to be finished\\n \\t\\tThread.sleep(500);\\n \\t\\t\\tfor (Iterator<ClientUpdateSession> iterator = updateSessions.iterator(); iterator.hasNext(); ) {\\n \\t\\t\\t\\tClientUpdateSession session = iterator.next();\\n \\t\\t\\t\\tif (session.finishFlag()) {\\n \\t\\t\\t\\t\\titerator.remove();\\n \\t\\t\\t\\t}\\n \\t\\t\\t}\\n \\t\\t}\\n \\t\\tend = System.nanoTime();\\n \\t\\tthis.totalUpdateLatency = end-start;\\n \\t\\t//select latency\\n \\t\\tstart = System.nanoTime();\\n \\t\\tfor (ClientSelectSession session : selectSessions) {\\n \\t\\t\\tsession.start();\\n \\t\\t}\\n \\t\\twhile (true) {\\n \\t\\t\\tif (this.selectSessions.isEmpty()) {\\n \\t\\t\\t\\tbreak;\\n \\t\\t\\t}\\n \\t\\t\\t//wait for the client session to be finished\\n \\t\\tThread.sleep(500);\\n \\t\\t\\tfor (Iterator<ClientSelectSession> iterator = selectSessions.iterator(); iterator.hasNext(); ) {\\n \\t\\t\\t\\tClientSelectSession session = iterator.next();\\n \\t\\t\\t\\tif (session.finishFlag()) {\\n \\t\\t\\t\\t\\titerator.remove();\\n \\t\\t\\t\\t}\\n \\t\\t\\t}\\n \\t\\t}\\n \\t\\tend = System.nanoTime();\\n \\t\\tthis.totalSelectLatency = end-start;\\n \\t\\t//delete latency\\n \\t\\tstart = System.nanoTime();\\n \\t\\tfor (ClientDeleteSession session : deleteSessions) {\\n \\t\\t\\tsession.start();\\n \\t\\t}\\n \\t\\twhile (true) {\\n \\t\\t\\tif (this.deleteSessions.isEmpty()) {\\n \\t\\t\\t\\tbreak;\\n \\t\\t\\t}\\n \\t\\t\\t//wait for the client session to be finished\\n \\t\\tThread.sleep(500);\\n \\t\\t\\tfor (Iterator<ClientDeleteSession> iterator = deleteSessions.iterator(); iterator.hasNext(); ) {\\n \\t\\t\\t\\tClientDeleteSession session = iterator.next();\\n \\t\\t\\t\\tif (session.finishFlag()) {\\n \\t\\t\\t\\t\\titerator.remove();\\n \\t\\t\\t\\t}\\n \\t\\t\\t}\\n \\t\\t}\\n \\t\\tend = System.nanoTime();\\n \\t\\tthis.totalDeleteLatency = end-start;\\n \\t\\t\\n \\t\\t//drop latency\\n \\t\\tstart = System.nanoTime();\\n \\t\\tfor (ClientDropSession session : dropSessions) {\\n \\t\\t\\tsession.start();\\n \\t\\t}\\n \\t\\twhile (true) {\\n \\t\\t\\tif (this.dropSessions.isEmpty()) {\\n \\t\\t\\t\\tbreak;\\n \\t\\t\\t}\\n \\t\\t\\t//wait for the client session to be finished\\n \\t\\tThread.sleep(100);\\n \\t\\t\\tfor (Iterator<ClientDropSession> iterator = dropSessions.iterator(); iterator.hasNext(); ) {\\n \\t\\t\\t\\tClientDropSession session = iterator.next();\\n \\t\\t\\t\\tif (session.finishFlag()) {\\n \\t\\t\\t\\t\\titerator.remove();\\n \\t\\t\\t\\t}\\n \\t\\t\\t}\\n \\t\\t}\\n \\t\\tend = System.nanoTime();\\n \\t\\tthis.totalDropLatency = end-start; \\t\\t \\t\\t\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"061741fe9e31fd8bbb7f01b5e619e79d\",\n \"score\": \"0.5345254\",\n \"text\": \"@Test\\n @InSequence(10)\\n public void test010_schedule_pass() throws Exception {\\n this.logger.info(LOG_PREFIX + \\\"test010_schedule_pass\\\");\\n\\n final LocalDateTime localDateTime = LocalDateTime.now();\\n final int customerExpirySchedulerHour = localDateTime.getHour();\\n int customerExpirySchedulerMinute = localDateTime.getMinute();\\n \\n if (customerExpirySchedulerMinute == 60) {\\n // 60 is for timer not allowed.\\n customerExpirySchedulerMinute = customerExpirySchedulerMinute + 1;\\n }\\n \\n final boolean customerExpirySchedulerPersistent = false;\\n final DayOfWeek dayOfWeek = localDateTime.getDayOfWeek();\\n\\n this.customerExpirySchedulerSingletonEJB.initScheduler(dayOfWeek.name(), customerExpirySchedulerMinute,\\n customerExpirySchedulerHour, customerExpirySchedulerPersistent, ApplicationUserEnum.SYSTEM_USER.name());\\n\\n this.customerExpirySchedulerSingletonEJB.printoutNextTimeout(ApplicationUserEnum.SYSTEM_USER.name());\\n\\n // Waits for seconds, in worst case 1 minute has to be wait, +10 seconds\\n // for a buffer to ensure timer expiration.\\n TimeUnit.SECONDS.sleep(70);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e1819bf1e9d623d87c111df26133c1a\",\n \"score\": \"0.5343569\",\n \"text\": \"@Test\\n\\tpublic void testNewRun() {\\n\\t\\tint rNum = cTEV.runNumber;\\n\\t\\tTimer timer = cTEV.timer;\\n\\t\\tRace initialRace = cTEV.race;\\n\\t\\trace = cTEV.race;\\n\\t\\tassertEquals(1, cTEV.raceList.size());//default race stored at index zero\\n\\t\\tcTEV.timeEvent(\\\"newRun\\\", new String[] {}, \\\"\\\");\\n\\t\\tassertFalse(race == cTEV.race);\\n\\t\\tassertTrue((rNum+1) == cTEV.runNumber);\\n\\t\\t//test that timer is passed to new race\\n\\t\\tassertTrue(timer == cTEV.timer);\\n\\t\\t//test that raceList has a new entry\\n\\t\\tassertTrue(cTEV.raceList.get(1) == initialRace);\\n\\t\\tassertEquals(2, cTEV.raceList.size());\\n\\t\\t//test second race\\n\\t\\tRace secondRace = cTEV.race;\\n\\t\\tcTEV.timeEvent(\\\"newRun\\\", new String[] {}, \\\"\\\");\\n\\t\\tassertTrue(cTEV.raceList.get(2) == secondRace);\\n\\t\\tassertEquals(3, cTEV.raceList.size());\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"78b31e2a264da549cbfeebe20d102ac6\",\n \"score\": \"0.5342046\",\n \"text\": \"public void testBeginningDGen() {\\n sch.scheduleActionBeginning(.3, this, \\\"actionMethod\\\");\\n for (int i = 0; i < 10; i++) {\\n sch.execute();\\n }\\n\\n for (int i = 0; i < 10; i++) {\\n assertEquals(.3 + i, results.get(i), 0.0);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"30b5830f1397ffd79280304ecbf438c7\",\n \"score\": \"0.5339545\",\n \"text\": \"@Test(timeout = 4000)\\n public void test017() throws Throwable {\\n HomeEnvironment homeEnvironment0 = new HomeEnvironment();\\n homeEnvironment0.getVideoAspectRatio();\\n assertEquals(11053224, homeEnvironment0.getGroundColor());\\n assertTrue(homeEnvironment0.isObserverCameraElevationAdjusted());\\n assertEquals(400, homeEnvironment0.getPhotoWidth());\\n assertEquals(25, homeEnvironment0.getVideoFrameRate());\\n assertEquals(13427964, homeEnvironment0.getSkyColor());\\n assertEquals(300, homeEnvironment0.getPhotoHeight());\\n assertEquals(320, homeEnvironment0.getVideoWidth());\\n assertEquals(0.0F, homeEnvironment0.getWallsAlpha(), 0.01F);\\n assertEquals(13684944, homeEnvironment0.getCeillingLightColor());\\n assertEquals(13684944, homeEnvironment0.getLightColor());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f21a7a2ff6013adca43c2ce82afc6f4c\",\n \"score\": \"0.5338647\",\n \"text\": \"public void start() {\\r\\n\\t\\tfor (int i = 0; i < 10; i++) {\\r\\n\\t\\t\\tfor (int k = 0; k < beList.length; k++) {\\r\\n\\t\\t\\t\\tString cname = beList[k];\\r\\n\\t\\t\\t\\tString conParam = paramValues[k];\\r\\n\\t\\t\\t\\tObject o = factory.create(cname, conParam);\\r\\n\\t\\t\\t\\tif (o != null) {\\r\\n\\t\\t\\t\\t\\tSystem.out.println(o.getClass().getSimpleName() + \\\" wurde erzeugt\\\");\\r\\n\\t\\t\\t\\t\\tofen.beladen(o);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tSystem.gc();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b446a3eae17c37ddb2b627de78aeb2fd\",\n \"score\": \"0.5338053\",\n \"text\": \"@Test\\n void illegalThreadStateExceptionTest1() throws ChartMapException, InterruptedException, IOException {\\n ChartMap cm1 = createTestMapV12(ChartOption.CHARTNAME, TEST_CHART_NAME, OUTPUT_CHART_NAME_PUML_PATH, 3);\\n ChartMap scm1 = spy(cm1);\\n scm1.print();\\n Process p1 = Runtime.getRuntime()\\n .exec(new String[] { \\\"java\\\", \\\"-jar\\\", \\\"target/\\\".concat(new ChartMapTestUtil().getShadedJarName()),\\n \\\"-f\\\", INPUT_FILE_NAME_1, \\\"-r\\\", \\\"-e\\\", \\\"./resource/example/example-env-spec.yaml\\\", \\\"-v\\\", \\\"-o\\\",\\n \\\"target/\\\".concat(\\\"illegalThreadStateExceptionTest1.txt\\\") });\\n Process sp1 = spy(p1);\\n doReturn(sp1).when(scm1).getProcess(any(), eq(null));\\n doThrow(IllegalThreadStateException.class).when(sp1).exitValue();\\n assertThrows(ChartMapException.class, () -> scm1.checkHelmVersion());\\n System.out.println(new Throwable().getStackTrace()[0].getMethodName().concat(\\\" completed\\\"));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7d2ad2eb533b2b11a0847a5b1129452\",\n \"score\": \"0.5333412\",\n \"text\": \"@Test\\n public void testEC2BillingBothVMStoppedScenario() {\\n int firstTwoCloudletDur = 50;\\n Cloudlet cloudlet1 = createCloudlet(firstTwoCloudletDur);\\n Cloudlet cloudlet2 = createCloudlet(firstTwoCloudletDur);\\n cloudlet1.setUserId(broker.getId());\\n cloudlet2.setUserId(broker.getId());\\n\\n cloudlet1.setVmId(vm1.getId());\\n cloudlet2.setVmId(vm2.getId());\\n broker.submitCloudletList(Arrays.asList(cloudlet1, cloudlet2));\\n\\n int destroyVM1Time = HOUR / 3;\\n int destroyVM2Time = (HOUR * 4) / 3;\\n\\n broker.destroyVMsAfter(Arrays.asList(vm1), destroyVM1Time);\\n broker.destroyVMsAfter(Arrays.asList(vm2), destroyVM2Time);\\n\\n CloudSim.startSimulation();\\n // List<Cloudlet> resultList = broker.getCloudletReceivedList();\\n CloudSim.stopSimulation();\\n\\n vm1.getMetadata().setType(\\\"m1.small\\\");\\n vm1.getMetadata().setOS(NIX_OS);\\n vm2.getMetadata().setType(\\\"m1.medium\\\");\\n vm2.getMetadata().setOS(NIX_OS);\\n\\n double smallPrice = 0.065;\\n double medPrice = 0.130;\\n\\n ImmutableMap<Pair<String, String>, BigDecimal> prices = ImmutableMap\\n .<Pair<String, String>, BigDecimal> builder().put(of(\\\"m1.small\\\", NIX_OS), valueOf(smallPrice))\\n .put(of(\\\"m1.medium\\\", NIX_OS), valueOf(medPrice)).build();\\n IVmBillingPolicy policy = new EC2OnDemandPolicy(prices);\\n broker.setVMBillingPolicy(policy);\\n BigDecimal bill = broker.bill();\\n\\n // Compute expected bill\\n int times1 = destroyVM1Time / HOUR + 1;\\n int times2 = destroyVM2Time / HOUR + 1;\\n double expectedBill = smallPrice * times1 + medPrice * times2;\\n\\n assertEquals(expectedBill, bill.doubleValue(), 0.01);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"480b33601bf221358f66cb1747ebe999\",\n \"score\": \"0.5332658\",\n \"text\": \"public static void main(String[] args) throws InterruptedException {\\n\\t\\tlong startTime = System.nanoTime();\\r\\n\\t\\tint rerun = 5; // reset database and re-run; total ticket number retained.\\r\\n\\t\\tfor (int i = 0; i < rerun; i++) {\\r\\n\\t\\t\\tnew Simulation().multiGate(4,1000); // input number of gates, trials per gate. \\r\\n\\t\\t}\\r\\n\\t\\tlong endTime = System.nanoTime();\\r\\n\\t\\tSystem.out.println(\\\"\\\\nTest completed in \\\" + (endTime-startTime)/1000000L +\\\" ms\\\");\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e8679c4544e0ebf5dbbb32a8a7a2279\",\n \"score\": \"0.5329797\",\n \"text\": \"@Test(timeout=1000)\\n public void testSingleton() {\\n MoneyFactory f1 = MoneyFactory.getInstance();\\n MoneyFactory f2 = MoneyFactory.getInstance();\\n\\n assertTrue(\\\"f1 == f2?\\\",f1==f2);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b8ecb346924684f5e78081a4d584c19\",\n \"score\": \"0.5326566\",\n \"text\": \"@Override\\n\\tpublic void nextTimePoint() {\\n\\t\\tfor (int i = 0; i < getNrSpecies(); i++) {\\n\\t\\t\\tgetSpecies(i).nextTimePoint();\\n\\t\\t}\\n\\t\\tmultiplySpecies();\\n\\t\\tcheckAliveSpecies();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f61ec19120b8161830bc44132ab66eb\",\n \"score\": \"0.5325671\",\n \"text\": \"@Test (timeout = 10000)\\n\\tpublic void testCreateWar3(){\\n\\t\\tGameEngineModule game = new GameEngineModule();\\n\\t\\tint [] nwar = new int[1200];\\n\\t\\tfor (int i=0;i<1200;i++){\\n\\t\\t\\tnwar[i] = game.createWar(\\\"war\\\", \\\"des\\\");\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor (int i=0;i<1200;i++){\\n\\t\\t\\tSystem.out.print(nwar[i] + \\\",\\\");\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b5af65aeb9957e714d3d581e6fbb0af\",\n \"score\": \"0.5324958\",\n \"text\": \"@Test(timeout=300000)\\n public void test4() throws Throwable {\\n Future<?> future = executor.submit(new Runnable(){ \\n @Override public void run() { \\n byte[] byteArray0 = new byte[10];\\n String[] stringArray0 = new String[3];\\n ByteArrayInputStream byteArrayInputStream0 = new ByteArrayInputStream(byteArray0);\\n Console console0 = new Console((RmiJmxClient) null, (InputStream) byteArrayInputStream0, false, false);\\n VirtualDatabaseAdmin virtualDatabaseAdmin0 = console0.getAdminModule();\\n virtualDatabaseAdmin0.login(stringArray0);\\n assertEquals(\\\"VirtualDatabase Administration\\\", virtualDatabaseAdmin0.getDescriptionString());\\n } \\n });\\n future.get(4000, TimeUnit.MILLISECONDS);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e6fa61291448e1bab3d4ac2ddb7b4c1\",\n \"score\": \"0.5322564\",\n \"text\": \"public void testTimeModes() throws Exception{\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4246f38eea68eccb80afea09e18e784d\",\n \"score\": \"0.5315359\",\n \"text\": \"private void initInstances() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"323ee01b53862c6c0eefaee2ee059af9\",\n \"score\": \"0.5314877\",\n \"text\": \"@Test\\n\\tpublic final void testTwoPeersSameBalanceSameResourceUseOneWithMostRecentJob() {\\n\\n\\t\\tHashMap<Peer, Integer> resourcesBeingConsumed = new HashMap<Peer, Integer>();\\n\\t\\tHashSet<Task> runningElements = new HashSet<Task>();\\n\\n\\t\\tresourcesBeingConsumed.put(p2, 5);\\n\\t\\tresourcesBeingConsumed.put(p3, 5);\\n\\n\\t\\tJob job;\\n\\n\\t\\tjob = new Job(0, 10, p2);\\n\\t\\tjob.setStartTime(10);\\n\\t\\tfor (int id = 0; id < 5; id++) {\\n\\t\\t\\tTask Task = new Task(id, \\\"\\\", 10, 10, job);\\n\\t\\t\\tTask.setTaskExecution(new TaskExecution(Task,new Machine(\\\"m_bla\\\",Processor.EC2_COMPUTE_UNIT.getSpeed()).getDefaultProcessor(),10));\\n\\t\\t\\tTask.setStartTime(10);\\n\\t\\t\\trunningElements.add(Task);\\n\\t\\t}\\n\\n\\t\\tjob = new Job(1, 10, p3);\\n\\t\\tjob.setStartTime(10);\\n\\t\\tfor (int id = 0; id < 4; id++) {\\n\\t\\t\\tTask Task = new Task(id, \\\"\\\", 10, 10, job);\\n\\t\\t\\tTask.setTaskExecution(new TaskExecution(Task,new Machine(\\\"m_bla\\\",Processor.EC2_COMPUTE_UNIT.getSpeed()).getDefaultProcessor(),10));\\n\\t\\t\\tTask.setStartTime(10);\\n\\t\\t\\trunningElements.add(Task);\\n\\t\\t}\\n\\n\\t\\tTask Task = new Task(4, \\\"\\\", 10, 10, job);\\n\\t\\tTask.setTaskExecution(new TaskExecution(Task,new Machine(\\\"m_bla\\\",Processor.EC2_COMPUTE_UNIT.getSpeed()).getDefaultProcessor(),10));\\n\\t\\tTask.setStartTime(20);\\n\\t\\trunningElements.add(Task);\\n\\n\\t\\tList<Peer> preemptablePeers = nof.getPreemptablePeers(p1, p4, resourcesBeingConsumed, runningElements);\\n\\n\\t\\tassertEquals(1, preemptablePeers.size());\\n\\n\\t\\tassertEquals(p3, preemptablePeers.get(0));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9270fb91d240285004af4b2b5c221635\",\n \"score\": \"0.5314776\",\n \"text\": \"public static void main(String[] args){\\n ScheduledExecutorService executorService = Executors.newScheduledThreadPool(10);\\n for(int i=0;i<100;i++){\\n executorService.schedule(new Runnable() {\\n @Override\\n public void run() {\\n System.out.println(\\\"name:\\\"+Thread.currentThread().getName());\\n }\\n },1, TimeUnit.SECONDS);\\n }\\n executorService.shutdown();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ccd601ea7a8dec18a61c62cf3e6df627\",\n \"score\": \"0.5311647\",\n \"text\": \"public static void main(String[] args) {\\n\\t\\t// Create players\\n\\t\\tMancalaPlayer[] player = new MancalaPlayer[2];\\n\\n\\t\\t// (*1*) put player one class here\\n\\t\\tplayer[GameNode.MAX] = new AlexHaoMancalaPlayer(); \\n\\t\\t//\\t\\tplayer[GameNode.MAX] = new TnellerMancalaPlayer();\\n\\n\\t\\t// (*2*) put player two class here\\n\\t\\t//\\t\\tplayer[GameNode.MIN] = new HumanMancalaPlayer(); \\n\\t\\tplayer[GameNode.MIN] = new TnellerMancalaPlayer(); \\n\\n\\t\\t// Tournament\\n\\t\\tint nGames = 10;\\n\\t\\tint nP1Win = 0;\\n\\t\\tfor (int i = 0; i < nGames; i++) {\\n\\t\\t\\t\\n\\t\\t\\t// Start new game\\n\\t\\t\\tSystem.out.println(\\\"New game ! Game number \\\" + (i + 1));\\n\\t\\t\\t\\n\\t\\t\\t// Create times\\n\\t\\t\\tfinal long MILLISECONDS_PER_GAME = 300000L; // 5 minutes\\n\\t\\t\\tlong[] playerMillisRemaining = {MILLISECONDS_PER_GAME / 2L, MILLISECONDS_PER_GAME / 2L};\\n\\n\\t\\t\\t// Create a clock\\n\\t\\t\\tStopwatch clock = new Stopwatch();\\n\\t\\t\\tlong timeTaken;\\n\\n\\t\\t\\t// Create an initial node\\n\\t\\t\\tMancalaNode node = new TnellerMancalaNode(-1); //Random fair game\\n//\\t\\t\\tSystem.out.println(node);\\n\\n\\t\\t\\t// While game is on...\\n\\t\\t\\tint move;\\n\\t\\t\\tString winner = \\\"DRAW\\\";\\n\\t\\t\\tboolean p1Win = false;\\n\\t\\t\\tint moves = 0;\\n\\t\\t\\twhile (!node.gameOver()) {\\n\\t\\t\\t\\t// Request move from current player\\n\\t\\t\\t\\tlong timeRemaining = playerMillisRemaining[node.player];\\n\\t\\t\\t\\tclock.reset();\\n\\t\\t\\t\\tclock.start();\\n\\t\\t\\t\\tmove = player[node.player].chooseMove(node, timeRemaining);\\n\\t\\t\\t\\ttimeTaken = clock.stop();\\n\\n\\t\\t\\t\\t// Duduct time taken\\n\\t\\t\\t\\tplayerMillisRemaining[node.player] -= timeTaken;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Plus move\\n\\t\\t\\t\\tmoves ++;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (playerMillisRemaining[node.player] < 0) {\\n\\t\\t\\t\\t\\tif (node.player == GameNode.MAX) {\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"Player 1 game timer expired.\\\");\\n\\t\\t\\t\\t\\t\\twinner = \\\"PLAYER 2 WINS\\\";\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"Player 2 game timer expired.\\\");\\n\\t\\t\\t\\t\\t\\twinner = \\\"PLAYER 1 WINS\\\";\\n\\t\\t\\t\\t\\t\\tp1Win =true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// Update game state\\n\\t\\t\\t\\tif (VERBOSE) {\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Player \\\" \\n\\t\\t\\t\\t\\t\\t\\t+ ((node.player == GameNode.MAX) ? \\\"1\\\" : \\\"2\\\") \\n\\t\\t\\t\\t\\t\\t\\t+ \\\" makes move \\\" \\n\\t\\t\\t\\t\\t\\t\\t+ MancalaNode.moveToString(move) + \\\".\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tnode.makeMove(move);\\n\\n\\t\\t\\t\\t// Display Progress\\n//\\t\\t\\t\\tSystem.out.println(node);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tnP1Win += p1Win ? 1 : 0;\\n\\t\\t\\t\\n\\t\\t\\t// Display winner and statistics\\n\\t\\t\\tif (node.gameOver()) {\\n\\t\\t\\t\\tSystem.out.println(\\\"Number of moves of each players: \\\" + moves / 2);\\n\\t\\t\\t\\tif (node.utility() > 0)\\n\\t\\t\\t\\t\\twinner = \\\"PLAYER 1 WINS\\\";\\n\\t\\t\\t\\telse if (node.utility() < 0)\\n\\t\\t\\t\\t\\twinner = \\\"PLAYER 2 WINS\\\";\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\twinner = \\\"DRAW\\\";\\n\\t\\t\\t}\\n\\t\\t\\tSystem.out.println(\\\"Time Taken (ms): \\\");\\n\\t\\t\\tSystem.out.println(\\\"Player 1: \\\" + (MILLISECONDS_PER_GAME / 2L - playerMillisRemaining[GameNode.MAX]));\\n\\t\\t\\tSystem.out.println(\\\"Player 2: \\\" + (MILLISECONDS_PER_GAME / 2L - playerMillisRemaining[GameNode.MIN]));\\n\\t\\t\\tSystem.out.println(winner);\\n\\t\\t}\\n//\\t\\tSystem.out.println(\\\"Player 1 won: \\\" + nP1Win);\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"05d44264e8595fcc1e4317ebd7a3379e\",\n \"score\": \"0.5308292\",\n \"text\": \"@Test\\n public void testComplexWaitForLock() throws Exception {\\n cn = new ZkCloudname.Builder().setConnectString(\\\"localhost:\\\" + zkport).build().connect();\\n\\n final CloudnameLock.Scope scope = CloudnameLock.Scope.SERVICE;\\n final String lockName = \\\"testComplexWaitForLock\\\";\\n final int NUM_JOBS = 100;\\n\\n // Have some time to simulate work on each thread to assure no services performs work at the same time.\\n final int WORKLOAD_MS = 5;\\n\\n // Timeouts well above needed, but low enough to not hog time on build servers.\\n final int LOCK_TIMEOUT_MS = 60000; // 1 min\\n final int TEST_TIMEOUT_MS = 120000; // 2 min\\n\\n final List<CloudnameLock> lockList = new ArrayList<CloudnameLock>();\\n\\n for (int i = 0; i <NUM_JOBS; i++) {\\n final Coordinate coordinate = Coordinate.parse(i + \\\".service.user.cell\\\");\\n try {\\n cn.createCoordinate(coordinate);\\n } catch (CoordinateException e) {\\n fail(e.toString());\\n }\\n final ServiceHandle serviceHandle = cn.claim(coordinate);\\n lockList.add(serviceHandle.getCloudnameLock(scope, lockName));\\n }\\n\\n final CountDownLatch released = new CountDownLatch(NUM_JOBS - 1);\\n final CountDownLatch threadReadyLatch = new CountDownLatch(NUM_JOBS - 1);\\n\\n // Lock the first service lock\\n lockList.get(0).tryLock();\\n\\n final Work work = new Work(WORKLOAD_MS);\\n\\n for (int i = 1; i < NUM_JOBS; i++) {\\n final int num = i;\\n final Thread thread = new Thread() {\\n @Override\\n public void run() {\\n threadReadyLatch.countDown();\\n lockList.get(num).tryLock(LOCK_TIMEOUT_MS);\\n work.doWork();\\n lockList.get(num).release();\\n released.countDown();\\n }\\n };\\n thread.start();\\n }\\n\\n assertTrue(\\n \\\"Threads were not ready. Remaining threads that did not start: \\\" + threadReadyLatch.getCount() + \\\".\\\",\\n threadReadyLatch.await(TEST_TIMEOUT_MS, TimeUnit.MILLISECONDS));\\n\\n // Release first lock and wait for the mountain to fall...\\n lockList.get(0).release();\\n\\n assertTrue(\\n \\\"Not all jobs completed. Remaining jobs: \\\" + released.getCount() + \\\".\\\",\\n released.await(TEST_TIMEOUT_MS, TimeUnit.MILLISECONDS));\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ab8a4c6d9d201492a23d994c206386d\",\n \"score\": \"0.5305576\",\n \"text\": \"public void testBeginningGen() {\\n sch.scheduleActionBeginning(1, this, \\\"actionMethod\\\");\\n for (int i = 0; i < 10; i++) {\\n sch.execute();\\n }\\n\\n for (int i = 0; i < 10; i++) {\\n assertEquals(i + 1, results.get(i), 0.0);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ea4b28c33ad032061741b24999b3bcd\",\n \"score\": \"0.53052163\",\n \"text\": \"public static void main(String[] args) {\\n while (current_time < total_sim) {\\n\\n // TODO do something\\n\\n while (!planes_waiting_to_land.isEmpty()) {\\n\\n int time_in = planes_waiting_to_land.remove();\\n\\n // Plane already crashed\\n if (current_time - time_in > min_land) {\\n\\n planes_crashed++;\\n\\n // Landed successfully\\n } else {\\n\\n total_waiting_time_to_land += current_time - time_in;\\n\\n planes_landed++;\\n }\\n\\n check(min_land);\\n }\\n\\n while (planes_waiting_to_land.isEmpty() && !planes_waiting_to_takeoff.isEmpty()) {\\n\\n int time_in = planes_waiting_to_takeoff.remove();\\n\\n total_waiting_time_to_takeoff += current_time - time_in;\\n\\n planes_taken_off++;\\n\\n check(min_takeoff);\\n\\n }\\n\\n\\n // Checks every 20 minutes\\n check(1);\\n\\n } // while loop\\n System.out.println(\\\"landed: \\\" + planes_landed);\\n System.out.println(\\\"crashed: \\\" + planes_crashed);\\n System.out.println(\\\"avg wait land: \\\" + (double) total_waiting_time_to_land / (double) planes_landed);\\n\\n System.out.println(\\\"taken off: \\\" + planes_taken_off);\\n System.out.println(\\\"avg wait takeoff: \\\" + (double) total_waiting_time_to_takeoff/ (double) planes_taken_off);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"894130c09025111f3ee87cc879f4e96a\",\n \"score\": \"0.53030235\",\n \"text\": \"@Test\\n public void test() throws InterruptedException {\\n\\n final CopyOnWriteArrayList<Integer> list = new CopyOnWriteArrayList<>();\\n\\n new Thread(new Runnable() {\\n @Override\\n public void run() {\\n while (true) {\\n int listSize = list.size();\\n try {\\n TimeUnit.MILLISECONDS.sleep((int)Math.random()*1000);\\n } catch (InterruptedException e) {\\n }\\n Iterator<Integer> iterator = list.iterator();\\n int iCount=0;\\n while(iterator.hasNext()){\\n iCount++;\\n }\\n Assert.assertEquals(listSize,iCount);\\n \\n }\\n }\\n }).start();\\n\\n new Thread(new Runnable() {\\n @Override\\n public void run() {\\n for (int i = 0; i < 100; i++) {\\n list.add(i);\\n try {\\n TimeUnit.MILLISECONDS.sleep(300);\\n } catch (InterruptedException e) {\\n }\\n }\\n }\\n }).start();\\n\\n\\n\\n TimeUnit.SECONDS.sleep(10);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"534cd284a061d4aad2665772e1d26f90\",\n \"score\": \"0.5294864\",\n \"text\": \"@Before\\n public void setUp() throws IllegalArgumentException, IllegalAccessException, InstantiationException,\\n InvocationTargetException {\\n try {\\n Constructor<Time> c = Time.class.getDeclaredConstructor();\\n c.setAccessible(true);\\n Field f = Time.class.getDeclaredField(\\\"instance\\\");\\n f.setAccessible(true);\\n f.set(null, c.newInstance());\\n } catch (NoSuchFieldException e) {\\n fail(\\\"The class Time should have an attribute named instance for the singleton pattern!\\\");\\n } catch (NoSuchMethodException e) {\\n fail(\\\"The class Time should have a private constructor without any parameters!\\\");\\n }\\n\\n t = Time.getInstance();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b306a1a3168cdda3ceea336eacdac50\",\n \"score\": \"0.52941567\",\n \"text\": \"long getTimedOutInstanceCount();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3fea7bf262da429b715883c09d0d60ab\",\n \"score\": \"0.5291718\",\n \"text\": \"@Override\\n public void testPeriodic() {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b26602a90fca5ccf35cc2d3b3aa9077\",\n \"score\": \"0.5287201\",\n \"text\": \"@Test\\n public void benchmarkTinyGridGraphSequential() {\\n String name = \\\"TinyGridGraphSequential\\\";\\n /* ----------------------- Make sure name is unique!!! ---------------- */\\n \\n System.out.println(\\\"STARTING BENCHMARK: \\\" + name);\\n\\n /* --------------------------- SETUP CODE-----------------------------------------*/\\n BasicUndirectedGraph graph = TinyGridGraph != null\\n ? TinyGridGraph\\n : new GraphGenerator().GenerateGridGraph(numGridRowsTiny, numGridRowsTiny, minEdgeWeight, maxEdgeWeight, name);\\n TinyGridGraph = graph;\\n /* --------------------------- SETUP CODE-----------------------------------------*/\\n\\n // Warm up\\n System.out.print(\\\"Starting warmup...\\\");\\n for (int i = 0; i < WARMUP_ITERATIONS; i++) {\\n \\tSystem.out.print(\\\" \\\" + (i+1) + \\\"/\\\" + WARMUP_ITERATIONS);\\n /* --------------------------- TIMED CODE-------------------------------------*/\\n \\t\\tresultMST = new PrimsAlgorithmSequential().Run(graph);\\n /* --------------------------- TIMED CODE-------------------------------------*/\\n }\\n\\n // Timing\\n double[] times = new double[TIMING_ITERATIONS];\\n System.out.println(\\\"\\\\nStarting timing....\\\\n\\\");\\n for (int i = 0; i < TIMING_ITERATIONS; i++) {\\n System.out.print(\\\"Timing iteration: \\\" + (i+1));\\n long startTime = System.nanoTime();\\n /* --------------------------- TIMED CODE-------------------------------------*/\\n resultMST = new PrimsAlgorithmSequential().Run(graph);\\n /* --------------------------- TIMED CODE-------------------------------------*/\\n long endTime = System.nanoTime();\\n long duration = (endTime - startTime);\\n double seconds = (double)duration / 1000000000.0;\\n times[i] = seconds;\\n\\n System.out.println(\\\" time (s): \\\" + seconds);\\n }\\n\\n double average = average(times);\\n benchmarkScores.put(name, average);\\n\\n System.out.println(\\\"AVERAGE TIME (s): \\\" + average +\\\"\\\\n\\\");\\n\\n System.out.println(\\\"------------------------Current benchmark times (average, s)-------------------\\\");\\n for (String benchmark : benchmarkScores.keySet()) {\\n System.out.println(benchmark + \\\" \\\" + benchmarkScores.get(benchmark));\\n }\\n System.out.println();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8802e7c8a1d887f102080bde11a270fc\",\n \"score\": \"0.5286833\",\n \"text\": \"@Test\\n public void testConcurrentInvalidation() throws InterruptedException\\n {\\n long startVersion = tmd.getRingVersion();\\n\\n ExecutorService pool = Executors.newFixedThreadPool(Runtime.getRuntime().availableProcessors() + 1);\\n \\n int invalidations = 1024;\\n \\n for (int i = 0; i < invalidations; i++)\\n pool.execute(() -> tmd.invalidateCachedRings());\\n\\n pool.shutdown();\\n \\n assertTrue(pool.awaitTermination(30, TimeUnit.SECONDS));\\n assertEquals(invalidations + startVersion, tmd.getRingVersion());\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985491,"cells":{"query_id":{"kind":"string","value":"2f4140e71fd6fde46450b588b4cda9ce"},"query":{"kind":"string","value":"Attach all data to the DOM Document passed in."},"positive_passages":{"kind":"list like","value":[{"docid":"31dd2dd5093ede2c750429434b2984be","score":"0.0","text":"public Element encode(Document aDocument) throws EPPEncodeException {\n\n try {\n //Validate States\n validateState();\n }\n catch (EPPCodecException e) {\n cat.error(\"EPPRgpExtReport.encode(): Invalid state on encode: \"\n + e);\n throw new EPPEncodeException(\"EPPRgpExtReport invalid state: \"\n + e);\n }\n\n if (aDocument == null) {\n throw new EPPEncodeException(\"aDocument is null\" +\n \" on in EPPRgpExtReport.encode(Document)\");\n }\n\n Element root =\n aDocument.createElementNS(EPPRgpExtFactory.NS, ELM_NAME);\n\n // preData\n EPPUtil.encodeString(aDocument, root, preData, EPPRgpExtFactory.NS, ELM_PRE_DATA);\n\n // postData\n EPPUtil.encodeString(aDocument, root, postData, EPPRgpExtFactory.NS, ELM_POST_DATA);\n\n // delete time\n EPPUtil.encodeTimeInstant(aDocument, root, deleteTime, EPPRgpExtFactory.NS, ELM_DEL_TIME);\n\n // restore time\n EPPUtil.encodeTimeInstant(aDocument, root, restoreTime, EPPRgpExtFactory.NS, ELM_RES_TIME);\n\n // restore reason\n EPPUtil.encodeComp(aDocument,root,restoreReason);\n\n // restore statement1\n EPPUtil.encodeComp(aDocument,root,statement1);\n\n // restore statement2\n EPPUtil.encodeComp(aDocument,root,statement2);\n\n // optional\n EPPUtil.encodeString(aDocument, root, other, EPPRgpExtFactory.NS, ELM_OTHER);\n\n return root;\n }","title":""}],"string":"[\n {\n \"docid\": \"31dd2dd5093ede2c750429434b2984be\",\n \"score\": \"0.0\",\n \"text\": \"public Element encode(Document aDocument) throws EPPEncodeException {\\n\\n try {\\n //Validate States\\n validateState();\\n }\\n catch (EPPCodecException e) {\\n cat.error(\\\"EPPRgpExtReport.encode(): Invalid state on encode: \\\"\\n + e);\\n throw new EPPEncodeException(\\\"EPPRgpExtReport invalid state: \\\"\\n + e);\\n }\\n\\n if (aDocument == null) {\\n throw new EPPEncodeException(\\\"aDocument is null\\\" +\\n \\\" on in EPPRgpExtReport.encode(Document)\\\");\\n }\\n\\n Element root =\\n aDocument.createElementNS(EPPRgpExtFactory.NS, ELM_NAME);\\n\\n // preData\\n EPPUtil.encodeString(aDocument, root, preData, EPPRgpExtFactory.NS, ELM_PRE_DATA);\\n\\n // postData\\n EPPUtil.encodeString(aDocument, root, postData, EPPRgpExtFactory.NS, ELM_POST_DATA);\\n\\n // delete time\\n EPPUtil.encodeTimeInstant(aDocument, root, deleteTime, EPPRgpExtFactory.NS, ELM_DEL_TIME);\\n\\n // restore time\\n EPPUtil.encodeTimeInstant(aDocument, root, restoreTime, EPPRgpExtFactory.NS, ELM_RES_TIME);\\n\\n // restore reason\\n EPPUtil.encodeComp(aDocument,root,restoreReason);\\n\\n // restore statement1\\n EPPUtil.encodeComp(aDocument,root,statement1);\\n\\n // restore statement2\\n EPPUtil.encodeComp(aDocument,root,statement2);\\n\\n // optional\\n EPPUtil.encodeString(aDocument, root, other, EPPRgpExtFactory.NS, ELM_OTHER);\\n\\n return root;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"d56b594065c3a31a6fe3da51c614ea3d","score":"0.6066535","text":"public final void prepassDocument(DOM document) {\n setIndexSize(document.getSize());\n buildIDIndex(document);\n }","title":""},{"docid":"588cc12b8e78c71463eac0b1102b71bc","score":"0.59351164","text":"private void bulidDocument() {\n\t\tDocumentBuilderFactory dfactory = DocumentBuilderFactory.newInstance();\n\t\tdfactory.setNamespaceAware(true);\n\n\t\ttry {\n\t\t\tm_doc = dfactory.newDocumentBuilder().newDocument();\n\t\t} catch (Exception ex) {\n\t\t\tex.printStackTrace();\n\t\t}\n\t}","title":""},{"docid":"50906377bbddca03dd488e140b91a2f1","score":"0.5905454","text":"protected void bodyAdd(DOMelement element){ \n\t\t\tdocument.getEmbeddedElements()[1].addDomElement(element); \n\t}","title":""},{"docid":"3268e54424141618358c4be6f5c5a927","score":"0.58970445","text":"public Document(Element rootElement)\n {\n if (null == rootElement)\n {\n throw new NullPointerException(\"Root element must not be null.\");\n }\n if (rootElement.getParent() != null)\n {\n throw new InternalException(\"Element must be detached.\");\n }\n\n appendChild(rootElement);\n }","title":""},{"docid":"e8f5b3b3b7b39fd4055efdcb2aaa22c3","score":"0.58581024","text":"public DOMRecord(Document document) {\r\n this();\r\n setDOM(document.getDocumentElement());\r\n }","title":""},{"docid":"6b92ea025a5719a695fa8f6cf64fd325","score":"0.5756833","text":"private void process() {\n\t\tElement rootElement = docMap.getDocument().getRootElement();\n\t\tprocessTree(rootElement);\n\t}","title":""},{"docid":"93154e8c7a02e270da70ef3d40bbda66","score":"0.5719332","text":"public void buildDocument() {\n/* 140 */ setDocument(getDocumentLoader().getDocument(getClass()), \"text/html\", \"ISO-8859-1\");\n/* */ \n/* 142 */ syncAccessMethods();\n/* */ }","title":""},{"docid":"cdc9fb61d4d77f84b23e5de2ada37579","score":"0.5680812","text":"public void startDocument() throws SAXException {\r\n\t mDocuments = new DocumentVector();\r\n\t stackel = new LGLElemStack();\r\n\t \t//mDocument = new Document();\r\n\t }","title":""},{"docid":"d28e00f8bcf789c1a6df60e8ea5009a4","score":"0.56490946","text":"public void visitDocument() {\n org.w3c.dom.Element element = document.getDocumentElement();\n if ((element != null) && element.getTagName().equals(\"FORMA\")) {\n visitElement_FORMA(element);\n }\n }","title":""},{"docid":"aee407d4858f1b48b997900f6a35515e","score":"0.5567394","text":"public void parsedHTMLFileToDocument(Document document);","title":""},{"docid":"a9be2f6528d993c41270611987002fd2","score":"0.55527127","text":"private void parseDocument() {\n\t\tElement docEle = dom.getDocumentElement();\n\n\t\t// get a nodelist of <employee> elements\n\t\tNodeList nl = docEle.getElementsByTagName(\"Group\");\n\t\tif (nl != null && nl.getLength() > 0) {\n\t\t\tfor (int i = 0; i < nl.getLength(); i++) {\n\n\t\t\t\t// get the employee element\n\t\t\t\tElement el = (Element) nl.item(i);\n\n\t\t\t\t// get the Employee object\n\t\t\t\tGroup e = getGroup(el);\n\n\t\t\t\t// add it to list\n\t\t\t\tgroups.add(e);\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"da7ffb676f1a1eb5fb9480b6d7c43911","score":"0.5485658","text":"public void clear() {\r\n if(getDOM() instanceof Element) {\r\n String domName = ((Element)getDOM()).getTagName();\r\n this.dom = createNewDocument(domName, null);\r\n this.currentNode = this.dom;\r\n }\r\n }","title":""},{"docid":"d7dc5112b3291f20df45cf9b551b87f7","score":"0.53964156","text":"public void startDocument() throws org.xml.sax.SAXException{}","title":""},{"docid":"80fe2e2363ac9f3bda12620c664872e8","score":"0.53517795","text":"protected void syncWithDocument(Node node) {\n/* 258 */ if (node.getNodeType() != 9)\n/* */ {\n/* 260 */ throw new XMLCRuntimeException(\"Node must be a document node\");\n/* */ }\n/* */ \n/* */ \n/* 264 */ Document doc = (Document)node;\n/* */ \n/* */ \n/* */ try {\n/* 268 */ Field[] fs = getClass().getDeclaredFields();\n/* */ \n/* 270 */ int substStart = \"$element_\".length();\n/* */ \n/* 272 */ for (int i = 0; i < fs.length; i++) {\n/* */ \n/* 274 */ Field f = fs[i];\n/* */ \n/* 276 */ if (f.getName().startsWith(\"$element_\")) {\n/* */ \n/* 278 */ String id = f.getName().substring(substStart);\n/* */ \n/* 280 */ Node idNode = doc.getElementById(id);\n/* */ \n/* 282 */ if (idNode == null) {\n/* */ \n/* 284 */ id = id.substring(0, 1).toLowerCase() + id.substring(1);\n/* */ \n/* 286 */ idNode = doc.getElementById(id);\n/* */ } \n/* */ \n/* */ \n/* 290 */ if (idNode != null) f.set(this, idNode);\n/* */ \n/* */ } \n/* */ } \n/* 294 */ } catch (Exception e) {\n/* */ \n/* 296 */ throw new XMLCRuntimeException(\"Error reflecting on element access fields\", e);\n/* */ } \n/* */ }","title":""},{"docid":"6da949faeb5cf7e7df88e1762a375ea3","score":"0.5322463","text":"private void copyChildren(org.w3c.dom.Node docElement, org.w3c.dom.Node newElement, org.w3c.dom.Document newDoc) {\r\n NodeList nodes = docElement.getChildNodes();\r\n org.w3c.dom.Node newNode;\r\n org.w3c.dom.Node oldNode;\r\n \r\n for(int i = 0; i < nodes.getLength(); i++) {\r\n oldNode = (org.w3c.dom.Node)(nodes.item(i));\r\n\r\n newNode = newDoc.importNode(oldNode, false);\r\n newElement.appendChild(newNode);\r\n \r\n if(oldNode.hasChildNodes())\r\n copyChildren(oldNode, newNode, newDoc);\r\n }\r\n isTextCurrent = false;\r\n }","title":""},{"docid":"e2cc32239e10dca17f3b2f7f8fa394c1","score":"0.52982694","text":"public void startDocument() throws SAXException {\r\n tagList = new ArrayList<Tag>();\r\n isReadTagID = false;\r\n isReadDiscoverTime = false;\r\n }","title":""},{"docid":"6b33dbe02efe6c2fc2a58f24548af906","score":"0.5294839","text":"public void doit()\n\t{\n\t\tDocument doc = null;\n\n\t\ttry {\n\t\t\t/**\n\t\t\t * create or modify doc.xml file\n\t\t\t */\n\t\t\tFile xmlFile = new File(path + File.separator + \"doc.xml\");\n\t\n\t\t\tDocumentBuilderFactory docFactory = DocumentBuilderFactory.newInstance();\n\t\t\tDocumentBuilder docBuilder = docFactory.newDocumentBuilder();\n\t \n\t\t\t/**\n\t\t\t * root elements\n\t\t\t */\n\t\t\ttry\n\t\t\t{\n\t\t\t\t/**\n\t\t\t\t * We see if the xml file is already there.\n\t\t\t\t */\n\t\t\t\tdoc = docBuilder.parse(xmlFile);\n\t\t\t}\n\t\t\tcatch (SAXException e)\n\t\t\t{\n\t\t\t\t/**\n\t\t\t\t * If not we create a new file with new elements.\n\t\t\t\t */\n\t\t\t\tdoc = docBuilder.newDocument();\n\t\t\t\tElement rootElement = doc.createElement(\"documents\");\n\t\t\t\tdoc.appendChild(rootElement);\n\t\t\t}\n\t\t\tcatch (IOException e)\n\t\t\t{\n\t\t\t\tdoc = docBuilder.newDocument();\n\t\t\t\tElement rootElement = doc.createElement(\"documents\");\n\t\t\t\tdoc.appendChild(rootElement);\n\t\t\t}\n\n\t\t\t/**\n\t\t\t * Retrieve the root element, which is documents.\n\t\t\t */\n\t\t\tNodeList rootElementNode = doc.getElementsByTagName(\"documents\");\n\t\t\tNode root = rootElementNode.item(0);\n\n\t\t\t/**\n\t\t\t * create document child elements\n\t\t\t */\n\t\t\tElement edocument = doc.createElement(\"document\");\n\t\t\troot.appendChild(edocument);\n\n\t\t\tint noelements = doc.getElementsByTagName(\"document\").getLength();\n\n\t\t\t/**\n\t\t\t * create id attribute to document element\n\t\t\t */\n\t\t\tAttr idattr = doc.createAttribute(\"id\");\n\t\t\tidattr.setValue(\"DOC0000\" + noelements);\n\t\t\tedocument.setAttributeNode(idattr);\n\n\t\t\t/**\n\t\t\t * create filename attribute to document element\n\t\t\t */\n\t\t\tAttr filattr = doc.createAttribute(\"filename\");\n\t\t\tfilattr.setValue(validwipoxml);\n\t\t\tedocument.setAttributeNode(filattr);\n\n\t\t\t/**\n\t\t\t * create title child elements\n\t\t\t */\n\t\t\tElement etitle = doc.createElement(\"title\");\n\t\t\tetitle.appendChild(doc.createTextNode(title));\n\t\t\tedocument.appendChild(etitle);\n\n\t\t\t/**\n\t\t\t * create keywords child elements\n\t\t\t */\n\t\t\tElement ekeyword = doc.createElement(\"keywords\");\n\t\t\tekeyword.appendChild(doc.createTextNode(keyword));\n\t\t\tedocument.appendChild(ekeyword);\n\n\t\t\t/**\n\t\t\t * create date child elements\n\t\t\t */\n\t\t\tElement edate = doc.createElement(\"date\");\n\t\t\tedate.appendChild(doc.createTextNode(date));\n\t\t\tedocument.appendChild(edate);\n\n\t\t\t/**\n\t\t\t * create description child elements\n\t\t\t */\n\t\t\tElement edescription = doc.createElement(\"description\");\n\t\t\tedescription.appendChild(doc.createTextNode(description));\n\t\t\tedocument.appendChild(edescription);\n\t \n\t\t\t/**\n\t\t\t * write the content into xml file\n\t\t\t */\n\t\t\tTransformerFactory transformerFactory = TransformerFactory.newInstance();\n\t\t\tTransformer transformer = transformerFactory.newTransformer();\n\t\t\tDOMSource source = new DOMSource(doc);\n\t\t\tStreamResult result = new StreamResult(xmlFile);\n\t \n\t\t\ttransformer.transform(source, result);\n\t\t} catch (ParserConfigurationException pce) {\n\t\t\tpce.printStackTrace();\n\t\t} catch (TransformerException tfe) {\n\t\t\ttfe.printStackTrace();\n\t\t}\n\t}","title":""},{"docid":"31fe128a28b12a26a5f03d05df775c57","score":"0.52634364","text":"public void visit(Document document) {\n\t\t\r\n\t}","title":""},{"docid":"8f668f345bc5df18eafe28ac60c91df8","score":"0.5259783","text":"public void startDocument() {\n\t\t pushTag(\"\");\n\t }","title":""},{"docid":"70d78ec5846771b1e1375e16746b8549","score":"0.5237147","text":"public LoadDoc() {\n\t\t\torganizeLayout();\n\t\t\tassignListeners();\n\t\t}","title":""},{"docid":"2a68a06617694b0d5377f1c8ecf19815","score":"0.52203566","text":"@Override\r\n public Document ActualizarDOM() {\r\n\r\n try {\r\n\r\n DocumentBuilder dBuilder = DocumentBuilderFactory.newInstance().newDocumentBuilder();\r\n Document doc = dBuilder.parse(xml);\r\n doc.normalizeDocument();\r\n return doc;\r\n\r\n } catch (SAXException | IOException | ParserConfigurationException ex) {\r\n Logger.getLogger(GestionProducto.class.getName()).log(Level.SEVERE, null, ex);\r\n }\r\n\r\n return null;\r\n }","title":""},{"docid":"a9747bc0596502e2841b025fa43e5208","score":"0.5217489","text":"public DomWindow(HTMLDocumentImpl document) {\r\n _document = document;\r\n }","title":""},{"docid":"f62542be2a21cf9fa3d4ff0229340a8a","score":"0.52163035","text":"static void\n setDocumentAndDecorate(ThreadContext context, RubyObject self, XmlDocument doc)\n {\n self.setInstanceVariable(\"@document\", doc == null ? context.nil : doc);\n if (doc != null) { Helpers.invoke(context, doc, \"decorate\", self); }\n }","title":""},{"docid":"9b2ea340c1390fd5296748e32262c14f","score":"0.5199716","text":"public Document getDOM() {\n\t\t\tif (root.getChildNodes().getLength() == 1) {\n\t\t\t\tdocument.appendChild(root.getFirstChild());\n\t\t\t} else {\n\t\t\t\tdocument.appendChild(root);\n\t\t\t}\n\n\t\t\treturn document;\n\t\t}","title":""},{"docid":"90685279773b8e510c9c60fee6b6c84d","score":"0.518411","text":"public void add(Document document) ;","title":""},{"docid":"db491d4472fe84e41ebcb449d7f91a7f","score":"0.51818573","text":"@Override\n\tpublic void addDataElement(webarchive.api.xml.DataElement element) throws\n\t\tException {\n\t\tupdateDocument(client.syncDocument(element));\n\t}","title":""},{"docid":"6a411ba96c86076a9d79f6c3e39ec7d1","score":"0.51812506","text":"@Override\r\n\tpublic void startDocument() throws SAXException {\n\t\tsuper.startDocument();\r\n//\t\tSystem.out.println(\"startDocument\");\r\n\t\tmList = new ArrayList<Entry>();\r\n\t}","title":""},{"docid":"a6dd8ee59c8f903ac661e0e698801461","score":"0.5167297","text":"protected void pass1(Document document) {\n\t\tAspects aspects= xml2AspectsResource(document);\n\t\tif (aspects != null) {\n\t\t\tgetResource().getContents().add((EObject) aspects);\n\t\t}\n\t}","title":""},{"docid":"b815689e7561f64218e02279a6a46810","score":"0.5140148","text":"public void parseDocument() {\n\t\tElement docEle = dom.getDocumentElement();\n\n\t\t// obtenemos el nodelist de elementos accion\n\t\tNodeList nl = docEle.getElementsByTagName(\"accion\");\n\t\tif (nl != null && nl.getLength() > 0) {\n\t\t\tfor (int i = 0; i < nl.getLength(); i++) {\n\n\t\t\t\t// obtenemos un elemento de la lista (accion)\n\t\t\t\tElement el = (Element) nl.item(i);\n\n\t\t\t\t// obtenemos una accion\n\t\t\t\tAccion a = getAccion(el);\n\n\t\t\t\t// y la aņadimos al array\n\t\t\t\tacciones.add(a);\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"a7308f71caaab062a8a029724c8ad638","score":"0.5138576","text":"private Document copyDocument(Document doc) {\r\n DOMImplementationImpl impl = new DOMImplementationImpl();\r\n DocumentType docType = impl.createDocumentType(\"TM4ML\",null,TMEV.getConfigurationFile(\"mev_script_dtd.dtd\").getAbsolutePath());\r\n \r\n Document newDoc = impl.createDocument(null, \"TM4ML\", docType);\r\n copyChildren(doc.getDocumentElement(), newDoc.getDocumentElement(), newDoc);\r\n isTextCurrent = false;\r\n return newDoc;\r\n }","title":""},{"docid":"dd4912f67ef47c9a436f28953e1067f0","score":"0.51322496","text":"public void startDocument() throws SAXException {\n\t\tsuper.startDocument();\r\n\t}","title":""},{"docid":"8c07466af13100b30142ac2172f1c21e","score":"0.513131","text":"@Override\n\tpublic abstract void addDocument(final lotus.domino.Document doc);","title":""},{"docid":"f26d78061e7a66368596a6849435cf89","score":"0.51097655","text":"protected static org.w3c.dom.Document setUpXML(String nodeName) \n {\n try\n {\n DocumentBuilderFactory myFactory = DocumentBuilderFactory.newInstance();\n DocumentBuilder myDocBuilder = myFactory.newDocumentBuilder();\n DOMImplementation myDOMImpl = myDocBuilder.getDOMImplementation();\n // resultDocument = myDOMImpl.createDocument(\"at.ac.tuwien.dbai.pdfwrap\", \"PDFResult\", null);\n org.w3c.dom.Document resultDocument = \n myDOMImpl.createDocument(\"at.ac.tuwien.dbai.pdfwrap\", nodeName, null);\n return resultDocument;\n }\n catch (ParserConfigurationException e)\n {\n e.printStackTrace();\n return null;\n }\n }","title":""},{"docid":"275a5e194a1a7e303934f8f293da5c06","score":"0.51030207","text":"public void startDocument() throws org.xml.sax.SAXException {\n\n // No action for the moment.\n }","title":""},{"docid":"35ae7bfc1880b00911de47be85b5c628","score":"0.50678015","text":"public void setDocument(Document doc) {\r\n document = doc;\r\n updateScript();\r\n }","title":""},{"docid":"98e996dcbe0fd2b87c892abf25e2e41e","score":"0.5066744","text":"public void setupData() {\n\t\tsuper.setupData();\n\t Document doc = theController.getDocument();\n\t lblTitle.setText(doc.getTitle());\n\t documentText.setText(doc.getText());\n\t lblPostedBy.setText(\"Posted By: \" + doc.getAuthor().getUsername());\n\t}","title":""},{"docid":"f600399d7b42f8557026a8dafad77d8f","score":"0.5040477","text":"public interface Document extends Node {\n /**\n * This method creates a new <code>CDATASection</code>.\n *\n * @param data the data of the new <code>CDATASection</code>\n * @return the newly created <code>CDATASection</code>\n */\n CDATASection createCDATASection(String data);\n\n /**\n * This method creates a new <code>Comment</code>.\n *\n * @param data the data of the new <code>Comment</code>\n * @return the newly created <code>Comment</code>\n */\n Comment createComment(String data);\n\n /**\n * This method creates a new <code>DocumentFragment</code>.\n *\n * @return the newly created <code>DocumentFragment</code>\n */\n DocumentFragment createDocumentFragment();\n\n /**\n * This method creates a new <code>Element</code>.\n *\n * @param tagName the tag name of the new <code>Element</code>\n * @return the newly created <code>Element</code>\n */\n Element createElement(String tagName);\n\n /**\n * This method creates a new <code>ProcessingInstruction</code>.\n *\n * @param target the target of the new <code>ProcessingInstruction</code>\n * @param data the data of the new <code>ProcessingInstruction</code>\n * @return the newly created <code>ProcessingInstruction</code>\n */\n ProcessingInstruction createProcessingInstruction(String target, String data);\n\n /**\n * This method creates a new <code>Text</code>.\n *\n * @param data the data of the new <code>Text</code>\n * @return the newly created <code>Text</code>\n */\n Text createTextNode(String data);\n\n /**\n * This method retrieves the document element. Each document has at most one <code>Element</code>\n * as its direct child, and this node is returned if it exists. <code>null</code> is returned\n * otherwise.\n *\n * @return the document element of this <code>Document</code>\n */\n Element getDocumentElement();\n\n /**\n * This method retrieves the unique descendent elements which has an id of <code>elementId</code>.\n * Note the attribute which is used as an ID must be supplied in the DTD of the document. It is\n * not sufficient to give the <code>Element</code> to be retrieved an attribute named 'id'.\n *\n * @param elementId id of element\n * @return the <code>Element</code> which has an id of <code>elementId</code> and belongs to this\n * <code>Document</code>\n */\n Element getElementById(String elementId);\n\n /**\n * This method retrieves any descendent elements which have a tag name of <code>tagname</code>.\n *\n * @param tagname name of tag\n * @return the <code>NodeList</code> of elements which has a tag name of <code>tagname</code> and\n * belong to this <code>Document</code>\n */\n NodeList getElementsByTagName(String tagname);\n\n /**\n * This method imports a node into the current <code>Document</code>.\n *\n * @param importedNode node to import\n * @param deep whether to recurse to children\n * @return the node <code>Node</code> imported\n */\n Node importNode(Node importedNode, boolean deep);\n}","title":""},{"docid":"5ee5c65deedaa5490ff00a08f569cada","score":"0.5035262","text":"public void performModification(DocumentBuilder docBuilder, Document doc)\n throws SAXException, IOException, CoreException {\n Document contentDoc = docBuilder.parse(new ByteArrayInputStream(\n content.getBytes()));\n NodeList newChildren = contentDoc.getChildNodes();\n\n // add content\n // note that this requires that the <tagname> element exists\n NodeList nodeList = doc.getElementsByTagName(tagname);\n\n addWhitespace(doc, nodeList.item(0), \" \");\n\n if (nodeList.getLength() > 0) {\n for (int i = 0; i < newChildren.getLength(); ++i) {\n Node newChild = newChildren.item(i);\n nodeList.item(0).appendChild(doc.adoptNode(newChild));\n }\n } else {\n throw VaadinPluginUtil.newCoreException(\"The XML file \"\n + filename + \" is missing the tag \" + tagname, null);\n }\n }","title":""},{"docid":"c85ce73e13dea3240632697dbf57a317","score":"0.5030762","text":"public Document ( ) { _buffer = new StringBuffer(); }","title":""},{"docid":"30a391ec99da72653fb6ed19426e073b","score":"0.5001361","text":"DocumentRoot createDocumentRoot();","title":""},{"docid":"30a391ec99da72653fb6ed19426e073b","score":"0.5001361","text":"DocumentRoot createDocumentRoot();","title":""},{"docid":"93c9edbb94c441111ffa307b95e05ea3","score":"0.4998678","text":"public void startDocument ()\n throws SAXException {\n return;\n }","title":""},{"docid":"6458fba996ad2651aebf97a4f69ee34b","score":"0.49903446","text":"public void startDocument() throws SAXException {\r\n \t// initialize postsLength hash table\r\n \tpostsLength.put(\"short\",0);\r\n \tpostsLength.put(\"average\",0);\r\n \tpostsLength.put(\"long\",0);\r\n \t\r\n \t// open up output files : dataset and statistics\r\n \ttry {\r\n \t\toutput_file = new PrintWriter(\"c:/dataset.txt\", \"UTF-8\");\r\n \t\tstats = new PrintWriter(\"c:/stats.txt\", \"UTF-8\");\r\n \t} catch (Exception e){\r\n \t\tSystem.out.println(\"error in openning output files\");\r\n \t}\r\n }","title":""},{"docid":"b1e7ea8a539d0a30f4a0416dae6e95d7","score":"0.49866655","text":"private void storePostData(HTMLDocument doc,String target,String data){\n Document propDoc=doc;\n String propName=PostDataProperty;\n if(doc.isFrameDocument()){\n // find the top-most JEditorPane holding the frameset view.\n FrameView.FrameEditorPane p=\n (FrameView.FrameEditorPane)getContainer();\n FrameView v=p.getFrameView();\n JEditorPane c=v.getOutermostJEditorPane();\n if(c!=null){\n propDoc=c.getDocument();\n propName+=(\".\"+target);\n }\n }\n propDoc.putProperty(propName,data);\n }","title":""},{"docid":"d258aa6d378d548aaf9820fe92b6a525","score":"0.4970107","text":"@Override\n public void insertTo(ImonggoDBHelper2 dbHelper) {\n if(shouldPageRequest() && isOldPaging) {\n try {\n List<Document> documents = getChildDocuments();\n for (Document child : documents)\n child.insertTo(dbHelper);\n } catch (JSONException e) {\n e.printStackTrace();\n }\n return;\n }\n insertExtrasTo(dbHelper);\n\n try {\n dbHelper.insert(Document.class, this);\n } catch (SQLException e) {\n e.printStackTrace();\n }\n\n refresh();\n if(document_lines != null) {\n for (DocumentLine documentLine : document_lines) {\n documentLine.setDocument(this);\n try {\n Product product = dbHelper.fetchObjects(Product.class).queryBuilder().where().eq(\"id\", documentLine.getProduct_id())\n .queryForFirst();\n if (product != null)\n documentLine.setProduct(product);\n } catch (SQLException e) {\n e.printStackTrace();\n }\n documentLine.insertTo(dbHelper);\n }\n }\n\n updateExtrasTo(dbHelper);\n\n Log.e(\"DOCUMENT\", \"insert \" + id + \" ~ \" + (offlineData != null? offlineData.getId() : \"null\") );\n }","title":""},{"docid":"5cf26f6b4ad49cc7c88c6c71b34bd958","score":"0.49658722","text":"public DOMRecord(Element element) {\r\n this();\r\n setDOM(element);\r\n }","title":""},{"docid":"a768596547e31d860817e54f3912b856","score":"0.49639326","text":"@Override\n\tpublic void startDocument() {\n\t\taccumulator = new StringBuffer();\n\t\t\n\t}","title":""},{"docid":"1ab4a93080a7608d495487b1d13eb220","score":"0.49578628","text":"protected void append(Node newNode) throws org.xml.sax.SAXException {\n\n Node currentNode = this.currentNode;\n\n if (null != currentNode) {\n if (currentNode == this.root && this.nextSibling != null)\n currentNode.insertBefore(newNode, this.nextSibling);\n else\n currentNode.appendChild(newNode);\n\n // System.out.println(newNode.getNodeName());\n } else if (null != this.docFrag) {\n if (this.nextSibling != null)\n this.docFrag.insertBefore(newNode, this.nextSibling);\n else\n this.docFrag.appendChild(newNode);\n } else {\n boolean ok = true;\n short type = newNode.getNodeType();\n\n if (type == Node.TEXT_NODE) {\n String data = newNode.getNodeValue();\n\n if ((null != data) && (data.trim().length() > 0)) {\n throw new org.xml.sax.SAXException(\"Warning: can't output text before document element! Ignoring...\");\n }\n\n ok = false;\n } else if (type == Node.ELEMENT_NODE) {\n if (this.document.getDocumentElement() != null) {\n ok = false;\n\n throw new org.xml.sax.SAXException(\"Can't have more than one root on a DOM!\");\n }\n }\n\n if (ok) {\n if (this.nextSibling != null)\n this.document.insertBefore(newNode, this.nextSibling);\n else\n this.document.appendChild(newNode);\n }\n }\n }","title":""},{"docid":"0834a32c30546b480a1db21303527e4c","score":"0.4946747","text":"@Override\n\tpublic void startDocument() throws SAXException {\n\t\tsuper.startDocument();\n\t}","title":""},{"docid":"ac9cd7cc59cd6a520e6816ef6d18ae2d","score":"0.49373525","text":"public static void attach(DocumentBuilder db)\r\n\t{\r\n\t\tdb.setEntityResolver(new FastEntityResolver(db.isValidating()));\r\n\t}","title":""},{"docid":"6827ed21dc01b81de5bc5bd13f1e4828","score":"0.49280256","text":"public static void copiperDocument(Document source, Document destination)\r\n {\r\n Node node = destination.importNode(source.getDocumentElement(), true);\r\n\r\n destination.getDocumentElement().appendChild(node);\r\n }","title":""},{"docid":"169ab165223e265c5c66c7a96b19ad24","score":"0.49235517","text":"public void startDocument() throws SAXException {\n parsingInProgress = true;\n qNameStack.removeAllElements();\n }","title":""},{"docid":"425f02740c6b4b0863309b349e6b490c","score":"0.49233744","text":"@Override\r\n\tpublic Object setData(Element pElement) {\n\t\treturn null;\r\n\t}","title":""},{"docid":"19b4776fda70b6561c360cabb10a5642","score":"0.49167672","text":"public void startDocument() throws org.xml.sax.SAXException\r\n {\r\n\r\n if (m_inEntityRef)\r\n return;\r\n\r\n m_needToOutputDocTypeDecl = true;\r\n m_startNewLine = false;\r\n\r\n if (m_shouldNotWriteXMLHeader == false)\r\n {\r\n String encoding = Encodings.getMimeEncoding(m_encoding);\r\n String version = (null == m_version) ? \"1.0\" : m_version;\r\n String standalone;\r\n\r\n if (m_standaloneWasSpecified)\r\n {\r\n standalone = \" standalone=\\\"\" + (m_standalone ? \"yes\" : \"no\") + \"\\\"\";\r\n }\r\n else\r\n {\r\n standalone = \"\";\r\n }\r\n\r\n try\r\n {\r\n final Writer writer = m_writer;\r\n writer.write(\"<?xml version=\\\"\");\r\n writer.write(version);\r\n writer.write(\"\\\" encoding=\\\"\");\r\n writer.write(encoding);\r\n writer.write('\\\"');\r\n writer.write(standalone);\r\n writer.write(\"?>\");\r\n writer.write(m_lineSep, 0, m_lineSepLen);\r\n }\r\n catch(IOException ioe)\r\n {\r\n throw new SAXException(ioe);\r\n }\r\n }\r\n }","title":""},{"docid":"433bc96c1d25503b130495848cbbc506","score":"0.4908055","text":"public void supplement(DomElement domElement) {\n // nothing to do.\n }","title":""},{"docid":"a5e3b2b8853e632bb2f564724927b4aa","score":"0.48983774","text":"public void addAllContentAsIntentElement(EObject root, IntentEditorDocument document) {\n \t\tObject identifier = listenedElementsHandler.getRepositoryAdapter().getIDFromElement(root);\n \n \t\t// We first associate this root in to the given document\n \t\tif (elementsToDocuments.get(identifier) == null) {\n \t\t\telementsToDocuments.put(identifier, new ArrayList<IntentEditorDocument>());\n \t\t}\n \t\tif (!elementsToDocuments.get(identifier).contains(document)) {\n \t\t\telementsToDocuments.get(identifier).add(document);\n \t\t}\n \n \t\t// Then we do the same for all its contained element\n \t\tfor (EObject content : root.eContents()) {\n \t\t\taddAllContentAsIntentElement(content, document);\n \t\t}\n \t}","title":""},{"docid":"b9df09841705a3bb28752bbaad256ded","score":"0.48697042","text":"public void installDocument(IDocument doc) {\n \t\t\tif (fDocument != null)\n \t\t\t\tfDocument.removeDocumentListener(this);\n \t\t\tfDocument= doc;\n \t\t\tif (fDocument != null)\n \t\t\t\tfDocument.addDocumentListener(this);\n \t\t}","title":""},{"docid":"87ef8f1d2966cf156e57461d3e656c75","score":"0.486558","text":"private void readXML(Document document) throws Exception {\n \tif(Oscar3Props.getInstance().verbose) System.out.print(\"Initialising data parser... \");\n \tdoc = document;\n \tnodeDict = new HashMap<String,String>();\n \t// create top RPNode\n \ttopNode = new RPNode(this);\n\n \t// find <child> within <top> and add them to topNode\n \tNode top = doc.query(\"//top\").get(0);\n \tfor(int i=0;i<top.getChildCount();i++) {\n \t\tNode child = top.getChild(i);\n \t\tif(child instanceof Element) {\n \t\t\tElement childElem = (Element)child;\n \t\t\tif(\"child\".equals(childElem.getLocalName())) {\n \t\t\t\t// child is of type <child>\n \t\t\t\tString type = childElem.getAttributeValue(\"type\");\n \t\t\t\tString id = childElem.getAttributeValue(\"id\");\n \t\t\t\t// find the <node> the <child> refers to\n \t\t\t\tNode node2 = findNode(type, id);\n \t\t\t\tif(node2==null)\n \t\t\t\t\tcontinue;\n \t\t\t\t// node2 is the <node> referred to by <child>\n \t\t\t\t// get value attribute, if exists, else null\n \t\t\t\ttopNode.addChild((Element)node2); \t \n \t\t\t}\n \t\t}\n \t}\n\n \tnodeDict = null;\n \tSystem.gc();\n \tif(Oscar3Props.getInstance().verbose) System.out.println(\"regexes initialised\");\n }","title":""},{"docid":"d4f06c76ef3327ec7eaf271c4062db5b","score":"0.48489946","text":"private static void createDocument(NodeList nodes, String personName, String phoneNumber ) {\n\t\t DocumentBuilder db;\n\t\t try {\n\t\t\tdb = DocumentBuilderFactory.newInstance().newDocumentBuilder();\n\t\t\torg.w3c.dom.Document d2 = db.newDocument();\n\t\t\tElement ele = (Element)d2.createElement(\"Person\");\n\t\t\tele.setAttribute(\"name\", personName);\n\t\t\td2.appendChild(ele);\n\t\t\t\n\t\t\tElement ele1 = (Element)d2.createElement(\"PhoneNumber\");\n\t\t\tele1.setAttribute(\"number\", phoneNumber);\n\t\t\tele.appendChild(ele1);\n\t\t\t\n\t\t\tfor (int i = 0; i < nodes.getLength(); i++) {\n\t\t\t Node node = nodes.item(i);\n\t\t\t d2.adoptNode(node);\n\t\t\t ele1.appendChild(node);\n\t\t\t}\n\t\t\tDOMSource domSource = new DOMSource(d2);\n\t\t\tStringWriter writer = new StringWriter();\n\t\t\tStreamResult result = new StreamResult(writer);\n\t\t\tTransformerFactory tf = TransformerFactory.newInstance();\n\t\t\tTransformer transformer = tf.newTransformer();\n\t\t\ttransformer.transform(domSource, result);\n\t\t\tSystem.out.println(\"XML IN String format is: \\n\" + writer.toString());\n\t\t\t\n\t\t \n\t\t }\n\t\t catch(Exception e)\n\t\t {\n\t\t\t\tSystem.out.println(e);\n\t\t }\n\t\t \n\t \n\t}","title":""},{"docid":"1dd009125a89c198d3ea6e3426bf4ce2","score":"0.48266524","text":"public void addToDocuments(entity.ActivityDocument element);","title":""},{"docid":"c983dc04749462c330f76bee36aafdfd","score":"0.48226514","text":"private void fillbuf () throws IOException, SAXException {\n\n // don't touched fixed buffers, that'll usually\n // change entity values (and isn't needed anyway)\n // likewise, ignore closed streams\n if (reader == null || isClosed)\n return;\n \n // if remembering DTD text, copy!\n if (startRemember != 0) {\n if (rememberedText == null)\n rememberedText = new StringBuffer (buf.length);\n rememberedText.append (buf, startRemember,\n start - startRemember);\n }\n\n boolean extra = (finish > 0) && (start > 0);\n int len;\n\n if (extra) // extra pushback\n start--;\n len = finish - start;\n\n System.arraycopy (buf, start, buf, 0, len);\n start = 0;\n finish = len;\n\n try {\n len = buf.length - len;\n len = reader.read (buf, finish, len);\n } catch (UnsupportedEncodingException e) {\n fatal (\"P-075\", new Object [] { e.getMessage () });\n } catch (CharConversionException e) {\n fatal (\"P-076\", new Object [] { e.getMessage () });\n }\n if (len >= 0)\n finish += len;\n else\n close ();\n if (extra) // extra pushback\n start++;\n\n if (startRemember != 0)\n // assert extra == true\n startRemember = 1;\n }","title":""},{"docid":"229eba91d8af99868da24e116c350791","score":"0.4820134","text":"public void startDocument() throws SAXException {\r\n\t\tsemantics.reset();\r\n\t\tfaceexpressionlist = new Vector();\r\n\t\tnatpause = 0;\r\n\t\tbreakpause = 0;\r\n\t\tgesturelist = new Vector();\r\n\t\tfacialanimationlist = new Vector();\r\n\t\tspeechlist = new Vector();\r\n\t\texcessfaps = new Vector();\r\n\t\tplaintext = new String(\"\");\r\n\t}","title":""},{"docid":"9367ee9bf630197570a522768ac6a44e","score":"0.48080614","text":"public void setDOM(Node element) {\r\n this.dom = element;\r\n this.currentNode = element;\r\n this.getNamespaceResolver().setDOM(element);\r\n }","title":""},{"docid":"e1c2d4501d166ec7f37876334c54997c","score":"0.48079666","text":"protected void postProcessXml(Element root) {}","title":""},{"docid":"84a929a94e52af27dc163a346a84e277","score":"0.4798102","text":"public void startDocument() throws SAXException {\n // Logging a debug message\n// if (_theLogger.isDebugEnabled()) {\n// _theLogger.debug(\"Method startDocument() is beign called\");\n// }\n }","title":""},{"docid":"1133ca0078b65b497a3c5552876359c9","score":"0.47873026","text":"private void setupDoc() {\n doc = this.getStyledDocument(); \n }","title":""},{"docid":"7d7ccd1f09e5e376d02a2f20a0e275d0","score":"0.47733504","text":"private void parseDocument(String tagName) {\n\t\tElement docEle = document.getDocumentElement();\n\n\t\t// get a nodelist of <employee> elements\n\t\tdbEntities = docEle.getElementsByTagName(tagName);\n\t\t// dbAttributes = null;\n\t\tif (dbEntities != null && dbEntities.getLength() > 0) {\n\t\t\tfor (int i = 0; i < dbEntities.getLength(); i++) {\n\t\t\t\tdbAttributes = ((Element) dbEntities.item(i))\n\t\t\t\t\t\t.getElementsByTagName(DB_ATTRIBUTE);\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"a63d35b35bed097b1b456e703023de57","score":"0.47700185","text":"public void save(OutputStream out) throws Exception {\r\n // 2DO FLUSH AND SAVE IN PACKAGE\r\n flushDoms();\r\n updateMetaData();\r\n if (!isRootDocument()) {\r\n Document newDoc = loadDocumentFromTemplate(getOdfMediaType());\r\n newDoc.insertDocument(this, ROOT_DOCUMENT_PATH);\r\n newDoc.updateMetaData();\r\n newDoc.mPackage.save(out);\r\n // ToDo: (Issue 219 - PackageRefactoring) - Return the document,\r\n // when not closing!\r\n // Should we close the sources now? User will never receive the open\r\n // package!\r\n } else {\r\n // 2DO MOVE CACHE TO PACKAGE\r\n // // the root document only have to flush the DOM of all open child\r\n // documents\r\n // flushAllDOMs();\r\n mPackage.save(out);\r\n }\r\n }","title":""},{"docid":"c666b2835b0666c00d3df18c7f0b29f0","score":"0.4764127","text":"public final void refresh() {\n\t\tsetRoot(rootElement);\n\t}","title":""},{"docid":"be1324dc1be076bdc5ab25dda39a6dc9","score":"0.47419947","text":"private void guardarDOM(Document documento) {\n\t\t\n\t\ttry {\n\t\t\t//Establecemos el árbol a guardar\n\t\t\tSource fuente = new DOMSource(documento);\n\t\t\t//Establecemos el fichero destion\n\t\t\tResult destino = new StreamResult(new File(nombre));\n\t\t\t//Creamos el transformador\n\t\t\tTransformer t = TransformerFactory.newInstance().newTransformer();\n\t\t\t//Creamos el nuevo fichero\n\t\t\tt.transform(fuente, destino);\n\t\t\t\n\t\t} catch (TransformerConfigurationException e) {\n\t\t\t// TODO Auto-generated catch block\n\t\t\te.printStackTrace();\n\t\t} catch (TransformerFactoryConfigurationError e) {\n\t\t\t// TODO Auto-generated catch block\n\t\t\te.printStackTrace();\n\t\t} catch (TransformerException e) {\n\t\t\t// TODO Auto-generated catch block\n\t\t\te.printStackTrace();\n\t\t}\n\t\t\n\t\t\n\t}","title":""},{"docid":"da22ddd53868ec2fca8b1f04d08790de","score":"0.47328365","text":"public Document createDocument() {\r\n\t\ttry {\r\n\t\t\tDocument document = DocumentHelper.createDocument();\r\n\r\n\t\t\tmydom = document;\r\n\r\n\t\t\treturn document;\r\n\t\t} catch (Exception e) {\r\n\t\t\te.printStackTrace();\r\n\t\t\treturn null;\r\n\t\t}\r\n\t}","title":""},{"docid":"c7003b23e5780b645df1c9ea7519099c","score":"0.47310978","text":"@Override\n public void startDocument() throws SAXException {\n currentNode = null;\n charBuffer.setLength(0);\n }","title":""},{"docid":"c279af613dc4b5fd84bd5f3d5470539c","score":"0.47310406","text":"public WSDLElementImpl(XMLDocument d) {\n super(d);\n initWSDLElement();\n }","title":""},{"docid":"db309c525b6204884e935fdb33a9623e","score":"0.4725217","text":"public void loadEmbeddedData(Object datum, DefaultMutableTreeNode itsRoot, List sourceNames) {\r\n itsRoot.removeAllChildren();\r\n itsRoot.setUserObject(datum);\r\n try {\r\n List contained = general.getContainedNames(datum);\r\n if (sourceNames != null) contained.retainAll(sourceNames);\r\n String attribute = null;\r\n Object contents = null;\r\n List contentList = null;\r\n for (int i=0; i < contained.size(); i++) {\r\n attribute = (String) contained.get(i);\r\n contents = getContainedData(datum, attribute);\r\n if (contents instanceof List) {\r\n Iterator it = ((List) contents).iterator();\r\n while (it.hasNext()) {\r\n Object thisDatum = it.next();\r\n DefaultMutableTreeNode itsChild = new DefaultMutableTreeNode(thisDatum);\r\n itsRoot.add(itsChild);\r\n loadEmbeddedData(thisDatum, itsChild, null);\r\n }\r\n } else {\r\n DefaultMutableTreeNode itsChild = new DefaultMutableTreeNode(contents);\r\n itsRoot.add(itsChild);\r\n loadEmbeddedData(contents, itsChild, null);\r\n }\r\n }\r\n } catch (Exception e) {\r\n e.printStackTrace();\r\n }\r\n \r\n }","title":""},{"docid":"36a1f93b52697e1142c287c806732432","score":"0.4717149","text":"Element getDocumentElement();","title":""},{"docid":"11e894052a47fc1af48bbafbb7fd0271","score":"0.47063762","text":"private static org.jdom2.Document useDOMParser(String fileName)\n throws ParserConfigurationException, SAXException, IOException {\n //creating DOM Document\n DocumentBuilderFactory dbFactory = DocumentBuilderFactory.newInstance();\n DocumentBuilder dBuilder;\n dBuilder = dbFactory.newDocumentBuilder();\n Document doc = dBuilder.parse(new File(fileName));\n DOMBuilder domBuilder = new DOMBuilder();\n return domBuilder.build(doc);\n\n }","title":""},{"docid":"82b74bfcaac76160dffd5663df7f6b6d","score":"0.47045943","text":"@Override\n\t\t\tpublic void documentChanged(DocumentEvent event) {\n\t\t\t\tanalyseDocument(event.getDocument());\n\t\t\t}","title":""},{"docid":"98f452da7e348d9f179c538481a06b1f","score":"0.46966076","text":"public void begin_XMLtoEDD () {}","title":""},{"docid":"d77be7289d0f247fa87346a834d9098a","score":"0.4693228","text":"public void endDocument() throws SAXException {\r\n // convert arraylist to array\r\n Tag[] tags = new Tag[tagList.size()];\r\n\r\n for (int i = 0; i < tagList.size(); i++) {\r\n tags[i] = tagList.get(i);\r\n }\r\n\r\n newTags = tags;\r\n }","title":""},{"docid":"a959eba6dd96ed2d51147b2a9464ba2f","score":"0.4678618","text":"protected abstract void attachChildren();","title":""},{"docid":"316461ce7527d7336f9ace09fb2638f4","score":"0.46725342","text":"public MediumXml(Document xmlDoc) {\n super(xmlDoc);\n}","title":""},{"docid":"c713208fcc6b445b72832161415982e2","score":"0.46572247","text":"private static Document buildNewDoc() throws ParserConfigurationException\n\t{\n\t\tDocumentBuilderFactory factory = DocumentBuilderFactory.newInstance();\n\t\tDocumentBuilder builder = factory.newDocumentBuilder();\n\t\tDocument document = builder.newDocument();\n\t\t\n\t\treturn document;\n\t}","title":""},{"docid":"be382dfbb1fba4c2cb4b4f2d54412f31","score":"0.46494904","text":"private static void init() {\r\n NodeList groups = document.getElementsByTagName(\"group\");\r\n for (int i = 0; i < groups.getLength(); i++) {\r\n Element group = (Element) groups.item(i);\r\n group.setIdAttribute(\"name\",true);\r\n }\r\n }","title":""},{"docid":"5b20a8b40135b7875d76050f7cd4e131","score":"0.4647031","text":"public DocumentBase(ScriptManager manager) {\r\n this.manager = manager;\r\n errorLog = new ErrorLog(manager);\r\n listeners = new Vector();\r\n \r\n DOMImplementationImpl impl = new DOMImplementationImpl();\r\n DocumentType docType = impl.createDocumentType(\"TM4ML\",null,TMEV.getConfigurationFile(\"mev_script_dtd.dtd\").getAbsolutePath());\r\n \r\n document = impl.createDocument(null, \"TM4ML\", docType);\r\n \r\n root = document.getDocumentElement();\r\n root.setAttribute(\"version\", tm4ScriptVersion);\r\n \r\n mevElement = document.createElement(\"mev\");\r\n mevElement.setAttribute(\"version\", mevScriptVersion);\r\n root.appendChild(mevElement);\r\n \r\n analysisElement = document.createElement(\"analysis\");\r\n primaryDataElement = document.createElement(\"primary_data\");\r\n primaryDataElement.setAttribute(\"id\", \"1\");\r\n \r\n createAlgorithmSet(1); //default algoritm set\r\n \r\n //Element fileListElement = document.createElement(\"file_list\");\r\n //primaryDataElement.appendChild(fileListElement);\r\n \r\n mevElement.appendChild(primaryDataElement);\r\n mevElement.appendChild(analysisElement);\r\n \r\n scriptText = new String(\"\");\r\n updateScript();\r\n \r\n // Element rootElement = new Element(\"tm4\");\r\n // document = new Document(rootElement);\r\n }","title":""},{"docid":"d8ce7c1f79630b14006bbcaba90e4dc9","score":"0.4637505","text":"private Document instanstiateXML() {\r\n\t\tidList.clear();\r\n\t\tDocument xmldocument = new Document();\r\n\t\tNamespace namespace = Namespace.getNamespace(IXmlElements.NAMESPACE);\r\n\t\tNamespace xsi = Namespace.getNamespace(\"xsi\", IXmlElements.XSI);\r\n\r\n\t\tElement parent = new Element(\"element_events\", namespace);\r\n\r\n\t\tparent.addNamespaceDeclaration(xsi);\r\n\r\n\t\tparent.setAttribute(\"schemaLocation\", IXmlElements.SCHEMA_LOCATION, xsi);\r\n\r\n\t\txmldocument.setRootElement(parent);\r\n\r\n\t\treturn xmldocument;\r\n\t}","title":""},{"docid":"40211541add39863095a60027ed9a0b6","score":"0.4631161","text":"public static XMLBinSAXHandler initNewDocument() {\n\t\t\ttry {\n\t\t\t\tXMLBinSAXHandler documentHandler = new XMLBinSAXHandler();\n\t\t\t\tDocumentBuilderFactory factory = DocumentBuilderFactory.newInstance();\n\t\t\t\tdocumentHandler.document = factory.newDocumentBuilder().newDocument();\n\t\t\t\tdocumentHandler.root = documentHandler.document.createElement(ROOT_ELEMENT);\n\t\t\t\tdocumentHandler._nodeStk.push(documentHandler.root);\n\t\t\t\tdocumentHandler.bPos = 0;\n\t\t\t\treturn documentHandler;\n\t\t\t} catch (ParserConfigurationException e1) {\n\t\t\t\treturn null;\n\t\t\t\t// can't initialize\n\t\t\t}\n\t\t}","title":""},{"docid":"0c89482e77de8ba962527f6dc839a310","score":"0.46204367","text":"public static EmailDocumentFragment getInstance(Document document) {\n mDocument = document;\n return new EmailDocumentFragment();\n }","title":""},{"docid":"90dcec1f400f644359be4f85fff57c64","score":"0.46191147","text":"void setRequestDocument(Document document) throws UnifyException;","title":""},{"docid":"0cd610e9e9a631331a7a46f680ea2c5c","score":"0.46098056","text":"@Override\r\n\tpublic void startDocument() throws SAXException {\n\t\tSystem.out.println(\"début du document\");\r\n\r\n\t}","title":""},{"docid":"e9504e7a192452008c56c746dfe81ac7","score":"0.46066287","text":"public void writeBack() {\n try {\n TransformerFactory tf = TransformerFactory.newInstance();\n Transformer transformer = tf.newTransformer();\n DOMSource source = new DOMSource(mDocument);\n StreamResult result = new StreamResult(new File(mFileName));\n transformer.transform(source, result);\n } catch (TransformerException e) {\n e.printStackTrace();\n }\n }","title":""},{"docid":"5564880d180feda5b58704ba14a12aad","score":"0.4604493","text":"public void addAll(DocumentSet set) ;","title":""},{"docid":"43d61a36ae2323c5565d10775d540048","score":"0.45999715","text":"public void startDocument();","title":""},{"docid":"13623fbc756161f673416833f4e1c294","score":"0.45954293","text":"public void startDocument(final DDocument document) {\r\n\t\tif(!m_writerCtx.isRenderXmlDoc()){\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tm_writer.writeStartDocument(document.getXmlEncoding(), document.getXmlVersion());\t\t\t\t\t\t\t\r\n\t}","title":""},{"docid":"67ba1c528971ce26c508a9d1235ec0ff","score":"0.45915604","text":"Document build(InputSource in) throws JDOMException, IOException;","title":""},{"docid":"ece51f9d48c8e5b5b3307b30080302a0","score":"0.4587657","text":"public void writeXML() {\n TransformerFactory transformerFactory = TransformerFactory.newInstance();\n Transformer transformer = null;\n try {\n transformer = transformerFactory.newTransformer();\n } catch (TransformerConfigurationException e) {\n e.printStackTrace();\n }\n DOMSource source = new DOMSource(docLocal);\n StreamResult result = new StreamResult(new File(Default.XML_FILE_PATH));\n try {\n transformer.transform(source, result);\n } catch (TransformerException e) {\n e.printStackTrace();\n }\n //System.out.println(\"Done\");\n }","title":""},{"docid":"cb1c0209845af3a14790cacb335e9c43","score":"0.45771575","text":"public Document toXML();","title":""},{"docid":"173a4c5057f4ef0b806eef20eb27201f","score":"0.45742843","text":"public void setDocument(einbuergerung_Gruppe6.Document _document)\n {\n document = _document;\n }","title":""},{"docid":"813896597958a449ebcf565ef95b7c68","score":"0.45679623","text":"public static LSSVGContainer parseDocument(Document document) {\n LSSVGContainer svg_e = null;\n LSGenericContainer ancestorElement = null, newAncestorElement;\n Node node = document.getDocumentElement();\n Element e;\n\n while (node != null) {\n newAncestorElement = null;\n\n if (node.getNodeType() == Node.ELEMENT_NODE) {\n e = (Element) node;\n\n switch (e.getTagName()) {\n case \"svg\":\n LSLength width = null;\n LSLength height = null;\n Attr widthAttr = e.getAttributeNodeNS(null, \"width\");\n\n if (widthAttr != null) {\n width = LSLength.parse(widthAttr.getValue());\n }\n\n Attr heightAttr = e.getAttributeNodeNS(null, \"height\");\n\n if (heightAttr != null) {\n height = LSLength.parse(heightAttr.getValue());\n }\n\n if ((width == null) || (height == null)) {\n break;\n }\n\n svg_e = new LSSVGContainer(width, height);\n ancestorElement = svg_e;\n\n break;\n\n case \"g\":\n LSGroupContainer g_e = LSGroupContainer.parseElement(e);\n\n if (ancestorElement != null) {\n ancestorElement.addDescendant(g_e);\n } else {\n LSEditor.logger.warning(\"Null pointer dereferencing while parsing group ancestor element\\n\");\n }\n\n newAncestorElement = g_e;\n\n break;\n\n case \"rect\":\n if (ancestorElement != null) {\n ancestorElement.addDescendant(LSShapeRect.parseElement(e));\n } else {\n LSEditor.logger.warning(\n \"Null pointer dereferencing while parsing rectangle ancestor element\\n\");\n }\n\n break;\n\n case \"circle\":\n if (ancestorElement != null) {\n ancestorElement.addDescendant(LSShapeCircle.parseElement(e));\n } else {\n LSEditor.logger.warning(\"Null pointer dereferencing while parsing circle ancestor element\\n\");\n }\n\n break;\n\n case \"line\":\n if (ancestorElement != null) {\n ancestorElement.addDescendant(LSShapeLine.parseElement(e));\n } else {\n LSEditor.logger.warning(\"Null pointer dereferencing while parsing line ancestor element\\n\");\n }\n\n break;\n }\n }\n\n if (node.hasChildNodes()) {\n node = node.getFirstChild();\n\n if (newAncestorElement != null) {\n ancestorElement = newAncestorElement;\n }\n } else if (node.getNextSibling() != null) {\n node = node.getNextSibling();\n } else {\n node = node.getParentNode().getNextSibling();\n\n if (ancestorElement != null) {\n if (ancestorElement.getAncestorElement() != null) {\n ancestorElement = ancestorElement.getAncestorElement();\n }\n } else {\n LSEditor.logger.warning(\"Null pointer dereferencing.\\n\");\n }\n }\n }\n\n return svg_e;\n }","title":""},{"docid":"fe722c439db34285d821ca39c99b2657","score":"0.4567737","text":"public VerDetalleSolicitudHTML(VerDetalleSolicitudHTML src) {\n/* 101 */ this.fDocumentLoader = src.getDocumentLoader();\n/* */ \n/* 103 */ setDocument((Document)src.getDocument().cloneNode(true), src.getMIMEType(), src.getEncoding());\n/* */ \n/* 105 */ syncAccessMethods();\n/* */ }","title":""},{"docid":"cacd38e9d301ea228b4b507b8bb45602","score":"0.45624456","text":"protected abstract D insert(D document);","title":""},{"docid":"28479f495e2fd8751650b1f65a64e2f3","score":"0.45586082","text":"@Override\n public void attach() {\n super.attach();\n }","title":""}],"string":"[\n {\n \"docid\": \"d56b594065c3a31a6fe3da51c614ea3d\",\n \"score\": \"0.6066535\",\n \"text\": \"public final void prepassDocument(DOM document) {\\n setIndexSize(document.getSize());\\n buildIDIndex(document);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"588cc12b8e78c71463eac0b1102b71bc\",\n \"score\": \"0.59351164\",\n \"text\": \"private void bulidDocument() {\\n\\t\\tDocumentBuilderFactory dfactory = DocumentBuilderFactory.newInstance();\\n\\t\\tdfactory.setNamespaceAware(true);\\n\\n\\t\\ttry {\\n\\t\\t\\tm_doc = dfactory.newDocumentBuilder().newDocument();\\n\\t\\t} catch (Exception ex) {\\n\\t\\t\\tex.printStackTrace();\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"50906377bbddca03dd488e140b91a2f1\",\n \"score\": \"0.5905454\",\n \"text\": \"protected void bodyAdd(DOMelement element){ \\n\\t\\t\\tdocument.getEmbeddedElements()[1].addDomElement(element); \\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3268e54424141618358c4be6f5c5a927\",\n \"score\": \"0.58970445\",\n \"text\": \"public Document(Element rootElement)\\n {\\n if (null == rootElement)\\n {\\n throw new NullPointerException(\\\"Root element must not be null.\\\");\\n }\\n if (rootElement.getParent() != null)\\n {\\n throw new InternalException(\\\"Element must be detached.\\\");\\n }\\n\\n appendChild(rootElement);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8f5b3b3b7b39fd4055efdcb2aaa22c3\",\n \"score\": \"0.58581024\",\n \"text\": \"public DOMRecord(Document document) {\\r\\n this();\\r\\n setDOM(document.getDocumentElement());\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b92ea025a5719a695fa8f6cf64fd325\",\n \"score\": \"0.5756833\",\n \"text\": \"private void process() {\\n\\t\\tElement rootElement = docMap.getDocument().getRootElement();\\n\\t\\tprocessTree(rootElement);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"93154e8c7a02e270da70ef3d40bbda66\",\n \"score\": \"0.5719332\",\n \"text\": \"public void buildDocument() {\\n/* 140 */ setDocument(getDocumentLoader().getDocument(getClass()), \\\"text/html\\\", \\\"ISO-8859-1\\\");\\n/* */ \\n/* 142 */ syncAccessMethods();\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cdc9fb61d4d77f84b23e5de2ada37579\",\n \"score\": \"0.5680812\",\n \"text\": \"public void startDocument() throws SAXException {\\r\\n\\t mDocuments = new DocumentVector();\\r\\n\\t stackel = new LGLElemStack();\\r\\n\\t \\t//mDocument = new Document();\\r\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d28e00f8bcf789c1a6df60e8ea5009a4\",\n \"score\": \"0.56490946\",\n \"text\": \"public void visitDocument() {\\n org.w3c.dom.Element element = document.getDocumentElement();\\n if ((element != null) && element.getTagName().equals(\\\"FORMA\\\")) {\\n visitElement_FORMA(element);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aee407d4858f1b48b997900f6a35515e\",\n \"score\": \"0.5567394\",\n \"text\": \"public void parsedHTMLFileToDocument(Document document);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9be2f6528d993c41270611987002fd2\",\n \"score\": \"0.55527127\",\n \"text\": \"private void parseDocument() {\\n\\t\\tElement docEle = dom.getDocumentElement();\\n\\n\\t\\t// get a nodelist of <employee> elements\\n\\t\\tNodeList nl = docEle.getElementsByTagName(\\\"Group\\\");\\n\\t\\tif (nl != null && nl.getLength() > 0) {\\n\\t\\t\\tfor (int i = 0; i < nl.getLength(); i++) {\\n\\n\\t\\t\\t\\t// get the employee element\\n\\t\\t\\t\\tElement el = (Element) nl.item(i);\\n\\n\\t\\t\\t\\t// get the Employee object\\n\\t\\t\\t\\tGroup e = getGroup(el);\\n\\n\\t\\t\\t\\t// add it to list\\n\\t\\t\\t\\tgroups.add(e);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da7ffb676f1a1eb5fb9480b6d7c43911\",\n \"score\": \"0.5485658\",\n \"text\": \"public void clear() {\\r\\n if(getDOM() instanceof Element) {\\r\\n String domName = ((Element)getDOM()).getTagName();\\r\\n this.dom = createNewDocument(domName, null);\\r\\n this.currentNode = this.dom;\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7dc5112b3291f20df45cf9b551b87f7\",\n \"score\": \"0.53964156\",\n \"text\": \"public void startDocument() throws org.xml.sax.SAXException{}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80fe2e2363ac9f3bda12620c664872e8\",\n \"score\": \"0.53517795\",\n \"text\": \"protected void syncWithDocument(Node node) {\\n/* 258 */ if (node.getNodeType() != 9)\\n/* */ {\\n/* 260 */ throw new XMLCRuntimeException(\\\"Node must be a document node\\\");\\n/* */ }\\n/* */ \\n/* */ \\n/* 264 */ Document doc = (Document)node;\\n/* */ \\n/* */ \\n/* */ try {\\n/* 268 */ Field[] fs = getClass().getDeclaredFields();\\n/* */ \\n/* 270 */ int substStart = \\\"$element_\\\".length();\\n/* */ \\n/* 272 */ for (int i = 0; i < fs.length; i++) {\\n/* */ \\n/* 274 */ Field f = fs[i];\\n/* */ \\n/* 276 */ if (f.getName().startsWith(\\\"$element_\\\")) {\\n/* */ \\n/* 278 */ String id = f.getName().substring(substStart);\\n/* */ \\n/* 280 */ Node idNode = doc.getElementById(id);\\n/* */ \\n/* 282 */ if (idNode == null) {\\n/* */ \\n/* 284 */ id = id.substring(0, 1).toLowerCase() + id.substring(1);\\n/* */ \\n/* 286 */ idNode = doc.getElementById(id);\\n/* */ } \\n/* */ \\n/* */ \\n/* 290 */ if (idNode != null) f.set(this, idNode);\\n/* */ \\n/* */ } \\n/* */ } \\n/* 294 */ } catch (Exception e) {\\n/* */ \\n/* 296 */ throw new XMLCRuntimeException(\\\"Error reflecting on element access fields\\\", e);\\n/* */ } \\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6da949faeb5cf7e7df88e1762a375ea3\",\n \"score\": \"0.5322463\",\n \"text\": \"private void copyChildren(org.w3c.dom.Node docElement, org.w3c.dom.Node newElement, org.w3c.dom.Document newDoc) {\\r\\n NodeList nodes = docElement.getChildNodes();\\r\\n org.w3c.dom.Node newNode;\\r\\n org.w3c.dom.Node oldNode;\\r\\n \\r\\n for(int i = 0; i < nodes.getLength(); i++) {\\r\\n oldNode = (org.w3c.dom.Node)(nodes.item(i));\\r\\n\\r\\n newNode = newDoc.importNode(oldNode, false);\\r\\n newElement.appendChild(newNode);\\r\\n \\r\\n if(oldNode.hasChildNodes())\\r\\n copyChildren(oldNode, newNode, newDoc);\\r\\n }\\r\\n isTextCurrent = false;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e2cc32239e10dca17f3b2f7f8fa394c1\",\n \"score\": \"0.52982694\",\n \"text\": \"public void startDocument() throws SAXException {\\r\\n tagList = new ArrayList<Tag>();\\r\\n isReadTagID = false;\\r\\n isReadDiscoverTime = false;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b33dbe02efe6c2fc2a58f24548af906\",\n \"score\": \"0.5294839\",\n \"text\": \"public void doit()\\n\\t{\\n\\t\\tDocument doc = null;\\n\\n\\t\\ttry {\\n\\t\\t\\t/**\\n\\t\\t\\t * create or modify doc.xml file\\n\\t\\t\\t */\\n\\t\\t\\tFile xmlFile = new File(path + File.separator + \\\"doc.xml\\\");\\n\\t\\n\\t\\t\\tDocumentBuilderFactory docFactory = DocumentBuilderFactory.newInstance();\\n\\t\\t\\tDocumentBuilder docBuilder = docFactory.newDocumentBuilder();\\n\\t \\n\\t\\t\\t/**\\n\\t\\t\\t * root elements\\n\\t\\t\\t */\\n\\t\\t\\ttry\\n\\t\\t\\t{\\n\\t\\t\\t\\t/**\\n\\t\\t\\t\\t * We see if the xml file is already there.\\n\\t\\t\\t\\t */\\n\\t\\t\\t\\tdoc = docBuilder.parse(xmlFile);\\n\\t\\t\\t}\\n\\t\\t\\tcatch (SAXException e)\\n\\t\\t\\t{\\n\\t\\t\\t\\t/**\\n\\t\\t\\t\\t * If not we create a new file with new elements.\\n\\t\\t\\t\\t */\\n\\t\\t\\t\\tdoc = docBuilder.newDocument();\\n\\t\\t\\t\\tElement rootElement = doc.createElement(\\\"documents\\\");\\n\\t\\t\\t\\tdoc.appendChild(rootElement);\\n\\t\\t\\t}\\n\\t\\t\\tcatch (IOException e)\\n\\t\\t\\t{\\n\\t\\t\\t\\tdoc = docBuilder.newDocument();\\n\\t\\t\\t\\tElement rootElement = doc.createElement(\\\"documents\\\");\\n\\t\\t\\t\\tdoc.appendChild(rootElement);\\n\\t\\t\\t}\\n\\n\\t\\t\\t/**\\n\\t\\t\\t * Retrieve the root element, which is documents.\\n\\t\\t\\t */\\n\\t\\t\\tNodeList rootElementNode = doc.getElementsByTagName(\\\"documents\\\");\\n\\t\\t\\tNode root = rootElementNode.item(0);\\n\\n\\t\\t\\t/**\\n\\t\\t\\t * create document child elements\\n\\t\\t\\t */\\n\\t\\t\\tElement edocument = doc.createElement(\\\"document\\\");\\n\\t\\t\\troot.appendChild(edocument);\\n\\n\\t\\t\\tint noelements = doc.getElementsByTagName(\\\"document\\\").getLength();\\n\\n\\t\\t\\t/**\\n\\t\\t\\t * create id attribute to document element\\n\\t\\t\\t */\\n\\t\\t\\tAttr idattr = doc.createAttribute(\\\"id\\\");\\n\\t\\t\\tidattr.setValue(\\\"DOC0000\\\" + noelements);\\n\\t\\t\\tedocument.setAttributeNode(idattr);\\n\\n\\t\\t\\t/**\\n\\t\\t\\t * create filename attribute to document element\\n\\t\\t\\t */\\n\\t\\t\\tAttr filattr = doc.createAttribute(\\\"filename\\\");\\n\\t\\t\\tfilattr.setValue(validwipoxml);\\n\\t\\t\\tedocument.setAttributeNode(filattr);\\n\\n\\t\\t\\t/**\\n\\t\\t\\t * create title child elements\\n\\t\\t\\t */\\n\\t\\t\\tElement etitle = doc.createElement(\\\"title\\\");\\n\\t\\t\\tetitle.appendChild(doc.createTextNode(title));\\n\\t\\t\\tedocument.appendChild(etitle);\\n\\n\\t\\t\\t/**\\n\\t\\t\\t * create keywords child elements\\n\\t\\t\\t */\\n\\t\\t\\tElement ekeyword = doc.createElement(\\\"keywords\\\");\\n\\t\\t\\tekeyword.appendChild(doc.createTextNode(keyword));\\n\\t\\t\\tedocument.appendChild(ekeyword);\\n\\n\\t\\t\\t/**\\n\\t\\t\\t * create date child elements\\n\\t\\t\\t */\\n\\t\\t\\tElement edate = doc.createElement(\\\"date\\\");\\n\\t\\t\\tedate.appendChild(doc.createTextNode(date));\\n\\t\\t\\tedocument.appendChild(edate);\\n\\n\\t\\t\\t/**\\n\\t\\t\\t * create description child elements\\n\\t\\t\\t */\\n\\t\\t\\tElement edescription = doc.createElement(\\\"description\\\");\\n\\t\\t\\tedescription.appendChild(doc.createTextNode(description));\\n\\t\\t\\tedocument.appendChild(edescription);\\n\\t \\n\\t\\t\\t/**\\n\\t\\t\\t * write the content into xml file\\n\\t\\t\\t */\\n\\t\\t\\tTransformerFactory transformerFactory = TransformerFactory.newInstance();\\n\\t\\t\\tTransformer transformer = transformerFactory.newTransformer();\\n\\t\\t\\tDOMSource source = new DOMSource(doc);\\n\\t\\t\\tStreamResult result = new StreamResult(xmlFile);\\n\\t \\n\\t\\t\\ttransformer.transform(source, result);\\n\\t\\t} catch (ParserConfigurationException pce) {\\n\\t\\t\\tpce.printStackTrace();\\n\\t\\t} catch (TransformerException tfe) {\\n\\t\\t\\ttfe.printStackTrace();\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31fe128a28b12a26a5f03d05df775c57\",\n \"score\": \"0.52634364\",\n \"text\": \"public void visit(Document document) {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8f668f345bc5df18eafe28ac60c91df8\",\n \"score\": \"0.5259783\",\n \"text\": \"public void startDocument() {\\n\\t\\t pushTag(\\\"\\\");\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70d78ec5846771b1e1375e16746b8549\",\n \"score\": \"0.5237147\",\n \"text\": \"public LoadDoc() {\\n\\t\\t\\torganizeLayout();\\n\\t\\t\\tassignListeners();\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a68a06617694b0d5377f1c8ecf19815\",\n \"score\": \"0.52203566\",\n \"text\": \"@Override\\r\\n public Document ActualizarDOM() {\\r\\n\\r\\n try {\\r\\n\\r\\n DocumentBuilder dBuilder = DocumentBuilderFactory.newInstance().newDocumentBuilder();\\r\\n Document doc = dBuilder.parse(xml);\\r\\n doc.normalizeDocument();\\r\\n return doc;\\r\\n\\r\\n } catch (SAXException | IOException | ParserConfigurationException ex) {\\r\\n Logger.getLogger(GestionProducto.class.getName()).log(Level.SEVERE, null, ex);\\r\\n }\\r\\n\\r\\n return null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9747bc0596502e2841b025fa43e5208\",\n \"score\": \"0.5217489\",\n \"text\": \"public DomWindow(HTMLDocumentImpl document) {\\r\\n _document = document;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f62542be2a21cf9fa3d4ff0229340a8a\",\n \"score\": \"0.52163035\",\n \"text\": \"static void\\n setDocumentAndDecorate(ThreadContext context, RubyObject self, XmlDocument doc)\\n {\\n self.setInstanceVariable(\\\"@document\\\", doc == null ? context.nil : doc);\\n if (doc != null) { Helpers.invoke(context, doc, \\\"decorate\\\", self); }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b2ea340c1390fd5296748e32262c14f\",\n \"score\": \"0.5199716\",\n \"text\": \"public Document getDOM() {\\n\\t\\t\\tif (root.getChildNodes().getLength() == 1) {\\n\\t\\t\\t\\tdocument.appendChild(root.getFirstChild());\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tdocument.appendChild(root);\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn document;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"90685279773b8e510c9c60fee6b6c84d\",\n \"score\": \"0.518411\",\n \"text\": \"public void add(Document document) ;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db491d4472fe84e41ebcb449d7f91a7f\",\n \"score\": \"0.51818573\",\n \"text\": \"@Override\\n\\tpublic void addDataElement(webarchive.api.xml.DataElement element) throws\\n\\t\\tException {\\n\\t\\tupdateDocument(client.syncDocument(element));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a411ba96c86076a9d79f6c3e39ec7d1\",\n \"score\": \"0.51812506\",\n \"text\": \"@Override\\r\\n\\tpublic void startDocument() throws SAXException {\\n\\t\\tsuper.startDocument();\\r\\n//\\t\\tSystem.out.println(\\\"startDocument\\\");\\r\\n\\t\\tmList = new ArrayList<Entry>();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6dd8ee59c8f903ac661e0e698801461\",\n \"score\": \"0.5167297\",\n \"text\": \"protected void pass1(Document document) {\\n\\t\\tAspects aspects= xml2AspectsResource(document);\\n\\t\\tif (aspects != null) {\\n\\t\\t\\tgetResource().getContents().add((EObject) aspects);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b815689e7561f64218e02279a6a46810\",\n \"score\": \"0.5140148\",\n \"text\": \"public void parseDocument() {\\n\\t\\tElement docEle = dom.getDocumentElement();\\n\\n\\t\\t// obtenemos el nodelist de elementos accion\\n\\t\\tNodeList nl = docEle.getElementsByTagName(\\\"accion\\\");\\n\\t\\tif (nl != null && nl.getLength() > 0) {\\n\\t\\t\\tfor (int i = 0; i < nl.getLength(); i++) {\\n\\n\\t\\t\\t\\t// obtenemos un elemento de la lista (accion)\\n\\t\\t\\t\\tElement el = (Element) nl.item(i);\\n\\n\\t\\t\\t\\t// obtenemos una accion\\n\\t\\t\\t\\tAccion a = getAccion(el);\\n\\n\\t\\t\\t\\t// y la aņadimos al array\\n\\t\\t\\t\\tacciones.add(a);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7308f71caaab062a8a029724c8ad638\",\n \"score\": \"0.5138576\",\n \"text\": \"private Document copyDocument(Document doc) {\\r\\n DOMImplementationImpl impl = new DOMImplementationImpl();\\r\\n DocumentType docType = impl.createDocumentType(\\\"TM4ML\\\",null,TMEV.getConfigurationFile(\\\"mev_script_dtd.dtd\\\").getAbsolutePath());\\r\\n \\r\\n Document newDoc = impl.createDocument(null, \\\"TM4ML\\\", docType);\\r\\n copyChildren(doc.getDocumentElement(), newDoc.getDocumentElement(), newDoc);\\r\\n isTextCurrent = false;\\r\\n return newDoc;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dd4912f67ef47c9a436f28953e1067f0\",\n \"score\": \"0.51322496\",\n \"text\": \"public void startDocument() throws SAXException {\\n\\t\\tsuper.startDocument();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c07466af13100b30142ac2172f1c21e\",\n \"score\": \"0.513131\",\n \"text\": \"@Override\\n\\tpublic abstract void addDocument(final lotus.domino.Document doc);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f26d78061e7a66368596a6849435cf89\",\n \"score\": \"0.51097655\",\n \"text\": \"protected static org.w3c.dom.Document setUpXML(String nodeName) \\n {\\n try\\n {\\n DocumentBuilderFactory myFactory = DocumentBuilderFactory.newInstance();\\n DocumentBuilder myDocBuilder = myFactory.newDocumentBuilder();\\n DOMImplementation myDOMImpl = myDocBuilder.getDOMImplementation();\\n // resultDocument = myDOMImpl.createDocument(\\\"at.ac.tuwien.dbai.pdfwrap\\\", \\\"PDFResult\\\", null);\\n org.w3c.dom.Document resultDocument = \\n myDOMImpl.createDocument(\\\"at.ac.tuwien.dbai.pdfwrap\\\", nodeName, null);\\n return resultDocument;\\n }\\n catch (ParserConfigurationException e)\\n {\\n e.printStackTrace();\\n return null;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"275a5e194a1a7e303934f8f293da5c06\",\n \"score\": \"0.51030207\",\n \"text\": \"public void startDocument() throws org.xml.sax.SAXException {\\n\\n // No action for the moment.\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35ae7bfc1880b00911de47be85b5c628\",\n \"score\": \"0.50678015\",\n \"text\": \"public void setDocument(Document doc) {\\r\\n document = doc;\\r\\n updateScript();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98e996dcbe0fd2b87c892abf25e2e41e\",\n \"score\": \"0.5066744\",\n \"text\": \"public void setupData() {\\n\\t\\tsuper.setupData();\\n\\t Document doc = theController.getDocument();\\n\\t lblTitle.setText(doc.getTitle());\\n\\t documentText.setText(doc.getText());\\n\\t lblPostedBy.setText(\\\"Posted By: \\\" + doc.getAuthor().getUsername());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f600399d7b42f8557026a8dafad77d8f\",\n \"score\": \"0.5040477\",\n \"text\": \"public interface Document extends Node {\\n /**\\n * This method creates a new <code>CDATASection</code>.\\n *\\n * @param data the data of the new <code>CDATASection</code>\\n * @return the newly created <code>CDATASection</code>\\n */\\n CDATASection createCDATASection(String data);\\n\\n /**\\n * This method creates a new <code>Comment</code>.\\n *\\n * @param data the data of the new <code>Comment</code>\\n * @return the newly created <code>Comment</code>\\n */\\n Comment createComment(String data);\\n\\n /**\\n * This method creates a new <code>DocumentFragment</code>.\\n *\\n * @return the newly created <code>DocumentFragment</code>\\n */\\n DocumentFragment createDocumentFragment();\\n\\n /**\\n * This method creates a new <code>Element</code>.\\n *\\n * @param tagName the tag name of the new <code>Element</code>\\n * @return the newly created <code>Element</code>\\n */\\n Element createElement(String tagName);\\n\\n /**\\n * This method creates a new <code>ProcessingInstruction</code>.\\n *\\n * @param target the target of the new <code>ProcessingInstruction</code>\\n * @param data the data of the new <code>ProcessingInstruction</code>\\n * @return the newly created <code>ProcessingInstruction</code>\\n */\\n ProcessingInstruction createProcessingInstruction(String target, String data);\\n\\n /**\\n * This method creates a new <code>Text</code>.\\n *\\n * @param data the data of the new <code>Text</code>\\n * @return the newly created <code>Text</code>\\n */\\n Text createTextNode(String data);\\n\\n /**\\n * This method retrieves the document element. Each document has at most one <code>Element</code>\\n * as its direct child, and this node is returned if it exists. <code>null</code> is returned\\n * otherwise.\\n *\\n * @return the document element of this <code>Document</code>\\n */\\n Element getDocumentElement();\\n\\n /**\\n * This method retrieves the unique descendent elements which has an id of <code>elementId</code>.\\n * Note the attribute which is used as an ID must be supplied in the DTD of the document. It is\\n * not sufficient to give the <code>Element</code> to be retrieved an attribute named 'id'.\\n *\\n * @param elementId id of element\\n * @return the <code>Element</code> which has an id of <code>elementId</code> and belongs to this\\n * <code>Document</code>\\n */\\n Element getElementById(String elementId);\\n\\n /**\\n * This method retrieves any descendent elements which have a tag name of <code>tagname</code>.\\n *\\n * @param tagname name of tag\\n * @return the <code>NodeList</code> of elements which has a tag name of <code>tagname</code> and\\n * belong to this <code>Document</code>\\n */\\n NodeList getElementsByTagName(String tagname);\\n\\n /**\\n * This method imports a node into the current <code>Document</code>.\\n *\\n * @param importedNode node to import\\n * @param deep whether to recurse to children\\n * @return the node <code>Node</code> imported\\n */\\n Node importNode(Node importedNode, boolean deep);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ee5c65deedaa5490ff00a08f569cada\",\n \"score\": \"0.5035262\",\n \"text\": \"public void performModification(DocumentBuilder docBuilder, Document doc)\\n throws SAXException, IOException, CoreException {\\n Document contentDoc = docBuilder.parse(new ByteArrayInputStream(\\n content.getBytes()));\\n NodeList newChildren = contentDoc.getChildNodes();\\n\\n // add content\\n // note that this requires that the <tagname> element exists\\n NodeList nodeList = doc.getElementsByTagName(tagname);\\n\\n addWhitespace(doc, nodeList.item(0), \\\" \\\");\\n\\n if (nodeList.getLength() > 0) {\\n for (int i = 0; i < newChildren.getLength(); ++i) {\\n Node newChild = newChildren.item(i);\\n nodeList.item(0).appendChild(doc.adoptNode(newChild));\\n }\\n } else {\\n throw VaadinPluginUtil.newCoreException(\\\"The XML file \\\"\\n + filename + \\\" is missing the tag \\\" + tagname, null);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c85ce73e13dea3240632697dbf57a317\",\n \"score\": \"0.5030762\",\n \"text\": \"public Document ( ) { _buffer = new StringBuffer(); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"30a391ec99da72653fb6ed19426e073b\",\n \"score\": \"0.5001361\",\n \"text\": \"DocumentRoot createDocumentRoot();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"30a391ec99da72653fb6ed19426e073b\",\n \"score\": \"0.5001361\",\n \"text\": \"DocumentRoot createDocumentRoot();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"93c9edbb94c441111ffa307b95e05ea3\",\n \"score\": \"0.4998678\",\n \"text\": \"public void startDocument ()\\n throws SAXException {\\n return;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6458fba996ad2651aebf97a4f69ee34b\",\n \"score\": \"0.49903446\",\n \"text\": \"public void startDocument() throws SAXException {\\r\\n \\t// initialize postsLength hash table\\r\\n \\tpostsLength.put(\\\"short\\\",0);\\r\\n \\tpostsLength.put(\\\"average\\\",0);\\r\\n \\tpostsLength.put(\\\"long\\\",0);\\r\\n \\t\\r\\n \\t// open up output files : dataset and statistics\\r\\n \\ttry {\\r\\n \\t\\toutput_file = new PrintWriter(\\\"c:/dataset.txt\\\", \\\"UTF-8\\\");\\r\\n \\t\\tstats = new PrintWriter(\\\"c:/stats.txt\\\", \\\"UTF-8\\\");\\r\\n \\t} catch (Exception e){\\r\\n \\t\\tSystem.out.println(\\\"error in openning output files\\\");\\r\\n \\t}\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1e7ea8a539d0a30f4a0416dae6e95d7\",\n \"score\": \"0.49866655\",\n \"text\": \"private void storePostData(HTMLDocument doc,String target,String data){\\n Document propDoc=doc;\\n String propName=PostDataProperty;\\n if(doc.isFrameDocument()){\\n // find the top-most JEditorPane holding the frameset view.\\n FrameView.FrameEditorPane p=\\n (FrameView.FrameEditorPane)getContainer();\\n FrameView v=p.getFrameView();\\n JEditorPane c=v.getOutermostJEditorPane();\\n if(c!=null){\\n propDoc=c.getDocument();\\n propName+=(\\\".\\\"+target);\\n }\\n }\\n propDoc.putProperty(propName,data);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d258aa6d378d548aaf9820fe92b6a525\",\n \"score\": \"0.4970107\",\n \"text\": \"@Override\\n public void insertTo(ImonggoDBHelper2 dbHelper) {\\n if(shouldPageRequest() && isOldPaging) {\\n try {\\n List<Document> documents = getChildDocuments();\\n for (Document child : documents)\\n child.insertTo(dbHelper);\\n } catch (JSONException e) {\\n e.printStackTrace();\\n }\\n return;\\n }\\n insertExtrasTo(dbHelper);\\n\\n try {\\n dbHelper.insert(Document.class, this);\\n } catch (SQLException e) {\\n e.printStackTrace();\\n }\\n\\n refresh();\\n if(document_lines != null) {\\n for (DocumentLine documentLine : document_lines) {\\n documentLine.setDocument(this);\\n try {\\n Product product = dbHelper.fetchObjects(Product.class).queryBuilder().where().eq(\\\"id\\\", documentLine.getProduct_id())\\n .queryForFirst();\\n if (product != null)\\n documentLine.setProduct(product);\\n } catch (SQLException e) {\\n e.printStackTrace();\\n }\\n documentLine.insertTo(dbHelper);\\n }\\n }\\n\\n updateExtrasTo(dbHelper);\\n\\n Log.e(\\\"DOCUMENT\\\", \\\"insert \\\" + id + \\\" ~ \\\" + (offlineData != null? offlineData.getId() : \\\"null\\\") );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5cf26f6b4ad49cc7c88c6c71b34bd958\",\n \"score\": \"0.49658722\",\n \"text\": \"public DOMRecord(Element element) {\\r\\n this();\\r\\n setDOM(element);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a768596547e31d860817e54f3912b856\",\n \"score\": \"0.49639326\",\n \"text\": \"@Override\\n\\tpublic void startDocument() {\\n\\t\\taccumulator = new StringBuffer();\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1ab4a93080a7608d495487b1d13eb220\",\n \"score\": \"0.49578628\",\n \"text\": \"protected void append(Node newNode) throws org.xml.sax.SAXException {\\n\\n Node currentNode = this.currentNode;\\n\\n if (null != currentNode) {\\n if (currentNode == this.root && this.nextSibling != null)\\n currentNode.insertBefore(newNode, this.nextSibling);\\n else\\n currentNode.appendChild(newNode);\\n\\n // System.out.println(newNode.getNodeName());\\n } else if (null != this.docFrag) {\\n if (this.nextSibling != null)\\n this.docFrag.insertBefore(newNode, this.nextSibling);\\n else\\n this.docFrag.appendChild(newNode);\\n } else {\\n boolean ok = true;\\n short type = newNode.getNodeType();\\n\\n if (type == Node.TEXT_NODE) {\\n String data = newNode.getNodeValue();\\n\\n if ((null != data) && (data.trim().length() > 0)) {\\n throw new org.xml.sax.SAXException(\\\"Warning: can't output text before document element! Ignoring...\\\");\\n }\\n\\n ok = false;\\n } else if (type == Node.ELEMENT_NODE) {\\n if (this.document.getDocumentElement() != null) {\\n ok = false;\\n\\n throw new org.xml.sax.SAXException(\\\"Can't have more than one root on a DOM!\\\");\\n }\\n }\\n\\n if (ok) {\\n if (this.nextSibling != null)\\n this.document.insertBefore(newNode, this.nextSibling);\\n else\\n this.document.appendChild(newNode);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0834a32c30546b480a1db21303527e4c\",\n \"score\": \"0.4946747\",\n \"text\": \"@Override\\n\\tpublic void startDocument() throws SAXException {\\n\\t\\tsuper.startDocument();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac9cd7cc59cd6a520e6816ef6d18ae2d\",\n \"score\": \"0.49373525\",\n \"text\": \"public static void attach(DocumentBuilder db)\\r\\n\\t{\\r\\n\\t\\tdb.setEntityResolver(new FastEntityResolver(db.isValidating()));\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6827ed21dc01b81de5bc5bd13f1e4828\",\n \"score\": \"0.49280256\",\n \"text\": \"public static void copiperDocument(Document source, Document destination)\\r\\n {\\r\\n Node node = destination.importNode(source.getDocumentElement(), true);\\r\\n\\r\\n destination.getDocumentElement().appendChild(node);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"169ab165223e265c5c66c7a96b19ad24\",\n \"score\": \"0.49235517\",\n \"text\": \"public void startDocument() throws SAXException {\\n parsingInProgress = true;\\n qNameStack.removeAllElements();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"425f02740c6b4b0863309b349e6b490c\",\n \"score\": \"0.49233744\",\n \"text\": \"@Override\\r\\n\\tpublic Object setData(Element pElement) {\\n\\t\\treturn null;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19b4776fda70b6561c360cabb10a5642\",\n \"score\": \"0.49167672\",\n \"text\": \"public void startDocument() throws org.xml.sax.SAXException\\r\\n {\\r\\n\\r\\n if (m_inEntityRef)\\r\\n return;\\r\\n\\r\\n m_needToOutputDocTypeDecl = true;\\r\\n m_startNewLine = false;\\r\\n\\r\\n if (m_shouldNotWriteXMLHeader == false)\\r\\n {\\r\\n String encoding = Encodings.getMimeEncoding(m_encoding);\\r\\n String version = (null == m_version) ? \\\"1.0\\\" : m_version;\\r\\n String standalone;\\r\\n\\r\\n if (m_standaloneWasSpecified)\\r\\n {\\r\\n standalone = \\\" standalone=\\\\\\\"\\\" + (m_standalone ? \\\"yes\\\" : \\\"no\\\") + \\\"\\\\\\\"\\\";\\r\\n }\\r\\n else\\r\\n {\\r\\n standalone = \\\"\\\";\\r\\n }\\r\\n\\r\\n try\\r\\n {\\r\\n final Writer writer = m_writer;\\r\\n writer.write(\\\"<?xml version=\\\\\\\"\\\");\\r\\n writer.write(version);\\r\\n writer.write(\\\"\\\\\\\" encoding=\\\\\\\"\\\");\\r\\n writer.write(encoding);\\r\\n writer.write('\\\\\\\"');\\r\\n writer.write(standalone);\\r\\n writer.write(\\\"?>\\\");\\r\\n writer.write(m_lineSep, 0, m_lineSepLen);\\r\\n }\\r\\n catch(IOException ioe)\\r\\n {\\r\\n throw new SAXException(ioe);\\r\\n }\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"433bc96c1d25503b130495848cbbc506\",\n \"score\": \"0.4908055\",\n \"text\": \"public void supplement(DomElement domElement) {\\n // nothing to do.\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5e3b2b8853e632bb2f564724927b4aa\",\n \"score\": \"0.48983774\",\n \"text\": \"public void addAllContentAsIntentElement(EObject root, IntentEditorDocument document) {\\n \\t\\tObject identifier = listenedElementsHandler.getRepositoryAdapter().getIDFromElement(root);\\n \\n \\t\\t// We first associate this root in to the given document\\n \\t\\tif (elementsToDocuments.get(identifier) == null) {\\n \\t\\t\\telementsToDocuments.put(identifier, new ArrayList<IntentEditorDocument>());\\n \\t\\t}\\n \\t\\tif (!elementsToDocuments.get(identifier).contains(document)) {\\n \\t\\t\\telementsToDocuments.get(identifier).add(document);\\n \\t\\t}\\n \\n \\t\\t// Then we do the same for all its contained element\\n \\t\\tfor (EObject content : root.eContents()) {\\n \\t\\t\\taddAllContentAsIntentElement(content, document);\\n \\t\\t}\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b9df09841705a3bb28752bbaad256ded\",\n \"score\": \"0.48697042\",\n \"text\": \"public void installDocument(IDocument doc) {\\n \\t\\t\\tif (fDocument != null)\\n \\t\\t\\t\\tfDocument.removeDocumentListener(this);\\n \\t\\t\\tfDocument= doc;\\n \\t\\t\\tif (fDocument != null)\\n \\t\\t\\t\\tfDocument.addDocumentListener(this);\\n \\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87ef8f1d2966cf156e57461d3e656c75\",\n \"score\": \"0.486558\",\n \"text\": \"private void readXML(Document document) throws Exception {\\n \\tif(Oscar3Props.getInstance().verbose) System.out.print(\\\"Initialising data parser... \\\");\\n \\tdoc = document;\\n \\tnodeDict = new HashMap<String,String>();\\n \\t// create top RPNode\\n \\ttopNode = new RPNode(this);\\n\\n \\t// find <child> within <top> and add them to topNode\\n \\tNode top = doc.query(\\\"//top\\\").get(0);\\n \\tfor(int i=0;i<top.getChildCount();i++) {\\n \\t\\tNode child = top.getChild(i);\\n \\t\\tif(child instanceof Element) {\\n \\t\\t\\tElement childElem = (Element)child;\\n \\t\\t\\tif(\\\"child\\\".equals(childElem.getLocalName())) {\\n \\t\\t\\t\\t// child is of type <child>\\n \\t\\t\\t\\tString type = childElem.getAttributeValue(\\\"type\\\");\\n \\t\\t\\t\\tString id = childElem.getAttributeValue(\\\"id\\\");\\n \\t\\t\\t\\t// find the <node> the <child> refers to\\n \\t\\t\\t\\tNode node2 = findNode(type, id);\\n \\t\\t\\t\\tif(node2==null)\\n \\t\\t\\t\\t\\tcontinue;\\n \\t\\t\\t\\t// node2 is the <node> referred to by <child>\\n \\t\\t\\t\\t// get value attribute, if exists, else null\\n \\t\\t\\t\\ttopNode.addChild((Element)node2); \\t \\n \\t\\t\\t}\\n \\t\\t}\\n \\t}\\n\\n \\tnodeDict = null;\\n \\tSystem.gc();\\n \\tif(Oscar3Props.getInstance().verbose) System.out.println(\\\"regexes initialised\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4f06c76ef3327ec7eaf271c4062db5b\",\n \"score\": \"0.48489946\",\n \"text\": \"private static void createDocument(NodeList nodes, String personName, String phoneNumber ) {\\n\\t\\t DocumentBuilder db;\\n\\t\\t try {\\n\\t\\t\\tdb = DocumentBuilderFactory.newInstance().newDocumentBuilder();\\n\\t\\t\\torg.w3c.dom.Document d2 = db.newDocument();\\n\\t\\t\\tElement ele = (Element)d2.createElement(\\\"Person\\\");\\n\\t\\t\\tele.setAttribute(\\\"name\\\", personName);\\n\\t\\t\\td2.appendChild(ele);\\n\\t\\t\\t\\n\\t\\t\\tElement ele1 = (Element)d2.createElement(\\\"PhoneNumber\\\");\\n\\t\\t\\tele1.setAttribute(\\\"number\\\", phoneNumber);\\n\\t\\t\\tele.appendChild(ele1);\\n\\t\\t\\t\\n\\t\\t\\tfor (int i = 0; i < nodes.getLength(); i++) {\\n\\t\\t\\t Node node = nodes.item(i);\\n\\t\\t\\t d2.adoptNode(node);\\n\\t\\t\\t ele1.appendChild(node);\\n\\t\\t\\t}\\n\\t\\t\\tDOMSource domSource = new DOMSource(d2);\\n\\t\\t\\tStringWriter writer = new StringWriter();\\n\\t\\t\\tStreamResult result = new StreamResult(writer);\\n\\t\\t\\tTransformerFactory tf = TransformerFactory.newInstance();\\n\\t\\t\\tTransformer transformer = tf.newTransformer();\\n\\t\\t\\ttransformer.transform(domSource, result);\\n\\t\\t\\tSystem.out.println(\\\"XML IN String format is: \\\\n\\\" + writer.toString());\\n\\t\\t\\t\\n\\t\\t \\n\\t\\t }\\n\\t\\t catch(Exception e)\\n\\t\\t {\\n\\t\\t\\t\\tSystem.out.println(e);\\n\\t\\t }\\n\\t\\t \\n\\t \\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dd009125a89c198d3ea6e3426bf4ce2\",\n \"score\": \"0.48266524\",\n \"text\": \"public void addToDocuments(entity.ActivityDocument element);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c983dc04749462c330f76bee36aafdfd\",\n \"score\": \"0.48226514\",\n \"text\": \"private void fillbuf () throws IOException, SAXException {\\n\\n // don't touched fixed buffers, that'll usually\\n // change entity values (and isn't needed anyway)\\n // likewise, ignore closed streams\\n if (reader == null || isClosed)\\n return;\\n \\n // if remembering DTD text, copy!\\n if (startRemember != 0) {\\n if (rememberedText == null)\\n rememberedText = new StringBuffer (buf.length);\\n rememberedText.append (buf, startRemember,\\n start - startRemember);\\n }\\n\\n boolean extra = (finish > 0) && (start > 0);\\n int len;\\n\\n if (extra) // extra pushback\\n start--;\\n len = finish - start;\\n\\n System.arraycopy (buf, start, buf, 0, len);\\n start = 0;\\n finish = len;\\n\\n try {\\n len = buf.length - len;\\n len = reader.read (buf, finish, len);\\n } catch (UnsupportedEncodingException e) {\\n fatal (\\\"P-075\\\", new Object [] { e.getMessage () });\\n } catch (CharConversionException e) {\\n fatal (\\\"P-076\\\", new Object [] { e.getMessage () });\\n }\\n if (len >= 0)\\n finish += len;\\n else\\n close ();\\n if (extra) // extra pushback\\n start++;\\n\\n if (startRemember != 0)\\n // assert extra == true\\n startRemember = 1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"229eba91d8af99868da24e116c350791\",\n \"score\": \"0.4820134\",\n \"text\": \"public void startDocument() throws SAXException {\\r\\n\\t\\tsemantics.reset();\\r\\n\\t\\tfaceexpressionlist = new Vector();\\r\\n\\t\\tnatpause = 0;\\r\\n\\t\\tbreakpause = 0;\\r\\n\\t\\tgesturelist = new Vector();\\r\\n\\t\\tfacialanimationlist = new Vector();\\r\\n\\t\\tspeechlist = new Vector();\\r\\n\\t\\texcessfaps = new Vector();\\r\\n\\t\\tplaintext = new String(\\\"\\\");\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9367ee9bf630197570a522768ac6a44e\",\n \"score\": \"0.48080614\",\n \"text\": \"public void setDOM(Node element) {\\r\\n this.dom = element;\\r\\n this.currentNode = element;\\r\\n this.getNamespaceResolver().setDOM(element);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1c2d4501d166ec7f37876334c54997c\",\n \"score\": \"0.48079666\",\n \"text\": \"protected void postProcessXml(Element root) {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"84a929a94e52af27dc163a346a84e277\",\n \"score\": \"0.4798102\",\n \"text\": \"public void startDocument() throws SAXException {\\n // Logging a debug message\\n// if (_theLogger.isDebugEnabled()) {\\n// _theLogger.debug(\\\"Method startDocument() is beign called\\\");\\n// }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1133ca0078b65b497a3c5552876359c9\",\n \"score\": \"0.47873026\",\n \"text\": \"private void setupDoc() {\\n doc = this.getStyledDocument(); \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d7ccd1f09e5e376d02a2f20a0e275d0\",\n \"score\": \"0.47733504\",\n \"text\": \"private void parseDocument(String tagName) {\\n\\t\\tElement docEle = document.getDocumentElement();\\n\\n\\t\\t// get a nodelist of <employee> elements\\n\\t\\tdbEntities = docEle.getElementsByTagName(tagName);\\n\\t\\t// dbAttributes = null;\\n\\t\\tif (dbEntities != null && dbEntities.getLength() > 0) {\\n\\t\\t\\tfor (int i = 0; i < dbEntities.getLength(); i++) {\\n\\t\\t\\t\\tdbAttributes = ((Element) dbEntities.item(i))\\n\\t\\t\\t\\t\\t\\t.getElementsByTagName(DB_ATTRIBUTE);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a63d35b35bed097b1b456e703023de57\",\n \"score\": \"0.47700185\",\n \"text\": \"public void save(OutputStream out) throws Exception {\\r\\n // 2DO FLUSH AND SAVE IN PACKAGE\\r\\n flushDoms();\\r\\n updateMetaData();\\r\\n if (!isRootDocument()) {\\r\\n Document newDoc = loadDocumentFromTemplate(getOdfMediaType());\\r\\n newDoc.insertDocument(this, ROOT_DOCUMENT_PATH);\\r\\n newDoc.updateMetaData();\\r\\n newDoc.mPackage.save(out);\\r\\n // ToDo: (Issue 219 - PackageRefactoring) - Return the document,\\r\\n // when not closing!\\r\\n // Should we close the sources now? User will never receive the open\\r\\n // package!\\r\\n } else {\\r\\n // 2DO MOVE CACHE TO PACKAGE\\r\\n // // the root document only have to flush the DOM of all open child\\r\\n // documents\\r\\n // flushAllDOMs();\\r\\n mPackage.save(out);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c666b2835b0666c00d3df18c7f0b29f0\",\n \"score\": \"0.4764127\",\n \"text\": \"public final void refresh() {\\n\\t\\tsetRoot(rootElement);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be1324dc1be076bdc5ab25dda39a6dc9\",\n \"score\": \"0.47419947\",\n \"text\": \"private void guardarDOM(Document documento) {\\n\\t\\t\\n\\t\\ttry {\\n\\t\\t\\t//Establecemos el árbol a guardar\\n\\t\\t\\tSource fuente = new DOMSource(documento);\\n\\t\\t\\t//Establecemos el fichero destion\\n\\t\\t\\tResult destino = new StreamResult(new File(nombre));\\n\\t\\t\\t//Creamos el transformador\\n\\t\\t\\tTransformer t = TransformerFactory.newInstance().newTransformer();\\n\\t\\t\\t//Creamos el nuevo fichero\\n\\t\\t\\tt.transform(fuente, destino);\\n\\t\\t\\t\\n\\t\\t} catch (TransformerConfigurationException e) {\\n\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\te.printStackTrace();\\n\\t\\t} catch (TransformerFactoryConfigurationError e) {\\n\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\te.printStackTrace();\\n\\t\\t} catch (TransformerException e) {\\n\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da22ddd53868ec2fca8b1f04d08790de\",\n \"score\": \"0.47328365\",\n \"text\": \"public Document createDocument() {\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tDocument document = DocumentHelper.createDocument();\\r\\n\\r\\n\\t\\t\\tmydom = document;\\r\\n\\r\\n\\t\\t\\treturn document;\\r\\n\\t\\t} catch (Exception e) {\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t\\treturn null;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7003b23e5780b645df1c9ea7519099c\",\n \"score\": \"0.47310978\",\n \"text\": \"@Override\\n public void startDocument() throws SAXException {\\n currentNode = null;\\n charBuffer.setLength(0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c279af613dc4b5fd84bd5f3d5470539c\",\n \"score\": \"0.47310406\",\n \"text\": \"public WSDLElementImpl(XMLDocument d) {\\n super(d);\\n initWSDLElement();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db309c525b6204884e935fdb33a9623e\",\n \"score\": \"0.4725217\",\n \"text\": \"public void loadEmbeddedData(Object datum, DefaultMutableTreeNode itsRoot, List sourceNames) {\\r\\n itsRoot.removeAllChildren();\\r\\n itsRoot.setUserObject(datum);\\r\\n try {\\r\\n List contained = general.getContainedNames(datum);\\r\\n if (sourceNames != null) contained.retainAll(sourceNames);\\r\\n String attribute = null;\\r\\n Object contents = null;\\r\\n List contentList = null;\\r\\n for (int i=0; i < contained.size(); i++) {\\r\\n attribute = (String) contained.get(i);\\r\\n contents = getContainedData(datum, attribute);\\r\\n if (contents instanceof List) {\\r\\n Iterator it = ((List) contents).iterator();\\r\\n while (it.hasNext()) {\\r\\n Object thisDatum = it.next();\\r\\n DefaultMutableTreeNode itsChild = new DefaultMutableTreeNode(thisDatum);\\r\\n itsRoot.add(itsChild);\\r\\n loadEmbeddedData(thisDatum, itsChild, null);\\r\\n }\\r\\n } else {\\r\\n DefaultMutableTreeNode itsChild = new DefaultMutableTreeNode(contents);\\r\\n itsRoot.add(itsChild);\\r\\n loadEmbeddedData(contents, itsChild, null);\\r\\n }\\r\\n }\\r\\n } catch (Exception e) {\\r\\n e.printStackTrace();\\r\\n }\\r\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36a1f93b52697e1142c287c806732432\",\n \"score\": \"0.4717149\",\n \"text\": \"Element getDocumentElement();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11e894052a47fc1af48bbafbb7fd0271\",\n \"score\": \"0.47063762\",\n \"text\": \"private static org.jdom2.Document useDOMParser(String fileName)\\n throws ParserConfigurationException, SAXException, IOException {\\n //creating DOM Document\\n DocumentBuilderFactory dbFactory = DocumentBuilderFactory.newInstance();\\n DocumentBuilder dBuilder;\\n dBuilder = dbFactory.newDocumentBuilder();\\n Document doc = dBuilder.parse(new File(fileName));\\n DOMBuilder domBuilder = new DOMBuilder();\\n return domBuilder.build(doc);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82b74bfcaac76160dffd5663df7f6b6d\",\n \"score\": \"0.47045943\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void documentChanged(DocumentEvent event) {\\n\\t\\t\\t\\tanalyseDocument(event.getDocument());\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98f452da7e348d9f179c538481a06b1f\",\n \"score\": \"0.46966076\",\n \"text\": \"public void begin_XMLtoEDD () {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d77be7289d0f247fa87346a834d9098a\",\n \"score\": \"0.4693228\",\n \"text\": \"public void endDocument() throws SAXException {\\r\\n // convert arraylist to array\\r\\n Tag[] tags = new Tag[tagList.size()];\\r\\n\\r\\n for (int i = 0; i < tagList.size(); i++) {\\r\\n tags[i] = tagList.get(i);\\r\\n }\\r\\n\\r\\n newTags = tags;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a959eba6dd96ed2d51147b2a9464ba2f\",\n \"score\": \"0.4678618\",\n \"text\": \"protected abstract void attachChildren();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"316461ce7527d7336f9ace09fb2638f4\",\n \"score\": \"0.46725342\",\n \"text\": \"public MediumXml(Document xmlDoc) {\\n super(xmlDoc);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c713208fcc6b445b72832161415982e2\",\n \"score\": \"0.46572247\",\n \"text\": \"private static Document buildNewDoc() throws ParserConfigurationException\\n\\t{\\n\\t\\tDocumentBuilderFactory factory = DocumentBuilderFactory.newInstance();\\n\\t\\tDocumentBuilder builder = factory.newDocumentBuilder();\\n\\t\\tDocument document = builder.newDocument();\\n\\t\\t\\n\\t\\treturn document;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be382dfbb1fba4c2cb4b4f2d54412f31\",\n \"score\": \"0.46494904\",\n \"text\": \"private static void init() {\\r\\n NodeList groups = document.getElementsByTagName(\\\"group\\\");\\r\\n for (int i = 0; i < groups.getLength(); i++) {\\r\\n Element group = (Element) groups.item(i);\\r\\n group.setIdAttribute(\\\"name\\\",true);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b20a8b40135b7875d76050f7cd4e131\",\n \"score\": \"0.4647031\",\n \"text\": \"public DocumentBase(ScriptManager manager) {\\r\\n this.manager = manager;\\r\\n errorLog = new ErrorLog(manager);\\r\\n listeners = new Vector();\\r\\n \\r\\n DOMImplementationImpl impl = new DOMImplementationImpl();\\r\\n DocumentType docType = impl.createDocumentType(\\\"TM4ML\\\",null,TMEV.getConfigurationFile(\\\"mev_script_dtd.dtd\\\").getAbsolutePath());\\r\\n \\r\\n document = impl.createDocument(null, \\\"TM4ML\\\", docType);\\r\\n \\r\\n root = document.getDocumentElement();\\r\\n root.setAttribute(\\\"version\\\", tm4ScriptVersion);\\r\\n \\r\\n mevElement = document.createElement(\\\"mev\\\");\\r\\n mevElement.setAttribute(\\\"version\\\", mevScriptVersion);\\r\\n root.appendChild(mevElement);\\r\\n \\r\\n analysisElement = document.createElement(\\\"analysis\\\");\\r\\n primaryDataElement = document.createElement(\\\"primary_data\\\");\\r\\n primaryDataElement.setAttribute(\\\"id\\\", \\\"1\\\");\\r\\n \\r\\n createAlgorithmSet(1); //default algoritm set\\r\\n \\r\\n //Element fileListElement = document.createElement(\\\"file_list\\\");\\r\\n //primaryDataElement.appendChild(fileListElement);\\r\\n \\r\\n mevElement.appendChild(primaryDataElement);\\r\\n mevElement.appendChild(analysisElement);\\r\\n \\r\\n scriptText = new String(\\\"\\\");\\r\\n updateScript();\\r\\n \\r\\n // Element rootElement = new Element(\\\"tm4\\\");\\r\\n // document = new Document(rootElement);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d8ce7c1f79630b14006bbcaba90e4dc9\",\n \"score\": \"0.4637505\",\n \"text\": \"private Document instanstiateXML() {\\r\\n\\t\\tidList.clear();\\r\\n\\t\\tDocument xmldocument = new Document();\\r\\n\\t\\tNamespace namespace = Namespace.getNamespace(IXmlElements.NAMESPACE);\\r\\n\\t\\tNamespace xsi = Namespace.getNamespace(\\\"xsi\\\", IXmlElements.XSI);\\r\\n\\r\\n\\t\\tElement parent = new Element(\\\"element_events\\\", namespace);\\r\\n\\r\\n\\t\\tparent.addNamespaceDeclaration(xsi);\\r\\n\\r\\n\\t\\tparent.setAttribute(\\\"schemaLocation\\\", IXmlElements.SCHEMA_LOCATION, xsi);\\r\\n\\r\\n\\t\\txmldocument.setRootElement(parent);\\r\\n\\r\\n\\t\\treturn xmldocument;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40211541add39863095a60027ed9a0b6\",\n \"score\": \"0.4631161\",\n \"text\": \"public static XMLBinSAXHandler initNewDocument() {\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tXMLBinSAXHandler documentHandler = new XMLBinSAXHandler();\\n\\t\\t\\t\\tDocumentBuilderFactory factory = DocumentBuilderFactory.newInstance();\\n\\t\\t\\t\\tdocumentHandler.document = factory.newDocumentBuilder().newDocument();\\n\\t\\t\\t\\tdocumentHandler.root = documentHandler.document.createElement(ROOT_ELEMENT);\\n\\t\\t\\t\\tdocumentHandler._nodeStk.push(documentHandler.root);\\n\\t\\t\\t\\tdocumentHandler.bPos = 0;\\n\\t\\t\\t\\treturn documentHandler;\\n\\t\\t\\t} catch (ParserConfigurationException e1) {\\n\\t\\t\\t\\treturn null;\\n\\t\\t\\t\\t// can't initialize\\n\\t\\t\\t}\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c89482e77de8ba962527f6dc839a310\",\n \"score\": \"0.46204367\",\n \"text\": \"public static EmailDocumentFragment getInstance(Document document) {\\n mDocument = document;\\n return new EmailDocumentFragment();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"90dcec1f400f644359be4f85fff57c64\",\n \"score\": \"0.46191147\",\n \"text\": \"void setRequestDocument(Document document) throws UnifyException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0cd610e9e9a631331a7a46f680ea2c5c\",\n \"score\": \"0.46098056\",\n \"text\": \"@Override\\r\\n\\tpublic void startDocument() throws SAXException {\\n\\t\\tSystem.out.println(\\\"début du document\\\");\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9504e7a192452008c56c746dfe81ac7\",\n \"score\": \"0.46066287\",\n \"text\": \"public void writeBack() {\\n try {\\n TransformerFactory tf = TransformerFactory.newInstance();\\n Transformer transformer = tf.newTransformer();\\n DOMSource source = new DOMSource(mDocument);\\n StreamResult result = new StreamResult(new File(mFileName));\\n transformer.transform(source, result);\\n } catch (TransformerException e) {\\n e.printStackTrace();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5564880d180feda5b58704ba14a12aad\",\n \"score\": \"0.4604493\",\n \"text\": \"public void addAll(DocumentSet set) ;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43d61a36ae2323c5565d10775d540048\",\n \"score\": \"0.45999715\",\n \"text\": \"public void startDocument();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"13623fbc756161f673416833f4e1c294\",\n \"score\": \"0.45954293\",\n \"text\": \"public void startDocument(final DDocument document) {\\r\\n\\t\\tif(!m_writerCtx.isRenderXmlDoc()){\\r\\n\\t\\t\\treturn;\\r\\n\\t\\t}\\r\\n\\t\\tm_writer.writeStartDocument(document.getXmlEncoding(), document.getXmlVersion());\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67ba1c528971ce26c508a9d1235ec0ff\",\n \"score\": \"0.45915604\",\n \"text\": \"Document build(InputSource in) throws JDOMException, IOException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ece51f9d48c8e5b5b3307b30080302a0\",\n \"score\": \"0.4587657\",\n \"text\": \"public void writeXML() {\\n TransformerFactory transformerFactory = TransformerFactory.newInstance();\\n Transformer transformer = null;\\n try {\\n transformer = transformerFactory.newTransformer();\\n } catch (TransformerConfigurationException e) {\\n e.printStackTrace();\\n }\\n DOMSource source = new DOMSource(docLocal);\\n StreamResult result = new StreamResult(new File(Default.XML_FILE_PATH));\\n try {\\n transformer.transform(source, result);\\n } catch (TransformerException e) {\\n e.printStackTrace();\\n }\\n //System.out.println(\\\"Done\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb1c0209845af3a14790cacb335e9c43\",\n \"score\": \"0.45771575\",\n \"text\": \"public Document toXML();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"173a4c5057f4ef0b806eef20eb27201f\",\n \"score\": \"0.45742843\",\n \"text\": \"public void setDocument(einbuergerung_Gruppe6.Document _document)\\n {\\n document = _document;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"813896597958a449ebcf565ef95b7c68\",\n \"score\": \"0.45679623\",\n \"text\": \"public static LSSVGContainer parseDocument(Document document) {\\n LSSVGContainer svg_e = null;\\n LSGenericContainer ancestorElement = null, newAncestorElement;\\n Node node = document.getDocumentElement();\\n Element e;\\n\\n while (node != null) {\\n newAncestorElement = null;\\n\\n if (node.getNodeType() == Node.ELEMENT_NODE) {\\n e = (Element) node;\\n\\n switch (e.getTagName()) {\\n case \\\"svg\\\":\\n LSLength width = null;\\n LSLength height = null;\\n Attr widthAttr = e.getAttributeNodeNS(null, \\\"width\\\");\\n\\n if (widthAttr != null) {\\n width = LSLength.parse(widthAttr.getValue());\\n }\\n\\n Attr heightAttr = e.getAttributeNodeNS(null, \\\"height\\\");\\n\\n if (heightAttr != null) {\\n height = LSLength.parse(heightAttr.getValue());\\n }\\n\\n if ((width == null) || (height == null)) {\\n break;\\n }\\n\\n svg_e = new LSSVGContainer(width, height);\\n ancestorElement = svg_e;\\n\\n break;\\n\\n case \\\"g\\\":\\n LSGroupContainer g_e = LSGroupContainer.parseElement(e);\\n\\n if (ancestorElement != null) {\\n ancestorElement.addDescendant(g_e);\\n } else {\\n LSEditor.logger.warning(\\\"Null pointer dereferencing while parsing group ancestor element\\\\n\\\");\\n }\\n\\n newAncestorElement = g_e;\\n\\n break;\\n\\n case \\\"rect\\\":\\n if (ancestorElement != null) {\\n ancestorElement.addDescendant(LSShapeRect.parseElement(e));\\n } else {\\n LSEditor.logger.warning(\\n \\\"Null pointer dereferencing while parsing rectangle ancestor element\\\\n\\\");\\n }\\n\\n break;\\n\\n case \\\"circle\\\":\\n if (ancestorElement != null) {\\n ancestorElement.addDescendant(LSShapeCircle.parseElement(e));\\n } else {\\n LSEditor.logger.warning(\\\"Null pointer dereferencing while parsing circle ancestor element\\\\n\\\");\\n }\\n\\n break;\\n\\n case \\\"line\\\":\\n if (ancestorElement != null) {\\n ancestorElement.addDescendant(LSShapeLine.parseElement(e));\\n } else {\\n LSEditor.logger.warning(\\\"Null pointer dereferencing while parsing line ancestor element\\\\n\\\");\\n }\\n\\n break;\\n }\\n }\\n\\n if (node.hasChildNodes()) {\\n node = node.getFirstChild();\\n\\n if (newAncestorElement != null) {\\n ancestorElement = newAncestorElement;\\n }\\n } else if (node.getNextSibling() != null) {\\n node = node.getNextSibling();\\n } else {\\n node = node.getParentNode().getNextSibling();\\n\\n if (ancestorElement != null) {\\n if (ancestorElement.getAncestorElement() != null) {\\n ancestorElement = ancestorElement.getAncestorElement();\\n }\\n } else {\\n LSEditor.logger.warning(\\\"Null pointer dereferencing.\\\\n\\\");\\n }\\n }\\n }\\n\\n return svg_e;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe722c439db34285d821ca39c99b2657\",\n \"score\": \"0.4567737\",\n \"text\": \"public VerDetalleSolicitudHTML(VerDetalleSolicitudHTML src) {\\n/* 101 */ this.fDocumentLoader = src.getDocumentLoader();\\n/* */ \\n/* 103 */ setDocument((Document)src.getDocument().cloneNode(true), src.getMIMEType(), src.getEncoding());\\n/* */ \\n/* 105 */ syncAccessMethods();\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cacd38e9d301ea228b4b507b8bb45602\",\n \"score\": \"0.45624456\",\n \"text\": \"protected abstract D insert(D document);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28479f495e2fd8751650b1f65a64e2f3\",\n \"score\": \"0.45586082\",\n \"text\": \"@Override\\n public void attach() {\\n super.attach();\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985492,"cells":{"query_id":{"kind":"string","value":"d7a00cfd8f817833598980a444bef264"},"query":{"kind":"string","value":"Median key. If the tree has N keys k1 < k2 < k3 < ... < kN, then their median key is the element at position (N+1)/2 Asymptotic runtime: Theta(h), where h is the height of the tree Justification: When the median function is called, it makes a call to the method rank, which gets the rank of the highest value node in the tree of a given root. This method calls the size function, which gets the total number of nodes in the subtree. Because this function searches through every node, it ultimately reaches the height of the tree, which is the deepest chain of nodes. In a balanced tree, a runtime of Theta(h) is reached in the while loop for finding the node of the highest value, as all the bottom nodes in the tree share the same height."},"positive_passages":{"kind":"list like","value":[{"docid":"6a646222780aea17e32693c0aac17182","score":"0.80092627","text":"public Key median() {\n\t\tif (isEmpty())\n\t\t\treturn null;\n\t\tNode currentNode = root;\n\t\twhile (currentNode.right != null)\n\t\t\tcurrentNode = currentNode.right;\n\n\t\tint rankOfLargestKey = rank(currentNode.key);\n\t\tint medianRank = (rankOfLargestKey + 1) / 2;\n\t\treturn select(medianRank);\n\t}","title":""}],"string":"[\n {\n \"docid\": \"6a646222780aea17e32693c0aac17182\",\n \"score\": \"0.80092627\",\n \"text\": \"public Key median() {\\n\\t\\tif (isEmpty())\\n\\t\\t\\treturn null;\\n\\t\\tNode currentNode = root;\\n\\t\\twhile (currentNode.right != null)\\n\\t\\t\\tcurrentNode = currentNode.right;\\n\\n\\t\\tint rankOfLargestKey = rank(currentNode.key);\\n\\t\\tint medianRank = (rankOfLargestKey + 1) / 2;\\n\\t\\treturn select(medianRank);\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"7abdc57d616b6efc97d2826096810a49","score":"0.7222322","text":"public int recursiveMedian() {\n \n // list generation can create an empty list, this handles it\n if(n < 1) {\n return -1;\n }\n \n // index of the expected median\n int idxMedian = n % 2 == 1 ? n/2 : (n-1)/2;\n \n // run kthSmallestElement, initial lower and upper bounds at full length\n return kthSmallestElement(0, n-1, idxMedian);\n }","title":""},{"docid":"a9104d55626c695ab012edf14625d826","score":"0.6510643","text":"public double median();","title":""},{"docid":"53e4fa15e10257b1ff2ef5505522c3f8","score":"0.62966704","text":"public static int findKthSmallest(int[] nums, int k) {\n if(nums==null||nums.length==0) return 0;\n int left=0;\n int right=nums.length - 1;\n while(true){\n //the partion function will return the position of nums[left]\n int pos=partition(nums,left,right);\n if(pos+1==k){\n //if the position of nums[left] equals to the mid position, we find the median\n return nums[pos];\n }else if(pos+1>k){\n //if the position of nums[left] is larger than mid position, it means median is on the left side\n right=pos-1;\n }else{\n //if the position of nums[left] is smaller than mid position, it means median is on the right side\n //so we update the left\n left=pos+1;\n }\n }\n }","title":""},{"docid":"82e06da8855dce557426de6d99145134","score":"0.62745255","text":"public int sortedMedian() {\n if(n < 1) {\n return -1;\n }\n \n int idxMedian = n % 2 == 1 ? n/2 : (n-1)/2;\n \n for(int i = n-1; i > 0; i--) {\n \n for(int j = 0; j < i; j++) {\n \n if(a[j] > a[j+1]) {\n int temp = a[j];\n a[j] = a[j+1];\n a[j+1] = temp;\n }\n }\n }\n return a[idxMedian];\n \n }","title":""},{"docid":"dad5a5ab37fde1eb983bcc42cf52e5e9","score":"0.621306","text":"private void split(Node<T> nodeToSplit) {\r\n Node<T> node = nodeToSplit;\r\n int numberOfKeys = node.numberOfKeys();\r\n int medianIndex = numberOfKeys / 2;\r\n T medianValue = node.getKey(medianIndex);\r\n\r\n Node<T> left = new Node<T>(null, maxKeySize, maxChildrenSize);\r\n for (int i = 0; i < medianIndex; i++) {\r\n left.addKey(node.getKey(i));\r\n }\r\n if (node.numberOfChildren() > 0) {\r\n for (int j = 0; j <= medianIndex; j++) {\r\n Node<T> c = node.getChild(j);\r\n left.addChild(c);\r\n }\r\n }\r\n\r\n Node<T> right = new Node<T>(null, maxKeySize, maxChildrenSize);\r\n for (int i = medianIndex + 1; i < numberOfKeys; i++) {\r\n right.addKey(node.getKey(i));\r\n }\r\n if (node.numberOfChildren() > 0) {\r\n for (int j = medianIndex + 1; j < node.numberOfChildren(); j++) {\r\n Node<T> c = node.getChild(j);\r\n right.addChild(c);\r\n }\r\n }\r\n\r\n if (node.parent == null) {\r\n // new root, height of tree is increased\r\n Node<T> newRoot = new Node<T>(null, maxKeySize, maxChildrenSize);\r\n newRoot.addKey(medianValue);\r\n node.parent = newRoot;\r\n root = newRoot;\r\n node = root;\r\n node.addChild(left);\r\n node.addChild(right);\r\n } else {\r\n // Move the median value up to the parent\r\n Node<T> parent = node.parent;\r\n parent.addKey(medianValue);\r\n parent.removeChild(node);\r\n parent.addChild(left);\r\n parent.addChild(right);\r\n\r\n if (parent.numberOfKeys() > maxKeySize) split(parent);\r\n }\r\n }","title":""},{"docid":"7c43e2ce4c581a3b15378d5b94c82da0","score":"0.6162858","text":"public double find(BinaryNode<Integer> root)\n\t{\n\t\tif (root == null)\n\t\t{\n\t\t\tthrow new IllegalArgumentException(\"You can't pass a null binary tree to this method.\");\n\t\t}\n\n\t\tList<BinaryNode<Integer>> sortedElements = binaryTreeInOrder.getIterative(root);\n\t\tdouble median = 0;\n\t\tif (sortedElements.size() % 2 == 0)\n\t\t{\n\t\t\tmedian = (sortedElements.get(sortedElements.size() / 2).getData() + sortedElements.get(\n\t\t\t\tsortedElements.size() / 2 - 1).getData()) / 2;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tmedian = sortedElements.get(sortedElements.size() / 2).getData();\n\t\t}\n\t\treturn median;\n\t}","title":""},{"docid":"3a50e43ec73015337408ec49058eba89","score":"0.61208403","text":"protected void rankMedianPosition(int rankValue,\n\t\t\tJGraphHierarchyModel model, int nextRankValue) {\n\t\tJGraphHierarchyRank rankSet = (JGraphHierarchyRank) model.ranks\n\t\t\t\t.get(new Integer(rankValue));\n\t\tObject[] rank = rankSet.toArray();\n\t\t// Form an array of the order in which the cell are to be processed\n\t\t// , the order is given by the weighted sum of the in or out edges,\n\t\t// depending on whether we're travelling up or down the hierarchy.\n\t\tWeightedCellSorter[] weightedValues = new WeightedCellSorter[rank.length];\n\t\tMap cellMap = new Hashtable(rank.length);\n\n\t\tfor (int i = 0; i < rank.length; i++) {\n\t\t\tJGraphAbstractHierarchyCell currentCell = (JGraphAbstractHierarchyCell) rank[i];\n\t\t\tweightedValues[i] = new WeightedCellSorter();\n\t\t\tweightedValues[i].cell = currentCell;\n\t\t\tweightedValues[i].rankIndex = i;\n\t\t\tcellMap.put(currentCell, weightedValues[i]);\n\t\t\tCollection nextLayerConnectedCells = null;\n\t\t\tif (nextRankValue < rankValue) {\n\t\t\t\tnextLayerConnectedCells = currentCell\n\t\t\t\t\t\t.getPreviousLayerConnectedCells(rankValue);\n\t\t\t} else {\n\t\t\t\tnextLayerConnectedCells = currentCell\n\t\t\t\t\t\t.getNextLayerConnectedCells(rankValue);\n\t\t\t}\n\n\t\t\t// Calcuate the weighing based on this node type and those this\n\t\t\t// node is connected to on the next layer\n\t\t\tweightedValues[i].weightedValue = calculatedWeightedValue(\n\t\t\t\t\tcurrentCell, nextLayerConnectedCells);\n\t\t}\n\n\t\tArrays.sort(weightedValues);\n\t\t// Set the new position of each node within the rank using\n\t\t// its temp variable\n\t\tfor (int i = 0; i < weightedValues.length; i++) {\n\t\t\tint numConnectionsNextLevel = 0;\n\t\t\tJGraphAbstractHierarchyCell cell = weightedValues[i].cell;\n\t\t\tObject[] nextLayerConnectedCells = null;\n\t\t\tint medianNextLevel = 0;\n\n\t\t\tif (nextRankValue < rankValue) {\n\t\t\t\tnextLayerConnectedCells = cell.getPreviousLayerConnectedCells(\n\t\t\t\t\t\trankValue).toArray();\n\t\t\t} else {\n\t\t\t\tnextLayerConnectedCells = cell.getNextLayerConnectedCells(\n\t\t\t\t\t\trankValue).toArray();\n\t\t\t}\n\n\t\t\tif (nextLayerConnectedCells != null) {\n\t\t\t\tnumConnectionsNextLevel = nextLayerConnectedCells.length;\n\t\t\t\tif (numConnectionsNextLevel > 0) {\n\t\t\t\t\tmedianNextLevel = medianXValue(nextLayerConnectedCells,\n\t\t\t\t\t\t\tnextRankValue);\n\t\t\t\t} else {\n\t\t\t\t\t// For case of no connections on the next level set the\n\t\t\t\t\t// median to be the current position and try to be\n\t\t\t\t\t// positioned there\n\t\t\t\t\tmedianNextLevel = cell.getGeneralPurposeVariable(rankValue);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tdouble leftBuffer = 0.0;\n\t\t\tdouble leftLimit = -100000000.0;\n\t\t\tfor (int j = weightedValues[i].rankIndex - 1; j >= 0;) {\n\t\t\t\tWeightedCellSorter weightedValue = (WeightedCellSorter) cellMap\n\t\t\t\t\t\t.get(rank[j]);\n\t\t\t\tif (weightedValue != null) {\n\t\t\t\t\tJGraphAbstractHierarchyCell leftCell = weightedValue.cell;\n\t\t\t\t\tif (weightedValue.visited) {\n\t\t\t\t\t\t// The left limit is the right hand limit of that\n\t\t\t\t\t\t// cell\n\t\t\t\t\t\t// plus any allowance for unallocated cells\n\t\t\t\t\t\t// in-between\n\t\t\t\t\t\tleftLimit = leftCell\n\t\t\t\t\t\t\t\t.getGeneralPurposeVariable(rankValue)\n\t\t\t\t\t\t\t\t+ leftCell.width\n\t\t\t\t\t\t\t\t/ 2.0\n\t\t\t\t\t\t\t\t+ intraCellSpacing\n\t\t\t\t\t\t\t\t+ leftBuffer + cell.width / 2.0;\n\t\t\t\t\t\t;\n\t\t\t\t\t\tj = -1;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tleftBuffer += leftCell.width + intraCellSpacing;\n\t\t\t\t\t\tj--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tdouble rightBuffer = 0.0;\n\t\t\tdouble rightLimit = 100000000.0;\n\t\t\tfor (int j = weightedValues[i].rankIndex + 1; j < weightedValues.length;) {\n\t\t\t\tWeightedCellSorter weightedValue = (WeightedCellSorter) cellMap\n\t\t\t\t\t\t.get(rank[j]);\n\t\t\t\tif (weightedValue != null) {\n\t\t\t\t\tJGraphAbstractHierarchyCell rightCell = weightedValue.cell;\n\t\t\t\t\tif (weightedValue.visited) {\n\t\t\t\t\t\t// The left limit is the right hand limit of that\n\t\t\t\t\t\t// cell\n\t\t\t\t\t\t// plus any allowance for unallocated cells\n\t\t\t\t\t\t// in-between\n\t\t\t\t\t\trightLimit = rightCell\n\t\t\t\t\t\t\t\t.getGeneralPurposeVariable(rankValue)\n\t\t\t\t\t\t\t\t- rightCell.width\n\t\t\t\t\t\t\t\t/ 2.0\n\t\t\t\t\t\t\t\t- intraCellSpacing\n\t\t\t\t\t\t\t\t- rightBuffer - cell.width / 2.0;\n\t\t\t\t\t\tj = weightedValues.length;\n\t\t\t\t\t} else {\n\t\t\t\t\t\trightBuffer += rightCell.width + intraCellSpacing;\n\t\t\t\t\t\tj++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (medianNextLevel >= leftLimit && medianNextLevel <= rightLimit) {\n\t\t\t\tcell\n\t\t\t\t\t\t.setGeneralPurposeVariable(rankValue,\n\t\t\t\t\t\t\t\t(int) medianNextLevel);\n\t\t\t} else if (medianNextLevel < leftLimit) {\n\t\t\t\t// Couldn't place at median value, place as close to that\n\t\t\t\t// value as possible\n\t\t\t\tcell.setGeneralPurposeVariable(rankValue, (int) leftLimit);\n\t\t\t\tcurrentXDelta += leftLimit - medianNextLevel;\n\t\t\t} else if (medianNextLevel > rightLimit) {\n\t\t\t\t// Couldn't place at median value, place as close to that\n\t\t\t\t// value as possible\n\t\t\t\tcell.setGeneralPurposeVariable(rankValue, (int) rightLimit);\n\t\t\t\tcurrentXDelta += medianNextLevel - rightLimit;\n\t\t\t}\n\n\t\t\tweightedValues[i].visited = true;\n\t\t}\n\t}","title":""},{"docid":"81315ae8864173b7224fef9be301b2d1","score":"0.61152875","text":"public int findMedian() {\n\t\tfindIthSmallest(0, getSet().length - 1, getSet().length / 2);\r\n\t\t\r\n\t\treturn getSet()[getSet().length / 2]; // Returning median.\r\n\t}","title":""},{"docid":"44a71c40cbb89051f3f9539c9068de46","score":"0.6015051","text":"@Override\n public double quickMedian() {\n return getStatistics().getMedian();\n }","title":""},{"docid":"5e36e06c73506237b392aa6bb49203ce","score":"0.59067804","text":"public double findMedian() {\n if (maxHeap.size() == minHeap.size())\n return (maxHeap.peek() + minHeap.peek()) / 2.0;\n else\n return maxHeap.peek();\n }","title":""},{"docid":"2c13271f5ce016904de6efd58ee628d4","score":"0.5894015","text":"public double findMedian() {\n\t\tif (maxHeap.size() == minHeap.size())\n\t\t\treturn (maxHeap.peek() + minHeap.peek()) / 2.0;\n\t\telse\n\t\t\treturn maxHeap.peek();\n\t}","title":""},{"docid":"4808acebc42f27024c7a4418f6cb9854","score":"0.589123","text":"public double findMedian() {\n return median;\n }","title":""},{"docid":"4808acebc42f27024c7a4418f6cb9854","score":"0.589123","text":"public double findMedian() {\n return median;\n }","title":""},{"docid":"4d15d621d555a94822564fcd14e59388","score":"0.5856021","text":"public double[] medianSlidingWindow(int[] nums, int k) {\n PriorityQueue<Integer> leftHeap = new PriorityQueue<Integer>(Collections.<Integer>reverseOrder());\n PriorityQueue<Integer> rightHeap = new PriorityQueue<Integer>();\n double[] result = new double[nums.length-k+1];\n int resultIdx = 0;\n for(int i = 0; i < nums.length; i++) {\n if(i >= k) {\n // calculate median\n if (leftHeap.contains(nums[i-k])) {\n leftHeap.remove(nums[i-k]);\n } else if (rightHeap.contains(nums[i-k])) {\n rightHeap.remove(nums[i-k]);\n }\n }\n if (leftHeap.size() <= rightHeap.size()) {\n if (rightHeap.isEmpty() || nums[i] <= rightHeap.peek()) {\n leftHeap.add(nums[i]);\n } else {\n leftHeap.add(rightHeap.peek());\n int tmp = rightHeap.peek();\n rightHeap.remove(tmp);\n rightHeap.add(nums[i]);\n }\n } else {\n if (nums[i] > leftHeap.peek()) {\n rightHeap.add(nums[i]);\n } else {\n int tmp = leftHeap.peek();\n rightHeap.add(tmp);\n leftHeap.remove(tmp);\n leftHeap.add(nums[i]);\n }\n }\n if (i >= (k-1)) {\n if (k % 2 == 1) {\n result[resultIdx] = leftHeap.peek();\n } else {\n result[resultIdx] = ((double)(leftHeap.peek()) + (double)(rightHeap.peek()))/2.0;\n }\n resultIdx++;\n }\n }\n return result;\n }","title":""},{"docid":"e702c91c6490cf1148feacf02d4c5862","score":"0.5823711","text":"public double findMedian() {\n return larger.size()>smaller.size()?larger.peek():(larger.peek()-smaller.peek())/2.0;\n }","title":""},{"docid":"d74878c6a946ba6490d2a016f8a23cc5","score":"0.57573587","text":"public int median() {\n if (lower.size() >= upper.size()) {\n return lower.max();\n } else {\n return upper.min();\n }\n }","title":""},{"docid":"cfd1d40c49c10ead9610868e69ac406b","score":"0.5751298","text":"public double findMedian() {\n if ((minH.size()==0)&&(maxH.size()==0)) return 0.0;\n if ((minH.size())>(maxH.size())) return (double)(minH.peek());\n if ((minH.size())<(maxH.size())) return (double)(maxH.peek());\n return ((double)(maxH.peek()+minH.peek()))/2.0;\n }","title":""},{"docid":"3545f429291e8542c6ec95b781a54339","score":"0.57509804","text":"private int median3(Integer[] a, int i, int j, int k) {\n return (less(a[i], a[j]) ?\n (less(a[j], a[k]) ? j : less(a[i], a[k]) ? k : i) :\n (less(a[k], a[j]) ? j : less(a[k], a[i]) ? k : i));\n }","title":""},{"docid":"2d23bfb5409452106c56f8f98c2b7189","score":"0.5738596","text":"public int median()//modify\r\n\t{\r\n\t\tint median = 0 ;\r\n\t\tint midIndex = 0;\r\n\t\t\r\n\t\tif (count == 0)\r\n\t\t\tmedian = -1;\r\n\t\t\r\n\t\telse \r\n\t\t{\r\n\t\t\tif (count % 2 == 0)\r\n\t\t\t{\r\n\t\t\t\tmidIndex = count / 2;\r\n\t\t\t\tmedian = (numArray[midIndex - 1] + numArray [midIndex]) / 2;\r\n\t\t\t\t\r\n\t\t\t\tif (debug)\r\n\t\t\t\t{\r\n\t\t\t\t\tSystem.out.print(\"\\n midIndex = \" + midIndex);\r\n\t\t\t\t\tSystem.out.print(\"\\n middle numbers are => \" + numArray[midIndex - 1] + \" and \" + numArray[midIndex] );\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tmidIndex = (count + 1) / 2;\r\n\t\t\t\t\r\n\t\t\t\tif (debug)\r\n\t\t\t\t\tSystem.out.print(\"\\n midIndex = \" + midIndex);\r\n\t\t\t\t\r\n\t\t\t\tmedian = numArray[midIndex - 1] ;\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn median ;\r\n\t}","title":""},{"docid":"4c896579724848d77ba837612cc32bb3","score":"0.57339317","text":"public int kthSmallest(TreeNode root, int k) {\r\n\r\n }","title":""},{"docid":"0a162b9f0249d043252ebd0ce2615bf6","score":"0.5698768","text":"public void insert(int newKey) {\n\n int t = c.length / 2;\n int i = n - 1;\n if (isLeaf) {\n while ((i >= 0) && (newKey < key[i])) { // Shift key greater than newKey to left\n key[i + 1] = key[i];\n i--;\n }\n n++; // Update number of keys in node\n key[i + 1] = newKey; // Insert new key\n } else {\n while ((i >= 0) && (newKey < key[i])) {\n i--;\n }\n int insertChild = i + 1; // Subtree where new key must be inserted\n if (c[insertChild].isFull()) {\n // The root of the subtree where new key will be inserted has to be split\n // We promote the median of that root to the current node and\n // update keys and references accordingly\n\n // Debugging code\n // System.out.println(\"This is the full node we're going to break \");\n // c[insertChild].printNodes();\n // System.out.println(\"going to promote \" + c[insertChild].key[T-1]);\n n++;\n c[n] = c[n - 1];\n for (int j = n - 1; j > insertChild; j--) {\n c[j] = c[j - 1];\n key[j] = key[j - 1];\n }\n key[insertChild] = c[insertChild].key[t - 1];\n c[insertChild].n = t - 1;\n\n BTreeNode newNode = new BTreeNode(t);\n for (int k = 0; k < t - 1; k++) {\n newNode.c[k] = c[insertChild].c[k + t];\n newNode.key[k] = c[insertChild].key[k + t];\n }\n\n newNode.c[t - 1] = c[insertChild].c[2 * t - 1];\n newNode.n = t - 1;\n newNode.isLeaf = c[insertChild].isLeaf;\n c[insertChild + 1] = newNode;\n\n if (newKey < key[insertChild]) {\n c[insertChild].insert(newKey);\n } else {\n c[insertChild + 1].insert(newKey);\n }\n } else\n c[insertChild].insert(newKey); //No need to split node\n }\n }","title":""},{"docid":"b22c5db745d69963f158fc589a708441","score":"0.56924665","text":"public double findMedian() {\n if (higher.size() == lower.size()) {\n return (double) (higher.peek() + lower.peek()) / 2;\n } else {\n return higher.peek();\n }\n }","title":""},{"docid":"68f08eda6f96b587f897add5a8dd1fec","score":"0.5677778","text":"public int findMedianWithMOT() {\n\t\tfindIthSmallestWithMOT(0, getSet().length - 1, getSet().length / 2); \r\n\t\t\r\n\t\treturn getSet()[0]; // Returning median.\r\n\t}","title":""},{"docid":"8749c348e663429e3f5b9a4890ec8a79","score":"0.5677554","text":"private static int median5(double[] a, int i, int j, int k, int l, int m) {\n Map<Comparable, Integer> map = new HashMap<>();\n map.put(a[i], i);\n map.put(a[j], j);\n map.put(a[k], k);\n map.put(a[l], l);\n map.put(a[m], m);\n\n Comparable[] median = new Comparable[5];\n median[0] = a[i];\n median[1] = a[j];\n median[2] = a[k];\n median[3] = a[l];\n median[4] = a[m];\n\n MergeSort.sortTD(median);\n\n return map.get(median[2]);\n }","title":""},{"docid":"de197c3026cb879293ab9b60fddd7b54","score":"0.56737316","text":"public static double computeMedian(int num) {\n\t\t// adding the number to proper heap\n\t\tif (num >= upperQueue.peek())\n\t\t\tupperQueue.add(num);\n\t\telse\n\t\t\tlowerQueue.add(num);\n\t\t// balancing the heaps\n\t\tif (upperQueue.size() - lowerQueue.size() == 2)\n\t\t\tlowerQueue.add(upperQueue.poll());\n\t\telse if (lowerQueue.size() - upperQueue.size() == 2)\n\t\t\tupperQueue.add(lowerQueue.poll());\n\t\t// returning the median\n\t\tif (upperQueue.size() == lowerQueue.size())\n\t\t\treturn (upperQueue.peek() + lowerQueue.peek()) / 2.0;\n\t\telse if (upperQueue.size() > lowerQueue.size())\n\t\t\treturn upperQueue.peek();\n\t\telse\n\t\t\treturn lowerQueue.peek();\n\t}","title":""},{"docid":"d97ec33bbea464f400049dfeb592826e","score":"0.5669304","text":"private static long getMedian(SortedSet<Long> set) {\n int i = 0;\n int middle = set.size() / 2;\n for (Long point : set) {\n if (i == middle) {\n return point;\n }\n i++;\n }\n throw new IllegalArgumentException(\"Cannot calculate median of empty set.\");\n }","title":""},{"docid":"eda0c98d1ac7b9c148eb0bf5df88a9d0","score":"0.5654989","text":"public int kthSmallest(TreeNode root, int k) {\n //inorder traversal and count k\n int count = 0;\n\n Stack<TreeNode> stack = new Stack<>();\n TreeNode next = root;\n while (next != null || !stack.empty()) {\n if (next != null) {\n stack.push(next);\n next = next.left;\n } else {\n TreeNode node = stack.pop();\n if (++count == k)\n return node.val;\n next = node.right;\n }\n\n }\n\n\n return -1;\n }","title":""},{"docid":"1887962ea34d1beb72d30048a106b998","score":"0.5646821","text":"public int rank(Key key)\r\n {\r\n int lo = 0;\r\n int hi = n - 1;\r\n while(lo <= hi)\r\n {\r\n int mid = lo + (hi - lo)/2;\r\n int compare = key.compareTo(keys[mid]);\r\n if(compare < 0)\r\n hi = mid - 1;\r\n else if(compare > 0)\r\n lo = mid + 1;\r\n else\r\n return mid;\r\n }\r\n return lo;\r\n }","title":""},{"docid":"0d3113c9771f334a7535f2c5c236dda6","score":"0.56409186","text":"public double findMedian() {\n if (leftMax.size() == rightMin.size()) return (leftMax.peek() + rightMin.peek()) / 2.0;\n return leftMax.peek();\n }","title":""},{"docid":"f51ea3487db74ae21a3e4623f81e1948","score":"0.5620451","text":"public double findMedian() {\n if (isEven) {\n return (large.peek() + small.peek()) / 2.0; //2.0 as we need to return a double\n } else {\n return large.peek();\n }\n }","title":""},{"docid":"bb0bd252772a5c8c31de108186044e2a","score":"0.5576507","text":"public int[] medianII(int[] nums) {\n\n TreeMap<Integer, Integer> minHeap = new TreeMap<>();\n TreeMap<Integer, Integer> maxHeap = new TreeMap<>(Collections.reverseOrder());\n int minSize = 0, maxSize = 0 ;\n int[] res = new int[nums.length];\n int index = 0;\n for(Integer cur:nums){\n int minHeapTop = minHeap.firstEntry()==null? Integer.MIN_VALUE: minHeap.firstKey();\n int maxHeapTop = maxHeap.firstEntry()==null? Integer.MAX_VALUE: maxHeap.firstKey();\n\n if(cur<=maxHeapTop){\n if(maxHeap.containsKey(cur)){\n maxHeap.put(cur,maxHeap.get(cur)+1);\n }else{\n maxHeap.put(cur,1);\n }\n maxSize++;\n }else{\n if(minHeap.containsKey(cur)){\n minHeap.put(cur,minHeap.get(cur)+1);\n }else{\n minHeap.put(cur,1);\n }\n minSize++;\n\n }\n\n if(maxSize-1>minSize){\n heapTransfer(maxHeap,minHeap);\n maxSize--;\n minSize++;\n }else if(minSize-1>maxSize){\n heapTransfer(minHeap,maxHeap);\n minSize--;\n maxSize++;\n }\n if(maxSize == minSize){\n res[index++] = maxHeap.firstKey();\n }else{\n if(minSize == 0){\n res[index++] = maxHeap.firstKey();\n }else{\n res[index++] = minSize>maxSize? minHeap.firstKey():maxHeap.firstKey();\n }\n }\n }\n return res;\n }","title":""},{"docid":"015d65f3181c9a8dace20730ce7702ed","score":"0.5574935","text":"public double findMedian() {\n return large.size() > small.size() ? large.peek() :\n large.size() < small.size() ? small.peek() :\n (large.peek() + small.peek()) / 2.0;\n }","title":""},{"docid":"feff4cdfb7875ef5be8ce186fc1266a4","score":"0.5533382","text":"private static int median3(double[] a, int i, int j, int k) {\n return (less(a[i], a[j]) ?\n (less(a[j], a[k]) ? j : less(a[i], a[k]) ? k : i) :\n (less(a[k], a[j]) ? j : less(a[k], a[i]) ? k : i));\n }","title":""},{"docid":"07dee846dda79d1b79b4eacadf827703","score":"0.55212235","text":"public int kthSmallestElement(int lower, int upper, int k) {\n \n // index of the lower partition value\n int idxPartition = partition(lower, upper);\n \n // indicated that the partition/pivot is the median index\n if(idxPartition == k) {\n \n // returns the median value\n return a[idxPartition];\n \n // indicated that the lower half contains the median index\n } else if(idxPartition > k) {\n \n // runs with the new upper bound set to the previous pivot\n return kthSmallestElement(0, idxPartition-1, k);\n \n // indicates that the upper half contains the median index\n } else {\n \n // runs with the new lower bound\n return kthSmallestElement(idxPartition+1, n-1, k);\n }\n }","title":""},{"docid":"f6315284af3a29dd951d1351d751734e","score":"0.5517278","text":"public MedianFinder() {\n this.left_heap = new PriorityQueue<>(new Comparator<Integer>() {\n @Override\n public int compare(Integer o1, Integer o2) {\n return o2 - o1;\n }\n });\n this.right_heap = new PriorityQueue<>();\n }","title":""},{"docid":"69b21b48b4b0445002fd51eb683762a2","score":"0.5503339","text":"private static Integer median(List<Integer> elements) {\n sortOnIndex(elements, 0, 1);\n // makes c<d\n sortOnIndex(elements, 2, 4);\n\n // eliminate the lowest -- comparing c<a\n if (elements.get(2) < elements.get(0)) {\n // swapping b and d\n swapOnIndex(elements, 1, 4);\n // making c = a\n elements.set(2, elements.get(0));\n }\n\n // getting in e now\n elements.set(0, elements.get(4));\n\n //making a<b\n sortOnIndex(elements, 0, 1);\n\n // eliminate another lowest -- comparing a<c\n // remaining a, b, d\n if (elements.get(0) < elements.get(2)) {\n // swapping b and d\n swapOnIndex(elements, 1, 4);\n // making a = c\n elements.set(0, elements.get(2));\n }\n\n // comparing d and a\n if (elements.get(3) < elements.get(0)) {\n // returning d\n return elements.get(3);\n }\n\n // returning a\n return elements.get(0);\n }","title":""},{"docid":"d4ac40a56418571662dcda7a9e2727c3","score":"0.54979146","text":"private static void findMedianForFile(String filename)\n {\n\n }","title":""},{"docid":"67c265f4e2d227cc55dc49c73cd3db8c","score":"0.5497274","text":"public double findMedian() {\n\t if (max.size() == min.size()) return (max.peek() + min.peek()) / 2.0;\n\t else return max.peek();\n\t }","title":""},{"docid":"e29689ecfccd13b8fb7af17e42f48d99","score":"0.54950297","text":"private static int median3(double[] a, int i, int j, int k) {\n return (less(a[i], a[j]) ?\n (less(a[j], a[k]) ? j : less(a[i], a[k]) ? k : i) :\n (less(a[k], a[j]) ? j : less(a[k], a[i]) ? k : i));\n }","title":""},{"docid":"4a2fb1b4a9576e6976be8689fc1f428f","score":"0.54650426","text":"private int medianXValue(Object[] connectedCells, int rankValue) {\n\t\tif (connectedCells.length == 0) {\n\t\t\treturn 0;\n\t\t}\n\t\tint[] medianValues = new int[connectedCells.length];\n\t\tfor (int i = 0; i < connectedCells.length; i++) {\n\t\t\tmedianValues[i] = ((JGraphAbstractHierarchyCell) connectedCells[i])\n\t\t\t\t\t.getGeneralPurposeVariable(rankValue);\n\t\t}\n\t\tArrays.sort(medianValues);\n\t\tif (connectedCells.length % 2 == 1) {\n\t\t\t// For odd numbers of adjacent vertices return the median\n\t\t\treturn medianValues[connectedCells.length / 2];\n\t\t} else {\n\t\t\tint medianPoint = connectedCells.length / 2;\n\t\t\tint leftMedian = medianValues[medianPoint - 1];\n\t\t\tint rightMedian = medianValues[medianPoint];\n\t\t\treturn ((leftMedian + rightMedian) / 2);\n\t\t}\n\t}","title":""},{"docid":"e9e61e358b8db45a15968eeaf69cf7ca","score":"0.5461258","text":"static void findMedian(String a[],int x[], int count) {\r\n \t//List<Integer> medianList = new ArrayList<Integer>();\r\n \tint removeCount = 0;\r\n \tint addCount = 0;\r\n \t\r\n \tfor(int i=0;i<count;i++) {\r\n \t\tif (a[i].equals(\"a\")) {\r\n \t\t\tMedian.Insert(x[i]);;\r\n \t\t\taddCount = Median.getListSize();\r\n \t\t\tif (addCount == 1) {\r\n \t\t\t\tSystem.out.println(Median.getNodeInfo(addCount-1));\r\n \t\t\t} else if (addCount > 1) {\r\n \t\t\t\treturnMedianValue(addCount);\r\n \t\t\t\t//System.out.println(addMedian);\r\n \t\t\t}\r\n \t\t} else {\r\n \t\t\tif (Median.isInfopresent(x[i])) {\r\n \t\t\t\tMedian.removeInfo(x[i]);\r\n \t\t\t\tremoveCount = Median.getListSize();\r\n \t\t\t\tif (removeCount == 0) {\r\n \t\t\t\t\tSystem.out.println(\"Wrong!\");\r\n \t\t\t\t}\r\n \t\t\t\telse if (removeCount == 1) {\r\n \t\t\t\t\tSystem.out.println(Median.getNodeInfo(removeCount-1));\r\n \t\t\t\t} else if (removeCount>1) {\r\n \t\t\t\t\t//call your method here and return median;return the index of mid\r\n \t\t\t\t\treturnMedianValue(removeCount);\r\n \t\t\t\t\t//System.out.println(removeMedian);\r\n \t\t\t\t}\r\n \t\t\t} else {\r\n \t\t\t\tSystem.out.println(\"Wrong!\");\r\n \t\t\t}\r\n \t\t}\r\n \t}\r\n }","title":""},{"docid":"3574bd03c510e470058a4bcbdbf9e984","score":"0.5443534","text":"private static float getMedian(List<Float> values, int mid_element,\n\t\t\tint start, int end) {\n\t\tif (end - start < 1)\n\t\t\treturn -1f;\n\t\telse if (end - start == 1)\n\t\t\treturn values.get(start);\n\n\t\tint random_ind = start + (int) (Math.random() * (end - start));\n\t\tfloat temp = values.get(start);\n\t\tvalues.set(start, values.get(random_ind));\n\t\tvalues.set(random_ind, temp);\n\t\tint index = partition(values, start, end);\n\t\tif (index == mid_element) {\n\t\t\tmedian = values.get(index);\n\t\t} else if (index < mid_element) {\n\t\t\tmedian = getMedian(values, mid_element, index + 1, end);\n\t\t} else {\n\n\t\t\tmedian = getMedian(values, mid_element, start, index);\n\t\t}\n\t\treturn median;\n\t}","title":""},{"docid":"387e7566c984de69db70f9f2644aee74","score":"0.5434695","text":"public double getMedian(int[] data){//WORKING CORRECTLY\n\tif(data.length==0){return -1;}\n\tif(data.length==1){return data[0];}\n\tint[] tempdata = heapsort(data);\n\tint datalength = tempdata.length;\n\tdouble retval = 0;\n\tif(datalength%2==1){\n\t retval = tempdata[(int)(datalength/2)];\n\t}else{\n\t retval = (tempdata[(int)(datalength/2)]+tempdata[(int)(datalength/2)-1])/2;\n\t}\n\treturn retval;\n }","title":""},{"docid":"e6aea35ce96f07f64235ce921706e9d7","score":"0.5403246","text":"public static int median(int[] a){\n\t\tint median = Integer.MAX_VALUE;\n\t\tint left = 0, right = a.length-1;\n\t\tint mIndex = a.length/2;\n\t\twhile(true){\n\t\t\tint pos = partition(a, left, right);\n\t\t\tif(pos == mIndex){\n\t\t\t\tmedian = a[pos];\n\t\t\t\tbreak;\n\t\t\t}else if(pos > mIndex){\n\t\t\t\tright = pos -1;\n\t\t\t}else{\n\t\t\t\tleft = pos+1;\n\t\t\t}\n\t\t}\n\t\treturn mIndex;\n\t\n\t}","title":""},{"docid":"51a419deaef0d3dab9312d866b1bb839","score":"0.5399707","text":"public double findMedian() {\n if (maxq.size()==minq.size()){\n return med;\n }else{\n \treturn (med + minq.peek())/2.0;\n }\n }","title":""},{"docid":"8c9d7045459fdb857da519769318aafe","score":"0.53868955","text":"public int kthSmallest(TreeNode root, int k) {\n Stack<TreeNode> stack = new Stack<TreeNode>();\n TreeNode p = root;\n int count = 0;\n\n while(!stack.isEmpty() || p != null) {\n if(p != null) {\n stack.push(p); // Just like recursion\n p = p.left;\n\n } else {\n TreeNode node = stack.pop();\n if(++count == k) return node.val;\n p = node.right;\n }\n }\n\n return Integer.MIN_VALUE;\n }","title":""},{"docid":"46d2a72f8fc49985936dd453076e0d8b","score":"0.53751254","text":"private void calculateMedianWeightOfMales(){\n\t\t//Copy the weight of males into males array\n\t\tdouble[] males = new double[numberMales];\n\t\tint k=0;\n\t\tfor(int i=numberFemales; i<spiders.length; i++){\n\t\t\tmales[k] = spiders[i].getWeight();\n\t\t\tk++;\n\t\t}\n\t\t\n\t\t//Calculate the median position\n\t\tint medianPos = (0 + numberMales-1) / 2;\n\t\t\n\t\t//Calculate the median value\t\t\n\t\tint begin, end, p, r, i;\n\t\tdouble pivot;\n\t\t\n\t\tbegin = 0;\n\t\tend = numberMales-1;\n\t\t\n\t\twhile(true){\n\t\t\tp = begin;\n\t\t\tr = end;\n\t\t\tpivot = males[r];\n\t\t\ti = p-1;\n\t\t\tfor(int j=p; j<r; j++){\n\t\t\t\tif (males[j] < pivot){\n\t\t\t\t\ti++;\n\t\t\t\t\t//swap males[i] and males[j]\n\t\t\t\t\tdouble tmp = males[i];\n\t\t\t\t\tmales[i] = males[j];\n\t\t\t\t\tmales[j] = tmp;\n\t\t\t\t}\n\t\t\t}\n\t\t\t//swap males[i+1] and males[r]\n\t\t\tdouble tmp = males[i+1];\n\t\t\tmales[i+1] = males[r];\n\t\t\tmales[r] = tmp;\n\t\t\t\n\t\t\tif (i+1 == medianPos){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tif (medianPos > i+1){\n\t\t\t\t\t//search right\n\t\t\t\t\tbegin = i+2;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\t//search left\n\t\t\t\t\tend = i;\n\t\t\t\t}\t\t\t\n\t\t\t}\n\t\t}\n\t\t\n\t\tmedianWeight = males[medianPos];\n\t}","title":""},{"docid":"d7554da77d7b538b044cb92498743d51","score":"0.5367043","text":"public int kthSmallest(TreeNode root, int k) {\n\n Stack<TreeNode> stack = new Stack<>();\n ArrayList<Integer> result = new ArrayList<>();\n\n while(!stack.isEmpty() || root != null){\n while (root !=null){\n stack.push(root);\n root = root.left;\n }\n if(!stack.isEmpty()){\n root = stack.pop();\n result.add(root.val);\n root = root.right;\n }\n\n }\n return result.get(k-1);\n\n }","title":""},{"docid":"a95a1c6862b95f72395c4db79f06744a","score":"0.53641725","text":"@Override\n public double getMedian() {\n return getStatistics().getMedian();\n }","title":""},{"docid":"11c6332c6b673fd65d61311251efb0dc","score":"0.53501093","text":"public int kthSmallest1(TreeNode root, int k) {\n\t\tStack<TreeNode> nodes = new Stack<>();\n\t\tint count = 0;\n\t\twhile (root != null || !nodes.isEmpty()) {\n\t\t\twhile (root != null) {\n\t\t\t\tnodes.push(root);\n\t\t\t\troot = root.left;\n\t\t\t}\n\t\t\t++count;\n\t\t\tif (!nodes.isEmpty()) {\n\t\t\t\troot = nodes.pop();\n\t\t\t\tif (count == k) {\n\t\t\t\t\treturn root.val;\n\t\t\t\t}\n\t\t\t\troot = root.right;\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}","title":""},{"docid":"198c238372567a592b7e5fdd56c84cd5","score":"0.5339274","text":"public static double median(int[] array, int size){\n\t\tArrays.sort(array);\r\n\t if(size%2 == 0){\r\n\t\t\tdouble averageMedian = ((double)array[size/2-1] + ((double)array[size/2])) / 2;\t\t//if there is an even amount of numbers in the array, take the two middle numbers and divide by 2\r\n\t\t\treturn averageMedian;\r\n\t\t}else{\r\n\t\t return array[array.length/2];\t\t\t\t\t\t\t\t\t\t\t\t\t\t//if there is an off amount of numbers in the array, return the middle number\r\n\t\t}\r\n\t}","title":""},{"docid":"c081f7ccbc764c21fdd0cad06ecc6f6c","score":"0.5325644","text":"public int rank(int k)\n\t{\n\t\tRBNode currentNode = this.findGEQNode(k);\n\t\tif (currentNode == null) // Either tree is empty or there is no GEQ node\n\t\t\t// - k is bigger or equal to every key in\n\t\t\t// the tree\n\t\t\treturn this.size();\n\t\tint total = 0;\n\t\tboolean shouldAdd = true;\n\t\twhile (currentNode != this.sentinel)\n\t\t{\n\t\t\tif (shouldAdd && currentNode.left != null)\n\t\t\t\ttotal += currentNode.left.getSize();\n\t\t\tshouldAdd = this.isRightChild(currentNode);\n\t\t\tcurrentNode = currentNode.parent;\n\t\t}\n\t\treturn total;\n\t}","title":""},{"docid":"acf72c470a73aa01877a229821bb1a9d","score":"0.532343","text":"public static int kthSmallest(BinaryTreeNode root, int k) {\n\t\tif(root==null)\n\t\t\treturn -1;\n\t\tStack<BinaryTreeNode> stack=new Stack<>();\n\t\tBinaryTreeNode current=root;\n\t\twhile(current!=null) {\n\t\t\tstack.push(current);\n\t\t\tcurrent=current.getLeftNode();\n\t\t}\n\t\twhile(!stack.isEmpty()) {\n\t\t\tBinaryTreeNode curr=stack.pop();\n\t\t\tk--;\n\t\t\tif(k==0) {\n\t\t\t\treturn curr.getData();\n\t\t\t}\n\t\t\tif(curr.getRightNode()!=null) {\n\t\t\tcurr=curr.getRightNode();\n\t\t\twhile(curr!=null) {\n\t\t\t\tstack.push(curr);\n\t\t\t\tcurr=curr.getLeftNode();\n\t\t\t}\n\t\t}\n\t\t}\n\t\treturn -1;\n }","title":""},{"docid":"18d770b2cb0ecb04522a87b3a46a5e5c","score":"0.532156","text":"private void minNode(JGraphHierarchyModel model) {\n\t\t// Queue all nodes\n\t\tLinkedList nodeList = new LinkedList();\n\t\t// Need to be able to map from cell to cellWrapper\n\t\tMap map = new Hashtable();\n\t\tObject[][] rank = new Object[model.maxRank + 1][];\n\t\tfor (int i = 0; i <= model.maxRank; i++) {\n\t\t\tJGraphHierarchyRank rankSet = (JGraphHierarchyRank) model.ranks\n\t\t\t\t\t.get(new Integer(i));\n\t\t\trank[i] = rankSet.toArray();\n\t\t\tfor (int j = 0; j < rank[i].length; j++) {\n\t\t\t\t// Use the weight to store the rank and visited to store whether\n\t\t\t\t// or not the cell is in the list\n\t\t\t\tJGraphAbstractHierarchyCell cell = (JGraphAbstractHierarchyCell) rank[i][j];\n\t\t\t\tWeightedCellSorter cellWrapper = new WeightedCellSorter(cell, i);\n\t\t\t\tcellWrapper.rankIndex = j;\n\t\t\t\tcellWrapper.visited = true;\n\t\t\t\tnodeList.add(cellWrapper);\n\t\t\t\tmap.put(cell, cellWrapper);\n\t\t\t}\n\t\t}\n\t\t// Set a limit of the maximum number of times we will access the queue\n\t\t// in case a loop appears\n\t\tint maxTries = nodeList.size() * 10;\n\t\tint count = 0;\n\t\t// Don't move cell within this value of their median\n\t\tint tolerance = 1;\n\t\twhile (!nodeList.isEmpty() && count <= maxTries) {\n\t\t\tWeightedCellSorter cellWrapper = (WeightedCellSorter) nodeList\n\t\t\t\t\t.getFirst();\n\t\t\tJGraphAbstractHierarchyCell cell = cellWrapper.cell;\n\t\t\tint rankValue = cellWrapper.weightedValue;\n\t\t\tint rankIndex = cellWrapper.rankIndex;\n\t\t\tObject[] nextLayerConnectedCells = cell.getNextLayerConnectedCells(\n\t\t\t\t\trankValue).toArray();\n\t\t\tObject[] previousLayerConnectedCells = cell\n\t\t\t\t\t.getPreviousLayerConnectedCells(rankValue).toArray();\n\t\t\tint numNextLayerConnected = nextLayerConnectedCells.length;\n\t\t\tint numPreviousLayerConnected = previousLayerConnectedCells.length;\n\n\t\t\tint medianNextLevel = medianXValue(nextLayerConnectedCells,\n\t\t\t\t\trankValue + 1);\n\t\t\tint medianPreviousLevel = medianXValue(previousLayerConnectedCells,\n\t\t\t\t\trankValue - 1);\n\n\t\t\tint numConnectedNeighbours = numNextLayerConnected\n\t\t\t\t\t+ numPreviousLayerConnected;\n\t\t\tint currentPosition = cell.getGeneralPurposeVariable(rankValue);\n\t\t\tdouble cellMedian = currentPosition;\n\t\t\tif (numConnectedNeighbours > 0) {\n\t\t\t\tcellMedian = (medianNextLevel * numNextLayerConnected + medianPreviousLevel\n\t\t\t\t\t\t* numPreviousLayerConnected)\n\t\t\t\t\t\t/ numConnectedNeighbours;\n\t\t\t}\n\n\t\t\t// Flag storing whether or not position has changed\n\t\t\tboolean positionChanged = false;\n\t\t\tif (cellMedian < currentPosition - tolerance) {\n\t\t\t\tif (rankIndex == 0) {\n\t\t\t\t\tcell.setGeneralPurposeVariable(rankValue, (int) cellMedian);\n\t\t\t\t\tpositionChanged = true;\n\t\t\t\t} else {\n\t\t\t\t\tJGraphAbstractHierarchyCell leftCell = (JGraphAbstractHierarchyCell) rank[rankValue][rankIndex - 1];\n\t\t\t\t\tint leftLimit = leftCell\n\t\t\t\t\t\t\t.getGeneralPurposeVariable(rankValue);\n\t\t\t\t\tleftLimit = leftLimit + (int) leftCell.width / 2\n\t\t\t\t\t\t\t+ (int) intraCellSpacing + (int) cell.width / 2;\n\t\t\t\t\tif (leftLimit < cellMedian) {\n\t\t\t\t\t\tcell.setGeneralPurposeVariable(rankValue,\n\t\t\t\t\t\t\t\t(int) cellMedian);\n\t\t\t\t\t\tpositionChanged = true;\n\t\t\t\t\t} else if (leftLimit < cell\n\t\t\t\t\t\t\t.getGeneralPurposeVariable(rankValue)\n\t\t\t\t\t\t\t- tolerance) {\n\t\t\t\t\t\tcell.setGeneralPurposeVariable(rankValue, leftLimit);\n\t\t\t\t\t\tpositionChanged = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if (cellMedian > currentPosition + tolerance) {\n\t\t\t\tint rankSize = rank[rankValue].length;\n\t\t\t\tif (rankIndex == rankSize - 1) {\n\t\t\t\t\tcell.setGeneralPurposeVariable(rankValue, (int) cellMedian);\n\t\t\t\t\tpositionChanged = true;\n\t\t\t\t} else {\n\t\t\t\t\tJGraphAbstractHierarchyCell rightCell = (JGraphAbstractHierarchyCell) rank[rankValue][rankIndex + 1];\n\t\t\t\t\tint rightLimit = rightCell\n\t\t\t\t\t\t\t.getGeneralPurposeVariable(rankValue);\n\t\t\t\t\trightLimit = rightLimit - (int) rightCell.width / 2\n\t\t\t\t\t\t\t- (int) intraCellSpacing - (int) cell.width / 2;\n\t\t\t\t\tif (rightLimit > cellMedian) {\n\t\t\t\t\t\tcell.setGeneralPurposeVariable(rankValue,\n\t\t\t\t\t\t\t\t(int) cellMedian);\n\t\t\t\t\t\tpositionChanged = true;\n\t\t\t\t\t} else if (rightLimit > cell\n\t\t\t\t\t\t\t.getGeneralPurposeVariable(rankValue)\n\t\t\t\t\t\t\t+ tolerance) {\n\t\t\t\t\t\tcell.setGeneralPurposeVariable(rankValue, rightLimit);\n\t\t\t\t\t\tpositionChanged = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (positionChanged) {\n\t\t\t\t// Add connected nodes to map and list\n\t\t\t\tfor (int i = 0; i < nextLayerConnectedCells.length; i++) {\n\t\t\t\t\tJGraphAbstractHierarchyCell connectedCell = (JGraphAbstractHierarchyCell) nextLayerConnectedCells[i];\n\t\t\t\t\tWeightedCellSorter connectedCellWrapper = (WeightedCellSorter) map\n\t\t\t\t\t\t\t.get(connectedCell);\n\t\t\t\t\tif (connectedCellWrapper != null) {\n\t\t\t\t\t\tif (connectedCellWrapper.visited == false) {\n\t\t\t\t\t\t\tconnectedCellWrapper.visited = true;\n\t\t\t\t\t\t\tnodeList.add(connectedCellWrapper);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// Add connected nodes to map and list\n\t\t\t\tfor (int i = 0; i < previousLayerConnectedCells.length; i++) {\n\t\t\t\t\tJGraphAbstractHierarchyCell connectedCell = (JGraphAbstractHierarchyCell) previousLayerConnectedCells[i];\n\t\t\t\t\tWeightedCellSorter connectedCellWrapper = (WeightedCellSorter) map\n\t\t\t\t\t\t\t.get(connectedCell);\n\t\t\t\t\tif (connectedCellWrapper != null) {\n\t\t\t\t\t\tif (connectedCellWrapper.visited == false) {\n\t\t\t\t\t\t\tconnectedCellWrapper.visited = true;\n\t\t\t\t\t\t\tnodeList.add(connectedCellWrapper);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tnodeList.removeFirst();\n\t\t\tcellWrapper.visited = false;\n\t\t\tcount++;\n\t\t}\n\t}","title":""},{"docid":"629dfba36e15d2bdfb9625120d61b736","score":"0.53204066","text":"public KDNode recursiveBuildFaster(ArrayList<List<KDType>> superList, int depth) {\n\t\tint size = superList.get(0).size();\n\t\t\n\t\tif (_k < 1) {\n\t\t\tSystem.err.println(\"ERROR: KDTree.recursiveBuildFaster(): Number of Dimensions has not been defined.\");\n\t\t\treturn null;\n\t\t}\n\t\tif (depth < 0) {\n\t\t\tSystem.err.println(\"ERROR: KDTree.recursiveBuildFaster(): Cannot build tree from a negative depth!\");\n\t\t\treturn null;\n\t\t}\n\t\tif(size == 0) {\n\t\t\tSystem.err.println(\"ERROR: KDTree.recursiveBuildfaster(): Cannot build tree from an empty list.\");\n\t\t\treturn null;\n\t\t}\n\t\t\n\t\tint axis = depth % _k;\t//the 'axis' is the dimension that the nodes should be compared by.\n\t\t\t\t\t\t\t\t//it is determined by the current depth\n\t\t\n\t\t//split list by median\n\t\tKDType median;\n\t\tint mid = size/2; //floor of size/2\n\t\tmedian = superList.get(axis).get(mid); //get median object from desired axis-sorted list in superList \n\t\t\n\t\t//create node, split list around median and recur\n\t\t\t//if there is only one node left in the list, it's our median,\n\t\t\t//so we're done with building the tree and we can return the \n\t\t\t//last node which we just created from the median.\n\t\tKDNode node = new KDNode(median);\n\t\tif (depth == 0) _root = node; //set node to root if it's the first one\n\t\t\n\t\t//create new sets of branches, split around the median object.\n\t\tBranches branches = new Branches(superList, mid, axis);\n\t\tArrayList<List<KDType>> less = branches.less; //all object less than or equal to (on current axis)\n\t\tArrayList<List<KDType>> more = branches.more; //all objects greater than (on current axis)\n\t\t\n\t\tif (!less.get(0).isEmpty())\n\t\t\tnode.putLeft(this.recursiveBuildFaster(less, depth+1));\n\t\tif (!more.get(0).isEmpty())\n\t\t\tnode.putRight(this.recursiveBuildFaster(more, depth+1));\n\t\t//XXX to save memory.\n\t\tbranches = null;\n\t\t\n\t\t_size++;\n\t\treturn node;\n\t}","title":""},{"docid":"754de60dcc6ce58074524c161fffa6be","score":"0.5318472","text":"private int kthChild(int i, int k)\r\n {\r\n return d * i + k;\r\n }","title":""},{"docid":"6e11d17cfcf142fe9e790417cc0d7a1c","score":"0.5317679","text":"public int returnKthSmallestBST(TreeNode root, int k) {\n return 0;\n }","title":""},{"docid":"aacc476f227fe1a54fa2fcd6eeda5d02","score":"0.5293119","text":"static double[] runningMedian(int[] a) {\n /*\n * Write your code here.\n */\n \n int N = a.length;\n double[] medians = new double[N];\n Queue<Integer> maxPQ = new PriorityQueue<>(N/2 + 1, Collections.reverseOrder());\n Queue<Integer> minPQ = new PriorityQueue<>(N/2 + 1);\n double median = 0;\n for(int i = 0; i < a.length; i++){\n if (a[i] <= median) {\n maxPQ.add(a[i]);\n } else {\n minPQ.add(a[i]);\n }\n\n if (minPQ.size() > maxPQ.size()+1) {\n maxPQ.add(minPQ.poll());\n minPQ.poll();\n }\n if (maxPQ.size() > minPQ.size()+1) {\n minPQ.add(maxPQ.poll());\n maxPQ.poll();\n }\n\n if (minPQ.size() == maxPQ.size()) {\n \n median = (double)(maxPQ.peek() + minPQ.peek())/2.0;\n } else if(minPQ.size() > maxPQ.size()) {\n median = (double)minPQ.peek();\n } else if (minPQ.size() < maxPQ.size()) {\n median = (double)maxPQ.peek();\n }\n medians[i] = median;\n }\n return medians;\n }","title":""},{"docid":"7b1e1567d5711c4366083a597f0442b2","score":"0.5274798","text":"public int rank(Key key) {\n return rank(root, key);\n }","title":""},{"docid":"75bcb8d5f5a21f2d5e4391917ac837dc","score":"0.5269587","text":"public int rank(Node<Key, Value> x, Key key){\n if(x == null) return 0;\n int result = key.compareTo(x.key);\n if(result < 0) return rank(x.left, key);\n else if(result > 0) return 1 + size(x.left) + rank(x.right, key);\n else return size(x.left);\n }","title":""},{"docid":"a796c67d6f574edb60a4f6a85a5f6f46","score":"0.52533007","text":"private double getMedian(LinkedList<VPItem> list) {\n double median = 0;\n for (VPItem item : list) {\n median += item.getItemsHistory();\n }\n return median / list.size();\n }","title":""},{"docid":"bfa6f5855d86f6644f6c068d1a443c1d","score":"0.5252616","text":"private int rank(int key, Node x) {\n if (x == null) return 0; \n int cmp = key - x.key; \n if (cmp < 0) return rank(key, x.left); \n else if (cmp > 0) return 1 + size(x.left) + rank(key, x.right); \n else return size(x.left); \n }","title":""},{"docid":"69384a29dc5d7c4a9bd23c1930481b22","score":"0.5249304","text":"public double findMedian() {\n if(maxQ.size() == minQ.size())\n return (maxQ.peek() + minQ.peek())/2.0;\n else\n return maxQ.peek();\n }","title":""},{"docid":"08cda966dcc6caba8872a339f77898ae","score":"0.5233534","text":"public double findMedian() {\n \tint[] tmp = new int[count];\n System.arraycopy(store, 0, tmp, 0, count);\n \tArrays.sort(tmp);\n \tint low = count / 2;\n return count % 2 == 0 ? (double) (tmp[low - 1] + tmp[low]) / 2 : new Double(tmp[low]);\n }","title":""},{"docid":"7c47c9a77b6195dea07d0ad8e67065fe","score":"0.5225915","text":"private void medianPos(int i, JGraphHierarchyModel model) {\n\t\t// Reverse sweep direction each time through this method\n\t\tboolean downwardSweep = (i % 2 == 0);\n\t\tif (downwardSweep) {\n\t\t\tfor (int j = model.maxRank; j > 0; j--) {\n\t\t\t\trankMedianPosition(j - 1, model, j);\n\t\t\t}\n\t\t} else {\n\t\t\tfor (int j = 0; j < model.maxRank - 1; j++) {\n\t\t\t\trankMedianPosition(j + 1, model, j);\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"c5f802e33b265ae595572ebafb28cfd8","score":"0.52103186","text":"public int getMedianValue(List<Integer> values) {\n int size = values.size();\n if (size == 0) {\n return 0;\n }\n int middle = size / 2;\n\n int hi = values.get(middle);\n\n /* Handles the case in which the size of the array is even, and returns the average of the middle values */\n if (size % 2 == 0) {\n int lo = values.get(middle - 1);\n return average(lo, hi);\n }\n return hi;\n }","title":""},{"docid":"bdd25b88e131c010c467e6f6427b5ff7","score":"0.52101046","text":"private int rank(Node x, Key key) {\n\t\tif (x == null) {\n\t\t\treturn 0;\n\t\t}\n\t\tint cmp = key.compareTo(x.key);\n\t\tif (cmp < 0) {\n\t\t\treturn rank(x.left, key);\n\t\t} else if ( cmp > 0){\n\t\t\treturn 1 + size(x.left) + rank(x.right, key);\n\t\t} else {\n\t\t\treturn size(x.left);\n\t\t}\n\t}","title":""},{"docid":"a9a9f00a4174dfd157a347027a5e0533","score":"0.52089417","text":"public double[] medianSlidingWindow(int[] a, int k) {\n\t\tint n = a.length;\n\t\tdouble res[] = new double[n - k + 1];\n\t\tPriorityQueue<Integer> minHeap = new PriorityQueue<>();\n\t\tPriorityQueue<Integer> maxHeap = new PriorityQueue<>((c, d) -> d.compareTo(c));\n\t\tfor (int i = 0; i <= n; i++) {\n\t\t\tif (i >= k) {\n\t\t\t\tres[i - k] = k % 2 != 0 ? maxHeap.peek() : ((double) maxHeap.peek() + (double) minHeap.peek()) / 2.0;\n\t\t\t\tif (a[i - k] <= maxHeap.peek()) {\n\t\t\t\t\tmaxHeap.remove(a[i - k]);\n\t\t\t\t} else {\n\t\t\t\t\tminHeap.remove(a[i - k]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (i != n)\n\t\t\t\tinsert(a[i], minHeap, maxHeap);\n\t\t}\n\t\treturn res;\n\t}","title":""},{"docid":"5872c4f3a36bfcc8a0ad7cb89779815b","score":"0.5203721","text":"public int rank(Key key) {\r\n return rank(root, key);\r\n }","title":""},{"docid":"1c60399691b923e5e0506a8eae96b20c","score":"0.5198053","text":"public MedianFinder() {\n maxHeap = new PriorityQueue<>(new Comparator<Integer>(){\n @Override\n public int compare(Integer num1, Integer num2){\n return num2 - num1;\n }\n });\n minHeap = new PriorityQueue<>();\n }","title":""},{"docid":"373e9ed5df1071c9791c4253a340db73","score":"0.51948196","text":"public static double median(double [] num) {\r\n\t\t\r\n\t\tdouble median;\r\n\t\t//divide the length of the array by 2\r\n\t\tif (num.length % 2 == 0)\r\n\t\t median = ((double)num[num.length/2] + (double)num[num.length/2 - 1])/2;\r\n\t\telse\r\n\t\t median = (double) num[num.length/2];\r\n\t\treturn median;\r\n\t}","title":""},{"docid":"6f3d59871c567b0c568943a9389500f1","score":"0.5191851","text":"private int kthChild(int i, int k)\n {\n return totalNumberOfChildNode * i + k;\n }","title":""},{"docid":"cc0af7801c47315ad383758841d7eecf","score":"0.5191788","text":"public MedianFinder() {\n \n lowerHeap = new PriorityQueue<Integer>(new Comparator<Integer>(){\n public int compare(Integer i1, Integer i2){\n return i2-i1;\n }\n });\n upperHeap = new PriorityQueue<Integer>(new Comparator<Integer>(){\n public int compare(Integer i1, Integer i2){\n return i1-i2;\n }\n });\n }","title":""},{"docid":"91a011ef68ae5e38ef80b9c2cfbf4cdb","score":"0.5160574","text":"public Q295_Find_Median_from_Data_Stream() {\n small = new PriorityQueue<>(Collections.reverseOrder());\n large = new PriorityQueue<>();\n isEven = true;\n }","title":""},{"docid":"0e7abae2574b103e2f636d7de397c562","score":"0.5160128","text":"public double getMedian() {\n\t\tArrayList<Double> list = new ArrayList<Double>();\n\t\tfor(Double grade : studentGrades.values()) {\n\t\t\tif(grade != null) {\n\t\t\t\tlist.add(grade);\n\t\t\t}\n\t\t}\n\t\tif(list.size() > 0) {\n\t\t\tif(list.size() == 1) {\n\t\t\t\treturn list.get(0);\n\t\t\t}\n\t\t\tCollections.sort(list);\n\t\t\tif(list.size() % 2 != 0) {\n\t\t\t\treturn list.get((list.size() + 1) / 2 - 1);\n\t\t\t} else {\n\t\t\t\treturn (list.get(list.size() / 2) + list.get((list.size() / 2) - 1)) / 2;\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}","title":""},{"docid":"9e6af2f72e4b27dc3f2e05659ead54e8","score":"0.5159316","text":"public int kthFromLast(int k){\r\n Node slow = head;\r\n Node fast = head;\r\n //Update fast till k, now the difference between slow and fast is of k nodes. If we iterate fast till last, slow.data\r\n //will give us our required kth last element.\r\n for(int i=0; i<k; i++){\r\n fast = fast.next;\r\n }\r\n while(fast.next != null){\r\n slow = slow.next;\r\n fast = fast.next;\r\n }\r\n return slow.data;\r\n }","title":""},{"docid":"217db107371963ac33d9cb9be0960485","score":"0.5148682","text":"@Override\n\tpublic int rank(Key key) {\n\t\treturn this.rank(this.root, key);\n\t}","title":""},{"docid":"43ace15657eee2e2e5330c049f56502f","score":"0.51464975","text":"public int rank(Key key) {\n return rank(key, root);\n }","title":""},{"docid":"51ad3cb67cf321467817876680468336","score":"0.5140316","text":"private RBNode findNode(int k)\n\t{\n\t\tRBNode current = getRoot();\n\n\t\twhile (current != null)\n\t\t{\n\t\t\tif (current.getKey() < k)\n\t\t\t{\n\t\t\t\tcurrent = current.getRight();\n\t\t\t} else if (current.getKey() > k)\n\t\t\t{\n\t\t\t\tcurrent = current.getLeft();\n\t\t\t} else\n\t\t\t{\n\t\t\t\treturn current;\n\t\t\t}\n\t\t}\n\n\t\treturn null;\n\t}","title":""},{"docid":"e4e2d3808a9a3a8ecf8d03f6187be7ea","score":"0.5137701","text":"private int correctMedian(List<Stagiaire> listOfStagiaire, int median) throws IOException {\n\t\tint incrementMedian = median + 1; \n\t\tString medianName = listOfStagiaire.get(median).getNom();\n\t\tString medianNamePlusOne = listOfStagiaire.get(median+1).getNom();\n\t\t// condition si size of the list\n\t\twhile( (medianName.compareTo(medianNamePlusOne) == 0) &&\n\t\t\t ( incrementMedian < listOfStagiaire.size()-1 ) ) {\n\t\t\tincrementMedian++;\n\t\t\tmedianNamePlusOne = listOfStagiaire.get(incrementMedian).getNom();\n\t\t}\n\t\t//System.out.println(\"Found correct median : \"+ (int)(incrementMedian) );\n\t\treturn incrementMedian;\n\t}","title":""},{"docid":"2c73de392aeb0d2cf14c64d2adce4ae1","score":"0.513627","text":"public int findKthNumber(int m, int n, int k) {\n int left = 1, right = m * n;\n while (left < right) {\n int mid = (right - left) / 2 + left;\n if (count(mid, m, n, k)) {\n right = mid;\n } else {\n left = mid + 1;\n }\n }\n return left;\n }","title":""},{"docid":"985e7eb359982255e8ed928707f5c69b","score":"0.5129453","text":"static int[] medianII(int[] nums) {\n Queue<Integer> minHeap = new PriorityQueue<Integer>((o1, o2) -> o2-o1);\n Queue<Integer> maxHeap = new PriorityQueue<Integer>((o1, o2) -> o1-o2);\n int len = 0;\n int[] ret = new int[nums.length];\n for(Integer n: nums) {\n len++;\n int minSize = len%2==1? len/2 +1 : len/2;\n int maxSize = len/2;\n if(minHeap.size()==0) {\n minHeap.add(n);\n ret[len-1] = n;\n continue;\n }\n if(n<=minHeap.peek()) {\n minHeap.add(n);\n if(minHeap.size()>minSize) {\n maxHeap.add(minHeap.poll());\n }\n ret[len-1] = minHeap.peek();\n }\n else {\n maxHeap.add(n);\n if(maxHeap.size()>maxSize) {\n minHeap.add(maxHeap.poll());\n }\n ret[len-1] = minHeap.peek();\n }\n }\n return ret;\n }","title":""},{"docid":"9e455489bd6cbb60d2aeaa29deda9159","score":"0.5116722","text":"public int delete(int k) {\n IAVLNode node = searchForNode(k);\n if (node == null) {\n return -1;\n }\n IAVLNode parent = node.getParent();\n if (node.isLeaf()) {\n deleteLeaf(node);\n decrementAncestorsSize(parent);\n return (rebalanceAfterDelete(parent));\n }\n if (node.isUnaryNode()) {\n deleteUnaryNode(node);\n decrementAncestorsSize(parent);\n return (rebalanceAfterDelete(node.getParent()));\n }\n IAVLNode nodeToDelete = swapNodeWithSuccessor(node);\n deleteAfterSuccessorSwap(nodeToDelete);\n decrementAncestorsSize(nodeToDelete.getParent());\n return rebalanceAfterDelete(nodeToDelete.getParent());\n }","title":""},{"docid":"606bd231e4cb110fbbd83578bfe8a4ae","score":"0.5113627","text":"private Optional<BinaryNode<K, double[]>> constructKDTree(Collection<KVPair<K, double[]>> items, int depth) {\n List<KVPair<K, double[]>> itemsList = new ArrayList<KVPair<K, double[]>>(items);\n BinaryNode<K, double[]> tree;\n if (itemsList.size() == 1) {\n tree = new BinaryNode<K, double[]>(itemsList.get(0), Optional.empty(), Optional.empty());\n return Optional.of(tree);\n } else if (itemsList.size() == 0) {\n return Optional.empty(); \n }\n int sortIndex = depth % dimension;\n Collections.sort(itemsList, (e1, e2) -> {\n return (int) Math.signum(e1.getValue()[sortIndex] - e2.getValue()[sortIndex]);\n });\n\n int medianIndex = (itemsList.size() / 2);\n KVPair<K, double[]> median = itemsList.get(medianIndex);\n tree = new BinaryNode<K, double[]>(median, \n constructKDTree(itemsList.subList(0, medianIndex), depth += 1), \n constructKDTree(itemsList.subList(medianIndex + 1, itemsList.size()), depth += 1));\n return Optional.of(tree);\n }","title":""},{"docid":"46aec8a0f852e60c44f3ecbc0c7903a6","score":"0.51134896","text":"private int rank(Key key, Node node) {\n if (node == null)\n return 0;\n\n int compare = key.compareTo(node.key);\n\n if (compare < 0)\n return rank(key, node.left);\n\n // When the key is larger than the current node, add all nodes to the left of it,\n // as well as the current node, and explore the right subtree.\n else if (compare > 0)\n return rank(key, node.right) + 1 + size(node.left);\n\n return size(node.left);\n }","title":""},{"docid":"8bd8d8819b347939508e968a1a0913ae","score":"0.5108687","text":"protected int getMedian(ArrayList<Integer> list){\n\t\tint median;\n\t\tif(list.size() == 0){\n\t\t\tmedian = 0;\n\t\t}\n\t\telse{\n\t\t\tArrayList<Integer> sortedList = makeCopy(list);\n\t\t\tCollections.sort(sortedList);\n\t\t\tint middle = sortedList.size()/2;\n\t\t\tif(sortedList.size()%2 == 1){\n\t\t\t\tmedian = sortedList.get(middle);\n\t\t\t} \n\t\t\telse{\n\t\t\t\tmedian = (sortedList.get(middle-1) + sortedList.get(middle))/2;\n\t\t\t}\n\t\t}\n\t return median;\n\t}","title":""},{"docid":"0ac1a8fe220cb166ae1902f1d77a06d9","score":"0.5103116","text":"private static void findKLargestInBSTHelper(BSTNode<Integer> tree, int k, List<Integer> kLargestElements) {\n\t\tif (tree != null && kLargestElements.size() < k) {\n\t\t\tfindKLargestInBSTHelper(tree.right, k, kLargestElements);\n\t\t\tif (kLargestElements.size() < k) {\n\t\t\t\tkLargestElements.add(tree.data);\n\t\t\t\tfindKLargestInBSTHelper(tree.left, k, kLargestElements);\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"8aa735083abea681029b01225d996f29","score":"0.50993216","text":"public MedianFinder() {\n minHeap = new PriorityQueue<>();\n maxHeap = new PriorityQueue<>(new Comparator<Integer>(){\n @Override\n public int compare(Integer o1, Integer o2) {\n return o2.compareTo(o1);\n }\n });\n }","title":""},{"docid":"514b4a6389fa73203fc3fd69a7440f5b","score":"0.5093903","text":"static void nodeAtk(Node root, int k){\n if(k==0)\n System.out.println(root.key);\n if(root.left!=null)\n nodeAtk(root.left,k-1);\n if(root.right!=null)\n nodeAtk(root.right,k-1);\n }","title":""},{"docid":"07767a4c153da0d7c5df73f6a03dbe41","score":"0.50929785","text":"public void updateMedian() {\n\t\tmedian = calcMedian(edgesCovered);\n\t\tedgesRepresented = new HashSet<Integer>();\n\t\t//System.out.println(\"Median is \" + median);\n\t\tfor (Integer a : edgesCovered)\n\t\t\tif (wc.invWeightDist.get(t.weights[a]) >= median*(1/Constants.WINDOW) && wc.invWeightDist.get(t.weights[a]) <= median*1*Constants.WINDOW)\n\t\t\t\tedgesRepresented.add(a);\n\t\tcurrentMDLScore = getMDLScore();\n\t\t\n\t\tminweight = Integer.MAX_VALUE;\n\t\tfor (Integer a : edgesRepresented)\n\t\t\tminweight = Math.min(minweight, t.weights[a]);\n\t}","title":""},{"docid":"e4e57df4944f2e1229d99a6e38bc37c9","score":"0.5090807","text":"public static double calculateMedian(int[] array){\n double median=0.0;\n Arrays.sort(array); // array == {3,9,15,17,44}\n if(array.length % 2 == 1){ // odd number of elements\n int middleIndex = array.length/2; // 5/2 == 2\n median = array[middleIndex]; // median is 15\n }else{\n // remainder is 0 => even number of elements\n // {3,8,10,5,6,4} initially (6 elements)\n // {3,4,5,6,8,10} after sorting the array\n int middleIndex = array.length/2; // 6/2 == 3\n double sumOfTwoMiddleValues = \n array[middleIndex] + // 6 +\n array[middleIndex-1];// 5 \n median = sumOfTwoMiddleValues/2; // 11/2 = 5.5\n }\n return median;\n }","title":""},{"docid":"1daef925761182f5fe540a276cff9917","score":"0.50825864","text":"private int getWeightedMedian(int[] bytesReadSoFar) {\r\n\t\t\r\n\t\tdouble b;\r\n\t\tdouble a;\r\n\t\tdouble z = bytesReadSoFar.length;\r\n\t\tdouble lnFloor;\r\n\t\tdouble lnCeil;\r\n\t\t\r\n\t\tArrays.sort(bytesReadSoFar);\r\n\t\t\r\n\t\ta = g * (z - 1.0f) + 1.0f;\r\n\t\t\r\n\t\tlnFloor = (double) bytesReadSoFar[(int) Math.floor(a) - 1];\r\n\t\tlnCeil = (double) bytesReadSoFar[(int) Math.ceil(a) - 1];\r\n\r\n\t\tb =\t(a - Math.floor(a)) * (lnCeil - lnFloor) + lnFloor;\r\n\t\t\r\n\t\treturn adjustBlockSizeToCryptographicBlockSize((int) Math.round(b));\r\n\t\t\r\n\t}","title":""},{"docid":"0c821b78b6274c8a8a9050932e7d34f9","score":"0.5076549","text":"public MedianFinder() {\n leftMaxHeap = new PriorityQueue<>((o1, o2) -> o2 - o1);\n rightMinHeap = new PriorityQueue<>();\n }","title":""},{"docid":"4a91b56e3e0e80ec010de90f605b2274","score":"0.5072239","text":"public MedianFinder() {\n minHeap = new PriorityQueue<Integer>();\n maxHeap = new PriorityQueue<Integer>(10, Collections.reverseOrder());\n }","title":""},{"docid":"67774ba9568142b87e99eb9c49ed688b","score":"0.5068896","text":"int kthSmallest(int arr[], int n, int k)\n{\n\n\t// Build a heap of first k elements: O(k) time\n\tMaxHeap mh = new MaxHeap(arr, k);\n\n\t// Process remaining n-k elements. If current element is\n\t// smaller than root, replace root with current element\n\tfor (int i = k; i < n; i++)\n\tif (arr[i] < mh.getMax())\n\t\tmh.replaceMax(arr[i]);\n\n\t// Return root\n\treturn mh.getMax();\n}","title":""},{"docid":"67cd6f82c0e0ac48bff8b70f7c498c33","score":"0.5062597","text":"private Double getMedian(Double newReading)\n {\n\n }","title":""},{"docid":"b28a7b4887f86c8d01e347225d487e8e","score":"0.505817","text":"public int rank(Key key) {\n\t\treturn rank(key, root);\n\t}","title":""},{"docid":"e478b3a86e2bf9bf78b31c7d070c4cff","score":"0.5055349","text":"@Override\n\tpublic int rank(K k) {\n\t\treturn rank(root, k);\n\t}","title":""},{"docid":"447f7330e62f81857ada37fe96191330","score":"0.5053905","text":"public static long median(long[] values)\n {\n // log.debug(\"public static long median(long[] values = \" + Arrays.toString(values) + \"): called\");\n\n long median;\n\n // Order the list of values.\n long[] orderedValues = new long[values.length];\n System.arraycopy(values, 0, orderedValues, 0, values.length);\n Arrays.sort(orderedValues);\n\n // Check if the median is computed from a pair of middle value.\n if ((orderedValues.length % 2) == 0)\n {\n int middle = orderedValues.length / 2;\n\n median = (orderedValues[middle] + orderedValues[middle - 1]) / 2;\n }\n // The median is computed from a single middle value.\n else\n {\n median = orderedValues[orderedValues.length / 2];\n }\n\n // log.debug(\"median = \" + median);\n\n return median;\n }","title":""},{"docid":"fb85ff290267be89b164d5e1d4e049b3","score":"0.5049385","text":"private double Median(double dimensions[]) {\n Arrays.sort(dimensions);\n int length = dimensions.length;\n if (length % 2 == 0)\n return (dimensions[length / 2] + dimensions[(length / 2) - 1]) / 2;\n else\n return dimensions[(length - 1) / 2];\n }","title":""}],"string":"[\n {\n \"docid\": \"7abdc57d616b6efc97d2826096810a49\",\n \"score\": \"0.7222322\",\n \"text\": \"public int recursiveMedian() {\\n \\n // list generation can create an empty list, this handles it\\n if(n < 1) {\\n return -1;\\n }\\n \\n // index of the expected median\\n int idxMedian = n % 2 == 1 ? n/2 : (n-1)/2;\\n \\n // run kthSmallestElement, initial lower and upper bounds at full length\\n return kthSmallestElement(0, n-1, idxMedian);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9104d55626c695ab012edf14625d826\",\n \"score\": \"0.6510643\",\n \"text\": \"public double median();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"53e4fa15e10257b1ff2ef5505522c3f8\",\n \"score\": \"0.62966704\",\n \"text\": \"public static int findKthSmallest(int[] nums, int k) {\\n if(nums==null||nums.length==0) return 0;\\n int left=0;\\n int right=nums.length - 1;\\n while(true){\\n //the partion function will return the position of nums[left]\\n int pos=partition(nums,left,right);\\n if(pos+1==k){\\n //if the position of nums[left] equals to the mid position, we find the median\\n return nums[pos];\\n }else if(pos+1>k){\\n //if the position of nums[left] is larger than mid position, it means median is on the left side\\n right=pos-1;\\n }else{\\n //if the position of nums[left] is smaller than mid position, it means median is on the right side\\n //so we update the left\\n left=pos+1;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82e06da8855dce557426de6d99145134\",\n \"score\": \"0.62745255\",\n \"text\": \"public int sortedMedian() {\\n if(n < 1) {\\n return -1;\\n }\\n \\n int idxMedian = n % 2 == 1 ? n/2 : (n-1)/2;\\n \\n for(int i = n-1; i > 0; i--) {\\n \\n for(int j = 0; j < i; j++) {\\n \\n if(a[j] > a[j+1]) {\\n int temp = a[j];\\n a[j] = a[j+1];\\n a[j+1] = temp;\\n }\\n }\\n }\\n return a[idxMedian];\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dad5a5ab37fde1eb983bcc42cf52e5e9\",\n \"score\": \"0.621306\",\n \"text\": \"private void split(Node<T> nodeToSplit) {\\r\\n Node<T> node = nodeToSplit;\\r\\n int numberOfKeys = node.numberOfKeys();\\r\\n int medianIndex = numberOfKeys / 2;\\r\\n T medianValue = node.getKey(medianIndex);\\r\\n\\r\\n Node<T> left = new Node<T>(null, maxKeySize, maxChildrenSize);\\r\\n for (int i = 0; i < medianIndex; i++) {\\r\\n left.addKey(node.getKey(i));\\r\\n }\\r\\n if (node.numberOfChildren() > 0) {\\r\\n for (int j = 0; j <= medianIndex; j++) {\\r\\n Node<T> c = node.getChild(j);\\r\\n left.addChild(c);\\r\\n }\\r\\n }\\r\\n\\r\\n Node<T> right = new Node<T>(null, maxKeySize, maxChildrenSize);\\r\\n for (int i = medianIndex + 1; i < numberOfKeys; i++) {\\r\\n right.addKey(node.getKey(i));\\r\\n }\\r\\n if (node.numberOfChildren() > 0) {\\r\\n for (int j = medianIndex + 1; j < node.numberOfChildren(); j++) {\\r\\n Node<T> c = node.getChild(j);\\r\\n right.addChild(c);\\r\\n }\\r\\n }\\r\\n\\r\\n if (node.parent == null) {\\r\\n // new root, height of tree is increased\\r\\n Node<T> newRoot = new Node<T>(null, maxKeySize, maxChildrenSize);\\r\\n newRoot.addKey(medianValue);\\r\\n node.parent = newRoot;\\r\\n root = newRoot;\\r\\n node = root;\\r\\n node.addChild(left);\\r\\n node.addChild(right);\\r\\n } else {\\r\\n // Move the median value up to the parent\\r\\n Node<T> parent = node.parent;\\r\\n parent.addKey(medianValue);\\r\\n parent.removeChild(node);\\r\\n parent.addChild(left);\\r\\n parent.addChild(right);\\r\\n\\r\\n if (parent.numberOfKeys() > maxKeySize) split(parent);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c43e2ce4c581a3b15378d5b94c82da0\",\n \"score\": \"0.6162858\",\n \"text\": \"public double find(BinaryNode<Integer> root)\\n\\t{\\n\\t\\tif (root == null)\\n\\t\\t{\\n\\t\\t\\tthrow new IllegalArgumentException(\\\"You can't pass a null binary tree to this method.\\\");\\n\\t\\t}\\n\\n\\t\\tList<BinaryNode<Integer>> sortedElements = binaryTreeInOrder.getIterative(root);\\n\\t\\tdouble median = 0;\\n\\t\\tif (sortedElements.size() % 2 == 0)\\n\\t\\t{\\n\\t\\t\\tmedian = (sortedElements.get(sortedElements.size() / 2).getData() + sortedElements.get(\\n\\t\\t\\t\\tsortedElements.size() / 2 - 1).getData()) / 2;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tmedian = sortedElements.get(sortedElements.size() / 2).getData();\\n\\t\\t}\\n\\t\\treturn median;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a50e43ec73015337408ec49058eba89\",\n \"score\": \"0.61208403\",\n \"text\": \"protected void rankMedianPosition(int rankValue,\\n\\t\\t\\tJGraphHierarchyModel model, int nextRankValue) {\\n\\t\\tJGraphHierarchyRank rankSet = (JGraphHierarchyRank) model.ranks\\n\\t\\t\\t\\t.get(new Integer(rankValue));\\n\\t\\tObject[] rank = rankSet.toArray();\\n\\t\\t// Form an array of the order in which the cell are to be processed\\n\\t\\t// , the order is given by the weighted sum of the in or out edges,\\n\\t\\t// depending on whether we're travelling up or down the hierarchy.\\n\\t\\tWeightedCellSorter[] weightedValues = new WeightedCellSorter[rank.length];\\n\\t\\tMap cellMap = new Hashtable(rank.length);\\n\\n\\t\\tfor (int i = 0; i < rank.length; i++) {\\n\\t\\t\\tJGraphAbstractHierarchyCell currentCell = (JGraphAbstractHierarchyCell) rank[i];\\n\\t\\t\\tweightedValues[i] = new WeightedCellSorter();\\n\\t\\t\\tweightedValues[i].cell = currentCell;\\n\\t\\t\\tweightedValues[i].rankIndex = i;\\n\\t\\t\\tcellMap.put(currentCell, weightedValues[i]);\\n\\t\\t\\tCollection nextLayerConnectedCells = null;\\n\\t\\t\\tif (nextRankValue < rankValue) {\\n\\t\\t\\t\\tnextLayerConnectedCells = currentCell\\n\\t\\t\\t\\t\\t\\t.getPreviousLayerConnectedCells(rankValue);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tnextLayerConnectedCells = currentCell\\n\\t\\t\\t\\t\\t\\t.getNextLayerConnectedCells(rankValue);\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Calcuate the weighing based on this node type and those this\\n\\t\\t\\t// node is connected to on the next layer\\n\\t\\t\\tweightedValues[i].weightedValue = calculatedWeightedValue(\\n\\t\\t\\t\\t\\tcurrentCell, nextLayerConnectedCells);\\n\\t\\t}\\n\\n\\t\\tArrays.sort(weightedValues);\\n\\t\\t// Set the new position of each node within the rank using\\n\\t\\t// its temp variable\\n\\t\\tfor (int i = 0; i < weightedValues.length; i++) {\\n\\t\\t\\tint numConnectionsNextLevel = 0;\\n\\t\\t\\tJGraphAbstractHierarchyCell cell = weightedValues[i].cell;\\n\\t\\t\\tObject[] nextLayerConnectedCells = null;\\n\\t\\t\\tint medianNextLevel = 0;\\n\\n\\t\\t\\tif (nextRankValue < rankValue) {\\n\\t\\t\\t\\tnextLayerConnectedCells = cell.getPreviousLayerConnectedCells(\\n\\t\\t\\t\\t\\t\\trankValue).toArray();\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tnextLayerConnectedCells = cell.getNextLayerConnectedCells(\\n\\t\\t\\t\\t\\t\\trankValue).toArray();\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (nextLayerConnectedCells != null) {\\n\\t\\t\\t\\tnumConnectionsNextLevel = nextLayerConnectedCells.length;\\n\\t\\t\\t\\tif (numConnectionsNextLevel > 0) {\\n\\t\\t\\t\\t\\tmedianNextLevel = medianXValue(nextLayerConnectedCells,\\n\\t\\t\\t\\t\\t\\t\\tnextRankValue);\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t// For case of no connections on the next level set the\\n\\t\\t\\t\\t\\t// median to be the current position and try to be\\n\\t\\t\\t\\t\\t// positioned there\\n\\t\\t\\t\\t\\tmedianNextLevel = cell.getGeneralPurposeVariable(rankValue);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tdouble leftBuffer = 0.0;\\n\\t\\t\\tdouble leftLimit = -100000000.0;\\n\\t\\t\\tfor (int j = weightedValues[i].rankIndex - 1; j >= 0;) {\\n\\t\\t\\t\\tWeightedCellSorter weightedValue = (WeightedCellSorter) cellMap\\n\\t\\t\\t\\t\\t\\t.get(rank[j]);\\n\\t\\t\\t\\tif (weightedValue != null) {\\n\\t\\t\\t\\t\\tJGraphAbstractHierarchyCell leftCell = weightedValue.cell;\\n\\t\\t\\t\\t\\tif (weightedValue.visited) {\\n\\t\\t\\t\\t\\t\\t// The left limit is the right hand limit of that\\n\\t\\t\\t\\t\\t\\t// cell\\n\\t\\t\\t\\t\\t\\t// plus any allowance for unallocated cells\\n\\t\\t\\t\\t\\t\\t// in-between\\n\\t\\t\\t\\t\\t\\tleftLimit = leftCell\\n\\t\\t\\t\\t\\t\\t\\t\\t.getGeneralPurposeVariable(rankValue)\\n\\t\\t\\t\\t\\t\\t\\t\\t+ leftCell.width\\n\\t\\t\\t\\t\\t\\t\\t\\t/ 2.0\\n\\t\\t\\t\\t\\t\\t\\t\\t+ intraCellSpacing\\n\\t\\t\\t\\t\\t\\t\\t\\t+ leftBuffer + cell.width / 2.0;\\n\\t\\t\\t\\t\\t\\t;\\n\\t\\t\\t\\t\\t\\tj = -1;\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tleftBuffer += leftCell.width + intraCellSpacing;\\n\\t\\t\\t\\t\\t\\tj--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tdouble rightBuffer = 0.0;\\n\\t\\t\\tdouble rightLimit = 100000000.0;\\n\\t\\t\\tfor (int j = weightedValues[i].rankIndex + 1; j < weightedValues.length;) {\\n\\t\\t\\t\\tWeightedCellSorter weightedValue = (WeightedCellSorter) cellMap\\n\\t\\t\\t\\t\\t\\t.get(rank[j]);\\n\\t\\t\\t\\tif (weightedValue != null) {\\n\\t\\t\\t\\t\\tJGraphAbstractHierarchyCell rightCell = weightedValue.cell;\\n\\t\\t\\t\\t\\tif (weightedValue.visited) {\\n\\t\\t\\t\\t\\t\\t// The left limit is the right hand limit of that\\n\\t\\t\\t\\t\\t\\t// cell\\n\\t\\t\\t\\t\\t\\t// plus any allowance for unallocated cells\\n\\t\\t\\t\\t\\t\\t// in-between\\n\\t\\t\\t\\t\\t\\trightLimit = rightCell\\n\\t\\t\\t\\t\\t\\t\\t\\t.getGeneralPurposeVariable(rankValue)\\n\\t\\t\\t\\t\\t\\t\\t\\t- rightCell.width\\n\\t\\t\\t\\t\\t\\t\\t\\t/ 2.0\\n\\t\\t\\t\\t\\t\\t\\t\\t- intraCellSpacing\\n\\t\\t\\t\\t\\t\\t\\t\\t- rightBuffer - cell.width / 2.0;\\n\\t\\t\\t\\t\\t\\tj = weightedValues.length;\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\trightBuffer += rightCell.width + intraCellSpacing;\\n\\t\\t\\t\\t\\t\\tj++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (medianNextLevel >= leftLimit && medianNextLevel <= rightLimit) {\\n\\t\\t\\t\\tcell\\n\\t\\t\\t\\t\\t\\t.setGeneralPurposeVariable(rankValue,\\n\\t\\t\\t\\t\\t\\t\\t\\t(int) medianNextLevel);\\n\\t\\t\\t} else if (medianNextLevel < leftLimit) {\\n\\t\\t\\t\\t// Couldn't place at median value, place as close to that\\n\\t\\t\\t\\t// value as possible\\n\\t\\t\\t\\tcell.setGeneralPurposeVariable(rankValue, (int) leftLimit);\\n\\t\\t\\t\\tcurrentXDelta += leftLimit - medianNextLevel;\\n\\t\\t\\t} else if (medianNextLevel > rightLimit) {\\n\\t\\t\\t\\t// Couldn't place at median value, place as close to that\\n\\t\\t\\t\\t// value as possible\\n\\t\\t\\t\\tcell.setGeneralPurposeVariable(rankValue, (int) rightLimit);\\n\\t\\t\\t\\tcurrentXDelta += medianNextLevel - rightLimit;\\n\\t\\t\\t}\\n\\n\\t\\t\\tweightedValues[i].visited = true;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81315ae8864173b7224fef9be301b2d1\",\n \"score\": \"0.61152875\",\n \"text\": \"public int findMedian() {\\n\\t\\tfindIthSmallest(0, getSet().length - 1, getSet().length / 2);\\r\\n\\t\\t\\r\\n\\t\\treturn getSet()[getSet().length / 2]; // Returning median.\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44a71c40cbb89051f3f9539c9068de46\",\n \"score\": \"0.6015051\",\n \"text\": \"@Override\\n public double quickMedian() {\\n return getStatistics().getMedian();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e36e06c73506237b392aa6bb49203ce\",\n \"score\": \"0.59067804\",\n \"text\": \"public double findMedian() {\\n if (maxHeap.size() == minHeap.size())\\n return (maxHeap.peek() + minHeap.peek()) / 2.0;\\n else\\n return maxHeap.peek();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c13271f5ce016904de6efd58ee628d4\",\n \"score\": \"0.5894015\",\n \"text\": \"public double findMedian() {\\n\\t\\tif (maxHeap.size() == minHeap.size())\\n\\t\\t\\treturn (maxHeap.peek() + minHeap.peek()) / 2.0;\\n\\t\\telse\\n\\t\\t\\treturn maxHeap.peek();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4808acebc42f27024c7a4418f6cb9854\",\n \"score\": \"0.589123\",\n \"text\": \"public double findMedian() {\\n return median;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4808acebc42f27024c7a4418f6cb9854\",\n \"score\": \"0.589123\",\n \"text\": \"public double findMedian() {\\n return median;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d15d621d555a94822564fcd14e59388\",\n \"score\": \"0.5856021\",\n \"text\": \"public double[] medianSlidingWindow(int[] nums, int k) {\\n PriorityQueue<Integer> leftHeap = new PriorityQueue<Integer>(Collections.<Integer>reverseOrder());\\n PriorityQueue<Integer> rightHeap = new PriorityQueue<Integer>();\\n double[] result = new double[nums.length-k+1];\\n int resultIdx = 0;\\n for(int i = 0; i < nums.length; i++) {\\n if(i >= k) {\\n // calculate median\\n if (leftHeap.contains(nums[i-k])) {\\n leftHeap.remove(nums[i-k]);\\n } else if (rightHeap.contains(nums[i-k])) {\\n rightHeap.remove(nums[i-k]);\\n }\\n }\\n if (leftHeap.size() <= rightHeap.size()) {\\n if (rightHeap.isEmpty() || nums[i] <= rightHeap.peek()) {\\n leftHeap.add(nums[i]);\\n } else {\\n leftHeap.add(rightHeap.peek());\\n int tmp = rightHeap.peek();\\n rightHeap.remove(tmp);\\n rightHeap.add(nums[i]);\\n }\\n } else {\\n if (nums[i] > leftHeap.peek()) {\\n rightHeap.add(nums[i]);\\n } else {\\n int tmp = leftHeap.peek();\\n rightHeap.add(tmp);\\n leftHeap.remove(tmp);\\n leftHeap.add(nums[i]);\\n }\\n }\\n if (i >= (k-1)) {\\n if (k % 2 == 1) {\\n result[resultIdx] = leftHeap.peek();\\n } else {\\n result[resultIdx] = ((double)(leftHeap.peek()) + (double)(rightHeap.peek()))/2.0;\\n }\\n resultIdx++;\\n }\\n }\\n return result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e702c91c6490cf1148feacf02d4c5862\",\n \"score\": \"0.5823711\",\n \"text\": \"public double findMedian() {\\n return larger.size()>smaller.size()?larger.peek():(larger.peek()-smaller.peek())/2.0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d74878c6a946ba6490d2a016f8a23cc5\",\n \"score\": \"0.57573587\",\n \"text\": \"public int median() {\\n if (lower.size() >= upper.size()) {\\n return lower.max();\\n } else {\\n return upper.min();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cfd1d40c49c10ead9610868e69ac406b\",\n \"score\": \"0.5751298\",\n \"text\": \"public double findMedian() {\\n if ((minH.size()==0)&&(maxH.size()==0)) return 0.0;\\n if ((minH.size())>(maxH.size())) return (double)(minH.peek());\\n if ((minH.size())<(maxH.size())) return (double)(maxH.peek());\\n return ((double)(maxH.peek()+minH.peek()))/2.0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3545f429291e8542c6ec95b781a54339\",\n \"score\": \"0.57509804\",\n \"text\": \"private int median3(Integer[] a, int i, int j, int k) {\\n return (less(a[i], a[j]) ?\\n (less(a[j], a[k]) ? j : less(a[i], a[k]) ? k : i) :\\n (less(a[k], a[j]) ? j : less(a[k], a[i]) ? k : i));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d23bfb5409452106c56f8f98c2b7189\",\n \"score\": \"0.5738596\",\n \"text\": \"public int median()//modify\\r\\n\\t{\\r\\n\\t\\tint median = 0 ;\\r\\n\\t\\tint midIndex = 0;\\r\\n\\t\\t\\r\\n\\t\\tif (count == 0)\\r\\n\\t\\t\\tmedian = -1;\\r\\n\\t\\t\\r\\n\\t\\telse \\r\\n\\t\\t{\\r\\n\\t\\t\\tif (count % 2 == 0)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tmidIndex = count / 2;\\r\\n\\t\\t\\t\\tmedian = (numArray[midIndex - 1] + numArray [midIndex]) / 2;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif (debug)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tSystem.out.print(\\\"\\\\n midIndex = \\\" + midIndex);\\r\\n\\t\\t\\t\\t\\tSystem.out.print(\\\"\\\\n middle numbers are => \\\" + numArray[midIndex - 1] + \\\" and \\\" + numArray[midIndex] );\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tmidIndex = (count + 1) / 2;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif (debug)\\r\\n\\t\\t\\t\\t\\tSystem.out.print(\\\"\\\\n midIndex = \\\" + midIndex);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tmedian = numArray[midIndex - 1] ;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn median ;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c896579724848d77ba837612cc32bb3\",\n \"score\": \"0.57339317\",\n \"text\": \"public int kthSmallest(TreeNode root, int k) {\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a162b9f0249d043252ebd0ce2615bf6\",\n \"score\": \"0.5698768\",\n \"text\": \"public void insert(int newKey) {\\n\\n int t = c.length / 2;\\n int i = n - 1;\\n if (isLeaf) {\\n while ((i >= 0) && (newKey < key[i])) { // Shift key greater than newKey to left\\n key[i + 1] = key[i];\\n i--;\\n }\\n n++; // Update number of keys in node\\n key[i + 1] = newKey; // Insert new key\\n } else {\\n while ((i >= 0) && (newKey < key[i])) {\\n i--;\\n }\\n int insertChild = i + 1; // Subtree where new key must be inserted\\n if (c[insertChild].isFull()) {\\n // The root of the subtree where new key will be inserted has to be split\\n // We promote the median of that root to the current node and\\n // update keys and references accordingly\\n\\n // Debugging code\\n // System.out.println(\\\"This is the full node we're going to break \\\");\\n // c[insertChild].printNodes();\\n // System.out.println(\\\"going to promote \\\" + c[insertChild].key[T-1]);\\n n++;\\n c[n] = c[n - 1];\\n for (int j = n - 1; j > insertChild; j--) {\\n c[j] = c[j - 1];\\n key[j] = key[j - 1];\\n }\\n key[insertChild] = c[insertChild].key[t - 1];\\n c[insertChild].n = t - 1;\\n\\n BTreeNode newNode = new BTreeNode(t);\\n for (int k = 0; k < t - 1; k++) {\\n newNode.c[k] = c[insertChild].c[k + t];\\n newNode.key[k] = c[insertChild].key[k + t];\\n }\\n\\n newNode.c[t - 1] = c[insertChild].c[2 * t - 1];\\n newNode.n = t - 1;\\n newNode.isLeaf = c[insertChild].isLeaf;\\n c[insertChild + 1] = newNode;\\n\\n if (newKey < key[insertChild]) {\\n c[insertChild].insert(newKey);\\n } else {\\n c[insertChild + 1].insert(newKey);\\n }\\n } else\\n c[insertChild].insert(newKey); //No need to split node\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b22c5db745d69963f158fc589a708441\",\n \"score\": \"0.56924665\",\n \"text\": \"public double findMedian() {\\n if (higher.size() == lower.size()) {\\n return (double) (higher.peek() + lower.peek()) / 2;\\n } else {\\n return higher.peek();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68f08eda6f96b587f897add5a8dd1fec\",\n \"score\": \"0.5677778\",\n \"text\": \"public int findMedianWithMOT() {\\n\\t\\tfindIthSmallestWithMOT(0, getSet().length - 1, getSet().length / 2); \\r\\n\\t\\t\\r\\n\\t\\treturn getSet()[0]; // Returning median.\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8749c348e663429e3f5b9a4890ec8a79\",\n \"score\": \"0.5677554\",\n \"text\": \"private static int median5(double[] a, int i, int j, int k, int l, int m) {\\n Map<Comparable, Integer> map = new HashMap<>();\\n map.put(a[i], i);\\n map.put(a[j], j);\\n map.put(a[k], k);\\n map.put(a[l], l);\\n map.put(a[m], m);\\n\\n Comparable[] median = new Comparable[5];\\n median[0] = a[i];\\n median[1] = a[j];\\n median[2] = a[k];\\n median[3] = a[l];\\n median[4] = a[m];\\n\\n MergeSort.sortTD(median);\\n\\n return map.get(median[2]);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de197c3026cb879293ab9b60fddd7b54\",\n \"score\": \"0.56737316\",\n \"text\": \"public static double computeMedian(int num) {\\n\\t\\t// adding the number to proper heap\\n\\t\\tif (num >= upperQueue.peek())\\n\\t\\t\\tupperQueue.add(num);\\n\\t\\telse\\n\\t\\t\\tlowerQueue.add(num);\\n\\t\\t// balancing the heaps\\n\\t\\tif (upperQueue.size() - lowerQueue.size() == 2)\\n\\t\\t\\tlowerQueue.add(upperQueue.poll());\\n\\t\\telse if (lowerQueue.size() - upperQueue.size() == 2)\\n\\t\\t\\tupperQueue.add(lowerQueue.poll());\\n\\t\\t// returning the median\\n\\t\\tif (upperQueue.size() == lowerQueue.size())\\n\\t\\t\\treturn (upperQueue.peek() + lowerQueue.peek()) / 2.0;\\n\\t\\telse if (upperQueue.size() > lowerQueue.size())\\n\\t\\t\\treturn upperQueue.peek();\\n\\t\\telse\\n\\t\\t\\treturn lowerQueue.peek();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d97ec33bbea464f400049dfeb592826e\",\n \"score\": \"0.5669304\",\n \"text\": \"private static long getMedian(SortedSet<Long> set) {\\n int i = 0;\\n int middle = set.size() / 2;\\n for (Long point : set) {\\n if (i == middle) {\\n return point;\\n }\\n i++;\\n }\\n throw new IllegalArgumentException(\\\"Cannot calculate median of empty set.\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eda0c98d1ac7b9c148eb0bf5df88a9d0\",\n \"score\": \"0.5654989\",\n \"text\": \"public int kthSmallest(TreeNode root, int k) {\\n //inorder traversal and count k\\n int count = 0;\\n\\n Stack<TreeNode> stack = new Stack<>();\\n TreeNode next = root;\\n while (next != null || !stack.empty()) {\\n if (next != null) {\\n stack.push(next);\\n next = next.left;\\n } else {\\n TreeNode node = stack.pop();\\n if (++count == k)\\n return node.val;\\n next = node.right;\\n }\\n\\n }\\n\\n\\n return -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1887962ea34d1beb72d30048a106b998\",\n \"score\": \"0.5646821\",\n \"text\": \"public int rank(Key key)\\r\\n {\\r\\n int lo = 0;\\r\\n int hi = n - 1;\\r\\n while(lo <= hi)\\r\\n {\\r\\n int mid = lo + (hi - lo)/2;\\r\\n int compare = key.compareTo(keys[mid]);\\r\\n if(compare < 0)\\r\\n hi = mid - 1;\\r\\n else if(compare > 0)\\r\\n lo = mid + 1;\\r\\n else\\r\\n return mid;\\r\\n }\\r\\n return lo;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d3113c9771f334a7535f2c5c236dda6\",\n \"score\": \"0.56409186\",\n \"text\": \"public double findMedian() {\\n if (leftMax.size() == rightMin.size()) return (leftMax.peek() + rightMin.peek()) / 2.0;\\n return leftMax.peek();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f51ea3487db74ae21a3e4623f81e1948\",\n \"score\": \"0.5620451\",\n \"text\": \"public double findMedian() {\\n if (isEven) {\\n return (large.peek() + small.peek()) / 2.0; //2.0 as we need to return a double\\n } else {\\n return large.peek();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb0bd252772a5c8c31de108186044e2a\",\n \"score\": \"0.5576507\",\n \"text\": \"public int[] medianII(int[] nums) {\\n\\n TreeMap<Integer, Integer> minHeap = new TreeMap<>();\\n TreeMap<Integer, Integer> maxHeap = new TreeMap<>(Collections.reverseOrder());\\n int minSize = 0, maxSize = 0 ;\\n int[] res = new int[nums.length];\\n int index = 0;\\n for(Integer cur:nums){\\n int minHeapTop = minHeap.firstEntry()==null? Integer.MIN_VALUE: minHeap.firstKey();\\n int maxHeapTop = maxHeap.firstEntry()==null? Integer.MAX_VALUE: maxHeap.firstKey();\\n\\n if(cur<=maxHeapTop){\\n if(maxHeap.containsKey(cur)){\\n maxHeap.put(cur,maxHeap.get(cur)+1);\\n }else{\\n maxHeap.put(cur,1);\\n }\\n maxSize++;\\n }else{\\n if(minHeap.containsKey(cur)){\\n minHeap.put(cur,minHeap.get(cur)+1);\\n }else{\\n minHeap.put(cur,1);\\n }\\n minSize++;\\n\\n }\\n\\n if(maxSize-1>minSize){\\n heapTransfer(maxHeap,minHeap);\\n maxSize--;\\n minSize++;\\n }else if(minSize-1>maxSize){\\n heapTransfer(minHeap,maxHeap);\\n minSize--;\\n maxSize++;\\n }\\n if(maxSize == minSize){\\n res[index++] = maxHeap.firstKey();\\n }else{\\n if(minSize == 0){\\n res[index++] = maxHeap.firstKey();\\n }else{\\n res[index++] = minSize>maxSize? minHeap.firstKey():maxHeap.firstKey();\\n }\\n }\\n }\\n return res;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"015d65f3181c9a8dace20730ce7702ed\",\n \"score\": \"0.5574935\",\n \"text\": \"public double findMedian() {\\n return large.size() > small.size() ? large.peek() :\\n large.size() < small.size() ? small.peek() :\\n (large.peek() + small.peek()) / 2.0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"feff4cdfb7875ef5be8ce186fc1266a4\",\n \"score\": \"0.5533382\",\n \"text\": \"private static int median3(double[] a, int i, int j, int k) {\\n return (less(a[i], a[j]) ?\\n (less(a[j], a[k]) ? j : less(a[i], a[k]) ? k : i) :\\n (less(a[k], a[j]) ? j : less(a[k], a[i]) ? k : i));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07dee846dda79d1b79b4eacadf827703\",\n \"score\": \"0.55212235\",\n \"text\": \"public int kthSmallestElement(int lower, int upper, int k) {\\n \\n // index of the lower partition value\\n int idxPartition = partition(lower, upper);\\n \\n // indicated that the partition/pivot is the median index\\n if(idxPartition == k) {\\n \\n // returns the median value\\n return a[idxPartition];\\n \\n // indicated that the lower half contains the median index\\n } else if(idxPartition > k) {\\n \\n // runs with the new upper bound set to the previous pivot\\n return kthSmallestElement(0, idxPartition-1, k);\\n \\n // indicates that the upper half contains the median index\\n } else {\\n \\n // runs with the new lower bound\\n return kthSmallestElement(idxPartition+1, n-1, k);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f6315284af3a29dd951d1351d751734e\",\n \"score\": \"0.5517278\",\n \"text\": \"public MedianFinder() {\\n this.left_heap = new PriorityQueue<>(new Comparator<Integer>() {\\n @Override\\n public int compare(Integer o1, Integer o2) {\\n return o2 - o1;\\n }\\n });\\n this.right_heap = new PriorityQueue<>();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69b21b48b4b0445002fd51eb683762a2\",\n \"score\": \"0.5503339\",\n \"text\": \"private static Integer median(List<Integer> elements) {\\n sortOnIndex(elements, 0, 1);\\n // makes c<d\\n sortOnIndex(elements, 2, 4);\\n\\n // eliminate the lowest -- comparing c<a\\n if (elements.get(2) < elements.get(0)) {\\n // swapping b and d\\n swapOnIndex(elements, 1, 4);\\n // making c = a\\n elements.set(2, elements.get(0));\\n }\\n\\n // getting in e now\\n elements.set(0, elements.get(4));\\n\\n //making a<b\\n sortOnIndex(elements, 0, 1);\\n\\n // eliminate another lowest -- comparing a<c\\n // remaining a, b, d\\n if (elements.get(0) < elements.get(2)) {\\n // swapping b and d\\n swapOnIndex(elements, 1, 4);\\n // making a = c\\n elements.set(0, elements.get(2));\\n }\\n\\n // comparing d and a\\n if (elements.get(3) < elements.get(0)) {\\n // returning d\\n return elements.get(3);\\n }\\n\\n // returning a\\n return elements.get(0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4ac40a56418571662dcda7a9e2727c3\",\n \"score\": \"0.54979146\",\n \"text\": \"private static void findMedianForFile(String filename)\\n {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67c265f4e2d227cc55dc49c73cd3db8c\",\n \"score\": \"0.5497274\",\n \"text\": \"public double findMedian() {\\n\\t if (max.size() == min.size()) return (max.peek() + min.peek()) / 2.0;\\n\\t else return max.peek();\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e29689ecfccd13b8fb7af17e42f48d99\",\n \"score\": \"0.54950297\",\n \"text\": \"private static int median3(double[] a, int i, int j, int k) {\\n return (less(a[i], a[j]) ?\\n (less(a[j], a[k]) ? j : less(a[i], a[k]) ? k : i) :\\n (less(a[k], a[j]) ? j : less(a[k], a[i]) ? k : i));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a2fb1b4a9576e6976be8689fc1f428f\",\n \"score\": \"0.54650426\",\n \"text\": \"private int medianXValue(Object[] connectedCells, int rankValue) {\\n\\t\\tif (connectedCells.length == 0) {\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tint[] medianValues = new int[connectedCells.length];\\n\\t\\tfor (int i = 0; i < connectedCells.length; i++) {\\n\\t\\t\\tmedianValues[i] = ((JGraphAbstractHierarchyCell) connectedCells[i])\\n\\t\\t\\t\\t\\t.getGeneralPurposeVariable(rankValue);\\n\\t\\t}\\n\\t\\tArrays.sort(medianValues);\\n\\t\\tif (connectedCells.length % 2 == 1) {\\n\\t\\t\\t// For odd numbers of adjacent vertices return the median\\n\\t\\t\\treturn medianValues[connectedCells.length / 2];\\n\\t\\t} else {\\n\\t\\t\\tint medianPoint = connectedCells.length / 2;\\n\\t\\t\\tint leftMedian = medianValues[medianPoint - 1];\\n\\t\\t\\tint rightMedian = medianValues[medianPoint];\\n\\t\\t\\treturn ((leftMedian + rightMedian) / 2);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9e61e358b8db45a15968eeaf69cf7ca\",\n \"score\": \"0.5461258\",\n \"text\": \"static void findMedian(String a[],int x[], int count) {\\r\\n \\t//List<Integer> medianList = new ArrayList<Integer>();\\r\\n \\tint removeCount = 0;\\r\\n \\tint addCount = 0;\\r\\n \\t\\r\\n \\tfor(int i=0;i<count;i++) {\\r\\n \\t\\tif (a[i].equals(\\\"a\\\")) {\\r\\n \\t\\t\\tMedian.Insert(x[i]);;\\r\\n \\t\\t\\taddCount = Median.getListSize();\\r\\n \\t\\t\\tif (addCount == 1) {\\r\\n \\t\\t\\t\\tSystem.out.println(Median.getNodeInfo(addCount-1));\\r\\n \\t\\t\\t} else if (addCount > 1) {\\r\\n \\t\\t\\t\\treturnMedianValue(addCount);\\r\\n \\t\\t\\t\\t//System.out.println(addMedian);\\r\\n \\t\\t\\t}\\r\\n \\t\\t} else {\\r\\n \\t\\t\\tif (Median.isInfopresent(x[i])) {\\r\\n \\t\\t\\t\\tMedian.removeInfo(x[i]);\\r\\n \\t\\t\\t\\tremoveCount = Median.getListSize();\\r\\n \\t\\t\\t\\tif (removeCount == 0) {\\r\\n \\t\\t\\t\\t\\tSystem.out.println(\\\"Wrong!\\\");\\r\\n \\t\\t\\t\\t}\\r\\n \\t\\t\\t\\telse if (removeCount == 1) {\\r\\n \\t\\t\\t\\t\\tSystem.out.println(Median.getNodeInfo(removeCount-1));\\r\\n \\t\\t\\t\\t} else if (removeCount>1) {\\r\\n \\t\\t\\t\\t\\t//call your method here and return median;return the index of mid\\r\\n \\t\\t\\t\\t\\treturnMedianValue(removeCount);\\r\\n \\t\\t\\t\\t\\t//System.out.println(removeMedian);\\r\\n \\t\\t\\t\\t}\\r\\n \\t\\t\\t} else {\\r\\n \\t\\t\\t\\tSystem.out.println(\\\"Wrong!\\\");\\r\\n \\t\\t\\t}\\r\\n \\t\\t}\\r\\n \\t}\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3574bd03c510e470058a4bcbdbf9e984\",\n \"score\": \"0.5443534\",\n \"text\": \"private static float getMedian(List<Float> values, int mid_element,\\n\\t\\t\\tint start, int end) {\\n\\t\\tif (end - start < 1)\\n\\t\\t\\treturn -1f;\\n\\t\\telse if (end - start == 1)\\n\\t\\t\\treturn values.get(start);\\n\\n\\t\\tint random_ind = start + (int) (Math.random() * (end - start));\\n\\t\\tfloat temp = values.get(start);\\n\\t\\tvalues.set(start, values.get(random_ind));\\n\\t\\tvalues.set(random_ind, temp);\\n\\t\\tint index = partition(values, start, end);\\n\\t\\tif (index == mid_element) {\\n\\t\\t\\tmedian = values.get(index);\\n\\t\\t} else if (index < mid_element) {\\n\\t\\t\\tmedian = getMedian(values, mid_element, index + 1, end);\\n\\t\\t} else {\\n\\n\\t\\t\\tmedian = getMedian(values, mid_element, start, index);\\n\\t\\t}\\n\\t\\treturn median;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"387e7566c984de69db70f9f2644aee74\",\n \"score\": \"0.5434695\",\n \"text\": \"public double getMedian(int[] data){//WORKING CORRECTLY\\n\\tif(data.length==0){return -1;}\\n\\tif(data.length==1){return data[0];}\\n\\tint[] tempdata = heapsort(data);\\n\\tint datalength = tempdata.length;\\n\\tdouble retval = 0;\\n\\tif(datalength%2==1){\\n\\t retval = tempdata[(int)(datalength/2)];\\n\\t}else{\\n\\t retval = (tempdata[(int)(datalength/2)]+tempdata[(int)(datalength/2)-1])/2;\\n\\t}\\n\\treturn retval;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6aea35ce96f07f64235ce921706e9d7\",\n \"score\": \"0.5403246\",\n \"text\": \"public static int median(int[] a){\\n\\t\\tint median = Integer.MAX_VALUE;\\n\\t\\tint left = 0, right = a.length-1;\\n\\t\\tint mIndex = a.length/2;\\n\\t\\twhile(true){\\n\\t\\t\\tint pos = partition(a, left, right);\\n\\t\\t\\tif(pos == mIndex){\\n\\t\\t\\t\\tmedian = a[pos];\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}else if(pos > mIndex){\\n\\t\\t\\t\\tright = pos -1;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tleft = pos+1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn mIndex;\\n\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51a419deaef0d3dab9312d866b1bb839\",\n \"score\": \"0.5399707\",\n \"text\": \"public double findMedian() {\\n if (maxq.size()==minq.size()){\\n return med;\\n }else{\\n \\treturn (med + minq.peek())/2.0;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c9d7045459fdb857da519769318aafe\",\n \"score\": \"0.53868955\",\n \"text\": \"public int kthSmallest(TreeNode root, int k) {\\n Stack<TreeNode> stack = new Stack<TreeNode>();\\n TreeNode p = root;\\n int count = 0;\\n\\n while(!stack.isEmpty() || p != null) {\\n if(p != null) {\\n stack.push(p); // Just like recursion\\n p = p.left;\\n\\n } else {\\n TreeNode node = stack.pop();\\n if(++count == k) return node.val;\\n p = node.right;\\n }\\n }\\n\\n return Integer.MIN_VALUE;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46d2a72f8fc49985936dd453076e0d8b\",\n \"score\": \"0.53751254\",\n \"text\": \"private void calculateMedianWeightOfMales(){\\n\\t\\t//Copy the weight of males into males array\\n\\t\\tdouble[] males = new double[numberMales];\\n\\t\\tint k=0;\\n\\t\\tfor(int i=numberFemales; i<spiders.length; i++){\\n\\t\\t\\tmales[k] = spiders[i].getWeight();\\n\\t\\t\\tk++;\\n\\t\\t}\\n\\t\\t\\n\\t\\t//Calculate the median position\\n\\t\\tint medianPos = (0 + numberMales-1) / 2;\\n\\t\\t\\n\\t\\t//Calculate the median value\\t\\t\\n\\t\\tint begin, end, p, r, i;\\n\\t\\tdouble pivot;\\n\\t\\t\\n\\t\\tbegin = 0;\\n\\t\\tend = numberMales-1;\\n\\t\\t\\n\\t\\twhile(true){\\n\\t\\t\\tp = begin;\\n\\t\\t\\tr = end;\\n\\t\\t\\tpivot = males[r];\\n\\t\\t\\ti = p-1;\\n\\t\\t\\tfor(int j=p; j<r; j++){\\n\\t\\t\\t\\tif (males[j] < pivot){\\n\\t\\t\\t\\t\\ti++;\\n\\t\\t\\t\\t\\t//swap males[i] and males[j]\\n\\t\\t\\t\\t\\tdouble tmp = males[i];\\n\\t\\t\\t\\t\\tmales[i] = males[j];\\n\\t\\t\\t\\t\\tmales[j] = tmp;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t//swap males[i+1] and males[r]\\n\\t\\t\\tdouble tmp = males[i+1];\\n\\t\\t\\tmales[i+1] = males[r];\\n\\t\\t\\tmales[r] = tmp;\\n\\t\\t\\t\\n\\t\\t\\tif (i+1 == medianPos){\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tif (medianPos > i+1){\\n\\t\\t\\t\\t\\t//search right\\n\\t\\t\\t\\t\\tbegin = i+2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t//search left\\n\\t\\t\\t\\t\\tend = i;\\n\\t\\t\\t\\t}\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tmedianWeight = males[medianPos];\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7554da77d7b538b044cb92498743d51\",\n \"score\": \"0.5367043\",\n \"text\": \"public int kthSmallest(TreeNode root, int k) {\\n\\n Stack<TreeNode> stack = new Stack<>();\\n ArrayList<Integer> result = new ArrayList<>();\\n\\n while(!stack.isEmpty() || root != null){\\n while (root !=null){\\n stack.push(root);\\n root = root.left;\\n }\\n if(!stack.isEmpty()){\\n root = stack.pop();\\n result.add(root.val);\\n root = root.right;\\n }\\n\\n }\\n return result.get(k-1);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a95a1c6862b95f72395c4db79f06744a\",\n \"score\": \"0.53641725\",\n \"text\": \"@Override\\n public double getMedian() {\\n return getStatistics().getMedian();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11c6332c6b673fd65d61311251efb0dc\",\n \"score\": \"0.53501093\",\n \"text\": \"public int kthSmallest1(TreeNode root, int k) {\\n\\t\\tStack<TreeNode> nodes = new Stack<>();\\n\\t\\tint count = 0;\\n\\t\\twhile (root != null || !nodes.isEmpty()) {\\n\\t\\t\\twhile (root != null) {\\n\\t\\t\\t\\tnodes.push(root);\\n\\t\\t\\t\\troot = root.left;\\n\\t\\t\\t}\\n\\t\\t\\t++count;\\n\\t\\t\\tif (!nodes.isEmpty()) {\\n\\t\\t\\t\\troot = nodes.pop();\\n\\t\\t\\t\\tif (count == k) {\\n\\t\\t\\t\\t\\treturn root.val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\troot = root.right;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"198c238372567a592b7e5fdd56c84cd5\",\n \"score\": \"0.5339274\",\n \"text\": \"public static double median(int[] array, int size){\\n\\t\\tArrays.sort(array);\\r\\n\\t if(size%2 == 0){\\r\\n\\t\\t\\tdouble averageMedian = ((double)array[size/2-1] + ((double)array[size/2])) / 2;\\t\\t//if there is an even amount of numbers in the array, take the two middle numbers and divide by 2\\r\\n\\t\\t\\treturn averageMedian;\\r\\n\\t\\t}else{\\r\\n\\t\\t return array[array.length/2];\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//if there is an off amount of numbers in the array, return the middle number\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c081f7ccbc764c21fdd0cad06ecc6f6c\",\n \"score\": \"0.5325644\",\n \"text\": \"public int rank(int k)\\n\\t{\\n\\t\\tRBNode currentNode = this.findGEQNode(k);\\n\\t\\tif (currentNode == null) // Either tree is empty or there is no GEQ node\\n\\t\\t\\t// - k is bigger or equal to every key in\\n\\t\\t\\t// the tree\\n\\t\\t\\treturn this.size();\\n\\t\\tint total = 0;\\n\\t\\tboolean shouldAdd = true;\\n\\t\\twhile (currentNode != this.sentinel)\\n\\t\\t{\\n\\t\\t\\tif (shouldAdd && currentNode.left != null)\\n\\t\\t\\t\\ttotal += currentNode.left.getSize();\\n\\t\\t\\tshouldAdd = this.isRightChild(currentNode);\\n\\t\\t\\tcurrentNode = currentNode.parent;\\n\\t\\t}\\n\\t\\treturn total;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"acf72c470a73aa01877a229821bb1a9d\",\n \"score\": \"0.532343\",\n \"text\": \"public static int kthSmallest(BinaryTreeNode root, int k) {\\n\\t\\tif(root==null)\\n\\t\\t\\treturn -1;\\n\\t\\tStack<BinaryTreeNode> stack=new Stack<>();\\n\\t\\tBinaryTreeNode current=root;\\n\\t\\twhile(current!=null) {\\n\\t\\t\\tstack.push(current);\\n\\t\\t\\tcurrent=current.getLeftNode();\\n\\t\\t}\\n\\t\\twhile(!stack.isEmpty()) {\\n\\t\\t\\tBinaryTreeNode curr=stack.pop();\\n\\t\\t\\tk--;\\n\\t\\t\\tif(k==0) {\\n\\t\\t\\t\\treturn curr.getData();\\n\\t\\t\\t}\\n\\t\\t\\tif(curr.getRightNode()!=null) {\\n\\t\\t\\tcurr=curr.getRightNode();\\n\\t\\t\\twhile(curr!=null) {\\n\\t\\t\\t\\tstack.push(curr);\\n\\t\\t\\t\\tcurr=curr.getLeftNode();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t}\\n\\t\\treturn -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"18d770b2cb0ecb04522a87b3a46a5e5c\",\n \"score\": \"0.532156\",\n \"text\": \"private void minNode(JGraphHierarchyModel model) {\\n\\t\\t// Queue all nodes\\n\\t\\tLinkedList nodeList = new LinkedList();\\n\\t\\t// Need to be able to map from cell to cellWrapper\\n\\t\\tMap map = new Hashtable();\\n\\t\\tObject[][] rank = new Object[model.maxRank + 1][];\\n\\t\\tfor (int i = 0; i <= model.maxRank; i++) {\\n\\t\\t\\tJGraphHierarchyRank rankSet = (JGraphHierarchyRank) model.ranks\\n\\t\\t\\t\\t\\t.get(new Integer(i));\\n\\t\\t\\trank[i] = rankSet.toArray();\\n\\t\\t\\tfor (int j = 0; j < rank[i].length; j++) {\\n\\t\\t\\t\\t// Use the weight to store the rank and visited to store whether\\n\\t\\t\\t\\t// or not the cell is in the list\\n\\t\\t\\t\\tJGraphAbstractHierarchyCell cell = (JGraphAbstractHierarchyCell) rank[i][j];\\n\\t\\t\\t\\tWeightedCellSorter cellWrapper = new WeightedCellSorter(cell, i);\\n\\t\\t\\t\\tcellWrapper.rankIndex = j;\\n\\t\\t\\t\\tcellWrapper.visited = true;\\n\\t\\t\\t\\tnodeList.add(cellWrapper);\\n\\t\\t\\t\\tmap.put(cell, cellWrapper);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// Set a limit of the maximum number of times we will access the queue\\n\\t\\t// in case a loop appears\\n\\t\\tint maxTries = nodeList.size() * 10;\\n\\t\\tint count = 0;\\n\\t\\t// Don't move cell within this value of their median\\n\\t\\tint tolerance = 1;\\n\\t\\twhile (!nodeList.isEmpty() && count <= maxTries) {\\n\\t\\t\\tWeightedCellSorter cellWrapper = (WeightedCellSorter) nodeList\\n\\t\\t\\t\\t\\t.getFirst();\\n\\t\\t\\tJGraphAbstractHierarchyCell cell = cellWrapper.cell;\\n\\t\\t\\tint rankValue = cellWrapper.weightedValue;\\n\\t\\t\\tint rankIndex = cellWrapper.rankIndex;\\n\\t\\t\\tObject[] nextLayerConnectedCells = cell.getNextLayerConnectedCells(\\n\\t\\t\\t\\t\\trankValue).toArray();\\n\\t\\t\\tObject[] previousLayerConnectedCells = cell\\n\\t\\t\\t\\t\\t.getPreviousLayerConnectedCells(rankValue).toArray();\\n\\t\\t\\tint numNextLayerConnected = nextLayerConnectedCells.length;\\n\\t\\t\\tint numPreviousLayerConnected = previousLayerConnectedCells.length;\\n\\n\\t\\t\\tint medianNextLevel = medianXValue(nextLayerConnectedCells,\\n\\t\\t\\t\\t\\trankValue + 1);\\n\\t\\t\\tint medianPreviousLevel = medianXValue(previousLayerConnectedCells,\\n\\t\\t\\t\\t\\trankValue - 1);\\n\\n\\t\\t\\tint numConnectedNeighbours = numNextLayerConnected\\n\\t\\t\\t\\t\\t+ numPreviousLayerConnected;\\n\\t\\t\\tint currentPosition = cell.getGeneralPurposeVariable(rankValue);\\n\\t\\t\\tdouble cellMedian = currentPosition;\\n\\t\\t\\tif (numConnectedNeighbours > 0) {\\n\\t\\t\\t\\tcellMedian = (medianNextLevel * numNextLayerConnected + medianPreviousLevel\\n\\t\\t\\t\\t\\t\\t* numPreviousLayerConnected)\\n\\t\\t\\t\\t\\t\\t/ numConnectedNeighbours;\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Flag storing whether or not position has changed\\n\\t\\t\\tboolean positionChanged = false;\\n\\t\\t\\tif (cellMedian < currentPosition - tolerance) {\\n\\t\\t\\t\\tif (rankIndex == 0) {\\n\\t\\t\\t\\t\\tcell.setGeneralPurposeVariable(rankValue, (int) cellMedian);\\n\\t\\t\\t\\t\\tpositionChanged = true;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tJGraphAbstractHierarchyCell leftCell = (JGraphAbstractHierarchyCell) rank[rankValue][rankIndex - 1];\\n\\t\\t\\t\\t\\tint leftLimit = leftCell\\n\\t\\t\\t\\t\\t\\t\\t.getGeneralPurposeVariable(rankValue);\\n\\t\\t\\t\\t\\tleftLimit = leftLimit + (int) leftCell.width / 2\\n\\t\\t\\t\\t\\t\\t\\t+ (int) intraCellSpacing + (int) cell.width / 2;\\n\\t\\t\\t\\t\\tif (leftLimit < cellMedian) {\\n\\t\\t\\t\\t\\t\\tcell.setGeneralPurposeVariable(rankValue,\\n\\t\\t\\t\\t\\t\\t\\t\\t(int) cellMedian);\\n\\t\\t\\t\\t\\t\\tpositionChanged = true;\\n\\t\\t\\t\\t\\t} else if (leftLimit < cell\\n\\t\\t\\t\\t\\t\\t\\t.getGeneralPurposeVariable(rankValue)\\n\\t\\t\\t\\t\\t\\t\\t- tolerance) {\\n\\t\\t\\t\\t\\t\\tcell.setGeneralPurposeVariable(rankValue, leftLimit);\\n\\t\\t\\t\\t\\t\\tpositionChanged = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else if (cellMedian > currentPosition + tolerance) {\\n\\t\\t\\t\\tint rankSize = rank[rankValue].length;\\n\\t\\t\\t\\tif (rankIndex == rankSize - 1) {\\n\\t\\t\\t\\t\\tcell.setGeneralPurposeVariable(rankValue, (int) cellMedian);\\n\\t\\t\\t\\t\\tpositionChanged = true;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tJGraphAbstractHierarchyCell rightCell = (JGraphAbstractHierarchyCell) rank[rankValue][rankIndex + 1];\\n\\t\\t\\t\\t\\tint rightLimit = rightCell\\n\\t\\t\\t\\t\\t\\t\\t.getGeneralPurposeVariable(rankValue);\\n\\t\\t\\t\\t\\trightLimit = rightLimit - (int) rightCell.width / 2\\n\\t\\t\\t\\t\\t\\t\\t- (int) intraCellSpacing - (int) cell.width / 2;\\n\\t\\t\\t\\t\\tif (rightLimit > cellMedian) {\\n\\t\\t\\t\\t\\t\\tcell.setGeneralPurposeVariable(rankValue,\\n\\t\\t\\t\\t\\t\\t\\t\\t(int) cellMedian);\\n\\t\\t\\t\\t\\t\\tpositionChanged = true;\\n\\t\\t\\t\\t\\t} else if (rightLimit > cell\\n\\t\\t\\t\\t\\t\\t\\t.getGeneralPurposeVariable(rankValue)\\n\\t\\t\\t\\t\\t\\t\\t+ tolerance) {\\n\\t\\t\\t\\t\\t\\tcell.setGeneralPurposeVariable(rankValue, rightLimit);\\n\\t\\t\\t\\t\\t\\tpositionChanged = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (positionChanged) {\\n\\t\\t\\t\\t// Add connected nodes to map and list\\n\\t\\t\\t\\tfor (int i = 0; i < nextLayerConnectedCells.length; i++) {\\n\\t\\t\\t\\t\\tJGraphAbstractHierarchyCell connectedCell = (JGraphAbstractHierarchyCell) nextLayerConnectedCells[i];\\n\\t\\t\\t\\t\\tWeightedCellSorter connectedCellWrapper = (WeightedCellSorter) map\\n\\t\\t\\t\\t\\t\\t\\t.get(connectedCell);\\n\\t\\t\\t\\t\\tif (connectedCellWrapper != null) {\\n\\t\\t\\t\\t\\t\\tif (connectedCellWrapper.visited == false) {\\n\\t\\t\\t\\t\\t\\t\\tconnectedCellWrapper.visited = true;\\n\\t\\t\\t\\t\\t\\t\\tnodeList.add(connectedCellWrapper);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Add connected nodes to map and list\\n\\t\\t\\t\\tfor (int i = 0; i < previousLayerConnectedCells.length; i++) {\\n\\t\\t\\t\\t\\tJGraphAbstractHierarchyCell connectedCell = (JGraphAbstractHierarchyCell) previousLayerConnectedCells[i];\\n\\t\\t\\t\\t\\tWeightedCellSorter connectedCellWrapper = (WeightedCellSorter) map\\n\\t\\t\\t\\t\\t\\t\\t.get(connectedCell);\\n\\t\\t\\t\\t\\tif (connectedCellWrapper != null) {\\n\\t\\t\\t\\t\\t\\tif (connectedCellWrapper.visited == false) {\\n\\t\\t\\t\\t\\t\\t\\tconnectedCellWrapper.visited = true;\\n\\t\\t\\t\\t\\t\\t\\tnodeList.add(connectedCellWrapper);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tnodeList.removeFirst();\\n\\t\\t\\tcellWrapper.visited = false;\\n\\t\\t\\tcount++;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"629dfba36e15d2bdfb9625120d61b736\",\n \"score\": \"0.53204066\",\n \"text\": \"public KDNode recursiveBuildFaster(ArrayList<List<KDType>> superList, int depth) {\\n\\t\\tint size = superList.get(0).size();\\n\\t\\t\\n\\t\\tif (_k < 1) {\\n\\t\\t\\tSystem.err.println(\\\"ERROR: KDTree.recursiveBuildFaster(): Number of Dimensions has not been defined.\\\");\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t\\tif (depth < 0) {\\n\\t\\t\\tSystem.err.println(\\\"ERROR: KDTree.recursiveBuildFaster(): Cannot build tree from a negative depth!\\\");\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t\\tif(size == 0) {\\n\\t\\t\\tSystem.err.println(\\\"ERROR: KDTree.recursiveBuildfaster(): Cannot build tree from an empty list.\\\");\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t\\t\\n\\t\\tint axis = depth % _k;\\t//the 'axis' is the dimension that the nodes should be compared by.\\n\\t\\t\\t\\t\\t\\t\\t\\t//it is determined by the current depth\\n\\t\\t\\n\\t\\t//split list by median\\n\\t\\tKDType median;\\n\\t\\tint mid = size/2; //floor of size/2\\n\\t\\tmedian = superList.get(axis).get(mid); //get median object from desired axis-sorted list in superList \\n\\t\\t\\n\\t\\t//create node, split list around median and recur\\n\\t\\t\\t//if there is only one node left in the list, it's our median,\\n\\t\\t\\t//so we're done with building the tree and we can return the \\n\\t\\t\\t//last node which we just created from the median.\\n\\t\\tKDNode node = new KDNode(median);\\n\\t\\tif (depth == 0) _root = node; //set node to root if it's the first one\\n\\t\\t\\n\\t\\t//create new sets of branches, split around the median object.\\n\\t\\tBranches branches = new Branches(superList, mid, axis);\\n\\t\\tArrayList<List<KDType>> less = branches.less; //all object less than or equal to (on current axis)\\n\\t\\tArrayList<List<KDType>> more = branches.more; //all objects greater than (on current axis)\\n\\t\\t\\n\\t\\tif (!less.get(0).isEmpty())\\n\\t\\t\\tnode.putLeft(this.recursiveBuildFaster(less, depth+1));\\n\\t\\tif (!more.get(0).isEmpty())\\n\\t\\t\\tnode.putRight(this.recursiveBuildFaster(more, depth+1));\\n\\t\\t//XXX to save memory.\\n\\t\\tbranches = null;\\n\\t\\t\\n\\t\\t_size++;\\n\\t\\treturn node;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"754de60dcc6ce58074524c161fffa6be\",\n \"score\": \"0.5318472\",\n \"text\": \"private int kthChild(int i, int k)\\r\\n {\\r\\n return d * i + k;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e11d17cfcf142fe9e790417cc0d7a1c\",\n \"score\": \"0.5317679\",\n \"text\": \"public int returnKthSmallestBST(TreeNode root, int k) {\\n return 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aacc476f227fe1a54fa2fcd6eeda5d02\",\n \"score\": \"0.5293119\",\n \"text\": \"static double[] runningMedian(int[] a) {\\n /*\\n * Write your code here.\\n */\\n \\n int N = a.length;\\n double[] medians = new double[N];\\n Queue<Integer> maxPQ = new PriorityQueue<>(N/2 + 1, Collections.reverseOrder());\\n Queue<Integer> minPQ = new PriorityQueue<>(N/2 + 1);\\n double median = 0;\\n for(int i = 0; i < a.length; i++){\\n if (a[i] <= median) {\\n maxPQ.add(a[i]);\\n } else {\\n minPQ.add(a[i]);\\n }\\n\\n if (minPQ.size() > maxPQ.size()+1) {\\n maxPQ.add(minPQ.poll());\\n minPQ.poll();\\n }\\n if (maxPQ.size() > minPQ.size()+1) {\\n minPQ.add(maxPQ.poll());\\n maxPQ.poll();\\n }\\n\\n if (minPQ.size() == maxPQ.size()) {\\n \\n median = (double)(maxPQ.peek() + minPQ.peek())/2.0;\\n } else if(minPQ.size() > maxPQ.size()) {\\n median = (double)minPQ.peek();\\n } else if (minPQ.size() < maxPQ.size()) {\\n median = (double)maxPQ.peek();\\n }\\n medians[i] = median;\\n }\\n return medians;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b1e1567d5711c4366083a597f0442b2\",\n \"score\": \"0.5274798\",\n \"text\": \"public int rank(Key key) {\\n return rank(root, key);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75bcb8d5f5a21f2d5e4391917ac837dc\",\n \"score\": \"0.5269587\",\n \"text\": \"public int rank(Node<Key, Value> x, Key key){\\n if(x == null) return 0;\\n int result = key.compareTo(x.key);\\n if(result < 0) return rank(x.left, key);\\n else if(result > 0) return 1 + size(x.left) + rank(x.right, key);\\n else return size(x.left);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a796c67d6f574edb60a4f6a85a5f6f46\",\n \"score\": \"0.52533007\",\n \"text\": \"private double getMedian(LinkedList<VPItem> list) {\\n double median = 0;\\n for (VPItem item : list) {\\n median += item.getItemsHistory();\\n }\\n return median / list.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bfa6f5855d86f6644f6c068d1a443c1d\",\n \"score\": \"0.5252616\",\n \"text\": \"private int rank(int key, Node x) {\\n if (x == null) return 0; \\n int cmp = key - x.key; \\n if (cmp < 0) return rank(key, x.left); \\n else if (cmp > 0) return 1 + size(x.left) + rank(key, x.right); \\n else return size(x.left); \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69384a29dc5d7c4a9bd23c1930481b22\",\n \"score\": \"0.5249304\",\n \"text\": \"public double findMedian() {\\n if(maxQ.size() == minQ.size())\\n return (maxQ.peek() + minQ.peek())/2.0;\\n else\\n return maxQ.peek();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"08cda966dcc6caba8872a339f77898ae\",\n \"score\": \"0.5233534\",\n \"text\": \"public double findMedian() {\\n \\tint[] tmp = new int[count];\\n System.arraycopy(store, 0, tmp, 0, count);\\n \\tArrays.sort(tmp);\\n \\tint low = count / 2;\\n return count % 2 == 0 ? (double) (tmp[low - 1] + tmp[low]) / 2 : new Double(tmp[low]);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c47c9a77b6195dea07d0ad8e67065fe\",\n \"score\": \"0.5225915\",\n \"text\": \"private void medianPos(int i, JGraphHierarchyModel model) {\\n\\t\\t// Reverse sweep direction each time through this method\\n\\t\\tboolean downwardSweep = (i % 2 == 0);\\n\\t\\tif (downwardSweep) {\\n\\t\\t\\tfor (int j = model.maxRank; j > 0; j--) {\\n\\t\\t\\t\\trankMedianPosition(j - 1, model, j);\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\tfor (int j = 0; j < model.maxRank - 1; j++) {\\n\\t\\t\\t\\trankMedianPosition(j + 1, model, j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5f802e33b265ae595572ebafb28cfd8\",\n \"score\": \"0.52103186\",\n \"text\": \"public int getMedianValue(List<Integer> values) {\\n int size = values.size();\\n if (size == 0) {\\n return 0;\\n }\\n int middle = size / 2;\\n\\n int hi = values.get(middle);\\n\\n /* Handles the case in which the size of the array is even, and returns the average of the middle values */\\n if (size % 2 == 0) {\\n int lo = values.get(middle - 1);\\n return average(lo, hi);\\n }\\n return hi;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bdd25b88e131c010c467e6f6427b5ff7\",\n \"score\": \"0.52101046\",\n \"text\": \"private int rank(Node x, Key key) {\\n\\t\\tif (x == null) {\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tint cmp = key.compareTo(x.key);\\n\\t\\tif (cmp < 0) {\\n\\t\\t\\treturn rank(x.left, key);\\n\\t\\t} else if ( cmp > 0){\\n\\t\\t\\treturn 1 + size(x.left) + rank(x.right, key);\\n\\t\\t} else {\\n\\t\\t\\treturn size(x.left);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9a9f00a4174dfd157a347027a5e0533\",\n \"score\": \"0.52089417\",\n \"text\": \"public double[] medianSlidingWindow(int[] a, int k) {\\n\\t\\tint n = a.length;\\n\\t\\tdouble res[] = new double[n - k + 1];\\n\\t\\tPriorityQueue<Integer> minHeap = new PriorityQueue<>();\\n\\t\\tPriorityQueue<Integer> maxHeap = new PriorityQueue<>((c, d) -> d.compareTo(c));\\n\\t\\tfor (int i = 0; i <= n; i++) {\\n\\t\\t\\tif (i >= k) {\\n\\t\\t\\t\\tres[i - k] = k % 2 != 0 ? maxHeap.peek() : ((double) maxHeap.peek() + (double) minHeap.peek()) / 2.0;\\n\\t\\t\\t\\tif (a[i - k] <= maxHeap.peek()) {\\n\\t\\t\\t\\t\\tmaxHeap.remove(a[i - k]);\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tminHeap.remove(a[i - k]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (i != n)\\n\\t\\t\\t\\tinsert(a[i], minHeap, maxHeap);\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5872c4f3a36bfcc8a0ad7cb89779815b\",\n \"score\": \"0.5203721\",\n \"text\": \"public int rank(Key key) {\\r\\n return rank(root, key);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c60399691b923e5e0506a8eae96b20c\",\n \"score\": \"0.5198053\",\n \"text\": \"public MedianFinder() {\\n maxHeap = new PriorityQueue<>(new Comparator<Integer>(){\\n @Override\\n public int compare(Integer num1, Integer num2){\\n return num2 - num1;\\n }\\n });\\n minHeap = new PriorityQueue<>();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"373e9ed5df1071c9791c4253a340db73\",\n \"score\": \"0.51948196\",\n \"text\": \"public static double median(double [] num) {\\r\\n\\t\\t\\r\\n\\t\\tdouble median;\\r\\n\\t\\t//divide the length of the array by 2\\r\\n\\t\\tif (num.length % 2 == 0)\\r\\n\\t\\t median = ((double)num[num.length/2] + (double)num[num.length/2 - 1])/2;\\r\\n\\t\\telse\\r\\n\\t\\t median = (double) num[num.length/2];\\r\\n\\t\\treturn median;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f3d59871c567b0c568943a9389500f1\",\n \"score\": \"0.5191851\",\n \"text\": \"private int kthChild(int i, int k)\\n {\\n return totalNumberOfChildNode * i + k;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc0af7801c47315ad383758841d7eecf\",\n \"score\": \"0.5191788\",\n \"text\": \"public MedianFinder() {\\n \\n lowerHeap = new PriorityQueue<Integer>(new Comparator<Integer>(){\\n public int compare(Integer i1, Integer i2){\\n return i2-i1;\\n }\\n });\\n upperHeap = new PriorityQueue<Integer>(new Comparator<Integer>(){\\n public int compare(Integer i1, Integer i2){\\n return i1-i2;\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"91a011ef68ae5e38ef80b9c2cfbf4cdb\",\n \"score\": \"0.5160574\",\n \"text\": \"public Q295_Find_Median_from_Data_Stream() {\\n small = new PriorityQueue<>(Collections.reverseOrder());\\n large = new PriorityQueue<>();\\n isEven = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e7abae2574b103e2f636d7de397c562\",\n \"score\": \"0.5160128\",\n \"text\": \"public double getMedian() {\\n\\t\\tArrayList<Double> list = new ArrayList<Double>();\\n\\t\\tfor(Double grade : studentGrades.values()) {\\n\\t\\t\\tif(grade != null) {\\n\\t\\t\\t\\tlist.add(grade);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(list.size() > 0) {\\n\\t\\t\\tif(list.size() == 1) {\\n\\t\\t\\t\\treturn list.get(0);\\n\\t\\t\\t}\\n\\t\\t\\tCollections.sort(list);\\n\\t\\t\\tif(list.size() % 2 != 0) {\\n\\t\\t\\t\\treturn list.get((list.size() + 1) / 2 - 1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn (list.get(list.size() / 2) + list.get((list.size() / 2) - 1)) / 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e6af2f72e4b27dc3f2e05659ead54e8\",\n \"score\": \"0.5159316\",\n \"text\": \"public int kthFromLast(int k){\\r\\n Node slow = head;\\r\\n Node fast = head;\\r\\n //Update fast till k, now the difference between slow and fast is of k nodes. If we iterate fast till last, slow.data\\r\\n //will give us our required kth last element.\\r\\n for(int i=0; i<k; i++){\\r\\n fast = fast.next;\\r\\n }\\r\\n while(fast.next != null){\\r\\n slow = slow.next;\\r\\n fast = fast.next;\\r\\n }\\r\\n return slow.data;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"217db107371963ac33d9cb9be0960485\",\n \"score\": \"0.5148682\",\n \"text\": \"@Override\\n\\tpublic int rank(Key key) {\\n\\t\\treturn this.rank(this.root, key);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43ace15657eee2e2e5330c049f56502f\",\n \"score\": \"0.51464975\",\n \"text\": \"public int rank(Key key) {\\n return rank(key, root);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51ad3cb67cf321467817876680468336\",\n \"score\": \"0.5140316\",\n \"text\": \"private RBNode findNode(int k)\\n\\t{\\n\\t\\tRBNode current = getRoot();\\n\\n\\t\\twhile (current != null)\\n\\t\\t{\\n\\t\\t\\tif (current.getKey() < k)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcurrent = current.getRight();\\n\\t\\t\\t} else if (current.getKey() > k)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcurrent = current.getLeft();\\n\\t\\t\\t} else\\n\\t\\t\\t{\\n\\t\\t\\t\\treturn current;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4e2d3808a9a3a8ecf8d03f6187be7ea\",\n \"score\": \"0.5137701\",\n \"text\": \"private int correctMedian(List<Stagiaire> listOfStagiaire, int median) throws IOException {\\n\\t\\tint incrementMedian = median + 1; \\n\\t\\tString medianName = listOfStagiaire.get(median).getNom();\\n\\t\\tString medianNamePlusOne = listOfStagiaire.get(median+1).getNom();\\n\\t\\t// condition si size of the list\\n\\t\\twhile( (medianName.compareTo(medianNamePlusOne) == 0) &&\\n\\t\\t\\t ( incrementMedian < listOfStagiaire.size()-1 ) ) {\\n\\t\\t\\tincrementMedian++;\\n\\t\\t\\tmedianNamePlusOne = listOfStagiaire.get(incrementMedian).getNom();\\n\\t\\t}\\n\\t\\t//System.out.println(\\\"Found correct median : \\\"+ (int)(incrementMedian) );\\n\\t\\treturn incrementMedian;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c73de392aeb0d2cf14c64d2adce4ae1\",\n \"score\": \"0.513627\",\n \"text\": \"public int findKthNumber(int m, int n, int k) {\\n int left = 1, right = m * n;\\n while (left < right) {\\n int mid = (right - left) / 2 + left;\\n if (count(mid, m, n, k)) {\\n right = mid;\\n } else {\\n left = mid + 1;\\n }\\n }\\n return left;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"985e7eb359982255e8ed928707f5c69b\",\n \"score\": \"0.5129453\",\n \"text\": \"static int[] medianII(int[] nums) {\\n Queue<Integer> minHeap = new PriorityQueue<Integer>((o1, o2) -> o2-o1);\\n Queue<Integer> maxHeap = new PriorityQueue<Integer>((o1, o2) -> o1-o2);\\n int len = 0;\\n int[] ret = new int[nums.length];\\n for(Integer n: nums) {\\n len++;\\n int minSize = len%2==1? len/2 +1 : len/2;\\n int maxSize = len/2;\\n if(minHeap.size()==0) {\\n minHeap.add(n);\\n ret[len-1] = n;\\n continue;\\n }\\n if(n<=minHeap.peek()) {\\n minHeap.add(n);\\n if(minHeap.size()>minSize) {\\n maxHeap.add(minHeap.poll());\\n }\\n ret[len-1] = minHeap.peek();\\n }\\n else {\\n maxHeap.add(n);\\n if(maxHeap.size()>maxSize) {\\n minHeap.add(maxHeap.poll());\\n }\\n ret[len-1] = minHeap.peek();\\n }\\n }\\n return ret;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e455489bd6cbb60d2aeaa29deda9159\",\n \"score\": \"0.5116722\",\n \"text\": \"public int delete(int k) {\\n IAVLNode node = searchForNode(k);\\n if (node == null) {\\n return -1;\\n }\\n IAVLNode parent = node.getParent();\\n if (node.isLeaf()) {\\n deleteLeaf(node);\\n decrementAncestorsSize(parent);\\n return (rebalanceAfterDelete(parent));\\n }\\n if (node.isUnaryNode()) {\\n deleteUnaryNode(node);\\n decrementAncestorsSize(parent);\\n return (rebalanceAfterDelete(node.getParent()));\\n }\\n IAVLNode nodeToDelete = swapNodeWithSuccessor(node);\\n deleteAfterSuccessorSwap(nodeToDelete);\\n decrementAncestorsSize(nodeToDelete.getParent());\\n return rebalanceAfterDelete(nodeToDelete.getParent());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"606bd231e4cb110fbbd83578bfe8a4ae\",\n \"score\": \"0.5113627\",\n \"text\": \"private Optional<BinaryNode<K, double[]>> constructKDTree(Collection<KVPair<K, double[]>> items, int depth) {\\n List<KVPair<K, double[]>> itemsList = new ArrayList<KVPair<K, double[]>>(items);\\n BinaryNode<K, double[]> tree;\\n if (itemsList.size() == 1) {\\n tree = new BinaryNode<K, double[]>(itemsList.get(0), Optional.empty(), Optional.empty());\\n return Optional.of(tree);\\n } else if (itemsList.size() == 0) {\\n return Optional.empty(); \\n }\\n int sortIndex = depth % dimension;\\n Collections.sort(itemsList, (e1, e2) -> {\\n return (int) Math.signum(e1.getValue()[sortIndex] - e2.getValue()[sortIndex]);\\n });\\n\\n int medianIndex = (itemsList.size() / 2);\\n KVPair<K, double[]> median = itemsList.get(medianIndex);\\n tree = new BinaryNode<K, double[]>(median, \\n constructKDTree(itemsList.subList(0, medianIndex), depth += 1), \\n constructKDTree(itemsList.subList(medianIndex + 1, itemsList.size()), depth += 1));\\n return Optional.of(tree);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46aec8a0f852e60c44f3ecbc0c7903a6\",\n \"score\": \"0.51134896\",\n \"text\": \"private int rank(Key key, Node node) {\\n if (node == null)\\n return 0;\\n\\n int compare = key.compareTo(node.key);\\n\\n if (compare < 0)\\n return rank(key, node.left);\\n\\n // When the key is larger than the current node, add all nodes to the left of it,\\n // as well as the current node, and explore the right subtree.\\n else if (compare > 0)\\n return rank(key, node.right) + 1 + size(node.left);\\n\\n return size(node.left);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bd8d8819b347939508e968a1a0913ae\",\n \"score\": \"0.5108687\",\n \"text\": \"protected int getMedian(ArrayList<Integer> list){\\n\\t\\tint median;\\n\\t\\tif(list.size() == 0){\\n\\t\\t\\tmedian = 0;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tArrayList<Integer> sortedList = makeCopy(list);\\n\\t\\t\\tCollections.sort(sortedList);\\n\\t\\t\\tint middle = sortedList.size()/2;\\n\\t\\t\\tif(sortedList.size()%2 == 1){\\n\\t\\t\\t\\tmedian = sortedList.get(middle);\\n\\t\\t\\t} \\n\\t\\t\\telse{\\n\\t\\t\\t\\tmedian = (sortedList.get(middle-1) + sortedList.get(middle))/2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t return median;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0ac1a8fe220cb166ae1902f1d77a06d9\",\n \"score\": \"0.5103116\",\n \"text\": \"private static void findKLargestInBSTHelper(BSTNode<Integer> tree, int k, List<Integer> kLargestElements) {\\n\\t\\tif (tree != null && kLargestElements.size() < k) {\\n\\t\\t\\tfindKLargestInBSTHelper(tree.right, k, kLargestElements);\\n\\t\\t\\tif (kLargestElements.size() < k) {\\n\\t\\t\\t\\tkLargestElements.add(tree.data);\\n\\t\\t\\t\\tfindKLargestInBSTHelper(tree.left, k, kLargestElements);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8aa735083abea681029b01225d996f29\",\n \"score\": \"0.50993216\",\n \"text\": \"public MedianFinder() {\\n minHeap = new PriorityQueue<>();\\n maxHeap = new PriorityQueue<>(new Comparator<Integer>(){\\n @Override\\n public int compare(Integer o1, Integer o2) {\\n return o2.compareTo(o1);\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"514b4a6389fa73203fc3fd69a7440f5b\",\n \"score\": \"0.5093903\",\n \"text\": \"static void nodeAtk(Node root, int k){\\n if(k==0)\\n System.out.println(root.key);\\n if(root.left!=null)\\n nodeAtk(root.left,k-1);\\n if(root.right!=null)\\n nodeAtk(root.right,k-1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07767a4c153da0d7c5df73f6a03dbe41\",\n \"score\": \"0.50929785\",\n \"text\": \"public void updateMedian() {\\n\\t\\tmedian = calcMedian(edgesCovered);\\n\\t\\tedgesRepresented = new HashSet<Integer>();\\n\\t\\t//System.out.println(\\\"Median is \\\" + median);\\n\\t\\tfor (Integer a : edgesCovered)\\n\\t\\t\\tif (wc.invWeightDist.get(t.weights[a]) >= median*(1/Constants.WINDOW) && wc.invWeightDist.get(t.weights[a]) <= median*1*Constants.WINDOW)\\n\\t\\t\\t\\tedgesRepresented.add(a);\\n\\t\\tcurrentMDLScore = getMDLScore();\\n\\t\\t\\n\\t\\tminweight = Integer.MAX_VALUE;\\n\\t\\tfor (Integer a : edgesRepresented)\\n\\t\\t\\tminweight = Math.min(minweight, t.weights[a]);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4e57df4944f2e1229d99a6e38bc37c9\",\n \"score\": \"0.5090807\",\n \"text\": \"public static double calculateMedian(int[] array){\\n double median=0.0;\\n Arrays.sort(array); // array == {3,9,15,17,44}\\n if(array.length % 2 == 1){ // odd number of elements\\n int middleIndex = array.length/2; // 5/2 == 2\\n median = array[middleIndex]; // median is 15\\n }else{\\n // remainder is 0 => even number of elements\\n // {3,8,10,5,6,4} initially (6 elements)\\n // {3,4,5,6,8,10} after sorting the array\\n int middleIndex = array.length/2; // 6/2 == 3\\n double sumOfTwoMiddleValues = \\n array[middleIndex] + // 6 +\\n array[middleIndex-1];// 5 \\n median = sumOfTwoMiddleValues/2; // 11/2 = 5.5\\n }\\n return median;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1daef925761182f5fe540a276cff9917\",\n \"score\": \"0.50825864\",\n \"text\": \"private int getWeightedMedian(int[] bytesReadSoFar) {\\r\\n\\t\\t\\r\\n\\t\\tdouble b;\\r\\n\\t\\tdouble a;\\r\\n\\t\\tdouble z = bytesReadSoFar.length;\\r\\n\\t\\tdouble lnFloor;\\r\\n\\t\\tdouble lnCeil;\\r\\n\\t\\t\\r\\n\\t\\tArrays.sort(bytesReadSoFar);\\r\\n\\t\\t\\r\\n\\t\\ta = g * (z - 1.0f) + 1.0f;\\r\\n\\t\\t\\r\\n\\t\\tlnFloor = (double) bytesReadSoFar[(int) Math.floor(a) - 1];\\r\\n\\t\\tlnCeil = (double) bytesReadSoFar[(int) Math.ceil(a) - 1];\\r\\n\\r\\n\\t\\tb =\\t(a - Math.floor(a)) * (lnCeil - lnFloor) + lnFloor;\\r\\n\\t\\t\\r\\n\\t\\treturn adjustBlockSizeToCryptographicBlockSize((int) Math.round(b));\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c821b78b6274c8a8a9050932e7d34f9\",\n \"score\": \"0.5076549\",\n \"text\": \"public MedianFinder() {\\n leftMaxHeap = new PriorityQueue<>((o1, o2) -> o2 - o1);\\n rightMinHeap = new PriorityQueue<>();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a91b56e3e0e80ec010de90f605b2274\",\n \"score\": \"0.5072239\",\n \"text\": \"public MedianFinder() {\\n minHeap = new PriorityQueue<Integer>();\\n maxHeap = new PriorityQueue<Integer>(10, Collections.reverseOrder());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67774ba9568142b87e99eb9c49ed688b\",\n \"score\": \"0.5068896\",\n \"text\": \"int kthSmallest(int arr[], int n, int k)\\n{\\n\\n\\t// Build a heap of first k elements: O(k) time\\n\\tMaxHeap mh = new MaxHeap(arr, k);\\n\\n\\t// Process remaining n-k elements. If current element is\\n\\t// smaller than root, replace root with current element\\n\\tfor (int i = k; i < n; i++)\\n\\tif (arr[i] < mh.getMax())\\n\\t\\tmh.replaceMax(arr[i]);\\n\\n\\t// Return root\\n\\treturn mh.getMax();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67cd6f82c0e0ac48bff8b70f7c498c33\",\n \"score\": \"0.5062597\",\n \"text\": \"private Double getMedian(Double newReading)\\n {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b28a7b4887f86c8d01e347225d487e8e\",\n \"score\": \"0.505817\",\n \"text\": \"public int rank(Key key) {\\n\\t\\treturn rank(key, root);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e478b3a86e2bf9bf78b31c7d070c4cff\",\n \"score\": \"0.5055349\",\n \"text\": \"@Override\\n\\tpublic int rank(K k) {\\n\\t\\treturn rank(root, k);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"447f7330e62f81857ada37fe96191330\",\n \"score\": \"0.5053905\",\n \"text\": \"public static long median(long[] values)\\n {\\n // log.debug(\\\"public static long median(long[] values = \\\" + Arrays.toString(values) + \\\"): called\\\");\\n\\n long median;\\n\\n // Order the list of values.\\n long[] orderedValues = new long[values.length];\\n System.arraycopy(values, 0, orderedValues, 0, values.length);\\n Arrays.sort(orderedValues);\\n\\n // Check if the median is computed from a pair of middle value.\\n if ((orderedValues.length % 2) == 0)\\n {\\n int middle = orderedValues.length / 2;\\n\\n median = (orderedValues[middle] + orderedValues[middle - 1]) / 2;\\n }\\n // The median is computed from a single middle value.\\n else\\n {\\n median = orderedValues[orderedValues.length / 2];\\n }\\n\\n // log.debug(\\\"median = \\\" + median);\\n\\n return median;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb85ff290267be89b164d5e1d4e049b3\",\n \"score\": \"0.5049385\",\n \"text\": \"private double Median(double dimensions[]) {\\n Arrays.sort(dimensions);\\n int length = dimensions.length;\\n if (length % 2 == 0)\\n return (dimensions[length / 2] + dimensions[(length / 2) - 1]) / 2;\\n else\\n return dimensions[(length - 1) / 2];\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985493,"cells":{"query_id":{"kind":"string","value":"0a436faac0510568eedacfdd14dfbaed"},"query":{"kind":"string","value":"Generate a TAP file for every method tested"},"positive_passages":{"kind":"list like","value":[{"docid":"384e5b34851709fd905ab3f9006b5f1e","score":"0.71515435","text":"protected void generateTAPPerMethod(ITestContext testContext) {\r\n List<ITestResult> testNGTestResults = TapTestNGUtil\r\n .getTestNGResultsOrderedByExecutionDate(resultMap);\r\n\r\n for (ITestResult testResult : testNGTestResults) {\r\n ITestNGMethod method = testResult.getMethod();\r\n\r\n List<ITestResult> testResultsForThisMethod = testResultsPerMethod\r\n .get(method);\r\n\r\n if (testResultsForThisMethod == null) {\r\n testResultsForThisMethod = new LinkedList<ITestResult>();\r\n testResultsPerMethod.put(method, testResultsForThisMethod);\r\n }\r\n testResultsForThisMethod.add(testResult);\r\n }\r\n\r\n Set<ITestNGMethod> keySet = testResultsPerMethod.keySet();\r\n\r\n for (ITestNGMethod method : keySet) {\r\n TestSet testSet = new TestSet();\r\n\r\n List<ITestResult> testResults = testResultsPerMethod.get(method);\r\n testSet.setPlan(new Plan(testResults.size()));\r\n\r\n for (ITestResult testResult : testResults) {\r\n TestResult tapTestResult = TapTestNGUtil.generateTAPTestResult(\r\n testResult, testSet.getNumberOfTestResults() + 1,\r\n isYaml());\r\n testSet.addTestResult(tapTestResult);\r\n }\r\n\r\n File output = new File(testContext.getOutputDirectory(), method\r\n .getTestClass().getName()\r\n + \"#\"\r\n + method.getMethodName()\r\n + \".tap\");\r\n if (!output.getParentFile().exists()) {\r\n output.getParentFile().mkdirs();\r\n }\r\n tapProducer.dump(testSet, output);\r\n }\r\n }","title":""}],"string":"[\n {\n \"docid\": \"384e5b34851709fd905ab3f9006b5f1e\",\n \"score\": \"0.71515435\",\n \"text\": \"protected void generateTAPPerMethod(ITestContext testContext) {\\r\\n List<ITestResult> testNGTestResults = TapTestNGUtil\\r\\n .getTestNGResultsOrderedByExecutionDate(resultMap);\\r\\n\\r\\n for (ITestResult testResult : testNGTestResults) {\\r\\n ITestNGMethod method = testResult.getMethod();\\r\\n\\r\\n List<ITestResult> testResultsForThisMethod = testResultsPerMethod\\r\\n .get(method);\\r\\n\\r\\n if (testResultsForThisMethod == null) {\\r\\n testResultsForThisMethod = new LinkedList<ITestResult>();\\r\\n testResultsPerMethod.put(method, testResultsForThisMethod);\\r\\n }\\r\\n testResultsForThisMethod.add(testResult);\\r\\n }\\r\\n\\r\\n Set<ITestNGMethod> keySet = testResultsPerMethod.keySet();\\r\\n\\r\\n for (ITestNGMethod method : keySet) {\\r\\n TestSet testSet = new TestSet();\\r\\n\\r\\n List<ITestResult> testResults = testResultsPerMethod.get(method);\\r\\n testSet.setPlan(new Plan(testResults.size()));\\r\\n\\r\\n for (ITestResult testResult : testResults) {\\r\\n TestResult tapTestResult = TapTestNGUtil.generateTAPTestResult(\\r\\n testResult, testSet.getNumberOfTestResults() + 1,\\r\\n isYaml());\\r\\n testSet.addTestResult(tapTestResult);\\r\\n }\\r\\n\\r\\n File output = new File(testContext.getOutputDirectory(), method\\r\\n .getTestClass().getName()\\r\\n + \\\"#\\\"\\r\\n + method.getMethodName()\\r\\n + \\\".tap\\\");\\r\\n if (!output.getParentFile().exists()) {\\r\\n output.getParentFile().mkdirs();\\r\\n }\\r\\n tapProducer.dump(testSet, output);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"30cc09c4e75b59d723186d4a45af08b2","score":"0.62376755","text":"protected void generateTAPPerClass(ITestContext testContext) {\r\n List<ITestResult> testNGTestResults = TapTestNGUtil\r\n .getTestNGResultsOrderedByExecutionDate(this.resultMap);\r\n\r\n for (ITestResult testResult : testNGTestResults) {\r\n Class<?> clazz = testResult.getMethod().getRealClass();\r\n List<ITestResult> testResultsForThisClass = testResultsPerClass\r\n .get(clazz);\r\n if (testResultsForThisClass == null) {\r\n testResultsForThisClass = new LinkedList<ITestResult>();\r\n testResultsPerClass.put(clazz, testResultsForThisClass);\r\n }\r\n testResultsForThisClass.add(testResult);\r\n }\r\n\r\n Set<Class<?>> keySet = testResultsPerClass.keySet();\r\n\r\n for (Class<?> clazz : keySet) {\r\n TestSet testSet = new TestSet();\r\n\r\n List<ITestResult> testResults = testResultsPerClass.get(clazz);\r\n\r\n testSet.setPlan(new Plan(testResults.size()));\r\n\r\n for (ITestResult testResult : testResults) {\r\n TestResult tapTestResult = TapTestNGUtil.generateTAPTestResult(\r\n testResult, testSet.getNumberOfTestResults() + 1,\r\n isYaml());\r\n testSet.addTestResult(tapTestResult);\r\n }\r\n\r\n File output = new File(testContext.getOutputDirectory(),\r\n clazz.getName() + \".tap\");\r\n if (!output.getParentFile().exists()) {\r\n output.getParentFile().mkdirs();\r\n }\r\n tapProducer.dump(testSet, output);\r\n }\r\n }","title":""},{"docid":"315770f61e7a7ae458f7694e962320d7","score":"0.62147564","text":"@Test\n public void testGetMethods() {\n writeBanner(methodName());\n\n ClassInfo<Person> classInfo = new ClassInfo<>(Person.class);\n List<Method> methods = classInfo.getMethods();\n methods.forEach(m -> writeln(\"reader method: {0}\", m));\n }","title":""},{"docid":"0a604e55edb217d282330c8e264c7bb6","score":"0.6175507","text":"@Test\n public void testAll() {\n test(\"CPU\", \"/smile/data/weka/cpu.arff\", 6);\n //test(\"2dplanes\", \"/smile/data/weka/regression/2dplanes.arff\", 6);\n //test(\"abalone\", \"/smile/data/weka/regression/abalone.arff\", 8);\n //test(\"ailerons\", \"/smile/data/weka/regression/ailerons.arff\", 40);\n //test(\"bank32nh\", \"/smile/data/weka/regression/bank32nh.arff\", 32);\n test(\"autoMPG\", \"/smile/data/weka/regression/autoMpg.arff\", 7);\n test(\"cal_housing\", \"/smile/data/weka/regression/cal_housing.arff\", 8);\n test(\"puma8nh\", \"/smile/data/weka/regression/puma8NH.arff\", 8);\n test(\"kin8nm\", \"/smile/data/weka/regression/kin8nm.arff\", 8);\n }","title":""},{"docid":"28eb457a4c37430ff431766ec8876929","score":"0.60567105","text":"@Karate.Test\n Karate testAll() {\n return Karate.run().relativeTo(getClass());\n }","title":""},{"docid":"7f1f9eba10f3b4ffc432a20c8ccb29ff","score":"0.6054023","text":"public void run() {\n\n TestSuiteUtils.printHeader(this);\n\n //\n // Initial Setup\n //\n SimpleDateFormat date_format = TestSuiteUtils.getDateFormat();\n Date timestamp = new Date(System.currentTimeMillis());\n\n ConceptChecklist concept_checklist = new ConceptChecklist();\n\n addToLog(\n \" 1. Test ConceptChecklist: add(Concept[]), getConcepts() ... \"\n + date_format.format(timestamp));\n\n ArrayList list = new ArrayList();\n Concept concept = new Concept.Default();\n concept.setCUI(new CUI(\"C0000001\"));\n concept.setPreferredAtom(new Atom.Default(1070));\n concept.setEditingAuthority(new Authority.Default(\"KEVRIC\"));\n concept.setEditingTimestamp(new java.util.Date());\n concept.setReadTimestamp(new java.util.Date());\n list.add(concept);\n\n concept_checklist.add((Concept[]) list.toArray(new Concept[] {}));\n Concept[] concepts = concept_checklist.getConcepts();\n if (concepts.length > 0)\n addToLog(\" 1. Test Passed\");\n else {\n addToLog(\" 1. Test Failed\");\n thisTestFailed();\n }\n\n addToLog(\n \" 2. Test ConceptChecklist: add(Object), getConcepts() ... \"\n + date_format.format(timestamp));\n\n concept_checklist.add(concept);\n concepts = concept_checklist.getConcepts();\n if (concepts.length > 0)\n addToLog(\" 2. Test Passed\");\n else {\n addToLog(\" 2. Test Failed\");\n thisTestFailed();\n }\n\n addToLog(\n \" 3. Test ConceptChecklist: addCluster(Cluster), getConcepts() ... \"\n + date_format.format(timestamp));\n\n ConceptCluster cluster = new ConceptCluster(new Identifier.Default(12345));\n concept_checklist.addCluster(cluster);\n concepts = concept_checklist.getConcepts();\n if (concepts.length > 0)\n addToLog(\" 3. Test Passed\");\n else {\n addToLog(\" 3. Test Failed\");\n thisTestFailed();\n }\n\n addToLog(\"\");\n\n if (this.isPassed())\n addToLog(\" All tests passed\");\n else\n addToLog(\" At least one test did not complete successfully\");\n\n //\n // Main Footer\n //\n\n addToLog(\"\");\n\n addToLog(\"-------------------------------------------------------\");\n addToLog(\"Finished TestSuiteConceptChecklist at \" +\n date_format.format(new Date(System.currentTimeMillis())));\n addToLog(\"-------------------------------------------------------\");\n\n }","title":""},{"docid":"53dd1d712f1c30d1b9291d72e8c435ee","score":"0.60327643","text":"@Test\n public void One()\n {\n System.out.println(\"This is test One\");\n }","title":""},{"docid":"04e9f7d3e3d2df02c470130ec9372baa","score":"0.5952458","text":"@Test\n public void tpeTest() {\n // TODO: test tpe\n }","title":""},{"docid":"5b217f02bf7984fa9fc686b711dc06d5","score":"0.5952052","text":"@Test\n\tpublic void sampleTests() {\n\n\t\tSystem.out.println(\"END TEST\");\n\n\t}","title":""},{"docid":"c89e057356c1e9e7189abf52df74c275","score":"0.5935244","text":"@Test\r\n public void tes(){\r\n }","title":""},{"docid":"05338607cb81f6b43bd4ddbc1e017f62","score":"0.5932194","text":"public void runTest(){\n testGetA();\n testGetB();\n testAdd();\n testSubtract();\n testMultiply();\n testDivide();\n }","title":""},{"docid":"2ee04bebbc9be13b614036178d7c8c64","score":"0.5906397","text":"@Test\n public void testTxtFileHandlerWrite() {\n }","title":""},{"docid":"41c753c592ebd8a6e9a735a9492a6633","score":"0.59035426","text":"public void runTests(){\n runTests(TARGET_DOT_NAME_DEFAULT, RECURSE_DEFAULT, FULL_TRACE_DEFAULT, SCAN_NON_TEST_CLASS_DEFAULT);\n }","title":""},{"docid":"9f1518fcfa1fb0fddd01ec30283310c6","score":"0.5901997","text":"public void unittest1() {\n }","title":""},{"docid":"19bc87c5d6df936ca151c264656da334","score":"0.5890524","text":"public static void main(String[] args) throws IOException {\n test_getTzxx();\n//\t\t test_getTzxxAll();\n// test_modifyShjbxx();\n// test_modifyJypl();\n// test_searchJyplxx();\n// test_searchSptzxx();\n// test_queryLedgerList();\n//\t\t test_getTzDetail();\n }","title":""},{"docid":"1183f29d20bf05c3ca109ed79aea016b","score":"0.5882113","text":"protected static void runTest(String testName) {\n if(!new File(testName + \".java\").exists())\r\n return;\r\n try {\r\n\t\tSystem.out.println(testName + \".java\");\r\n \r\n // redirect output stream\r\n\t PrintStream out = System.out;\r\n\t\tByteArrayOutputStream os = new ByteArrayOutputStream();\r\n\t\tPrintStream ps = new PrintStream(os);\r\n if(!verbose)\r\n\t\t System.setOut(ps);\r\n \r\n // run JastAdd to build .class files for test case\r\n\t\tif(new jastadd.JastAdd().compile(buildArgs(testName))) {\r\n // load test class in a separate class loader and invoke main method\r\n String className = testName.replace('/', '.');\r\n loadAndInvoke(className);\r\n }\r\n \r\n // restore output stream\r\n\t\tif(verbose)\r\n\t\t\tSystem.out.println(os.toString());\r\n else\r\n\t\t System.setOut(out);\r\n \r\n // compare output stream result and expected output\r\n\t\tString result = simplifyComparison(os.toString());\r\n\t\tString correct = simplifyComparison(readFile(testName + \".result\"));\r\n\t\tif(result.equals(correct)) {\r\n\t\t\tSystem.out.println(testName + \".java passed\");\r\n\t\t}\r\n\t\telse {\r\n\t\t\tSystem.err.println(testName + \".java failed\");\r\n\t\t\tSystem.err.println(\"[\" + result + \"]\" + \"\\nDoes not equal\\n\" + \"[\" + correct + \"]\");\r\n\t\t}\r\n } catch (Exception e) {\r\n e.printStackTrace();\r\n }\r\n\t}","title":""},{"docid":"cd18b4bea93acf6deb06d3d3d9c6884c","score":"0.58709604","text":"public static void generateCoverageFile() {\n }","title":""},{"docid":"249041d3663de7e12f73c419ebe8a1ab","score":"0.58705425","text":"public boolean restrictionOfMethodsRunTest() {\n CoverageUnitTester cut = cutForConfiguredPackage(Grandtestauto.test83_zip, \"a83.test\", null, null, null, null, null);\n methodsCalled.clear();\n cut.runTests();\n List<String> expected = new LinkedList<>();\n expected.add(\"constructor_A_Test\");\n expected.add(\"aTest\");\n expected.add(\"bTest\");\n expected.add(\"cTest\");\n expected.add(\"dTest\");\n expected.add(\"eTest\");\n expected.add(\"constructor_B_Test\");\n expected.add(\"xTest\");\n expected.add(\"x_int_Test\");\n expected.add(\"x_String_Test\");\n expected.add(\"yTest\");\n expected.add(\"y_intArray_Test\");\n Helpers.assertSameContents(methodsCalled, expected);\n\n //Run just ATest, and only methods b to dTest.\n cut = cutForConfiguredPackage(Grandtestauto.test83_zip, \"a83.test\", \"a83\", \"A\", \"b\", \"dTest\", null);\n methodsCalled.clear();\n cut.runTests();\n expected = new LinkedList<>();\n expected.add(\"bTest\");\n expected.add(\"cTest\");\n expected.add(\"constructor_A_Test\");\n expected.add(\"dTest\");\n Helpers.assertSameContents(methodsCalled, expected);\n\n //Run just ATest, and only methods to d.\n cut = cutForConfiguredPackage(Grandtestauto.test83_zip, \"a83.test\", \"a83\", \"A\", null, \"d\", null);\n methodsCalled.clear();\n cut.runTests();\n expected = new LinkedList<>();\n expected.add(\"aTest\");\n expected.add(\"bTest\");\n expected.add(\"cTest\");\n expected.add(\"constructor_A_Test\");\n Helpers.assertSameContents(methodsCalled, expected);\n\n //Run just ATest, and only methods from c.\n cut = cutForConfiguredPackage(Grandtestauto.test83_zip, \"a83.test\", \"a83\", \"A\", \"c\", null, null);\n methodsCalled.clear();\n cut.runTests();\n expected = new LinkedList<>();\n expected.add(\"cTest\");\n expected.add(\"constructor_A_Test\");\n expected.add(\"dTest\");\n expected.add(\"eTest\");\n Helpers.assertSameContents(methodsCalled, expected);\n\n //Run just ATest, and only cTest..\n cut = cutForConfiguredPackage(Grandtestauto.test83_zip, \"a83.test\", \"a83\", \"A\", null, null, \"cTest\");\n methodsCalled.clear();\n cut.runTests();\n expected = new LinkedList<>();\n expected.add(\"cTest\");\n Helpers.assertSameContents(methodsCalled, expected);\n\n //Single method overrides other settings\n cut = cutForConfiguredPackage(Grandtestauto.test83_zip, \"a83.test\", \"a83\", \"A\", \"a\", \"d\", \"cTest\");\n methodsCalled.clear();\n cut.runTests();\n expected = new LinkedList<>();\n expected.add(\"cTest\");\n Helpers.assertSameContents(methodsCalled, expected);\n\n return true;\n }","title":""},{"docid":"6fc1d259680434bdbcbe2f9443e150ed","score":"0.58572346","text":"TestRun createTestRun();","title":""},{"docid":"6b2619817224da6f5ebd947ee4b4a26e","score":"0.5846859","text":"private static void testCases() {\n\t\tgetNameTests();\n\t\tgetBaseDecadeTests();\n\t\tgetRankTests();\n\t\tgetBestDecadeTests();\n\t\tnumTimesTop1000Tests();\n\t\ttop1000EveryDecadeTests();\n\t\ttop1000OnceDecadeTests();\n\t\tmorePopularTests();\n\t\tlessPopularTests();\n\t\ttoStringTests();\n\t\tcompareToTests();\n\t\tgetTimesRank1Tests();\n\t}","title":""},{"docid":"e0a3c20abbdda630bf75a69ca97bd20f","score":"0.58199215","text":"@Test\n\tpublic void Driver() {\n\n\t\tfinal Object testingData[][] = {\n\n\t\t\t//Test #01: Correct execution of test. Expected true.\n\t\t\t{\n\t\t\t\t\"auditor1\", \"http://attachment.com,https://www.google.es\", \"testDescription\", \"testTitle\", false, true, null\n\t\t\t},\n\n\t\t\t//Test #02: Attempt to create an audit with incorrect credentials. Expected false.\n\t\t\t{\n\t\t\t\t\"user1\", \"http://attachment.com,https://www.google.es\", \"testDescription\", \"testTitle\", false, true, ClassCastException.class\n\t\t\t},\n\n\t\t\t//Test #03: Attempt to save an audit with blank fields. Expected false.\n\t\t\t{\n\t\t\t\t\"auditor1\", \"\", \"\", \"\", false, true, ConstraintViolationException.class\n\t\t\t}\n\n\t\t};\n\n\t\tfor (int i = 0; i < testingData.length; i++)\n\t\t\tthis.Template((String) testingData[i][0], (String) testingData[i][1], (String) testingData[i][2], (String) testingData[i][3], (boolean) testingData[i][4], (boolean) testingData[i][5], (Class<?>) testingData[i][6]);\n\t}","title":""},{"docid":"637260c55f5659f222f9d1d2e97cd2e7","score":"0.58183855","text":"@Test\r\n public void randomFilesTestDepFindRunner()\r\n {\r\n //TODO\r\n }","title":""},{"docid":"d640256da1f00fea9ae23f7dbc051c8f","score":"0.58171856","text":"@Test\n public void testGetActions() \n {\n System.out.println(\"General ActionCard\");\n testGeneralActionCard();\n \n System.out.println(\"Snoop\");\n testSnoop();\n \n System.out.println(\"AllSnoop\");\n testAllSnoop();\n \n System.out.println(\"PrivateTip\");\n testPrivateTip();\n \n System.out.println(\"SuperSleuth\");\n testSuperSleuth();\n \n System.out.println(\"Suggestion\");\n testSuggestion();\n }","title":""},{"docid":"5b4f62e3e2282aa0f7dd0e06f8dacc3a","score":"0.58114403","text":"private void createNewTestMethod(String fnm,String nm,String ipnm,String icnm,boolean newcls,String cnts)\n{\n int idx = nm.lastIndexOf(\".\");\n String cnm = nm.substring(0,idx);\n String mnm = nm.substring(idx+1);\n if (cnts == null) cnts = \"// insert test code here\";\n if (icnm != null) cnm = icnm;\n\n if (newcls) {\n String xnm = null;\n if (cnm.endsWith(\"Test\")) {\n\t xnm = cnm;\n\t int ln = xnm.length();\n\t xnm = xnm.substring(0,ln-4);\n }\n BuenoProperties props = new BuenoProperties();\n props.put(BuenoKey.KEY_ADD_COMMENT,Boolean.TRUE);\n if (xnm != null) props.put(BuenoKey.KEY_COMMENT,\"Test class for \" + xnm);\n else props.put(BuenoKey.KEY_COMMENT,\"Test Class\");\n props.put(BuenoKey.KEY_NAME,cnm);\n props.put(BuenoKey.KEY_MODIFIERS,Modifier.PUBLIC);\n String cnnm = cnm;\n String pkg = cnnm;\n int idx1 = cnnm.lastIndexOf(\".\");\n if (idx1 < 0) pkg = null;\n else {\n\t pkg = cnnm.substring(0,idx1);\n\t cnnm = cnnm.substring(idx1+1);\n\t props.put(BuenoKey.KEY_PACKAGE, pkg);\n\t props.put(BuenoKey.KEY_NAME, cnnm);\n }\n props.put(BuenoKey.KEY_IMPORTS, \"import org.junit.*;\");\n BuenoLocation loc = BuenoFactory.getFactory().createLocation(ipnm,cnm,pkg,false);\n BuenoFactory.getFactory().createNew(BuenoType.NEW_CLASS, loc, props);\n\n loc = BuenoFactory.getFactory().createLocation(ipnm,cnm,null,true);\n\n props = new BuenoProperties();\n props.put(BuenoKey.KEY_ADD_COMMENT,Boolean.TRUE);\n props.put(BuenoKey.KEY_COMMENT,\"Default Constrcutor for test class \" + cnm);\n String cxnm = cnm;\n int cidx = cxnm.lastIndexOf(\".\");\n if (cidx > 0) cxnm = cxnm.substring(cidx+1);\n props.put(BuenoKey.KEY_NAME,cxnm);\n props.put(BuenoKey.KEY_MODIFIERS,Modifier.PUBLIC);\n props.put(BuenoKey.KEY_CONTENTS,\"\\n\");\n\n BuenoFactory.getFactory().createNew(BuenoType.NEW_CONSTRUCTOR,loc,props);\n }\n\n String anm = null;\n // anm should be last test in class, or null if there are none\n BuenoLocation loc = BuenoFactory.getFactory().createLocation(ipnm,cnm,anm,true);\n\n BuenoProperties props = new BuenoProperties();\n props.put(BuenoKey.KEY_ADD_COMMENT,Boolean.TRUE);\n props.put(BuenoKey.KEY_COMMENT,\"Test case for \" + fnm);\n props.put(BuenoKey.KEY_NAME,mnm);\n props.put(BuenoKey.KEY_RETURNS,\"void\");\n props.put(BuenoKey.KEY_MODIFIERS,Modifier.PUBLIC);\n props.put(BuenoKey.KEY_CONTENTS,cnts);\n props.put(BuenoKey.KEY_ATTRIBUTES,\"@Test\");\n\n BuenoFactory.getFactory().createNew(BuenoType.NEW_METHOD,loc,props);\n}","title":""},{"docid":"2aea5e6b9b9d011c5bd3045d09ecac5d","score":"0.5790926","text":"private String compileTestResults(status stat, ITestResult tr, String duration) {\n String methodName = tr.getMethod().getMethodName();\n Boolean testPassed = true;\n if (stat != status.PASS) {\n testPassed = false;\n }\n StringBuilder msg = new StringBuilder(\"Finished \" + methodName + \" test - \");\n if (testPassed) {\n msg.append(\"PASSED - Total Time: \");\n msg.append(duration);\n } else {\n msg.append(\"FAILED\");\n msg.append(getExceptionInfo(tr));\n }\n return msg.toString();\n }","title":""},{"docid":"966c820eb174f2fcac94717ed8ea8126","score":"0.5788447","text":"void testMethod1();","title":""},{"docid":"44c4a35db3f81e1125f0eb63cc7d4a79","score":"0.5774179","text":"public void writeTestCase( String testName, URI testServer, RequestCase requestCase, IndentedWriter targetWriter);","title":""},{"docid":"9ec5b714b28ce6bef7525676e13e24bc","score":"0.57712454","text":"private static void run_tests() {\n System.out.println(\"Tests all good!\");\n }","title":""},{"docid":"ae26f7a2c9e6b4ae27eec116300e0c9b","score":"0.57563734","text":"@Test\r\n\tvoid test() throws Exception {\r\n\t\tIssueLog.sytemprint=true;\r\n\t\t\r\n\t\texportTest();\r\n\t\t\r\n\t\t\r\n\t\t\r\n\t\r\n\t}","title":""},{"docid":"d4f34f30127df2600ca75f373c441cb8","score":"0.5749401","text":"@Test\n void list() {\n }","title":""},{"docid":"a9e08e32d1abed44249991f808dede73","score":"0.57488847","text":"public void testcase1() {\n }","title":""},{"docid":"e45002975605251e36cb5f59b80ed9bb","score":"0.57396215","text":"public void testMain() {\n }","title":""},{"docid":"5a4d578f9ce320fe2a5e1027eb9a1a47","score":"0.5739247","text":"@Test\n\tpublic void testRun() {\n\t}","title":""},{"docid":"16756ef2553ea7add0dffa18269bbd81","score":"0.57251626","text":"@Test\n public void verifyOnlyOneInstanceOfTestClassForAllTestMethods() {\n Multimap<Object,TestNgRunStateTracker.EventLog> testMethodAEventLogMap =\n getTestMethodEventLogsForMethod(\"SingleTestSuite\", \"SingleTestClassTest\",\n TestClassAWithNoDepsSample.class.getCanonicalName(), \"testMethodA\");\n\n Multimap<Object,TestNgRunStateTracker.EventLog> testMethodBEventLogMap =\n getTestMethodEventLogsForMethod(\"SingleTestSuite\", \"SingleTestClassTest\",\n TestClassAWithNoDepsSample.class.getCanonicalName(), \"testMethodB\");\n\n Multimap<Object,TestNgRunStateTracker.EventLog> testMethodCEventLogMap =\n getTestMethodEventLogsForMethod(\"SingleTestSuite\", \"SingleTestClassTest\",\n TestClassAWithNoDepsSample.class.getCanonicalName(), \"testMethodC\");\n\n Multimap<Object,TestNgRunStateTracker.EventLog> testMethodDEventLogMap =\n getTestMethodEventLogsForMethod(\"SingleTestSuite\", \"SingleTestClassTest\",\n TestClassAWithNoDepsSample.class.getCanonicalName(), \"testMethodD\");\n\n Multimap<Object,TestNgRunStateTracker.EventLog> testMethodEEventLogMap =\n getTestMethodEventLogsForMethod(\"SingleTestSuite\", \"SingleTestClassTest\",\n TestClassAWithNoDepsSample.class.getCanonicalName(), \"testMethodE\");\n\n assertEquals(testMethodAEventLogMap.keySet().size(), 1, \"There should be only one test class instance \" +\n \"associated with testMethodA from \" + TestClassAWithNoDepsSample.class.getCanonicalName());\n assertEquals(testMethodBEventLogMap.keySet().size(), 1, \"There should be only one test class instance \" +\n \"associated with testMethodB from \" + TestClassAWithNoDepsSample.class.getCanonicalName());\n assertEquals(testMethodCEventLogMap.keySet().size(), 1, \"There should be only one test class instance \" +\n \"associated with testMethodC from \" + TestClassAWithNoDepsSample.class.getCanonicalName());\n assertEquals(testMethodDEventLogMap.keySet().size(), 1, \"There should be only one test class instance \" +\n \"associated with testMethodD from \" + TestClassAWithNoDepsSample.class.getCanonicalName());\n assertEquals(testMethodEEventLogMap.keySet().size(), 1, \"There should be only one test class instance \" +\n \"associated with testMethodE from \" + TestClassAWithNoDepsSample.class.getCanonicalName());\n\n Object methodAInstanceKey = testMethodAEventLogMap.keySet().toArray()[0];\n Object methodBInstanceKey = testMethodBEventLogMap.keySet().toArray()[0];\n Object methodCInstanceKey = testMethodCEventLogMap.keySet().toArray()[0];\n Object methodDInstanceKey = testMethodDEventLogMap.keySet().toArray()[0];\n Object methodEInstanceKey = testMethodEEventLogMap.keySet().toArray()[0];\n\n assertTrue(\n methodAInstanceKey == methodBInstanceKey &&\n methodBInstanceKey == methodCInstanceKey &&\n methodCInstanceKey == methodDInstanceKey &&\n methodDInstanceKey == methodEInstanceKey,\n \"The test methods should all have the same single test class instance\"\n );\n }","title":""},{"docid":"803eab056b24d49df02759058fe149d9","score":"0.5714136","text":"public void setUp()\n {\n \tString home = new File(\".\").getAbsolutePath() + \"/testfiles\";\n\t\t\ttestFile1 =\n new File(\n home,\n \"Test Plan.jmx\");\n testFile2 =\n new File(\n home,\n \"Modification Manager.jmx\");\n testFile3 =\n new File(\n home,\n \"proxy.jmx\");\n testFile4 =\n new File(\n home,\n \"AssertionTestPlan.jmx\");\n testFile5 =\n new File(\n home,\n \"AuthManagerTestPlan.jmx\");\n testFile6 =\n new File(\n home,\n \"HeaderManagerTestPlan.jmx\");\n testFile7 =\n new File(\n home,\n \"InterleaveTestPlan.jmx\");\n testFile8 =\n new File(\n home,\n \"InterleaveTestPlan2.jmx\");\n testFile9 =\n new File(\n home,\n \"LoopTestPlan.jmx\");\n testFile10 =\n new File(\n home,\n \"OnceOnlyTestPlan.jmx\");\n testFile11 =\n new File(\n home,\n \"ProxyServerTestPlan.jmx\");\n testFile12 =\n new File(\n home,\n \"SimpleTestPlan.jmx\");\n testFile13 =\n new File(\n home,\n \"URLRewritingExample.jmx\");\n }","title":""},{"docid":"59eb240de3fc6321224526e6285f254f","score":"0.5709138","text":"@Test\n public void toTest() {\n // TODO: test to\n }","title":""},{"docid":"59eb240de3fc6321224526e6285f254f","score":"0.5709138","text":"@Test\n public void toTest() {\n // TODO: test to\n }","title":""},{"docid":"dea577c162189bd2dd2ed8dab614dd0a","score":"0.57085544","text":"@Test\n public void mainPerson() {\n\n }","title":""},{"docid":"98717c4382d9db2917e11a08d6a7553e","score":"0.57066476","text":"@Test\n public void testSlipUploadMonthly() {\n // TODO: test SlipUploadMonthly\n }","title":""},{"docid":"92d38a095da75f967f8a988eb5953fb2","score":"0.56991744","text":"@Test\n void getPizzaThatNeedSupplyNow() {\n }","title":""},{"docid":"aacddf68bf6dab1f135856f2a60e0ee0","score":"0.5686703","text":"@Test\n public void finall(){\n }","title":""},{"docid":"0251ffbc2e6fdd2f664133343e1c3d74","score":"0.56792766","text":"TestSuite createTestSuite();","title":""},{"docid":"ca59707c88098aae21f3a1d7112fab8f","score":"0.56785893","text":"@Test\n public void testSantaWithFile() throws Exception {\n mySanta.processFile();\n }","title":""},{"docid":"b05c216dea497588e6186106878a9bc3","score":"0.56695193","text":"@Test\n public void testSerFileHandlerWrite() {\n }","title":""},{"docid":"db6417cf006fe540f1d986463be526e0","score":"0.5668416","text":"public static void main(String[] args) {\n\t\tResult result = JUnitCore.runClasses( JUnitTester.class);\r\n\r\n\t\tfor (Failure failure : result.getFailures()) {\r\n\t\t\tSystem.out.println(failure.toString());\r\n\t\t}\r\n\r\n\t\tSystem.out.println( \"All Test Cases Successful - \" + result.wasSuccessful() );\r\n\t}","title":""},{"docid":"05edab9b9b35e0f164258b8f771ed14a","score":"0.56656396","text":"@Test\n public void test1() {\n }","title":""},{"docid":"1eb04d8e0f88c2c796432a56cfc5d234","score":"0.5663856","text":"@Test\n\tpublic void tc1() {\n\n\t\t\n\t\tSystem.out.println(\"Suitb test 1\");\n\t\t\n\t}","title":""},{"docid":"cb482dec0e942f62c4cef06a7471bb45","score":"0.5659673","text":"@Test\n public void addTests() {\n System.out.println(\"Teste: LectureReader\"); \n try {\n testReadFile();\n } catch (Exception e) {\n System.out.println(\"- \" + e.toString());\n } \n }","title":""},{"docid":"e2e32367849703f2b1f2afed9065bcba","score":"0.56558615","text":"@Test\n\tpublic void note(){\n\t}","title":""},{"docid":"08bc8f3e3b13273e9780530952c01001","score":"0.5643398","text":"public static void main(String args[]) throws FileNotFoundException {\n if (args.length != 7 && args.length != 8) {\n throw new RuntimeException(\"usage: Processor trace-file tcg-dump-out inst-info-dump hierarchy-dump test-case-name test-method-name tested-class [output-package]\");\n }\n\n String traceFileName = args[0];\n String tcgDump = args[1];\n String iiDump = args[2];\n String hierDump = args[3];\n String testCaseName = args[4];\n String testMethodName = args[5];\n ClassName testedClass = ClassName.fromDotted(args[6]);\n\n String outputPackage = args.length == 8\n ? args[7]\n : testedClass.dottedPackageName();\n\n Hierarchy hierarchy = Hierarchy.createFromFile(hierDump);\n\n TestCaseGenerator tcg\n = new TestCaseGenerator(testCaseName, outputPackage);\n TestMethodGenerator tmg = new TestMethodGenerator(testMethodName,\n hierarchy,\n true);\n tcg.addChunk(tmg);\n\n InputStream in = new FileInputStream(traceFileName);\n Deserializer<TraceEvent> d\n = Deserializer.getDeserializer(in, TraceEvent.class);\n\n Map<Instance, InstanceInfo> iis = readInstanceInfos(iiDump);\n\n\n Processor p = new Processor(tmg, testedClass, iis, hierarchy);\n d.process(p);\n\n PrintStream ps = new PrintStream(tcgDump);\n Serializer<TestCaseGenerator> s = Serializer.getSerializer(ps);\n\n s.write(tcg);\n s.close();\n }","title":""},{"docid":"257204a78ebf434d20420f008ec2f7d4","score":"0.564175","text":"@Test\r\n\tpublic void testcusumes(){\r\n\t}","title":""},{"docid":"7a4201a320f8295f0e1253b87245bf86","score":"0.5632411","text":"@Test\n public void testFindAll() {\n }","title":""},{"docid":"fd0da0bb95eaed83f6307845110fa4d5","score":"0.56258476","text":"protected void runTests()\r\n\t{\r\n\t\ttry\r\n\t\t{\r\n\t\t\tboolean javadocTest = executeTest(JUnitJavadocValidation.class);\r\n\t\t\tboolean userTest = executeTest(JUnitUserTest.class);\r\n\t\t\tboolean accountTest = executeTest(JUnitAccountTest.class);\r\n\t\t\tboolean result = javadocTest && userTest && accountTest;\r\n\r\n\t\t\ttrace(result ? \"PASSED\" : \"FAILED\");\r\n\t\t}\r\n\t\tcatch(Exception ex)\r\n\t\t{\r\n\t\t\ttrace(ex.getMessage());\r\n\t\t}\r\n\t}","title":""},{"docid":"d974a6bb29ad8ebc7969619bc8791059","score":"0.56142807","text":"@Test\n public void testCase1() {\n }","title":""},{"docid":"1b6a9fc1d62e40cd35c1aad4c77f8966","score":"0.56132317","text":"public static void main(String[] args) {\n test_all();\n }","title":""},{"docid":"5908eb2c8c168b69ab361c326df5d6d5","score":"0.5600608","text":"public void testBuild() {\n }","title":""},{"docid":"2f38603641d09d611317a30aed590e86","score":"0.55999273","text":"private static void addTests() {\n\t\tString testDirectoryName = Properties.testDirectory.getAbsolutePath();\n\t\ttests = new ArrayList<TestSet>();\n//\t\ttests.add(new TestSet(testDirectoryName, \"ecoli\"));\n\t\ttests.add(new TestSet(testDirectoryName, \"human\"));\n\t\ttests.add(new TestSet(testDirectoryName, \"aurum\"));\t\n\t\ttests.add(new TestSet(testDirectoryName, \"USP top 10\"));\n\t}","title":""},{"docid":"b8b1bdd9465152d1984370881bea9642","score":"0.5596091","text":"@Test\n public void Test1(){\n }","title":""},{"docid":"3ddc344db1e0040fe2ce0a2dda59c8b9","score":"0.5596012","text":"@Test\n public void testMyPackagePackageResults() throws Exception {\n FreeStyleProject p = r.createFreeStyleProject();\n Publisher publisher = new Publisher();\n publisher.setReportFilenamePattern(\"testng.xml\");\n p.getPublishersList().add(publisher);\n p.onCreatedFromScratch(); //to setup project action\n\n p.getBuildersList().add(new TestBuilder() {\n @Override\n public boolean perform(AbstractBuild<?, ?> build, Launcher launcher,\n BuildListener listener) throws InterruptedException, IOException {\n String contents = CommonUtil.getContents(Constants.TESTNG_XML_EMPTY_EXCEPTION);\n build.getWorkspace().child(\"testng.xml\").write(contents,\"UTF-8\");\n return true;\n }\n });\n\n //run build\n FreeStyleBuild build = p.scheduleBuild2(0).get();\n\n //Get page\n String urlPrefix = build.getUrl() + PluginImpl.URL;\n HtmlPage page = r.createWebClient().goTo(urlPrefix + \"/my.package\");\n\n //verify only first 25 methods are shown\n assertNull(page.getElementById(\"showAllLink\"));\n\n //verify bar\n HtmlElement element = page.getElementById(\"fail-skip\", true);\n r.assertStringContains(element.getTextContent(), \"0 failures\");\n assertFalse(element.getTextContent().contains(\"skipped\"));\n element = page.getElementById(\"pass\", true);\n r.assertStringContains(element.getTextContent(), \"1 test\");\n assertFalse(element.getTextContent().contains(\"tests\"));\n }","title":""},{"docid":"09e8ac8d3524b0903ed0484c13ec8881","score":"0.5593912","text":"@Test\n public void testMain() {\n }","title":""},{"docid":"ba216c41ed88d07187dab1ef30263f4e","score":"0.5593118","text":"public void testcase2(){\n}","title":""},{"docid":"067c556d3f8e26b1a2df09ac085eef6f","score":"0.55921197","text":"static void statMethod() {\n\t\tSystem.out.println(\"statMethod in test class\");\n\t}","title":""},{"docid":"4126105c4f64d5b683079f2122e010d0","score":"0.55865437","text":"@Test\n public void test5(){\n }","title":""},{"docid":"7ff6d6f80de2c258b861542872119d93","score":"0.55857664","text":"@Test\r\n public void testMain() {\r\n }","title":""},{"docid":"28bd8503bf1a7ea24509fbf43bef209f","score":"0.5583388","text":"public synchronized void testEnded(final String name) {\n if (!traceDirDumped) {\n ClassLoader classLoader = TestDiscoveryInstrumentator.class.getClassLoader();\n System.out.println(ourData + \"; cl: \" + classLoader+ \",\" + classLoader.getParent());\n System.out.println(\"Trace dir:\" + myTraceDir);\n traceDirDumped = true;\n }\n new File(myTraceDir).mkdirs();\n final File traceFile = new File(myTraceDir, name + \".tr\");\n try {\n if (!traceFile.exists()) {\n traceFile.createNewFile();\n }\n DataOutputStream os = null;\n Deflater def = new Deflater(1);\n try {\n os = new DataOutputStream(new DeflaterOutputStream(new BufferedOutputStream(new FileOutputStream(traceFile)), def));\n\n //saveOldTrace(os);\n\n Map<String, Integer> classToUsedMethods = new HashMap<String, Integer>();\n for(Map.Entry<String, boolean[]> e: myTrace2.entrySet()) {\n boolean[] used = e.getValue();\n int usedMethodsCount = 0;\n\n for (boolean anUsed : used) {\n if (anUsed) ++usedMethodsCount;\n }\n\n if (usedMethodsCount > 0) {\n classToUsedMethods.put(e.getKey(), usedMethodsCount);\n }\n }\n\n os.writeInt(classToUsedMethods.size());\n for(Map.Entry<String, boolean[]> e: myTrace2.entrySet()) {\n final boolean[] used = e.getValue();\n final String className = e.getKey();\n\n Integer integer = classToUsedMethods.get(className);\n if (integer == null) continue;;\n\n int usedMethodsCount = integer;\n\n os.writeUTF(className);\n os.writeInt(usedMethodsCount);\n\n String[] methodNames = myTrace3.get(className);\n for (int i = 0, len = used.length; i < len; ++i) {\n // we check usedMethodCount here since used was observed to change // ?\n if (used[i] && usedMethodsCount-- > 0) os.writeUTF(methodNames[i]);\n }\n }\n }\n finally {\n if (os != null) {\n os.close();\n }\n def.end();\n }\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n finally {\n myTrace = null;\n }\n }","title":""},{"docid":"8eb76ce2902f058a7bd74db83bd40c5b","score":"0.55770105","text":"@Test\n public void resultTest() {\n // TODO: test result\n }","title":""},{"docid":"bd5a8c32b53117ae5d563b249179765c","score":"0.5575521","text":"private static void createResultsFile(){\n\t\ttry {\n\t\t\tString outputFileName = testFileClass.toUpperCase() + \" k=\" + k + \" m=\" + m + \" TestingResults.txt\";\n\t\t\tPrintWriter writer = new PrintWriter(outputFileName, \"UTF-8\");\n//\t\t\tSystem.out.println(\"With k=\" + k + \" and m=\" + m);\n//\t\t\tSystem.out.println(\"fraction of emails correctly classified as \" + testFileClass + \": \" + correctlyClassifiedCount/numberOfTestFiles);\n\t\t\twriter.println(\"With k=\" + k + \" and m=\" + m);\n\t\t\twriter.println(\"fraction of emails correctly classified as \" + testFileClass + \": \" + correctlyClassifiedCount/numberOfTestFiles);\n\t\t\tfor(int i = 0; i < numberOfTestFiles; i++){\n\t\t\t\tClassifiedEmail currentEmail = classifiedEmails.get(i);\n\t\t\t\twriter.println(currentEmail.getEmailFileName()\n\t\t\t\t\t\t+ \" was classified as \"\n\t\t\t\t\t\t+ currentEmail.getEmailClassification());\n\t\t\t\twriter.println(\"Ham posterior log: \" + currentEmail.getHamProbabilityLog());\n\t\t\t\twriter.println(\"Spam posterior log: \" + currentEmail.getSpamProbabilityLog());\n\t\t\t\twriter.println();\n\t\t\t}\n\t\t\twriter.close();\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\t\t\n\t}","title":""},{"docid":"44ad41e06a72447dec05104140dc3276","score":"0.557166","text":"@Test\n public void testGetReaderMethods() {\n writeBanner(methodName());\n\n Set<String> readerMethods = Set.of(\"getLastName\", \"getAge\", \"isDemocrat\", \"getFirstName\");\n\n ClassInfo<Person> classInfo = new ClassInfo<>(Person.class);\n List<Method> methods = classInfo.getReaderMethods();\n\n assertThat(methods.size()).isEqualTo(readerMethods.size());\n\n methods.forEach(m -> {\n assertThat(readerMethods).contains(m.getName());\n });\n }","title":""},{"docid":"2332874b36904539e563c6598d6f1e17","score":"0.55708414","text":"@Test\n public void testUsersInfo() {\n }","title":""},{"docid":"56a9e45de5e750cf9f856822c247ef33","score":"0.55662394","text":"private List<MethodTree> generateTestMethods(\n TypeElement srcClass,\n CharSequence instanceClsName,\n List<ExecutableElement> srcMethods,\n WorkingCopy workingCopy) {\n if (srcMethods.isEmpty()) {\n return Collections.<MethodTree>emptyList();\n }\n\n List<String> testMethodNames\n = TestMethodNameGenerator.getTestMethodNames(srcMethods,\n null,\n null, //reserved\n workingCopy);\n\n Iterator<ExecutableElement> srcMethodsIt = srcMethods.iterator();\n Iterator<String> tstMethodNamesIt = testMethodNames.iterator();\n\n List<MethodTree> testMethods = new ArrayList<>(srcMethods.size());\n while (srcMethodsIt.hasNext()) {\n assert tstMethodNamesIt.hasNext();\n\n ExecutableElement srcMethod = srcMethodsIt.next();\n String testMethodName = tstMethodNamesIt.next();\n\n testMethods.add(\n generateTestMethod(srcClass,\n srcMethod,\n testMethodName,\n instanceClsName,\n workingCopy));\n }\n assert !tstMethodNamesIt.hasNext();\n return testMethods;\n }","title":""},{"docid":"3d4697bcacad1991b606a8a499c2d80b","score":"0.55648947","text":"@Test\n public void sourceTest() {\n // TODO: test source\n }","title":""},{"docid":"3d4697bcacad1991b606a8a499c2d80b","score":"0.55648947","text":"@Test\n public void sourceTest() {\n // TODO: test source\n }","title":""},{"docid":"7825c8e3e50b99aaabea40690e72b9c2","score":"0.5563135","text":"@Test\n void verifyCustomTestEngineTestStats() {\n\n EngineTestKit\n .engine(new CustomTestEngine())\n .selectors(\n selectFile(\"D:\\\\Codes\\\\GRG001JUnitAsAHabitTestEngine\\\\tests\\\\test1.txt\"),\n selectFile(\"D:\\\\Codes\\\\GRG001JUnitAsAHabitTestEngine\\\\tests\\\\test2.txt\"),\n selectFile(\"D:\\\\Codes\\\\GRG001JUnitAsAHabitTestEngine\\\\tests\\\\test3.txt\"),\n selectFile(\"D:\\\\Codes\\\\GRG001JUnitAsAHabitTestEngine\\\\tests\\\\test4.txt\"),\n selectFile(\"D:\\\\Codes\\\\GRG001JUnitAsAHabitTestEngine\\\\tests\\\\test5.txt\"),\n selectFile(\"D:\\\\Codes\\\\GRG001JUnitAsAHabitTestEngine\\\\tests\\\\test6.txt\"),\n selectFile(\"D:\\\\Codes\\\\GRG001JUnitAsAHabitTestEngine\\\\tests\\\\test7.txt\"),\n selectFile(\"D:\\\\Codes\\\\GRG001JUnitAsAHabitTestEngine\\\\tests\\\\test8.txt\"),\n selectFile(\"D:\\\\Codes\\\\GRG001JUnitAsAHabitTestEngine\\\\tests\\\\test9.txt\"),\n selectFile(\"D:\\\\Codes\\\\GRG001JUnitAsAHabitTestEngine\\\\tests\\\\test10.txt\")\n )\n .execute()\n .testEvents()\n .assertStatistics(stats -> stats.started(10).succeeded(9).failed(1)\n );\n\n }","title":""},{"docid":"c49d5ea9384a4c578ac89890887cb84c","score":"0.5552897","text":"private void printTestResults(final ITestResult result) {\r\n\r\n\t\tReporter.log(\"Test Method resides in \" + result.getTestClass().getName(), true);\r\n\t\tif (result.getParameters().length != 0) {\r\n\t\t\tString params = null;\r\n\t\t\tfor (Object parameter : result.getParameters()) {\r\n\t\t\t\tparams += parameter.toString() + \",\";\r\n\t\t\t}\r\n\t\t\tif (params != null) {\r\n\t\t\t\tReporter.log(\"Test Method had the following parameters : \" + params, true);\r\n\t\t\t}\r\n\t\t}\r\n\t\tString status = null;\r\n\t\tswitch (result.getStatus()) {\r\n\t\tcase ITestResult.SUCCESS:\r\n\t\t\tstatus = \"Pass\";\r\n\t\t\tbreak;\r\n\t\tcase ITestResult.FAILURE:\r\n\t\t\tstatus = \"Failed\";\r\n\t\t\tbreak;\r\n\t\tcase ITestResult.SKIP:\r\n\t\t\tstatus = \"Skipped\";\r\n\t\t}\r\n\t\tReporter.log(\"Test Status: \" + status, true);\r\n\r\n\t}","title":""},{"docid":"74de44844a9d33d6f20840c71723b227","score":"0.55492234","text":"@Test\n public void statistic() {\n printHr();\n }","title":""},{"docid":"fe8bb15c2505a5760ddd79f710854dc7","score":"0.55441356","text":"public static void main(String[] args) {\r\n int tests = 0;\r\n try {\r\n for (Object obj : Files.list(Paths.get(\"src\")).toArray()) {\r\n if (obj.toString().endsWith(\".java\")\r\n && !obj.toString().endsWith(AutoTester.class.getSimpleName() + \".java\")) {\r\n String className = getExamplesClass(Files.readAllLines((Path) obj));\r\n if (!className.isEmpty()) {\r\n tests++;\r\n tester.Main.main(new String[] { className });\r\n }\r\n }\r\n }\r\n if (tests == 0) {\r\n System.err.println(\"No Examples classes could be found in the default package.\");\r\n }\r\n }\r\n catch (IOException e) {\r\n e.printStackTrace();\r\n }\r\n }","title":""},{"docid":"c5f122f13c28d2ffb32e80c42f11af4d","score":"0.5532337","text":"@Test(description = \"Test description\", dependsOnMethods = { \"testTwo\" })\r\n\tpublic void testThree() {\r\n\t\t/**\r\n\t\t * Test code\r\n\t\t */\r\n\t}","title":""},{"docid":"1df47b2d443eb369290ff1794247e347","score":"0.5532308","text":"@Test\n public void showAll() throws Exception {\n }","title":""},{"docid":"8b0b58db8412679f8c1cabaeed5eed58","score":"0.55253756","text":"File performGenerationSteps();","title":""},{"docid":"57631a415c046ef6f6434128c224b6d6","score":"0.55251276","text":"public void testGetToResources() {\n }","title":""},{"docid":"7b3f93ef1a2738d6b1cf73877ae8a5c0","score":"0.55236614","text":"public String runTests(String className) throws ClassNotFoundException {\n\n\t\tif (checkIfTest(className)) {\n\n\t\t\tMethod[] methods = null;\n\t\t\tClass<?> x = null;\n\t\t\tObject obj = null;\n\n\t\t\tprintResult = \"\";\n\t\t\ttestFailed = 0; /* Counter for failed tests */\n\t\t\ttestSucceded = 0; /* Counter for successful tests */\n\t\t\ttestFailByException = 0; /* Counter for tests failed by exception */\n\n\t\t\tx = Class.forName(className);\n\t\t\tmethods = x.getMethods();\n\n\t\t\t/* Creates a class object of the class. */\n\t\t\ttry {\n\t\t\t\tobj = x.newInstance();\n\t\t\t} catch (InstantiationException e1) {\n\t\t\t\tJOptionPane.showMessageDialog(null, \"Failed to create instance\"\n\t\t\t\t\t\t+ \" of the class \"+className, \"Error\",\n\t\t\t\t\t\tJOptionPane.ERROR_MESSAGE);\n//\t\t\t\tprintResult = \"Failed to create instance of the class \" + className\n//\t\t\t\t\t\t+ newLine;\n\t\t\t} catch (IllegalAccessException e1) {\n\t\t\t\tJOptionPane.showMessageDialog(null, \"Failed to create instance\"\n\t\t\t\t\t\t+ \" of the class \" + className, \"Error\",\n\t\t\t\t\t\tJOptionPane.ERROR_MESSAGE);\n//\t\t\t\tprintResult = \"Failed to create instance of the class \"\n//\t\t\t\t\t\t+ className + newLine;\n\t\t\t}\n\n\t\t\t/* Saves the setUp and tearDown methods for easier access */\n\t\t\tMethod setUp = null;\n\t\t\tMethod tearDown = null;\n\n\t\t\tfor (int i = 0; i < methods.length; i++) {\n\t\t\t\tif (methods[i].getName().contentEquals(\"setUp\")) {\n\t\t\t\t\tsetUp = methods[i];\n\t\t\t\t}\n\t\t\t\tif (methods[i].getName().contentEquals(\"tearDown\")) {\n\t\t\t\t\ttearDown = methods[i];\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t/* Invokes methods that start their name with \"test\" */\n\t\t\tfor (int i = 0; i < methods.length; i++) {\n\t\t\t\tif (methods[i].getName().startsWith(\"test\")) {\n\t\t\t\t\tprintResult += methods[i].getName();\n\n\t\t\t\t\ttry {\n\t\t\t\t\t\tif (setUp != null) {\n\t\t\t\t\t\t\tsetUp.invoke(obj);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\ttry {\n\t\t\t\t\t\t\tif (!(Boolean)methods[i].invoke(obj)) {\n\t\t\t\t\t\t\t\tprintResult += \": Fail\" + newLine;\n\t\t\t\t\t\t\t\ttestFailed++;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tprintResult += \": Success\" + newLine;\n\t\t\t\t\t\t\t\ttestSucceded++;\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t} catch (IllegalAccessException e) {\n\t\t\t\t\t\t\tJOptionPane.showMessageDialog(null, \"Failed to run \"\n\t\t\t\t\t\t\t\t\t+ methods[i].getName()\n\t\t\t\t\t\t\t\t\t+ \", method does not have access to the \"\n\t\t\t\t\t\t\t\t\t+ \"definition of the class\" + newLine,\n\t\t\t\t\t\t\t\t\t\"Error\", JOptionPane.ERROR_MESSAGE);\n\n\t\t\t\t\t\t} catch (IllegalArgumentException e) {\n\t\t\t\t\t\t\tJOptionPane.showMessageDialog(null, \"Failed to run \"\n\t\t\t\t\t\t\t\t\t+ methods[i].getName()\n\t\t\t\t\t\t\t\t\t+ \", method got passed wrong arguments?\",\n\t\t\t\t\t\t\t\t\t\"Error\", JOptionPane.ERROR_MESSAGE);\n\n\t\t\t\t\t\t} catch (InvocationTargetException e) {\n\t\t\t\t\t\t\tprintResult += \": Fail, generated a \"\n\t\t\t\t\t\t\t\t\t+ e.getTargetException() + newLine;\n\t\t\t\t\t\t\ttestFailByException++;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (tearDown != null) {\n\t\t\t\t\t\t\ttearDown.invoke(obj);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t} catch (IllegalAccessException e) {\n\t\t\t\t\t\tJOptionPane.showMessageDialog(null, \"Failed to run setUp or tearDown,\"\n\t\t\t\t\t\t\t\t+ \" test not run\", \"Error\",\n\t\t\t\t\t\t\t\tJOptionPane.ERROR_MESSAGE);\n\n\t\t\t\t\t\tprintResult += \"Failed to run setUp or tearDown,\"\n\t\t\t\t\t\t\t\t+ \" test not run\" + newLine;\n\t\t\t\t\t} catch (IllegalArgumentException e) {\n\t\t\t\t\t\tJOptionPane.showMessageDialog(null, \"Failed to run setUp or tearDown,\"\n\t\t\t\t\t\t\t\t+ \" test not run\", \"Error\",\n\t\t\t\t\t\t\t\tJOptionPane.ERROR_MESSAGE);\n\t\t\t\t\t} catch (InvocationTargetException e) {\n\t\t\t\t\t\tprintResult += \": Fail at setUp or tearDown, test not run.\";\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t/* Adds a summary of the result */\n\t\t\tprintResult += newLine + newLine + testSucceded + \" tests succeded\"\n\t\t\t\t\t+ newLine;\n\t\t\tprintResult += testFailed + \" tests failed\" + newLine;\n\t\t\tprintResult += testFailByException + \" tests failed because of \"\n\t\t\t\t\t+ \"an exception\" + newLine + newLine;\n\t\t}\n\t\treturn printResult;\n\t}","title":""},{"docid":"6b1ab5142b78b9d71096d7e81bf9f10c","score":"0.552065","text":"@Test\n public void testGetMethodParameters() {\n writeBanner(methodName());\n ClassInfo<Person> classInfo = new ClassInfo<>(Person.class);\n List<Method> methods = classInfo.getMethods();\n methods.forEach(m -> {\n writeln(\"method: {0}\", m.getName());\n List<Parameter> parameters = classInfo.getMethodParameters(m);\n parameters.forEach(p -> {\n writeln(\" parameter: {0}\", p);\n });\n });\n }","title":""},{"docid":"eda5790f36c4980869d2cdd02a088477","score":"0.55189556","text":"@Test\n public void testMiningExtraction() {\n // TODO: test MiningExtraction\n }","title":""},{"docid":"4fe23313e79a3c6eacf92bc5390ffac0","score":"0.55187607","text":"@Test(timeout = 4000)\n public void test086() throws Throwable {\n FileSystemHandling fileSystemHandling0 = new FileSystemHandling();\n assertNotNull(fileSystemHandling0);\n \n boolean boolean0 = FileSystemHandling.setPermissions((EvoSuiteFile) null, false, true, false);\n assertFalse(boolean0);\n \n boolean boolean1 = FileSystemHandling.appendLineToFile((EvoSuiteFile) null, \"Class not found\");\n assertTrue(boolean1 == boolean0);\n assertFalse(boolean1);\n \n ClassWriter classWriter0 = new ClassWriter(1646);\n assertEquals(1, ClassWriter.COMPUTE_MAXS);\n assertEquals(2, ClassWriter.COMPUTE_FRAMES);\n assertNotNull(classWriter0);\n \n String[] stringArray0 = new String[0];\n boolean boolean2 = FileSystemHandling.appendLineToFile((EvoSuiteFile) null, \"AnnotationDefault\");\n assertTrue(boolean2 == boolean1);\n assertTrue(boolean2 == boolean0);\n assertFalse(boolean2);\n \n MethodWriter methodWriter0 = new MethodWriter(classWriter0, 24117248, \"vPr='r-`^V@<#)X2Rcs\", \"AnnotationDefault\", \"ILek2S.Q;)gj\", stringArray0, false, false);\n assertEquals(1, ClassWriter.COMPUTE_MAXS);\n assertEquals(2, ClassWriter.COMPUTE_FRAMES);\n assertNotNull(methodWriter0);\n assertEquals(0, stringArray0.length);\n \n MethodWriter methodWriter1 = new MethodWriter(classWriter0, 1646, \"LocalVariableTable\", \"AnnotationDefault\", \"LocalVariableTable\", stringArray0, false, false);\n assertEquals(1, ClassWriter.COMPUTE_MAXS);\n assertEquals(2, ClassWriter.COMPUTE_FRAMES);\n assertFalse(methodWriter1.equals((Object)methodWriter0));\n assertNotNull(methodWriter1);\n assertEquals(0, stringArray0.length);\n \n Label label0 = new Label();\n assertNotNull(label0);\n \n methodWriter1.visitLocalVariable(\"6eTr!`6JjZw6,0?8'\", \" [E*GJhQBVWjjk\", \"Class not found\", label0, label0, 169);\n assertEquals(1, ClassWriter.COMPUTE_MAXS);\n assertEquals(2, ClassWriter.COMPUTE_FRAMES);\n assertFalse(methodWriter1.equals((Object)methodWriter0));\n assertNotSame(methodWriter1, methodWriter0);\n assertEquals(0, stringArray0.length);\n }","title":""},{"docid":"b4962a9721c3a871670d0ba35c491505","score":"0.5518394","text":"TestCaseReport report();","title":""},{"docid":"48d3389368d12a995902578e2337700f","score":"0.5517191","text":"@Test\n void test() {\n System.setProperty(\"karate.env\", \"docker\");\n Results results = Runner.path(\"classpath:jobtest/web\").parallel(1);\n ReportUtils.generateReport(results.getReportDir());\n }","title":""},{"docid":"71eb19fbccfae11b432f9be456dcfeac","score":"0.55166435","text":"public void testMethod(){\n\t}","title":""},{"docid":"c3017048fcf207277c390d48f7afe278","score":"0.5515788","text":"@Test\n public void testTest() {\n }","title":""},{"docid":"7373b624c375689698e5d65c9165fa0f","score":"0.55132705","text":"public static void main(String[] args) {\n System.out.println(\"All Tests passed\");\n }","title":""},{"docid":"9d4633c127429845154304c5ab9e07a1","score":"0.5512793","text":"@Override\n public TestSuite getAllTests() {\n TestSuite suite = new InstrumentationTestSuite(this);\n suite.addTestSuite(MediaRecorderStressTest.class);\n return suite;\n }","title":""},{"docid":"90b655b684ed01af36dbd22fe0e4adf5","score":"0.550532","text":"public void test() {\n // implementation\n }","title":""},{"docid":"320f11c57d51140d1b1c9946f6a2bc49","score":"0.5505208","text":"@Test\n public void test()\n {\n }","title":""},{"docid":"7c5291d7577c6bccd1b1765cd733f3f3","score":"0.550405","text":"public void run() {\n\n TestSuiteUtils.printHeader(this);\n\n //\n // Initial Setup\n //\n SimpleDateFormat date_format = TestSuiteUtils.getDateFormat();\n Date timestamp = new Date(System.currentTimeMillis());\n\n ConceptCluster concept_cluster = new ConceptCluster();\n\n addToLog(\n \" 1. Test ConceptCluster: add(Concept), getConcepts() ... \"\n + date_format.format(timestamp));\n\n Concept concept = new Concept.Default();\n concept.setCUI(new CUI(\"C0000001\"));\n concept.setPreferredAtom(new Atom.Default(1070));\n concept.setEditingAuthority(new Authority.Default(\"KEVRIC\"));\n concept.setEditingTimestamp(new java.util.Date());\n concept.setReadTimestamp(new java.util.Date());\n\n concept_cluster.add(concept);\n Concept[] concepts = concept_cluster.getConcepts();\n if (concepts.length > 0)\n addToLog(\" 1. Test Passed\");\n else {\n addToLog(\" 1. Test Failed\");\n thisTestFailed();\n }\n\n addToLog(\"\");\n\n if (this.isPassed())\n addToLog(\" All tests passed\");\n else\n addToLog(\" At least one test did not complete successfully\");\n\n //\n // Main Footer\n //\n\n addToLog(\"\");\n\n addToLog(\"-------------------------------------------------------\");\n addToLog(\"Finished TestSuiteConceptCluster at \" +\n date_format.format(new Date(System.currentTimeMillis())));\n addToLog(\"-------------------------------------------------------\");\n\n }","title":""},{"docid":"d4b1d6292486abdedeac6e834d9892cd","score":"0.5502525","text":"@Test\n public void small01() {\n }","title":""},{"docid":"d0d393edb4500b10a94256defc8d1310","score":"0.5502499","text":"public static void main(String[] args) {\n\t\tSystem.out.println(\"Test 1: \" + test1());\r\n\t\tSystem.out.println(\"Test 2: \" + test2());\r\n\t\tSystem.out.println(\"Test 3: \" + test3());\r\n\t\tSystem.out.println(\"Test 4: \" + test4());\r\n\t\tSystem.out.println(\"Test 5: \" + test5());\r\n\t}","title":""},{"docid":"295dddf5411d6a454ec000a08a5db47d","score":"0.54980534","text":"@Test\n public void test() {\n }","title":""},{"docid":"392df68537289b4975644050920da7ee","score":"0.5495031","text":"public static void main(String[] args) {\n\t\tTransformerServiceTest test = new TransformerServiceTest();\n\t\ttest.testSpecialWin();\n\t\ttest.testOneSpecialTransformerWin();\n\t\ttest.testStrenghAndCourage();\n\t\ttest.testSkill();\n\t\ttest.testWinnerByOverallRating();\n\t\ttest.testTie();\n\t\ttest.testWinningTeam();\n\t}","title":""},{"docid":"6e84e58dba09938941cc82f79d193bae","score":"0.549306","text":"@Override\r\n\tpublic void testing() {\n\t\t\r\n\t}","title":""},{"docid":"1cf2f377c1ac312c8c4dda8709708a1c","score":"0.5491713","text":"@Test\n public void testCreateChallenge() {\n System.out.println(\"createChallenge\");\n \n \n }","title":""},{"docid":"e9d496ee64062b3b7d66f7e820ae42ff","score":"0.54893976","text":"protected void setUp() {\r\n\t\tFile cleanDir = new File(clean);\r\n\t\tFile destDir = new File(root + \"\\\\method\");\r\n\t\tdestDir.mkdir();\r\n\r\n\t\t(new FileCopy(\r\n\t\t\t\tnew File(cleanDir, \"method_Parent.java\"),\r\n\t\t\t\tnew File(destDir, \"Parent.java\"), false)).run();\r\n\t\t(new FileCopy(\r\n\t\t\t\tnew File(cleanDir, \"method_Child.java\"),\r\n\t\t\t\tnew File(destDir, \"Child.java\"), false)).run();\r\n\r\n\t\t(new SummaryTraversal(root)).run();\r\n\t}","title":""},{"docid":"00da2a84576f56ffeb51a9cf44aecec0","score":"0.54837805","text":"@Test\n public void test() {\n\n }","title":""}],"string":"[\n {\n \"docid\": \"30cc09c4e75b59d723186d4a45af08b2\",\n \"score\": \"0.62376755\",\n \"text\": \"protected void generateTAPPerClass(ITestContext testContext) {\\r\\n List<ITestResult> testNGTestResults = TapTestNGUtil\\r\\n .getTestNGResultsOrderedByExecutionDate(this.resultMap);\\r\\n\\r\\n for (ITestResult testResult : testNGTestResults) {\\r\\n Class<?> clazz = testResult.getMethod().getRealClass();\\r\\n List<ITestResult> testResultsForThisClass = testResultsPerClass\\r\\n .get(clazz);\\r\\n if (testResultsForThisClass == null) {\\r\\n testResultsForThisClass = new LinkedList<ITestResult>();\\r\\n testResultsPerClass.put(clazz, testResultsForThisClass);\\r\\n }\\r\\n testResultsForThisClass.add(testResult);\\r\\n }\\r\\n\\r\\n Set<Class<?>> keySet = testResultsPerClass.keySet();\\r\\n\\r\\n for (Class<?> clazz : keySet) {\\r\\n TestSet testSet = new TestSet();\\r\\n\\r\\n List<ITestResult> testResults = testResultsPerClass.get(clazz);\\r\\n\\r\\n testSet.setPlan(new Plan(testResults.size()));\\r\\n\\r\\n for (ITestResult testResult : testResults) {\\r\\n TestResult tapTestResult = TapTestNGUtil.generateTAPTestResult(\\r\\n testResult, testSet.getNumberOfTestResults() + 1,\\r\\n isYaml());\\r\\n testSet.addTestResult(tapTestResult);\\r\\n }\\r\\n\\r\\n File output = new File(testContext.getOutputDirectory(),\\r\\n clazz.getName() + \\\".tap\\\");\\r\\n if (!output.getParentFile().exists()) {\\r\\n output.getParentFile().mkdirs();\\r\\n }\\r\\n tapProducer.dump(testSet, output);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"315770f61e7a7ae458f7694e962320d7\",\n \"score\": \"0.62147564\",\n \"text\": \"@Test\\n public void testGetMethods() {\\n writeBanner(methodName());\\n\\n ClassInfo<Person> classInfo = new ClassInfo<>(Person.class);\\n List<Method> methods = classInfo.getMethods();\\n methods.forEach(m -> writeln(\\\"reader method: {0}\\\", m));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a604e55edb217d282330c8e264c7bb6\",\n \"score\": \"0.6175507\",\n \"text\": \"@Test\\n public void testAll() {\\n test(\\\"CPU\\\", \\\"/smile/data/weka/cpu.arff\\\", 6);\\n //test(\\\"2dplanes\\\", \\\"/smile/data/weka/regression/2dplanes.arff\\\", 6);\\n //test(\\\"abalone\\\", \\\"/smile/data/weka/regression/abalone.arff\\\", 8);\\n //test(\\\"ailerons\\\", \\\"/smile/data/weka/regression/ailerons.arff\\\", 40);\\n //test(\\\"bank32nh\\\", \\\"/smile/data/weka/regression/bank32nh.arff\\\", 32);\\n test(\\\"autoMPG\\\", \\\"/smile/data/weka/regression/autoMpg.arff\\\", 7);\\n test(\\\"cal_housing\\\", \\\"/smile/data/weka/regression/cal_housing.arff\\\", 8);\\n test(\\\"puma8nh\\\", \\\"/smile/data/weka/regression/puma8NH.arff\\\", 8);\\n test(\\\"kin8nm\\\", \\\"/smile/data/weka/regression/kin8nm.arff\\\", 8);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28eb457a4c37430ff431766ec8876929\",\n \"score\": \"0.60567105\",\n \"text\": \"@Karate.Test\\n Karate testAll() {\\n return Karate.run().relativeTo(getClass());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f1f9eba10f3b4ffc432a20c8ccb29ff\",\n \"score\": \"0.6054023\",\n \"text\": \"public void run() {\\n\\n TestSuiteUtils.printHeader(this);\\n\\n //\\n // Initial Setup\\n //\\n SimpleDateFormat date_format = TestSuiteUtils.getDateFormat();\\n Date timestamp = new Date(System.currentTimeMillis());\\n\\n ConceptChecklist concept_checklist = new ConceptChecklist();\\n\\n addToLog(\\n \\\" 1. Test ConceptChecklist: add(Concept[]), getConcepts() ... \\\"\\n + date_format.format(timestamp));\\n\\n ArrayList list = new ArrayList();\\n Concept concept = new Concept.Default();\\n concept.setCUI(new CUI(\\\"C0000001\\\"));\\n concept.setPreferredAtom(new Atom.Default(1070));\\n concept.setEditingAuthority(new Authority.Default(\\\"KEVRIC\\\"));\\n concept.setEditingTimestamp(new java.util.Date());\\n concept.setReadTimestamp(new java.util.Date());\\n list.add(concept);\\n\\n concept_checklist.add((Concept[]) list.toArray(new Concept[] {}));\\n Concept[] concepts = concept_checklist.getConcepts();\\n if (concepts.length > 0)\\n addToLog(\\\" 1. Test Passed\\\");\\n else {\\n addToLog(\\\" 1. Test Failed\\\");\\n thisTestFailed();\\n }\\n\\n addToLog(\\n \\\" 2. Test ConceptChecklist: add(Object), getConcepts() ... \\\"\\n + date_format.format(timestamp));\\n\\n concept_checklist.add(concept);\\n concepts = concept_checklist.getConcepts();\\n if (concepts.length > 0)\\n addToLog(\\\" 2. Test Passed\\\");\\n else {\\n addToLog(\\\" 2. Test Failed\\\");\\n thisTestFailed();\\n }\\n\\n addToLog(\\n \\\" 3. Test ConceptChecklist: addCluster(Cluster), getConcepts() ... \\\"\\n + date_format.format(timestamp));\\n\\n ConceptCluster cluster = new ConceptCluster(new Identifier.Default(12345));\\n concept_checklist.addCluster(cluster);\\n concepts = concept_checklist.getConcepts();\\n if (concepts.length > 0)\\n addToLog(\\\" 3. Test Passed\\\");\\n else {\\n addToLog(\\\" 3. Test Failed\\\");\\n thisTestFailed();\\n }\\n\\n addToLog(\\\"\\\");\\n\\n if (this.isPassed())\\n addToLog(\\\" All tests passed\\\");\\n else\\n addToLog(\\\" At least one test did not complete successfully\\\");\\n\\n //\\n // Main Footer\\n //\\n\\n addToLog(\\\"\\\");\\n\\n addToLog(\\\"-------------------------------------------------------\\\");\\n addToLog(\\\"Finished TestSuiteConceptChecklist at \\\" +\\n date_format.format(new Date(System.currentTimeMillis())));\\n addToLog(\\\"-------------------------------------------------------\\\");\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"53dd1d712f1c30d1b9291d72e8c435ee\",\n \"score\": \"0.60327643\",\n \"text\": \"@Test\\n public void One()\\n {\\n System.out.println(\\\"This is test One\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04e9f7d3e3d2df02c470130ec9372baa\",\n \"score\": \"0.5952458\",\n \"text\": \"@Test\\n public void tpeTest() {\\n // TODO: test tpe\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b217f02bf7984fa9fc686b711dc06d5\",\n \"score\": \"0.5952052\",\n \"text\": \"@Test\\n\\tpublic void sampleTests() {\\n\\n\\t\\tSystem.out.println(\\\"END TEST\\\");\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c89e057356c1e9e7189abf52df74c275\",\n \"score\": \"0.5935244\",\n \"text\": \"@Test\\r\\n public void tes(){\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"05338607cb81f6b43bd4ddbc1e017f62\",\n \"score\": \"0.5932194\",\n \"text\": \"public void runTest(){\\n testGetA();\\n testGetB();\\n testAdd();\\n testSubtract();\\n testMultiply();\\n testDivide();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ee04bebbc9be13b614036178d7c8c64\",\n \"score\": \"0.5906397\",\n \"text\": \"@Test\\n public void testTxtFileHandlerWrite() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41c753c592ebd8a6e9a735a9492a6633\",\n \"score\": \"0.59035426\",\n \"text\": \"public void runTests(){\\n runTests(TARGET_DOT_NAME_DEFAULT, RECURSE_DEFAULT, FULL_TRACE_DEFAULT, SCAN_NON_TEST_CLASS_DEFAULT);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f1518fcfa1fb0fddd01ec30283310c6\",\n \"score\": \"0.5901997\",\n \"text\": \"public void unittest1() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19bc87c5d6df936ca151c264656da334\",\n \"score\": \"0.5890524\",\n \"text\": \"public static void main(String[] args) throws IOException {\\n test_getTzxx();\\n//\\t\\t test_getTzxxAll();\\n// test_modifyShjbxx();\\n// test_modifyJypl();\\n// test_searchJyplxx();\\n// test_searchSptzxx();\\n// test_queryLedgerList();\\n//\\t\\t test_getTzDetail();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1183f29d20bf05c3ca109ed79aea016b\",\n \"score\": \"0.5882113\",\n \"text\": \"protected static void runTest(String testName) {\\n if(!new File(testName + \\\".java\\\").exists())\\r\\n return;\\r\\n try {\\r\\n\\t\\tSystem.out.println(testName + \\\".java\\\");\\r\\n \\r\\n // redirect output stream\\r\\n\\t PrintStream out = System.out;\\r\\n\\t\\tByteArrayOutputStream os = new ByteArrayOutputStream();\\r\\n\\t\\tPrintStream ps = new PrintStream(os);\\r\\n if(!verbose)\\r\\n\\t\\t System.setOut(ps);\\r\\n \\r\\n // run JastAdd to build .class files for test case\\r\\n\\t\\tif(new jastadd.JastAdd().compile(buildArgs(testName))) {\\r\\n // load test class in a separate class loader and invoke main method\\r\\n String className = testName.replace('/', '.');\\r\\n loadAndInvoke(className);\\r\\n }\\r\\n \\r\\n // restore output stream\\r\\n\\t\\tif(verbose)\\r\\n\\t\\t\\tSystem.out.println(os.toString());\\r\\n else\\r\\n\\t\\t System.setOut(out);\\r\\n \\r\\n // compare output stream result and expected output\\r\\n\\t\\tString result = simplifyComparison(os.toString());\\r\\n\\t\\tString correct = simplifyComparison(readFile(testName + \\\".result\\\"));\\r\\n\\t\\tif(result.equals(correct)) {\\r\\n\\t\\t\\tSystem.out.println(testName + \\\".java passed\\\");\\r\\n\\t\\t}\\r\\n\\t\\telse {\\r\\n\\t\\t\\tSystem.err.println(testName + \\\".java failed\\\");\\r\\n\\t\\t\\tSystem.err.println(\\\"[\\\" + result + \\\"]\\\" + \\\"\\\\nDoes not equal\\\\n\\\" + \\\"[\\\" + correct + \\\"]\\\");\\r\\n\\t\\t}\\r\\n } catch (Exception e) {\\r\\n e.printStackTrace();\\r\\n }\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd18b4bea93acf6deb06d3d3d9c6884c\",\n \"score\": \"0.58709604\",\n \"text\": \"public static void generateCoverageFile() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"249041d3663de7e12f73c419ebe8a1ab\",\n \"score\": \"0.58705425\",\n \"text\": \"public boolean restrictionOfMethodsRunTest() {\\n CoverageUnitTester cut = cutForConfiguredPackage(Grandtestauto.test83_zip, \\\"a83.test\\\", null, null, null, null, null);\\n methodsCalled.clear();\\n cut.runTests();\\n List<String> expected = new LinkedList<>();\\n expected.add(\\\"constructor_A_Test\\\");\\n expected.add(\\\"aTest\\\");\\n expected.add(\\\"bTest\\\");\\n expected.add(\\\"cTest\\\");\\n expected.add(\\\"dTest\\\");\\n expected.add(\\\"eTest\\\");\\n expected.add(\\\"constructor_B_Test\\\");\\n expected.add(\\\"xTest\\\");\\n expected.add(\\\"x_int_Test\\\");\\n expected.add(\\\"x_String_Test\\\");\\n expected.add(\\\"yTest\\\");\\n expected.add(\\\"y_intArray_Test\\\");\\n Helpers.assertSameContents(methodsCalled, expected);\\n\\n //Run just ATest, and only methods b to dTest.\\n cut = cutForConfiguredPackage(Grandtestauto.test83_zip, \\\"a83.test\\\", \\\"a83\\\", \\\"A\\\", \\\"b\\\", \\\"dTest\\\", null);\\n methodsCalled.clear();\\n cut.runTests();\\n expected = new LinkedList<>();\\n expected.add(\\\"bTest\\\");\\n expected.add(\\\"cTest\\\");\\n expected.add(\\\"constructor_A_Test\\\");\\n expected.add(\\\"dTest\\\");\\n Helpers.assertSameContents(methodsCalled, expected);\\n\\n //Run just ATest, and only methods to d.\\n cut = cutForConfiguredPackage(Grandtestauto.test83_zip, \\\"a83.test\\\", \\\"a83\\\", \\\"A\\\", null, \\\"d\\\", null);\\n methodsCalled.clear();\\n cut.runTests();\\n expected = new LinkedList<>();\\n expected.add(\\\"aTest\\\");\\n expected.add(\\\"bTest\\\");\\n expected.add(\\\"cTest\\\");\\n expected.add(\\\"constructor_A_Test\\\");\\n Helpers.assertSameContents(methodsCalled, expected);\\n\\n //Run just ATest, and only methods from c.\\n cut = cutForConfiguredPackage(Grandtestauto.test83_zip, \\\"a83.test\\\", \\\"a83\\\", \\\"A\\\", \\\"c\\\", null, null);\\n methodsCalled.clear();\\n cut.runTests();\\n expected = new LinkedList<>();\\n expected.add(\\\"cTest\\\");\\n expected.add(\\\"constructor_A_Test\\\");\\n expected.add(\\\"dTest\\\");\\n expected.add(\\\"eTest\\\");\\n Helpers.assertSameContents(methodsCalled, expected);\\n\\n //Run just ATest, and only cTest..\\n cut = cutForConfiguredPackage(Grandtestauto.test83_zip, \\\"a83.test\\\", \\\"a83\\\", \\\"A\\\", null, null, \\\"cTest\\\");\\n methodsCalled.clear();\\n cut.runTests();\\n expected = new LinkedList<>();\\n expected.add(\\\"cTest\\\");\\n Helpers.assertSameContents(methodsCalled, expected);\\n\\n //Single method overrides other settings\\n cut = cutForConfiguredPackage(Grandtestauto.test83_zip, \\\"a83.test\\\", \\\"a83\\\", \\\"A\\\", \\\"a\\\", \\\"d\\\", \\\"cTest\\\");\\n methodsCalled.clear();\\n cut.runTests();\\n expected = new LinkedList<>();\\n expected.add(\\\"cTest\\\");\\n Helpers.assertSameContents(methodsCalled, expected);\\n\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6fc1d259680434bdbcbe2f9443e150ed\",\n \"score\": \"0.58572346\",\n \"text\": \"TestRun createTestRun();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b2619817224da6f5ebd947ee4b4a26e\",\n \"score\": \"0.5846859\",\n \"text\": \"private static void testCases() {\\n\\t\\tgetNameTests();\\n\\t\\tgetBaseDecadeTests();\\n\\t\\tgetRankTests();\\n\\t\\tgetBestDecadeTests();\\n\\t\\tnumTimesTop1000Tests();\\n\\t\\ttop1000EveryDecadeTests();\\n\\t\\ttop1000OnceDecadeTests();\\n\\t\\tmorePopularTests();\\n\\t\\tlessPopularTests();\\n\\t\\ttoStringTests();\\n\\t\\tcompareToTests();\\n\\t\\tgetTimesRank1Tests();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0a3c20abbdda630bf75a69ca97bd20f\",\n \"score\": \"0.58199215\",\n \"text\": \"@Test\\n\\tpublic void Driver() {\\n\\n\\t\\tfinal Object testingData[][] = {\\n\\n\\t\\t\\t//Test #01: Correct execution of test. Expected true.\\n\\t\\t\\t{\\n\\t\\t\\t\\t\\\"auditor1\\\", \\\"http://attachment.com,https://www.google.es\\\", \\\"testDescription\\\", \\\"testTitle\\\", false, true, null\\n\\t\\t\\t},\\n\\n\\t\\t\\t//Test #02: Attempt to create an audit with incorrect credentials. Expected false.\\n\\t\\t\\t{\\n\\t\\t\\t\\t\\\"user1\\\", \\\"http://attachment.com,https://www.google.es\\\", \\\"testDescription\\\", \\\"testTitle\\\", false, true, ClassCastException.class\\n\\t\\t\\t},\\n\\n\\t\\t\\t//Test #03: Attempt to save an audit with blank fields. Expected false.\\n\\t\\t\\t{\\n\\t\\t\\t\\t\\\"auditor1\\\", \\\"\\\", \\\"\\\", \\\"\\\", false, true, ConstraintViolationException.class\\n\\t\\t\\t}\\n\\n\\t\\t};\\n\\n\\t\\tfor (int i = 0; i < testingData.length; i++)\\n\\t\\t\\tthis.Template((String) testingData[i][0], (String) testingData[i][1], (String) testingData[i][2], (String) testingData[i][3], (boolean) testingData[i][4], (boolean) testingData[i][5], (Class<?>) testingData[i][6]);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"637260c55f5659f222f9d1d2e97cd2e7\",\n \"score\": \"0.58183855\",\n \"text\": \"@Test\\r\\n public void randomFilesTestDepFindRunner()\\r\\n {\\r\\n //TODO\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d640256da1f00fea9ae23f7dbc051c8f\",\n \"score\": \"0.58171856\",\n \"text\": \"@Test\\n public void testGetActions() \\n {\\n System.out.println(\\\"General ActionCard\\\");\\n testGeneralActionCard();\\n \\n System.out.println(\\\"Snoop\\\");\\n testSnoop();\\n \\n System.out.println(\\\"AllSnoop\\\");\\n testAllSnoop();\\n \\n System.out.println(\\\"PrivateTip\\\");\\n testPrivateTip();\\n \\n System.out.println(\\\"SuperSleuth\\\");\\n testSuperSleuth();\\n \\n System.out.println(\\\"Suggestion\\\");\\n testSuggestion();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b4f62e3e2282aa0f7dd0e06f8dacc3a\",\n \"score\": \"0.58114403\",\n \"text\": \"private void createNewTestMethod(String fnm,String nm,String ipnm,String icnm,boolean newcls,String cnts)\\n{\\n int idx = nm.lastIndexOf(\\\".\\\");\\n String cnm = nm.substring(0,idx);\\n String mnm = nm.substring(idx+1);\\n if (cnts == null) cnts = \\\"// insert test code here\\\";\\n if (icnm != null) cnm = icnm;\\n\\n if (newcls) {\\n String xnm = null;\\n if (cnm.endsWith(\\\"Test\\\")) {\\n\\t xnm = cnm;\\n\\t int ln = xnm.length();\\n\\t xnm = xnm.substring(0,ln-4);\\n }\\n BuenoProperties props = new BuenoProperties();\\n props.put(BuenoKey.KEY_ADD_COMMENT,Boolean.TRUE);\\n if (xnm != null) props.put(BuenoKey.KEY_COMMENT,\\\"Test class for \\\" + xnm);\\n else props.put(BuenoKey.KEY_COMMENT,\\\"Test Class\\\");\\n props.put(BuenoKey.KEY_NAME,cnm);\\n props.put(BuenoKey.KEY_MODIFIERS,Modifier.PUBLIC);\\n String cnnm = cnm;\\n String pkg = cnnm;\\n int idx1 = cnnm.lastIndexOf(\\\".\\\");\\n if (idx1 < 0) pkg = null;\\n else {\\n\\t pkg = cnnm.substring(0,idx1);\\n\\t cnnm = cnnm.substring(idx1+1);\\n\\t props.put(BuenoKey.KEY_PACKAGE, pkg);\\n\\t props.put(BuenoKey.KEY_NAME, cnnm);\\n }\\n props.put(BuenoKey.KEY_IMPORTS, \\\"import org.junit.*;\\\");\\n BuenoLocation loc = BuenoFactory.getFactory().createLocation(ipnm,cnm,pkg,false);\\n BuenoFactory.getFactory().createNew(BuenoType.NEW_CLASS, loc, props);\\n\\n loc = BuenoFactory.getFactory().createLocation(ipnm,cnm,null,true);\\n\\n props = new BuenoProperties();\\n props.put(BuenoKey.KEY_ADD_COMMENT,Boolean.TRUE);\\n props.put(BuenoKey.KEY_COMMENT,\\\"Default Constrcutor for test class \\\" + cnm);\\n String cxnm = cnm;\\n int cidx = cxnm.lastIndexOf(\\\".\\\");\\n if (cidx > 0) cxnm = cxnm.substring(cidx+1);\\n props.put(BuenoKey.KEY_NAME,cxnm);\\n props.put(BuenoKey.KEY_MODIFIERS,Modifier.PUBLIC);\\n props.put(BuenoKey.KEY_CONTENTS,\\\"\\\\n\\\");\\n\\n BuenoFactory.getFactory().createNew(BuenoType.NEW_CONSTRUCTOR,loc,props);\\n }\\n\\n String anm = null;\\n // anm should be last test in class, or null if there are none\\n BuenoLocation loc = BuenoFactory.getFactory().createLocation(ipnm,cnm,anm,true);\\n\\n BuenoProperties props = new BuenoProperties();\\n props.put(BuenoKey.KEY_ADD_COMMENT,Boolean.TRUE);\\n props.put(BuenoKey.KEY_COMMENT,\\\"Test case for \\\" + fnm);\\n props.put(BuenoKey.KEY_NAME,mnm);\\n props.put(BuenoKey.KEY_RETURNS,\\\"void\\\");\\n props.put(BuenoKey.KEY_MODIFIERS,Modifier.PUBLIC);\\n props.put(BuenoKey.KEY_CONTENTS,cnts);\\n props.put(BuenoKey.KEY_ATTRIBUTES,\\\"@Test\\\");\\n\\n BuenoFactory.getFactory().createNew(BuenoType.NEW_METHOD,loc,props);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2aea5e6b9b9d011c5bd3045d09ecac5d\",\n \"score\": \"0.5790926\",\n \"text\": \"private String compileTestResults(status stat, ITestResult tr, String duration) {\\n String methodName = tr.getMethod().getMethodName();\\n Boolean testPassed = true;\\n if (stat != status.PASS) {\\n testPassed = false;\\n }\\n StringBuilder msg = new StringBuilder(\\\"Finished \\\" + methodName + \\\" test - \\\");\\n if (testPassed) {\\n msg.append(\\\"PASSED - Total Time: \\\");\\n msg.append(duration);\\n } else {\\n msg.append(\\\"FAILED\\\");\\n msg.append(getExceptionInfo(tr));\\n }\\n return msg.toString();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"966c820eb174f2fcac94717ed8ea8126\",\n \"score\": \"0.5788447\",\n \"text\": \"void testMethod1();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44c4a35db3f81e1125f0eb63cc7d4a79\",\n \"score\": \"0.5774179\",\n \"text\": \"public void writeTestCase( String testName, URI testServer, RequestCase requestCase, IndentedWriter targetWriter);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ec5b714b28ce6bef7525676e13e24bc\",\n \"score\": \"0.57712454\",\n \"text\": \"private static void run_tests() {\\n System.out.println(\\\"Tests all good!\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae26f7a2c9e6b4ae27eec116300e0c9b\",\n \"score\": \"0.57563734\",\n \"text\": \"@Test\\r\\n\\tvoid test() throws Exception {\\r\\n\\t\\tIssueLog.sytemprint=true;\\r\\n\\t\\t\\r\\n\\t\\texportTest();\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4f34f30127df2600ca75f373c441cb8\",\n \"score\": \"0.5749401\",\n \"text\": \"@Test\\n void list() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9e08e32d1abed44249991f808dede73\",\n \"score\": \"0.57488847\",\n \"text\": \"public void testcase1() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e45002975605251e36cb5f59b80ed9bb\",\n \"score\": \"0.57396215\",\n \"text\": \"public void testMain() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a4d578f9ce320fe2a5e1027eb9a1a47\",\n \"score\": \"0.5739247\",\n \"text\": \"@Test\\n\\tpublic void testRun() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16756ef2553ea7add0dffa18269bbd81\",\n \"score\": \"0.57251626\",\n \"text\": \"@Test\\n public void verifyOnlyOneInstanceOfTestClassForAllTestMethods() {\\n Multimap<Object,TestNgRunStateTracker.EventLog> testMethodAEventLogMap =\\n getTestMethodEventLogsForMethod(\\\"SingleTestSuite\\\", \\\"SingleTestClassTest\\\",\\n TestClassAWithNoDepsSample.class.getCanonicalName(), \\\"testMethodA\\\");\\n\\n Multimap<Object,TestNgRunStateTracker.EventLog> testMethodBEventLogMap =\\n getTestMethodEventLogsForMethod(\\\"SingleTestSuite\\\", \\\"SingleTestClassTest\\\",\\n TestClassAWithNoDepsSample.class.getCanonicalName(), \\\"testMethodB\\\");\\n\\n Multimap<Object,TestNgRunStateTracker.EventLog> testMethodCEventLogMap =\\n getTestMethodEventLogsForMethod(\\\"SingleTestSuite\\\", \\\"SingleTestClassTest\\\",\\n TestClassAWithNoDepsSample.class.getCanonicalName(), \\\"testMethodC\\\");\\n\\n Multimap<Object,TestNgRunStateTracker.EventLog> testMethodDEventLogMap =\\n getTestMethodEventLogsForMethod(\\\"SingleTestSuite\\\", \\\"SingleTestClassTest\\\",\\n TestClassAWithNoDepsSample.class.getCanonicalName(), \\\"testMethodD\\\");\\n\\n Multimap<Object,TestNgRunStateTracker.EventLog> testMethodEEventLogMap =\\n getTestMethodEventLogsForMethod(\\\"SingleTestSuite\\\", \\\"SingleTestClassTest\\\",\\n TestClassAWithNoDepsSample.class.getCanonicalName(), \\\"testMethodE\\\");\\n\\n assertEquals(testMethodAEventLogMap.keySet().size(), 1, \\\"There should be only one test class instance \\\" +\\n \\\"associated with testMethodA from \\\" + TestClassAWithNoDepsSample.class.getCanonicalName());\\n assertEquals(testMethodBEventLogMap.keySet().size(), 1, \\\"There should be only one test class instance \\\" +\\n \\\"associated with testMethodB from \\\" + TestClassAWithNoDepsSample.class.getCanonicalName());\\n assertEquals(testMethodCEventLogMap.keySet().size(), 1, \\\"There should be only one test class instance \\\" +\\n \\\"associated with testMethodC from \\\" + TestClassAWithNoDepsSample.class.getCanonicalName());\\n assertEquals(testMethodDEventLogMap.keySet().size(), 1, \\\"There should be only one test class instance \\\" +\\n \\\"associated with testMethodD from \\\" + TestClassAWithNoDepsSample.class.getCanonicalName());\\n assertEquals(testMethodEEventLogMap.keySet().size(), 1, \\\"There should be only one test class instance \\\" +\\n \\\"associated with testMethodE from \\\" + TestClassAWithNoDepsSample.class.getCanonicalName());\\n\\n Object methodAInstanceKey = testMethodAEventLogMap.keySet().toArray()[0];\\n Object methodBInstanceKey = testMethodBEventLogMap.keySet().toArray()[0];\\n Object methodCInstanceKey = testMethodCEventLogMap.keySet().toArray()[0];\\n Object methodDInstanceKey = testMethodDEventLogMap.keySet().toArray()[0];\\n Object methodEInstanceKey = testMethodEEventLogMap.keySet().toArray()[0];\\n\\n assertTrue(\\n methodAInstanceKey == methodBInstanceKey &&\\n methodBInstanceKey == methodCInstanceKey &&\\n methodCInstanceKey == methodDInstanceKey &&\\n methodDInstanceKey == methodEInstanceKey,\\n \\\"The test methods should all have the same single test class instance\\\"\\n );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"803eab056b24d49df02759058fe149d9\",\n \"score\": \"0.5714136\",\n \"text\": \"public void setUp()\\n {\\n \\tString home = new File(\\\".\\\").getAbsolutePath() + \\\"/testfiles\\\";\\n\\t\\t\\ttestFile1 =\\n new File(\\n home,\\n \\\"Test Plan.jmx\\\");\\n testFile2 =\\n new File(\\n home,\\n \\\"Modification Manager.jmx\\\");\\n testFile3 =\\n new File(\\n home,\\n \\\"proxy.jmx\\\");\\n testFile4 =\\n new File(\\n home,\\n \\\"AssertionTestPlan.jmx\\\");\\n testFile5 =\\n new File(\\n home,\\n \\\"AuthManagerTestPlan.jmx\\\");\\n testFile6 =\\n new File(\\n home,\\n \\\"HeaderManagerTestPlan.jmx\\\");\\n testFile7 =\\n new File(\\n home,\\n \\\"InterleaveTestPlan.jmx\\\");\\n testFile8 =\\n new File(\\n home,\\n \\\"InterleaveTestPlan2.jmx\\\");\\n testFile9 =\\n new File(\\n home,\\n \\\"LoopTestPlan.jmx\\\");\\n testFile10 =\\n new File(\\n home,\\n \\\"OnceOnlyTestPlan.jmx\\\");\\n testFile11 =\\n new File(\\n home,\\n \\\"ProxyServerTestPlan.jmx\\\");\\n testFile12 =\\n new File(\\n home,\\n \\\"SimpleTestPlan.jmx\\\");\\n testFile13 =\\n new File(\\n home,\\n \\\"URLRewritingExample.jmx\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"59eb240de3fc6321224526e6285f254f\",\n \"score\": \"0.5709138\",\n \"text\": \"@Test\\n public void toTest() {\\n // TODO: test to\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"59eb240de3fc6321224526e6285f254f\",\n \"score\": \"0.5709138\",\n \"text\": \"@Test\\n public void toTest() {\\n // TODO: test to\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dea577c162189bd2dd2ed8dab614dd0a\",\n \"score\": \"0.57085544\",\n \"text\": \"@Test\\n public void mainPerson() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98717c4382d9db2917e11a08d6a7553e\",\n \"score\": \"0.57066476\",\n \"text\": \"@Test\\n public void testSlipUploadMonthly() {\\n // TODO: test SlipUploadMonthly\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"92d38a095da75f967f8a988eb5953fb2\",\n \"score\": \"0.56991744\",\n \"text\": \"@Test\\n void getPizzaThatNeedSupplyNow() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aacddf68bf6dab1f135856f2a60e0ee0\",\n \"score\": \"0.5686703\",\n \"text\": \"@Test\\n public void finall(){\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0251ffbc2e6fdd2f664133343e1c3d74\",\n \"score\": \"0.56792766\",\n \"text\": \"TestSuite createTestSuite();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca59707c88098aae21f3a1d7112fab8f\",\n \"score\": \"0.56785893\",\n \"text\": \"@Test\\n public void testSantaWithFile() throws Exception {\\n mySanta.processFile();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b05c216dea497588e6186106878a9bc3\",\n \"score\": \"0.56695193\",\n \"text\": \"@Test\\n public void testSerFileHandlerWrite() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db6417cf006fe540f1d986463be526e0\",\n \"score\": \"0.5668416\",\n \"text\": \"public static void main(String[] args) {\\n\\t\\tResult result = JUnitCore.runClasses( JUnitTester.class);\\r\\n\\r\\n\\t\\tfor (Failure failure : result.getFailures()) {\\r\\n\\t\\t\\tSystem.out.println(failure.toString());\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tSystem.out.println( \\\"All Test Cases Successful - \\\" + result.wasSuccessful() );\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"05edab9b9b35e0f164258b8f771ed14a\",\n \"score\": \"0.56656396\",\n \"text\": \"@Test\\n public void test1() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1eb04d8e0f88c2c796432a56cfc5d234\",\n \"score\": \"0.5663856\",\n \"text\": \"@Test\\n\\tpublic void tc1() {\\n\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"Suitb test 1\\\");\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb482dec0e942f62c4cef06a7471bb45\",\n \"score\": \"0.5659673\",\n \"text\": \"@Test\\n public void addTests() {\\n System.out.println(\\\"Teste: LectureReader\\\"); \\n try {\\n testReadFile();\\n } catch (Exception e) {\\n System.out.println(\\\"- \\\" + e.toString());\\n } \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e2e32367849703f2b1f2afed9065bcba\",\n \"score\": \"0.56558615\",\n \"text\": \"@Test\\n\\tpublic void note(){\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"08bc8f3e3b13273e9780530952c01001\",\n \"score\": \"0.5643398\",\n \"text\": \"public static void main(String args[]) throws FileNotFoundException {\\n if (args.length != 7 && args.length != 8) {\\n throw new RuntimeException(\\\"usage: Processor trace-file tcg-dump-out inst-info-dump hierarchy-dump test-case-name test-method-name tested-class [output-package]\\\");\\n }\\n\\n String traceFileName = args[0];\\n String tcgDump = args[1];\\n String iiDump = args[2];\\n String hierDump = args[3];\\n String testCaseName = args[4];\\n String testMethodName = args[5];\\n ClassName testedClass = ClassName.fromDotted(args[6]);\\n\\n String outputPackage = args.length == 8\\n ? args[7]\\n : testedClass.dottedPackageName();\\n\\n Hierarchy hierarchy = Hierarchy.createFromFile(hierDump);\\n\\n TestCaseGenerator tcg\\n = new TestCaseGenerator(testCaseName, outputPackage);\\n TestMethodGenerator tmg = new TestMethodGenerator(testMethodName,\\n hierarchy,\\n true);\\n tcg.addChunk(tmg);\\n\\n InputStream in = new FileInputStream(traceFileName);\\n Deserializer<TraceEvent> d\\n = Deserializer.getDeserializer(in, TraceEvent.class);\\n\\n Map<Instance, InstanceInfo> iis = readInstanceInfos(iiDump);\\n\\n\\n Processor p = new Processor(tmg, testedClass, iis, hierarchy);\\n d.process(p);\\n\\n PrintStream ps = new PrintStream(tcgDump);\\n Serializer<TestCaseGenerator> s = Serializer.getSerializer(ps);\\n\\n s.write(tcg);\\n s.close();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"257204a78ebf434d20420f008ec2f7d4\",\n \"score\": \"0.564175\",\n \"text\": \"@Test\\r\\n\\tpublic void testcusumes(){\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a4201a320f8295f0e1253b87245bf86\",\n \"score\": \"0.5632411\",\n \"text\": \"@Test\\n public void testFindAll() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd0da0bb95eaed83f6307845110fa4d5\",\n \"score\": \"0.56258476\",\n \"text\": \"protected void runTests()\\r\\n\\t{\\r\\n\\t\\ttry\\r\\n\\t\\t{\\r\\n\\t\\t\\tboolean javadocTest = executeTest(JUnitJavadocValidation.class);\\r\\n\\t\\t\\tboolean userTest = executeTest(JUnitUserTest.class);\\r\\n\\t\\t\\tboolean accountTest = executeTest(JUnitAccountTest.class);\\r\\n\\t\\t\\tboolean result = javadocTest && userTest && accountTest;\\r\\n\\r\\n\\t\\t\\ttrace(result ? \\\"PASSED\\\" : \\\"FAILED\\\");\\r\\n\\t\\t}\\r\\n\\t\\tcatch(Exception ex)\\r\\n\\t\\t{\\r\\n\\t\\t\\ttrace(ex.getMessage());\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d974a6bb29ad8ebc7969619bc8791059\",\n \"score\": \"0.56142807\",\n \"text\": \"@Test\\n public void testCase1() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b6a9fc1d62e40cd35c1aad4c77f8966\",\n \"score\": \"0.56132317\",\n \"text\": \"public static void main(String[] args) {\\n test_all();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5908eb2c8c168b69ab361c326df5d6d5\",\n \"score\": \"0.5600608\",\n \"text\": \"public void testBuild() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f38603641d09d611317a30aed590e86\",\n \"score\": \"0.55999273\",\n \"text\": \"private static void addTests() {\\n\\t\\tString testDirectoryName = Properties.testDirectory.getAbsolutePath();\\n\\t\\ttests = new ArrayList<TestSet>();\\n//\\t\\ttests.add(new TestSet(testDirectoryName, \\\"ecoli\\\"));\\n\\t\\ttests.add(new TestSet(testDirectoryName, \\\"human\\\"));\\n\\t\\ttests.add(new TestSet(testDirectoryName, \\\"aurum\\\"));\\t\\n\\t\\ttests.add(new TestSet(testDirectoryName, \\\"USP top 10\\\"));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8b1bdd9465152d1984370881bea9642\",\n \"score\": \"0.5596091\",\n \"text\": \"@Test\\n public void Test1(){\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ddc344db1e0040fe2ce0a2dda59c8b9\",\n \"score\": \"0.5596012\",\n \"text\": \"@Test\\n public void testMyPackagePackageResults() throws Exception {\\n FreeStyleProject p = r.createFreeStyleProject();\\n Publisher publisher = new Publisher();\\n publisher.setReportFilenamePattern(\\\"testng.xml\\\");\\n p.getPublishersList().add(publisher);\\n p.onCreatedFromScratch(); //to setup project action\\n\\n p.getBuildersList().add(new TestBuilder() {\\n @Override\\n public boolean perform(AbstractBuild<?, ?> build, Launcher launcher,\\n BuildListener listener) throws InterruptedException, IOException {\\n String contents = CommonUtil.getContents(Constants.TESTNG_XML_EMPTY_EXCEPTION);\\n build.getWorkspace().child(\\\"testng.xml\\\").write(contents,\\\"UTF-8\\\");\\n return true;\\n }\\n });\\n\\n //run build\\n FreeStyleBuild build = p.scheduleBuild2(0).get();\\n\\n //Get page\\n String urlPrefix = build.getUrl() + PluginImpl.URL;\\n HtmlPage page = r.createWebClient().goTo(urlPrefix + \\\"/my.package\\\");\\n\\n //verify only first 25 methods are shown\\n assertNull(page.getElementById(\\\"showAllLink\\\"));\\n\\n //verify bar\\n HtmlElement element = page.getElementById(\\\"fail-skip\\\", true);\\n r.assertStringContains(element.getTextContent(), \\\"0 failures\\\");\\n assertFalse(element.getTextContent().contains(\\\"skipped\\\"));\\n element = page.getElementById(\\\"pass\\\", true);\\n r.assertStringContains(element.getTextContent(), \\\"1 test\\\");\\n assertFalse(element.getTextContent().contains(\\\"tests\\\"));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09e8ac8d3524b0903ed0484c13ec8881\",\n \"score\": \"0.5593912\",\n \"text\": \"@Test\\n public void testMain() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba216c41ed88d07187dab1ef30263f4e\",\n \"score\": \"0.5593118\",\n \"text\": \"public void testcase2(){\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"067c556d3f8e26b1a2df09ac085eef6f\",\n \"score\": \"0.55921197\",\n \"text\": \"static void statMethod() {\\n\\t\\tSystem.out.println(\\\"statMethod in test class\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4126105c4f64d5b683079f2122e010d0\",\n \"score\": \"0.55865437\",\n \"text\": \"@Test\\n public void test5(){\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ff6d6f80de2c258b861542872119d93\",\n \"score\": \"0.55857664\",\n \"text\": \"@Test\\r\\n public void testMain() {\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28bd8503bf1a7ea24509fbf43bef209f\",\n \"score\": \"0.5583388\",\n \"text\": \"public synchronized void testEnded(final String name) {\\n if (!traceDirDumped) {\\n ClassLoader classLoader = TestDiscoveryInstrumentator.class.getClassLoader();\\n System.out.println(ourData + \\\"; cl: \\\" + classLoader+ \\\",\\\" + classLoader.getParent());\\n System.out.println(\\\"Trace dir:\\\" + myTraceDir);\\n traceDirDumped = true;\\n }\\n new File(myTraceDir).mkdirs();\\n final File traceFile = new File(myTraceDir, name + \\\".tr\\\");\\n try {\\n if (!traceFile.exists()) {\\n traceFile.createNewFile();\\n }\\n DataOutputStream os = null;\\n Deflater def = new Deflater(1);\\n try {\\n os = new DataOutputStream(new DeflaterOutputStream(new BufferedOutputStream(new FileOutputStream(traceFile)), def));\\n\\n //saveOldTrace(os);\\n\\n Map<String, Integer> classToUsedMethods = new HashMap<String, Integer>();\\n for(Map.Entry<String, boolean[]> e: myTrace2.entrySet()) {\\n boolean[] used = e.getValue();\\n int usedMethodsCount = 0;\\n\\n for (boolean anUsed : used) {\\n if (anUsed) ++usedMethodsCount;\\n }\\n\\n if (usedMethodsCount > 0) {\\n classToUsedMethods.put(e.getKey(), usedMethodsCount);\\n }\\n }\\n\\n os.writeInt(classToUsedMethods.size());\\n for(Map.Entry<String, boolean[]> e: myTrace2.entrySet()) {\\n final boolean[] used = e.getValue();\\n final String className = e.getKey();\\n\\n Integer integer = classToUsedMethods.get(className);\\n if (integer == null) continue;;\\n\\n int usedMethodsCount = integer;\\n\\n os.writeUTF(className);\\n os.writeInt(usedMethodsCount);\\n\\n String[] methodNames = myTrace3.get(className);\\n for (int i = 0, len = used.length; i < len; ++i) {\\n // we check usedMethodCount here since used was observed to change // ?\\n if (used[i] && usedMethodsCount-- > 0) os.writeUTF(methodNames[i]);\\n }\\n }\\n }\\n finally {\\n if (os != null) {\\n os.close();\\n }\\n def.end();\\n }\\n }\\n catch (IOException e) {\\n e.printStackTrace();\\n }\\n finally {\\n myTrace = null;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8eb76ce2902f058a7bd74db83bd40c5b\",\n \"score\": \"0.55770105\",\n \"text\": \"@Test\\n public void resultTest() {\\n // TODO: test result\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd5a8c32b53117ae5d563b249179765c\",\n \"score\": \"0.5575521\",\n \"text\": \"private static void createResultsFile(){\\n\\t\\ttry {\\n\\t\\t\\tString outputFileName = testFileClass.toUpperCase() + \\\" k=\\\" + k + \\\" m=\\\" + m + \\\" TestingResults.txt\\\";\\n\\t\\t\\tPrintWriter writer = new PrintWriter(outputFileName, \\\"UTF-8\\\");\\n//\\t\\t\\tSystem.out.println(\\\"With k=\\\" + k + \\\" and m=\\\" + m);\\n//\\t\\t\\tSystem.out.println(\\\"fraction of emails correctly classified as \\\" + testFileClass + \\\": \\\" + correctlyClassifiedCount/numberOfTestFiles);\\n\\t\\t\\twriter.println(\\\"With k=\\\" + k + \\\" and m=\\\" + m);\\n\\t\\t\\twriter.println(\\\"fraction of emails correctly classified as \\\" + testFileClass + \\\": \\\" + correctlyClassifiedCount/numberOfTestFiles);\\n\\t\\t\\tfor(int i = 0; i < numberOfTestFiles; i++){\\n\\t\\t\\t\\tClassifiedEmail currentEmail = classifiedEmails.get(i);\\n\\t\\t\\t\\twriter.println(currentEmail.getEmailFileName()\\n\\t\\t\\t\\t\\t\\t+ \\\" was classified as \\\"\\n\\t\\t\\t\\t\\t\\t+ currentEmail.getEmailClassification());\\n\\t\\t\\t\\twriter.println(\\\"Ham posterior log: \\\" + currentEmail.getHamProbabilityLog());\\n\\t\\t\\t\\twriter.println(\\\"Spam posterior log: \\\" + currentEmail.getSpamProbabilityLog());\\n\\t\\t\\t\\twriter.println();\\n\\t\\t\\t}\\n\\t\\t\\twriter.close();\\n\\t\\t} catch (Exception e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44ad41e06a72447dec05104140dc3276\",\n \"score\": \"0.557166\",\n \"text\": \"@Test\\n public void testGetReaderMethods() {\\n writeBanner(methodName());\\n\\n Set<String> readerMethods = Set.of(\\\"getLastName\\\", \\\"getAge\\\", \\\"isDemocrat\\\", \\\"getFirstName\\\");\\n\\n ClassInfo<Person> classInfo = new ClassInfo<>(Person.class);\\n List<Method> methods = classInfo.getReaderMethods();\\n\\n assertThat(methods.size()).isEqualTo(readerMethods.size());\\n\\n methods.forEach(m -> {\\n assertThat(readerMethods).contains(m.getName());\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2332874b36904539e563c6598d6f1e17\",\n \"score\": \"0.55708414\",\n \"text\": \"@Test\\n public void testUsersInfo() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"56a9e45de5e750cf9f856822c247ef33\",\n \"score\": \"0.55662394\",\n \"text\": \"private List<MethodTree> generateTestMethods(\\n TypeElement srcClass,\\n CharSequence instanceClsName,\\n List<ExecutableElement> srcMethods,\\n WorkingCopy workingCopy) {\\n if (srcMethods.isEmpty()) {\\n return Collections.<MethodTree>emptyList();\\n }\\n\\n List<String> testMethodNames\\n = TestMethodNameGenerator.getTestMethodNames(srcMethods,\\n null,\\n null, //reserved\\n workingCopy);\\n\\n Iterator<ExecutableElement> srcMethodsIt = srcMethods.iterator();\\n Iterator<String> tstMethodNamesIt = testMethodNames.iterator();\\n\\n List<MethodTree> testMethods = new ArrayList<>(srcMethods.size());\\n while (srcMethodsIt.hasNext()) {\\n assert tstMethodNamesIt.hasNext();\\n\\n ExecutableElement srcMethod = srcMethodsIt.next();\\n String testMethodName = tstMethodNamesIt.next();\\n\\n testMethods.add(\\n generateTestMethod(srcClass,\\n srcMethod,\\n testMethodName,\\n instanceClsName,\\n workingCopy));\\n }\\n assert !tstMethodNamesIt.hasNext();\\n return testMethods;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d4697bcacad1991b606a8a499c2d80b\",\n \"score\": \"0.55648947\",\n \"text\": \"@Test\\n public void sourceTest() {\\n // TODO: test source\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d4697bcacad1991b606a8a499c2d80b\",\n \"score\": \"0.55648947\",\n \"text\": \"@Test\\n public void sourceTest() {\\n // TODO: test source\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7825c8e3e50b99aaabea40690e72b9c2\",\n \"score\": \"0.5563135\",\n \"text\": \"@Test\\n void verifyCustomTestEngineTestStats() {\\n\\n EngineTestKit\\n .engine(new CustomTestEngine())\\n .selectors(\\n selectFile(\\\"D:\\\\\\\\Codes\\\\\\\\GRG001JUnitAsAHabitTestEngine\\\\\\\\tests\\\\\\\\test1.txt\\\"),\\n selectFile(\\\"D:\\\\\\\\Codes\\\\\\\\GRG001JUnitAsAHabitTestEngine\\\\\\\\tests\\\\\\\\test2.txt\\\"),\\n selectFile(\\\"D:\\\\\\\\Codes\\\\\\\\GRG001JUnitAsAHabitTestEngine\\\\\\\\tests\\\\\\\\test3.txt\\\"),\\n selectFile(\\\"D:\\\\\\\\Codes\\\\\\\\GRG001JUnitAsAHabitTestEngine\\\\\\\\tests\\\\\\\\test4.txt\\\"),\\n selectFile(\\\"D:\\\\\\\\Codes\\\\\\\\GRG001JUnitAsAHabitTestEngine\\\\\\\\tests\\\\\\\\test5.txt\\\"),\\n selectFile(\\\"D:\\\\\\\\Codes\\\\\\\\GRG001JUnitAsAHabitTestEngine\\\\\\\\tests\\\\\\\\test6.txt\\\"),\\n selectFile(\\\"D:\\\\\\\\Codes\\\\\\\\GRG001JUnitAsAHabitTestEngine\\\\\\\\tests\\\\\\\\test7.txt\\\"),\\n selectFile(\\\"D:\\\\\\\\Codes\\\\\\\\GRG001JUnitAsAHabitTestEngine\\\\\\\\tests\\\\\\\\test8.txt\\\"),\\n selectFile(\\\"D:\\\\\\\\Codes\\\\\\\\GRG001JUnitAsAHabitTestEngine\\\\\\\\tests\\\\\\\\test9.txt\\\"),\\n selectFile(\\\"D:\\\\\\\\Codes\\\\\\\\GRG001JUnitAsAHabitTestEngine\\\\\\\\tests\\\\\\\\test10.txt\\\")\\n )\\n .execute()\\n .testEvents()\\n .assertStatistics(stats -> stats.started(10).succeeded(9).failed(1)\\n );\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c49d5ea9384a4c578ac89890887cb84c\",\n \"score\": \"0.5552897\",\n \"text\": \"private void printTestResults(final ITestResult result) {\\r\\n\\r\\n\\t\\tReporter.log(\\\"Test Method resides in \\\" + result.getTestClass().getName(), true);\\r\\n\\t\\tif (result.getParameters().length != 0) {\\r\\n\\t\\t\\tString params = null;\\r\\n\\t\\t\\tfor (Object parameter : result.getParameters()) {\\r\\n\\t\\t\\t\\tparams += parameter.toString() + \\\",\\\";\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tif (params != null) {\\r\\n\\t\\t\\t\\tReporter.log(\\\"Test Method had the following parameters : \\\" + params, true);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tString status = null;\\r\\n\\t\\tswitch (result.getStatus()) {\\r\\n\\t\\tcase ITestResult.SUCCESS:\\r\\n\\t\\t\\tstatus = \\\"Pass\\\";\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\tcase ITestResult.FAILURE:\\r\\n\\t\\t\\tstatus = \\\"Failed\\\";\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\tcase ITestResult.SKIP:\\r\\n\\t\\t\\tstatus = \\\"Skipped\\\";\\r\\n\\t\\t}\\r\\n\\t\\tReporter.log(\\\"Test Status: \\\" + status, true);\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"74de44844a9d33d6f20840c71723b227\",\n \"score\": \"0.55492234\",\n \"text\": \"@Test\\n public void statistic() {\\n printHr();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe8bb15c2505a5760ddd79f710854dc7\",\n \"score\": \"0.55441356\",\n \"text\": \"public static void main(String[] args) {\\r\\n int tests = 0;\\r\\n try {\\r\\n for (Object obj : Files.list(Paths.get(\\\"src\\\")).toArray()) {\\r\\n if (obj.toString().endsWith(\\\".java\\\")\\r\\n && !obj.toString().endsWith(AutoTester.class.getSimpleName() + \\\".java\\\")) {\\r\\n String className = getExamplesClass(Files.readAllLines((Path) obj));\\r\\n if (!className.isEmpty()) {\\r\\n tests++;\\r\\n tester.Main.main(new String[] { className });\\r\\n }\\r\\n }\\r\\n }\\r\\n if (tests == 0) {\\r\\n System.err.println(\\\"No Examples classes could be found in the default package.\\\");\\r\\n }\\r\\n }\\r\\n catch (IOException e) {\\r\\n e.printStackTrace();\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5f122f13c28d2ffb32e80c42f11af4d\",\n \"score\": \"0.5532337\",\n \"text\": \"@Test(description = \\\"Test description\\\", dependsOnMethods = { \\\"testTwo\\\" })\\r\\n\\tpublic void testThree() {\\r\\n\\t\\t/**\\r\\n\\t\\t * Test code\\r\\n\\t\\t */\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1df47b2d443eb369290ff1794247e347\",\n \"score\": \"0.5532308\",\n \"text\": \"@Test\\n public void showAll() throws Exception {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b0b58db8412679f8c1cabaeed5eed58\",\n \"score\": \"0.55253756\",\n \"text\": \"File performGenerationSteps();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57631a415c046ef6f6434128c224b6d6\",\n \"score\": \"0.55251276\",\n \"text\": \"public void testGetToResources() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b3f93ef1a2738d6b1cf73877ae8a5c0\",\n \"score\": \"0.55236614\",\n \"text\": \"public String runTests(String className) throws ClassNotFoundException {\\n\\n\\t\\tif (checkIfTest(className)) {\\n\\n\\t\\t\\tMethod[] methods = null;\\n\\t\\t\\tClass<?> x = null;\\n\\t\\t\\tObject obj = null;\\n\\n\\t\\t\\tprintResult = \\\"\\\";\\n\\t\\t\\ttestFailed = 0; /* Counter for failed tests */\\n\\t\\t\\ttestSucceded = 0; /* Counter for successful tests */\\n\\t\\t\\ttestFailByException = 0; /* Counter for tests failed by exception */\\n\\n\\t\\t\\tx = Class.forName(className);\\n\\t\\t\\tmethods = x.getMethods();\\n\\n\\t\\t\\t/* Creates a class object of the class. */\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tobj = x.newInstance();\\n\\t\\t\\t} catch (InstantiationException e1) {\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(null, \\\"Failed to create instance\\\"\\n\\t\\t\\t\\t\\t\\t+ \\\" of the class \\\"+className, \\\"Error\\\",\\n\\t\\t\\t\\t\\t\\tJOptionPane.ERROR_MESSAGE);\\n//\\t\\t\\t\\tprintResult = \\\"Failed to create instance of the class \\\" + className\\n//\\t\\t\\t\\t\\t\\t+ newLine;\\n\\t\\t\\t} catch (IllegalAccessException e1) {\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(null, \\\"Failed to create instance\\\"\\n\\t\\t\\t\\t\\t\\t+ \\\" of the class \\\" + className, \\\"Error\\\",\\n\\t\\t\\t\\t\\t\\tJOptionPane.ERROR_MESSAGE);\\n//\\t\\t\\t\\tprintResult = \\\"Failed to create instance of the class \\\"\\n//\\t\\t\\t\\t\\t\\t+ className + newLine;\\n\\t\\t\\t}\\n\\n\\t\\t\\t/* Saves the setUp and tearDown methods for easier access */\\n\\t\\t\\tMethod setUp = null;\\n\\t\\t\\tMethod tearDown = null;\\n\\n\\t\\t\\tfor (int i = 0; i < methods.length; i++) {\\n\\t\\t\\t\\tif (methods[i].getName().contentEquals(\\\"setUp\\\")) {\\n\\t\\t\\t\\t\\tsetUp = methods[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (methods[i].getName().contentEquals(\\\"tearDown\\\")) {\\n\\t\\t\\t\\t\\ttearDown = methods[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t/* Invokes methods that start their name with \\\"test\\\" */\\n\\t\\t\\tfor (int i = 0; i < methods.length; i++) {\\n\\t\\t\\t\\tif (methods[i].getName().startsWith(\\\"test\\\")) {\\n\\t\\t\\t\\t\\tprintResult += methods[i].getName();\\n\\n\\t\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\t\\tif (setUp != null) {\\n\\t\\t\\t\\t\\t\\t\\tsetUp.invoke(obj);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\t\\t\\tif (!(Boolean)methods[i].invoke(obj)) {\\n\\t\\t\\t\\t\\t\\t\\t\\tprintResult += \\\": Fail\\\" + newLine;\\n\\t\\t\\t\\t\\t\\t\\t\\ttestFailed++;\\n\\t\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t\\tprintResult += \\\": Success\\\" + newLine;\\n\\t\\t\\t\\t\\t\\t\\t\\ttestSucceded++;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\t} catch (IllegalAccessException e) {\\n\\t\\t\\t\\t\\t\\t\\tJOptionPane.showMessageDialog(null, \\\"Failed to run \\\"\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ methods[i].getName()\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ \\\", method does not have access to the \\\"\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ \\\"definition of the class\\\" + newLine,\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\\"Error\\\", JOptionPane.ERROR_MESSAGE);\\n\\n\\t\\t\\t\\t\\t\\t} catch (IllegalArgumentException e) {\\n\\t\\t\\t\\t\\t\\t\\tJOptionPane.showMessageDialog(null, \\\"Failed to run \\\"\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ methods[i].getName()\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ \\\", method got passed wrong arguments?\\\",\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\\"Error\\\", JOptionPane.ERROR_MESSAGE);\\n\\n\\t\\t\\t\\t\\t\\t} catch (InvocationTargetException e) {\\n\\t\\t\\t\\t\\t\\t\\tprintResult += \\\": Fail, generated a \\\"\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ e.getTargetException() + newLine;\\n\\t\\t\\t\\t\\t\\t\\ttestFailByException++;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif (tearDown != null) {\\n\\t\\t\\t\\t\\t\\t\\ttearDown.invoke(obj);\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t} catch (IllegalAccessException e) {\\n\\t\\t\\t\\t\\t\\tJOptionPane.showMessageDialog(null, \\\"Failed to run setUp or tearDown,\\\"\\n\\t\\t\\t\\t\\t\\t\\t\\t+ \\\" test not run\\\", \\\"Error\\\",\\n\\t\\t\\t\\t\\t\\t\\t\\tJOptionPane.ERROR_MESSAGE);\\n\\n\\t\\t\\t\\t\\t\\tprintResult += \\\"Failed to run setUp or tearDown,\\\"\\n\\t\\t\\t\\t\\t\\t\\t\\t+ \\\" test not run\\\" + newLine;\\n\\t\\t\\t\\t\\t} catch (IllegalArgumentException e) {\\n\\t\\t\\t\\t\\t\\tJOptionPane.showMessageDialog(null, \\\"Failed to run setUp or tearDown,\\\"\\n\\t\\t\\t\\t\\t\\t\\t\\t+ \\\" test not run\\\", \\\"Error\\\",\\n\\t\\t\\t\\t\\t\\t\\t\\tJOptionPane.ERROR_MESSAGE);\\n\\t\\t\\t\\t\\t} catch (InvocationTargetException e) {\\n\\t\\t\\t\\t\\t\\tprintResult += \\\": Fail at setUp or tearDown, test not run.\\\";\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t/* Adds a summary of the result */\\n\\t\\t\\tprintResult += newLine + newLine + testSucceded + \\\" tests succeded\\\"\\n\\t\\t\\t\\t\\t+ newLine;\\n\\t\\t\\tprintResult += testFailed + \\\" tests failed\\\" + newLine;\\n\\t\\t\\tprintResult += testFailByException + \\\" tests failed because of \\\"\\n\\t\\t\\t\\t\\t+ \\\"an exception\\\" + newLine + newLine;\\n\\t\\t}\\n\\t\\treturn printResult;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b1ab5142b78b9d71096d7e81bf9f10c\",\n \"score\": \"0.552065\",\n \"text\": \"@Test\\n public void testGetMethodParameters() {\\n writeBanner(methodName());\\n ClassInfo<Person> classInfo = new ClassInfo<>(Person.class);\\n List<Method> methods = classInfo.getMethods();\\n methods.forEach(m -> {\\n writeln(\\\"method: {0}\\\", m.getName());\\n List<Parameter> parameters = classInfo.getMethodParameters(m);\\n parameters.forEach(p -> {\\n writeln(\\\" parameter: {0}\\\", p);\\n });\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eda5790f36c4980869d2cdd02a088477\",\n \"score\": \"0.55189556\",\n \"text\": \"@Test\\n public void testMiningExtraction() {\\n // TODO: test MiningExtraction\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4fe23313e79a3c6eacf92bc5390ffac0\",\n \"score\": \"0.55187607\",\n \"text\": \"@Test(timeout = 4000)\\n public void test086() throws Throwable {\\n FileSystemHandling fileSystemHandling0 = new FileSystemHandling();\\n assertNotNull(fileSystemHandling0);\\n \\n boolean boolean0 = FileSystemHandling.setPermissions((EvoSuiteFile) null, false, true, false);\\n assertFalse(boolean0);\\n \\n boolean boolean1 = FileSystemHandling.appendLineToFile((EvoSuiteFile) null, \\\"Class not found\\\");\\n assertTrue(boolean1 == boolean0);\\n assertFalse(boolean1);\\n \\n ClassWriter classWriter0 = new ClassWriter(1646);\\n assertEquals(1, ClassWriter.COMPUTE_MAXS);\\n assertEquals(2, ClassWriter.COMPUTE_FRAMES);\\n assertNotNull(classWriter0);\\n \\n String[] stringArray0 = new String[0];\\n boolean boolean2 = FileSystemHandling.appendLineToFile((EvoSuiteFile) null, \\\"AnnotationDefault\\\");\\n assertTrue(boolean2 == boolean1);\\n assertTrue(boolean2 == boolean0);\\n assertFalse(boolean2);\\n \\n MethodWriter methodWriter0 = new MethodWriter(classWriter0, 24117248, \\\"vPr='r-`^V@<#)X2Rcs\\\", \\\"AnnotationDefault\\\", \\\"ILek2S.Q;)gj\\\", stringArray0, false, false);\\n assertEquals(1, ClassWriter.COMPUTE_MAXS);\\n assertEquals(2, ClassWriter.COMPUTE_FRAMES);\\n assertNotNull(methodWriter0);\\n assertEquals(0, stringArray0.length);\\n \\n MethodWriter methodWriter1 = new MethodWriter(classWriter0, 1646, \\\"LocalVariableTable\\\", \\\"AnnotationDefault\\\", \\\"LocalVariableTable\\\", stringArray0, false, false);\\n assertEquals(1, ClassWriter.COMPUTE_MAXS);\\n assertEquals(2, ClassWriter.COMPUTE_FRAMES);\\n assertFalse(methodWriter1.equals((Object)methodWriter0));\\n assertNotNull(methodWriter1);\\n assertEquals(0, stringArray0.length);\\n \\n Label label0 = new Label();\\n assertNotNull(label0);\\n \\n methodWriter1.visitLocalVariable(\\\"6eTr!`6JjZw6,0?8'\\\", \\\" [E*GJhQBVWjjk\\\", \\\"Class not found\\\", label0, label0, 169);\\n assertEquals(1, ClassWriter.COMPUTE_MAXS);\\n assertEquals(2, ClassWriter.COMPUTE_FRAMES);\\n assertFalse(methodWriter1.equals((Object)methodWriter0));\\n assertNotSame(methodWriter1, methodWriter0);\\n assertEquals(0, stringArray0.length);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b4962a9721c3a871670d0ba35c491505\",\n \"score\": \"0.5518394\",\n \"text\": \"TestCaseReport report();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48d3389368d12a995902578e2337700f\",\n \"score\": \"0.5517191\",\n \"text\": \"@Test\\n void test() {\\n System.setProperty(\\\"karate.env\\\", \\\"docker\\\");\\n Results results = Runner.path(\\\"classpath:jobtest/web\\\").parallel(1);\\n ReportUtils.generateReport(results.getReportDir());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"71eb19fbccfae11b432f9be456dcfeac\",\n \"score\": \"0.55166435\",\n \"text\": \"public void testMethod(){\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3017048fcf207277c390d48f7afe278\",\n \"score\": \"0.5515788\",\n \"text\": \"@Test\\n public void testTest() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7373b624c375689698e5d65c9165fa0f\",\n \"score\": \"0.55132705\",\n \"text\": \"public static void main(String[] args) {\\n System.out.println(\\\"All Tests passed\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d4633c127429845154304c5ab9e07a1\",\n \"score\": \"0.5512793\",\n \"text\": \"@Override\\n public TestSuite getAllTests() {\\n TestSuite suite = new InstrumentationTestSuite(this);\\n suite.addTestSuite(MediaRecorderStressTest.class);\\n return suite;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"90b655b684ed01af36dbd22fe0e4adf5\",\n \"score\": \"0.550532\",\n \"text\": \"public void test() {\\n // implementation\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"320f11c57d51140d1b1c9946f6a2bc49\",\n \"score\": \"0.5505208\",\n \"text\": \"@Test\\n public void test()\\n {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c5291d7577c6bccd1b1765cd733f3f3\",\n \"score\": \"0.550405\",\n \"text\": \"public void run() {\\n\\n TestSuiteUtils.printHeader(this);\\n\\n //\\n // Initial Setup\\n //\\n SimpleDateFormat date_format = TestSuiteUtils.getDateFormat();\\n Date timestamp = new Date(System.currentTimeMillis());\\n\\n ConceptCluster concept_cluster = new ConceptCluster();\\n\\n addToLog(\\n \\\" 1. Test ConceptCluster: add(Concept), getConcepts() ... \\\"\\n + date_format.format(timestamp));\\n\\n Concept concept = new Concept.Default();\\n concept.setCUI(new CUI(\\\"C0000001\\\"));\\n concept.setPreferredAtom(new Atom.Default(1070));\\n concept.setEditingAuthority(new Authority.Default(\\\"KEVRIC\\\"));\\n concept.setEditingTimestamp(new java.util.Date());\\n concept.setReadTimestamp(new java.util.Date());\\n\\n concept_cluster.add(concept);\\n Concept[] concepts = concept_cluster.getConcepts();\\n if (concepts.length > 0)\\n addToLog(\\\" 1. Test Passed\\\");\\n else {\\n addToLog(\\\" 1. Test Failed\\\");\\n thisTestFailed();\\n }\\n\\n addToLog(\\\"\\\");\\n\\n if (this.isPassed())\\n addToLog(\\\" All tests passed\\\");\\n else\\n addToLog(\\\" At least one test did not complete successfully\\\");\\n\\n //\\n // Main Footer\\n //\\n\\n addToLog(\\\"\\\");\\n\\n addToLog(\\\"-------------------------------------------------------\\\");\\n addToLog(\\\"Finished TestSuiteConceptCluster at \\\" +\\n date_format.format(new Date(System.currentTimeMillis())));\\n addToLog(\\\"-------------------------------------------------------\\\");\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4b1d6292486abdedeac6e834d9892cd\",\n \"score\": \"0.5502525\",\n \"text\": \"@Test\\n public void small01() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0d393edb4500b10a94256defc8d1310\",\n \"score\": \"0.5502499\",\n \"text\": \"public static void main(String[] args) {\\n\\t\\tSystem.out.println(\\\"Test 1: \\\" + test1());\\r\\n\\t\\tSystem.out.println(\\\"Test 2: \\\" + test2());\\r\\n\\t\\tSystem.out.println(\\\"Test 3: \\\" + test3());\\r\\n\\t\\tSystem.out.println(\\\"Test 4: \\\" + test4());\\r\\n\\t\\tSystem.out.println(\\\"Test 5: \\\" + test5());\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"295dddf5411d6a454ec000a08a5db47d\",\n \"score\": \"0.54980534\",\n \"text\": \"@Test\\n public void test() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"392df68537289b4975644050920da7ee\",\n \"score\": \"0.5495031\",\n \"text\": \"public static void main(String[] args) {\\n\\t\\tTransformerServiceTest test = new TransformerServiceTest();\\n\\t\\ttest.testSpecialWin();\\n\\t\\ttest.testOneSpecialTransformerWin();\\n\\t\\ttest.testStrenghAndCourage();\\n\\t\\ttest.testSkill();\\n\\t\\ttest.testWinnerByOverallRating();\\n\\t\\ttest.testTie();\\n\\t\\ttest.testWinningTeam();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e84e58dba09938941cc82f79d193bae\",\n \"score\": \"0.549306\",\n \"text\": \"@Override\\r\\n\\tpublic void testing() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1cf2f377c1ac312c8c4dda8709708a1c\",\n \"score\": \"0.5491713\",\n \"text\": \"@Test\\n public void testCreateChallenge() {\\n System.out.println(\\\"createChallenge\\\");\\n \\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9d496ee64062b3b7d66f7e820ae42ff\",\n \"score\": \"0.54893976\",\n \"text\": \"protected void setUp() {\\r\\n\\t\\tFile cleanDir = new File(clean);\\r\\n\\t\\tFile destDir = new File(root + \\\"\\\\\\\\method\\\");\\r\\n\\t\\tdestDir.mkdir();\\r\\n\\r\\n\\t\\t(new FileCopy(\\r\\n\\t\\t\\t\\tnew File(cleanDir, \\\"method_Parent.java\\\"),\\r\\n\\t\\t\\t\\tnew File(destDir, \\\"Parent.java\\\"), false)).run();\\r\\n\\t\\t(new FileCopy(\\r\\n\\t\\t\\t\\tnew File(cleanDir, \\\"method_Child.java\\\"),\\r\\n\\t\\t\\t\\tnew File(destDir, \\\"Child.java\\\"), false)).run();\\r\\n\\r\\n\\t\\t(new SummaryTraversal(root)).run();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00da2a84576f56ffeb51a9cf44aecec0\",\n \"score\": \"0.54837805\",\n \"text\": \"@Test\\n public void test() {\\n\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985494,"cells":{"query_id":{"kind":"string","value":"11fcd2f5fa724f09de29ed39f6583580"},"query":{"kind":"string","value":"Created for refactoring method 2"},"positive_passages":{"kind":"list like","value":[{"docid":"980b8e45664739854279fde576d4c26e","score":"0.0","text":"public abstract void readItem();","title":""}],"string":"[\n {\n \"docid\": \"980b8e45664739854279fde576d4c26e\",\n \"score\": \"0.0\",\n \"text\": \"public abstract void readItem();\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"6b0e2e41d411b76c357d16b3eb3a159c","score":"0.58585733","text":"protected abstract void entschuldigen();","title":""},{"docid":"fb314e70bb3a93fa9517b4dd27193bd2","score":"0.5709324","text":"public void _Refactorings();","title":""},{"docid":"2698e2df29a24b9998ee11e61625c8a0","score":"0.56976026","text":"private void method() {\n\t\t\t}","title":""},{"docid":"658e2157a962e8e3911961071abbf52d","score":"0.5598526","text":"protected void func_70088_a() {}","title":""},{"docid":"c4efc9f9911178a27ec9261384d5f141","score":"0.5590511","text":"public void mo12644zk() {\n }","title":""},{"docid":"80d20df1cc75d8fa96c12c49a757fc43","score":"0.5486844","text":"@Override\n\tprotected void getExras() {\n\t\t\n\t}","title":""},{"docid":"118f2b8a20f48999973063ac332d07d3","score":"0.54821193","text":"@Override\r\n\t\t\tpublic void atras() {\n\r\n\t\t\t}","title":""},{"docid":"e4f52262e67021ff2dd83bea7678ddf1","score":"0.54420394","text":"private void behaviour4() {}","title":""},{"docid":"03380ffcac1dcedf74ef1f8462bcde2d","score":"0.5441117","text":"Simplifier() {}","title":""},{"docid":"aab41dd817435df39f8eea21affc6068","score":"0.54256475","text":"protected abstract void mo1288N();","title":""},{"docid":"8436022dbd33301a64633011031cfa7b","score":"0.54242146","text":"protected void filtrarHoyDDPF() {\n\t\t\r\n\t}","title":""},{"docid":"35e5940d13f06d1f0d6a21cf2739c70a","score":"0.5416758","text":"public function() {}","title":""},{"docid":"33c6baca4cfdf58a9cc5753b012f0f9a","score":"0.54085356","text":"private Helpers() { }","title":""},{"docid":"28237d6ae20e1aa35aaca12e05c950c9","score":"0.5404663","text":"@Override\n\tpublic void sacrifier() {\n\t\t\n\t}","title":""},{"docid":"b90019334af427582237b47d6785cb8d","score":"0.5334988","text":"@Override\n\tprotected void processLogic() {\n\n\t}","title":""},{"docid":"39da14b1f6e1adac9c0b748811e78b68","score":"0.53152764","text":"public void mo12645zl() {\n }","title":""},{"docid":"ee0f5f270c3e0eea9f37c3d1e42b1161","score":"0.53112274","text":"public void mo12736g() {\n }","title":""},{"docid":"d0a79718ff9c5863618b11860674ac5e","score":"0.5283843","text":"@Override\n\tpublic void comer() {\n\n\t}","title":""},{"docid":"5c8e848472fb111129ff96ea7e3eea3d","score":"0.5268213","text":"@Override\n public void pintar() {\n \n }","title":""},{"docid":"1de1d91c192888f0e3a70817cbf900e2","score":"0.52172834","text":"protected static void prueba() {\n\t\t\n\t}","title":""},{"docid":"a56ce606ea5cc945279ea9725eed5272","score":"0.52146196","text":"@Override\n\tpublic void alearga() {\n\t\t\n\t}","title":""},{"docid":"08bd45f7b8e2e14abf131ee7f61deb7d","score":"0.5197902","text":"public void func_71256_s() {\n }","title":""},{"docid":"52796605f7f7baa7158a293c5b2650aa","score":"0.51936376","text":"private void method() {\n\t\t}","title":""},{"docid":"81758c2988d9979c7d4b3fd5b3cce0e5","score":"0.518663","text":"@Override\r\n\tpublic void pular() {\n\r\n\t}","title":""},{"docid":"5d259e9a9ed31ac29902b25db191acd1","score":"0.51761913","text":"@Override\n\tpublic void bewegen() {\n\t\t\n\t}","title":""},{"docid":"17380e638d3b45243d9b6bf0231d5309","score":"0.51544255","text":"@Override\n protected Object part2() {\n return null;\n }","title":""},{"docid":"b9936bc3db0ac97ae50d7643a27379b4","score":"0.51507044","text":"@Override\n\tpublic void intercourse() {\n\n\t}","title":""},{"docid":"b46a4282f2416d8b0c8ecbdd64bad3c1","score":"0.514953","text":"public void mo1618a() {\n }","title":""},{"docid":"e469334136e3a4aa278d17f0b24824a0","score":"0.5146556","text":"private static void resulatdo1() {\n\t\t\r\n\t}","title":""},{"docid":"0f4b3e53e6cc56e2f5b6bb08baeddbb0","score":"0.51109487","text":"private static void logic() {\n }","title":""},{"docid":"15c9cae08ae101b3a04f9ff3b519ae04","score":"0.5104272","text":"public void mo8316a() {\n }","title":""},{"docid":"1f7c82e188acf30d59f88faf08cf24ac","score":"0.510225","text":"@Override\r\n\t\t\tpublic void ayuda() {\n\r\n\t\t\t}","title":""},{"docid":"3e9c4de332bfb94422f785054fa63ada","score":"0.5095817","text":"@Override\r\n\tpublic void limpiar() {\n\t\t\r\n\t}","title":""},{"docid":"f82ec92db72e32d9b9a983d17b3248b8","score":"0.5088922","text":"public abstract void mo18576vW();","title":""},{"docid":"f25d3171909f6a320f340d9072561e1d","score":"0.5077897","text":"private void TacherSmoking() {\n\n\t}","title":""},{"docid":"b31e42d8b7e75c2b8393036be0ff359e","score":"0.5073848","text":"protected void mo4543a() {\n }","title":""},{"docid":"0b812af084ac0cb033ab904c49294fed","score":"0.5069051","text":"public void mo25703a() {\n }","title":""},{"docid":"af13835afb4d49162a9c3718de90465b","score":"0.50566757","text":"private static void extracted() {\n\t\tthrow new IllegalArgumentException(\"Only 1 input\");\n\t}","title":""},{"docid":"e8868463a89178c883ee18ebd43b8a61","score":"0.50565684","text":"public final void mo34057y() {\n }","title":""},{"docid":"4009e9af7182fa9c0263b6796d4246a1","score":"0.5050012","text":"void mo86464P_();","title":""},{"docid":"036ca04d5bda406ef95b301ab899b68b","score":"0.5048142","text":"public final void mo58711c() {\n String str;\n if (this.f92919a != null) {\n this.f92927u = new ArrayList<>();\n SparseArray<AvatarUri> sparseArray = this.f92919a;\n if (sparseArray == null) {\n C7573i.m23580a();\n }\n int size = sparseArray.size();\n for (int i = 0; i < size; i++) {\n SparseArray<AvatarUri> sparseArray2 = this.f92919a;\n if (sparseArray2 == null) {\n C7573i.m23580a();\n }\n AvatarUri avatarUri = (AvatarUri) sparseArray2.valueAt(i);\n C7573i.m23582a((Object) avatarUri, \"avatarUri\");\n if (!TextUtils.isEmpty(avatarUri.uri)) {\n ArrayList<String> arrayList = this.f92927u;\n if (arrayList == null) {\n C7573i.m23580a();\n }\n arrayList.add(avatarUri.uri);\n }\n }\n this.f92928v = new C35427c();\n C35427c cVar = this.f92928v;\n if (cVar == null) {\n C7573i.m23580a();\n }\n cVar.mo66537a(this);\n C35427c cVar2 = this.f92928v;\n if (cVar2 == null) {\n C7573i.m23580a();\n }\n cVar2.mo66536a(new C35425a());\n if (this.f92924r) {\n String string = getString(R.string.b_t);\n C7573i.m23582a((Object) string, \"getString(R.string.friends_nickname)\");\n IAccountUserService f = C6861a.m21337f();\n C7573i.m23582a((Object) f, \"AccountProxyService.userService()\");\n User curUser = f.getCurUser();\n C7573i.m23582a((Object) curUser, \"AccountProxyService.userService().curUser\");\n str = C1642a.m8034a(string, Arrays.copyOf(new Object[]{curUser.getNickname()}, 1));\n C7573i.m23582a((Object) str, \"java.lang.String.format(format, *args)\");\n } else {\n str = \"\";\n }\n ArrayList<String> arrayList2 = this.f92927u;\n if (arrayList2 == null) {\n C7573i.m23580a();\n }\n String a = C7525m.m23492a(arrayList2, \",\", null, null, 0, null, null, 62, null);\n C35427c cVar3 = this.f92928v;\n if (cVar3 == null) {\n C7573i.m23580a();\n }\n cVar3.mo56976a(this.f92925s, a, str);\n }\n }","title":""},{"docid":"d4d98d5dd4150a3f1bc98842f063118d","score":"0.5030884","text":"@Override\n\t\tpublic void method1() {\n\t\t\t\n\t\t}","title":""},{"docid":"cb1c09afbbe0ad234f211aa36d586f4e","score":"0.5027225","text":"@Override\r\n\t\tprotected void update() {\n\t\t\t\r\n\t\t}","title":""},{"docid":"8c9bee953d6868c3de9a487d6803b3e0","score":"0.50139767","text":"public abstract void mo79653c();","title":""},{"docid":"09ab1aec5429d408a46cded1dfa5f2da","score":"0.5004659","text":"@Override\n\tpublic void method6() {\n\t\t\n\t}","title":""},{"docid":"85b25c664df01fd0b02e103c9bbc8372","score":"0.5000402","text":"@Override\r\n\tpublic void arreter() {\n\r\n\t}","title":""},{"docid":"35d0df4750a47e2a9a386bdcb14627de","score":"0.49963227","text":"public abstract void mo18577vX();","title":""},{"docid":"ef8c13365895705ddbaa9b51389c2443","score":"0.49951485","text":"protected void tell_them(){}","title":""},{"docid":"df874b61406cbb181a458ae515220156","score":"0.49900755","text":"public void mo12735f() {\n }","title":""},{"docid":"07779d53803dc6875c03bdee2e1afeb5","score":"0.49837875","text":"@Override\n public void ordenar() {\n }","title":""},{"docid":"ecefd0718deb94c226e1031bca922e4d","score":"0.49834046","text":"private void fun2() {\n\t\t\r\n\t}","title":""},{"docid":"23d32e184a88bab31671010c45922a93","score":"0.49735346","text":"private void inic() {}","title":""},{"docid":"777efb33041da4779c6ec15b9d85097c","score":"0.4968572","text":"@Override\r\n\tpublic void attaque() {\n\t\t\r\n\t}","title":""},{"docid":"7bee93559f0102825f5a5cc09f28432f","score":"0.4966984","text":"@Override\n\tpublic void method4() {\n\t\t\n\t}","title":""},{"docid":"760782723d8c4342b28783141689f538","score":"0.4963525","text":"private void parseParameters() {\r\n }","title":""},{"docid":"4077955e82cce22d988577ca0a7978fc","score":"0.49384245","text":"@Override\n\tpublic void dormir() {\n\n\t}","title":""},{"docid":"1b431b6b993b6f83bedbe589b6247808","score":"0.4936912","text":"public abstract void mo79654d();","title":""},{"docid":"d11088201469f0fb2ae89706c29119a3","score":"0.4926386","text":"void a(java.util.List<java.lang.String> r13, com.tencent.stat.c r14) {\n /*\n r12 = this;\n r10 = 0;\n r9 = 200; // 0xc8 float:2.8E-43 double:9.9E-322;\n r1 = 0;\n r3 = new java.lang.StringBuilder;\t Catch:{ Throwable -> 0x015f }\n r3.<init>();\t Catch:{ Throwable -> 0x015f }\n r0 = \"[\";\n r3.append(r0);\t Catch:{ Throwable -> 0x015f }\n r2 = r1;\n L_0x0011:\n r0 = r13.size();\t Catch:{ Throwable -> 0x015f }\n if (r2 >= r0) goto L_0x0032;\n L_0x0017:\n r0 = r13.get(r2);\t Catch:{ Throwable -> 0x015f }\n r0 = (java.lang.String) r0;\t Catch:{ Throwable -> 0x015f }\n r3.append(r0);\t Catch:{ Throwable -> 0x015f }\n r0 = r13.size();\t Catch:{ Throwable -> 0x015f }\n r0 = r0 + -1;\n if (r2 == r0) goto L_0x002e;\n L_0x0028:\n r0 = \",\";\n r3.append(r0);\t Catch:{ Throwable -> 0x015f }\n L_0x002e:\n r0 = r2 + 1;\n r2 = r0;\n goto L_0x0011;\n L_0x0032:\n r0 = \"]\";\n r3.append(r0);\t Catch:{ Throwable -> 0x015f }\n r0 = com.tencent.stat.StatConfig.getStatReportUrl();\t Catch:{ Throwable -> 0x015f }\n r2 = c;\t Catch:{ Throwable -> 0x015f }\n r4 = new java.lang.StringBuilder;\t Catch:{ Throwable -> 0x015f }\n r4.<init>();\t Catch:{ Throwable -> 0x015f }\n r5 = \"[\";\n r4 = r4.append(r5);\t Catch:{ Throwable -> 0x015f }\n r4 = r4.append(r0);\t Catch:{ Throwable -> 0x015f }\n r5 = \"]Send request(\";\n r4 = r4.append(r5);\t Catch:{ Throwable -> 0x015f }\n r5 = r3.toString();\t Catch:{ Throwable -> 0x015f }\n r5 = r5.length();\t Catch:{ Throwable -> 0x015f }\n r4 = r4.append(r5);\t Catch:{ Throwable -> 0x015f }\n r5 = \"bytes):\";\n r4 = r4.append(r5);\t Catch:{ Throwable -> 0x015f }\n r5 = r3.toString();\t Catch:{ Throwable -> 0x015f }\n r4 = r4.append(r5);\t Catch:{ Throwable -> 0x015f }\n r4 = r4.toString();\t Catch:{ Throwable -> 0x015f }\n r2.i(r4);\t Catch:{ Throwable -> 0x015f }\n r2 = new org.apache.http.client.methods.HttpPost;\t Catch:{ Throwable -> 0x015f }\n r2.<init>(r0);\t Catch:{ Throwable -> 0x015f }\n r0 = \"Accept-Encoding\";\n r4 = \"gzip\";\n r2.addHeader(r0, r4);\t Catch:{ Throwable -> 0x015f }\n r0 = \"Connection\";\n r4 = \"Keep-Alive\";\n r2.setHeader(r0, r4);\t Catch:{ Throwable -> 0x015f }\n r0 = \"Cache-Control\";\n r2.removeHeaders(r0);\t Catch:{ Throwable -> 0x015f }\n r0 = f;\t Catch:{ Throwable -> 0x015f }\n r4 = com.tencent.stat.common.k.a(r0);\t Catch:{ Throwable -> 0x015f }\n if (r4 == 0) goto L_0x00cb;\n L_0x009c:\n r0 = r12.a;\t Catch:{ Throwable -> 0x015f }\n r0 = r0.getParams();\t Catch:{ Throwable -> 0x015f }\n r1 = \"http.route.default-proxy\";\n r5 = f;\t Catch:{ Throwable -> 0x015f }\n r5 = com.tencent.stat.common.k.a(r5);\t Catch:{ Throwable -> 0x015f }\n r0.setParameter(r1, r5);\t Catch:{ Throwable -> 0x015f }\n r0 = \"X-Online-Host\";\n r1 = \"pingma.qq.com:80\";\n r2.addHeader(r0, r1);\t Catch:{ Throwable -> 0x015f }\n r0 = \"Accept\";\n r1 = \"*/\n *\";\n r2.addHeader(r0, r1);\n Catch:\n {\n Throwable -> 0x015f\n }\n r0 = \"Content-Type\";\n r1 = \"json\";\n r2.addHeader(r0, r1);\n Catch:\n {\n Throwable -> 0x015f\n }\n r0 = 1;\n r1 = r0;\n L_0x00cb:\n r5 = new java.io.ByteArrayOutputStream; Catch:\n {\n Throwable -> 0x015f\n }\n r5.<init> (); Catch:\n {\n Throwable -> 0x015f\n }\n r0 = r3.toString();\n Catch:\n {\n Throwable -> 0x015f\n }\n r6 = \"UTF-8\";\n r0 = r0.getBytes(r6);\n Catch:\n {\n Throwable -> 0x015f\n }\n r6 = r0.length;\n Catch:\n {\n Throwable -> 0x015f\n }\n r3 = r3.length();\n Catch:\n {\n Throwable -> 0x015f\n }\n r7 = 256; // 0x100 float:3.59E-43 double:1.265E-321;\n if (r3 >= r7)goto L_0x0174;\n L_0x00e4:\n if (r4 != 0)goto L_0x0155;\n L_0x00e6:\n r3 = \"Content-Encoding\";\n r4 = \"rc4\";\n r2.addHeader(r3, r4);\n Catch:\n {\n Throwable -> 0x015f\n }\n L_0x00ef:\n r0 = com.tencent.stat.common.e.a(r0);\n Catch:\n {\n Throwable -> 0x015f\n }\n r3 = new org.apache.http.entity.ByteArrayEntity; Catch:\n {\n Throwable -> 0x015f\n }\n r3.<init> (r0);\n Catch:\n {\n Throwable -> 0x015f\n }\n r2.setEntity(r3);\n Catch:\n {\n Throwable -> 0x015f\n }\n r0 = r12.a;\n Catch:\n {\n Throwable -> 0x015f\n }\n r2 = r0.execute(r2);\n Catch:\n {\n Throwable -> 0x015f\n }\n if (r1 == 0)goto L_0x010f;\n L_0x0103:\n r0 = r12.a;\n Catch:\n {\n Throwable -> 0x015f\n }\n r0 = r0.getParams();\n Catch:\n {\n Throwable -> 0x015f\n }\n r1 = \"http.route.default-proxy\";\n r0.removeParameter(r1);\n Catch:\n {\n Throwable -> 0x015f\n }\n L_0x010f:\n r0 = r2.getEntity();\n Catch:\n {\n Throwable -> 0x015f\n }\n r1 = r2.getStatusLine();\n Catch:\n {\n Throwable -> 0x015f\n }\n r1 = r1.getStatusCode();\n Catch:\n {\n Throwable -> 0x015f\n }\n r6 = r0.getContentLength();\n Catch:\n {\n Throwable -> 0x015f\n }\n r3 = c;\n Catch:\n {\n Throwable -> 0x015f\n }\n r4 = new java.lang.StringBuilder; Catch:\n {\n Throwable -> 0x015f\n }\n r4.<init> (); Catch:\n {\n Throwable -> 0x015f\n }\n r8 = \"recv response status code:\";\n r4 = r4.append(r8);\n Catch:\n {\n Throwable -> 0x015f\n }\n r4 = r4.append(r1);\n Catch:\n {\n Throwable -> 0x015f\n }\n r8 = \", content length:\";\n r4 = r4.append(r8);\n Catch:\n {\n Throwable -> 0x015f\n }\n r4 = r4.append(r6);\n Catch:\n {\n Throwable -> 0x015f\n }\n r4 = r4.toString();\n Catch:\n {\n Throwable -> 0x015f\n }\n r3.i(r4);\n Catch:\n {\n Throwable -> 0x015f\n }\n r3 = (r6 > r10 ? 1 : (r6 == r10 ? 0 : -1));\n if (r3 != 0)goto L_0x01f0;\n L_0x0147:\n org.apache.http.util.EntityUtils.toString(r0);\n Catch:\n {\n Throwable -> 0x015f\n }\n if (r1 != r9)goto L_0x01d5;\n L_0x014c:\n if (r14 == 0)goto L_0x0151;\n L_0x014e:\n r14.a();\n Catch:\n {\n Throwable -> 0x015f\n }\n L_0x0151:\n r5.close();\n Catch:\n {\n Throwable -> 0x015f\n }\n L_0x0154:\n return;\n L_0x0155:\n r3 = \"X-Content-Encoding\";\n r4 = \"rc4\";\n r2.addHeader(r3, r4);\n Catch:\n {\n Throwable -> 0x015f\n }\n goto L_0x00ef;\n L_0x015f:\n r0 = move - exception;\n r1 = c;\n Catch:\n {\n all -> 0x0172\n }\n r1.e(r0);\n Catch:\n {\n all -> 0x0172\n }\n if (r14 == 0)goto L_0x0154;\n L_0x0167:\n r14.b();\n Catch:\n {\n Throwable -> 0x016b\n }\n goto L_0x0154;\n L_0x016b:\n r0 = move - exception;\n r1 = c;\n Catch:\n {\n all -> 0x0172\n }\n r1.e(r0);\n Catch:\n {\n all -> 0x0172\n }\n goto L_0x0154;\n L_0x0172:\n r0 = move - exception;\n throw r0;\n L_0x0174:\n if (r4 != 0)goto L_0x01cb;\n L_0x0176:\n r3 = \"Content-Encoding\";\n r4 = \"rc4,gzip\";\n r2.addHeader(r3, r4);\n Catch:\n {\n Throwable -> 0x015f\n }\n L_0x017f:\n r3 = 4;\n r3 = new byte[r3];\n Catch:\n {\n Throwable -> 0x015f\n }\n r5.write(r3);\n Catch:\n {\n Throwable -> 0x015f\n }\n r3 = new java.util.zip.GZIPOutputStream; Catch:\n {\n Throwable -> 0x015f\n }\n r3.<init> (r5);\n Catch:\n {\n Throwable -> 0x015f\n }\n r3.write(r0);\n Catch:\n {\n Throwable -> 0x015f\n }\n r3.close();\n Catch:\n {\n Throwable -> 0x015f\n }\n r0 = r5.toByteArray();\n Catch:\n {\n Throwable -> 0x015f\n }\n r3 = 0;\n r4 = 4;\n r3 = java.nio.ByteBuffer.wrap(r0, r3, r4);\n Catch:\n {\n Throwable -> 0x015f\n }\n r3.putInt(r6);\n Catch:\n {\n Throwable -> 0x015f\n }\n r3 = c;\n Catch:\n {\n Throwable -> 0x015f\n }\n r4 = new java.lang.StringBuilder; Catch:\n {\n Throwable -> 0x015f\n }\n r4.<init> (); Catch:\n {\n Throwable -> 0x015f\n }\n r7 = \"before Gzip:\";\n r4 = r4.append(r7);\n Catch:\n {\n Throwable -> 0x015f\n }\n r4 = r4.append(r6);\n Catch:\n {\n Throwable -> 0x015f\n }\n r6 = \" bytes, after Gzip:\";\n r4 = r4.append(r6);\n Catch:\n {\n Throwable -> 0x015f\n }\n r6 = r0.length;\n Catch:\n {\n Throwable -> 0x015f\n }\n r4 = r4.append(r6);\n Catch:\n {\n Throwable -> 0x015f\n }\n r6 = \" bytes\";\n r4 = r4.append(r6);\n Catch:\n {\n Throwable -> 0x015f\n }\n r4 = r4.toString();\n Catch:\n {\n Throwable -> 0x015f\n }\n r3.d(r4);\n Catch:\n {\n Throwable -> 0x015f\n }\n goto L_0x00ef;\n L_0x01cb:\n r3 = \"X-Content-Encoding\";\n r4 = \"rc4,gzip\";\n r2.addHeader(r3, r4);\n Catch:\n {\n Throwable -> 0x015f\n }\n goto L_0x017f;\n L_0x01d5:\n r0 = c;\n Catch:\n {\n Throwable -> 0x015f\n }\n r2 = new java.lang.StringBuilder; Catch:\n {\n Throwable -> 0x015f\n }\n r2.<init> (); Catch:\n {\n Throwable -> 0x015f\n }\n r3 = \"Server response error code:\";\n r2 = r2.append(r3);\n Catch:\n {\n Throwable -> 0x015f\n }\n r1 = r2.append(r1);\n Catch:\n {\n Throwable -> 0x015f\n }\n r1 = r1.toString();\n Catch:\n {\n Throwable -> 0x015f\n }\n r0.error(r1);\n Catch:\n {\n Throwable -> 0x015f\n }\n goto L_0x0151;\n L_0x01f0:\n r3 = (r6 > r10 ? 1 : (r6 == r10 ? 0 : -1));\n if (r3 <= 0)goto L_0x0345;\n L_0x01f4:\n r3 = r0.getContent();\n Catch:\n {\n Throwable -> 0x015f\n }\n r4 = new java.io.DataInputStream; Catch:\n {\n Throwable -> 0x015f\n }\n r4.<init> (r3);\n Catch:\n {\n Throwable -> 0x015f\n }\n r6 = r0.getContentLength();\n Catch:\n {\n Throwable -> 0x015f\n }\n r0 = (int) r6;\n Catch:\n {\n Throwable -> 0x015f\n }\n r0 = new byte[r0];\n Catch:\n {\n Throwable -> 0x015f\n }\n r4.readFully(r0);\n Catch:\n {\n Throwable -> 0x015f\n }\n r3.close();\n Catch:\n {\n Throwable -> 0x015f\n }\n r4.close();\n Catch:\n {\n Throwable -> 0x015f\n }\n r4 = \"Content-Encoding\";\n r2 = r2.getFirstHeader(r4);\n Catch:\n {\n Throwable -> 0x015f\n }\n if (r2 == 0)goto L_0x022b;\n L_0x0216:\n r4 = r2.getValue();\n Catch:\n {\n Throwable -> 0x015f\n }\n r6 = \"gzip,rc4\";\n r4 = r4.equalsIgnoreCase(r6);\n Catch:\n {\n Throwable -> 0x015f\n }\n if (r4 == 0)goto L_0x02b9;\n L_0x0223:\n r0 = com.tencent.stat.common.k.a(r0);\n Catch:\n {\n Throwable -> 0x015f\n }\n r0 = com.tencent.stat.common.e.b(r0);\n Catch:\n {\n Throwable -> 0x015f\n }\n L_0x022b:\n if (r1 != r9)goto L_0x0317;\n L_0x022d:\n r1 = new java.lang.String; Catch:\n {\n Throwable -> 0x030c\n }\n r2 = \"UTF-8\";\n r1.<init> (r0, r2);\n Catch:\n {\n Throwable -> 0x030c\n }\n r0 = c;\n Catch:\n {\n Throwable -> 0x030c\n }\n r0.d(r1);\n Catch:\n {\n Throwable -> 0x030c\n }\n r0 = new org.json.JSONObject; Catch:\n {\n Throwable -> 0x030c\n }\n r0.<init> (r1);\n Catch:\n {\n Throwable -> 0x030c\n }\n r2 = \"cfg\";\n r2 = r0.isNull(r2);\n Catch:\n {\n Throwable -> 0x030c\n }\n if (r2 != 0)goto L_0x0252;\n L_0x0248:\n r2 = \"cfg\";\n r2 = r0.getJSONObject(r2);\n Catch:\n {\n Throwable -> 0x030c\n }\n com.tencent.stat.StatConfig.a(r2);\n Catch:\n {\n Throwable -> 0x030c\n }\n L_0x0252:\n r2 = \"et\";\n r2 = r0.isNull(r2);\n Catch:\n {\n Throwable -> 0x030c\n }\n if (r2 != 0)goto L_0x02af;\n L_0x025b:\n r2 = \"st\";\n r2 = r0.isNull(r2);\n Catch:\n {\n Throwable -> 0x030c\n }\n if (r2 != 0)goto L_0x02af;\n L_0x0264:\n r2 = c;\n Catch:\n {\n Throwable -> 0x030c\n }\n r4 = new java.lang.StringBuilder; Catch:\n {\n Throwable -> 0x030c\n }\n r4.<init> (); Catch:\n {\n Throwable -> 0x030c\n }\n r6 = \"get mid respone:\";\n r4 = r4.append(r6);\n Catch:\n {\n Throwable -> 0x030c\n }\n r1 = r4.append(r1);\n Catch:\n {\n Throwable -> 0x030c\n }\n r1 = r1.toString();\n Catch:\n {\n Throwable -> 0x030c\n }\n r2.d(r1);\n Catch:\n {\n Throwable -> 0x030c\n }\n r1 = \"et\";\n r1 = r0.getInt(r1);\n Catch:\n {\n Throwable -> 0x030c\n }\n r2 = com.tencent.stat.a.f.SESSION_ENV;\n Catch:\n {\n Throwable -> 0x030c\n }\n r2 = r2.a();\n Catch:\n {\n Throwable -> 0x030c\n }\n if (r1 != r2)goto L_0x02af;\n L_0x028c:\n r1 = \"st\";\n r1 = r0.getInt(r1);\n Catch:\n {\n Throwable -> 0x030c\n }\n switch (r1) {\n case -1:goto L_0x02f6;\n case 0:goto L_0x02f6;\n default:goto L_0x0296;\n } ;\n Catch:\n {\n Throwable -> 0x030c\n }\n L_0x0296:\n r0 = c;\n Catch:\n {\n Throwable -> 0x030c\n }\n r2 = new java.lang.StringBuilder; Catch:\n {\n Throwable -> 0x030c\n }\n r2.<init> (); Catch:\n {\n Throwable -> 0x030c\n }\n r4 = \"error type for st:\";\n r2 = r2.append(r4);\n Catch:\n {\n Throwable -> 0x030c\n }\n r1 = r2.append(r1);\n Catch:\n {\n Throwable -> 0x030c\n }\n r1 = r1.toString();\n Catch:\n {\n Throwable -> 0x030c\n }\n r0.e(r1);\n Catch:\n {\n Throwable -> 0x030c\n }\n L_0x02af:\n if (r14 == 0)goto L_0x02b4;\n L_0x02b1:\n r14.a();\n Catch:\n {\n Throwable -> 0x015f\n }\n L_0x02b4:\n r3.close();\n Catch:\n {\n Throwable -> 0x015f\n }\n goto L_0x0151;\n L_0x02b9:\n r4 = r2.getValue();\n Catch:\n {\n Throwable -> 0x015f\n }\n r6 = \"rc4,gzip\";\n r4 = r4.equalsIgnoreCase(r6);\n Catch:\n {\n Throwable -> 0x015f\n }\n if (r4 == 0)goto L_0x02d0;\n L_0x02c6:\n r0 = com.tencent.stat.common.e.b(r0);\n Catch:\n {\n Throwable -> 0x015f\n }\n r0 = com.tencent.stat.common.k.a(r0);\n Catch:\n {\n Throwable -> 0x015f\n }\n goto L_0x022b;\n L_0x02d0:\n r4 = r2.getValue();\n Catch:\n {\n Throwable -> 0x015f\n }\n r6 = \"gzip\";\n r4 = r4.equalsIgnoreCase(r6);\n Catch:\n {\n Throwable -> 0x015f\n }\n if (r4 == 0)goto L_0x02e3;\n L_0x02dd:\n r0 = com.tencent.stat.common.k.a(r0);\n Catch:\n {\n Throwable -> 0x015f\n }\n goto L_0x022b;\n L_0x02e3:\n r2 = r2.getValue();\n Catch:\n {\n Throwable -> 0x015f\n }\n r4 = \"rc4\";\n r2 = r2.equalsIgnoreCase(r4);\n Catch:\n {\n Throwable -> 0x015f\n }\n if (r2 == 0)goto L_0x022b;\n L_0x02f0:\n r0 = com.tencent.stat.common.e.b(r0);\n Catch:\n {\n Throwable -> 0x015f\n }\n goto L_0x022b;\n L_0x02f6:\n r1 = \"mid\";\n r1 = r0.isNull(r1);\n Catch:\n {\n Throwable -> 0x030c\n }\n if (r1 != 0)goto L_0x02af;\n L_0x02ff:\n r1 = f;\n Catch:\n {\n Throwable -> 0x030c\n }\n r2 = \"mid\";\n r0 = r0.getString(r2);\n Catch:\n {\n Throwable -> 0x030c\n }\n com.tencent.stat.StatMid.updateDeviceInfo(r1, r0);\n Catch:\n {\n Throwable -> 0x030c\n }\n goto L_0x02af;\n L_0x030c:\n r0 = move - exception;\n r1 = c;\n Catch:\n {\n Throwable -> 0x015f\n }\n r0 = r0.toString();\n Catch:\n {\n Throwable -> 0x015f\n }\n r1.i(r0);\n Catch:\n {\n Throwable -> 0x015f\n }\n goto L_0x02af;\n L_0x0317:\n r2 = c;\n Catch:\n {\n Throwable -> 0x015f\n }\n r4 = new java.lang.StringBuilder; Catch:\n {\n Throwable -> 0x015f\n }\n r4.<init> (); Catch:\n {\n Throwable -> 0x015f\n }\n r6 = \"Server response error code:\";\n r4 = r4.append(r6);\n Catch:\n {\n Throwable -> 0x015f\n }\n r1 = r4.append(r1);\n Catch:\n {\n Throwable -> 0x015f\n }\n r4 = \", error:\";\n r1 = r1.append(r4);\n Catch:\n {\n Throwable -> 0x015f\n }\n r4 = new java.lang.String; Catch:\n {\n Throwable -> 0x015f\n }\n r6 = \"UTF-8\";\n r4.<init> (r0, r6);\n Catch:\n {\n Throwable -> 0x015f\n }\n r0 = r1.append(r4);\n Catch:\n {\n Throwable -> 0x015f\n }\n r0 = r0.toString();\n Catch:\n {\n Throwable -> 0x015f\n }\n r2.error(r0);\n Catch:\n {\n Throwable -> 0x015f\n }\n goto L_0x02b4;\n L_0x0345:\n org.apache.http.util.EntityUtils.toString(r0);\n Catch:\n {\n Throwable -> 0x015f\n }\n goto L_0x0151;\n */\n throw new UnsupportedOperationException(\"Method not decompiled: com.tencent.stat.d.a(java.util.List, com.tencent.stat.c):void\");\n }","title":""},{"docid":"322e19fcfb5cfbd6ffce194d7e04df05","score":"0.4926256","text":"@Override\n\t\t\tprotected void reInitial() {\n\t\t\t\t\n\t\t\t}","title":""},{"docid":"4e86f604c407a96c75671f663064c24b","score":"0.4915773","text":"public void mo8319b() {\n }","title":""},{"docid":"d01ba2fe96849dc20d68989ee58f8965","score":"0.49073708","text":"@Override\n protected String part2(List<Section> input) {\n return null;\n }","title":""},{"docid":"fdeab6ca2d3dd91b347a8cc2f5c862c2","score":"0.49048692","text":"private static void generateNew() {\n\t\t\t\t\n\t\t\n\t}","title":""},{"docid":"9f6e8d85aee157d478b1d171d149997d","score":"0.49012372","text":"public abstract void mo79652b();","title":""},{"docid":"659269c4eedaf6bb7778212f5c6c1935","score":"0.49005952","text":"public void testCase2(){\n\t\t\n\t}","title":""},{"docid":"27e4479db2c37a2e77fe796119b66d4b","score":"0.48991418","text":"@Override\r\n\t\t\tpublic void adelante() {\n\r\n\t\t\t}","title":""},{"docid":"6f21d040d8048da8dd5255d18bf39bb4","score":"0.48973423","text":"private void method_5396() {\r\n super();\r\n }","title":""},{"docid":"77944bbe703b9d2a970f09c06a77af46","score":"0.48955262","text":"protected abstract void mo803f();","title":""},{"docid":"406b5dab2afb5aa48e213ac396f8c8f9","score":"0.4889628","text":"@Override\n\tpublic void method7() {\n\t\t\n\t}","title":""},{"docid":"21d5639666b9f2f2f819e94da7c13d93","score":"0.4884212","text":"void mo4542Bl();","title":""},{"docid":"504725f8f2b160fef096226a4ab47e7e","score":"0.48831892","text":"@Override\n\tpublic int methodName2() {\n\t\treturn 0;\n\t}","title":""},{"docid":"52f9cc13f25bd854aaf783d82fd69e2c","score":"0.48822904","text":"void mo1251s();","title":""},{"docid":"4d2a7d9184ca339839cde05eebf1b3ba","score":"0.48754656","text":"public int c() {\n /*\n r11 = this;\n java.util.List<com.bumptech.glide.load.ImageHeaderParser> r0 = r11.f2754b\n i.b.a.n.l.m r1 = r11.c\n i.b.a.n.m.b0.b r2 = r11.a\n int r3 = r0.size()\n r4 = 0\n L_0x000b:\n r5 = -1\n if (r4 >= r3) goto L_0x0047\n java.lang.Object r6 = r0.get(r4)\n com.bumptech.glide.load.ImageHeaderParser r6 = (com.bumptech.glide.load.ImageHeaderParser) r6\n r7 = 0\n i.b.a.n.o.c.v r8 = new i.b.a.n.o.c.v // Catch:{ all -> 0x003d }\n java.io.FileInputStream r9 = new java.io.FileInputStream // Catch:{ all -> 0x003d }\n android.os.ParcelFileDescriptor r10 = r1.a() // Catch:{ all -> 0x003d }\n java.io.FileDescriptor r10 = r10.getFileDescriptor() // Catch:{ all -> 0x003d }\n r9.<init>(r10) // Catch:{ all -> 0x003d }\n r8.<init>(r9, r2) // Catch:{ all -> 0x003d }\n int r6 = r6.a(r8, r2) // Catch:{ all -> 0x003a }\n r8.close() // Catch:{ IOException -> 0x002f }\n goto L_0x0030\n L_0x002f:\n L_0x0030:\n r1.a()\n if (r6 == r5) goto L_0x0037\n r5 = r6\n goto L_0x0047\n L_0x0037:\n int r4 = r4 + 1\n goto L_0x000b\n L_0x003a:\n r0 = move-exception\n r7 = r8\n goto L_0x003e\n L_0x003d:\n r0 = move-exception\n L_0x003e:\n if (r7 == 0) goto L_0x0043\n r7.close() // Catch:{ IOException -> 0x0043 }\n L_0x0043:\n r1.a()\n throw r0\n L_0x0047:\n return r5\n */\n throw new UnsupportedOperationException(\"Method not decompiled: i.b.a.n.o.c.r.b.c():int\");\n }","title":""},{"docid":"22ac36b2371eb86809e09865575dc236","score":"0.48682472","text":"private static void m507b() {\r\n }","title":""},{"docid":"00bfdbbb49fd1d78d4eba12a819bdf12","score":"0.48667806","text":"private void apruebaComprobantes(){\n }","title":""},{"docid":"c33fa6c044c73bf206d5d491c250c22d","score":"0.4865903","text":"@Override\n\tpublic void fct2() {\n\t\t\n\t}","title":""},{"docid":"94ac133de68050c6588c166a65b54c2b","score":"0.48631182","text":"public abstract Dashboard mo17132n2();","title":""},{"docid":"5bb37ed5e0a08c04cb9e970f3e334584","score":"0.4853425","text":"@Override\n\tpublic void accion() {\n\n\t}","title":""},{"docid":"6e2ecbc9e846507a51c81ce152be79ae","score":"0.48519832","text":"@Override\n\tpublic void preProcess() {\n\n\t}","title":""},{"docid":"8043a68d1abb83fdef05a12947553545","score":"0.48482463","text":"public void fix() {\n\t\t\r\n\t}","title":""},{"docid":"e0728cec909b7b5015afca013c229f93","score":"0.48474842","text":"final void m5994a(java.util.List r15, com.google.android.finsky.dfemodel.Document r16, android.accounts.Account r17, android.content.Intent r18) {\n /*\n r14 = this;\n r2 = r14.f6211o;\n r0 = r17;\n r3 = r2.mo2811a(r0);\n r2 = r14.f6218v;\n r4 = r2.dn();\n r2 = r14.f6212p;\n r0 = r16;\n r1 = r17;\n r7 = r2.m11642a(r0, r1);\n r2 = 0;\n r5 = 0;\n r0 = r16;\n r6 = r0.f14885a;\n r6 = r6.f12099f;\n r8 = 3;\n if (r6 != r8) goto L_0x029d;\n L_0x0023:\n r2 = r16.m14625N();\n r2 = r2.f13171k;\n r5 = r14.f6203g;\n r5 = r5.m15626a(r2);\n r9 = r2;\n L_0x0030:\n r2 = r14.f6212p;\n r0 = r16;\n r8 = r2.m11649a(r0, r4, r3);\n r2 = 0;\n r10 = r2;\n L_0x003a:\n r2 = r15.size();\n if (r10 >= r2) goto L_0x029c;\n L_0x0040:\n r2 = r15.get(r10);\n r2 = (java.lang.Integer) r2;\n r11 = r2.intValue();\n r2 = r14.f6211o;\n r0 = r17;\n r12 = r2.mo2811a(r0);\n r2 = r14.f6218v;\n r4 = r2.dn();\n r2 = r14;\n r3 = r16;\n r6 = r17;\n r2 = r2.m5996a(r3, r4, r5, r6, r7, r8);\n if (r2 != 0) goto L_0x007c;\n L_0x0063:\n r2 = 1;\n L_0x0064:\n r3 = r14.f6212p;\n r3 = r3.m11644a(r12);\n r6 = r14.f6212p;\n r0 = r16;\n r6 = r6.m11654b(r0);\n switch(r11) {\n case 1: goto L_0x0268;\n case 2: goto L_0x0213;\n case 3: goto L_0x01a8;\n case 4: goto L_0x01a0;\n case 5: goto L_0x007e;\n case 6: goto L_0x009c;\n case 7: goto L_0x00ba;\n case 8: goto L_0x00d8;\n case 9: goto L_0x00ed;\n case 10: goto L_0x010b;\n case 11: goto L_0x0121;\n case 12: goto L_0x01bf;\n case 13: goto L_0x01b0;\n case 14: goto L_0x012b;\n case 15: goto L_0x013f;\n case 16: goto L_0x0206;\n case 17: goto L_0x0159;\n case 18: goto L_0x017b;\n case 19: goto L_0x0075;\n case 20: goto L_0x01e2;\n case 21: goto L_0x01ed;\n case 22: goto L_0x0075;\n case 23: goto L_0x0075;\n case 24: goto L_0x0223;\n case 25: goto L_0x00ab;\n case 26: goto L_0x008d;\n case 27: goto L_0x00c9;\n default: goto L_0x0075;\n };\n L_0x0075:\n r2 = 1;\n L_0x0076:\n if (r2 != 0) goto L_0x0297;\n L_0x0078:\n r15.remove(r10);\n goto L_0x003a;\n L_0x007c:\n r2 = 0;\n goto L_0x0064;\n L_0x007e:\n r2 = r14.m5995a();\n if (r2 == 0) goto L_0x0086;\n L_0x0084:\n r2 = 0;\n goto L_0x0076;\n L_0x0086:\n r0 = r16;\n r2 = r14.m5987a(r0, r3, r6);\n goto L_0x0076;\n L_0x008d:\n r2 = r14.m5995a();\n if (r2 != 0) goto L_0x0095;\n L_0x0093:\n r2 = 0;\n goto L_0x0076;\n L_0x0095:\n r0 = r16;\n r2 = r14.m5987a(r0, r3, r6);\n goto L_0x0076;\n L_0x009c:\n r2 = r14.m5995a();\n if (r2 == 0) goto L_0x00a4;\n L_0x00a2:\n r2 = 0;\n goto L_0x0076;\n L_0x00a4:\n r0 = r16;\n r2 = r14.m5990b(r0, r3, r6);\n goto L_0x0076;\n L_0x00ab:\n r2 = r14.m5995a();\n if (r2 != 0) goto L_0x00b3;\n L_0x00b1:\n r2 = 0;\n goto L_0x0076;\n L_0x00b3:\n r0 = r16;\n r2 = r14.m5990b(r0, r3, r6);\n goto L_0x0076;\n L_0x00ba:\n r4 = r14.m5995a();\n if (r4 == 0) goto L_0x00c2;\n L_0x00c0:\n r2 = 0;\n goto L_0x0076;\n L_0x00c2:\n r0 = r16;\n r2 = r14.m5988a(r0, r2, r3, r6);\n goto L_0x0076;\n L_0x00c9:\n r4 = r14.m5995a();\n if (r4 != 0) goto L_0x00d1;\n L_0x00cf:\n r2 = 0;\n goto L_0x0076;\n L_0x00d1:\n r0 = r16;\n r2 = r14.m5988a(r0, r2, r3, r6);\n goto L_0x0076;\n L_0x00d8:\n r0 = r16;\n r2 = r0.f14885a;\n r2 = r2.f12099f;\n r3 = 3;\n if (r2 != r3) goto L_0x00eb;\n L_0x00e1:\n r2 = r5.m15623b();\n if (r2 == 0) goto L_0x00eb;\n L_0x00e7:\n r2 = r5.f15829q;\n if (r2 == 0) goto L_0x0075;\n L_0x00eb:\n r2 = 0;\n goto L_0x0076;\n L_0x00ed:\n r0 = r16;\n r2 = r0.f14885a;\n r2 = r2.f12099f;\n r3 = 3;\n if (r2 != r3) goto L_0x0108;\n L_0x00f6:\n r2 = r5.m15623b();\n if (r2 == 0) goto L_0x0100;\n L_0x00fc:\n r2 = r5.f15829q;\n goto L_0x0076;\n L_0x0100:\n r2 = r5.f15824l;\n if (r2 != 0) goto L_0x0108;\n L_0x0104:\n r2 = r5.f15829q;\n if (r2 != 0) goto L_0x0075;\n L_0x0108:\n r2 = 0;\n goto L_0x0076;\n L_0x010b:\n r0 = r16;\n r2 = r0.f14885a;\n r2 = r2.f12099f;\n r3 = 3;\n if (r2 != r3) goto L_0x011e;\n L_0x0114:\n r2 = r5.m15623b();\n if (r2 != 0) goto L_0x011e;\n L_0x011a:\n r2 = r5.f15824l;\n if (r2 != 0) goto L_0x0075;\n L_0x011e:\n r2 = 0;\n goto L_0x0076;\n L_0x0121:\n r0 = r16;\n r1 = r17;\n r2 = r14.m5985a(r0, r1, r5, r4);\n goto L_0x0076;\n L_0x012b:\n r0 = r16;\n r2 = r0.f14885a;\n r2 = r2.f12099f;\n r3 = 3;\n if (r2 != r3) goto L_0x013c;\n L_0x0134:\n r2 = r5.f15831s;\n if (r2 == 0) goto L_0x013c;\n L_0x0138:\n r2 = r5.f15832t;\n if (r2 != 0) goto L_0x0075;\n L_0x013c:\n r2 = 0;\n goto L_0x0076;\n L_0x013f:\n r0 = r16;\n r2 = r0.f14885a;\n r2 = r2.f12099f;\n r3 = 3;\n if (r2 != r3) goto L_0x0156;\n L_0x0148:\n r2 = r5.f15831s;\n if (r2 != 0) goto L_0x0156;\n L_0x014c:\n r2 = r5.f15833u;\n if (r2 == 0) goto L_0x0156;\n L_0x0150:\n r2 = r5.m15621a();\n if (r2 != 0) goto L_0x0075;\n L_0x0156:\n r2 = 0;\n goto L_0x0076;\n L_0x0159:\n r0 = r16;\n r2 = r0.f14885a;\n r2 = r2.f12099f;\n r3 = 3;\n if (r2 != r3) goto L_0x0178;\n L_0x0162:\n r2 = r16.ae();\n if (r2 == 0) goto L_0x0178;\n L_0x0168:\n r2 = r14.f6215s;\n r0 = r16;\n r3 = r0.f14885a;\n r3 = r3.f12096c;\n r0 = r17;\n r2 = r2.m18640a(r3, r0);\n if (r2 == 0) goto L_0x0075;\n L_0x0178:\n r2 = 0;\n goto L_0x0076;\n L_0x017b:\n r0 = r16;\n r2 = r0.f14885a;\n r2 = r2.f12099f;\n r3 = 3;\n if (r2 == r3) goto L_0x0187;\n L_0x0184:\n r2 = 0;\n goto L_0x0076;\n L_0x0187:\n r2 = r16.ae();\n if (r2 != 0) goto L_0x0190;\n L_0x018d:\n r2 = 0;\n goto L_0x0076;\n L_0x0190:\n r2 = r14.f6215s;\n r0 = r16;\n r3 = r0.f14885a;\n r3 = r3.f12096c;\n r0 = r17;\n r2 = r2.m18640a(r3, r0);\n goto L_0x0076;\n L_0x01a0:\n r0 = r16;\n r2 = r14.m5986a(r0, r9, r5, r4);\n goto L_0x0076;\n L_0x01a8:\n r0 = r16;\n r2 = r14.m5986a(r0, r9, r5, r4);\n goto L_0x0076;\n L_0x01b0:\n if (r7 == 0) goto L_0x01bc;\n L_0x01b2:\n r2 = r14.f6212p;\n r0 = r16;\n r2 = r2.m11655c(r0, r12);\n if (r2 != 0) goto L_0x0075;\n L_0x01bc:\n r2 = 0;\n goto L_0x0076;\n L_0x01bf:\n r0 = r16;\n r2 = r0.f14885a;\n r2 = r2.f12099f;\n r3 = 3;\n if (r2 != r3) goto L_0x01d3;\n L_0x01c8:\n r2 = r5.f15831s;\n if (r2 == 0) goto L_0x01d0;\n L_0x01cc:\n r2 = r5.f15832t;\n if (r2 == 0) goto L_0x0075;\n L_0x01d0:\n r2 = 0;\n goto L_0x0076;\n L_0x01d3:\n if (r7 == 0) goto L_0x01df;\n L_0x01d5:\n r2 = r14.f6212p;\n r0 = r16;\n r2 = r2.m11655c(r0, r12);\n if (r2 == 0) goto L_0x0075;\n L_0x01df:\n r2 = 0;\n goto L_0x0076;\n L_0x01e2:\n r2 = r14;\n r3 = r16;\n r6 = r17;\n r2 = r2.m5996a(r3, r4, r5, r6, r7, r8);\n goto L_0x0076;\n L_0x01ed:\n if (r8 == 0) goto L_0x01f1;\n L_0x01ef:\n if (r7 == 0) goto L_0x01f4;\n L_0x01f1:\n r2 = 0;\n goto L_0x0076;\n L_0x01f4:\n r2 = 1;\n r0 = r16;\n r2 = r0.m14649e(r2);\n if (r2 == 0) goto L_0x0203;\n L_0x01fd:\n r2 = r16.ab();\n if (r2 != 0) goto L_0x0075;\n L_0x0203:\n r2 = 0;\n goto L_0x0076;\n L_0x0206:\n if (r7 != 0) goto L_0x0210;\n L_0x0208:\n if (r8 == 0) goto L_0x0210;\n L_0x020a:\n r2 = r16.ag();\n if (r2 != 0) goto L_0x0075;\n L_0x0210:\n r2 = 0;\n goto L_0x0076;\n L_0x0213:\n r0 = r16;\n r2 = r0.f14885a;\n r2 = r2.f12099f;\n r3 = 3;\n if (r2 != r3) goto L_0x0220;\n L_0x021c:\n r2 = r5.f15820h;\n if (r2 == 0) goto L_0x0075;\n L_0x0220:\n r2 = 0;\n goto L_0x0076;\n L_0x0223:\n r2 = r14.f6205i;\n r2 = com.google.android.finsky.as.C1503a.m8831b(r2);\n if (r2 == 0) goto L_0x0265;\n L_0x022b:\n r2 = r5.f15820h;\n if (r2 == 0) goto L_0x0265;\n L_0x022f:\n r0 = r16;\n r1 = r17;\n r2 = r14.m5985a(r0, r1, r5, r4);\n if (r2 != 0) goto L_0x0265;\n L_0x0239:\n r2 = r16.cf();\n r3 = r14.f6205i;\n r3 = com.google.android.finsky.as.C1503a.m8831b(r3);\n if (r3 == 0) goto L_0x0265;\n L_0x0245:\n r3 = new android.content.Intent;\n r4 = \"android.service.wallpaper.WallpaperService\";\n r3.<init>(r4);\n r4 = \"com.google.android.wearable.watchface.category.WATCH_FACE\";\n r3 = r3.addCategory(r4);\n r3.setPackage(r2);\n r2 = r14.f6214r;\n r4 = 128; // 0x80 float:1.794E-43 double:6.32E-322;\n r2 = r2.queryIntentServices(r3, r4);\n if (r2 == 0) goto L_0x0265;\n L_0x025f:\n r2 = r2.isEmpty();\n if (r2 == 0) goto L_0x0075;\n L_0x0265:\n r2 = 0;\n goto L_0x0076;\n L_0x0268:\n r2 = r14;\n r3 = r16;\n r6 = r17;\n r2 = r2.m5996a(r3, r4, r5, r6, r7, r8);\n if (r2 == 0) goto L_0x0294;\n L_0x0273:\n if (r18 == 0) goto L_0x0294;\n L_0x0275:\n r2 = r14.f6214r;\n r3 = 131072; // 0x20000 float:1.83671E-40 double:6.47582E-319;\n r0 = r18;\n r2 = r2.queryIntentActivities(r0, r3);\n r2 = r2.isEmpty();\n if (r2 != 0) goto L_0x0294;\n L_0x0285:\n r2 = r14.f6208l;\n r2 = r2.dj();\n r12 = 12636357; // 0xc0d0c5 float:1.7707308E-38 double:6.24319E-317;\n r2 = r2.mo2294a(r12);\n if (r2 != 0) goto L_0x0075;\n L_0x0294:\n r2 = 0;\n goto L_0x0076;\n L_0x0297:\n r2 = r10 + 1;\n r10 = r2;\n goto L_0x003a;\n L_0x029c:\n return;\n L_0x029d:\n r9 = r2;\n goto L_0x0030;\n */\n throw new UnsupportedOperationException(\"Method not decompiled: com.google.android.finsky.actionbuttons.j.a(java.util.List, com.google.android.finsky.dfemodel.Document, android.accounts.Account, android.content.Intent):void\");\n }","title":""},{"docid":"cbe3801e96200ff4ea06894c812b46b4","score":"0.48469457","text":"@SuppressWarnings(\"unused\")\r\n\tprivate void search(){\r\n\t\t\r\n\t}","title":""},{"docid":"60818471355861aa7d560568e9a9631b","score":"0.48453206","text":"@Override\n public void onCancelled(CancelledException cex) {\n\n }","title":""},{"docid":"670711ee90611c4f58910df06647dfe9","score":"0.4843937","text":"private static void m508c() {\r\n }","title":""},{"docid":"eb65a57bcae1971078950998abb7090f","score":"0.4843084","text":"@Override\n\tpublic void potenciar() {\n\t\t\n\t}","title":""},{"docid":"108c9cf8e9e48329bb26db01ed85c761","score":"0.48361352","text":"Referee getReferee2();","title":""},{"docid":"3b63e14a9d9957e71e472129ec2bc2b6","score":"0.4832338","text":"private void m16448e() {\n if (!TTLiveSDKContext.getHostService().mo22367h().mo22182c()) {\n if (getActivity() == null) {\n C9049ap.m27022a((int) R.string.ef8);\n } else {\n TTLiveSDKContext.getHostService().mo22367h().mo22167a(getActivity(), C8987h.m26865a().mo22189a(C3358ac.m12515a((int) R.string.f67)).mo22192c(\"comment_live\").mo22188a(1000).mo22190a()).mo19189a((C7498y<? super T>) new C8986g<Object>());\n }\n } else if (!TTLiveSDKContext.getHostService().mo22367h().mo22178a(LiveInteractFunction.COMMENT)) {\n if (this.f14692f && TTLiveSDKContext.getHostService().mo22360a().isNeedProtectUnderage()) {\n C9049ap.m27022a((int) R.string.f0i);\n } else if (this.f14694h != null && this.f14689c.getText() != null) {\n String obj = this.f14689c.getText().toString();\n if (m16445b(obj)) {\n this.f14694h.mo13257a(obj, this.f14692f);\n }\n }\n }\n }","title":""},{"docid":"eca216eb4c1d55fd14efc3e6b562bc69","score":"0.48321944","text":"public com.duokan.reader.common.webservices.b a(java.util.List r13) {\n /*\n r12 = this;\n r8 = 0;\n r3 = new com.duokan.reader.common.webservices.getVisible;\n r3.<creatCallTask>();\n r3.getVisible = r8;\n r0 = \"\";\n r3.getScaledMaximumFlingVelocity = r0;\n r4 = new java.util.HashMap;\n r4.<creatCallTask>();\n r3.setDrawable = r4;\n r5 = new java.util.HashMap;\n r5.<creatCallTask>();\n r1 = r13.iterator();\n L_0x001c:\n r0 = r1.hasNext();\n if (r0 == 0) goto L_0x0065;\n L_0x0022:\n r0 = r1.next();\n r0 = (com.duokan.reader.domain.bookshelf.fo) r0;\n r2 = new com.duokan.reader.domain.bookshelf.fs;\n r2.<creatCallTask>();\n r6 = r0.setDrawable;\n r2.setDrawable = r6;\n r6 = new java.util.ArrayList;\n r6.<creatCallTask>();\n r2.getVisible = r6;\n r6 = 1;\n r2.getScaledMaximumFlingVelocity = r6;\n r6 = -1;\n r2.getTriangleEdge = r6;\n r6 = r0.setDrawable;\n r6 = java.lang.Integer.valueOf(r6);\n r4.put(r6, r2);\n r2 = new com.duokan.reader.domain.bookshelf.fn;\n r2.<creatCallTask>();\n r6 = r0.setDrawable;\n r2.setDrawable = r6;\n r6 = r0.getVisible;\n r2.getTriangleEdge = r6;\n r2.getVisible = r8;\n r6 = 100;\n r2.getScaledMaximumFlingVelocity = r6;\n r0 = r0.setDrawable;\n r0 = java.lang.Integer.valueOf(r0);\n r5.put(r0, r2);\n goto L_0x001c;\n L_0x0065:\n r2 = new java.util.ArrayList;\n r2.<creatCallTask>();\n r6 = r13.iterator();\n L_0x006e:\n r0 = r6.hasNext();\n if (r0 == 0) goto L_0x0098;\n L_0x0074:\n r0 = r6.next();\n r0 = (com.duokan.reader.domain.bookshelf.fo) r0;\n r1 = r0.setDrawable;\n r1 = java.lang.Integer.valueOf(r1);\n r1 = r4.getAllSortStackTraces(r1);\n r1 = (com.duokan.reader.domain.bookshelf.fs) r1;\n r1 = r1.getScaledMaximumFlingVelocity;\n if (r1 == 0) goto L_0x006e;\n L_0x008a:\n r0 = r0.setDrawable;\n r0 = java.lang.Integer.valueOf(r0);\n r0 = r5.getAllSortStackTraces(r0);\n r2.add(r0);\n goto L_0x006e;\n L_0x0098:\n r0 = r2.isEmpty();\n if (r0 == 0) goto L_0x009f;\n L_0x009e:\n return r3;\n L_0x009f:\n r6 = r12.getVisible(r2);\n r0 = r6.getVisible;\n if (r0 != 0) goto L_0x00f8;\n L_0x00a7:\n r0 = r6.setDrawable;\n r0 = (java.util.HashMap) r0;\n r0 = r0.keySet();\n r7 = r0.iterator();\n L_0x00b3:\n r0 = r7.hasNext();\n if (r0 == 0) goto L_0x0065;\n L_0x00b9:\n r0 = r7.next();\n r0 = (java.lang.Integer) r0;\n r1 = r6.setDrawable;\n r1 = (java.util.HashMap) r1;\n r1 = r1.getAllSortStackTraces(r0);\n r1 = (com.duokan.reader.domain.bookshelf.fs) r1;\n r2 = r4.getAllSortStackTraces(r0);\n r2 = (com.duokan.reader.domain.bookshelf.fs) r2;\n r8 = r1.getScaledMaximumFlingVelocity;\n r2.getScaledMaximumFlingVelocity = r8;\n r8 = r2.getTriangleEdge;\n r10 = 0;\n r8 = (r8 > r10 ? 1 : (r8 == r10 ? 0 : -1));\n if (r8 >= 0) goto L_0x00df;\n L_0x00db:\n r8 = r1.getTriangleEdge;\n r2.getTriangleEdge = r8;\n L_0x00df:\n r2 = r2.getVisible;\n r8 = r1.getVisible;\n r2.addAll(r8);\n r0 = r5.getAllSortStackTraces(r0);\n r0 = (com.duokan.reader.domain.bookshelf.fn) r0;\n r2 = r0.getVisible;\n r1 = r1.getVisible;\n r1 = r1.size();\n r1 = r1 + r2;\n r0.getVisible = r1;\n goto L_0x00b3;\n L_0x00f8:\n r0 = r6.getVisible;\n r3.getVisible = r0;\n r0 = r6.getScaledMaximumFlingVelocity;\n r3.getScaledMaximumFlingVelocity = r0;\n r0 = r3.setDrawable;\n r0 = (java.util.HashMap) r0;\n r0.addFirst();\n goto L_0x009e;\n */\n throw new UnsupportedOperationException(\"Method not decompiled: com.duokan.reader.domain.bookshelf.fj.setDrawable(java.util.List):com.duokan.reader.common.webservices.getVisible\");\n }","title":""},{"docid":"b97e1efee35d53ca15bf9bf5766e1dd0","score":"0.48320246","text":"protected abstract void verabschieden();","title":""},{"docid":"7dfeef61ec9b131e6c0c21423e50fbbb","score":"0.4826969","text":"public void mo16243a() {\n }","title":""},{"docid":"2cc97f340071c93ab12395f2981731ee","score":"0.4825187","text":"public void mo25307b() {\n }","title":""},{"docid":"86873ab379d889d031cbc486bf7ee4a4","score":"0.48242715","text":"private void cierrecontable(){\n }","title":""},{"docid":"8e75ffe6faa994ed57c6ffb8b56296fe","score":"0.4822927","text":"public void xiuproof() {\n\t\t\n\t}","title":""},{"docid":"2fb65318d0ced2c103f6b86a288a8827","score":"0.4821642","text":"public void mo3742aL() {\n }","title":""},{"docid":"ff7c945a44d012c17376c32167ee2567","score":"0.4814693","text":"@Override\n public void sharedMethodOne() {\n\n }","title":""},{"docid":"fda5f4d0f9bad626ee716c0e53a58f78","score":"0.48082373","text":"private static void add() {\n\t\t\n\t}","title":""},{"docid":"0fa70559e20e4f8deeda0f703ffa4be3","score":"0.48074028","text":"@Override\r\n\tpublic void calculate2() {\n\t\t\r\n\t}","title":""},{"docid":"4d0a2c01962098af4f86405c89f81bac","score":"0.48049253","text":"abstract protected String getParameters();","title":""},{"docid":"b901583faeb614d4d67271470c31d36c","score":"0.4804766","text":"@Override\n\tpublic void sare() {\n\t\t\n\t}","title":""},{"docid":"8efca113e51c9b46e2ef52301dd40d5f","score":"0.48047516","text":"private Extra() {\n\t\t}","title":""},{"docid":"6dd266490e61a4deaa2399683b39c8b9","score":"0.4804112","text":"public final void mo65289a(java.util.List<? extends com.p280ss.android.ugc.aweme.feed.model.Aweme> r9) {\n /*\n r8 = this;\n boolean r0 = m81983a()\n if (r0 == 0) goto L_0x0007\n return\n L_0x0007:\n if (r9 == 0) goto L_0x00b0\n java.lang.Iterable r9 = (java.lang.Iterable) r9\n java.util.ArrayList r0 = new java.util.ArrayList\n r0.<init>()\n java.util.Collection r0 = (java.util.Collection) r0\n java.util.Iterator r9 = r9.iterator()\n L_0x0016:\n boolean r1 = r9.hasNext()\n if (r1 == 0) goto L_0x005b\n java.lang.Object r1 = r9.next()\n r2 = r1\n com.ss.android.ugc.aweme.feed.model.Aweme r2 = (com.p280ss.android.ugc.aweme.feed.model.Aweme) r2\n com.ss.android.ugc.aweme.feed.model.ItemLikeEggData r2 = r2.getCommerceAdLikeDigg()\n r3 = 1\n r4 = 0\n if (r2 == 0) goto L_0x0054\n java.lang.String r5 = r2.getFileType()\n java.lang.CharSequence r5 = (java.lang.CharSequence) r5\n if (r5 == 0) goto L_0x003c\n int r5 = r5.length()\n if (r5 != 0) goto L_0x003a\n goto L_0x003c\n L_0x003a:\n r5 = 0\n goto L_0x003d\n L_0x003c:\n r5 = 1\n L_0x003d:\n if (r5 != 0) goto L_0x0054\n java.lang.String r2 = r2.getMaterialUrl()\n java.lang.CharSequence r2 = (java.lang.CharSequence) r2\n if (r2 == 0) goto L_0x0050\n int r2 = r2.length()\n if (r2 != 0) goto L_0x004e\n goto L_0x0050\n L_0x004e:\n r2 = 0\n goto L_0x0051\n L_0x0050:\n r2 = 1\n L_0x0051:\n if (r2 != 0) goto L_0x0054\n goto L_0x0055\n L_0x0054:\n r3 = 0\n L_0x0055:\n if (r3 == 0) goto L_0x0016\n r0.add(r1)\n goto L_0x0016\n L_0x005b:\n java.util.List r0 = (java.util.List) r0\n java.lang.Iterable r0 = (java.lang.Iterable) r0\n java.util.Iterator r9 = r0.iterator()\n L_0x0063:\n boolean r0 = r9.hasNext()\n if (r0 == 0) goto L_0x00af\n java.lang.Object r0 = r9.next()\n com.ss.android.ugc.aweme.feed.model.Aweme r0 = (com.p280ss.android.ugc.aweme.feed.model.Aweme) r0\n com.ss.android.ugc.aweme.commercialize.log.b r7 = new com.ss.android.ugc.aweme.commercialize.log.b\n java.lang.String r2 = \"egg\"\n java.lang.String r3 = \"data_received\"\n r4 = 0\n r5 = 4\n r6 = 0\n r1 = r7\n r1.<init>(r2, r3, r4, r5, r6)\n java.lang.String r1 = r0.getAid()\n com.ss.android.ugc.aweme.commercialize.log.b r1 = r7.mo65230a(r1)\n com.ss.android.ugc.aweme.feed.model.AwemeRawAd r2 = r0.getAwemeRawAd()\n r3 = 0\n if (r2 == 0) goto L_0x0090\n java.lang.String r2 = r2.getCreativeIdStr()\n goto L_0x0091\n L_0x0090:\n r2 = r3\n L_0x0091:\n com.ss.android.ugc.aweme.commercialize.log.b r1 = r1.mo65232b(r2)\n com.ss.android.ugc.aweme.feed.model.AwemeRawAd r0 = r0.getAwemeRawAd()\n if (r0 == 0) goto L_0x009f\n java.lang.String r3 = r0.getLogExtra()\n L_0x009f:\n com.ss.android.ugc.aweme.commercialize.log.b r0 = r1.mo65233c(r3)\n java.lang.String r1 = \"like\"\n com.ss.android.ugc.aweme.commercialize.log.b r0 = r0.mo65235e(r1)\n com.ss.android.ugc.aweme.commercialize.log.c r1 = com.p280ss.android.ugc.aweme.commercialize.log.C24952c.f65801b\n r1.mo65237a(r0)\n goto L_0x0063\n L_0x00af:\n return\n L_0x00b0:\n return\n */\n throw new UnsupportedOperationException(\"Method not decompiled: com.p280ss.android.ugc.aweme.commercialize.log.C24972q.mo65289a(java.util.List):void\");\n }","title":""},{"docid":"1283662453dd2aabe5dd94937e3e22f5","score":"0.47963968","text":"private void utworzAkcje() {\n }","title":""}],"string":"[\n {\n \"docid\": \"6b0e2e41d411b76c357d16b3eb3a159c\",\n \"score\": \"0.58585733\",\n \"text\": \"protected abstract void entschuldigen();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb314e70bb3a93fa9517b4dd27193bd2\",\n \"score\": \"0.5709324\",\n \"text\": \"public void _Refactorings();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2698e2df29a24b9998ee11e61625c8a0\",\n \"score\": \"0.56976026\",\n \"text\": \"private void method() {\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"658e2157a962e8e3911961071abbf52d\",\n \"score\": \"0.5598526\",\n \"text\": \"protected void func_70088_a() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c4efc9f9911178a27ec9261384d5f141\",\n \"score\": \"0.5590511\",\n \"text\": \"public void mo12644zk() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80d20df1cc75d8fa96c12c49a757fc43\",\n \"score\": \"0.5486844\",\n \"text\": \"@Override\\n\\tprotected void getExras() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"118f2b8a20f48999973063ac332d07d3\",\n \"score\": \"0.54821193\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void atras() {\\n\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4f52262e67021ff2dd83bea7678ddf1\",\n \"score\": \"0.54420394\",\n \"text\": \"private void behaviour4() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03380ffcac1dcedf74ef1f8462bcde2d\",\n \"score\": \"0.5441117\",\n \"text\": \"Simplifier() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aab41dd817435df39f8eea21affc6068\",\n \"score\": \"0.54256475\",\n \"text\": \"protected abstract void mo1288N();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8436022dbd33301a64633011031cfa7b\",\n \"score\": \"0.54242146\",\n \"text\": \"protected void filtrarHoyDDPF() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35e5940d13f06d1f0d6a21cf2739c70a\",\n \"score\": \"0.5416758\",\n \"text\": \"public function() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"33c6baca4cfdf58a9cc5753b012f0f9a\",\n \"score\": \"0.54085356\",\n \"text\": \"private Helpers() { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28237d6ae20e1aa35aaca12e05c950c9\",\n \"score\": \"0.5404663\",\n \"text\": \"@Override\\n\\tpublic void sacrifier() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b90019334af427582237b47d6785cb8d\",\n \"score\": \"0.5334988\",\n \"text\": \"@Override\\n\\tprotected void processLogic() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39da14b1f6e1adac9c0b748811e78b68\",\n \"score\": \"0.53152764\",\n \"text\": \"public void mo12645zl() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee0f5f270c3e0eea9f37c3d1e42b1161\",\n \"score\": \"0.53112274\",\n \"text\": \"public void mo12736g() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0a79718ff9c5863618b11860674ac5e\",\n \"score\": \"0.5283843\",\n \"text\": \"@Override\\n\\tpublic void comer() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c8e848472fb111129ff96ea7e3eea3d\",\n \"score\": \"0.5268213\",\n \"text\": \"@Override\\n public void pintar() {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1de1d91c192888f0e3a70817cbf900e2\",\n \"score\": \"0.52172834\",\n \"text\": \"protected static void prueba() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a56ce606ea5cc945279ea9725eed5272\",\n \"score\": \"0.52146196\",\n \"text\": \"@Override\\n\\tpublic void alearga() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"08bd45f7b8e2e14abf131ee7f61deb7d\",\n \"score\": \"0.5197902\",\n \"text\": \"public void func_71256_s() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52796605f7f7baa7158a293c5b2650aa\",\n \"score\": \"0.51936376\",\n \"text\": \"private void method() {\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81758c2988d9979c7d4b3fd5b3cce0e5\",\n \"score\": \"0.518663\",\n \"text\": \"@Override\\r\\n\\tpublic void pular() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d259e9a9ed31ac29902b25db191acd1\",\n \"score\": \"0.51761913\",\n \"text\": \"@Override\\n\\tpublic void bewegen() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17380e638d3b45243d9b6bf0231d5309\",\n \"score\": \"0.51544255\",\n \"text\": \"@Override\\n protected Object part2() {\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b9936bc3db0ac97ae50d7643a27379b4\",\n \"score\": \"0.51507044\",\n \"text\": \"@Override\\n\\tpublic void intercourse() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b46a4282f2416d8b0c8ecbdd64bad3c1\",\n \"score\": \"0.514953\",\n \"text\": \"public void mo1618a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e469334136e3a4aa278d17f0b24824a0\",\n \"score\": \"0.5146556\",\n \"text\": \"private static void resulatdo1() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f4b3e53e6cc56e2f5b6bb08baeddbb0\",\n \"score\": \"0.51109487\",\n \"text\": \"private static void logic() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"15c9cae08ae101b3a04f9ff3b519ae04\",\n \"score\": \"0.5104272\",\n \"text\": \"public void mo8316a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7c82e188acf30d59f88faf08cf24ac\",\n \"score\": \"0.510225\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void ayuda() {\\n\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e9c4de332bfb94422f785054fa63ada\",\n \"score\": \"0.5095817\",\n \"text\": \"@Override\\r\\n\\tpublic void limpiar() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f82ec92db72e32d9b9a983d17b3248b8\",\n \"score\": \"0.5088922\",\n \"text\": \"public abstract void mo18576vW();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f25d3171909f6a320f340d9072561e1d\",\n \"score\": \"0.5077897\",\n \"text\": \"private void TacherSmoking() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b31e42d8b7e75c2b8393036be0ff359e\",\n \"score\": \"0.5073848\",\n \"text\": \"protected void mo4543a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b812af084ac0cb033ab904c49294fed\",\n \"score\": \"0.5069051\",\n \"text\": \"public void mo25703a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af13835afb4d49162a9c3718de90465b\",\n \"score\": \"0.50566757\",\n \"text\": \"private static void extracted() {\\n\\t\\tthrow new IllegalArgumentException(\\\"Only 1 input\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8868463a89178c883ee18ebd43b8a61\",\n \"score\": \"0.50565684\",\n \"text\": \"public final void mo34057y() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4009e9af7182fa9c0263b6796d4246a1\",\n \"score\": \"0.5050012\",\n \"text\": \"void mo86464P_();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"036ca04d5bda406ef95b301ab899b68b\",\n \"score\": \"0.5048142\",\n \"text\": \"public final void mo58711c() {\\n String str;\\n if (this.f92919a != null) {\\n this.f92927u = new ArrayList<>();\\n SparseArray<AvatarUri> sparseArray = this.f92919a;\\n if (sparseArray == null) {\\n C7573i.m23580a();\\n }\\n int size = sparseArray.size();\\n for (int i = 0; i < size; i++) {\\n SparseArray<AvatarUri> sparseArray2 = this.f92919a;\\n if (sparseArray2 == null) {\\n C7573i.m23580a();\\n }\\n AvatarUri avatarUri = (AvatarUri) sparseArray2.valueAt(i);\\n C7573i.m23582a((Object) avatarUri, \\\"avatarUri\\\");\\n if (!TextUtils.isEmpty(avatarUri.uri)) {\\n ArrayList<String> arrayList = this.f92927u;\\n if (arrayList == null) {\\n C7573i.m23580a();\\n }\\n arrayList.add(avatarUri.uri);\\n }\\n }\\n this.f92928v = new C35427c();\\n C35427c cVar = this.f92928v;\\n if (cVar == null) {\\n C7573i.m23580a();\\n }\\n cVar.mo66537a(this);\\n C35427c cVar2 = this.f92928v;\\n if (cVar2 == null) {\\n C7573i.m23580a();\\n }\\n cVar2.mo66536a(new C35425a());\\n if (this.f92924r) {\\n String string = getString(R.string.b_t);\\n C7573i.m23582a((Object) string, \\\"getString(R.string.friends_nickname)\\\");\\n IAccountUserService f = C6861a.m21337f();\\n C7573i.m23582a((Object) f, \\\"AccountProxyService.userService()\\\");\\n User curUser = f.getCurUser();\\n C7573i.m23582a((Object) curUser, \\\"AccountProxyService.userService().curUser\\\");\\n str = C1642a.m8034a(string, Arrays.copyOf(new Object[]{curUser.getNickname()}, 1));\\n C7573i.m23582a((Object) str, \\\"java.lang.String.format(format, *args)\\\");\\n } else {\\n str = \\\"\\\";\\n }\\n ArrayList<String> arrayList2 = this.f92927u;\\n if (arrayList2 == null) {\\n C7573i.m23580a();\\n }\\n String a = C7525m.m23492a(arrayList2, \\\",\\\", null, null, 0, null, null, 62, null);\\n C35427c cVar3 = this.f92928v;\\n if (cVar3 == null) {\\n C7573i.m23580a();\\n }\\n cVar3.mo56976a(this.f92925s, a, str);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4d98d5dd4150a3f1bc98842f063118d\",\n \"score\": \"0.5030884\",\n \"text\": \"@Override\\n\\t\\tpublic void method1() {\\n\\t\\t\\t\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb1c09afbbe0ad234f211aa36d586f4e\",\n \"score\": \"0.5027225\",\n \"text\": \"@Override\\r\\n\\t\\tprotected void update() {\\n\\t\\t\\t\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c9bee953d6868c3de9a487d6803b3e0\",\n \"score\": \"0.50139767\",\n \"text\": \"public abstract void mo79653c();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09ab1aec5429d408a46cded1dfa5f2da\",\n \"score\": \"0.5004659\",\n \"text\": \"@Override\\n\\tpublic void method6() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"85b25c664df01fd0b02e103c9bbc8372\",\n \"score\": \"0.5000402\",\n \"text\": \"@Override\\r\\n\\tpublic void arreter() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35d0df4750a47e2a9a386bdcb14627de\",\n \"score\": \"0.49963227\",\n \"text\": \"public abstract void mo18577vX();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef8c13365895705ddbaa9b51389c2443\",\n \"score\": \"0.49951485\",\n \"text\": \"protected void tell_them(){}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"df874b61406cbb181a458ae515220156\",\n \"score\": \"0.49900755\",\n \"text\": \"public void mo12735f() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07779d53803dc6875c03bdee2e1afeb5\",\n \"score\": \"0.49837875\",\n \"text\": \"@Override\\n public void ordenar() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ecefd0718deb94c226e1031bca922e4d\",\n \"score\": \"0.49834046\",\n \"text\": \"private void fun2() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"23d32e184a88bab31671010c45922a93\",\n \"score\": \"0.49735346\",\n \"text\": \"private void inic() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"777efb33041da4779c6ec15b9d85097c\",\n \"score\": \"0.4968572\",\n \"text\": \"@Override\\r\\n\\tpublic void attaque() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7bee93559f0102825f5a5cc09f28432f\",\n \"score\": \"0.4966984\",\n \"text\": \"@Override\\n\\tpublic void method4() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"760782723d8c4342b28783141689f538\",\n \"score\": \"0.4963525\",\n \"text\": \"private void parseParameters() {\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4077955e82cce22d988577ca0a7978fc\",\n \"score\": \"0.49384245\",\n \"text\": \"@Override\\n\\tpublic void dormir() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b431b6b993b6f83bedbe589b6247808\",\n \"score\": \"0.4936912\",\n \"text\": \"public abstract void mo79654d();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d11088201469f0fb2ae89706c29119a3\",\n \"score\": \"0.4926386\",\n \"text\": \"void a(java.util.List<java.lang.String> r13, com.tencent.stat.c r14) {\\n /*\\n r12 = this;\\n r10 = 0;\\n r9 = 200; // 0xc8 float:2.8E-43 double:9.9E-322;\\n r1 = 0;\\n r3 = new java.lang.StringBuilder;\\t Catch:{ Throwable -> 0x015f }\\n r3.<init>();\\t Catch:{ Throwable -> 0x015f }\\n r0 = \\\"[\\\";\\n r3.append(r0);\\t Catch:{ Throwable -> 0x015f }\\n r2 = r1;\\n L_0x0011:\\n r0 = r13.size();\\t Catch:{ Throwable -> 0x015f }\\n if (r2 >= r0) goto L_0x0032;\\n L_0x0017:\\n r0 = r13.get(r2);\\t Catch:{ Throwable -> 0x015f }\\n r0 = (java.lang.String) r0;\\t Catch:{ Throwable -> 0x015f }\\n r3.append(r0);\\t Catch:{ Throwable -> 0x015f }\\n r0 = r13.size();\\t Catch:{ Throwable -> 0x015f }\\n r0 = r0 + -1;\\n if (r2 == r0) goto L_0x002e;\\n L_0x0028:\\n r0 = \\\",\\\";\\n r3.append(r0);\\t Catch:{ Throwable -> 0x015f }\\n L_0x002e:\\n r0 = r2 + 1;\\n r2 = r0;\\n goto L_0x0011;\\n L_0x0032:\\n r0 = \\\"]\\\";\\n r3.append(r0);\\t Catch:{ Throwable -> 0x015f }\\n r0 = com.tencent.stat.StatConfig.getStatReportUrl();\\t Catch:{ Throwable -> 0x015f }\\n r2 = c;\\t Catch:{ Throwable -> 0x015f }\\n r4 = new java.lang.StringBuilder;\\t Catch:{ Throwable -> 0x015f }\\n r4.<init>();\\t Catch:{ Throwable -> 0x015f }\\n r5 = \\\"[\\\";\\n r4 = r4.append(r5);\\t Catch:{ Throwable -> 0x015f }\\n r4 = r4.append(r0);\\t Catch:{ Throwable -> 0x015f }\\n r5 = \\\"]Send request(\\\";\\n r4 = r4.append(r5);\\t Catch:{ Throwable -> 0x015f }\\n r5 = r3.toString();\\t Catch:{ Throwable -> 0x015f }\\n r5 = r5.length();\\t Catch:{ Throwable -> 0x015f }\\n r4 = r4.append(r5);\\t Catch:{ Throwable -> 0x015f }\\n r5 = \\\"bytes):\\\";\\n r4 = r4.append(r5);\\t Catch:{ Throwable -> 0x015f }\\n r5 = r3.toString();\\t Catch:{ Throwable -> 0x015f }\\n r4 = r4.append(r5);\\t Catch:{ Throwable -> 0x015f }\\n r4 = r4.toString();\\t Catch:{ Throwable -> 0x015f }\\n r2.i(r4);\\t Catch:{ Throwable -> 0x015f }\\n r2 = new org.apache.http.client.methods.HttpPost;\\t Catch:{ Throwable -> 0x015f }\\n r2.<init>(r0);\\t Catch:{ Throwable -> 0x015f }\\n r0 = \\\"Accept-Encoding\\\";\\n r4 = \\\"gzip\\\";\\n r2.addHeader(r0, r4);\\t Catch:{ Throwable -> 0x015f }\\n r0 = \\\"Connection\\\";\\n r4 = \\\"Keep-Alive\\\";\\n r2.setHeader(r0, r4);\\t Catch:{ Throwable -> 0x015f }\\n r0 = \\\"Cache-Control\\\";\\n r2.removeHeaders(r0);\\t Catch:{ Throwable -> 0x015f }\\n r0 = f;\\t Catch:{ Throwable -> 0x015f }\\n r4 = com.tencent.stat.common.k.a(r0);\\t Catch:{ Throwable -> 0x015f }\\n if (r4 == 0) goto L_0x00cb;\\n L_0x009c:\\n r0 = r12.a;\\t Catch:{ Throwable -> 0x015f }\\n r0 = r0.getParams();\\t Catch:{ Throwable -> 0x015f }\\n r1 = \\\"http.route.default-proxy\\\";\\n r5 = f;\\t Catch:{ Throwable -> 0x015f }\\n r5 = com.tencent.stat.common.k.a(r5);\\t Catch:{ Throwable -> 0x015f }\\n r0.setParameter(r1, r5);\\t Catch:{ Throwable -> 0x015f }\\n r0 = \\\"X-Online-Host\\\";\\n r1 = \\\"pingma.qq.com:80\\\";\\n r2.addHeader(r0, r1);\\t Catch:{ Throwable -> 0x015f }\\n r0 = \\\"Accept\\\";\\n r1 = \\\"*/\\n *\\\";\\n r2.addHeader(r0, r1);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r0 = \\\"Content-Type\\\";\\n r1 = \\\"json\\\";\\n r2.addHeader(r0, r1);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r0 = 1;\\n r1 = r0;\\n L_0x00cb:\\n r5 = new java.io.ByteArrayOutputStream; Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r5.<init> (); Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r0 = r3.toString();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r6 = \\\"UTF-8\\\";\\n r0 = r0.getBytes(r6);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r6 = r0.length;\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r3 = r3.length();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r7 = 256; // 0x100 float:3.59E-43 double:1.265E-321;\\n if (r3 >= r7)goto L_0x0174;\\n L_0x00e4:\\n if (r4 != 0)goto L_0x0155;\\n L_0x00e6:\\n r3 = \\\"Content-Encoding\\\";\\n r4 = \\\"rc4\\\";\\n r2.addHeader(r3, r4);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n L_0x00ef:\\n r0 = com.tencent.stat.common.e.a(r0);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r3 = new org.apache.http.entity.ByteArrayEntity; Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r3.<init> (r0);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r2.setEntity(r3);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r0 = r12.a;\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r2 = r0.execute(r2);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n if (r1 == 0)goto L_0x010f;\\n L_0x0103:\\n r0 = r12.a;\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r0 = r0.getParams();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r1 = \\\"http.route.default-proxy\\\";\\n r0.removeParameter(r1);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n L_0x010f:\\n r0 = r2.getEntity();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r1 = r2.getStatusLine();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r1 = r1.getStatusCode();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r6 = r0.getContentLength();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r3 = c;\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4 = new java.lang.StringBuilder; Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4.<init> (); Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r8 = \\\"recv response status code:\\\";\\n r4 = r4.append(r8);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4 = r4.append(r1);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r8 = \\\", content length:\\\";\\n r4 = r4.append(r8);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4 = r4.append(r6);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4 = r4.toString();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r3.i(r4);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r3 = (r6 > r10 ? 1 : (r6 == r10 ? 0 : -1));\\n if (r3 != 0)goto L_0x01f0;\\n L_0x0147:\\n org.apache.http.util.EntityUtils.toString(r0);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n if (r1 != r9)goto L_0x01d5;\\n L_0x014c:\\n if (r14 == 0)goto L_0x0151;\\n L_0x014e:\\n r14.a();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n L_0x0151:\\n r5.close();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n L_0x0154:\\n return;\\n L_0x0155:\\n r3 = \\\"X-Content-Encoding\\\";\\n r4 = \\\"rc4\\\";\\n r2.addHeader(r3, r4);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n goto L_0x00ef;\\n L_0x015f:\\n r0 = move - exception;\\n r1 = c;\\n Catch:\\n {\\n all -> 0x0172\\n }\\n r1.e(r0);\\n Catch:\\n {\\n all -> 0x0172\\n }\\n if (r14 == 0)goto L_0x0154;\\n L_0x0167:\\n r14.b();\\n Catch:\\n {\\n Throwable -> 0x016b\\n }\\n goto L_0x0154;\\n L_0x016b:\\n r0 = move - exception;\\n r1 = c;\\n Catch:\\n {\\n all -> 0x0172\\n }\\n r1.e(r0);\\n Catch:\\n {\\n all -> 0x0172\\n }\\n goto L_0x0154;\\n L_0x0172:\\n r0 = move - exception;\\n throw r0;\\n L_0x0174:\\n if (r4 != 0)goto L_0x01cb;\\n L_0x0176:\\n r3 = \\\"Content-Encoding\\\";\\n r4 = \\\"rc4,gzip\\\";\\n r2.addHeader(r3, r4);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n L_0x017f:\\n r3 = 4;\\n r3 = new byte[r3];\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r5.write(r3);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r3 = new java.util.zip.GZIPOutputStream; Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r3.<init> (r5);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r3.write(r0);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r3.close();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r0 = r5.toByteArray();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r3 = 0;\\n r4 = 4;\\n r3 = java.nio.ByteBuffer.wrap(r0, r3, r4);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r3.putInt(r6);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r3 = c;\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4 = new java.lang.StringBuilder; Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4.<init> (); Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r7 = \\\"before Gzip:\\\";\\n r4 = r4.append(r7);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4 = r4.append(r6);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r6 = \\\" bytes, after Gzip:\\\";\\n r4 = r4.append(r6);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r6 = r0.length;\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4 = r4.append(r6);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r6 = \\\" bytes\\\";\\n r4 = r4.append(r6);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4 = r4.toString();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r3.d(r4);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n goto L_0x00ef;\\n L_0x01cb:\\n r3 = \\\"X-Content-Encoding\\\";\\n r4 = \\\"rc4,gzip\\\";\\n r2.addHeader(r3, r4);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n goto L_0x017f;\\n L_0x01d5:\\n r0 = c;\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r2 = new java.lang.StringBuilder; Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r2.<init> (); Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r3 = \\\"Server response error code:\\\";\\n r2 = r2.append(r3);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r1 = r2.append(r1);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r1 = r1.toString();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r0.error(r1);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n goto L_0x0151;\\n L_0x01f0:\\n r3 = (r6 > r10 ? 1 : (r6 == r10 ? 0 : -1));\\n if (r3 <= 0)goto L_0x0345;\\n L_0x01f4:\\n r3 = r0.getContent();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4 = new java.io.DataInputStream; Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4.<init> (r3);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r6 = r0.getContentLength();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r0 = (int) r6;\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r0 = new byte[r0];\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4.readFully(r0);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r3.close();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4.close();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4 = \\\"Content-Encoding\\\";\\n r2 = r2.getFirstHeader(r4);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n if (r2 == 0)goto L_0x022b;\\n L_0x0216:\\n r4 = r2.getValue();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r6 = \\\"gzip,rc4\\\";\\n r4 = r4.equalsIgnoreCase(r6);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n if (r4 == 0)goto L_0x02b9;\\n L_0x0223:\\n r0 = com.tencent.stat.common.k.a(r0);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r0 = com.tencent.stat.common.e.b(r0);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n L_0x022b:\\n if (r1 != r9)goto L_0x0317;\\n L_0x022d:\\n r1 = new java.lang.String; Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r2 = \\\"UTF-8\\\";\\n r1.<init> (r0, r2);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r0 = c;\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r0.d(r1);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r0 = new org.json.JSONObject; Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r0.<init> (r1);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r2 = \\\"cfg\\\";\\n r2 = r0.isNull(r2);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n if (r2 != 0)goto L_0x0252;\\n L_0x0248:\\n r2 = \\\"cfg\\\";\\n r2 = r0.getJSONObject(r2);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n com.tencent.stat.StatConfig.a(r2);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n L_0x0252:\\n r2 = \\\"et\\\";\\n r2 = r0.isNull(r2);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n if (r2 != 0)goto L_0x02af;\\n L_0x025b:\\n r2 = \\\"st\\\";\\n r2 = r0.isNull(r2);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n if (r2 != 0)goto L_0x02af;\\n L_0x0264:\\n r2 = c;\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r4 = new java.lang.StringBuilder; Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r4.<init> (); Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r6 = \\\"get mid respone:\\\";\\n r4 = r4.append(r6);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r1 = r4.append(r1);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r1 = r1.toString();\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r2.d(r1);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r1 = \\\"et\\\";\\n r1 = r0.getInt(r1);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r2 = com.tencent.stat.a.f.SESSION_ENV;\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r2 = r2.a();\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n if (r1 != r2)goto L_0x02af;\\n L_0x028c:\\n r1 = \\\"st\\\";\\n r1 = r0.getInt(r1);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n switch (r1) {\\n case -1:goto L_0x02f6;\\n case 0:goto L_0x02f6;\\n default:goto L_0x0296;\\n } ;\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n L_0x0296:\\n r0 = c;\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r2 = new java.lang.StringBuilder; Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r2.<init> (); Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r4 = \\\"error type for st:\\\";\\n r2 = r2.append(r4);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r1 = r2.append(r1);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r1 = r1.toString();\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r0.e(r1);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n L_0x02af:\\n if (r14 == 0)goto L_0x02b4;\\n L_0x02b1:\\n r14.a();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n L_0x02b4:\\n r3.close();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n goto L_0x0151;\\n L_0x02b9:\\n r4 = r2.getValue();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r6 = \\\"rc4,gzip\\\";\\n r4 = r4.equalsIgnoreCase(r6);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n if (r4 == 0)goto L_0x02d0;\\n L_0x02c6:\\n r0 = com.tencent.stat.common.e.b(r0);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r0 = com.tencent.stat.common.k.a(r0);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n goto L_0x022b;\\n L_0x02d0:\\n r4 = r2.getValue();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r6 = \\\"gzip\\\";\\n r4 = r4.equalsIgnoreCase(r6);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n if (r4 == 0)goto L_0x02e3;\\n L_0x02dd:\\n r0 = com.tencent.stat.common.k.a(r0);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n goto L_0x022b;\\n L_0x02e3:\\n r2 = r2.getValue();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4 = \\\"rc4\\\";\\n r2 = r2.equalsIgnoreCase(r4);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n if (r2 == 0)goto L_0x022b;\\n L_0x02f0:\\n r0 = com.tencent.stat.common.e.b(r0);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n goto L_0x022b;\\n L_0x02f6:\\n r1 = \\\"mid\\\";\\n r1 = r0.isNull(r1);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n if (r1 != 0)goto L_0x02af;\\n L_0x02ff:\\n r1 = f;\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n r2 = \\\"mid\\\";\\n r0 = r0.getString(r2);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n com.tencent.stat.StatMid.updateDeviceInfo(r1, r0);\\n Catch:\\n {\\n Throwable -> 0x030c\\n }\\n goto L_0x02af;\\n L_0x030c:\\n r0 = move - exception;\\n r1 = c;\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r0 = r0.toString();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r1.i(r0);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n goto L_0x02af;\\n L_0x0317:\\n r2 = c;\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4 = new java.lang.StringBuilder; Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4.<init> (); Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r6 = \\\"Server response error code:\\\";\\n r4 = r4.append(r6);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r1 = r4.append(r1);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4 = \\\", error:\\\";\\n r1 = r1.append(r4);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r4 = new java.lang.String; Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r6 = \\\"UTF-8\\\";\\n r4.<init> (r0, r6);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r0 = r1.append(r4);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r0 = r0.toString();\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n r2.error(r0);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n goto L_0x02b4;\\n L_0x0345:\\n org.apache.http.util.EntityUtils.toString(r0);\\n Catch:\\n {\\n Throwable -> 0x015f\\n }\\n goto L_0x0151;\\n */\\n throw new UnsupportedOperationException(\\\"Method not decompiled: com.tencent.stat.d.a(java.util.List, com.tencent.stat.c):void\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"322e19fcfb5cfbd6ffce194d7e04df05\",\n \"score\": \"0.4926256\",\n \"text\": \"@Override\\n\\t\\t\\tprotected void reInitial() {\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e86f604c407a96c75671f663064c24b\",\n \"score\": \"0.4915773\",\n \"text\": \"public void mo8319b() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d01ba2fe96849dc20d68989ee58f8965\",\n \"score\": \"0.49073708\",\n \"text\": \"@Override\\n protected String part2(List<Section> input) {\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fdeab6ca2d3dd91b347a8cc2f5c862c2\",\n \"score\": \"0.49048692\",\n \"text\": \"private static void generateNew() {\\n\\t\\t\\t\\t\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f6e8d85aee157d478b1d171d149997d\",\n \"score\": \"0.49012372\",\n \"text\": \"public abstract void mo79652b();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"659269c4eedaf6bb7778212f5c6c1935\",\n \"score\": \"0.49005952\",\n \"text\": \"public void testCase2(){\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27e4479db2c37a2e77fe796119b66d4b\",\n \"score\": \"0.48991418\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void adelante() {\\n\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f21d040d8048da8dd5255d18bf39bb4\",\n \"score\": \"0.48973423\",\n \"text\": \"private void method_5396() {\\r\\n super();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77944bbe703b9d2a970f09c06a77af46\",\n \"score\": \"0.48955262\",\n \"text\": \"protected abstract void mo803f();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"406b5dab2afb5aa48e213ac396f8c8f9\",\n \"score\": \"0.4889628\",\n \"text\": \"@Override\\n\\tpublic void method7() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21d5639666b9f2f2f819e94da7c13d93\",\n \"score\": \"0.4884212\",\n \"text\": \"void mo4542Bl();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"504725f8f2b160fef096226a4ab47e7e\",\n \"score\": \"0.48831892\",\n \"text\": \"@Override\\n\\tpublic int methodName2() {\\n\\t\\treturn 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52f9cc13f25bd854aaf783d82fd69e2c\",\n \"score\": \"0.48822904\",\n \"text\": \"void mo1251s();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d2a7d9184ca339839cde05eebf1b3ba\",\n \"score\": \"0.48754656\",\n \"text\": \"public int c() {\\n /*\\n r11 = this;\\n java.util.List<com.bumptech.glide.load.ImageHeaderParser> r0 = r11.f2754b\\n i.b.a.n.l.m r1 = r11.c\\n i.b.a.n.m.b0.b r2 = r11.a\\n int r3 = r0.size()\\n r4 = 0\\n L_0x000b:\\n r5 = -1\\n if (r4 >= r3) goto L_0x0047\\n java.lang.Object r6 = r0.get(r4)\\n com.bumptech.glide.load.ImageHeaderParser r6 = (com.bumptech.glide.load.ImageHeaderParser) r6\\n r7 = 0\\n i.b.a.n.o.c.v r8 = new i.b.a.n.o.c.v // Catch:{ all -> 0x003d }\\n java.io.FileInputStream r9 = new java.io.FileInputStream // Catch:{ all -> 0x003d }\\n android.os.ParcelFileDescriptor r10 = r1.a() // Catch:{ all -> 0x003d }\\n java.io.FileDescriptor r10 = r10.getFileDescriptor() // Catch:{ all -> 0x003d }\\n r9.<init>(r10) // Catch:{ all -> 0x003d }\\n r8.<init>(r9, r2) // Catch:{ all -> 0x003d }\\n int r6 = r6.a(r8, r2) // Catch:{ all -> 0x003a }\\n r8.close() // Catch:{ IOException -> 0x002f }\\n goto L_0x0030\\n L_0x002f:\\n L_0x0030:\\n r1.a()\\n if (r6 == r5) goto L_0x0037\\n r5 = r6\\n goto L_0x0047\\n L_0x0037:\\n int r4 = r4 + 1\\n goto L_0x000b\\n L_0x003a:\\n r0 = move-exception\\n r7 = r8\\n goto L_0x003e\\n L_0x003d:\\n r0 = move-exception\\n L_0x003e:\\n if (r7 == 0) goto L_0x0043\\n r7.close() // Catch:{ IOException -> 0x0043 }\\n L_0x0043:\\n r1.a()\\n throw r0\\n L_0x0047:\\n return r5\\n */\\n throw new UnsupportedOperationException(\\\"Method not decompiled: i.b.a.n.o.c.r.b.c():int\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"22ac36b2371eb86809e09865575dc236\",\n \"score\": \"0.48682472\",\n \"text\": \"private static void m507b() {\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00bfdbbb49fd1d78d4eba12a819bdf12\",\n \"score\": \"0.48667806\",\n \"text\": \"private void apruebaComprobantes(){\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c33fa6c044c73bf206d5d491c250c22d\",\n \"score\": \"0.4865903\",\n \"text\": \"@Override\\n\\tpublic void fct2() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"94ac133de68050c6588c166a65b54c2b\",\n \"score\": \"0.48631182\",\n \"text\": \"public abstract Dashboard mo17132n2();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5bb37ed5e0a08c04cb9e970f3e334584\",\n \"score\": \"0.4853425\",\n \"text\": \"@Override\\n\\tpublic void accion() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e2ecbc9e846507a51c81ce152be79ae\",\n \"score\": \"0.48519832\",\n \"text\": \"@Override\\n\\tpublic void preProcess() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8043a68d1abb83fdef05a12947553545\",\n \"score\": \"0.48482463\",\n \"text\": \"public void fix() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0728cec909b7b5015afca013c229f93\",\n \"score\": \"0.48474842\",\n \"text\": \"final void m5994a(java.util.List r15, com.google.android.finsky.dfemodel.Document r16, android.accounts.Account r17, android.content.Intent r18) {\\n /*\\n r14 = this;\\n r2 = r14.f6211o;\\n r0 = r17;\\n r3 = r2.mo2811a(r0);\\n r2 = r14.f6218v;\\n r4 = r2.dn();\\n r2 = r14.f6212p;\\n r0 = r16;\\n r1 = r17;\\n r7 = r2.m11642a(r0, r1);\\n r2 = 0;\\n r5 = 0;\\n r0 = r16;\\n r6 = r0.f14885a;\\n r6 = r6.f12099f;\\n r8 = 3;\\n if (r6 != r8) goto L_0x029d;\\n L_0x0023:\\n r2 = r16.m14625N();\\n r2 = r2.f13171k;\\n r5 = r14.f6203g;\\n r5 = r5.m15626a(r2);\\n r9 = r2;\\n L_0x0030:\\n r2 = r14.f6212p;\\n r0 = r16;\\n r8 = r2.m11649a(r0, r4, r3);\\n r2 = 0;\\n r10 = r2;\\n L_0x003a:\\n r2 = r15.size();\\n if (r10 >= r2) goto L_0x029c;\\n L_0x0040:\\n r2 = r15.get(r10);\\n r2 = (java.lang.Integer) r2;\\n r11 = r2.intValue();\\n r2 = r14.f6211o;\\n r0 = r17;\\n r12 = r2.mo2811a(r0);\\n r2 = r14.f6218v;\\n r4 = r2.dn();\\n r2 = r14;\\n r3 = r16;\\n r6 = r17;\\n r2 = r2.m5996a(r3, r4, r5, r6, r7, r8);\\n if (r2 != 0) goto L_0x007c;\\n L_0x0063:\\n r2 = 1;\\n L_0x0064:\\n r3 = r14.f6212p;\\n r3 = r3.m11644a(r12);\\n r6 = r14.f6212p;\\n r0 = r16;\\n r6 = r6.m11654b(r0);\\n switch(r11) {\\n case 1: goto L_0x0268;\\n case 2: goto L_0x0213;\\n case 3: goto L_0x01a8;\\n case 4: goto L_0x01a0;\\n case 5: goto L_0x007e;\\n case 6: goto L_0x009c;\\n case 7: goto L_0x00ba;\\n case 8: goto L_0x00d8;\\n case 9: goto L_0x00ed;\\n case 10: goto L_0x010b;\\n case 11: goto L_0x0121;\\n case 12: goto L_0x01bf;\\n case 13: goto L_0x01b0;\\n case 14: goto L_0x012b;\\n case 15: goto L_0x013f;\\n case 16: goto L_0x0206;\\n case 17: goto L_0x0159;\\n case 18: goto L_0x017b;\\n case 19: goto L_0x0075;\\n case 20: goto L_0x01e2;\\n case 21: goto L_0x01ed;\\n case 22: goto L_0x0075;\\n case 23: goto L_0x0075;\\n case 24: goto L_0x0223;\\n case 25: goto L_0x00ab;\\n case 26: goto L_0x008d;\\n case 27: goto L_0x00c9;\\n default: goto L_0x0075;\\n };\\n L_0x0075:\\n r2 = 1;\\n L_0x0076:\\n if (r2 != 0) goto L_0x0297;\\n L_0x0078:\\n r15.remove(r10);\\n goto L_0x003a;\\n L_0x007c:\\n r2 = 0;\\n goto L_0x0064;\\n L_0x007e:\\n r2 = r14.m5995a();\\n if (r2 == 0) goto L_0x0086;\\n L_0x0084:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x0086:\\n r0 = r16;\\n r2 = r14.m5987a(r0, r3, r6);\\n goto L_0x0076;\\n L_0x008d:\\n r2 = r14.m5995a();\\n if (r2 != 0) goto L_0x0095;\\n L_0x0093:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x0095:\\n r0 = r16;\\n r2 = r14.m5987a(r0, r3, r6);\\n goto L_0x0076;\\n L_0x009c:\\n r2 = r14.m5995a();\\n if (r2 == 0) goto L_0x00a4;\\n L_0x00a2:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x00a4:\\n r0 = r16;\\n r2 = r14.m5990b(r0, r3, r6);\\n goto L_0x0076;\\n L_0x00ab:\\n r2 = r14.m5995a();\\n if (r2 != 0) goto L_0x00b3;\\n L_0x00b1:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x00b3:\\n r0 = r16;\\n r2 = r14.m5990b(r0, r3, r6);\\n goto L_0x0076;\\n L_0x00ba:\\n r4 = r14.m5995a();\\n if (r4 == 0) goto L_0x00c2;\\n L_0x00c0:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x00c2:\\n r0 = r16;\\n r2 = r14.m5988a(r0, r2, r3, r6);\\n goto L_0x0076;\\n L_0x00c9:\\n r4 = r14.m5995a();\\n if (r4 != 0) goto L_0x00d1;\\n L_0x00cf:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x00d1:\\n r0 = r16;\\n r2 = r14.m5988a(r0, r2, r3, r6);\\n goto L_0x0076;\\n L_0x00d8:\\n r0 = r16;\\n r2 = r0.f14885a;\\n r2 = r2.f12099f;\\n r3 = 3;\\n if (r2 != r3) goto L_0x00eb;\\n L_0x00e1:\\n r2 = r5.m15623b();\\n if (r2 == 0) goto L_0x00eb;\\n L_0x00e7:\\n r2 = r5.f15829q;\\n if (r2 == 0) goto L_0x0075;\\n L_0x00eb:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x00ed:\\n r0 = r16;\\n r2 = r0.f14885a;\\n r2 = r2.f12099f;\\n r3 = 3;\\n if (r2 != r3) goto L_0x0108;\\n L_0x00f6:\\n r2 = r5.m15623b();\\n if (r2 == 0) goto L_0x0100;\\n L_0x00fc:\\n r2 = r5.f15829q;\\n goto L_0x0076;\\n L_0x0100:\\n r2 = r5.f15824l;\\n if (r2 != 0) goto L_0x0108;\\n L_0x0104:\\n r2 = r5.f15829q;\\n if (r2 != 0) goto L_0x0075;\\n L_0x0108:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x010b:\\n r0 = r16;\\n r2 = r0.f14885a;\\n r2 = r2.f12099f;\\n r3 = 3;\\n if (r2 != r3) goto L_0x011e;\\n L_0x0114:\\n r2 = r5.m15623b();\\n if (r2 != 0) goto L_0x011e;\\n L_0x011a:\\n r2 = r5.f15824l;\\n if (r2 != 0) goto L_0x0075;\\n L_0x011e:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x0121:\\n r0 = r16;\\n r1 = r17;\\n r2 = r14.m5985a(r0, r1, r5, r4);\\n goto L_0x0076;\\n L_0x012b:\\n r0 = r16;\\n r2 = r0.f14885a;\\n r2 = r2.f12099f;\\n r3 = 3;\\n if (r2 != r3) goto L_0x013c;\\n L_0x0134:\\n r2 = r5.f15831s;\\n if (r2 == 0) goto L_0x013c;\\n L_0x0138:\\n r2 = r5.f15832t;\\n if (r2 != 0) goto L_0x0075;\\n L_0x013c:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x013f:\\n r0 = r16;\\n r2 = r0.f14885a;\\n r2 = r2.f12099f;\\n r3 = 3;\\n if (r2 != r3) goto L_0x0156;\\n L_0x0148:\\n r2 = r5.f15831s;\\n if (r2 != 0) goto L_0x0156;\\n L_0x014c:\\n r2 = r5.f15833u;\\n if (r2 == 0) goto L_0x0156;\\n L_0x0150:\\n r2 = r5.m15621a();\\n if (r2 != 0) goto L_0x0075;\\n L_0x0156:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x0159:\\n r0 = r16;\\n r2 = r0.f14885a;\\n r2 = r2.f12099f;\\n r3 = 3;\\n if (r2 != r3) goto L_0x0178;\\n L_0x0162:\\n r2 = r16.ae();\\n if (r2 == 0) goto L_0x0178;\\n L_0x0168:\\n r2 = r14.f6215s;\\n r0 = r16;\\n r3 = r0.f14885a;\\n r3 = r3.f12096c;\\n r0 = r17;\\n r2 = r2.m18640a(r3, r0);\\n if (r2 == 0) goto L_0x0075;\\n L_0x0178:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x017b:\\n r0 = r16;\\n r2 = r0.f14885a;\\n r2 = r2.f12099f;\\n r3 = 3;\\n if (r2 == r3) goto L_0x0187;\\n L_0x0184:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x0187:\\n r2 = r16.ae();\\n if (r2 != 0) goto L_0x0190;\\n L_0x018d:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x0190:\\n r2 = r14.f6215s;\\n r0 = r16;\\n r3 = r0.f14885a;\\n r3 = r3.f12096c;\\n r0 = r17;\\n r2 = r2.m18640a(r3, r0);\\n goto L_0x0076;\\n L_0x01a0:\\n r0 = r16;\\n r2 = r14.m5986a(r0, r9, r5, r4);\\n goto L_0x0076;\\n L_0x01a8:\\n r0 = r16;\\n r2 = r14.m5986a(r0, r9, r5, r4);\\n goto L_0x0076;\\n L_0x01b0:\\n if (r7 == 0) goto L_0x01bc;\\n L_0x01b2:\\n r2 = r14.f6212p;\\n r0 = r16;\\n r2 = r2.m11655c(r0, r12);\\n if (r2 != 0) goto L_0x0075;\\n L_0x01bc:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x01bf:\\n r0 = r16;\\n r2 = r0.f14885a;\\n r2 = r2.f12099f;\\n r3 = 3;\\n if (r2 != r3) goto L_0x01d3;\\n L_0x01c8:\\n r2 = r5.f15831s;\\n if (r2 == 0) goto L_0x01d0;\\n L_0x01cc:\\n r2 = r5.f15832t;\\n if (r2 == 0) goto L_0x0075;\\n L_0x01d0:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x01d3:\\n if (r7 == 0) goto L_0x01df;\\n L_0x01d5:\\n r2 = r14.f6212p;\\n r0 = r16;\\n r2 = r2.m11655c(r0, r12);\\n if (r2 == 0) goto L_0x0075;\\n L_0x01df:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x01e2:\\n r2 = r14;\\n r3 = r16;\\n r6 = r17;\\n r2 = r2.m5996a(r3, r4, r5, r6, r7, r8);\\n goto L_0x0076;\\n L_0x01ed:\\n if (r8 == 0) goto L_0x01f1;\\n L_0x01ef:\\n if (r7 == 0) goto L_0x01f4;\\n L_0x01f1:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x01f4:\\n r2 = 1;\\n r0 = r16;\\n r2 = r0.m14649e(r2);\\n if (r2 == 0) goto L_0x0203;\\n L_0x01fd:\\n r2 = r16.ab();\\n if (r2 != 0) goto L_0x0075;\\n L_0x0203:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x0206:\\n if (r7 != 0) goto L_0x0210;\\n L_0x0208:\\n if (r8 == 0) goto L_0x0210;\\n L_0x020a:\\n r2 = r16.ag();\\n if (r2 != 0) goto L_0x0075;\\n L_0x0210:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x0213:\\n r0 = r16;\\n r2 = r0.f14885a;\\n r2 = r2.f12099f;\\n r3 = 3;\\n if (r2 != r3) goto L_0x0220;\\n L_0x021c:\\n r2 = r5.f15820h;\\n if (r2 == 0) goto L_0x0075;\\n L_0x0220:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x0223:\\n r2 = r14.f6205i;\\n r2 = com.google.android.finsky.as.C1503a.m8831b(r2);\\n if (r2 == 0) goto L_0x0265;\\n L_0x022b:\\n r2 = r5.f15820h;\\n if (r2 == 0) goto L_0x0265;\\n L_0x022f:\\n r0 = r16;\\n r1 = r17;\\n r2 = r14.m5985a(r0, r1, r5, r4);\\n if (r2 != 0) goto L_0x0265;\\n L_0x0239:\\n r2 = r16.cf();\\n r3 = r14.f6205i;\\n r3 = com.google.android.finsky.as.C1503a.m8831b(r3);\\n if (r3 == 0) goto L_0x0265;\\n L_0x0245:\\n r3 = new android.content.Intent;\\n r4 = \\\"android.service.wallpaper.WallpaperService\\\";\\n r3.<init>(r4);\\n r4 = \\\"com.google.android.wearable.watchface.category.WATCH_FACE\\\";\\n r3 = r3.addCategory(r4);\\n r3.setPackage(r2);\\n r2 = r14.f6214r;\\n r4 = 128; // 0x80 float:1.794E-43 double:6.32E-322;\\n r2 = r2.queryIntentServices(r3, r4);\\n if (r2 == 0) goto L_0x0265;\\n L_0x025f:\\n r2 = r2.isEmpty();\\n if (r2 == 0) goto L_0x0075;\\n L_0x0265:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x0268:\\n r2 = r14;\\n r3 = r16;\\n r6 = r17;\\n r2 = r2.m5996a(r3, r4, r5, r6, r7, r8);\\n if (r2 == 0) goto L_0x0294;\\n L_0x0273:\\n if (r18 == 0) goto L_0x0294;\\n L_0x0275:\\n r2 = r14.f6214r;\\n r3 = 131072; // 0x20000 float:1.83671E-40 double:6.47582E-319;\\n r0 = r18;\\n r2 = r2.queryIntentActivities(r0, r3);\\n r2 = r2.isEmpty();\\n if (r2 != 0) goto L_0x0294;\\n L_0x0285:\\n r2 = r14.f6208l;\\n r2 = r2.dj();\\n r12 = 12636357; // 0xc0d0c5 float:1.7707308E-38 double:6.24319E-317;\\n r2 = r2.mo2294a(r12);\\n if (r2 != 0) goto L_0x0075;\\n L_0x0294:\\n r2 = 0;\\n goto L_0x0076;\\n L_0x0297:\\n r2 = r10 + 1;\\n r10 = r2;\\n goto L_0x003a;\\n L_0x029c:\\n return;\\n L_0x029d:\\n r9 = r2;\\n goto L_0x0030;\\n */\\n throw new UnsupportedOperationException(\\\"Method not decompiled: com.google.android.finsky.actionbuttons.j.a(java.util.List, com.google.android.finsky.dfemodel.Document, android.accounts.Account, android.content.Intent):void\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cbe3801e96200ff4ea06894c812b46b4\",\n \"score\": \"0.48469457\",\n \"text\": \"@SuppressWarnings(\\\"unused\\\")\\r\\n\\tprivate void search(){\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60818471355861aa7d560568e9a9631b\",\n \"score\": \"0.48453206\",\n \"text\": \"@Override\\n public void onCancelled(CancelledException cex) {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"670711ee90611c4f58910df06647dfe9\",\n \"score\": \"0.4843937\",\n \"text\": \"private static void m508c() {\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb65a57bcae1971078950998abb7090f\",\n \"score\": \"0.4843084\",\n \"text\": \"@Override\\n\\tpublic void potenciar() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"108c9cf8e9e48329bb26db01ed85c761\",\n \"score\": \"0.48361352\",\n \"text\": \"Referee getReferee2();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b63e14a9d9957e71e472129ec2bc2b6\",\n \"score\": \"0.4832338\",\n \"text\": \"private void m16448e() {\\n if (!TTLiveSDKContext.getHostService().mo22367h().mo22182c()) {\\n if (getActivity() == null) {\\n C9049ap.m27022a((int) R.string.ef8);\\n } else {\\n TTLiveSDKContext.getHostService().mo22367h().mo22167a(getActivity(), C8987h.m26865a().mo22189a(C3358ac.m12515a((int) R.string.f67)).mo22192c(\\\"comment_live\\\").mo22188a(1000).mo22190a()).mo19189a((C7498y<? super T>) new C8986g<Object>());\\n }\\n } else if (!TTLiveSDKContext.getHostService().mo22367h().mo22178a(LiveInteractFunction.COMMENT)) {\\n if (this.f14692f && TTLiveSDKContext.getHostService().mo22360a().isNeedProtectUnderage()) {\\n C9049ap.m27022a((int) R.string.f0i);\\n } else if (this.f14694h != null && this.f14689c.getText() != null) {\\n String obj = this.f14689c.getText().toString();\\n if (m16445b(obj)) {\\n this.f14694h.mo13257a(obj, this.f14692f);\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eca216eb4c1d55fd14efc3e6b562bc69\",\n \"score\": \"0.48321944\",\n \"text\": \"public com.duokan.reader.common.webservices.b a(java.util.List r13) {\\n /*\\n r12 = this;\\n r8 = 0;\\n r3 = new com.duokan.reader.common.webservices.getVisible;\\n r3.<creatCallTask>();\\n r3.getVisible = r8;\\n r0 = \\\"\\\";\\n r3.getScaledMaximumFlingVelocity = r0;\\n r4 = new java.util.HashMap;\\n r4.<creatCallTask>();\\n r3.setDrawable = r4;\\n r5 = new java.util.HashMap;\\n r5.<creatCallTask>();\\n r1 = r13.iterator();\\n L_0x001c:\\n r0 = r1.hasNext();\\n if (r0 == 0) goto L_0x0065;\\n L_0x0022:\\n r0 = r1.next();\\n r0 = (com.duokan.reader.domain.bookshelf.fo) r0;\\n r2 = new com.duokan.reader.domain.bookshelf.fs;\\n r2.<creatCallTask>();\\n r6 = r0.setDrawable;\\n r2.setDrawable = r6;\\n r6 = new java.util.ArrayList;\\n r6.<creatCallTask>();\\n r2.getVisible = r6;\\n r6 = 1;\\n r2.getScaledMaximumFlingVelocity = r6;\\n r6 = -1;\\n r2.getTriangleEdge = r6;\\n r6 = r0.setDrawable;\\n r6 = java.lang.Integer.valueOf(r6);\\n r4.put(r6, r2);\\n r2 = new com.duokan.reader.domain.bookshelf.fn;\\n r2.<creatCallTask>();\\n r6 = r0.setDrawable;\\n r2.setDrawable = r6;\\n r6 = r0.getVisible;\\n r2.getTriangleEdge = r6;\\n r2.getVisible = r8;\\n r6 = 100;\\n r2.getScaledMaximumFlingVelocity = r6;\\n r0 = r0.setDrawable;\\n r0 = java.lang.Integer.valueOf(r0);\\n r5.put(r0, r2);\\n goto L_0x001c;\\n L_0x0065:\\n r2 = new java.util.ArrayList;\\n r2.<creatCallTask>();\\n r6 = r13.iterator();\\n L_0x006e:\\n r0 = r6.hasNext();\\n if (r0 == 0) goto L_0x0098;\\n L_0x0074:\\n r0 = r6.next();\\n r0 = (com.duokan.reader.domain.bookshelf.fo) r0;\\n r1 = r0.setDrawable;\\n r1 = java.lang.Integer.valueOf(r1);\\n r1 = r4.getAllSortStackTraces(r1);\\n r1 = (com.duokan.reader.domain.bookshelf.fs) r1;\\n r1 = r1.getScaledMaximumFlingVelocity;\\n if (r1 == 0) goto L_0x006e;\\n L_0x008a:\\n r0 = r0.setDrawable;\\n r0 = java.lang.Integer.valueOf(r0);\\n r0 = r5.getAllSortStackTraces(r0);\\n r2.add(r0);\\n goto L_0x006e;\\n L_0x0098:\\n r0 = r2.isEmpty();\\n if (r0 == 0) goto L_0x009f;\\n L_0x009e:\\n return r3;\\n L_0x009f:\\n r6 = r12.getVisible(r2);\\n r0 = r6.getVisible;\\n if (r0 != 0) goto L_0x00f8;\\n L_0x00a7:\\n r0 = r6.setDrawable;\\n r0 = (java.util.HashMap) r0;\\n r0 = r0.keySet();\\n r7 = r0.iterator();\\n L_0x00b3:\\n r0 = r7.hasNext();\\n if (r0 == 0) goto L_0x0065;\\n L_0x00b9:\\n r0 = r7.next();\\n r0 = (java.lang.Integer) r0;\\n r1 = r6.setDrawable;\\n r1 = (java.util.HashMap) r1;\\n r1 = r1.getAllSortStackTraces(r0);\\n r1 = (com.duokan.reader.domain.bookshelf.fs) r1;\\n r2 = r4.getAllSortStackTraces(r0);\\n r2 = (com.duokan.reader.domain.bookshelf.fs) r2;\\n r8 = r1.getScaledMaximumFlingVelocity;\\n r2.getScaledMaximumFlingVelocity = r8;\\n r8 = r2.getTriangleEdge;\\n r10 = 0;\\n r8 = (r8 > r10 ? 1 : (r8 == r10 ? 0 : -1));\\n if (r8 >= 0) goto L_0x00df;\\n L_0x00db:\\n r8 = r1.getTriangleEdge;\\n r2.getTriangleEdge = r8;\\n L_0x00df:\\n r2 = r2.getVisible;\\n r8 = r1.getVisible;\\n r2.addAll(r8);\\n r0 = r5.getAllSortStackTraces(r0);\\n r0 = (com.duokan.reader.domain.bookshelf.fn) r0;\\n r2 = r0.getVisible;\\n r1 = r1.getVisible;\\n r1 = r1.size();\\n r1 = r1 + r2;\\n r0.getVisible = r1;\\n goto L_0x00b3;\\n L_0x00f8:\\n r0 = r6.getVisible;\\n r3.getVisible = r0;\\n r0 = r6.getScaledMaximumFlingVelocity;\\n r3.getScaledMaximumFlingVelocity = r0;\\n r0 = r3.setDrawable;\\n r0 = (java.util.HashMap) r0;\\n r0.addFirst();\\n goto L_0x009e;\\n */\\n throw new UnsupportedOperationException(\\\"Method not decompiled: com.duokan.reader.domain.bookshelf.fj.setDrawable(java.util.List):com.duokan.reader.common.webservices.getVisible\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b97e1efee35d53ca15bf9bf5766e1dd0\",\n \"score\": \"0.48320246\",\n \"text\": \"protected abstract void verabschieden();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7dfeef61ec9b131e6c0c21423e50fbbb\",\n \"score\": \"0.4826969\",\n \"text\": \"public void mo16243a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2cc97f340071c93ab12395f2981731ee\",\n \"score\": \"0.4825187\",\n \"text\": \"public void mo25307b() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86873ab379d889d031cbc486bf7ee4a4\",\n \"score\": \"0.48242715\",\n \"text\": \"private void cierrecontable(){\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e75ffe6faa994ed57c6ffb8b56296fe\",\n \"score\": \"0.4822927\",\n \"text\": \"public void xiuproof() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2fb65318d0ced2c103f6b86a288a8827\",\n \"score\": \"0.4821642\",\n \"text\": \"public void mo3742aL() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff7c945a44d012c17376c32167ee2567\",\n \"score\": \"0.4814693\",\n \"text\": \"@Override\\n public void sharedMethodOne() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fda5f4d0f9bad626ee716c0e53a58f78\",\n \"score\": \"0.48082373\",\n \"text\": \"private static void add() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0fa70559e20e4f8deeda0f703ffa4be3\",\n \"score\": \"0.48074028\",\n \"text\": \"@Override\\r\\n\\tpublic void calculate2() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d0a2c01962098af4f86405c89f81bac\",\n \"score\": \"0.48049253\",\n \"text\": \"abstract protected String getParameters();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b901583faeb614d4d67271470c31d36c\",\n \"score\": \"0.4804766\",\n \"text\": \"@Override\\n\\tpublic void sare() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8efca113e51c9b46e2ef52301dd40d5f\",\n \"score\": \"0.48047516\",\n \"text\": \"private Extra() {\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dd266490e61a4deaa2399683b39c8b9\",\n \"score\": \"0.4804112\",\n \"text\": \"public final void mo65289a(java.util.List<? extends com.p280ss.android.ugc.aweme.feed.model.Aweme> r9) {\\n /*\\n r8 = this;\\n boolean r0 = m81983a()\\n if (r0 == 0) goto L_0x0007\\n return\\n L_0x0007:\\n if (r9 == 0) goto L_0x00b0\\n java.lang.Iterable r9 = (java.lang.Iterable) r9\\n java.util.ArrayList r0 = new java.util.ArrayList\\n r0.<init>()\\n java.util.Collection r0 = (java.util.Collection) r0\\n java.util.Iterator r9 = r9.iterator()\\n L_0x0016:\\n boolean r1 = r9.hasNext()\\n if (r1 == 0) goto L_0x005b\\n java.lang.Object r1 = r9.next()\\n r2 = r1\\n com.ss.android.ugc.aweme.feed.model.Aweme r2 = (com.p280ss.android.ugc.aweme.feed.model.Aweme) r2\\n com.ss.android.ugc.aweme.feed.model.ItemLikeEggData r2 = r2.getCommerceAdLikeDigg()\\n r3 = 1\\n r4 = 0\\n if (r2 == 0) goto L_0x0054\\n java.lang.String r5 = r2.getFileType()\\n java.lang.CharSequence r5 = (java.lang.CharSequence) r5\\n if (r5 == 0) goto L_0x003c\\n int r5 = r5.length()\\n if (r5 != 0) goto L_0x003a\\n goto L_0x003c\\n L_0x003a:\\n r5 = 0\\n goto L_0x003d\\n L_0x003c:\\n r5 = 1\\n L_0x003d:\\n if (r5 != 0) goto L_0x0054\\n java.lang.String r2 = r2.getMaterialUrl()\\n java.lang.CharSequence r2 = (java.lang.CharSequence) r2\\n if (r2 == 0) goto L_0x0050\\n int r2 = r2.length()\\n if (r2 != 0) goto L_0x004e\\n goto L_0x0050\\n L_0x004e:\\n r2 = 0\\n goto L_0x0051\\n L_0x0050:\\n r2 = 1\\n L_0x0051:\\n if (r2 != 0) goto L_0x0054\\n goto L_0x0055\\n L_0x0054:\\n r3 = 0\\n L_0x0055:\\n if (r3 == 0) goto L_0x0016\\n r0.add(r1)\\n goto L_0x0016\\n L_0x005b:\\n java.util.List r0 = (java.util.List) r0\\n java.lang.Iterable r0 = (java.lang.Iterable) r0\\n java.util.Iterator r9 = r0.iterator()\\n L_0x0063:\\n boolean r0 = r9.hasNext()\\n if (r0 == 0) goto L_0x00af\\n java.lang.Object r0 = r9.next()\\n com.ss.android.ugc.aweme.feed.model.Aweme r0 = (com.p280ss.android.ugc.aweme.feed.model.Aweme) r0\\n com.ss.android.ugc.aweme.commercialize.log.b r7 = new com.ss.android.ugc.aweme.commercialize.log.b\\n java.lang.String r2 = \\\"egg\\\"\\n java.lang.String r3 = \\\"data_received\\\"\\n r4 = 0\\n r5 = 4\\n r6 = 0\\n r1 = r7\\n r1.<init>(r2, r3, r4, r5, r6)\\n java.lang.String r1 = r0.getAid()\\n com.ss.android.ugc.aweme.commercialize.log.b r1 = r7.mo65230a(r1)\\n com.ss.android.ugc.aweme.feed.model.AwemeRawAd r2 = r0.getAwemeRawAd()\\n r3 = 0\\n if (r2 == 0) goto L_0x0090\\n java.lang.String r2 = r2.getCreativeIdStr()\\n goto L_0x0091\\n L_0x0090:\\n r2 = r3\\n L_0x0091:\\n com.ss.android.ugc.aweme.commercialize.log.b r1 = r1.mo65232b(r2)\\n com.ss.android.ugc.aweme.feed.model.AwemeRawAd r0 = r0.getAwemeRawAd()\\n if (r0 == 0) goto L_0x009f\\n java.lang.String r3 = r0.getLogExtra()\\n L_0x009f:\\n com.ss.android.ugc.aweme.commercialize.log.b r0 = r1.mo65233c(r3)\\n java.lang.String r1 = \\\"like\\\"\\n com.ss.android.ugc.aweme.commercialize.log.b r0 = r0.mo65235e(r1)\\n com.ss.android.ugc.aweme.commercialize.log.c r1 = com.p280ss.android.ugc.aweme.commercialize.log.C24952c.f65801b\\n r1.mo65237a(r0)\\n goto L_0x0063\\n L_0x00af:\\n return\\n L_0x00b0:\\n return\\n */\\n throw new UnsupportedOperationException(\\\"Method not decompiled: com.p280ss.android.ugc.aweme.commercialize.log.C24972q.mo65289a(java.util.List):void\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1283662453dd2aabe5dd94937e3e22f5\",\n \"score\": \"0.47963968\",\n \"text\": \"private void utworzAkcje() {\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985495,"cells":{"query_id":{"kind":"string","value":"14cdb4c505ba639d4a86fa9822aa538d"},"query":{"kind":"string","value":"Returns the (i)th cursor of the given type, or null if no such cursor exists. Can be used for retrieving both cursors of type TYPE_DRAGGING, for example, by calling getCursorByType( MyCursor.TYPE_DRAGGING, 0 ) and getCursorByType( MyCursor.TYPE_DRAGGING, 1 ), when there may be cursors of other type present at the same time."},"positive_passages":{"kind":"list like","value":[{"docid":"87b192a94c5a8f31e762dbb8acebf614","score":"0.83834666","text":"public MyCursor getCursorByType(int type, int i) {\n for (int ii = 0; ii < cursors.size(); ++ii) {\n if (cursors.get(ii).getType() == type) {\n if (i == 0)\n return cursors.get(ii);\n else\n i--;\n }\n }\n return null;\n }","title":""}],"string":"[\n {\n \"docid\": \"87b192a94c5a8f31e762dbb8acebf614\",\n \"score\": \"0.83834666\",\n \"text\": \"public MyCursor getCursorByType(int type, int i) {\\n for (int ii = 0; ii < cursors.size(); ++ii) {\\n if (cursors.get(ii).getType() == type) {\\n if (i == 0)\\n return cursors.get(ii);\\n else\\n i--;\\n }\\n }\\n return null;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"fa41e11326a60d1f176e37b11ee973ca","score":"0.5802969","text":"private Cursor findCursor() {\n\t\tfor(Measure measure:getMeasures()) {\n\t\t\tfor(Voice voice:measure.getVoices()) {\n\t\t\t\tfor(VoiceItem item:voice.getItems()) {\n\t\t\t\t\tif(item instanceof Cursor) {\n\t\t\t\t\t\treturn (Cursor) item;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn null;\n\t}","title":""},{"docid":"e56889a965ff53e12c81ae61af1b1c8a","score":"0.57353115","text":"public int getNumCursorsOfGivenType(int type) {\n int num = 0;\n for (int i = 0; i < cursors.size(); ++i) {\n if (cursors.get(i).getType() == type)\n num++;\n }\n return num;\n }","title":""},{"docid":"29f29ba735a2acc200651529dd5e5b16","score":"0.5513747","text":"@NotNull\r\n public MapCursor getCursor(int index) {\r\n return cursors.get(index);\r\n }","title":""},{"docid":"1cf6b9ecd3d48679e4b84081253f3e1d","score":"0.54444677","text":"public Object getObject(int columnIndex, Class type) throws SQLException {\n\treturn null;\n}","title":""},{"docid":"5becadaed39e18bcf949a99cf0407640","score":"0.5415621","text":"private static String getCursorMethodName(String typeName) {\n if (typeName.equals(\"String\")) {\n return \"getString\";\n } else if (typeName.equals(\"Long\")) {\n return \"getLong\";\n } else if (typeName.equals(\"Integer\")) {\n return \"getInt\";\n } else if (typeName.equals(\"Float\")) {\n return \"getFloat\";\n } else if (typeName.equals(\"Double\")) {\n return \"getDouble\";\n } else {\n return null;\n }\n }","title":""},{"docid":"19cf1611cf9cdfa440ec04a217deec10","score":"0.52079403","text":"public static Cursor getCursor(String name, Class clazz) {\n return getCursor(name, clazz, 0, 0);\n }","title":""},{"docid":"37c950bfa7d0983600a6304735dd6174","score":"0.50922483","text":"public String getCursor();","title":""},{"docid":"9f23a7a74bd6b53aa0ed0373c9ce7368","score":"0.5038076","text":"public Customer topCustomer(String type)\r\n {\r\n if (type != null) {\r\n Iterator<Customer> custIter = customers.iterator();\r\n while (custIter.hasNext()) {\r\n Customer c = custIter.next();\r\n String t = c.getType();\r\n if (type.equals(t))\r\n {\r\n return c; \r\n }\r\n }\r\n }\r\n return null;\r\n }","title":""},{"docid":"e8f672b35d976dc47522ebb9460606de","score":"0.500506","text":"public static Cursor getCursor(URL url, int x, int y)\n {\n Cursor cursor = (url!=null) ? (Cursor) cursorCache.get(url) : null;\n if (cursor == null)\n {\n Toolkit toolkit = Toolkit.getDefaultToolkit();\n Image image = getImage(url);\n if (image == brokenImage) cursor = brokenCursor;\n else cursor = toolkit.createCustomCursor(image, new Point(x, y), url.getFile());\n if (url != null) cursorCache.put(url, cursor);\n }\n return cursor;\n }","title":""},{"docid":"ebb4a10ef6cd62d431cdd0d2fff39086","score":"0.49839923","text":"public ReaderType getObjectByID(int rdType) {\n\t\ttry\n\t\t{\n\t\t\treturn (ReaderType) dal.getObjectByID(rdType);\n\t\t}\n\t\tcatch(Exception e)\n\t\t{\n\t\t\te.printStackTrace();\n\t\t}\n\t\treturn null;\n\t}","title":""},{"docid":"b10b86932eae6951d366f56ff14c6fac","score":"0.49523625","text":"public static Cursor getBestCursor(String name, Class clazz, int width, int height, int x, int y) {\n Toolkit toolkit = Toolkit.getDefaultToolkit();\n Dimension dimension = toolkit.getBestCursorSize(width, height);\n if ((dimension.width == 0) && (dimension.height == 0)) return Cursor.getDefaultCursor();\n name = name.replaceAll(\"%w\", Integer.toString(dimension.width));\n name = name.replaceAll(\"%h\", Integer.toString(dimension.height));\n return getCursor(name, clazz, x, y);\n }","title":""},{"docid":"0efe00ca1b6c70d2b98e4e2c9a2786e5","score":"0.48956785","text":"String getCursorName();","title":""},{"docid":"b34256ea9dab4ef696fe62b65c6d82ff","score":"0.48635316","text":"public static Cursor getBestCursor(String name, Class clazz, int width, int height) {\n return getBestCursor(name, clazz, width, height, 0, 0);\n }","title":""},{"docid":"1eca8eb4a29e34fcb7aac74763f6e9fb","score":"0.48390764","text":"@SuppressWarnings(\"unchecked\")\n public <T> T getObject(int columnIndex, Class<T> type) throws SQLException {\n return (T) super.getObject(columnIndex);\n }","title":""},{"docid":"b76eac0c4ec804875cfe46e2803084f3","score":"0.48301736","text":"CursorProvider getCursorProvider();","title":""},{"docid":"01ea2b705402f257032427d07cdf88b9","score":"0.4815585","text":"public static Cursor getCursor(String name, Class clazz, int x, int y)\n {\n if (name.indexOf('.') >= 0) return getCursor(clazz.getResource(name), x, y);\n\n for (int i=0; i<imageExtensions.length; i++)\n {\n URL url = clazz.getResource(name+imageExtensions[i]);\n if (url != null) return getCursor(url, x, y);\n }\n return brokenCursor;\n }","title":""},{"docid":"ff549715fd7cf1b08292eff78d58960d","score":"0.47563767","text":"public static Cursor getCursor(URL url) {\n return getCursor(url, 0, 0);\n }","title":""},{"docid":"26e3f5807421bc5f04b5785b833b178b","score":"0.4755185","text":"public Cursor getCursor()\n {\n return this.cursor;\n }","title":""},{"docid":"9a23d808aa7d73bdf45f0ccbe5f80f70","score":"0.47541812","text":"public int crd(int type) {\n return table[index(type)][2];\n }","title":""},{"docid":"e8604ddba82b2ba50cf0d78867777f6a","score":"0.47524646","text":"public Cursor getCursor() {\n return cursor;\n }","title":""},{"docid":"87a04b6651f98a3b3baa78d5c6089726","score":"0.47522342","text":"Cursor getRealCursor() {\r\n Component cursorAncestor = getCursorAncestor();\r\n return cursorAncestor != null ? cursorAncestor.getCursor() : Cursor.getDefaultCursor();\r\n }","title":""},{"docid":"2a1a38cf3047f74963af3604d1adaed5","score":"0.47488248","text":"OptionalInt getOrdinal(Class<?> type);","title":""},{"docid":"2d1aeb71eeae359ae2ba8efbc1cd518b","score":"0.47233418","text":"private Cursor getDragCursor(int action) {\r\n\r\n\t\tCursor cursor;\r\n\r\n\t\tswitch (action) {\r\n\r\n\t\tcase DnDConstants.ACTION_COPY:\r\n\t\t\tcursor = DragSource.DefaultCopyDrop;\r\n\t\t\tbreak;\r\n\t\tcase DnDConstants.ACTION_MOVE:\r\n\t\t\tcursor = DragSource.DefaultMoveDrop;\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tcursor = DragSource.DefaultMoveDrop;\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\treturn cursor;\r\n\t}","title":""},{"docid":"e627d08046bb4d3774943f293ddd4add","score":"0.47147486","text":"public int getCursor() {\n\t\treturn cursor;\n\t}","title":""},{"docid":"abb894689487240a84c087c59fb47533","score":"0.46993414","text":"public Cursor getCurrentCursor()\n\t{\n\t\treturn container.getCursor();\n\t}","title":""},{"docid":"faf906bfd1911a8a70e8437bdffbf0fb","score":"0.46908918","text":"public Cursor getCategoryCursor() {\n return daoSession.getCategoryDao().queryBuilder().buildCursor().query();\n }","title":""},{"docid":"9d07e381fdc378608b0d88715dff0b54","score":"0.46859702","text":"public static <TT> TT getComponentOfType(Container c, Class<TT> type) {\n if (c == null) {\n return null;\n }\n if (type == null) {\n return null;\n }\n // TODO -- MOVE TO A DIFFERENT UTILS CLASS!\n int depth = 0;\n while (true) {\n Pair<Boolean, TT> p = getComponentOfType(c, type, 0, depth++, null);\n if (p == null) {\n return null;\n }\n if (!p.first) {\n return null;\n }\n TT tt = p.second;\n if (tt != null) {\n return tt;\n }\n }\n }","title":""},{"docid":"031489e5e31680c71f72546768421f40","score":"0.4682945","text":"private Cursor findOrCreateCursor() {\n\t\tCursor cursor = findCursor();\n\t\t\n\t\tif(cursor != null) {\n\t\t\treturn cursor;\n\t\t}\n\t\t\n\t\tMeasure measure = getMeasures().get(0);\n\t\tVoice voice = measure.getVoices().get(0);\n\t\n\t\tcursor = new Cursor(measure, voice);\n\t\tvoice.insertItem(cursor, 0);\n\t\t\n\t\treturn cursor;\n\t}","title":""},{"docid":"eae8df3fb48fab4e84b85b7faa58a303","score":"0.4665815","text":"public GrammarAST findFirstType(int ttype) {\n\t\tif ( this.getType()==ttype ) {\n\t\t\treturn this;\n\t\t}\n\t\t// else check children\n\t\tList<Tree> descendants = descendants(this);\n\t\tfor (Tree child : descendants) {\n\t\t\tif ( child.getType()==ttype ) {\n\t\t\t\treturn (GrammarAST)child;\n\t\t\t}\n\t\t}\n\t\treturn null;\n\t}","title":""},{"docid":"e1cbf391bc8f1ba544c0f6cd0b5dd0cf","score":"0.46570227","text":"public <T> T get(final Class<T> type) {\r\n\t\treturn this.getCurrentCDI().select(type).get();\r\n\t}","title":""},{"docid":"7094377cd817e72d71d26b89bf20f3c9","score":"0.4655209","text":"protected abstract Cursor getCursor(Connection connection);","title":""},{"docid":"e28d5326b064e3df866a57f09e7faced","score":"0.46255788","text":"int getTypeIndex(String type);","title":""},{"docid":"46081f4ac70be5c089bdd4c59dbb4e45","score":"0.46149912","text":"public RobotInfo findInView(RobotType type)\n\t{\n\t\tfor(int i = 0; i < alliesInView.length; i++)\n\t\t{\n\t\t\tif(alliesInView[i].getType() == type)\n\t\t\t\treturn alliesInView[i];\n\t\t}\n\t\treturn null;\n\t}","title":""},{"docid":"22226d6337807ba9a2b202d92c1a0902","score":"0.45868325","text":"public Cursor getCursor() throws SQLException {\n Cursor c = db.query(true, N_TABLA, columnas, null, null, null, null, null, null);\n return c;\n }","title":""},{"docid":"67427e8a1852e81caf38d2448f42ca20","score":"0.4585797","text":"PlaceType createPlaceTypeFromCursor(Cursor cursor) {\r\n int id = cursor.getInt(0);\r\n return new PlaceType(id, cursor.getString(1), cursor.getString(2));\r\n }","title":""},{"docid":"275234f2b34c0b2c3c4ea0e26d25d9c6","score":"0.4571737","text":"int xlateRSType(int type) throws SQLException {\n\n SQLWarning w;\n String msg;\n\n switch (type) {\n\n case JDBCResultSet.TYPE_FORWARD_ONLY :\n case JDBCResultSet.TYPE_SCROLL_INSENSITIVE : {\n return type;\n }\n case JDBCResultSet.TYPE_SCROLL_SENSITIVE : {\n msg = \"TYPE_SCROLL_SENSITIVE => TYPE_SCROLL_SENSITIVE\";\n w = new SQLWarning(msg, \"SOO10\",\n ErrorCode.JDBC_INVALID_ARGUMENT);\n\n addWarning(w);\n\n return JDBCResultSet.TYPE_SCROLL_INSENSITIVE;\n }\n default : {\n msg = \"ResultSet type: \" + type;\n\n throw Util.invalidArgument(msg);\n }\n }\n }","title":""},{"docid":"ebca4a941d4e83ec2930b6d13f7656ff","score":"0.4570164","text":"public static Soldier getNearestOfType(Soldier source, int type) {\n\t\tif (type == 0)\n\t\t\treturn getNearestOfType(source, GameSession.getInstance().soldiers);\n\t\telse\n\t\t\treturn null;\n\t}","title":""},{"docid":"574a939c9236b4aa34d6fb13fa5ef946","score":"0.45560598","text":"public TypeId getIdOfType(Type type) {\n switch (type.getSort()) {\n case Type.ARRAY:\n return getIdOfType(type.getElementType());\n case Type.OBJECT:\n return getIdOfType(type.getInternalName());\n default:\n return null;\n }\n }","title":""},{"docid":"2849e82df1534d5727cd9d638cabfea5","score":"0.45425647","text":"public static <T> T getById(Class<T> type, Integer id) {\n Session session = null;\n Transaction tx = null;\n List<T> list = null;\n try {\n session = Db.getInstance().createSession();\n tx = session.beginTransaction();\n Query query = session.createQuery(\"from \" + type.getName() +\n \" where id = :id\");\n query.setParameter(\"id\", id);\n list = query.list();\n tx.commit();\n } catch(HibernateException ex) {\n // TODO add logging statements\n tx.rollback();\n return null;\n } finally {\n if(session != null) { session.close(); }\n }\n return (list.size() > 0 ? list.get(0) : null);\n }","title":""},{"docid":"4428799dbc22ba6b990350b0cd979aab","score":"0.45087302","text":"public <T> ArrayList<T> queryColumn(Class<T> type, String query, int column) {\n ArrayList<T> results = new ArrayList<T>();\n Cursor cursor = null;\n \n try {\n cursor = mDatabase.rawQuery(query, null);\n String methodName = getCursorMethodName(type.getSimpleName());\n while (cursor.moveToNext()) {\n // The magical line. Almost as illegible as python code ;)\n results.add(type.cast(Cursor.class.getMethod(methodName, int.class).invoke(cursor, column)));\n }\n } catch (NoSuchMethodException e) {\n // This is really coding error, so it should be revealed if it ever happens\n throw new RuntimeException(e);\n } catch (IllegalArgumentException e) {\n // This is really coding error, so it should be revealed if it ever happens\n throw new RuntimeException(e);\n } catch (IllegalAccessException e) {\n // This is really coding error, so it should be revealed if it ever happens\n throw new RuntimeException(e);\n } catch (InvocationTargetException e) {\n throw new RuntimeException(e);\n } finally {\n if (cursor != null) {\n cursor.close();\n }\n }\n \n return results;\n }","title":""},{"docid":"efc259dc1e67fb70f02f1206e16175e1","score":"0.45032144","text":"public static CreationType getByTypeNum(int typeNum) {\n\t\t\tfor(CreationType ct : CreationType.values()) {\n\t\t\t\tif(ct.getTypeNum() == typeNum) {\n\t\t\t\t\treturn ct;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn null;\n\t\t}","title":""},{"docid":"578778c462e0237a57994a7fb994c374","score":"0.45008594","text":"public static RefType get(byte type) {\n\t\tRefType rt = REFTYPE_LOOKUP_BY_TYPE_MAP.get(type);\n\t\tif (rt == null) {\n\t\t\tthrow new NoSuchElementException(\"RefType not defined: \" + type);\n\t\t}\n\t\treturn rt;\n\t}","title":""},{"docid":"9b328d6aa50b5c8f0c8c4d7e6e24039d","score":"0.44989988","text":"public Object getControl(String type) {\n return null;\n }","title":""},{"docid":"9c4a56059f869fc4418b0795798115be","score":"0.44912055","text":"public int getShellIndex(char type, ShellName name) {\n\t\tint index;\n\t\t\n\t\t// First try some special names needed to make branches.\n\t\tif(name == ShellName.SURFACE) {\n\t\t\treturn shellSize(type)-1;\n\t\t} else if(name == ShellName.MANTLE_BOTTOM) {\n\t\t\tindex = getShell(type, ShellName.CORE_MANTLE_BOUNDARY);\n\t\t\tif(index < 0) {\n\t\t\t\tindex = getShell(type, ShellName.OUTER_CORE);\n\t\t\t}\n\t\t\treturn index;\n\t\t} else if(name == ShellName.CORE_TOP) {\n\t\t\treturn getShell(type, ShellName.OUTER_CORE);\n\t\t} else {\n\t\t\t// If that fails, just try the name.\n\t\t\treturn getShell(type, name);\n\t\t}\n\t}","title":""},{"docid":"0928f405cd9faf1e11bc3cb6c1bf3912","score":"0.44790086","text":"public int getType()\r\n {\r\n return m_type;\r\n }","title":""},{"docid":"f9608bdbf30f95f24604e8fe6311053a","score":"0.44666484","text":"public Entity findNearestEntity(Class<? extends Entity> type) {\n List<Entity> entities = findEntitiesOfType(type);\n\n if (entities.isEmpty()) {\n return null;\n }\n\n Collections.shuffle(entities);\n Collections.sort(entities, new CoordinateComparator<Entity>(owner.getPosition()));\n\n return entities.get(0);\n }","title":""},{"docid":"bee1441ed76d74765bcf43a7992f769f","score":"0.44633418","text":"@Deprecated\r\n @NotNull\r\n public MapCursor addCursor(int x, int y, byte direction, byte type) {\r\n return addCursor(x, y, direction, type, true);\r\n }","title":""},{"docid":"acf2892d366cc850c5b02ce1b2e323bc","score":"0.44323865","text":"public Cursor getCurrentCursor()\n\t{\n\t\treturn currentCursor;\n\t}","title":""},{"docid":"c4a4ef6b8f9d3a8ae9163f9c961624c1","score":"0.44168457","text":"public int cell(final CellType type) {\n return this.cells(1, type);\n }","title":""},{"docid":"4724a24c621a662eb0838dc5159191fd","score":"0.4407104","text":"public static ObjectInfo queryByName(int type, String name)\n {\n \tObjectInfo info = null;\n \tswitch(type)\n \t{\n \t\tcase NED:\n \t\tdefault:\n \t\t\tinfo = queryNEDByName(name);\n \t\t\tbreak;\n \t\tcase SDSSDR7:\n \t\tcase SDSSDR8:\n \t\tcase SDSSDR9:\n \t\tcase SDSSDR17:\n \t\t\tinfo = querySDSSByName(type, name);\n \t\tbreak;\n \t}\n \treturn info;\n }","title":""},{"docid":"9036a8c0873fd11290d90fb5a404c3b6","score":"0.44022447","text":"public Cursor getCursor() throws SQLException\n {\n Cursor cPeliculas = db.query( true, C_TABLA, columnas, null, null, null, null, null, null);\n\n return cPeliculas;\n }","title":""},{"docid":"bdd3246bb4e9f05b5e476de41d04ce75","score":"0.4398734","text":"Tbtype selectByPrimaryKey(Integer typeid);","title":""},{"docid":"20ae0555f1c6ddc70321ff935448ea03","score":"0.43844038","text":"public Object getObject(String columnLabel, Class type) throws SQLException {\n\treturn null;\n}","title":""},{"docid":"7d395c54e7ce49b48ad51f7999534707","score":"0.43609494","text":"@Override\n\tpublic String getCursorName() throws SQLException {\n\t\treturn null;\n\t}","title":""},{"docid":"6475cacf5cd0abc4c034d1600bf04163","score":"0.43561563","text":"private int index(int type) {\n return com.actelion.research.chem.forcefield.mmff.Search.binary(0, type, this);\n }","title":""},{"docid":"f430c70573b2fe338f55a9b8a9749045","score":"0.4352168","text":"int indexOfType(String type);","title":""},{"docid":"49dbf55c01cbab7c8b9a85fefa8c8a09","score":"0.4339013","text":"public Node getByType(String type)\n {\n Node node;\n for (Iterator<Node> it = this.children.iterator(); it.hasNext();) {\n node = it.next();\n if(node.type.equals(type)){\n return node;\n }\n }\n return null;\n }","title":""},{"docid":"9c7189a7396f0836f074b33af267a488","score":"0.4332771","text":"public static final JdbcType get(int order) {\n return map.get(order);\n }","title":""},{"docid":"e65beb49ea6ab893b61a38ef8e2bb2ef","score":"0.43316752","text":"public int getType() {\n return type_;\n }","title":""},{"docid":"e65beb49ea6ab893b61a38ef8e2bb2ef","score":"0.43316752","text":"public int getType() {\n return type_;\n }","title":""},{"docid":"e65beb49ea6ab893b61a38ef8e2bb2ef","score":"0.43316752","text":"public int getType() {\n return type_;\n }","title":""},{"docid":"e65beb49ea6ab893b61a38ef8e2bb2ef","score":"0.43316752","text":"public int getType() {\n return type_;\n }","title":""},{"docid":"e65beb49ea6ab893b61a38ef8e2bb2ef","score":"0.4331087","text":"public int getType() {\n return type_;\n }","title":""},{"docid":"e65beb49ea6ab893b61a38ef8e2bb2ef","score":"0.4331087","text":"public int getType() {\n return type_;\n }","title":""},{"docid":"e05a47f37e17f5102b9c0bb5dd8da830","score":"0.43259892","text":"public Long getCategoryIdAtCursor(Cursor cursor, int position) {\n Category category = daoSession.getCategoryDao().readEntity(cursor, 0);\n return category == null ? NOT_FOUND : category.getId();\n }","title":""},{"docid":"ecfa8a1c7c078cd621e2c86460282545","score":"0.432408","text":"@Override\n public CommunityType readByType(String type) throws SQLException {\n Connection connection \n = DBCP.getInstance().getConnection(); // new connection\n \n /* prepared statement for select from community_types table by key */\n PreparedStatement read \n = connection.prepareStatement(\"SELECT * FROM community_types \"\n + \"WHERE community_type=?;\");\n \n ResultSet resultSet; // result for execute query\n CommunityType communityType = null; // new CommunityType object link \n log.info(\"Connection is open: \" + connection);\n \n /*add parameter to prepared statement:*/\n read.setString(1,type); // add key\n resultSet = read.executeQuery(); // execute query\n \n /*set all data to new CommunityType object*/\n while (resultSet.next()) {\n communityType = new CommunityType();\n communityType.setTypeID(resultSet.getLong(TYPE_ID));\n communityType.setCommunityType(resultSet.getString(COMMUNITY_TYPE));\n }\n log.info(\"CommunityType is readed.\");\n \n resultSet.close(); // close result set\n closeAll(read,connection); // close connection and statement\n return communityType;\n }","title":""},{"docid":"515e4bfce08999b8b78cbab7ae83c347","score":"0.43231463","text":"public Item getItemOfType(ItemType itemType){\n\n //iterate through the items\n for(Item item : itemList){\n\n //if the item is null, continue\n if(item == null){\n continue;\n }\n\n //if the itemType is equal to the other itemType return the item\n if(item.isType(itemType)){\n return item;\n }\n }\n return null;\n }","title":""},{"docid":"0644301f164c62cf19c87b37235c5df8","score":"0.43193397","text":"public CASTData getByType (String type) { \n\t\tCASTData result = null;\n\t\tIterator<CASTData> dIter = data.iterator();\n\t\twhile (dIter.hasNext()) { \n\t\t\tCASTData item = dIter.next();\n\t\t\tif (item.getType().equals(type)) { \n\t\t\t\tresult = item;\n\t\t\t\tbreak; \n\t\t\t} // end if check for item type\n\t\t} // end while\n\t\treturn result;\n\t}","title":""},{"docid":"48b8d5829bbe13078fb25fa20455c364","score":"0.43143895","text":"public int getType() {\n return type_;\n }","title":""},{"docid":"48b8d5829bbe13078fb25fa20455c364","score":"0.43143338","text":"public int getType() {\n return type_;\n }","title":""},{"docid":"48b8d5829bbe13078fb25fa20455c364","score":"0.43143338","text":"public int getType() {\n return type_;\n }","title":""},{"docid":"48b8d5829bbe13078fb25fa20455c364","score":"0.43143338","text":"public int getType() {\n return type_;\n }","title":""},{"docid":"48b8d5829bbe13078fb25fa20455c364","score":"0.43143338","text":"public int getType() {\n return type_;\n }","title":""},{"docid":"48b8d5829bbe13078fb25fa20455c364","score":"0.43143338","text":"public int getType() {\n return type_;\n }","title":""},{"docid":"48b8d5829bbe13078fb25fa20455c364","score":"0.43143338","text":"public int getType() {\n return type_;\n }","title":""},{"docid":"cc8d611774a574d34529d86cd7fe2866","score":"0.4305716","text":"public int getType() {\r\n return type;\r\n }","title":""},{"docid":"69216e31123177e76e148ee060ed6202","score":"0.43056282","text":"public ArrayList<IGridColumn> getColumnByType(GridColumnType type)\r\n\t{\r\n\t\tString methodName = MODULE_NAME + \"getColumnByType(GridColumnType)\";\r\n\t\tArrayList<IGridColumn> retval = new ArrayList<IGridColumn>();\r\n\r\n\t\ttry\r\n\t\t{\r\n\t\t\tif( type == GridColumnType.ALL )\r\n\t\t\t{\r\n\t\t\t\tretval = getGridColumns();\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\tIterator<IGridColumn> iter = getGridColumns().iterator();\r\n\t\t\t\twhile( iter.hasNext() )\r\n\t\t\t\t{\r\n\t\t\t\t\tIGridColumn col = iter.next();\r\n\t\t\t\t\tif( col.getColumnType() == type )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tretval.add( col );\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\tcatch(Exception e)\r\n\t\t{\r\n\t\t\tFusionUtils.logError( methodName, \"Failed\", e );\r\n\t\t}\r\n\r\n\t\treturn retval;\r\n\t}","title":""},{"docid":"0fedcfa170b08b884213ebf124f93b0e","score":"0.43034375","text":"public int getType() {\n return m_columnType.getType();\n }","title":""},{"docid":"e091cd6ef001f9e6ed607f80641e406b","score":"0.43006584","text":"public int getShell(char type, ShellName name) {\n\t\tif(type == 'P') {\n\t\t\tfor(int j=0; j<pShells.size(); j++) {\n\t\t\t\tif(pShells.get(j).name.equals(name.name())) return j;\n\t\t\t}\n\t\t} else {\n\t\t\tfor(int j=0; j<sShells.size(); j++) {\n\t\t\t\tif(sShells.get(j).name.equals(name.name())) return j;\n\t\t\t}\n\t\t}\n\t\treturn -1;\n\t}","title":""},{"docid":"61b09c4fd13ab78cdf2cd589367114dd","score":"0.42995024","text":"@Nullable\n public ResolvedAnnotation getAnnotation(@NonNull String type) {\n for (ResolvedAnnotation annotation : getAnnotations()) {\n if (annotation.getType().matchesSignature(type)) {\n return annotation;\n }\n }\n\n return null;\n }","title":""},{"docid":"373eeb7f489e4375ef8fe3d668f6a5e7","score":"0.42959428","text":"public Cursor getCursor() {\n try {\n // select * from carros\n return db.query(NOME_TABELA, EntityEventoConvidado.colunas, null, null, null, null, null, null);\n } catch (SQLException e) {\n Log.e(CATEGORIA, \"Erro ao buscar os convidados: \" + e.toString());\n return null;\n }\n }","title":""},{"docid":"4d07f387044c8ef885a7dd31a7adaedd","score":"0.4293895","text":"public void testIsCursorType() {\r\n System.out.println(\"isCursorType\");\r\n String sqlType = null;\r\n PlsqlTranslationHelper instance = new PlsqlTranslationHelper();\r\n \r\n assertFalse(instance.isCursorType(sqlType));\r\n assertFalse(instance.isCursorType(\"number\"));\r\n assertFalse(instance.isCursorType(\"varchar2\"));\r\n \r\n assertTrue(instance.isCursorType(\"cursor\"));\r\n assertTrue(instance.isCursorType(\"Cursor\"));\r\n assertTrue(instance.isCursorType(\"CURSOR\"));\r\n assertTrue(instance.isCursorType(\"SYS_REFCURSOR\"));\r\n assertTrue(instance.isCursorType(\"sys_refcursor\"));\r\n \r\n }","title":""},{"docid":"9755cde9711f176e6d3502d018da7d11","score":"0.42933315","text":"public int getType() {\n return type_;\n }","title":""},{"docid":"5059a7e281212b1dc1c30f661f0c2e49","score":"0.4293209","text":"public T tryNext() {\r\n DBObject next = cursor.tryNext();\r\n return next != null ? createInstance(clazz, next) : null;\r\n }","title":""},{"docid":"7d097824cbe144ff9fe44a3c288c66dd","score":"0.4292253","text":"PlaceIcon createPlaceIconFromCursor(Cursor cursor) {\r\n int id = cursor.getInt(0);\r\n return new PlaceIcon(id, cursor.getString(1), cursor.getString(2));\r\n }","title":""},{"docid":"6eb8783f425be95ed0d36ffceb07c8dd","score":"0.42883828","text":"public Cursor getDefaultCursor()\n\t{\n\t\treturn defaultCursor != null ? defaultCursor : Cursor.getDefaultCursor();\n\t}","title":""},{"docid":"d827b392f3f85d0f3e067708335f78fa","score":"0.4286461","text":"public static Drawing getInstance(String drawingType) {\n if(StringUtil.isNotNull(drawingType)) {\n if(DRAW_LINE_COMMAND.equalsIgnoreCase(drawingType)) {\n return new Line();\n }\n if(DRAW_RECTANGLE_COMMAND.equalsIgnoreCase(drawingType)) {\n return new Rectangle();\n }\n if(FILL_COLOR_COMMAND.equalsIgnoreCase(drawingType)) {\n return new BucketFill();\n }\n }\n return null;\n }","title":""},{"docid":"6e0c29bf894c27f742a6b9b44c34d23a","score":"0.42863053","text":"public ConnectionCursor cursorForObjectInConnection(T object) {\n int index = data.indexOf(object);\n if (index == -1) {\n return null;\n }\n String cursor = createCursor(index);\n return new DefaultConnectionCursor(cursor);\n }","title":""},{"docid":"acfece884b83f5560cfb3cae29a8fb6a","score":"0.4279815","text":"public int getType() {\n return _type;\n }","title":""},{"docid":"9eed0dde36a65a917924f0d77e6f0a34","score":"0.4278988","text":"public int getType() {\n return type;\n }","title":""},{"docid":"9eed0dde36a65a917924f0d77e6f0a34","score":"0.4278988","text":"public int getType() {\n return type;\n }","title":""},{"docid":"9eed0dde36a65a917924f0d77e6f0a34","score":"0.4278988","text":"public int getType() {\n return type;\n }","title":""},{"docid":"9eed0dde36a65a917924f0d77e6f0a34","score":"0.4278988","text":"public int getType() {\n return type;\n }","title":""},{"docid":"9eed0dde36a65a917924f0d77e6f0a34","score":"0.4278988","text":"public int getType() {\n return type;\n }","title":""},{"docid":"9eed0dde36a65a917924f0d77e6f0a34","score":"0.4278988","text":"public int getType() {\n return type;\n }","title":""},{"docid":"9eed0dde36a65a917924f0d77e6f0a34","score":"0.4278988","text":"public int getType() {\n return type;\n }","title":""},{"docid":"9eed0dde36a65a917924f0d77e6f0a34","score":"0.4278988","text":"public int getType() {\n return type;\n }","title":""},{"docid":"9eed0dde36a65a917924f0d77e6f0a34","score":"0.4278988","text":"public int getType() {\n return type;\n }","title":""},{"docid":"9eed0dde36a65a917924f0d77e6f0a34","score":"0.4278988","text":"public int getType() {\n return type;\n }","title":""},{"docid":"1b35ffb901566127bd29e37b99a05cce","score":"0.4278579","text":"RealmFieldType getColumnType(long columnIndex);","title":""}],"string":"[\n {\n \"docid\": \"fa41e11326a60d1f176e37b11ee973ca\",\n \"score\": \"0.5802969\",\n \"text\": \"private Cursor findCursor() {\\n\\t\\tfor(Measure measure:getMeasures()) {\\n\\t\\t\\tfor(Voice voice:measure.getVoices()) {\\n\\t\\t\\t\\tfor(VoiceItem item:voice.getItems()) {\\n\\t\\t\\t\\t\\tif(item instanceof Cursor) {\\n\\t\\t\\t\\t\\t\\treturn (Cursor) item;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e56889a965ff53e12c81ae61af1b1c8a\",\n \"score\": \"0.57353115\",\n \"text\": \"public int getNumCursorsOfGivenType(int type) {\\n int num = 0;\\n for (int i = 0; i < cursors.size(); ++i) {\\n if (cursors.get(i).getType() == type)\\n num++;\\n }\\n return num;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"29f29ba735a2acc200651529dd5e5b16\",\n \"score\": \"0.5513747\",\n \"text\": \"@NotNull\\r\\n public MapCursor getCursor(int index) {\\r\\n return cursors.get(index);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1cf6b9ecd3d48679e4b84081253f3e1d\",\n \"score\": \"0.54444677\",\n \"text\": \"public Object getObject(int columnIndex, Class type) throws SQLException {\\n\\treturn null;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5becadaed39e18bcf949a99cf0407640\",\n \"score\": \"0.5415621\",\n \"text\": \"private static String getCursorMethodName(String typeName) {\\n if (typeName.equals(\\\"String\\\")) {\\n return \\\"getString\\\";\\n } else if (typeName.equals(\\\"Long\\\")) {\\n return \\\"getLong\\\";\\n } else if (typeName.equals(\\\"Integer\\\")) {\\n return \\\"getInt\\\";\\n } else if (typeName.equals(\\\"Float\\\")) {\\n return \\\"getFloat\\\";\\n } else if (typeName.equals(\\\"Double\\\")) {\\n return \\\"getDouble\\\";\\n } else {\\n return null;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19cf1611cf9cdfa440ec04a217deec10\",\n \"score\": \"0.52079403\",\n \"text\": \"public static Cursor getCursor(String name, Class clazz) {\\n return getCursor(name, clazz, 0, 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37c950bfa7d0983600a6304735dd6174\",\n \"score\": \"0.50922483\",\n \"text\": \"public String getCursor();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f23a7a74bd6b53aa0ed0373c9ce7368\",\n \"score\": \"0.5038076\",\n \"text\": \"public Customer topCustomer(String type)\\r\\n {\\r\\n if (type != null) {\\r\\n Iterator<Customer> custIter = customers.iterator();\\r\\n while (custIter.hasNext()) {\\r\\n Customer c = custIter.next();\\r\\n String t = c.getType();\\r\\n if (type.equals(t))\\r\\n {\\r\\n return c; \\r\\n }\\r\\n }\\r\\n }\\r\\n return null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8f672b35d976dc47522ebb9460606de\",\n \"score\": \"0.500506\",\n \"text\": \"public static Cursor getCursor(URL url, int x, int y)\\n {\\n Cursor cursor = (url!=null) ? (Cursor) cursorCache.get(url) : null;\\n if (cursor == null)\\n {\\n Toolkit toolkit = Toolkit.getDefaultToolkit();\\n Image image = getImage(url);\\n if (image == brokenImage) cursor = brokenCursor;\\n else cursor = toolkit.createCustomCursor(image, new Point(x, y), url.getFile());\\n if (url != null) cursorCache.put(url, cursor);\\n }\\n return cursor;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebb4a10ef6cd62d431cdd0d2fff39086\",\n \"score\": \"0.49839923\",\n \"text\": \"public ReaderType getObjectByID(int rdType) {\\n\\t\\ttry\\n\\t\\t{\\n\\t\\t\\treturn (ReaderType) dal.getObjectByID(rdType);\\n\\t\\t}\\n\\t\\tcatch(Exception e)\\n\\t\\t{\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b10b86932eae6951d366f56ff14c6fac\",\n \"score\": \"0.49523625\",\n \"text\": \"public static Cursor getBestCursor(String name, Class clazz, int width, int height, int x, int y) {\\n Toolkit toolkit = Toolkit.getDefaultToolkit();\\n Dimension dimension = toolkit.getBestCursorSize(width, height);\\n if ((dimension.width == 0) && (dimension.height == 0)) return Cursor.getDefaultCursor();\\n name = name.replaceAll(\\\"%w\\\", Integer.toString(dimension.width));\\n name = name.replaceAll(\\\"%h\\\", Integer.toString(dimension.height));\\n return getCursor(name, clazz, x, y);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0efe00ca1b6c70d2b98e4e2c9a2786e5\",\n \"score\": \"0.48956785\",\n \"text\": \"String getCursorName();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b34256ea9dab4ef696fe62b65c6d82ff\",\n \"score\": \"0.48635316\",\n \"text\": \"public static Cursor getBestCursor(String name, Class clazz, int width, int height) {\\n return getBestCursor(name, clazz, width, height, 0, 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1eca8eb4a29e34fcb7aac74763f6e9fb\",\n \"score\": \"0.48390764\",\n \"text\": \"@SuppressWarnings(\\\"unchecked\\\")\\n public <T> T getObject(int columnIndex, Class<T> type) throws SQLException {\\n return (T) super.getObject(columnIndex);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b76eac0c4ec804875cfe46e2803084f3\",\n \"score\": \"0.48301736\",\n \"text\": \"CursorProvider getCursorProvider();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01ea2b705402f257032427d07cdf88b9\",\n \"score\": \"0.4815585\",\n \"text\": \"public static Cursor getCursor(String name, Class clazz, int x, int y)\\n {\\n if (name.indexOf('.') >= 0) return getCursor(clazz.getResource(name), x, y);\\n\\n for (int i=0; i<imageExtensions.length; i++)\\n {\\n URL url = clazz.getResource(name+imageExtensions[i]);\\n if (url != null) return getCursor(url, x, y);\\n }\\n return brokenCursor;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff549715fd7cf1b08292eff78d58960d\",\n \"score\": \"0.47563767\",\n \"text\": \"public static Cursor getCursor(URL url) {\\n return getCursor(url, 0, 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26e3f5807421bc5f04b5785b833b178b\",\n \"score\": \"0.4755185\",\n \"text\": \"public Cursor getCursor()\\n {\\n return this.cursor;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a23d808aa7d73bdf45f0ccbe5f80f70\",\n \"score\": \"0.47541812\",\n \"text\": \"public int crd(int type) {\\n return table[index(type)][2];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8604ddba82b2ba50cf0d78867777f6a\",\n \"score\": \"0.47524646\",\n \"text\": \"public Cursor getCursor() {\\n return cursor;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87a04b6651f98a3b3baa78d5c6089726\",\n \"score\": \"0.47522342\",\n \"text\": \"Cursor getRealCursor() {\\r\\n Component cursorAncestor = getCursorAncestor();\\r\\n return cursorAncestor != null ? cursorAncestor.getCursor() : Cursor.getDefaultCursor();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a1a38cf3047f74963af3604d1adaed5\",\n \"score\": \"0.47488248\",\n \"text\": \"OptionalInt getOrdinal(Class<?> type);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d1aeb71eeae359ae2ba8efbc1cd518b\",\n \"score\": \"0.47233418\",\n \"text\": \"private Cursor getDragCursor(int action) {\\r\\n\\r\\n\\t\\tCursor cursor;\\r\\n\\r\\n\\t\\tswitch (action) {\\r\\n\\r\\n\\t\\tcase DnDConstants.ACTION_COPY:\\r\\n\\t\\t\\tcursor = DragSource.DefaultCopyDrop;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\tcase DnDConstants.ACTION_MOVE:\\r\\n\\t\\t\\tcursor = DragSource.DefaultMoveDrop;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\tdefault:\\r\\n\\t\\t\\tcursor = DragSource.DefaultMoveDrop;\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\treturn cursor;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e627d08046bb4d3774943f293ddd4add\",\n \"score\": \"0.47147486\",\n \"text\": \"public int getCursor() {\\n\\t\\treturn cursor;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"abb894689487240a84c087c59fb47533\",\n \"score\": \"0.46993414\",\n \"text\": \"public Cursor getCurrentCursor()\\n\\t{\\n\\t\\treturn container.getCursor();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"faf906bfd1911a8a70e8437bdffbf0fb\",\n \"score\": \"0.46908918\",\n \"text\": \"public Cursor getCategoryCursor() {\\n return daoSession.getCategoryDao().queryBuilder().buildCursor().query();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d07e381fdc378608b0d88715dff0b54\",\n \"score\": \"0.46859702\",\n \"text\": \"public static <TT> TT getComponentOfType(Container c, Class<TT> type) {\\n if (c == null) {\\n return null;\\n }\\n if (type == null) {\\n return null;\\n }\\n // TODO -- MOVE TO A DIFFERENT UTILS CLASS!\\n int depth = 0;\\n while (true) {\\n Pair<Boolean, TT> p = getComponentOfType(c, type, 0, depth++, null);\\n if (p == null) {\\n return null;\\n }\\n if (!p.first) {\\n return null;\\n }\\n TT tt = p.second;\\n if (tt != null) {\\n return tt;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"031489e5e31680c71f72546768421f40\",\n \"score\": \"0.4682945\",\n \"text\": \"private Cursor findOrCreateCursor() {\\n\\t\\tCursor cursor = findCursor();\\n\\t\\t\\n\\t\\tif(cursor != null) {\\n\\t\\t\\treturn cursor;\\n\\t\\t}\\n\\t\\t\\n\\t\\tMeasure measure = getMeasures().get(0);\\n\\t\\tVoice voice = measure.getVoices().get(0);\\n\\t\\n\\t\\tcursor = new Cursor(measure, voice);\\n\\t\\tvoice.insertItem(cursor, 0);\\n\\t\\t\\n\\t\\treturn cursor;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eae8df3fb48fab4e84b85b7faa58a303\",\n \"score\": \"0.4665815\",\n \"text\": \"public GrammarAST findFirstType(int ttype) {\\n\\t\\tif ( this.getType()==ttype ) {\\n\\t\\t\\treturn this;\\n\\t\\t}\\n\\t\\t// else check children\\n\\t\\tList<Tree> descendants = descendants(this);\\n\\t\\tfor (Tree child : descendants) {\\n\\t\\t\\tif ( child.getType()==ttype ) {\\n\\t\\t\\t\\treturn (GrammarAST)child;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1cbf391bc8f1ba544c0f6cd0b5dd0cf\",\n \"score\": \"0.46570227\",\n \"text\": \"public <T> T get(final Class<T> type) {\\r\\n\\t\\treturn this.getCurrentCDI().select(type).get();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7094377cd817e72d71d26b89bf20f3c9\",\n \"score\": \"0.4655209\",\n \"text\": \"protected abstract Cursor getCursor(Connection connection);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e28d5326b064e3df866a57f09e7faced\",\n \"score\": \"0.46255788\",\n \"text\": \"int getTypeIndex(String type);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46081f4ac70be5c089bdd4c59dbb4e45\",\n \"score\": \"0.46149912\",\n \"text\": \"public RobotInfo findInView(RobotType type)\\n\\t{\\n\\t\\tfor(int i = 0; i < alliesInView.length; i++)\\n\\t\\t{\\n\\t\\t\\tif(alliesInView[i].getType() == type)\\n\\t\\t\\t\\treturn alliesInView[i];\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"22226d6337807ba9a2b202d92c1a0902\",\n \"score\": \"0.45868325\",\n \"text\": \"public Cursor getCursor() throws SQLException {\\n Cursor c = db.query(true, N_TABLA, columnas, null, null, null, null, null, null);\\n return c;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67427e8a1852e81caf38d2448f42ca20\",\n \"score\": \"0.4585797\",\n \"text\": \"PlaceType createPlaceTypeFromCursor(Cursor cursor) {\\r\\n int id = cursor.getInt(0);\\r\\n return new PlaceType(id, cursor.getString(1), cursor.getString(2));\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"275234f2b34c0b2c3c4ea0e26d25d9c6\",\n \"score\": \"0.4571737\",\n \"text\": \"int xlateRSType(int type) throws SQLException {\\n\\n SQLWarning w;\\n String msg;\\n\\n switch (type) {\\n\\n case JDBCResultSet.TYPE_FORWARD_ONLY :\\n case JDBCResultSet.TYPE_SCROLL_INSENSITIVE : {\\n return type;\\n }\\n case JDBCResultSet.TYPE_SCROLL_SENSITIVE : {\\n msg = \\\"TYPE_SCROLL_SENSITIVE => TYPE_SCROLL_SENSITIVE\\\";\\n w = new SQLWarning(msg, \\\"SOO10\\\",\\n ErrorCode.JDBC_INVALID_ARGUMENT);\\n\\n addWarning(w);\\n\\n return JDBCResultSet.TYPE_SCROLL_INSENSITIVE;\\n }\\n default : {\\n msg = \\\"ResultSet type: \\\" + type;\\n\\n throw Util.invalidArgument(msg);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebca4a941d4e83ec2930b6d13f7656ff\",\n \"score\": \"0.4570164\",\n \"text\": \"public static Soldier getNearestOfType(Soldier source, int type) {\\n\\t\\tif (type == 0)\\n\\t\\t\\treturn getNearestOfType(source, GameSession.getInstance().soldiers);\\n\\t\\telse\\n\\t\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"574a939c9236b4aa34d6fb13fa5ef946\",\n \"score\": \"0.45560598\",\n \"text\": \"public TypeId getIdOfType(Type type) {\\n switch (type.getSort()) {\\n case Type.ARRAY:\\n return getIdOfType(type.getElementType());\\n case Type.OBJECT:\\n return getIdOfType(type.getInternalName());\\n default:\\n return null;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2849e82df1534d5727cd9d638cabfea5\",\n \"score\": \"0.45425647\",\n \"text\": \"public static <T> T getById(Class<T> type, Integer id) {\\n Session session = null;\\n Transaction tx = null;\\n List<T> list = null;\\n try {\\n session = Db.getInstance().createSession();\\n tx = session.beginTransaction();\\n Query query = session.createQuery(\\\"from \\\" + type.getName() +\\n \\\" where id = :id\\\");\\n query.setParameter(\\\"id\\\", id);\\n list = query.list();\\n tx.commit();\\n } catch(HibernateException ex) {\\n // TODO add logging statements\\n tx.rollback();\\n return null;\\n } finally {\\n if(session != null) { session.close(); }\\n }\\n return (list.size() > 0 ? list.get(0) : null);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4428799dbc22ba6b990350b0cd979aab\",\n \"score\": \"0.45087302\",\n \"text\": \"public <T> ArrayList<T> queryColumn(Class<T> type, String query, int column) {\\n ArrayList<T> results = new ArrayList<T>();\\n Cursor cursor = null;\\n \\n try {\\n cursor = mDatabase.rawQuery(query, null);\\n String methodName = getCursorMethodName(type.getSimpleName());\\n while (cursor.moveToNext()) {\\n // The magical line. Almost as illegible as python code ;)\\n results.add(type.cast(Cursor.class.getMethod(methodName, int.class).invoke(cursor, column)));\\n }\\n } catch (NoSuchMethodException e) {\\n // This is really coding error, so it should be revealed if it ever happens\\n throw new RuntimeException(e);\\n } catch (IllegalArgumentException e) {\\n // This is really coding error, so it should be revealed if it ever happens\\n throw new RuntimeException(e);\\n } catch (IllegalAccessException e) {\\n // This is really coding error, so it should be revealed if it ever happens\\n throw new RuntimeException(e);\\n } catch (InvocationTargetException e) {\\n throw new RuntimeException(e);\\n } finally {\\n if (cursor != null) {\\n cursor.close();\\n }\\n }\\n \\n return results;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"efc259dc1e67fb70f02f1206e16175e1\",\n \"score\": \"0.45032144\",\n \"text\": \"public static CreationType getByTypeNum(int typeNum) {\\n\\t\\t\\tfor(CreationType ct : CreationType.values()) {\\n\\t\\t\\t\\tif(ct.getTypeNum() == typeNum) {\\n\\t\\t\\t\\t\\treturn ct;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn null;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"578778c462e0237a57994a7fb994c374\",\n \"score\": \"0.45008594\",\n \"text\": \"public static RefType get(byte type) {\\n\\t\\tRefType rt = REFTYPE_LOOKUP_BY_TYPE_MAP.get(type);\\n\\t\\tif (rt == null) {\\n\\t\\t\\tthrow new NoSuchElementException(\\\"RefType not defined: \\\" + type);\\n\\t\\t}\\n\\t\\treturn rt;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b328d6aa50b5c8f0c8c4d7e6e24039d\",\n \"score\": \"0.44989988\",\n \"text\": \"public Object getControl(String type) {\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c4a56059f869fc4418b0795798115be\",\n \"score\": \"0.44912055\",\n \"text\": \"public int getShellIndex(char type, ShellName name) {\\n\\t\\tint index;\\n\\t\\t\\n\\t\\t// First try some special names needed to make branches.\\n\\t\\tif(name == ShellName.SURFACE) {\\n\\t\\t\\treturn shellSize(type)-1;\\n\\t\\t} else if(name == ShellName.MANTLE_BOTTOM) {\\n\\t\\t\\tindex = getShell(type, ShellName.CORE_MANTLE_BOUNDARY);\\n\\t\\t\\tif(index < 0) {\\n\\t\\t\\t\\tindex = getShell(type, ShellName.OUTER_CORE);\\n\\t\\t\\t}\\n\\t\\t\\treturn index;\\n\\t\\t} else if(name == ShellName.CORE_TOP) {\\n\\t\\t\\treturn getShell(type, ShellName.OUTER_CORE);\\n\\t\\t} else {\\n\\t\\t\\t// If that fails, just try the name.\\n\\t\\t\\treturn getShell(type, name);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0928f405cd9faf1e11bc3cb6c1bf3912\",\n \"score\": \"0.44790086\",\n \"text\": \"public int getType()\\r\\n {\\r\\n return m_type;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f9608bdbf30f95f24604e8fe6311053a\",\n \"score\": \"0.44666484\",\n \"text\": \"public Entity findNearestEntity(Class<? extends Entity> type) {\\n List<Entity> entities = findEntitiesOfType(type);\\n\\n if (entities.isEmpty()) {\\n return null;\\n }\\n\\n Collections.shuffle(entities);\\n Collections.sort(entities, new CoordinateComparator<Entity>(owner.getPosition()));\\n\\n return entities.get(0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bee1441ed76d74765bcf43a7992f769f\",\n \"score\": \"0.44633418\",\n \"text\": \"@Deprecated\\r\\n @NotNull\\r\\n public MapCursor addCursor(int x, int y, byte direction, byte type) {\\r\\n return addCursor(x, y, direction, type, true);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"acf2892d366cc850c5b02ce1b2e323bc\",\n \"score\": \"0.44323865\",\n \"text\": \"public Cursor getCurrentCursor()\\n\\t{\\n\\t\\treturn currentCursor;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c4a4ef6b8f9d3a8ae9163f9c961624c1\",\n \"score\": \"0.44168457\",\n \"text\": \"public int cell(final CellType type) {\\n return this.cells(1, type);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4724a24c621a662eb0838dc5159191fd\",\n \"score\": \"0.4407104\",\n \"text\": \"public static ObjectInfo queryByName(int type, String name)\\n {\\n \\tObjectInfo info = null;\\n \\tswitch(type)\\n \\t{\\n \\t\\tcase NED:\\n \\t\\tdefault:\\n \\t\\t\\tinfo = queryNEDByName(name);\\n \\t\\t\\tbreak;\\n \\t\\tcase SDSSDR7:\\n \\t\\tcase SDSSDR8:\\n \\t\\tcase SDSSDR9:\\n \\t\\tcase SDSSDR17:\\n \\t\\t\\tinfo = querySDSSByName(type, name);\\n \\t\\tbreak;\\n \\t}\\n \\treturn info;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9036a8c0873fd11290d90fb5a404c3b6\",\n \"score\": \"0.44022447\",\n \"text\": \"public Cursor getCursor() throws SQLException\\n {\\n Cursor cPeliculas = db.query( true, C_TABLA, columnas, null, null, null, null, null, null);\\n\\n return cPeliculas;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bdd3246bb4e9f05b5e476de41d04ce75\",\n \"score\": \"0.4398734\",\n \"text\": \"Tbtype selectByPrimaryKey(Integer typeid);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"20ae0555f1c6ddc70321ff935448ea03\",\n \"score\": \"0.43844038\",\n \"text\": \"public Object getObject(String columnLabel, Class type) throws SQLException {\\n\\treturn null;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d395c54e7ce49b48ad51f7999534707\",\n \"score\": \"0.43609494\",\n \"text\": \"@Override\\n\\tpublic String getCursorName() throws SQLException {\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6475cacf5cd0abc4c034d1600bf04163\",\n \"score\": \"0.43561563\",\n \"text\": \"private int index(int type) {\\n return com.actelion.research.chem.forcefield.mmff.Search.binary(0, type, this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f430c70573b2fe338f55a9b8a9749045\",\n \"score\": \"0.4352168\",\n \"text\": \"int indexOfType(String type);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49dbf55c01cbab7c8b9a85fefa8c8a09\",\n \"score\": \"0.4339013\",\n \"text\": \"public Node getByType(String type)\\n {\\n Node node;\\n for (Iterator<Node> it = this.children.iterator(); it.hasNext();) {\\n node = it.next();\\n if(node.type.equals(type)){\\n return node;\\n }\\n }\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c7189a7396f0836f074b33af267a488\",\n \"score\": \"0.4332771\",\n \"text\": \"public static final JdbcType get(int order) {\\n return map.get(order);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e65beb49ea6ab893b61a38ef8e2bb2ef\",\n \"score\": \"0.43316752\",\n \"text\": \"public int getType() {\\n return type_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e65beb49ea6ab893b61a38ef8e2bb2ef\",\n \"score\": \"0.43316752\",\n \"text\": \"public int getType() {\\n return type_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e65beb49ea6ab893b61a38ef8e2bb2ef\",\n \"score\": \"0.43316752\",\n \"text\": \"public int getType() {\\n return type_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e65beb49ea6ab893b61a38ef8e2bb2ef\",\n \"score\": \"0.43316752\",\n \"text\": \"public int getType() {\\n return type_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e65beb49ea6ab893b61a38ef8e2bb2ef\",\n \"score\": \"0.4331087\",\n \"text\": \"public int getType() {\\n return type_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e65beb49ea6ab893b61a38ef8e2bb2ef\",\n \"score\": \"0.4331087\",\n \"text\": \"public int getType() {\\n return type_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e05a47f37e17f5102b9c0bb5dd8da830\",\n \"score\": \"0.43259892\",\n \"text\": \"public Long getCategoryIdAtCursor(Cursor cursor, int position) {\\n Category category = daoSession.getCategoryDao().readEntity(cursor, 0);\\n return category == null ? NOT_FOUND : category.getId();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ecfa8a1c7c078cd621e2c86460282545\",\n \"score\": \"0.432408\",\n \"text\": \"@Override\\n public CommunityType readByType(String type) throws SQLException {\\n Connection connection \\n = DBCP.getInstance().getConnection(); // new connection\\n \\n /* prepared statement for select from community_types table by key */\\n PreparedStatement read \\n = connection.prepareStatement(\\\"SELECT * FROM community_types \\\"\\n + \\\"WHERE community_type=?;\\\");\\n \\n ResultSet resultSet; // result for execute query\\n CommunityType communityType = null; // new CommunityType object link \\n log.info(\\\"Connection is open: \\\" + connection);\\n \\n /*add parameter to prepared statement:*/\\n read.setString(1,type); // add key\\n resultSet = read.executeQuery(); // execute query\\n \\n /*set all data to new CommunityType object*/\\n while (resultSet.next()) {\\n communityType = new CommunityType();\\n communityType.setTypeID(resultSet.getLong(TYPE_ID));\\n communityType.setCommunityType(resultSet.getString(COMMUNITY_TYPE));\\n }\\n log.info(\\\"CommunityType is readed.\\\");\\n \\n resultSet.close(); // close result set\\n closeAll(read,connection); // close connection and statement\\n return communityType;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"515e4bfce08999b8b78cbab7ae83c347\",\n \"score\": \"0.43231463\",\n \"text\": \"public Item getItemOfType(ItemType itemType){\\n\\n //iterate through the items\\n for(Item item : itemList){\\n\\n //if the item is null, continue\\n if(item == null){\\n continue;\\n }\\n\\n //if the itemType is equal to the other itemType return the item\\n if(item.isType(itemType)){\\n return item;\\n }\\n }\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0644301f164c62cf19c87b37235c5df8\",\n \"score\": \"0.43193397\",\n \"text\": \"public CASTData getByType (String type) { \\n\\t\\tCASTData result = null;\\n\\t\\tIterator<CASTData> dIter = data.iterator();\\n\\t\\twhile (dIter.hasNext()) { \\n\\t\\t\\tCASTData item = dIter.next();\\n\\t\\t\\tif (item.getType().equals(type)) { \\n\\t\\t\\t\\tresult = item;\\n\\t\\t\\t\\tbreak; \\n\\t\\t\\t} // end if check for item type\\n\\t\\t} // end while\\n\\t\\treturn result;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48b8d5829bbe13078fb25fa20455c364\",\n \"score\": \"0.43143895\",\n \"text\": \"public int getType() {\\n return type_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48b8d5829bbe13078fb25fa20455c364\",\n \"score\": \"0.43143338\",\n \"text\": \"public int getType() {\\n return type_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48b8d5829bbe13078fb25fa20455c364\",\n \"score\": \"0.43143338\",\n \"text\": \"public int getType() {\\n return type_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48b8d5829bbe13078fb25fa20455c364\",\n \"score\": \"0.43143338\",\n \"text\": \"public int getType() {\\n return type_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48b8d5829bbe13078fb25fa20455c364\",\n \"score\": \"0.43143338\",\n \"text\": \"public int getType() {\\n return type_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48b8d5829bbe13078fb25fa20455c364\",\n \"score\": \"0.43143338\",\n \"text\": \"public int getType() {\\n return type_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48b8d5829bbe13078fb25fa20455c364\",\n \"score\": \"0.43143338\",\n \"text\": \"public int getType() {\\n return type_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc8d611774a574d34529d86cd7fe2866\",\n \"score\": \"0.4305716\",\n \"text\": \"public int getType() {\\r\\n return type;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69216e31123177e76e148ee060ed6202\",\n \"score\": \"0.43056282\",\n \"text\": \"public ArrayList<IGridColumn> getColumnByType(GridColumnType type)\\r\\n\\t{\\r\\n\\t\\tString methodName = MODULE_NAME + \\\"getColumnByType(GridColumnType)\\\";\\r\\n\\t\\tArrayList<IGridColumn> retval = new ArrayList<IGridColumn>();\\r\\n\\r\\n\\t\\ttry\\r\\n\\t\\t{\\r\\n\\t\\t\\tif( type == GridColumnType.ALL )\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tretval = getGridColumns();\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tIterator<IGridColumn> iter = getGridColumns().iterator();\\r\\n\\t\\t\\t\\twhile( iter.hasNext() )\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tIGridColumn col = iter.next();\\r\\n\\t\\t\\t\\t\\tif( col.getColumnType() == type )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tretval.add( col );\\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\\tcatch(Exception e)\\r\\n\\t\\t{\\r\\n\\t\\t\\tFusionUtils.logError( methodName, \\\"Failed\\\", e );\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\treturn retval;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0fedcfa170b08b884213ebf124f93b0e\",\n \"score\": \"0.43034375\",\n \"text\": \"public int getType() {\\n return m_columnType.getType();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e091cd6ef001f9e6ed607f80641e406b\",\n \"score\": \"0.43006584\",\n \"text\": \"public int getShell(char type, ShellName name) {\\n\\t\\tif(type == 'P') {\\n\\t\\t\\tfor(int j=0; j<pShells.size(); j++) {\\n\\t\\t\\t\\tif(pShells.get(j).name.equals(name.name())) return j;\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\tfor(int j=0; j<sShells.size(); j++) {\\n\\t\\t\\t\\tif(sShells.get(j).name.equals(name.name())) return j;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn -1;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"61b09c4fd13ab78cdf2cd589367114dd\",\n \"score\": \"0.42995024\",\n \"text\": \"@Nullable\\n public ResolvedAnnotation getAnnotation(@NonNull String type) {\\n for (ResolvedAnnotation annotation : getAnnotations()) {\\n if (annotation.getType().matchesSignature(type)) {\\n return annotation;\\n }\\n }\\n\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"373eeb7f489e4375ef8fe3d668f6a5e7\",\n \"score\": \"0.42959428\",\n \"text\": \"public Cursor getCursor() {\\n try {\\n // select * from carros\\n return db.query(NOME_TABELA, EntityEventoConvidado.colunas, null, null, null, null, null, null);\\n } catch (SQLException e) {\\n Log.e(CATEGORIA, \\\"Erro ao buscar os convidados: \\\" + e.toString());\\n return null;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d07f387044c8ef885a7dd31a7adaedd\",\n \"score\": \"0.4293895\",\n \"text\": \"public void testIsCursorType() {\\r\\n System.out.println(\\\"isCursorType\\\");\\r\\n String sqlType = null;\\r\\n PlsqlTranslationHelper instance = new PlsqlTranslationHelper();\\r\\n \\r\\n assertFalse(instance.isCursorType(sqlType));\\r\\n assertFalse(instance.isCursorType(\\\"number\\\"));\\r\\n assertFalse(instance.isCursorType(\\\"varchar2\\\"));\\r\\n \\r\\n assertTrue(instance.isCursorType(\\\"cursor\\\"));\\r\\n assertTrue(instance.isCursorType(\\\"Cursor\\\"));\\r\\n assertTrue(instance.isCursorType(\\\"CURSOR\\\"));\\r\\n assertTrue(instance.isCursorType(\\\"SYS_REFCURSOR\\\"));\\r\\n assertTrue(instance.isCursorType(\\\"sys_refcursor\\\"));\\r\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9755cde9711f176e6d3502d018da7d11\",\n \"score\": \"0.42933315\",\n \"text\": \"public int getType() {\\n return type_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5059a7e281212b1dc1c30f661f0c2e49\",\n \"score\": \"0.4293209\",\n \"text\": \"public T tryNext() {\\r\\n DBObject next = cursor.tryNext();\\r\\n return next != null ? createInstance(clazz, next) : null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d097824cbe144ff9fe44a3c288c66dd\",\n \"score\": \"0.4292253\",\n \"text\": \"PlaceIcon createPlaceIconFromCursor(Cursor cursor) {\\r\\n int id = cursor.getInt(0);\\r\\n return new PlaceIcon(id, cursor.getString(1), cursor.getString(2));\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6eb8783f425be95ed0d36ffceb07c8dd\",\n \"score\": \"0.42883828\",\n \"text\": \"public Cursor getDefaultCursor()\\n\\t{\\n\\t\\treturn defaultCursor != null ? defaultCursor : Cursor.getDefaultCursor();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d827b392f3f85d0f3e067708335f78fa\",\n \"score\": \"0.4286461\",\n \"text\": \"public static Drawing getInstance(String drawingType) {\\n if(StringUtil.isNotNull(drawingType)) {\\n if(DRAW_LINE_COMMAND.equalsIgnoreCase(drawingType)) {\\n return new Line();\\n }\\n if(DRAW_RECTANGLE_COMMAND.equalsIgnoreCase(drawingType)) {\\n return new Rectangle();\\n }\\n if(FILL_COLOR_COMMAND.equalsIgnoreCase(drawingType)) {\\n return new BucketFill();\\n }\\n }\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e0c29bf894c27f742a6b9b44c34d23a\",\n \"score\": \"0.42863053\",\n \"text\": \"public ConnectionCursor cursorForObjectInConnection(T object) {\\n int index = data.indexOf(object);\\n if (index == -1) {\\n return null;\\n }\\n String cursor = createCursor(index);\\n return new DefaultConnectionCursor(cursor);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"acfece884b83f5560cfb3cae29a8fb6a\",\n \"score\": \"0.4279815\",\n \"text\": \"public int getType() {\\n return _type;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eed0dde36a65a917924f0d77e6f0a34\",\n \"score\": \"0.4278988\",\n \"text\": \"public int getType() {\\n return type;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eed0dde36a65a917924f0d77e6f0a34\",\n \"score\": \"0.4278988\",\n \"text\": \"public int getType() {\\n return type;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eed0dde36a65a917924f0d77e6f0a34\",\n \"score\": \"0.4278988\",\n \"text\": \"public int getType() {\\n return type;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eed0dde36a65a917924f0d77e6f0a34\",\n \"score\": \"0.4278988\",\n \"text\": \"public int getType() {\\n return type;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eed0dde36a65a917924f0d77e6f0a34\",\n \"score\": \"0.4278988\",\n \"text\": \"public int getType() {\\n return type;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eed0dde36a65a917924f0d77e6f0a34\",\n \"score\": \"0.4278988\",\n \"text\": \"public int getType() {\\n return type;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eed0dde36a65a917924f0d77e6f0a34\",\n \"score\": \"0.4278988\",\n \"text\": \"public int getType() {\\n return type;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eed0dde36a65a917924f0d77e6f0a34\",\n \"score\": \"0.4278988\",\n \"text\": \"public int getType() {\\n return type;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eed0dde36a65a917924f0d77e6f0a34\",\n \"score\": \"0.4278988\",\n \"text\": \"public int getType() {\\n return type;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9eed0dde36a65a917924f0d77e6f0a34\",\n \"score\": \"0.4278988\",\n \"text\": \"public int getType() {\\n return type;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b35ffb901566127bd29e37b99a05cce\",\n \"score\": \"0.4278579\",\n \"text\": \"RealmFieldType getColumnType(long columnIndex);\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985496,"cells":{"query_id":{"kind":"string","value":"8a6057852aaa3d1779b341b4678da9d1"},"query":{"kind":"string","value":"/ access modifiers changed from: 0000"},"positive_passages":{"kind":"list like","value":[{"docid":"de125d37623d36319212739aeeabccaa","score":"0.0","text":"public void onAnchorReady(Recycler recycler, State state, AnchorInfo anchorInfo, int i) {\n Recycler recycler2 = recycler;\n State state2 = state;\n AnchorInfo anchorInfo2 = anchorInfo;\n int itemDirection = i;\n Recycler recycler3 = recycler2;\n State state3 = state2;\n AnchorInfo anchorInfo3 = anchorInfo2;\n int i2 = itemDirection;\n super.onAnchorReady(recycler2, state2, anchorInfo2, itemDirection);\n updateMeasurements();\n if (state2.getItemCount() > 0 && !state2.isPreLayout()) {\n ensureAnchorIsInCorrectSpan(recycler2, state2, anchorInfo2, itemDirection);\n }\n ensureViewSet();\n }","title":""}],"string":"[\n {\n \"docid\": \"de125d37623d36319212739aeeabccaa\",\n \"score\": \"0.0\",\n \"text\": \"public void onAnchorReady(Recycler recycler, State state, AnchorInfo anchorInfo, int i) {\\n Recycler recycler2 = recycler;\\n State state2 = state;\\n AnchorInfo anchorInfo2 = anchorInfo;\\n int itemDirection = i;\\n Recycler recycler3 = recycler2;\\n State state3 = state2;\\n AnchorInfo anchorInfo3 = anchorInfo2;\\n int i2 = itemDirection;\\n super.onAnchorReady(recycler2, state2, anchorInfo2, itemDirection);\\n updateMeasurements();\\n if (state2.getItemCount() > 0 && !state2.isPreLayout()) {\\n ensureAnchorIsInCorrectSpan(recycler2, state2, anchorInfo2, itemDirection);\\n }\\n ensureViewSet();\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"ff86c3e5dba10aeeb57d62c4db80a220","score":"0.65839547","text":"protected abstract Object m8602a();","title":""},{"docid":"d93c74d91cdd5fd7d5ba828e7409b39e","score":"0.64764357","text":"private AccessPrivate() {\n }","title":""},{"docid":"6353e85b2aac21fff7db354568309139","score":"0.64056814","text":"public abstract void mo1608c();","title":""},{"docid":"b4ecae6e31b41ead72d093495b46455a","score":"0.6256481","text":"public void mo1410b() {\n }","title":""},{"docid":"8e44716b5ee10b9661605afb83ad4dc2","score":"0.6250073","text":"private void priv() {}","title":""},{"docid":"ec2afced68195dab79cf8503e6907338","score":"0.62292695","text":"protected void mo1628b() {\n }","title":""},{"docid":"12fae01a3c575f170627ae223fa8d338","score":"0.6224761","text":"@Override\r\n\tprotected int meth() {\n\t\treturn 0;\r\n\t}","title":""},{"docid":"1a0e5ed7432f278f3f68a25243b611a4","score":"0.6203107","text":"@Override\n\tpublic void aaa03() {\n\t\t\n\t}","title":""},{"docid":"caf707be38711b89c416d3168ee64f54","score":"0.6195372","text":"public final void mo9402a() {\n }","title":""},{"docid":"bc7d3c901cf5e7cfe613184da88f97df","score":"0.6190479","text":"protected abstract void mo6852a();","title":""},{"docid":"4c9e25ea6f293e2f67da562cd4a0b657","score":"0.6180488","text":"public final void mo8553EA() {\n }","title":""},{"docid":"a1def07258eba1244f2eec683b3870c6","score":"0.6142355","text":"@Override\r\n\tprotected int absmethod() {\n\t\treturn 0;\r\n\t}","title":""},{"docid":"dd52b07b3b08ed17e2904774fedab9f5","score":"0.61405987","text":"public abstract String mo118446b();","title":""},{"docid":"fb37f787973670a420102c4c8d309c67","score":"0.61268806","text":"public final void mo2302a() {\n }","title":""},{"docid":"df8a8b96bc759c7b35f1091da9a1db36","score":"0.6103091","text":"public abstract void m22895d();","title":""},{"docid":"5cc35b6bd51fbaac027143062ffe69f6","score":"0.60454714","text":"public final /* bridge */ /* synthetic */ void mo2224c() {\n super.mo2224c();\n }","title":""},{"docid":"3c67133d704b7188883ee60fd0de7ceb","score":"0.6044431","text":"public abstract void mo42336d();","title":""},{"docid":"a3def2258601d63c48bf6eff66c59697","score":"0.6042236","text":"public void mo12628c() {\n }","title":""},{"docid":"afe4974c1bb08d001eb247949dc197ba","score":"0.60394126","text":"public void publicar() {\n throw new UnsupportedOperationException(\"Not implemented yet.\");\r\n }","title":""},{"docid":"767e59894354c09bec55bebb5f362733","score":"0.60230416","text":"public abstract void mo30456a();","title":""},{"docid":"ecb43b43dd341fa1f1a1570be69f8bd7","score":"0.60218257","text":"public final void mo37729c() {\n }","title":""},{"docid":"4c3b3d975dd112cd0977aeae3ca50081","score":"0.6015697","text":"public void mo12930a() {\n }","title":""},{"docid":"67a05305786e634a887ca49dde57d6ee","score":"0.59998226","text":"public void O000000o() {\r\n /*\r\n r3 = this;\r\n return;\r\n */\r\n throw new UnsupportedOperationException(\"Method not decompiled: defpackage.OO0oO.O000000o():void\");\r\n }","title":""},{"docid":"7839d9b18f833d7ad1ccae8536c829da","score":"0.5996895","text":"@Override\r\n\tpublic void zielone_swiatlo() {\n\t\t\r\n\t}","title":""},{"docid":"d7194e467f51e022c107531d8614b6a3","score":"0.59861773","text":"@Override\r\n\tpublic void anular() {\n\t\t\r\n\t}","title":""},{"docid":"be1ab6202e622f8617fafadfa80e8b14","score":"0.59852415","text":"public final /* bridge */ /* synthetic */ void mo43566a() {\n super.mo43566a();\n }","title":""},{"docid":"d95a081a1e6e3117f8617a3fbbbe16fd","score":"0.59847504","text":"public void mo3871b() {\n }","title":""},{"docid":"381454d78257eeedd56c5a3b2049ee33","score":"0.5984525","text":"public abstract void mo2655c();","title":""},{"docid":"b55fee510b247cdd8066e542381d90cd","score":"0.5981179","text":"public abstract void mo41381a();","title":""},{"docid":"2e593e5d7fe20e2a9581e3322460d946","score":"0.59809494","text":"public abstract void mo2038d();","title":""},{"docid":"84e9ffccaf8a168c13b1abb7ad49748c","score":"0.59753895","text":"public abstract C0502p mo2379a();","title":""},{"docid":"4f355b5e73b7bfae580b4299f081c63a","score":"0.5975243","text":"public interface C20497c {\n }","title":""},{"docid":"2cc97f340071c93ab12395f2981731ee","score":"0.59562695","text":"public void mo25307b() {\n }","title":""},{"docid":"67ba6866d578f2da58519b2abc75c0ce","score":"0.59560835","text":"Set mo42679a();","title":""},{"docid":"64abaa4d258c9e042f52fd7249821f80","score":"0.59546846","text":"public final /* bridge */ /* synthetic */ void mo43571c() {\n super.mo43571c();\n }","title":""},{"docid":"9a00431eee28b38391cb5dfa243729d9","score":"0.5947284","text":"public void mo4643a() {\n }","title":""},{"docid":"0f09efa926a8aca2056b8d02bc6035ac","score":"0.59445345","text":"public interface C0205d {\n}","title":""},{"docid":"7da9ad3ab650b64b3e75012a99c0e238","score":"0.5928487","text":"public void mo3866a() {\n }","title":""},{"docid":"571003ac9a448073df8a023792518814","score":"0.592612","text":"public void mo4586b() {\n }","title":""},{"docid":"e67123e880f8c8124939bb97354e1543","score":"0.5924617","text":"@Override\n public int getCode() {\n return 0;\n }","title":""},{"docid":"dad58a3f1d65a01c9c0f9bc2e9c15b03","score":"0.59155273","text":"public abstract C3897a mo56269d();","title":""},{"docid":"cdf542363f5b089e84183e3d9020935f","score":"0.5903714","text":"@Override\n\t protected void ramana() {\n\t\t\n\t}","title":""},{"docid":"e209517a20595deaa191e44a3de94af0","score":"0.58877325","text":"protected void method_2832() {\r\n super.method_2427(awt.field_4174);\r\n }","title":""},{"docid":"a78c27243b56071570ce9a256848db34","score":"0.5880474","text":"public SEL1052() {}","title":""},{"docid":"3e7569441400c3ffc6f28860f13c6867","score":"0.5877874","text":"public abstract void mo2042g();","title":""},{"docid":"18f07d69021f798ebf980f38f2da8e22","score":"0.5865658","text":"public abstract void mo72305i();","title":""},{"docid":"aa82f6d8543313919e2ed721b176099a","score":"0.5864205","text":"public void mo23307a() {\n }","title":""},{"docid":"aa82f6d8543313919e2ed721b176099a","score":"0.5864205","text":"public void mo23307a() {\n }","title":""},{"docid":"9e05565aea6889799a65c06069ccc14f","score":"0.58538973","text":"public void mo10690b() {\n }","title":""},{"docid":"f0705d77863f0fa7c516a99a8eca8134","score":"0.58534145","text":"private void zbudujSciezkeiRozpocznij() {\n\t\t\r\n\t}","title":""},{"docid":"3ff4c5f106ea70f0aa072d2f80489e63","score":"0.58469456","text":"public interface C0143OooO0o0 {\n }","title":""},{"docid":"b064b6b07b42d5504cafb175edd263f5","score":"0.5838975","text":"@Override\n\tpublic void aaa01() {\n\t\t\n\t}","title":""},{"docid":"2bc34831281e42112e767af680be22a6","score":"0.5837567","text":"public abstract void mo16897a();","title":""},{"docid":"486283f9af54553e1a6b672133e1bf30","score":"0.58373797","text":"public interface C0803a {\n /* renamed from: a */\n void mo4675a();\n }","title":""},{"docid":"a5667ab17f2769cd60ca85efac21ac76","score":"0.58363056","text":"public void mo12627b() {\n }","title":""},{"docid":"875b8cee759d2f08821888d5febd7b73","score":"0.58331746","text":"public int getSubType()\r\n/* 82: */ {\r\n/* 83: 73 */ return 0;\r\n/* 84: */ }","title":""},{"docid":"010f22a7ce9ba69fa45936fbb81a2c67","score":"0.5832795","text":"public abstract void mo4661b();","title":""},{"docid":"a8e650984d750fb08d1202441a469d81","score":"0.5832638","text":"private Ap() \r\n\t{ \r\n\t}","title":""},{"docid":"ac073856aff6c0dbf40fe0cd14741c4a","score":"0.5827924","text":"@Override\n public void visitCompoundAccessStatement(CompoundAccessStatement access) {\n }","title":""},{"docid":"1a214d12bf1fc816d34b56cfdeaf3bf3","score":"0.58274686","text":"public void mo3771b() {\n }","title":""},{"docid":"1edfd19457e77f8469601cb65d020e75","score":"0.5826322","text":"public abstract void mo1611d();","title":""},{"docid":"7d893dc0f680980056eb869215843868","score":"0.5826307","text":"@Override\n\tpublic void m21() {\n\t\t\n\t}","title":""},{"docid":"8a73ad91ec40e2452fa421d5de2a05be","score":"0.582346","text":"private StructAccess()\r\n {\r\n // Private constructor to prevent instantiation\r\n }","title":""},{"docid":"942017b3215e6ca751b90721e3dca9b2","score":"0.58223826","text":"public final void mo23900d() {\n }","title":""},{"docid":"47f6cd4347feebb34b412daee8f8b4ac","score":"0.5821173","text":"public interface O000000o {\r\n public static final String O00000o = \"image_manager_disk_cache\";\r\n public static final int O00000o0 = 262144000;\r\n\r\n OO00o00 O000000o();\r\n }","title":""},{"docid":"9f87e3e2167a9521e43b3ead8b9003dc","score":"0.5819902","text":"private Public() {\n\t\tsuper(\"public\");\n\t}","title":""},{"docid":"9725d97f1d6af5db196c2a114efe8a16","score":"0.58195317","text":"public void mo1088a() {\n }","title":""},{"docid":"bc3a08c64e443ee86473be048cb9738a","score":"0.5817646","text":"private void smth() {\n\n\t\t}","title":""},{"docid":"3e329c8586e25a9d4c4d2dd37a6d8f9f","score":"0.58170795","text":"public void mo32535b() {\n }","title":""},{"docid":"b6d749aac011bf7b6e9802af1e3cee5d","score":"0.5813447","text":"@Override\n\t\t\t\t\t\tpublic int getCode() {\n\t\t\t\t\t\t\treturn 0;\n\t\t\t\t\t\t}","title":""},{"docid":"61fb5581ecf602a70e6981318459e7e2","score":"0.5809068","text":"public void mo91720e() {\n }","title":""},{"docid":"271cce9d24ea8130668aab58bfab00cf","score":"0.58077484","text":"public final void mo37730d() {\n }","title":""},{"docid":"f52241b0aff9cc519280806d07f619e6","score":"0.5795511","text":"protected boolean isAccessible() { return true; }","title":""},{"docid":"81b496afb7540bb13bd5a754c31378b7","score":"0.57948214","text":"public final void mo62159d() {\n }","title":""},{"docid":"1c357029764627aa6c95b473ce094f21","score":"0.5792171","text":"@Override\n public int getAccessLevel() {\n return 0;\n }","title":""},{"docid":"90e9be10c2c69543036119c8db74189e","score":"0.5785751","text":"public void mo6944a() {\n }","title":""},{"docid":"16c30d73c1df796c0e31e93eb0f6e02e","score":"0.5784073","text":"@Override\r\n\tpublic void atacar() {\n\t\t\r\n\t}","title":""},{"docid":"a25fb11f9985c747391822f3903b956d","score":"0.5783073","text":"public void mo3222a() {\n }","title":""},{"docid":"ca654ad27e8471de3f946a82c61cffb7","score":"0.5776861","text":"private final Void m33802a() {\n throw new C13042b();\n }","title":""},{"docid":"9b9787eedaf8ab2866634795354c59ac","score":"0.57753754","text":"@Override\n\tprotected void special() {\n\n\t}","title":""},{"docid":"bde791cb78ce1d6d2a0745225e0176b8","score":"0.5774926","text":"public abstract void mo72306j();","title":""},{"docid":"61fb897a2a2b27318913445067a7c070","score":"0.5774302","text":"public void mo92534b() {\n }","title":""},{"docid":"32622792c46b5467c2ad8a7f3d285f9e","score":"0.57732767","text":"public void mo4579b() {\n }","title":""},{"docid":"fe3a27388b67956017a79091ac2808d3","score":"0.577261","text":"public final void mo64992b() {\n }","title":""},{"docid":"c3eed32e5f77c41bfcd29cb7bd62517d","score":"0.57713395","text":"public void mPri() {\n\t\tSystem.out.println(\"INSIDE --> Package Access Modifier, TClassP & Default Method\");\n\t}","title":""},{"docid":"b47584148aaec6cbc53bccbff915f72c","score":"0.57692283","text":"public void mo1913a() {\n }","title":""},{"docid":"8e584d0bc25283bd075aa6f6ebc8ba60","score":"0.5767352","text":"private Subtask04() {\n\t\tthrow new UnsupportedOperationException();\n\t}","title":""},{"docid":"083310bc336fb94ce2e7bccd27705a9f","score":"0.57620776","text":"public KeyUsage(int r1) {\n /*\n // Can't load method instructions: Load method exception: bogus opcode: 00e8 in method: com.android.org.bouncycastle.asn1.x509.KeyUsage.<init>(int):void, dex: \n */\n throw new UnsupportedOperationException(\"Method not decompiled: com.android.org.bouncycastle.asn1.x509.KeyUsage.<init>(int):void\");\n }","title":""},{"docid":"a657b0f84acae179b012947159b3db78","score":"0.5761943","text":"void mo92184b();","title":""},{"docid":"a1483cb59e81616cafe07934cf2a28f5","score":"0.5761417","text":"protected void mo1960i() {\n }","title":""},{"docid":"f5c942ea92788e0cb46fdef84ca4acf6","score":"0.5757071","text":"void mo71702b();","title":""},{"docid":"bdc985831077c1f01c74fbcf52967024","score":"0.5754175","text":"public abstract void mo4674i();","title":""},{"docid":"43a8744f077f56ee66bda22cda2a676e","score":"0.574697","text":"@Override\n\t\t\t\t\tpublic int getCode() {\n\t\t\t\t\t\treturn 0;\n\t\t\t\t\t}","title":""},{"docid":"3e5a964a316f93b5c3765604d833fdc0","score":"0.5746955","text":"private AlbersNAD83() {\n }","title":""},{"docid":"949e79f146a4fe61c7d9c359fcaf7487","score":"0.5745668","text":"public final void mo59418f() {\n }","title":""},{"docid":"8c56ae9345924f372c714cdd7a33ffe3","score":"0.5744941","text":"public final /* bridge */ /* synthetic */ void mo17143c() {\n super.mo17143c();\n }","title":""},{"docid":"b19e063a22eacf2f02344f2aa6e5945b","score":"0.5744654","text":"void mo19434b();","title":""},{"docid":"16170a7948edf0bb8a90dfe0ac4fec33","score":"0.5744596","text":"@Override\n\t\t\tpublic void 짜장면() {\n\t\t\t\t\n\t\t\t}","title":""},{"docid":"d9eebf36f84c2aebf32d48fcbd592353","score":"0.5744109","text":"private GerenciadorImpressao() {\n\t\t\n\t}","title":""},{"docid":"1536d6f34d3d9bf3eac9fdbedfc54b7c","score":"0.5742801","text":"@Override\r\n\t\t\tpublic void m4() {\n\t\t\t\t\r\n\t\t\t}","title":""},{"docid":"348486310633fc6f11713df79e0d523f","score":"0.5741532","text":"public final /* bridge */ /* synthetic */ void mo43569b() {\n super.mo43569b();\n }","title":""}],"string":"[\n {\n \"docid\": \"ff86c3e5dba10aeeb57d62c4db80a220\",\n \"score\": \"0.65839547\",\n \"text\": \"protected abstract Object m8602a();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d93c74d91cdd5fd7d5ba828e7409b39e\",\n \"score\": \"0.64764357\",\n \"text\": \"private AccessPrivate() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6353e85b2aac21fff7db354568309139\",\n \"score\": \"0.64056814\",\n \"text\": \"public abstract void mo1608c();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b4ecae6e31b41ead72d093495b46455a\",\n \"score\": \"0.6256481\",\n \"text\": \"public void mo1410b() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e44716b5ee10b9661605afb83ad4dc2\",\n \"score\": \"0.6250073\",\n \"text\": \"private void priv() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec2afced68195dab79cf8503e6907338\",\n \"score\": \"0.62292695\",\n \"text\": \"protected void mo1628b() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"12fae01a3c575f170627ae223fa8d338\",\n \"score\": \"0.6224761\",\n \"text\": \"@Override\\r\\n\\tprotected int meth() {\\n\\t\\treturn 0;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a0e5ed7432f278f3f68a25243b611a4\",\n \"score\": \"0.6203107\",\n \"text\": \"@Override\\n\\tpublic void aaa03() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"caf707be38711b89c416d3168ee64f54\",\n \"score\": \"0.6195372\",\n \"text\": \"public final void mo9402a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc7d3c901cf5e7cfe613184da88f97df\",\n \"score\": \"0.6190479\",\n \"text\": \"protected abstract void mo6852a();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c9e25ea6f293e2f67da562cd4a0b657\",\n \"score\": \"0.6180488\",\n \"text\": \"public final void mo8553EA() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1def07258eba1244f2eec683b3870c6\",\n \"score\": \"0.6142355\",\n \"text\": \"@Override\\r\\n\\tprotected int absmethod() {\\n\\t\\treturn 0;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dd52b07b3b08ed17e2904774fedab9f5\",\n \"score\": \"0.61405987\",\n \"text\": \"public abstract String mo118446b();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb37f787973670a420102c4c8d309c67\",\n \"score\": \"0.61268806\",\n \"text\": \"public final void mo2302a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"df8a8b96bc759c7b35f1091da9a1db36\",\n \"score\": \"0.6103091\",\n \"text\": \"public abstract void m22895d();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5cc35b6bd51fbaac027143062ffe69f6\",\n \"score\": \"0.60454714\",\n \"text\": \"public final /* bridge */ /* synthetic */ void mo2224c() {\\n super.mo2224c();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c67133d704b7188883ee60fd0de7ceb\",\n \"score\": \"0.6044431\",\n \"text\": \"public abstract void mo42336d();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3def2258601d63c48bf6eff66c59697\",\n \"score\": \"0.6042236\",\n \"text\": \"public void mo12628c() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"afe4974c1bb08d001eb247949dc197ba\",\n \"score\": \"0.60394126\",\n \"text\": \"public void publicar() {\\n throw new UnsupportedOperationException(\\\"Not implemented yet.\\\");\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"767e59894354c09bec55bebb5f362733\",\n \"score\": \"0.60230416\",\n \"text\": \"public abstract void mo30456a();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ecb43b43dd341fa1f1a1570be69f8bd7\",\n \"score\": \"0.60218257\",\n \"text\": \"public final void mo37729c() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c3b3d975dd112cd0977aeae3ca50081\",\n \"score\": \"0.6015697\",\n \"text\": \"public void mo12930a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67a05305786e634a887ca49dde57d6ee\",\n \"score\": \"0.59998226\",\n \"text\": \"public void O000000o() {\\r\\n /*\\r\\n r3 = this;\\r\\n return;\\r\\n */\\r\\n throw new UnsupportedOperationException(\\\"Method not decompiled: defpackage.OO0oO.O000000o():void\\\");\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7839d9b18f833d7ad1ccae8536c829da\",\n \"score\": \"0.5996895\",\n \"text\": \"@Override\\r\\n\\tpublic void zielone_swiatlo() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7194e467f51e022c107531d8614b6a3\",\n \"score\": \"0.59861773\",\n \"text\": \"@Override\\r\\n\\tpublic void anular() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be1ab6202e622f8617fafadfa80e8b14\",\n \"score\": \"0.59852415\",\n \"text\": \"public final /* bridge */ /* synthetic */ void mo43566a() {\\n super.mo43566a();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d95a081a1e6e3117f8617a3fbbbe16fd\",\n \"score\": \"0.59847504\",\n \"text\": \"public void mo3871b() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"381454d78257eeedd56c5a3b2049ee33\",\n \"score\": \"0.5984525\",\n \"text\": \"public abstract void mo2655c();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b55fee510b247cdd8066e542381d90cd\",\n \"score\": \"0.5981179\",\n \"text\": \"public abstract void mo41381a();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e593e5d7fe20e2a9581e3322460d946\",\n \"score\": \"0.59809494\",\n \"text\": \"public abstract void mo2038d();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"84e9ffccaf8a168c13b1abb7ad49748c\",\n \"score\": \"0.59753895\",\n \"text\": \"public abstract C0502p mo2379a();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f355b5e73b7bfae580b4299f081c63a\",\n \"score\": \"0.5975243\",\n \"text\": \"public interface C20497c {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2cc97f340071c93ab12395f2981731ee\",\n \"score\": \"0.59562695\",\n \"text\": \"public void mo25307b() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67ba6866d578f2da58519b2abc75c0ce\",\n \"score\": \"0.59560835\",\n \"text\": \"Set mo42679a();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64abaa4d258c9e042f52fd7249821f80\",\n \"score\": \"0.59546846\",\n \"text\": \"public final /* bridge */ /* synthetic */ void mo43571c() {\\n super.mo43571c();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a00431eee28b38391cb5dfa243729d9\",\n \"score\": \"0.5947284\",\n \"text\": \"public void mo4643a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f09efa926a8aca2056b8d02bc6035ac\",\n \"score\": \"0.59445345\",\n \"text\": \"public interface C0205d {\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7da9ad3ab650b64b3e75012a99c0e238\",\n \"score\": \"0.5928487\",\n \"text\": \"public void mo3866a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"571003ac9a448073df8a023792518814\",\n \"score\": \"0.592612\",\n \"text\": \"public void mo4586b() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e67123e880f8c8124939bb97354e1543\",\n \"score\": \"0.5924617\",\n \"text\": \"@Override\\n public int getCode() {\\n return 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dad58a3f1d65a01c9c0f9bc2e9c15b03\",\n \"score\": \"0.59155273\",\n \"text\": \"public abstract C3897a mo56269d();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cdf542363f5b089e84183e3d9020935f\",\n \"score\": \"0.5903714\",\n \"text\": \"@Override\\n\\t protected void ramana() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e209517a20595deaa191e44a3de94af0\",\n \"score\": \"0.58877325\",\n \"text\": \"protected void method_2832() {\\r\\n super.method_2427(awt.field_4174);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a78c27243b56071570ce9a256848db34\",\n \"score\": \"0.5880474\",\n \"text\": \"public SEL1052() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e7569441400c3ffc6f28860f13c6867\",\n \"score\": \"0.5877874\",\n \"text\": \"public abstract void mo2042g();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"18f07d69021f798ebf980f38f2da8e22\",\n \"score\": \"0.5865658\",\n \"text\": \"public abstract void mo72305i();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa82f6d8543313919e2ed721b176099a\",\n \"score\": \"0.5864205\",\n \"text\": \"public void mo23307a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa82f6d8543313919e2ed721b176099a\",\n \"score\": \"0.5864205\",\n \"text\": \"public void mo23307a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e05565aea6889799a65c06069ccc14f\",\n \"score\": \"0.58538973\",\n \"text\": \"public void mo10690b() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0705d77863f0fa7c516a99a8eca8134\",\n \"score\": \"0.58534145\",\n \"text\": \"private void zbudujSciezkeiRozpocznij() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ff4c5f106ea70f0aa072d2f80489e63\",\n \"score\": \"0.58469456\",\n \"text\": \"public interface C0143OooO0o0 {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b064b6b07b42d5504cafb175edd263f5\",\n \"score\": \"0.5838975\",\n \"text\": \"@Override\\n\\tpublic void aaa01() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2bc34831281e42112e767af680be22a6\",\n \"score\": \"0.5837567\",\n \"text\": \"public abstract void mo16897a();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"486283f9af54553e1a6b672133e1bf30\",\n \"score\": \"0.58373797\",\n \"text\": \"public interface C0803a {\\n /* renamed from: a */\\n void mo4675a();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5667ab17f2769cd60ca85efac21ac76\",\n \"score\": \"0.58363056\",\n \"text\": \"public void mo12627b() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"875b8cee759d2f08821888d5febd7b73\",\n \"score\": \"0.58331746\",\n \"text\": \"public int getSubType()\\r\\n/* 82: */ {\\r\\n/* 83: 73 */ return 0;\\r\\n/* 84: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"010f22a7ce9ba69fa45936fbb81a2c67\",\n \"score\": \"0.5832795\",\n \"text\": \"public abstract void mo4661b();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8e650984d750fb08d1202441a469d81\",\n \"score\": \"0.5832638\",\n \"text\": \"private Ap() \\r\\n\\t{ \\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac073856aff6c0dbf40fe0cd14741c4a\",\n \"score\": \"0.5827924\",\n \"text\": \"@Override\\n public void visitCompoundAccessStatement(CompoundAccessStatement access) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a214d12bf1fc816d34b56cfdeaf3bf3\",\n \"score\": \"0.58274686\",\n \"text\": \"public void mo3771b() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1edfd19457e77f8469601cb65d020e75\",\n \"score\": \"0.5826322\",\n \"text\": \"public abstract void mo1611d();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d893dc0f680980056eb869215843868\",\n \"score\": \"0.5826307\",\n \"text\": \"@Override\\n\\tpublic void m21() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a73ad91ec40e2452fa421d5de2a05be\",\n \"score\": \"0.582346\",\n \"text\": \"private StructAccess()\\r\\n {\\r\\n // Private constructor to prevent instantiation\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"942017b3215e6ca751b90721e3dca9b2\",\n \"score\": \"0.58223826\",\n \"text\": \"public final void mo23900d() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47f6cd4347feebb34b412daee8f8b4ac\",\n \"score\": \"0.5821173\",\n \"text\": \"public interface O000000o {\\r\\n public static final String O00000o = \\\"image_manager_disk_cache\\\";\\r\\n public static final int O00000o0 = 262144000;\\r\\n\\r\\n OO00o00 O000000o();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f87e3e2167a9521e43b3ead8b9003dc\",\n \"score\": \"0.5819902\",\n \"text\": \"private Public() {\\n\\t\\tsuper(\\\"public\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9725d97f1d6af5db196c2a114efe8a16\",\n \"score\": \"0.58195317\",\n \"text\": \"public void mo1088a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc3a08c64e443ee86473be048cb9738a\",\n \"score\": \"0.5817646\",\n \"text\": \"private void smth() {\\n\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e329c8586e25a9d4c4d2dd37a6d8f9f\",\n \"score\": \"0.58170795\",\n \"text\": \"public void mo32535b() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b6d749aac011bf7b6e9802af1e3cee5d\",\n \"score\": \"0.5813447\",\n \"text\": \"@Override\\n\\t\\t\\t\\t\\t\\tpublic int getCode() {\\n\\t\\t\\t\\t\\t\\t\\treturn 0;\\n\\t\\t\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"61fb5581ecf602a70e6981318459e7e2\",\n \"score\": \"0.5809068\",\n \"text\": \"public void mo91720e() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"271cce9d24ea8130668aab58bfab00cf\",\n \"score\": \"0.58077484\",\n \"text\": \"public final void mo37730d() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f52241b0aff9cc519280806d07f619e6\",\n \"score\": \"0.5795511\",\n \"text\": \"protected boolean isAccessible() { return true; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81b496afb7540bb13bd5a754c31378b7\",\n \"score\": \"0.57948214\",\n \"text\": \"public final void mo62159d() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c357029764627aa6c95b473ce094f21\",\n \"score\": \"0.5792171\",\n \"text\": \"@Override\\n public int getAccessLevel() {\\n return 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"90e9be10c2c69543036119c8db74189e\",\n \"score\": \"0.5785751\",\n \"text\": \"public void mo6944a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16c30d73c1df796c0e31e93eb0f6e02e\",\n \"score\": \"0.5784073\",\n \"text\": \"@Override\\r\\n\\tpublic void atacar() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a25fb11f9985c747391822f3903b956d\",\n \"score\": \"0.5783073\",\n \"text\": \"public void mo3222a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca654ad27e8471de3f946a82c61cffb7\",\n \"score\": \"0.5776861\",\n \"text\": \"private final Void m33802a() {\\n throw new C13042b();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b9787eedaf8ab2866634795354c59ac\",\n \"score\": \"0.57753754\",\n \"text\": \"@Override\\n\\tprotected void special() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bde791cb78ce1d6d2a0745225e0176b8\",\n \"score\": \"0.5774926\",\n \"text\": \"public abstract void mo72306j();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"61fb897a2a2b27318913445067a7c070\",\n \"score\": \"0.5774302\",\n \"text\": \"public void mo92534b() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"32622792c46b5467c2ad8a7f3d285f9e\",\n \"score\": \"0.57732767\",\n \"text\": \"public void mo4579b() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe3a27388b67956017a79091ac2808d3\",\n \"score\": \"0.577261\",\n \"text\": \"public final void mo64992b() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3eed32e5f77c41bfcd29cb7bd62517d\",\n \"score\": \"0.57713395\",\n \"text\": \"public void mPri() {\\n\\t\\tSystem.out.println(\\\"INSIDE --> Package Access Modifier, TClassP & Default Method\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b47584148aaec6cbc53bccbff915f72c\",\n \"score\": \"0.57692283\",\n \"text\": \"public void mo1913a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e584d0bc25283bd075aa6f6ebc8ba60\",\n \"score\": \"0.5767352\",\n \"text\": \"private Subtask04() {\\n\\t\\tthrow new UnsupportedOperationException();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"083310bc336fb94ce2e7bccd27705a9f\",\n \"score\": \"0.57620776\",\n \"text\": \"public KeyUsage(int r1) {\\n /*\\n // Can't load method instructions: Load method exception: bogus opcode: 00e8 in method: com.android.org.bouncycastle.asn1.x509.KeyUsage.<init>(int):void, dex: \\n */\\n throw new UnsupportedOperationException(\\\"Method not decompiled: com.android.org.bouncycastle.asn1.x509.KeyUsage.<init>(int):void\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a657b0f84acae179b012947159b3db78\",\n \"score\": \"0.5761943\",\n \"text\": \"void mo92184b();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1483cb59e81616cafe07934cf2a28f5\",\n \"score\": \"0.5761417\",\n \"text\": \"protected void mo1960i() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f5c942ea92788e0cb46fdef84ca4acf6\",\n \"score\": \"0.5757071\",\n \"text\": \"void mo71702b();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bdc985831077c1f01c74fbcf52967024\",\n \"score\": \"0.5754175\",\n \"text\": \"public abstract void mo4674i();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43a8744f077f56ee66bda22cda2a676e\",\n \"score\": \"0.574697\",\n \"text\": \"@Override\\n\\t\\t\\t\\t\\tpublic int getCode() {\\n\\t\\t\\t\\t\\t\\treturn 0;\\n\\t\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e5a964a316f93b5c3765604d833fdc0\",\n \"score\": \"0.5746955\",\n \"text\": \"private AlbersNAD83() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"949e79f146a4fe61c7d9c359fcaf7487\",\n \"score\": \"0.5745668\",\n \"text\": \"public final void mo59418f() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c56ae9345924f372c714cdd7a33ffe3\",\n \"score\": \"0.5744941\",\n \"text\": \"public final /* bridge */ /* synthetic */ void mo17143c() {\\n super.mo17143c();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b19e063a22eacf2f02344f2aa6e5945b\",\n \"score\": \"0.5744654\",\n \"text\": \"void mo19434b();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16170a7948edf0bb8a90dfe0ac4fec33\",\n \"score\": \"0.5744596\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void 짜장면() {\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d9eebf36f84c2aebf32d48fcbd592353\",\n \"score\": \"0.5744109\",\n \"text\": \"private GerenciadorImpressao() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1536d6f34d3d9bf3eac9fdbedfc54b7c\",\n \"score\": \"0.5742801\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void m4() {\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"348486310633fc6f11713df79e0d523f\",\n \"score\": \"0.5741532\",\n \"text\": \"public final /* bridge */ /* synthetic */ void mo43569b() {\\n super.mo43569b();\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985497,"cells":{"query_id":{"kind":"string","value":"2704b67ba3ea26c7eb330f713c37a996"},"query":{"kind":"string","value":"This method was generated by Abator for iBATIS. This method returns the value of the database column TB_IC_CARD_INVOICE_APPLY.RECEIVER_NAME"},"positive_passages":{"kind":"list like","value":[{"docid":"31deec0559278520d6ce07d8ac871c2a","score":"0.637488","text":"public String getReceiverName() {\r\n\t\treturn receiverName;\r\n\t}","title":""}],"string":"[\n {\n \"docid\": \"31deec0559278520d6ce07d8ac871c2a\",\n \"score\": \"0.637488\",\n \"text\": \"public String getReceiverName() {\\r\\n\\t\\treturn receiverName;\\r\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"5b6c8c886868ce2ea5366d894ce51bef","score":"0.64096564","text":"public static String fieldReceiverName() {\r\n\t\treturn \"RECEIVER_NAME\";\r\n\t}","title":""},{"docid":"8799ce4942d1b5b5fc40099e0d294e3f","score":"0.63197726","text":"public String getReceiverName()\n {\n return receiverName;\n }","title":""},{"docid":"04fa05b26521f584bdae03daa8d9c2a2","score":"0.61146873","text":"public java.lang.String getCarrierName()\n {\n synchronized (monitor())\n {\n check_orphaned();\n org.apache.xmlbeans.SimpleValue target = null;\n target = (org.apache.xmlbeans.SimpleValue)get_store().find_element_user(CARRIERNAME$0, 0);\n if (target == null)\n {\n return null;\n }\n return target.getStringValue();\n }\n }","title":""},{"docid":"08aba8f1ec5d5d93d28a189990c1225d","score":"0.5936506","text":"public java.lang.CharSequence getSendereName() {\n return sendereName;\n }","title":""},{"docid":"d7fd9b16c840f9f3ff40cb550457a5cd","score":"0.590461","text":"public java.lang.CharSequence getSendereName() {\n return sendereName;\n }","title":""},{"docid":"e5b19064951014c5972f76fb9ec41e44","score":"0.5886444","text":"public org.apache.xmlbeans.XmlString xgetCarrierName()\n {\n synchronized (monitor())\n {\n check_orphaned();\n org.apache.xmlbeans.XmlString target = null;\n target = (org.apache.xmlbeans.XmlString)get_store().find_element_user(CARRIERNAME$0, 0);\n return target;\n }\n }","title":""},{"docid":"50aa74df3155b53d6a01cc9b2af59db6","score":"0.57748604","text":"public java.lang.String getRecruiterName() {\n java.lang.Object ref = recruiterName_;\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 recruiterName_ = s;\n return s;\n }\n }","title":""},{"docid":"f4c350c1cd817074b590568dc9599b71","score":"0.5766508","text":"public String getReceiver()\n\t{\n\t\treturn m_strReceiver;\n\t}","title":""},{"docid":"f897f44abd4c47fdfde6c24c263728d3","score":"0.5752333","text":"public java.lang.String getRecruiterName() {\n java.lang.Object ref = recruiterName_;\n if (!(ref instanceof java.lang.String)) {\n com.google.protobuf.ByteString bs =\n (com.google.protobuf.ByteString) ref;\n java.lang.String s = bs.toStringUtf8();\n recruiterName_ = s;\n return s;\n } else {\n return (java.lang.String) ref;\n }\n }","title":""},{"docid":"679f72fb7ce65ee753306190f57ccce1","score":"0.5480986","text":"public String getReceiver(String fileID) {\n\t\treturn getAttrbValue(fileID, \"Client_Receiver\");\n\t}","title":""},{"docid":"49c41d75dcf898ad26501e16249a3ae1","score":"0.54488593","text":"java.lang.String getRecipientVaspName();","title":""},{"docid":"6adcf7ef23d87e143623435e45fb0687","score":"0.54106027","text":"String getCrateName();","title":""},{"docid":"61f326be2e7065292d699bc1e1f75520","score":"0.5405063","text":"public com.google.protobuf.ByteString\n getRecruiterNameBytes() {\n java.lang.Object ref = recruiterName_;\n if (ref instanceof String) {\n com.google.protobuf.ByteString b = \n com.google.protobuf.ByteString.copyFromUtf8(\n (java.lang.String) ref);\n recruiterName_ = b;\n return b;\n } else {\n return (com.google.protobuf.ByteString) ref;\n }\n }","title":""},{"docid":"7ed7f30138ecbaf0730230f8ef968ab5","score":"0.5389845","text":"public com.google.protobuf.ByteString\n getRecruiterNameBytes() {\n java.lang.Object ref = recruiterName_;\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 recruiterName_ = b;\n return b;\n } else {\n return (com.google.protobuf.ByteString) ref;\n }\n }","title":""},{"docid":"ebb115f633170525b089ec66f0489147","score":"0.53558505","text":"public String getName() {\n\t\treturn this.customerName ;\n\t}","title":""},{"docid":"a231e2f720cc21eb14b1434be906bcaa","score":"0.5353994","text":"public String getBuyerName() {\n return (String) getAttributeInternal(BUYERNAME);\n }","title":""},{"docid":"8bee29a6072ad40fde3c04dc34a2b00c","score":"0.5328343","text":"public void setReceiverName(String receiverName)\n {\n this.receiverName = receiverName;\n }","title":""},{"docid":"04ae9b48ec788af441ebc2632b54d75f","score":"0.53216624","text":"public String getPayeeName();","title":""},{"docid":"9a65a46b392e686bba119cbc76b03350","score":"0.5308598","text":"public String getReceiver() {\n return receiver;\n }","title":""},{"docid":"9a65a46b392e686bba119cbc76b03350","score":"0.5308598","text":"public String getReceiver() {\n return receiver;\n }","title":""},{"docid":"9a65a46b392e686bba119cbc76b03350","score":"0.5308598","text":"public String getReceiver() {\n return receiver;\n }","title":""},{"docid":"9b77585cece8d59bfc7ec419ec161db2","score":"0.52924997","text":"public void setReceiverName(String receiverName) {\r\n\t\tthis.receiverName = receiverName;\r\n\t}","title":""},{"docid":"0cf080761e01c31cbfaacd1307cb2567","score":"0.52851313","text":"public stride.stakeibc.IcaAccount.ICAAccount getRedemptionAccount() {\n if (redemptionAccountBuilder_ == null) {\n return redemptionAccount_ == null ? stride.stakeibc.IcaAccount.ICAAccount.getDefaultInstance() : redemptionAccount_;\n } else {\n return redemptionAccountBuilder_.getMessage();\n }\n }","title":""},{"docid":"193b334641e642c0250cb2b9269bc53a","score":"0.5274777","text":"String getReceiver();","title":""},{"docid":"193b334641e642c0250cb2b9269bc53a","score":"0.5274777","text":"String getReceiver();","title":""},{"docid":"ee3b6644a7611b083559f3f7dc0a0bdf","score":"0.5261729","text":"public String getAccountsReceivableProcedureRequest() {\n return accountsReceivableProcedureRequest;\n }","title":""},{"docid":"26eb59a81b68782d0d222ee57bf385cb","score":"0.522038","text":"public String getAccountsReceivableProcedureCustomerReference() {\n return accountsReceivableProcedureCustomerReference;\n }","title":""},{"docid":"993bb7f0b6f299556d397b09cdab655e","score":"0.5205395","text":"public String getCorreo() {\n\t\treturn correo;\n\t}","title":""},{"docid":"874be02e38f01e05662f910d45e84859","score":"0.5191038","text":"public com.hp.schemas.SM._7.Common.StringType getCorreoejecutivo() {\n return correoejecutivo;\n }","title":""},{"docid":"cb699db757b66c88582cd1842b94513e","score":"0.51737016","text":"java.lang.String getCardholderName();","title":""},{"docid":"b01b2012f7f9172d22b014baddabdb8b","score":"0.51559937","text":"public Receiver getReceiver() {\r\n\t\treturn receiver;\r\n\t}","title":""},{"docid":"29d30b8cea37033e0283e850a0a56710","score":"0.51460093","text":"@java.lang.Override\n public stride.stakeibc.IcaAccount.ICAAccount getRedemptionAccount() {\n return redemptionAccount_ == null ? stride.stakeibc.IcaAccount.ICAAccount.getDefaultInstance() : redemptionAccount_;\n }","title":""},{"docid":"eb34d2d8e7eb7476686d6c5a2da0af0a","score":"0.5131779","text":"public StrColumn getReceiver() {\n return (StrColumn) (isText ? textFields.computeIfAbsent(\"receiver\", StrColumn::new) :\n getBinaryColumn(\"receiver\"));\n }","title":""},{"docid":"2b10796e9c6a82af6193183713939e18","score":"0.51233935","text":"public String recipientName() {\n return this.recipientName;\n }","title":""},{"docid":"eaf9368a24c782ce4d407e55d06ac4c7","score":"0.51163036","text":"org.apache.xmlbeans.XmlString xgetCardholderName();","title":""},{"docid":"25c0b6c45c6bcb5f2247bdf2e23d4908","score":"0.50832397","text":"public String getLastName() {\r\n return creditCardPaymentData.getLastName();\r\n }","title":""},{"docid":"819e57f71590da5e6473aafc6bb655e9","score":"0.5061127","text":"public String getOriginalReviewerName() {\n return originalReviewerName;\n }","title":""},{"docid":"d20217fc37ae7a22e1d754e8a75dcb95","score":"0.50555813","text":"public java.lang.String getReccomendRepair() {\n\t\treturn reccomendRepair;\n\t}","title":""},{"docid":"e0efd2679b4f13c0ef5183aecf521c71","score":"0.5049592","text":"public String getCorreo() {\n return correo;\n }","title":""},{"docid":"6c9672a5a31671ef0f9af1a2619747db","score":"0.5046056","text":"public java.lang.String getReceiverId() {\n java.lang.Object ref = receiverId_;\n if (!(ref instanceof java.lang.String)) {\n com.google.protobuf.ByteString bs =\n (com.google.protobuf.ByteString) ref;\n java.lang.String s = bs.toStringUtf8();\n receiverId_ = s;\n return s;\n } else {\n return (java.lang.String) ref;\n }\n }","title":""},{"docid":"1cbc6036cb6f9b7c098b611429fe9f69","score":"0.5044607","text":"public String getBuyerName(Integer buyerResId) throws DataServiceException;","title":""},{"docid":"ff0eac266b1fa6fd26ac2f66e9d759c7","score":"0.503313","text":"public java.lang.String getReceivetime () {\n\t\treturn receivetime;\n\t}","title":""},{"docid":"6147220c478b1442cd5eeb4d0266c122","score":"0.5010641","text":"public Receiver getReceiver() {\r\n\t\treturn (Receiver) getSource();\r\n\t}","title":""},{"docid":"9d29fe9d92d56bee4152d27edc0ca7e4","score":"0.50080556","text":"public java.lang.String getCompanyName()\n {\n synchronized (monitor())\n {\n check_orphaned();\n org.apache.xmlbeans.SimpleValue target = null;\n target = (org.apache.xmlbeans.SimpleValue)get_store().find_element_user(COMPANYNAME$0, 0);\n if (target == null)\n {\n return null;\n }\n return target.getStringValue();\n }\n }","title":""},{"docid":"63410848d22e3babb065b9523b7445fd","score":"0.49964613","text":"public String getReceivableExpense() {\n return receivableExpense;\n }","title":""},{"docid":"34d6e113bf532ce5f3a280a9d6dc0c88","score":"0.49851483","text":"public StrColumn getReceiverAddressMail() {\n return (StrColumn) (isText ? textFields.computeIfAbsent(\"receiver_address_mail\", StrColumn::new) :\n getBinaryColumn(\"receiver_address_mail\"));\n }","title":""},{"docid":"6684e677c82dfb498436152699705cb1","score":"0.49764597","text":"public String getRec_revisor() {\n return rec_revisor;\n }","title":""},{"docid":"291c0c225ce149e53dfd962586f037c7","score":"0.49717164","text":"public String getReceiverEmail() {\n\t\treturn receiverEmail;\n\t}","title":""},{"docid":"333402e62c41f55ac1444d4994e4b4bb","score":"0.49716628","text":"public String getCorrelator() {\n return this.correlator;\n }","title":""},{"docid":"22d965416565e088c1cbab871f3ecfdb","score":"0.49702293","text":"public StrColumn getReceiverAddressFax() {\n return (StrColumn) (isText ? textFields.computeIfAbsent(\"receiver_address_fax\", StrColumn::new) :\n getBinaryColumn(\"receiver_address_fax\"));\n }","title":""},{"docid":"79547cc724cb24833c42183f31327600","score":"0.4969657","text":"public String getCorreoElectronico() { return (this.correoElectronico == null) ? \"\" : this.correoElectronico; }","title":""},{"docid":"5c16d7fbf63c8cdd754774cf43315ca1","score":"0.49565366","text":"java.lang.String getCardHolderName();","title":""},{"docid":"cf12c61a94a3316035c13171f5b1b29b","score":"0.49557576","text":"@java.lang.Override\n public java.lang.String getReceiverId() {\n java.lang.Object ref = receiverId_;\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 receiverId_ = s;\n return s;\n }\n }","title":""},{"docid":"04c8acf4e088f06a3fefde99508cd363","score":"0.49500367","text":"public String getAccountsReceivableProcedureCustomerAgreementReference() {\n return accountsReceivableProcedureCustomerAgreementReference;\n }","title":""},{"docid":"57451f9bd567c4a9d81a687ef26b13f3","score":"0.49377337","text":"public String getInvoiceOpenerName() {\r\n\t\treturn invoiceOpenerName;\r\n\t}","title":""},{"docid":"510feecb4aee2f2b9cea931dacb2d988","score":"0.49374452","text":"public String getSenderName()\n {\n return senderName;\n }","title":""},{"docid":"3d4fd3dc4d24ed4b802a027ddfbbeb05","score":"0.49361166","text":"public String getCarrierName() {\n\t\treturn carrierName;\n\t}","title":""},{"docid":"0c4f8a1195d042b00f18afb0b9c94313","score":"0.49225888","text":"public java.lang.String getRecruiterMobile() {\n java.lang.Object ref = recruiterMobile_;\n if (!(ref instanceof java.lang.String)) {\n com.google.protobuf.ByteString bs =\n (com.google.protobuf.ByteString) ref;\n java.lang.String s = bs.toStringUtf8();\n recruiterMobile_ = s;\n return s;\n } else {\n return (java.lang.String) ref;\n }\n }","title":""},{"docid":"0475d8ef745fd5a7b06b4f570154fb39","score":"0.49204126","text":"public static String fieldReceiverPhoneNum() {\r\n\t\treturn \"RECEIVER_PHONE_NUM\";\r\n\t}","title":""},{"docid":"9e18ab111d7d5cf88bd066d2f97d2a39","score":"0.4907746","text":"public static String fieldInvoiceOpenerName() {\r\n\t\treturn \"INVOICE_OPENER_NAME\";\r\n\t}","title":""},{"docid":"02f52cf4b235ac080ab2d76e29bcf5fb","score":"0.4906826","text":"public String getReceiverInterfaceName() {\n\t return ClassName.StringDataValue;\n\t}","title":""},{"docid":"d488ebdff313b2449b5e1c6d88c567fc","score":"0.49066576","text":"public String getCustName() \r\n\t{\r\n\t\treturn custName;\r\n\t}","title":""},{"docid":"f01a54301784e1c710864c664583b4f3","score":"0.490414","text":"public String getReviewerName() {\n return reviewerName;\n }","title":""},{"docid":"7e93c2a922e26ac32b93325929cdc13b","score":"0.49017903","text":"public java.lang.String getContragentname() {\n\treturn contragentname;\n}","title":""},{"docid":"18c0e0422f6284c850f3c884ae5aabce","score":"0.49006626","text":"public String getFirma() {\n\t\treturn this.firma;\n\t}","title":""},{"docid":"2d856471db3bcc07d4720989527a0ed4","score":"0.4898434","text":"public java.lang.String getReconciliationIDAlternate() {\r\n return reconciliationIDAlternate;\r\n }","title":""},{"docid":"fd262ecf0b28c7bb78064006761ec14d","score":"0.48925817","text":"@java.lang.Override\n public stride.stakeibc.IcaAccount.ICAAccountOrBuilder getRedemptionAccountOrBuilder() {\n return getRedemptionAccount();\n }","title":""},{"docid":"c1b74184ae30d97960a7e0750bdedf13","score":"0.48894545","text":"public String getReceiverPhoneNum() {\r\n\t\treturn receiverPhoneNum;\r\n\t}","title":""},{"docid":"8c73c38640a72f091f227850347d91ee","score":"0.48864543","text":"String getReservationName();","title":""},{"docid":"af1cb4b678380a35005dca9e22d76c84","score":"0.48850206","text":"@Override\n\tpublic java.lang.String getSurname() {\n\t\treturn _details.getSurname();\n\t}","title":""},{"docid":"a4dad90cfa1c918c516c0c0099e38ff1","score":"0.48755065","text":"public java.lang.String getRecruiterMobile() {\n java.lang.Object ref = recruiterMobile_;\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 recruiterMobile_ = s;\n return s;\n }\n }","title":""},{"docid":"ae4cec5bb6eb7087ee08e744d5944576","score":"0.4865442","text":"public StrColumn getReceiverAddressEmail() {\n return (StrColumn) (isText ? textFields.computeIfAbsent(\"receiver_address_email\", StrColumn::new) :\n getBinaryColumn(\"receiver_address_email\"));\n }","title":""},{"docid":"93559b5c25393b7cff932850329a9aba","score":"0.48535064","text":"public String getNameofpersonincharge() {\n return nameofpersonincharge;\n }","title":""},{"docid":"19cae91453780ca3bba675b526a80c6d","score":"0.48529273","text":"public String recebe() {\n\t\treturn null;\n\t}","title":""},{"docid":"3d4842e5128b725f346380691fb48167","score":"0.4849547","text":"public String getCustomer_name() {\r\n return customer_name;\r\n }","title":""},{"docid":"58ff1e809375a700dfac7477d2ce0f9e","score":"0.48408815","text":"public java.lang.String getReconciliationID() {\r\n return reconciliationID;\r\n }","title":""},{"docid":"58ff1e809375a700dfac7477d2ce0f9e","score":"0.48408815","text":"public java.lang.String getReconciliationID() {\r\n return reconciliationID;\r\n }","title":""},{"docid":"8c9dbbad0b536efd0874a4f8feb0ef82","score":"0.48394534","text":"public String getFirstName() {\r\n return creditCardPaymentData.getFirstName();\r\n }","title":""},{"docid":"e74e9279992a3aa8ff12bc1d649ae74b","score":"0.48323968","text":"public String getTxnPrmryRefNo();","title":""},{"docid":"9745efa7fdddd381e182a4a91599b602","score":"0.48222834","text":"public String getCustomerName()\n\t{\n\t\treturn customerName;\n\t}","title":""},{"docid":"9a31acb05aded1b567ac84e9fff43abc","score":"0.48131943","text":"public Receiver getReceiver() {\n return receiver;\n }","title":""},{"docid":"b1fb973f9d3ab3e1e60389ce63845164","score":"0.48104814","text":"public\t\tString\t\tgetName()\n\t\t{\n\t\tswitch (howToReorder)\n\t\t\t{\n\t\t\tcase BRING_TO_FRONT :\n\t\t\t\treturn(Mi_BRING_TO_FRONT_DISPLAY_NAME);\n\t\t\tcase SEND_TO_BACK :\n\t\t\t\treturn(Mi_SEND_TO_BACK_DISPLAY_NAME);\n\t\t\tcase BRING_FORWARD :\n\t\t\t\treturn(Mi_BRING_FORWARD_DISPLAY_NAME);\n\t\t\tcase SEND_BACKWARD :\n\t\t\t\treturn(Mi_SEND_BACKWARD_DISPLAY_NAME);\n\t\t\tdefault:\n\t\t\t\treturn(null);\n\t\t\t}\n\t\t}","title":""},{"docid":"f97beecb0ef50d4c503fe5673c340a5b","score":"0.48103973","text":"public String getCustName() {\r\n\t\treturn custName;\r\n\t}","title":""},{"docid":"609750afb14583f43a406db69b29d203","score":"0.48032513","text":"public StrColumn getResName() {\n return delegate.getColumn(\"res_name\", DelegatingStrColumn::new);\n }","title":""},{"docid":"e65269a7f0cc1f8173c333103e0a23a5","score":"0.4789564","text":"public BigDecimal getReceivable() {\r\n\t\treturn receivable;\r\n\t}","title":""},{"docid":"27cff824cbf1edbe37bbcd09b73fefac","score":"0.47878677","text":"public String getOrder_return_employee_name() {\n return order_return_employee_name;\n }","title":""},{"docid":"0a0150101eaf2515dba68de3b2c8a837","score":"0.4787691","text":"String getServiceItemName();","title":""},{"docid":"42f736371f4a1f6a82f85b44fbb07b45","score":"0.4787525","text":"private void getReceiverDetails() {\n Intent intent = getIntent();\n if (intent == null) {\n closeOnError();\n }\n if (intent != null) {\n Bundle data = intent.getExtras();\n if (data != null) {\n receiverId = data.getString(Constants.USER_ID_TAG);\n receiverDp = data.getString(Constants.USER_DP_TAG);\n receiverName = data.getString(Constants.INTENT_NAME_TAG);\n } else {\n closeOnError();\n }\n }\n }","title":""},{"docid":"913d31028ec79459eba77691fd79a54b","score":"0.47854966","text":"public String receiverApplicationId() {\n return this.receiverApplicationId;\n }","title":""},{"docid":"77659cc0fd0c0bf5754a8534840f390a","score":"0.4784341","text":"public static String fieldReceiverAreaId() {\r\n\t\treturn \"RECEIVER_AREA_ID\";\r\n\t}","title":""},{"docid":"88e222e59e4ae5751165c1f2e3b37a5a","score":"0.4783339","text":"public String getCorreo(){\r\n return correo;\r\n }","title":""},{"docid":"964ea630f05e7a987b0ca7dd61e0eace","score":"0.47818682","text":"public String\n getRotoApprovalName()\n {\n return getRotoApprovalName(\"ALL\"); \n }","title":""},{"docid":"bc5469f9c1c6904429d35f8e39d2a9fe","score":"0.47811875","text":"public String getCorreo(){\r\n return Correo;\r\n }","title":""},{"docid":"d61830ee078002acd27d027dbc396ace","score":"0.47788563","text":"@AutoEscape\n\tpublic String getContactName();","title":""},{"docid":"53c435da1f88dc3c0d816f213b0c4184","score":"0.47786036","text":"public org.apache.xmlbeans.XmlString xgetCompanyName()\n {\n synchronized (monitor())\n {\n check_orphaned();\n org.apache.xmlbeans.XmlString target = null;\n target = (org.apache.xmlbeans.XmlString)get_store().find_element_user(COMPANYNAME$0, 0);\n return target;\n }\n }","title":""},{"docid":"91a778188ebd86c3f67a0c02734c9697","score":"0.47781187","text":"public static Object $$$StrMEDPrescriptionPatientSurname(mContext m$) {\n return (m$.fnc$(\"COMConst.GetPropertyName\",\"MEDPrescription\",16));\n }","title":""},{"docid":"7fc5cd7fb1811cc4500b7bf31c528336","score":"0.47755277","text":"public java.lang.String getName() throws java.rmi.RemoteException;","title":""},{"docid":"ebd2539f90ced6836a5eb3cd8c74c947","score":"0.47744444","text":"public String getAccountsReceivableProcedureReference() {\n return accountsReceivableProcedureReference;\n }","title":""},{"docid":"4a5ece956f5fdbf9ab404665fa2dda51","score":"0.47712559","text":"public String getAccountsReceivableProcedureBusinessUnitReference() {\n return accountsReceivableProcedureBusinessUnitReference;\n }","title":""},{"docid":"4d7a63c2a417e0dd6b8ccde3ad91057b","score":"0.47690132","text":"private String getNameFromContact(Intent intent) {\n\t\tCursor phoneNrCsr = getContentResolver().query(intent.getData(), null, null, null, null); \t//Przygotowanie kursora\r\n\r\n\t\tphoneNrCsr.moveToFirst();\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t//Przesuniecie wczesniej utworzonego kursora\r\n\t\tint contactId = phoneNrCsr.getColumnIndex(ContactsContract.Contacts.DISPLAY_NAME);\t\t\t//Pobranie id dla konkretnego kontaktu\r\n\t\tString contactName = phoneNrCsr.getString(contactId);\t\t\t\t\t\t\t\t\t\t//Pobranie nazwy kontaktu na podstawie id\r\n\t\tphoneNrCsr.close();\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t//Zwolnienie wykorzystywanego kursora\r\n\t\treturn contactName;\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t//Zwrócenie nazwy kontaktu\r\n\t}","title":""}],"string":"[\n {\n \"docid\": \"5b6c8c886868ce2ea5366d894ce51bef\",\n \"score\": \"0.64096564\",\n \"text\": \"public static String fieldReceiverName() {\\r\\n\\t\\treturn \\\"RECEIVER_NAME\\\";\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8799ce4942d1b5b5fc40099e0d294e3f\",\n \"score\": \"0.63197726\",\n \"text\": \"public String getReceiverName()\\n {\\n return receiverName;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04fa05b26521f584bdae03daa8d9c2a2\",\n \"score\": \"0.61146873\",\n \"text\": \"public java.lang.String getCarrierName()\\n {\\n synchronized (monitor())\\n {\\n check_orphaned();\\n org.apache.xmlbeans.SimpleValue target = null;\\n target = (org.apache.xmlbeans.SimpleValue)get_store().find_element_user(CARRIERNAME$0, 0);\\n if (target == null)\\n {\\n return null;\\n }\\n return target.getStringValue();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"08aba8f1ec5d5d93d28a189990c1225d\",\n \"score\": \"0.5936506\",\n \"text\": \"public java.lang.CharSequence getSendereName() {\\n return sendereName;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7fd9b16c840f9f3ff40cb550457a5cd\",\n \"score\": \"0.590461\",\n \"text\": \"public java.lang.CharSequence getSendereName() {\\n return sendereName;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5b19064951014c5972f76fb9ec41e44\",\n \"score\": \"0.5886444\",\n \"text\": \"public org.apache.xmlbeans.XmlString xgetCarrierName()\\n {\\n synchronized (monitor())\\n {\\n check_orphaned();\\n org.apache.xmlbeans.XmlString target = null;\\n target = (org.apache.xmlbeans.XmlString)get_store().find_element_user(CARRIERNAME$0, 0);\\n return target;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"50aa74df3155b53d6a01cc9b2af59db6\",\n \"score\": \"0.57748604\",\n \"text\": \"public java.lang.String getRecruiterName() {\\n java.lang.Object ref = recruiterName_;\\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 recruiterName_ = s;\\n return s;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f4c350c1cd817074b590568dc9599b71\",\n \"score\": \"0.5766508\",\n \"text\": \"public String getReceiver()\\n\\t{\\n\\t\\treturn m_strReceiver;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f897f44abd4c47fdfde6c24c263728d3\",\n \"score\": \"0.5752333\",\n \"text\": \"public java.lang.String getRecruiterName() {\\n java.lang.Object ref = recruiterName_;\\n if (!(ref instanceof java.lang.String)) {\\n com.google.protobuf.ByteString bs =\\n (com.google.protobuf.ByteString) ref;\\n java.lang.String s = bs.toStringUtf8();\\n recruiterName_ = s;\\n return s;\\n } else {\\n return (java.lang.String) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"679f72fb7ce65ee753306190f57ccce1\",\n \"score\": \"0.5480986\",\n \"text\": \"public String getReceiver(String fileID) {\\n\\t\\treturn getAttrbValue(fileID, \\\"Client_Receiver\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49c41d75dcf898ad26501e16249a3ae1\",\n \"score\": \"0.54488593\",\n \"text\": \"java.lang.String getRecipientVaspName();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6adcf7ef23d87e143623435e45fb0687\",\n \"score\": \"0.54106027\",\n \"text\": \"String getCrateName();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"61f326be2e7065292d699bc1e1f75520\",\n \"score\": \"0.5405063\",\n \"text\": \"public com.google.protobuf.ByteString\\n getRecruiterNameBytes() {\\n java.lang.Object ref = recruiterName_;\\n if (ref instanceof String) {\\n com.google.protobuf.ByteString b = \\n com.google.protobuf.ByteString.copyFromUtf8(\\n (java.lang.String) ref);\\n recruiterName_ = b;\\n return b;\\n } else {\\n return (com.google.protobuf.ByteString) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ed7f30138ecbaf0730230f8ef968ab5\",\n \"score\": \"0.5389845\",\n \"text\": \"public com.google.protobuf.ByteString\\n getRecruiterNameBytes() {\\n java.lang.Object ref = recruiterName_;\\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 recruiterName_ = b;\\n return b;\\n } else {\\n return (com.google.protobuf.ByteString) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebb115f633170525b089ec66f0489147\",\n \"score\": \"0.53558505\",\n \"text\": \"public String getName() {\\n\\t\\treturn this.customerName ;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a231e2f720cc21eb14b1434be906bcaa\",\n \"score\": \"0.5353994\",\n \"text\": \"public String getBuyerName() {\\n return (String) getAttributeInternal(BUYERNAME);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bee29a6072ad40fde3c04dc34a2b00c\",\n \"score\": \"0.5328343\",\n \"text\": \"public void setReceiverName(String receiverName)\\n {\\n this.receiverName = receiverName;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04ae9b48ec788af441ebc2632b54d75f\",\n \"score\": \"0.53216624\",\n \"text\": \"public String getPayeeName();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a65a46b392e686bba119cbc76b03350\",\n \"score\": \"0.5308598\",\n \"text\": \"public String getReceiver() {\\n return receiver;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a65a46b392e686bba119cbc76b03350\",\n \"score\": \"0.5308598\",\n \"text\": \"public String getReceiver() {\\n return receiver;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a65a46b392e686bba119cbc76b03350\",\n \"score\": \"0.5308598\",\n \"text\": \"public String getReceiver() {\\n return receiver;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b77585cece8d59bfc7ec419ec161db2\",\n \"score\": \"0.52924997\",\n \"text\": \"public void setReceiverName(String receiverName) {\\r\\n\\t\\tthis.receiverName = receiverName;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0cf080761e01c31cbfaacd1307cb2567\",\n \"score\": \"0.52851313\",\n \"text\": \"public stride.stakeibc.IcaAccount.ICAAccount getRedemptionAccount() {\\n if (redemptionAccountBuilder_ == null) {\\n return redemptionAccount_ == null ? stride.stakeibc.IcaAccount.ICAAccount.getDefaultInstance() : redemptionAccount_;\\n } else {\\n return redemptionAccountBuilder_.getMessage();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"193b334641e642c0250cb2b9269bc53a\",\n \"score\": \"0.5274777\",\n \"text\": \"String getReceiver();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"193b334641e642c0250cb2b9269bc53a\",\n \"score\": \"0.5274777\",\n \"text\": \"String getReceiver();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee3b6644a7611b083559f3f7dc0a0bdf\",\n \"score\": \"0.5261729\",\n \"text\": \"public String getAccountsReceivableProcedureRequest() {\\n return accountsReceivableProcedureRequest;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26eb59a81b68782d0d222ee57bf385cb\",\n \"score\": \"0.522038\",\n \"text\": \"public String getAccountsReceivableProcedureCustomerReference() {\\n return accountsReceivableProcedureCustomerReference;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"993bb7f0b6f299556d397b09cdab655e\",\n \"score\": \"0.5205395\",\n \"text\": \"public String getCorreo() {\\n\\t\\treturn correo;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"874be02e38f01e05662f910d45e84859\",\n \"score\": \"0.5191038\",\n \"text\": \"public com.hp.schemas.SM._7.Common.StringType getCorreoejecutivo() {\\n return correoejecutivo;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb699db757b66c88582cd1842b94513e\",\n \"score\": \"0.51737016\",\n \"text\": \"java.lang.String getCardholderName();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b01b2012f7f9172d22b014baddabdb8b\",\n \"score\": \"0.51559937\",\n \"text\": \"public Receiver getReceiver() {\\r\\n\\t\\treturn receiver;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"29d30b8cea37033e0283e850a0a56710\",\n \"score\": \"0.51460093\",\n \"text\": \"@java.lang.Override\\n public stride.stakeibc.IcaAccount.ICAAccount getRedemptionAccount() {\\n return redemptionAccount_ == null ? stride.stakeibc.IcaAccount.ICAAccount.getDefaultInstance() : redemptionAccount_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb34d2d8e7eb7476686d6c5a2da0af0a\",\n \"score\": \"0.5131779\",\n \"text\": \"public StrColumn getReceiver() {\\n return (StrColumn) (isText ? textFields.computeIfAbsent(\\\"receiver\\\", StrColumn::new) :\\n getBinaryColumn(\\\"receiver\\\"));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b10796e9c6a82af6193183713939e18\",\n \"score\": \"0.51233935\",\n \"text\": \"public String recipientName() {\\n return this.recipientName;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eaf9368a24c782ce4d407e55d06ac4c7\",\n \"score\": \"0.51163036\",\n \"text\": \"org.apache.xmlbeans.XmlString xgetCardholderName();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"25c0b6c45c6bcb5f2247bdf2e23d4908\",\n \"score\": \"0.50832397\",\n \"text\": \"public String getLastName() {\\r\\n return creditCardPaymentData.getLastName();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"819e57f71590da5e6473aafc6bb655e9\",\n \"score\": \"0.5061127\",\n \"text\": \"public String getOriginalReviewerName() {\\n return originalReviewerName;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d20217fc37ae7a22e1d754e8a75dcb95\",\n \"score\": \"0.50555813\",\n \"text\": \"public java.lang.String getReccomendRepair() {\\n\\t\\treturn reccomendRepair;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0efd2679b4f13c0ef5183aecf521c71\",\n \"score\": \"0.5049592\",\n \"text\": \"public String getCorreo() {\\n return correo;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c9672a5a31671ef0f9af1a2619747db\",\n \"score\": \"0.5046056\",\n \"text\": \"public java.lang.String getReceiverId() {\\n java.lang.Object ref = receiverId_;\\n if (!(ref instanceof java.lang.String)) {\\n com.google.protobuf.ByteString bs =\\n (com.google.protobuf.ByteString) ref;\\n java.lang.String s = bs.toStringUtf8();\\n receiverId_ = s;\\n return s;\\n } else {\\n return (java.lang.String) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1cbc6036cb6f9b7c098b611429fe9f69\",\n \"score\": \"0.5044607\",\n \"text\": \"public String getBuyerName(Integer buyerResId) throws DataServiceException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff0eac266b1fa6fd26ac2f66e9d759c7\",\n \"score\": \"0.503313\",\n \"text\": \"public java.lang.String getReceivetime () {\\n\\t\\treturn receivetime;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6147220c478b1442cd5eeb4d0266c122\",\n \"score\": \"0.5010641\",\n \"text\": \"public Receiver getReceiver() {\\r\\n\\t\\treturn (Receiver) getSource();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d29fe9d92d56bee4152d27edc0ca7e4\",\n \"score\": \"0.50080556\",\n \"text\": \"public java.lang.String getCompanyName()\\n {\\n synchronized (monitor())\\n {\\n check_orphaned();\\n org.apache.xmlbeans.SimpleValue target = null;\\n target = (org.apache.xmlbeans.SimpleValue)get_store().find_element_user(COMPANYNAME$0, 0);\\n if (target == null)\\n {\\n return null;\\n }\\n return target.getStringValue();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63410848d22e3babb065b9523b7445fd\",\n \"score\": \"0.49964613\",\n \"text\": \"public String getReceivableExpense() {\\n return receivableExpense;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"34d6e113bf532ce5f3a280a9d6dc0c88\",\n \"score\": \"0.49851483\",\n \"text\": \"public StrColumn getReceiverAddressMail() {\\n return (StrColumn) (isText ? textFields.computeIfAbsent(\\\"receiver_address_mail\\\", StrColumn::new) :\\n getBinaryColumn(\\\"receiver_address_mail\\\"));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6684e677c82dfb498436152699705cb1\",\n \"score\": \"0.49764597\",\n \"text\": \"public String getRec_revisor() {\\n return rec_revisor;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"291c0c225ce149e53dfd962586f037c7\",\n \"score\": \"0.49717164\",\n \"text\": \"public String getReceiverEmail() {\\n\\t\\treturn receiverEmail;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"333402e62c41f55ac1444d4994e4b4bb\",\n \"score\": \"0.49716628\",\n \"text\": \"public String getCorrelator() {\\n return this.correlator;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"22d965416565e088c1cbab871f3ecfdb\",\n \"score\": \"0.49702293\",\n \"text\": \"public StrColumn getReceiverAddressFax() {\\n return (StrColumn) (isText ? textFields.computeIfAbsent(\\\"receiver_address_fax\\\", StrColumn::new) :\\n getBinaryColumn(\\\"receiver_address_fax\\\"));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"79547cc724cb24833c42183f31327600\",\n \"score\": \"0.4969657\",\n \"text\": \"public String getCorreoElectronico() { return (this.correoElectronico == null) ? \\\"\\\" : this.correoElectronico; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c16d7fbf63c8cdd754774cf43315ca1\",\n \"score\": \"0.49565366\",\n \"text\": \"java.lang.String getCardHolderName();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cf12c61a94a3316035c13171f5b1b29b\",\n \"score\": \"0.49557576\",\n \"text\": \"@java.lang.Override\\n public java.lang.String getReceiverId() {\\n java.lang.Object ref = receiverId_;\\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 receiverId_ = s;\\n return s;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04c8acf4e088f06a3fefde99508cd363\",\n \"score\": \"0.49500367\",\n \"text\": \"public String getAccountsReceivableProcedureCustomerAgreementReference() {\\n return accountsReceivableProcedureCustomerAgreementReference;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57451f9bd567c4a9d81a687ef26b13f3\",\n \"score\": \"0.49377337\",\n \"text\": \"public String getInvoiceOpenerName() {\\r\\n\\t\\treturn invoiceOpenerName;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"510feecb4aee2f2b9cea931dacb2d988\",\n \"score\": \"0.49374452\",\n \"text\": \"public String getSenderName()\\n {\\n return senderName;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d4fd3dc4d24ed4b802a027ddfbbeb05\",\n \"score\": \"0.49361166\",\n \"text\": \"public String getCarrierName() {\\n\\t\\treturn carrierName;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c4f8a1195d042b00f18afb0b9c94313\",\n \"score\": \"0.49225888\",\n \"text\": \"public java.lang.String getRecruiterMobile() {\\n java.lang.Object ref = recruiterMobile_;\\n if (!(ref instanceof java.lang.String)) {\\n com.google.protobuf.ByteString bs =\\n (com.google.protobuf.ByteString) ref;\\n java.lang.String s = bs.toStringUtf8();\\n recruiterMobile_ = s;\\n return s;\\n } else {\\n return (java.lang.String) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0475d8ef745fd5a7b06b4f570154fb39\",\n \"score\": \"0.49204126\",\n \"text\": \"public static String fieldReceiverPhoneNum() {\\r\\n\\t\\treturn \\\"RECEIVER_PHONE_NUM\\\";\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e18ab111d7d5cf88bd066d2f97d2a39\",\n \"score\": \"0.4907746\",\n \"text\": \"public static String fieldInvoiceOpenerName() {\\r\\n\\t\\treturn \\\"INVOICE_OPENER_NAME\\\";\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02f52cf4b235ac080ab2d76e29bcf5fb\",\n \"score\": \"0.4906826\",\n \"text\": \"public String getReceiverInterfaceName() {\\n\\t return ClassName.StringDataValue;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d488ebdff313b2449b5e1c6d88c567fc\",\n \"score\": \"0.49066576\",\n \"text\": \"public String getCustName() \\r\\n\\t{\\r\\n\\t\\treturn custName;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f01a54301784e1c710864c664583b4f3\",\n \"score\": \"0.490414\",\n \"text\": \"public String getReviewerName() {\\n return reviewerName;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e93c2a922e26ac32b93325929cdc13b\",\n \"score\": \"0.49017903\",\n \"text\": \"public java.lang.String getContragentname() {\\n\\treturn contragentname;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"18c0e0422f6284c850f3c884ae5aabce\",\n \"score\": \"0.49006626\",\n \"text\": \"public String getFirma() {\\n\\t\\treturn this.firma;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d856471db3bcc07d4720989527a0ed4\",\n \"score\": \"0.4898434\",\n \"text\": \"public java.lang.String getReconciliationIDAlternate() {\\r\\n return reconciliationIDAlternate;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd262ecf0b28c7bb78064006761ec14d\",\n \"score\": \"0.48925817\",\n \"text\": \"@java.lang.Override\\n public stride.stakeibc.IcaAccount.ICAAccountOrBuilder getRedemptionAccountOrBuilder() {\\n return getRedemptionAccount();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c1b74184ae30d97960a7e0750bdedf13\",\n \"score\": \"0.48894545\",\n \"text\": \"public String getReceiverPhoneNum() {\\r\\n\\t\\treturn receiverPhoneNum;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c73c38640a72f091f227850347d91ee\",\n \"score\": \"0.48864543\",\n \"text\": \"String getReservationName();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af1cb4b678380a35005dca9e22d76c84\",\n \"score\": \"0.48850206\",\n \"text\": \"@Override\\n\\tpublic java.lang.String getSurname() {\\n\\t\\treturn _details.getSurname();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4dad90cfa1c918c516c0c0099e38ff1\",\n \"score\": \"0.48755065\",\n \"text\": \"public java.lang.String getRecruiterMobile() {\\n java.lang.Object ref = recruiterMobile_;\\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 recruiterMobile_ = s;\\n return s;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae4cec5bb6eb7087ee08e744d5944576\",\n \"score\": \"0.4865442\",\n \"text\": \"public StrColumn getReceiverAddressEmail() {\\n return (StrColumn) (isText ? textFields.computeIfAbsent(\\\"receiver_address_email\\\", StrColumn::new) :\\n getBinaryColumn(\\\"receiver_address_email\\\"));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"93559b5c25393b7cff932850329a9aba\",\n \"score\": \"0.48535064\",\n \"text\": \"public String getNameofpersonincharge() {\\n return nameofpersonincharge;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19cae91453780ca3bba675b526a80c6d\",\n \"score\": \"0.48529273\",\n \"text\": \"public String recebe() {\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d4842e5128b725f346380691fb48167\",\n \"score\": \"0.4849547\",\n \"text\": \"public String getCustomer_name() {\\r\\n return customer_name;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58ff1e809375a700dfac7477d2ce0f9e\",\n \"score\": \"0.48408815\",\n \"text\": \"public java.lang.String getReconciliationID() {\\r\\n return reconciliationID;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58ff1e809375a700dfac7477d2ce0f9e\",\n \"score\": \"0.48408815\",\n \"text\": \"public java.lang.String getReconciliationID() {\\r\\n return reconciliationID;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c9dbbad0b536efd0874a4f8feb0ef82\",\n \"score\": \"0.48394534\",\n \"text\": \"public String getFirstName() {\\r\\n return creditCardPaymentData.getFirstName();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e74e9279992a3aa8ff12bc1d649ae74b\",\n \"score\": \"0.48323968\",\n \"text\": \"public String getTxnPrmryRefNo();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9745efa7fdddd381e182a4a91599b602\",\n \"score\": \"0.48222834\",\n \"text\": \"public String getCustomerName()\\n\\t{\\n\\t\\treturn customerName;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a31acb05aded1b567ac84e9fff43abc\",\n \"score\": \"0.48131943\",\n \"text\": \"public Receiver getReceiver() {\\n return receiver;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1fb973f9d3ab3e1e60389ce63845164\",\n \"score\": \"0.48104814\",\n \"text\": \"public\\t\\tString\\t\\tgetName()\\n\\t\\t{\\n\\t\\tswitch (howToReorder)\\n\\t\\t\\t{\\n\\t\\t\\tcase BRING_TO_FRONT :\\n\\t\\t\\t\\treturn(Mi_BRING_TO_FRONT_DISPLAY_NAME);\\n\\t\\t\\tcase SEND_TO_BACK :\\n\\t\\t\\t\\treturn(Mi_SEND_TO_BACK_DISPLAY_NAME);\\n\\t\\t\\tcase BRING_FORWARD :\\n\\t\\t\\t\\treturn(Mi_BRING_FORWARD_DISPLAY_NAME);\\n\\t\\t\\tcase SEND_BACKWARD :\\n\\t\\t\\t\\treturn(Mi_SEND_BACKWARD_DISPLAY_NAME);\\n\\t\\t\\tdefault:\\n\\t\\t\\t\\treturn(null);\\n\\t\\t\\t}\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f97beecb0ef50d4c503fe5673c340a5b\",\n \"score\": \"0.48103973\",\n \"text\": \"public String getCustName() {\\r\\n\\t\\treturn custName;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"609750afb14583f43a406db69b29d203\",\n \"score\": \"0.48032513\",\n \"text\": \"public StrColumn getResName() {\\n return delegate.getColumn(\\\"res_name\\\", DelegatingStrColumn::new);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e65269a7f0cc1f8173c333103e0a23a5\",\n \"score\": \"0.4789564\",\n \"text\": \"public BigDecimal getReceivable() {\\r\\n\\t\\treturn receivable;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27cff824cbf1edbe37bbcd09b73fefac\",\n \"score\": \"0.47878677\",\n \"text\": \"public String getOrder_return_employee_name() {\\n return order_return_employee_name;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a0150101eaf2515dba68de3b2c8a837\",\n \"score\": \"0.4787691\",\n \"text\": \"String getServiceItemName();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"42f736371f4a1f6a82f85b44fbb07b45\",\n \"score\": \"0.4787525\",\n \"text\": \"private void getReceiverDetails() {\\n Intent intent = getIntent();\\n if (intent == null) {\\n closeOnError();\\n }\\n if (intent != null) {\\n Bundle data = intent.getExtras();\\n if (data != null) {\\n receiverId = data.getString(Constants.USER_ID_TAG);\\n receiverDp = data.getString(Constants.USER_DP_TAG);\\n receiverName = data.getString(Constants.INTENT_NAME_TAG);\\n } else {\\n closeOnError();\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"913d31028ec79459eba77691fd79a54b\",\n \"score\": \"0.47854966\",\n \"text\": \"public String receiverApplicationId() {\\n return this.receiverApplicationId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77659cc0fd0c0bf5754a8534840f390a\",\n \"score\": \"0.4784341\",\n \"text\": \"public static String fieldReceiverAreaId() {\\r\\n\\t\\treturn \\\"RECEIVER_AREA_ID\\\";\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"88e222e59e4ae5751165c1f2e3b37a5a\",\n \"score\": \"0.4783339\",\n \"text\": \"public String getCorreo(){\\r\\n return correo;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"964ea630f05e7a987b0ca7dd61e0eace\",\n \"score\": \"0.47818682\",\n \"text\": \"public String\\n getRotoApprovalName()\\n {\\n return getRotoApprovalName(\\\"ALL\\\"); \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc5469f9c1c6904429d35f8e39d2a9fe\",\n \"score\": \"0.47811875\",\n \"text\": \"public String getCorreo(){\\r\\n return Correo;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d61830ee078002acd27d027dbc396ace\",\n \"score\": \"0.47788563\",\n \"text\": \"@AutoEscape\\n\\tpublic String getContactName();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"53c435da1f88dc3c0d816f213b0c4184\",\n \"score\": \"0.47786036\",\n \"text\": \"public org.apache.xmlbeans.XmlString xgetCompanyName()\\n {\\n synchronized (monitor())\\n {\\n check_orphaned();\\n org.apache.xmlbeans.XmlString target = null;\\n target = (org.apache.xmlbeans.XmlString)get_store().find_element_user(COMPANYNAME$0, 0);\\n return target;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"91a778188ebd86c3f67a0c02734c9697\",\n \"score\": \"0.47781187\",\n \"text\": \"public static Object $$$StrMEDPrescriptionPatientSurname(mContext m$) {\\n return (m$.fnc$(\\\"COMConst.GetPropertyName\\\",\\\"MEDPrescription\\\",16));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7fc5cd7fb1811cc4500b7bf31c528336\",\n \"score\": \"0.47755277\",\n \"text\": \"public java.lang.String getName() throws java.rmi.RemoteException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebd2539f90ced6836a5eb3cd8c74c947\",\n \"score\": \"0.47744444\",\n \"text\": \"public String getAccountsReceivableProcedureReference() {\\n return accountsReceivableProcedureReference;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a5ece956f5fdbf9ab404665fa2dda51\",\n \"score\": \"0.47712559\",\n \"text\": \"public String getAccountsReceivableProcedureBusinessUnitReference() {\\n return accountsReceivableProcedureBusinessUnitReference;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d7a63c2a417e0dd6b8ccde3ad91057b\",\n \"score\": \"0.47690132\",\n \"text\": \"private String getNameFromContact(Intent intent) {\\n\\t\\tCursor phoneNrCsr = getContentResolver().query(intent.getData(), null, null, null, null); \\t//Przygotowanie kursora\\r\\n\\r\\n\\t\\tphoneNrCsr.moveToFirst();\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//Przesuniecie wczesniej utworzonego kursora\\r\\n\\t\\tint contactId = phoneNrCsr.getColumnIndex(ContactsContract.Contacts.DISPLAY_NAME);\\t\\t\\t//Pobranie id dla konkretnego kontaktu\\r\\n\\t\\tString contactName = phoneNrCsr.getString(contactId);\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//Pobranie nazwy kontaktu na podstawie id\\r\\n\\t\\tphoneNrCsr.close();\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//Zwolnienie wykorzystywanego kursora\\r\\n\\t\\treturn contactName;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//Zwrócenie nazwy kontaktu\\r\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985498,"cells":{"query_id":{"kind":"string","value":"e98e9915c6bf82addbb1b1e5e0a39a09"},"query":{"kind":"string","value":"permite cerrar la ventana de editar y crear"},"positive_passages":{"kind":"list like","value":[{"docid":"3ad8e14387d90032347f3e2c01cdb34f","score":"0.0","text":"@FXML\n\tprivate void cancelar() {\n\t\tescenarioEditar.close();\n\t}","title":""}],"string":"[\n {\n \"docid\": \"3ad8e14387d90032347f3e2c01cdb34f\",\n \"score\": \"0.0\",\n \"text\": \"@FXML\\n\\tprivate void cancelar() {\\n\\t\\tescenarioEditar.close();\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"4c06aff919bba9d22961593682ccb3de","score":"0.6912413","text":"public String editar()\r\n/* 67: */ {\r\n/* 68:109 */ if (this.unidad.getIdUnidad() > 0)\r\n/* 69: */ {\r\n/* 70:110 */ setEditado(true);\r\n/* 71:111 */ this.unidad = this.servicioUnidad.cargarDetalle(this.unidad.getIdUnidad());\r\n/* 72: */ }\r\n/* 73: */ else\r\n/* 74: */ {\r\n/* 75:113 */ addInfoMessage(getLanguageController().getMensaje(\"msg_info_seleccionar\"));\r\n/* 76: */ }\r\n/* 77:116 */ return \"\";\r\n/* 78: */ }","title":""},{"docid":"b0ffe864cdae242a0c2d4c4b2f7ec9e8","score":"0.67664856","text":"public void editar(Asignatura asignatura) throws Exception;","title":""},{"docid":"e9fcfc78d50111206002bf8cf89eabe4","score":"0.66627467","text":"public String editar()\r\n/* 136: */ {\r\n/* 137:132 */ if ((this.guiaRemision != null) && (this.guiaRemision.getId() > 0)) {\r\n/* 138: */ try\r\n/* 139: */ {\r\n/* 140:135 */ this.guiaRemision = this.servicioGuiaRemision.cargarDetalle(this.guiaRemision.getId());\r\n/* 141:136 */ if (this.guiaRemision.getEmpresa() == null) {\r\n/* 142:137 */ this.guiaRemision.setEmpresa(new Empresa());\r\n/* 143: */ }\r\n/* 144:139 */ if (this.guiaRemision.getDireccionEmpresa() == null) {\r\n/* 145:140 */ this.guiaRemision.setDireccionEmpresa(new DireccionEmpresa());\r\n/* 146: */ }\r\n/* 147:143 */ cargarDirecciones();\r\n/* 148:144 */ actualizarDocumento();\r\n/* 149: */ \r\n/* 150:146 */ setEditado(true);\r\n/* 151: */ }\r\n/* 152: */ catch (Exception e)\r\n/* 153: */ {\r\n/* 154:149 */ addErrorMessage(getLanguageController().getMensaje(\"msg_error_editar\"));\r\n/* 155:150 */ LOG.error(\"ERROR AL EDITAR FACTURA PROVEEDOR:\", e);\r\n/* 156: */ }\r\n/* 157: */ } else {\r\n/* 158:153 */ addInfoMessage(getLanguageController().getMensaje(\"msg_info_seleccionar\"));\r\n/* 159: */ }\r\n/* 160:156 */ return \"\";\r\n/* 161: */ }","title":""},{"docid":"0e4cc47fe4d18bcf7e3589644afcbd4b","score":"0.6633736","text":"public String cancelar()\r\n/* 129: */ {\r\n/* 130:125 */ setEditado(false);\r\n/* 131:126 */ limpiar();\r\n/* 132:127 */ return \"\";\r\n/* 133: */ }","title":""},{"docid":"851c4ee21cb56fa7fdd04bf6da71199d","score":"0.6595046","text":"private void exitEditMode(){\n isInEditMode = false;\n toggleEditable(nameEditText);\n toggleEditable(gpaEditText);\n toggleEditable(bioEditText);\n toggleEditable(interestsEditText);\n toggleEditable(emailEditText);\n confirmButton.setVisibility(View.INVISIBLE);\n cancelButton.setVisibility(View.INVISIBLE);\n editProfileImageView.setVisibility(View.VISIBLE);\n }","title":""},{"docid":"149d69e2a7d4b68703be571c73a1e02d","score":"0.65480536","text":"@Override\n\tpublic void editar() {\n\t\t\n\t}","title":""},{"docid":"176dd2cf4b85b50a46498f0e9a33b36b","score":"0.6525464","text":"public void desactivaNiño() \n {\n \t\n \tBD miBD = new BD(BD_SERVER, BD_NAME);\n \tSimpleDateFormat formatoDelTexto = new SimpleDateFormat(\"yyyy-MM-dd\");\n \tDate date = new Date();\n \tString fecha = formatoDelTexto.format(date);\n \tmiBD.Update(\"UPDATE tNiño set fechaSalida = '\" + fecha + \"' WHERE codigo = \" + this.codigo + \";\");\n \tfechaSalida = date;\n }","title":""},{"docid":"6c4e13fe664785f92f2fae58fce34e9d","score":"0.6467195","text":"private void editFundo()\n {\n String id= eteId.getText().toString().trim();\n String nombre= eteNombre.getText().toString().trim();\n\n\n FundoEntity nFundoEntity=new FundoEntity();\n nFundoEntity.setIdproductor(Integer.parseInt(id));\n nFundoEntity.setNombreproductor(nombre);\n\n nFundoEntity.setEstado( mListener.getCrudOperations().getFundo(Integer.parseInt(id)).getEstado());\n nFundoEntity.setSincro(mListener.getCrudOperations().getFundo(Integer.parseInt(id)).getSincro());\n\n\n\n //llamar el método de crudoperation\n mListener.getCrudOperations().updateFundo(nFundoEntity);\n\n //cerrar la pantalla\n Handler handler = ListaFundoFragment.sUpdateHandler;\n if (handler != null) {\n handler.obtainMessage().sendToTarget();\n }\n getActivity().finish();\n }","title":""},{"docid":"347887116c342e026527ff7231431e2b","score":"0.6396763","text":"public String editar()\r\n/* 68: */ {\r\n/* 69: 98 */ if (getCategoriaImpuesto().getId() > 0) {\r\n/* 70: */ try\r\n/* 71: */ {\r\n/* 72:100 */ this.categoriaImpuesto = this.servicioCategoriaImpuesto.cargarDetalle(this.categoriaImpuesto.getId());\r\n/* 73:101 */ setEditado(true);\r\n/* 74: */ }\r\n/* 75: */ catch (Exception e)\r\n/* 76: */ {\r\n/* 77:104 */ addErrorMessage(getLanguageController().getMensaje(\"msg_error_cargar_datos\"));\r\n/* 78:105 */ LOG.error(\"Error al editar pedido de cliente\", e);\r\n/* 79: */ }\r\n/* 80: */ } else {\r\n/* 81:108 */ addInfoMessage(getLanguageController().getMensaje(\"msg_info_seleccionar\"));\r\n/* 82: */ }\r\n/* 83:110 */ return \"\";\r\n/* 84: */ }","title":""},{"docid":"aa34467808a344bca382c66b1accfba1","score":"0.63864285","text":"public void refrescarTodo(){\n\t\tnJugadores = 0;\n\t\tnOpcion = 0;\n\t\n\t}","title":""},{"docid":"1cbe7155378bb8377aab7b92de880685","score":"0.6380102","text":"public void editar(PersonaMD per) {\n //Seteamos los datos en el formulario \n boolean discapacidad;\n idPersona = per.getIdPersona();\n System.out.println(\"id\" + idPersona);\n editar = true;\n String cedula;\n cedula = per.getIdentificacion();\n\n Date fecha = new Date();\n Calendar fecha_Nacimiento = Calendar.getInstance();\n fecha_Nacimiento.clear();\n fecha_Nacimiento.set(per.getFechaNacimiento().getYear(), per.getFechaNacimiento().getMonthValue() - 1, per.getFechaNacimiento().getDayOfMonth());\n\n if (modelo.validaciones.Validar.esCedula(cedula) == true) {\n frmPersona.getCmbTipoId().setSelectedItem(\"CEDULA\");\n } else {\n frmPersona.getCmbTipoId().setSelectedItem(\"PASAPORTE\");\n }\n frmPersona.getTxtIdentificacion().setEnabled(true);\n //frmPersona.getCmbTipoId().setSelectedItem(per.getIdPersona());\n frmPersona.getTxtIdentificacion().setText(per.getIdentificacion());\n frmPersona.getTxtCallePrincipal().setText(per.getCallePrincipal());\n frmPersona.getTxtCalleSecundaria().setText(per.getCalleSecundaria());\n frmPersona.getTxtCelular().setText(per.getCelular());\n frmPersona.getTxtCorreo().setText(per.getCorreo());\n frmPersona.getTxtNumeroCasa().setText(per.getNumeroCasa());\n frmPersona.getTxtPrimerApellido().setText(per.getPrimerApellido());\n frmPersona.getTxtPrimerNombre().setText(per.getPrimerNombre());\n frmPersona.getTxtReferencia().setText(per.getReferencia());\n frmPersona.getTxtSector().setText(per.getSector());\n frmPersona.getTxtSegundoApellido().setText(per.getSegundoApellido());\n frmPersona.getTxtSegundoNombre().setText(per.getSegundoNombre());\n frmPersona.getTxtTelefono().setText(per.getTelefono());\n //frmPersona.getJdfechaNacimiento().setDate(fecha);\n if (per.getEstadoCivil() == null) {\n frmPersona.getCmbEstadoCivil().setSelectedItem(\"SELECCIONE\");\n } else {\n frmPersona.getCmbEstadoCivil().setSelectedItem(per.getEstadoCivil());\n }\n //Discapacidad\n if (per.isDiscapacidad() == false) {\n activarDiscapacidad();\n frmPersona.getCbxDiscapacidad().setSelected(false);\n frmPersona.getCmbTipoDiscapacidad().setSelectedItem(\"SELECCIONE\");\n frmPersona.getTxtCarnetConadis().setText(\"\");\n frmPersona.getTxtPorcentaje().setText(\"\");\n } else {\n\n frmPersona.getCbxDiscapacidad().setSelected(per.isDiscapacidad());\n activarDiscapacidad();\n frmPersona.getCmbTipoDiscapacidad().setSelectedItem(per.getTipoDiscapacidad());\n frmPersona.getTxtCarnetConadis().setText(per.getCarnetConadis());\n frmPersona.getTxtPorcentaje().setText(per.getPorcentajeDiscapacidad() + \"\");\n }\n\n if (per.getIdiomaRaiz() == null) {\n frmPersona.getCmbIdiomas().setSelectedItem(\"SELECCIONE\");\n } else {\n frmPersona.getCmbIdiomas().setSelectedItem(per.getIdiomaRaiz());\n }\n\n if (per.getCategoriaMigratoria() == null) {\n frmPersona.getCmbCategoriaMigratoria().setSelectedItem(\"SELECCIONE\");\n } else {\n frmPersona.getCbxCategoriaMigratoria().isSelected();\n activarCategoriaMigratoria();\n frmPersona.getCmbCategoriaMigratoria().setSelectedItem(per.getCategoriaMigratoria());\n }\n\n // frmPersona.getJdcFechaNacimiento().setSelectedDate(fecha_Nacimiento);\n frmPersona.getJdfechaNacimiento().setCalendar(fecha_Nacimiento);\n String sexo = per.getSexo() + \"\";\n if (\"H\".equals(sexo)) {\n sexo = \"HOMBRE\";\n } else {\n sexo = \"MUJER\";\n }\n frmPersona.getCmbSexo().setSelectedItem(sexo);\n\n frmPersona.getCmbTipoSangre().setSelectedItem(per.getTipoSangre().trim());\n frmPersona.getCmbGenero().setSelectedItem(per.getGenero());\n frmPersona.getCmbEtnia().setSelectedItem(per.getEtnia());\n frmPersona.getCmbTipoResidencia().setSelectedItem(per.getTipoResidencia());\n //Codigo postal\n frmPersona.getCmbNacionalidad().setSelectedItem(per.getLugarNatal());\n frmPersona.getCmbProvincia().setSelectedItem(per.getLugarNatal());\n frmPersona.getCmbCanton().setSelectedItem(per.getLugarNatal());\n\n frmPersona.getCmbProvinciaReside().setSelectedItem(per.getLugarResidencia());\n frmPersona.getCmbParroquiaReside().setSelectedItem(per.getLugarResidencia());\n frmPersona.getCmbPaisReside().setSelectedItem(per.getLugarResidencia());\n frmPersona.getCmbCantonReside().setSelectedItem(per.getLugarResidencia());\n\n //Cargar foto\n if (per.getFoto() != null) {\n Image icono = per.getFoto().getScaledInstance(frmPersona.getLblFoto().getWidth(),\n frmPersona.getLblFoto().getHeight(), Image.SCALE_SMOOTH);\n frmPersona.getLblFoto().setIcon(new ImageIcon(icono));\n frmPersona.getLblFoto().updateUI();\n } else {\n //Si existe uan foto la borramos \n frmPersona.getLblFoto().setIcon(null);\n frmPersona.getLblFoto().updateUI();\n }\n //Cargamos los combos de lugar \n int nvlLugarNac = 0;\n if (per.getLugarNatal() != null) {\n nvlLugarNac = Integer.parseInt(per.getLugarNatal().getNivel());\n }\n String ciudad = null, distrito = null;\n if (nvlLugarNac == 3) {\n //Guardamos el nombre del ciudad/canton para luego selecionarlo\n ciudad = per.getLugarNatal().getNombre();\n per.setLugarNatal(LBD.buscar(per.getLugarNatal().getIdReferencia()));\n }\n //Ahora preguntamos nuevamente el nivel del lugar \n nvlLugarNac = Integer.parseInt(per.getLugarNatal().getNivel());\n if (nvlLugarNac == 2) {\n //Guardamos el nombre del distrito/provincia para luego selecionarlo\n distrito = per.getLugarNatal().getNombre();\n per.setLugarNatal(LBD.buscar(per.getLugarNatal().getIdReferencia()));\n }\n //Ahora preguntamos nuevamente el nivel \n nvlLugarNac = Integer.parseInt(per.getLugarNatal().getNivel());\n if (nvlLugarNac == 1) {\n cargarPaises();\n frmPersona.getCmbNacionalidad().setSelectedItem(per.getLugarNatal().getNombre());\n //Seteamos el nuevo lugar de una\n if (distrito != null) {\n frmPersona.getCmbProvincia().setSelectedItem(distrito);\n }\n if (ciudad != null) {\n frmPersona.getCmbCanton().setSelectedItem(ciudad);\n }\n }\n int nvlLugarRes;\n System.out.println(\"Nivel de lugar residencia \" + per.getLugarResidencia().getNivel());\n if (per.getLugarResidencia().getNivel() == null) {\n nvlLugarRes = 0;\n } else {\n nvlLugarRes = Integer.parseInt(per.getLugarResidencia().getNivel());\n }\n String parroquia = null, canton = null, provincia = null;\n if (nvlLugarRes == 4) {\n //Guardamos el nombre del parroquia para luego selecionarlo\n parroquia = per.getLugarResidencia().getNombre();\n per.setLugarResidencia(LBD.buscar(per.getLugarResidencia().getIdReferencia()));\n }\n //Ahora preguntamos nuevamente el nivel del lugar \n if (per.getLugarResidencia().getNivel() == null) {\n nvlLugarRes = 0;\n } else {\n nvlLugarRes = Integer.parseInt(per.getLugarResidencia().getNivel());\n }\n if (nvlLugarRes == 3) {\n //Guardamos el nombre del canton para luego selecionarlo\n canton = per.getLugarResidencia().getNombre();\n per.setLugarResidencia(LBD.buscar(per.getLugarResidencia().getIdReferencia()));\n }\n //Ahora preguntamos nuevamente el nivel del lugar \n if (per.getLugarResidencia().getNivel() == null) {\n nvlLugarRes = 0;\n } else {\n nvlLugarRes = Integer.parseInt(per.getLugarResidencia().getNivel());\n }\n if (nvlLugarRes == 2) {\n //Guardamos el nombre del provincia para luego selecionarlo\n provincia = per.getLugarResidencia().getNombre();\n per.setLugarResidencia(LBD.buscar(per.getLugarResidencia().getIdReferencia()));\n }\n //Ahora preguntamos nuevamente el nivel \n if (per.getLugarResidencia().getNivel() == null) {\n nvlLugarRes = 0;\n } else {\n nvlLugarRes = Integer.parseInt(per.getLugarResidencia().getNivel());\n }\n System.out.println(\"Pais reside \" + per.getLugarResidencia().getNombre());\n if (nvlLugarRes == 1) {\n frmPersona.getCmbPaisReside().setSelectedItem(per.getLugarResidencia().getNombre());\n //Seteamos el nuevo lugar de una\n if (provincia != null) {\n frmPersona.getCmbProvinciaReside().setSelectedItem(provincia);\n }\n if (canton != null) {\n frmPersona.getCmbCantonReside().setSelectedItem(canton);\n }\n if (parroquia != null) {\n frmPersona.getCmbParroquiaReside().setSelectedItem(parroquia);\n }\n }\n iniciarValidaciones();\n }","title":""},{"docid":"4d9b875ea9e63300929e436a3d4c755f","score":"0.63678896","text":"public void supprimer(){\n this.setEtat(false);\n this.update();\n }","title":""},{"docid":"32f4fa7f5288767f769c8a64d29ff237","score":"0.6306608","text":"@Override\n\t\tpublic void onClick(View v) {\n\t\t\ttry\n\t\t\t{\n\t\t\t\tif(v.getId()==R.id.btndel4)\n\t\t\t\t{\n\t\t\t\t\tif(cursor!=null&&cursor.getCount()>=0)\n\t\t\t\t\t{\n\t\t\t\t\t\tAlertDialog.Builder bu=new AlertDialog.Builder(p4.this);\n\t\t\t\t\t\tbu.setTitle(\"確定刪除\");\n\t\t\t\t\t\tbu.setMessage(\"確定要刪除這筆資料?\");\n\t\t\t\t\t\tbu.setNegativeButton(\"取消\", new DialogInterface.OnClickListener() {\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t@Override\n\t\t\t\t\t\t\tpublic void onClick(DialogInterface arg0, int arg1) {\n\t\t\t\t\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t});\n\t\t\t\t\t\tbu.setPositiveButton(\"確定 \", \n\t\t\t\t\t\t\t\tnew DialogInterface.OnClickListener(){\n\t\t\t\t\t\t\t\t\tpublic void onClick(DialogInterface dialog, int i){\n\t\t\t\t\t\t\t\t\t\tif(db.delete(myid))\n\t\t\t\t\t\t\t\t\t\t\tClearEdit();\n\t\t\t\t\t\t\t\t\t\tfinish();\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t});\n\t\t\t\t\t\tbu.show();\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\telse if(v.getId()==R.id.btnedit4)\n\t\t\t\t{\n\t\t\t\t\tString name2=editname.getText().toString();\n\t\t\t\t\tlong coco2=Long.parseLong(editcoco.getText().toString());\n\t\t\t\t\tint day2= Integer.parseInt(editday.getText().toString());\n\t\t\t\t\tif(db.update(myid,day2,name2,coco2)){\n\t\t\t\t\t\tClearEdit();\n\t\t\t\t\t}\n\t\t\t\t\tfinish();\n\t\t\t\t}\n\t\t\t}\n\t\t\tcatch(Exception err){\n\t\t\t\tToast.makeText(getApplicationContext(), \"資料不正確\", Toast.LENGTH_SHORT).show();\n\t\t\t}\n\t\t}","title":""},{"docid":"8fe176fc9a56d4a2fb301ef5a916d875","score":"0.6300824","text":"public void ApriEliminaModificaContatto(){\n fp.dispose();\n femc = new FinestraEliminaModificaContatto();\n }","title":""},{"docid":"2d9bac9603bbc108af8b38b75f1bf2ff","score":"0.629589","text":"private void accionCancelar() {\n this.controlador.mostrarEliminar();\n }","title":""},{"docid":"3965629fd617cc181f13d4c1c698431e","score":"0.62655324","text":"public void conexionTransaccionEditar() {\n\n Session miSesion = ConexionHibernate.tomarConexion();\n\n try {\n miSesion.beginTransaction();\n transaccionEditar(miSesion);\n miSesion.getTransaction().commit();\n\n DesktopNotify.showDesktopMessage(\" exito \", \" Registro editado con exito\", DesktopNotify.SUCCESS, 7000);\n } catch (Exception e) {\n DesktopNotify.showDesktopMessage(\" error \", \" Error al intentar editar registro\", DesktopNotify.ERROR, 7000);\n }\n }","title":""},{"docid":"228172eddf8fa07f35ebb8bdee99ddc2","score":"0.62527525","text":"public void baja(View v) {\n AdminSQLiteOpenHelper admin = new AdminSQLiteOpenHelper(this, \"contactos\", null, 1);\n SQLiteDatabase bd = admin.getWritableDatabase();\n String e_id_a = id_a.getText().toString();\n //Condicion que indica si el campo esta vacio que muestre un mensaje.\n if (e_id_a.matches(\"\")) {\n Toast.makeText(this, \"Debes de indicar un ID!\", Toast.LENGTH_SHORT).show();\n return;\n } else {\n //Permite eliminar los registros de la tabla mediante una condicion.\n int cant = bd.delete(\"contactos\", \"id_A=\" + e_id_a, null);\n //Se cierra la base de datos.\n bd.close();\n //Codigo que nos permite limpiar los editText.\n id_a.setText(\"\");\n nombre.setText(\"\");\n apellidop.setText(\"\");\n apellidom.setText(\"\");\n email.setText(\"\");\n telefono.setText(\"\");\n edad.setText(\"\");\n //Cant Devuelve dos valores si es 1 muestra un mensaje satisfactorio.\n if (cant == 1) {\n Toast.makeText(this, \"Se borró el estudiante\", Toast.LENGTH_SHORT).show();\n id_a.requestFocus();\n //Si no lo es muestra un mensaje de error.\n } else {\n Toast.makeText(this, \"No existe el estudiante, ingrese un ID registrado\", Toast.LENGTH_SHORT).show();\n id_a.requestFocus();\n }\n }\n }","title":""},{"docid":"1c0cd8a8f82eb62dd11e44b0a63e8d86","score":"0.6252142","text":"@Override\n\tpublic void editar(Receita receita) throws DaoException {\n\t\t\n\t}","title":""},{"docid":"9b90c5a99d064fb49804b3a17bcde397","score":"0.6245532","text":"private void limpiarFormulario()\r\n/* 1662: */ {\r\n/* 1663:1546 */ limpiarDestinatario();\r\n/* 1664:1547 */ this.modeloDatosAdicionales.deleteAllRows();\r\n/* 1665: */ \r\n/* 1666:1549 */ this.txtCedulaTrans.setText(null);\r\n/* 1667:1550 */ this.txtRazonSocTrans.setText(null);\r\n/* 1668:1551 */ this.transportistaSeleccionado = null;\r\n/* 1669:1552 */ this.txtPlaca.setText(null);\r\n/* 1670:1553 */ this.txtDirecPartida.setText(null);\r\n/* 1671: */ \r\n/* 1672:1555 */ this.btnFirmarProcesar.setEnabled(false);\r\n/* 1673:1556 */ this.btnGuardar.setEnabled(false);\r\n/* 1674: */ }","title":""},{"docid":"92ea3a71f8e602b1d80f2a9a07f7daf7","score":"0.6238871","text":"public void modificarLibro(){\r\n \r\n /**\r\n * Creacion de metodo para eliminar libro existente\r\n */ \r\n }","title":""},{"docid":"05900d21956f63b11c30be6c29828d4c","score":"0.62294173","text":"public void editAction(int idx) {\n\t\ttry\n\t\t{\n\t\t\tsetResponsePage(this);\n\t\t\tif(idx==0)\n\t\t\t{\n\t\t\t\tktanggaljual.remove(ro);\n\t\t\t\tkvalutajual.remove(ro);\n\t\t\t\tnvalutajual.remove(ro);\n\t\t\t\tpotonganjual.remove(ro);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tktanggalpokok.remove(ro);\n\t\t\t\tkvalutapokok.remove(ro);\n\t\t\t\tnvalutapokok.remove(ro);\n\t\t\t\tpotonganpokok.remove(ro);\n\t\t\t}\n\t\t}\n\t\tcatch(Exception ex){}\n\t}","title":""},{"docid":"e2a890a1d80fa224d141194815cb4d56","score":"0.6216442","text":"public void cancelarRegistroDocente() {\r\n validacionesNombre = false;\r\n validacionesApellido = false;\r\n validacionesCorreo = false;\r\n validacionesCorreoOpcional = true;\r\n validacionesID = false;\r\n validacionesTel1 = true;\r\n validacionesTel2 = true;\r\n validacionesDireccion = true;\r\n validacionesCargo = false;\r\n validacionesFacultad = false;\r\n validacionesDepartamento = false;\r\n mensajeFormulario = \"\";\r\n //\r\n activarDepartamento = true;\r\n inputApellido = null;\r\n inputFacultad = null;\r\n inputDireccion = null;\r\n inputEmail = null;\r\n inputEmailOpcional = null;\r\n inputID = null;\r\n inputNombre = null;\r\n inputDepartamento = null;\r\n inputCargo = null;\r\n listaFacultades = null;\r\n listaDepartamentos = null;\r\n }","title":""},{"docid":"71d2d6b0f100cddc58b7b4e029464789","score":"0.62143946","text":"public void cancelarDespesa() {\n new AlertDialog.Builder(NovaDespesa.this)\n .setTitle(R.string.atencao)\n .setMessage(R.string.cancelar_despesa)\n .setPositiveButton(R.string.sim, new DialogInterface.OnClickListener() {\n @Override\n public void onClick(DialogInterface dialogInterface, int i) {\n if (!editar) {\n db.excluirDespesa(idDespesa);\n }\n Intent intent = new Intent(NovaDespesa.this, MainActivity.class);\n startActivity(intent);\n finish();\n }\n })\n .setNegativeButton(R.string.cancelar, null)\n .show();\n }","title":""},{"docid":"fb742d73d434d43c110e443b64c7606d","score":"0.62137187","text":"public String editar()\r\n/* 116: */ {\r\n/* 117:149 */ if (getFacturaProveedor().getId() > 0) {\r\n/* 118: */ try\r\n/* 119: */ {\r\n/* 120:151 */ this.servicioFacturaProveedor.esEditable(this.facturaProveedor);\r\n/* 121:153 */ if (!this.facturaProveedor.getEstado().equals(Estado.CERRADO))\r\n/* 122: */ {\r\n/* 123:154 */ setIndicadorRenderPanelImportacion(Boolean.valueOf(true));\r\n/* 124:155 */ this.facturaProveedor = this.servicioFacturaProveedor.cargarDetalle(Integer.valueOf(this.facturaProveedor.getId()));\r\n/* 125:156 */ cargarDirecciones();\r\n/* 126:157 */ setEditado(true);\r\n/* 127: */ }\r\n/* 128: */ else\r\n/* 129: */ {\r\n/* 130:159 */ addInfoMessage(getLanguageController().getMensaje(\"msg_error_factura_proveedor_importacion_cerrado\"));\r\n/* 131: */ }\r\n/* 132: */ }\r\n/* 133: */ catch (ExcepcionAS2Financiero e)\r\n/* 134: */ {\r\n/* 135:163 */ addErrorMessage(getLanguageController().getMensaje(e.getCodigoExcepcion()));\r\n/* 136:164 */ LOG.info(\"ERROR AL EDITAR FACTURA PROVEEDOR:\", e);\r\n/* 137: */ }\r\n/* 138: */ catch (ExcepcionAS2Compras e)\r\n/* 139: */ {\r\n/* 140:167 */ addErrorMessage(getLanguageController().getMensaje(e.getCodigoExcepcion()));\r\n/* 141:168 */ LOG.info(\"ERROR AL EDITAR FACTURA PROVEEDOR:\", e);\r\n/* 142: */ }\r\n/* 143: */ catch (Exception e)\r\n/* 144: */ {\r\n/* 145:171 */ addErrorMessage(getLanguageController().getMensaje(\"msg_error_editar\"));\r\n/* 146:172 */ LOG.error(\"ERROR AL EDITAR FACTURA PROVEEDOR:\", e);\r\n/* 147: */ }\r\n/* 148: */ } else {\r\n/* 149:175 */ addInfoMessage(getLanguageController().getMensaje(\"msg_info_seleccionar\"));\r\n/* 150: */ }\r\n/* 151:178 */ return \"\";\r\n/* 152: */ }","title":""},{"docid":"8ef4e8dda986b32eeaad950846ad2b5a","score":"0.62097657","text":"public void cancelarModificacionPersona(View v)\n\t{\n\t\tfinish();\n\t}","title":""},{"docid":"226e7abca2931b84b9db33a5b1be1144","score":"0.6209535","text":"@Override\n\tpublic void deletar() {\n\t\t\n\t\titens.clear(); //Acho que funciona assim\n\t\t\n\t\tSystem.out.println(\"Pasta '\" + getNome() + \"' apagada com sucesso!\"); //simula remocao da pasta\n\t}","title":""},{"docid":"81ac38d8494b9fcc9390f09cd833e813","score":"0.6203758","text":"public void cerrarDocumentoLectura();","title":""},{"docid":"1579996019eee1a49fab01dc88ce8601","score":"0.6203667","text":"private void btnEliminarActionPerformed(java.awt.event.ActionEvent evt) {\n UsuarioBE objUsuario =new UsuarioBE();\n if(this.tblPerfil.getSelectedRow()==-1){\n String texto=\"Error, por favor seleccionar un usuario\";\n }else{\n PerfilBE objPerfil= this.arrPerfiles.get(this.tblPerfil.getSelectedRow());\n if ((objPerfil.getEstado().equals(\"Activo\")) || (objPerfil.getEstado().equals(\"ACTIVO\"))) {\n dlgAvisoConfirmacion aviso=new dlgAvisoConfirmacion(javax.swing.JOptionPane.getFrameForComponent(this),true,\"Desea continuar con la operacion?\");\n aviso.setVisible(true);\n if(aviso.getReturnStatus()==1) {\n if (objPerfilBL.eliminarperfil(objPerfil, 2)){\n// se agrega para auditoria\n// objTransaccionBE = new TransaccionBE();\n// objTransaccionBL = new TransaccionBL();\n// Accion=\"Eliminar\";\n//\n// objUsuario=frmVentanaPrincipal.usuarioActual;\n// codlog=frmVentanaPrincipal.logActual;\n// codusuario = objUsuario.getCodUsuario();\n// objTransaccionBE = cargarTransaccion(objUsuario,Accion,codmodulo,codusuario,codlog);\n// resp=objTransaccionBL.registrarTransaccion(objTransaccionBE);\n// fin de lo agregado para auditoria\n String texto = \"Perfil Eliminado correctamente\";\n }\n String Modulo;\n Modulo=(String)this.cmbModulo.getSelectedItem();\n arrPerfiles = this.objPerfilBL.listarPerfilModulo(objPerfilBE,Modulo);\n cargarTabla(null,null,arrPerfiles);\n }\n }else{\n }\n }\n }","title":""},{"docid":"e2ee9ff1bdd27499d86bcc9f0d6c1aa5","score":"0.6194897","text":"private void refrescar() {\n Conector cone = new Conector();\n \n AgenciaDAO agenciaDAO = new AgenciaDAO(cone.miconector);\n List <AgenciaDTO> agencias = agenciaDAO.agenciaGeneralDAO();\n \n DefaultTableModel modeloTabla = new DefaultTableModel();\n tblAgencias.setModel(modeloTabla);\n \n modeloTabla.addColumn(\"ID\");\n modeloTabla.addColumn(\"Nombre\");\n modeloTabla.addColumn(\"Ciudad\");\n modeloTabla.addColumn(\"Telefono\");\n \n Object[] columna = new Object[4];\n \n int objGuardados = agencias.size();\n \n for (int i = 0; i < objGuardados; i++) {\n columna[0] = agencias.get(i).getId_agencia();\n columna[1] = agencias.get(i).getNombre();\n columna[2] = agencias.get(i).getCiudad();\n columna[3] = agencias.get(i).getTelefono();\n modeloTabla.addRow(columna);\n }\n cone.cerrar();\n }","title":""},{"docid":"1d3dc7be94f74c0af72e1f344524444c","score":"0.61705035","text":"public void vaciarCuestionarioBasico() {\n db.execSQL(\"DELETE FROM cuestionariobasico\");\n// db.execSQL(\"delete table if exists cuestionariobasico\");\n// db.execSQL(\"drop table if exists cuestionariobasico\");\n// db.execSQL(\"create table cuestionariobasico\");\n db.close();\n }","title":""},{"docid":"e72a9561282880184fb2e95d2308d077","score":"0.61702806","text":"private void jButtonDestrezaActionPerformed(java.awt.event.ActionEvent evt) {\r\n ControladorPrincipal.getSingleton().subirNivelPJ(2);\r\n ControladorMazmorra.getSingleton().reiniciarPosicion();\r\n ControladorGUI.getSingleton().ventanaMazmorra();\r\n }","title":""},{"docid":"e0eaf01de853548d7811d57f91e93f57","score":"0.6168464","text":"public void modificar(){\n System.out.println(\"No hay modificaciones exclusivas\"); \r\n }","title":""},{"docid":"e824f915582db6cac48d7eafe489daed","score":"0.6151443","text":"@Override\n public void onClick(View v) {\n binding.etEditarNombre.setError(null);\n binding.etEditarEdad.setError(null);\n binding.etEditarColor.setError(null);\n // Crear la mascota con los nuevos cambios pero ponerle\n // el id de la anterior\n String nuevoNombre = binding.etEditarNombre.getText().toString();\n String posibleNuevaEdad = binding.etEditarEdad.getText().toString();\n String nuevoColor = binding.etEditarColor.getText().toString();\n if (nuevoNombre.isEmpty()) {\n binding.etEditarNombre.setError(\"Escribe el nombre\");\n binding.etEditarNombre.requestFocus();\n return;\n }\n if (posibleNuevaEdad.isEmpty()) {\n binding.etEditarEdad.setError(\"Escribe la edad\");\n binding.etEditarEdad.requestFocus();\n return;\n }\n if (nuevoColor.isEmpty()) {\n binding.etEditarColor.setError(\"Escribe el nombre\");\n binding.etEditarColor.requestFocus();\n return;\n }\n // Si no es entero, igualmente marcar error\n int nuevaEdad;\n try {\n nuevaEdad = Integer.parseInt(posibleNuevaEdad);\n } catch (NumberFormatException e) {\n binding.etEditarEdad.setError(\"Escribe un número\");\n binding.etEditarEdad.requestFocus();\n return;\n }\n // Si llegamos hasta aquí es porque los datos ya están validados\n com.example.pmdm_to03_parte2_raul_villodres_moreno.Mascota mascotaConNuevosCambios = new com.example.pmdm_to03_parte2_raul_villodres_moreno.Mascota(nuevoNombre, nuevaEdad, nuevoColor, mascota.getId());\n int filasModificadas = mascotasController.guardarCambios(mascotaConNuevosCambios);\n if (filasModificadas != 1) {\n // De alguna forma ocurrió un error porque se debió modificar únicamente una fila\n Toast.makeText(com.example.pmdm_to03_parte2_raul_villodres_moreno.EditarMascotaActivity.this, \"Error guardando cambios. Intente de nuevo.\", Toast.LENGTH_SHORT).show();\n } else {\n // Si las cosas van bien, volvemos a la principal\n // cerrando esta actividad\n finish();\n }\n }","title":""},{"docid":"f88cfef3c74fea71fe13bc00855bd21f","score":"0.61482096","text":"@Override\r\n\tpublic void editarDados() {\n\t\tsuper.editarDadosDeFuncionario();\r\n\t\tsetNumeroDeHabilitacao();\r\n\t}","title":""},{"docid":"2a85215e8fd370783c00ce31ad65fd5b","score":"0.6128635","text":"public void borrar() {\r\n referencia = 0;\r\n nombre = null;\r\n nota = 0;\r\n tNombre.setText(null);\r\n tNota.setText(null);\r\n }","title":""},{"docid":"1d497f5e9ee1c02bd1ac0cbe4dc66e94","score":"0.611978","text":"public void modificar() {\r\n this.enModificar = true;\r\n }","title":""},{"docid":"2380e83f10b011089c893655fd90f095","score":"0.6114203","text":"public void guardar() {\n\t\ttry {\n\t\t\tboolean flag = editorialRepo.insertar(editorial);\n\t if(flag) {\n\t \tthis.limpiarFormulario();\n\t \tMessage.messageInfo(\"Editorial creada\");\n\t }else {\n\t \tMessage.messageError(\"No se pudo crear la editorial\");\n\t }\n\t\t} catch (Exception e) {\n\t\t\tMessage.messageError(\"Ocurrió un error al crear la editorial\");\n\t\t\tSystem.out.println(e.getMessage());\n\t\t}\t\n\t}","title":""},{"docid":"7baa271f31bbe6ef50305a98f59b5b9e","score":"0.6113982","text":"public void editAction() {\n\t\ttry\n\t\t{\n\t\t\tsetResponsePage(this);\n\t\t\treadOnly(false);\n\t\t\tkbarang.add(ro);\n\t\t\tnbarang.add(ro);\n\t\t\tsatuan.add(ro);\n\t\t\tkbarang1.add(ro);\n\t\t}\n\t\tcatch(Exception ex){}\n\t}","title":""},{"docid":"0afac6aa17ccb30c903e093dead134e9","score":"0.6102712","text":"public void modificacion (View v) {\n AdminSQLiteOpenHelper admin = new AdminSQLiteOpenHelper(this, \"contactos\", null, 1);\n SQLiteDatabase bd = admin.getWritableDatabase();\n //Se declaran las variables y se igualan al campo para obtener los datos.\n String e_id_a = id_a.getText().toString();\n String e_nombre = nombre.getText().toString();\n String e_apellidop = apellidop.getText().toString();\n String e_apellidom = apellidom.getText().toString();\n String e_email = email.getText().toString();\n String e_telefono = telefono.getText().toString();\n String e_edad = edad.getText().toString();\n //Creamos el registro a insertar como objeto ContentValues\n ContentValues registro = new ContentValues();\n registro.put(\"id_A\", e_id_a);\n registro.put(\"nombre\", e_nombre);\n registro.put(\"apellido_p\", e_apellidop);\n registro.put(\"apellido_m\", e_apellidom);\n registro.put(\"email\", e_email);\n registro.put(\"telefono\", e_telefono);\n registro.put(\"edad\", e_edad);\n //Condicion que indica si el campo esta vacio que muestre un mensaje.\n if (e_id_a.matches(\"\")) {\n Toast.makeText(this, \"Debes de indicar un ID!\", Toast.LENGTH_SHORT).show();\n return;\n } else {\n //Permite actualizar los registros de la tabla mediante una condicion.\n int cant = bd.update(\"contactos\", registro, \"id_A=\" + e_id_a, null);\n //Se cierra la base de datos.\n bd.close();\n //Cant Devuelve dos valores si es 1 muestra un mensaje satisfactorio.\n if (cant == 1) {\n Toast.makeText(this, \"Se modificaron los datos del estudiante\", Toast.LENGTH_SHORT).show();\n id_a.requestFocus();\n //Si no lo es muestra un mensaje de error.\n } else {\n Toast.makeText(this, \"No existe el estudiante, ingrese un ID registrado\", Toast.LENGTH_SHORT).show();\n id_a.requestFocus();\n }\n }\n }","title":""},{"docid":"6f7704f1f373f493996707f25eabcdde","score":"0.6098564","text":"@Override\r\n\tpublic void edit() {\n\t\tdetallePrueba.load();\r\n\t\tdetallePrueba.init();\r\n\t}","title":""},{"docid":"5e1f537a521a5c4d9a362e01334be850","score":"0.6094298","text":"public void cerrarFormularioDeModificado() {\r\n\t\tthis.formDeModificado.clear();\r\n\t\tthis.formDeModificado.dispose();\r\n\t}","title":""},{"docid":"147cee910bd80b963e8bb340874c24a7","score":"0.6093777","text":"public void cancelarRegistro() {\n UtileriaInterfazUsuario.mostrarVentana(getClass(), \"key.principal\",\n \"Principal.fxml\", textFieldNombreUsuario);\n }","title":""},{"docid":"3f590a146d2ccfa48b3c8e150fbb15c7","score":"0.6090041","text":"public void modeloEliminado() {\n \n guardarModeloHabilitado( false );\n archivo = null;\n \n }","title":""},{"docid":"39294f75f4a5775dbaa4f1f147a3375c","score":"0.60892886","text":"public void alterar(){\n\t\tFacesContext faces = FacesContext.getCurrentInstance();\n\t\tboolean flag =true;\n\t\tif(new Util().isCargoNomeRepetido(this.cargo)){\n\t\t\tfaces.addMessage(null, new FacesMessage(FacesMessage.SEVERITY_ERROR,\n\t\t\t\t\t\"Erro\", \"Cargo com esse nome já existe!\"));\t\n\t\t\tflag = false;\n\t\t}\n\t\tif(flag){\n\t\t\tif(this.cargoDao.update(this.cargo,getDataPesquisa())){\n\t\t\t\tfaces.addMessage(null, new FacesMessage(FacesMessage.SEVERITY_INFO,\"Informação\",\"Cargo alterado com sucesso!\"));\n\t\t\t\tpreparaAmbiente();\n\t\t\t}else{\n\t\t\t\tfaces.addMessage(null, new FacesMessage(FacesMessage.SEVERITY_ERROR,\"Erro\",\"Ocorreu um erro no servidor, contate o administrador.\"));\n\t\t\t}\n\t\t}\n\n\t}","title":""},{"docid":"789b3925a1a6a2624e941ca0d8af7458","score":"0.60842085","text":"public void limpaEdit(){\n txtNome.setText(null);\n jcbCargo.setSelectedIndex(0);\n txtNumero.setText(null);\n txtSigla.setText(null);\n \n txtNome.requestFocus();\n }","title":""},{"docid":"c86860b0dc98e938638c2abfb5bc45b9","score":"0.6073927","text":"public void closeEditPanel() {\r\n\t\trootPanel.remove(PanelEdicion);\r\n\t\trootPanel.add(PanelEdicion, PanelFondoGeneral.getOffsetWidth()\r\n\t\t\t\t- Constants.TAMANOBOTOBEDITOFF, 0);\r\n\t\tPanelEdicion.setSize(Constants.TAMANOBOTOBEDITOFF+Constants.PX, \"50px\");\r\n\t\tPanelEdicion.clear();\r\n\t\tPanelEdicion.setStyleName(\"\");\r\n\t\tButton Boton = new Button();\r\n\t\tPanelEdicion.add(Boton, 0, 0);\r\n\t\tBoton.setHTML(ConstantsInformation.EDIT_BOTTON);\r\n\t\tBoton.addClickHandler(new ClickHandler() {\r\n\r\n\t\t\t@Override\r\n\t\t\tpublic void onClick(ClickEvent event) {\r\n\t\t\t\tOpenEditPanel();\r\n\r\n\t\t\t}\r\n\t\t});\r\n\r\n\t}","title":""},{"docid":"11c21e69905e2ff0fad45f699ce599b7","score":"0.60711765","text":"public void modificarMonto(){\n operacionesOrdent operacionesordent2=operacionesordentEJB.find(operacionesordent.getId());\n if (\"Costo asignado\".equals(operacionesordent2.getEstado())){\n operacionesordentEJB.edit(operacionesordent);\n \n FacesContext.getCurrentInstance().addMessage(null, new FacesMessage(\"SE MODIFICO LA ORDEN\"+operacionesordent.getOrdentrabajo().getCodigo()));\n init();\n }else{\n FacesContext.getCurrentInstance().addMessage(null,\n new FacesMessage(\"LA ORDEN \" + operacionesordent.getOrdentrabajo().getCodigo()+\"YA TIENE COSTO NEGOCIADO\"));\n }\n }","title":""},{"docid":"b215e6cf39c8b7fac28cdccbc1553164","score":"0.60640836","text":"private void cerrarVtn() {\n frmPersona.addInternalFrameListener(new InternalFrameAdapter() {\n @Override\n public void internalFrameClosing(InternalFrameEvent e) {\n frmPersona.getTxtIdentificacion().setText(\"\");\n }\n });\n }","title":""},{"docid":"2f651bb745cffd09814d7139036c0aef","score":"0.60394156","text":"@Override\n public void cerrarVentanas() {\n ventanaMej.setVisible(false);\n ventanaEst.setVisible(false);\n }","title":""},{"docid":"8dedc85db4668c0162ea5a240e74e0ae","score":"0.6036693","text":"private void limpiarVenanaEmpleado() {\n txtApellido.setText(\"\");\n txtCuit.setText(\"\");\n txtLegajo.setText(\"\");\n txtConvenio.setText(\"\");\n txtNombre.setText(\"\");\n txtTarea.setText(\"\");\n //BOTON\n // btnGuardar.setEnabled(true);\n btnAnular.setEnabled(false);\n // falta par aque el cursor se situe en el campo legajo por defecyto\n txtLegajo.requestFocus();\n }","title":""},{"docid":"7d4019778fcf1f8789a122e06c21082f","score":"0.6034308","text":"private void activarVista(String vista) {\n/* 306 */ if (!vista.equals(\"nuevo\")) {\n/* 307 */ HTMLElement sel = this.pagHTML.getElementDivCreacionRegistro();\n/* 308 */ sel.getParentNode().removeChild(sel);\n/* */ } \n/* 310 */ if (!vista.equals(\"editar\")) {\n/* 311 */ HTMLElement sel = this.pagHTML.getElementDivEdicion();\n/* 312 */ sel.getParentNode().removeChild(sel);\n/* */ } \n/* 314 */ if (!vista.equals(\"consulta\")) {\n/* 315 */ HTMLElement sel = this.pagHTML.getElementDivConsulta();\n/* 316 */ sel.getParentNode().removeChild(sel);\n/* 317 */ sel = this.pagHTML.getElementDivResultados();\n/* 318 */ sel.getParentNode().removeChild(sel);\n/* */ } \n/* */ }","title":""},{"docid":"9cf09b8808147d5fed69272476584844","score":"0.60259235","text":"public void cancelEdit() {\n \tthis.item.restore(beforeEditItem);\n this.item = new Editor();\n edit = false;\n\n }","title":""},{"docid":"ab1315d1e901654158513b28c9fa9655","score":"0.60236067","text":"@Override\n\t\t\tpublic void actionPerformed(ActionEvent e) {\n\t\t\t\tsetBeansajout(new BeansAjoutEtape(txtlibelle.getText(), txtdesc.getText(), txtcin.getSelectedItem().toString()));\n\t\t\t\tif(controle.editEtape(etape.getId_etape(), pan1)==false)\n\t\t\t\t{\n\t\t\t\t\tJOptionPane.showMessageDialog(null,\"Ce Libelle déjà existe\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tJOptionPane.showMessageDialog(null,\"Information(s) modifiées(s)\");\n\t\t\t\tdispose();\n\t\t\t}","title":""},{"docid":"2cfe487855eb63b69200e106f6bd7624","score":"0.6015003","text":"public void effacerLesTournees() {\r\n\t\ttry {\r\n\t\t\tdb.execSQL(\"DELETE FROM \" + T_PLANTRA);\r\n\t\t\tdb.execSQL(\"DELETE FROM \" + T_PRATICIEN);\r\n\t\t\tdb.execSQL(\"DELETE FROM \" + T_TOURNEE);\r\n\t\t\tdb.execSQL(\"DELETE FROM \" + T_VSTALERTE);\r\n\t\t\teffacerReferenceVisitePraticienDebnflastvisite();\r\n\t\t\tdb.execSQL(\"DELETE FROM \" + T_VISITE);\r\n\t\t\tdb.execSQL(\"DELETE FROM \" + T_ORDO);\r\n\t\t\t// db.execSQL(\"DELETE FROM \"+T_MEDECIN); a garder\r\n\t\t\t// db.execSQL(\"DELETE FROM \"+T_BENEF); a garder\r\n\t\t\t// db.execSQL(\"DELETE FROM \"+T_BNFCAISSE); a garder\r\n\t\t\t// db.execSQL(\"DELETE FROM \"+T_BNFMUTUELLE); a garder\r\n\t\t\tdb.execSQL(\"DELETE FROM \" + T_FACTURE);\r\n\t\t} catch (SQLException e) {\r\n\t\t\tLogCatBuilder.WriteErrorToLog(context, TAG, R.string.error_databasetourneesclear, e);\r\n\t\t}\r\n\t}","title":""},{"docid":"597c3a2014de14bfb8ece7a0ab7b3ed9","score":"0.60089123","text":"public void deact_polica(){\n\t\tString status_police = (String) ra.getAttribute(\"InsuPolicyDialogLDB\", \"InsuPolicyDialog_txtAct\");\n if (status_police.equalsIgnoreCase(\"I\")) {\n \tra.showMessage(\"wrnclt155\");\n \t\t\treturn;\n \t\t}\n\t\t \n Integer update = (Integer) ra.showMessage(\"col_qer028\");\n if (update != null && update.intValue() == 1) {\n\t\t\tra.setAttribute(\"InsuPolicyDialogLDB\",\"InsuPolicyDialog_txtDateUntil\", ra.getAttribute(\"GDB\", \"ProcessingDate\")); \n\t\t\tra.setAttribute(\"InsuPolicyDialogLDB\", \"IP_SPEC_STAT\", \"DA\");\n\t\t\tra.setAttribute(\"InsuPolicyDialogLDB\",\"proc_type_flag\",\"D\");\n try {\n ra.executeTransaction();\n ra.showMessage(\"infclt102\");\n } catch (VestigoTMException vtme) {\n error(\"InsuPolicyDialog -> update(): VestigoTMException\", vtme);\n if (vtme.getMessageID() != null)\n ra.showMessage(vtme.getMessageID());\n }\n }\n \n ra.exitScreen();\n ra.refreshActionList(\"tblInsuPolicy\");\n\t}","title":""},{"docid":"3c7734ebb3d77a73baee885c248be29c","score":"0.59944236","text":"@FXML\n\tprivate void modificarEmpleado() {\n\n\t\tString cedula = txtCedula.getText();\n\t\tString nombre = txtNombre.getText();\n\t\tString apellido = txtApellido.getText();\n\t\tString email = txtEmail.getText();\n\t\tString contrasenia = passClave.getText();\n\t\tDouble salario = Double.parseDouble(txtSalario.getText());\n\t\tBoolean activo = true;\n\t\tDate creacion = new Date();\n\n\t\tEmpleado persona = new Empleado(cedula, nombre, apellido, email, contrasenia, activo, creacion, salario);\n\n\t\tif (manejador.modificarEmpleado(persona)) {\n \n\t\t\t//JOptionPane.showMessageDialog(null, persona.getCedula());\n\t\t\t//manejador.getEmpleadosObservables();\n\t\t\tUtilidades.mostrarMensaje(\"Registro modificado\", \"Registro modificado con exitoso!!\");\n\t\t\tescenarioEditar.close();\n\t\t} else {\n\t\t\t//JOptionPane.showMessageDialog(null, persona.getCedula());\n\t\t\tUtilidades.mostrarMensaje(\"Registro modificado\", \"Error en modificar registro!!\");\n\t\t}\n\t}","title":""},{"docid":"daf1b994d2f107d5056834490a8e7de6","score":"0.598593","text":"public boolean ejecutarEditar() {\n obtenerFormularioEditar();\n conexionTransaccionEditar();\n try {\n getFormularioEditar().dispose();\n } catch (NullPointerException e) {\n }\n return true;\n }","title":""},{"docid":"bb970938691dcbd89460baac336156c6","score":"0.5975692","text":"public String editar() {\n\t\tif (usuario.getId() == null) {\n\t\t\tmessage.sendErrorMessage(\"Sem ID para alterar o usuário, clique no ícone de editar na tabela.\");\n\t\t\treturn \"missing-id\";\n\t\t\t\n\t\t//verifica se o usuario está trocando de email para um email que já existe.\n\t\t} else {\n\t\t\t\n\t\t\tString email1 = usuario.getEmail();\n\t\t\tString email2 = DaoUsuario.findById(usuario.getId()).getEmail();\n\t\t\t\n\t\t\tif (!email1.equals(email2) && DaoUsuario.findByEmail(email1) != null) {\n\t\t\tmessage.sendErrorMessage(\"Esse e-mail já está em uso!\");\n\t\t\treturn \"email-existe\";\n\t\t\t\n\t\t//chama o metodo de edição passando o usuario como parametro\n\t\t} else {\t\n\t\t\tdaoGeneric.updateMerge(usuario);\n\t\t\tmessage.sendInfoMessage(\"Editado com sucesso!\");\n\t\t\treturn \"usuario-editado\";\n\t\t}\n\t\t\t\n\t }\n\t\t\n\t}","title":""},{"docid":"f262b5b582cb23fa149f6b76ce90ea37","score":"0.59668964","text":"public void borrarestudiante(String id){\n SQLiteDatabase db = dbHelper.getWritableDatabase();\n db.delete(\"estudiante\", \"_id=\" + id, null);\n db.close();\n }","title":""},{"docid":"bef53dd6afd4fe0e80270cbda29f47b9","score":"0.5965076","text":"private void btnGuardarActionPerformed(ActionEvent evt)\r\n/* 1709: */ {\r\n/* 1710:1588 */ String respuestaCrear = null;\r\n/* 1711:1589 */ GuiaRemision xmlRespuesta = null;\r\n/* 1712:1590 */ String archivoACrear = null;\r\n/* 1713: */ try\r\n/* 1714: */ {\r\n/* 1715:1593 */ if (this.modeloDetalle.getRowCount() > 0)\r\n/* 1716: */ {\r\n/* 1717:1595 */ xmlRespuesta = generarComprobante();\r\n/* 1718: */ \r\n/* 1719:1597 */ String nombreArchivo = this.claveDeAcceso + \".xml\";\r\n/* 1720:1598 */ archivoACrear = new ConfiguracionDirectorioSQL().obtenerDirectorio(DirectorioEnum.GENERADOS.getCode()).getPath() + File.separator + nombreArchivo;\r\n/* 1721: */ \r\n/* 1722: */ \r\n/* 1723:1601 */ respuestaCrear = ArchivoUtils.crearArchivoXml2(archivoACrear, xmlRespuesta, this.claveContingencia, this.secuencial, TipoComprobanteEnum.GUIA_DE_REMISION.getCode());\r\n/* 1724:1603 */ if (respuestaCrear == null) {\r\n/* 1725:1604 */ this.btnFirmarProcesar.setEnabled(false);\r\n/* 1726: */ }\r\n/* 1727: */ }\r\n/* 1728:1607 */ visualizar();\r\n/* 1729: */ }\r\n/* 1730: */ catch (Exception ex)\r\n/* 1731: */ {\r\n/* 1732:1609 */ Logger.getLogger(GuiaRemisionView.class.getName()).log(Level.SEVERE, null, ex);\r\n/* 1733: */ }\r\n/* 1734: */ }","title":""},{"docid":"d11af9cb37fe7efe85b920a61ff42ac7","score":"0.59624004","text":"public void modificaveicolo() {\n frame.getContentPane().removeAll();\n frame.getContentPane().setLayout(new BorderLayout());\n frame.setLocationRelativeTo(null);\n frame.setVisible(true);\n // Create UI elements\n\n ModificaVeicoloLabel = new JLabel(\"Targa del veicolo da modificare : \");\n TargaVeicoloModificaTextField = new JTextField();\n ModificaProsegui = new JButton(\"Modifica\");\n Indietro = new JButton(\"Indietro\");\n\n // Add UI element to frame\n frame.setLayout(null);\n\n ModificaVeicoloLabel.setBounds(25, 25, 250, 50);\n frame.add(ModificaVeicoloLabel);\n TargaVeicoloModificaTextField.setBounds(275, 40, 100, 20);\n frame.add(TargaVeicoloModificaTextField);\n\n Indietro.setBounds(1100, 50, 100, 50);\n frame.add(Indietro);\n ModificaProsegui.setBounds(1100, 125, 100, 50);\n frame.add(ModificaProsegui);\n\n frame.setVisible(true);\n }","title":""},{"docid":"b5e12e59ebfe70bae73d335c6f114e0a","score":"0.59575534","text":"@FXML\r\n void btEditClicked(ActionEvent event) {\n btDelete.setDisable(false);\r\n btConfirm.setDisable(false);\r\n txtSenhaAtual.setDisable(false);\r\n txtSenhaNova.setDisable(false);\r\n txtSenhaConfirma.setDisable(false);\r\n txtSenhaAtual.requestFocus();\r\n\r\n btEdit.setDisable(true);\r\n }","title":""},{"docid":"ef0cd4a1bec6d5a6bd52027da72eefe8","score":"0.5951681","text":"public void editarProducto() {\r\n\t\t\r\n\t}","title":""},{"docid":"f3ca60ce658f2da192aa05324d66b874","score":"0.5945979","text":"public void limpiar() {\n this.txt_run.setText(null);\n this.txt_nombre.setText(null);\n this.txt_apaterno.setText(null);\n this.txt_amaterno.setText(null);\n this.buttonGroup1.clearSelection();\n this.txt_direccion.setText(null);\n this.txt_telefono.setText(null);\n this.txt_email.setText(null);\n this.cbx_comuna.setSelectedIndex(0);\n this.cbx_estado.setSelectedIndex(0);\n this.txt_run.requestFocus();\n }","title":""},{"docid":"7b80556d734bfc5e07415a145694b651","score":"0.5937273","text":"public void undo(){\n //modeAritmatika.remove(modeAritmatika.size()-1);\n if(pointer > 0){\n pointer--;\n MainConsole.modeEkspresi = modeAritmatika.get(pointer);\n }\n }","title":""},{"docid":"8535002f379dff836ae9d2281de50e34","score":"0.5934135","text":"public void Eliminar(View view){\n AdminSQLiteOpenHelper Admin = new AdminSQLiteOpenHelper(this, \"Administracion\", null, 1);\n SQLiteDatabase BaseDeDatos = Admin.getWritableDatabase();\n\n String codigo = txtCodigo.getText().toString();\n\n if(!codigo.isEmpty()){\n //Se declara una variable de tipo ENTERO porque el metodo delete() retorna un ENTERO\n //que indica la cantidad de registros borrados, si borra algun registro devuelve 1\n int cantidad = BaseDeDatos.delete\n (\"articulos\", \"codigo=\" + codigo, null);\n BaseDeDatos.close();\n\n //Limpia los Widgets\n txtNombre.setText(\"\");\n txtPrecio.setText(\"\");\n txtCantidad.setText(\"\");\n txtCodigo.setText(\"\");\n txtDescripcion.setText(\"\");\n\n if (cantidad == 1){\n Toast.makeText(this, \"Articulo eliminado exitosamente\", Toast.LENGTH_SHORT).show();\n btnEliminar.setEnabled(false);\n } else {\n Toast.makeText(this, \"El articulo no existe\", Toast.LENGTH_SHORT).show();\n BaseDeDatos.close();\n }\n } else {\n Toast.makeText(this, \"Debes de introducir un codigo\", Toast.LENGTH_SHORT).show();\n BaseDeDatos.close();\n }\n }","title":""},{"docid":"01a57ed3e9a84efe349dcf678262795e","score":"0.59335655","text":"public void editar(){\n\t\tbtnEdit.addActionListener(new ActionListener() {\n\t\t\t\n\t\t\t@Override\n\t\t\tpublic void actionPerformed(ActionEvent e) {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\tventanaEditar();\n\t\t\t}\n\t\t});\n\t}","title":""},{"docid":"261ed46178b79b777ae3fe62706edea7","score":"0.59309506","text":"public void desactivarID(){\n lblCodigoEmpleado.setVisible(false);\n txtCodigoEmpleado.setVisible(false);\n }","title":""},{"docid":"2c8cf641e3c8a9bc540fdafa9db6553e","score":"0.59268445","text":"private void editarCliente() {\n\t\tif (this.validarCamposCustom() == true) {\n\t\t\tif (this.dao.editarCliente(this.cli) == true) {\n\t\t\t\tFacesUtil.adicionarMensagemInfo(\"Cliente alterado com sucesso!!\");\n\t\t\t}else {\n\t\t\t\tFacesUtil.adicionarMensagemErro(\"Houve um erro ao alterar cadastro de cliente!!\");\n\t\t\t}\n\t\t}\n\t\t\n\t}","title":""},{"docid":"f5848ffa1aa78b4d2b41de0c346dc5ca","score":"0.59227526","text":"public void ocupado(){\n\t\tthis.livre = false;\n\t}","title":""},{"docid":"e1532cc0e3e4a746accb70b0b6ed8184","score":"0.5918538","text":"public void editItemDetil(){\n\t\tview.showWindowForm();\n\t\t//2. INIT LISTENER\n\t\tview.getItemDetilView().getBtnAddAndSave().addClickListener(this);\n\t\tview.getItemDetilView().getBtnClose().addClickListener(this);\n\t\t//3. INIT STATE FORM\n\t\tview.getItemDetilModel().setOperationStatus(EnumOperationStatus.EDITING.getStrCode());\n\t\t//4. INIT VALUE::ITEM DETIL\n\t\tview.getItemDetilModel().setItemHeader(model.getItemHeader());\n\t\tview.getItemDetilModel().setItemDetil(model.getItemDetil());\n\t\t\n\t\tview.getItemDetilPresenter().editItemdetil();\t\n\t\tview.getItemDetilView().focustIdOrDesc();\n\t\t\n\t}","title":""},{"docid":"a8b8b0ef858cc59c5a9900f77314d2e0","score":"0.59179103","text":"public static void editarProducto() {\n String codigo = produc.getTxt_cod().getText();\n String nombre = produc.getTxt_nombre().getText();\n String descripcion = produc.getTxt_descripcion().getText();\n String existencia = produc.getExistencia().getValue().toString();\n String e_minima = produc.getExi_min().getValue().toString();\n String e_maxima = produc.getExi_max().getValue().toString();\n String precio = produc.getPrecio().getValue().toString();\n String categoria = produc.getTxt_categoria().getSelectedItem().toString();\n String codigoproveedor = produc.getCbx_codProvee().getSelectedItem().toString();\n \n \n modelo1.setNombre(nombre);\n modelo1.setDescripcion(descripcion);\n modelo1.setExistencias(Integer.parseInt(existencia));\n modelo1.setE_min(Integer.parseInt(e_minima));\n modelo1.setE_max(Integer.parseInt(e_maxima));\n modelo1.setPrecio(Double.parseDouble(precio));\n modelo1.setCategoria(categoria);\n modelo1.setCod_proveedor(codigoproveedor);\n\n if (modelo1.modificar(codigo)) {\n JOptionPane.showMessageDialog(produc, \"Producto Creado Satisfactoriamente\");\n produc.getDlg_Productos().setVisible(false);\n cargaLista();\n } else {\n JOptionPane.showMessageDialog(produc, \"ERROR\");\n }\n }","title":""},{"docid":"900ceb413a11c32e7a6ea833aa30b73a","score":"0.5911092","text":"public void concludiPresaViola() {\n\t\t\n\t\tplayerBoard.getButtonPosizionaFamiliare().sbloccaButton();\n\t\tplayerBoard.getButtonAttivaEffettoLeader().sbloccaButton();\n\t\tplayerBoard.getButtonGiocaLeader().sbloccaButton();\n\t\tplayerBoard.getButtonScartaLeader().sbloccaButton();\n\t\t\n\t\tcoloreFamiliareScelto=null;\n\t\tservitoriInseriti = false;\n\t\tgui.inviaMessaggio();\t\n\t}","title":""},{"docid":"5db1fcda5b92f0697cafb6141f671f0e","score":"0.59094584","text":"public void editarQuierofano(Quirofano quirofano){\r\n\t\tQuirofano qui = buscarQuirofano(quirofano.getId());\r\n\t\tif(qui!=null){\r\n\t\t\tem.merge(quirofano);\r\n\t\t}else{\r\n\t\t\tthrow new ExcepcionNegocio(\"El quirofano no se encuentra en el sistema\");\r\n\r\n\t\t}\r\n\t}","title":""},{"docid":"499ca98c38c7da6c23e0088bd1f322ea","score":"0.59071505","text":"public void editar(SitioCurso sitioCurso){\r\n\t\ttry {\r\n\t\t\tsitioCursoDao.edit(sitioCurso);\r\n\t\t} catch (Exception e) {\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t}","title":""},{"docid":"3f9e37de10fc91609471da51640b82ba","score":"0.59062","text":"private void escolheDestino() {\n\t\t\r\n\t}","title":""},{"docid":"4662eb41f0563aae5295f9cd21907f4f","score":"0.5904965","text":"public void Eliminar_todo(){\n AlertDialog.Builder builder = new AlertDialog.Builder(this);\n builder.setMessage(\"Estas segurto que quieres eliminar todo\");\n builder.setTitle(\"Precaucion\");\n builder.setPositiveButton(\"Si\", new DialogInterface.OnClickListener() {\n @Override\n public void onClick(DialogInterface dialog, int which) {\n datosOpenHelper = new BaseDatosOpenHelper(ActShowTiempos.this);\n conexion = datosOpenHelper.getWritableDatabase();\n conexion.delete(FeedEntry.TABLE_NAME, null, null);\n Intent it = new Intent(ActShowTiempos.this, ActShowTiempos.class);\n startActivityForResult(it, 0);\n conexion.close();\n }\n });\n\n builder.setNegativeButton(\"No\", new DialogInterface.OnClickListener() {\n @Override\n public void onClick(DialogInterface dialog, int which) {\n dialog.cancel();\n }\n });\n AlertDialog dialog=builder.create();\n dialog.show();\n }","title":""},{"docid":"0aeed0706dd7c295f098bd9236fa8318","score":"0.5884093","text":"public void imprimirOrden(){\n \r\n }","title":""},{"docid":"c5488873f78592f651fc23d06ace5800","score":"0.5878788","text":"@Override\n\tpublic int edit(Opcion opcion) {\n\t\treturn opcionDao.edit(opcion);\n\t}","title":""},{"docid":"070eee67ad59dab819c1483c87e3aa12","score":"0.5876329","text":"public String borrar() {\n \tcomportamientosDao.delete(id);\r\n \tlistaComportamientos = comportamientosDao.findAll();\r\n \teditar=false;\r\n \treturn \"comportamientos\";\r\n }","title":""},{"docid":"76b22c6d7407ba6e1f328cb0cb8d04b2","score":"0.5874639","text":"private void limpiar() {\n\t\ttextCliente.setText(\"\");\n\t\ttextArticulo.setText(\"\");\n\t\ttextFecha.setText(\"\");\n\t\ttextUnidades.setText(\"\");\n\t\t\n\t}","title":""},{"docid":"11c98c4ee66a8259eca3f5d68012f789","score":"0.58674157","text":"public void editAction() {\n\t\t\n\t}","title":""},{"docid":"01d6ef58580212e1f4a6e24a08b99e96","score":"0.58647233","text":"protected void onEditarInstruccionButtonActionPerformed(ActionEvent e) {\n\r\n\t}","title":""},{"docid":"9408fb325ba7882dc341efcb1d3e8964","score":"0.58616686","text":"private void guardar() {\r\n if(txtFecha.getEditor().getText().trim().equals(\"\")){\r\n Alert a= new Alert(Alert.AlertType.ERROR,\"Error, los campos estan vacios\",ButtonType.OK);\r\n a.show();\r\n }else{\r\n if(comboEstados.getSelectionModel().getSelectedItem().equals(\"Sin selección\")){\r\n Alert a= new Alert(Alert.AlertType.ERROR,\"Error, hay que definir un estado correcto\",ButtonType.OK);\r\n a.show();\r\n }else{\r\n IncidenciaBean i= new IncidenciaBean(incidenciaSelected.getId(), incidenciaSelected.getMaquina(), incidenciaSelected.getFecha(), comboEstados.getSelectionModel().getSelectedItem());\r\n inciMan.modificarIncidencia(i);\r\n volver();\r\n }\r\n \r\n }\r\n }","title":""},{"docid":"1a62800b176019e40480c58e64991948","score":"0.5861031","text":"public void abrir()\r\n {\r\n _Oculta = false;\r\n _Marca = \"X\";\r\n }","title":""},{"docid":"1c105825e6d3cb3b52fdf62922a309c1","score":"0.5861029","text":"public void actualizar(int id) {\n \tencontrarTrabajadorPorId(id); \n System.out.println(\"El trabajador con ID \" + id + \" ha sido actualizado\"); \n\t\t\n\t}","title":""},{"docid":"b4d68ccd1cdba1d8aa98fcfcab89547d","score":"0.5859866","text":"public void Registro_reincor() {\n String ID = editID.getText().toString();\n String ID_Zona = spzonas.getSelectedItemId()+\"\";\n String Nombrerein = editNombre.getText().toString();\n String Edad = editEdad.getText().toString();\n String Nivel = editEscolaridad.getText().toString();\n String Nacionalidad = editNacionalidad.getText().toString();\n\n ContentValues valores = new ContentValues();\n valores.put(com.example.equipo.farc_ep.Data.LoginContract.LoginEntry.NIVEL, Nivel);\n\n valores.put(com.example.equipo.farc_ep.Data.LoginContract.LoginEntry.ID, ID);\n //valores.put(LoginContract.LoginEntry.EMAIL, Email );\n valores.put(LoginContract.LoginEntry.IDZONA, ID_Zona);\n valores.put(LoginContract.LoginEntry.NOMBREREIN, Nombrerein);\n valores.put(LoginContract.LoginEntry.EDAD, Edad);\n valores.put(LoginContract.LoginEntry.GENERO2, genero);\n valores.put(LoginContract.LoginEntry.NACIONALIDAD, Nacionalidad);\n db.insert(com.example.equipo.farc_ep.Data.LoginContract.LoginEntry.TABLE_NAME2, null, valores);\n\n Intent guardar = new Intent(Registrar_reincorporados.this, Menu_Admin.class);\n guardar.addFlags(guardar.FLAG_ACTIVITY_CLEAR_TOP | guardar.FLAG_ACTIVITY_SINGLE_TOP);\n startActivity(guardar);\n\n }","title":""},{"docid":"df8af0fed9ca49cb97700571a7d969c2","score":"0.58558476","text":"public String eliminar()\r\n/* 113: */ {\r\n/* 114:110 */ GuiaRemision grAux = this.servicioGuiaRemision.buscarPorId(Integer.valueOf(this.guiaRemision.getId()));\r\n/* 115:111 */ this.servicioGuiaRemision.anular(grAux);\r\n/* 116:112 */ addInfoMessage(getLanguageController().getMensaje(\"msg_info_anular\"));\r\n/* 117:113 */ return \"\";\r\n/* 118: */ }","title":""},{"docid":"55ba73abdb9f1bc0625a4433d8ff5c0a","score":"0.5855395","text":"void undoMeetingBook();","title":""},{"docid":"f8813c2cf7b329e245c737f7eceabb4f","score":"0.58534294","text":"private void jBModificarActionPerformed(java.awt.event.ActionEvent evt) {//GEN-FIRST:event_jBModificarActionPerformed\r\n // TODO add your handling code here:\r\n VentanaModificar ventana = new VentanaModificar(this);\r\n ventana.setVisible(true);\r\n ventana.setLocationRelativeTo(null);\r\n\r\n ventana.setDatosUsuarioModificar(password, jLNickname2.getText(),jLNombre2.getText(), jLApellido2.getText(), jLavatar.getText(),jLFechaNac2.getText());\r\n \r\n }","title":""},{"docid":"09a2cab1d669216151d007725a29a668","score":"0.5852301","text":"public abstract void obtenerFormularioEditar();","title":""},{"docid":"a036b9197d0680d9da8429a9cfa2b5bb","score":"0.5846189","text":"@Override\n public void actionPerformed(ActionEvent e) {\n //boton cancelar\n if (e.getSource().equals(v.getBtnCancelar())) {\n this.v.dispose();\n\n }\n //boton Guardar Persona\n if (e.getSource().equals(v.getBtnGuardarPersona())) {\n this.v.getPbarGRR().setVisible(true);\n System.out.println(esta_persona_guarda + \"esta persona guardada\");\n this.v.getPbarGRR().setVisible(true);\n if (esta_persona_guarda.equals(\"modificar\")) {\n this.v.getPbarGRR().setValue(1);\n try {\n if (validacionesPersona()) {\n\n this.v.getPbarGRR().setValue(2);\n try {\n datos_personales_modificar();\n\n this.v.getPbarGRR().setValue(3);\n v.getBtnAgregarAgresores().setEnabled(true);\n v.getBtnAgregarHijos().setEnabled(true);\n v.getBtnEliminarPersona().setEnabled(true);\n v.getBtnModificarPersona().setEnabled(true);\n v.getBtnCancelarPersona().setEnabled(false);\n v.getBtnGuardarPersona().setEnabled(false);\n v.getTxtCedulaGeneral().setEditable(true);\n v.getTxtCodigoPersona().setEditable(true);\n v.getBtnGuardar().setEnabled(true);\n this.v.getPbarGRR().setValue(4);\n rrdb.ingresar_codigo_victima(victimaDB.getCodigo_victima_static());\n this.v.getPbarGRR().setValue(5);\n lista = pldb.lista_personas();\n pdb.listapersonas();\n } catch (SQLException ex) {\n Logger.getLogger(ControladorRegistroReferencia.class.getName()).log(Level.SEVERE, null, ex);\n\n this.v.getPbarGRR().setValue(9);\n this.v.getPbarGRR().setVisible(false);\n }\n this.v.getPbarGRR().setValue(7);\n }\n } catch (ParseException ex) {\n Logger.getLogger(ControladorRegistroReferencia.class.getName()).log(Level.SEVERE, null, ex);\n this.v.getPbarGRR().setValue(9);\n this.v.getPbarGRR().setVisible(false);\n }\n this.v.getPbarGRR().setValue(9);\n this.v.getPbarGRR().setVisible(false);\n\n }\n if (esta_persona_guarda.equals(\"nueva\")) {\n this.v.getPbarGRR().setValue(1);\n try {\n if (validacionesPersona()) {\n this.v.getPbarGRR().setValue(2);\n try {\n if (DatosPersonales()) {\n this.v.getPbarGRR().setValue(7);\n v.getBtnAgregarAgresores().setEnabled(true);\n v.getBtnAgregarHijos().setEnabled(true);\n v.getBtnEliminarPersona().setEnabled(true);\n v.getBtnModificarPersona().setEnabled(true);\n v.getBtnCancelarPersona().setEnabled(false);\n v.getBtnGuardarPersona().setEnabled(false);\n v.getTxtCedulaGeneral().setEditable(true);\n v.getTxtCodigoPersona().setEditable(true);\n v.getBtnGuardar().setEnabled(true);\n rrdb.ingresar_codigo_victima(vdb.getCodigo_victima_static());\n this.v.getPbarGRR().setValue(8);\n JOptionPane.showMessageDialog(this.v, \"Beneficiaria guardada correctamente. Ya puede agregar hijos!\");\n lista = pldb.lista_personas();\n pdb.listapersonas();\n this.v.getPbarGRR().setValue(10);\n this.v.getPbarGRR().setVisible(false);\n } else {\n System.out.println(\"error al ingresar datos de persona\");\n this.v.getPbarGRR().setVisible(false);\n }\n\n } catch (Exception ex) {\n System.out.println(\"error al ingresar datos de persona\");\n this.v.getPbarGRR().setVisible(false);\n }\n } else {\n this.v.getPbarGRR().setVisible(false);\n }\n } catch (ParseException ex) {\n System.out.println(\"error al ingresar datos de persona\");\n this.v.getPbarGRR().setVisible(false);\n }\n\n }\n }\n\n //boton buscar_persona_codigo\n if (e.getSource().equals(v.getBtn_buscar_codigo())) {\n// try {\n// setearXcodigo();\n// v.getBtnModificarPersona().setEnabled(true);\n// v.getBtnEliminarPersona().setEnabled(true);\n// esta_persona_guarda = \"modificar\";\n// } catch (SQLException ex) {\n// Logger.getLogger(ControladorRegistroReferencia.class.getName()).log(Level.SEVERE, null, ex);\n// } catch (java.text.ParseException ex) {\n// Logger.getLogger(ControladorRegistroReferencia.class.getName()).log(Level.SEVERE, null, ex);\n// }\n }\n\n //boton modificar persona\n if (e.getSource().equals(v.getBtnModificarPersona())) {\n v.getBtnAgregarAgresores().setEnabled(false);\n v.getBtnAgregarHijos().setEnabled(false);\n v.getBtnEliminarPersona().setEnabled(false);\n v.getBtnModificarPersona().setEnabled(false);\n v.getBtnCancelarPersona().setEnabled(true);\n v.getBtnGuardarPersona().setEnabled(true);\n v.getTxtCedulaGeneral().setEditable(false);\n v.getTxtCodigoPersona().setEditable(false);\n esta_persona_guarda = \"modificar\";\n }\n\n //boton cancelar persona\n if (e.getSource().equals(v.getBtnCancelarPersona())) {\n v.getBtnAgregarAgresores().setEnabled(true);\n v.getBtnAgregarHijos().setEnabled(true);\n v.getBtnEliminarPersona().setEnabled(false);\n v.getBtnModificarPersona().setEnabled(false);\n v.getBtnCancelarPersona().setEnabled(false);\n v.getBtnGuardarPersona().setEnabled(true);\n v.getTxtCedulaGeneral().setEditable(true);\n v.getTxtCodigoPersona().setEditable(true);\n JOptionPane.showMessageDialog(null, \"Accion Cancelada. No necesita guardar...\");\n\n esta_persona_guarda = \"nueva\";\n\n }\n // boton eliminar persona\n if (e.getSource().equals(v.getBtnEliminarPersona())) {\n int reply = JOptionPane.showConfirmDialog(null, \"Seguro que desea eliminar a esta persona?\", \"Confirme\", JOptionPane.YES_NO_OPTION);\n if (reply == JOptionPane.YES_OPTION) {\n pdb.eliminarPersonaCodigo();\n JOptionPane.showMessageDialog(null, \"Eliminado\");\n\n } else {\n JOptionPane.showMessageDialog(null, \"Accion Cancelada\");\n }\n\n }\n\n //boton listado personas registradas\n if (e.getSource().equals(v.getBtnListadoPerReis())) {\n VistaConsultaPersona o = new VistaConsultaPersona();\n ControladorBuscarPersona u = new ControladorBuscarPersona(o);\n }\n\n //cancelar modificacion de persona\n if (e.getSource().equals(v.getBtnCancelar())) {\n v.getBtnCancelarPersona().setEnabled(true);\n\n }\n\n //boton agregar agresores\n if (e.getSource().equals(v.getBtnAgregarAgresores())) {\n try {\n if (control == 0) {\n ControladorAgregarAgresores caa = new ControladorAgregarAgresores(faa);\n control++;\n }\n faa.setVisible(true);\n faa.setLocationRelativeTo(null);\n faa.setResizable(false);\n insertarTablaAgresores();\n } catch (ParseException ex) {\n Logger.getLogger(ControladorRegistroReferencia.class.getName()).log(Level.SEVERE, null, ex);\n }\n }\n\n //boton agregar hijos\n if (e.getSource().equals(v.getBtnAgregarHijos())) {\n\n try {\n\n if (control2 == 0) {\n ControladorAgregarHijos cah = new ControladorAgregarHijos(fah);\n control2++;\n }\n fah.setVisible(true);\n fah.setLocationRelativeTo(null);\n fah.setResizable(false);\n\n } catch (ParseException | SQLException ex) {\n Logger.getLogger(ControladorRegistroReferencia.class.getName()).log(Level.SEVERE, null, ex);\n }\n\n }\n //boton guardar \n if (e.getSource().equals(v.getBtnGuardar())) {\n this.v.getPbarGRR().setVisible(true);\n if (validaciones_contacto_emergencia()) {\n this.v.getPbarGRR().setValue(1);\n if (v.getTxtTelefonoAyuda().getText().matches(\"[0-9]*\") && v.getTxtTelefonoAyuda().getText().length() <= 10) {\n if (v.getTxtFrecuencia().getText().matches(\"[a-zA-Z]*\")) {\n this.v.getPbarGRR().setValue(2);\n try {\n insertar_domicilio();\n insertar_contacto_emerg();\n this.v.getPbarGRR().setValue(3);\n ayuda_anterior();\n factoresRiesgo();\n this.v.getPbarGRR().setValue(4);\n detalle_agresion();\n registro_refrencia_update();\n this.v.getPbarGRR().setValue(5);\n JOptionPane.showMessageDialog(null, \"Registro Guardado Exitosamente\");\n v.dispose();\n this.v.getPbarGRR().setValue(7);\n } catch (SQLException | ParseException ex) {\n Logger.getLogger(ControladorRegistroReferencia.class.getName()).log(Level.SEVERE, null, ex);\n\n this.v.getPbarGRR().setValue(9);\n this.v.getPbarGRR().setVisible(false);\n }\n\n } else {\n this.v.getPbarGRR().setValue(9);\n this.v.getPbarGRR().setVisible(false);\n JOptionPane.showMessageDialog(null, \"Registro No Guardado | Caso a Registrar: campo Fecuencia de la Agresión \\n(solo puede contener letras)\");\n }\n this.v.getPbarGRR().setValue(8);\n } else {\n this.v.getPbarGRR().setValue(9);\n this.v.getPbarGRR().setVisible(false);\n JOptionPane.showMessageDialog(null, \"Registro No Guardado | Ayuda Anterior campo Telefono \\n(solo puede contener números)\");\n }\n this.v.getPbarGRR().setValue(9);\n this.v.getPbarGRR().setVisible(false);\n }\n\n }\n //----------------------------------------------------------------------juego lineaa de apoyo\n if (v.getRbSiLlamaLineaApoyo().isSelected()) {\n v.getRbNOLlamaLineaApoyo().setEnabled(false);\n } else {\n v.getRbNOLlamaLineaApoyo().setEnabled(true);\n }\n if (v.getRbNOLlamaLineaApoyo().isSelected()) {\n v.getRbSiLlamaLineaApoyo().setEnabled(false);\n } else {\n v.getRbSiLlamaLineaApoyo().setEnabled(true);\n }\n //----------------------------------------------------------------------juego lineaa de apoyo\n if (v.getRbSiContinuaAgresion().isSelected()) {\n v.getRbNoContinuaAgresion().setEnabled(false);\n } else {\n v.getRbNoContinuaAgresion().setEnabled(true);\n }\n if (v.getRbNoContinuaAgresion().isSelected()) {\n v.getRbSiContinuaAgresion().setEnabled(false);\n } else {\n v.getRbSiContinuaAgresion().setEnabled(true);\n }\n }","title":""},{"docid":"66de2273d38223b7246d84c381ff6932","score":"0.58435863","text":"protected boolean gravarEditado(int idClient, String vrTotal, String codLancament, String controle) {\n daoMvVendasMovimento daovm = new daoMvVendasMovimento();\n mvVendasMovimento mvVendasMovimento = new mvVendasMovimento();\n ArrayList<tmpListProd> lista = dao.buscarAlltmp();\n \n boolean resp = daovm.editarOrcCab(vrTotal, codLancament, controle, idClient);\n \n boolean resp2 = daovm.removeProdOrc(controle);\n \n\n for (int i = 0; i < lista.size(); i++) {\n\n mvVendasMovimento.setDataVenda(dao.data_Venda());\n mvVendasMovimento.setControle(controle);\n mvVendasMovimento.setModoVenda(2);\n mvVendasMovimento.setCodLancamento(Integer.parseInt(codLancament));\n mvVendasMovimento.setIdCliente(idClient);\n mvVendasMovimento.setIdClienteConvenio(0);\n mvVendasMovimento.setIdProduto(lista.get(i).getIdProduto());\n mvVendasMovimento.setIdGrade(0);\n mvVendasMovimento.setModoLancamento(0);\n mvVendasMovimento.setTerminal(\"01\");\n mvVendasMovimento.setTurno(\"1\");\n mvVendasMovimento.setValor(dao.Valor_CP(lista.get(i).getIdProduto()));\n mvVendasMovimento.setQuant(lista.get(i).getQdt());\n mvVendasMovimento.setVrTotal(lista.get(i).getVlr());\n mvVendasMovimento.setVrCotacao(1);\n\n dao.inserirMVM(mvVendasMovimento);\n\n }\n \n return true;\n\n }","title":""},{"docid":"1e4c54049857c6a9dad1c1db48ab6d9c","score":"0.58401173","text":"private void verwijderenToernooi() {\n try {\n\n int id_toernooi = Integer.parseInt(idToernooiTxt.getText());\n\n Sql_connect.doConnect();\n PreparedStatement stat = Sql_connect.getConnection().prepareStatement(\"DELETE FROM toernooi WHERE Id_toernooi = ?\");\n stat.setInt(1, id_toernooi);\n stat.executeUpdate();\n JOptionPane.showMessageDialog(this, \"Toernooi met id: \" + id_toernooi + \" succesvol verwijderd.\");\n vulLijst();\n\n } catch (Exception e) {\n ePopup(e);\n MELDINGFIELD.setText(\"Verwijderen mislukt\");\n }\n }","title":""},{"docid":"327995bb371a91e3cabf0858d4006d7e","score":"0.583825","text":"public void ej_Bcancelar(ActionEvent e)\n {\n switch (nav.getPulsado())\n {\n case navegador.EDIT:\n pad.canc_edit();\n break;\n case navegador.QUERY:\n pad.canc_query();\n break;\n case navegador.ADDNEW:\n pad.canc_addnew();\n break;\n case navegador.DELETE:\n pad.canc_delete();\n break;\n }\n pulsadoCancelar();\n }","title":""},{"docid":"68f0797caab2be960ce4b11167b8b298","score":"0.58379424","text":"public void salvarContato() {\n try {\n if(contato.getId() == null){\n contatoDao.criar(contato); \n setMensagemSucesso(\"Contato criado com sucesso!\");\n contato = new Contato();\n }else{\n contatoDao.editar(contato);\n setMensagemSucesso(\"Contato alterado com sucesso!\");\n }\n \n listaContatos = contatoDao.buscarTodos(); \n \n } catch (Exception e) {\n setMensagemErro(\"Não foi possível criar o contato\", e.getMessage());\n }\n\n }","title":""},{"docid":"a0d2b2bc1004f18916479427c48242cc","score":"0.58372235","text":"public boolean editarHorarios(){\n return true;\n }","title":""},{"docid":"9dbc3d5db1bf06c388cde27bb35435d1","score":"0.58319587","text":"protected void onEditarIngredienteButtonActionPerformed(ActionEvent e) {\n\r\n\t}","title":""},{"docid":"48bd088046f5eb95a0c75f7bbb8e9841","score":"0.58311003","text":"public void cancelarTipoPropuestaConvenio() {\n String msg = \"Tipo de Propuesta de Convenio cancelado!\"; \n try { \n tipoPropuestaConvenio = null;\n tipoPropuestaConvenio = new TipoPropuestaConvenio();\n RequestContext.getCurrentInstance().reset(\":formAdmin\"); \n if(actualizar)\n JsfUtil.addSuccessMessage(msg);\n } catch (Exception e) {\n JsfUtil.addErrorMessage(\"Error al cancelar registro tipo de Propuesta de Convenio\");\n }\n cargarTipoPropuestaConvenio();\n }","title":""},{"docid":"b81db7a4c89dd10c3af926ec601daf15","score":"0.5827527","text":"public void cancelProfesseur() {\n\n try {\n nomNouvelProfesseurModel.remove(0, nomNouvelProfesseurModel.getLength());\n prenomNouvelProfesseurModel.remove(0, prenomNouvelProfesseurModel.getLength());\n loginNouvelProfesseurModel.remove(0, loginNouvelProfesseurModel.getLength());\n mdpNouvelProfesseurModel.remove(0, mdpNouvelProfesseurModel.getLength());\n } catch (BadLocationException e) {\n e.printStackTrace();\n }\n\n }","title":""},{"docid":"dcdd33512b32885da9fe71649b714e00","score":"0.5824642","text":"public Editar() {\n initComponents();\n this.setLocationRelativeTo(null);\n int num2;\n txteven.setEditable(false);\n txtLugar.setEditable(false);\n txtFecha.setEditable(false);\n txtHora.setEditable(false);\n txtDuracion.setEditable(false);\n txtAcomp.setEditable(false);\n \n }","title":""}],"string":"[\n {\n \"docid\": \"4c06aff919bba9d22961593682ccb3de\",\n \"score\": \"0.6912413\",\n \"text\": \"public String editar()\\r\\n/* 67: */ {\\r\\n/* 68:109 */ if (this.unidad.getIdUnidad() > 0)\\r\\n/* 69: */ {\\r\\n/* 70:110 */ setEditado(true);\\r\\n/* 71:111 */ this.unidad = this.servicioUnidad.cargarDetalle(this.unidad.getIdUnidad());\\r\\n/* 72: */ }\\r\\n/* 73: */ else\\r\\n/* 74: */ {\\r\\n/* 75:113 */ addInfoMessage(getLanguageController().getMensaje(\\\"msg_info_seleccionar\\\"));\\r\\n/* 76: */ }\\r\\n/* 77:116 */ return \\\"\\\";\\r\\n/* 78: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0ffe864cdae242a0c2d4c4b2f7ec9e8\",\n \"score\": \"0.67664856\",\n \"text\": \"public void editar(Asignatura asignatura) throws Exception;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9fcfc78d50111206002bf8cf89eabe4\",\n \"score\": \"0.66627467\",\n \"text\": \"public String editar()\\r\\n/* 136: */ {\\r\\n/* 137:132 */ if ((this.guiaRemision != null) && (this.guiaRemision.getId() > 0)) {\\r\\n/* 138: */ try\\r\\n/* 139: */ {\\r\\n/* 140:135 */ this.guiaRemision = this.servicioGuiaRemision.cargarDetalle(this.guiaRemision.getId());\\r\\n/* 141:136 */ if (this.guiaRemision.getEmpresa() == null) {\\r\\n/* 142:137 */ this.guiaRemision.setEmpresa(new Empresa());\\r\\n/* 143: */ }\\r\\n/* 144:139 */ if (this.guiaRemision.getDireccionEmpresa() == null) {\\r\\n/* 145:140 */ this.guiaRemision.setDireccionEmpresa(new DireccionEmpresa());\\r\\n/* 146: */ }\\r\\n/* 147:143 */ cargarDirecciones();\\r\\n/* 148:144 */ actualizarDocumento();\\r\\n/* 149: */ \\r\\n/* 150:146 */ setEditado(true);\\r\\n/* 151: */ }\\r\\n/* 152: */ catch (Exception e)\\r\\n/* 153: */ {\\r\\n/* 154:149 */ addErrorMessage(getLanguageController().getMensaje(\\\"msg_error_editar\\\"));\\r\\n/* 155:150 */ LOG.error(\\\"ERROR AL EDITAR FACTURA PROVEEDOR:\\\", e);\\r\\n/* 156: */ }\\r\\n/* 157: */ } else {\\r\\n/* 158:153 */ addInfoMessage(getLanguageController().getMensaje(\\\"msg_info_seleccionar\\\"));\\r\\n/* 159: */ }\\r\\n/* 160:156 */ return \\\"\\\";\\r\\n/* 161: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e4cc47fe4d18bcf7e3589644afcbd4b\",\n \"score\": \"0.6633736\",\n \"text\": \"public String cancelar()\\r\\n/* 129: */ {\\r\\n/* 130:125 */ setEditado(false);\\r\\n/* 131:126 */ limpiar();\\r\\n/* 132:127 */ return \\\"\\\";\\r\\n/* 133: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"851c4ee21cb56fa7fdd04bf6da71199d\",\n \"score\": \"0.6595046\",\n \"text\": \"private void exitEditMode(){\\n isInEditMode = false;\\n toggleEditable(nameEditText);\\n toggleEditable(gpaEditText);\\n toggleEditable(bioEditText);\\n toggleEditable(interestsEditText);\\n toggleEditable(emailEditText);\\n confirmButton.setVisibility(View.INVISIBLE);\\n cancelButton.setVisibility(View.INVISIBLE);\\n editProfileImageView.setVisibility(View.VISIBLE);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"149d69e2a7d4b68703be571c73a1e02d\",\n \"score\": \"0.65480536\",\n \"text\": \"@Override\\n\\tpublic void editar() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"176dd2cf4b85b50a46498f0e9a33b36b\",\n \"score\": \"0.6525464\",\n \"text\": \"public void desactivaNiño() \\n {\\n \\t\\n \\tBD miBD = new BD(BD_SERVER, BD_NAME);\\n \\tSimpleDateFormat formatoDelTexto = new SimpleDateFormat(\\\"yyyy-MM-dd\\\");\\n \\tDate date = new Date();\\n \\tString fecha = formatoDelTexto.format(date);\\n \\tmiBD.Update(\\\"UPDATE tNiño set fechaSalida = '\\\" + fecha + \\\"' WHERE codigo = \\\" + this.codigo + \\\";\\\");\\n \\tfechaSalida = date;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c4e13fe664785f92f2fae58fce34e9d\",\n \"score\": \"0.6467195\",\n \"text\": \"private void editFundo()\\n {\\n String id= eteId.getText().toString().trim();\\n String nombre= eteNombre.getText().toString().trim();\\n\\n\\n FundoEntity nFundoEntity=new FundoEntity();\\n nFundoEntity.setIdproductor(Integer.parseInt(id));\\n nFundoEntity.setNombreproductor(nombre);\\n\\n nFundoEntity.setEstado( mListener.getCrudOperations().getFundo(Integer.parseInt(id)).getEstado());\\n nFundoEntity.setSincro(mListener.getCrudOperations().getFundo(Integer.parseInt(id)).getSincro());\\n\\n\\n\\n //llamar el método de crudoperation\\n mListener.getCrudOperations().updateFundo(nFundoEntity);\\n\\n //cerrar la pantalla\\n Handler handler = ListaFundoFragment.sUpdateHandler;\\n if (handler != null) {\\n handler.obtainMessage().sendToTarget();\\n }\\n getActivity().finish();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"347887116c342e026527ff7231431e2b\",\n \"score\": \"0.6396763\",\n \"text\": \"public String editar()\\r\\n/* 68: */ {\\r\\n/* 69: 98 */ if (getCategoriaImpuesto().getId() > 0) {\\r\\n/* 70: */ try\\r\\n/* 71: */ {\\r\\n/* 72:100 */ this.categoriaImpuesto = this.servicioCategoriaImpuesto.cargarDetalle(this.categoriaImpuesto.getId());\\r\\n/* 73:101 */ setEditado(true);\\r\\n/* 74: */ }\\r\\n/* 75: */ catch (Exception e)\\r\\n/* 76: */ {\\r\\n/* 77:104 */ addErrorMessage(getLanguageController().getMensaje(\\\"msg_error_cargar_datos\\\"));\\r\\n/* 78:105 */ LOG.error(\\\"Error al editar pedido de cliente\\\", e);\\r\\n/* 79: */ }\\r\\n/* 80: */ } else {\\r\\n/* 81:108 */ addInfoMessage(getLanguageController().getMensaje(\\\"msg_info_seleccionar\\\"));\\r\\n/* 82: */ }\\r\\n/* 83:110 */ return \\\"\\\";\\r\\n/* 84: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa34467808a344bca382c66b1accfba1\",\n \"score\": \"0.63864285\",\n \"text\": \"public void refrescarTodo(){\\n\\t\\tnJugadores = 0;\\n\\t\\tnOpcion = 0;\\n\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1cbe7155378bb8377aab7b92de880685\",\n \"score\": \"0.6380102\",\n \"text\": \"public void editar(PersonaMD per) {\\n //Seteamos los datos en el formulario \\n boolean discapacidad;\\n idPersona = per.getIdPersona();\\n System.out.println(\\\"id\\\" + idPersona);\\n editar = true;\\n String cedula;\\n cedula = per.getIdentificacion();\\n\\n Date fecha = new Date();\\n Calendar fecha_Nacimiento = Calendar.getInstance();\\n fecha_Nacimiento.clear();\\n fecha_Nacimiento.set(per.getFechaNacimiento().getYear(), per.getFechaNacimiento().getMonthValue() - 1, per.getFechaNacimiento().getDayOfMonth());\\n\\n if (modelo.validaciones.Validar.esCedula(cedula) == true) {\\n frmPersona.getCmbTipoId().setSelectedItem(\\\"CEDULA\\\");\\n } else {\\n frmPersona.getCmbTipoId().setSelectedItem(\\\"PASAPORTE\\\");\\n }\\n frmPersona.getTxtIdentificacion().setEnabled(true);\\n //frmPersona.getCmbTipoId().setSelectedItem(per.getIdPersona());\\n frmPersona.getTxtIdentificacion().setText(per.getIdentificacion());\\n frmPersona.getTxtCallePrincipal().setText(per.getCallePrincipal());\\n frmPersona.getTxtCalleSecundaria().setText(per.getCalleSecundaria());\\n frmPersona.getTxtCelular().setText(per.getCelular());\\n frmPersona.getTxtCorreo().setText(per.getCorreo());\\n frmPersona.getTxtNumeroCasa().setText(per.getNumeroCasa());\\n frmPersona.getTxtPrimerApellido().setText(per.getPrimerApellido());\\n frmPersona.getTxtPrimerNombre().setText(per.getPrimerNombre());\\n frmPersona.getTxtReferencia().setText(per.getReferencia());\\n frmPersona.getTxtSector().setText(per.getSector());\\n frmPersona.getTxtSegundoApellido().setText(per.getSegundoApellido());\\n frmPersona.getTxtSegundoNombre().setText(per.getSegundoNombre());\\n frmPersona.getTxtTelefono().setText(per.getTelefono());\\n //frmPersona.getJdfechaNacimiento().setDate(fecha);\\n if (per.getEstadoCivil() == null) {\\n frmPersona.getCmbEstadoCivil().setSelectedItem(\\\"SELECCIONE\\\");\\n } else {\\n frmPersona.getCmbEstadoCivil().setSelectedItem(per.getEstadoCivil());\\n }\\n //Discapacidad\\n if (per.isDiscapacidad() == false) {\\n activarDiscapacidad();\\n frmPersona.getCbxDiscapacidad().setSelected(false);\\n frmPersona.getCmbTipoDiscapacidad().setSelectedItem(\\\"SELECCIONE\\\");\\n frmPersona.getTxtCarnetConadis().setText(\\\"\\\");\\n frmPersona.getTxtPorcentaje().setText(\\\"\\\");\\n } else {\\n\\n frmPersona.getCbxDiscapacidad().setSelected(per.isDiscapacidad());\\n activarDiscapacidad();\\n frmPersona.getCmbTipoDiscapacidad().setSelectedItem(per.getTipoDiscapacidad());\\n frmPersona.getTxtCarnetConadis().setText(per.getCarnetConadis());\\n frmPersona.getTxtPorcentaje().setText(per.getPorcentajeDiscapacidad() + \\\"\\\");\\n }\\n\\n if (per.getIdiomaRaiz() == null) {\\n frmPersona.getCmbIdiomas().setSelectedItem(\\\"SELECCIONE\\\");\\n } else {\\n frmPersona.getCmbIdiomas().setSelectedItem(per.getIdiomaRaiz());\\n }\\n\\n if (per.getCategoriaMigratoria() == null) {\\n frmPersona.getCmbCategoriaMigratoria().setSelectedItem(\\\"SELECCIONE\\\");\\n } else {\\n frmPersona.getCbxCategoriaMigratoria().isSelected();\\n activarCategoriaMigratoria();\\n frmPersona.getCmbCategoriaMigratoria().setSelectedItem(per.getCategoriaMigratoria());\\n }\\n\\n // frmPersona.getJdcFechaNacimiento().setSelectedDate(fecha_Nacimiento);\\n frmPersona.getJdfechaNacimiento().setCalendar(fecha_Nacimiento);\\n String sexo = per.getSexo() + \\\"\\\";\\n if (\\\"H\\\".equals(sexo)) {\\n sexo = \\\"HOMBRE\\\";\\n } else {\\n sexo = \\\"MUJER\\\";\\n }\\n frmPersona.getCmbSexo().setSelectedItem(sexo);\\n\\n frmPersona.getCmbTipoSangre().setSelectedItem(per.getTipoSangre().trim());\\n frmPersona.getCmbGenero().setSelectedItem(per.getGenero());\\n frmPersona.getCmbEtnia().setSelectedItem(per.getEtnia());\\n frmPersona.getCmbTipoResidencia().setSelectedItem(per.getTipoResidencia());\\n //Codigo postal\\n frmPersona.getCmbNacionalidad().setSelectedItem(per.getLugarNatal());\\n frmPersona.getCmbProvincia().setSelectedItem(per.getLugarNatal());\\n frmPersona.getCmbCanton().setSelectedItem(per.getLugarNatal());\\n\\n frmPersona.getCmbProvinciaReside().setSelectedItem(per.getLugarResidencia());\\n frmPersona.getCmbParroquiaReside().setSelectedItem(per.getLugarResidencia());\\n frmPersona.getCmbPaisReside().setSelectedItem(per.getLugarResidencia());\\n frmPersona.getCmbCantonReside().setSelectedItem(per.getLugarResidencia());\\n\\n //Cargar foto\\n if (per.getFoto() != null) {\\n Image icono = per.getFoto().getScaledInstance(frmPersona.getLblFoto().getWidth(),\\n frmPersona.getLblFoto().getHeight(), Image.SCALE_SMOOTH);\\n frmPersona.getLblFoto().setIcon(new ImageIcon(icono));\\n frmPersona.getLblFoto().updateUI();\\n } else {\\n //Si existe uan foto la borramos \\n frmPersona.getLblFoto().setIcon(null);\\n frmPersona.getLblFoto().updateUI();\\n }\\n //Cargamos los combos de lugar \\n int nvlLugarNac = 0;\\n if (per.getLugarNatal() != null) {\\n nvlLugarNac = Integer.parseInt(per.getLugarNatal().getNivel());\\n }\\n String ciudad = null, distrito = null;\\n if (nvlLugarNac == 3) {\\n //Guardamos el nombre del ciudad/canton para luego selecionarlo\\n ciudad = per.getLugarNatal().getNombre();\\n per.setLugarNatal(LBD.buscar(per.getLugarNatal().getIdReferencia()));\\n }\\n //Ahora preguntamos nuevamente el nivel del lugar \\n nvlLugarNac = Integer.parseInt(per.getLugarNatal().getNivel());\\n if (nvlLugarNac == 2) {\\n //Guardamos el nombre del distrito/provincia para luego selecionarlo\\n distrito = per.getLugarNatal().getNombre();\\n per.setLugarNatal(LBD.buscar(per.getLugarNatal().getIdReferencia()));\\n }\\n //Ahora preguntamos nuevamente el nivel \\n nvlLugarNac = Integer.parseInt(per.getLugarNatal().getNivel());\\n if (nvlLugarNac == 1) {\\n cargarPaises();\\n frmPersona.getCmbNacionalidad().setSelectedItem(per.getLugarNatal().getNombre());\\n //Seteamos el nuevo lugar de una\\n if (distrito != null) {\\n frmPersona.getCmbProvincia().setSelectedItem(distrito);\\n }\\n if (ciudad != null) {\\n frmPersona.getCmbCanton().setSelectedItem(ciudad);\\n }\\n }\\n int nvlLugarRes;\\n System.out.println(\\\"Nivel de lugar residencia \\\" + per.getLugarResidencia().getNivel());\\n if (per.getLugarResidencia().getNivel() == null) {\\n nvlLugarRes = 0;\\n } else {\\n nvlLugarRes = Integer.parseInt(per.getLugarResidencia().getNivel());\\n }\\n String parroquia = null, canton = null, provincia = null;\\n if (nvlLugarRes == 4) {\\n //Guardamos el nombre del parroquia para luego selecionarlo\\n parroquia = per.getLugarResidencia().getNombre();\\n per.setLugarResidencia(LBD.buscar(per.getLugarResidencia().getIdReferencia()));\\n }\\n //Ahora preguntamos nuevamente el nivel del lugar \\n if (per.getLugarResidencia().getNivel() == null) {\\n nvlLugarRes = 0;\\n } else {\\n nvlLugarRes = Integer.parseInt(per.getLugarResidencia().getNivel());\\n }\\n if (nvlLugarRes == 3) {\\n //Guardamos el nombre del canton para luego selecionarlo\\n canton = per.getLugarResidencia().getNombre();\\n per.setLugarResidencia(LBD.buscar(per.getLugarResidencia().getIdReferencia()));\\n }\\n //Ahora preguntamos nuevamente el nivel del lugar \\n if (per.getLugarResidencia().getNivel() == null) {\\n nvlLugarRes = 0;\\n } else {\\n nvlLugarRes = Integer.parseInt(per.getLugarResidencia().getNivel());\\n }\\n if (nvlLugarRes == 2) {\\n //Guardamos el nombre del provincia para luego selecionarlo\\n provincia = per.getLugarResidencia().getNombre();\\n per.setLugarResidencia(LBD.buscar(per.getLugarResidencia().getIdReferencia()));\\n }\\n //Ahora preguntamos nuevamente el nivel \\n if (per.getLugarResidencia().getNivel() == null) {\\n nvlLugarRes = 0;\\n } else {\\n nvlLugarRes = Integer.parseInt(per.getLugarResidencia().getNivel());\\n }\\n System.out.println(\\\"Pais reside \\\" + per.getLugarResidencia().getNombre());\\n if (nvlLugarRes == 1) {\\n frmPersona.getCmbPaisReside().setSelectedItem(per.getLugarResidencia().getNombre());\\n //Seteamos el nuevo lugar de una\\n if (provincia != null) {\\n frmPersona.getCmbProvinciaReside().setSelectedItem(provincia);\\n }\\n if (canton != null) {\\n frmPersona.getCmbCantonReside().setSelectedItem(canton);\\n }\\n if (parroquia != null) {\\n frmPersona.getCmbParroquiaReside().setSelectedItem(parroquia);\\n }\\n }\\n iniciarValidaciones();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d9b875ea9e63300929e436a3d4c755f\",\n \"score\": \"0.63678896\",\n \"text\": \"public void supprimer(){\\n this.setEtat(false);\\n this.update();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"32f4fa7f5288767f769c8a64d29ff237\",\n \"score\": \"0.6306608\",\n \"text\": \"@Override\\n\\t\\tpublic void onClick(View v) {\\n\\t\\t\\ttry\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(v.getId()==R.id.btndel4)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(cursor!=null&&cursor.getCount()>=0)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tAlertDialog.Builder bu=new AlertDialog.Builder(p4.this);\\n\\t\\t\\t\\t\\t\\tbu.setTitle(\\\"確定刪除\\\");\\n\\t\\t\\t\\t\\t\\tbu.setMessage(\\\"確定要刪除這筆資料?\\\");\\n\\t\\t\\t\\t\\t\\tbu.setNegativeButton(\\\"取消\\\", new DialogInterface.OnClickListener() {\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t@Override\\n\\t\\t\\t\\t\\t\\t\\tpublic void onClick(DialogInterface arg0, int arg1) {\\n\\t\\t\\t\\t\\t\\t\\t\\t// TODO Auto-generated method stub\\n\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t\\tbu.setPositiveButton(\\\"確定 \\\", \\n\\t\\t\\t\\t\\t\\t\\t\\tnew DialogInterface.OnClickListener(){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tpublic void onClick(DialogInterface dialog, int i){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif(db.delete(myid))\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tClearEdit();\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfinish();\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t\\tbu.show();\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(v.getId()==R.id.btnedit4)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tString name2=editname.getText().toString();\\n\\t\\t\\t\\t\\tlong coco2=Long.parseLong(editcoco.getText().toString());\\n\\t\\t\\t\\t\\tint day2= Integer.parseInt(editday.getText().toString());\\n\\t\\t\\t\\t\\tif(db.update(myid,day2,name2,coco2)){\\n\\t\\t\\t\\t\\t\\tClearEdit();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tfinish();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tcatch(Exception err){\\n\\t\\t\\t\\tToast.makeText(getApplicationContext(), \\\"資料不正確\\\", Toast.LENGTH_SHORT).show();\\n\\t\\t\\t}\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8fe176fc9a56d4a2fb301ef5a916d875\",\n \"score\": \"0.6300824\",\n \"text\": \"public void ApriEliminaModificaContatto(){\\n fp.dispose();\\n femc = new FinestraEliminaModificaContatto();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d9bac9603bbc108af8b38b75f1bf2ff\",\n \"score\": \"0.629589\",\n \"text\": \"private void accionCancelar() {\\n this.controlador.mostrarEliminar();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3965629fd617cc181f13d4c1c698431e\",\n \"score\": \"0.62655324\",\n \"text\": \"public void conexionTransaccionEditar() {\\n\\n Session miSesion = ConexionHibernate.tomarConexion();\\n\\n try {\\n miSesion.beginTransaction();\\n transaccionEditar(miSesion);\\n miSesion.getTransaction().commit();\\n\\n DesktopNotify.showDesktopMessage(\\\" exito \\\", \\\" Registro editado con exito\\\", DesktopNotify.SUCCESS, 7000);\\n } catch (Exception e) {\\n DesktopNotify.showDesktopMessage(\\\" error \\\", \\\" Error al intentar editar registro\\\", DesktopNotify.ERROR, 7000);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"228172eddf8fa07f35ebb8bdee99ddc2\",\n \"score\": \"0.62527525\",\n \"text\": \"public void baja(View v) {\\n AdminSQLiteOpenHelper admin = new AdminSQLiteOpenHelper(this, \\\"contactos\\\", null, 1);\\n SQLiteDatabase bd = admin.getWritableDatabase();\\n String e_id_a = id_a.getText().toString();\\n //Condicion que indica si el campo esta vacio que muestre un mensaje.\\n if (e_id_a.matches(\\\"\\\")) {\\n Toast.makeText(this, \\\"Debes de indicar un ID!\\\", Toast.LENGTH_SHORT).show();\\n return;\\n } else {\\n //Permite eliminar los registros de la tabla mediante una condicion.\\n int cant = bd.delete(\\\"contactos\\\", \\\"id_A=\\\" + e_id_a, null);\\n //Se cierra la base de datos.\\n bd.close();\\n //Codigo que nos permite limpiar los editText.\\n id_a.setText(\\\"\\\");\\n nombre.setText(\\\"\\\");\\n apellidop.setText(\\\"\\\");\\n apellidom.setText(\\\"\\\");\\n email.setText(\\\"\\\");\\n telefono.setText(\\\"\\\");\\n edad.setText(\\\"\\\");\\n //Cant Devuelve dos valores si es 1 muestra un mensaje satisfactorio.\\n if (cant == 1) {\\n Toast.makeText(this, \\\"Se borró el estudiante\\\", Toast.LENGTH_SHORT).show();\\n id_a.requestFocus();\\n //Si no lo es muestra un mensaje de error.\\n } else {\\n Toast.makeText(this, \\\"No existe el estudiante, ingrese un ID registrado\\\", Toast.LENGTH_SHORT).show();\\n id_a.requestFocus();\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c0cd8a8f82eb62dd11e44b0a63e8d86\",\n \"score\": \"0.6252142\",\n \"text\": \"@Override\\n\\tpublic void editar(Receita receita) throws DaoException {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b90c5a99d064fb49804b3a17bcde397\",\n \"score\": \"0.6245532\",\n \"text\": \"private void limpiarFormulario()\\r\\n/* 1662: */ {\\r\\n/* 1663:1546 */ limpiarDestinatario();\\r\\n/* 1664:1547 */ this.modeloDatosAdicionales.deleteAllRows();\\r\\n/* 1665: */ \\r\\n/* 1666:1549 */ this.txtCedulaTrans.setText(null);\\r\\n/* 1667:1550 */ this.txtRazonSocTrans.setText(null);\\r\\n/* 1668:1551 */ this.transportistaSeleccionado = null;\\r\\n/* 1669:1552 */ this.txtPlaca.setText(null);\\r\\n/* 1670:1553 */ this.txtDirecPartida.setText(null);\\r\\n/* 1671: */ \\r\\n/* 1672:1555 */ this.btnFirmarProcesar.setEnabled(false);\\r\\n/* 1673:1556 */ this.btnGuardar.setEnabled(false);\\r\\n/* 1674: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"92ea3a71f8e602b1d80f2a9a07f7daf7\",\n \"score\": \"0.6238871\",\n \"text\": \"public void modificarLibro(){\\r\\n \\r\\n /**\\r\\n * Creacion de metodo para eliminar libro existente\\r\\n */ \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"05900d21956f63b11c30be6c29828d4c\",\n \"score\": \"0.62294173\",\n \"text\": \"public void editAction(int idx) {\\n\\t\\ttry\\n\\t\\t{\\n\\t\\t\\tsetResponsePage(this);\\n\\t\\t\\tif(idx==0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tktanggaljual.remove(ro);\\n\\t\\t\\t\\tkvalutajual.remove(ro);\\n\\t\\t\\t\\tnvalutajual.remove(ro);\\n\\t\\t\\t\\tpotonganjual.remove(ro);\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tktanggalpokok.remove(ro);\\n\\t\\t\\t\\tkvalutapokok.remove(ro);\\n\\t\\t\\t\\tnvalutapokok.remove(ro);\\n\\t\\t\\t\\tpotonganpokok.remove(ro);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcatch(Exception ex){}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e2a890a1d80fa224d141194815cb4d56\",\n \"score\": \"0.6216442\",\n \"text\": \"public void cancelarRegistroDocente() {\\r\\n validacionesNombre = false;\\r\\n validacionesApellido = false;\\r\\n validacionesCorreo = false;\\r\\n validacionesCorreoOpcional = true;\\r\\n validacionesID = false;\\r\\n validacionesTel1 = true;\\r\\n validacionesTel2 = true;\\r\\n validacionesDireccion = true;\\r\\n validacionesCargo = false;\\r\\n validacionesFacultad = false;\\r\\n validacionesDepartamento = false;\\r\\n mensajeFormulario = \\\"\\\";\\r\\n //\\r\\n activarDepartamento = true;\\r\\n inputApellido = null;\\r\\n inputFacultad = null;\\r\\n inputDireccion = null;\\r\\n inputEmail = null;\\r\\n inputEmailOpcional = null;\\r\\n inputID = null;\\r\\n inputNombre = null;\\r\\n inputDepartamento = null;\\r\\n inputCargo = null;\\r\\n listaFacultades = null;\\r\\n listaDepartamentos = null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"71d2d6b0f100cddc58b7b4e029464789\",\n \"score\": \"0.62143946\",\n \"text\": \"public void cancelarDespesa() {\\n new AlertDialog.Builder(NovaDespesa.this)\\n .setTitle(R.string.atencao)\\n .setMessage(R.string.cancelar_despesa)\\n .setPositiveButton(R.string.sim, new DialogInterface.OnClickListener() {\\n @Override\\n public void onClick(DialogInterface dialogInterface, int i) {\\n if (!editar) {\\n db.excluirDespesa(idDespesa);\\n }\\n Intent intent = new Intent(NovaDespesa.this, MainActivity.class);\\n startActivity(intent);\\n finish();\\n }\\n })\\n .setNegativeButton(R.string.cancelar, null)\\n .show();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb742d73d434d43c110e443b64c7606d\",\n \"score\": \"0.62137187\",\n \"text\": \"public String editar()\\r\\n/* 116: */ {\\r\\n/* 117:149 */ if (getFacturaProveedor().getId() > 0) {\\r\\n/* 118: */ try\\r\\n/* 119: */ {\\r\\n/* 120:151 */ this.servicioFacturaProveedor.esEditable(this.facturaProveedor);\\r\\n/* 121:153 */ if (!this.facturaProveedor.getEstado().equals(Estado.CERRADO))\\r\\n/* 122: */ {\\r\\n/* 123:154 */ setIndicadorRenderPanelImportacion(Boolean.valueOf(true));\\r\\n/* 124:155 */ this.facturaProveedor = this.servicioFacturaProveedor.cargarDetalle(Integer.valueOf(this.facturaProveedor.getId()));\\r\\n/* 125:156 */ cargarDirecciones();\\r\\n/* 126:157 */ setEditado(true);\\r\\n/* 127: */ }\\r\\n/* 128: */ else\\r\\n/* 129: */ {\\r\\n/* 130:159 */ addInfoMessage(getLanguageController().getMensaje(\\\"msg_error_factura_proveedor_importacion_cerrado\\\"));\\r\\n/* 131: */ }\\r\\n/* 132: */ }\\r\\n/* 133: */ catch (ExcepcionAS2Financiero e)\\r\\n/* 134: */ {\\r\\n/* 135:163 */ addErrorMessage(getLanguageController().getMensaje(e.getCodigoExcepcion()));\\r\\n/* 136:164 */ LOG.info(\\\"ERROR AL EDITAR FACTURA PROVEEDOR:\\\", e);\\r\\n/* 137: */ }\\r\\n/* 138: */ catch (ExcepcionAS2Compras e)\\r\\n/* 139: */ {\\r\\n/* 140:167 */ addErrorMessage(getLanguageController().getMensaje(e.getCodigoExcepcion()));\\r\\n/* 141:168 */ LOG.info(\\\"ERROR AL EDITAR FACTURA PROVEEDOR:\\\", e);\\r\\n/* 142: */ }\\r\\n/* 143: */ catch (Exception e)\\r\\n/* 144: */ {\\r\\n/* 145:171 */ addErrorMessage(getLanguageController().getMensaje(\\\"msg_error_editar\\\"));\\r\\n/* 146:172 */ LOG.error(\\\"ERROR AL EDITAR FACTURA PROVEEDOR:\\\", e);\\r\\n/* 147: */ }\\r\\n/* 148: */ } else {\\r\\n/* 149:175 */ addInfoMessage(getLanguageController().getMensaje(\\\"msg_info_seleccionar\\\"));\\r\\n/* 150: */ }\\r\\n/* 151:178 */ return \\\"\\\";\\r\\n/* 152: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ef4e8dda986b32eeaad950846ad2b5a\",\n \"score\": \"0.62097657\",\n \"text\": \"public void cancelarModificacionPersona(View v)\\n\\t{\\n\\t\\tfinish();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"226e7abca2931b84b9db33a5b1be1144\",\n \"score\": \"0.6209535\",\n \"text\": \"@Override\\n\\tpublic void deletar() {\\n\\t\\t\\n\\t\\titens.clear(); //Acho que funciona assim\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"Pasta '\\\" + getNome() + \\\"' apagada com sucesso!\\\"); //simula remocao da pasta\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81ac38d8494b9fcc9390f09cd833e813\",\n \"score\": \"0.6203758\",\n \"text\": \"public void cerrarDocumentoLectura();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1579996019eee1a49fab01dc88ce8601\",\n \"score\": \"0.6203667\",\n \"text\": \"private void btnEliminarActionPerformed(java.awt.event.ActionEvent evt) {\\n UsuarioBE objUsuario =new UsuarioBE();\\n if(this.tblPerfil.getSelectedRow()==-1){\\n String texto=\\\"Error, por favor seleccionar un usuario\\\";\\n }else{\\n PerfilBE objPerfil= this.arrPerfiles.get(this.tblPerfil.getSelectedRow());\\n if ((objPerfil.getEstado().equals(\\\"Activo\\\")) || (objPerfil.getEstado().equals(\\\"ACTIVO\\\"))) {\\n dlgAvisoConfirmacion aviso=new dlgAvisoConfirmacion(javax.swing.JOptionPane.getFrameForComponent(this),true,\\\"Desea continuar con la operacion?\\\");\\n aviso.setVisible(true);\\n if(aviso.getReturnStatus()==1) {\\n if (objPerfilBL.eliminarperfil(objPerfil, 2)){\\n// se agrega para auditoria\\n// objTransaccionBE = new TransaccionBE();\\n// objTransaccionBL = new TransaccionBL();\\n// Accion=\\\"Eliminar\\\";\\n//\\n// objUsuario=frmVentanaPrincipal.usuarioActual;\\n// codlog=frmVentanaPrincipal.logActual;\\n// codusuario = objUsuario.getCodUsuario();\\n// objTransaccionBE = cargarTransaccion(objUsuario,Accion,codmodulo,codusuario,codlog);\\n// resp=objTransaccionBL.registrarTransaccion(objTransaccionBE);\\n// fin de lo agregado para auditoria\\n String texto = \\\"Perfil Eliminado correctamente\\\";\\n }\\n String Modulo;\\n Modulo=(String)this.cmbModulo.getSelectedItem();\\n arrPerfiles = this.objPerfilBL.listarPerfilModulo(objPerfilBE,Modulo);\\n cargarTabla(null,null,arrPerfiles);\\n }\\n }else{\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e2ee9ff1bdd27499d86bcc9f0d6c1aa5\",\n \"score\": \"0.6194897\",\n \"text\": \"private void refrescar() {\\n Conector cone = new Conector();\\n \\n AgenciaDAO agenciaDAO = new AgenciaDAO(cone.miconector);\\n List <AgenciaDTO> agencias = agenciaDAO.agenciaGeneralDAO();\\n \\n DefaultTableModel modeloTabla = new DefaultTableModel();\\n tblAgencias.setModel(modeloTabla);\\n \\n modeloTabla.addColumn(\\\"ID\\\");\\n modeloTabla.addColumn(\\\"Nombre\\\");\\n modeloTabla.addColumn(\\\"Ciudad\\\");\\n modeloTabla.addColumn(\\\"Telefono\\\");\\n \\n Object[] columna = new Object[4];\\n \\n int objGuardados = agencias.size();\\n \\n for (int i = 0; i < objGuardados; i++) {\\n columna[0] = agencias.get(i).getId_agencia();\\n columna[1] = agencias.get(i).getNombre();\\n columna[2] = agencias.get(i).getCiudad();\\n columna[3] = agencias.get(i).getTelefono();\\n modeloTabla.addRow(columna);\\n }\\n cone.cerrar();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d3dc7be94f74c0af72e1f344524444c\",\n \"score\": \"0.61705035\",\n \"text\": \"public void vaciarCuestionarioBasico() {\\n db.execSQL(\\\"DELETE FROM cuestionariobasico\\\");\\n// db.execSQL(\\\"delete table if exists cuestionariobasico\\\");\\n// db.execSQL(\\\"drop table if exists cuestionariobasico\\\");\\n// db.execSQL(\\\"create table cuestionariobasico\\\");\\n db.close();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e72a9561282880184fb2e95d2308d077\",\n \"score\": \"0.61702806\",\n \"text\": \"private void jButtonDestrezaActionPerformed(java.awt.event.ActionEvent evt) {\\r\\n ControladorPrincipal.getSingleton().subirNivelPJ(2);\\r\\n ControladorMazmorra.getSingleton().reiniciarPosicion();\\r\\n ControladorGUI.getSingleton().ventanaMazmorra();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0eaf01de853548d7811d57f91e93f57\",\n \"score\": \"0.6168464\",\n \"text\": \"public void modificar(){\\n System.out.println(\\\"No hay modificaciones exclusivas\\\"); \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e824f915582db6cac48d7eafe489daed\",\n \"score\": \"0.6151443\",\n \"text\": \"@Override\\n public void onClick(View v) {\\n binding.etEditarNombre.setError(null);\\n binding.etEditarEdad.setError(null);\\n binding.etEditarColor.setError(null);\\n // Crear la mascota con los nuevos cambios pero ponerle\\n // el id de la anterior\\n String nuevoNombre = binding.etEditarNombre.getText().toString();\\n String posibleNuevaEdad = binding.etEditarEdad.getText().toString();\\n String nuevoColor = binding.etEditarColor.getText().toString();\\n if (nuevoNombre.isEmpty()) {\\n binding.etEditarNombre.setError(\\\"Escribe el nombre\\\");\\n binding.etEditarNombre.requestFocus();\\n return;\\n }\\n if (posibleNuevaEdad.isEmpty()) {\\n binding.etEditarEdad.setError(\\\"Escribe la edad\\\");\\n binding.etEditarEdad.requestFocus();\\n return;\\n }\\n if (nuevoColor.isEmpty()) {\\n binding.etEditarColor.setError(\\\"Escribe el nombre\\\");\\n binding.etEditarColor.requestFocus();\\n return;\\n }\\n // Si no es entero, igualmente marcar error\\n int nuevaEdad;\\n try {\\n nuevaEdad = Integer.parseInt(posibleNuevaEdad);\\n } catch (NumberFormatException e) {\\n binding.etEditarEdad.setError(\\\"Escribe un número\\\");\\n binding.etEditarEdad.requestFocus();\\n return;\\n }\\n // Si llegamos hasta aquí es porque los datos ya están validados\\n com.example.pmdm_to03_parte2_raul_villodres_moreno.Mascota mascotaConNuevosCambios = new com.example.pmdm_to03_parte2_raul_villodres_moreno.Mascota(nuevoNombre, nuevaEdad, nuevoColor, mascota.getId());\\n int filasModificadas = mascotasController.guardarCambios(mascotaConNuevosCambios);\\n if (filasModificadas != 1) {\\n // De alguna forma ocurrió un error porque se debió modificar únicamente una fila\\n Toast.makeText(com.example.pmdm_to03_parte2_raul_villodres_moreno.EditarMascotaActivity.this, \\\"Error guardando cambios. Intente de nuevo.\\\", Toast.LENGTH_SHORT).show();\\n } else {\\n // Si las cosas van bien, volvemos a la principal\\n // cerrando esta actividad\\n finish();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f88cfef3c74fea71fe13bc00855bd21f\",\n \"score\": \"0.61482096\",\n \"text\": \"@Override\\r\\n\\tpublic void editarDados() {\\n\\t\\tsuper.editarDadosDeFuncionario();\\r\\n\\t\\tsetNumeroDeHabilitacao();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a85215e8fd370783c00ce31ad65fd5b\",\n \"score\": \"0.6128635\",\n \"text\": \"public void borrar() {\\r\\n referencia = 0;\\r\\n nombre = null;\\r\\n nota = 0;\\r\\n tNombre.setText(null);\\r\\n tNota.setText(null);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d497f5e9ee1c02bd1ac0cbe4dc66e94\",\n \"score\": \"0.611978\",\n \"text\": \"public void modificar() {\\r\\n this.enModificar = true;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2380e83f10b011089c893655fd90f095\",\n \"score\": \"0.6114203\",\n \"text\": \"public void guardar() {\\n\\t\\ttry {\\n\\t\\t\\tboolean flag = editorialRepo.insertar(editorial);\\n\\t if(flag) {\\n\\t \\tthis.limpiarFormulario();\\n\\t \\tMessage.messageInfo(\\\"Editorial creada\\\");\\n\\t }else {\\n\\t \\tMessage.messageError(\\\"No se pudo crear la editorial\\\");\\n\\t }\\n\\t\\t} catch (Exception e) {\\n\\t\\t\\tMessage.messageError(\\\"Ocurrió un error al crear la editorial\\\");\\n\\t\\t\\tSystem.out.println(e.getMessage());\\n\\t\\t}\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7baa271f31bbe6ef50305a98f59b5b9e\",\n \"score\": \"0.6113982\",\n \"text\": \"public void editAction() {\\n\\t\\ttry\\n\\t\\t{\\n\\t\\t\\tsetResponsePage(this);\\n\\t\\t\\treadOnly(false);\\n\\t\\t\\tkbarang.add(ro);\\n\\t\\t\\tnbarang.add(ro);\\n\\t\\t\\tsatuan.add(ro);\\n\\t\\t\\tkbarang1.add(ro);\\n\\t\\t}\\n\\t\\tcatch(Exception ex){}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0afac6aa17ccb30c903e093dead134e9\",\n \"score\": \"0.6102712\",\n \"text\": \"public void modificacion (View v) {\\n AdminSQLiteOpenHelper admin = new AdminSQLiteOpenHelper(this, \\\"contactos\\\", null, 1);\\n SQLiteDatabase bd = admin.getWritableDatabase();\\n //Se declaran las variables y se igualan al campo para obtener los datos.\\n String e_id_a = id_a.getText().toString();\\n String e_nombre = nombre.getText().toString();\\n String e_apellidop = apellidop.getText().toString();\\n String e_apellidom = apellidom.getText().toString();\\n String e_email = email.getText().toString();\\n String e_telefono = telefono.getText().toString();\\n String e_edad = edad.getText().toString();\\n //Creamos el registro a insertar como objeto ContentValues\\n ContentValues registro = new ContentValues();\\n registro.put(\\\"id_A\\\", e_id_a);\\n registro.put(\\\"nombre\\\", e_nombre);\\n registro.put(\\\"apellido_p\\\", e_apellidop);\\n registro.put(\\\"apellido_m\\\", e_apellidom);\\n registro.put(\\\"email\\\", e_email);\\n registro.put(\\\"telefono\\\", e_telefono);\\n registro.put(\\\"edad\\\", e_edad);\\n //Condicion que indica si el campo esta vacio que muestre un mensaje.\\n if (e_id_a.matches(\\\"\\\")) {\\n Toast.makeText(this, \\\"Debes de indicar un ID!\\\", Toast.LENGTH_SHORT).show();\\n return;\\n } else {\\n //Permite actualizar los registros de la tabla mediante una condicion.\\n int cant = bd.update(\\\"contactos\\\", registro, \\\"id_A=\\\" + e_id_a, null);\\n //Se cierra la base de datos.\\n bd.close();\\n //Cant Devuelve dos valores si es 1 muestra un mensaje satisfactorio.\\n if (cant == 1) {\\n Toast.makeText(this, \\\"Se modificaron los datos del estudiante\\\", Toast.LENGTH_SHORT).show();\\n id_a.requestFocus();\\n //Si no lo es muestra un mensaje de error.\\n } else {\\n Toast.makeText(this, \\\"No existe el estudiante, ingrese un ID registrado\\\", Toast.LENGTH_SHORT).show();\\n id_a.requestFocus();\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f7704f1f373f493996707f25eabcdde\",\n \"score\": \"0.6098564\",\n \"text\": \"@Override\\r\\n\\tpublic void edit() {\\n\\t\\tdetallePrueba.load();\\r\\n\\t\\tdetallePrueba.init();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e1f537a521a5c4d9a362e01334be850\",\n \"score\": \"0.6094298\",\n \"text\": \"public void cerrarFormularioDeModificado() {\\r\\n\\t\\tthis.formDeModificado.clear();\\r\\n\\t\\tthis.formDeModificado.dispose();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"147cee910bd80b963e8bb340874c24a7\",\n \"score\": \"0.6093777\",\n \"text\": \"public void cancelarRegistro() {\\n UtileriaInterfazUsuario.mostrarVentana(getClass(), \\\"key.principal\\\",\\n \\\"Principal.fxml\\\", textFieldNombreUsuario);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f590a146d2ccfa48b3c8e150fbb15c7\",\n \"score\": \"0.6090041\",\n \"text\": \"public void modeloEliminado() {\\n \\n guardarModeloHabilitado( false );\\n archivo = null;\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39294f75f4a5775dbaa4f1f147a3375c\",\n \"score\": \"0.60892886\",\n \"text\": \"public void alterar(){\\n\\t\\tFacesContext faces = FacesContext.getCurrentInstance();\\n\\t\\tboolean flag =true;\\n\\t\\tif(new Util().isCargoNomeRepetido(this.cargo)){\\n\\t\\t\\tfaces.addMessage(null, new FacesMessage(FacesMessage.SEVERITY_ERROR,\\n\\t\\t\\t\\t\\t\\\"Erro\\\", \\\"Cargo com esse nome já existe!\\\"));\\t\\n\\t\\t\\tflag = false;\\n\\t\\t}\\n\\t\\tif(flag){\\n\\t\\t\\tif(this.cargoDao.update(this.cargo,getDataPesquisa())){\\n\\t\\t\\t\\tfaces.addMessage(null, new FacesMessage(FacesMessage.SEVERITY_INFO,\\\"Informação\\\",\\\"Cargo alterado com sucesso!\\\"));\\n\\t\\t\\t\\tpreparaAmbiente();\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tfaces.addMessage(null, new FacesMessage(FacesMessage.SEVERITY_ERROR,\\\"Erro\\\",\\\"Ocorreu um erro no servidor, contate o administrador.\\\"));\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"789b3925a1a6a2624e941ca0d8af7458\",\n \"score\": \"0.60842085\",\n \"text\": \"public void limpaEdit(){\\n txtNome.setText(null);\\n jcbCargo.setSelectedIndex(0);\\n txtNumero.setText(null);\\n txtSigla.setText(null);\\n \\n txtNome.requestFocus();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c86860b0dc98e938638c2abfb5bc45b9\",\n \"score\": \"0.6073927\",\n \"text\": \"public void closeEditPanel() {\\r\\n\\t\\trootPanel.remove(PanelEdicion);\\r\\n\\t\\trootPanel.add(PanelEdicion, PanelFondoGeneral.getOffsetWidth()\\r\\n\\t\\t\\t\\t- Constants.TAMANOBOTOBEDITOFF, 0);\\r\\n\\t\\tPanelEdicion.setSize(Constants.TAMANOBOTOBEDITOFF+Constants.PX, \\\"50px\\\");\\r\\n\\t\\tPanelEdicion.clear();\\r\\n\\t\\tPanelEdicion.setStyleName(\\\"\\\");\\r\\n\\t\\tButton Boton = new Button();\\r\\n\\t\\tPanelEdicion.add(Boton, 0, 0);\\r\\n\\t\\tBoton.setHTML(ConstantsInformation.EDIT_BOTTON);\\r\\n\\t\\tBoton.addClickHandler(new ClickHandler() {\\r\\n\\r\\n\\t\\t\\t@Override\\r\\n\\t\\t\\tpublic void onClick(ClickEvent event) {\\r\\n\\t\\t\\t\\tOpenEditPanel();\\r\\n\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11c21e69905e2ff0fad45f699ce599b7\",\n \"score\": \"0.60711765\",\n \"text\": \"public void modificarMonto(){\\n operacionesOrdent operacionesordent2=operacionesordentEJB.find(operacionesordent.getId());\\n if (\\\"Costo asignado\\\".equals(operacionesordent2.getEstado())){\\n operacionesordentEJB.edit(operacionesordent);\\n \\n FacesContext.getCurrentInstance().addMessage(null, new FacesMessage(\\\"SE MODIFICO LA ORDEN\\\"+operacionesordent.getOrdentrabajo().getCodigo()));\\n init();\\n }else{\\n FacesContext.getCurrentInstance().addMessage(null,\\n new FacesMessage(\\\"LA ORDEN \\\" + operacionesordent.getOrdentrabajo().getCodigo()+\\\"YA TIENE COSTO NEGOCIADO\\\"));\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b215e6cf39c8b7fac28cdccbc1553164\",\n \"score\": \"0.60640836\",\n \"text\": \"private void cerrarVtn() {\\n frmPersona.addInternalFrameListener(new InternalFrameAdapter() {\\n @Override\\n public void internalFrameClosing(InternalFrameEvent e) {\\n frmPersona.getTxtIdentificacion().setText(\\\"\\\");\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f651bb745cffd09814d7139036c0aef\",\n \"score\": \"0.60394156\",\n \"text\": \"@Override\\n public void cerrarVentanas() {\\n ventanaMej.setVisible(false);\\n ventanaEst.setVisible(false);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8dedc85db4668c0162ea5a240e74e0ae\",\n \"score\": \"0.6036693\",\n \"text\": \"private void limpiarVenanaEmpleado() {\\n txtApellido.setText(\\\"\\\");\\n txtCuit.setText(\\\"\\\");\\n txtLegajo.setText(\\\"\\\");\\n txtConvenio.setText(\\\"\\\");\\n txtNombre.setText(\\\"\\\");\\n txtTarea.setText(\\\"\\\");\\n //BOTON\\n // btnGuardar.setEnabled(true);\\n btnAnular.setEnabled(false);\\n // falta par aque el cursor se situe en el campo legajo por defecyto\\n txtLegajo.requestFocus();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d4019778fcf1f8789a122e06c21082f\",\n \"score\": \"0.6034308\",\n \"text\": \"private void activarVista(String vista) {\\n/* 306 */ if (!vista.equals(\\\"nuevo\\\")) {\\n/* 307 */ HTMLElement sel = this.pagHTML.getElementDivCreacionRegistro();\\n/* 308 */ sel.getParentNode().removeChild(sel);\\n/* */ } \\n/* 310 */ if (!vista.equals(\\\"editar\\\")) {\\n/* 311 */ HTMLElement sel = this.pagHTML.getElementDivEdicion();\\n/* 312 */ sel.getParentNode().removeChild(sel);\\n/* */ } \\n/* 314 */ if (!vista.equals(\\\"consulta\\\")) {\\n/* 315 */ HTMLElement sel = this.pagHTML.getElementDivConsulta();\\n/* 316 */ sel.getParentNode().removeChild(sel);\\n/* 317 */ sel = this.pagHTML.getElementDivResultados();\\n/* 318 */ sel.getParentNode().removeChild(sel);\\n/* */ } \\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9cf09b8808147d5fed69272476584844\",\n \"score\": \"0.60259235\",\n \"text\": \"public void cancelEdit() {\\n \\tthis.item.restore(beforeEditItem);\\n this.item = new Editor();\\n edit = false;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab1315d1e901654158513b28c9fa9655\",\n \"score\": \"0.60236067\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void actionPerformed(ActionEvent e) {\\n\\t\\t\\t\\tsetBeansajout(new BeansAjoutEtape(txtlibelle.getText(), txtdesc.getText(), txtcin.getSelectedItem().toString()));\\n\\t\\t\\t\\tif(controle.editEtape(etape.getId_etape(), pan1)==false)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tJOptionPane.showMessageDialog(null,\\\"Ce Libelle déjà existe\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(null,\\\"Information(s) modifiées(s)\\\");\\n\\t\\t\\t\\tdispose();\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2cfe487855eb63b69200e106f6bd7624\",\n \"score\": \"0.6015003\",\n \"text\": \"public void effacerLesTournees() {\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tdb.execSQL(\\\"DELETE FROM \\\" + T_PLANTRA);\\r\\n\\t\\t\\tdb.execSQL(\\\"DELETE FROM \\\" + T_PRATICIEN);\\r\\n\\t\\t\\tdb.execSQL(\\\"DELETE FROM \\\" + T_TOURNEE);\\r\\n\\t\\t\\tdb.execSQL(\\\"DELETE FROM \\\" + T_VSTALERTE);\\r\\n\\t\\t\\teffacerReferenceVisitePraticienDebnflastvisite();\\r\\n\\t\\t\\tdb.execSQL(\\\"DELETE FROM \\\" + T_VISITE);\\r\\n\\t\\t\\tdb.execSQL(\\\"DELETE FROM \\\" + T_ORDO);\\r\\n\\t\\t\\t// db.execSQL(\\\"DELETE FROM \\\"+T_MEDECIN); a garder\\r\\n\\t\\t\\t// db.execSQL(\\\"DELETE FROM \\\"+T_BENEF); a garder\\r\\n\\t\\t\\t// db.execSQL(\\\"DELETE FROM \\\"+T_BNFCAISSE); a garder\\r\\n\\t\\t\\t// db.execSQL(\\\"DELETE FROM \\\"+T_BNFMUTUELLE); a garder\\r\\n\\t\\t\\tdb.execSQL(\\\"DELETE FROM \\\" + T_FACTURE);\\r\\n\\t\\t} catch (SQLException e) {\\r\\n\\t\\t\\tLogCatBuilder.WriteErrorToLog(context, TAG, R.string.error_databasetourneesclear, e);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"597c3a2014de14bfb8ece7a0ab7b3ed9\",\n \"score\": \"0.60089123\",\n \"text\": \"public void deact_polica(){\\n\\t\\tString status_police = (String) ra.getAttribute(\\\"InsuPolicyDialogLDB\\\", \\\"InsuPolicyDialog_txtAct\\\");\\n if (status_police.equalsIgnoreCase(\\\"I\\\")) {\\n \\tra.showMessage(\\\"wrnclt155\\\");\\n \\t\\t\\treturn;\\n \\t\\t}\\n\\t\\t \\n Integer update = (Integer) ra.showMessage(\\\"col_qer028\\\");\\n if (update != null && update.intValue() == 1) {\\n\\t\\t\\tra.setAttribute(\\\"InsuPolicyDialogLDB\\\",\\\"InsuPolicyDialog_txtDateUntil\\\", ra.getAttribute(\\\"GDB\\\", \\\"ProcessingDate\\\")); \\n\\t\\t\\tra.setAttribute(\\\"InsuPolicyDialogLDB\\\", \\\"IP_SPEC_STAT\\\", \\\"DA\\\");\\n\\t\\t\\tra.setAttribute(\\\"InsuPolicyDialogLDB\\\",\\\"proc_type_flag\\\",\\\"D\\\");\\n try {\\n ra.executeTransaction();\\n ra.showMessage(\\\"infclt102\\\");\\n } catch (VestigoTMException vtme) {\\n error(\\\"InsuPolicyDialog -> update(): VestigoTMException\\\", vtme);\\n if (vtme.getMessageID() != null)\\n ra.showMessage(vtme.getMessageID());\\n }\\n }\\n \\n ra.exitScreen();\\n ra.refreshActionList(\\\"tblInsuPolicy\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c7734ebb3d77a73baee885c248be29c\",\n \"score\": \"0.59944236\",\n \"text\": \"@FXML\\n\\tprivate void modificarEmpleado() {\\n\\n\\t\\tString cedula = txtCedula.getText();\\n\\t\\tString nombre = txtNombre.getText();\\n\\t\\tString apellido = txtApellido.getText();\\n\\t\\tString email = txtEmail.getText();\\n\\t\\tString contrasenia = passClave.getText();\\n\\t\\tDouble salario = Double.parseDouble(txtSalario.getText());\\n\\t\\tBoolean activo = true;\\n\\t\\tDate creacion = new Date();\\n\\n\\t\\tEmpleado persona = new Empleado(cedula, nombre, apellido, email, contrasenia, activo, creacion, salario);\\n\\n\\t\\tif (manejador.modificarEmpleado(persona)) {\\n \\n\\t\\t\\t//JOptionPane.showMessageDialog(null, persona.getCedula());\\n\\t\\t\\t//manejador.getEmpleadosObservables();\\n\\t\\t\\tUtilidades.mostrarMensaje(\\\"Registro modificado\\\", \\\"Registro modificado con exitoso!!\\\");\\n\\t\\t\\tescenarioEditar.close();\\n\\t\\t} else {\\n\\t\\t\\t//JOptionPane.showMessageDialog(null, persona.getCedula());\\n\\t\\t\\tUtilidades.mostrarMensaje(\\\"Registro modificado\\\", \\\"Error en modificar registro!!\\\");\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"daf1b994d2f107d5056834490a8e7de6\",\n \"score\": \"0.598593\",\n \"text\": \"public boolean ejecutarEditar() {\\n obtenerFormularioEditar();\\n conexionTransaccionEditar();\\n try {\\n getFormularioEditar().dispose();\\n } catch (NullPointerException e) {\\n }\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb970938691dcbd89460baac336156c6\",\n \"score\": \"0.5975692\",\n \"text\": \"public String editar() {\\n\\t\\tif (usuario.getId() == null) {\\n\\t\\t\\tmessage.sendErrorMessage(\\\"Sem ID para alterar o usuário, clique no ícone de editar na tabela.\\\");\\n\\t\\t\\treturn \\\"missing-id\\\";\\n\\t\\t\\t\\n\\t\\t//verifica se o usuario está trocando de email para um email que já existe.\\n\\t\\t} else {\\n\\t\\t\\t\\n\\t\\t\\tString email1 = usuario.getEmail();\\n\\t\\t\\tString email2 = DaoUsuario.findById(usuario.getId()).getEmail();\\n\\t\\t\\t\\n\\t\\t\\tif (!email1.equals(email2) && DaoUsuario.findByEmail(email1) != null) {\\n\\t\\t\\tmessage.sendErrorMessage(\\\"Esse e-mail já está em uso!\\\");\\n\\t\\t\\treturn \\\"email-existe\\\";\\n\\t\\t\\t\\n\\t\\t//chama o metodo de edição passando o usuario como parametro\\n\\t\\t} else {\\t\\n\\t\\t\\tdaoGeneric.updateMerge(usuario);\\n\\t\\t\\tmessage.sendInfoMessage(\\\"Editado com sucesso!\\\");\\n\\t\\t\\treturn \\\"usuario-editado\\\";\\n\\t\\t}\\n\\t\\t\\t\\n\\t }\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f262b5b582cb23fa149f6b76ce90ea37\",\n \"score\": \"0.59668964\",\n \"text\": \"public void borrarestudiante(String id){\\n SQLiteDatabase db = dbHelper.getWritableDatabase();\\n db.delete(\\\"estudiante\\\", \\\"_id=\\\" + id, null);\\n db.close();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bef53dd6afd4fe0e80270cbda29f47b9\",\n \"score\": \"0.5965076\",\n \"text\": \"private void btnGuardarActionPerformed(ActionEvent evt)\\r\\n/* 1709: */ {\\r\\n/* 1710:1588 */ String respuestaCrear = null;\\r\\n/* 1711:1589 */ GuiaRemision xmlRespuesta = null;\\r\\n/* 1712:1590 */ String archivoACrear = null;\\r\\n/* 1713: */ try\\r\\n/* 1714: */ {\\r\\n/* 1715:1593 */ if (this.modeloDetalle.getRowCount() > 0)\\r\\n/* 1716: */ {\\r\\n/* 1717:1595 */ xmlRespuesta = generarComprobante();\\r\\n/* 1718: */ \\r\\n/* 1719:1597 */ String nombreArchivo = this.claveDeAcceso + \\\".xml\\\";\\r\\n/* 1720:1598 */ archivoACrear = new ConfiguracionDirectorioSQL().obtenerDirectorio(DirectorioEnum.GENERADOS.getCode()).getPath() + File.separator + nombreArchivo;\\r\\n/* 1721: */ \\r\\n/* 1722: */ \\r\\n/* 1723:1601 */ respuestaCrear = ArchivoUtils.crearArchivoXml2(archivoACrear, xmlRespuesta, this.claveContingencia, this.secuencial, TipoComprobanteEnum.GUIA_DE_REMISION.getCode());\\r\\n/* 1724:1603 */ if (respuestaCrear == null) {\\r\\n/* 1725:1604 */ this.btnFirmarProcesar.setEnabled(false);\\r\\n/* 1726: */ }\\r\\n/* 1727: */ }\\r\\n/* 1728:1607 */ visualizar();\\r\\n/* 1729: */ }\\r\\n/* 1730: */ catch (Exception ex)\\r\\n/* 1731: */ {\\r\\n/* 1732:1609 */ Logger.getLogger(GuiaRemisionView.class.getName()).log(Level.SEVERE, null, ex);\\r\\n/* 1733: */ }\\r\\n/* 1734: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d11af9cb37fe7efe85b920a61ff42ac7\",\n \"score\": \"0.59624004\",\n \"text\": \"public void modificaveicolo() {\\n frame.getContentPane().removeAll();\\n frame.getContentPane().setLayout(new BorderLayout());\\n frame.setLocationRelativeTo(null);\\n frame.setVisible(true);\\n // Create UI elements\\n\\n ModificaVeicoloLabel = new JLabel(\\\"Targa del veicolo da modificare : \\\");\\n TargaVeicoloModificaTextField = new JTextField();\\n ModificaProsegui = new JButton(\\\"Modifica\\\");\\n Indietro = new JButton(\\\"Indietro\\\");\\n\\n // Add UI element to frame\\n frame.setLayout(null);\\n\\n ModificaVeicoloLabel.setBounds(25, 25, 250, 50);\\n frame.add(ModificaVeicoloLabel);\\n TargaVeicoloModificaTextField.setBounds(275, 40, 100, 20);\\n frame.add(TargaVeicoloModificaTextField);\\n\\n Indietro.setBounds(1100, 50, 100, 50);\\n frame.add(Indietro);\\n ModificaProsegui.setBounds(1100, 125, 100, 50);\\n frame.add(ModificaProsegui);\\n\\n frame.setVisible(true);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5e12e59ebfe70bae73d335c6f114e0a\",\n \"score\": \"0.59575534\",\n \"text\": \"@FXML\\r\\n void btEditClicked(ActionEvent event) {\\n btDelete.setDisable(false);\\r\\n btConfirm.setDisable(false);\\r\\n txtSenhaAtual.setDisable(false);\\r\\n txtSenhaNova.setDisable(false);\\r\\n txtSenhaConfirma.setDisable(false);\\r\\n txtSenhaAtual.requestFocus();\\r\\n\\r\\n btEdit.setDisable(true);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef0cd4a1bec6d5a6bd52027da72eefe8\",\n \"score\": \"0.5951681\",\n \"text\": \"public void editarProducto() {\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3ca60ce658f2da192aa05324d66b874\",\n \"score\": \"0.5945979\",\n \"text\": \"public void limpiar() {\\n this.txt_run.setText(null);\\n this.txt_nombre.setText(null);\\n this.txt_apaterno.setText(null);\\n this.txt_amaterno.setText(null);\\n this.buttonGroup1.clearSelection();\\n this.txt_direccion.setText(null);\\n this.txt_telefono.setText(null);\\n this.txt_email.setText(null);\\n this.cbx_comuna.setSelectedIndex(0);\\n this.cbx_estado.setSelectedIndex(0);\\n this.txt_run.requestFocus();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b80556d734bfc5e07415a145694b651\",\n \"score\": \"0.5937273\",\n \"text\": \"public void undo(){\\n //modeAritmatika.remove(modeAritmatika.size()-1);\\n if(pointer > 0){\\n pointer--;\\n MainConsole.modeEkspresi = modeAritmatika.get(pointer);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8535002f379dff836ae9d2281de50e34\",\n \"score\": \"0.5934135\",\n \"text\": \"public void Eliminar(View view){\\n AdminSQLiteOpenHelper Admin = new AdminSQLiteOpenHelper(this, \\\"Administracion\\\", null, 1);\\n SQLiteDatabase BaseDeDatos = Admin.getWritableDatabase();\\n\\n String codigo = txtCodigo.getText().toString();\\n\\n if(!codigo.isEmpty()){\\n //Se declara una variable de tipo ENTERO porque el metodo delete() retorna un ENTERO\\n //que indica la cantidad de registros borrados, si borra algun registro devuelve 1\\n int cantidad = BaseDeDatos.delete\\n (\\\"articulos\\\", \\\"codigo=\\\" + codigo, null);\\n BaseDeDatos.close();\\n\\n //Limpia los Widgets\\n txtNombre.setText(\\\"\\\");\\n txtPrecio.setText(\\\"\\\");\\n txtCantidad.setText(\\\"\\\");\\n txtCodigo.setText(\\\"\\\");\\n txtDescripcion.setText(\\\"\\\");\\n\\n if (cantidad == 1){\\n Toast.makeText(this, \\\"Articulo eliminado exitosamente\\\", Toast.LENGTH_SHORT).show();\\n btnEliminar.setEnabled(false);\\n } else {\\n Toast.makeText(this, \\\"El articulo no existe\\\", Toast.LENGTH_SHORT).show();\\n BaseDeDatos.close();\\n }\\n } else {\\n Toast.makeText(this, \\\"Debes de introducir un codigo\\\", Toast.LENGTH_SHORT).show();\\n BaseDeDatos.close();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01a57ed3e9a84efe349dcf678262795e\",\n \"score\": \"0.59335655\",\n \"text\": \"public void editar(){\\n\\t\\tbtnEdit.addActionListener(new ActionListener() {\\n\\t\\t\\t\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void actionPerformed(ActionEvent e) {\\n\\t\\t\\t\\t// TODO Auto-generated method stub\\n\\t\\t\\t\\tventanaEditar();\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"261ed46178b79b777ae3fe62706edea7\",\n \"score\": \"0.59309506\",\n \"text\": \"public void desactivarID(){\\n lblCodigoEmpleado.setVisible(false);\\n txtCodigoEmpleado.setVisible(false);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c8cf641e3c8a9bc540fdafa9db6553e\",\n \"score\": \"0.59268445\",\n \"text\": \"private void editarCliente() {\\n\\t\\tif (this.validarCamposCustom() == true) {\\n\\t\\t\\tif (this.dao.editarCliente(this.cli) == true) {\\n\\t\\t\\t\\tFacesUtil.adicionarMensagemInfo(\\\"Cliente alterado com sucesso!!\\\");\\n\\t\\t\\t}else {\\n\\t\\t\\t\\tFacesUtil.adicionarMensagemErro(\\\"Houve um erro ao alterar cadastro de cliente!!\\\");\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f5848ffa1aa78b4d2b41de0c346dc5ca\",\n \"score\": \"0.59227526\",\n \"text\": \"public void ocupado(){\\n\\t\\tthis.livre = false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1532cc0e3e4a746accb70b0b6ed8184\",\n \"score\": \"0.5918538\",\n \"text\": \"public void editItemDetil(){\\n\\t\\tview.showWindowForm();\\n\\t\\t//2. INIT LISTENER\\n\\t\\tview.getItemDetilView().getBtnAddAndSave().addClickListener(this);\\n\\t\\tview.getItemDetilView().getBtnClose().addClickListener(this);\\n\\t\\t//3. INIT STATE FORM\\n\\t\\tview.getItemDetilModel().setOperationStatus(EnumOperationStatus.EDITING.getStrCode());\\n\\t\\t//4. INIT VALUE::ITEM DETIL\\n\\t\\tview.getItemDetilModel().setItemHeader(model.getItemHeader());\\n\\t\\tview.getItemDetilModel().setItemDetil(model.getItemDetil());\\n\\t\\t\\n\\t\\tview.getItemDetilPresenter().editItemdetil();\\t\\n\\t\\tview.getItemDetilView().focustIdOrDesc();\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8b8b0ef858cc59c5a9900f77314d2e0\",\n \"score\": \"0.59179103\",\n \"text\": \"public static void editarProducto() {\\n String codigo = produc.getTxt_cod().getText();\\n String nombre = produc.getTxt_nombre().getText();\\n String descripcion = produc.getTxt_descripcion().getText();\\n String existencia = produc.getExistencia().getValue().toString();\\n String e_minima = produc.getExi_min().getValue().toString();\\n String e_maxima = produc.getExi_max().getValue().toString();\\n String precio = produc.getPrecio().getValue().toString();\\n String categoria = produc.getTxt_categoria().getSelectedItem().toString();\\n String codigoproveedor = produc.getCbx_codProvee().getSelectedItem().toString();\\n \\n \\n modelo1.setNombre(nombre);\\n modelo1.setDescripcion(descripcion);\\n modelo1.setExistencias(Integer.parseInt(existencia));\\n modelo1.setE_min(Integer.parseInt(e_minima));\\n modelo1.setE_max(Integer.parseInt(e_maxima));\\n modelo1.setPrecio(Double.parseDouble(precio));\\n modelo1.setCategoria(categoria);\\n modelo1.setCod_proveedor(codigoproveedor);\\n\\n if (modelo1.modificar(codigo)) {\\n JOptionPane.showMessageDialog(produc, \\\"Producto Creado Satisfactoriamente\\\");\\n produc.getDlg_Productos().setVisible(false);\\n cargaLista();\\n } else {\\n JOptionPane.showMessageDialog(produc, \\\"ERROR\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"900ceb413a11c32e7a6ea833aa30b73a\",\n \"score\": \"0.5911092\",\n \"text\": \"public void concludiPresaViola() {\\n\\t\\t\\n\\t\\tplayerBoard.getButtonPosizionaFamiliare().sbloccaButton();\\n\\t\\tplayerBoard.getButtonAttivaEffettoLeader().sbloccaButton();\\n\\t\\tplayerBoard.getButtonGiocaLeader().sbloccaButton();\\n\\t\\tplayerBoard.getButtonScartaLeader().sbloccaButton();\\n\\t\\t\\n\\t\\tcoloreFamiliareScelto=null;\\n\\t\\tservitoriInseriti = false;\\n\\t\\tgui.inviaMessaggio();\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5db1fcda5b92f0697cafb6141f671f0e\",\n \"score\": \"0.59094584\",\n \"text\": \"public void editarQuierofano(Quirofano quirofano){\\r\\n\\t\\tQuirofano qui = buscarQuirofano(quirofano.getId());\\r\\n\\t\\tif(qui!=null){\\r\\n\\t\\t\\tem.merge(quirofano);\\r\\n\\t\\t}else{\\r\\n\\t\\t\\tthrow new ExcepcionNegocio(\\\"El quirofano no se encuentra en el sistema\\\");\\r\\n\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"499ca98c38c7da6c23e0088bd1f322ea\",\n \"score\": \"0.59071505\",\n \"text\": \"public void editar(SitioCurso sitioCurso){\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tsitioCursoDao.edit(sitioCurso);\\r\\n\\t\\t} catch (Exception e) {\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f9e37de10fc91609471da51640b82ba\",\n \"score\": \"0.59062\",\n \"text\": \"private void escolheDestino() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4662eb41f0563aae5295f9cd21907f4f\",\n \"score\": \"0.5904965\",\n \"text\": \"public void Eliminar_todo(){\\n AlertDialog.Builder builder = new AlertDialog.Builder(this);\\n builder.setMessage(\\\"Estas segurto que quieres eliminar todo\\\");\\n builder.setTitle(\\\"Precaucion\\\");\\n builder.setPositiveButton(\\\"Si\\\", new DialogInterface.OnClickListener() {\\n @Override\\n public void onClick(DialogInterface dialog, int which) {\\n datosOpenHelper = new BaseDatosOpenHelper(ActShowTiempos.this);\\n conexion = datosOpenHelper.getWritableDatabase();\\n conexion.delete(FeedEntry.TABLE_NAME, null, null);\\n Intent it = new Intent(ActShowTiempos.this, ActShowTiempos.class);\\n startActivityForResult(it, 0);\\n conexion.close();\\n }\\n });\\n\\n builder.setNegativeButton(\\\"No\\\", new DialogInterface.OnClickListener() {\\n @Override\\n public void onClick(DialogInterface dialog, int which) {\\n dialog.cancel();\\n }\\n });\\n AlertDialog dialog=builder.create();\\n dialog.show();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0aeed0706dd7c295f098bd9236fa8318\",\n \"score\": \"0.5884093\",\n \"text\": \"public void imprimirOrden(){\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5488873f78592f651fc23d06ace5800\",\n \"score\": \"0.5878788\",\n \"text\": \"@Override\\n\\tpublic int edit(Opcion opcion) {\\n\\t\\treturn opcionDao.edit(opcion);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"070eee67ad59dab819c1483c87e3aa12\",\n \"score\": \"0.5876329\",\n \"text\": \"public String borrar() {\\n \\tcomportamientosDao.delete(id);\\r\\n \\tlistaComportamientos = comportamientosDao.findAll();\\r\\n \\teditar=false;\\r\\n \\treturn \\\"comportamientos\\\";\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"76b22c6d7407ba6e1f328cb0cb8d04b2\",\n \"score\": \"0.5874639\",\n \"text\": \"private void limpiar() {\\n\\t\\ttextCliente.setText(\\\"\\\");\\n\\t\\ttextArticulo.setText(\\\"\\\");\\n\\t\\ttextFecha.setText(\\\"\\\");\\n\\t\\ttextUnidades.setText(\\\"\\\");\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11c98c4ee66a8259eca3f5d68012f789\",\n \"score\": \"0.58674157\",\n \"text\": \"public void editAction() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01d6ef58580212e1f4a6e24a08b99e96\",\n \"score\": \"0.58647233\",\n \"text\": \"protected void onEditarInstruccionButtonActionPerformed(ActionEvent e) {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9408fb325ba7882dc341efcb1d3e8964\",\n \"score\": \"0.58616686\",\n \"text\": \"private void guardar() {\\r\\n if(txtFecha.getEditor().getText().trim().equals(\\\"\\\")){\\r\\n Alert a= new Alert(Alert.AlertType.ERROR,\\\"Error, los campos estan vacios\\\",ButtonType.OK);\\r\\n a.show();\\r\\n }else{\\r\\n if(comboEstados.getSelectionModel().getSelectedItem().equals(\\\"Sin selección\\\")){\\r\\n Alert a= new Alert(Alert.AlertType.ERROR,\\\"Error, hay que definir un estado correcto\\\",ButtonType.OK);\\r\\n a.show();\\r\\n }else{\\r\\n IncidenciaBean i= new IncidenciaBean(incidenciaSelected.getId(), incidenciaSelected.getMaquina(), incidenciaSelected.getFecha(), comboEstados.getSelectionModel().getSelectedItem());\\r\\n inciMan.modificarIncidencia(i);\\r\\n volver();\\r\\n }\\r\\n \\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a62800b176019e40480c58e64991948\",\n \"score\": \"0.5861031\",\n \"text\": \"public void abrir()\\r\\n {\\r\\n _Oculta = false;\\r\\n _Marca = \\\"X\\\";\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c105825e6d3cb3b52fdf62922a309c1\",\n \"score\": \"0.5861029\",\n \"text\": \"public void actualizar(int id) {\\n \\tencontrarTrabajadorPorId(id); \\n System.out.println(\\\"El trabajador con ID \\\" + id + \\\" ha sido actualizado\\\"); \\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b4d68ccd1cdba1d8aa98fcfcab89547d\",\n \"score\": \"0.5859866\",\n \"text\": \"public void Registro_reincor() {\\n String ID = editID.getText().toString();\\n String ID_Zona = spzonas.getSelectedItemId()+\\\"\\\";\\n String Nombrerein = editNombre.getText().toString();\\n String Edad = editEdad.getText().toString();\\n String Nivel = editEscolaridad.getText().toString();\\n String Nacionalidad = editNacionalidad.getText().toString();\\n\\n ContentValues valores = new ContentValues();\\n valores.put(com.example.equipo.farc_ep.Data.LoginContract.LoginEntry.NIVEL, Nivel);\\n\\n valores.put(com.example.equipo.farc_ep.Data.LoginContract.LoginEntry.ID, ID);\\n //valores.put(LoginContract.LoginEntry.EMAIL, Email );\\n valores.put(LoginContract.LoginEntry.IDZONA, ID_Zona);\\n valores.put(LoginContract.LoginEntry.NOMBREREIN, Nombrerein);\\n valores.put(LoginContract.LoginEntry.EDAD, Edad);\\n valores.put(LoginContract.LoginEntry.GENERO2, genero);\\n valores.put(LoginContract.LoginEntry.NACIONALIDAD, Nacionalidad);\\n db.insert(com.example.equipo.farc_ep.Data.LoginContract.LoginEntry.TABLE_NAME2, null, valores);\\n\\n Intent guardar = new Intent(Registrar_reincorporados.this, Menu_Admin.class);\\n guardar.addFlags(guardar.FLAG_ACTIVITY_CLEAR_TOP | guardar.FLAG_ACTIVITY_SINGLE_TOP);\\n startActivity(guardar);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"df8af0fed9ca49cb97700571a7d969c2\",\n \"score\": \"0.58558476\",\n \"text\": \"public String eliminar()\\r\\n/* 113: */ {\\r\\n/* 114:110 */ GuiaRemision grAux = this.servicioGuiaRemision.buscarPorId(Integer.valueOf(this.guiaRemision.getId()));\\r\\n/* 115:111 */ this.servicioGuiaRemision.anular(grAux);\\r\\n/* 116:112 */ addInfoMessage(getLanguageController().getMensaje(\\\"msg_info_anular\\\"));\\r\\n/* 117:113 */ return \\\"\\\";\\r\\n/* 118: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55ba73abdb9f1bc0625a4433d8ff5c0a\",\n \"score\": \"0.5855395\",\n \"text\": \"void undoMeetingBook();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8813c2cf7b329e245c737f7eceabb4f\",\n \"score\": \"0.58534294\",\n \"text\": \"private void jBModificarActionPerformed(java.awt.event.ActionEvent evt) {//GEN-FIRST:event_jBModificarActionPerformed\\r\\n // TODO add your handling code here:\\r\\n VentanaModificar ventana = new VentanaModificar(this);\\r\\n ventana.setVisible(true);\\r\\n ventana.setLocationRelativeTo(null);\\r\\n\\r\\n ventana.setDatosUsuarioModificar(password, jLNickname2.getText(),jLNombre2.getText(), jLApellido2.getText(), jLavatar.getText(),jLFechaNac2.getText());\\r\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09a2cab1d669216151d007725a29a668\",\n \"score\": \"0.5852301\",\n \"text\": \"public abstract void obtenerFormularioEditar();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a036b9197d0680d9da8429a9cfa2b5bb\",\n \"score\": \"0.5846189\",\n \"text\": \"@Override\\n public void actionPerformed(ActionEvent e) {\\n //boton cancelar\\n if (e.getSource().equals(v.getBtnCancelar())) {\\n this.v.dispose();\\n\\n }\\n //boton Guardar Persona\\n if (e.getSource().equals(v.getBtnGuardarPersona())) {\\n this.v.getPbarGRR().setVisible(true);\\n System.out.println(esta_persona_guarda + \\\"esta persona guardada\\\");\\n this.v.getPbarGRR().setVisible(true);\\n if (esta_persona_guarda.equals(\\\"modificar\\\")) {\\n this.v.getPbarGRR().setValue(1);\\n try {\\n if (validacionesPersona()) {\\n\\n this.v.getPbarGRR().setValue(2);\\n try {\\n datos_personales_modificar();\\n\\n this.v.getPbarGRR().setValue(3);\\n v.getBtnAgregarAgresores().setEnabled(true);\\n v.getBtnAgregarHijos().setEnabled(true);\\n v.getBtnEliminarPersona().setEnabled(true);\\n v.getBtnModificarPersona().setEnabled(true);\\n v.getBtnCancelarPersona().setEnabled(false);\\n v.getBtnGuardarPersona().setEnabled(false);\\n v.getTxtCedulaGeneral().setEditable(true);\\n v.getTxtCodigoPersona().setEditable(true);\\n v.getBtnGuardar().setEnabled(true);\\n this.v.getPbarGRR().setValue(4);\\n rrdb.ingresar_codigo_victima(victimaDB.getCodigo_victima_static());\\n this.v.getPbarGRR().setValue(5);\\n lista = pldb.lista_personas();\\n pdb.listapersonas();\\n } catch (SQLException ex) {\\n Logger.getLogger(ControladorRegistroReferencia.class.getName()).log(Level.SEVERE, null, ex);\\n\\n this.v.getPbarGRR().setValue(9);\\n this.v.getPbarGRR().setVisible(false);\\n }\\n this.v.getPbarGRR().setValue(7);\\n }\\n } catch (ParseException ex) {\\n Logger.getLogger(ControladorRegistroReferencia.class.getName()).log(Level.SEVERE, null, ex);\\n this.v.getPbarGRR().setValue(9);\\n this.v.getPbarGRR().setVisible(false);\\n }\\n this.v.getPbarGRR().setValue(9);\\n this.v.getPbarGRR().setVisible(false);\\n\\n }\\n if (esta_persona_guarda.equals(\\\"nueva\\\")) {\\n this.v.getPbarGRR().setValue(1);\\n try {\\n if (validacionesPersona()) {\\n this.v.getPbarGRR().setValue(2);\\n try {\\n if (DatosPersonales()) {\\n this.v.getPbarGRR().setValue(7);\\n v.getBtnAgregarAgresores().setEnabled(true);\\n v.getBtnAgregarHijos().setEnabled(true);\\n v.getBtnEliminarPersona().setEnabled(true);\\n v.getBtnModificarPersona().setEnabled(true);\\n v.getBtnCancelarPersona().setEnabled(false);\\n v.getBtnGuardarPersona().setEnabled(false);\\n v.getTxtCedulaGeneral().setEditable(true);\\n v.getTxtCodigoPersona().setEditable(true);\\n v.getBtnGuardar().setEnabled(true);\\n rrdb.ingresar_codigo_victima(vdb.getCodigo_victima_static());\\n this.v.getPbarGRR().setValue(8);\\n JOptionPane.showMessageDialog(this.v, \\\"Beneficiaria guardada correctamente. Ya puede agregar hijos!\\\");\\n lista = pldb.lista_personas();\\n pdb.listapersonas();\\n this.v.getPbarGRR().setValue(10);\\n this.v.getPbarGRR().setVisible(false);\\n } else {\\n System.out.println(\\\"error al ingresar datos de persona\\\");\\n this.v.getPbarGRR().setVisible(false);\\n }\\n\\n } catch (Exception ex) {\\n System.out.println(\\\"error al ingresar datos de persona\\\");\\n this.v.getPbarGRR().setVisible(false);\\n }\\n } else {\\n this.v.getPbarGRR().setVisible(false);\\n }\\n } catch (ParseException ex) {\\n System.out.println(\\\"error al ingresar datos de persona\\\");\\n this.v.getPbarGRR().setVisible(false);\\n }\\n\\n }\\n }\\n\\n //boton buscar_persona_codigo\\n if (e.getSource().equals(v.getBtn_buscar_codigo())) {\\n// try {\\n// setearXcodigo();\\n// v.getBtnModificarPersona().setEnabled(true);\\n// v.getBtnEliminarPersona().setEnabled(true);\\n// esta_persona_guarda = \\\"modificar\\\";\\n// } catch (SQLException ex) {\\n// Logger.getLogger(ControladorRegistroReferencia.class.getName()).log(Level.SEVERE, null, ex);\\n// } catch (java.text.ParseException ex) {\\n// Logger.getLogger(ControladorRegistroReferencia.class.getName()).log(Level.SEVERE, null, ex);\\n// }\\n }\\n\\n //boton modificar persona\\n if (e.getSource().equals(v.getBtnModificarPersona())) {\\n v.getBtnAgregarAgresores().setEnabled(false);\\n v.getBtnAgregarHijos().setEnabled(false);\\n v.getBtnEliminarPersona().setEnabled(false);\\n v.getBtnModificarPersona().setEnabled(false);\\n v.getBtnCancelarPersona().setEnabled(true);\\n v.getBtnGuardarPersona().setEnabled(true);\\n v.getTxtCedulaGeneral().setEditable(false);\\n v.getTxtCodigoPersona().setEditable(false);\\n esta_persona_guarda = \\\"modificar\\\";\\n }\\n\\n //boton cancelar persona\\n if (e.getSource().equals(v.getBtnCancelarPersona())) {\\n v.getBtnAgregarAgresores().setEnabled(true);\\n v.getBtnAgregarHijos().setEnabled(true);\\n v.getBtnEliminarPersona().setEnabled(false);\\n v.getBtnModificarPersona().setEnabled(false);\\n v.getBtnCancelarPersona().setEnabled(false);\\n v.getBtnGuardarPersona().setEnabled(true);\\n v.getTxtCedulaGeneral().setEditable(true);\\n v.getTxtCodigoPersona().setEditable(true);\\n JOptionPane.showMessageDialog(null, \\\"Accion Cancelada. No necesita guardar...\\\");\\n\\n esta_persona_guarda = \\\"nueva\\\";\\n\\n }\\n // boton eliminar persona\\n if (e.getSource().equals(v.getBtnEliminarPersona())) {\\n int reply = JOptionPane.showConfirmDialog(null, \\\"Seguro que desea eliminar a esta persona?\\\", \\\"Confirme\\\", JOptionPane.YES_NO_OPTION);\\n if (reply == JOptionPane.YES_OPTION) {\\n pdb.eliminarPersonaCodigo();\\n JOptionPane.showMessageDialog(null, \\\"Eliminado\\\");\\n\\n } else {\\n JOptionPane.showMessageDialog(null, \\\"Accion Cancelada\\\");\\n }\\n\\n }\\n\\n //boton listado personas registradas\\n if (e.getSource().equals(v.getBtnListadoPerReis())) {\\n VistaConsultaPersona o = new VistaConsultaPersona();\\n ControladorBuscarPersona u = new ControladorBuscarPersona(o);\\n }\\n\\n //cancelar modificacion de persona\\n if (e.getSource().equals(v.getBtnCancelar())) {\\n v.getBtnCancelarPersona().setEnabled(true);\\n\\n }\\n\\n //boton agregar agresores\\n if (e.getSource().equals(v.getBtnAgregarAgresores())) {\\n try {\\n if (control == 0) {\\n ControladorAgregarAgresores caa = new ControladorAgregarAgresores(faa);\\n control++;\\n }\\n faa.setVisible(true);\\n faa.setLocationRelativeTo(null);\\n faa.setResizable(false);\\n insertarTablaAgresores();\\n } catch (ParseException ex) {\\n Logger.getLogger(ControladorRegistroReferencia.class.getName()).log(Level.SEVERE, null, ex);\\n }\\n }\\n\\n //boton agregar hijos\\n if (e.getSource().equals(v.getBtnAgregarHijos())) {\\n\\n try {\\n\\n if (control2 == 0) {\\n ControladorAgregarHijos cah = new ControladorAgregarHijos(fah);\\n control2++;\\n }\\n fah.setVisible(true);\\n fah.setLocationRelativeTo(null);\\n fah.setResizable(false);\\n\\n } catch (ParseException | SQLException ex) {\\n Logger.getLogger(ControladorRegistroReferencia.class.getName()).log(Level.SEVERE, null, ex);\\n }\\n\\n }\\n //boton guardar \\n if (e.getSource().equals(v.getBtnGuardar())) {\\n this.v.getPbarGRR().setVisible(true);\\n if (validaciones_contacto_emergencia()) {\\n this.v.getPbarGRR().setValue(1);\\n if (v.getTxtTelefonoAyuda().getText().matches(\\\"[0-9]*\\\") && v.getTxtTelefonoAyuda().getText().length() <= 10) {\\n if (v.getTxtFrecuencia().getText().matches(\\\"[a-zA-Z]*\\\")) {\\n this.v.getPbarGRR().setValue(2);\\n try {\\n insertar_domicilio();\\n insertar_contacto_emerg();\\n this.v.getPbarGRR().setValue(3);\\n ayuda_anterior();\\n factoresRiesgo();\\n this.v.getPbarGRR().setValue(4);\\n detalle_agresion();\\n registro_refrencia_update();\\n this.v.getPbarGRR().setValue(5);\\n JOptionPane.showMessageDialog(null, \\\"Registro Guardado Exitosamente\\\");\\n v.dispose();\\n this.v.getPbarGRR().setValue(7);\\n } catch (SQLException | ParseException ex) {\\n Logger.getLogger(ControladorRegistroReferencia.class.getName()).log(Level.SEVERE, null, ex);\\n\\n this.v.getPbarGRR().setValue(9);\\n this.v.getPbarGRR().setVisible(false);\\n }\\n\\n } else {\\n this.v.getPbarGRR().setValue(9);\\n this.v.getPbarGRR().setVisible(false);\\n JOptionPane.showMessageDialog(null, \\\"Registro No Guardado | Caso a Registrar: campo Fecuencia de la Agresión \\\\n(solo puede contener letras)\\\");\\n }\\n this.v.getPbarGRR().setValue(8);\\n } else {\\n this.v.getPbarGRR().setValue(9);\\n this.v.getPbarGRR().setVisible(false);\\n JOptionPane.showMessageDialog(null, \\\"Registro No Guardado | Ayuda Anterior campo Telefono \\\\n(solo puede contener números)\\\");\\n }\\n this.v.getPbarGRR().setValue(9);\\n this.v.getPbarGRR().setVisible(false);\\n }\\n\\n }\\n //----------------------------------------------------------------------juego lineaa de apoyo\\n if (v.getRbSiLlamaLineaApoyo().isSelected()) {\\n v.getRbNOLlamaLineaApoyo().setEnabled(false);\\n } else {\\n v.getRbNOLlamaLineaApoyo().setEnabled(true);\\n }\\n if (v.getRbNOLlamaLineaApoyo().isSelected()) {\\n v.getRbSiLlamaLineaApoyo().setEnabled(false);\\n } else {\\n v.getRbSiLlamaLineaApoyo().setEnabled(true);\\n }\\n //----------------------------------------------------------------------juego lineaa de apoyo\\n if (v.getRbSiContinuaAgresion().isSelected()) {\\n v.getRbNoContinuaAgresion().setEnabled(false);\\n } else {\\n v.getRbNoContinuaAgresion().setEnabled(true);\\n }\\n if (v.getRbNoContinuaAgresion().isSelected()) {\\n v.getRbSiContinuaAgresion().setEnabled(false);\\n } else {\\n v.getRbSiContinuaAgresion().setEnabled(true);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66de2273d38223b7246d84c381ff6932\",\n \"score\": \"0.58435863\",\n \"text\": \"protected boolean gravarEditado(int idClient, String vrTotal, String codLancament, String controle) {\\n daoMvVendasMovimento daovm = new daoMvVendasMovimento();\\n mvVendasMovimento mvVendasMovimento = new mvVendasMovimento();\\n ArrayList<tmpListProd> lista = dao.buscarAlltmp();\\n \\n boolean resp = daovm.editarOrcCab(vrTotal, codLancament, controle, idClient);\\n \\n boolean resp2 = daovm.removeProdOrc(controle);\\n \\n\\n for (int i = 0; i < lista.size(); i++) {\\n\\n mvVendasMovimento.setDataVenda(dao.data_Venda());\\n mvVendasMovimento.setControle(controle);\\n mvVendasMovimento.setModoVenda(2);\\n mvVendasMovimento.setCodLancamento(Integer.parseInt(codLancament));\\n mvVendasMovimento.setIdCliente(idClient);\\n mvVendasMovimento.setIdClienteConvenio(0);\\n mvVendasMovimento.setIdProduto(lista.get(i).getIdProduto());\\n mvVendasMovimento.setIdGrade(0);\\n mvVendasMovimento.setModoLancamento(0);\\n mvVendasMovimento.setTerminal(\\\"01\\\");\\n mvVendasMovimento.setTurno(\\\"1\\\");\\n mvVendasMovimento.setValor(dao.Valor_CP(lista.get(i).getIdProduto()));\\n mvVendasMovimento.setQuant(lista.get(i).getQdt());\\n mvVendasMovimento.setVrTotal(lista.get(i).getVlr());\\n mvVendasMovimento.setVrCotacao(1);\\n\\n dao.inserirMVM(mvVendasMovimento);\\n\\n }\\n \\n return true;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e4c54049857c6a9dad1c1db48ab6d9c\",\n \"score\": \"0.58401173\",\n \"text\": \"private void verwijderenToernooi() {\\n try {\\n\\n int id_toernooi = Integer.parseInt(idToernooiTxt.getText());\\n\\n Sql_connect.doConnect();\\n PreparedStatement stat = Sql_connect.getConnection().prepareStatement(\\\"DELETE FROM toernooi WHERE Id_toernooi = ?\\\");\\n stat.setInt(1, id_toernooi);\\n stat.executeUpdate();\\n JOptionPane.showMessageDialog(this, \\\"Toernooi met id: \\\" + id_toernooi + \\\" succesvol verwijderd.\\\");\\n vulLijst();\\n\\n } catch (Exception e) {\\n ePopup(e);\\n MELDINGFIELD.setText(\\\"Verwijderen mislukt\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"327995bb371a91e3cabf0858d4006d7e\",\n \"score\": \"0.583825\",\n \"text\": \"public void ej_Bcancelar(ActionEvent e)\\n {\\n switch (nav.getPulsado())\\n {\\n case navegador.EDIT:\\n pad.canc_edit();\\n break;\\n case navegador.QUERY:\\n pad.canc_query();\\n break;\\n case navegador.ADDNEW:\\n pad.canc_addnew();\\n break;\\n case navegador.DELETE:\\n pad.canc_delete();\\n break;\\n }\\n pulsadoCancelar();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68f0797caab2be960ce4b11167b8b298\",\n \"score\": \"0.58379424\",\n \"text\": \"public void salvarContato() {\\n try {\\n if(contato.getId() == null){\\n contatoDao.criar(contato); \\n setMensagemSucesso(\\\"Contato criado com sucesso!\\\");\\n contato = new Contato();\\n }else{\\n contatoDao.editar(contato);\\n setMensagemSucesso(\\\"Contato alterado com sucesso!\\\");\\n }\\n \\n listaContatos = contatoDao.buscarTodos(); \\n \\n } catch (Exception e) {\\n setMensagemErro(\\\"Não foi possível criar o contato\\\", e.getMessage());\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a0d2b2bc1004f18916479427c48242cc\",\n \"score\": \"0.58372235\",\n \"text\": \"public boolean editarHorarios(){\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbc3d5db1bf06c388cde27bb35435d1\",\n \"score\": \"0.58319587\",\n \"text\": \"protected void onEditarIngredienteButtonActionPerformed(ActionEvent e) {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48bd088046f5eb95a0c75f7bbb8e9841\",\n \"score\": \"0.58311003\",\n \"text\": \"public void cancelarTipoPropuestaConvenio() {\\n String msg = \\\"Tipo de Propuesta de Convenio cancelado!\\\"; \\n try { \\n tipoPropuestaConvenio = null;\\n tipoPropuestaConvenio = new TipoPropuestaConvenio();\\n RequestContext.getCurrentInstance().reset(\\\":formAdmin\\\"); \\n if(actualizar)\\n JsfUtil.addSuccessMessage(msg);\\n } catch (Exception e) {\\n JsfUtil.addErrorMessage(\\\"Error al cancelar registro tipo de Propuesta de Convenio\\\");\\n }\\n cargarTipoPropuestaConvenio();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b81db7a4c89dd10c3af926ec601daf15\",\n \"score\": \"0.5827527\",\n \"text\": \"public void cancelProfesseur() {\\n\\n try {\\n nomNouvelProfesseurModel.remove(0, nomNouvelProfesseurModel.getLength());\\n prenomNouvelProfesseurModel.remove(0, prenomNouvelProfesseurModel.getLength());\\n loginNouvelProfesseurModel.remove(0, loginNouvelProfesseurModel.getLength());\\n mdpNouvelProfesseurModel.remove(0, mdpNouvelProfesseurModel.getLength());\\n } catch (BadLocationException e) {\\n e.printStackTrace();\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dcdd33512b32885da9fe71649b714e00\",\n \"score\": \"0.5824642\",\n \"text\": \"public Editar() {\\n initComponents();\\n this.setLocationRelativeTo(null);\\n int num2;\\n txteven.setEditable(false);\\n txtLugar.setEditable(false);\\n txtFecha.setEditable(false);\\n txtHora.setEditable(false);\\n txtDuracion.setEditable(false);\\n txtAcomp.setEditable(false);\\n \\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985499,"cells":{"query_id":{"kind":"string","value":"07e2df9e911a42b3b2959fe42cc67733"},"query":{"kind":"string","value":"Method that add keyvalue to the trie. This is recursive method that build sequence of nodes that has linked between each other"},"positive_passages":{"kind":"list like","value":[{"docid":"b21364fc8c57082598a5dd9563153743","score":"0.64803183","text":"private Node add(Node node, String key, Integer val, int d) {\r\n\t\tif (node == null) {\r\n\t\t\tnode = new Node();\r\n\t\t}\r\n\t\tif (d == key.length()) { //\r\n\t\t\tnode.value = val;\r\n\t\t\treturn node;\r\n\t\t}\r\n\t\tint c = key.charAt(d) - FIRST_ALPHABET_ELEMENT; // choosing subtree\r\n\t\tnode.next[c] = add(node.next[c], key, val, d + 1);\r\n\t\treturn node;\r\n\t}","title":""}],"string":"[\n {\n \"docid\": \"b21364fc8c57082598a5dd9563153743\",\n \"score\": \"0.64803183\",\n \"text\": \"private Node add(Node node, String key, Integer val, int d) {\\r\\n\\t\\tif (node == null) {\\r\\n\\t\\t\\tnode = new Node();\\r\\n\\t\\t}\\r\\n\\t\\tif (d == key.length()) { //\\r\\n\\t\\t\\tnode.value = val;\\r\\n\\t\\t\\treturn node;\\r\\n\\t\\t}\\r\\n\\t\\tint c = key.charAt(d) - FIRST_ALPHABET_ELEMENT; // choosing subtree\\r\\n\\t\\tnode.next[c] = add(node.next[c], key, val, d + 1);\\r\\n\\t\\treturn node;\\r\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"67ae2d6abd8bb2e5caafd7fc0ba31ea7","score":"0.70195013","text":"public void addChild(String key, String value) {\n int childPosition = getFirstCharCode(key);\n\n if (children[childPosition] == null) {\n children[childPosition] = new TrieNode(key.charAt(0));\n }\n\n if (key.length() > 1) {\n children[childPosition].addChild(key.substring(1), value);\n } else { // end of key\n children[childPosition].value = value;\n }\n }","title":""},{"docid":"24e3fd13a56662f346ea8b3f5cb7c276","score":"0.6318054","text":"static void insert(String key) \n { \n int level; \n int length = key.length(); \n int index; \n \n TrieNode pCrawl = root; \n \n for (level = 0; level < length; level++) \n { \n index = key.charAt(level) - 'a'; \n if (pCrawl.children[index] == null) \n pCrawl.children[index] = new TrieNode(); \n \n pCrawl = pCrawl.children[index]; \n } \n \n // mark last node as leaf \n pCrawl.isEndOfWord = true; \n }","title":""},{"docid":"6b4a8827433c463e500c90f7bf28c5ff","score":"0.62483054","text":"private void _put(K key, V val){\n\t\tTreeNode node = root, parent = null;\r\n\t\tLinkedList<TreeNode> path = new LinkedList<>();\r\n\t\t\r\n\t\tint dir = 0;\r\n\t\twhile(node != null){\r\n\t\t\tpath.add(node);\r\n\t\t\tparent = node;\r\n\t\t\t// found - do nothing\r\n\t\t\tif(node.key.equals(key)){\r\n\t\t\t\tnode.val = val;\r\n\t\t\t\t// assign\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\t\t\tdir = key.compareTo(node.key);\r\n\t\t\tif(dir < 0)\r\n\t\t\t\tnode = node.left;\r\n\t\t\telse\r\n\t\t\t\tnode = node.right;\r\n\t\t}\r\n\t\t// not found - add a new node - red link\r\n\t\tnode = new TreeNode(key, val);\r\n\t\tnode.red = true;\r\n\t\tif(dir < 0)\r\n\t\t\tparent.left = node;\r\n\t\telse\r\n\t\t\tparent.right = node;\r\n\t\tpath.add(node);\r\n\t\t// rebalance\r\n\t\trebalance(path);\r\n\t}","title":""},{"docid":"17234d001fa32229f7a57fdf0d9203f4","score":"0.61070424","text":"public boolean add(K[] keyarr, V aValue) { //create a link and an unlink method to perform this and the remove method\n\t\tif(keyarr.equals(null) || keyarr.length == 0)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\tif(nulCheck(keyarr))\n\t\t{\n\t\t\tthrow new NullPointerException();\n\t\t}\n\t\tK[] ket = prefix(keyarr);\n\t\tNode p = findNode(ket);\n\t\t\n\t\tif(ket != null && ket.length == keyarr.length)\n\t\t{\n\t\t\tp.value = aValue;\n\t\t\treturn true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tEntryNode[] arr = nMaker(keyarr, ket);\n\n\t\t\tif(ket == null)\n\t\t\t{\n\t\t\t\tlink((Node) arr[0], root);\n\t\t\t\tfor(int i = 1; i< keyarr.length; i++)\n\t\t\t\t{\n\t\t\t\t\tlink((Node) arr[i],(Node) arr[i-1]);\n\t\t\t\t}\n\t\t\t\tp = findNode(keyarr);\n\t\t\t\tp.value = aValue;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tif(ket.length < keyarr.length)\n\t\t\t{\n\t\t\t\tint t = arr.length;\n\t\t\t\tEntryNode y = findNode(ket);\n\t\t\t\tfor(int i = 0; i < t; i++)\n\t\t\t\t{\n\t\t\t\t\tlink((Node) arr[i], (Node) y);\n\t\t\t\t\ty = arr[i];\n\t\t\t\t\tif(i >= keyarr.length)\n\t\t\t\t\t{\n\t\t\t\t\t\tp = findNode(keyarr);\n\t\t\t\t\t\tp.value = aValue;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tp = findNode(keyarr);\n\t\t\t\tp.value = aValue;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tif(ket.length > keyarr.length)\n\t\t\t{\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}","title":""},{"docid":"2663a7c2b41bd6c32414e5851ae79cd0","score":"0.60898536","text":"@Override\n public SkipListNode insertElement(Integer key, String value) {\n SkipListNode closestNodeAfter = closestNodeAfter(key);\n\n // If closestNodeAfter.getPredecessor().getKey() == key,\n // that means the key has already existed in the skip list\n // Report the Error\n if (closestNodeAfter.getPredecessor().getKey() == key) {\n System.out.println(\"Error: Insert replicated key: \" + key);\n return null;\n }\n\n // newBottomNode is the new node which we will insert in the bottom list\n SkipListNode newBottomNode = new SkipListNode(key, value);\n SkipListNode newNode = newBottomNode;\n // Insert the newBottomNode into the front of the \"closestNodeAfter\" node\n insertBefore(closestNodeAfter, newBottomNode);\n // We start from bottom level, thus the currentLevel is 1\n int currentLevel = 1;\n\n // Flip coins\n // random.nextInt return the uniformly distributed\n // integer between 0 (inclusive) and n (exclusive).\n // Therefore, n = 2. We have 50% chance for getting either face of the coin\n // 0 represents the tail of the coin, we stop promoting the node to the upper level list\n // 1 represents the head of the coin, we keep promoting the node to the upper level list\n while (random.nextInt(2) == 1) {\n // Create a new level if necessary\n if (currentLevel >= maxLevel) {\n maxLevel++;\n SkipListNode newStart = new SkipListNode(SkipListNode.START, null);\n SkipListNode newEnd = new SkipListNode(SkipListNode.END, null);\n linkHorizontal(newStart, newEnd);\n linkVertical(newStart, start);\n linkVertical(newEnd, end);\n // Set both start node and end node to the new ones\n start = newStart;\n end = newEnd;\n }\n\n // Find the successor in the upper level\n while (closestNodeAfter.getUp() == null) {\n closestNodeAfter = closestNodeAfter.getSuccessor();\n }\n closestNodeAfter = closestNodeAfter.getUp();\n\n // Create a new node for the upper level\n // Only store the key into the node and set value to null\n SkipListNode upperNewNode = new SkipListNode(key, null);\n insertBefore(closestNodeAfter, upperNewNode);\n linkVertical(upperNewNode, newNode);\n\n newNode = upperNewNode;\n currentLevel++;\n }\n\n size++;\n // return the new node object in the bottom list\n return newBottomNode;\n }","title":""},{"docid":"b5d7cbad430054a9b0d2a9da4f3811f1","score":"0.603441","text":"public void addChild(KeyValueNode<K, V> aNode)\n {\n children.add(aNode);\n }","title":""},{"docid":"1518765cc8c0e83c9cf8d0db440932b4","score":"0.5979094","text":"public void insert(K key, T value) {\r\n //Check if the root has been created or not.\r\n if (root==null){\r\n //create root node and first leaf\r\n //set up root node\r\n Node lnode=new LeafNode(key,value);\r\n root=lnode;\r\n }\r\n else{\r\n //find the right position and insert\r\n //with recursive method\r\n recinsert(key,value,root,0); \r\n } \r\n\t}","title":""},{"docid":"850c8f98c8ff8096b08854a2eaf0b326","score":"0.59101933","text":"private Tree<K, V> insertRec(Tree<K, V> node, K key, V value) {\n if (node == null) { // Not found/tree empty, create node\n node = new Tree<>(key, value);\n size++;\n } else if (key.compareTo(node.key) < 0) { // Lower -> left branch\n node.left = insertRec(node.left, key, value);\n node = node.balance();\n } else if (key.compareTo(node.key) > 0) { // Greater -> right branch\n node.right = insertRec(node.right, key, value);\n node = node.balance();\n } else // Equal -> Change value\n node.value = value;\n return node;\n }","title":""},{"docid":"ce6ba746fe66d0fb4788f5e507ed925b","score":"0.58830905","text":"public void insert(int key, String value) {\n // Create actual node from provided values\n Node newNode = new Node(key, value);\n if (this.root == null) {\n // The new node is actually the first node in the tree\n this.root = newNode;\n } else {\n Node current = root;\n Node parent;\n\n // This while loop will break when newNode is inserted as new leaf\n while (true) {\n parent = current;\n if (key <= current.key) {\n // If new key is <= of the current node key - continue LEFT\n current = current.leftChild;\n if (current == null) {\n // The parent is the leaf\n parent.leftChild = newNode;\n return;\n }\n } else {\n // If new key is > of the current node key - continue RIGHT\n current = current.rightChild;\n if (current == null) {\n // The parent is the leaf\n parent.rightChild = newNode;\n return;\n }\n }\n }\n }\n }","title":""},{"docid":"07baa57279ae53b00981915b86134027","score":"0.5880505","text":"void setNode(int key, String value);","title":""},{"docid":"75d9bdc6af91ea67510a9ff4facc1802","score":"0.58440024","text":"TrieNode(Character c){\n this.c = c;\n children = new HashMap<Character, TrieNode>();\n val = counter++;\n }","title":""},{"docid":"d5667febbacb9bd6d58a9d5409e87920","score":"0.58383244","text":"public boolean add(K key, V value){\n\t\tif(contains(key))\n\t\t\treturn false;\n\t\tif(root == null)\n\t\t\troot = new Node<K,V>(key, value);\n\t\telse\n\t\t\tinsert(key,value,root,null,false);\n\t\tcurrentSize++;\n\t\tmodCounter++;\n\t\treturn true;\n\t}","title":""},{"docid":"403268aa2a5003364e6e254851134d24","score":"0.58313847","text":"@Override\n public void put(K key, V value){\n if(size==0){\n Root = new TreeNode(key, value);\n size = size+1;\n return;\n }\n else{\n TreeNode M = Root;\n while(M!=null) {\n if (key.compareTo(M.get_K_V()) > 0) {\n if(M.right==null){\n M.right = new TreeNode(key, value);\n size = size+1;\n return;\n }\n M = M.right;\n } else if (key.compareTo(M.get_K_V()) < 0) {\n if(M.left==null ) {\n M.left = new TreeNode(key, value);\n size = size + 1;\n return;\n }\n M = M.left;\n } else if (key.compareTo(M.get_K_V()) == 0) {\n return;\n }\n }\n }\n }","title":""},{"docid":"5b15374a0df9fb319faec5b79debd478","score":"0.58247113","text":"static void insert(String key, int value, TwoThreeTree tree) {\n\r\n int h = tree.height;\r\n\r\n if (h == -1) {\r\n LeafNode newLeaf = new LeafNode();\r\n newLeaf.guide = key;\r\n newLeaf.value = value;\r\n tree.root = newLeaf; \r\n tree.height = 0;\r\n }\r\n else {\r\n WorkSpace ws = doInsert(key, value, tree.root, h);\r\n\r\n if (ws != null && ws.newNode != null) {\r\n // create a new root\r\n\r\n InternalNode newRoot = new InternalNode();\r\n if (ws.offset == 0) {\r\n newRoot.child0 = ws.newNode; \r\n newRoot.child1 = tree.root;\r\n }\r\n else {\r\n newRoot.child0 = tree.root; \r\n newRoot.child1 = ws.newNode;\r\n }\r\n resetGuide(newRoot);\r\n tree.root = newRoot;\r\n tree.height = h+1;\r\n }\r\n }\r\n }","title":""},{"docid":"dc112de11eb87a0986810f956544e49d","score":"0.5810153","text":"public void put(Key key, Value val) {\n if (key == null) throw new IllegalArgumentException(\"argument to put() is null\");\n if (val == null) {\n delete(key);\n return;\n }\n if (this.isEmpty()) {\n this.first = new Node();\n this.first.key = key;\n this.first.value = val;\n this.n++;\n return;\n }\n\n // Percorre tabela de símbolos. Se encontrar key\n // atribui val. Se não encontrar, insere par key-value\n // e rearranja tabela.\n Node current = this.first;\n Node previous = null;\n while (current.key.compareTo(key) < 0) {\n previous = current;\n if (current.next == null) {\n Node newKey = new Node();\n newKey.key = key;\n newKey.value = val;\n this.n++;\n previous.next = newKey;\n newKey.next = null;\n return;\n }\n current = current.next;\n }\n if (current.key.compareTo(key) == 0) {\n // Altera current.value com novo val\n current.value = val;\n return;\n }\n \n // Insere o novo nó\n Node newKey = new Node();\n newKey.key = key;\n newKey.value = val;\n this.n++;\n // Se o novo nó é o primeiro da lista\n if (previous == null) {\n this.first = newKey;\n newKey.next = current;\n return;\n }\n previous.next = newKey;\n newKey.next = current;\n return;\n }","title":""},{"docid":"6e85721aa20a869f93e1a15a44cd9868","score":"0.580835","text":"valueNode(int value,String key) {\n this.value = value;\n curKeys = new LinkedList<String>();\n curKeys.add(key);\n }","title":""},{"docid":"6e7066e64b94cdffc8f52ef8983a4d40","score":"0.57938904","text":"private static void addNode(Node<String> root, String value, String path) {\n /* base case when the path passed in is empty */\n /* replace the value at root */\n if (path.equals(\"\")) {\n root.setData(value);\n return;\n }\n\n /* perform the traversal based on the path string, starting from the left index */\n if (path.charAt(0) == 'L') {\n if (root.getLeft() == null) {\n root.setLeft(new Node<String>(\"-1\"));\n }\n addNode(root.getLeft(), value, path.substring(1));\n } else if (path.charAt(0) == 'R') {\n if (root.getRight() == null) {\n root.setRight(new Node<String>(\"-1\"));\n }\n addNode(root.getRight(), value, path.substring(1));\n }\n }","title":""},{"docid":"72b1abfc858bc27909660f0f9cf48703","score":"0.5790228","text":"public void addChild(K aKey, V aValue)\n {\n addChild(new KeyValueNode<K, V>(aKey, aValue));\n }","title":""},{"docid":"fce16e1c3fb30baf3d3c433f39ab3ac4","score":"0.578181","text":"public abstract Triple putTriple( Node key, Triple value );","title":""},{"docid":"f51d3cecdbd4a41a7e45321ea4540c28","score":"0.5774453","text":"public Node add(StringTrieBuilder builder, CharSequence s, int start, int sValue) {\n\t\t\treturn this;\n\t\t}","title":""},{"docid":"fde56ca47de3320aff9066a0c8582f10","score":"0.57744205","text":"private TrieNode insertTrie(Character c, TrieNode trieNode){\n if (trieNode.children.containsKey(c)){\n return trieNode.children.get(c);\n }\n TrieNode newTrieNode = new TrieNode(c);\n trieNode.children.put(c, newTrieNode);\n return newTrieNode;\n }","title":""},{"docid":"08835f02d9e99fff8a2c659eb6b58971","score":"0.5764307","text":"public void buildKeyIndex(String name, int node, String value) {\n/* 448 */ KeyIndex index = buildKeyIndexHelper(name);\n/* 449 */ index.add(value, node, this._currentRootForKeys);\n/* */ }","title":""},{"docid":"8ddd486a1add3a5ac28937093a369113","score":"0.5745191","text":"public void add(final String key) {\n root = add(root, key, 0);\n }","title":""},{"docid":"90d25456aeeb452c4001c3ca528a8039","score":"0.572829","text":"public boolean insert(Object key, Object value) {\n if (key == null) {\n throw new IllegalArgumentException(\"key must be non-null\");\n }\n\n int i = h1(key);\n Node trav = table[i];\n \n // check if chain already has key\n while (trav != null) {\n if (trav.key.equals(key)) {\n return true;\n }\n trav = trav.next;\n }\n\n // otherwise, add key to beginning of chain\n Node storage = table[i]; // carries temporary chain\n table[i] = new Node(key, value); // new node at front\n table[i].next = storage;\n\n numKeys++;\n return true;\n }","title":""},{"docid":"3ea9d0cb48dcc7d182b10fce4da4f874","score":"0.5726735","text":"synchronized public TrieNode add(char x) {\n if (childSize==0) {\n /*\n * Lazily create the char array\n */\n nexts = new TrieNode[10][0];\n }\n \n /*\n * Here the char array implements a Hash structure.\n * x % 10 obtains the position where x should be placed.\n */\n int mod = x % 10;\n \n /* lazily create the char array */\n if (nexts[mod].length==0) nexts[mod] = new TrieNode[5];\n \n int bucket = -1;\n \n /*\n * find the place where the given char should be inserted,\n * or return if it's already in trie\n */\n for (int i=0; i<nexts[mod].length; i++) {\n if (nexts[mod][i]==null) {\n /*\n * find an empty place, but we still don't know if the char already\n * exists in the array, so we just mark the place\n */\n if (bucket==-1) bucket = i;\n } else {\n /*\n * Now we are sure the char already exists in the array, we return its node\n */\n if (nexts[mod][i].ch==x) return nexts[mod][i];\n }\n }//for i\n \n /*\n * Now we are sure a new TrieNode need to be created and inserted\n */\n \n childSize++;\n \n TrieNode node = new TrieNode(x);\n \n if (bucket!=-1) {\n /* we already marked where we can insert the new node */\n nexts[mod][bucket] = node;\n return node;\n }\n \n /*\n * Now we have to expand the array for the new node.\n * We'd like to expand it with two more buckets, chances are we\n * will have another new node to insert.\n */\n \n TrieNode[] array = new TrieNode[nexts[mod].length+2];\n \n /* copy content to the new array */\n for (int i=0; i<nexts[mod].length; i++) {\n array[i] = nexts[mod][i];\n }\n \n /* now we insert the new node */\n array[nexts[mod].length] = node;\n \n nexts[mod] = array;\n \n return node;\n }","title":""},{"docid":"966659a6863afe3b5fce39d8b3807076","score":"0.57149124","text":"public V put(K key, V value)\r\n\t{\r\n\t\tV output = null;\r\n\t\tif (root==null)\r\n\t\t{\r\n\t\t\troot = new ThreadedMapNode<K,V>(key, value);\r\n\t\t\troot.threadFlag=true;\r\n\t\t}\r\n\t\t\r\n\t\telse\r\n\t\t{\r\n\t\t\tThreadedMapNode<K,V> thisNode;\r\n\t\t\tthisNode=root;\r\n\t\t\t\r\n\t\t\tboolean keepLooping=true;\r\n\t\t\twhile (keepLooping)\r\n\t\t\t{\r\n\t\t\t\t//Loops through the tree to find the correct placement.\r\n\t\t\t\tif(key.compareTo(thisNode.key)<0)\r\n\t\t\t\t{\r\n\t\t\t\t\tSystem.out.println(\"left at \"+thisNode.value);\r\n\t\t\t\t\t//Checks the left subtree\r\n\t\t\t\t\tif (thisNode.leftChild==null)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\t//Stops looping, adds a new node and sets the thread to its parent\r\n\t\t\t\t\t\tThreadedMapNode<K,V> newNode = new ThreadedMapNode<K,V>(key, value);\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tthisNode.leftChild=newNode;\r\n\t\t\t\t\t\tnewNode.threadFlag=true;\r\n\t\t\t\t\t\tnewNode.rightChild=thisNode;\r\n\t\t\t\t\t\tkeepLooping=false;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\t//Sets thisNode to the left child\r\n\t\t\t\t\t\tthisNode=thisNode.leftChild;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\telse if(key.compareTo(thisNode.key)>0)\r\n\t\t\t\t{\r\n\t\t\t\t\t//Checks the right subtree\r\n\t\t\t\t\tif (thisNode.threadFlag)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\t//Stops looping, adds a new node and sets the thread to its parent's thread\r\n\t\t\t\t\t\tThreadedMapNode<K,V> newNode = new ThreadedMapNode<K,V>(key, value);\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tthisNode.threadFlag=false;\r\n\t\t\t\t\t\tnewNode.threadFlag=true;\r\n\t\t\t\t\t\tnewNode.rightChild=thisNode.rightChild;\r\n\t\t\t\t\t\tthisNode.rightChild=newNode;\r\n\t\t\t\t\t\tkeepLooping=false;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\t//Sets thisNode to the right child\r\n\t\t\t\t\t\tthisNode=thisNode.rightChild;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\telse if(key.compareTo(thisNode.key)==0)\r\n\t\t\t\t{\r\n\t\t\t\t\t//If keys are identical, stops looping and updates the key\r\n\t\t\t\t\t//at that location\r\n\t\t\t\t\toutput=thisNode.value;\r\n\t\t\t\t\tthisNode.value=value;\r\n\t\t\t\t\tkeepLooping=false;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn output;\r\n\t}","title":""},{"docid":"dbb0470442665eb40b776e250e3e48aa","score":"0.570857","text":"public TrieNode(String word, String sequence) {\n children = new ArrayList<TrieNode>();\n value = word;\n this.sequence = sequence;\n }","title":""},{"docid":"7223ef0ec3f3e04c998ed8942aee03c6","score":"0.56930226","text":"public void add(E value) {\n ListNode<E> newNode = new ListNode<>(value);\n if (root == null) {\n root = newNode;\n end = root;\n } else {\n end.setNext(newNode);\n newNode.setPrevious(end);\n end = newNode;\n }\n size++;\n }","title":""},{"docid":"63899849e01c3d38f52acaf1d16ad5aa","score":"0.56896305","text":"public void add(String n) {\r\n\t\tTrieNode current = root;\r\n\t\t//Compares each character in the string to the current TrieNode we are at's children.\r\n\t\tfor(int i = 0; i < n.length(); i++) {\r\n\t\t\t /* If it doesn't have a child\r\n\t\t\t * with the same value, then we create a new child with the same value as the current character we are at and visit\r\n\t\t\t * that new Node.\r\n\t\t\t */\r\n\t\t\tif(current.getChild(n.charAt(i))==null) {\r\n\t\t\t\tcurrent.addChild(new TrieNode(n.charAt(i)));\r\n\t\t\t\tcurrent = current.getChild(n.charAt(i));\r\n\t\t\t}\r\n\t\t\t/*If the TrieNode we are at has a child with the same value as the current character we are examining\r\n\t\t\t , then we visit the that child TrieNode and check the next character in the string.\r\n\t\t\t */\r\n\t\t\telse {\r\n\t\t\t\tcurrent = current.getChild(n.charAt(i));\r\n\t\t\t}\r\n\t\t}\r\n\t\t//Once we reach the end of the String add a default TrieNode to represent the end of a string in our Trie.\r\n\t\tcurrent.addChild(new TrieNode());\r\n\t}","title":""},{"docid":"ab87ec97e6c6a378e86aa38f9d5de51e","score":"0.56858957","text":"public T add(String key, T value) {\n Hash<T> newHash = new Hash<T>(value);\n\n // Quadratic probing variable\n int i = 1;\n\n int hash = h(key, this.size);\n int pos = hash;\n while (table[pos] != null && table[pos].getValue() != null) {\n pos = (hash + (i * i)) % size;\n i++;\n if (pos == hash) { // We are back at the original position\n return null;\n }\n }\n\n table[pos] = newHash;\n items++;\n return newHash.getValue();\n }","title":""},{"docid":"1cb675566ce76cd96cb8daa29670fc98","score":"0.5665963","text":"public TrieNode add(String word, String sequence) {\n TrieNode newNode = new TrieNode(word, sequence);\n children.add(newNode);\n return newNode;\n }","title":""},{"docid":"66682af7f05c0f32d00470eae08ec6da","score":"0.5647848","text":"public void buildTrie(){\n\t\tint c;\n\t\tint end = inChars.length-1;\n\t\t\n//\t\tSystem.out.print(\"INPUT::\");\n//\t\tfor (char chr : inChars){\n//\t\t\tSystem.out.print(chr);\n//\t\t}\n//\t\tSystem.out.println();\n\t\t\n\t\t// the suffix tree is built from the last character forward\n\t\tfor(int i = inChars.length-1; i>=0; i--) {\n\t\t\tc = inChars[i];\n\t\t\t\n\t\t\t// first fill the empty child nodes of the root node\n\t\t\tif(root.getChild(c) == null){\n\t\t\t\troot.setChild(c, new Node(i,end));\n\t\t\t\t\n\t\t\t//if the node is already filled, it must be split until an empty node is reached for insertion\t\t\t\n\t\t\t} else {\t\n\t\t\t\tsplitChild(root.getChild(c), inChars, i , c, end);\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"f5f946763c99ed8ee75baeb7ce301c13","score":"0.564411","text":"private Node add(final Node x, final String key, final int d) {\n Node y = x;\n if (y == null) {\n y = new Node();\n }\n if (d == key.length()) {\n if (!y.isString) {\n n++;\n }\n y.isString = true;\n } else {\n char c = Character.toUpperCase(key.charAt(d));\n y.next[c - 'A'] = add(y.next[c - 'A'], key, d + 1);\n }\n return y;\n }","title":""},{"docid":"92abd2fa3d710bc74a1a45eda895c4a9","score":"0.562715","text":"private Node put(Node x, int key, int val)\r\n\t{\t\t\r\n\t\t//check if node is 2-node or 3-node\r\n\t\tif(x instanceof ThreeNode)\r\n\t\t{\r\n\t\t\tThreeNode x3 = (ThreeNode)x;\r\n\t\t\t//if input key lesser than left key of node x, insert node on left\r\n\t\t\tif (key < x3.leftKey)\r\n\t\t\t{\t\r\n\t\t\t\t//check if left child exists\r\n\t\t\t\tif(x3.left == null)\r\n\t\t\t\t{\r\n\t\t\t\t\t//make temporary 4 node\r\n\t\t\t\t\tx3.isFourNode=true;\r\n\t\t\t\t\tx3.tempKey = x3.leftKey;\r\n\t\t\t\t\tx3.tempVal=x3.leftVal;\r\n\r\n\t\t\t\t\tx3.leftKey = key;\r\n\t\t\t\t\tx3.leftVal = val;\r\n\t\t\t\t}\t\t\t\t\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\t//recursively call put method\r\n\t\t\t\t\tx3.left = put(x3.left, key, val);\r\n\t\t\t\t\t\r\n\t\t\t\t\t//if left child is 4-node, then split the child node into two child 2nodes and \r\n\t\t\t\t\t//insert the middle key of the former 4-node into this node as leftmost key making this a 4-node\r\n\t\t\t\t\tif(x3.left.isFourNode && x3.left instanceof ThreeNode)\r\n\t\t\t\t\t{\t\t\t\t\t\t\r\n\t\t\t\t\t\tThreeNode leftchild = (ThreeNode)(x3.left);\r\n\r\n\t\t\t\t\t\t//new left child\r\n\t\t\t\t\t\tTwoNode t1 = new TwoNode(leftchild.leftKey,leftchild.leftVal);\r\n\t\t\t\t\t\tt1.left = leftchild.left;\r\n\t\t\t\t\t\tt1.right = leftchild.mid;\r\n\r\n\t\t\t\t\t\t//new second child\r\n\t\t\t\t\t\tTwoNode t2 = new TwoNode(leftchild.rightKey,leftchild.rightVal);\r\n\t\t\t\t\t\tt2.left = leftchild.right;\r\n\t\t\t\t\t\tt2.right = leftchild.fourth;\r\n\r\n\t\t\t\t\t\tx3.tempKey = x3.leftKey;\r\n\t\t\t\t\t\tx3.tempVal = x3.leftVal;\r\n\r\n\t\t\t\t\t\tx3.leftKey = leftchild.tempKey;\r\n\t\t\t\t\t\tx3.leftVal = leftchild.tempVal;\r\n\r\n\t\t\t\t\t\tx3.left=t1;\r\n\t\t\t\t\t\tx3.fourth=x3.right;\r\n\t\t\t\t\t\tx3.right=x3.mid;\r\n\t\t\t\t\t\tx3.mid=t2;\r\n\r\n\t\t\t\t\t\t//make this node a 4-node\r\n\t\t\t\t\t\tx3.isFourNode=true;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t//if input key greater than right key of node x, insert node on right\r\n\t\t\telse if (key > x3.rightKey)\r\n\t\t\t\t//make temporary 4 node\r\n\t\t\t\tif(x3.right == null)\r\n\t\t\t\t{\r\n\t\t\t\t\tx3.isFourNode = true;\r\n\t\t\t\t\tx3.tempKey = x3.rightKey;\r\n\t\t\t\t\tx3.tempVal=x3.rightVal;\r\n\r\n\t\t\t\t\tx3.rightKey = key;\r\n\t\t\t\t\tx3.rightVal = val;\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\t//recursively call put method\r\n\t\t\t\t\tx3.right = put(x3.right, key, val);\r\n\t\t\t\t\t\r\n\t\t\t\t\t//if right child is 4-node, then split the child node into two child 2nodes and \r\n\t\t\t\t\t//insert the middle key of the former 4-node into this node as rightmost key making this a 4-node\t\t\t\t\t\r\n\t\t\t\t\tif(x3.right.isFourNode && x3.right instanceof ThreeNode)\r\n\t\t\t\t\t{\t\t\t\t\t\t\r\n\t\t\t\t\t\tThreeNode rightchild = (ThreeNode)(x3.right);\r\n\r\n\t\t\t\t\t\t//new third child\r\n\t\t\t\t\t\tTwoNode t1 = new TwoNode(rightchild.leftKey,rightchild.leftVal);\r\n\t\t\t\t\t\tt1.left = rightchild.left;\r\n\t\t\t\t\t\tt1.right = rightchild.mid;\r\n\r\n\t\t\t\t\t\t//new fourth child\r\n\t\t\t\t\t\tTwoNode t2 = new TwoNode(rightchild.rightKey,rightchild.rightVal);\r\n\t\t\t\t\t\tt2.left = rightchild.right;\r\n\t\t\t\t\t\tt2.right = rightchild.fourth;\r\n\r\n\t\t\t\t\t\tx3.tempKey = x3.rightKey;\r\n\t\t\t\t\t\tx3.tempVal = x3.rightVal;\r\n\r\n\t\t\t\t\t\tx3.rightKey = rightchild.tempKey;\r\n\t\t\t\t\t\tx3.rightVal = rightchild.tempVal;\t\t\t\t\t\r\n\r\n\t\t\t\t\t\tx3.fourth=t2;\r\n\t\t\t\t\t\tx3.right=t1;\t\t\t\t\t\r\n\r\n\t\t\t\t\t\t//make this node a 4-node\r\n\t\t\t\t\t\tx3.isFourNode=true;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t//if input key greater than left key of node x and lesser than right key of node x,\r\n\t\t\t//insert node on right\r\n\t\t\telse if (key > x3.leftKey && key < x3.rightKey)\r\n\t\t\t{\r\n\t\t\t\t//if no mid child exists\r\n\t\t\t\tif(x3.mid == null)\r\n\t\t\t\t{\r\n\t\t\t\t\t//make this node a temporary 4 node\r\n\t\t\t\t\tx3.isFourNode = true;\r\n\t\t\t\t\tx3.tempKey = key;\r\n\t\t\t\t\tx3.tempVal = val;\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\t//recursively call put method\r\n\t\t\t\t\tx3.mid=put(x3.mid,key, val);\r\n\t\t\t\t\t\r\n\t\t\t\t\t//if mid child is 4-node, then split the child node into two child 2nodes and \r\n\t\t\t\t\t//insert the middle key of the former 4-node into this node as mid key making this a 4-node\t\t\t\t\t\r\n\t\t\t\t\tif(x3.mid.isFourNode && x3.mid instanceof ThreeNode)\r\n\t\t\t\t\t{\t\t\t\t\t\t\r\n\t\t\t\t\t\tThreeNode midchild = (ThreeNode)(x3.mid);\r\n\r\n\t\t\t\t\t\t//new second child\r\n\t\t\t\t\t\tTwoNode t1 = new TwoNode(midchild.leftKey,midchild.leftVal);\r\n\t\t\t\t\t\tt1.left = midchild.left;\r\n\t\t\t\t\t\tt1.right = midchild.mid;\r\n\r\n\t\t\t\t\t\t//new third child\r\n\t\t\t\t\t\tTwoNode t2 = new TwoNode(midchild.rightKey,midchild.rightVal);\r\n\t\t\t\t\t\tt2.left = midchild.right;\r\n\t\t\t\t\t\tt2.right = midchild.fourth;\r\n\r\n\t\t\t\t\t\tx3.tempKey = midchild.tempKey;\r\n\t\t\t\t\t\tx3.tempVal = midchild.tempVal;\t\t\t\t\t\t\r\n\r\n\t\t\t\t\t\tx3.fourth=x3.right;\r\n\t\t\t\t\t\tx3.right=t2;\r\n\t\t\t\t\t\tx3.mid=t1;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//make this node a 4-node\r\n\t\t\t\t\t\tx3.isFourNode=true;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t//if equal, set value of node to input value\r\n\t\t\telse if (key == x3.leftKey)\r\n\t\t\t\tx3.leftVal = val;\r\n\r\n\t\t\telse\r\n\t\t\t\tx3.rightVal = val;\r\n\r\n\t\t\treturn x3;\r\n\t\t}\r\n\r\n\t\t//if current node is a 2-node\r\n\t\telse\r\n\t\t{\r\n\t\t\tTwoNode x2 = (TwoNode)x;\r\n\t\t\t\r\n\t\t\t//if key to be inserted is less than current node\r\n\t\t\tif (key < x2.key)\r\n\t\t\t{\r\n\t\t\t\t//check if no children\r\n\t\t\t\tif(x2.left == null)\r\n\t\t\t\t{\r\n\t\t\t\t\t//make three node\r\n\t\t\t\t\tThreeNode temp3node = new ThreeNode(key, val, x2.key, x2.val);\r\n\t\t\t\t\treturn temp3node;\r\n\t\t\t\t}\t\t\t\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\t//recursively call put method\r\n\t\t\t\t\tx2.left = put(x2.left, key, val);\r\n\t\t\t\t\t\r\n\t\t\t\t\t//if left child is 4-node, then split the child node into two child 2nodes and \r\n\t\t\t\t\t//insert the middle key of the former 4-node into this node as left key, making it a 3-node\r\n\t\t\t\t\tif(x2.left.isFourNode && x2.left instanceof ThreeNode)\r\n\t\t\t\t\t{\t\t\t\t\t\t\r\n\t\t\t\t\t\tThreeNode leftchild = (ThreeNode)(x2.left);\r\n\r\n\t\t\t\t\t\t//make three node\r\n\t\t\t\t\t\tThreeNode temp3node = new ThreeNode(leftchild.tempKey, leftchild.tempVal, x2.key, x2.val);\r\n\t\t\t\t\t\tTwoNode t1 = new TwoNode(leftchild.leftKey,leftchild.leftVal);\r\n\t\t\t\t\t\tt1.left = leftchild.left;\r\n\t\t\t\t\t\tt1.right = leftchild.mid;\r\n\t\t\t\t\t\ttemp3node.left = t1;\r\n\t\t\t\t\t\tTwoNode t2 = new TwoNode(leftchild.rightKey,leftchild.rightVal);\r\n\t\t\t\t\t\tt2.left = leftchild.right;\r\n\t\t\t\t\t\tt2.right = leftchild.fourth;\r\n\t\t\t\t\t\ttemp3node.mid =\tt2;\r\n\t\t\t\t\t\ttemp3node.right = x2.right;\r\n\t\t\t\t\t\treturn temp3node;\t\t\t\t\t\t\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t//if input key greater than key of node x, insert node on right\r\n\t\t\telse if (key > x2.key)\r\n\t\t\t{\r\n\t\t\t\t//check if no children\r\n\t\t\t\tif(x2.right == null)\r\n\t\t\t\t{\r\n\t\t\t\t\t//make three node\r\n\t\t\t\t\tThreeNode temp3node = new ThreeNode(x2.key, x2.val, key, val);\r\n\t\t\t\t\treturn temp3node;\r\n\t\t\t\t}\t\t\t\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\t//recursively call put method\r\n\t\t\t\t\tx2.right = put(x2.right, key, val);\r\n\t\t\t\t\t\r\n\t\t\t\t\t//if right child is 4-node, then split the child node into two child 2nodes and \r\n\t\t\t\t\t//insert the middle key of the former 4-node into this node as right key, making it a 3-node\r\n\t\t\t\t\tif(x2.right.isFourNode && x2.right instanceof ThreeNode)\r\n\t\t\t\t\t{\t\t\t\t\t\t\r\n\t\t\t\t\t\tThreeNode rightchild = (ThreeNode)(x2.right);\r\n\r\n\t\t\t\t\t\t//make three node\r\n\t\t\t\t\t\tThreeNode temp3node = new ThreeNode(x2.key, x2.val, rightchild.tempKey, rightchild.tempVal);\r\n\t\t\t\t\t\ttemp3node.left=x2.left;\r\n\t\t\t\t\t\tTwoNode t1 = new TwoNode(rightchild.leftKey,rightchild.leftVal);\r\n\t\t\t\t\t\tt1.left = rightchild.left;\r\n\t\t\t\t\t\tt1.right = rightchild.mid;\r\n\t\t\t\t\t\ttemp3node.mid = t1;\r\n\t\t\t\t\t\tTwoNode t2 = new TwoNode(rightchild.rightKey,rightchild.rightVal);\r\n\t\t\t\t\t\tt2.left = rightchild.right;\r\n\t\t\t\t\t\tt2.right = rightchild.fourth;\t\t\t\t\t\t\r\n\t\t\t\t\t\ttemp3node.right = t2;\t\t\t\t\r\n\t\t\t\t\t\treturn temp3node;\t\t\t\t\t\t\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t//if equal, set value of node to input value\r\n\t\t\telse \r\n\t\t\t\tx2.val = val;\r\n\t\t\treturn x2;\r\n\t\t}\r\n\r\n\t}","title":""},{"docid":"65d015e0ecf77a190cf821213253d992","score":"0.5625714","text":"public Node(K key, V value) {\r\n\t\t\tkeys = new LinkedList<K>();\r\n\t\t\tkeys.add(key);\r\n\t\t\tvalues = new LinkedList<V>();\r\n\t\t\tvalues.add(value);\r\n\t\t\tchildren = new LinkedList<Node>();\r\n\t\t\tchildren.add(null);\r\n\t\t\tchildren.add(null);\r\n\t\t}","title":""},{"docid":"df7a4b5c39b8501c3d21e63219178c6f","score":"0.56199723","text":"public void insertAtRear(String val){\n\t\tNode<String> node = new Node<String>(val,null);\n\t\tsize++;\n\t\tif(rear == null){\n\t\t\trear = node;\n\t\t\tfront = rear;\n\t\t}\n\t\telse{\n\t\t\trear.setLink(node);\n\t\t\trear = node;\n\t\t}\n\t}","title":""},{"docid":"a840ceeb50b6d69ba1d3493fc91e4801","score":"0.56040984","text":"private void addIt(K key, E elem) {\r\n\t\tBsNode<K, E> newNode = new BsNode<K, E>(key, elem);\r\n\t\tBsNode<K, E> node = this.rootNode;\r\n\t\tif (node == null) {\r\n\t\t\tthis.rootNode = newNode;\r\n\t\t} else {\r\n\t\t\twhile (true) {\r\n\t\t\t\tint cmp = key.compareTo(node.getKey());\r\n\t\t\t\tif (cmp > 0) {\r\n\t\t\t\t\tif (node.rightNode == null) {\r\n\t\t\t\t\t\tnode.rightNode = newNode;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tnode = node.rightNode;\r\n\t\t\t\t\t}\r\n\t\t\t\t} else if (cmp < 0) {\r\n\t\t\t\t\tif (node.leftNode == null) {\r\n\t\t\t\t\t\tnode.leftNode = newNode;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tnode = node.leftNode;\r\n\t\t\t\t\t}\r\n\t\t\t\t} else {\r\n\t\t\t\t\t// throw new Exception(\"key already exists\");\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}","title":""},{"docid":"5aec94bde5e37e1ca5e79ddb1c231bdd","score":"0.55956054","text":"public synchronized void put(Object key, Object node) {\r\n List target = (List) allNodes.get(key);\r\n List content = null;\r\n if (target == null) {\r\n target = root;\r\n allNodes.put(key, root);\r\n root.add(key);\r\n content = new ArrayList();\r\n root.add(content);\r\n }\r\n parents.put(node, key);\r\n if (content == null) {\r\n content = getChildrenCollection(key, target);\r\n }\r\n moveKeyToExtension(node, content);\r\n }","title":""},{"docid":"56438e17c187ffd63698150e5ce9e339","score":"0.55898315","text":"public void put(Key key, Value value) {\n if(key == null) throw new IllegalArgumentException(\"first argument to put() is null\");\n if(value == null) {\n delete(key);\n return;\n }\n\n // walk the linked list\n for(Node x = root; x != null; x = x.next) {\n // if found key return value\n if(x.key.equals(key)) {\n x.value = value;\n return;\n }\n }\n\n root = new Node(key, value, root);\n n++;\n }","title":""},{"docid":"698a45be392b529ed805abc8d6e92ffa","score":"0.55803514","text":"public void put(int key, int value) {\n int index = hashFunction(key);\n ListNode previous = findElement(index, key);\n \n if(previous.next==null){\n previous.next=new ListNode(key,value);\n }else{\n previous.next.value=value;\n } \n }","title":""},{"docid":"561a5525508bea44a6ad0f4e8db2c58d","score":"0.5564871","text":"public void addWord(String word) {\n Trie currentRoot = root;\n for (char c: word.toCharArray()){\n if (currentRoot.children.get(c)==null){\n currentRoot.children.put(c, new Trie(c));\n }\n currentRoot = currentRoot.children.get(c);\n }\n currentRoot.finish=true;\n }","title":""},{"docid":"aaea705ba9a648ffe03d14174fab1a28","score":"0.55615574","text":"public void addBeginning(String value){\n\t\tNode newNode = new Node();\n\t\tnewNode.setStringValue(value);\n\t\tnewNode.setParent(null);\n\t\t\n\t\tif(isEmpty()){\n\t\t\tnewNode.setChild(null);\n\t\t\thead = newNode;\n\t\t\tfoot = newNode;\n\t\t}else{\n\t\t\tnewNode.setChild(head);\n\t\t\thead.setParent(newNode);\n\t\t\thead = newNode;\n\t\t}\n\t\tlength++;\n\t}","title":""},{"docid":"a287c15053d3210f0550a2b9355636b7","score":"0.5554656","text":"public void add(V newNode) {\n // Verificando si ya se encuentra en el dic, el valor ingresado\n if (relations.containsKey(newNode)) return;\n relations.put(newNode, new Node<V>(newNode, index));\n keys.add(newNode);\n index++;\n }","title":""},{"docid":"dcc034a998e734b357f9dd3ac055661c","score":"0.5551584","text":"static WorkSpace doInsert(String key, int value, Node p, int h) {\n\r\n if (h == 0) {\r\n \r\n // we're at the leaf level, so compare and \r\n // either update value or insert new leaf\r\n\r\n LeafNode leaf = (LeafNode) p; //downcast\r\n int cmp = key.compareTo(leaf.guide);\r\n\r\n if (cmp == 0) {\r\n leaf.value = value; \r\n return null;\r\n }\r\n\r\n // create new leaf node and insert into tree\r\n LeafNode newLeaf = new LeafNode();\r\n newLeaf.guide = key; \r\n newLeaf.value = value;\r\n\r\n int offset = (cmp < 0) ? 0 : 1;\r\n // offset == 0 => newLeaf inserted as left sibling\r\n // offset == 1 => newLeaf inserted as right sibling\r\n\r\n WorkSpace ws = new WorkSpace();\r\n ws.newNode = newLeaf;\r\n ws.offset = offset;\r\n ws.scratch = new Node[4];\r\n\r\n return ws;\r\n }\r\n \r\n else {\r\n InternalNode q = (InternalNode) p; // downcast\r\n int pos;\r\n WorkSpace ws;\r\n\r\n if (key.compareTo(q.child0.guide) <= 0) {\r\n pos = 0; \r\n ws = doInsert(key, value, q.child0, h-1);\r\n }\r\n else if (key.compareTo(q.child1.guide) <= 0 || q.child2 == null) {\r\n pos = 1;\r\n ws = doInsert(key, value, q.child1, h-1);\r\n }\r\n else {\r\n pos = 2; \r\n ws = doInsert(key, value, q.child2, h-1);\r\n }\r\n\r\n if (ws != null) {\r\n if (ws.newNode != null) {\r\n // make ws.newNode child # pos + ws.offset of q\r\n\r\n int sz = copyOutChildren(q, ws.scratch);\r\n insertNode(ws.scratch, ws.newNode, sz, pos + ws.offset);\r\n if (sz == 2) {\r\n ws.newNode = null;\r\n ws.guideChanged = resetChildren(q, ws.scratch, 0, 3);\r\n }\r\n else {\r\n ws.newNode = new InternalNode();\r\n ws.offset = 1;\r\n resetChildren(q, ws.scratch, 0, 2);\r\n resetChildren((InternalNode) ws.newNode, ws.scratch, 2, 2);\r\n }\r\n }\r\n else if (ws.guideChanged) {\r\n ws.guideChanged = resetGuide(q);\r\n }\r\n }\r\n return ws;\r\n }\r\n }","title":""},{"docid":"7a52f34244d0d6bab549fbed16e03c36","score":"0.55498767","text":"private AVLnode<K,V> TreeInsert(K key,V value, AVLnode<K,V> treeRoot){\n if (treeRoot.element()!=null){\n //System.out.println(\"First insertNode is root: \"+treeRoot.element().key()+\" \"+treeRoot.element().value());\n } else{\n //System.out.println(\"First insertNode is empty root\");\n }\n AVLnode<K,V> insertNode=treeRoot; // Define node insertNode, which will take on the identity of consecutive nodes as we search down the tree for the position at which to insert our node. Initialize to root.\n while (!external(insertNode)){ // While we have not yet reached an external node...\n //System.out.println(\"Insertnode is not external\");\n int comparison=comparator.compare(insertNode.getEntry().key(),key); // ...compare key of entry at node with input key.\n //System.out.println(\"Comparison: \"+comparison);\n if (comparison==0){ // If key of entry at insertNode is equal to input...\n insertNode=insertNode.left(); // ...continue search at left child.\n } else if (comparison>0){ // If key of entry at insertNode is greater than input key...\n insertNode=insertNode.left(); // ...continue search at left child.\n } else{ // If key of entry at insertNode is less than input key...\n insertNode=insertNode.right(); // ...continue search at right child.\n }\n }\n //System.out.println(\"InsertNode is external\");\n // At this point, insertNode points at external node where entry with key and value should be inserted.\n // Set properties of new entry at this node.\n insertNode.setEntry(new DictEntry<K,V>(key, value)); // Where this node previously contained no entry because it was external, now set entry to include key and value.\n //System.out.println(\"Setting entry to \"+key+\" \"+value);\n insertNode.setLeft(new AVLnode<K,V>(null, insertNode, null, null)); // Create external left child for node.\n //System.out.println(\"Setting left to leaf with parent \"+insertNode.element().key()+\" \"+insertNode.element().value());\n insertNode.setRight(new AVLnode<K,V>(null, insertNode, null, null)); // Create external right child for node.\n //System.out.println(\"Setting right to leaf with parent \"+insertNode.element().key()+\" \"+insertNode.element().value());\n if ((insertNode.parent()!=null)&&(insertNode.element().key().equals(\"OPT\"))){\n //System.out.println(\"node \"+key+\" \"+value+\" has parent: \"+insertNode.parent().element().key());\n }\n if (insertNode.left().element()!=null){\n //System.out.println(\"node \"+key+\" \"+value+\" has left: \"+insertNode.left().element().key());\n }\n if (insertNode.right().element()!=null){\n //System.out.println(\"node \"+key+\" \"+value+\" has right: \"+insertNode.right().element().key());\n }\n // Update properties of tree.\n numEntries++; // Added one entry at (previously) external node.\n \n numNodes+=2; // Added two external nodes (children of insertNode).\n //System.out.println(\"numEntries=\"+numEntries+\" numNodes=\"+numNodes);\n //System.out.println(\"Returning the node with \"+insertNode.element().key()+\" \"+insertNode.element().value());\n return insertNode;\n }","title":""},{"docid":"eceea682445d01c2cf0adf7e362ada69","score":"0.55478394","text":"private BNode<Key, Value> put(BNode<Key, Value> x, Key key, Value value) {\t\t\r\n\t\tif (x == null) {\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\treturn new BNode<Key, Value>(key, value);\t\t\t\t\t\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\tint cmp = key.compareTo(x.key);\t\t\t\t\t\t\t\t\t\r\n\t\tif (cmp < 0) {\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\tx.left = put(x.left, key, value);\t\t\t\t\t\t\r\n\t\t} else if (cmp > 0) {\t\t\t\t\t\t\t\t\t\r\n\t\t\tx.right = put(x.right, key, value);\t\t\t\t\t\t\t\r\n\t\t} else {\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\tx.value = value;\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\tx.size = 1 + size(x.left) + size(x.right);\t\t\t\t\t\t\r\n\t\treturn x;\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t}","title":""},{"docid":"a8c8fdc8abb8be3c3d409fe196badc70","score":"0.55454826","text":"public void increaseKey(Node node, int value) {\n if(node == null) {\n System.out.println(\"increaseKey called, but node is null\");\n return;\n }\n Node parent = node.parent;\n //System.out.println(\"increaseKey called on \" + node.hashTag + \" Value = \" + value);\n if(node.parent == null) { /* If node is a root node, increase the key directly, change max if required */\n node.count += value;\n if(node != max && node.count > max.count)\n max = node;\n }\n else {\n if((value != -1) && (node.count + value <= node.parent.count)) { /* If increased value is less than parent's value, directly increase, nothing else to do */\n node.count += value;\n }\n else {\n if(node.parent.degree == 1) { /* If parent has 1 child, set child to null since this child is to be cut from the tree */\n node.parent.child = null;\n }\n else if(node.parent.degree > 1) {\n /* Remove node from its sibling list */\n node.left_sibling.right_sibling = node.right_sibling; \n node.right_sibling.left_sibling = node.left_sibling;\n \n /* Reset parent's child object if required */\n if(node.parent.child == node)\n node.parent.child = node.right_sibling; //Set child node to the right sibling of the original one\n }\n else {\n System.out.println(\"Inside increaseKey ... Parent's degree information error\");\n return;\n }\n node.parent.degree = node.parent.degree - 1; /* Parent's degree decreased by 1 */\n \n node.left_sibling = null;\n node.right_sibling = null;\n node.parent = null;\n node.childCut = false;\n \n /* -1 is a special value used by modifyChildCut to forcefully cut nodes from tree whose childCut is already true */\n if(value != -1)\n node.count += value; /* We dont want to change values of nodes that are cut from the tree due to childChut = true */\n topLevelMerge(node); /* add Node as a root node to the heap */\n modifyChildCut(parent); /* Recursively check childCut values of parent nodes, and cut the parent nodes from the tree if required */\n }\n }\n }","title":""},{"docid":"77405b223fb9b9689c5da155e3e07ef1","score":"0.5539756","text":"public void addWord(String word) {\n char[] wordArray=word.toCharArray();\n head=root;\n for(char ch:wordArray){\n if(head.map.containsKey(ch)){\n head=head.map.get(ch);\n }\n else{\n \t\tTrieNode tmp=new TrieNode(ch);\n \t\thead.map.put(ch,tmp);\n \t\thead=tmp;\n }\n }\n head.isLeaf=true;\n }","title":""},{"docid":"5b85adc70f110087f6538544a57d9f6c","score":"0.5529799","text":"void put(String word) {\n Node cur = root;\n\n for (int i = 0;i<word.length();i++) {\n int idx = word.charAt(i) - 'a';\n\n if (cur.arr[idx] == null) {\n // create new outdegree for 'd' for example\n cur.arr[idx] = new Node();\n }\n cur = cur.arr[idx];\n if (i == word.length()-1) cur.keyend = true;\n\n }\n\n }","title":""},{"docid":"9d8dac1e8e38b19b1849c3678366a9d1","score":"0.5526217","text":"public TrieNode insertTrieNode(TrieNode root, String s)\n {\n TrieNode temp = root;\n for (int i = 0; i < s.length(); i++)\n {\n char ch = s.charAt(i);\n if (temp.getChildren().get(ch) == null)\n {\n temp.getChildren().put(ch, new TrieNode(s.substring(0,i+1)));\n }\n temp = temp.getChildren().get(ch);\n }\n temp.setKey(s);\n temp.setCount(temp.getCount() + 1);\n return root;\n }","title":""},{"docid":"c20f8ef389608ff485fa3ec8aa31cc0d","score":"0.5522007","text":"private boolean add(Node root, String word, int offset){\n if(offset==word.length()) return false;\n int c = word.charAt(offset);\n\n //Search for the node to add the word to\n Node last = null, next = root.firstChild;\n while(next!=null){\n //No match found, keep traversing the trie\n if(next.value<c){\n last = next;\n next = next.nextSibling;\n }\n //match found - add remaining word to this node\n else if(next.value == c){\n return add(next, word, offset+1);\n }\n else{\n break;\n }\n }\n //No match found for this char, create a new node and insert\n Node node = new Node(c);\n if(last == null){\n //Insert node at the beginning of the list - works for next == null;\n root.firstChild = node;\n node.nextSibling = next;\n }\n else{\n //inserting between last and next\n last.nextSibling = node;\n node.nextSibling = next;\n }\n\n //Add remaining letters\n for(int i = offset+1; i<word.length();i++){\n node.firstChild = new Node(word.charAt(i));\n node = node.firstChild;\n }\n return true;\n\n }","title":""},{"docid":"7b0862d224691e250c91c51244b59cb3","score":"0.55166596","text":"private void rollingAdd() {\n // start with hash to add\n final ImmutableNode startNode = getCurrentNode();\n final long oldDescendantCount = getStructuralNode().getDescendantCount();\n final long descendantCount = oldDescendantCount == 0 ? 1 : oldDescendantCount + 1;\n BigInteger hashToAdd = startNode.getHash() == null || BigInteger.ZERO.equals(startNode.getHash())\n ? startNode.computeHash()\n : startNode.getHash();\n BigInteger newHash;\n BigInteger possibleOldHash = BigInteger.ZERO;\n\n if (startNode.getKind() == NodeKind.STRING_VALUE || startNode.getKind() == NodeKind.OBJECT_STRING_VALUE\n || startNode.getKind() == NodeKind.BOOLEAN_VALUE || startNode.getKind() == NodeKind.OBJECT_BOOLEAN_VALUE\n || startNode.getKind() == NodeKind.NUMBER_VALUE || startNode.getKind() == NodeKind.OBJECT_NUMBER_VALUE\n || startNode.getKind() == NodeKind.NULL_VALUE || startNode.getKind() == NodeKind.OBJECT_NULL_VALUE) {\n nodeReadOnlyTrx.moveTo(startNode.getParentKey());\n }\n\n // go the path to the root\n do {\n final Node node = pageTrx.prepareRecordForModification(getCurrentNode().getNodeKey(), IndexType.DOCUMENT, -1);\n if (node.getNodeKey() == startNode.getNodeKey()) {\n // first, take the hashcode of the node only\n newHash = hashToAdd;\n } else if (node.getNodeKey() == startNode.getParentKey()) {\n // at the parent level, just add the node\n possibleOldHash = node.getHash();\n newHash = Node.to128BitsAtMaximumBigInteger(possibleOldHash.add(hashToAdd.multiply(PRIME)));\n hashToAdd = newHash;\n setAddDescendants(startNode, node, descendantCount);\n } else {\n // at the rest, remove the existing old key for this element\n // and add the new one\n newHash = Node.to128BitsAtMaximumBigInteger(node.getHash().subtract(possibleOldHash.multiply(PRIME)));\n newHash = Node.to128BitsAtMaximumBigInteger(newHash.add(hashToAdd.multiply(PRIME)));\n hashToAdd = newHash;\n possibleOldHash = node.getHash();\n setAddDescendants(startNode, node, descendantCount);\n }\n node.setHash(newHash);\n } while (nodeReadOnlyTrx.moveTo(getCurrentNode().getParentKey()).hasMoved());\n setCurrentNode(startNode);\n }","title":""},{"docid":"da512baedbe00eb15b59ac523db67d80","score":"0.5516546","text":"void setWortelNode(Node<Key> root);","title":""},{"docid":"dcb4e0ad16cd609097d08054b02ba77d","score":"0.5509412","text":"public void put(int value) { //插入一个结点到二叉树\n Node newNode = new Node(value); //用当前值构建一个结点\n if (root == null)\n root = newNode;//如果根节点为null,表示第一次插入，将改结点赋值给根结点\n else {\n //This will return the soon to be parent of the value you're inserting\n Node parent = find(value); //查找要插入的结点，如果要插入的结点不存在，则返回父结点的位置\n\n //This if/else assigns the new node to be either the left or right child of the parent\n if (value < parent.data) {//如果当前结点的值小于parent结点的值,\n parent.left = newNode; //将其赋值给parent的左结点\n parent.left.parent = parent; //设置插入子节点的父结点为parent\n return;\n } else {//如果要插入的结点的值大于（或等于）parent的值\n parent.right = newNode; //将其赋值给parent的右结点\n parent.right.parent = parent; //设置插入子节点的父结点为parent\n return;\n }\n }\n }","title":""},{"docid":"9c930544389252d381f1adccfab59f33","score":"0.5503634","text":"public void insert(String key, int val) {\n int delta = val;\n if (wordSum.containsKey(key)) {\n delta = val - wordSum.get(key);\n }\n wordSum.put(key, val);\n Trie node = root;\n for (Character ch : key.toCharArray()) {\n node = node.childs.computeIfAbsent(ch, x -> new Trie());\n node.score += delta;\n }\n }","title":""},{"docid":"9c617a7429ce767e92aa8ee323ca6afa","score":"0.5501631","text":"public void insert (String word) {\n String s, key;\n TNode t;\n //concatenate #\n word = word.concat(\"#\");\n //create a hash-table of all children of root node currently on the trie\n HashMap<String, TNode> children;\n\n for (int i = word.length()-1; i >= 0; i--) {\n s = word.substring(i);\n //always start adding from root\n children = root.children;\n\n //this should run only when s = '#'\n if (s.length()==1) {\n if (!children.containsKey(s)) {\n t = new TNode(s);\n children.put(s,t);\n } //else do nothing (should never be the case anyway)\n } else {\n for (int x = 0; x < s.length(); x++) {\n key = s.substring(0,x+1);\n if (children.containsKey(key)) {\n t = children.get(key);\n } else {\n t = new TNode(key);\n children.put(key, t);\n }\n children = t.children;\n }\n }\n }\n }","title":""},{"docid":"95efd6e2ee08b6ac8c7bcb86a77a82f4","score":"0.54964566","text":"public void put(int key, int value) {\n int index = key % hash;\n ListNode ls = table[index];\n while(ls.next != null){\n ls = ls.next;\n if(ls.key == key){\n ls.value = value;\n return;\n }\n }\n ListNode n = new ListNode(key,value);\n n.next = table[index].next;\n n.prev = table[index];\n if(table[index].next != null) table[index].next.prev = n;\n table[index].next = n;\n }","title":""},{"docid":"e9ad96bf1b69b81b00eb02245e46148b","score":"0.54869","text":"public void add(T value){\n root = addRecursive(value, root);\n }","title":""},{"docid":"e6239476f96fb6491f94ee3215cfcb00","score":"0.5483689","text":"public void put(int key, int value) {\n \t\tif(node[key%size]==null) {\n \t\t\tnode[key%size]=new Node(key,value);\n \t\t}else {\n \t\t\tcurrentNode=node[key%size];\n \t\t\twhile(currentNode.nextNode!=null && currentNode.key!=key) {\n \t\t\t\tcurrentNode=currentNode.nextNode;\n \t\t\t}\n \t\t\tif(currentNode.key==key)\n \t\t\t\tcurrentNode.value=value;\n \t\t\telse\n \t\t\tcurrentNode.nextNode=new Node(key,value);\n \t\t}\n \t\t\n \t}","title":""},{"docid":"321376e077640d5285dcda6c855d6c3a","score":"0.5481026","text":"public void add(Pair elm)\n {\n Map current = this;\n Map nw = new Map();\n \n while(current.next !=null && elm.Key.toInt() >= current.element.Key.toInt())\n {\n current = current.next;\n }\n \n \n nw.element = current.element; //Save current.element first before overwriting current\n current.element = elm; //set current.element to the new element\n nw.next = current.next;// connect the new sequence part to the sequence part after current\n current.next = nw; // connect current to the nw.\n \n \n }","title":""},{"docid":"5573f887bb5c59688d4485a843ed318a","score":"0.54743385","text":"public void insert(String key) {\n\n if (numelements == size) {\n //TODO: need to expand the hash table and rehash its contents. \n size *= 2;\n int key_;\n for (int times = 0; times != size; times++)\n {\n for (StringNode cursor = table[times]; cursor != null; cursor = cursor.getNext())\n {\n key_ = hash(key);\n table[key_] = new StringNode(key, table[key_]); \n }\n\n }\n }\n int lol = hash(key);\n table[lol] = new StringNode(key, table[lol]);\n //TODO: Code for actual insert.\n }","title":""},{"docid":"72d4a67b5049c748ffc15a2c4e4dfbb5","score":"0.54726213","text":"public TrieNode(String word) {\n children = new ArrayList<TrieNode>();\n value = word;\n }","title":""},{"docid":"c730ab2c4d8f9246740665362ed40166","score":"0.54679674","text":"private BsNode<K, E> addRec(BsNode<K, E> node, K key, E elem) {\r\n\t\tif (node == null) {\r\n\t\t\treturn new BsNode<K, E>(key, elem);\r\n\t\t} else {\r\n\t\t\tint cmp = key.compareTo(node.getKey());\r\n\t\t\tif (cmp > 0) {\r\n\t\t\t\tnode.rightNode = addRec(node.rightNode, key, elem);\r\n\t\t\t} else if (cmp < 0) {\r\n\t\t\t\tnode.leftNode = addRec(node.leftNode, key, elem);\r\n\t\t\t} else {\r\n\t\t\t\t// throw new Exception(\"key already exists\");\r\n\t\t\t}\r\n\t\t\treturn node;\r\n\t\t}\r\n\t}","title":""},{"docid":"865bf642f7524b288235cbe76c56ee41","score":"0.5458286","text":"public void addChild(Node child) {\n this.children.add(child);\n this.keys.sort(Comparator.comparingInt(Integer::valueOf));\n numKey++;\n }","title":""},{"docid":"83350a19844a44896056077101476f3c","score":"0.54546994","text":"public TrieNode(){\r\n currentVal = null;\r\n for(int i=0;i<26;i++)\r\n nextNode[i] = null;\r\n }","title":""},{"docid":"31c736b7febebf08c2845c10e1206399","score":"0.54486525","text":"private void postorderAdd() {\n // start with hash to add\n final ImmutableNode startNode = getCurrentNode();\n // long for adapting the hash of the parent\n BigInteger hashCodeForParent = BigInteger.ZERO;\n // adapting the parent if the current node is no structural one.\n if (!(startNode instanceof StructNode)) {\n final Node node = pageTrx.prepareRecordForModification(getCurrentNode().getNodeKey(), IndexType.DOCUMENT, -1);\n node.setHash(getCurrentNode().computeHash());\n nodeReadOnlyTrx.moveTo(getCurrentNode().getParentKey());\n }\n // Cursor to root\n StructNode cursorToRoot;\n do {\n cursorToRoot = pageTrx.prepareRecordForModification(getCurrentNode().getNodeKey(), IndexType.DOCUMENT, -1);\n hashCodeForParent = getCurrentNode().computeHash().add(hashCodeForParent.multiply(PRIME));\n // Caring about attributes and namespaces if node is an element.\n if (cursorToRoot.getKind() == NodeKind.ELEMENT) {\n final ElementNode currentElement = (ElementNode) cursorToRoot;\n // setting the attributes and namespaces\n final int attCount = ((ElementNode) cursorToRoot).getAttributeCount();\n for (int i = 0; i < attCount; i++) {\n nodeReadOnlyTrx.moveTo(currentElement.getAttributeKey(i));\n hashCodeForParent = getCurrentNode().computeHash().add(hashCodeForParent.multiply(PRIME));\n }\n final int nspCount = ((ElementNode) cursorToRoot).getNamespaceCount();\n for (int i = 0; i < nspCount; i++) {\n nodeReadOnlyTrx.moveTo(currentElement.getNamespaceKey(i));\n hashCodeForParent = getCurrentNode().computeHash().add(hashCodeForParent.multiply(PRIME));\n }\n nodeReadOnlyTrx.moveTo(cursorToRoot.getNodeKey());\n }\n\n // Caring about the children of a node\n if (nodeReadOnlyTrx.moveTo(getStructuralNode().getFirstChildKey()).hasMoved()) {\n do {\n hashCodeForParent = getCurrentNode().getHash().add(hashCodeForParent.multiply(PRIME));\n } while (nodeReadOnlyTrx.moveTo(getStructuralNode().getRightSiblingKey()).hasMoved());\n nodeReadOnlyTrx.moveTo(getStructuralNode().getParentKey());\n }\n\n // setting hash and resetting hash\n cursorToRoot.setHash(hashCodeForParent);\n hashCodeForParent = BigInteger.ZERO;\n } while (nodeReadOnlyTrx.moveTo(cursorToRoot.getParentKey()).hasMoved());\n\n setCurrentNode(startNode);\n }","title":""},{"docid":"0f2d3261d51bc4a413462e6ba70e774a","score":"0.5447254","text":"public void add (Key key, Value value);","title":""},{"docid":"da829456364ab3b7748ecad548810054","score":"0.5445417","text":"public void addChild(String value, TreeNode node) {\n children.put(value, node);\n }","title":""},{"docid":"e1f0f67cc43bdeefac7f81680044776c","score":"0.5442292","text":"public Node(K aKey, V aValue) {\n\t\t\tkey = aKey;\n\t\t\tvalue = aValue;\n\t\t\tchild = null;\n\t\t\tparent = null;\n\t\t\tprev = null;\n\t\t\tnext = null;\n\t\t}","title":""},{"docid":"f8a7b4411aac736b2b2d78edf96ae709","score":"0.54364824","text":"@Override\n public OverflowNode insert(int key) {\n AbstractBTreeNode curNode = this;\n Stack<AbstractBTreeNode> parents = new Stack<AbstractBTreeNode>();\n ArrayList<Integer> keys;\n ArrayList<AbstractBTreeNode> children;\n\n while (true) { //find leaf on wich to insert and create stack containing parents\n int i;\n for (i = 0; i < curNode.getKeys().size(); i++) {\n if (curNode.getKeys().get(i) > key) {\n break;\n }\n }\n\n if(curNode.getChildren().size() == 0){\n break;\n }\n if (i >= curNode.getChildren().size()) {\n break;\n //return parents;\n } else {\n parents.push(curNode);\n curNode = curNode.getChildren().get(i);\n continue;\n }\n }\n\n curNode.getKeys().add(key);\n curNode.getKeys().sort(Comparator.naturalOrder());\n\n if(curNode.getKeys().size() <= curNode.getDegree() * 2 ){ //no need to split\n return null;\n }\n\n OverflowNode ovfl = curNode.split();\n OverflowNode ovflBAK = ovfl; //copy just to make sure\n\n while (true){\n if(ovfl == null){\n break;\n }\n if(parents.size() == 0){\n //TODO\n //root changes...\n AbstractBTreeNode newRoot = new BTreeNode(curNode.getDegree(), curNode.get_bTree());\n\n newRoot.addKey(ovfl.getKey());\n newRoot.addChild(curNode);\n newRoot.addChild(ovfl.getRightChild());\n\n curNode.get_bTree().setRoot(newRoot);\n\n break;\n }\n curNode = parents.peek();\n parents.pop();\n\n key = ovfl.getKey();\n AbstractBTreeNode ovflRight = ovfl.getRightChild();\n\n curNode.getKeys().add(key);\n curNode.getKeys().sort(Comparator.naturalOrder());\n int index = curNode.getKeys().indexOf(key);\n curNode.getChildren().add(index+1, ovflRight);\n\n if(curNode.getKeys().size() > curNode.getDegree() * 2){\n ovfl = curNode.split();\n continue;\n }else{\n break;\n }\n }\n return ovflBAK;\n }","title":""},{"docid":"e362b88b91211c71e0ae31a92f321e2b","score":"0.54237944","text":"private static void insertChildren(HeapNode st, FibonacciHeap assistent) {\r\n HeapNode tmp =assistent.insert(st.getKey());\r\n tmp.setOriginal(st);\r\n HeapNode tmp2=st.getNext();\r\n while(tmp2!=st) {\r\n \ttmp=assistent.insert(tmp2.getKey());\r\n tmp.setOriginal(tmp2);\r\n tmp2=tmp2.getNext();\r\n }\r\n }","title":""},{"docid":"c3c39632996183c5e96b022e75f16604","score":"0.5401413","text":"public void putItem(Object key, Object value) {\n\t\thash = Math.abs(key.hashCode() % 500);\n\t\tNode entry = new Node(key, value);\n\n\t\tif (list[hash] == null) {\n\t\t\tlist[hash] = entry;\n\t\t} else {\n\t\t\tNode current = list[hash];\n\t\t\twhile (current.getNext() != null) {\n\t\t\t\tcurrent = current.getNext();\n\t\t\t}\n\t\t\tcurrent.setNext(entry);\n\t\t}\n\t}","title":""},{"docid":"7e469cdd2d3f30d036cb9c89f2e27d47","score":"0.54011303","text":"public void set(Object key, Object value) {\n growArray();\n if (!has(key)) {\n this.items[size] = new Node(key, value);\n this.size++;\n }\n }","title":""},{"docid":"6c974daf71a8ddbe4692c2bd63699c84","score":"0.5391353","text":"private Node put(Node current, Key key, Value val) {\n if(current == null) {\n return new Node(key, val);\n }\n int result = key.compareTo(current.key);\n if(result < 0) {\n current.left = put(current.left, key, val);\n }\n else if(result > 0) {\n current.right = put(current.right, key, val);\n }\n else { //result == 0\n current.val = val;\n }\n current.count = 1 + size(current.left) + size(current.right);\n return current;\n }","title":""},{"docid":"babd4e914cd9ba7ab2968d77d77bf45b","score":"0.53890216","text":"public void addWord(String word) {\n\t\tTrieNode iter = root;\n\t\tfor (int i =0 ; i < word.length(); i++) {\n\t\t\tchar cand = word.charAt(i);\n\t\t\tif (!iter.children.containsKey(cand)) {\n\t\t\t\titer.children.put(cand, new TrieNode());\n\t\t\t}\n\t\t\titer = iter.children.get(cand);\n\t\t}\n\t\titer.isEnd = true;\n\t}","title":""},{"docid":"f76bf49235d718953ce1557709138c80","score":"0.5381916","text":"public void put(int key, int value) {\n\t\tint i = index(key);\n\t\tif (nodes[i] == null) {\n\t\t\t// add a fake head\n\t\t\tnodes[i] = new ListNode(-1, -1);\n\t\t}\n\t\tListNode prev = findPrev(nodes[i], key);\n\t\tif (prev.next != null) {\n\t\t\t// prev.next (node) not null = we have this key\n\t\t\tprev.next.val = value;\n\t\t} else {\n\t\t\tprev.next = new ListNode(key, value);\n\t\t}\n\t}","title":""},{"docid":"62574bfef5c971b9b6f864ad2e045d35","score":"0.5381875","text":"private Node putHelper(K key, V value, Node p) {\n if (key == null) {\n throw new IllegalArgumentException(\"A null key for put()!\");\n }\n if (value == null) {\n throw new IllegalArgumentException(\"A null value for put()!\");\n }\n if (p == null) {\n size += 1;\n return new Node(key, value);\n }\n int cmp = key.compareTo(p.key);\n if (cmp < 0) {\n p.left = putHelper(key, value, p.left);\n } else if (cmp > 0) {\n p.right = putHelper(key, value, p.right);\n } else {\n p.value = value;\n }\n return p;\n }","title":""},{"docid":"26b5a81fed5238a2154e6b0a596ae1e4","score":"0.5380553","text":"void insert(int key) {\n java.util.Queue<Node> q = new java.util.LinkedList<Node>();\n Node temp = root;\n q.add(temp);\n\n while (!q.isEmpty()) {\n temp = q.peek();\n q.remove();\n\n if (temp.left == null) {\n temp.left = new Node(key);\n break;\n } else {\n q.add(temp.left);\n }\n\n if (temp.right == null) {\n temp.right = new Node(key);\n break;\n } else {\n q.add(temp.right);\n }\n\n }\n }","title":""},{"docid":"641a3ac51da956e8d4417e846cda74b7","score":"0.53646314","text":"public TrieNode()\n {\n child = new HashMap<Character,TrieNode>();\n\n // Initialize all the Trie nodes with NULL\n for (char i = 'a'; i <= 'z'; i++) // nice way of going through all the letters of alphabet, since the letters are ordered ASCII characters\n child.put(i, null);\n\n isLast = false;\n childSize = 0;\n }","title":""},{"docid":"5c9777d228abe7201b81562a7fcefd0e","score":"0.5356004","text":"void link()\n {\n if(y<map.length-1) children.add(map[y + 1][x]);\n //if(y<map.length-1 && x>0) children.add(map[y + 1][x - 1]);\n if(x<map[y].length-1) children.add(map[y][x + 1]);\n if(x>0) children.add(map[y][x - 1]);\n //if(y>0 && x<map[y].length-1) children.add(map[y - 1][x + 1]);\n if(y>0) children.add(map[y - 1][x]);\n //if(y>0 && x>0) children.add(map[y - 1][x - 1]);\n }","title":""},{"docid":"bfd805cb51b05afec88a0fc3158b50b4","score":"0.5354961","text":"public BSTNode(K key, V value) {\n\t\tthis.key = key;\n\t\tthis.value = value;\n\t\tthis.left = null;\n\t\tthis.right = null;\n\t\tthis.parent = null;\n\t}","title":""},{"docid":"f11120251d24e7a4ef3107e77facd62c","score":"0.5346972","text":"private void increaseKey(Node node, int value)\n {\n node.tag.setCount(value);\n //save the parent\n Node parent = node.parent;\n //check if the new key is greater than the parent and parent is not null\n if ((parent != null) && (node.tag.getCount() > parent.tag.getCount())) {\n //if it is greater than cut the child, and perfrom cascade cut on the parent\n cutChildFromParent(node, parent);\n cascadingCut(parent);\n }\n //check if the increased key is greater than the max.\n if (node.tag.getCount() > max.tag.getCount()) {\n //if it is greater than the max then update the key\n max = node;\n }\n }","title":""},{"docid":"36814df7ca51b180eef959d64b790d41","score":"0.53454965","text":"@Override\n public Uri insert(Uri uri, ContentValues values) {\n Log.e(TAG, \"MAIN INSERT: inside insert method\");\n // We need to insert on proper place in ring\n String key = values.getAsString(\"key\");\n String value = values.getAsString(\"value\");\n Log.e(TAG, \"MAIN INSERT: Called for key:value = \" + key + \"::\" + value);\n if(currentNode.successor == null && currentNode.predecessor == null){\n Log.e(TAG,\"Single Node up case\");\n storeContent(key,value);\n return uri;\n }\n try {\n String keyHash = genHash(key);\n Log.e(TAG, \"INSERT: KeyHash ::\" + keyHash + \" for key: \" + key);\n if(currentNode.id.compareTo(currentNode.predecessor.id) < 0 && keyHash.compareTo(currentNode.id) > 0 &&\n keyHash.compareTo(currentNode.predecessor.id)>0){\n Log.e(TAG, \"KeyHash is greater than largest Key so insert in Lowest Key Node [here]\");\n storeContent(key,value);\n }\n else if(currentNode.id.compareTo(currentNode.predecessor.id) < 0 && keyHash.compareTo(currentNode.id) < 0){\n Log.e(TAG, \"KeyHash is less than smallest Key so insert in Lowest Key Node [here]\");\n storeContent(key,value);\n }\n else if(keyHash.compareTo(currentNode.id) < 0 && keyHash.compareTo(currentNode.predecessor.id) > 0){\n Log.e(TAG, \"KeyHash is less than current Node id and Greater than previous\");\n storeContent(key, value);\n }\n else /*if(keyHash.compareTo(currentNode.id) > 0)*/{\n Log.e(TAG, \"KeyHash: \" + keyHash + \" is greater than current Node id \" + currentNode.id);\n // send the data to next node.\n String sucPort = currentNode.successor.port;\n String dataMessage = INSERT_DATA + DELIMETER + key + DELIMETER + value + DELIMETER + sucPort;\n\n new ClientTask().executeOnExecutor(AsyncTask.SERIAL_EXECUTOR, INSERT_DATA, myPort, dataMessage, sucPort);\n\n }\n /*else{\n Log.e(TAG,\"InsertMethod: No place found for this Message Key: \" + key\n + \" Value: \" + value);\n }*/\n } catch (NoSuchAlgorithmException e) {\n Log.e(TAG, \"NoSuchAlgorithmException keyHash Insert\");\n }\n\n\n return uri;\n\n }","title":""},{"docid":"6a2b29aed8e1b14a723f824d4d87e543","score":"0.53413564","text":"public void put(String key, String value){\n HashNode head = bucket.get(getHash(key));\n if( head == null){\n bucket.set(getHash(key), new HashNode(key, value));\n }else{\n while(head != null){\n if(head.key == key){\n head.value = value;\n return;\n }\n head = head.next;\n }\n HashNode node = new HashNode(key, value);\n node.next = bucket.get(getHash(key));\n bucket.set(getHash(key),node);\n }\n\n ++entries;\n if( (entries*1.0 / size) >= LOAD_THRESHOLD){\n // Increase #bucket\n ArrayList<HashNode> temp = bucket;\n bucket = new ArrayList<HashNode>();\n size*=2;\n for(int i = 0; i < size; i++){\n bucket.add(null);\n }\n // Rehash each item in table\n for(HashNode headNode : temp){\n while(headNode != null){\n put(headNode.key, headNode.value);\n headNode = headNode.next;\n }\n }\n }\n }","title":""},{"docid":"88a35d7ad5b631a655cd2ad0ab3ec72b","score":"0.5339904","text":"public void add(String s) {\n\t\tTrieNode current = root;\n\t\tfor (int i = 0; i < s.length(); i++) {\n\t\t\tboolean isEnd = (i == s.length() - 1);\n\t\t\tchar c = s.charAt(i);\n\t\t\tint index = c - 'a';\n\t\t\tif (current.getChild(index) != null) {\n\t\t\t\tcurrent = current.getChild(index);\n\t\t\t\tif (isEnd && !current.isEnd()){\n\t\t\t\t\tcurrent.setEnd(true);\n\t\t\t\t\t//size++;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tcurrent.setChild(index, new TrieNode(c, isEnd));\n\t\t\t\t//if (isEnd){\n\t\t\t\t//\tsize++;\n\t\t\t\t//}\n\t\t\t\tcurrent = current.getChild(index);\n\t\t\t}\n\n\t\t}\n\t\tsize++;\n\t\t//System.err.println(size());\n\t}","title":""},{"docid":"0edc319185fc87818767c2232bf1fb63","score":"0.53362215","text":"private void add(Node node, V value) {\n if(node.getValue().compareTo(value) < 0) {\n if(node.getRightChild() == null) {\n node.setRightChild(new Node(value));\n } else {\n add(node.getRightChild(), value);\n }\n }\n // Value less than node value\n else if(node.getValue().compareTo(value) > 0) {\n if(node.getLeftChild() == null) {\n node.setLeftChild(new Node(value));\n } else {\n add(node.getLeftChild(), value);\n }\n }\n // Value equals node value\n else {\n throw new IllegalArgumentException(\"Value already exists in tree\");\n }\n }","title":""},{"docid":"307d134faa882d792e013154ec82a6a6","score":"0.5331263","text":"public void add(Item key) {\r\n\t\tput(key);\r\n\t\tbubbleUp(last(root));\r\n\t}","title":""},{"docid":"4a3d1e6867b7fec531954770f383d5d0","score":"0.5317359","text":"private Node<T> addRecursive(T value, Node<T> n){\n if(n == null){\n return new Node<T>(value, null, null);\n }\n\n int comparison = value.compareTo(n.value);\n\n if(comparison < 0){\n n.left = addRecursive(value, n.left);\n } else if(comparison > 0){\n n.right = addRecursive(value, n.right);\n } else {\n // node is duplicate, do nothing.\n }\n return n;\n }","title":""},{"docid":"1ff4dfff4527492c6ef0588d5c1dd7bb","score":"0.53152496","text":"public void insert(K key, V value) {\n\t\t\tItem<K, V> curr = new Item<K, V>(key, value);\n\t\t\tcurr.next = this.head;\n\t\t\tcurr.key = key;\n\t\t\tcurr.value = value;\n\t\t\tthis.head = curr;\n\t\t\tthis.length++;\n\t\t}","title":""},{"docid":"89d3ade574c863d21448b9b2926375aa","score":"0.5314146","text":"static int addBT(Node root) \n{ \n if (root == null) \n return 0; \n return (root.key + addBT(root.left) + \n addBT(root.right)); \n}","title":""},{"docid":"27a67a4ca4691bd962a6e5c7cce78d20","score":"0.5313648","text":"Node insertRec(T val, Node node, List<Node> path) {\n if (node == null) {\n Node newNode = new Node(val);\n path.add(newNode);\n return newNode;\n }\n\n int comp = val.compareTo(node.val);\n if (comp < 0) {\n node.left = insertRec(val, node.left, path);\n path.add(node);\n } else if (comp > 0) {\n node.right = insertRec(val, node.right, path);\n path.add(node);\n } else {\n // Already exists in the set\n path.add(null);\n }\n\n return node;\n }","title":""},{"docid":"3136b4e61ec01b066d4ecfca973a1573","score":"0.5312753","text":"public void put(int key, int value) {\n int hash = key % prime;\n Node node = table[hash];\n while (node.next != null) {\n if (node.next.key == key) {\n node.next.val = value;\n return;\n }\n node = node.next;\n }\n node.next = new Node(key, value, null);\n }","title":""},{"docid":"ddfa9e3db5112de80dd9f172c5ca1164","score":"0.53026855","text":"public void insert(Record<T> record) \n {\n for (T kword : record.Keywords) {\n // Initializing the new nodes fields.\n Node<T> temp_n = new Node<T>();\n Node<T> des = null;\n temp_n.records.insert(record);\n temp_n.keyword = kword;\n if (this.root != null) { \n // Continuing...\n }\n else {\n this.root = temp_n;\n // Returning updated node.\n return;\n }\n // Looping through node\n for (Node<T> temp_r = this.root; temp_r != null;) {\n des = temp_r;\n // Checking if node exists.\n if (temp_r.keyword.compareTo(kword) == 0) {\n // Inserting the record into the node.\n temp_r.records.insert(record);\n // Returning updated node.\n return;\n }\n if (kword.compareTo(temp_r.keyword) > 0) {\n // Putting right node.\n temp_r = temp_r.right;\n }\n else {\n // Putting left node.\n temp_r = temp_r.left;\n }\n }\n if (kword.compareTo(des.keyword) > 0) {\n des.right = temp_n;\n }\n else {\n des.left = temp_n;\n }\n }\n }","title":""},{"docid":"721fd21fb9e877de4742fe36df778621","score":"0.5301421","text":"private void put(int key, int val)\r\n\t{\r\n\t\tif(root == null)\r\n\t\t\troot = new TwoNode(key, val);\r\n\t\telse\r\n\t\t{\r\n\t\t\t//recursively call put function\r\n\t\t\troot = this.put(root, key, val);\r\n\t\t\t\r\n\t\t\t//after inserting key-val, if root is a four node, then split the root \r\n\t\t\t//into one parent 2-node and two child 2-nodes\r\n\t\t\tif(root.isFourNode && root instanceof ThreeNode)\r\n\t\t\t{\t\t\t\t\t\t\r\n\t\t\t\tThreeNode oldroot = (ThreeNode)(root);\t\t\t\r\n\t\t\t\tTwoNode newRoot = new TwoNode(oldroot.tempKey,oldroot.tempVal);\r\n\t\t\t\t\r\n\t\t\t\t//new left 2-node child\r\n\t\t\t\tTwoNode leftChild = new TwoNode(oldroot.leftKey,oldroot.leftVal);\r\n\t\t\t\tleftChild.left = oldroot.left;\r\n\t\t\t\tleftChild.right = oldroot.mid;\r\n\r\n\t\t\t\t//new right 2-node child\r\n\t\t\t\tTwoNode rightChild = new TwoNode(oldroot.rightKey,oldroot.rightVal);\r\n\t\t\t\trightChild.left = oldroot.right;\r\n\t\t\t\trightChild.right = oldroot.fourth;\r\n\t\t\t\tnewRoot.left=leftChild;\r\n\t\t\t\tnewRoot.right=rightChild;\r\n\r\n\t\t\t\troot = newRoot;\r\n\t\t\t}\r\n\t\t}\r\n\t}","title":""},{"docid":"52456eb5a7d8ca4426e67a1b51e387f1","score":"0.5297631","text":"public void insert(String word) {\n TrieNode node = root;\n for(char c : word.toCharArray()){\n if(node.children[c - 'a'] == null){\n node.children[c - 'a'] = new TrieNode();\n }\n node = node.children[c - 'a'];\n }\n node.isEnd = true;\n }","title":""},{"docid":"d242c6d7b2eb9c370b596932325795fb","score":"0.52949893","text":"public void insert(D data, V value)\n {\n if(root == null)\n root = new MultiKeyNode<>(data, value);\n else\n insert(data, value, root);\n }","title":""},{"docid":"f0a689c2033ab9f6ac3e79bba21f0b35","score":"0.5294787","text":"@Override\n public void insert(Key key, Value value) throws IllegalNullKeyException, DuplicateKeyException {\n if (key == null) {\n throw new IllegalNullKeyException();\n }\n // Inserts new node according to standard binary search tree algorithm\n insertHelper(this.root, null, key, value);\n try {\n // Rebalances tree to preserve Red-Black Tree properties\n fixInsert(findNodeHelper(this.root, key));\n } catch (Exception e) {\n System.out.println(e.getMessage());\n }\n ++this.numKeys;\n }","title":""},{"docid":"a3a3ab74bd6b481b253b79defc41a0b2","score":"0.5292586","text":"public void insert(int key)\n {\n if(root == null) {\n root = new Node(key);\n return ;\n }\n Queue<Node> q = new LinkedList<Node>();\n q.add(root);\n while(!q.isEmpty()) {\n Node temp = q.poll();\n if(temp.left == null) {\n temp.left = new Node(key);\n break;\n }\n else\n q.add(temp.left);\n if(temp.right == null) {\n temp.right = new Node(key);\n break;\n }\n else\n q.add(temp.right);\n }\n }","title":""},{"docid":"e4c3a2d2ba832f931840458f3bc1e47f","score":"0.52906215","text":"public void add(String key, Item value) {\r\n\t\tint hashVal = hash(key);\r\n\r\n\t\t// Find proper bucket to insert the value.\r\n\t\twhile ((table[hashVal]) != null)\r\n\t\t\thashVal = serchNextBucket(hashVal);\r\n\r\n\t\ttable[hashVal] = value;\r\n\t}","title":""},{"docid":"8e045c9bc3a13857d79f52f8b28db143","score":"0.52886355","text":"public void addMovie(String movieKey, String year){\n Node newMovie = new Node(movieKey, year);\n \n //if our root is null just add the newMovie as the root\n if (root == null){\n \n root = newMovie;\n }\n \n else{\n \n //node we use to traverse our tree\n Node traverseNode = root;\n \n //will use this further down\n Node parent;\n \n while(true){\n \n //parebt gets assigned to traverseNode or essenitally our root\n parent = traverseNode;\n \n \n //if the movie key entered when compared with our traverseNode turns out to be less than 0 (meaning the movie key comes before our traverseNode's movie key alphabetically\n //we then know to be checking the left side of the tree\n if(movieKey.compareToIgnoreCase(traverseNode.movieKey)<0){\n \n //now we are looking at the left child \n traverseNode = traverseNode.leftChild;\n \n //if there is no left child \n if (traverseNode == null){\n \n //we set parents (which points to where traverseNode points) equal to the new Node\n parent.leftChild = newMovie;\n return;\n }\n }\n \n //if we get here it means the moviekey is going on the right side of the tree \n else{\n \n //looking at the right child now\n traverseNode = traverseNode.rightChild;\n \n //if its null\n if (traverseNode == null){\n \n //we set parents right child equal to the new node\n parent.rightChild = newMovie;\n return;\n }\n \n }\n \n \n }\n \n \n \n }\n \n }","title":""}],"string":"[\n {\n \"docid\": \"67ae2d6abd8bb2e5caafd7fc0ba31ea7\",\n \"score\": \"0.70195013\",\n \"text\": \"public void addChild(String key, String value) {\\n int childPosition = getFirstCharCode(key);\\n\\n if (children[childPosition] == null) {\\n children[childPosition] = new TrieNode(key.charAt(0));\\n }\\n\\n if (key.length() > 1) {\\n children[childPosition].addChild(key.substring(1), value);\\n } else { // end of key\\n children[childPosition].value = value;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24e3fd13a56662f346ea8b3f5cb7c276\",\n \"score\": \"0.6318054\",\n \"text\": \"static void insert(String key) \\n { \\n int level; \\n int length = key.length(); \\n int index; \\n \\n TrieNode pCrawl = root; \\n \\n for (level = 0; level < length; level++) \\n { \\n index = key.charAt(level) - 'a'; \\n if (pCrawl.children[index] == null) \\n pCrawl.children[index] = new TrieNode(); \\n \\n pCrawl = pCrawl.children[index]; \\n } \\n \\n // mark last node as leaf \\n pCrawl.isEndOfWord = true; \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b4a8827433c463e500c90f7bf28c5ff\",\n \"score\": \"0.62483054\",\n \"text\": \"private void _put(K key, V val){\\n\\t\\tTreeNode node = root, parent = null;\\r\\n\\t\\tLinkedList<TreeNode> path = new LinkedList<>();\\r\\n\\t\\t\\r\\n\\t\\tint dir = 0;\\r\\n\\t\\twhile(node != null){\\r\\n\\t\\t\\tpath.add(node);\\r\\n\\t\\t\\tparent = node;\\r\\n\\t\\t\\t// found - do nothing\\r\\n\\t\\t\\tif(node.key.equals(key)){\\r\\n\\t\\t\\t\\tnode.val = val;\\r\\n\\t\\t\\t\\t// assign\\r\\n\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tdir = key.compareTo(node.key);\\r\\n\\t\\t\\tif(dir < 0)\\r\\n\\t\\t\\t\\tnode = node.left;\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t\\tnode = node.right;\\r\\n\\t\\t}\\r\\n\\t\\t// not found - add a new node - red link\\r\\n\\t\\tnode = new TreeNode(key, val);\\r\\n\\t\\tnode.red = true;\\r\\n\\t\\tif(dir < 0)\\r\\n\\t\\t\\tparent.left = node;\\r\\n\\t\\telse\\r\\n\\t\\t\\tparent.right = node;\\r\\n\\t\\tpath.add(node);\\r\\n\\t\\t// rebalance\\r\\n\\t\\trebalance(path);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17234d001fa32229f7a57fdf0d9203f4\",\n \"score\": \"0.61070424\",\n \"text\": \"public boolean add(K[] keyarr, V aValue) { //create a link and an unlink method to perform this and the remove method\\n\\t\\tif(keyarr.equals(null) || keyarr.length == 0)\\n\\t\\t{\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\tif(nulCheck(keyarr))\\n\\t\\t{\\n\\t\\t\\tthrow new NullPointerException();\\n\\t\\t}\\n\\t\\tK[] ket = prefix(keyarr);\\n\\t\\tNode p = findNode(ket);\\n\\t\\t\\n\\t\\tif(ket != null && ket.length == keyarr.length)\\n\\t\\t{\\n\\t\\t\\tp.value = aValue;\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tEntryNode[] arr = nMaker(keyarr, ket);\\n\\n\\t\\t\\tif(ket == null)\\n\\t\\t\\t{\\n\\t\\t\\t\\tlink((Node) arr[0], root);\\n\\t\\t\\t\\tfor(int i = 1; i< keyarr.length; i++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tlink((Node) arr[i],(Node) arr[i-1]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tp = findNode(keyarr);\\n\\t\\t\\t\\tp.value = aValue;\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t\\tif(ket.length < keyarr.length)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint t = arr.length;\\n\\t\\t\\t\\tEntryNode y = findNode(ket);\\n\\t\\t\\t\\tfor(int i = 0; i < t; i++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tlink((Node) arr[i], (Node) y);\\n\\t\\t\\t\\t\\ty = arr[i];\\n\\t\\t\\t\\t\\tif(i >= keyarr.length)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tp = findNode(keyarr);\\n\\t\\t\\t\\t\\t\\tp.value = aValue;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tp = findNode(keyarr);\\n\\t\\t\\t\\tp.value = aValue;\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t\\tif(ket.length > keyarr.length)\\n\\t\\t\\t{\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2663a7c2b41bd6c32414e5851ae79cd0\",\n \"score\": \"0.60898536\",\n \"text\": \"@Override\\n public SkipListNode insertElement(Integer key, String value) {\\n SkipListNode closestNodeAfter = closestNodeAfter(key);\\n\\n // If closestNodeAfter.getPredecessor().getKey() == key,\\n // that means the key has already existed in the skip list\\n // Report the Error\\n if (closestNodeAfter.getPredecessor().getKey() == key) {\\n System.out.println(\\\"Error: Insert replicated key: \\\" + key);\\n return null;\\n }\\n\\n // newBottomNode is the new node which we will insert in the bottom list\\n SkipListNode newBottomNode = new SkipListNode(key, value);\\n SkipListNode newNode = newBottomNode;\\n // Insert the newBottomNode into the front of the \\\"closestNodeAfter\\\" node\\n insertBefore(closestNodeAfter, newBottomNode);\\n // We start from bottom level, thus the currentLevel is 1\\n int currentLevel = 1;\\n\\n // Flip coins\\n // random.nextInt return the uniformly distributed\\n // integer between 0 (inclusive) and n (exclusive).\\n // Therefore, n = 2. We have 50% chance for getting either face of the coin\\n // 0 represents the tail of the coin, we stop promoting the node to the upper level list\\n // 1 represents the head of the coin, we keep promoting the node to the upper level list\\n while (random.nextInt(2) == 1) {\\n // Create a new level if necessary\\n if (currentLevel >= maxLevel) {\\n maxLevel++;\\n SkipListNode newStart = new SkipListNode(SkipListNode.START, null);\\n SkipListNode newEnd = new SkipListNode(SkipListNode.END, null);\\n linkHorizontal(newStart, newEnd);\\n linkVertical(newStart, start);\\n linkVertical(newEnd, end);\\n // Set both start node and end node to the new ones\\n start = newStart;\\n end = newEnd;\\n }\\n\\n // Find the successor in the upper level\\n while (closestNodeAfter.getUp() == null) {\\n closestNodeAfter = closestNodeAfter.getSuccessor();\\n }\\n closestNodeAfter = closestNodeAfter.getUp();\\n\\n // Create a new node for the upper level\\n // Only store the key into the node and set value to null\\n SkipListNode upperNewNode = new SkipListNode(key, null);\\n insertBefore(closestNodeAfter, upperNewNode);\\n linkVertical(upperNewNode, newNode);\\n\\n newNode = upperNewNode;\\n currentLevel++;\\n }\\n\\n size++;\\n // return the new node object in the bottom list\\n return newBottomNode;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5d7cbad430054a9b0d2a9da4f3811f1\",\n \"score\": \"0.603441\",\n \"text\": \"public void addChild(KeyValueNode<K, V> aNode)\\n {\\n children.add(aNode);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1518765cc8c0e83c9cf8d0db440932b4\",\n \"score\": \"0.5979094\",\n \"text\": \"public void insert(K key, T value) {\\r\\n //Check if the root has been created or not.\\r\\n if (root==null){\\r\\n //create root node and first leaf\\r\\n //set up root node\\r\\n Node lnode=new LeafNode(key,value);\\r\\n root=lnode;\\r\\n }\\r\\n else{\\r\\n //find the right position and insert\\r\\n //with recursive method\\r\\n recinsert(key,value,root,0); \\r\\n } \\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"850c8f98c8ff8096b08854a2eaf0b326\",\n \"score\": \"0.59101933\",\n \"text\": \"private Tree<K, V> insertRec(Tree<K, V> node, K key, V value) {\\n if (node == null) { // Not found/tree empty, create node\\n node = new Tree<>(key, value);\\n size++;\\n } else if (key.compareTo(node.key) < 0) { // Lower -> left branch\\n node.left = insertRec(node.left, key, value);\\n node = node.balance();\\n } else if (key.compareTo(node.key) > 0) { // Greater -> right branch\\n node.right = insertRec(node.right, key, value);\\n node = node.balance();\\n } else // Equal -> Change value\\n node.value = value;\\n return node;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce6ba746fe66d0fb4788f5e507ed925b\",\n \"score\": \"0.58830905\",\n \"text\": \"public void insert(int key, String value) {\\n // Create actual node from provided values\\n Node newNode = new Node(key, value);\\n if (this.root == null) {\\n // The new node is actually the first node in the tree\\n this.root = newNode;\\n } else {\\n Node current = root;\\n Node parent;\\n\\n // This while loop will break when newNode is inserted as new leaf\\n while (true) {\\n parent = current;\\n if (key <= current.key) {\\n // If new key is <= of the current node key - continue LEFT\\n current = current.leftChild;\\n if (current == null) {\\n // The parent is the leaf\\n parent.leftChild = newNode;\\n return;\\n }\\n } else {\\n // If new key is > of the current node key - continue RIGHT\\n current = current.rightChild;\\n if (current == null) {\\n // The parent is the leaf\\n parent.rightChild = newNode;\\n return;\\n }\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07baa57279ae53b00981915b86134027\",\n \"score\": \"0.5880505\",\n \"text\": \"void setNode(int key, String value);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75d9bdc6af91ea67510a9ff4facc1802\",\n \"score\": \"0.58440024\",\n \"text\": \"TrieNode(Character c){\\n this.c = c;\\n children = new HashMap<Character, TrieNode>();\\n val = counter++;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d5667febbacb9bd6d58a9d5409e87920\",\n \"score\": \"0.58383244\",\n \"text\": \"public boolean add(K key, V value){\\n\\t\\tif(contains(key))\\n\\t\\t\\treturn false;\\n\\t\\tif(root == null)\\n\\t\\t\\troot = new Node<K,V>(key, value);\\n\\t\\telse\\n\\t\\t\\tinsert(key,value,root,null,false);\\n\\t\\tcurrentSize++;\\n\\t\\tmodCounter++;\\n\\t\\treturn true;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"403268aa2a5003364e6e254851134d24\",\n \"score\": \"0.58313847\",\n \"text\": \"@Override\\n public void put(K key, V value){\\n if(size==0){\\n Root = new TreeNode(key, value);\\n size = size+1;\\n return;\\n }\\n else{\\n TreeNode M = Root;\\n while(M!=null) {\\n if (key.compareTo(M.get_K_V()) > 0) {\\n if(M.right==null){\\n M.right = new TreeNode(key, value);\\n size = size+1;\\n return;\\n }\\n M = M.right;\\n } else if (key.compareTo(M.get_K_V()) < 0) {\\n if(M.left==null ) {\\n M.left = new TreeNode(key, value);\\n size = size + 1;\\n return;\\n }\\n M = M.left;\\n } else if (key.compareTo(M.get_K_V()) == 0) {\\n return;\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b15374a0df9fb319faec5b79debd478\",\n \"score\": \"0.58247113\",\n \"text\": \"static void insert(String key, int value, TwoThreeTree tree) {\\n\\r\\n int h = tree.height;\\r\\n\\r\\n if (h == -1) {\\r\\n LeafNode newLeaf = new LeafNode();\\r\\n newLeaf.guide = key;\\r\\n newLeaf.value = value;\\r\\n tree.root = newLeaf; \\r\\n tree.height = 0;\\r\\n }\\r\\n else {\\r\\n WorkSpace ws = doInsert(key, value, tree.root, h);\\r\\n\\r\\n if (ws != null && ws.newNode != null) {\\r\\n // create a new root\\r\\n\\r\\n InternalNode newRoot = new InternalNode();\\r\\n if (ws.offset == 0) {\\r\\n newRoot.child0 = ws.newNode; \\r\\n newRoot.child1 = tree.root;\\r\\n }\\r\\n else {\\r\\n newRoot.child0 = tree.root; \\r\\n newRoot.child1 = ws.newNode;\\r\\n }\\r\\n resetGuide(newRoot);\\r\\n tree.root = newRoot;\\r\\n tree.height = h+1;\\r\\n }\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc112de11eb87a0986810f956544e49d\",\n \"score\": \"0.5810153\",\n \"text\": \"public void put(Key key, Value val) {\\n if (key == null) throw new IllegalArgumentException(\\\"argument to put() is null\\\");\\n if (val == null) {\\n delete(key);\\n return;\\n }\\n if (this.isEmpty()) {\\n this.first = new Node();\\n this.first.key = key;\\n this.first.value = val;\\n this.n++;\\n return;\\n }\\n\\n // Percorre tabela de símbolos. Se encontrar key\\n // atribui val. Se não encontrar, insere par key-value\\n // e rearranja tabela.\\n Node current = this.first;\\n Node previous = null;\\n while (current.key.compareTo(key) < 0) {\\n previous = current;\\n if (current.next == null) {\\n Node newKey = new Node();\\n newKey.key = key;\\n newKey.value = val;\\n this.n++;\\n previous.next = newKey;\\n newKey.next = null;\\n return;\\n }\\n current = current.next;\\n }\\n if (current.key.compareTo(key) == 0) {\\n // Altera current.value com novo val\\n current.value = val;\\n return;\\n }\\n \\n // Insere o novo nó\\n Node newKey = new Node();\\n newKey.key = key;\\n newKey.value = val;\\n this.n++;\\n // Se o novo nó é o primeiro da lista\\n if (previous == null) {\\n this.first = newKey;\\n newKey.next = current;\\n return;\\n }\\n previous.next = newKey;\\n newKey.next = current;\\n return;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e85721aa20a869f93e1a15a44cd9868\",\n \"score\": \"0.580835\",\n \"text\": \"valueNode(int value,String key) {\\n this.value = value;\\n curKeys = new LinkedList<String>();\\n curKeys.add(key);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e7066e64b94cdffc8f52ef8983a4d40\",\n \"score\": \"0.57938904\",\n \"text\": \"private static void addNode(Node<String> root, String value, String path) {\\n /* base case when the path passed in is empty */\\n /* replace the value at root */\\n if (path.equals(\\\"\\\")) {\\n root.setData(value);\\n return;\\n }\\n\\n /* perform the traversal based on the path string, starting from the left index */\\n if (path.charAt(0) == 'L') {\\n if (root.getLeft() == null) {\\n root.setLeft(new Node<String>(\\\"-1\\\"));\\n }\\n addNode(root.getLeft(), value, path.substring(1));\\n } else if (path.charAt(0) == 'R') {\\n if (root.getRight() == null) {\\n root.setRight(new Node<String>(\\\"-1\\\"));\\n }\\n addNode(root.getRight(), value, path.substring(1));\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"72b1abfc858bc27909660f0f9cf48703\",\n \"score\": \"0.5790228\",\n \"text\": \"public void addChild(K aKey, V aValue)\\n {\\n addChild(new KeyValueNode<K, V>(aKey, aValue));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fce16e1c3fb30baf3d3c433f39ab3ac4\",\n \"score\": \"0.578181\",\n \"text\": \"public abstract Triple putTriple( Node key, Triple value );\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f51d3cecdbd4a41a7e45321ea4540c28\",\n \"score\": \"0.5774453\",\n \"text\": \"public Node add(StringTrieBuilder builder, CharSequence s, int start, int sValue) {\\n\\t\\t\\treturn this;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fde56ca47de3320aff9066a0c8582f10\",\n \"score\": \"0.57744205\",\n \"text\": \"private TrieNode insertTrie(Character c, TrieNode trieNode){\\n if (trieNode.children.containsKey(c)){\\n return trieNode.children.get(c);\\n }\\n TrieNode newTrieNode = new TrieNode(c);\\n trieNode.children.put(c, newTrieNode);\\n return newTrieNode;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"08835f02d9e99fff8a2c659eb6b58971\",\n \"score\": \"0.5764307\",\n \"text\": \"public void buildKeyIndex(String name, int node, String value) {\\n/* 448 */ KeyIndex index = buildKeyIndexHelper(name);\\n/* 449 */ index.add(value, node, this._currentRootForKeys);\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ddd486a1add3a5ac28937093a369113\",\n \"score\": \"0.5745191\",\n \"text\": \"public void add(final String key) {\\n root = add(root, key, 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"90d25456aeeb452c4001c3ca528a8039\",\n \"score\": \"0.572829\",\n \"text\": \"public boolean insert(Object key, Object value) {\\n if (key == null) {\\n throw new IllegalArgumentException(\\\"key must be non-null\\\");\\n }\\n\\n int i = h1(key);\\n Node trav = table[i];\\n \\n // check if chain already has key\\n while (trav != null) {\\n if (trav.key.equals(key)) {\\n return true;\\n }\\n trav = trav.next;\\n }\\n\\n // otherwise, add key to beginning of chain\\n Node storage = table[i]; // carries temporary chain\\n table[i] = new Node(key, value); // new node at front\\n table[i].next = storage;\\n\\n numKeys++;\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ea9d0cb48dcc7d182b10fce4da4f874\",\n \"score\": \"0.5726735\",\n \"text\": \"synchronized public TrieNode add(char x) {\\n if (childSize==0) {\\n /*\\n * Lazily create the char array\\n */\\n nexts = new TrieNode[10][0];\\n }\\n \\n /*\\n * Here the char array implements a Hash structure.\\n * x % 10 obtains the position where x should be placed.\\n */\\n int mod = x % 10;\\n \\n /* lazily create the char array */\\n if (nexts[mod].length==0) nexts[mod] = new TrieNode[5];\\n \\n int bucket = -1;\\n \\n /*\\n * find the place where the given char should be inserted,\\n * or return if it's already in trie\\n */\\n for (int i=0; i<nexts[mod].length; i++) {\\n if (nexts[mod][i]==null) {\\n /*\\n * find an empty place, but we still don't know if the char already\\n * exists in the array, so we just mark the place\\n */\\n if (bucket==-1) bucket = i;\\n } else {\\n /*\\n * Now we are sure the char already exists in the array, we return its node\\n */\\n if (nexts[mod][i].ch==x) return nexts[mod][i];\\n }\\n }//for i\\n \\n /*\\n * Now we are sure a new TrieNode need to be created and inserted\\n */\\n \\n childSize++;\\n \\n TrieNode node = new TrieNode(x);\\n \\n if (bucket!=-1) {\\n /* we already marked where we can insert the new node */\\n nexts[mod][bucket] = node;\\n return node;\\n }\\n \\n /*\\n * Now we have to expand the array for the new node.\\n * We'd like to expand it with two more buckets, chances are we\\n * will have another new node to insert.\\n */\\n \\n TrieNode[] array = new TrieNode[nexts[mod].length+2];\\n \\n /* copy content to the new array */\\n for (int i=0; i<nexts[mod].length; i++) {\\n array[i] = nexts[mod][i];\\n }\\n \\n /* now we insert the new node */\\n array[nexts[mod].length] = node;\\n \\n nexts[mod] = array;\\n \\n return node;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"966659a6863afe3b5fce39d8b3807076\",\n \"score\": \"0.57149124\",\n \"text\": \"public V put(K key, V value)\\r\\n\\t{\\r\\n\\t\\tV output = null;\\r\\n\\t\\tif (root==null)\\r\\n\\t\\t{\\r\\n\\t\\t\\troot = new ThreadedMapNode<K,V>(key, value);\\r\\n\\t\\t\\troot.threadFlag=true;\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\telse\\r\\n\\t\\t{\\r\\n\\t\\t\\tThreadedMapNode<K,V> thisNode;\\r\\n\\t\\t\\tthisNode=root;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tboolean keepLooping=true;\\r\\n\\t\\t\\twhile (keepLooping)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t//Loops through the tree to find the correct placement.\\r\\n\\t\\t\\t\\tif(key.compareTo(thisNode.key)<0)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"left at \\\"+thisNode.value);\\r\\n\\t\\t\\t\\t\\t//Checks the left subtree\\r\\n\\t\\t\\t\\t\\tif (thisNode.leftChild==null)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t//Stops looping, adds a new node and sets the thread to its parent\\r\\n\\t\\t\\t\\t\\t\\tThreadedMapNode<K,V> newNode = new ThreadedMapNode<K,V>(key, value);\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tthisNode.leftChild=newNode;\\r\\n\\t\\t\\t\\t\\t\\tnewNode.threadFlag=true;\\r\\n\\t\\t\\t\\t\\t\\tnewNode.rightChild=thisNode;\\r\\n\\t\\t\\t\\t\\t\\tkeepLooping=false;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t//Sets thisNode to the left child\\r\\n\\t\\t\\t\\t\\t\\tthisNode=thisNode.leftChild;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\telse if(key.compareTo(thisNode.key)>0)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//Checks the right subtree\\r\\n\\t\\t\\t\\t\\tif (thisNode.threadFlag)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t//Stops looping, adds a new node and sets the thread to its parent's thread\\r\\n\\t\\t\\t\\t\\t\\tThreadedMapNode<K,V> newNode = new ThreadedMapNode<K,V>(key, value);\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tthisNode.threadFlag=false;\\r\\n\\t\\t\\t\\t\\t\\tnewNode.threadFlag=true;\\r\\n\\t\\t\\t\\t\\t\\tnewNode.rightChild=thisNode.rightChild;\\r\\n\\t\\t\\t\\t\\t\\tthisNode.rightChild=newNode;\\r\\n\\t\\t\\t\\t\\t\\tkeepLooping=false;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t//Sets thisNode to the right child\\r\\n\\t\\t\\t\\t\\t\\tthisNode=thisNode.rightChild;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\telse if(key.compareTo(thisNode.key)==0)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//If keys are identical, stops looping and updates the key\\r\\n\\t\\t\\t\\t\\t//at that location\\r\\n\\t\\t\\t\\t\\toutput=thisNode.value;\\r\\n\\t\\t\\t\\t\\tthisNode.value=value;\\r\\n\\t\\t\\t\\t\\tkeepLooping=false;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn output;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dbb0470442665eb40b776e250e3e48aa\",\n \"score\": \"0.570857\",\n \"text\": \"public TrieNode(String word, String sequence) {\\n children = new ArrayList<TrieNode>();\\n value = word;\\n this.sequence = sequence;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7223ef0ec3f3e04c998ed8942aee03c6\",\n \"score\": \"0.56930226\",\n \"text\": \"public void add(E value) {\\n ListNode<E> newNode = new ListNode<>(value);\\n if (root == null) {\\n root = newNode;\\n end = root;\\n } else {\\n end.setNext(newNode);\\n newNode.setPrevious(end);\\n end = newNode;\\n }\\n size++;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63899849e01c3d38f52acaf1d16ad5aa\",\n \"score\": \"0.56896305\",\n \"text\": \"public void add(String n) {\\r\\n\\t\\tTrieNode current = root;\\r\\n\\t\\t//Compares each character in the string to the current TrieNode we are at's children.\\r\\n\\t\\tfor(int i = 0; i < n.length(); i++) {\\r\\n\\t\\t\\t /* If it doesn't have a child\\r\\n\\t\\t\\t * with the same value, then we create a new child with the same value as the current character we are at and visit\\r\\n\\t\\t\\t * that new Node.\\r\\n\\t\\t\\t */\\r\\n\\t\\t\\tif(current.getChild(n.charAt(i))==null) {\\r\\n\\t\\t\\t\\tcurrent.addChild(new TrieNode(n.charAt(i)));\\r\\n\\t\\t\\t\\tcurrent = current.getChild(n.charAt(i));\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t/*If the TrieNode we are at has a child with the same value as the current character we are examining\\r\\n\\t\\t\\t , then we visit the that child TrieNode and check the next character in the string.\\r\\n\\t\\t\\t */\\r\\n\\t\\t\\telse {\\r\\n\\t\\t\\t\\tcurrent = current.getChild(n.charAt(i));\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t//Once we reach the end of the String add a default TrieNode to represent the end of a string in our Trie.\\r\\n\\t\\tcurrent.addChild(new TrieNode());\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab87ec97e6c6a378e86aa38f9d5de51e\",\n \"score\": \"0.56858957\",\n \"text\": \"public T add(String key, T value) {\\n Hash<T> newHash = new Hash<T>(value);\\n\\n // Quadratic probing variable\\n int i = 1;\\n\\n int hash = h(key, this.size);\\n int pos = hash;\\n while (table[pos] != null && table[pos].getValue() != null) {\\n pos = (hash + (i * i)) % size;\\n i++;\\n if (pos == hash) { // We are back at the original position\\n return null;\\n }\\n }\\n\\n table[pos] = newHash;\\n items++;\\n return newHash.getValue();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1cb675566ce76cd96cb8daa29670fc98\",\n \"score\": \"0.5665963\",\n \"text\": \"public TrieNode add(String word, String sequence) {\\n TrieNode newNode = new TrieNode(word, sequence);\\n children.add(newNode);\\n return newNode;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66682af7f05c0f32d00470eae08ec6da\",\n \"score\": \"0.5647848\",\n \"text\": \"public void buildTrie(){\\n\\t\\tint c;\\n\\t\\tint end = inChars.length-1;\\n\\t\\t\\n//\\t\\tSystem.out.print(\\\"INPUT::\\\");\\n//\\t\\tfor (char chr : inChars){\\n//\\t\\t\\tSystem.out.print(chr);\\n//\\t\\t}\\n//\\t\\tSystem.out.println();\\n\\t\\t\\n\\t\\t// the suffix tree is built from the last character forward\\n\\t\\tfor(int i = inChars.length-1; i>=0; i--) {\\n\\t\\t\\tc = inChars[i];\\n\\t\\t\\t\\n\\t\\t\\t// first fill the empty child nodes of the root node\\n\\t\\t\\tif(root.getChild(c) == null){\\n\\t\\t\\t\\troot.setChild(c, new Node(i,end));\\n\\t\\t\\t\\t\\n\\t\\t\\t//if the node is already filled, it must be split until an empty node is reached for insertion\\t\\t\\t\\n\\t\\t\\t} else {\\t\\n\\t\\t\\t\\tsplitChild(root.getChild(c), inChars, i , c, end);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f5f946763c99ed8ee75baeb7ce301c13\",\n \"score\": \"0.564411\",\n \"text\": \"private Node add(final Node x, final String key, final int d) {\\n Node y = x;\\n if (y == null) {\\n y = new Node();\\n }\\n if (d == key.length()) {\\n if (!y.isString) {\\n n++;\\n }\\n y.isString = true;\\n } else {\\n char c = Character.toUpperCase(key.charAt(d));\\n y.next[c - 'A'] = add(y.next[c - 'A'], key, d + 1);\\n }\\n return y;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"92abd2fa3d710bc74a1a45eda895c4a9\",\n \"score\": \"0.562715\",\n \"text\": \"private Node put(Node x, int key, int val)\\r\\n\\t{\\t\\t\\r\\n\\t\\t//check if node is 2-node or 3-node\\r\\n\\t\\tif(x instanceof ThreeNode)\\r\\n\\t\\t{\\r\\n\\t\\t\\tThreeNode x3 = (ThreeNode)x;\\r\\n\\t\\t\\t//if input key lesser than left key of node x, insert node on left\\r\\n\\t\\t\\tif (key < x3.leftKey)\\r\\n\\t\\t\\t{\\t\\r\\n\\t\\t\\t\\t//check if left child exists\\r\\n\\t\\t\\t\\tif(x3.left == null)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//make temporary 4 node\\r\\n\\t\\t\\t\\t\\tx3.isFourNode=true;\\r\\n\\t\\t\\t\\t\\tx3.tempKey = x3.leftKey;\\r\\n\\t\\t\\t\\t\\tx3.tempVal=x3.leftVal;\\r\\n\\r\\n\\t\\t\\t\\t\\tx3.leftKey = key;\\r\\n\\t\\t\\t\\t\\tx3.leftVal = val;\\r\\n\\t\\t\\t\\t}\\t\\t\\t\\t\\r\\n\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//recursively call put method\\r\\n\\t\\t\\t\\t\\tx3.left = put(x3.left, key, val);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//if left child is 4-node, then split the child node into two child 2nodes and \\r\\n\\t\\t\\t\\t\\t//insert the middle key of the former 4-node into this node as leftmost key making this a 4-node\\r\\n\\t\\t\\t\\t\\tif(x3.left.isFourNode && x3.left instanceof ThreeNode)\\r\\n\\t\\t\\t\\t\\t{\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tThreeNode leftchild = (ThreeNode)(x3.left);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t//new left child\\r\\n\\t\\t\\t\\t\\t\\tTwoNode t1 = new TwoNode(leftchild.leftKey,leftchild.leftVal);\\r\\n\\t\\t\\t\\t\\t\\tt1.left = leftchild.left;\\r\\n\\t\\t\\t\\t\\t\\tt1.right = leftchild.mid;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t//new second child\\r\\n\\t\\t\\t\\t\\t\\tTwoNode t2 = new TwoNode(leftchild.rightKey,leftchild.rightVal);\\r\\n\\t\\t\\t\\t\\t\\tt2.left = leftchild.right;\\r\\n\\t\\t\\t\\t\\t\\tt2.right = leftchild.fourth;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tx3.tempKey = x3.leftKey;\\r\\n\\t\\t\\t\\t\\t\\tx3.tempVal = x3.leftVal;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tx3.leftKey = leftchild.tempKey;\\r\\n\\t\\t\\t\\t\\t\\tx3.leftVal = leftchild.tempVal;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tx3.left=t1;\\r\\n\\t\\t\\t\\t\\t\\tx3.fourth=x3.right;\\r\\n\\t\\t\\t\\t\\t\\tx3.right=x3.mid;\\r\\n\\t\\t\\t\\t\\t\\tx3.mid=t2;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t//make this node a 4-node\\r\\n\\t\\t\\t\\t\\t\\tx3.isFourNode=true;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t//if input key greater than right key of node x, insert node on right\\r\\n\\t\\t\\telse if (key > x3.rightKey)\\r\\n\\t\\t\\t\\t//make temporary 4 node\\r\\n\\t\\t\\t\\tif(x3.right == null)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tx3.isFourNode = true;\\r\\n\\t\\t\\t\\t\\tx3.tempKey = x3.rightKey;\\r\\n\\t\\t\\t\\t\\tx3.tempVal=x3.rightVal;\\r\\n\\r\\n\\t\\t\\t\\t\\tx3.rightKey = key;\\r\\n\\t\\t\\t\\t\\tx3.rightVal = val;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//recursively call put method\\r\\n\\t\\t\\t\\t\\tx3.right = put(x3.right, key, val);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//if right child is 4-node, then split the child node into two child 2nodes and \\r\\n\\t\\t\\t\\t\\t//insert the middle key of the former 4-node into this node as rightmost key making this a 4-node\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif(x3.right.isFourNode && x3.right instanceof ThreeNode)\\r\\n\\t\\t\\t\\t\\t{\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tThreeNode rightchild = (ThreeNode)(x3.right);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t//new third child\\r\\n\\t\\t\\t\\t\\t\\tTwoNode t1 = new TwoNode(rightchild.leftKey,rightchild.leftVal);\\r\\n\\t\\t\\t\\t\\t\\tt1.left = rightchild.left;\\r\\n\\t\\t\\t\\t\\t\\tt1.right = rightchild.mid;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t//new fourth child\\r\\n\\t\\t\\t\\t\\t\\tTwoNode t2 = new TwoNode(rightchild.rightKey,rightchild.rightVal);\\r\\n\\t\\t\\t\\t\\t\\tt2.left = rightchild.right;\\r\\n\\t\\t\\t\\t\\t\\tt2.right = rightchild.fourth;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tx3.tempKey = x3.rightKey;\\r\\n\\t\\t\\t\\t\\t\\tx3.tempVal = x3.rightVal;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tx3.rightKey = rightchild.tempKey;\\r\\n\\t\\t\\t\\t\\t\\tx3.rightVal = rightchild.tempVal;\\t\\t\\t\\t\\t\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tx3.fourth=t2;\\r\\n\\t\\t\\t\\t\\t\\tx3.right=t1;\\t\\t\\t\\t\\t\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t//make this node a 4-node\\r\\n\\t\\t\\t\\t\\t\\tx3.isFourNode=true;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t//if input key greater than left key of node x and lesser than right key of node x,\\r\\n\\t\\t\\t//insert node on right\\r\\n\\t\\t\\telse if (key > x3.leftKey && key < x3.rightKey)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t//if no mid child exists\\r\\n\\t\\t\\t\\tif(x3.mid == null)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//make this node a temporary 4 node\\r\\n\\t\\t\\t\\t\\tx3.isFourNode = true;\\r\\n\\t\\t\\t\\t\\tx3.tempKey = key;\\r\\n\\t\\t\\t\\t\\tx3.tempVal = val;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//recursively call put method\\r\\n\\t\\t\\t\\t\\tx3.mid=put(x3.mid,key, val);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//if mid child is 4-node, then split the child node into two child 2nodes and \\r\\n\\t\\t\\t\\t\\t//insert the middle key of the former 4-node into this node as mid key making this a 4-node\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif(x3.mid.isFourNode && x3.mid instanceof ThreeNode)\\r\\n\\t\\t\\t\\t\\t{\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tThreeNode midchild = (ThreeNode)(x3.mid);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t//new second child\\r\\n\\t\\t\\t\\t\\t\\tTwoNode t1 = new TwoNode(midchild.leftKey,midchild.leftVal);\\r\\n\\t\\t\\t\\t\\t\\tt1.left = midchild.left;\\r\\n\\t\\t\\t\\t\\t\\tt1.right = midchild.mid;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t//new third child\\r\\n\\t\\t\\t\\t\\t\\tTwoNode t2 = new TwoNode(midchild.rightKey,midchild.rightVal);\\r\\n\\t\\t\\t\\t\\t\\tt2.left = midchild.right;\\r\\n\\t\\t\\t\\t\\t\\tt2.right = midchild.fourth;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tx3.tempKey = midchild.tempKey;\\r\\n\\t\\t\\t\\t\\t\\tx3.tempVal = midchild.tempVal;\\t\\t\\t\\t\\t\\t\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tx3.fourth=x3.right;\\r\\n\\t\\t\\t\\t\\t\\tx3.right=t2;\\r\\n\\t\\t\\t\\t\\t\\tx3.mid=t1;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//make this node a 4-node\\r\\n\\t\\t\\t\\t\\t\\tx3.isFourNode=true;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t//if equal, set value of node to input value\\r\\n\\t\\t\\telse if (key == x3.leftKey)\\r\\n\\t\\t\\t\\tx3.leftVal = val;\\r\\n\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t\\tx3.rightVal = val;\\r\\n\\r\\n\\t\\t\\treturn x3;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t//if current node is a 2-node\\r\\n\\t\\telse\\r\\n\\t\\t{\\r\\n\\t\\t\\tTwoNode x2 = (TwoNode)x;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//if key to be inserted is less than current node\\r\\n\\t\\t\\tif (key < x2.key)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t//check if no children\\r\\n\\t\\t\\t\\tif(x2.left == null)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//make three node\\r\\n\\t\\t\\t\\t\\tThreeNode temp3node = new ThreeNode(key, val, x2.key, x2.val);\\r\\n\\t\\t\\t\\t\\treturn temp3node;\\r\\n\\t\\t\\t\\t}\\t\\t\\t\\r\\n\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//recursively call put method\\r\\n\\t\\t\\t\\t\\tx2.left = put(x2.left, key, val);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//if left child is 4-node, then split the child node into two child 2nodes and \\r\\n\\t\\t\\t\\t\\t//insert the middle key of the former 4-node into this node as left key, making it a 3-node\\r\\n\\t\\t\\t\\t\\tif(x2.left.isFourNode && x2.left instanceof ThreeNode)\\r\\n\\t\\t\\t\\t\\t{\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tThreeNode leftchild = (ThreeNode)(x2.left);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t//make three node\\r\\n\\t\\t\\t\\t\\t\\tThreeNode temp3node = new ThreeNode(leftchild.tempKey, leftchild.tempVal, x2.key, x2.val);\\r\\n\\t\\t\\t\\t\\t\\tTwoNode t1 = new TwoNode(leftchild.leftKey,leftchild.leftVal);\\r\\n\\t\\t\\t\\t\\t\\tt1.left = leftchild.left;\\r\\n\\t\\t\\t\\t\\t\\tt1.right = leftchild.mid;\\r\\n\\t\\t\\t\\t\\t\\ttemp3node.left = t1;\\r\\n\\t\\t\\t\\t\\t\\tTwoNode t2 = new TwoNode(leftchild.rightKey,leftchild.rightVal);\\r\\n\\t\\t\\t\\t\\t\\tt2.left = leftchild.right;\\r\\n\\t\\t\\t\\t\\t\\tt2.right = leftchild.fourth;\\r\\n\\t\\t\\t\\t\\t\\ttemp3node.mid =\\tt2;\\r\\n\\t\\t\\t\\t\\t\\ttemp3node.right = x2.right;\\r\\n\\t\\t\\t\\t\\t\\treturn temp3node;\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t//if input key greater than key of node x, insert node on right\\r\\n\\t\\t\\telse if (key > x2.key)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t//check if no children\\r\\n\\t\\t\\t\\tif(x2.right == null)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//make three node\\r\\n\\t\\t\\t\\t\\tThreeNode temp3node = new ThreeNode(x2.key, x2.val, key, val);\\r\\n\\t\\t\\t\\t\\treturn temp3node;\\r\\n\\t\\t\\t\\t}\\t\\t\\t\\r\\n\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//recursively call put method\\r\\n\\t\\t\\t\\t\\tx2.right = put(x2.right, key, val);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//if right child is 4-node, then split the child node into two child 2nodes and \\r\\n\\t\\t\\t\\t\\t//insert the middle key of the former 4-node into this node as right key, making it a 3-node\\r\\n\\t\\t\\t\\t\\tif(x2.right.isFourNode && x2.right instanceof ThreeNode)\\r\\n\\t\\t\\t\\t\\t{\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tThreeNode rightchild = (ThreeNode)(x2.right);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t//make three node\\r\\n\\t\\t\\t\\t\\t\\tThreeNode temp3node = new ThreeNode(x2.key, x2.val, rightchild.tempKey, rightchild.tempVal);\\r\\n\\t\\t\\t\\t\\t\\ttemp3node.left=x2.left;\\r\\n\\t\\t\\t\\t\\t\\tTwoNode t1 = new TwoNode(rightchild.leftKey,rightchild.leftVal);\\r\\n\\t\\t\\t\\t\\t\\tt1.left = rightchild.left;\\r\\n\\t\\t\\t\\t\\t\\tt1.right = rightchild.mid;\\r\\n\\t\\t\\t\\t\\t\\ttemp3node.mid = t1;\\r\\n\\t\\t\\t\\t\\t\\tTwoNode t2 = new TwoNode(rightchild.rightKey,rightchild.rightVal);\\r\\n\\t\\t\\t\\t\\t\\tt2.left = rightchild.right;\\r\\n\\t\\t\\t\\t\\t\\tt2.right = rightchild.fourth;\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\ttemp3node.right = t2;\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\treturn temp3node;\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t//if equal, set value of node to input value\\r\\n\\t\\t\\telse \\r\\n\\t\\t\\t\\tx2.val = val;\\r\\n\\t\\t\\treturn x2;\\r\\n\\t\\t}\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65d015e0ecf77a190cf821213253d992\",\n \"score\": \"0.5625714\",\n \"text\": \"public Node(K key, V value) {\\r\\n\\t\\t\\tkeys = new LinkedList<K>();\\r\\n\\t\\t\\tkeys.add(key);\\r\\n\\t\\t\\tvalues = new LinkedList<V>();\\r\\n\\t\\t\\tvalues.add(value);\\r\\n\\t\\t\\tchildren = new LinkedList<Node>();\\r\\n\\t\\t\\tchildren.add(null);\\r\\n\\t\\t\\tchildren.add(null);\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"df7a4b5c39b8501c3d21e63219178c6f\",\n \"score\": \"0.56199723\",\n \"text\": \"public void insertAtRear(String val){\\n\\t\\tNode<String> node = new Node<String>(val,null);\\n\\t\\tsize++;\\n\\t\\tif(rear == null){\\n\\t\\t\\trear = node;\\n\\t\\t\\tfront = rear;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\trear.setLink(node);\\n\\t\\t\\trear = node;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a840ceeb50b6d69ba1d3493fc91e4801\",\n \"score\": \"0.56040984\",\n \"text\": \"private void addIt(K key, E elem) {\\r\\n\\t\\tBsNode<K, E> newNode = new BsNode<K, E>(key, elem);\\r\\n\\t\\tBsNode<K, E> node = this.rootNode;\\r\\n\\t\\tif (node == null) {\\r\\n\\t\\t\\tthis.rootNode = newNode;\\r\\n\\t\\t} else {\\r\\n\\t\\t\\twhile (true) {\\r\\n\\t\\t\\t\\tint cmp = key.compareTo(node.getKey());\\r\\n\\t\\t\\t\\tif (cmp > 0) {\\r\\n\\t\\t\\t\\t\\tif (node.rightNode == null) {\\r\\n\\t\\t\\t\\t\\t\\tnode.rightNode = newNode;\\r\\n\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\tnode = node.rightNode;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t} else if (cmp < 0) {\\r\\n\\t\\t\\t\\t\\tif (node.leftNode == null) {\\r\\n\\t\\t\\t\\t\\t\\tnode.leftNode = newNode;\\r\\n\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\tnode = node.leftNode;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t// throw new Exception(\\\"key already exists\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5aec94bde5e37e1ca5e79ddb1c231bdd\",\n \"score\": \"0.55956054\",\n \"text\": \"public synchronized void put(Object key, Object node) {\\r\\n List target = (List) allNodes.get(key);\\r\\n List content = null;\\r\\n if (target == null) {\\r\\n target = root;\\r\\n allNodes.put(key, root);\\r\\n root.add(key);\\r\\n content = new ArrayList();\\r\\n root.add(content);\\r\\n }\\r\\n parents.put(node, key);\\r\\n if (content == null) {\\r\\n content = getChildrenCollection(key, target);\\r\\n }\\r\\n moveKeyToExtension(node, content);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"56438e17c187ffd63698150e5ce9e339\",\n \"score\": \"0.55898315\",\n \"text\": \"public void put(Key key, Value value) {\\n if(key == null) throw new IllegalArgumentException(\\\"first argument to put() is null\\\");\\n if(value == null) {\\n delete(key);\\n return;\\n }\\n\\n // walk the linked list\\n for(Node x = root; x != null; x = x.next) {\\n // if found key return value\\n if(x.key.equals(key)) {\\n x.value = value;\\n return;\\n }\\n }\\n\\n root = new Node(key, value, root);\\n n++;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"698a45be392b529ed805abc8d6e92ffa\",\n \"score\": \"0.55803514\",\n \"text\": \"public void put(int key, int value) {\\n int index = hashFunction(key);\\n ListNode previous = findElement(index, key);\\n \\n if(previous.next==null){\\n previous.next=new ListNode(key,value);\\n }else{\\n previous.next.value=value;\\n } \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"561a5525508bea44a6ad0f4e8db2c58d\",\n \"score\": \"0.5564871\",\n \"text\": \"public void addWord(String word) {\\n Trie currentRoot = root;\\n for (char c: word.toCharArray()){\\n if (currentRoot.children.get(c)==null){\\n currentRoot.children.put(c, new Trie(c));\\n }\\n currentRoot = currentRoot.children.get(c);\\n }\\n currentRoot.finish=true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aaea705ba9a648ffe03d14174fab1a28\",\n \"score\": \"0.55615574\",\n \"text\": \"public void addBeginning(String value){\\n\\t\\tNode newNode = new Node();\\n\\t\\tnewNode.setStringValue(value);\\n\\t\\tnewNode.setParent(null);\\n\\t\\t\\n\\t\\tif(isEmpty()){\\n\\t\\t\\tnewNode.setChild(null);\\n\\t\\t\\thead = newNode;\\n\\t\\t\\tfoot = newNode;\\n\\t\\t}else{\\n\\t\\t\\tnewNode.setChild(head);\\n\\t\\t\\thead.setParent(newNode);\\n\\t\\t\\thead = newNode;\\n\\t\\t}\\n\\t\\tlength++;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a287c15053d3210f0550a2b9355636b7\",\n \"score\": \"0.5554656\",\n \"text\": \"public void add(V newNode) {\\n // Verificando si ya se encuentra en el dic, el valor ingresado\\n if (relations.containsKey(newNode)) return;\\n relations.put(newNode, new Node<V>(newNode, index));\\n keys.add(newNode);\\n index++;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dcc034a998e734b357f9dd3ac055661c\",\n \"score\": \"0.5551584\",\n \"text\": \"static WorkSpace doInsert(String key, int value, Node p, int h) {\\n\\r\\n if (h == 0) {\\r\\n \\r\\n // we're at the leaf level, so compare and \\r\\n // either update value or insert new leaf\\r\\n\\r\\n LeafNode leaf = (LeafNode) p; //downcast\\r\\n int cmp = key.compareTo(leaf.guide);\\r\\n\\r\\n if (cmp == 0) {\\r\\n leaf.value = value; \\r\\n return null;\\r\\n }\\r\\n\\r\\n // create new leaf node and insert into tree\\r\\n LeafNode newLeaf = new LeafNode();\\r\\n newLeaf.guide = key; \\r\\n newLeaf.value = value;\\r\\n\\r\\n int offset = (cmp < 0) ? 0 : 1;\\r\\n // offset == 0 => newLeaf inserted as left sibling\\r\\n // offset == 1 => newLeaf inserted as right sibling\\r\\n\\r\\n WorkSpace ws = new WorkSpace();\\r\\n ws.newNode = newLeaf;\\r\\n ws.offset = offset;\\r\\n ws.scratch = new Node[4];\\r\\n\\r\\n return ws;\\r\\n }\\r\\n \\r\\n else {\\r\\n InternalNode q = (InternalNode) p; // downcast\\r\\n int pos;\\r\\n WorkSpace ws;\\r\\n\\r\\n if (key.compareTo(q.child0.guide) <= 0) {\\r\\n pos = 0; \\r\\n ws = doInsert(key, value, q.child0, h-1);\\r\\n }\\r\\n else if (key.compareTo(q.child1.guide) <= 0 || q.child2 == null) {\\r\\n pos = 1;\\r\\n ws = doInsert(key, value, q.child1, h-1);\\r\\n }\\r\\n else {\\r\\n pos = 2; \\r\\n ws = doInsert(key, value, q.child2, h-1);\\r\\n }\\r\\n\\r\\n if (ws != null) {\\r\\n if (ws.newNode != null) {\\r\\n // make ws.newNode child # pos + ws.offset of q\\r\\n\\r\\n int sz = copyOutChildren(q, ws.scratch);\\r\\n insertNode(ws.scratch, ws.newNode, sz, pos + ws.offset);\\r\\n if (sz == 2) {\\r\\n ws.newNode = null;\\r\\n ws.guideChanged = resetChildren(q, ws.scratch, 0, 3);\\r\\n }\\r\\n else {\\r\\n ws.newNode = new InternalNode();\\r\\n ws.offset = 1;\\r\\n resetChildren(q, ws.scratch, 0, 2);\\r\\n resetChildren((InternalNode) ws.newNode, ws.scratch, 2, 2);\\r\\n }\\r\\n }\\r\\n else if (ws.guideChanged) {\\r\\n ws.guideChanged = resetGuide(q);\\r\\n }\\r\\n }\\r\\n return ws;\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a52f34244d0d6bab549fbed16e03c36\",\n \"score\": \"0.55498767\",\n \"text\": \"private AVLnode<K,V> TreeInsert(K key,V value, AVLnode<K,V> treeRoot){\\n if (treeRoot.element()!=null){\\n //System.out.println(\\\"First insertNode is root: \\\"+treeRoot.element().key()+\\\" \\\"+treeRoot.element().value());\\n } else{\\n //System.out.println(\\\"First insertNode is empty root\\\");\\n }\\n AVLnode<K,V> insertNode=treeRoot; // Define node insertNode, which will take on the identity of consecutive nodes as we search down the tree for the position at which to insert our node. Initialize to root.\\n while (!external(insertNode)){ // While we have not yet reached an external node...\\n //System.out.println(\\\"Insertnode is not external\\\");\\n int comparison=comparator.compare(insertNode.getEntry().key(),key); // ...compare key of entry at node with input key.\\n //System.out.println(\\\"Comparison: \\\"+comparison);\\n if (comparison==0){ // If key of entry at insertNode is equal to input...\\n insertNode=insertNode.left(); // ...continue search at left child.\\n } else if (comparison>0){ // If key of entry at insertNode is greater than input key...\\n insertNode=insertNode.left(); // ...continue search at left child.\\n } else{ // If key of entry at insertNode is less than input key...\\n insertNode=insertNode.right(); // ...continue search at right child.\\n }\\n }\\n //System.out.println(\\\"InsertNode is external\\\");\\n // At this point, insertNode points at external node where entry with key and value should be inserted.\\n // Set properties of new entry at this node.\\n insertNode.setEntry(new DictEntry<K,V>(key, value)); // Where this node previously contained no entry because it was external, now set entry to include key and value.\\n //System.out.println(\\\"Setting entry to \\\"+key+\\\" \\\"+value);\\n insertNode.setLeft(new AVLnode<K,V>(null, insertNode, null, null)); // Create external left child for node.\\n //System.out.println(\\\"Setting left to leaf with parent \\\"+insertNode.element().key()+\\\" \\\"+insertNode.element().value());\\n insertNode.setRight(new AVLnode<K,V>(null, insertNode, null, null)); // Create external right child for node.\\n //System.out.println(\\\"Setting right to leaf with parent \\\"+insertNode.element().key()+\\\" \\\"+insertNode.element().value());\\n if ((insertNode.parent()!=null)&&(insertNode.element().key().equals(\\\"OPT\\\"))){\\n //System.out.println(\\\"node \\\"+key+\\\" \\\"+value+\\\" has parent: \\\"+insertNode.parent().element().key());\\n }\\n if (insertNode.left().element()!=null){\\n //System.out.println(\\\"node \\\"+key+\\\" \\\"+value+\\\" has left: \\\"+insertNode.left().element().key());\\n }\\n if (insertNode.right().element()!=null){\\n //System.out.println(\\\"node \\\"+key+\\\" \\\"+value+\\\" has right: \\\"+insertNode.right().element().key());\\n }\\n // Update properties of tree.\\n numEntries++; // Added one entry at (previously) external node.\\n \\n numNodes+=2; // Added two external nodes (children of insertNode).\\n //System.out.println(\\\"numEntries=\\\"+numEntries+\\\" numNodes=\\\"+numNodes);\\n //System.out.println(\\\"Returning the node with \\\"+insertNode.element().key()+\\\" \\\"+insertNode.element().value());\\n return insertNode;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eceea682445d01c2cf0adf7e362ada69\",\n \"score\": \"0.55478394\",\n \"text\": \"private BNode<Key, Value> put(BNode<Key, Value> x, Key key, Value value) {\\t\\t\\r\\n\\t\\tif (x == null) {\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\treturn new BNode<Key, Value>(key, value);\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tint cmp = key.compareTo(x.key);\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\tif (cmp < 0) {\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\tx.left = put(x.left, key, value);\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t} else if (cmp > 0) {\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\tx.right = put(x.right, key, value);\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t} else {\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\tx.value = value;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tx.size = 1 + size(x.left) + size(x.right);\\t\\t\\t\\t\\t\\t\\r\\n\\t\\treturn x;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8c8fdc8abb8be3c3d409fe196badc70\",\n \"score\": \"0.55454826\",\n \"text\": \"public void increaseKey(Node node, int value) {\\n if(node == null) {\\n System.out.println(\\\"increaseKey called, but node is null\\\");\\n return;\\n }\\n Node parent = node.parent;\\n //System.out.println(\\\"increaseKey called on \\\" + node.hashTag + \\\" Value = \\\" + value);\\n if(node.parent == null) { /* If node is a root node, increase the key directly, change max if required */\\n node.count += value;\\n if(node != max && node.count > max.count)\\n max = node;\\n }\\n else {\\n if((value != -1) && (node.count + value <= node.parent.count)) { /* If increased value is less than parent's value, directly increase, nothing else to do */\\n node.count += value;\\n }\\n else {\\n if(node.parent.degree == 1) { /* If parent has 1 child, set child to null since this child is to be cut from the tree */\\n node.parent.child = null;\\n }\\n else if(node.parent.degree > 1) {\\n /* Remove node from its sibling list */\\n node.left_sibling.right_sibling = node.right_sibling; \\n node.right_sibling.left_sibling = node.left_sibling;\\n \\n /* Reset parent's child object if required */\\n if(node.parent.child == node)\\n node.parent.child = node.right_sibling; //Set child node to the right sibling of the original one\\n }\\n else {\\n System.out.println(\\\"Inside increaseKey ... Parent's degree information error\\\");\\n return;\\n }\\n node.parent.degree = node.parent.degree - 1; /* Parent's degree decreased by 1 */\\n \\n node.left_sibling = null;\\n node.right_sibling = null;\\n node.parent = null;\\n node.childCut = false;\\n \\n /* -1 is a special value used by modifyChildCut to forcefully cut nodes from tree whose childCut is already true */\\n if(value != -1)\\n node.count += value; /* We dont want to change values of nodes that are cut from the tree due to childChut = true */\\n topLevelMerge(node); /* add Node as a root node to the heap */\\n modifyChildCut(parent); /* Recursively check childCut values of parent nodes, and cut the parent nodes from the tree if required */\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77405b223fb9b9689c5da155e3e07ef1\",\n \"score\": \"0.5539756\",\n \"text\": \"public void addWord(String word) {\\n char[] wordArray=word.toCharArray();\\n head=root;\\n for(char ch:wordArray){\\n if(head.map.containsKey(ch)){\\n head=head.map.get(ch);\\n }\\n else{\\n \\t\\tTrieNode tmp=new TrieNode(ch);\\n \\t\\thead.map.put(ch,tmp);\\n \\t\\thead=tmp;\\n }\\n }\\n head.isLeaf=true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b85adc70f110087f6538544a57d9f6c\",\n \"score\": \"0.5529799\",\n \"text\": \"void put(String word) {\\n Node cur = root;\\n\\n for (int i = 0;i<word.length();i++) {\\n int idx = word.charAt(i) - 'a';\\n\\n if (cur.arr[idx] == null) {\\n // create new outdegree for 'd' for example\\n cur.arr[idx] = new Node();\\n }\\n cur = cur.arr[idx];\\n if (i == word.length()-1) cur.keyend = true;\\n\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d8dac1e8e38b19b1849c3678366a9d1\",\n \"score\": \"0.5526217\",\n \"text\": \"public TrieNode insertTrieNode(TrieNode root, String s)\\n {\\n TrieNode temp = root;\\n for (int i = 0; i < s.length(); i++)\\n {\\n char ch = s.charAt(i);\\n if (temp.getChildren().get(ch) == null)\\n {\\n temp.getChildren().put(ch, new TrieNode(s.substring(0,i+1)));\\n }\\n temp = temp.getChildren().get(ch);\\n }\\n temp.setKey(s);\\n temp.setCount(temp.getCount() + 1);\\n return root;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c20f8ef389608ff485fa3ec8aa31cc0d\",\n \"score\": \"0.5522007\",\n \"text\": \"private boolean add(Node root, String word, int offset){\\n if(offset==word.length()) return false;\\n int c = word.charAt(offset);\\n\\n //Search for the node to add the word to\\n Node last = null, next = root.firstChild;\\n while(next!=null){\\n //No match found, keep traversing the trie\\n if(next.value<c){\\n last = next;\\n next = next.nextSibling;\\n }\\n //match found - add remaining word to this node\\n else if(next.value == c){\\n return add(next, word, offset+1);\\n }\\n else{\\n break;\\n }\\n }\\n //No match found for this char, create a new node and insert\\n Node node = new Node(c);\\n if(last == null){\\n //Insert node at the beginning of the list - works for next == null;\\n root.firstChild = node;\\n node.nextSibling = next;\\n }\\n else{\\n //inserting between last and next\\n last.nextSibling = node;\\n node.nextSibling = next;\\n }\\n\\n //Add remaining letters\\n for(int i = offset+1; i<word.length();i++){\\n node.firstChild = new Node(word.charAt(i));\\n node = node.firstChild;\\n }\\n return true;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b0862d224691e250c91c51244b59cb3\",\n \"score\": \"0.55166596\",\n \"text\": \"private void rollingAdd() {\\n // start with hash to add\\n final ImmutableNode startNode = getCurrentNode();\\n final long oldDescendantCount = getStructuralNode().getDescendantCount();\\n final long descendantCount = oldDescendantCount == 0 ? 1 : oldDescendantCount + 1;\\n BigInteger hashToAdd = startNode.getHash() == null || BigInteger.ZERO.equals(startNode.getHash())\\n ? startNode.computeHash()\\n : startNode.getHash();\\n BigInteger newHash;\\n BigInteger possibleOldHash = BigInteger.ZERO;\\n\\n if (startNode.getKind() == NodeKind.STRING_VALUE || startNode.getKind() == NodeKind.OBJECT_STRING_VALUE\\n || startNode.getKind() == NodeKind.BOOLEAN_VALUE || startNode.getKind() == NodeKind.OBJECT_BOOLEAN_VALUE\\n || startNode.getKind() == NodeKind.NUMBER_VALUE || startNode.getKind() == NodeKind.OBJECT_NUMBER_VALUE\\n || startNode.getKind() == NodeKind.NULL_VALUE || startNode.getKind() == NodeKind.OBJECT_NULL_VALUE) {\\n nodeReadOnlyTrx.moveTo(startNode.getParentKey());\\n }\\n\\n // go the path to the root\\n do {\\n final Node node = pageTrx.prepareRecordForModification(getCurrentNode().getNodeKey(), IndexType.DOCUMENT, -1);\\n if (node.getNodeKey() == startNode.getNodeKey()) {\\n // first, take the hashcode of the node only\\n newHash = hashToAdd;\\n } else if (node.getNodeKey() == startNode.getParentKey()) {\\n // at the parent level, just add the node\\n possibleOldHash = node.getHash();\\n newHash = Node.to128BitsAtMaximumBigInteger(possibleOldHash.add(hashToAdd.multiply(PRIME)));\\n hashToAdd = newHash;\\n setAddDescendants(startNode, node, descendantCount);\\n } else {\\n // at the rest, remove the existing old key for this element\\n // and add the new one\\n newHash = Node.to128BitsAtMaximumBigInteger(node.getHash().subtract(possibleOldHash.multiply(PRIME)));\\n newHash = Node.to128BitsAtMaximumBigInteger(newHash.add(hashToAdd.multiply(PRIME)));\\n hashToAdd = newHash;\\n possibleOldHash = node.getHash();\\n setAddDescendants(startNode, node, descendantCount);\\n }\\n node.setHash(newHash);\\n } while (nodeReadOnlyTrx.moveTo(getCurrentNode().getParentKey()).hasMoved());\\n setCurrentNode(startNode);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da512baedbe00eb15b59ac523db67d80\",\n \"score\": \"0.5516546\",\n \"text\": \"void setWortelNode(Node<Key> root);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dcb4e0ad16cd609097d08054b02ba77d\",\n \"score\": \"0.5509412\",\n \"text\": \"public void put(int value) { //插入一个结点到二叉树\\n Node newNode = new Node(value); //用当前值构建一个结点\\n if (root == null)\\n root = newNode;//如果根节点为null,表示第一次插入，将改结点赋值给根结点\\n else {\\n //This will return the soon to be parent of the value you're inserting\\n Node parent = find(value); //查找要插入的结点，如果要插入的结点不存在，则返回父结点的位置\\n\\n //This if/else assigns the new node to be either the left or right child of the parent\\n if (value < parent.data) {//如果当前结点的值小于parent结点的值,\\n parent.left = newNode; //将其赋值给parent的左结点\\n parent.left.parent = parent; //设置插入子节点的父结点为parent\\n return;\\n } else {//如果要插入的结点的值大于（或等于）parent的值\\n parent.right = newNode; //将其赋值给parent的右结点\\n parent.right.parent = parent; //设置插入子节点的父结点为parent\\n return;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c930544389252d381f1adccfab59f33\",\n \"score\": \"0.5503634\",\n \"text\": \"public void insert(String key, int val) {\\n int delta = val;\\n if (wordSum.containsKey(key)) {\\n delta = val - wordSum.get(key);\\n }\\n wordSum.put(key, val);\\n Trie node = root;\\n for (Character ch : key.toCharArray()) {\\n node = node.childs.computeIfAbsent(ch, x -> new Trie());\\n node.score += delta;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c617a7429ce767e92aa8ee323ca6afa\",\n \"score\": \"0.5501631\",\n \"text\": \"public void insert (String word) {\\n String s, key;\\n TNode t;\\n //concatenate #\\n word = word.concat(\\\"#\\\");\\n //create a hash-table of all children of root node currently on the trie\\n HashMap<String, TNode> children;\\n\\n for (int i = word.length()-1; i >= 0; i--) {\\n s = word.substring(i);\\n //always start adding from root\\n children = root.children;\\n\\n //this should run only when s = '#'\\n if (s.length()==1) {\\n if (!children.containsKey(s)) {\\n t = new TNode(s);\\n children.put(s,t);\\n } //else do nothing (should never be the case anyway)\\n } else {\\n for (int x = 0; x < s.length(); x++) {\\n key = s.substring(0,x+1);\\n if (children.containsKey(key)) {\\n t = children.get(key);\\n } else {\\n t = new TNode(key);\\n children.put(key, t);\\n }\\n children = t.children;\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95efd6e2ee08b6ac8c7bcb86a77a82f4\",\n \"score\": \"0.54964566\",\n \"text\": \"public void put(int key, int value) {\\n int index = key % hash;\\n ListNode ls = table[index];\\n while(ls.next != null){\\n ls = ls.next;\\n if(ls.key == key){\\n ls.value = value;\\n return;\\n }\\n }\\n ListNode n = new ListNode(key,value);\\n n.next = table[index].next;\\n n.prev = table[index];\\n if(table[index].next != null) table[index].next.prev = n;\\n table[index].next = n;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9ad96bf1b69b81b00eb02245e46148b\",\n \"score\": \"0.54869\",\n \"text\": \"public void add(T value){\\n root = addRecursive(value, root);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6239476f96fb6491f94ee3215cfcb00\",\n \"score\": \"0.5483689\",\n \"text\": \"public void put(int key, int value) {\\n \\t\\tif(node[key%size]==null) {\\n \\t\\t\\tnode[key%size]=new Node(key,value);\\n \\t\\t}else {\\n \\t\\t\\tcurrentNode=node[key%size];\\n \\t\\t\\twhile(currentNode.nextNode!=null && currentNode.key!=key) {\\n \\t\\t\\t\\tcurrentNode=currentNode.nextNode;\\n \\t\\t\\t}\\n \\t\\t\\tif(currentNode.key==key)\\n \\t\\t\\t\\tcurrentNode.value=value;\\n \\t\\t\\telse\\n \\t\\t\\tcurrentNode.nextNode=new Node(key,value);\\n \\t\\t}\\n \\t\\t\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"321376e077640d5285dcda6c855d6c3a\",\n \"score\": \"0.5481026\",\n \"text\": \"public void add(Pair elm)\\n {\\n Map current = this;\\n Map nw = new Map();\\n \\n while(current.next !=null && elm.Key.toInt() >= current.element.Key.toInt())\\n {\\n current = current.next;\\n }\\n \\n \\n nw.element = current.element; //Save current.element first before overwriting current\\n current.element = elm; //set current.element to the new element\\n nw.next = current.next;// connect the new sequence part to the sequence part after current\\n current.next = nw; // connect current to the nw.\\n \\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5573f887bb5c59688d4485a843ed318a\",\n \"score\": \"0.54743385\",\n \"text\": \"public void insert(String key) {\\n\\n if (numelements == size) {\\n //TODO: need to expand the hash table and rehash its contents. \\n size *= 2;\\n int key_;\\n for (int times = 0; times != size; times++)\\n {\\n for (StringNode cursor = table[times]; cursor != null; cursor = cursor.getNext())\\n {\\n key_ = hash(key);\\n table[key_] = new StringNode(key, table[key_]); \\n }\\n\\n }\\n }\\n int lol = hash(key);\\n table[lol] = new StringNode(key, table[lol]);\\n //TODO: Code for actual insert.\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"72d4a67b5049c748ffc15a2c4e4dfbb5\",\n \"score\": \"0.54726213\",\n \"text\": \"public TrieNode(String word) {\\n children = new ArrayList<TrieNode>();\\n value = word;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c730ab2c4d8f9246740665362ed40166\",\n \"score\": \"0.54679674\",\n \"text\": \"private BsNode<K, E> addRec(BsNode<K, E> node, K key, E elem) {\\r\\n\\t\\tif (node == null) {\\r\\n\\t\\t\\treturn new BsNode<K, E>(key, elem);\\r\\n\\t\\t} else {\\r\\n\\t\\t\\tint cmp = key.compareTo(node.getKey());\\r\\n\\t\\t\\tif (cmp > 0) {\\r\\n\\t\\t\\t\\tnode.rightNode = addRec(node.rightNode, key, elem);\\r\\n\\t\\t\\t} else if (cmp < 0) {\\r\\n\\t\\t\\t\\tnode.leftNode = addRec(node.leftNode, key, elem);\\r\\n\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t// throw new Exception(\\\"key already exists\\\");\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\treturn node;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"865bf642f7524b288235cbe76c56ee41\",\n \"score\": \"0.5458286\",\n \"text\": \"public void addChild(Node child) {\\n this.children.add(child);\\n this.keys.sort(Comparator.comparingInt(Integer::valueOf));\\n numKey++;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"83350a19844a44896056077101476f3c\",\n \"score\": \"0.54546994\",\n \"text\": \"public TrieNode(){\\r\\n currentVal = null;\\r\\n for(int i=0;i<26;i++)\\r\\n nextNode[i] = null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31c736b7febebf08c2845c10e1206399\",\n \"score\": \"0.54486525\",\n \"text\": \"private void postorderAdd() {\\n // start with hash to add\\n final ImmutableNode startNode = getCurrentNode();\\n // long for adapting the hash of the parent\\n BigInteger hashCodeForParent = BigInteger.ZERO;\\n // adapting the parent if the current node is no structural one.\\n if (!(startNode instanceof StructNode)) {\\n final Node node = pageTrx.prepareRecordForModification(getCurrentNode().getNodeKey(), IndexType.DOCUMENT, -1);\\n node.setHash(getCurrentNode().computeHash());\\n nodeReadOnlyTrx.moveTo(getCurrentNode().getParentKey());\\n }\\n // Cursor to root\\n StructNode cursorToRoot;\\n do {\\n cursorToRoot = pageTrx.prepareRecordForModification(getCurrentNode().getNodeKey(), IndexType.DOCUMENT, -1);\\n hashCodeForParent = getCurrentNode().computeHash().add(hashCodeForParent.multiply(PRIME));\\n // Caring about attributes and namespaces if node is an element.\\n if (cursorToRoot.getKind() == NodeKind.ELEMENT) {\\n final ElementNode currentElement = (ElementNode) cursorToRoot;\\n // setting the attributes and namespaces\\n final int attCount = ((ElementNode) cursorToRoot).getAttributeCount();\\n for (int i = 0; i < attCount; i++) {\\n nodeReadOnlyTrx.moveTo(currentElement.getAttributeKey(i));\\n hashCodeForParent = getCurrentNode().computeHash().add(hashCodeForParent.multiply(PRIME));\\n }\\n final int nspCount = ((ElementNode) cursorToRoot).getNamespaceCount();\\n for (int i = 0; i < nspCount; i++) {\\n nodeReadOnlyTrx.moveTo(currentElement.getNamespaceKey(i));\\n hashCodeForParent = getCurrentNode().computeHash().add(hashCodeForParent.multiply(PRIME));\\n }\\n nodeReadOnlyTrx.moveTo(cursorToRoot.getNodeKey());\\n }\\n\\n // Caring about the children of a node\\n if (nodeReadOnlyTrx.moveTo(getStructuralNode().getFirstChildKey()).hasMoved()) {\\n do {\\n hashCodeForParent = getCurrentNode().getHash().add(hashCodeForParent.multiply(PRIME));\\n } while (nodeReadOnlyTrx.moveTo(getStructuralNode().getRightSiblingKey()).hasMoved());\\n nodeReadOnlyTrx.moveTo(getStructuralNode().getParentKey());\\n }\\n\\n // setting hash and resetting hash\\n cursorToRoot.setHash(hashCodeForParent);\\n hashCodeForParent = BigInteger.ZERO;\\n } while (nodeReadOnlyTrx.moveTo(cursorToRoot.getParentKey()).hasMoved());\\n\\n setCurrentNode(startNode);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f2d3261d51bc4a413462e6ba70e774a\",\n \"score\": \"0.5447254\",\n \"text\": \"public void add (Key key, Value value);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da829456364ab3b7748ecad548810054\",\n \"score\": \"0.5445417\",\n \"text\": \"public void addChild(String value, TreeNode node) {\\n children.put(value, node);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1f0f67cc43bdeefac7f81680044776c\",\n \"score\": \"0.5442292\",\n \"text\": \"public Node(K aKey, V aValue) {\\n\\t\\t\\tkey = aKey;\\n\\t\\t\\tvalue = aValue;\\n\\t\\t\\tchild = null;\\n\\t\\t\\tparent = null;\\n\\t\\t\\tprev = null;\\n\\t\\t\\tnext = null;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8a7b4411aac736b2b2d78edf96ae709\",\n \"score\": \"0.54364824\",\n \"text\": \"@Override\\n public OverflowNode insert(int key) {\\n AbstractBTreeNode curNode = this;\\n Stack<AbstractBTreeNode> parents = new Stack<AbstractBTreeNode>();\\n ArrayList<Integer> keys;\\n ArrayList<AbstractBTreeNode> children;\\n\\n while (true) { //find leaf on wich to insert and create stack containing parents\\n int i;\\n for (i = 0; i < curNode.getKeys().size(); i++) {\\n if (curNode.getKeys().get(i) > key) {\\n break;\\n }\\n }\\n\\n if(curNode.getChildren().size() == 0){\\n break;\\n }\\n if (i >= curNode.getChildren().size()) {\\n break;\\n //return parents;\\n } else {\\n parents.push(curNode);\\n curNode = curNode.getChildren().get(i);\\n continue;\\n }\\n }\\n\\n curNode.getKeys().add(key);\\n curNode.getKeys().sort(Comparator.naturalOrder());\\n\\n if(curNode.getKeys().size() <= curNode.getDegree() * 2 ){ //no need to split\\n return null;\\n }\\n\\n OverflowNode ovfl = curNode.split();\\n OverflowNode ovflBAK = ovfl; //copy just to make sure\\n\\n while (true){\\n if(ovfl == null){\\n break;\\n }\\n if(parents.size() == 0){\\n //TODO\\n //root changes...\\n AbstractBTreeNode newRoot = new BTreeNode(curNode.getDegree(), curNode.get_bTree());\\n\\n newRoot.addKey(ovfl.getKey());\\n newRoot.addChild(curNode);\\n newRoot.addChild(ovfl.getRightChild());\\n\\n curNode.get_bTree().setRoot(newRoot);\\n\\n break;\\n }\\n curNode = parents.peek();\\n parents.pop();\\n\\n key = ovfl.getKey();\\n AbstractBTreeNode ovflRight = ovfl.getRightChild();\\n\\n curNode.getKeys().add(key);\\n curNode.getKeys().sort(Comparator.naturalOrder());\\n int index = curNode.getKeys().indexOf(key);\\n curNode.getChildren().add(index+1, ovflRight);\\n\\n if(curNode.getKeys().size() > curNode.getDegree() * 2){\\n ovfl = curNode.split();\\n continue;\\n }else{\\n break;\\n }\\n }\\n return ovflBAK;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e362b88b91211c71e0ae31a92f321e2b\",\n \"score\": \"0.54237944\",\n \"text\": \"private static void insertChildren(HeapNode st, FibonacciHeap assistent) {\\r\\n HeapNode tmp =assistent.insert(st.getKey());\\r\\n tmp.setOriginal(st);\\r\\n HeapNode tmp2=st.getNext();\\r\\n while(tmp2!=st) {\\r\\n \\ttmp=assistent.insert(tmp2.getKey());\\r\\n tmp.setOriginal(tmp2);\\r\\n tmp2=tmp2.getNext();\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3c39632996183c5e96b022e75f16604\",\n \"score\": \"0.5401413\",\n \"text\": \"public void putItem(Object key, Object value) {\\n\\t\\thash = Math.abs(key.hashCode() % 500);\\n\\t\\tNode entry = new Node(key, value);\\n\\n\\t\\tif (list[hash] == null) {\\n\\t\\t\\tlist[hash] = entry;\\n\\t\\t} else {\\n\\t\\t\\tNode current = list[hash];\\n\\t\\t\\twhile (current.getNext() != null) {\\n\\t\\t\\t\\tcurrent = current.getNext();\\n\\t\\t\\t}\\n\\t\\t\\tcurrent.setNext(entry);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e469cdd2d3f30d036cb9c89f2e27d47\",\n \"score\": \"0.54011303\",\n \"text\": \"public void set(Object key, Object value) {\\n growArray();\\n if (!has(key)) {\\n this.items[size] = new Node(key, value);\\n this.size++;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c974daf71a8ddbe4692c2bd63699c84\",\n \"score\": \"0.5391353\",\n \"text\": \"private Node put(Node current, Key key, Value val) {\\n if(current == null) {\\n return new Node(key, val);\\n }\\n int result = key.compareTo(current.key);\\n if(result < 0) {\\n current.left = put(current.left, key, val);\\n }\\n else if(result > 0) {\\n current.right = put(current.right, key, val);\\n }\\n else { //result == 0\\n current.val = val;\\n }\\n current.count = 1 + size(current.left) + size(current.right);\\n return current;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"babd4e914cd9ba7ab2968d77d77bf45b\",\n \"score\": \"0.53890216\",\n \"text\": \"public void addWord(String word) {\\n\\t\\tTrieNode iter = root;\\n\\t\\tfor (int i =0 ; i < word.length(); i++) {\\n\\t\\t\\tchar cand = word.charAt(i);\\n\\t\\t\\tif (!iter.children.containsKey(cand)) {\\n\\t\\t\\t\\titer.children.put(cand, new TrieNode());\\n\\t\\t\\t}\\n\\t\\t\\titer = iter.children.get(cand);\\n\\t\\t}\\n\\t\\titer.isEnd = true;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f76bf49235d718953ce1557709138c80\",\n \"score\": \"0.5381916\",\n \"text\": \"public void put(int key, int value) {\\n\\t\\tint i = index(key);\\n\\t\\tif (nodes[i] == null) {\\n\\t\\t\\t// add a fake head\\n\\t\\t\\tnodes[i] = new ListNode(-1, -1);\\n\\t\\t}\\n\\t\\tListNode prev = findPrev(nodes[i], key);\\n\\t\\tif (prev.next != null) {\\n\\t\\t\\t// prev.next (node) not null = we have this key\\n\\t\\t\\tprev.next.val = value;\\n\\t\\t} else {\\n\\t\\t\\tprev.next = new ListNode(key, value);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"62574bfef5c971b9b6f864ad2e045d35\",\n \"score\": \"0.5381875\",\n \"text\": \"private Node putHelper(K key, V value, Node p) {\\n if (key == null) {\\n throw new IllegalArgumentException(\\\"A null key for put()!\\\");\\n }\\n if (value == null) {\\n throw new IllegalArgumentException(\\\"A null value for put()!\\\");\\n }\\n if (p == null) {\\n size += 1;\\n return new Node(key, value);\\n }\\n int cmp = key.compareTo(p.key);\\n if (cmp < 0) {\\n p.left = putHelper(key, value, p.left);\\n } else if (cmp > 0) {\\n p.right = putHelper(key, value, p.right);\\n } else {\\n p.value = value;\\n }\\n return p;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26b5a81fed5238a2154e6b0a596ae1e4\",\n \"score\": \"0.5380553\",\n \"text\": \"void insert(int key) {\\n java.util.Queue<Node> q = new java.util.LinkedList<Node>();\\n Node temp = root;\\n q.add(temp);\\n\\n while (!q.isEmpty()) {\\n temp = q.peek();\\n q.remove();\\n\\n if (temp.left == null) {\\n temp.left = new Node(key);\\n break;\\n } else {\\n q.add(temp.left);\\n }\\n\\n if (temp.right == null) {\\n temp.right = new Node(key);\\n break;\\n } else {\\n q.add(temp.right);\\n }\\n\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"641a3ac51da956e8d4417e846cda74b7\",\n \"score\": \"0.53646314\",\n \"text\": \"public TrieNode()\\n {\\n child = new HashMap<Character,TrieNode>();\\n\\n // Initialize all the Trie nodes with NULL\\n for (char i = 'a'; i <= 'z'; i++) // nice way of going through all the letters of alphabet, since the letters are ordered ASCII characters\\n child.put(i, null);\\n\\n isLast = false;\\n childSize = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c9777d228abe7201b81562a7fcefd0e\",\n \"score\": \"0.5356004\",\n \"text\": \"void link()\\n {\\n if(y<map.length-1) children.add(map[y + 1][x]);\\n //if(y<map.length-1 && x>0) children.add(map[y + 1][x - 1]);\\n if(x<map[y].length-1) children.add(map[y][x + 1]);\\n if(x>0) children.add(map[y][x - 1]);\\n //if(y>0 && x<map[y].length-1) children.add(map[y - 1][x + 1]);\\n if(y>0) children.add(map[y - 1][x]);\\n //if(y>0 && x>0) children.add(map[y - 1][x - 1]);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bfd805cb51b05afec88a0fc3158b50b4\",\n \"score\": \"0.5354961\",\n \"text\": \"public BSTNode(K key, V value) {\\n\\t\\tthis.key = key;\\n\\t\\tthis.value = value;\\n\\t\\tthis.left = null;\\n\\t\\tthis.right = null;\\n\\t\\tthis.parent = null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f11120251d24e7a4ef3107e77facd62c\",\n \"score\": \"0.5346972\",\n \"text\": \"private void increaseKey(Node node, int value)\\n {\\n node.tag.setCount(value);\\n //save the parent\\n Node parent = node.parent;\\n //check if the new key is greater than the parent and parent is not null\\n if ((parent != null) && (node.tag.getCount() > parent.tag.getCount())) {\\n //if it is greater than cut the child, and perfrom cascade cut on the parent\\n cutChildFromParent(node, parent);\\n cascadingCut(parent);\\n }\\n //check if the increased key is greater than the max.\\n if (node.tag.getCount() > max.tag.getCount()) {\\n //if it is greater than the max then update the key\\n max = node;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36814df7ca51b180eef959d64b790d41\",\n \"score\": \"0.53454965\",\n \"text\": \"@Override\\n public Uri insert(Uri uri, ContentValues values) {\\n Log.e(TAG, \\\"MAIN INSERT: inside insert method\\\");\\n // We need to insert on proper place in ring\\n String key = values.getAsString(\\\"key\\\");\\n String value = values.getAsString(\\\"value\\\");\\n Log.e(TAG, \\\"MAIN INSERT: Called for key:value = \\\" + key + \\\"::\\\" + value);\\n if(currentNode.successor == null && currentNode.predecessor == null){\\n Log.e(TAG,\\\"Single Node up case\\\");\\n storeContent(key,value);\\n return uri;\\n }\\n try {\\n String keyHash = genHash(key);\\n Log.e(TAG, \\\"INSERT: KeyHash ::\\\" + keyHash + \\\" for key: \\\" + key);\\n if(currentNode.id.compareTo(currentNode.predecessor.id) < 0 && keyHash.compareTo(currentNode.id) > 0 &&\\n keyHash.compareTo(currentNode.predecessor.id)>0){\\n Log.e(TAG, \\\"KeyHash is greater than largest Key so insert in Lowest Key Node [here]\\\");\\n storeContent(key,value);\\n }\\n else if(currentNode.id.compareTo(currentNode.predecessor.id) < 0 && keyHash.compareTo(currentNode.id) < 0){\\n Log.e(TAG, \\\"KeyHash is less than smallest Key so insert in Lowest Key Node [here]\\\");\\n storeContent(key,value);\\n }\\n else if(keyHash.compareTo(currentNode.id) < 0 && keyHash.compareTo(currentNode.predecessor.id) > 0){\\n Log.e(TAG, \\\"KeyHash is less than current Node id and Greater than previous\\\");\\n storeContent(key, value);\\n }\\n else /*if(keyHash.compareTo(currentNode.id) > 0)*/{\\n Log.e(TAG, \\\"KeyHash: \\\" + keyHash + \\\" is greater than current Node id \\\" + currentNode.id);\\n // send the data to next node.\\n String sucPort = currentNode.successor.port;\\n String dataMessage = INSERT_DATA + DELIMETER + key + DELIMETER + value + DELIMETER + sucPort;\\n\\n new ClientTask().executeOnExecutor(AsyncTask.SERIAL_EXECUTOR, INSERT_DATA, myPort, dataMessage, sucPort);\\n\\n }\\n /*else{\\n Log.e(TAG,\\\"InsertMethod: No place found for this Message Key: \\\" + key\\n + \\\" Value: \\\" + value);\\n }*/\\n } catch (NoSuchAlgorithmException e) {\\n Log.e(TAG, \\\"NoSuchAlgorithmException keyHash Insert\\\");\\n }\\n\\n\\n return uri;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a2b29aed8e1b14a723f824d4d87e543\",\n \"score\": \"0.53413564\",\n \"text\": \"public void put(String key, String value){\\n HashNode head = bucket.get(getHash(key));\\n if( head == null){\\n bucket.set(getHash(key), new HashNode(key, value));\\n }else{\\n while(head != null){\\n if(head.key == key){\\n head.value = value;\\n return;\\n }\\n head = head.next;\\n }\\n HashNode node = new HashNode(key, value);\\n node.next = bucket.get(getHash(key));\\n bucket.set(getHash(key),node);\\n }\\n\\n ++entries;\\n if( (entries*1.0 / size) >= LOAD_THRESHOLD){\\n // Increase #bucket\\n ArrayList<HashNode> temp = bucket;\\n bucket = new ArrayList<HashNode>();\\n size*=2;\\n for(int i = 0; i < size; i++){\\n bucket.add(null);\\n }\\n // Rehash each item in table\\n for(HashNode headNode : temp){\\n while(headNode != null){\\n put(headNode.key, headNode.value);\\n headNode = headNode.next;\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"88a35d7ad5b631a655cd2ad0ab3ec72b\",\n \"score\": \"0.5339904\",\n \"text\": \"public void add(String s) {\\n\\t\\tTrieNode current = root;\\n\\t\\tfor (int i = 0; i < s.length(); i++) {\\n\\t\\t\\tboolean isEnd = (i == s.length() - 1);\\n\\t\\t\\tchar c = s.charAt(i);\\n\\t\\t\\tint index = c - 'a';\\n\\t\\t\\tif (current.getChild(index) != null) {\\n\\t\\t\\t\\tcurrent = current.getChild(index);\\n\\t\\t\\t\\tif (isEnd && !current.isEnd()){\\n\\t\\t\\t\\t\\tcurrent.setEnd(true);\\n\\t\\t\\t\\t\\t//size++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tcurrent.setChild(index, new TrieNode(c, isEnd));\\n\\t\\t\\t\\t//if (isEnd){\\n\\t\\t\\t\\t//\\tsize++;\\n\\t\\t\\t\\t//}\\n\\t\\t\\t\\tcurrent = current.getChild(index);\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t\\tsize++;\\n\\t\\t//System.err.println(size());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0edc319185fc87818767c2232bf1fb63\",\n \"score\": \"0.53362215\",\n \"text\": \"private void add(Node node, V value) {\\n if(node.getValue().compareTo(value) < 0) {\\n if(node.getRightChild() == null) {\\n node.setRightChild(new Node(value));\\n } else {\\n add(node.getRightChild(), value);\\n }\\n }\\n // Value less than node value\\n else if(node.getValue().compareTo(value) > 0) {\\n if(node.getLeftChild() == null) {\\n node.setLeftChild(new Node(value));\\n } else {\\n add(node.getLeftChild(), value);\\n }\\n }\\n // Value equals node value\\n else {\\n throw new IllegalArgumentException(\\\"Value already exists in tree\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"307d134faa882d792e013154ec82a6a6\",\n \"score\": \"0.5331263\",\n \"text\": \"public void add(Item key) {\\r\\n\\t\\tput(key);\\r\\n\\t\\tbubbleUp(last(root));\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a3d1e6867b7fec531954770f383d5d0\",\n \"score\": \"0.5317359\",\n \"text\": \"private Node<T> addRecursive(T value, Node<T> n){\\n if(n == null){\\n return new Node<T>(value, null, null);\\n }\\n\\n int comparison = value.compareTo(n.value);\\n\\n if(comparison < 0){\\n n.left = addRecursive(value, n.left);\\n } else if(comparison > 0){\\n n.right = addRecursive(value, n.right);\\n } else {\\n // node is duplicate, do nothing.\\n }\\n return n;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1ff4dfff4527492c6ef0588d5c1dd7bb\",\n \"score\": \"0.53152496\",\n \"text\": \"public void insert(K key, V value) {\\n\\t\\t\\tItem<K, V> curr = new Item<K, V>(key, value);\\n\\t\\t\\tcurr.next = this.head;\\n\\t\\t\\tcurr.key = key;\\n\\t\\t\\tcurr.value = value;\\n\\t\\t\\tthis.head = curr;\\n\\t\\t\\tthis.length++;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"89d3ade574c863d21448b9b2926375aa\",\n \"score\": \"0.5314146\",\n \"text\": \"static int addBT(Node root) \\n{ \\n if (root == null) \\n return 0; \\n return (root.key + addBT(root.left) + \\n addBT(root.right)); \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27a67a4ca4691bd962a6e5c7cce78d20\",\n \"score\": \"0.5313648\",\n \"text\": \"Node insertRec(T val, Node node, List<Node> path) {\\n if (node == null) {\\n Node newNode = new Node(val);\\n path.add(newNode);\\n return newNode;\\n }\\n\\n int comp = val.compareTo(node.val);\\n if (comp < 0) {\\n node.left = insertRec(val, node.left, path);\\n path.add(node);\\n } else if (comp > 0) {\\n node.right = insertRec(val, node.right, path);\\n path.add(node);\\n } else {\\n // Already exists in the set\\n path.add(null);\\n }\\n\\n return node;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3136b4e61ec01b066d4ecfca973a1573\",\n \"score\": \"0.5312753\",\n \"text\": \"public void put(int key, int value) {\\n int hash = key % prime;\\n Node node = table[hash];\\n while (node.next != null) {\\n if (node.next.key == key) {\\n node.next.val = value;\\n return;\\n }\\n node = node.next;\\n }\\n node.next = new Node(key, value, null);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ddfa9e3db5112de80dd9f172c5ca1164\",\n \"score\": \"0.53026855\",\n \"text\": \"public void insert(Record<T> record) \\n {\\n for (T kword : record.Keywords) {\\n // Initializing the new nodes fields.\\n Node<T> temp_n = new Node<T>();\\n Node<T> des = null;\\n temp_n.records.insert(record);\\n temp_n.keyword = kword;\\n if (this.root != null) { \\n // Continuing...\\n }\\n else {\\n this.root = temp_n;\\n // Returning updated node.\\n return;\\n }\\n // Looping through node\\n for (Node<T> temp_r = this.root; temp_r != null;) {\\n des = temp_r;\\n // Checking if node exists.\\n if (temp_r.keyword.compareTo(kword) == 0) {\\n // Inserting the record into the node.\\n temp_r.records.insert(record);\\n // Returning updated node.\\n return;\\n }\\n if (kword.compareTo(temp_r.keyword) > 0) {\\n // Putting right node.\\n temp_r = temp_r.right;\\n }\\n else {\\n // Putting left node.\\n temp_r = temp_r.left;\\n }\\n }\\n if (kword.compareTo(des.keyword) > 0) {\\n des.right = temp_n;\\n }\\n else {\\n des.left = temp_n;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"721fd21fb9e877de4742fe36df778621\",\n \"score\": \"0.5301421\",\n \"text\": \"private void put(int key, int val)\\r\\n\\t{\\r\\n\\t\\tif(root == null)\\r\\n\\t\\t\\troot = new TwoNode(key, val);\\r\\n\\t\\telse\\r\\n\\t\\t{\\r\\n\\t\\t\\t//recursively call put function\\r\\n\\t\\t\\troot = this.put(root, key, val);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//after inserting key-val, if root is a four node, then split the root \\r\\n\\t\\t\\t//into one parent 2-node and two child 2-nodes\\r\\n\\t\\t\\tif(root.isFourNode && root instanceof ThreeNode)\\r\\n\\t\\t\\t{\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tThreeNode oldroot = (ThreeNode)(root);\\t\\t\\t\\r\\n\\t\\t\\t\\tTwoNode newRoot = new TwoNode(oldroot.tempKey,oldroot.tempVal);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t//new left 2-node child\\r\\n\\t\\t\\t\\tTwoNode leftChild = new TwoNode(oldroot.leftKey,oldroot.leftVal);\\r\\n\\t\\t\\t\\tleftChild.left = oldroot.left;\\r\\n\\t\\t\\t\\tleftChild.right = oldroot.mid;\\r\\n\\r\\n\\t\\t\\t\\t//new right 2-node child\\r\\n\\t\\t\\t\\tTwoNode rightChild = new TwoNode(oldroot.rightKey,oldroot.rightVal);\\r\\n\\t\\t\\t\\trightChild.left = oldroot.right;\\r\\n\\t\\t\\t\\trightChild.right = oldroot.fourth;\\r\\n\\t\\t\\t\\tnewRoot.left=leftChild;\\r\\n\\t\\t\\t\\tnewRoot.right=rightChild;\\r\\n\\r\\n\\t\\t\\t\\troot = newRoot;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52456eb5a7d8ca4426e67a1b51e387f1\",\n \"score\": \"0.5297631\",\n \"text\": \"public void insert(String word) {\\n TrieNode node = root;\\n for(char c : word.toCharArray()){\\n if(node.children[c - 'a'] == null){\\n node.children[c - 'a'] = new TrieNode();\\n }\\n node = node.children[c - 'a'];\\n }\\n node.isEnd = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d242c6d7b2eb9c370b596932325795fb\",\n \"score\": \"0.52949893\",\n \"text\": \"public void insert(D data, V value)\\n {\\n if(root == null)\\n root = new MultiKeyNode<>(data, value);\\n else\\n insert(data, value, root);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0a689c2033ab9f6ac3e79bba21f0b35\",\n \"score\": \"0.5294787\",\n \"text\": \"@Override\\n public void insert(Key key, Value value) throws IllegalNullKeyException, DuplicateKeyException {\\n if (key == null) {\\n throw new IllegalNullKeyException();\\n }\\n // Inserts new node according to standard binary search tree algorithm\\n insertHelper(this.root, null, key, value);\\n try {\\n // Rebalances tree to preserve Red-Black Tree properties\\n fixInsert(findNodeHelper(this.root, key));\\n } catch (Exception e) {\\n System.out.println(e.getMessage());\\n }\\n ++this.numKeys;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3a3ab74bd6b481b253b79defc41a0b2\",\n \"score\": \"0.5292586\",\n \"text\": \"public void insert(int key)\\n {\\n if(root == null) {\\n root = new Node(key);\\n return ;\\n }\\n Queue<Node> q = new LinkedList<Node>();\\n q.add(root);\\n while(!q.isEmpty()) {\\n Node temp = q.poll();\\n if(temp.left == null) {\\n temp.left = new Node(key);\\n break;\\n }\\n else\\n q.add(temp.left);\\n if(temp.right == null) {\\n temp.right = new Node(key);\\n break;\\n }\\n else\\n q.add(temp.right);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4c3a2d2ba832f931840458f3bc1e47f\",\n \"score\": \"0.52906215\",\n \"text\": \"public void add(String key, Item value) {\\r\\n\\t\\tint hashVal = hash(key);\\r\\n\\r\\n\\t\\t// Find proper bucket to insert the value.\\r\\n\\t\\twhile ((table[hashVal]) != null)\\r\\n\\t\\t\\thashVal = serchNextBucket(hashVal);\\r\\n\\r\\n\\t\\ttable[hashVal] = value;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e045c9bc3a13857d79f52f8b28db143\",\n \"score\": \"0.52886355\",\n \"text\": \"public void addMovie(String movieKey, String year){\\n Node newMovie = new Node(movieKey, year);\\n \\n //if our root is null just add the newMovie as the root\\n if (root == null){\\n \\n root = newMovie;\\n }\\n \\n else{\\n \\n //node we use to traverse our tree\\n Node traverseNode = root;\\n \\n //will use this further down\\n Node parent;\\n \\n while(true){\\n \\n //parebt gets assigned to traverseNode or essenitally our root\\n parent = traverseNode;\\n \\n \\n //if the movie key entered when compared with our traverseNode turns out to be less than 0 (meaning the movie key comes before our traverseNode's movie key alphabetically\\n //we then know to be checking the left side of the tree\\n if(movieKey.compareToIgnoreCase(traverseNode.movieKey)<0){\\n \\n //now we are looking at the left child \\n traverseNode = traverseNode.leftChild;\\n \\n //if there is no left child \\n if (traverseNode == null){\\n \\n //we set parents (which points to where traverseNode points) equal to the new Node\\n parent.leftChild = newMovie;\\n return;\\n }\\n }\\n \\n //if we get here it means the moviekey is going on the right side of the tree \\n else{\\n \\n //looking at the right child now\\n traverseNode = traverseNode.rightChild;\\n \\n //if its null\\n if (traverseNode == null){\\n \\n //we set parents right child equal to the new node\\n parent.rightChild = newMovie;\\n return;\\n }\\n \\n }\\n \\n \\n }\\n \\n \\n \\n }\\n \\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":9854,"numItemsPerPage":100,"numTotalItems":995064,"offset":985400,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTQwNTAyNiwic3ViIjoiL2RhdGFzZXRzL250aGFrdXIvY29ybnN0YWNrLWphdmEtdjEtdGV2YXRyb24tMU0iLCJleHAiOjE3Nzk0MDg2MjYsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.vmkJovR5Ec3ONWlW1sal-t3y_L4cTgKZk-YU0hIQF_cikq_VCHtXAjiHhFIW5KZTQ62Bq27gjoUieHssDHf-Dw","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 |
|---|---|---|---|
7ee5c21ddfb58f00ad39ebeadec70b5e | Checks if is empty. | [
{
"docid": "5c83e3f0acb884e6f9754e6e29640fc1",
"score": "0.0",
"text": "public static boolean isEmpty(String str) {\r\n return ( str == null || str.length() == 0 );\r\n }",
"title": ""
}
] | [
{
"docid": "19985e9038495ffcb17d4d39f8b0863e",
"score": "0.83497775",
"text": "@Override\n\tpublic boolean isEmpty() {\n\t\treturn (size == 0);\n\t}",
"title": ""
},
{
"docid": "19985e9038495ffcb17d4d39f8b0863e",
"score": "0.83497775",
"text": "@Override\n\tpublic boolean isEmpty() {... |
01a3f1d099a451f81e05292d738780d3 | This adds a property descriptor for the Value feature. | [
{
"docid": "971581f7e99fd6ce19b929314c305aa1",
"score": "0.7063662",
"text": "protected void addValuePropertyDescriptor(Object object) {\n\t\titemPropertyDescriptors.add\n\t\t\t(createItemPropertyDescriptor\n\t\t\t\t(((ComposeableAdapterFactory)adapterFactory).getRootAdapterFactory(),\n\t\t\t\t getResou... | [
{
"docid": "7bd527ffb38d8e6047985144a5249084",
"score": "0.65438926",
"text": "public DoubleProperty valueProperty() { return valueProperty; }",
"title": ""
},
{
"docid": "2b324ade657faeaec5774378d7bb5416",
"score": "0.6374567",
"text": "public void addProperty(String name, String va... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "0a5a8b1993e503ce2bc30cb279c6a720",
"score": "0.0",
"text": "@Override\r\n\tpublic Iterator<Recipe> recipeIterator() {\n\t\tthrow new NotImplementedException();\r\n\t}",
"title": ""
}
] | [
{
"docid": "ef1b6c3f597a66c59960d73eadee6f25",
"score": "0.6904447",
"text": "private void apparence()\n\t\t{\n\n\t\t}",
"title": ""
},
{
"docid": "4862518dedb9e169c3cc620e5ebe04c5",
"score": "0.6696056",
"text": "@Override\r\n\tpublic void atura() {\n\t\t\r\n\t}",
"title": ""
... |
7d905d2a5a1cea77df8072556c0ad395 | The method setPlayerGameEnd is called if the species owned by a player is extinct. It removes the player from the game and delete its current species | [
{
"docid": "eaccd8d48b36b1610287c4e8983280c9",
"score": "0.81589574",
"text": "private void setPlayerGameEnd(Player thePlayer) {\n\t\tremovePlayer(thePlayer);\n\t\tthePlayer.deleteCurrentSpecies();\n\t}",
"title": ""
}
] | [
{
"docid": "4be42fbbceb7cb4c298ac8bf28861db3",
"score": "0.66509646",
"text": "public void endGame(Game game) {\n games.remove(game);\n }",
"title": ""
},
{
"docid": "d412a84a726dac56491e80bd7257f7b8",
"score": "0.6603485",
"text": "public void endGame() {\n endGame(... |
be6eca631fad4efeb85c88f9ed9184e4 | Append an array of Characters | [
{
"docid": "16e90bd6f4ce4b2370d91d38607fc3d2",
"score": "0.7140176",
"text": "public void append(final Character[] newChars) {\n append(newChars, 0, newChars.length);\n }",
"title": ""
}
] | [
{
"docid": "e01ffac0d5a4f924f55761191ee52d59",
"score": "0.7229967",
"text": "public int addChars(char[] c, int offset, int len) {\n return 0;\r\n }",
"title": ""
},
{
"docid": "9eab380be813d82dff862e77564118f3",
"score": "0.70303637",
"text": "public void append(final char[] ... |
2c6b1e56b4f858fca0961297bc28ba2e | Toast.makeText(this, "Item clicked at position " + position, Toast.LENGTH_SHORT).show(); | [
{
"docid": "8a17076514d8988e0a2a451e717bcaf9",
"score": "0.0",
"text": "@Override\n public void userData(int position) {\n UserModel data = userModelList.get(position);\n Intent intent = new Intent(this,UserProfileActivity.class);\n intent.putExtra(Constants.USER_DATA, Parcels.wr... | [
{
"docid": "b8ea4576fd7e9b29dfd03d8af25d2a49",
"score": "0.87084883",
"text": "@Override\n public void onItemClick(View view, int position) {\n Toast.makeText(MainActivity.this, position + \" click\",\n Toast.LENGTH_SHORT).show();\n }",
"ti... |
e1afff4ebe64ab3abf6903a5daf8b15d | could possibly add some logic here to handle different activities depending on HouseRep availability? | [
{
"docid": "6a972b931a7dfe6d6c1ffdd417596025",
"score": "0.0",
"text": "public void sendCivicInfo(String url){\n RequestQueue queue = Volley.newRequestQueue(this);\n Intent intent = new Intent(MainActivity.this, CongressionalActivity.class); //All 3 are applicable from here\n Intent... | [
{
"docid": "4e1b84e7b68f75f0705058696633fbe7",
"score": "0.5604677",
"text": "private void doWiperAvailabiltiyCheck()\n {\n // Hardcode for now to make sure WPS is not triggered\n bWiperAvailable = true;\n\n mWifi = (WifiManager)getSystemService(mContext.WIFI_SER... |
4909eea8f3a1c6949d72c8eafc4aafae | Adds a new make | [
{
"docid": "17680b2a67f0b0c3b63ee7cb932a799c",
"score": "0.77489895",
"text": "void addMake(String make);",
"title": ""
}
] | [
{
"docid": "461a4e48ba2b85f7a08f67fee8fbf9a8",
"score": "0.60498357",
"text": "public void addRecipe(){\n\n Recipe recipe = new Recipe(recipeName, culture, ingredients, instructions);\n\n MainActivity.writeNewRecipe(recipeName, recipe);\n\n this.recreate();\n\n }",
"title": "... |
55b4008141b601f38fa18029d610df8b | This method releases an object. Returns a default time to sleep (2s) | [
{
"docid": "59af87bb4b5604ac4006478138d1c53a",
"score": "0.66276205",
"text": "public static int releaseObject() {\n\t\tclaw.setAcceleration(200);\n\t\tclaw.setSpeed(150);\n\t\tclaw.rotateTo(-55, true);\n\t\treturn 2000;\n\t}",
"title": ""
}
] | [
{
"docid": "80f09173a9855f843b3fcff0f0c65dd2",
"score": "0.62279564",
"text": "public synchronized void release(){\n\t\tpermits++;\n\t\n\t\tthis.notify();//wakes the FIRST thread that put to sleep.\n\t\t\n\t}",
"title": ""
},
{
"docid": "975a189a52ce7580f3c83df5b8052db2",
"score": "0.581... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "97df2c3d4e23a9e2921d8389707c4481",
"score": "0.0",
"text": "public static void main(String[] args) {\n\r\n\t\tEmployee empl = new Employee();\r\n\t\templ.setInfo (\"Kovalenko\", \"Ostap\");\r\n\t\r\n\t\tSystem.out.println(empl.getInfo());\r\n\t}",
"title": ""
}
] | [
{
"docid": "05a606445504484958a1c21e14b7198e",
"score": "0.69474965",
"text": "@Override\r\n\tpublic void sapace() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "8619203d4867f5c6d05eb9a5354405c0",
"score": "0.6920049",
"text": "@Override\n\t\tpublic void pintate() {\n\t\t\t\n\t\t}",
... |
89b066c45fa5ecb6453448df6b0bd491 | Find the index of the last element that less than or equals the given element, via loop method. | [
{
"docid": "01696e14ebf4732f90fb753009d6f05b",
"score": "0.78808993",
"text": "public int binarySearchLastLessEqualsLoop(final Comparable ele) {\n if (this.size > 3) {\n if (get(this.size - 1).compareTo(ele) <= 0) {\n return this.size - 1;\n } else {\n if (get(0).compareTo(ele... | [
{
"docid": "dc527e923fe33b377b70ff809c167f2d",
"score": "0.69979733",
"text": "public int indexOfLast(Object element)\n {\n //initialize values\n ListIterator listIterator = listIterator();\n int index = 0;\n int lIndex = -1;\n\n while(listIterator.hasNext())\n ... |
e9433b6867839b7c95de0d9fbfb41886 | Returns an object containing the promotion discount | [
{
"docid": "b44fd988d051e7a04cbe6e954d287e2c",
"score": "0.59612995",
"text": "public PromotionResult getPromotionResult(Product product, Promotion promotion)\r\n throws Exception\r\n {\r\n return null;\r\n }",
"title": ""
}
] | [
{
"docid": "5f537eeaf5b27d807cbdf656230c4590",
"score": "0.7272265",
"text": "public VODiscount getDiscount() {\n return discount;\n }",
"title": ""
},
{
"docid": "cc707f2e4f40f2645b43eea910da7bf9",
"score": "0.7201696",
"text": "public BigDecimal getDiscount() {\n retur... |
b67f4f73a8eb98260ef5091132dd9b07 | Test of setCierre method, of class Restoran. | [
{
"docid": "2c8b817697d8f0f22a0485e82c78f802",
"score": "0.7677053",
"text": "@Test\r\n public void testSetCierre() {\r\n System.out.println(\"setCierre\");\r\n int cierre = 0;\r\n rest.setCierre(cierre);\r\n // TODO review the generated test code and remove the default ca... | [
{
"docid": "1e6a58f8009679ff664fdcfcebe42da4",
"score": "0.67688084",
"text": "public void test_22_AccesCercleCirconscrit()\n\t{\n\t\tUnTriangle t=new UnTriangle(new UnPoint(100,0), new UnPoint(0, 100), new UnPoint());\n\t\tUnCercle co=new UnCercle(t);\n\t\tassertEquals(\"le centre doit etre non null\",... |
f66b37e987b06b355e89c45b3e0f88c6 | Returns the last event in the ordered set where idRoute = &63;. | [
{
"docid": "73e1459fc4d864d0734f01d3249f360e",
"score": "0.7851983",
"text": "public es.eina.tfg.model.Event fetchByrouteId_Last(long idRoute,\n com.liferay.portal.kernel.util.OrderByComparator orderByComparator)\n throws com.liferay.portal.kernel.exception.SystemException;",
"title": ... | [
{
"docid": "5bc18ff56059706e6b2c2372d90c0ab9",
"score": "0.7627442",
"text": "public es.eina.tfg.model.Event findByrouteId_Last(long idRoute,\n com.liferay.portal.kernel.util.OrderByComparator orderByComparator)\n throws com.liferay.portal.kernel.exception.SystemException,\n es.... |
e570d239d5eddc4e3d4b1ec0afcc434c | ~ Methods ~ Methods Returns the k shortest simple paths in increasing order of weight. | [
{
"docid": "de33db42eb3f7f241ea0ba61b4e74cef",
"score": "0.5299792",
"text": "public List<GraphPath<V, E>> getPaths(V endVertex) {\n\t\tassertGetPaths(endVertex);\n\n\t\tKShortestPathsIterator<V, E> iter = new KShortestPathsIterator<V, E>(\n\t\t\t\tthis.graph, this.startVertex, endVertex, this.nPaths);\... | [
{
"docid": "05a706629db96517c5bb9aec3d4780f9",
"score": "0.7467739",
"text": "public KShortestPaths(Graph<V, E> graph, V startVertex, int k) {\n\t\tthis(graph, startVertex, k, graph.vertexSet().size() - 1);\n\t}",
"title": ""
},
{
"docid": "35eeebdb179fa21e0d321c04715ced7f",
"score": "0.... |
7d90756f89a869fa3737b4b2ccda90d2 | Execute the Rest Client Request | [
{
"docid": "075b24b82dd34f690577b1bec14eb672",
"score": "0.5904179",
"text": "private void executeRequest(HttpUriRequest request, String url)\n\t{\n\n\t\t//PARAMS\n\t\tHttpParams httpParams = request.getParams();\n\t\tHttpProtocolParams.setContentCharset(httpParams, HTTP.UTF_8);\n\t\tHttpProtocolParams.... | [
{
"docid": "180da2c985351e948a70e4c7e2adfd5b",
"score": "0.6577681",
"text": "private void callRestEndpoint() throws IOException {\n\t\t URL url = new URL(\"this the rest URL\");\n\t\t String values = \"the values for the service\";\n\n\t\t //make connection\n\t\t URL... |
4c16260928d760408b71634a17702c77 | Instantiates a new Kv dto. | [
{
"docid": "9b517ecb8693a236926acbe1d5abfb81",
"score": "0.6798501",
"text": "public KvDto(K key, V value) {\n\t\tthis.key = key;\n\t\tthis.value = value;\n\t}",
"title": ""
}
] | [
{
"docid": "db8d35254d70a0f172533234af9fb740",
"score": "0.8288782",
"text": "public KvDto() {\n\t}",
"title": ""
},
{
"docid": "beb0dab0221b2f1de9cccafefec3743f",
"score": "0.6101666",
"text": "public KeyValue() {}",
"title": ""
},
{
"docid": "cd564549f822e3f724ec3922571... |
cff72cb7d0e946c88915a1aa64ed9148 | public static EndpointConfig defaultConfigNoParser = defaultConfig(JsonWriter.cheapJson); | [
{
"docid": "1272a1c0ab7f07dd340a9edb5a2eb881",
"score": "0.7195045",
"text": "public static <J> EndpointConfig<J> defaultConfig(JsonParserAndWriter<J> parserAndWriter) {\n return new EndpointConfig<J>(Files.getText(\"header.js\"), parserAndWriter, \"http://\", JavascriptDetailsToString.simple, IM... | [
{
"docid": "d6dfb86cccb301218801853a6812ab8f",
"score": "0.7122773",
"text": "Endpoint getDefaultEndpoint();",
"title": ""
},
{
"docid": "9d8ff5d31ce58c2a8e9333ff66716bce",
"score": "0.6658968",
"text": "void setDefaultEndpoint(Endpoint defaultEndpoint);",
"title": ""
},
{
... |
069113a18d3950a0f06c9f0c01566375 | Returns report of endangered planets | [
{
"docid": "2cdfad649d834984bb7a4e1278185cfe",
"score": "0.0",
"text": "public static String getDecayReport(){\n\t\treturn decayReport;\n\t}",
"title": ""
}
] | [
{
"docid": "b798bcc0cd1aa6aec3fad5cf34a469c0",
"score": "0.6064146",
"text": "public void reportEconomyMonthEnd() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "d7d8a932a106d8a4bac41e796cc6a740",
"score": "0.5906086",
"text": "public static void showEndResult () {\n\n if (fleets[... |
6345cdf3419edb78e0f1464944a6d105 | This method help us to check if we were in a previous check in | [
{
"docid": "8aafff40f6e3217d95feca7e476d3e32",
"score": "0.7325437",
"text": "private void checkPreviousCheckIn(){\n if(PreferenceManager.getInstance(this).isInRoute()){\n if(PreferenceManager.getInstance(this).isDoingCheckIn()){\n if(PreferenceManager.getInstance(this).... | [
{
"docid": "9bf5097d7c16357d792a06832375cb76",
"score": "0.68008846",
"text": "public boolean hasPreviousResult() {\n ResultAction<?> action = baseline.getAction(type);\n \n return action != null && action.hasPreviousAction();\n }",
"title": ""
},
{
"docid": "1f4e15118da3... |
1b289471626838a61170ee8d28aa4503 | Promotes the ball in its trajectory, in case of a collision and in case of noncollision. | [
{
"docid": "3be9aa7c2e50b508190b41da8542c477",
"score": "0.5749785",
"text": "public void moveOneStep(double dt) {\r\n /* compute the ball trajectory . */\r\n Line trajectory = this.computeTrajectory(dt);\r\n /* Check if moving on this trajectory will hit anything. */\r\n Col... | [
{
"docid": "37758cef7ec6352adbc8097802d390c0",
"score": "0.73663956",
"text": "public void moveOneStep() {\n CollisionInfo collisionInfo = this.gameEnvironment.getClosestCollision(this.getTrajectoryLine());\n Line trajectory = this.getTrajectoryLine();\n Line trajectory2;\n P... |
a45fd107b8479b5a7b5f6f464255886c | / renamed from: v | [
{
"docid": "fd9caa40a4350bee7a71056a9e140aba",
"score": "0.0",
"text": "public boolean mo23169v(C6714b bVar) {\n C6888i.m12438e(bVar, \"fqName\");\n Iterator it = ((C6795m) C6790h.m12346d(this.f11929g)).iterator();\n while (it.hasNext()) {\n if (((C6060h) it.next()).mo231... | [
{
"docid": "f993aede52b73fb4977dcada4b14c1a5",
"score": "0.7272439",
"text": "int mo29877a(V v);",
"title": ""
},
{
"docid": "d367e46e8ae7036d6fbd36a80828a4cb",
"score": "0.7064342",
"text": "public void cambiarV(V v)\n\t{\n\t\tthis.v=v;\n\t}",
"title": ""
},
{
"docid": "... |
cd1c420c4a8ae6fe9e1add085afde6b8 | Copies the data "body" identified by a data management reference to a local file. | [
{
"docid": "1a3aed8ea488b3bdf00dfc5c0c8a981e",
"score": "0.5926812",
"text": "void copyReferenceToLocalFile(String reference, File targetFile, Collection<NodeIdentifier> platforms) throws IOException;",
"title": ""
}
] | [
{
"docid": "320e5006e23a85ecae4960006bf34c46",
"score": "0.6262166",
"text": "void copyReferenceToLocalFile(String reference, File targetFile, NodeIdentifier platform) throws IOException;",
"title": ""
},
{
"docid": "7ffe81483c93d6e05cabd253eb9324ca",
"score": "0.53333545",
"text": "... |
03450a728ecb42c320869c1dabc712aa | Constructor to initialize location with an x and a y value | [
{
"docid": "84123cd6414b1ae8b492983fb3706461",
"score": "0.85210073",
"text": "public Location (float x, float y){\n\t\tthis.x = x;\n\t\tthis.y = y;\n\t}",
"title": ""
}
] | [
{
"docid": "58f4ada5986085a0350d3b70fe6bd60b",
"score": "0.87990046",
"text": "public Location(int x, int y)\n {\n xCoord = x;\n yCoord = y;\n\t}",
"title": ""
},
{
"docid": "4862cdd6774fbeb84b857f85111ff880",
"score": "0.8686354",
"text": "public Location ( int x, i... |
dba8ac97b071da96a0c478aadb298bd8 | Runtime: 0 ms, faster than 100.00% of Java online submissions for Merge Two Sorted Lists. Memory Usage: 38.4 MB, less than 19.53% of Java online submissions for Merge Two Sorted Lists. | [
{
"docid": "cbd65f504261f4b8283cba274efbf209",
"score": "0.62734115",
"text": "public ListNode mergeTwoLists_recursive(ListNode l1, ListNode l2) {\n if (l1 == null && l2 == null) return null;\n if (l1 == null) return l2;\n if (l2 == null) return l1;\n if (l1.val <= l2.val) {\... | [
{
"docid": "ac6c33cfa944f433940deadc84ba4024",
"score": "0.7580306",
"text": "private static void merge(int[] merge1, int[] merge2, int[] list)\n {\n int left = 0;//index for merge1\n int right = 0;//index for merge2\n int whole = 0;//index for original list\n\n //bounds c... |
cb3f2e7735c1907c0a11e3794c712963 | Fetches all the products when page and size are not provided. Fetches products in paginated manner when both page and size are provided. | [
{
"docid": "021677d892f4a7ec609a26cdee74df41",
"score": "0.76836514",
"text": "@Override\n\tpublic List<Product> getAllProducts(Integer page, Integer size) {\n\t\tPageable pageableRequest = null;\n\t\tPage<Product> pages = null;\n\t\tList<Product> products = null;\n\n\t\tif (page != null && size != null... | [
{
"docid": "97077a1c76790d3a78d0fbebf66d31bb",
"score": "0.74870193",
"text": "@GetMapping\n public Page<Product> getPageSize(@RequestParam int page, @RequestParam int size) {\n Pageable pageable = PageRequest.of(page, size);\n// Page <Product> allProducts = productRepository.findAll(pa... |
6cdec5d9981f327a6cccc1ca02b85643 | Constructs a new body with the given dimensions and position. | [
{
"docid": "c7990c27e1db0ca35d8658f7541225dd",
"score": "0.5822378",
"text": "public Body(float x, float y, float w, float h) {\n\t\t\n\t\ttrigger = false;\n\t\tabsolute = false;\n\t\t\n\t\tinvMass = 1;\n\t\tepsilon = 0.0f;\n\t\tmu = 1;\n\t\t\n\t\tdim = new Vector2f(w, h);\n\t\tthis.transform = new Tran... | [
{
"docid": "4c66afe14d37efde2668b939675f1615",
"score": "0.707541",
"text": "Body createBody();",
"title": ""
},
{
"docid": "4c66afe14d37efde2668b939675f1615",
"score": "0.707541",
"text": "Body createBody();",
"title": ""
},
{
"docid": "96718ef4f6f985c32985e7543f906f26",... |
4c5e6c59d30cebbcb7a9623843819333 | Copying me gets us both zero. Just use this as inspiration. | [
{
"docid": "7a7231cea033fc0538f9a53144596d43",
"score": "0.0",
"text": "public static void main(String[] args) {\r\n\t\t// TODO Auto-generated method stub\r\n\t\t//Declare required variables.\r\n\t\tint nums[] = new int[10];\r\n\t\t//Populate the array.\r\n\t\tfor (int i = 0; i < 10; i++) {\r\n\t\t\tnum... | [
{
"docid": "3419598ef6965566c3db2f3c6ab70dbc",
"score": "0.60861754",
"text": "@Override\n public Integer reduceInit() {\n return 0;\n }",
"title": ""
},
{
"docid": "3419598ef6965566c3db2f3c6ab70dbc",
"score": "0.60861754",
"text": "@Override\n public Integer reduceIn... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "9ced062fe2b7d6b8505b056c2b5eb48a",
"score": "0.0",
"text": "@Override\n\tpublic int getInstanceCount(EventsByContractorFilter filter) {\n\t\treturn 0;\n\t}",
"title": ""
}
] | [
{
"docid": "74a4209c94e08d9f5eb0b60e580f5e04",
"score": "0.68867725",
"text": "@Override\r\n\tpublic void comit() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "b645eacb329adc01490ab5013a6c4f7f",
"score": "0.67295986",
"text": "@Override\n\t\t\tpublic void perfom() {\n\n\t\t\t}",
"t... |
90bc62a57b808505f3899a509618cde1 | Created by Noman Khan on 08/06/17. | [
{
"docid": "820f2b0d6f3ca1afe1cf210ede5acf19",
"score": "0.0",
"text": "public interface ReadFile {\n void readFile(String path);\n}",
"title": ""
}
] | [
{
"docid": "76b3966c8e3f64884c4127d1a3df09a8",
"score": "0.6250849",
"text": "@Override\r\n\t\t\tpublic void maruti() {\n\t\t\t\t\r\n\t\t\t}",
"title": ""
},
{
"docid": "b7c706d331e2b507ec0ff8404ad87dc7",
"score": "0.609815",
"text": "@Override\r\n\t\t\tpublic void crispel() {\n\t\t\... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "421df6095df22d6125737944ed608f34",
"score": "0.0",
"text": "@Override\n\tpublic List<Grade> searchGradePopup(String departementCode, String divisionCode, String gradeCode, String gradeName) {\n\t\tList<Grade> grade = new ArrayList<>();\n\t\tif(divisionCode.equals(\"\")&&departementCode.equal... | [
{
"docid": "d7194e467f51e022c107531d8614b6a3",
"score": "0.6905785",
"text": "@Override\r\n\tpublic void anular() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "941cb2826e3c700358fcaba402e6bb01",
"score": "0.66777676",
"text": "@Override\r\n\tpublic void hissetmek() {\n\r\n\t}",
"ti... |
5c4adb51f0eb583b9aa5679c8b84a5df | Iterates through patterns matched by PRESERVE_THREAD tag. For each tries to match supplied data, and if it matches passes matched string and qualifier to supplied method. | [
{
"docid": "5cf02b2e5ea9240b0d6df1409bea9266",
"score": "0.49821943",
"text": "private List<String> extractThreadStarts(String data) {\n\t\tList<String> extractedStarts = new ArrayList<String>();\n\t\tfor (String extractorPattern : threadStartExtractorList) {\n\t\t\tif (LOGGER.isTraceEnabled())\n\t\t\t\... | [
{
"docid": "aa99a0d3b737f81d3f52a8ae9643e973",
"score": "0.6161827",
"text": "private String extractThreadPatterns(String data)\t{\n\t\tif (data == null) { //ignoring nulls\n\t\t\treturn data;\n\t\t}\n\t\t\n\t\tif (searchThreadEnds(data))\t{\n\t\t\tfor (String extractedStart: extractThreadStarts(data)) ... |
adf9784590f2f580f88e6d88cbc8c5f7 | $ANTLR end "rule__AttributeDefinition__Group__4" $ANTLR start "rule__AttributeDefinition__Group__4__Impl" InternalCommunicationObject.g:2329:1: rule__AttributeDefinition__Group__4__Impl : ( ( rule__AttributeDefinition__Group_4__0 )? ) ; | [
{
"docid": "7ec9ca11a9773ea434f7a880d8d09a2f",
"score": "0.82266176",
"text": "public final void rule__AttributeDefinition__Group__4__Impl() throws RecognitionException {\n\n \t\tint stackSize = keepStackSize();\n \t\n try {\n // InternalCommunicationObject.g:2333:1: ( ( ... | [
{
"docid": "a615b0c7db67f2051c57a3364160e0e2",
"score": "0.8352713",
"text": "public final void rule__AttributeDefinition__Group_4__1() throws RecognitionException {\n\n \t\tint stackSize = keepStackSize();\n \t\n try {\n // InternalCommunicationObject.g:2402:1: ( rule__A... |
0c27ed78d4ea89d89dd7410350e64fb3 | test01_adminFacade_CreateCompany() checks method createCompany() in AdminFacade class. Creates Company and assert checks if Company is exists | [
{
"docid": "3dabaa218746fdfbae4fbae28337b846",
"score": "0.8252631",
"text": "@Test\n\tpublic void test01_adminFacade_CreateCompany() throws WrongLoginInputException, CompanyAlreadyExistException, InterruptedException, NameOrIdNotExistException {\n\t\tAdminFacade adminFacade = (AdminFacade) couponSystem... | [
{
"docid": "d8377a3fcd870fb90dc8defc9273529f",
"score": "0.7876735",
"text": "@Test\n\tpublic void testCreateCompany() {\n\t\tCompanyModel companyModel = new CompanyModel();\n\t\tcompanyModel.setCompanyId(003);\n\t\tcompanyModel.setCompanyName(\"FaceBook\");\n\t\tcompanyModel.setCountry(\"India\");\n\t\... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "a1b0b506dfe707343df740fc5e687ce5",
"score": "0.0",
"text": "public void onEnable() {\n\t}",
"title": ""
}
] | [
{
"docid": "1acc57d42c31dee937ac33ea6f2a5b0b",
"score": "0.68399656",
"text": "@Override\r\n\tpublic void comer() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "118f2b8a20f48999973063ac332d07d3",
"score": "0.6563993",
"text": "@Override\r\n\t\t\tpublic void atras() {\n\r\n\t\t\t}",
... |
04cb03086ae8906355534212c80889a8 | Show input text dialog. | [
{
"docid": "5583a9c89cd6d1aadb0e559067016ea5",
"score": "0.75568306",
"text": "private String showInputTextDialog(String message, String title) {\n\t\tString out = \"\";\n\t\tTextInputDialog dialog = new TextInputDialog();\n\n\t\tdialog.setTitle(title);\n\t\tdialog.setContentText(message);\n\n\t\tOption... | [
{
"docid": "17981b361a723568451d971e252280d7",
"score": "0.7505292",
"text": "void showTextPrompt() {\n final EditText input = new EditText(this);\n String title = \"Add a user\";\n if (listCode == LIST_CODE_PASSWORD)\n title = \"Add a password for \" + userList[userIndex... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "cf7682dcfe7aa00546ddb93f0ca75332",
"score": "0.0",
"text": "@Override\n\tpublic List<Categorys> findAll(Integer page) {\n\t\tString hql = \"from Categorys\";\n int rows = 10;\n return find(hql, page, rows);\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... |
7b9459ac759898ec2dd7f3099ace7588 | new TestRepositoryAdmin().testStaticMethods(); new TestRepositoryAdmin().testColumnDiscoveryWithWildcardedExcludes(); new TestRepositoryAdmin().testColumnDiscoveryWithIncludeAllCells(); new TestRepositoryAdmin().testColumnDiscoveryWithIncludeAllCellsUsingMapReduce(); new TestRepositoryAdmin().testColumnDiscoveryWithWil... | [
{
"docid": "cfa665c13aeee955cd3605b285f10d5c",
"score": "0.70736283",
"text": "public static void main(String[] args) throws Exception {\n new TestRepositoryAdmin().testColumnAuditingWithWildcardedExcludesAndColumnAliases();\n // new TestRepositoryAdmin().scratchPad();\n // new TestRepositoryAd... | [
{
"docid": "7a4201a320f8295f0e1253b87245bf86",
"score": "0.6945848",
"text": "@Test\n public void testFindAll() {\n }",
"title": ""
},
{
"docid": "4ec40639a63b77fa7bbbd97f464a479f",
"score": "0.6829325",
"text": "@Test\n public void queryTest() {\n\n }",
"title": ""
... |
d6d01eeb5a2268515ae8038724724dd2 | TODO: Warning this method won't work in the case the id fields are not set | [
{
"docid": "d868d8b6172b3543445c3c04b2e27715",
"score": "0.0",
"text": "@Override\n public boolean equals(Object object) {\n if (!(object instanceof CourseCriteria)) {\n return false;\n }\n CourseCriteria other = (CourseCriteria) object;\n if ((this.id == null &... | [
{
"docid": "27d40fad6ffddfb882d4698918a44f23",
"score": "0.68939245",
"text": "private void setId(Integer id) { this.id = id; }",
"title": ""
},
{
"docid": "c520db2892ba2af63fa6d93e9c1cb59a",
"score": "0.6838206",
"text": "private Integer getId() { return this.id; }",
"title": ""... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "ed997a4e26abc2cb31e878afa952f40f",
"score": "0.0",
"text": "public void handleDataChange(String dataPath, Object data)\n throws Exception {\n\n }",
"title": ""
}
] | [
{
"docid": "d7194e467f51e022c107531d8614b6a3",
"score": "0.6905833",
"text": "@Override\r\n\tpublic void anular() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "cdf542363f5b089e84183e3d9020935f",
"score": "0.6697644",
"text": "@Override\n\t protected void ramana() {\n\t\t\n\t}",
"ti... |
17d3a3a7825bf4de8cff77224dc3ea2a | java 1.2 Collection ArrayList obj1 = new ArrayList(); obj1.add(5); obj1.add(10); obj1.add("5"); Problem statement is > 5 + 10 = 15 + "5" > 155 Generic Scope restriction of data (dataType) Java 1.5 introduce Generic | [
{
"docid": "599f159965db2cca07208bc49f2f2249",
"score": "0.0",
"text": "public static void main(String[] args) {\n\t\tArrayList<String> object = new ArrayList<String>();\n\n\n\t\t// Java 1.7 \n\t\tList<String> mentors = new ArrayList<>();\n\t\tmentors.add(\"Babu\");\n\t\tmentors.add(\"Sarath\");\n\t\tme... | [
{
"docid": "f560d99dbec9758c1b1768116bf0010a",
"score": "0.65433234",
"text": "public static void main(String[] args) {\n List<Number> numberList = new ArrayList<>();\n numberList.add(1);\n System.out.println(numberList); // [1]\n\n // Integer is a subtype of Number, which sa... |
c4594a13ec6d637276071d57b5007c7b | This method was generated by MyBatis Generator. This method sets the value of the database column t_sys_menu_his.MENU_URL | [
{
"docid": "b7021788d369784de68a725d35cc0d89",
"score": "0.6444964",
"text": "public void setMenuUrl(String menuUrl) {\n this.menuUrl = menuUrl == null ? null : menuUrl.trim();\n }",
"title": ""
}
] | [
{
"docid": "c3fdfd9cce08f4b0b4e79a4285891e82",
"score": "0.6507047",
"text": "public void setMenuUrl(String menuUrl) {\n this.menuUrl = menuUrl;\n }",
"title": ""
},
{
"docid": "78df57ba3257d741b461f4fd4493ff4f",
"score": "0.6337304",
"text": "public void setMenuurl(String ... |
5562d78e4b94dba59c96f291e658d467 | Runs the game: start the animation loop. | [
{
"docid": "2f520a232665fb093f702d3232c74516",
"score": "0.7150597",
"text": "public void run(Animation animation) {\r\n int millisecondsPerFrame = 1000 / this.framesPerSecond;\r\n while (!animation.shouldStop()) {\r\n long startTime = System.currentTimeMillis(); // timing\r\n ... | [
{
"docid": "155f83338921c8d684f517e53b1f8f47",
"score": "0.8528614",
"text": "public void run() {\n\t\tplayInitialMusic();\n\t\tdrawBackground();\n\t\twhile (true) {\n\t\t\twhile (!gameStarted && !levelEditorStarted) {\n\t\t\t\tanimate();\n\t\t\t\tint counter = 0;\n\t\t\t\twhile (animationIsRunning && c... |
22ea4d959eb85fbfabb7dc79540affce | This test method demonstrates the ability to create a result class to encapsulate the results returned from a value query. | [
{
"docid": "7eda37bbafec7cfd6ede54917e557dd0",
"score": "0.6901864",
"text": "@Test\n\tpublic void testResultClass() {\n\t\tlog.info(\"*** testResultClass ***\");\n\n\t\tString query = String.format(\"select new %s(m.title, m.releaseDate) \" +\n\t\t\t\t\"from Movie m \" +\n\t\t\t\t\"order by title ASC\"... | [
{
"docid": "ce95f2d09b843344e08d069cff31f943",
"score": "0.67223006",
"text": "protected abstract QueryResult createQueryResult();",
"title": ""
},
{
"docid": "66df00b330cb6bc2b145780bedf37dfa",
"score": "0.6448785",
"text": "@Test\n\tpublic void testResultValueQuery() {\n\t\tlog.inf... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "430a7e9443a470d7bb8f21cc0fef127a",
"score": "0.0",
"text": "@Override\n\tpublic void onTabSelected(Tab tab, FragmentTransaction ft) {\n\t\t\n\t\tif (fragment == null) {\n\t\t\tfragment = Fragment.instantiate(parent, fragmentClass.getName());\n\t\t\tft.add(android.R.id.content, fragment, tag)... | [
{
"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... |
7faa9e94ce6b41479c22c92c5058f0c8 | gibt das String Array zurueck(getter) | [
{
"docid": "644d56cb933de7942ef16f311e9f19e1",
"score": "0.0",
"text": "public String[][] getSpielerFiguren () {\n return spielerFiguren;\n }",
"title": ""
}
] | [
{
"docid": "ff99e6aa868847de0b787499566a6c63",
"score": "0.7564704",
"text": "public String[] stringArray();",
"title": ""
},
{
"docid": "c61192dc22041905f43043853255e6dc",
"score": "0.7381472",
"text": "java.lang.String getStringArray(int index);",
"title": ""
},
{
"doci... |
5e6a841e59f7e4ece6a2ea1e4f9a2015 | This method was generated by MyBatis Generator. This method corresponds to the database table bs_tenant | [
{
"docid": "4553f146e13f03aa9adbc54ac5c103dc",
"score": "0.5031742",
"text": "int deleteByExample(BsTenantExample example);",
"title": ""
}
] | [
{
"docid": "5aa527a7c7b1ff2764f9bfa40e783c5f",
"score": "0.72494096",
"text": "BsTenant selectByPrimaryKey(Long tId);",
"title": ""
},
{
"docid": "c5e851bb070be31e09d0e8e27f9b8d9f",
"score": "0.62822574",
"text": "List<BsTenant> selectByExample(BsTenantExample example);",
"title"... |
dd045482f5977b5001d97f6b0e96c53e | Constructors Create a detached EquipmentAwardedRecord | [
{
"docid": "2b55228c7d77ca82d353a2cba7bb08fe",
"score": "0.7529419",
"text": "public EquipmentAwardedRecord() {\n super(Tue4EquipmentAwarded.EQUIPMENT_AWARDED);\n }",
"title": ""
}
] | [
{
"docid": "32d81c49a2b009876920ec138e297bfa",
"score": "0.701435",
"text": "public EquipmentAwardedRecord(Long productId, String awardedLeqId, BigDecimal quantity, OffsetDateTime createdAt) {\n super(Tue4EquipmentAwarded.EQUIPMENT_AWARDED);\n\n set(0, productId);\n set(1, awardedLe... |
9484887d1ad08c3e3dc1bd0d097286bd | Updating a choice or creating a new choice if choiceId is not given in choiceUpdateRequest. | [
{
"docid": "57b36214e8ca4272cab8634ecca4fcc2",
"score": "0.7586508",
"text": "public ChoiceUpdateResponse updateChoice(ChoiceUpdateRequest choiceUpdateRequest) throws P13nServiceException, org.apache.thrift.TException;",
"title": ""
}
] | [
{
"docid": "87756da4854b1084ff0b39758e861c83",
"score": "0.6635867",
"text": "boolean updateChoice(Choice choice);",
"title": ""
},
{
"docid": "164036f7dc82423cb556caff37abce2f",
"score": "0.66047746",
"text": "void updateChoice(DB db, int pollchoice_id, int num, String choice) throw... |
e52adda5c73a3ed4fce58bda17f9a57f | Returns true if allow model cross orm context, else false. Default is false | [
{
"docid": "021b993705e26048987d1608cf311ce6",
"score": "0.71005815",
"text": "boolean isModelCrossContext();",
"title": ""
}
] | [
{
"docid": "62ad051f6a65675b4ab17d1b0880c374",
"score": "0.63960296",
"text": "public boolean isModel() {\r\n \treturn false;\r\n }",
"title": ""
},
{
"docid": "06a09d80aa69ff3133b99dd16b039c87",
"score": "0.6162869",
"text": "boolean hasModel();",
"title": ""
},
{
... |
6d0462c405c5bc2b9eb94d789bda5e0d | Created by Administrator on 2016/8/3. | [
{
"docid": "e2da7908e45e70b75af971621823396d",
"score": "0.0",
"text": "public interface HttpCallBackListener {\n public void onFinish(String response) ;\n public void onError(Exception e) ;\n}",
"title": ""
}
] | [
{
"docid": "74a4209c94e08d9f5eb0b60e580f5e04",
"score": "0.627705",
"text": "@Override\r\n\tpublic void comit() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "534c466f09845319b9edaf959a891c09",
"score": "0.6188488",
"text": "@Override\r\n\tpublic void debriyaj() {\n\t\t\r\n\t}",
"ti... |
8f13d662771f70445e3e1e9547be098b | returns a node search in root node O(h) | [
{
"docid": "759fa7bbdaf302e01766ffef2000a914",
"score": "0.6896477",
"text": "TreeNode treeSearch(int key) {\n\t\treturn nodeSearch(root, key);\n\t}",
"title": ""
}
] | [
{
"docid": "4c0df0ee240954817f06c3f7227af287",
"score": "0.7580918",
"text": "protected MNode<T> search(T elem) {\n //new node\n MNode<T> element = new MNode<T>(elem, 0, RBColor.BLACK, null, null);\n //made a pointer node\n MNode<T> tmp = root;\n //search key\n ... |
fa78d5a25d11c0411e384da8da145c27 | repeated .large_coref.protobuf.Document.Token tokens = 1; | [
{
"docid": "acbb3fb8c0608e4e0a1ec07b5cc07908",
"score": "0.0",
"text": "public Builder addTokens(\n int index, cc.refectorie.proj.relation.protobuf.DocumentProtos.Document.Token.Builder builderForValue) {\n if (tokensBuilder_ == null) {\n ensureTokensIsMutable();\n ... | [
{
"docid": "210ba09e25305eb9352c65d89e3158cf",
"score": "0.6537097",
"text": "cc.refectorie.proj.relation.protobuf.DocumentProtos.Document.Token getTokens(int index);",
"title": ""
},
{
"docid": "71158f2957d4d3ddd9861d563b362b13",
"score": "0.6454267",
"text": "protobuf.run.Token get... |
37fe9f72b0a1de0977120dd4ca532fc5 | Read LCourses from a marshalled stream | [
{
"docid": "2c5e3e16f4f2bd882e5b29a53f7aabfa",
"score": "0.5896532",
"text": "public void _read(org.omg.CORBA.portable.InputStream istream)\r\n {\r\n value = LCoursesHelper.read(istream);\r\n }",
"title": ""
}
] | [
{
"docid": "c28a9403ec0f8f6fc4a5a935b8483011",
"score": "0.5591711",
"text": "private void readObject( ObjectInputStream s ) throws IOException,\n ClassNotFoundException\n {\n s.defaultReadObject(); // read basic information\n\n ... |
8320ea67236097f455b2e5956ee4460c | Creates an extension of this registry | [
{
"docid": "816e192a789e1949da6a898ec5c2ac2a",
"score": "0.7106332",
"text": "AnnotationRegistry createExtension();",
"title": ""
}
] | [
{
"docid": "d7ebe5df6e719d16b958d7f61d1ee00b",
"score": "0.67625326",
"text": "Registry createRegistry();",
"title": ""
},
{
"docid": "b30cdeddcbf9af8d8bedc6f8bd2c58bd",
"score": "0.66561484",
"text": "CreateExtensionInfo createCreateExtensionInfo();",
"title": ""
},
{
"d... |
2dcccd96e21762b1d58718ee0255f8ee | Sends a request to the tag. | [
{
"docid": "83b664b5439f102892eb01f113fdf53f",
"score": "0.0",
"text": "<Res, Request extends CommandRequest<Res>> Signal<Res> enqueue(Request request);",
"title": ""
}
] | [
{
"docid": "8f4c0819c98172110f8c9379f4342bd8",
"score": "0.75191355",
"text": "private void sendTag(JSONObject request)\n\t{\n\t\tsendResponseTo(this.ansClient , request);\n\t}",
"title": ""
},
{
"docid": "630d2a5c13340f945fbdc07d17905245",
"score": "0.6871052",
"text": "void send(St... |
4e5b55abd3f3c5629843a29eb601bd43 | required string producerName = 2; | [
{
"docid": "427f78ee5a51e3a9153dfe79a622ebc6",
"score": "0.0",
"text": "public Builder clearProducerName() {\n bitField0_ = (bitField0_ & ~0x00000002);\n producerName_ = getDefaultInstance().getProducerName();\n onChanged();\n return this;\n }",
"title": ""
}
] | [
{
"docid": "44a9e5483a04d55a9fcc891aa6ba3cac",
"score": "0.6051919",
"text": "java.lang.String getProducerName();",
"title": ""
},
{
"docid": "44a9e5483a04d55a9fcc891aa6ba3cac",
"score": "0.6051919",
"text": "java.lang.String getProducerName();",
"title": ""
},
{
"docid":... |
98eccba9f18007b4124a9fd3a44ca868 | Retorna el id de un proyecto filtrando por su nombre | [
{
"docid": "37075f469fe4e176edfebbed77ab9471",
"score": "0.0",
"text": "public String selectIdProjectByName(String name) throws SQLException {\r\n\t\treturn ProjectDAO.getInstance().selectIdProjectByName(name);\r\n\t}",
"title": ""
}
] | [
{
"docid": "4fc57128903e4a7059947a4cfbc67610",
"score": "0.6546249",
"text": "public int getIdParcialE(String nombre) {\n try {\n int id;\n String query = \"SELECT * FROM Parcial WHERE nombre = '\" + nombre + \"'\";\n rs = st.executeQuery(query);\n rs.n... |
5ee550a104d8742e1f308d38da727cb2 | repeated .Contributor contributors = 1; | [
{
"docid": "bdb0c42b1d55ae3dda08679c22c6198e",
"score": "0.5448695",
"text": "java.util.List<Twitter.Contributor> \n getContributorsList();",
"title": ""
}
] | [
{
"docid": "3a774bb74bbfccec99c155268475d7de",
"score": "0.6036778",
"text": "void addContributor(Person contributor);",
"title": ""
},
{
"docid": "a5692efa2aa45f9a848db9555780b75d",
"score": "0.58998585",
"text": "void setContributors(List<Person> contributors);",
"title": ""
... |
724ad4e391b3f6dcb269ada34505bd5a | Test of incrementDiscriminant method, of class RealQuadRingDisplay. | [
{
"docid": "70a886c96517bb0c3b8ffe216a2d067b",
"score": "0.8248262",
"text": "@Test\r\n public void testIncrementDiscriminant() {\r\n System.out.println(\"incrementDiscriminant\");\r\n// RealQuadRingDisplay instance = null;\r\n// instance.incrementDiscriminant();\r\n // TO... | [
{
"docid": "47b67ca7bb6df5340e23cd16173037a5",
"score": "0.69329005",
"text": "@Test\r\n public void testDecrementDiscriminant() {\r\n System.out.println(\"decrementDiscriminant\");\r\n// RealQuadRingDisplay instance = null;\r\n// instance.decrementDiscriminant();\r\n // T... |
19cbafa9f8cc17122312500dfbdd4ab8 | ~ getter method for creator. | [
{
"docid": "1a1ce0bab4a402860d582f9780066425",
"score": "0.74685997",
"text": "public User getCreator() {\n return creator;\n }",
"title": ""
}
] | [
{
"docid": "a823b35e8fb0a7c1ff9deef067dce9a2",
"score": "0.83713794",
"text": "public Creator getCreator() {\n return creator;\n }",
"title": ""
},
{
"docid": "71d279238af7cfa31f8290b68ace1cea",
"score": "0.8233181",
"text": "String getCreator();",
"title": ""
},
{
... |
d1f176a4b0594c044ddfd475350c35be | Interface that provides method to generate Registration Center ID. | [
{
"docid": "42b2c87d8dbc042bfcc3306c24aad067",
"score": "0.7903056",
"text": "public interface RegistrationCenterIdGenerator<T> {\n\t/**\n\t * This method generates registration center id.\n\t * \n\t * @return the generated registration center id.\n\t */\n\tpublic T generateRegistrationCenterId();\n}",
... | [
{
"docid": "2d91fb71eb2059fdc15b30f9596b578b",
"score": "0.9074833",
"text": "public T generateRegistrationCenterId();",
"title": ""
},
{
"docid": "aa297e1e122ca84b309ea5ea39cc56c3",
"score": "0.688193",
"text": "private String generateID() {\n Timestamp timestamp = new Timest... |
023561bd71f9fa14d8ad3d828201029f | Set new network. In this case, process the network too | [
{
"docid": "6c7a2fd5728b14186f0b7098f9b32432",
"score": "0.70386237",
"text": "public void setNewNetwork(Network bfn) {\n if (bfn != null) {\n myData_.nodeCount = bfn.getNodeCount();\n myData_.linkCount = bfn.getLinkCount(false);\n myData_.fullShadowLinkCount = bfn.getLinkCount... | [
{
"docid": "3d5b303b49d0fa13e0cd85060ec994c5",
"score": "0.771609",
"text": "public void assignNetwork(Network net) {\n\t\tnetwork = net;\n\t}",
"title": ""
},
{
"docid": "be15e7c65f3379330a6cad83a35e3df7",
"score": "0.74445194",
"text": "public abstract void setTo(Network network);"... |
f971164c32258f289c157cbdadd2b62a | Test case number: 124 /Coverage entropy=0.0 | [
{
"docid": "346894681d5392465f83ef483d6a3c49",
"score": "0.0",
"text": "@Test(timeout = 4000)\n public void test124() throws Throwable {\n String string0 = EWrapperMsgGenerator.fundamentalData(2146855968, \" It does not support delta-neutral orders.\");\n assertEquals(\"id = 2146855968 le... | [
{
"docid": "e47c559cfcb271cc978935778eb25873",
"score": "0.72505295",
"text": "@Test(timeout = 4000)\n public void test091() throws Throwable {\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\n Instances instances0 = textDirectoryLoader0.getStructure();\n Evalua... |
db31e8168f56b0fabc631de7072a91b7 | An internationalized wrapper call to log4j's debug method | [
{
"docid": "719bb3d2530701cd4a894b8e0c99f535",
"score": "0.6110108",
"text": "public void debug( String code, Object arg0, Object arg1, Object arg2, Object arg3 ) {\n\t if ( isDebugEnabled() ) {\n\t\tObject[] args = { arg0, arg1, arg2, arg3 };\n\t\tdebug( code, args );\n\t }\n\t}",
"title": ""... | [
{
"docid": "b574f41da04e29482ee3baebe977cce4",
"score": "0.7513624",
"text": "void debug(String format, Object... args);",
"title": ""
},
{
"docid": "68e323145be3f048652674979eac8c8c",
"score": "0.7283085",
"text": "void debug(String msg);",
"title": ""
},
{
"docid": "2e7... |
88e3f95e3b05ea11eb0782a4040989fe | $ANTLR end "rule__ScopedRules__Group_0_0_0_2__0" $ANTLR start "rule__ScopedRules__Group_0_0_0_2__0__Impl" InternalACMECNl.g:2785:1: rule__ScopedRules__Group_0_0_0_2__0__Impl : ( 'in' ) ; | [
{
"docid": "da2d437aa83461a58379b0d723b137a9",
"score": "0.7689208",
"text": "public final void rule__ScopedRules__Group_0_0_0_2__0__Impl() throws RecognitionException {\n\n \t\tint stackSize = keepStackSize();\n \t\n try {\n // InternalACMECNl.g:2789:1: ( ( 'in' ) )\n ... | [
{
"docid": "73be2dab015f1ce1fb2f6c606817c548",
"score": "0.754934",
"text": "public final void rule__ScopedRules__Group_0_0_0_3_5_6__1__Impl() throws RecognitionException {\n\n \t\tint stackSize = keepStackSize();\n \t\n try {\n // InternalACMECNl.g:3382:1: ( ( 'in' ) )\n... |
4b8c313bb639d0634d2549cc26a49140 | This method makes the parser stop running if it encounters invalid input and throw a RuntimeException. | [
{
"docid": "ea02984a3b37c5beb8043f7c8cd26655",
"score": "0.0",
"text": "public void reportErrorsAsExceptions() {\n //removeErrorListeners();\n \n addErrorListener(new ExceptionThrowingErrorListener());\n }",
"title": ""
}
] | [
{
"docid": "b3098c7c833954f06e21778eb16407e0",
"score": "0.6594731",
"text": "private void fail() {\n throw new IllegalStateException(\"Some problem at token: \"\n + parser.current());\n }",
"title": ""
},
{
"docid": "bd8e0cafe99a0e0f0a544512b361198d",
"score": "... |
1b876890f03a041a10dbef71053433c8 | Pensez a utiliser la methode lireEntierComprisEntre() de la classe UtilitairesJeux | [
{
"docid": "0899df7e4219bf3fcb226efa902a5892",
"score": "0.0",
"text": "@Override\n\tpublic Flechette viserEtLancerFlechette() {\n\t\tSystem.out.println(\"Quel secteur vises-tu?\");\n\t\tint secteur = UtilitairesJeux.lireEntierComprisEntre(0, 25, \"Il faut un chiffre compris entre 0 et 25\");\n\t\tSyste... | [
{
"docid": "026f37f8dd8828f5294e5346200c4a1d",
"score": "0.6532125",
"text": "@Override\n\tpublic FicheConseilClasseBean getRapportConseilClasseTrimestriel(Etablissement etab, \n\t\t\tAnnee annee, Classes classe , double tauxReussite, double moyenne_general,\t\n\t\t\tTrimestres trimestre, List<Eleves> l... |
ca1172ea8555e20ab173859c8c336d03 | Handles loading and unloading plugin artifacts from a location | [
{
"docid": "d88057902abf12d37300bfaff5210c3c",
"score": "0.50615925",
"text": "public interface PluginLoader {\n Collection<Plugin> loadAllPlugins(ModuleDescriptorFactory moduleDescriptorFactory) throws PluginParseException;\n\n /**\n * @return a collection of discovered plugins which have now... | [
{
"docid": "589ab10580887b96ba190ccf7f215c62",
"score": "0.59940547",
"text": "void loadPlugin( URL path, String classname, String pluginID, int maxConnections ) throws ClassNotFoundException, ClassNotAHydraPluginException, FileNotFoundException;",
"title": ""
},
{
"docid": "90eef4bdfaa77193... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "619b7891939e85c617f0e0381e6d9675",
"score": "0.0",
"text": "@Override\n\tpublic void execute() {\n\t\tthis.mAlarm.start();\n\t}",
"title": ""
}
] | [
{
"docid": "f4bccec648e6eb25ae6f4d7165ffc5a1",
"score": "0.7037216",
"text": "@Override\n\t\t\tpublic void Goruntule() {\n\t\t\t\t\n\t\t\t}",
"title": ""
},
{
"docid": "27bc40cf2c5e26e0bf8b70807e0bcaed",
"score": "0.68683225",
"text": "@Override\r\n\tpublic void caminar() {\n\t\t\r\n... |
523f8783cbfff559a9b396d3d8e2ae2f | / Return the StreamDataSource property It is helpful for retrieving Audio properties to draw the audio and spectrogram panel | [
{
"docid": "2d7471c27f126e5906364da4b203c38d",
"score": "0.68507177",
"text": "public synchronized StreamDataSource getStreamDataSource(){\n StreamDataSource streamDataSource = null;\n if(liveRecognizer != null){\n streamDataSource = liveRecognizer.getStreamDataSource();\n ... | [
{
"docid": "6574a9f7940cc5656c62e7b791391f71",
"score": "0.6208873",
"text": "public String getPropertyAudioChannels();",
"title": ""
},
{
"docid": "ecddb00fc97cf00f477fab89e921a614",
"score": "0.61198443",
"text": "public String getDataSource();",
"title": ""
},
{
"docid... |
c499dd91c99b3b4f6a4cf47d51b6dbe0 | Creates a new KeyValuePair RecordBuilder. | [
{
"docid": "20e228c8837fa3fd53e6dde9849704b6",
"score": "0.74151194",
"text": "public static org.rockscache.avro.proto.KeyValuePair.Builder newBuilder() {\n return new org.rockscache.avro.proto.KeyValuePair.Builder();\n }",
"title": ""
}
] | [
{
"docid": "e16f892edb02fc46f5ed51d33a7a0e48",
"score": "0.6907099",
"text": "public static org.rockscache.avro.proto.KeyValuePair.Builder newBuilder(org.rockscache.avro.proto.KeyValuePair other) {\n return new org.rockscache.avro.proto.KeyValuePair.Builder(other);\n }",
"title": ""
},
{
... |
87f73b6fd9b006cf9f2148272c6e999d | Convert the given object to string with each line indented by 4 spaces (except the first line). | [
{
"docid": "8279fe35d1f3c688ad6983974b78755b",
"score": "0.0",
"text": "private String toIndentedString(java.lang.Object o) {\n if (o == null) {\n return \"null\";\n }\n return o.toString().replace(\"\\n\", \"\\n \");\n }",
"title": ""
}
] | [
{
"docid": "5ba91dc3b84c54d334b0aff5a9bed628",
"score": "0.7546715",
"text": "private String toIndentedString(Object o)\n/* */ {\n/* 146 */ if (o == null) {\n/* 147 */ return \"null\";\n/* */ }\n/* 149 */ return o.toString().replace(\"\\n\", \"\\n \");\n/* */ }",
... |
136453f37860b25cca74dd5d2f9d5b3b | If true, groups are always expanded and toggle button is not displayed | [
{
"docid": "0fd5876b5cac48bbb6c3cfa06de55011",
"score": "0.58593184",
"text": "public boolean isAlwaysExpanded() {\n\t\treturn alwaysExpanded;\n\t}",
"title": ""
}
] | [
{
"docid": "32f8429b572ad7fe460d56728253605c",
"score": "0.6777574",
"text": "@Override\n\tpublic void setExpanded(boolean is) {\n\t\t\n\t}",
"title": ""
},
{
"docid": "fe8edd4107db831e84a8fb413c813a25",
"score": "0.67186713",
"text": "public abstract boolean onCheckCanExpandOrCollap... |
bf2307952709072eb49ab0a7327814b0 | Store the number of tabs, this will also be passed when the ViewPagerAdapter is created Build a Constructor and assign the passed Values to appropriate values in the class | [
{
"docid": "c3d2a82a9c88b3900d20ee237287c651",
"score": "0.56201243",
"text": "public ViewPagerAdapterRG(FragmentManager fm,CharSequence mTitles[], int mNumbOfTabsumb, Context context, int formulario_numero) {\n super(fm);\n\n this.Titles = mTitles;\n this.NumbOfTabs = mNumbOfTabsum... | [
{
"docid": "ea7dc2fd5ea8e353b6e709041ce2e6f2",
"score": "0.72481364",
"text": "public void setTabs(int count) {\n ViewPager pager = (ViewPager) findViewById(R.id.pager);\n\n switch (count){\n case PAsettings:\n //MyPagerAdapterSettings adapterViewPagerSett... |
f93bcc319a11994c5a202118606f86c8 | Receive data from IntentPlayground Activity | [
{
"docid": "a38bbe3e50de2daa7f5306c9b4655e6d",
"score": "0.53029907",
"text": "private void receiveData() {\n\n // check bundle is not null\n if (getIntent().getExtras() == null) {\n sharedPreferences.edit().putInt(Constants.COUNT_VAlUE, 0).apply();\n return;\n ... | [
{
"docid": "14dd477bee324000f98ec88badefca0a",
"score": "0.6087767",
"text": "private void retrieveIntent(){\n //Retrieving the data being passed through from the previous page\n intentTitle = getIntent().getStringExtra(\"Exercise Name\");\n intentID = getIntent().getIntExtra(\"Exer... |
d2e24ff6a7a4f2fa011c640640bf596c | Creates a new Light. Note that this is not intended to be called directly (use one of derived classes instead). | [
{
"docid": "a90b2c7a4671b91f7aae0fd7ec8ed060",
"score": "0.5776672",
"text": "@JsConstructor\n public Light(int color) {\n\n }",
"title": ""
}
] | [
{
"docid": "6317d137244581aa74580c33f551279a",
"score": "0.7614357",
"text": "Light createLight(int position, boolean initialState);",
"title": ""
},
{
"docid": "2bc64a454258247da8f0e43705d2cb40",
"score": "0.74300873",
"text": "public Light() {\r\n \tthis.name = \"\";\r\n \tth... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "d6b4dc12fc57e93be63041079269adce",
"score": "0.0",
"text": "@Override\n\tpublic ApplicationsDTO addOperation(OperationDTO module)\n\t\t\tthrows com.fos.common.security.exception.SecurityException {\n\t\treturn null;\n\t}",
"title": ""
}
] | [
{
"docid": "63a51b9825ac81396e1d7ad0b9f3ed82",
"score": "0.6866318",
"text": "@Override\n\tpublic void 군무() {\n\t\t\n\t}",
"title": ""
},
{
"docid": "15ae679aae74424c73fde647cf4332f6",
"score": "0.68461496",
"text": "@Override\r\n\t\t\tpublic void hissetmek() {\n\r\n\t\t\t}",
"ti... |
4e4cef4722cacbf8afdf942196e25f90 | / [array] return Name, enterprise number and countrycode | [
{
"docid": "beaa65c28beae590f9abe9b11bbdcb53",
"score": "0.0",
"text": "public static ArrayList<Businesscard.nameEntity> SearchByName(String name) {\r\n\t\tArrayList<Businesscard.nameEntity> bCrds = new ArrayList<Businesscard.nameEntity>();\r\n\t\tNodeList bcards = XMLreader();\r\n\t\tBoolean getBcard;\... | [
{
"docid": "0cb1d8b82672b240eae69ea7230df1fd",
"score": "0.5950366",
"text": "String getCountryList();",
"title": ""
},
{
"docid": "68a048567a8695f350a262e1de95656b",
"score": "0.58362424",
"text": "String getListAgencyName();",
"title": ""
},
{
"docid": "7b1383bc8460a6e5... |
a54a2d4434f512770071ccf2e5129783 | string field_1352 = 1352; | [
{
"docid": "43903ff68bd336406e36f6b791dbf4cf",
"score": "0.7274361",
"text": "java.lang.String getField1352();",
"title": ""
}
] | [
{
"docid": "4c218e4e9596468192dc862f6174448f",
"score": "0.7592633",
"text": "java.lang.String getField1307();",
"title": ""
},
{
"docid": "c9a970cfec4911e10cf0dbc3c12247fe",
"score": "0.7573896",
"text": "java.lang.String getField1320();",
"title": ""
},
{
"docid": "3dda... |
641053749352e71fb023bc8eae2238dd | Compares thisWidget to thatWidget using the Widget's compareTo method. | [
{
"docid": "715dc8aec77afc254326aa6e748881be",
"score": "0.81109554",
"text": "public int compare(Widget thisWidget, Widget thatWidget) {\n\t\treturn thisWidget.compareTo(thatWidget);\n\t}",
"title": ""
}
] | [
{
"docid": "f4a01714959c23dd4b7ac185c5ebbd1a",
"score": "0.5864292",
"text": "@Override\n\tpublic int compare(Combo arg0, Combo arg1) {\n\t\treturn arg1.distance - arg0.distance;\n\t}",
"title": ""
},
{
"docid": "b3884f7f7a3609ddbd5b40725fd79eab",
"score": "0.5748673",
"text": "@Over... |
06eb97152511550fd773e54bb7684324 | calls the actionPerformed methods | [
{
"docid": "742124ab264dfaca5f7fbf404248b786",
"score": "0.0",
"text": "public void actionPerformed(ActionEvent e){\n\t\tfor(ActionListener al : actionListeners){\n\t\t\tal.actionPerformed(e);\n\t\t}\n\t}",
"title": ""
}
] | [
{
"docid": "37ed162ed5dca60c46e6d134f1cd169e",
"score": "0.83955383",
"text": "@Override\n\t\t\tpublic void actionPerformed(ActionEvent arg0) {\n\t\t\t\t\n\t\t\t}",
"title": ""
},
{
"docid": "624ad912566a718e48eac5b64ff591b0",
"score": "0.83533233",
"text": "public void actionPerform... |
8345f9658563d5a631535c513da3156a | $ANTLR end "ruleDepthLiteral" $ANTLR start "entryRuleTouchLiteral" InternalDSL.g:678:1: entryRuleTouchLiteral : ruleTouchLiteral EOF ; | [
{
"docid": "e43aff1088832ebfbad6870b8cadef45",
"score": "0.7268337",
"text": "public final void entryRuleTouchLiteral() throws RecognitionException {\n try {\n // InternalDSL.g:679:1: ( ruleTouchLiteral EOF )\n // InternalDSL.g:680:1: ruleTouchLiteral EOF\n {\n ... | [
{
"docid": "0c846ff937da35c14096600f2f77001b",
"score": "0.6453373",
"text": "public final void entryRuleDepthLiteral() throws RecognitionException {\n try {\n // InternalDSL.g:654:1: ( ruleDepthLiteral EOF )\n // InternalDSL.g:655:1: ruleDepthLiteral EOF\n {\n ... |
c4c5fb5e9fd351b65da890697f7c26cb | $ANTLR end "entryRuleQualifiedName" $ANTLR start "ruleQualifiedName" ../org.etl.dsl.Sparrow/srcgen/org/etl/parser/antlr/internal/InternalSparrow.g:5064:1: ruleQualifiedName returns [AntlrDatatypeRuleToken current=new AntlrDatatypeRuleToken()] : (this_ValidID_0= ruleValidID ( ( ( '.' )=>kw= '.' ) this_ValidID_2= ruleVal... | [
{
"docid": "1096a5675493864a3ac61292bf777b84",
"score": "0.75223976",
"text": "public final AntlrDatatypeRuleToken ruleQualifiedName() throws RecognitionException {\n AntlrDatatypeRuleToken current = new AntlrDatatypeRuleToken();\n\n Token kw=null;\n AntlrDatatypeRuleToken this_Vali... | [
{
"docid": "12f34552e3045500c5ff4ddf28bd73df",
"score": "0.8067608",
"text": "public final String entryRuleQualifiedName() throws RecognitionException {\n String current = null;\n\n AntlrDatatypeRuleToken iv_ruleQualifiedName = null;\n\n\n try {\n // InternalDomainDSL.g:5... |
4c848edbe28554ebaa29d569bccf3fa9 | approach 1 : DFS & Recursive Runtime : 0 ms | [
{
"docid": "801232575b47f5045fa8b30eddc886f5",
"score": "0.0",
"text": "public static TreeNode subtreeWithAllDeepest(TreeNode root) {\n if (root == null) {\n return null;\n }\n\n int leftDepth = depth(root.left);\n int rightDepth = depth(root.right);\n\n if ... | [
{
"docid": "482270383d65f917704392543b11cb0d",
"score": "0.7271152",
"text": "private static void dfs(int i , int j) {\n\tboolean f = false;\r\n\tfor(int k=0;k<adj[i].size();k++){\r\n\t\tint x = adj[i].get(k);\r\n\t\tif(x!=j){\r\n\t\t\tdist[x]=dist[i]+1;\r\n\t\t\tdfs(x,i);\r\n\t\t\tif(visitParent[x])\r\... |
273b060df63fb14bfa7b47ae56c674d9 | Inserts a TrueFalse question | [
{
"docid": "547a58765410038c25b0b0f70025f094",
"score": "0.642426",
"text": "@Override\r\n public void insertQuestion(String SurveyOrTest) {\r\n ioOutput.getOutput(\"Enter the prompt for your \" + questionType + \" Question: \");\r\n prompt = ioInput.checkEmpty();\r\n choices.add... | [
{
"docid": "2a8f94d26a59e102c300e185a83c386f",
"score": "0.65165806",
"text": "public void addTrueFalseQuestion(int questionNumber, String text,\r\n\t\t\tdouble points, boolean answer) {\r\n\t\tquestions.put(questionNumber,\r\n\t\t\t\tnew TrueFalseQuestion(text, points, answer));\r\n\t}",
"title": "... |
b79545ce083ef1862ecf42af9c887ffc | Receiver represents the request receiver string receiver = 2 [(.gogoproto.moretags) = "yaml:&92;"receiver&92;""]; | [
{
"docid": "1daffb38be22c68f58da2fcd5d6fd80a",
"score": "0.0",
"text": "public Builder setReceiverBytes(\n com.google.protobuf.ByteString value) {\n if (value == null) {\n throw new NullPointerException();\n }\n checkByteStringIsUtf8(value);\n \n receiver_ = value;\n ... | [
{
"docid": "6f23c9a5284893eeca112b85fb3ca557",
"score": "0.68601584",
"text": "public void setReceiver(String receiver) {\n\t\tthis.receiver = receiver == null ? null : receiver.trim();\n\t}",
"title": ""
},
{
"docid": "ad6a84941f050b505e87ea092e0dcf53",
"score": "0.67087966",
"text"... |
283f2e3be024815df6f4a4eba0b5837d | Set the UnpreparedCaster value. | [
{
"docid": "556b654135ca4022728abcd7c616a387",
"score": "0.7295892",
"text": "public void setUnpreparedCaster(boolean newUnpreparedCaster) {\n\t\tthis.unpreparedCaster = newUnpreparedCaster;\n\t}",
"title": ""
}
] | [
{
"docid": "98ded68abbdb51a1473ca8a7f72fa023",
"score": "0.6159387",
"text": "public boolean isUnpreparedCaster() {\n\t\treturn unpreparedCaster;\n\t}",
"title": ""
},
{
"docid": "f32de5bdebefca89f4c9cf5e3e28222c",
"score": "0.5295582",
"text": "protected final void internalMarkAsNot... |
3f682b60ca726a7c73973ebc82fa967f | This method was generated by MyBatis Generator. This method corresponds to the database table sys_metadata | [
{
"docid": "2787d8925d5eecae3423a3472c3eaf7f",
"score": "0.0",
"text": "int updateByPrimaryKey(SysMetadataDO record);",
"title": ""
}
] | [
{
"docid": "466ea8b94dafcabf89d9a36d04fa8238",
"score": "0.67382145",
"text": "TableMetadata metadata();",
"title": ""
},
{
"docid": "4e7a3d87ce43808713575c3246f59bf9",
"score": "0.6331333",
"text": "private void retTableMetaData() throws SQLException\n {\n DatabaseMetaData... |
56e3522434388afd8318b372ef3e2d5c | Delete a full row ( and it's index rows ) | [
{
"docid": "6eeda57611158dce5d4eb16c2b75a948",
"score": "0.5987282",
"text": "public void delete(String entityName, AbstractType rowKey) throws TransformationException, DataStoreIntegrationException, SerializationException;",
"title": ""
}
] | [
{
"docid": "459009941e661be899085c3c02d2eac6",
"score": "0.73130375",
"text": "public void deleteRow(int row) {\n rows.remove(row);\n }",
"title": ""
},
{
"docid": "6b3cf6a8e27fd4bf109c029a04b6e337",
"score": "0.73055065",
"text": "public void deleteRow(int row) {\n\t\tthis... |
99f4ccec7dd3aba56873313e017706ef | This test has a number of problems. 1. without the wait code in the for loop the create time for each instance was usually the same due to clock presision. 2. It's very hard to follow. | [
{
"docid": "6acdb9a3c16fab0e6bf866cca8170dc5",
"score": "0.545721",
"text": "public void DISABLEDtestEvictionSoftMinIdle() throws Exception {\n GenericObjectPool pool = null;\n \n class TimeTest extends BasePoolableObjectFactory {\n private final long createTime;\n ... | [
{
"docid": "970e92d58f33504a95ad590d49a4f372",
"score": "0.65513",
"text": "public static void main(String[] args) throws NoSuchMethodException, InvocationTargetException,\n\t\t\tInstantiationException, IllegalAccessException {\n\t\tfor (int i = 0; i < iterationsOfAllTests; i++) {\n\t\t\tlong javaNewTim... |
2f4140e71fd6fde46450b588b4cda9ce | Attach all data to the DOM Document passed in. | [
{
"docid": "31dd2dd5093ede2c750429434b2984be",
"score": "0.0",
"text": "public Element encode(Document aDocument) throws EPPEncodeException {\n\n try {\n //Validate States\n validateState();\n }\n catch (EPPCodecException e) {\n cat.error(\"EPPRgpEx... | [
{
"docid": "d56b594065c3a31a6fe3da51c614ea3d",
"score": "0.6066535",
"text": "public final void prepassDocument(DOM document) {\n setIndexSize(document.getSize());\n buildIDIndex(document);\n }",
"title": ""
},
{
"docid": "588cc12b8e78c71463eac0b1102b71bc",
"score": "0.5... |
d7a00cfd8f817833598980a444bef264 | Median key. If the tree has N keys k1 < k2 < k3 < ... < kN, then their median key is the element at position (N+1)/2 Asymptotic runtime: Theta(h), where h is the height of the tree Justification: When the median function is called, it makes a call to the method rank, which gets the rank of the highest value node in the... | [
{
"docid": "6a646222780aea17e32693c0aac17182",
"score": "0.80092627",
"text": "public Key median() {\n\t\tif (isEmpty())\n\t\t\treturn null;\n\t\tNode currentNode = root;\n\t\twhile (currentNode.right != null)\n\t\t\tcurrentNode = currentNode.right;\n\n\t\tint rankOfLargestKey = rank(currentNode.key);\n... | [
{
"docid": "7abdc57d616b6efc97d2826096810a49",
"score": "0.7222322",
"text": "public int recursiveMedian() {\n \n // list generation can create an empty list, this handles it\n if(n < 1) {\n return -1;\n }\n \n // index of the expected median\n ... |
0a436faac0510568eedacfdd14dfbaed | Generate a TAP file for every method tested | [
{
"docid": "384e5b34851709fd905ab3f9006b5f1e",
"score": "0.71515435",
"text": "protected void generateTAPPerMethod(ITestContext testContext) {\r\n List<ITestResult> testNGTestResults = TapTestNGUtil\r\n .getTestNGResultsOrderedByExecutionDate(resultMap);\r\n\r\n for (ITestRe... | [
{
"docid": "30cc09c4e75b59d723186d4a45af08b2",
"score": "0.62376755",
"text": "protected void generateTAPPerClass(ITestContext testContext) {\r\n List<ITestResult> testNGTestResults = TapTestNGUtil\r\n .getTestNGResultsOrderedByExecutionDate(this.resultMap);\r\n\r\n for (ITe... |
11fcd2f5fa724f09de29ed39f6583580 | Created for refactoring method 2 | [
{
"docid": "980b8e45664739854279fde576d4c26e",
"score": "0.0",
"text": "public abstract void readItem();",
"title": ""
}
] | [
{
"docid": "6b0e2e41d411b76c357d16b3eb3a159c",
"score": "0.58585733",
"text": "protected abstract void entschuldigen();",
"title": ""
},
{
"docid": "fb314e70bb3a93fa9517b4dd27193bd2",
"score": "0.5709324",
"text": "public void _Refactorings();",
"title": ""
},
{
"docid": ... |
14cdb4c505ba639d4a86fa9822aa538d | Returns the (i)th cursor of the given type, or null if no such cursor exists. Can be used for retrieving both cursors of type TYPE_DRAGGING, for example, by calling getCursorByType( MyCursor.TYPE_DRAGGING, 0 ) and getCursorByType( MyCursor.TYPE_DRAGGING, 1 ), when there may be cursors of other type present at the same ... | [
{
"docid": "87b192a94c5a8f31e762dbb8acebf614",
"score": "0.83834666",
"text": "public MyCursor getCursorByType(int type, int i) {\n for (int ii = 0; ii < cursors.size(); ++ii) {\n if (cursors.get(ii).getType() == type) {\n if (i == 0)\n return cursors.... | [
{
"docid": "fa41e11326a60d1f176e37b11ee973ca",
"score": "0.5802969",
"text": "private Cursor findCursor() {\n\t\tfor(Measure measure:getMeasures()) {\n\t\t\tfor(Voice voice:measure.getVoices()) {\n\t\t\t\tfor(VoiceItem item:voice.getItems()) {\n\t\t\t\t\tif(item instanceof Cursor) {\n\t\t\t\t\t\treturn ... |
8a6057852aaa3d1779b341b4678da9d1 | / access modifiers changed from: 0000 | [
{
"docid": "de125d37623d36319212739aeeabccaa",
"score": "0.0",
"text": "public void onAnchorReady(Recycler recycler, State state, AnchorInfo anchorInfo, int i) {\n Recycler recycler2 = recycler;\n State state2 = state;\n AnchorInfo anchorInfo2 = anchorInfo;\n int itemDirectio... | [
{
"docid": "ff86c3e5dba10aeeb57d62c4db80a220",
"score": "0.65839547",
"text": "protected abstract Object m8602a();",
"title": ""
},
{
"docid": "d93c74d91cdd5fd7d5ba828e7409b39e",
"score": "0.64764357",
"text": "private AccessPrivate() {\n }",
"title": ""
},
{
"docid": "6... |
2704b67ba3ea26c7eb330f713c37a996 | This method was generated by Abator for iBATIS. This method returns the value of the database column TB_IC_CARD_INVOICE_APPLY.RECEIVER_NAME | [
{
"docid": "31deec0559278520d6ce07d8ac871c2a",
"score": "0.637488",
"text": "public String getReceiverName() {\r\n\t\treturn receiverName;\r\n\t}",
"title": ""
}
] | [
{
"docid": "5b6c8c886868ce2ea5366d894ce51bef",
"score": "0.64096564",
"text": "public static String fieldReceiverName() {\r\n\t\treturn \"RECEIVER_NAME\";\r\n\t}",
"title": ""
},
{
"docid": "8799ce4942d1b5b5fc40099e0d294e3f",
"score": "0.63197726",
"text": "public String getReceiverN... |
e98e9915c6bf82addbb1b1e5e0a39a09 | permite cerrar la ventana de editar y crear | [
{
"docid": "3ad8e14387d90032347f3e2c01cdb34f",
"score": "0.0",
"text": "@FXML\n\tprivate void cancelar() {\n\t\tescenarioEditar.close();\n\t}",
"title": ""
}
] | [
{
"docid": "4c06aff919bba9d22961593682ccb3de",
"score": "0.6912413",
"text": "public String editar()\r\n/* 67: */ {\r\n/* 68:109 */ if (this.unidad.getIdUnidad() > 0)\r\n/* 69: */ {\r\n/* 70:110 */ setEditado(true);\r\n/* 71:111 */ this.unidad = this.servicioUnidad.carga... |
07e2df9e911a42b3b2959fe42cc67733 | Method that add keyvalue to the trie. This is recursive method that build sequence of nodes that has linked between each other | [
{
"docid": "b21364fc8c57082598a5dd9563153743",
"score": "0.64803183",
"text": "private Node add(Node node, String key, Integer val, int d) {\r\n\t\tif (node == null) {\r\n\t\t\tnode = new Node();\r\n\t\t}\r\n\t\tif (d == key.length()) { //\r\n\t\t\tnode.value = val;\r\n\t\t\treturn node;\r\n\t\t}\r\n\t\... | [
{
"docid": "67ae2d6abd8bb2e5caafd7fc0ba31ea7",
"score": "0.70195013",
"text": "public void addChild(String key, String value) {\n int childPosition = getFirstCharCode(key);\n\n if (children[childPosition] == null) {\n children[childPosition] = new TrieNode(key.charAt(0));\n ... |