[30983] in Perl-Users-Digest
Perl-Users Digest, Issue: 2228 Volume: 11
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Sun Feb 22 18:09:42 2009
Date: Sun, 22 Feb 2009 15: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 Sun, 22 Feb 2009 Volume: 11 Number: 2228
Today's topics:
Re: Default initial array value? [TMTOWTDI] <placebo@dontbesilly.com>
Re: New well tested makepp snapshot released <nospam@nospam.invalid>
Once again: Rolling Frame! <mstep@podiuminternational.org>
Re: Once again: Rolling Frame! sln@netherlands.com
Parsing keyword=value pairs <pgodfrin@gmail.com>
Re: Parsing keyword=value pairs <jurgenex@hotmail.com>
Re: Parsing keyword=value pairs <thepoet_nospam@arcor.de>
Re: Parsing keyword=value pairs <uri@stemsystems.com>
Re: Parsing keyword=value pairs <perl@marc-s.de>
sort question <nick@maproom.co.uk>
Re: sort question <1usa@llenroc.ude.invalid>
Re: Sorting based on existence of keys <uri@stemsystems.com>
Re: using WWW::Mechanize on activestate <tim@burlyhost.com>
utf8 and chomp <jfeit@ics.muni.cz>
Which email clients support SMTP/IMAP via STDIN&STDOUT <anfi@onet.eu>
Re: Which email clients support SMTP/IMAP via STDIN&STD <tim@burlyhost.com>
Re: Which email clients support SMTP/IMAP via STDIN&STD <anfi@onet.eu>
Digest Administrivia (Last modified: 6 Apr 01) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: Sun, 22 Feb 2009 12:07:13 GMT
From: "Peter Wyzl" <placebo@dontbesilly.com>
Subject: Re: Default initial array value? [TMTOWTDI]
Message-Id: <Rdbol.22761$cu.454@news-server.bigpond.net.au>
<sln@netherlands.com> wrote in message
news:kvqhp49gpkbf1mpfgc0mcn1pe0c3qtlvm4@4ax.com...
> On Sun, 15 Feb 2009 10:27:46 -0800 (PST), h3xx <amphetamachine@gmail.com>
> wrote:
>
>>I know this kind of goes against traditional programming practices,
>>but here goes:
>>
>>I need to initialize an array to all zeroes to begin with,
> [snip]
>
> There is never a need to do this.
Never is a very long time.
P
------------------------------
Date: Sun, 22 Feb 2009 13:41:43 +0000 (UTC)
From: Antoninus Twink <nospam@nospam.invalid>
Subject: Re: New well tested makepp snapshot released
Message-Id: <slrngq2lgn.qit.nospam@nospam.invalid>
On 21 Feb 2009 at 22:36, Daniel Pfeiffer wrote:
> Also its relationship to make is analogous to C++'s relationship to C:
> it is almost 100% backward compatible but adds a number of new
> features.
Perhaps people would be more likely to take the trouble to download any
try out your program if you spelt out in the announcement what one or
two of these new features are? Just a suggestion.
------------------------------
Date: Sun, 22 Feb 2009 07:02:48 -0800 (PST)
From: Marek <mstep@podiuminternational.org>
Subject: Once again: Rolling Frame!
Message-Id: <eb5a66dd-a68c-4f8c-9bad-681f2a3815fa@s36g2000vbp.googlegroups.com>
Hello all!
Once again thank you for all for your help with my "rolling frame" in
the thread "restrict a hash to 15 pairs and iterate over it" some
weeks ago! I learned a lot of all your suggestions!
I need once more your help in creating a multi-level hash like
follows:
We read in the line numbers, we count the lines ***and*** I need to
know, how many times these numbers occur in a frame of five lines ...
So my hash should have these informations in pseudo Perl code:
number @(line, line, line) => how many times (each number)
How to transform the genius code of the suggestion from Tad J
McClellan that the hash creation
$nums{$_}++ for values
%lines;
contains meantime the line numbers?
here the example code and best greetings to all
marek
#!/usr/bin/perl
use warnings;
use strict;
use Data::Dumper;
my $size = 5; # 5 instead of 15
my $line = 0; # "line" counter
my %lines; # buffer up $size lines
while ( <DATA> ) {
next if /\./; # skip dates
chomp;
$line++;
$lines{$line} = $_;
if ( keys %lines == $size ) {
print Dumper \%lines; # for debugging
# count what is in the buffer
my %nums;
$nums{$_}++ for values %lines;
# display what is in the (counted) buffer
foreach my $num ( sort { $a <=> $b } keys %nums ) {
printf "%3d: %3d times\n", $num, $nums{$num};
}
print "---------\n";
# maintain buffer size
delete $lines{ $line - $size + 1};
}
}
__DATA__
01.01.98
7
31
33
14
7
7
35
16
20
20
13
55
1
1
7
7
9
20
21
20
7
20
------------------------------
Date: Sun, 22 Feb 2009 18:34:43 GMT
From: sln@netherlands.com
Subject: Re: Once again: Rolling Frame!
Message-Id: <le63q41n2eq5j13aem4nbofrqidfaqt84h@4ax.com>
On Sun, 22 Feb 2009 07:02:48 -0800 (PST), Marek <mstep@podiuminternational.org> wrote:
>Hello all!
>
>
>Once again thank you for all for your help with my "rolling frame" in
>the thread "restrict a hash to 15 pairs and iterate over it" some
>weeks ago! I learned a lot of all your suggestions!
>
>I need once more your help in creating a multi-level hash like
>follows:
>
>We read in the line numbers, we count the lines ***and*** I need to
>know, how many times these numbers occur in a frame of five lines ...
>
>So my hash should have these informations in pseudo Perl code:
>
> number @(line, line, line) => how many times (each number)
>
>How to transform the genius code of the suggestion from Tad J
>McClellan that the hash creation
>
> $nums{$_}++ for values
>%lines;
>
>contains meantime the line numbers?
>
>here the example code and best greetings to all
>
>marek
>
>
>#!/usr/bin/perl
>use warnings;
>use strict;
>use Data::Dumper;
>
>my $size = 5; # 5 instead of 15
>my $line = 0; # "line" counter
>my %lines; # buffer up $size lines
>
>while ( <DATA> ) {
> next if /\./; # skip dates
> chomp;
> $line++;
>
> $lines{$line} = $_;
>
> if ( keys %lines == $size ) {
>
> print Dumper \%lines; # for debugging
>
> # count what is in the buffer
> my %nums;
> $nums{$_}++ for values %lines;
>
> # display what is in the (counted) buffer
> foreach my $num ( sort { $a <=> $b } keys %nums ) {
> printf "%3d: %3d times\n", $num, $nums{$num};
> }
> print "---------\n";
>
> # maintain buffer size
> delete $lines{ $line - $size + 1};
> }
>
>}
>
>__DATA__
>01.01.98
>7
>31
>33
>14
>7
>7
>35
>16
>20
>20
>13
>55
>1
>1
>7
>7
>9
>20
>21
>20
>7
>20
This probably works.
-sln
----------------------------------------
use warnings;
use strict;
use Data::Dumper;
my $size = 5; # 5 instead of 15
my $line = 0; # "line" counter
my %lines; # buffer up $size lines
while ( <DATA> ) {
next if /\./; # skip dates
chomp;
$line++;
$lines{$line} = $_;
if ( keys %lines == $size ) {
print Dumper \%lines; # for debugging
# get line's for each number, %nums = nbr=>[line,line,,], nbr=>
my %nums;
for (sort { $a <=> $b } keys %lines) {
my $nbr = $lines{$_};
push @{$nums{$nbr}}, $_;
}
print Dumper \%nums; # for debugging
# display what is in the (counted) buffer
foreach my $nbr ( sort { $a <=> $b } keys %nums ) {
my $aref = $nums{$nbr};
printf "%3d: %3d times, lines (%s)\n", $nbr, scalar(@$aref), join ',',@$aref;
}
print "---------\n";
# maintain buffer size
delete $lines{ $line - $size + 1};
}
}
------------------------------
Date: Sun, 22 Feb 2009 09:39:49 -0800 (PST)
From: pgodfrin <pgodfrin@gmail.com>
Subject: Parsing keyword=value pairs
Message-Id: <8f634fe6-abac-4552-9cf5-762b320f9750@i38g2000yqd.googlegroups.com>
Greetings,
I'm looking to have an input file that has keyword=value pairs. I've
been moving along the "roll your own" path, but I am looking for a
little guidance to the most effective way. The input file will have a
series of parameters, like:
name=foobar
city=london
car=sedan
I was thinking that the rest of the program would setup a hash, where
the lvalue is the key and the rvalue is the value, which I think makes
sense. I thought I could also have a list of "required" keys and
"optional" keys to aid in processing.
So - anyone have some suggestions on a good way to read the input file
of pairs?
regards,
phil
------------------------------
Date: Sun, 22 Feb 2009 10:34:59 -0800
From: Jürgen Exner <jurgenex@hotmail.com>
Subject: Re: Parsing keyword=value pairs
Message-Id: <rj63q4plmccge7ron3c7ibukraj5rc1gs9@4ax.com>
pgodfrin <pgodfrin@gmail.com> wrote:
>Greetings,
>I'm looking to have an input file that has keyword=value pairs. I've
>been moving along the "roll your own" path, but I am looking for a
>little guidance to the most effective way. The input file will have a
>series of parameters, like:
>
>name=foobar
>city=london
>car=sedan
That looks very much like a plain old standard INI file. I didn't check
but I would be very surprised if was no existing parser for INI-files on
CPAN.
jue
------------------------------
Date: Sun, 22 Feb 2009 20:57:57 +0100
From: Christian Winter <thepoet_nospam@arcor.de>
Subject: Re: Parsing keyword=value pairs
Message-Id: <49a1ae13$0$31862$9b4e6d93@newsspool3.arcor-online.net>
pgodfrin wrote:
> Greetings,
> I'm looking to have an input file that has keyword=value pairs. I've
> been moving along the "roll your own" path, but I am looking for a
> little guidance to the most effective way. The input file will have a
> series of parameters, like:
>
> name=foobar
> city=london
> car=sedan
>
> I was thinking that the rest of the program would setup a hash, where
> the lvalue is the key and the rvalue is the value, which I think makes
> sense. I thought I could also have a list of "required" keys and
> "optional" keys to aid in processing.
>
> So - anyone have some suggestions on a good way to read the input file
> of pairs?
You could do something like the following:
--------------------------------------------------------------
#!/usr/bin/perl
use strict;
use warnings;
use File::Slurp;
my $inifile = 'test.ini';
my @mandatory = qw(name city);
die "Ini file '$inifile' not accessible!"
unless( -r $inifile );
my $ini = read_file($inifile);
my %cfg = ( $ini =~ /^([^=]+)=(.*)$/mg );
foreach( @mandatory ) {
die "Missing or empty config option '$_'"
unless( $cfg{$_} );
}
--------------------------------------------------------------
Though if your requirements get more complex or you need additional
validation of values, looking at CPAN is the way to go.
-Chris
------------------------------
Date: Sun, 22 Feb 2009 16:04:34 -0500
From: Uri Guttman <uri@stemsystems.com>
Subject: Re: Parsing keyword=value pairs
Message-Id: <x7hc2mkwt9.fsf@mail.sysarch.com>
>>>>> "CW" == Christian Winter <thepoet_nospam@arcor.de> writes:
CW> use File::Slurp;
CW> die "Ini file '$inifile' not accessible!"
CW> unless( -r $inifile );
no need for that test, read_file will die with an error by default.
CW> my $ini = read_file($inifile);
CW> my %cfg = ( $ini =~ /^([^=]+)=(.*)$/mg );
you can merge those two lines together - no need for the temp var:
my %cfg = read_file($inifile) =~ /^([^=]+)=(.*)$/mg ;
that idiom is the fastest and one of the simplest ways to parse a simple
key/value file.
uri
--
Uri Guttman ------ uri@stemsystems.com -------- http://www.sysarch.com --
----- Perl Code Review , Architecture, Development, Training, Support ------
--------- Free Perl Training --- http://perlhunter.com/college.html ---------
--------- Gourmet Hot Cocoa Mix ---- http://bestfriendscocoa.com ---------
------------------------------
Date: Sun, 22 Feb 2009 22:36:51 +0100
From: Marc Lucksch <perl@marc-s.de>
Subject: Re: Parsing keyword=value pairs
Message-Id: <gnsgg9$2c21$1@ariadne.rz.tu-clausthal.de>
pgodfrin schrieb:
> name=foobar
> city=london
> car=sedan
> So - anyone have some suggestions on a good way to read the input file
> of pairs?
You can also use one of those CPAN modules, they seem to do the trick
for me. They are normally used to read .ini files, but if you just
extract the first section (either an empty string or "_") you have your
data.
use Config::IniHash;
my %hash = %{ReadINI('test.ini')->['']};
=========
(
'city' => 'london',
'car' => 'sedan',
'name' => 'foobar'
)
or
use Config::INI::Reader;
my %hash = %{Config::INI::Reader->read_file('test.ini')->['_']};
=========
(
'city' => 'london',
'car' => 'sedan',
'name' => 'foobar'
)
Marc "Maluku" Lucksch
------------------------------
Date: Sun, 22 Feb 2009 21:03:32 +0000
From: Nick Wedd <nick@maproom.co.uk>
Subject: sort question
Message-Id: <qE51cBBk2boJFAaq@maproom.demon.co.uk>
Here is my program:
use strict;
sub by_incsub1 { $$a[1] <=> $$b[1]; }
sub by_incsub2 { $$a[2] <=> $$b[2]; }
my $i;
my @a = ( ['a',3,1],['b',2,2],['c',1,1],['d',1,2],['e',2,1],['f',3,2] );
my @result = sort by_incsub1 @a;
foreach $i ( 0..5 )
{ print "$result[$i][0]$result[$i][1]$result[$i][2] "; }
print "\n";
@result = sort by_incsub2 @result;
foreach $i ( 0..5 )
{ print "$result[$i][0]$result[$i][1]$result[$i][2] "; }
print "\n";
@result = sort by_incsub1 @result;
foreach $i ( 0..5 )
{ print "$result[$i][0]$result[$i][1]$result[$i][2] "; }
and here is its output:
c11 d12 b22 e21 a31 f32
c11 e21 a31 d12 b22 f32
c11 d12 e21 b22 a31 f32
This is exactly what I hoped for. In fact it is better (more useful to
me) than I feel I have any right to expect. When it sorts on one
criterion, it leaves the items that tie under that criterion in the
order they were in before.
Now this is exactly what I want it to do. But no documentation that I
can recall promises that it will do that. Output like
c11 d12 e21 b22 a31 f32
a31 c11 e21 b22 d12 f32
d12 c11 e21 b22 f32 a31
would still meet the specification of "sort".
Can I rely on Perl's sort to continue to do what I want, or is it
implementation-dependent?
Nick
--
Nick Wedd nick@maproom.co.uk
------------------------------
Date: Sun, 22 Feb 2009 22:14:09 GMT
From: "A. Sinan Unur" <1usa@llenroc.ude.invalid>
Subject: Re: sort question
Message-Id: <Xns9BBAAF54BFFC0asu1cornelledu@127.0.0.1>
Nick Wedd <nick@maproom.co.uk> wrote in
news:qE51cBBk2boJFAaq@maproom.demon.co.uk:
> This is exactly what I hoped for. In fact it is better (more useful
> to me) than I feel I have any right to expect. When it sorts on one
> criterion, it leaves the items that tie under that criterion in the
> order they were in before.
>
> Now this is exactly what I want it to do. But no documentation that I
> can recall promises that it will do that.
Which version of Perl are you using?
http://perldoc.perl.org/functions/sort.html
Perl 5.6 and earlier used a quicksort algorithm to implement sort. That
algorithm was not stable, and could go quadratic. (A stable sort
preserves the input order of elements that compare equal. Although
quicksort's run time is O(NlogN) when averaged over all arrays of length
N, the time can be O(N**2), quadratic behavior, for some inputs.) In
5.7, the quicksort implementation was replaced with a stable mergesort
algorithm whose worst-case behavior is O(NlogN). But benchmarks
indicated that for some inputs, on some platforms, the original
quicksort was faster. 5.8 has a sort pragma for limited control of the
sort. Its rather blunt control of the underlying algorithm may not
persist into future Perls, but the ability to characterize the input or
output in implementation independent ways quite probably will. See sort.
http://perldoc.perl.org/sort.html
use sort 'stable'; # guarantee stability
-- Sinan
--
A. Sinan Unur <1usa@llenroc.ude.invalid>
(remove .invalid and reverse each component for email address)
comp.lang.perl.misc guidelines on the WWW:
http://www.rehabitation.com/clpmisc/
------------------------------
Date: Sun, 22 Feb 2009 15:56:19 -0500
From: Uri Guttman <uri@stemsystems.com>
Subject: Re: Sorting based on existence of keys
Message-Id: <x7ljrykx70.fsf@mail.sysarch.com>
>>>>> "JE" == Jürgen Exner <jurgenex@hotmail.com> writes:
JE> Uri Guttman <uri@stemsystems.com> wrote:
>>>>>>> "EP" == Eric Pozharski <whynot@pozharski.name> writes:
>>
EP> On 2009-02-19, Uri Guttman <uri@stemsystems.com> wrote:
>> >>
JE> $h{$a} and $h{$b} exist ===> length($h{$a}) <=> length($h{$a})
JE> $h{$a} exists but $h{$b} doesn't ===> -1
JE> $h{$a} does't exist but $h{$b} does ===> 1
JE> Neither $h{$a} nor $h{$b} exists ===> 0
>> >>
>> >> this is why doing a prefilter on the sort keys makes life much
>> >> simpler.
JE> [...]
>> when you add that back
>> you get much more complicated comparisons. i haven't even brought up
>> speed for which the presort key extraction is needed. see my other post
>> for an example which should work if i typed it cleanly and is simpler,
>> clearer and faster.
JE> Different approaches do the same problem.
JE> You are favouring reducing/adjusting the data domain such that you can
JE> use standard Perl operators while I favour adding a new comparison
JE> operator to my data algebra, i.e. I have a given data domain and create
JE> the proper comparison operator for that given domain.
JE> To me my approach is much cleaner and simpler because I don't have to
JE> tweak the data set just to make the comparison work. Also, I am not
JE> convinced that your speed argument is correct, but it's really not
JE> important enough to write a big benchmark test.
JE> To everyone his own, I guess.
the prefilter design simplifies the logic no matter how you slice
it. one common bug in multi-key sorts is getting the extraction right
for each key and also keeping the proper order of
comparisons. prefiltering reduces bugs because the extraction is coded
one time and not twice with $a and $b. and it keeps the actual
comparison code shorter as well so it is easier to manage the key order
issues (sort up/down, etc.). as for speed, sort::maker comes with a
benchmark script and the ability to generate a typical sort block like
you have been doing as well as faster versions. it is easy to find where
the breakeven point is for speed. the prefilter design is well known to
be much faster for larger data sets and especially so for multi-key and
complex sorts. nuff said here, i don't need to defend my point as it has
been proven many times.
uri
--
Uri Guttman ------ uri@stemsystems.com -------- http://www.sysarch.com --
----- Perl Code Review , Architecture, Development, Training, Support ------
--------- Free Perl Training --- http://perlhunter.com/college.html ---------
--------- Gourmet Hot Cocoa Mix ---- http://bestfriendscocoa.com ---------
------------------------------
Date: Sun, 22 Feb 2009 11:47:40 -0800
From: Tim Greer <tim@burlyhost.com>
Subject: Re: using WWW::Mechanize on activestate
Message-Id: <CZhol.61057$fM1.22346@newsfe14.iad>
Larry Gates wrote:
>> What does "the WWW folder" mean when you say it?
>
> If it's not "world wide web," then it's the triune George, or a
> demotion of XXX.
You didn't answer the question. Is that the directory path where the
script will search for modules, or just where you put it and called it
specifically within that path? And, did you install the required
module it needed to run the other module? If so, where was it
installed? Did you literally just drop in the .pm file and nothing
else, or did you commit other actions?
--
Tim Greer, CEO/Founder/CTO, BurlyHost.com, Inc.
Shared Hosting, Reseller Hosting, Dedicated & Semi-Dedicated servers
and Custom Hosting. 24/7 support, 30 day guarantee, secure servers.
Industry's most experienced staff! -- Web Hosting With Muscle!
------------------------------
Date: Sun, 22 Feb 2009 14:57:45 GMT
From: Josef Feit <jfeit@ics.muni.cz>
Subject: utf8 and chomp
Message-Id: <KFH2Ms.37u@news.muni.cz>
Hi,
I have run accross a Perl behaviour, which I do not
understand:
I am trying to analyze some text with utf8 characters,
eg a file with "nXlXx", where the 'X' stands for
some utf8 encoded character. eg. "náláx"
(not sure whether it gets through).
Please change the 'X' in the %ascii for some
utf8 character (should be 'á').
#!/usr/bin/perl
# -----------------------------------------------------------
use warnings;
use strict;
use encoding 'utf-8';
use 5.010;
my %ascii = (
'X' => 'a',
);
my $line = <>;
chomp $line; # to chomp or not to chomp
print length($line), ": ";;
for( my $i = 0; $i < length($line); $i++ ){
my $znak = substr($line, $i, 1);
if( exists( $ascii{$znak} ) ){
print "+";
}else{
print "-";
}
}
print "\n";
---
The problem is with the chomp:
In case I chomp the $line, the output is as
expected: 5: -+-+-
If I comment out the chomp, the result is
8: --------
so the Perl does not consider the $line to be
utf8 encoded.
Is this a side effect of chomp or do I have it
wrong? I need not to chomp and get the utf8.
perl -v
This is perl, v5.10.0 built for x86_64-linux-thread-multi
Thanks
Josef
------------------------------
Date: Sun, 22 Feb 2009 17:58:19 +0100
From: Andrzej Adam Filip <anfi@onet.eu>
Subject: Which email clients support SMTP/IMAP via STDIN&STDOUT of proxy command?
Message-Id: <wxlfad4d78@gregg.anfi.chickenkiller.com>
Which email clients support SMTP/IMAP via STDIN&STDOUT of proxy command?
--
[pl>en Andrew] Andrzej Adam Filip : anfi@onet.eu : anfi@xl.wp.pl
"Those who do not do politics will be done in by politics."
-- French Proverb
------------------------------
Date: Sun, 22 Feb 2009 11:44:43 -0800
From: Tim Greer <tim@burlyhost.com>
Subject: Re: Which email clients support SMTP/IMAP via STDIN&STDOUT of proxy command?
Message-Id: <LWhol.61055$fM1.51780@newsfe14.iad>
Andrzej Adam Filip wrote:
> Which email clients support SMTP/IMAP via STDIN&STDOUT of proxy
> command?
>
Wrong news group? Or are you asking about Perl based progams for this?
--
Tim Greer, CEO/Founder/CTO, BurlyHost.com, Inc.
Shared Hosting, Reseller Hosting, Dedicated & Semi-Dedicated servers
and Custom Hosting. 24/7 support, 30 day guarantee, secure servers.
Industry's most experienced staff! -- Web Hosting With Muscle!
------------------------------
Date: Sun, 22 Feb 2009 20:54:18 +0100
From: Andrzej Adam Filip <anfi@onet.eu>
Subject: Re: Which email clients support SMTP/IMAP via STDIN&STDOUT of proxy command?
Message-Id: <pnkc2nqi78@gregg.anfi.chickenkiller.com>
Tim Greer <tim@burlyhost.com> wrote:
> Andrzej Adam Filip wrote:
>
>> Which email clients support SMTP/IMAP via STDIN&STDOUT of proxy
>> command?
>
> Wrong news group? Or are you asking about Perl based progams for
> this?
Sorry, it is my 'select mistake'.
(I was thinking I selected comp.mail.misc for the post).
--
[pl>en Andrew] Andrzej Adam Filip : anfi@onet.eu : anfi@xl.wp.pl
Must I hold a candle to my shames?
-- William Shakespeare, "The Merchant of Venice"
------------------------------
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 2228
***************************************
