Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re^5: A complicated file parsing and 2D array/matrix problem.

by Kenosis (Priest)
on Aug 27, 2012 at 18:18 UTC ( #990035=note: print w/replies, xml ) Need Help??

in reply to Re^4: A complicated file parsing and 2D array/matrix problem.
in thread A file parsing and 2D array/matrix problem.

Hi, zing!

What have you tried so far to solve this puzzle?

  • Comment on Re^5: A complicated file parsing and 2D array/matrix problem.

Replies are listed 'Best First'.
Re^6: A complicated file parsing and 2D array/matrix problem.
by zing (Beadle) on Aug 27, 2012 at 19:20 UTC
    Kenosis, This is what Im trying, but is throwing a lot of errors.
    open FILE, "Matrix.txt" or die $!; my @lines = <FILE>; my $size = scalar @lines; my @matrix = (1 .. 3); my $i = 0; my $j = 0; my @micro; foreach ($matrix) { foreach ($lines) { push @{ $micro[$matrix]}, $lines; } }

    CONTENTS OF matrix.txt

    1 2 3 4

    1 5 6 8

    1 7 8 0

    I need to be able to access each element of the matrix thus created on a "one by one basis".

      It may be best to work on the A.txt and B.txt data sets you showed. If you can create a script to generate the ORed results of those two matrices, then it's most likely that script will work with larger matrices.

      First, always begin your scripts with either:

      use strict; use warnings;


      use Modern::Perl;

      I prefer the latter, since it includes the former two pragmas--among other things.

      You can use File::Slurp qw/read_file/; to read a file's contents into an array. The foreach() takes a list or array--not a scalar, like you've done. That would account for some of the errors.

      Here's one way to approach the problem:

      1. Read both matrix files into arrays.
      2. The first element (row 0) of each array is identical, as it contains the column titles. Grab those and create the title string (like in the first script, but w/o sorting), and move to the next rows (1 .. n) of the two arrays.
      3. Split each row (1 .. n) of the two arrays into their elements, placing those elements into two element arrays. The zeroth element of these arrays contains the row label.
      4. Do an OR comparison between the two element arrays (1 .. n), and build an OR-result array for the table.
      5. Finally, build the table and print it.

      The scripting that produced the first table should help with reading files and building the table.

      Step through this scripting process, and then share what you've completed. A script can be created to produce the ORed output you need; it'll just take a little more work...

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://990035]
[shmem]: perl -e 'warn "test$/", ^@^ '
[Eily]: well, at least it's right about warn doing the same thing as die :)
[shmem]: same with undef as last element
[msh210]: oh, good point. It's the best kind of correct
[shmem]: msh210: but I'd not call it a lie outright. That's when you do know the truth.
[msh210]: I don't have sendmail (I'm on MS Windows), so does one of you think you can report the bug?
[shmem]: msh210: 'tis about time to tell the sad truth to perl5porters - via perlbug
[msh210]: probably whoever wrote that actually knows the truth
[shmem]: msh210: you can save the perlbug text in a file and send that via your mail agent of choice
[msh210]: hm, okay, I'll try, thanks

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (15)
As of 2017-04-24 12:45 GMT
Find Nodes?
    Voting Booth?
    I'm a fool:

    Results (439 votes). Check out past polls.