- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 400 for original (0.13 sec)
-
src/net/rpc/jsonrpc/server.go
// Package rpc expects uint64 request IDs. // We assign uint64 sequence numbers to incoming requests // but save the original request ID in the pending map. // When rpc responds, we use the sequence number in // the response to find the original request ID. mutex sync.Mutex // protects seq, pending seq uint64 pending map[uint64]*json.RawMessage }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 10 03:29:50 UTC 2024 - 3.2K bytes - Viewed (0) -
src/go/internal/typeparams/typeparams.go
return &ast.IndexListExpr{ X: x, Lbrack: lbrack, Indices: exprs, Rbrack: rbrack, } } } // IndexExpr wraps an ast.IndexExpr or ast.IndexListExpr. // // Orig holds the original ast.Expr from which this IndexExpr was derived. // // Note: IndexExpr (intentionally) does not wrap ast.Expr, as that leads to // accidental misuse such as encountered in golang/go#63933. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 16:17:05 UTC 2024 - 1.7K bytes - Viewed (0) -
src/math/cmplx/sin.go
// license that can be found in the LICENSE file. package cmplx import "math" // The original C code, the long comment, and the constants // below are from http://netlib.sandia.gov/cephes/c9x-complex/clog.c. // The go code is a simplified version of the original C. // // Cephes Math Library Release 2.8: June, 2000 // Copyright 1984, 1987, 1989, 1992, 2000 by Stephen L. Moshier //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 4.8K bytes - Viewed (0) -
src/cmd/gofmt/gofmt.go
fmt.Fprintf(os.Stderr, "gofmt: %s: error restoring file to original: %v; backup in %s\n", filename, err, bakname) } n, err := fout.Write(formatted) if err == nil && int64(n) < size { err = fout.Truncate(int64(n)) } if err != nil { // Rewriting the file failed. if n == 0 { // Original file unchanged. os.Remove(bakname) return err }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 14 19:41:17 UTC 2024 - 15.1K bytes - Viewed (0) -
src/cmd/internal/bootstrap_test/overlaydir_test.go
if err != nil { return err } perm = info.Mode() & os.ModePerm } // Always make copies of directories. // If we add a file in the overlay, we don't want to add it in the original. if info.IsDir() { return os.MkdirAll(dstPath, perm|0200) } // If we can use a hard link, do that instead of copying bytes. // Go builds don't like symlinks in some cases, such as go:embed.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 12 12:35:05 UTC 2023 - 2.1K bytes - Viewed (0) -
src/crypto/tls/handshake_messages_test.go
// their original representation, for later use in the handshake // transcript. In order to prevent DeepEqual from failing since // we didn't create the original message via unmarshalling, nil // the field. switch t := m.(type) { case *clientHelloMsg: t.original = nil case *serverHelloMsg: t.original = nil } if !reflect.DeepEqual(m1, m) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:10:12 UTC 2024 - 15.7K bytes - Viewed (0) -
src/cmd/compile/internal/types2/object_test.go
// the same Func Object as the original method. See also go.dev/issue/34421. func TestEmbeddedMethod(t *testing.T) { const src = `package p; type I interface { error }` pkg := mustTypecheck(src, nil, nil) // get original error.Error method eface := Universe.Lookup("error") orig, _, _ := LookupFieldOrMethod(eface.Type(), false, nil, "Error") if orig == nil { t.Fatalf("original error.Error not found") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 18 14:10:44 UTC 2024 - 5.2K bytes - Viewed (0) -
src/slices/slices.go
return s } // DeleteFunc removes any elements from s for which del returns true, // returning the modified slice. // DeleteFunc zeroes the elements between the new length and the original length. func DeleteFunc[S ~[]E, E any](s S, del func(E) bool) S { i := IndexFunc(s, del) if i == -1 { return s } // Don't start copying elements until we find one to delete.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 29 14:01:59 UTC 2024 - 13.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/trim.go
} // If the original block contained u = φ(u0, u1, ..., un) and // the current phi is // v = φ(v0, v1, ..., u, ..., vk) // then the merged phi is // v = φ(v0, v1, ..., u0, ..., vk, u1, ..., un) v.SetArg(i, u.Args[0]) v.AddArgs(u.Args[1:]...) } else { // If the original block contained u = φ(u0, u1, ..., un) and // the current phi is
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 4.2K bytes - Viewed (0) -
src/strconv/ftoa.go
} lower := new(decimal) lower.Assign(mantlo*2 + 1) lower.Shift(explo - int(flt.mantbits) - 1) // The upper and lower bounds are possible outputs only if // the original mantissa is even, so that IEEE round-to-even // would round to the original mantissa and not the neighbors. inclusive := mant%2 == 0 // As we walk the digits we want to know whether rounding up would fall
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:21:28 UTC 2024 - 13.9K bytes - Viewed (0)