@elaraai/e3-cli 0.0.2-beta.9 → 1.0.0

package/dist/src/credentials.js

@@ -0,0 +1,213 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Licensed under BSL 1.1. See LICENSE for details.
+ */
+/**
+ * Credential storage for e3 CLI.
+ *
+ * Stores access and refresh tokens for authenticated servers
+ * in ~/.e3/credentials.json.
+ */
+import * as fs from 'node:fs';
+import * as path from 'node:path';
+import * as os from 'node:os';
+/**
+ * Get path to credentials file.
+ * Uses E3_CREDENTIALS_PATH env var if set, otherwise ~/.e3/credentials.json.
+ */
+function getCredentialsPath() {
+    return process.env.E3_CREDENTIALS_PATH ?? path.join(os.homedir(), '.e3', 'credentials.json');
+}
+/**
+ * Normalize server URL (remove trailing slash).
+ */
+export function normalizeServerUrl(url) {
+    return url.replace(/\/+$/, '');
+}
+/**
+ * Load credentials file.
+ */
+export function loadCredentials() {
+    try {
+        const content = fs.readFileSync(getCredentialsPath(), 'utf8');
+        return JSON.parse(content);
+    }
+    catch {
+        return { version: 1, credentials: {} };
+    }
+}
+/**
+ * Save credentials file.
+ */
+export function saveCredentials(file) {
+    const credPath = getCredentialsPath();
+    const dir = path.dirname(credPath);
+    if (!fs.existsSync(dir)) {
+        fs.mkdirSync(dir, { recursive: true, mode: 0o700 });
+    }
+    fs.writeFileSync(credPath, JSON.stringify(file, null, 2), { mode: 0o600 });
+}
+/**
+ * Get credential for a server.
+ */
+export function getCredential(serverUrl) {
+    const file = loadCredentials();
+    return file.credentials[normalizeServerUrl(serverUrl)] ?? null;
+}
+/**
+ * Set credential for a server.
+ */
+export function setCredential(serverUrl, entry) {
+    const file = loadCredentials();
+    file.credentials[normalizeServerUrl(serverUrl)] = entry;
+    saveCredentials(file);
+}
+/**
+ * Remove credential for a server.
+ */
+export function removeCredential(serverUrl) {
+    const file = loadCredentials();
+    const key = normalizeServerUrl(serverUrl);
+    if (key in file.credentials) {
+        delete file.credentials[key];
+        saveCredentials(file);
+        return true;
+    }
+    return false;
+}
+/**
+ * List all saved credentials.
+ */
+export function listCredentials() {
+    const file = loadCredentials();
+    return Object.entries(file.credentials).map(([server, entry]) => ({
+        server,
+        expiresAt: entry.expiresAt,
+    }));
+}
+/**
+ * Check if a token expiration time has passed.
+ */
+export function isExpired(expiresAt) {
+    return new Date(expiresAt).getTime() < Date.now();
+}
+/**
+ * Fetch OIDC discovery document.
+ */
+export async function fetchDiscovery(serverUrl) {
+    const url = `${normalizeServerUrl(serverUrl)}/.well-known/openid-configuration`;
+    const response = await fetch(url);
+    if (!response.ok) {
+        throw new Error(`Failed to fetch OIDC discovery: ${response.status}`);
+    }
+    return response.json();
+}
+/**
+ * Start device authorization flow.
+ */
+export async function startDeviceAuth(discovery) {
+    const response = await fetch(discovery.device_authorization_endpoint, {
+        method: 'POST',
+        headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+        body: new URLSearchParams({ client_id: 'e3-cli' }),
+    });
+    if (!response.ok) {
+        throw new Error(`Failed to start device authorization: ${response.status}`);
+    }
+    return response.json();
+}
+/**
+ * Poll for device code approval.
+ */
+export async function pollForTokens(discovery, deviceCode, interval, expiresIn) {
+    const deadline = Date.now() + expiresIn * 1000;
+    while (Date.now() < deadline) {
+        await new Promise((resolve) => setTimeout(resolve, interval * 1000));
+        const response = await fetch(discovery.token_endpoint, {
+            method: 'POST',
+            headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+            body: new URLSearchParams({
+                grant_type: 'urn:ietf:params:oauth:grant-type:device_code',
+                device_code: deviceCode,
+                client_id: 'e3-cli',
+            }),
+        });
+        if (response.ok) {
+            return response.json();
+        }
+        const error = await response.json();
+        if (error.error === 'authorization_pending') {
+            continue; // Keep polling
+        }
+        if (error.error === 'slow_down') {
+            interval += 1; // Slow down as requested
+            continue;
+        }
+        throw new Error(`Token exchange failed: ${error.error} - ${error.error_description ?? ''}`);
+    }
+    throw new Error('Device authorization timed out');
+}
+/**
+ * Refresh an access token using a refresh token.
+ */
+export async function refreshAccessToken(serverUrl, refreshToken) {
+    const discovery = await fetchDiscovery(serverUrl);
+    const response = await fetch(discovery.token_endpoint, {
+        method: 'POST',
+        headers: { 'Content-Type': 'application/x-www-form-urlencoded' },
+        body: new URLSearchParams({
+            grant_type: 'refresh_token',
+            refresh_token: refreshToken,
+            client_id: 'e3-cli',
+        }),
+    });
+    if (!response.ok) {
+        const error = await response.json();
+        throw new Error(`Token refresh failed: ${error.error} - ${error.error_description ?? ''}`);
+    }
+    return response.json();
+}
+/**
+ * Get a valid access token for a server.
+ *
+ * If the current token is expired, attempts to refresh it.
+ * Throws if not logged in or refresh fails.
+ */
+export async function getValidToken(serverUrl) {
+    const creds = getCredential(serverUrl);
+    if (!creds) {
+        throw new Error(`Not logged in to ${serverUrl}. Run: e3 login ${serverUrl}`);
+    }
+    // Return existing token if not expired
+    if (!isExpired(creds.expiresAt)) {
+        return creds.accessToken;
+    }
+    // Attempt to refresh
+    try {
+        const tokens = await refreshAccessToken(serverUrl, creds.refreshToken);
+        const newEntry = {
+            accessToken: tokens.access_token,
+            refreshToken: tokens.refresh_token,
+            expiresAt: new Date(Date.now() + tokens.expires_in * 1000).toISOString(),
+        };
+        setCredential(serverUrl, newEntry);
+        return tokens.access_token;
+    }
+    catch (err) {
+        // Refresh failed, need to re-login
+        removeCredential(serverUrl);
+        const message = err instanceof Error ? err.message : 'unknown error';
+        throw new Error(`Session expired and refresh failed: ${message}. Run: e3 login ${serverUrl}`);
+    }
+}
+/**
+ * Decode JWT payload without verification (for display purposes only).
+ */
+export function decodeJwtPayload(token) {
+    const parts = token.split('.');
+    if (parts.length !== 3) {
+        throw new Error('Invalid JWT format');
+    }
+    return JSON.parse(Buffer.from(parts[1], 'base64url').toString());
+}
+//# sourceMappingURL=credentials.js.map

