Module bra_list.api

This fils implements the binary random-access lists (in short bra-lists) described in the chapter 6 of Okasaki's "Purely functional data structures".

The bra-lists are (nearly-)conventional lists of perfect binary trees, such that the sizes of these binary trees increase exponentially. This allows the possibility to implement simple operation (such assize, lookup, update, not implemented here) in logarithmic time.

Index

Variables

Functions