set-like ( set exemplar -- set' )
Factor handbook » The language » Collections » Sets » Operations on sets

Prev:	intersect-all ( sets -- set/f )
Next:	fast-set ( set -- set' )

Vocabulary
sets

Inputs

set	a set
exemplar	a set

Outputs

set'

a set

Word description
If the conversion is defined for the exemplar, converts the set into a set of the exemplar's class. This is not guaranteed to create a new set, for example if the input set and exemplar are of the same class.

Set implementations may optionally implement a method on this generic word. The default implementation returns its input set.

Examples

USING: sets prettyprint ; { 1 2 3 } HS{ } set-like .
HS{ 1 2 3 }

Definition

IN: sets

GENERIC: set-like ( set exemplar -- set' )

Methods

USING: accessors bit-sets kernel sequences sets ;

M: bit-set set-like
    over bit-set? [ 2dup [ table>> length ] same? ] [ f ] if
    [ drop ] [
        [ members ] dip table>> length <bit-set>
        [ adjoin-all ] keep
    ] if ; inline


USING: hash-sets kernel sets sets.private ;

M: hash-set set-like
    drop dup hash-set? [ ?members >hash-set ] unless ; inline


USING: hash-sets.identity kernel sets sets.private ;

M: identity-hash-set set-like
    drop dup identity-hash-set?
    [ ?members >identity-hash-set ] unless ; inline


USING: kernel linked-sets sets ;

M: linked-set set-like
    drop dup linked-set? [ >linked-set ] unless ;


USING: kernel sequences sets ;

M: sequence set-like [ members ] dip like ;


USING: kernel sets ;

M: set set-like drop ; inline