- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 66 for Cur (0.15 sec)
-
src/syscall/syscall_linux_386.go
err = prlimit(0, resource, rlim, nil) if err != ENOSYS { return err } rl := rlimit32{} if rlim.Cur == rlimInf64 { rl.Cur = rlimInf32 } else if rlim.Cur < uint64(rlimInf32) { rl.Cur = uint32(rlim.Cur) } else { return EINVAL } if rlim.Max == rlimInf64 { rl.Max = rlimInf32 } else if rlim.Max < uint64(rlimInf32) { rl.Max = uint32(rlim.Max)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 22:23:07 UTC 2023 - 10.3K bytes - Viewed (0) -
src/mime/encodedword.go
if start == -1 { break } cur := start + len("=?") i := strings.Index(header[cur:], "?") if i == -1 { break } charset := header[cur : cur+i] cur += i + len("?") if len(header) < cur+len("Q??=") { break } encoding := header[cur] cur++ if header[cur] != '?' { break } cur++ j := strings.Index(header[cur:], "?=")
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 21 16:12:35 UTC 2024 - 10K bytes - Viewed (0) -
src/cmd/compile/internal/liveness/intervals.go
var ret Intervals var pv pairVisitor cur := pv.init(is, is2) for { second := pv.nxt() if second.done() { break } // Check for overlap between cur and second. If no overlap // then add cur to result and move on. if !cur.i.Overlaps(second.i) && !cur.i.adjacent(second.i) { ret = append(ret, cur.i) cur = second continue } // cur overlaps with second; merge second into cur
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 29 21:55:27 UTC 2024 - 10K bytes - Viewed (0) -
src/compress/flate/deflate_test.go
type sparseReader struct { l int64 cur int64 } func (r *sparseReader) Read(b []byte) (n int, err error) { if r.cur >= r.l { return 0, io.EOF } n = len(b) cur := r.cur + int64(n) if cur > r.l { n -= int(cur - r.l) cur = r.l } for i := range b[0:n] { if r.cur+int64(i) >= r.l-1<<16 { b[i] = 1 } else { b[i] = 0 } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jun 14 00:03:57 UTC 2023 - 25.6K bytes - Viewed (0) -
pkg/controller/daemon/update.go
// Create a new history if the current one isn't found cur, err = dsc.snapshot(ctx, ds, currRevision) if err != nil { return nil, nil, err } default: cur, err = dsc.dedupCurHistories(ctx, ds, currentHistories) if err != nil { return nil, nil, err } // Update revision number if necessary if cur.Revision < currRevision { toUpdate := cur.DeepCopy() toUpdate.Revision = currRevision
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon May 13 16:53:53 UTC 2024 - 24.4K bytes - Viewed (0) -
src/runtime/mpallocbits.go
// Final region that might span to next uint64 cur = l } if start == notSetYet { // Made it all the way through without finding a single 1 bit. const n = uint(64 * len(b)) return packPallocSum(n, n, n) } most = max(most, cur) if most >= 64-2 { // There is no way an internal run of zeros could beat max. return packPallocSum(start, most, cur) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 18 15:13:43 UTC 2024 - 12.5K bytes - Viewed (0) -
src/archive/tar/common.go
return false } var pre sparseEntry for _, cur := range sp { switch { case cur.Offset < 0 || cur.Length < 0: return false // Negative values are never okay case cur.Offset > math.MaxInt64-cur.Length: return false // Integer overflow with large length case cur.endOffset() > size: return false // Region extends beyond the actual size case pre.endOffset() > cur.Offset:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 15 16:01:50 UTC 2024 - 24.7K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/graph/graph.go
// children to make them each roots of their own trees. if len(cur.In) == 0 { for _, outEdge := range cur.Out { delete(outEdge.Dest.In, cur) } continue } // Get the parent. This works since at this point cur.In must contain only // one element. if len(cur.In) != 1 { panic("Get parent assertion failed. cur.In expected to be of length 1.") } var parent *Node
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 31K bytes - Viewed (0) -
pilot/pkg/serviceregistry/kube/controller/pod.go
} } return -1, nil } func (pc *PodCache) labelFilter(old, cur *v1.Pod) bool { // If labels/annotations updated, trigger proxy push labelsChanged := !maps.Equal(old.Labels, cur.Labels) // Annotations are only used in endpoints in one case, so just compare that one relevantAnnotationsChanged := old.Annotations[constants.AmbientRedirection] != cur.Annotations[constants.AmbientRedirection]
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu May 23 21:07:03 UTC 2024 - 10.8K bytes - Viewed (0) -
operator/pkg/compare/compare.go
} cur := obj for _, nname := range nodeList { ndata, ok := cur[nname] if !ok || ndata == nil { // target path does not exist return fmt.Errorf("targetPath '%v' does not exist in obj: '%v' is missing", targetPath, nname) } switch nnode := ndata.(type) { case map[string]any: cur = nnode default: // target path type does not match
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Apr 15 01:29:35 UTC 2024 - 13.3K bytes - Viewed (0)