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 GENERIC# assoc-find 1 ( assoc quot -- key value ? ) inline
26 >r >alist [ first2 ] r> compose find swap
27 [ first2 t ] [ drop f f f ] if ;
29 : key? ( key assoc -- ? ) at* nip ; inline
31 : assoc-each ( assoc quot -- )
32 [ f ] compose assoc-find 3drop ; inline
34 : (assoc>map) ( quot accum -- quot' )
35 [ push ] curry compose ; inline
37 : assoc>map ( assoc quot exemplar -- seq )
39 <vector> [ (assoc>map) assoc-each ] keep
42 : assoc-map ( assoc quot -- newassoc )
43 over >r [ 2array ] compose V{ } assoc>map r> assoc-like ;
46 : assoc-push-if ( key value quot accum -- )
48 [ >r 2array r> push ] [ 3drop ] if ; inline
50 : assoc-pusher ( quot -- quot' accum )
51 V{ } clone [ [ assoc-push-if ] 2curry ] keep ; inline
53 : assoc-filter ( assoc quot -- subassoc )
54 over >r assoc-pusher >r assoc-each r> r> assoc-like ; inline
56 : assoc-contains? ( assoc quot -- ? )
57 assoc-find 2nip ; inline
59 : assoc-all? ( assoc quot -- ? )
60 [ not ] compose assoc-contains? not ; inline
62 : at ( key assoc -- value/f )
65 M: assoc assoc-clone-like ( assoc exemplar -- newassoc )
66 over assoc-size swap new-assoc
67 swap [ swap pick set-at ] assoc-each ;
69 : keys ( assoc -- keys )
70 [ drop ] { } assoc>map ;
72 : values ( assoc -- values )
73 [ nip ] { } assoc>map ;
75 : delete-at* ( key assoc -- old ? )
76 [ at* ] 2keep delete-at ;
78 : rename-at ( newkey key assoc -- )
79 tuck delete-at* [ -rot set-at ] [ 3drop ] if ;
81 : delete-any ( assoc -- key value )
83 [ 2drop t ] assoc-find
84 [ "Assoc is empty" throw ] unless over
87 : assoc-empty? ( assoc -- ? )
90 : (assoc-stack) ( key i seq -- value )
95 [ >r 3drop r> ] [ drop >r 1- r> (assoc-stack) ] if
98 : assoc-stack ( key seq -- value )
99 dup length 1- swap (assoc-stack) ;
101 : assoc-subset? ( assoc1 assoc2 -- ? )
102 [ swapd at* [ = ] [ 2drop f ] if ] curry assoc-all? ;
104 : assoc= ( assoc1 assoc2 -- ? )
105 [ assoc-subset? ] [ swap assoc-subset? ] 2bi and ;
107 : assoc-hashcode ( n assoc -- code )
109 >r over r> hashcode* 2/ >r dupd hashcode* r> bitxor
110 ] { } assoc>map hashcode* ;
112 : assoc-intersect ( assoc1 assoc2 -- intersection )
113 swap [ nip key? ] curry assoc-filter ;
115 : update ( assoc1 assoc2 -- )
116 swap [ swapd set-at ] curry assoc-each ;
118 : assoc-union ( assoc1 assoc2 -- union )
119 2dup [ assoc-size ] bi@ + pick new-assoc
120 [ rot update ] keep [ swap update ] keep ;
122 : assoc-diff ( assoc1 assoc2 -- diff )
123 [ nip key? not ] curry assoc-filter ;
125 : remove-all ( assoc seq -- subseq )
126 swap [ key? not ] curry filter ;
129 [ dupd at* [ nip ] [ drop ] if ] curry ; inline
131 : substitute-here ( seq assoc -- )
132 (substitute) change-each ;
134 : substitute ( seq assoc -- newseq )
137 : cache ( key assoc quot -- value )
141 drop pick rot >r >r call dup r> r> set-at
144 : change-at ( key assoc quot -- )
145 [ >r at r> call ] 3keep drop set-at ; inline
147 : at+ ( n key assoc -- )
148 [ 0 or + ] change-at ;
150 : map>assoc ( seq quot exemplar -- assoc )
151 >r [ 2array ] compose { } map-as r> assoc-like ; inline
153 : extract-keys ( seq assoc -- subassoc )
154 [ [ dupd at ] curry ] keep map>assoc ;
156 M: assoc >alist [ 2array ] { } assoc>map ;
158 : value-at ( value assoc -- key/f )
159 swap [ = nip ] curry assoc-find 2drop ;
161 : zip ( keys values -- alist )
164 : search-alist ( key alist -- pair i )
165 [ first = ] with find swap ; inline
168 search-alist [ second t ] [ f ] if ;
173 [ drop >r swap 2array r> push ] if ;
175 M: sequence new-assoc drop <vector> ;
177 M: sequence clear-assoc delete-all ;
179 M: sequence delete-at
180 tuck search-alist nip
181 [ swap delete-nth ] [ drop ] if* ;
183 M: sequence assoc-size length ;
185 M: sequence assoc-clone-like
186 >r >alist r> clone-like ;
188 M: sequence assoc-like
189 over sequence? [ like ] [ assoc-clone-like ] if ;
193 ! Override sequence => assoc instance for f
194 M: f clear-assoc drop ;
196 M: f assoc-like drop dup assoc-empty? [ drop f ] when ;
198 INSTANCE: sequence assoc
205 seq>> 2dup bounds-check?
206 [ nth t ] [ 2drop f f ] if ;
208 M: enum set-at seq>> set-nth ;
210 M: enum delete-at enum-seq delete-nth ;
212 M: enum >alist ( enum -- alist )
213 seq>> [ length ] keep zip ;
215 M: enum assoc-size seq>> length ;
217 M: enum clear-assoc seq>> delete-all ;