- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 13 for Carter (0.18 sec)
-
src/archive/tar/format.go
// // While this format is compatible with most tar readers, // the format has several limitations making it unsuitable for some usages. // Most notably, it cannot support sparse files, files larger than 8GiB, // filenames larger than 256 characters, and non-ASCII filenames. // // Reference: // http://pubs.opengroup.org/onlinepubs/9699919799/utilities/pax.html#tag_20_92_13_06 FormatUSTAR
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/bufio/scan.go
panic("Buffer called after Scan") } s.buf = buf[0:cap(buf)] s.maxTokenSize = max } // Split sets the split function for the [Scanner]. // The default split function is [ScanLines]. // // Split panics if it is called after scanning has started. func (s *Scanner) Split(split SplitFunc) { if s.scanCalled { panic("Split called after Scan") } s.split = split } // Split functions
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/bytes/bytes_test.go
for _, tt := range cutTests { if before, after, found := Cut([]byte(tt.s), []byte(tt.sep)); string(before) != tt.before || string(after) != tt.after || found != tt.found { t.Errorf("Cut(%q, %q) = %q, %q, %v, want %q, %q, %v", tt.s, tt.sep, before, after, found, tt.before, tt.after, tt.found) } } } var cutPrefixTests = []struct { s, sep string after string found bool }{
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
n := len(b) * count if len(b) == 0 { return []byte{} } // Past a certain chunk size it is counterproductive to use // larger chunks as the source of the write, as when the source // is too large we are basically just thrashing the CPU D-cache. // So if the result length is larger than an empirically-found // limit (8KB), we stop growing the source string once the limit
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/bytes/buffer_test.go
if err := b.UnreadByte(); err == nil { t.Fatal("UnreadByte after ReadByte at EOF: got no error") } // check not at EOF b.WriteString("abcdefghijklmnopqrstuvwxyz") // after unsuccessful read if n, err := b.Read(nil); n != 0 || err != nil { t.Fatalf("Read(nil) = %d,%v; want 0,nil", n, err) } if err := b.UnreadByte(); err == nil { t.Fatal("UnreadByte after Read(nil): got no error") }
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Apr 26 13:31:36 GMT 2024 - 18.6K bytes - Viewed (0) -
src/cmd/cgo/doc.go
decide which. The obvious thing for cgo to do is to process the preamble, expanding #includes and processing the corresponding C code. That would require a full C parser and type checker that was also aware of any extensions known to the system compiler (for example, all the GNU C extensions) as well as the system-specific header locations and system-specific
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Sun Mar 31 09:02:45 GMT 2024 - 42.1K bytes - Viewed (0) -
src/cmd/cgo/gcc.go
n.Const = fmt.Sprintf("%#x", i) } else if n.Define[0] == '\'' { if _, err := parser.ParseExpr(n.Define); err == nil { n.Kind = "iconst" n.Const = n.Define } } else if n.Define[0] == '"' { if _, err := parser.ParseExpr(n.Define); err == nil { n.Kind = "sconst" n.Const = n.Define } } if n.IsConst() { continue
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Thu Nov 02 16:43:23 GMT 2023 - 97K bytes - Viewed (0) -
src/bytes/compare_test.go
// difference that for some j, a[j]>b[j] and a[j+1]<b[j+1]. If the implementation // compares large chunks with wrong endianness, it gets wrong result. // no vector register is larger than 512 bytes for now const maxLength = 512 a := make([]byte, maxLength) b := make([]byte, maxLength) // randomish but deterministic data. No 0 or 255. for i := 0; i < maxLength; i++ {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Thu Jul 13 23:11:42 GMT 2023 - 6.8K bytes - Viewed (0) -
src/bufio/scan_test.go
t.Fatal("looping") } } if s.Err() != nil { t.Fatal("after scan:", s.Err()) } } func TestBlankLines(t *testing.T) { s := NewScanner(strings.NewReader(strings.Repeat("\n", 1000))) for count := 0; s.Scan(); count++ { if count > 2000 { t.Fatal("looping") } } if s.Err() != nil { t.Fatal("after scan:", s.Err()) } } type countdown int
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Sep 22 16:22:42 GMT 2023 - 14.3K bytes - Viewed (0) -
misc/go_android_exec/main.go
// walking the tree and copying it piecewise. If the directory tree // contains nested modules this could push a lot of unnecessary contents, // but for the golang.org/x repos it seems to be significantly (~2x) // faster than copying one file at a time (via filepath.WalkDir), // apparently due to high latency in 'adb' commands. if err := adb("push", modDir, deviceModDir); err != nil { return 0, err } } else {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Mon Aug 21 17:46:57 GMT 2023 - 15.3K bytes - Viewed (0)