Search Options

Results per page
Sort
Preferred Languages
Advance

Results 41 - 50 of 64 for IEEE (0.03 sec)

  1. src/net/interface.go

    	Index        int          // positive integer that starts at one, zero is never used
    	MTU          int          // maximum transmission unit
    	Name         string       // e.g., "en0", "lo0", "eth0.100"
    	HardwareAddr HardwareAddr // IEEE MAC-48, EUI-48 and EUI-64 form
    	Flags        Flags        // e.g., FlagUp, FlagLoopback, FlagMulticast
    }
    
    type Flags uint
    
    const (
    	FlagUp           Flags = 1 << iota // interface is administratively up
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 01:16:53 UTC 2024
    - 7.6K bytes
    - Viewed (0)
  2. platforms/documentation/docs/src/snippets/native-binaries/google-test/groovy/libs/googleTest/1.7.0/include/gtest/internal/gtest-internal.h

    // two floating-points will be equal exactly.  Hence a naive
    // comparison by the == operation often doesn't work.)
    //
    // Format of IEEE floating-point:
    //
    //   The most-significant bit being the leftmost, an IEEE
    //   floating-point looks like
    //
    //     sign_bit exponent_bits fraction_bits
    //
    //   Here, sign_bit is a single bit that designates the sign of the
    //   number.
    //
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Mon Nov 27 17:53:42 UTC 2023
    - 43.1K bytes
    - Viewed (0)
  3. src/internal/fuzz/encoding_test.go

    rune('œ')
    byte('K')
    byte('ÿ')
    []byte("hello¿")
    []byte("a")
    bool(true)
    string("hello\\xbd\\xb2=\\xbc ⌘")
    float64(-12.5)
    float32(2.5)`,
    		},
    		{
    			desc: "float edge cases",
    			// The two IEEE 754 bit patterns used for the math.Float{64,32}frombits
    			// encodings are non-math.NAN quiet-NaN values. Since they are not equal
    			// to math.NaN(), they should be re-encoded to their bit patterns. They
    			// are, respectively:
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Mar 07 00:20:34 UTC 2024
    - 8.2K bytes
    - Viewed (0)
  4. src/compress/gzip/gunzip.go

    // marking the end of the data.
    type Reader struct {
    	Header       // valid after NewReader or Reader.Reset
    	r            flate.Reader
    	decompressor io.ReadCloser
    	digest       uint32 // CRC-32, IEEE polynomial (section 8)
    	size         uint32 // Uncompressed size (section 2.3.1)
    	buf          [512]byte
    	err          error
    	multistream  bool
    }
    
    // NewReader creates a new [Reader] reading the given reader.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Oct 13 23:20:03 UTC 2023
    - 8.5K bytes
    - Viewed (0)
  5. src/math/all_test.go

    	1,               // pow(-1, -Inf) IEEE 754-2008
    	1,               // pow(-1, +Inf) IEEE 754-2008
    	NaN(),           // pow(-1, NaN)
    	Inf(1),          // pow(-1/2, -Inf)
    	0,               // pow(-1/2, +Inf)
    	Inf(1),          // pow(-0, -Inf)
    	Inf(1),          // pow(-0, -Pi)
    	Inf(1),          // pow(-0, -0.5)
    	Inf(-1),         // pow(-0, -3) IEEE 754-2008
    	Copysign(0, -1), // pow(-0, 3) IEEE 754-2008
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Jul 07 17:39:26 UTC 2023
    - 86.8K bytes
    - Viewed (0)
  6. src/math/big/arith.go

    		c += z1
    	}
    	return
    }
    
    // q = ( x1 << _W + x0 - r)/y. m = floor(( _B^2 - 1 ) / d - _B). Requiring x1<y.
    // An approximate reciprocal with a reference to "Improved Division by Invariant Integers
    // (IEEE Transactions on Computers, 11 Jun. 2010)"
    func divWW(x1, x0, y, m Word) (q, r Word) {
    	s := nlz(y)
    	if s != 0 {
    		x1 = x1<<s | x0>>(_W-s)
    		x0 <<= s
    		y <<= s
    	}
    	d := uint(y)
    	// We know that
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Apr 28 20:09:27 UTC 2022
    - 8.3K bytes
    - Viewed (0)
  7. internal/hash/checksum.go

    	ChecksumTrailing ChecksumType = 1 << iota
    
    	// ChecksumSHA256 indicates a SHA256 checksum.
    	ChecksumSHA256
    	// ChecksumSHA1 indicates a SHA-1 checksum.
    	ChecksumSHA1
    	// ChecksumCRC32 indicates a CRC32 checksum with IEEE table.
    	ChecksumCRC32
    	// ChecksumCRC32C indicates a CRC32 checksum with Castagnoli table.
    	ChecksumCRC32C
    	// ChecksumInvalid indicates an invalid checksum.
    	ChecksumInvalid
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Wed May 08 16:18:34 UTC 2024
    - 12.6K bytes
    - Viewed (0)
  8. src/strconv/ftoa.go

    	}
    	lower := new(decimal)
    	lower.Assign(mantlo*2 + 1)
    	lower.Shift(explo - int(flt.mantbits) - 1)
    
    	// The upper and lower bounds are possible outputs only if
    	// the original mantissa is even, so that IEEE round-to-even
    	// would round to the original mantissa and not the neighbors.
    	inclusive := mant%2 == 0
    
    	// As we walk the digits we want to know whether rounding up would fall
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Apr 04 14:21:28 UTC 2024
    - 13.9K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/math/BigIntegerMath.java

       * will return {@code Double.MAX_VALUE}, not {@code Double.POSITIVE_INFINITY}.
       *
       * <p>For the case of {@link RoundingMode#HALF_EVEN}, this implementation uses the IEEE 754
       * default rounding mode: if the two nearest representable values are equally near, the one with
       * the least significant bit zero is chosen. (In such cases, both of the nearest representable
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Wed Feb 07 17:50:39 UTC 2024
    - 18.9K bytes
    - Viewed (0)
  10. guava/src/com/google/common/math/BigIntegerMath.java

       * will return {@code Double.MAX_VALUE}, not {@code Double.POSITIVE_INFINITY}.
       *
       * <p>For the case of {@link RoundingMode#HALF_EVEN}, this implementation uses the IEEE 754
       * default rounding mode: if the two nearest representable values are equally near, the one with
       * the least significant bit zero is chosen. (In such cases, both of the nearest representable
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Wed Feb 07 17:50:39 UTC 2024
    - 18.9K bytes
    - Viewed (0)
Back to top