- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 25 for original (0.35 sec)
-
src/go/printer/printer_test.go
// ... c*t.z } ` // parse original f1, err := parser.ParseFile(fset, "src", src, parser.ParseComments) if err != nil { t.Fatal(err) } // pretty-print original var buf bytes.Buffer err = (&Config{Mode: UseSpaces | SourcePos, Tabwidth: 8}).Fprint(&buf, fset, f1) if err != nil { t.Fatal(err) } // parse pretty printed original
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 03 14:56:25 UTC 2024 - 20.4K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/sha3/sha3_s390x.go
// It does not change the underlying hash state. func (s *asmState) Sum(b []byte) []byte { if s.state != spongeAbsorbing { panic("sha3: Sum after Read") } // Copy the state to preserve the original. a := s.a // Hash the buffer. Note that we don't clear it because we // aren't updating the state. switch s.function { case sha3_224, sha3_256, sha3_384, sha3_512: klmd(s.function, &a, nil, s.buf)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 7.5K bytes - Viewed (0) -
src/syscall/rlimit.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. //go:build unix package syscall import ( "sync/atomic" ) // origRlimitNofile, if non-nil, is the original soft RLIMIT_NOFILE. var origRlimitNofile atomic.Pointer[Rlimit] // Some systems set an artificially low soft limit on open file count, for compatibility // with code that uses select and its hard-coded maximum file descriptor
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 20:13:57 UTC 2024 - 1.6K bytes - Viewed (0) -
src/cmd/go/internal/modget/get.go
} type resolver struct { localQueries []*query // queries for absolute or relative paths pathQueries []*query // package path literal queries in original order wildcardQueries []*query // path wildcard queries in original order patternAllQueries []*query // queries with the pattern "all" // Indexed "none" queries. These are also included in the slices above;
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 18:26:32 UTC 2024 - 66.5K bytes - Viewed (0) -
src/cmd/vendor/rsc.io/markdown/inline.go
Plain i int // position in input where bracket is } type emphPlain struct { Plain canOpen bool canClose bool i int // position in output where emph is n int // length of original span } type Escaped struct { Plain } func (x *Escaped) printMarkdown(buf *bytes.Buffer) { buf.WriteByte('\\') x.Plain.printMarkdown(buf) } type Code struct { Text string
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 21.9K bytes - Viewed (0) -
src/os/signal/doc.go
flag and otherwise keep the signal handler. If Notify is called for an asynchronous signal, a Go signal handler will be installed for that signal. If, later, Reset is called for that signal, the original handling for that signal will be reinstalled, restoring the non-Go signal handler if any. Go code built without -buildmode=c-archive or -buildmode=c-shared will
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 18:11:00 UTC 2024 - 11K bytes - Viewed (0) -
src/cmd/compile/internal/types2/unify.go
} case *Named: // Two named types unify if their type names originate in the same type declaration. // If they are instantiated, their type argument lists must unify. if y := asNamed(y); y != nil { // Check type arguments before origins so they unify // even if the origins don't match; for better error // messages (see go.dev/issue/53692). xargs := x.TypeArgs().list()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 11 16:24:39 UTC 2024 - 27.8K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/sha3/sha3.go
// number of output bytes. It panics if any output has already been read. func (d *state) Sum(in []byte) []byte { if d.state != spongeAbsorbing { panic("sha3: Sum after Read") } // Make a copy of the original hash so that caller can keep writing // and summing. dup := d.clone() hash := make([]byte, dup.outputLen, 64) // explicit cap to allow stack allocation dup.Read(hash) return append(in, hash...)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 5.4K bytes - Viewed (0) -
src/go/types/unify.go
} case *Named: // Two named types unify if their type names originate in the same type declaration. // If they are instantiated, their type argument lists must unify. if y := asNamed(y); y != nil { // Check type arguments before origins so they unify // even if the origins don't match; for better error // messages (see go.dev/issue/53692). xargs := x.TypeArgs().list()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 11 16:24:39 UTC 2024 - 27.9K bytes - Viewed (0) -
src/net/http/server.go
// or clear those deadlines as needed. // // The returned bufio.Reader may contain unprocessed buffered // data from the client. // // After a call to Hijack, the original Request.Body must not // be used. The original Request's Context remains valid and // is not canceled until the Request's ServeHTTP method // returns. Hijack() (net.Conn, *bufio.ReadWriter, error) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 17:57:01 UTC 2024 - 123.4K bytes - Viewed (0)