- Sort Score
- Result 10 results
- Languages All
Results 121 - 130 of 495 for Implementation (0.28 sec)
-
src/crypto/internal/boring/hmac.go
package boring // #include "goboringcrypto.h" import "C" import ( "bytes" "crypto" "hash" "runtime" "unsafe" ) // hashToMD converts a hash.Hash implementation from this package // to a BoringCrypto *C.GO_EVP_MD. func hashToMD(h hash.Hash) *C.GO_EVP_MD { switch h.(type) { case *sha1Hash: return C._goboringcrypto_EVP_sha1() case *sha224Hash:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jul 20 17:51:31 UTC 2023 - 4K bytes - Viewed (0) -
src/vendor/golang.org/x/net/route/route.go
// Addrs: []route.Addrs{ // RTAX_DST: &route.Inet4Addr{ ... }, // RTAX_IFP: &route.LinkAddr{ ... }, // RTAX_BRD: &route.Inet4Addr{ ... }, // }, // } // // The values for the above fields depend on the implementation of // each operating system. // // The Err field on a response message contains an error value on the // requested operation. If non-nil, the requested operation is failed. type RouteMessage struct {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 4.2K bytes - Viewed (0) -
src/runtime/arena.go
// necessary in order to make new(T) a valid implementation of arenas. Such a property // is desirable to allow for a trivial implementation. (It also avoids complexities // that arise from synchronization with the GC when trying to set the arena chunks to // fault while the GC is active.) // // The implementation works in layers. At the bottom, arenas are managed in chunks.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:44:56 UTC 2024 - 37.9K 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) -
src/math/big/arith_s390x.s
// point to same memory region, we can use a faster version of copy using only MVC here. // In the following implementation, we have three copy loops, each copying a word, 4 words, and // 32 words at a time. Via benchmarking, this implementation is faster than calling runtime·memmove. copySetup: ADD R12, R6 ADD R12, R8 CMPBGE R5, $4, mediumLoop
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:27 UTC 2023 - 20.3K bytes - Viewed (0) -
src/syscall/syscall_darwin.go
// but it is also input to mksyscall, // which parses the //sys lines and generates system call stubs. // Note that sometimes we use a lowercase //sys name and wrap // it in our own nicer implementation, either here or in // syscall_bsd.go or syscall_unix.go. package syscall import ( "internal/abi" "unsafe" ) func Syscall(trap, a1, a2, a3 uintptr) (r1, r2 uintptr, err Errno)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:16:50 UTC 2024 - 11K bytes - Viewed (0) -
src/math/big/natdiv.go
starts with a blunt critique of Knuth's presentation (among others) and then presents a more detailed and easier to follow treatment of long division, including an implementation in Pascal. But the algorithm and implementation work entirely in terms of 3-by-2 division, which is much less useful on modern hardware than an algorithm using 2-by-1 division. The proofs are a bit too
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 34.4K bytes - Viewed (0) -
src/cmd/compile/internal/types2/typeparam.go
func (t *TypeParam) Underlying() Type { return t.iface() } func (t *TypeParam) String() string { return TypeString(t, nil) } // ---------------------------------------------------------------------------- // Implementation func (t *TypeParam) cleanup() { t.iface() t.check = nil } // iface returns the constraint interface of t. func (t *TypeParam) iface() *Interface { bound := t.bound
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 20:03:31 UTC 2024 - 4.9K bytes - Viewed (0)