Re^4: sockets and such in Perl

The problem here is that, since I have to assume that each file/list is infinite, I can never get the total number of matching lines in Process 1 and 2. In a way, this is why the files are alphabetized, because at the point I get a match in 1 and 2, I have to be able to tell (from a finite range of names) if 3 has any kind of match. Alphabetically I can look at the list and say, "well with the match I have in 2, if I get to a point in list 3 that is alphabetically after my match, then I can definitively say that the 3 list has no match"

quick question - will the following work:

my $socket = IO::Socket::INET->new( LocalPort => $PORT,
Proto => 'tcp',    Listen => 2)
or die "Can't create socket on port $PORT to Second($!)\n";

while (<FILE>) 
{
    print $socket $_;
    
    if(my $second = $socket->accept())
    {
        #if someone sends me something, do something with it
        #then go back to sending the rest of the file
    }
}
[download]

Can I do this?

Comment on Re^4: sockets and such in Perl Download Code

Replies are listed 'Best First'.
Re^5: sockets and such in Perl by nothingmuch (Priest) on Jul 04, 2005 at 03:39 UTC
There's really no need to accumilate all input =) Let's go through three imaginary lists: `bar baz foo gorch ... baz foo fuzzy gorch ... bar bar bar gorch ...` [download] process 1 gets the first line, and just prints that stream out. Process 2 gets the output of process one, and it's own input. So process 2 reads 'bar' coming from proc 1, and then reads a line from it's own input, and sees that it's 'baz'. Since 'baz' comes after 'bar', we know that we need to progress the first input, so we read another line from proc 1. We got 'baz'. So now we have 'baz' and 'baz'. We print that out, and continue. Then it reads 'foo' from process 1, and 'foo' from process two. That is also printed. Next come 'gorch' and 'fuzzy'. They aren't the same. since 'fuzzy' is alphabetically earlier than 'gorch', we read the next word from process 2's input. The next line is 'gorch'. Since 'gorch' eq 'gorch', we print that out too. And so on and so forth... This process goes on infinitely. As much as process 3 likes to read from it. process 3 does the same job, only the stream it sees is 'baz', 'foo', 'gorch' ..., that is, the list of matches from the previous runs. The way it works is the same - it reads a line from the output of process 2 - 'baz', and a line from it's own input - 'bar'. 'bar' comes before 'baz', so we read more from process 3's input. it's 'bar' two more times, so we just keep on skipping. The next thing we find is 'gorch'. Since 'gorch' comes later than 'baz', we read from process 2's output instead of process 3's input - 'foo'. 'foo' lt 'gorch', so we skip more - 'gorch'. 'gorch' eq 'gorch' - that's the first match. We can stop now. -nuffin zz zZ Z Z #!perl	[reply] [d/l]

Replies are listed 'Best First'.

Re^5: sockets and such in Perl
by nothingmuch (Priest) on Jul 04, 2005 at 03:39 UTC

Let's go through three imaginary lists:

bar baz foo gorch ...
baz foo fuzzy gorch ...
bar bar bar gorch ...
[download]

Process 2 gets the output of process one, and it's own input.

So process 2 reads 'bar' coming from proc 1, and then reads a line from it's own input, and sees that it's 'baz'. Since 'baz' comes after 'bar', we know that we need to progress the first input, so we read another line from proc 1. We got 'baz'. So now we have 'baz' and 'baz'. We print that out, and continue. Then it reads 'foo' from process 1, and 'foo' from process two. That is also printed. Next come 'gorch' and 'fuzzy'. They aren't the same. since 'fuzzy' is alphabetically earlier than 'gorch', we read the next word from process 2's input. The next line is 'gorch'. Since 'gorch' eq 'gorch', we print that out too. And so on and so forth...

This process goes on infinitely. As much as process 3 likes to read from it.

process 3 does the same job, only the stream it sees is 'baz', 'foo', 'gorch' ..., that is, the list of matches from the previous runs.

The way it works is the same - it reads a line from the output of process 2 - 'baz', and a line from it's own input - 'bar'. 'bar' comes before 'baz', so we read more from process 3's input. it's 'bar' two more times, so we just keep on skipping. The next thing we find is 'gorch'. Since 'gorch' comes later than 'baz', we read from process 2's output instead of process 3's input - 'foo'. 'foo' lt 'gorch', so we skip more - 'gorch'. 'gorch' eq 'gorch' - that's the first match. We can stop now.

-nuffin
zz zZ Z Z #!perl

[reply]
[d/l]