Search Options

Results per page
Sort
Preferred Languages
Advance

Results 41 - 50 of 94 for nextLine (0.09 sec)

  1. android/guava-tests/test/com/google/common/primitives/UnsignedBytesTest.java

          for (int trials = 10; trials-- > 0; ) {
            byte[] left = new byte[1 + rnd.nextInt(32)];
            rnd.nextBytes(left);
            byte[] right = left.clone();
            assertThat(comparator.compare(left, right)).isEqualTo(0);
            int i = rnd.nextInt(left.length);
            left[i] ^= (byte) (1 + rnd.nextInt(255));
            assertThat(comparator.compare(left, right)).isNotEqualTo(0);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 19:07:49 UTC 2024
    - 13.4K bytes
    - Viewed (0)
  2. src/main/java/org/codelibs/core/net/UuidUtil.java

            buf.append(BASE);
            final int lowTime = (int) (System.currentTimeMillis() >> 32);
            StringUtil.appendHex(buf, lowTime);
            StringUtil.appendHex(buf, RANDOM.nextInt());
            return buf.toString();
        }
    
        private static byte[] getAddress() {
            try {
                return InetAddress.getLocalHost().getAddress();
            } catch (final UnknownHostException ignore) {
    Registered: Fri Nov 01 20:58:10 UTC 2024
    - Last Modified: Thu Mar 07 01:59:08 UTC 2024
    - 1.8K bytes
    - Viewed (0)
  3. android/guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java

        for (int i = 0; i < reps; i++) {
          dummy += cache.getUnchecked(nextRandomKey());
        }
        requests.addAndGet(reps);
        return dummy;
      }
    
      private int nextRandomKey() {
        int a = random.nextInt(max);
    
        /*
         * For example, if concentration=2.0, the following takes the square root of
         * the uniformly-distributed random integer, then truncates any fractional
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 3.4K bytes
    - Viewed (0)
  4. android/guava-tests/benchmark/com/google/common/collect/SortedCopyBenchmark.java

      void setUp() {
        checkArgument(size > 0, "empty collection not supported");
        Set<Integer> set = new LinkedHashSet<>(size);
    
        Random random = new Random();
        while (set.size() < size) {
          set.add(random.nextInt());
        }
        List<Integer> list = new ArrayList<>(set);
        inputOrder.arrange(list);
        input = ImmutableList.copyOf(list);
      }
    
      @Benchmark
      int collections(int reps) {
        int dummy = 0;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 3.5K bytes
    - Viewed (0)
  5. src/main/java/org/codelibs/fess/sso/aad/AzureAdAuthenticator.java

                            }
                        }
                    }
                    final String nextLink = (String) contentMap.get("@odata.nextLink");
                    if (StringUtil.isNotBlank(nextLink)) {
                        processMemberOf(user, groupList, roleList, nextLink);
                    }
                } else if (contentMap.containsKey("error")) {
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Thu Feb 22 01:53:18 UTC 2024
    - 28.2K bytes
    - Viewed (0)
  6. android/guava-tests/test/com/google/common/hash/Murmur3Hash32Test.java

      public void testEncodedStringInputs() {
        Random rng = new Random(0);
        for (int z = 0; z < 100; z++) {
          int[] codePoints = new int[rng.nextInt(8)];
          for (int i = 0; i < codePoints.length; i++) {
            do {
              codePoints[i] = rng.nextInt(0x800);
            } while (!Character.isValidCodePoint(codePoints[i])
                || (codePoints[i] >= Character.MIN_SURROGATE
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 19:29:46 UTC 2024
    - 8.3K bytes
    - Viewed (0)
  7. guava-tests/test/com/google/common/io/ByteSourceTester.java

          // if expected.length == 0, off has to be 0 but length doesn't matter--result will be empty
          int off = expected.length == 0 ? 0 : random.nextInt(expected.length);
          int len = expected.length == 0 ? 4 : random.nextInt(expected.length - off);
    
          ByteSourceFactory sliced = SourceSinkFactories.asSlicedByteSourceFactory(factory, off, len);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 23 14:22:54 UTC 2024
    - 8.6K bytes
    - Viewed (0)
  8. guava-tests/test/com/google/common/hash/BloomFilterTest.java

          new ThreadLocal<Random>() {
            @Override
            protected Random initialValue() {
              return new Random();
            }
          };
    
      private static final int GOLDEN_PRESENT_KEY = random.get().nextInt();
    
      @AndroidIncompatible // OutOfMemoryError
      public void testLargeBloomFilterDoesntOverflow() {
        long numBits = Integer.MAX_VALUE;
        numBits++;
    
        LockFreeBitArray bitArray = new LockFreeBitArray(numBits);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Oct 21 14:28:19 UTC 2024
    - 21.2K bytes
    - Viewed (0)
  9. guava-tests/test/com/google/common/collect/CollectionBenchmarkSampleData.java

        Set<Element> set = Sets.newHashSetWithExpectedSize(size);
        while (set.size() < size) {
          set.add(newElement());
        }
        return set;
      }
    
      private Element newElement() {
        int value = random.nextInt();
        return isUserTypeFast ? new Element(value) : new SlowElement(value);
      }
    
      static class Element implements Comparable<Element> {
        final int hash;
    
        Element(int hash) {
          this.hash = hash;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 4.1K bytes
    - Viewed (0)
  10. guava-tests/benchmark/com/google/common/collect/HashMultisetAddPresentBenchmark.java

        multisets.clear();
        for (int i = 0; i < ARRAY_SIZE; i++) {
          HashMultiset<Integer> multiset = HashMultiset.<Integer>create();
          multisets.add(multiset);
          queries[i] = random.nextInt();
          multiset.add(queries[i]);
        }
      }
    
      @Benchmark
      int add(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 1.6K bytes
    - Viewed (0)
Back to top