Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 121 for bias (0.04 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/idn/Punycode.kt

                  when {
                    k <= bias -> TMIN
                    k >= bias + TMAX -> TMAX
                    else -> k - bias
                  }
                if (q < t) break
                result.writeByte((t + ((q - t) % (BASE - t))).punycodeDigit)
                q = (q - t) / (BASE - t)
              }
    
              result.writeByte(q.punycodeDigit)
              bias = adapt(delta, h + 1, h == b)
              delta = 0
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 8.6K bytes
    - Click Count (0)
  2. guava-tests/benchmark/com/google/common/collect/ConcurrentHashMultisetBenchmark.java

        Random random = new Random();
        int nKeys = keys.size();
        long blah = 0;
        for (int i = 0; i < reps; i++) {
          Integer key = keys.get(random.nextInt(nKeys));
          // This range is [-5, 4] - slight negative bias so we often hit zero, which brings the
          // auto-removal of zeroes into play.
          int delta = random.nextInt(10) - 5;
          blah += delta;
          if (delta >= 0) {
            multiset.add(key, delta);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Jul 14 14:44:08 GMT 2025
    - 16.6K bytes
    - Click Count (0)
  3. doc/go_spec.html

    implementation must:
    </p>
    
    <ul>
    	<li>Represent integer constants with at least 256 bits.</li>
    
    	<li>Represent floating-point constants, including the parts of
    	    a complex constant, with a mantissa of at least 256 bits
    	    and a signed binary exponent of at least 16 bits.</li>
    
    	<li>Give an error if unable to represent an integer constant
    	    precisely.</li>
    
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Wed Apr 01 23:39:18 GMT 2026
    - 287.8K bytes
    - Click Count (1)
  4. docs/en/docs/release-notes.md

    * 🌐 Add Indonesian translation for `docs/id/docs/tutorial/index.md`. PR [#4705](https://github.com/tiangolo/fastapi/pull/4705) by [@bas-baskara](https://github.com/bas-baskara).
    * 🌐 Add Persian translation for `docs/fa/docs/index.md` and tweak right-to-left CSS. PR [#2395](https://github.com/tiangolo/fastapi/pull/2395) by [@mohsen-mahmoodi](https://github.com/mohsen-mahmoodi).
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Apr 03 12:07:04 GMT 2026
    - 631K bytes
    - Click Count (0)
  5. lib/fips140/v1.26.0.zip

    errors.New("edwards25519: invalid field element input size") } // Bits 0:51 (bytes 0:8, bits 0:64, shift 0, mask 51). v.l0 = byteorder.LEUint64(x[0:8]) v.l0 &= maskLow51Bits // Bits 51:102 (bytes 6:14, bits 48:112, shift 3, mask 51). v.l1 = byteorder.LEUint64(x[6:14]) >> 3 v.l1 &= maskLow51Bits // Bits 102:153 (bytes 12:20, bits 96:160, shift 6, mask 51). v.l2 = byteorder.LEUint64(x[12:20]) >> 6 v.l2 &= maskLow51Bits // Bits 153:204 (bytes 19:27, bits 152:216, shift 1, mask 51). v.l3 = byteorder.LEUint64(x[19:27])...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Jan 08 17:58:32 GMT 2026
    - 660.3K bytes
    - Click Count (0)
  6. 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)
  7. 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)
  8. android/guava/src/com/google/common/math/DoubleUtils.java

      static long getSignificand(double d) {
        checkArgument(isFinite(d), "not a normal value");
        int exponent = getExponent(d);
        long bits = doubleToRawLongBits(d);
        bits &= SIGNIFICAND_MASK;
        return (exponent == MIN_EXPONENT - 1) ? bits << 1 : bits | IMPLICIT_BIT;
      }
    
      static boolean isFinite(double d) {
        return getExponent(d) <= MAX_EXPONENT;
      }
    
      static boolean isNormal(double d) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 03 04:51:56 GMT 2026
    - 5K bytes
    - Click Count (0)
  9. internal/hash/crc.go

    	for n := 1; n < 32; n++ {
    		odd[n] = row
    		row <<= 1
    	}
    
    	// put operator for two zero bits in even
    	gf2MatrixSquare(even, odd)
    
    	// put operator for four zero bits in odd
    	gf2MatrixSquare(odd, even)
    
    	// apply len2 zeros to crc1 (first square will put the operator for one
    	// zero byte, eight zero bits, in even)
    	crc1n := uint64(crc1)
    	for {
    		// apply zeros operator for this bit of len2
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Mon Jan 20 14:49:07 GMT 2025
    - 5.8K bytes
    - Click Count (0)
  10. src/main/java/jcifs/smb1/smb1/ACE.java

     * the operation and the desired access bits are compared to the SID
     * and access mask of each ACE. If the SID matches, the allow/deny flags
     * and access mask are considered. If the ACE is a "deny"
     * ACE and <i>any</i> of the desired access bits match bits in the access
     * mask of the ACE, the whole access check fails. If the ACE is an "allow"
     * ACE and <i>all</i> of the bits in the desired access bits match bits in
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 8.8K bytes
    - Click Count (0)
Back to Top