@explorable-viz/fluid 0.7.84 → 0.7.86
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/.spago/affjax-node/v1.0.0/.editorconfig +13 -0
- package/.spago/affjax-node/v1.0.0/.eslintrc.json +30 -0
- package/.spago/affjax-node/v1.0.0/.gitignore +13 -0
- package/.spago/pathy/v9.0.0/.editorconfig +13 -0
- package/.spago/pathy/v9.0.0/.gitignore +9 -0
- package/.spago/pathy/v9.0.0/.tidyrc.json +10 -0
- package/dist/fluid/fluid/lib/stats.fld +19 -0
- package/dist/fluid/shared/fluid.mjs +201 -272
- package/dist/fluid/shared/load-figure.js +152 -241
- package/package.json +1 -1
- package/script/bundle-website.sh +2 -0
- package/.spago/node-process/v11.0.0/.eslintrc.json +0 -29
- package/.spago/node-process/v11.0.0/.gitignore +0 -8
- package/.spago/node-process/v11.1.0/.eslintrc.json +0 -29
- package/.spago/node-process/v11.1.0/.gitignore +0 -8
- package/.spago/node-process/v11.2.0/.eslintrc.json +0 -29
- package/.spago/node-process/v11.2.0/.gitignore +0 -8
- package/.spago/optparse/v6.0.0/.gitignore +0 -8
- package/.spago/optparse/v6.0.0/.npmrc +0 -1
- package/dist/fluid/fluid/lib/dtw.fld +0 -47
- package/dist/fluid/fluid/lib/fnum.fld +0 -22
- package/dist/fluid/fluid/lib/some-constants.fld +0 -1
- package/dist/fluid/fluid/lib/text-viz.fld +0 -18
@@ -27868,32 +27868,22 @@ var select\u03B1s\u{1D539}Vertex = (dictApply) => {
|
|
27868
27868
|
};
|
27869
27869
|
};
|
27870
27870
|
};
|
27871
|
-
var verticesVertex = (dictFunctor) => (dictFoldable) => ({
|
27872
|
-
vertices: (() => {
|
27873
|
-
const $0 = dictFoldable.foldl(union3(ordVertex))(Leaf2);
|
27874
|
-
return (x2) => $0(dictFunctor.map(singleton3)(x2));
|
27875
|
-
})()
|
27876
|
-
});
|
27877
27871
|
var showVertices = (\u03B1s) => "{" + joinWith(", ")(fromFoldable4(map2(ordString)(unsafeCoerce)(\u03B1s))) + "}";
|
27878
27872
|
var showEdgeList = (es) => joinWith("\n")([
|
27879
27873
|
"digraph G {",
|
27880
27874
|
...arrayMap((v) => " " + v)([
|
27881
27875
|
"rankdir = RL",
|
27882
|
-
...arrayMap((v) => v._1 + " -> {" + joinWith(", ")(fromFoldable4(map2(ordString)(unsafeCoerce)(v._2
|
27876
|
+
...arrayMap((v) => v._1 + " -> {" + joinWith(", ")(fromFoldable4(map2(ordString)(unsafeCoerce)(v._2))) + "}")(fromFoldable13(reverse2(es)))
|
27883
27877
|
]),
|
27884
27878
|
"}"
|
27885
27879
|
]);
|
27886
|
-
var pack1 = (x2) => (k) => k(showString)(x2);
|
27887
27880
|
var toEdgeList = (dictGraph) => (g) => {
|
27888
27881
|
const $0 = (v) => {
|
27889
27882
|
if (v._1.tag === "Nil") {
|
27890
27883
|
return $Step("Done", v._2);
|
27891
27884
|
}
|
27892
27885
|
if (v._1.tag === "Cons") {
|
27893
|
-
return $Step(
|
27894
|
-
"Loop",
|
27895
|
-
$Tuple(v._1._2, $List("Cons", $Tuple(v._1._1, $Tuple(dictGraph.outN(g)(v._1._1), pack1(""))), v._2))
|
27896
|
-
);
|
27886
|
+
return $Step("Loop", $Tuple(v._1._2, $List("Cons", $Tuple(v._1._1, dictGraph.outN(g)(v._1._1)), v._2)));
|
27897
27887
|
}
|
27898
27888
|
fail();
|
27899
27889
|
};
|
@@ -28165,15 +28155,14 @@ var $GraphImpl = (_1) => ({ tag: "GraphImpl", _1 });
|
|
28165
28155
|
var eqSet = { eq: (v) => (v1) => eqMap(eqVertex)(eqUnit).eq(v)(v1) };
|
28166
28156
|
var eq = /* @__PURE__ */ (() => eqObject(eqSet).eq)();
|
28167
28157
|
var fromFoldable6 = /* @__PURE__ */ foldlArray((m) => (a) => insert3(ordVertex)(a)()(m))(Leaf2);
|
28168
|
-
var pack = (x2) => (k) => k(showString)(x2);
|
28169
28158
|
var toUnfoldable6 = /* @__PURE__ */ toUnfoldable4(unfoldableList);
|
28170
28159
|
var fromFoldable15 = /* @__PURE__ */ (() => foldableSet.foldr(Cons)(Nil))();
|
28171
28160
|
var fromFoldable23 = /* @__PURE__ */ (() => foldableSet.foldl((m) => (a) => insert3(ordVertex)(a)()(m))(Leaf2))();
|
28172
28161
|
var toUnfoldable12 = /* @__PURE__ */ toAscUnfoldable(unfoldableArray);
|
28173
28162
|
var fromFoldable32 = /* @__PURE__ */ fromFoldable2(ordVertex)(foldableArray);
|
28174
28163
|
var verticesGraphImpl = { vertices: (v) => v._1.vertices };
|
28175
|
-
var eqGraphImpl = { eq: (v) => (v1) => eq(
|
28176
|
-
var sinks$p = (m) => fromFoldable6(arrayMap((x2) => x2._1)(filter((x2) => x2._2.
|
28164
|
+
var eqGraphImpl = { eq: (v) => (v1) => eq(v._1.out)(v1._1.out) };
|
28165
|
+
var sinks$p = (m) => fromFoldable6(arrayMap((x2) => x2._1)(filter((x2) => x2._2.tag === "Leaf")(toArrayWithKey(Tuple)(m))));
|
28177
28166
|
var init5 = (\u03B1s) => () => {
|
28178
28167
|
const obj = {};
|
28179
28168
|
return monadRecST.tailRecM((v) => {
|
@@ -28185,7 +28174,7 @@ var init5 = (\u03B1s) => () => {
|
|
28185
28174
|
const $1 = v._1._2;
|
28186
28175
|
const $2 = v._2;
|
28187
28176
|
return () => {
|
28188
|
-
$2[$0] =
|
28177
|
+
$2[$0] = Leaf2;
|
28189
28178
|
return $Step("Loop", $Tuple($1, $2));
|
28190
28179
|
};
|
28191
28180
|
}
|
@@ -28221,7 +28210,7 @@ var addIfMissing = (acc) => (v) => {
|
|
28221
28210
|
return () => {
|
28222
28211
|
const v1 = $0();
|
28223
28212
|
if (v1.tag === "Nothing") {
|
28224
|
-
acc[v] =
|
28213
|
+
acc[v] = Leaf2;
|
28225
28214
|
return acc;
|
28226
28215
|
}
|
28227
28216
|
if (v1.tag === "Just") {
|
@@ -28255,28 +28244,27 @@ var outMap = (\u03B1s) => (es) => {
|
|
28255
28244
|
if (v._1.tag === "Cons") {
|
28256
28245
|
const $1 = v._2;
|
28257
28246
|
const $2 = v._1._2;
|
28258
|
-
const $3 = v._1._1.
|
28259
|
-
const $4 = v._1._1.
|
28260
|
-
const $5 =
|
28261
|
-
const $6 = peek($4)($1);
|
28247
|
+
const $3 = v._1._1._1;
|
28248
|
+
const $4 = v._1._1._2;
|
28249
|
+
const $5 = peek($3)($1);
|
28262
28250
|
return () => {
|
28263
|
-
const $
|
28251
|
+
const $6 = $5();
|
28264
28252
|
if ((() => {
|
28265
|
-
if ($
|
28253
|
+
if ($6.tag === "Nothing") {
|
28266
28254
|
return true;
|
28267
28255
|
}
|
28268
|
-
if ($
|
28269
|
-
return eqMap(eqVertex)(eqUnit).eq($
|
28256
|
+
if ($6.tag === "Just") {
|
28257
|
+
return eqMap(eqVertex)(eqUnit).eq($6._1)(Leaf2);
|
28270
28258
|
}
|
28271
28259
|
fail();
|
28272
28260
|
})()) {
|
28273
|
-
const \u03B2s$p = toUnfoldable6($
|
28261
|
+
const \u03B2s$p = toUnfoldable6($4);
|
28274
28262
|
monadRecST.tailRecM(assertPresent($1))(\u03B2s$p)();
|
28275
|
-
$1[$
|
28263
|
+
$1[$3] = $4;
|
28276
28264
|
const acc$p = addIfMissing$p(\u03B2s$p)($1)();
|
28277
28265
|
return $Step("Loop", $Tuple($2, acc$p));
|
28278
28266
|
}
|
28279
|
-
return throwException(error("Duplicate edge list entry for " + showStringImpl($
|
28267
|
+
return throwException(error("Duplicate edge list entry for " + showStringImpl($3)))()();
|
28280
28268
|
};
|
28281
28269
|
}
|
28282
28270
|
fail();
|
@@ -28293,38 +28281,37 @@ var inMap = (\u03B1s) => (es) => {
|
|
28293
28281
|
}
|
28294
28282
|
if (v._1.tag === "Cons") {
|
28295
28283
|
const $1 = v._1._2;
|
28296
|
-
const $2 = v._1._1.
|
28297
|
-
const $3 =
|
28298
|
-
|
28299
|
-
|
28300
|
-
return () => $Step("Done", v2._2);
|
28284
|
+
const $2 = v._1._1._1;
|
28285
|
+
const $3 = monadRecST.tailRecM((v1) => {
|
28286
|
+
if (v1._1.tag === "Nil") {
|
28287
|
+
return () => $Step("Done", v1._2);
|
28301
28288
|
}
|
28302
|
-
if (
|
28303
|
-
const $
|
28304
|
-
const $
|
28305
|
-
const $
|
28306
|
-
const $
|
28289
|
+
if (v1._1.tag === "Cons") {
|
28290
|
+
const $32 = v1._2;
|
28291
|
+
const $4 = v1._1._1;
|
28292
|
+
const $5 = v1._1._2;
|
28293
|
+
const $6 = peek($4)($32);
|
28307
28294
|
return () => {
|
28308
|
-
const v1 = $
|
28295
|
+
const v1$1 = $6();
|
28309
28296
|
const acc$p = (() => {
|
28310
|
-
if (v1.tag === "Nothing") {
|
28311
|
-
$
|
28312
|
-
return $
|
28297
|
+
if (v1$1.tag === "Nothing") {
|
28298
|
+
$32[$4] = $$$Map("Two", Leaf2, $2, void 0, Leaf2);
|
28299
|
+
return $32;
|
28313
28300
|
}
|
28314
|
-
if (v1.tag === "Just") {
|
28315
|
-
$
|
28316
|
-
return $
|
28301
|
+
if (v1$1.tag === "Just") {
|
28302
|
+
$32[$4] = insert3(ordVertex)($2)()(v1$1._1);
|
28303
|
+
return $32;
|
28317
28304
|
}
|
28318
28305
|
fail();
|
28319
28306
|
})();
|
28320
|
-
return $Step("Loop", $Tuple($
|
28307
|
+
return $Step("Loop", $Tuple($5, acc$p));
|
28321
28308
|
};
|
28322
28309
|
}
|
28323
28310
|
fail();
|
28324
|
-
})($Tuple(toUnfoldable6(v._1._1._2
|
28311
|
+
})($Tuple(toUnfoldable6(v._1._1._2), v._2));
|
28325
28312
|
return () => {
|
28326
|
-
const a = $
|
28327
|
-
const acc$p = addIfMissing(a)($
|
28313
|
+
const a = $3();
|
28314
|
+
const acc$p = addIfMissing(a)($2)();
|
28328
28315
|
return $Step("Loop", $Tuple($1, acc$p));
|
28329
28316
|
};
|
28330
28317
|
}
|
@@ -28333,8 +28320,7 @@ var inMap = (\u03B1s) => (es) => {
|
|
28333
28320
|
};
|
28334
28321
|
};
|
28335
28322
|
var graphGraphImpl = {
|
28336
|
-
outN: (v) => (\u03B1) => definitely("in graph")(_lookup(Nothing, Just, \u03B1, v._1.out))
|
28337
|
-
vertexData: (v) => (\u03B1) => definitely("in graph")(_lookup(Nothing, Just, \u03B1, v._1.out))._2,
|
28323
|
+
outN: (v) => (\u03B1) => definitely("in graph")(_lookup(Nothing, Just, \u03B1, v._1.out)),
|
28338
28324
|
inN: (g) => graphGraphImpl.outN(graphGraphImpl.op(g)),
|
28339
28325
|
elem: (\u03B1) => (v) => {
|
28340
28326
|
const $0 = _lookup(Nothing, Just, \u03B1, v._1.out);
|
@@ -28373,7 +28359,7 @@ var graphGraphImpl = {
|
|
28373
28359
|
topologicalSort: (v) => reverse2(topologicalSort(ordVertex)(fromFoldable32(arrayMap((x2) => $Tuple(
|
28374
28360
|
x2._1,
|
28375
28361
|
$Tuple(void 0, x2._2)
|
28376
|
-
))(toUnfoldable12(_fmapObject(
|
28362
|
+
))(toUnfoldable12(_fmapObject(v._1.out, toUnfoldable6)))))),
|
28377
28363
|
Eq0: () => eqGraphImpl,
|
28378
28364
|
Vertices1: () => verticesGraphImpl
|
28379
28365
|
};
|
@@ -34062,32 +34048,6 @@ var Dictionary3 = (value0) => $BaseVal("Dictionary", value0);
|
|
34062
34048
|
var DictRep = (x2) => x2;
|
34063
34049
|
var MatrixRep = (x2) => x2;
|
34064
34050
|
var Env = (x2) => x2;
|
34065
|
-
var showBaseVal = {
|
34066
|
-
show: (v) => {
|
34067
|
-
if (v.tag === "Int") {
|
34068
|
-
return showIntImpl(v._1);
|
34069
|
-
}
|
34070
|
-
if (v.tag === "Float") {
|
34071
|
-
return showNumberImpl(v._1);
|
34072
|
-
}
|
34073
|
-
if (v.tag === "Str") {
|
34074
|
-
return showStringImpl(v._1);
|
34075
|
-
}
|
34076
|
-
if (v.tag === "Constr") {
|
34077
|
-
return showStringImpl(v._1);
|
34078
|
-
}
|
34079
|
-
if (v.tag === "Dictionary") {
|
34080
|
-
return "Dictionary";
|
34081
|
-
}
|
34082
|
-
if (v.tag === "Matrix") {
|
34083
|
-
return "Matrix";
|
34084
|
-
}
|
34085
|
-
if (v.tag === "Fun") {
|
34086
|
-
return "Function";
|
34087
|
-
}
|
34088
|
-
fail();
|
34089
|
-
}
|
34090
|
-
};
|
34091
34051
|
var isEmptyEnv = { isEmpty: (v) => isEmpty(v) };
|
34092
34052
|
var setEnvString = {
|
34093
34053
|
empty,
|
@@ -34898,7 +34858,7 @@ var string2 = {
|
|
34898
34858
|
return typeError(v)("Str");
|
34899
34859
|
}
|
34900
34860
|
};
|
34901
|
-
var unary = (
|
34861
|
+
var unary = (dictBoundedJoinSemilattice) => {
|
34902
34862
|
const bot2 = dictBoundedJoinSemilattice.bot;
|
34903
34863
|
return (id3) => (f) => $Tuple(
|
34904
34864
|
id3,
|
@@ -34916,17 +34876,17 @@ var unary = (dictShow) => (dictBoundedJoinSemilattice) => {
|
|
34916
34876
|
const $0 = dictMonadError.MonadThrow0().Monad0().Bind1().Apply0().Functor0();
|
34917
34877
|
return (v) => {
|
34918
34878
|
if (v.tag === "Cons" && v._2.tag === "Nil") {
|
34919
|
-
const
|
34879
|
+
const $1 = v._1._2;
|
34920
34880
|
return $0.map((() => {
|
34921
|
-
const $
|
34922
|
-
return (v$1) => $Val(v$1._2, $
|
34923
|
-
})())($0.map((v2) => $Tuple(
|
34881
|
+
const $2 = f.o;
|
34882
|
+
return (v$1) => $Val(v$1._2, $2.pack(v$1._1));
|
34883
|
+
})())($0.map((v2) => $Tuple(f.fwd(f.i.unpack($1)), v2))(dictMonadWithGraphAlloc.new($$$Map(
|
34924
34884
|
"Two",
|
34925
34885
|
Leaf2,
|
34926
34886
|
v._1._1,
|
34927
34887
|
void 0,
|
34928
34888
|
Leaf2
|
34929
|
-
))
|
34889
|
+
))));
|
34930
34890
|
}
|
34931
34891
|
fail();
|
34932
34892
|
};
|
@@ -35055,7 +35015,7 @@ var $$boolean = {
|
|
35055
35015
|
return typeError(v)("Boolean");
|
35056
35016
|
}
|
35057
35017
|
};
|
35058
|
-
var binaryZero = (
|
35018
|
+
var binaryZero = (dictBoundedJoinSemilattice) => {
|
35059
35019
|
const bot2 = dictBoundedJoinSemilattice.bot;
|
35060
35020
|
return (dictIsZero) => (id3) => (f) => $Tuple(
|
35061
35021
|
id3,
|
@@ -35075,11 +35035,10 @@ var binaryZero = (dictShow) => (dictBoundedJoinSemilattice) => {
|
|
35075
35035
|
if (v.tag === "Cons" && v._2.tag === "Cons" && v._2._2.tag === "Nil") {
|
35076
35036
|
const $1 = f.i.unpack(v._1._2);
|
35077
35037
|
const $2 = f.i.unpack(v._2._1._2);
|
35078
|
-
const v$p = f.fwd($1)($2);
|
35079
35038
|
return $0.map((() => {
|
35080
35039
|
const $3 = f.o;
|
35081
35040
|
return (v$1) => $Val(v$1._2, $3.pack(v$1._1));
|
35082
|
-
})())($0.map((v4) => $Tuple(
|
35041
|
+
})())($0.map((v4) => $Tuple(f.fwd($1)($2), v4))(dictMonadWithGraphAlloc.new((() => {
|
35083
35042
|
if (dictIsZero.isZero($1)) {
|
35084
35043
|
return $$$Map("Two", Leaf2, v._1._1, void 0, Leaf2);
|
35085
35044
|
}
|
@@ -35093,7 +35052,7 @@ var binaryZero = (dictShow) => (dictBoundedJoinSemilattice) => {
|
|
35093
35052
|
void 0,
|
35094
35053
|
Leaf2
|
35095
35054
|
));
|
35096
|
-
})())
|
35055
|
+
})())));
|
35097
35056
|
}
|
35098
35057
|
fail();
|
35099
35058
|
};
|
@@ -35144,7 +35103,7 @@ var binaryZero = (dictShow) => (dictBoundedJoinSemilattice) => {
|
|
35144
35103
|
)
|
35145
35104
|
);
|
35146
35105
|
};
|
35147
|
-
var binary = (
|
35106
|
+
var binary = (dictBoundedJoinSemilattice) => {
|
35148
35107
|
const bot2 = dictBoundedJoinSemilattice.bot;
|
35149
35108
|
return (id3) => (f) => $Tuple(
|
35150
35109
|
id3,
|
@@ -35162,17 +35121,18 @@ var binary = (dictShow) => (dictBoundedJoinSemilattice) => {
|
|
35162
35121
|
const $0 = dictMonadError.MonadThrow0().Monad0().Bind1().Apply0().Functor0();
|
35163
35122
|
return (v) => {
|
35164
35123
|
if (v.tag === "Cons" && v._2.tag === "Cons" && v._2._2.tag === "Nil") {
|
35165
|
-
const
|
35124
|
+
const $1 = v._1._2;
|
35125
|
+
const $2 = v._2._1._2;
|
35166
35126
|
return $0.map((() => {
|
35167
|
-
const $
|
35168
|
-
return (v$1) => $Val(v$1._2, $
|
35169
|
-
})())($0.map((v3) => $Tuple(
|
35127
|
+
const $3 = f.o;
|
35128
|
+
return (v$1) => $Val(v$1._2, $3.pack(v$1._1));
|
35129
|
+
})())($0.map((v3) => $Tuple(f.fwd(f.i1.unpack($1))(f.i2.unpack($2)), v3))(dictMonadWithGraphAlloc.new(insert3(ordVertex)(v._2._1._1)()($$$Map(
|
35170
35130
|
"Two",
|
35171
35131
|
Leaf2,
|
35172
35132
|
v._1._1,
|
35173
35133
|
void 0,
|
35174
35134
|
Leaf2
|
35175
|
-
)))
|
35135
|
+
)))));
|
35176
35136
|
}
|
35177
35137
|
fail();
|
35178
35138
|
};
|
@@ -37719,9 +37679,9 @@ var drawableTableView = {
|
|
37719
37679
|
var arrayDictToArray2 = (x2) => arrayMap((a) => arrayMap((a$1) => $$get2(showString)(mapDictString)(a$1)(a))(x2));
|
37720
37680
|
|
37721
37681
|
// output-es/App.View/index.js
|
37722
|
-
var
|
37723
|
-
var
|
37724
|
-
var
|
37682
|
+
var pack = (x2) => (k) => k(drawableBarChart)(x2);
|
37683
|
+
var pack1 = (x2) => (k) => k(drawableLineChart)(x2);
|
37684
|
+
var pack2 = (x2) => (k) => k(drawableScatterPlot)(x2);
|
37725
37685
|
var pack3 = (x2) => (k) => k(drawableParagraphSelState)(x2);
|
37726
37686
|
var pack4 = (x2) => (k) => k(drawableMultiView)(x2);
|
37727
37687
|
var identity28 = (x2) => x2;
|
@@ -37731,13 +37691,13 @@ var view = () => (v) => (v1) => (v2) => {
|
|
37731
37691
|
if (v1._2.tag === "Constr") {
|
37732
37692
|
if (v1._2._2.tag === "Cons" && v1._2._2._2.tag === "Nil") {
|
37733
37693
|
if (v1._2._1 === "BarChart") {
|
37734
|
-
return
|
37694
|
+
return pack(dict(reflectDictSelState\u{1D54A}$x215ValS22.from())(v1._2._2._1));
|
37735
37695
|
}
|
37736
37696
|
if (v1._2._1 === "LineChart") {
|
37737
|
-
return
|
37697
|
+
return pack1(dict(reflectDictSelState\u{1D54A}$x215ValS13.from())(v1._2._2._1));
|
37738
37698
|
}
|
37739
37699
|
if (v1._2._1 === "ScatterPlot") {
|
37740
|
-
return
|
37700
|
+
return pack2(dict(reflectDictSelState\u{1D54A}$x215ValS5.from())(v1._2._2._1));
|
37741
37701
|
}
|
37742
37702
|
if (v1._2._1 === "Paragraph") {
|
37743
37703
|
return pack3(reflectValSelState\u{1D54A}Paragr.from()(v1._2._2._1));
|
@@ -37853,8 +37813,8 @@ var monadWithGraphWithGraphT = (dictMonad) => {
|
|
37853
37813
|
const $1 = monadStateStateT(dictMonad);
|
37854
37814
|
const monadStateT = { Applicative0: () => applicativeStateT(dictMonad), Bind1: () => bindStateT(dictMonad) };
|
37855
37815
|
return {
|
37856
|
-
extend: (\u03B1) => (\u03B1s) =>
|
37857
|
-
const $2 = Cons($Tuple(\u03B1,
|
37816
|
+
extend: (\u03B1) => (\u03B1s) => {
|
37817
|
+
const $2 = Cons($Tuple(\u03B1, \u03B1s));
|
37858
37818
|
const $3 = $1.state((s) => $Tuple(void 0, $2(s)));
|
37859
37819
|
return (s) => $0.map((v1) => $Tuple(void 0, v1._2))($3(s));
|
37860
37820
|
},
|
@@ -37916,10 +37876,10 @@ var runWithGraphT = (dictMonad) => {
|
|
37916
37876
|
};
|
37917
37877
|
};
|
37918
37878
|
var runWithGraphT_spy = (dictMonad) => {
|
37919
|
-
const
|
37879
|
+
const runWithGraphT2 = runWithGraphT(dictMonad);
|
37920
37880
|
const spyFunWhenM2 = spyFunWhenM(dictMonad.Bind1().Apply0().Functor0());
|
37921
37881
|
return (dictGraph) => {
|
37922
|
-
const $0 =
|
37882
|
+
const $0 = runWithGraphT2(dictGraph);
|
37923
37883
|
const $1 = spyFunWhenM2(false)("runWithGraphT")(showVertices)((x2) => showEdgeList(toEdgeList(dictGraph)(x2._1)));
|
37924
37884
|
return (x2) => $1($0(x2));
|
37925
37885
|
};
|
@@ -37934,7 +37894,7 @@ var monadWithGraphAllocWithGr = (dictMonadError) => {
|
|
37934
37894
|
const monadWithGraphWithGraphT1 = monadWithGraphWithGraphT(monadStateT);
|
37935
37895
|
const monadErrorStateT2 = monadErrorStateT(monadErrorStateT(dictMonadError));
|
37936
37896
|
return {
|
37937
|
-
new: (\u03B1s) =>
|
37897
|
+
new: (\u03B1s) => bindStateT2.bind(fresh1)((\u03B1) => bindStateT2.bind(monadWithGraphWithGraphT1.extend(\u03B1)(\u03B1s))(() => applicativeStateT(monadStateT).pure(\u03B1))),
|
37938
37898
|
MonadAlloc0: () => monadAllocWithGraphAllocT1,
|
37939
37899
|
MonadError1: () => monadErrorStateT2,
|
37940
37900
|
MonadWithGraph2: () => monadWithGraphWithGraphT1
|
@@ -37944,7 +37904,6 @@ var monadWithGraphAllocWithGr = (dictMonadError) => {
|
|
37944
37904
|
// output-es/Graph.Slice/index.js
|
37945
37905
|
var pure2 = /* @__PURE__ */ (() => applicativeStateT(monadIdentity).pure)();
|
37946
37906
|
var extend3 = /* @__PURE__ */ (() => monadWithGraphWithGraphT(monadIdentity).extend)();
|
37947
|
-
var pack7 = (x2) => (k) => k(showString)(x2);
|
37948
37907
|
var tailRecM = /* @__PURE__ */ (() => monadRecStateT(monadRecIdentity).tailRecM)();
|
37949
37908
|
var member4 = /* @__PURE__ */ (() => setSet(ordVertex).member)();
|
37950
37909
|
var fromFoldable19 = /* @__PURE__ */ (() => foldableSet.foldr(Cons)(Nil))();
|
@@ -37970,7 +37929,7 @@ var fwdSlice = (dictGraph) => {
|
|
37970
37929
|
fail();
|
37971
37930
|
})();
|
37972
37931
|
if (eqMap(eqVertex)(eqUnit).eq(\u03B2s)(dictGraph.outN($0)(v1.es._1._1))) {
|
37973
|
-
return bindStateT(monadIdentity).bind(extend3(v1.es._1._1)(\u03B2s)
|
37932
|
+
return bindStateT(monadIdentity).bind(extend3(v1.es._1._1)(\u03B2s))(() => pure2($Step(
|
37974
37933
|
"Loop",
|
37975
37934
|
{
|
37976
37935
|
pending: $$delete3(ordVertex)(v1.es._1._1)(v1.pending),
|
@@ -37995,12 +37954,10 @@ var bwdSlice = (dictGraph) => {
|
|
37995
37954
|
return pure2($Step("Done", void 0));
|
37996
37955
|
}
|
37997
37956
|
if (v1.pending.tag === "Cons") {
|
37998
|
-
const $2 = v1.pending._1._2._2;
|
37999
|
-
const $3 = v1.pending._1._2._1;
|
38000
37957
|
if (member4(v1.pending._1._1)(v1.visited)) {
|
38001
37958
|
return pure2($Step("Loop", { visited: v1.visited, "\u03B1s": Nil, pending: v1.pending._2 }));
|
38002
37959
|
}
|
38003
|
-
return bindStateT(monadIdentity).bind(extend3(v1.pending._1._1)(
|
37960
|
+
return bindStateT(monadIdentity).bind(extend3(v1.pending._1._1)(v1.pending._1._2))(() => pure2($Step(
|
38004
37961
|
"Loop",
|
38005
37962
|
{ visited: insert3(ordVertex)(v1.pending._1._1)()(v1.visited), "\u03B1s": Nil, pending: v1.pending._2 }
|
38006
37963
|
)));
|
@@ -38014,7 +37971,7 @@ var bwdSlice = (dictGraph) => {
|
|
38014
37971
|
{
|
38015
37972
|
visited: v1.visited,
|
38016
37973
|
"\u03B1s": foldableList.foldr(Cons)(v1["\u03B1s"]._2)(fromFoldable19(\u03B2s)),
|
38017
|
-
pending: $List("Cons", $Tuple(v1["\u03B1s"]._1,
|
37974
|
+
pending: $List("Cons", $Tuple(v1["\u03B1s"]._1, \u03B2s), v1.pending)
|
38018
37975
|
}
|
38019
37976
|
));
|
38020
37977
|
}
|
@@ -38035,7 +37992,6 @@ var show22 = /* @__PURE__ */ (() => showSet(showString).show)();
|
|
38035
37992
|
var toUnfoldable10 = /* @__PURE__ */ toUnfoldable4(unfoldableList);
|
38036
37993
|
var union1 = /* @__PURE__ */ (() => setSet(ordString).union)();
|
38037
37994
|
var fv = /* @__PURE__ */ (() => fVDict(fVElim).fv)();
|
38038
|
-
var pack8 = (x2) => (k) => k(showBaseVal)(x2);
|
38039
37995
|
var fromFoldable110 = /* @__PURE__ */ fromFoldable(foldableList);
|
38040
37996
|
var greaterThanOrEq = /* @__PURE__ */ (() => {
|
38041
37997
|
const $0 = ordTuple(ordInt)(ordInt);
|
@@ -38048,8 +38004,6 @@ var concatM = (dictMonad) => foldableList.foldr((() => {
|
|
38048
38004
|
})())(dictMonad.Applicative0().pure);
|
38049
38005
|
var fwdSlice2 = /* @__PURE__ */ fwdSlice(graphGraphImpl);
|
38050
38006
|
var bwdSlice2 = /* @__PURE__ */ bwdSlice(graphGraphImpl);
|
38051
|
-
var vertices = /* @__PURE__ */ (() => verticesVertex(functorEnvExpr)(foldableEnvExpr).vertices)();
|
38052
|
-
var vertices1 = /* @__PURE__ */ (() => verticesVertex(functorVal)(foldableVal).vertices)();
|
38053
38007
|
var matchMany = (dictMonadWithGraphAlloc) => {
|
38054
38008
|
const Monad0 = dictMonadWithGraphAlloc.MonadWithGraph2().Monad0();
|
38055
38009
|
const $0 = Monad0.Applicative0();
|
@@ -38185,22 +38139,22 @@ var closeDefs = (dictMonadWithGraphAlloc) => {
|
|
38185
38139
|
const traverse2 = traversableDict.traverse(Monad0.Applicative0());
|
38186
38140
|
return (\u03B3) => (\u03C1) => (\u03B1s) => Functor0.map(Env)(traverse2((\u03C3) => {
|
38187
38141
|
const \u03C1$p = forDefs(\u03C1)(\u03C3);
|
38188
|
-
const
|
38142
|
+
const $0 = $BaseVal(
|
38189
38143
|
"Fun",
|
38190
38144
|
$Fun(
|
38191
38145
|
"Closure",
|
38192
38146
|
(() => {
|
38193
|
-
const $
|
38147
|
+
const $02 = union1(fv(\u03C1$p))(fVElim.fv(\u03C3));
|
38194
38148
|
return filterWithKey((x2) => {
|
38195
|
-
const $1 = setSet(ordString).member(x2)($
|
38196
|
-
return (
|
38149
|
+
const $1 = setSet(ordString).member(x2)($02);
|
38150
|
+
return (v) => $1;
|
38197
38151
|
})(\u03B3);
|
38198
38152
|
})(),
|
38199
38153
|
\u03C1$p,
|
38200
38154
|
\u03C3
|
38201
38155
|
)
|
38202
38156
|
);
|
38203
|
-
return Functor0.map((f) => f(
|
38157
|
+
return Functor0.map((f) => f($0))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(\u03B1s)));
|
38204
38158
|
})(\u03C1));
|
38205
38159
|
};
|
38206
38160
|
var $$eval = (dictMonadWithGraphAlloc) => {
|
@@ -38225,22 +38179,13 @@ var $$eval = (dictMonadWithGraphAlloc) => {
|
|
38225
38179
|
return withMsg2("Variable lookup")(lookup$p(MonadThrow0)(showString)(mapEnvStringVal)(v1._1)(v));
|
38226
38180
|
}
|
38227
38181
|
if (v1.tag === "Int") {
|
38228
|
-
return Functor0.map((f) => f($BaseVal("Int", v1._2)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert3(ordVertex)(v1._1)()(v2))
|
38229
|
-
"Int",
|
38230
|
-
v1._2
|
38231
|
-
)))));
|
38182
|
+
return Functor0.map((f) => f($BaseVal("Int", v1._2)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert3(ordVertex)(v1._1)()(v2))));
|
38232
38183
|
}
|
38233
38184
|
if (v1.tag === "Float") {
|
38234
|
-
return Functor0.map((f) => f($BaseVal("Float", v1._2)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert3(ordVertex)(v1._1)()(v2))
|
38235
|
-
"Float",
|
38236
|
-
v1._2
|
38237
|
-
)))));
|
38185
|
+
return Functor0.map((f) => f($BaseVal("Float", v1._2)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert3(ordVertex)(v1._1)()(v2))));
|
38238
38186
|
}
|
38239
38187
|
if (v1.tag === "Str") {
|
38240
|
-
return Functor0.map((f) => f($BaseVal("Str", v1._2)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert3(ordVertex)(v1._1)()(v2))
|
38241
|
-
"Str",
|
38242
|
-
v1._2
|
38243
|
-
)))));
|
38188
|
+
return Functor0.map((f) => f($BaseVal("Str", v1._2)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert3(ordVertex)(v1._1)()(v2))));
|
38244
38189
|
}
|
38245
38190
|
if (v1.tag === "Dictionary") {
|
38246
38191
|
const $0 = v1._1;
|
@@ -38249,8 +38194,8 @@ var $$eval = (dictMonadWithGraphAlloc) => {
|
|
38249
38194
|
return (a) => $1(a)(v2);
|
38250
38195
|
})()))(v1._2)))((v3) => {
|
38251
38196
|
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));
|
38252
|
-
const
|
38253
|
-
return Functor0.map((f) => f(
|
38197
|
+
const $1 = $BaseVal("Dictionary", fromFoldable110(zipWith2(Tuple)(v4._1)(zipWith2(Tuple)(v4._2)(v3._2))));
|
38198
|
+
return Functor0.map((f) => f($1))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert3(ordVertex)($0)()(v2))));
|
38254
38199
|
});
|
38255
38200
|
}
|
38256
38201
|
if (v1.tag === "Constr") {
|
@@ -38280,11 +38225,7 @@ var $$eval = (dictMonadWithGraphAlloc) => {
|
|
38280
38225
|
})()))(() => Bind1.bind(traverse2((() => {
|
38281
38226
|
const $3 = $$eval(dictMonadWithGraphAlloc)(v);
|
38282
38227
|
return (a) => $3(a)(v2);
|
38283
|
-
})())($1))((vs) => Functor0.map((f) => f($BaseVal("Constr", $0, vs)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert3(ordVertex)($2)()(v2))
|
38284
|
-
"Constr",
|
38285
|
-
$0,
|
38286
|
-
vs
|
38287
|
-
)))))));
|
38228
|
+
})())($1))((vs) => Functor0.map((f) => f($BaseVal("Constr", $0, vs)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert3(ordVertex)($2)()(v2))))));
|
38288
38229
|
}
|
38289
38230
|
if (v1.tag === "Matrix") {
|
38290
38231
|
const $0 = v1._2;
|
@@ -38312,21 +38253,18 @@ var $$eval = (dictMonadWithGraphAlloc) => {
|
|
38312
38253
|
return $8;
|
38313
38254
|
})())))($0)(v2)
|
38314
38255
|
]))
|
38315
|
-
])))((vss) => Functor0.map((f) => f($BaseVal("Matrix", $Tuple(vss, $Tuple($Tuple($4, $6), $Tuple($5, $7))))))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert3(ordVertex)($3)()(v2))
|
38316
|
-
"Matrix",
|
38317
|
-
$Tuple(vss, $Tuple($Tuple($4, $6), $Tuple($5, $7)))
|
38318
|
-
)))))));
|
38256
|
+
])))((vss) => Functor0.map((f) => f($BaseVal("Matrix", $Tuple(vss, $Tuple($Tuple($4, $6), $Tuple($5, $7))))))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert3(ordVertex)($3)()(v2))))));
|
38319
38257
|
});
|
38320
38258
|
}
|
38321
38259
|
if (v1.tag === "Lambda") {
|
38322
|
-
const
|
38260
|
+
const $0 = $BaseVal(
|
38323
38261
|
"Fun",
|
38324
38262
|
$Fun(
|
38325
38263
|
"Closure",
|
38326
38264
|
(() => {
|
38327
|
-
const $
|
38265
|
+
const $02 = fVElim.fv(v1._2);
|
38328
38266
|
return filterWithKey((x2) => {
|
38329
|
-
const $1 = setSet(ordString).member(x2)($
|
38267
|
+
const $1 = setSet(ordString).member(x2)($02);
|
38330
38268
|
return (v$1) => $1;
|
38331
38269
|
})(v);
|
38332
38270
|
})(),
|
@@ -38334,7 +38272,7 @@ var $$eval = (dictMonadWithGraphAlloc) => {
|
|
38334
38272
|
v1._2
|
38335
38273
|
)
|
38336
38274
|
);
|
38337
|
-
return Functor0.map((f) => f(
|
38275
|
+
return Functor0.map((f) => f($0))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert3(ordVertex)(v1._1)()(v2))));
|
38338
38276
|
}
|
38339
38277
|
if (v1.tag === "Project") {
|
38340
38278
|
const $0 = v1._2;
|
@@ -38433,7 +38371,7 @@ var apply2 = (dictMonadWithGraphAlloc) => {
|
|
38433
38371
|
v._1,
|
38434
38372
|
void 0,
|
38435
38373
|
Leaf2
|
38436
|
-
))
|
38374
|
+
))));
|
38437
38375
|
}
|
38438
38376
|
return $2._1["op'"](dictMonadWithGraphAlloc)(MonadError1)(vs$p);
|
38439
38377
|
}
|
@@ -38484,26 +38422,26 @@ var apply2 = (dictMonadWithGraphAlloc) => {
|
|
38484
38422
|
};
|
38485
38423
|
return go(0)($2) < (n - 1 | 0);
|
38486
38424
|
})()) {
|
38487
|
-
const
|
38425
|
+
const $42 = $BaseVal(
|
38488
38426
|
"Fun",
|
38489
38427
|
$Fun("PartialConstr", $1, foldableList.foldr(Cons)($List("Cons", v1, Nil))($2))
|
38490
38428
|
);
|
38491
|
-
return Functor0.map((f) => f(
|
38429
|
+
return Functor0.map((f) => f($42))(Functor0.map(Val)(dictMonadWithGraphAlloc.new($$$Map(
|
38492
38430
|
"Two",
|
38493
38431
|
Leaf2,
|
38494
38432
|
$3,
|
38495
38433
|
void 0,
|
38496
38434
|
Leaf2
|
38497
|
-
))
|
38435
|
+
))));
|
38498
38436
|
}
|
38499
|
-
const
|
38500
|
-
return Functor0.map((f) => f(
|
38437
|
+
const $4 = $BaseVal("Constr", $1, foldableList.foldr(Cons)($List("Cons", v1, Nil))($2));
|
38438
|
+
return Functor0.map((f) => f($4))(Functor0.map(Val)(dictMonadWithGraphAlloc.new($$$Map(
|
38501
38439
|
"Two",
|
38502
38440
|
Leaf2,
|
38503
38441
|
$3,
|
38504
38442
|
void 0,
|
38505
38443
|
Leaf2
|
38506
|
-
))
|
38444
|
+
))));
|
38507
38445
|
});
|
38508
38446
|
}
|
38509
38447
|
}
|
@@ -38570,13 +38508,13 @@ var graphEval = (dictMonadError) => {
|
|
38570
38508
|
const $1 = v["\u03B3"];
|
38571
38509
|
const $2 = spyFunWhen(false)("fwdSlice")((x2) => $Tuple(showVertices(x2._1), showEdgeList(toEdgeList(graphGraphImpl)(x2._2))))(showGraph(graphGraphImpl))(fwdSlice2);
|
38572
38510
|
const $3 = spyFunWhen(false)("bwdSlice")((x2) => $Tuple(showVertices(x2._1), showEdgeList(toEdgeList(graphGraphImpl)(x2._2))))(showGraph(graphGraphImpl))(bwdSlice2);
|
38573
|
-
return Monad0.Bind1().bind(runAllocT(Monad0)(bindStateT2.bind(alloc(e))((e\u03B1) => bindStateT2.bind(runWithGraphT_spy2(eval1($1)(e\u03B1)(Leaf2))(
|
38511
|
+
return Monad0.Bind1().bind(runAllocT(Monad0)(bindStateT2.bind(alloc(e))((e\u03B1) => bindStateT2.bind(runWithGraphT_spy2(eval1($1)(e\u03B1)(Leaf2))(foldableEnvExpr.foldl((m) => (a) => insert3(ordVertex)(a)()(m))(Leaf2)($EnvExpr(
|
38574
38512
|
$1,
|
38575
38513
|
e\u03B1
|
38576
38514
|
))))((v1) => {
|
38577
38515
|
const $4 = v1._1;
|
38578
38516
|
const $5 = v1._2;
|
38579
|
-
return bindStateT2.bind(check2(difference2(ordVertex)(
|
38517
|
+
return bindStateT2.bind(check2(difference2(ordVertex)(foldableBaseVal.foldl((m) => (a) => insert3(ordVertex)(a)()(m))(insert3(ordVertex)($5._1)()(Leaf2))($5._2))($4._1.vertices).tag === "Leaf")("outputs in graph"))(() => applicativeStateT(Monad0).pure($Tuple(
|
38580
38518
|
$4,
|
38581
38519
|
$Tuple($EnvExpr($1, e\u03B1), $5)
|
38582
38520
|
)));
|
@@ -42918,7 +42856,6 @@ var apply2Bwd = (dictAnn) => {
|
|
42918
42856
|
};
|
42919
42857
|
|
42920
42858
|
// output-es/Primitive.Defs/index.js
|
42921
|
-
var pack9 = (x2) => (k) => k(showBaseVal)(x2);
|
42922
42859
|
var erase = /* @__PURE__ */ (() => functorVal.map((v) => {
|
42923
42860
|
}))();
|
42924
42861
|
var unzip6 = /* @__PURE__ */ unzip3(functorDict);
|
@@ -42928,24 +42865,11 @@ var foldWithIndexM = (dictMonad) => (f) => (a0) => foldableWithIndexStringDi.fol
|
|
42928
42865
|
return (a) => $0(a)(b);
|
42929
42866
|
})()))(dictMonad.Applicative0().pure(a0));
|
42930
42867
|
var disjointUnion5 = /* @__PURE__ */ disjointUnion(mapDictString);
|
42931
|
-
var unary2 = /* @__PURE__ */ unary(
|
42932
|
-
var
|
42933
|
-
|
42934
|
-
|
42935
|
-
|
42936
|
-
}
|
42937
|
-
if (v.tag === "Right") {
|
42938
|
-
return "(Right " + showNumberImpl(v._1) + ")";
|
42939
|
-
}
|
42940
|
-
fail();
|
42941
|
-
}
|
42942
|
-
};
|
42943
|
-
var binary2 = /* @__PURE__ */ binary(showEither)(boundedJoinSemilatticeUni);
|
42944
|
-
var binaryZero2 = /* @__PURE__ */ (() => binaryZero(showEither)(boundedJoinSemilatticeUni)({
|
42945
|
-
isZero: fanin2(isZeroInt.isZero)(isZeroNumber.isZero)
|
42946
|
-
}))();
|
42947
|
-
var binary1 = /* @__PURE__ */ binary(showBoolean)(boundedJoinSemilatticeUni);
|
42948
|
-
var binaryZero1 = /* @__PURE__ */ binaryZero(showInt)(boundedJoinSemilatticeUni)(isZeroInt);
|
42868
|
+
var unary2 = /* @__PURE__ */ unary(boundedJoinSemilatticeUni);
|
42869
|
+
var binary2 = /* @__PURE__ */ binary(boundedJoinSemilatticeUni);
|
42870
|
+
var binaryZero2 = /* @__PURE__ */ binaryZero(boundedJoinSemilatticeUni);
|
42871
|
+
var binaryZero1 = /* @__PURE__ */ (() => binaryZero2({ isZero: fanin2(isZeroInt.isZero)(isZeroNumber.isZero) }))();
|
42872
|
+
var binaryZero22 = /* @__PURE__ */ binaryZero2(isZeroInt);
|
42949
42873
|
var pow3 = /* @__PURE__ */ union5(asNumberIntOrNumber)(asNumberIntOrNumber)(asIntNumber)(asIntNumber)((x2) => (y2) => pow(toNumber(x2))(toNumber(y2)))(pow);
|
42950
42874
|
var numToStr = (v2) => {
|
42951
42875
|
if (v2.tag === "Left") {
|
@@ -42967,14 +42891,14 @@ var matrixUpdate = /* @__PURE__ */ $Tuple(
|
|
42967
42891
|
return (v) => {
|
42968
42892
|
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") {
|
42969
42893
|
const $0 = v._2._2._1;
|
42970
|
-
const
|
42971
|
-
return Functor0.map((f) => f(
|
42894
|
+
const $1 = $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));
|
42895
|
+
return Functor0.map((f) => f($1))(Functor0.map(Val)(dictMonadWithGraphAlloc.new($$$Map(
|
42972
42896
|
"Two",
|
42973
42897
|
Leaf2,
|
42974
42898
|
v._1._1,
|
42975
42899
|
void 0,
|
42976
42900
|
Leaf2
|
42977
|
-
))
|
42901
|
+
))));
|
42978
42902
|
}
|
42979
42903
|
return MonadThrow0.throwError(error("Matrix, pair of integers and value expected"));
|
42980
42904
|
};
|
@@ -43156,31 +43080,28 @@ var dims = /* @__PURE__ */ $Tuple(
|
|
43156
43080
|
const Functor0 = Bind1.Apply0().Functor0();
|
43157
43081
|
return (v) => {
|
43158
43082
|
if (v.tag === "Cons" && v._1._2.tag === "Matrix" && v._2.tag === "Nil") {
|
43159
|
-
const $0 = v._1._2._1._2.
|
43160
|
-
const $1 = v._1.
|
43161
|
-
const $2 = v._1._1;
|
43162
|
-
|
43163
|
-
return Bind1.bind(Functor0.map((f) => f($BaseVal("Int", $0)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new($$$Map(
|
43083
|
+
const $0 = v._1._2._1._2._2._1;
|
43084
|
+
const $1 = v._1._1;
|
43085
|
+
const $2 = v._1._2._1._2._2._2;
|
43086
|
+
return Bind1.bind(Functor0.map((f) => f($BaseVal("Int", v._1._2._1._2._1._1)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new($$$Map(
|
43164
43087
|
"Two",
|
43165
43088
|
Leaf2,
|
43166
43089
|
v._1._2._1._2._1._2,
|
43167
43090
|
void 0,
|
43168
43091
|
Leaf2
|
43169
|
-
))
|
43092
|
+
)))))((v1) => Bind1.bind(Functor0.map((f) => f($BaseVal("Int", $0)))(Functor0.map(Val)(dictMonadWithGraphAlloc.new($$$Map(
|
43170
43093
|
"Two",
|
43171
43094
|
Leaf2,
|
43172
|
-
$
|
43095
|
+
$2,
|
43173
43096
|
void 0,
|
43174
43097
|
Leaf2
|
43175
|
-
))
|
43176
|
-
"
|
43177
|
-
|
43178
|
-
$
|
43179
|
-
|
43180
|
-
|
43181
|
-
|
43182
|
-
$List("Cons", v1, $List("Cons", v2, Nil))
|
43183
|
-
)))))));
|
43098
|
+
)))))((v2) => Functor0.map((f) => f($BaseVal("Constr", "Pair", $List("Cons", v1, $List("Cons", v2, Nil)))))(Functor0.map(Val)(dictMonadWithGraphAlloc.new($$$Map(
|
43099
|
+
"Two",
|
43100
|
+
Leaf2,
|
43101
|
+
$1,
|
43102
|
+
void 0,
|
43103
|
+
Leaf2
|
43104
|
+
))))));
|
43184
43105
|
}
|
43185
43106
|
return MonadThrow0.throwError(error("Matrix expected"));
|
43186
43107
|
};
|
@@ -43260,7 +43181,7 @@ var dict_map = /* @__PURE__ */ $Tuple(
|
|
43260
43181
|
$1,
|
43261
43182
|
void 0,
|
43262
43183
|
Leaf2
|
43263
|
-
))
|
43184
|
+
)))));
|
43264
43185
|
}
|
43265
43186
|
return MonadThrow0.throwError(error("Function and dictionary expected"));
|
43266
43187
|
};
|
@@ -43325,31 +43246,27 @@ var dict_intersectionWith = /* @__PURE__ */ $Tuple(
|
|
43325
43246
|
const Bind1 = Monad0.Bind1();
|
43326
43247
|
const Apply0 = Bind1.Apply0();
|
43327
43248
|
const $0 = Apply0.Functor0();
|
43328
|
-
const
|
43249
|
+
const sequence1 = traversableDict.sequence(Monad0.Applicative0());
|
43329
43250
|
return (v) => {
|
43330
43251
|
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") {
|
43331
43252
|
const $1 = v._1;
|
43332
|
-
|
43333
|
-
const $3 = v._2._2._1._1;
|
43334
|
-
const v$p = $0.map(Dictionary3)($0.map(DictRep)(traversableDict.traverse(Applicative0)(identity19)(intersectionWith_Object((v2) => (v3) => {
|
43335
|
-
const $4 = v3._2;
|
43336
|
-
const $5 = v2._1;
|
43337
|
-
const $6 = v3._1;
|
43338
|
-
return Bind1.bind(Bind1.bind(apply4($1)(v2._2))((a) => apply4(a)($4)))((v4) => Bind1.bind(dictMonadWithGraphAlloc.new(insert3(ordVertex)($6)()($$$Map(
|
43339
|
-
"Two",
|
43340
|
-
Leaf2,
|
43341
|
-
$5,
|
43342
|
-
void 0,
|
43343
|
-
Leaf2
|
43344
|
-
)))(pack9(v4._2)))((\u03B2$p$p) => $0.map(Tuple(\u03B2$p$p))(Applicative0.pure(v4))));
|
43345
|
-
})(v._2._1._2._1)(v._2._2._1._2._1))));
|
43346
|
-
return Bind1.bind(v$p)((packable) => Apply0.apply($0.map(Val)(dictMonadWithGraphAlloc.new(insert3(ordVertex)($3)()($$$Map(
|
43253
|
+
return Apply0.apply($0.map(Val)(dictMonadWithGraphAlloc.new(insert3(ordVertex)(v._2._2._1._1)()($$$Map(
|
43347
43254
|
"Two",
|
43348
43255
|
Leaf2,
|
43349
|
-
|
43256
|
+
v._2._1._1,
|
43350
43257
|
void 0,
|
43351
43258
|
Leaf2
|
43352
|
-
)))(
|
43259
|
+
)))))($0.map(Dictionary3)($0.map(DictRep)(sequence1(intersectionWith_Object((v2) => (v3) => {
|
43260
|
+
const $2 = v2._2;
|
43261
|
+
const $3 = v3._2;
|
43262
|
+
return Bind1.bind(dictMonadWithGraphAlloc.new(insert3(ordVertex)(v3._1)()($$$Map(
|
43263
|
+
"Two",
|
43264
|
+
Leaf2,
|
43265
|
+
v2._1,
|
43266
|
+
void 0,
|
43267
|
+
Leaf2
|
43268
|
+
))))((\u03B2$p$p) => $0.map(Tuple(\u03B2$p$p))(Bind1.bind(apply4($1)($2))((a) => apply4(a)($3))));
|
43269
|
+
})(v._2._1._2._1)(v._2._2._1._2._1)))));
|
43353
43270
|
}
|
43354
43271
|
return MonadThrow0.throwError(error("Function and two dictionaries expected"));
|
43355
43272
|
};
|
@@ -43582,14 +43499,14 @@ var dict_disjointUnion = /* @__PURE__ */ $Tuple(
|
|
43582
43499
|
const Functor0 = MonadThrow0.Monad0().Bind1().Apply0().Functor0();
|
43583
43500
|
return (v) => {
|
43584
43501
|
if (v.tag === "Cons" && v._1._2.tag === "Dictionary" && v._2.tag === "Cons" && v._2._1._2.tag === "Dictionary" && v._2._2.tag === "Nil") {
|
43585
|
-
const
|
43586
|
-
return Functor0.map((f) => f(
|
43502
|
+
const $0 = $BaseVal("Dictionary", disjointUnion5(v._1._2._1)(v._2._1._2._1));
|
43503
|
+
return Functor0.map((f) => f($0))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert3(ordVertex)(v._2._1._1)()($$$Map(
|
43587
43504
|
"Two",
|
43588
43505
|
Leaf2,
|
43589
43506
|
v._1._1,
|
43590
43507
|
void 0,
|
43591
43508
|
Leaf2
|
43592
|
-
)))
|
43509
|
+
)))));
|
43593
43510
|
}
|
43594
43511
|
return MonadThrow0.throwError(error("Dictionaries expected"));
|
43595
43512
|
};
|
@@ -43630,14 +43547,14 @@ var dict_difference = /* @__PURE__ */ $Tuple(
|
|
43630
43547
|
const Functor0 = MonadThrow0.Monad0().Bind1().Apply0().Functor0();
|
43631
43548
|
return (v) => {
|
43632
43549
|
if (v.tag === "Cons" && v._1._2.tag === "Dictionary" && v._2.tag === "Cons" && v._2._1._2.tag === "Dictionary" && v._2._2.tag === "Nil") {
|
43633
|
-
const
|
43634
|
-
return Functor0.map((f) => f(
|
43550
|
+
const $0 = $BaseVal("Dictionary", mapFObjectString.difference(v._1._2._1)(v._2._1._2._1));
|
43551
|
+
return Functor0.map((f) => f($0))(Functor0.map(Val)(dictMonadWithGraphAlloc.new(insert3(ordVertex)(v._2._1._1)()($$$Map(
|
43635
43552
|
"Two",
|
43636
43553
|
Leaf2,
|
43637
43554
|
v._1._1,
|
43638
43555
|
void 0,
|
43639
43556
|
Leaf2
|
43640
|
-
)))
|
43557
|
+
)))));
|
43641
43558
|
}
|
43642
43559
|
return MonadThrow0.throwError(error("Dictionaries expected."));
|
43643
43560
|
};
|
@@ -43706,8 +43623,8 @@ var primitives = /* @__PURE__ */ fromFoldable(foldableArray)([
|
|
43706
43623
|
/* @__PURE__ */ extern1(dims),
|
43707
43624
|
/* @__PURE__ */ extern1(error_),
|
43708
43625
|
/* @__PURE__ */ unary2("floor")({ i: number5, o: $$int, fwd: floor2 }),
|
43709
|
-
/* @__PURE__ */
|
43710
|
-
/* @__PURE__ */
|
43626
|
+
/* @__PURE__ */ unary2("log")({ i: intOrNumber, o: number5, fwd: log3 }),
|
43627
|
+
/* @__PURE__ */ unary2("numToStr")({ i: intOrNumber, o: string2, fwd: numToStr }),
|
43711
43628
|
/* @__PURE__ */ binary2("+")({
|
43712
43629
|
i1: intOrNumber,
|
43713
43630
|
i2: intOrNumber,
|
@@ -43720,30 +43637,25 @@ var primitives = /* @__PURE__ */ fromFoldable(foldableArray)([
|
|
43720
43637
|
o: intOrNumber,
|
43721
43638
|
fwd: /* @__PURE__ */ union5(asIntIntOrNumber)(asNumberIntOrNumber)(asIntNumber)(asIntNumber)(intSub)(numSub)
|
43722
43639
|
}),
|
43723
|
-
/* @__PURE__ */
|
43640
|
+
/* @__PURE__ */ binaryZero1("*")({
|
43724
43641
|
i: intOrNumber,
|
43725
43642
|
o: intOrNumber,
|
43726
43643
|
fwd: /* @__PURE__ */ union5(asIntIntOrNumber)(asNumberIntOrNumber)(asIntNumber)(asIntNumber)(intMul)(numMul)
|
43727
43644
|
}),
|
43728
|
-
/* @__PURE__ */
|
43729
|
-
/* @__PURE__ */
|
43730
|
-
/* @__PURE__ */
|
43645
|
+
/* @__PURE__ */ binaryZero1("**")({ i: intOrNumber, o: intOrNumber, fwd: pow3 }),
|
43646
|
+
/* @__PURE__ */ binaryZero1("/")({ i: intOrNumber, o: intOrNumber, fwd: divide }),
|
43647
|
+
/* @__PURE__ */ binary2("==")({
|
43731
43648
|
i1: intOrNumberOrString,
|
43732
43649
|
i2: intOrNumberOrString,
|
43733
43650
|
o: $$boolean,
|
43734
43651
|
fwd: /* @__PURE__ */ union5(asBooleanBoolean)(asBooleanBoolean)(asIntNumberOrString)(asIntNumberOrString)(eqIntImpl)(/* @__PURE__ */ unionStr(asBooleanBoolean)(asNumberString)(eqNumberImpl)(eqStringImpl))
|
43735
43652
|
}),
|
43736
|
-
/* @__PURE__ */
|
43737
|
-
/* @__PURE__ */
|
43738
|
-
/* @__PURE__ */
|
43739
|
-
/* @__PURE__ */
|
43740
|
-
/* @__PURE__ */
|
43741
|
-
/* @__PURE__ */
|
43742
|
-
i1: string2,
|
43743
|
-
i2: string2,
|
43744
|
-
o: string2,
|
43745
|
-
fwd: concatString
|
43746
|
-
}),
|
43653
|
+
/* @__PURE__ */ binary2("/=")({ i1: intOrNumberOrString, i2: intOrNumberOrString, o: $$boolean, fwd: notEquals }),
|
43654
|
+
/* @__PURE__ */ binary2("<")({ i1: intOrNumberOrString, i2: intOrNumberOrString, o: $$boolean, fwd: lessThan }),
|
43655
|
+
/* @__PURE__ */ binary2(">")({ i1: intOrNumberOrString, i2: intOrNumberOrString, o: $$boolean, fwd: greaterThan }),
|
43656
|
+
/* @__PURE__ */ binary2("<=")({ i1: intOrNumberOrString, i2: intOrNumberOrString, o: $$boolean, fwd: lessThanEquals }),
|
43657
|
+
/* @__PURE__ */ binary2(">=")({ i1: intOrNumberOrString, i2: intOrNumberOrString, o: $$boolean, fwd: greaterThanEquals }),
|
43658
|
+
/* @__PURE__ */ binary2("++")({ i1: string2, i2: string2, o: string2, fwd: concatString }),
|
43747
43659
|
/* @__PURE__ */ extern1(matrixLookup),
|
43748
43660
|
/* @__PURE__ */ extern1(dict_difference),
|
43749
43661
|
/* @__PURE__ */ extern1(dict_disjointUnion),
|
@@ -43752,10 +43664,10 @@ var primitives = /* @__PURE__ */ fromFoldable(foldableArray)([
|
|
43752
43664
|
/* @__PURE__ */ extern1(dict_intersectionWith),
|
43753
43665
|
/* @__PURE__ */ extern1(dict_map),
|
43754
43666
|
/* @__PURE__ */ extern1(matrixUpdate),
|
43755
|
-
/* @__PURE__ */
|
43756
|
-
/* @__PURE__ */
|
43757
|
-
/* @__PURE__ */
|
43758
|
-
/* @__PURE__ */
|
43667
|
+
/* @__PURE__ */ binaryZero22("div")({ i: $$int, o: $$int, fwd: intDiv2 }),
|
43668
|
+
/* @__PURE__ */ binaryZero22("mod")({ i: $$int, o: $$int, fwd: intMod }),
|
43669
|
+
/* @__PURE__ */ binaryZero22("quot")({ i: $$int, o: $$int, fwd: quot }),
|
43670
|
+
/* @__PURE__ */ binaryZero22("rem")({ i: $$int, o: $$int, fwd: rem })
|
43759
43671
|
]);
|
43760
43672
|
|
43761
43673
|
// output-es/ProgCxt/index.js
|
@@ -43840,7 +43752,6 @@ var traversableProgCxt = {
|
|
43840
43752
|
|
43841
43753
|
// output-es/Module/index.js
|
43842
43754
|
var boundedLattice2 = { BoundedJoinSemilattice0: () => boundedJoinSemilatticeUni, BoundedMeetSemilattice1: () => boundedMeetSemilatticeUni };
|
43843
|
-
var verticesVertex2 = /* @__PURE__ */ verticesVertex(functorProgCxt)(foldableProgCxt);
|
43844
43755
|
var concatM2 = (dictMonad) => foldrArray((() => {
|
43845
43756
|
const $0 = dictMonad.Bind1();
|
43846
43757
|
return (f) => (g) => (a) => $0.bind(f(a))(g);
|
@@ -43897,7 +43808,7 @@ var initialConfig = (dictMonadError) => {
|
|
43897
43808
|
Bind1: () => bindStateT(Monad0)
|
43898
43809
|
})(graphGraphImpl);
|
43899
43810
|
const eval_progCxt2 = eval_progCxt(monadWithGraphAllocWithGr(dictMonadError));
|
43900
|
-
return (dictFV) => (e) => (progCxt) => Bind1.bind(Applicative0.pure())(() => Bind1.bind(runAllocT(Monad0)($1.bind(alloc(progCxt))((progCxt$p) => $1.bind(runWithGraphT_spy2(eval_progCxt2(progCxt$p))(
|
43811
|
+
return (dictFV) => (e) => (progCxt) => Bind1.bind(Applicative0.pure())(() => Bind1.bind(runAllocT(Monad0)($1.bind(alloc(progCxt))((progCxt$p) => $1.bind(runWithGraphT_spy2(eval_progCxt2(progCxt$p))(foldableProgCxt.foldl((m) => (a) => insert3(ordVertex)(a)()(m))(Leaf2)(progCxt$p)))((v) => applicativeStateT(Monad0).pure($Tuple(
|
43901
43812
|
progCxt$p,
|
43902
43813
|
(() => {
|
43903
43814
|
const $2 = dictFV.fv(e);
|