ziko 0.0.11 → 0.0.13

package/src/math/matrix/index.js

@@ -0,0 +1,3 @@
+export * from "./Matrix.js"
+export * from "./Decomposition.js"
+export * from "./LinearSystem.js"

package/src/math/random/index.js

@@ -0,0 +1,173 @@
+
+import{Complex}from"../complex/index.js"
+import { Utils } from "../utils/index.js";
+import{Base}from"../discret/index.js"
+import { matrix } from "../matrix/index.js";
+class Random {
+    static float(a = 1, b) {
+        return b ? Math.random() * (b - a) + a : a * Math.random();
+    }
+    static int(a, b) {
+        return Math.floor(this.float(a, b));
+    }
+    static char(upperCase){
+        upperCase=upperCase??this.bool();
+        const Char=String.fromCharCode(this.int(97,120));
+        return upperCase?Char.toUpperCase():Char;
+    }
+    static bool(){
+        return [false,true][Math.floor(Math.random()*2)];
+    }
+    static string(length,upperCase){
+        return length instanceof Array?
+            new Array(this.int(...length)).fill(0).map(() => this.char(upperCase)).join(""):
+            new Array(length).fill(0).map(() => this.char(upperCase)).join("");
+    }
+    static bin() {
+        return this.int(2);
+    }
+    static oct() {
+        return this.int(8);
+    }
+    static dec() {
+        return this.int(8);
+    }
+    static hex() {
+        return this.int(16);
+    }
+    static choice(choices = [1, 2, 3], p = new Array(choices.length).fill(1 / choices.length)) {
+        let newchoice = new Array(100);
+        p=Utils.accum(...p).map(n=>n*100)
+        newchoice.fill(choices[0], 0, p[0]);
+        for (let i = 1; i < choices.length; i++) newchoice.fill(choices[i], p[i - 1], p[i]);
+        return newchoice[this.int(newchoice.length - 1)];
+    }
+    static shuffleArr(arr){
+        return arr.sort(()=>0.5-Math.random())    
+    }
+    static shuffleMatrix(M){
+            const {rows,cols,arr}=M;
+            return matrix(rows,cols,arr.flat().sort(()=>0.5-Math.random()))
+    }
+    static floats(n, a, b) {
+        return new Array(n).fill(0).map(() => this.float(a, b));
+    }
+    static ints(n, a, b) {
+        return new Array(n).fill(0).map(() => this.int(a, b));
+    }
+    static bools(n){
+        return  new Array(n).fill(0).map(() => this.bool());
+    }
+    static bins(n) {
+        return new Array(n).fill(0).map(() => this.int(2));
+    }
+    static octs(n) {
+        return new Array(n).fill(0).map(() => this.int(8));
+    }
+    static decs(n) {
+        return new Array(n).fill(0).map(() => this.int(10));
+    }
+    static hexs(n) {
+        return new Array(n).fill(0).map(() => this.int(16));
+    }
+    static choices(n, choices, p) {
+        return new Array(n).fill(0).map(() => this.choice(choices, p));
+    }
+    static perm(...arr) {
+        // permutation
+        return arr.permS[this.int(arr.length)];
+    }
+    static color() {
+        return "#" + Base.dec2hex(this.float(16777216)).padStart(6,0);
+    }
+    static colors(n) {
+        return new Array(n).fill(null).map(()=>this.color());
+    }
+    static complex(a = [0,1], b = [0,1]) {
+        return a instanceof Array?
+        new Complex(
+            this.float(a[0], a[1]),
+            this.float(b[0], b[1])
+        ):
+        new Complex(
+            ...this.floats(2,a,b)
+        )
+        
+    }
+    static complexInt(a = [0,1], b = [0,1]) {
+        return new Complex(
+            this.int(a[0], a[1]),
+            this.int(b[0], b[1])
+            );
+    }
+    static complexBin() {
+        return new Complex(...this.bins(2));
+    }
+    static complexOct() {
+        return new Complex(...this.octs(2));
+    }
+    static complexDec() {
+        return new Complex(...this.decs(10));
+    }
+    static complexHex() {
+        return new Complex(...this.octs(2));
+    }
+    static complexes(n, a = 0, b = 1) {
+        return new Array(n).fill(0).map(() => this.complex(a, b));
+    }
+    static complexesInt(n, a = 0, b = 1) {
+        return new Array(n).fill(0).map(() => this.complexInt(a, b));
+    }
+    static complexesBin(n) {
+        return new Array(n).fill(0).map(() => this.complexBin());
+    }
+    static complexesOct(n) {
+        return new Array(n).fill(0).map(() => this.complexOct());
+    }
+    static complexesDec(n) {
+        return new Array(n).fill(0).map(() => this.complexDec());
+    }
+    static complexesHex(n) {
+        return new Array(n).fill(0).map(() => this.complexHex());
+    }
+    static matrix(r,c,min,max){
+        return matrix(r,c,this.floats(r*c,min,max))
+    }
+    static matrixInt(r,c,min,max){
+        return matrix(r,c,this.ints(r*c,min,max))
+    }
+    static matrixBin(r,c){
+        return matrix(r,c,this.bins(r*c))
+    }
+    static matrixOct(r,c){
+        return matrix(r,c,this.octs(r*c))
+    }
+    static matrixDec(r,c){
+        return matrix(r,c,this.decs(r*c))
+    }
+    static matrixHex(r,c){
+        return matrix(r,c,this.hex(r*c))
+    }
+    static matrixColor(r,c){
+        return matrix(r,c,this.colors(r*c))
+    }
+    static matrixComplex(r,c,a,b){
+        return matrix(r,c,this.complexes(r*c,a,b))
+    }
+    static matrixComplexInt(r,c,a,b){
+        return matrix(r,c,this.complexesInt(r*c,a,b))
+    }
+    static matrixComplexBin(r,c){
+        return matrix(r,c,this.complexesBin(r*c))
+    }
+    static matrixComplexOct(r,c){
+        return matrix(r,c,this.complexesBin(r*c))
+    }
+    static matrixComplexDec(r,c){
+        return matrix(r,c,this.complexesBin(r*c))
+    }
+    static matrixComplexHex(r,c){
+        return matrix(r,c,this.complexesBin(r*c))
+    }
+}
+export{Random}

