not sure I have ever thought so hard about an array. I mean, you've got your FIFO, your Ring Buffer, and if you need more use a database ;-)
-
-
-
Exactly! Also, queue, dequeue, stack, list, ...
- 1 more reply
New conversation -
-
-
My implementation is a tree where each node is either a small native array or a concatenation of slices of nodes.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
Does it end up being similar to an immutable copy on write b+tree with counts instead of keys?
-
Yes! Very similar to that, with tradeoffs much like a HAMT in node size vs traversal depth. Surprisingly simple too.
End of conversation
New conversation -
-
-
sounds maybe similar to https://en.m.wikipedia.org/wiki/Finger_tree …
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
aren't those asynchronous tuples?
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
how is iteration over a sequence of length N not O(N)?
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.