1 ! Copyright (C) 2016 John Benediktsson
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: accessors assocs deques dlists hashtables kernel sets ;
6 TUPLE: linked-set { assoc hashtable read-only } { dlist dlist read-only } ;
8 : <linked-set> ( capacity -- linked-set )
9 <hashtable> <dlist> linked-set boa ;
11 M: linked-set in? assoc>> key? ;
13 M: linked-set clear-set
14 [ assoc>> clear-assoc ] [ dlist>> clear-deque ] bi ;
18 : (delete-at) ( key assoc dlist -- )
19 '[ at [ _ delete-node ] when* ] [ delete-at ] 2bi ; inline
24 [ assoc>> ] [ dlist>> ] bi (delete-at) ;
26 M: linked-set cardinality assoc>> assoc-size ;
29 [ assoc>> ] [ dlist>> ] bi
30 '[ _ 2over key? [ 3dup (delete-at) ] when nip push-back* ]
34 dlist>> dlist>sequence ;
37 [ assoc>> clone ] [ dlist>> clone ] bi linked-set boa ;
40 over linked-set? [ [ dlist>> ] bi@ = ] [ 2drop f ] if ;
42 : >linked-set ( set -- linked-set )
43 [ 0 <linked-set> ] dip union! ;
45 INSTANCE: linked-set set
47 M: linked-set set-like
48 drop dup linked-set? [ >linked-set ] unless ;