On Mon, Jan 07, 2008 at 05:23:36PM -0800, Dave Whipp wrote:
> The tests in S02 L
> appear to assume that an interpolated hash renders its keys in a sorted
> order. But this property doesn't seem to be stated in the text. Is it true
> that the keys are always sorted for interpolation?
No, the te
Dave Whipp wrote:
> The tests in S02 L
> appear to assume that an interpolated hash renders its keys in a sorted
> order. But this property doesn't seem to be stated in the text. Is it
> true that the keys are always sorted for interpolation? (is it possible,
> in P6, for hash keys to not be compar
The tests in S02 L
appear to assume that an interpolated hash renders its keys in a sorted
order. But this property doesn't seem to be stated in the text. Is it
true that the keys are always sorted for interpolation? (is it possible,
in P6, for hash keys to not be comparable?)
