Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re: Re: Data structure challenge

by gjb (Vicar)
on Mar 17, 2004 at 22:13 UTC ( #337533=note: print w/replies, xml ) Need Help??


in reply to Re: Data structure challenge
in thread Data structure challenge

Wouldn't a pack(a[U*log_10(U)], 'z') do the trick?

Thanks Aristotle, I was too lazy/huried to check the correct syntax. The length of the string we want to allocate is N = U*ceil(log_10(U)), so I hoped pack(aN, '') would create a string of N '\0' characters using some low level memory allocation function. Unfortunately that doesn't seem to happen, the resulting string consists of N spaces, so there goes constant time... :(

Just my 2 cents, -gjb-

Replies are listed 'Best First'.
Re^3: Data structure challenge
by Aristotle (Chancellor) on Mar 18, 2004 at 18:08 UTC

    That isn't valid Perl. What exactly were you thinking of?

    I too though that if there's any way to achieve this, pack will be it, but there doesn't seem to be any pack format that would leave any part of the result string uninitialized.

    Makeshifts last the longest.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://337533]
help
Chatterbox?
[LanX]: English ambiguity xD
[LanX]: (NSFW on Sundays)

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (2)
As of 2017-09-24 20:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    During the recent solar eclipse, I:









    Results (274 votes). Check out past polls.

    Notices?