avail/avail.utility.structures/RunTree/tree

tree

val tree: TreeMap<Long, Pair<Long, Value>>
Content copied to clipboard

The basic representation is a TreeMap from each run's start to a Pair containing the position just past the run's end and the value associated with that run. This is maintained in such a way that no runs overlap, no runs are empty, and there are no contiguous runs with equal values (they are automatically merged).