@glassly/engine 0.1.0-dev.0

package/build/utils/display/wrapper/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../../src/utils/display/wrapper/types.ts"],"names":[],"mappings":"AA4FA;;GAEG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAwE;IACvG,SAAS,EAAE,qBAAqB;IAChC,UAAU,EAAE,GAAG;IACf,oBAAoB,EAAE,CAAC;IACvB,SAAS,EAAE,IAAI;IACf,gBAAgB,EAAE,IAAI;CACvB,CAAA","sourcesContent":["/**\n * Options for text wrapping.\n */\nexport interface WrapOptions {\n  /** Maximum width in pixels (defaults to profile's displayWidthPx) */\n  maxWidthPx?: number\n\n  /** Maximum number of lines (defaults to profile's maxLines) */\n  maxLines?: number\n\n  /** Maximum total bytes (defaults to profile's maxPayloadBytes) */\n  maxBytes?: number\n\n  /**\n   * Break mode:\n   * - 'character': Break mid-word with hyphen for 100% utilization\n   * - 'word': Break at word boundaries, hyphenate only if word > line\n   * - 'strict-word': Break at word boundaries only, truncate long words\n   */\n  breakMode?: BreakMode\n\n  /** Character to use for hyphenation (default: '-') */\n  hyphenChar?: string\n\n  /** Minimum characters before allowing hyphen break (default: 3) */\n  minCharsBeforeHyphen?: number\n\n  /** Whether to trim whitespace from line ends (default: true) */\n  trimLines?: boolean\n\n  /** Whether to preserve explicit newlines in input (default: true) */\n  preserveNewlines?: boolean\n}\n\n/**\n * Break mode for text wrapping.\n * - 'character': Break mid-word with hyphen for 100% utilization\n * - 'character-no-hyphen': Break mid-word without hyphen (clean break)\n * - 'word': Break at word boundaries, hyphenate only if word > line\n * - 'strict-word': Break at word boundaries only, truncate long words\n */\nexport type BreakMode = \"character\" | \"character-no-hyphen\" | \"word\" | \"strict-word\"\n\n/**\n * Result of wrapping operation.\n */\nexport interface WrapResult {\n  /** Wrapped lines */\n  lines: string[]\n\n  /** Whether content was truncated to fit constraints */\n  truncated: boolean\n\n  /** Total pixel width of widest line */\n  maxLineWidthPx: number\n\n  /** Total byte size of all lines */\n  totalBytes: number\n\n  /** Per-line metadata */\n  lineMetrics: LineMetrics[]\n\n  /** Original input text */\n  originalText: string\n\n  /** Break mode used */\n  breakMode: BreakMode\n}\n\n/**\n * Per-line metrics from wrapping.\n */\nexport interface LineMetrics {\n  /** The line text */\n  text: string\n\n  /** Width in pixels */\n  widthPx: number\n\n  /** Byte size of this line */\n  bytes: number\n\n  /** Utilization percentage (widthPx / maxWidthPx * 100) */\n  utilizationPercent: number\n\n  /** Whether this line ends with a hyphen from breaking */\n  endsWithHyphen: boolean\n\n  /** Whether this line was created from an explicit newline */\n  fromExplicitNewline: boolean\n}\n\n/**\n * Default wrap options.\n */\nexport const DEFAULT_WRAP_OPTIONS: Required<Omit<WrapOptions, \"maxWidthPx\" | \"maxLines\" | \"maxBytes\">> = {\n  breakMode: \"character-no-hyphen\",\n  hyphenChar: \"-\",\n  minCharsBeforeHyphen: 3,\n  trimLines: true,\n  preserveNewlines: true,\n}\n"]}

package/build/utils/e2eMetrics.d.ts

@@ -0,0 +1,6 @@
+export type E2EMetricPayload = Record<string, unknown>;
+export declare function e2eMetricsEnabled(): boolean;
+export declare function buildE2EMetric(event: string, payload?: E2EMetricPayload): E2EMetricPayload;
+export declare function logE2EMetricPayload(metric: E2EMetricPayload, failureLabel?: string): void;
+export declare function logE2EMetric(event: string, payload?: E2EMetricPayload): void;
+//# sourceMappingURL=e2eMetrics.d.ts.map

package/build/utils/e2eMetrics.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"e2eMetrics.d.ts","sourceRoot":"","sources":["../../src/utils/e2eMetrics.ts"],"names":[],"mappings":"AAEA,MAAM,MAAM,gBAAgB,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;AAEtD,wBAAgB,iBAAiB,IAAI,OAAO,CAE3C;AAED,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,gBAAqB,GAAG,gBAAgB,CAQ9F;AAED,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,gBAAgB,EAAE,YAAY,SAAY,GAAG,IAAI,CAO5F;AAED,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,gBAAqB,GAAG,IAAI,CAEhF"}

package/build/utils/e2eMetrics.js

@@ -0,0 +1,27 @@
+const E2E_METRIC_PREFIX = "E2E_METRIC";
+export function e2eMetricsEnabled() {
+    return process.env.EXPO_PUBLIC_ENABLE_E2E_METRICS === "true";
+}
+export function buildE2EMetric(event, payload = {}) {
+    // Payload first: the system-set `event` and `ts_ms` fields always win, so a
+    // caller-supplied collision can't mislabel or re-timestamp the metric.
+    return {
+        ...payload,
+        event,
+        ts_ms: Date.now(),
+    };
+}
+export function logE2EMetricPayload(metric, failureLabel = "payload") {
+    if (!e2eMetricsEnabled())
+        return;
+    try {
+        console.log(`${E2E_METRIC_PREFIX} ${JSON.stringify(metric)}`);
+    }
+    catch (error) {
+        console.warn(`E2E_METRIC: failed to serialize ${failureLabel}`, error);
+    }
+}
+export function logE2EMetric(event, payload = {}) {
+    logE2EMetricPayload(buildE2EMetric(event, payload), event);
+}
+//# sourceMappingURL=e2eMetrics.js.map

package/build/utils/e2eMetrics.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"e2eMetrics.js","sourceRoot":"","sources":["../../src/utils/e2eMetrics.ts"],"names":[],"mappings":"AAAA,MAAM,iBAAiB,GAAG,YAAY,CAAA;AAItC,MAAM,UAAU,iBAAiB;IAC/B,OAAO,OAAO,CAAC,GAAG,CAAC,8BAA8B,KAAK,MAAM,CAAA;AAC9D,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,KAAa,EAAE,UAA4B,EAAE;IAC1E,4EAA4E;IAC5E,uEAAuE;IACvE,OAAO;QACL,GAAG,OAAO;QACV,KAAK;QACL,KAAK,EAAE,IAAI,CAAC,GAAG,EAAE;KAClB,CAAA;AACH,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,MAAwB,EAAE,YAAY,GAAG,SAAS;IACpF,IAAI,CAAC,iBAAiB,EAAE;QAAE,OAAM;IAChC,IAAI,CAAC;QACH,OAAO,CAAC,GAAG,CAAC,GAAG,iBAAiB,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;IAC/D,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,IAAI,CAAC,mCAAmC,YAAY,EAAE,EAAE,KAAK,CAAC,CAAA;IACxE,CAAC;AACH,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,KAAa,EAAE,UAA4B,EAAE;IACxE,mBAAmB,CAAC,cAAc,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,KAAK,CAAC,CAAA;AAC5D,CAAC","sourcesContent":["const E2E_METRIC_PREFIX = \"E2E_METRIC\"\n\nexport type E2EMetricPayload = Record<string, unknown>\n\nexport function e2eMetricsEnabled(): boolean {\n  return process.env.EXPO_PUBLIC_ENABLE_E2E_METRICS === \"true\"\n}\n\nexport function buildE2EMetric(event: string, payload: E2EMetricPayload = {}): E2EMetricPayload {\n  // Payload first: the system-set `event` and `ts_ms` fields always win, so a\n  // caller-supplied collision can't mislabel or re-timestamp the metric.\n  return {\n    ...payload,\n    event,\n    ts_ms: Date.now(),\n  }\n}\n\nexport function logE2EMetricPayload(metric: E2EMetricPayload, failureLabel = \"payload\"): void {\n  if (!e2eMetricsEnabled()) return\n  try {\n    console.log(`${E2E_METRIC_PREFIX} ${JSON.stringify(metric)}`)\n  } catch (error) {\n    console.warn(`E2E_METRIC: failed to serialize ${failureLabel}`, error)\n  }\n}\n\nexport function logE2EMetric(event: string, payload: E2EMetricPayload = {}): void {\n  logE2EMetricPayload(buildE2EMetric(event, payload), event)\n}\n"]}

package/build/utils/hardware/hardware.d.ts

@@ -0,0 +1,42 @@
+import { Capabilities, HardwareRequirement } from "../../types";
+/**
+ * Result of a hardware compatibility check
+ */
+export interface CompatibilityResult {
+    isCompatible: boolean;
+    missingRequired: HardwareRequirement[];
+    missingOptional: HardwareRequirement[];
+    warnings: string[];
+}
+/**
+ * Service for checking hardware compatibility between apps and glasses
+ */
+export declare class HardwareCompatibility {
+    /**
+     * Check if app is compatible with given device capabilities
+     * @param app The app to check
+     * @param capabilities The device capabilities (null if no device connected)
+     * @returns Detailed compatibility result
+     */
+    static checkCompatibility(hardwareRequirements: HardwareRequirement[], capabilities: Capabilities | null): CompatibilityResult;
+    /**
+     * Check if specific hardware is available in capabilities
+     * @param hardwareType The type of hardware to check
+     * @param capabilities The device capabilities
+     * @returns true if hardware is available
+     */
+    private static checkHardwareAvailable;
+    /**
+     * Get human-readable compatibility message
+     * @param result The compatibility check result
+     * @returns User-friendly message about compatibility
+     */
+    static getCompatibilityMessage(result: CompatibilityResult): string;
+    /**
+     * Get detailed compatibility messages including descriptions
+     * @param result The compatibility check result
+     * @returns Array of detailed messages
+     */
+    static getDetailedMessages(result: CompatibilityResult): string[];
+}
+//# sourceMappingURL=hardware.d.ts.map

package/build/utils/hardware/hardware.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hardware.d.ts","sourceRoot":"","sources":["../../../src/utils/hardware/hardware.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,YAAY,EACZ,mBAAmB,EAKpB,MAAM,aAAa,CAAA;AAEpB;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,YAAY,EAAE,OAAO,CAAA;IACrB,eAAe,EAAE,mBAAmB,EAAE,CAAA;IACtC,eAAe,EAAE,mBAAmB,EAAE,CAAA;IACtC,QAAQ,EAAE,MAAM,EAAE,CAAA;CACnB;AAED;;GAEG;AACH,qBAAa,qBAAqB;IAChC;;;;;OAKG;IACH,MAAM,CAAC,kBAAkB,CACvB,oBAAoB,EAAE,mBAAmB,EAAE,EAC3C,YAAY,EAAE,YAAY,GAAG,IAAI,GAChC,mBAAmB;IAkCtB;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,sBAAsB;IA4CrC;;;;OAIG;IACH,MAAM,CAAC,uBAAuB,CAAC,MAAM,EAAE,mBAAmB,GAAG,MAAM;IAkBnE;;;;OAIG;IACH,MAAM,CAAC,mBAAmB,CAAC,MAAM,EAAE,mBAAmB,GAAG,MAAM,EAAE;CA0BlE"}

package/build/utils/hardware/hardware.js

@@ -0,0 +1,131 @@
+import { HardwareType, HardwareRequirementLevel, DeviceTypes, simulatedGlasses, } from "../../types";
+/**
+ * Service for checking hardware compatibility between apps and glasses
+ */
+export class HardwareCompatibility {
+    /**
+     * Check if app is compatible with given device capabilities
+     * @param app The app to check
+     * @param capabilities The device capabilities (null if no device connected)
+     * @returns Detailed compatibility result
+     */
+    static checkCompatibility(hardwareRequirements, capabilities) {
+        const result = {
+            isCompatible: true,
+            missingRequired: [],
+            missingOptional: [],
+            warnings: [],
+        };
+        // If no hardware requirements specified, app is compatible with any hardware
+        if (hardwareRequirements.length === 0) {
+            return result;
+        }
+        // If no capabilities available assume simulated glasses:
+        if (!capabilities) {
+            capabilities = simulatedGlasses;
+        }
+        // Check each hardware requirement
+        for (const requirement of hardwareRequirements) {
+            const hasHardware = this.checkHardwareAvailable(requirement.type, capabilities);
+            if (!hasHardware) {
+                if (requirement.level === HardwareRequirementLevel.REQUIRED) {
+                    result.missingRequired.push(requirement);
+                    result.isCompatible = false;
+                }
+                else {
+                    result.missingOptional.push(requirement);
+                }
+            }
+        }
+        return result;
+    }
+    /**
+     * Check if specific hardware is available in capabilities
+     * @param hardwareType The type of hardware to check
+     * @param capabilities The device capabilities
+     * @returns true if hardware is available
+     */
+    static checkHardwareAvailable(hardwareType, capabilities) {
+        if (hardwareType === HardwareType.EXIST) {
+            if (capabilities.modelName === DeviceTypes.NONE) {
+                return false;
+            }
+            return true;
+        }
+        switch (hardwareType) {
+            case HardwareType.CAMERA:
+                return capabilities.hasCamera;
+            case HardwareType.DISPLAY:
+                return capabilities.hasDisplay;
+            case HardwareType.MICROPHONE:
+                // GlasslyOS always provides an audio-input path. When the connected
+                // glasses do not have an onboard microphone, the engine falls back to
+                // the phone microphone. Keep `capabilities.hasMicrophone` reserved for
+                // physical-device/source selection; app compatibility is about whether
+                // the requested input is available to the miniapp.
+                return true;
+            case HardwareType.SPEAKER:
+                return capabilities.hasSpeaker;
+            case HardwareType.IMU:
+                return capabilities.hasIMU;
+            case HardwareType.BUTTON:
+                return capabilities.hasButton;
+            case HardwareType.LIGHT:
+                return capabilities.hasLight;
+            case HardwareType.WIFI:
+                return capabilities.hasWifi;
+            default:
+                // Unknown hardware type - assume not available
+                return false;
+        }
+    }
+    /**
+     * Get human-readable compatibility message
+     * @param result The compatibility check result
+     * @returns User-friendly message about compatibility
+     */
+    static getCompatibilityMessage(result) {
+        if (result.isCompatible) {
+            if (result.missingOptional.length > 0) {
+                const optionalHardware = result.missingOptional.map((req) => req.type.toLowerCase()).join(", ");
+                return `This app works with your glasses but has optional features that require: ${optionalHardware}`;
+            }
+            return "This app is fully compatible with your glasses";
+        }
+        const requiredHardware = result.missingRequired.map((req) => req.type.toLowerCase()).join(", ");
+        if (result.missingRequired.length === 1) {
+            return `This app requires a ${requiredHardware} which is not available on your connected glasses`;
+        }
+        else {
+            return `This app requires the following hardware which is not available on your connected glasses: ${requiredHardware}`;
+        }
+    }
+    /**
+     * Get detailed compatibility messages including descriptions
+     * @param result The compatibility check result
+     * @returns Array of detailed messages
+     */
+    static getDetailedMessages(result) {
+        const messages = [];
+        // Add warnings first
+        messages.push(...result.warnings);
+        // Add missing required hardware
+        for (const req of result.missingRequired) {
+            let message = `❌ Missing required ${req.type.toLowerCase()}`;
+            if (req.description) {
+                message += `: ${req.description}`;
+            }
+            messages.push(message);
+        }
+        // Add missing optional hardware
+        for (const req of result.missingOptional) {
+            let message = `⚠️ Missing optional ${req.type.toLowerCase()}`;
+            if (req.description) {
+                message += `: ${req.description}`;
+            }
+            messages.push(message);
+        }
+        return messages;
+    }
+}
+//# sourceMappingURL=hardware.js.map

