21:: ht->size       ;		( 'ht -- u ) 
22:: ht->table      CELL+ ;	( 'ht -- u ) 
23:: ht->iter_index 2 CELL[] ;	( 'ht -- u ) 
24:: ht->iter_next  3 CELL[] ;	( 'ht -- u ) 
25:: ht->items      4 CELL[] ;	( 'ht -- u ) 
32:	SWAP ( -- val 'ht ) ht->size @  >R U>D R> UM/MOD DROP ; PRIVATE
46:	ht_size ht ht->size !	
47:	ht_size 1+ CELLS ALLOCATE ?ALLOCATE ht ht->table !
48:	ht ht->iter_index OFF
49:	ht ht->iter_next  OFF
50:	ht ht->items      OFF    
55:	ht ht->size @ 
56:	0 ?DO	ht ht->table @ I CELL[] @ TO next
63:	ht ht->table @	FREE ?ALLOCATE
68:	ht ht->table @ hash_code CELL[] @ TO node
78:	ht ht->table @ hash_code CELL[] @ TO node
88:	1  ht ht->items  +!
91:	   ELSE  ht ht->table @ hash_code CELL[] ! 
98:	ht ht->iter_next @  DUP IF  DUP node->next @  ht ht->iter_next !  EXIT  ENDIF  DROP
99:	ht ht->table @ TO h[
100:	ht ht->size  @ 1+
101:	ht ht->iter_index @ 1+
103:	      DUP IF  DUP node->next @  ht ht->iter_next !  
104:	      	      I  ht ht->iter_index  !  
110:	DUP ht->iter_index OFF
111:	DUP ht->iter_next  OFF
154:	mylist ht->items ?
155:	mylist ht->size  ?
