On Sun, Mar 15, 2020 at 9:41 PM Andrew Barnert via Python-ideas <python-ideas@python.org> wrote:
Do you really want to require “binary”?
I don't think so; they never talked about binary trees, only "binary search tree semantics." It could alternately be called autobalanced tree semantics or something.
Sorted Containers, that implemented the consensus API (largely based on blist’s).
One feature blist has that sortedcontainers seems to lack is O(1) copies. It would be nice to have that in a standard library. But maybe I shouldn't press for it as it might impose a significant constant-factor overhead on other operations. blist unfortunately seems to be at least slightly bitrotted at this point: iterating over a sortedset fails because of a method that assumes that StopIteration will escape from a generator. pyrsistent has O(1) copying and is maintained but it's terribly slow and the interface is nonstandard (Haskellish instead of Pythonic).