package/build/utils/hardware/hardware.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hardware.js","sourceRoot":"","sources":["../../../src/utils/hardware/hardware.ts"],"names":[],"mappings":"AAAA,OAAO,EAGL,YAAY,EACZ,wBAAwB,EACxB,WAAW,EACX,gBAAgB,GACjB,MAAM,aAAa,CAAA;AAYpB;;GAEG;AACH,MAAM,OAAO,qBAAqB;IAChC;;;;;OAKG;IACH,MAAM,CAAC,kBAAkB,CACvB,oBAA2C,EAC3C,YAAiC;QAEjC,MAAM,MAAM,GAAwB;YAClC,YAAY,EAAE,IAAI;YAClB,eAAe,EAAE,EAAE;YACnB,eAAe,EAAE,EAAE;YACnB,QAAQ,EAAE,EAAE;SACb,CAAA;QAED,6EAA6E;QAC7E,IAAI,oBAAoB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtC,OAAO,MAAM,CAAA;QACf,CAAC;QAED,yDAAyD;QACzD,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,YAAY,GAAG,gBAAgB,CAAA;QACjC,CAAC;QAED,kCAAkC;QAClC,KAAK,MAAM,WAAW,IAAI,oBAAoB,EAAE,CAAC;YAC/C,MAAM,WAAW,GAAG,IAAI,CAAC,sBAAsB,CAAC,WAAW,CAAC,IAAI,EAAE,YAAa,CAAC,CAAA;YAChF,IAAI,CAAC,WAAW,EAAE,CAAC;gBACjB,IAAI,WAAW,CAAC,KAAK,KAAK,wBAAwB,CAAC,QAAQ,EAAE,CAAC;oBAC5D,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;oBACxC,MAAM,CAAC,YAAY,GAAG,KAAK,CAAA;gBAC7B,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAA;IACf,CAAC;IAED;;;;;OAKG;IACK,MAAM,CAAC,sBAAsB,CAAC,YAA0B,EAAE,YAA0B;QAC1F,IAAI,YAAY,KAAK,YAAY,CAAC,KAAK,EAAE,CAAC;YACxC,IAAI,YAAY,CAAC,SAAS,KAAK,WAAW,CAAC,IAAI,EAAE,CAAC;gBAChD,OAAO,KAAK,CAAA;YACd,CAAC;YACD,OAAO,IAAI,CAAA;QACb,CAAC;QAED,QAAQ,YAAY,EAAE,CAAC;YACrB,KAAK,YAAY,CAAC,MAAM;gBACtB,OAAO,YAAY,CAAC,SAAS,CAAA;YAE/B,KAAK,YAAY,CAAC,OAAO;gBACvB,OAAO,YAAY,CAAC,UAAU,CAAA;YAEhC,KAAK,YAAY,CAAC,UAAU;gBAC1B,oEAAoE;gBACpE,sEAAsE;gBACtE,uEAAuE;gBACvE,uEAAuE;gBACvE,mDAAmD;gBACnD,OAAO,IAAI,CAAA;YAEb,KAAK,YAAY,CAAC,OAAO;gBACvB,OAAO,YAAY,CAAC,UAAU,CAAA;YAEhC,KAAK,YAAY,CAAC,GAAG;gBACnB,OAAO,YAAY,CAAC,MAAM,CAAA;YAE5B,KAAK,YAAY,CAAC,MAAM;gBACtB,OAAO,YAAY,CAAC,SAAS,CAAA;YAE/B,KAAK,YAAY,CAAC,KAAK;gBACrB,OAAO,YAAY,CAAC,QAAQ,CAAA;YAE9B,KAAK,YAAY,CAAC,IAAI;gBACpB,OAAO,YAAY,CAAC,OAAO,CAAA;YAE7B;gBACE,+CAA+C;gBAC/C,OAAO,KAAK,CAAA;QAChB,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,uBAAuB,CAAC,MAA2B;QACxD,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;YACxB,IAAI,MAAM,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtC,MAAM,gBAAgB,GAAG,MAAM,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC/F,OAAO,4EAA4E,gBAAgB,EAAE,CAAA;YACvG,CAAC;YACD,OAAO,gDAAgD,CAAA;QACzD,CAAC;QAED,MAAM,gBAAgB,GAAG,MAAM,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAE/F,IAAI,MAAM,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxC,OAAO,uBAAuB,gBAAgB,mDAAmD,CAAA;QACnG,CAAC;aAAM,CAAC;YACN,OAAO,8FAA8F,gBAAgB,EAAE,CAAA;QACzH,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,mBAAmB,CAAC,MAA2B;QACpD,MAAM,QAAQ,GAAa,EAAE,CAAA;QAE7B,qBAAqB;QACrB,QAAQ,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAA;QAEjC,gCAAgC;QAChC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,eAAe,EAAE,CAAC;YACzC,IAAI,OAAO,GAAG,sBAAsB,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAA;YAC5D,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;gBACpB,OAAO,IAAI,KAAK,GAAG,CAAC,WAAW,EAAE,CAAA;YACnC,CAAC;YACD,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QACxB,CAAC;QAED,gCAAgC;QAChC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,eAAe,EAAE,CAAC;YACzC,IAAI,OAAO,GAAG,uBAAuB,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAA;YAC7D,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;gBACpB,OAAO,IAAI,KAAK,GAAG,CAAC,WAAW,EAAE,CAAA;YACnC,CAAC;YACD,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QACxB,CAAC;QAED,OAAO,QAAQ,CAAA;IACjB,CAAC;CACF","sourcesContent":["import {\n  Capabilities,\n  HardwareRequirement,\n  HardwareType,\n  HardwareRequirementLevel,\n  DeviceTypes,\n  simulatedGlasses,\n} from \"../../types\"\n\n/**\n * Result of a hardware compatibility check\n */\nexport interface CompatibilityResult {\n  isCompatible: boolean\n  missingRequired: HardwareRequirement[]\n  missingOptional: HardwareRequirement[]\n  warnings: string[]\n}\n\n/**\n * Service for checking hardware compatibility between apps and glasses\n */\nexport class HardwareCompatibility {\n  /**\n   * Check if app is compatible with given device capabilities\n   * @param app The app to check\n   * @param capabilities The device capabilities (null if no device connected)\n   * @returns Detailed compatibility result\n   */\n  static checkCompatibility(\n    hardwareRequirements: HardwareRequirement[],\n    capabilities: Capabilities | null,\n  ): CompatibilityResult {\n    const result: CompatibilityResult = {\n      isCompatible: true,\n      missingRequired: [],\n      missingOptional: [],\n      warnings: [],\n    }\n\n    // If no hardware requirements specified, app is compatible with any hardware\n    if (hardwareRequirements.length === 0) {\n      return result\n    }\n\n    // If no capabilities available assume simulated glasses:\n    if (!capabilities) {\n      capabilities = simulatedGlasses\n    }\n\n    // Check each hardware requirement\n    for (const requirement of hardwareRequirements) {\n      const hasHardware = this.checkHardwareAvailable(requirement.type, capabilities!)\n      if (!hasHardware) {\n        if (requirement.level === HardwareRequirementLevel.REQUIRED) {\n          result.missingRequired.push(requirement)\n          result.isCompatible = false\n        } else {\n          result.missingOptional.push(requirement)\n        }\n      }\n    }\n\n    return result\n  }\n\n  /**\n   * Check if specific hardware is available in capabilities\n   * @param hardwareType The type of hardware to check\n   * @param capabilities The device capabilities\n   * @returns true if hardware is available\n   */\n  private static checkHardwareAvailable(hardwareType: HardwareType, capabilities: Capabilities): boolean {\n    if (hardwareType === HardwareType.EXIST) {\n      if (capabilities.modelName === DeviceTypes.NONE) {\n        return false\n      }\n      return true\n    }\n\n    switch (hardwareType) {\n      case HardwareType.CAMERA:\n        return capabilities.hasCamera\n\n      case HardwareType.DISPLAY:\n        return capabilities.hasDisplay\n\n      case HardwareType.MICROPHONE:\n        // GlasslyOS always provides an audio-input path. When the connected\n        // glasses do not have an onboard microphone, the engine falls back to\n        // the phone microphone. Keep `capabilities.hasMicrophone` reserved for\n        // physical-device/source selection; app compatibility is about whether\n        // the requested input is available to the miniapp.\n        return true\n\n      case HardwareType.SPEAKER:\n        return capabilities.hasSpeaker\n\n      case HardwareType.IMU:\n        return capabilities.hasIMU\n\n      case HardwareType.BUTTON:\n        return capabilities.hasButton\n\n      case HardwareType.LIGHT:\n        return capabilities.hasLight\n\n      case HardwareType.WIFI:\n        return capabilities.hasWifi\n\n      default:\n        // Unknown hardware type - assume not available\n        return false\n    }\n  }\n\n  /**\n   * Get human-readable compatibility message\n   * @param result The compatibility check result\n   * @returns User-friendly message about compatibility\n   */\n  static getCompatibilityMessage(result: CompatibilityResult): string {\n    if (result.isCompatible) {\n      if (result.missingOptional.length > 0) {\n        const optionalHardware = result.missingOptional.map((req) => req.type.toLowerCase()).join(\", \")\n        return `This app works with your glasses but has optional features that require: ${optionalHardware}`\n      }\n      return \"This app is fully compatible with your glasses\"\n    }\n\n    const requiredHardware = result.missingRequired.map((req) => req.type.toLowerCase()).join(\", \")\n\n    if (result.missingRequired.length === 1) {\n      return `This app requires a ${requiredHardware} which is not available on your connected glasses`\n    } else {\n      return `This app requires the following hardware which is not available on your connected glasses: ${requiredHardware}`\n    }\n  }\n\n  /**\n   * Get detailed compatibility messages including descriptions\n   * @param result The compatibility check result\n   * @returns Array of detailed messages\n   */\n  static getDetailedMessages(result: CompatibilityResult): string[] {\n    const messages: string[] = []\n\n    // Add warnings first\n    messages.push(...result.warnings)\n\n    // Add missing required hardware\n    for (const req of result.missingRequired) {\n      let message = `❌ Missing required ${req.type.toLowerCase()}`\n      if (req.description) {\n        message += `: ${req.description}`\n      }\n      messages.push(message)\n    }\n\n    // Add missing optional hardware\n    for (const req of result.missingOptional) {\n      let message = `⚠️ Missing optional ${req.type.toLowerCase()}`\n      if (req.description) {\n        message += `: ${req.description}`\n      }\n      messages.push(message)\n    }\n\n    return messages\n  }\n}\n"]}

