math-exercises 2.2.98 → 3.0.2

package/lib/math/numbers/epsilon.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"epsilon.d.ts","sourceRoot":"","sources":["../../../src/math/numbers/epsilon.ts"],"names":[],"mappings":"AAMA,eAAO,MAAM,OAAO,QAAe,CAAC"}

package/lib/math/numbers/epsilon.js

@@ -1,10 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.EPSILON = void 0;
-function getEpsilon() {
-    var e = 1.0;
-    while (1.0 + 0.5 * e !== 1.0)
-        e *= 0.5;
-    return e;
-}
-exports.EPSILON = getEpsilon();

package/lib/math/polynomials/generalTrinom.d.ts

@@ -1,60 +0,0 @@
-import { AlgebraicNode } from "../../tree/nodes/algebraicNode";
-import { NodeType } from "../../tree/nodes/node";
-import { NodeIdentifiers } from "../../tree/nodes/nodeConstructor";
-export declare abstract class GeneralTrinomConstructor {
-    static random(aOpts?: {
-        min?: number;
-        max?: number;
-        excludes?: number[];
-    }, bOpts?: {
-        min?: number;
-        max?: number;
-        excludes?: number[];
-    }, cOpts?: {
-        min?: number;
-        max?: number;
-        excludes?: number[];
-    }): GeneralTrinom;
-    static randomCanonical(aOpts?: {
-        min?: number;
-        max?: number;
-        excludes?: number[];
-        from?: number[];
-    }, alphaOpts?: {
-        min?: number;
-        max?: number;
-        excludes?: number[];
-    }, betaOpts?: {
-        min?: number;
-        max?: number;
-        excludes?: number[];
-    }): GeneralTrinom;
-    static randomNiceRoots(nbOfRoots?: number): GeneralTrinom;
-    static fromCoeffs(coeffs: number[]): GeneralTrinom;
-    static fromIdentifiers(identifiers: GeneralTrinomIdentifiers): GeneralTrinom;
-}
-export type GeneralTrinomIdentifiers = {
-    a: number | NodeIdentifiers;
-    b: number | NodeIdentifiers;
-    c: number | NodeIdentifiers;
-    opts?: GeneralTrinomOptions;
-};
-type GeneralTrinomOptions = {
-    variable: string;
-};
-export declare class GeneralTrinom {
-    a: AlgebraicNode;
-    b: AlgebraicNode;
-    c: AlgebraicNode;
-    variable: string;
-    type: NodeType;
-    constructor(a: AlgebraicNode | number, b: AlgebraicNode | number, c: AlgebraicNode | number, opts?: GeneralTrinomOptions);
-    getDelta(): AlgebraicNode;
-    getRoots(): AlgebraicNode[];
-    toTree(): import("../../tree/nodes/operators/addNode").AddNode | import("../../tree/nodes/operators/multiplyNode").MultiplyNode;
-    toTex(): string;
-    getCoeffs(): number[];
-    toIdentifiers(): GeneralTrinomIdentifiers;
-}
-export {};
-//# sourceMappingURL=generalTrinom.d.ts.map

package/lib/math/polynomials/generalTrinom.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"generalTrinom.d.ts","sourceRoot":"","sources":["../../../src/math/polynomials/generalTrinom.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAG/D,OAAO,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AACjD,OAAO,EAEL,eAAe,EAChB,MAAM,kCAAkC,CAAC;AAE1C,8BAAsB,wBAAwB;IAC5C,MAAM,CAAC,MAAM,CACX,KAAK,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,EAC3D,KAAK,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,EAC3D,KAAK,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,GAC1D,aAAa;IAmBhB,MAAM,CAAC,eAAe,CACpB,KAAK,CAAC,EAAE;QACN,GAAG,CAAC,EAAE,MAAM,CAAC;QACb,GAAG,CAAC,EAAE,MAAM,CAAC;QACb,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;QACpB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;KACjB,EACD,SAAS,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,EAC/D,QAAQ,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,GAC7D,aAAa;IAmBhB,MAAM,CAAC,eAAe,CAAC,SAAS,GAAE,MAAU;IAqB5C,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE;IAIlC,MAAM,CAAC,eAAe,CAAC,WAAW,EAAE,wBAAwB;CAc7D;AAED,MAAM,MAAM,wBAAwB,GAAG;IACrC,CAAC,EAAE,MAAM,GAAG,eAAe,CAAC;IAC5B,CAAC,EAAE,MAAM,GAAG,eAAe,CAAC;IAC5B,CAAC,EAAE,MAAM,GAAG,eAAe,CAAC;IAC5B,IAAI,CAAC,EAAE,oBAAoB,CAAC;CAC7B,CAAC;AAEF,KAAK,oBAAoB,GAAG;IAAE,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC;AACjD,qBAAa,aAAa;IACxB,CAAC,EAAE,aAAa,CAAC;IACjB,CAAC,EAAE,aAAa,CAAC;IACjB,CAAC,EAAE,aAAa,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,QAAQ,CAAmB;gBAG/B,CAAC,EAAE,aAAa,GAAG,MAAM,EACzB,CAAC,EAAE,aAAa,GAAG,MAAM,EACzB,CAAC,EAAE,aAAa,GAAG,MAAM,EACzB,IAAI,CAAC,EAAE,oBAAoB;IAS7B,QAAQ;IAiBR,QAAQ,IAAI,aAAa,EAAE;IAgB3B,MAAM;IAYN,KAAK;IAGL,SAAS;IAIT,aAAa,IAAI,wBAAwB;CAQ1C"}

