// Compiled by ClojureScript 1.9.293 {} 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__24037_SHARP_){ return (max === p1__24037_SHARP_); });})(max)) ,coll)); }); /** * Return a set that is the union of the input sets */ clojure.set.union = (function clojure$set$union(var_args){ var args24038 = []; var len__16327__auto___24044 = arguments.length; var i__16328__auto___24045 = (0); while(true){ if((i__16328__auto___24045 < len__16327__auto___24044)){ args24038.push((arguments[i__16328__auto___24045])); var G__24046 = (i__16328__auto___24045 + (1)); i__16328__auto___24045 = G__24046; continue; } else { } break; } var G__24043 = args24038.length; switch (G__24043) { 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__16346__auto__ = (new cljs.core.IndexedSeq(args24038.slice((2)),(0),null)); return clojure.set.union.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__16346__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 (seq24039){ var G__24040 = cljs.core.first.call(null,seq24039); var seq24039__$1 = cljs.core.next.call(null,seq24039); var G__24041 = cljs.core.first.call(null,seq24039__$1); var seq24039__$2 = cljs.core.next.call(null,seq24039__$1); return clojure.set.union.cljs$core$IFn$_invoke$arity$variadic(G__24040,G__24041,seq24039__$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 args24049 = []; var len__16327__auto___24055 = arguments.length; var i__16328__auto___24056 = (0); while(true){ if((i__16328__auto___24056 < len__16327__auto___24055)){ args24049.push((arguments[i__16328__auto___24056])); var G__24057 = (i__16328__auto___24056 + (1)); i__16328__auto___24056 = G__24057; continue; } else { } break; } var G__24054 = args24049.length; switch (G__24054) { 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__16346__auto__ = (new cljs.core.IndexedSeq(args24049.slice((2)),(0),null)); return clojure.set.intersection.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__16346__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__24059 = s2; var G__24060 = s1; s1 = G__24059; s2 = G__24060; 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__24048_SHARP_){ return (- cljs.core.count.call(null,p1__24048_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 (seq24050){ var G__24051 = cljs.core.first.call(null,seq24050); var seq24050__$1 = cljs.core.next.call(null,seq24050); var G__24052 = cljs.core.first.call(null,seq24050__$1); var seq24050__$2 = cljs.core.next.call(null,seq24050__$1); return clojure.set.intersection.cljs$core$IFn$_invoke$arity$variadic(G__24051,G__24052,seq24050__$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 args24061 = []; var len__16327__auto___24067 = arguments.length; var i__16328__auto___24068 = (0); while(true){ if((i__16328__auto___24068 < len__16327__auto___24067)){ args24061.push((arguments[i__16328__auto___24068])); var G__24069 = (i__16328__auto___24068 + (1)); i__16328__auto___24068 = G__24069; continue; } else { } break; } var G__24066 = args24061.length; switch (G__24066) { 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__16346__auto__ = (new cljs.core.IndexedSeq(args24061.slice((2)),(0),null)); return clojure.set.difference.cljs$core$IFn$_invoke$arity$variadic((arguments[(0)]),(arguments[(1)]),argseq__16346__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 (seq24062){ var G__24063 = cljs.core.first.call(null,seq24062); var seq24062__$1 = cljs.core.next.call(null,seq24062); var G__24064 = cljs.core.first.call(null,seq24062__$1); var seq24062__$2 = cljs.core.next.call(null,seq24062__$1); return clojure.set.difference.cljs$core$IFn$_invoke$arity$variadic(G__24063,G__24064,seq24062__$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__24071_SHARP_){ return cljs.core.select_keys.call(null,p1__24071_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__24076){ var vec__24077 = p__24076; var old = cljs.core.nth.call(null,vec__24077,(0),null); var new$ = cljs.core.nth.call(null,vec__24077,(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__24080_SHARP_){ return clojure.set.rename_keys.call(null,p1__24080_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__24085){ var vec__24086 = p__24085; var k = cljs.core.nth.call(null,vec__24086,(0),null); var v = cljs.core.nth.call(null,vec__24086,(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 args24093 = []; var len__16327__auto___24102 = arguments.length; var i__16328__auto___24103 = (0); while(true){ if((i__16328__auto___24103 < len__16327__auto___24102)){ args24093.push((arguments[i__16328__auto___24103])); var G__24104 = (i__16328__auto___24103 + (1)); i__16328__auto___24103 = G__24104; continue; } else { } break; } var G__24095 = args24093.length; switch (G__24095) { 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("Invalid arity: "),cljs.core.str(args24093.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__24096 = (((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__24096,(0),null); var s = cljs.core.nth.call(null,vec__24096,(1),null); var idx = clojure.set.index.call(null,r,ks); return cljs.core.reduce.call(null,((function (ks,vec__24096,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__24096,r,s,idx){ return (function (p1__24089_SHARP_,p2__24090_SHARP_){ return cljs.core.conj.call(null,p1__24089_SHARP_,cljs.core.merge.call(null,p2__24090_SHARP_,x)); });})(found,ks,vec__24096,r,s,idx)) ,ret,found); } else { return ret; } });})(ks,vec__24096,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__24099 = (((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__24099,(0),null); var s = cljs.core.nth.call(null,vec__24099,(1),null); var k = cljs.core.nth.call(null,vec__24099,(2),null); var idx = clojure.set.index.call(null,r,cljs.core.vals.call(null,k)); return cljs.core.reduce.call(null,((function (vec__24099,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__24099,r,s,k,idx){ return (function (p1__24091_SHARP_,p2__24092_SHARP_){ return cljs.core.conj.call(null,p1__24091_SHARP_,cljs.core.merge.call(null,p2__24092_SHARP_,x)); });})(found,vec__24099,r,s,k,idx)) ,ret,found); } else { return ret; } });})(vec__24099,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__24106_SHARP_){ return cljs.core.contains_QMARK_.call(null,set2,p1__24106_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__24107_SHARP_){ return cljs.core.contains_QMARK_.call(null,set1,p1__24107_SHARP_); }),set2)); }); //# sourceMappingURL=set.js.map