When using clojure.tools.macro/symbol-macrolet, it won't expand symbols inside special forms. Like this:

user> (macroexpand '(symbol-macrolet [name my-new-name]
                      (def name 1)
                      (something-else name)))

(do (def name 1) (something-else my-new-name))

As I mentioned a couple weeks ago in #rewrite-clj, I’m building a pattern-matching library for rewrite-clj/clj-kondo nodes: convert an s-expression into a function that checks if a given node matches the s-expression. I’ve got it all working for tokens (nil, boolean, keyword, symbol, string), lists, and vectors, but I’m struggling to get an algorithm for matching against maps (and sets) that contain non-tokens (lists, vectors, maps, sets). The issue I’ve run into is that map nodes aren’t map objects but an ordered seq of nodes of keys and values: {:type :map :children [{:type :token :k “asdf”} {:type :token :lines [“some val”]}] I have a couple of thoughts and questions about this: I can’t simply convert a map node to a clojure map because if a key is a non-token, what do I make the key? The entire :children seq? That falls apart quickly, so I imagine I’ll leave it as a map node. How do I write a matcher that checks if the map node contains a non-token? (For example, the map pattern contains the pair [[1 2 3] :key].) The match predicate needs to find a matching key in the map node’s :children and then remove or track that it’s been matched. Does that mean potentially calling the match predicate on every key in the map node’s :children? Seems like it would be computationally inefficient. Given all of that, is there an efficient method of checking if all elements in one seq (the map pattern) are in another seq (the :children of the map node)? Are there other ways of doing this I’m missing?