Hello
I have a script that, much like the Little Old Lady who lived in a shoe,
has so many children it's not sure what to do.
Basically, the script does some stuff, then kicks off multiple copies of
an external process that all run in parallel. It then has to wait until
all of them have
Taylor, Andrew (ASPIRE) wrote:
Hello
I have a script that, much like the Little Old Lady who lived in a shoe,
has so many children it's not sure what to do.
Basically, the script does some stuff, then kicks off multiple copies of
an external process that all run in parallel. It then has
Hello All,
This is my first post here.
I am executing a Perl script which makes use of 'DBI' module.
I am performing a select operation on a table through the Perl script and I
am getting following error on the console:
DBD::ODBC::st execute failed: [Oracle][ODBC][Ora]ORA-00942: table or view
2009/11/9 Parag Kalra paragka...@gmail.com:
Hello All,
Hello,
This is my first post here.
Are you sure about that? I have a vague recollection of a question you
asked about Optimizing File handling operations then of course there
was the My name is Larry Wall for which I apologise :)
I am
Hi,
I am completely stumped with how to proceed with this.
I have a program where the user inputs a path to a file. This is under
windows xp
The path can be relative
..\..\..\synthesis\int_code.psm
.\program\synthesis\int_code.psm
or absolute
c:\command\tool\program\synthesis\int_code.psm
I do
On Mon, Nov 9, 2009 at 10:25 AM, axr0284 axr0...@yahoo.com wrote:
Hi,
I am completely stumped with how to proceed with this.
I have a program where the user inputs a path to a file. This is under
windows xp
The path can be relative
..\..\..\synthesis\int_code.psm
Hello,
I am wondering on some metacharacters in regular expressions.
According to Wall et al. (2000, p. 158), there are 12 metacharacters:
* + ? . \ | ( ) [ { ^ $
On the other hand, the Perl regular expressions quick start (http://perldoc.perl.org/perlrequick.html
) cites 14 metacharacters:
Hi,
i'm planning to sort an input file (which was File::Slurp'ed, most likely
megabyte-sized file) in various ways. I did some readings and learned several
methods
that people have come up with in recent years. So to summarize, the default
sort is fast (uses quick sort), explicit (using sub)
Hi,
Please help me to split a string as follows..
my $line = abcdefghijkl
the expected output should be like:
ab
ef
ij
The logic is like alternate 2 characters should be removed
--
To unsubscribe, e-mail: beginners-unsubscr...@perl.org
For additional commands, e-mail:
my $kid = waitpid($child_pid, 0);
redo if $kid != $child_pid; # So goes back to start of loop from
here
unless( 0==$? ) # And never performs this test
{
die (Oh No! An external process has failed!!\n);
}
}
That makes most sense to me but I'm not sure how to test
MA == Michael Alipio daem0n...@yahoo.com writes:
MA i'm planning to sort an input file (which was File::Slurp'ed, most
MA likely megabyte-sized file) in various ways. I did some readings
MA and learned several methods that people have come up with in
MA recent years. So to summarize, the
2009/11/9 Michael Alipio daem0n...@yahoo.com:
Hi,
i'm planning to sort an input file (which was File::Slurp'ed, most likely
megabyte-sized file) in various ways. I did some readings and learned several
methods
that people have come up with in recent years. So to summarize, the default
PN == Pierre Nugues pierre.nug...@cs.lth.se writes:
PN I am wondering on some metacharacters in regular expressions.
PN According to Wall et al. (2000, p. 158), there are 12 metacharacters:
PN * + ? . \ | ( ) [ { ^ $
PN On the other hand, the Perl regular expressions quick start
PN
On 11/9/09 Mon Nov 9, 2009 5:03 AM, rithu sundh...@gmail.com
scribbled:
Hi,
Please help me to split a string as follows..
my $line = abcdefghijkl
the expected output should be like:
ab
ef
ij
The logic is like alternate 2 characters should be removed
split would not be
On Mon, Nov 9, 2009 at 7:03 AM, rithu sundh...@gmail.com wrote:
Please help me to split a string as follows..
my $line = abcdefghijkl
the expected output should be like:
ab
ef
ij
The logic is like alternate 2 characters should be removed
Will a for loop work for your needs? The
Taylor, Andrew (ASPIRE) wrote:
OK, I'm clearly being dense here then. My understanding was that the
$? contained the status of the pid returned by waidpid.
If waitpid returned a pid from some other process (i.e. not one of my
children) that had failed (i.e return status other than 0) then
Thanks to All..
It did the trick for me -
http://search.cpan.org/~timb/DBI/DBI.pm#$DBI::errstrhttp://search.cpan.org/%7Etimb/DBI/DBI.pm#$DBI::errstr
Cheers,
Parag
On Mon, Nov 9, 2009 at 6:43 PM, Arun G Nair arungn...@gmail.com wrote:
On Mon, Nov 9, 2009 at 6:37 PM, Parag Kalra
rithu wrote:
Hi,
Hello,
Please help me to split a string as follows..
my $line = abcdefghijkl
the expected output should be like:
ab
ef
ij
The logic is like alternate 2 characters should be removed
$ perl -le'
my $line = abcdefghijkl;
my @data = unpack (a2x2)*, $line;
print for
Hi,
Do you need the fastest possible sort?
I'm not even sure if I really need to worry about all these
sorting techniques. My program just reads a text file
(wordlist). It might be megabyte-sized or probably few
gigabytes (i might also add size checking on this to be
safe with
On Monday 09 Nov 2009 19:40:29 Uri Guttman wrote:
MA == Michael Alipio daem0n...@yahoo.com writes:
MA i'm planning to sort an input file (which was File::Slurp'ed, most
MA likely megabyte-sized file) in various ways. I did some readings
MA and learned several methods that people have
Hi,
I just spent 20mins scratching my head because I didn't read the docs
very closely concerning splice. I had assumed it left the array
intact, its doesn't. I was hoping for a function more akin to substr
where the return would be the offset - length of the array but the
value it was working on
Dermot wrote:
Hi,
I just spent 20mins scratching my head because I didn't read the docs
very closely concerning splice. I had assumed it left the array
intact, its doesn't. I was hoping for a function more akin to substr
where the return would be the offset - length of the array but the
On 11/9/09 Mon Nov 9, 2009 10:46 AM, Dermot paik...@googlemail.com
scribbled:
Hi,
I just spent 20mins scratching my head because I didn't read the docs
very closely concerning splice. I had assumed it left the array
intact, its doesn't. I was hoping for a function more akin to substr
2009/11/9 Shawn H Corey shawnhco...@gmail.com:
...
use Data::Dumper;
# Make Data::Dumper pretty
$Data::Dumper::Sortkeys = 1;
$Data::Dumper::Indent = 1;
# Set maximum depth for Data::Dumper, zero means unlimited
$Data::Dumper::Maxdepth = 0;
my @array = (1, 4, 6, 9, 2);
my @list =
2009/11/9 Michael Alipio daem0n...@yahoo.com:
Hi,
Do you need the fastest possible sort?
I'm not even sure if I really need to worry about all these
sorting techniques. My program just reads a text file
(wordlist). It might be megabyte-sized or probably few
gigabytes (i might also add
I am unabashedly posting a quiz question I have about regular expressions:
Looking for suggestions.
I am thinking
1) make the set of regular expressions into one big expression?
2) search the seach strings, somehow, for common substrings. acme.org would
be example. Each hit on acme.org would
On Mon, Nov 9, 2009 at 10:56 AM, Jim Gibson jimsgib...@gmail.com wrote:
However, here is a shortened form using regular expression:
my @output = $line =~ m{ \G (..) .. }gx;
Verify how either of these works when you do not have a multiple of 2
characters in your input.
It has other
On Mon, Nov 9, 2009 at 8:30 PM, tom smith climbingpartn...@gmail.comwrote:
On Mon, Nov 9, 2009 at 10:56 AM, Jim Gibson jimsgib...@gmail.com wrote:
However, here is a shortened form using regular expression:
my @output = $line =~ m{ \G (..) .. }gx;
Verify how either of these works when
PP == Philip Potter philip.g.pot...@gmail.com writes:
PP Actually, there is a certain amount of reasoning possible with respect
PP to comparison functions: for example, a Schwartzian Transform will be
PP a win if the key calculation is more expensive than the comparison of
PP keys.
that
Matthew Sacks wrote:
I am unabashedly posting a quiz question I have about regular expressions:
Looking for suggestions.
I am thinking
1) make the set of regular expressions into one big expression?
2) search the seach strings, somehow, for common substrings. acme.org
would be
30 matches
Mail list logo
