- Sort Score
- Result 10 results
- Languages All
Results 151 - 160 of 623 for Implementation (0.23 sec)
-
src/crypto/internal/nistec/p224_sqrt.go
func p224SqrtCandidate(r, x *fiat.P224Element) { // Since p = 1 mod 4, we can't use the exponentiation by (p + 1) / 4 like // for the other primes. Instead, implement a variation of Tonelli–Shanks. // The constant-time implementation is adapted from Thomas Pornin's ecGFp5. // // https://github.com/pornin/ecgfp5/blob/82325b965/rust/src/field.rs#L337-L385 // p = q*2^n + 1 with q odd -> q = 2^128 - 1 and n = 96
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Aug 12 00:04:29 UTC 2022 - 3.1K bytes - Viewed (1) -
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) -
.github/ISSUE_TEMPLATE/11-language-change.yml
validations: required: false - type: textarea id: prototype attributes: label: "Prototype" description: "Can you describe a possible implementation?" validations:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 22 20:49:24 UTC 2023 - 4.7K bytes - Viewed (0) -
src/cmd/asm/internal/lex/lex.go
input := NewInput(name) fd, err := os.Open(name) if err != nil { log.Fatalf("%s\n", err) } input.Push(NewTokenizer(name, fd, fd)) return input } // The other files in this directory each contain an implementation of TokenReader. // A TokenReader is like a reader, but returns lex tokens of type Token. It also can tell you what // the text of the most recently returned token is, and where it was found.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 29 18:31:05 UTC 2023 - 4.1K bytes - Viewed (0) -
src/cmd/compile/internal/types2/return.go
} if !check.isTerminatingList(cc.Body, "") || hasBreakList(cc.Body, label, true) { return false } } return hasDefault } // TODO(gri) For nested breakable statements, the current implementation of hasBreak // will traverse the same subtree repeatedly, once for each label. Replace // with a single-pass label/break matching phase. // hasBreak reports if s is or contains a break statement
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 22 19:32:17 UTC 2024 - 4.4K bytes - Viewed (0) -
src/os/exec_unix.go
return ErrProcessDone } return err } func (p *Process) release() error { // We clear the Pid field only for API compatibility. On Unix, Release // has always set Pid to -1. Internally, the implementation relies // solely on statusReleased to determine that the Process is released. p.Pid = pidReleased switch p.mode { case modeHandle: // Drop the Process' reference and mark handle unusable for
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 22:06:47 UTC 2024 - 4.1K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/internal/poly1305/poly1305.go
// of the data written to it. // // MAC cannot be used like common hash.Hash implementations, // because using a poly1305 key twice breaks its security. // Therefore writing data to a running MAC after calling // Sum or Verify causes it to panic. type MAC struct { mac // platform-dependent implementation finalized bool } // Size returns the number of bytes Sum will return.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 09 20:10:44 UTC 2021 - 3.3K bytes - Viewed (0) -
src/net/dnsclient_unix.go
} // goLookupCNAME is the native Go (non-cgo) implementation of LookupCNAME. func (r *Resolver) goLookupCNAME(ctx context.Context, host string, order hostLookupOrder, conf *dnsConfig) (string, error) { _, cname, err := r.goLookupIPCNAMEOrder(ctx, "CNAME", host, order, conf) return cname.String(), err } // goLookupPTR is the native Go implementation of LookupAddr.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Apr 14 18:23:45 UTC 2024 - 24.5K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/telemetry/internal/counter/stackcounter.go
// requiring, at a minimum, a call to runtime.Callers. type StackCounter struct { name string depth int file *file mu sync.Mutex // as this is a detail of the implementation, it could be replaced // by a more efficient mechanism stacks []stack } type stack struct { pcs []uintptr counter *Counter } func NewStack(name string, depth int) *StackCounter {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:10:54 UTC 2024 - 4.8K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/language/coverage.go
} // coverage is used by NewCoverage which is used as a convenient way for // creating Coverage implementations for partially defined data. Very often a // package will only need to define a subset of slices. coverage provides a // convenient way to do this. Moreover, packages using NewCoverage, instead of // their own implementation, will not break if later new slice types are added. type coverage struct { tags func() []Tag
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 4.8K bytes - Viewed (0)