A modern programming language that makes developers happier.

kotlinlang

aggregate_function_question.kt

I think there’s a couple ways you could go about doing this

A little "gross", but this works? (didn't tested)
```
println(list.sortedBy { min(it.index, it.children?.minBy { it.index }?.index ?: Int.MAX_VALUE) })
```

that’d only work for one layer of nesting I think

you’re going to need some kind of traversal function to find the lowest index within the page tree

Actually 1 layer of nesting should be sufficient. Thanks! Will try it out

```
fun Page.mindex(): Int = (listOf(index) + (children?.map { it.mindex() } ?: listOf&lt;Int&gt;())).min() ?: Int.MAX_VALUE
```

Mine works for any amount of nesting :wink:

and Int.MAX_VALUE could realistically be replaced with wrapping whole thing w. requireNotNull because you’ll always have a minimum of 1 item