package/build/utils/hardware/index.d.ts

@@ -0,0 +1,2 @@
+export * from "./hardware";
+//# sourceMappingURL=index.d.ts.map

package/build/utils/hardware/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/utils/hardware/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAA"}

package/build/utils/hardware/index.js

@@ -0,0 +1,2 @@
+export * from "./hardware";
+//# sourceMappingURL=index.js.map

package/build/utils/hardware/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/utils/hardware/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAA","sourcesContent":["export * from \"./hardware\"\n"]}

package/build/utils/memory/search.d.ts

@@ -0,0 +1,72 @@
+/**
+ * Pure memory-timeline search — the matching engine behind MemoryStore.query
+ * and the assistant's get_transcripts tool.
+ *
+ * Lives outside MemoryStore so it is unit-testable and importable by the
+ * assistant's eval harness (which replays the exact host semantics against a
+ * mock corpus). Keep it dependency-free and runtime-neutral: it also runs
+ * under bun for tests.
+ *
+ * TWO MATCH MODES, deliberately different:
+ *  - `contains`: exact case-insensitive substring — the pre-existing contract,
+ *    kept verbatim for callers that need precision (codes, URLs, exact phrases).
+ *  - `terms`: ANY-of term matching with per-word fuzziness. Speech-to-text
+ *    mangles proper nouns ("Sompo" for "Sampo", "Korwin" for "Corwin"), so a
+ *    term word matches a transcript token on exact/substring, small edit
+ *    distance, OR same Soundex key. A multi-word term ("ring size") requires
+ *    all of its words to match somewhere in the entry.
+ *
+ * The scan walks BACKWARDS from the newest in-window entry and stops at
+ * `limit` matches: the caller keeps the most recent matches anyway, and the
+ * common "last 90 minutes" query then touches dozens of entries instead of
+ * the full 4000-entry timeline. Window bounds are found by binary search on
+ * `at` (the timeline is maintained time-sorted).
+ */
+export interface MemorySearchableEntry {
+    text: string;
+    at: number;
+}
+export interface MemorySearchQuery {
+    /** Epoch ms lower bound (inclusive). */
+    sinceMs?: number;
+    /** Epoch ms upper bound (inclusive). */
+    untilMs?: number;
+    /** Exact case-insensitive substring filter. */
+    contains?: string;
+    /** Fuzzy any-of terms (see file header). Combined with `contains` as AND. */
+    terms?: string[];
+    /** Max matches kept (newest win). Caller enforces its own cap. */
+    limit: number;
+}
+export interface MemorySearchResult<T> {
+    /** Matches in chronological order (newest last), at most `limit`. */
+    entries: T[];
+    /**
+     * Entries inside the TIME window before keyword filtering. Lets the caller
+     * tell "keyword matched nothing" apart from "window itself is empty" — the
+     * distinction that saves an LLM a blind retry round.
+     */
+    windowCount: number;
+}
+export declare function searchMemoryEntries<T extends MemorySearchableEntry>(entries: readonly T[], q: MemorySearchQuery): MemorySearchResult<T>;
+/**
+ * Does query word `w` match transcript token `t`?
+ *  - exact, or substring for w of 3+ chars ("kestrel" in "kestrels")
+ *  - for words of 5+ chars: bounded edit distance (1, or 2 for 7+ chars)
+ *    — catches one-vowel STT swaps ("sompo"/"sampo", "korwin"/"corwin").
+ *    5 is the floor because at 4 chars a one-edit radius swallows unrelated
+ *    common words ("code"→"mode"); mistranscribed NAMES are almost always 5+.
+ *  - same Soundex key with similar length — catches phonetic respellings that
+ *    edit distance misses ("warryn"/"warren" style doublings)
+ */
+export declare function fuzzyWordMatch(w: string, t: string): boolean;
+/** Lowercase, strip diacritics, split on non-alphanumerics. */
+export declare function tokenize(text: string): string[];
+/**
+ * Optimal-string-alignment edit distance, early-exited: returns whether
+ * dist(a, b) <= max. Transpositions count as one edit (common in STT output).
+ */
+export declare function editDistanceAtMost(a: string, b: string, max: number): boolean;
+/** Classic Soundex. Empty input returns "". */
+export declare function soundex(word: string): string;
+//# sourceMappingURL=search.d.ts.map