package/dist/src/credentials.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"credentials.js","sourceRoot":"","sources":["../../src/credentials.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;AAC9B,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;AAgE9B;;;GAGG;AACH,SAAS,kBAAkB;IACzB,OAAO,OAAO,CAAC,GAAG,CAAC,mBAAmB,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,kBAAkB,CAAC,CAAC;AAC/F,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,GAAW;IAC5C,OAAO,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;AACjC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe;IAC7B,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC,kBAAkB,EAAE,EAAE,MAAM,CAAC,CAAC;QAC9D,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAoB,CAAC;IAChD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC;IACzC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,IAAqB;IACnD,MAAM,QAAQ,GAAG,kBAAkB,EAAE,CAAC;IACtC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACnC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACxB,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IACtD,CAAC;IACD,EAAE,CAAC,aAAa,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;AAC7E,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,SAAiB;IAC7C,MAAM,IAAI,GAAG,eAAe,EAAE,CAAC;IAC/B,OAAO,IAAI,CAAC,WAAW,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC,IAAI,IAAI,CAAC;AACjE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,SAAiB,EAAE,KAAsB;IACrE,MAAM,IAAI,GAAG,eAAe,EAAE,CAAC;IAC/B,IAAI,CAAC,WAAW,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC,GAAG,KAAK,CAAC;IACxD,eAAe,CAAC,IAAI,CAAC,CAAC;AACxB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,SAAiB;IAChD,MAAM,IAAI,GAAG,eAAe,EAAE,CAAC;IAC/B,MAAM,GAAG,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC;IAC1C,IAAI,GAAG,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QAC5B,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAC7B,eAAe,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe;IAC7B,MAAM,IAAI,GAAG,eAAe,EAAE,CAAC;IAC/B,OAAO,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;QAChE,MAAM;QACN,SAAS,EAAE,KAAK,CAAC,SAAS;KAC3B,CAAC,CAAC,CAAC;AACN,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,SAAS,CAAC,SAAiB;IACzC,OAAO,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;AACpD,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,SAAiB;IACpD,MAAM,GAAG,GAAG,GAAG,kBAAkB,CAAC,SAAS,CAAC,mCAAmC,CAAC;IAChF,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC;IAClC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,mCAAmC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IACxE,CAAC;IACD,OAAO,QAAQ,CAAC,IAAI,EAA4B,CAAC;AACnD,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,SAAwB;IAC5D,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,SAAS,CAAC,6BAA6B,EAAE;QACpE,MAAM,EAAE,MAAM;QACd,OAAO,EAAE,EAAE,cAAc,EAAE,mCAAmC,EAAE;QAChE,IAAI,EAAE,IAAI,eAAe,CAAC,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC;KACnD,CAAC,CAAC;IACH,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,yCAAyC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IAC9E,CAAC;IACD,OAAO,QAAQ,CAAC,IAAI,EAAiC,CAAC;AACxD,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,SAAwB,EACxB,UAAkB,EAClB,QAAgB,EAChB,SAAiB;IAEjB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,GAAG,IAAI,CAAC;IAE/C,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,EAAE,CAAC;QAC7B,MAAM,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC;QAErE,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,SAAS,CAAC,cAAc,EAAE;YACrD,MAAM,EAAE,MAAM;YACd,OAAO,EAAE,EAAE,cAAc,EAAE,mCAAmC,EAAE;YAChE,IAAI,EAAE,IAAI,eAAe,CAAC;gBACxB,UAAU,EAAE,8CAA8C;gBAC1D,WAAW,EAAE,UAAU;gBACvB,SAAS,EAAE,QAAQ;aACpB,CAAC;SACH,CAAC,CAAC;QAEH,IAAI,QAAQ,CAAC,EAAE,EAAE,CAAC;YAChB,OAAO,QAAQ,CAAC,IAAI,EAA4B,CAAC;QACnD,CAAC;QAED,MAAM,KAAK,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAwB,CAAC;QAC1D,IAAI,KAAK,CAAC,KAAK,KAAK,uBAAuB,EAAE,CAAC;YAC5C,SAAS,CAAC,eAAe;QAC3B,CAAC;QACD,IAAI,KAAK,CAAC,KAAK,KAAK,WAAW,EAAE,CAAC;YAChC,QAAQ,IAAI,CAAC,CAAC,CAAC,yBAAyB;YACxC,SAAS;QACX,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,0BAA0B,KAAK,CAAC,KAAK,MAAM,KAAK,CAAC,iBAAiB,IAAI,EAAE,EAAE,CAAC,CAAC;IAC9F,CAAC;IAED,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;AACpD,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,SAAiB,EACjB,YAAoB;IAEpB,MAAM,SAAS,GAAG,MAAM,cAAc,CAAC,SAAS,CAAC,CAAC;IAClD,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,SAAS,CAAC,cAAc,EAAE;QACrD,MAAM,EAAE,MAAM;QACd,OAAO,EAAE,EAAE,cAAc,EAAE,mCAAmC,EAAE;QAChE,IAAI,EAAE,IAAI,eAAe,CAAC;YACxB,UAAU,EAAE,eAAe;YAC3B,aAAa,EAAE,YAAY;YAC3B,SAAS,EAAE,QAAQ;SACpB,CAAC;KACH,CAAC,CAAC;IAEH,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;QACjB,MAAM,KAAK,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAwB,CAAC;QAC1D,MAAM,IAAI,KAAK,CAAC,yBAAyB,KAAK,CAAC,KAAK,MAAM,KAAK,CAAC,iBAAiB,IAAI,EAAE,EAAE,CAAC,CAAC;IAC7F,CAAC;IAED,OAAO,QAAQ,CAAC,IAAI,EAA4B,CAAC;AACnD,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,SAAiB;IACnD,MAAM,KAAK,GAAG,aAAa,CAAC,SAAS,CAAC,CAAC;IACvC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,IAAI,KAAK,CAAC,oBAAoB,SAAS,mBAAmB,SAAS,EAAE,CAAC,CAAC;IAC/E,CAAC;IAED,uCAAuC;IACvC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC;QAChC,OAAO,KAAK,CAAC,WAAW,CAAC;IAC3B,CAAC;IAED,qBAAqB;IACrB,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,kBAAkB,CAAC,SAAS,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;QACvE,MAAM,QAAQ,GAAoB;YAChC,WAAW,EAAE,MAAM,CAAC,YAAY;YAChC,YAAY,EAAE,MAAM,CAAC,aAAa;YAClC,SAAS,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC,WAAW,EAAE;SACzE,CAAC;QACF,aAAa,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC,YAAY,CAAC;IAC7B,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,mCAAmC;QACnC,gBAAgB,CAAC,SAAS,CAAC,CAAC;QAC5B,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC;QACrE,MAAM,IAAI,KAAK,CAAC,uCAAuC,OAAO,mBAAmB,SAAS,EAAE,CAAC,CAAC;IAChG,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAa;IAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,QAAQ,EAAE,CAA4B,CAAC;AAC9F,CAAC"}

