New submission from jason kirtland j...@discorporate.us:
Circular graphs of collections.OrderedDict are uncollectable due to the
presence of OrderedDict.__del__.
from collections import OrderedDict
import gc
left, right = OrderedDict(), OrderedDict()
left['other'] = right
right['other
New submission from jason kirtland j...@discorporate.us:
repr of circular graphs of collections.OrderedDicts fails with 'RuntimeError:
maximum recursion depth exceeded while calling a Python object'.
from collections import OrderedDict
left, right = OrderedDict(), OrderedDict()
left['other
jason kirtland j...@discorporate.us added the comment:
I find the behavior surprising compared to dict and other containers, where
this is not an issue and weakrefs are not required in user code. I would not
be surprised, however, to have to wait for a gc.collect() to clean up my cycles
like
New submission from jason kirtland [EMAIL PROTECTED]:
The C implementation (only) of bisect does not invoke list subclass
methods when insorting. Code like this will not trigger the assert:
class Boom(list):
def insert(self, index, item):
assert False
bisect.insort(Boom
Going to OSCON 2008? Join local and visiting Pythonistas and
Djangonauts for a casual get-together on the rooftop deck at Jax.
* Tuesday, July 22nd 7pm - 10pm
* Jax Bar and Restaurant
826 SW 2nd Ave
Portland, OR 97204
Getting to Jax from the convention center is easy. Find directions
New submission from jason kirtland:
In 2.6a, seems like the __hash__ implementation and __eq__ must be
defined together, in the same class. See also #1549. Ensuring that a
__hash__ implementation isn't being pulled from a builtin type is
probably a sufficient check...?
class Base(object
New submission from jason kirtland:
Python 2.5.1 (r251:54863, May 23 2007, 16:25:53)
[GCC 4.1.1 20070105 (Red Hat 4.1.1-52)] on linux2
Type help, copyright, credits or license for more information.
from collections import defaultdict
class sub(defaultdict):
... def __init__(self
