Performance characteristics of Daml lists

Hi there!

I am interested in the performance characteristics of various operations on Daml lists. What’s the underlying data structure used to implement them? Can you point me to places in the code I can look for myself?



I recommend viewing them as single-linked lists when it comes to performance. So things like indexing are expensive.

This is not quite the full truth. They are actually implemented using FrontStack which can be more efficient in some circumstance. However, I’d recommend to treat that as an implementation detail and not rely on the specific performance guarantees provided by FrontStack.