},
      "arabic_stop": {
        "type":       "stop",
        "stopwords":  "_arabic_"
      },
      "arabic_keywords": {
        "type":       "keyword_marker",
        "keywords":   ["مرحباا"]
      },
      "arabic_stemmer": {
        "type":       "stemmer",
        "language":   "arabic"
      },
      "bulgarian_stop": {
        "type":       "stop",

America/Yellowknife Antarctica/Casey Antarctica/Davis Antarctica/DumontDUrville Antarctica/Macquarie Antarctica/Mawson Antarctica/McMurdo Antarctica/Palmer Antarctica/Rothera Antarctica/South_Pole Antarctica/Syowa Antarctica/Troll Antarctica/Vostok Arctic/Longyearbyen Asia/Aden Asia/Almaty Asia/Amman Asia/Anadyr Asia/Aqtau Asia/Aqtobe Asia/Ashgabat Asia/Ashkhabad Asia/Atyrau Asia/Baghdad Asia/Bahrain Asia/Baku Asia/Bangkok Asia/Barnaul Asia/Beirut Asia/Bishkek Asia/Brunei Asia/Calcutta Asia/Chita Asia/Choibalsan...

func GcdInt(d, x, y, a, b *Int) {
	d.doinit()
	x.doinit()
	y.doinit()
	a.doinit()
	b.doinit()
	C.mpz_gcdext(&d.i[0], &x.i[0], &y.i[0], &a.i[0], &b.i[0])
}

// ProbablyPrime performs n Miller-Rabin tests to check whether z is prime.
// If it returns true, z is prime with probability 1 - 1/4^n.
// If it returns false, z is not prime.
func (z *Int) ProbablyPrime(n int) bool {
	z.doinit()

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

	{"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},

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

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

## Thanks to our Contributors

This release contains contributions from many people at Google, as well as:

Aaron Schumacher, Aidan Dang, Akihiko ITOH, Aki Sukegawa, Arbit Chen, Aziz Alto,
Danijar Hafner, Erik Erwitt, Fabrizio Milo, Felix Maximilian Möller, Henry
Saputra, Sung Kim, Igor Babuschkin, Jan Zikes, Jeremy Barnes, Jesper Steen