package/build/utils/memory/search.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../../../src/utils/memory/search.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,MAAM,WAAW,qBAAqB;IACpC,IAAI,EAAE,MAAM,CAAA;IACZ,EAAE,EAAE,MAAM,CAAA;CACX;AAED,MAAM,WAAW,iBAAiB;IAChC,wCAAwC;IACxC,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,wCAAwC;IACxC,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,+CAA+C;IAC/C,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,6EAA6E;IAC7E,KAAK,CAAC,EAAE,MAAM,EAAE,CAAA;IAChB,kEAAkE;IAClE,KAAK,EAAE,MAAM,CAAA;CACd;AAED,MAAM,WAAW,kBAAkB,CAAC,CAAC;IACnC,qEAAqE;IACrE,OAAO,EAAE,CAAC,EAAE,CAAA;IACZ;;;;OAIG;IACH,WAAW,EAAE,MAAM,CAAA;CACpB;AAKD,wBAAgB,mBAAmB,CAAC,CAAC,SAAS,qBAAqB,EACjE,OAAO,EAAE,SAAS,CAAC,EAAE,EACrB,CAAC,EAAE,iBAAiB,GACnB,kBAAkB,CAAC,CAAC,CAAC,CAqBvB;AAkBD;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAO5D;AAED,+DAA+D;AAC/D,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAO/C;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAqB7E;AAWD,+CAA+C;AAC/C,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAc5C"}

package/build/utils/memory/search.js

