Hi!
Thanks for the fast reply. The blokes use an intersection of the local
and english alphabet, which leaves 22 characters to work with (exclude
x, y, w, q). The wrap only occurs at the end of the alphabet and when
letters from the beginning are being used again. They had agreed on such
nomenclature so it can be safely assumed that the wrap starts after
hitting the letter "z" and coming to "a".
Cheers,
Miha
Chris Wagner wrote:
The problem with ur "type b" sort is that u need some way to automatically
know which letter is "first" in the custom sort. This is a round-robin sort
where the incrementation wraps around to the beginning. U need a way to
save state information between sorts so that the script knows to start this
sort with "w" then maybe next time start with "c", etc. How do u know which
letter is "first"? Even by looking at it??
At 12:16 PM 10/10/05 +0200, Miha Radej wrote:
@files_b = qw(file2w.ext file2a.ext file2z.ext file2b.ext file2.ext
file2x.ext file2y.ext file2c.ext)
problem I have is when instead of an array @files_a I get one like
@files_v, which contains letters from the end of the alpahbet and the
beginning, which should mean that the users ran out of letters and began
from a, b, ... again. I am at a loss how to sort an array like @files_b
_______________________________________________
Perl-Win32-Users mailing list
[email protected]
To unsubscribe: http://listserv.ActiveState.com/mailman/mysubs
