/
ls.cpp
132 lines (132 loc) · 2.81 KB
/
ls.cpp
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
#ifdef MAIN_LS
#include <string.h>
#include <iostream>
#include "sstring.h"
#include "ls.h"
#include "ds.h"
using namespace std;
int main(void)
{
cerr << "Test LarssonSadakana for int...";
{
typedef int T;
const char *t = "banana";
EList<T> sa;
EList<T> isa;
for (size_t i = 0; i < strlen(t); i++)
{
isa.push_back(t[i]);
}
isa.push_back(0);
sa.resize(isa.size());
LarssonSadakane<T> ls;
ls.suffixsort(isa.ptr(), sa.ptr(), (T)sa.size() - 1, 'z', 0);
assert_eq((T)'a', t[sa[1]]);
assert_eq(5, sa[1]);
assert_eq((T)'a', t[sa[2]]);
assert_eq(3, sa[2]);
assert_eq((T)'a', t[sa[3]]);
assert_eq(1, sa[3]);
assert_eq((T)'b', t[sa[4]]);
assert_eq(0, sa[4]);
assert_eq((T)'n', t[sa[5]]);
assert_eq(4, sa[5]);
assert_eq((T)'n', t[sa[6]]);
assert_eq(2, sa[6]);
}
cerr << "PASSED" << endl;
cerr << "Test LarssonSadakana for uint32_t...";
{
typedef uint32_t T;
const char *t = "banana";
EList<T> sa;
EList<T> isa;
for (size_t i = 0; i < strlen(t); i++)
{
isa.push_back(t[i]);
}
isa.push_back(0);
sa.resize(isa.size());
LarssonSadakane<int> ls;
ls.suffixsort(
(int *)isa.ptr(),
(int *)sa.ptr(),
(int)sa.size() - 1,
'z',
0);
assert_eq((T)'a', t[sa[1]]);
assert_eq(5, sa[1]);
assert_eq((T)'a', t[sa[2]]);
assert_eq(3, sa[2]);
assert_eq((T)'a', t[sa[3]]);
assert_eq(1, sa[3]);
assert_eq((T)'b', t[sa[4]]);
assert_eq(0, sa[4]);
assert_eq((T)'n', t[sa[5]]);
assert_eq(4, sa[5]);
assert_eq((T)'n', t[sa[6]]);
assert_eq(2, sa[6]);
}
cerr << "PASSED" << endl;
cerr << "Last elt is < or > others ...";
{
{
typedef int T;
const char *t = "aaa";
EList<T> sa;
EList<T> isa;
for (size_t i = 0; i < strlen(t); i++)
{
isa.push_back(t[i]);
}
isa.push_back(0);
sa.resize(isa.size());
LarssonSadakane<T> ls;
ls.suffixsort(isa.ptr(), sa.ptr(), (T)sa.size() - 1, 'z', 0);
assert_eq(3, sa[0]);
assert_eq(2, sa[1]);
assert_eq(1, sa[2]);
assert_eq(0, sa[3]);
}
{
typedef int T;
const char *t = "aaa";
EList<T> sa;
EList<T> isa;
for (size_t i = 0; i < strlen(t); i++)
{
isa.push_back(t[i]);
}
isa.push_back('y');
sa.resize(isa.size());
LarssonSadakane<T> ls;
ls.suffixsort(isa.ptr(), sa.ptr(), (T)sa.size() - 1, 'z', 0);
assert_eq(3, sa[0]);
assert_eq(2, sa[1]);
assert_eq(1, sa[2]);
assert_eq(0, sa[3]);
}
{
typedef int T;
const char *t = "aaa";
EList<T> sa;
EList<T> isa;
for (size_t i = 0; i < strlen(t); i++)
{
isa.push_back(t[i]);
}
isa.push_back('y');
isa.push_back(0);
sa.resize(isa.size());
LarssonSadakane<T> ls;
ls.suffixsort(isa.ptr(), sa.ptr(), (T)sa.size() - 1, 'z', 0);
assert_eq(4, sa[0]);
assert_eq(0, sa[1]);
assert_eq(1, sa[2]);
assert_eq(2, sa[3]);
assert_eq(3, sa[4]);
}
}
cerr << "PASSED" << endl;
}
#endif