Finger trees: a simple general−purpose data structure

We introduce 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized constant time, and concatenation and splitting in time logarithmic in the size of the smaller piece. Representations achieving these bounds have appeared previously, but 2-3...

Disgrifiad llawn

Manylion Llyfryddiaeth
Prif Awduron: Hinze, R, Paterson, R
Fformat: Journal article
Cyhoeddwyd: 2006

Eitemau Tebyg