On Mon, May 07, 2007 at 05:13:12PM +0100, Nigel Peck wrote:
> I'd like to find a way of comparing the two MySQL database
> strcutures and getting a list of the differences, anyone know of any
> modules/methods for doing this?
I don't know about something Perl-specific, but I guess what you want i
On Fri, May 04, 2007 at 07:36:57PM +0800, Jeff Pang wrote:
> Since you've got the sorted keys,can't you access the full hash?
Well, it works this way -- thanks!
But I wonder why it's not possible to sort a hash in a more intuitive
way...
Leslie
--
Personal homepage: https://viridian.dnsalia
On Fri, May 04, 2007 at 04:05:46AM -0700, John W. Krahn wrote:
> my @toc_keys = sort { $toc{ $a }{ lines } <=> $toc{ $b }{ lines } } keys %toc;
I don't think this will do what I want. I want the full hash structure
preserved, not an array of the keys sorted by 'lines'...
Leslie
--
Personal
Hello guys,
I can't find the solution for sorting a two-dimensional hash.
I'm sure some of you can help me.
The first dimension of the hash has filenames in it, the second
consists of two keys, 'data' and 'lines'.
I want to sort the whole thing by a numerical comparison on 'lines'
and tri
