1 ! Copyright (C) 2012 John Benediktsson, Doug Coleman
2 ! See http://factorcode.org/license.txt for BSD license
4 USING: arrays assocs assocs.private kernel math sequences ;
8 : of ( assoc key -- value ) swap at ; inline
10 : assoc-harvest ( assoc -- assoc' )
11 [ nip empty? not ] assoc-filter ; inline
13 : deep-at ( assoc seq -- value/f )
14 [ swap at ] each ; inline
16 : zip-as ( keys values exemplar -- assoc )
18 [ 2array ] swap 2map-as
20 [ 2dup min-length ] dip new-assoc
21 [ [ set-at ] with-assoc 2each ] keep
24 : substitute! ( seq assoc -- seq )
27 : assoc-reduce ( ... assoc identity quot: ( ... prev key value -- next ) -- ... result )
28 [ >alist ] 2dip [ first2 ] prepose reduce ; inline
30 : reduce-keys ( ... assoc identity quot: ( ... prev elt -- ... next ) -- ... result )
31 [ drop ] prepose assoc-reduce ; inline
33 : reduce-values ( ... assoc identity quot: ( ... prev elt -- ... next ) -- ... result )
34 [ nip ] prepose assoc-reduce ; inline
36 : sum-keys ( assoc -- n ) 0 [ + ] reduce-keys ; inline
38 : sum-values ( assoc -- n ) 0 [ + ] reduce-values ; inline
40 : if-assoc-empty ( ..a assoc quot1: ( ..a -- ..b ) quot2: ( ..a assoc -- ..b ) -- ..b )
41 [ dup assoc-empty? ] [ [ drop ] prepose ] [ ] tri* if ; inline
43 : assoc-invert-as ( assoc exemplar -- newassoc )
44 [ swap ] swap assoc-map-as ;
46 : assoc-invert ( assoc -- newassoc )