@explorable-viz/fluid 0.7.75 → 0.7.76
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +1 -1
- package/dist/fluid/fluid/lib/convolution.fld +27 -12
- package/dist/fluid/shared/fluid.mjs +231 -143
- package/dist/fluid/shared/load-figure.js +229 -149
- package/package.json +2 -1
- package/script/bundle-website.sh +3 -5
@@ -156,6 +156,14 @@ var intercalate = function(separator) {
|
|
156
156
|
var showString = { show: showStringImpl };
|
157
157
|
var showNumber = { show: showNumberImpl };
|
158
158
|
var showInt = { show: showIntImpl };
|
159
|
+
var showBoolean = {
|
160
|
+
show: (v) => {
|
161
|
+
if (v) {
|
162
|
+
return "true";
|
163
|
+
}
|
164
|
+
return "false";
|
165
|
+
}
|
166
|
+
};
|
159
167
|
|
160
168
|
// output-es/Data.Generic.Rep/index.js
|
161
169
|
var $NoArguments = () => ({ tag: "NoArguments" });
|
@@ -11581,17 +11589,21 @@ var showEdgeList = (es) => joinWith("\n")([
|
|
11581
11589
|
"digraph G {",
|
11582
11590
|
...arrayMap((v) => " " + v)([
|
11583
11591
|
"rankdir = RL",
|
11584
|
-
...arrayMap((v) => v._1 + " -> {" + joinWith(", ")(fromFoldable5(map(ordString)(unsafeCoerce)(v._2))) + "}")(fromFoldable13(reverse2(es)))
|
11592
|
+
...arrayMap((v) => v._1 + " -> {" + joinWith(", ")(fromFoldable5(map(ordString)(unsafeCoerce)(v._2._1))) + "}")(fromFoldable13(reverse2(es)))
|
11585
11593
|
]),
|
11586
11594
|
"}"
|
11587
11595
|
]);
|
11596
|
+
var pack1 = (x) => (k) => k(showString)(x);
|
11588
11597
|
var toEdgeList = (dictGraph) => (g) => {
|
11589
11598
|
const $0 = (v) => {
|
11590
11599
|
if (v._1.tag === "Nil") {
|
11591
11600
|
return $Step("Done", v._2);
|
11592
11601
|
}
|
11593
11602
|
if (v._1.tag === "Cons") {
|
11594
|
-
return $Step(
|
11603
|
+
return $Step(
|
11604
|
+
"Loop",
|
11605
|
+
$Tuple(v._1._2, $List("Cons", $Tuple(v._1._1, $Tuple(dictGraph.outN(g)(v._1._1), pack1(""))), v._2))
|
11606
|
+
);
|
11595
11607
|
}
|
11596
11608
|
fail();
|
11597
11609
|
};
|
@@ -11879,14 +11891,15 @@ var $GraphImpl = (_1) => ({ tag: "GraphImpl", _1 });
|
|
11879
11891
|
var eqSet2 = { eq: (v) => (v1) => eqMap(eqVertex)(eqUnit).eq(v)(v1) };
|
11880
11892
|
var eq = /* @__PURE__ */ (() => eqObject(eqSet2).eq)();
|
11881
11893
|
var fromFoldable7 = /* @__PURE__ */ foldlArray((m) => (a) => insert(ordVertex)(a)()(m))(Leaf2);
|
11894
|
+
var pack = (x) => (k) => k(showString)(x);
|
11882
11895
|
var toUnfoldable6 = /* @__PURE__ */ toUnfoldable4(unfoldableList);
|
11883
11896
|
var fromFoldable15 = /* @__PURE__ */ (() => foldableSet.foldr(Cons)(Nil))();
|
11884
11897
|
var fromFoldable23 = /* @__PURE__ */ (() => foldableSet.foldl((m) => (a) => insert(ordVertex)(a)()(m))(Leaf2))();
|
11885
11898
|
var toUnfoldable12 = /* @__PURE__ */ toAscUnfoldable(unfoldableArray);
|
11886
11899
|
var fromFoldable32 = /* @__PURE__ */ fromFoldable(ordVertex)(foldableArray);
|
11887
11900
|
var verticesGraphImpl = { vertices: (v) => v._1.vertices };
|
11888
|
-
var eqGraphImpl = { eq: (v) => (v1) => eq(v._1.out)(v1._1.out) };
|
11889
|
-
var sinks$p = (m) => fromFoldable7(arrayMap((x) => x._1)(filter((x) => x._2.tag === "Leaf")(toArrayWithKey(Tuple)(m))));
|
11901
|
+
var eqGraphImpl = { eq: (v) => (v1) => eq(_fmapObject(v._1.out, fst))(_fmapObject(v1._1.out, fst)) };
|
11902
|
+
var sinks$p = (m) => fromFoldable7(arrayMap((x) => x._1)(filter((x) => x._2._1.tag === "Leaf")(toArrayWithKey(Tuple)(m))));
|
11890
11903
|
var init4 = (\u03B1s) => () => {
|
11891
11904
|
const obj = {};
|
11892
11905
|
return monadRecST.tailRecM((v) => {
|
@@ -11898,7 +11911,7 @@ var init4 = (\u03B1s) => () => {
|
|
11898
11911
|
const $1 = v._1._2;
|
11899
11912
|
const $2 = v._2;
|
11900
11913
|
return () => {
|
11901
|
-
$2[$0] = Leaf2;
|
11914
|
+
$2[$0] = $Tuple(Leaf2, pack("uninit: init"));
|
11902
11915
|
return $Step("Loop", $Tuple($1, $2));
|
11903
11916
|
};
|
11904
11917
|
}
|
@@ -11934,7 +11947,7 @@ var addIfMissing = (acc) => (v) => {
|
|
11934
11947
|
return () => {
|
11935
11948
|
const v1 = $0();
|
11936
11949
|
if (v1.tag === "Nothing") {
|
11937
|
-
acc[v] = Leaf2;
|
11950
|
+
acc[v] = $Tuple(Leaf2, pack("uninit: missing"));
|
11938
11951
|
return acc;
|
11939
11952
|
}
|
11940
11953
|
if (v1.tag === "Just") {
|
@@ -11968,27 +11981,28 @@ var outMap = (\u03B1s) => (es) => {
|
|
11968
11981
|
if (v._1.tag === "Cons") {
|
11969
11982
|
const $1 = v._2;
|
11970
11983
|
const $2 = v._1._2;
|
11971
|
-
const $3 = v._1._1.
|
11972
|
-
const $4 = v._1._1.
|
11973
|
-
const $5 =
|
11984
|
+
const $3 = v._1._1._2._2;
|
11985
|
+
const $4 = v._1._1._1;
|
11986
|
+
const $5 = v._1._1._2._1;
|
11987
|
+
const $6 = peek($4)($1);
|
11974
11988
|
return () => {
|
11975
|
-
const $
|
11989
|
+
const $7 = $6();
|
11976
11990
|
if ((() => {
|
11977
|
-
if ($
|
11991
|
+
if ($7.tag === "Nothing") {
|
11978
11992
|
return true;
|
11979
11993
|
}
|
11980
|
-
if ($
|
11981
|
-
return eqMap(eqVertex)(eqUnit).eq($
|
11994
|
+
if ($7.tag === "Just") {
|
11995
|
+
return eqMap(eqVertex)(eqUnit).eq($7._1._1)(Leaf2);
|
11982
11996
|
}
|
11983
11997
|
fail();
|
11984
11998
|
})()) {
|
11985
|
-
const \u03B2s$p = toUnfoldable6($
|
11999
|
+
const \u03B2s$p = toUnfoldable6($5);
|
11986
12000
|
monadRecST.tailRecM(assertPresent($1))(\u03B2s$p)();
|
11987
|
-
$1[$
|
12001
|
+
$1[$4] = $Tuple($5, $3);
|
11988
12002
|
const acc$p = addIfMissing$p(\u03B2s$p)($1)();
|
11989
12003
|
return $Step("Loop", $Tuple($2, acc$p));
|
11990
12004
|
}
|
11991
|
-
return throwException(error("Duplicate edge list entry for " + showStringImpl($
|
12005
|
+
return throwException(error("Duplicate edge list entry for " + showStringImpl($4)))()();
|
11992
12006
|
};
|
11993
12007
|
}
|
11994
12008
|
fail();
|
@@ -12005,37 +12019,38 @@ var inMap = (\u03B1s) => (es) => {
|
|
12005
12019
|
}
|
12006
12020
|
if (v._1.tag === "Cons") {
|
12007
12021
|
const $1 = v._1._2;
|
12008
|
-
const $2 = v._1._1.
|
12009
|
-
const $3 =
|
12010
|
-
|
12011
|
-
|
12022
|
+
const $2 = v._1._1._2._2;
|
12023
|
+
const $3 = v._1._1._1;
|
12024
|
+
const $4 = monadRecST.tailRecM((v2) => {
|
12025
|
+
if (v2._1.tag === "Nil") {
|
12026
|
+
return () => $Step("Done", v2._2);
|
12012
12027
|
}
|
12013
|
-
if (
|
12014
|
-
const $
|
12015
|
-
const $
|
12016
|
-
const $
|
12017
|
-
const $
|
12028
|
+
if (v2._1.tag === "Cons") {
|
12029
|
+
const $42 = v2._2;
|
12030
|
+
const $5 = v2._1._1;
|
12031
|
+
const $6 = v2._1._2;
|
12032
|
+
const $7 = peek($5)($42);
|
12018
12033
|
return () => {
|
12019
|
-
const v1
|
12034
|
+
const v1 = $7();
|
12020
12035
|
const acc$p = (() => {
|
12021
|
-
if (v1
|
12022
|
-
$
|
12023
|
-
return $
|
12036
|
+
if (v1.tag === "Nothing") {
|
12037
|
+
$42[$5] = $Tuple($$$Map("Two", Leaf2, $3, void 0, Leaf2), $2);
|
12038
|
+
return $42;
|
12024
12039
|
}
|
12025
|
-
if (v1
|
12026
|
-
$
|
12027
|
-
return $
|
12040
|
+
if (v1.tag === "Just") {
|
12041
|
+
$42[$5] = $Tuple(insert(ordVertex)($3)()(v1._1._1), $2);
|
12042
|
+
return $42;
|
12028
12043
|
}
|
12029
12044
|
fail();
|
12030
12045
|
})();
|
12031
|
-
return $Step("Loop", $Tuple($
|
12046
|
+
return $Step("Loop", $Tuple($6, acc$p));
|
12032
12047
|
};
|
12033
12048
|
}
|
12034
12049
|
fail();
|
12035
|
-
})($Tuple(toUnfoldable6(v._1._1._2), v._2));
|
12050
|
+
})($Tuple(toUnfoldable6(v._1._1._2._1), v._2));
|
12036
12051
|
return () => {
|
12037
|
-
const a = $
|
12038
|
-
const acc$p = addIfMissing(a)($
|
12052
|
+
const a = $4();
|
12053
|
+
const acc$p = addIfMissing(a)($3)();
|
12039
12054
|
return $Step("Loop", $Tuple($1, acc$p));
|
12040
12055
|
};
|
12041
12056
|
}
|
@@ -12044,7 +12059,8 @@ var inMap = (\u03B1s) => (es) => {
|
|
12044
12059
|
};
|
12045
12060
|
};
|
12046
12061
|
var graphGraphImpl = {
|
12047
|
-
outN: (v) => (\u03B1) => definitely("in graph")(_lookup(Nothing, Just, \u03B1, v._1.out)),
|
12062
|
+
outN: (v) => (\u03B1) => definitely("in graph")(_lookup(Nothing, Just, \u03B1, v._1.out))._1,
|
12063
|
+
vertexData: (v) => (\u03B1) => definitely("in graph")(_lookup(Nothing, Just, \u03B1, v._1.out))._2,
|
12048
12064
|
inN: (g) => graphGraphImpl.outN(graphGraphImpl.op(g)),
|
12049
12065
|
elem: (\u03B1) => (v) => {
|
12050
12066
|
const $0 = _lookup(Nothing, Just, \u03B1, v._1.out);
|
@@ -12083,7 +12099,7 @@ var graphGraphImpl = {
|
|
12083
12099
|
topologicalSort: (v) => reverse2(topologicalSort(ordVertex)(fromFoldable32(arrayMap((x) => $Tuple(
|
12084
12100
|
x._1,
|
12085
12101
|
$Tuple(void 0, x._2)
|
12086
|
-
))(toUnfoldable12(_fmapObject(v._1.out, toUnfoldable6)))))),
|
12102
|
+
))(toUnfoldable12(_fmapObject(_fmapObject(v._1.out, fst), toUnfoldable6)))))),
|
12087
12103
|
Eq0: () => eqGraphImpl,
|
12088
12104
|
Vertices1: () => verticesGraphImpl
|
12089
12105
|
};
|
@@ -12115,8 +12131,8 @@ var monadWithGraphWithGraphT = (dictMonad) => {
|
|
12115
12131
|
const $1 = monadStateStateT(dictMonad);
|
12116
12132
|
const monadStateT2 = { Applicative0: () => applicativeStateT(dictMonad), Bind1: () => bindStateT(dictMonad) };
|
12117
12133
|
return {
|
12118
|
-
extend: (\u03B1) => (\u03B1s) => {
|
12119
|
-
const $2 = Cons($Tuple(\u03B1, \u03B1s));
|
12134
|
+
extend: (\u03B1) => (\u03B1s) => (vd) => {
|
12135
|
+
const $2 = Cons($Tuple(\u03B1, $Tuple(\u03B1s, vd)));
|
12120
12136
|
const $3 = $1.state((s) => $Tuple(void 0, $2(s)));
|
12121
12137
|
return (s) => $0.map((v1) => $Tuple(void 0, v1._2))($3(s));
|
12122
12138
|
},
|
@@ -12178,10 +12194,10 @@ var runWithGraphT = (dictMonad) => {
|
|
12178
12194
|
};
|
12179
12195
|
};
|
12180
12196
|
var runWithGraphT_spy = (dictMonad) => {
|
12181
|
-
const
|
12197
|
+
const runWithGraphT1 = runWithGraphT(dictMonad);
|
12182
12198
|
const spyFunWhenM2 = spyFunWhenM(dictMonad.Bind1().Apply0().Functor0());
|
12183
12199
|
return (dictGraph) => {
|
12184
|
-
const $0 =
|
12200
|
+
const $0 = runWithGraphT1(dictGraph);
|
12185
12201
|
const $1 = spyFunWhenM2(false)("runWithGraphT")(showVertices)((x) => showEdgeList(toEdgeList(dictGraph)(x._1)));
|
12186
12202
|
return (x) => $1($0(x));
|
12187
12203
|
};
|
@@ -12196,7 +12212,7 @@ var monadWithGraphAllocWithGr = (dictMonadError) => {
|
|
12196
12212
|
const monadWithGraphWithGraphT1 = monadWithGraphWithGraphT(monadStateT2);
|
12197
12213
|
const monadErrorStateT2 = monadErrorStateT(monadErrorStateT(dictMonadError));
|
12198
12214
|
return {
|
12199
|
-
new: (\u03B1s) => bindStateT2.bind(fresh1)((\u03B1) => bindStateT2.bind(monadWithGraphWithGraphT1.extend(\u03B1)(\u03B1s))(() => applicativeStateT(monadStateT2).pure(\u03B1))),
|
12215
|
+
new: (\u03B1s) => (vd) => bindStateT2.bind(fresh1)((\u03B1) => bindStateT2.bind(monadWithGraphWithGraphT1.extend(\u03B1)(\u03B1s)(vd))(() => applicativeStateT(monadStateT2).pure(\u03B1))),
|
12200
12216
|
MonadAlloc0: () => monadAllocWithGraphAllocT1,
|
12201
12217
|
MonadError1: () => monadErrorStateT2,
|
12202
12218
|
MonadWithGraph2: () => monadWithGraphWithGraphT1
|
@@ -12206,6 +12222,7 @@ var monadWithGraphAllocWithGr = (dictMonadError) => {
|
|
12206
12222
|
// output-es/Graph.Slice/index.js
|
12207
12223
|
var pure = /* @__PURE__ */ (() => applicativeStateT(monadIdentity).pure)();
|
12208
12224
|
var extend = /* @__PURE__ */ (() => monadWithGraphWithGraphT(monadIdentity).extend)();
|
12225
|
+
var pack2 = (x) => (k) => k(showString)(x);
|
12209
12226
|
var tailRecM = /* @__PURE__ */ (() => monadRecStateT(monadRecIdentity).tailRecM)();
|
12210
12227
|
var member3 = /* @__PURE__ */ (() => setSet(ordVertex).member)();
|
12211
12228
|
var fromFoldable9 = /* @__PURE__ */ (() => foldableSet.foldr(Cons)(Nil))();
|
@@ -12231,7 +12248,7 @@ var fwdSlice = (dictGraph) => {
|
|
12231
12248
|
fail();
|
12232
12249
|
})();
|
12233
12250
|
if (eqMap(eqVertex)(eqUnit).eq(\u03B2s)(dictGraph.outN($0)(v1.es._1._1))) {
|
12234
|
-
return bindStateT(monadIdentity).bind(extend(v1.es._1._1)(\u03B2s))(() => pure($Step(
|
12251
|
+
return bindStateT(monadIdentity).bind(extend(v1.es._1._1)(\u03B2s)(pack2("uninit: fwd")))(() => pure($Step(
|
12235
12252
|
"Loop",
|
12236
12253
|
{
|
12237
12254
|
pending: $$delete(ordVertex)(v1.es._1._1)(v1.pending),
|
@@ -12256,10 +12273,12 @@ var bwdSlice = (dictGraph) => {
|
|
12256
12273
|
return pure($Step("Done", void 0));
|
12257
12274
|
}
|
12258
12275
|
if (v1.pending.tag === "Cons") {
|
12276
|
+
const $2 = v1.pending._1._2._2;
|
12277
|
+
const $3 = v1.pending._1._2._1;
|
12259
12278
|
if (member3(v1.pending._1._1)(v1.visited)) {
|
12260
12279
|
return pure($Step("Loop", { visited: v1.visited, "\u03B1s": Nil, pending: v1.pending._2 }));
|
12261
12280
|
}
|
12262
|
-
return bindStateT(monadIdentity).bind(extend(v1.pending._1._1)(v1.pending._1.
|
12281
|
+
return bindStateT(monadIdentity).bind(extend(v1.pending._1._1)($3)(spyWhen(true)("Value found at " + showStringImpl(v1.pending._1._1))((v$1) => v$1((dictShow) => dictShow.show))($2)))(() => pure($Step(
|
12263
12282
|
"Loop",
|
12264
12283
|
{ visited: insert(ordVertex)(v1.pending._1._1)()(v1.visited), "\u03B1s": Nil, pending: v1.pending._2 }
|
12265
12284
|
)));
|
@@ -12273,7 +12292,7 @@ var bwdSlice = (dictGraph) => {
|
|
12273
12292
|
{
|
12274
12293
|
visited: v1.visited,
|
12275
12294
|
"\u03B1s": foldableList.foldr(Cons)(v1["\u03B1s"]._2)(fromFoldable9(\u03B2s)),
|
12276
|
-
pending: $List("Cons", $Tuple(v1["\u03B1s"]._1, \u03B2s), v1.pending)
|
12295
|
+
pending: $List("Cons", $Tuple(v1["\u03B1s"]._1, $Tuple(\u03B2s, dictGraph.vertexData($0)(v1["\u03B1s"]._1))), v1.pending)
|
12277
12296
|
}
|
12278
12297
|
));
|
12279
12298
|
}
|
@@ -17089,6 +17108,32 @@ var Dictionary3 = (value0) => $BaseVal("Dictionary", value0);
|
|
17089
17108
|
var DictRep = (x) => x;
|
17090
17109
|
var MatrixRep = (x) => x;
|
17091
17110
|
var Env = (x) => x;
|
17111
|
+
var showBaseVal = {
|
17112
|
+
show: (v) => {
|
17113
|
+
if (v.tag === "Int") {
|
17114
|
+
return showIntImpl(v._1);
|
17115
|
+
}
|
17116
|
+
if (v.tag === "Float") {
|
17117
|
+
return showNumberImpl(v._1);
|
17118
|
+
}
|
17119
|
+
if (v.tag === "Str") {
|
17120
|
+
return showStringImpl(v._1);
|
17121
|
+
}
|
17122
|
+
if (v.tag === "Constr") {
|
17123
|
+
return showStringImpl(v._1);
|
17124
|
+
}
|
17125
|
+
if (v.tag === "Dictionary") {
|
17126
|
+
return "Dictionary";
|
17127
|
+
}
|
17128
|
+
if (v.tag === "Matrix") {
|
17129
|
+
return "Matrix";
|
17130
|
+
}
|
17131
|
+
if (v.tag === "Fun") {
|
17132
|
+
return "Function";
|
17133
|
+
}
|
17134
|
+
fail();
|
17135
|
+
}
|
17136
|
+
};
|
17092
17137
|
var isEmptyEnv = { isEmpty: (v) => isEmpty2(v) };
|
17093
17138
|
var setEnvString = {
|
17094
17139
|
empty,
|
@@ -17874,7 +17919,7 @@ var string = {
|
|
17874
17919
|
return typeError(v)("Str");
|
17875
17920
|
}
|
17876
17921
|
};
|
17877
|
-
var unary = (dictBoundedJoinSemilattice) => {
|
17922
|
+
var unary = (dictShow) => (dictBoundedJoinSemilattice) => {
|
17878
17923
|
const bot = dictBoundedJoinSemilattice.bot;
|
17879
17924
|
return (id) => (f) => $Tuple(
|
17880
17925
|
id,
|
@@ -17892,17 +17937,17 @@ var unary = (dictBoundedJoinSemilattice) => {
|
|
17892
17937
|
const $0 = dictMonadError.MonadThrow0().Monad0().Bind1().Apply0().Functor0();
|
17893
17938
|
return (v) => {
|
17894
17939
|
if (v.tag === "Cons" && v._2.tag === "Nil") {
|
17895
|
-
const $
|
17940
|
+
const v$p = f.fwd(f.i.unpack(v._1._2));
|
17896
17941
|
return $0.map((() => {
|
17897
|
-
const $
|
17898
|
-
return (v$1) => $Val(v$1._2, $
|
17899
|
-
})())($0.map((v2) => $Tuple(
|
17942
|
+
const $1 = f.o;
|
17943
|
+
return (v$1) => $Val(v$1._2, $1.pack(v$1._1));
|
17944
|
+
})())($0.map((v2) => $Tuple(v$p, v2))(dictMonadWithGraphAlloc.new($$$Map(
|
17900
17945
|
"Two",
|
17901
17946
|
Leaf2,
|
17902
17947
|
v._1._1,
|
17903
17948
|
void 0,
|
17904
17949
|
Leaf2
|
17905
|
-
))));
|
17950
|
+
))((k) => k(dictShow)(v$p))));
|
17906
17951
|
}
|
17907
17952
|
fail();
|
17908
17953
|
};
|
@@ -18031,7 +18076,7 @@ var $$boolean = {
|
|
18031
18076
|
return typeError(v)("Boolean");
|
18032
18077
|
}
|
18033
18078
|
};
|
18034
|
-
var binaryZero = (dictBoundedJoinSemilattice) => {
|
18079
|
+
var binaryZero = (dictShow) => (dictBoundedJoinSemilattice) => {
|
18035
18080
|
const bot = dictBoundedJoinSemilattice.bot;
|
18036
18081
|
return (dictIsZero) => (id) => (f) => $Tuple(
|
18037
18082
|
id,
|
@@ -18051,10 +18096,11 @@ var binaryZero = (dictBoundedJoinSemilattice) => {
|
|
18051
18096
|
if (v.tag === "Cons" && v._2.tag === "Cons" && v._2._2.tag === "Nil") {
|
18052
18097
|
const $1 = f.i.unpack(v._1._2);
|
18053
18098
|
const $2 = f.i.unpack(v._2._1._2);
|
18099
|
+
const v$p = f.fwd($1)($2);
|
18054
18100
|
return $0.map((() => {
|
18055
18101
|
const $3 = f.o;
|
18056
18102
|
return (v$1) => $Val(v$1._2, $3.pack(v$1._1));
|
18057
|
-
})())($0.map((v4) => $Tuple(
|
18103
|
+
})())($0.map((v4) => $Tuple(v$p, v4))(dictMonadWithGraphAlloc.new((() => {
|
18058
18104
|
if (dictIsZero.isZero($1)) {
|
18059
18105
|
return $$$Map("Two", Leaf2, v._1._1, void 0, Leaf2);
|
18060
18106
|
}
|
@@ -18068,7 +18114,7 @@ var binaryZero = (dictBoundedJoinSemilattice) => {
|
|
18068
18114
|
void 0,
|
18069
18115
|
Leaf2
|
18070
18116
|
));
|
18071
|
-
})())));
|
18117
|
+
})())((k) => k(dictShow)(v$p))));
|
18072
18118
|
}
|
18073
18119
|
fail();
|
18074
18120
|
};
|
@@ -18119,7 +18165,7 @@ var binaryZero = (dictBoundedJoinSemilattice) => {
|
|
18119
18165
|
)
|
18120
18166
|
);
|
18121
18167
|
};
|
18122
|
-
var binary = (dictBoundedJoinSemilattice) => {
|
18168
|
+
var binary = (dictShow) => (dictBoundedJoinSemilattice) => {
|
18123
18169
|
const bot = dictBoundedJoinSemilattice.bot;
|
18124
18170
|
return (id) => (f) => $Tuple(
|
18125
18171
|
id,
|
@@ -18137,18 +18183,17 @@ var binary = (dictBoundedJoinSemilattice) => {
|
|
18137
18183
|
const $0 = dictMonadError.MonadThrow0().Monad0().Bind1().Apply0().Functor0();
|
18138
18184
|
return (v) => {
|
18139
18185
|
if (v.tag === "Cons" && v._2.tag === "Cons" && v._2._2.tag === "Nil") {
|
18140
|
-
const $
|
18141
|
-
const $2 = v._2._1._2;
|
18186
|
+
const v$p = f.fwd(f.i1.unpack(v._1._2))(f.i2.unpack(v._2._1._2));
|
18142
18187
|
return $0.map((() => {
|
18143
|
-
const $
|
18144
|
-
return (v$1) => $Val(v$1._2, $
|
18145
|
-
})())($0.map((v3) => $Tuple(
|
18188
|
+
const $1 = f.o;
|
18189
|
+
return (v$1) => $Val(v$1._2, $1.pack(v$1._1));
|
18190
|
+
})())($0.map((v3) => $Tuple(v$p, v3))(dictMonadWithGraphAlloc.new(insert(ordVertex)(v._2._1._1)()($$$Map(
|
18146
18191
|
"Two",
|
18147
18192
|
Leaf2,
|
18148
18193
|
v._1._1,
|
18149
18194
|
void 0,
|
18150
18195
|
Leaf2
|
18151
|
-
)))));
|
18196
|
+
)))((k) => k(dictShow)(v$p))));
|
18152
18197
|
}
|
18153
18198
|
fail();
|
18154
18199
|
};
|
@@ -18216,6 +18261,7 @@ var show22 = /* @__PURE__ */ (() => showSet(showString).show)();
|
|
18216
18261
|
var toUnfoldable9 = /* @__PURE__ */ toUnfoldable4(unfoldableList);
|
18217
18262
|
var union1 = /* @__PURE__ */ (() => setSet(ordString).union)();
|
18218
18263
|
var fv = /* @__PURE__ */ (() => fVDict(fVElim).fv)();
|
18264
|
+
var pack3 = (x) => (k) => k(showBaseVal)(x);
|
18219
18265
|
var fromFoldable18 = /* @__PURE__ */ fromFoldable2(foldableList);
|
18220
18266
|
var greaterThanOrEq = /* @__PURE__ */ (() => {
|
18221
18267
|
const $0 = ordTuple(ordInt)(ordInt);
|
@@ -18341,22 +18387,22 @@ var closeDefs = (dictMonadWithGraphAlloc) => {
|
|
18341
18387
|
const traverse2 = traversableDict.traverse(Monad0.Applicative0());
|
18342
18388
|
return (\u03B3) => (\u03C1) => (\u03B1s) => Functor0.map(Env)(traverse2((\u03C3) => {
|
18343
18389
|
const \u03C1$p = forDefs(\u03C1)(\u03C3);
|
18344
|
-
const
|
18390
|
+
const v = $BaseVal(
|
18345
18391
|
"Fun",
|
18346
18392
|
$Fun(
|
18347
18393
|
"Closure",
|
18348
18394
|
(() => {
|
18349
|
-
const $
|
18395
|
+
const $0 = union1(fv(\u03C1$p))(fVElim.fv(\u03C3));
|
18350
18396
|
return filterWithKey2((x) => {
|
18351
|
-
const $1 = setSet(ordString).member(x)($
|
18352
|
-
return (
|
18397
|
+
const $1 = setSet(ordString).member(x)($0);
|
18398
|
+
return (v2) => $1;
|
18353
18399
|
})(\u03B3);
|
18354
18400
|
})(),
|
18355
18401
|
\u03C1$p,
|
18356
18402
|
\u03C3
|
18357
18403
|
)
|
18358
18404
|
);
|
18359
|
-
return Functor0.map((f) => f(
|
18405
|
+
return Functor0.map((f) => f(v))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(\u03B1s)(pack3(v))));
|
18360
18406
|
})(\u03C1));
|
18361
18407
|
};
|
18362
18408
|
var $$eval = (dictMonadWithGraphAlloc) => {
|
@@ -18381,13 +18427,22 @@ var $$eval = (dictMonadWithGraphAlloc) => {
|
|
18381
18427
|
return withMsg2("Variable lookup")(lookup$p(MonadThrow0)(showString)(mapEnvStringVal)(v1._1)(v));
|
18382
18428
|
}
|
18383
18429
|
if (v1.tag === "Int") {
|
18384
|
-
return Functor0.map((f) => f($BaseVal("Int", v1._2)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert(ordVertex)(v1._1)()(v2))
|
18430
|
+
return Functor0.map((f) => f($BaseVal("Int", v1._2)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert(ordVertex)(v1._1)()(v2))(pack3($BaseVal(
|
18431
|
+
"Int",
|
18432
|
+
v1._2
|
18433
|
+
)))));
|
18385
18434
|
}
|
18386
18435
|
if (v1.tag === "Float") {
|
18387
|
-
return Functor0.map((f) => f($BaseVal("Float", v1._2)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert(ordVertex)(v1._1)()(v2))
|
18436
|
+
return Functor0.map((f) => f($BaseVal("Float", v1._2)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert(ordVertex)(v1._1)()(v2))(pack3($BaseVal(
|
18437
|
+
"Float",
|
18438
|
+
v1._2
|
18439
|
+
)))));
|
18388
18440
|
}
|
18389
18441
|
if (v1.tag === "Str") {
|
18390
|
-
return Functor0.map((f) => f($BaseVal("Str", v1._2)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert(ordVertex)(v1._1)()(v2))
|
18442
|
+
return Functor0.map((f) => f($BaseVal("Str", v1._2)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert(ordVertex)(v1._1)()(v2))(pack3($BaseVal(
|
18443
|
+
"Str",
|
18444
|
+
v1._2
|
18445
|
+
)))));
|
18391
18446
|
}
|
18392
18447
|
if (v1.tag === "Dictionary") {
|
18393
18448
|
const $0 = v1._1;
|
@@ -18396,8 +18451,8 @@ var $$eval = (dictMonadWithGraphAlloc) => {
|
|
18396
18451
|
return (a) => $1(a)(v2);
|
18397
18452
|
})()))(v1._2)))((v3) => {
|
18398
18453
|
const v4 = unzip(listMap((v$1) => $Tuple(v$1._2.tag === "Str" ? v$1._2._1 : typeError(v$1._2)("Str"), v$1._1))(v3._1));
|
18399
|
-
const
|
18400
|
-
return Functor0.map((f) => f(
|
18454
|
+
const v5 = $BaseVal("Dictionary", fromFoldable18(zipWith2(Tuple)(v4._1)(zipWith2(Tuple)(v4._2)(v3._2))));
|
18455
|
+
return Functor0.map((f) => f(v5))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert(ordVertex)($0)()(v2))(pack3(v5))));
|
18401
18456
|
});
|
18402
18457
|
}
|
18403
18458
|
if (v1.tag === "Constr") {
|
@@ -18427,7 +18482,11 @@ var $$eval = (dictMonadWithGraphAlloc) => {
|
|
18427
18482
|
})()))(() => Bind1.bind(traverse2((() => {
|
18428
18483
|
const $3 = $$eval(dictMonadWithGraphAlloc)(v);
|
18429
18484
|
return (a) => $3(a)(v2);
|
18430
|
-
})())($1))((vs) => Functor0.map((f) => f($BaseVal("Constr", $0, vs)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert(ordVertex)($2)()(v2))
|
18485
|
+
})())($1))((vs) => Functor0.map((f) => f($BaseVal("Constr", $0, vs)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert(ordVertex)($2)()(v2))(pack3($BaseVal(
|
18486
|
+
"Constr",
|
18487
|
+
$0,
|
18488
|
+
vs
|
18489
|
+
)))))));
|
18431
18490
|
}
|
18432
18491
|
if (v1.tag === "Matrix") {
|
18433
18492
|
const $0 = v1._2;
|
@@ -18455,18 +18514,21 @@ var $$eval = (dictMonadWithGraphAlloc) => {
|
|
18455
18514
|
return $8;
|
18456
18515
|
})())))($0)(v2)
|
18457
18516
|
]))
|
18458
|
-
])))((vss) => Functor0.map((f) => f($BaseVal("Matrix", $Tuple(vss, $Tuple($Tuple($4, $6), $Tuple($5, $7))))))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert(ordVertex)($3)()(v2))
|
18517
|
+
])))((vss) => Functor0.map((f) => f($BaseVal("Matrix", $Tuple(vss, $Tuple($Tuple($4, $6), $Tuple($5, $7))))))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert(ordVertex)($3)()(v2))(pack3($BaseVal(
|
18518
|
+
"Matrix",
|
18519
|
+
$Tuple(vss, $Tuple($Tuple($4, $6), $Tuple($5, $7)))
|
18520
|
+
)))))));
|
18459
18521
|
});
|
18460
18522
|
}
|
18461
18523
|
if (v1.tag === "Lambda") {
|
18462
|
-
const
|
18524
|
+
const v3 = $BaseVal(
|
18463
18525
|
"Fun",
|
18464
18526
|
$Fun(
|
18465
18527
|
"Closure",
|
18466
18528
|
(() => {
|
18467
|
-
const $
|
18529
|
+
const $0 = fVElim.fv(v1._2);
|
18468
18530
|
return filterWithKey2((x) => {
|
18469
|
-
const $1 = setSet(ordString).member(x)($
|
18531
|
+
const $1 = setSet(ordString).member(x)($0);
|
18470
18532
|
return (v$1) => $1;
|
18471
18533
|
})(v);
|
18472
18534
|
})(),
|
@@ -18474,7 +18536,7 @@ var $$eval = (dictMonadWithGraphAlloc) => {
|
|
18474
18536
|
v1._2
|
18475
18537
|
)
|
18476
18538
|
);
|
18477
|
-
return Functor0.map((f) => f(
|
18539
|
+
return Functor0.map((f) => f(v3))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert(ordVertex)(v1._1)()(v2))(pack3(v3))));
|
18478
18540
|
}
|
18479
18541
|
if (v1.tag === "Project") {
|
18480
18542
|
const $0 = v1._2;
|
@@ -18573,7 +18635,7 @@ var apply2 = (dictMonadWithGraphAlloc) => {
|
|
18573
18635
|
v._1,
|
18574
18636
|
void 0,
|
18575
18637
|
Leaf2
|
18576
|
-
))));
|
18638
|
+
))(pack3($BaseVal("Fun", $Fun("Foreign", $Tuple($1, $2), vs$p))))));
|
18577
18639
|
}
|
18578
18640
|
return $2._1["op'"](dictMonadWithGraphAlloc)(MonadError1)(vs$p);
|
18579
18641
|
}
|
@@ -18624,26 +18686,26 @@ var apply2 = (dictMonadWithGraphAlloc) => {
|
|
18624
18686
|
};
|
18625
18687
|
return go(0)($2) < (n - 1 | 0);
|
18626
18688
|
})()) {
|
18627
|
-
const $
|
18689
|
+
const v$p2 = $BaseVal(
|
18628
18690
|
"Fun",
|
18629
18691
|
$Fun("PartialConstr", $1, foldableList.foldr(Cons)($List("Cons", v1, Nil))($2))
|
18630
18692
|
);
|
18631
|
-
return Functor0.map((f) => f($
|
18693
|
+
return Functor0.map((f) => f(v$p2))(Functor0.map(Val)(dictMonadWithGraphAlloc.new($$$Map(
|
18632
18694
|
"Two",
|
18633
18695
|
Leaf2,
|
18634
18696
|
$3,
|
18635
18697
|
void 0,
|
18636
18698
|
Leaf2
|
18637
|
-
))));
|
18699
|
+
))(pack3(v$p2))));
|
18638
18700
|
}
|
18639
|
-
const $
|
18640
|
-
return Functor0.map((f) => f($
|
18701
|
+
const v$p = $BaseVal("Constr", $1, foldableList.foldr(Cons)($List("Cons", v1, Nil))($2));
|
18702
|
+
return Functor0.map((f) => f(v$p))(Functor0.map(Val)(dictMonadWithGraphAlloc.new($$$Map(
|
18641
18703
|
"Two",
|
18642
18704
|
Leaf2,
|
18643
18705
|
$3,
|
18644
18706
|
void 0,
|
18645
18707
|
Leaf2
|
18646
|
-
))));
|
18708
|
+
))(pack3(v$p))));
|
18647
18709
|
});
|
18648
18710
|
}
|
18649
18711
|
}
|
@@ -23912,6 +23974,7 @@ var apply2Bwd = (dictAnn) => {
|
|
23912
23974
|
};
|
23913
23975
|
|
23914
23976
|
// output-es/Primitive.Defs/index.js
|
23977
|
+
var pack4 = (x) => (k) => k(showBaseVal)(x);
|
23915
23978
|
var erase = /* @__PURE__ */ (() => functorVal.map((v) => {
|
23916
23979
|
}))();
|
23917
23980
|
var unzip6 = /* @__PURE__ */ unzip3(functorDict);
|
@@ -23921,11 +23984,24 @@ var foldWithIndexM = (dictMonad) => (f) => (a0) => foldableWithIndexStringDi.fol
|
|
23921
23984
|
return (a) => $0(a)(b);
|
23922
23985
|
})()))(dictMonad.Applicative0().pure(a0));
|
23923
23986
|
var disjointUnion5 = /* @__PURE__ */ disjointUnion(mapDictString);
|
23924
|
-
var unary2 = /* @__PURE__ */ unary(boundedJoinSemilatticeUni);
|
23925
|
-
var
|
23926
|
-
|
23927
|
-
|
23928
|
-
|
23987
|
+
var unary2 = /* @__PURE__ */ unary(showInt)(boundedJoinSemilatticeUni);
|
23988
|
+
var showEither = {
|
23989
|
+
show: (v) => {
|
23990
|
+
if (v.tag === "Left") {
|
23991
|
+
return "(Left " + showIntImpl(v._1) + ")";
|
23992
|
+
}
|
23993
|
+
if (v.tag === "Right") {
|
23994
|
+
return "(Right " + showNumberImpl(v._1) + ")";
|
23995
|
+
}
|
23996
|
+
fail();
|
23997
|
+
}
|
23998
|
+
};
|
23999
|
+
var binary2 = /* @__PURE__ */ binary(showEither)(boundedJoinSemilatticeUni);
|
24000
|
+
var binaryZero2 = /* @__PURE__ */ (() => binaryZero(showEither)(boundedJoinSemilatticeUni)({
|
24001
|
+
isZero: fanin2(isZeroInt.isZero)(isZeroNumber.isZero)
|
24002
|
+
}))();
|
24003
|
+
var binary1 = /* @__PURE__ */ binary(showBoolean)(boundedJoinSemilatticeUni);
|
24004
|
+
var binaryZero1 = /* @__PURE__ */ binaryZero(showInt)(boundedJoinSemilatticeUni)(isZeroInt);
|
23929
24005
|
var pow3 = /* @__PURE__ */ union5(asNumberIntOrNumber)(asNumberIntOrNumber)(asIntNumber)(asIntNumber)((x) => (y) => pow(toNumber(x))(toNumber(y)))(pow);
|
23930
24006
|
var numToStr = (v2) => {
|
23931
24007
|
if (v2.tag === "Left") {
|
@@ -23947,14 +24023,14 @@ var matrixUpdate = /* @__PURE__ */ $Tuple(
|
|
23947
24023
|
return (v) => {
|
23948
24024
|
if (v.tag === "Cons" && v._1._2.tag === "Matrix" && v._2.tag === "Cons" && v._2._1._2.tag === "Constr" && v._2._1._2._2.tag === "Cons" && v._2._1._2._2._1._2.tag === "Int" && v._2._1._2._2._2.tag === "Cons" && v._2._1._2._2._2._1._2.tag === "Int" && v._2._1._2._2._2._2.tag === "Nil" && v._2._2.tag === "Cons" && v._2._2._2.tag === "Nil" && v._2._1._2._1 === "Pair") {
|
23949
24025
|
const $0 = v._2._2._1;
|
23950
|
-
const $
|
23951
|
-
return Functor0.map((f) => f($
|
24026
|
+
const v$p = $BaseVal("Matrix", matrixPut(v._2._1._2._2._1._2._1)(v._2._1._2._2._2._1._2._1)((v$1) => $0)(v._1._2._1));
|
24027
|
+
return Functor0.map((f) => f(v$p))(Functor0.map(Val)(dictMonadWithGraphAlloc.new($$$Map(
|
23952
24028
|
"Two",
|
23953
24029
|
Leaf2,
|
23954
24030
|
v._1._1,
|
23955
24031
|
void 0,
|
23956
24032
|
Leaf2
|
23957
|
-
))));
|
24033
|
+
))(pack4(v$p))));
|
23958
24034
|
}
|
23959
24035
|
return MonadThrow0.throwError(error("Matrix, pair of integers and value expected"));
|
23960
24036
|
};
|
@@ -24136,28 +24212,31 @@ var dims = /* @__PURE__ */ $Tuple(
|
|
24136
24212
|
const Functor0 = Bind1.Apply0().Functor0();
|
24137
24213
|
return (v) => {
|
24138
24214
|
if (v.tag === "Cons" && v._1._2.tag === "Matrix" && v._2.tag === "Nil") {
|
24139
|
-
const $0 = v._1._2._1._2.
|
24140
|
-
const $1 = v._1._1;
|
24141
|
-
const $2 = v._1.
|
24142
|
-
|
24215
|
+
const $0 = v._1._2._1._2._1._1;
|
24216
|
+
const $1 = v._1._2._1._2._2._1;
|
24217
|
+
const $2 = v._1._1;
|
24218
|
+
const $3 = v._1._2._1._2._2._2;
|
24219
|
+
return Bind1.bind(Functor0.map((f) => f($BaseVal("Int", $0)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new($$$Map(
|
24143
24220
|
"Two",
|
24144
24221
|
Leaf2,
|
24145
24222
|
v._1._2._1._2._1._2,
|
24146
24223
|
void 0,
|
24147
24224
|
Leaf2
|
24148
|
-
)))))((v1) => Bind1.bind(Functor0.map((f) => f($BaseVal("Int", $
|
24225
|
+
))(pack4($BaseVal("Int", $0))))))((v1) => Bind1.bind(Functor0.map((f) => f($BaseVal("Int", $1)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new($$$Map(
|
24149
24226
|
"Two",
|
24150
24227
|
Leaf2,
|
24151
|
-
$
|
24152
|
-
void 0,
|
24153
|
-
Leaf2
|
24154
|
-
)))))((v2) => Functor0.map((f) => f($BaseVal("Constr", "Pair", $List("Cons", v1, $List("Cons", v2, Nil)))))(Functor0.map(Val)(dictMonadWithGraphAlloc.new($$$Map(
|
24155
|
-
"Two",
|
24156
|
-
Leaf2,
|
24157
|
-
$1,
|
24228
|
+
$3,
|
24158
24229
|
void 0,
|
24159
24230
|
Leaf2
|
24160
|
-
))))))
|
24231
|
+
))(pack4($BaseVal("Int", $1))))))((v2) => Functor0.map((f) => f($BaseVal(
|
24232
|
+
"Constr",
|
24233
|
+
"Pair",
|
24234
|
+
$List("Cons", v1, $List("Cons", v2, Nil))
|
24235
|
+
)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new($$$Map("Two", Leaf2, $2, void 0, Leaf2))(pack4($BaseVal(
|
24236
|
+
"Constr",
|
24237
|
+
"Pair",
|
24238
|
+
$List("Cons", v1, $List("Cons", v2, Nil))
|
24239
|
+
)))))));
|
24161
24240
|
}
|
24162
24241
|
return MonadThrow0.throwError(error("Matrix expected"));
|
24163
24242
|
};
|
@@ -24237,7 +24316,7 @@ var dict_map = /* @__PURE__ */ $Tuple(
|
|
24237
24316
|
$1,
|
24238
24317
|
void 0,
|
24239
24318
|
Leaf2
|
24240
|
-
)))));
|
24319
|
+
))(pack4($BaseVal("Dictionary", d$p))))));
|
24241
24320
|
}
|
24242
24321
|
return MonadThrow0.throwError(error("Function and dictionary expected"));
|
24243
24322
|
};
|
@@ -24302,27 +24381,31 @@ var dict_intersectionWith = /* @__PURE__ */ $Tuple(
|
|
24302
24381
|
const Bind1 = Monad0.Bind1();
|
24303
24382
|
const Apply0 = Bind1.Apply0();
|
24304
24383
|
const $0 = Apply0.Functor0();
|
24305
|
-
const
|
24384
|
+
const Applicative0 = Monad0.Applicative0();
|
24306
24385
|
return (v) => {
|
24307
24386
|
if (v.tag === "Cons" && v._2.tag === "Cons" && v._2._1._2.tag === "Dictionary" && v._2._2.tag === "Cons" && v._2._2._1._2.tag === "Dictionary" && v._2._2._2.tag === "Nil") {
|
24308
24387
|
const $1 = v._1;
|
24309
|
-
|
24310
|
-
|
24311
|
-
|
24312
|
-
|
24313
|
-
|
24314
|
-
|
24315
|
-
|
24316
|
-
const $2 = v2._2;
|
24317
|
-
const $3 = v3._2;
|
24318
|
-
return Bind1.bind(dictMonadWithGraphAlloc.new(insert(ordVertex)(v3._1)()($$$Map(
|
24388
|
+
const $2 = v._2._1._1;
|
24389
|
+
const $3 = v._2._2._1._1;
|
24390
|
+
const v$p = $0.map(Dictionary3)($0.map(DictRep)(traversableDict.traverse(Applicative0)(identity15)(intersectionWith_Object((v2) => (v3) => {
|
24391
|
+
const $4 = v3._2;
|
24392
|
+
const $5 = v2._1;
|
24393
|
+
const $6 = v3._1;
|
24394
|
+
return Bind1.bind(Bind1.bind(apply6($1)(v2._2))((a) => apply6(a)($4)))((v4) => Bind1.bind(dictMonadWithGraphAlloc.new(insert(ordVertex)($6)()($$$Map(
|
24319
24395
|
"Two",
|
24320
24396
|
Leaf2,
|
24321
|
-
|
24397
|
+
$5,
|
24322
24398
|
void 0,
|
24323
24399
|
Leaf2
|
24324
|
-
))))((\u03B2$p$p) => $0.map(Tuple(\u03B2$p$p))(
|
24325
|
-
})(v._2._1._2._1)(v._2._2._1._2._1))))
|
24400
|
+
)))(pack4(v4._2)))((\u03B2$p$p) => $0.map(Tuple(\u03B2$p$p))(Applicative0.pure(v4))));
|
24401
|
+
})(v._2._1._2._1)(v._2._2._1._2._1))));
|
24402
|
+
return Bind1.bind(v$p)((packable) => Apply0.apply($0.map(Val)(dictMonadWithGraphAlloc.new(insert(ordVertex)($3)()($$$Map(
|
24403
|
+
"Two",
|
24404
|
+
Leaf2,
|
24405
|
+
$2,
|
24406
|
+
void 0,
|
24407
|
+
Leaf2
|
24408
|
+
)))(pack4(packable))))(v$p));
|
24326
24409
|
}
|
24327
24410
|
return MonadThrow0.throwError(error("Function and two dictionaries expected"));
|
24328
24411
|
};
|
@@ -24555,14 +24638,14 @@ var dict_disjointUnion = /* @__PURE__ */ $Tuple(
|
|
24555
24638
|
const Functor0 = MonadThrow0.Monad0().Bind1().Apply0().Functor0();
|
24556
24639
|
return (v) => {
|
24557
24640
|
if (v.tag === "Cons" && v._1._2.tag === "Dictionary" && v._2.tag === "Cons" && v._2._1._2.tag === "Dictionary" && v._2._2.tag === "Nil") {
|
24558
|
-
const
|
24559
|
-
return Functor0.map((f) => f(
|
24641
|
+
const v1 = $BaseVal("Dictionary", disjointUnion5(v._1._2._1)(v._2._1._2._1));
|
24642
|
+
return Functor0.map((f) => f(v1))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert(ordVertex)(v._2._1._1)()($$$Map(
|
24560
24643
|
"Two",
|
24561
24644
|
Leaf2,
|
24562
24645
|
v._1._1,
|
24563
24646
|
void 0,
|
24564
24647
|
Leaf2
|
24565
|
-
)))));
|
24648
|
+
)))(pack4(v1))));
|
24566
24649
|
}
|
24567
24650
|
return MonadThrow0.throwError(error("Dictionaries expected"));
|
24568
24651
|
};
|
@@ -24603,14 +24686,14 @@ var dict_difference = /* @__PURE__ */ $Tuple(
|
|
24603
24686
|
const Functor0 = MonadThrow0.Monad0().Bind1().Apply0().Functor0();
|
24604
24687
|
return (v) => {
|
24605
24688
|
if (v.tag === "Cons" && v._1._2.tag === "Dictionary" && v._2.tag === "Cons" && v._2._1._2.tag === "Dictionary" && v._2._2.tag === "Nil") {
|
24606
|
-
const
|
24607
|
-
return Functor0.map((f) => f(
|
24689
|
+
const v1 = $BaseVal("Dictionary", mapFObjectString.difference(v._1._2._1)(v._2._1._2._1));
|
24690
|
+
return Functor0.map((f) => f(v1))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert(ordVertex)(v._2._1._1)()($$$Map(
|
24608
24691
|
"Two",
|
24609
24692
|
Leaf2,
|
24610
24693
|
v._1._1,
|
24611
24694
|
void 0,
|
24612
24695
|
Leaf2
|
24613
|
-
)))));
|
24696
|
+
)))(pack4(v1))));
|
24614
24697
|
}
|
24615
24698
|
return MonadThrow0.throwError(error("Dictionaries expected."));
|
24616
24699
|
};
|
@@ -24679,8 +24762,8 @@ var primitives = /* @__PURE__ */ fromFoldable2(foldableArray)([
|
|
24679
24762
|
/* @__PURE__ */ extern1(dims),
|
24680
24763
|
/* @__PURE__ */ extern1(error_),
|
24681
24764
|
/* @__PURE__ */ unary2("floor")({ i: number, o: $$int, fwd: floor2 }),
|
24682
|
-
/* @__PURE__ */
|
24683
|
-
/* @__PURE__ */
|
24765
|
+
/* @__PURE__ */ unary(showNumber)(boundedJoinSemilatticeUni)("log")({ i: intOrNumber, o: number, fwd: log3 }),
|
24766
|
+
/* @__PURE__ */ unary(showString)(boundedJoinSemilatticeUni)("numToStr")({ i: intOrNumber, o: string, fwd: numToStr }),
|
24684
24767
|
/* @__PURE__ */ binary2("+")({
|
24685
24768
|
i1: intOrNumber,
|
24686
24769
|
i2: intOrNumber,
|
@@ -24693,25 +24776,30 @@ var primitives = /* @__PURE__ */ fromFoldable2(foldableArray)([
|
|
24693
24776
|
o: intOrNumber,
|
24694
24777
|
fwd: /* @__PURE__ */ union5(asIntIntOrNumber)(asNumberIntOrNumber)(asIntNumber)(asIntNumber)(intSub)(numSub)
|
24695
24778
|
}),
|
24696
|
-
/* @__PURE__ */
|
24779
|
+
/* @__PURE__ */ binaryZero2("*")({
|
24697
24780
|
i: intOrNumber,
|
24698
24781
|
o: intOrNumber,
|
24699
24782
|
fwd: /* @__PURE__ */ union5(asIntIntOrNumber)(asNumberIntOrNumber)(asIntNumber)(asIntNumber)(intMul)(numMul)
|
24700
24783
|
}),
|
24701
|
-
/* @__PURE__ */
|
24702
|
-
/* @__PURE__ */
|
24703
|
-
/* @__PURE__ */
|
24784
|
+
/* @__PURE__ */ binaryZero2("**")({ i: intOrNumber, o: intOrNumber, fwd: pow3 }),
|
24785
|
+
/* @__PURE__ */ binaryZero2("/")({ i: intOrNumber, o: intOrNumber, fwd: divide }),
|
24786
|
+
/* @__PURE__ */ binary1("==")({
|
24704
24787
|
i1: intOrNumberOrString,
|
24705
24788
|
i2: intOrNumberOrString,
|
24706
24789
|
o: $$boolean,
|
24707
24790
|
fwd: /* @__PURE__ */ union5(asBooleanBoolean)(asBooleanBoolean)(asIntNumberOrString)(asIntNumberOrString)(eqIntImpl)(/* @__PURE__ */ unionStr(asBooleanBoolean)(asNumberString)(eqNumberImpl)(eqStringImpl))
|
24708
24791
|
}),
|
24709
|
-
/* @__PURE__ */
|
24710
|
-
/* @__PURE__ */
|
24711
|
-
/* @__PURE__ */
|
24712
|
-
/* @__PURE__ */
|
24713
|
-
/* @__PURE__ */
|
24714
|
-
/* @__PURE__ */
|
24792
|
+
/* @__PURE__ */ binary1("/=")({ i1: intOrNumberOrString, i2: intOrNumberOrString, o: $$boolean, fwd: notEquals }),
|
24793
|
+
/* @__PURE__ */ binary1("<")({ i1: intOrNumberOrString, i2: intOrNumberOrString, o: $$boolean, fwd: lessThan }),
|
24794
|
+
/* @__PURE__ */ binary1(">")({ i1: intOrNumberOrString, i2: intOrNumberOrString, o: $$boolean, fwd: greaterThan }),
|
24795
|
+
/* @__PURE__ */ binary1("<=")({ i1: intOrNumberOrString, i2: intOrNumberOrString, o: $$boolean, fwd: lessThanEquals }),
|
24796
|
+
/* @__PURE__ */ binary1(">=")({ i1: intOrNumberOrString, i2: intOrNumberOrString, o: $$boolean, fwd: greaterThanEquals }),
|
24797
|
+
/* @__PURE__ */ binary(showString)(boundedJoinSemilatticeUni)("++")({
|
24798
|
+
i1: string,
|
24799
|
+
i2: string,
|
24800
|
+
o: string,
|
24801
|
+
fwd: concatString
|
24802
|
+
}),
|
24715
24803
|
/* @__PURE__ */ extern1(matrixLookup),
|
24716
24804
|
/* @__PURE__ */ extern1(dict_difference),
|
24717
24805
|
/* @__PURE__ */ extern1(dict_disjointUnion),
|
@@ -24720,10 +24808,10 @@ var primitives = /* @__PURE__ */ fromFoldable2(foldableArray)([
|
|
24720
24808
|
/* @__PURE__ */ extern1(dict_intersectionWith),
|
24721
24809
|
/* @__PURE__ */ extern1(dict_map),
|
24722
24810
|
/* @__PURE__ */ extern1(matrixUpdate),
|
24723
|
-
/* @__PURE__ */
|
24724
|
-
/* @__PURE__ */
|
24725
|
-
/* @__PURE__ */
|
24726
|
-
/* @__PURE__ */
|
24811
|
+
/* @__PURE__ */ binaryZero1("div")({ i: $$int, o: $$int, fwd: intDiv2 }),
|
24812
|
+
/* @__PURE__ */ binaryZero1("mod")({ i: $$int, o: $$int, fwd: intMod }),
|
24813
|
+
/* @__PURE__ */ binaryZero1("quot")({ i: $$int, o: $$int, fwd: quot }),
|
24814
|
+
/* @__PURE__ */ binaryZero1("rem")({ i: $$int, o: $$int, fwd: rem })
|
24727
24815
|
]);
|
24728
24816
|
|
24729
24817
|
// output-es/ProgCxt/index.js
|