1 USING: accessors arrays assocs assocs.extras combinators
2 generalizations grouping growable hash-sets heaps kernel math
3 math.order ranges sequences sequences.private sets shuffle
4 sorting splitting vectors ;
7 : find-all ( ... seq quot: ( ... elt -- ... ? ) -- ... elts )
8 [ <enumerated> ] dip '[ nip @ ] assoc-filter ; inline
10 :: subseq* ( from to seq -- subseq )
12 from [ dup 0 < [ len + ] when ] [ 0 ] if*
13 to [ dup 0 < [ len + ] when ] [ len ] if*
14 [ 0 len clamp ] bi@ dupd max seq subseq ;
16 : safe-subseq ( from to seq -- subseq )
17 [ length '[ 0 _ clamp ] bi@ ] keep subseq ;
19 : all-subseqs ( seq -- seqs )
20 dup length [1..b] [ clump ] with map concat ;
22 : each-subseq ( ... seq quot: ( ... subseq -- ... ) -- ... )
23 [ dup length [ [0..b] ] [ ] bi ] dip '[
24 dup _ (a..b] [ rot [ subseq _ call ] keep ] with each
27 : map-like ( seq exemplar -- seq' )
28 '[ _ like ] map ; inline
30 : filter-all-subseqs-range ( ... seq range quot: ( ... subseq -- ... ? ) -- seq )
32 '[ <clumps> _ filter ] with map concat
33 ] keepdd map-like ; inline
35 : filter-all-subseqs ( ... seq quot: ( ... subseq -- ... ? ) -- seq )
36 [ dup length [1..b] ] dip filter-all-subseqs-range ; inline
38 :: longest-subseq ( seq1 seq2 -- subseq )
43 len1 1 + [ len2 1 + 0 <array> ] replicate :> table
47 y 1 - seq2 nth-unsafe = [
48 y 1 - x 1 - table nth-unsafe nth-unsafe 1 + :> len
49 len y x table nth-unsafe set-nth-unsafe
50 len n > [ len n! x end! ] when
51 ] [ 0 y x table nth-unsafe set-nth-unsafe ] if
53 ] each end n - end seq1 subseq ;
55 : mismatch-last ( seq1 seq2 -- i-back )
56 [ <reversed> ] bi@ mismatch ; inline
58 : pad-longest ( seq1 seq2 elt -- seq1 seq2 )
59 [ 2dup max-length ] dip [ pad-tail ] 2curry bi@ ;
61 : pad-center ( seq n elt -- padded )
62 swap pick length [-] [ drop ] [
63 [ 2/ ] [ over - ] bi rot '[ _ <repetition> ] bi@
67 : zip-longest-with ( seq1 seq2 fill -- assoc )
70 : zip-longest ( seq1 seq2 -- assoc )
73 : change-nths ( ... indices seq quot: ( ... elt -- ... elt' ) -- ... )
74 [ change-nth ] 2curry each ; inline
76 : push-if-index ( ..a elt i quot: ( ..a elt i -- ..b ? ) accum -- ..b )
77 [ keepd ] dip rot [ push ] [ 2drop ] if ; inline
79 : push-if* ( ..a elt quot: ( ..a elt -- ..b obj/f ) accum -- ..b )
80 [ call ] dip [ push ] [ drop ] if* ; inline
82 : maybe-push ( elt/f accum -- )
83 over [ push ] [ 2drop ] if ; inline
87 : (index-selector-as) ( quot length exampler -- selector accum )
88 new-resizable [ [ push-if-index ] 2curry ] keep ; inline
90 : (selector-as*) ( quot length exemplar -- selector accum )
91 new-resizable [ [ push-if* ] 2curry ] keep ; inline
95 : index-selector-as ( quot exemplar -- selector accum )
96 [ length ] keep (index-selector-as) ; inline
98 : index-selector ( quot -- selector accum )
99 V{ } index-selector-as ; inline
101 : selector-as* ( quot exemplar -- selector accum )
102 [ length ] keep (selector-as*) ; inline
104 : selector* ( quot -- selector accum ) V{ } selector-as* ; inline
106 : filter-index-as ( ... seq quot: ( ... elt i -- ... ? ) exemplar -- ... seq' )
107 pick length over [ (index-selector-as) [ each-index ] dip ] 2curry dip like ; inline
109 : filter-index ( ... seq quot: ( ... elt i -- ... ? ) -- ... seq' )
110 over filter-index-as ; inline
112 : even-indices ( seq -- seq' )
113 [ length 1 + 2/ ] keep [
114 [ [ 2 * ] dip nth-unsafe ] curry
115 ] keep map-integers-as ;
117 : odd-indices ( seq -- seq' )
119 [ [ 2 * 1 + ] dip nth-unsafe ] curry
120 ] keep map-integers-as ;
122 : compact ( ... seq quot: ( ... elt -- ... ? ) elt -- ... seq' )
123 [ split-when harvest ] dip join ; inline
125 : collapse ( ... seq quot: ( ... elt -- ... ? ) elt -- ... seq' )
127 [ [ harvest ] dip join ]
128 [ [ first empty? ] dip [ prepend ] curry when ]
129 [ [ last empty? ] dip [ append ] curry when ]
132 :: slice-when ( seq quot: ( elt -- ? ) -- seq' )
135 dup seq quot find-from drop
136 [ 2dup = [ 1 + ] when ] [ len ] if*
137 [ seq <slice> ] keep len or swap
138 ] produce nip ; inline
140 : ?<slice> ( from/f to/f sequence -- slice )
141 [ [ 0 ] unless* ] 2dip
142 over [ nip [ length ] [ ] bi ] unless
145 : sequence>slice ( sequence -- slice )
146 [ drop 0 ] [ length ] [ ] tri <slice> ; inline
148 : slice-order-by-from ( slice1 slice2 -- slice-lt slice-gt )
149 2dup [ from>> ] bi@ > [ swap ] when ; inline
151 : ordered-slices-range ( slice-lt slice-gt -- to from )
152 [ to>> ] [ from>> ] bi* ;
154 : unordered-slices-range ( slice1 slice2 -- to from )
155 slice-order-by-from ordered-slices-range ;
157 : ordered-slices-overlap? ( slice-lt slice-gt -- ? )
158 ordered-slices-range > ; inline
160 : unordered-slices-overlap? ( slice1 slice2 -- ? )
161 unordered-slices-range > ; inline
163 : slices-overlap? ( slice1 slice2 -- ? )
164 unordered-slices-overlap? ;
166 : ordered-slices-touch? ( slice-lt slice-gt -- ? )
167 ordered-slices-range >= ; inline
169 : unordered-slices-touch? ( slice1 slice2 -- ? )
170 unordered-slices-range >= ; inline
172 : slices-touch? ( slice1 slice2 -- ? )
173 unordered-slices-touch? ;
175 ERROR: slices-don't-touch slice1 slice2 ;
177 : merge-slices ( slice1 slice2 -- slice/* )
179 2dup ordered-slices-touch? [
180 [ from>> ] [ [ to>> ] [ seq>> ] bi ] bi* <slice>
185 : rotate ( seq n -- seq' )
186 over length mod dup 0 >= [ cut ] [ abs cut* ] if prepend ;
188 ERROR: underlying-mismatch slice1 slice2 ;
190 : ensure-same-underlying ( slice1 slice2 -- slice1 slice2 )
191 2dup [ seq>> ] bi@ eq? [ underlying-mismatch ] unless ;
193 : span-slices ( slice1 slice2 -- slice )
194 ensure-same-underlying
195 [ [ from>> ] bi@ min ]
197 [ drop seq>> ] 2tri <slice> ;
199 : ?span-slices ( slice1/f slice2/f -- slice )
200 2dup and [ span-slices ] [ or ] if ;
202 :: rotate! ( seq n -- )
204 n len mod dup 0 < [ len + ] when seq bounds-check drop 0 over
206 [ seq exchange-unsafe ] [ [ 1 + ] bi@ ] 2bi
207 dup len = [ drop over ] when
208 2over = [ -rot nip over ] when
211 : all-rotations ( seq -- seq' )
212 dup length <iota> [ rotate ] with map ;
216 : (appender-for) ( quot length exemplar -- appender accum )
217 new-resizable [ [ push-all ] curry compose ] keep ; inline
221 : appender-for ( quot exemplar -- appender accum )
222 [ length ] keep (appender-for) ; inline
224 : appender ( quot -- appender accum )
225 V{ } appender-for ; inline
227 : map-concat-as ( ... seq quot: ( ... elt -- ... newelt ) exemplar -- ... newseq )
228 [ appender-for [ each ] dip ] keep like ; inline
230 : >resizable ( seq -- accum ) ! fixes map-concat "cannot apply call to run-time..."
231 [ length ] keep [ new-resizable ] [ append! ] bi ;
233 : map-concat ( ... seq quot: ( ... elt -- ... newelt ) -- ... newseq )
234 over empty? [ 2drop { } ] [
235 [ [ first ] dip call ] 2keep rot [
236 >resizable [ '[ @ _ push-all ] 1 each-from ] keep
240 : map-filter-as ( ... seq map-quot: ( ... elt -- ... newelt ) filter-quot: ( ... newelt -- ... ? ) exemplar -- ... subseq )
242 [ (selector-as) [ compose each ] dip ] 2curry dip like ; inline
244 : map-filter ( ... seq map-quot: ( ... elt -- ... newelt ) filter-quot: ( ... newelt -- ... ? ) -- ... subseq )
245 pick map-filter-as ; inline
247 : map-sift ( ... seq quot: ( ... elt -- ... newelt ) -- ... newseq )
248 [ ] map-filter ; inline
250 : map-harvest ( ... seq quot: ( ... elt -- ... newelt ) -- ... newseq )
251 [ empty? not ] map-filter ; inline
253 : (each-integer-with-previous) ( ... prev i n quot: ( ... i -- ... ) -- ... )
255 [ nip call ] 4keep nipdd
256 [ 1 + ] 2dip (each-integer-with-previous)
259 ] if ; inline recursive
261 : each-integer-with-previous ( ... n quot: ( ... i -- ... ) -- ... )
262 [ f 0 ] 2dip (each-integer-with-previous) ; inline
264 : (collect-with-previous) ( quot into -- quot' )
265 [ [ keep ] dip [ set-nth-unsafe ] keepdd ] 2curry ; inline
267 : collect-with-previous ( n quot into -- )
268 (collect-with-previous) each-integer-with-previous ; inline
270 : map-integers-with ( ... len quot: ( ... prev i -- ... elt ) exemplar -- ... newseq )
271 overd [ [ collect-with-previous ] keep ] new-like ; inline
273 : map-with-previous-as ( ... seq quot: ( ... elt prev/f -- ... newelt ) exemplar -- ... newseq )
274 [ length-operator ] dip map-integers-with ; inline
276 : map-with-previous ( ... seq quot: ( ... elt prev/f -- ... newelt ) -- ... newseq )
277 over map-with-previous-as ; inline
279 : setup-each-from ( seq quot -- n quot )
280 [ [ length ] keep [ nth-unsafe ] curry ] dip compose ; inline
282 : map-from-as ( ... seq quot: ( ... elt -- ... newelt ) from exemplar -- ... newseq )
283 -rotd [ sequence-operator nipd ] dip map-integers-from-as ; inline
285 : map-from ( ... seq quot: ( ... elt -- ... newelt ) from -- ... newseq )
286 pick map-from-as ; inline
288 : map-if ( ... seq if-quot: ( ... elt -- ... ? ) map-quot: ( ... elt -- ... newelt ) -- ... newseq )
289 '[ dup @ _ when ] map ; inline
291 : reduce-from ( ... seq identity quot: ( ... prev elt -- ... next ) from -- ... result )
292 [ swap ] 2dip each-from ; inline
294 : 2reduce-from ( ... seq1 seq2 identity quot: ( ... prev elt1 elt2 -- ... next ) i -- ... result )
295 [ -rot ] 2dip 2each-from ; inline
297 : 0accumulate-as ( ... seq quot: ( ... prev elt -- ... next ) exemplar -- ... newseq )
302 [ swapd [ dup ] compose ] dip map-as nip
305 : 0accumulate ( ... seq quot: ( ... prev elt -- ... next ) -- ... final newseq )
306 over 0accumulate-as ; inline
308 : nth-index ( n obj seq -- i )
309 [ = dup [ drop 1 - dup 0 < ] when ] with find drop nip ;
311 : at+* ( n key assoc -- old new ) [ 0 or [ + ] keep swap dup ] change-at ; inline
313 : inc-at* ( key assoc -- old new ) [ 1 ] 2dip at+* ; inline
315 : mark-firsts ( seq -- seq' )
316 dup length <hash-set> '[ _ ?adjoin 1 0 ? ] { } map-as ;
318 : deduplicate ( seq -- seq' )
319 dup length <hash-set> '[ _ ?adjoin ] { } filter-as ;
321 : deduplicate-last ( seq -- seq' )
322 <reversed> deduplicate reverse ;
324 : classify-from ( next hash seq -- next' hash seq' )
332 : classify* ( seq -- next hash seq' )
333 [ 0 H{ } clone ] dip classify-from ;
335 : classify ( seq -- seq' ) classify* 2nip ; inline
337 : occurrence-count-by ( seq quot: ( elt -- elt' ) -- hash seq' )
338 '[ nip @ over inc-at* drop ] [ H{ } clone ] 2dip { } 0accumulate-as ; inline
340 : progressive-index-by-as ( seq1 seq2 quot exemplar -- hash seq' )
343 tuck [ @ over inc-at* drop ] 2dip swap nth-index _ or
344 ] [ H{ } clone ] 3dip with
345 ] dip map-as ; inline
347 : progressive-index-by ( seq1 seq2 quot -- hash seq' )
348 { } progressive-index-by-as ; inline
350 : progressive-index ( seq1 seq2 -- hash seq' )
351 [ ] progressive-index-by ; inline
353 : 0reduce ( seq quot: ( prev elt -- next ) -- result )
354 [ 0 ] dip reduce ; inline
356 : ?unclip ( seq -- rest/f first/f )
357 [ f f ] [ unclip ] if-empty ;
359 : 1reduce ( seq quot: ( prev elt -- next ) -- result )
360 [ ?unclip ] dip reduce ; inline
364 : change-nth-of-unsafe ( seq i quot -- seq )
365 [ [ nth-of-unsafe ] dip call ] 2keepd rot set-nth-of-unsafe ; inline
369 : nth-of ( seq n -- elt ) swap nth ; inline
370 : set-nth-of ( seq n elt -- seq ) spin [ set-nth ] keep ; inline
371 : ?nth-of ( seq n -- elt/f ) swap ?nth ; inline
372 : ??nth ( n seq -- elt/f ? )
373 2dup bounds-check? [ nth-unsafe t ] [ 2drop f f ] if ; inline
374 : ??nth-of ( seq n -- elt/f ? ) swap ??nth ; inline
376 : reduce-of ( seq quot: ( prev elt -- next ) identity -- result )
379 : accumulate-of ( seq quot: ( prev elt -- next ) identity -- result )
380 swap accumulate ; inline
384 : push-map-when* ( ..a elt quot: ( ..a elt -- ..b obj ? ) accum -- ..b )
385 [ call ] dip swap [ push ] [ 2drop ] if ; inline
387 : filter-mapper-for* ( quot length exemplar -- filter-mapper accum )
388 new-resizable [ [ push-map-when* ] 2curry ] keep ; inline
390 : 1push-map-when ( ..a filter-quot: ( ..a -- ..b ? ) map-quot: ( ..a -- ..b obj ) accum -- ..b )
391 [ keep over ] 2dip [ when ] dip rot [ push ] [ 2drop ] if ; inline
393 : 1filter-mapper-for ( filter-quot map-quot length exemplar -- filter-mapper accum )
394 new-resizable [ [ 1push-map-when ] 3curry ] keep ; inline
396 : 2push-map-when ( ..a filter-quot: ( ..a -- ..b ? ) map-quot: ( ..a -- ..b obj ) accum -- ..b )
397 [ 2keep rot ] 2dip '[ [ @ _ push ] [ 2drop ] if ] call ; inline
399 : 2filter-mapper-for ( filter-quot map-quot length exemplar -- filter-mapper accum )
400 new-resizable [ [ 2push-map-when ] 3curry ] keep ; inline
404 : filter-map-as* ( ... seq quot: ( ..a elt -- ..b obj ? ) exemplar -- ... newseq )
406 [ filter-mapper-for* [ each ] dip ] 2curry dip like ; inline
408 : filter-map* ( ... seq quot: ( ... elt -- ... newelt ? ) -- ... newseq )
409 over filter-map-as* ; inline
411 : reject-map-as* ( ... seq quot: ( ... elt -- ... newelt ? ) exemplar -- ... newseq )
412 [ [ not ] compose ] dip filter-map-as* ; inline
414 : reject-map* ( ... seq quot: ( ... elt -- ... newelt ? ) -- ... newseq )
415 over reject-map-as* ; inline
417 : 2filter-map-as* ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... obj ? ) exemplar -- ... newseq )
419 [ filter-mapper-for* [ 2each ] dip ] 2curry dip like ; inline
421 : 2filter-map* ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... ? ) -- ... newseq )
422 pick 2filter-map-as* ; inline
424 : 2reject-map-as* ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... obj ? ) exemplar -- ... newseq )
425 [ [ not ] compose ] dip 2filter-map-as* ; inline
427 : 2reject-map* ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... obj ? ) -- ... newseq )
428 pick 2reject-map-as* ; inline
431 : filter-map-as ( ... seq filter-quot: ( ..a elt -- ..b ? ) map-quot: ( obj -- obj' ) exemplar -- ... newseq )
433 [ 1filter-mapper-for [ each ] dip ] 2curry dip like ; inline
435 : filter-map ( ... seq filter-quot: ( ... elt -- ... ? ) map-quot: ( obj -- obj' ) -- ... newseq )
436 pick filter-map-as ; inline
438 : reject-map-as ( ... seq filter-quot: ( ... elt -- ... ? ) map-quot: ( obj -- obj' ) exemplar -- ... newseq )
439 [ [ not ] compose ] 2dip filter-map-as ; inline
441 : reject-map ( ... seq filter-quot: ( ... elt -- ... ? ) map-quot: ( obj -- obj' ) -- ... newseq )
442 pick reject-map-as ; inline
444 : 2filter-map-as ( ... seq1 seq2 filter-quot: ( ... elt1 elt2 -- ... ? ) map-quot: ( elt1 elt2 -- obj ) exemplar -- ... newseq )
446 [ 2filter-mapper-for [ 2each ] dip ] 2curry dip like ; inline
448 : 2filter-map ( ... seq1 seq2 filter-quot: ( ... elt1 elt2 -- ... ? ) map-quot: ( elt1 elt2 -- obj ) -- ... newseq )
449 reach 2filter-map-as ; inline
451 : 2reject-map-as ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... ? ) map-quot: ( elt1 elt2 -- obj ) exemplar -- ... newseq )
452 [ [ not ] compose ] 2dip 2filter-map-as ; inline
454 : 2reject-map ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... ? ) map-quot: ( elt1 elt2 -- obj ) -- ... newseq )
455 pick 2reject-map-as ; inline
457 : 2push-when ( ..a elt1 elt2 quot: ( ..a elt1 elt2 -- ..b ? ) accum -- ..b )
458 [ keepd ] dip rot [ push ] [ 2drop ] if ; inline
460 : (2selector-as) ( quot length exemplar -- selector accum )
461 new-resizable [ [ 2push-when ] 2curry ] keep ; inline
463 : 2filter-as ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... newelt ) exemplar -- ... newseq )
466 [ (2selector-as) [ 2each ] dip ] 2curry call
469 : 2filter ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... newelt ) -- ... newseq )
470 pick 2filter-as ; inline
472 : 2reject-as ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... newelt ) exemplar -- ... newseq )
473 [ [ not ] compose ] dip 2filter-as ; inline
475 : 2reject ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... newelt ) -- ... newseq )
476 pick 2reject-as ; inline
478 : 2map-sum ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... n ) -- ... n )
479 [ 0 ] 3dip [ dip + ] curry [ rot ] prepose 2each ; inline
481 : 2count ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... ? ) -- ... n )
482 [ 1 0 ? ] compose 2map-sum ; inline
485 ( ... seq1 seq2 seq3 quot: ( ... elt1 elt2 elt3 -- ... ) i -- ... )
486 [ 3length-operator ] dip -rot each-integer-from ; inline
489 ( ..a seq1 seq2 seq3 map-quot: ( ..a elt1 elt2 elt3 -- ..b intermediate ) reduce-quot: ( ..b prev intermediate -- ..a next ) -- ..a result )
490 [ [ [ [ first ] tri@ ] 3keep ] dip [ 3dip ] keep ] dip compose 1 3each-from ; inline
492 : round-robin ( seq -- newseq )
494 [ longest length <iota> ] keep
495 [ [ ?nth ] with map ] curry map concat sift
498 : sift-as ( seq exemplar -- newseq )
501 : sift! ( seq -- seq' )
504 : harvest-as ( seq exemplar -- newseq )
505 [ empty? not ] swap filter-as ;
507 : harvest! ( seq -- newseq )
510 : head-as ( seq n exemplar -- seq' )
511 [ head-slice ] [ like ] bi* ; inline
513 : head*-as ( seq n exemplar -- seq' )
514 [ head-slice* ] [ like ] bi* ; inline
516 : tail-as ( seq n exemplar -- seq' )
517 [ tail-slice ] [ like ] bi* ; inline
519 : tail*-as ( seq n exemplar -- seq' )
520 [ tail-slice* ] [ like ] bi* ; inline
522 : trim-as ( ... seq quot: ( ... elt -- ... ? ) exemplar -- ... newseq )
523 [ trim-slice ] [ like ] bi* ; inline
525 : ?trim ( seq quot: ( elt -- ? ) -- seq/newseq )
526 over empty? [ drop ] [
527 over [ first-unsafe ] [ last-unsafe ] bi pick either?
531 : ?trim-head ( seq quot: ( elt -- ? ) -- seq/newseq )
532 over empty? [ drop ] [
533 over first-unsafe over call
534 [ trim-head ] [ drop ] if
537 : ?trim-tail ( seq quot: ( elt -- ? ) -- seq/newseq )
538 over empty? [ drop ] [
539 over last-unsafe over call
540 [ trim-tail ] [ drop ] if
543 : unsurround ( newseq seq2 seq3 -- seq1 )
544 [ ?head drop ] [ ?tail drop ] bi* ;
546 : >string-list ( seq -- seq' )
547 [ "\"" 1surround ] map "," join ;
549 : with-string-lines ( str quot -- str' )
550 [ string-lines ] dip map "\n" join ; inline
552 : prepend-lines-with-spaces ( str -- str' )
553 [ " " prepend ] with-string-lines ;
555 : one? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? )
557 [ 1 + ] 2dip find-from drop not
558 ] [ 3drop f ] if ; inline
560 : map-index! ( ... seq quot: ( ... elt index -- ... newelt ) -- ... seq )
561 over [ [ sequence-index-operator ] dip collect ] keep ; inline
565 : 2sequence-index-iterator ( seq1 seq2 quot -- n quot' )
566 [ 2length-iterator [ keep ] curry ] dip compose ; inline
570 : 2each-index ( ... seq1 seq2 quot: ( ... elt1 elt2 index -- ... ) -- ... )
571 2sequence-index-iterator each-integer ; inline
573 : 2map-into ( seq1 seq2 quot into -- )
574 [ 2length-operator ] dip collect ; inline
576 : 2map! ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... newelt ) -- ... seq1 )
577 pick [ 2map-into ] keep ; inline
579 : 2map-index ( ... seq1 seq2 quot: ( ... elt1 elt2 index -- ... newelt ) -- ... newseq )
580 pick [ 2sequence-index-iterator ] dip map-integers-as ; inline
582 TUPLE: evens { seq read-only } ;
586 M: evens length seq>> length 1 + 2/ ; inline
588 M: evens virtual@ [ 2 * ] [ seq>> ] bi* ; inline
590 M: evens virtual-exemplar seq>> ; inline
592 INSTANCE: evens virtual-sequence
594 TUPLE: odds { seq read-only } ;
598 M: odds length seq>> length 2/ ; inline
600 M: odds virtual@ [ 2 * 1 + ] [ seq>> ] bi* ; inline
602 M: odds virtual-exemplar seq>> ; inline
604 INSTANCE: odds virtual-sequence
606 : until-empty ( seq quot -- )
607 [ dup empty? ] swap until drop ; inline
611 : push-index-if ( ..a elt i quot: ( ..a elt -- ..b ? ) accum -- ..b )
612 [ dip ] dip rot [ push ] [ 2drop ] if ; inline
616 : arg-where ( ... seq quot: ( ... elt -- ... ? ) -- ... indices )
617 over length <vector> [
618 [ push-index-if ] 2curry each-index
621 : arg-sort ( seq -- indices )
622 zip-index sort-keys values ;
624 : first= ( seq elt -- ? ) [ first ] dip = ; inline
625 : second= ( seq elt -- ? ) [ second ] dip = ; inline
626 : third= ( seq elt -- ? ) [ third ] dip = ; inline
627 : fourth= ( seq elt -- ? ) [ fourth ] dip = ; inline
628 : last= ( seq elt -- ? ) [ last ] dip = ; inline
629 : nth= ( n seq elt -- ? ) [ nth ] dip = ; inline
631 : first? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ first ] dip call ; inline
632 : second? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ second ] dip call ; inline
633 : third? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ third ] dip call ; inline
634 : fourth? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ fourth ] dip call ; inline
635 : last? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ last ] dip call ; inline
636 : nth? ( ... n seq quot: ( ... elt -- ... ? ) -- ... ? ) [ nth ] dip call ; inline
638 : loop>sequence** ( ... quot: ( ... -- ... obj ? ) exemplar -- ... seq )
639 [ ] swap produce-as nip ; inline
641 : loop>array** ( ... quot: ( ... -- ... obj ? ) -- ... array )
642 { } loop>sequence** ; inline
644 : loop>sequence* ( ... quot: ( ... -- ... obj ? ) exemplar -- ... seq )
645 [ t ] [ '[ [ _ dip ] [ f f f ] if* ] [ swap ] ] [ produce-as 2nip ] tri* ; inline
647 : loop>array* ( ... quot: ( ... -- ... obj ? ) -- ... array )
648 { } loop>sequence* ; inline
650 : loop>sequence ( ... quot: ( ... -- ... obj/f ) exemplar -- ... seq )
651 [ [ dup ] compose [ ] ] dip produce-as nip ; inline
653 : loop>array ( ... quot: ( ... -- ... obj/f ) -- ... array )
654 { } loop>sequence ; inline
656 : zero-loop>sequence ( ... quot: ( ... n -- ... obj/f ) exemplar -- ... seq )
657 [ 0 ] [ '[ _ keep 1 + swap ] ] [ loop>sequence ] tri* nip ; inline
659 : zero-loop>array ( quot: ( ..a n -- ..a obj ) -- seq )
660 { } zero-loop>sequence ; inline
662 : iterate-heap-while ( heap quot1: ( value key -- slurp? ) quot2: ( value key -- obj/f ) -- obj/f loop? )
666 [ [ heap-peek ] 2dip drop 2keep ]
668 nip ! ( pop? value key heap quot2 )
670 swap heap-pop* call( value key -- obj/f ) t
677 : slurp-heap-while-map ( heap quot1: ( value key -- slurp? ) quot2: ( value key -- obj/f ) -- seq )
678 '[ _ _ _ iterate-heap-while ] loop>array* ; inline
680 : heap>pairs ( heap -- pairs )
681 [ 2drop t ] [ swap 2array ] slurp-heap-while-map ;
683 : map-zip-swap ( quot: ( x -- y ) -- alist )
684 '[ _ keep ] map>alist ; inline
686 : ?heap-pop-value>array ( heap -- array )
687 dup heap-empty? [ drop { } ] [ heap-pop drop 1array ] if ;
691 : (reverse) ( seq -- newseq )
692 dup [ length ] keep new-sequence
693 [ 0 swap copy-unsafe ] keep reverse! ;
697 : reverse-as ( seq exemplar -- newseq )
698 [ (reverse) ] [ like ] bi* ;
700 : map-product ( ... seq quot: ( ... elt -- ... n ) -- ... n )
701 [ 1 ] 2dip [ dip * ] with-assoc each ; inline
703 : insert-nth! ( elt n seq -- )
704 [ length ] keep ensure swap pick (a..b]
705 over '[ [ 1 + ] keep _ move-unsafe ] each
708 : set-nths ( value indices seq -- )
709 swapd '[ _ swap _ set-nth ] each ; inline
711 : set-nths-unsafe ( value indices seq -- )
712 swapd '[ _ swap _ set-nth-unsafe ] each ; inline
716 : (map-find-index) ( seq quot find-quot -- result i elt )
717 [ [ f ] 2dip [ [ nip ] 2dip call dup ] curry ] dip call
718 [ [ [ drop f ] unless ] keep ] dip ; inline
722 : map-find-index ( ... seq quot: ( ... elt index -- ... result/f ) -- ... result i elt )
723 [ find-index ] (map-find-index) ; inline
725 : find-from* ( ... n seq quot: ( ... elt -- ... ? ) -- ... elt i/f )
726 '[ _ do-find-from element/index ] bounds-check-call ; inline
728 : find* ( ... seq quot: ( ... elt -- ... ? ) -- ... elt i/f )
729 [ 0 ] 2dip do-find-from element/index ; inline
731 : find-last-from* ( ... n seq quot: ( ... elt -- ... ? ) -- ... elt i/f )
732 '[ _ find-last-from-unsafe element/index ] bounds-check-call ; inline
734 : find-last* ( ... seq quot: ( ... elt -- ... ? ) -- ... elt i/f )
735 [ index-of-last ] dip find-last-from* ; inline
737 : find-index-from* ( ... n seq quot: ( ... elt i -- ... ? ) -- ... elt i/f )
739 _ [ sequence-index-operator find-integer-from ] keepd
741 ] bounds-check-call ; inline
743 : find-index* ( ... seq quot: ( ... elt i -- ... ? ) -- ... elt i/f )
744 [ 0 ] 2dip find-index-from* ; inline
746 : filter-length ( seq n -- seq' ) '[ length _ = ] filter ;
748 : all-shortest ( seqs -- seqs' ) dup shortest length filter-length ;
750 : all-longest ( seqs -- seqs' ) dup longest length filter-length ;
754 : nth-unsafe-of ( seq n -- elt ) swap nth-unsafe ; inline
755 : set-nth-unsafe-of ( seq n elt -- seq ) spin [ set-nth-unsafe ] keep ; inline
756 : set-length-of ( seq n -- seq ) over set-length ; inline
758 : move-unsafe-of ( seq to from -- seq )
762 overd nth-unsafe-of set-nth-unsafe-of
765 : move-backward-of ( seq shift from to -- seq )
769 [ [ [ + ] keep move-unsafe-of ] 2keep 1 + ] dip move-backward-of
772 : open-slice-of ( seq shift from -- seq )
776 [ ] [ drop [ length ] dip + ] 3bi
777 [ pick length [ over - ] dip move-backward-of ] dip
783 ERROR: slice-error-of from to seq ;
785 : check-slice-of ( seq from to -- seq from to )
786 over 0 < [ slice-error-of ] when
787 dup reach length > [ slice-error-of ] when
788 2dup > [ slice-error-of ] when ; inline
790 : delete-slice-of ( seq from to -- seq )
791 check-slice-of over [ - ] dip open-slice-of ;
793 : remove-nth-of ( seq n -- seq' )
794 [ dup 1 + rot snip-slice ] keepd append-as ;
796 : remove-nth-of* ( seq n -- nth seq' )
797 [ nth-of ] [ remove-nth-of ] 2bi ;
799 : remove-nth-of! ( seq n -- seq )
800 dup 1 + delete-slice-of ;
802 : remove-nth-of*! ( seq n -- nth seq )
803 [ nth-of ] [ dup 1 + delete-slice-of ] 2bi ;
805 : snip-of ( seq from to -- head tail )
806 [ head ] [ tail ] bi-curry* bi ; inline
808 : snip-slice-of ( seq from to -- head tail )
809 [ head-slice ] [ tail-slice ] bi-curry* bi ; inline
811 : index* ( seq obj -- n ) [ = ] curry find drop ;
813 : index-from* ( i seq obj -- n )
814 [ = ] curry find-from drop ;
816 : last-index* ( seq obj -- n )
817 [ = ] curry find-last drop ;
819 : last-index-from* ( i seq obj -- n )
820 [ = ] curry find-last-from drop ;
822 : indices* ( seq obj -- indices )
823 [ = ] curry [ swap ] prepose V{ } clone [
824 [ push ] curry [ [ drop ] if ] curry compose each-index
827 : remove-first ( obj seq -- seq' )
828 [ index ] keep over [ remove-nth ] [ nip ] if ;
830 : remove-first-of ( seq obj -- seq' )
831 dupd index* [ remove-nth-of ] when* ;
833 : remove-first! ( obj seq -- seq )
834 [ index ] keep over [ remove-nth! ] [ nip ] if ;
836 : remove-last ( obj seq -- seq' )
837 [ last-index ] keep over [ remove-nth ] [ nip ] if ;
839 : remove-last! ( obj seq -- seq )
840 [ last-index ] keep over [ remove-nth! ] [ nip ] if ;
842 : member-of? ( seq elt -- ? )
845 : member-eq-of? ( seq elt -- ? )
848 : remove-of ( seq elt -- newseq )
851 : remove-eq-of ( seq elt -- newseq )
852 [ eq? ] curry reject ;
854 : ?first2 ( seq -- first/f second/f )
857 { 1 [ first-unsafe f ] }
858 [ drop first2-unsafe ]
861 : ?first3 ( seq -- first/f second/f third/f )
864 { 1 [ first-unsafe f f ] }
865 { 2 [ first2-unsafe f ] }
866 [ drop first3-unsafe ]
869 : ?first4 ( seq -- first/f second/f third/f fourth/f )
871 { 0 [ drop f f f f ] }
872 { 1 [ first-unsafe f f f ] }
873 { 2 [ first2-unsafe f f ] }
874 { 3 [ first3-unsafe f ] }
875 [ drop first4-unsafe ]
878 : cut-when ( ... seq quot: ( ... elt -- ... ? ) -- ... before after )
879 [ find drop ] keepd swap
880 [ cut ] [ f over like ] if* ; inline
882 : nth* ( n seq -- elt )
883 [ length 1 - swap - ] [ nth ] bi ; inline
885 : each-index-from ( ... seq quot: ( ... elt index -- ... ) i -- ... )
886 -rot sequence-index-operator each-integer-from ; inline
890 : select-by* ( ... seq quot: ( ... elt -- ... x ) compare: ( obj1 obj2 -- ? ) -- ... i elt )
892 [ keep swap ] curry [ dip ] curry
893 [ [ first 0 ] dip call ] 2keep
894 [ 2curry 3dip 5 npick pick ] curry
896 [ [ 3drop ] [ [ 3drop ] 3dip ] if ] compose
897 ] bi* compose 1 each-index-from nip swap ; inline
901 : supremum-by* ( ... seq quot: ( ... elt -- ... x ) -- ... i elt )
902 [ after? ] select-by* ; inline
904 : infimum-by* ( ... seq quot: ( ... elt -- ... x ) -- ... i elt )
905 [ before? ] select-by* ; inline
907 : arg-max ( seq -- n )
908 [ ] supremum-by* drop ;
910 : arg-min ( seq -- n )
911 [ ] infimum-by* drop ;
913 : ?supremum ( seq/f -- elt/f )
915 [ ] [ 2dup and [ max ] [ dupd ? ] if ] map-reduce
918 : ?infimum ( seq/f -- elt/f )
920 [ ] [ 2dup and [ min ] [ dupd ? ] if ] map-reduce
923 : map-infimum ( seq quot: ( ... elt -- ... elt' ) -- elt' )
924 [ min ] map-reduce ; inline
926 : map-supremum ( seq quot: ( ... elt -- ... elt' ) -- elt' )
927 [ max ] map-reduce ; inline
929 : change-last ( seq quot -- )
930 [ index-of-last ] [ change-nth ] bi* ; inline
932 : change-last-unsafe ( seq quot -- )
933 [ index-of-last ] [ change-nth-unsafe ] bi* ; inline
935 : replicate-into ( ... seq quot: ( ... -- ... newelt ) -- ... )
936 over [ length ] 2dip '[ _ dip _ set-nth-unsafe ] each-integer ; inline
938 : percent-of ( ... seq quot: ( ... elt -- ... ? ) -- ... % )
941 [ over [ count ] [ length ] bi* / ] if ; inline
943 : sequence-index-operator-last ( n seq quot -- n quot' )
944 [ [ nth-unsafe ] curry [ keep ] curry ] dip compose ; inline
946 : find-last-index-from ( ... n seq quot: ( ... elt i -- ... ? ) -- ... i elt )
948 _ [ sequence-index-operator-last find-last-integer ] keepd
950 ] bounds-check-call ; inline
952 : find-last-index ( ... seq quot: ( ... elt i -- ... ? ) -- ... i elt )
953 [ index-of-last ] dip find-last-index-from ; inline
955 : map-find-last-index ( ... seq quot: ( ... elt index -- ... result/f ) -- ... result i elt )
956 [ find-last-index ] (map-find-index) ; inline
958 :: (start-all) ( seq subseq increment -- indices )
960 [ seq subseq subseq-index-from dup ]
961 [ [ increment + ] keep ] produce nip ;
963 : start-all ( seq subseq -- indices )
964 dup length (start-all) ; inline
966 : start-all* ( seq subseq -- indices )
967 1 (start-all) ; inline
969 : count-subseq ( seq subseq -- n )
970 start-all length ; inline
972 : count-subseq* ( seq subseq -- n )
973 start-all* length ; inline
975 : assoc-zip-with ( quot: ( key value -- calc ) -- alist )
976 '[ _ 2keep 2array swap ] assoc-map ; inline
978 : take-while ( ... seq quot: ( ... elt -- ... ? ) -- head-slice )
979 [ '[ @ not ] find drop ] keepd swap
980 [ dup length ] unless* head-slice ; inline
982 : drop-while ( ... seq quot: ( ... elt -- ... ? ) -- tail-slice )
983 [ '[ @ not ] find drop ] keepd swap
984 [ dup length ] unless* tail-slice ; inline
986 : count-head ( seq quot -- n )
987 [ not ] compose [ find drop ] keepd length or ; inline
989 : count-tail ( seq quot -- n )
990 [ not ] compose [ find-last drop ] keepd
991 length swap [ - 1 - ] when* ; inline
993 : count= ( ... seq quot: ( ... elt -- ... ? ) n -- ... ? )
995 '[ swap _ dip swap [ 1 + ] when dup _ > ] find 2drop
998 :: shorten* ( vector n -- seq )
1002 :: interleaved-as ( seq glue exemplar -- newseq )
1003 seq length dup 1 - + 0 max exemplar new-sequence :> newseq
1004 seq [ 2 * newseq set-nth-unsafe ] each-index
1005 seq length 1 - [ 2 * 1 + glue swap newseq set-nth-unsafe ] each-integer
1008 : interleaved ( seq glue -- newseq )
1009 over interleaved-as ;
1011 : extract! ( ... seq quot: ( ... elt -- ... ? ) -- ... seq )
1012 [ dup ] compose over [ length ] keep new-resizable
1013 [ [ push-when ] 2curry reject! ] keep swap like ; inline
1015 : find-pred-loop ( ... i n seq quot: ( ... elt -- ... calc ? ) -- ... calc/f i/f elt/f )
1019 [ [ 3drop ] 2dip rot ]
1020 [ 2drop [ 1 + ] 3dip find-pred-loop ] if
1023 ] if ; inline recursive
1025 : find-pred ( ... seq quot: ( ... elt -- ... calc ) pred: ( ... calc -- ... ? ) -- ... calc/f i/f elt/f )
1027 [ [ length check-length ] keep ] 2dip
1028 '[ nth-unsafe _ keep swap _ keep swap ] find-pred-loop swapd ; inline
1030 ! https://en.wikipedia.org/wiki/Maximum_subarray_problem
1031 ! Kadane's algorithm O(n) largest sum in subarray
1032 : max-subarray-sum ( seq -- sum )
1034 [ [ + ] keep max [ max ] keep ] each drop ;
1037 { from integer read-only initial: 0 }
1038 { to integer read-only initial: 0 }
1040 { step integer read-only } ;
1042 :: <step-slice> ( from/f to/f step seq -- step-slice )
1043 step zero? [ "can't be zero" throw ] when
1046 from/f [ 0 ] unless*
1047 to/f [ len ] unless*
1049 from/f [ len ] unless*
1052 [ dup 0 < [ len + ] when 0 len clamp ] bi@
1053 ! FIXME: make this work with steps
1054 seq dup slice? [ collapse-slice ] when
1055 step step-slice boa ;
1057 M: step-slice virtual-exemplar seq>> ; inline
1059 M: step-slice virtual@
1060 [ step>> * ] [ from>> + ] [ seq>> ] tri ; inline
1062 M: step-slice length
1063 [ to>> ] [ from>> - ] [ step>> ] tri
1064 dup 0 < [ [ neg 0 max ] dip neg ] when /mod
1065 zero? [ 1 + ] unless ; inline
1067 INSTANCE: step-slice virtual-sequence
1069 : 2nested-each* ( seq1 seq-quot: ( n -- seq ) quot: ( a b -- ) -- )
1071 _ keep swap _ with each
1074 : 2nested-filter-as* ( seq1 seq-quot quot exemplar -- seq )
1075 [ 2over [ length ] bi@ * ] dip
1078 [ [ maybe-push ] curry compose 2nested-each* ] keep
1079 ] keep like ; inline
1081 : 2nested-filter* ( seq1 seq-quot quot -- seq )
1082 pick 2nested-filter-as* ; inline
1084 : 2nested-map-as* ( seq1 seq-quot quot exemplar -- seq )
1085 [ 2over [ length ] bi@ * ] dip
1088 [ [ push ] curry compose 2nested-each* ] keep
1089 ] keep like ; inline
1091 : 2nested-map* ( seq1 seq-quot quot -- seq )
1092 pick 2nested-map-as* ; inline
1095 : 2nested-each ( seq1 seq2 quot -- )
1098 ] with each ; inline
1100 : 2nested-filter-as ( seq1 seq2 quot exemplar -- seq )
1101 [ 2over [ length ] bi@ * ] dip
1104 [ [ maybe-push ] curry compose 2nested-each ] keep
1105 ] keep like ; inline
1107 : 2nested-filter ( seq1 seq2 quot -- seq )
1108 pick 2nested-filter-as ; inline
1110 : 2nested-map-as ( seq1 seq2 quot exemplar -- seq )
1111 [ 2over [ length ] bi@ * ] dip
1114 [ [ push ] curry compose 2nested-each ] keep
1115 ] keep like ; inline
1117 : 2nested-map ( seq1 seq2 quot -- seq )
1118 pick 2nested-map-as ; inline
1120 : 3nested-each ( seq1 seq2 seq3 quot -- )
1123 swap _ with with each
1125 ] with with each ; inline
1127 : 3nested-filter-as ( seq1 seq2 seq3 quot exemplar -- seq )
1128 [ 3 nover [ length ] tri@ * * ] dip
1131 [ [ maybe-push ] curry compose 3nested-each ] keep
1132 ] keep like ; inline
1134 : 3nested-filter ( seq1 seq2 seq3 quot -- seq )
1135 reach 3nested-filter-as ; inline
1137 : 3nested-map-as ( seq1 seq2 seq3 quot exemplar -- seq )
1138 [ 3 nover [ length ] tri@ * * ] dip
1141 [ [ push ] curry compose 3nested-each ] keep
1142 ] keep like ; inline
1144 : 3nested-map ( seq1 seq2 seq3 quot -- seq )
1145 reach 3nested-map-as ; inline
1147 : prev ( n seq -- obj ) [ 1 - ] dip nth ; inline
1148 : ?prev ( n seq -- obj/f ) [ 1 - ] dip ?nth ; inline
1149 : ??prev ( n seq -- obj/f ? ) [ 1 - ] dip ??nth ; inline
1150 : prev-of ( seq n -- obj ) 1 - nth-of ; inline
1151 : ?prev-of ( seq n -- obj/f ) 1 - ?nth-of ; inline
1152 : ??prev-of ( seq n -- obj/f ? ) 1 - ??nth-of ; inline
1154 : prev-identity ( i seq -- identity i seq )
1155 2dup ??prev [ drop 0 ] unless -rot ; inline
1157 : each-prior-identity-from ( ... identity i seq quot: ( ... prior elt -- ... ) -- ... )
1158 '[ [ swap @ ] keep ]
1159 length-operator each-integer-from drop ; inline
1161 : each-prior-from ( ... i seq quot: ( ... prior elt -- ... ) -- ... )
1162 [ prev-identity ] dip each-prior-identity-from ; inline
1164 : each-prior ( ... seq quot: ( ... prior elt -- ... ) -- ... )
1165 0 -rot each-prior-from ; inline
1167 : map-prior-identity-from-as ( ... identity i seq quot: ( ... prior elt -- elt' ) exemplar -- seq' )
1169 '[ [ swap @ ] keep swap ] length-operator
1170 ] dip map-integers-from-as nip ; inline
1172 : map-prior-identity-as ( ... identity seq quot: ( ... prior elt -- elt' ) exemplar -- seq' )
1173 [ 0 ] 3dip map-prior-identity-from-as ; inline
1175 : map-prior-from-as ( ... i seq quot: ( ... prior elt -- elt' ) exemplar -- seq' )
1176 [ prev-identity ] 2dip map-prior-identity-from-as ; inline
1178 : map-prior-as ( ... seq quot: ( ... prior elt -- elt' ) exemplar -- seq' )
1179 0 -roll map-prior-from-as ; inline
1181 : map-prior-from ( ... i seq quot: ( ... prior elt -- elt' ) -- seq' )
1182 over map-prior-from-as ; inline
1184 : map-prior ( ... seq quot: ( ... prior elt -- elt' ) -- seq' )
1185 over map-prior-as ; inline
1187 TUPLE: virtual-zip-index seq ;
1189 C: <zip-index> virtual-zip-index
1191 M: virtual-zip-index length seq>> length ; inline
1193 M: virtual-zip-index nth-unsafe
1194 over [ seq>> nth-unsafe ] [ 2array ] bi* ; inline
1196 INSTANCE: virtual-zip-index immutable-sequence
1198 : call-push-when ( ..a elt quot: ( ..a elt -- ..b elt' ? ) accum -- ..b )
1199 [ call ] dip swap [ push ] [ 2drop ] if ; inline
1201 : fry-map-as ( seq quot exemplar -- newseq )
1203 [ overd new-sequence-like dup ] 3bi
1204 '[ [ [ _ nth-unsafe @ ] [ _ set-nth-unsafe ] bi ] each-integer _ ] call ; inline
1206 : exchange-subseq ( len pos1 pos2 seq -- )
1207 [ [ assert-non-negative ] tri@ 3dup max + 1 - ] dip bounds-check nip '[
1208 2dup _ exchange-unsafe
1209 [ 1 - ] [ 1 + ] [ 1 + ] tri*
1210 ] [ pick 0 > ] swap while 3drop ;