Massimo Nocentini
  • About
  • Externals
    Data Structures in Smalltalk Crate libpq-rs Crate igraph-rs

Lists


Purely functional random-access lists

 Posted on October 1, 1995  |  1 min  |  112 words  |  Chris Okasaki

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]
randomaccess  functional  lists  lookup  update  indexing  arrays  persistent  logarithmic 

Massimo Nocentini  • © 2026  •  Massimo Nocentini

Hugo v0.160.1 powered  •  Theme Beautiful Hugo adapted from Beautiful Jekyll