I've been exploring an object-oriented implementation of Finger Trees
(
http://bit.ly/qAZT4W). Finger Trees are a persistent sequence
data-structure with amortized O(1) addition and removal of items from
either end. The typical implementation is expressed in
pure-functional terms. Instead, I'm showing them as immutable (value)
objects. Object-method dispatch is implemented with pure functions
applied to tuples where the first tuple-element is the method dispatch
function (vtable). Comments on this approach are welcome.
============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at
http://www.friam.org
Locked
