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
13 SYMBOL: next-method-quot-cache
16 H{ } clone class<=-cache set
17 H{ } clone class-not-cache set
18 H{ } clone classes-intersect-cache set
19 H{ } clone class-and-cache set
20 H{ } clone class-or-cache set
21 H{ } clone next-method-quot-cache set ;
24 class<=-cache get clear-assoc
25 class-not-cache get clear-assoc
26 classes-intersect-cache get clear-assoc
27 class-and-cache get clear-assoc
28 class-or-cache get clear-assoc
29 next-method-quot-cache get clear-assoc ;
33 SYMBOL: implementors-map
35 PREDICATE: class < word
38 : classes ( -- seq ) implementors-map get keys ;
40 : predicate-word ( word -- predicate )
41 [ name>> "?" append ] [ vocabulary>> ] bi create ;
43 PREDICATE: predicate < word "predicating" word-prop >boolean ;
45 : define-predicate ( class quot -- )
46 >r "predicate" word-prop first
47 r> (( object -- ? )) define-declared ;
49 : superclass ( class -- super )
50 #! Output f for non-classes to work with algebra code
51 dup class? [ "superclass" word-prop ] [ drop f ] if ;
53 : superclasses ( class -- supers )
54 [ superclass ] follow reverse ;
56 : members ( class -- seq )
57 #! Output f for non-classes to work with algebra code
58 dup class? [ "members" word-prop ] [ drop f ] if ;
60 : participants ( class -- seq )
61 #! Output f for non-classes to work with algebra code
62 dup class? [ "participants" word-prop ] [ drop f ] if ;
64 GENERIC: rank-class ( class -- n )
66 GENERIC: reset-class ( class -- )
78 M: word reset-class drop ;
80 GENERIC: implementors ( class/classes -- seq )
83 : class-uses ( class -- seq )
87 [ superclass [ , ] when* ]
91 : class-usage ( class -- seq ) update-map get at ;
93 : class-usages ( class -- seq ) [ class-usage ] closure keys ;
97 : update-map+ ( class -- )
98 dup class-uses update-map get add-vertex ;
100 : update-map- ( class -- )
101 dup class-uses update-map get remove-vertex ;
103 M: class implementors implementors-map get at keys ;
105 M: sequence implementors [ implementors ] gather ;
107 : implementors-map+ ( class -- )
108 H{ } clone swap implementors-map get set-at ;
110 : implementors-map- ( class -- )
111 implementors-map get delete-at ;
113 : make-class-props ( superclass members participants metaclass -- assoc )
116 [ dup [ bootstrap-word ] when "superclass" set ]
117 [ [ bootstrap-word ] map "members" set ]
118 [ [ bootstrap-word ] map "participants" set ]
123 : (define-class) ( word props -- )
125 dup class? [ dup [ implementors-map+ ] [ new-class ] bi ] unless
127 dup deferred? [ dup define-symbol ] when
130 r> assoc-union >>props
132 [ 1quotation "predicate" set-word-prop ]
133 [ swap "predicating" set-word-prop ]
134 [ drop t "class" set-word-prop ]
139 GENERIC: update-class ( class -- )
141 M: class update-class drop ;
143 GENERIC: update-methods ( class seq -- )
145 : update-classes ( class -- )
147 [ nip [ update-class ] each ] [ update-methods ] 2bi ;
149 : define-class ( word superclass members participants metaclass -- )
150 #! If it was already a class, update methods after.
158 : forget-predicate ( class -- )
159 dup "predicate" word-prop
162 tuck "predicating" word-prop =
163 [ forget ] [ drop ] if
166 : forget-methods ( class -- )
167 [ implementors ] [ [ swap 2array ] curry ] bi map forget-all ;
169 GENERIC: class-forgotten ( use class -- )
171 : forget-class ( class -- )
173 [ dup class-usage keys [ class-forgotten ] with each ]
176 [ implementors-map- ]
181 M: class class-forgotten
184 M: class forget* ( class -- )
185 [ call-next-method ] [ forget-class ] bi ;
187 GENERIC: class ( object -- class )
189 GENERIC: instance? ( object class -- ? ) flushable