package/dist/src/format.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Licensed under BSL 1.1. See LICENSE for details.
+ */
+import type { PackageExportProgress } from '@elaraai/e3-types';
+/**
+ * Shared formatting utilities for CLI commands.
+ */
+/**
+ * Format a byte count as a human-readable string.
+ *
+ * @param bytes - Size in bytes
+ * @returns Formatted string like "42 B", "1.5 KB", "1 MB"
+ */
+export declare function formatSize(bytes: number): string;
+export declare function writeExportProgress(progress: PackageExportProgress): void;
+export declare function clearProgress(): void;
+//# sourceMappingURL=format.d.ts.map

package/dist/src/format.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"format.d.ts","sourceRoot":"","sources":["../../src/format.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC;AAE/D;;GAEG;AAEH;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAahD;AAED,wBAAgB,mBAAmB,CAAC,QAAQ,EAAE,qBAAqB,GAAG,IAAI,CAQzE;AAED,wBAAgB,aAAa,IAAI,IAAI,CAEpC"}

package/dist/src/format.js

@@ -0,0 +1,43 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Licensed under BSL 1.1. See LICENSE for details.
+ */
+/**
+ * Shared formatting utilities for CLI commands.
+ */
+/**
+ * Format a byte count as a human-readable string.
+ *
+ * @param bytes - Size in bytes
+ * @returns Formatted string like "42 B", "1.5 KB", "1 MB"
+ */
+export function formatSize(bytes) {
+    if (bytes < 1024)
+        return `${bytes} B`;
+    const units = ['KB', 'MB', 'GB', 'TB'];
+    let value = bytes;
+    for (const unit of units) {
+        value /= 1024;
+        if (value < 1024 || unit === 'TB') {
+            const formatted = value % 1 === 0 ? value.toFixed(0) : value.toFixed(1);
+            return `${formatted} ${unit}`;
+        }
+    }
+    // unreachable, but TypeScript needs it
+    return `${bytes} B`;
+}
+export function writeExportProgress(progress) {
+    if (progress.type === 'pending') {
+        process.stdout.write(`\rPending...\x1b[K`);
+    }
+    else if (progress.type === 'exporting') {
+        process.stdout.write(`\rExporting... ${progress.value.objectsProcessed} objects\x1b[K`);
+    }
+    else if (progress.type === 'uploading') {
+        process.stdout.write(`\rUploading...\x1b[K`);
+    }
+}
+export function clearProgress() {
+    process.stdout.write('\r\x1b[K');
+}
+//# sourceMappingURL=format.js.map

