data: one trie for maps and dictionaries, one loader

The hash map served a single exact-match lookup that the trie already
answers, at the price of a second container, a second file loader with
its own drift, and a Str-to-UTF-8 conversion on every chain probe. The
files are small (kanji.dict is 7.5k lines), so the trie holds both.
trieopen validates keys and each space-separated value word against Str
and reports path:line; trielookup takes the Str every caller holds and
treats a nil trie as an unloaded map; trienew/trieput exist for tests.
The overflow guards on growth, Trie.root (always 0) and the per-language
init loop written twice are gone.

tests/unit_test.c

@@ -67,11 +67,8 @@ static const struct ct_test tests[] = {
 	{ "str/edit-and-alias", str_edit_and_alias },
 	{ "str/utf8-capacity", str_utf8_capacity },
 	{ "str/invalid-full-appends", str_invalid_and_full_appends },
-	{ "hmap/set-replace-grow", hmap_set_replace_and_grow },
-	{ "hmap/long-utf8-keys", hmap_long_utf8_keys },
-	{ "hmap/binary-invalid-lengths", hmap_binary_keys_and_invalid_lengths },
 	{ "trie/exact-prefix-duplicate", trie_exact_prefix_and_duplicate },
-	{ "trie/optional-invalid-lengths", trie_optional_outputs_and_invalid_lengths },
+	{ "trie/put-and-unloaded", trie_put_and_unloaded },
 	{ "popup/layout", popup_layout },
 	{ "font/render", font_render },
 	{ "map/production-lifecycle", production_maps_load },