[22451] in Perl-Users-Digest
Perl-Users Digest, Issue: 4672 Volume: 10
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Thu Mar 6 11:06:03 2003
Date: Thu, 6 Mar 2003 08:05:09 -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 Thu, 6 Mar 2003 Volume: 10 Number: 4672
Today's topics:
Re: A problem about the time function <BROWNHIK@Syntegra.Bt.Co.Uk>
Re: Can Perl can have the include head file like c? <bart.lateur@pandora.be>
Re: Counting matches in a regular expression (Anno Siegel)
Re: DBD and DBI on Solaris 64 bit ctcgag@hotmail.com
Determine type of reference <alex@alexbanks.com>
Re: Determine type of reference <perl-dvd@darklaser.com>
Re: Determine type of reference <nospam@nospam.org>
Re: Determine type of reference (Tad McClellan)
Estup for testing scripts. Was I want to know the lin <chang0@adelphia.net>
Re: Estup for testing scripts. Was I want to know the <chang0@adelphia.net>
Re: file searching <bigj@kamelfreund.de>
Free Support, All OSes, All Applications <free@support.com>
Re: Greedy regexps <somewhere@nowhere.com>
Re: Greedy regexps <usenet@dwall.fastmail.fm>
Re: How can I write this regex? <bigj@kamelfreund.de>
Re: How can I write this regex? <bart.lateur@pandora.be>
Re: How to access proxy server for Perl Soap client news@roaima.freeserve.co.uk
Re: I want to know the line n umber of the error ! <tore@aursand.no>
Re: I want to know the line n umber of the error ! <ericosman-nospam@rcn.com>
Digest Administrivia (Last modified: 6 Apr 01) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: Thu, 6 Mar 2003 14:36:01 -0000
From: "programmer" <BROWNHIK@Syntegra.Bt.Co.Uk>
Subject: Re: A problem about the time function
Message-Id: <b47mpf$sfi$1@pheidippides.axion.bt.co.uk>
> I know there is a fuction "time" give current time when the function is
> called. But I want to get the seconds since the Epoch for a specific time.
I know some of the perl fanatics won't like it because it doesn't use a
module, but this code has been tested for every second from 1970 to 2037.
############################################################################
# This routine returns the number of seconds between 1st Jan 1970 (epoch
time)
# and the supplied date.
# This format is the same as that returned by the perl function time().
#
# The calling parameters are $getsecs1970(yyyy, mm, dd, hh, mi, ss);
#
# The basic algorithm will work for all dates up to Sun Feb 28 2100
# (there isn't a 29/2/2100), however the 32bit signed integer used to
# store the date will overflow for dates after Tue Jan 19 03:14:07 2038.
############################################################################
sub getsecs1970
{
my ($yyyy, $mm, $dd, $hh, $mi, $ss) = @_;
my ($yeardays, @monthdays, $leap);
if (($mm < 1) || ($mm > 12) || ($yyyy < 1970) || ($yyyy > 2037) ||
($dd < 1) || ($dd > 31))
{
return 0;
}
$leap = (($yyyy % 4) == 0) && ((($yyyy % 100)!=0) || (($yyyy % 400)==0))
if ($yyyy % 4) # !=0
{ # not a leap year
@monthdays = (0, 31,59,90,120,151,181,212,243,273,304,334);
}
else
{ # is a leap year
@monthdays = (0, 31,60,91,121,152,182,213,244,274,305,335);
}
$yeardays=($yyyy-1970) * 365 + int(($yyyy-1) / 4) - 492;
# days from 1970 ignoring leap years
# plus
# number of leap years since year 0
# minus
# number of leap years between years 0 and 1970
return (((($yeardays + $monthdays[$mm-1] + $dd - 1) * 24 + $hh) * 60 + $mi)
* 60) + $ss;
}
------------------------------
Date: Thu, 06 Mar 2003 11:57:06 GMT
From: Bart Lateur <bart.lateur@pandora.be>
Subject: Re: Can Perl can have the include head file like c?
Message-Id: <nrce6vkn95k5aa79ea56sp1ttjjjoi9upb@4ax.com>
Clark Zhong wrote:
>I want to include a config file in a main perl file, How can I do?
Use "do", "require", or "use". Look them up with `perldoc -f require` at
the command prompt, search through the "perlfunc" docs, or you could
check the online version at
<http://www.perldoc.com/perl5.8.0/pod/perlfunc.html>
--
Bart.
------------------------------
Date: 6 Mar 2003 12:21:39 GMT
From: anno4000@lublin.zrz.tu-berlin.de (Anno Siegel)
Subject: Re: Counting matches in a regular expression
Message-Id: <b47egj$pgn$1@mamenchi.zrz.TU-Berlin.DE>
Benjamin Goldberg <goldbb2@earthlink.net> wrote in comp.lang.perl.misc:
> -=-=-=-=-=-
>
> Anno Siegel wrote:
> > Benjamin Goldberg wrote:
> > > -=-=-=-=-=-
> > >
> > > Barty wrote:
> > > [snip]
> > > >
> > > > It's running now.. Looks like it will take around two hours (on
> > > > my athlon 1400) which is better than I though it would be! If
> > > > anyone would like to play with it, here's my code:
> > > > http://www.ianbishop.ca/649.zip
> > >
> > > I've attached my own code, and the output of one run.
> > >
> > > There couldn't *really* have only been 24 six-digit-combos which
> > > didn't get at least 3 digits in common with a winning draw, could
> > > there?
> >
> > I'm getting a lot more.
>
> About how many more? (If you're getting 480 to my 24, then our problem
> stems from counting differently -- I don't consider different
> permutations of the same set of numbers to be different.)
No, I was getting tens of thousands. A silly bug.
> Or, perhaps more relevant -- could you give me a "losing" number which
> your program outputed and mine didn't?
No more. After some debugging I see the same results as you, that
is, no losing combinations.
> > > And the whole thing finishes in 4 seconds -- is that possible?
> >
> > My run-time estimate: A bit above 5 hours.
> >
> > > If my algorithm is wrong, does anyone have a guess as to the
> > > problem?
> >
> > I think the algorithm is correct, if it is meant to be this:
> >
> > 1. Generate the set of all three-element subsets of all recorded
> > draws. (Each draw of six primarily generates 20 subsets of
> > three, but of course many duplicates will appear across the
> > draws.) Call these winners.
>
> That's *almost* right -- for each recorded draw, I first sort the
> numbers, before generating the 20 three-element subsets. Otherwise, the
> numbers aren't in ascending order.
>
> Oh, and I subtract 1 from each, so that the numbers go from 0..48,
> instead of from 1..49.
>
> Just FYI, I get 14339 elements in the "winners" set.
I've seen the 14339 number too. It happens when you sort the seven
numbers in each line and then ignore the seventh. The *original*
seventh number must be ignored (as you do now). Then it's 16280
winners.
> > 2. Build subsets of up to six elements of {1 .. 46} in sequence,
> > adding one element at a time. At each step, check if any
> > three-element subset of the current set is among the "winners"
> > of step 1.
> > If so, don't check any supersets of the current set.
> > If we're in the last step (dealing with six-element subsets),
> > print the set, again after checking that no subset of three is
> > a "winner".
>
>
> Actually, it's subsets of 0 .. 48, not 1..46, but that's otherwise
> correct.
>
> > > And if it's right -- nyah nyah, my code's faster than yours is :P
> >
> > Something must be wrong with your bit addressing scheme, is my guess.
>
> I just added a bit of error checking to the reading-data-in part, and
> discovered (part of) the problem. I had assumed that after the first
> three fields ("649",1,"1982-06-12",) all the remaining fields were the
> numbers drawn... from a mere glance at the data, this appeared to be so.
> But on closer inspection, there are SEVEN, not SIX numbers on each line!
>
> Looking at the OP's "severalregexp.pl" program shows that he simply uses
> the first 6 of these numbers, ignoring the seventh.
>
> Changing my code to likewise ignore the seventh number results in 16280
> bits set in the $winners bitmask, and ZERO losing sets.
Right, 16280 is what I get too, and no losing sets.
> > The algorithm as such is sound, imo.
>
> Thanks. Now all I have to do is figure out where what my code is doing,
> is differing from the described algorithm.
>
> I've attached my new-and-improved (but still not working) code.
As far as I can see, it *is* working, at least it shows the same results
as my version does now. Written more for simplicity than speed, it's
longer and slower than yours (though in the same ballpark). I've put
it up under
http://www.tu-berlin.de/zrz/mitarbeiter/anno4000/clpm/lotto
if anyone cares.
Anno
------------------------------
Date: 06 Mar 2003 15:53:22 GMT
From: ctcgag@hotmail.com
Subject: Re: DBD and DBI on Solaris 64 bit
Message-Id: <20030306105322.109$OK@newsreader.com>
makbo <makbo@pacbell.net> wrote:
> Thanx for the suggestion. Profiling Perl is not something I've actually
> ever done before, because in over 10 years I've never needed to! ;-)
>
> My "perldoc -q profile" output recommends Devel::DProf or
> Benchmark.pm, any advice on which one to try?
>
> My hunch is that the problem is DBD::CSV, not DBD::Oracle (I wasn't very
> specific in the original post, but I am reading the data from Oracle
> using DBD::Oracle. I prepare, execute, and fetchrow_array the rows
> using "SELECT * from table" from an Oracle source, then prepare and
> execute an "INSERT into table values (?,?...)" statement to the CSV
> target.
In this specific case I would use neither Devel::DProf nor Benchmark,
at least not at the moment. I would just comment out the DBD::CSV insert
statement and see if things are much faster.
> As I "tail -f" the CSV output file, I can see the rows being spit out
> painfully slowly compared to previously.
But if the spitting out is being done intermixed with the Oracle
fetching, then slowness on either part would look the same to tail -f.
> My Oracle 9i instances in
> general are equal to or faster than their comparable Oracle 8i instances
> (since I'm trying to use the nifty new stuff like auto segment
> management, etc).
That sounds like a theoretical assertion! Is it your actual experience
that they are faster, or do you just think they should be faster?
Xho
--
-------------------- http://NewsReader.Com/ --------------------
Usenet Newsgroup Service New Rate! $9.95/Month 50GB
------------------------------
Date: Thu, 6 Mar 2003 15:43:57 -0000
From: "Alex Banks" <alex@alexbanks.com>
Subject: Determine type of reference
Message-Id: <3e676cbf$0$239$cc9e4d1f@news.dial.pipex.com>
I have a reference - $alex.
How do I determine if the reference points to an array, a hash or a scalar?
I tried this:
if (*alex{ARRAY}) {
#process array
}else {
#process scalar
}
But it didn't work... Can someone help?
Muchos gracias,
Alex
---------------------------
http://www.alexbanks.com
http://www.alexite.com
------------------------------
Date: Thu, 06 Mar 2003 15:54:48 GMT
From: "David" <perl-dvd@darklaser.com>
Subject: Re: Determine type of reference
Message-Id: <cbK9a.16$Si.3324@news-west.eli.net>
"Alex Banks" <alex@alexbanks.com> wrote in message
news:3e676cbf$0$239$cc9e4d1f@news.dial.pipex.com...
> I have a reference - $alex.
>
> How do I determine if the reference points to an array, a hash or a
scalar?
>
> I tried this:
>
> if (*alex{ARRAY}) {
> #process array
> }else {
> #process scalar
> }
>
> But it didn't work... Can someone help?
Ya
if (ref($alex) eq "ARRAY"){
Regards,
David
------------------------------
Date: Thu, 6 Mar 2003 10:50:59 -0500
From: "Christian Caron" <nospam@nospam.org>
Subject: Re: Determine type of reference
Message-Id: <b47qp4$hal5@nrn2.NRCan.gc.ca>
"Alex Banks" <alex@alexbanks.com> wrote in message
news:3e676cbf$0$239$cc9e4d1f@news.dial.pipex.com...
> I have a reference - $alex.
>
> How do I determine if the reference points to an array, a hash or a
scalar?
>
> I tried this:
>
> if (*alex{ARRAY}) {
> #process array
> }else {
> #process scalar
> }
>
print ref($alex); # verify if reference and returns reference type
Good luck!
Christian
------------------------------
Date: Thu, 6 Mar 2003 10:00:12 -0600
From: tadmc@augustmail.com (Tad McClellan)
Subject: Re: Determine type of reference
Message-Id: <slrnb6es4c.6t3.tadmc@magna.augustmail.com>
Alex Banks <alex@alexbanks.com> wrote:
> How do I determine if the reference points to an array, a hash or a scalar?
perldoc -f ref
--
Tad McClellan SGML consulting
tadmc@augustmail.com Perl programming
Fort Worth, Texas
------------------------------
Date: Thu, 06 Mar 2003 15:43:59 GMT
From: ebchang <chang0@adelphia.net>
Subject: Estup for testing scripts. Was I want to know the line n umber of the error !
Message-Id: <Xns93366CD5632F0chang0adelphia.net@24.48.107.54>
Eric Osman <ericosman-nospam@rcn.com> wrote in news:3E6764B9.4050305
@rcn.com:
> Someone asked why I don't debug my perl script locally before putting
> it on RCN's server.
>
> Well, right now, the perl script depends on a "method = post"
> directive in the html code to send the script the stuff it expects.
>
> So for one thing, to test the script locally, I'd need to figure out
> how to "fake up" some posted data.
CGI.pm has a debugging option that lets you provide the data either as
command line arguments or interactively. See the debugging section of the
documentation at http://stein.cshl.org/WWW/software/CGI/#debugging
> I could avoid having to fake up posted data if I ran an actual web
> server on my local computer, which I don't currently.
Why not?
> Thirdly, I'm not even currently running a perl compiler/interpreter
> on my local machine. (perhaps you can suggest which ones are
> preferrable to run ? I'm on xp right now ).
The IndigoPerl distribution (http://www.indigostar.com/indigoperl.htm) is
an already conpiled binary version for Windows that includes an integrated
Apache web server and a browser-based package manager for installing
modules. A single installation gets you completely set up to develop and
test Perl programs, both from the command line and through the local
server.
> Anyway, for all the above reasons, I currently just ftp my scripts
> to RCN's server and try them there.
Reasons that are easy enough to correct.
> However, if you give me some ideas that suggest it would be easy to get
> around the above issues, I am willing to give local debugging a try.
Ok, there are the suggestions. Try it -you'll like it.
> Oh, one more thing. You've mentioned the "server log file" a number
> of times. I've been assumeing that since I'm only one of many RCN
> customers, they're not going to allow me to see their server log
> file, due to privacy and security issues.
Why assume? There's no penalty for asking.
--
EBC
------------------------------
Date: Thu, 06 Mar 2003 15:47:48 GMT
From: ebchang <chang0@adelphia.net>
Subject: Re: Estup for testing scripts. Was I want to know the line n umber of the error !
Message-Id: <Xns93366D7AE2E5Dchang0adelphia.net@24.48.107.54>
ebchang <chang0@adelphia.net> wrote in
news:Xns93366CD5632F0chang0adelphia.net@24.48.107.54:
Oops - Make that SETUP for testing scripts (under Windows).
Fingers need more coffee.
--
EBC
------------------------------
Date: Thu, 06 Mar 2003 12:02:02 +0100
From: "Janek Schleicher" <bigj@kamelfreund.de>
Subject: Re: file searching
Message-Id: <pan.2003.03.06.11.02.01.183925@kamelfreund.de>
Ronald wrote at Wed, 05 Mar 2003 11:01:16 -0800:
> I have lots of files with a bunch of data in each file. I have to
> look for two sentances in each file and compare the numbers after the
> sentances. I dont know where to begin in writting the program to do
> this and i am tired of looking for anyhting about array of files and
> searching in them on the internet. Please help on this.
There are CPAN modules like
Lingua::EN::Sentence
(and for some other languages)
Perhaps they also help.
Best Wishes,
Janek
------------------------------
Date: Thu, 6 Mar 2003 07:35:29 -0600
From: "ProNetworkPC" <free@support.com>
Subject: Free Support, All OSes, All Applications
Message-Id: <b47it6$5gm$10385@sun-news.laserlink.net>
http://www.pronetworkpc.com
--
Posted by News Bulk Poster
Unregistered version
------------------------------
Date: Thu, 6 Mar 2003 10:08:55 -0000
From: "Bigus" <somewhere@nowhere.com>
Subject: Re: Greedy regexps
Message-Id: <b476np$uhc@newton.cc.rl.ac.uk>
> }} I do understand that parsing HTML isn't easy if you are to take
> into account }} all the possible complications as identified in the
> CPAN FAQ, however, I }} think for my purposes half a dozen lines of
> regexps will work nicely to }} preprocess the HTML pages ready for
> keyword searching. Covering "all likely }} possibilities" is
> enough.. if I do spot something at a later date that I've }} not
> taken into account then I can make the necessary correction.
>
>
> Yada, yada, yada. If it was all so simple and possible, why did you
> come here with a problem?
Cos I had a problem with a regexp that wasn't working.. and Gunnar kindly
provided the answer. I didn't ask about how to parse HTML - that was someone
else who started the discussion about HTML parsers :)
Spencer
------------------------------
Date: Thu, 06 Mar 2003 15:52:59 -0000
From: "David K. Wall" <usenet@dwall.fastmail.fm>
Subject: Re: Greedy regexps
Message-Id: <Xns93366EB5B15Adkwwashere@216.168.3.30>
Jürgen Exner <jurgenex@hotmail.com> wrote on 05 Mar 2003:
> David K. Wall wrote:
>> On the other hand, I use regexes on HTML myself, but always with
>> HTML *I* wrote and (usually) pre-processed with HTML Tidy
>> <http://tidy.sourceforge.net/> to get it into a predictable
>> format.
>
> Which on the other hand raises the question why - when you own
> sender and(!) receiver- are you using such a complicated and
> unwieldy format as HTML for transmitting the data?
> Can't you use something more manageable like e.g. XML or a config
> file or even a binary format?
>
> HTML must be about the worst choice for a data format (except for
> maybe DOC and XLS and their relatives).
I'm not using HTML as a data format, except loosely speaking. These
are web pages I'm editing; the kind of things I'm doing are about the
equivalent of using sed to edit a file. Instead of doing stuff by
hand or with some GUI editor that requires a mouse and dozens of
clicks to do anything, I write short Perl programs, hook them into my
(text) editor, and run them on highlighted sections or over the whole
file. Saves me a lot of time.
More often I write Perl programs to write HTML (data from a database
or a text file), but then I'm not trying to use regexes to parse
HTML.
Am I excused now? :-)
--
David K. Wall - usenet@dwall.fastmail.fm
"Oook."
------------------------------
Date: Thu, 06 Mar 2003 12:06:09 +0100
From: "Janek Schleicher" <bigj@kamelfreund.de>
Subject: Re: How can I write this regex?
Message-Id: <pan.2003.03.06.11.06.08.23799@kamelfreund.de>
Benjamin Goldberg wrote at Thu, 06 Mar 2003 00:40:18 -0500:
> Sara wrote:
>>
>> Occasionally I need to change patterns which are NOT preceeded (or
>> followed, same difference) by certain other patterns. For example:
>>
>> replace "dog" with "canine" if dog is not preceeded by "cat " or
>> "mouse ".
>
> s/(?!<cat )(?!<mouse )dog/canine/g;
^^^ ^^^
Didn't you mean
?<!
instead for a negate look behind assertion ?!
>
>
> For "not followed by", the syntax is (?=stuff here).
^^
That's the syntax for "followed by".
The syntax for "not folled by" is
(?!stuff here)
Greetings,
Janek
------------------------------
Date: Thu, 06 Mar 2003 12:51:49 GMT
From: Bart Lateur <bart.lateur@pandora.be>
Subject: Re: How can I write this regex?
Message-Id: <juge6v0ie5oo5k6fiokqu7ka9i7nola4k5@4ax.com>
Sara wrote:
> replace "dog" with "canine" if dog is not preceeded by "cat " or
>"mouse ".
Another approach:
s/((?:cat|mouse) dog)|dog/$1 || 'canine'/ge;
The idea is to replace what you don't want replaced by itself, thereby
effectively skipping it; and process the rest normally.
--
Bart.
------------------------------
Date: Thu, 6 Mar 2003 10:55:43 +0000
From: news@roaima.freeserve.co.uk
Subject: Re: How to access proxy server for Perl Soap client
Message-Id: <ff974b.p9q.ln@moldev.cmagroup.co.uk>
Sade Bhat Kalasabail <sade_bhat@yahoo.com> wrote:
> I did change the proxy and used the user & pass env variables
> $ENV{'HTTP_proxy_user'}="nsw\sade";
This doesn't do what (I think) you expect. Because \ is a string escape
character, you need to double it up (think of "\t" and "\n", for example):
perl
$a = "nsw\sade"; $b = "nsw\\sade"; print "a='$a', b='$b'\n";
^D
a='nswsade', b='nsw\sade'
> 403 Forbidden (The server denies the specified Uniform Resource Locator
> (URL). Contact the server administrator.) at ./hibye.pl line 16
I think you'll find this means that your proxy user/pass was
incorrect. However, I should point out that I'm in (personally) unknown
territory, here.
Chris
--
@s=split(//,"Je,\nhn ersloak rcet thuarP");$k=$l=@s;for(;$k;$k--){$i=($i+1)%$l
until$s[$i];$c=$s[$i];print$c;undef$s[$i];$i=($i+(ord$c))%$l}
------------------------------
Date: Thu, 06 Mar 2003 09:32:08 +0100
From: "Tore Aursand" <tore@aursand.no>
Subject: Re: I want to know the line n umber of the error !
Message-Id: <pan.2003.03.06.01.00.27.341829@aursand.no>
On Wed, 05 Mar 2003 18:09:19 -0500, Eric Osman wrote:
> I cannot change the server. I'm an RCN customer. It's their server. So
> I want to know if there's something I can put in my perl script so that
> the line number will show up during debugging.
Hmm. Well. As I tried to tell you in the previous post: Perl _DOES_
report on what line the error occured. The reason the end user doesn't
see that (in his/hers browser, for example) should be obvious.
Alas, this isn't an issue related to Perl at all. It's "something" to do
with the web server, and if being an RCN customer leads to the fact that
you're not able to deal with the error logs in a human way, then it's
nothing much we can do really.
--
Tore Aursand <tore@aursand.no>
------------------------------
Date: Thu, 06 Mar 2003 10:09:45 -0500
From: Eric Osman <ericosman-nospam@rcn.com>
Subject: Re: I want to know the line n umber of the error !
Message-Id: <3E6764B9.4050305@rcn.com>
Someone asked why I don't debug my perl script locally before putting
it on RCN's server.
Well, right now, the perl script depends on a "method = post"
directive in the html code to send the script the stuff it expects.
So for one thing, to test the script locally, I'd need to figure out
how to "fake up" some posted data.
I could avoid having to fake up posted data if I ran an actual web
server on my local computer, which I don't currently.
Thirdly, I'm not even currently running a perl compiler/interpreter
on my local machine. (perhaps you can suggest which ones are
preferrable to run ? I'm on xp right now ).
Anyway, for all the above reasons, I currently just ftp my scripts
to RCN's server and try them there.
However, if you give me some ideas that suggest it would be easy to get
around the above issues, I am willing to give local debugging a try.
Oh, one more thing. You've mentioned the "server log file" a number
of times. I've been assumeing that since I'm only one of many RCN
customers, they're not going to allow me to see their server log
file, due to privacy and security issues.
Is this perhaps not the way servers tend to work ? That is, do servers
tend to have a per-user log file, so that it would be reasonable for
me to expect a way to access the log file that my usage of their
server provokes, without seeing other customer's log files ?
Thanks.
/Eric
------------------------------
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.
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 V10 Issue 4672
***************************************
