[29435] in Perl-Users-Digest
Perl-Users Digest, Issue: 679 Volume: 11
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Wed Jul 25 09:10:10 2007
Date: Wed, 25 Jul 2007 06:09:04 -0700 (PDT)
From: Perl-Users Digest <Perl-Users-Request@ruby.OCE.ORST.EDU>
To: Perl-Users@ruby.OCE.ORST.EDU (Perl-Users Digest)
Perl-Users Digest Wed, 25 Jul 2007 Volume: 11 Number: 679
Today's topics:
Re: @arts <zaxfuuq@invalid.net>
Re: @arts <zaxfuuq@invalid.net>
Re: @arts <bik.mido@tiscalinet.it>
Re: @arts <bik.mido@tiscalinet.it>
Re: FAQ 4.45 How do I find the first array element for <parv_@yahooWhereElse.com>
Re: FAQ 4.45 How do I find the first array element for <bik.mido@tiscalinet.it>
Re: FAQ 4.45 How do I find the first array element for <bik.mido@tiscalinet.it>
Re: FAQ 4.45 How do I find the first array element for <bik.mido@tiscalinet.it>
Re: FAQ 4.45 How do I find the first array element for anno4000@radom.zrz.tu-berlin.de
Re: FAQ 4.45 How do I find the first array element for <m@rtij.nl.invlalid>
Re: FAQ 4.45 How do I find the first array element for <m@rtij.nl.invlalid>
Re: FAQ 4.45 How do I find the first array element for anno4000@radom.zrz.tu-berlin.de
Re: filehandle, read lines roy.schultheiss@googlemail.com
Re: filehandle, read lines anno4000@radom.zrz.tu-berlin.de
Re: Math <blb8@po.cwru.edu>
new CPAN modules on Wed Jul 25 2007 (Randal Schwartz)
Digest Administrivia (Last modified: 6 Apr 01) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: Tue, 24 Jul 2007 10:07:54 -0700
From: "Wade Ward" <zaxfuuq@invalid.net>
Subject: Re: @arts
Message-Id: <rb2dnTAkUqMeLTvbnZ2dnUVZ_r2nnZ2d@comcast.com>
"Martijn Lievaart" <m@rtij.nl.invlalid> wrote in message
news:pan.2007.07.24.22.59.18@rtij.nl.invlalid...
> On Tue, 24 Jul 2007 10:42:28 +0200, Michele Dondi wrote:
>
>>>>>> Not hard to know recognize the last two lines as Merril's: how
>>>>>> strange that he recognizes having acted like an idiot in the first
>>>>>> place, before you poo^Hpped out of hammerspace to "defend" him...
>>>
>>>To whom belongs the above quote?
>>
>> To me and you should know. All quotes in the previous post are either
>> mine of yours. To understand who's saying what it's enough to count
>> quote signs and apply a tiny bit of arithmetic mod 2, at the level of a
>> child...
>
> No, I don't know. Please attribute properly. It's the polite thing to do.
> Everyone else does it.
>
> In the case above, I know it is the nth poster before this post. Who? I
> don't know. Vronans is very right to ask you to attribute properly. If
> someone (like me here) responds to a thread, it gets impossible to sort
> out the attributions. But without attributions, one cannot know who
> contributed. Take this post. Yes, you say in this post the above quote is
> by your hand, but in a normal conversation it would be impossible to
> backtrace who the quote belongs to.
>
> Please attribute properly. It's good form, but more, it makes it easier
> to read your posts.
I think the thrust of Vronans indictment is that there is a tendency in the
heavy-volume comp.lang groups for a certain mean-spiritedness. As a
permanent graduate of comp.lang.c, I experienced there an incivility which
the sharp orders here had not approached.
One reason I keep a distinctive response email identity on my news client is
that if someone wants to killfile me, there is nothing I would rather him do
than allow me to enjoy usenet without him/her. Perl is also unusual in that
it is perfectly topical to talk about usenet posts here, for example, the
type of data you get from net::nntp module.
--
WW
------------------------------
Date: Tue, 24 Jul 2007 10:09:19 -0700
From: "Wade Ward" <zaxfuuq@invalid.net>
Subject: Re: @arts
Message-Id: <nfOdnZuun8JLLTvbnZ2dnUVZ_sOrnZ2d@comcast.com>
"Michele Dondi" <bik.mido@tiscalinet.it> wrote in message
news:g6gba3poi7h9en4unhp8rbghdajnuj4gj6@4ax.com...
> On Tue, 24 Jul 2007 01:35:16 GMT, "Mumia W."
> <paduille.4061.mumia.w+nospam@earthlink.net> wrote:
>
>>> It appears that the only thing going to STDOUT is @arts. What
>>> dimensions does @arts have? [...]
>>
>>I suggest you learn to walk before you run. You're nowhere near
>>proficient enough with Perl to consider writing an NNTP client.
>
> Merrill, I know that this may seem offensive to you, but I
> wholeheartedly second this suggestion. It's just a matter of say a
> month or so: get familiar with basic Perl syntax and semantics first.
> Then life will be easier.
Am I arguing? I haven't got the upper hand on perl control structures, but
I did renew my reference today. I have a lot of reading to do.
--
WW
------------------------------
Date: Wed, 25 Jul 2007 10:36:23 +0200
From: Michele Dondi <bik.mido@tiscalinet.it>
Subject: Re: @arts
Message-Id: <3q2ea3lmi1q8r58iei51d0hqcn0mpkqhrc@4ax.com>
On Tue, 24 Jul 2007 15:17:58 -0700, "Vronans"
<vronans@nowheresville.spamwall> wrote:
>> In fact, nothing useful is being added to this thread since you
>> poo^Hpped in
>
>Oh, and once again you owe no blame what so ever to that, right?
Yes I have, but I won't any more: *PLONK*.
Michele
--
{$_=pack'B8'x25,unpack'A8'x32,$a^=sub{pop^pop}->(map substr
(($a||=join'',map--$|x$_,(unpack'w',unpack'u','G^<R<Y]*YB='
.'KYU;*EVH[.FHF2W+#"\Z*5TI/ER<Z`S(G.DZZ9OX0Z')=~/./g)x2,$_,
256),7,249);s/[^\w,]/ /g;$ \=/^J/?$/:"\r";print,redo}#JAPH,
------------------------------
Date: Wed, 25 Jul 2007 10:39:05 +0200
From: Michele Dondi <bik.mido@tiscalinet.it>
Subject: Re: @arts
Message-Id: <113ea31282uq4nohg37e5l11uqnoen263j@4ax.com>
On Tue, 24 Jul 2007 10:09:19 -0700, "Wade Ward" <zaxfuuq@invalid.net>
wrote:
>> Merrill, I know that this may seem offensive to you, but I
>> wholeheartedly second this suggestion. It's just a matter of say a
>> month or so: get familiar with basic Perl syntax and semantics first.
>> Then life will be easier.
>Am I arguing? I haven't got the upper hand on perl control structures, but
>I did renew my reference today. I have a lot of reading to do.
Well done!
Michele
--
{$_=pack'B8'x25,unpack'A8'x32,$a^=sub{pop^pop}->(map substr
(($a||=join'',map--$|x$_,(unpack'w',unpack'u','G^<R<Y]*YB='
.'KYU;*EVH[.FHF2W+#"\Z*5TI/ER<Z`S(G.DZZ9OX0Z')=~/./g)x2,$_,
256),7,249);s/[^\w,]/ /g;$ \=/^J/?$/:"\r";print,redo}#JAPH,
------------------------------
Date: Wed, 25 Jul 2007 02:34:27 -0500
From: parv <parv_@yahooWhereElse.com>
Subject: Re: FAQ 4.45 How do I find the first array element for which a condition is true?
Message-Id: <slrnfadva5.8uq.parv_@localhost.holy.cow>
in message <n8aaa3h52hgel434o7lhf06lg955lf6fpm@4ax.com>,
wrote Michele Dondi ...
> On Mon, 23 Jul 2007 22:42:12 +0200, Martijn Lievaart
><m@rtij.nl.invlalid> wrote:
>
>>> Unfortunately List::Util::first is slightly broken. I returns an
> ^^^^^^^^
> ^^^^^^^^
>
>>> undefined value when there is no first element, either because
>>> the condition never matched or because the list to search is
>>> empty in the first place. It should return empty in this case.
>>> As it is, if the
>>
>>I think undef is perfectly acceptable in both cases. Besides, what
>>kind of scalar is "empty"?
>
> Nope, it is broken, *slightly* broken as in: only corner cases
> will be affected, but it is:
>
> C:\temp>perl -MList::Util=first -le "(my ($f)=first {!$_} qw/a b
> c/)
> and print '
> false value found'"
> false value found
According to POD of List::Util::first(), there is nothing mentioned
about the list context, and mentions return value as an element.
Further, in your example, your list context gets an undefined value
-- also mentioned in documentation -- thus non empty list, causing
print to, well, print.
What you observed, how does that qualify for brokenness given there
seems to be no discrepancy between the documentation and working of
List::Util::first()?
- parv
--
As nice it is to receive personal mail, too much sweetness causes
tooth decay. Unless you have burning desire to contact me, do not do
away w/ WhereElse in the address for private communication.
------------------------------
Date: Wed, 25 Jul 2007 10:28:58 +0200
From: Michele Dondi <bik.mido@tiscalinet.it>
Subject: Re: FAQ 4.45 How do I find the first array element for which a condition is true?
Message-Id: <262ea3t024vpu8ku3eknq1moik7esucbir@4ax.com>
On Wed, 25 Jul 2007 01:55:01 +0200, Martijn Lievaart
<m@rtij.nl.invlalid> wrote:
>> No scalar is empty. That's why the difference can only be detected in
>> list context.
>
>So, effectively you are saying List::Util::first should return a list
>instead of a scalar?
Kind of a sensation of deja vu: functions only return lists. A list
comprising a single element is still a list, as is one having none.
C:\temp>perl -le "sub u {wantarray ? 1 : qw/a b c/} print scalar u, u"
c1
Michele
--
{$_=pack'B8'x25,unpack'A8'x32,$a^=sub{pop^pop}->(map substr
(($a||=join'',map--$|x$_,(unpack'w',unpack'u','G^<R<Y]*YB='
.'KYU;*EVH[.FHF2W+#"\Z*5TI/ER<Z`S(G.DZZ9OX0Z')=~/./g)x2,$_,
256),7,249);s/[^\w,]/ /g;$ \=/^J/?$/:"\r";print,redo}#JAPH,
------------------------------
Date: Wed, 25 Jul 2007 10:32:03 +0200
From: Michele Dondi <bik.mido@tiscalinet.it>
Subject: Re: FAQ 4.45 How do I find the first array element for which a condition is true?
Message-Id: <hg2ea31b1ttj3ckgo6gsb401csv588734k@4ax.com>
On Wed, 25 Jul 2007 02:04:24 +0200, Martijn Lievaart
<m@rtij.nl.invlalid> wrote:
>> C:\temp>perl -MList::Util=first -le "(my ($f)=first {!$_} qw/a b c/)
>> and print '
>> false value found'"
>> false value found
>
>So you construct the list (undef) and evaluate it in scalar context,
>which returns obviously true. Or am I missing something?
No, that's fine. Since no false value is actually there, we would have
wanted to expression to be false instead and an empty list would have
done the job.
>Maybe Util::List::first should pay attention to context, but if you mean
>that, say so. That is not a corner case IMHO.
Well, that is subjective, but I still consider it a corner case for I
can't imagine many real life examples in which undef could be an
acceptable value for the searched first item.
Michele
--
{$_=pack'B8'x25,unpack'A8'x32,$a^=sub{pop^pop}->(map substr
(($a||=join'',map--$|x$_,(unpack'w',unpack'u','G^<R<Y]*YB='
.'KYU;*EVH[.FHF2W+#"\Z*5TI/ER<Z`S(G.DZZ9OX0Z')=~/./g)x2,$_,
256),7,249);s/[^\w,]/ /g;$ \=/^J/?$/:"\r";print,redo}#JAPH,
------------------------------
Date: Wed, 25 Jul 2007 10:34:09 +0200
From: Michele Dondi <bik.mido@tiscalinet.it>
Subject: Re: FAQ 4.45 How do I find the first array element for which a condition is true?
Message-Id: <pm2ea3hcqst24iora5gsc2d5jcjpti9s7b@4ax.com>
On Wed, 25 Jul 2007 02:34:27 -0500, parv <parv_@yahooWhereElse.com>
wrote:
>What you observed, how does that qualify for brokenness given there
>seems to be no discrepancy between the documentation and working of
>List::Util::first()?
It's the design that is broken, a priori.
Michele
--
{$_=pack'B8'x25,unpack'A8'x32,$a^=sub{pop^pop}->(map substr
(($a||=join'',map--$|x$_,(unpack'w',unpack'u','G^<R<Y]*YB='
.'KYU;*EVH[.FHF2W+#"\Z*5TI/ER<Z`S(G.DZZ9OX0Z')=~/./g)x2,$_,
256),7,249);s/[^\w,]/ /g;$ \=/^J/?$/:"\r";print,redo}#JAPH,
------------------------------
Date: 25 Jul 2007 09:25:58 GMT
From: anno4000@radom.zrz.tu-berlin.de
Subject: Re: FAQ 4.45 How do I find the first array element for which a condition is true?
Message-Id: <5goj96F3hl13tU1@mid.dfncis.de>
Martijn Lievaart <m@rtij.nl.invlalid> wrote in comp.lang.perl.misc:
> On Mon, 23 Jul 2007 22:22:23 +0000, anno4000 wrote:
>
> > Martijn Lievaart <m@rtij.nl.invlalid> wrote in comp.lang.perl.misc:
> >> On Sun, 22 Jul 2007 00:30:23 +0000, anno4000 wrote:
> >>
> >> > brian d foy <brian.d.foy@gmail.com> wrote in comp.lang.perl.misc:
> >> >> In article <1184941331.498545.290230@57g2000hsv.googlegroups.com>,
> >> >> MrL22 <mr.leishman@gmail.com> wrote:
> >> >>
> >> >> > # Do this using GREP
> >> >> >
> >> >> > my @people = ('Jacob Smith', 'Michael Brown', 'Joshua Smith',
> >> >> > 'Matthew Cope');
> >> >> > @smiths = grep(/smith/i, @people);
> >> >>
> >> >> The trick is to do it without doing extra work. Imagine a list with
> >> >> thousands of elements. Do you really want to check every element,
> >> >> even after you've found the first element?
> >> >>
> >> >> That's why List::Util has first(). :)
> >> >
> >> > Unfortunately List::Util::first is slightly broken. I returns an
> >> > undefined value when there is no first element, either because the
> >> > condition never matched or because the list to search is empty in the
> >> > first place. It should return empty in this case. As it is, if the
> >>
> >> I think undef is perfectly acceptable in both cases. Besides, what kind
> >> of scalar is "empty"?
> >
> > No scalar is empty. That's why the difference can only be detected in
> > list context.
>
> So, effectively you are saying List::Util::first should return a list
> instead of a scalar?
No, I wouldn't put it that way. Whether a sub returns a list or a
scalar is determined by the context it is called in, not by the sub
itself. List::Util::first doesn't behave well in list context,
returning an undefined value when there is nothing to return. Returning
empty would make it behave better.
Anno
------------------------------
Date: Wed, 25 Jul 2007 13:14:14 +0200
From: Martijn Lievaart <m@rtij.nl.invlalid>
Subject: Re: FAQ 4.45 How do I find the first array element for which a condition is true?
Message-Id: <pan.2007.07.25.11.14.47@rtij.nl.invlalid>
On Wed, 25 Jul 2007 09:25:58 +0000, anno4000 wrote:
> Martijn Lievaart <m@rtij.nl.invlalid> wrote in comp.lang.perl.misc:
>> On Mon, 23 Jul 2007 22:22:23 +0000, anno4000 wrote:
>>
>> So, effectively you are saying List::Util::first should return a list
>> instead of a scalar?
>
> No, I wouldn't put it that way. Whether a sub returns a list or a
> scalar is determined by the context it is called in, not by the sub
> itself. List::Util::first doesn't behave well in list context,
> returning an undefined value when there is nothing to return. Returning
> empty would make it behave better.
Yes, I see your point. It's probably even the best way to distinguish
between 'not found' and 'found undef'.
M4
------------------------------
Date: Wed, 25 Jul 2007 13:16:03 +0200
From: Martijn Lievaart <m@rtij.nl.invlalid>
Subject: Re: FAQ 4.45 How do I find the first array element for which a condition is true?
Message-Id: <pan.2007.07.25.11.16.36@rtij.nl.invlalid>
On Wed, 25 Jul 2007 10:32:03 +0200, Michele Dondi wrote:
>>Maybe Util::List::first should pay attention to context, but if you mean
>>that, say so. That is not a corner case IMHO.
>
> Well, that is subjective, but I still consider it a corner case for I
> can't imagine many real life examples in which undef could be an
> acceptable value for the searched first item.
Ah, I see what you mean now. And I cannot imagine one right now either.
M4
------------------------------
Date: 25 Jul 2007 12:39:47 GMT
From: anno4000@radom.zrz.tu-berlin.de
Subject: Re: FAQ 4.45 How do I find the first array element for which a condition is true?
Message-Id: <5goukjF3gm7g0U2@mid.dfncis.de>
Martijn Lievaart <m@rtij.nl.invlalid> wrote in comp.lang.perl.misc:
> On Wed, 25 Jul 2007 09:25:58 +0000, anno4000 wrote:
>
> > Martijn Lievaart <m@rtij.nl.invlalid> wrote in comp.lang.perl.misc:
> >> On Mon, 23 Jul 2007 22:22:23 +0000, anno4000 wrote:
> >>
> >> So, effectively you are saying List::Util::first should return a list
> >> instead of a scalar?
> >
> > No, I wouldn't put it that way. Whether a sub returns a list or a
> > scalar is determined by the context it is called in, not by the sub
> > itself. List::Util::first doesn't behave well in list context,
> > returning an undefined value when there is nothing to return. Returning
> > empty would make it behave better.
>
> Yes, I see your point. It's probably even the best way to distinguish
> between 'not found' and 'found undef'.
That is the point exactly. The way it is, the cases are
indistinguishable.
Anno
------------------------------
Date: Wed, 25 Jul 2007 06:42:45 -0000
From: roy.schultheiss@googlemail.com
Subject: Re: filehandle, read lines
Message-Id: <1185345765.071394.75450@r34g2000hsd.googlegroups.com>
Thank you both for your answers.
I tried to split a file into smaller parts to start multiple processes
working on it. So the 1st process starts on line 1 - 10_000_000 and
2nd process from 10_000_001 to 20_000_000 etc.
I'll use seek to set the Position of the handle.
Regards, Roy
------------------------------
Date: 25 Jul 2007 09:13:29 GMT
From: anno4000@radom.zrz.tu-berlin.de
Subject: Re: filehandle, read lines
Message-Id: <5goihpF3hjg86U1@mid.dfncis.de>
<roy.schultheiss@googlemail.com> wrote in comp.lang.perl.misc:
> Thank you both for your answers.
>
> I tried to split a file into smaller parts to start multiple processes
> working on it. So the 1st process starts on line 1 - 10_000_000 and
> 2nd process from 10_000_001 to 20_000_000 etc.
>
> I'll use seek to set the Position of the handle.
Hmm... Seek finds positions by byte, not by line.
To split a file (handle $fh) in $n chunks of roughly equal length
that all start at a new line, you could do this:
my $size = (-s $fh)/$n;
my @chunk_pos = ( 0);
for ( 1 .. $n ) {
seek $fh, $size*$_, 0;
<$fh>; # this will (in general) read an incomplete line
push @chunk_pos, tell $fh; # save start of next line
}
# process each chunk
for my $chunk ( 1 .. $n ) {
seek $fh, $chunk_pos[ $chunk - 1], 0;
while ( <$fh> ) {
# handle line in $_
last if tell( $fh) >= $chunk_pos[ $chunk];
}
}
You won't know in advance the line numbers in each chunk, nor how many
lines each chunk holds exactly. They will be of roughly equal size if
the distribution of line lengths isn't wildly irregular.
Anno
------------------------------
Date: Wed, 25 Jul 2007 07:37:19 +0000 (UTC)
From: Brian Blackmore <blb8@po.cwru.edu>
Subject: Re: Math
Message-Id: <f86uje$3mf$1@gnus01.u.washington.edu>
Ilya Zakharevich <nospam-abuse@ilyaz.org> wrote:
> [A complimentary Cc of this posting was sent to
> Brian Blackmore
> <blb8@po.cwru.edu>], who wrote in article <f82pte$kl3$1@gnus01.u.washington.edu>:
> > > For some unfathomable reasons, Perl uses non-invertible transformations
> > > between strings and numbers. So if your handling of numbers involves
> > > converting them to strings, then back, the precision will be lost.
> > Yes, but I would question which programming languages don't suffer
> > from this behavior?
> What other programming languages with multi-representation numbers do
> you know?
I thought we were talking about the classic `type conversion' issue.
> > As is mentioned by perlnumber, converting from
> > floating point to string is performed by the C compiler,
> Nope, by C RT libraries. And the for these libraries, they do it
> following instructions from perl.
Following your advice, and checking perlnumber, what I found was what
I said up above:
"RESTRICTION: The conversions marked with "(*)" above
involve steps performed by the C compiler. In particular,
bugs/features of the compiler used may lead to breakage of
some of the above rules."
Since "native floating_point --> decimal string (*)" and
"decimal string --> native floating point (*)" are so marked, I
interpret that to mean that perl is at the whim of whatever C compiler
was used.
> > whence Perl is at the mercy of the system on which it was compiled.
> And this the CHOICE made by perl. It could have done the conversion
> itself.
True, but that's a bit like saying that it's output could be based on
the TeX typesetting engine, that it's input stream should be entirely
XMLized and should natively handle images and gestured input, and that
it should natively translated any symbol set into the appropriate
characters necessary to create code.
> > Moreover, I must admit a bit of childish moronicity here in claiming
> > that I know of no language whatsoever that stores floats with
> > infinite precision, whence string conversion is always faulty.
> I do not follow your usage of "whence", so cannot comment.
Lacking a programming language where float->string conversion is
invertible, converting to strings in any language creates a loss of
precision, which is no difficulty to imagine given a base ten
representation in a string in comparison to a base two representation
for a float.
> > Indeed, I was also thinking of something simple like 1/3, but have
> > you an example of a language where "1/3"=1/3? Or are there so many
> > that I'm just being dim?
> Yes. E.g., see
> perl -MMath::Pari=:int
So perl has the ability after all, and doesn't use non-invertible
transforms, so there are no unfathomable reasons.
In any case, I don't find this a satisfactory example of a programming
language that avoids the concern in question. If anything, we've just
verified that arbitrary precision can doubtless be added to any Turing
complete language. That does not imply that Perl is any better or
worse than anything else in that regard.
Am I still missing the obvious examples of programming languages where
type casts are invertible without information loss?
--
Brian Blackmore
blb8 at po dot cwru dot edu
------------------------------
Date: Wed, 25 Jul 2007 04:42:12 GMT
From: merlyn@stonehenge.com (Randal Schwartz)
Subject: new CPAN modules on Wed Jul 25 2007
Message-Id: <JLpx2C.24JA@zorch.sf-bay.org>
The following modules have recently been added to or updated in the
Comprehensive Perl Archive Network (CPAN). You can install them using the
instructions in the 'perlmodinstall' page included with your Perl
distribution.
Bio-Grep-v0.7.0
http://search.cpan.org/~limaone/Bio-Grep-v0.7.0/
Perl extension for searching in Fasta files
----
CGI-Ex-2.18
http://search.cpan.org/~rhandom/CGI-Ex-2.18/
CGI utility suite - makes powerful application writing fun and easy
----
Catalyst-Plugin-PageCache-0.16
http://search.cpan.org/~agrundma/Catalyst-Plugin-PageCache-0.16/
Cache the output of entire pages
----
Catalyst-Plugin-Static-TT-0.001
http://search.cpan.org/~hdp/Catalyst-Plugin-Static-TT-0.001/
generate 'static' content with TT
----
Clone-0.27
http://search.cpan.org/~rdf/Clone-0.27/
recursively copy Perl datatypes
----
DBIx-Class-Schema-Loader-0.04002
http://search.cpan.org/~blblack/DBIx-Class-Schema-Loader-0.04002/
Dynamic definition of a DBIx::Class::Schema
----
Data-Tabulate-0.04
http://search.cpan.org/~reneeb/Data-Tabulate-0.04/
Table generation!
----
FabForce-DBDesigner4-DBIC-0.02
http://search.cpan.org/~reneeb/FabForce-DBDesigner4-DBIC-0.02/
create DBIC scheme for DBDesigner4 xml file
----
Google-Data-JSON-0.1.2
http://search.cpan.org/~takeru/Google-Data-JSON-0.1.2/
General XML-JSON converter based on Google Data APIs
----
Gungho-0.08004
http://search.cpan.org/~dmaki/Gungho-0.08004/
Yet Another High Performance Web Crawler Framework
----
HTTP-Daemon-SSL-1.03_02
http://search.cpan.org/~aufflick/HTTP-Daemon-SSL-1.03_02/
a simple http server class with SSL support
----
HTTP-Server-Brick-0.1.0
http://search.cpan.org/~aufflick/HTTP-Server-Brick-0.1.0/
Simple pure perl http server for prototyping "in the style of" Ruby's WEBrick
----
Handel-1.00003
http://search.cpan.org/~claco/Handel-1.00003/
A cart/order/checkout framework with AxKit/TT/Catalyst support
----
IRC-Bot-0.08
http://search.cpan.org/~bwsmith/IRC-Bot-0.08/
Channel Maintenance IRC bot.
----
Iterator-Simple-0.04
http://search.cpan.org/~rintaro/Iterator-Simple-0.04/
Simple iterator and utilities
----
Language-MuldisD-0.3.0
http://search.cpan.org/~duncand/Language-MuldisD-0.3.0/
Formal spec of Muldis D relational DBMS lang
----
Language-MuldisD-0.3.1
http://search.cpan.org/~duncand/Language-MuldisD-0.3.1/
Formal spec of Muldis D relational DBMS lang
----
MasonX-Interp-WithCallbacks-1.17
http://search.cpan.org/~dwheeler/MasonX-Interp-WithCallbacks-1.17/
Mason callback support via Params::CallbackRequest.
----
Module-MultiConf-0.0300
http://search.cpan.org/~oliver/Module-MultiConf-0.0300/
Configure and validate your app modules in one go
----
Muldis-DB-0.3.0
http://search.cpan.org/~duncand/Muldis-DB-0.3.0/
Full-featured truly relational DBMS in Perl
----
Net-SMS-MyTMN-0.05
http://search.cpan.org/~msantinho/Net-SMS-MyTMN-0.05/
Send SMS trough MyTMN!
----
OODoc-Template-0.1
http://search.cpan.org/~markov/OODoc-Template-0.1/
Simple template system
----
Plucene-Analysis-UTF8-0.02
http://search.cpan.org/~gslin/Plucene-Analysis-UTF8-0.02/
Perl extension for UTF8 string in Plucene
----
RPC-Serialized-0.0602
http://search.cpan.org/~oliver/RPC-Serialized-0.0602/
Subroutine calls over the network using common serialization
----
RT-OnlineDocs-0.03
http://search.cpan.org/~jesse/RT-OnlineDocs-0.03/
----
SMS-Send-DeviceGsm-0.01
http://search.cpan.org/~bingos/SMS-Send-DeviceGsm-0.01/
An SMS::Send driver for Device::Gsm.
----
SMS-Send-US-TMobile-v0.0.2
http://search.cpan.org/~dmuey/SMS-Send-US-TMobile-v0.0.2/
SMS::Send driver for the wmg.tmomail.net website
----
Spreadsheet-SimpleExcel-1.8
http://search.cpan.org/~reneeb/Spreadsheet-SimpleExcel-1.8/
Create Excel files with Perl
----
Task-Apache2-Dependencies-0.01
http://search.cpan.org/~ski/Task-Apache2-Dependencies-0.01/
installs all non-Apache prereqs for Apache2
----
Task-Apache2-Dependencies-0.02
http://search.cpan.org/~ski/Task-Apache2-Dependencies-0.02/
installs all non-Apache prereqs for Apache2
----
Test-Config-System-0.63
http://search.cpan.org/~iank/Test-Config-System-0.63/
System configuration related unit tests
----
Test-Pod-Snippets-0.03_01
http://search.cpan.org/~yanick/Test-Pod-Snippets-0.03_01/
Generate tests from pod code snippets
----
Test-Pod-Snippets-0.03_02
http://search.cpan.org/~yanick/Test-Pod-Snippets-0.03_02/
Generate tests from pod code snippets
----
Test-Smart-0.01
http://search.cpan.org/~trizor/Test-Smart-0.01/
Test things that require Human Intelligence automatically. (By asking someone)
----
Test-TestCoverage-0.06
http://search.cpan.org/~reneeb/Test-TestCoverage-0.06/
Test if your test covers all 'public' subroutines of the package
----
Text-CSV-Unicode-0.03
http://search.cpan.org/~rmbarker/Text-CSV-Unicode-0.03/
comma-separated values manipulation routines with potentially wide character data
----
Tree-Suffix-0.17
http://search.cpan.org/~gray/Tree-Suffix-0.17/
Perl interface to the libstree library.
----
UID-0.20.1
http://search.cpan.org/~plato/UID-0.20.1/
----
Weed-0.009_002
http://search.cpan.org/~hooo/Weed-0.009_002/
Don't use it. It's in development. For test purposes only!
----
Weed-0.009_003
http://search.cpan.org/~hooo/Weed-0.009_003/
Don't use it. It's in development. For test purposes only!
----
Weed-0.009_009
http://search.cpan.org/~hooo/Weed-0.009_009/
Don't use it. It's in development. For test purposes only!
----
XML-Atom-Service-0.13.4
http://search.cpan.org/~takeru/XML-Atom-Service-0.13.4/
Atom Service Document object
----
XML-Encoding-2.01
http://search.cpan.org/~shay/XML-Encoding-2.01/
A perl module for parsing XML encoding maps.
----
XML-TreePP-0.21
http://search.cpan.org/~kawasaki/XML-TreePP-0.21/
Pure Perl implementation for parsing/writing xml files
If you're an author of one of these modules, please submit a detailed
announcement to comp.lang.perl.announce, and we'll pass it along.
This message was generated by a Perl program described in my Linux
Magazine column, which can be found on-line (along with more than
200 other freely available past column articles) at
http://www.stonehenge.com/merlyn/LinuxMag/col82.html
print "Just another Perl hacker," # the original
--
Randal L. Schwartz - Stonehenge Consulting Services, Inc. - +1 503 777 0095
<merlyn@stonehenge.com> <URL:http://www.stonehenge.com/merlyn/>
Perl/Unix/security consulting, Technical writing, Comedy, etc. etc.
See PerlTraining.Stonehenge.com for onsite and open-enrollment Perl training!
------------------------------
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 679
**************************************
