1 ! Copyright (C) 2007, 2010 Daniel Ehrenberg, Slava Pestov
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: accessors arrays kernel math sequences sequences.private
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 ; inline
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: ( ..a value key assoc -- ..b ) -- quot: ( ..a key value -- ..b ) )
48 curry [ swap ] prepose ; inline
52 : assoc-find ( ... assoc quot: ( ... key value -- ... ? ) -- ... 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: ( ... key value -- ... ) -- ... )
58 (assoc-each) each ; inline
60 : assoc>map ( ... assoc quot: ( ... key value -- ... elt ) exemplar -- ... seq )
61 [ >alist ] 2dip [ [ first2 ] prepose ] dip map-as ; inline
63 : assoc-map-as ( ... assoc quot: ( ... key value -- ... newkey newvalue ) exemplar -- ... newassoc )
64 [ [ 2array ] compose { } assoc>map ] dip assoc-like ; inline
66 : assoc-map ( ... assoc quot: ( ... key value -- ... newkey newvalue ) -- ... newassoc )
67 over assoc-map-as ; inline
69 : assoc-filter-as ( ... assoc quot: ( ... key value -- ... ? ) exemplar -- ... subassoc )
70 [ (assoc-each) filter ] dip assoc-like ; inline
72 : assoc-filter ( ... assoc quot: ( ... key value -- ... ? ) -- ... subassoc )
73 over assoc-filter-as ; inline
75 : assoc-filter! ( ... assoc quot: ( ... key value -- ... ? ) -- ... assoc )
77 over [ [ [ drop ] 2bi ] dip [ delete-at ] 2curry unless ] 2curry
79 ] [ drop ] 2bi ; inline
81 : assoc-partition ( ... assoc quot: ( ... key value -- ... ? ) -- ... true-assoc false-assoc )
82 [ (assoc-each) partition ] [ drop ] 2bi
83 [ assoc-like ] curry bi@ ; inline
85 : assoc-any? ( ... assoc quot: ( ... key value -- ... ? ) -- ... ? )
86 assoc-find 2nip ; inline
88 : assoc-all? ( ... assoc quot: ( ... key value -- ... ? ) -- ... ? )
89 [ not ] compose assoc-any? not ; inline
91 : at ( key assoc -- value/f )
94 M: assoc assoc-clone-like ( assoc exemplar -- newassoc )
95 [ dup assoc-size ] dip new-assoc
96 [ [ set-at ] with-assoc assoc-each ] keep ; inline
98 : keys ( assoc -- keys )
99 [ drop ] { } assoc>map ;
101 : values ( assoc -- values )
102 [ nip ] { } assoc>map ;
104 : delete-at* ( key assoc -- old ? )
105 [ at* ] 2keep delete-at ;
107 : rename-at ( newkey key assoc -- )
108 [ delete-at* ] keep [ set-at ] with-assoc [ 2drop ] if ;
110 : assoc-empty? ( assoc -- ? )
111 assoc-size 0 = ; inline
113 : assoc-stack ( key seq -- value )
114 [ length 1 - ] keep (assoc-stack) ; flushable
116 : assoc-subset? ( assoc1 assoc2 -- ? )
117 [ at* [ = ] [ 2drop f ] if ] with-assoc assoc-all? ;
119 : assoc= ( assoc1 assoc2 -- ? )
120 2dup [ assoc-size ] bi@ eq? [ assoc-subset? ] [ 2drop f ] if ;
122 : assoc-hashcode ( n assoc -- code )
125 : assoc-intersect ( assoc1 assoc2 -- intersection )
126 swap [ nip key? ] curry assoc-filter ;
128 : assoc-union! ( assoc1 assoc2 -- assoc1 )
129 over [ set-at ] with-assoc assoc-each ;
131 : assoc-union ( assoc1 assoc2 -- union )
132 [ [ [ assoc-size ] bi@ + ] [ drop ] 2bi new-assoc ] 2keep
133 [ assoc-union! ] bi@ ;
135 : assoc-combine ( seq -- union )
136 H{ } clone [ assoc-union! ] reduce ;
138 : assoc-refine ( seq -- assoc )
139 [ f ] [ [ ] [ assoc-intersect ] map-reduce ] if-empty ;
141 : assoc-differ ( key -- quot )
142 [ nip key? not ] curry ; inline
144 : assoc-diff ( assoc1 assoc2 -- diff )
145 assoc-differ assoc-filter ;
147 : assoc-diff! ( assoc1 assoc2 -- assoc1 )
148 assoc-differ assoc-filter! ;
150 : substitute ( seq assoc -- newseq )
153 : cache ( ... key assoc quot: ( ... key -- ... value ) -- ... value )
154 [ [ at* ] 2keep ] dip
155 [ [ nip call dup ] [ drop ] 3bi set-at ] 3curry
159 : 2cache ( ... key1 key2 assoc quot: ( ... key1 key2 -- ... value ) -- ... value )
160 [ 2array ] 2dip [ first2 ] prepose cache ; inline
162 : change-at ( ..a key assoc quot: ( ..a value -- ..b newvalue ) -- ..b )
163 [ [ at ] dip call ] [ drop ] 3bi set-at ; inline
165 : at+ ( n key assoc -- ) [ 0 or + ] change-at ; inline
167 : inc-at ( key assoc -- ) [ 1 ] 2dip at+ ; inline
169 : map>assoc ( ... seq quot: ( ... elt -- ... key value ) exemplar -- ... assoc )
171 [ [ 2array ] compose ] dip map-as
173 [ over assoc-size ] dip new-assoc
174 [ [ swapd set-at ] curry compose each ] keep
177 : extract-keys ( seq assoc -- subassoc )
178 [ [ dupd at ] curry ] keep map>assoc ;
180 M: assoc value-at* swap [ = nip ] curry assoc-find nip ;
182 : value-at ( value assoc -- key/f ) value-at* drop ;
184 : value? ( value assoc -- ? ) value-at* nip ;
186 : push-at ( value key assoc -- )
187 [ ?push ] change-at ;
189 : zip ( keys values -- alist )
190 [ 2array ] { } 2map-as ; inline
192 : unzip ( assoc -- keys values )
193 dup assoc-empty? [ drop { } { } ] [ >alist flip first2 ] if ;
196 search-alist [ second t ] [ f ] if ;
201 [ drop [ swap 2array ] dip push ] if ;
203 M: sequence new-assoc drop <vector> ; inline
205 M: sequence clear-assoc delete-all ; inline
207 M: sequence delete-at
208 [ nip ] [ search-alist nip ] 2bi
209 [ swap remove-nth! drop ] [ drop ] if* ;
211 M: sequence assoc-size length ; inline
213 M: sequence assoc-clone-like
214 [ >alist ] dip clone-like ; inline
216 M: sequence assoc-like
217 [ >alist ] dip like ; inline
219 M: sequence >alist ; inline
221 ! Override sequence => assoc instance for f
222 M: f at* 2drop f f ; inline
224 M: f assoc-size drop 0 ; inline
226 M: f clear-assoc drop ; inline
228 M: f assoc-like drop dup assoc-empty? [ drop f ] when ; inline
230 INSTANCE: sequence assoc
232 TUPLE: enum { seq read-only } ;
237 seq>> 2dup bounds-check?
238 [ nth-unsafe t ] [ 2drop f f ] if ; inline
240 M: enum set-at seq>> set-nth ; inline
242 M: enum delete-at seq>> remove-nth! drop ; inline
244 M: enum >alist ( enum -- alist )
245 seq>> [ length iota ] keep zip ; inline
247 M: enum assoc-size seq>> length ; inline
249 M: enum clear-assoc seq>> delete-all ; inline