package/dist/src/format.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"format.js","sourceRoot":"","sources":["../../src/format.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH;;GAEG;AAEH;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,KAAa;IACtC,IAAI,KAAK,GAAG,IAAI;QAAE,OAAO,GAAG,KAAK,IAAI,CAAC;IACtC,MAAM,KAAK,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IACvC,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,IAAI,IAAI,CAAC;QACd,IAAI,KAAK,GAAG,IAAI,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClC,MAAM,SAAS,GAAG,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACxE,OAAO,GAAG,SAAS,IAAI,IAAI,EAAE,CAAC;QAChC,CAAC;IACH,CAAC;IACD,uCAAuC;IACvC,OAAO,GAAG,KAAK,IAAI,CAAC;AACtB,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,QAA+B;IACjE,IAAI,QAAQ,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAChC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC;IAC7C,CAAC;SAAM,IAAI,QAAQ,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;QACzC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,kBAAkB,QAAQ,CAAC,KAAK,CAAC,gBAAgB,gBAAgB,CAAC,CAAC;IAC1F,CAAC;SAAM,IAAI,QAAQ,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;QACzC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,sBAAsB,CAAC,CAAC;IAC/C,CAAC;AACH,CAAC;AAED,MAAM,UAAU,aAAa;IAC3B,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;AACnC,CAAC"}

package/dist/src/path-resolver.d.ts

@@ -0,0 +1,86 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Licensed under BSL 1.1. See LICENSE for details.
+ */
+/**
+ * Dataset path resolver.
+ *
+ * Users address datasets with the flat form `<ws>.<name>`. The on-disk storage
+ * uses `<ws>/inputs/<name>` for inputs and `<ws>/tasks/<name>/output` for task
+ * outputs. The resolver maps between them, consulting the workspace tree to
+ * discover which kind a name refers to.
+ *
+ * The async wrappers (`buildWorkspaceIndex`, `resolveDatasetPath`) fetch the
+ * workspace tree once per call. The pure helpers (`indexFromTree`,
+ * `indexFromRemoteEntries`, `resolveDatasetPathFromIndex`) take the index
+ * directly and are used by unit tests.
+ */
+import { type TreeNode } from '@elaraai/e3-core';
+import { type ListEntry } from '@elaraai/e3-api-client';
+import type { TreePath } from '@elaraai/e3-types';
+import type { RepoLocation } from './utils.js';
+/** Kind of a resolved dataset. */
+export type DatasetKind = 'input' | 'task-output' | 'other';
+/** A resolved dataset entry from the workspace. */
+export interface ResolvedEntry {
+    /** The short name a user types (e.g. `greet`). */
+    name: string;
+    /** Storage TreePath (e.g. `[tasks, greet, output]`). */
+    storage: TreePath;
+    /** Whether this is an input, task output, or something else. */
+    kind: DatasetKind;
+}
+/** Result of a successful path resolution. */
+export interface ResolvedPath {
+    ws: string;
+    /** Storage TreePath (always the canonical on-disk path). */
+    path: TreePath;
+    /** The kind of dataset resolved. */
+    kind: DatasetKind;
+}
+/**
+ * Build an index from a workspace tree as returned by `workspaceGetTree`.
+ *
+ * Pure. Leaf nodes under `inputs/` become `kind: 'input'`. Leaf nodes under
+ * `tasks/` become `kind: 'task-output'` and the storage path gains the
+ * `output` suffix (because `workspaceGetTree` collapses task subtrees).
+ * Leaves elsewhere get `kind: 'other'` with a dotted name.
+ */
+export declare function indexFromTree(tree: TreeNode[]): ResolvedEntry[];
+/**
+ * Build an index from remote `datasetListRecursive` entries.
+ *
+ * Pure. Each entry's path is a dot-separated string; same partitioning rules
+ * as `indexFromTree`.
+ */
+export declare function indexFromRemoteEntries(items: ListEntry[]): ResolvedEntry[];
+/**
+ * Resolve a flat dataset path against a pre-built index.
+ *
+ * Pure. Implements the same rules as `resolveDatasetPath` but takes the
+ * index as a parameter so unit tests don't need a repo.
+ *
+ * @throws Error with suggestions when the name is unknown or ambiguous.
+ */
+export declare function resolveDatasetPathFromIndex(pathSpec: string, index: ResolvedEntry[]): ResolvedPath;
+/**
+ * Fetch the workspace tree and build an index of every dataset reachable
+ * by its short name.
+ */
+export declare function buildWorkspaceIndex(location: RepoLocation, ws: string): Promise<ResolvedEntry[]>;
+/**
+ * Resolve a flat dataset path (`<ws>.<name>`) to a canonical storage path,
+ * fetching the workspace index as needed.
+ */
+export declare function resolveDatasetPath(location: RepoLocation, pathSpec: string): Promise<ResolvedPath>;
+/**
+ * Return the candidates most similar to `target`, sorted best-first.
+ *
+ * Uses Levenshtein distance with a relative threshold so short typos near
+ * short names still match (e.g. `gret` → `greet`). Candidates with distance
+ * exceeding the threshold are filtered out.
+ */
+export declare function suggestSimilar(target: string, candidates: string[], max: number): string[];
+/** Standard Levenshtein edit distance. Exported for testing. */
+export declare function levenshtein(a: string, b: string): number;
+//# sourceMappingURL=path-resolver.d.ts.map

