1 ! Copyright (C) 2004, 2008 Slava Pestov.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: accessors arrays definitions assocs kernel kernel.private
4 slots.private namespaces make sequences strings words vectors
5 math quotations combinators sorting effects graphs vocabs sets ;
9 SYMBOL: class-not-cache
10 SYMBOL: classes-intersect-cache
11 SYMBOL: class-and-cache
12 SYMBOL: class-or-cache
15 H{ } clone class<=-cache set
16 H{ } clone class-not-cache set
17 H{ } clone classes-intersect-cache set
18 H{ } clone class-and-cache set
19 H{ } clone class-or-cache set ;
22 class<=-cache get clear-assoc
23 class-not-cache get clear-assoc
24 classes-intersect-cache get clear-assoc
25 class-and-cache get clear-assoc
26 class-or-cache get clear-assoc ;
30 SYMBOL: implementors-map
32 PREDICATE: class < word
35 : classes ( -- seq ) implementors-map get keys ;
37 : predicate-word ( word -- predicate )
38 [ name>> "?" append ] [ vocabulary>> ] bi create ;
40 PREDICATE: predicate < word "predicating" word-prop >boolean ;
42 : define-predicate ( class quot -- )
43 >r "predicate" word-prop first
44 r> (( object -- ? )) define-declared ;
46 : superclass ( class -- super )
47 #! Output f for non-classes to work with algebra code
48 dup class? [ "superclass" word-prop ] [ drop f ] if ;
50 : superclasses ( class -- supers )
51 [ superclass ] follow reverse ;
53 : members ( class -- seq )
54 #! Output f for non-classes to work with algebra code
55 dup class? [ "members" word-prop ] [ drop f ] if ;
57 : participants ( class -- seq )
58 #! Output f for non-classes to work with algebra code
59 dup class? [ "participants" word-prop ] [ drop f ] if ;
61 GENERIC: rank-class ( class -- n )
63 GENERIC: reset-class ( class -- )
75 M: word reset-class drop ;
77 GENERIC: implementors ( class/classes -- seq )
80 : class-uses ( class -- seq )
84 [ superclass [ , ] when* ]
88 : class-usage ( class -- seq ) update-map get at ;
90 : class-usages ( class -- seq ) [ class-usage ] closure keys ;
94 : update-map+ ( class -- )
95 dup class-uses update-map get add-vertex ;
97 : update-map- ( class -- )
98 dup class-uses update-map get remove-vertex ;
100 M: class implementors implementors-map get at keys ;
102 M: sequence implementors [ implementors ] gather ;
104 : implementors-map+ ( class -- )
105 H{ } clone swap implementors-map get set-at ;
107 : implementors-map- ( class -- )
108 implementors-map get delete-at ;
110 : make-class-props ( superclass members participants metaclass -- assoc )
113 [ dup [ bootstrap-word ] when "superclass" set ]
114 [ [ bootstrap-word ] map "members" set ]
115 [ [ bootstrap-word ] map "participants" set ]
120 : (define-class) ( word props -- )
122 dup class? [ dup [ implementors-map+ ] [ new-class ] bi ] unless
124 dup deferred? [ dup define-symbol ] when
127 r> assoc-union >>props
129 [ 1quotation "predicate" set-word-prop ]
130 [ swap "predicating" set-word-prop ]
131 [ drop t "class" set-word-prop ]
136 GENERIC: update-class ( class -- )
138 M: class update-class drop ;
140 GENERIC: update-methods ( class seq -- )
142 : update-classes ( class -- )
144 [ nip [ update-class ] each ] [ update-methods ] 2bi ;
146 : define-class ( word superclass members participants metaclass -- )
147 #! If it was already a class, update methods after.
155 : forget-predicate ( class -- )
156 dup "predicate" word-prop
159 tuck "predicating" word-prop =
160 [ forget ] [ drop ] if
163 : forget-methods ( class -- )
164 [ implementors ] [ [ swap 2array ] curry ] bi map forget-all ;
166 GENERIC: class-forgotten ( use class -- )
168 : forget-class ( class -- )
170 [ dup class-usage keys [ class-forgotten ] with each ]
173 [ implementors-map- ]
178 M: class class-forgotten
181 M: class forget* ( class -- )
182 [ call-next-method ] [ forget-class ] bi ;
184 GENERIC: class ( object -- class )
186 GENERIC: instance? ( object class -- ? ) flushable