I wrote Tie::Hash::Sorted as a result of someone at this site wanting a sorted hash. It was written with every effort at optimizations a monk with a little over a year of perl under his belt could muster.
Cheers - L~R
In reply to Re^2: How to Iterate to Identify Concurrent Users (trees, merge)
by Limbic~Region
in thread How to Iterate to Identify Concurrent Users
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |