akko/nothoughts
1
0
Fork 0
Code Issues 7 Pull Requests Projects Releases Wiki Activity

pair programming

Browse Source
This commit is contained in:
Akko
2025-02-06 19:47:55 +01:00
parent 71f708ff8c
commit 8cf6e78a79
210 changed files with 16744 additions and 16728 deletions
Download Patch File Download Diff File Expand all files Collapse all files

158
public/js/cljs-runtime/clojure.set.js
View File

@@ -2,16 +2,16 @@ goog.provide('clojure.set');
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 (p1__19722_SHARP_){
return (max === p1__19722_SHARP_);
return cljs.core.cons(max,cljs.core.remove.cljs$core$IFn$_invoke$arity$2((function (p1__19775_SHARP_){
return (max === p1__19775_SHARP_);
}),coll));
});
/**
* Return a set that is the union of the input sets
*/
clojure.set.union = (function clojure$set$union(var_args){
var G__19735 = arguments.length;
switch (G__19735) {
var G__19784 = arguments.length;
switch (G__19784) {
case 0:
return clojure.set.union.cljs$core$IFn$_invoke$arity$0();
@@ -26,14 +26,14 @@ return clojure.set.union.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(argumen
break;
default:
var args_arr__5751__auto__ = [];
var len__5726__auto___19881 = arguments.length;
var i__5727__auto___19882 = (0);
var len__5726__auto___19904 = arguments.length;
var i__5727__auto___19905 = (0);
while(true){
if((i__5727__auto___19882 < len__5726__auto___19881)){
args_arr__5751__auto__.push((arguments[i__5727__auto___19882]));
if((i__5727__auto___19905 < len__5726__auto___19904)){
args_arr__5751__auto__.push((arguments[i__5727__auto___19905]));
var G__19883 = (i__5727__auto___19882 + (1));
i__5727__auto___19882 = G__19883;
var G__19908 = (i__5727__auto___19905 + (1));
i__5727__auto___19905 = G__19908;
continue;
} else {
}
@@ -68,13 +68,13 @@ return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(cljs.core.into,cljs.core.f
}));
/** @this {Function} */
(clojure.set.union.cljs$lang$applyTo = (function (seq19731){
var G__19732 = cljs.core.first(seq19731);
var seq19731__$1 = cljs.core.next(seq19731);
var G__19733 = cljs.core.first(seq19731__$1);
var seq19731__$2 = cljs.core.next(seq19731__$1);
(clojure.set.union.cljs$lang$applyTo = (function (seq19781){
var G__19782 = cljs.core.first(seq19781);
var seq19781__$1 = cljs.core.next(seq19781);
var G__19783 = cljs.core.first(seq19781__$1);
var seq19781__$2 = cljs.core.next(seq19781__$1);
var self__5711__auto__ = this;
return self__5711__auto__.cljs$core$IFn$_invoke$arity$variadic(G__19732,G__19733,seq19731__$2);
return self__5711__auto__.cljs$core$IFn$_invoke$arity$variadic(G__19782,G__19783,seq19781__$2);
}));
(clojure.set.union.cljs$lang$maxFixedArity = (2));
@@ -83,8 +83,8 @@ return self__5711__auto__.cljs$core$IFn$_invoke$arity$variadic(G__19732,G__19733
* Return a set that is the intersection of the input sets
*/
clojure.set.intersection = (function clojure$set$intersection(var_args){
var G__19759 = arguments.length;
switch (G__19759) {
var G__19805 = arguments.length;
switch (G__19805) {
case 1:
return clojure.set.intersection.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
@@ -95,14 +95,14 @@ return clojure.set.intersection.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(
break;
default:
var args_arr__5751__auto__ = [];
var len__5726__auto___19895 = arguments.length;
var i__5727__auto___19896 = (0);
var len__5726__auto___19920 = arguments.length;
var i__5727__auto___19921 = (0);
while(true){
if((i__5727__auto___19896 < len__5726__auto___19895)){
args_arr__5751__auto__.push((arguments[i__5727__auto___19896]));
if((i__5727__auto___19921 < len__5726__auto___19920)){
args_arr__5751__auto__.push((arguments[i__5727__auto___19921]));
var G__19898 = (i__5727__auto___19896 + (1));
i__5727__auto___19896 = G__19898;
var G__19922 = (i__5727__auto___19921 + (1));
i__5727__auto___19921 = G__19922;
continue;
} else {
}
@@ -122,10 +122,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__19905 = s2;
var G__19906 = s1;
s1 = G__19905;
s2 = G__19906;
var G__19930 = s2;
var G__19931 = s1;
s1 = G__19930;
s2 = G__19931;
continue;
} else {
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(((function (s1,s2){
@@ -143,20 +143,20 @@ break;
}));
(clojure.set.intersection.cljs$core$IFn$_invoke$arity$variadic = (function (s1,s2,sets){
var bubbled_sets = clojure.set.bubble_max_key((function (p1__19750_SHARP_){
return (- cljs.core.count(p1__19750_SHARP_));
var bubbled_sets = clojure.set.bubble_max_key((function (p1__19799_SHARP_){
return (- cljs.core.count(p1__19799_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));
}));
/** @this {Function} */
(clojure.set.intersection.cljs$lang$applyTo = (function (seq19752){
var G__19753 = cljs.core.first(seq19752);
var seq19752__$1 = cljs.core.next(seq19752);
var G__19754 = cljs.core.first(seq19752__$1);
var seq19752__$2 = cljs.core.next(seq19752__$1);
(clojure.set.intersection.cljs$lang$applyTo = (function (seq19802){
var G__19803 = cljs.core.first(seq19802);
var seq19802__$1 = cljs.core.next(seq19802);
var G__19804 = cljs.core.first(seq19802__$1);
var seq19802__$2 = cljs.core.next(seq19802__$1);
var self__5711__auto__ = this;
return self__5711__auto__.cljs$core$IFn$_invoke$arity$variadic(G__19753,G__19754,seq19752__$2);
return self__5711__auto__.cljs$core$IFn$_invoke$arity$variadic(G__19803,G__19804,seq19802__$2);
}));
(clojure.set.intersection.cljs$lang$maxFixedArity = (2));
@@ -165,8 +165,8 @@ return self__5711__auto__.cljs$core$IFn$_invoke$arity$variadic(G__19753,G__19754
* 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__19786 = arguments.length;
switch (G__19786) {
var G__19818 = arguments.length;
switch (G__19818) {
case 1:
return clojure.set.difference.cljs$core$IFn$_invoke$arity$1((arguments[(0)]));
@@ -177,14 +177,14 @@ return clojure.set.difference.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(ar
break;
default:
var args_arr__5751__auto__ = [];
var len__5726__auto___19917 = arguments.length;
var i__5727__auto___19918 = (0);
var len__5726__auto___19940 = arguments.length;
var i__5727__auto___19941 = (0);
while(true){
if((i__5727__auto___19918 < len__5726__auto___19917)){
args_arr__5751__auto__.push((arguments[i__5727__auto___19918]));
if((i__5727__auto___19941 < len__5726__auto___19940)){
args_arr__5751__auto__.push((arguments[i__5727__auto___19941]));
var G__19920 = (i__5727__auto___19918 + (1));
i__5727__auto___19918 = G__19920;
var G__19942 = (i__5727__auto___19941 + (1));
i__5727__auto___19941 = G__19942;
continue;
} else {
}
@@ -220,13 +220,13 @@ return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3(clojure.set.difference,s1,
}));
/** @this {Function} */
(clojure.set.difference.cljs$lang$applyTo = (function (seq19783){
var G__19784 = cljs.core.first(seq19783);
var seq19783__$1 = cljs.core.next(seq19783);
var G__19785 = cljs.core.first(seq19783__$1);
var seq19783__$2 = cljs.core.next(seq19783__$1);
(clojure.set.difference.cljs$lang$applyTo = (function (seq19815){
var G__19816 = cljs.core.first(seq19815);
var seq19815__$1 = cljs.core.next(seq19815);
var G__19817 = cljs.core.first(seq19815__$1);
var seq19815__$2 = cljs.core.next(seq19815__$1);
var self__5711__auto__ = this;
return self__5711__auto__.cljs$core$IFn$_invoke$arity$variadic(G__19784,G__19785,seq19783__$2);
return self__5711__auto__.cljs$core$IFn$_invoke$arity$variadic(G__19816,G__19817,seq19815__$2);
}));
(clojure.set.difference.cljs$lang$maxFixedArity = (2));
@@ -247,18 +247,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__19805_SHARP_){
return cljs.core.select_keys(p1__19805_SHARP_,ks);
return cljs.core.set(cljs.core.map.cljs$core$IFn$_invoke$arity$2((function (p1__19828_SHARP_){
return cljs.core.select_keys(p1__19828_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__19811){
var vec__19812 = p__19811;
var old = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__19812,(0),null);
var new$ = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__19812,(1),null);
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (m,p__19835){
var vec__19836 = p__19835;
var old = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__19836,(0),null);
var new$ = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__19836,(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 {
@@ -270,8 +270,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__19816_SHARP_){
return clojure.set.rename_keys(p1__19816_SHARP_,kmap);
return cljs.core.set(cljs.core.map.cljs$core$IFn$_invoke$arity$2((function (p1__19846_SHARP_){
return clojure.set.rename_keys(p1__19846_SHARP_,kmap);
}),xrel));
});
/**
@@ -298,8 +298,8 @@ return cljs.core.assoc_BANG_.cljs$core$IFn$_invoke$arity$3(m__$1,v,k);
* keys.
*/
clojure.set.join = (function clojure$set$join(var_args){
var G__19832 = arguments.length;
switch (G__19832) {
var G__19864 = arguments.length;
switch (G__19864) {
case 2:
return clojure.set.join.cljs$core$IFn$_invoke$arity$2((arguments[(0)]),(arguments[(1)]));
@@ -317,17 +317,17 @@ 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__19836 = (((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__19836,(0),null);
var s = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__19836,(1),null);
var vec__19870 = (((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__19870,(0),null);
var s = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__19870,(1),null);
var idx = clojure.set.index(r,ks);
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (ret,x){
var found = (function (){var G__19841 = cljs.core.select_keys(x,ks);
return (idx.cljs$core$IFn$_invoke$arity$1 ? idx.cljs$core$IFn$_invoke$arity$1(G__19841) : idx.call(null, G__19841));
var found = (function (){var G__19879 = cljs.core.select_keys(x,ks);
return (idx.cljs$core$IFn$_invoke$arity$1 ? idx.cljs$core$IFn$_invoke$arity$1(G__19879) : idx.call(null, G__19879));
})();
if(cljs.core.truth_(found)){
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (p1__19825_SHARP_,p2__19826_SHARP_){
return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__19825_SHARP_,cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([p2__19826_SHARP_,x], 0)));
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (p1__19856_SHARP_,p2__19857_SHARP_){
return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__19856_SHARP_,cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([p2__19857_SHARP_,x], 0)));
}),ret,found);
} else {
return ret;
@@ -339,18 +339,18 @@ return cljs.core.PersistentHashSet.EMPTY;
}));
(clojure.set.join.cljs$core$IFn$_invoke$arity$3 = (function (xrel,yrel,km){
var vec__19850 = (((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__19850,(0),null);
var s = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__19850,(1),null);
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__19850,(2),null);
var vec__19880 = (((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__19880,(0),null);
var s = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__19880,(1),null);
var k = cljs.core.nth.cljs$core$IFn$_invoke$arity$3(vec__19880,(2),null);
var idx = clojure.set.index(r,cljs.core.vals(k));
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (ret,x){
var found = (function (){var G__19853 = 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__19853) : idx.call(null, G__19853));
var found = (function (){var G__19884 = 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__19884) : idx.call(null, G__19884));
})();
if(cljs.core.truth_(found)){
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (p1__19827_SHARP_,p2__19828_SHARP_){
return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__19827_SHARP_,cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([p2__19828_SHARP_,x], 0)));
return cljs.core.reduce.cljs$core$IFn$_invoke$arity$3((function (p1__19858_SHARP_,p2__19860_SHARP_){
return cljs.core.conj.cljs$core$IFn$_invoke$arity$2(p1__19858_SHARP_,cljs.core.merge.cljs$core$IFn$_invoke$arity$variadic(cljs.core.prim_seq.cljs$core$IFn$_invoke$arity$2([p2__19860_SHARP_,x], 0)));
}),ret,found);
} else {
return ret;
@@ -364,16 +364,16 @@ return ret;
* 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__19858_SHARP_){
return cljs.core.contains_QMARK_(set2,p1__19858_SHARP_);
return (((cljs.core.count(set1) <= cljs.core.count(set2))) && (cljs.core.every_QMARK_((function (p1__19886_SHARP_){
return cljs.core.contains_QMARK_(set2,p1__19886_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__19872_SHARP_){
return cljs.core.contains_QMARK_(set1,p1__19872_SHARP_);
return (((cljs.core.count(set1) >= cljs.core.count(set2))) && (cljs.core.every_QMARK_((function (p1__19890_SHARP_){
return cljs.core.contains_QMARK_(set1,p1__19890_SHARP_);
}),set2)));
});