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++ {

      }
    }
    throw new AssertionError();
  }

  /*
   * If n <= millerRabinBases[i][0], then testing n against bases millerRabinBases[i][1..] suffices
   * to prove its primality. Values from miller-rabin.appspot.com.
   *
   * NOTE: We could get slightly better bases that would be treated as unsigned, but benchmarks
   * showed negligible performance improvements.
   */

apps-1and1.com
apps-1and1.net
apps.fbsbx.com
apps.lair.io
appspacehosted.com
appspaceusercontent.com
appspot.com
appudo.net
aq
aq.it
aquarelle
aquila.it
ar
ar.it
ar.us
arab
arai.shizuoka.jp
arakawa.saitama.jp
arakawa.tokyo.jp
aramco
arao.kumamoto.jp
archer.replit.dev
archi
architectes.bj
ardal.no
aremark.no
arendal.no
arezzo.it
ariake.saga.jp

apps-1and1.com
apps-1and1.net
apps.fbsbx.com
apps.lair.io
appspacehosted.com
appspaceusercontent.com
appspot.com
appudo.net
aq
aq.it
aquarelle
aquila.it
ar
ar.it
ar.us
arab
arai.shizuoka.jp
arakawa.saitama.jp
arakawa.tokyo.jp
aramco
arao.kumamoto.jp
archer.replit.dev
archi
architectes.bj
ardal.no
aremark.no
arendal.no
arezzo.it
ariake.saga.jp

	{"fofofofofoofofoffofoobarfoo", "foobars", -1},
	{"foofyfoobarfoobar", "y", 4},
	{"oooooooooooooooooooooo", "r", -1},
	{"oxoxoxoxoxoxoxoxoxoxoxoy", "oy", 22},
	{"oxoxoxoxoxoxoxoxoxoxoxox", "oy", -1},
	// test fallback to Rabin-Karp.
	{"000000000000000000000000000000000000000000000000000000000000000000000001", "0000000000000000000000000000000000000000000000000000000000000000001", 5},
	// test fallback to IndexRune
	{"oxoxoxoxoxoxoxoxoxoxox☺", "☺", 22},

AC5BnB,EAAYpkC,EAAS0C,cAAe,KAKpC,IACC0hC,EAAUhwB,KAAOwsB,EAAEgC,IAInBwB,EAAUhwB,KAAOgwB,EAAUhwB,KAC3BwsB,EAAE2E,YAAc9D,GAAaqB,SAAW,KAAOrB,GAAa+D,MAC3DpB,EAAUtB,SAAW,KAAOsB,EAAUoB,KACtC,MAAQz4B,GAIT6zB,EAAE2E,aAAc,GAalB,GARK3E,EAAElf,MAAQkf,EAAEmC,aAAiC,iBAAXnC,EAAElf,OACxCkf,EAAElf,KAAOre,GAAOs9B,MAAOC,EAAElf,KAAMkf,EAAEF,cAIlCqB,GAA+BzH,GAAYsG,EAAGh7B,EAASo8B,GAGlDjiB,EACJ,OAAOiiB,EA8ER,IAAMz/B,KAzEN8hC,EAAchhC,GAAOskB,OAASiZ,EAAEhhC,SAGQ,GAApByD,GAAOo/B,UAC1Bp/B,GAAOskB,MAAMU,QAAS,aAIvBuY,EAAE...

pkg unicode, type RangeTable struct, R16 []Range16
pkg unicode, type RangeTable struct, R32 []Range32
pkg unicode, type SpecialCase []CaseRange
pkg unicode, var ASCII_Hex_Digit *RangeTable
pkg unicode, var Arabic *RangeTable
pkg unicode, var Armenian *RangeTable
pkg unicode, var Avestan *RangeTable
pkg unicode, var AzeriCase SpecialCase
pkg unicode, var Balinese *RangeTable
pkg unicode, var Bamum *RangeTable

AAeG,YACd5M,EAAKoE,QAAQiH,eAEhBoB,EAAeG,iBAMvBnQ,EAAAA,QAAKwP,EAAJ,WAAoBtF,KAAK,MAAOlK,EAAAA,QAAKwP,EAAJ,WAAoBtF,KAAK,QAI/DlK,EAAAA,QAAKsN,GAAJ,YAAuCoD,IAAI,WAAWhL,YAAY,UAEnEhE,KAAKuG,aAELoI,EAAMK,IAAI,QACVL,EAAMxO,QAAQ,MAAMyD,SAAS,UAC7B5D,KAAK0M,aAAaiC,GAEd3O,KAAKiG,QAAQ4G,gBACf7M,KAAKiP,eAAe3Q,EAAAA,QAAKwP,EAAJ,WAAoBtF,KAAK,WAIlD0G,gBAAA,SAAgBC,EAAMrP,GACpB,GAAY,OAARqP,EACF7Q,EAAAA,QAAEuN,IAA8BlK,SAChCrD,EAAAA,QAAE4N,IAAmBvK,SACrBrD,EAAAA,QAAE0N,IAAoB1F,YACjB,GAAY,aAAR6I,EACT7Q,EAAAA,QAAKuN,GA...

isPrime(b) { return b, nil } } } // isPrime runs the Miller-Rabin Probabilistic Primality Test from // FIPS 186-5, Appendix B.3.1. // // w must be a random odd integer greater than three in big-endian order. // isPrime might return false positives for adversarially chosen values. // // isPrime is not constant-time. func isPrime(w []byte) bool { mr, err := millerRabinSetup(w) if err != nil { // w is zero, one, or even. return false } // Before Miller-Rabin, rule out most composites with trial divisions. for...

len(B) < len(W) { B = "0" + B } mr, err := millerRabinSetup(decodeHex(t, W)) if err != nil { t.Logf("W = %s", W) t.Logf("B = %s", B) t.Fatalf("failed to set up Miller-Rabin test: %v", err) } result, err := millerRabinIteration(mr, decodeHex(t, B)) if err != nil { t.Logf("W = %s", W) t.Logf("B = %s", B) t.Fatalf("failed to run Miller-Rabin test: %v", err) } if result != expected { t.Logf("W = %s", W) t.Logf("B = %s", B) t.Fatalf("unexpected result: got %v, want %v", result, expected) } }) default: t.Fatalf("unknown...