3 ms·
Maybe this could lead, in a roundabout way, to saner ways of dealing with hash tables and non-list sequences in general in Common Lisp. Currently these need clu
by stereolambda 7y ago
Maybe this could lead, in a roundabout way, to saner ways of dealing with hash tables and non-list sequences in general in Common Lisp. Currently these need clunky, verbose code for many use cases. Writing your own functions/macros is of course possible, but it feels disorganized without ensuring an overarching system of conventions. AFAIK a uniform way of handling sequences was one of the early selling points of Clojure, according to Rich Hickey himself. Sequences which are immutable, which I don't care much for (as I cherish the out-of-your-way CL philosophy), but it's a compromise.
Alternatively I could spend some time assessing rutils or some other fundamental extension library... I'd like, one day, for one of those to gain a good tutorial and a bigger mindshare in the community.
- bjoli 7y agoYeah. In scheme I have, just for fun, hacked the reader to make (#:keyword hash) => (hash-ref hash #:keyword) and a 3 arity to a hash-set!. Quite handy, it turned out. I thought about extending the reader to allow for clojuresque applicable dicts (racket allows for this quite easily), but I never got to it.
- ScottBurson 7y agoHave you looked at FSet? https://github.com/slburson/fset https://github.com/slburson/fset
- stereolambda 7y agoLooks promising, thanks for the tip!