Many thanks to Scott, Shawn, Paul, Jenda, and Uri. I've learned
something from each of you, and appreciate your taking the time to help!
Rick
--
To unsubscribe, e-mail: beginners-unsubscr...@perl.org
For additional commands, e-mail: beginners-h...@perl.org
http://learn.perl.org/
From: Shawn H Corey
> Jenda Krynicky wrote:
> > ST is an overkill if the extraction is simple.
> >
> > Especially if the number of items is fairly small.
> >
> > Actually if the extraction is really simple and the extracted key is
> > not so small, than ST may perform worse than an ordinary so
>-Original Message-
>From: Rick Triplett [mailto:r...@reason.net]
>Sent: Tuesday, October 13, 2009 12:09 PM
>To: Perl Beginners
>Subject: Sorting mixed alphanumerics
>
>I need to sort the keys in a hash. The keys are the question number
>and the values are the stu
> "SHC" == Shawn H Corey writes:
SHC> Jenda Krynicky wrote:
>> ST is an overkill if the extraction is simple.
>>
>> Especially if the number of items is fairly small.
>>
>> Actually if the extraction is really simple and the extracted key is
>> not so small, than ST may perf
Jenda Krynicky wrote:
> ST is an overkill if the extraction is simple.
>
> Especially if the number of items is fairly small.
>
> Actually if the extraction is really simple and the extracted key is
> not so small, than ST may perform worse than an ordinary sort doing
> the extraction within t
Date sent: Wed, 14 Oct 2009 11:03:13 -0400
From: Shawn H Corey
To: Rick Triplett
Copies to: Perl Beginners
Subject:Re: Sorting mixed alphanumerics
> Rick Triplett wrote:
> > I need to sort the keys in a
On Tue, Oct 13, 2009 at 11:09:09AM -0500, Rick Triplett wrote:
> I need to sort the keys in a hash. The keys are the question number and
> the values are the student's answer. A numeric sort with <=> won't work
> since retaking a missed question (say, 2) produces the new key, 2h with
> its new a
Rick Triplett wrote:
> I need to sort the keys in a hash. The keys are the question number and
> the values are the student's answer. A numeric sort with <=> won't work
> since retaking a missed question (say, 2) produces the new key, 2h with
> its new answer. A representative hash might look like
I need to sort the keys in a hash. The keys are the question number
and the values are the student's answer. A numeric sort with <=> won't
work since retaking a missed question (say, 2) produces the new key,
2h with its new answer. A representative hash might look like this
1 => b
2h => c
3
