1 ! Copyright (C) 2013 Doug Coleman, John Benediktsson.
2 ! See https://factorcode.org/license.txt for BSD license.
3 USING: arrays assocs combinators combinators.smart
4 generalizations graphs.private kernel math math.order namespaces
5 quotations sequences sequences.generalizations sequences.private
6 sets shuffle stack-checker.transforms system words ;
9 : callk ( ..a quot: ( ..a -- ..b ) -- ..b quot )
10 dup [ call ] dip ; inline
12 : once ( quot -- ) call ; inline
13 : twice ( quot -- ) callk call ; inline
14 : thrice ( quot -- ) callk callk call ; inline
15 : forever ( quot -- ) [ t ] compose loop ; inline
17 MACRO: cond-case ( assoc -- quot )
20 [ first [ dup ] prepose ]
21 [ second [ drop ] prepose ] bi 2array
23 ] map [ cond ] curry ;
25 MACRO: cleave-array ( quots -- quot )
26 [ '[ _ cleave ] ] [ length '[ _ narray ] ] bi compose ;
28 : 4bi ( w x y z p q -- )
29 [ 4keep ] dip call ; inline
31 : 4tri ( w x y z p q r -- )
32 [ [ 4keep ] dip 4keep ] dip call ; inline
34 : quad ( x p q r s -- )
35 [ [ [ keep ] dip keep ] dip keep ] dip call ; inline
37 : 2quad ( x y p q r s -- )
38 [ [ [ 2keep ] dip 2keep ] dip 2keep ] dip call ; inline
40 : 3quad ( x y z p q r s -- )
41 [ [ [ 3keep ] dip 3keep ] dip 3keep ] dip call ; inline
43 : 4quad ( w x y z p q r s -- )
44 [ [ [ 4keep ] dip 4keep ] dip 4keep ] dip call ; inline
46 : 3bi* ( u v w x y z p q -- )
47 [ 3dip ] dip call ; inline
49 : 4bi* ( s t u v w x y z p q -- )
50 [ 4dip ] dip call ; inline
52 : 3tri* ( r s t u v w x y z p q r -- )
53 [ 6 ndip ] 2dip [ 4dip ] dip call ; inline
55 : 4tri* ( o p q r s t u v w x y z p q r -- )
56 [ 8 ndip ] 2dip [ 4dip ] dip call ; inline
58 : quad* ( w x y z p q r s -- )
59 [ [ [ 3dip ] dip 2dip ] dip dip ] dip call ; inline
61 : 2quad* ( s t u v w x y z p q r s -- )
62 [ [ [ 6 ndip ] dip 4dip ] dip 2dip ] dip call ; inline
64 : 3quad* ( o p q r s t u v w x y z p q r s -- )
65 [ [ [ 9 ndip ] dip 6 ndip ] dip 3dip ] dip call ; inline
67 : 4quad* ( k l m n o p q r s t u v w x y z p q r s -- )
68 [ [ [ 12 ndip ] dip 8 ndip ] dip 4dip ] dip call ; inline
70 : 3bi@ ( u v w x y z quot -- ) dup 3bi* ; inline
72 : 4bi@ ( s t u v w x y z quot -- ) dup 4bi* ; inline
74 : 3tri@ ( r s t u v w x y z p q r -- )
75 dup dup 3tri* ; inline
77 : 4tri@ ( o p q r s t u v w x y z quot -- )
78 dup dup 4tri* ; inline
80 : quad@ ( w x y z quot -- )
81 dup dup dup quad* ; inline
83 : 2quad@ ( s t u v w x y z p q r s -- )
84 dup dup dup 2quad* ; inline
86 : 3quad@ ( o p q r s t u v w x y z p q r s -- )
87 dup dup dup 3quad* ; inline
89 : 4quad@ ( k l m n o p q r s t u v w x y z p q r s -- )
90 dup dup dup 4quad* ; inline
92 MACRO: smart-plox ( true -- quot )
93 [ inputs [ 1 - [ and ] n*quot ] keep ] keep swap
94 '[ _ _ [ _ ndrop f ] smart-if ] ;
96 : throttle ( quot millis -- quot' )
98 _ nano-count { 0 } 2dup first-unsafe _ + >=
99 [ 0 swap set-nth-unsafe call ] [ 3drop ] if
102 : swap-when ( x y quot: ( x -- n ) quot: ( n n -- ? ) -- x' y' )
103 '[ _ _ 2dup _ bi@ @ [ swap ] when ] call ; inline
106 ! ?1arg-result-falsify
108 : 1falsify ( obj/f -- obj/f ) ; inline
109 : 2falsify ( obj1 obj2 -- obj1/f obj2/f ) 2dup and [ 2drop f f ] unless ; inline
110 : 3falsify ( obj1 obj2 obj3 -- obj1/f obj2/f obj3/f ) 3dup and and [ 3drop f f f ] unless ; inline
112 MACRO: n-and ( n -- quot )
113 1 [-] [ and ] n*quot ;
115 MACRO: n*obj ( n obj -- quot )
118 MACRO:: n-falsify ( n -- quot )
119 [ n ndup n n-and [ n ndrop n f n*obj ] unless ] ;
121 ! when both args are true, call quot. otherwise dont
122 : ?2res ( ..a obj1 obj2 quot: ( obj1 obj2 -- ? ) -- ..b )
123 [ 2dup and ] dip [ 2drop f ] if ; inline
125 ! try the quot, keep the original arg if quot is true
126 : ?1arg ( obj quot: ( obj -- ? ) -- obj/f )
127 [ ?call ] keepd '[ _ ] [ f ] if ; inline
129 : ?2arg ( obj1 obj2 quot: ( obj1 obj2 -- ? ) -- obj1/f obj2/f )
130 [ ?2res ] 2keepd '[ _ _ ] [ f f ] if ; inline
133 : alist>quot* ( default assoc -- quot )
134 [ rot \ if* 3array [ ] append-as ] assoc-each ;
136 : cond*>quot ( assoc -- quot )
137 [ dup pair? [ [ drop ] prepend [ t ] swap 2array ] unless ] map
138 reverse! [ no-cond ] swap alist>quot* ;
141 \ cond* [ cond*>quot ] 1 define-transform
142 \ cond* t "no-compile" set-word-prop
145 [ dup callable? [ drop t ] [ first call ] if ] map-find
146 [ dup callable? [ nip call ] [ second call ] if ]
149 MACRO: chain ( quots -- quot )
150 <reversed> [ ] [ swap '[ [ @ @ ] [ f ] if* ] ] reduce ;
152 : with-output-variable ( value variable quot -- value )
153 over [ get ] curry compose with-variable ; inline
155 : loop1 ( ..a quot: ( ..a -- ..a obj ? ) -- ..a obj )
156 [ call ] keep '[ drop _ loop1 ] when ; inline recursive
159 : keep-1up ( quot -- quot ) keep 1 2 0 nrotated ; inline
160 : keep-2up ( quot -- quot ) keep 2 3 0 nrotated ; inline
161 : keep-3up ( quot -- quot ) keep 3 4 0 nrotated ; inline
163 : 2keep-1up ( quot -- quot ) 2keep 1 3 0 nrotated ; inline
164 : 2keep-2up ( quot -- quot ) 2keep 2 4 0 nrotated ; inline
165 : 2keep-3up ( quot -- quot ) 2keep 3 5 0 nrotated ; inline
167 : 3keep-1up ( quot -- quot ) 3keep 1 4 0 nrotated ; inline
168 : 3keep-2up ( quot -- quot ) 3keep 2 5 0 nrotated ; inline
169 : 3keep-3up ( quot -- quot ) 3keep 3 6 0 nrotated ; inline
171 ! d is dummy, o is object to save notation space
172 : dip-1up ( ..a d quot: ( ..a -- ..b o d ) -- ..b d o )
174 : dip-2up ( ..a d quot: ( ..a -- ..b o1 o2 d ) -- ..b d o1 o2 )
177 : 2dip-1up ( ..a d1 d2 quot: ( ..a -- ..b o d1 d2 ) -- ..b d1 d2 o )
179 : 2dip-2up ( ..a d1 d2 quot: ( ..a -- ..b o1 o2 d1 d2 ) -- ..b d1 d2 o1 o2 )
180 2dip roll roll ; inline
182 : 3dip-1up ( ..a d1 d2 d3 quot: ( ..a -- ..b o d1 d2 d3 ) -- ..b d1 d2 d3 o )
184 : 3dip-2up ( ..a d1 d2 d3 quot: ( ..a -- ..b o1 o2 d1 d2 d3 ) -- ..b d1 d2 d3 o1 o2 )
185 3dip 2 5 0 nrotated ; inline
186 : 3dip-3up ( ..a d1 d2 d3 quot: ( ..a -- ..b o1 o2 o3 d1 d2 d3 ) -- ..b d1 d2 d3 o1 o2 o3 )
187 3dip 3 6 0 nrotated ; inline
190 : 2craft-1up ( ..a quot1: ( ..a -- ..b o1 ) quot2: ( ..b -- ..c o2 ) -- ..c o1 o2 )
191 [ call ] dip [ dip-1up ] call ; inline
193 : 3craft-1up ( ..a quot1: ( ..a -- ..b o1 ) quot2: ( ..b -- ..c o2 ) quot3: ( ..c -- ..d o3 ) -- ..d o1 o2 o3 )
194 [ call ] 2dip [ dip-1up ] dip [ 2dip-1up ] call ; inline
196 : 4craft-1up ( ..a quot1: ( ..a -- ..b o1 ) quot2: ( ..b -- ..c o2 ) quot3: ( ..c -- ..d o3 ) quot4: ( ..d -- ..e o4 ) -- ..e o1 o2 o3 o4 )
197 [ call ] 3dip [ dip-1up ] 2dip [ 2dip-1up ] dip [ 3dip-1up ] call ; inline
199 : 3and ( a b c -- ? ) and and ; inline
200 : 4and ( a b c d -- ? ) and and and ; inline
202 : 3or ( a b c -- ? ) or or ; inline
203 : 4or ( a b c d -- ? ) or or or ; inline
205 ! The kept values are on the bottom of the stack
206 MACRO: keep-under ( quot -- quot' )
207 dup outputs 1 + '[ _ keep 1 _ 0 -nrotated ] ;
209 MACRO: 2keep-under ( quot -- quot' )
210 dup outputs 2 + '[ _ 2keep 2 _ 0 -nrotated ] ;
212 MACRO: 3keep-under ( quot -- quot' )
213 dup outputs 3 + '[ _ 3keep 3 _ 0 -nrotated ] ;
215 MACRO: 4keep-under ( quot -- quot' )
216 dup outputs 4 + '[ _ 4keep 4 _ 0 -nrotated ] ;
218 ! for use with assoc-map etc
219 : 1temp1d ( quot: ( a b c -- d e f ) -- quot ) '[ swap @ swap ] ; inline
220 : 1temp2d ( quot: ( a b c -- d e f ) -- quot ) '[ rot @ -rot ] ; inline
221 : 2temp2d ( quot: ( a b c d -- e f g h ) -- quot ) '[ 2 4 0 nrotated @ 2 4 0 -nrotated ] ; inline
223 : (closure-limit) ( vertex set quot: ( vertex -- edges ) i n -- )
227 [ [ dip ] keep ] 2dip [ (closure-limit) ] 2curry 2curry each
231 ] if ; inline recursive
233 : closure-limit-as ( vertex quot: ( vertex -- edges ) n exemplar -- set )
235 new-empty-set-like [ -roll (closure-limit) ] keep ; inline
237 : closure-limit ( vertex quot: ( vertex -- edges ) n -- set )
238 HS{ } closure-limit-as ; inline
240 : 1check ( obj quot -- obj ? ) over [ call ] dip swap ; inline
241 : 2check ( obj1 obj2 quot -- obj ? ) 2over [ call ] 2dip rot ; inline
243 : 1check-when ( ..a obj cond: ( ..a obj -- obj/f ) true: ( ..a obj cond -- ..b ) -- ..b )
244 [ 1check ] dip when ; inline
245 : 2check-when ( ..a obj1 obj2 cond: ( ..a obj1 obj2 -- obj/f ) true: ( ..a obj1 obj2 cond -- ..b ) -- ..b )
246 [ 2check ] dip when ; inline