@goodscript/core 0.13.0

package/README.md

@@ -0,0 +1,46 @@
+# @goodscript/core
+
+Core types and collections for GoodScript.
+
+## Features
+
+- **ArrayTools**: Array utilities with dual error handling (throwing and try* variants)
+- **MapTools**: Map utilities for safe key access and transformations
+- **SetTools**: Set operations (union, intersection, difference, etc.)
+- **StringTools**: String parsing utilities with dual error handling
+
+## Installation
+
+```bash
+npm install @goodscript/core
+```
+
+## Usage
+
+```typescript
+import { ArrayTools, MapTools, SetTools, StringTools } from '@goodscript/core';
+
+// ArrayTools - dual error handling pattern
+const arr = [1, 2, 3];
+ArrayTools.at(arr, 1);        // 2
+ArrayTools.tryAt(arr, 10);    // null (safe)
+ArrayTools.at(arr, 10);       // throws Error
+
+// MapTools
+const map = new Map([['key', 'value']]);
+MapTools.getOrDefault(map, 'missing', 'default');  // 'default'
+
+// SetTools
+const a = new Set([1, 2, 3]);
+const b = new Set([2, 3, 4]);
+SetTools.union(a, b);         // Set {1, 2, 3, 4}
+SetTools.intersection(a, b);  // Set {2, 3}
+
+// StringTools
+StringTools.parseInt('123');      // 123
+StringTools.tryParseInt('abc');   // null
+```
+
+## License
+
+MIT OR Apache-2.0

package/dist/array-ext-gs.d.ts

@@ -0,0 +1,62 @@
+/**
+ * Array utilities with dual error handling pattern.
+ *
+ * All fallible operations provide:
+ * - `operation()` - throws Error on failure
+ * - `tryOperation()` - returns null on failure
+ */
+export declare class ArrayExt {
+    /**
+     * Get element at index. Throws if index is out of bounds.
+     */
+    static at<T>(arr: Array<T>, index: number): T;
+    /**
+     * Get element at index. Returns null if index is out of bounds.
+     */
+    static tryAt<T>(arr: Array<T>, index: number): T | null;
+    /**
+     * Get first element. Throws if array is empty.
+     */
+    static first<T>(arr: Array<T>): T;
+    /**
+     * Get first element. Returns null if array is empty.
+     */
+    static tryFirst<T>(arr: Array<T>): T | null;
+    /**
+     * Get last element. Throws if array is empty.
+     */
+    static last<T>(arr: Array<T>): T;
+    /**
+     * Get last element. Returns null if array is empty.
+     */
+    static tryLast<T>(arr: Array<T>): T | null;
+    /**
+     * Split array into chunks of specified size.
+     * Last chunk may be smaller if array length is not evenly divisible.
+     */
+    static chunk<T>(arr: Array<T>, size: number): Array<Array<T>>;
+    /**
+     * Zip two arrays together into array of tuples.
+     * Result length is minimum of input lengths.
+     */
+    static zip<T, U>(a: Array<T>, b: Array<U>): Array<[T, U]>;
+    /**
+     * Create range of integers [start, end).
+     */
+    static range(start: number, end: number, step?: number): Array<number>;
+    /**
+     * Flatten nested array one level deep.
+     */
+    static flatten<T>(arr: Array<Array<T>>): Array<T>;
+    /**
+     * Remove duplicate values from array.
+     * Preserves first occurrence order.
+     */
+    static unique<T>(arr: Array<T>): Array<T>;
+    /**
+     * Partition array into two arrays based on predicate.
+     * Returns [truthy, falsy] tuple.
+     */
+    static partition<T>(arr: Array<T>, predicate: (item: T) => boolean): [Array<T>, Array<T>];
+}
+//# sourceMappingURL=array-ext-gs.d.ts.map

