1 ! Copyright (C) 2008, 2009 Slava Pestov, Doug Coleman.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: assocs hashtables kernel sequences vectors ;
6 : adjoin ( elt seq -- ) [ remove! drop ] [ push ] 2bi ;
8 : conjoin ( elt assoc -- ) dupd set-at ;
10 : conjoin-at ( value key assoc -- )
11 [ dupd ?set-at ] change-at ;
13 : (prune) ( elt hash vec -- )
14 3dup drop key? [ 3drop ] [
15 [ drop conjoin ] [ nip push ] 3bi
18 : prune ( seq -- newseq )
19 [ ] [ length <hashtable> ] [ length <vector> ] tri
20 [ [ (prune) ] 2curry each ] keep ;
22 : duplicates ( seq -- newseq )
23 H{ } clone [ [ key? ] [ conjoin ] 2bi ] curry filter ;
25 : gather ( seq quot -- newseq )
26 map concat prune ; inline
28 : unique ( seq -- assoc )
29 [ dup ] H{ } map>assoc ;
31 : (all-unique?) ( elt hash -- ? )
32 2dup key? [ 2drop f ] [ conjoin t ] if ;
34 : all-unique? ( seq -- ? )
35 dup length <hashtable> [ (all-unique?) ] curry all? ;
39 : tester ( seq -- quot ) unique [ key? ] curry ; inline
43 : intersect ( seq1 seq2 -- newseq )
46 : intersects? ( seq1 seq2 -- ? )
49 : diff ( seq1 seq2 -- newseq )
50 tester [ not ] compose filter ;
52 : union ( seq1 seq2 -- newseq )
55 : subset? ( seq1 seq2 -- ? )
58 : set= ( seq1 seq2 -- ? )