factor/extra/sequences/extras/extras.factor

623 lines
19 KiB
Factor

USING: accessors arrays assocs combinators fry generalizations
grouping growable kernel locals make math math.order math.ranges
sequences sequences.deep sequences.private sorting splitting
vectors ;
IN: sequences.extras
: find-all ( ... seq quot: ( ... elt -- ... ? ) -- ... elts )
[ <enumerated> ] dip '[ nip @ ] assoc-filter ; inline
: reduce-from ( ... seq identity quot: ( ... prev elt -- ... next ) i -- ... result )
[ swap ] 2dip each-from ; inline
:: subseq* ( from to seq -- subseq )
seq length :> len
from [ dup 0 < [ len + ] when ] [ 0 ] if*
to [ dup 0 < [ len + ] when ] [ len ] if*
[ 0 len clamp ] bi@ dupd max seq subseq ;
: safe-subseq ( from to seq -- subseq )
[ length '[ 0 _ clamp ] bi@ ] keep subseq ;
: all-subseqs ( seq -- seqs )
dup length [1,b] [ clump ] with map concat ;
:: each-subseq ( ... seq quot: ( ... subseq -- ... ) -- ... )
seq length :> len
len [0,b] |[ from |
from len (a,b] |[ to |
from to seq subseq quot call
] each
] each ; inline
: map-like ( seq exemplar -- seq' )
'[ _ like ] map ; inline
: filter-all-subseqs-range ( ... seq range quot: ( ... subseq -- ... ) -- seq )
[
'[ <clumps> _ filter ] with map concat
] 3keep 2drop map-like ; inline
: filter-all-subseqs ( ... seq quot: ( ... subseq -- ... ) -- seq )
[ dup length [1,b] ] dip filter-all-subseqs-range ; inline
:: longest-subseq ( seq1 seq2 -- subseq )
seq1 length :> len1
seq2 length :> len2
0 :> n!
0 :> end!
len1 1 + [ len2 1 + 0 <array> ] replicate :> table
len1 [1,b] |[ x |
len2 [1,b] |[ y |
x 1 - seq1 nth-unsafe
y 1 - seq2 nth-unsafe = [
y 1 - x 1 - table nth-unsafe nth-unsafe 1 + :> len
len y x table nth-unsafe set-nth-unsafe
len n > [ len n! x end! ] when
] [ 0 y x table nth-unsafe set-nth-unsafe ] if
] each
] each end n - end seq1 subseq ;
: pad-longest ( seq1 seq2 elt -- seq1 seq2 )
[ 2dup max-length ] dip [ pad-tail ] 2curry bi@ ;
:: pad-center ( seq n elt -- padded )
n seq length [-] :> extra
extra 2/ :> left
extra left - :> right
left elt <repetition> seq right elt <repetition>
seq 3append-as ;
: change-nths ( ... indices seq quot: ( ... elt -- ... elt' ) -- ... )
[ change-nth ] 2curry each ; inline
: push-if-index ( ..a elt i quot: ( ..a elt i -- ..b ? ) accum -- ..b )
[ 2keep drop ] dip rot [ push ] [ 2drop ] if ; inline
: push-if* ( ..a elt quot: ( ..a elt -- ..b obj/f ) accum -- ..b )
[ call ] dip [ push ] [ drop ] if* ; inline
<PRIVATE
: (index-selector-as) ( quot length exampler -- selector accum )
new-resizable [ [ push-if-index ] 2curry ] keep ; inline
: (selector-as*) ( quot length exemplar -- selector accum )
new-resizable [ [ push-if* ] 2curry ] keep ; inline
PRIVATE>
: index-selector-as ( quot exemplar -- selector accum )
[ length ] keep (index-selector-as) ; inline
: index-selector ( quot -- selector accum )
V{ } index-selector-as ; inline
: selector-as* ( quot exemplar -- selector accum )
[ length ] keep (selector-as*) ; inline
: selector* ( quot -- selector accum ) V{ } selector-as* ; inline
: filter-index-as ( ... seq quot: ( ... elt i -- ... ? ) exemplar -- ... seq' )
pick length over [ (index-selector-as) [ each-index ] dip ] 2curry dip like ; inline
: filter-index ( ... seq quot: ( ... elt i -- ... ? ) -- ... seq' )
over filter-index-as ; inline
: even-indices ( seq -- seq' )
[ length 1 + 2/ ] keep [
[ [ 2 * ] dip nth-unsafe ] curry
] keep map-integers ;
: odd-indices ( seq -- seq' )
[ length 2/ ] keep [
[ [ 2 * 1 + ] dip nth-unsafe ] curry
] keep map-integers ;
: compact ( ... seq quot: ( ... elt -- ... ? ) elt -- ... seq' )
[ split-when harvest ] dip join ; inline
: collapse ( ... seq quot: ( ... elt -- ... ? ) elt -- ... seq' )
[ split-when ] dip
[ [ harvest ] dip join ]
[ [ first empty? ] dip [ prepend ] curry when ]
[ [ last empty? ] dip [ append ] curry when ]
2tri ; inline
:: slice-when ( seq quot: ( elt -- ? ) -- seq' )
seq length :> len
0 [ len dupd < ] [
dup seq quot find-from drop
[ 2dup = [ 1 + ] when ] [ len ] if*
[ seq <slice> ] keep len or swap
] produce nip ; inline
: cut-slice* ( seq n -- before after )
[ head-slice* ] [ tail-slice* ] 2bi ;
: ?<slice> ( from/f to/f sequence -- slice )
[ [ 0 ] unless* ] 2dip
over [ nip [ length ] [ ] bi ] unless
<slice> ; inline
: sequence>slice ( sequence -- slice )
[ drop 0 ] [ length ] [ ] tri <slice> ; inline
: slice-order-by-from ( slice1 slice2 -- slice-lt slice-gt )
2dup [ from>> ] bi@ > [ swap ] when ; inline
: ordered-slices-range ( slice-lt slice-gt -- to from )
[ to>> ] [ from>> ] bi* ;
: unordered-slices-range ( slice1 slice2 -- to from )
slice-order-by-from ordered-slices-range ;
: ordered-slices-overlap? ( slice-lt slice-gt -- ? )
ordered-slices-range > ; inline
: unordered-slices-overlap? ( slice1 slice2 -- ? )
unordered-slices-range > ; inline
: slices-overlap? ( slice1 slice2 -- ? )
unordered-slices-overlap? ;
: ordered-slices-touch? ( slice-lt slice-gt -- ? )
ordered-slices-range >= ; inline
: unordered-slices-touch? ( slice1 slice2 -- ? )
unordered-slices-range >= ; inline
: slices-touch? ( slice1 slice2 -- ? )
unordered-slices-touch? ;
ERROR: slices-don't-touch slice1 slice2 ;
: merge-slices ( slice1 slice2 -- slice/* )
slice-order-by-from
2dup ordered-slices-touch? [
[ from>> ] [ [ to>> ] [ seq>> ] bi ] bi* <slice>
] [
slices-don't-touch
] if ;
: rotate ( seq n -- seq' )
over length mod dup 0 >= [ cut ] [ abs cut* ] if prepend ;
ERROR: underlying-mismatch slice1 slice2 ;
: ensure-same-underlying ( slice1 slice2 -- slice1 slice2 )
2dup [ seq>> ] bi@ eq? [ underlying-mismatch ] unless ;
: span-slices ( slice1 slice2 -- slice )
ensure-same-underlying
[ [ from>> ] bi@ min ]
[ [ to>> ] bi@ max ]
[ drop seq>> ] 2tri <slice> ;
: ?span-slices ( slice1/f slice2/f -- slice )
2dup and [ span-slices ] [ or ] if ;
:: rotate! ( seq n -- )
seq length :> len
n len mod dup 0 < [ len + ] when seq bounds-check drop 0 over
[ 2dup = ] [
[ seq exchange-unsafe ] [ [ 1 + ] bi@ ] 2bi
dup len = [ drop over ] when
2over = [ -rot nip over ] when
] until 3drop ;
: all-rotations ( seq -- seq' )
dup length <iota> [ rotate ] with map ;
<PRIVATE
: (appender-for) ( quot length exemplar -- appender accum )
new-resizable [ [ push-all ] curry compose ] keep ; inline
PRIVATE>
: appender-for ( quot exemplar -- appender accum )
[ length ] keep (appender-for) ; inline
: appender ( quot -- appender accum )
V{ } appender-for ; inline
: map-concat-as ( ... seq quot: ( ... elt -- ... newelt ) exemplar -- ... newseq )
[ appender-for [ each ] dip ] keep like ; inline
: >resizable ( seq -- accum ) ! fixes map-concat "cannot apply call to run-time..."
[ length ] keep [ new-resizable ] [ append! ] bi ;
: map-concat ( ... seq quot: ( ... elt -- ... newelt ) -- ... newseq )
over empty? [ 2drop { } ] [
[ [ first ] dip call ] 2keep rot [
>resizable [ '[ @ _ push-all ] 1 each-from ] keep
] keep like
] if ; inline
: map-filter-as ( ... seq map-quot: ( ... elt -- ... newelt ) filter-quot: ( ... newelt -- ... ? ) exemplar -- ... subseq )
[ pick ] dip swap length over
[ (selector-as) [ compose each ] dip ] 2curry dip like ; inline
: map-filter ( ... seq map-quot: ( ... elt -- ... newelt ) filter-quot: ( ... newelt -- ... ? ) -- ... subseq )
pick map-filter-as ; inline
: map-sift ( ... seq quot: ( ... elt -- ... newelt ) -- ... newseq )
[ ] map-filter ; inline
: map-harvest ( ... seq quot: ( ... elt -- ... newelt ) -- ... newseq )
[ empty? not ] map-filter ; inline
<PRIVATE
: (setup-each-from) ( i seq -- n quot )
[ length over [-] swap ] keep '[ _ + _ nth-unsafe ] ; inline
: setup-each-from ( i seq quot -- n quot' )
[ (setup-each-from) ] dip compose ; inline
PRIVATE>
: map-from-as ( ... seq quot: ( ... elt -- ... newelt ) i exemplar -- ... newseq )
[ -rot setup-each-from ] dip map-integers ; inline
: map-from ( ... seq quot: ( ... elt -- ... newelt ) i -- ... newseq )
pick map-from-as ; inline
<PRIVATE
: push-map-if ( ..a elt filter-quot: ( ..a elt -- ..b ? ) map-quot: ( ..a elt -- ..b newelt ) accum -- ..b )
[ keep over ] 2dip [ when ] dip rot [ push ] [ 2drop ] if ; inline
: (filter-mapper-for) ( filter-quot map-quot length exempler -- filter-mapper accum )
new-resizable [ [ push-map-if ] 3curry ] keep ; inline
: filter-mapper-for ( filter-quot map-quot exemplar -- filter-mapper accum )
[ length ] keep (filter-mapper-for) ; inline
: filter-mapper ( filter-quot map-quot -- filter-mapper accum )
V{ } filter-mapper-for ; inline
PRIVATE>
: filter-map-as ( ... seq filter-quot: ( ... elt -- ... ? ) map-quot: ( ... elt -- ... newelt ) exemplar -- ... newseq )
[ pick ] dip swap length over
[ (filter-mapper-for) [ each ] dip ] 2curry dip like ; inline
: filter-map ( ... seq filter-quot: ( ... elt -- ... ? ) map-quot: ( ... elt -- ... newelt ) -- ... newseq )
pick filter-map-as ; inline
: 2map-sum ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... n ) -- ... n )
[ 0 ] 3dip [ dip + ] curry [ rot ] prepose 2each ; inline
: 2count ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... ? ) -- ... n )
[ 1 0 ? ] compose 2map-sum ; inline
: round-robin ( seq -- newseq )
[ { } ] [
[ longest length <iota> ] keep
[ [ ?nth ] with map ] curry map concat sift
] if-empty ;
: sift-as ( seq exemplar -- newseq )
[ ] swap filter-as ;
: sift! ( seq -- newseq )
[ ] filter! ;
: harvest-as ( seq exemplar -- newseq )
[ empty? not ] swap filter-as ;
: harvest! ( seq -- newseq )
[ empty? ] reject! ;
: head-as ( seq n exemplar -- seq' )
[ head-slice ] [ like ] bi* ; inline
: head*-as ( seq n exemplar -- seq' )
[ head-slice* ] [ like ] bi* ; inline
: tail-as ( seq n exemplar -- seq' )
[ tail-slice ] [ like ] bi* ; inline
: tail*-as ( seq n exemplar -- seq' )
[ tail-slice* ] [ like ] bi* ; inline
: trim-as ( ... seq quot: ( ... elt -- ... ? ) exemplar -- ... newseq )
[ trim-slice ] [ like ] bi* ; inline
: ?trim ( seq quot: ( elt -- ? ) -- seq/newseq )
over empty? [ drop ] [
over [ first-unsafe ] [ last-unsafe ] bi pick either?
[ trim ] [ drop ] if
] if ; inline
: ?trim-head ( seq quot: ( elt -- ? ) -- seq/newseq )
over empty? [ drop ] [
over first-unsafe over call
[ trim-head ] [ drop ] if
] if ; inline
: ?trim-tail ( seq quot: ( elt -- ? ) -- seq/newseq )
over empty? [ drop ] [
over last-unsafe over call
[ trim-tail ] [ drop ] if
] if ; inline
: unsurround ( newseq seq2 seq3 -- seq1 )
[ ?head drop ] [ ?tail drop ] bi* ;
: none? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? )
any? not ; inline
: one? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? )
[ find ] 2keep rot [
[ 1 + ] 2dip find-from drop not
] [ 3drop f ] if ; inline
: map-index! ( ... seq quot: ( ... elt index -- ... newelt ) -- ... seq )
over [ [ (each-index) ] dip collect ] keep ; inline
<PRIVATE
: (2each-index) ( seq1 seq2 quot -- n quot' )
[ setup-2each [ keep ] curry ] dip compose ; inline
PRIVATE>
: 2each-index ( ... seq1 seq2 quot: ( ... elt1 elt2 index -- ... ) -- ... )
(2each-index) each-integer ; inline
: 2map-into ( seq1 seq2 quot into -- )
[ (2each) ] dip collect ; inline
: 2map! ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... newelt ) -- ... seq1 )
pick [ 2map-into ] keep ; inline
: 2map-index ( ... seq1 seq2 quot: ( ... elt1 elt2 index -- ... newelt ) -- ... newseq )
pick [ (2each-index) ] dip map-integers ; inline
TUPLE: evens seq length ;
: <evens> ( seq -- evens )
dup length 1 + 2/ evens boa ; inline
M: evens length length>> ; inline
M: evens nth-unsafe [ 2 * ] [ seq>> nth-unsafe ] bi* ; inline
INSTANCE: evens immutable-sequence
TUPLE: odds seq length ;
: <odds> ( seq -- odds )
dup length 2/ odds boa ; inline
M: odds length length>> ; inline
M: odds nth-unsafe [ 2 * 1 + ] [ seq>> nth-unsafe ] bi* ; inline
INSTANCE: odds immutable-sequence
: until-empty ( seq quot -- )
[ dup empty? ] swap until drop ; inline
: arg-max ( seq -- n )
<enumerated> [ second-unsafe ] supremum-by first ;
: arg-min ( seq -- n )
<enumerated> [ second-unsafe ] infimum-by first ;
<PRIVATE
: push-index-if ( ..a elt i quot: ( ..a elt -- ..b ? ) accum -- ..b )
[ dip ] dip rot [ push ] [ 2drop ] if ; inline
PRIVATE>
: arg-where ( ... seq quot: ( ... elt -- ... ? ) -- ... indices )
over length <vector> [
[ push-index-if ] 2curry each-index
] keep ; inline
: arg-sort ( seq -- indices )
zip-index sort-keys values ;
: first= ( seq elt -- ? ) [ first ] dip = ; inline
: second= ( seq elt -- ? ) [ second ] dip = ; inline
: third= ( seq elt -- ? ) [ third ] dip = ; inline
: fourth= ( seq elt -- ? ) [ fourth ] dip = ; inline
: last= ( seq elt -- ? ) [ last ] dip = ; inline
: nth= ( n seq elt -- ? ) [ nth ] dip = ; inline
: first? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ first ] dip call ; inline
: second? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ second ] dip call ; inline
: third? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ third ] dip call ; inline
: fourth? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ fourth ] dip call ; inline
: last? ( ... seq quot: ( ... elt -- ... ? ) -- ... ? ) [ last ] dip call ; inline
: nth? ( ... n seq quot: ( ... elt -- ... ? ) -- ... ? ) [ nth ] dip call ; inline
: loop>sequence ( quot exemplar -- seq )
[ '[ [ @ [ [ , ] when* ] keep ] loop ] ] dip make ; inline
: loop>array ( quot -- seq )
{ } loop>sequence ; inline
<PRIVATE
: (reverse) ( seq -- newseq )
dup [ length ] keep new-sequence
[ 0 swap copy-unsafe ] keep reverse! ;
PRIVATE>
: reverse-as ( seq exemplar -- newseq )
[ (reverse) ] [ like ] bi* ;
: map-product ( ... seq quot: ( ... elt -- ... n ) -- ... n )
[ 1 ] 2dip [ dip * ] curry [ swap ] prepose each ; inline
: insert-nth! ( elt n seq -- )
[ length ] keep ensure swap pick (a,b]
over '[ [ 1 + ] keep _ move-unsafe ] each
set-nth-unsafe ;
: set-nths ( value indices seq -- )
swapd '[ _ swap _ set-nth ] each ; inline
: set-nths-unsafe ( value indices seq -- )
swapd '[ _ swap _ set-nth-unsafe ] each ; inline
: flatten1 ( obj -- seq )
[
[
dup branch? [
[ dup branch? [ % ] [ , ] if ] each
] [ , ] if
]
] keep dup branch? [ drop f ] unless make ;
<PRIVATE
: (map-find-index) ( seq quot find-quot -- result i elt )
[ [ f ] 2dip [ [ nip ] 2dip call dup ] curry ] dip call
[ [ [ drop f ] unless ] keep ] dip ; inline
PRIVATE>
: map-find-index ( ... seq quot: ( ... elt index -- ... result/f ) -- ... result i elt )
[ find-index ] (map-find-index) ; inline
: filter-length ( seq n -- seq' ) '[ length _ = ] filter ;
: all-shortest ( seqs -- seqs' ) dup shortest length filter-length ;
: all-longest ( seqs -- seqs' ) dup longest length filter-length ;
: remove-first ( obj seq -- seq' )
[ index ] keep over [ remove-nth ] [ nip ] if ;
: remove-first! ( obj seq -- seq )
[ index ] keep over [ remove-nth! ] [ nip ] if ;
: remove-last ( obj seq -- seq' )
[ last-index ] keep over [ remove-nth ] [ nip ] if ;
: remove-last! ( obj seq -- seq )
[ last-index ] keep over [ remove-nth! ] [ nip ] if ;
: ?first2 ( seq -- first/f second/f )
dup length {
{ 0 [ drop f f ] }
{ 1 [ first-unsafe f ] }
[ drop first2-unsafe ]
} case ;
: ?first3 ( seq -- first/f second/f third/f )
dup length {
{ 0 [ drop f f f ] }
{ 1 [ first-unsafe f f ] }
{ 2 [ first2-unsafe f ] }
[ drop first3-unsafe ]
} case ;
: ?first4 ( seq -- first/f second/f third/f fourth/f )
dup length {
{ 0 [ drop f f f f ] }
{ 1 [ first-unsafe f f f ] }
{ 2 [ first2-unsafe f f ] }
{ 3 [ first3-unsafe f ] }
[ drop first4-unsafe ]
} case ;
: cut-when ( ... seq quot: ( ... elt -- ... ? ) -- ... before after )
[ find drop ] 2keep drop swap
[ cut ] [ f over like ] if* ; inline
: nth* ( n seq -- elt )
[ length 1 - swap - ] [ nth ] bi ; inline
: each-index-from ( ... seq quot: ( ... elt index -- ... ) i -- ... )
-rot (each-index) (each-integer) ; inline
<PRIVATE
: select-by* ( ... seq quot: ( ... elt -- ... x ) compare: ( obj1 obj2 -- ? ) -- ... i elt )
[
[ keep swap ] curry [ dip ] curry
[ [ first 0 ] dip call ] 2keep
[ 2curry 3dip 5 npick pick ] curry
] [
[ [ 3drop ] [ [ 3drop ] 3dip ] if ] compose
] bi* compose 1 each-index-from nip swap ; inline
PRIVATE>
: supremum-by* ( ... seq quot: ( ... elt -- ... x ) -- ... i elt )
[ after? ] select-by* ; inline
: infimum-by* ( ... seq quot: ( ... elt -- ... x ) -- ... i elt )
[ before? ] select-by* ; inline
: ?supremum ( seq/f -- elt/f )
[ f ] [
[ ] [ 2dup and [ max ] [ dupd ? ] if ] map-reduce
] if-empty ;
: ?infimum ( seq/f -- elt/f )
[ f ] [
[ ] [ 2dup and [ min ] [ dupd ? ] if ] map-reduce
] if-empty ;
: change-last ( seq quot -- )
[ drop length 1 - ] [ change-nth ] 2bi ; inline
: change-last-unsafe ( seq quot -- )
[ drop length 1 - ] [ change-nth-unsafe ] 2bi ; inline
: replicate-into ( ... seq quot: ( ... -- ... newelt ) -- ... )
over [ length ] 2dip '[ _ dip _ set-nth-unsafe ] each-integer ; inline
: count* ( ... seq quot: ( ... elt -- ... ? ) -- ... % )
over [ count ] [ length ] bi* / ; inline
: find-last-index ( ... seq quot: ( ... elt i -- ... ? ) -- ... i elt )
[ [ 1 - ] dip find-last-integer ] (find-index) ; inline
: map-find-last-index ( ... seq quot: ( ... elt index -- ... result/f ) -- ... result i elt )
[ find-last-index ] (map-find-index) ; inline
:: (start-all) ( subseq seq increment -- indices )
0
[ [ subseq seq ] dip subseq-start-from dup ]
[ [ increment + ] keep ] produce nip ;
: start-all ( subseq seq -- indices )
over length (start-all) ; inline
: start-all* ( subseq seq -- indices )
1 (start-all) ; inline
: count-subseq ( subseq seq -- n )
start-all length ; inline
: count-subseq* ( subseq seq -- n )
start-all* length ; inline
: map-zip ( quot: ( x -- y ) -- alist )
'[ _ keep swap ] map>alist ; inline
: map-keys ( assoc quot: ( key -- key' ) -- assoc )
'[ _ dip ] assoc-map ; inline
: map-values ( assoc quot: ( value -- value' ) -- assoc )
'[ swap _ dip swap ] assoc-map ; inline
: take-while ( ... seq quot: ( ... elt -- ... ? ) -- head-slice )
[ '[ @ not ] find drop ] 2keep drop swap
[ dup length ] unless* head-slice ; inline
: drop-while ( ... seq quot: ( ... elt -- ... ? ) -- tail-slice )
[ '[ @ not ] find drop ] 2keep drop swap
[ dup length ] unless* tail-slice ; inline