[32334] in Perl-Users-Digest
Perl-Users Digest, Issue: 3601 Volume: 11
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Sat Jan 28 11:09:27 2012
Date: Sat, 28 Jan 2012 08:09:07 -0800 (PST)
From: Perl-Users Digest <Perl-Users-Request@ruby.OCE.ORST.EDU>
To: Perl-Users@ruby.OCE.ORST.EDU (Perl-Users Digest)
Perl-Users Digest Sat, 28 Jan 2012 Volume: 11 Number: 3601
Today's topics:
Error checking reads <dave@invalid.invalid>
Re: Error checking reads <tadmc@seesig.invalid>
Re: Error checking reads <dave@invalid.invalid>
help with perl <fabiomarinucci@gmail.com>
Re: help with perl (Jens Thoms Toerring)
Re: help with perl <tadmc@seesig.invalid>
Re: help with perl <jurgenex@hotmail.com>
job cull; Warner Brothers; try this <catebekensail@yahoo.com>
Re: job cull; Warner Brothers; try this <ben@morrow.me.uk>
Re: job cull; Warner Brothers; try this (Tim McDaniel)
Re: job cull; Warner Brothers; try this <catebekensail@yahoo.com>
Re: job cull; Warner Brothers; try this <rweikusat@mssgmbh.com>
Re: job cull; Warner Brothers; try this <cwilbur@chromatico.net>
Re: job cull; Warner Brothers; try this <rweikusat@mssgmbh.com>
Re: job cull; Warner Brothers; try this (Tim McDaniel)
Re: job cull; Warner Brothers; try this <rweikusat@mssgmbh.com>
Re: job cull; Warner Brothers; try this <tzz@lifelogs.com>
Re: job cull; Warner Brothers; try this <tzz@lifelogs.com>
Re: ssh tunnel <tadmc@seesig.invalid>
Digest Administrivia (Last modified: 6 Apr 01) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: Sat, 28 Jan 2012 15:01:21 +0000 (UTC)
From: "Dave Saville" <dave@invalid.invalid>
Subject: Error checking reads
Message-Id: <fV45K0OBJxbE-pn2-GbHMpLdSdVhd@localhost>
I was taught to check *anything* that produced a return code. In I
think all perl programs I have ever seen I see opens followed by "or
die ....."
But how does one check the <> operator? I suppose one could code
my @a = <$somehandle> or die .........
and
my $a = <$somehandle> or die ...........
but what about
while ( <$somehandle> )
?
TIA
--
Regards
Dave Saville
------------------------------
Date: Sat, 28 Jan 2012 09:08:43 -0600
From: Tad McClellan <tadmc@seesig.invalid>
Subject: Re: Error checking reads
Message-Id: <slrnji84al.qai.tadmc@tadbox.sbcglobal.net>
Dave Saville <dave@invalid.invalid> wrote:
> I was taught to check *anything* that produced a return code.
A rather obvious exception is the return value from print().
Once you have a properly opened filehandle, about the only thing
that can go wrong is "file system full", and if that happens, you
won't need your little Perl program to tell you that something is
wrong, because the whole 'puter will stop working. :-)
> In I
> think all perl programs I have ever seen I see opens followed by "or
> die ....."
Unless
use autodie;
> But how does one check the <> operator?
Once you know that the named version of the <> operator is readline(),
then you can just read its docs for that :-)
perldoc -f readline
If readline encounters an operating system error, C<$!> will be set
with the
corresponding error message. It can be helpful to check C<$!> when
you are
reading from filehandles you don't trust, such as a tty or a socket.
--
Tad McClellan
email: perl -le "print scalar reverse qq/moc.liamg\100cm.j.dat/"
The above message is a Usenet post.
I don't recall having given anyone permission to use it on a Web site.
------------------------------
Date: Sat, 28 Jan 2012 16:01:02 +0000 (UTC)
From: "Dave Saville" <dave@invalid.invalid>
Subject: Re: Error checking reads
Message-Id: <fV45K0OBJxbE-pn2-KYZwuMt4On3d@localhost>
On Sat, 28 Jan 2012 15:08:43 UTC, Tad McClellan <tadmc@seesig.invalid>
wrote:
Thanks Tad
> Dave Saville <dave@invalid.invalid> wrote:
>
> > I was taught to check *anything* that produced a return code.
>
>
> A rather obvious exception is the return value from print().
>
> Once you have a properly opened filehandle, about the only thing
> that can go wrong is "file system full", and if that happens, you
> won't need your little Perl program to tell you that something is
> wrong, because the whole 'puter will stop working. :-)
>
>
> > In I
> > think all perl programs I have ever seen I see opens followed by "or
> > die ....."
>
>
> Unless
>
> use autodie;
>
>
> > But how does one check the <> operator?
>
>
> Once you know that the named version of the <> operator is readline(),
> then you can just read its docs for that :-)
I do now :-)
>
> perldoc -f readline
>
>
> If readline encounters an operating system error, C<$!> will be set
> with the
> corresponding error message. It can be helpful to check C<$!> when
> you are
> reading from filehandles you don't trust, such as a tty or a socket.
Yes, it was sockets that brought the whole thing up.
Thanks again.
--
Regards
Dave Saville
------------------------------
Date: Sat, 28 Jan 2012 05:14:29 -0800 (PST)
From: Vip <fabiomarinucci@gmail.com>
Subject: help with perl
Message-Id: <64f72ed9-3fe5-42fd-91db-17951b55b575@l16g2000vbl.googlegroups.com>
I have this problem to solve but i don't know how!
Develop a Perl program that receives as argument on the command line
the name of a file in the working directory (containing one DNA
sequence in FASTA format) and prints the content of the file with the
whole sequence in uppercase character.
-It checks the number of arguments received on the command line and if
the number is not 1 it prints an error message and exits.
Can anyone tell me how to develop this fuctions with perl?
------------------------------
Date: 28 Jan 2012 14:04:44 GMT
From: jt@toerring.de (Jens Thoms Toerring)
Subject: Re: help with perl
Message-Id: <9oidjsFqe0U1@mid.uni-berlin.de>
Vip <fabiomarinucci@gmail.com> wrote:
> I have this problem to solve but i don't know how!
>
> Develop a Perl program that receives as argument on the command line
> the name of a file in the working directory (containing one DNA
> sequence in FASTA format) and prints the content of the file with the
> whole sequence in uppercase character.
> -It checks the number of arguments received on the command line and if
> the number is not 1 it prints an error message and exits.
Homework? And what have you tried so far?
> Can anyone tell me how to develop this fuctions with perl?
- Check the number of elements in the command line arguments
array @ARGV, if it's not 1 print an error message and exit.
- Use the open() function to open the file using the first
element of the argument array.
- Read it in line by line (using the '<>' operator) and
- if it's a line with a DNA sequence use the uc() function to
convert all characters to upper case (read the specification
of the FASTA format to figure out how these lines are diffe-
rent from description lines - seems to be trivial)
- print out the line.
- Close the file using the close() function.
Regards, Jens
--
\ Jens Thoms Toerring ___ jt@toerring.de
\__________________________ http://toerring.de
------------------------------
Date: Sat, 28 Jan 2012 09:16:50 -0600
From: Tad McClellan <tadmc@seesig.invalid>
Subject: Re: help with perl
Message-Id: <slrnji84ps.qai.tadmc@tadbox.sbcglobal.net>
Vip <fabiomarinucci@gmail.com> wrote:
> Subject: Re: help with perl
You are not requesting help with Perl.
You are requesting that someone else write your program for you.
Do your own work.
If you truly need help, then show what you tried, describe what it is
doing and what it should do instead.
You are not fooling anybody...
> I have this problem to solve but i don't know how!
If you show us what you have tried so far, we will help you fix it.
> Develop a Perl program that receives as argument on the command line
Read about @ARGV
perldoc perlvar
> the name of a file in the working directory (containing one DNA
> sequence in FASTA format) and prints the content of the file
Learn how to open a file:
perldoc -f open
Learn how to print to a file:
perldoc -f print
> with the
> whole sequence in uppercase character.
Learn about functions that manipulate case:
perldoc -f uc
> -It checks the number of arguments received on the command line and if
> the number is not 1 it prints an error message and exits.
perldoc perlintro
has a section named "Numeric comparison" in it...
> Can anyone tell me how to develop this fuctions with perl?
It will require that you learn a bit of Perl programming!
--
Tad McClellan
email: perl -le "print scalar reverse qq/moc.liamg\100cm.j.dat/"
The above message is a Usenet post.
I don't recall having given anyone permission to use it on a Web site.
------------------------------
Date: Sat, 28 Jan 2012 07:25:26 -0800
From: Jürgen Exner <jurgenex@hotmail.com>
Subject: Re: help with perl
Message-Id: <l948i75kodqm2v45ai0cn7l11j5u7vck1j@4ax.com>
Vip <fabiomarinucci@gmail.com> wrote:
>Develop a Perl program that receives as argument on the command line
See "perldoc perlvar" and look for @ARGV
>the name of a file in the working directory (containing one DNA
>sequence in FASTA format) and prints
perldoc - f print
>the content of the file
perldoc -f readline
>with the
>whole sequence in uppercase character.
perldoc -f uc
>-It checks the number of arguments received on the command line
perldoc -f scalar
>and if
>the number is not 1
perldoc perlop
>it prints an error message
perldoc -f print
>and exits.
perldoc -f exit
>Can anyone tell me how to develop this fuctions with perl?
Typically you would use the editor of your choice to write the code,
save it to your hard drive, and test it. Repeat until it does what it is
supposed to do.
jue
------------------------------
Date: Fri, 27 Jan 2012 05:32:22 -0800 (PST)
From: cate <catebekensail@yahoo.com>
Subject: job cull; Warner Brothers; try this
Message-Id: <a580a8b6-fac3-492b-aa59-0621a5c8ad46@t13g2000yqg.googlegroups.com>
I want to see what a real jones can do with this.. IF you're bored.
Here's the interview question:
http://www.codeeval.com/public_sc/14/
Here's the kluge I came up with (they won't be talking to me!) ... a
mess. Show me the 3 liner you guys could do.
@s = (a,h,t); # sorting would give you this
@result = ();
for ($i=0; $i < @s; $i++) {
my $pa = [];
push @$pa, $s[$i];
nextone($max = 20, $i, $pa, @s);
}
print "Answer : " . join (",", @result) . "\n";
sub nextone {
my ($max,# (u) sentinel
$i, # (i) index of current character already pushed
$pa, # (u) word assembly
@s # (u) original, sorted word characters
) = @_;
if ($max-- < 1) {
print "max reached \n";
exit;
}
my $lengtharray = scalar(@s);
if ($lengtharray == 1) {
push @result, join("", @{$pa});
pop @{$pa};
return;
}
if ($i == 0 ) {
@s = @s[1 .. $lengtharray - 1];
} elsif ($i > 0) {
@s = @s[0 .. $i - 1, $i+1 .. $lengtharray - 1];
}
for (my $j = 0; $j < scalar @s; $j++) {
$l = scalar @s;
push @{$pa}, $s[$j];
nextone($max, $j, $pa, @s);
}
pop @{$pa};
}
=================================================
in case the site changes
Challenge Description
Write a program to print out all the permutations of a string in
alphabetical order.
Input
The first argument will be a text file containing an input string, one
per line. e.g.
hat
Output
Print to stdout, permutations of the string, comma separated, in
alphabetical order.
e.g.
aht,ath,hat,hta,tah,tha
------------------------------
Date: Fri, 27 Jan 2012 14:54:40 +0000
From: Ben Morrow <ben@morrow.me.uk>
Subject: Re: job cull; Warner Brothers; try this
Message-Id: <geqav8-1042.ln1@anubis.morrow.me.uk>
Quoth cate <catebekensail@yahoo.com>:
>
> Here's the interview question:
>
> http://www.codeeval.com/public_sc/14/
>
>
> Here's the kluge I came up with (they won't be talking to me!) ... a
> mess. Show me the 3 liner you guys could do.
#!/opt/perl/bin/perl -nl
use warnings;
use strict;
sub permute; # grr
sub permute {
@_ > 1 or return @_;
return map {
my @new = @_;
my $first = splice @new, $_, 1;
map $first . $_, permute @new;
} 0..$#_;
}
print join ",", sort +permute split //;
__END__
Ben
------------------------------
Date: Fri, 27 Jan 2012 16:17:13 +0000 (UTC)
From: tmcd@panix.com (Tim McDaniel)
Subject: Re: job cull; Warner Brothers; try this
Message-Id: <jfuim9$81s$1@reader1.panix.com>
In article <a580a8b6-fac3-492b-aa59-0621a5c8ad46@t13g2000yqg.googlegroups.com>,
cate <catebekensail@yahoo.com> wrote:
>I want to see what a real jones can do with this.. IF you're bored.
>Here's the interview question:
Just speaking for me, I'm not fond of the notion of posting interview
programming questions, and especially not of answers. It feels to me
vaguely like cheating.
--
Tim McDaniel, tmcd@panix.com
------------------------------
Date: Fri, 27 Jan 2012 08:29:22 -0800 (PST)
From: cate <catebekensail@yahoo.com>
Subject: Re: job cull; Warner Brothers; try this
Message-Id: <58c3779c-dc17-44fc-8179-ca5c1fcf4a53@k28g2000yqc.googlegroups.com>
On Jan 27, 10:17=A0am, t...@panix.com (Tim McDaniel) wrote:
> In article <a580a8b6-fac3-492b-aa59-0621a5c8a...@t13g2000yqg.googlegroups=
.com>,
>
> cate =A0<catebekens...@yahoo.com> wrote:
> >I want to see what a real jones can do with this.. IF you're bored.
> >Here's the interview question:
>
> Just speaking for me, I'm not fond of the notion of posting interview
> programming questions, and especially not of answers. =A0It feels to me
> vaguely like cheating.
>
> --
> Tim McDaniel, t...@panix.com
Rest easy Tim, it was public facing. To get into the real meat of it,
you have to login.
------------------------------
Date: Fri, 27 Jan 2012 19:14:55 +0000
From: Rainer Weikusat <rweikusat@mssgmbh.com>
Subject: Re: job cull; Warner Brothers; try this
Message-Id: <87obtpx8i8.fsf@sapphire.mobileactivedefense.com>
Ben Morrow <ben@morrow.me.uk> writes:
> Quoth cate <catebekensail@yahoo.com>:
>> Here's the interview question:
>>
>> http://www.codeeval.com/public_sc/14/
>>
>>
>> Here's the kluge I came up with (they won't be talking to me!) ... a
>> mess. Show me the 3 liner you guys could do.
>
> #!/opt/perl/bin/perl -nl
>
> use warnings;
> use strict;
>
> sub permute; # grr
> sub permute {
> @_ > 1 or return @_;
> return map {
> my @new = @_;
> my $first = splice @new, $_, 1;
> map $first . $_, permute @new;
> } 0..$#_;
> }
>
> print join ",", sort +permute split //;
>
> __END__
This doesn't really work: When the input string contains the same
letter more than once, it will print identical 'permutations' as many
times as this letter occurs (the code posted below had the same
problem initially, I found the error while testing). It is also pretty
inefficient and uses *a lot* of memory.
Below is another one, based on the idea that it should be possible to
generate a list of sorted permutions instead of sorting a list
permutations. At least, it doesn't suffer from the 'double letter
issue' (but may well have other bugs), it is faster and uses a lot
less memory (although still quite a bit):
-------------------
sub permute
{
my ($cur, @head, @res, %seen);
$cur = shift;
return $cur unless @_;
push(@res, map { $cur.$_ } permute(@_));
do {
$seen{$cur} = 1;
push(@head, $cur);
$cur = shift;
push(@res, map { $cur.$_; } permute(@head, @_)) unless $seen{$cur};
} while (@_);
return @res;
}
print(join(',', permute(sort(split(//, $ARGV[0])))), "\n");
------------------------------
Date: Fri, 27 Jan 2012 15:30:38 -0500
From: Charlton Wilbur <cwilbur@chromatico.net>
Subject: Re: job cull; Warner Brothers; try this
Message-Id: <8739b0ubv5.fsf@new.chromatico.net>
>>>>> "c" == cate <catebekensail@yahoo.com> writes:
c> I want to see what a real jones can do with this.. IF you're
c> bored. Here's the interview question:
c> http://www.codeeval.com/public_sc/14/
c> Here's the kluge I came up with (they won't be talking to me!)
c> ... a mess. Show me the 3 liner you guys could do.
perl -MAlgorithm::Permute -e 'my $p = new Algorithm::Permute([split //,
"ham"]); my @perms; while (my @res = $p->next) { push @perms, join ("",
@res) }; print map { "$_\n" } sort @perms; '
It could probably be made shorter, but it fits in the 3-line
requirement.
Charlton
--
Charlton Wilbur
cwilbur@chromatico.net
------------------------------
Date: Fri, 27 Jan 2012 21:28:49 +0000
From: Rainer Weikusat <rweikusat@mssgmbh.com>
Subject: Re: job cull; Warner Brothers; try this
Message-Id: <877h0cygvi.fsf@sapphire.mobileactivedefense.com>
Charlton Wilbur <cwilbur@chromatico.net> writes:
>>>>>> "c" == cate <catebekensail@yahoo.com> writes:
>
> c> I want to see what a real jones can do with this.. IF you're
> c> bored. Here's the interview question:
>
> c> http://www.codeeval.com/public_sc/14/
>
> c> Here's the kluge I came up with (they won't be talking to me!)
> c> ... a mess. Show me the 3 liner you guys could do.
>
> perl -MAlgorithm::Permute -e 'my $p = new Algorithm::Permute([split //,
> "ham"]); my @perms; while (my @res = $p->next) { push @perms, join ("",
> @res) }; print map { "$_\n" } sort @perms; '
>
> It could probably be made shorter, but it fits in the 3-line
> requirement.
Given that the code is
http://cpansearch.perl.org/src/EDPRATOMO/Algorithm-Permute-0.12/Permute.xs
it decidedly doesn't. Also, you should admit that it was written by
Edwin Pratomo and not by you.
------------------------------
Date: Fri, 27 Jan 2012 21:48:25 +0000 (UTC)
From: tmcd@panix.com (Tim McDaniel)
Subject: Re: job cull; Warner Brothers; try this
Message-Id: <jfv638$jvq$1@reader1.panix.com>
In article <877h0cygvi.fsf@sapphire.mobileactivedefense.com>,
Rainer Weikusat <rweikusat@mssgmbh.com> wrote:
>Charlton Wilbur <cwilbur@chromatico.net> writes:
>>>>>>> "c" == cate <catebekensail@yahoo.com> writes:
>>
>> c> I want to see what a real jones can do with this.. IF you're
>> c> bored. Here's the interview question:
>>
>> c> http://www.codeeval.com/public_sc/14/
>>
>> c> Here's the kluge I came up with (they won't be talking to me!)
>> c> ... a mess. Show me the 3 liner you guys could do.
>>
>> perl -MAlgorithm::Permute -e 'my $p = new Algorithm::Permute([split //,
>> "ham"]); my @perms; while (my @res = $p->next) { push @perms, join ("",
>> @res) }; print map { "$_\n" } sort @perms; '
>>
>> It could probably be made shorter, but it fits in the 3-line
>> requirement.
>
>Given that the code is
>
> http://cpansearch.perl.org/src/EDPRATOMO/Algorithm-Permute-0.12/Permute.xs
>
>it decidedly doesn't. Also, you should admit that it was written by
>Edwin Pratomo and not by you.
The same logic supports a reductio ad absurdum of
perl -e 'print 1 + 1, "\n"'
counting as many thousands of lines (of C) written by lots of people.
By that reasoning, absolutely nothing would be a one liner.
To me, the key figure is: how quickly and reliably can you accomplish
your tasks? If you quickly find that someone has already done that
SMTP protocol module, or image-manipulation package, or whatever, and
it's publicly usable, then I think they deserve bonus points: they've
saved hours or months of work and may well have got something more
reliable and featureful than what they could have done on their own.
Of course, I'd still want to test them on writing something else de
novo, for the case that it's not built into Perl or in CPAN or on
download.com or whatever.
--
Tim McDaniel, tmcd@panix.com
------------------------------
Date: Fri, 27 Jan 2012 22:02:04 +0000
From: Rainer Weikusat <rweikusat@mssgmbh.com>
Subject: Re: job cull; Warner Brothers; try this
Message-Id: <87y5ssx0rn.fsf@sapphire.mobileactivedefense.com>
tmcd@panix.com (Tim McDaniel) writes:
> In article <877h0cygvi.fsf@sapphire.mobileactivedefense.com>,
> Rainer Weikusat <rweikusat@mssgmbh.com> wrote:
>>Charlton Wilbur <cwilbur@chromatico.net> writes:
>>>>>>>> "c" == cate <catebekensail@yahoo.com> writes:
>>>
>>> c> I want to see what a real jones can do with this.. IF you're
>>> c> bored. Here's the interview question:
>>>
>>> c> http://www.codeeval.com/public_sc/14/
>>>
>>> c> Here's the kluge I came up with (they won't be talking to me!)
>>> c> ... a mess. Show me the 3 liner you guys could do.
>>>
>>> perl -MAlgorithm::Permute -e 'my $p = new Algorithm::Permute([split //,
>>> "ham"]); my @perms; while (my @res = $p->next) { push @perms, join ("",
>>> @res) }; print map { "$_\n" } sort @perms; '
>>>
>>> It could probably be made shorter, but it fits in the 3-line
>>> requirement.
>>
>>Given that the code is
>>
>> http://cpansearch.perl.org/src/EDPRATOMO/Algorithm-Permute-0.12/Permute.xs
>>
>>it decidedly doesn't. Also, you should admit that it was written by
>>Edwin Pratomo and not by you.
>
> The same logic supports a reductio ad absurdum of
> perl -e 'print 1 + 1, "\n"'
> By that reasoning, absolutely nothing would be a one liner.
This depends on the challenge: If it was 'design and implemented a
programming language at least capable of calculating the some of 1 and
1 and printing it in response to some input', your example above is
not 'the one line solution' but just an attempt to pass off stuff
others wrote as your own. If it was 'write code which prints the sum
of 1 + 1' the example is a possible solution. The people who posted
the challenge presumably weren't interested in 'Charton Wilbers' 'rip
free stuff off the internet' skills. Actually, I doubt anyone else
was, either.
> To me, the key figure is: how quickly and reliably can you accomplish
> your tasks? If you quickly find that someone has already done that
> SMTP protocol module, or image-manipulation package, or whatever, and
> it's publicly usable, then I think they deserve bonus points: they've
> saved hours or months of work and may well have got something more
> reliable and featureful than what they could have done on their own.
If you're convinced of that everybody who ever published some code
somewhere must have been more competent than you, as this seems to
suggest, this obviously implies that you have exactly no competence in
this area and consequently, your opinions on 'programming' don't
matter.
------------------------------
Date: Sat, 28 Jan 2012 08:01:38 -0500
From: Ted Zlatanov <tzz@lifelogs.com>
Subject: Re: job cull; Warner Brothers; try this
Message-Id: <87bopo6kwd.fsf@lifelogs.com>
On Fri, 27 Jan 2012 21:28:49 +0000 Rainer Weikusat <rweikusat@mssgmbh.com> wrote:
RW> Charlton Wilbur <cwilbur@chromatico.net> writes:
>> perl -MAlgorithm::Permute -e 'my $p = new Algorithm::Permute([split //,
>> "ham"]); my @perms; while (my @res = $p->next) { push @perms, join ("",
>> @res) }; print map { "$_\n" } sort @perms; '
>>
>> It could probably be made shorter, but it fits in the 3-line
>> requirement.
RW> Given that the code is
RW> http://cpansearch.perl.org/src/EDPRATOMO/Algorithm-Permute-0.12/Permute.xs
RW> it decidedly doesn't. Also, you should admit that it was written by
RW> Edwin Pratomo and not by you.
Charlton is a known plagiarist. He's been using other people's modules
in his code for YEARS. But, of course, among Perl programmers this is
hardly exceptional, they wrote CPAN so they could steal credit more easily.
Ted
------------------------------
Date: Sat, 28 Jan 2012 08:06:27 -0500
From: Ted Zlatanov <tzz@lifelogs.com>
Subject: Re: job cull; Warner Brothers; try this
Message-Id: <877h0c6koc.fsf@lifelogs.com>
On Fri, 27 Jan 2012 22:02:04 +0000 Rainer Weikusat <rweikusat@mssgmbh.com> wrote:
RW> tmcd@panix.com (Tim McDaniel) writes:
>> To me, the key figure is: how quickly and reliably can you accomplish
>> your tasks? If you quickly find that someone has already done that
>> SMTP protocol module, or image-manipulation package, or whatever, and
>> it's publicly usable, then I think they deserve bonus points: they've
>> saved hours or months of work and may well have got something more
>> reliable and featureful than what they could have done on their own.
Reason and logic do not work on Rainer, unfortunately. It's like
talking to Eliza.
RW> If you're convinced of that everybody who ever published some code
RW> somewhere must have been more competent than you, as this seems to
RW> suggest, this obviously implies that you have exactly no competence in
RW> this area and consequently, your opinions on 'programming' don't
RW> matter.
Rainer, this is exactly the conversation we should be having. I'm so
glad you've stopped beating the "undef" horse.
Ted
------------------------------
Date: Fri, 27 Jan 2012 08:50:16 -0600
From: Tad McClellan <tadmc@seesig.invalid>
Subject: Re: ssh tunnel
Message-Id: <slrnji5ert.dj4.tadmc@tadbox.sbcglobal.net>
Dr Eberhard Lisse <nospam@lisse.NA> wrote:
> And you can go and see Isak N. Jacobsen.
>
> el
>
>
> on 2012-01-27 06:23 Tad McClellan said the following:
>> Dr Eberhard W Lisse <nospam@lisse.NA> wrote:
>>
>>> Thanks, that helps.
>>>
>>> el
>>
>>
>> Perhaps you do not realize it, but you appear to be rude.
Sorry, I did not realize that you are unconcerned about appearing clueless.
--
Tad McClellan
email: perl -le "print scalar reverse qq/moc.liamg\100cm.j.dat/"
The above message is a Usenet post.
I don't recall having given anyone permission to use it on a Web site.
------------------------------
Date: 6 Apr 2001 21:33:47 GMT (Last modified)
From: Perl-Users-Request@ruby.oce.orst.edu (Perl-Users-Digest Admin)
Subject: Digest Administrivia (Last modified: 6 Apr 01)
Message-Id: <null>
Administrivia:
To submit articles to comp.lang.perl.announce, send your article to
clpa@perl.com.
Back issues are available via anonymous ftp from
ftp://cil-www.oce.orst.edu/pub/perl/old-digests.
#For other requests pertaining to the digest, send mail to
#perl-users-request@ruby.oce.orst.edu. Do not waste your time or mine
#sending perl questions to the -request address, I don't have time to
#answer them even if I did know the answer.
------------------------------
End of Perl-Users Digest V11 Issue 3601
***************************************
