4 ms·
But the paper that introduced the term 'persistent data structure' said they already existed in Lisp and gave the example of a persistent queue built by sharing
by chrisseaton 8y ago
But the paper that introduced the term 'persistent data structure' said they already existed in Lisp and gave the example of a persistent queue built by sharing the tail of an existing one with a new head?
- coldtea 8y agoDoesn't have to be built-in to exist in the Lisp ecosystem.
- chrisseaton 8y agoSorry I don't understand what that means? A Lisp list is a persistent data structure.
- coldtea 8y agoA Clojure seq offers much more than that. But you can re-create it in CL, it's just not built-in.
- chrisseaton 8y agoI was replying to > Scheme and CL have immutable data structures, but not persistent data structures. And I said they do. You've said Clojure persistent data structure offer more. Ok, but I just said they existed in Lisp and they do.
- cgrand-net 8y agoSort of. First, conses are mutable so lists are persistent as long as they are used in a persistent way -- it has to be enforced through the codebase (and deps). Second, lists big-O access/update costs are not as interesting as persistent maps and vectors.