tiny.preserves.set

1/// Makes a set holding a copy of the slice `items`, sorted in ascending order under `compare`. Code2/// that builds a set by hand calls it, so duplicates are refused and the storage comes out sorted.3/// The duplicate check compares each item with every item before it, so its cost grows with the4/// square of the set's size. The copy is one level deep: the set shares everything the items point5/// to, and `freeValue` frees exactly the slice. The call returns `error.DuplicateSetElement` before6/// it allocates when two items are equal.7pub const set = any_constructors.set;

1pub const set = any.set;