-
Notifications
You must be signed in to change notification settings - Fork 205
/
leaf.factor
26 lines (20 loc) · 942 Bytes
/
leaf.factor
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
! Based on Clojure's PersistentHashMap by Rich Hickey.
USING: accessors arrays kernel make persistent.hashtables.nodes ;
IN: persistent.hashtables.nodes.leaf
: matching-key? ( key hashcode leaf-node -- ? )
[ nip ] [ hashcode>> eq? ] 2bi
[ key>> = ] [ 2drop f ] if ; inline
M: leaf-node (entry-at) [ matching-key? ] 1guard ;
M: leaf-node (pluck-at) [ matching-key? not ] 1guard ;
M:: leaf-node (new-at) ( shift value key hashcode leaf-node -- node' added-leaf )
hashcode leaf-node hashcode>> eq? [
key leaf-node key>> = [
value leaf-node value>> =
[ leaf-node f ] [ value key hashcode <leaf-node> f ] if
] [
value key hashcode <leaf-node> :> new-leaf
hashcode leaf-node new-leaf 2array <collision-node>
new-leaf
] if
] [ shift leaf-node value key hashcode make-bitmap-node ] if ;
M: leaf-node >alist% [ key>> ] [ value>> ] bi 2array , ;