Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for highestOneBit (0.06 sec)

  1. guava/src/com/google/common/collect/Hashing.java

        // Get the recommended table size.
        // Round down to the nearest power of 2.
        expectedEntries = max(expectedEntries, 2);
        int tableSize = Integer.highestOneBit(expectedEntries);
        // Check to make sure that we will not exceed the maximum load factor.
        if (expectedEntries > (int) (loadFactor * tableSize)) {
          tableSize <<= 1;
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 2.5K bytes
    - Viewed (0)
  2. android/guava-tests/benchmark/com/google/common/base/StringsRepeatBenchmark.java

            throw new RuntimeException("Wrong length: " + x);
          }
        }
      }
    
      private static String mikeRepeat(String string, int count) {
        int len = string.length();
        char[] strCopy = new char[len * Integer.highestOneBit(count)];
        string.getChars(0, len, strCopy, 0);
    
        char[] array = new char[len * count];
    
        int strCopyLen = len;
        int pos = 0;
        while (count != 0) {
          if ((count & 1) != 0) {
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 3.4K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/collect/Hashing.java

        // Get the recommended table size.
        // Round down to the nearest power of 2.
        expectedEntries = max(expectedEntries, 2);
        int tableSize = Integer.highestOneBit(expectedEntries);
        // Check to make sure that we will not exceed the maximum load factor.
        if (expectedEntries > (int) (loadFactor * tableSize)) {
          tableSize <<= 1;
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 2.5K bytes
    - Viewed (0)
  4. guava-tests/benchmark/com/google/common/base/StringsRepeatBenchmark.java

            throw new RuntimeException("Wrong length: " + x);
          }
        }
      }
    
      private static String mikeRepeat(String string, int count) {
        int len = string.length();
        char[] strCopy = new char[len * Integer.highestOneBit(count)];
        string.getChars(0, len, strCopy, 0);
    
        char[] array = new char[len * count];
    
        int strCopyLen = len;
        int pos = 0;
        while (count != 0) {
          if ((count & 1) != 0) {
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 3.4K bytes
    - Viewed (0)
  5. guava/src/com/google/common/collect/CompactHashing.java

      }
    
      /** Creates and returns a properly-sized array with the given number of buckets. */
      static Object createTable(int buckets) {
        if (buckets < 2
            || buckets > Ints.MAX_POWER_OF_TWO
            || Integer.highestOneBit(buckets) != buckets) {
          throw new IllegalArgumentException("must be power of 2 between 2^1 and 2^30: " + buckets);
        }
        if (buckets <= BYTE_MAX_SIZE) {
          return new byte[buckets];
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 7K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/collect/CompactHashing.java

      }
    
      /** Creates and returns a properly-sized array with the given number of buckets. */
      static Object createTable(int buckets) {
        if (buckets < 2
            || buckets > Ints.MAX_POWER_OF_TWO
            || Integer.highestOneBit(buckets) != buckets) {
          throw new IllegalArgumentException("must be power of 2 between 2^1 and 2^30: " + buckets);
        }
        if (buckets <= BYTE_MAX_SIZE) {
          return new byte[buckets];
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 7K bytes
    - Viewed (0)
Back to top