package/dist/array-ext-gs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-ext-gs.d.ts","sourceRoot":"","sources":["../src/array-ext-gs.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,qBAAa,QAAQ;IACnB;;OAEG;IACH,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC;IAQ7C;;OAEG;IACH,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,IAAI;IASvD;;OAEG;IACH,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;IAQjC;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI;IAO3C;;OAEG;IACH,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;IAQhC;;OAEG;IACH,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI;IAO1C;;;OAGG;IACH,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAY7D;;;OAGG;IACH,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IASzD;;OAEG;IACH,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,GAAE,MAAU,GAAG,KAAK,CAAC,MAAM,CAAC;IAqBzE;;OAEG;IACH,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAUjD;;;OAGG;IACH,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAYzC;;;OAGG;IACH,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;CAY1F"}

package/dist/array-ext-gs.js

@@ -0,0 +1,162 @@
+/**
+ * Array utilities with dual error handling pattern.
+ *
+ * All fallible operations provide:
+ * - `operation()` - throws Error on failure
+ * - `tryOperation()` - returns null on failure
+ */
+export class ArrayExt {
+    /**
+     * Get element at index. Throws if index is out of bounds.
+     */
+    static at(arr, index) {
+        const result = ArrayExt.tryAt(arr, index);
+        if (result === null) {
+            throw new Error(`Array index out of bounds: ${index} (length: ${arr.length})`);
+        }
+        return result;
+    }
+    /**
+     * Get element at index. Returns null if index is out of bounds.
+     */
+    static tryAt(arr, index) {
+        // Support negative indexing
+        const actualIndex = index < 0 ? arr.length + index : index;
+        if (actualIndex < 0 || actualIndex >= arr.length) {
+            return null;
+        }
+        return arr[actualIndex];
+    }
+    /**
+     * Get first element. Throws if array is empty.
+     */
+    static first(arr) {
+        const result = ArrayExt.tryFirst(arr);
+        if (result === null) {
+            throw new Error('Cannot get first element of empty array');
+        }
+        return result;
+    }
+    /**
+     * Get first element. Returns null if array is empty.
+     */
+    static tryFirst(arr) {
+        if (arr.length === 0) {
+            return null;
+        }
+        return arr[0];
+    }
+    /**
+     * Get last element. Throws if array is empty.
+     */
+    static last(arr) {
+        const result = ArrayExt.tryLast(arr);
+        if (result === null) {
+            throw new Error('Cannot get last element of empty array');
+        }
+        return result;
+    }
+    /**
+     * Get last element. Returns null if array is empty.
+     */
+    static tryLast(arr) {
+        if (arr.length === 0) {
+            return null;
+        }
+        return arr[arr.length - 1];
+    }
+    /**
+     * Split array into chunks of specified size.
+     * Last chunk may be smaller if array length is not evenly divisible.
+     */
+    static chunk(arr, size) {
+        if (size <= 0) {
+            throw new Error(`Chunk size must be positive, got: ${size}`);
+        }
+        const result = [];
+        for (let i = 0; i < arr.length; i += size) {
+            result.push(arr.slice(i, i + size));
+        }
+        return result;
+    }
+    /**
+     * Zip two arrays together into array of tuples.
+     * Result length is minimum of input lengths.
+     */
+    static zip(a, b) {
+        const length = Math.min(a.length, b.length);
+        const result = [];
+        for (let i = 0; i < length; i++) {
+            result.push([a[i], b[i]]);
+        }
+        return result;
+    }
+    /**
+     * Create range of integers [start, end).
+     */
+    static range(start, end, step = 1) {
+        if (step === 0) {
+            throw new Error('Step cannot be zero');
+        }
+        if ((end - start) / step < 0) {
+            throw new Error('Invalid range: step direction does not match start/end');
+        }
+        const result = [];
+        if (step > 0) {
+            for (let i = start; i < end; i += step) {
+                result.push(i);
+            }
+        }
+        else {
+            for (let i = start; i > end; i += step) {
+                result.push(i);
+            }
+        }
+        return result;
+    }
+    /**
+     * Flatten nested array one level deep.
+     */
+    static flatten(arr) {
+        const result = [];
+        for (const subArray of arr) {
+            for (const item of subArray) {
+                result.push(item);
+            }
+        }
+        return result;
+    }
+    /**
+     * Remove duplicate values from array.
+     * Preserves first occurrence order.
+     */
+    static unique(arr) {
+        const seen = new Set();
+        const result = [];
+        for (const item of arr) {
+            if (!seen.has(item)) {
+                seen.add(item);
+                result.push(item);
+            }
+        }
+        return result;
+    }
+    /**
+     * Partition array into two arrays based on predicate.
+     * Returns [truthy, falsy] tuple.
+     */
+    static partition(arr, predicate) {
+        const truthy = [];
+        const falsy = [];
+        for (const item of arr) {
+            if (predicate(item)) {
+                truthy.push(item);
+            }
+            else {
+                falsy.push(item);
+            }
+        }
+        return [truthy, falsy];
+    }
+}
+//# sourceMappingURL=array-ext-gs.js.map

