And given knowledge of algorithm (use the source), and the current bucket size, (see the second element of scalar %hash), the ordering is knowable; therefore definable; therefore defined by the implementation(s).
Actually, you have overlooked the order of items on the linked list of a bucket that holds more than one entry.
- tye
In reply to Re^11: What makes an array sorted and a hash unsorted? (nit)
by tye
in thread What makes an array sorted and a hash unsorted?
by ikegami
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |