data class RTree<out A>
<init> |
RTree(value: A, children: Lazy<List<RTree<A>>> = lazy { emptyList<RTree<A>>() }) |
children |
val children: Lazy<List<RTree<A>>> |
value |
val value: A |
isEmpty |
fun <A> RTree<A>.isEmpty(): Boolean |
map |
fun <A, B> RTree<A>.map(f: (A) -> B): RTree<B> |