-
Notifications
You must be signed in to change notification settings - Fork 11
Expand file tree
/
Copy pathsort_test.go
More file actions
158 lines (140 loc) · 2.79 KB
/
sort_test.go
File metadata and controls
158 lines (140 loc) · 2.79 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
package radix
import (
"bufio"
"log"
"os"
"reflect"
"sort"
"strconv"
"testing"
)
func TestSort(t *testing.T) {
data := [...]string{"", "Hello", "foo", "fo", "xb", "xa", "bar", "foo", "f00", "%*&^*&^&", "***"}
sorted := data[0:]
sort.Strings(sorted)
a := data[0:]
Sort(a)
if !reflect.DeepEqual(a, sorted) {
t.Errorf(" got %v", a)
t.Errorf("want %v", sorted)
}
Sort(nil)
a = []string{}
Sort(a)
if !reflect.DeepEqual(a, []string{}) {
t.Errorf(" got %v", a)
t.Errorf("want %v", []string{})
}
a = []string{""}
Sort(a)
if !reflect.DeepEqual(a, []string{""}) {
t.Errorf(" got %v", a)
t.Errorf("want %v", []string{""})
}
}
func TestSort1k(t *testing.T) {
data := make([]string, 1<<10)
for i := range data {
data[i] = strconv.Itoa(i ^ 0x2cc)
}
sorted := make([]string, len(data))
copy(sorted, data)
sort.Strings(sorted)
Sort(data)
if !reflect.DeepEqual(data, sorted) {
t.Errorf(" got %v", data)
t.Errorf("want %v", sorted)
}
}
func TestSortBible(t *testing.T) {
var data []string
f, err := os.Open("res/bible.txt")
if err != nil {
log.Fatal(err)
}
for sc := bufio.NewScanner(f); sc.Scan(); {
data = append(data, sc.Text())
}
sorted := make([]string, len(data))
copy(sorted, data)
sort.Strings(sorted)
Sort(data)
if !reflect.DeepEqual(data, sorted) {
for i, s := range data {
if s != sorted[i] {
t.Errorf("%v got: %v", i, s)
t.Errorf("%v want: %v", i, sorted[i])
}
}
}
}
func BenchmarkRadixSortBible(b *testing.B) {
b.StopTimer()
var data []string
f, err := os.Open("res/bible.txt")
if err != nil {
log.Fatal(err)
}
for sc := bufio.NewScanner(f); sc.Scan(); {
data = append(data, sc.Text())
}
a := make([]string, len(data))
for i := 0; i < b.N; i++ {
copy(a, data)
b.StartTimer()
Sort(a)
b.StopTimer()
}
if err := f.Close(); err != nil {
log.Fatal(err)
}
}
func BenchmarkSortStringsBible(b *testing.B) {
b.StopTimer()
var data []string
f, err := os.Open("res/bible.txt")
if err != nil {
log.Fatal(err)
}
for sc := bufio.NewScanner(f); sc.Scan(); {
data = append(data, sc.Text())
}
a := make([]string, len(data))
for i := 0; i < b.N; i++ {
copy(a, data)
b.StartTimer()
sort.Strings(a)
b.StopTimer()
}
if err := f.Close(); err != nil {
log.Fatal(err)
}
}
func BenchmarkRadixSort1k(b *testing.B) {
b.StopTimer()
data := make([]string, 1<<10)
for i := range data {
data[i] = strconv.Itoa(i ^ 0x2cc)
}
a := make([]string, len(data))
for i := 0; i < b.N; i++ {
copy(a, data)
b.StartTimer()
Sort(a)
b.StopTimer()
}
}
func BenchmarkSortStrings1k(b *testing.B) {
b.StopTimer()
data := make([]string, 1<<10)
for i := range data {
data[i] = strconv.Itoa(i ^ 0x2cc)
}
a := make([]string, len(data))
for i := 0; i < b.N; i++ {
copy(a, data)
b.StartTimer()
sort.Strings(a)
b.StopTimer()
}
}