- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 212 for Next (0.15 sec)
-
src/cmd/asm/internal/lex/stack.go
s.tr = append(s.tr, tr) } func (s *Stack) Next() ScanToken { tos := s.tr[len(s.tr)-1] tok := tos.Next() for tok == scanner.EOF && len(s.tr) > 1 { tos.Close() // Pop the topmost item from the stack and resume with the next one down. s.tr = s.tr[:len(s.tr)-1] tok = s.Next() } return tok } func (s *Stack) Text() string { return s.tr[len(s.tr)-1].Text() } func (s *Stack) File() string {
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Mon Jan 09 22:33:23 GMT 2017 - 1.2K bytes - Viewed (0) -
src/cmd/asm/internal/lex/tokenizer.go
} func (t *Tokenizer) Col() int { return t.s.Pos().Column } func (t *Tokenizer) Next() ScanToken { s := t.s for { t.tok = ScanToken(s.Scan()) if t.tok != scanner.Comment { break } text := s.TokenText() t.line += strings.Count(text, "\n") if constraint.IsGoBuild(text) { t.tok = BuildComment break } } switch t.tok { case '\n': t.line++
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Thu Aug 04 20:35:21 GMT 2022 - 3K bytes - Viewed (0) -
cmd/erasure-decode.go
p.readers = tmp // next is the next non-preferred index. next := 0 for i, ok := range prefer { if !ok || p.readers[i] == nil { continue } if i == next { next++ continue } // Move reader with index i to index next. // Do this by swapping next and i p.readers[next], p.readers[i] = p.readers[i], p.readers[next] p.readerToBuf[next] = i p.readerToBuf[i] = next next++
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Fri Apr 19 16:44:59 GMT 2024 - 9.4K bytes - Viewed (0) -
src/archive/tar/reader.go
return &Reader{r: r, curr: ®FileReader{r, 0}} } // Next advances to the next entry in the tar archive. // The Header.Size determines how many bytes can be read for the next file. // Any remaining data in the current file is automatically discarded. // At the end of the archive, Next returns the error io.EOF. // // If Next encounters a non-local name (as defined by [filepath.IsLocal])
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Fri Mar 08 01:59:14 GMT 2024 - 26.8K bytes - Viewed (0) -
src/cmd/asm/internal/lex/slice.go
s.pos++ if s.pos >= len(s.tokens) { return scanner.EOF } return s.tokens[s.pos].ScanToken } func (s *Slice) Text() string { return s.tokens[s.pos].text } func (s *Slice) File() string { return s.base.Filename() } func (s *Slice) Base() *src.PosBase { return s.base } func (s *Slice) SetBase(base *src.PosBase) {
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Thu Jun 29 22:49:50 GMT 2023 - 1.6K bytes - Viewed (0) -
src/bytes/buffer.go
b.lastRead = opRead } return n, nil } // Next returns a slice containing the next n bytes from the buffer, // advancing the buffer as if the bytes had been returned by [Buffer.Read]. // If there are fewer than n bytes in the buffer, Next returns the entire buffer. // The slice is only valid until the next call to a read or write method. func (b *Buffer) Next(n int) []byte { b.lastRead = opInvalid m := b.Len()
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Fri Oct 13 17:10:31 GMT 2023 - 15.7K bytes - Viewed (0) -
src/bufio/bufio.go
return } } b.err = io.ErrNoProgress } func (b *Reader) readErr() error { err := b.err b.err = nil return err } // Peek returns the next n bytes without advancing the reader. The bytes stop // being valid at the next read call. If Peek returns fewer than n bytes, it // also returns an error explaining why the read is short. The error is // [ErrBufferFull] if n is larger than b's buffer size. //
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Thu Oct 12 14:39:08 GMT 2023 - 21.8K bytes - Viewed (0) -
internal/s3select/simdj/reader.go
} continue } i := in.Value.Iter() readloop: for { var next simdjson.Iter typ, err := i.AdvanceIter(&next) if err != nil { r.err = &err return } switch typ { case simdjson.TypeNone: break readloop case simdjson.TypeRoot: typ, obj, err := next.Root(nil) if err != nil { r.err = &err return }
Go - Registered: Sun Apr 21 19:28:08 GMT 2024 - Last Modified: Tue May 30 17:02:22 GMT 2023 - 4.9K bytes - Viewed (0) -
internal/config/batch/batch.go
// would wait before working on next object. func (opts Config) ExpirationWait() time.Duration { configMu.RLock() defer configMu.RUnlock() return opts.ExpirationWorkersWait } // ReplicationWait returns the duration for which a batch replication worker // would wait before working on next object. func (opts Config) ReplicationWait() time.Duration { configMu.RLock()
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Wed Dec 06 09:09:22 GMT 2023 - 4.7K bytes - Viewed (0) -
docs/debugging/inspect/decrypt-v2.go
} if err := stream.Skip(); err != nil { return fmt.Errorf("stream skip: %w", err) } continue } if extracted { return keepFileErr{fmt.Errorf("next stream: %w", err)} } return fmt.Errorf("next stream: %w", err) } if stream.Name == "inspect.zip" { if extracted { return keepFileErr{errors.New("multiple inspect.zip streams found")} } _, err := io.Copy(w, stream)
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Thu Apr 11 21:22:47 GMT 2024 - 2.2K bytes - Viewed (0)