package/dist/array-ext-gs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-ext-gs.js","sourceRoot":"","sources":["../src/array-ext-gs.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,OAAO,QAAQ;IACnB;;OAEG;IACH,MAAM,CAAC,EAAE,CAAI,GAAa,EAAE,KAAa;QACvC,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC1C,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,8BAA8B,KAAK,aAAa,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;QACjF,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAK,CAAI,GAAa,EAAE,KAAa;QAC1C,4BAA4B;QAC5B,MAAM,WAAW,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;QAC3D,IAAI,WAAW,GAAG,CAAC,IAAI,WAAW,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;YACjD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,GAAG,CAAC,WAAW,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAK,CAAI,GAAa;QAC3B,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACtC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;QAC7D,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAI,GAAa;QAC9B,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,IAAI,CAAI,GAAa;QAC1B,MAAM,MAAM,GAAG,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;QAC5D,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,OAAO,CAAI,GAAa;QAC7B,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,KAAK,CAAI,GAAa,EAAE,IAAY;QACzC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,qCAAqC,IAAI,EAAE,CAAC,CAAC;QAC/D,CAAC;QAED,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,GAAG,CAAO,CAAW,EAAE,CAAW;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAkB,EAAE,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAK,CAAC,KAAa,EAAE,GAAW,EAAE,OAAe,CAAC;QACvD,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;QACzC,CAAC;QACD,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;QAC5E,CAAC;QAED,MAAM,MAAM,GAAkB,EAAE,CAAC;QACjC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,OAAO,CAAI,GAAoB;QACpC,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,KAAK,MAAM,QAAQ,IAAI,GAAG,EAAE,CAAC;YAC3B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,MAAM,CAAI,GAAa;QAC5B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK,CAAC;QAC1B,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACf,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,SAAS,CAAI,GAAa,EAAE,SAA+B;QAChE,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QACD,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACzB,CAAC;CACF"}

package/dist/array-tools-gs.d.ts

@@ -0,0 +1,62 @@
+/**
+ * Array utilities with dual error handling pattern.
+ *
+ * All fallible operations provide:
+ * - `operation()` - throws Error on failure
+ * - `tryOperation()` - returns null on failure
+ */
+export declare class ArrayTools {
+    /**
+     * Get element at index. Throws if index is out of bounds.
+     */
+    static at<T>(arr: Array<T>, index: number): T;
+    /**
+     * Get element at index. Returns null if index is out of bounds.
+     */
+    static tryAt<T>(arr: Array<T>, index: number): T | null;
+    /**
+     * Get first element. Throws if array is empty.
+     */
+    static first<T>(arr: Array<T>): T;
+    /**
+     * Get first element. Returns null if array is empty.
+     */
+    static tryFirst<T>(arr: Array<T>): T | null;
+    /**
+     * Get last element. Throws if array is empty.
+     */
+    static last<T>(arr: Array<T>): T;
+    /**
+     * Get last element. Returns null if array is empty.
+     */
+    static tryLast<T>(arr: Array<T>): T | null;
+    /**
+     * Split array into chunks of specified size.
+     * Last chunk may be smaller if array length is not evenly divisible.
+     */
+    static chunk<T>(arr: Array<T>, size: number): Array<Array<T>>;
+    /**
+     * Zip two arrays together into array of tuples.
+     * Result length is minimum of input lengths.
+     */
+    static zip<T, U>(a: Array<T>, b: Array<U>): Array<[T, U]>;
+    /**
+     * Create range of integers [start, end).
+     */
+    static range(start: number, end: number, step?: number): Array<number>;
+    /**
+     * Flatten nested array one level deep.
+     */
+    static flatten<T>(arr: Array<Array<T>>): Array<T>;
+    /**
+     * Remove duplicate values from array.
+     * Preserves first occurrence order.
+     */
+    static unique<T>(arr: Array<T>): Array<T>;
+    /**
+     * Partition array into two arrays based on predicate.
+     * Returns [truthy, falsy] tuple.
+     */
+    static partition<T>(arr: Array<T>, predicate: (item: T) => boolean): [Array<T>, Array<T>];
+}
+//# sourceMappingURL=array-tools-gs.d.ts.map

