- Sort Score
- Result 10 results
- Languages All
Results 11 - 18 of 18 for learner (0.2 sec)
-
src/bytes/bytes_test.go
actual := LastIndexByte([]byte(test.a), test.b[0]) if actual != test.i { t.Errorf("LastIndexByte(%q,%c) = %v; want %v", test.a, test.b[0], actual, test.i) } } } // test a larger buffer with different sizes and alignments func TestIndexByteBig(t *testing.T) { var n = 1024 if testing.Short() { n = 128 } b := make([]byte, n) for i := 0; i < n; i++ {
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) -
doc/go_spec.html
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Thu May 02 22:43:51 GMT 2024 - 279.6K 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) -
doc/go_mem.html
</p> <p> Reads of memory locations larger than a single machine word are encouraged but not required to meet the same semantics as word-sized memory locations, observing a single allowed write <i>w</i>. For performance reasons, implementations may instead treat larger operations as a set of individual machine-word-sized operations in an unspecified order.
HTML - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Mon Mar 04 15:54:42 GMT 2024 - 26.6K bytes - Viewed (0) -
src/bufio/scan_test.go
break } } if got, want := scanner.Err(), ErrBadReadCount; got != want { t.Errorf("scanner.Err: got %v, want %v", got, want) } } // largeReader returns an invalid count that is larger than the number // of bytes requested. type largeReader struct{} func (largeReader) Read(p []byte) (int, error) { return len(p) + 1, nil }
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) -
src/bufio/bufio.go
// 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. // // Calling Peek prevents a [Reader.UnreadByte] or [Reader.UnreadRune] call from succeeding // until the next read operation. func (b *Reader) Peek(n int) ([]byte, error) { if n < 0 {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Thu Oct 12 14:39:08 GMT 2023 - 21.8K bytes - Viewed (0) -
src/archive/tar/reader.go
} } return hdr, &tr.blk, p.err } // readOldGNUSparseMap reads the sparse map from the old GNU sparse format. // The sparse map is stored in the tar header if it's small enough. // If it's larger than four entries, then one or more extension headers are used // to store the rest of the sparse map. // // The Header.Size does not reflect the size of any extended headers used.
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Mar 08 01:59:14 GMT 2024 - 26.8K bytes - Viewed (0)