1 USING: accessors arrays assocs combinators fry generalizations
2 grouping growable kernel locals make math math.order math.ranges
3 sequences sequences.deep sequences.private shuffle sorting
7 : find-all ( ... seq quot: ( ... elt -- ... ? ) -- ... elts )
8 [ <enumerated> ] dip '[ nip @ ] assoc-filter ; inline
10 : reduce-from ( ... seq identity quot: ( ... prev elt -- ... next ) i -- ... result )
11 [ swap ] 2dip each-from ; inline
13 :: subseq* ( from to seq -- subseq )
15 from [ dup 0 < [ len + ] when ] [ 0 ] if*
16 to [ dup 0 < [ len + ] when ] [ len ] if*
17 [ 0 len clamp ] bi@ dupd max seq subseq ;
19 : safe-subseq ( from to seq -- subseq )
20 [ length '[ 0 _ clamp ] bi@ ] keep subseq ;
22 : all-subseqs ( seq -- seqs )
23 dup length [1,b] [ clump ] with map concat ;
25 :: each-subseq ( ... seq quot: ( ... subseq -- ... ) -- ... )
28 from len (a,b] [| to |
29 from to seq subseq quot call
33 : map-like ( seq exemplar -- seq' )
34 '[ _ like ] map ; inline
36 : filter-all-subseqs-range ( ... seq range quot: ( ... subseq -- ... ? ) -- seq )
38 '[ <clumps> _ filter ] with map concat
39 ] keepdd map-like ; inline
41 : filter-all-subseqs ( ... seq quot: ( ... subseq -- ... ? ) -- seq )
42 [ dup length [1,b] ] dip filter-all-subseqs-range ; inline
44 :: longest-subseq ( seq1 seq2 -- subseq )
49 len1 1 + [ len2 1 + 0 <array> ] replicate :> table
53 y 1 - seq2 nth-unsafe = [
54 y 1 - x 1 - table nth-unsafe nth-unsafe 1 + :> len
55 len y x table nth-unsafe set-nth-unsafe
56 len n > [ len n! x end! ] when
57 ] [ 0 y x table nth-unsafe set-nth-unsafe ] if
59 ] each end n - end seq1 subseq ;
61 : pad-longest ( seq1 seq2 elt -- seq1 seq2 )
62 [ 2dup max-length ] dip [ pad-tail ] 2curry bi@ ;
64 : pad-center ( seq n elt -- padded )
65 swap pick length [-] [ drop ] [
66 [ 2/ ] [ over - ] bi rot '[ _ <repetition> ] bi@
70 : change-nths ( ... indices seq quot: ( ... elt -- ... elt' ) -- ... )
71 [ change-nth ] 2curry each ; inline
73 : push-if-index ( ..a elt i quot: ( ..a elt i -- ..b ? ) accum -- ..b )
74 [ keepd ] dip rot [ push ] [ 2drop ] if ; inline
76 : push-if* ( ..a elt quot: ( ..a elt -- ..b obj/f ) accum -- ..b )
77 [ call ] dip [ push ] [ drop ] if* ; inline
81 : (index-selector-as) ( quot length exampler -- selector accum )
82 new-resizable [ [ push-if-index ] 2curry ] keep ; inline
84 : (selector-as*) ( quot length exemplar -- selector accum )
85 new-resizable [ [ push-if* ] 2curry ] keep ; inline
89 : index-selector-as ( quot exemplar -- selector accum )
90 [ length ] keep (index-selector-as) ; inline
92 : index-selector ( quot -- selector accum )
93 V{ } index-selector-as ; inline
95 : selector-as* ( quot exemplar -- selector accum )
96 [ length ] keep (selector-as*) ; inline
98 : selector* ( quot -- selector accum ) V{ } selector-as* ; inline
100 : filter-index-as ( ... seq quot: ( ... elt i -- ... ? ) exemplar -- ... seq' )
101 pick length over [ (index-selector-as) [ each-index ] dip ] 2curry dip like ; inline
103 : filter-index ( ... seq quot: ( ... elt i -- ... ? ) -- ... seq' )
104 over filter-index-as ; inline
106 : even-indices ( seq -- seq' )
107 [ length 1 + 2/ ] keep [
108 [ [ 2 * ] dip nth-unsafe ] curry
109 ] keep map-integers ;
111 : odd-indices ( seq -- seq' )
113 [ [ 2 * 1 + ] dip nth-unsafe ] curry
114 ] keep map-integers ;
116 : compact ( ... seq quot: ( ... elt -- ... ? ) elt -- ... seq' )
117 [ split-when harvest ] dip join ; inline
119 : collapse ( ... seq quot: ( ... elt -- ... ? ) elt -- ... seq' )
121 [ [ harvest ] dip join ]
122 [ [ first empty? ] dip [ prepend ] curry when ]
123 [ [ last empty? ] dip [ append ] curry when ]
126 :: slice-when ( seq quot: ( elt -- ? ) -- seq' )
129 dup seq quot find-from drop
130 [ 2dup = [ 1 + ] when ] [ len ] if*
131 [ seq <slice> ] keep len or swap
132 ] produce nip ; inline
134 : cut-slice* ( seq n -- before after )
135 [ head-slice* ] [ tail-slice* ] 2bi ;
137 : ?<slice> ( from/f to/f sequence -- slice )
138 [ [ 0 ] unless* ] 2dip
139 over [ nip [ length ] [ ] bi ] unless
142 : sequence>slice ( sequence -- slice )
143 [ drop 0 ] [ length ] [ ] tri <slice> ; inline
145 : slice-order-by-from ( slice1 slice2 -- slice-lt slice-gt )
146 2dup [ from>> ] bi@ > [ swap ] when ; inline
148 : ordered-slices-range ( slice-lt slice-gt -- to from )
149 [ to>> ] [ from>> ] bi* ;
151 : unordered-slices-range ( slice1 slice2 -- to from )
152 slice-order-by-from ordered-slices-range ;
154 : ordered-slices-overlap? ( slice-lt slice-gt -- ? )
155 ordered-slices-range > ; inline
157 : unordered-slices-overlap? ( slice1 slice2 -- ? )
158 unordered-slices-range > ; inline
160 : slices-overlap? ( slice1 slice2 -- ? )
161 unordered-slices-overlap? ;
163 : ordered-slices-touch? ( slice-lt slice-gt -- ? )
164 ordered-slices-range >= ; inline
166 : unordered-slices-touch? ( slice1 slice2 -- ? )
167 unordered-slices-range >= ; inline
169 : slices-touch? ( slice1 slice2 -- ? )
170 unordered-slices-touch? ;
172 ERROR: slices-don't-touch slice1 slice2 ;
174 : merge-slices ( slice1 slice2 -- slice/* )
176 2dup ordered-slices-touch? [
177 [ from>> ] [ [ to>> ] [ seq>> ] bi ] bi* <slice>
182 : rotate ( seq n -- seq' )
183 over length mod dup 0 >= [ cut ] [ abs cut* ] if prepend ;
185 ERROR: underlying-mismatch slice1 slice2 ;
187 : ensure-same-underlying ( slice1 slice2 -- slice1 slice2 )
188 2dup [ seq>> ] bi@ eq? [ underlying-mismatch ] unless ;
190 : span-slices ( slice1 slice2 -- slice )
191 ensure-same-underlying
192 [ [ from>> ] bi@ min ]
194 [ drop seq>> ] 2tri <slice> ;
196 : ?span-slices ( slice1/f slice2/f -- slice )
197 2dup and [ span-slices ] [ or ] if ;
199 :: rotate! ( seq n -- )
201 n len mod dup 0 < [ len + ] when seq bounds-check drop 0 over
203 [ seq exchange-unsafe ] [ [ 1 + ] bi@ ] 2bi
204 dup len = [ drop over ] when
205 2over = [ -rot nip over ] when
208 : all-rotations ( seq -- seq' )
209 dup length <iota> [ rotate ] with map ;
213 : (appender-for) ( quot length exemplar -- appender accum )
214 new-resizable [ [ push-all ] curry compose ] keep ; inline
218 : appender-for ( quot exemplar -- appender accum )
219 [ length ] keep (appender-for) ; inline
221 : appender ( quot -- appender accum )
222 V{ } appender-for ; inline
224 : map-concat-as ( ... seq quot: ( ... elt -- ... newelt ) exemplar -- ... newseq )
225 [ appender-for [ each ] dip ] keep like ; inline
227 : >resizable ( seq -- accum ) ! fixes map-concat "cannot apply call to run-time..."
228 [ length ] keep [ new-resizable ] [ append! ] bi ;
230 : map-concat ( ... seq quot: ( ... elt -- ... newelt ) -- ... newseq )
231 over empty? [ 2drop { } ] [
232 [ [ first ] dip call ] 2keep rot [
233 >resizable [ '[ @ _ push-all ] 1 each-from ] keep
237 : map-filter-as ( ... seq map-quot: ( ... elt -- ... newelt ) filter-quot: ( ... newelt -- ... ? ) exemplar -- ... subseq )
239 [ (selector-as) [ compose each ] dip ] 2curry dip like ; inline
241 : map-filter ( ... seq map-quot: ( ... elt -- ... newelt ) filter-quot: ( ... newelt -- ... ? ) -- ... subseq )
242 pick map-filter-as ; inline
244 : map-sift ( ... seq quot: ( ... elt -- ... newelt ) -- ... newseq )
245 [ ] map-filter ; inline
247 : map-harvest ( ... seq quot: ( ... elt -- ... newelt ) -- ... newseq )
248 [ empty? not ] map-filter ; inline
252 : (setup-each-from) ( i seq -- n quot )
253 [ length over [-] swap ] keep '[ _ + _ nth-unsafe ] ; inline
255 : setup-each-from ( i seq quot -- n quot' )
256 [ (setup-each-from) ] dip compose ; inline
260 : map-from-as ( ... seq quot: ( ... elt -- ... newelt ) i exemplar -- ... newseq )
261 [ -rot setup-each-from ] dip map-integers ; inline
263 : map-from ( ... seq quot: ( ... elt -- ... newelt ) i -- ... newseq )
264 pick map-from-as ; inline
268 : push-map-if ( ..a elt filter-quot: ( ..a elt -- ..b ? ) map-quot: ( ..a elt -- ..b newelt ) accum -- ..b )
269 [ keep over ] 2dip [ when ] dip rot [ push ] [ 2drop ] if ; inline
271 : (filter-mapper-for) ( filter-quot map-quot length exempler -- filter-mapper accum )
272 new-resizable [ [ push-map-if ] 3curry ] keep ; inline
274 : filter-mapper-for ( filter-quot map-quot exemplar -- filter-mapper accum )
275 [ length ] keep (filter-mapper-for) ; inline
277 : filter-mapper ( filter-quot map-quot -- filter-mapper accum )
278 V{ } filter-mapper-for ; inline
282 : filter-map-as ( ... seq filter-quot: ( ... elt -- ... ? ) map-quot: ( ... elt -- ... newelt ) exemplar -- ... newseq )
284 [ (filter-mapper-for) [ each ] dip ] 2curry dip like ; inline
286 : filter-map ( ... seq filter-quot: ( ... elt -- ... ? ) map-quot: ( ... elt -- ... newelt ) -- ... newseq )
287 pick filter-map-as ; inline
289 : 2map-sum ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... n ) -- ... n )
290 [ 0 ] 3dip [ dip + ] curry [ rot ] prepose 2each ; inline
292 : 2count ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... ? ) -- ... n )
293 [ 1 0 ? ] compose 2map-sum ; inline
296 ( ... seq1 seq2 seq3 quot: ( ... elt1 elt2 elt3 -- ... ) i -- ... )
297 [ (3each) ] dip -rot (each-integer) ; inline
300 ( ..a seq1 seq2 seq3 map-quot: ( ..a elt1 elt2 elt3 -- ..b intermediate ) reduce-quot: ( ..b prev intermediate -- ..a next ) -- ..a result )
301 [ [ [ [ first ] tri@ ] 3keep ] dip [ 3dip ] keep ] dip compose 1 3each-from ; inline
303 : round-robin ( seq -- newseq )
305 [ longest length <iota> ] keep
306 [ [ ?nth ] with map ] curry map concat sift
309 : sift-as ( seq exemplar -- newseq )
312 : sift! ( seq -- newseq )
315 : harvest-as ( seq exemplar -- newseq )
316 [ empty? not ] swap filter-as ;
318 : harvest! ( seq -- newseq )
321 : head-as ( seq n exemplar -- seq' )
322 [ head-slice ] [ like ] bi* ; inline
324 : head*-as ( seq n exemplar -- seq' )
325 [ head-slice* ] [ like ] bi* ; inline
327 : tail-as ( seq n exemplar -- seq' )
328 [ tail-slice ] [ like ] bi* ; inline
330 : tail*-as ( seq n exemplar -- seq' )
331 [ tail-slice* ] [ like ] bi* ; inline
333 : trim-as ( ... seq quot: ( ... elt -- ... ? ) exemplar -- ... newseq )
334 [ trim-slice ] [ like ] bi* ; inline
336 : ?trim ( seq quot: ( elt -- ? ) -- seq/newseq )
337 over empty? [ drop ] [
338 over [ first-unsafe ] [ last-unsafe ] bi pick either?
342 : ?trim-head ( seq quot: ( elt -- ? ) -- seq/newseq )
343 over empty? [ drop ] [
344 over first-unsafe over call
345 [ trim-head ] [ drop ] if
348 : ?trim-tail ( seq quot: ( elt -- ? ) -- seq/newseq )
349 over empty? [ drop ] [
350 over last-unsafe over call
351 [ trim-tail ] [ drop ] if
354 : unsurround ( newseq seq2 seq3 -- seq1 )
355 [ ?head drop ] [ ?tail drop ] bi* ;
357 : one? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? )
359 [ 1 + ] 2dip find-from drop not
360 ] [ 3drop f ] if ; inline
362 : map-index! ( ... seq quot: ( ... elt index -- ... newelt ) -- ... seq )
363 over [ [ (each-index) ] dip collect ] keep ; inline
367 : (2each-index) ( seq1 seq2 quot -- n quot' )
368 [ setup-2each [ keep ] curry ] dip compose ; inline
372 : 2each-index ( ... seq1 seq2 quot: ( ... elt1 elt2 index -- ... ) -- ... )
373 (2each-index) each-integer ; inline
375 : 2map-into ( seq1 seq2 quot into -- )
376 [ (2each) ] dip collect ; inline
378 : 2map! ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... newelt ) -- ... seq1 )
379 pick [ 2map-into ] keep ; inline
381 : 2map-index ( ... seq1 seq2 quot: ( ... elt1 elt2 index -- ... newelt ) -- ... newseq )
382 pick [ (2each-index) ] dip map-integers ; inline
384 TUPLE: evens { seq read-only } ;
388 M: evens length seq>> length 1 + 2/ ; inline
390 M: evens virtual@ [ 2 * ] [ seq>> ] bi* ; inline
392 M: evens virtual-exemplar seq>> ; inline
394 INSTANCE: evens virtual-sequence
396 TUPLE: odds { seq read-only } ;
400 M: odds length seq>> length 2/ ; inline
402 M: odds virtual@ [ 2 * 1 + ] [ seq>> ] bi* ; inline
404 M: odds virtual-exemplar seq>> ; inline
406 INSTANCE: odds virtual-sequence
408 : until-empty ( seq quot -- )
409 [ dup empty? ] swap until drop ; inline
411 : arg-max ( seq -- n )
412 [ supremum ] keep index ;
414 : arg-min ( seq -- n )
415 [ infimum ] keep index ;
419 : push-index-if ( ..a elt i quot: ( ..a elt -- ..b ? ) accum -- ..b )
420 [ dip ] dip rot [ push ] [ 2drop ] if ; inline
424 : arg-where ( ... seq quot: ( ... elt -- ... ? ) -- ... indices )
425 over length <vector> [
426 [ push-index-if ] 2curry each-index
429 : arg-sort ( seq -- indices )
430 zip-index sort-keys values ;
432 : first= ( seq elt -- ? ) [ first ] dip = ; inline
433 : second= ( seq elt -- ? ) [ second ] dip = ; inline
434 : third= ( seq elt -- ? ) [ third ] dip = ; inline
435 : fourth= ( seq elt -- ? ) [ fourth ] dip = ; inline
436 : last= ( seq elt -- ? ) [ last ] dip = ; inline
437 : nth= ( n seq elt -- ? ) [ nth ] dip = ; inline
439 : first? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ first ] dip call ; inline
440 : second? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ second ] dip call ; inline
441 : third? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ third ] dip call ; inline
442 : fourth? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ fourth ] dip call ; inline
443 : last? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ last ] dip call ; inline
444 : nth? ( ... n seq quot: ( ... elt -- ... ? ) -- ... ? ) [ nth ] dip call ; inline
446 : loop>sequence** ( ... quot: ( ... -- ... obj ? ) exemplar -- ... seq )
447 [ ] swap produce-as nip ; inline
449 : loop>array** ( ... quot: ( ... -- ... obj ? ) -- ... array )
450 { } loop>sequence** ; inline
452 : loop>sequence* ( ... quot: ( ... -- ... obj ? ) exemplar -- ... seq )
453 [ t ] [ '[ [ _ dip ] [ f f f ] if* ] [ swap ] ] [ produce-as 2nip ] tri* ; inline
455 : loop>array* ( ... quot: ( ... -- ... obj ? ) -- ... array )
456 { } loop>sequence* ; inline
458 : loop>sequence ( ... quot: ( ... -- ... obj/f ) exemplar -- ... seq )
459 [ [ dup ] compose [ ] ] dip produce-as nip ; inline
461 : loop>array ( ... quot: ( ... -- ... obj/f ) -- ... array )
462 { } loop>sequence ; inline
464 : zero-loop>sequence ( ... quot: ( ... n -- ... obj/f ) exemplar -- ... seq )
465 [ 0 ] [ '[ _ keep 1 + swap ] ] [ loop>sequence ] tri* nip ; inline
467 : zero-loop>array ( quot: ( ..a n -- ..a obj ) -- seq )
468 { } zero-loop>sequence ; inline
472 : (reverse) ( seq -- newseq )
473 dup [ length ] keep new-sequence
474 [ 0 swap copy-unsafe ] keep reverse! ;
478 : reverse-as ( seq exemplar -- newseq )
479 [ (reverse) ] [ like ] bi* ;
481 : map-product ( ... seq quot: ( ... elt -- ... n ) -- ... n )
482 [ 1 ] 2dip [ dip * ] curry [ swap ] prepose each ; inline
484 : insert-nth! ( elt n seq -- )
485 [ length ] keep ensure swap pick (a,b]
486 over '[ [ 1 + ] keep _ move-unsafe ] each
489 : set-nths ( value indices seq -- )
490 swapd '[ _ swap _ set-nth ] each ; inline
492 : set-nths-unsafe ( value indices seq -- )
493 swapd '[ _ swap _ set-nth-unsafe ] each ; inline
497 : (map-find-index) ( seq quot find-quot -- result i elt )
498 [ [ f ] 2dip [ [ nip ] 2dip call dup ] curry ] dip call
499 [ [ [ drop f ] unless ] keep ] dip ; inline
503 : map-find-index ( ... seq quot: ( ... elt index -- ... result/f ) -- ... result i elt )
504 [ find-index ] (map-find-index) ; inline
506 : filter-length ( seq n -- seq' ) '[ length _ = ] filter ;
508 : all-shortest ( seqs -- seqs' ) dup shortest length filter-length ;
510 : all-longest ( seqs -- seqs' ) dup longest length filter-length ;
512 : remove-first ( obj seq -- seq' )
513 [ index ] keep over [ remove-nth ] [ nip ] if ;
515 : remove-first! ( obj seq -- seq )
516 [ index ] keep over [ remove-nth! ] [ nip ] if ;
518 : remove-last ( obj seq -- seq' )
519 [ last-index ] keep over [ remove-nth ] [ nip ] if ;
521 : remove-last! ( obj seq -- seq )
522 [ last-index ] keep over [ remove-nth! ] [ nip ] if ;
524 : ?first2 ( seq -- first/f second/f )
527 { 1 [ first-unsafe f ] }
528 [ drop first2-unsafe ]
531 : ?first3 ( seq -- first/f second/f third/f )
534 { 1 [ first-unsafe f f ] }
535 { 2 [ first2-unsafe f ] }
536 [ drop first3-unsafe ]
539 : ?first4 ( seq -- first/f second/f third/f fourth/f )
541 { 0 [ drop f f f f ] }
542 { 1 [ first-unsafe f f f ] }
543 { 2 [ first2-unsafe f f ] }
544 { 3 [ first3-unsafe f ] }
545 [ drop first4-unsafe ]
548 : cut-when ( ... seq quot: ( ... elt -- ... ? ) -- ... before after )
549 [ find drop ] keepd swap
550 [ cut ] [ f over like ] if* ; inline
552 : nth* ( n seq -- elt )
553 [ length 1 - swap - ] [ nth ] bi ; inline
555 : each-index-from ( ... seq quot: ( ... elt index -- ... ) i -- ... )
556 -rot (each-index) (each-integer) ; inline
560 : select-by* ( ... seq quot: ( ... elt -- ... x ) compare: ( obj1 obj2 -- ? ) -- ... i elt )
562 [ keep swap ] curry [ dip ] curry
563 [ [ first 0 ] dip call ] 2keep
564 [ 2curry 3dip 5 npick pick ] curry
566 [ [ 3drop ] [ [ 3drop ] 3dip ] if ] compose
567 ] bi* compose 1 each-index-from nip swap ; inline
571 : supremum-by* ( ... seq quot: ( ... elt -- ... x ) -- ... i elt )
572 [ after? ] select-by* ; inline
574 : infimum-by* ( ... seq quot: ( ... elt -- ... x ) -- ... i elt )
575 [ before? ] select-by* ; inline
577 : ?supremum ( seq/f -- elt/f )
579 [ ] [ 2dup and [ max ] [ dupd ? ] if ] map-reduce
582 : ?infimum ( seq/f -- elt/f )
584 [ ] [ 2dup and [ min ] [ dupd ? ] if ] map-reduce
587 : change-last ( seq quot -- )
588 [ drop length 1 - ] [ change-nth ] 2bi ; inline
590 : change-last-unsafe ( seq quot -- )
591 [ drop length 1 - ] [ change-nth-unsafe ] 2bi ; inline
593 : replicate-into ( ... seq quot: ( ... -- ... newelt ) -- ... )
594 over [ length ] 2dip '[ _ dip _ set-nth-unsafe ] each-integer ; inline
596 : count* ( ... seq quot: ( ... elt -- ... ? ) -- ... % )
597 over [ count ] [ length ] bi* / ; inline
599 : find-last-index ( ... seq quot: ( ... elt i -- ... ? ) -- ... i elt )
600 [ [ 1 - ] dip find-last-integer ] (find-index) ; inline
602 : map-find-last-index ( ... seq quot: ( ... elt index -- ... result/f ) -- ... result i elt )
603 [ find-last-index ] (map-find-index) ; inline
605 :: (start-all) ( subseq seq increment -- indices )
607 [ [ subseq seq ] dip subseq-start-from dup ]
608 [ [ increment + ] keep ] produce nip ;
610 : start-all ( subseq seq -- indices )
611 over length (start-all) ; inline
613 : start-all* ( subseq seq -- indices )
614 1 (start-all) ; inline
616 : count-subseq ( subseq seq -- n )
617 start-all length ; inline
619 : count-subseq* ( subseq seq -- n )
620 start-all* length ; inline
622 : map-zip ( quot: ( key -- value ) -- alist )
623 '[ _ keep swap ] map>alist ; inline
625 : assoc-map-zip ( quot: ( key value -- calc ) -- alist )
626 '[ _ 2keep 2array swap ] assoc-map ; inline
628 : take-while ( ... seq quot: ( ... elt -- ... ? ) -- head-slice )
629 [ '[ @ not ] find drop ] keepd swap
630 [ dup length ] unless* head-slice ; inline
632 : drop-while ( ... seq quot: ( ... elt -- ... ? ) -- tail-slice )
633 [ '[ @ not ] find drop ] keepd swap
634 [ dup length ] unless* tail-slice ; inline
636 : count-head ( seq quot -- n )
637 [ not ] compose [ find drop ] 2keep drop length or ; inline
639 : count-tail ( seq quot -- n )
640 [ not ] compose [ find-last drop ] 2keep drop
641 length swap [ - 1 - ] when* ; inline
643 :: interleaved-as ( seq glue exemplar -- newseq )
644 seq length dup 1 - + 0 max exemplar new-sequence :> newseq
645 seq [ 2 * newseq set-nth-unsafe ] each-index
646 seq length 1 - [ 2 * 1 + glue swap newseq set-nth-unsafe ] each-integer
649 : interleaved ( seq glue -- newseq )
650 over interleaved-as ;
652 : extract! ( ... seq quot: ( ... elt -- ... ? ) -- ... seq )
653 [ dup ] compose over [ length ] keep new-resizable
654 [ [ push-if ] 2curry reject! ] keep swap like ; inline
656 : find-pred-loop ( ... i n seq quot: ( ... elt -- ... calc ? ) -- ... calc/f i/f elt/f )
660 [ [ 3drop ] 2dip rot ]
661 [ 2drop [ 1 + ] 3dip find-pred-loop ] if
664 ] if ; inline recursive
666 : find-pred ( ... seq quot: ( ... elt -- ... calc ) pred: ( ... calc -- ... ? ) -- ... calc/f i/f elt/f )
668 [ [ length check-length ] keep ] 2dip
669 '[ nth-unsafe _ keep swap _ keep swap ] find-pred-loop swapd ; inline