Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses
 
PerlMonks  

Re: Table shuffling challenge

by Perlbotics (Archbishop)
on Aug 23, 2013 at 17:05 UTC ( [id://1050694]=note: print w/replies, xml ) Need Help??


in reply to Table shuffling challenge

Some ideas:

  • keep all lines in memory (110,000 x 11 doesn't seem too big)
  • avoid splice() and other list operations
  • creative use of pack()/unpack()?
  • try this: shuffle columns (1..10, but not 0) once (List::Util) for each row; then perform operations for one column after another (fixed index: 1..10)
  • maybe combine shuffle and looping for each row with a suitable buffer, so you need to visit all 110,000 rows only once?

HTH

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others learning in the Monastery: (3)
As of 2024-04-20 01:19 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found