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...

詳細記述

書誌詳細
主要な著者: Hinze, R, Paterson, R
フォーマット: Journal article
出版事項: 2006

類似資料