Retrieving sorted keys - Githubissues

Tessil / hat-trie

C++ implementation of a fast and memory efficient HAT-trie

MIT License

792 stars 114 forks source link

Retrieving sorted keys #24

Closed mr-eyes closed 5 years ago

mr-eyes commented 5 years ago

Hi,

I'm using the tsl::htrie_map for inserting DNA fixed-size strings as keys (4-bases ACGT). Is there any option to iterate over sorted keys? I didn't find anything related to that in the documentations.

Thanks.

Tessil commented 5 years ago

Hi,

Unfortunately it's isn't currently possible. It could be possible to sort the keys in the hash map part of the HAT-Trie while iterating but I think other trie structures may be better suited if the keys need to be sorted.

Thibaut