This repository was archived by the owner on Jan 8, 2025. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy path061text.mu
More file actions
1427 lines (1340 loc) · 30 KB
/
061text.mu
File metadata and controls
1427 lines (1340 loc) · 30 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
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
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
# Some useful helpers for dealing with text (arrays of characters)
def equal a:text, b:text -> result:bool [
local-scope
load-inputs
an:num, bn:num <- deaddress a, b
address-equal?:boolean <- equal an, bn
return-if address-equal?, true
return-unless a, false
return-unless b, false
a-len:num <- length *a
b-len:num <- length *b
# compare lengths
trace 99, [text-equal], [comparing lengths]
length-equal?:bool <- equal a-len, b-len
return-unless length-equal?, false
# compare each corresponding character
trace 99, [text-equal], [comparing characters]
i:num <- copy 0
{
done?:bool <- greater-or-equal i, a-len
break-if done?
a2:char <- index *a, i
b2:char <- index *b, i
chars-match?:bool <- equal a2, b2
return-unless chars-match?, false
i <- add i, 1
loop
}
return true
]
scenario text-equal-reflexive [
local-scope
x:text <- new [abc]
run [
10:bool/raw <- equal x, x
]
memory-should-contain [
10 <- 1 # x == x for all x
]
]
scenario text-equal-identical [
local-scope
x:text <- new [abc]
y:text <- new [abc]
run [
10:bool/raw <- equal x, y
]
memory-should-contain [
10 <- 1 # abc == abc
]
]
scenario text-equal-distinct-lengths [
local-scope
x:text <- new [abc]
y:text <- new [abcd]
run [
10:bool/raw <- equal x, y
]
memory-should-contain [
10 <- 0 # abc != abcd
]
trace-should-contain [
text-equal: comparing lengths
]
trace-should-not-contain [
text-equal: comparing characters
]
]
scenario text-equal-with-empty [
local-scope
x:text <- new []
y:text <- new [abcd]
run [
10:bool/raw <- equal x, y
]
memory-should-contain [
10 <- 0 # "" != abcd
]
]
scenario text-equal-with-null [
local-scope
x:text <- new [abcd]
y:text <- copy null
run [
10:bool/raw <- equal x, null
11:bool/raw <- equal null, x
12:bool/raw <- equal x, y
13:bool/raw <- equal y, x
14:bool/raw <- equal y, y
]
memory-should-contain [
10 <- 0
11 <- 0
12 <- 0
13 <- 0
14 <- 1
]
check-trace-count-for-label 0, [error]
]
scenario text-equal-common-lengths-but-distinct [
local-scope
x:text <- new [abc]
y:text <- new [abd]
run [
10:bool/raw <- equal x, y
]
memory-should-contain [
10 <- 0 # abc != abd
]
]
# A new type to help incrementally construct texts.
container buffer:_elem [
length:num
data:&:@:_elem
]
def new-buffer capacity:num -> result:&:buffer:_elem [
local-scope
load-inputs
result <- new {(buffer _elem): type}
*result <- put *result, length:offset, 0
{
break-if capacity
# capacity not provided
capacity <- copy 10
}
data:&:@:_elem <- new _elem:type, capacity
*result <- put *result, data:offset, data
return result
]
def grow-buffer buf:&:buffer:_elem -> buf:&:buffer:_elem [
local-scope
load-inputs
# double buffer size
olddata:&:@:_elem <- get *buf, data:offset
oldlen:num <- length *olddata
newlen:num <- multiply oldlen, 2
newdata:&:@:_elem <- new _elem:type, newlen
*buf <- put *buf, data:offset, newdata
# copy old contents
i:num <- copy 0
{
done?:bool <- greater-or-equal i, oldlen
break-if done?
src:_elem <- index *olddata, i
*newdata <- put-index *newdata, i, src
i <- add i, 1
loop
}
]
def buffer-full? in:&:buffer:_elem -> result:bool [
local-scope
load-inputs
len:num <- get *in, length:offset
s:&:@:_elem <- get *in, data:offset
capacity:num <- length *s
result <- greater-or-equal len, capacity
]
# most broadly applicable definition of append to a buffer
def append buf:&:buffer:_elem, x:_elem -> buf:&:buffer:_elem [
local-scope
load-inputs
len:num <- get *buf, length:offset
{
# grow buffer if necessary
full?:bool <- buffer-full? buf
break-unless full?
buf <- grow-buffer buf
}
s:&:@:_elem <- get *buf, data:offset
*s <- put-index *s, len, x
len <- add len, 1
*buf <- put *buf, length:offset, len
]
# most broadly applicable definition of append to a buffer of characters: just
# call to-text
def append buf:&:buffer:char, x:_elem -> buf:&:buffer:char [
local-scope
load-inputs
text:text <- to-text x
buf <- append buf, text
]
# specialization for characters that is backspace-aware
def append buf:&:buffer:char, c:char -> buf:&:buffer:char [
local-scope
load-inputs
len:num <- get *buf, length:offset
{
# backspace? just drop last character if it exists and return
backspace?:bool <- equal c, 8/backspace
break-unless backspace?
empty?:bool <- lesser-or-equal len, 0
return-if empty?
len <- subtract len, 1
*buf <- put *buf, length:offset, len
return
}
{
# grow buffer if necessary
full?:bool <- buffer-full? buf
break-unless full?
buf <- grow-buffer buf
}
s:text <- get *buf, data:offset
*s <- put-index *s, len, c
len <- add len, 1
*buf <- put *buf, length:offset, len
]
def append buf:&:buffer:_elem, t:&:@:_elem -> buf:&:buffer:_elem [
local-scope
load-inputs
len:num <- length *t
i:num <- copy 0
{
done?:bool <- greater-or-equal i, len
break-if done?
x:_elem <- index *t, i
buf <- append buf, x
i <- add i, 1
loop
}
]
scenario append-to-empty-buffer [
local-scope
x:&:buffer:char <- new-buffer
run [
c:char <- copy 97/a
x <- append x, c
10:num/raw <- get *x, length:offset
s:text <- get *x, data:offset
11:char/raw <- index *s, 0
12:char/raw <- index *s, 1
]
memory-should-contain [
10 <- 1 # buffer length
11 <- 97 # a
12 <- 0 # rest of buffer is empty
]
]
scenario append-to-buffer [
local-scope
x:&:buffer:char <- new-buffer
c:char <- copy 97/a
x <- append x, c
run [
c <- copy 98/b
x <- append x, c
10:num/raw <- get *x, length:offset
s:text <- get *x, data:offset
11:char/raw <- index *s, 0
12:char/raw <- index *s, 1
13:char/raw <- index *s, 2
]
memory-should-contain [
10 <- 2 # buffer length
11 <- 97 # a
12 <- 98 # b
13 <- 0 # rest of buffer is empty
]
]
scenario append-grows-buffer [
local-scope
x:&:buffer:char <- new-buffer 3
s1:text <- get *x, data:offset
x <- append x, [abc] # buffer is now full
s2:text <- get *x, data:offset
run [
10:bool/raw <- equal s1, s2
11:@:char/raw <- copy *s2
+buffer-filled
c:char <- copy 100/d
x <- append x, c
s3:text <- get *x, data:offset
20:bool/raw <- equal s1, s3
21:num/raw <- get *x, length:offset
30:@:char/raw <- copy *s3
]
memory-should-contain [
# before +buffer-filled
10 <- 1 # no change in data pointer after original append
11 <- 3 # size of data
12 <- 97 # data
13 <- 98
14 <- 99
# in the end
20 <- 0 # data pointer has grown after second append
21 <- 4 # final length
30 <- 6 # but data's capacity has doubled
31 <- 97 # data
32 <- 98
33 <- 99
34 <- 100
35 <- 0
36 <- 0
]
]
scenario buffer-append-handles-backspace [
local-scope
x:&:buffer:char <- new-buffer
x <- append x, [ab]
run [
c:char <- copy 8/backspace
x <- append x, c
s:text <- buffer-to-array x
10:@:char/raw <- copy *s
]
memory-should-contain [
10 <- 1 # length
11 <- 97 # contents
12 <- 0
]
]
scenario append-to-buffer-of-non-characters [
local-scope
x:&:buffer:text <- new-buffer 1/capacity
# no errors
]
def buffer-to-array in:&:buffer:_elem -> result:&:@:_elem [
local-scope
load-inputs
# propagate null buffer
return-unless in, null
len:num <- get *in, length:offset
s:&:@:_elem <- get *in, data:offset
# we can't just return s because it is usually the wrong length
result <- new _elem:type, len
i:num <- copy 0
{
done?:bool <- greater-or-equal i, len
break-if done?
src:_elem <- index *s, i
*result <- put-index *result, i, src
i <- add i, 1
loop
}
]
def blank? x:&:@:_elem -> result:bool [
local-scope
load-inputs
return-unless x, true
len:num <- length *x
result <- equal len, 0
]
# Append any number of texts together.
# A later layer also translates calls to this to implicitly call to-text, so
# append to string becomes effectively dynamically typed.
#
# Beware though: this hack restricts how much 'append' can be overridden. Any
# new variants that match:
# append _:text, ___
# will never ever get used.
def append first:text -> result:text [
local-scope
load-inputs
buf:&:buffer:char <- new-buffer 30
# append first input
{
break-unless first
buf <- append buf, first
}
# append remaining inputs
{
arg:text, arg-found?:bool <- next-input
break-unless arg-found?
loop-unless arg
buf <- append buf, arg
loop
}
result <- buffer-to-array buf
]
scenario text-append-1 [
local-scope
x:text <- new [hello,]
y:text <- new [ world!]
run [
z:text <- append x, y
10:@:char/raw <- copy *z
]
memory-should-contain [
10:array:character <- [hello, world!]
]
]
scenario text-append-null [
local-scope
x:text <- copy null
y:text <- new [ world!]
run [
z:text <- append x, y
10:@:char/raw <- copy *z
]
memory-should-contain [
10:array:character <- [ world!]
]
]
scenario text-append-null-2 [
local-scope
x:text <- new [hello,]
y:text <- copy null
run [
z:text <- append x, y
10:@:char/raw <- copy *z
]
memory-should-contain [
10:array:character <- [hello,]
]
]
scenario text-append-multiary [
local-scope
x:text <- new [hello, ]
y:text <- new [world]
z:text <- new [!]
run [
z:text <- append x, y, z
10:@:char/raw <- copy *z
]
memory-should-contain [
10:array:character <- [hello, world!]
]
]
scenario replace-character-in-text [
local-scope
x:text <- new [abc]
run [
x <- replace x, 98/b, 122/z
10:@:char/raw <- copy *x
]
memory-should-contain [
10:array:character <- [azc]
]
]
def replace s:text, oldc:char, newc:char, from:num/optional -> s:text [
local-scope
load-inputs
len:num <- length *s
i:num <- find-next s, oldc, from
done?:bool <- greater-or-equal i, len
return-if done?
*s <- put-index *s, i, newc
i <- add i, 1
s <- replace s, oldc, newc, i
]
scenario replace-character-at-start [
local-scope
x:text <- new [abc]
run [
x <- replace x, 97/a, 122/z
10:@:char/raw <- copy *x
]
memory-should-contain [
10:array:character <- [zbc]
]
]
scenario replace-character-at-end [
local-scope
x:text <- new [abc]
run [
x <- replace x, 99/c, 122/z
10:@:char/raw <- copy *x
]
memory-should-contain [
10:array:character <- [abz]
]
]
scenario replace-character-missing [
local-scope
x:text <- new [abc]
run [
x <- replace x, 100/d, 122/z
10:@:char/raw <- copy *x
]
memory-should-contain [
10:array:character <- [abc]
]
]
scenario replace-all-characters [
local-scope
x:text <- new [banana]
run [
x <- replace x, 97/a, 122/z
10:@:char/raw <- copy *x
]
memory-should-contain [
10:array:character <- [bznznz]
]
]
# replace underscores in first with remaining args
def interpolate template:text -> result:text [
local-scope
load-inputs # consume just the template
# compute result-len, space to allocate for result
tem-len:num <- length *template
result-len:num <- copy tem-len
{
# while inputs remain
a:text, arg-received?:bool <- next-input
break-unless arg-received?
# result-len = result-len + arg.length - 1 (for the 'underscore' being replaced)
a-len:num <- length *a
result-len <- add result-len, a-len
result-len <- subtract result-len, 1
loop
}
rewind-inputs
_ <- next-input # skip template
result <- new character:type, result-len
# repeatedly copy sections of template and 'holes' into result
result-idx:num <- copy 0
i:num <- copy 0
{
# while arg received
a:text, arg-received?:bool <- next-input
break-unless arg-received?
# copy template into result until '_'
{
# while i < template.length
tem-done?:bool <- greater-or-equal i, tem-len
break-if tem-done?, +done
# while template[i] != '_'
in:char <- index *template, i
underscore?:bool <- equal in, 95/_
break-if underscore?
# result[result-idx] = template[i]
*result <- put-index *result, result-idx, in
i <- add i, 1
result-idx <- add result-idx, 1
loop
}
# copy 'a' into result
j:num <- copy 0
{
# while j < a.length
arg-done?:bool <- greater-or-equal j, a-len
break-if arg-done?
# result[result-idx] = a[j]
in:char <- index *a, j
*result <- put-index *result, result-idx, in
j <- add j, 1
result-idx <- add result-idx, 1
loop
}
# skip '_' in template
i <- add i, 1
loop # interpolate next arg
}
+done
# done with holes; copy rest of template directly into result
{
# while i < template.length
tem-done?:bool <- greater-or-equal i, tem-len
break-if tem-done?
# result[result-idx] = template[i]
in:char <- index *template, i
*result <- put-index *result, result-idx, in
i <- add i, 1
result-idx <- add result-idx, 1
loop
}
]
scenario interpolate-works [
local-scope
x:text <- new [abc_ghi]
y:text <- new [def]
run [
z:text <- interpolate x, y
10:@:char/raw <- copy *z
]
memory-should-contain [
10:array:character <- [abcdefghi]
]
]
scenario interpolate-at-start [
local-scope
x:text <- new [_, hello!]
y:text <- new [abc]
run [
z:text <- interpolate x, y
10:@:char/raw <- copy *z
]
memory-should-contain [
10:array:character <- [abc, hello!]
22 <- 0 # out of bounds
]
]
scenario interpolate-at-end [
local-scope
x:text <- new [hello, _]
y:text <- new [abc]
run [
z:text <- interpolate x, y
10:@:char/raw <- copy *z
]
memory-should-contain [
10:array:character <- [hello, abc]
]
]
# result:bool <- space? c:char
def space? c:char -> result:bool [
local-scope
load-inputs
# most common case first
result <- equal c, 32/space
return-if result
result <- equal c, 10/newline
return-if result
result <- equal c, 9/tab
return-if result
result <- equal c, 13/carriage-return
return-if result
# remaining uncommon cases in sorted order
# http://unicode.org code-points in unicode-set Z and Pattern_White_Space
result <- equal c, 11/ctrl-k
return-if result
result <- equal c, 12/ctrl-l
return-if result
result <- equal c, 133/ctrl-0085
return-if result
result <- equal c, 160/no-break-space
return-if result
result <- equal c, 5760/ogham-space-mark
return-if result
result <- equal c, 8192/en-quad
return-if result
result <- equal c, 8193/em-quad
return-if result
result <- equal c, 8194/en-space
return-if result
result <- equal c, 8195/em-space
return-if result
result <- equal c, 8196/three-per-em-space
return-if result
result <- equal c, 8197/four-per-em-space
return-if result
result <- equal c, 8198/six-per-em-space
return-if result
result <- equal c, 8199/figure-space
return-if result
result <- equal c, 8200/punctuation-space
return-if result
result <- equal c, 8201/thin-space
return-if result
result <- equal c, 8202/hair-space
return-if result
result <- equal c, 8206/left-to-right
return-if result
result <- equal c, 8207/right-to-left
return-if result
result <- equal c, 8232/line-separator
return-if result
result <- equal c, 8233/paragraph-separator
return-if result
result <- equal c, 8239/narrow-no-break-space
return-if result
result <- equal c, 8287/medium-mathematical-space
return-if result
result <- equal c, 12288/ideographic-space
]
def trim s:text -> result:text [
local-scope
load-inputs
len:num <- length *s
# left trim: compute start
start:num <- copy 0
{
{
at-end?:bool <- greater-or-equal start, len
break-unless at-end?
result <- new character:type, 0
return
}
curr:char <- index *s, start
whitespace?:bool <- space? curr
break-unless whitespace?
start <- add start, 1
loop
}
# right trim: compute end
end:num <- subtract len, 1
{
not-at-start?:bool <- greater-than end, start
assert not-at-start?, [end ran up against start]
curr:char <- index *s, end
whitespace?:bool <- space? curr
break-unless whitespace?
end <- subtract end, 1
loop
}
# result = new character[end+1 - start]
new-len:num <- subtract end, start, -1
result:text <- new character:type, new-len
# copy the untrimmed parts between start and end
i:num <- copy start
j:num <- copy 0
{
# while i <= end
done?:bool <- greater-than i, end
break-if done?
# result[j] = s[i]
src:char <- index *s, i
*result <- put-index *result, j, src
i <- add i, 1
j <- add j, 1
loop
}
]
scenario trim-unmodified [
local-scope
x:text <- new [abc]
run [
y:text <- trim x
1:@:char/raw <- copy *y
]
memory-should-contain [
1:array:character <- [abc]
]
]
scenario trim-left [
local-scope
x:text <- new [ abc]
run [
y:text <- trim x
1:@:char/raw <- copy *y
]
memory-should-contain [
1:array:character <- [abc]
]
]
scenario trim-right [
local-scope
x:text <- new [abc ]
run [
y:text <- trim x
1:@:char/raw <- copy *y
]
memory-should-contain [
1:array:character <- [abc]
]
]
scenario trim-left-right [
local-scope
x:text <- new [ abc ]
run [
y:text <- trim x
1:@:char/raw <- copy *y
]
memory-should-contain [
1:array:character <- [abc]
]
]
scenario trim-newline-tab [
local-scope
x:text <- new [ abc
]
run [
y:text <- trim x
1:@:char/raw <- copy *y
]
memory-should-contain [
1:array:character <- [abc]
]
]
def find-next text:text, pattern:char, idx:num -> next-index:num [
local-scope
load-inputs
len:num <- length *text
{
eof?:bool <- greater-or-equal idx, len
break-if eof?
curr:char <- index *text, idx
found?:bool <- equal curr, pattern
break-if found?
idx <- add idx, 1
loop
}
return idx
]
scenario text-find-next [
local-scope
x:text <- new [a/b]
run [
10:num/raw <- find-next x, 47/slash, 0/start-index
]
memory-should-contain [
10 <- 1
]
]
scenario text-find-next-empty [
local-scope
x:text <- new []
run [
10:num/raw <- find-next x, 47/slash, 0/start-index
]
memory-should-contain [
10 <- 0
]
]
scenario text-find-next-initial [
local-scope
x:text <- new [/abc]
run [
10:num/raw <- find-next x, 47/slash, 0/start-index
]
memory-should-contain [
10 <- 0 # prefix match
]
]
scenario text-find-next-final [
local-scope
x:text <- new [abc/]
run [
10:num/raw <- find-next x, 47/slash, 0/start-index
]
memory-should-contain [
10 <- 3 # suffix match
]
]
scenario text-find-next-missing [
local-scope
x:text <- new [abcd]
run [
10:num/raw <- find-next x, 47/slash, 0/start-index
]
memory-should-contain [
10 <- 4 # no match
]
]
scenario text-find-next-invalid-index [
local-scope
x:text <- new [abc]
run [
10:num/raw <- find-next x, 47/slash, 4/start-index
]
memory-should-contain [
10 <- 4 # no change
]
]
scenario text-find-next-first [
local-scope
x:text <- new [ab/c/]
run [
10:num/raw <- find-next x, 47/slash, 0/start-index
]
memory-should-contain [
10 <- 2 # first '/' of multiple
]
]
scenario text-find-next-second [
local-scope
x:text <- new [ab/c/]
run [
10:num/raw <- find-next x, 47/slash, 3/start-index
]
memory-should-contain [
10 <- 4 # second '/' of multiple
]
]
# search for a pattern of multiple characters
# fairly dumb algorithm
def find-next text:text, pattern:text, idx:num -> next-index:num [
local-scope
load-inputs
first:char <- index *pattern, 0
# repeatedly check for match at current idx
len:num <- length *text
{
# does some unnecessary work checking even when there isn't enough of text left
done?:bool <- greater-or-equal idx, len
break-if done?
found?:bool <- match-at text, pattern, idx
break-if found?
idx <- add idx, 1
# optimization: skip past indices that definitely won't match
idx <- find-next text, first, idx
loop
}
return idx
]
scenario find-next-text-1 [
local-scope
x:text <- new [abc]
y:text <- new [bc]
run [
10:num/raw <- find-next x, y, 0
]
memory-should-contain [
10 <- 1
]
]
scenario find-next-text-2 [
local-scope
x:text <- new [abcd]
y:text <- new [bc]
run [
10:num/raw <- find-next x, y, 1
]
memory-should-contain [
10 <- 1
]
]
scenario find-next-no-match [
local-scope
x:text <- new [abc]
y:text <- new [bd]
run [
10:num/raw <- find-next x, y, 0
]
memory-should-contain [
10 <- 3 # not found
]
]
scenario find-next-suffix-match [
local-scope
x:text <- new [abcd]
y:text <- new [cd]
run [
10:num/raw <- find-next x, y, 0
]
memory-should-contain [
10 <- 2
]
]
scenario find-next-suffix-match-2 [
local-scope
x:text <- new [abcd]
y:text <- new [cde]
run [
10:num/raw <- find-next x, y, 0
]
memory-should-contain [
10 <- 4 # not found
]
]
# checks if pattern matches at index 'idx'
def match-at text:text, pattern:text, idx:num -> result:bool [
local-scope
load-inputs
pattern-len:num <- length *pattern
# check that there's space left for the pattern
x:num <- length *text
x <- subtract x, pattern-len
enough-room?:bool <- lesser-or-equal idx, x
return-unless enough-room?, false/not-found