392 lines
14 KiB
JavaScript
392 lines
14 KiB
JavaScript
// Compiled by ClojureScript 1.10.520 {}
|
|
goog.provide('clojure.set');
|
|
goog.require('cljs.core');
|
|
clojure.set.bubble_max_key = (function clojure$set$bubble_max_key(k,coll){
|
|
|
|
var max = cljs.core.apply.call(null,cljs.core.max_key,k,coll);
|
|
return cljs.core.cons.call(null,max,cljs.core.remove.call(null,((function (max){
|
|
return (function (p1__27597_SHARP_){
|
|
return (max === p1__27597_SHARP_);
|
|
});})(max))
|
|
,coll));
|
|
});
|
|
/**
|
|
* Return a set that is the union of the input sets
|
|
*/
|
|
clojure.set.union = (function clojure$set$union(var_args){
|
|
var G__27602 = arguments.length;
|
|
switch (G__27602) {
|
|
case 0:
|
|
return clojure.set.union.cljs$core$IFn$_invoke$arity$0();
|
|
|
|
break;
|
|
case 1:
|
|
return clojure.set.union.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return clojure.set.union.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4751__auto__ = [];
|
|
var len__4730__auto___27604 = arguments.length;
|
|
var i__4731__auto___27605 = (0);
|
|
while(true){
|
|
if((i__4731__auto___27605 < len__4730__auto___27604)){
|
|
args_arr__4751__auto__.push((arguments[i__4731__auto___27605]));
|
|
|
|
var G__27606 = (i__4731__auto___27605 + (1));
|
|
i__4731__auto___27605 = G__27606;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4752__auto__ = (new cljs.core.IndexedSeq(args_arr__4751__auto__.slice((2)),(0),null));
|
|
return clojure.set.union.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4752__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
clojure.set.union.cljs$core$IFn$_invoke$arity$0 = (function (){
|
|
return cljs.core.PersistentHashSet.EMPTY;
|
|
});
|
|
|
|
clojure.set.union.cljs$core$IFn$_invoke$arity$1 = (function (s1){
|
|
return s1;
|
|
});
|
|
|
|
clojure.set.union.cljs$core$IFn$_invoke$arity$2 = (function (s1,s2){
|
|
if((cljs.core.count.call(null,s1) < cljs.core.count.call(null,s2))){
|
|
return cljs.core.reduce.call(null,cljs.core.conj,s2,s1);
|
|
} else {
|
|
return cljs.core.reduce.call(null,cljs.core.conj,s1,s2);
|
|
}
|
|
});
|
|
|
|
clojure.set.union.cljs$core$IFn$_invoke$arity$variadic = (function (s1,s2,sets){
|
|
var bubbled_sets = clojure.set.bubble_max_key.call(null,cljs.core.count,cljs.core.conj.call(null,sets,s2,s1));
|
|
return cljs.core.reduce.call(null,cljs.core.into,cljs.core.first.call(null,bubbled_sets),cljs.core.rest.call(null,bubbled_sets));
|
|
});
|
|
|
|
/** @this {Function} */
|
|
clojure.set.union.cljs$lang$applyTo = (function (seq27599){
|
|
var G__27600 = cljs.core.first.call(null,seq27599);
|
|
var seq27599__$1 = cljs.core.next.call(null,seq27599);
|
|
var G__27601 = cljs.core.first.call(null,seq27599__$1);
|
|
var seq27599__$2 = cljs.core.next.call(null,seq27599__$1);
|
|
var self__4717__auto__ = this;
|
|
return self__4717__auto__.cljs$core$IFn$_invoke$arity$variadic(G__27600,G__27601,seq27599__$2);
|
|
});
|
|
|
|
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__27612 = arguments.length;
|
|
switch (G__27612) {
|
|
case 1:
|
|
return clojure.set.intersection.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return clojure.set.intersection.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4751__auto__ = [];
|
|
var len__4730__auto___27614 = arguments.length;
|
|
var i__4731__auto___27615 = (0);
|
|
while(true){
|
|
if((i__4731__auto___27615 < len__4730__auto___27614)){
|
|
args_arr__4751__auto__.push((arguments[i__4731__auto___27615]));
|
|
|
|
var G__27616 = (i__4731__auto___27615 + (1));
|
|
i__4731__auto___27615 = G__27616;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4752__auto__ = (new cljs.core.IndexedSeq(args_arr__4751__auto__.slice((2)),(0),null));
|
|
return clojure.set.intersection.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4752__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
clojure.set.intersection.cljs$core$IFn$_invoke$arity$1 = (function (s1){
|
|
return s1;
|
|
});
|
|
|
|
clojure.set.intersection.cljs$core$IFn$_invoke$arity$2 = (function (s1,s2){
|
|
while(true){
|
|
if((cljs.core.count.call(null,s2) < cljs.core.count.call(null,s1))){
|
|
var G__27617 = s2;
|
|
var G__27618 = s1;
|
|
s1 = G__27617;
|
|
s2 = G__27618;
|
|
continue;
|
|
} else {
|
|
return cljs.core.reduce.call(null,((function (s1,s2){
|
|
return (function (result,item){
|
|
if(cljs.core.contains_QMARK_.call(null,s2,item)){
|
|
return result;
|
|
} else {
|
|
return cljs.core.disj.call(null,result,item);
|
|
}
|
|
});})(s1,s2))
|
|
,s1,s1);
|
|
}
|
|
break;
|
|
}
|
|
});
|
|
|
|
clojure.set.intersection.cljs$core$IFn$_invoke$arity$variadic = (function (s1,s2,sets){
|
|
var bubbled_sets = clojure.set.bubble_max_key.call(null,(function (p1__27607_SHARP_){
|
|
return (- cljs.core.count.call(null,p1__27607_SHARP_));
|
|
}),cljs.core.conj.call(null,sets,s2,s1));
|
|
return cljs.core.reduce.call(null,clojure.set.intersection,cljs.core.first.call(null,bubbled_sets),cljs.core.rest.call(null,bubbled_sets));
|
|
});
|
|
|
|
/** @this {Function} */
|
|
clojure.set.intersection.cljs$lang$applyTo = (function (seq27609){
|
|
var G__27610 = cljs.core.first.call(null,seq27609);
|
|
var seq27609__$1 = cljs.core.next.call(null,seq27609);
|
|
var G__27611 = cljs.core.first.call(null,seq27609__$1);
|
|
var seq27609__$2 = cljs.core.next.call(null,seq27609__$1);
|
|
var self__4717__auto__ = this;
|
|
return self__4717__auto__.cljs$core$IFn$_invoke$arity$variadic(G__27610,G__27611,seq27609__$2);
|
|
});
|
|
|
|
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__27623 = arguments.length;
|
|
switch (G__27623) {
|
|
case 1:
|
|
return clojure.set.difference.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
|
|
|
|
break;
|
|
case 2:
|
|
return clojure.set.difference.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
default:
|
|
var args_arr__4751__auto__ = [];
|
|
var len__4730__auto___27625 = arguments.length;
|
|
var i__4731__auto___27626 = (0);
|
|
while(true){
|
|
if((i__4731__auto___27626 < len__4730__auto___27625)){
|
|
args_arr__4751__auto__.push((arguments[i__4731__auto___27626]));
|
|
|
|
var G__27627 = (i__4731__auto___27626 + (1));
|
|
i__4731__auto___27626 = G__27627;
|
|
continue;
|
|
} else {
|
|
}
|
|
break;
|
|
}
|
|
|
|
var argseq__4752__auto__ = (new cljs.core.IndexedSeq(args_arr__4751__auto__.slice((2)),(0),null));
|
|
return clojure.set.difference.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__4752__auto__);
|
|
|
|
}
|
|
});
|
|
|
|
clojure.set.difference.cljs$core$IFn$_invoke$arity$1 = (function (s1){
|
|
return s1;
|
|
});
|
|
|
|
clojure.set.difference.cljs$core$IFn$_invoke$arity$2 = (function (s1,s2){
|
|
if((cljs.core.count.call(null,s1) < cljs.core.count.call(null,s2))){
|
|
return cljs.core.reduce.call(null,(function (result,item){
|
|
if(cljs.core.contains_QMARK_.call(null,s2,item)){
|
|
return cljs.core.disj.call(null,result,item);
|
|
} else {
|
|
return result;
|
|
}
|
|
}),s1,s1);
|
|
} else {
|
|
return cljs.core.reduce.call(null,cljs.core.disj,s1,s2);
|
|
}
|
|
});
|
|
|
|
clojure.set.difference.cljs$core$IFn$_invoke$arity$variadic = (function (s1,s2,sets){
|
|
return cljs.core.reduce.call(null,clojure.set.difference,s1,cljs.core.conj.call(null,sets,s2));
|
|
});
|
|
|
|
/** @this {Function} */
|
|
clojure.set.difference.cljs$lang$applyTo = (function (seq27620){
|
|
var G__27621 = cljs.core.first.call(null,seq27620);
|
|
var seq27620__$1 = cljs.core.next.call(null,seq27620);
|
|
var G__27622 = cljs.core.first.call(null,seq27620__$1);
|
|
var seq27620__$2 = cljs.core.next.call(null,seq27620__$1);
|
|
var self__4717__auto__ = this;
|
|
return self__4717__auto__.cljs$core$IFn$_invoke$arity$variadic(G__27621,G__27622,seq27620__$2);
|
|
});
|
|
|
|
clojure.set.difference.cljs$lang$maxFixedArity = (2);
|
|
|
|
/**
|
|
* Returns a set of the elements for which pred is true
|
|
*/
|
|
clojure.set.select = (function clojure$set$select(pred,xset){
|
|
return cljs.core.reduce.call(null,(function (s,k){
|
|
if(cljs.core.truth_(pred.call(null,k))){
|
|
return s;
|
|
} else {
|
|
return cljs.core.disj.call(null,s,k);
|
|
}
|
|
}),xset,xset);
|
|
});
|
|
/**
|
|
* 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.call(null,cljs.core.map.call(null,(function (p1__27628_SHARP_){
|
|
return cljs.core.select_keys.call(null,p1__27628_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.call(null,(function (m,p__27629){
|
|
var vec__27630 = p__27629;
|
|
var old = cljs.core.nth.call(null,vec__27630,(0),null);
|
|
var new$ = cljs.core.nth.call(null,vec__27630,(1),null);
|
|
if(cljs.core.contains_QMARK_.call(null,map,old)){
|
|
return cljs.core.assoc.call(null,m,new$,cljs.core.get.call(null,map,old));
|
|
} else {
|
|
return m;
|
|
}
|
|
}),cljs.core.apply.call(null,cljs.core.dissoc,map,cljs.core.keys.call(null,kmap)),kmap);
|
|
});
|
|
/**
|
|
* 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.call(null,cljs.core.map.call(null,(function (p1__27633_SHARP_){
|
|
return clojure.set.rename_keys.call(null,p1__27633_SHARP_,kmap);
|
|
}),xrel));
|
|
});
|
|
/**
|
|
* Returns a map of the distinct values of ks in the xrel mapped to a
|
|
* set of the maps in xrel with the corresponding values of ks.
|
|
*/
|
|
clojure.set.index = (function clojure$set$index(xrel,ks){
|
|
return cljs.core.reduce.call(null,(function (m,x){
|
|
var ik = cljs.core.select_keys.call(null,x,ks);
|
|
return cljs.core.assoc.call(null,m,ik,cljs.core.conj.call(null,cljs.core.get.call(null,m,ik,cljs.core.PersistentHashSet.EMPTY),x));
|
|
}),cljs.core.PersistentArrayMap.EMPTY,xrel);
|
|
});
|
|
/**
|
|
* Returns the map with the vals mapped to the keys.
|
|
*/
|
|
clojure.set.map_invert = (function clojure$set$map_invert(m){
|
|
return cljs.core.reduce.call(null,(function (m__$1,p__27634){
|
|
var vec__27635 = p__27634;
|
|
var k = cljs.core.nth.call(null,vec__27635,(0),null);
|
|
var v = cljs.core.nth.call(null,vec__27635,(1),null);
|
|
return cljs.core.assoc.call(null,m__$1,v,k);
|
|
}),cljs.core.PersistentArrayMap.EMPTY,m);
|
|
});
|
|
/**
|
|
* When passed 2 rels, returns the rel corresponding to the natural
|
|
* join. When passed an additional keymap, joins on the corresponding
|
|
* keys.
|
|
*/
|
|
clojure.set.join = (function clojure$set$join(var_args){
|
|
var G__27643 = arguments.length;
|
|
switch (G__27643) {
|
|
case 2:
|
|
return clojure.set.join.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
|
|
|
|
break;
|
|
case 3:
|
|
return clojure.set.join.cljs$core$IFn$_invoke$arity$3((arguments[(0)]),(arguments[(1)]),(arguments[(2)]));
|
|
|
|
break;
|
|
default:
|
|
throw (new Error(["Invalid arity: ",cljs.core.str.cljs$core$IFn$_invoke$arity$1(arguments.length)].join('')));
|
|
|
|
}
|
|
});
|
|
|
|
clojure.set.join.cljs$core$IFn$_invoke$arity$2 = (function (xrel,yrel){
|
|
if(((cljs.core.seq.call(null,xrel)) && (cljs.core.seq.call(null,yrel)))){
|
|
var ks = clojure.set.intersection.call(null,cljs.core.set.call(null,cljs.core.keys.call(null,cljs.core.first.call(null,xrel))),cljs.core.set.call(null,cljs.core.keys.call(null,cljs.core.first.call(null,yrel))));
|
|
var vec__27644 = (((cljs.core.count.call(null,xrel) <= cljs.core.count.call(null,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.call(null,vec__27644,(0),null);
|
|
var s = cljs.core.nth.call(null,vec__27644,(1),null);
|
|
var idx = clojure.set.index.call(null,r,ks);
|
|
return cljs.core.reduce.call(null,((function (ks,vec__27644,r,s,idx){
|
|
return (function (ret,x){
|
|
var found = idx.call(null,cljs.core.select_keys.call(null,x,ks));
|
|
if(cljs.core.truth_(found)){
|
|
return cljs.core.reduce.call(null,((function (found,ks,vec__27644,r,s,idx){
|
|
return (function (p1__27638_SHARP_,p2__27639_SHARP_){
|
|
return cljs.core.conj.call(null,p1__27638_SHARP_,cljs.core.merge.call(null,p2__27639_SHARP_,x));
|
|
});})(found,ks,vec__27644,r,s,idx))
|
|
,ret,found);
|
|
} else {
|
|
return ret;
|
|
}
|
|
});})(ks,vec__27644,r,s,idx))
|
|
,cljs.core.PersistentHashSet.EMPTY,s);
|
|
} else {
|
|
return cljs.core.PersistentHashSet.EMPTY;
|
|
}
|
|
});
|
|
|
|
clojure.set.join.cljs$core$IFn$_invoke$arity$3 = (function (xrel,yrel,km){
|
|
var vec__27647 = (((cljs.core.count.call(null,xrel) <= cljs.core.count.call(null,yrel)))?new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [xrel,yrel,clojure.set.map_invert.call(null,km)], null):new cljs.core.PersistentVector(null, 3, 5, cljs.core.PersistentVector.EMPTY_NODE, [yrel,xrel,km], null));
|
|
var r = cljs.core.nth.call(null,vec__27647,(0),null);
|
|
var s = cljs.core.nth.call(null,vec__27647,(1),null);
|
|
var k = cljs.core.nth.call(null,vec__27647,(2),null);
|
|
var idx = clojure.set.index.call(null,r,cljs.core.vals.call(null,k));
|
|
return cljs.core.reduce.call(null,((function (vec__27647,r,s,k,idx){
|
|
return (function (ret,x){
|
|
var found = idx.call(null,clojure.set.rename_keys.call(null,cljs.core.select_keys.call(null,x,cljs.core.keys.call(null,k)),k));
|
|
if(cljs.core.truth_(found)){
|
|
return cljs.core.reduce.call(null,((function (found,vec__27647,r,s,k,idx){
|
|
return (function (p1__27640_SHARP_,p2__27641_SHARP_){
|
|
return cljs.core.conj.call(null,p1__27640_SHARP_,cljs.core.merge.call(null,p2__27641_SHARP_,x));
|
|
});})(found,vec__27647,r,s,k,idx))
|
|
,ret,found);
|
|
} else {
|
|
return ret;
|
|
}
|
|
});})(vec__27647,r,s,k,idx))
|
|
,cljs.core.PersistentHashSet.EMPTY,s);
|
|
});
|
|
|
|
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.call(null,set1) <= cljs.core.count.call(null,set2))) && (cljs.core.every_QMARK_.call(null,(function (p1__27651_SHARP_){
|
|
return cljs.core.contains_QMARK_.call(null,set2,p1__27651_SHARP_);
|
|
}),set1)));
|
|
});
|
|
/**
|
|
* Is set1 a superset of set2?
|
|
*/
|
|
clojure.set.superset_QMARK_ = (function clojure$set$superset_QMARK_(set1,set2){
|
|
return (((cljs.core.count.call(null,set1) >= cljs.core.count.call(null,set2))) && (cljs.core.every_QMARK_.call(null,(function (p1__27652_SHARP_){
|
|
return cljs.core.contains_QMARK_.call(null,set1,p1__27652_SHARP_);
|
|
}),set2)));
|
|
});
|
|
|
|
//# sourceMappingURL=set.js.map?rel=1582560150099
|