if s[i+1] == c1 && Equal(s[i:i+n], sep) {
			return i
		}
		i++
		fails++
		if fails >= 4+i>>4 && i < t {
			// Give up on IndexByte, it isn't skipping ahead
			// far enough to be better than Rabin-Karp.
			// Experiments (using IndexPeriodic) suggest
			// the cutover is about 16 byte skips.
			// TODO: if large prefixes of sep are matching
			// we should cutover at even larger average skips,

2ix.ch 2ix.de 3.azurestaticapps.net 3.bg 32-b.it 3utilities.com 4.bg 4lima.at 4lima.ch 4lima.de 4u.com 5.bg 5g.in 6.bg 611.to 64-b.it 6g.in 7.bg 8.bg 9.bg 9guacu.br a.bg a.prod.fastly.net a.run.app a.se a.ssl.fastly.net aa.no aaa aaa.pro aarborte.no aarp ab.ca abarth abashiri.hokkaido.jp abb abbott abbvie abc abc.br abeno.osaka.jp abiko.chiba.jp abira.hokkaido.jp abkhazia.su able abo.pa abogado abr.it abruzzo.it abu.yamaguchi.jp abudhabi ac ac.ae ac.at ac.be ac.ci ac.cn ac.cr ac.cy ac.fj ac.gn ac.gov.br...