[BangPypers] sort query
sidharth.kuruvila at gmail.com
Sat Oct 24 12:05:09 CEST 2009
> Looks like Python dictionary implementation is doing something clever.
> d.keys() returns the cached object if its refcount == 1 and returns a
> new object if refcount > 1.
I don't think that's what's happening
>>> l = [1,2,3,4]
It seems that when d.keys is called the second it's using the same
memory as the previous call as that one was deleted. Creating a list
displaces the memory.
More information about the BangPypers