LazyList should implement RandomAccess

[Miha-x64]

Positional access in LazyList is as fast as sequential, positional for-each (for (int i = 0; i < size; i++)) is as fast as iterator for-each (for (E e : list)), and thus this class should implement java.util.RandomAccess.

I use positional for-each with RandomAccess lists heavily, e. g. (Kotlin)

inline fun <T, L> L.forEach(action: (T) -> Unit): Unit
        where L : List<T>, L : RandomAccess {
    for (i in 0 until size)  action(this[i])
}