package/src/math/signal/__np.py.txt

@@ -0,0 +1,40 @@
+import numpy as np
+lin_R=np.linspace(1,10,10,)
+lin_C=np.linspace(10j+1,10+1j,10)
+print("Linspace")
+print(lin_R)
+print("-"*70)
+print(lin_C)
+log_R=np.logspace(1,10,10, base = 2)
+log_C=np.logspace(10j+1,10+1j,10 , base = 2)
+print("-"*70)
+print("Logspace")
+print(log_R)
+print("-"*70)
+print(log_C)
+geo_R=np.geomspace(1,512,10)
+geo_C=np.geomspace(1+1j,512+512j,10)
+print("-"*70)
+print("geomspace")
+print(geo_R)
+print("-"*70)
+print(geo_C)
+
+
+# // const logspace=(a,b,n=b-a+1,base=E,endpoint=true)=>{
+# //     if(a instanceof Complex||b instanceof Complex){
+# //         a=complex(a);
+# //         b=complex(b);
+# //         n=n??abs(b.a-a.a)
+# //         const X=linspace(a.a,b.a,n,base,endpoint);
+# //         const Y=linspace(a.b,b.b,n,base,endpoint);
+# //         const Z=new Array(X.length).fill(0)
+# //         const ZZ=Z.map((n,i) => pow(base,complex(X[i],Y[i])));
+# //         return ZZ;
+# //     }
+# //     const start=base**min(a,b);
+# //     const stop=base**max(a,b);
+# //     const y = linspace(ln(start) / ln(base), ln(stop) / ln(base), n, endpoint);
+# //     const result=y.map(n => pow(base, n));
+# //     return a<b?result:result.reverse();
+# // }

package/src/math/signal/conv.js

