Persistent

A walkthrough of the Scheme module (aux fds sbral), showing how skew binary random-access lists support persistent front operations in constant amortized time and indexed lookup and update in logarithmic time. [Read More]

Okasaki introduces purely functional random-access lists, a data structure that combines constant-time list operations with logarithmic lookup and update, offering an efficient persistent alternative to arrays in functional programs. [Read More]