Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options

Re^2: Schwartzian Transform and memory allocation.

by Aristotle (Chancellor)
on Jun 19, 2002 at 19:21 UTC ( #175812=note: print w/replies, xml ) Need Help??

in reply to Re: Schwartzian Transform and memory allocation.
in thread Schwartzian Transform and memory allocation.

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>);
Makeshifts last the longest.

Replies are listed 'Best First'.
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.



      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.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://175812]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (5)
As of 2020-09-26 08:08 GMT
Find Nodes?
    Voting Booth?
    If at first I donít succeed, I Ö

    Results (141 votes). Check out past polls.