Random-access list
= Random-access list
A persistent <list> representation supporting positional lookup more efficiently than a conventional <linked list>. Different implementations trade lookup, insertion and deletion costs; “random-access” does not itself guarantee constant-time indexing. A <skew-binary random-access list> supports worst-case constant-time front insertion and removal with logarithmic worst-case lookup.