- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for Cap (0.13 sec)
-
src/bufio/scan.go
} } // Buffer sets the initial buffer to use when scanning // and the maximum size of buffer that may be allocated during scanning. // The maximum token size must be less than the larger of max and cap(buf). // If max <= cap(buf), [Scanner.Scan] will use this buffer only and do no allocation. // // By default, [Scanner.Scan] uses an internal buffer and sets the // maximum token size to [MaxScanTokenSize]. //
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/example_test.go
b = append(b, ' ') buf.Write(b) } os.Stdout.Write(buf.Bytes()) // Output: 0 1 2 3 } func ExampleBuffer_Cap() { buf1 := bytes.NewBuffer(make([]byte, 10)) buf2 := bytes.NewBuffer(make([]byte, 0, 10)) fmt.Println(buf1.Cap()) fmt.Println(buf2.Cap()) // Output: // 10 // 10 } func ExampleBuffer_Grow() { var b bytes.Buffer b.Grow(64) bb := b.Bytes()
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Mon Mar 04 15:54:40 GMT 2024 - 15K bytes - Viewed (1) -
src/builtin/builtin.go
// capacity" section for details. func len(v Type) int // The cap built-in function returns the capacity of v, according to its type: // // Array: the number of elements in v (same as len(v)). // Pointer to array: the number of elements in *v (same as len(v)). // Slice: the maximum length the slice can reach when resliced; // if v is nil, cap(v) is zero. // Channel: the channel buffer capacity, in units of elements;
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Thu Apr 11 20:22:45 GMT 2024 - 12.7K bytes - Viewed (0) -
src/arena/arena.go
// not be used after the arena is freed. Accessing the underlying storage of the // slice after free may result in a fault, but this fault is also not guaranteed. func MakeSlice[T any](a *Arena, len, cap int) []T { var sl []T runtime_arena_arena_Slice(a.a, &sl, cap) return sl[:len] } // Clone makes a shallow copy of the input value that is no longer bound to any // arena it may have been allocated from, returning the copy. If it was not
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Oct 12 20:23:36 GMT 2022 - 4.3K bytes - Viewed (0) -
src/arena/arena_test.go
defer a.Free() tt := arena.New[T1](a) tt.n = 1 ts := arena.MakeSlice[T1](a, 99, 100) if len(ts) != 99 { t.Errorf("Slice() len = %d, want 99", len(ts)) } if cap(ts) != 100 { t.Errorf("Slice() cap = %d, want 100", cap(ts)) } ts[1].n = 42 } func TestSmokeLarge(t *testing.T) { a := arena.NewArena() defer a.Free() for i := 0; i < 10*64; i++ { _ = arena.New[T2](a) }
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Oct 12 20:23:36 GMT 2022 - 742 bytes - Viewed (0) -
src/bytes/bytes_test.go
if !reflect.DeepEqual(a, b) { t.Errorf("Split disagrees withSplitN(%q, %q, %d) = %v; want %v", tt.s, tt.sep, tt.n, b, a) } } if len(a) > 0 { in, out := a[0], s if cap(in) == cap(out) && &in[:1][0] == &out[:1][0] { t.Errorf("Join(%#v, %q) didn't copy", a, tt.sep) } } } } var splitaftertests = []SplitTest{ {abcd, "a", -1, []string{"a", "bcd"}},
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/buffer_test.go
var cap0 int for i := 0; i < 5<<10; i++ { b.Write(buf) b.Read(buf) if i == 0 { cap0 = b.Cap() } } cap1 := b.Cap() // (*Buffer).grow allows for 2x capacity slop before sliding, // so set our error threshold at 3x. if cap1 > cap0*3 { t.Errorf("buffer cap = %d; too big (grew from %d)", cap1, cap0) } } func BenchmarkWriteByte(b *testing.B) { const n = 4 << 10
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/bytes/buffer.go
func (b *Buffer) Len() int { return len(b.buf) - b.off } // Cap returns the capacity of the buffer's underlying byte slice, that is, the // total space allocated for the buffer's data. func (b *Buffer) Cap() int { return cap(b.buf) } // Available returns how many bytes are unused in the buffer. func (b *Buffer) Available() int { return cap(b.buf) - len(b.buf) }
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Oct 13 17:10:31 GMT 2023 - 15.7K bytes - Viewed (0) -
src/cmd/asm/internal/asm/parse.go
nesting := 0 colon := -1 for tok != '\n' && tok != ';' { // Process one operand. var items []lex.Token if cap(operands) > len(operands) { // Reuse scratch items slice. items = operands[:cap(operands)][len(operands)][:0] } else { items = make([]lex.Token, 0, 3) } for { tok = p.nextToken() if len(operands) == 0 && len(items) == 0 {
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) -
src/bufio/bufio_test.go
// Obtain a buffer to append to. b := w.AvailableBuffer() if w.Available() != cap(b) { t.Fatalf("Available() = %v, want %v", w.Available(), cap(b)) } // While not recommended, it is valid to append to a shifted buffer. // This forces Write to copy the input. if rn.Intn(8) == 0 && cap(b) > 0 { b = b[1:1:cap(b)] } // Append a random integer of varying width.
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Feb 10 18:56:01 GMT 2023 - 51.5K bytes - Viewed (0)