Am Dienstag, den 23.01.2007, 13:30 -0800 schrieb Simon Burton:
btree.minKey(t) is documented* to return the smallest key at least
as big as t. It seems that if there is no such element it
returns the maximum key.
So if my set is [1,2] and I do minKey(3) i get 2?
Christian
--
gocept gmbh
Am Mittwoch, den 24.01.2007, 10:59 +0100 schrieb Christian Theune:
Am Dienstag, den 23.01.2007, 13:30 -0800 schrieb Simon Burton:
btree.minKey(t) is documented* to return the smallest key at least
as big as t. It seems that if there is no such element it
returns the maximum key.
So if
Simon Burton wrote:
btree.minKey(t) is documented* to return the smallest key at least
as big as t. It seems that if there is no such element it
returns the maximum key.
*in the programming guide, v3.6.0
Hmm, can you write a failing unit test that demonstrates this?
The BTrees package does