package/dist/array-tools-gs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-tools-gs.d.ts","sourceRoot":"","sources":["../src/array-tools-gs.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,qBAAa,UAAU;IACrB;;OAEG;IACH,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC;IAQ7C;;OAEG;IACH,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,IAAI;IASvD;;OAEG;IACH,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;IAQjC;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI;IAO3C;;OAEG;IACH,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;IAQhC;;OAEG;IACH,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI;IAO1C;;;OAGG;IACH,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAY7D;;;OAGG;IACH,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IASzD;;OAEG;IACH,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,GAAE,MAAU,GAAG,KAAK,CAAC,MAAM,CAAC;IAqBzE;;OAEG;IACH,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAUjD;;;OAGG;IACH,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAYzC;;;OAGG;IACH,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;CAY1F"}

package/dist/array-tools-gs.js

@@ -0,0 +1,162 @@
+/**
+ * Array utilities with dual error handling pattern.
+ *
+ * All fallible operations provide:
+ * - `operation()` - throws Error on failure
+ * - `tryOperation()` - returns null on failure
+ */
+export class ArrayTools {
+    /**
+     * Get element at index. Throws if index is out of bounds.
+     */
+    static at(arr, index) {
+        const result = ArrayTools.tryAt(arr, index);
+        if (result === null) {
+            throw new Error(`Array index out of bounds: ${index} (length: ${arr.length})`);
+        }
+        return result;
+    }
+    /**
+     * Get element at index. Returns null if index is out of bounds.
+     */
+    static tryAt(arr, index) {
+        // Support negative indexing
+        const actualIndex = index < 0 ? arr.length + index : index;
+        if (actualIndex < 0 || actualIndex >= arr.length) {
+            return null;
+        }
+        return arr[actualIndex];
+    }
+    /**
+     * Get first element. Throws if array is empty.
+     */
+    static first(arr) {
+        const result = ArrayTools.tryFirst(arr);
+        if (result === null) {
+            throw new Error('Cannot get first element of empty array');
+        }
+        return result;
+    }
+    /**
+     * Get first element. Returns null if array is empty.
+     */
+    static tryFirst(arr) {
+        if (arr.length === 0) {
+            return null;
+        }
+        return arr[0];
+    }
+    /**
+     * Get last element. Throws if array is empty.
+     */
+    static last(arr) {
+        const result = ArrayTools.tryLast(arr);
+        if (result === null) {
+            throw new Error('Cannot get last element of empty array');
+        }
+        return result;
+    }
+    /**
+     * Get last element. Returns null if array is empty.
+     */
+    static tryLast(arr) {
+        if (arr.length === 0) {
+            return null;
+        }
+        return arr[arr.length - 1];
+    }
+    /**
+     * Split array into chunks of specified size.
+     * Last chunk may be smaller if array length is not evenly divisible.
+     */
+    static chunk(arr, size) {
+        if (size <= 0) {
+            throw new Error(`Chunk size must be positive, got: ${size}`);
+        }
+        const result = [];
+        for (let i = 0; i < arr.length; i += size) {
+            result.push(arr.slice(i, i + size));
+        }
+        return result;
+    }
+    /**
+     * Zip two arrays together into array of tuples.
+     * Result length is minimum of input lengths.
+     */
+    static zip(a, b) {
+        const length = Math.min(a.length, b.length);
+        const result = [];
+        for (let i = 0; i < length; i++) {
+            result.push([a[i], b[i]]);
+        }
+        return result;
+    }
+    /**
+     * Create range of integers [start, end).
+     */
+    static range(start, end, step = 1) {
+        if (step === 0) {
+            throw new Error('Step cannot be zero');
+        }
+        if ((end - start) / step < 0) {
+            throw new Error('Invalid range: step direction does not match start/end');
+        }
+        const result = [];
+        if (step > 0) {
+            for (let i = start; i < end; i += step) {
+                result.push(i);
+            }
+        }
+        else {
+            for (let i = start; i > end; i += step) {
+                result.push(i);
+            }
+        }
+        return result;
+    }
+    /**
+     * Flatten nested array one level deep.
+     */
+    static flatten(arr) {
+        const result = [];
+        for (const subArray of arr) {
+            for (const item of subArray) {
+                result.push(item);
+            }
+        }
+        return result;
+    }
+    /**
+     * Remove duplicate values from array.
+     * Preserves first occurrence order.
+     */
+    static unique(arr) {
+        const seen = new Set();
+        const result = [];
+        for (const item of arr) {
+            if (!seen.has(item)) {
+                seen.add(item);
+                result.push(item);
+            }
+        }
+        return result;
+    }
+    /**
+     * Partition array into two arrays based on predicate.
+     * Returns [truthy, falsy] tuple.
+     */
+    static partition(arr, predicate) {
+        const truthy = [];
+        const falsy = [];
+        for (const item of arr) {
+            if (predicate(item)) {
+                truthy.push(item);
+            }
+            else {
+                falsy.push(item);
+            }
+        }
+        return [truthy, falsy];
+    }
+}
+//# sourceMappingURL=array-tools-gs.js.map

