["^ ","~:rename-macros",["^ "],"~:renames",["^ "],"~:use-macros",["^ "],"~:excludes",["~#set",[]],"~:name","~$clojure.walk","~:imports",null,"~:requires",null,"~:cljs.spec/speced-vars",[],"~:uses",null,"~:defs",["^ ","~$walk",["^ ","~:protocol-inline",null,"~:meta",["^ ","~:file","/Users/scott/.cljs/.aot_cache/1.11.121/50C4598/clojure/walk.cljs","~:line",37,"~:column",7,"~:end-line",37,"~:end-column",11,"~:arglists",["~#list",["~$quote",["^E",[["~$inner","~$outer","~$form"]]]]],"~:doc","Traverses form, an arbitrary data structure.  inner and outer are\n  functions.  Applies inner to each element of form, building up a\n  data structure of the same type, then applies outer to the result.\n  Recognizes all Clojure data structures. Consumes seqs as with doall.","~:added","1.1"],"^K","1.1","^5","~$clojure.walk/walk","^?","/Users/scott/.cljs/.aot_cache/1.11.121/50C4598/clojure/walk.cljs","^C",11,"~:method-params",["^E",[["^G","^H","^I"]]],"~:protocol-impl",null,"~:arglists-meta",["^E",[null,null]],"^A",1,"~:variadic?",false,"^@",37,"~:ret-tag","~$any","^B",37,"~:max-fixed-arity",3,"~:fn-var",true,"^D",["^E",["^F",["^E",[["^G","^H","^I"]]]]],"^J","Traverses form, an arbitrary data structure.  inner and outer are\n  functions.  Applies inner to each element of form, building up a\n  data structure of the same type, then applies outer to the result.\n  Recognizes all Clojure data structures. Consumes seqs as with doall."],"~$postwalk",["^ ","^=",null,"^>",["^ ","^?","/Users/scott/.cljs/.aot_cache/1.11.121/50C4598/clojure/walk.cljs","^@",54,"^A",7,"^B",54,"^C",15,"^D",["^E",["^F",["^E",[["~$f","^I"]]]]],"^J","Performs a depth-first, post-order traversal of form.  Calls f on\n  each sub-form, uses f's return value in place of the original.\n  Recognizes all Clojure data structures. Consumes seqs as with doall.","^K","1.1"],"^K","1.1","^5","~$clojure.walk/postwalk","^?","/Users/scott/.cljs/.aot_cache/1.11.121/50C4598/clojure/walk.cljs","^C",15,"^M",["^E",[["~$f","^I"]]],"^N",null,"^O",["^E",[null,null]],"^A",1,"^P",false,"^@",54,"^Q","^R","^B",54,"^S",2,"^T",true,"^D",["^E",["^F",["^E",[["~$f","^I"]]]]],"^J","Performs a depth-first, post-order traversal of form.  Calls f on\n  each sub-form, uses f's return value in place of the original.\n  Recognizes all Clojure data structures. Consumes seqs as with doall."],"~$prewalk",["^ ","^=",null,"^>",["^ ","^?","/Users/scott/.cljs/.aot_cache/1.11.121/50C4598/clojure/walk.cljs","^@",62,"^A",7,"^B",62,"^C",14,"^D",["^E",["^F",["^E",[["~$f","^I"]]]]],"^J","Like postwalk, but does pre-order traversal.","^K","1.1"],"^K","1.1","^5","~$clojure.walk/prewalk","^?","/Users/scott/.cljs/.aot_cache/1.11.121/50C4598/clojure/walk.cljs","^C",14,"^M",["^E",[["~$f","^I"]]],"^N",null,"^O",["^E",[null,null]],"^A",1,"^P",false,"^@",62,"^Q","^R","^B",62,"^S",2,"^T",true,"^D",["^E",["^F",["^E",[["~$f","^I"]]]]],"^J","Like postwalk, but does pre-order traversal."],"~$keywordize-keys",["^ ","^=",null,"^>",["^ ","^?","/Users/scott/.cljs/.aot_cache/1.11.121/50C4598/clojure/walk.cljs","^@",68,"^A",7,"^B",68,"^C",22,"^D",["^E",["^F",["^E",[["~$m"]]]]],"^J","Recursively transforms all map keys from strings to keywords.","^K","1.1"],"^K","1.1","^5","~$clojure.walk/keywordize-keys","^?","/Users/scott/.cljs/.aot_cache/1.11.121/50C4598/clojure/walk.cljs","^C",22,"^M",["^E",[["~$m"]]],"^N",null,"^O",["^E",[null,null]],"^A",1,"^P",false,"^@",68,"^Q","^R","^B",68,"^S",1,"^T",true,"^D",["^E",["^F",["^E",[["~$m"]]]]],"^J","Recursively transforms all map keys from strings to keywords."],"~$stringify-keys",["^ ","^=",null,"^>",["^ ","^?","/Users/scott/.cljs/.aot_cache/1.11.121/50C4598/clojure/walk.cljs","^@",76,"^A",7,"^B",76,"^C",21,"^D",["^E",["^F",["^E",[["~$m"]]]]],"^J","Recursively transforms all map keys from keywords to strings.","^K","1.1"],"^K","1.1","^5","~$clojure.walk/stringify-keys","^?","/Users/scott/.cljs/.aot_cache/1.11.121/50C4598/clojure/walk.cljs","^C",21,"^M",["^E",[["~$m"]]],"^N",null,"^O",["^E",[null,null]],"^A",1,"^P",false,"^@",76,"^Q","^R","^B",76,"^S",1,"^T",true,"^D",["^E",["^F",["^E",[["~$m"]]]]],"^J","Recursively transforms all map keys from keywords to strings."],"~$prewalk-replace",["^ ","^=",null,"^>",["^ ","^?","/Users/scott/.cljs/.aot_cache/1.11.121/50C4598/clojure/walk.cljs","^@",84,"^A",7,"^B",84,"^C",22,"^D",["^E",["^F",["^E",[["~$smap","^I"]]]]],"^J","Recursively transforms form by replacing keys in smap with their\n  values.  Like clojure/replace but works on any data structure.  Does\n  replacement at the root of the tree first.","^K","1.1"],"^K","1.1","^5","~$clojure.walk/prewalk-replace","^?","/Users/scott/.cljs/.aot_cache/1.11.121/50C4598/clojure/walk.cljs","^C",22,"^M",["^E",[["^12","^I"]]],"^N",null,"^O",["^E",[null,null]],"^A",1,"^P",false,"^@",84,"^Q","^R","^B",84,"^S",2,"^T",true,"^D",["^E",["^F",["^E",[["^12","^I"]]]]],"^J","Recursively transforms form by replacing keys in smap with their\n  values.  Like clojure/replace but works on any data structure.  Does\n  replacement at the root of the tree first."],"~$postwalk-replace",["^ ","^=",null,"^>",["^ ","^?","/Users/scott/.cljs/.aot_cache/1.11.121/50C4598/clojure/walk.cljs","^@",92,"^A",7,"^B",92,"^C",23,"^D",["^E",["^F",["^E",[["^12","^I"]]]]],"^J","Recursively transforms form by replacing keys in smap with their\n  values.  Like clojure/replace but works on any data structure.  Does\n  replacement at the leaves of the tree first.","^K","1.1"],"^K","1.1","^5","~$clojure.walk/postwalk-replace","^?","/Users/scott/.cljs/.aot_cache/1.11.121/50C4598/clojure/walk.cljs","^C",23,"^M",["^E",[["^12","^I"]]],"^N",null,"^O",["^E",[null,null]],"^A",1,"^P",false,"^@",92,"^Q","^R","^B",92,"^S",2,"^T",true,"^D",["^E",["^F",["^E",[["^12","^I"]]]]],"^J","Recursively transforms form by replacing keys in smap with their\n  values.  Like clojure/replace but works on any data structure.  Does\n  replacement at the leaves of the tree first."]],"~:cljs.spec/registry-ref",[],"~:require-macros",null,"~:cljs.analyzer/constants",["^ ","~:seen",["^4",["~:else"]],"~:order",["^1:"]],"^J","This file defines a generic tree walker for Clojure data\nstructures.  It takes any data structure (list, vector, map, set,\nseq), calls a function on every element, and uses the return value\nof the function in place of the original.  This makes it fairly\neasy to write recursive search-and-replace functions, as shown in\nthe examples.\n\nNote: \"walk\" supports all Clojure data structures EXCEPT maps\ncreated with sorted-map-by.  There is no (obvious) way to retrieve\nthe sorting function.","~:as-aliases",["^ "]]