(classes-intersect?) ( first second -- ? )

Vocabulary

classes.algebra.private

Inputs

first	an object
second	an object

Outputs

?

an object

Definition

IN: classes.algebra.private

GENERIC: (classes-intersect?) ( first second -- ? )

Methods

USING: accessors classes.algebra classes.algebra.private kernel
;

M: anonymous-complement (classes-intersect?)
    class>> class<= not ;


USING: accessors classes.algebra classes.algebra.private kernel
sequences ;

M: anonymous-intersection (classes-intersect?)
    participants>> [ classes-intersect? ] with all? ;


USING: accessors classes.algebra classes.algebra.private ;

M: anonymous-predicate (classes-intersect?)
    class>> classes-intersect? ;


USING: accessors classes.algebra classes.algebra.private kernel
sequences ;

M: anonymous-union (classes-intersect?)
    members>> [ classes-intersect? ] with any? ;


USING: classes.algebra.private classes.builtin kernel ;

M: builtin-class (classes-intersect?) eq? ;


USING: classes classes.algebra classes.algebra.private
classes.mixin kernel sequences ;

M: mixin-class (classes-intersect?)
    class-members [ classes-intersect? ] with any? ;


USING: classes classes.algebra classes.algebra.private
classes.predicate ;

M: predicate-class (classes-intersect?)
    superclass-of classes-intersect? ;


USING: classes.algebra.private classes.singleton generic kernel
;

M: singleton-class (classes-intersect?)
    over singleton-class?
    [ eq? ] [
        M\ singleton-class (classes-intersect?)
        (call-next-method)
    ] if ;


USING: classes.algebra classes.algebra.private classes.builtin
classes.tuple combinators kernel ;

M: tuple-class (classes-intersect?)
    {
        { [ over builtin-class? ] [ drop tuple eq? ] }
        {
            [ over tuple-class? ]
            [ [ class<= ] [ swap class<= ] 2bi or ]
        }
    } cond ;