okay, so the workaround is sort!(collect(Set([1,2,3])))
probably this is still slower than directly constructing the vector in a sorted manner
and it looks very error-prone, like you really don’t want to see this in end-user code, something which should be put into another function like sortset(set) = sort!(collect(set)).
Hence again I would guess that there should be something for this in Base
This is what I meant. I think this is very unambiguous when it appears in code, so it can easily be in Base. If any special data-structures have better ways to implement this, they can overload more specific AbstractSet implementations. I invite you to pull-request that on base/sort.jl
How would that work? If you were implementing this, what container would you use as the intermediate while sorting? (Sets do not preserve order, so you can’t “reorder” them.) Or how would you implement a container-free sort? (sounds basically impossible for anything other than toy examples)
An alternative to implementing sort(::Set) would be to throw a more descriptive error. I agree that we should do one of these (either implement the method, or implement the error).