package/dist/src/path-resolver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"path-resolver.d.ts","sourceRoot":"","sources":["../../src/path-resolver.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;GAYG;AAEH,OAAO,EAGL,KAAK,QAAQ,EACd,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAEL,KAAK,SAAS,EACf,MAAM,wBAAwB,CAAC;AAGhC,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE/C,kCAAkC;AAClC,MAAM,MAAM,WAAW,GAAG,OAAO,GAAG,aAAa,GAAG,OAAO,CAAC;AAE5D,mDAAmD;AACnD,MAAM,WAAW,aAAa;IAC5B,kDAAkD;IAClD,IAAI,EAAE,MAAM,CAAC;IACb,wDAAwD;IACxD,OAAO,EAAE,QAAQ,CAAC;IAClB,gEAAgE;IAChE,IAAI,EAAE,WAAW,CAAC;CACnB;AAED,8CAA8C;AAC9C,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,4DAA4D;IAC5D,IAAI,EAAE,QAAQ,CAAC;IACf,oCAAoC;IACpC,IAAI,EAAE,WAAW,CAAC;CACnB;AAMD;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,aAAa,EAAE,CAE/D;AAED;;;;;GAKG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,aAAa,EAAE,CAW1E;AAED;;;;;;;GAOG;AACH,wBAAgB,2BAA2B,CACzC,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,aAAa,EAAE,GACrB,YAAY,CAqDd;AAMD;;;GAGG;AACH,wBAAsB,mBAAmB,CACvC,QAAQ,EAAE,YAAY,EACtB,EAAE,EAAE,MAAM,GACT,OAAO,CAAC,aAAa,EAAE,CAAC,CAe1B;AAED;;;GAGG;AACH,wBAAsB,kBAAkB,CACtC,QAAQ,EAAE,YAAY,EACtB,QAAQ,EAAE,MAAM,GACf,OAAO,CAAC,YAAY,CAAC,CAIvB;AAiFD;;;;;;GAMG;AACH,wBAAgB,cAAc,CAC5B,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,MAAM,EAAE,EACpB,GAAG,EAAE,MAAM,GACV,MAAM,EAAE,CAWV;AAED,gEAAgE;AAChE,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAsBxD"}

package/dist/src/path-resolver.js