@@ -0,0 +1,178 @@
+/**
+ * Pure memory-timeline search — the matching engine behind MemoryStore.query
+ * and the assistant's get_transcripts tool.
+ *
+ * Lives outside MemoryStore so it is unit-testable and importable by the
+ * assistant's eval harness (which replays the exact host semantics against a
+ * mock corpus). Keep it dependency-free and runtime-neutral: it also runs
+ * under bun for tests.
+ *
+ * TWO MATCH MODES, deliberately different:
+ *  - `contains`: exact case-insensitive substring — the pre-existing contract,
+ *    kept verbatim for callers that need precision (codes, URLs, exact phrases).
+ *  - `terms`: ANY-of term matching with per-word fuzziness. Speech-to-text
+ *    mangles proper nouns ("Sompo" for "Sampo", "Korwin" for "Corwin"), so a
+ *    term word matches a transcript token on exact/substring, small edit
+ *    distance, OR same Soundex key. A multi-word term ("ring size") requires
+ *    all of its words to match somewhere in the entry.
+ *
+ * The scan walks BACKWARDS from the newest in-window entry and stops at
+ * `limit` matches: the caller keeps the most recent matches anyway, and the
+ * common "last 90 minutes" query then touches dozens of entries instead of
+ * the full 4000-entry timeline. Window bounds are found by binary search on
+ * `at` (the timeline is maintained time-sorted).
+ */
+/** Tokenized lowercase text per entry, cached for the entry object's lifetime. */
+const tokenCache = new WeakMap();
+export function searchMemoryEntries(entries, q) {
+    const since = q.sinceMs ?? 0;
+    const until = q.untilMs ?? Number.MAX_SAFE_INTEGER;
+    const lo = lowerBound(entries, since);
+    const hi = upperBound(entries, until); // exclusive
+    const windowCount = Math.max(0, hi - lo);
+    const needle = q.contains?.trim().toLowerCase() || null;
+    const termWords = (q.terms ?? [])
+        .map((t) => tokenize(t))
+        .filter((words) => words.length > 0);
+    const picked = [];
+    for (let i = hi - 1; i >= lo && picked.length < q.limit; i--) {
+        const e = entries[i];
+        if (needle && !e.text.toLowerCase().includes(needle))
+            continue;
+        if (termWords.length > 0 && !matchesAnyTerm(e, termWords))
+            continue;
+        picked.push(e);
+    }
+    picked.reverse();
+    return { entries: picked, windowCount };
+}
+/** True when any term matches — a term matches iff ALL its words match a token. */
+function matchesAnyTerm(entry, termWords) {
+    let tokens = tokenCache.get(entry);
+    if (!tokens) {
+        tokens = tokenize(entry.text);
+        tokenCache.set(entry, tokens);
+    }
+    outer: for (const words of termWords) {
+        for (const word of words) {
+            if (!tokens.some((tok) => fuzzyWordMatch(word, tok)))
+                continue outer;
+        }
+        return true;
+    }
+    return false;
+}
+/**
+ * Does query word `w` match transcript token `t`?
+ *  - exact, or substring for w of 3+ chars ("kestrel" in "kestrels")
+ *  - for words of 5+ chars: bounded edit distance (1, or 2 for 7+ chars)
+ *    — catches one-vowel STT swaps ("sompo"/"sampo", "korwin"/"corwin").
+ *    5 is the floor because at 4 chars a one-edit radius swallows unrelated
+ *    common words ("code"→"mode"); mistranscribed NAMES are almost always 5+.
+ *  - same Soundex key with similar length — catches phonetic respellings that
+ *    edit distance misses ("warryn"/"warren" style doublings)
+ */
+export function fuzzyWordMatch(w, t) {
+    if (w === t)
+        return true;
+    if (w.length >= 3 && t.includes(w))
+        return true;
+    if (w.length < 5 || t.length < 4)
+        return false;
+    const maxDist = w.length >= 7 ? 2 : 1;
+    if (Math.abs(w.length - t.length) <= maxDist && editDistanceAtMost(w, t, maxDist))
+        return true;
+    return Math.abs(w.length - t.length) <= 2 && soundex(w) === soundex(t);
+}
+/** Lowercase, strip diacritics, split on non-alphanumerics. */
+export function tokenize(text) {
+    return text
+        .toLowerCase()
+        .normalize("NFD")
+        .replace(/[\u0300-\u036f]/g, "")
+        .split(/[^a-z0-9]+/)
+        .filter((t) => t.length > 0);
+}
+/**
+ * Optimal-string-alignment edit distance, early-exited: returns whether
+ * dist(a, b) <= max. Transpositions count as one edit (common in STT output).
+ */
+export function editDistanceAtMost(a, b, max) {
+    if (Math.abs(a.length - b.length) > max)
+        return false;
+    let prev2 = null;
+    let prev = Array.from({ length: b.length + 1 }, (_, j) => j);
+    for (let i = 1; i <= a.length; i++) {
+        const cur = [i];
+        let rowMin = i;
+        for (let j = 1; j <= b.length; j++) {
+            const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+            let v = Math.min(prev[j] + 1, cur[j - 1] + 1, prev[j - 1] + cost);
+            if (prev2 && i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {
+                v = Math.min(v, prev2[j - 2] + 1);
+            }
+            cur.push(v);
+            if (v < rowMin)
+                rowMin = v;
+        }
+        if (rowMin > max)
+            return false;
+        prev2 = prev;
+        prev = cur;
+    }
+    return prev[b.length] <= max;
+}
+const SOUNDEX_CODES = {
+    b: "1", f: "1", p: "1", v: "1",
+    c: "2", g: "2", j: "2", k: "2", q: "2", s: "2", x: "2", z: "2",
+    d: "3", t: "3",
+    l: "4",
+    m: "5", n: "5",
+    r: "6",
+};
+/** Classic Soundex. Empty input returns "". */
+export function soundex(word) {
+    const w = word.toLowerCase().replace(/[^a-z]/g, "");
+    if (!w)
+        return "";
+    let out = w[0].toUpperCase();
+    let lastCode = SOUNDEX_CODES[w[0]] ?? "";
+    for (let i = 1; i < w.length && out.length < 4; i++) {
+        const ch = w[i];
+        const code = SOUNDEX_CODES[ch] ?? "";
+        // h/w are transparent: they don't reset the adjacent-duplicate rule.
+        if (ch === "h" || ch === "w")
+            continue;
+        if (code && code !== lastCode)
+            out += code;
+        lastCode = code;
+    }
+    return out.padEnd(4, "0");
+}
+/** First index with at >= value (entries time-sorted ascending). */
+function lowerBound(entries, value) {
+    let lo = 0;
+    let hi = entries.length;
+    while (lo < hi) {
+        const mid = (lo + hi) >> 1;
+        if (entries[mid].at < value)
+            lo = mid + 1;
+        else
+            hi = mid;
+    }
+    return lo;
+}
+/** First index with at > value (i.e. exclusive end for an inclusive bound). */
+function upperBound(entries, value) {
+    let lo = 0;
+    let hi = entries.length;
+    while (lo < hi) {
+        const mid = (lo + hi) >> 1;
+        if (entries[mid].at <= value)
+            lo = mid + 1;
+        else
+            hi = mid;
+    }
+    return lo;
+}
+//# sourceMappingURL=search.js.map

package/build/utils/memory/search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search.js","sourceRoot":"","sources":["../../../src/utils/memory/search.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AA+BH,kFAAkF;AAClF,MAAM,UAAU,GAAG,IAAI,OAAO,EAAoB,CAAA;AAElD,MAAM,UAAU,mBAAmB,CACjC,OAAqB,EACrB,CAAoB;IAEpB,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,CAAA;IAC5B,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,IAAI,MAAM,CAAC,gBAAgB,CAAA;IAClD,MAAM,EAAE,GAAG,UAAU,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;IACrC,MAAM,EAAE,GAAG,UAAU,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA,CAAC,YAAY;IAClD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAA;IAExC,MAAM,MAAM,GAAG,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,WAAW,EAAE,IAAI,IAAI,CAAA;IACvD,MAAM,SAAS,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;SAC9B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;SACvB,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAEtC,MAAM,MAAM,GAAQ,EAAE,CAAA;IACtB,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7D,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;QACpB,IAAI,MAAM,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC;YAAE,SAAQ;QAC9D,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,SAAS,CAAC;YAAE,SAAQ;QACnE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAChB,CAAC;IACD,MAAM,CAAC,OAAO,EAAE,CAAA;IAChB,OAAO,EAAC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAC,CAAA;AACvC,CAAC;AAED,mFAAmF;AACnF,SAAS,cAAc,CAAC,KAA4B,EAAE,SAAqB;IACzE,IAAI,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IAClC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QAC7B,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;IAC/B,CAAC;IACD,KAAK,EAAE,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBAAE,SAAS,KAAK,CAAA;QACtE,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,cAAc,CAAC,CAAS,EAAE,CAAS;IACjD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IACxB,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,IAAI,CAAA;IAC/C,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,KAAK,CAAA;IAC9C,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACrC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,OAAO,IAAI,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC;QAAE,OAAO,IAAI,CAAA;IAC9F,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;AACxE,CAAC;AAED,+DAA+D;AAC/D,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,OAAO,IAAI;SACR,WAAW,EAAE;SACb,SAAS,CAAC,KAAK,CAAC;SAChB,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC;SAC/B,KAAK,CAAC,YAAY,CAAC;SACnB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;AAChC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAS,EAAE,CAAS,EAAE,GAAW;IAClE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,GAAG;QAAE,OAAO,KAAK,CAAA;IACrD,IAAI,KAAK,GAAoB,IAAI,CAAA;IACjC,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAC,MAAM,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,EAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAA;IAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAA;QACf,IAAI,MAAM,GAAG,CAAC,CAAA;QACd,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,CAAA;YAC1C,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAA;YACjE,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAC9E,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YACnC,CAAC;YACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACX,IAAI,CAAC,GAAG,MAAM;gBAAE,MAAM,GAAG,CAAC,CAAA;QAC5B,CAAC;QACD,IAAI,MAAM,GAAG,GAAG;YAAE,OAAO,KAAK,CAAA;QAC9B,KAAK,GAAG,IAAI,CAAA;QACZ,IAAI,GAAG,GAAG,CAAA;IACZ,CAAC;IACD,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,CAAA;AAC9B,CAAC;AAED,MAAM,aAAa,GAA2B;IAC5C,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG;IAC9B,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG;IAC9D,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG;IACd,CAAC,EAAE,GAAG;IACN,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG;IACd,CAAC,EAAE,GAAG;CACP,CAAA;AAED,+CAA+C;AAC/C,MAAM,UAAU,OAAO,CAAC,IAAY;IAClC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAA;IACnD,IAAI,CAAC,CAAC;QAAE,OAAO,EAAE,CAAA;IACjB,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAA;IAC5B,IAAI,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACpD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACf,MAAM,IAAI,GAAG,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;QACpC,qEAAqE;QACrE,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG;YAAE,SAAQ;QACtC,IAAI,IAAI,IAAI,IAAI,KAAK,QAAQ;YAAE,GAAG,IAAI,IAAI,CAAA;QAC1C,QAAQ,GAAG,IAAI,CAAA;IACjB,CAAC;IACD,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;AAC3B,CAAC;AAED,oEAAoE;AACpE,SAAS,UAAU,CAAC,OAAyC,EAAE,KAAa;IAC1E,IAAI,EAAE,GAAG,CAAC,CAAA;IACV,IAAI,EAAE,GAAG,OAAO,CAAC,MAAM,CAAA;IACvB,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAA;QAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK;YAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAA;;YACpC,EAAE,GAAG,GAAG,CAAA;IACf,CAAC;IACD,OAAO,EAAE,CAAA;AACX,CAAC;AAED,+EAA+E;AAC/E,SAAS,UAAU,CAAC,OAAyC,EAAE,KAAa;IAC1E,IAAI,EAAE,GAAG,CAAC,CAAA;IACV,IAAI,EAAE,GAAG,OAAO,CAAC,MAAM,CAAA;IACvB,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAA;QAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,KAAK;YAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAA;;YACrC,EAAE,GAAG,GAAG,CAAA;IACf,CAAC;IACD,OAAO,EAAE,CAAA;AACX,CAAC","sourcesContent":["/**\n * Pure memory-timeline search — the matching engine behind MemoryStore.query\n * and the assistant's get_transcripts tool.\n *\n * Lives outside MemoryStore so it is unit-testable and importable by the\n * assistant's eval harness (which replays the exact host semantics against a\n * mock corpus). Keep it dependency-free and runtime-neutral: it also runs\n * under bun for tests.\n *\n * TWO MATCH MODES, deliberately different:\n *  - `contains`: exact case-insensitive substring — the pre-existing contract,\n *    kept verbatim for callers that need precision (codes, URLs, exact phrases).\n *  - `terms`: ANY-of term matching with per-word fuzziness. Speech-to-text\n *    mangles proper nouns (\"Sompo\" for \"Sampo\", \"Korwin\" for \"Corwin\"), so a\n *    term word matches a transcript token on exact/substring, small edit\n *    distance, OR same Soundex key. A multi-word term (\"ring size\") requires\n *    all of its words to match somewhere in the entry.\n *\n * The scan walks BACKWARDS from the newest in-window entry and stops at\n * `limit` matches: the caller keeps the most recent matches anyway, and the\n * common \"last 90 minutes\" query then touches dozens of entries instead of\n * the full 4000-entry timeline. Window bounds are found by binary search on\n * `at` (the timeline is maintained time-sorted).\n */\n\nexport interface MemorySearchableEntry {\n  text: string\n  at: number\n}\n\nexport interface MemorySearchQuery {\n  /** Epoch ms lower bound (inclusive). */\n  sinceMs?: number\n  /** Epoch ms upper bound (inclusive). */\n  untilMs?: number\n  /** Exact case-insensitive substring filter. */\n  contains?: string\n  /** Fuzzy any-of terms (see file header). Combined with `contains` as AND. */\n  terms?: string[]\n  /** Max matches kept (newest win). Caller enforces its own cap. */\n  limit: number\n}\n\nexport interface MemorySearchResult<T> {\n  /** Matches in chronological order (newest last), at most `limit`. */\n  entries: T[]\n  /**\n   * Entries inside the TIME window before keyword filtering. Lets the caller\n   * tell \"keyword matched nothing\" apart from \"window itself is empty\" — the\n   * distinction that saves an LLM a blind retry round.\n   */\n  windowCount: number\n}\n\n/** Tokenized lowercase text per entry, cached for the entry object's lifetime. */\nconst tokenCache = new WeakMap<object, string[]>()\n\nexport function searchMemoryEntries<T extends MemorySearchableEntry>(\n  entries: readonly T[],\n  q: MemorySearchQuery,\n): MemorySearchResult<T> {\n  const since = q.sinceMs ?? 0\n  const until = q.untilMs ?? Number.MAX_SAFE_INTEGER\n  const lo = lowerBound(entries, since)\n  const hi = upperBound(entries, until) // exclusive\n  const windowCount = Math.max(0, hi - lo)\n\n  const needle = q.contains?.trim().toLowerCase() || null\n  const termWords = (q.terms ?? [])\n    .map((t) => tokenize(t))\n    .filter((words) => words.length > 0)\n\n  const picked: T[] = []\n  for (let i = hi - 1; i >= lo && picked.length < q.limit; i--) {\n    const e = entries[i]\n    if (needle && !e.text.toLowerCase().includes(needle)) continue\n    if (termWords.length > 0 && !matchesAnyTerm(e, termWords)) continue\n    picked.push(e)\n  }\n  picked.reverse()\n  return {entries: picked, windowCount}\n}\n\n/** True when any term matches — a term matches iff ALL its words match a token. */\nfunction matchesAnyTerm(entry: MemorySearchableEntry, termWords: string[][]): boolean {\n  let tokens = tokenCache.get(entry)\n  if (!tokens) {\n    tokens = tokenize(entry.text)\n    tokenCache.set(entry, tokens)\n  }\n  outer: for (const words of termWords) {\n    for (const word of words) {\n      if (!tokens.some((tok) => fuzzyWordMatch(word, tok))) continue outer\n    }\n    return true\n  }\n  return false\n}\n\n/**\n * Does query word `w` match transcript token `t`?\n *  - exact, or substring for w of 3+ chars (\"kestrel\" in \"kestrels\")\n *  - for words of 5+ chars: bounded edit distance (1, or 2 for 7+ chars)\n *    — catches one-vowel STT swaps (\"sompo\"/\"sampo\", \"korwin\"/\"corwin\").\n *    5 is the floor because at 4 chars a one-edit radius swallows unrelated\n *    common words (\"code\"→\"mode\"); mistranscribed NAMES are almost always 5+.\n *  - same Soundex key with similar length — catches phonetic respellings that\n *    edit distance misses (\"warryn\"/\"warren\" style doublings)\n */\nexport function fuzzyWordMatch(w: string, t: string): boolean {\n  if (w === t) return true\n  if (w.length >= 3 && t.includes(w)) return true\n  if (w.length < 5 || t.length < 4) return false\n  const maxDist = w.length >= 7 ? 2 : 1\n  if (Math.abs(w.length - t.length) <= maxDist && editDistanceAtMost(w, t, maxDist)) return true\n  return Math.abs(w.length - t.length) <= 2 && soundex(w) === soundex(t)\n}\n\n/** Lowercase, strip diacritics, split on non-alphanumerics. */\nexport function tokenize(text: string): string[] {\n  return text\n    .toLowerCase()\n    .normalize(\"NFD\")\n    .replace(/[\\u0300-\\u036f]/g, \"\")\n    .split(/[^a-z0-9]+/)\n    .filter((t) => t.length > 0)\n}\n\n/**\n * Optimal-string-alignment edit distance, early-exited: returns whether\n * dist(a, b) <= max. Transpositions count as one edit (common in STT output).\n */\nexport function editDistanceAtMost(a: string, b: string, max: number): boolean {\n  if (Math.abs(a.length - b.length) > max) return false\n  let prev2: number[] | null = null\n  let prev = Array.from({length: b.length + 1}, (_, j) => j)\n  for (let i = 1; i <= a.length; i++) {\n    const cur = [i]\n    let rowMin = i\n    for (let j = 1; j <= b.length; j++) {\n      const cost = a[i - 1] === b[j - 1] ? 0 : 1\n      let v = Math.min(prev[j] + 1, cur[j - 1] + 1, prev[j - 1] + cost)\n      if (prev2 && i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {\n        v = Math.min(v, prev2[j - 2] + 1)\n      }\n      cur.push(v)\n      if (v < rowMin) rowMin = v\n    }\n    if (rowMin > max) return false\n    prev2 = prev\n    prev = cur\n  }\n  return prev[b.length] <= max\n}\n\nconst SOUNDEX_CODES: Record<string, string> = {\n  b: \"1\", f: \"1\", p: \"1\", v: \"1\",\n  c: \"2\", g: \"2\", j: \"2\", k: \"2\", q: \"2\", s: \"2\", x: \"2\", z: \"2\",\n  d: \"3\", t: \"3\",\n  l: \"4\",\n  m: \"5\", n: \"5\",\n  r: \"6\",\n}\n\n/** Classic Soundex. Empty input returns \"\". */\nexport function soundex(word: string): string {\n  const w = word.toLowerCase().replace(/[^a-z]/g, \"\")\n  if (!w) return \"\"\n  let out = w[0].toUpperCase()\n  let lastCode = SOUNDEX_CODES[w[0]] ?? \"\"\n  for (let i = 1; i < w.length && out.length < 4; i++) {\n    const ch = w[i]\n    const code = SOUNDEX_CODES[ch] ?? \"\"\n    // h/w are transparent: they don't reset the adjacent-duplicate rule.\n    if (ch === \"h\" || ch === \"w\") continue\n    if (code && code !== lastCode) out += code\n    lastCode = code\n  }\n  return out.padEnd(4, \"0\")\n}\n\n/** First index with at >= value (entries time-sorted ascending). */\nfunction lowerBound(entries: readonly MemorySearchableEntry[], value: number): number {\n  let lo = 0\n  let hi = entries.length\n  while (lo < hi) {\n    const mid = (lo + hi) >> 1\n    if (entries[mid].at < value) lo = mid + 1\n    else hi = mid\n  }\n  return lo\n}\n\n/** First index with at > value (i.e. exclusive end for an inclusive bound). */\nfunction upperBound(entries: readonly MemorySearchableEntry[], value: number): number {\n  let lo = 0\n  let hi = entries.length\n  while (lo < hi) {\n    const mid = (lo + hi) >> 1\n    if (entries[mid].at <= value) lo = mid + 1\n    else hi = mid\n  }\n  return lo\n}\n"]}

package/build/utils/miniappDiagnostics.d.ts

@@ -0,0 +1,64 @@
+import type { ClientApp } from "../types/applet";
+export interface MiniappManifestSnapshot {
+    packageName: string;
+    name?: string;
+    version?: string;
+    sdkVersion?: string;
+    minHostVersion?: string;
+    type?: string;
+    entry?: {
+        background?: string;
+        ui?: string;
+    };
+    permissions: Array<{
+        type: string;
+        required?: boolean;
+    }>;
+    hardwareRequirements: Array<{
+        type: string;
+        level: string;
+    }>;
+    actionIds: string[];
+}
+export interface MiniappRuntimeAppSnapshot {
+    packageName: string;
+    handshakeComplete: boolean;
+    subscriptions: string[];
+    lastMessageAgeMs: number;
+    requestedLocationRate: string | null;
+    hasActiveSpeakerStream: boolean;
+    manifest?: MiniappManifestSnapshot;
+}
+export interface MiniappRuntimeDiagnosticSnapshot {
+    connectedApps: MiniappRuntimeAppSnapshot[];
+    subscriptionsByStream: Record<string, string[]>;
+    resources: {
+        display: Record<string, unknown>;
+        camera: Record<string, unknown>;
+        video: Record<string, unknown>;
+        stream: Record<string, unknown>;
+        cameraFov: Record<string, unknown>;
+    };
+}
+type ManifestFallback = {
+    packageName: string;
+    name?: string;
+    version?: string;
+    type?: string;
+};
+/**
+ * Keep the routing/build fields from miniapp.json while excluding arbitrary
+ * free-form manifest content from reports. Descriptions, URLs, and unknown
+ * extension fields are intentionally omitted.
+ */
+export declare function buildMiniappManifestSnapshot(raw: unknown, fallback: ManifestFallback): MiniappManifestSnapshot;
+export declare function buildMiniappDiagnosticContext(input: {
+    apps: ClientApp[];
+    foregroundedPackage: string | null;
+    runtime: MiniappRuntimeDiagnosticSnapshot;
+    getLastOpenedAtMs: (app: ClientApp) => number;
+    getManifest: (app: ClientApp) => unknown;
+    getReleaseIdentity: (app: ClientApp) => unknown;
+}): Record<string, unknown>;
+export {};
+//# sourceMappingURL=miniappDiagnostics.d.ts.map

package/build/utils/miniappDiagnostics.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"miniappDiagnostics.d.ts","sourceRoot":"","sources":["../../src/utils/miniappDiagnostics.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,iBAAiB,CAAA;AAM9C,MAAM,WAAW,uBAAuB;IACtC,WAAW,EAAE,MAAM,CAAA;IACnB,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB,cAAc,CAAC,EAAE,MAAM,CAAA;IACvB,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,KAAK,CAAC,EAAE;QACN,UAAU,CAAC,EAAE,MAAM,CAAA;QACnB,EAAE,CAAC,EAAE,MAAM,CAAA;KACZ,CAAA;IACD,WAAW,EAAE,KAAK,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,OAAO,CAAA;KAAC,CAAC,CAAA;IACtD,oBAAoB,EAAE,KAAK,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAC,CAAC,CAAA;IAC1D,SAAS,EAAE,MAAM,EAAE,CAAA;CACpB;AAED,MAAM,WAAW,yBAAyB;IACxC,WAAW,EAAE,MAAM,CAAA;IACnB,iBAAiB,EAAE,OAAO,CAAA;IAC1B,aAAa,EAAE,MAAM,EAAE,CAAA;IACvB,gBAAgB,EAAE,MAAM,CAAA;IACxB,qBAAqB,EAAE,MAAM,GAAG,IAAI,CAAA;IACpC,sBAAsB,EAAE,OAAO,CAAA;IAC/B,QAAQ,CAAC,EAAE,uBAAuB,CAAA;CACnC;AAED,MAAM,WAAW,gCAAgC;IAC/C,aAAa,EAAE,yBAAyB,EAAE,CAAA;IAC1C,qBAAqB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;IAC/C,SAAS,EAAE;QACT,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;QAChC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;QAC/B,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;QAC9B,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;QAC/B,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;KACnC,CAAA;CACF;AAED,KAAK,gBAAgB,GAAG;IACtB,WAAW,EAAE,MAAM,CAAA;IACnB,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,IAAI,CAAC,EAAE,MAAM,CAAA;CACd,CAAA;AAsDD;;;;GAIG;AACH,wBAAgB,4BAA4B,CAAC,GAAG,EAAE,OAAO,EAAE,QAAQ,EAAE,gBAAgB,GAAG,uBAAuB,CAsB9G;AAoBD,wBAAgB,6BAA6B,CAAC,KAAK,EAAE;IACnD,IAAI,EAAE,SAAS,EAAE,CAAA;IACjB,mBAAmB,EAAE,MAAM,GAAG,IAAI,CAAA;IAClC,OAAO,EAAE,gCAAgC,CAAA;IACzC,iBAAiB,EAAE,CAAC,GAAG,EAAE,SAAS,KAAK,MAAM,CAAA;IAC7C,WAAW,EAAE,CAAC,GAAG,EAAE,SAAS,KAAK,OAAO,CAAA;IACxC,kBAAkB,EAAE,CAAC,GAAG,EAAE,SAAS,KAAK,OAAO,CAAA;CAChD,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAoE1B"}