- Sort Score
- Result 10 results
- Languages All
Results 21 - 27 of 27 for lineFor (0.19 sec)
-
src/net/http/request.go
} } // patIndex returns the index of name in the list of named wildcards of the // request's pattern, or -1 if there is no such name. func (r *Request) patIndex(name string) int { // The linear search seems expensive compared to a map, but just creating the map // takes a lot of time, and most patterns will just have a couple of wildcards. if r.pat == nil { return -1 } i := 0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 49.4K bytes - Viewed (0) -
src/runtime/mgcscavenge.go
chunks []atomicScavChunkData min, max atomic.Uintptr minHeapIdx atomic.Uintptr // searchAddr* is the maximum address (in the offset address space, so we have a linear // view of the address space; see mranges.go:offAddr) containing memory available to // scavenge. It is a hint to the find operation to avoid O(n^2) behavior in repeated lookups. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:48:45 UTC 2024 - 52.3K bytes - Viewed (0) -
cmd/xl-storage-format-v2.go
} // Add space at the end. // Will have -1 modtime, so it will be inserted there. x.versions = append(x.versions, xlMetaV2ShallowVersion{header: xlMetaV2VersionHeader{ModTime: -1}}) // Linear search, we likely have to insert at front. for i, existing := range x.versions { if existing.header.ModTime <= modTime { // Insert at current idx. First move current back. copy(x.versions[i+1:], x.versions[i:])
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Wed May 29 19:14:09 UTC 2024 - 63.6K bytes - Viewed (0) -
tensorflow/compiler/jit/mark_for_compilation_pass.cc
}).status()); // Check that the conclusion made above (that iterating over the graph once in // post order gives a maximal clustering) holds. Once the linear time // post-order scheme has been battle tested we can move this to happen only in // debug builds. VLOG(2) << "Checking idempotence"; TF_ASSIGN_OR_RETURN(bool changed,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 21 12:19:41 UTC 2024 - 85.3K bytes - Viewed (0) -
src/runtime/pprof/pprof_test.go
// the CPU time the process measures with its own profiler should match the // total CPU usage that the OS reports. // // We could also check that increases in parallelism (GOMAXPROCS) lead to a // linear increase in the CPU usage reported by both the OS and the // profiler, but without a guarantee of exclusive access to CPU resources // that is likely to be a flaky test.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:42:28 UTC 2024 - 68.8K bytes - Viewed (0) -
src/cmd/link/internal/ld/dwarf.go
return 0 } d.linkctxt.Errorf(symIdx, "internal error: no entry for sym %d in rtmap\n", symIdx) return 0 } // Find child by AT_name using hashtable if available or linear scan // if not. func findchild(die *dwarf.DWDie, name string) *dwarf.DWDie { var prev *dwarf.DWDie for ; die != prev; prev, die = die, walktypedef(die) { for a := die.Child; a != nil; a = a.Link {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 16:25:18 UTC 2024 - 72.4K bytes - Viewed (0) -
src/runtime/mheap.go
// must ensure that allocation cannot happen around the // access (since that may free the backing store). allspans []*mspan // all spans out there // Proportional sweep // // These parameters represent a linear function from gcController.heapLive // to page sweep count. The proportional sweep system works to // stay in the black by keeping the current page sweep count // above this line at the current gcController.heapLive. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 78K bytes - Viewed (0)