1 ! Copyright (C) 2005, 2011 Slava Pestov, Daniel Ehrenberg.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: accessors kernel kernel.private math math.order
4 math.private slots.private ;
9 GENERIC: length ( seq -- n ) flushable
10 GENERIC: set-length ( n seq -- )
11 GENERIC: nth ( n seq -- elt ) flushable
12 GENERIC: set-nth ( elt n seq -- )
13 GENERIC: new-sequence ( len seq -- newseq ) flushable
14 GENERIC: new-resizable ( len seq -- newseq ) flushable
15 GENERIC: like ( seq exemplar -- newseq ) flushable
16 GENERIC: clone-like ( seq exemplar -- newseq ) flushable
18 : new-like ( len exemplar quot -- seq )
19 over [ [ new-sequence ] dip call ] dip like ; inline
21 M: sequence like drop ; inline
23 GENERIC: lengthen ( n seq -- )
24 GENERIC: shorten ( n seq -- )
26 M: sequence lengthen 2dup length > [ set-length ] [ 2drop ] if ; inline
27 M: sequence shorten 2dup length < [ set-length ] [ 2drop ] if ; inline
29 : empty? ( seq -- ? ) length 0 = ; inline
31 : if-empty ( ..a seq quot1: ( ..a -- ..b ) quot2: ( ..a seq -- ..b ) -- ..b )
32 [ dup empty? ] [ [ drop ] prepose ] [ ] tri* if ; inline
34 : when-empty ( seq quot -- ) [ ] if-empty ; inline
36 : unless-empty ( seq quot -- ) [ ] swap if-empty ; inline
38 : delete-all ( seq -- ) 0 swap set-length ;
40 : first ( seq -- first ) 0 swap nth ; inline
41 : second ( seq -- second ) 1 swap nth ; inline
42 : third ( seq -- third ) 2 swap nth ; inline
43 : fourth ( seq -- fourth ) 3 swap nth ; inline
45 : set-first ( first seq -- ) 0 swap set-nth ; inline
46 : set-second ( second seq -- ) 1 swap set-nth ; inline
47 : set-third ( third seq -- ) 2 swap set-nth ; inline
48 : set-fourth ( fourth seq -- ) 3 swap set-nth ; inline
50 : push ( elt seq -- ) [ length ] [ set-nth ] bi ;
52 ERROR: bounds-error index seq ;
54 GENERIC# bounds-check? 1 ( n seq -- ? )
56 M: integer bounds-check? ( n seq -- ? )
57 dupd length < [ 0 >= ] [ drop f ] if ; inline
59 : bounds-check ( n seq -- n seq )
60 2dup bounds-check? [ bounds-error ] unless ; inline
62 MIXIN: immutable-sequence
64 ERROR: immutable seq ;
66 M: immutable-sequence set-nth immutable ;
68 INSTANCE: immutable-sequence sequence
72 : array-nth ( n array -- elt )
73 swap 2 fixnum+fast slot ; inline
75 : set-array-nth ( elt n array -- )
76 swap 2 fixnum+fast set-slot ; inline
78 : dispatch ( n array -- ) array-nth call ;
80 GENERIC: resize ( n seq -- newseq ) flushable
82 ! Unsafe sequence protocol for inner loops
83 GENERIC: nth-unsafe ( n seq -- elt ) flushable
84 GENERIC: set-nth-unsafe ( elt n seq -- )
86 M: sequence nth bounds-check nth-unsafe ; inline
87 M: sequence set-nth bounds-check set-nth-unsafe ; inline
89 M: sequence nth-unsafe nth ; inline
90 M: sequence set-nth-unsafe set-nth ; inline
92 : change-nth-unsafe ( i seq quot -- )
93 [ [ nth-unsafe ] dip call ] 3keep drop set-nth-unsafe ; inline
97 ! The f object supports the sequence protocol trivially
98 M: f length drop 0 ; inline
99 M: f nth-unsafe nip ; inline
100 M: f like drop [ f ] when-empty ; inline
102 INSTANCE: f immutable-sequence
105 TUPLE: iota { n integer read-only } ;
107 : iota ( n -- iota ) \ iota boa ; inline
109 M: iota length n>> ; inline
110 M: iota nth-unsafe drop ; inline
112 INSTANCE: iota immutable-sequence
116 : first-unsafe ( seq -- first ) 0 swap nth-unsafe ; inline
117 : second-unsafe ( seq -- second ) 1 swap nth-unsafe ; inline
118 : third-unsafe ( seq -- third ) 2 swap nth-unsafe ; inline
119 : fourth-unsafe ( seq -- fourth ) 3 swap nth-unsafe ; inline
121 : first2-unsafe ( seq -- first second )
122 [ first-unsafe ] [ second-unsafe ] bi ; inline
124 : first3-unsafe ( seq -- first second third )
125 [ first2-unsafe ] [ third-unsafe ] bi ; inline
127 : first4-unsafe ( seq -- first second third fourth )
128 [ first3-unsafe ] [ fourth-unsafe ] bi ; inline
130 : exchange-unsafe ( m n seq -- )
131 [ [ nth-unsafe ] curry bi@ ]
132 [ [ set-nth-unsafe ] curry bi@ ] 3bi ; inline
134 : (head) ( seq n -- from to seq ) [ 0 ] 2dip swap ; inline
136 : (tail) ( seq n -- from to seq ) swap [ length ] keep ; inline
138 : from-end ( seq n -- seq n' ) [ dup length ] dip - ; inline
140 : (1sequence) ( obj seq -- seq )
141 [ 0 swap set-nth-unsafe ] keep ; inline
143 : (2sequence) ( obj1 obj2 seq -- seq )
144 [ 1 swap set-nth-unsafe ] keep (1sequence) ; inline
146 : (3sequence) ( obj1 obj2 obj3 seq -- seq )
147 [ 2 swap set-nth-unsafe ] keep (2sequence) ; inline
149 : (4sequence) ( obj1 obj2 obj3 obj4 seq -- seq )
150 [ 3 swap set-nth-unsafe ] keep (3sequence) ; inline
154 : 1sequence ( obj exemplar -- seq )
155 1 swap [ (1sequence) ] new-like ; inline
157 : 2sequence ( obj1 obj2 exemplar -- seq )
158 2 swap [ (2sequence) ] new-like ; inline
160 : 3sequence ( obj1 obj2 obj3 exemplar -- seq )
161 3 swap [ (3sequence) ] new-like ; inline
163 : 4sequence ( obj1 obj2 obj3 obj4 exemplar -- seq )
164 4 swap [ (4sequence) ] new-like ; inline
166 : first2 ( seq -- first second )
167 1 swap bounds-check nip first2-unsafe ; inline
169 : first3 ( seq -- first second third )
170 2 swap bounds-check nip first3-unsafe ; inline
172 : first4 ( seq -- first second third fourth )
173 3 swap bounds-check nip first4-unsafe ; inline
175 : ?nth ( n seq -- elt/f )
176 2dup bounds-check? [ nth-unsafe ] [ 2drop f ] if ; inline
178 : ?first ( seq -- elt/f ) 0 swap ?nth ; inline
179 : ?second ( seq -- elt/f ) 1 swap ?nth ; inline
180 : ?last ( seq -- elt/f )
181 [ length 1 - ] keep over 0 <
182 [ 2drop f ] [ nth-unsafe ] if ; inline
184 MIXIN: virtual-sequence
185 GENERIC: virtual-exemplar ( seq -- seq' )
186 GENERIC: virtual@ ( n seq -- n' seq' )
188 M: virtual-sequence nth virtual@ nth ; inline
189 M: virtual-sequence set-nth virtual@ set-nth ; inline
190 M: virtual-sequence nth-unsafe virtual@ nth-unsafe ; inline
191 M: virtual-sequence set-nth-unsafe virtual@ set-nth-unsafe ; inline
192 M: virtual-sequence like virtual-exemplar like ; inline
193 M: virtual-sequence new-sequence virtual-exemplar new-sequence ; inline
195 INSTANCE: virtual-sequence sequence
197 ! A reversal of an underlying sequence.
198 TUPLE: reversed { seq read-only } ;
200 C: <reversed> reversed
202 M: reversed virtual-exemplar seq>> ; inline
203 M: reversed virtual@ seq>> [ length swap - 1 - ] keep ; inline
204 M: reversed length seq>> length ; inline
206 INSTANCE: reversed virtual-sequence
208 ! A slice of another sequence.
214 : collapse-slice ( m n slice -- m' n' seq )
215 [ from>> ] [ seq>> ] bi [ [ + ] curry bi@ ] dip ; inline
217 TUPLE: slice-error from to seq reason ;
219 : slice-error ( from to seq ? string -- from to seq )
220 [ \ slice-error boa throw ] curry when ; inline
222 : check-slice ( from to seq -- from to seq )
224 [ 2drop 0 < "start < 0" slice-error ]
225 [ [ drop ] 2dip length > "end > sequence" slice-error ]
226 [ drop > "start > end" slice-error ]
231 : <slice-unsafe> ( from to seq -- slice )
232 dup slice? [ collapse-slice ] when slice boa ; inline
236 : <slice> ( from to seq -- slice )
237 check-slice <slice-unsafe> ; inline
239 M: slice virtual-exemplar seq>> ; inline
241 M: slice virtual@ [ from>> + ] [ seq>> ] bi ; inline
243 M: slice length [ to>> ] [ from>> ] bi - ; inline
245 : short ( seq n -- seq n' ) over length min ; inline
247 : head-slice ( seq n -- slice ) (head) <slice> ; inline
249 : tail-slice ( seq n -- slice ) (tail) <slice> ; inline
251 : rest-slice ( seq -- slice ) 1 tail-slice ; inline
253 : head-slice* ( seq n -- slice ) from-end head-slice ; inline
255 : tail-slice* ( seq n -- slice ) from-end tail-slice ; inline
257 : but-last-slice ( seq -- slice ) 1 head-slice* ; inline
259 INSTANCE: slice virtual-sequence
261 ! One element repeated many times
262 TUPLE: repetition { len read-only } { elt read-only } ;
264 C: <repetition> repetition
266 M: repetition length len>> ; inline
267 M: repetition nth-unsafe nip elt>> ; inline
269 INSTANCE: repetition immutable-sequence
273 ERROR: integer-length-expected obj ;
275 : check-length ( n -- n )
276 dup integer? [ integer-length-expected ] unless ; inline
286 : ((copy)) ( n copy -- )
287 [ [ src-i>> + ] [ src>> ] bi nth-unsafe ]
288 [ [ dst-i>> + ] [ dst>> ] bi set-nth-unsafe ] 2bi ; inline
290 : (copy) ( n copy -- dst )
291 over 0 <= [ nip dst>> ] [ [ 1 - ] dip [ ((copy)) ] [ (copy) ] 2bi ] if ;
294 : subseq>copy ( from to seq -- n copy )
295 [ over - check-length swap ] dip
296 3dup nip new-sequence 0 swap <copy> ; inline
298 : bounds-check-head ( n seq -- n seq )
299 over 0 < [ bounds-error ] when ; inline
301 : check-copy ( src n dst -- src n dst )
302 3dup bounds-check-head
303 [ swap length + ] dip lengthen ; inline
307 : subseq ( from to seq -- subseq )
308 [ check-slice subseq>copy (copy) ] keep like ;
310 : head ( seq n -- headseq ) (head) subseq ;
312 : tail ( seq n -- tailseq ) (tail) subseq ;
314 : rest ( seq -- tailseq ) 1 tail ;
316 : head* ( seq n -- headseq ) from-end head ;
318 : tail* ( seq n -- tailseq ) from-end tail ;
320 : but-last ( seq -- headseq ) 1 head* ;
322 : copy ( src i dst -- )
323 #! The check-length call forces partial dispatch
324 [ [ length check-length 0 ] keep ] 2dip
325 check-copy <copy> (copy) drop ; inline
327 M: sequence clone-like
328 [ dup length ] dip new-sequence [ 0 swap copy ] keep ; inline
330 M: immutable-sequence clone-like like ; inline
332 : push-all ( src dst -- ) [ length ] [ copy ] bi ; inline
336 : (append) ( seq1 seq2 accum -- accum )
337 [ [ over length ] dip copy ]
343 : append-as ( seq1 seq2 exemplar -- newseq )
344 [ 2dup [ length ] bi@ + ] dip
345 [ (append) ] new-like ; inline
347 : 3append-as ( seq1 seq2 seq3 exemplar -- newseq )
348 [ 3dup [ length ] tri@ + + ] dip [
349 [ [ 2over [ length ] bi@ + ] dip copy ]
353 : append ( seq1 seq2 -- newseq ) over append-as ;
355 : prepend-as ( seq1 seq2 exemplar -- newseq ) swapd append-as ; inline
357 : prepend ( seq1 seq2 -- newseq ) over prepend-as ;
359 : 3append ( seq1 seq2 seq3 -- newseq ) pick 3append-as ;
361 : surround ( seq1 seq2 seq3 -- newseq ) swapd 3append ; inline
363 : glue ( seq1 seq2 seq3 -- newseq ) swap 3append ; inline
365 : change-nth ( ..a i seq quot: ( ..a elt -- ..b newelt ) -- ..b )
366 [ [ nth ] dip call ] 3keep drop set-nth-unsafe ; inline
368 : min-length ( seq1 seq2 -- n ) [ length ] bi@ min ; inline
370 : max-length ( seq1 seq2 -- n ) [ length ] bi@ max ; inline
374 : ((each)) ( seq -- n quot )
375 [ length ] keep [ nth-unsafe ] curry ; inline
377 : (each) ( seq quot -- n quot' )
378 [ ((each)) ] dip compose ; inline
380 : (each-index) ( seq quot -- n quot' )
381 [ ((each)) [ keep ] curry ] dip compose ; inline
383 : (collect) ( quot into -- quot' )
384 [ [ keep ] dip set-nth-unsafe ] 2curry ; inline
386 : collect ( n quot into -- )
387 (collect) each-integer ; inline
389 : map-into ( seq quot into -- )
390 [ (each) ] dip collect ; inline
392 : 2nth-unsafe ( n seq1 seq2 -- elt1 elt2 )
393 [ nth-unsafe ] bi-curry@ bi ; inline
395 : ((2each)) ( seq1 seq2 -- n quot )
396 [ min-length ] 2keep [ 2nth-unsafe ] 2curry ; inline
398 : (2each) ( seq1 seq2 quot -- n quot' )
399 [ ((2each)) ] dip compose ; inline
401 : 3nth-unsafe ( n seq1 seq2 seq3 -- elt1 elt2 elt3 )
402 [ nth-unsafe ] tri-curry@ tri ; inline
404 : (3each) ( seq1 seq2 seq3 quot -- n quot' )
406 [ [ length ] tri@ min min ]
407 [ [ 3nth-unsafe ] 3curry ] 3bi
408 ] dip compose ; inline
410 : finish-find ( i seq -- i elt )
411 over [ dupd nth-unsafe ] [ drop f ] if ; inline
413 : (find) ( seq quot quot' -- i elt )
414 pick [ [ (each) ] dip call ] dip finish-find ; inline
416 : (find-from) ( n seq quot quot' -- i elt )
417 [ 2dup bounds-check? ] 2dip
422 : (find-index) ( seq quot quot' -- i elt )
423 pick [ [ (each-index) ] dip call ] dip finish-find ; inline
425 : (find-index-from) ( n seq quot quot' -- i elt )
426 [ 2dup bounds-check? ] 2dip
427 [ (find-index) ] 2curry
431 : (accumulate) ( seq identity quot -- identity seq quot )
432 swapd [ curry keep ] curry ; inline
436 : each ( ... seq quot: ( ... x -- ... ) -- ... )
437 (each) each-integer ; inline
439 : reduce ( ... seq identity quot: ( ... prev elt -- ... next ) -- ... result )
442 : map-integers ( ... len quot: ( ... i -- ... elt ) exemplar -- ... newseq )
443 [ over ] dip [ [ collect ] keep ] new-like ; inline
445 : map-as ( ... seq quot: ( ... elt -- ... newelt ) exemplar -- ... newseq )
446 [ (each) ] dip map-integers ; inline
448 : map ( ... seq quot: ( ... elt -- ... newelt ) -- ... newseq )
451 : replicate-as ( ... len quot: ( ... -- ... newelt ) exemplar -- ... newseq )
452 [ [ drop ] prepose ] dip map-integers ; inline
454 : replicate ( ... len quot: ( ... -- ... newelt ) -- ... newseq )
455 { } replicate-as ; inline
457 : map! ( ... seq quot: ( ... elt -- ... newelt ) -- ... seq )
458 over [ map-into ] keep ; inline
460 : accumulate-as ( ... seq identity quot: ( ... prev elt -- ... next ) exemplar -- ... final newseq )
461 [ (accumulate) ] dip map-as ; inline
463 : accumulate ( ... seq identity quot: ( ... prev elt -- ... next ) -- ... final newseq )
464 pick accumulate-as ; inline
466 : accumulate! ( ... seq identity quot: ( ... prev elt -- ... next ) -- ... final seq )
467 (accumulate) map! ; inline
469 : 2each ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... ) -- ... )
470 (2each) each-integer ; inline
472 : 2reduce ( ... seq1 seq2 identity quot: ( ... prev elt1 elt2 -- ... next ) -- ... result )
473 [ -rot ] dip 2each ; inline
475 : 2map-as ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... newelt ) exemplar -- ... newseq )
476 [ (2each) ] dip map-integers ; inline
478 : 2map ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... newelt ) -- ... newseq )
479 pick 2map-as ; inline
481 : 2all? ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... ? ) -- ... ? )
482 (2each) all-integers? ; inline
484 : 3each ( ... seq1 seq2 seq3 quot: ( ... elt1 elt2 elt3 -- ... ) -- ... )
485 (3each) each-integer ; inline
487 : 3map-as ( ... seq1 seq2 seq3 quot: ( ... elt1 elt2 elt3 -- ... newelt ) exemplar -- ... newseq )
488 [ (3each) ] dip map-integers ; inline
490 : 3map ( ... seq1 seq2 seq3 quot: ( ... elt1 elt2 elt3 -- ... newelt ) -- ... newseq )
491 [ pick ] dip swap 3map-as ; inline
493 : find-from ( ... n seq quot: ( ... elt -- ... ? ) -- ... i elt )
494 [ (find-integer) ] (find-from) ; inline
496 : find ( ... seq quot: ( ... elt -- ... ? ) -- ... i elt )
497 [ find-integer ] (find) ; inline
499 : find-last-from ( ... n seq quot: ( ... elt -- ... ? ) -- ... i elt )
500 [ nip find-last-integer ] (find-from) ; inline
502 : find-last ( ... seq quot: ( ... elt -- ... ? ) -- ... i elt )
503 [ [ 1 - ] dip find-last-integer ] (find) ; inline
505 : find-index-from ( ... n seq quot: ( ... elt i -- ... ? ) -- ... i elt )
506 [ (find-integer) ] (find-index-from) ; inline
508 : find-index ( ... seq quot: ( ... elt i -- ... ? ) -- ... i elt )
509 [ find-integer ] (find-index) ; inline
511 : all? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? )
512 (each) all-integers? ; inline
514 : push-if ( ..a elt quot: ( ..a elt -- ..b ? ) accum -- ..b )
515 [ keep ] dip rot [ push ] [ 2drop ] if ; inline
517 : selector-for ( quot exemplar -- selector accum )
518 [ length ] keep new-resizable [ [ push-if ] 2curry ] keep ; inline
520 : selector ( quot -- selector accum )
521 V{ } selector-for ; inline
523 : filter-as ( ... seq quot: ( ... elt -- ... ? ) exemplar -- ... subseq )
524 dup [ selector-for [ each ] dip ] curry dip like ; inline
526 : filter ( ... seq quot: ( ... elt -- ... ? ) -- ... subseq )
527 over filter-as ; inline
529 : push-either ( ..a elt quot: ( ..a elt -- ..b ? ) accum1 accum2 -- ..b )
530 [ keep swap ] 2dip ? push ; inline
532 : 2selector ( quot -- selector accum1 accum2 )
533 V{ } clone V{ } clone [ [ push-either ] 3curry ] 2keep ; inline
535 : partition ( ... seq quot: ( ... elt -- ... ? ) -- ... trueseq falseseq )
536 over [ 2selector [ each ] 2dip ] dip [ like ] curry bi@ ; inline
538 : collector-for ( quot exemplar -- quot' vec )
539 [ length ] keep new-resizable [ [ push ] curry compose ] keep ; inline
541 : collector ( quot -- quot' vec )
542 V{ } collector-for ; inline
544 : produce-as ( ..a pred: ( ..a -- ..b ? ) quot: ( ..b -- ..a obj ) exemplar -- ..b seq )
545 dup [ collector-for [ while ] dip ] curry dip like ; inline
547 : produce ( ..a pred: ( ..a -- ..b ? ) quot: ( ..b -- ..a obj ) -- ..b seq )
548 { } produce-as ; inline
550 : follow ( ... obj quot: ( ... prev -- ... result/f ) -- ... seq )
551 [ dup ] swap [ keep ] curry produce nip ; inline
553 : each-index ( ... seq quot: ( ... elt index -- ... ) -- ... )
554 (each-index) each-integer ; inline
556 : interleave ( ... seq between quot: ( ... elt -- ... ) -- ... )
557 pick empty? [ 3drop ] [
558 [ [ drop first-unsafe ] dip call ]
559 [ [ rest-slice ] 2dip [ bi* ] 2curry each ]
563 : map-index ( ... seq quot: ( ... elt index -- ... newelt ) -- ... newseq )
564 [ dup length iota ] dip 2map ; inline
566 : reduce-index ( ... seq identity quot: ( ... prev elt index -- ... next ) -- ... result )
567 swapd each-index ; inline
569 : index ( obj seq -- n )
570 [ = ] with find drop ;
572 : index-from ( obj i seq -- n )
573 rot [ = ] curry find-from drop ;
575 : last-index ( obj seq -- n )
576 [ = ] with find-last drop ;
578 : last-index-from ( obj i seq -- n )
579 rot [ = ] curry find-last-from drop ;
583 : (indices) ( elt i obj accum -- )
584 [ swap [ = ] dip ] dip [ push ] 2curry when ; inline
588 : indices ( obj seq -- indices )
590 [ [ (indices) ] 2curry each-index ] keep ;
592 : nths ( indices seq -- seq' )
593 [ [ nth ] curry ] keep map-as ;
595 : any? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? )
596 find drop >boolean ; inline
598 : member? ( elt seq -- ? )
601 : member-eq? ( elt seq -- ? )
604 : remove ( elt seq -- newseq )
605 [ = not ] with filter ;
607 : remove-eq ( elt seq -- newseq )
608 [ eq? not ] with filter ;
610 : sift ( seq -- newseq )
613 : harvest ( seq -- newseq )
614 [ empty? not ] filter ;
618 : mismatch-unsafe ( n seq1 seq2 -- i )
619 [ 2nth-unsafe = not ] 2curry find-integer ; inline
623 : mismatch ( seq1 seq2 -- i )
624 [ min-length ] 2keep mismatch-unsafe ; inline
627 [ mismatch ] 2keep pick
628 [ 2nth-unsafe <=> ] [ [ length ] compare nip ] if ;
630 : sequence= ( seq1 seq2 -- ? )
631 2dup [ length ] bi@ dupd =
632 [ -rot mismatch-unsafe not ] [ 3drop f ] if ; inline
634 ERROR: assert-sequence got expected ;
636 : assert-sequence= ( a b -- )
637 2dup sequence= [ 2drop ] [ assert-sequence ] if ;
641 : sequence-hashcode-step ( oldhash newpart -- newhash )
642 integer>fixnum swap [
643 [ -2 fixnum-shift-fast ] [ 5 fixnum-shift-fast ] bi
644 fixnum+fast fixnum+fast
645 ] keep fixnum-bitxor ; inline
649 : sequence-hashcode ( n seq -- x )
650 [ 0 ] 2dip [ hashcode* sequence-hashcode-step ] with each ; inline
652 M: reversed equal? over reversed? [ sequence= ] [ 2drop f ] if ;
654 M: slice equal? over slice? [ sequence= ] [ 2drop f ] if ;
656 : move ( to from seq -- )
658 [ 3drop ] [ [ nth swap ] [ set-nth ] bi ] if ; inline
662 : move-unsafe ( to from seq -- )
664 [ 3drop ] [ [ nth-unsafe swap ] [ set-nth-unsafe ] bi ] if ; inline
666 : (filter!) ( ... quot: ( ... elt -- ... ? ) store scan seq -- ... )
668 [ move-unsafe ] 3keep
669 [ nth-unsafe pick call [ 1 + ] when ] 2keep
672 ] [ nip set-length drop ] if ; inline recursive
676 : filter! ( ... seq quot: ( ... elt -- ... ? ) -- ... seq )
677 swap [ [ 0 0 ] dip (filter!) ] keep ; inline
679 : remove! ( elt seq -- seq )
680 [ = not ] with filter! ;
682 : remove-eq! ( elt seq -- seq )
683 [ eq? not ] with filter! ;
685 : prefix ( seq elt -- newseq )
686 over [ over length 1 + ] dip [
687 (1sequence) [ 1 swap copy ] keep
690 : suffix ( seq elt -- newseq )
691 over [ over length 1 + ] dip [
692 [ [ over length ] dip set-nth-unsafe ] keep
696 : suffix! ( seq elt -- seq ) over push ; inline
698 : append! ( seq1 seq2 -- seq1 ) over push-all ; inline
700 : last ( seq -- elt )
702 over 0 < [ bounds-error ] [ nth-unsafe ] if ; inline
706 : last-unsafe ( seq -- elt ) [ length 1 - ] [ nth-unsafe ] bi ;
710 : set-last ( elt seq -- )
712 over 0 < [ bounds-error ] [ set-nth-unsafe ] if ; inline
714 : pop* ( seq -- ) [ length 1 - ] [ shorten ] bi ;
718 : move-backward ( shift from to seq -- )
722 [ [ 2over + pick ] dip move-unsafe [ 1 + ] dip ] keep
726 : move-forward ( shift from to seq -- )
730 [ [ pick [ dup dup ] dip + swap ] dip move-unsafe 1 - ] keep
734 : (open-slice) ( shift from to seq ? -- )
736 [ [ 1 - ] bi@ ] dip move-forward
738 [ over - ] 2dip move-backward
741 : open-slice ( shift from seq -- )
745 pick over length + over
746 [ pick 0 > [ [ length ] keep ] dip (open-slice) ] 2dip
752 : delete-slice ( from to seq -- )
753 check-slice [ over [ - ] dip ] dip open-slice ;
755 : remove-nth! ( n seq -- seq )
756 [ [ dup 1 + ] dip delete-slice ] keep ;
758 : snip ( from to seq -- head tail )
759 [ swap head ] [ swap tail ] bi-curry bi* ; inline
761 : snip-slice ( from to seq -- head tail )
762 [ swap head-slice ] [ swap tail-slice ] bi-curry bi* ; inline
764 : replace-slice ( new from to seq -- seq' )
765 snip-slice surround ;
767 : remove-nth ( n seq -- seq' )
768 [ [ { } ] dip dup 1 + ] dip replace-slice ;
771 [ length 1 - ] keep over 0 >=
772 [ [ nth-unsafe ] [ shorten ] 2bi ]
773 [ bounds-error ] if ;
775 : exchange ( m n seq -- )
776 [ nip bounds-check 2drop ]
777 [ bounds-check 3drop ]
781 : midpoint@ ( seq -- n ) length 2/ ; inline
783 : reverse! ( seq -- seq )
785 [ midpoint@ iota ] [ length ] [ ] tri
786 [ [ over - 1 - ] dip exchange-unsafe ] 2curry each
789 : reverse ( seq -- newseq )
791 dup [ length ] keep new-sequence
792 [ 0 swap copy ] keep reverse!
795 : sum-lengths ( seq -- n )
796 0 [ length + ] reduce ;
798 : concat-as ( seq exemplar -- newseq )
800 [ sum-lengths over new-resizable ] keep
802 ] if-empty swap like ;
804 : concat ( seq -- newseq )
805 [ { } ] [ dup first concat-as ] if-empty ;
809 : joined-length ( seq glue -- n )
810 [ [ sum-lengths ] [ length 1 [-] ] bi ] dip length * + ;
814 : join ( seq glue -- newseq )
815 dup empty? [ concat-as ] [
817 2dup joined-length over new-resizable [
818 [ [ push-all ] 2curry ] [ [ nip push-all ] 2curry ] 2bi
824 : padding ( ... seq n elt quot: ( ... seq1 seq2 -- ... newseq ) -- ... newseq )
826 [ over length [-] dup 0 = [ drop ] ] dip
827 [ <repetition> ] curry
828 ] dip compose if ; inline
830 : pad-head ( seq n elt -- padded )
831 [ swap dup append-as ] padding ;
833 : pad-tail ( seq n elt -- padded )
836 : shorter? ( seq1 seq2 -- ? ) [ length ] bi@ < ;
838 : head? ( seq begin -- ? )
842 [ nip ] [ length head-slice ] 2bi sequence=
845 : tail? ( seq end -- ? )
849 [ nip ] [ length tail-slice* ] 2bi sequence=
852 : cut-slice ( seq n -- before-slice after-slice )
853 [ head-slice ] [ tail-slice ] 2bi ; inline
855 : insert-nth ( elt n seq -- seq' )
856 swap cut-slice [ swap suffix ] dip append ;
858 : halves ( seq -- first-slice second-slice )
859 dup midpoint@ cut-slice ; inline
863 : nth2-unsafe ( n seq -- a b )
864 [ nth-unsafe ] [ [ 1 + ] dip nth-unsafe ] 2bi ; inline
866 : nth3-unsafe ( n seq -- a b c )
867 [ nth2-unsafe ] [ [ 2 + ] dip nth-unsafe ] 2bi ; inline
869 : (binary-reduce) ( ... seq start quot: ( ... elt1 elt2 -- ... newelt ) from length -- ... value )
870 #! We can't use case here since combinators depends on
875 [ 2nip swap nth-unsafe ]
876 [ -rot [ drop swap nth2-unsafe ] dip call ]
877 [ -rot [ drop swap nth3-unsafe ] dip bi@ ]
880 [ 2/ ] [ over - ] bi [ 2dup + ] dip
881 [ (binary-reduce) ] [ 2curry ] curry 2bi@
882 pick [ 3bi ] dip call
883 ] if ; inline recursive
887 : binary-reduce ( ... seq start quot: ( ... elt1 elt2 -- ... newelt ) -- ... value )
888 pick length 0 max 0 swap (binary-reduce) ; inline
890 : cut ( seq n -- before after )
891 [ head ] [ tail ] 2bi ;
893 : cut* ( seq n -- before after )
894 [ head* ] [ tail* ] 2bi ;
898 : (start) ( subseq seq n -- subseq seq ? )
900 [ 3dup ] dip [ + swap nth-unsafe ] keep rot nth-unsafe =
905 : start* ( subseq seq n -- i )
906 pick length pick length swap - 1 + iota
907 [ (start) ] find-from
910 : start ( subseq seq -- i ) 0 start* ; inline
912 : subseq? ( subseq seq -- ? ) start >boolean ;
914 : drop-prefix ( seq1 seq2 -- slice1 slice2 )
915 2dup mismatch [ 2dup min-length ] unless*
916 [ tail-slice ] curry bi@ ;
918 : unclip ( seq -- rest first )
919 [ rest ] [ first-unsafe ] bi ;
921 : unclip-last ( seq -- butlast last )
922 [ but-last ] [ last-unsafe ] bi ;
924 : unclip-slice ( seq -- rest-slice first )
925 [ rest-slice ] [ first-unsafe ] bi ; inline
927 : map-reduce ( ..a seq map-quot: ( ..a elt -- ..b intermediate ) reduce-quot: ( ..b prev intermediate -- ..a next ) -- ..a result )
928 [ [ dup first ] dip [ call ] keep ] dip compose
929 swapd [ 1 ] 2dip (each) (each-integer) ; inline
931 : 2map-reduce ( ..a seq1 seq2 map-quot: ( ..a elt1 elt2 -- ..b intermediate ) reduce-quot: ( ..b prev intermediate -- ..a next ) -- ..a result )
932 [ [ 2dup [ first ] bi@ ] dip [ call ] keep ] dip compose
933 [ -rot ] dip [ 1 ] 3dip (2each) (each-integer) ; inline
937 : (map-find) ( seq quot find-quot -- result elt )
938 [ [ f ] 2dip [ [ nip ] dip call dup ] curry ] dip call
939 [ [ drop f ] unless ] dip ; inline
943 : map-find ( ... seq quot: ( ... elt -- ... result/f ) -- ... result elt )
944 [ find ] (map-find) ; inline
946 : map-find-last ( ... seq quot: ( ... elt -- ... result/f ) -- ... result elt )
947 [ find-last ] (map-find) ; inline
949 : unclip-last-slice ( seq -- butlast-slice last )
950 [ but-last-slice ] [ last-unsafe ] bi ; inline
954 : (trim-head) ( seq quot -- seq n )
955 over [ [ not ] compose find drop ] dip
956 [ length or ] keep swap ; inline
958 : (trim-tail) ( seq quot -- seq n )
959 over [ [ not ] compose find-last drop ?1+ ] dip
964 : trim-head-slice ( ... seq quot: ( ... elt -- ... ? ) -- ... slice )
965 (trim-head) tail-slice ; inline
967 : trim-head ( ... seq quot: ( ... elt -- ... ? ) -- ... newseq )
968 (trim-head) tail ; inline
970 : trim-tail-slice ( ... seq quot: ( ... elt -- ... ? ) -- ... slice )
971 (trim-tail) head-slice ; inline
973 : trim-tail ( ... seq quot: ( ... elt -- ... ? ) -- ... newseq )
974 (trim-tail) head ; inline
976 : trim-slice ( ... seq quot: ( ... elt -- ... ? ) -- ... slice )
977 [ trim-head-slice ] [ trim-tail-slice ] bi ; inline
979 : trim ( ... seq quot: ( ... elt -- ... ? ) -- ... newseq )
980 [ trim-slice ] [ drop ] 2bi like ; inline
982 GENERIC: sum ( seq -- n )
983 M: object sum 0 [ + ] binary-reduce ; inline
985 : product ( seq -- n ) 1 [ * ] binary-reduce ;
987 : infimum ( seq -- n ) [ ] [ min ] map-reduce ;
989 : supremum ( seq -- n ) [ ] [ max ] map-reduce ;
991 : map-sum ( ... seq quot: ( ... elt -- ... n ) -- ... n )
992 [ 0 ] 2dip [ dip + ] curry [ swap ] prepose each ; inline
994 : count ( ... seq quot: ( ... elt -- ... ? ) -- ... n )
995 [ 1 0 ? ] compose map-sum ; inline
997 : cartesian-each ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... ) -- ... )
998 [ with each ] 2curry each ; inline
1000 : cartesian-map ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... newelt ) -- ... newseq )
1001 [ with map ] 2curry map ; inline
1003 : cartesian-product ( seq1 seq2 -- newseq )
1004 [ { } 2sequence ] cartesian-map ;
1006 ! We hand-optimize flip to such a degree because type hints
1007 ! cannot express that an array is an array of arrays yet, and
1008 ! this word happens to be performance-critical since the compiler
1009 ! itself uses it. Optimizing it like this reduced compile time.
1012 : generic-flip ( matrix -- newmatrix )
1014 [ first-unsafe length 1 ] keep
1015 [ length min ] (each) (each-integer) iota
1017 [ [ nth-unsafe ] with { } map-as ] curry { } map-as ; inline
1021 : array-length ( array -- len )
1022 { array } declare length>> ; inline
1024 : array-flip ( matrix -- newmatrix )
1027 [ first-unsafe array-length 1 ] keep
1028 [ array-length min ] (each) (each-integer) iota
1030 [ [ { array } declare array-nth ] with { } map-as ] curry { } map-as ;
1034 : flip ( matrix -- newmatrix )
1038 [ array-flip ] [ generic-flip ] if
1039 ] [ generic-flip ] if