Hi Gábor,
On Wed, 28 Aug 2019, SZEDER Gábor wrote:
> Implement find_unique_prefixes() by sorting the prefix items
> lexicographically and then looking for unique prefixes in adjacent
> pairs. It's definitely shorter than the current hashmap-based
> implementation (101 vs 149 lines), subjectively
Implement find_unique_prefixes() by sorting the prefix items
lexicographically and then looking for unique prefixes in adjacent
pairs. It's definitely shorter than the current hashmap-based
implementation (101 vs 149 lines), subjectively easier to follow, and
hopefully less buggy (some of the new
2 matches
Mail list logo