[31069] in Perl-Users-Digest
Perl-Users Digest, Issue: 2314 Volume: 11
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Thu Apr 2 03:09:44 2009
Date: Thu, 2 Apr 2009 00:09:08 -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 Thu, 2 Apr 2009 Volume: 11 Number: 2314
Today's topics:
Re: database advice <xhoster@gmail.com>
Re: finding maximum <mambuhl@earthlink.net>
Re: finding maximum <jameskuyper@verizon.net>
Re: finding maximum <pfiland@mindspring.com>
Re: finding maximum <tadmc@seesig.invalid>
Re: finding maximum <tadmc@seesig.invalid>
Re: finding maximum <RedGrittyBrick@SpamWeary.foo>
Re: finding maximum <mambuhl@earthlink.net>
Re: finding maximum vippstar@gmail.com
median of large data set (from large file) <hirenshah.05@gmail.com>
Re: median of large data set (from large file) <cartercc@gmail.com>
Re: median of large data set (from large file) <nospam-abuse@ilyaz.org>
Re: median of large data set (from large file) <smallpond@juno.com>
Re: median of large data set (from large file) <nospam-abuse@ilyaz.org>
Re: median of large data set (from large file) <nospam-abuse@ilyaz.org>
Re: median of large data set (from large file) <xhoster@gmail.com>
new CPAN modules on Thu Apr 2 2009 (Randal Schwartz)
Digest Administrivia (Last modified: 6 Apr 01) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: Wed, 01 Apr 2009 20:52:17 -0700
From: Xho Jingleheimerschmidt <xhoster@gmail.com>
Subject: Re: database advice
Message-Id: <49d4482c$0$12126$ed362ca5@nr5-q3a.newsreader.com>
ccc31807 wrote:
>
> Doesn't matter. The diagnosis is merely informational, and very rarely
> accessed. I don't programatically manipulate this data, just display
> it when requested.
How did the data get there in the first place, if it never undergoes
anything other than retrieval and display?
Xho
------------------------------
Date: Wed, 01 Apr 2009 16:32:55 -0400
From: Martin Ambuhl <mambuhl@earthlink.net>
Subject: Re: finding maximum
Message-Id: <gr0j23$qnt$1@news.motzarella.org>
sandeep wrote:
> Friends ~
>
> Thanks for the answers. Actually this is not a homework, I am just curious.
>
> Anyways, here is my solution:
all of which are verbose compared to (max list):
>;; maximum of one integer
(max 3)
3
>
;; maximum of two integers
(max 483 6932487534)
6932487534
>
;; maximum of two floats and an integer
(max 4.72 49.1 -3)
49.100000000000001
>
;; maximum of a list, including several types
(max -3 49/3 5.37s-1 -34.3l-2 5.1)
49/3
>
;; minimum of the same list
(min -3 49/3 5.37s-1 -34.3l-2 5.1)
-3
>
;; print value of the list
>'(-3 49/3 5.37s-1 -34.3l-2 5.1)
(-3 49/3 0.537S0 -0.34299999999999997 5.0999999999999996)
> Conclusion: Perl is more expressive as a simple function for two arguments
> often generalizes to any list.
Conclusion: lisp is more expressive, period.
------------------------------
Date: Wed, 1 Apr 2009 13:44:32 -0700 (PDT)
From: jameskuyper <jameskuyper@verizon.net>
Subject: Re: finding maximum
Message-Id: <fd8aa2d7-9d56-4214-a549-0407552c8446@r18g2000vbi.googlegroups.com>
Ted Zlatanov wrote:
> On Tue, 31 Mar 2009 23:13:09 +0100 sandeep <nospam@nospam.com> wrote:
>
> s> How would you find the maximum of
> s> (a) two numbers
> s> (b) a set of numbers
> s> in idiomatic C? How would you do it in idiomatic Perl?
>
> In any language, you put the numbers in an array, sort the array, and
> return the element at the top. Similarly, to get the average, you sort
> the array and then return the middle number (AKA the "median average").
That's at best an O(N log N) solution. There's an O(N) solution which
is even simpler; sandeep presented the basic idea for that solution
(badly) in his second message on this thread.
> In Perl sorting is even built into the language; in C unfortunately you
> have to embed the Perl interpreter to get that kind of simplicity.
In C, sorting is built into the standard library: qsort(). It may be
clumsier to use, perhaps, than Perl's sort, but it's still an easier
solution for a C program than embedding the perl interpreter.
------------------------------
Date: Wed, 01 Apr 2009 16:51:45 -0500
From: pete <pfiland@mindspring.com>
Subject: Re: finding maximum
Message-Id: <A_2dnYKX9ttDTk7UnZ2dnUVZ_u2dnZ2d@earthlink.com>
sandeep wrote:
> Friends ~
>
> Thanks for the answers. Actually this is not a homework, I am just curious.
>
> Anyways, here is my solution:
>
> (a) in C:
>
> int max(int a, int b)
> {
> if(a>b)
> return a;
> return b;
> }
> On Wed, 01 Apr 2009 01:18:57 +0300, Phil Carmody wrote:
>> sandeep <nospam@nospam.com> writes:
>>> Hello Friends ~
>>>
>>> How would you find the maximum of
>>> (a) two numbers
>>> (b) a set of numbers
>>> in idiomatic C?
In C,
the conditional operator would be more idiomatic
for two numbers of any type.
#define max(A, B) ((B) > (A) ? B : (A))
--
pete
------------------------------
Date: Wed, 1 Apr 2009 15:46:35 -0500
From: Tad J McClellan <tadmc@seesig.invalid>
Subject: Re: finding maximum
Message-Id: <slrngt7klb.vp7.tadmc@tadmc30.sbcglobal.net>
["Followup-To:" header set to comp.lang.perl.misc.]
Ted Zlatanov <tzz@lifelogs.com> wrote:
> On Tue, 31 Mar 2009 23:13:09 +0100 sandeep <nospam@nospam.com> wrote:
>
> s> How would you find the maximum of
> s> (a) two numbers
> s> (b) a set of numbers
> s> in idiomatic C? How would you do it in idiomatic Perl?
>
> In any language, you put the numbers in an array, sort the array, and
> return the element at the top.
Unless the array might be "large".
Your algorithm is likely O(n log n) when finding the maximum can
be done in only O(n).
> s> Use this as a basis for a discussion of the differences in expressive
> s> power of the two languages.
>
> We are programmers, sir. Discussion does not become us.
Sure we do. We discuss stuff all the time.
But we discuss what interests us.
That is, we do not take direction from random usenauts.
--
Tad McClellan
email: perl -le "print scalar reverse qq/moc.noitatibaher\100cmdat/"
------------------------------
Date: Wed, 1 Apr 2009 15:57:31 -0500
From: Tad J McClellan <tadmc@seesig.invalid>
Subject: Re: finding maximum
Message-Id: <slrngt7l9r.vp7.tadmc@tadmc30.sbcglobal.net>
["Followup-To:" header set to comp.lang.perl.misc.]
sandeep <nospam@nospam.com> wrote:
> Actually this is not a homework, I am just curious.
Yeah right.
> Anyways, here is my solution:
>
> (a) in C:
>
> int max(int a, int b)
> {
> if(a>b)
> return a;
> return b;
> }
>
> in Perl:
>
> sub max
> {
> my $max = shift;
> for(@_) {
> $max=$_ if($_>$max)
> }
> $max;
> }
>
>
> (b) in C:
>
> #define NUMMAX (10)
> int max(int a[NUMMAX])
> {
> int max = -1;
> for(int i=0; i < NUMMAX;)
> if(a[i++]>max)
> max = a[i-1];
> return max;
> }
>
>
> In Perl: the solution for (a) still works.
>
> Conclusion: Perl is more expressive as a simple function for two arguments
> often generalizes to any list.
That is a load of hooey.
You are not comparing languages, you are comparing algorithms.
If you had used the high water mark algorithm in C's (a), then it would have
generalized just as well as the high water mark algorithm in Perl's (a) did.
#define NUMMAX (10)
int max(int a[NUMMAX])
{
int max = a[0];
for(int i = 1; i < NUMMAX; i++)
if(a[i] > max)
max = a[i];
return max;
}
--
Tad McClellan
email: perl -le "print scalar reverse qq/moc.noitatibaher\100cmdat/"
------------------------------
Date: Wed, 01 Apr 2009 22:57:37 +0100
From: RedGrittyBrick <RedGrittyBrick@SpamWeary.foo>
Subject: Re: finding maximum
Message-Id: <7oCdnfmWF6zFfk7UnZ2dnUVZ8tCdnZ2d@bt.com>
sandeep wrote:
> Friends ~
>
> Thanks for the answers. Actually this is not a homework, I am just curious.
>
> Anyways, here is my solution:
>
> (a) in C:
>
> int max(int a, int b)
> {
> if(a>b)
> return a;
> return b;
> }
>
> in Perl:
>
> sub max
> {
> my $max = shift;
> for(@_) {
> $max=$_ if($_>$max)
> }
> $max;
> }
>
>
> (b) in C:
>
> #define NUMMAX (10)
> int max(int a[NUMMAX])
> {
> int max = -1;
> for(int i=0; i < NUMMAX;)
> if(a[i++]>max)
> max = a[i-1];
> return max;
> }
>
>
> In Perl: the solution for (a) still works.
>
> Conclusion: Perl is more expressive as a simple function for two arguments
> often generalizes to any list.
But where's your solution in INTERCAL?
--
RGB
------------------------------
Date: Wed, 01 Apr 2009 18:38:46 -0400
From: Martin Ambuhl <mambuhl@earthlink.net>
Subject: Re: finding maximum
Message-Id: <gr0qe0$qad$2@news.motzarella.org>
pete wrote:
> In C,
> the conditional operator would be more idiomatic
> for two numbers of any type.
>
> #define max(A, B) ((B) > (A) ? B : (A))
Avoiding multiple evaluation is a problem with this. It needs to be a
bit longer.
------------------------------
Date: Wed, 1 Apr 2009 16:52:04 -0700 (PDT)
From: vippstar@gmail.com
Subject: Re: finding maximum
Message-Id: <5ed96721-fd6a-4a03-8194-d78d02dc46d6@q16g2000yqg.googlegroups.com>
On Apr 2, 1:38=A0am, Martin Ambuhl <mamb...@earthlink.net> wrote:
> pete wrote:
> > In C,
> > the conditional operator would be more idiomatic
> > for two numbers of any type.
>
> > #define max(A, B) ((B) > (A) ? B : (A))
>
> Avoiding multiple evaluation is a problem with this. =A0It needs to be a
> bit longer.
You're saying that it can be written without evaluating the arguments
more than once? How?
------------------------------
Date: Wed, 1 Apr 2009 13:34:43 -0700 (PDT)
From: "friend.05@gmail.com" <hirenshah.05@gmail.com>
Subject: median of large data set (from large file)
Message-Id: <4ce3dd5f-9521-4755-9bf8-75c90a3ecdd5@f19g2000yqh.googlegroups.com>
I have very big file(GBs).
I want to calculate median of this large data set. Any efficient way
to calculate it.
I cannot read filei n array as it will go out-of-memory due to large
amount of data.
THanks
------------------------------
Date: Wed, 1 Apr 2009 14:02:42 -0700 (PDT)
From: ccc31807 <cartercc@gmail.com>
Subject: Re: median of large data set (from large file)
Message-Id: <e4bb40a8-be60-44b1-be77-f89bddb5a9f2@j39g2000yqn.googlegroups.com>
On Apr 1, 4:34=A0pm, "friend...@gmail.com" <hirenshah...@gmail.com>
wrote:
> I have very big file(GBs).
>
> I want to calculate median of this large data set. Any efficient way
> to calculate it.
>
> I cannot read filei n array as it will go out-of-memory due to large
> amount of data.
>
> THanks
As I recall, you can use a bucket sort to sort a list without reading
them all into memory. Sort the list using bucket sort, counting the
elements, and then take the middle element.
CC
------------------------------
Date: Wed, 01 Apr 2009 21:30:00 GMT
From: Ilya Zakharevich <nospam-abuse@ilyaz.org>
Subject: Re: median of large data set (from large file)
Message-Id: <slrngt7nig.1ck.nospam-abuse@chorin.math.berkeley.edu>
On 2009-04-01, friend.05@gmail.com <hirenshah.05@gmail.com> wrote:
> I have very big file(GBs).
>
> I want to calculate median of this large data set. Any efficient way
> to calculate it.
>
> I cannot read filei n array as it will go out-of-memory due to large
> amount of data.
Median is MAJORLY tricky. (IIRC,) Contrary to a widespead believes,
there IS a linear time limited-memory algo (but it is MUCH more
delicate than the usual FFT/quicksort-like tricks).
I would be pretty sure that the algo is already implemented in any
reasonable toolset. Did you check the CPAN search?
Hope this helps,
Ilya
------------------------------
Date: Wed, 1 Apr 2009 14:51:33 -0700 (PDT)
From: smallpond <smallpond@juno.com>
Subject: Re: median of large data set (from large file)
Message-Id: <36614089-9856-40cd-9fe5-5387b8dac1f5@s28g2000vbp.googlegroups.com>
On Apr 1, 4:34=A0pm, "friend...@gmail.com" <hirenshah...@gmail.com>
wrote:
> I have very big file(GBs).
>
> I want to calculate median of this large data set. Any efficient way
> to calculate it.
>
> I cannot read filei n array as it will go out-of-memory due to large
> amount of data.
>
> THanks
There is a method for calculating the median without
sorting that takes O(log N) passes through your 9-track
tapes, getting progressively closer upper and lower bounds.
It's probably in Knuth, but I don't have a copy handy.
------------------------------
Date: Wed, 01 Apr 2009 22:08:40 GMT
From: Ilya Zakharevich <nospam-abuse@ilyaz.org>
Subject: Re: median of large data set (from large file)
Message-Id: <slrngt7pf8.1s8.nospam-abuse@chorin.math.berkeley.edu>
On 2009-04-01, Ilya Zakharevich <nospam-abuse@ilyaz.org> wrote:
> Median is MAJORLY tricky. (IIRC,) Contrary to a widespead believes,
> there IS a linear time limited-memory algo (but it is MUCH more
> delicate than the usual FFT/quicksort-like tricks).
Oups, of course it needs "limited" RANDOM-ACCESS memory; it still needs
a lot of sequential-access memory (read: disk).
Ilya
------------------------------
Date: Wed, 01 Apr 2009 23:12:01 GMT
From: Ilya Zakharevich <nospam-abuse@ilyaz.org>
Subject: Re: median of large data set (from large file)
Message-Id: <slrngt7t61.26m.nospam-abuse@chorin.math.berkeley.edu>
On 2009-04-01, Ilya Zakharevich <nospam-abuse@ilyaz.org> wrote:
> On 2009-04-01, friend.05@gmail.com <hirenshah.05@gmail.com> wrote:
>> I have very big file(GBs).
>>
>> I want to calculate median of this large data set. Any efficient way
>> to calculate it.
>>
>> I cannot read filei n array as it will go out-of-memory due to large
>> amount of data.
>
> Median is MAJORLY tricky. (IIRC,) Contrary to a widespead believes,
^^^^
> there IS a linear time limited-memory algo (but it is MUCH more
> delicate than the usual FFT/quicksort-like tricks).
Yes, I remembered correct. ;-) *This* time I even managed to
reconstruct the algo...
> I would be pretty sure that the algo is already implemented in any
> reasonable toolset. Did you check the CPAN search?
In fact, this algo makes sense ONLY if know nothing about distribution
of the data. E.g., if you know that your data is `double-precision',
then there are only 2**64 buckets; on 10-year-old hardware it is not a
problem to decimate into about 2**24 buckets.
So `double-precision' data is guarantied to be decimated in 3 rounds,
and most probably would in 2 (second round very quick).
Hope this helps,
Ilya
------------------------------
Date: Wed, 01 Apr 2009 21:06:02 -0700
From: Xho Jingleheimerschmidt <xhoster@gmail.com>
Subject: Re: median of large data set (from large file)
Message-Id: <49d4482d$0$12126$ed362ca5@nr5-q3a.newsreader.com>
friend.05@gmail.com wrote:
> I have very big file(GBs).
>
> I want to calculate median of this large data set. Any efficient way
> to calculate it.
>
> I cannot read filei n array as it will go out-of-memory due to large
> amount of data.
I'd start by using the system's file sort utility to sort the file, and
see if that is good enough.
Xho
------------------------------
Date: Thu, 2 Apr 2009 04:42:30 GMT
From: merlyn@stonehenge.com (Randal Schwartz)
Subject: new CPAN modules on Thu Apr 2 2009
Message-Id: <KHGIEu.1w53@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.
AnyEvent-SNMP-0.1
http://search.cpan.org/~mlehmann/AnyEvent-SNMP-0.1/
adaptor to integrate Net::SNMP into Anyevent.
----
Apache-SWIT-Security-0.1
http://search.cpan.org/~bosu/Apache-SWIT-Security-0.1/
security subsystem for Apache::SWIT
----
Apache2-AuthenRadius-0.6
http://search.cpan.org/~kevin/Apache2-AuthenRadius-0.6/
Authentication via a Radius server
----
App-CSV-0.03
http://search.cpan.org/~gaal/App-CSV-0.03/
process CSV files
----
App-FQStat-6.3
http://search.cpan.org/~smueller/App-FQStat-6.3/
Interactive console front-end for Sun's grid engine
----
App-Munchies-0.1.627
http://search.cpan.org/~pjfl/App-Munchies-0.1.627/
Catalyst example application using food recipes as a data set
----
App-Munchies-0.1.637
http://search.cpan.org/~pjfl/App-Munchies-0.1.637/
Catalyst example application using food recipes as a data set
----
App-XML-DocBook-Builder-0.0101
http://search.cpan.org/~shlomif/App-XML-DocBook-Builder-0.0101/
Build DocBook/XML files.
----
Async-MergePoint-0.02
http://search.cpan.org/~pevans/Async-MergePoint-0.02/
resynchronise diverged control flow
----
B-Foreach-Iterator-0.02
http://search.cpan.org/~gfuji/B-Foreach-Iterator-0.02/
Increases foreach iterators
----
BSD-Resource-1.2903
http://search.cpan.org/~jhi/BSD-Resource-1.2903/
BSD process resource limit and priority functions
----
Bio-Graphics-1.92
http://search.cpan.org/~lds/Bio-Graphics-1.92/
Generate GD images of Bio::Seq objects
----
CPAN-CachingProxy-1.4002
http://search.cpan.org/~jettero/CPAN-CachingProxy-1.4002/
A very simple lightweight CGI based Caching Proxy
----
CPAN-Packager-0.01
http://search.cpan.org/~kitano/CPAN-Packager-0.01/
Create packages(rpm, deb) from perl modules
----
CPANPLUS-YACSmoke-0.33_02
http://search.cpan.org/~bingos/CPANPLUS-YACSmoke-0.33_02/
Yet Another CPANPLUS Smoke Tester
----
CPS-0.03
http://search.cpan.org/~pevans/CPS-0.03/
flow control structures in Continuation-Passing Style
----
Catalyst-Authentication-Credential-Authen-Simple-0.03
http://search.cpan.org/~jlmartin/Catalyst-Authentication-Credential-Authen-Simple-0.03/
Verify credentials with the Authen::Simple framework
----
Catalyst-Controller-ActionRole-0.06
http://search.cpan.org/~flora/Catalyst-Controller-ActionRole-0.06/
Apply roles to action instances
----
Catalyst-Controller-ActionRole-0.07
http://search.cpan.org/~hdp/Catalyst-Controller-ActionRole-0.07/
Apply roles to action instances
----
Catalyst-Plugin-Cache-Memcached-Fast-0.12
http://search.cpan.org/~vasilus/Catalyst-Plugin-Cache-Memcached-Fast-0.12/
Catalyst Plugin for Cache::Memcached::Fast
----
Catalyst-Plugin-ConfigComponents-0.1.60
http://search.cpan.org/~pjfl/Catalyst-Plugin-ConfigComponents-0.1.60/
Creates components from config entries
----
Catalyst-Plugin-InflateMore-0.1.41
http://search.cpan.org/~pjfl/Catalyst-Plugin-InflateMore-0.1.41/
Inflates symbols in application config
----
Catalyst-Plugin-Localize-Simple-1.1
http://search.cpan.org/~wehr/Catalyst-Plugin-Localize-Simple-1.1/
----
Catalyst-Plugin-Session-Store-DBIC-0.09
http://search.cpan.org/~flora/Catalyst-Plugin-Session-Store-DBIC-0.09/
Store your sessions via DBIx::Class
----
CatalystX-Plugin-Engine-FastCGI-Lighttpd-0.0.2
http://search.cpan.org/~yoshida/CatalystX-Plugin-Engine-FastCGI-Lighttpd-0.0.2/
enable to dispatch to the Catalyst via 404 handler.
----
CatalystX-Usul-0.1.417
http://search.cpan.org/~pjfl/CatalystX-Usul-0.1.417/
A base class for Catalyst MVC components
----
CatalystX-Usul-0.1.426
http://search.cpan.org/~pjfl/CatalystX-Usul-0.1.426/
A base class for Catalyst MVC components
----
Chart-Clicker-2.21
http://search.cpan.org/~gphat/Chart-Clicker-2.21/
Powerful, extensible charting.
----
Class-MOP-0.80
http://search.cpan.org/~drolsky/Class-MOP-0.80/
A Meta Object Protocol for Perl 5
----
Config-Model-Backend-Augeas-0.106
http://search.cpan.org/~ddumont/Config-Model-Backend-Augeas-0.106/
Read and write config data through Augeas
----
DBD-SQLite-1.19_04
http://search.cpan.org/~adamk/DBD-SQLite-1.19_04/
Self Contained RDBMS in a DBI Driver
----
Data-CloudWeights-0.2.79
http://search.cpan.org/~pjfl/Data-CloudWeights-0.2.79/
Calculate values for an HTML tag cloud
----
Data-Localize-0.00006_01
http://search.cpan.org/~dmaki/Data-Localize-0.00006_01/
Alternate Data Localization API
----
Data-PrefixMerge-0.02
http://search.cpan.org/~sharyanto/Data-PrefixMerge-0.02/
Merge two nested data structures, with merging mode prefix on hash keys
----
Data-Schema-0.03
http://search.cpan.org/~sharyanto/Data-Schema-0.03/
Validate nested data structures with nested structure
----
Data-Schema-0.04
http://search.cpan.org/~sharyanto/Data-Schema-0.04/
Validate nested data structures with nested structure
----
Data-Validation-0.2.72
http://search.cpan.org/~pjfl/Data-Validation-0.2.72/
Check data values for conformance with constraints
----
Devel-FindBlessedRefs-1.252
http://search.cpan.org/~jettero/Devel-FindBlessedRefs-1.252/
find all refs blessed under a package
----
EAFDSS-0.39_01
http://search.cpan.org/~hasiotis/EAFDSS-0.39_01/
Electronic Fiscal Signature Devices Library
----
EBook-Tools-0.4.4
http://search.cpan.org/~azed/EBook-Tools-0.4.4/
Object class for manipulating and generating E-books
----
Fey-0.25
http://search.cpan.org/~drolsky/Fey-0.25/
Better SQL Generation Through Perl
----
FileSystem-LL-FAT-0.01
http://search.cpan.org/~ilyaz/FileSystem-LL-FAT-0.01/
Perl extension for low-level access to FAT partitions
----
Font-TTF-Scripts-0.13
http://search.cpan.org/~mhosken/Font-TTF-Scripts-0.13/
Smart font script supporting modules and scripts for TTF/OTF
----
FreeBSD-Pkgs-FindUpdates-0.2.1
http://search.cpan.org/~vvelox/FreeBSD-Pkgs-FindUpdates-0.2.1/
Finds updates for FreeBSD pkgs by checking the ports index.
----
Games-RolePlay-MapGen-1.4001
http://search.cpan.org/~jettero/Games-RolePlay-MapGen-1.4001/
The base object for generating dungeons and maps
----
HTML-Accessors-0.1.53
http://search.cpan.org/~pjfl/HTML-Accessors-0.1.53/
Generate HTML elements
----
HTML-FormWidgets-0.3.139
http://search.cpan.org/~pjfl/HTML-FormWidgets-0.3.139/
Create HTML form markup
----
HTML-Shakan-0.01_06
http://search.cpan.org/~tokuhirom/HTML-Shakan-0.01_06/
form html generator/validator
----
HTML-Tested-JavaScript-0.15
http://search.cpan.org/~bosu/HTML-Tested-JavaScript-0.15/
JavaScript enabled HTML::Tested widgets.
----
IO-Socket-SSL-1.24
http://search.cpan.org/~sullr/IO-Socket-SSL-1.24/
Nearly transparent SSL encapsulation for IO::Socket::INET.
----
IPC-SRLock-0.2.100
http://search.cpan.org/~pjfl/IPC-SRLock-0.2.100/
Set/reset locking semantics to single thread processes
----
JE-0.032
http://search.cpan.org/~sprout/JE-0.032/
Pure-Perl ECMAScript (JavaScript) Engine
----
LEOCHARRE-Class2-1.17
http://search.cpan.org/~leocharre/LEOCHARRE-Class2-1.17/
----
LWP-UserAgent-Mockable-0.90
http://search.cpan.org/~mmorgan/LWP-UserAgent-Mockable-0.90/
Permits recording, and later playing back of LWP requests.
----
Marpa-0.001_005
http://search.cpan.org/~jkegl/Marpa-0.001_005/
General BNF Parsing (Experimental version)
----
Math-Units-PhysicalValue-1.0001
http://search.cpan.org/~jettero/Math-Units-PhysicalValue-1.0001/
An OO interface for automatically calculating values with units.
----
Math-Units-PhysicalValue-1.0005
http://search.cpan.org/~jettero/Math-Units-PhysicalValue-1.0005/
An OO interface for automatically calculating values with units.
----
Module-Install-Repository-0.03
http://search.cpan.org/~miyagawa/Module-Install-Repository-0.03/
Automatically sets repository URL from svn/svk/Git checkout
----
MooseX-MethodAttributes-0.05
http://search.cpan.org/~bobtfish/MooseX-MethodAttributes-0.05/
code attribute introspection
----
Moxy-0.53
http://search.cpan.org/~tokuhirom/Moxy-0.53/
Mobile web development proxy
----
MySQL-Sandbox-2.0.98d
http://search.cpan.org/~gmax/MySQL-Sandbox-2.0.98d/
Quickly installs MySQL side server, either standalone or in groups
----
Net-ParSCP-0.04
http://search.cpan.org/~casiano/Net-ParSCP-0.04/
Parallel secure copy
----
OAuth-Lite-1.16
http://search.cpan.org/~lyokato/OAuth-Lite-1.16/
OAuth framework
----
PDF-TextBlock-0.01
http://search.cpan.org/~jhannah/PDF-TextBlock-0.01/
Easier creation of text blocks when using PDF::API2
----
POE-Component-SmokeBox-0.22
http://search.cpan.org/~bingos/POE-Component-SmokeBox-0.22/
POE enabled CPAN smoke testing with added value.
----
Padre-Plugin-Autoformat-1.1.0
http://search.cpan.org/~jquelin/Padre-Plugin-Autoformat-1.1.0/
reformat your text within Padre
----
Padre-Plugin-Autoformat-1.1.1
http://search.cpan.org/~jquelin/Padre-Plugin-Autoformat-1.1.1/
reformat your text within Padre
----
Padre-Plugin-Catalyst-0.01
http://search.cpan.org/~garu/Padre-Plugin-Catalyst-0.01/
Simple Catalyst helper interface for Padre
----
Padre-Plugin-DataWalker-0.01
http://search.cpan.org/~smueller/Padre-Plugin-DataWalker-0.01/
Simple Perl data structure browser Padre
----
Padre-Plugin-Nopaste-0.2.0
http://search.cpan.org/~jquelin/Padre-Plugin-Nopaste-0.2.0/
send code on a nopaste website from padre
----
Parallel-Fork-BossWorkerAsync-0.02
http://search.cpan.org/~jvannucci/Parallel-Fork-BossWorkerAsync-0.02/
Perl extension for creating asynchronous forking queue processing applications.
----
Parse-Dia-SQL-0.07
http://search.cpan.org/~aff/Parse-Dia-SQL-0.07/
Convert Dia class diagrams into SQL.
----
Passwd-Unix-0.47
http://search.cpan.org/~strzelec/Passwd-Unix-0.47/
----
Perldoc-Server-0.02
http://search.cpan.org/~jonallen/Perldoc-Server-0.02/
local Perl documentation server
----
Proc-Exists-0.99
http://search.cpan.org/~brianski/Proc-Exists-0.99/
quickly and portably check for process existence
----
Provision-Unix-0.48
http://search.cpan.org/~msimerson/Provision-Unix-0.48/
provision accounts on unix systems
----
Provision-Unix-0.49
http://search.cpan.org/~msimerson/Provision-Unix-0.49/
provision accounts on unix systems
----
Sjis-0.34
http://search.cpan.org/~ina/Sjis-0.34/
"Yet Another JPerl with Tk" Source code filter to escape ShiftJIS
----
Statistics-SDT-0.032
http://search.cpan.org/~rgarton/Statistics-SDT-0.032/
Signal detection theory (SDT) measures of sensitivity and response-bias
----
Statistics-SDT-0.033
http://search.cpan.org/~rgarton/Statistics-SDT-0.033/
Signal detection theory (SDT) measures of sensitivity and response-bias
----
Storable-AMF-0.60
http://search.cpan.org/~grian/Storable-AMF-0.60/
Perl extension for serialize/deserialize AMF0/AMF3 data
----
Sunpower-Cryo-Funclib-0.1.4
http://search.cpan.org/~kerr/Sunpower-Cryo-Funclib-0.1.4/
a module for interfacing with Sunpower Cryocoolers
----
TM-IP-Documents-0.02
http://search.cpan.org/~drrho/TM-IP-Documents-0.02/
REST service for Topic Maps document subspaces
----
Task-Padre-Plugin-Deps-0.11
http://search.cpan.org/~fayland/Task-Padre-Plugin-Deps-0.11/
prereqs of Padre::Plugins
----
Task-Padre-Plugins-0.18
http://search.cpan.org/~fayland/Task-Padre-Plugins-0.18/
Get many Plugins of Padre at once
----
Test-Class-Sugar-0.0100
http://search.cpan.org/~pdcawley/Test-Class-Sugar-0.0100/
Helper syntax for writing Test::Class tests
----
Test-Database-0.99_01
http://search.cpan.org/~book/Test-Database-0.99_01/
Database handles ready for testing
----
Test-Regexp-2009033101
http://search.cpan.org/~abigail/Test-Regexp-2009033101/
Test your regular expressions
----
Tk-ForDummies-Graph-1.04
http://search.cpan.org/~djibel/Tk-ForDummies-Graph-1.04/
Extension of Canvas widget to create a graph like GDGraph.
----
Tk-Spectrum-0.02
http://search.cpan.org/~kirsle/Tk-Spectrum-0.02/
A stylish color selection dialog.
----
UMLS-Similarity-0.15
http://search.cpan.org/~btmcinnes/UMLS-Similarity-0.15/
A suite of Perl modules that implement a number of semantic similarity measures. The measures use the UMLS-Interface module to access the UMLS to generate similarity scores between concepts.
----
WWW-Contact-0.22
http://search.cpan.org/~fayland/WWW-Contact-0.22/
Get contacts/addressbook from Web
----
WWW-Opentracker-Stats-1.11
http://search.cpan.org/~hovenko/WWW-Opentracker-Stats-1.11/
Perl module for retrieve statistics from Opentracker
----
WWW-Scraper-ISBN-LibUniverIt_Driver-0.11
http://search.cpan.org/~marcog/WWW-Scraper-ISBN-LibUniverIt_Driver-0.11/
----
WebService-Careerjet-0.09
http://search.cpan.org/~jeteve/WebService-Careerjet-0.09/
Perl interface to Careerjet's public search API
----
Win32-CommandLine-0.4.0.583
http://search.cpan.org/~rivy/Win32-CommandLine-0.4.0.583/
Retrieve and reparse the Win32 command line
----
Win32-IEAutomation-RapidShare-0.03
http://search.cpan.org/~kxj/Win32-IEAutomation-RapidShare-0.03/
Perl extension for downloading files hosted by RapidShare
----
Win32-SysPrivilege
http://search.cpan.org/~rootkwok/Win32-SysPrivilege/
Perl extension for blah blah blah
----
Win32-SysPrivilege-0.03
http://search.cpan.org/~rootkwok/Win32-SysPrivilege-0.03/
Perl extension for Running external programs with SYSTEM Privilege
----
Win32-SysPrivilege-v0.01
http://search.cpan.org/~rootkwok/Win32-SysPrivilege-v0.01/
Perl extension for blah blah blah
----
Win32-SysPrivilege-v0.1
http://search.cpan.org/~rootkwok/Win32-SysPrivilege-v0.1/
Perl extension for Running external programs with SYSTEM Privilege
----
Win32-SysPrivilege-v1.1
http://search.cpan.org/~rootkwok/Win32-SysPrivilege-v1.1/
Perl extension for Running external programs with SYSTEM Privilege
----
XML-RSS-1.44
http://search.cpan.org/~shlomif/XML-RSS-1.44/
creates and updates RSS files
----
XML-Reader-0.06
http://search.cpan.org/~keichner/XML-Reader-0.06/
Reading XML and providing path information based on a pull-parser.
----
XML-Reader-0.07
http://search.cpan.org/~keichner/XML-Reader-0.07/
Reading XML and providing path information based on a pull-parser.
----
ZConf-Mail-0.3.1
http://search.cpan.org/~vvelox/ZConf-Mail-0.3.1/
Misc mail client functions backed by ZConf.
----
stockmonkey-2.9013
http://search.cpan.org/~jettero/stockmonkey-2.9013/
----
xcruciate-015
http://search.cpan.org/~melonman/xcruciate-015/
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/>
Smalltalk/Perl/Unix consulting, Technical writing, Comedy, etc. etc.
See http://methodsandmessages.vox.com/ for Smalltalk and Seaside discussion
------------------------------
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 2314
***************************************
