starlight-numera 1.0.0

package/README.md

@@ -0,0 +1,150 @@
+# starlight-numera
+
+A fast, lightweight numerical computing library for JavaScript inspired by NumPy.
+
+Built for performance using TypedArrays and optimized loops.
+
+---
+
+## Features
+
+- Fast ndarray implementation (TypedArray-based)
+- Vectorized operations (add, sub, mul, div)
+- Matrix operations (matmul, transpose, dot)
+- Broadcasting (NumPy-style)
+- Math functions (sqrt, exp, log, trig)
+- Modular and tree-shakeable
+
+---
+
+## Installation
+
+```bash
+npm install starlight-numera
+````
+
+---
+
+## Quick Start
+
+```js
+import { array, add, matmul, sqrt } from 'starlight-numera';
+
+// Create arrays
+const a = array([[1, 2], [3, 4]]);
+const b = array([[5, 6], [7, 8]]);
+
+// Element-wise operations
+const c = add(a, b);
+
+// Matrix multiplication
+const d = matmul(a, b);
+
+// Math functions
+const e = sqrt(a);
+
+console.log(c);
+console.log(d);
+console.log(e);
+```
+
+---
+
+## ndarray Structure
+
+Each array is stored as:
+
+```js
+{
+  data: Float32Array,
+  shape: number[],
+  stride: number[],
+  size: number
+}
+```
+
+---
+
+## Operations
+
+### Element-wise
+
+```js
+add(a, b)
+sub(a, b)
+mul(a, b)
+div(a, b)
+```
+
+### Broadcasting
+
+```js
+const a = array([[1, 2, 3]]);
+const b = array([[10], [20]]);
+
+add(a, b);
+// [
+//  [11,12,13],
+//  [21,22,23]
+// ]
+```
+
+---
+
+## Linear Algebra
+
+```js
+transpose(a)
+dot(a, b)
+matmul(a, b)
+```
+
+---
+
+## Math Functions
+
+```js
+sqrt(a)
+exp(a)
+log(a)
+
+sin(a)
+cos(a)
+tan(a)
+```
+
+---
+
+## Performance
+
+* Uses Float32Array for fast memory access
+* Avoids unnecessary allocations
+* Optimized loops for numerical operations
+
+---
+
+## Roadmap
+
+* Advanced broadcasting optimizations
+* Slicing and indexing
+* GPU acceleration (WebGL / WebGPU)
+* SIMD optimizations
+* Higher-dimensional tensors
+
+---
+
+## Contributing
+
+Contributions are welcome.
+
+1. Fork the repository
+2. Create a feature branch
+3. Submit a pull request
+
+---
+
+## License
+
+MIT License
+
+ 

package/dist/index.cjs

@@ -0,0 +1,518 @@
+'use strict';
+
+/**
+ * Core ndarray structure
+ * Stores:
+ *  - data (TypedArray)
+ *  - shape
+ *  - stride (for indexing)
+ */
+
+function computeStride$1(shape) {
+  const stride = new Array(shape.length);
+  let acc = 1;
+
+  for (let i = shape.length - 1; i >= 0; i--) {
+    stride[i] = acc;
+    acc *= shape[i];
+  }
+
+  return stride;
+}
+
+function ndarray(data, shape) {
+  if (!(data instanceof Float32Array)) {
+    throw new TypeError('Data must be Float32Array');
+  }
+
+  if (!Array.isArray(shape)) {
+    throw new TypeError('Shape must be an array');
+  }
+
+  const size = shape.reduce((a, b) => a * b, 1);
+
+  if (size !== data.length) {
+    throw new Error('Data size does not match shape');
+  }
+
+  return {
+    data,
+    shape,
+    stride: computeStride$1(shape),
+    size
+  };
+}
+
+/**
+ * Check if a value is a TypedArray
+ * Covers all standard JS typed arrays.
+ */
+
+function isTypedArray(value) {
+  return (
+    value != null &&
+    typeof value === 'object' &&
+    ArrayBuffer.isView(value) &&
+    !(value instanceof DataView)
+  );
+}
+
+/**
+ * Flatten nested arrays into a flat TypedArray
+ * Also returns the inferred shape.
+ *
+ * Example:
+ *   flatten([[1,2],[3,4]])
+ *   → { data: Float32Array([1,2,3,4]), shape: [2,2] }
+ */
+
+
+function flatten(input) {
+  const shape = [];
+  const flat = [];
+
+  function recurse(arr, depth) {
+    if (Array.isArray(arr)) {
+      if (shape.length <= depth) {
+        shape.push(arr.length);
+      } else if (shape[depth] !== arr.length) {
+        throw new Error('Inconsistent array shape');
+      }
+
+      for (let i = 0; i < arr.length; i++) {
+        recurse(arr[i], depth + 1);
+      }
+    } else if (isTypedArray(arr)) {
+      // Treat typed arrays as leaf nodes
+      for (let i = 0; i < arr.length; i++) {
+        flat.push(arr[i]);
+      }
+    } else if (typeof arr === 'number') {
+      flat.push(arr);
+    } else {
+      throw new TypeError('Unsupported data type in array');
+    }
+  }
+
+  recurse(input, 0);
+
+  return {
+    data: new Float32Array(flat),
+    shape
+  };
+}
+
+/**
+ * Shape utilities
+ */
+
+function getSize(shape) {
+  return shape.reduce((a, b) => a * b, 1);
+}
+
+function validateShape(shape) {
+  if (!Array.isArray(shape)) {
+    throw new TypeError('Shape must be an array');
+  }
+
+  for (let i = 0; i < shape.length; i++) {
+    const dim = shape[i];
+
+    if (!Number.isInteger(dim) || dim <= 0) {
+      throw new Error('Shape must contain positive integers');
+    }
+  }
+
+  return true;
+}
+
+function areShapesEqual(a, b) {
+  if (a.length !== b.length) return false;
+
+  for (let i = 0; i < a.length; i++) {
+    if (a[i] !== b[i]) return false;
+  }
+
+  return true;
+}
+
+/**
+ * Array creation functions
+ */
+
+
+/**
+ * Create ndarray from nested array
+ */
+function array(input) {
+  const { data, shape } = flatten(input);
+  return ndarray(data, shape);
+}
+
+/**
+ * Create array filled with zeros
+ */
+function zeros(shape) {
+  validateShape(shape);
+
+  const size = getSize(shape);
+  const data = new Float32Array(size); // auto zero-filled
+
+  return ndarray(data, shape);
+}
+
+/**
+ * Create array filled with ones
+ */
+function ones(shape) {
+  validateShape(shape);
+
+  const size = getSize(shape);
+  const data = new Float32Array(size);
+
+  for (let i = 0; i < size; i++) {
+    data[i] = 1;
+  }
+
+  return ndarray(data, shape);
+}
+
+/**
+ * Reshape ndarray without changing data
+ */
+
+
+function reshape(arr, newShape) {
+  validateShape(newShape);
+
+  const newSize = getSize(newShape);
+
+  if (newSize !== arr.size) {
+    throw new Error('Total size must remain the same in reshape');
+  }
+
+  // reuse same data buffer (fast)
+  return ndarray(arr.data, newShape);
+}
+
+/**
+ * Broadcasting rules (NumPy-style)
+ *
+ * Align shapes from right to left:
+ * - Dimensions must be equal OR one must be 1
+ */
+
+function broadcastShapes(shapeA, shapeB) {
+  const result = [];
+
+  const len = Math.max(shapeA.length, shapeB.length);
+
+  for (let i = 0; i < len; i++) {
+    const a = shapeA[shapeA.length - 1 - i] ?? 1;
+    const b = shapeB[shapeB.length - 1 - i] ?? 1;
+
+    if (a === b || a === 1 || b === 1) {
+      result.unshift(Math.max(a, b));
+    } else {
+      throw new Error(
+        `Cannot broadcast shapes ${shapeA} and ${shapeB}`
+      );
+    }
+  }
+
+  return result;
+}
+
+/**
+ * Broadcasting execution helpers
+ */
+
+
+/**
+ * Compute stride for shape
+ */
+function computeStride(shape) {
+  const stride = new Array(shape.length);
+  let acc = 1;
+
+  for (let i = shape.length - 1; i >= 0; i--) {
+    stride[i] = acc;
+    acc *= shape[i];
+  }
+
+  return stride;
+}
+
+/**
+ * Convert flat index → multi-dimensional index
+ */
+function unravelIndex(index, shape) {
+  const idx = new Array(shape.length);
+
+  for (let i = 0; i < shape.length; i++) {
+    const stride = shape.slice(i + 1).reduce((a, b) => a * b, 1);
+    idx[i] = Math.floor(index / stride) % shape[i];
+  }
+
+  return idx;
+}
+
+/**
+ * Apply broadcasting for two ndarrays
+ */
+function broadcastBinaryOp(a, b, fn) {
+  const outShape = broadcastShapes(a.shape, b.shape);
+  const outSize = outShape.reduce((x, y) => x * y, 1);
+
+  const out = new Float32Array(outSize);
+
+  const strideA = computeStride(a.shape);
+  const strideB = computeStride(b.shape);
+
+  const offsetA = outShape.length - a.shape.length;
+  const offsetB = outShape.length - b.shape.length;
+
+  for (let i = 0; i < outSize; i++) {
+    const idx = unravelIndex(i, outShape);
+
+    let indexA = 0;
+    let indexB = 0;
+
+    for (let d = 0; d < outShape.length; d++) {
+      const aDim = a.shape[d - offsetA] ?? 1;
+      const bDim = b.shape[d - offsetB] ?? 1;
+
+      const iA = aDim === 1 ? 0 : idx[d];
+      const iB = bDim === 1 ? 0 : idx[d];
+
+      if (d - offsetA >= 0) {
+        indexA += iA * strideA[d - offsetA];
+      }
+
+      if (d - offsetB >= 0) {
+        indexB += iB * strideB[d - offsetB];
+      }
+    }
+
+    out[i] = fn(a.data[indexA], b.data[indexB]);
+  }
+
+  return ndarray(out, outShape);
+}
+
+/**
+ * Core element-wise operation engine
+ * Supports:
+ *  - ndarray + ndarray (with broadcasting)
+ *  - ndarray + scalar
+ *  - scalar + ndarray
+ */
+
+
+function map(a, b, fn) {
+  const isAScalar = typeof a === 'number';
+  const isBScalar = typeof b === 'number';
+
+  // Case 1: scalar + scalar
+  if (isAScalar && isBScalar) {
+    return fn(a, b);
+  }
+
+  // Case 2: ndarray + scalar
+  if (!isAScalar && isBScalar) {
+    const out = new Float32Array(a.size);
+
+    for (let i = 0; i < a.size; i++) {
+      out[i] = fn(a.data[i], b);
+    }
+
+    return ndarray(out, a.shape);
+  }
+
+  // Case 3: scalar + ndarray
+  if (isAScalar && !isBScalar) {
+    const out = new Float32Array(b.size);
+
+    for (let i = 0; i < b.size; i++) {
+      out[i] = fn(a, b.data[i]);
+    }
+
+    return ndarray(out, b.shape);
+  }
+
+  // Case 4: ndarray + ndarray (with broadcasting)
+  return broadcastBinaryOp(a, b, fn);
+}
+
+function add(a, b) {
+  return map(a, b, (x, y) => x + y);
+}
+
+function sub(a, b) {
+  return map(a, b, (x, y) => x - y);
+}
+
+function mul(a, b) {
+  return map(a, b, (x, y) => x * y);
+}
+
+function div(a, b) {
+  return map(a, b, (x, y) => x / y);
+}
+
+/**
+ * Element-wise square root
+ */
+function sqrt(a) {
+  return map(a, 0, (x) => Math.sqrt(x));
+}
+
+/**
+ * Element-wise exponential (e^x)
+ */
+function exp(a) {
+  return map(a, 0, (x) => Math.exp(x));
+}
+
+/**
+ * Element-wise natural logarithm (ln)
+ */
+function log(a) {
+  return map(a, 0, (x) => Math.log(x));
+}
+
+/**
+ * Trigonometric functions (element-wise)
+ */
+
+function sin(a) {
+  return map(a, 0, (x) => Math.sin(x));
+}
+
+function cos(a) {
+  return map(a, 0, (x) => Math.cos(x));
+}
+
+function tan(a) {
+  return map(a, 0, (x) => Math.tan(x));
+}
+
+function asin(a) {
+  return map(a, 0, (x) => Math.asin(x));
+}
+
+function acos(a) {
+  return map(a, 0, (x) => Math.acos(x));
+}
+
+function atan(a) {
+  return map(a, 0, (x) => Math.atan(x));
+}
+
+/**
+ * Transpose a 2D ndarray
+ */
+
+
+function transpose(a) {
+  if (a.shape.length !== 2) {
+    throw new Error('Transpose currently supports only 2D arrays');
+  }
+
+  const [rows, cols] = a.shape;
+
+  const out = new Float32Array(a.size);
+
+  for (let i = 0; i < rows; i++) {
+    for (let j = 0; j < cols; j++) {
+      out[j * rows + i] = a.data[i * cols + j];
+    }
+  }
+
+  return ndarray(out, [cols, rows]);
+}
+
+/**
+ * Dot product (1D vectors) or matrix multiplication (2D simplified)
+ */
+
+
+function dot(a, b) {
+  // Vector dot product
+  if (a.shape.length === 1 && b.shape.length === 1) {
+    if (a.size !== b.size) {
+      throw new Error('Vectors must have same length');
+    }
+
+    let sum = 0;
+
+    for (let i = 0; i < a.size; i++) {
+      sum += a.data[i] * b.data[i];
+    }
+
+    return sum;
+  }
+
+  throw new Error('dot currently supports only 1D vectors');
+}
+
+/**
+ * Matrix multiplication (2D only)
+ */
+
+
+function matmul(a, b) {
+  if (a.shape.length !== 2 || b.shape.length !== 2) {
+    throw new Error('matmul supports only 2D matrices');
+  }
+
+  const [m, n] = a.shape;
+  const [n2, p] = b.shape;
+
+  if (n !== n2) {
+    throw new Error('Inner dimensions must match for matmul');
+  }
+
+  const out = new Float32Array(m * p);
+
+  for (let i = 0; i < m; i++) {
+    for (let j = 0; j < p; j++) {
+      let sum = 0;
+
+      for (let k = 0; k < n; k++) {
+        sum += a.data[i * n + k] * b.data[k * p + j];
+      }
+
+      out[i * p + j] = sum;
+    }
+  }
+
+  return ndarray(out, [m, p]);
+}
+
+exports.acos = acos;
+exports.add = add;
+exports.areShapesEqual = areShapesEqual;
+exports.array = array;
+exports.asin = asin;
+exports.atan = atan;
+exports.cos = cos;
+exports.div = div;
+exports.dot = dot;
+exports.exp = exp;
+exports.getSize = getSize;
+exports.log = log;
+exports.map = map;
+exports.matmul = matmul;
+exports.mul = mul;
+exports.ndarray = ndarray;
+exports.ones = ones;
+exports.reshape = reshape;
+exports.sin = sin;
+exports.sqrt = sqrt;
+exports.sub = sub;
+exports.tan = tan;
+exports.transpose = transpose;
+exports.validateShape = validateShape;
+exports.zeros = zeros;
+//# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","sources":["../src/ndarray/ndarray.js","../src/utils/isTypedArray.js","../src/utils/flatten.js","../src/ndarray/shape.js","../src/ndarray/create.js","../src/ndarray/reshape.js","../src/broadcast/rules.js","../src/broadcast/broadcast.js","../src/ops/map.js","../src/ops/add.js","../src/ops/sub.js","../src/ops/mul.js","../src/ops/div.js","../src/math/sqrt.js","../src/math/exp.js","../src/math/log.js","../src/math/trig.js","../src/linalg/transpose.js","../src/linalg/dot.js","../src/linalg/matmul.js"],"sourcesContent":["/**\r\n * Core ndarray structure\r\n * Stores:\r\n *  - data (TypedArray)\r\n *  - shape\r\n *  - stride (for indexing)\r\n */\r\n\r\nfunction computeStride(shape) {\r\n  const stride = new Array(shape.length);\r\n  let acc = 1;\r\n\r\n  for (let i = shape.length - 1; i >= 0; i--) {\r\n    stride[i] = acc;\r\n    acc *= shape[i];\r\n  }\r\n\r\n  return stride;\r\n}\r\n\r\nexport function ndarray(data, shape) {\r\n  if (!(data instanceof Float32Array)) {\r\n    throw new TypeError('Data must be Float32Array');\r\n  }\r\n\r\n  if (!Array.isArray(shape)) {\r\n    throw new TypeError('Shape must be an array');\r\n  }\r\n\r\n  const size = shape.reduce((a, b) => a * b, 1);\r\n\r\n  if (size !== data.length) {\r\n    throw new Error('Data size does not match shape');\r\n  }\r\n\r\n  return {\r\n    data,\r\n    shape,\r\n    stride: computeStride(shape),\r\n    size\r\n  };\r\n}","/**\r\n * Check if a value is a TypedArray\r\n * Covers all standard JS typed arrays.\r\n */\r\n\r\nexport function isTypedArray(value) {\r\n  return (\r\n    value != null &&\r\n    typeof value === 'object' &&\r\n    ArrayBuffer.isView(value) &&\r\n    !(value instanceof DataView)\r\n  );\r\n}","/**\r\n * Flatten nested arrays into a flat TypedArray\r\n * Also returns the inferred shape.\r\n *\r\n * Example:\r\n *   flatten([[1,2],[3,4]])\r\n *   → { data: Float32Array([1,2,3,4]), shape: [2,2] }\r\n */\r\n\r\nimport { isTypedArray } from './isTypedArray.js';\r\n\r\nexport function flatten(input) {\r\n  const shape = [];\r\n  const flat = [];\r\n\r\n  function recurse(arr, depth) {\r\n    if (Array.isArray(arr)) {\r\n      if (shape.length <= depth) {\r\n        shape.push(arr.length);\r\n      } else if (shape[depth] !== arr.length) {\r\n        throw new Error('Inconsistent array shape');\r\n      }\r\n\r\n      for (let i = 0; i < arr.length; i++) {\r\n        recurse(arr[i], depth + 1);\r\n      }\r\n    } else if (isTypedArray(arr)) {\r\n      // Treat typed arrays as leaf nodes\r\n      for (let i = 0; i < arr.length; i++) {\r\n        flat.push(arr[i]);\r\n      }\r\n    } else if (typeof arr === 'number') {\r\n      flat.push(arr);\r\n    } else {\r\n      throw new TypeError('Unsupported data type in array');\r\n    }\r\n  }\r\n\r\n  recurse(input, 0);\r\n\r\n  return {\r\n    data: new Float32Array(flat),\r\n    shape\r\n  };\r\n}","/**\r\n * Shape utilities\r\n */\r\n\r\nexport function getSize(shape) {\r\n  return shape.reduce((a, b) => a * b, 1);\r\n}\r\n\r\nexport function validateShape(shape) {\r\n  if (!Array.isArray(shape)) {\r\n    throw new TypeError('Shape must be an array');\r\n  }\r\n\r\n  for (let i = 0; i < shape.length; i++) {\r\n    const dim = shape[i];\r\n\r\n    if (!Number.isInteger(dim) || dim <= 0) {\r\n      throw new Error('Shape must contain positive integers');\r\n    }\r\n  }\r\n\r\n  return true;\r\n}\r\n\r\nexport function areShapesEqual(a, b) {\r\n  if (a.length !== b.length) return false;\r\n\r\n  for (let i = 0; i < a.length; i++) {\r\n    if (a[i] !== b[i]) return false;\r\n  }\r\n\r\n  return true;\r\n}","/**\r\n * Array creation functions\r\n */\r\n\r\nimport { ndarray } from './ndarray.js';\r\nimport { flatten } from '../utils/flatten.js';\r\nimport { getSize, validateShape } from './shape.js';\r\n\r\n/**\r\n * Create ndarray from nested array\r\n */\r\nexport function array(input) {\r\n  const { data, shape } = flatten(input);\r\n  return ndarray(data, shape);\r\n}\r\n\r\n/**\r\n * Create array filled with zeros\r\n */\r\nexport function zeros(shape) {\r\n  validateShape(shape);\r\n\r\n  const size = getSize(shape);\r\n  const data = new Float32Array(size); // auto zero-filled\r\n\r\n  return ndarray(data, shape);\r\n}\r\n\r\n/**\r\n * Create array filled with ones\r\n */\r\nexport function ones(shape) {\r\n  validateShape(shape);\r\n\r\n  const size = getSize(shape);\r\n  const data = new Float32Array(size);\r\n\r\n  for (let i = 0; i < size; i++) {\r\n    data[i] = 1;\r\n  }\r\n\r\n  return ndarray(data, shape);\r\n}","/**\r\n * Reshape ndarray without changing data\r\n */\r\n\r\nimport { ndarray } from './ndarray.js';\r\nimport { getSize, validateShape } from './shape.js';\r\n\r\nexport function reshape(arr, newShape) {\r\n  validateShape(newShape);\r\n\r\n  const newSize = getSize(newShape);\r\n\r\n  if (newSize !== arr.size) {\r\n    throw new Error('Total size must remain the same in reshape');\r\n  }\r\n\r\n  // reuse same data buffer (fast)\r\n  return ndarray(arr.data, newShape);\r\n}","/**\r\n * Broadcasting rules (NumPy-style)\r\n *\r\n * Align shapes from right to left:\r\n * - Dimensions must be equal OR one must be 1\r\n */\r\n\r\nexport function broadcastShapes(shapeA, shapeB) {\r\n  const result = [];\r\n\r\n  const len = Math.max(shapeA.length, shapeB.length);\r\n\r\n  for (let i = 0; i < len; i++) {\r\n    const a = shapeA[shapeA.length - 1 - i] ?? 1;\r\n    const b = shapeB[shapeB.length - 1 - i] ?? 1;\r\n\r\n    if (a === b || a === 1 || b === 1) {\r\n      result.unshift(Math.max(a, b));\r\n    } else {\r\n      throw new Error(\r\n        `Cannot broadcast shapes ${shapeA} and ${shapeB}`\r\n      );\r\n    }\r\n  }\r\n\r\n  return result;\r\n}","/**\r\n * Broadcasting execution helpers\r\n */\r\n\r\nimport { broadcastShapes } from './rules.js';\r\nimport { ndarray } from '../ndarray/ndarray.js';\r\n\r\n/**\r\n * Compute stride for shape\r\n */\r\nfunction computeStride(shape) {\r\n  const stride = new Array(shape.length);\r\n  let acc = 1;\r\n\r\n  for (let i = shape.length - 1; i >= 0; i--) {\r\n    stride[i] = acc;\r\n    acc *= shape[i];\r\n  }\r\n\r\n  return stride;\r\n}\r\n\r\n/**\r\n * Convert flat index → multi-dimensional index\r\n */\r\nfunction unravelIndex(index, shape) {\r\n  const idx = new Array(shape.length);\r\n\r\n  for (let i = 0; i < shape.length; i++) {\r\n    const stride = shape.slice(i + 1).reduce((a, b) => a * b, 1);\r\n    idx[i] = Math.floor(index / stride) % shape[i];\r\n  }\r\n\r\n  return idx;\r\n}\r\n\r\n/**\r\n * Convert multi-index → flat index\r\n */\r\nfunction ravelIndex(idx, stride) {\r\n  let index = 0;\r\n  for (let i = 0; i < idx.length; i++) {\r\n    index += idx[i] * stride[i];\r\n  }\r\n  return index;\r\n}\r\n\r\n/**\r\n * Apply broadcasting for two ndarrays\r\n */\r\nexport function broadcastBinaryOp(a, b, fn) {\r\n  const outShape = broadcastShapes(a.shape, b.shape);\r\n  const outSize = outShape.reduce((x, y) => x * y, 1);\r\n\r\n  const out = new Float32Array(outSize);\r\n\r\n  const strideA = computeStride(a.shape);\r\n  const strideB = computeStride(b.shape);\r\n\r\n  const offsetA = outShape.length - a.shape.length;\r\n  const offsetB = outShape.length - b.shape.length;\r\n\r\n  for (let i = 0; i < outSize; i++) {\r\n    const idx = unravelIndex(i, outShape);\r\n\r\n    let indexA = 0;\r\n    let indexB = 0;\r\n\r\n    for (let d = 0; d < outShape.length; d++) {\r\n      const aDim = a.shape[d - offsetA] ?? 1;\r\n      const bDim = b.shape[d - offsetB] ?? 1;\r\n\r\n      const iA = aDim === 1 ? 0 : idx[d];\r\n      const iB = bDim === 1 ? 0 : idx[d];\r\n\r\n      if (d - offsetA >= 0) {\r\n        indexA += iA * strideA[d - offsetA];\r\n      }\r\n\r\n      if (d - offsetB >= 0) {\r\n        indexB += iB * strideB[d - offsetB];\r\n      }\r\n    }\r\n\r\n    out[i] = fn(a.data[indexA], b.data[indexB]);\r\n  }\r\n\r\n  return ndarray(out, outShape);\r\n}","/**\r\n * Core element-wise operation engine\r\n * Supports:\r\n *  - ndarray + ndarray (with broadcasting)\r\n *  - ndarray + scalar\r\n *  - scalar + ndarray\r\n */\r\n\r\nimport { ndarray } from '../ndarray/ndarray.js';\r\nimport { broadcastBinaryOp } from '../broadcast/broadcast.js';\r\n\r\nexport function map(a, b, fn) {\r\n  const isAScalar = typeof a === 'number';\r\n  const isBScalar = typeof b === 'number';\r\n\r\n  // Case 1: scalar + scalar\r\n  if (isAScalar && isBScalar) {\r\n    return fn(a, b);\r\n  }\r\n\r\n  // Case 2: ndarray + scalar\r\n  if (!isAScalar && isBScalar) {\r\n    const out = new Float32Array(a.size);\r\n\r\n    for (let i = 0; i < a.size; i++) {\r\n      out[i] = fn(a.data[i], b);\r\n    }\r\n\r\n    return ndarray(out, a.shape);\r\n  }\r\n\r\n  // Case 3: scalar + ndarray\r\n  if (isAScalar && !isBScalar) {\r\n    const out = new Float32Array(b.size);\r\n\r\n    for (let i = 0; i < b.size; i++) {\r\n      out[i] = fn(a, b.data[i]);\r\n    }\r\n\r\n    return ndarray(out, b.shape);\r\n  }\r\n\r\n  // Case 4: ndarray + ndarray (with broadcasting)\r\n  return broadcastBinaryOp(a, b, fn);\r\n}","import { map } from './map.js';\r\n\r\nexport function add(a, b) {\r\n  return map(a, b, (x, y) => x + y);\r\n}","import { map } from './map.js';\r\n\r\nexport function sub(a, b) {\r\n  return map(a, b, (x, y) => x - y);\r\n}","import { map } from './map.js';\r\n\r\nexport function mul(a, b) {\r\n  return map(a, b, (x, y) => x * y);\r\n}","import { map } from './map.js';\r\n\r\nexport function div(a, b) {\r\n  return map(a, b, (x, y) => x / y);\r\n}","import { map } from '../ops/map.js';\r\n\r\n/**\r\n * Element-wise square root\r\n */\r\nexport function sqrt(a) {\r\n  return map(a, 0, (x) => Math.sqrt(x));\r\n}","import { map } from '../ops/map.js';\r\n\r\n/**\r\n * Element-wise exponential (e^x)\r\n */\r\nexport function exp(a) {\r\n  return map(a, 0, (x) => Math.exp(x));\r\n}","import { map } from '../ops/map.js';\r\n\r\n/**\r\n * Element-wise natural logarithm (ln)\r\n */\r\nexport function log(a) {\r\n  return map(a, 0, (x) => Math.log(x));\r\n}","import { map } from '../ops/map.js';\r\n\r\n/**\r\n * Trigonometric functions (element-wise)\r\n */\r\n\r\nexport function sin(a) {\r\n  return map(a, 0, (x) => Math.sin(x));\r\n}\r\n\r\nexport function cos(a) {\r\n  return map(a, 0, (x) => Math.cos(x));\r\n}\r\n\r\nexport function tan(a) {\r\n  return map(a, 0, (x) => Math.tan(x));\r\n}\r\n\r\nexport function asin(a) {\r\n  return map(a, 0, (x) => Math.asin(x));\r\n}\r\n\r\nexport function acos(a) {\r\n  return map(a, 0, (x) => Math.acos(x));\r\n}\r\n\r\nexport function atan(a) {\r\n  return map(a, 0, (x) => Math.atan(x));\r\n}","/**\r\n * Transpose a 2D ndarray\r\n */\r\n\r\nimport { ndarray } from '../ndarray/ndarray.js';\r\n\r\nexport function transpose(a) {\r\n  if (a.shape.length !== 2) {\r\n    throw new Error('Transpose currently supports only 2D arrays');\r\n  }\r\n\r\n  const [rows, cols] = a.shape;\r\n\r\n  const out = new Float32Array(a.size);\r\n\r\n  for (let i = 0; i < rows; i++) {\r\n    for (let j = 0; j < cols; j++) {\r\n      out[j * rows + i] = a.data[i * cols + j];\r\n    }\r\n  }\r\n\r\n  return ndarray(out, [cols, rows]);\r\n}","/**\r\n * Dot product (1D vectors) or matrix multiplication (2D simplified)\r\n */\r\n\r\nimport { ndarray } from '../ndarray/ndarray.js';\r\n\r\nexport function dot(a, b) {\r\n  // Vector dot product\r\n  if (a.shape.length === 1 && b.shape.length === 1) {\r\n    if (a.size !== b.size) {\r\n      throw new Error('Vectors must have same length');\r\n    }\r\n\r\n    let sum = 0;\r\n\r\n    for (let i = 0; i < a.size; i++) {\r\n      sum += a.data[i] * b.data[i];\r\n    }\r\n\r\n    return sum;\r\n  }\r\n\r\n  throw new Error('dot currently supports only 1D vectors');\r\n}","/**\r\n * Matrix multiplication (2D only)\r\n */\r\n\r\nimport { ndarray } from '../ndarray/ndarray.js';\r\n\r\nexport function matmul(a, b) {\r\n  if (a.shape.length !== 2 || b.shape.length !== 2) {\r\n    throw new Error('matmul supports only 2D matrices');\r\n  }\r\n\r\n  const [m, n] = a.shape;\r\n  const [n2, p] = b.shape;\r\n\r\n  if (n !== n2) {\r\n    throw new Error('Inner dimensions must match for matmul');\r\n  }\r\n\r\n  const out = new Float32Array(m * p);\r\n\r\n  for (let i = 0; i < m; i++) {\r\n    for (let j = 0; j < p; j++) {\r\n      let sum = 0;\r\n\r\n      for (let k = 0; k < n; k++) {\r\n        sum += a.data[i * n + k] * b.data[k * p + j];\r\n      }\r\n\r\n      out[i * p + j] = sum;\r\n    }\r\n  }\r\n\r\n  return ndarray(out, [m, p]);\r\n}"],"names":["computeStride"],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASA,eAAa,CAAC,KAAK,EAAE;AAC9B,EAAE,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AACzC,EAAE,IAAI,GAAG,GAAG,CAAC,CAAC;AACd;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAC9C,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;AACpB,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;AACpB,EAAE,CAAC;AACH;AACA,EAAE,OAAO,MAAM,CAAC;AAChB,CAAC;AACD;AACO,SAAS,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE;AACrC,EAAE,IAAI,EAAE,IAAI,YAAY,YAAY,CAAC,EAAE;AACvC,IAAI,MAAM,IAAI,SAAS,CAAC,2BAA2B,CAAC,CAAC;AACrD,EAAE,CAAC;AACH;AACA,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;AAC7B,IAAI,MAAM,IAAI,SAAS,CAAC,wBAAwB,CAAC,CAAC;AAClD,EAAE,CAAC;AACH;AACA,EAAE,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AAChD;AACA,EAAE,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE;AAC5B,IAAI,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;AACtD,EAAE,CAAC;AACH;AACA,EAAE,OAAO;AACT,IAAI,IAAI;AACR,IAAI,KAAK;AACT,IAAI,MAAM,EAAEA,eAAa,CAAC,KAAK,CAAC;AAChC,IAAI,IAAI;AACR,GAAG,CAAC;AACJ;;ACzCA;AACA;AACA;AACA;AACA;AACO,SAAS,YAAY,CAAC,KAAK,EAAE;AACpC,EAAE;AACF,IAAI,KAAK,IAAI,IAAI;AACjB,IAAI,OAAO,KAAK,KAAK,QAAQ;AAC7B,IAAI,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC;AAC7B,IAAI,EAAE,KAAK,YAAY,QAAQ,CAAC;AAChC,IAAI;AACJ;;ACZA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAEA;AACO,SAAS,OAAO,CAAC,KAAK,EAAE;AAC/B,EAAE,MAAM,KAAK,GAAG,EAAE,CAAC;AACnB,EAAE,MAAM,IAAI,GAAG,EAAE,CAAC;AAClB;AACA,EAAE,SAAS,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE;AAC/B,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;AAC5B,MAAM,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,EAAE;AACjC,QAAQ,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AAC/B,MAAM,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,MAAM,EAAE;AAC9C,QAAQ,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;AACpD,MAAM,CAAC;AACP;AACA,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC3C,QAAQ,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;AACnC,MAAM,CAAC;AACP,IAAI,CAAC,MAAM,IAAI,YAAY,CAAC,GAAG,CAAC,EAAE;AAClC;AACA,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC3C,QAAQ,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1B,MAAM,CAAC;AACP,IAAI,CAAC,MAAM,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE;AACxC,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACrB,IAAI,CAAC,MAAM;AACX,MAAM,MAAM,IAAI,SAAS,CAAC,gCAAgC,CAAC,CAAC;AAC5D,IAAI,CAAC;AACL,EAAE,CAAC;AACH;AACA,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AACpB;AACA,EAAE,OAAO;AACT,IAAI,IAAI,EAAE,IAAI,YAAY,CAAC,IAAI,CAAC;AAChC,IAAI,KAAK;AACT,GAAG,CAAC;AACJ;;AC5CA;AACA;AACA;AACA;AACO,SAAS,OAAO,CAAC,KAAK,EAAE;AAC/B,EAAE,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1C,CAAC;AACD;AACO,SAAS,aAAa,CAAC,KAAK,EAAE;AACrC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;AAC7B,IAAI,MAAM,IAAI,SAAS,CAAC,wBAAwB,CAAC,CAAC;AAClD,EAAE,CAAC;AACH;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACzC,IAAI,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;AACzB;AACA,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE;AAC5C,MAAM,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;AAC9D,IAAI,CAAC;AACL,EAAE,CAAC;AACH;AACA,EAAE,OAAO,IAAI,CAAC;AACd,CAAC;AACD;AACO,SAAS,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE;AACrC,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,OAAO,KAAK,CAAC;AAC1C;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACrC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,KAAK,CAAC;AACpC,EAAE,CAAC;AACH;AACA,EAAE,OAAO,IAAI,CAAC;AACd;;AChCA;AACA;AACA;AACA;AAIA;AACA;AACA;AACA;AACO,SAAS,KAAK,CAAC,KAAK,EAAE;AAC7B,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;AACzC,EAAE,OAAO,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAC9B,CAAC;AACD;AACA;AACA;AACA;AACO,SAAS,KAAK,CAAC,KAAK,EAAE;AAC7B,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC;AACvB;AACA,EAAE,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;AAC9B,EAAE,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;AACtC;AACA,EAAE,OAAO,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAC9B,CAAC;AACD;AACA;AACA;AACA;AACO,SAAS,IAAI,CAAC,KAAK,EAAE;AAC5B,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC;AACvB;AACA,EAAE,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;AAC9B,EAAE,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;AACtC;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;AACjC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAChB,EAAE,CAAC;AACH;AACA,EAAE,OAAO,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAC9B;;AC1CA;AACA;AACA;AACA;AAGA;AACO,SAAS,OAAO,CAAC,GAAG,EAAE,QAAQ,EAAE;AACvC,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAC;AAC1B;AACA,EAAE,MAAM,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;AACpC;AACA,EAAE,IAAI,OAAO,KAAK,GAAG,CAAC,IAAI,EAAE;AAC5B,IAAI,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;AAClE,EAAE,CAAC;AACH;AACA;AACA,EAAE,OAAO,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AACrC;;AClBA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE;AAChD,EAAE,MAAM,MAAM,GAAG,EAAE,CAAC;AACpB;AACA,EAAE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;AACrD;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;AAChC,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AACjD,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AACjD;AACA,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;AACvC,MAAM,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACrC,IAAI,CAAC,MAAM;AACX,MAAM,MAAM,IAAI,KAAK;AACrB,QAAQ,CAAC,wBAAwB,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AACzD,OAAO,CAAC;AACR,IAAI,CAAC;AACL,EAAE,CAAC;AACH;AACA,EAAE,OAAO,MAAM,CAAC;AAChB;;AC1BA;AACA;AACA;AACA;AAGA;AACA;AACA;AACA;AACA,SAAS,aAAa,CAAC,KAAK,EAAE;AAC9B,EAAE,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AACzC,EAAE,IAAI,GAAG,GAAG,CAAC,CAAC;AACd;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAC9C,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;AACpB,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;AACpB,EAAE,CAAC;AACH;AACA,EAAE,OAAO,MAAM,CAAC;AAChB,CAAC;AACD;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE;AACpC,EAAE,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AACtC;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACzC,IAAI,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AACjE,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;AACnD,EAAE,CAAC;AACH;AACA,EAAE,OAAO,GAAG,CAAC;AACb,CAAC;AAYD;AACA;AACA;AACA;AACO,SAAS,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE;AAC5C,EAAE,MAAM,QAAQ,GAAG,eAAe,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;AACrD,EAAE,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AACtD;AACA,EAAE,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC;AACxC;AACA,EAAE,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AACzC,EAAE,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AACzC;AACA,EAAE,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;AACnD,EAAE,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;AACnD;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;AACpC,IAAI,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;AAC1C;AACA,IAAI,IAAI,MAAM,GAAG,CAAC,CAAC;AACnB,IAAI,IAAI,MAAM,GAAG,CAAC,CAAC;AACnB;AACA,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC9C,MAAM,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;AAC7C,MAAM,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;AAC7C;AACA,MAAM,MAAM,EAAE,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AACzC,MAAM,MAAM,EAAE,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AACzC;AACA,MAAM,IAAI,CAAC,GAAG,OAAO,IAAI,CAAC,EAAE;AAC5B,QAAQ,MAAM,IAAI,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;AAC5C,MAAM,CAAC;AACP;AACA,MAAM,IAAI,CAAC,GAAG,OAAO,IAAI,CAAC,EAAE;AAC5B,QAAQ,MAAM,IAAI,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;AAC5C,MAAM,CAAC;AACP,IAAI,CAAC;AACL;AACA,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;AAChD,EAAE,CAAC;AACH;AACA,EAAE,OAAO,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;AAChC;;ACxFA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAGA;AACO,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE;AAC9B,EAAE,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,QAAQ,CAAC;AAC1C,EAAE,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,QAAQ,CAAC;AAC1C;AACA;AACA,EAAE,IAAI,SAAS,IAAI,SAAS,EAAE;AAC9B,IAAI,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACpB,EAAE,CAAC;AACH;AACA;AACA,EAAE,IAAI,CAAC,SAAS,IAAI,SAAS,EAAE;AAC/B,IAAI,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACzC;AACA,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;AACrC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAChC,IAAI,CAAC;AACL;AACA,IAAI,OAAO,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;AACjC,EAAE,CAAC;AACH;AACA;AACA,EAAE,IAAI,SAAS,IAAI,CAAC,SAAS,EAAE;AAC/B,IAAI,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACzC;AACA,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;AACrC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAChC,IAAI,CAAC;AACL;AACA,IAAI,OAAO,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;AACjC,EAAE,CAAC;AACH;AACA;AACA,EAAE,OAAO,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;AACrC;;AC1CO,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE;AAC1B,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;AACpC;;ACFO,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE;AAC1B,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;AACpC;;ACFO,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE;AAC1B,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;AACpC;;ACFO,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE;AAC1B,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;AACpC;;ACFA;AACA;AACA;AACO,SAAS,IAAI,CAAC,CAAC,EAAE;AACxB,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC;;ACLA;AACA;AACA;AACO,SAAS,GAAG,CAAC,CAAC,EAAE;AACvB,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACvC;;ACLA;AACA;AACA;AACO,SAAS,GAAG,CAAC,CAAC,EAAE;AACvB,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACvC;;ACLA;AACA;AACA;AACA;AACO,SAAS,GAAG,CAAC,CAAC,EAAE;AACvB,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACvC,CAAC;AACD;AACO,SAAS,GAAG,CAAC,CAAC,EAAE;AACvB,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACvC,CAAC;AACD;AACO,SAAS,GAAG,CAAC,CAAC,EAAE;AACvB,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACvC,CAAC;AACD;AACO,SAAS,IAAI,CAAC,CAAC,EAAE;AACxB,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AACD;AACO,SAAS,IAAI,CAAC,CAAC,EAAE;AACxB,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AACD;AACO,SAAS,IAAI,CAAC,CAAC,EAAE;AACxB,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC;;AC5BA;AACA;AACA;AACA;AAEA;AACO,SAAS,SAAS,CAAC,CAAC,EAAE;AAC7B,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;AAC5B,IAAI,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;AACnE,EAAE,CAAC;AACH;AACA,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;AAC/B;AACA,EAAE,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACvC;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;AACjC,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;AACnC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;AAC/C,IAAI,CAAC;AACL,EAAE,CAAC;AACH;AACA,EAAE,OAAO,OAAO,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;AACpC;;ACtBA;AACA;AACA;AACA;AAEA;AACO,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE;AAC1B;AACA,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;AACpD,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE;AAC3B,MAAM,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;AACvD,IAAI,CAAC;AACL;AACA,IAAI,IAAI,GAAG,GAAG,CAAC,CAAC;AAChB;AACA,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;AACrC,MAAM,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACnC,IAAI,CAAC;AACL;AACA,IAAI,OAAO,GAAG,CAAC;AACf,EAAE,CAAC;AACH;AACA,EAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;AAC5D;;ACvBA;AACA;AACA;AACA;AAEA;AACO,SAAS,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE;AAC7B,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;AACpD,IAAI,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;AACxD,EAAE,CAAC;AACH;AACA,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;AACzB,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;AAC1B;AACA,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE;AAChB,IAAI,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;AAC9D,EAAE,CAAC;AACH;AACA,EAAE,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACtC;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAC9B,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAChC,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC;AAClB;AACA,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAClC,QAAQ,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AACrD,MAAM,CAAC;AACP;AACA,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;AAC3B,IAAI,CAAC;AACL,EAAE,CAAC;AACH;AACA,EAAE,OAAO,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAC9B;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/index.js

@@ -0,0 +1,492 @@
+/**
+ * Core ndarray structure
+ * Stores:
+ *  - data (TypedArray)
+ *  - shape
+ *  - stride (for indexing)
+ */
+
+function computeStride$1(shape) {
+  const stride = new Array(shape.length);
+  let acc = 1;
+
+  for (let i = shape.length - 1; i >= 0; i--) {
+    stride[i] = acc;
+    acc *= shape[i];
+  }
+
+  return stride;
+}
+
+function ndarray(data, shape) {
+  if (!(data instanceof Float32Array)) {
+    throw new TypeError('Data must be Float32Array');
+  }
+
+  if (!Array.isArray(shape)) {
+    throw new TypeError('Shape must be an array');
+  }
+
+  const size = shape.reduce((a, b) => a * b, 1);
+
+  if (size !== data.length) {
+    throw new Error('Data size does not match shape');
+  }
+
+  return {
+    data,
+    shape,
+    stride: computeStride$1(shape),
+    size
+  };
+}
+
+/**
+ * Check if a value is a TypedArray
+ * Covers all standard JS typed arrays.
+ */
+
+function isTypedArray(value) {
+  return (
+    value != null &&
+    typeof value === 'object' &&
+    ArrayBuffer.isView(value) &&
+    !(value instanceof DataView)
+  );
+}
+
+/**
+ * Flatten nested arrays into a flat TypedArray
+ * Also returns the inferred shape.
+ *
+ * Example:
+ *   flatten([[1,2],[3,4]])
+ *   → { data: Float32Array([1,2,3,4]), shape: [2,2] }
+ */
+
+
+function flatten(input) {
+  const shape = [];
+  const flat = [];
+
+  function recurse(arr, depth) {
+    if (Array.isArray(arr)) {
+      if (shape.length <= depth) {
+        shape.push(arr.length);
+      } else if (shape[depth] !== arr.length) {
+        throw new Error('Inconsistent array shape');
+      }
+
+      for (let i = 0; i < arr.length; i++) {
+        recurse(arr[i], depth + 1);
+      }
+    } else if (isTypedArray(arr)) {
+      // Treat typed arrays as leaf nodes
+      for (let i = 0; i < arr.length; i++) {
+        flat.push(arr[i]);
+      }
+    } else if (typeof arr === 'number') {
+      flat.push(arr);
+    } else {
+      throw new TypeError('Unsupported data type in array');
+    }
+  }
+
+  recurse(input, 0);
+
+  return {
+    data: new Float32Array(flat),
+    shape
+  };
+}
+
+/**
+ * Shape utilities
+ */
+
+function getSize(shape) {
+  return shape.reduce((a, b) => a * b, 1);
+}
+
+function validateShape(shape) {
+  if (!Array.isArray(shape)) {
+    throw new TypeError('Shape must be an array');
+  }
+
+  for (let i = 0; i < shape.length; i++) {
+    const dim = shape[i];
+
+    if (!Number.isInteger(dim) || dim <= 0) {
+      throw new Error('Shape must contain positive integers');
+    }
+  }
+
+  return true;
+}
+
+function areShapesEqual(a, b) {
+  if (a.length !== b.length) return false;
+
+  for (let i = 0; i < a.length; i++) {
+    if (a[i] !== b[i]) return false;
+  }
+
+  return true;
+}
+
+/**
+ * Array creation functions
+ */
+
+
+/**
+ * Create ndarray from nested array
+ */
+function array(input) {
+  const { data, shape } = flatten(input);
+  return ndarray(data, shape);
+}
+
+/**
+ * Create array filled with zeros
+ */
+function zeros(shape) {
+  validateShape(shape);
+
+  const size = getSize(shape);
+  const data = new Float32Array(size); // auto zero-filled
+
+  return ndarray(data, shape);
+}
+
+/**
+ * Create array filled with ones
+ */
+function ones(shape) {
+  validateShape(shape);
+
+  const size = getSize(shape);
+  const data = new Float32Array(size);
+
+  for (let i = 0; i < size; i++) {
+    data[i] = 1;
+  }
+
+  return ndarray(data, shape);
+}
+
+/**
+ * Reshape ndarray without changing data
+ */
+
+
+function reshape(arr, newShape) {
+  validateShape(newShape);
+
+  const newSize = getSize(newShape);
+
+  if (newSize !== arr.size) {
+    throw new Error('Total size must remain the same in reshape');
+  }
+
+  // reuse same data buffer (fast)
+  return ndarray(arr.data, newShape);
+}
+
+/**
+ * Broadcasting rules (NumPy-style)
+ *
+ * Align shapes from right to left:
+ * - Dimensions must be equal OR one must be 1
+ */
+
+function broadcastShapes(shapeA, shapeB) {
+  const result = [];
+
+  const len = Math.max(shapeA.length, shapeB.length);
+
+  for (let i = 0; i < len; i++) {
+    const a = shapeA[shapeA.length - 1 - i] ?? 1;
+    const b = shapeB[shapeB.length - 1 - i] ?? 1;
+
+    if (a === b || a === 1 || b === 1) {
+      result.unshift(Math.max(a, b));
+    } else {
+      throw new Error(
+        `Cannot broadcast shapes ${shapeA} and ${shapeB}`
+      );
+    }
+  }
+
+  return result;
+}
+
+/**
+ * Broadcasting execution helpers
+ */
+
+
+/**
+ * Compute stride for shape
+ */
+function computeStride(shape) {
+  const stride = new Array(shape.length);
+  let acc = 1;
+
+  for (let i = shape.length - 1; i >= 0; i--) {
+    stride[i] = acc;
+    acc *= shape[i];
+  }
+
+  return stride;
+}
+
+/**
+ * Convert flat index → multi-dimensional index
+ */
+function unravelIndex(index, shape) {
+  const idx = new Array(shape.length);
+
+  for (let i = 0; i < shape.length; i++) {
+    const stride = shape.slice(i + 1).reduce((a, b) => a * b, 1);
+    idx[i] = Math.floor(index / stride) % shape[i];
+  }
+
+  return idx;
+}
+
+/**
+ * Apply broadcasting for two ndarrays
+ */
+function broadcastBinaryOp(a, b, fn) {
+  const outShape = broadcastShapes(a.shape, b.shape);
+  const outSize = outShape.reduce((x, y) => x * y, 1);
+
+  const out = new Float32Array(outSize);
+
+  const strideA = computeStride(a.shape);
+  const strideB = computeStride(b.shape);
+
+  const offsetA = outShape.length - a.shape.length;
+  const offsetB = outShape.length - b.shape.length;
+
+  for (let i = 0; i < outSize; i++) {
+    const idx = unravelIndex(i, outShape);
+
+    let indexA = 0;
+    let indexB = 0;
+
+    for (let d = 0; d < outShape.length; d++) {
+      const aDim = a.shape[d - offsetA] ?? 1;
+      const bDim = b.shape[d - offsetB] ?? 1;
+
+      const iA = aDim === 1 ? 0 : idx[d];
+      const iB = bDim === 1 ? 0 : idx[d];
+
+      if (d - offsetA >= 0) {
+        indexA += iA * strideA[d - offsetA];
+      }
+
+      if (d - offsetB >= 0) {
+        indexB += iB * strideB[d - offsetB];
+      }
+    }
+
+    out[i] = fn(a.data[indexA], b.data[indexB]);
+  }
+
+  return ndarray(out, outShape);
+}
+
+/**
+ * Core element-wise operation engine
+ * Supports:
+ *  - ndarray + ndarray (with broadcasting)
+ *  - ndarray + scalar
+ *  - scalar + ndarray
+ */
+
+
+function map(a, b, fn) {
+  const isAScalar = typeof a === 'number';
+  const isBScalar = typeof b === 'number';
+
+  // Case 1: scalar + scalar
+  if (isAScalar && isBScalar) {
+    return fn(a, b);
+  }
+
+  // Case 2: ndarray + scalar
+  if (!isAScalar && isBScalar) {
+    const out = new Float32Array(a.size);
+
+    for (let i = 0; i < a.size; i++) {
+      out[i] = fn(a.data[i], b);
+    }
+
+    return ndarray(out, a.shape);
+  }
+
+  // Case 3: scalar + ndarray
+  if (isAScalar && !isBScalar) {
+    const out = new Float32Array(b.size);
+
+    for (let i = 0; i < b.size; i++) {
+      out[i] = fn(a, b.data[i]);
+    }
+
+    return ndarray(out, b.shape);
+  }
+
+  // Case 4: ndarray + ndarray (with broadcasting)
+  return broadcastBinaryOp(a, b, fn);
+}
+
+function add(a, b) {
+  return map(a, b, (x, y) => x + y);
+}
+
+function sub(a, b) {
+  return map(a, b, (x, y) => x - y);
+}
+
+function mul(a, b) {
+  return map(a, b, (x, y) => x * y);
+}
+
+function div(a, b) {
+  return map(a, b, (x, y) => x / y);
+}
+
+/**
+ * Element-wise square root
+ */
+function sqrt(a) {
+  return map(a, 0, (x) => Math.sqrt(x));
+}
+
+/**
+ * Element-wise exponential (e^x)
+ */
+function exp(a) {
+  return map(a, 0, (x) => Math.exp(x));
+}
+
+/**
+ * Element-wise natural logarithm (ln)
+ */
+function log(a) {
+  return map(a, 0, (x) => Math.log(x));
+}
+
+/**
+ * Trigonometric functions (element-wise)
+ */
+
+function sin(a) {
+  return map(a, 0, (x) => Math.sin(x));
+}
+
+function cos(a) {
+  return map(a, 0, (x) => Math.cos(x));
+}
+
+function tan(a) {
+  return map(a, 0, (x) => Math.tan(x));
+}
+
+function asin(a) {
+  return map(a, 0, (x) => Math.asin(x));
+}
+
+function acos(a) {
+  return map(a, 0, (x) => Math.acos(x));
+}
+
+function atan(a) {
+  return map(a, 0, (x) => Math.atan(x));
+}
+
+/**
+ * Transpose a 2D ndarray
+ */
+
+
+function transpose(a) {
+  if (a.shape.length !== 2) {
+    throw new Error('Transpose currently supports only 2D arrays');
+  }
+
+  const [rows, cols] = a.shape;
+
+  const out = new Float32Array(a.size);
+
+  for (let i = 0; i < rows; i++) {
+    for (let j = 0; j < cols; j++) {
+      out[j * rows + i] = a.data[i * cols + j];
+    }
+  }
+
+  return ndarray(out, [cols, rows]);
+}
+
+/**
+ * Dot product (1D vectors) or matrix multiplication (2D simplified)
+ */
+
+
+function dot(a, b) {
+  // Vector dot product
+  if (a.shape.length === 1 && b.shape.length === 1) {
+    if (a.size !== b.size) {
+      throw new Error('Vectors must have same length');
+    }
+
+    let sum = 0;
+
+    for (let i = 0; i < a.size; i++) {
+      sum += a.data[i] * b.data[i];
+    }
+
+    return sum;
+  }
+
+  throw new Error('dot currently supports only 1D vectors');
+}
+
+/**
+ * Matrix multiplication (2D only)
+ */
+
+
+function matmul(a, b) {
+  if (a.shape.length !== 2 || b.shape.length !== 2) {
+    throw new Error('matmul supports only 2D matrices');
+  }
+
+  const [m, n] = a.shape;
+  const [n2, p] = b.shape;
+
+  if (n !== n2) {
+    throw new Error('Inner dimensions must match for matmul');
+  }
+
+  const out = new Float32Array(m * p);
+
+  for (let i = 0; i < m; i++) {
+    for (let j = 0; j < p; j++) {
+      let sum = 0;
+
+      for (let k = 0; k < n; k++) {
+        sum += a.data[i * n + k] * b.data[k * p + j];
+      }
+
+      out[i * p + j] = sum;
+    }
+  }
+
+  return ndarray(out, [m, p]);
+}
+
+export { acos, add, areShapesEqual, array, asin, atan, cos, div, dot, exp, getSize, log, map, matmul, mul, ndarray, ones, reshape, sin, sqrt, sub, tan, transpose, validateShape, zeros };
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../src/ndarray/ndarray.js","../src/utils/isTypedArray.js","../src/utils/flatten.js","../src/ndarray/shape.js","../src/ndarray/create.js","../src/ndarray/reshape.js","../src/broadcast/rules.js","../src/broadcast/broadcast.js","../src/ops/map.js","../src/ops/add.js","../src/ops/sub.js","../src/ops/mul.js","../src/ops/div.js","../src/math/sqrt.js","../src/math/exp.js","../src/math/log.js","../src/math/trig.js","../src/linalg/transpose.js","../src/linalg/dot.js","../src/linalg/matmul.js"],"sourcesContent":["/**\r\n * Core ndarray structure\r\n * Stores:\r\n *  - data (TypedArray)\r\n *  - shape\r\n *  - stride (for indexing)\r\n */\r\n\r\nfunction computeStride(shape) {\r\n  const stride = new Array(shape.length);\r\n  let acc = 1;\r\n\r\n  for (let i = shape.length - 1; i >= 0; i--) {\r\n    stride[i] = acc;\r\n    acc *= shape[i];\r\n  }\r\n\r\n  return stride;\r\n}\r\n\r\nexport function ndarray(data, shape) {\r\n  if (!(data instanceof Float32Array)) {\r\n    throw new TypeError('Data must be Float32Array');\r\n  }\r\n\r\n  if (!Array.isArray(shape)) {\r\n    throw new TypeError('Shape must be an array');\r\n  }\r\n\r\n  const size = shape.reduce((a, b) => a * b, 1);\r\n\r\n  if (size !== data.length) {\r\n    throw new Error('Data size does not match shape');\r\n  }\r\n\r\n  return {\r\n    data,\r\n    shape,\r\n    stride: computeStride(shape),\r\n    size\r\n  };\r\n}","/**\r\n * Check if a value is a TypedArray\r\n * Covers all standard JS typed arrays.\r\n */\r\n\r\nexport function isTypedArray(value) {\r\n  return (\r\n    value != null &&\r\n    typeof value === 'object' &&\r\n    ArrayBuffer.isView(value) &&\r\n    !(value instanceof DataView)\r\n  );\r\n}","/**\r\n * Flatten nested arrays into a flat TypedArray\r\n * Also returns the inferred shape.\r\n *\r\n * Example:\r\n *   flatten([[1,2],[3,4]])\r\n *   → { data: Float32Array([1,2,3,4]), shape: [2,2] }\r\n */\r\n\r\nimport { isTypedArray } from './isTypedArray.js';\r\n\r\nexport function flatten(input) {\r\n  const shape = [];\r\n  const flat = [];\r\n\r\n  function recurse(arr, depth) {\r\n    if (Array.isArray(arr)) {\r\n      if (shape.length <= depth) {\r\n        shape.push(arr.length);\r\n      } else if (shape[depth] !== arr.length) {\r\n        throw new Error('Inconsistent array shape');\r\n      }\r\n\r\n      for (let i = 0; i < arr.length; i++) {\r\n        recurse(arr[i], depth + 1);\r\n      }\r\n    } else if (isTypedArray(arr)) {\r\n      // Treat typed arrays as leaf nodes\r\n      for (let i = 0; i < arr.length; i++) {\r\n        flat.push(arr[i]);\r\n      }\r\n    } else if (typeof arr === 'number') {\r\n      flat.push(arr);\r\n    } else {\r\n      throw new TypeError('Unsupported data type in array');\r\n    }\r\n  }\r\n\r\n  recurse(input, 0);\r\n\r\n  return {\r\n    data: new Float32Array(flat),\r\n    shape\r\n  };\r\n}","/**\r\n * Shape utilities\r\n */\r\n\r\nexport function getSize(shape) {\r\n  return shape.reduce((a, b) => a * b, 1);\r\n}\r\n\r\nexport function validateShape(shape) {\r\n  if (!Array.isArray(shape)) {\r\n    throw new TypeError('Shape must be an array');\r\n  }\r\n\r\n  for (let i = 0; i < shape.length; i++) {\r\n    const dim = shape[i];\r\n\r\n    if (!Number.isInteger(dim) || dim <= 0) {\r\n      throw new Error('Shape must contain positive integers');\r\n    }\r\n  }\r\n\r\n  return true;\r\n}\r\n\r\nexport function areShapesEqual(a, b) {\r\n  if (a.length !== b.length) return false;\r\n\r\n  for (let i = 0; i < a.length; i++) {\r\n    if (a[i] !== b[i]) return false;\r\n  }\r\n\r\n  return true;\r\n}","/**\r\n * Array creation functions\r\n */\r\n\r\nimport { ndarray } from './ndarray.js';\r\nimport { flatten } from '../utils/flatten.js';\r\nimport { getSize, validateShape } from './shape.js';\r\n\r\n/**\r\n * Create ndarray from nested array\r\n */\r\nexport function array(input) {\r\n  const { data, shape } = flatten(input);\r\n  return ndarray(data, shape);\r\n}\r\n\r\n/**\r\n * Create array filled with zeros\r\n */\r\nexport function zeros(shape) {\r\n  validateShape(shape);\r\n\r\n  const size = getSize(shape);\r\n  const data = new Float32Array(size); // auto zero-filled\r\n\r\n  return ndarray(data, shape);\r\n}\r\n\r\n/**\r\n * Create array filled with ones\r\n */\r\nexport function ones(shape) {\r\n  validateShape(shape);\r\n\r\n  const size = getSize(shape);\r\n  const data = new Float32Array(size);\r\n\r\n  for (let i = 0; i < size; i++) {\r\n    data[i] = 1;\r\n  }\r\n\r\n  return ndarray(data, shape);\r\n}","/**\r\n * Reshape ndarray without changing data\r\n */\r\n\r\nimport { ndarray } from './ndarray.js';\r\nimport { getSize, validateShape } from './shape.js';\r\n\r\nexport function reshape(arr, newShape) {\r\n  validateShape(newShape);\r\n\r\n  const newSize = getSize(newShape);\r\n\r\n  if (newSize !== arr.size) {\r\n    throw new Error('Total size must remain the same in reshape');\r\n  }\r\n\r\n  // reuse same data buffer (fast)\r\n  return ndarray(arr.data, newShape);\r\n}","/**\r\n * Broadcasting rules (NumPy-style)\r\n *\r\n * Align shapes from right to left:\r\n * - Dimensions must be equal OR one must be 1\r\n */\r\n\r\nexport function broadcastShapes(shapeA, shapeB) {\r\n  const result = [];\r\n\r\n  const len = Math.max(shapeA.length, shapeB.length);\r\n\r\n  for (let i = 0; i < len; i++) {\r\n    const a = shapeA[shapeA.length - 1 - i] ?? 1;\r\n    const b = shapeB[shapeB.length - 1 - i] ?? 1;\r\n\r\n    if (a === b || a === 1 || b === 1) {\r\n      result.unshift(Math.max(a, b));\r\n    } else {\r\n      throw new Error(\r\n        `Cannot broadcast shapes ${shapeA} and ${shapeB}`\r\n      );\r\n    }\r\n  }\r\n\r\n  return result;\r\n}","/**\r\n * Broadcasting execution helpers\r\n */\r\n\r\nimport { broadcastShapes } from './rules.js';\r\nimport { ndarray } from '../ndarray/ndarray.js';\r\n\r\n/**\r\n * Compute stride for shape\r\n */\r\nfunction computeStride(shape) {\r\n  const stride = new Array(shape.length);\r\n  let acc = 1;\r\n\r\n  for (let i = shape.length - 1; i >= 0; i--) {\r\n    stride[i] = acc;\r\n    acc *= shape[i];\r\n  }\r\n\r\n  return stride;\r\n}\r\n\r\n/**\r\n * Convert flat index → multi-dimensional index\r\n */\r\nfunction unravelIndex(index, shape) {\r\n  const idx = new Array(shape.length);\r\n\r\n  for (let i = 0; i < shape.length; i++) {\r\n    const stride = shape.slice(i + 1).reduce((a, b) => a * b, 1);\r\n    idx[i] = Math.floor(index / stride) % shape[i];\r\n  }\r\n\r\n  return idx;\r\n}\r\n\r\n/**\r\n * Convert multi-index → flat index\r\n */\r\nfunction ravelIndex(idx, stride) {\r\n  let index = 0;\r\n  for (let i = 0; i < idx.length; i++) {\r\n    index += idx[i] * stride[i];\r\n  }\r\n  return index;\r\n}\r\n\r\n/**\r\n * Apply broadcasting for two ndarrays\r\n */\r\nexport function broadcastBinaryOp(a, b, fn) {\r\n  const outShape = broadcastShapes(a.shape, b.shape);\r\n  const outSize = outShape.reduce((x, y) => x * y, 1);\r\n\r\n  const out = new Float32Array(outSize);\r\n\r\n  const strideA = computeStride(a.shape);\r\n  const strideB = computeStride(b.shape);\r\n\r\n  const offsetA = outShape.length - a.shape.length;\r\n  const offsetB = outShape.length - b.shape.length;\r\n\r\n  for (let i = 0; i < outSize; i++) {\r\n    const idx = unravelIndex(i, outShape);\r\n\r\n    let indexA = 0;\r\n    let indexB = 0;\r\n\r\n    for (let d = 0; d < outShape.length; d++) {\r\n      const aDim = a.shape[d - offsetA] ?? 1;\r\n      const bDim = b.shape[d - offsetB] ?? 1;\r\n\r\n      const iA = aDim === 1 ? 0 : idx[d];\r\n      const iB = bDim === 1 ? 0 : idx[d];\r\n\r\n      if (d - offsetA >= 0) {\r\n        indexA += iA * strideA[d - offsetA];\r\n      }\r\n\r\n      if (d - offsetB >= 0) {\r\n        indexB += iB * strideB[d - offsetB];\r\n      }\r\n    }\r\n\r\n    out[i] = fn(a.data[indexA], b.data[indexB]);\r\n  }\r\n\r\n  return ndarray(out, outShape);\r\n}","/**\r\n * Core element-wise operation engine\r\n * Supports:\r\n *  - ndarray + ndarray (with broadcasting)\r\n *  - ndarray + scalar\r\n *  - scalar + ndarray\r\n */\r\n\r\nimport { ndarray } from '../ndarray/ndarray.js';\r\nimport { broadcastBinaryOp } from '../broadcast/broadcast.js';\r\n\r\nexport function map(a, b, fn) {\r\n  const isAScalar = typeof a === 'number';\r\n  const isBScalar = typeof b === 'number';\r\n\r\n  // Case 1: scalar + scalar\r\n  if (isAScalar && isBScalar) {\r\n    return fn(a, b);\r\n  }\r\n\r\n  // Case 2: ndarray + scalar\r\n  if (!isAScalar && isBScalar) {\r\n    const out = new Float32Array(a.size);\r\n\r\n    for (let i = 0; i < a.size; i++) {\r\n      out[i] = fn(a.data[i], b);\r\n    }\r\n\r\n    return ndarray(out, a.shape);\r\n  }\r\n\r\n  // Case 3: scalar + ndarray\r\n  if (isAScalar && !isBScalar) {\r\n    const out = new Float32Array(b.size);\r\n\r\n    for (let i = 0; i < b.size; i++) {\r\n      out[i] = fn(a, b.data[i]);\r\n    }\r\n\r\n    return ndarray(out, b.shape);\r\n  }\r\n\r\n  // Case 4: ndarray + ndarray (with broadcasting)\r\n  return broadcastBinaryOp(a, b, fn);\r\n}","import { map } from './map.js';\r\n\r\nexport function add(a, b) {\r\n  return map(a, b, (x, y) => x + y);\r\n}","import { map } from './map.js';\r\n\r\nexport function sub(a, b) {\r\n  return map(a, b, (x, y) => x - y);\r\n}","import { map } from './map.js';\r\n\r\nexport function mul(a, b) {\r\n  return map(a, b, (x, y) => x * y);\r\n}","import { map } from './map.js';\r\n\r\nexport function div(a, b) {\r\n  return map(a, b, (x, y) => x / y);\r\n}","import { map } from '../ops/map.js';\r\n\r\n/**\r\n * Element-wise square root\r\n */\r\nexport function sqrt(a) {\r\n  return map(a, 0, (x) => Math.sqrt(x));\r\n}","import { map } from '../ops/map.js';\r\n\r\n/**\r\n * Element-wise exponential (e^x)\r\n */\r\nexport function exp(a) {\r\n  return map(a, 0, (x) => Math.exp(x));\r\n}","import { map } from '../ops/map.js';\r\n\r\n/**\r\n * Element-wise natural logarithm (ln)\r\n */\r\nexport function log(a) {\r\n  return map(a, 0, (x) => Math.log(x));\r\n}","import { map } from '../ops/map.js';\r\n\r\n/**\r\n * Trigonometric functions (element-wise)\r\n */\r\n\r\nexport function sin(a) {\r\n  return map(a, 0, (x) => Math.sin(x));\r\n}\r\n\r\nexport function cos(a) {\r\n  return map(a, 0, (x) => Math.cos(x));\r\n}\r\n\r\nexport function tan(a) {\r\n  return map(a, 0, (x) => Math.tan(x));\r\n}\r\n\r\nexport function asin(a) {\r\n  return map(a, 0, (x) => Math.asin(x));\r\n}\r\n\r\nexport function acos(a) {\r\n  return map(a, 0, (x) => Math.acos(x));\r\n}\r\n\r\nexport function atan(a) {\r\n  return map(a, 0, (x) => Math.atan(x));\r\n}","/**\r\n * Transpose a 2D ndarray\r\n */\r\n\r\nimport { ndarray } from '../ndarray/ndarray.js';\r\n\r\nexport function transpose(a) {\r\n  if (a.shape.length !== 2) {\r\n    throw new Error('Transpose currently supports only 2D arrays');\r\n  }\r\n\r\n  const [rows, cols] = a.shape;\r\n\r\n  const out = new Float32Array(a.size);\r\n\r\n  for (let i = 0; i < rows; i++) {\r\n    for (let j = 0; j < cols; j++) {\r\n      out[j * rows + i] = a.data[i * cols + j];\r\n    }\r\n  }\r\n\r\n  return ndarray(out, [cols, rows]);\r\n}","/**\r\n * Dot product (1D vectors) or matrix multiplication (2D simplified)\r\n */\r\n\r\nimport { ndarray } from '../ndarray/ndarray.js';\r\n\r\nexport function dot(a, b) {\r\n  // Vector dot product\r\n  if (a.shape.length === 1 && b.shape.length === 1) {\r\n    if (a.size !== b.size) {\r\n      throw new Error('Vectors must have same length');\r\n    }\r\n\r\n    let sum = 0;\r\n\r\n    for (let i = 0; i < a.size; i++) {\r\n      sum += a.data[i] * b.data[i];\r\n    }\r\n\r\n    return sum;\r\n  }\r\n\r\n  throw new Error('dot currently supports only 1D vectors');\r\n}","/**\r\n * Matrix multiplication (2D only)\r\n */\r\n\r\nimport { ndarray } from '../ndarray/ndarray.js';\r\n\r\nexport function matmul(a, b) {\r\n  if (a.shape.length !== 2 || b.shape.length !== 2) {\r\n    throw new Error('matmul supports only 2D matrices');\r\n  }\r\n\r\n  const [m, n] = a.shape;\r\n  const [n2, p] = b.shape;\r\n\r\n  if (n !== n2) {\r\n    throw new Error('Inner dimensions must match for matmul');\r\n  }\r\n\r\n  const out = new Float32Array(m * p);\r\n\r\n  for (let i = 0; i < m; i++) {\r\n    for (let j = 0; j < p; j++) {\r\n      let sum = 0;\r\n\r\n      for (let k = 0; k < n; k++) {\r\n        sum += a.data[i * n + k] * b.data[k * p + j];\r\n      }\r\n\r\n      out[i * p + j] = sum;\r\n    }\r\n  }\r\n\r\n  return ndarray(out, [m, p]);\r\n}"],"names":["computeStride"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASA,eAAa,CAAC,KAAK,EAAE;AAC9B,EAAE,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AACzC,EAAE,IAAI,GAAG,GAAG,CAAC,CAAC;AACd;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAC9C,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;AACpB,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;AACpB,EAAE,CAAC;AACH;AACA,EAAE,OAAO,MAAM,CAAC;AAChB,CAAC;AACD;AACO,SAAS,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE;AACrC,EAAE,IAAI,EAAE,IAAI,YAAY,YAAY,CAAC,EAAE;AACvC,IAAI,MAAM,IAAI,SAAS,CAAC,2BAA2B,CAAC,CAAC;AACrD,EAAE,CAAC;AACH;AACA,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;AAC7B,IAAI,MAAM,IAAI,SAAS,CAAC,wBAAwB,CAAC,CAAC;AAClD,EAAE,CAAC;AACH;AACA,EAAE,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AAChD;AACA,EAAE,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE;AAC5B,IAAI,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;AACtD,EAAE,CAAC;AACH;AACA,EAAE,OAAO;AACT,IAAI,IAAI;AACR,IAAI,KAAK;AACT,IAAI,MAAM,EAAEA,eAAa,CAAC,KAAK,CAAC;AAChC,IAAI,IAAI;AACR,GAAG,CAAC;AACJ;;ACzCA;AACA;AACA;AACA;AACA;AACO,SAAS,YAAY,CAAC,KAAK,EAAE;AACpC,EAAE;AACF,IAAI,KAAK,IAAI,IAAI;AACjB,IAAI,OAAO,KAAK,KAAK,QAAQ;AAC7B,IAAI,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC;AAC7B,IAAI,EAAE,KAAK,YAAY,QAAQ,CAAC;AAChC,IAAI;AACJ;;ACZA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAEA;AACO,SAAS,OAAO,CAAC,KAAK,EAAE;AAC/B,EAAE,MAAM,KAAK,GAAG,EAAE,CAAC;AACnB,EAAE,MAAM,IAAI,GAAG,EAAE,CAAC;AAClB;AACA,EAAE,SAAS,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE;AAC/B,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;AAC5B,MAAM,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,EAAE;AACjC,QAAQ,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AAC/B,MAAM,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,MAAM,EAAE;AAC9C,QAAQ,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;AACpD,MAAM,CAAC;AACP;AACA,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC3C,QAAQ,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;AACnC,MAAM,CAAC;AACP,IAAI,CAAC,MAAM,IAAI,YAAY,CAAC,GAAG,CAAC,EAAE;AAClC;AACA,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC3C,QAAQ,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1B,MAAM,CAAC;AACP,IAAI,CAAC,MAAM,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE;AACxC,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACrB,IAAI,CAAC,MAAM;AACX,MAAM,MAAM,IAAI,SAAS,CAAC,gCAAgC,CAAC,CAAC;AAC5D,IAAI,CAAC;AACL,EAAE,CAAC;AACH;AACA,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AACpB;AACA,EAAE,OAAO;AACT,IAAI,IAAI,EAAE,IAAI,YAAY,CAAC,IAAI,CAAC;AAChC,IAAI,KAAK;AACT,GAAG,CAAC;AACJ;;AC5CA;AACA;AACA;AACA;AACO,SAAS,OAAO,CAAC,KAAK,EAAE;AAC/B,EAAE,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1C,CAAC;AACD;AACO,SAAS,aAAa,CAAC,KAAK,EAAE;AACrC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;AAC7B,IAAI,MAAM,IAAI,SAAS,CAAC,wBAAwB,CAAC,CAAC;AAClD,EAAE,CAAC;AACH;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACzC,IAAI,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;AACzB;AACA,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE;AAC5C,MAAM,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;AAC9D,IAAI,CAAC;AACL,EAAE,CAAC;AACH;AACA,EAAE,OAAO,IAAI,CAAC;AACd,CAAC;AACD;AACO,SAAS,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE;AACrC,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,OAAO,KAAK,CAAC;AAC1C;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACrC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,KAAK,CAAC;AACpC,EAAE,CAAC;AACH;AACA,EAAE,OAAO,IAAI,CAAC;AACd;;AChCA;AACA;AACA;AACA;AAIA;AACA;AACA;AACA;AACO,SAAS,KAAK,CAAC,KAAK,EAAE;AAC7B,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;AACzC,EAAE,OAAO,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAC9B,CAAC;AACD;AACA;AACA;AACA;AACO,SAAS,KAAK,CAAC,KAAK,EAAE;AAC7B,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC;AACvB;AACA,EAAE,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;AAC9B,EAAE,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;AACtC;AACA,EAAE,OAAO,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAC9B,CAAC;AACD;AACA;AACA;AACA;AACO,SAAS,IAAI,CAAC,KAAK,EAAE;AAC5B,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC;AACvB;AACA,EAAE,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;AAC9B,EAAE,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;AACtC;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;AACjC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAChB,EAAE,CAAC;AACH;AACA,EAAE,OAAO,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAC9B;;AC1CA;AACA;AACA;AACA;AAGA;AACO,SAAS,OAAO,CAAC,GAAG,EAAE,QAAQ,EAAE;AACvC,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAC;AAC1B;AACA,EAAE,MAAM,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;AACpC;AACA,EAAE,IAAI,OAAO,KAAK,GAAG,CAAC,IAAI,EAAE;AAC5B,IAAI,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;AAClE,EAAE,CAAC;AACH;AACA;AACA,EAAE,OAAO,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AACrC;;AClBA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE;AAChD,EAAE,MAAM,MAAM,GAAG,EAAE,CAAC;AACpB;AACA,EAAE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;AACrD;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;AAChC,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AACjD,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AACjD;AACA,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;AACvC,MAAM,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACrC,IAAI,CAAC,MAAM;AACX,MAAM,MAAM,IAAI,KAAK;AACrB,QAAQ,CAAC,wBAAwB,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AACzD,OAAO,CAAC;AACR,IAAI,CAAC;AACL,EAAE,CAAC;AACH;AACA,EAAE,OAAO,MAAM,CAAC;AAChB;;AC1BA;AACA;AACA;AACA;AAGA;AACA;AACA;AACA;AACA,SAAS,aAAa,CAAC,KAAK,EAAE;AAC9B,EAAE,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AACzC,EAAE,IAAI,GAAG,GAAG,CAAC,CAAC;AACd;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAC9C,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;AACpB,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;AACpB,EAAE,CAAC;AACH;AACA,EAAE,OAAO,MAAM,CAAC;AAChB,CAAC;AACD;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE;AACpC,EAAE,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AACtC;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACzC,IAAI,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AACjE,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;AACnD,EAAE,CAAC;AACH;AACA,EAAE,OAAO,GAAG,CAAC;AACb,CAAC;AAYD;AACA;AACA;AACA;AACO,SAAS,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE;AAC5C,EAAE,MAAM,QAAQ,GAAG,eAAe,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;AACrD,EAAE,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AACtD;AACA,EAAE,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC;AACxC;AACA,EAAE,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AACzC,EAAE,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AACzC;AACA,EAAE,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;AACnD,EAAE,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;AACnD;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;AACpC,IAAI,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;AAC1C;AACA,IAAI,IAAI,MAAM,GAAG,CAAC,CAAC;AACnB,IAAI,IAAI,MAAM,GAAG,CAAC,CAAC;AACnB;AACA,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC9C,MAAM,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;AAC7C,MAAM,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;AAC7C;AACA,MAAM,MAAM,EAAE,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AACzC,MAAM,MAAM,EAAE,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AACzC;AACA,MAAM,IAAI,CAAC,GAAG,OAAO,IAAI,CAAC,EAAE;AAC5B,QAAQ,MAAM,IAAI,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;AAC5C,MAAM,CAAC;AACP;AACA,MAAM,IAAI,CAAC,GAAG,OAAO,IAAI,CAAC,EAAE;AAC5B,QAAQ,MAAM,IAAI,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;AAC5C,MAAM,CAAC;AACP,IAAI,CAAC;AACL;AACA,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;AAChD,EAAE,CAAC;AACH;AACA,EAAE,OAAO,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;AAChC;;ACxFA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAGA;AACO,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE;AAC9B,EAAE,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,QAAQ,CAAC;AAC1C,EAAE,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,QAAQ,CAAC;AAC1C;AACA;AACA,EAAE,IAAI,SAAS,IAAI,SAAS,EAAE;AAC9B,IAAI,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACpB,EAAE,CAAC;AACH;AACA;AACA,EAAE,IAAI,CAAC,SAAS,IAAI,SAAS,EAAE;AAC/B,IAAI,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACzC;AACA,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;AACrC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAChC,IAAI,CAAC;AACL;AACA,IAAI,OAAO,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;AACjC,EAAE,CAAC;AACH;AACA;AACA,EAAE,IAAI,SAAS,IAAI,CAAC,SAAS,EAAE;AAC/B,IAAI,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACzC;AACA,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;AACrC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAChC,IAAI,CAAC;AACL;AACA,IAAI,OAAO,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;AACjC,EAAE,CAAC;AACH;AACA;AACA,EAAE,OAAO,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;AACrC;;AC1CO,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE;AAC1B,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;AACpC;;ACFO,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE;AAC1B,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;AACpC;;ACFO,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE;AAC1B,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;AACpC;;ACFO,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE;AAC1B,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;AACpC;;ACFA;AACA;AACA;AACO,SAAS,IAAI,CAAC,CAAC,EAAE;AACxB,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC;;ACLA;AACA;AACA;AACO,SAAS,GAAG,CAAC,CAAC,EAAE;AACvB,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACvC;;ACLA;AACA;AACA;AACO,SAAS,GAAG,CAAC,CAAC,EAAE;AACvB,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACvC;;ACLA;AACA;AACA;AACA;AACO,SAAS,GAAG,CAAC,CAAC,EAAE;AACvB,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACvC,CAAC;AACD;AACO,SAAS,GAAG,CAAC,CAAC,EAAE;AACvB,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACvC,CAAC;AACD;AACO,SAAS,GAAG,CAAC,CAAC,EAAE;AACvB,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACvC,CAAC;AACD;AACO,SAAS,IAAI,CAAC,CAAC,EAAE;AACxB,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AACD;AACO,SAAS,IAAI,CAAC,CAAC,EAAE;AACxB,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AACD;AACO,SAAS,IAAI,CAAC,CAAC,EAAE;AACxB,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC;;AC5BA;AACA;AACA;AACA;AAEA;AACO,SAAS,SAAS,CAAC,CAAC,EAAE;AAC7B,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;AAC5B,IAAI,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;AACnE,EAAE,CAAC;AACH;AACA,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;AAC/B;AACA,EAAE,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACvC;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;AACjC,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;AACnC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;AAC/C,IAAI,CAAC;AACL,EAAE,CAAC;AACH;AACA,EAAE,OAAO,OAAO,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;AACpC;;ACtBA;AACA;AACA;AACA;AAEA;AACO,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE;AAC1B;AACA,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;AACpD,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE;AAC3B,MAAM,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;AACvD,IAAI,CAAC;AACL;AACA,IAAI,IAAI,GAAG,GAAG,CAAC,CAAC;AAChB;AACA,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;AACrC,MAAM,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACnC,IAAI,CAAC;AACL;AACA,IAAI,OAAO,GAAG,CAAC;AACf,EAAE,CAAC;AACH;AACA,EAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;AAC5D;;ACvBA;AACA;AACA;AACA;AAEA;AACO,SAAS,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE;AAC7B,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;AACpD,IAAI,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;AACxD,EAAE,CAAC;AACH;AACA,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;AACzB,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;AAC1B;AACA,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE;AAChB,IAAI,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;AAC9D,EAAE,CAAC;AACH;AACA,EAAE,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACtC;AACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAC9B,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAChC,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC;AAClB;AACA,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAClC,QAAQ,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AACrD,MAAM,CAAC;AACP;AACA,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;AAC3B,IAAI,CAAC;AACL,EAAE,CAAC;AACH;AACA,EAAE,OAAO,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAC9B;;;;"}

package/package.json

@@ -0,0 +1,41 @@
+{
+  "name": "starlight-numera",
+  "version": "1.0.0",
+  "description": "A performance-focused numerical computing library for JavaScript inspired by NumPy",
+  "type": "module",
+  "main": "dist/index.cjs",
+  "module": "dist/index.js",
+  "exports": {
+    ".": {
+      "import": "./dist/index.js",
+      "require": "./dist/index.cjs"
+    }
+  },
+  "files": [
+    "dist"
+  ],
+  "scripts": {
+    "build": "rollup -c",
+    "dev": "rollup -c -w",
+    "test": "echo \"No tests yet\"",
+    "bench": "node benchmarks/performance.test.js"
+  },
+  "keywords": [
+    "math",
+    "numerical",
+    "ndarray",
+    "matrix",
+    "linear-algebra",
+    "numpy",
+    "vector",
+    "performance",
+    "scientific-computing"
+  ],
+  "author": "Dominex Macedon",
+  "license": "MIT",
+  "devDependencies": {
+    "rollup": "^4.0.0",
+    "@rollup/plugin-node-resolve": "^15.0.0",
+    "@rollup/plugin-commonjs": "^25.0.0"
+  }
+}