are the keys being created in the correct "sorted" order?
Unfortunately not. Otherwise I could just assign the values at the same time I create the keys.
Also, the implementation of Tie::IxHash is such that it consumes ~3x times the memory of a standard hash.
In reply to Re^2: In-place sort with order assignment
by BrowserUk
in thread In-place sort with order assignment
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |