[30756] in Perl-Users-Digest
Perl-Users Digest, Issue: 2001 Volume: 11
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Mon Nov 24 14:09:50 2008
Date: Mon, 24 Nov 2008 11:09:13 -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 Mon, 24 Nov 2008 Volume: 11 Number: 2001
Today's topics:
comp.lang.* newsgroups seems dying <xahlee@gmail.com>
Re: comp.lang.* newsgroups seems dying <jurgenex@hotmail.com>
Re: comp.lang.* newsgroups seems dying <xahlee@gmail.com>
Re: How to iterator array in order? <cwilbur@chromatico.net>
Re: How to iterator array in order? <tzz@lifelogs.com>
Re: How to iterator array in order? <jurgenex@hotmail.com>
Re: How to iterator array in order? <tzz@lifelogs.com>
IP address - longest prefix match <hirenshah.05@gmail.com>
longest prefix match <hirenshah.05@gmail.com>
Re: longest prefix match <jurgenex@hotmail.com>
Re: longest prefix match <hirenshah.05@gmail.com>
Re: longest prefix match <tzz@lifelogs.com>
Re: longest prefix match <hirenshah.05@gmail.com>
new CPAN modules on Mon Nov 24 2008 (Randal Schwartz)
Reference Question. <DaLoveRhino@hotmail.com>
Re: Reference Question. xhoster@gmail.com
regexp modrewrite <nordnewyorker@gmail.com>
Re: regexp modrewrite <jurgenex@hotmail.com>
Re: regexp modrewrite <tim@burlyhost.com>
Re: regular expression to detect dos filenames (fidokomik\)
Re: Restarting a Program mid stream <glennj@ncf.ca>
Re: sleep(30) hangs <tzz@lifelogs.com>
Digest Administrivia (Last modified: 6 Apr 01) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: Mon, 24 Nov 2008 06:11:16 -0800 (PST)
From: Xah Lee <xahlee@gmail.com>
Subject: comp.lang.* newsgroups seems dying
Message-Id: <0ce02b6e-035f-40e2-82e1-953228138c87@e1g2000pra.googlegroups.com>
it appears to me, that comp.lang.lisp is dying, and i think
comp.lang.* newsgroup is dying in general. (perhaps all newsgroups)
my experience in the last couple of years, i noticed fewer posts, and
much more spams, especially this year.
i think at least 25% of posts to comp.lang.lisp are spams this year.
Coupled with that info, you can check post stat here:
http://groups.google.com/group/comp.lang.lisp/about
it does seem decreasing. You can check other groups in the similar
way.
-----------------
it's funny that in comp.lang.perl.misc, half of the post these days
are Perl FAQs. lol. The Perl community's fanatical fuckhead priests
are practical and loud bunch, thinking they are mavericks and messiahs
among the programing geekers. They post their FAQ frequently, but not
only that, they cut it into 1 Question/Answer format and post several
of it per day. They've been doing that for years. (but even so, Perl's
popularity has been decreasing long-term in the past decade ...
(because, if good people keeps communication and info going, no amount
of marketing and fucking lies will perpetually sell yourself. The
other reason for decreasing perl use is that actually lots and lots
languages are coming into the scene))
(see also:
=E2=80=A2 Pathetically Elational Regex Language
http://xahlee.org/UnixResource_dir/perlr.html
=E2=80=A2 Proliferation of Computing Languages
http://xahlee.org/UnixResource_dir/writ/new_langs.html
)
If comp.lang.lisp's fanatical lisp fuckheads actually cared about lisp
and lisp's health, and less of their motherfucking above-it mentality,
they'd do that (posting factualy Frequently asked Q/A on a daily
basis) and it would actually help lisp. (but the lisp regular
fuckhead's concern in comp.lang.lisp is typically: =E2=80=9Ci'm above you=
=E2=80=9D and
=E2=80=9Ceverything lisp is superior=E2=80=9D. Fuck lispers, in particular,=
fuck
Common Lispers and fuck Scheme lispers. They are perhaps the most
worthless snob collective among functional programing communities.)
(See:
=E2=80=A2 Fundamental Problems of Lisp
http://xahlee.org/UnixResource_dir/writ/lisp_problems.html
)
-----------------
in 2006 i did a survey of comp.lang.* posting frequency trend:
=E2=80=A2 Computer Language Popularity Trend
http://xahlee.org/lang_traf/index.html
Perhaps it's time to do it again?
all the code to do it is already there... (the python code grab the
info from google, and Mathematica generate the graph)
perhaps someone could take 10 min to run the code and post a report?
(all you need to do is create the graph part, using perhaps gnuplot or
similar, since you probably don't have Mathematica)
the problem with posting stat now is that massive number of spam posts
in the last few years. Fuck the motherfucking, irresponsible,
unthinking, social science illiterate tech geekers. It is their deeds
and behaviors that resulted this.
=E2=80=A2 Tech Geekers versus Spammers
http://xahlee.org/UnixResource_dir/writ/tech_geekers_vs_spammers.html
Xah
=E2=88=91 http://xahlee.org/
=E2=98=84
------------------------------
Date: Mon, 24 Nov 2008 08:04:08 -0800
From: Jürgen Exner <jurgenex@hotmail.com>
Subject: Re: comp.lang.* newsgroups seems dying
Message-Id: <ltjli4l7oh99qqvhd9knn1ml8c7ng95l4v@4ax.com>
Xah Lee <xahlee@gmail.com> wrote:
[whatever]
Changed your ID again to escape the kill files?
Back you go to where you belong.
+-------------------+ .:\:\:/:/:.
| PLEASE DO NOT | :.:\:\:/:/:.:
| FEED THE TROLLS | :=.' - - '.=:
| | '=(\ 9 9 /)='
| Thank you, | ( (_) )
| Management | /`-vvv-'\
+-------------------+ / \
| | @@@ / /|,,,,,|\ \
| | @@@ /_// /^\ \\_\
@x@@x@ | | |/ WW( ( ) )WW
\||||/ | | \| __\,,\ /,,/__
\||/ | | | jgs (______Y______)
/\/\/\/\/\/\/\/\//\/\\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\
==============================================================
jue
------------------------------
Date: Mon, 24 Nov 2008 11:03:31 -0800 (PST)
From: Xah Lee <xahlee@gmail.com>
Subject: Re: comp.lang.* newsgroups seems dying
Message-Id: <87249c4e-bf90-4aaa-a2ae-7feae3157bdf@a29g2000pra.googlegroups.com>
On Nov 24, 8:59 am, Don Geddis <d...@geddis.org> wrote:
> Xah Lee <xah...@gmail.com> wrote on Mon, 24 Nov 2008:
>
> > i think at least 25% of posts to comp.lang.lisp are spams this year.
>
> I agree with you completely.
>
> For example, there's this guy, Xah Lee, who posts all the time to c.l.l, =
and
> pretty much every one of his posts is spam. He probably makes that 25%
> number all by himself.
>
> Do you have any advice for how we can get rid of that guy?
Guys, look at this Don moron.
In the current week, we see in comp.lang.lisp these posts:
=E2=80=A2 FAST & EASY - ::: INSURANCE ::: allstate insurance
=E2=80=A2 Go to www.prettyreplica.com buy replica watches will get discount
this Christmas!
=E2=80=A2 Auto Insurance Center - Auto Insurance Quote
=E2=80=A2 okcupid tests - Free Online Dating
=E2=80=A2 okcupid login - Free Online Dating
=E2=80=A2 www okcupid com - Free Online Dating
=E2=80=A2 african american singles - Free Online Dating
=E2=80=A2 www myukdate com - Free Online Dating
=E2=80=A2 plentyoffish uk - Free Online Dating
=E2=80=A2 Chase credit cards HERE ALL
=E2=80=A2 COMPUTER FOR PEOPLE USE
=E2=80=A2 Juhla-Asu ei vastaa asujensa vioista ellei asiakas niit=C3=A4 enn=
en
vuokrtaamista huomaa
=E2=80=A2 HELP DESK
=E2=80=A2 STOCK TRADE
Check it out google group yourself: http://groups.google.com/group/comp.lan=
g.lisp/
this Don moron have any sense of responsibility? Is he pretenting he
doesn't understand what's spam? Does he care?
This post is posted to: comp.lang.lisp, comp.lang.scheme,
comp.lang.functional, comp.lang.perl.misc .
Xah
=E2=88=91 http://xahlee.org/
=E2=98=84
------------------------------
Date: Mon, 24 Nov 2008 08:43:52 -0500
From: Charlton Wilbur <cwilbur@chromatico.net>
Subject: Re: How to iterator array in order?
Message-Id: <86zljpdysn.fsf@mithril.chromatico.net>
>>>>> "J" == Jürgen Exner <jurgenex@hotmail.com> writes:
J> I guess it was pretty obvious what I meant. If you want to make a
J> big deal out of that typo, then be my guest.
But the fact that an experienced, knowledgeable Perl programmer can so
easily typo that is a sign that it's a dangerous construct to use.
Charlton
--
Charlton Wilbur
cwilbur@chromatico.net
------------------------------
Date: Mon, 24 Nov 2008 09:35:07 -0600
From: Ted Zlatanov <tzz@lifelogs.com>
Subject: Re: How to iterator array in order?
Message-Id: <86skpht9w4.fsf@lifelogs.com>
On Sun, 23 Nov 2008 18:03:14 -0800 Jürgen Exner <jurgenex@hotmail.com> wrote:
JE> "John W. Krahn" <someone@example.com> wrote:
>> Jürgen Exner wrote:
>>> "Peter J. Holzer" <hjp-usenet2@hjp.at> wrote:
>>>> On 2008-11-21 05:30, Jürgen Exner <jurgenex@hotmail.com> wrote:
>>>> for my $i (0 .. $#array) { ... }
>>>
>>> Why not
>>
>> Why not indeed!
>>
>>> for my $i (0 .. @array+1)
>>> Doesn't seem to introduce much clutter to me...
>>
>> Just errors. :(
JE> Well, yeah, fine, whatever.
JE> s/+/-/
JE> I guess it was pretty obvious what I meant. If you want to make a big
JE> deal out of that typo, then be my guest.
The typo's existence is relevant, though: if you, an experienced
programmer, made it, surely beginners will do it too. IMO array offsets
should be a last resort, and very few algorithms need them. I usually
get by with iterating through the list elements, which generates cleaner
code in the vast majority of the cases (and sometimes even improves the
algorithm because it forces me to think differently about it).
Array offsets and memory management are the naughty bits of
programming. They should be covered up in public whenever possible :)
Ted
------------------------------
Date: Mon, 24 Nov 2008 08:11:46 -0800
From: Jürgen Exner <jurgenex@hotmail.com>
Subject: Re: How to iterator array in order?
Message-Id: <p8kli4pip2etri996iq24g67mr64ln8h6u@4ax.com>
Ted Zlatanov <tzz@lifelogs.com> wrote:
>IMO array offsets
>should be a last resort, and very few algorithms need them. I usually
>get by with iterating through the list elements, which generates cleaner
>code in the vast majority of the cases (and sometimes even improves the
>algorithm because it forces me to think differently about it).
I very strongly agree.
However for that instance the question was what to use if you do need
the indices after all, e.g. to loop through multiple lists in sync or
access multiple elements in each iteration.
jue
------------------------------
Date: Mon, 24 Nov 2008 10:59:52 -0600
From: Ted Zlatanov <tzz@lifelogs.com>
Subject: Re: How to iterator array in order?
Message-Id: <86fxlht5yv.fsf@lifelogs.com>
On Mon, 24 Nov 2008 08:11:46 -0800 Jürgen Exner <jurgenex@hotmail.com> wrote:
JE> Ted Zlatanov <tzz@lifelogs.com> wrote:
>> IMO array offsets
>> should be a last resort, and very few algorithms need them. I usually
>> get by with iterating through the list elements, which generates cleaner
>> code in the vast majority of the cases (and sometimes even improves the
>> algorithm because it forces me to think differently about it).
JE> I very strongly agree.
JE> However for that instance the question was what to use if you do need
JE> the indices after all, e.g. to loop through multiple lists in sync or
JE> access multiple elements in each iteration.
I know, I just couldn't resist a chance to say "naughty bits" in a
technical context ;)
Ted
------------------------------
Date: Mon, 24 Nov 2008 10:45:21 -0800 (PST)
From: "friend.05@gmail.com" <hirenshah.05@gmail.com>
Subject: IP address - longest prefix match
Message-Id: <49f222b4-aa6d-4ead-8e90-3eb88929a9a6@q9g2000yqc.googlegroups.com>
Suppose I have C_IP address : 12.120.29.25
and I have list of following IP addresses :
212.120.128.0|19;
12.120.0.0|15;
12.120.16.0|20;
12.120.72.0|22;
12.120.96.0|20;
12.120.40.0|21;
12.120.0.0|21;
12.120.192.0|19;
12.120.16.0|22;
12.120.36.0|22;
12.120.80.0|20;
194.212.120.0|21;
212.120.32.0|19;
212.120.64.0|18;
212.120.192.0|19;
213.3.12.120|29;
116.212.120.0|24;
12.120.24.0|21;
Now I need to map C_IP to list with longest prefix match. (As u can
there are many IP address with 12.120. but I need to map to one with
longest prefix match)
------------------------------
Date: Mon, 24 Nov 2008 08:02:46 -0800 (PST)
From: "friend.05@gmail.com" <hirenshah.05@gmail.com>
Subject: longest prefix match
Message-Id: <6169141e-a3ce-4fb7-b9bb-917029c529c2@q9g2000yqc.googlegroups.com>
I have table of ip adress with prefix.
Now I need to match IP address with corresponding IP with longest
prefix.
I am not sure how can I do that.
------------------------------
Date: Mon, 24 Nov 2008 08:30:14 -0800
From: Jürgen Exner <jurgenex@hotmail.com>
Subject: Re: longest prefix match
Message-Id: <eokli4dfkcr52v5st67k93evvco9koeef4@4ax.com>
"friend.05@gmail.com" <hirenshah.05@gmail.com> wrote:
>I have table of ip adress with prefix.
'table' is not a standard Perl data structure. How is that 'table'
implemented?
>Now I need to match IP address with corresponding IP with longest
>prefix.
No idea what an IP prefix is, either, but assuming you are talking about
a list of strings then a pragmatic approach would be:
grep() all list elements, where the IP part is eq to the wanted IP, then
sort() the result by length() and pick the last element.
However If the list is large and performance an issue, then you can
write a simple loop to find the wanted item in one single pass. Just
loop through the list and keep a "best candidate", which is updated
every time you find a better candidate.
for (@IPswithPrefix) {
if (IPsMatch() and length($_) > length($candidate)) {
$candidate = $_;
}
}
print $candidate;
jue
------------------------------
Date: Mon, 24 Nov 2008 08:46:53 -0800 (PST)
From: "friend.05@gmail.com" <hirenshah.05@gmail.com>
Subject: Re: longest prefix match
Message-Id: <3a6be1f0-1bf0-49a3-9093-1b79100cf746@h20g2000yqn.googlegroups.com>
On Nov 24, 11:30=A0am, J=FCrgen Exner <jurge...@hotmail.com> wrote:
> "friend...@gmail.com" <hirenshah...@gmail.com> wrote:
> >I have table of ip adress with prefix.
>
> 'table' is not a standard Perl data structure. How is that 'table'
> implemented?
>
> >Now I need to match IP address with corresponding IP with longest
> >prefix.
>
> No idea what an IP prefix is, either, but assuming you are talking about
> a list of strings then a pragmatic approach would be:
>
> grep() all list elements, where the IP part is eq to the wanted IP, then
> sort() the result by length() and pick the last element.
>
> However If the list is large and performance an issue, then you can
> write a simple loop to find the wanted item in one single pass. Just
> loop through the list and keep a "best candidate", which is updated
> every time you find a better candidate.
>
> for (@IPswithPrefix) {
> =A0 =A0 =A0 =A0 if (IPsMatch() and length($_) > length($candidate)) {
> =A0 =A0 =A0 =A0 =A0 =A0 =A0 =A0 $candidate =3D $_;
> =A0 =A0 =A0 =A0 }}
>
> print $candidate;
>
> jue
Suppose I have C_IP address : 12.120.29.25
and I have list of following IP addresses :
212.120.128.0|19;
12.120.0.0|15;
12.120.16.0|20;
12.120.72.0|22;
12.120.96.0|20;
12.120.40.0|21;
12.120.0.0|21;
12.120.192.0|19;
12.120.16.0|22;
12.120.36.0|22;
12.120.80.0|20;
194.212.120.0|21;
212.120.32.0|19;
212.120.64.0|18;
212.120.192.0|19;
213.3.12.120|29;
116.212.120.0|24;
12.120.24.0|21;
Now I need to map C_IP to list with longest prefix match. (As u can
there are many IP address with 12.120. but I need to map to one with
longest prefix match)
------------------------------
Date: Mon, 24 Nov 2008 11:05:47 -0600
From: Ted Zlatanov <tzz@lifelogs.com>
Subject: Re: longest prefix match
Message-Id: <86bpw5t5p0.fsf@lifelogs.com>
On Mon, 24 Nov 2008 08:46:53 -0800 (PST) "friend.05@gmail.com" <hirenshah.05@gmail.com> wrote:
f> Suppose I have C_IP address : 12.120.29.25
f> and I have list of following IP addresses :
f> 212.120.128.0|19;
f> 12.120.0.0|15;
f> 12.120.16.0|20;
f> 12.120.72.0|22;
f> 12.120.96.0|20;
f> 12.120.40.0|21;
f> 12.120.0.0|21;
f> 12.120.192.0|19;
f> 12.120.16.0|22;
f> 12.120.36.0|22;
f> 12.120.80.0|20;
f> 194.212.120.0|21;
f> 212.120.32.0|19;
f> 212.120.64.0|18;
f> 212.120.192.0|19;
f> 213.3.12.120|29;
f> 116.212.120.0|24;
f> 12.120.24.0|21;
f> Now I need to map C_IP to list with longest prefix match. (As u can
f> there are many IP address with 12.120. but I need to map to one with
f> longest prefix match)
Look at Net::Netmask and the match() method in particular; just iterate
through the list above in order from largest prefix to smallest and
return when there's a match.
Ted
------------------------------
Date: Mon, 24 Nov 2008 10:23:34 -0800 (PST)
From: "friend.05@gmail.com" <hirenshah.05@gmail.com>
Subject: Re: longest prefix match
Message-Id: <66d6a854-7cc1-4bb5-8509-1edaa35c1be9@j32g2000yqn.googlegroups.com>
On Nov 24, 12:05=A0pm, Ted Zlatanov <t...@lifelogs.com> wrote:
> On Mon, 24 Nov 2008 08:46:53 -0800 (PST) "friend...@gmail.com" <hirenshah=
...@gmail.com> wrote:
>
> f> Suppose I have C_IP address : 12.120.29.25
>
> f> and I have list of following IP addresses :
> f> =A0212.120.128.0|19;
> f> =A012.120.0.0|15;
> f> =A012.120.16.0|20;
> f> =A012.120.72.0|22;
> f> =A012.120.96.0|20;
> f> =A012.120.40.0|21;
> f> =A012.120.0.0|21;
> f> =A012.120.192.0|19;
> f> =A012.120.16.0|22;
> f> =A012.120.36.0|22;
> f> =A012.120.80.0|20;
> f> =A0194.212.120.0|21;
> f> =A0212.120.32.0|19;
> f> =A0212.120.64.0|18;
> f> =A0212.120.192.0|19;
> f> =A0213.3.12.120|29;
> f> =A0116.212.120.0|24;
> f> =A012.120.24.0|21;
>
> f> Now I need to map C_IP to list with longest prefix match. (As u can
> f> there are many IP address with 12.120. but I need to map to one with
> f> longest prefix match)
>
> Look at Net::Netmask and the match() method in particular; just iterate
> through the list above in order from largest prefix to smallest and
> return when there's a match.
>
> Ted
I am little confuse with largest prefix to smallest.
Example:
12.120.16.0|20;
12.120.96.0|20;
12.120.40.0|21;
12.120.72.0|22;
12.120.16.0|22;
In above list what will be order of largest prefix to smallest.
And is there any tutorial with exmple where can I see steps to use
Net::Netmask
------------------------------
Date: Mon, 24 Nov 2008 05:42:22 GMT
From: merlyn@stonehenge.com (Randal Schwartz)
Subject: new CPAN modules on Mon Nov 24 2008
Message-Id: <KAtp6M.2459@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.
Abstract-Meta-Class-0.13
http://search.cpan.org/~adrianwit/Abstract-Meta-Class-0.13/
Simple meta object protocol implementation.
----
Catalyst-Authentication-Store-DBI-0.01
http://search.cpan.org/~janus/Catalyst-Authentication-Store-DBI-0.01/
Storage class for Catalyst Authentication using DBI
----
DB-CouchDB-Schema-0.3.03
http://search.cpan.org/~zaphar/DB-CouchDB-Schema-0.3.03/
A Schema driven CouchDB module
----
DBIx-Connection-0.09
http://search.cpan.org/~adrianwit/DBIx-Connection-0.09/
Simple database interface.
----
DBIx-Tree-MaterializedPath-v0.04
http://search.cpan.org/~larryl/DBIx-Tree-MaterializedPath-v0.04/
fast DBI queries and updates on "materialized path" trees
----
DNS-WorldWideDns-0.0101
http://search.cpan.org/~rizen/DNS-WorldWideDns-0.0101/
An interface to the worldwidedns.net service.
----
Devel-PerlySense-0.0165
http://search.cpan.org/~johanl/Devel-PerlySense-0.0165/
Perl IDE backend with Emacs frontend
----
FCGI-ProcManager-MaxRequests-0.02
http://search.cpan.org/~vovkasm/FCGI-ProcManager-MaxRequests-0.02/
restrict max number of requests by each child
----
Graphics-SANE-0.02
http://search.cpan.org/~pfaut/Graphics-SANE-0.02/
Perl extension for the Sane scanner access library.
----
HTTP-Server-Simple-0.36
http://search.cpan.org/~alexmv/HTTP-Server-Simple-0.36/
Lightweight HTTP server
----
IO-Lambda-0.42
http://search.cpan.org/~karasik/IO-Lambda-0.42/
non-blocking I/O in lambda style
----
LaTeX-Table-0.9.10
http://search.cpan.org/~limaone/LaTeX-Table-0.9.10/
Perl extension for the automatic generation of LaTeX tables.
----
Lingua-JA-Categorize-0.00001
http://search.cpan.org/~miki/Lingua-JA-Categorize-0.00001/
a Naive Bayes Classifier for Japanese document.
----
MojoMojo-0.999023
http://search.cpan.org/~mramberg/MojoMojo-0.999023/
A Catalyst & DBIx::Class powered Wiki.
----
Monotone-AutomateStdio-0.1
http://search.cpan.org/~aecooper/Monotone-AutomateStdio-0.1/
Perl interface to Monotone via automate stdio
----
Net-IMAP-Server-1.07
http://search.cpan.org/~alexmv/Net-IMAP-Server-1.07/
A single-threaded multiplexing IMAP server implementation, using Net::Server::Coro.
----
NetHack-FOV-0.01
http://search.cpan.org/~sorear/NetHack-FOV-0.01/
NetHack compatible field of view
----
Padre-0.18
http://search.cpan.org/~szabgab/Padre-0.18/
Perl Application Development and Refactoring Environment
----
Padre-Plugin-AcmePlayCode-0.05
http://search.cpan.org/~fayland/Padre-Plugin-AcmePlayCode-0.05/
Acme::PlayCode Plugin for Padre
----
Padre-Plugin-CPAN-0.05
http://search.cpan.org/~fayland/Padre-Plugin-CPAN-0.05/
CPAN in Padre
----
Padre-Plugin-CommandLine-0.02
http://search.cpan.org/~szabgab/Padre-Plugin-CommandLine-0.02/
vi and emacs in Padre ?
----
Padre-Plugin-Encrypt-0.03
http://search.cpan.org/~fayland/Padre-Plugin-Encrypt-0.03/
encrypt/decrypt file in Padre
----
Padre-Plugin-HTML-Export-0.03
http://search.cpan.org/~fayland/Padre-Plugin-HTML-Export-0.03/
export highlighted HTML in Padre
----
Padre-Plugin-Tidy-0.02
http://search.cpan.org/~fayland/Padre-Plugin-Tidy-0.02/
tidy html/xml in Padre
----
Padre-Plugin-Validator-0.04
http://search.cpan.org/~fayland/Padre-Plugin-Validator-0.04/
validate HTML/CSS in Padre
----
Padre-Plugin-ViewInBrowser-0.04
http://search.cpan.org/~fayland/Padre-Plugin-ViewInBrowser-0.04/
view selected doc in browser for Padre
----
Parse-Gnaw-0.25
http://search.cpan.org/~gslondon/Parse-Gnaw-0.25/
Define a grammar and create a parser by calling nothing but perl subroutines.
----
RT-Extension-MergeUsers-0.03_01
http://search.cpan.org/~falcone/RT-Extension-MergeUsers-0.03_01/
----
String-BufferStack-1.01
http://search.cpan.org/~alexmv/String-BufferStack-1.01/
Nested buffers for templating systems
----
String-BufferStack-1.02
http://search.cpan.org/~alexmv/String-BufferStack-1.02/
Nested buffers for templating systems
----
String-BufferStack-1.03
http://search.cpan.org/~alexmv/String-BufferStack-1.03/
Nested buffers for templating systems
----
Test-DBUnit-0.14
http://search.cpan.org/~adrianwit/Test-DBUnit-0.14/
Database test framework.
----
Text-RewriteRules-0.15
http://search.cpan.org/~ambs/Text-RewriteRules-0.15/
A system to rewrite text using regexp-based rules
----
WWW-Wikipedia-TemplateFiller-0.08
http://search.cpan.org/~diberri/WWW-Wikipedia-TemplateFiller-0.08/
Fill Wikipedia templates with your eyes closed
----
Wx-Perl-Dialog-0.03
http://search.cpan.org/~szabgab/Wx-Perl-Dialog-0.03/
Abstract dialog class for simple dialog creation
----
XML-Atom-0.32
http://search.cpan.org/~miyagawa/XML-Atom-0.32/
Atom feed and API implementation
----
XML-Feed-0.40
http://search.cpan.org/~simonw/XML-Feed-0.40/
Syndication feed parser and auto-discovery
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: Mon, 24 Nov 2008 07:32:58 -0800 (PST)
From: DaLoverhino <DaLoveRhino@hotmail.com>
Subject: Reference Question.
Message-Id: <ac018db4-cb21-430f-8d49-29359aa0e88e@f13g2000yqj.googlegroups.com>
I'm reading about perl references in a book called "Beginning Perl" by
James Lee. I read ahead to the use of ->, and [], but I'm tripped up
on the simpler examples prior to the use of ->, [], so I don't have
much confidence in what I have read.
Anyways the book has the following example:
$ref = [ 1, 2, [ 10, 20 ] ] ;
To access 20, you can do it a number of ways:
$inside = ${$ref}[2];
$element = ${$inside}[1];
Or the following way:
Book Example> $element = ${${ref}[2]}[1];
Well, I tried the latter way, and doesn't work. So I tried this
instead:
First Try> ${${$ref}[2]}[1];
This works. But I'm wondering why?
If you have a array_ref, you access an element by doing this:
Basic Example> ${$array_ref}[0];
So if ${$array_ref}[5] is itself an array reference, if I want to
access one of it's elements, why does the First T ry work? And why
does this one fail:
${$ ${$array_ref}[0] }[5]
^^^^^^^^^^^^^^^^^ --- The reference
^^^ ^^^ -- What you do to
access elements of an array
reference.
So I put some spaces to show you I took the reference "${$array_ref}
[0]" and applied
Basic Example> to it.
thanks.
------------------------------
Date: 24 Nov 2008 17:46:36 GMT
From: xhoster@gmail.com
Subject: Re: Reference Question.
Message-Id: <20081124124548.174$pc@newsreader.com>
DaLoverhino <DaLoveRhino@hotmail.com> wrote:
> I'm reading about perl references in a book called "Beginning Perl" by
> James Lee. I read ahead to the use of ->, and [], but I'm tripped up
> on the simpler examples prior to the use of ->, [], so I don't have
> much confidence in what I have read.
>
> Anyways the book has the following example:
>
> $ref = [ 1, 2, [ 10, 20 ] ] ;
>
> To access 20, you can do it a number of ways:
>
> $inside = ${$ref}[2];
> $element = ${$inside}[1];
>
> Or the following way:
>
> Book Example> $element = ${${ref}[2]}[1];
>
> Well, I tried the latter way, and doesn't work.
Right. The inner part is the same as $ref[2] (I got a warning to that
affect, because I turned on warnings), which is trying to access an element
of the undeclared variable @ref (I got an error to that effect, because
I turned on strict).
So this is a typo, which you have corrected below.
> So I tried this
> instead:
>
> First Try> ${${$ref}[2]}[1];
>
> This works. But I'm wondering why?
Um, because that is how Perl works. I'm not sure what kind
of answer you are looking for.
>
> If you have a array_ref, you access an element by doing this:
>
> Basic Example> ${$array_ref}[0];
Why are you changing both the name of the variable, and the relevant
indices, in the middle of an example? What can this do other than
cause confusion?
> So if ${$array_ref}[5] is itself an array reference, if I want to
> access one of it's elements, why does the First T ry work? And why
> does this one fail:
>
> ${$ ${$array_ref}[0] }[5]
> ^^^^^^^^^^^^^^^^^ --- The reference
> ^^^ ^^^ -- What you do to
> access elements of an array
Strip off the ${...}[5] and you get
$${$array_ref}[0], which is the same as
${${$array_ref}[0]}
As you say, ${$array_ref}[0] is itself an array ref, so, lets call it
$array_ref2, yielding:
${$array_ref2}
So the extra $ is trying to dereference that inner array ref, but is trying
to do so as if it were a reference to a scalar rather than to an array.
Yielding the error "Not a SCALAR reference". If you just delete it, then
the array ref (called $array_ref2) falls into the hands of the earlier
stripped away construct, ${...}[5], which dereferences it like the array
ref it is, and all is well.
All this tedium is a very good reason to use -> instead whenever possible.
Xho
--
-------------------- http://NewsReader.Com/ --------------------
The costs of publication of this article were defrayed in part by the
payment of page charges. This article must therefore be hereby marked
advertisement in accordance with 18 U.S.C. Section 1734 solely to indicate
this fact.
------------------------------
Date: Mon, 24 Nov 2008 08:17:05 -0800 (PST)
From: marc <nordnewyorker@gmail.com>
Subject: regexp modrewrite
Message-Id: <011096f4-3c6b-4062-ac41-33597f7cf9b0@f20g2000yqg.googlegroups.com>
Hi,
Im trying to use modrewrite and apply it to any address of the format:
domain.com/whatever
but not applicable to:
domain.com/whatever.something
or
domain.com/whatever/something/
What is the correct regexp for this pls, Im currently using /([^/]+)
and that grabs everything after the /
Thanks!
M
------------------------------
Date: Mon, 24 Nov 2008 08:54:24 -0800
From: Jürgen Exner <jurgenex@hotmail.com>
Subject: Re: regexp modrewrite
Message-Id: <rqlli4tkhjef9n1q796e16olmla629vqlt@4ax.com>
marc <nordnewyorker@gmail.com> wrote:
>Im trying to use modrewrite and apply it to any address of the format:
modrewrite? Excuse my ignorance, but I've never heard of it.
>domain.com/whatever
>
>but not applicable to:
>
>domain.com/whatever.something
>or
>domain.com/whatever/something/
>
>What is the correct regexp for this pls, Im currently using /([^/]+)
>and that grabs everything after the /
Why not
(undef, $tail) = split (/\//, $URL, 2);
$tail now contains everything after the first slash.
jue
------------------------------
Date: Mon, 24 Nov 2008 09:22:17 -0800
From: Tim Greer <tim@burlyhost.com>
Subject: Re: regexp modrewrite
Message-Id: <dpBWk.6209$jV1.6075@newsfe13.iad>
marc wrote:
> Hi,
>
> Im trying to use modrewrite and apply it to any address of the format:
>
> domain.com/whatever
>
> but not applicable to:
>
> domain.com/whatever.something
> or
> domain.com/whatever/something/
>
> What is the correct regexp for this pls, Im currently using /([^/]+)
> and that grabs everything after the /
>
> Thanks!
> M
This is better asked in alt.apache.configuration. Anyway, the ([^/]+)
will indeed grab one or more character that's not a /, but you didn't
also add . to the char class. Also, /([^/]+) doesn't seem to show how
far that match goes. Is it /([^/]+)$ (ending the string $) or
something else?
--
Tim Greer, CEO/Founder/CTO, BurlyHost.com, Inc.
Shared Hosting, Reseller Hosting, Dedicated & Semi-Dedicated servers
and Custom Hosting. 24/7 support, 30 day guarantee, secure servers.
Industry's most experienced staff! -- Web Hosting With Muscle!
------------------------------
Date: Mon, 24 Nov 2008 02:27:38 +0100
From: "Petr Vileta \(fidokomik\)" <stoupa@practisoft.cz>
Subject: Re: regular expression to detect dos filenames
Message-Id: <ggd0e6$pol$1@ns.felk.cvut.cz>
Joe Smith wrote:
> Petr Vileta (fidokomik) wrote:
>
>> m/^[^\\\*\?\<\>\/\:\"\|\.]{0,8}(\.[^\\\*\?\<\>\/\:\"\|\.]{1,3})*$/)
>
> That regexp excludes 'FILENAME.' and includes 'FILENAME.FOO.BAR.EXE'.
>
> Change {0,8} to {1,8} and end with: {0,3})?$
"FILENAME." is not regular DOS name. Regular name is without dot at end.
--
Petr Vileta, Czech republic
(My server rejects all messages from Yahoo and Hotmail.
Send me your mail from another non-spammer site please.)
Please reply to <petr AT practisoft DOT cz>
------------------------------
Date: 24 Nov 2008 16:55:36 GMT
From: Glenn Jackman <glennj@ncf.ca>
Subject: Re: Restarting a Program mid stream
Message-Id: <slrngiln49.l22.glennj@smeagol.ncf.ca>
At 2008-11-23 01:44AM, "pgodfrin" wrote:
> In this case your first guess was correct. I want a dispatch table so
> I can pass a step name from the command line for restart. Now I need
> to figure out how to make a dispatch table :)
Google is your friend: perl dispatch table
My top result: http://www.perlmonks.org/?node_id=456530
"Implementing Dispatch Tables" from perlmonks.org
--
Glenn Jackman
Write a wise saying and your name will live forever. -- Anonymous
------------------------------
Date: Mon, 24 Nov 2008 09:39:27 -0600
From: Ted Zlatanov <tzz@lifelogs.com>
Subject: Re: sleep(30) hangs
Message-Id: <86od05t9ow.fsf@lifelogs.com>
On Sun, 23 Nov 2008 11:10:06 +0100 "Peter J. Holzer" <hjp-usenet2@hjp.at> wrote:
PJH> On 2008-11-19 20:31, Ted Zlatanov <tzz@lifelogs.com> wrote:
>> On Tue, 18 Nov 2008 08:01:00 -0800 (PST) marathoner@sina.com wrote:
PJH> [with activestate perl on Windows 2000]
m> I have a programs that checks emails via IMAP and then sleeps for 30
m> seconds. Occasionally, it hangs on the line where it calls sleep(30).
>> ...
m> print "Done. See you in 30 seconds.\n\n\n";
m> sleep(30); # <-- this is where it hangs sometimes
>>
>> sleep() may be interfering with other signal handlers. Try
>> system(sleep => 30) instead to run it as a shell command; does that make
>> a difference?
PJH> Does Windows 2000 have a sleep command? Windows 2003 doesn't:
PJH> | Microsoft Windows [Version 5.2.3790]
PJH> | (C) Copyright 1985-2003 Microsoft Corp.
PJH> |
PJH> | C:\Dokumente und Einstellungen\hjp>sleep 30
PJH> | Der Befehl "sleep" ist entweder falsch geschrieben oder
PJH> | konnte nicht gefunden werden.
PJH> Translation: The command "sleep" is either misspelled or could not be
PJH> found.
Sorry, I didn't realize this was a Windows setup. A Perl one-liner
would probably do it: system perl => -e => "sleep 30" (untested). I
don't know how sleep() works in Windows, so my suggestions may be
completely useless, but it's worth trying the simple stuff first before
doing in-depth debugging :)
Ted
------------------------------
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 2001
***************************************
