aaaaa.a/aa aaaaa.a/aa
aaaaa.a/a. aaaaa.a/a.
aaaaa.a/a/ aaaaa.a/a
aaaaa.a/.a aaaaa.a/.a
aaaaa.a/.. .
aaaaa.a/./ aaaaa.a
aaaaa.a//a aaaaa.a/a
aaaaa.a//. aaaaa.a
aaaaa.a/// aaaaa.a
aaaaa..aaa aaaaa..aaa
aaaaa..aa. aaaaa..aa.
aaaaa..aa/ aaaaa..aa
aaaaa..a.a aaaaa..a.a
aaaaa..a.. aaaaa..a..
aaaaa..a./ aaaaa..a.
aaaaa..a/a aaaaa..a/a
aaaaa..a/. aaaaa..a
aaaaa..a// aaaaa..a
aaaaa...aa aaaaa...aa

E	((..)|(.))				aaaaa		(0,2)(0,2)(0,2)(?,?)
E	((..)|(.))((..)|(.))			aaaaa		(0,4)(0,2)(0,2)(?,?)(2,4)(2,4)(?,?)
E	((..)|(.))((..)|(.))((..)|(.))		aaaaa		(0,5)(0,2)(0,2)(?,?)(2,4)(2,4)(?,?)(4,5)(?,?)(4,5)

E	((..)|(.)){1}				aaaaa		(0,2)(0,2)(0,2)(?,?)
E	((..)|(.)){2}				aaaaa		(0,4)(2,4)(2,4)(?,?)
#E	((..)|(.)){3}				aaaaa		(0,5)(4,5)(?,?)(4,5)
E	((..)|(.)){3}				aaaaa		(0,5)(4,5)(2,4)(4,5)	RE2/Go

			t.Errorf("got %q want %q", got, s)
		}
	}
}

var (
	benchEscapeData     = strings.Repeat("AAAAA < BBBBB > CCCCC & DDDDD ' EEEEE \" ", 100)
	benchEscapeNone     = strings.Repeat("AAAAA x BBBBB x CCCCC x DDDDD x EEEEE x ", 100)
	benchUnescapeSparse = strings.Repeat(strings.Repeat("AAAAA x BBBBB x CCCCC x DDDDD x EEEEE x ", 10)+"&amp;", 10)
	benchUnescapeDense  = strings.Repeat("&amp;&lt; &amp; &lt;", 100)
)

/b/c/aaaaa..aaa /b/c/aaaaa..aaa
/b/c/aaaaa..aa. /b/c/aaaaa..aa.
/b/c/aaaaa..aa/ /b/c/aaaaa..aa
/b/c/aaaaa..a.a /b/c/aaaaa..a.a
/b/c/aaaaa..a.. /b/c/aaaaa..a..
/b/c/aaaaa..a./ /b/c/aaaaa..a.
/b/c/aaaaa..a/a /b/c/aaaaa..a/a
/b/c/aaaaa..a/. /b/c/aaaaa..a
/b/c/aaaaa..a// /b/c/aaaaa..a
/b/c/aaaaa...aa /b/c/aaaaa...aa
/b/c/aaaaa...a. /b/c/aaaaa...a.
/b/c/aaaaa...a/ /b/c/aaaaa...a
/b/c/aaaaa....a /b/c/aaaaa....a

	{`[\s]`, `[\t\n\f\r ]`},
	{`[\w]`, `[0-9A-Z_a-z]`},
	{`[\D]`, `[^0-9]`},
	{`[\S]`, `[^\t\n\f\r ]`},
	{`[\W]`, `[^0-9A-Z_a-z]`},

	// Posix repetitions
	{`a{1}`, `a`},
	{`a{2}`, `aa`},
	{`a{5}`, `aaaaa`},
	{`a{0,1}`, `a?`},
	// The next three are illegible because Simplify inserts (?:)
	// parens instead of () parens to avoid creating extra
	// captured subexpressions. The comments show a version with fewer parens.

		{"nan", "banana", 2},
		{"pan", "anpanman", 2},
		{"nnaaman", "anpanmanam", -1},
		{"abcd", "abc", -1},
		{"abcd", "bcd", -1},
		{"bcd", "abcd", 1},
		{"abc", "acca", -1},
		{"aa", "aaa", 0},
		{"baa", "aaaaa", -1},
		{"at that", "which finally halts.  at that point", 22},
	}

	for _, tc := range testCases {
		got := StringFind(tc.pat, tc.text)
		want := tc.index
		if got != want {

    assertEquals("", Strings.commonPrefix("xyz", "abcde"));
    assertEquals("", Strings.commonPrefix("xyz", "abcxyz"));
    assertEquals("a", Strings.commonPrefix("abc", "aaaaa"));
    assertEquals("aa", Strings.commonPrefix("aa", "aaaaa"));
    assertEquals("abc", Strings.commonPrefix(new StringBuffer("abcdef"), "abcxyz"));

    // Identical valid surrogate pairs.
    assertEquals(

	}
	_, err = writer.Write([]byte("aaaaaaaaaa"))
	if err != nil {
		t.Fatal(err)
	}
	_, err = writer.Write([]byte("aaaaaaaaaa"))
	if err != nil {
		t.Fatal(err)
	}
	_, err = writer.Write([]byte("aaaaa"))
	if err != nil {
		t.Fatal(err)
	}
	if bw, ok := writer.(io.Closer); ok {
		bw.Close()
	}

	reader := newBitrotReader(disk, nil, volume, filePath, 35, bitrotAlgo, bitrotWriterSum(writer), 10)

	warningRecorder.AddWarning("", "h")          // item to get ignored since we're over our limit
	// check that existing items are truncated, and order preserved
	if e, a := []string{`299 - "aaaaa"`, `299 - "bb"`, `299 - "ccc"`, `299 - "Iñtër"`, `299 - "e"`, `299 - "fffff"`, `299 - "ggggg"`}, responseRecorder.Header()["Warning"]; !reflect.DeepEqual(e, a) {
		t.Errorf("expected\n%#v\ngot\n%#v", e, a)
	}

		{"MMMMMMMMM", 8},
		{"MMMMMM", 0},
		{"A=", 1},
		{"AA=", 3},
		{"AA==", 4},
		{"AA===", 5},
		{"AAAA=", 5},
		{"AAAA==", 6},
		{"AAAAA=", 6},
		{"AAAAA==", 7},
		{"A=======", 1},
		{"AA======", -1},
		{"AAA=====", 3},
		{"AAAA====", -1},
		{"AAAAA===", -1},
		{"AAAAAA==", 6},
		{"AAAAAAA=", -1},
		{"AAAAAAAA", -1},
	}
	for _, tc := range testCases {