- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 21 for Stuart (0.29 sec)
-
src/bufio/scan.go
if s.err != nil { // Shut it down. s.start = 0 s.end = 0 return false } // Must read more data. // First, shift data to beginning of buffer if there's lots of empty space // or space is needed. if s.start > 0 && (s.end == len(s.buf) || s.start > len(s.buf)/2) { copy(s.buf, s.buf[s.start:s.end]) s.end -= s.start s.start = 0 } // Is the buffer full? If so, resize.
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Mon Oct 23 09:06:30 GMT 2023 - 14.2K bytes - Viewed (0) -
src/cmd/asm/internal/asm/expr_test.go
{"4611686018427387904", 4611686018427387904, true}, } func TestExpr(t *testing.T) { p := NewParser(nil, nil, nil) // Expression evaluation uses none of these fields of the parser. for i, test := range exprTests { p.start(lex.Tokenize(test.input)) result := int64(p.expr()) if result != test.output { t.Errorf("%d: %q evaluated to %d; expected %d", i, test.input, result, test.output) } tok := p.next()
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Tue Aug 29 07:48:38 GMT 2023 - 3.2K bytes - Viewed (0) -
src/archive/zip/reader.go
d.dirDiskNbr = b.uint32() // number of the disk with the start of the central directory d.dirRecordsThisDisk = b.uint64() // total number of entries in the central directory on this disk d.directoryRecords = b.uint64() // total number of entries in the central directory d.directorySize = b.uint64() // size of the central directory d.directoryOffset = b.uint64() // offset of start of central directory with respect to the starting disk number
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Oct 13 18:36:46 GMT 2023 - 27.7K bytes - Viewed (0) -
src/archive/zip/struct.go
// See the [ZIP specification] for details. // // [ZIP specification]: https://support.pkware.com/pkzip/appnote type FileHeader struct { // Name is the name of the file. // // It must be a relative path, not start with a drive letter (such as "C:"), // and must use forward slashes instead of back slashes. A trailing slash // indicates that this file is a directory and should have no data. Name string
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Oct 13 18:36:46 GMT 2023 - 12.1K bytes - Viewed (0) -
src/bytes/bytes_test.go
func TestIndexByteBig(t *testing.T) { var n = 1024 if testing.Short() { n = 128 } b := make([]byte, n) for i := 0; i < n; i++ { // different start alignments b1 := b[i:] for j := 0; j < len(b1); j++ { b1[j] = 'x' pos := IndexByte(b1, 'x') if pos != j { t.Errorf("IndexByte(%q, 'x') = %v", b1, pos) } b1[j] = 0
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Jan 24 16:07:25 GMT 2024 - 56.2K bytes - Viewed (0) -
src/bytes/bytes.go
// more efficient, possibly due to cache effects. start := -1 // valid span start if >= 0 for i := 0; i < len(s); { size := 1 r := rune(s[i]) if r >= utf8.RuneSelf { r, size = utf8.DecodeRune(s[i:]) } if f(r) { if start >= 0 { spans = append(spans, span{start, i}) start = -1 } } else { if start < 0 { start = i } } i += size }
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Mon Feb 19 19:51:15 GMT 2024 - 33.8K bytes - Viewed (0) -
src/archive/zip/zip_test.go
add := len(p) if add > space { add = space } ss.buf = append(ss.buf, p[:add]...) p = p[add:] } for len(p) > 0 { n := copy(ss.buf[ss.start:], p) p = p[n:] ss.start += n if ss.start == ss.keep { ss.start = 0 } } return } // generatesZip64 reports whether f wrote a zip64 file. // f is also responsible for closing w.
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Mar 27 18:23:49 GMT 2024 - 19.5K bytes - Viewed (0) -
src/cmd/asm/internal/asm/parse.go
for _, op := range operands { p.start(op) if name, abi, ok := p.funcAddress(); ok { fmt.Fprintf(w, "ref %s %s\n", name, abi) } } } func (p *Parser) start(operand []lex.Token) { p.input = operand p.inputPos = 0 } // address parses the operand into a link address structure. func (p *Parser) address(operand []lex.Token) obj.Addr { p.start(operand) addr := obj.Addr{}
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Feb 21 14:34:57 GMT 2024 - 36.9K bytes - Viewed (0) -
src/cmd/asm/internal/lex/input.go
// We have a '#'; it must be followed by a known word (define, include, etc.). tok := in.Stack.Next() if tok != scanner.Ident { in.expectText("expected identifier after '#'") } if !in.enabled() { // Can only start including again if we are at #else or #endif but also // need to keep track of nested #if[n]defs. // We let #line through because it might affect errors. switch in.Stack.Text() {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Tue Aug 29 07:48:38 GMT 2023 - 12.6K bytes - Viewed (0) -
src/cmd/cgo/internal/test/issue18146.go
for n := attempts; n > 0; n-- { cmd := exec.Command(os.Args[0], args...) cmd.Env = append(os.Environ(), "test18146=exec") buf := bytes.NewBuffer(nil) cmd.Stdout = buf cmd.Stderr = buf if err := cmd.Start(); err != nil { // We are starting so many processes that on // some systems (problem seen on Darwin, // Dragonfly, OpenBSD) the fork call will fail // with EAGAIN. if pe, ok := err.(*os.PathError); ok {
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Tue Sep 05 23:35:32 GMT 2023 - 2.8K bytes - Viewed (0)