1 ! Copyright (C) 2004, 2010 Slava Pestov.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: accessors arrays assocs classes classes.private
4 combinators kernel make math math.order namespaces sequences
5 sets sorting vectors words ;
12 TUPLE: anonymous-union { members read-only } ;
14 INSTANCE: anonymous-union classoid
16 ERROR: not-classoids sequence ;
18 : check-classoids ( members -- members )
19 dup [ classoid? ] all?
20 [ [ classoid? ] reject throw-not-classoids ] unless ;
22 ERROR: not-a-classoid object ;
24 : check-classoid ( object -- object )
25 dup classoid? [ throw-not-a-classoid ] unless ;
27 : <anonymous-union> ( members -- classoid )
29 [ null eq? ] reject members
30 dup length 1 = [ first ] [ sort-classes f like anonymous-union boa ] if ;
32 M: anonymous-union rank-class drop 6 ;
34 TUPLE: anonymous-intersection { participants read-only } ;
36 INSTANCE: anonymous-intersection classoid
38 : <anonymous-intersection> ( participants -- classoid )
40 members dup length 1 =
41 [ first ] [ sort-classes f like anonymous-intersection boa ] if ;
43 M: anonymous-intersection rank-class drop 4 ;
45 TUPLE: anonymous-complement { class read-only } ;
47 INSTANCE: anonymous-complement classoid
49 : <anonymous-complement> ( object -- classoid )
50 dup classoid? [ 1array throw-not-classoids ] unless
51 anonymous-complement boa ;
53 M: anonymous-complement rank-class drop 3 ;
55 M: anonymous-complement instance?
56 over [ class>> instance? not ] [ 2drop t ] if ;
58 M: anonymous-complement class-name
65 GENERIC: (classes-intersect?) ( first second -- ? )
71 GENERIC: (flatten-class) ( class -- )
73 GENERIC: normalize-class ( class -- class' )
75 M: object normalize-class ;
77 : symmetric-class-op ( first second cache quot -- result )
78 [ 2dup [ rank-class ] bi@ > [ swap ] when ] 2dip 2cache ; inline
82 GENERIC: valid-classoid? ( obj -- ? )
84 M: word valid-classoid? class? ;
85 M: anonymous-union valid-classoid? members>> [ valid-classoid? ] all? ;
86 M: anonymous-intersection valid-classoid? participants>> [ valid-classoid? ] all? ;
87 M: anonymous-complement valid-classoid? class>> valid-classoid? ;
88 M: object valid-classoid? drop f ;
90 : only-classoid? ( obj -- ? )
91 dup classoid? [ class? not ] [ drop f ] if ;
93 : class<= ( first second -- ? )
94 class<=-cache get [ (class<=) ] 2cache ;
96 : class< ( first second -- ? )
98 { [ 2dup class<= not ] [ 2drop f ] }
99 { [ 2dup swap class<= not ] [ 2drop t ] }
100 [ [ rank-class ] bi@ < ]
103 : class= ( first second -- ? )
104 2dup class<= [ swap class<= ] [ 2drop f ] if ;
106 : class-not ( class -- complement )
107 class-not-cache get [ (class-not) ] cache ;
109 : classes-intersect? ( first second -- ? )
110 [ normalize-class ] bi@
111 classes-intersect-cache get [ (classes-intersect?) ] symmetric-class-op ;
113 : class-and ( first second -- class )
114 class-and-cache get [ (class-and) ] symmetric-class-op ;
116 : class-or ( first second -- class )
117 class-or-cache get [ (class-or) ] symmetric-class-op ;
119 SYMBOL: +incomparable+
121 : compare-classes ( first second -- <=> )
122 [ swap class<= ] [ class<= ] 2bi
123 [ +eq+ +lt+ ] [ +gt+ +incomparable+ ] if ? ;
125 : evaluate-class-predicate ( class1 class2 -- ? )
127 { [ 2dup class<= ] [ t ] }
128 { [ 2dup classes-intersect? not ] [ f ] }
134 : superclass<= ( first second -- ? )
135 swap superclass-of [ swap class<= ] [ drop f ] if* ;
137 : left-anonymous-union<= ( first second -- ? )
138 [ members>> ] dip [ class<= ] curry all? ;
140 : right-union<= ( first second -- ? )
141 class-members [ class<= ] with any? ;
143 : right-anonymous-union<= ( first second -- ? )
144 members>> [ class<= ] with any? ;
146 : left-anonymous-intersection<= ( first second -- ? )
147 [ participants>> ] dip [ class<= ] curry any? ;
149 PREDICATE: nontrivial-anonymous-intersection < anonymous-intersection
150 participants>> empty? not ;
152 : right-anonymous-intersection<= ( first second -- ? )
153 participants>> [ class<= ] with all? ;
155 : anonymous-complement<= ( first second -- ? )
156 [ class>> ] bi@ swap class<= ;
158 : normalize-complement ( class -- class' )
159 class>> normalize-class {
160 { [ dup anonymous-union? ] [
162 [ class-not normalize-class ] map
163 <anonymous-intersection>
165 { [ dup anonymous-intersection? ] [
167 [ class-not normalize-class ] map
173 : left-anonymous-complement<= ( first second -- ? )
174 [ normalize-complement ] dip class<= ;
176 PREDICATE: nontrivial-anonymous-complement < anonymous-complement
179 [ anonymous-intersection? ]
181 [ class-participants ]
184 PREDICATE: empty-union < anonymous-union members>> empty? ;
186 PREDICATE: empty-intersection < anonymous-intersection participants>> empty? ;
188 : (class<=) ( first second -- ? )
189 2dup eq? [ 2drop t ] [
190 [ normalize-class ] bi@
191 2dup superclass<= [ 2drop t ] [
193 { [ 2dup eq? ] [ 2drop t ] }
194 { [ dup empty-intersection? ] [ 2drop t ] }
195 { [ over empty-union? ] [ 2drop t ] }
196 { [ 2dup [ anonymous-complement? ] both? ] [ anonymous-complement<= ] }
197 { [ over anonymous-union? ] [ left-anonymous-union<= ] }
198 { [ over nontrivial-anonymous-intersection? ] [ left-anonymous-intersection<= ] }
199 { [ over nontrivial-anonymous-complement? ] [ left-anonymous-complement<= ] }
200 { [ dup class-members ] [ right-union<= ] }
201 { [ dup anonymous-union? ] [ right-anonymous-union<= ] }
202 { [ dup anonymous-intersection? ] [ right-anonymous-intersection<= ] }
203 { [ dup anonymous-complement? ] [ class>> classes-intersect? not ] }
209 M: anonymous-union (classes-intersect?)
210 members>> [ classes-intersect? ] with any? ;
212 M: anonymous-intersection (classes-intersect?)
213 participants>> [ classes-intersect? ] with all? ;
215 M: anonymous-complement (classes-intersect?)
216 class>> class<= not ;
218 : anonymous-union-and ( first second -- class )
219 members>> [ class-and ] with map <anonymous-union> ;
221 : anonymous-intersection-and ( first second -- class )
222 participants>> swap suffix <anonymous-intersection> ;
224 : (class-and) ( first second -- class )
225 2dup compare-classes {
230 2dup classes-intersect? [
231 [ normalize-class ] bi@ {
232 { [ dup anonymous-union? ] [ anonymous-union-and ] }
233 { [ dup anonymous-intersection? ] [ anonymous-intersection-and ] }
234 { [ over anonymous-union? ] [ swap anonymous-union-and ] }
235 { [ over anonymous-intersection? ] [ swap anonymous-intersection-and ] }
236 [ 2array <anonymous-intersection> ]
242 : anonymous-union-or ( first second -- class )
243 members>> swap suffix <anonymous-union> ;
245 : ((class-or)) ( first second -- class )
246 [ normalize-class ] bi@ {
247 { [ dup anonymous-union? ] [ anonymous-union-or ] }
248 { [ over anonymous-union? ] [ swap anonymous-union-or ] }
249 [ 2array <anonymous-union> ]
252 : anonymous-complement-or ( first second -- class )
253 2dup class>> swap class<= [ 2drop object ] [ ((class-or)) ] if ;
255 : (class-or) ( first second -- class )
256 2dup compare-classes {
262 { [ dup anonymous-complement? ] [ anonymous-complement-or ] }
263 { [ over anonymous-complement? ] [ swap anonymous-complement-or ] }
269 : (class-not) ( class -- complement )
271 { [ dup anonymous-complement? ] [ class>> ] }
272 { [ dup object eq? ] [ drop null ] }
273 { [ dup null eq? ] [ drop object ] }
274 [ <anonymous-complement> ]
277 M: anonymous-union (flatten-class)
278 members>> [ (flatten-class) ] each ;
282 ERROR: topological-sort-failed ;
284 : largest-class ( seq -- n elt )
285 dup [ [ class< ] with any? not ] curry find-last
286 [ throw-topological-sort-failed ] unless* ;
288 : sort-classes ( seq -- newseq )
289 [ class-name ] sort-with >vector
291 [ dup largest-class [ swap remove-nth! ] dip ]
294 : smallest-class ( classes -- class/f )
296 natural-sort <reversed>
297 [ ] [ [ class<= ] most ] map-reduce
300 : flatten-class ( class -- assoc )
301 [ (flatten-class) ] H{ } make ;