Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 51 for nextLine (0.18 sec)

  1. compat/maven-builder-support/src/test/java/org/apache/maven/building/StringSourceTest.java

            StringSource source = new StringSource("Hello World!");
    
            try (InputStream is = source.getInputStream();
                    Scanner scanner = new Scanner(is)) {
                assertEquals("Hello World!", scanner.nextLine());
            }
        }
    
        @Test
        void testGetLocation() {
            StringSource source = new StringSource("Hello World!");
            assertEquals("(memory)", source.getLocation());
    
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 1.8K bytes
    - Viewed (0)
  2. compat/maven-builder-support/src/test/java/org/apache/maven/building/UrlSourceTest.java

            UrlSource source = new UrlSource(txtFile);
            try (InputStream is = source.getInputStream();
                    Scanner scanner = new Scanner(is)) {
                assertEquals("Hello World!", scanner.nextLine());
            }
        }
    
        @Test
        void testGetLocation() throws Exception {
            URL txtFile = new File("target/test-classes/source.txt").toURI().toURL();
            UrlSource source = new UrlSource(txtFile);
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 2K bytes
    - Viewed (0)
  3. compat/maven-builder-support/src/test/java/org/apache/maven/building/FileSourceTest.java

            FileSource source = new FileSource(txtFile);
    
            try (InputStream is = source.getInputStream();
                    Scanner scanner = new Scanner(is)) {
    
                assertEquals("Hello World!", scanner.nextLine());
            }
        }
    
        @Test
        void testGetLocation() {
            File txtFile = new File("target/test-classes/source.txt");
            FileSource source = new FileSource(txtFile);
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 2.2K bytes
    - Viewed (0)
  4. guava-tests/test/com/google/common/hash/HashTestUtils.java

            int len = random.nextInt(value.length - off + 1);
            for (PrimitiveSink sink : sinks) {
              sink.putBytes(value, off, len);
            }
          }
        },
        PUT_BYTE_BUFFER() {
          @Override
          void performAction(Random random, Iterable<? extends PrimitiveSink> sinks) {
            byte[] value = new byte[random.nextInt(128)];
            random.nextBytes(value);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 23 14:22:54 UTC 2024
    - 25.5K bytes
    - Viewed (0)
  5. buildscripts/verify-healing.sh

    		return 1
    	fi
    
    	for ((i = 0; i < 20; i++)); do
    		test -f ${WORK_DIR}/$1/1/.minio.sys/format.json
    		v1=$?
    		nextInES=$(($1 + 1)) && [ $nextInES -gt 3 ] && nextInES=1
    		foundFiles1=$(find ${WORK_DIR}/$1/1/ | grep -v .minio.sys | grep xl.meta | wc -l)
    		foundFiles2=$(find ${WORK_DIR}/$nextInES/1/ | grep -v .minio.sys | grep xl.meta | wc -l)
    		test $foundFiles1 -eq $foundFiles2
    		v2=$?
    		[ $v1 == 0 -a $v2 == 0 ] && return 0
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Jul 12 20:51:54 UTC 2024
    - 4K bytes
    - Viewed (0)
  6. guava-tests/test/com/google/common/collect/ConcurrentHashMultisetBasherTest.java

          for (int i = 0; i < iterations; i++) {
            int keyIndex = random.nextInt(nKeys);
            String key = keys.get(keyIndex);
            Operation op = operations[random.nextInt(operations.length)];
            switch (op) {
              case ADD:
                {
                  int delta = random.nextInt(10);
                  multiset.add(key, delta);
                  deltas[keyIndex] += delta;
                  break;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 5.9K bytes
    - Viewed (0)
  7. android/guava-tests/test/com/google/common/primitives/ImmutableDoubleArrayTest.java

            double num = RANDOM.nextInt(10);
            for (int i = 0; i < num; i++) {
              list.add((double) counter.getAndIncrement());
            }
            builder.addAll(iterable(list));
          }
        },
        ADD_STREAM {
          @Override
          void doIt(ImmutableDoubleArray.Builder builder, AtomicInteger counter) {
            double[] array = new double[RANDOM.nextInt(10)];
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 25 18:05:56 UTC 2024
    - 21.2K bytes
    - Viewed (0)
  8. android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java

        for (int i = 0; i < heapSize; i++) {
          mmHeap.add(random.nextInt());
        }
        for (int i = 0; i < numberOfModifications; i++) {
          mmHeap.removeAt(random.nextInt(mmHeap.size()));
          assertIntactUsingSeed(seed, mmHeap);
          mmHeap.add(random.nextInt());
          assertIntactUsingSeed(seed, mmHeap);
        }
      }
    
      public void testRemoveAt_exhaustive() {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 35.9K bytes
    - Viewed (0)
  9. android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

      int factorialBound;
    
      @BeforeExperiment
      void setUp() {
        for (int i = 0; i < ARRAY_SIZE; i++) {
          factorials[i] = RANDOM_SOURCE.nextInt(factorialBound);
          slowFactorials[i] = RANDOM_SOURCE.nextInt(factorialBound);
          binomials[i] = RANDOM_SOURCE.nextInt(factorials[i] + 1);
        }
      }
    
      /** Previous version of BigIntegerMath.factorial, kept for timing purposes. */
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Aug 19 16:21:24 UTC 2024
    - 3.4K bytes
    - Viewed (0)
  10. guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

      int factorialBound;
    
      @BeforeExperiment
      void setUp() {
        for (int i = 0; i < ARRAY_SIZE; i++) {
          factorials[i] = RANDOM_SOURCE.nextInt(factorialBound);
          slowFactorials[i] = RANDOM_SOURCE.nextInt(factorialBound);
          binomials[i] = RANDOM_SOURCE.nextInt(factorials[i] + 1);
        }
      }
    
      /** Previous version of BigIntegerMath.factorial, kept for timing purposes. */
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Aug 19 16:21:24 UTC 2024
    - 3.4K bytes
    - Viewed (0)
Back to top