package/lib/math/polynomials/generalTrinom.js

@@ -1,130 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.GeneralTrinom = exports.GeneralTrinomConstructor = void 0;
-const sqrtNode_1 = require("../../tree/nodes/functions/sqrtNode");
-const addNode_1 = require("../../tree/nodes/operators/addNode");
-const fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
-const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
-const powerNode_1 = require("../../tree/nodes/operators/powerNode");
-const substractNode_1 = require("../../tree/nodes/operators/substractNode");
-const oppositeNode_1 = require("../../tree/nodes/functions/oppositeNode");
-const randint_1 = require("../utils/random/randint");
-const random_1 = require("../../utils/alea/random");
-const node_1 = require("../../tree/nodes/node");
-const nodeConstructor_1 = require("../../tree/nodes/nodeConstructor");
-class GeneralTrinomConstructor {
-    static random(aOpts, bOpts, cOpts) {
-        const a = (0, randint_1.randint)(aOpts?.min ?? -9, aOpts?.max ?? 10, aOpts?.excludes ?? [0]);
-        const b = (0, randint_1.randint)(bOpts?.min ?? -9, bOpts?.max ?? 10, bOpts?.excludes ?? []);
-        const c = (0, randint_1.randint)(cOpts?.min ?? -9, cOpts?.max ?? 10, cOpts?.excludes ?? []);
-        return new GeneralTrinom(a, b, c);
-    }
-    static randomCanonical(aOpts, alphaOpts, betaOpts) {
-        const a = aOpts?.from
-            ? (0, random_1.random)(aOpts.from)
-            : (0, randint_1.randint)(aOpts?.min ?? -9, aOpts?.max ?? 10, aOpts?.excludes ?? [0]);
-        const alpha = (0, randint_1.randint)(alphaOpts?.min ?? -9, alphaOpts?.max ?? 10, alphaOpts?.excludes ?? []);
-        const beta = (0, randint_1.randint)(betaOpts?.min ?? -9, betaOpts?.max ?? 10, betaOpts?.excludes ?? []);
-        const b = -2 * a * alpha;
-        const c = a * alpha ** 2 + beta;
-        return new GeneralTrinom(a, b, c);
-    }
-    static randomNiceRoots(nbOfRoots = 2) {
-        if (nbOfRoots === 0) {
-            //canonical +c
-            const a = (0, randint_1.randint)(-9, 10, [0]);
-            const root = (0, randint_1.randint)(-9, 10);
-            //a(x-root)^2 = ax^2 -2arootx + aroot^2
-            const c = a > 0 ? a * root ** 2 + (0, randint_1.randint)(1, 6) : a * root ** 2 - (0, randint_1.randint)(1, 6);
-            return new GeneralTrinom(a, -2 * a * root, c);
-        }
-        else if (nbOfRoots === 1) {
-            const a = (0, randint_1.randint)(-9, 10, [0]);
-            const root = (0, randint_1.randint)(-9, 10);
-            //a(x-root)^2 = ax^2 -2arootx + aroot^2
-            return new GeneralTrinom(a, -2 * a * root, a * root ** 2);
-        }
-        else {
-            const a = (0, randint_1.randint)(-9, 10, [0]);
-            const x1 = (0, randint_1.randint)(-9, 10, []);
-            const x2 = (0, randint_1.randint)(-9, 10, [x1]);
-            return new GeneralTrinom(a, -a * (x1 + x2), a * x1 * x2);
-        }
-    }
-    static fromCoeffs(coeffs) {
-        return new GeneralTrinom(coeffs[2], coeffs[1], coeffs[0]);
-    }
-    static fromIdentifiers(identifiers) {
-        return new GeneralTrinom(typeof identifiers.a === "number"
-            ? identifiers.a
-            : nodeConstructor_1.NodeConstructor.fromIdentifiers(identifiers.a), typeof identifiers.b === "number"
-            ? identifiers.b
-            : nodeConstructor_1.NodeConstructor.fromIdentifiers(identifiers.b), typeof identifiers.c === "number"
-            ? identifiers.c
-            : nodeConstructor_1.NodeConstructor.fromIdentifiers(identifiers.c), identifiers.opts);
-    }
-}
-exports.GeneralTrinomConstructor = GeneralTrinomConstructor;
-class GeneralTrinom {
-    // roots: AlgebraicNode[];
-    constructor(a, b, c, opts) {
-        this.type = node_1.NodeType.trinom;
-        // super([c, b, a], opts?.variable ?? "x");
-        this.a = typeof a === "number" ? a.toTree() : a;
-        this.b = typeof b === "number" ? b.toTree() : b;
-        this.c = typeof c === "number" ? c.toTree() : c;
-        this.variable = opts?.variable ?? "x";
-    }
-    getDelta() {
-        return (0, substractNode_1.substract)((0, powerNode_1.square)(this.b), (0, multiplyNode_1.multiply)(4, (0, multiplyNode_1.multiply)(this.a, this.c))).simplify();
-    }
-    //   getRoots() {
-    //     const delta = this.getDelta();
-    //     if (delta < 0) return [];
-    //     if (delta === 0) return [-this.b / (2 * this.a)];
-    //     return [
-    //       (-this.b - Math.sqrt(delta)) / (2 * this.a),
-    //       (-this.b + Math.sqrt(delta)) / (2 * this.a),
-    //     ].sort((a, b) => a - b);
-    //   }
-    getRoots() {
-        const delta = this.getDelta();
-        const deltaEv = delta.evaluate();
-        if (deltaEv < 0)
-            return [];
-        if (deltaEv === 0)
-            return [(0, fractionNode_1.frac)((0, oppositeNode_1.opposite)(this.b), (0, multiplyNode_1.multiply)(2, this.a)).simplify()];
-        return [
-            (0, fractionNode_1.frac)((0, substractNode_1.substract)((0, oppositeNode_1.opposite)(this.b), (0, sqrtNode_1.sqrt)(delta)), (0, multiplyNode_1.multiply)(2, this.a)).simplify(),
-            (0, fractionNode_1.frac)((0, addNode_1.add)((0, oppositeNode_1.opposite)(this.b), (0, sqrtNode_1.sqrt)(delta)), (0, multiplyNode_1.multiply)(2, this.a)).simplify(),
-        ].sort((a, b) => a.evaluate() - b.evaluate());
-    }
-    toTree() {
-        const bEv = this.b.evaluate();
-        const cEv = this.c.evaluate();
-        const highMonom = (0, multiplyNode_1.multiply)(this.a, (0, powerNode_1.square)(this.variable));
-        const middleMonom = (0, multiplyNode_1.multiply)(this.b, this.variable);
-        if (!bEv && !cEv)
-            return highMonom;
-        if (!cEv)
-            return (0, addNode_1.add)(highMonom, middleMonom);
-        if (!bEv)
-            return (0, addNode_1.add)(highMonom, this.c);
-        return (0, addNode_1.add)(highMonom, (0, addNode_1.add)(middleMonom, this.c));
-    }
-    toTex() {
-        return this.toTree().toTex();
-    }
-    getCoeffs() {
-        return [this.c.evaluate(), this.b.evaluate(), this.a.evaluate()];
-    }
-    toIdentifiers() {
-        return {
-            a: this.a.toIdentifiers(),
-            b: this.b.toIdentifiers(),
-            c: this.c.toIdentifiers(),
-            opts: { variable: this.variable },
-        };
-    }
-}
-exports.GeneralTrinom = GeneralTrinom;

