Michael Pobega wrote:
> I'm using the Daemon::Easy module to write a basic Perl daemon, but I'm
> wondering if there is a way to stop the daemon from within the script (as
> opposed to running "./script.pl stop")? Currently I have a subroutine to do
> this, but it doesn't seem to cleanly erase the
I'm using the Daemon::Easy module to write a basic Perl daemon, but I'm
wondering if there is a way to stop the daemon from within the script (as
opposed to running "./script.pl stop")? Currently I have a subroutine to do
this, but it doesn't seem to cleanly erase the pid file.
> &killMe {
>
Hi all,
Although I've read the docs and have been practising with it, I'm a bit
confused on the use of eval().
For some reason, it took a few swings of the hammer to get past wanting
to look for array elements within $@ :P
I think I now understand the dangers of using eval() to trap errors,
whic
On 10/14/09 Wed Oct 14, 2009 3:38 PM, "Felix Dorner"
scribbled:
> Hi,
>
> I did the best book purchase in years: The Perl Cookbook. They have an
> example that seems to come right from Larry Wall himself. And I don't
> get it. I can use it but I don't understand why it works with wildcards.
>
felix_do wrote:
> I did the best book purchase in years: The Perl Cookbook. They have
> an example that seems to come right from Larry Wall himself. And I
> don't get it. I can use it but I don't understand why it works with
> wildcards.
> $op = shift or die "Usage: rename expr [files]\n"; chomp (@
Felix Dorner wrote:
> Hi,
>
> I did the best book purchase in years: The Perl Cookbook. They have an
> example that seems to come right from Larry Wall himself. And I don't
> get it. I can use it but I don't understand why it works with wildcards.
>
> $op = shift or die "Usage: rename expr [files
Hi,
I did the best book purchase in years: The Perl Cookbook. They have an
example that seems to come right from Larry Wall himself. And I don't
get it. I can use it but I don't understand why it works with wildcards.
$op = shift or die "Usage: rename expr [files]\n";
chomp (@ARGV = ) unless
From: Shawn H Corey
> Jenda Krynicky wrote:
> > ST is an overkill if the extraction is simple.
> >
> > Especially if the number of items is fairly small.
> >
> > Actually if the extraction is really simple and the extracted key is
> > not so small, than ST may perform worse than an ordinary so
>-Original Message-
>From: Rick Triplett [mailto:r...@reason.net]
>Sent: Tuesday, October 13, 2009 12:09 PM
>To: Perl Beginners
>Subject: Sorting mixed alphanumerics
>
>I need to sort the keys in a hash. The keys are the question number
>and the values are the student's answer. A numeric s
> "FJ" == Fisher, John writes:
FJ> It throws out this message like this and stops -
FJ> "panic: sv_setpvn called with negative strlen at
encrypt_ssn_2_live_STDIN_or_INFILE.pl line 108, line 1249."
FJ> #!/usr/bin/perl -w
FJ> use Crypt::GCrypt;
a meta comment. this isn't what
> "SHC" == Shawn H Corey writes:
SHC> Jenda Krynicky wrote:
>> ST is an overkill if the extraction is simple.
>>
>> Especially if the number of items is fairly small.
>>
>> Actually if the extraction is really simple and the extracted key is
>> not so small, than ST may perf
I have written a Perl script which I have used for years to decrypt at the
field level in a file. Occasionally I get a problem file.
It throws out this message like this and stops -
"panic: sv_setpvn called with negative strlen at
encrypt_ssn_2_live_STDIN_or_INFILE.pl line 108, line 1249.
Jenda Krynicky wrote:
> ST is an overkill if the extraction is simple.
>
> Especially if the number of items is fairly small.
>
> Actually if the extraction is really simple and the extracted key is
> not so small, than ST may perform worse than an ordinary sort doing
> the extraction within t
Date sent: Wed, 14 Oct 2009 11:03:13 -0400
From: Shawn H Corey
To: Rick Triplett
Copies to: Perl Beginners
Subject:Re: Sorting mixed alphanumerics
> Rick Triplett wrote:
> > I need to sort the keys in a hash. The ke
On Tue, Oct 13, 2009 at 11:09:09AM -0500, Rick Triplett wrote:
> I need to sort the keys in a hash. The keys are the question number and
> the values are the student's answer. A numeric sort with <=> won't work
> since retaking a missed question (say, 2) produces the new key, 2h with
> its new a
Rick Triplett wrote:
> I need to sort the keys in a hash. The keys are the question number and
> the values are the student's answer. A numeric sort with <=> won't work
> since retaking a missed question (say, 2) produces the new key, 2h with
> its new answer. A representative hash might look like
I need to sort the keys in a hash. The keys are the question number
and the values are the student's answer. A numeric sort with <=> won't
work since retaking a missed question (say, 2) produces the new key,
2h with its new answer. A representative hash might look like this
1 => b
2h => c
3
17 matches
Mail list logo
