[21943] in Perl-Users-Digest
Perl-Users Digest, Issue: 4165 Volume: 10
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Sat Nov 23 06:05:43 2002
Date: Sat, 23 Nov 2002 03: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 Sat, 23 Nov 2002 Volume: 10 Number: 4165
Today's topics:
@INC, use, $LD_LIBRARY_PATH, & modules <family2@aracnet.com>
Re: @INC, use, $LD_LIBRARY_PATH, & modules (Jay Tilton)
Re: @INC, use, $LD_LIBRARY_PATH, & modules <dave@dave.org.uk>
a question on regular expression <gongwm@163.net>
Re: a question on regular expression <yhu@mail.nih.gov>
Cross-Platform method to get process information <jeff@jeffs-place.org>
Re: disambiguating print (was Re: Basic syntax question <bart.lateur@pandora.be>
Re: help this Newbie in Distress <goldbb2@earthlink.net>
HTTP::Daemon not working in threads? (Joe)
Re: HTTP::Daemon not working in threads? <goldbb2@earthlink.net>
Re: print the next 5 lines <nobull@mail.com>
Re: Problems with FTP - any ideas <goldbb2@earthlink.net>
Re: search script and meta tags <nobull@mail.com>
Re: semantics of nested backreferences in regular expre <goldbb2@earthlink.net>
Re: string qustion? <yhu@mail.nih.gov>
Re: string qustion? <jurgenex@hotmail.com>
Re: string qustion? <default@nih.gov>
Re: Timers <goldbb2@earthlink.net>
was: Re: string qustion? <bart.lateur@pandora.be>
Digest Administrivia (Last modified: 6 Apr 01) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: Fri, 22 Nov 2002 21:07:35 -0600
From: Abernathey Family <family2@aracnet.com>
Subject: @INC, use, $LD_LIBRARY_PATH, & modules
Message-Id: <3DDEF0F7.C4E3E9AF@aracnet.com>
How can I use modules that are not where "my" perl is installed? I need
modules & libs that are scattered. Can I stuff new paths into the @INC
array so that "use <module_name>" will find the odd modules? I can do
this another way, with a shell script wrapper around my perl script, but
it's a bit ugly. Please, no "perldoc -f lookyhere"-type answers unless
you know for sure that the info is available. I've spent a lot of time
searching for this one.
------------------------------
Date: Sat, 23 Nov 2002 06:07:06 GMT
From: tiltonj@erols.com (Jay Tilton)
Subject: Re: @INC, use, $LD_LIBRARY_PATH, & modules
Message-Id: <3ddf194f.147329232@news.erols.com>
Abernathey Family <family2@aracnet.com> wrote:
: Can I stuff new paths into the @INC
: array so that "use <module_name>" will find the odd modules?
perldoc -q library
: Please, no "perldoc -f lookyhere"-type answers unless
: you know for sure that the info is available.
Mmmkay.
: I've spent a lot of time
: searching for this one.
Since you know about perldoc, one must wonder what search terms you
chose that could have missed it.
------------------------------
Date: Sat, 23 Nov 2002 09:09:42 +0000
From: "Dave Cross" <dave@dave.org.uk>
Subject: Re: @INC, use, $LD_LIBRARY_PATH, & modules
Message-Id: <pan.2002.11.23.09.09.41.821560@dave.org.uk>
On Fri, 22 Nov 2002 21:07:35 +0000, Abernathey Family wrote:
> How can I use modules that are not where "my" perl is installed?
With "use lib"
> I need modules & libs that are scattered.
Why? Why not install them all in the same place?
> Can I stuff new paths into the @INC array so that "use <module_name>"
> will find the odd modules?
Yes. With "use lib" as I mentioned above.
> Please, no "perldoc -f lookyhere"-type answers unless you know for sure
> that the info is available.
perldoc lib
And I know for sure that the info is available.
> I've spent a lot of time searching for this one.
Obviously in the wrong places then :)
Dave...
--
It was long ago and it was far away
And it was so much better that it is today
------------------------------
Date: Sat, 23 Nov 2002 15:46:25 +0800
From: "Kurt Gong" <gongwm@163.net>
Subject: a question on regular expression
Message-Id: <arnbmt$29ul$1@mail.cn99.com>
hello, i wanna find inverted repeats in dna sequence. for example:
there are 4 different nucleotides in dna sequence: A, T, C ,G
A pairs with T, and C pairs with G.
the inverted repeats is something like :
XXXXATCGXXXXCGATXXX, X represents one random nucleotide of A, T, C, G.
this kind of pattern can form stem-loop structure which is very important
for various molecular interaction.
my question is how to construct a regular expression to find out such a
pattern from a long dna sequence which may contains many of this inverted
repeats.
thanx in advance.
-
Regards
Kurt Gong
Dep. of biology, Wuhan University.
------------------------------
Date: Sat, 23 Nov 2002 03:15:39 -0500
From: "Ying Hu" <yhu@mail.nih.gov>
Subject: Re: a question on regular expression
Message-Id: <JOGD9.32$1k7.10162@mencken.net.nih.gov>
open IN, $dns_seq_file or die "$!\n";
$dna_string = <IN>;
close IN;
$dna_string =~ s/\s+//g;
$pattern = "\S\S\S\SATCG\S\S\S\SCGAT\S\S\S";
if (@num = $dna_string =~ /$pattern/gi){
printf "$pattern mentioned %d times.\n", scalar @num;
}
"Kurt Gong" <gongwm@163.net> wrote in message
news:arnbmt$29ul$1@mail.cn99.com...
> hello, i wanna find inverted repeats in dna sequence. for example:
> there are 4 different nucleotides in dna sequence: A, T, C ,G
> A pairs with T, and C pairs with G.
> the inverted repeats is something like :
> XXXXATCGXXXXCGATXXX, X represents one random nucleotide of A, T, C, G.
> this kind of pattern can form stem-loop structure which is very important
> for various molecular interaction.
> my question is how to construct a regular expression to find out such a
> pattern from a long dna sequence which may contains many of this inverted
> repeats.
> thanx in advance.
> -
> Regards
> Kurt Gong
> Dep. of biology, Wuhan University.
>
>
>
>
------------------------------
Date: Sat, 23 Nov 2002 07:42:31 GMT
From: "Jeff Walter" <jeff@jeffs-place.org>
Subject: Cross-Platform method to get process information
Message-Id: <HjGD9.84990$P31.46008@rwcrnsc53>
I have a script that needs to check the status and PID of processes by
command name. Right now I have it running as just substr'ing the results of
"ps axu | grep cmd". Problem is, the results are formatted differently on
BSD from RedHat. So is there a module to do this sort of thing?
Thanks,
Jeff Walter
jeff@jeffs-place.org
------------------------------
Date: Sat, 23 Nov 2002 09:31:18 GMT
From: Bart Lateur <bart.lateur@pandora.be>
Subject: Re: disambiguating print (was Re: Basic syntax question on using arrays returned from function)
Message-Id: <7miutu4k0la8pv09fq7div9grc2hg7bepo@4ax.com>
"Edward Wildgoose" <Ed+nospam@ewildgoose.demon.co.uk@> wrote:
>This is a really clear answer.
I have to agree with the others, Tad. This is so well written, IMO it
deserves a place in the FAQ.
--
Bart.
------------------------------
Date: Fri, 22 Nov 2002 22:36:01 -0500
From: Benjamin Goldberg <goldbb2@earthlink.net>
Subject: Re: help this Newbie in Distress
Message-Id: <3DDEF7A1.D8BE7231@earthlink.net>
D wrote:
> I never post questions that are stupid.
There's no such things as stupid questions, only stupid people.
--
my $n = 2; print +(split //, 'e,4c3H r ktulrnsJ2tPaeh'
."\n1oa! er")[map $n = ($n * 24 + 30) % 31, (42) x 26]
------------------------------
Date: 22 Nov 2002 21:45:20 -0800
From: joemercury@gmx.net (Joe)
Subject: HTTP::Daemon not working in threads?
Message-Id: <d6c57a14.0211222145.6e6c100f@posting.google.com>
Hi,
I am trying to change a single thread proxy style program to multi
thread.
I am using HTTP::Daemon to accept the connections. The get->request is
stuck in the thread. Do I need to fix my program or is this a bug? Do
you know of example of similar program?
I am on Windows 2000 server and just installed the AS 5.8.0 beta using
MSI ( Winodws installer)
The bad behavior is that the first two connects are stalled in the
thread at the get->request, the third connect will activate the first
two connects and is stalled itself.
To use the program just change the browser setting to proxy on
127.0.0.1 port 3126 and try locations www.google.com, then
www.yahoo.com, then www.msn.com
This is just a small code to get past the get->request :(
============================
use 5.008; # 5.8 required for stable threading
use strict;
use warnings;
use threads; # threading routines
use threads::shared; # and variable sharing routines
use HTTP::Daemon;
my $daemon = HTTP::Daemon->new( LocalPort => 3126,
Listen => 5,
Reuse => 1 );
die "Cannot listen\n" unless defined $daemon;
$daemon->autoflush(1);
my $client;
while( 1 ) {
$client = $daemon->accept;
print STDERR "got connect\n";
threads->create("start_thread", $client );
# threads->new(\&start_thread, $client );
}
$daemon->shutdown(2);
exit;
sub start_thread {
threads->self->detach();
print STDERR "Thread started\n";
print STDERR $_[0] . "\n";
my $client= $_[0];
my $request = $client->get_request;
print STDERR "====Got request=Start=====\n";
print STDERR $request->as_string;
return;
}
=========================
output:
-----------------------
got connect
Thread started
HTTP::Daemon::ClientConn=GLOB(0x1f2d640)
got connect
Thread started
HTTP::Daemon::ClientConn=GLOB(0x20e8e08)
got connect
====Got request=Start=====
GET http://www.google.com/ HTTP/1.0
Accept: image/gif, image/jpeg, */*
Accept-Language: en
Host: www.google.com
User-Agent: Mozilla/4.7 (compatible; OffByOne; Windows 2000) Webster
Pro V3.2
====Got request=Start=====
GET http://www.yahoo.com/ HTTP/1.0
Accept: image/gif, image/jpeg, */*
Accept-Language: en
Host: www.yahoo.com
User-Agent: Mozilla/4.7 (compatible; OffByOne; Windows 2000) Webster
Pro V3.2
Thread started
HTTP::Daemon::ClientConn=GLOB(0x33135d8)
----------------------------------------------
------------------------------
Date: Sat, 23 Nov 2002 01:24:27 -0500
From: Benjamin Goldberg <goldbb2@earthlink.net>
Subject: Re: HTTP::Daemon not working in threads?
Message-Id: <3DDF1F1B.3B8983C@earthlink.net>
Joe wrote:
[snip]
> my $client;
> while( 1 ) {
> $client = $daemon->accept;
> print STDERR "got connect\n";
> threads->create("start_thread", $client );
> # threads->new(\&start_thread, $client );
> }
The problem, as I see it, is that after you pass $client to the new
thread, and the main thread stores a new connection object in $client,
the refcount of that object goes to 0, and the object gets cleaned up,
and the connection gets closed... *even though* the newly created thread
also has a copy of that connection object.
Try changing the code to this:
my $lock : shared;
while( 1 ) {
my $client = $daemon->accept;
print STDERR "Got connect\n";
lock($lock);
threads->create(\&start_thread, $client, \$lock);
cond_wait($lock);
die $lock if $lock;
}
sub start_thread {
my ($client, $lockref) = splice @_;
threads->self->detach();
unless( open $client, "<&".fileno $client ) {
lock($$lockref);
$$lockref = "Error duping $client: $!";
cond_signal($$lockref);
return;
} else {
lock($$lockref);
cond_signal($$lockref);
}
print STDERR "====Got request=Start=====\n";
print STDERR $request->as_string;
}
__END__
[untested]
--
my $n = 2; print +(split //, 'e,4c3H r ktulrnsJ2tPaeh'
."\n1oa! er")[map $n = ($n * 24 + 30) % 31, (42) x 26]
------------------------------
Date: 23 Nov 2002 10:49:04 +0000
From: Brian McCauley <nobull@mail.com>
Subject: Re: print the next 5 lines
Message-Id: <u9ptswwogv.fsf@wcl-l.bham.ac.uk>
"NeTedix" <tedtdhoang@hotmail.com> writes TOFU:
> Thank everyone,
If you are going to thank someone then perhaps you should try to do so
without spitting in their face at the same time. It kinda defeats the point.
--
\\ ( )
. _\\__[oo
.__/ \\ /\@
. l___\\
# ll l\\
###LL LL\\
------------------------------
Date: Fri, 22 Nov 2002 23:31:13 -0500
From: Benjamin Goldberg <goldbb2@earthlink.net>
Subject: Re: Problems with FTP - any ideas
Message-Id: <3DDF0491.88DDA10B@earthlink.net>
Bob Dubery wrote:
[snip]
> I have tried the following in the program that uses Net::FTP...
>
> 1) Use passive->1 when invoking the New method ($session =
> Net::FTP->New etc etc)
First off, it needs to be "Passive" here, not "passive" (it's
case-sensitive); secondly, it needs to be "=>", not "->", as those are
two very different operators.
> 2) $session->passive()
This ought to have worked.
> 3) $session->binary()
Binaryness is unrelated to passiveness.
[snip]
> Can anybody shed some light on this or suggest something else I could
> try?
Try adding Debug => 1 to the constructor. Then, post the output here.
--
my $n = 2; print +(split //, 'e,4c3H r ktulrnsJ2tPaeh'
."\n1oa! er")[map $n = ($n * 24 + 30) % 31, (42) x 26]
------------------------------
Date: 23 Nov 2002 10:54:45 +0000
From: Brian McCauley <nobull@mail.com>
Subject: Re: search script and meta tags
Message-Id: <u9k7j4wo7e.fsf@wcl-l.bham.ac.uk>
tadmc@augustmail.com (Tad McClellan) writes:
> Kevin McGurk <kgmmusic@comcast.net> wrote:
>
> > PLEASE REPLY BY EMAIL AS I RARELY HAVE ACCESS TO THESE GROUPS.
>
>
> *plonk*
I hope you remembered to e-mail that plonk.
--
\\ ( )
. _\\__[oo
.__/ \\ /\@
. l___\\
# ll l\\
###LL LL\\
------------------------------
Date: Fri, 22 Nov 2002 22:34:05 -0500
From: Benjamin Goldberg <goldbb2@earthlink.net>
Subject: Re: semantics of nested backreferences in regular expressions
Message-Id: <3DDEF72D.B437BDF1@earthlink.net>
Jeff 'japhy' Pinyan wrote:
>
> [posted & mailed]
>
> On 21 Nov 2002, Edi Weitz wrote:
>
> >Yes, I understand that, too. My problem is not that I don't
> >understand what's happening (I have in fact implemented a regular
> >expression matcher myself), my problem is that I think the two cases
> >aren't mutually consistent - or at least that the behaviour shown
> >here is counter-intuitive.
>
> I'll explain how they aren't.
Aren't which? Consistent, or counter-intuitive? :)
[big snip]
> Does this clear things up for you? I can make references to the
> underlying source code if it'll help. (But I don't know if that'll
> help. ;) )
Actually, it sortof clears it up for me: It acts the way it does
because that's how it's implemented to act... It doesn't sounds like
there's any other reason. It's an implementation detail, not an
intentionally reached goal.
It seems to me, that since this behavior is not documented, it might
possibly change in the future, if other optomizations to the regex
engine are made.
In short, one ought to avoid this kind of problem, by changing the regex
stuff into ordinary perl code, to give better control of what happens
and when.
print $1, "\n" while /\G(a)/gc or /\G(b)/g;
--
my $n = 2; print +(split //, 'e,4c3H r ktulrnsJ2tPaeh'
."\n1oa! er")[map $n = ($n * 24 + 30) % 31, (42) x 26]
------------------------------
Date: Fri, 22 Nov 2002 21:46:52 -0500
From: "Ying Hu" <yhu@mail.nih.gov>
Subject: Re: string qustion?
Message-Id: <w_BD9.31$1k7.9917@mencken.net.nih.gov>
Thanks Jue, I wanted to merge the strings or extend the strings if the
strings have the same sub-string or the sub-string of the strings were
overlaped.
"Jürgen Exner" <jurgenex@hotmail.com> wrote in message
news:1dBD9.6342$mL2.6321@nwrddc01.gnilink.net...
> default wrote:
> > There are some strings:
> > $str1 = "A1 B2 S2 D4 D3 S2";
> > $str2 = "D4 D3 S2 F2 A4 A5 D2";
> > $str3 = "X1 Z3 A11 A1 B2";
> >
> > I want to get the string:
> > $str_results = "X1 Z3 A11 A1 B2 S2 D4 D3 S2 F2 A4 A5 D2";
> > How to do it with Perl?
>
>
> Well, the easiest way is
> $str_results = "X1 Z3 A11 A1 B2 S2 D4 D3 S2 F2 A4 A5 D2";
> This will create the requested target string.
>
> However I have a feeling this is not what you wanted to ask.
> I guess there is some relation between the example strings at the top and
> the result string at the bottom. However you failed to explain how you get
> the result string from the input strings.
>
> Do you just want to concatenate them? Maybe without duplicate words (how
do
> you define a word)?
Yes, no duplication.
Does the sequence of the words need to be preserved or
> can they be shuffled around?
The sequence of the "words" can not be moved.
> What is supposed to happen if the sequence is different in different
source
> strings? Can there be multiple instances of the same word in one source
> string (actually this case is covered by your example, but you really have
> to search for S2 in str1)? In the target string, maybe coming from
different
> source strings? What is supposed to happen if e.g. $str4 contains "Z3 A1
M2
> M3 M4 D3 M5 M6 S2"? What is supposed to happen with the M values? ....?
The $str4 can not be merged with any three of the strings.
>
> Your specification by example is much too insufficient to create any
> algorithm or even suggest an idea.
>
> jue
>
>
------------------------------
Date: Sat, 23 Nov 2002 04:14:09 GMT
From: "Jürgen Exner" <jurgenex@hotmail.com>
Subject: Re: string qustion?
Message-Id: <lgDD9.6882$mL2.1885@nwrddc01.gnilink.net>
Ying Hu wrote:
> Thanks Jue, I wanted to merge the strings or extend the strings if the
> strings have the same sub-string or the sub-string of the strings were
> overlaped.
Ok, then let me restate your problem to make sure I understand what you
want:
(General problem first, we will come to the specific format of your strings
later)
Given are two strings $str1 of the form "ab" and $str2 of the form "bc"
where a, b, and c are arbitrary strings.
You want to determine if there is an overlap, i.e. if "b" is non-empty, and
return the string "abc".
This is a special case of the longest common substring problem. Sorry, I
don't have my algorithm book at hand, but it's a very well-known problem.
A quick and dirty approach could be to check if the whole $str2 equals the
tail of $str1. If yes then you are done. If not then cut off the last
character from $str2 and check again, and so on. If there is an overlap then
you will find it eventually. Once you got the overlap it is trivial to
determine what the c part is in your string and then to compose the whole
result.
I'm sure you can find more efficient solutions in any good book about
algorithm.
Now, with the special structure of your data you need to cut off the last
'word' instead of the last character, that is the last '<space><letter><
number>' combination.
Hope that helps a bit.
jue
------------------------------
Date: Fri, 22 Nov 2002 23:50:36 -0500
From: default <default@nih.gov>
Subject: Re: string qustion?
Message-Id: <3DDF091C.D042911C@nih.gov>
Thanks a lot. Ying
"Jürgen Exner" wrote:
> Ying Hu wrote:
> > Thanks Jue, I wanted to merge the strings or extend the strings if the
> > strings have the same sub-string or the sub-string of the strings were
> > overlaped.
>
> Ok, then let me restate your problem to make sure I understand what you
> want:
>
> (General problem first, we will come to the specific format of your strings
> later)
> Given are two strings $str1 of the form "ab" and $str2 of the form "bc"
> where a, b, and c are arbitrary strings.
> You want to determine if there is an overlap, i.e. if "b" is non-empty, and
> return the string "abc".
>
> This is a special case of the longest common substring problem. Sorry, I
> don't have my algorithm book at hand, but it's a very well-known problem.
> A quick and dirty approach could be to check if the whole $str2 equals the
> tail of $str1. If yes then you are done. If not then cut off the last
> character from $str2 and check again, and so on. If there is an overlap then
> you will find it eventually. Once you got the overlap it is trivial to
> determine what the c part is in your string and then to compose the whole
> result.
>
> I'm sure you can find more efficient solutions in any good book about
> algorithm.
>
> Now, with the special structure of your data you need to cut off the last
> 'word' instead of the last character, that is the last '<space><letter><
> number>' combination.
>
> Hope that helps a bit.
>
> jue
------------------------------
Date: Fri, 22 Nov 2002 23:59:39 -0500
From: Benjamin Goldberg <goldbb2@earthlink.net>
Subject: Re: Timers
Message-Id: <3DDF0B3B.BEFD8238@earthlink.net>
Ian.H wrote:
>
> -----BEGIN xxx SIGNED MESSAGE-----
> Hash: SHA1
>
> Evening all (depending on location) =)
>
> Not so long ago, I wrote an IRC bot for my server using the Net::IRC
> and Net::IRC::Event modules (yup, I'm aware that Net::IRC is
> depreciated), and I'm looking to include a timer event.
There isn't a timer event, but you can simulate one.
First, create a minheap data structure. The elements of the heap should
be [expiration time, event] pairs.
Then, do something like this:
while( 1 ) {
my $timeout;
while( my $timer = $minheap->find_min() ) {
($timeout = $timer->{expires} - time) > 0
and last;
$minheap->remove_min();
handle_event( $timer->{event} );
undef $timeout;
}
$irc->timeout( $timeout );
$irc->do_one_loop();
}
Obviously, data is put into the heap using some sort of ->push_heap
operation.
PS: I don't think there's any module on CPAN which implements a
minheap... you may need to write it yourself. Use google to find out
what algorithm to use.
--
my $n = 2; print +(split //, 'e,4c3H r ktulrnsJ2tPaeh'
."\n1oa! er")[map $n = ($n * 24 + 30) % 31, (42) x 26]
------------------------------
Date: Sat, 23 Nov 2002 09:17:29 GMT
From: Bart Lateur <bart.lateur@pandora.be>
Subject: was: Re: string qustion?
Message-Id: <k2gutu4u37ijsqbl7i83r94bn3trv52jhl@4ax.com>
default wrote:
>There are some strings:
>$str1 = "A1 B2 S2 D4 D3 S2";
>$str2 = "D4 D3 S2 F2 A4 A5 D2";
>$str3 = "X1 Z3 A11 A1 B2";
>
>I want to get the string:
>$str_results = "X1 Z3 A11 A1 B2 S2 D4 D3 S2 F2 A4 A5 D2";
>How to do it with Perl?
Actually, it looks to me that the strings actually represent ordered
sets (if that's the proper term; a directed graph is another term I'd
think of), and you want to merge these sets, and print out the merged
set. Well: I asked a similar question on a more complex case, and the
answer I got is to use a "toposort" method from the Graph package on
CPAN.
This is how I would do it (though I'm no expert):
use Graph;
my $graph = new Graph::Directed;
my $str1 = "A1 B2 S2 D4 D3 S2";
my $str2 = "D4 D3 S2 F2 A4 A5 D2";
my $str3 = "X1 Z3 A11 A1 B2";
$graph->add_path(split " ", $str1);
$graph->add_path(split " ", $str2);
$graph->add_path(split " ", $str3);
$str_total = join " ", $graph->toposort;
print "$str_total\n";
Hmm... I get the wrong results:
X1 Z3 A11 A1 B2 S2 F2 A4 A5 D2 D4 D3
But the reason must be because "S2" appears in your first string twice,
thurning "S2", "D3", "D4" into a loop. Is my misunderstanding of your
problem wrong?
Hmm... however, this still looks wrong. A loop would make "S2", "D3" and
"D4" of the same level. That should imply that "D3" and "D4" should come
before "F2 A4 A5 D2", right? If I drop the "S2" from $str2, the results
look better.
--
Bart.
------------------------------
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 4165
***************************************
