Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?
 
PerlMonks  

Re: How can one join the shortest and longest strings of different text files?

by swampyankee (Parson)
on Jul 04, 2013 at 19:46 UTC ( #1042513=note: print w/replies, xml ) Need Help??


in reply to How can one join the shortest and longest strings of different text files?

I looks like you're about 90% of the way to your solution: you've found the longest and shortest string in each file. Now, what I would do (this is guaranteed to be a less-than-optimal solution) is to a) open the files, using the open function (don't forget to close the files when you're through with them), e.g.,

open(FILE, "<", $this_file) or die "Could not open $this_file because +$!\n";
and, b) scan through the file to find the shortest and longest lines. Store these into hashes:
$long{$file} = $longest_string_in_this_file; $short{$file} = $shortest_string_in_the_same_file;

Repeat for each file, and do whatever joining you wish. If you want to join the two longest and the two shortest lines across files, use a hash of hashes instead of a hash for the longest and shortest lines.

This does seem like an odd question, however. It's not homework, is it?


Information about American English usage here and here. Floating point issues? Please read this before posting. — emc

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (4)
As of 2020-10-01 05:36 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    If at first I donít succeed, I Ö










    Results (175 votes). Check out past polls.

    Notices?