package/lib/math/sets/discreteSet.d.ts

@@ -1,11 +0,0 @@
-import { Nombre } from "../numbers/nombre";
-import { MathSetInterface } from "./mathSetInterface";
-export declare class DiscreteSet implements MathSetInterface {
-    elements: Nombre[];
-    tex: string;
-    constructor(elements: Nombre[]);
-    toTex(): string;
-    includes(el: Nombre): boolean;
-    getRandomElement(): Nombre;
-}
-//# sourceMappingURL=discreteSet.d.ts.map

package/lib/math/sets/discreteSet.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"discreteSet.d.ts","sourceRoot":"","sources":["../../../src/math/sets/discreteSet.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAC3C,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAEtD,qBAAa,WAAY,YAAW,gBAAgB;IAClD,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,GAAG,EAAE,MAAM,CAAC;gBACA,QAAQ,EAAE,MAAM,EAAE;IAW9B,KAAK,IAAI,MAAM;IAIf,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAM7B,gBAAgB,IAAI,MAAM;CAG3B"}

package/lib/math/sets/discreteSet.js

@@ -1,28 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.DiscreteSet = void 0;
-const random_1 = require("../../utils/alea/random");
-class DiscreteSet {
-    constructor(elements) {
-        this.elements = Array.from(new Set(elements));
-        let tex = "\\{";
-        this.elements.forEach((el, index) => {
-            tex += el.tex;
-            if (index < this.elements.length - 1)
-                tex += ";";
-            else
-                tex += "\\}";
-        });
-        this.tex = tex;
-    }
-    toTex() {
-        return this.tex;
-    }
-    includes(el) {
-        return this.elements.some((nb) => nb.value === el.value && nb.tex === el.tex);
-    }
-    getRandomElement() {
-        return (0, random_1.random)(this.elements);
-    }
-}
-exports.DiscreteSet = DiscreteSet;

