1 USING: accessors arrays assocs combinators generalizations
2 grouping growable heaps kernel math math.order ranges sequences
3 sequences.private shuffle sorting splitting vectors ;
6 : find-all ( ... seq quot: ( ... elt -- ... ? ) -- ... elts )
7 [ <enumerated> ] dip '[ nip @ ] assoc-filter ; inline
9 : reduce-from ( ... seq identity quot: ( ... prev elt -- ... next ) i -- ... result )
10 [ swap ] 2dip each-from ; inline
12 : 2reduce-from ( ... seq1 seq2 identity quot: ( ... prev elt1 elt2 -- ... next ) i -- ... result )
13 [ -rot ] 2dip 2each-from ; inline
15 :: subseq* ( from to seq -- subseq )
17 from [ dup 0 < [ len + ] when ] [ 0 ] if*
18 to [ dup 0 < [ len + ] when ] [ len ] if*
19 [ 0 len clamp ] bi@ dupd max seq subseq ;
21 : safe-subseq ( from to seq -- subseq )
22 [ length '[ 0 _ clamp ] bi@ ] keep subseq ;
24 : all-subseqs ( seq -- seqs )
25 dup length [1..b] [ clump ] with map concat ;
27 : each-subseq ( ... seq quot: ( ... subseq -- ... ) -- ... )
28 [ dup length [ [0..b] ] [ ] bi ] dip '[
29 dup _ (a..b] [ rot [ subseq _ call ] keep ] with each
32 : map-like ( seq exemplar -- seq' )
33 '[ _ like ] map ; inline
35 : filter-all-subseqs-range ( ... seq range quot: ( ... subseq -- ... ? ) -- seq )
37 '[ <clumps> _ filter ] with map concat
38 ] keepdd map-like ; inline
40 : filter-all-subseqs ( ... seq quot: ( ... subseq -- ... ? ) -- seq )
41 [ dup length [1..b] ] dip filter-all-subseqs-range ; inline
43 :: longest-subseq ( seq1 seq2 -- subseq )
48 len1 1 + [ len2 1 + 0 <array> ] replicate :> table
52 y 1 - seq2 nth-unsafe = [
53 y 1 - x 1 - table nth-unsafe nth-unsafe 1 + :> len
54 len y x table nth-unsafe set-nth-unsafe
55 len n > [ len n! x end! ] when
56 ] [ 0 y x table nth-unsafe set-nth-unsafe ] if
58 ] each end n - end seq1 subseq ;
60 : pad-longest ( seq1 seq2 elt -- seq1 seq2 )
61 [ 2dup max-length ] dip [ pad-tail ] 2curry bi@ ;
63 : pad-center ( seq n elt -- padded )
64 swap pick length [-] [ drop ] [
65 [ 2/ ] [ over - ] bi rot '[ _ <repetition> ] bi@
69 : change-nths ( ... indices seq quot: ( ... elt -- ... elt' ) -- ... )
70 [ change-nth ] 2curry each ; inline
72 : push-if-index ( ..a elt i quot: ( ..a elt i -- ..b ? ) accum -- ..b )
73 [ keepd ] dip rot [ push ] [ 2drop ] if ; inline
75 : push-if* ( ..a elt quot: ( ..a elt -- ..b obj/f ) accum -- ..b )
76 [ call ] dip [ push ] [ drop ] if* ; inline
78 : push? ( elt/f accum -- )
79 over [ push ] [ 2drop ] if ; inline
83 : (index-selector-as) ( quot length exampler -- selector accum )
84 new-resizable [ [ push-if-index ] 2curry ] keep ; inline
86 : (selector-as*) ( quot length exemplar -- selector accum )
87 new-resizable [ [ push-if* ] 2curry ] keep ; inline
91 : index-selector-as ( quot exemplar -- selector accum )
92 [ length ] keep (index-selector-as) ; inline
94 : index-selector ( quot -- selector accum )
95 V{ } index-selector-as ; inline
97 : selector-as* ( quot exemplar -- selector accum )
98 [ length ] keep (selector-as*) ; inline
100 : selector* ( quot -- selector accum ) V{ } selector-as* ; inline
102 : filter-index-as ( ... seq quot: ( ... elt i -- ... ? ) exemplar -- ... seq' )
103 pick length over [ (index-selector-as) [ each-index ] dip ] 2curry dip like ; inline
105 : filter-index ( ... seq quot: ( ... elt i -- ... ? ) -- ... seq' )
106 over filter-index-as ; inline
108 : even-indices ( seq -- seq' )
109 [ length 1 + 2/ ] keep [
110 [ [ 2 * ] dip nth-unsafe ] curry
111 ] keep map-integers-as ;
113 : odd-indices ( seq -- seq' )
115 [ [ 2 * 1 + ] dip nth-unsafe ] curry
116 ] keep map-integers-as ;
118 : compact ( ... seq quot: ( ... elt -- ... ? ) elt -- ... seq' )
119 [ split-when harvest ] dip join ; inline
121 : collapse ( ... seq quot: ( ... elt -- ... ? ) elt -- ... seq' )
123 [ [ harvest ] dip join ]
124 [ [ first empty? ] dip [ prepend ] curry when ]
125 [ [ last empty? ] dip [ append ] curry when ]
128 :: slice-when ( seq quot: ( elt -- ? ) -- seq' )
131 dup seq quot find-from drop
132 [ 2dup = [ 1 + ] when ] [ len ] if*
133 [ seq <slice> ] keep len or swap
134 ] produce nip ; inline
136 : ?<slice> ( from/f to/f sequence -- slice )
137 [ [ 0 ] unless* ] 2dip
138 over [ nip [ length ] [ ] bi ] unless
141 : sequence>slice ( sequence -- slice )
142 [ drop 0 ] [ length ] [ ] tri <slice> ; inline
144 : slice-order-by-from ( slice1 slice2 -- slice-lt slice-gt )
145 2dup [ from>> ] bi@ > [ swap ] when ; inline
147 : ordered-slices-range ( slice-lt slice-gt -- to from )
148 [ to>> ] [ from>> ] bi* ;
150 : unordered-slices-range ( slice1 slice2 -- to from )
151 slice-order-by-from ordered-slices-range ;
153 : ordered-slices-overlap? ( slice-lt slice-gt -- ? )
154 ordered-slices-range > ; inline
156 : unordered-slices-overlap? ( slice1 slice2 -- ? )
157 unordered-slices-range > ; inline
159 : slices-overlap? ( slice1 slice2 -- ? )
160 unordered-slices-overlap? ;
162 : ordered-slices-touch? ( slice-lt slice-gt -- ? )
163 ordered-slices-range >= ; inline
165 : unordered-slices-touch? ( slice1 slice2 -- ? )
166 unordered-slices-range >= ; inline
168 : slices-touch? ( slice1 slice2 -- ? )
169 unordered-slices-touch? ;
171 ERROR: slices-don't-touch slice1 slice2 ;
173 : merge-slices ( slice1 slice2 -- slice/* )
175 2dup ordered-slices-touch? [
176 [ from>> ] [ [ to>> ] [ seq>> ] bi ] bi* <slice>
181 : rotate ( seq n -- seq' )
182 over length mod dup 0 >= [ cut ] [ abs cut* ] if prepend ;
184 ERROR: underlying-mismatch slice1 slice2 ;
186 : ensure-same-underlying ( slice1 slice2 -- slice1 slice2 )
187 2dup [ seq>> ] bi@ eq? [ underlying-mismatch ] unless ;
189 : span-slices ( slice1 slice2 -- slice )
190 ensure-same-underlying
191 [ [ from>> ] bi@ min ]
193 [ drop seq>> ] 2tri <slice> ;
195 : ?span-slices ( slice1/f slice2/f -- slice )
196 2dup and [ span-slices ] [ or ] if ;
198 :: rotate! ( seq n -- )
200 n len mod dup 0 < [ len + ] when seq bounds-check drop 0 over
202 [ seq exchange-unsafe ] [ [ 1 + ] bi@ ] 2bi
203 dup len = [ drop over ] when
204 2over = [ -rot nip over ] when
207 : all-rotations ( seq -- seq' )
208 dup length <iota> [ rotate ] with map ;
212 : (appender-for) ( quot length exemplar -- appender accum )
213 new-resizable [ [ push-all ] curry compose ] keep ; inline
217 : appender-for ( quot exemplar -- appender accum )
218 [ length ] keep (appender-for) ; inline
220 : appender ( quot -- appender accum )
221 V{ } appender-for ; inline
223 : map-concat-as ( ... seq quot: ( ... elt -- ... newelt ) exemplar -- ... newseq )
224 [ appender-for [ each ] dip ] keep like ; inline
226 : >resizable ( seq -- accum ) ! fixes map-concat "cannot apply call to run-time..."
227 [ length ] keep [ new-resizable ] [ append! ] bi ;
229 : map-concat ( ... seq quot: ( ... elt -- ... newelt ) -- ... newseq )
230 over empty? [ 2drop { } ] [
231 [ [ first ] dip call ] 2keep rot [
232 >resizable [ '[ @ _ push-all ] 1 each-from ] keep
236 : map-filter-as ( ... seq map-quot: ( ... elt -- ... newelt ) filter-quot: ( ... newelt -- ... ? ) exemplar -- ... subseq )
238 [ (selector-as) [ compose each ] dip ] 2curry dip like ; inline
240 : map-filter ( ... seq map-quot: ( ... elt -- ... newelt ) filter-quot: ( ... newelt -- ... ? ) -- ... subseq )
241 pick map-filter-as ; inline
243 : map-sift ( ... seq quot: ( ... elt -- ... newelt ) -- ... newseq )
244 [ ] map-filter ; inline
246 : map-harvest ( ... seq quot: ( ... elt -- ... newelt ) -- ... newseq )
247 [ empty? not ] map-filter ; inline
249 : (each-integer-with-previous) ( ... prev i n quot: ( ... i -- ... ) -- ... )
251 [ nip call ] 4keep nipdd
252 [ 1 + ] 2dip (each-integer-with-previous)
255 ] if ; inline recursive
257 : each-integer-with-previous ( ... n quot: ( ... i -- ... ) -- ... )
258 [ f 0 ] 2dip (each-integer-with-previous) ; inline
260 : (collect-with-previous) ( quot into -- quot' )
261 [ [ keep ] dip [ set-nth-unsafe ] keepdd ] 2curry ; inline
263 : collect-with-previous ( n quot into -- )
264 (collect-with-previous) each-integer-with-previous ; inline
266 : map-integers-with ( ... len quot: ( ... prev i -- ... elt ) exemplar -- ... newseq )
267 overd [ [ collect-with-previous ] keep ] new-like ; inline
269 : map-with-previous-as ( ... seq quot: ( ... elt prev/f -- ... newelt ) exemplar -- ... newseq )
270 [ length-operator ] dip map-integers-with ; inline
272 : map-with-previous ( ... seq quot: ( ... elt prev/f -- ... newelt ) -- ... newseq )
273 over map-with-previous-as ; inline
277 : (setup-each-from) ( i seq -- n quot )
278 [ length over [-] swap ] keep '[ _ + _ nth-unsafe ] ; inline
280 : setup-each-from ( i seq quot -- n quot' )
281 [ (setup-each-from) ] dip compose ; inline
285 : map-from-as ( ... seq quot: ( ... elt -- ... newelt ) i exemplar -- ... newseq )
286 [ -rot setup-each-from ] dip map-integers-as ; inline
288 : map-from ( ... seq quot: ( ... elt -- ... newelt ) i -- ... newseq )
289 pick map-from-as ; inline
291 : map-if ( ... seq if-quot: ( ... elt -- ... ? ) map-quot: ( ... elt -- ... newelt ) -- ... newseq )
292 '[ dup @ _ when ] map ; inline
296 : push-map-if ( ..a elt filter-quot: ( ..a elt -- ..b ? ) map-quot: ( ..a elt -- ..b newelt ) accum -- ..b )
297 [ keep over ] 2dip [ when ] dip rot [ push ] [ 2drop ] if ; inline
299 : (filter-mapper-for) ( filter-quot map-quot length exempler -- filter-mapper accum )
300 new-resizable [ [ push-map-if ] 3curry ] keep ; inline
302 : filter-mapper-for ( filter-quot map-quot exemplar -- filter-mapper accum )
303 [ length ] keep (filter-mapper-for) ; inline
305 : filter-mapper ( filter-quot map-quot -- filter-mapper accum )
306 V{ } filter-mapper-for ; inline
310 : filter-map-as ( ... seq filter-quot: ( ... elt -- ... ? ) map-quot: ( ... elt -- ... newelt ) exemplar -- ... newseq )
312 [ (filter-mapper-for) [ each ] dip ] 2curry dip like ; inline
314 : filter-map ( ... seq filter-quot: ( ... elt -- ... ? ) map-quot: ( ... elt -- ... newelt ) -- ... newseq )
315 pick filter-map-as ; inline
317 : 2map-sum ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... n ) -- ... n )
318 [ 0 ] 3dip [ dip + ] curry [ rot ] prepose 2each ; inline
320 : 2count ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... ? ) -- ... n )
321 [ 1 0 ? ] compose 2map-sum ; inline
324 ( ... seq1 seq2 seq3 quot: ( ... elt1 elt2 elt3 -- ... ) i -- ... )
325 [ 3length-operator ] dip -rot each-integer-from ; inline
328 ( ..a seq1 seq2 seq3 map-quot: ( ..a elt1 elt2 elt3 -- ..b intermediate ) reduce-quot: ( ..b prev intermediate -- ..a next ) -- ..a result )
329 [ [ [ [ first ] tri@ ] 3keep ] dip [ 3dip ] keep ] dip compose 1 3each-from ; inline
331 : round-robin ( seq -- newseq )
333 [ longest length <iota> ] keep
334 [ [ ?nth ] with map ] curry map concat sift
337 : sift-as ( seq exemplar -- newseq )
340 : sift! ( seq -- newseq )
343 : harvest-as ( seq exemplar -- newseq )
344 [ empty? not ] swap filter-as ;
346 : harvest! ( seq -- newseq )
349 : head-as ( seq n exemplar -- seq' )
350 [ head-slice ] [ like ] bi* ; inline
352 : head*-as ( seq n exemplar -- seq' )
353 [ head-slice* ] [ like ] bi* ; inline
355 : tail-as ( seq n exemplar -- seq' )
356 [ tail-slice ] [ like ] bi* ; inline
358 : tail*-as ( seq n exemplar -- seq' )
359 [ tail-slice* ] [ like ] bi* ; inline
361 : trim-as ( ... seq quot: ( ... elt -- ... ? ) exemplar -- ... newseq )
362 [ trim-slice ] [ like ] bi* ; inline
364 : ?trim ( seq quot: ( elt -- ? ) -- seq/newseq )
365 over empty? [ drop ] [
366 over [ first-unsafe ] [ last-unsafe ] bi pick either?
370 : ?trim-head ( seq quot: ( elt -- ? ) -- seq/newseq )
371 over empty? [ drop ] [
372 over first-unsafe over call
373 [ trim-head ] [ drop ] if
376 : ?trim-tail ( seq quot: ( elt -- ? ) -- seq/newseq )
377 over empty? [ drop ] [
378 over last-unsafe over call
379 [ trim-tail ] [ drop ] if
382 : unsurround ( newseq seq2 seq3 -- seq1 )
383 [ ?head drop ] [ ?tail drop ] bi* ;
385 : >string-list ( seq -- seq' )
386 [ "\"" 1surround ] map "," join ;
388 : with-string-lines ( str quot -- str' )
389 [ string-lines ] dip map "\n" join ; inline
391 : prepend-lines-with-spaces ( str -- str' )
392 [ " " prepend ] with-string-lines ;
394 : one? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? )
396 [ 1 + ] 2dip find-from drop not
397 ] [ 3drop f ] if ; inline
399 : map-index! ( ... seq quot: ( ... elt index -- ... newelt ) -- ... seq )
400 over [ [ sequence-index-operator ] dip collect ] keep ; inline
404 : 2sequence-index-iterator ( seq1 seq2 quot -- n quot' )
405 [ 2length-iterator [ keep ] curry ] dip compose ; inline
409 : 2each-index ( ... seq1 seq2 quot: ( ... elt1 elt2 index -- ... ) -- ... )
410 2sequence-index-iterator each-integer ; inline
412 : 2map-into ( seq1 seq2 quot into -- )
413 [ 2length-operator ] dip collect ; inline
415 : 2map! ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... newelt ) -- ... seq1 )
416 pick [ 2map-into ] keep ; inline
418 : 2map-index ( ... seq1 seq2 quot: ( ... elt1 elt2 index -- ... newelt ) -- ... newseq )
419 pick [ 2sequence-index-iterator ] dip map-integers-as ; inline
421 TUPLE: evens { seq read-only } ;
425 M: evens length seq>> length 1 + 2/ ; inline
427 M: evens virtual@ [ 2 * ] [ seq>> ] bi* ; inline
429 M: evens virtual-exemplar seq>> ; inline
431 INSTANCE: evens virtual-sequence
433 TUPLE: odds { seq read-only } ;
437 M: odds length seq>> length 2/ ; inline
439 M: odds virtual@ [ 2 * 1 + ] [ seq>> ] bi* ; inline
441 M: odds virtual-exemplar seq>> ; inline
443 INSTANCE: odds virtual-sequence
445 : until-empty ( seq quot -- )
446 [ dup empty? ] swap until drop ; inline
450 : push-index-if ( ..a elt i quot: ( ..a elt -- ..b ? ) accum -- ..b )
451 [ dip ] dip rot [ push ] [ 2drop ] if ; inline
455 : arg-where ( ... seq quot: ( ... elt -- ... ? ) -- ... indices )
456 over length <vector> [
457 [ push-index-if ] 2curry each-index
460 : arg-sort ( seq -- indices )
461 zip-index sort-keys values ;
463 : first= ( seq elt -- ? ) [ first ] dip = ; inline
464 : second= ( seq elt -- ? ) [ second ] dip = ; inline
465 : third= ( seq elt -- ? ) [ third ] dip = ; inline
466 : fourth= ( seq elt -- ? ) [ fourth ] dip = ; inline
467 : last= ( seq elt -- ? ) [ last ] dip = ; inline
468 : nth= ( n seq elt -- ? ) [ nth ] dip = ; inline
470 : first? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ first ] dip call ; inline
471 : second? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ second ] dip call ; inline
472 : third? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ third ] dip call ; inline
473 : fourth? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ fourth ] dip call ; inline
474 : last? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ last ] dip call ; inline
475 : nth? ( ... n seq quot: ( ... elt -- ... ? ) -- ... ? ) [ nth ] dip call ; inline
477 : loop>sequence** ( ... quot: ( ... -- ... obj ? ) exemplar -- ... seq )
478 [ ] swap produce-as nip ; inline
480 : loop>array** ( ... quot: ( ... -- ... obj ? ) -- ... array )
481 { } loop>sequence** ; inline
483 : loop>sequence* ( ... quot: ( ... -- ... obj ? ) exemplar -- ... seq )
484 [ t ] [ '[ [ _ dip ] [ f f f ] if* ] [ swap ] ] [ produce-as 2nip ] tri* ; inline
486 : loop>array* ( ... quot: ( ... -- ... obj ? ) -- ... array )
487 { } loop>sequence* ; inline
489 : loop>sequence ( ... quot: ( ... -- ... obj/f ) exemplar -- ... seq )
490 [ [ dup ] compose [ ] ] dip produce-as nip ; inline
492 : loop>array ( ... quot: ( ... -- ... obj/f ) -- ... array )
493 { } loop>sequence ; inline
495 : zero-loop>sequence ( ... quot: ( ... n -- ... obj/f ) exemplar -- ... seq )
496 [ 0 ] [ '[ _ keep 1 + swap ] ] [ loop>sequence ] tri* nip ; inline
498 : zero-loop>array ( quot: ( ..a n -- ..a obj ) -- seq )
499 { } zero-loop>sequence ; inline
501 : iterate-heap-while ( heap quot1: ( value key -- slurp? ) quot2: ( value key -- obj/f ) -- obj/f loop? )
505 [ [ heap-peek ] 2dip drop 2keep ]
507 nip ! ( pop? value key heap quot2 )
509 swap heap-pop* call( value key -- obj/f ) t
516 : slurp-heap-while-map ( heap quot1: ( value key -- slurp? ) quot2: ( value key -- obj/f ) -- seq )
517 '[ _ _ _ iterate-heap-while ] loop>array* ; inline
519 : heap>pairs ( heap -- pairs )
520 [ 2drop t ] [ swap 2array ] slurp-heap-while-map ;
522 : map-zip-swap ( quot: ( x -- y ) -- alist )
523 '[ _ keep ] map>alist ; inline
525 : ?heap-pop-value>array ( heap -- array )
526 dup heap-empty? [ drop { } ] [ heap-pop drop 1array ] if ;
530 : (reverse) ( seq -- newseq )
531 dup [ length ] keep new-sequence
532 [ 0 swap copy-unsafe ] keep reverse! ;
536 : reverse-as ( seq exemplar -- newseq )
537 [ (reverse) ] [ like ] bi* ;
539 : map-product ( ... seq quot: ( ... elt -- ... n ) -- ... n )
540 [ 1 ] 2dip [ dip * ] with-assoc each ; inline
542 : insert-nth! ( elt n seq -- )
543 [ length ] keep ensure swap pick (a..b]
544 over '[ [ 1 + ] keep _ move-unsafe ] each
547 : set-nths ( value indices seq -- )
548 swapd '[ _ swap _ set-nth ] each ; inline
550 : set-nths-unsafe ( value indices seq -- )
551 swapd '[ _ swap _ set-nth-unsafe ] each ; inline
555 : (map-find-index) ( seq quot find-quot -- result i elt )
556 [ [ f ] 2dip [ [ nip ] 2dip call dup ] curry ] dip call
557 [ [ [ drop f ] unless ] keep ] dip ; inline
561 : map-find-index ( ... seq quot: ( ... elt index -- ... result/f ) -- ... result i elt )
562 [ find-index ] (map-find-index) ; inline
564 : filter-length ( seq n -- seq' ) '[ length _ = ] filter ;
566 : all-shortest ( seqs -- seqs' ) dup shortest length filter-length ;
568 : all-longest ( seqs -- seqs' ) dup longest length filter-length ;
570 : remove-first ( obj seq -- seq' )
571 [ index ] keep over [ remove-nth ] [ nip ] if ;
573 : remove-first! ( obj seq -- seq )
574 [ index ] keep over [ remove-nth! ] [ nip ] if ;
576 : remove-last ( obj seq -- seq' )
577 [ last-index ] keep over [ remove-nth ] [ nip ] if ;
579 : remove-last! ( obj seq -- seq )
580 [ last-index ] keep over [ remove-nth! ] [ nip ] if ;
582 : ?first2 ( seq -- first/f second/f )
585 { 1 [ first-unsafe f ] }
586 [ drop first2-unsafe ]
589 : ?first3 ( seq -- first/f second/f third/f )
592 { 1 [ first-unsafe f f ] }
593 { 2 [ first2-unsafe f ] }
594 [ drop first3-unsafe ]
597 : ?first4 ( seq -- first/f second/f third/f fourth/f )
599 { 0 [ drop f f f f ] }
600 { 1 [ first-unsafe f f f ] }
601 { 2 [ first2-unsafe f f ] }
602 { 3 [ first3-unsafe f ] }
603 [ drop first4-unsafe ]
606 : cut-when ( ... seq quot: ( ... elt -- ... ? ) -- ... before after )
607 [ find drop ] keepd swap
608 [ cut ] [ f over like ] if* ; inline
610 : nth* ( n seq -- elt )
611 [ length 1 - swap - ] [ nth ] bi ; inline
613 : each-index-from ( ... seq quot: ( ... elt index -- ... ) i -- ... )
614 -rot sequence-index-operator each-integer-from ; inline
618 : select-by* ( ... seq quot: ( ... elt -- ... x ) compare: ( obj1 obj2 -- ? ) -- ... i elt )
620 [ keep swap ] curry [ dip ] curry
621 [ [ first 0 ] dip call ] 2keep
622 [ 2curry 3dip 5 npick pick ] curry
624 [ [ 3drop ] [ [ 3drop ] 3dip ] if ] compose
625 ] bi* compose 1 each-index-from nip swap ; inline
629 : supremum-by* ( ... seq quot: ( ... elt -- ... x ) -- ... i elt )
630 [ after? ] select-by* ; inline
632 : infimum-by* ( ... seq quot: ( ... elt -- ... x ) -- ... i elt )
633 [ before? ] select-by* ; inline
635 : arg-max ( seq -- n )
636 [ ] supremum-by* drop ;
638 : arg-min ( seq -- n )
639 [ ] infimum-by* drop ;
641 : ?supremum ( seq/f -- elt/f )
643 [ ] [ 2dup and [ max ] [ dupd ? ] if ] map-reduce
646 : ?infimum ( seq/f -- elt/f )
648 [ ] [ 2dup and [ min ] [ dupd ? ] if ] map-reduce
651 : map-infimum ( seq quot: ( ... elt -- ... elt' ) -- elt' )
652 [ min ] map-reduce ; inline
654 : map-supremum ( seq quot: ( ... elt -- ... elt' ) -- elt' )
655 [ max ] map-reduce ; inline
657 : change-last ( seq quot -- )
658 [ index-of-last ] [ change-nth ] bi* ; inline
660 : change-last-unsafe ( seq quot -- )
661 [ index-of-last ] [ change-nth-unsafe ] bi* ; inline
663 : replicate-into ( ... seq quot: ( ... -- ... newelt ) -- ... )
664 over [ length ] 2dip '[ _ dip _ set-nth-unsafe ] each-integer ; inline
666 : count* ( ... seq quot: ( ... elt -- ... ? ) -- ... % )
667 over [ count ] [ length ] bi* / ; inline
669 : sequence-index-operator-last ( n seq quot -- n quot' )
670 [ [ nth-unsafe ] curry [ keep ] curry ] dip compose ; inline
672 : find-last-index-from ( ... n seq quot: ( ... elt i -- ... ? ) -- ... i elt )
674 _ [ sequence-index-operator-last find-last-integer ] keepd
676 ] bounds-check-call ; inline
678 : find-last-index ( ... seq quot: ( ... elt i -- ... ? ) -- ... i elt )
679 [ index-of-last ] dip find-last-index-from ; inline
681 : map-find-last-index ( ... seq quot: ( ... elt index -- ... result/f ) -- ... result i elt )
682 [ find-last-index ] (map-find-index) ; inline
684 :: (start-all) ( seq subseq increment -- indices )
686 [ seq subseq subseq-index-from dup ]
687 [ [ increment + ] keep ] produce nip ;
689 : start-all ( seq subseq -- indices )
690 dup length (start-all) ; inline
692 : start-all* ( seq subseq -- indices )
693 1 (start-all) ; inline
695 : count-subseq ( seq subseq -- n )
696 start-all length ; inline
698 : count-subseq* ( seq subseq -- n )
699 start-all* length ; inline
701 : assoc-zip-with ( quot: ( key value -- calc ) -- alist )
702 '[ _ 2keep 2array swap ] assoc-map ; inline
704 : take-while ( ... seq quot: ( ... elt -- ... ? ) -- head-slice )
705 [ '[ @ not ] find drop ] keepd swap
706 [ dup length ] unless* head-slice ; inline
708 : drop-while ( ... seq quot: ( ... elt -- ... ? ) -- tail-slice )
709 [ '[ @ not ] find drop ] keepd swap
710 [ dup length ] unless* tail-slice ; inline
712 : count-head ( seq quot -- n )
713 [ not ] compose [ find drop ] keepd length or ; inline
715 : count-tail ( seq quot -- n )
716 [ not ] compose [ find-last drop ] keepd
717 length swap [ - 1 - ] when* ; inline
719 :: shorten* ( vector n -- seq )
723 :: interleaved-as ( seq glue exemplar -- newseq )
724 seq length dup 1 - + 0 max exemplar new-sequence :> newseq
725 seq [ 2 * newseq set-nth-unsafe ] each-index
726 seq length 1 - [ 2 * 1 + glue swap newseq set-nth-unsafe ] each-integer
729 : interleaved ( seq glue -- newseq )
730 over interleaved-as ;
732 : extract! ( ... seq quot: ( ... elt -- ... ? ) -- ... seq )
733 [ dup ] compose over [ length ] keep new-resizable
734 [ [ push-when ] 2curry reject! ] keep swap like ; inline
736 : find-pred-loop ( ... i n seq quot: ( ... elt -- ... calc ? ) -- ... calc/f i/f elt/f )
740 [ [ 3drop ] 2dip rot ]
741 [ 2drop [ 1 + ] 3dip find-pred-loop ] if
744 ] if ; inline recursive
746 : find-pred ( ... seq quot: ( ... elt -- ... calc ) pred: ( ... calc -- ... ? ) -- ... calc/f i/f elt/f )
748 [ [ length check-length ] keep ] 2dip
749 '[ nth-unsafe _ keep swap _ keep swap ] find-pred-loop swapd ; inline
751 ! https://en.wikipedia.org/wiki/Maximum_subarray_problem
752 ! Kadane's algorithm O(n) largest sum in subarray
753 : max-subarray-sum ( seq -- sum )
755 [ [ + ] keep max [ max ] keep ] each drop ;
758 { from integer read-only initial: 0 }
759 { to integer read-only initial: 0 }
761 { step integer read-only } ;
763 :: <step-slice> ( from/f to/f step seq -- step-slice )
764 step zero? [ "can't be zero" throw ] when
770 from/f [ len ] unless*
773 [ dup 0 < [ len + ] when 0 len clamp ] bi@
774 ! FIXME: make this work with steps
775 seq dup slice? [ collapse-slice ] when
776 step step-slice boa ;
778 M: step-slice virtual-exemplar seq>> ; inline
780 M: step-slice virtual@
781 [ step>> * ] [ from>> + ] [ seq>> ] tri ; inline
784 [ to>> ] [ from>> - ] [ step>> ] tri
785 dup 0 < [ [ neg 0 max ] dip neg ] when /mod
786 zero? [ 1 + ] unless ; inline
788 INSTANCE: step-slice virtual-sequence
790 : 2nested-each* ( seq1 seq-quot: ( n -- seq ) quot: ( a b -- ) -- )
792 _ keep swap _ with each
795 : 2nested-filter-as* ( seq1 seq-quot quot exemplar -- seq )
796 [ 2over [ length ] bi@ * ] dip
799 [ [ push? ] curry compose 2nested-each* ] keep
802 : 2nested-filter* ( seq1 seq-quot quot -- seq )
803 pick 2nested-filter-as* ; inline
805 : 2nested-map-as* ( seq1 seq-quot quot exemplar -- seq )
806 [ 2over [ length ] bi@ * ] dip
809 [ [ push ] curry compose 2nested-each* ] keep
812 : 2nested-map* ( seq1 seq-quot quot -- seq )
813 pick 2nested-map-as* ; inline
816 : 2nested-each ( seq1 seq2 quot -- )
821 : 2nested-filter-as ( seq1 seq2 quot exemplar -- seq )
822 [ 2over [ length ] bi@ * ] dip
825 [ [ push? ] curry compose 2nested-each ] keep
828 : 2nested-filter ( seq1 seq2 quot -- seq )
829 pick 2nested-filter-as ; inline
831 : 2nested-map-as ( seq1 seq2 quot exemplar -- seq )
832 [ 2over [ length ] bi@ * ] dip
835 [ [ push ] curry compose 2nested-each ] keep
838 : 2nested-map ( seq1 seq2 quot -- seq )
839 pick 2nested-map-as ; inline
841 : 3nested-each ( seq1 seq2 seq3 quot -- )
844 swap _ with with each
846 ] with with each ; inline
848 : 3nested-filter-as ( seq1 seq2 seq3 quot exemplar -- seq )
849 [ 3 nover [ length ] tri@ * * ] dip
852 [ [ push? ] curry compose 3nested-each ] keep
855 : 3nested-filter ( seq1 seq2 seq3 quot -- seq )
856 reach 3nested-filter-as ; inline
858 : 3nested-map-as ( seq1 seq2 seq3 quot exemplar -- seq )
859 [ 3 nover [ length ] tri@ * * ] dip
862 [ [ push ] curry compose 3nested-each ] keep
865 : 3nested-map ( seq1 seq2 seq3 quot -- seq )
866 reach 3nested-map-as ; inline
868 : prev ( n seq -- obj ) [ 1 - ] dip nth ; inline
869 : ?prev ( n seq -- obj/f ) [ 1 - ] dip ?nth ; inline
870 : ??prev ( n seq -- obj/f ? ) [ 1 - ] dip ??nth ; inline
871 : prev-of ( seq n -- obj ) 1 - nth-of ; inline
872 : ?prev-of ( seq n -- obj/f ) 1 - ?nth-of ; inline
873 : ??prev-of ( seq n -- obj/f ? ) 1 - ??nth-of ; inline
875 : prev-identity ( i seq -- identity i seq )
876 2dup ??prev [ drop 0 ] unless -rot ; inline
878 : each-prior-identity-from ( ... identity i seq quot: ( ... prior elt -- ... ) -- ... )
880 length-operator each-integer-from drop ; inline
882 : each-prior-from ( ... i seq quot: ( ... prior elt -- ... ) -- ... )
883 [ prev-identity ] dip each-prior-identity-from ; inline
885 : each-prior ( ... seq quot: ( ... prior elt -- ... ) -- ... )
886 0 -rot each-prior-from ; inline
888 : map-prior-identity-from-as ( ... identity i seq quot: ( ... prior elt -- elt' ) exemplar -- seq' )
890 '[ [ swap @ ] keep swap ] length-operator
891 ] dip map-integers-from-as nip ; inline
893 : map-prior-identity-as ( ... identity seq quot: ( ... prior elt -- elt' ) exemplar -- seq' )
894 [ 0 ] 3dip map-prior-identity-from-as ; inline
896 : map-prior-from-as ( ... i seq quot: ( ... prior elt -- elt' ) exemplar -- seq' )
897 [ prev-identity ] 2dip map-prior-identity-from-as ; inline
899 : map-prior-as ( ... seq quot: ( ... prior elt -- elt' ) exemplar -- seq' )
900 0 -roll map-prior-from-as ; inline
902 : map-prior-from ( ... i seq quot: ( ... prior elt -- elt' ) -- seq' )
903 over map-prior-from-as ; inline
905 : map-prior ( ... seq quot: ( ... prior elt -- elt' ) -- seq' )
906 over map-prior-as ; inline
908 TUPLE: virtual-zip-index seq ;
910 C: <zip-index> virtual-zip-index
912 M: virtual-zip-index length seq>> length ; inline
914 M: virtual-zip-index nth-unsafe
915 over [ seq>> nth-unsafe ] [ 2array ] bi* ; inline
917 INSTANCE: virtual-zip-index immutable-sequence
919 : nth-index ( n obj seq -- i )
920 [ = dup [ drop 1 - dup 0 < ] when ] with find drop nip ;