FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
codon/stdlib/algorithms/strings.codon at develop · strider4560/codon · GitHub
strider4560
/
codon
Public
forked from
exaloop/codon
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
codon
/
stdlib
/
algorithms
/
strings.codon
Copy path
More file actions
More file actions
Latest commit
History
History
History
393 lines (333 loc) · 11.8 KB
Breadcrumbs
codon
/
stdlib
/
algorithms
/
strings.codon
Copy path
File metadata and controls
393 lines (333 loc) · 11.8 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
# Copyright (C) 2022-2026 Exaloop Inc. <https://exaloop.io>
# Implementation of vectorized Rabin-Karp string search.
# See http://0x80.pl/articles/simd-strfind.html for
# details. These implementations are modified to not
# perform any out-of-bounds memory accesses.
@
pure
@
llvm
def
cttz
(
n
:
UInt
[
N
],
N
:
Literal
[
int
])
->
UInt
[
N
]:
declare
i
{
=
N
} @
llvm
.
cttz
.
i
{
=
N
}(
i
{
=
N
},
i1
)
%
0
=
call
i
{
=
N
} @
llvm
.
cttz
.
i
{
=
N
}(
i
{
=
N
}
%
n
,
i1
true
)
ret
i
{
=
N
}
%
0
@
pure
@
llvm
def
ctlz
(
n
:
UInt
[
N
],
N
:
Literal
[
int
])
->
UInt
[
N
]:
declare
i
{
=
N
} @
llvm
.
ctlz
.
i
{
=
N
}(
i
{
=
N
},
i1
)
%
0
=
call
i
{
=
N
} @
llvm
.
ctlz
.
i
{
=
N
}(
i
{
=
N
}
%
n
,
i1
true
)
ret
i
{
=
N
}
%
0
@
pure
@
llvm
def
forward_mask
(
s
:
Ptr
[
byte
],
n
:
int
,
needle
:
Ptr
[
byte
],
k
:
int
,
i
:
int
,
firstb
:
byte
,
lastb
:
byte
)
->
u16
:
%
first0
=
insertelement
<
16
x
i8
>
undef
,
i8
%
firstb
,
i64
0
%
first
=
shufflevector
<
16
x
i8
>
%
first0
,
<
16
x
i8
>
poison
,
<
16
x
i32
>
zeroinitializer
%
last0
=
insertelement
<
16
x
i8
>
undef
,
i8
%
lastb
,
i64
0
%
last
=
shufflevector
<
16
x
i8
>
%
last0
,
<
16
x
i8
>
poison
,
<
16
x
i32
>
zeroinitializer
%
offset0
=
add
i64
%
i
,
%
k
%
offset
=
sub
i64
%
offset0
,
1
%
ptr_first
=
getelementptr
inbounds
i8
,
ptr
%
s
,
i64
%
i
%
ptr_last
=
getelementptr
inbounds
i8
,
ptr
%
s
,
i64
%
offset
%
block_first
=
load
<
16
x
i8
>
,
ptr
%
ptr_first
,
align
1
%
block_last
=
load
<
16
x
i8
>
,
ptr
%
ptr_last
,
align
1
%
eq_first
=
icmp
eq
<
16
x
i8
>
%
first
,
%
block_first
%
eq_last
=
icmp
eq
<
16
x
i8
>
%
last
,
%
block_last
%
mask0
=
and
<
16
x
i1
>
%
eq_first
,
%
eq_last
%
mask
=
bitcast
<
16
x
i1
>
%
mask0
to
i16
ret
i16
%
mask
@
pure
@
llvm
def
backward_mask
(
s
:
Ptr
[
byte
],
n
:
int
,
needle
:
Ptr
[
byte
],
k
:
int
,
i
:
int
,
firstb
:
byte
,
lastb
:
byte
)
->
u16
:
%
j0
=
sub
i64
%
i
,
16
%
j
=
add
i64
%
j0
,
1
%
first0
=
insertelement
<
16
x
i8
>
undef
,
i8
%
firstb
,
i64
0
%
first
=
shufflevector
<
16
x
i8
>
%
first0
,
<
16
x
i8
>
poison
,
<
16
x
i32
>
zeroinitializer
%
last0
=
insertelement
<
16
x
i8
>
undef
,
i8
%
lastb
,
i64
0
%
last
=
shufflevector
<
16
x
i8
>
%
last0
,
<
16
x
i8
>
poison
,
<
16
x
i32
>
zeroinitializer
%
offset0
=
sub
i64
%
j
,
%
k
%
offset
=
add
i64
%
offset0
,
1
%
ptr_first
=
getelementptr
inbounds
i8
,
ptr
%
s
,
i64
%
offset
%
ptr_last
=
getelementptr
inbounds
i8
,
ptr
%
s
,
i64
%
j
%
block_first
=
load
<
16
x
i8
>
,
ptr
%
ptr_first
,
align
1
%
block_last
=
load
<
16
x
i8
>
,
ptr
%
ptr_last
,
align
1
%
eq_first
=
icmp
eq
<
16
x
i8
>
%
last
,
%
block_last
%
eq_last
=
icmp
eq
<
16
x
i8
>
%
first
,
%
block_first
%
mask0
=
and
<
16
x
i1
>
%
eq_first
,
%
eq_last
%
mask
=
bitcast
<
16
x
i1
>
%
mask0
to
i16
ret
i16
%
mask
def
forward_find
(
s
:
Ptr
[
byte
],
n
:
int
,
needle
:
Ptr
[
byte
],
k
:
int
):
if
k
==
0
:
return
0
if
n
<
k
:
return
-
1
if
k
==
1
:
p
=
_C
.
memchr
(
s
,
i32
(
int
(
needle
[
0
])),
n
)
return
p
-
s
if
p
else
-
1
firstb
=
needle
[
0
]
lastb
=
needle
[
k
-
1
]
i
=
0
while
i
+
k
+
16
-
1
<=
n
:
mask
=
forward_mask
(
s
,
n
,
needle
,
k
,
i
,
firstb
,
lastb
)
while
mask
:
bitpos
=
int
(
cttz
(
mask
))
if
_C
.
memcmp
(
s
+
i
+
bitpos
+
1
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
i
+
bitpos
mask
=
mask
&
(
mask
-
u16
(
1
))
i
+=
16
# unrolled by hand
while
True
:
j
=
i
+
0
if
j
+
k
<=
n
:
if
firstb
==
s
[
j
]
and
lastb
==
s
[
j
+
k
-
1
]
and
_C
.
memcmp
(
s
+
j
+
1
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
else
:
break
j
=
i
+
1
if
j
+
k
<=
n
:
if
firstb
==
s
[
j
]
and
lastb
==
s
[
j
+
k
-
1
]
and
_C
.
memcmp
(
s
+
j
+
1
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
else
:
break
j
=
i
+
2
if
j
+
k
<=
n
:
if
firstb
==
s
[
j
]
and
lastb
==
s
[
j
+
k
-
1
]
and
_C
.
memcmp
(
s
+
j
+
1
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
else
:
break
j
=
i
+
3
if
j
+
k
<=
n
:
if
firstb
==
s
[
j
]
and
lastb
==
s
[
j
+
k
-
1
]
and
_C
.
memcmp
(
s
+
j
+
1
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
else
:
break
j
=
i
+
4
if
j
+
k
<=
n
:
if
firstb
==
s
[
j
]
and
lastb
==
s
[
j
+
k
-
1
]
and
_C
.
memcmp
(
s
+
j
+
1
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
else
:
break
j
=
i
+
5
if
j
+
k
<=
n
:
if
firstb
==
s
[
j
]
and
lastb
==
s
[
j
+
k
-
1
]
and
_C
.
memcmp
(
s
+
j
+
1
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
else
:
break
j
=
i
+
6
if
j
+
k
<=
n
:
if
firstb
==
s
[
j
]
and
lastb
==
s
[
j
+
k
-
1
]
and
_C
.
memcmp
(
s
+
j
+
1
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
else
:
break
j
=
i
+
7
if
j
+
k
<=
n
:
if
firstb
==
s
[
j
]
and
lastb
==
s
[
j
+
k
-
1
]
and
_C
.
memcmp
(
s
+
j
+
1
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
else
:
break
j
=
i
+
8
if
j
+
k
<=
n
:
if
firstb
==
s
[
j
]
and
lastb
==
s
[
j
+
k
-
1
]
and
_C
.
memcmp
(
s
+
j
+
1
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
else
:
break
j
=
i
+
9
if
j
+
k
<=
n
:
if
firstb
==
s
[
j
]
and
lastb
==
s
[
j
+
k
-
1
]
and
_C
.
memcmp
(
s
+
j
+
1
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
else
:
break
j
=
i
+
10
if
j
+
k
<=
n
:
if
firstb
==
s
[
j
]
and
lastb
==
s
[
j
+
k
-
1
]
and
_C
.
memcmp
(
s
+
j
+
1
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
else
:
break
j
=
i
+
11
if
j
+
k
<=
n
:
if
firstb
==
s
[
j
]
and
lastb
==
s
[
j
+
k
-
1
]
and
_C
.
memcmp
(
s
+
j
+
1
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
else
:
break
j
=
i
+
12
if
j
+
k
<=
n
:
if
firstb
==
s
[
j
]
and
lastb
==
s
[
j
+
k
-
1
]
and
_C
.
memcmp
(
s
+
j
+
1
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
else
:
break
j
=
i
+
13
if
j
+
k
<=
n
:
if
firstb
==
s
[
j
]
and
lastb
==
s
[
j
+
k
-
1
]
and
_C
.
memcmp
(
s
+
j
+
1
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
else
:
break
j
=
i
+
14
if
j
+
k
<=
n
:
if
firstb
==
s
[
j
]
and
lastb
==
s
[
j
+
k
-
1
]
and
_C
.
memcmp
(
s
+
j
+
1
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
else
:
break
j
=
i
+
15
if
j
+
k
<=
n
:
if
firstb
==
s
[
j
]
and
lastb
==
s
[
j
+
k
-
1
]
and
_C
.
memcmp
(
s
+
j
+
1
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
else
:
break
break
return
-
1
def
backward_find
(
s
:
Ptr
[
byte
],
n
:
int
,
needle
:
Ptr
[
byte
],
k
:
int
):
if
k
==
0
:
return
n
if
n
<
k
:
return
-
1
if
k
==
1
:
i
=
n
-
1
while
i
>=
0
:
if
s
[
i
]
==
needle
[
0
]:
return
i
i
-=
1
return
-
1
firstb
=
needle
[
0
]
lastb
=
needle
[
k
-
1
]
i
=
n
-
1
while
i
-
(
k
-
1
)
-
(
16
-
1
)
>=
0
:
mask
=
backward_mask
(
s
,
n
,
needle
,
k
,
i
,
firstb
,
lastb
)
while
mask
:
bitpos
=
int
(
ctlz
(
mask
))
if
_C
.
memcmp
(
s
+
i
-
(
k
-
1
)
-
bitpos
+
1
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
i
-
(
k
-
1
)
-
bitpos
mask
&=
~
(
u16
(
1
)
<<
u16
(
16
-
1
-
bitpos
))
i
-=
16
# unrolled by hand
while
True
:
j
=
i
-
0
if
j
-
k
+
1
>=
0
:
if
lastb
==
s
[
j
]
and
firstb
==
s
[
j
-
k
+
1
]
and
_C
.
memcmp
(
s
+
j
-
k
+
2
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
-
k
+
1
else
:
break
j
=
i
-
1
if
j
-
k
+
1
>=
0
:
if
lastb
==
s
[
j
]
and
firstb
==
s
[
j
-
k
+
1
]
and
_C
.
memcmp
(
s
+
j
-
k
+
2
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
-
k
+
1
else
:
break
j
=
i
-
2
if
j
-
k
+
1
>=
0
:
if
lastb
==
s
[
j
]
and
firstb
==
s
[
j
-
k
+
1
]
and
_C
.
memcmp
(
s
+
j
-
k
+
2
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
-
k
+
1
else
:
break
j
=
i
-
3
if
j
-
k
+
1
>=
0
:
if
lastb
==
s
[
j
]
and
firstb
==
s
[
j
-
k
+
1
]
and
_C
.
memcmp
(
s
+
j
-
k
+
2
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
-
k
+
1
else
:
break
j
=
i
-
4
if
j
-
k
+
1
>=
0
:
if
lastb
==
s
[
j
]
and
firstb
==
s
[
j
-
k
+
1
]
and
_C
.
memcmp
(
s
+
j
-
k
+
2
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
-
k
+
1
else
:
break
j
=
i
-
5
if
j
-
k
+
1
>=
0
:
if
lastb
==
s
[
j
]
and
firstb
==
s
[
j
-
k
+
1
]
and
_C
.
memcmp
(
s
+
j
-
k
+
2
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
-
k
+
1
else
:
break
j
=
i
-
6
if
j
-
k
+
1
>=
0
:
if
lastb
==
s
[
j
]
and
firstb
==
s
[
j
-
k
+
1
]
and
_C
.
memcmp
(
s
+
j
-
k
+
2
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
-
k
+
1
else
:
break
j
=
i
-
7
if
j
-
k
+
1
>=
0
:
if
lastb
==
s
[
j
]
and
firstb
==
s
[
j
-
k
+
1
]
and
_C
.
memcmp
(
s
+
j
-
k
+
2
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
-
k
+
1
else
:
break
j
=
i
-
8
if
j
-
k
+
1
>=
0
:
if
lastb
==
s
[
j
]
and
firstb
==
s
[
j
-
k
+
1
]
and
_C
.
memcmp
(
s
+
j
-
k
+
2
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
-
k
+
1
else
:
break
j
=
i
-
9
if
j
-
k
+
1
>=
0
:
if
lastb
==
s
[
j
]
and
firstb
==
s
[
j
-
k
+
1
]
and
_C
.
memcmp
(
s
+
j
-
k
+
2
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
-
k
+
1
else
:
break
j
=
i
+
10
if
j
-
k
+
1
>=
0
:
if
lastb
==
s
[
j
]
and
firstb
==
s
[
j
-
k
+
1
]
and
_C
.
memcmp
(
s
+
j
-
k
+
2
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
-
k
+
1
else
:
break
j
=
i
-
11
if
j
-
k
+
1
>=
0
:
if
lastb
==
s
[
j
]
and
firstb
==
s
[
j
-
k
+
1
]
and
_C
.
memcmp
(
s
+
j
-
k
+
2
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
-
k
+
1
else
:
break
j
=
i
-
12
if
j
-
k
+
1
>=
0
:
if
lastb
==
s
[
j
]
and
firstb
==
s
[
j
-
k
+
1
]
and
_C
.
memcmp
(
s
+
j
-
k
+
2
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
-
k
+
1
else
:
break
j
=
i
-
13
if
j
-
k
+
1
>=
0
:
if
lastb
==
s
[
j
]
and
firstb
==
s
[
j
-
k
+
1
]
and
_C
.
memcmp
(
s
+
j
-
k
+
2
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
-
k
+
1
else
:
break
j
=
i
-
14
if
j
-
k
+
1
>=
0
:
if
lastb
==
s
[
j
]
and
firstb
==
s
[
j
-
k
+
1
]
and
_C
.
memcmp
(
s
+
j
-
k
+
2
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
-
k
+
1
else
:
break
j
=
i
-
15
if
j
-
k
+
1
>=
0
:
if
lastb
==
s
[
j
]
and
firstb
==
s
[
j
-
k
+
1
]
and
_C
.
memcmp
(
s
+
j
-
k
+
2
,
needle
+
1
,
k
-
2
)
==
i32
(
0
):
return
j
-
k
+
1
else
:
break
break
return
-
1
def
find
(
haystack
:
str
,
needle
:
str
):
return
forward_find
(
haystack
.
ptr
,
haystack
.
len
,
needle
.
ptr
,
needle
.
len
)
def
rfind
(
haystack
:
str
,
needle
:
str
):
return
backward_find
(
haystack
.
ptr
,
haystack
.
len
,
needle
.
ptr
,
needle
.
len
)
def
count
(
haystack
:
str
,
needle
:
str
):
occ
=
0
tmp
=
haystack
.
ptr
n
=
haystack
.
len
k
=
needle
.
len
if
k
==
0
:
return
n
+
1
while
True
:
pos
=
forward_find
(
tmp
,
n
-
(
tmp
-
haystack
.
ptr
),
needle
.
ptr
,
k
)
if
pos
==
-
1
:
break
tmp
+=
pos
+
k
occ
+=
1
return
occ
def
count_with_max
(
haystack
:
str
,
needle
:
str
,
maxcount
:
int
):
occ
=
0
tmp
=
haystack
.
ptr
n
=
haystack
.
len
k
=
needle
.
len
if
maxcount
==
0
:
return
0
if
k
==
0
:
return
n
+
1
if
n
+
1
<
maxcount
else
maxcount
while
True
:
pos
=
forward_find
(
tmp
,
n
-
(
tmp
-
haystack
.
ptr
),
needle
.
ptr
,
k
)
if
pos
==
-
1
:
break
tmp
+=
pos
+
k
occ
+=
1
if
occ
==
maxcount
:
return
occ
return
occ
Back
|
FazBrowse Home
|
New Git URL