- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 17 for Kast (0.14 sec)
-
src/bytes/buffer_test.go
b.ReportAllocs() for i := 0; i < b.N; i++ { bb.Reset() b := bb.AvailableBuffer() b = b[:cap(b)] // use max capacity to simulate a large append operation bb.Write(b) // should be nearly infinitely fast }
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) -
doc/go1.17_spec.html
bit3, mask3 // bit3 == 8, mask3 == 7 (iota == 3) ) </pre> <p> This last example exploits the <a href="#Constant_declarations">implicit repetition</a> of the last non-empty expression list. </p> <h3 id="Type_declarations">Type declarations</h3> <p>
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Thu Apr 11 20:22:45 GMT 2024 - 211.6K bytes - Viewed (0) -
src/archive/zip/reader_test.go
// If content is very large, an alternative to setting Content or File // is to set Size, which will then be checked against the header-reported size // but will bypass the decompressing of the actual data. // This last option is used for testing very large (multi-GB) compressed files. ContentErr error Content []byte File string Size uint64 } var tests = []ZipTest{ { Name: "test.zip",
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Mar 27 18:23:49 GMT 2024 - 55.3K bytes - Viewed (0) -
src/bytes/boundary_test.go
q[j-1] = 1 // difference is only found on the last byte for i := range b { idx := Index(b[i:], q[:j]) if idx != -1 { t.Fatalf("Index(b[%d:], q[:%d])=%d, want -1\n", i, j, idx) } } q[j-1] = 0 } // Test differing alignments and sizes of q which always end on a page boundary. q[len(q)-1] = 1 // difference is only found on the last byte for j := 0; j < len(q); j++ { for i := range b {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Thu Nov 30 20:05:58 GMT 2023 - 2.8K bytes - Viewed (0) -
lib/time/zoneinfo.zip
Australia/Lord_Howe Australia/Melbourne Australia/NSW Australia/North Australia/Perth Australia/Queensland Australia/South Australia/Sydney Australia/Tasmania Australia/Victoria Australia/West Australia/Yancowinna Brazil/Acre Brazil/DeNoronha Brazil/East Brazil/West CET CST6CDT Canada/Atlantic Canada/Central Canada/Eastern Canada/Mountain Canada/Newfoundland Canada/Pacific Canada/Saskatchewan Canada/Yukon Chile/Continental Chile/EasterIsland Cuba EET EST EST5EDT Egypt Eire Etc/GMT Etc/GMT+0 Etc/GMT+1...
ZIP Archive - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Feb 02 18:20:41 GMT 2024 - 392.3K bytes - Viewed (1) -
src/archive/tar/common.go
// The input must have been already validated. // // This function mutates src and returns a normalized map where: // - adjacent fragments are coalesced together // - only the last fragment may be empty // - the endOffset of the last fragment is the total size func invertSparseEntries(src []sparseEntry, size int64) []sparseEntry { dst := src[:0] var pre sparseEntry for _, cur := range src { if cur.Length == 0 {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Mar 15 16:01:50 GMT 2024 - 24.7K bytes - Viewed (2) -
src/bytes/bytes.go
return bytealg.IndexByte(b, c) } func indexBytePortable(s []byte, c byte) int { for i, b := range s { if b == c { return i } } return -1 } // LastIndex returns the index of the last instance of sep in s, or -1 if sep is not present in s. func LastIndex(s, sep []byte) int { n := len(sep) switch { case n == 0: return len(s) case n == 1: return bytealg.LastIndexByte(s, sep[0])
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/bytes_test.go
if first != tc.first { t.Errorf("IndexFunc(%q, %s) = %d; want %d", tc.in, tc.f.name, first, tc.first) } last := LastIndexFunc([]byte(tc.in), tc.f.f) if last != tc.last { t.Errorf("LastIndexFunc(%q, %s) = %d; want %d", tc.in, tc.f.name, last, tc.last) } } } type ReplaceTest struct { in string old, new string n int out string }
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/archive/zip/zip_test.go
buf []repeatedByte } func (r *rleBuffer) Size() int64 { if len(r.buf) == 0 { return 0 } last := &r.buf[len(r.buf)-1] return last.off + last.n } func (r *rleBuffer) Write(p []byte) (n int, err error) { var rp *repeatedByte if len(r.buf) > 0 { rp = &r.buf[len(r.buf)-1] // Fast path, if p is entirely the same byte repeated. if lastByte := rp.b; len(p) > 0 && p[0] == lastByte {
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) -
doc/asm.html
visible only in the current source file, like a top-level <code>static</code> declaration in a C file. Adding an offset to the name refers to that offset from the symbol's address, so <code>foo+4(SB)</code> is four bytes past the start of <code>foo</code>. </p> <p> The <code>FP</code> pseudo-register is a virtual frame pointer used to refer to function arguments.
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Tue Nov 28 19:15:27 GMT 2023 - 36.3K bytes - Viewed (0)