1 ! Copyright (C) 2008 Slava Pestov, James Cash.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: accessors arrays assocs classes deques dlists hashtables
4 kernel parser sequences.private vocabs.loader ;
7 TUPLE: linked-assoc { assoc read-only } { dlist dlist read-only } ;
9 : <linked-assoc> ( exemplar -- assoc )
10 0 swap new-assoc <dlist> linked-assoc boa ;
12 : <linked-hash> ( -- assoc )
15 M: linked-assoc assoc-size assoc>> assoc-size ;
18 assoc>> at* [ [ obj>> second-unsafe ] when ] keep ;
22 : (delete-at) ( key assoc dlist -- )
23 '[ at [ _ delete-node ] when* ] [ delete-at ] 2bi ; inline
27 M: linked-assoc delete-at
28 [ assoc>> ] [ dlist>> ] bi (delete-at) ;
32 : add-to-dlist ( value key dlist -- node )
33 [ swap 2array ] dip push-back* ; inline
37 M: linked-assoc set-at
38 [ assoc>> ] [ dlist>> ] bi
39 '[ _ 2over key? [ 3dup (delete-at) ] when nip add-to-dlist ]
42 M: linked-assoc >alist
43 dlist>> dlist>sequence ;
45 M: linked-assoc clear-assoc
46 [ assoc>> clear-assoc ] [ dlist>> clear-deque ] bi ;
49 [ assoc>> clone ] [ dlist>> clone ] bi linked-assoc boa ;
51 INSTANCE: linked-assoc assoc
53 : >linked-hash ( assoc -- assoc' )
54 [ <linked-hash> ] dip assoc-union! ;
56 M: linked-assoc assoc-like
58 [ 2dup [ assoc>> ] bi@ class-of instance? ] [ f ] if
59 [ drop ] [ assoc>> <linked-assoc> swap assoc-union! ] if ;
61 M: linked-assoc equal?
62 over linked-assoc? [ [ dlist>> ] bi@ = ] [ 2drop f ] if ;
64 SYNTAX: LH{ \ } [ check-hashtable >linked-hash ] parse-literal ;
66 { "linked-assocs" "prettyprint" } "linked-assocs.prettyprint" require-when