- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 6,658 for makeWE (0.11 sec)
-
src/net/fd_windows.go
isloopback = ra.Addr[0] == 127 case *syscall.SockaddrInet6: isloopback = ra.Addr == [16]byte(IPv6loopback) default: panic("unexpected type in connect") } if isloopback { // This makes ConnectEx() fails faster if the target port on the localhost // is not reachable, instead of waiting for 2s. params := windows.TCP_INITIAL_RTO_PARAMETERS{
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 07 16:46:10 UTC 2024 - 6.2K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/api/internal/project/antbuilder/ClassPathToClassLoaderCache.java
import java.util.concurrent.locks.Lock; import java.util.concurrent.locks.ReentrantLock; /** * A cache which caches classloaders based on their classpath. This cache provides bridging with the classloader cleanup mechanism which makes it more complex than it should: - class loaders can be * reused, so they *must not* be cleared as long as a cached loader is in cache - once a classloader is discarded from the cache, it must be cleared using a cleanup strategy *
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Dec 11 13:37:56 UTC 2023 - 7K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/podtopologyspread/filtering.go
} s := preFilterState{ Constraints: constraints, TpKeyToCriticalPaths: make(map[string]*criticalPaths, len(constraints)), TpPairToMatchNum: make(map[topologyPair]int, sizeHeuristic(len(allNodes), constraints)), } tpCountsByNode := make([]map[topologyPair]int, len(allNodes)) requiredNodeAffinity := nodeaffinity.GetRequiredNodeAffinity(pod) processNode := func(i int) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Feb 28 10:42:29 UTC 2024 - 12.4K bytes - Viewed (1) -
plugin/pkg/admission/namespace/exists/admission.go
} var _ admission.ValidationInterface = &Exists{} var _ = genericadmissioninitializer.WantsExternalKubeInformerFactory(&Exists{}) var _ = genericadmissioninitializer.WantsExternalKubeClientSet(&Exists{}) // Validate makes an admission decision based on the request attributes func (e *Exists) Validate(ctx context.Context, a admission.Attributes, o admission.ObjectInterfaces) error {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat Feb 08 02:16:47 UTC 2020 - 3.9K bytes - Viewed (0) -
src/runtime/chan_test.go
if runtime.GOOS == "linux" && runtime.GOARCH == "ppc64le" { testenv.SkipFlaky(t, 22047) } c1 := make(chan byte, trials+1) c2 := make(chan byte, trials+1) for i := 0; i < trials+1; i++ { c1 <- 1 c2 <- 2 } c3 := make(chan byte) c4 := make(chan byte) out := make(chan byte) done := make(chan byte) var wg sync.WaitGroup wg.Add(1) go func() { defer wg.Done() for { var b byte
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 31 20:47:35 UTC 2023 - 23.4K bytes - Viewed (0) -
pkg/proxy/conntrack/conntrack_test.go
for _, tc := range testCases { ct := makeCT(success) if err := ct.ClearEntriesForIP(tc.ip, v1.ProtocolUDP); err != nil { t.Errorf("%s/success: Unexpected error: %v", tc.name, err) } execCommand := ct.getExecutedCommand() if tc.expectCommand != execCommand { t.Errorf("%s/success: Expect command: %s, but executed %s", tc.name, tc.expectCommand, execCommand) } ct = makeCT(nothingToDelete)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Jan 15 18:08:36 UTC 2024 - 6.7K bytes - Viewed (0) -
src/compress/bzip2/huffman.go
// We keep the codes packed into a uint32, at the most-significant end. // So branches are taken from the MSB downwards. This makes it easy to // sort them later. code := uint32(0) length := uint8(32) codes := make([]huffmanCode, len(lengths)) for i := len(pairs) - 1; i >= 0; i-- { if length > pairs[i].length { length = pairs[i].length } codes[i].code = code
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 15 17:44:37 UTC 2024 - 6.7K bytes - Viewed (0) -
src/internal/bytealg/bytealg.go
h *= PrimeRK h += uint32(s[i]) h -= pow * uint32(s[i+n]) if h == hashss && string(s[i:i+n]) == string(sep) { return i } } return -1 } // MakeNoZero makes a slice of length n and capacity of at least n Bytes // without zeroing the bytes (including the bytes between len and cap). // It is the caller's responsibility to ensure uninitialized bytes // do not leak to the end user.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 19 19:51:15 UTC 2024 - 3.1K bytes - Viewed (0) -
src/crypto/rsa/boring.go
"crypto/internal/boring/bbig" "crypto/internal/boring/bcache" "math/big" ) // Cached conversions from Go PublicKey/PrivateKey to BoringCrypto. // // The first operation on a PublicKey or PrivateKey makes a parallel // BoringCrypto key and saves it in pubCache or privCache. // // We could just assume that once used in a sign/verify/encrypt/decrypt operation, // a particular key is never again modified, but that has not been a
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Aug 18 00:30:19 UTC 2022 - 3.3K bytes - Viewed (0) -
src/time/tick_test.go
} tim.Stop() drainAsync() noTick() // Again using select and with two goroutines waiting. tim.Reset(10000 * Second) drainAsync() done = make(chan bool, 2) done1 := make(chan bool) done2 := make(chan bool) stop := make(chan bool) go func() { select { case <-C: done <- true case <-stop: } close(done1) }() go func() { select { case <-C:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 11 17:10:37 UTC 2024 - 14.7K bytes - Viewed (0)