- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 623 for Implementation (0.26 sec)
-
src/crypto/internal/boring/README.md
Interested users will have to evaluate for themselves whether the code is useful for their own purposes. --- This directory holds the core of the BoringCrypto implementation as well as the build scripts for the module itself: syso/*.syso. syso/goboringcrypto_linux_amd64.syso is built with: GOARCH=amd64 ./build.sh syso/goboringcrypto_linux_arm64.syso is built with:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jan 26 22:52:27 UTC 2024 - 1.4K bytes - Viewed (0) -
src/runtime/netpoll_aix.go
package runtime import ( "internal/runtime/atomic" "unsafe" ) // This is based on the former libgo/runtime/netpoll_select.c implementation // except that it uses poll instead of select and is written in Go. // It's also based on Solaris implementation for the arming mechanisms //go:cgo_import_dynamic libc_poll poll "libc.a/shr_64.o" //go:linkname libc_poll libc_poll var libc_poll libFunc
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 5.1K bytes - Viewed (0) -
src/sync/map_reference_test.go
Range(func(key, value any) (shouldContinue bool)) Clear() } var ( _ mapInterface = &RWMutexMap{} _ mapInterface = &DeepCopyMap{} ) // RWMutexMap is an implementation of mapInterface using a sync.RWMutex. type RWMutexMap struct { mu sync.RWMutex dirty map[any]any } func (m *RWMutexMap) Load(key any) (value any, ok bool) { m.mu.RLock() value, ok = m.dirty[key]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 01 15:34:22 UTC 2024 - 5.6K bytes - Viewed (0) -
src/sort/sort.go
//go:generate go run gen_sort_variants.go // Package sort provides primitives for sorting slices and user-defined collections. package sort import "math/bits" // An implementation of Interface can be sorted by the routines in this package. // The methods refer to elements of the underlying collection by integer index. type Interface interface { // Len is the number of elements in the collection.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 28 16:40:32 UTC 2023 - 10.1K bytes - Viewed (0) -
src/internal/trace/gc_test.go
t.Skip("skipping in -short mode") } check := func(t *testing.T, mu [][]trace.MutatorUtil) { mmuCurve := trace.NewMMUCurve(mu) // Test the optimized implementation against the "obviously // correct" implementation. for window := time.Nanosecond; window < 10*time.Second; window *= 10 { want := mmuSlow(mu[0], window) got := mmuCurve.MMU(window) if !aeq(want, got) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 5.3K bytes - Viewed (0) -
src/internal/bytealg/index_generic.go
panic("unimplemented") } // Cutover reports the number of failures of IndexByte we should tolerate // before switching over to Index. // n is the number of bytes processed so far. // See the bytes.Index implementation for details. func Cutover(n int) int { panic("unimplemented")
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 28 18:17:57 UTC 2021 - 901 bytes - Viewed (0) -
src/crypto/tls/handshake_test.go
) // TLS reference tests run a connection against a reference implementation // (OpenSSL) of TLS and record the bytes of the resulting connection. The Go // code, during a test, is configured with deterministic randomness and so the // reference test can be reproduced exactly in the future. // // In order to save everyone who wishes to run the tests from needing the // reference implementation installed, the reference connections are saved in
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:10:12 UTC 2024 - 24.5K bytes - Viewed (0) -
src/sort/zsortinterface.go
// The algorithm based on pattern-defeating quicksort(pdqsort), but without the optimizations from BlockQuicksort. // pdqsort paper: https://arxiv.org/pdf/2106.05123.pdf // C++ implementation: https://github.com/orlp/pdqsort // Rust implementation: https://docs.rs/pdqsort/latest/pdqsort/ // limit is the number of allowed bad (very unbalanced) pivots before falling back to heapsort. func pdqsort(data Interface, a, b, limit int) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 13 20:16:24 UTC 2022 - 11.2K bytes - Viewed (0) -
src/crypto/cipher/cipher.go
// around low-level block cipher implementations. // See https://csrc.nist.gov/groups/ST/toolkit/BCM/current_modes.html // and NIST Special Publication 800-38A. package cipher // A Block represents an implementation of block cipher // using a given key. It provides the capability to encrypt // or decrypt individual blocks. The mode implementations // extend that capability to streams of blocks.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Sep 28 03:55:33 UTC 2022 - 2.4K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/sys/unix/asm_linux_ppc64x.s
// license that can be found in the LICENSE file. //go:build linux && (ppc64 || ppc64le) && gc #include "textflag.h" // // System calls for ppc64, Linux // // Just jump to package syscall's implementation for all these functions. // The runtime may know about them. TEXT ·SyscallNoError(SB),NOSPLIT,$0-48 BL runtime·entersyscall(SB) MOVD a1+8(FP), R3 MOVD a2+16(FP), R4 MOVD a3+24(FP), R5 MOVD R0, R6
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 909 bytes - Viewed (0)