1 ! Copyright (C) 2007, 2009 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: value-at* ( value assoc -- key/f ? )
11 GENERIC: set-at ( value key assoc -- )
12 GENERIC: new-assoc ( capacity exemplar -- newassoc )
13 GENERIC: delete-at ( key assoc -- )
14 GENERIC: clear-assoc ( assoc -- )
15 GENERIC: assoc-size ( assoc -- n )
16 GENERIC: assoc-like ( assoc exemplar -- newassoc )
17 GENERIC: assoc-clone-like ( assoc exemplar -- newassoc )
18 GENERIC: >alist ( assoc -- newassoc )
20 M: assoc assoc-like drop ;
22 : ?at ( key assoc -- value/key ? )
23 2dup at* [ 2nip t ] [ 2drop f ] if ; inline
25 : maybe-set-at ( value key assoc -- changed? )
26 3dup at* [ = [ 3drop f ] [ set-at t ] if ] [ 2drop set-at t ] if ;
30 : (assoc-each) ( assoc quot -- seq quot' )
31 [ >alist ] dip [ first2 ] prepose ; inline
33 : (assoc-stack) ( key i seq -- value )
38 [ [ 3drop ] dip ] [ drop [ 1 - ] dip (assoc-stack) ] if
39 ] if ; inline recursive
41 : search-alist ( key alist -- pair/f i/f )
42 [ first = ] with find swap ; inline
44 : substituter ( assoc -- quot )
45 [ ?at drop ] curry ; inline
47 : with-assoc ( assoc quot: ( value key assoc -- ) -- quot: ( key value -- ) )
48 curry [ swap ] prepose ; inline
52 : assoc-find ( assoc quot -- key value ? )
53 (assoc-each) find swap [ first2 t ] [ drop f f f ] if ; inline
55 : key? ( key assoc -- ? ) at* nip ; inline
57 : assoc-each ( assoc quot -- )
58 (assoc-each) each ; inline
60 : assoc>map ( assoc quot exemplar -- seq )
61 [ accumulator [ assoc-each ] dip ] dip like ; inline
63 : assoc-map-as ( assoc quot exemplar -- newassoc )
64 [ [ 2array ] compose V{ } assoc>map ] dip assoc-like ; inline
66 : assoc-map ( assoc quot -- newassoc )
67 over assoc-map-as ; inline
69 : assoc-filter-as ( assoc quot exemplar -- subassoc )
70 [ (assoc-each) filter ] dip assoc-like ; inline
72 : assoc-filter ( assoc quot -- subassoc )
73 over assoc-filter-as ; inline
75 : assoc-partition ( assoc quot -- true-assoc false-assoc )
76 [ (assoc-each) partition ] [ drop ] 2bi
77 [ assoc-like ] curry bi@ ; inline
79 : assoc-any? ( assoc quot -- ? )
80 assoc-find 2nip ; inline
82 : assoc-all? ( assoc quot -- ? )
83 [ not ] compose assoc-any? not ; inline
85 : at ( key assoc -- value/f )
88 M: assoc assoc-clone-like ( assoc exemplar -- newassoc )
89 [ dup assoc-size ] dip new-assoc
90 [ [ set-at ] with-assoc assoc-each ] keep ;
92 : keys ( assoc -- keys )
93 [ drop ] { } assoc>map ;
95 : values ( assoc -- values )
96 [ nip ] { } assoc>map ;
98 : delete-at* ( key assoc -- old ? )
99 [ at* ] 2keep delete-at ;
101 : rename-at ( newkey key assoc -- )
102 [ delete-at* ] keep [ set-at ] with-assoc [ 2drop ] if ;
104 : assoc-empty? ( assoc -- ? )
107 : assoc-stack ( key seq -- value )
108 [ length 1 - ] keep (assoc-stack) ; flushable
110 : assoc-subset? ( assoc1 assoc2 -- ? )
111 [ at* [ = ] [ 2drop f ] if ] with-assoc assoc-all? ;
113 : assoc= ( assoc1 assoc2 -- ? )
114 [ assoc-subset? ] [ swap assoc-subset? ] 2bi and ;
116 : assoc-hashcode ( n assoc -- code )
119 : assoc-intersect ( assoc1 assoc2 -- intersection )
120 swap [ nip key? ] curry assoc-filter ;
122 : update ( assoc1 assoc2 -- )
123 swap [ set-at ] with-assoc assoc-each ;
125 : assoc-union ( assoc1 assoc2 -- union )
126 [ [ [ assoc-size ] bi@ + ] [ drop ] 2bi new-assoc ] 2keep
127 [ dupd update ] bi@ ;
129 : assoc-combine ( seq -- union )
130 H{ } clone [ dupd update ] reduce ;
132 : assoc-diff ( assoc1 assoc2 -- diff )
133 [ nip key? not ] curry assoc-filter ;
135 : remove-all ( assoc seq -- subseq )
136 swap [ key? not ] curry filter ;
138 : substitute-here ( seq assoc -- )
139 substituter change-each ;
141 : substitute ( seq assoc -- newseq )
144 : cache ( key assoc quot -- value )
145 [ [ at* ] 2keep ] dip
146 [ [ nip call dup ] [ drop ] 3bi set-at ] 3curry
150 : 2cache ( key1 key2 assoc quot -- value )
151 [ 2array ] 2dip [ first2 ] prepose cache ; inline
153 : change-at ( key assoc quot -- )
154 [ [ at ] dip call ] [ drop ] 3bi set-at ; inline
156 : at+ ( n key assoc -- ) [ 0 or + ] change-at ; inline
158 : inc-at ( key assoc -- ) [ 1 ] 2dip at+ ; inline
160 : map>assoc ( seq quot exemplar -- assoc )
161 [ [ 2array ] compose { } map-as ] dip assoc-like ; inline
163 : extract-keys ( seq assoc -- subassoc )
164 [ [ dupd at ] curry ] keep map>assoc ;
166 M: assoc value-at* swap [ = nip ] curry assoc-find nip ;
168 : value-at ( value assoc -- key/f ) value-at* drop ;
170 : value? ( value assoc -- ? ) value-at* nip ;
172 : push-at ( value key assoc -- )
173 [ ?push ] change-at ;
175 : zip ( keys values -- alist )
178 : unzip ( assoc -- keys values )
179 dup assoc-empty? [ drop { } { } ] [ >alist flip first2 ] if ;
182 search-alist [ second t ] [ f ] if ;
187 [ drop [ swap 2array ] dip push ] if ;
189 M: sequence new-assoc drop <vector> ;
191 M: sequence clear-assoc delete-all ;
193 M: sequence delete-at
194 [ nip ] [ search-alist nip ] 2bi
195 [ swap delete-nth ] [ drop ] if* ;
197 M: sequence assoc-size length ;
199 M: sequence assoc-clone-like
200 [ >alist ] dip clone-like ;
202 M: sequence assoc-like
203 [ >alist ] dip like ;
207 ! Override sequence => assoc instance for f
208 M: f clear-assoc drop ;
210 M: f assoc-like drop dup assoc-empty? [ drop f ] when ;
212 INSTANCE: sequence assoc
219 seq>> 2dup bounds-check?
220 [ nth t ] [ 2drop f f ] if ;
222 M: enum set-at seq>> set-nth ;
224 M: enum delete-at seq>> delete-nth ;
226 M: enum >alist ( enum -- alist )
227 seq>> [ length ] keep zip ;
229 M: enum assoc-size seq>> length ;
231 M: enum clear-assoc seq>> delete-all ;