package/lib/math/sets/emptySet.d.ts

@@ -1 +0,0 @@
-//# sourceMappingURL=emptySet.d.ts.map

package/lib/math/sets/emptySet.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"emptySet.d.ts","sourceRoot":"","sources":["../../../src/math/sets/emptySet.ts"],"names":[],"mappings":""}

package/lib/math/sets/emptySet.js

@@ -1,6 +0,0 @@
-"use strict";
-// import { MathSetInterface } from "./mathSetInterface";
-// export abstract class EmptySet implements MathSetInterface {
-//   tex: string = "\\varnothing";
-//   getRandomElement = () => null;
-// }

package/lib/math/sets/intervals/intervals.d.ts

@@ -1,36 +0,0 @@
-import { Nombre } from "../../../math/numbers/nombre";
-import { AlgebraicNode } from "../../../tree/nodes/algebraicNode";
-import { ClosureType } from "../../../tree/nodes/sets/closure";
-import { DiscreteSetNode } from "../../../tree/nodes/sets/discreteSetNode";
-import { IntervalNode } from "../../../tree/nodes/sets/intervalNode";
-import { MathSet } from "../mathSet";
-import { MathSetInterface } from "../mathSetInterface";
-export declare abstract class IntervalConstructor {
-    static random(): Interval;
-    static differentRandoms(nb: number): Interval[];
-}
-export declare class Interval implements MathSetInterface {
-    minNode: AlgebraicNode;
-    min: number;
-    minTex: string;
-    max: number;
-    maxNode: AlgebraicNode;
-    maxTex: string;
-    closure: ClosureType;
-    leftBracket: "[" | "]";
-    rightBracket: "[" | "]";
-    leftInequalitySymbol: "\\le" | "<";
-    rightInequalitySymbol: "\\le" | "<";
-    tex: string;
-    isEmpty: boolean;
-    constructor(min: AlgebraicNode, max: AlgebraicNode, closure: ClosureType);
-    equals(interval: Interval): boolean;
-    union(interval: Interval): MathSet;
-    intersection(interval: Interval): DiscreteSetNode | IntervalNode;
-    insideToTex(): string;
-    toTex(): string;
-    toInequality(): string;
-    getRandomElement(): Nombre;
-    toTree(): IntervalNode;
-}
-//# sourceMappingURL=intervals.d.ts.map

