Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 5 of 5 for underflow (1.07 seconds)

  1. internal/s3select/sql/value_test.go

    			fields: fields{
    				value: []byte("9223372036854775808"),
    			},
    			// Seems to be what strconv.ParseInt returns
    			want:   math.MaxInt64,
    			wantOK: false,
    		},
    		{
    			name: "min-underflow",
    			fields: fields{
    				value: []byte("-9223372036854775809"),
    			},
    			// Seems to be what strconv.ParseInt returns
    			want:   math.MinInt64,
    			wantOK: false,
    		},
    		{
    			name: "zerospace",
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 12.4K bytes
    - Click Count (0)
  2. cmd/api-errors.go

    		HTTPStatusCode: http.StatusBadRequest,
    	},
    	ErrIntegerOverflow: {
    		Code:           "IntegerOverflow",
    		Description:    "Int overflow or underflow in the SQL expression.",
    		HTTPStatusCode: http.StatusBadRequest,
    	},
    	ErrLikeInvalidInputs: {
    		Code:           "LikeInvalidInputs",
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Wed Apr 16 07:34:24 GMT 2025
    - 93K bytes
    - Click Count (3)
  3. lib/fips140/v1.0.0-c2097c7c.zip

    > m even if x < m. // // x and m operands must have the same announced length. // //go:norace func (x *Nat) maybeSubtractModulus(always choice, m *Modulus) { t := NewNat().set(x) underflow := t.sub(m.nat) // We keep the result if x - m didn't underflow (meaning x >= m) // or if always was set. keep := not(choice(underflow)) | choice(always) x.assign(keep, t) } // Sub computes x = x - y mod m. // // The length of both operands must be the same as the modulus. Both operands // must already be reduced...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  4. lib/fips140/v1.1.0-rc1.zip

    > m even if x < m. // // x and m operands must have the same announced length. // //go:norace func (x *Nat) maybeSubtractModulus(always choice, m *Modulus) { t := NewNat().set(x) underflow := t.sub(m.nat) // We keep the result if x - m didn't underflow (meaning x >= m) // or if always was set. keep := not(choice(underflow)) | choice(always) x.assign(keep, t) } // Sub computes x = x - y mod m. // // The length of both operands must be the same as the modulus. Both operands // must already be reduced...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
  5. RELEASE.md

            `TransformedDistribution`.
        *   Fix a bug in `import_meta_graph`'s handling of partitioned variables
            when
        *   Ensure `tf.distributions.Multinomial` doesn't underflow in `log_prob`.
            Before this change, all partitions of an integer variable were
            initialized with the shape of the unpartitioned variable; after this
            change they are initialized correctly.
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
Back to Top