@@ -0,0 +1,175 @@
+import { Matrix , matrix } from "../matrix/index.js";
+import { sqrt } from "../functions/index.js";
+const conv1d=(input, kernel , circular = true)=>{
+    const INPUT_LENGTH = input.length;
+    const KERNEL_LENGTH = kernel.length;
+    const output = [];
+    const LENGTH_OUT = circular ? Math.max(INPUT_LENGTH,KERNEL_LENGTH) : INPUT_LENGTH + KERNEL_LENGTH - 1;
+    for (let i = 0; i < LENGTH_OUT; i++) {
+        let sum = 0;
+        for (let j = 0; j < KERNEL_LENGTH; j++) {
+            const inputIndex = i + j - Math.floor(KERNEL_LENGTH / 2);
+            // Apply zero-padding for out-of-bounds indices
+            const inputValue = inputIndex >= 0 && inputIndex < INPUT_LENGTH
+                ? input[inputIndex]
+                : 0;
+            sum += inputValue * kernel[j];
+        }
+        output.push(sum);
+    }
+    return output;
+}
+
+const conv2d = (input, kernel, circular = true) => {
+    if(!(input instanceof Matrix)) input = matrix(input);
+    if(!(kernel instanceof Matrix)) kernel = matrix(kernel);
+    const INPUT_ROWS=input.rows;
+    const INPUT_COLS=input.cols;
+    const OUTPUT_ROWS = circular ? Math.max(input.rows,kernel.rows) : input.rows + kernel.rows-1;
+    const OUTPUT_COLS = circular ? Math.max(input.cols,kernel.cols) : input.cols + kernel.cols-1;
+    const KERNEL_SIZE = kernel.rows;
+    const output = [];
+    for (let i = 0; i < OUTPUT_ROWS ; i++) {
+        const row = [];
+        for (let j = 0; j < OUTPUT_COLS ; j++) {
+            let sum = 0;
+            for (let k = 0; k < KERNEL_SIZE; k++) {
+                for (let l = 0; l < KERNEL_SIZE; l++) {
+                    const rowIndex = i + k - Math.floor(KERNEL_SIZE / 2);
+                    const colIndex = j + l - Math.floor(KERNEL_SIZE / 2);
+                    // Apply zero-padding for out-of-bounds indices
+                    const inputValue = (rowIndex >= 0 && rowIndex < INPUT_ROWS &&
+                                        colIndex >= 0 && colIndex < INPUT_COLS)
+                        ? input[rowIndex][colIndex]
+                        : 0;
+                    sum += inputValue * kernel[k][l];
+                }
+            }
+            row.push(sum);
+        }
+        output.push(row);
+    }
+    return output;
+};
+
+var convolute=(parent,kernel = [0, -1, 0, -1, 5, -1, 0, -1, 0], x1 = 0, y1 = 0, x2 = parent.element.width, y2 = parent.element.height)=>{
+    if(kernel instanceof Matrix)kernel=kernel.arr.flat(1)
+    var opaque = 1;
+    var pixels = parent.ctx.getImageData(x1, y1, x2, y2);
+    var side = Math.round(sqrt(kernel.length));
+    var halfSide = Math.floor(side / 2);
+    var src = pixels.data;
+    var sw = pixels.width;
+    var sh = pixels.height;
+    // pad output by the convolution matrix
+    var w = sw;
+    var h = sh;
+    var output = parent.ctx.createImageData(w, h);
+    var dst = output.data;
+    // go through the destination image pixels
+    var alphaFac = opaque ? 1 : 0;
+    for (var y = 0; y < h; y++) {
+        for (var x = 0; x < w; x++) {
+            var sy = y;
+            var sx = x;
+            var dstOff = (y * w + x) * 4;
+            // calculate the weighed sum of the source image pixels that
+            // fall under the convolution matrix
+            var r = 0,
+                g = 0,
+                b = 0,
+                a = 0;
+            for (var cy = 0; cy < side; cy++) {
+                for (var cx = 0; cx < side; cx++) {
+                    var scy = sy + cy - halfSide;
+                    var scx = sx + cx - halfSide;
+                    if (scy >= 0 && scy < sh && scx >= 0 && scx < sw) {
+                        var srcOff = (scy * sw + scx) * 4;
+                        var wt = kernel[cy * side + cx];
+                        r += src[srcOff] * wt;
+                        g += src[srcOff + 1] * wt;
+                        b += src[srcOff + 2] * wt;
+                        a += src[srcOff + 3] * wt;
+                    }
+                }
+            }
+            dst[dstOff] = r;
+            dst[dstOff + 1] = g;
+            dst[dstOff + 2] = b;
+            dst[dstOff + 3] = a + alphaFac * (255 - a);
+        }
+    }
+    return output;
+}
+
+convolute=(parent,kernel = [0, -1, 0, -1, 5, -1, 0, -1, 0], x1 = 0, y1 = 0, x2 = parent.element.width, y2 = parent.element.height)=>{
+    if(kernel instanceof Matrix)kernel=kernel.arr.flat(1)
+    var opaque = 1;
+    var pixels = parent.ctx.getImageData(x1, y1, x2, y2);
+    var side = Math.round(sqrt(kernel.length));
+    var halfSide = Math.floor(side / 2);
+    var src = pixels.data;
+    var sw = pixels.width;
+    var sh = pixels.height;
+    // pad output by the convolution matrix
+    var w = sw;
+    var h = sh;
+    var output = parent.ctx.createImageData(w, h);
+    var dst = output.data;
+    // go through the destination image pixels
+    var alphaFac = opaque ? 1 : 0;
+    for (var y = 0; y < h; y++) {
+        for (var x = 0; x < w; x++) {
+            var sy = y;
+            var sx = x;
+            var dstOff = (y * w + x) * 4;
+            // calculate the weighed sum of the source image pixels that
+            // fall under the convolution matrix
+            var r = 0,
+                g = 0,
+                b = 0,
+                a = 0;
+            for (var cy = 0; cy < side; cy++) {
+                for (var cx = 0; cx < side; cx++) {
+                    var scy = sy + cy - halfSide;
+                    var scx = sx + cx - halfSide;
+                    if (scy >= 0 && scy < sh && scx >= 0 && scx < sw) {
+                        var srcOff = (scy * sw + scx) * 4;
+                        var wt = kernel[cy * side + cx];
+                        r += src[srcOff] * wt;
+                        g += src[srcOff + 1] * wt;
+                        b += src[srcOff + 2] * wt;
+                        a += src[srcOff + 3] * wt;
+                    }
+                }
+            }
+            dst[dstOff] = r;
+            dst[dstOff + 1] = g;
+            dst[dstOff + 2] = b;
+            dst[dstOff + 3] = a + alphaFac * (255 - a);
+        }
+    }
+    return output;
+}
+const conv=(input,kernel,circular)=>{
+    if(input instanceof Matrix || (input instanceof Array && input[0][0]))return conv2d(input,kernel,circular);
+    return conv1d(input,kernel,circular)
+}
+const circularConv=(input,kernel)=>conv(input,kernel,true);
+const linearConv=(input,kernel)=>conv(input,kernel,false);
+const circularConv1d=(input,kernel)=>conv1d(input,kernel,true);
+const circularConv2d=(input,kernel)=>conv2d(input,kernel,true);
+const linearConv1d=(input,kernel)=>conv1d(input,kernel,false);
+const linearConv2d=(input,kernel)=>conv2d(input,kernel,false);
+export{
+    conv1d,
+    conv2d,
+    conv,
+    circularConv,
+    linearConv,
+    circularConv1d,
+    linearConv1d,
+    circularConv2d,
+    linearConv2d,
+    convolute
+}