package/lib/math/sets/intervals/intervals.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"intervals.d.ts","sourceRoot":"","sources":["../../../../src/math/sets/intervals/intervals.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,MAAM,EAAc,MAAM,2BAA2B,CAAC;AAI/D,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAM/D,OAAO,EAAW,WAAW,EAAE,MAAM,+BAA+B,CAAC;AACrE,OAAO,EACL,eAAe,EAEhB,MAAM,uCAAuC,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,oCAAoC,CAAC;AAGlE,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AACrC,OAAO,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AAEvD,8BAAsB,mBAAmB;IACvC,MAAM,CAAC,MAAM;IA2Cb,MAAM,CAAC,gBAAgB,CAAC,EAAE,EAAE,MAAM;CAWnC;AAED,qBAAa,QAAS,YAAW,gBAAgB;IAC/C,OAAO,EAAE,aAAa,CAAC;IACvB,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,MAAM,CAAC;IACf,GAAG,EAAE,MAAM,CAAC;IACZ,OAAO,EAAE,aAAa,CAAC;IACvB,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,WAAW,CAAC;IACrB,WAAW,EAAE,GAAG,GAAG,GAAG,CAAC;IACvB,YAAY,EAAE,GAAG,GAAG,GAAG,CAAC;IACxB,oBAAoB,EAAE,MAAM,GAAG,GAAG,CAAC;IACnC,qBAAqB,EAAE,MAAM,GAAG,GAAG,CAAC;IACpC,GAAG,EAAE,MAAM,CAAC;IACZ,OAAO,EAAE,OAAO,CAAC;gBACL,GAAG,EAAE,aAAa,EAAE,GAAG,EAAE,aAAa,EAAE,OAAO,EAAE,WAAW;IAkBxE,MAAM,CAAC,QAAQ,EAAE,QAAQ;IAOzB,KAAK,CAAC,QAAQ,EAAE,QAAQ,GAAG,OAAO;IA6ClC,YAAY,CAAC,QAAQ,EAAE,QAAQ;IA0C/B,WAAW,IAAI,MAAM;IAGrB,KAAK,IAAI,MAAM;IAMf,YAAY,IAAI,MAAM;IAmBtB,gBAAgB,IAAI,MAAM;IAI1B,MAAM;CAGP"}

package/lib/math/sets/intervals/intervals.js

