s.end -= s.start
			s.start = 0
		}
		// Is the buffer full? If so, resize.
		if s.end == len(s.buf) {
			// Guarantee no overflow in the multiplication below.
			const maxInt = int(^uint(0) >> 1)
			if len(s.buf) >= s.maxTokenSize || len(s.buf) > maxInt/2 {
				s.setErr(ErrTooLong)
				return false
			}
			newSize := len(s.buf) * 2
			if newSize == 0 {
				newSize = startBufSize
			}

	defer func() {
		if err := recover(); err != ErrTooLarge {
			t.Errorf("after too-large Grow, recover() = %v; want %v", err, ErrTooLarge)
		}
	}()

	buf := NewBuffer(make([]byte, 1))
	const maxInt = int(^uint(0) >> 1)
	buf.Grow(maxInt)
}

// Was a bug: used to give EOF reading empty slice at EOF.
func TestReadEmptyAtEOF(t *testing.T) {
	b := new(Buffer)
	slice := make([]byte, 0)
	n, err := b.Read(slice)

			}
		}
	}

	const maxInt = int(^uint(0) >> 1)

	runTestCases("", []testCase{
		0: {"--", -2147483647, "negative"},
		1: {"", maxInt, ""},
		2: {"-", 10, ""},
		3: {"gopher", 0, ""},
		4: {"-", -1, "negative"},
		5: {"--", -102, "negative"},
		6: {string(make([]byte, 255)), int((^uint(0))/255 + 1), "overflow"},
	})

	const is64Bit = 1<<(^uintptr(0)>>63)/2 != 0

TïRGaIgn¸Anfï ² @a %`NC\U KluÖEjŠ Ylèû ¾>_ceòGs†r—ªˆ°ˆ B¼ûG†ƒ. ¸WñeLKVgn~g Uexø¨ [iVoRª ³ ghyßn¨y^mPiaïŠser|çå=¾ KE eò ˆÜa¢JUûvìŽf_ j¼^ï tiTkmòosŒiVtJy_@~Çå|G\m†`ñZ¾o{{Vû ?¾ZïKHòinOœ¢{jã:UDyy[ÚóbDˆCväêåk}Dym|<rGRý¨GwÈohWKnMªLB¼"iI²,% Œ; „vDoFûHewŠA{qmýGzã R¾Ùîñþ,ÏutSQTá>ï|¾N]n|çlM®‰sj…—†Yp¤~iÄ»two\Edtv}Ö~EE~m¬¸û|w\OF îo¾ ïhN ilñL¥zqK/t¢Sxst·ttcˆ¯ b_2ú m þ WlONl]FeIˆïTryrYT÷ETNIº W_c¢v`G eZ› „ Wls~`mDIÕ BsD}^yL5¤ÌFNLG ³¹si@xÃæÀ{[÷·ugòS{—YÐGFiÜy\‘~jC|»kKÕvID­8 + èepéì^˜»¹† ixÄãynï\º x]Ti|ôMV ëvÜø5]ï¾Xle¦BñpPow]xM...