is there a list structure in Kotlin which keeps di...

# getting-started

[Daniele B]

is there a list structure in Kotlin which keeps distinct values only?

e.g.  val list = listOf(3,9,1,6,7)

if I add a new 9, it would removes the old one:

list.add(9)
println(list) // listOf(3,1,6,7,9)

[crummy]

a set?
val set = setOf(3, 9, 1, 6, 7)

[Daniele B]

val set = mutableSetOf(3, 9, 1, 6, 7)
set.add(9)
println(set)

it still prints [3, 9, 1, 6, 7]

[Daniele B]

I would like it to remove the old one

[ephemient]

mutableSetOf() preserves insertion order. remove and re-add

[ephemient]

or build your own LRU, that's a pretty typical CS data structure

[Daniele B]

I was hoping Kotlin already had a structure like that

[ephemient]

it's not in any language's stdlib that I know of, partly because it's not that universal: all users wants slightly different things out of it

[Scott Kruse]

yep ^^

[Scott Kruse]

public fun <T> Iterable<T>.distinct(): List<T> {
    return this.toMutableSet().toList()
}

pretty convenient for a stdlib as it is