}
}

// A StringReader delivers its data one string segment at a time via Read.
type StringReader struct {
	data []string
	step int
}

func (r *StringReader) Read(p []byte) (n int, err error) {
	if r.step < len(r.data) {
		s := r.data[r.step]
		n = copy(p, s)
		r.step++
	} else {
		err = io.EOF
	}
	return
}

func readRuneSegments(t *testing.T, segments []string) {
	got := ""

present to create such a binary.

Most builds both compile source code and invoke the linker to create a
binary. When cgo is involved, the compile step already requires gcc, so
it is not problematic for the link step to require gcc too.

An important exception is builds using a pre-compiled copy of the
standard library. In particular, package net uses cgo on most systems,

</p>

<pre>
var t T
</pre>

<h3 id="Package_initialization">Package initialization</h3>

<p>
Within a package, package-level variable initialization proceeds stepwise,
with each step selecting the variable earliest in <i>declaration order</i>
which has no dependencies on uninitialized variables.
</p>

<p>
More precisely, a package-level variable is considered <i>ready for

<code>string</code> takes the place of <code>P</code>.
And since <code>string</code> is identical to <code>string</code>,
this unification step succeeds as well.
Unification of the LHS and RHS of the equation is now finished.
Type inference succeeds because there is only one type equation,
no unification step failed, and the map is fully populated.
</p>

<p>
Unification uses a combination of <i>exact</i> and <i>loose</i>

pkg syscall (darwin-386), const PT_READ_D = 2
pkg syscall (darwin-386), const PT_READ_I = 1
pkg syscall (darwin-386), const PT_READ_U = 3
pkg syscall (darwin-386), const PT_SIGEXC = 12
pkg syscall (darwin-386), const PT_STEP = 9
pkg syscall (darwin-386), const PT_THUPDATE = 13
pkg syscall (darwin-386), const PT_TRACE_ME = 0
pkg syscall (darwin-386), const PT_WRITE_D = 5
pkg syscall (darwin-386), const PT_WRITE_I = 4

		buf[n-7] = '\x00'
	})
}

func BenchmarkCountSingle(b *testing.B) {
	benchBytes(b, indexSizes, func(b *testing.B, n int) {
		buf := bmbuf[0:n]
		step := 8
		for i := 0; i < len(buf); i += step {
			buf[i] = 1
		}
		expect := (len(buf) + (step - 1)) / step
		for i := 0; i < b.N; i++ {
			j := Count(buf, []byte{1})
			if j != expect {
				b.Fatal("bad count", j, expect)
			}
		}

	"bytes"
	"errors"
	"io"
	"unicode/utf8"
)

// Scanner provides a convenient interface for reading data such as
// a file of newline-delimited lines of text. Successive calls to
// the [Scanner.Scan] method will step through the 'tokens' of a file, skipping
// the bytes between the tokens. The specification of a token is
// defined by a split function of type [SplitFunc]; the default split

pkg syscall (darwin-arm64), const PT_READ_U ideal-int
pkg syscall (darwin-arm64), const PT_SIGEXC = 12
pkg syscall (darwin-arm64), const PT_SIGEXC ideal-int
pkg syscall (darwin-arm64), const PT_STEP = 9
pkg syscall (darwin-arm64), const PT_STEP ideal-int
pkg syscall (darwin-arm64), const PT_THUPDATE = 13
pkg syscall (darwin-arm64), const PT_THUPDATE ideal-int
pkg syscall (darwin-arm64), const PT_TRACE_ME = 0

pkg syscall (darwin-386), const PT_READ_I ideal-int
pkg syscall (darwin-386), const PT_READ_U ideal-int
pkg syscall (darwin-386), const PT_SIGEXC ideal-int
pkg syscall (darwin-386), const PT_STEP ideal-int
pkg syscall (darwin-386), const PT_THUPDATE ideal-int
pkg syscall (darwin-386), const PT_TRACE_ME ideal-int
pkg syscall (darwin-386), const PT_WRITE_D ideal-int

		log.Fatal(err)
	}
	s := string(bs)

	// Diagnose common mistakes people make,
	// since there is no apifmt to format these files.
	// The missing final newline is important for the
	// final release step of cat next/*.txt >go1.X.txt.
	// If the files don't end in full lines, the concatenation goes awry.
	if strings.Contains(s, "\r") {
		log.Printf("%s: contains CRLFs", filename)
		exitCode = 1
	}