package/src/math/signal/fft.js

@@ -0,0 +1,55 @@
+import { Complex , complex } from "../complex";
+import { PI } from "../const";
+import { cos , sin  } from "../functions";
+const fft=x=>{
+    const output = [];
+    const N = x.length;
+    if(!(x[0]instanceof Complex))x=x.map((n)=>complex(n,0));
+    for (let k = 0; k < N; k++) {
+      let re = 0,im=0;
+      for (let n = 0; n < N; n++) {
+        const phi = (2*PI * k * n) / N;
+        re += x[n].a*cos(phi)+x[n].b*sin(phi);
+        im += -x[n].a*sin(phi)+x[n].b*cos(phi);
+      }
+      re = re / N;
+      im = im / N;
+      output[k] = complex(re,im);
+    }
+    return {
+        output,
+        re:output.map(n=>n.a),
+        im:output.map(n=>n.b),
+        z:output.map(n=>n.z),
+        phi:output.map(n=>n.phi)
+    }
+  }
+  const ifft=x=>{
+    const output = [];
+    const N = x.length;
+      if(!(x[0]instanceof Complex))x=x.map((n)=>complex(n,0));
+    for (let k = 0; k < N; k++) {
+      let re=0,im=0;
+      for (let n = 0; n < N; n++) {
+        const phi = (2*PI * k * n) / N;
+        re += x[n].a*cos(phi)+x[n].b*sin(phi);
+        im += x[n].a*sin(phi)+x[n].b*cos(phi);
+      }
+      re = re / N;
+      im = im / N;
+  
+      output[k] = complex(re,im);
+    }
+    return {
+        output,
+        re:output.map(n=>n.a),
+        im:output.map(n=>n.b),
+        z:output.map(n=>n.z),
+        phi:output.map(n=>n.phi)
+    };
+  }
+
+export{
+    fft,
+    ifft
+}

