better ui enhancments
This commit is contained in:
1 parent
e654fdfea6
commit
bfaa3bea7d
39 files changed
+1732
-1499
No files matched your search
+91
-91
@@ -6,8 +6,8 @@ clojure.set.bubble_max_key = (function clojure$set$bubble_max_key(k,coll){
|
||||
|
||||
var max = cljs.core.apply.cljs$core$IFn$_invoke$arity$3(cljs.core.max_key,k,coll);
|
||||
return cljs.core.cons(max,cljs.core.remove.cljs$core$IFn$_invoke$arity$2(((function (max){
|
||||
return (function (p1__14548_SHARP_){
|
||||
return (max === p1__14548_SHARP_);
|
||||
return (function (p1__14550_SHARP_){
|
||||
return (max === p1__14550_SHARP_);
|
||||
});})(max))
|
||||
,coll));
|
||||
});
|
||||
@@ -15,8 +15,8 @@ return (max === p1__14548_SHARP_);
|
||||
* Return a set that is the union of the input sets
|
||||
*/
|
||||
clojure.set.union = (function clojure$set$union(var_args){
|
||||
var G__14553 = arguments.length;
|
||||
switch (G__14553) {
|
||||
var G__14555 = arguments.length;
|
||||
switch (G__14555) {
|
||||
case 0:
|
||||
return clojure.set.union.cljs$core$IFn$_invoke$arity$0();
|
||||
|
||||
@@ -31,14 +31,14 @@ return clojure.set.union.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(argumen
|
||||
break;
|
||||
default:
|
||||
var args_arr__10084__auto__ = [];
|
||||
var len__10061__auto___14555 = arguments.length;
|
||||
var i__10062__auto___14556 = (0);
|
||||
var len__10061__auto___14557 = arguments.length;
|
||||
var i__10062__auto___14558 = (0);
|
||||
while(true){
|
||||
if((i__10062__auto___14556 < len__10061__auto___14555)){
|
||||
args_arr__10084__auto__.push((arguments[i__10062__auto___14556]));
|
||||
if((i__10062__auto___14558 < len__10061__auto___14557)){
|
||||
args_arr__10084__auto__.push((arguments[i__10062__auto___14558]));
|
||||
|
||||
var G__14557 = (i__10062__auto___14556 + (1));
|
||||
i__10062__auto___14556 = G__14557;
|
||||
var G__14559 = (i__10062__auto___14558 + (1));
|
||||
i__10062__auto___14558 = G__14559;
|
||||
continue;
|
||||
} else {
|
||||
}
|
||||
@@ -72,12 +72,12 @@ var bubbled_sets = clojure.set.bubble_max_key(cljs.core.count,cljs.core.conj.clj
|
||||
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.into,cljs.core.first(bubbled_sets),cljs.core.rest(bubbled_sets));
|
||||
});
|
||||
|
||||
clojure.set.union.cljs$lang$applyTo = (function (seq14550){
|
||||
var G__14551 = cljs.core.first(seq14550);
|
||||
var seq14550__$1 = cljs.core.next(seq14550);
|
||||
var G__14552 = cljs.core.first(seq14550__$1);
|
||||
var seq14550__$2 = cljs.core.next(seq14550__$1);
|
||||
return clojure.set.union.cljs$core$IFn$_invoke$arity$variadic(G__14551,G__14552,seq14550__$2);
|
||||
clojure.set.union.cljs$lang$applyTo = (function (seq14552){
|
||||
var G__14553 = cljs.core.first(seq14552);
|
||||
var seq14552__$1 = cljs.core.next(seq14552);
|
||||
var G__14554 = cljs.core.first(seq14552__$1);
|
||||
var seq14552__$2 = cljs.core.next(seq14552__$1);
|
||||
return clojure.set.union.cljs$core$IFn$_invoke$arity$variadic(G__14553,G__14554,seq14552__$2);
|
||||
});
|
||||
|
||||
clojure.set.union.cljs$lang$maxFixedArity = (2);
|
||||
@@ -86,8 +86,8 @@ clojure.set.union.cljs$lang$maxFixedArity = (2);
|
||||
* Return a set that is the intersection of the input sets
|
||||
*/
|
||||
clojure.set.intersection = (function clojure$set$intersection(var_args){
|
||||
var G__14563 = arguments.length;
|
||||
switch (G__14563) {
|
||||
var G__14565 = arguments.length;
|
||||
switch (G__14565) {
|
||||
case 1:
|
||||
return clojure.set.intersection.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
||||
|
||||
@@ -98,14 +98,14 @@ return clojure.set.intersection.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(
|
||||
break;
|
||||
default:
|
||||
var args_arr__10084__auto__ = [];
|
||||
var len__10061__auto___14565 = arguments.length;
|
||||
var i__10062__auto___14566 = (0);
|
||||
var len__10061__auto___14567 = arguments.length;
|
||||
var i__10062__auto___14568 = (0);
|
||||
while(true){
|
||||
if((i__10062__auto___14566 < len__10061__auto___14565)){
|
||||
args_arr__10084__auto__.push((arguments[i__10062__auto___14566]));
|
||||
if((i__10062__auto___14568 < len__10061__auto___14567)){
|
||||
args_arr__10084__auto__.push((arguments[i__10062__auto___14568]));
|
||||
|
||||
var G__14567 = (i__10062__auto___14566 + (1));
|
||||
i__10062__auto___14566 = G__14567;
|
||||
var G__14569 = (i__10062__auto___14568 + (1));
|
||||
i__10062__auto___14568 = G__14569;
|
||||
continue;
|
||||
} else {
|
||||
}
|
||||
@@ -125,10 +125,10 @@ return s1;
|
||||
clojure.set.intersection.cljs$core$IFn$_invoke$arity$2 = (function (s1,s2){
|
||||
while(true){
|
||||
if((cljs.core.count(s2) < cljs.core.count(s1))){
|
||||
var G__14568 = s2;
|
||||
var G__14569 = s1;
|
||||
s1 = G__14568;
|
||||
s2 = G__14569;
|
||||
var G__14570 = s2;
|
||||
var G__14571 = s1;
|
||||
s1 = G__14570;
|
||||
s2 = G__14571;
|
||||
continue;
|
||||
} else {
|
||||
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (s1,s2){
|
||||
@@ -146,18 +146,18 @@ break;
|
||||
});
|
||||
|
||||
clojure.set.intersection.cljs$core$IFn$_invoke$arity$variadic = (function (s1,s2,sets){
|
||||
var bubbled_sets = clojure.set.bubble_max_key((function (p1__14558_SHARP_){
|
||||
return (- cljs.core.count(p1__14558_SHARP_));
|
||||
var bubbled_sets = clojure.set.bubble_max_key((function (p1__14560_SHARP_){
|
||||
return (- cljs.core.count(p1__14560_SHARP_));
|
||||
}),cljs.core.conj.cljs$core$IFn$_invoke$arity$variadic(sets,s2,cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([s1], 0)));
|
||||
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(clojure.set.intersection,cljs.core.first(bubbled_sets),cljs.core.rest(bubbled_sets));
|
||||
});
|
||||
|
||||
clojure.set.intersection.cljs$lang$applyTo = (function (seq14560){
|
||||
var G__14561 = cljs.core.first(seq14560);
|
||||
var seq14560__$1 = cljs.core.next(seq14560);
|
||||
var G__14562 = cljs.core.first(seq14560__$1);
|
||||
var seq14560__$2 = cljs.core.next(seq14560__$1);
|
||||
return clojure.set.intersection.cljs$core$IFn$_invoke$arity$variadic(G__14561,G__14562,seq14560__$2);
|
||||
clojure.set.intersection.cljs$lang$applyTo = (function (seq14562){
|
||||
var G__14563 = cljs.core.first(seq14562);
|
||||
var seq14562__$1 = cljs.core.next(seq14562);
|
||||
var G__14564 = cljs.core.first(seq14562__$1);
|
||||
var seq14562__$2 = cljs.core.next(seq14562__$1);
|
||||
return clojure.set.intersection.cljs$core$IFn$_invoke$arity$variadic(G__14563,G__14564,seq14562__$2);
|
||||
});
|
||||
|
||||
clojure.set.intersection.cljs$lang$maxFixedArity = (2);
|
||||
@@ -166,8 +166,8 @@ clojure.set.intersection.cljs$lang$maxFixedArity = (2);
|
||||
* Return a set that is the first set without elements of the remaining sets
|
||||
*/
|
||||
clojure.set.difference = (function clojure$set$difference(var_args){
|
||||
var G__14574 = arguments.length;
|
||||
switch (G__14574) {
|
||||
var G__14576 = arguments.length;
|
||||
switch (G__14576) {
|
||||
case 1:
|
||||
return clojure.set.difference.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
||||
|
||||
@@ -178,14 +178,14 @@ return clojure.set.difference.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(ar
|
||||
break;
|
||||
default:
|
||||
var args_arr__10084__auto__ = [];
|
||||
var len__10061__auto___14576 = arguments.length;
|
||||
var i__10062__auto___14577 = (0);
|
||||
var len__10061__auto___14578 = arguments.length;
|
||||
var i__10062__auto___14579 = (0);
|
||||
while(true){
|
||||
if((i__10062__auto___14577 < len__10061__auto___14576)){
|
||||
args_arr__10084__auto__.push((arguments[i__10062__auto___14577]));
|
||||
if((i__10062__auto___14579 < len__10061__auto___14578)){
|
||||
args_arr__10084__auto__.push((arguments[i__10062__auto___14579]));
|
||||
|
||||
var G__14578 = (i__10062__auto___14577 + (1));
|
||||
i__10062__auto___14577 = G__14578;
|
||||
var G__14580 = (i__10062__auto___14579 + (1));
|
||||
i__10062__auto___14579 = G__14580;
|
||||
continue;
|
||||
} else {
|
||||
}
|
||||
@@ -220,12 +220,12 @@ clojure.set.difference.cljs$core$IFn$_invoke$arity$variadic = (function (s1,s2,s
|
||||
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(clojure.set.difference,s1,cljs.core.conj.cljs$core$IFn$_invoke$arity$2(sets,s2));
|
||||
});
|
||||
|
||||
clojure.set.difference.cljs$lang$applyTo = (function (seq14571){
|
||||
var G__14572 = cljs.core.first(seq14571);
|
||||
var seq14571__$1 = cljs.core.next(seq14571);
|
||||
var G__14573 = cljs.core.first(seq14571__$1);
|
||||
var seq14571__$2 = cljs.core.next(seq14571__$1);
|
||||
return clojure.set.difference.cljs$core$IFn$_invoke$arity$variadic(G__14572,G__14573,seq14571__$2);
|
||||
clojure.set.difference.cljs$lang$applyTo = (function (seq14573){
|
||||
var G__14574 = cljs.core.first(seq14573);
|
||||
var seq14573__$1 = cljs.core.next(seq14573);
|
||||
var G__14575 = cljs.core.first(seq14573__$1);
|
||||
var seq14573__$2 = cljs.core.next(seq14573__$1);
|
||||
return clojure.set.difference.cljs$core$IFn$_invoke$arity$variadic(G__14574,G__14575,seq14573__$2);
|
||||
});
|
||||
|
||||
clojure.set.difference.cljs$lang$maxFixedArity = (2);
|
||||
@@ -246,18 +246,18 @@ return cljs.core.disj.cljs$core$IFn$_invoke$arity$2(s,k);
|
||||
* Returns a rel of the elements of xrel with only the keys in ks
|
||||
*/
|
||||
clojure.set.project = (function clojure$set$project(xrel,ks){
|
||||
return cljs.core.set(cljs.core.map.cljs$core$IFn$_invoke$arity$2((function (p1__14579_SHARP_){
|
||||
return cljs.core.select_keys(p1__14579_SHARP_,ks);
|
||||
return cljs.core.set(cljs.core.map.cljs$core$IFn$_invoke$arity$2((function (p1__14581_SHARP_){
|
||||
return cljs.core.select_keys(p1__14581_SHARP_,ks);
|
||||
}),xrel));
|
||||
});
|
||||
/**
|
||||
* Returns the map with the keys in kmap renamed to the vals in kmap
|
||||
*/
|
||||
clojure.set.rename_keys = (function clojure$set$rename_keys(map,kmap){
|
||||
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (m,p__14580){
|
||||
var vec__14581 = p__14580;
|
||||
var old = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14581,(0),null);
|
||||
var new$ = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14581,(1),null);
|
||||
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (m,p__14582){
|
||||
var vec__14583 = p__14582;
|
||||
var old = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14583,(0),null);
|
||||
var new$ = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14583,(1),null);
|
||||
if(cljs.core.contains_QMARK_(map,old)){
|
||||
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,new$,cljs.core.get.cljs$core$IFn$_invoke$arity$2(map,old));
|
||||
} else {
|
||||
@@ -269,8 +269,8 @@ return m;
|
||||
* Returns a rel of the maps in xrel with the keys in kmap renamed to the vals in kmap
|
||||
*/
|
||||
clojure.set.rename = (function clojure$set$rename(xrel,kmap){
|
||||
return cljs.core.set(cljs.core.map.cljs$core$IFn$_invoke$arity$2((function (p1__14584_SHARP_){
|
||||
return clojure.set.rename_keys(p1__14584_SHARP_,kmap);
|
||||
return cljs.core.set(cljs.core.map.cljs$core$IFn$_invoke$arity$2((function (p1__14586_SHARP_){
|
||||
return clojure.set.rename_keys(p1__14586_SHARP_,kmap);
|
||||
}),xrel));
|
||||
});
|
||||
/**
|
||||
@@ -287,10 +287,10 @@ return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m,ik,cljs.core.conj.cljs$co
|
||||
* Returns the map with the vals mapped to the keys.
|
||||
*/
|
||||
clojure.set.map_invert = (function clojure$set$map_invert(m){
|
||||
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (m__$1,p__14585){
|
||||
var vec__14586 = p__14585;
|
||||
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14586,(0),null);
|
||||
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14586,(1),null);
|
||||
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (m__$1,p__14587){
|
||||
var vec__14588 = p__14587;
|
||||
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14588,(0),null);
|
||||
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14588,(1),null);
|
||||
return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m__$1,v,k);
|
||||
}),cljs.core.PersistentArrayMap.EMPTY,m);
|
||||
});
|
||||
@@ -300,8 +300,8 @@ return cljs.core.assoc.cljs$core$IFn$_invoke$arity$3(m__$1,v,k);
|
||||
* keys.
|
||||
*/
|
||||
clojure.set.join = (function clojure$set$join(var_args){
|
||||
var G__14594 = arguments.length;
|
||||
switch (G__14594) {
|
||||
var G__14596 = arguments.length;
|
||||
switch (G__14596) {
|
||||
case 2:
|
||||
return clojure.set.join.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
||||
|
||||
@@ -319,25 +319,25 @@ throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(
|
||||
clojure.set.join.cljs$core$IFn$_invoke$arity$2 = (function (xrel,yrel){
|
||||
if((cljs.core.seq(xrel)) && (cljs.core.seq(yrel))){
|
||||
var ks = clojure.set.intersection.cljs$core$IFn$_invoke$arity$2(cljs.core.set(cljs.core.keys(cljs.core.first(xrel))),cljs.core.set(cljs.core.keys(cljs.core.first(yrel))));
|
||||
var vec__14595 = (((cljs.core.count(xrel) <= cljs.core.count(yrel)))?new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [xrel,yrel], null):new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [yrel,xrel], null));
|
||||
var r = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14595,(0),null);
|
||||
var s = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14595,(1),null);
|
||||
var vec__14597 = (((cljs.core.count(xrel) <= cljs.core.count(yrel)))?new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [xrel,yrel], null):new cljs.core.PersistentVector(null, 2, 5, cljs.core.PersistentVector.EMPTY_NODE, [yrel,xrel], null));
|
||||
var r = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14597,(0),null);
|
||||
var s = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14597,(1),null);
|
||||
var idx = clojure.set.index(r,ks);
|
||||
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (ks,vec__14595,r,s,idx){
|
||||
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (ks,vec__14597,r,s,idx){
|
||||
return (function (ret,x){
|
||||
var found = (function (){var G__14598 = cljs.core.select_keys(x,ks);
|
||||
return (idx.cljs$core$IFn$_invoke$arity$1 ? idx.cljs$core$IFn$_invoke$arity$1(G__14598) : idx.call(null,G__14598));
|
||||
var found = (function (){var G__14600 = cljs.core.select_keys(x,ks);
|
||||
return (idx.cljs$core$IFn$_invoke$arity$1 ? idx.cljs$core$IFn$_invoke$arity$1(G__14600) : idx.call(null,G__14600));
|
||||
})();
|
||||
if(cljs.core.truth_(found)){
|
||||
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (found,ks,vec__14595,r,s,idx){
|
||||
return (function (p1__14589_SHARP_,p2__14590_SHARP_){
|
||||
return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__14589_SHARP_,cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([p2__14590_SHARP_,x], 0)));
|
||||
});})(found,ks,vec__14595,r,s,idx))
|
||||
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (found,ks,vec__14597,r,s,idx){
|
||||
return (function (p1__14591_SHARP_,p2__14592_SHARP_){
|
||||
return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__14591_SHARP_,cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([p2__14592_SHARP_,x], 0)));
|
||||
});})(found,ks,vec__14597,r,s,idx))
|
||||
,ret,found);
|
||||
} else {
|
||||
return ret;
|
||||
}
|
||||
});})(ks,vec__14595,r,s,idx))
|
||||
});})(ks,vec__14597,r,s,idx))
|
||||
,cljs.core.PersistentHashSet.EMPTY,s);
|
||||
} else {
|
||||
return cljs.core.PersistentHashSet.EMPTY;
|
||||
@@ -345,26 +345,26 @@ return cljs.core.PersistentHashSet.EMPTY;
|
||||
});
|
||||
|
||||
clojure.set.join.cljs$core$IFn$_invoke$arity$3 = (function (xrel,yrel,km){
|
||||
var vec__14599 = (((cljs.core.count(xrel) <= cljs.core.count(yrel)))?new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [xrel,yrel,clojure.set.map_invert(km)], null):new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [yrel,xrel,km], null));
|
||||
var r = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14599,(0),null);
|
||||
var s = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14599,(1),null);
|
||||
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14599,(2),null);
|
||||
var vec__14601 = (((cljs.core.count(xrel) <= cljs.core.count(yrel)))?new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [xrel,yrel,clojure.set.map_invert(km)], null):new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [yrel,xrel,km], null));
|
||||
var r = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14601,(0),null);
|
||||
var s = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14601,(1),null);
|
||||
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14601,(2),null);
|
||||
var idx = clojure.set.index(r,cljs.core.vals(k));
|
||||
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (vec__14599,r,s,k,idx){
|
||||
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (vec__14601,r,s,k,idx){
|
||||
return (function (ret,x){
|
||||
var found = (function (){var G__14602 = clojure.set.rename_keys(cljs.core.select_keys(x,cljs.core.keys(k)),k);
|
||||
return (idx.cljs$core$IFn$_invoke$arity$1 ? idx.cljs$core$IFn$_invoke$arity$1(G__14602) : idx.call(null,G__14602));
|
||||
var found = (function (){var G__14604 = clojure.set.rename_keys(cljs.core.select_keys(x,cljs.core.keys(k)),k);
|
||||
return (idx.cljs$core$IFn$_invoke$arity$1 ? idx.cljs$core$IFn$_invoke$arity$1(G__14604) : idx.call(null,G__14604));
|
||||
})();
|
||||
if(cljs.core.truth_(found)){
|
||||
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (found,vec__14599,r,s,k,idx){
|
||||
return (function (p1__14591_SHARP_,p2__14592_SHARP_){
|
||||
return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__14591_SHARP_,cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([p2__14592_SHARP_,x], 0)));
|
||||
});})(found,vec__14599,r,s,k,idx))
|
||||
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (found,vec__14601,r,s,k,idx){
|
||||
return (function (p1__14593_SHARP_,p2__14594_SHARP_){
|
||||
return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__14593_SHARP_,cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([p2__14594_SHARP_,x], 0)));
|
||||
});})(found,vec__14601,r,s,k,idx))
|
||||
,ret,found);
|
||||
} else {
|
||||
return ret;
|
||||
}
|
||||
});})(vec__14599,r,s,k,idx))
|
||||
});})(vec__14601,r,s,k,idx))
|
||||
,cljs.core.PersistentHashSet.EMPTY,s);
|
||||
});
|
||||
|
||||
@@ -374,15 +374,15 @@ clojure.set.join.cljs$lang$maxFixedArity = 3;
|
||||
* Is set1 a subset of set2?
|
||||
*/
|
||||
clojure.set.subset_QMARK_ = (function clojure$set$subset_QMARK_(set1,set2){
|
||||
return ((cljs.core.count(set1) <= cljs.core.count(set2))) && (cljs.core.every_QMARK_((function (p1__14604_SHARP_){
|
||||
return cljs.core.contains_QMARK_(set2,p1__14604_SHARP_);
|
||||
return ((cljs.core.count(set1) <= cljs.core.count(set2))) && (cljs.core.every_QMARK_((function (p1__14606_SHARP_){
|
||||
return cljs.core.contains_QMARK_(set2,p1__14606_SHARP_);
|
||||
}),set1));
|
||||
});
|
||||
/**
|
||||
* Is set1 a superset of set2?
|
||||
*/
|
||||
clojure.set.superset_QMARK_ = (function clojure$set$superset_QMARK_(set1,set2){
|
||||
return ((cljs.core.count(set1) >= cljs.core.count(set2))) && (cljs.core.every_QMARK_((function (p1__14605_SHARP_){
|
||||
return cljs.core.contains_QMARK_(set1,p1__14605_SHARP_);
|
||||
return ((cljs.core.count(set1) >= cljs.core.count(set2))) && (cljs.core.every_QMARK_((function (p1__14607_SHARP_){
|
||||
return cljs.core.contains_QMARK_(set1,p1__14607_SHARP_);
|
||||
}),set2));
|
||||
});
|
||||
+53
-53
@@ -15,44 +15,44 @@ clojure.string.reverse = (function clojure$string$reverse(s){
|
||||
return s.replace(clojure.string.re_surrogate_pair,"$2$1").split("").reverse().join("");
|
||||
});
|
||||
clojure.string.replace_all = (function clojure$string$replace_all(s,re,replacement){
|
||||
var r = (new RegExp(re.source,(function (){var G__14493 = "g";
|
||||
var G__14493__$1 = (cljs.core.truth_(re.ignoreCase)?[cljs.core.str.cljs$core$IFn$_invoke$arity$1(G__14493),"i"].join(''):G__14493);
|
||||
var G__14493__$2 = (cljs.core.truth_(re.multiline)?[cljs.core.str.cljs$core$IFn$_invoke$arity$1(G__14493__$1),"m"].join(''):G__14493__$1);
|
||||
var r = (new RegExp(re.source,(function (){var G__14495 = "g";
|
||||
var G__14495__$1 = (cljs.core.truth_(re.ignoreCase)?[cljs.core.str.cljs$core$IFn$_invoke$arity$1(G__14495),"i"].join(''):G__14495);
|
||||
var G__14495__$2 = (cljs.core.truth_(re.multiline)?[cljs.core.str.cljs$core$IFn$_invoke$arity$1(G__14495__$1),"m"].join(''):G__14495__$1);
|
||||
if(cljs.core.truth_(re.unicode)){
|
||||
return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(G__14493__$2),"u"].join('');
|
||||
return [cljs.core.str.cljs$core$IFn$_invoke$arity$1(G__14495__$2),"u"].join('');
|
||||
} else {
|
||||
return G__14493__$2;
|
||||
return G__14495__$2;
|
||||
}
|
||||
})()));
|
||||
return s.replace(r,replacement);
|
||||
});
|
||||
clojure.string.replace_with = (function clojure$string$replace_with(f){
|
||||
return (function() {
|
||||
var G__14496__delegate = function (args){
|
||||
var G__14498__delegate = function (args){
|
||||
var matches = cljs.core.drop_last.cljs$core$IFn$_invoke$arity$2((2),args);
|
||||
if(cljs.core._EQ_.cljs$core$IFn$_invoke$arity$2(cljs.core.count(matches),(1))){
|
||||
var G__14494 = cljs.core.first(matches);
|
||||
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__14494) : f.call(null,G__14494));
|
||||
var G__14496 = cljs.core.first(matches);
|
||||
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__14496) : f.call(null,G__14496));
|
||||
} else {
|
||||
var G__14495 = cljs.core.vec(matches);
|
||||
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__14495) : f.call(null,G__14495));
|
||||
var G__14497 = cljs.core.vec(matches);
|
||||
return (f.cljs$core$IFn$_invoke$arity$1 ? f.cljs$core$IFn$_invoke$arity$1(G__14497) : f.call(null,G__14497));
|
||||
}
|
||||
};
|
||||
var G__14496 = function (var_args){
|
||||
var G__14498 = function (var_args){
|
||||
var args = null;
|
||||
if (arguments.length > 0) {
|
||||
var G__14497__i = 0, G__14497__a = new Array(arguments.length - 0);
|
||||
while (G__14497__i < G__14497__a.length) {G__14497__a[G__14497__i] = arguments[G__14497__i + 0]; ++G__14497__i;}
|
||||
args = new cljs.core.IndexedSeq(G__14497__a,0,null);
|
||||
var G__14499__i = 0, G__14499__a = new Array(arguments.length - 0);
|
||||
while (G__14499__i < G__14499__a.length) {G__14499__a[G__14499__i] = arguments[G__14499__i + 0]; ++G__14499__i;}
|
||||
args = new cljs.core.IndexedSeq(G__14499__a,0,null);
|
||||
}
|
||||
return G__14496__delegate.call(this,args);};
|
||||
G__14496.cljs$lang$maxFixedArity = 0;
|
||||
G__14496.cljs$lang$applyTo = (function (arglist__14498){
|
||||
var args = cljs.core.seq(arglist__14498);
|
||||
return G__14496__delegate(args);
|
||||
return G__14498__delegate.call(this,args);};
|
||||
G__14498.cljs$lang$maxFixedArity = 0;
|
||||
G__14498.cljs$lang$applyTo = (function (arglist__14500){
|
||||
var args = cljs.core.seq(arglist__14500);
|
||||
return G__14498__delegate(args);
|
||||
});
|
||||
G__14496.cljs$core$IFn$_invoke$arity$variadic = G__14496__delegate;
|
||||
return G__14496;
|
||||
G__14498.cljs$core$IFn$_invoke$arity$variadic = G__14498__delegate;
|
||||
return G__14498;
|
||||
})()
|
||||
;
|
||||
});
|
||||
@@ -94,8 +94,8 @@ return s.replace(match,replacement);
|
||||
* separated by an optional separator.
|
||||
*/
|
||||
clojure.string.join = (function clojure$string$join(var_args){
|
||||
var G__14500 = arguments.length;
|
||||
switch (G__14500) {
|
||||
var G__14502 = arguments.length;
|
||||
switch (G__14502) {
|
||||
case 1:
|
||||
return clojure.string.join.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
||||
|
||||
@@ -115,10 +115,10 @@ var sb = (new goog.string.StringBuffer());
|
||||
var coll__$1 = cljs.core.seq(coll);
|
||||
while(true){
|
||||
if(!((coll__$1 == null))){
|
||||
var G__14502 = sb.append([cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.first(coll__$1))].join(''));
|
||||
var G__14503 = cljs.core.next(coll__$1);
|
||||
sb = G__14502;
|
||||
coll__$1 = G__14503;
|
||||
var G__14504 = sb.append([cljs.core.str.cljs$core$IFn$_invoke$arity$1(cljs.core.first(coll__$1))].join(''));
|
||||
var G__14505 = cljs.core.next(coll__$1);
|
||||
sb = G__14504;
|
||||
coll__$1 = G__14505;
|
||||
continue;
|
||||
} else {
|
||||
return sb.toString();
|
||||
@@ -140,10 +140,10 @@ if((coll__$2 == null)){
|
||||
sb.append(separator);
|
||||
}
|
||||
|
||||
var G__14504 = sb;
|
||||
var G__14505 = coll__$2;
|
||||
sb = G__14504;
|
||||
coll__$1 = G__14505;
|
||||
var G__14506 = sb;
|
||||
var G__14507 = coll__$2;
|
||||
sb = G__14506;
|
||||
coll__$1 = G__14507;
|
||||
continue;
|
||||
} else {
|
||||
return sb.toString();
|
||||
@@ -177,8 +177,8 @@ clojure.string.pop_last_while_empty = (function clojure$string$pop_last_while_em
|
||||
var v__$1 = v;
|
||||
while(true){
|
||||
if(("" === cljs.core.peek(v__$1))){
|
||||
var G__14506 = cljs.core.pop(v__$1);
|
||||
v__$1 = G__14506;
|
||||
var G__14508 = cljs.core.pop(v__$1);
|
||||
v__$1 = G__14508;
|
||||
continue;
|
||||
} else {
|
||||
return v__$1;
|
||||
@@ -197,12 +197,12 @@ clojure.string.split_with_empty_regex = (function clojure$string$split_with_empt
|
||||
if(((limit <= (0))) || ((limit >= ((2) + cljs.core.count(s))))){
|
||||
return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(cljs.core.vec(cljs.core.cons("",cljs.core.map.cljs$core$IFn$_invoke$arity$2(cljs.core.str,cljs.core.seq(s)))),"");
|
||||
} else {
|
||||
var pred__14507 = cljs.core._EQ__EQ_;
|
||||
var expr__14508 = limit;
|
||||
if(cljs.core.truth_((pred__14507.cljs$core$IFn$_invoke$arity$2 ? pred__14507.cljs$core$IFn$_invoke$arity$2((1),expr__14508) : pred__14507.call(null,(1),expr__14508)))){
|
||||
var pred__14509 = cljs.core._EQ__EQ_;
|
||||
var expr__14510 = limit;
|
||||
if(cljs.core.truth_((pred__14509.cljs$core$IFn$_invoke$arity$2 ? pred__14509.cljs$core$IFn$_invoke$arity$2((1),expr__14510) : pred__14509.call(null,(1),expr__14510)))){
|
||||
return (new cljs.core.PersistentVector(null,1,(5),cljs.core.PersistentVector.EMPTY_NODE,[s],null));
|
||||
} else {
|
||||
if(cljs.core.truth_((pred__14507.cljs$core$IFn$_invoke$arity$2 ? pred__14507.cljs$core$IFn$_invoke$arity$2((2),expr__14508) : pred__14507.call(null,(2),expr__14508)))){
|
||||
if(cljs.core.truth_((pred__14509.cljs$core$IFn$_invoke$arity$2 ? pred__14509.cljs$core$IFn$_invoke$arity$2((2),expr__14510) : pred__14509.call(null,(2),expr__14510)))){
|
||||
return (new cljs.core.PersistentVector(null,2,(5),cljs.core.PersistentVector.EMPTY_NODE,["",s],null));
|
||||
} else {
|
||||
var c = (limit - (2));
|
||||
@@ -216,8 +216,8 @@ return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(cljs.core.vec(cljs.core.cons
|
||||
* the maximum number of splits. Not lazy. Returns vector of the splits.
|
||||
*/
|
||||
clojure.string.split = (function clojure$string$split(var_args){
|
||||
var G__14511 = arguments.length;
|
||||
switch (G__14511) {
|
||||
var G__14513 = arguments.length;
|
||||
switch (G__14513) {
|
||||
case 2:
|
||||
return clojure.string.split.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
||||
|
||||
@@ -247,12 +247,12 @@ return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(parts,s__$1);
|
||||
var m = cljs.core.re_find(re,s__$1);
|
||||
if(!((m == null))){
|
||||
var index = s__$1.indexOf(m);
|
||||
var G__14513 = s__$1.substring((index + cljs.core.count(m)));
|
||||
var G__14514 = (limit__$1 - (1));
|
||||
var G__14515 = cljs.core.conj.cljs$core$IFn$_invoke$arity$2(parts,s__$1.substring((0),index));
|
||||
s__$1 = G__14513;
|
||||
limit__$1 = G__14514;
|
||||
parts = G__14515;
|
||||
var G__14515 = s__$1.substring((index + cljs.core.count(m)));
|
||||
var G__14516 = (limit__$1 - (1));
|
||||
var G__14517 = cljs.core.conj.cljs$core$IFn$_invoke$arity$2(parts,s__$1.substring((0),index));
|
||||
s__$1 = G__14515;
|
||||
limit__$1 = G__14516;
|
||||
parts = G__14517;
|
||||
continue;
|
||||
} else {
|
||||
return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(parts,s__$1);
|
||||
@@ -303,8 +303,8 @@ return "";
|
||||
} else {
|
||||
var ch = cljs.core.get.cljs$core$IFn$_invoke$arity$2(s,(index - (1)));
|
||||
if((("\n" === ch)) || (("\r" === ch))){
|
||||
var G__14516 = (index - (1));
|
||||
index = G__14516;
|
||||
var G__14518 = (index - (1));
|
||||
index = G__14518;
|
||||
continue;
|
||||
} else {
|
||||
return s.substring((0),index);
|
||||
@@ -342,8 +342,8 @@ buffer.append([cljs.core.str.cljs$core$IFn$_invoke$arity$1(replacement)].join(''
|
||||
buffer.append(ch);
|
||||
}
|
||||
|
||||
var G__14517 = (index + (1));
|
||||
index = G__14517;
|
||||
var G__14519 = (index + (1));
|
||||
index = G__14519;
|
||||
continue;
|
||||
}
|
||||
break;
|
||||
@@ -354,8 +354,8 @@ break;
|
||||
* forward from from-index or nil if not found.
|
||||
*/
|
||||
clojure.string.index_of = (function clojure$string$index_of(var_args){
|
||||
var G__14519 = arguments.length;
|
||||
switch (G__14519) {
|
||||
var G__14521 = arguments.length;
|
||||
switch (G__14521) {
|
||||
case 2:
|
||||
return clojure.string.index_of.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
||||
|
||||
@@ -395,8 +395,8 @@ clojure.string.index_of.cljs$lang$maxFixedArity = 3;
|
||||
* searching backward from from-index or nil if not found.
|
||||
*/
|
||||
clojure.string.last_index_of = (function clojure$string$last_index_of(var_args){
|
||||
var G__14522 = arguments.length;
|
||||
switch (G__14522) {
|
||||
var G__14524 = arguments.length;
|
||||
switch (G__14524) {
|
||||
case 2:
|
||||
return clojure.string.last_index_of.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
||||
|
||||
|
||||
+21
-21
@@ -10,23 +10,23 @@ goog.require('cljs.core.constants');
|
||||
*/
|
||||
clojure.walk.walk = (function clojure$walk$walk(inner,outer,form){
|
||||
if(cljs.core.list_QMARK_(form)){
|
||||
var G__14824 = 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__14824) : outer.call(null,G__14824));
|
||||
} else {
|
||||
if(cljs.core.seq_QMARK_(form)){
|
||||
var G__14825 = 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__14825) : outer.call(null,G__14825));
|
||||
} else {
|
||||
if(cljs.core.record_QMARK_(form)){
|
||||
var G__14826 = 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);
|
||||
var G__14826 = 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__14826) : outer.call(null,G__14826));
|
||||
} else {
|
||||
if(cljs.core.coll_QMARK_(form)){
|
||||
var G__14827 = cljs.core.into.cljs$core$IFn$_invoke$arity$2(cljs.core.empty(form),cljs.core.map.cljs$core$IFn$_invoke$arity$2(inner,form));
|
||||
if(cljs.core.seq_QMARK_(form)){
|
||||
var G__14827 = 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__14827) : outer.call(null,G__14827));
|
||||
} else {
|
||||
if(cljs.core.record_QMARK_(form)){
|
||||
var G__14828 = 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__14828) : outer.call(null,G__14828));
|
||||
} else {
|
||||
if(cljs.core.coll_QMARK_(form)){
|
||||
var G__14829 = 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__14829) : outer.call(null,G__14829));
|
||||
} else {
|
||||
return (outer.cljs$core$IFn$_invoke$arity$1 ? outer.cljs$core$IFn$_invoke$arity$1(form) : outer.call(null,form));
|
||||
|
||||
}
|
||||
@@ -52,10 +52,10 @@ return clojure.walk.walk(cljs.core.partial.cljs$core$IFn$_invoke$arity$2(clojure
|
||||
* Recursively transforms all map keys from strings to keywords.
|
||||
*/
|
||||
clojure.walk.keywordize_keys = (function clojure$walk$keywordize_keys(m){
|
||||
var f = (function (p__14828){
|
||||
var vec__14829 = p__14828;
|
||||
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14829,(0),null);
|
||||
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14829,(1),null);
|
||||
var f = (function (p__14830){
|
||||
var vec__14831 = p__14830;
|
||||
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14831,(0),null);
|
||||
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14831,(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 {
|
||||
@@ -76,10 +76,10 @@ return x;
|
||||
* Recursively transforms all map keys from keywords to strings.
|
||||
*/
|
||||
clojure.walk.stringify_keys = (function clojure$walk$stringify_keys(m){
|
||||
var f = (function (p__14832){
|
||||
var vec__14833 = p__14832;
|
||||
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14833,(0),null);
|
||||
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14833,(1),null);
|
||||
var f = (function (p__14834){
|
||||
var vec__14835 = p__14834;
|
||||
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14835,(0),null);
|
||||
var v = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__14835,(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 {
|
||||
|
||||
Reference in new issue
Block a user