|
|
|
| Just another Perl shrine | |
| PerlMonks |
Re: fast string parser: regex versus substrby dragonchild (Archbishop) |
| on Nov 20, 2003 at 16:19 UTC ( [id://308611]=note: print w/replies, xml ) | Need Help?? |
|
Read up on unpack. For fixed-width data, it's the fastest Perl has to offer.
------
The idea is a little like C++ templates, except not quite so brain-meltingly complicated. -- TheDamian, Exegesis 6 ... strings and arrays will suffice. As they are easily available as native data types in any sane language, ... - blokhead, speaking on evolutionary algorithms Please remember that I'm crufty and crochety. All opinions are purely mine and all code is untested, unless otherwise specified.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||