@@ -0,0 +1,241 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Licensed under BSL 1.1. See LICENSE for details.
+ */
+/**
+ * Dataset path resolver.
+ *
+ * Users address datasets with the flat form `<ws>.<name>`. The on-disk storage
+ * uses `<ws>/inputs/<name>` for inputs and `<ws>/tasks/<name>/output` for task
+ * outputs. The resolver maps between them, consulting the workspace tree to
+ * discover which kind a name refers to.
+ *
+ * The async wrappers (`buildWorkspaceIndex`, `resolveDatasetPath`) fetch the
+ * workspace tree once per call. The pure helpers (`indexFromTree`,
+ * `indexFromRemoteEntries`, `resolveDatasetPathFromIndex`) take the index
+ * directly and are used by unit tests.
+ */
+import { workspaceGetTree, LocalStorage, } from '@elaraai/e3-core';
+import { datasetListRecursive, } from '@elaraai/e3-api-client';
+import { variant } from '@elaraai/east';
+import { parseDatasetPath } from '@elaraai/e3-types';
+// =============================================================================
+// Pure helpers (unit-testable without a repo)
+// =============================================================================
+/**
+ * Build an index from a workspace tree as returned by `workspaceGetTree`.
+ *
+ * Pure. Leaf nodes under `inputs/` become `kind: 'input'`. Leaf nodes under
+ * `tasks/` become `kind: 'task-output'` and the storage path gains the
+ * `output` suffix (because `workspaceGetTree` collapses task subtrees).
+ * Leaves elsewhere get `kind: 'other'` with a dotted name.
+ */
+export function indexFromTree(tree) {
+    return collectEntries(tree, []);
+}
+/**
+ * Build an index from remote `datasetListRecursive` entries.
+ *
+ * Pure. Each entry's path is a dot-separated string; same partitioning rules
+ * as `indexFromTree`.
+ */
+export function indexFromRemoteEntries(items) {
+    const out = [];
+    for (const item of items) {
+        if (item.type !== 'dataset')
+            continue;
+        const segments = item.value.path.split('.').filter((s) => s.length > 0);
+        if (segments.length === 0)
+            continue;
+        const name = segments[segments.length - 1];
+        const prefix = segments.slice(0, -1);
+        out.push(entryForLeaf(name, prefix));
+    }
+    return out;
+}
+/**
+ * Resolve a flat dataset path against a pre-built index.
+ *
+ * Pure. Implements the same rules as `resolveDatasetPath` but takes the
+ * index as a parameter so unit tests don't need a repo.
+ *
+ * @throws Error with suggestions when the name is unknown or ambiguous.
+ */
+export function resolveDatasetPathFromIndex(pathSpec, index) {
+    const { ws, path: parsed } = parseDatasetPath(pathSpec);
+    if (parsed.length === 0) {
+        throw new Error(`Path must include a name (e.g. '${ws}.<name>')`);
+    }
+    const head = String(parsed[0].value);
+    const rest = parsed.slice(1).map((s) => String(s.value));
+    // Detect tree paths (no sub-name given).
+    if ((head === 'inputs' || head === 'tasks') && rest.length === 0) {
+        throw new Error(`'${ws}.${head}' is a tree, not a dataset. Use '${ws}.<name>' to address a specific dataset.`);
+    }
+    // Detect legacy forms and reject with a friendly message.
+    if (head === 'inputs' && rest.length === 1) {
+        throw new Error(`Use the short form: '${ws}.${rest[0]}' instead of '${ws}.inputs.${rest[0]}'.`);
+    }
+    if (head === 'tasks' && rest.length === 2 && rest[1] === 'output') {
+        throw new Error(`Use the short form: '${ws}.${rest[0]}' instead of '${ws}.tasks.${rest[0]}.output'.`);
+    }
+    // Detect access to internal task datasets (e.g. tasks.double.function_ir) — not writable.
+    if (head === 'tasks' && rest.length >= 2 && rest[rest.length - 1] !== 'output') {
+        throw new Error(`'${ws}.tasks.${rest.join('.')}' is not writable. Only inputs and task outputs can be read or written.`);
+    }
+    const matches = index.filter((e) => e.name === head);
+    if (matches.length === 0) {
+        throw notFoundError(ws, head, index);
+    }
+    if (matches.length > 1) {
+        throw ambiguousError(ws, head, matches);
+    }
+    const match = matches[0];
+    if (rest.length > 0) {
+        throw new Error(`Nested field access ('${pathSpec}') is not supported; ` +
+            `read the full value with 'e3 dataset get ${ws}.${head}' and select the field.`);
+    }
+    return { ws, path: match.storage, kind: match.kind };
+}
+// =============================================================================
+// Async wrappers (fetch the tree, then delegate to pure helpers)
+// =============================================================================
+/**
+ * Fetch the workspace tree and build an index of every dataset reachable
+ * by its short name.
+ */
+export async function buildWorkspaceIndex(location, ws) {
+    if (location.type === 'local') {
+        const storage = new LocalStorage();
+        const tree = await workspaceGetTree(storage, location.path, ws, []);
+        return indexFromTree(tree);
+    }
+    const items = await datasetListRecursive(location.baseUrl, location.repo, ws, [], { token: location.token });
+    return indexFromRemoteEntries(items);
+}
+/**
+ * Resolve a flat dataset path (`<ws>.<name>`) to a canonical storage path,
+ * fetching the workspace index as needed.
+ */
+export async function resolveDatasetPath(location, pathSpec) {
+    const { ws } = parseDatasetPath(pathSpec);
+    const index = await buildWorkspaceIndex(location, ws);
+    return resolveDatasetPathFromIndex(pathSpec, index);
+}
+// =============================================================================
+// Internal helpers
+// =============================================================================
+function collectEntries(nodes, prefix) {
+    const out = [];
+    for (const node of nodes) {
+        if (node.kind === 'dataset') {
+            out.push(entryForLeaf(node.name, prefix));
+        }
+        else if (node.kind === 'tree') {
+            out.push(...collectEntries(node.children, [...prefix, node.name]));
+        }
+    }
+    return out;
+}
+function entryForLeaf(name, prefix) {
+    if (prefix.length === 1 && prefix[0] === 'tasks') {
+        return {
+            name,
+            kind: 'task-output',
+            storage: toTreePath(['tasks', name, 'output']),
+        };
+    }
+    // customTask outputs are stored as tasks/<taskName>/output (one level deeper)
+    if (prefix.length === 2 && prefix[0] === 'tasks' && name === 'output') {
+        const taskName = prefix[1];
+        return {
+            name: taskName,
+            kind: 'task-output',
+            storage: toTreePath(['tasks', taskName, 'output']),
+        };
+    }
+    if (prefix.length === 1 && prefix[0] === 'inputs') {
+        return {
+            name,
+            kind: 'input',
+            storage: toTreePath(['inputs', name]),
+        };
+    }
+    return {
+        name: [...prefix, name].join('.'),
+        kind: 'other',
+        storage: toTreePath([...prefix, name]),
+    };
+}
+function toTreePath(segments) {
+    return segments.map((s) => variant('field', s));
+}
+function notFoundError(ws, name, index) {
+    const suggestions = suggestSimilar(name, index.map((e) => e.name), 5);
+    let msg = `'${ws}.${name}' not found in workspace '${ws}'.`;
+    if (suggestions.length > 0) {
+        msg += ` Did you mean:\n`;
+        for (const s of suggestions) {
+            const entry = index.find((e) => e.name === s);
+            msg += `  ${ws}.${s}  (${entry.kind})\n`;
+        }
+        msg = msg.replace(/\n$/, '');
+    }
+    else if (index.length > 0) {
+        msg += ` Available names:\n`;
+        for (const e of index.slice(0, 10)) {
+            msg += `  ${ws}.${e.name}  (${e.kind})\n`;
+        }
+        if (index.length > 10)
+            msg += `  ... and ${index.length - 10} more`;
+        msg = msg.replace(/\n$/, '');
+    }
+    return new Error(msg);
+}
+function ambiguousError(ws, name, matches) {
+    const lines = matches.map((m) => `  ${ws}.${name}  (${m.kind})`);
+    return new Error(`'${ws}.${name}' is ambiguous. Multiple datasets share this name:\n${lines.join('\n')}`);
+}
+/**
+ * Return the candidates most similar to `target`, sorted best-first.
+ *
+ * Uses Levenshtein distance with a relative threshold so short typos near
+ * short names still match (e.g. `gret` → `greet`). Candidates with distance
+ * exceeding the threshold are filtered out.
+ */
+export function suggestSimilar(target, candidates, max) {
+    if (candidates.length === 0)
+        return [];
+    const scored = candidates
+        .map((c) => ({ c, d: levenshtein(target, c) }))
+        .sort((a, b) => a.d - b.d);
+    const threshold = Math.max(2, Math.floor(target.length / 2));
+    return scored
+        .filter((s) => s.d <= threshold)
+        .slice(0, max)
+        .map((s) => s.c);
+}
+/** Standard Levenshtein edit distance. Exported for testing. */
+export function levenshtein(a, b) {
+    if (a === b)
+        return 0;
+    if (a.length === 0)
+        return b.length;
+    if (b.length === 0)
+        return a.length;
+    const prev = new Array(b.length + 1);
+    const curr = new Array(b.length + 1);
+    for (let j = 0; j <= b.length; j++)
+        prev[j] = j;
+    for (let i = 1; i <= a.length; i++) {
+        curr[0] = i;
+        for (let j = 1; j <= b.length; j++) {
+            const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+            curr[j] = Math.min(prev[j] + 1, curr[j - 1] + 1, prev[j - 1] + cost);
+        }
+        for (let j = 0; j <= b.length; j++)
+            prev[j] = curr[j];
+    }
+    return prev[b.length];
+}
+//# sourceMappingURL=path-resolver.js.map

