News for hackers. Stuff that matters.
Re:In Defense of Linked Lists by gleenn on Friday November 04, 2022 @07:03PM (#33475249)
Or you could go the Clojure route and do the tree-style immutable vectors where the cost is log32(N) for most operations, small enough in all the relevant operations, and you get the amazing usability of immutable data structures that are performant enough in most cases.
Re:In Defense of Linked Lists by kazinator on Friday November 04, 2022 @10:26PM (#33477168)
How does that scale down to small sequences of under ten items?
Re:In Defense of Linked Lists by Jim_Heckler on Friday November 04, 2022 @11:47PM (#33477715)
an array is used for the last 1-32 elements of the vector (the "tail") so there would be no trie at all, just the tail