package/dist/array-tools-gs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-tools-gs.js","sourceRoot":"","sources":["../src/array-tools-gs.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,OAAO,UAAU;IACrB;;OAEG;IACH,MAAM,CAAC,EAAE,CAAI,GAAa,EAAE,KAAa;QACvC,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC5C,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,8BAA8B,KAAK,aAAa,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;QACjF,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAK,CAAI,GAAa,EAAE,KAAa;QAC1C,4BAA4B;QAC5B,MAAM,WAAW,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;QAC3D,IAAI,WAAW,GAAG,CAAC,IAAI,WAAW,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;YACjD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,GAAG,CAAC,WAAW,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAK,CAAI,GAAa;QAC3B,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACxC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;QAC7D,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAI,GAAa;QAC9B,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,IAAI,CAAI,GAAa;QAC1B,MAAM,MAAM,GAAG,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;QAC5D,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,OAAO,CAAI,GAAa;QAC7B,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,KAAK,CAAI,GAAa,EAAE,IAAY;QACzC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,qCAAqC,IAAI,EAAE,CAAC,CAAC;QAC/D,CAAC;QAED,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,GAAG,CAAO,CAAW,EAAE,CAAW;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAkB,EAAE,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAK,CAAC,KAAa,EAAE,GAAW,EAAE,OAAe,CAAC;QACvD,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;QACzC,CAAC;QACD,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;QAC5E,CAAC;QAED,MAAM,MAAM,GAAkB,EAAE,CAAC;QACjC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,OAAO,CAAI,GAAoB;QACpC,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,KAAK,MAAM,QAAQ,IAAI,GAAG,EAAE,CAAC;YAC3B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,MAAM,CAAI,GAAa;QAC5B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAK,CAAC;QAC1B,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACf,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,SAAS,CAAI,GAAa,EAAE,SAA+B;QAChE,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QACD,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACzB,CAAC;CACF"}

package/dist/index-gs.d.ts

