A Python analogy of set in C++ and PriorityQueue in Java. Expected Performance is
insert - O(logn)
remove - O(logn)
find - O(logn)
Operations supported in the current version include
insert
remove
find
max
min
built-in len() is supported
Operations pending for implementation include
upper_bound
lower_bound