1 ! Copyright (C) 2016 John Benediktsson
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: accessors arrays assocs deques dlists fry hashtables
4 kernel linked-assocs sets ;
7 TUPLE: linked-set { assoc hashtable read-only } { dlist dlist read-only } ;
9 : <linked-set> ( capacity -- linked-set )
10 <hashtable> <dlist> linked-set boa ;
12 M: linked-set in? assoc>> key? ;
14 M: linked-set clear-set
15 [ assoc>> clear-assoc ] [ dlist>> clear-deque ] bi ;
19 : (delete-at) ( key assoc dlist -- )
20 '[ at [ _ delete-node ] when* ] [ delete-at ] 2bi ; inline
25 [ assoc>> ] [ dlist>> ] bi (delete-at) ;
27 M: linked-set cardinality assoc>> assoc-size ;
30 [ assoc>> ] [ dlist>> ] bi
31 '[ _ 2over key? [ 3dup (delete-at) ] when nip push-back* ]
35 dlist>> dlist>sequence ;
38 [ assoc>> clone ] [ dlist>> clone ] bi linked-set boa ;
41 over linked-set? [ [ dlist>> ] bi@ = ] [ 2drop f ] if ;
43 : >linked-set ( set -- linked-set )
44 [ 0 <linked-set> ] dip union! ;
46 INSTANCE: linked-set set
48 M: linked-set set-like
49 drop dup linked-set? [ >linked-set ] unless ;