No, you would have to write your own sort routine to compare them. I suggest splitting the OID up on the dots, looking for the first difference, and compare those two elements numerically.
Keep in mind that you can't really 'sort' the hash itself. You can only display a sorted representation of the hash.
In reply to Re: sort hash by value
by archon
in thread sort hash by value
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |