- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for sufficient (0.17 sec)
-
src/bytes/buffer.go
// sufficient to initialize a [Buffer]. func NewBuffer(buf []byte) *Buffer { return &Buffer{buf: buf} } // NewBufferString creates and initializes a new [Buffer] using string s as its // initial contents. It is intended to prepare a buffer to read an existing // string. // // In most cases, new([Buffer]) (or just declaring a [Buffer] variable) is // sufficient to initialize a [Buffer].
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/builtin/builtin.go
// stand-in for either complex type: complex64 or complex128. type ComplexType complex64 // The append built-in function appends elements to the end of a slice. If // it has sufficient capacity, the destination is resliced to accommodate the // new elements. If it does not, a new underlying array will be allocated. // Append returns the updated slice. It is therefore necessary to store the
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/bytes/buffer_test.go
b = strconv.AppendInt(b, int64(i), 10) want = strconv.AppendInt(want, int64(i), 10) got.Write(b) } if !Equal(got.Bytes(), want) { t.Fatalf("Bytes() = %q, want %q", got, want) } // With a sufficiently sized buffer, there should be no allocations. n := testing.AllocsPerRun(100, func() { got.Reset() for i := 0; i < 1000; i++ { b := got.AvailableBuffer() b = strconv.AppendInt(b, int64(i), 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) -
doc/go1.17_spec.html
<pre class="grammar"> append(s S, x ...T) S // T is the element type of S </pre> <p> If the capacity of <code>s</code> is not large enough to fit the additional values, <code>append</code> allocates a new, sufficiently large underlying array that fits both the existing slice elements and the additional values. Otherwise, <code>append</code> re-uses the underlying array. </p> <pre> s0 := []int{0, 0}
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/writer.go
panic("zip: SetOffset called after data was written") } w.cw.count = n } // Flush flushes any buffered data to the underlying writer. // Calling Flush is not normally necessary; calling Close is sufficient. func (w *Writer) Flush() error { return w.cw.w.(*bufio.Writer).Flush() } // SetComment sets the end-of-central-directory comment field. // It can only be called before [Writer.Close].
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Thu Apr 04 14:28:57 GMT 2024 - 19.3K bytes - Viewed (0) -
src/cmd/cgo/gcc.go
fmt.Fprintf(&b, "#line 1 \"completed\"\n"+ "int __cgo__1 = __cgo__2;\n") // We need to parse the output from this gcc command, so ensure that it // doesn't have any ANSI escape sequences in it. (TERM=dumb is // insufficient; if the user specifies CGO_CFLAGS=-fdiagnostics-color, // GCC will ignore TERM, and GCC can also be configured at compile-time // to ignore TERM.) stderr := p.gccErrors(b.Bytes(), "-fdiagnostics-color=never")
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Thu Nov 02 16:43:23 GMT 2023 - 97K bytes - Viewed (0) -
doc/next/6-stdlib/2-unique.md
Two `Handle[T]` are equal if and only if the values used to produce the handles are equal, allowing programs to deduplicate values and reduce their memory footprint. Comparing two `Handle[T]` values is efficient, reducing down to a simple
Plain Text - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Wed Apr 24 13:37:36 GMT 2024 - 579 bytes - Viewed (0) -
README.md
# The Go Programming Language Go is an open source programming language that makes it easy to build simple, reliable, and efficient software. ![Gopher image](https://golang.org/doc/gopher/fiveyears.jpg) *Gopher image by [Renee French][rf], licensed under [Creative Commons 4.0 Attributions license][cc4-by].* Our canonical Git repository is located at https://go.googlesource.com/go. There is a mirror of the repository at https://github.com/golang/go.
Plain Text - Registered: Tue May 07 11:14:38 GMT 2024 - Last Modified: Wed Nov 02 20:14:56 GMT 2022 - 1.4K bytes - Viewed (0) -
src/bytes/bytes.go
spans := make([]span, 0, 32) // Find the field start and end indices. // Doing this in a separate pass (rather than slicing the string s // and collecting the result substrings right away) is significantly // more efficient, possibly due to cache effects. start := -1 // valid span start if >= 0 for i := 0; i < len(s); { size := 1 r := rune(s[i]) if r >= utf8.RuneSelf { r, size = utf8.DecodeRune(s[i:]) }
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
append(s S, x ...E) S // core type of S is []E </pre> <p> If the capacity of <code>s</code> is not large enough to fit the additional values, <code>append</code> <a href="#Allocation">allocates</a> a new, sufficiently large underlying array that fits both the existing slice elements and the additional values. Otherwise, <code>append</code> re-uses the underlying array. </p> <pre> s0 := []int{0, 0}
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)