I want a set that retains insertion order, is a so...

# announcements

[Bernhard]

I want a set that retains insertion order, is a sorted set the wrong type?

[deactivateduser]

You should call toSet() instead of toSortedSet().

[deactivateduser]

As the name implies, toSortedSet() will sort the items

[kqr]

hm does .toSet guarantee insertion order?

[deactivateduser]

Try and test it, only then you will know.

[Bernhard]

there is no toLinkedHashSet right?

[deactivateduser]

https://play.kotlinlang.org/#eyJ2ZXJzaW9uIjoiMS4zLjYxIiwicGxhdGZvcm0iOiJqYXZhIiwiYXJncyI6IiIsImpzQ29kZSI6IiIsIm5vbmVNYXJrZXJzIjp0cnVlLCJ0aGVtZSI6ImlkZWEiLCJjb2RlIjoiLyoqXG4gKiBZb3UgY2FuIGVkaXQsIHJ1biwgYW5kIHNoYXJlIHRoaXMgY29kZS4gXG4gKiBwbGF5LmtvdGxpbmxhbmcub3JnIFxuICovXG5cbmZ1biBtYWluKCkge1xuICAgIHByaW50bG4oIGxpc3RPZiggXCJiXCIsIFwiYVwiLCBcImNcIiwgXCJlXCIsIFwiYWFcIiApLnRvU2V0KCkgKVxufSJ9

[spand]

documentation of `toSet()`: The returned set preserves the element iteration order of the original collection.

[spand]

I figure that is what you want

[Bernhard]

so toSet() doesn’t return a Set but a LinkedHashSet?

[Bernhard]

ha, yeah

[Bernhard]

if (this is Collection) {
    return when (size) {
        0 -> emptySet()
        1 -> setOf(if (this is List) this[0] else iterator().next())
        else -> toCollection(LinkedHashSet<T>(mapCapacity(size)))
    }
}
return toCollection(LinkedHashSet<T>()).optimizeReadOnlySet()

[Bernhard]

the naming is really wrong

[ESchouten]

Is it wrong? Set is the Interface, LinkedHashSet is the implementation. As it should.