[Python-ideas] Optional key to `bisect`'s functions?

[Daniel Stutzbach]

On Thu, Feb 9, 2012 at 1:51 PM, Terry Reedy <tjreedy at udel.edu> wrote:

> On Feb 9, 2012, at 9:50 AM, Daniel Stutzbach wrote:
>> A SortedList class that provides O(log n) insertions is useful from
>
> time to time. There are several existing implementations available (I
>>> wrote one of them, on top of my blist type), each with their pros and
>>> cons.
>>>
>>
> Are your blist leaves lists (or arrays) of some maximum size?


Yes.  Each leaf has at most 128 elements.  It's a compile-time constant.

-- 
Daniel Stutzbach
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.python.org/pipermail/python-ideas/attachments/20120209/a73109dc/attachment.html>