A weaksortedset provides exactly the same methods and has the same performance characteristics as a sortedset. However, it keeps a weak reference to its members instead of a strong reference. After an item has no more strong references to it, the item will be removed from the set.