2009-06-04 15:41:31 -06:00
|
|
|
// Copyright 2009 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.
|
|
|
|
|
2009-08-12 14:18:37 -06:00
|
|
|
package bytes_test
|
2009-06-04 15:41:31 -06:00
|
|
|
|
|
|
|
import (
|
2009-12-15 16:33:31 -07:00
|
|
|
. "bytes"
|
|
|
|
"testing"
|
|
|
|
"unicode"
|
2009-06-04 15:41:31 -06:00
|
|
|
)
|
|
|
|
|
|
|
|
func eq(a, b []string) bool {
|
|
|
|
if len(a) != len(b) {
|
2009-11-09 13:07:39 -07:00
|
|
|
return false
|
2009-06-04 15:41:31 -06:00
|
|
|
}
|
|
|
|
for i := 0; i < len(a); i++ {
|
|
|
|
if a[i] != b[i] {
|
2009-11-09 13:07:39 -07:00
|
|
|
return false
|
2009-06-04 15:41:31 -06:00
|
|
|
}
|
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
return true
|
2009-06-04 15:41:31 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
func arrayOfString(a [][]byte) []string {
|
2009-12-15 16:33:31 -07:00
|
|
|
result := make([]string, len(a))
|
2009-06-04 15:41:31 -06:00
|
|
|
for j := 0; j < len(a); j++ {
|
2009-11-09 13:07:39 -07:00
|
|
|
result[j] = string(a[j])
|
2009-06-04 15:41:31 -06:00
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
return result
|
2009-06-04 15:41:31 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
// For ease of reading, the test cases use strings that are converted to byte
|
|
|
|
// arrays before invoking the functions.
|
|
|
|
|
|
|
|
var abcd = "abcd"
|
|
|
|
var faces = "☺☻☹"
|
|
|
|
var commas = "1,2,3,4"
|
|
|
|
var dots = "1....2....3....4"
|
|
|
|
|
2009-11-18 20:23:08 -07:00
|
|
|
type BinOpTest struct {
|
2009-12-15 16:33:31 -07:00
|
|
|
a string
|
|
|
|
b string
|
|
|
|
i int
|
2009-06-04 15:41:31 -06:00
|
|
|
}
|
2009-10-08 16:14:54 -06:00
|
|
|
|
2009-11-18 20:23:08 -07:00
|
|
|
var comparetests = []BinOpTest{
|
|
|
|
BinOpTest{"", "", 0},
|
|
|
|
BinOpTest{"a", "", 1},
|
|
|
|
BinOpTest{"", "a", -1},
|
|
|
|
BinOpTest{"abc", "abc", 0},
|
|
|
|
BinOpTest{"ab", "abc", -1},
|
|
|
|
BinOpTest{"abc", "ab", 1},
|
|
|
|
BinOpTest{"x", "ab", 1},
|
|
|
|
BinOpTest{"ab", "x", -1},
|
|
|
|
BinOpTest{"x", "a", 1},
|
|
|
|
BinOpTest{"b", "x", -1},
|
2009-06-04 15:41:31 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
func TestCompare(t *testing.T) {
|
2009-11-18 20:23:08 -07:00
|
|
|
for _, tt := range comparetests {
|
2010-02-25 17:01:29 -07:00
|
|
|
a := []byte(tt.a)
|
|
|
|
b := []byte(tt.b)
|
2009-12-15 16:33:31 -07:00
|
|
|
cmp := Compare(a, b)
|
|
|
|
eql := Equal(a, b)
|
2009-11-18 20:23:08 -07:00
|
|
|
if cmp != tt.i {
|
2009-11-09 13:07:39 -07:00
|
|
|
t.Errorf(`Compare(%q, %q) = %v`, tt.a, tt.b, cmp)
|
2009-06-04 15:41:31 -06:00
|
|
|
}
|
2009-11-18 20:23:08 -07:00
|
|
|
if eql != (tt.i == 0) {
|
2009-11-09 13:07:39 -07:00
|
|
|
t.Errorf(`Equal(%q, %q) = %v`, tt.a, tt.b, eql)
|
2009-06-04 15:41:31 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-03-26 14:05:04 -06:00
|
|
|
var indexTests = []BinOpTest{
|
2009-11-18 20:23:08 -07:00
|
|
|
BinOpTest{"", "", 0},
|
|
|
|
BinOpTest{"", "a", -1},
|
2010-03-26 14:05:04 -06:00
|
|
|
BinOpTest{"", "foo", -1},
|
|
|
|
BinOpTest{"fo", "foo", -1},
|
|
|
|
BinOpTest{"foo", "foo", 0},
|
|
|
|
BinOpTest{"oofofoofooo", "f", 2},
|
|
|
|
BinOpTest{"oofofoofooo", "foo", 4},
|
|
|
|
BinOpTest{"barfoobarfoo", "foo", 3},
|
|
|
|
BinOpTest{"foo", "", 0},
|
|
|
|
BinOpTest{"foo", "o", 1},
|
|
|
|
BinOpTest{"abcABCabc", "A", 3},
|
|
|
|
// cases with one byte strings - test IndexByte and special case in Index()
|
2009-11-18 20:23:08 -07:00
|
|
|
BinOpTest{"", "a", -1},
|
|
|
|
BinOpTest{"x", "a", -1},
|
|
|
|
BinOpTest{"x", "x", 0},
|
|
|
|
BinOpTest{"abc", "a", 0},
|
|
|
|
BinOpTest{"abc", "b", 1},
|
|
|
|
BinOpTest{"abc", "c", 2},
|
|
|
|
BinOpTest{"abc", "x", -1},
|
|
|
|
}
|
|
|
|
|
2010-03-26 14:05:04 -06:00
|
|
|
var lastIndexTests = []BinOpTest{
|
|
|
|
BinOpTest{"", "", 0},
|
|
|
|
BinOpTest{"", "a", -1},
|
|
|
|
BinOpTest{"", "foo", -1},
|
|
|
|
BinOpTest{"fo", "foo", -1},
|
|
|
|
BinOpTest{"foo", "foo", 0},
|
|
|
|
BinOpTest{"foo", "f", 0},
|
|
|
|
BinOpTest{"oofofoofooo", "f", 7},
|
|
|
|
BinOpTest{"oofofoofooo", "foo", 7},
|
|
|
|
BinOpTest{"barfoobarfoo", "foo", 9},
|
|
|
|
BinOpTest{"foo", "", 3},
|
|
|
|
BinOpTest{"foo", "o", 2},
|
|
|
|
BinOpTest{"abcABCabc", "A", 3},
|
|
|
|
BinOpTest{"abcABCabc", "a", 6},
|
|
|
|
}
|
|
|
|
|
|
|
|
var indexAnyTests = []BinOpTest{
|
|
|
|
BinOpTest{"", "", -1},
|
|
|
|
BinOpTest{"", "a", -1},
|
|
|
|
BinOpTest{"", "abc", -1},
|
|
|
|
BinOpTest{"a", "", -1},
|
|
|
|
BinOpTest{"a", "a", 0},
|
|
|
|
BinOpTest{"aaa", "a", 0},
|
|
|
|
BinOpTest{"abc", "xyz", -1},
|
|
|
|
BinOpTest{"abc", "xcz", 2},
|
2010-05-03 11:59:00 -06:00
|
|
|
BinOpTest{"ab☺c", "x☺yz", 2},
|
2010-03-26 14:05:04 -06:00
|
|
|
BinOpTest{"aRegExp*", ".(|)*+?^$[]", 7},
|
|
|
|
BinOpTest{dots + dots + dots, " ", -1},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Execute f on each test case. funcName should be the name of f; it's used
|
|
|
|
// in failure reports.
|
|
|
|
func runIndexTests(t *testing.T, f func(s, sep []byte) int, funcName string, testCases []BinOpTest) {
|
|
|
|
for _, test := range testCases {
|
|
|
|
a := []byte(test.a)
|
|
|
|
b := []byte(test.b)
|
|
|
|
actual := f(a, b)
|
|
|
|
if actual != test.i {
|
|
|
|
t.Errorf("%s(%q,%q) = %v; want %v", funcName, a, b, actual, test.i)
|
2009-11-18 20:23:08 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-03-26 14:05:04 -06:00
|
|
|
func TestIndex(t *testing.T) { runIndexTests(t, Index, "Index", indexTests) }
|
|
|
|
func TestLastIndex(t *testing.T) { runIndexTests(t, LastIndex, "LastIndex", lastIndexTests) }
|
2010-05-03 11:59:00 -06:00
|
|
|
func TestIndexAny(t *testing.T) {
|
|
|
|
for _, test := range indexAnyTests {
|
|
|
|
a := []byte(test.a)
|
|
|
|
actual := IndexAny(a, test.b)
|
|
|
|
if actual != test.i {
|
|
|
|
t.Errorf("IndexAny(%q,%q) = %v; want %v", a, test.b, actual, test.i)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2010-03-26 14:05:04 -06:00
|
|
|
|
2009-11-18 20:23:08 -07:00
|
|
|
func TestIndexByte(t *testing.T) {
|
2010-03-26 14:05:04 -06:00
|
|
|
for _, tt := range indexTests {
|
2009-11-18 20:23:08 -07:00
|
|
|
if len(tt.b) != 1 {
|
|
|
|
continue
|
|
|
|
}
|
2010-02-25 17:01:29 -07:00
|
|
|
a := []byte(tt.a)
|
2009-12-15 16:33:31 -07:00
|
|
|
b := tt.b[0]
|
|
|
|
pos := IndexByte(a, b)
|
2009-11-18 20:23:08 -07:00
|
|
|
if pos != tt.i {
|
|
|
|
t.Errorf(`IndexByte(%q, '%c') = %v`, tt.a, b, pos)
|
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
posp := IndexBytePortable(a, b)
|
2009-12-04 11:23:43 -07:00
|
|
|
if posp != tt.i {
|
|
|
|
t.Errorf(`indexBytePortable(%q, '%c') = %v`, tt.a, b, posp)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-12-15 16:33:31 -07:00
|
|
|
func BenchmarkIndexByte4K(b *testing.B) { bmIndex(b, IndexByte, 4<<10) }
|
2009-12-04 11:23:43 -07:00
|
|
|
|
2009-12-15 16:33:31 -07:00
|
|
|
func BenchmarkIndexByte4M(b *testing.B) { bmIndex(b, IndexByte, 4<<20) }
|
2009-12-04 11:23:43 -07:00
|
|
|
|
2009-12-15 16:33:31 -07:00
|
|
|
func BenchmarkIndexByte64M(b *testing.B) { bmIndex(b, IndexByte, 64<<20) }
|
2009-12-04 11:23:43 -07:00
|
|
|
|
|
|
|
func BenchmarkIndexBytePortable4K(b *testing.B) {
|
|
|
|
bmIndex(b, IndexBytePortable, 4<<10)
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkIndexBytePortable4M(b *testing.B) {
|
|
|
|
bmIndex(b, IndexBytePortable, 4<<20)
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkIndexBytePortable64M(b *testing.B) {
|
|
|
|
bmIndex(b, IndexBytePortable, 64<<20)
|
|
|
|
}
|
|
|
|
|
|
|
|
var bmbuf []byte
|
|
|
|
|
|
|
|
func bmIndex(b *testing.B, index func([]byte, byte) int, n int) {
|
|
|
|
if len(bmbuf) < n {
|
|
|
|
bmbuf = make([]byte, n)
|
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
b.SetBytes(int64(n))
|
|
|
|
buf := bmbuf[0:n]
|
|
|
|
buf[n-1] = 'x'
|
2009-12-04 11:23:43 -07:00
|
|
|
for i := 0; i < b.N; i++ {
|
2009-12-15 16:33:31 -07:00
|
|
|
j := index(buf, 'x')
|
2009-12-04 11:23:43 -07:00
|
|
|
if j != n-1 {
|
2010-03-30 11:34:57 -06:00
|
|
|
println("bad index", j)
|
|
|
|
panic("bad index")
|
2009-12-04 11:23:43 -07:00
|
|
|
}
|
2009-11-18 20:23:08 -07:00
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
buf[n-1] = '0'
|
2009-11-18 20:23:08 -07:00
|
|
|
}
|
2009-06-04 15:41:31 -06:00
|
|
|
|
|
|
|
type ExplodeTest struct {
|
2009-12-15 16:33:31 -07:00
|
|
|
s string
|
|
|
|
n int
|
|
|
|
a []string
|
2009-06-04 15:41:31 -06:00
|
|
|
}
|
2009-10-08 16:14:54 -06:00
|
|
|
|
|
|
|
var explodetests = []ExplodeTest{
|
|
|
|
ExplodeTest{abcd, 0, []string{"a", "b", "c", "d"}},
|
|
|
|
ExplodeTest{faces, 0, []string{"☺", "☻", "☹"}},
|
|
|
|
ExplodeTest{abcd, 2, []string{"a", "bcd"}},
|
2009-06-04 15:41:31 -06:00
|
|
|
}
|
2009-10-08 16:14:54 -06:00
|
|
|
|
2009-06-04 15:41:31 -06:00
|
|
|
func TestExplode(t *testing.T) {
|
2010-02-17 16:46:46 -07:00
|
|
|
for _, tt := range explodetests {
|
2010-02-25 17:01:29 -07:00
|
|
|
a := Split([]byte(tt.s), nil, tt.n)
|
2009-12-15 16:33:31 -07:00
|
|
|
result := arrayOfString(a)
|
2009-06-04 15:41:31 -06:00
|
|
|
if !eq(result, tt.a) {
|
2009-12-15 16:33:31 -07:00
|
|
|
t.Errorf(`Explode("%s", %d) = %v; want %v`, tt.s, tt.n, result, tt.a)
|
|
|
|
continue
|
2009-06-04 15:41:31 -06:00
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
s := Join(a, []byte{})
|
2009-06-04 15:41:31 -06:00
|
|
|
if string(s) != tt.s {
|
2009-11-09 13:07:39 -07:00
|
|
|
t.Errorf(`Join(Explode("%s", %d), "") = "%s"`, tt.s, tt.n, s)
|
2009-06-04 15:41:31 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
type SplitTest struct {
|
2009-12-15 16:33:31 -07:00
|
|
|
s string
|
|
|
|
sep string
|
|
|
|
n int
|
|
|
|
a []string
|
2009-06-04 15:41:31 -06:00
|
|
|
}
|
2009-10-08 16:14:54 -06:00
|
|
|
|
|
|
|
var splittests = []SplitTest{
|
|
|
|
SplitTest{abcd, "a", 0, []string{"", "bcd"}},
|
|
|
|
SplitTest{abcd, "z", 0, []string{"abcd"}},
|
|
|
|
SplitTest{abcd, "", 0, []string{"a", "b", "c", "d"}},
|
|
|
|
SplitTest{commas, ",", 0, []string{"1", "2", "3", "4"}},
|
|
|
|
SplitTest{dots, "...", 0, []string{"1", ".2", ".3", ".4"}},
|
|
|
|
SplitTest{faces, "☹", 0, []string{"☺☻", ""}},
|
|
|
|
SplitTest{faces, "~", 0, []string{faces}},
|
|
|
|
SplitTest{faces, "", 0, []string{"☺", "☻", "☹"}},
|
|
|
|
SplitTest{"1 2 3 4", " ", 3, []string{"1", "2", "3 4"}},
|
|
|
|
SplitTest{"1 2 3", " ", 3, []string{"1", "2", "3"}},
|
|
|
|
SplitTest{"1 2", " ", 3, []string{"1", "2"}},
|
|
|
|
SplitTest{"123", "", 2, []string{"1", "23"}},
|
|
|
|
SplitTest{"123", "", 17, []string{"1", "2", "3"}},
|
2009-06-04 15:41:31 -06:00
|
|
|
}
|
2009-09-13 22:35:18 -06:00
|
|
|
|
2009-06-04 15:41:31 -06:00
|
|
|
func TestSplit(t *testing.T) {
|
2009-06-24 20:02:29 -06:00
|
|
|
for _, tt := range splittests {
|
2010-02-25 17:01:29 -07:00
|
|
|
a := Split([]byte(tt.s), []byte(tt.sep), tt.n)
|
2009-12-15 16:33:31 -07:00
|
|
|
result := arrayOfString(a)
|
2009-06-04 15:41:31 -06:00
|
|
|
if !eq(result, tt.a) {
|
2009-12-15 16:33:31 -07:00
|
|
|
t.Errorf(`Split(%q, %q, %d) = %v; want %v`, tt.s, tt.sep, tt.n, result, tt.a)
|
|
|
|
continue
|
2009-06-04 15:41:31 -06:00
|
|
|
}
|
2010-02-25 17:01:29 -07:00
|
|
|
s := Join(a, []byte(tt.sep))
|
2009-06-04 15:41:31 -06:00
|
|
|
if string(s) != tt.s {
|
2009-11-09 13:07:39 -07:00
|
|
|
t.Errorf(`Join(Split(%q, %q, %d), %q) = %q`, tt.s, tt.sep, tt.n, tt.sep, s)
|
2009-06-04 15:41:31 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-06-04 16:00:15 -06:00
|
|
|
|
2009-11-04 16:19:30 -07:00
|
|
|
var splitaftertests = []SplitTest{
|
|
|
|
SplitTest{abcd, "a", 0, []string{"a", "bcd"}},
|
|
|
|
SplitTest{abcd, "z", 0, []string{"abcd"}},
|
|
|
|
SplitTest{abcd, "", 0, []string{"a", "b", "c", "d"}},
|
|
|
|
SplitTest{commas, ",", 0, []string{"1,", "2,", "3,", "4"}},
|
|
|
|
SplitTest{dots, "...", 0, []string{"1...", ".2...", ".3...", ".4"}},
|
|
|
|
SplitTest{faces, "☹", 0, []string{"☺☻☹", ""}},
|
|
|
|
SplitTest{faces, "~", 0, []string{faces}},
|
|
|
|
SplitTest{faces, "", 0, []string{"☺", "☻", "☹"}},
|
|
|
|
SplitTest{"1 2 3 4", " ", 3, []string{"1 ", "2 ", "3 4"}},
|
|
|
|
SplitTest{"1 2 3", " ", 3, []string{"1 ", "2 ", "3"}},
|
|
|
|
SplitTest{"1 2", " ", 3, []string{"1 ", "2"}},
|
|
|
|
SplitTest{"123", "", 2, []string{"1", "23"}},
|
|
|
|
SplitTest{"123", "", 17, []string{"1", "2", "3"}},
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestSplitAfter(t *testing.T) {
|
|
|
|
for _, tt := range splitaftertests {
|
2010-02-25 17:01:29 -07:00
|
|
|
a := SplitAfter([]byte(tt.s), []byte(tt.sep), tt.n)
|
2009-12-15 16:33:31 -07:00
|
|
|
result := arrayOfString(a)
|
2009-11-04 16:19:30 -07:00
|
|
|
if !eq(result, tt.a) {
|
2009-12-15 16:33:31 -07:00
|
|
|
t.Errorf(`Split(%q, %q, %d) = %v; want %v`, tt.s, tt.sep, tt.n, result, tt.a)
|
|
|
|
continue
|
2009-11-04 16:19:30 -07:00
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
s := Join(a, nil)
|
2009-11-04 16:19:30 -07:00
|
|
|
if string(s) != tt.s {
|
2009-11-09 13:07:39 -07:00
|
|
|
t.Errorf(`Join(Split(%q, %q, %d), %q) = %q`, tt.s, tt.sep, tt.n, tt.sep, s)
|
2009-11-04 16:19:30 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-12-15 22:09:55 -07:00
|
|
|
type FieldsTest struct {
|
|
|
|
s string
|
|
|
|
a []string
|
|
|
|
}
|
|
|
|
|
|
|
|
var fieldstests = []FieldsTest{
|
|
|
|
FieldsTest{"", []string{}},
|
|
|
|
FieldsTest{" ", []string{}},
|
|
|
|
FieldsTest{" \t ", []string{}},
|
|
|
|
FieldsTest{" abc ", []string{"abc"}},
|
|
|
|
FieldsTest{"1 2 3 4", []string{"1", "2", "3", "4"}},
|
|
|
|
FieldsTest{"1 2 3 4", []string{"1", "2", "3", "4"}},
|
|
|
|
FieldsTest{"1\t\t2\t\t3\t4", []string{"1", "2", "3", "4"}},
|
|
|
|
FieldsTest{"1\u20002\u20013\u20024", []string{"1", "2", "3", "4"}},
|
|
|
|
FieldsTest{"\u2000\u2001\u2002", []string{}},
|
|
|
|
FieldsTest{"\n™\t™\n", []string{"™", "™"}},
|
|
|
|
FieldsTest{faces, []string{faces}},
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestFields(t *testing.T) {
|
|
|
|
for _, tt := range fieldstests {
|
2010-02-25 17:01:29 -07:00
|
|
|
a := Fields([]byte(tt.s))
|
2009-12-15 22:09:55 -07:00
|
|
|
result := arrayOfString(a)
|
|
|
|
if !eq(result, tt.a) {
|
|
|
|
t.Errorf("Fields(%q) = %v; want %v", tt.s, a, tt.a)
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-09-01 14:46:59 -06:00
|
|
|
// Test case for any function which accepts and returns a byte array.
|
|
|
|
// For ease of creation, we write the byte arrays as strings.
|
|
|
|
type StringTest struct {
|
2009-12-15 16:33:31 -07:00
|
|
|
in, out string
|
2009-09-01 14:46:59 -06:00
|
|
|
}
|
|
|
|
|
2009-10-08 16:14:54 -06:00
|
|
|
var upperTests = []StringTest{
|
2009-09-01 14:46:59 -06:00
|
|
|
StringTest{"", ""},
|
|
|
|
StringTest{"abc", "ABC"},
|
|
|
|
StringTest{"AbC123", "ABC123"},
|
|
|
|
StringTest{"azAZ09_", "AZAZ09_"},
|
2009-12-15 16:33:31 -07:00
|
|
|
StringTest{"\u0250\u0250\u0250\u0250\u0250", "\u2C6F\u2C6F\u2C6F\u2C6F\u2C6F"}, // grows one byte per char
|
2009-09-01 14:46:59 -06:00
|
|
|
}
|
|
|
|
|
2009-10-08 16:14:54 -06:00
|
|
|
var lowerTests = []StringTest{
|
2009-09-01 14:46:59 -06:00
|
|
|
StringTest{"", ""},
|
|
|
|
StringTest{"abc", "abc"},
|
|
|
|
StringTest{"AbC123", "abc123"},
|
|
|
|
StringTest{"azAZ09_", "azaz09_"},
|
2009-12-15 16:33:31 -07:00
|
|
|
StringTest{"\u2C6D\u2C6D\u2C6D\u2C6D\u2C6D", "\u0251\u0251\u0251\u0251\u0251"}, // shrinks one byte per char
|
2009-09-01 14:46:59 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
const space = "\t\v\r\f\n\u0085\u00a0\u2000\u3000"
|
|
|
|
|
2009-10-08 16:14:54 -06:00
|
|
|
var trimSpaceTests = []StringTest{
|
2009-09-01 14:46:59 -06:00
|
|
|
StringTest{"", ""},
|
|
|
|
StringTest{"abc", "abc"},
|
2009-11-09 22:09:34 -07:00
|
|
|
StringTest{space + "abc" + space, "abc"},
|
2009-09-01 14:46:59 -06:00
|
|
|
StringTest{" ", ""},
|
|
|
|
StringTest{" \t\r\n \t\t\r\r\n\n ", ""},
|
|
|
|
StringTest{" \t\r\n x\t\t\r\r\n\n ", "x"},
|
|
|
|
StringTest{" \u2000\t\r\n x\t\t\r\r\ny\n \u3000", "x\t\t\r\r\ny"},
|
|
|
|
StringTest{"1 \t\r\n2", "1 \t\r\n2"},
|
2009-12-15 16:33:31 -07:00
|
|
|
StringTest{" x\x80", "x\x80"}, // invalid UTF-8 on end
|
|
|
|
StringTest{" x\xc0", "x\xc0"}, // invalid UTF-8 on end
|
2009-09-01 14:46:59 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
// Bytes returns a new slice containing the bytes in s.
|
|
|
|
// Borrowed from strings to avoid dependency.
|
|
|
|
func Bytes(s string) []byte {
|
2009-12-15 16:33:31 -07:00
|
|
|
b := make([]byte, len(s))
|
2009-09-01 14:46:59 -06:00
|
|
|
for i := 0; i < len(s); i++ {
|
2009-11-09 13:07:39 -07:00
|
|
|
b[i] = s[i]
|
2009-09-01 14:46:59 -06:00
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
return b
|
2009-09-01 14:46:59 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
// Execute f on each test case. funcName should be the name of f; it's used
|
|
|
|
// in failure reports.
|
|
|
|
func runStringTests(t *testing.T, f func([]byte) []byte, funcName string, testCases []StringTest) {
|
2009-09-15 10:41:59 -06:00
|
|
|
for _, tc := range testCases {
|
2009-12-15 16:33:31 -07:00
|
|
|
actual := string(f(Bytes(tc.in)))
|
2009-09-01 14:46:59 -06:00
|
|
|
if actual != tc.out {
|
2009-11-09 13:07:39 -07:00
|
|
|
t.Errorf("%s(%q) = %q; want %q", funcName, tc.in, actual, tc.out)
|
2009-09-01 14:46:59 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func tenRunes(rune int) string {
|
2009-12-15 16:33:31 -07:00
|
|
|
r := make([]int, 10)
|
2009-09-01 14:46:59 -06:00
|
|
|
for i := range r {
|
2009-11-09 13:07:39 -07:00
|
|
|
r[i] = rune
|
2009-09-01 14:46:59 -06:00
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
return string(r)
|
2009-09-01 14:46:59 -06:00
|
|
|
}
|
|
|
|
|
2009-11-15 13:07:27 -07:00
|
|
|
// User-defined self-inverse mapping function
|
|
|
|
func rot13(rune int) int {
|
2009-12-15 16:33:31 -07:00
|
|
|
step := 13
|
2009-11-15 13:07:27 -07:00
|
|
|
if rune >= 'a' && rune <= 'z' {
|
|
|
|
return ((rune - 'a' + step) % 26) + 'a'
|
|
|
|
}
|
|
|
|
if rune >= 'A' && rune <= 'Z' {
|
|
|
|
return ((rune - 'A' + step) % 26) + 'A'
|
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
return rune
|
2009-11-15 13:07:27 -07:00
|
|
|
}
|
|
|
|
|
2009-09-01 14:46:59 -06:00
|
|
|
func TestMap(t *testing.T) {
|
|
|
|
// Run a couple of awful growth/shrinkage tests
|
2009-12-15 16:33:31 -07:00
|
|
|
a := tenRunes('a')
|
2009-11-15 13:07:27 -07:00
|
|
|
|
2009-09-01 14:46:59 -06:00
|
|
|
// 1. Grow. This triggers two reallocations in Map.
|
2009-12-15 16:33:31 -07:00
|
|
|
maxRune := func(rune int) int { return unicode.MaxRune }
|
|
|
|
m := Map(maxRune, Bytes(a))
|
|
|
|
expect := tenRunes(unicode.MaxRune)
|
2009-09-01 14:46:59 -06:00
|
|
|
if string(m) != expect {
|
2009-11-09 13:07:39 -07:00
|
|
|
t.Errorf("growing: expected %q got %q", expect, m)
|
2009-09-01 14:46:59 -06:00
|
|
|
}
|
2009-11-15 13:07:27 -07:00
|
|
|
|
2009-09-01 14:46:59 -06:00
|
|
|
// 2. Shrink
|
2009-12-15 16:33:31 -07:00
|
|
|
minRune := func(rune int) int { return 'a' }
|
|
|
|
m = Map(minRune, Bytes(tenRunes(unicode.MaxRune)))
|
|
|
|
expect = a
|
2009-09-01 14:46:59 -06:00
|
|
|
if string(m) != expect {
|
2009-11-09 13:07:39 -07:00
|
|
|
t.Errorf("shrinking: expected %q got %q", expect, m)
|
2009-09-01 14:46:59 -06:00
|
|
|
}
|
2009-11-15 13:07:27 -07:00
|
|
|
|
|
|
|
// 3. Rot13
|
2009-12-15 16:33:31 -07:00
|
|
|
m = Map(rot13, Bytes("a to zed"))
|
|
|
|
expect = "n gb mrq"
|
2009-11-15 13:07:27 -07:00
|
|
|
if string(m) != expect {
|
|
|
|
t.Errorf("rot13: expected %q got %q", expect, m)
|
|
|
|
}
|
|
|
|
|
|
|
|
// 4. Rot13^2
|
2009-12-15 16:33:31 -07:00
|
|
|
m = Map(rot13, Map(rot13, Bytes("a to zed")))
|
|
|
|
expect = "a to zed"
|
2009-11-15 13:07:27 -07:00
|
|
|
if string(m) != expect {
|
|
|
|
t.Errorf("rot13: expected %q got %q", expect, m)
|
|
|
|
}
|
2009-12-11 11:37:48 -07:00
|
|
|
|
|
|
|
// 5. Drop
|
|
|
|
dropNotLatin := func(rune int) int {
|
|
|
|
if unicode.Is(unicode.Latin, rune) {
|
|
|
|
return rune
|
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
return -1
|
|
|
|
}
|
|
|
|
m = Map(dropNotLatin, Bytes("Hello, 세계"))
|
|
|
|
expect = "Hello"
|
2009-12-11 11:37:48 -07:00
|
|
|
if string(m) != expect {
|
|
|
|
t.Errorf("drop: expected %q got %q", expect, m)
|
|
|
|
}
|
2009-09-01 14:46:59 -06:00
|
|
|
}
|
|
|
|
|
2009-12-15 16:33:31 -07:00
|
|
|
func TestToUpper(t *testing.T) { runStringTests(t, ToUpper, "ToUpper", upperTests) }
|
2009-09-01 14:46:59 -06:00
|
|
|
|
2009-12-15 16:33:31 -07:00
|
|
|
func TestToLower(t *testing.T) { runStringTests(t, ToLower, "ToLower", lowerTests) }
|
2009-09-01 14:46:59 -06:00
|
|
|
|
2009-12-15 16:33:31 -07:00
|
|
|
func TestTrimSpace(t *testing.T) { runStringTests(t, TrimSpace, "TrimSpace", trimSpaceTests) }
|
2009-09-13 22:35:18 -06:00
|
|
|
|
|
|
|
type AddTest struct {
|
2009-12-15 16:33:31 -07:00
|
|
|
s, t string
|
|
|
|
cap int
|
2009-09-13 22:35:18 -06:00
|
|
|
}
|
2009-10-08 16:14:54 -06:00
|
|
|
|
|
|
|
var addtests = []AddTest{
|
|
|
|
AddTest{"", "", 0},
|
|
|
|
AddTest{"a", "", 1},
|
|
|
|
AddTest{"a", "b", 1},
|
|
|
|
AddTest{"abc", "def", 100},
|
2009-09-13 22:35:18 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
func TestAdd(t *testing.T) {
|
2009-09-15 10:41:59 -06:00
|
|
|
for _, test := range addtests {
|
2009-12-15 16:33:31 -07:00
|
|
|
b := make([]byte, len(test.s), test.cap)
|
2009-09-13 22:35:18 -06:00
|
|
|
for i := 0; i < len(test.s); i++ {
|
2009-11-09 13:07:39 -07:00
|
|
|
b[i] = test.s[i]
|
2009-09-13 22:35:18 -06:00
|
|
|
}
|
2010-02-25 17:01:29 -07:00
|
|
|
b = Add(b, []byte(test.t))
|
2009-11-09 22:09:34 -07:00
|
|
|
if string(b) != test.s+test.t {
|
2009-11-09 13:07:39 -07:00
|
|
|
t.Errorf("Add(%q,%q) = %q", test.s, test.t, string(b))
|
2009-09-13 22:35:18 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestAddByte(t *testing.T) {
|
2009-12-15 16:33:31 -07:00
|
|
|
const N = 2e5
|
|
|
|
b := make([]byte, 0)
|
2009-09-13 22:35:18 -06:00
|
|
|
for i := 0; i < N; i++ {
|
2009-11-09 13:07:39 -07:00
|
|
|
b = AddByte(b, byte(i))
|
2009-09-13 22:35:18 -06:00
|
|
|
}
|
|
|
|
if len(b) != N {
|
2009-11-09 13:07:39 -07:00
|
|
|
t.Errorf("AddByte: too small; expected %d got %d", N, len(b))
|
2009-09-13 22:35:18 -06:00
|
|
|
}
|
|
|
|
for i, c := range b {
|
|
|
|
if c != byte(i) {
|
2009-11-09 13:07:39 -07:00
|
|
|
t.Fatalf("AddByte: b[%d] should be %d is %d", i, c, byte(i))
|
2009-09-13 22:35:18 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-11-16 13:40:01 -07:00
|
|
|
|
|
|
|
type RepeatTest struct {
|
2009-12-15 16:33:31 -07:00
|
|
|
in, out string
|
|
|
|
count int
|
2009-11-16 13:40:01 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
var RepeatTests = []RepeatTest{
|
|
|
|
RepeatTest{"", "", 0},
|
|
|
|
RepeatTest{"", "", 1},
|
|
|
|
RepeatTest{"", "", 2},
|
|
|
|
RepeatTest{"-", "", 0},
|
|
|
|
RepeatTest{"-", "-", 1},
|
|
|
|
RepeatTest{"-", "----------", 10},
|
|
|
|
RepeatTest{"abc ", "abc abc abc ", 3},
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestRepeat(t *testing.T) {
|
|
|
|
for _, tt := range RepeatTests {
|
2010-02-25 17:01:29 -07:00
|
|
|
tin := []byte(tt.in)
|
|
|
|
tout := []byte(tt.out)
|
2009-12-15 16:33:31 -07:00
|
|
|
a := Repeat(tin, tt.count)
|
2009-11-16 13:40:01 -07:00
|
|
|
if !Equal(a, tout) {
|
2009-12-15 16:33:31 -07:00
|
|
|
t.Errorf("Repeat(%q, %d) = %q; want %q", tin, tt.count, a, tout)
|
|
|
|
continue
|
2009-11-16 13:40:01 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-12-02 21:47:38 -07:00
|
|
|
|
|
|
|
func runesEqual(a, b []int) bool {
|
|
|
|
if len(a) != len(b) {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
for i, r := range a {
|
|
|
|
if r != b[i] {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
}
|
2009-12-15 16:33:31 -07:00
|
|
|
return true
|
2009-12-02 21:47:38 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
type RunesTest struct {
|
2009-12-15 16:33:31 -07:00
|
|
|
in string
|
|
|
|
out []int
|
|
|
|
lossy bool
|
2009-12-02 21:47:38 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
var RunesTests = []RunesTest{
|
|
|
|
RunesTest{"", []int{}, false},
|
|
|
|
RunesTest{" ", []int{32}, false},
|
|
|
|
RunesTest{"ABC", []int{65, 66, 67}, false},
|
|
|
|
RunesTest{"abc", []int{97, 98, 99}, false},
|
|
|
|
RunesTest{"\u65e5\u672c\u8a9e", []int{26085, 26412, 35486}, false},
|
|
|
|
RunesTest{"ab\x80c", []int{97, 98, 0xFFFD, 99}, true},
|
|
|
|
RunesTest{"ab\xc0c", []int{97, 98, 0xFFFD, 99}, true},
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestRunes(t *testing.T) {
|
|
|
|
for _, tt := range RunesTests {
|
2010-02-25 17:01:29 -07:00
|
|
|
tin := []byte(tt.in)
|
2009-12-15 16:33:31 -07:00
|
|
|
a := Runes(tin)
|
2009-12-02 21:47:38 -07:00
|
|
|
if !runesEqual(a, tt.out) {
|
2009-12-15 16:33:31 -07:00
|
|
|
t.Errorf("Runes(%q) = %v; want %v", tin, a, tt.out)
|
|
|
|
continue
|
2009-12-02 21:47:38 -07:00
|
|
|
}
|
|
|
|
if !tt.lossy {
|
|
|
|
// can only test reassembly if we didn't lose information
|
2009-12-15 16:33:31 -07:00
|
|
|
s := string(a)
|
2009-12-02 21:47:38 -07:00
|
|
|
if s != tt.in {
|
|
|
|
t.Errorf("string(Runes(%q)) = %x; want %x", tin, s, tin)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2010-05-19 00:01:05 -06:00
|
|
|
|
|
|
|
|
|
|
|
type TrimTest struct {
|
|
|
|
f func([]byte, string) []byte
|
|
|
|
in, cutset, out string
|
|
|
|
}
|
|
|
|
|
|
|
|
var trimTests = []TrimTest{
|
|
|
|
TrimTest{Trim, "abba", "a", "bb"},
|
|
|
|
TrimTest{Trim, "abba", "ab", ""},
|
|
|
|
TrimTest{TrimLeft, "abba", "ab", ""},
|
|
|
|
TrimTest{TrimRight, "abba", "ab", ""},
|
|
|
|
TrimTest{TrimLeft, "abba", "a", "bba"},
|
|
|
|
TrimTest{TrimRight, "abba", "a", "abb"},
|
|
|
|
TrimTest{Trim, "<tag>", "<>", "tag"},
|
|
|
|
TrimTest{Trim, "* listitem", " *", "listitem"},
|
|
|
|
TrimTest{Trim, `"quote"`, `"`, "quote"},
|
|
|
|
TrimTest{Trim, "\u2C6F\u2C6F\u0250\u0250\u2C6F\u2C6F", "\u2C6F", "\u0250\u0250"},
|
|
|
|
//empty string tests
|
|
|
|
TrimTest{Trim, "abba", "", "abba"},
|
|
|
|
TrimTest{Trim, "", "123", ""},
|
|
|
|
TrimTest{Trim, "", "", ""},
|
|
|
|
TrimTest{TrimLeft, "abba", "", "abba"},
|
|
|
|
TrimTest{TrimLeft, "", "123", ""},
|
|
|
|
TrimTest{TrimLeft, "", "", ""},
|
|
|
|
TrimTest{TrimRight, "abba", "", "abba"},
|
|
|
|
TrimTest{TrimRight, "", "123", ""},
|
|
|
|
TrimTest{TrimRight, "", "", ""},
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestTrim(t *testing.T) {
|
|
|
|
for _, tc := range trimTests {
|
|
|
|
actual := string(tc.f([]byte(tc.in), tc.cutset))
|
|
|
|
var name string
|
|
|
|
switch tc.f {
|
|
|
|
case Trim:
|
|
|
|
name = "Trim"
|
|
|
|
case TrimLeft:
|
|
|
|
name = "TrimLeft"
|
|
|
|
case TrimRight:
|
|
|
|
name = "TrimRight"
|
|
|
|
default:
|
|
|
|
t.Error("Undefined trim function")
|
|
|
|
}
|
|
|
|
if actual != tc.out {
|
|
|
|
t.Errorf("%s(%q, %q) = %q; want %q", name, tc.in, tc.cutset, actual, tc.out)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
type TrimFuncTest struct {
|
|
|
|
f func(r int) bool
|
|
|
|
name, in, out string
|
|
|
|
}
|
|
|
|
|
|
|
|
var trimFuncTests = []TrimFuncTest{
|
|
|
|
TrimFuncTest{unicode.IsSpace, "IsSpace", space + " hello " + space, "hello"},
|
|
|
|
TrimFuncTest{unicode.IsDigit, "IsDigit", "\u0e50\u0e5212hello34\u0e50\u0e51", "hello"},
|
|
|
|
TrimFuncTest{unicode.IsUpper, "IsUpper", "\u2C6F\u2C6F\u2C6F\u2C6FABCDhelloEF\u2C6F\u2C6FGH\u2C6F\u2C6F", "hello"},
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestTrimFunc(t *testing.T) {
|
|
|
|
for _, tc := range trimFuncTests {
|
|
|
|
actual := string(TrimFunc([]byte(tc.in), tc.f))
|
|
|
|
if actual != tc.out {
|
|
|
|
t.Errorf("TrimFunc(%q, %q) = %q; want %q", tc.in, tc.name, actual, tc.out)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|