@@ -0,0 +1,17 @@
+/**
+ * @goodscript/core - Core Types & Collections
+ *
+ * GoodScript standard library module providing utilities for:
+ * - Array operations with dual error handling
+ * - Map and Set utilities
+ * - String parsing with fallible operations
+ *
+ * All fallible operations follow the dual-API pattern:
+ * - `operation()` throws on error
+ * - `tryOperation()` returns null on error
+ */
+export { ArrayTools } from './array-tools-gs.js';
+export { MapTools } from './map-tools-gs.js';
+export { SetTools } from './set-tools-gs.js';
+export { StringTools } from './string-tools-gs.js';
+//# sourceMappingURL=index-gs.d.ts.map

package/dist/index-gs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index-gs.d.ts","sourceRoot":"","sources":["../src/index-gs.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC7C,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC7C,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC"}

package/dist/index-gs.js

@@ -0,0 +1,17 @@
+/**
+ * @goodscript/core - Core Types & Collections
+ *
+ * GoodScript standard library module providing utilities for:
+ * - Array operations with dual error handling
+ * - Map and Set utilities
+ * - String parsing with fallible operations
+ *
+ * All fallible operations follow the dual-API pattern:
+ * - `operation()` throws on error
+ * - `tryOperation()` returns null on error
+ */
+export { ArrayTools } from './array-tools-gs.js';
+export { MapTools } from './map-tools-gs.js';
+export { SetTools } from './set-tools-gs.js';
+export { StringTools } from './string-tools-gs.js';
+//# sourceMappingURL=index-gs.js.map

package/dist/index-gs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index-gs.js","sourceRoot":"","sources":["../src/index-gs.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC7C,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC7C,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC"}

package/dist/map-ext-gs.d.ts

@@ -0,0 +1,46 @@
+/**
+ * Map utilities with dual error handling pattern.
+ */
+export declare class MapExt {
+    /**
+     * Get value from map, or return default if key doesn't exist.
+     */
+    static getOrDefault<K, V>(map: Map<K, V>, key: K, defaultValue: V): V;
+    /**
+     * Get value from map. Returns null if key doesn't exist.
+     */
+    static tryGet<K, V>(map: Map<K, V>, key: K): V | null;
+    /**
+     * Get value from map. Throws if key doesn't exist.
+     */
+    static get<K, V>(map: Map<K, V>, key: K): V;
+    /**
+     * Get all keys as array.
+     */
+    static keys<K, V>(map: Map<K, V>): Array<K>;
+    /**
+     * Get all values as array.
+     */
+    static values<K, V>(map: Map<K, V>): Array<V>;
+    /**
+     * Get all entries as array of tuples.
+     */
+    static entries<K, V>(map: Map<K, V>): Array<[K, V]>;
+    /**
+     * Create new map from array of tuples.
+     */
+    static fromEntries<K, V>(entries: Array<[K, V]>): Map<K, V>;
+    /**
+     * Map over map values, returning new map with same keys.
+     */
+    static mapValues<K, V, U>(map: Map<K, V>, fn: (value: V, key: K) => U): Map<K, U>;
+    /**
+     * Filter map entries by predicate.
+     */
+    static filter<K, V>(map: Map<K, V>, predicate: (value: V, key: K) => boolean): Map<K, V>;
+    /**
+     * Merge multiple maps. Later maps override earlier ones.
+     */
+    static merge<K, V>(...maps: Array<Map<K, V>>): Map<K, V>;
+}
+//# sourceMappingURL=map-ext-gs.d.ts.map

package/dist/map-ext-gs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"map-ext-gs.d.ts","sourceRoot":"","sources":["../src/map-ext-gs.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,qBAAa,MAAM;IACjB;;OAEG;IACH,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,GAAG,CAAC;IAKrE;;OAEG;IACH,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI;IAKrD;;OAEG;IACH,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC;IAQ3C;;OAEG;IACH,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAI3C;;OAEG;IACH,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAI7C;;OAEG;IACH,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAInD;;OAEG;IACH,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAI3D;;OAEG;IACH,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAQjF;;OAEG;IACH,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAUxF;;OAEG;IACH,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;CASzD"}