package/src/math/signal/filter.js

@@ -0,0 +1,39 @@
+import { complex } from "../complex/index.js";
+import {fft,ifft} from "./fft.js";
+// should be processed in other thread
+class Filter{
+    constructor(input){
+        this.input=input;
+        this.input_fft=fft(this.input);
+        this.output_fft=[]
+    }
+    // get length(){
+    //     return this.input.length;
+    // }
+    lowPass(fc){
+        this.input_fft.output.forEach((n,i)=>{
+            n=n.z<fc
+            ? this.output_fft[i]=this.input_fft.output[i]
+            : this.output_fft[i]=complex(0,0)
+        })
+        return ifft(this.output_fft).re;
+    }
+    highPass(fc){
+        this.input_fft.output.forEach((n,i)=>{
+            n=n.z>fc
+            ? this.output_fft[i]=this.input_fft.output[i]
+            : this.output_fft[i]=complex(0,0)
+        })
+        return ifft(this.output_fft).re;
+    }
+    bandePass(){
+
+    }
+    bandeCoupe(){
+
+    }
+}
+const filter=input=>new Filter(input);
+export{
+    filter
+}

package/src/math/signal/functions.js

@@ -0,0 +1,146 @@
+import { Complex , complex } from "../complex/index.js";
+import { abs , pow , sqrtn , max , min} from "../functions/index.js";
+import { mul } from "../utils/index.js";
+import { E } from "../const.js";
+import { Matrix  } from "../matrix/Matrix.js";
+const zeros=(n)=>new Array(n).fill(0);
+const ones=(n)=>new Array(n).fill(1);
+const nums=(num,n)=>new Array(n).fill(num);
+const norm=(value, min, max)=>{
+    if (typeof value === "number") return min !== max ? (value - min) / (max - min) : 0;
+    else if (value instanceof Matrix) return new Matrix(value.rows, value.cols, norm(value.arr.flat(1), min, max));
+    else if (value instanceof Complex) return new Complex(norm(value.a, min, max), norm(value.b, min, max));
+    else if (value instanceof Array) {
+        if (value.every((n) => typeof (n === "number"))) {
+            return value.map((n) => norm(n, min, max));
+        } else {
+            let y = new Array(value.length);
+            for (let i = 0; i < value.length; i++) {
+                y[i] = norm(value[i]);
+            }
+        }
+    }
+}
+const lerp=(value, min, max)=>{
+    if (typeof value === "number") return (max - min) * value + min;
+    else if (value instanceof Matrix) return new Matrix(value.rows, value.cols, lerp(value.arr.flat(1), min, max));
+    else if (value instanceof Complex) return new Complex(lerp(value.a, min, max), lerp(value.b, min, max));
+    else if (value instanceof Array) {
+        if (value.every((n) => typeof (n === "number"))) {
+            return value.map((n) => lerp(n, min, max));
+        } else {
+            let y = new Array(value.length);
+            for (let i = 0; i < value.length; i++) {
+                y[i] = lerp(value[i]);
+            }
+        }
+    }
+}
+const map=(value, a, b, c, d)=>{
+    if (typeof value === "number") return lerp(norm(value, a, b), c, d);
+    else if (value instanceof Matrix) return new Matrix(value.rows, value.cols, map(value.arr.flat(1), a, b, c, d));
+    else if (value instanceof Complex) return new Complex(map(value.a, b, c, d), map(value.b, a, b, c, d));
+    else if (value instanceof Array) {
+        if (value.every((n) => typeof (n === "number"))) {
+            return value.map((n) => map(n, a, b, c, d));
+        } else {
+            let y = new Array(value.length);
+            for (let i = 0; i < value.length; i++) {
+                y[i] = map(value[i], a, b, c, d);
+            }
+        }
+    }
+}
+const clamp=(x, a , b)=>{
+    const [min_value,max_value]=[min(a,b),max(a,b)]
+    if (typeof x === "number") return min(max(x, min_value), max_value);
+    else if (x instanceof Matrix) return new Matrix(x.rows, x.cols, clamp(x.arr.flat(1), min_value, max_value));
+    else if (x instanceof Complex) return new Complex(clamp(x.a, min_value, max_value), clamp(x.b, min_value, max_value));
+    else if (x instanceof Array) {
+        if (x.every((n) => typeof (n === "number"))) {
+            return x.map((n) => clamp(n, min_value, max_value));
+        } else {
+            let y = new Array(x.length);
+            for (let i = 0; i < x.length; i++) {
+                y[i] = clamp(x[i], min_value, max_value);
+            }
+        }
+    }
+}
+const arange=(a, b, step , include = false)=>{
+    let tab = [];
+    if(a<b){
+        for (let i = a; include?i<=b:i<b; i += step) tab.push((i * 10) / 10);
+    }
+    else{
+        for(let i = a; include?i>=b:i>b; i -= step) tab.push((i * 10) / 10);
+    }
+    return tab;
+}
+const linspace=(a,b,n=abs(b-a)+1,endpoint=true)=>{
+    if(Math.floor(n)!==n)return;
+    if([a,b].every(n=>typeof n==="number")){
+        const [max,min]=[a,b].sort((a,b)=>b-a);
+        var Y = [];
+        let step ;
+        endpoint ? step = (max - min) / (n - 1) : step = (max - min) / n;
+        for (var i = 0; i < n; i++) {
+            a<b?Y.push(min+step*i):Y.push(max-step*i);
+        }
+        return Y
+    }
+
+    if([a,b].some(n=>n instanceof Complex)){
+        const z1=complex(a)
+        const z2=complex(b)
+        n=n||Math.abs(z1.a-z2.a)+1;
+        const X=linspace(z1.a,z2.a,n,endpoint);
+        const Y=linspace(z1.b,z2.b,n,endpoint);
+        let Z=new Array(n).fill(null);
+        Z=Z.map((n,i)=>complex(X[i],Y[i]));
+        return Z;
+    }
+}
+const logspace=(a,b,n=b-a+1,base=E,endpoint=true)=>{
+    return linspace(a,b,n,endpoint).map(n=>pow(base,n))
+}
+const geomspace=(a,b,n=abs(b-a)+1,endpoint=true)=>{
+    if(Math.floor(n)!==n)return;
+    if([a,b].every(n=>typeof n==="number")){
+        const [max,min]=[a,b].sort((a,b)=>b-a);
+        let base;
+        endpoint ? base = sqrtn(max/min,n-1) : base = sqrtn(max/min,n) ;
+        const Y = [min];
+        for (let i = 1; i < n; i++) {
+            Y.push(Y[i-1]*base)
+        }
+        return a<b?Y:Y.reverse()
+    }
+
+    if([a,b].some(n=>n instanceof Complex)){
+        const z1=complex(a)
+        const z2=complex(b)
+        n=n||Math.abs(z1.a-z2.a)+1;
+        let base;
+        endpoint ? base = sqrtn(z2.div(z1),n-1) : base = sqrtn(z2.div(z1),n) ;
+        const Y = [z1];
+        for (let i = 1; i < n; i++) {
+            Y.push(mul(Y[i-1],base))
+        } 
+        return Y;
+    }
+}
+export {
+    zeros,
+    ones,
+    nums,
+    norm,
+    lerp,
+    map,
+    clamp,
+    arange,
+    linspace,
+    logspace,
+    geomspace,
+
+}