Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for numbytes (1.13 sec)

  1. android/guava-tests/test/com/google/common/base/Utf8Test.java

        byte[] bytes = new byte[numBytes];
        if (lim == -1) {
          lim = 1L << (numBytes * 8);
        }
        long countRoundTripped = 0;
        for (long byteChar = start; byteChar < lim; byteChar++) {
          long tmpByteChar = byteChar;
          for (int i = 0; i < numBytes; i++) {
            bytes[bytes.length - i - 1] = (byte) tmpByteChar;
            tmpByteChar = tmpByteChar >> 8;
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Fri Feb 09 15:49:48 GMT 2024
    - 12.7K bytes
    - Viewed (0)
  2. guava-tests/test/com/google/common/base/Utf8Test.java

        byte[] bytes = new byte[numBytes];
        if (lim == -1) {
          lim = 1L << (numBytes * 8);
        }
        long countRoundTripped = 0;
        for (long byteChar = start; byteChar < lim; byteChar++) {
          long tmpByteChar = byteChar;
          for (int i = 0; i < numBytes; i++) {
            bytes[bytes.length - i - 1] = (byte) tmpByteChar;
            tmpByteChar = tmpByteChar >> 8;
    Java
    - Registered: Fri Apr 19 12:43:09 GMT 2024
    - Last Modified: Fri Feb 09 15:49:48 GMT 2024
    - 12.7K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/net/InetAddresses.java

        int numBytes = isIpv6 ? 16 : 4;
    
        byte[] addressBytes = address.toByteArray();
        byte[] targetCopyArray = new byte[numBytes];
    
        int srcPos = Math.max(0, addressBytes.length - numBytes);
        int copyLength = addressBytes.length - srcPos;
        int destPos = numBytes - copyLength;
    
        // Check the extra bytes in the BigInteger are all zero.
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Fri Dec 15 19:31:54 GMT 2023
    - 44K bytes
    - Viewed (1)
  4. android/guava/src/com/google/common/hash/BloomFilter.java

         */
        long numBits = optimalNumOfBits(expectedInsertions, fpp);
        int numHashFunctions = optimalNumOfHashFunctions(expectedInsertions, numBits);
        try {
          return new BloomFilter<>(new LockFreeBitArray(numBits), numHashFunctions, funnel, strategy);
        } catch (IllegalArgumentException e) {
          throw new IllegalArgumentException("Could not create BloomFilter of " + numBits + " bits", e);
        }
      }
    
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Mon Apr 01 16:15:01 GMT 2024
    - 23.1K bytes
    - Viewed (0)
Back to top