Re^3: Allocation of anonymous arrays (ref addr repeats)

sorry for my ignorance Anonymous, but what are you demonstrating here? can you explain your code?

There are no rules, there are no thumbs..
Reinvent the wheel, then learn The Wheel; may be one day you reinvent one of THE WHEELS.

Comment on Re^3: Allocation of anonymous arrays (ref addr repeats) Download Code

Replies are listed 'Best First'.
Re^4: Allocation of anonymous arrays (ref addr repeats) by Anonymous Monk on Feb 07, 2014 at 11:46 UTC
sorry for my ignorance Anonymous, but what are you demonstrating here? can you explain your code? Um, what do you think I'm demonstrating? What do you understand about the code? :) I think I'm demonstrating that reference adresses get reused rather quickly ... Is this relevant for the OP? I can't say :\| If all that happens is `my %f = ([],[]); my %g = reverse %f;` then both %f and %g will have unique key-value pairs guaranteed If at some point other references are added as keys then collisions will happen	[reply] [d/l]

Replies are listed 'Best First'.

sorry for my ignorance Anonymous, but what are you demonstrating here? can you explain your code?

Um, what do you think I'm demonstrating? What do you understand about the code?

I think I'm demonstrating that reference adresses get reused rather quickly ...

Is this relevant for the OP? I can't say :|

If all that happens is my %f = ([],[]); my %g = reverse %f; then both %f and %g will have unique key-value pairs guaranteed

If at some point other references are added as keys then collisions will happen