Adds a comment which explains the trie structure, and also does a little arithmetic on lookup (no measurable impact, looks like modern CPUs do this arithmetic in parallel with the memory lookup to find the node) to save a bit of space. As a result, the memory impact of the compiled tables is within a couple hundred bytes of the old bsearch-range structure. |
||
|---|---|---|
| .. | ||
| Cargo.toml | ||
| char.rs | ||
| lib.rs | ||
| tables.rs | ||
| u_str.rs | ||