Edinburgh Speech Tools
2.4-release
Loading...
Searching...
No Matches
string_regression.cc
1
/************************************************************************/
2
/* */
3
/* Centre for Speech Technology Research */
4
/* University of Edinburgh, UK */
5
/* Copyright (c) 1996,1997 */
6
/* All Rights Reserved. */
7
/* */
8
/* Permission is hereby granted, free of charge, to use and distribute */
9
/* this software and its documentation without restriction, including */
10
/* without limitation the rights to use, copy, modify, merge, publish, */
11
/* distribute, sublicense, and/or sell copies of this work, and to */
12
/* permit persons to whom this work is furnished to do so, subject to */
13
/* the following conditions: */
14
/* 1. The code must retain the above copyright notice, this list of */
15
/* conditions and the following disclaimer. */
16
/* 2. Any modifications must be clearly marked as such. */
17
/* 3. Original authors' names are not deleted. */
18
/* 4. The authors' names are not used to endorse or promote products */
19
/* derived from this software without specific prior written */
20
/* permission. */
21
/* */
22
/* THE UNIVERSITY OF EDINBURGH AND THE CONTRIBUTORS TO THIS WORK */
23
/* DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING */
24
/* ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT */
25
/* SHALL THE UNIVERSITY OF EDINBURGH NOR THE CONTRIBUTORS BE LIABLE */
26
/* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES */
27
/* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN */
28
/* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, */
29
/* ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF */
30
/* THIS SOFTWARE. */
31
/* */
32
/************************************************************************/
33
/* Author: Richard Caley */
34
/* Date: May 1997 */
35
/************************************************************************/
36
#include "EST_String.h"
37
#include <iostream>
38
39
int
main()
40
41
{
42
EST_String
line(
"\n"
);
43
EST_String
zeroth
(
""
);
44
EST_String
first(
"hello world"
);
45
EST_String
second
(
"lo w"
);
46
EST_String
third
(
"l"
);
47
EST_String
fourth
(
"the lazy dog."
);
48
EST_String
fifth
(
"two\nlines"
);
49
EST_String
sixth
(
"-o:F"
);
50
EST_String
seventh
(
"-o"
);
51
EST_String
eighth
(
"some,words-with[punctuation]left..after,a-vowel!"
);
52
EST_String
space(
" "
);
53
EST_String
quoted(
"\"some tokens\" which are \"quoted with \"\"\""
);
54
55
EST_String
bits1
[10],
bits2
[10],
bits3
[10],
bits4
[10],
bits5
[10],
bits6
[2];
56
57
EST_String
sub1
= first;
58
EST_String
sub2
= first;
59
60
EST_Regex
reg0
(
".*"
);
61
EST_Regex
reg1
(
"l+"
);
62
EST_Regex
reg2
(
"l\\(l+\\|azy\\)"
);
63
EST_Regex
reg3
(
"lll+"
);
64
EST_Regex
reg4
(
second
);
65
EST_Regex
reg5
(
".*l+.*l+.*"
);
66
EST_Regex
reg6
(
".. .."
);
67
EST_Regex
reg7
(
"[a-z]\\.[a-z]"
);
68
EST_Regex
reg8
(
"o\\>"
);
69
EST_Regex
reg9
(
"ll\nrr"
);
70
EST_Regex
reg10
(
"o\nl"
);
71
EST_Regex
reg11
(
"\\([^aeiou]\\)\\(\\]\\|[-[.,!?]\\)+"
);
72
73
EST_String
result0
=
zeroth
.before(
"."
, -1);
74
EST_String
result1
= first.before(
second
);
75
EST_String
result2
= first.before(
second
,4);
76
EST_String
result3
= first.before(
third
,4);
77
EST_String
result4
= first.before(
third
, -6);
78
EST_String
result5
= first.before(
third
, -7);
79
EST_String
result6b
= first.before(5);
80
81
EST_String
result1a
= first.after(
second
);
82
EST_String
result2a
= first.after(
second
,4);
83
EST_String
result3a
= first.after(
third
,4);
84
EST_String
result4a
= first.after(
third
, -6);
85
EST_String
result5a
= first.after(
third
, -7);
86
EST_String
result6a
= first.after(5);
87
88
EST_String
result6
=
second
;
89
EST_String
result7
=
second
;
90
result6
+=
" sw eet"
;
91
result7
+=
third
;
92
93
int
test0
=
zeroth
.contains(
reg0
);
94
int
test1
= first.contains(
reg1
);
95
int
test2
= first.contains(
reg2
);
96
int
test3
= first.contains(
reg3
);
97
int
test4
= first.contains(
second
);
98
int
test5
=
fourth
.contains(
reg2
);
99
int
test6
=
fourth
.contains(
reg7
);
100
int
test7
= first.contains(
reg8
);
101
int
test8
=
fourth
.contains(
reg8
);
102
int
test9
= first.contains(
reg9
);
103
int
test10
=
fifth
.contains(
reg10
);
104
int
test11
= first.contains(
second
,3);
105
int
test12
= first.contains(
second
,0);
106
int
test13
=
second
.contains(
third
, 0);
107
int
test14
=
sixth
.contains(
seventh
, 0);
108
int
test15
=
seventh
.contains(
seventh
, 0);
109
110
int
test0m
=
zeroth
.matches(
reg0
);
111
int
test1m
= first.matches(
reg4
);
112
int
test2m
=
second
.matches(
reg4
);
113
int
test3m
= first.matches(
reg5
);
114
115
EST_String
result1r
= first.before(
second
);
116
EST_String
result2r
= first.before(
third
, -1);
117
EST_String
result3r
= first.after(
third
, 5);
118
119
EST_String
result1at
= first.at(
second
);
120
EST_String
result2at
= first.at(
reg6
);
121
EST_String
result3at
= first.at(2,4);
122
123
EST_String
result8
=
eighth
;
124
result8
.gsub(
reg11
,1);
125
126
127
int
num1
= split(first,
bits1
, 10,
reg1
);
128
int
num2
= split(first,
bits2
, 2,
reg1
);
129
int
num7
= split(first,
bits3
, 10, space);
130
int
num8
= split(quoted,
bits4
, 10, space,
'"'
);
131
int
num9
= split(quoted,
bits5
, 10, RXwhite,
'"'
);
132
int
num10
= split(first,
bits6
, 2,
"."
);
133
134
int
num3
= first.freq(
"o"
);
135
int
num4
= first.freq(
third
);
136
// numx = first.freq(reg1); // GNU can't do this
137
138
int
num5
=
sub1
.gsub(
"l"
,
"[an ell]"
);
139
int
num6
=
sub2
.gsub(
reg1
,
"[some ells]"
);
140
141
cout
<<
"First '"
<< first <<
"'\n"
;
142
cout
<<
"Second '"
<<
second
<<
"'\n"
;
143
cout
<<
"Third '"
<<
third
<<
"'\n"
;
144
145
cout
<<
"Result 0 '"
<<
result0
<<
"'\n"
;
146
147
cout
<<
"Result 1 '"
<<
result1
<<
"'\n"
;
148
cout
<<
"Result 2 '"
<<
result2
<<
"'\n"
;
149
cout
<<
"Result 3 '"
<<
result3
<<
"'\n"
;
150
cout
<<
"Result 4 '"
<<
result4
<<
"'\n"
;
151
cout
<<
"Result 5 '"
<<
result5
<<
"'\n"
;
152
cout
<<
"Result 6b '"
<<
result6b
<<
"'\n"
;
153
154
cout
<<
"Result 1a '"
<<
result1a
<<
"'\n"
;
155
cout
<<
"Result 2a '"
<<
result2a
<<
"'\n"
;
156
cout
<<
"Result 3a '"
<<
result3a
<<
"'\n"
;
157
cout
<<
"Result 4a '"
<<
result4a
<<
"'\n"
;
158
cout
<<
"Result 5a '"
<<
result5a
<<
"'\n"
;
159
cout
<<
"Result 6a '"
<<
result6a
<<
"'\n"
;
160
161
cout
<<
"Result 6 '"
<<
result6
<<
"'\n"
;
162
cout
<<
"Result 7 '"
<<
result7
<<
"'\n"
;
163
cout
<<
"Result 8 '"
<<
result8
<<
"'\n"
;
164
165
cout
<<
"Test 0 '"
<<
test0
<<
"'\n"
;
166
cout
<<
"Test 1 '"
<<
test1
<<
"'\n"
;
167
cout
<<
"Test 2 '"
<<
test2
<<
"'\n"
;
168
cout
<<
"Test 3 '"
<<
test3
<<
"'\n"
;
169
cout
<<
"Test 4 '"
<<
test4
<<
"'\n"
;
170
cout
<<
"Test 5 '"
<<
test5
<<
"'\n"
;
171
cout
<<
"Test 6 '"
<<
test6
<<
"'\n"
;
172
cout
<<
"Test 7 '"
<<
test7
<<
"'\n"
;
173
cout
<<
"Test 8 '"
<<
test8
<<
"'\n"
;
174
cout
<<
"Test 9 '"
<<
test9
<<
"'\n"
;
175
cout
<<
"Test 10 '"
<<
test10
<<
"'\n"
;
176
cout
<<
"Test 11 '"
<<
test11
<<
"'\n"
;
177
cout
<<
"Test 12 '"
<<
test12
<<
"'\n"
;
178
cout
<<
"Test 13 '"
<<
test13
<<
"'\n"
;
179
cout
<<
"Test 14 '"
<<
test14
<<
"'\n"
;
180
cout
<<
"Test 15 '"
<<
test15
<<
"'\n"
;
181
182
cout
<<
"Test 0m '"
<<
test0m
<<
"'\n"
;
183
cout
<<
"Test 1m '"
<<
test1m
<<
"'\n"
;
184
cout
<<
"Test 2m '"
<<
test2m
<<
"'\n"
;
185
cout
<<
"Test 3m '"
<<
test3m
<<
"'\n"
;
186
187
cout
<<
"Result 1r '"
<<
result1r
<<
"'\n"
;
188
cout
<<
"Result 2r '"
<<
result2r
<<
"'\n"
;
189
cout
<<
"Result 3r '"
<<
result3r
<<
"'\n"
;
190
191
cout
<<
"Result 1at '"
<<
result1at
<<
"'\n"
;
192
cout
<<
"Result 2at '"
<<
result2at
<<
"'\n"
;
193
cout
<<
"Result 3at '"
<<
result3at
<<
"'\n"
;
194
195
cout
<<
"Num 1 '"
<<
num1
<<
"'\n"
;
196
cout
<<
"bits1[0] '"
<<
bits1
[0] <<
"'\n"
;
197
cout
<<
"bits1[1] '"
<<
bits1
[1] <<
"'\n"
;
198
cout
<<
"bits1[2] '"
<<
bits1
[2] <<
"'\n"
;
199
200
cout
<<
"Num 2 '"
<<
num2
<<
"'\n"
;
201
cout
<<
"bits2[0] '"
<<
bits2
[0] <<
"'\n"
;
202
cout
<<
"bits2[1] '"
<<
bits2
[1] <<
"'\n"
;
203
cout
<<
"bits2[2] '"
<<
bits2
[2] <<
"'\n"
;
204
205
cout
<<
"Num 7 '"
<<
num7
<<
"'\n"
;
206
cout
<<
"bits3[0] '"
<<
bits3
[0] <<
"'\n"
;
207
cout
<<
"bits3[1] '"
<<
bits3
[1] <<
"'\n"
;
208
cout
<<
"bits3[2] '"
<<
bits3
[2] <<
"'\n"
;
209
210
cout
<<
"Num 8 '"
<<
num8
<<
"'\n"
;
211
cout
<<
"bits4[0] '"
<<
bits4
[0] <<
"'\n"
;
212
cout
<<
"bits4[1] '"
<<
bits4
[1] <<
"'\n"
;
213
cout
<<
"bits4[2] '"
<<
bits4
[2] <<
"'\n"
;
214
cout
<<
"bits4[3] '"
<<
bits4
[3] <<
"'\n"
;
215
cout
<<
"bits4[4] '"
<<
bits4
[4] <<
"'\n"
;
216
cout
<<
"bits4[5] '"
<<
bits4
[5] <<
"'\n"
;
217
218
cout
<<
"Num 9 '"
<<
num9
<<
"'\n"
;
219
cout
<<
"bits5[0] '"
<<
bits5
[0] <<
"'\n"
;
220
cout
<<
"bits5[1] '"
<<
bits5
[1] <<
"'\n"
;
221
cout
<<
"bits5[2] '"
<<
bits5
[2] <<
"'\n"
;
222
cout
<<
"bits5[3] '"
<<
bits5
[3] <<
"'\n"
;
223
cout
<<
"bits5[4] '"
<<
bits5
[4] <<
"'\n"
;
224
225
cout
<<
"Num 10 '"
<<
num10
<<
"'\n"
;
226
cout
<<
"bits6[0] '"
<<
bits6
[0] <<
"'\n"
;
227
cout
<<
"bits6[1] '"
<<
bits6
[1] <<
"'\n"
;
228
229
cout
<<
"Num 3 '"
<<
num3
<<
"'\n"
;
230
cout
<<
"Num 4 '"
<<
num4
<<
"'\n"
;
231
232
cout
<<
"Num 5 '"
<<
num5
<<
"'\n"
;
233
cout
<<
"Sub 1 '"
<<
sub1
<<
"'\n"
;
234
235
cout
<<
"Num 6 '"
<<
num6
<<
"'\n"
;
236
cout
<<
"Sub 1 '"
<<
sub2
<<
"'\n"
;
237
238
return
(0);
239
}
240
EST_Hash_Pair
Definition
EST_THash.h:75
EST_Regex
Definition
EST_Regex.h:55
EST_String
Definition
EST_String.h:70
testsuite
string_regression.cc
Generated on Fri Sep 20 2024 04:19:10 for Edinburgh Speech Tools by
1.9.8