UNPKG

create-expo-cljs-app

Version:

Create a react native application with Expo and Shadow-CLJS!

131 lines (128 loc) 5.93 kB
goog.provide('clojure.walk'); /** * Traverses form, an arbitrary data structure. inner and outer are * functions. Applies inner to each element of form, building up a * data structure of the same type, then applies outer to the result. * Recognizes all Clojure data structures. Consumes seqs as with doall. */ clojure.walk.walk = (function clojure$walk$walk(inner,outer,form){ if(cljs.core.list_QMARK_(form)){ var G__43933 = cljs.core.apply.cljs$core$IFn$_invoke$arity$2(cljs.core.list,cljs.core.map.cljs$core$IFn$_invoke$arity$2(inner,form)); return (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(G__43933) : outer.call(null,G__43933)); } else { if(cljs.core.map_entry_QMARK_(form)){ var G__43934 = (new cljs.core.MapEntry((function (){var G__43935 = cljs.core.key(form); return (inner.cljs$core$IFn$_invoke$arity$1 ? inner.cljs$core$IFn$_invoke$arity$1(G__43935) : inner.call(null,G__43935)); })(),(function (){var G__43941 = cljs.core.val(form); return (inner.cljs$core$IFn$_invoke$arity$1 ? inner.cljs$core$IFn$_invoke$arity$1(G__43941) : inner.call(null,G__43941)); })(),null)); return (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(G__43934) : outer.call(null,G__43934)); } else { if(cljs.core.seq_QMARK_(form)){ var G__43942 = cljs.core.doall.cljs$core$IFn$_invoke$arity$1(cljs.core.map.cljs$core$IFn$_invoke$arity$2(inner,form)); return (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(G__43942) : outer.call(null,G__43942)); } else { if(cljs.core.record_QMARK_(form)){ var G__43943 = cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (r,x){ return 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))); }),form,form); return (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(G__43943) : outer.call(null,G__43943)); } else { if(cljs.core.coll_QMARK_(form)){ var G__43944 = cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.empty(form),cljs.core.map.cljs$core$IFn$_invoke$arity$2(inner,form)); return (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(G__43944) : outer.call(null,G__43944)); } else { return (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(form) : outer.call(null,form)); } } } } } }); /** * Performs a depth-first, post-order traversal of form. Calls f on * each sub-form, uses f's return value in place of the original. * Recognizes all Clojure data structures. Consumes seqs as with doall. */ clojure.walk.postwalk = (function clojure$walk$postwalk(f,form){ return clojure.walk.walk(cljs.core.partial.cljs$core$IFn$_invoke$arity$2(clojure.walk.postwalk,f),f,form); }); /** * Like postwalk, but does pre-order traversal. */ clojure.walk.prewalk = (function clojure$walk$prewalk(f,form){ return 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))); }); /** * Recursively transforms all map keys from strings to keywords. */ clojure.walk.keywordize_keys = (function clojure$walk$keywordize_keys(m){ var f = (function (p__43955){ var vec__43956 = p__43955; var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__43956,(0),null); var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__43956,(1),null); if(typeof k === 'string'){ return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.keyword.cljs$core$IFn$_invoke$arity$1(k),v], null); } else { return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [k,v], null); } }); return clojure.walk.postwalk((function (x){ if(cljs.core.map_QMARK_(x)){ return cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentArrayMap.EMPTY,cljs.core.map.cljs$core$IFn$_invoke$arity$2(f,x)); } else { return x; } }),m); }); /** * Recursively transforms all map keys from keywords to strings. */ clojure.walk.stringify_keys = (function clojure$walk$stringify_keys(m){ var f = (function (p__43969){ var vec__43970 = p__43969; var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__43970,(0),null); var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__43970,(1),null); if((k instanceof cljs.core.Keyword)){ return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [cljs.core.name(k),v], null); } else { return new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [k,v], null); } }); return clojure.walk.postwalk((function (x){ if(cljs.core.map_QMARK_(x)){ return cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.PersistentArrayMap.EMPTY,cljs.core.map.cljs$core$IFn$_invoke$arity$2(f,x)); } else { return x; } }),m); }); /** * Recursively transforms form by replacing keys in smap with their * values. Like clojure/replace but works on any data structure. Does * replacement at the root of the tree first. */ clojure.walk.prewalk_replace = (function clojure$walk$prewalk_replace(smap,form){ return clojure.walk.prewalk((function (x){ if(cljs.core.contains_QMARK_(smap,x)){ return (smap.cljs$core$IFn$_invoke$arity$1 ? smap.cljs$core$IFn$_invoke$arity$1(x) : smap.call(null,x)); } else { return x; } }),form); }); /** * Recursively transforms form by replacing keys in smap with their * values. Like clojure/replace but works on any data structure. Does * replacement at the leaves of the tree first. */ clojure.walk.postwalk_replace = (function clojure$walk$postwalk_replace(smap,form){ return clojure.walk.postwalk((function (x){ if(cljs.core.contains_QMARK_(smap,x)){ return (smap.cljs$core$IFn$_invoke$arity$1 ? smap.cljs$core$IFn$_invoke$arity$1(x) : smap.call(null,x)); } else { return x; } }),form); }); //# sourceMappingURL=clojure.walk.js.map