I am not sure I have described the methods properly nor am I opposed to just adding the functionality to Tie::Hash::Sorted. The rationale for breaking them out is because they would dramatically change the way the hash behaved. Basically it would only be giving you a window of the hash. So if the hash had 50 keys but you had set Top_X to 10, looping over the keys of the hash would only loop 10 times. Additionally, having direct access to the underlying array will give wrong unexpected results. This is due to the way the optimizations have been added in. Resorting (and hence array creation) is only done when necessary.
Thanks for the idea about a median method. I am not sure about the name suggestion since I think we may be talking past each other.
Cheers - L~R
In reply to Re^2: RFC - Tie::Hash::Ranked
by Limbic~Region
in thread RFC - Tie::Hash::Ranked
by Limbic~Region
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |