On: Pony Performance Cheatsheet

[beagle3]

But you only need to decode it once (or otherwise receive those indices without even deciding) whereas random access to a rope/tree is always o(log n) or o(n).

Use case is everything.

[fnord123 → beagle3]

>Use case is everything.

amen.