1 ! Copyright (C) 2004, 2011 Slava Pestov.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: accessors assocs classes classes.algebra
4 classes.algebra.private classes.builtin classes.private
5 classes.tuple classes.tuple.private combinators definitions
6 kernel kernel.private math math.private quotations sequences
7 slots.private sorting splitting words ;
10 PREDICATE: union-class < class
11 "metaclass" word-prop union-class eq? ;
15 GENERIC: union-of-builtins? ( class -- ? )
17 M: builtin-class union-of-builtins? drop t ;
19 M: union-class union-of-builtins?
20 class-members [ union-of-builtins? ] all? ;
22 M: class union-of-builtins?
25 : empty-union-predicate-quot ( class-members -- quot )
28 : flatten-builtins ( builtin-classes -- seq )
29 [ flatten-class ] map concat ;
31 : builtin-union-mask ( builtin-classes -- n )
32 0 [ class>type 2^ bitor ] reduce ;
34 : builtin-union-predicate-quot ( builtin-classes -- quot )
35 flatten-builtins dup length 1 = [
36 first class>type [ eq? ] curry [ tag ] prepose
38 builtin-union-mask 1quotation
39 [ tag 1 swap fixnum-shift-fast ]
40 [ fixnum-bitand 0 eq? not ]
44 : predicate-quot ( predicates -- quot )
46 [ [ dup ] prepend [ drop t ] ] { } map>assoc alist>quot ;
48 ! this replicates logic in classes.tuple, keep in sync
49 : tuple-union-predicate-quot/1 ( tuple-classes -- quot )
50 [ [ eq? ] curry ] map predicate-quot
53 : tuple-union-predicate-quot/n ( echelon tuple-classes -- quot )
54 [ layout-class-offset ] dip
55 [ [ eq? ] curry ] map predicate-quot
56 over [ slot ] curry prepose [ drop f ] [ if ] 2curry
57 swap [ fixnum>= ] curry [ dup 1 slot ] prepose prepose ;
59 : tuple-union-predicate-quot ( tuple-classes -- quot )
60 [ echelon-of 1 = ] partition
61 [ [ f ] [ tuple-union-predicate-quot/1 ] if-empty ] dip
62 [ echelon-of ] collect-by sort-keys
63 [ tuple-union-predicate-quot/n ] { } assoc>map
64 swap [ suffix ] when* predicate-quot
65 [ layout-of ] prepose [ drop f ] [ if ] 2curry
66 [ dup tuple? ] prepose ;
68 : full-union-predicate-quot ( class-members -- quot )
69 [ union-of-builtins? ] partition
70 [ [ f ] [ builtin-union-predicate-quot ] if-empty ] dip
71 [ [ tuple-class? ] [ tuple-layout ] bi and ] partition
72 [ [ f ] [ tuple-union-predicate-quot ] if-empty ] dip
78 : union-predicate-quot ( class-members -- quot )
80 { [ dup empty? ] [ empty-union-predicate-quot ] }
81 { [ dup [ union-of-builtins? ] all? ] [ builtin-union-predicate-quot ] }
82 [ full-union-predicate-quot ]
85 : define-union-predicate ( class -- )
86 dup class-members union-predicate-quot define-predicate ;
88 M: union-class update-class define-union-predicate ;
90 ERROR: cannot-reference-self class members ;
92 : check-self-reference ( class members -- class members )
93 2dup all-contained-classes member-eq? [ cannot-reference-self ] when ;
95 : (define-union-class) ( class members -- )
96 check-self-reference f swap f union-class make-class-props (define-class) ;
100 : define-union-class ( class members -- )
101 [ (define-union-class) ]
102 [ drop changed-conditionally ]
103 [ drop update-classes ]
106 M: union-class rank-class drop 7 ;
108 M: union-class instance?
109 "members" word-prop [ instance? ] with any? ;
111 M: anonymous-union predicate-def
112 members>> union-predicate-quot ;
114 M: anonymous-union instance?
115 members>> [ instance? ] with any? ;
117 M: anonymous-union class-name
118 members>> [ class-name ] map join-words ;
120 M: union-class normalize-class
121 class-members <anonymous-union> normalize-class ;
123 M: union-class (flatten-class)
124 class-members <anonymous-union> (flatten-class) ;