@@ -1,192 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Interval = exports.IntervalConstructor = void 0;
-const randint_1 = require("../../../math/utils/random/randint");
-const infiniteNode_1 = require("../../../tree/nodes/numbers/infiniteNode");
-const closure_1 = require("../../../tree/nodes/sets/closure");
-const discreteSetNode_1 = require("../../../tree/nodes/sets/discreteSetNode");
-const intervalNode_1 = require("../../../tree/nodes/sets/intervalNode");
-const coinFlip_1 = require("../../../utils/alea/coinFlip");
-const mathSet_1 = require("../mathSet");
-class IntervalConstructor {
-    static random() {
-        const randType = (0, randint_1.randint)(0, 6);
-        let a, b;
-        let min, max, closure;
-        switch (randType) {
-            case 0:
-                min = infiniteNode_1.MinusInfinityNode;
-                max = (0, randint_1.randint)(-10, 10).toTree();
-                closure = (0, coinFlip_1.coinFlip)() ? closure_1.ClosureType.OF : closure_1.ClosureType.OO;
-                break;
-            case 1:
-                min = (0, randint_1.randint)(-10, 10).toTree();
-                max = infiniteNode_1.PlusInfinityNode;
-                closure = (0, coinFlip_1.coinFlip)() ? closure_1.ClosureType.OO : closure_1.ClosureType.FO;
-                break;
-            case 2:
-                a = (0, randint_1.randint)(-10, 10);
-                min = a.toTree();
-                max = (0, randint_1.randint)(a + 1, a + 10).toTree();
-                closure = closure_1.ClosureType.FF;
-                break;
-            case 3:
-                a = (0, randint_1.randint)(-10, 10);
-                min = a.toTree();
-                max = (0, randint_1.randint)(a + 1, a + 10).toTree();
-                closure = closure_1.ClosureType.OF;
-                break;
-            case 4:
-                a = (0, randint_1.randint)(-10, 10);
-                min = a.toTree();
-                max = (0, randint_1.randint)(a + 1, a + 10).toTree();
-                closure = closure_1.ClosureType.FO;
-                break;
-            case 5:
-            default:
-                a = (0, randint_1.randint)(-10, 10);
-                min = a.toTree();
-                max = (0, randint_1.randint)(a + 1, a + 10).toTree();
-                closure = closure_1.ClosureType.OO;
-                break;
-        }
-        return new Interval(min, max, closure);
-    }
-    static differentRandoms(nb) {
-        const res = [];
-        for (let i = 0; i < nb; i++) {
-            let interval;
-            do {
-                interval = this.random();
-            } while (res.some((int) => int.equals(interval)));
-            res.push(this.random());
-        }
-        return res;
-    }
-}
-exports.IntervalConstructor = IntervalConstructor;
-class Interval {
-    constructor(min, max, closure) {
-        this.closure = closure;
-        this.minNode = min;
-        this.maxNode = max;
-        this.min = min.evaluate({});
-        this.max = max.evaluate({});
-        this.minTex = min.toTex();
-        this.maxTex = max.toTex();
-        this.leftBracket =
-            closure === closure_1.ClosureType.FF || closure === closure_1.ClosureType.FO ? "[" : "]";
-        this.rightBracket =
-            closure === closure_1.ClosureType.FF || closure === closure_1.ClosureType.OF ? "]" : "[";
-        this.leftInequalitySymbol = this.leftBracket === "[" ? "\\le" : "<";
-        this.rightInequalitySymbol = this.rightBracket === "]" ? "\\le" : "<";
-        this.tex = this.toTex();
-        this.isEmpty = false;
-    }
-    equals(interval) {
-        return (this.min === interval.min &&
-            this.max === interval.max &&
-            this.closure === interval.closure);
-    }
-    union(interval) {
-        let unionRightBracket = this.max > interval.max
-            ? this.rightBracket
-            : this.max === interval.max
-                ? this.rightBracket === "]" || interval.rightBracket === "]"
-                    ? "]"
-                    : "["
-                : interval.rightBracket;
-        let unionLeftBracket = this.min < interval.min
-            ? this.leftBracket
-            : this.min === interval.min
-                ? this.leftBracket === "[" || interval.leftBracket === "["
-                    ? "["
-                    : "]"
-                : interval.leftBracket;
-        let min = this.min < interval.min ? this.minNode : interval.minNode;
-        let max = this.max > interval.max ? this.maxNode : interval.maxNode;
-        if (this.max < interval.min ||
-            this.min > interval.max ||
-            (this.max === interval.min &&
-                this.rightBracket === "[" &&
-                interval.leftBracket === "]") ||
-            (this.min === interval.max &&
-                this.leftBracket === "]" &&
-                interval.rightBracket === "[")) {
-            const firstInterval = this.min < interval.min ? this : interval;
-            const secondInterval = this.min < interval.min ? interval : this;
-            return new mathSet_1.MathSet(`${unionLeftBracket}${firstInterval.minTex};${firstInterval.maxTex}${firstInterval.rightBracket}\\cup${secondInterval.leftBracket}${secondInterval.minTex};${secondInterval.maxTex}${unionRightBracket}`, () => (0, coinFlip_1.coinFlip)()
-                ? firstInterval.getRandomElement()
-                : secondInterval.getRandomElement());
-        }
-        else {
-            const closure = closure_1.Closure.fromBrackets(unionLeftBracket, unionRightBracket);
-            return new Interval(min, max, closure);
-        }
-    }
-    intersection(interval) {
-        const a = this.min;
-        const b = this.max;
-        const c = interval.min;
-        const d = interval.max;
-        //[a,b] n [c,d]
-        const isDisjoint = b < c ||
-            d < a ||
-            (b === c &&
-                (this.rightBracket === "[" || interval.leftBracket === "]")) ||
-            (a === d && (interval.rightBracket === "[" || this.leftBracket === "]"));
-        if (isDisjoint) {
-            return discreteSetNode_1.EmptySet;
-        }
-        const winningLeftBracket = (brack1, brack2) => brack1 === "]" || brack2 === "]" ? "]" : "[";
-        const winningRightBracket = (brack1, brack2) => brack1 === "[" || brack2 === "[" ? "[" : "]";
-        let min = a >= c ? this.minNode : interval.minNode;
-        const max = b <= d ? this.maxNode : interval.maxNode;
-        if (min === max)
-            return new discreteSetNode_1.DiscreteSetNode([min]);
-        let leftBracket = a === c
-            ? winningLeftBracket(this.leftBracket, interval.leftBracket)
-            : a > c
-                ? this.leftBracket
-                : interval.leftBracket;
-        let rightBracket = b === d
-            ? winningRightBracket(this.rightBracket, interval.rightBracket)
-            : b < d
-                ? this.rightBracket
-                : interval.rightBracket;
-        const closure = closure_1.Closure.fromBrackets(leftBracket, rightBracket);
-        return new Interval(min, max, closure).toTree();
-    }
-    insideToTex() {
-        return `${this.minTex};${this.maxTex}`;
-    }
-    toTex() {
-        return `${this.leftBracket}\\ ${this.insideToTex()}\\ ${this.rightBracket}\\ `;
-    }
-    toInequality() {
-        const isLeftClosed = this.closure === closure_1.ClosureType.FO || this.closure === closure_1.ClosureType.FF;
-        const isRightClosed = this.closure === closure_1.ClosureType.FF || this.closure === closure_1.ClosureType.OF;
-        if (this.max === Infinity) {
-            if (isLeftClosed) {
-                return `x\\ge${this.minTex}`;
-            }
-            else
-                return `x>${this.minTex}`;
-        }
-        else if (this.min === -Infinity) {
-            if (this.closure === closure_1.ClosureType.OF) {
-                return `x\\le${this.maxTex}`;
-            }
-            else
-                return `x<${this.maxTex}`;
-        }
-        return `${this.minTex}${isLeftClosed ? "\\le x" : "<x"}${isRightClosed ? "\\le" : "<"}${this.maxTex}`;
-    }
-    getRandomElement() {
-        throw Error("not implemented");
-    }
-    toTree() {
-        return new intervalNode_1.IntervalNode(this.minNode, this.maxNode, this.closure);
-    }
-}
-exports.Interval = Interval;

