1 ! Copyright (C) 2010 Daniel Ehrenberg
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: accessors assocs hashtables kernel vectors
5 FROM: assocs => change-at ;
10 GENERIC: adjoin ( elt set -- )
11 GENERIC: in? ( elt set -- ? )
12 GENERIC: delete ( elt set -- )
13 GENERIC: set-like ( set exemplar -- set' )
14 GENERIC: fast-set ( set -- set' )
15 GENERIC: members ( set -- seq )
16 GENERIC: union ( set1 set2 -- set )
17 GENERIC: intersect ( set1 set2 -- set )
18 GENERIC: intersects? ( set1 set2 -- ? )
19 GENERIC: diff ( set1 set2 -- set )
20 GENERIC: subset? ( set1 set2 -- ? )
21 GENERIC: set= ( set1 set2 -- ? )
22 GENERIC: duplicates ( set -- seq )
23 GENERIC: all-unique? ( set -- ? )
24 GENERIC: null? ( set -- ? )
25 GENERIC: cardinality ( set -- n )
27 M: f cardinality drop 0 ;
29 ! Defaults for some methods.
30 ! Override them for efficiency
32 M: set null? members null? ; inline
34 M: set cardinality members length ;
36 M: set set-like drop ; inline
39 [ [ members ] bi@ append ] keep set-like ;
43 : tester ( set -- quot )
44 fast-set [ in? ] curry ; inline
46 : sequence/tester ( set1 set2 -- set1' quot )
47 [ members ] [ tester ] bi* ; inline
49 : small/large ( set1 set2 -- set1' set2' )
50 2dup [ cardinality ] bi@ > [ swap ] when ;
55 [ small/large sequence/tester filter ] keep set-like ;
58 [ sequence/tester [ not ] compose filter ] keep set-like ;
61 small/large sequence/tester any? ;
65 : (subset?) ( set1 set2 -- ? )
66 sequence/tester all? ; inline
71 2dup [ cardinality ] bi@ > [ 2drop f ] [ (subset?) ] if ;
74 2dup [ cardinality ] bi@ eq? [ (subset?) ] [ 2drop f ] if ;
78 M: set duplicates drop f ;
80 M: set all-unique? drop t ;
84 : (pruned) ( elt hash vec -- )
85 3dup drop in? [ 3drop ] [
86 [ drop adjoin ] [ nip push ] 3bi
89 : pruned ( seq -- newseq )
90 [ f fast-set ] [ length <vector> ] bi
91 [ [ (pruned) ] 2curry each ] keep ;
96 INSTANCE: sequence set
102 [ delete ] [ push ] 2bi ;
105 remove! drop ; inline
108 [ members ] dip like ;
111 [ pruned ] keep like ;
116 M: sequence cardinality
119 : combine ( sets -- set/f )
121 [ [ [ members ] map concat ] [ first ] bi set-like ]
124 : gather ( ... seq quot: ( ... elt -- ... elt' ) -- ... newseq )
125 map concat members ; inline
127 : adjoin-at ( value key assoc -- )
128 [ [ f fast-set ] unless* [ adjoin ] keep ] change-at ;
130 : within ( seq set -- subseq )
133 : without ( seq set -- subseq )
134 tester [ not ] compose filter ;
136 ! Temporarily for compatibility
138 : unique ( seq -- assoc )
139 [ dup ] H{ } map>assoc ;
140 : conjoin ( elt assoc -- )
142 : conjoin-at ( value key assoc -- )
143 [ dupd ?set-at ] change-at ;