Re: On ropes and O(1) text-ref
John Cowan 12 Jun 2016 17:53 UTC
Alan Manuel Gloria scripsit:
> Ropes are an O(log n) random-access, O(log n) concatenation structure for
> string representation. I assume you already know about ropes.
I thought that ropes were O(k) for concatenation where k is the number
of ropes, because you can just create a new top-level node for them.
--
John Cowan http://www.ccil.org/~cowan xxxxxx@ccil.org
The Imperials are decadent, 300 pound free-range chickens (except they have
teeth, arms instead of wings, and dinosaurlike tails). --Elyse Grasso