1 line
32 KiB
JSON
1 line
32 KiB
JSON
["^ ","~:output",["^ ","~:js","goog.provide('clojure.walk');\n/**\n * 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.\n */\nclojure.walk.walk = (function clojure$walk$walk(inner,outer,form){\nif(cljs.core.list_QMARK_(form)){\nvar G__18736 = cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.list,cljs.core.map.cljs$core$IFn$_invoke$arity$2(inner,form));\nreturn (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(G__18736) : outer.call(null,G__18736));\n} else {\nif(cljs.core.map_entry_QMARK_(form)){\nvar G__18737 = (new cljs.core.MapEntry((function (){var G__18739 = cljs.core.key(form);\nreturn (inner.cljs$core$IFn$_invoke$arity$1 ? inner.cljs$core$IFn$_invoke$arity$1(G__18739) : inner.call(null,G__18739));\n})(),(function (){var G__18741 = cljs.core.val(form);\nreturn (inner.cljs$core$IFn$_invoke$arity$1 ? inner.cljs$core$IFn$_invoke$arity$1(G__18741) : inner.call(null,G__18741));\n})(),null));\nreturn (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(G__18737) : outer.call(null,G__18737));\n} else {\nif(cljs.core.seq_QMARK_(form)){\nvar G__18742 = cljs.core.doall.cljs$core$IFn$_invoke$arity$1(cljs.core.map.cljs$core$IFn$_invoke$arity$2(inner,form));\nreturn (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(G__18742) : outer.call(null,G__18742));\n} else {\nif(cljs.core.record_QMARK_(form)){\nvar G__18743 = cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (r,x){\nreturn cljs.core.conj.cljs$core$IFn$_invoke$arity$2(r,(inner.cljs$core$IFn$_invoke$arity$1 ? inner.cljs$core$IFn$_invoke$arity$1(x) : inner.call(null,x)));\n}),form,form);\nreturn (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(G__18743) : outer.call(null,G__18743));\n} else {\nif(cljs.core.coll_QMARK_(form)){\nvar G__18744 = cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.empty(form),cljs.core.map.cljs$core$IFn$_invoke$arity$2(inner,form));\nreturn (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(G__18744) : outer.call(null,G__18744));\n} else {\nreturn (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(form) : outer.call(null,form));\n\n}\n}\n}\n}\n}\n});\n/**\n * 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.\n */\nclojure.walk.postwalk = (function clojure$walk$postwalk(f,form){\nreturn clojure.walk.walk(cljs.core.partial.cljs$core$IFn$_invoke$arity$2(clojure.walk.postwalk,f),f,form);\n});\n/**\n * Like postwalk, but does pre-order traversal.\n */\nclojure.walk.prewalk = (function clojure$walk$prewalk(f,form){\nreturn clojure.walk.walk(cljs.core.partial.cljs$core$IFn$_invoke$arity$2(clojure.walk.prewalk,f),cljs.core.identity,(f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(form) : f.call(null,form)));\n});\n/**\n * Recursively transforms all map keys from strings to keywords.\n */\nclojure.walk.keywordize_keys = (function clojure$walk$keywordize_keys(m){\nvar f = (function (p__18745){\nvar vec__18746 = p__18745;\nvar k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__18746,(0),null);\nvar v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__18746,(1),null);\nif(typeof k === 'string'){\nreturn new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.keyword.cljs$core$IFn$_invoke$arity$1(k),v], null);\n} else {\nreturn new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [k,v], null);\n}\n});\nreturn clojure.walk.postwalk((function (x){\nif(cljs.core.map_QMARK_(x)){\nreturn cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentArrayMap.EMPTY,cljs.core.map.cljs$core$IFn$_invoke$arity$2(f,x));\n} else {\nreturn x;\n}\n}),m);\n});\n/**\n * Recursively transforms all map keys from keywords to strings.\n */\nclojure.walk.stringify_keys = (function clojure$walk$stringify_keys(m){\nvar f = (function (p__18756){\nvar vec__18758 = p__18756;\nvar k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__18758,(0),null);\nvar v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__18758,(1),null);\nif((k instanceof cljs.core.Keyword)){\nreturn new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.name(k),v], null);\n} else {\nreturn new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [k,v], null);\n}\n});\nreturn clojure.walk.postwalk((function (x){\nif(cljs.core.map_QMARK_(x)){\nreturn cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentArrayMap.EMPTY,cljs.core.map.cljs$core$IFn$_invoke$arity$2(f,x));\n} else {\nreturn x;\n}\n}),m);\n});\n/**\n * 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.\n */\nclojure.walk.prewalk_replace = (function clojure$walk$prewalk_replace(smap,form){\nreturn clojure.walk.prewalk((function (x){\nif(cljs.core.contains_QMARK_(smap,x)){\nreturn (smap.cljs$core$IFn$_invoke$arity$1 ? smap.cljs$core$IFn$_invoke$arity$1(x) : smap.call(null,x));\n} else {\nreturn x;\n}\n}),form);\n});\n/**\n * 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.\n */\nclojure.walk.postwalk_replace = (function clojure$walk$postwalk_replace(smap,form){\nreturn clojure.walk.postwalk((function (x){\nif(cljs.core.contains_QMARK_(smap,x)){\nreturn (smap.cljs$core$IFn$_invoke$arity$1 ? smap.cljs$core$IFn$_invoke$arity$1(x) : smap.call(null,x));\n} else {\nreturn x;\n}\n}),form);\n});\n","~:ns-info",["^ ","~:rename-macros",null,"~:renames",["^ "],"~:meta",["^ ","~:file","clojure/walk.cljs","~:line",35,"~:column",3,"~:end-line",35,"~:end-column",15,"~:author","Stuart Sierra","~:doc","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."],"~:ns-aliases",["^ ","~$cljs.loader","~$shadow.loader","~$clojure.pprint","~$cljs.pprint","~$clojure.spec.alpha","~$cljs.spec.alpha"],"~:use-macros",null,"~:excludes",["~#set",[]],"~:name","~$clojure.walk","~:reader-aliases",["^ "],"~:op","~:ns","~:imports",null,"~:requires",["^ ","~$cljs.core","^N","~$goog","^O"],"~:seen",["^F",[]],"~:uses",null,"~:require-macros",["^ ","^N","^N"],"~:form",["~#list",["~$ns","^H"]],"~:flags",["^ "],"~:js-deps",["^ "],"~:deps",["^O","^N"]],"^K","^H","~:resource-id",["~:shadow.build.classpath/resource","clojure/walk.cljs"],"~:compiled-at",1684858205781,"^I",["^ ","^N","^N","^O","^O"],"~:resource-name","clojure/walk.cljs","~:warnings",[],"~:source","; Copyright (c) Rich Hickey. All rights reserved.\n; The use and distribution terms for this software are covered by the\n; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)\n; which can be found in the file epl-v10.html at the root of this distribution.\n; By using this software in any fashion, you are agreeing to be bound by\n; the terms of this license.\n; You must not remove this notice, or any other, from this software.\n\n;;; walk.cljs - generic tree walker with replacement\n\n;; by Stuart Sierra\n;; Jul5 17, 2011\n\n;; CHANGE LOG:\n;;\n;; * July 17, 2011: Port to ClojureScript\n;; \n;; * December 15, 2008: replaced 'walk' with 'prewalk' & 'postwalk'\n;;\n;; * December 9, 2008: first version\n\n\n(ns \n ^{:author \"Stuart Sierra\",\n :doc \"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.\"}\n clojure.walk)\n\n(defn walk\n \"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.\"\n\n {:added \"1.1\"}\n [inner outer form]\n (cond\n (list? form) (outer (apply list (map inner form)))\n (map-entry? form)\n (outer (MapEntry. (inner (key form)) (inner (val form)) nil))\n (seq? form) (outer (doall (map inner form)))\n (record? form) (outer (reduce (fn [r x] (conj r (inner x))) form form))\n (coll? form) (outer (into (empty form) (map inner form)))\n :else (outer form)))\n\n(defn postwalk\n \"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.\"\n {:added \"1.1\"}\n [f form]\n (walk (partial postwalk f) f form))\n\n(defn prewalk\n \"Like postwalk, but does pre-order traversal.\"\n {:added \"1.1\"}\n [f form]\n (walk (partial prewalk f) identity (f form)))\n\n(defn keywordize-keys\n \"Recursively transforms all map keys from strings to keywords.\"\n {:added \"1.1\"}\n [m]\n (let [f (fn [[k v]] (if (string? k) [(keyword k) v] [k v]))]\n ;; only apply to maps\n (postwalk (fn [x] (if (map? x) (into {} (map f x)) x)) m)))\n\n(defn stringify-keys\n \"Recursively transforms all map keys from keywords to strings.\"\n {:added \"1.1\"}\n [m]\n (let [f (fn [[k v]] (if (keyword? k) [(name k) v] [k v]))]\n ;; only apply to maps\n (postwalk (fn [x] (if (map? x) (into {} (map f x)) x)) m)))\n\n(defn prewalk-replace\n \"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.\"\n {:added \"1.1\"}\n [smap form]\n (prewalk (fn [x] (if (contains? smap x) (smap x) x)) form))\n\n(defn postwalk-replace\n \"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.\"\n {:added \"1.1\"}\n [smap form]\n (postwalk (fn [x] (if (contains? smap x) (smap x) x)) form))\n","~:reader-features",["^F",["~:cljs"]],"~:cljc",false,"~:source-map-compact",["^ ","mappings",";AAoCA;;;;;;oBAAA,pBAAMA,gDAOHC,MAAMC,MAAMC;AAPf,AAQE,GACE,AAACC,sBAAMD;AAAW,IAAAE,WAAO,AAACC,8CAAMC,eAAK,AAACC,4CAAIP,MAAME;AAA9B,AAAA,kFAAAE,4BAAAA,tGAACH,sCAAAA,gDAAAA;;AADrB,GAEE,AAACO,2BAAWN;AACZ,IAAAO,WAAO,KAAAC,mBAAW,iBAAAC,WAAO,AAACC,cAAIV;AAAZ,AAAA,kFAAAS,4BAAAA,tGAACX,sCAAAA,gDAAAA;KAAkB,iBAAAa,WAAO,AAACC,cAAIZ;AAAZ,AAAA,kFAAAW,4BAAAA,tGAACb,sCAAAA,gDAAAA;KAA/B;AAAP,AAAA,kFAAAS,4BAAAA,tGAACR,sCAAAA,gDAAAA;;AAHH,GAIE,AAACc,qBAAKb;AAAY,IAAAc,WAAO,AAACC,8CAAM,AAACV,4CAAIP,MAAME;AAAzB,AAAA,kFAAAc,4BAAAA,tGAACf,sCAAAA,gDAAAA;;AAJrB,GAKE,AAACiB,wBAAQhB;AAAS,IAAAiB,WAAO,AAACC,+CAAO,WAAKC,EAAEC;AAAP,AAAU,OAACC,6CAAKF,EAAE,CAACrB,sCAAAA,yCAAAA,LAAMsB,qBAAAA;GAAKpB,KAAKA;AAAlD,AAAA,kFAAAiB,4BAAAA,tGAAClB,sCAAAA,gDAAAA;;AALrB,GAME,AAACuB,sBAAMtB;AAAW,IAAAuB,WAAO,AAACC,6CAAK,AAACC,gBAAMzB,MAAM,AAACK,4CAAIP,MAAME;AAArC,AAAA,kFAAAuB,4BAAAA,tGAACxB,sCAAAA,gDAAAA;;AANrB,AAOoB,QAACA,sCAAAA,4CAAAA,RAAMC,wBAAAA;;;;;;;;AAE7B;;;;;wBAAA,xBAAM0B,wDAKHC,EAAE3B;AALL,AAME,OAACH,kBAAK,AAAC+B,gDAAQF,sBAASC,GAAGA,EAAE3B;;AAE/B;;;uBAAA,vBAAM6B,sDAGHF,EAAE3B;AAHL,AAIE,OAACH,kBAAK,AAAC+B,gDAAQC,qBAAQF,GAAGG,mBAAS,CAACH,kCAAAA,wCAAAA,RAAE3B,oBAAAA;;AAExC;;;+BAAA,/BAAM+B,sEAGHC;AAHH,AAIE,IAAML,IAAE,WAAAM;AAAA,AAAA,IAAAC,aAAAD;QAAA,AAAAE,4CAAAD,WAAA,IAAA,/DAAME;QAAN,AAAAD,4CAAAD,WAAA,IAAA,/DAAQG;AAAR,AAAY,GAAI,OAASD;AAAb,0FAAiB,AAACE,gDAAQF,GAAGC;;AAA7B,0FAAiCD,EAAEC;;;AAAvD,AAEE,OAACX,sBAAS,WAAKN;AAAL,AAAQ,GAAI,AAACmB,qBAAKnB;AAAG,oDAAA,7CAACI,gFAAQ,AAACnB,4CAAIsB,EAAEP;;AAAIA;;GAAIY;;AAE3D;;;8BAAA,9BAAMQ,oEAGHR;AAHH,AAIE,IAAML,IAAE,WAAAc;AAAA,AAAA,IAAAC,aAAAD;QAAA,AAAAN,4CAAAO,WAAA,IAAA,/DAAMN;QAAN,AAAAD,4CAAAO,WAAA,IAAA,/DAAQL;AAAR,AAAY,GAAI,cAAAM,bAAUP;AAAd,0FAAkB,AAACQ,eAAKR,GAAGC;;AAA3B,0FAA+BD,EAAEC;;;AAArD,AAEE,OAACX,sBAAS,WAAKN;AAAL,AAAQ,GAAI,AAACmB,qBAAKnB;AAAG,oDAAA,7CAACI,gFAAQ,AAACnB,4CAAIsB,EAAEP;;AAAIA;;GAAIY;;AAE3D;;;;;+BAAA,/BAAMa,sEAKHC,KAAK9C;AALR,AAME,OAAC6B,qBAAQ,WAAKT;AAAL,AAAQ,GAAI,AAAC2B,0BAAUD,KAAK1B;AAAG,QAAC0B,qCAAAA,wCAAAA,LAAK1B,oBAAAA;;AAAGA;;GAAIpB;;AAEvD;;;;;gCAAA,hCAAMgD,wEAKHF,KAAK9C;AALR,AAME,OAAC0B,sBAAS,WAAKN;AAAL,AAAQ,GAAI,AAAC2B,0BAAUD,KAAK1B;AAAG,QAAC0B,qCAAAA,wCAAAA,LAAK1B,oBAAAA;;AAAGA;;GAAIpB","names",["clojure.walk/walk","inner","outer","form","cljs.core/list?","G__18736","cljs.core.apply","cljs.core/list","cljs.core.map","cljs.core/map-entry?","G__18737","cljs.core/MapEntry","G__18739","cljs.core/key","G__18741","cljs.core/val","cljs.core/seq?","G__18742","cljs.core.doall","cljs.core/record?","G__18743","cljs.core.reduce","r","x","cljs.core.conj","cljs.core/coll?","G__18744","cljs.core.into","cljs.core/empty","clojure.walk/postwalk","f","cljs.core.partial","clojure.walk/prewalk","cljs.core/identity","clojure.walk/keywordize-keys","m","p__18745","vec__18746","cljs.core.nth","k","v","cljs.core.keyword","cljs.core/map?","clojure.walk/stringify-keys","p__18756","vec__18758","cljs.core/Keyword","cljs.core/name","clojure.walk/prewalk-replace","smap","cljs.core/contains?","clojure.walk/postwalk-replace"]],"~:used-vars",["^F",["~$clojure.walk/walk","~$cljs.core/keyword","~$cljs.core/partial","~$clojure.walk/prewalk","~$cljs.core/doall","~$cljs.core/reduce","~$cljs.core/apply","~$cljs.core/identity","~$cljs.core/Keyword","~$cljs.core/map-entry?","~$cljs.core/MapEntry","~$cljs.core/contains?","~$cljs.core/into","~$cljs.core/map?","~$cljs.core/conj","~$clojure.walk/postwalk-replace","~$cljs.core/map","~$cljs.core/empty","~$clojure.walk/stringify-keys","~$cljs.core/record?","~$clojure.walk/postwalk","~$cljs.core/nth","~$cljs.core/list?","~$cljs.core/key","~$cljs.core/coll?","~$clojure.walk/keywordize-keys","~$cljs.core/seq?","~$cljs.core/list","~$clojure.walk/prewalk-replace","~$cljs.core/name","~$cljs.core/val"]]],"~:cache-keys",["~#cmap",[["^Z","goog/dom/tagname.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","~:shadow.build.compiler/resolve",["^ ","~:require-id",null,"~:deps-ids",["^F",[]],"~:deps-syms",["^O","~$goog.dom.HtmlElement"]]],["^Z","goog/html/trustedtypes.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O"]]],["^Z","goog/labs/useragent/browser.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","~$goog.labs.userAgent.util","~$goog.labs.userAgent.highEntropy.highEntropyValue","~$goog.asserts","~$goog.string.internal","~$goog.labs.userAgent.highEntropy.highEntropyData","~$goog.labs.userAgent"]]],["^Z","goog/html/safeurl.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^26","~$goog.fs.url","~$goog.html.TrustedResourceUrl","~$goog.string.Const","~$goog.string.TypedString","^27"]]],["^Z","goog/array/array.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^26"]]],["^Z","goog/debug/error.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O"]]],["^Z","goog/flags/flags.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O"]]],["^Z","goog/dom/nodetype.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O"]]],["^Z","goog/labs/useragent/highentropy/highentropyvalue.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^24","^27"]]],["^Z","goog/string/typedstring.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O"]]],["^Z","goog/object/object.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O"]]],["^Z","goog/dom/asserts.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^26"]]],"~:SHADOW-TIMESTAMP",[1684857790000,1684857790000,1684857789000],["^Z","goog/math/long.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^26","~$goog.reflect"]]],["^Z","goog/html/trustedresourceurl.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^26","~$goog.fs.blob","^2:","~$goog.html.SafeScript","~$goog.html.trustedtypes","^2<","^2="]]],["^Z","goog/string/internal.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O"]]],["^Z","goog/functions/functions.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O"]]],["^Z","goog/html/safestyle.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^2<","~$goog.html.SafeUrl","^2=","^26","^27"]]],["^Z","goog/dom/safe.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^26","~$goog.asserts.dom","~$goog.dom.asserts","~$goog.functions","~$goog.html.SafeHtml","^2A","~$goog.html.SafeStyle","^2C","^2;","~$goog.html.uncheckedconversions","^2<","^27"]]],["^Z","goog/asserts/dom.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","~$goog.dom.TagName","^26","~$goog.dom.element"]]],["^Z","clojure/walk.cljs"],["bc14df6666853ed869d7b88aaa864111c65d0c7f","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^N"]]],["^Z","goog/html/safehtml.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^2<","^2A","^2H","~$goog.html.SafeStyleSheet","^2C","^2J","^2;","^2=","^26","~$goog.labs.userAgent.browser","~$goog.array","~$goog.object","^27","~$goog.dom.tags","^2B"]]],["^Z","goog/dom/tags.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^2O"]]],["^Z","goog/fs/blob.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O"]]],["^Z","goog/asserts/asserts.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","~$goog.debug.Error","~$goog.dom.NodeType"]]],["^Z","goog/uri/uri.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^2N","^26","~$goog.collections.maps","~$goog.string","~$goog.structs","~$goog.uri.utils","~$goog.uri.utils.ComponentIndex","~$goog.uri.utils.StandardQueryParam"]]],["^Z","goog/labs/useragent/highentropy/highentropydata.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^25"]]],["^Z","goog/collections/maps.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O"]]],["^Z","goog/fs/url.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O"]]],["^Z","goog/base.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",[]]],["^Z","goog/structs/structs.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^2N","^2O"]]],["^Z","goog/string/string.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","~$goog.dom.safe","^2I","^2<","^27"]]],["^Z","goog/reflect/reflect.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O"]]],["^Z","goog/labs/useragent/util.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^27","^29"]]],["^Z","goog/string/stringbuffer.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O"]]],["^Z","goog/labs/useragent/useragent.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","~$goog.flags"]]],["^Z","goog/dom/element.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^2R","^2J"]]],["^Z","goog/html/uncheckedconversions.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^26","^2G","^2A","^2H","^2L","^2C","^2;","^2<","^27"]]],["^Z","goog/dom/htmlelement.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O"]]],["^Z","cljs/core.cljs"],["bc14df6666853ed869d7b88aaa864111c65d0c7f","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","~$goog.math.Long","~$goog.math.Integer","^2T","^2O","^2N","~$goog.Uri","~$goog.string.StringBuffer"]]],["^Z","goog/html/safescript.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^2<","^2=","^2B","^26"]]],["^Z","goog/html/safestylesheet.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^2<","^2H","^2=","^2O","^26","^27"]]],["^Z","goog/math/integer.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^2?"]]],["^Z","goog/uri/utils.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^26","^2T"]]],["^Z","goog/string/const.js"],["533ce2bdbb7925db781449abb6527af1e6c5e782","^1[",["^ ","^20",null,"^21",["^F",[]],"^22",["^O","^26","^2="]]]]],"~:clj-info",["^ ","jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/vendor/clojure/tools/reader/impl/inspect.clj",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/tagged_literals.cljc",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojure/1.11.1/clojure-1.11.1.jar!/clojure/java/io.clj",1684855521000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/analyzer/passes.cljc",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/vendor/clojure/tools/reader/default_data_readers.clj",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojure/1.11.1/clojure-1.11.1.jar!/clojure/set.clj",1684855521000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/source_map/base64.clj",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/source_map/base64_vlq.clj",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/vendor/clojure/tools/reader/impl/errors.clj",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/util.cljc",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/instant.clj",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojure/1.11.1/clojure-1.11.1.jar!/clojure/core.clj",1684855521000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/analyzer.cljc",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/compiler.cljc",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/externs.clj",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojure/1.11.1/clojure-1.11.1.jar!/clojure/string.clj",1684855521000,"jar:file:/home/chris/.m2/repository/org/clojure/clojure/1.11.1/clojure-1.11.1.jar!/clojure/pprint.clj",1684855521000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/vendor/clojure/tools/reader.clj",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/analyzer/passes/and_or.cljc",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/vendor/clojure/data/json.clj",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/core.cljc",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/analyzer/impl.cljc",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojure/1.11.1/clojure-1.11.1.jar!/clojure/edn.clj",1684855521000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/source_map.clj",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/env.cljc",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/js_deps.cljc",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/vendor/clojure/tools/reader/reader_types.clj",1684857789000,"jar:file:/home/chris/.m2/repository/org/clojure/clojure/1.11.1/clojure-1.11.1.jar!/clojure/instant.clj",1684855521000,"jar:file:/home/chris/.m2/repository/org/clojure/clojurescript/1.11.60/clojurescript-1.11.60.jar!/cljs/analyzer/impl/namespaces.cljc",1684857789000],"~:analyzer",["^ ","^3",null,"^4",["^ "],"^5",["^ ","^6","clojure/walk.cljs","^7",35,"^8",3,"^9",35,"^:",15,"^;","Stuart Sierra","^<","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."],"^=",["^ ","^>","^?","^@","^A","^B","^C"],"^D",null,"^E",["^F",[]],"^G","^H","^I",["^ "],"^L",null,"^M",["^ ","^N","^N","^O","^O"],"^P",["^F",[]],"^Q",null,"~:defs",["^ ","~$walk",["^ ","~:protocol-inline",null,"^5",["^ ","^6","clojure/walk.cljs","^7",37,"^8",7,"^9",37,"^:",11,"~:arglists",["^T",["~$quote",["^T",[["~$inner","~$outer","~$form"]]]]],"^<","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"],"^3Z","1.1","^G","^1:","^6","clojure/walk.cljs","^:",11,"~:method-params",["^T",[["^3W","^3X","^3Y"]]],"~:protocol-impl",null,"~:arglists-meta",["^T",[null,null]],"^8",1,"~:variadic?",false,"^7",37,"~:ret-tag","~$any","^9",37,"~:max-fixed-arity",3,"~:fn-var",true,"^3U",["^T",["^3V",["^T",[["^3W","^3X","^3Y"]]]]],"^<","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",["^ ","^3T",null,"^5",["^ ","^6","clojure/walk.cljs","^7",54,"^8",7,"^9",54,"^:",15,"^3U",["^T",["^3V",["^T",[["~$f","^3Y"]]]]],"^<","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.","^3Z","1.1"],"^3Z","1.1","^G","^1N","^6","clojure/walk.cljs","^:",15,"^3[",["^T",[["~$f","^3Y"]]],"^40",null,"^41",["^T",[null,null]],"^8",1,"^42",false,"^7",54,"^43","^44","^9",54,"^45",2,"^46",true,"^3U",["^T",["^3V",["^T",[["~$f","^3Y"]]]]],"^<","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",["^ ","^3T",null,"^5",["^ ","^6","clojure/walk.cljs","^7",62,"^8",7,"^9",62,"^:",14,"^3U",["^T",["^3V",["^T",[["~$f","^3Y"]]]]],"^<","Like postwalk, but does pre-order traversal.","^3Z","1.1"],"^3Z","1.1","^G","^1=","^6","clojure/walk.cljs","^:",14,"^3[",["^T",[["~$f","^3Y"]]],"^40",null,"^41",["^T",[null,null]],"^8",1,"^42",false,"^7",62,"^43","^44","^9",62,"^45",2,"^46",true,"^3U",["^T",["^3V",["^T",[["~$f","^3Y"]]]]],"^<","Like postwalk, but does pre-order traversal."],"~$keywordize-keys",["^ ","^3T",null,"^5",["^ ","^6","clojure/walk.cljs","^7",68,"^8",7,"^9",68,"^:",22,"^3U",["^T",["^3V",["^T",[["~$m"]]]]],"^<","Recursively transforms all map keys from strings to keywords.","^3Z","1.1"],"^3Z","1.1","^G","^1S","^6","clojure/walk.cljs","^:",22,"^3[",["^T",[["~$m"]]],"^40",null,"^41",["^T",[null,null]],"^8",1,"^42",false,"^7",68,"^43","^44","^9",68,"^45",1,"^46",true,"^3U",["^T",["^3V",["^T",[["~$m"]]]]],"^<","Recursively transforms all map keys from strings to keywords."],"~$stringify-keys",["^ ","^3T",null,"^5",["^ ","^6","clojure/walk.cljs","^7",76,"^8",7,"^9",76,"^:",21,"^3U",["^T",["^3V",["^T",[["~$m"]]]]],"^<","Recursively transforms all map keys from keywords to strings.","^3Z","1.1"],"^3Z","1.1","^G","^1L","^6","clojure/walk.cljs","^:",21,"^3[",["^T",[["~$m"]]],"^40",null,"^41",["^T",[null,null]],"^8",1,"^42",false,"^7",76,"^43","^44","^9",76,"^45",1,"^46",true,"^3U",["^T",["^3V",["^T",[["~$m"]]]]],"^<","Recursively transforms all map keys from keywords to strings."],"~$prewalk-replace",["^ ","^3T",null,"^5",["^ ","^6","clojure/walk.cljs","^7",84,"^8",7,"^9",84,"^:",22,"^3U",["^T",["^3V",["^T",[["~$smap","^3Y"]]]]],"^<","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.","^3Z","1.1"],"^3Z","1.1","^G","^1V","^6","clojure/walk.cljs","^:",22,"^3[",["^T",[["^4<","^3Y"]]],"^40",null,"^41",["^T",[null,null]],"^8",1,"^42",false,"^7",84,"^43","^44","^9",84,"^45",2,"^46",true,"^3U",["^T",["^3V",["^T",[["^4<","^3Y"]]]]],"^<","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",["^ ","^3T",null,"^5",["^ ","^6","clojure/walk.cljs","^7",92,"^8",7,"^9",92,"^:",23,"^3U",["^T",["^3V",["^T",[["^4<","^3Y"]]]]],"^<","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.","^3Z","1.1"],"^3Z","1.1","^G","^1I","^6","clojure/walk.cljs","^:",23,"^3[",["^T",[["^4<","^3Y"]]],"^40",null,"^41",["^T",[null,null]],"^8",1,"^42",false,"^7",92,"^43","^44","^9",92,"^45",2,"^46",true,"^3U",["^T",["^3V",["^T",[["^4<","^3Y"]]]]],"^<","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."]],"^R",["^ ","^N","^N"],"~:cljs.analyzer/constants",["^ ","^P",["^F",["~:else"]],"~:order",["^4?"]],"^V",["^ "],"^W",["^ "],"^X",["^O","^N"]],"^K","^H","~:ns-specs",["^ "],"~:ns-spec-vars",["^F",[]],"~:compiler-options",["^1Z",[["^4C","~:static-fns"],true,["^4C","~:shadow-tweaks"],null,["^4C","~:source-map-inline"],null,["^4C","~:elide-asserts"],false,["^4C","~:optimize-constants"],null,["^4C","^11"],null,["^4C","~:external-config"],null,["^4C","~:tooling-config"],null,["^4C","~:emit-constants"],null,["^4C","~:load-tests"],null,["^4C","~:form-size-threshold"],null,["^4C","~:global-goog-object&array"],null,["^4C","~:data-readers"],null,["^4C","~:infer-externs"],"~:auto",["^4C","^13"],null,["~:js-options","~:js-provider"],"~:shadow",["~:mode"],"~:dev",["^4C","~:fn-invoke-direct"],null,["^4C","~:source-map"],"/dev/null"]]] |