- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 177 for Implementation (0.17 sec)
-
src/runtime/lock_futex.go
// license that can be found in the LICENSE file. //go:build dragonfly || freebsd || linux package runtime import ( "internal/runtime/atomic" "unsafe" ) // This implementation depends on OS-specific implementations of // // futexsleep(addr *uint32, val uint32, ns int64) // Atomically, // if *addr == val { sleep } // Might be woken up spuriously; that's allowed.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:57:34 UTC 2024 - 5.4K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/telemetry/counter/counter.go
// Copyright 2023 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package counter // The implementation of this package and tests are located in // internal/counter, which can be shared with the upload package. // TODO(hyangah): use of type aliases prevents nice documentation // rendering in go doc or pkgsite. Fix this either by avoiding
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 15 18:02:34 UTC 2024 - 4.2K bytes - Viewed (0) -
src/cmd/compile/internal/types2/struct.go
return "" } func (s *Struct) Underlying() Type { return s } func (s *Struct) String() string { return TypeString(s, nil) } // ---------------------------------------------------------------------------- // Implementation func (s *Struct) markComplete() { if s.fields == nil { s.fields = make([]*Var, 0) } } func (check *Checker) structType(styp *Struct, e *syntax.StructType) { if e.FieldList == nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 29 22:06:18 UTC 2024 - 6.6K bytes - Viewed (0) -
pkg/kube/krt/bench_test.go
"istio.io/istio/pkg/test" ) type Workload struct { krt.Named ServiceNames []string IP string } // GetLabelSelector defaults to using Reflection which is slow. Provide a specialized implementation that does it more efficiently. type ServiceWrapper struct{ *v1.Service } func (s ServiceWrapper) GetLabelSelector() map[string]string { return s.Spec.Selector } var _ krt.LabelSelectorer = ServiceWrapper{}
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue Apr 09 19:55:53 UTC 2024 - 7K bytes - Viewed (0) -
src/crypto/aes/aes_gcm.go
if len(nonce) != g.nonceSize { panic("crypto/cipher: incorrect nonce length given to GCM") } // Sanity check to prevent the authentication from always succeeding if an implementation // leaves tagSize uninitialized, for example. if g.tagSize < gcmMinimumTagSize { panic("crypto/cipher: incorrect GCM tag size") } if len(ciphertext) < g.tagSize { return nil, errOpen }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 27 18:23:49 UTC 2024 - 5.4K bytes - Viewed (0) -
src/runtime/rwmutex.go
// protects some resource (e.g., allocmLock protects creation of new Ms). The // read and write locks of that resource need to be represented in the lock // rank. // // Internal ranking: as an implementation detail, rwmutex uses two mutexes: // rLock and wLock. These have lock order requirements: wLock must be locked // before rLock. This also needs to be represented in the lock rank. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 22 14:29:04 UTC 2024 - 5K bytes - Viewed (0) -
src/regexp/syntax/doc.go
x+? one or more x, prefer fewer x?? zero or one x, prefer zero x{n,m}? n or n+1 or ... or m x, prefer fewer x{n,}? n or more x, prefer fewer x{n}? exactly n x Implementation restriction: The counting forms x{n,m}, x{n,}, and x{n} reject forms that create a minimum or maximum repetition count above 1000. Unlimited repetitions are not subject to this restriction. Grouping:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 19 11:21:02 UTC 2024 - 5.4K bytes - Viewed (0) -
pkg/kube/krt/singleton.go
return c.c } var _ Singleton[any] = &collectionAdapter[any]{} func NewSingleton[O any](hf TransformationEmpty[O], opts ...CollectionOption) Singleton[O] { // dummyCollection provides a trivial collection implementation that always provides a single dummyValue. // This is an internal construct exclusively for implementing the "Singleton" pattern. // This is so we can represent a singleton (a func() *O) as a collection (a func(I) *O).
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Fri May 10 23:33:56 UTC 2024 - 4.2K bytes - Viewed (0) -
pilot/pkg/config/monitor/monitor.go
} } }() return nil } // recursiveWatcher wraps a fsnotify wrapper to add a best-effort recursive directory watching in user // space. See https://github.com/fsnotify/fsnotify/issues/18. The implementation is inherently racy, // as files added to a directory immediately after creation may not trigger events; as such it is only useful // when an event causes a full reconciliation, rather than acting on an individual event
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Mon Feb 12 17:36:33 UTC 2024 - 7.2K bytes - Viewed (0) -
cmd/bitrot.go
// algorithms compute correct checksums. If any algorithm // produces an incorrect checksum it fails with a hard error. // // bitrotSelfTest tries to catch any issue in the bitrot implementation // early instead of silently corrupting data. func bitrotSelfTest() { checksums := map[BitrotAlgorithm]string{ SHA256: "a7677ff19e0182e4d52e3a3db727804abc82a5818749336369552e54b838b004",
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Jan 30 20:43:25 UTC 2024 - 7.6K bytes - Viewed (0)