31 Jul
2003
31 Jul
'03
4:54 p.m.
Toby Dickenson wrote:
BTrees need their keys to have a total ordering.
Why would they not have that if the keys are nto all of the same type?
BTrees require that they can compare their keys for order. Historically, breaking this requirement could corrupt things severly and silently. Today it isnt silent.
Boo! Hiss! I thought you could always compare object in python and have some kindof meaningful result returned? Chris