ziko 0.0.17 → 0.0.19

package/src/math/signal/functions.js

@@ -1,146 +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,
-
+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,
+
 }

package/src/math/signal/index.js

@@ -1,110 +1,110 @@
-import { mapfun } from "../utils/index.js";
-import { abs , sinc , sign , sin } from "../functions/index.js"
-import { Random } from "../random/index.js";
-import { 
-    zeros,
-    ones,
-    nums,
-    arange,
-    linspace,
-    logspace,
-    geomspace,
-    map,
-    norm,
-    lerp,
-    clamp,
-} from "./functions.js";
-import{
-    fft,
-    ifft
-} from "./fft.js"
-import { 
-    conv,
-    conv1d, 
-    conv2d,
-    circularConv,
-    linearConv,
-    circularConv1d,
-    linearConv1d,
-    circularConv2d,
-    linearConv2d
-} from "./conv.js";
-import { 
-    filter
- } from "./filter.js";
-//import { Matrix } from "../Matrix/index.js";
-const Signal={
-    zeros,
-    ones,
-    nums,
-    arange,
-    linspace,
-    logspace,
-    geomspace,
-    map,
-    norm,
-    lerp,
-    clamp,
-    noise(n,min = 0,max = 1){
-        return Random.floats(n,min,max);
-    },
-    echelon(t,t0 = 0 , A = 1){
-        if(!(t instanceof Array))t=[t];
-        const Y = mapfun(n=>n>=t0?1:0,...t);
-        return Y instanceof Array ? Y.map(n=>n*A) : Y*A
-    },
-    rampe(t,t0 = 0 , A = 1){
-        if(!(t instanceof Array))t=[t]
-        const Y = mapfun(n=>n>=t0?n-t0:0,...t);
-        return Y instanceof Array ? Y.map(n=>n*A) : Y*A
-    },
-    sign(t,t0 = 0 , A = 1){
-        if(!(t instanceof Array))t=[t]
-        const Y = mapfun(n=>Math.sign(n-t0),...t);
-        return Y instanceof Array ? Y.map(n=>n*A) : Y*A
-    },
-    rect(t,T,t0 = 0, A = 1){
-        if(!(t instanceof Array))t=[t];
-        const Y = mapfun(n=>((t0-T/2 < n) && (t0+T/2 > n)? 1 - 2 * abs(n/T) : 0),...t)
-        return Y instanceof Array ? Y.map(n=>n*A) : Y*A
-    },
-    tri(t,T,t0 = 0 , A = 1){
-        if(!(t instanceof Array))t=[t] 
-        const Y = mapfun(n=>((t0-T/2 < n) && (t0+T/2 > n)? 1 - 2 * abs(n/T) : 0),...t)
-        return Y instanceof Array ? Y.map(n=>n*A) : Y*A;
-    },
-    dirac(t,t0){
-        return mapfun(n=>n===t0?Infinity:0,...t);
-    },
-    lorentz(t , t0 = 0 , A = 1){
-        if(!(t instanceof Array))t=[t] 
-        const Y = mapfun(n => 1/(1+(n-t0)**2),...t);
-        return Y instanceof Array ? Y.map(n=>n*A) : Y*A;
-    },
-    sinc(t , t0 , A = 1){
-        if(!(t instanceof Array))t=[t] 
-        const Y = mapfun(n=>sinc(n-t0),...t);
-        return Y instanceof Array ? Y.map(n=>n*A) : Y*A;
-    },
-    square(t,T=1,A=1){
-        if(!(t instanceof Array))t=[t] 
-        const Y = mapfun(n=>sign(sin(n*2*Math.PI/T)),...t);
-        return Y instanceof Array ? Y.map(n=>n*A) : Y*A;
-    },
-    sawtooth(){
-
-    },
-    conv,
-    conv1d,
-    conv2d,
-    circularConv,
-    linearConv,
-    circularConv1d,
-    linearConv1d,
-    circularConv2d,
-    linearConv2d,
-    fft,
-    ifft,
-    filter,
-}
+import { mapfun } from "../utils/index.js";
+import { abs , sinc , sign , sin } from "../functions/index.js"
+import { Random } from "../random/index.js";
+import { 
+    zeros,
+    ones,
+    nums,
+    arange,
+    linspace,
+    logspace,
+    geomspace,
+    map,
+    norm,
+    lerp,
+    clamp,
+} from "./functions.js";
+import{
+    fft,
+    ifft
+} from "./fft.js"
+import { 
+    conv,
+    conv1d, 
+    conv2d,
+    circularConv,
+    linearConv,
+    circularConv1d,
+    linearConv1d,
+    circularConv2d,
+    linearConv2d
+} from "./conv.js";
+import { 
+    filter
+ } from "./filter.js";
+//import { Matrix } from "../Matrix/index.js";
+const Signal={
+    zeros,
+    ones,
+    nums,
+    arange,
+    linspace,
+    logspace,
+    geomspace,
+    map,
+    norm,
+    lerp,
+    clamp,
+    noise(n,min = 0,max = 1){
+        return Random.floats(n,min,max);
+    },
+    echelon(t,t0 = 0 , A = 1){
+        if(!(t instanceof Array))t=[t];
+        const Y = mapfun(n=>n>=t0?1:0,...t);
+        return Y instanceof Array ? Y.map(n=>n*A) : Y*A
+    },
+    rampe(t,t0 = 0 , A = 1){
+        if(!(t instanceof Array))t=[t]
+        const Y = mapfun(n=>n>=t0?n-t0:0,...t);
+        return Y instanceof Array ? Y.map(n=>n*A) : Y*A
+    },
+    sign(t,t0 = 0 , A = 1){
+        if(!(t instanceof Array))t=[t]
+        const Y = mapfun(n=>Math.sign(n-t0),...t);
+        return Y instanceof Array ? Y.map(n=>n*A) : Y*A
+    },
+    rect(t,T,t0 = 0, A = 1){
+        if(!(t instanceof Array))t=[t];
+        const Y = mapfun(n=>((t0-T/2 < n) && (t0+T/2 > n)? 1 - 2 * abs(n/T) : 0),...t)
+        return Y instanceof Array ? Y.map(n=>n*A) : Y*A
+    },
+    tri(t,T,t0 = 0 , A = 1){
+        if(!(t instanceof Array))t=[t] 
+        const Y = mapfun(n=>((t0-T/2 < n) && (t0+T/2 > n)? 1 - 2 * abs(n/T) : 0),...t)
+        return Y instanceof Array ? Y.map(n=>n*A) : Y*A;
+    },
+    dirac(t,t0){
+        return mapfun(n=>n===t0?Infinity:0,...t);
+    },
+    lorentz(t , t0 = 0 , A = 1){
+        if(!(t instanceof Array))t=[t] 
+        const Y = mapfun(n => 1/(1+(n-t0)**2),...t);
+        return Y instanceof Array ? Y.map(n=>n*A) : Y*A;
+    },
+    sinc(t , t0 , A = 1){
+        if(!(t instanceof Array))t=[t] 
+        const Y = mapfun(n=>sinc(n-t0),...t);
+        return Y instanceof Array ? Y.map(n=>n*A) : Y*A;
+    },
+    square(t,T=1,A=1){
+        if(!(t instanceof Array))t=[t] 
+        const Y = mapfun(n=>sign(sin(n*2*Math.PI/T)),...t);
+        return Y instanceof Array ? Y.map(n=>n*A) : Y*A;
+    },
+    sawtooth(){
+
+    },
+    conv,
+    conv1d,
+    conv2d,
+    circularConv,
+    linearConv,
+    circularConv1d,
+    linearConv1d,
+    circularConv2d,
+    linearConv2d,
+    fft,
+    ifft,
+    filter,
+}
 export{Signal}