- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 444 for Implementation (0.58 sec)
-
pkg/kubelet/stats/cri_stats_provider.go
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Nov 01 18:46:33 UTC 2023 - 35.1K bytes - Viewed (0) -
src/crypto/aes/gcm_s390x.go
"crypto/internal/alias" "crypto/subtle" "errors" "internal/byteorder" "internal/cpu" ) // This file contains two implementations of AES-GCM. The first implementation // (gcmAsm) uses the KMCTR instruction to encrypt using AES in counter mode and // the KIMD instruction for GHASH. The second implementation (gcmKMA) uses the // newer KMA instruction which performs both operations. // gcmCount represents a 16-byte big-endian count value.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 11.3K bytes - Viewed (0) -
src/debug/buildinfo/buildinfo.go
dataLen := readPtr(hdr[ptrSize:]) data, err := x.ReadData(dataAddr, dataLen) if err != nil || uint64(len(data)) < dataLen { return "" } return string(data) } // elfExe is the ELF implementation of the exe interface. type elfExe struct { f *elf.File } func (x *elfExe) ReadData(addr, size uint64) ([]byte, error) { for _, prog := range x.f.Progs {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 12.6K bytes - Viewed (0) -
src/sort/gen_sort_variants.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.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:27 UTC 2023 - 19.6K bytes - Viewed (0) -
src/vendor/golang.org/x/text/unicode/bidi/core.go
// positions as long as the rest of the input is properly reordered. // // As the algorithm is defined to operate on a single paragraph at a time, this // implementation is written to handle single paragraphs. Thus rule P1 is // presumed by this implementation-- the data provided to the implementation is // assumed to be a single paragraph, and either contains no 'B' codes, or a // single 'B' code at the end of the input. 'B' is allowed as input to
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 16 22:26:23 UTC 2022 - 29.4K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/mod/sumdb/note/note.go
// and it can verify a purported signature by that key. // // The standard implementation of a Verifier is constructed // by [NewVerifier] starting from a verifier key, which is a // plain text string of the form "<name>+<hash>+<keydata>". // // A [Verifiers] allows looking up a Verifier by the combination // of server name and key hash. // // The standard implementation of a Verifiers is constructed // by VerifierList from a list of known verifiers.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jul 12 20:38:21 UTC 2023 - 20.1K 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/internal/edwards25519/scalar.go
// // The zero value is a valid zero element. type Scalar struct { // s is the scalar in the Montgomery domain, in the format of the // fiat-crypto implementation. s fiatScalarMontgomeryDomainFieldElement } // The field implementation in scalar_fiat.go is generated by the fiat-crypto // project (https://github.com/mit-plv/fiat-crypto) at version v0.0.9 (23d2dbc) // from a formally verified model. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 10.8K 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)