- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 39 for whence (0.15 sec)
-
src/bytes/reader.go
// Seek implements the [io.Seeker] interface. func (r *Reader) Seek(offset int64, whence int) (int64, error) { r.prevRune = -1 var abs int64 switch whence { case io.SeekStart: abs = offset case io.SeekCurrent: abs = r.i + offset case io.SeekEnd: abs = int64(len(r.s)) + offset default: return 0, errors.New("bytes.Reader.Seek: invalid whence") } if abs < 0 {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Oct 13 17:10:31 GMT 2023 - 3.9K bytes - Viewed (1) -
src/archive/tar/tar_test.go
return len(b), nil } func (f *testFile) Seek(pos int64, whence int) (int64, error) { if pos == 0 && whence == io.SeekCurrent { return f.pos, nil } if len(f.ops) == 0 { return 0, errors.New("unexpected Seek operation") } s, ok := f.ops[0].(int64) if !ok { return 0, errors.New("unexpected Seek operation") } if s != pos || whence != io.SeekCurrent {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Mar 15 16:01:50 GMT 2024 - 24K bytes - Viewed (0) -
src/bufio/scan.go
// If we've run out of data but have an error, give the split function // a chance to recover any remaining, possibly empty token. if s.end > s.start || s.err != nil { advance, token, err := s.split(s.buf[s.start:s.end], s.err != nil) if err != nil { if err == ErrFinalToken { s.token = token s.done = true // When token is not nil, it means the scanning stops
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/archive/zip/reader.go
// jar tool) don't properly set the storage method on directories // resulting in a file with compressed size > 0 but uncompressed size == // 0. We still want to fail when a directory has associated uncompressed // data, but we are tolerant of cases where the uncompressed size is // zero but compressed size is not. if f.UncompressedSize64 != 0 { return &dirReader{ErrFormat}, nil } else {
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/tar/format.go
// sparse files | no | yes | yes // // The table's upper portion shows the [Header] fields, where each format reports // the maximum number of bytes allowed for each string field and // the integer type used to store each numeric field // (where timestamps are stored as the number of seconds since the Unix epoch). // // The table's lower portion shows specialized features of each format,
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Oct 13 18:36:46 GMT 2023 - 11.3K bytes - Viewed (0) -
src/cmd/cgo/godefs.go
// AST expression onto a single line. The lexer normally inserts a // semicolon at each newline, so we can replace newline with semicolon. // However, we can't do that in cases where the lexer would not insert // a semicolon. We only have to worry about cases that can occur in an // expression passed through gofmt, which means composite literals and
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Thu Sep 08 14:33:35 GMT 2022 - 4.5K bytes - Viewed (0) -
src/archive/zip/struct.go
Method uint16 // Modified is the modified time of the file. // // When reading, an extended timestamp is preferred over the legacy MS-DOS // date field, and the offset between the times is used as the timezone. // If only the MS-DOS date is present, the timezone is assumed to be UTC. // // When writing, an extended timestamp (which is timezone-agnostic) is
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
} } } } // test a small index across all page offsets func TestIndexByteSmall(t *testing.T) { b := make([]byte, 5015) // bigger than a page // Make sure we find the correct byte even when straddling a page. for i := 0; i <= len(b)-15; i++ { for j := 0; j < 15; j++ { b[i+j] = byte(100 + j) } for j := 0; j < 15; j++ { p := IndexByte(b[i:i+15], byte(100+j)) if p != j {
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
// should therefore be always resident in the L1 cache - until we // have completed the construction of the result. // This yields significant speedups (up to +100%) in cases where // the result length is large (roughly, over L2 cache size). const chunkLimit = 8 * 1024 chunkMax := n if chunkMax > chunkLimit { chunkMax = chunkLimit / len(b) * len(b) if chunkMax == 0 { chunkMax = len(b)
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/cmd/asm/internal/asm/parse.go
// $sym±offset(SB)(reg)(index*scale) // Exceptions are: // // R1 // offset // $offset // Every piece is optional, so we scan left to right and what // we discover tells us where we are. // Prefix: $. var prefix rune switch tok := p.peek(); tok { case '$', '*': prefix = rune(tok) p.next() } // Symbol: sym±offset(SB) tok := p.next()
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)