package/dist/src/path-resolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"path-resolver.js","sourceRoot":"","sources":["../../src/path-resolver.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;GAYG;AAEH,OAAO,EACL,gBAAgB,EAChB,YAAY,GAEb,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EACL,oBAAoB,GAErB,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACxC,OAAO,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AA0BrD,gFAAgF;AAChF,8CAA8C;AAC9C,gFAAgF;AAEhF;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAAC,IAAgB;IAC5C,OAAO,cAAc,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;AAClC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAkB;IACvD,MAAM,GAAG,GAAoB,EAAE,CAAC;IAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;YAAE,SAAS;QACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACpC,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;QAC5C,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,2BAA2B,CACzC,QAAgB,EAChB,KAAsB;IAEtB,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IAExD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,mCAAmC,EAAE,WAAW,CAAC,CAAC;IACpE,CAAC;IAED,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,CAAC;IACtC,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAEzD,yCAAyC;IACzC,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,OAAO,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjE,MAAM,IAAI,KAAK,CACb,IAAI,EAAE,IAAI,IAAI,oCAAoC,EAAE,yCAAyC,CAC9F,CAAC;IACJ,CAAC;IAED,0DAA0D;IAC1D,IAAI,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3C,MAAM,IAAI,KAAK,CACb,wBAAwB,EAAE,IAAI,IAAI,CAAC,CAAC,CAAE,iBAAiB,EAAE,WAAW,IAAI,CAAC,CAAC,CAAE,IAAI,CACjF,CAAC;IACJ,CAAC;IACD,IAAI,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,QAAQ,EAAE,CAAC;QAClE,MAAM,IAAI,KAAK,CACb,wBAAwB,EAAE,IAAI,IAAI,CAAC,CAAC,CAAE,iBAAiB,EAAE,UAAU,IAAI,CAAC,CAAC,CAAE,WAAW,CACvF,CAAC;IACJ,CAAC;IAED,0FAA0F;IAC1F,IAAI,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,QAAQ,EAAE,CAAC;QAC/E,MAAM,IAAI,KAAK,CACb,IAAI,EAAE,UAAU,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,yEAAyE,CACxG,CAAC;IACJ,CAAC;IAED,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IACrD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,aAAa,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IACvC,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,cAAc,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IAC1C,CAAC;IACD,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;IAE1B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpB,MAAM,IAAI,KAAK,CACb,yBAAyB,QAAQ,uBAAuB;YACtD,4CAA4C,EAAE,IAAI,IAAI,yBAAyB,CAClF,CAAC;IACJ,CAAC;IAED,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC;AACvD,CAAC;AAED,gFAAgF;AAChF,iEAAiE;AACjE,gFAAgF;AAEhF;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,QAAsB,EACtB,EAAU;IAEV,IAAI,QAAQ,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,IAAI,YAAY,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,MAAM,gBAAgB,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACpE,OAAO,aAAa,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,KAAK,GAAG,MAAM,oBAAoB,CACtC,QAAQ,CAAC,OAAO,EAChB,QAAQ,CAAC,IAAI,EACb,EAAE,EACF,EAAE,EACF,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,CAC1B,CAAC;IACF,OAAO,sBAAsB,CAAC,KAAK,CAAC,CAAC;AACvC,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,QAAsB,EACtB,QAAgB;IAEhB,MAAM,EAAE,EAAE,EAAE,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,MAAM,mBAAmB,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IACtD,OAAO,2BAA2B,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;AACtD,CAAC;AAED,gFAAgF;AAChF,mBAAmB;AACnB,gFAAgF;AAEhF,SAAS,cAAc,CAAC,KAAiB,EAAE,MAAgB;IACzD,MAAM,GAAG,GAAoB,EAAE,CAAC;IAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC5B,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;QAC5C,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YAChC,GAAG,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,YAAY,CAAC,IAAY,EAAE,MAAgB;IAClD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE,CAAC;QACjD,OAAO;YACL,IAAI;YACJ,IAAI,EAAE,aAAa;YACnB,OAAO,EAAE,UAAU,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;SAC/C,CAAC;IACJ,CAAC;IACD,8EAA8E;IAC9E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,OAAO,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;QACtE,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QAC5B,OAAO;YACL,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,aAAa;YACnB,OAAO,EAAE,UAAU,CAAC,CAAC,OAAO,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;SACnD,CAAC;IACJ,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,QAAQ,EAAE,CAAC;QAClD,OAAO;YACL,IAAI;YACJ,IAAI,EAAE,OAAO;YACb,OAAO,EAAE,UAAU,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;SACtC,CAAC;IACJ,CAAC;IACD,OAAO;QACL,IAAI,EAAE,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;QACjC,IAAI,EAAE,OAAO;QACb,OAAO,EAAE,UAAU,CAAC,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,CAAC;KACvC,CAAC;AACJ,CAAC;AAED,SAAS,UAAU,CAAC,QAAkB;IACpC,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;AAClD,CAAC;AAED,SAAS,aAAa,CAAC,EAAU,EAAE,IAAY,EAAE,KAAsB;IACrE,MAAM,WAAW,GAAG,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACtE,IAAI,GAAG,GAAG,IAAI,EAAE,IAAI,IAAI,6BAA6B,EAAE,IAAI,CAAC;IAC5D,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,GAAG,IAAI,kBAAkB,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAE,CAAC;YAC/C,GAAG,IAAI,KAAK,EAAE,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC;QAC3C,CAAC;QACD,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAC/B,CAAC;SAAM,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,GAAG,IAAI,qBAAqB,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YACnC,GAAG,IAAI,KAAK,EAAE,IAAI,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,IAAI,KAAK,CAAC;QAC5C,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,GAAG,EAAE;YAAE,GAAG,IAAI,aAAa,KAAK,CAAC,MAAM,GAAG,EAAE,OAAO,CAAC;QACpE,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC;AACxB,CAAC;AAED,SAAS,cAAc,CAAC,EAAU,EAAE,IAAY,EAAE,OAAwB;IACxE,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,EAAE,IAAI,IAAI,MAAM,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;IACjE,OAAO,IAAI,KAAK,CACd,IAAI,EAAE,IAAI,IAAI,uDAAuD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACxF,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAC5B,MAAc,EACd,UAAoB,EACpB,GAAW;IAEX,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACvC,MAAM,MAAM,GAAG,UAAU;SACtB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SAC9C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAE7B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7D,OAAO,MAAM;SACV,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC;SAC/B,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;SACb,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACrB,CAAC;AAED,gEAAgE;AAChE,MAAM,UAAU,WAAW,CAAC,CAAS,EAAE,CAAS;IAC9C,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,MAAM,CAAC;IACpC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,MAAM,CAAC;IAEpC,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC7C,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAEhD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAChB,IAAI,CAAC,CAAC,CAAE,GAAG,CAAC,EACZ,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,EAChB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,IAAI,CACpB,CAAC;QACJ,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;IACzD,CAAC;IACD,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC;AACzB,CAAC"}

package/dist/src/path-resolver.spec.d.ts

@@ -0,0 +1,6 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Licensed under BSL 1.1. See LICENSE for details.
+ */
+export {};
+//# sourceMappingURL=path-resolver.spec.d.ts.map

package/dist/src/path-resolver.spec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"path-resolver.spec.d.ts","sourceRoot":"","sources":["../../src/path-resolver.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG"}