Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"

Re^2: cut vs split (and on usefullness of cat, too:-))

by Mabooka-Mabooka (Sexton)
on Apr 18, 2005 at 16:13 UTC ( #448932=note: print w/replies, xml ) Need Help??

in reply to Re: cut vs split (suggestions)
in thread cut vs split (suggestions)

I am Perl-illiterate, but:

how is 5 faster than 1?
And how possibly "index" / "substring" could be faster than smth. like:
char* cut(char* pStr, int col, char* delim=",") { // not a real-life code, all good assumptions here: int n = 0; while(*pStr++){ if(*pStr==*delim){ if(++n == col){ return until_next_one(++pStr, delim); } } } }
Sorry if I missed the point.

Replies are listed 'Best First'.
Re^3: cut vs split (and on usefullness of cat, too:-))
by cees (Curate) on Apr 18, 2005 at 17:52 UTC

    I wasn't implying that my perl version was faster than the C version. I think it is save to say that for every perl program, there is a C program that can perform the same task in less time.

    I was stating that using index and substr where you can is almost always faster than using a regexp, so my index and substr version was faster than the join and split versions listed above. So I was comparing different perl implementations.

    I guess I probably should have timed one of the split/join examples and included that, but I didn't know which one was the fastest. So I included the timing based on the C version of cut, which gives a baseline for anyone to compare against.

    - Cees

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://448932]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (4)
As of 2018-06-19 22:32 GMT
Find Nodes?
    Voting Booth?
    Should cpanminus be part of the standard Perl release?

    Results (115 votes). Check out past polls.