Search Options

Results per page
Sort
Preferred Languages
Advance

Results 71 - 80 of 291 for Implementation (0.24 sec)

  1. test/typeparam/issue47896.go

    package main
    
    import (
    	"database/sql"
    )
    
    // Collection generic interface which things can be added to.
    type Collection[T any] interface {
    	Add(T)
    }
    
    // Slice generic slice implementation of a Collection
    type Slice[T any] []*T
    
    func (s *Slice[T]) Add(t *T) {
    	*s = append(*s, t)
    }
    
    type Scanner interface {
    	Scan(...interface{}) error
    }
    
    type Mapper[T any] func(s Scanner, t T) error
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Mar 01 19:45:34 UTC 2022
    - 1.4K bytes
    - Viewed (0)
  2. src/net/netip/slow_test.go

    	}
    
    	return s, nil
    }
    
    // parseIPv4Slow parses and returns an IPv4 address in dotted quad
    // form, e.g. "192.168.0.1". It is slow but easy to read, and the
    // reference implementation against which we compare faster
    // implementations for correctness.
    func parseIPv4Slow(s string) (Addr, error) {
    	fs := strings.Split(s, ".")
    	if len(fs) != 4 {
    		return Addr{}, fmt.Errorf("netaddr.ParseIP(%q): invalid IP address", s)
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 11 19:54:31 UTC 2024
    - 5.8K bytes
    - Viewed (0)
  3. src/cmd/go/help_test.go

    	// init-time configuration
    	cmd := testenv.Command(t, testGo, "help", "documentation")
    	// Unset GO111MODULE so that the 'go get' section matches
    	// the default 'go get' implementation.
    	cmd.Env = append(cmd.Environ(), "GO111MODULE=")
    	cmd.Stderr = new(strings.Builder)
    	out, err := cmd.Output()
    	if err != nil {
    		t.Fatalf("%v: %v\n%s", cmd, err, cmd.Stderr)
    	}
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Feb 28 15:45:49 UTC 2023
    - 1.6K bytes
    - Viewed (0)
  4. src/runtime/memclr_mipsx.s

    #include "textflag.h"
    
    #ifdef GOARCH_mips
    #define MOVWHI  MOVWL
    #define MOVWLO  MOVWR
    #else
    #define MOVWHI  MOVWR
    #define MOVWLO  MOVWL
    #endif
    
    // See memclrNoHeapPointers Go doc for important implementation constraints.
    
    // func memclrNoHeapPointers(ptr unsafe.Pointer, n uintptr)
    TEXT runtime·memclrNoHeapPointers(SB),NOSPLIT,$0-8
    	MOVW	n+4(FP), R2
    	MOVW	ptr+0(FP), R1
    
    	SGTU	$4, R2, R3
    	ADDU	R2, R1, R4
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Sat Nov 06 10:24:44 UTC 2021
    - 1.3K bytes
    - Viewed (0)
  5. 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)
  6. 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)
  7. 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)
  8. 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)
  9. 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)
  10. 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)
Back to top