mirror of
https://codeberg.org/forgejo/forgejo
synced 2024-11-24 18:56:11 +01:00
33 lines
1,005 B
Go
33 lines
1,005 B
Go
|
// Copyright 2022 The Gitea Authors. All rights reserved.
|
||
|
|
// Use of this source code is governed by a MIT-style
|
||
|
|
// license that can be found in the LICENSE file.
|
||
|
|
|
||
|
|
package charset
|
||
|
|
|
||
|
|
import (
|
||
|
|
"sort"
|
||
|
|
"testing"
|
||
|
|
"unicode"
|
||
|
|
|
||
|
|
"github.com/stretchr/testify/assert"
|
||
|
|
)
|
||
|
|
|
||
|
|
func TestAmbiguousCharacters(t *testing.T) {
|
||
|
|
for locale, ambiguous := range AmbiguousCharacters {
|
||
|
|
assert.Equal(t, locale, ambiguous.Locale)
|
||
|
|
assert.Equal(t, len(ambiguous.Confusable), len(ambiguous.With))
|
||
|
|
assert.True(t, sort.SliceIsSorted(ambiguous.Confusable, func(i, j int) bool {
|
||
|
|
return ambiguous.Confusable[i] < ambiguous.Confusable[j]
|
||
|
|
}))
|
||
|
|
|
||
|
|
for _, confusable := range ambiguous.Confusable {
|
||
|
|
assert.True(t, unicode.Is(ambiguous.RangeTable, confusable))
|
||
|
|
i := sort.Search(len(ambiguous.Confusable), func(j int) bool {
|
||
|
|
return ambiguous.Confusable[j] >= confusable
|
||
|
|
})
|
||
|
|
found := i < len(ambiguous.Confusable) && ambiguous.Confusable[i] == confusable
|
||
|
|
assert.True(t, found, "%c is not in %d", confusable, i)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|