pimath 0.0.120 → 0.0.122

package/.idea/PI.iml

@@ -1,7 +1,13 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <module type="WEB_MODULE" version="4">
   <component name="NewModuleRootManager">
-    <content url="file://$MODULE_DIR$" />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$" isTestSource="false" />
+      <excludeFolder url="file://$MODULE_DIR$/docs" />
+      <excludeFolder url="file://$MODULE_DIR$/esm" />
+      <excludeFolder url="file://$MODULE_DIR$/public" />
+      <excludeFolder url="file://$MODULE_DIR$/dev" />
+    </content>
     <orderEntry type="inheritedJdk" />
     <orderEntry type="sourceFolder" forTests="false" />
   </component>

package/.idea/shelf/Uncommitted_changes_before_Update_at_24_07_2023_15_31_[Default_Changelist]/shelved.patch

@@ -0,0 +1,90 @@
+Index: src/maths/expressions/numexp.ts
+IDEA additional info:
+Subsystem: com.intellij.openapi.diff.impl.patch.BaseRevisionTextPatchEP
+<+>import {Shutingyard, ShutingyardMode, ShutingyardType, tokenConstant} from \"../shutingyard\";\r\nimport {Fraction} from \"../coefficients/fraction\";\r\n\r\nexport class NumExp {\r\n    private _rpn: { token: string, tokenType: string }[]\r\n    private _expression: string\r\n    private _isValid: boolean\r\n\r\n    constructor(value: string, uniformize?:boolean) {\r\n        this._expression = value\r\n        try {\r\n            this._rpn = new Shutingyard(ShutingyardMode.NUMERIC).parse(value, uniformize || uniformize===undefined).rpn\r\n        }catch(e){\r\n            this._rpn = null\r\n            this._isValid = false\r\n        }\r\n    }\r\n\r\n    get rpn(): { token: string; tokenType: string }[] {\r\n        return this._rpn;\r\n    }\r\n\r\n    get isValid(): boolean {\r\n        if(this._isValid===undefined){\r\n            try {\r\n                const v = this.evaluate({x: 0})\r\n            }catch{\r\n                this._isValid = false\r\n            }\r\n        }\r\n        return this._isValid\r\n    }\r\n\r\n    set isValid(value: boolean){\r\n        this._isValid = value\r\n    }\r\n\r\n    get expression(): string {\r\n        return this._expression;\r\n    }\r\n\r\n    private _extractDecimalPart(value: number): string {\r\n        let decimal = value.toString()\r\n\r\n        if (!decimal.includes('.')) {\r\n            return ''\r\n        }\r\n\r\n        decimal = decimal.split('.')[1]\r\n\r\n        return decimal.substring(0, decimal.length - 2)\r\n    }\r\n\r\n    private _numberCorrection(value: number): number {\r\n        // Must modify the number if it's like:\r\n        // a: 3.0000000000000003\r\n        // b: 3.9999999999999994\r\n        // remove the last character\r\n        // check if around n last characters are either 0 or 9\r\n        // if it is, 'round' the number.\r\n\r\n        const epsilon = 0.00000000000001,\r\n            number_of_digits = 6\r\n\r\n        const decimal = this._extractDecimalPart(value)\r\n        if(decimal===''){return value}\r\n\r\n        const n9 = decimal.match(/9+$/g)\r\n        const n0 = decimal.match(/0+$/g)\r\n\r\n        if (n9 && n9[0].length >= number_of_digits) {\r\n            // New tested values.\r\n            const mod = this._extractDecimalPart(value + epsilon),\r\n                mod0 = mod.match(/0+$/g)\r\n\r\n            if(mod0 && mod0[0].length>= number_of_digits){\r\n                // The value can be changed. Remove all zeros!\r\n                return +((value+epsilon).toString().split(mod0[0])[0])\r\n            }\r\n        }\r\n\r\n        if (n0 && n0[0].length >= number_of_digits) {\r\n            // New tested values.\r\n            const mod = this._extractDecimalPart(value - epsilon),\r\n                mod9 = mod.match(/9+$/g)\r\n\r\n            if(mod9 && mod9[0].length>= number_of_digits){\r\n                // The value can be changed. Remove all nines!\r\n                return +(value.toString().split(n0[0])[0])\r\n            }\r\n        }\r\n\r\n        return value\r\n    }\r\n\r\n    private _addToStack(stack:number[], value: number): void {\r\n        stack.push(this._numberCorrection(value))\r\n    }\r\n\r\n    evaluate(values: { [Key: string]: number }): number {\r\n        const stack: number[] = []\r\n\r\n        if(this._rpn===null){\r\n            this._isValid = false\r\n            return 0\r\n        }\r\n\r\n        this.isValid = true\r\n\r\n        for (const element of this._rpn) {\r\n            if (element.tokenType === ShutingyardType.COEFFICIENT) {\r\n                // May be a numeric value or a Fraction.\r\n                if (!isNaN(+element.token)) {\r\n                    this._addToStack(stack, +element.token)\r\n                } else {\r\n                    this._addToStack(stack, new Fraction(element.token).value)\r\n                }\r\n            } else if (element.tokenType === ShutingyardType.VARIABLE) {\r\n                if (values[element.token] !== undefined) {\r\n                    this._addToStack(stack, +values[element.token])\r\n                }\r\n            } else if (element.tokenType === ShutingyardType.CONSTANT) {\r\n                this._addToStack(stack, tokenConstant[element.token])\r\n            } else if (element.tokenType === ShutingyardType.OPERATION) {\r\n                if (element.token === '*') {\r\n                    const b = stack.pop(),\r\n                        a = stack.pop()\r\n                    if(a === undefined || b === undefined){this.isValid = false}\r\n                    this._addToStack(stack, a * b)\r\n                } else if (element.token === '/') {\r\n                    const b = stack.pop(),\r\n                        a = stack.pop()\r\n                    if(a === undefined || b === undefined){this.isValid = false}\r\n                    this._addToStack(stack, a / b)\r\n                } else if (element.token === '+') {\r\n                    const b = stack.pop(),\r\n                        a = stack.pop()\r\n                    if(a === undefined || b === undefined){this.isValid = false}\r\n                    this._addToStack(stack, (+a) + (+b))\r\n                } else if (element.token === '-') {\r\n                    const b = stack.pop(),\r\n                        a = stack.pop() || 0\r\n                    if(b === undefined){this.isValid = false}\r\n                    this._addToStack(stack, a - b)\r\n                } else if (element.token === '^') {\r\n                    const b = stack.pop(),\r\n                        a = stack.pop()\r\n                    if(a === undefined || b === undefined){this.isValid = false}\r\n                    this._addToStack(stack, Math.pow(a, b))\r\n                }\r\n            } else if (element.tokenType === ShutingyardType.FUNCTION) {\r\n                const a = stack.pop()\r\n                if(a === undefined){this.isValid = false}\r\n                if (element.token === 'sin') {\r\n                    this._addToStack(stack, Math.sin(a))\r\n                } else if (element.token === 'cos') {\r\n                    this._addToStack(stack, Math.cos(a))\r\n                } else if (element.token === 'tan') {\r\n                    this._addToStack(stack, Math.tan(a))\r\n                } else if(element.token === 'sqrt') {\r\n                    this._addToStack(stack, Math.sqrt(a))\r\n                }else if(element.token ==='nthrt') {\r\n                    // TODO: support nthrt in num. exp.\r\n                    let b = stack.pop()\r\n                    if(a%2===0 && b<0){\r\n                        this._addToStack(stack, NaN)\r\n                    }else {\r\n                        this._addToStack(stack, (b < 0 ? -1 : 1) * Math.pow(Math.abs(b), 1 / a))\r\n                    }\r\n                } else if(element.token === 'ln'){\r\n                    this._addToStack(stack, Math.log(a))\r\n                } else if(element.token === 'log') {\r\n                    this._addToStack(stack, Math.log10(a))\r\n                }\r\n            }\r\n        }\r\n\r\n        if (stack.length === 1) {\r\n            return stack[0]\r\n        } else {\r\n            throw `There was a problem parsing: ${this._expression}`\r\n        }\r\n    }\r\n}\r\n
+===================================================================
+diff --git a/src/maths/expressions/numexp.ts b/src/maths/expressions/numexp.ts
+--- a/src/maths/expressions/numexp.ts	
++++ b/src/maths/expressions/numexp.ts	
+@@ -51,46 +51,47 @@
+         return decimal.substring(0, decimal.length - 2)
+     }
+ 
+-    private _numberCorrection(value: number): number {
++    private _numberCorrection(value: number, number_of_digits=6): number {
++        return +value.toFixed(number_of_digits);
+         // Must modify the number if it's like:
+         // a: 3.0000000000000003
+         // b: 3.9999999999999994
+         // remove the last character
+         // check if around n last characters are either 0 or 9
+         // if it is, 'round' the number.
+-
+-        const epsilon = 0.00000000000001,
+-            number_of_digits = 6
+-
+-        const decimal = this._extractDecimalPart(value)
+-        if(decimal===''){return value}
+-
+-        const n9 = decimal.match(/9+$/g)
+-        const n0 = decimal.match(/0+$/g)
+-
+-        if (n9 && n9[0].length >= number_of_digits) {
+-            // New tested values.
+-            const mod = this._extractDecimalPart(value + epsilon),
+-                mod0 = mod.match(/0+$/g)
+-
+-            if(mod0 && mod0[0].length>= number_of_digits){
+-                // The value can be changed. Remove all zeros!
+-                return +((value+epsilon).toString().split(mod0[0])[0])
+-            }
+-        }
+-
+-        if (n0 && n0[0].length >= number_of_digits) {
+-            // New tested values.
+-            const mod = this._extractDecimalPart(value - epsilon),
+-                mod9 = mod.match(/9+$/g)
+-
+-            if(mod9 && mod9[0].length>= number_of_digits){
+-                // The value can be changed. Remove all nines!
+-                return +(value.toString().split(n0[0])[0])
+-            }
+-        }
+-
+-        return value
++        //
++        // const epsilon = 0.00000000000001,
++        //     number_of_digits = 6
++        //
++        // const decimal = this._extractDecimalPart(value)
++        // if(decimal===''){return value}
++        //
++        // const n9 = decimal.match(/9+$/g)
++        // const n0 = decimal.match(/0+$/g)
++        //
++        // if (n9 && n9[0].length >= number_of_digits) {
++        //     // New tested values.
++        //     const mod = this._extractDecimalPart(value + epsilon),
++        //         mod0 = mod.match(/0+$/g)
++        //
++        //     if(mod0 && mod0[0].length>= number_of_digits){
++        //         // The value can be changed. Remove all zeros!
++        //         return +((value+epsilon).toString().split(mod0[0])[0])
++        //     }
++        // }
++        //
++        // if (n0 && n0[0].length >= number_of_digits) {
++        //     // New tested values.
++        //     const mod = this._extractDecimalPart(value - epsilon),
++        //         mod9 = mod.match(/9+$/g)
++        //
++        //     if(mod9 && mod9[0].length>= number_of_digits){
++        //         // The value can be changed. Remove all nines!
++        //         return +(value.toString().split(n0[0])[0])
++        //     }
++        // }
++        //
++        // return value
+     }
+ 
+     private _addToStack(stack:number[], value: number): void {

package/.idea/shelf/Uncommitted_changes_before_Update_at_24_07_2023_15_31_[Default_Changelist]1/shelved.patch

@@ -0,0 +1,107 @@
+Index: src/index.ts
+IDEA additional info:
+Subsystem: com.intellij.openapi.diff.impl.patch.BaseRevisionTextPatchEP
+<+>import {Numeric} from \"./maths/numeric\";\r\nimport {NumExp} from \"./maths/expressions/numexp\";\r\nimport {Shutingyard} from \"./maths/shutingyard\";\r\nimport {Random} from \"./maths/randomization/random\";\r\nimport {Fraction} from \"./maths/coefficients/fraction\";\r\nimport {NthRoot} from \"./maths/coefficients/nthRoot\";\r\nimport {Monom} from \"./maths/algebra/monom\";\r\nimport {Polynom} from \"./maths/algebra/polynom\";\r\nimport {Equation} from \"./maths/algebra/equation\";\r\nimport {LinearSystem} from \"./maths/algebra/linearSystem\";\r\nimport {Rational} from \"./maths/algebra/rational\";\r\nimport {Logicalset} from \"./maths/algebra/logicalset\";\r\nimport {PolynomExpFactor, PolynomExpProduct} from \"./maths/expressions/polynomexp\";\r\nimport {Vector} from \"./maths/geometry/vector\";\r\nimport {Line} from \"./maths/geometry/line\";\r\nimport {Triangle} from \"./maths/geometry/triangle\";\r\nimport {Circle} from \"./maths/geometry/circle\";\r\nimport {Point} from \"./maths/geometry/point\";\r\n\r\n// Expose as global\r\nexport const PiMath = {\r\n    ShutingYard: Shutingyard,\r\n    Numeric: Numeric,\r\n    NumExp: NumExp,\r\n    Fraction: Fraction,\r\n    Root: NthRoot,\r\n    Monom: Monom,\r\n    Polynom: Polynom,\r\n    Equation: Equation,\r\n    LinearSystem: LinearSystem,\r\n    Rational: Rational,\r\n    Logicalset: Logicalset,\r\n    Random: Random,\r\n    PolynomExpFactor: PolynomExpFactor,\r\n    PolynomExpProduct: PolynomExpProduct,\r\n    Geometry: {\r\n        Vector: Vector,\r\n        Point: Point,\r\n        Line: Line,\r\n        Triangle: Triangle,\r\n        Circle: Circle\r\n    }\r\n};\r\n\r\n(<any>window).Pi = PiMath\r\n
+Subsystem: com.intellij.openapi.diff.impl.patch.CharsetEP
+<+>UTF-8
+===================================================================
+diff --git a/src/index.ts b/src/index.ts
+--- a/src/index.ts	
++++ b/src/index.ts	
+@@ -42,4 +42,5 @@
+     }
+ };
+ 
+-(<any>window).Pi = PiMath
++// rename window.Pi to window.PiMath
++(<any>window).PiMath = PiMath
+Index: tests/numexp.test.ts
+IDEA additional info:
+Subsystem: com.intellij.openapi.diff.impl.patch.BaseRevisionTextPatchEP
+<+>import {expect} from 'chai';\r\nimport {NumExp} from \"../src/maths/expressions/numexp\";\r\nimport {Numeric} from \"../src/maths/numeric\";\r\n\r\ndescribe('Numerical expression', () => { // the tests container\r\n    it('RPN for numerical expression', () => {\r\n        const RPN = new NumExp('3*x+5').rpn\r\n        expect(RPN.map(x => x.token)).to.have.all.members(['3', 'x', '*', '5', '+'])\r\n\r\n        const RPN2 = new NumExp('-3*x^2-5').rpn\r\n        expect(RPN2.map(x => x.token)).to.have.all.members(['3', 'x', '2', '^', '*', '-', '5', '-'])\r\n    })\r\n\r\n    it('Evaluate for numerical expression', () => {\r\n        const expr = new NumExp('3*x+5')\r\n        expect(expr.evaluate({x: 5})).to.be.equal(20)\r\n\r\n        const expr2 = new NumExp('-3*x^2-5')\r\n        expect(expr2.evaluate({x: -2})).to.be.equal(-17)\r\n    })\r\n\r\n    it('Evaluation simple mathematical functions', () => {\r\n        const expr = new NumExp('sqrt(x)')\r\n        expect(expr.evaluate({x: 9})).to.be.equal(3)\r\n    })\r\n\r\n    it('should detect invalid rpn parsing', function () {\r\n        const exprValid = new NumExp('3*sin(x)'),\r\n            exprInvalid = new NumExp('3*sin')\r\n\r\n        expect(exprValid.isValid).to.be.true\r\n        expect(exprInvalid.isValid).to.be.false\r\n    });\r\n\r\n    it('souldd detect invalid expression withouth crahsing', function() {\r\n        const exprPourrie = new NumExp('3xsi'),\r\n            exprOk = new NumExp('3xsin(x)')\r\n\r\n        expect(exprPourrie.isValid).to.be.false\r\n        expect(exprOk.isValid).to.be.true\r\n    })\r\n\r\n    it('should parse without mult sign', function () {\r\n\r\n        let a = 1 / 5\r\n\r\n        const expr = new NumExp('3x-5', true)\r\n        expect(expr.isValid).to.be.true\r\n        expect(expr.evaluate({x: 2})).to.be.equal(1)\r\n\r\n        const expr2 = new NumExp('3*x-5', true)\r\n        expect(expr2.isValid).to.be.true\r\n        expect(expr2.evaluate({x: 2})).to.be.equal(1)\r\n    });\r\n\r\n    it('should calculate sqrt from exp', function(){\r\n        // let a = new NumExp('x^(1/3)')\r\n        // console.log(a.evaluate({x: 8}))\r\n\r\n        let k = new NumExp('nthrt(x,3)')\r\n        expect(k.evaluate({x: -8})).to.be.equal(-2)\r\n        expect(k.evaluate({x: 27})).to.be.equal(3)\r\n\r\n        let p = new NumExp('nthrt(x,4)')\r\n        expect(p.evaluate({x: 16})).to.be.equal(2)\r\n        expect(p.evaluate({x: -16})).to.be.NaN\r\n    })\r\n});\r\n
+Subsystem: com.intellij.openapi.diff.impl.patch.CharsetEP
+<+>UTF-8
+===================================================================
+diff --git a/tests/numexp.test.ts b/tests/numexp.test.ts
+--- a/tests/numexp.test.ts	
++++ b/tests/numexp.test.ts	
+@@ -65,4 +65,16 @@
+         expect(p.evaluate({x: 16})).to.be.equal(2)
+         expect(p.evaluate({x: -16})).to.be.NaN
+     })
++
++    it('should work with constant', function () {
++
++        let k = new NumExp('2pi*x')
++        expect(k.evaluate({x: 1})).to.be.equal(6.283186)
++    });
++
++    it('should work with constant but without variables', function () {
++
++        let k = new NumExp('2pi')
++        expect(k.evaluate()).to.be.equal(6.283186)
++    });
+ });
+Index: tests/algebra/linear.test.ts
+IDEA additional info:
+Subsystem: com.intellij.openapi.diff.impl.patch.BaseRevisionTextPatchEP
+<+>import {describe} from \"mocha\";\r\nimport {expect} from \"chai\";\r\nimport {LinearSystem} from \"../../src/maths/algebra/linearSystem\";\r\nimport {Polynom} from \"../../src/maths/algebra/polynom\";\r\nimport exp = require(\"constants\");\r\n\r\ndescribe('Linear systems tests', () => {\r\n    it('should solve a 2x2 equations', () => {\r\n        let LS = new LinearSystem(\r\n            '4x+5y=11',\r\n            '7y-24=3x'\r\n        )\r\n        LS.solve(true)\r\n\r\n        expect(LS.solution).to.be.equal('\\\\left(-1;3\\\\right)')\r\n    })\r\n    it('should solve a 3x3 equations', () => {\r\n        let LS = new LinearSystem(\r\n            '2x+7y-z=-3',\r\n            '-3x+2y+3z=12',\r\n            '-5x-3y+2z=5'\r\n        )\r\n\r\n        LS.solve()\r\n        console.log(LS.solution)\r\n    })\r\n\r\n    it('should solve a 3x3 equations II ', () => {\r\n        let LS = new LinearSystem(\r\n            '-x+y-z=-6',\r\n            '3x+2y+z=14',\r\n            '5x+y+3z=7'\r\n        )\r\n\r\n        LS.solve()\r\n        console.log(LS.solution)\r\n    })\r\n\r\n    it('should calculate the reduction', function () {\r\n        let E1 = new Polynom('6x+21y-3z'),\r\n            E2 = new Polynom('-6x+21y-3z')\r\n\r\n        // Start from hre\r\n        console.log('------------')\r\n        console.log(E1.tex, E2.tex)\r\n\r\n        console.log(E1.monoms.map(x => x.tex))\r\n        console.log(E2.monoms.map(x => x.tex))\r\n        E1.add(E2);\r\n\r\n        console.log(E1.tex)\r\n    });\r\n\r\n    it('should use a reduced linear reducation', function () {\r\n        let LS = new LinearSystem(\r\n            '3x-6y+3=0',\r\n            'x+12y-6=0'\r\n        )\r\n        LS.solve(true)\r\n\r\n        const tex = LS.stepTex('x')\r\n\r\n        expect(+LS.resolutionSteps['x'][0].operations[0][0]).to.be.equal(2)\r\n        expect(+LS.resolutionSteps['x'][0].operations[1][0]).to.be.equal(1)\r\n    });\r\n})\r\n
+Subsystem: com.intellij.openapi.diff.impl.patch.CharsetEP
+<+>UTF-8
+===================================================================
+diff --git a/tests/algebra/linear.test.ts b/tests/algebra/linear.test.ts
+--- a/tests/algebra/linear.test.ts	
++++ b/tests/algebra/linear.test.ts	
+@@ -63,4 +63,34 @@
+         expect(+LS.resolutionSteps['x'][0].operations[0][0]).to.be.equal(2)
+         expect(+LS.resolutionSteps['x'][0].operations[1][0]).to.be.equal(1)
+     });
++
++    it('should calculate what i need', function (){
++        let LS = new LinearSystem(
++            '15x-8y+16=0',
++            '5x+12y-24=0'
++        )
++        LS.solve()
++        console.log(LS.solution)
++
++        let LS2 = new LinearSystem(
++            '15x-8y+16=0',
++            '3x-4y-6=0'
++        )
++        LS2.solve()
++        console.log(LS2.solution)
++
++        let LS3 = new LinearSystem(
++            '5x+12y-24=0',
++            '3x-4y-6=0'
++        )
++        LS3.solve()
++        console.log(LS3.solution)
++
++        let LS4 = new LinearSystem(
++            '70x+25y-50=0',
++            '63x-54y-11=0'
++        )
++        LS4.solve()
++        console.log(LS4.solution)
++    })
+ })
+Index: LICENSE.md
+IDEA additional info:
+Subsystem: com.intellij.openapi.diff.impl.patch.BaseRevisionTextPatchEP
+<+>MIT License\r\n\r\nCopyright (c) 2020 Basil Gass\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in all\r\ncopies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\r\nSOFTWARE.\r\n
+Subsystem: com.intellij.openapi.diff.impl.patch.CharsetEP
+<+>UTF-8
+===================================================================
+diff --git a/LICENSE.md b/LICENSE.md
+--- a/LICENSE.md	
++++ b/LICENSE.md	
+@@ -1,6 +1,6 @@
+ MIT License
+ 
+-Copyright (c) 2020 Basil Gass
++Copyright (c) 2023 Basil Gass
+ 
+ Permission is hereby granted, free of charge, to any person obtaining a copy
+ of this software and associated documentation files (the "Software"), to deal

