generic finger-tree structure (http://staff.city.ac.uk/~ross/papers/FingerTree.html)
#12Priority queue documentation bug?
insert is documented as being O(log n), but it looks (amortized) constant time to me. Am I missing something?
generic finger-tree structure (http://staff.city.ac.uk/~ross/papers/FingerTree.html)
insert is documented as being O(log n), but it looks (amortized) constant time to me. Am I missing something?
