void function ( K [ ] arg0 , V arg1 ) { Node loc0 = root . get ( arg0 [ 0 ] ) ; if ( loc0 == null ) { loc0 = new Node ( arg0 [ 0 ] ) ; root . put ( arg0 [ 0 ] , loc0 ) ; } loc0 . addChild ( arg0 , arg1 , 1 ) ; }
add a key with associated value to the trie . concode_field_sep int size concode_elem_sep LinkedList<Node> children concode_elem_sep HashMap<K,Node> root concode_elem_sep V value concode_elem_sep K key concode_field_sep K getKey concode_elem_sep V getValue concode_elem_sep int size concode_elem_sep V getChild concode_elem_sep Node getChild concode_elem_sep V get concode_elem_sep Node get concode_elem_sep void addChild