Sorting

Abstract

Set Interface (L03-L08) Container build(X) len() given an iterable X, build set from items in X return the number of stored items Static find(k) return the stored item with key k Dynamic insert(x) delete(k) add x to set (replace item with key x.key if one already exists) remove and return the stored item with key k Order iter ord() find min() find max() find next(k) find prev(k) return the stored items one-by-one in key order return the stored item with smallest key return the stored item with largest key return the stored item with smallest key larger than k return the stored item with largest key smaller than k