- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 161 for bounded (0.81 sec)
-
src/cmd/compile/internal/types2/check.go
// However, it is only processing functions (which // are processed in a delayed fashion) that may // add more actions (such as nested functions), so // this is a sufficiently bounded process. for i := top; i < len(check.delayed); i++ { a := &check.delayed[i] if check.conf.Trace { if a.desc != nil { check.trace(a.desc.pos.Pos(), "-- "+a.desc.format, a.desc.args...) } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 23.3K bytes - Viewed (0) -
android/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) -
android/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 (0) -
okhttp/src/main/kotlin/okhttp3/internal/cache/DiskLruCache.kt
import okio.FileSystem import okio.ForwardingFileSystem import okio.ForwardingSource import okio.Path import okio.Sink import okio.Source import okio.blackholeSink import okio.buffer /** * A cache that uses a bounded amount of space on a filesystem. Each cache entry has a string key * and a fixed number of values. Each key must match the regex `[a-z0-9_-]{1,64}`. Values are byte
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 34.7K bytes - Viewed (0) -
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)