I would think that a HoH does not bring any algorithmic advantage…
Its advantage is that it's more space-efficient. Each unique first-level key (fruit names in lecb's example) is always stored exactly once rather than sometimes stored twice.
Whether or not space efficiency is the advantage lecb is optimizing for, I can't say.
In reply to Re^4: Unique key identifer?
by Jim
in thread Unique key identifer?
by lecb
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |