math-exercises 2.2.9 → 2.2.10

package/lib/tree/nodes/operators/limitNode.d.ts

@@ -1,4 +1,4 @@
-import { Node, NodeOptions, NodeType, ToTexOptions } from "../node";
+import { Node, NodeIds, NodeOptions, NodeType, ToTexOptions } from "../node";
 import { OperatorIds, OperatorNode } from "./operatorNode";
 import { AlgebraicNode, SimplifyOptions } from "../algebraicNode";
 export declare function isLimitNode(a: Node): a is LimitNode;
@@ -20,6 +20,16 @@ export declare class LimitNode implements OperatorNode {
     constructor(leftChild: AlgebraicNode, rightChild: AlgebraicNode, from?: "+" | "-", opts?: NodeOptions);
     toMathString(): string;
     toEquivalentNodes(opts?: NodeOptions | undefined): this[];
+    toIdentifiers(): {
+        id: NodeIds;
+        leftChild: {
+            id: NodeIds;
+        } & Record<string, any>;
+        rightChild: {
+            id: NodeIds;
+        } & Record<string, any>;
+        from: "-" | "+" | undefined;
+    };
     toAllValidTexs(): string[];
     toTex(opts?: ToTexOptions): string;
     evaluate(vars: Record<string, number>): number;

package/lib/tree/nodes/operators/limitNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"limitNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/limitNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACpE,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAG3E,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAElE,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,SAAS,CAEnD;AAED,qBAAa,SAAU,YAAW,YAAY;IAC5C,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;IACnB,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,SAAS,CAAC;IAE5B;;;;;;OAMG;gBAED,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,GAAG,GAAG,GAAG,EAChB,IAAI,CAAC,EAAE,WAAW;IAWpB,YAAY,IAAI,MAAM;IAItB,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS;IAIhD,cAAc,IAAI,MAAM,EAAE;IAI1B,KAAK,CAAC,IAAI,CAAC,EAAE,YAAY,GAAG,MAAM;IAWlC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM;IAI9C,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,GAAG,aAAa;IAG/C,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;CAOrC"}
+{"version":3,"file":"limitNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/limitNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAC7E,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAG3E,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAElE,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,SAAS,CAEnD;AAED,qBAAa,SAAU,YAAW,YAAY;IAC5C,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;IACnB,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,SAAS,CAAC;IAE5B;;;;;;OAMG;gBAED,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,GAAG,GAAG,GAAG,EAChB,IAAI,CAAC,EAAE,WAAW;IAWpB,YAAY,IAAI,MAAM;IAItB,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS;IAGhD,aAAa;;;;;;;;;;IAQb,cAAc,IAAI,MAAM,EAAE;IAI1B,KAAK,CAAC,IAAI,CAAC,EAAE,YAAY,GAAG,MAAM;IAWlC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM;IAI9C,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,GAAG,aAAa;IAG/C,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;CAOrC"}

package/lib/tree/nodes/operators/limitNode.js

@@ -31,6 +31,14 @@ class LimitNode {
     toEquivalentNodes(opts) {
         return [this];
     }
+    toIdentifiers() {
+        return {
+            id: node_1.NodeIds.limit,
+            leftChild: this.leftChild.toIdentifiers(),
+            rightChild: this.rightChild.toIdentifiers(),
+            from: this.from,
+        };
+    }
     toAllValidTexs() {
         return this.toEquivalentNodes().map((node) => node.toTex());
     }

package/lib/tree/nodes/operators/multiplyNode.d.ts

@@ -1,4 +1,4 @@
-import { Node, NodeOptions, NodeType, ToTexOptions } from "../node";
+import { Node, NodeIds, NodeOptions, NodeType, ToTexOptions } from "../node";
 import { CommutativeOperatorNode, OperatorIds } from "./operatorNode";
 import { AlgebraicNode, SimplifyOptions } from "../algebraicNode";
 export declare function isMultiplyNode(a: Node): a is MultiplyNode;
@@ -17,6 +17,15 @@ export declare class MultiplyNode implements CommutativeOperatorNode {
     toAllTexs(): string[];
     toEquivalentNodes(opts?: NodeOptions): MultiplyNode[];
     toAllValidTexs(opts?: NodeOptions): string[];
+    toIdentifiers(): {
+        id: NodeIds;
+        leftChild: {
+            id: NodeIds;
+        } & Record<string, any>;
+        rightChild: {
+            id: NodeIds;
+        } & Record<string, any>;
+    };
     evaluate(vars: Record<string, number>): number;
     copy(): MultiplyNode;
     simplify(opts?: SimplifyOptions): AlgebraicNode;

package/lib/tree/nodes/operators/multiplyNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"multiplyNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/multiplyNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACpE,OAAO,EACL,uBAAuB,EACvB,WAAW,EAEZ,MAAM,gBAAgB,CAAC;AAYxB,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAOlE,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AAED,eAAO,MAAM,iBAAiB,QAAS,aAAa,EAAE,SAWrD,CAAC;AACF,qBAAa,YAAa,YAAW,uBAAuB;IAC1D,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IAUpB,OAAO,aAGL;IAEF,YAAY,IAAI,MAAM;IAItB,KAAK,CAAC,IAAI,CAAC,EAAE,YAAY,GAAG,MAAM;IA4DlC,SAAS;IAkDT,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,YAAY,EAAE;IAwFrD,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAQ5C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAIrC,IAAI;IAGJ,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,GAAG,aAAa;IA0H/C,MAAM,CAAC,IAAI,EAAE,aAAa;CAU3B"}
+{"version":3,"file":"multiplyNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/multiplyNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAC7E,OAAO,EACL,uBAAuB,EACvB,WAAW,EAEZ,MAAM,gBAAgB,CAAC;AAYxB,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAOlE,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AAED,eAAO,MAAM,iBAAiB,QAAS,aAAa,EAAE,SAWrD,CAAC;AACF,qBAAa,YAAa,YAAW,uBAAuB;IAC1D,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IAUpB,OAAO,aAGL;IAEF,YAAY,IAAI,MAAM;IAItB,KAAK,CAAC,IAAI,CAAC,EAAE,YAAY,GAAG,MAAM;IA4DlC,SAAS;IAkDT,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,YAAY,EAAE;IAwFrD,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAG5C,aAAa;;;;;;;;;IAYb,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAIrC,IAAI;IAGJ,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,GAAG,aAAa;IA0H/C,MAAM,CAAC,IAAI,EAAE,aAAa;CAU3B"}

package/lib/tree/nodes/operators/multiplyNode.js

@@ -202,6 +202,13 @@ class MultiplyNode {
     toAllValidTexs(opts) {
         return this.toEquivalentNodes(opts).flatMap((node) => node.toAllTexs());
     }
+    toIdentifiers() {
+        return {
+            id: node_1.NodeIds.multiply,
+            leftChild: this.leftChild.toIdentifiers(),
+            rightChild: this.rightChild.toIdentifiers(),
+        };
+    }
     // toMathjs() {
     //   return multiply(this.leftChild.toMathjs(), this.rightChild.toMathjs());
     // }

package/lib/tree/nodes/operators/powerNode.d.ts

@@ -1,4 +1,4 @@
-import { Node, NodeOptions, NodeType } from "../node";
+import { Node, NodeIds, NodeOptions, NodeType } from "../node";
 import { OperatorIds, OperatorNode } from "./operatorNode";
 import { AlgebraicNode, SimplifyOptions } from "../algebraicNode";
 export declare function isPowerNode(a: Node): a is PowerNode;
@@ -11,6 +11,15 @@ export declare class PowerNode implements OperatorNode {
     isNumeric: boolean;
     constructor(leftChild: AlgebraicNode, rightChild: AlgebraicNode, opts?: NodeOptions);
     toMathString(): string;
+    toIdentifiers(): {
+        id: NodeIds;
+        left: {
+            id: NodeIds;
+        } & Record<string, any>;
+        right: {
+            id: NodeIds;
+        } & Record<string, any>;
+    };
     toEquivalentNodes(): AlgebraicNode[];
     toAllValidTexs(): string[];
     toTex(): string;

package/lib/tree/nodes/operators/powerNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"powerNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/powerNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAG3E,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAElE,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,SAAS,CAEnD;AAED,qBAAa,SAAU,YAAW,YAAY;IAC5C,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IAUpB,YAAY,IAAI,MAAM;IAItB,iBAAiB;IAqBjB,cAAc,IAAI,MAAM,EAAE;IAI1B,KAAK,IAAI,MAAM;IAuBf,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IA+FrC,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,GAAG,aAAa;IAqC/C,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;CAOrC;AAED,qBAAa,UAAW,SAAQ,SAAS;gBAC3B,KAAK,EAAE,aAAa,EAAE,IAAI,CAAC,EAAE,WAAW;CAGrD"}
+{"version":3,"file":"powerNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/powerNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAC/D,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAG3E,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAElE,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,SAAS,CAEnD;AAED,qBAAa,SAAU,YAAW,YAAY;IAC5C,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IAUpB,YAAY,IAAI,MAAM;IAGtB,aAAa;;;;;;;;;IAOb,iBAAiB;IAqBjB,cAAc,IAAI,MAAM,EAAE;IAI1B,KAAK,IAAI,MAAM;IAuBf,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IA+FrC,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,GAAG,aAAa;IAqC/C,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;CAOrC;AAED,qBAAa,UAAW,SAAQ,SAAS;gBAC3B,KAAK,EAAE,aAAa,EAAE,IAAI,CAAC,EAAE,WAAW;CAGrD"}

package/lib/tree/nodes/operators/powerNode.js

@@ -22,6 +22,13 @@ class PowerNode {
     toMathString() {
         return `(${this.leftChild.toMathString()})^(${this.rightChild.toMathString()})`;
     }
+    toIdentifiers() {
+        return {
+            id: node_1.NodeIds.power,
+            left: this.leftChild.toIdentifiers(),
+            right: this.rightChild.toIdentifiers(),
+        };
+    }
     toEquivalentNodes() {
         const res = [];
         const rightNodes = this.rightChild.toEquivalentNodes();

package/lib/tree/nodes/operators/substractNode.d.ts

@@ -1,4 +1,4 @@
-import { Node, NodeType } from "../node";
+import { Node, NodeIds, NodeType } from "../node";
 import { OperatorIds, OperatorNode } from "./operatorNode";
 import { AlgebraicNode, SimplifyOptions } from "../algebraicNode";
 export declare function isSubstractNode(a: Node): a is SubstractNode;
@@ -10,8 +10,18 @@ export declare class SubstractNode implements OperatorNode {
     isNumeric: boolean;
     constructor(leftChild: AlgebraicNode, rightChild: AlgebraicNode);
     toMathString(): string;
+    toIdentifiers(): {
+        id: NodeIds;
+        left: {
+            id: NodeIds;
+        } & Record<string, any>;
+        right: {
+            id: NodeIds;
+        } & Record<string, any>;
+    };
     toEquivalentNodes(): AlgebraicNode[];
     toAllValidTexs(): string[];
+    dangerouslyShuffle(): void;
     toTex(): string;
     evaluate(vars: Record<string, number>): number;
     simplify(opts?: SimplifyOptions): AlgebraicNode;

package/lib/tree/nodes/operators/substractNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"substractNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/substractNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAG3E,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAClE,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,aAAa,CAE3D;AACD,qBAAa,aAAc,YAAW,YAAY;IAChD,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBACP,SAAS,EAAE,aAAa,EAAE,UAAU,EAAE,aAAa;IAQ/D,YAAY,IAAI,MAAM;IAItB,iBAAiB,IAAI,aAAa,EAAE;IAapC,cAAc,IAAI,MAAM,EAAE;IAG1B,KAAK,IAAI,MAAM;IAef,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAMrC,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe;IAM/B,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;CAOrC"}
+{"version":3,"file":"substractNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/substractNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAClD,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAG3E,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAElE,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,aAAa,CAE3D;AACD,qBAAa,aAAc,YAAW,YAAY;IAChD,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBACP,SAAS,EAAE,aAAa,EAAE,UAAU,EAAE,aAAa;IAQ/D,YAAY,IAAI,MAAM;IAGtB,aAAa;;;;;;;;;IAOb,iBAAiB,IAAI,aAAa,EAAE;IAapC,cAAc,IAAI,MAAM,EAAE;IAG1B,kBAAkB;IAIlB,KAAK,IAAI,MAAM;IAef,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAMrC,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe;IAM/B,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;CAOrC"}

package/lib/tree/nodes/operators/substractNode.js

@@ -6,6 +6,7 @@ const node_1 = require("../node");
 const operatorNode_1 = require("./operatorNode");
 const oppositeNode_1 = require("../functions/oppositeNode");
 const addNode_1 = require("./addNode");
+const coinFlip_1 = require("../../../utils/coinFlip");
 function isSubstractNode(a) {
     return (0, operatorNode_1.isOperatorNode)(a) && a.id === operatorNode_1.OperatorIds.substract;
 }
@@ -21,6 +22,13 @@ class SubstractNode {
     toMathString() {
         return `${this.leftChild.toMathString()}-(${this.rightChild.toMathString()})`;
     }
+    toIdentifiers() {
+        return {
+            id: node_1.NodeIds.substract,
+            left: this.leftChild.toIdentifiers(),
+            right: this.rightChild.toIdentifiers(),
+        };
+    }
     toEquivalentNodes() {
         const res = [];
         const rightNodes = this.rightChild.toEquivalentNodes();
@@ -36,6 +44,10 @@ class SubstractNode {
     toAllValidTexs() {
         return this.toEquivalentNodes().map((node) => node.toTex());
     }
+    dangerouslyShuffle() {
+        if ((0, coinFlip_1.coinFlip)())
+            [this.leftChild, this.rightChild] = [this.rightChild, this.leftChild];
+    }
     toTex() {
         let rightTex = this.rightChild.toTex();
         let leftTex = this.leftChild.toTex();

package/lib/tree/nodes/sets/belongsNode.d.ts

@@ -1,4 +1,4 @@
-import { Node, NodeOptions, NodeType } from "../node";
+import { Node, NodeIds, NodeOptions, NodeType } from "../node";
 import { SetNode } from "./setNode";
 export declare class BelongsNode implements Node {
     type: NodeType;
@@ -11,5 +11,14 @@ export declare class BelongsNode implements Node {
     toMathString(): string;
     toMathjs(): string;
     toTex(): string;
+    toIdentifiers(): {
+        id: NodeIds;
+        leftChild: {
+            id: NodeIds;
+        } & Record<string, any>;
+        rightChild: {
+            id: NodeIds;
+        } & Record<string, any>;
+    };
 }
 //# sourceMappingURL=belongsNode.d.ts.map

package/lib/tree/nodes/sets/belongsNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"belongsNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/belongsNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEtD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,qBAAa,WAAY,YAAW,IAAI;IACtC,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,SAAS,EAAE,IAAI,CAAC;IAChB,UAAU,EAAE,OAAO,CAAC;gBACR,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,WAAW;IAMpE,cAAc;IAGd,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,IAAI,EAAE;IAc7C,YAAY;IAGZ,QAAQ;IAGR,KAAK;CAGN"}
+{"version":3,"file":"belongsNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/belongsNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAE/D,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,qBAAa,WAAY,YAAW,IAAI;IACtC,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,SAAS,EAAE,IAAI,CAAC;IAChB,UAAU,EAAE,OAAO,CAAC;gBACR,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,WAAW;IAMpE,cAAc;IAGd,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,IAAI,EAAE;IAc7C,YAAY;IAGZ,QAAQ;IAGR,KAAK;IAGL,aAAa;;;;;;;;;CAOd"}

package/lib/tree/nodes/sets/belongsNode.js

@@ -32,5 +32,12 @@ class BelongsNode {
     toTex() {
         return `${this.leftChild.toTex()}\\in${this.rightChild.toTex()}`;
     }
+    toIdentifiers() {
+        return {
+            id: node_1.NodeIds.belongs,
+            leftChild: this.leftChild.toIdentifiers(),
+            rightChild: this.rightChild.toIdentifiers(),
+        };
+    }
 }
 exports.BelongsNode = BelongsNode;

package/lib/tree/nodes/sets/closure.d.ts

@@ -11,5 +11,7 @@ export declare abstract class Closure {
     static rightReverse(closure: ClosureType): ClosureType;
     static switch(closure: ClosureType): ClosureType;
     static fromBrackets(left: "[" | "]", right: "]" | "["): ClosureType;
+    static isLeftOpen(closure: ClosureType): boolean;
+    static isRightOpen(closure: ClosureType): boolean;
 }
 //# sourceMappingURL=closure.d.ts.map

package/lib/tree/nodes/sets/closure.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"closure.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/closure.ts"],"names":[],"mappings":"AAEA,oBAAY,WAAW;IACrB,EAAE,IAAA;IACF,EAAE,IAAA;IACF,EAAE,IAAA;IACF,EAAE,IAAA;CACH;AAED,8BAAsB,OAAO;IAC3B,MAAM,CAAC,MAAM;IAcb,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,WAAW;IAYnC,MAAM,CAAC,WAAW,CAAC,OAAO,EAAE,WAAW;IAYvC,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,WAAW;IAYxC,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,WAAW;IAYlC,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,GAAG,GAAG,GAAG,EAAE,KAAK,EAAE,GAAG,GAAG,GAAG;CAOtD"}
+{"version":3,"file":"closure.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/closure.ts"],"names":[],"mappings":"AAEA,oBAAY,WAAW;IACrB,EAAE,IAAA;IACF,EAAE,IAAA;IACF,EAAE,IAAA;IACF,EAAE,IAAA;CACH;AAED,8BAAsB,OAAO;IAC3B,MAAM,CAAC,MAAM;IAcb,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,WAAW;IAYnC,MAAM,CAAC,WAAW,CAAC,OAAO,EAAE,WAAW;IAYvC,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,WAAW;IAYxC,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,WAAW;IAYlC,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,GAAG,GAAG,GAAG,EAAE,KAAK,EAAE,GAAG,GAAG,GAAG;IAQrD,MAAM,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW;IAUtC,MAAM,CAAC,WAAW,CAAC,OAAO,EAAE,WAAW;CAUxC"}

package/lib/tree/nodes/sets/closure.js

@@ -83,5 +83,25 @@ class Closure {
         else
             return ClosureType.OF;
     }
+    static isLeftOpen(closure) {
+        switch (closure) {
+            case ClosureType.FF:
+            case ClosureType.FO:
+                return false;
+            case ClosureType.OF:
+            case ClosureType.OO:
+                return true;
+        }
+    }
+    static isRightOpen(closure) {
+        switch (closure) {
+            case ClosureType.FF:
+            case ClosureType.OF:
+                return false;
+            case ClosureType.OO:
+            case ClosureType.FO:
+                return true;
+        }
+    }
 }
 exports.Closure = Closure;

package/lib/tree/nodes/sets/discreteSetNode.d.ts

@@ -1,13 +1,21 @@
-import { Node, NodeOptions, NodeType } from "../node";
+import { Node, NodeIds, NodeOptions, NodeType } from "../node";
 import { SetIds, SetNode } from "./setNode";
-export declare function isUnionIntervalNode(a: Node): a is DiscreteSetNode;
+export declare function isDiscreteSetNode(a: Node): a is DiscreteSetNode;
 export declare class DiscreteSetNode implements SetNode {
     type: NodeType;
     id: SetIds;
     opts?: NodeOptions | undefined;
     elements: Node[];
+    isEmpty: boolean;
     constructor(elements: Node[], opts?: NodeOptions);
+    isEmptySet(): boolean;
     toAllValidTexs(): string[];
+    toIdentifiers(): {
+        id: NodeIds;
+        children: ({
+            id: NodeIds;
+        } & Record<string, any>)[];
+    };
     toEquivalentNodes(opts?: NodeOptions): DiscreteSetNode[];
     toMathString(): string;
     toMathjs(): string;

package/lib/tree/nodes/sets/discreteSetNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"discreteSetNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/discreteSetNode.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAa,MAAM,WAAW,CAAC;AACvD,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,eAAe,CAEjE;AACD,qBAAa,eAAgB,YAAW,OAAO;IAC7C,IAAI,EAAE,QAAQ,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,QAAQ,EAAE,IAAI,EAAE,CAAC;gBACL,QAAQ,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,EAAE,WAAW;IAMhD,cAAc;IAGd,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAyBpC,YAAY;IAGZ,QAAQ;IAGR,KAAK;CAMN;AAED,eAAO,MAAM,QAAQ,iBAA0B,CAAC"}
+{"version":3,"file":"discreteSetNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/discreteSetNode.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAC/D,OAAO,EAAE,MAAM,EAAE,OAAO,EAAa,MAAM,WAAW,CAAC;AACvD,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,eAAe,CAE/D;AACD,qBAAa,eAAgB,YAAW,OAAO;IAC7C,IAAI,EAAE,QAAQ,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,QAAQ,EAAE,IAAI,EAAE,CAAC;IACjB,OAAO,EAAE,OAAO,CAAC;gBACL,QAAQ,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,EAAE,WAAW;IAOhD,UAAU;IAGV,cAAc;IAGd,aAAa;;;;;;IAMb,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAyBpC,YAAY;IAGZ,QAAQ;IAGR,KAAK;CAMN;AAED,eAAO,MAAM,QAAQ,iBAA0B,CAAC"}

package/lib/tree/nodes/sets/discreteSetNode.js

@@ -1,24 +1,34 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.EmptySet = exports.DiscreteSetNode = exports.isUnionIntervalNode = void 0;
+exports.EmptySet = exports.DiscreteSetNode = exports.isDiscreteSetNode = void 0;
 const cartesianProducts_1 = require("../../../utils/cartesianProducts");
 const permutations_1 = require("../../../utils/permutations");
 const node_1 = require("../node");
 const setNode_1 = require("./setNode");
-function isUnionIntervalNode(a) {
+function isDiscreteSetNode(a) {
     return (0, setNode_1.isSetNode)(a) && a.id === setNode_1.SetIds.discrete;
 }
-exports.isUnionIntervalNode = isUnionIntervalNode;
+exports.isDiscreteSetNode = isDiscreteSetNode;
 class DiscreteSetNode {
     constructor(elements, opts) {
         this.type = node_1.NodeType.set;
         this.id = setNode_1.SetIds.discrete;
         this.elements = elements;
         this.opts = opts;
+        this.isEmpty = !elements.length;
+    }
+    isEmptySet() {
+        return !this.elements.length;
     }
     toAllValidTexs() {
         return this.toEquivalentNodes(this.opts).map((node) => node.toTex());
     }
+    toIdentifiers() {
+        return {
+            id: node_1.NodeIds.discreteSet,
+            children: this.elements.map((e) => e.toIdentifiers()),
+        };
+    }
     toEquivalentNodes(opts) {
         if (this.elements.length === 0)
             return [this];

package/lib/tree/nodes/sets/intervalNode.d.ts

@@ -1,5 +1,5 @@
 import { InequationNode } from "../inequations/inequationNode";
-import { Node, NodeOptions, NodeType } from "../node";
+import { Node, NodeIds, NodeOptions, NodeType } from "../node";
 import { ClosureType } from "./closure";
 import { SetIds, SetNode } from "./setNode";
 import { UnionIntervalNode } from "./unionIntervalNode";
@@ -11,6 +11,7 @@ export declare class IntervalNode implements SetNode {
     closure: ClosureType;
     a: Node;
     b: Node;
+    isEmpty: boolean;
     constructor(a: Node, b: Node, closure: ClosureType, opts?: NodeOptions);
     toAllValidTexs(opts?: NodeOptions): string[];
     toEquivalentNodes(opts?: NodeOptions): IntervalNode[];
@@ -21,7 +22,18 @@ export declare class IntervalNode implements SetNode {
     toLeftReversedClosure(): IntervalNode;
     toRightReversedClosure(): IntervalNode;
     toRandomDifferentClosure(): IntervalNode;
-    toComplement(): IntervalNode | UnionIntervalNode;
+    toComplement(): UnionIntervalNode | IntervalNode;
     toTex(): string;
+    toIdentifiers(): {
+        id: NodeIds;
+        leftChild: {
+            id: NodeIds;
+        } & Record<string, any>;
+        rightChild: {
+            id: NodeIds;
+        } & Record<string, any>;
+        closure: ClosureType;
+    };
+    toText(isPlural: boolean, isFeminine: boolean): string;
 }
 //# sourceMappingURL=intervalNode.d.ts.map

package/lib/tree/nodes/sets/intervalNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"intervalNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/intervalNode.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAC/D,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAQtD,OAAO,EAAW,WAAW,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAa,MAAM,WAAW,CAAC;AACvD,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAExD,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AACD,qBAAa,YAAa,YAAW,OAAO;IAC1C,IAAI,EAAE,QAAQ,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,OAAO,EAAE,WAAW,CAAC;IACrB,CAAC,EAAE,IAAI,CAAC;IACR,CAAC,EAAE,IAAI,CAAC;gBACI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,IAAI,CAAC,EAAE,WAAW;IAStE,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW;IAMjC,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAoBpC,YAAY,CAAC,WAAW,CAAC,EAAE,IAAI;IA4B/B,YAAY;IAIZ,QAAQ;IAIR,iBAAiB;IAGjB,qBAAqB;IAGrB,sBAAsB;IAGtB,wBAAwB;IAWxB,YAAY;IAkCZ,KAAK;CAWN"}
+{"version":3,"file":"intervalNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/intervalNode.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAC/D,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAQ/D,OAAO,EAAW,WAAW,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAa,MAAM,WAAW,CAAC;AACvD,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAExD,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AACD,qBAAa,YAAa,YAAW,OAAO;IAC1C,IAAI,EAAE,QAAQ,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,OAAO,EAAE,WAAW,CAAC;IACrB,CAAC,EAAE,IAAI,CAAC;IACR,CAAC,EAAE,IAAI,CAAC;IACR,OAAO,EAAE,OAAO,CAAC;gBACL,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,IAAI,CAAC,EAAE,WAAW;IAUtE,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW;IAMjC,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAoBpC,YAAY,CAAC,WAAW,CAAC,EAAE,IAAI;IA4B/B,YAAY;IAIZ,QAAQ;IAIR,iBAAiB;IAGjB,qBAAqB;IAGrB,sBAAsB;IAGtB,wBAAwB;IAWxB,YAAY;IAkCZ,KAAK;IAWL,aAAa;;;;;;;;;;IASb,MAAM,CAAC,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO;CAgB9C"}

package/lib/tree/nodes/sets/intervalNode.js

@@ -21,6 +21,7 @@ class IntervalNode {
         this.closure = closure;
         this.a = a;
         this.b = b;
+        this.isEmpty = false;
         this.opts = opts;
     }
     toAllValidTexs(opts) {
@@ -101,5 +102,25 @@ class IntervalNode {
             : "[";
         return `${left}\\ ${this.a.toTex()};${this.b.toTex()}\\ ${right}\\ `;
     }
+    toIdentifiers() {
+        return {
+            id: node_1.NodeIds.interval,
+            leftChild: this.a.toIdentifiers(),
+            rightChild: this.b.toIdentifiers(),
+            closure: this.closure,
+        };
+    }
+    toText(isPlural, isFeminine) {
+        const conjugaison = isFeminine ? "e" : "" + isPlural ? "s" : "";
+        return (0, infiniteNode_1.isInfiniteNode)(this.a)
+            ? closure_1.Closure.isRightOpen(this.closure)
+                ? `strictement inférieur${conjugaison} à $${this.b.toTex()}$`
+                : `inférieur${conjugaison} à $${this.b.toTex()}$`
+            : (0, infiniteNode_1.isInfiniteNode)(this.b)
+                ? closure_1.Closure.isLeftOpen(this.closure)
+                    ? `strictement supérieur${conjugaison} à $${this.a.toTex()}$`
+                    : `supérieur${conjugaison} à $${this.a.toTex()}$`
+                : `compris entre $${this.a.toTex()}$ ${closure_1.Closure.isLeftOpen(this.closure) ? "exclu" : "inclus"} et $${this.b.toTex()}$ ${closure_1.Closure.isRightOpen(this.closure) ? "exclu" : "inclus"}`;
+    }
 }
 exports.IntervalNode = IntervalNode;

package/lib/tree/nodes/sets/setNode.d.ts

@@ -6,6 +6,7 @@ export declare enum SetIds {
 }
 export interface SetNode extends Node {
     id: SetIds;
+    isEmpty: boolean;
     toEquivalentNodes: (opts?: NodeOptions) => SetNode[];
 }
 export declare function isSetNode(a: Node): a is SetNode;

package/lib/tree/nodes/sets/setNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"setNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/setNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAY,MAAM,SAAS,CAAC;AAEtD,oBAAY,MAAM;IAChB,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,KAAK,IAAA;CACN;AACD,MAAM,WAAW,OAAQ,SAAQ,IAAI;IACnC,EAAE,EAAE,MAAM,CAAC;IACX,iBAAiB,EAAE,CAAC,IAAI,CAAC,EAAE,WAAW,KAAK,OAAO,EAAE,CAAC;CACtD;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,OAAO,CAE/C"}
+{"version":3,"file":"setNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/setNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAY,MAAM,SAAS,CAAC;AAEtD,oBAAY,MAAM;IAChB,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,KAAK,IAAA;CACN;AACD,MAAM,WAAW,OAAQ,SAAQ,IAAI;IACnC,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,OAAO,CAAC;IACjB,iBAAiB,EAAE,CAAC,IAAI,CAAC,EAAE,WAAW,KAAK,OAAO,EAAE,CAAC;CACtD;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,OAAO,CAE/C"}

package/lib/tree/nodes/sets/unionIntervalNode.d.ts

@@ -1,5 +1,5 @@
 import { AlgebraicNode } from "../algebraicNode";
-import { Node, NodeOptions, NodeType } from "../node";
+import { Node, NodeIds, NodeOptions, NodeType } from "../node";
 import { SetIds, SetNode } from "./setNode";
 export declare function isUnionIntervalNode(a: Node): a is UnionIntervalNode;
 export declare abstract class UnionIntervalNodeBuilder {
@@ -16,5 +16,11 @@ export declare class UnionIntervalNode implements Node {
     toMathString(): string;
     toMathjs(): string;
     toTex(): string;
+    toIdentifiers(): {
+        id: NodeIds;
+        children: ({
+            id: NodeIds;
+        } & Record<string, any>)[];
+    };
 }
 //# sourceMappingURL=unionIntervalNode.d.ts.map

package/lib/tree/nodes/sets/unionIntervalNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"unionIntervalNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/unionIntervalNode.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAItD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAa,MAAM,WAAW,CAAC;AAEvD,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,iBAAiB,CAEnE;AACD,8BAAsB,wBAAwB;IAC5C,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,aAAa;CAMlC;AACD,qBAAa,iBAAkB,YAAW,IAAI;IAC5C,IAAI,EAAE,QAAQ,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,IAAI,EAAE,OAAO,EAAE,CAAC;gBACJ,IAAI,EAAE,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,WAAW;IAO/C,cAAc;IAId,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAcpC,YAAY;IAIZ,QAAQ;IAIR,KAAK;CAGN"}
+{"version":3,"file":"unionIntervalNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/unionIntervalNode.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAI/D,OAAO,EAAE,MAAM,EAAE,OAAO,EAAa,MAAM,WAAW,CAAC;AAEvD,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,iBAAiB,CAEnE;AACD,8BAAsB,wBAAwB;IAC5C,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,aAAa;CAMlC;AACD,qBAAa,iBAAkB,YAAW,IAAI;IAC5C,IAAI,EAAE,QAAQ,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,IAAI,EAAE,OAAO,EAAE,CAAC;gBACJ,IAAI,EAAE,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,WAAW;IAO/C,cAAc;IAId,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAcpC,YAAY;IAIZ,QAAQ;IAIR,KAAK;IAGL,aAAa;;;;;;CAMd"}

package/lib/tree/nodes/sets/unionIntervalNode.js

@@ -51,5 +51,11 @@ class UnionIntervalNode {
     toTex() {
         return this.sets.map((set) => set.toTex()).join("\\cup\\ ");
     }
+    toIdentifiers() {
+        return {
+            id: node_1.NodeIds.union,
+            children: this.sets.map((set) => set.toIdentifiers()),
+        };
+    }
 }
 exports.UnionIntervalNode = UnionIntervalNode;

package/lib/tree/nodes/variables/variableNode.d.ts

@@ -1,11 +1,15 @@
 import { AlgebraicNode } from "../algebraicNode";
-import { Node, NodeType } from "../node";
+import { Node, NodeIds, NodeType } from "../node";
 export declare function isVariableNode(a: Node): a is VariableNode;
 export declare class VariableNode implements AlgebraicNode {
     name: string;
     type: NodeType;
     isNumeric: boolean;
     constructor(name: string);
+    toIdentifiers(): {
+        id: NodeIds;
+        name: string;
+    };
     toTex(): string;
     toMathString(): string;
     toMathjs(): string;

package/lib/tree/nodes/variables/variableNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"variableNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/variables/variableNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEzC,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AACD,qBAAa,YAAa,YAAW,aAAa;IAChD,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,WAAqB;IACzB,SAAS,EAAE,OAAO,CAAC;gBACP,IAAI,EAAE,MAAM;IAKxB,KAAK,IAAI,MAAM;IAGf,YAAY,IAAI,MAAM;IAGtB,QAAQ;IAGR,cAAc;IAGd,iBAAiB;IAIjB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IASrC,QAAQ;IAGR,MAAM,CAAC,IAAI,EAAE,aAAa;CAG3B"}
+{"version":3,"file":"variableNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/variables/variableNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAElD,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AACD,qBAAa,YAAa,YAAW,aAAa;IAChD,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,WAAqB;IACzB,SAAS,EAAE,OAAO,CAAC;gBACP,IAAI,EAAE,MAAM;IAIxB,aAAa;;;;IAMb,KAAK,IAAI,MAAM;IAGf,YAAY,IAAI,MAAM;IAGtB,QAAQ;IAGR,cAAc;IAGd,iBAAiB;IAIjB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IASrC,QAAQ;IAGR,MAAM,CAAC,IAAI,EAAE,aAAa;CAG3B"}

package/lib/tree/nodes/variables/variableNode.js

@@ -12,6 +12,12 @@ class VariableNode {
         this.name = name;
         this.isNumeric = false;
     }
+    toIdentifiers() {
+        return {
+            id: node_1.NodeIds.variable,
+            name: this.name,
+        };
+    }
     toTex() {
         return `${this.name}`;
     }

package/lib/tree/utilities/operatorComposition.js

@@ -3,8 +3,10 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.operatorComposition = void 0;
 const operatorComposition = (Compositor, arr) => {
     let res;
-    if (arr.length < 2)
-        throw Error(`received ${arr.length} nodes for operator composition`);
+    if (!arr.length)
+        throw Error(`received no nodes for operator composition`);
+    if (arr.length == 1)
+        return arr[0];
     res = new Compositor(arr[0], arr[1]);
     for (let i = 2; i < arr.length; i++) {
         res = new Compositor(res, arr[i]);

package/lib/utils/alignTex.js

@@ -2,16 +2,18 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.alignTex = void 0;
 function alignTex(arr) {
-    //! le "&" avant les join sert à aligner à gauche
-    //! mais ca crée un manque d'espace moche
-    //! je pense qu'il faut changer d'environnement (align)
-    //! utiliser un autre genre array ou equation je sais pas
+    let alignements = "r";
+    if (typeof arr !== "string") {
+        for (let i = 0; i < arr.length - 2; i++) {
+            alignements += "c";
+        }
+    }
+    alignements += "l";
     const aligned = `$$
-\\begin{align*}
-${typeof arr === "string"
-        ? arr
-        : arr.map((el) => "&" + el.join("&")).join(` \\\\`)}
-\\end{align*}
+\\def\\arraystretch{1.8}
+\\begin{array}{${alignements}}
+${typeof arr === "string" ? arr : arr.map((el) => el.join("&")).join(` \\\\`)}
+\\end{array}
 $$`;
     return aligned;
 }

package/lib/utils/diceFlip.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"diceFlip.d.ts","sourceRoot":"","sources":["../../src/utils/diceFlip.ts"],"names":[],"mappings":"AAEA,eAAO,MAAM,QAAQ,UAAW,MAAM,WAMrC,CAAC"}
+{"version":3,"file":"diceFlip.d.ts","sourceRoot":"","sources":["../../src/utils/diceFlip.ts"],"names":[],"mappings":"AAGA,eAAO,MAAM,QAAQ,UAAW,MAAM,WAErC,CAAC"}

package/lib/utils/diceFlip.js

@@ -1,12 +1,8 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.diceFlip = void 0;
-const random_1 = require("./random");
+const randint_1 = require("../math/utils/random/randint");
 const diceFlip = (faces) => {
-    const arr = [];
-    for (let i = 0; i < faces; i++) {
-        arr.push(i);
-    }
-    return (0, random_1.random)(arr);
+    return (0, randint_1.randint)(1, faces + 1);
 };
 exports.diceFlip = diceFlip;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "math-exercises",
-  "version": "2.2.9",
+  "version": "2.2.10",
   "description": "Math exercises generator for middle school and high school",
   "main": "lib/index.js",
   "files": [