iHasLeadingPercent bool
		resultExpected     string
		matchExpected      bool
	}{
		{"abcd", "bcd", false, "", false},
		{"abcd", "bcd", true, "", true},
		{"abcd", "abcd", false, "", true},
		{"abcd", "abcd", true, "", true},
		{"abcd", "ab", false, "cd", true},
		{"abcd", "ab", true, "cd", true},
		{"abcd", "bc", false, "", false},
		{"abcd", "bc", true, "d", true},
	}

	for i, tc := range matcherCases {

        assertEquals("abcd", normalizer.normalize("ａｂｃｄ", null));
        assertEquals("みかん", normalizer.normalize("みかん", null));
        assertEquals("みかん ﾘﾝｺﾞ", normalizer.normalize("みかん　リンゴ", null));
    }

    public void test_AnyLower() {
        ICUNormalizer normalizer = new ICUNormalizer("Any-Lower");
        assertEquals("abcd", normalizer.normalize("ABCD", null));
    }

			canonicalizedETag: "",
		},
		{
			etag:              "\"\"\"abc\"",
			canonicalizedETag: "abc",
		},
		{
			etag:              "abcd",
			canonicalizedETag: "abcd",
		},
		{
			etag:              "abcd\"\"",
			canonicalizedETag: "abcd",
		},
	}
	for _, test := range testCases {
		etag := canonicalizeETag(test.etag)
		if test.canonicalizedETag != etag {

E	a([bc]+)(c*d)		abcd		(0,4)(1,3)(3,4)
E	a([bc]*)(c+d)		abcd		(0,4)(1,2)(2,4)
E	a[bcd]*dcdcde		adcdcde		(0,7)
E	(ab|a)b*c		abc		(0,3)(0,2)
E	((a)(b)c)(d)		abcd		(0,4)(0,3)(0,1)(1,2)(3,4)
BE	[A-Za-z_][A-Za-z0-9_]*	alpha		(0,5)
E	^a(bc+|b[eh])g|.h$	abh		(1,3)
E	(bc+d$|ef*g.|h?i(j|k))	effgz		(0,5)(0,5)
E	(bc+d$|ef*g.|h?i(j|k))	ij		(0,2)(0,2)(1,2)
E	(bc+d$|ef*g.|h?i(j|k))	reffgz		(1,6)(1,6)

func TestEvalSQLSubstring(t *testing.T) {
	evalCases := []struct {
		s           string
		startIdx    int
		length      int
		resExpected string
		errExpected error
	}{
		{"abcd", 1, 1, "a", nil},
		{"abcd", -1, 1, "a", nil},
		{"abcd", 999, 999, "", nil},
		{"", 999, 999, "", nil},
		{"测试abc", 1, 1, "测", nil},
		{"测试abc", 5, 5, "c", nil},
	}

	for i, tc := range evalCases {

		if a != 1 || b != 2 || c != 3 || d != 4 {
			println("1# abcd: expected 1 2 3 4 got", a, b, c, d)
			os.Exit(1)
		}
	}
	// Test real closure.
	{
		x := 4
		gf = func(i int) (p int, q int, r int, s int) { return 1, i, 3, x }

		a, b, c, d := gf(2)

		if a != 1 || b != 2 || c != 3 || d != 4 {
			println("2# abcd: expected 1 2 3 4 got", a, b, c, d)
			os.Exit(1)
		}
	}
}

		{"", "", 0},
		{"", "abc", 0},
		{"abc", "", -1},
		{"abc", "abc", 0},
		{"d", "abcdefg", 3},
		{"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 {

class HasPrefixPatternStepTest extends Specification {
    def "matches name case sensitive"() {
        def step = new HasPrefixPatternStep(".abc", true)

        expect:
        step.matches(".abcd")
        step.matches(".abc")
        !step.matches(".")
        !step.matches(".a")
        !step.matches(".ab")
        !step.matches(".b")
        !step.matches(".bcd")
        !step.matches("_abc")

    public void test_normalize() throws Exception {
        Normalizer normalizer = SuggestUtil.createDefaultNormalizer(runner.client(), suggester.settings());
        assertEquals("12345,.*[]「」abcケンサクabcdけんさくガギグゲゴ", normalizer.normalize("１２３４５,.*[]「」ＡBCｹﾝｻｸabcdけんさくｶﾞｷﾞｸﾞｹﾞｺﾞ", null));
    }

	}

	for _, tc := range trueCases {
		if !PodConditionByKubelet(tc) {
			t.Errorf("Expect %q to be condition owned by kubelet.", tc)
		}
	}

	falseCases := []v1.PodConditionType{
		v1.PodConditionType("abcd"),
		v1.PodConditionType(v1.PodReasonUnschedulable),
	}

	for _, tc := range falseCases {
		if PodConditionByKubelet(tc) {
			t.Errorf("Expect %q NOT to be condition owned by kubelet.", tc)
		}
	}
}