Please sign in to comment.
[enhance] Set: choose become quicker
It gave the minimum element in O(log(n)) Now it works in O(1), giving the element in the top of the tree Conflicts: libbase/baseSetSig.ml libbase/intSet.ml
- Loading branch information...
Showing with 4 additions and 2 deletions.