Continuing the discussion from An always-sorted set:
I updated the gist for the SortedSet type, and added a bunch more auxiliary files than the one for binary search. I did the same thing
Set does and provide overloads for the set-analyzing methods that take a raw
Sequence. Hopefully I remembered to copy all the auxiliary files needed.
I don't know if I got all the complexity information right.