Thanks Cedric & Patrick for the WeakReference and ReferenceQueue tips. Will try that next time.
> There is an initial instance without metadata Oh! That makes a lot of sense. Thanks much for figuring that out and explaining it. We could probably optimize that second allocation away relatively easily. I'm much more confident in my assertion that subseq won't retain extra memory. Also judging from the implementation, it seems like it would be possible to implement "submap" and "subset" functions produce sorted maps and sets with a range of keys without linear subseq traversal. Would be cool to see that! -- -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