package/.idea/shelf/Uncommitted_changes_before_Update_at_24_07_2023_15_31__Default_Changelist_.xml

@@ -0,0 +1,4 @@
+<changelist name="Uncommitted_changes_before_Update_at_24_07_2023_15_31_[Default_Changelist]" date="1690205520775" recycled="false" toDelete="true">
+  <option name="PATH" value="$PROJECT_DIR$/.idea/shelf/Uncommitted_changes_before_Update_at_24_07_2023_15_31_[Default_Changelist]/shelved.patch" />
+  <option name="DESCRIPTION" value="Uncommitted changes before Update at 24.07.2023 15:31 [Default Changelist]" />
+</changelist>

package/.idea/shelf/Uncommitted_changes_before_Update_at_24_07_2023_15_31__Default_Changelist_1.xml

@@ -0,0 +1,4 @@
+<changelist name="Uncommitted_changes_before_Update_at_24_07_2023_15_31_[Default_Changelist]1" date="1690205596619" recycled="true" deleted="true">
+  <option name="PATH" value="$PROJECT_DIR$/.idea/shelf/Uncommitted_changes_before_Update_at_24_07_2023_15_31_[Default_Changelist]1/shelved.patch" />
+  <option name="DESCRIPTION" value="Uncommitted changes before Update at 24.07.2023 15:31 [Default Changelist]" />
+</changelist>

package/LICENSE.md

@@ -1,6 +1,6 @@
 MIT License
 
-Copyright (c) 2020 Basil Gass
+Copyright (c) 2023 Basil Gass
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal