factor/library/generic/classes.factor

161 lines
4.2 KiB
Factor

! Copyright (C) 2004, 2006 Slava Pestov.
! See http://factorcode.org/license.txt for BSD license.
IN: generic
USING: arrays definitions errors hashtables kernel
kernel-internals namespaces sequences strings words
vectors math parser ;
PREDICATE: word class "class" word-prop ;
: classes ( -- list ) [ class? ] word-subset ;
SYMBOL: typemap
SYMBOL: builtins
: type>class ( n -- symbol ) builtins get nth ;
: predicate-word ( word -- word )
word-name "?" append create-in ;
: predicate-effect 1 1 <effect> ;
: define-predicate ( class predicate quot -- )
over [
over predicate-effect "declared-effect" set-word-prop
dupd define-compound
2dup unit "predicate" set-word-prop
swap "predicating" set-word-prop
] [
3drop
] if ;
: superclass "superclass" word-prop ;
: members "members" word-prop ;
: (flatten-class) ( class -- )
dup members [ [ (flatten-class) ] each ] [ dup set ] ?if ;
: flatten-class ( class -- classes )
[ (flatten-class) ] make-hash ;
: (types) ( class -- )
flatten-class [
drop dup superclass
[ (types) ] [ "type" word-prop dup set ] ?if
] hash-each ;
: types ( class -- types )
[ (types) ] make-hash hash-keys natural-sort ;
DEFER: (class<)
: superclass< ( cls1 cls2 -- ? )
>r superclass r> 2dup and [ (class<) ] [ 2drop f ] if ;
: union-class< ( cls1 cls2 -- ? )
[ flatten-class ] 2apply hash-keys swap
[ drop swap [ (class<) ] contains-with? ] hash-all-with? ;
: class-empty? ( class -- ? )
members dup [ empty? ] when ;
: (class<) ( cls1 cls2 -- ? )
{
{ [ 2dup eq? ] [ 2drop t ] }
{ [ over class-empty? ] [ 2drop t ] }
{ [ 2dup superclass< ] [ 2drop t ] }
{ [ 2dup [ members ] 2apply or not ] [ 2drop f ] }
{ [ t ] [ union-class< ] }
} cond ;
SYMBOL: class<cache
: class< ( cls1 cls2 -- ? )
class<cache get [ hash hash-member? ] [ (class<) ] if* ;
: smaller-classes ( class seq -- )
[ swap (class<) ] subset-with ;
: make-class<cache ( -- hash )
classes dup [
2dup swap smaller-classes [ dup ] map>hash
] map>hash nip ;
: with-class<cache ( quot -- )
[ make-class<cache class<cache set call ] with-scope ;
inline
: class-compare ( cls1 cls2 -- -1/0/1 )
2dup eq? [ 2drop 0 ] [ class< 1 -1 ? ] if ;
: lookup-union ( class-set -- class )
typemap get hash [ object ] unless* ;
: types* ( class -- hash ) types [ type>class dup ] map>hash ;
: (class-or) ( class class -- class )
[ types* ] 2apply hash-union lookup-union ;
: class-or ( class class -- class )
{
{ [ 2dup class< ] [ nip ] }
{ [ 2dup swap class< ] [ drop ] }
{ [ t ] [ (class-or) ] }
} cond ;
: (class-and) ( class class -- class )
[ types* ] 2apply hash-intersect lookup-union ;
: class-and ( class class -- class )
{
{ [ 2dup class< ] [ drop ] }
{ [ 2dup swap class< ] [ nip ] }
{ [ t ] [ (class-and) ] }
} cond ;
: classes-intersect? ( class class -- ? )
class-and class-empty? not ;
: min-class ( class seq -- class/f )
[ dupd classes-intersect? ] subset dup empty? [
2drop f
] [
tuck [ class< ] all-with? [ peek ] [ drop f ] if
] if ;
: define-class ( class -- )
dup t "class" set-word-prop
dup flatten-class typemap get set-hash ;
! Predicate classes for generalized predicate dispatch.
: define-predicate-class ( class predicate definition -- )
pick define-class
3dup nip "definition" set-word-prop
pick superclass "predicate" word-prop
[ \ dup , % , [ drop f ] , \ if , ] [ ] make
define-predicate ;
PREDICATE: class predicate "definition" word-prop ;
! Union classes for dispatch on multiple classes.
: union-predicate ( members -- list )
[ dup ] swap [ "predicate" word-prop append ] map-with
[ [ drop t ] 2array ] map [ drop f ] swap alist>quot ;
: set-members ( class members -- )
[ bootstrap-word ] map "members" set-word-prop ;
: define-union ( class predicate members -- )
3dup nip set-members pick define-class
union-predicate define-predicate ;
PREDICATE: class union members ;
! Definition protocol
: forget-class ( class -- )
dup "predicate" word-prop [ forget ] each
dup flatten-class typemap get remove-hash forget-word ;
M: class forget forget-class ;