[Python-ideas] Optional key to `bisect`'s functions?
stutzbach at google.com
Thu Feb 9 23:01:27 CET 2012
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
> 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.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Python-ideas