numpy-ts 0.7.0 → 0.9.0

package/dist/types/ops/rounding.d.ts

@@ -0,0 +1,36 @@
+/**
+ * Rounding operations
+ *
+ * Pure functions for element-wise rounding operations:
+ * around, ceil, fix, floor, rint, round, trunc
+ */
+import { ArrayStorage } from '../core/storage';
+/**
+ * Round an array to the given number of decimals
+ */
+export declare function around(a: ArrayStorage, decimals?: number): ArrayStorage;
+/**
+ * Return the ceiling of the input, element-wise
+ */
+export declare function ceil(a: ArrayStorage): ArrayStorage;
+/**
+ * Round to nearest integer towards zero
+ */
+export declare function fix(a: ArrayStorage): ArrayStorage;
+/**
+ * Return the floor of the input, element-wise
+ */
+export declare function floor(a: ArrayStorage): ArrayStorage;
+/**
+ * Round elements of the array to the nearest integer (banker's rounding)
+ */
+export declare function rint(a: ArrayStorage): ArrayStorage;
+/**
+ * Alias for around
+ */
+export declare function round(a: ArrayStorage, decimals?: number): ArrayStorage;
+/**
+ * Return the truncated value of the input, element-wise
+ */
+export declare function trunc(a: ArrayStorage): ArrayStorage;
+//# sourceMappingURL=rounding.d.ts.map

package/dist/types/ops/sets.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Set operations
+ */
+import { ArrayStorage } from '../core/storage';
+/**
+ * Find the unique elements of an array
+ */
+export declare function unique(a: ArrayStorage, returnIndex?: boolean, returnInverse?: boolean, returnCounts?: boolean): ArrayStorage | {
+    values: ArrayStorage;
+    indices?: ArrayStorage;
+    inverse?: ArrayStorage;
+    counts?: ArrayStorage;
+};
+/**
+ * Test whether each element of a 1-D array is also present in a second array
+ */
+export declare function in1d(ar1: ArrayStorage, ar2: ArrayStorage): ArrayStorage;
+/**
+ * Find the intersection of two arrays
+ */
+export declare function intersect1d(ar1: ArrayStorage, ar2: ArrayStorage): ArrayStorage;
+/**
+ * Test whether each element of an ND array is also present in a second array
+ */
+export declare function isin(element: ArrayStorage, testElements: ArrayStorage): ArrayStorage;
+/**
+ * Find the set difference of two arrays
+ */
+export declare function setdiff1d(ar1: ArrayStorage, ar2: ArrayStorage): ArrayStorage;
+/**
+ * Find the set exclusive-or of two arrays
+ */
+export declare function setxor1d(ar1: ArrayStorage, ar2: ArrayStorage): ArrayStorage;
+/**
+ * Find the union of two arrays
+ */
+export declare function union1d(ar1: ArrayStorage, ar2: ArrayStorage): ArrayStorage;
+//# sourceMappingURL=sets.d.ts.map

package/dist/types/ops/sorting.d.ts

@@ -0,0 +1,95 @@
+/**
+ * Sorting and searching operations
+ *
+ * Functions for sorting arrays, finding sorted indices, and searching.
+ * @module ops/sorting
+ */
+import { ArrayStorage } from '../core/storage';
+/**
+ * Return a sorted copy of an array
+ * @param storage - Input array storage
+ * @param axis - Axis along which to sort. Default is -1 (last axis)
+ * @returns Sorted array
+ */
+export declare function sort(storage: ArrayStorage, axis?: number): ArrayStorage;
+/**
+ * Returns the indices that would sort an array
+ * @param storage - Input array storage
+ * @param axis - Axis along which to sort. Default is -1 (last axis)
+ * @returns Array of indices that sort the input array
+ */
+export declare function argsort(storage: ArrayStorage, axis?: number): ArrayStorage;
+/**
+ * Perform an indirect stable sort using a sequence of keys
+ * @param keys - Array of ArrayStorage, the last key is the primary sort key
+ * @returns Array of indices that would sort the keys
+ */
+export declare function lexsort(keys: ArrayStorage[]): ArrayStorage;
+/**
+ * Partially sort an array
+ * Returns array with element at kth position in sorted position,
+ * all smaller elements before it, all larger after it (not fully sorted)
+ * @param storage - Input array storage
+ * @param kth - Element index to partition by
+ * @param axis - Axis along which to sort. Default is -1 (last axis)
+ * @returns Partitioned array
+ */
+export declare function partition(storage: ArrayStorage, kth: number, axis?: number): ArrayStorage;
+/**
+ * Returns indices that would partition an array
+ * @param storage - Input array storage
+ * @param kth - Element index to partition by
+ * @param axis - Axis along which to sort. Default is -1 (last axis)
+ * @returns Array of indices
+ */
+export declare function argpartition(storage: ArrayStorage, kth: number, axis?: number): ArrayStorage;
+/**
+ * Sort a complex array using the real part first, then the imaginary part
+ * For real arrays, this is equivalent to sort
+ * @param storage - Input array storage
+ * @returns Sorted array
+ */
+export declare function sort_complex(storage: ArrayStorage): ArrayStorage;
+/**
+ * Return the indices of the elements that are non-zero
+ * @param storage - Input array storage
+ * @returns Tuple of arrays, one for each dimension
+ */
+export declare function nonzero(storage: ArrayStorage): ArrayStorage[];
+/**
+ * Return indices of non-zero elements in flattened array
+ * @param storage - Input array storage
+ * @returns Array of indices
+ */
+export declare function flatnonzero(storage: ArrayStorage): ArrayStorage;
+/**
+ * Return elements from x or y depending on condition
+ * @param condition - Boolean array or condition
+ * @param x - Values where condition is true
+ * @param y - Values where condition is false
+ * @returns Array with elements chosen from x or y based on condition
+ */
+export declare function where(condition: ArrayStorage, x?: ArrayStorage, y?: ArrayStorage): ArrayStorage | ArrayStorage[];
+/**
+ * Find indices where elements should be inserted to maintain order
+ * @param storage - Input array (must be sorted in ascending order)
+ * @param values - Values to insert
+ * @param side - 'left' or 'right' side to insert
+ * @returns Indices where values should be inserted
+ */
+export declare function searchsorted(storage: ArrayStorage, values: ArrayStorage, side?: 'left' | 'right'): ArrayStorage;
+/**
+ * Return the elements of an array that satisfy some condition
+ * @param condition - Boolean array
+ * @param storage - Input array storage
+ * @returns 1D array of elements where condition is true
+ */
+export declare function extract(condition: ArrayStorage, storage: ArrayStorage): ArrayStorage;
+/**
+ * Count number of non-zero values in the array
+ * @param storage - Input array storage
+ * @param axis - Axis along which to count (optional)
+ * @returns Count of non-zero values
+ */
+export declare function count_nonzero(storage: ArrayStorage, axis?: number): ArrayStorage | number;
+//# sourceMappingURL=sorting.d.ts.map

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "numpy-ts",
-  "version": "0.7.0",
+  "version": "0.9.0",
   "description": "Complete NumPy implementation for TypeScript and JavaScript (under construction)",
   "main": "dist/numpy-ts.node.cjs",
   "browser": "dist/numpy-ts.browser.js",