- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 135 for roots (0.05 sec)
-
src/crypto/x509/name_constraints_test.go
}, // #14: roots can exclude subtrees and that doesn't affect other names. { roots: []constraintsSpec{ { bad: []string{"dns:.example.com"}, }, }, intermediates: [][]constraintsSpec{ { {}, }, }, leaf: leafSpec{ sans: []string{"dns:foo.com"}, }, }, // #15: roots exclusions are effective. { roots: []constraintsSpec{ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 09 22:40:21 UTC 2024 - 45.2K bytes - Viewed (0) -
src/cmd/go/internal/modload/edit.go
roots = append(roots, module.Version{Path: p, Version: v}) } } gover.ModSort(roots) // First, we extend the graph so that it includes the selected version // of every root. The upgraded roots are in addition to the original // roots, so we will have enough information to trace a path to each // conflict we discover from one or more of the original roots.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 15 21:46:32 UTC 2024 - 34.1K bytes - Viewed (0) -
subprojects/core/src/integTest/groovy/org/gradle/api/internal/tasks/SnapshotTaskInputsOperationIntegrationTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue May 28 09:03:53 UTC 2024 - 23.5K bytes - Viewed (0) -
src/cmd/link/internal/ld/stackcheck.go
nodes[lowest] = struct{}{} } } } // Sort roots by height. This makes the result deterministic // and also improves the error reporting. var roots []loader.Sym for k := range nodes { roots = append(roots, k) } sort.Slice(roots, func(i, j int) bool { h1, h2 := sc.height[roots[i]], sc.height[roots[j]] if h1 != h2 { return h1 > h2 } // Secondary sort by Sym.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 24 16:49:08 UTC 2023 - 11.9K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/internal/operations/trace/BuildOperationTrace.java
logOutputStream.close(); } if (outputTree) { List<BuildOperationRecord> roots = readLogToTreeRoots(logFile(basePath), false); writeDetailTree(roots); writeSummaryTree(roots); } } catch (IOException e) { throw UncheckedException.throwAsUncheckedException(e); }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Apr 26 09:45:59 UTC 2024 - 23.4K bytes - Viewed (0) -
analysis/analysis-api-standalone/analysis-api-standalone-base/src/org/jetbrains/kotlin/analysis/api/standalone/base/project/structure/StandaloneProjectFactory.kt
} } private fun getVirtualFileUrlsForLibraryRootsRecursively( roots: Collection<Path>, environment: KotlinCoreProjectEnvironment, ): Set<String> = buildSet { for (root in getVirtualFilesForLibraryRoots(roots, environment)) { LibraryUtils.getAllVirtualFilesFromRoot(root, includeRoot = true) .mapTo(this) { it.url } } }
Registered: Wed Jun 12 09:53:16 UTC 2024 - Last Modified: Tue Jun 04 22:09:27 UTC 2024 - 22.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/poset.go
// If this is the first constant, put it as a new root, as // we can't record an existing connection so we don't have // a specific DAG to add it to. Notice that we want all // constants to be in root #0, so make sure the new root // goes there. if len(po.constants) == 0 { idx := len(po.roots) po.roots = append(po.roots, i) po.roots[0], po.roots[idx] = po.roots[idx], po.roots[0] po.upush(undoNewRoot, i, 0)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 04 17:23:05 UTC 2023 - 37.2K bytes - Viewed (0) -
platforms/native/platform-native/src/test/groovy/org/gradle/nativeplatform/toolchain/internal/msvcpp/WindowsKitWindowsSdkLocatorTest.groovy
windowsRegistryLocal.getStringValue(WindowsRegistry.Key.HKEY_LOCAL_MACHINE, /SOFTWARE\Microsoft\Windows Kits\Installed Roots/, "KitsRoot10") >> dir1.absolutePath when: def result = windowsSdkLocatorLocal.locateComponent(null) then: result.available
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Nov 16 20:20:03 UTC 2023 - 16.3K bytes - Viewed (0) -
src/main/java/jcifs/smb/DfsImpl.java
} root = root.toLowerCase(); /* * domain-based DFS root shares to links for each */ Map<String, CacheEntry<DfsReferralDataInternal>> roots = domains.get(domain); if ( roots != null ) { dr = getLinkReferral(tf, domain, root, path, now, roots); }
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Thu Jan 05 13:07:29 UTC 2023 - 29.1K bytes - Viewed (0) -
src/crypto/x509/verify.go
} if opts.Roots != nil && opts.Roots.systemPool { platformChains, err := c.systemVerify(&opts) // If the platform verifier succeeded, or there are no additional // roots, return the platform verifier result. Otherwise, continue // with the Go verifier. if err == nil || opts.Roots.len() == 0 { return platformChains, err } } } if opts.Roots == nil { opts.Roots = systemRootsPool()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:58:39 UTC 2024 - 35.7K bytes - Viewed (0)