- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 283 for Implementation (0.22 sec)
-
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/crypto/ecdsa/ecdsa.go
var testingOnlyRejectionSamplingLooped func() // errNoAsm is returned by signAsm and verifyAsm when the assembly // implementation is not available. var errNoAsm = errors.New("no assembly implementation available") // SignASN1 signs a hash (which should be the result of hashing a larger message) // using the private key, priv. If the hash is longer than the bit-length of the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:11:18 UTC 2024 - 20.4K bytes - Viewed (0) -
src/slices/zsortanyfunc.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: Tue May 23 23:33:29 UTC 2023 - 12.8K bytes - Viewed (0) -
src/sort/zsortfunc.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_func(data lessSwap, a, b, limit int) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 13 20:16:24 UTC 2022 - 11.5K bytes - Viewed (0) -
src/crypto/cipher/gcm.go
// may be overwritten. Open(dst, nonce, ciphertext, additionalData []byte) ([]byte, error) } // gcmAble is an interface implemented by ciphers that have a specific optimized // implementation of GCM, like crypto/aes. NewGCM will check for this interface // and return the specific AEAD if found. type gcmAble interface { NewGCM(nonceSize, tagSize int) (AEAD, error) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 13.7K bytes - Viewed (0) -
src/cmd/compile/internal/types2/typeset.go
} if hasTerms { buf.WriteString(s.terms.String()) } buf.WriteString("}") return buf.String() } // ---------------------------------------------------------------------------- // Implementation // hasTerms reports whether the type set has specific type terms. func (s *_TypeSet) hasTerms() bool { return !s.terms.isEmpty() && !s.terms.isAll() } // subsetOf reports whether s1 ⊆ s2.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 13.6K bytes - Viewed (0) -
src/runtime/metrics.go
// Copyright 2020 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 runtime // Metrics implementation exported to runtime/metrics. import ( "internal/godebugs" "unsafe" ) var ( // metrics is a map of runtime/metrics keys to data used by the runtime // to sample each metric's value. metricsInit indicates it has been // initialized.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 08 21:03:13 UTC 2024 - 26K bytes - Viewed (0) -
src/runtime/preempt.go
// next synchronous safe-point, the runtime poisons the goroutine's // stack bound to a value that will cause the next stack bound check // to fail and enter the stack growth implementation, which will // detect that it was actually a preemption and redirect to preemption // handling. // // Preemption at asynchronous safe-points is implemented by suspending
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 15:41:45 UTC 2024 - 15.1K 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)