// Compiled by ClojureScript 1.9.473 {} 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__7981_SHARP_){ return (max === p1__7981_SHARP_); });})(max)) ,coll)); }); /** * Return a set that is the union of the input sets */ clojure.set.union = (function clojure$set$union(var_args){ var args7982 = []; var len__7927__auto___7988 = arguments.length; var i__7928__auto___7989 = (0); while(true){ if((i__7928__auto___7989 < len__7927__auto___7988)){ args7982.push((arguments[i__7928__auto___7989])); var G__7990 = (i__7928__auto___7989 + (1)); i__7928__auto___7989 = G__7990; continue; } else { } break; } var G__7987 = args7982.length; switch (G__7987) { 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 argseq__7946__auto__ = (new cljs.core.IndexedSeq(args7982.slice((2)),(0),null)); return clojure.set.union.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__7946__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)); }); clojure.set.union.cljs$lang$applyTo = (function (seq7983){ var G__7984 = cljs.core.first.call(null,seq7983); var seq7983__$1 = cljs.core.next.call(null,seq7983); var G__7985 = cljs.core.first.call(null,seq7983__$1); var seq7983__$2 = cljs.core.next.call(null,seq7983__$1); return clojure.set.union.cljs$core$IFn$_invoke$arity$variadic(G__7984,G__7985,seq7983__$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 args7993 = []; var len__7927__auto___7999 = arguments.length; var i__7928__auto___8000 = (0); while(true){ if((i__7928__auto___8000 < len__7927__auto___7999)){ args7993.push((arguments[i__7928__auto___8000])); var G__8001 = (i__7928__auto___8000 + (1)); i__7928__auto___8000 = G__8001; continue; } else { } break; } var G__7998 = args7993.length; switch (G__7998) { 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 argseq__7946__auto__ = (new cljs.core.IndexedSeq(args7993.slice((2)),(0),null)); return clojure.set.intersection.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__7946__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__8003 = s2; var G__8004 = s1; s1 = G__8003; s2 = G__8004; 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__7992_SHARP_){ return (- cljs.core.count.call(null,p1__7992_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)); }); clojure.set.intersection.cljs$lang$applyTo = (function (seq7994){ var G__7995 = cljs.core.first.call(null,seq7994); var seq7994__$1 = cljs.core.next.call(null,seq7994); var G__7996 = cljs.core.first.call(null,seq7994__$1); var seq7994__$2 = cljs.core.next.call(null,seq7994__$1); return clojure.set.intersection.cljs$core$IFn$_invoke$arity$variadic(G__7995,G__7996,seq7994__$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 args8005 = []; var len__7927__auto___8011 = arguments.length; var i__7928__auto___8012 = (0); while(true){ if((i__7928__auto___8012 < len__7927__auto___8011)){ args8005.push((arguments[i__7928__auto___8012])); var G__8013 = (i__7928__auto___8012 + (1)); i__7928__auto___8012 = G__8013; continue; } else { } break; } var G__8010 = args8005.length; switch (G__8010) { 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 argseq__7946__auto__ = (new cljs.core.IndexedSeq(args8005.slice((2)),(0),null)); return clojure.set.difference.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__7946__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)); }); clojure.set.difference.cljs$lang$applyTo = (function (seq8006){ var G__8007 = cljs.core.first.call(null,seq8006); var seq8006__$1 = cljs.core.next.call(null,seq8006); var G__8008 = cljs.core.first.call(null,seq8006__$1); var seq8006__$2 = cljs.core.next.call(null,seq8006__$1); return clojure.set.difference.cljs$core$IFn$_invoke$arity$variadic(G__8007,G__8008,seq8006__$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__8015_SHARP_){ return cljs.core.select_keys.call(null,p1__8015_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__8020){ var vec__8021 = p__8020; var old = cljs.core.nth.call(null,vec__8021,(0),null); var new$ = cljs.core.nth.call(null,vec__8021,(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__8024_SHARP_){ return clojure.set.rename_keys.call(null,p1__8024_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__8029){ var vec__8030 = p__8029; var k = cljs.core.nth.call(null,vec__8030,(0),null); var v = cljs.core.nth.call(null,vec__8030,(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 args8037 = []; var len__7927__auto___8046 = arguments.length; var i__7928__auto___8047 = (0); while(true){ if((i__7928__auto___8047 < len__7927__auto___8046)){ args8037.push((arguments[i__7928__auto___8047])); var G__8048 = (i__7928__auto___8047 + (1)); i__7928__auto___8047 = G__8048; continue; } else { } break; } var G__8039 = args8037.length; switch (G__8039) { 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([cljs.core.str.cljs$core$IFn$_invoke$arity$1("Invalid arity: "),cljs.core.str.cljs$core$IFn$_invoke$arity$1(args8037.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__8040 = (((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__8040,(0),null); var s = cljs.core.nth.call(null,vec__8040,(1),null); var idx = clojure.set.index.call(null,r,ks); return cljs.core.reduce.call(null,((function (ks,vec__8040,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__8040,r,s,idx){ return (function (p1__8033_SHARP_,p2__8034_SHARP_){ return cljs.core.conj.call(null,p1__8033_SHARP_,cljs.core.merge.call(null,p2__8034_SHARP_,x)); });})(found,ks,vec__8040,r,s,idx)) ,ret,found); } else { return ret; } });})(ks,vec__8040,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__8043 = (((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__8043,(0),null); var s = cljs.core.nth.call(null,vec__8043,(1),null); var k = cljs.core.nth.call(null,vec__8043,(2),null); var idx = clojure.set.index.call(null,r,cljs.core.vals.call(null,k)); return cljs.core.reduce.call(null,((function (vec__8043,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__8043,r,s,k,idx){ return (function (p1__8035_SHARP_,p2__8036_SHARP_){ return cljs.core.conj.call(null,p1__8035_SHARP_,cljs.core.merge.call(null,p2__8036_SHARP_,x)); });})(found,vec__8043,r,s,k,idx)) ,ret,found); } else { return ret; } });})(vec__8043,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__8050_SHARP_){ return cljs.core.contains_QMARK_.call(null,set2,p1__8050_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__8051_SHARP_){ return cljs.core.contains_QMARK_.call(null,set1,p1__8051_SHARP_); }),set2)); }); //# sourceMappingURL=set.js.map