Re: Schwartzian Transform and memory allocation.

Replies are listed 'Best First'.
Re: Schwartzian Transform and memory allocation. by Abigail-II (Bishop) on Jun 19, 2002 at 16:40 UTC
In that case, you could easily save some memory: `@file_data = map { $_ -> [0]} sort { $a -> [1] cmp $b -> [1]} map {[$_ => (split /\\|/) [$variable - 1]]} @file_data;` [download] No need to use a 759 41 element arrays if you can do it with just 2 elements! Abigail	[reply] [d/l]
Re: Re: Schwartzian Transform and memory allocation. by ThingFish (Beadle) on Jun 21, 2002 at 16:37 UTC
Modifying my original code as per Abigail-II's suggestion dropped memory usage an entire meg. Abigail-II++.	[reply]
Re^2: Schwartzian Transform and memory allocation. by Aristotle (Chancellor) on Jun 19, 2002 at 19:21 UTC
Why split once for the Schwartzian Transform then again for the output? `open FILE, "<$data_file"; my @file_data = sort { $a->[$variable-1] cmp $b->[$variable-1] }, map [ split(/\\|/) ], <FILE>; close FILE; print qq(<TABLE BORDER="1">); for my $row (@file_data){ print ( qq(<TR>), map(qq(<TD>$_</TD>), @$row), qq(</TR>) ); } print qq(</TABLE>);` [download] `____________` Makeshifts last the longest.	[reply] [d/l]
Re^3: Schwartzian Transform and memory allocation. by flounder99 (Friar) on Jun 20, 2002 at 13:41 UTC
I think the `sort { $a->[$variable-1] cmp $b->[$variable-1] },` line should be `sort { $a->[$variable] cmp $b->[$variable] },` The `-1` was added by abigail to skip over the `$_` that was tacked on at the beginning of the anon array. You're no longer doing that. -- flounder	[reply] [d/l] [select]
Re^4: Schwartzian Transform and memory allocation. by Aristotle (Chancellor) on Jun 20, 2002 at 22:53 UTC
No, actually, Abigail added the -1 because there was no longer an extra element to skip over. It doesn't make sense to subtract 1 to skip over an extra element, does it? The same premise holds true in my snippet as well. Makeshifts last the longest.	[reply]


Perl: the Markov chain saw
	PerlMonks