This site needs no title
  • About
  • Externals
    • Data Structures in Smalltalk
    • Crate libpq-rs
    • Crate igraph-rs

Amortized


The (aux fds sbral) module

Skew Binary Random-Access Lists, aka SBRALs.

 Posted on April 10, 2026  |   11 min  |   2177 words  |   Massimo Nocentini

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]
Categories: scheme  Tags: sbral scheme persistent functional sequences indexing trees lookup update amortized 

Massimo Nocentini  •  © 2026  •  This site needs no title

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