This repository has been archived by the owner on Dec 22, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
throffbootstrap.go
1773 lines (1187 loc) · 30.8 KB
/
throffbootstrap.go
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
package throfflib
func BootStrapString() string {
var str string
str = `
COMMENT [ ;> is the statement separator. If a reads too many arguments from the stack (or you didn't give it enough arguments), then it will throw an error. This only works for functions that use 'arg' ]
DEFINE ;> => [
WHEN NOT EQUAL next [ *> ]
[ ';> next ]
ARG next =>
]
[ arg defines a variable in the current lexical scope. Used at the end of functions, it is effectively the argument list for the function. ]
DEFINE arg => MACRO [
IF EQUAL arg_value [ ;> ]
THEN [ INTERPERROR A[ [ Invalid number of arguments. You did not provide enough arguments to the function: ] THISNAME ]A ]
ELSE ARG arg_name arg_value
ARG arg_value =>
ARG arg_name =>
]
DEFINE [] => [ [ ] ]
DEFINE ~> => [ ]
DEFINE -> => [ ]
DEFINE +> => [ ]
DEFINE *> => [ ]
DEFINE O> => [ ]
DEFINE THEN => [ ]
DEFINE ELSE => [ ]
DEFINE なら => [ ]
DEFINE そうでなければ => [ ]
DEFINE くでさい => [ IF .S ROLL 2 SWAP ]
ALIAS です => BIND TOK
ALIAS 話して => EMIT TOK
ALIAS やれ => CALL TOK
ALIAS 説明して => DEFINE TOK
TESTBLOCK [ PRINTLN [ Bootstrap complete, ready for commands ] ]
NAMETESTBLOCK [ Reverse ] [
TEST REVERSE A[ Monday Tuesday Wednesday Thursday Friday ]A A[ Friday Thursday Wednesday Tuesday Monday ]A [ Reverse Array ] ]
DEFINE REVERSE => [ FOLD [ UNSHIFTARRAY ] A[ ]A ]
DEFINE DEFINE2 => MACRO [
DEFINE NAME ->FUNC [
BIND THISFUNCTION => NAME
]
ARG ENV => GETENV
ARG FUNCTION =>
ARG NAME =>
]
DEFINE SWATCH => [
CALL/SELF [
SELF f delay
SLEEP delay
PRINTLN SHELL f
ARG delay => ARG f => ARG SELF => ]
]
DEFINE WATCH => [
CALL/SELF [
SELF f delay
SLEEP delay
PRINTLN CALL f
ARG delay => ARG f => ARG SELF => ]
]
DEFINE RECURSE => [ CALLWITHSELF ]
DEFINE CALL/SELF => [ CALLWITHSELF ]
COMMENT [ Call f with a reference to itself as the first argument. Note to self do this properly (I think I have an example in another file?) ]
DEFINE CALLWITHSELF => [ CALL f ->FUNC [ CALLWITHSELF f ] ARG f => ]
NAMETESTBLOCK [ Iota ] [
TEST IOTA 3 A[ 0 1 2 ]A [ Iota ] ]
DEFINE IOTA => [ RANGE 0 SUB1 ]
DEFINE WATCH => [ FOREVER [ PRINTLN A[ CMDSTDOUTSTDERR F ]A SLEEP N ] ARG F => ARG N => ]
DEFINE SUBSHELL => LAMBDA [
IF EQUAL OS windows [
STARTPROCESS C:\Windows\system32\cmd.exe args
PRINTLN args
BIND args => UNSHIFTARRAY /c CMD
] [
STARTPROCESS /bin/sh args
PRINTLN args
BIND args => UNSHIFTARRAY /c CMD
]
PRINTLN CMD
BIND CMD =>
]
DEFINE IFFY => [ IF TRUTHY ]
DEFINE TRUTHY => [
CASE A[
EQUAL 0 X ... FALSE
LESSTHAN X 0 ... FALSE
EQUAL FALSE X ... FALSE
NOT EQUAL 0 LENGTH X ... TRUE
DEFAULT ... TRUE
]A
ARG X =>
]
DEFINE THROW => [
ACTIVATE/CC ERRORHANDLER A[ TRUE MSG ]A
ARG MSG =>
]
DEFINE CATCH => [
IF HANDLER [
CALL ERRLAMBDA MSG
] [ ]
BIND MSG => CAR CDR RET
BIND HANDLER => CAR RET
BIND RET =>
CALL/CC [
INSTALLDYNA CC ->FUNC [ A[ FALSE AAAA AAAA ]A CALL ALAMBDA ]
ARG CC =>
]
ARG ALAMBDA =>
ARG ERRLAMBDA =>
]
BIND DEFAULT => TRUE
DEFINE CASE => [
WHEN NOT EMPTY? ARR [
IF CALL TEST [ CALL FUNC ]
[ CASE CDR CDR ARR ]
]
BIND FUNC => CAR CDR ARR
BIND TEST => CAR ARR
ARG ARR =>
]
DEFINE ... => [ ]
DEFINE EMPTY? => [ EQUAL 0 LENGTH ]
DEFINE STRING-JOIN => [
FOLD [ STRING-CONCATENATE STRING-CONCATENATE SWAP A SWAP ] CAR ARR CDR ARR
ARG ARR =>
ARG A =>
]
DEFINE CAR => [ DROP SWAP SHIFTARRAY ]
DEFINE CDR => [ DROP SHIFTARRAY ]
DEFINE STRING-CONCATENATE* => [
FOLD [ STRING-CONCATENATE ] [ ]
]
DEFINE APPEND => [
TARGET
ITERATE THIN [ REBIND TARGET => ARRAYPUSH TARGET ] SOURCE
ARG SOURCE =>
ARG TARGET =>
]
DEFINE PL => [
IF NOT EQUAL 1 X
[ STRING-CONCATENATE WORD s TOK ]
WORD
BIND WORD =>
BIND X =>
]
DEFINE REVERSE => [
NEW
ITERATE THIN [ REBIND NEW => UNSHIFTARRAY SWAP NEW ] OLD
BIND NEW => NEWARRAY
ARG OLD =>
]
DEFINE AND => [ IF EQUAL A B [ IF EQUAL A TRUE TRUE FALSE ] FALSE : B : A ]
DEFINE PROMISE => [
->FUNC [
VAL
WHEN NOT DONE
THIN [
REBIND F => FALSE
REBIND VAL => F
REBIND DONE => TRUE
]
]
ARG F =>
]
DEFINE CALLA => [
CALL [
->FUNC THIN [
VAL
WHEN NOT EQUAL DONE 1
THIN [
REBIND VAL => READQ RQ
REBIND DONE => 1
COMMENT [ DUMP RQ
PRINTLN A[ !!!!!! [ CALLA READING RETURN QUEUE ] URL !!!!!!! ]A ]
]
]
REBIND RQ => RQ
REBIND DONE => DONE
REBIND VAL => VAL
]
WRITEQ AC H[ FARG => URL RET => RQ ]H
COMMENT [ DUMP AC
PRINTLN A[ [ CALLA WRITING TO QUEUE ] URL ]A ]
BIND RQ => NEWQUEUE
BIND DONE => 0
BIND VAL => FALSE
BIND URL =>
BIND AC =>
]
DEFINE ACTORREC => [
COMMENT [ PRINTLN [ CALLED RECURSE in ACTORREC ] ]
ACTORREC
COMMENT [ PRINTLN [ CALLING RECURSE in ACTORREC ] ]
USERFUNC WQ
WRITEQ RETQ CALL USERFUNC FARG STATE
COMMENT [ DUMP RETQ
PRINTLN [ ACTOR WRITING TO QUEUE ] ]
BIND RETQ => GETHASH RET => PARAMS
BIND FARG => GETHASH FARG => PARAMS
BIND PARAMS => READQ WQ
COMMENT [ DUMP WQ
PRINTLN [ ACTOR WAITING ON QUEUE ] ]
BIND STATE =>
BIND WQ =>
BIND USERFUNC =>
COMMENT [ PRINTLN [ Recursing ACTORREC ] ]
]
DEFINE ACTOR => [
WQ
THREAD [
ACTORREC USERFUNC WQ STARTPROCESS /bin/echo [ . ]
]
BIND WQ NEWQUEUE
BIND USERFUNC =>
]
DEFINE MIME => [
->FUNC [ WRITEQ Q ]
THREAD [
FOREVER [ CALL USERFUNC READQ Q ]
]
BIND Q NEWQUEUE
BIND USERFUNC =>
]
DEFINE FOREVER => [ FOREVER CALL DUP ]
NAMETESTBLOCK [ WITH statement ] [
TEST wonkyA 1 [ WITH STATEMENT ]
WITH A[ wonkyA ]A FROM TESTHASH
BIND TESTHASH => H[ wonkyA 1 B 2 C 3 ]H
]
NAMETESTBLOCK [ WITA statment ] [
TEST c 3 [ WITA STATEMENT ]
TEST b 2 [ WITA STATEMENT ]
TEST a 1 [ WITA STATEMENT ]
WITA [ a b c ] FROM TESTARRAY
BIND TESTARRAY => A[ 1 2 3 ]A
]
DEFINE WITA => MACRO [
ITERATE THIN [
REBIND with_INDEX => ADD with_INDEX 1
BIND with_Name GETARRAY with_INDEX with_ANARRAY
REBIND with_Name =>
] with_NAMES
d binding > with_NAMES < from hash > with_ANARRAY < ;
BIND with_INDEX => 0
BIND with_N => WHOOPS
ARG with_ANARRAY =>
ARG with_FROM =>
ARG with_NAMES => ->ARRAY
]
DEFINE WITH => MACRO [
ITERATE THIN [
BIND with_N GETHASH with_N with_AHASH
REBIND with_N =>
] with_NAMES
d binding > with_NAMES < from hash > with_AHASH < ;
BIND with_N => WHOOPS
ARG with_AHASH =>
ARG with_FROM =>
ARG with_NAMES => ->ARRAY
]
DEFINE -f => [ RUNSTRING SLURPFILE SWAP ENVIRONMENTOF HERE TOK ]
DEFINE -s => [ SAFETYON ]
DEFINE SLURPFILE => [ FOLD [ STRING-CONCATENATE SWAP STRING-CONCATENATE CRLF ] ->STRING [ ] MAPFILE [ ] ]
DROP [
SEARCHBYTES ->BYTES [ HTTP ] map
ITERATE [ EMIT GETBYTE SWAP map ] RANGE 0 255
: map => MMAPFILE apache.log
]
DEFINE DUMPBYTES => [
ITERATE [ EMIT GETBYTE SWAP B ] RANGE 0 ADD -1 LENGTH B
: B =>
]
DEFINE COMPAREBYTES => [
PRINTLN DUP
returns SUCCESS
ITERATE THIN [
STATEMENT [ COMPAREBYTES INTERNAL ] [ IF EQUAL
GETBYTE I SMALLBYTES
GETBYTE ADD I INDEX LARGEBYTES
THIN [ PRINTLN [ MATCH SUCCESS ] REBIND SUCCESS => TRUE ]
THIN [ PRINTLN [ MATCH FAIL ] REBIND SUCCESS => FALSE ]
]
p Comparing bytes at I and ADD I INDEX ;
REBIND I =>
]
BIND I => -1
RANGE 0 ADD -1 LENGTH SMALLBYTES
BIND SUCCESS => WHOOPS
ARG LARGEBYTES =>
ARG INDEX =>
ARG SMALLBYTES =>
]
DEFINE WHOOPS => [ WHOOPS TOK ]
DEFINE SEARCHBYTES => [
FOR 0
ADD -1 SUB LENGTH LARGEBYTES LENGTH SMALLBYTES
[
IF COMPAREBYTES SMALLBYTES I LARGEBYTES [
p found search target at I ;
] [ ]
ARG I =>
]
p length a: LENGTH SMALLBYTES b: LENGTH LARGEBYTES, iterating to: ADD SUB LENGTH LARGEBYTES LENGTH SMALLBYTES ;
ARG LARGEBYTES =>
ARG SMALLBYTES =>
]
DEFINE MAPFILE => [
returns RESULT
CLOSEFILE FHANDLE
BIND RESULT => MAPFILERECURSE
NEWARRAY
GETFUNCTION MFUNC TOK
READER
BIND FHANDLE => BIND READER => OPENFILE FILENAME
ARG FILENAME =>
ARG MFUNC => UNFUNC
]
DEFINE MAPFILERECURSE => [
IF NOT EQUAL ->STRING LINE ->STRING FALSE TOK [
MAPFILERECURSE
ARR
GETFUNCTION MFUNC TOK
FHANDLE
REBIND ARR => ARRAYPUSH ARR CALL MFUNC LINE
]
[ returns ARR ]
BIND LINE => READFILELINE FHANDLE
ARG FHANDLE =>
ARG MFUNC => UNFUNC
ARG ARR =>
]
: SW => [
PRINTLN [ ------------------------------- ]
PRINTLN DUP
PRINTLN [ ------------------------------- ]
]
TESTBLOCK [
TEST MERGESORT [ LESSTHAN ] A[ 6 3 5 2 1 4 ]A A[ 1 2 3 4 5 6 ]A ->STRING [ MERGESORT ]
]
DEFINE MERGESORT => [
IF LESSTHAN LENGTH ARR 2 [
returns ARR
]
[
returns MERGE GETFUNCTION MFUNC TOK
MERGESORT GETFUNCTION MFUNC TOK LEFT
MERGESORT GETFUNCTION MFUNC TOK RIGHT
A[ ]A
: LEFT => SLICE 0 SUB HALFWAY 1 ARR
: RIGHT => SLICE
HALFWAY
SUB LENGTH ARR 1
ARR
: HALFWAY => FLOOR DIVIDE LENGTH ARR 2
]
d Merge sorting ARR ;
: ARR =>
: MFUNC =>
]
TESTBLOCK [
TEST SLICE-STRING 1 3 ABCDEFG BCD ->STRING [ SLICE-STRING ]
]
DEFINE SLICE-STRING => [
returns NEWSTR
ITERATE THIN [
REBIND NEWSTR => STRING-CONCATENATE NEWSTR GETSTRING I STR
REBIND I =>
] RANGE START END
: I => 0
: NEWSTR => ->STRING [ ]
d Slicing START to END in STR ;
: STR =>
: END =>
: START =>
]
TESTBLOCK [
TEST SLICE 1 3 A[ The quick brown fox jumped over the lazy dog ]A A[ quick brown fox ]A ->STRING [ SLICE ]
]
DEFINE SLICE => [
returns NEWARR
ITERATE THIN THIN [
REBIND NEWARR => ARRAYPUSH NEWARR GETARRAY I ARR
REBIND I =>
] RANGE START END
: I => 0
: NEWARR => NEWARRAY
d Slicing START to END in ARR ;
: ARR =>
: END =>
: START =>
]
TESTBLOCK [
TEST MERGE [ LESSTHAN ] A[ 1 3 5 ]A A[ 2 4 6 ]A A[ ]A A[ 1 2 3 4 5 6 ]A ->STRING [ MERGE ]
]
DEFINE MERGE => [
IF LESSTHAN 0 LENGTH L1 THIN [
IF LESSTHAN 0 LENGTH L2 THIN [
MERGE GETFUNCTION MFUNC TOK L1 L2 ACCUM
IF CALL MFUNC A B THIN [
REBIND ACCUM => ARRAYPUSH ACCUM A
REBIND L1 => DROP SHIFTARRAY L1
]
THIN [
REBIND ACCUM => ARRAYPUSH ACCUM B
REBIND L2 => DROP SHIFTARRAY L2
]
: A => GETARRAY 0 L1
: B => GETARRAY 0 L2
]
THIN [
MERGE GETFUNCTION MFUNC TOK L1 L2 ACCUM
REBIND ACCUM => ARRAYPUSH ACCUM A
REBIND L1 => DROP SHIFTARRAY L1
: A => GETARRAY 0 L1
]
]
THIN [
IF LESSTHAN 0 LENGTH L2 THIN [
MERGE GETFUNCTION MFUNC TOK L1 L2 ACCUM
REBIND ACCUM => ARRAYPUSH ACCUM B
REBIND L2 => DROP SHIFTARRAY L2
: B => GETARRAY 0 L2
]
THIN [
d Merge returning ACCUM ;
ACCUM
]
]
d ----Merging-------- ;
d l1 L1 length LENGTH L1 ;
d l2 L2 length LENGTH L2 ;
d accum ACCUM ;
d ------------------- ;
: ACCUM =>
: L2 =>
: L1 =>
: MFUNC =>
]
TESTBLOCK [
TEST MULTIBUBBLESORT A[ A[ 3 8 2 20 5 ]A A[ AA BB CC DD EE ]A ]A A[ A[ 2 3 5 8 20 ]A A[ CC AA EE BB DD ]A ]A ->STRING [ MULTIBUBBLESORT ]
]
DEFINE MULTIBUBBLESORT => [
IF CHANGED [
MULTIBUBBLESORT NEWARR
]
[
returns NEWARR
]
: NEWARR => : CHANGED => MULTIBUBBLESTEP ARR
: ARR =>
]
TESTBLOCK [
TEST DROP MULTIBUBBLESTEP DROP MULTIBUBBLESTEP A[ A[ 3 8 2 20 5 ]A A[ AA BB CC DD EE ]A ]A A[ A[ 2 3 5 8 20 ]A A[ CC AA EE BB DD ]A ]A [ MULTIBUBBLESTEP ]
]
DEFINE MULTIBUBBLESTEP => [
returns CHANGED ARRS
ITERATE THIN [
IF LESSTHAN
GETARRAY ADD 1 I ARR
GETARRAY I ARR
THIN [
STATEMENT [ MULTIBSTEP REBIND 2 ] [ REBIND CHANGED => TRUE ]
STATEMENT [ MULTIBSTEP REBIND 1 ] [ REBIND ARRS => MAP [ SWAPARR ADD 1 I I ] ARRS ]
]
[ ]
REBIND I =>
] RANGE 0 SUB LENGTH ARR 2
: I => 0
: CHANGED => FALSE
: ARR => GETARRAY 0 ARRS
: ARRS =>
]
TESTBLOCK [
TEST BUBBLESORT A[ 3 8 2 20 5 ]A A[ 2 3 5 8 20 ]A ->STRING [ BUBBLESORT ]
]
DEFINE BUBBLESORT => [
IF CHANGED
[ BUBBLESORT NEWARR ]
[ returns NEWARR ]
ARG NEWARR =>
ARG CHANGED => BUBBLESTEP ARR
ARG ARR =>
]
TESTBLOCK [
TEST DROP BUBBLESTEP DROP BUBBLESTEP A[ 3 8 2 20 5 ]A A[ 2 3 5 8 20 ]A ->STRING [ BUBBLESTEP ]
]
DEFINE BUBBLESTEP => [
returns CHANGED ARR
ITERATE THIN [
IF LESSTHAN
GETARRAY ADD 1 I ARR
GETARRAY I ARR THIN [
REBIND CHANGED => TRUE
REBIND ARR => SWAPARR ADD 1 I I ARR
]
[ ]
REBIND I =>
] RANGE 0 SUB LENGTH ARR 2
: CHANGED => FALSE
: I => UNINITIALISED
: ARR =>
]
TESTBLOCK [
TEST RANGE 1 3 A[ 1 2 3 ]A ->STRING [ RANGE ]
]
DEFINE RANGE => [
returns ARR
COUNTDOWN2ZERO
COUNT THIN [
REBIND ARR => UNSHIFTARRAY ADD MIN I ARR
REBIND I TOK
]
: I => 0
: ARR => NEWARRAY
: COUNT => SUB MAX MIN
: CHANGED => FALSE
: MAX =>
: MIN =>
]
DEFINE INVERTHASH => [
ITERATE2 [
SETHASH VAL KEY NEWHASH
: KEY => : VAL =>
]
]
TESTBLOCK [
TEST GETARRAY 0 swappedSpirits ->STRING [ vodka ] ->STRING [ SWAP ]
TEST GETARRAY 1 swappedSpirits ->STRING [ rum ] ->STRING [ SWAP ]
: swappedSpirits => SWAPARR 0 1 moreSpirits
: moreSpirits => UNSHIFTARRAY ->STRING [ rum ] spirits
TEST GETARRAY 0 spirits [ vodka ] [ ARRAYPUSH and GETARRAY ]
: spirits => ARRAYPUSH NEWARRAY ->STRING [ vodka ]
]
COMMENT [ Swaps two elements in an array... and does two full copies of the array! ]
DEFINE SWAPARR => [
returns ARR2
: ARR2 => SETARRAY B TEMPVAL ARR1
: ARR1 => SETARRAY A GETARRAY B ARR ARR
: TEMPVAL => GETARRAY A ARR
: ARR =>
: B =>
: A =>
]
DEFINE VALS => [ MAP2 [ DROP ] KEYVALS ]
DEFINE KEYS => [ MAP2 [ DROP SWAP ] KEYVALS ]
COMMENT [ ->STRING [ Stack empty. ] ]
DEFINE HELP => [ ITERATE [ PRINTLN ] A[
.
[ Welcome to THROFF ]
.
[ Throff is a minimal scripting language and an ultra-lightweight interpreter. Throff provides powerful and convenient scripting access from the command line. ]
.
.
[ SHELLHELP - Using the command line ]
[ QUICKSTART - How to Throff, with examples ]
[ BUILTINS - Arrays, hashes, if then else, while, map, filter, fold etc ]
.
.
.
]A
: . => A[ ]A
: TAB => STRING-CONCATENATE STRING-CONCATENATE SPACE SPACE STRING-CONCATENATE SPACE SPACE
]
DEFINE SHELLHELP => [ ITERATE [ EMIT SPACE EMIT ] A[
.
[ Type your program on the command line, and the result will be printed above the ready prompt. ]
Ready> ADD 2 3
5
Ready>
[ Throff is a stack based language. The top item of the stack is always printed above the Ready> prompt. All functions work on the stack, so you can type your command in parts, and examine it. ]
Ready> 2
2
Ready> 3
3
Ready> ADD
5
Ready>
]A
: . => A[ ]A
: TAB => STRING-CONCATENATE STRING-CONCATENATE SPACE SPACE STRING-CONCATENATE SPACE SPACE
]
DEFINE QUICKSTART => [ ITERATE [ EMIT SPACE EMIT ] A[
. Throff is a catenative language, so you don't need brackets, braces or commas to do function calls. This makes it easy and quick to type commands, especially in the command shell.
.
. TAB Ready> [ p ADD 1 1 ; ]
.
. TAB 2
.
. Functions usually have a fixed number of arguments, and Throff keeps track of them.
.
. TAB Ready> [ p SUB 1 MULT 2 ADD 1 1 ; ]
.
. TAB -3
.
. Throff commands run from right to left. The result of the previous command is the arguments to the next
.
. Throff has a very minimal parser. Control characters must never touch anything else
.
. Good: TAB [ PRINTLN [ Hello ] ]
.
. Bad: TAB [PRINTLN [Hello]]
.
.
]A
: . => STRING-CONCATENATE CR NEWLINE
: TAB => STRING-CONCATENATE STRING-CONCATENATE SPACE SPACE STRING-CONCATENATE SPACE SPACE
]
DEFINE test => [
TEST TESTVAR EXPECTED DESCRIPTION
ARG TESTVAR TOK
ARG EXPECTED TOK
ARG DESCRIPTION => STRING
]
DEFINE ADD1 => [ ADD 1 ]
DEFINE SUB1 => [ SUB SWAP 1 ]
DEFINE FI => [ ]
DEFINE ELSE => [ ]
TESTBLOCK [
TEST GETARRAY 0 spirits ->STRING [ vodka ] ->STRING [ PUSH something ONTO ]
REBIND spirits => PUSH ->STRING [ vodka ] ONTO spirits
: spirits => NEWARRAY
]
DEFINE PUSH => GETFUNCTION PUSHARRAY TOK
DEFINE PUSHARRAY => [ ARRAYPUSH SWAP ]
DEFINE ONTO => [ ]
DEFINE GET => [ DROP OF ]
DEFINE OF => [
IF ( NOT EQUAL ->STRING HASH TOK GETTYPE A ) [
OF TOK
GETHASH A AHASH
ARG AHASH =>
ARG of =>
]
[
OF TOK A
]
ARG A =>
TROFF
]
TESTBLOCK [
TEST KEY pages [ HASHITERATE key ]
TEST VAL 132 [ HASHITERATE value ]
HASHITERATE bookdata THIN [ REBIND VAL => REBIND KEY => ]
: KEY => FAIL
: VAL => FAIL
: bookdata => SETHASH pages 132 NEWHASH
]
DEFINE HASHITERATE => [
ITERATE2 THIN [
CALL AFUNC AKEY AVAL
ARG AVAL =>
ARG AKEY =>
]
KEYVALS AHASH
d keyvals KEYVALS AHASH ;
ARG AFUNC => UNFUNC
ARG AHASH =>
]
TESTBLOCK [
TEST ACCUM 3 ->STRING [ ITERATE2 ]
ITERATE2 THIN [ REBIND ACCUM => ADD 1 ACCUM DROP DROP ] A[ 1 2 3 4 5 6 ]A
: ACCUM => 0
]
TESTBLOCK [
TEST ACCUM ITERATE THIN [ REBIND ACCUM => SUB ACCUM 1 DROP ] A[ 1 2 3 4 5 ]A 0 ->STRING [ ITERATE ]
: ACCUM => 5
]
DEFINE ITERATESLICE2 => [
IF LESSTHAN END START [ ]
[
ITERATESLICE2 MFUNC ADD 2 START END ARRAY1
STATEMENT [ Internal iterate2 call ] [ CALL MFUNC UNFUNC GETARRAY START ARRAY1 UNFUNC GETARRAY ADD 1 START ARRAY1 ]
]
ARG ARRAY1 TOK