Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 106 for bits (0.02 seconds)

  1. api/go1.9.txt

    pkg math/bits (windows-amd64), const UintSize = 64
    pkg math/bits, const UintSize ideal-int
    pkg math/bits, func LeadingZeros(uint) int
    pkg math/bits, func LeadingZeros16(uint16) int
    pkg math/bits, func LeadingZeros32(uint32) int
    pkg math/bits, func LeadingZeros64(uint64) int
    pkg math/bits, func LeadingZeros8(uint8) int
    pkg math/bits, func Len(uint) int
    pkg math/bits, func Len16(uint16) int
    pkg math/bits, func Len32(uint32) int
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Mon Oct 04 20:20:20 GMT 2021
    - 10.7K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/hash/Hashing.java

      public static HashFunction goodFastHash(int minimumBits) {
        int bits = checkPositiveAndMakeMultipleOf32(minimumBits);
    
        if (bits == 32) {
          return Murmur3_32HashFunction.GOOD_FAST_HASH_32;
        }
        if (bits <= 128) {
          return Murmur3_128HashFunction.GOOD_FAST_HASH_128;
        }
    
        // Otherwise, join together some 128-bit murmur3s
        int hashFunctionsNeeded = (bits + 127) / 128;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Jul 17 15:26:41 GMT 2025
    - 29.8K bytes
    - Click Count (0)
  3. guava-tests/test/com/google/common/hash/HashingTest.java

        assertEquals(
            Hashing.md5().bits() + Hashing.md5().bits(),
            Hashing.concatenating(asList(Hashing.md5(), Hashing.md5())).bits());
        assertEquals(
            Hashing.md5().bits() + Hashing.murmur3_32().bits(),
            Hashing.concatenating(asList(Hashing.md5(), Hashing.murmur3_32())).bits());
        assertEquals(
            Hashing.md5().bits() + Hashing.murmur3_32().bits() + Hashing.murmur3_128().bits(),
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Mar 13 13:01:07 GMT 2026
    - 26.7K bytes
    - Click Count (2)
  4. android/guava/src/com/google/common/hash/BloomFilterStrategies.java

            LockFreeBitArray bits) {
          long bitSize = bits.bitSize();
          long hash64 = murmur3_128().hashObject(object, funnel).asLong();
          int hash1 = (int) hash64;
          int hash2 = (int) (hash64 >>> 32);
    
          boolean bitsChanged = false;
          for (int i = 1; i <= numHashFunctions; i++) {
            int combinedHash = hash1 + (i * hash2);
            // Flip all the bits if it's negative (guaranteed positive number)
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 10.7K bytes
    - Click Count (0)
  5. api/go1.12.txt

    pkg log, method (*Logger) Writer() io.Writer
    pkg math/bits, func Add(uint, uint, uint) (uint, uint)
    pkg math/bits, func Add32(uint32, uint32, uint32) (uint32, uint32)
    pkg math/bits, func Add64(uint64, uint64, uint64) (uint64, uint64)
    pkg math/bits, func Div(uint, uint, uint) (uint, uint)
    pkg math/bits, func Div32(uint32, uint32, uint32) (uint32, uint32)
    pkg math/bits, func Div64(uint64, uint64, uint64) (uint64, uint64)
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Wed Jan 02 21:21:53 GMT 2019
    - 13.5K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/hash/HashCode.java

    import org.jspecify.annotations.Nullable;
    
    /**
     * An immutable hash code of arbitrary bit length.
     *
     * @author Dimitris Andreou
     * @author Kurt Alfred Kluever
     * @since 11.0
     */
    public abstract class HashCode {
      HashCode() {}
    
      /** Returns the number of bits in this hash code; a positive multiple of 8. */
      public abstract int bits();
    
      /**
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Aug 11 19:31:30 GMT 2025
    - 12.6K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/hash/BloomFilter.java

            @ParametricNullness T object,
            Funnel<? super T> funnel,
            int numHashFunctions,
            LockFreeBitArray bits);
    
        /**
         * Queries {@code numHashFunctions} bits of the given bit array, by hashing a user element;
         * returns {@code true} if and only if all selected bits are set.
         */
        <T extends @Nullable Object> boolean mightContain(
            @ParametricNullness T object,
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 10 22:28:12 GMT 2026
    - 27.6K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/math/BigIntegerMath.java

        long numeratorAccum = n;
        long denominatorAccum = 1;
    
        int bits = LongMath.log2(n, CEILING);
    
        int numeratorBits = bits;
    
        for (int i = 1; i < k; i++) {
          int p = n - i;
          int q = i + 1;
    
          // log2(p) >= bits - 1, because p >= n/2
    
          if (numeratorBits + bits >= Long.SIZE - 1) {
            // The numerator is as big as it can get without risking overflow.
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 18.8K bytes
    - Click Count (0)
  9. guava-tests/test/com/google/common/hash/HashTestUtils.java

       * Test for avalanche with 2-bit deltas. Most probabilities of output bit(j) differing are well
       * within 50%.
       */
      static void check2BitAvalanche(HashFunction function, int trials, double epsilon) {
        Random rand = new Random(0);
        int keyBits = 32;
        int hashBits = function.bits();
        for (int bit1 = 0; bit1 < keyBits; bit1++) {
          for (int bit2 = 0; bit2 < keyBits; bit2++) {
            if (bit2 <= bit1) continue;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Oct 28 18:19:59 GMT 2025
    - 25.6K bytes
    - Click Count (0)
  10. tensorflow/c/eager/dlpack.cc

      switch (dtype.code) {
        case DLDataTypeCode::kDLBool:
          if (dtype.bits != 8) {
            return tensorflow::errors::InvalidArgument(
                "Only DLPack bools of bitwidth 8 are supported, got: ", dtype.bits);
          }
          *tf_dtype = TF_DataType::TF_BOOL;
          return absl::OkStatus();
    
        case DLDataTypeCode::kDLUInt:
          switch (dtype.bits) {
            case 8:
              *tf_dtype = TF_DataType::TF_UINT8;
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Thu Mar 13 23:41:52 GMT 2025
    - 13K bytes
    - Click Count (0)
Back to Top