mirror of
https://github.com/autc04/Retro68.git
synced 2024-09-08 20:55:01 +00:00
203 lines
5.1 KiB
Go
203 lines
5.1 KiB
Go
// Copyright 2010 The Go Authors. All rights reserved.
|
||
// Use of this source code is governed by a BSD-style
|
||
// license that can be found in the LICENSE file.
|
||
|
||
package utf16_test
|
||
|
||
import (
|
||
"reflect"
|
||
"testing"
|
||
"unicode"
|
||
. "unicode/utf16"
|
||
)
|
||
|
||
// Validate the constants redefined from unicode.
|
||
func TestConstants(t *testing.T) {
|
||
if MaxRune != unicode.MaxRune {
|
||
t.Errorf("utf16.maxRune is wrong: %x should be %x", MaxRune, unicode.MaxRune)
|
||
}
|
||
if ReplacementChar != unicode.ReplacementChar {
|
||
t.Errorf("utf16.replacementChar is wrong: %x should be %x", ReplacementChar, unicode.ReplacementChar)
|
||
}
|
||
}
|
||
|
||
type encodeTest struct {
|
||
in []rune
|
||
out []uint16
|
||
}
|
||
|
||
var encodeTests = []encodeTest{
|
||
{[]rune{1, 2, 3, 4}, []uint16{1, 2, 3, 4}},
|
||
{[]rune{0xffff, 0x10000, 0x10001, 0x12345, 0x10ffff},
|
||
[]uint16{0xffff, 0xd800, 0xdc00, 0xd800, 0xdc01, 0xd808, 0xdf45, 0xdbff, 0xdfff}},
|
||
{[]rune{'a', 'b', 0xd7ff, 0xd800, 0xdfff, 0xe000, 0x110000, -1},
|
||
[]uint16{'a', 'b', 0xd7ff, 0xfffd, 0xfffd, 0xe000, 0xfffd, 0xfffd}},
|
||
}
|
||
|
||
func TestEncode(t *testing.T) {
|
||
for _, tt := range encodeTests {
|
||
out := Encode(tt.in)
|
||
if !reflect.DeepEqual(out, tt.out) {
|
||
t.Errorf("Encode(%x) = %x; want %x", tt.in, out, tt.out)
|
||
}
|
||
}
|
||
}
|
||
|
||
func TestEncodeRune(t *testing.T) {
|
||
for i, tt := range encodeTests {
|
||
j := 0
|
||
for _, r := range tt.in {
|
||
r1, r2 := EncodeRune(r)
|
||
if r < 0x10000 || r > unicode.MaxRune {
|
||
if j >= len(tt.out) {
|
||
t.Errorf("#%d: ran out of tt.out", i)
|
||
break
|
||
}
|
||
if r1 != unicode.ReplacementChar || r2 != unicode.ReplacementChar {
|
||
t.Errorf("EncodeRune(%#x) = %#x, %#x; want 0xfffd, 0xfffd", r, r1, r2)
|
||
}
|
||
j++
|
||
} else {
|
||
if j+1 >= len(tt.out) {
|
||
t.Errorf("#%d: ran out of tt.out", i)
|
||
break
|
||
}
|
||
if r1 != rune(tt.out[j]) || r2 != rune(tt.out[j+1]) {
|
||
t.Errorf("EncodeRune(%#x) = %#x, %#x; want %#x, %#x", r, r1, r2, tt.out[j], tt.out[j+1])
|
||
}
|
||
j += 2
|
||
dec := DecodeRune(r1, r2)
|
||
if dec != r {
|
||
t.Errorf("DecodeRune(%#x, %#x) = %#x; want %#x", r1, r2, dec, r)
|
||
}
|
||
}
|
||
}
|
||
if j != len(tt.out) {
|
||
t.Errorf("#%d: EncodeRune didn't generate enough output", i)
|
||
}
|
||
}
|
||
}
|
||
|
||
type decodeTest struct {
|
||
in []uint16
|
||
out []rune
|
||
}
|
||
|
||
var decodeTests = []decodeTest{
|
||
{[]uint16{1, 2, 3, 4}, []rune{1, 2, 3, 4}},
|
||
{[]uint16{0xffff, 0xd800, 0xdc00, 0xd800, 0xdc01, 0xd808, 0xdf45, 0xdbff, 0xdfff},
|
||
[]rune{0xffff, 0x10000, 0x10001, 0x12345, 0x10ffff}},
|
||
{[]uint16{0xd800, 'a'}, []rune{0xfffd, 'a'}},
|
||
{[]uint16{0xdfff}, []rune{0xfffd}},
|
||
}
|
||
|
||
func TestDecode(t *testing.T) {
|
||
for _, tt := range decodeTests {
|
||
out := Decode(tt.in)
|
||
if !reflect.DeepEqual(out, tt.out) {
|
||
t.Errorf("Decode(%x) = %x; want %x", tt.in, out, tt.out)
|
||
}
|
||
}
|
||
}
|
||
|
||
var decodeRuneTests = []struct {
|
||
r1, r2 rune
|
||
want rune
|
||
}{
|
||
{0xd800, 0xdc00, 0x10000},
|
||
{0xd800, 0xdc01, 0x10001},
|
||
{0xd808, 0xdf45, 0x12345},
|
||
{0xdbff, 0xdfff, 0x10ffff},
|
||
{0xd800, 'a', 0xfffd}, // illegal, replacement rune substituted
|
||
}
|
||
|
||
func TestDecodeRune(t *testing.T) {
|
||
for i, tt := range decodeRuneTests {
|
||
got := DecodeRune(tt.r1, tt.r2)
|
||
if got != tt.want {
|
||
t.Errorf("%d: DecodeRune(%q, %q) = %v; want %v", i, tt.r1, tt.r2, got, tt.want)
|
||
}
|
||
}
|
||
}
|
||
|
||
var surrogateTests = []struct {
|
||
r rune
|
||
want bool
|
||
}{
|
||
// from http://en.wikipedia.org/wiki/UTF-16
|
||
{'\u007A', false}, // LATIN SMALL LETTER Z
|
||
{'\u6C34', false}, // CJK UNIFIED IDEOGRAPH-6C34 (water)
|
||
{'\uFEFF', false}, // Byte Order Mark
|
||
{'\U00010000', false}, // LINEAR B SYLLABLE B008 A (first non-BMP code point)
|
||
{'\U0001D11E', false}, // MUSICAL SYMBOL G CLEF
|
||
{'\U0010FFFD', false}, // PRIVATE USE CHARACTER-10FFFD (last Unicode code point)
|
||
|
||
{rune(0xd7ff), false}, // surr1-1
|
||
{rune(0xd800), true}, // surr1
|
||
{rune(0xdc00), true}, // surr2
|
||
{rune(0xe000), false}, // surr3
|
||
{rune(0xdfff), true}, // surr3-1
|
||
}
|
||
|
||
func TestIsSurrogate(t *testing.T) {
|
||
for i, tt := range surrogateTests {
|
||
got := IsSurrogate(tt.r)
|
||
if got != tt.want {
|
||
t.Errorf("%d: IsSurrogate(%q) = %v; want %v", i, tt.r, got, tt.want)
|
||
}
|
||
}
|
||
}
|
||
|
||
func BenchmarkDecodeValidASCII(b *testing.B) {
|
||
// "hello world"
|
||
data := []uint16{104, 101, 108, 108, 111, 32, 119, 111, 114, 108, 100}
|
||
for i := 0; i < b.N; i++ {
|
||
Decode(data)
|
||
}
|
||
}
|
||
|
||
func BenchmarkDecodeValidJapaneseChars(b *testing.B) {
|
||
// "日本語日本語日本語"
|
||
data := []uint16{26085, 26412, 35486, 26085, 26412, 35486, 26085, 26412, 35486}
|
||
for i := 0; i < b.N; i++ {
|
||
Decode(data)
|
||
}
|
||
}
|
||
|
||
func BenchmarkDecodeRune(b *testing.B) {
|
||
rs := make([]rune, 10)
|
||
// U+1D4D0 to U+1D4D4: MATHEMATICAL BOLD SCRIPT CAPITAL LETTERS
|
||
for i, u := range []rune{'𝓐', '𝓑', '𝓒', '𝓓', '𝓔'} {
|
||
rs[2*i], rs[2*i+1] = EncodeRune(u)
|
||
}
|
||
|
||
b.ResetTimer()
|
||
for i := 0; i < b.N; i++ {
|
||
for j := 0; j < 5; j++ {
|
||
DecodeRune(rs[2*j], rs[2*j+1])
|
||
}
|
||
}
|
||
}
|
||
|
||
func BenchmarkEncodeValidASCII(b *testing.B) {
|
||
data := []rune{'h', 'e', 'l', 'l', 'o'}
|
||
for i := 0; i < b.N; i++ {
|
||
Encode(data)
|
||
}
|
||
}
|
||
|
||
func BenchmarkEncodeValidJapaneseChars(b *testing.B) {
|
||
data := []rune{'日', '本', '語'}
|
||
for i := 0; i < b.N; i++ {
|
||
Encode(data)
|
||
}
|
||
}
|
||
|
||
func BenchmarkEncodeRune(b *testing.B) {
|
||
for i := 0; i < b.N; i++ {
|
||
for _, u := range []rune{'𝓐', '𝓑', '𝓒', '𝓓', '𝓔'} {
|
||
EncodeRune(u)
|
||
}
|
||
}
|
||
}
|