pkg go/types, method (*Scope) Contains(token.Pos) bool
pkg go/types, method (*Scope) End() token.Pos
pkg go/types, method (*Scope) Innermost(token.Pos) *Scope
pkg go/types, method (*Scope) Insert(Object) Object
pkg go/types, method (*Scope) Len() int
pkg go/types, method (*Scope) Lookup(string) Object
pkg go/types, method (*Scope) LookupParent(string, token.Pos) (*Scope, Object)

//go:norace func (out *Nat) Mod(x *Nat, m *Modulus) *Nat { out.resetFor(m) // Working our way from the most significant to the least significant limb, // we can insert each limb at the least significant position, shifting all // previous limbs left by _W. This way each limb will get shifted by the // correct number of bits. We can insert at least N - 1 limbs without // overflowing m. After that, we need to reduce every time we shift. i := len(x.limbs) - 1 // For the first N - 1 limbs we can skip...

//go:norace func (out *Nat) Mod(x *Nat, m *Modulus) *Nat { out.resetFor(m) // Working our way from the most significant to the least significant limb, // we can insert each limb at the least significant position, shifting all // previous limbs left by _W. This way each limb will get shifted by the // correct number of bits. We can insert at least N - 1 limbs without // overflowing m. After that, we need to reduce every time we shift. i := len(x.limbs) - 1 // For the first N - 1 limbs we can skip...

	bucket := "ls-benchmark-bucket"
	// Create a bucket.
	err := obj.MakeBucket(b.Context(), bucket, MakeBucketOptions{})
	if err != nil {
		b.Fatal(err)
	}

	// Insert objects to be listed and benchmarked later.
	for i := range 20000 {
		key := "obj" + strconv.Itoa(i)

			}
		default:
			actualSize = n
		}
	}
	// If ServerSideChecksum is wanted for this object, it takes precedence
	// over opts.WantChecksum.
	if opts.WantServerSideChecksumType.IsSet() {
		serverSideChecksum := r.RawServerSideChecksumResult()
		if serverSideChecksum != nil {
			fi.Checksum = serverSideChecksum.AppendTo(nil, nil)
			if opts.EncryptFn != nil {

	meta := make(map[string]string)
	cs, isMP = oi.decryptChecksums(partNum, h)
	for k, v := range cs {
		if k == xhttp.AmzChecksumType {
			continue
		}
		cktype := hash.ChecksumStringToType(k)
		if cktype.IsSet() {
			meta[cktype.Key()] = v
			meta[xhttp.AmzChecksumAlgo] = cktype.String()
		}
	}
	return meta, isMP

</p>

<pre>
x.(T)
</pre>

<p>
asserts that <code>x</code> is not <code>nil</code>
and that the value stored in <code>x</code> is of type <code>T</code>.
The notation <code>x.(T)</code> is called a <i>type assertion</i>.
</p>
<p>
More precisely, if <code>T</code> is not an interface type, <code>x.(T)</code> asserts
that the dynamic type of <code>x</code> is <a href="#Type_identity">identical</a>

pkg go/ast, method (*RangeStmt) End() token.Pos
pkg go/ast, method (*RangeStmt) Pos() token.Pos
pkg go/ast, method (*ReturnStmt) End() token.Pos
pkg go/ast, method (*ReturnStmt) Pos() token.Pos
pkg go/ast, method (*Scope) Insert(*Object) *Object
pkg go/ast, method (*Scope) Lookup(string) *Object
pkg go/ast, method (*Scope) String() string
pkg go/ast, method (*SelectStmt) End() token.Pos
pkg go/ast, method (*SelectStmt) Pos() token.Pos