top | item 20896702 (no title) piccolbo | 6 years ago How is that different from a rope data structure? discuss order hn newest detrino|6 years ago Depends what you consider a Rope.Does it require constant time concat?Does it require immutability?Does it require a balancing scheme based on the fib sequence?Does it require that the tree is binary?My tree is an attempt to be as fast as possible with log everything operations and no pointer/reference stability. piccolbo|6 years ago Should've said a generalized rope, as ropes are generally described as a replacement for strings, but if you replace characters with other fixed size data types everything still works.
detrino|6 years ago Depends what you consider a Rope.Does it require constant time concat?Does it require immutability?Does it require a balancing scheme based on the fib sequence?Does it require that the tree is binary?My tree is an attempt to be as fast as possible with log everything operations and no pointer/reference stability.
piccolbo|6 years ago Should've said a generalized rope, as ropes are generally described as a replacement for strings, but if you replace characters with other fixed size data types everything still works.
detrino|6 years ago
Does it require constant time concat?
Does it require immutability?
Does it require a balancing scheme based on the fib sequence?
Does it require that the tree is binary?
My tree is an attempt to be as fast as possible with log everything operations and no pointer/reference stability.
piccolbo|6 years ago