- Sort Score
- Result 10 results
- Languages All
Results 131 - 140 of 495 for Implementation (0.13 sec)
-
src/math/big/natdiv.go
starts with a blunt critique of Knuth's presentation (among others) and then presents a more detailed and easier to follow treatment of long division, including an implementation in Pascal. But the algorithm and implementation work entirely in terms of 3-by-2 division, which is much less useful on modern hardware than an algorithm using 2-by-1 division. The proofs are a bit too
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 34.4K bytes - Viewed (0) -
src/errors/example_test.go
// license that can be found in the LICENSE file. package errors_test import ( "errors" "fmt" "io/fs" "os" "time" ) // MyError is an error implementation that includes a time and message. type MyError struct { When time.Time What string } func (e MyError) Error() string { return fmt.Sprintf("%v: %v", e.When, e.What) } func oops() error {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Aug 16 02:08:40 UTC 2023 - 2.2K bytes - Viewed (0) -
src/runtime/memclr_riscv64.s
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. #include "textflag.h" // See memclrNoHeapPointers Go doc for important implementation constraints. // void runtime·memclrNoHeapPointers(void*, uintptr) TEXT runtime·memclrNoHeapPointers<ABIInternal>(SB),NOSPLIT,$0-16 // X10 = ptr // X11 = n // If less than 8 bytes, do single byte zeroing.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Nov 09 13:57:06 UTC 2023 - 1.7K bytes - Viewed (0) -
src/cmd/go/internal/vet/vetflag.go
// stdout. // vetTool specifies the vet command to run. // Any tool that supports the (still unpublished) vet // command-line protocol may be supplied; see // golang.org/x/tools/go/analysis/unitchecker for one // implementation. It is also used by tests. // // The default behavior (vetTool=="") runs 'go tool vet'. var vetTool string // -vettool func init() { work.AddBuildFlags(CmdVet, work.DefaultBuildFlags)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Dec 19 14:42:39 UTC 2023 - 5.1K bytes - Viewed (0) -
src/hash/crc32/gen_const_ppc64le.go
// The original is dual licensed under GPL and Apache 2. As the copyright holder // for the work, IBM has contributed this new work under the golang license. // This code was written in Go based on the original C implementation. // This is a tool needed to generate the appropriate constants needed for // the vpmsum algorithm. It is included to generate new constant tables if // new polynomial values are included in the future.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 19 20:44:20 UTC 2024 - 4.5K bytes - Viewed (0) -
src/runtime/lock_sema.go
//go:build aix || darwin || netbsd || openbsd || plan9 || solaris || windows package runtime import ( "internal/runtime/atomic" "unsafe" ) // This implementation depends on OS-specific implementations of // // func semacreate(mp *m) // Create a semaphore for mp, if it does not already have one. // // func semasleep(ns int64) int32 // If ns < 0, acquire m's semaphore and return 0.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:57:37 UTC 2024 - 6.8K bytes - Viewed (0) -
src/internal/concurrent/hashtriemap.go
package concurrent import ( "internal/abi" "internal/goarch" "math/rand/v2" "sync" "sync/atomic" "unsafe" ) // HashTrieMap is an implementation of a concurrent hash-trie. The implementation // is designed around frequent loads, but offers decent performance for stores // and deletes as well, especially if the map is larger. It's primary use-case is
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 16:01:55 UTC 2024 - 11.8K bytes - Viewed (0) -
src/internal/poll/fd_plan9.go
// so this is always false, but the field is present because // shared code in fd_mutex.go checks it. isFile bool } // We need this to close out a file descriptor when it is unlocked, // but the real implementation has to live in the net package because // it uses os.File's. func (fd *FD) destroy() error { if fd.Destroy != nil { fd.Destroy() } return nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 06 14:00:54 UTC 2024 - 5.4K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/internal/language/match.go
func (t Tag) minimize() (Tag, error) { t, err := minimizeTags(t) if err != nil { return t, err } t.RemakeString() return t, nil } // minimizeTags mimics the behavior of the ICU 51 C implementation. func minimizeTags(t Tag) (Tag, error) { if t.equalTags(Und) { return t, nil } max, err := addTags(t) if err != nil { return t, err } for _, id := range [...]Tag{
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 5.7K bytes - Viewed (0) -
src/go/types/union.go
func (t *Term) Type() Type { return t.typ } func (t *Term) String() string { return (*term)(t).String() } // ---------------------------------------------------------------------------- // Implementation // Avoid excessive type-checking times due to quadratic termlist operations. const maxTermCount = 100 // parseUnion parses uexpr as a union of expressions.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:03 UTC 2023 - 6.2K bytes - Viewed (0)