- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 241 for bounded (0.41 sec)
-
guava/src/com/google/common/io/ByteStreams.java
// in.available() always returns 0 (the default). int skip = (int) Math.min(remaining, BUFFER_SIZE); if (buf == null) { // Allocate a buffer bounded by the maximum size that can be requested, for // example an array of BUFFER_SIZE is unnecessary when the value of remaining // is smaller. buf = new byte[skip]; }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Jan 17 18:59:58 UTC 2024 - 29.7K bytes - Viewed (0) -
cmd/sts-handlers.go
// because there will be a policy mapping stored on drives whose // filename is this parentUser: therefore, it needs to have only valid // filename characters and needs to have bounded length. { h := sha256.New() h.Write([]byte("openid:" + subFromToken + ":" + issFromToken)) bs := h.Sum(nil) cred.ParentUser = base64.RawURLEncoding.EncodeToString(bs) }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Jun 11 03:13:30 UTC 2024 - 33.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* the queue exceeds that value, the queue automatically removes its greatest element according to * its comparator (which might be the element that was just added). This is different from * conventional bounded queues, which either block or reject new elements when full. * * <p>This implementation is based on the <a * href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a> developed by Atkinson, et al.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 34K bytes - Viewed (1) -
src/cmd/compile/internal/walk/switch.go
newCases = append(newCases, &ir.CaseClause{ List: []ir.Node{ir.NewInt(base.Pos, int64(i))}, Body: []ir.Node{c.jmp}, }) } // TODO: add len(newCases) case, mark switch as bounded sw2 := ir.NewSwitchStmt(base.Pos, caseVar, newCases) sw.Compiled.Append(typecheck.Stmt(sw2)) interfaceCases = interfaceCases[:0] } if anyGoto != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:34:01 UTC 2024 - 30.1K bytes - Viewed (0) -
pkg/controller/deployment/util/deployment_util.go
PausedDeployReason = "DeploymentPaused" // ResumedDeployReason is added in a deployment when it is resumed. Useful for not failing accidentally // deployments that paused amidst a rollout and are bounded by a deadline. ResumedDeployReason = "DeploymentResumed" // // Available: // MinimumReplicasAvailable is added in a deployment when it has its minimum replicas required available.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Dec 15 07:09:11 UTC 2023 - 39.3K bytes - Viewed (0) -
src/cmd/compile/internal/walk/builtin.go
} length := typecheck.Conv(n.Len, types.Types[types.TINT]) copylen := ir.NewUnaryExpr(base.Pos, ir.OLEN, n.Cap) copyptr := ir.NewUnaryExpr(base.Pos, ir.OSPTR, n.Cap) if !t.Elem().HasPointers() && n.Bounded() { // When len(to)==len(from) and elements have no pointers: // replace make+copy with runtime.mallocgc+runtime.memmove. // We do not check for overflow of len(to)*elem.Width here
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 22:35:22 UTC 2024 - 31.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/utils/tpu_rewrite_device_util.cc
// Check if device coordinate is outside of topology mesh shape bounds. bool DeviceCoordinateOutOfBound(int x, int y, int z, int core, int bound_x, int bound_y, int bound_z, int bound_core) { return x < 0 || x >= bound_x || y < 0 || y >= bound_y || z < 0 || z >= bound_z || core < 0 || core >= bound_core; } // Create error message for an out of bound device coordinate.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Jun 10 20:10:40 UTC 2024 - 32.8K bytes - Viewed (0) -
src/math/big/int.go
// Calculate the quotient and cosequences using Collins' stopping condition. // Note that overflow of a Word is not possible when computing the remainder // sequence and cosequences since the cosequence size is bounded by the input size. // See section 4.2 of Jebelean for details. for a2 >= v2 && a1-a2 >= v1+v2 { q, r := a1/a2, a1%a2 a1, a2 = a2, r u0, u1, u2 = u1, u2, u1+q*u2 v0, v1, v2 = v1, v2, v1+q*v2
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 33.1K bytes - Viewed (0) -
src/cmd/compile/internal/walk/order.go
return } mk := as.Y.(*ir.MakeExpr) if mk.Esc() == ir.EscNone || mk.Len == nil || mk.Cap != nil { return } mk.SetOp(ir.OMAKESLICECOPY) mk.Cap = cp.Y // Set bounded when m = OMAKESLICE([]T, len(s)); OCOPY(m, s) mk.SetBounded(mk.Len.Op() == ir.OLEN && ir.SameSafeExpr(mk.Len.(*ir.UnaryExpr).X, cp.Y)) as.Y = typecheck.Expr(mk) s[1] = nil // remove separate copy call }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 02:00:33 UTC 2024 - 42.7K bytes - Viewed (0) -
docs/en/docs/img/deployment/https/https06.drawio
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Thu May 12 00:06:16 UTC 2022 - 17.1K bytes - Viewed (0)