package/lib/math/sets/mathSet.d.ts

@@ -1,9 +0,0 @@
-import { Nombre } from "../numbers/nombre";
-import { MathSetInterface } from "./mathSetInterface";
-export declare class MathSet implements MathSetInterface {
-    tex: string;
-    toTex: () => string;
-    getRandomElement: () => Nombre | null;
-    constructor(tex: string, getRandomElement: () => Nombre | null);
-}
-//# sourceMappingURL=mathSet.d.ts.map

package/lib/math/sets/mathSet.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"mathSet.d.ts","sourceRoot":"","sources":["../../../src/math/sets/mathSet.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAC3C,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAEtD,qBAAa,OAAQ,YAAW,gBAAgB;IAC9C,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,MAAM,CAAC;IACpB,gBAAgB,EAAE,MAAM,MAAM,GAAG,IAAI,CAAC;gBAC1B,GAAG,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,MAAM,GAAG,IAAI;CAK/D"}

package/lib/math/sets/mathSet.js

@@ -1,11 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MathSet = void 0;
-class MathSet {
-    constructor(tex, getRandomElement) {
-        this.tex = tex;
-        this.getRandomElement = getRandomElement;
-        this.toTex = () => tex;
-    }
-}
-exports.MathSet = MathSet;

package/lib/math/sets/mathSetInterface.d.ts

@@ -1,7 +0,0 @@
-import { Nombre } from "../numbers/nombre";
-export interface MathSetInterface {
-    tex: string;
-    toTex: () => string;
-    getRandomElement: () => Nombre | null;
-}
-//# sourceMappingURL=mathSetInterface.d.ts.map

package/lib/math/sets/mathSetInterface.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"mathSetInterface.d.ts","sourceRoot":"","sources":["../../../src/math/sets/mathSetInterface.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAE3C,MAAM,WAAW,gBAAgB;IAC/B,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,MAAM,CAAC;IACpB,gBAAgB,EAAE,MAAM,MAAM,GAAG,IAAI,CAAC;CACvC"}

package/lib/math/sets/mathSetInterface.js

@@ -1,2 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });

package/lib/math/utils/covariance.d.ts

@@ -1,4 +0,0 @@
-import { AlgebraicNode } from "../../tree/nodes/algebraicNode";
-export declare function covXYAsNode(xValues: number[], avgX: AlgebraicNode, yValues: number[], avgY: AlgebraicNode): AlgebraicNode;
-export declare function covarianceXY(xValues: number[], avgX: number, yValues: number[], avgY: number): number;
-//# sourceMappingURL=covariance.d.ts.map

package/lib/math/utils/covariance.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"covariance.d.ts","sourceRoot":"","sources":["../../../src/math/utils/covariance.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAO/D,wBAAgB,WAAW,CACzB,OAAO,EAAE,MAAM,EAAE,EACjB,IAAI,EAAE,aAAa,EACnB,OAAO,EAAE,MAAM,EAAE,EACjB,IAAI,EAAE,aAAa,GAClB,aAAa,CAef;AAED,wBAAgB,YAAY,CAC1B,OAAO,EAAE,MAAM,EAAE,EACjB,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE,MAAM,EAAE,EACjB,IAAI,EAAE,MAAM,GACX,MAAM,CASR"}

package/lib/math/utils/covariance.js

