Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask

Re^4: Numerically generate the perl sequence 1, 11, 111, ....

by JavaFan (Canon)
on Oct 12, 2008 at 15:41 UTC ( #716682=note: print w/replies, xml ) Need Help??

in reply to Re^3: Numerically generate the perl sequence 1, 11, 111, ....
in thread Generate the perl sequence 1, 11, 111, ....

One interesting and useful sequence that springs to mind is:
2, 3, 5, 7, 11, 13, ... # Prime numbers.
but with neither differences, nor ratios could one continue the sequence.

Replies are listed 'Best First'.
Re^5: Numerically generate the perl sequence 1, 11, 111, ....
by moritz (Cardinal) on Oct 12, 2008 at 16:07 UTC
    ... nor can it be efficiently computed, which is why I'd leave it out.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://716682]
[choroba]: but undef %hash and %hash = () both work, too, but the first one keeps the memory allocated, while the latter makes it available for other parts of the program.
[choroba]: iirc
[perldigious]: karlgoethebier: Well it is a pretty old and complicated (for me) bit of code I wrote (poorly by my current standards), so I'm expecting everything to break when I add the scoping and find out what else is undesireably scope changed. :-)
[perldigious]: Ah, thanks choroba, that sort of thing was precisely what I was wondering when I asked.
[perldigious]: I didn't want to tie up memory unecessarily basically, I wanted to "delete" it specifically to free it up, and wasn't sure I was even accomplishing that.

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (5)
As of 2017-07-21 19:53 GMT
Find Nodes?
    Voting Booth?
    I came, I saw, I ...

    Results (335 votes). Check out past polls.