1 ! Copyright (C) 2007, 2008 Daniel Ehrenberg, Slava Pestov
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: kernel sequences arrays math sequences.private vectors
9 GENERIC: at* ( key assoc -- value/f ? )
10 GENERIC: set-at ( value key assoc -- )
11 GENERIC: new-assoc ( capacity exemplar -- newassoc )
12 GENERIC: delete-at ( key assoc -- )
13 GENERIC: clear-assoc ( assoc -- )
14 GENERIC: assoc-size ( assoc -- n )
15 GENERIC: assoc-like ( assoc exemplar -- newassoc )
17 M: assoc assoc-like drop ;
19 GENERIC: assoc-clone-like ( assoc exemplar -- newassoc )
21 GENERIC: >alist ( assoc -- newassoc )
23 : assoc-find ( assoc quot -- key value ? )
24 >r >alist r> [ first2 ] prepose find swap
25 [ first2 t ] [ drop f f f ] if ; inline
27 : key? ( key assoc -- ? ) at* nip ; inline
29 : assoc-each ( assoc quot -- )
30 [ f ] compose assoc-find 3drop ; inline
32 : (assoc>map) ( quot accum -- quot' )
33 [ push ] curry compose ; inline
35 : assoc>map ( assoc quot exemplar -- seq )
37 <vector> [ (assoc>map) assoc-each ] keep
40 : assoc-map ( assoc quot -- newassoc )
41 over >r [ 2array ] compose V{ } assoc>map r> assoc-like ;
44 : assoc-push-if ( key value quot accum -- )
46 [ >r 2array r> push ] [ 3drop ] if ; inline
48 : assoc-pusher ( quot -- quot' accum )
49 V{ } clone [ [ assoc-push-if ] 2curry ] keep ; inline
51 : assoc-filter ( assoc quot -- subassoc )
52 over >r assoc-pusher >r assoc-each r> r> assoc-like ; inline
54 : assoc-contains? ( assoc quot -- ? )
55 assoc-find 2nip ; inline
57 : assoc-all? ( assoc quot -- ? )
58 [ not ] compose assoc-contains? not ; inline
60 : at ( key assoc -- value/f )
63 M: assoc assoc-clone-like ( assoc exemplar -- newassoc )
64 over assoc-size swap new-assoc
65 swap [ swap pick set-at ] assoc-each ;
67 : keys ( assoc -- keys )
68 [ drop ] { } assoc>map ;
70 : values ( assoc -- values )
71 [ nip ] { } assoc>map ;
73 : delete-at* ( key assoc -- old ? )
74 [ at* ] 2keep delete-at ;
76 : rename-at ( newkey key assoc -- )
77 tuck delete-at* [ -rot set-at ] [ 3drop ] if ;
79 : delete-any ( assoc -- key value )
81 [ 2drop t ] assoc-find
82 [ "Assoc is empty" throw ] unless over
85 : assoc-empty? ( assoc -- ? )
88 : (assoc-stack) ( key i seq -- value )
93 [ >r 3drop r> ] [ drop >r 1- r> (assoc-stack) ] if
96 : assoc-stack ( key seq -- value )
97 dup length 1- swap (assoc-stack) ;
99 : assoc-subset? ( assoc1 assoc2 -- ? )
100 [ swapd at* [ = ] [ 2drop f ] if ] curry assoc-all? ;
102 : assoc= ( assoc1 assoc2 -- ? )
103 [ assoc-subset? ] [ swap assoc-subset? ] 2bi and ;
105 : assoc-hashcode ( n assoc -- code )
107 >r over r> hashcode* 2/ >r dupd hashcode* r> bitxor
108 ] { } assoc>map hashcode* ;
110 : assoc-intersect ( assoc1 assoc2 -- intersection )
111 swap [ nip key? ] curry assoc-filter ;
113 : update ( assoc1 assoc2 -- )
114 swap [ swapd set-at ] curry assoc-each ;
116 : assoc-union ( assoc1 assoc2 -- union )
117 2dup [ assoc-size ] bi@ + pick new-assoc
118 [ rot update ] keep [ swap update ] keep ;
120 : assoc-diff ( assoc1 assoc2 -- diff )
121 [ nip key? not ] curry assoc-filter ;
123 : remove-all ( assoc seq -- subseq )
124 swap [ key? not ] curry filter ;
127 [ dupd at* [ nip ] [ drop ] if ] curry ; inline
129 : substitute-here ( seq assoc -- )
130 (substitute) change-each ;
132 : substitute ( seq assoc -- newseq )
135 : cache ( key assoc quot -- value )
139 drop pick rot >r >r call dup r> r> set-at
142 : change-at ( key assoc quot -- )
143 [ >r at r> call ] 3keep drop set-at ; inline
145 : at+ ( n key assoc -- )
146 [ 0 or + ] change-at ;
148 : map>assoc ( seq quot exemplar -- assoc )
149 >r [ 2array ] compose { } map-as r> assoc-like ; inline
151 : extract-keys ( seq assoc -- subassoc )
152 [ [ dupd at ] curry ] keep map>assoc ;
154 ! M: assoc >alist [ 2array ] { } assoc>map ;
156 : value-at ( value assoc -- key/f )
157 swap [ = nip ] curry assoc-find 2drop ;
159 : zip ( keys values -- alist )
162 : search-alist ( key alist -- pair i )
163 [ first = ] with find swap ; inline
166 search-alist [ second t ] [ f ] if ;
171 [ drop >r swap 2array r> push ] if ;
173 M: sequence new-assoc drop <vector> ;
175 M: sequence clear-assoc delete-all ;
177 M: sequence delete-at
178 tuck search-alist nip
179 [ swap delete-nth ] [ drop ] if* ;
181 M: sequence assoc-size length ;
183 M: sequence assoc-clone-like
184 >r >alist r> clone-like ;
186 M: sequence assoc-like
187 over sequence? [ like ] [ assoc-clone-like ] if ;
191 ! Override sequence => assoc instance for f
192 M: f clear-assoc drop ;
194 M: f assoc-like drop dup assoc-empty? [ drop f ] when ;
196 INSTANCE: sequence assoc
203 seq>> 2dup bounds-check?
204 [ nth t ] [ 2drop f f ] if ;
206 M: enum set-at seq>> set-nth ;
208 M: enum delete-at enum-seq delete-nth ;
210 M: enum >alist ( enum -- alist )
211 seq>> [ length ] keep zip ;
213 M: enum assoc-size seq>> length ;
215 M: enum clear-assoc seq>> delete-all ;