IFBTree and LFBTree raise "TypeError: expected integer key" for .values(min=<float>, max=<float>) about btrees HOT 4 CLOSED

As long as all the keys are floats, you could use an OOBTree:

>>> from BTrees.OOBTree import OOBTree
>>> tree = OOBTree()
>>> 
>>> tree[.3] = 'wwww'
>>> tree[.4] = 'xxxx'
>>> tree[.5] = 'yyyy'
>>> tree[.6] = 'zzzz'
>>> list(tree.values(min=.35, max=.55))
['xxxx', 'yyyy']

from btrees.

BTrees are sorted by key, not value. The arguments to the values function allow you to get the subset of values whose keys are in the given range. Hence the arguments must be the type accepted for keys.

from btrees.

Okay, understood. Thanks for the swift response.

I suppose what I'm looking for, then, is a Btree implemented with float as the key type. So that I can perform inexact min/max range searches on floating point values.

Has anything like this been requested for BTrees? More importantly, do you believe it is possible?

from btrees.

That class I did not think of trying. Thanks very much, @tseaver, I will see how it works for me.

from btrees.