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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
|
import rustrt.sbuf;
import std._vec.rustrt.vbuf;
native "rust" mod rustrt {
type sbuf;
fn str_buf(str s) -> sbuf;
fn str_byte_len(str s) -> uint;
fn str_alloc(uint n_bytes) -> str;
fn str_from_vec(vec[u8] b) -> str;
fn refcount[T](str s) -> uint;
}
fn eq(&str a, &str b) -> bool {
let uint i = byte_len(a);
if (byte_len(b) != i) {
ret false;
}
while (i > 0u) {
i -= 1u;
auto cha = a.(i);
auto chb = b.(i);
if (cha != chb) {
ret false;
}
}
ret true;
}
fn lteq(&str a, &str b) -> bool {
let uint i = byte_len(a);
let uint j = byte_len(b);
let uint n = i;
if (j < n) {
n = j;
}
let uint x = 0u;
while (x < n) {
auto cha = a.(x);
auto chb = b.(x);
if (cha <= chb) {
ret true;
}
else if (cha > chb) {
ret false;
}
x += 1u;
}
ret i <= j;
}
fn hash(&str s) -> uint {
// djb hash.
// FIXME: replace with murmur.
let uint u = 5381u;
for (u8 c in s) {
u *= 33u;
u += (c as uint);
}
ret u;
}
fn is_utf8(vec[u8] v) -> bool {
fail; // FIXME
}
fn is_ascii(str s) -> bool {
let uint i = byte_len(s);
while (i > 0u) {
i -= 1u;
if ((s.(i) & 0x80u8) != 0u8) {
ret false;
}
}
ret true;
}
fn alloc(uint n_bytes) -> str {
ret rustrt.str_alloc(n_bytes);
}
// Returns the number of bytes (a.k.a. UTF-8 code units) in s.
// Contrast with a function that would return the number of code
// points (char's), combining character sequences, words, etc. See
// http://icu-project.org/apiref/icu4c/classBreakIterator.html for a
// way to implement those.
fn byte_len(str s) -> uint {
ret rustrt.str_byte_len(s);
}
fn buf(str s) -> sbuf {
ret rustrt.str_buf(s);
}
fn bytes(str s) -> vec[u8] {
fn ith(str s, uint i) -> u8 {
ret s.(i);
}
ret _vec.init_fn[u8](bind ith(s, _), byte_len(s));
}
fn from_bytes(vec[u8] v) : is_utf8(v) -> str {
ret rustrt.str_from_vec(v);
}
fn refcount(str s) -> uint {
auto r = rustrt.refcount[u8](s);
if (r == dbg.const_refcount) {
ret r;
} else {
// -1 because calling this function incremented the refcount.
ret r - 1u;
}
}
// Standard bits from the world of string libraries.
fn index(str s, u8 c) -> int {
let int i = 0;
for (u8 k in s) {
if (k == c) {
ret i;
}
i += 1;
}
ret -1;
}
fn rindex(str s, u8 c) -> int {
let int n = _str.byte_len(s) as int;
while (n >= 0) {
if (s.(n) == c) {
ret n;
}
n -= 1;
}
ret n;
}
fn find(str haystack, str needle) -> int {
let int haystack_len = byte_len(haystack) as int;
let int needle_len = byte_len(needle) as int;
if (needle_len == 0) {
ret 0;
}
fn match_at(&str haystack,
&str needle,
int i) -> bool {
let int j = i;
for (u8 c in needle) {
if (haystack.(j) != c) {
ret false;
}
j += 1;
}
ret true;
}
let int i = 0;
while (i <= haystack_len - needle_len) {
if (match_at(haystack, needle, i)) {
ret i;
}
i += 1;
}
ret -1;
}
fn starts_with(str haystack, str needle) -> bool {
let uint haystack_len = byte_len(haystack);
let uint needle_len = byte_len(needle);
if (needle_len == 0u) {
ret true;
}
if (needle_len > haystack_len) {
ret false;
}
ret eq(substr(haystack, 0u, needle_len), needle);
}
fn ends_with(str haystack, str needle) -> bool {
let uint haystack_len = byte_len(haystack);
let uint needle_len = byte_len(needle);
if (needle_len == 0u) {
ret true;
}
if (needle_len > haystack_len) {
ret false;
}
ret eq(substr(haystack,
haystack_len - needle_len,
needle_len),
needle);
}
fn substr(str s, uint begin, uint len) -> str {
let str accum = "";
let uint i = begin;
while (i < begin+len) {
accum += s.(i);
i += 1u;
}
ret accum;
}
fn split(str s, u8 sep) -> vec[str] {
let vec[str] v = vec();
let str accum = "";
let bool ends_with_sep = false;
for (u8 c in s) {
if (c == sep) {
v += accum;
accum = "";
ends_with_sep = true;
} else {
accum += c;
ends_with_sep = false;
}
}
if (_str.byte_len(accum) != 0u ||
ends_with_sep) {
v += accum;
}
ret v;
}
fn concat(vec[str] v) -> str {
let str s = "";
for (str ss in v) {
s += ss;
}
ret s;
}
fn connect(vec[str] v, str sep) -> str {
let str s = "";
let bool first = true;
for (str ss in v) {
if (first) {
first = false;
} else {
s += sep;
}
s += ss;
}
ret s;
}
// Local Variables:
// mode: rust;
// fill-column: 78;
// indent-tabs-mode: nil
// c-basic-offset: 4
// buffer-file-coding-system: utf-8-unix
// compile-command: "make -k -C .. 2>&1 | sed -e 's/\\/x\\//x:\\//g'";
// End:
|