</p>

<pre>
[...]Point{{1.5, -3.5}, {0, 0}}     // same as [...]Point{Point{1.5, -3.5}, Point{0, 0}}
[][]int{{1, 2, 3}, {4, 5}}          // same as [][]int{[]int{1, 2, 3}, []int{4, 5}}
[][]Point{{{0, 1}, {1, 2}}}         // same as [][]Point{[]Point{Point{0, 1}, Point{1, 2}}}
map[string]Point{"orig": {0, 0}}    // same as map[string]Point{"orig": Point{0, 0}}

    // Canonicalizes the given range `point` (begin/end) according to the
    // current dimension. `c` means case: 0 for begin, 1 for end.
    auto canonicalize = [&](int64_t point, int c) {
      if (masks[c]) return stride_i > 0 ? bounds[c] : bounds[(c + 1) & 1];

      // Add dim as offset to negative range point.
      point = point < 0 ? dim_i + point : point;
      return Clamp(point, bounds[0], bounds[1]);
    };

1 126 168 green 0.00 2.0 0.0 44 36 6.26 1268 115.02 2 Bronx 011502 2011502 E BX27 Hunts Point 3710 2085 43 2 Bronx 004300 2004300 E BX39 Mott Haven-Port Morris 3710 3389260 2 2014-03-18 10:44:11 2014-03-18 10:50:41 N 1 -73.889472961425781 40.819126129150391 -73.93768310546875 40.838615417480469 1 1.26 6.5 0 0.5 0 0 7 2 1 126 244 green 0.00 0.0 0.0 43 28 6.93 1268 115.02 2 Bronx 011502 2011502 E BX27 Hunts Point 3710 45 249 1 Manhattan 024900 1024900 E MN36 Washington Heights South 3801 3389261 1 2014-03-11...

		}
		if consistentHash.MinimumRingSize != 0 { // nolint: staticcheck
			warn := "consistent hash MinimumRingSize is deprecated, use ConsistentHashLB's RingHash configuration instead"
			scope.Warnf(warn)
			errs = AppendValidation(errs, WrapWarning(errors.New(warn)))
		}
		// nolint: staticcheck
		if consistentHash.MinimumRingSize != 0 && consistentHash.GetHashAlgorithm() != nil {

OperandRange GeneratorDatasetRegionOp::getEntrySuccessorOperands(
    RegionBranchPoint point) {
  auto end = this->getOperation()->operand_end();
  if (point.isParent()) {
    // The op itself doesn't branch back to itself.
    return ::mlir::OperandRange(end, end);
  } else if (point.getRegionOrNull() == &getInit()) {
    return getInitFuncOtherArgs();
  } else if (point.getRegionOrNull() == &getNext()) {
    return getNextFuncOtherArgs();

		// MOVSxload: floating-point loads
		// x==S for float32, x==D for float64
		// load from arg0+auxint+aux, arg1 = mem
		{name: "MOVSSload", argLength: 2, reg: fpload, asm: "MOVSS", aux: "SymOff", faultOnNilArg0: true, symEffect: "Read"},
		{name: "MOVSDload", argLength: 2, reg: fpload, asm: "MOVSD", aux: "SymOff", faultOnNilArg0: true, symEffect: "Read"},

		// MOVSxconst: floatint-point constants

	"’":                 "\u2019",
	"∷":                           "\u2237",
	"⩴":                          "\u2a74",
	"≡":                       "\u2261",
	"∯":                          "\u222f",
	"∮":                 "\u222e",
	"ℂ":                            "\u2102",
	"∐":                       "\u2210",
	"&CounterClockwiseContourIntegral;": "\u2233",

		f()
	})
}

type Point struct {
	x, y int
}

// This will be index 0.
func (p Point) AnotherMethod(scale int) int {
	return -1
}

// This will be index 1.
func (p Point) Dist(scale int) int {
	//println("Point.Dist", p.x, p.y, scale)
	return p.x*p.x*scale + p.y*p.y*scale
}

// This will be index 2.
func (p Point) GCMethod(k int) int {
	runtime.GC()

	for i, testCase := range testCases {
		// initialize HTTP NewRecorder, this records any mutations to response writer inside the handler.
		rec := httptest.NewRecorder()
		// construct HTTP request for Get Object end point.
		req, err := newTestSignedRequestV4(http.MethodHead, getHeadObjectURL("", testCase.bucketName, testCase.objectName),
			0, nil, testCase.accessKey, testCase.secretKey, nil)
		if err != nil {

// just before the P goes into _Pidle/_Psyscall and neither forEachP
// nor the P run the safe-point function.
func runSafePointFn() {
	p := getg().m.p.ptr()
	// Resolve the race between forEachP running the safe-point
	// function on this P's behalf and this P running the
	// safe-point function directly.
	if !atomic.Cas(&p.runSafePointFn, 1, 0) {
		return
	}
	sched.safePointFn(p)