Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re: Re: The Ovidian Transform

by petral (Curate)
on Jan 02, 2002 at 18:04 UTC ( #135668=note: print w/ replies, xml ) Need Help??


in reply to Re: The Ovidian Transform
in thread The Ovidian Transform

If you're not counting on some sort of optimization based on alignment why do a string copy at all?

while ( *str++ != '|' ); date[0] = str[4]; date[1] = str[5]; date[2] = str[6]; date[3] = str[7]; date[4] = str[0]; date[5] = str[1]; date[6] = str[2]; date[7] = str[3];
Or am I not remembering C correctly?

  p


Comment on Re: Re: The Ovidian Transform
Download Code
Re: Re: Re: The Ovidian Transform
by jmcnamara (Monsignor) on Jan 02, 2002 at 22:24 UTC

    You are correct the strncpy is superfluous. The string terminator is missing but newSVpv() has been called with an explicit length so it doesn't matter.

    All in all I would prefer jcwren's methodology.

    --
    John (wishes there was a C-monks).

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://135668]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (5)
As of 2014-08-23 10:05 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (173 votes), past polls