if haveFastIndex {
			if j := bytealg.Index(s[i-last:], b[:n]); j >= 0 {
				return i + j - last
			}
		} else {
			// If bytealg.Index is not available a brute force search is
			// ~1.5-3x faster than Rabin-Karp since n is small.
			c0 := b[last]
			c1 := b[last-1] // There are at least 2 chars to match
		loop:
			for ; i < len(s); i++ {
				if s[i] == c0 && s[i-1] == c1 {
					for k := 2; k < n; k++ {

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...