BE	^			NULL		(0,0)
BE	$			NULL		(0,0)
BE	^$			NULL		(0,0)
BE	^a$			a		(0,1)
BE	abc			abc		(0,3)
BE	abc			xabcy		(1,4)
BE	abc			ababc		(2,5)
BE	ab*c			abc		(0,3)
BE	ab*bc			abc		(0,3)
BE	ab*bc			abbc		(0,4)
BE	ab*bc			abbbbc		(0,6)
E	ab+bc			abbc		(0,4)
E	ab+bc			abbbbc		(0,6)
E	ab?bc			abbc		(0,4)
E	ab?bc			abc		(0,3)
E	ab?c			abc		(0,3)
BE	^abc$			abc		(0,3)
BE	^abc			abcc		(0,3)
BE	abc$			aabc		(1,4)

E	SAME		aaaaaab		(0,6)(0,6)
E	([ab]*)*	a		(0,1)(0,1)
E	SAME		aaaaaa		(0,6)(0,6)
E	SAME		ababab		(0,6)(0,6)
E	SAME		bababa		(0,6)(0,6)
E	SAME		b		(0,1)(0,1)
E	SAME		bbbbbb		(0,6)(0,6)
E	SAME		aaaabcde	(0,5)(0,5)
E	([^a]*)*	b		(0,1)(0,1)
E	SAME		bbbbbb		(0,6)(0,6)
E	SAME		aaaaaa		(0,0)(0,0)
E	([^ab]*)*	ccccxx		(0,6)(0,6)
E	SAME		ababab		(0,0)(0,0)

E	((z)+|a)*	zabcde		(0,2)(1,2)

		f.Add(v)
	}

	var mu sync.Mutex
	var before, after []byte
	f.Cleanup(func() {
		sort.Slice(after, func(i, j int) bool { return after[i] < after[j] })
		got := string(before) + string(after)
		want := "abcabc"
		if got != want {
			f.Fatalf("got %q; want %q", got, want)
		}
	})

	f.Fuzz(func(t *testing.T, b []byte) {
		before = append(before, b...)
		t.Parallel()
		mu.Lock()
		after = append(after, b...)

    def "prefers exact match over camel case match"() {
        expect:
        matches("sName", "sName", "someName", "sNames")
        matches("so Name", "so Name", "some Name", "so name")
        matches("ABC", "ABC", "AaBbCc")
    }

    def "prefers exact match over kebab case match"() {
        expect:
        matches("sName", "sName", "some-name", "some-Name")
    }

bfbfbf bebebe bdbdbd bcbcbc bbbbbb bababa b9b9b9 b8b8b8 b7b7b7 b6b6b6 b5b5b5 b4b4b4 b3b3b3 b2b2b2 b1b1b1 b0b0b0 afafaf aeaeae adadad acacac ababab aaaaaa a9a9a9 a8a8a8 a7a7a7 a6a6a6 a5a5a5 a4a4a4 a3a3a3 a2a2a2 a1a1a1 a0a0a0