CODEWITHSUNDEEP
c++hash
SuperString
SuperString

Reputation: 22519

Order preserving minimal perfect hash functions

I want to implement an OPMPH function for the words in a dictionary in C++. How do I do it?

Thanks!

Upvotes: 3

Views: 1654

Answers (3)

joshperry
joshperry

Reputation: 42297

If you need alphabetical order use a Trie or a DAWG (like I recommended in your last question). For an order besides alphabetic I would use a binary tree (std::map in C++ is implemented with a red-black tree usually).

Implementing an order preserving hash container sounds like the mother of all early optimizations.

Upvotes: 1

wallyk
wallyk

Reputation: 57794

Have you looked at these papers?

Upvotes: 3

Hans Passant
Hans Passant

Reputation: 942267

Limit your word length to 6 letters or less and you might be able to make it work. Not very practical.

Upvotes: 1

Related Questions