Search Options

Results per page
Sort
Preferred Languages
Advance

Results 91 - 100 of 650 for overflows (0.14 sec)

  1. src/go/types/assignments.go

    		if code != 0 {
    			msg := check.sprintf("cannot use %s as %s value in %s", x, target, context)
    			switch code {
    			case TruncatedFloat:
    				msg += " (truncated)"
    			case NumericOverflow:
    				msg += " (overflows)"
    			default:
    				code = IncompatibleAssign
    			}
    			check.error(x, code, msg)
    			x.mode = invalid
    			return
    		}
    		if val != nil {
    			x.val = val
    			check.updateExprVal(x.expr, val)
    		}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Apr 03 18:48:38 UTC 2024
    - 16.4K bytes
    - Viewed (0)
  2. src/runtime/map.go

    	// However, bmap.overflow is a pointer. In order to keep overflow buckets
    	// alive, we store pointers to all overflow buckets in hmap.extra.overflow and hmap.extra.oldoverflow.
    	// overflow and oldoverflow are only used if key and elem do not contain pointers.
    	// overflow contains overflow buckets for hmap.buckets.
    	// oldoverflow contains overflow buckets for hmap.oldbuckets.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 29 17:58:53 UTC 2024
    - 57.6K bytes
    - Viewed (0)
  3. src/math/big/natdiv.go

    				qhat--
    				prevRhat := rhat
    				rhat += vn1
    				// If r̂  overflows, then
    				// r̂ u[j+n-2]v[n-1] is now definitely > x1 x2.
    				if rhat < prevRhat {
    					break
    				}
    				// TODO(rsc): No need for a full mulWW.
    				// x2 += vn2; if x2 overflows, x1++
    				x1, x2 = mulWW(qhat, vn2)
    			}
    		}
    
    		// Compute q̂·v.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Mar 14 17:02:38 UTC 2024
    - 34.4K bytes
    - Viewed (0)
  4. src/cmd/compile/internal/types2/assignments.go

    		if code != 0 {
    			msg := check.sprintf("cannot use %s as %s value in %s", x, target, context)
    			switch code {
    			case TruncatedFloat:
    				msg += " (truncated)"
    			case NumericOverflow:
    				msg += " (overflows)"
    			default:
    				code = IncompatibleAssign
    			}
    			check.error(x, code, msg)
    			x.mode = invalid
    			return
    		}
    		if val != nil {
    			x.val = val
    			check.updateExprVal(x.expr, val)
    		}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Feb 23 21:21:43 UTC 2024
    - 16.4K bytes
    - Viewed (0)
  5. src/text/template/doc.go

    	- A boolean, string, character, integer, floating-point, imaginary
    	  or complex constant in Go syntax. These behave like Go's untyped
    	  constants. Note that, as in Go, whether a large integer constant
    	  overflows when assigned or passed to a function can depend on whether
    	  the host machine's ints are 32 or 64 bits.
    	- The keyword nil, representing an untyped Go nil.
    	- The character '.' (period):
    		.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Sat Feb 24 21:59:12 UTC 2024
    - 17.9K bytes
    - Viewed (0)
  6. okhttp/src/test/java/okhttp3/internal/ws/WebSocketHttpTest.kt

            .webSocketUpgrade(serverListener)
            .build(),
        )
        val webSocket: WebSocket = newWebSocket()
        clientListener.assertOpen()
    
        // Send messages until the client's outgoing buffer overflows!
        val message: ByteString = ByteString.of(*ByteArray(1024 * 1024))
        var messageCount: Long = 0
        while (true) {
          val success = webSocket.send(message)
          if (!success) break
          messageCount++
    Registered: Sun Jun 16 04:42:17 UTC 2024
    - Last Modified: Sun Mar 31 17:16:15 UTC 2024
    - 35.2K bytes
    - Viewed (0)
  7. pilot/pkg/xds/endpoints/endpoint_builder.go

    		locEps = b.EndpointsWithMTLSFilter(locEps)
    	}
    
    	return locEps
    }
    
    // addUint32AvoidOverflow returns sum of two uint32 and status. If sum overflows,
    // and returns MaxUint32 and status.
    func addUint32(left, right uint32) (uint32, bool) {
    	if math.MaxUint32-right < left {
    		return math.MaxUint32, true
    	}
    	return left + right, false
    }
    
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Sun Apr 28 02:18:19 UTC 2024
    - 26.1K bytes
    - Viewed (0)
  8. src/runtime/hash_test.go

    	// If the hash is bad, then all (8 choose 4) = 70 keys
    	// have the same hash. If so, we allocate 70/8 = 8
    	// overflow buckets. If the hash is good we don't
    	// normally allocate any overflow buckets, and the
    	// probability of even one or two overflows goes down rapidly.
    	// (There is always 1 allocation of the bucket array. The map
    	// header is allocated on the stack.)
    	f := func() {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 06 17:50:18 UTC 2024
    - 18.4K bytes
    - Viewed (0)
  9. src/time/sleep_test.go

    			break
    		}
    		d *= 2
    		if d > maxDuration {
    			t.Error(err)
    		}
    		t.Logf("%v; trying duration %v", err, d)
    	}
    }
    
    // Test that sleeping (via Sleep or Timer) for an interval so large it
    // overflows does not result in a short sleep duration. Nor does it interfere
    // with execution of other timers. If it does, timers in this or subsequent
    // tests may not fire.
    func TestOverflowSleep(t *testing.T) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Mar 22 16:33:57 UTC 2024
    - 22.5K bytes
    - Viewed (0)
  10. src/runtime/netpoll.go

    		return
    	}
    	rd0, wd0 := pd.rd, pd.wd
    	combo0 := rd0 > 0 && rd0 == wd0
    	if d > 0 {
    		d += nanotime()
    		if d <= 0 {
    			// If the user has a deadline in the future, but the delay calculation
    			// overflows, then set the deadline to the maximum possible value.
    			d = 1<<63 - 1
    		}
    	}
    	if mode == 'r' || mode == 'r'+'w' {
    		pd.rd = d
    	}
    	if mode == 'w' || mode == 'r'+'w' {
    		pd.wd = d
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 15 19:57:43 UTC 2024
    - 20.7K bytes
    - Viewed (0)
Back to top