[30870] in Perl-Users-Digest
Perl-Users Digest, Issue: 2115 Volume: 11
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Sun Jan 11 18:09:43 2009
Date: Sun, 11 Jan 2009 15:09:08 -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 Sun, 11 Jan 2009 Volume: 11 Number: 2115
Today's topics:
Advanced Technology <come.earn@gmail.com>
Re: Advanced Technology <jurgenex@hotmail.com>
Re: Circular lists xhoster@gmail.com
Re: Circular lists xhoster@gmail.com
Re: Circular lists xhoster@gmail.com
Re: Circular lists <gamo@telecable.es>
Re: Circular lists xhoster@gmail.com
Re: Circular lists <gamo@telecable.es>
Re: Installing CPAN module that has no PPM package <thepoet_nospam@arcor.de>
Re: Is someone trying to delete this group? <tadmc@seesig.invalid>
Re: Is someone trying to delete this group? <george@example.invalid>
Re: Is someone trying to delete this group? <hjp-usenet2@hjp.at>
Re: opening a file <george@example.invalid>
Re: please help me to understand this code? <whynot@pozharski.name>
Digest Administrivia (Last modified: 6 Apr 01) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: Sun, 11 Jan 2009 08:08:28 -0800 (PST)
From: rtlxgroups <come.earn@gmail.com>
Subject: Advanced Technology
Message-Id: <1bb98f6f-ab8d-4654-a107-1ba3c21d06b6@a26g2000prf.googlegroups.com>
Technology is a concept that deals with knowledge of tools and crafts
The word "technology" can also be used to refer to a collection of
techniques
Technology is the application of maths, science and the arts for the
benefit of life
The Latest technology's are Wireless Network (USB
cable),Bluetooth,LCD,Camcorder,MP4,LED
http://intellectamd.blogspot.com
http://intellectamd.blogspot.com
------------------------------
Date: Sun, 11 Jan 2009 10:31:02 -0800
From: Jürgen Exner <jurgenex@hotmail.com>
Subject: Re: Advanced Technology
Message-Id: <d1ekm4luha6jcl3m2et0u0er4gjntfbgmr@4ax.com>
rtlxgroups <come.earn@gmail.com> wrote:
>The Latest technology's are Wireless Network (USB
>cable),
How exactly is a cable wireless?
>Bluetooth,LCD,
The first liquid crystals were discovered back in the 19th century. The
first viable LCD was produced commercially in 1972. That technology is
about as dusty as your brain.
>Camcorder,
Camcorders were introduced in the early to mid 80s of the last century.
If you call that advanced technology, then I wonder where you have been
since then.
>MP4,
MP4 is no technology, it's simply a standard for a file format.
>LED
LEDs were devoloped in the mid 60s of the last century. If that's
advanced technology to you, then I wonder how you kept your brain on
deep-freeze for the past 40 years.
jue
------------------------------
Date: 11 Jan 2009 19:57:32 GMT
From: xhoster@gmail.com
Subject: Re: Circular lists
Message-Id: <20090111145946.953$nv@newsreader.com>
gamo <gamo@telecable.es> wrote:
> > >
> > > I have a set of @set =3D qw(a a b b b c c c c);
> > >
> > > In a loop...
> > >
> > > @list =3D shuffle(@set);
> >=20
> > Is this the shuffle from List::Util? If so, why use a random method
> > as part of determining a non-random result? If you want to inspect
> > every permutation, don't do it randomly.
>
> I don't want to inspect every permutation because the number of
> permutations is n! =3D n*(n-1)*(n-2)...*1 and a problem of 20! is
> intractable.
There only that many permutations if your "set" has only unique letters,
which in your example it does not. Anyway, may gut feeling is that to get
an accurate count based on stochastic sampling, your will need to be about
as large as the underlying domain, anyway. But I could be wrong.
> Suppose that I have the huge list of permutations in memory.
> Wich are the circular rotations of another?=20
canonicalize! Or solve the problem analytically. If your set is such that
no permutation can have a self-rotation, then every circular list will
have exactly N linear representations.
> > How to make it more efficient is highly dependent on what you want to
> > do once you detect the sameness. You haven't really spelled that out.
> > It will also depend on the nature of @set, i.e. how redundant the
> > elements of
> > it are. Since the @set you show us isn't "large", it is hard to
> > extrapolate from your example up to your actual use case.
> >
> >
> > > or long loop.
> >
> > What loop is hypothetically long?
> >
>
> Take this as an example (not tested)
>
> #!/usr/local/bin/perl -w
>
> use List::Util qw(shuffle);
> @a =3D qw(a a a a a r r g g n);
I has able to solve this analytically, without any programming, because
of the uniqueness of 'n'. compute the permutations of 9 letters with
5,2,2 degeneracy, then treat gg as a single unit, computing perutations of
8 letters with 5,2,1 degeneracy, and subtract.
> for (1..10_000_000){
> @set =3D shuffle(@a);
> $s =3D join '',@set;
> $two =3D $s . $s;
> next if ($two =3D~ /gg/);
Now here is a wrinkle you haven't shown us before. It will be devastating
to certain approaches to the problem.
snip of code which I don't understand the logic behind, and which doesn't
seem to work.
>
> __END__
> I know that the solution by a previous version is 588.
That's what I got analytically, too.
Xho
--
-------------------- http://NewsReader.Com/ --------------------
The costs of publication of this article were defrayed in part by the
payment of page charges. This article must therefore be hereby marked
advertisement in accordance with 18 U.S.C. Section 1734 solely to indicate
this fact.
------------------------------
Date: 11 Jan 2009 20:03:25 GMT
From: xhoster@gmail.com
Subject: Re: Circular lists
Message-Id: <20090111150539.583$67@newsreader.com>
gamo <gamo@telecable.es> wrote:
> >
> > I think this is a good start, but it still produces redundant results.
> >
> > For example, if @set = qw/A A C/; # and we number the elements as you
> > did above, then this method will return both:
> >
> > A1 A2 C1
> > A1 C1 A2
> >
> > Which are circularly the same once the digits are removed.
> >
> > Xho
> >
>
> Thanks to all the responders, but I think now that the problem is
> unsolvable.
For some input sizes and structures, clearly it is intractable. But the
same is true for nearly all problems.
> Since you need to compare a new candidate with those of
> the past, the problem is more or less O(n^2).
Where n is what, the size of @set, or the factorial of that size?
Xho
--
-------------------- http://NewsReader.Com/ --------------------
The costs of publication of this article were defrayed in part by the
payment of page charges. This article must therefore be hereby marked
advertisement in accordance with 18 U.S.C. Section 1734 solely to indicate
this fact.
------------------------------
Date: 11 Jan 2009 20:06:56 GMT
From: xhoster@gmail.com
Subject: Re: Circular lists
Message-Id: <20090111150910.969$w3@newsreader.com>
Jürgen Exner <jurgenex@hotmail.com> wrote:
> gamo <gamo@telecable.es> wrote:
> >
> >If a,b,c is a list
> >b,c,a is the same list rotated b,c,a,b,c,a (note the a,b,c)
> >c,a,b is the same too, because c,a,b,c,a,b (note the a,b,c)
> >
> >a,c,b is another list because a,c,b,a,c,b is new
> >
> >I expect this clarifies the problem.
>
> Are you confirming Red's understanding of the problem or are you
> correcting his understanding? To me both versions, his and yours, seem
> to be the same.
>
> If they are, then generating all your "circular lists" is trivial, as is
> computing their number.
>
> Obviously there are exactly as many circular lists as there are elements
> in the original list, because each element can become the first element
> in a result list.
ababab only has two linear representations,not 6.
I think your claim is true if and only if the counts of the occurrences of
distinct letters in the input @set have a lcf of 1.
Xho
--
-------------------- http://NewsReader.Com/ --------------------
The costs of publication of this article were defrayed in part by the
payment of page charges. This article must therefore be hereby marked
advertisement in accordance with 18 U.S.C. Section 1734 solely to indicate
this fact.
------------------------------
Date: Sun, 11 Jan 2009 21:39:39 +0100
From: gamo <gamo@telecable.es>
Subject: Re: Circular lists
Message-Id: <alpine.LNX.2.00.0901112110330.3229@jvz.es>
On Sun, 11 Jan 2009, xhoster@gmail.com wrote:
> > I don't want to inspect every permutation because the number of
> > permutations is n! =3D n*(n-1)*(n-2)...*1 and a problem of 20! is
> > intractable.
>
> There only that many permutations if your "set" has only unique letters,
> which in your example it does not. Anyway, may gut feeling is that to get
And how can I exploit that property reducing iterations?
> an accurate count based on stochastic sampling, your will need to be about
> as large as the underlying domain, anyway. But I could be wrong.
>
But I can have a lower bound for the number and the lists I can't have
with exaustive enumeration.
>
> > Suppose that I have the huge list of permutations in memory.
> > Wich are the circular rotations of another?=20
>
> canonicalize! Or solve the problem analytically. If your set is such that
> no permutation can have a self-rotation, then every circular list will
> have exactly N linear representations.
>
Only the number of circular permutations could be calculated. I want to
know what are that lists.
Best regards,
PS: If you look at my corrected code, it works. I tought that it was
inefficient but I can't see where. A posible patch could be to use
only $p[] and don't compare with the past, because $p[] contains the
(number of circular perm * lenght of the original list) possibilities.
>
> Xho
>
> --
> -------------------- http://NewsReader.Com/ --------------------
> The costs of publication of this article were defrayed in part by the
> payment of page charges. This article must therefore be hereby marked
> advertisement in accordance with 18 U.S.C. Section 1734 solely to indicate
> this fact.
>
--
http://www.telecable.es/personales/gamo/
"Was it a car or a cat I saw?"
perl -E 'say 111_111_111**2;'
------------------------------
Date: 11 Jan 2009 21:22:53 GMT
From: xhoster@gmail.com
Subject: Re: Circular lists
Message-Id: <20090111162508.428$zd@newsreader.com>
gamo <gamo@telecable.es> wrote:
> On Sun, 11 Jan 2009, xhoster@gmail.com wrote:
>
> > > I don't want to inspect every permutation because the number of
> > > permutations is n! =3D n*(n-1)*(n-2)...*1 and a problem of 20! is
> > > intractable.
> >
> > There only that many permutations if your "set" has only unique
> > letters, which in your example it does not. Anyway, may gut feeling is
> > that to get
>
> And how can I exploit that property reducing iterations?
There may already be a module for that on CPAN, but if so finding it
seems as hard as making one. So I whipped up something easy to implement
(but not to use)
To make a good module out of it, recursion should be removed and
reimplemented with explicit state and as an iterator rather than a
callback.
With your example, it returns 5880, as it just generates, filters, and
counts the permutations, and doesn't look at circularity.
#efficiently make all distinct permutations
use strict;
use warnings;
sub dpermute {
my ($set, $prefix, $code)=@_;
my $count;
foreach (keys %$set) {
next unless $set->{$_};
$count++;
my %set = %$set;
$set{$_}--;
my @prefix = (@$prefix, $_);
dpermute(\%set, \@prefix, $code);
};
$code->(@$prefix) unless $count;
};
my %set;
$set{$_}++ foreach qw/a a a a a r r g g n/;
my $x;
dpermute(\%set,[],sub {my $y=join "", @_; $y.=$y; $x++ unless $y=~/gg/});
warn $x;
> > an accurate count based on stochastic sampling, your will need to be
> > about as large as the underlying domain, anyway. But I could be wrong.
> >
>
> But I can have a lower bound for the number and the lists I can't have
> with exaustive enumeration.
You can use a deterministic enumeration and just not let it run to
completion. I think it might start out less efficient than random, but
at some point will become more efficient as the random starts reproducing
old results. Or do it both and then take the max of the two.
>
> PS: If you look at my corrected code, it works.
Oh, I didn't see the correction (well, I saw it, but thought it was a
botched posting as Ｉdidn't notice the changes just a copy of the
original). I'll take a look later and see if I have any suggestions.
Xho
--
-------------------- http://NewsReader.Com/ --------------------
The costs of publication of this article were defrayed in part by the
payment of page charges. This article must therefore be hereby marked
advertisement in accordance with 18 U.S.C. Section 1734 solely to indicate
this fact.
------------------------------
Date: Sun, 11 Jan 2009 22:36:41 +0100
From: gamo <gamo@telecable.es>
Subject: Re: Circular lists
Message-Id: <alpine.LNX.2.00.0901112221001.3360@jvz.es>
On Sun, 11 Jan 2009, xhoster@gmail.com wrote:
> gamo <gamo@telecable.es> wrote:
> >
> > Thanks to all the responders, but I think now that the problem is
> > unsolvable.
>
> For some input sizes and structures, clearly it is intractable. But the
> same is true for nearly all problems.
>
Certainly. Thanks for remember me that.
> > Since you need to compare a new candidate with those of
> > the past, the problem is more or less O(n^2).
>
> Where n is what, the size of @set, or the factorial of that size?
>
More related with size, but there are counter-examples like
(a a a a a a) or (a a a a a b). I will try it with the case
(a a b b b c c c c d d d d d e e e e e e) for try to learn a
relation.
Best regards,
> Xho
>
> --
> -------------------- http://NewsReader.Com/ --------------------
> The costs of publication of this article were defrayed in part by the
> payment of page charges. This article must therefore be hereby marked
> advertisement in accordance with 18 U.S.C. Section 1734 solely to indicate
> this fact.
>
--
http://www.telecable.es/personales/gamo/
"Was it a car or a cat I saw?"
perl -E 'say 111_111_111**2;'
------------------------------
Date: Sun, 11 Jan 2009 09:30:08 +0100
From: Christian Winter <thepoet_nospam@arcor.de>
Subject: Re: Installing CPAN module that has no PPM package
Message-Id: <4969ad39$0$31862$9b4e6d93@newsspool3.arcor-online.net>
tbone wrote:
> I want to install the podcast aggregator modules MP3::PodcastFetch
>
> I have ActiveState Perl 5.10, and I would like to use some CPAN
> modules that are not (yet) supported via PPM.
>
> I've fiddled with things for a while and have arrived at what seems to
> be an impasse. I got a compatible version of nmake from MS, and I have
> Visual Studio 6 and 8 installed on this machine. But for some reason,
> I can't get the compiles to run properly.
>
>
> Using vcvars32.at from VS6, I get this compilerok.log file:
>
> Command line warning D4002 : ignoring unknown option '-nodefaultlib'
> Command line warning D4002 : ignoring unknown option '-debug'
> Command line warning D4002 : ignoring unknown option
> '-libpath\:"C\:\\Perl\\lib\\CORE"'
> Command line warning D4002 : ignoring unknown option '-machine\:x86'
> compilerok.c
> LINK : LNK4073: cannot create map for .ILK file; linking
> nonincrementally
> LINK : fatal error LNK1104: cannot open file "pt\:ref\,icf.exe"
>
> Using vcvarsall.bat from VS8, I get this compilerok.log file:
>
> cl : Command line warning D9035 : option 'o' has been deprecated and
> will be removed in a future release
> cl : Command line warning D9002 : ignoring unknown option
> '-nodefaultlib'
> cl : Command line warning D9002 : ignoring unknown option '-debug'
> cl : Command line warning D9002 : ignoring unknown option
> '-libpath\:"C\:\\Perl\\lib\\CORE"'
> cl : Command line warning D9002 : ignoring unknown option
> '-machine\:x86'
> compilerok.c
> LINK : cannot create map for .ILK file; linking nonincrementally
> LINK : fatal error LNK1104: cannot open file 'pt\:ref\,icf.exe'
>
> Any pointers?
One of a number of things may be broken here, either the Version
of nmake you're using, or the compiler/linker it is invoking, or
your cmd's behaviour (are there any additional paths set that point
to third party build tools [e.g. cygwin, borland]?)
However, the reason there's no ppm out there is that the tests
for MP3::PodcastFetch break on MSWin32 due to a problem with
backslashed paths. I've filed a bug on rt.cpan.org together with
a workaround, so hopefully it won't be too long until a corrected
version comes out.
If you don't want to wait, you can fetch my fixed version with
ppm install http://www.chrwinter.de/ppms/MP3-PodcastFetch.ppd
(works here on ActivePerl 5.8.8 and 5.10.0) and give it a try.
Let me know if you have any troubles with it.
-Chris
------------------------------
Date: Sun, 11 Jan 2009 06:21:44 -0600
From: Tad J McClellan <tadmc@seesig.invalid>
Subject: Re: Is someone trying to delete this group?
Message-Id: <slrngmjp2o.efl.tadmc@tadmc30.sbcglobal.net>
Rom <Rom@nospaM.invalid> wrote:
> Over the past couple months or so, I've been seeing messages like the
> following in the thread list here:
>
><quote>
> From: bleachbot <bleachbot@httrack.com>
http://en.wikipedia.org/wiki/Cancelbot
http://home.httrack.net/~nocem/
--
Tad McClellan
email: perl -le "print scalar reverse qq/moc.noitatibaher\100cmdat/"
------------------------------
Date: Sun, 11 Jan 2009 14:33:03 -0700
From: George <george@example.invalid>
Subject: Re: Is someone trying to delete this group?
Message-Id: <d0den7jt7d2r$.1tlnfoo6g4dm1$.dlg@40tude.net>
On Sat, 10 Jan 2009 22:11:29 -0800, Rom wrote:
> Tim Greer wrote:
>> Ugh, I didn't notice I left some of the spammer post's actual URL in
>> part of one of my quotes. Sorry about that.
>
>
> No worries, you were just giving an example, and clearly not endorsing or
> pushing it. I think it's safe to say anyone whose sucessfully passed primary
> (elementary) school can see such a difference :)
Rom,
One of the spammers is apparently a finnish guy with no other audience for
his unique perspectives in science.
What you may not know is that you might expect comp.lang.perl to be the
place where you talk about perl on usenet. Not so, it's c.l.p.misc .
I wonder why that is?
--
George
You can't put democracy and freedom back into a box.
George W. Bush
Picture of the Day http://apod.nasa.gov/apod/
------------------------------
Date: Sun, 11 Jan 2009 23:28:48 +0100
From: "Peter J. Holzer" <hjp-usenet2@hjp.at>
Subject: Re: Is someone trying to delete this group?
Message-Id: <slrngmksl0.f0t.hjp-usenet2@hrunkner.hjp.at>
On 2009-01-11 21:33, George <george@example.invalid> wrote:
> What you may not know is that you might expect comp.lang.perl to be the
> place where you talk about perl on usenet. Not so, it's c.l.p.misc .
>
> I wonder why that is?
It used to be comp.lang.perl, but at some point the group grew too
large, so it was split into several groups. When a newsgroup is split,
by convention one of the "subgroups" is named ".misc" for "general
discussions which don't fit into any of the the specialized subgroups".
comp.lang.perl doesn't exist any more, so you can't talk about perl
there.
hp
------------------------------
Date: Sun, 11 Jan 2009 14:20:11 -0700
From: George <george@example.invalid>
Subject: Re: opening a file
Message-Id: <1vpim06oabwci.6fswxvpvaay2$.dlg@40tude.net>
On Sat, 10 Jan 2009 07:27:01 -0800, Jürgen Exner wrote:
> "Peter J. Holzer" <hjp-usenet2@hjp.at> wrote:
>>On 2009-01-10 03:11, George <george@example.invalid> wrote:
>>> On Fri, 09 Jan 2009 18:24:38 -0800, Jürgen Exner wrote:
>>>> George <george@example.invalid> wrote:
>>>>>Shoot, I get nothing for output here. I added asymbol to yours, but I
>>>>>still get nothing. I have to believe that USER ERROR is rearing its head
>>>>>and laughing at me.
>>>>>
>>>>> open(50, '<ehp3.txt>');
>>>>> DO:
>>>>> { my $line = readline(*50);
>>>>> if(eof != 0) { exit }
>>>>> print $line; # no 'write' here
>>>>> redo DO } # no 'end' possible
>>>>> close(50)
>>>>
>>>> Ouch! This hurts!
>>
>>I'm sure Mirco meant that as a joke.
>
> Unfortunately is seems like George didn't get that joke :-(
>
> jue
What joke? Mirco made the perl syntax match my previous notions, and when
you don't transpose letters in the filename, it works:
C:\MinGW\source>perl faulk4.pl
Sun 18h 41m 55s -23â–‘ 5.4' 0.983 10.215 52.155 Up
Mercury 20h 2m 16s -22â–‘ 12.5' 1.102 22.537 37.668 Up
Venus 21h 55m 33s -14â–‘ 16.3' 0.795 39.872 11.703 Up
Moon 21h 17m 19s -15â–‘ 2.4' 62.4 ER 36.796 22.871 Up
Mars 18h 11m 59s -24â–‘ 6.1' 2.431 4.552 56.184 Up
Jupiter 20h 3m 35s -20â–‘ 49.4' 6.034 23.867 38.203 Up
Saturn 11h 32m 59s +5â–‘ 8.6' 9.018 -47.333 157.471 Set
Uranus 23h 21m 30s -4â–‘ 57.9' 20.421 48.328 -18.527 Up
Neptune 21h 39m 30s -14â–‘ 22.8' 30.748 38.963 16.599 Up
C:\MinGW\source>type faulk4.pl
open(50, '<', 'eph4.txt') or die "cannot open";
DO:
{ my $line = readline(*50);
if(eof != 0) { exit }
print $line; # no 'write' here
redo DO } # no 'end' possible
close(50)
# perl faulk4.pl
C:\MinGW\source>
The thing I needed to do to make this work was step away from the machine.
You saw the transposition, and now I see that the io difficulties I was
having have disappeared.
For the sake of thoroughness, let me just list the scripts that I now have
for the identical purpose:
C:\MinGW\source>type faulk1.pl
#The manuals don't really say it but files have their own data type.
#This line creates a variable called file or exits saying that it can't
open
#the file with a possible explanation (the $! variable).
open( FILE, "eph4.txt") || die "Could not open ehp3.txt $!";
#read out one line at a time until the file ends
while( <FILE> ){
print $_; #If you don't specify a file it goes to STDOUT (STandard
OUTpu
t)
#The $_ variable is created by the while statement
}
close(FILE); #This might not really be needed
# perl faulk1.pl
C:\MinGW\source>type faulk2.pl
#!/usr/bin/perl
use strict;
use warnings;
my $filename = 'eph3.txt';
open my $handle, '<', $filename
or die "unable to open '$filename' because $!";
while (<$handle>) {
s/%%/%\n/;
print;
}
close $handle;
# perl faulk2.pl
C:\MinGW\source>type faulk7.pl
open(my $fh, '<', 'eph3.txt');
while (my $line = <$fh>) {
print $line;
}
close($fh)
# perl faulk7.pl
C:\MinGW\source>type faulk8.pl
open(my $fh, '<', 'eph3.txt');
while (<$fh>) {
print $_;
}
close($fh)
# perl faulk8.pl
C:\MinGW\source>type faulk9.pl
open(my $fh, '<', 'eph3.txt') or die "cannot open eph3.txt: $!";
while (<$fh>) {
print $_;
}
close($fh)
# perl faulk9.pl
C:\MinGW\source>type faulk10.pl
my $filename = 'eph3.txt';
open(my $fh, '<', $filename) or die "cannot open $filename: $!";
while (<$fh>) {
print $_;
}
close($fh)
# perl faulk10.pl
C:\MinGW\source>
Page 21 of the camel book is the reference a person needs for this. The
'<' means explicitly to read from an existing file.
Peter also gave two counterexamples to help illustrate what goes wrong:
C:\MinGW\source>perl faulk5.pl
C:\MinGW\source>type faulk5.pl
open(my $fh, '<eph3.txt>');
DO:
{ my $line = readline($fh);
if(eof != 0) { exit }
print $line;
redo DO }
close($fh)
# perl faulk5.pl
C:\MinGW\source> perl faulk6.pl
C:\MinGW\source>type faulk6.pl
open(my $fh, '<', 'eph3.txt>');
DO:
{ my $line = readline($fh);
if(eof != 0) { exit }
print $line;
redo DO }
close($fh)
# perl faulk6.pl
C:\MinGW\source>
Does someone have a reference for the three-argument form for open?
I'd like to thank everyone who responded to this thread; it was a learning
experience for me. But now that I have achieved this great thing, I'll
hope to process the file that gets opened.
Maybe I should start a new thread for that.
--
George
I think we ought to raise the age at which juveniles can have a gun.
George W. Bush
Picture of the Day http://apod.nasa.gov/apod/
------------------------------
Date: Sun, 11 Jan 2009 16:45:37 +0200
From: Eric Pozharski <whynot@pozharski.name>
Subject: Re: please help me to understand this code?
Message-Id: <slrngmk1hl.f48.whynot@orphan.zombinet>
On 2009-01-11, Pilcrow <pilcrow6@gmail.com> wrote:
*SKIP*
> Now to you: I knew the provenience of 'pearls before swine', and I
> probably came into contact with the Bible several decades before you
> did. (You don't know how ancient I am.) Perhaps you don't realize that
> Jesus was Jewish, and the Jews have a profound revulsion to anything
> having to do with swine. To call someone 'swine' was an insult then
> and it is an insult now. But I forgive you, for you know not what you
> do.
You know what? That doesn't matter how old you are, "Posting History"
that what matters. What you did was childish (even if you had a cause).
And, just in case you care, saying "PLONK" isn't considered as social
requirement. And now you must find your way out of killfile (as if it
would be possible).
Look, I wasn't born on USENET actually. There's other world, that world
has rules, accidentally they written in POLICY (even if noone cares).
And there're simple words written (they are in my heart) --
Don't Annoy. And Don't Be Easily Annoyed.
*CUT*
--
Torvalds' goal for Linux is very simple: World Domination
Stallman's goal for GNU is even simpler: Freedom
------------------------------
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:
#The Perl-Users Digest is a retransmission of the USENET newsgroup
#comp.lang.perl.misc. For subscription or unsubscription requests, send
#the single line:
#
# subscribe perl-users
#or:
# unsubscribe perl-users
#
#to almanac@ruby.oce.orst.edu.
NOTE: due to the current flood of worm email banging on ruby, the smtp
server on ruby has been shut off until further notice.
To submit articles to comp.lang.perl.announce, send your article to
clpa@perl.com.
#To request back copies (available for a week or so), send your request
#to almanac@ruby.oce.orst.edu with the command "send perl-users x.y",
#where x is the volume number and y is the issue number.
#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 2115
***************************************