@@ -1,26 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.covarianceXY = exports.covXYAsNode = void 0;
-const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
-const addNode_1 = require("../../tree/nodes/operators/addNode");
-const fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
-const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
-const substractNode_1 = require("../../tree/nodes/operators/substractNode");
-function covXYAsNode(xValues, avgX, yValues, avgY) {
-    let node = new multiplyNode_1.MultiplyNode(new substractNode_1.SubstractNode(new numberNode_1.NumberNode(xValues[0]), avgX).simplify(), new substractNode_1.SubstractNode(new numberNode_1.NumberNode(yValues[0]), avgY).simplify()).simplify();
-    for (let i = 1; i < xValues.length; i++) {
-        node = new addNode_1.AddNode(node, new multiplyNode_1.MultiplyNode(new substractNode_1.SubstractNode(new numberNode_1.NumberNode(xValues[i]), avgX).simplify(), new substractNode_1.SubstractNode(new numberNode_1.NumberNode(yValues[i]), avgY).simplify()).simplify()).simplify();
-    }
-    return new fractionNode_1.FractionNode(node, new numberNode_1.NumberNode(xValues.length)).simplify();
-}
-exports.covXYAsNode = covXYAsNode;
-function covarianceXY(xValues, avgX, yValues, avgY) {
-    const xy = xValues.map((value, index) => {
-        return (value - avgX) * (yValues[index] - avgY);
-    });
-    const covarianceXY = xy.reduce((acc, value) => {
-        return acc + value;
-    });
-    return covarianceXY / xValues.length;
-}
-exports.covarianceXY = covarianceXY;

package/lib/math/utils/quartiles.d.ts

@@ -1,3 +0,0 @@
-export declare const firstQuartile: (values: number[], effectifs?: number[]) => number;
-export declare const thirdQuartile: (values: number[], effectifs?: number[]) => number;
-//# sourceMappingURL=quartiles.d.ts.map

package/lib/math/utils/quartiles.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"quartiles.d.ts","sourceRoot":"","sources":["../../../src/math/utils/quartiles.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,aAAa,WAAY,MAAM,EAAE,cAAc,MAAM,EAAE,WAkBnE,CAAC;AAEF,eAAO,MAAM,aAAa,WAAY,MAAM,EAAE,cAAc,MAAM,EAAE,WAkBnE,CAAC"}

package/lib/math/utils/quartiles.js

@@ -1,47 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.thirdQuartile = exports.firstQuartile = void 0;
-const firstQuartile = (values, effectifs) => {
-    if (!values.length)
-        throw Error("Malformed data in firstQuartile");
-    if (!effectifs?.length) {
-        const N = values.length;
-        const rank = Math.ceil(N / 4);
-        return values[rank - 1];
-    }
-    else {
-        const N = effectifs.reduce((acc, curr) => acc + curr, 0);
-        const rank = Math.ceil(N / 4);
-        let s = 0;
-        for (let i = 0; i < effectifs.length; i++) {
-            s += effectifs[i];
-            if (rank <= s) {
-                return values[i];
-            }
-        }
-        return values[values.length - 1];
-    }
-};
-exports.firstQuartile = firstQuartile;
-const thirdQuartile = (values, effectifs) => {
-    if (!values.length)
-        throw Error("Malformed data in thirdQuartile");
-    if (!effectifs?.length) {
-        const N = values.length;
-        const rank = Math.ceil((3 * N) / 4);
-        return values[rank - 1];
-    }
-    else {
-        const N = effectifs.reduce((acc, curr) => acc + curr, 0);
-        const rank = Math.ceil((3 * N) / 4);
-        let s = 0;
-        for (let i = 0; i < effectifs.length; i++) {
-            s += effectifs[i];
-            if (rank <= s) {
-                return values[i];
-            }
-        }
-        return values[values.length - 1];
-    }
-};
-exports.thirdQuartile = thirdQuartile;

package/lib/math/utils/standardDeviation.d.ts

@@ -1,3 +0,0 @@
-export declare const standardDeviation: (values: number[]) => number;
-export declare const standardDeviationWithEffectifs: (values: number[], effectifs: number[]) => number;
-//# sourceMappingURL=standardDeviation.d.ts.map

package/lib/math/utils/standardDeviation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"standardDeviation.d.ts","sourceRoot":"","sources":["../../../src/math/utils/standardDeviation.ts"],"names":[],"mappings":"AAGA,eAAO,MAAM,iBAAiB,WAAY,MAAM,EAAE,WAEjD,CAAC;AACF,eAAO,MAAM,8BAA8B,WACjC,MAAM,EAAE,aACL,MAAM,EAAE,WAGpB,CAAC"}