- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 253 for Implementation (0.21 sec)
-
src/encoding/gob/type.go
// It also returns the number of indirections required to get to the // implementation. func implementsInterface(typ, gobEncDecType reflect.Type) (success bool, indir int8) { if typ == nil { return } rt := typ // The type might be a pointer and we need to keep // dereferencing to the base type until we find an implementation. for { if rt.Implements(gobEncDecType) { return true, indir }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 16 02:00:26 UTC 2024 - 27.2K bytes - Viewed (0) -
src/net/lookup_test.go
// PreferGo option used concurrently are all dialed properly. func TestConcurrentPreferGoResolversDial(t *testing.T) { switch runtime.GOOS { case "plan9": // TODO: plan9 implementation of the resolver uses the Dial function since // https://go.dev/cl/409234, this test could probably be reenabled. t.Skipf("skip on %v", runtime.GOOS) } testenv.MustHaveExternalNetwork(t)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 41.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadstore.go
) // dse does dead-store elimination on the Function. // Dead stores are those which are unconditionally followed by // another store to the same location, with no intervening load. // This implementation only works within a basic block. TODO: use something more global. func dse(f *Func) { var stores []*Value loadUse := f.newSparseSet(f.NumValues()) defer f.retSparseSet(loadUse)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 20:07:26 UTC 2024 - 11K bytes - Viewed (0) -
src/cmd/go/internal/work/init.go
} if cfg.BuildASan && !platform.ASanSupported(cfg.Goos, cfg.Goarch) { fmt.Fprintf(os.Stderr, "-asan is not supported on %s/%s\n", cfg.Goos, cfg.Goarch) base.SetExitStatus(2) base.Exit() } // The current implementation is only compatible with the ASan library from version // v7 to v9 (See the description in src/runtime/asan/asan.go). Therefore, using the // -asan option must use a compatible version of ASan library, which requires that
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 28 19:13:34 UTC 2023 - 12.2K bytes - Viewed (0) -
src/cmd/internal/obj/plist.go
// an unsafe point. func MarkUnsafePoints(ctxt *Link, p0 *Prog, newprog ProgAlloc, isUnsafePoint, isRestartable func(*Prog) bool) { if isRestartable == nil { // Default implementation: nothing is restartable. isRestartable = func(*Prog) bool { return false } } prev := p0 prevPcdata := int64(-1) // entry PC data value prevRestart := int64(0)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 01 15:52:41 UTC 2023 - 11.5K bytes - Viewed (0) -
src/testing/benchmark.go
var benchmarkLock sync.Mutex // Used for every benchmark for measuring memory. var memStats runtime.MemStats // InternalBenchmark is an internal type but exported because it is cross-package; // it is part of the implementation of the "go test" command. type InternalBenchmark struct { Name string F func(b *B) } // B is a type passed to [Benchmark] functions to manage benchmark
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 23.9K bytes - Viewed (0) -
src/crypto/internal/mlkem768/mlkem768_test.go
return dk.EncapsulationKey(), dk } var millionFlag = flag.Bool("million", false, "run the million vector test") // TestPQCrystalsAccumulated accumulates the 10k vectors generated by the // reference implementation and checks the hash of the result, to avoid checking // in 150MB of test vectors. func TestPQCrystalsAccumulated(t *testing.T) { n := 10000 expected := "f7db260e1137a742e05fe0db9525012812b004d29040a5b606aad3d134b548d3"
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 06 15:27:18 UTC 2024 - 10.3K bytes - Viewed (0) -
src/crypto/internal/edwards25519/field/fe.go
// Add sets v = a + b, and returns v. func (v *Element) Add(a, b *Element) *Element { v.l0 = a.l0 + b.l0 v.l1 = a.l1 + b.l1 v.l2 = a.l2 + b.l2 v.l3 = a.l3 + b.l3 v.l4 = a.l4 + b.l4 // Using the generic implementation here is actually faster than the // assembly. Probably because the body of this function is so simple that // the compiler can figure out better optimizations by inlining the carry // propagation.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 11.8K bytes - Viewed (0) -
src/runtime/hash_test.go
"math" "math/rand" "os" . "runtime" "slices" "strings" "testing" "unsafe" ) func TestMemHash32Equality(t *testing.T) { if *UseAeshash { t.Skip("skipping since AES hash implementation is used") } var b [4]byte r := rand.New(rand.NewSource(1234)) seed := uintptr(r.Uint64()) for i := 0; i < 100; i++ { randBytes(r, b[:]) got := MemHash32(unsafe.Pointer(&b), seed)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 06 17:50:18 UTC 2024 - 18.4K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/internal/poly1305/sum_s390x.s
// Copyright 2018 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. //go:build gc && !purego #include "textflag.h" // This implementation of Poly1305 uses the vector facility (vx) // to process up to 2 blocks (32 bytes) per iteration using an // algorithm based on the one described in: // // NEON crypto, Daniel J. Bernstein & Peter Schwabe
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 17.5K bytes - Viewed (0)