- Sort Score
- Result 10 results
- Languages All
Results 1 - 9 of 9 for elide (0.05 sec)
-
src/runtime/traceback.go
// physical frame. u2 := u remaining, _ := traceback2(&u, showRuntime, maxInt, 0) elide := remaining - lastN - tracebackOuterFrames if elide > 0 { print("...", elide, " frames elided...\n") traceback2(&u2, showRuntime, lastN+elide, tracebackOuterFrames) } else if elide <= 0 { // There are tracebackOuterFrames or fewer frames left to print. // Just print the rest of the stack.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 55.1K bytes - Viewed (0) -
src/net/netip/netip_test.go
}, // IPv6 with elided fields in the middle. { in: "fd7a:115c::626b:430b", ip: MkAddr(Mk128(0xfd7a115c00000000, 0x00000000626b430b), Z6noz), }, // IPv6 with elided fields at the end. { in: "fd7a:115c:a1e0:ab12:4843:cd96::", ip: MkAddr(Mk128(0xfd7a115ca1e0ab12, 0x4843cd9600000000), Z6noz), }, // IPv6 with single elided field at the end. {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 17:10:01 UTC 2024 - 54.3K bytes - Viewed (0) -
src/cmd/go/internal/modload/buildlist.go
// // Instead, we'll inject a fake "vendor/modules.txt" module that provides // those transitive dependencies, and mark it as a dependency of the main // module. That allows us to elide the actual structure of the module // graph, but still distinguishes between direct and indirect // dependencies. vendorMod := module.Version{Path: "vendor/modules.txt", Version: ""} if inWorkspaceMode() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 16:04:44 UTC 2024 - 53.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/PPC64.rules
// absorb InvertFlags into boolean values ((Equal|NotEqual|LessThan|GreaterThan|LessEqual|GreaterEqual) (InvertFlags x)) => ((Equal|NotEqual|GreaterThan|LessThan|GreaterEqual|LessEqual) x) // Elide compares of bit tests ((EQ|NE|LT|LE|GT|GE) (CMPconst [0] z:(AND x y)) yes no) && z.Uses == 1 => ((EQ|NE|LT|LE|GT|GE) (Select1 <types.TypeFlags> (ANDCC x y)) yes no)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:02:52 UTC 2024 - 53.2K bytes - Viewed (0) -
pkg/workloadapi/workload.pb.go
// For Kubernetes, this is the pod name. // This is just for debugging and may be elided as an optimization. Name string `protobuf:"bytes,1,opt,name=name,proto3" json:"name,omitempty"` // Namespace represents the namespace for the workload. // This is just for debugging and may be elided as an optimization. Namespace string `protobuf:"bytes,2,opt,name=namespace,proto3" json:"namespace,omitempty"`
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Jun 12 18:02:35 UTC 2024 - 65.9K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/project/DefaultProjectBuilder.java
.getProject(); } catch (ProjectBuildingException e) { // MNG-4488 where let invalid parents slide on by if (logger.isDebugEnabled()) { // Message below is checked for in the MNG-2199 core IT.
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Mon May 13 16:34:29 UTC 2024 - 57.1K bytes - Viewed (0) -
src/runtime/map.go
bucket uintptr checkBucket uintptr } // bucketShift returns 1<<b, optimized for code generation. func bucketShift(b uint8) uintptr { // Masking the shift amount allows overflow checks to be elided. return uintptr(1) << (b & (goarch.PtrSize*8 - 1)) } // bucketMask returns 1<<b - 1, optimized for code generation. func bucketMask(b uint8) uintptr { return bucketShift(b) - 1 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 57.6K bytes - Viewed (0) -
src/cmd/go/internal/modload/load.go
} } ld.switchIfErrors(ctx) suggestFixes() ld.exitIfErrors(ctx) } // scanDir is like imports.ScanDir but elides known magic imports from the list, // so that we do not go looking for packages that don't really exist. // // The standard magic import is "C", for cgo. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 14:56:56 UTC 2024 - 84K bytes - Viewed (0) -
src/net/http/transport.go
// Nothing case 1: if pconns[0] == pconn { delete(t.idleConn, key) removed = true } default: for i, v := range pconns { if v != pconn { continue } // Slide down, keeping most recently-used // conns at the end. copy(pconns[i:], pconns[i+1:]) t.idleConn[key] = pconns[:len(pconns)-1] removed = true break } } return removed }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 06 21:59:21 UTC 2024 - 91K bytes - Viewed (0)