trybeacon 0.1.0

package/.next/server/chunks/[root-of-the-server]__0--8e0y._.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../node_modules/chokidar/index.js","../../../node_modules/readdirp/index.js","../../../node_modules/chokidar/handler.js","../../../intel/extractors/code-graph.ts","../../../intel/extractors/languages/ts.ts","../../../intel/extractors/languages/python.ts","../../../intel/extractors/languages/go.ts","../../../intel/extractors/languages/rust.ts","../../../intel/extractors/languages/fallback.ts","../../../intel/extractors/languages/index.ts","../../../intel/watch-inline.ts","../../../intel/watch-manager.ts"],"sourcesContent":["/*! chokidar - MIT License (c) 2012 Paul Miller (paulmillr.com) */\nimport { EventEmitter } from 'node:events';\nimport { stat as statcb, Stats } from 'node:fs';\nimport { readdir, stat } from 'node:fs/promises';\nimport * as sp from 'node:path';\nimport { readdirp, ReaddirpStream } from 'readdirp';\nimport { EMPTY_FN, EVENTS as EV, isIBMi, isWindows, NodeFsHandler, STR_CLOSE, STR_END, } from './handler.js';\nconst SLASH = '/';\nconst SLASH_SLASH = '//';\nconst ONE_DOT = '.';\nconst TWO_DOTS = '..';\nconst STRING_TYPE = 'string';\nconst BACK_SLASH_RE = /\\\\/g;\nconst DOUBLE_SLASH_RE = /\\/\\//g;\nconst DOT_RE = /\\..*\\.(sw[px])$|~$|\\.subl.*\\.tmp/;\nconst REPLACER_RE = /^\\.[/\\\\]/;\nfunction arrify(item) {\n    return Array.isArray(item) ? item : [item];\n}\nconst isMatcherObject = (matcher) => typeof matcher === 'object' && matcher !== null && !(matcher instanceof RegExp);\nfunction createPattern(matcher) {\n    if (typeof matcher === 'function')\n        return matcher;\n    if (typeof matcher === 'string')\n        return (string) => matcher === string;\n    if (matcher instanceof RegExp)\n        return (string) => matcher.test(string);\n    if (typeof matcher === 'object' && matcher !== null) {\n        return (string) => {\n            if (matcher.path === string)\n                return true;\n            if (matcher.recursive) {\n                const relative = sp.relative(matcher.path, string);\n                if (!relative) {\n                    return false;\n                }\n                return !relative.startsWith('..') && !sp.isAbsolute(relative);\n            }\n            return false;\n        };\n    }\n    return () => false;\n}\nfunction normalizePath(path) {\n    if (typeof path !== 'string')\n        throw new Error('string expected');\n    path = sp.normalize(path);\n    path = path.replace(/\\\\/g, '/');\n    let prepend = false;\n    if (path.startsWith('//'))\n        prepend = true;\n    path = path.replace(DOUBLE_SLASH_RE, '/');\n    if (prepend)\n        path = '/' + path;\n    return path;\n}\nfunction matchPatterns(patterns, testString, stats) {\n    const path = normalizePath(testString);\n    for (let index = 0; index < patterns.length; index++) {\n        const pattern = patterns[index];\n        if (pattern(path, stats)) {\n            return true;\n        }\n    }\n    return false;\n}\nfunction anymatch(matchers, testString) {\n    if (matchers == null) {\n        throw new TypeError('anymatch: specify first argument');\n    }\n    // Early cache for matchers.\n    const matchersArray = arrify(matchers);\n    const patterns = matchersArray.map((matcher) => createPattern(matcher));\n    if (testString == null) {\n        return (testString, stats) => {\n            return matchPatterns(patterns, testString, stats);\n        };\n    }\n    return matchPatterns(patterns, testString);\n}\nconst unifyPaths = (paths_) => {\n    const paths = arrify(paths_).flat();\n    if (!paths.every((p) => typeof p === STRING_TYPE)) {\n        throw new TypeError(`Non-string provided as watch path: ${paths}`);\n    }\n    return paths.map(normalizePathToUnix);\n};\n// If SLASH_SLASH occurs at the beginning of path, it is not replaced\n//     because \"//StoragePC/DrivePool/Movies\" is a valid network path\nconst toUnix = (string) => {\n    let str = string.replace(BACK_SLASH_RE, SLASH);\n    let prepend = false;\n    if (str.startsWith(SLASH_SLASH)) {\n        prepend = true;\n    }\n    str = str.replace(DOUBLE_SLASH_RE, SLASH);\n    if (prepend) {\n        str = SLASH + str;\n    }\n    return str;\n};\n// Our version of upath.normalize\n// TODO: this is not equal to path-normalize module - investigate why\nconst normalizePathToUnix = (path) => toUnix(sp.normalize(toUnix(path)));\n// TODO: refactor\nconst normalizeIgnored = (cwd = '') => (path) => {\n    if (typeof path === 'string') {\n        return normalizePathToUnix(sp.isAbsolute(path) ? path : sp.join(cwd, path));\n    }\n    else {\n        return path;\n    }\n};\nconst getAbsolutePath = (path, cwd) => {\n    if (sp.isAbsolute(path)) {\n        return path;\n    }\n    return sp.join(cwd, path);\n};\nconst EMPTY_SET = Object.freeze(new Set());\n/**\n * Directory entry.\n */\nclass DirEntry {\n    path;\n    _removeWatcher;\n    items;\n    constructor(dir, removeWatcher) {\n        this.path = dir;\n        this._removeWatcher = removeWatcher;\n        this.items = new Set();\n    }\n    add(item) {\n        const { items } = this;\n        if (!items)\n            return;\n        if (item !== ONE_DOT && item !== TWO_DOTS)\n            items.add(item);\n    }\n    async remove(item) {\n        const { items } = this;\n        if (!items)\n            return;\n        items.delete(item);\n        if (items.size > 0)\n            return;\n        const dir = this.path;\n        try {\n            await readdir(dir);\n        }\n        catch (err) {\n            if (this._removeWatcher) {\n                this._removeWatcher(sp.dirname(dir), sp.basename(dir));\n            }\n        }\n    }\n    has(item) {\n        const { items } = this;\n        if (!items)\n            return;\n        return items.has(item);\n    }\n    getChildren() {\n        const { items } = this;\n        if (!items)\n            return [];\n        return [...items.values()];\n    }\n    dispose() {\n        this.items.clear();\n        this.path = '';\n        this._removeWatcher = EMPTY_FN;\n        this.items = EMPTY_SET;\n        Object.freeze(this);\n    }\n}\nconst STAT_METHOD_F = 'stat';\nconst STAT_METHOD_L = 'lstat';\nexport class WatchHelper {\n    fsw;\n    path;\n    watchPath;\n    fullWatchPath;\n    dirParts;\n    followSymlinks;\n    statMethod;\n    constructor(path, follow, fsw) {\n        this.fsw = fsw;\n        const watchPath = path;\n        this.path = path = path.replace(REPLACER_RE, '');\n        this.watchPath = watchPath;\n        this.fullWatchPath = sp.resolve(watchPath);\n        this.dirParts = [];\n        this.dirParts.forEach((parts) => {\n            if (parts.length > 1)\n                parts.pop();\n        });\n        this.followSymlinks = follow;\n        this.statMethod = follow ? STAT_METHOD_F : STAT_METHOD_L;\n    }\n    entryPath(entry) {\n        return sp.join(this.watchPath, sp.relative(this.watchPath, entry.fullPath));\n    }\n    filterPath(entry) {\n        const { stats } = entry;\n        if (stats && stats.isSymbolicLink())\n            return this.filterDir(entry);\n        const resolvedPath = this.entryPath(entry);\n        // TODO: what if stats is undefined? remove !\n        return this.fsw._isntIgnored(resolvedPath, stats) && this.fsw._hasReadPermissions(stats);\n    }\n    filterDir(entry) {\n        return this.fsw._isntIgnored(this.entryPath(entry), entry.stats);\n    }\n}\n/**\n * Watches files & directories for changes. Emitted events:\n * `add`, `addDir`, `change`, `unlink`, `unlinkDir`, `all`, `error`\n *\n *     new FSWatcher()\n *       .add(directories)\n *       .on('add', path => log('File', path, 'was added'))\n */\nexport class FSWatcher extends EventEmitter {\n    closed;\n    options;\n    _closers;\n    _ignoredPaths;\n    _throttled;\n    _streams;\n    _symlinkPaths;\n    _watched;\n    _pendingWrites;\n    _pendingUnlinks;\n    _readyCount;\n    _emitReady;\n    _closePromise;\n    _userIgnored;\n    _readyEmitted;\n    _emitRaw;\n    _boundRemove;\n    _nodeFsHandler;\n    // Not indenting methods for history sake; for now.\n    constructor(_opts = {}) {\n        super();\n        this.closed = false;\n        this._closers = new Map();\n        this._ignoredPaths = new Set();\n        this._throttled = new Map();\n        this._streams = new Set();\n        this._symlinkPaths = new Map();\n        this._watched = new Map();\n        this._pendingWrites = new Map();\n        this._pendingUnlinks = new Map();\n        this._readyCount = 0;\n        this._readyEmitted = false;\n        const awf = _opts.awaitWriteFinish;\n        const DEF_AWF = { stabilityThreshold: 2000, pollInterval: 100 };\n        const opts = {\n            // Defaults\n            persistent: true,\n            ignoreInitial: false,\n            ignorePermissionErrors: false,\n            interval: 100,\n            binaryInterval: 300,\n            followSymlinks: true,\n            usePolling: false,\n            // useAsync: false,\n            atomic: true, // NOTE: overwritten later (depends on usePolling)\n            ..._opts,\n            // Change format\n            ignored: _opts.ignored ? arrify(_opts.ignored) : arrify([]),\n            awaitWriteFinish: awf === true ? DEF_AWF : typeof awf === 'object' ? { ...DEF_AWF, ...awf } : false,\n        };\n        // Always default to polling on IBM i because fs.watch() is not available on IBM i.\n        if (isIBMi)\n            opts.usePolling = true;\n        // Editor atomic write normalization enabled by default with fs.watch\n        if (opts.atomic === undefined)\n            opts.atomic = !opts.usePolling;\n        // opts.atomic = typeof _opts.atomic === 'number' ? _opts.atomic : 100;\n        // Global override. Useful for developers, who need to force polling for all\n        // instances of chokidar, regardless of usage / dependency depth\n        const envPoll = process.env.CHOKIDAR_USEPOLLING;\n        if (envPoll !== undefined) {\n            const envLower = envPoll.toLowerCase();\n            if (envLower === 'false' || envLower === '0')\n                opts.usePolling = false;\n            else if (envLower === 'true' || envLower === '1')\n                opts.usePolling = true;\n            else\n                opts.usePolling = !!envLower;\n        }\n        const envInterval = process.env.CHOKIDAR_INTERVAL;\n        if (envInterval)\n            opts.interval = Number.parseInt(envInterval, 10);\n        // This is done to emit ready only once, but each 'add' will increase that?\n        let readyCalls = 0;\n        this._emitReady = () => {\n            readyCalls++;\n            if (readyCalls >= this._readyCount) {\n                this._emitReady = EMPTY_FN;\n                this._readyEmitted = true;\n                // use process.nextTick to allow time for listener to be bound\n                process.nextTick(() => this.emit(EV.READY));\n            }\n        };\n        this._emitRaw = (...args) => this.emit(EV.RAW, ...args);\n        this._boundRemove = this._remove.bind(this);\n        this.options = opts;\n        this._nodeFsHandler = new NodeFsHandler(this);\n        // You’re frozen when your heart’s not open.\n        Object.freeze(opts);\n    }\n    _addIgnoredPath(matcher) {\n        if (isMatcherObject(matcher)) {\n            // return early if we already have a deeply equal matcher object\n            for (const ignored of this._ignoredPaths) {\n                if (isMatcherObject(ignored) &&\n                    ignored.path === matcher.path &&\n                    ignored.recursive === matcher.recursive) {\n                    return;\n                }\n            }\n        }\n        this._ignoredPaths.add(matcher);\n    }\n    _removeIgnoredPath(matcher) {\n        this._ignoredPaths.delete(matcher);\n        // now find any matcher objects with the matcher as path\n        if (typeof matcher === 'string') {\n            for (const ignored of this._ignoredPaths) {\n                // TODO (43081j): make this more efficient.\n                // probably just make a `this._ignoredDirectories` or some\n                // such thing.\n                if (isMatcherObject(ignored) && ignored.path === matcher) {\n                    this._ignoredPaths.delete(ignored);\n                }\n            }\n        }\n    }\n    // Public methods\n    /**\n     * Adds paths to be watched on an existing FSWatcher instance.\n     * @param paths_ file or file list. Other arguments are unused\n     */\n    add(paths_, _origAdd, _internal) {\n        const { cwd } = this.options;\n        this.closed = false;\n        this._closePromise = undefined;\n        let paths = unifyPaths(paths_);\n        if (cwd) {\n            paths = paths.map((path) => {\n                const absPath = getAbsolutePath(path, cwd);\n                // Check `path` instead of `absPath` because the cwd portion can't be a glob\n                return absPath;\n            });\n        }\n        paths.forEach((path) => {\n            this._removeIgnoredPath(path);\n        });\n        this._userIgnored = undefined;\n        if (!this._readyCount)\n            this._readyCount = 0;\n        this._readyCount += paths.length;\n        Promise.all(paths.map(async (path) => {\n            const res = await this._nodeFsHandler._addToNodeFs(path, !_internal, undefined, 0, _origAdd);\n            if (res)\n                this._emitReady();\n            return res;\n        })).then((results) => {\n            if (this.closed)\n                return;\n            results.forEach((item) => {\n                if (item)\n                    this.add(sp.dirname(item), sp.basename(_origAdd || item));\n            });\n        });\n        return this;\n    }\n    /**\n     * Close watchers or start ignoring events from specified paths.\n     */\n    unwatch(paths_) {\n        if (this.closed)\n            return this;\n        const paths = unifyPaths(paths_);\n        const { cwd } = this.options;\n        paths.forEach((path) => {\n            // convert to absolute path unless relative path already matches\n            if (!sp.isAbsolute(path) && !this._closers.has(path)) {\n                if (cwd)\n                    path = sp.join(cwd, path);\n                path = sp.resolve(path);\n            }\n            this._closePath(path);\n            this._addIgnoredPath(path);\n            if (this._watched.has(path)) {\n                this._addIgnoredPath({\n                    path,\n                    recursive: true,\n                });\n            }\n            // reset the cached userIgnored anymatch fn\n            // to make ignoredPaths changes effective\n            this._userIgnored = undefined;\n        });\n        return this;\n    }\n    /**\n     * Close watchers and remove all listeners from watched paths.\n     */\n    close() {\n        if (this._closePromise) {\n            return this._closePromise;\n        }\n        this.closed = true;\n        // Memory management.\n        this.removeAllListeners();\n        const closers = [];\n        this._closers.forEach((closerList) => closerList.forEach((closer) => {\n            const promise = closer();\n            if (promise instanceof Promise)\n                closers.push(promise);\n        }));\n        this._streams.forEach((stream) => stream.destroy());\n        this._userIgnored = undefined;\n        this._readyCount = 0;\n        this._readyEmitted = false;\n        this._watched.forEach((dirent) => dirent.dispose());\n        this._closers.clear();\n        this._watched.clear();\n        this._streams.clear();\n        this._symlinkPaths.clear();\n        this._throttled.clear();\n        this._closePromise = closers.length\n            ? Promise.all(closers).then(() => undefined)\n            : Promise.resolve();\n        return this._closePromise;\n    }\n    /**\n     * Expose list of watched paths\n     * @returns for chaining\n     */\n    getWatched() {\n        const watchList = {};\n        this._watched.forEach((entry, dir) => {\n            const key = this.options.cwd ? sp.relative(this.options.cwd, dir) : dir;\n            const index = key || ONE_DOT;\n            watchList[index] = entry.getChildren().sort();\n        });\n        return watchList;\n    }\n    emitWithAll(event, args) {\n        this.emit(event, ...args);\n        if (event !== EV.ERROR)\n            this.emit(EV.ALL, event, ...args);\n    }\n    // Common helpers\n    // --------------\n    /**\n     * Normalize and emit events.\n     * Calling _emit DOES NOT MEAN emit() would be called!\n     * @param event Type of event\n     * @param path File or directory path\n     * @param stats arguments to be passed with event\n     * @returns the error if defined, otherwise the value of the FSWatcher instance's `closed` flag\n     */\n    async _emit(event, path, stats) {\n        if (this.closed)\n            return;\n        const opts = this.options;\n        if (isWindows)\n            path = sp.normalize(path);\n        if (opts.cwd)\n            path = sp.relative(opts.cwd, path);\n        const args = [path];\n        if (stats != null)\n            args.push(stats);\n        const awf = opts.awaitWriteFinish;\n        let pw;\n        if (awf && (pw = this._pendingWrites.get(path))) {\n            pw.lastChange = new Date();\n            return this;\n        }\n        if (opts.atomic) {\n            if (event === EV.UNLINK) {\n                this._pendingUnlinks.set(path, [event, ...args]);\n                setTimeout(() => {\n                    this._pendingUnlinks.forEach((entry, path) => {\n                        this.emit(...entry);\n                        this.emit(EV.ALL, ...entry);\n                        this._pendingUnlinks.delete(path);\n                    });\n                }, typeof opts.atomic === 'number' ? opts.atomic : 100);\n                return this;\n            }\n            if (event === EV.ADD && this._pendingUnlinks.has(path)) {\n                event = EV.CHANGE;\n                this._pendingUnlinks.delete(path);\n            }\n        }\n        if (awf && (event === EV.ADD || event === EV.CHANGE) && this._readyEmitted) {\n            const awfEmit = (err, stats) => {\n                if (err) {\n                    event = EV.ERROR;\n                    args[0] = err;\n                    this.emitWithAll(event, args);\n                }\n                else if (stats) {\n                    // if stats doesn't exist the file must have been deleted\n                    if (args.length > 1) {\n                        args[1] = stats;\n                    }\n                    else {\n                        args.push(stats);\n                    }\n                    this.emitWithAll(event, args);\n                }\n            };\n            this._awaitWriteFinish(path, awf.stabilityThreshold, event, awfEmit);\n            return this;\n        }\n        if (event === EV.CHANGE) {\n            const isThrottled = !this._throttle(EV.CHANGE, path, 50);\n            if (isThrottled)\n                return this;\n        }\n        if (opts.alwaysStat &&\n            stats === undefined &&\n            (event === EV.ADD || event === EV.ADD_DIR || event === EV.CHANGE)) {\n            const fullPath = opts.cwd ? sp.join(opts.cwd, path) : path;\n            let stats;\n            try {\n                stats = await stat(fullPath);\n            }\n            catch (err) {\n                // do nothing\n            }\n            // Suppress event when fs_stat fails, to avoid sending undefined 'stat'\n            if (!stats || this.closed)\n                return;\n            args.push(stats);\n        }\n        this.emitWithAll(event, args);\n        return this;\n    }\n    /**\n     * Common handler for errors\n     * @returns The error if defined, otherwise the value of the FSWatcher instance's `closed` flag\n     */\n    _handleError(error) {\n        const code = error && error.code;\n        if (error &&\n            code !== 'ENOENT' &&\n            code !== 'ENOTDIR' &&\n            (!this.options.ignorePermissionErrors || (code !== 'EPERM' && code !== 'EACCES'))) {\n            this.emit(EV.ERROR, error);\n        }\n        return error || this.closed;\n    }\n    /**\n     * Helper utility for throttling\n     * @param actionType type being throttled\n     * @param path being acted upon\n     * @param timeout duration of time to suppress duplicate actions\n     * @returns tracking object or false if action should be suppressed\n     */\n    _throttle(actionType, path, timeout) {\n        if (!this._throttled.has(actionType)) {\n            this._throttled.set(actionType, new Map());\n        }\n        const action = this._throttled.get(actionType);\n        if (!action)\n            throw new Error('invalid throttle');\n        const actionPath = action.get(path);\n        if (actionPath) {\n            actionPath.count++;\n            return false;\n        }\n        // eslint-disable-next-line prefer-const\n        let timeoutObject;\n        const clear = () => {\n            const item = action.get(path);\n            const count = item ? item.count : 0;\n            action.delete(path);\n            clearTimeout(timeoutObject);\n            if (item)\n                clearTimeout(item.timeoutObject);\n            return count;\n        };\n        timeoutObject = setTimeout(clear, timeout);\n        const thr = { timeoutObject, clear, count: 0 };\n        action.set(path, thr);\n        return thr;\n    }\n    _incrReadyCount() {\n        return this._readyCount++;\n    }\n    /**\n     * Awaits write operation to finish.\n     * Polls a newly created file for size variations. When files size does not change for 'threshold' milliseconds calls callback.\n     * @param path being acted upon\n     * @param threshold Time in milliseconds a file size must be fixed before acknowledging write OP is finished\n     * @param event\n     * @param awfEmit Callback to be called when ready for event to be emitted.\n     */\n    _awaitWriteFinish(path, threshold, event, awfEmit) {\n        const awf = this.options.awaitWriteFinish;\n        if (typeof awf !== 'object')\n            return;\n        const pollInterval = awf.pollInterval;\n        let timeoutHandler;\n        let fullPath = path;\n        if (this.options.cwd && !sp.isAbsolute(path)) {\n            fullPath = sp.join(this.options.cwd, path);\n        }\n        const now = new Date();\n        const writes = this._pendingWrites;\n        function awaitWriteFinishFn(prevStat) {\n            statcb(fullPath, (err, curStat) => {\n                if (err || !writes.has(path)) {\n                    if (err && err.code !== 'ENOENT')\n                        awfEmit(err);\n                    return;\n                }\n                const now = Number(new Date());\n                if (prevStat && curStat.size !== prevStat.size) {\n                    writes.get(path).lastChange = now;\n                }\n                const pw = writes.get(path);\n                const df = now - pw.lastChange;\n                if (df >= threshold) {\n                    writes.delete(path);\n                    awfEmit(undefined, curStat);\n                }\n                else {\n                    timeoutHandler = setTimeout(awaitWriteFinishFn, pollInterval, curStat);\n                }\n            });\n        }\n        if (!writes.has(path)) {\n            writes.set(path, {\n                lastChange: now,\n                cancelWait: () => {\n                    writes.delete(path);\n                    clearTimeout(timeoutHandler);\n                    return event;\n                },\n            });\n            timeoutHandler = setTimeout(awaitWriteFinishFn, pollInterval);\n        }\n    }\n    /**\n     * Determines whether user has asked to ignore this path.\n     */\n    _isIgnored(path, stats) {\n        if (this.options.atomic && DOT_RE.test(path))\n            return true;\n        if (!this._userIgnored) {\n            const { cwd } = this.options;\n            const ign = this.options.ignored;\n            const ignored = (ign || []).map(normalizeIgnored(cwd));\n            const ignoredPaths = [...this._ignoredPaths];\n            const list = [...ignoredPaths.map(normalizeIgnored(cwd)), ...ignored];\n            this._userIgnored = anymatch(list, undefined);\n        }\n        return this._userIgnored(path, stats);\n    }\n    _isntIgnored(path, stat) {\n        return !this._isIgnored(path, stat);\n    }\n    /**\n     * Provides a set of common helpers and properties relating to symlink handling.\n     * @param path file or directory pattern being watched\n     */\n    _getWatchHelpers(path) {\n        return new WatchHelper(path, this.options.followSymlinks, this);\n    }\n    // Directory helpers\n    // -----------------\n    /**\n     * Provides directory tracking objects\n     * @param directory path of the directory\n     */\n    _getWatchedDir(directory) {\n        const dir = sp.resolve(directory);\n        if (!this._watched.has(dir))\n            this._watched.set(dir, new DirEntry(dir, this._boundRemove));\n        return this._watched.get(dir);\n    }\n    // File helpers\n    // ------------\n    /**\n     * Check for read permissions: https://stackoverflow.com/a/11781404/1358405\n     */\n    _hasReadPermissions(stats) {\n        if (this.options.ignorePermissionErrors)\n            return true;\n        return Boolean(Number(stats.mode) & 0o400);\n    }\n    /**\n     * Handles emitting unlink events for\n     * files and directories, and via recursion, for\n     * files and directories within directories that are unlinked\n     * @param directory within which the following item is located\n     * @param item      base path of item/directory\n     */\n    _remove(directory, item, isDirectory) {\n        // if what is being deleted is a directory, get that directory's paths\n        // for recursive deleting and cleaning of watched object\n        // if it is not a directory, nestedDirectoryChildren will be empty array\n        const path = sp.join(directory, item);\n        const fullPath = sp.resolve(path);\n        isDirectory =\n            isDirectory != null ? isDirectory : this._watched.has(path) || this._watched.has(fullPath);\n        // prevent duplicate handling in case of arriving here nearly simultaneously\n        // via multiple paths (such as _handleFile and _handleDir)\n        if (!this._throttle('remove', path, 100))\n            return;\n        // if the only watched file is removed, watch for its return\n        if (!isDirectory && this._watched.size === 1) {\n            this.add(directory, item, true);\n        }\n        // This will create a new entry in the watched object in either case\n        // so we got to do the directory check beforehand\n        const wp = this._getWatchedDir(path);\n        const nestedDirectoryChildren = wp.getChildren();\n        // Recursively remove children directories / files.\n        nestedDirectoryChildren.forEach((nested) => this._remove(path, nested));\n        // Check if item was on the watched list and remove it\n        const parent = this._getWatchedDir(directory);\n        const wasTracked = parent.has(item);\n        parent.remove(item);\n        // Fixes issue #1042 -> Relative paths were detected and added as symlinks\n        // (https://github.com/paulmillr/chokidar/blob/e1753ddbc9571bdc33b4a4af172d52cb6e611c10/lib/nodefs-handler.js#L612),\n        // but never removed from the map in case the path was deleted.\n        // This leads to an incorrect state if the path was recreated:\n        // https://github.com/paulmillr/chokidar/blob/e1753ddbc9571bdc33b4a4af172d52cb6e611c10/lib/nodefs-handler.js#L553\n        if (this._symlinkPaths.has(fullPath)) {\n            this._symlinkPaths.delete(fullPath);\n        }\n        // If we wait for this file to be fully written, cancel the wait.\n        let relPath = path;\n        if (this.options.cwd)\n            relPath = sp.relative(this.options.cwd, path);\n        if (this.options.awaitWriteFinish && this._pendingWrites.has(relPath)) {\n            const event = this._pendingWrites.get(relPath).cancelWait();\n            if (event === EV.ADD)\n                return;\n        }\n        // The Entry will either be a directory that just got removed\n        // or a bogus entry to a file, in either case we have to remove it\n        this._watched.delete(path);\n        this._watched.delete(fullPath);\n        const eventName = isDirectory ? EV.UNLINK_DIR : EV.UNLINK;\n        if (wasTracked && !this._isIgnored(path))\n            this._emit(eventName, path);\n        // Avoid conflicts if we later create another file with the same name\n        this._closePath(path);\n    }\n    /**\n     * Closes all watchers for a path\n     */\n    _closePath(path) {\n        this._closeFile(path);\n        const dir = sp.dirname(path);\n        this._getWatchedDir(dir).remove(sp.basename(path));\n    }\n    /**\n     * Closes only file-specific watchers\n     */\n    _closeFile(path) {\n        const closers = this._closers.get(path);\n        if (!closers)\n            return;\n        closers.forEach((closer) => closer());\n        this._closers.delete(path);\n    }\n    _addPathCloser(path, closer) {\n        if (!closer)\n            return;\n        let list = this._closers.get(path);\n        if (!list) {\n            list = [];\n            this._closers.set(path, list);\n        }\n        list.push(closer);\n    }\n    _readdirp(root, opts) {\n        if (this.closed)\n            return;\n        const options = { type: EV.ALL, alwaysStat: true, lstat: true, ...opts, depth: 0 };\n        let stream = readdirp(root, options);\n        this._streams.add(stream);\n        stream.once(STR_CLOSE, () => {\n            stream = undefined;\n        });\n        stream.once(STR_END, () => {\n            if (stream) {\n                this._streams.delete(stream);\n                stream = undefined;\n            }\n        });\n        return stream;\n    }\n}\n/**\n * Instantiates watcher with paths to be tracked.\n * @param paths file / directory paths\n * @param options opts, such as `atomic`, `awaitWriteFinish`, `ignored`, and others\n * @returns an instance of FSWatcher for chaining.\n * @example\n * const watcher = watch('.').on('all', (event, path) => { console.log(event, path); });\n * watch('.', { atomic: true, awaitWriteFinish: true, ignored: (f, stats) => stats?.isFile() && !f.endsWith('.js') })\n */\nexport function watch(paths, options = {}) {\n    const watcher = new FSWatcher(options);\n    watcher.add(paths);\n    return watcher;\n}\nexport default { watch: watch, FSWatcher: FSWatcher };\n","import { lstat, readdir, realpath, stat } from 'node:fs/promises';\nimport { join as pjoin, relative as prelative, resolve as presolve, sep as psep } from 'node:path';\nimport { Readable } from 'node:stream';\nexport const EntryTypes = {\n    FILE_TYPE: 'files',\n    DIR_TYPE: 'directories',\n    FILE_DIR_TYPE: 'files_directories',\n    EVERYTHING_TYPE: 'all',\n};\nconst defaultOptions = {\n    root: '.',\n    fileFilter: (_entryInfo) => true,\n    directoryFilter: (_entryInfo) => true,\n    type: EntryTypes.FILE_TYPE,\n    lstat: false,\n    depth: 2147483648,\n    alwaysStat: false,\n    highWaterMark: 4096,\n};\nObject.freeze(defaultOptions);\nconst RECURSIVE_ERROR_CODE = 'READDIRP_RECURSIVE_ERROR';\nconst NORMAL_FLOW_ERRORS = new Set(['ENOENT', 'EPERM', 'EACCES', 'ELOOP', RECURSIVE_ERROR_CODE]);\nconst ALL_TYPES = [\n    EntryTypes.DIR_TYPE,\n    EntryTypes.EVERYTHING_TYPE,\n    EntryTypes.FILE_DIR_TYPE,\n    EntryTypes.FILE_TYPE,\n];\nconst DIR_TYPES = new Set([\n    EntryTypes.DIR_TYPE,\n    EntryTypes.EVERYTHING_TYPE,\n    EntryTypes.FILE_DIR_TYPE,\n]);\nconst FILE_TYPES = new Set([\n    EntryTypes.EVERYTHING_TYPE,\n    EntryTypes.FILE_DIR_TYPE,\n    EntryTypes.FILE_TYPE,\n]);\nconst isNormalFlowError = (error) => NORMAL_FLOW_ERRORS.has(error.code);\nconst wantBigintFsStats = process.platform === 'win32';\nconst emptyFn = (_entryInfo) => true;\nconst normalizeFilter = (filter) => {\n    if (filter === undefined)\n        return emptyFn;\n    if (typeof filter === 'function')\n        return filter;\n    if (typeof filter === 'string') {\n        const fl = filter.trim();\n        return (entry) => entry.basename === fl;\n    }\n    if (Array.isArray(filter)) {\n        const trItems = filter.map((item) => item.trim());\n        return (entry) => trItems.some((f) => entry.basename === f);\n    }\n    return emptyFn;\n};\n/** Readable readdir stream, emitting new files as they're being listed. */\nexport class ReaddirpStream extends Readable {\n    parents;\n    reading;\n    parent;\n    _stat;\n    _maxDepth;\n    _wantsDir;\n    _wantsFile;\n    _wantsEverything;\n    _root;\n    _isDirent;\n    _statsProp;\n    _rdOptions;\n    _fileFilter;\n    _directoryFilter;\n    constructor(options = {}) {\n        super({\n            objectMode: true,\n            autoDestroy: true,\n            highWaterMark: options.highWaterMark,\n        });\n        const opts = { ...defaultOptions, ...options };\n        const { root, type } = opts;\n        this._fileFilter = normalizeFilter(opts.fileFilter);\n        this._directoryFilter = normalizeFilter(opts.directoryFilter);\n        const statMethod = opts.lstat ? lstat : stat;\n        // Use bigint stats if it's windows and stat() supports options (node 10+).\n        if (wantBigintFsStats) {\n            this._stat = (path) => statMethod(path, { bigint: true });\n        }\n        else {\n            this._stat = statMethod;\n        }\n        this._maxDepth =\n            opts.depth != null && Number.isSafeInteger(opts.depth) ? opts.depth : defaultOptions.depth;\n        this._wantsDir = type ? DIR_TYPES.has(type) : false;\n        this._wantsFile = type ? FILE_TYPES.has(type) : false;\n        this._wantsEverything = type === EntryTypes.EVERYTHING_TYPE;\n        this._root = presolve(root);\n        this._isDirent = !opts.alwaysStat;\n        this._statsProp = this._isDirent ? 'dirent' : 'stats';\n        this._rdOptions = { encoding: 'utf8', withFileTypes: this._isDirent };\n        // Launch stream with one parent, the root dir.\n        this.parents = [this._exploreDir(root, 1)];\n        this.reading = false;\n        this.parent = undefined;\n    }\n    async _read(batch) {\n        if (this.reading)\n            return;\n        this.reading = true;\n        try {\n            while (!this.destroyed && batch > 0) {\n                const par = this.parent;\n                const fil = par && par.files;\n                if (fil && fil.length > 0) {\n                    const { path, depth } = par;\n                    const slice = fil.splice(0, batch).map((dirent) => this._formatEntry(dirent, path));\n                    const awaited = await Promise.all(slice);\n                    for (const entry of awaited) {\n                        if (!entry)\n                            continue;\n                        if (this.destroyed)\n                            return;\n                        const entryType = await this._getEntryType(entry);\n                        if (entryType === 'directory' && this._directoryFilter(entry)) {\n                            if (depth <= this._maxDepth) {\n                                this.parents.push(this._exploreDir(entry.fullPath, depth + 1));\n                            }\n                            if (this._wantsDir) {\n                                this.push(entry);\n                                batch--;\n                            }\n                        }\n                        else if ((entryType === 'file' || this._includeAsFile(entry)) &&\n                            this._fileFilter(entry)) {\n                            if (this._wantsFile) {\n                                this.push(entry);\n                                batch--;\n                            }\n                        }\n                    }\n                }\n                else {\n                    const parent = this.parents.pop();\n                    if (!parent) {\n                        this.push(null);\n                        break;\n                    }\n                    this.parent = await parent;\n                    if (this.destroyed)\n                        return;\n                }\n            }\n        }\n        catch (error) {\n            this.destroy(error);\n        }\n        finally {\n            this.reading = false;\n        }\n    }\n    async _exploreDir(path, depth) {\n        let files;\n        try {\n            files = await readdir(path, this._rdOptions);\n        }\n        catch (error) {\n            this._onError(error);\n        }\n        return { files, depth, path };\n    }\n    async _formatEntry(dirent, path) {\n        let entry;\n        const basename = this._isDirent ? dirent.name : dirent;\n        try {\n            const fullPath = presolve(pjoin(path, basename));\n            entry = { path: prelative(this._root, fullPath), fullPath, basename };\n            entry[this._statsProp] = this._isDirent ? dirent : await this._stat(fullPath);\n        }\n        catch (err) {\n            this._onError(err);\n            return;\n        }\n        return entry;\n    }\n    _onError(err) {\n        if (isNormalFlowError(err) && !this.destroyed) {\n            this.emit('warn', err);\n        }\n        else {\n            this.destroy(err);\n        }\n    }\n    async _getEntryType(entry) {\n        // entry may be undefined, because a warning or an error were emitted\n        // and the statsProp is undefined\n        if (!entry && this._statsProp in entry) {\n            return '';\n        }\n        const stats = entry[this._statsProp];\n        if (stats.isFile())\n            return 'file';\n        if (stats.isDirectory())\n            return 'directory';\n        if (stats && stats.isSymbolicLink()) {\n            const full = entry.fullPath;\n            try {\n                const entryRealPath = await realpath(full);\n                const entryRealPathStats = await lstat(entryRealPath);\n                if (entryRealPathStats.isFile()) {\n                    return 'file';\n                }\n                if (entryRealPathStats.isDirectory()) {\n                    const len = entryRealPath.length;\n                    if (full.startsWith(entryRealPath) && full.substr(len, 1) === psep) {\n                        const recursiveError = new Error(`Circular symlink detected: \"${full}\" points to \"${entryRealPath}\"`);\n                        // @ts-ignore\n                        recursiveError.code = RECURSIVE_ERROR_CODE;\n                        return this._onError(recursiveError);\n                    }\n                    return 'directory';\n                }\n            }\n            catch (error) {\n                this._onError(error);\n                return '';\n            }\n        }\n    }\n    _includeAsFile(entry) {\n        const stats = entry && entry[this._statsProp];\n        return stats && this._wantsEverything && !stats.isDirectory();\n    }\n}\n/**\n * Streaming version: Reads all files and directories in given root recursively.\n * Consumes ~constant small amount of RAM.\n * @param root Root directory\n * @param options Options to specify root (start directory), filters and recursion depth\n */\nexport function readdirp(root, options = {}) {\n    // @ts-ignore\n    let type = options.entryType || options.type;\n    if (type === 'both')\n        type = EntryTypes.FILE_DIR_TYPE; // backwards-compatibility\n    if (type)\n        options.type = type;\n    if (!root) {\n        throw new Error('readdirp: root argument is required. Usage: readdirp(root, options)');\n    }\n    else if (typeof root !== 'string') {\n        throw new TypeError('readdirp: root argument must be a string. Usage: readdirp(root, options)');\n    }\n    else if (type && !ALL_TYPES.includes(type)) {\n        throw new Error(`readdirp: Invalid type passed. Use one of ${ALL_TYPES.join(', ')}`);\n    }\n    options.root = root;\n    return new ReaddirpStream(options);\n}\n/**\n * Promise version: Reads all files and directories in given root recursively.\n * Compared to streaming version, will consume a lot of RAM e.g. when 1 million files are listed.\n * @returns array of paths and their entry infos\n */\nexport function readdirpPromise(root, options = {}) {\n    return new Promise((resolve, reject) => {\n        const files = [];\n        readdirp(root, options)\n            .on('data', (entry) => files.push(entry))\n            .on('end', () => resolve(files))\n            .on('error', (error) => reject(error));\n    });\n}\nexport default readdirp;\n","import { watch as fs_watch, unwatchFile, watchFile } from 'node:fs';\nimport { realpath as fsrealpath, lstat, open, stat } from 'node:fs/promises';\nimport { type as osType } from 'node:os';\nimport * as sp from 'node:path';\nexport const STR_DATA = 'data';\nexport const STR_END = 'end';\nexport const STR_CLOSE = 'close';\nexport const EMPTY_FN = () => { };\nexport const IDENTITY_FN = (val) => val;\nconst pl = process.platform;\nexport const isWindows = pl === 'win32';\nexport const isMacos = pl === 'darwin';\nexport const isLinux = pl === 'linux';\nexport const isFreeBSD = pl === 'freebsd';\nexport const isIBMi = osType() === 'OS400';\nexport const EVENTS = {\n    ALL: 'all',\n    READY: 'ready',\n    ADD: 'add',\n    CHANGE: 'change',\n    ADD_DIR: 'addDir',\n    UNLINK: 'unlink',\n    UNLINK_DIR: 'unlinkDir',\n    RAW: 'raw',\n    ERROR: 'error',\n};\nconst EV = EVENTS;\nconst THROTTLE_MODE_WATCH = 'watch';\nconst statMethods = { lstat, stat };\nconst KEY_LISTENERS = 'listeners';\nconst KEY_ERR = 'errHandlers';\nconst KEY_RAW = 'rawEmitters';\nconst HANDLER_KEYS = [KEY_LISTENERS, KEY_ERR, KEY_RAW];\n// prettier-ignore\nconst binaryExtensions = new Set([\n    '3dm', '3ds', '3g2', '3gp', '7z', 'a', 'aac', 'adp', 'afdesign', 'afphoto', 'afpub', 'ai',\n    'aif', 'aiff', 'alz', 'ape', 'apk', 'appimage', 'ar', 'arj', 'asf', 'au', 'avi',\n    'bak', 'baml', 'bh', 'bin', 'bk', 'bmp', 'btif', 'bz2', 'bzip2',\n    'cab', 'caf', 'cgm', 'class', 'cmx', 'cpio', 'cr2', 'cur', 'dat', 'dcm', 'deb', 'dex', 'djvu',\n    'dll', 'dmg', 'dng', 'doc', 'docm', 'docx', 'dot', 'dotm', 'dra', 'DS_Store', 'dsk', 'dts',\n    'dtshd', 'dvb', 'dwg', 'dxf',\n    'ecelp4800', 'ecelp7470', 'ecelp9600', 'egg', 'eol', 'eot', 'epub', 'exe',\n    'f4v', 'fbs', 'fh', 'fla', 'flac', 'flatpak', 'fli', 'flv', 'fpx', 'fst', 'fvt',\n    'g3', 'gh', 'gif', 'graffle', 'gz', 'gzip',\n    'h261', 'h263', 'h264', 'icns', 'ico', 'ief', 'img', 'ipa', 'iso',\n    'jar', 'jpeg', 'jpg', 'jpgv', 'jpm', 'jxr', 'key', 'ktx',\n    'lha', 'lib', 'lvp', 'lz', 'lzh', 'lzma', 'lzo',\n    'm3u', 'm4a', 'm4v', 'mar', 'mdi', 'mht', 'mid', 'midi', 'mj2', 'mka', 'mkv', 'mmr', 'mng',\n    'mobi', 'mov', 'movie', 'mp3',\n    'mp4', 'mp4a', 'mpeg', 'mpg', 'mpga', 'mxu',\n    'nef', 'npx', 'numbers', 'nupkg',\n    'o', 'odp', 'ods', 'odt', 'oga', 'ogg', 'ogv', 'otf', 'ott',\n    'pages', 'pbm', 'pcx', 'pdb', 'pdf', 'pea', 'pgm', 'pic', 'png', 'pnm', 'pot', 'potm',\n    'potx', 'ppa', 'ppam',\n    'ppm', 'pps', 'ppsm', 'ppsx', 'ppt', 'pptm', 'pptx', 'psd', 'pya', 'pyc', 'pyo', 'pyv',\n    'qt',\n    'rar', 'ras', 'raw', 'resources', 'rgb', 'rip', 'rlc', 'rmf', 'rmvb', 'rpm', 'rtf', 'rz',\n    's3m', 's7z', 'scpt', 'sgi', 'shar', 'snap', 'sil', 'sketch', 'slk', 'smv', 'snk', 'so',\n    'stl', 'suo', 'sub', 'swf',\n    'tar', 'tbz', 'tbz2', 'tga', 'tgz', 'thmx', 'tif', 'tiff', 'tlz', 'ttc', 'ttf', 'txz',\n    'udf', 'uvh', 'uvi', 'uvm', 'uvp', 'uvs', 'uvu',\n    'viv', 'vob',\n    'war', 'wav', 'wax', 'wbmp', 'wdp', 'weba', 'webm', 'webp', 'whl', 'wim', 'wm', 'wma',\n    'wmv', 'wmx', 'woff', 'woff2', 'wrm', 'wvx',\n    'xbm', 'xif', 'xla', 'xlam', 'xls', 'xlsb', 'xlsm', 'xlsx', 'xlt', 'xltm', 'xltx', 'xm',\n    'xmind', 'xpi', 'xpm', 'xwd', 'xz',\n    'z', 'zip', 'zipx',\n]);\nconst isBinaryPath = (filePath) => binaryExtensions.has(sp.extname(filePath).slice(1).toLowerCase());\n// TODO: emit errors properly. Example: EMFILE on Macos.\nconst foreach = (val, fn) => {\n    if (val instanceof Set) {\n        val.forEach(fn);\n    }\n    else {\n        fn(val);\n    }\n};\nconst addAndConvert = (main, prop, item) => {\n    let container = main[prop];\n    if (!(container instanceof Set)) {\n        main[prop] = container = new Set([container]);\n    }\n    container.add(item);\n};\nconst clearItem = (cont) => (key) => {\n    const set = cont[key];\n    if (set instanceof Set) {\n        set.clear();\n    }\n    else {\n        delete cont[key];\n    }\n};\nconst delFromSet = (main, prop, item) => {\n    const container = main[prop];\n    if (container instanceof Set) {\n        container.delete(item);\n    }\n    else if (container === item) {\n        delete main[prop];\n    }\n};\nconst isEmptySet = (val) => (val instanceof Set ? val.size === 0 : !val);\nconst FsWatchInstances = new Map();\n/**\n * Instantiates the fs_watch interface\n * @param path to be watched\n * @param options to be passed to fs_watch\n * @param listener main event handler\n * @param errHandler emits info about errors\n * @param emitRaw emits raw event data\n * @returns {NativeFsWatcher}\n */\nfunction createFsWatchInstance(path, options, listener, errHandler, emitRaw) {\n    const handleEvent = (rawEvent, evPath) => {\n        listener(path);\n        emitRaw(rawEvent, evPath, { watchedPath: path });\n        // emit based on events occurring for files from a directory's watcher in\n        // case the file's watcher misses it (and rely on throttling to de-dupe)\n        if (evPath && path !== evPath) {\n            fsWatchBroadcast(sp.resolve(path, evPath), KEY_LISTENERS, sp.join(path, evPath));\n        }\n    };\n    try {\n        return fs_watch(path, {\n            persistent: options.persistent,\n        }, handleEvent);\n    }\n    catch (error) {\n        errHandler(error);\n        return undefined;\n    }\n}\n/**\n * Helper for passing fs_watch event data to a collection of listeners\n * @param fullPath absolute path bound to fs_watch instance\n */\nconst fsWatchBroadcast = (fullPath, listenerType, val1, val2, val3) => {\n    const cont = FsWatchInstances.get(fullPath);\n    if (!cont)\n        return;\n    foreach(cont[listenerType], (listener) => {\n        listener(val1, val2, val3);\n    });\n};\n/**\n * Instantiates the fs_watch interface or binds listeners\n * to an existing one covering the same file system entry\n * @param path\n * @param fullPath absolute path\n * @param options to be passed to fs_watch\n * @param handlers container for event listener functions\n */\nconst setFsWatchListener = (path, fullPath, options, handlers) => {\n    const { listener, errHandler, rawEmitter } = handlers;\n    let cont = FsWatchInstances.get(fullPath);\n    let watcher;\n    if (!options.persistent) {\n        watcher = createFsWatchInstance(path, options, listener, errHandler, rawEmitter);\n        if (!watcher)\n            return;\n        return watcher.close.bind(watcher);\n    }\n    if (cont) {\n        addAndConvert(cont, KEY_LISTENERS, listener);\n        addAndConvert(cont, KEY_ERR, errHandler);\n        addAndConvert(cont, KEY_RAW, rawEmitter);\n    }\n    else {\n        watcher = createFsWatchInstance(path, options, fsWatchBroadcast.bind(null, fullPath, KEY_LISTENERS), errHandler, // no need to use broadcast here\n        fsWatchBroadcast.bind(null, fullPath, KEY_RAW));\n        if (!watcher)\n            return;\n        watcher.on(EV.ERROR, async (error) => {\n            const broadcastErr = fsWatchBroadcast.bind(null, fullPath, KEY_ERR);\n            if (cont)\n                cont.watcherUnusable = true; // documented since Node 10.4.1\n            // Workaround for https://github.com/joyent/node/issues/4337\n            if (isWindows && error.code === 'EPERM') {\n                try {\n                    const fd = await open(path, 'r');\n                    await fd.close();\n                    broadcastErr(error);\n                }\n                catch (err) {\n                    // do nothing\n                }\n            }\n            else {\n                broadcastErr(error);\n            }\n        });\n        cont = {\n            listeners: listener,\n            errHandlers: errHandler,\n            rawEmitters: rawEmitter,\n            watcher,\n        };\n        FsWatchInstances.set(fullPath, cont);\n    }\n    // const index = cont.listeners.indexOf(listener);\n    // removes this instance's listeners and closes the underlying fs_watch\n    // instance if there are no more listeners left\n    return () => {\n        delFromSet(cont, KEY_LISTENERS, listener);\n        delFromSet(cont, KEY_ERR, errHandler);\n        delFromSet(cont, KEY_RAW, rawEmitter);\n        if (isEmptySet(cont.listeners)) {\n            // Check to protect against issue gh-730.\n            // if (cont.watcherUnusable) {\n            cont.watcher.close();\n            // }\n            FsWatchInstances.delete(fullPath);\n            HANDLER_KEYS.forEach(clearItem(cont));\n            // @ts-ignore\n            cont.watcher = undefined;\n            Object.freeze(cont);\n        }\n    };\n};\n// fs_watchFile helpers\n// object to hold per-process fs_watchFile instances\n// (may be shared across chokidar FSWatcher instances)\nconst FsWatchFileInstances = new Map();\n/**\n * Instantiates the fs_watchFile interface or binds listeners\n * to an existing one covering the same file system entry\n * @param path to be watched\n * @param fullPath absolute path\n * @param options options to be passed to fs_watchFile\n * @param handlers container for event listener functions\n * @returns closer\n */\nconst setFsWatchFileListener = (path, fullPath, options, handlers) => {\n    const { listener, rawEmitter } = handlers;\n    let cont = FsWatchFileInstances.get(fullPath);\n    // let listeners = new Set();\n    // let rawEmitters = new Set();\n    const copts = cont && cont.options;\n    if (copts && (copts.persistent < options.persistent || copts.interval > options.interval)) {\n        // \"Upgrade\" the watcher to persistence or a quicker interval.\n        // This creates some unlikely edge case issues if the user mixes\n        // settings in a very weird way, but solving for those cases\n        // doesn't seem worthwhile for the added complexity.\n        // listeners = cont.listeners;\n        // rawEmitters = cont.rawEmitters;\n        unwatchFile(fullPath);\n        cont = undefined;\n    }\n    if (cont) {\n        addAndConvert(cont, KEY_LISTENERS, listener);\n        addAndConvert(cont, KEY_RAW, rawEmitter);\n    }\n    else {\n        // TODO\n        // listeners.add(listener);\n        // rawEmitters.add(rawEmitter);\n        cont = {\n            listeners: listener,\n            rawEmitters: rawEmitter,\n            options,\n            watcher: watchFile(fullPath, options, (curr, prev) => {\n                foreach(cont.rawEmitters, (rawEmitter) => {\n                    rawEmitter(EV.CHANGE, fullPath, { curr, prev });\n                });\n                const currmtime = curr.mtimeMs;\n                if (curr.size !== prev.size || currmtime > prev.mtimeMs || currmtime === 0) {\n                    foreach(cont.listeners, (listener) => listener(path, curr));\n                }\n            }),\n        };\n        FsWatchFileInstances.set(fullPath, cont);\n    }\n    // const index = cont.listeners.indexOf(listener);\n    // Removes this instance's listeners and closes the underlying fs_watchFile\n    // instance if there are no more listeners left.\n    return () => {\n        delFromSet(cont, KEY_LISTENERS, listener);\n        delFromSet(cont, KEY_RAW, rawEmitter);\n        if (isEmptySet(cont.listeners)) {\n            FsWatchFileInstances.delete(fullPath);\n            unwatchFile(fullPath);\n            cont.options = cont.watcher = undefined;\n            Object.freeze(cont);\n        }\n    };\n};\n/**\n * @mixin\n */\nexport class NodeFsHandler {\n    fsw;\n    _boundHandleError;\n    constructor(fsW) {\n        this.fsw = fsW;\n        this._boundHandleError = (error) => fsW._handleError(error);\n    }\n    /**\n     * Watch file for changes with fs_watchFile or fs_watch.\n     * @param path to file or dir\n     * @param listener on fs change\n     * @returns closer for the watcher instance\n     */\n    _watchWithNodeFs(path, listener) {\n        const opts = this.fsw.options;\n        const directory = sp.dirname(path);\n        const basename = sp.basename(path);\n        const parent = this.fsw._getWatchedDir(directory);\n        parent.add(basename);\n        const absolutePath = sp.resolve(path);\n        const options = {\n            persistent: opts.persistent,\n        };\n        if (!listener)\n            listener = EMPTY_FN;\n        let closer;\n        if (opts.usePolling) {\n            const enableBin = opts.interval !== opts.binaryInterval;\n            options.interval = enableBin && isBinaryPath(basename) ? opts.binaryInterval : opts.interval;\n            closer = setFsWatchFileListener(path, absolutePath, options, {\n                listener,\n                rawEmitter: this.fsw._emitRaw,\n            });\n        }\n        else {\n            closer = setFsWatchListener(path, absolutePath, options, {\n                listener,\n                errHandler: this._boundHandleError,\n                rawEmitter: this.fsw._emitRaw,\n            });\n        }\n        return closer;\n    }\n    /**\n     * Watch a file and emit add event if warranted.\n     * @returns closer for the watcher instance\n     */\n    _handleFile(file, stats, initialAdd) {\n        if (this.fsw.closed) {\n            return;\n        }\n        const dirname = sp.dirname(file);\n        const basename = sp.basename(file);\n        const parent = this.fsw._getWatchedDir(dirname);\n        // stats is always present\n        let prevStats = stats;\n        // if the file is already being watched, do nothing\n        if (parent.has(basename))\n            return;\n        const listener = async (path, newStats) => {\n            if (!this.fsw._throttle(THROTTLE_MODE_WATCH, file, 5))\n                return;\n            if (!newStats || newStats.mtimeMs === 0) {\n                try {\n                    const newStats = await stat(file);\n                    if (this.fsw.closed)\n                        return;\n                    // Check that change event was not fired because of changed only accessTime.\n                    const at = newStats.atimeMs;\n                    const mt = newStats.mtimeMs;\n                    if (!at || at <= mt || mt !== prevStats.mtimeMs) {\n                        this.fsw._emit(EV.CHANGE, file, newStats);\n                    }\n                    if ((isMacos || isLinux || isFreeBSD) && prevStats.ino !== newStats.ino) {\n                        this.fsw._closeFile(path);\n                        prevStats = newStats;\n                        const closer = this._watchWithNodeFs(file, listener);\n                        if (closer)\n                            this.fsw._addPathCloser(path, closer);\n                    }\n                    else {\n                        prevStats = newStats;\n                    }\n                }\n                catch (error) {\n                    // Fix issues where mtime is null but file is still present\n                    this.fsw._remove(dirname, basename);\n                }\n                // add is about to be emitted if file not already tracked in parent\n            }\n            else if (parent.has(basename)) {\n                // Check that change event was not fired because of changed only accessTime.\n                const at = newStats.atimeMs;\n                const mt = newStats.mtimeMs;\n                if (!at || at <= mt || mt !== prevStats.mtimeMs) {\n                    this.fsw._emit(EV.CHANGE, file, newStats);\n                }\n                prevStats = newStats;\n            }\n        };\n        // kick off the watcher\n        const closer = this._watchWithNodeFs(file, listener);\n        // emit an add event if we're supposed to\n        if (!(initialAdd && this.fsw.options.ignoreInitial) && this.fsw._isntIgnored(file)) {\n            if (!this.fsw._throttle(EV.ADD, file, 0))\n                return;\n            this.fsw._emit(EV.ADD, file, stats);\n        }\n        return closer;\n    }\n    /**\n     * Handle symlinks encountered while reading a dir.\n     * @param entry returned by readdirp\n     * @param directory path of dir being read\n     * @param path of this item\n     * @param item basename of this item\n     * @returns true if no more processing is needed for this entry.\n     */\n    async _handleSymlink(entry, directory, path, item) {\n        if (this.fsw.closed) {\n            return;\n        }\n        const full = entry.fullPath;\n        const dir = this.fsw._getWatchedDir(directory);\n        if (!this.fsw.options.followSymlinks) {\n            // watch symlink directly (don't follow) and detect changes\n            this.fsw._incrReadyCount();\n            let linkPath;\n            try {\n                linkPath = await fsrealpath(path);\n            }\n            catch (e) {\n                this.fsw._emitReady();\n                return true;\n            }\n            if (this.fsw.closed)\n                return;\n            if (dir.has(item)) {\n                if (this.fsw._symlinkPaths.get(full) !== linkPath) {\n                    this.fsw._symlinkPaths.set(full, linkPath);\n                    this.fsw._emit(EV.CHANGE, path, entry.stats);\n                }\n            }\n            else {\n                dir.add(item);\n                this.fsw._symlinkPaths.set(full, linkPath);\n                this.fsw._emit(EV.ADD, path, entry.stats);\n            }\n            this.fsw._emitReady();\n            return true;\n        }\n        // don't follow the same symlink more than once\n        if (this.fsw._symlinkPaths.has(full)) {\n            return true;\n        }\n        this.fsw._symlinkPaths.set(full, true);\n    }\n    _handleRead(directory, initialAdd, wh, target, dir, depth, throttler) {\n        // Normalize the directory name on Windows\n        directory = sp.join(directory, '');\n        const throttleKey = target ? `${directory}:${target}` : directory;\n        throttler = this.fsw._throttle('readdir', throttleKey, 1000);\n        if (!throttler)\n            return;\n        const previous = this.fsw._getWatchedDir(wh.path);\n        const current = new Set();\n        let stream = this.fsw._readdirp(directory, {\n            fileFilter: (entry) => wh.filterPath(entry),\n            directoryFilter: (entry) => wh.filterDir(entry),\n        });\n        if (!stream)\n            return;\n        stream\n            .on(STR_DATA, async (entry) => {\n            if (this.fsw.closed) {\n                stream = undefined;\n                return;\n            }\n            const item = entry.path;\n            let path = sp.join(directory, item);\n            current.add(item);\n            if (entry.stats.isSymbolicLink() &&\n                (await this._handleSymlink(entry, directory, path, item))) {\n                return;\n            }\n            if (this.fsw.closed) {\n                stream = undefined;\n                return;\n            }\n            // Files that present in current directory snapshot\n            // but absent in previous are added to watch list and\n            // emit `add` event.\n            if (item === target || (!target && !previous.has(item))) {\n                this.fsw._incrReadyCount();\n                // ensure relativeness of path is preserved in case of watcher reuse\n                path = sp.join(dir, sp.relative(dir, path));\n                this._addToNodeFs(path, initialAdd, wh, depth + 1);\n            }\n        })\n            .on(EV.ERROR, this._boundHandleError);\n        return new Promise((resolve, reject) => {\n            if (!stream)\n                return reject();\n            stream.once(STR_END, () => {\n                if (this.fsw.closed) {\n                    stream = undefined;\n                    return;\n                }\n                const wasThrottled = throttler ? throttler.clear() : false;\n                resolve(undefined);\n                // Files that absent in current directory snapshot\n                // but present in previous emit `remove` event\n                // and are removed from @watched[directory].\n                previous\n                    .getChildren()\n                    .filter((item) => {\n                    return item !== directory && !current.has(item);\n                })\n                    .forEach((item) => {\n                    this.fsw._remove(directory, item);\n                });\n                stream = undefined;\n                // one more time for any missed in case changes came in extremely quickly\n                if (wasThrottled)\n                    this._handleRead(directory, false, wh, target, dir, depth, throttler);\n            });\n        });\n    }\n    /**\n     * Read directory to add / remove files from `@watched` list and re-read it on change.\n     * @param dir fs path\n     * @param stats\n     * @param initialAdd\n     * @param depth relative to user-supplied path\n     * @param target child path targeted for watch\n     * @param wh Common watch helpers for this path\n     * @param realpath\n     * @returns closer for the watcher instance.\n     */\n    async _handleDir(dir, stats, initialAdd, depth, target, wh, realpath) {\n        const parentDir = this.fsw._getWatchedDir(sp.dirname(dir));\n        const tracked = parentDir.has(sp.basename(dir));\n        if (!(initialAdd && this.fsw.options.ignoreInitial) && !target && !tracked) {\n            this.fsw._emit(EV.ADD_DIR, dir, stats);\n        }\n        // ensure dir is tracked (harmless if redundant)\n        parentDir.add(sp.basename(dir));\n        this.fsw._getWatchedDir(dir);\n        let throttler;\n        let closer;\n        const oDepth = this.fsw.options.depth;\n        if ((oDepth == null || depth <= oDepth) && !this.fsw._symlinkPaths.has(realpath)) {\n            if (!target) {\n                await this._handleRead(dir, initialAdd, wh, target, dir, depth, throttler);\n                if (this.fsw.closed)\n                    return;\n            }\n            closer = this._watchWithNodeFs(dir, (dirPath, stats) => {\n                // if current directory is removed, do nothing\n                if (stats && stats.mtimeMs === 0)\n                    return;\n                this._handleRead(dirPath, false, wh, target, dir, depth, throttler);\n            });\n        }\n        return closer;\n    }\n    /**\n     * Handle added file, directory, or glob pattern.\n     * Delegates call to _handleFile / _handleDir after checks.\n     * @param path to file or ir\n     * @param initialAdd was the file added at watch instantiation?\n     * @param priorWh depth relative to user-supplied path\n     * @param depth Child path actually targeted for watch\n     * @param target Child path actually targeted for watch\n     */\n    async _addToNodeFs(path, initialAdd, priorWh, depth, target) {\n        const ready = this.fsw._emitReady;\n        if (this.fsw._isIgnored(path) || this.fsw.closed) {\n            ready();\n            return false;\n        }\n        const wh = this.fsw._getWatchHelpers(path);\n        if (priorWh) {\n            wh.filterPath = (entry) => priorWh.filterPath(entry);\n            wh.filterDir = (entry) => priorWh.filterDir(entry);\n        }\n        // evaluate what is at the path we're being asked to watch\n        try {\n            const stats = await statMethods[wh.statMethod](wh.watchPath);\n            if (this.fsw.closed)\n                return;\n            if (this.fsw._isIgnored(wh.watchPath, stats)) {\n                ready();\n                return false;\n            }\n            const follow = this.fsw.options.followSymlinks;\n            let closer;\n            if (stats.isDirectory()) {\n                const absPath = sp.resolve(path);\n                const targetPath = follow ? await fsrealpath(path) : path;\n                if (this.fsw.closed)\n                    return;\n                closer = await this._handleDir(wh.watchPath, stats, initialAdd, depth, target, wh, targetPath);\n                if (this.fsw.closed)\n                    return;\n                // preserve this symlink's target path\n                if (absPath !== targetPath && targetPath !== undefined) {\n                    this.fsw._symlinkPaths.set(absPath, targetPath);\n                }\n            }\n            else if (stats.isSymbolicLink()) {\n                const targetPath = follow ? await fsrealpath(path) : path;\n                if (this.fsw.closed)\n                    return;\n                const parent = sp.dirname(wh.watchPath);\n                this.fsw._getWatchedDir(parent).add(wh.watchPath);\n                this.fsw._emit(EV.ADD, wh.watchPath, stats);\n                closer = await this._handleDir(parent, stats, initialAdd, depth, path, wh, targetPath);\n                if (this.fsw.closed)\n                    return;\n                // preserve this symlink's target path\n                if (targetPath !== undefined) {\n                    this.fsw._symlinkPaths.set(sp.resolve(path), targetPath);\n                }\n            }\n            else {\n                closer = this._handleFile(wh.watchPath, stats, initialAdd);\n            }\n            ready();\n            if (closer)\n                this.fsw._addPathCloser(path, closer);\n            return false;\n        }\n        catch (error) {\n            if (this.fsw._handleError(error)) {\n                ready();\n                return path;\n            }\n        }\n    }\n}\n","import { existsSync, readdirSync, readFileSync, statSync } from \"node:fs\";\nimport { extname, join, relative, resolve } from \"node:path\";\nimport {\n  allExtensions,\n  detectLang,\n  resolverForPath,\n  type Alias,\n  type ResolveCtx,\n} from \"./languages\";\n\n// Code graph: walk every source file in the configured root(s), dispatch each file to\n// its language resolver (see ./languages), resolve import specifiers to internal file\n// paths, and return a forward-link snapshot the watcher POSTs to /api/code-graph. The\n// shape mirrors Obsidian's MetadataCache.resolvedLinks but boolean (a top-of-file\n// import dedupes to one (from, to) edge).\n//\n// Multi-root: paths are computed relative to a common base so they stay globally\n// unique and human-readable; each file is tagged with its `root` (package) and `lang`.\n\n// Directories we never want in the graph.\nconst SKIP_DIRS = new Set([\n  \"node_modules\",\n  \".git\",\n  \".next\",\n  \"dist\",\n  \"build\",\n  \"__pycache__\",\n  \"target\",\n  \".venv\",\n  \"venv\",\n  \"env\",\n  \".turbo\",\n  \"coverage\",\n  \".beacon\",\n  \".playwright-mcp\",\n  \"generated\",\n]);\n\nexport interface CodeGraphFile {\n  path: string;\n  lang: string | null;\n  root: string | null;\n  mtimeMs?: number;\n  size?: number;\n}\n\nexport interface CodeGraphSnapshot {\n  files: CodeGraphFile[];\n  edges: { from: string; to: string }[];\n  /** Per-build extraction counters — how many files were re-read vs. served from cache. */\n  stats?: { read: number; reused: number };\n}\n\n// ── Walk ──────────────────────────────────────────────────────────────────────\n\nfunction walk(root: string, dir: string, exts: Set<string>, out: string[]) {\n  let entries;\n  try {\n    entries = readdirSync(dir, { withFileTypes: true });\n  } catch {\n    return;\n  }\n  for (const e of entries) {\n    if (e.name.startsWith(\".\")) continue;\n    if (SKIP_DIRS.has(e.name)) continue;\n    const full = join(dir, e.name);\n    if (e.isDirectory()) {\n      walk(root, full, exts, out);\n      continue;\n    }\n    if (!e.isFile()) continue;\n    if (e.name.endsWith(\".d.ts\")) continue;\n    if (!exts.has(extname(e.name).toLowerCase())) continue;\n    out.push(relative(root, full));\n  }\n}\n\n/** Walk one root for indexable source files. Returns POSIX, root-relative, sorted. */\nexport function scanCodeFiles(root: string): string[] {\n  const out: string[] = [];\n  walk(root, root, allExtensions(), out);\n  return out.map((p) => p.split(/[\\\\/]/).join(\"/\")).sort();\n}\n\n// ── tsconfig paths ────────────────────────────────────────────────────────────\n\nfunction parseTsconfig(src: string): unknown {\n  // Most repos (incl. this one) use plain JSON. Try plain first — a naive comment\n  // stripper would eat across unrelated string literals and corrupt the file.\n  try {\n    return JSON.parse(src);\n  } catch {\n    /* fall through to strip */\n  }\n  const stripped = src\n    .replace(/\\/\\*[^\"]*?\\*\\//g, \"\")\n    .replace(/(^|[^:\"])\\/\\/.*$/gm, \"$1\")\n    .replace(/,\\s*([}\\]])/g, \"$1\");\n  return JSON.parse(stripped);\n}\n\nfunction normalizeRel(p: string): string {\n  return p.replace(/^\\.\\/?/, \"\").replace(/\\/$/, \"\");\n}\n\n/** tsconfig `paths` aliases for a root, repo-relative to THAT root (to = \"\" or \"src\"). */\nexport function loadTsAliases(root: string): Alias[] {\n  const path = join(root, \"tsconfig.json\");\n  if (!existsSync(path)) return [];\n  let cfg: { compilerOptions?: { paths?: Record<string, string[]>; baseUrl?: string } };\n  try {\n    cfg = parseTsconfig(readFileSync(path, \"utf8\")) as typeof cfg;\n  } catch {\n    return [];\n  }\n  const paths = cfg.compilerOptions?.paths ?? {};\n  const baseRel = normalizeRel(cfg.compilerOptions?.baseUrl ?? \".\");\n  const out: Alias[] = [];\n  for (const [pattern, targets] of Object.entries(paths)) {\n    if (!pattern.endsWith(\"/*\") || !targets.length) continue;\n    const target = targets[0];\n    if (!target.endsWith(\"/*\")) continue;\n    const from = pattern.slice(0, -1); // \"@/\"\n    const targetRel = normalizeRel(target.slice(0, -1)); // \"\" or \"src\"\n    const to = [baseRel, targetRel].filter(Boolean).join(\"/\");\n    out.push({ from, to });\n  }\n  return out;\n}\n\n/** Module path declared in a go.mod, e.g. \"example.com/app\", or null. */\nexport function loadGoModule(dir: string): string | null {\n  const path = join(dir, \"go.mod\");\n  if (!existsSync(path)) return null;\n  try {\n    const m = /^\\s*module\\s+(\\S+)/m.exec(readFileSync(path, \"utf8\"));\n    return m ? m[1] : null;\n  } catch {\n    return null;\n  }\n}\n\n// ── Build ───────────────────────────────────────────────────────────────────\n\nfunction toPosix(p: string): string {\n  return p.split(/[\\\\/]/).join(\"/\");\n}\n\n/** Longest common directory prefix of absolute paths (POSIX-normalized). */\nfunction commonAncestor(paths: string[]): string {\n  if (paths.length === 1) return paths[0];\n  const split = paths.map((p) => toPosix(p).split(\"/\"));\n  const first = split[0];\n  let i = 0;\n  for (; i < first.length; i++) {\n    if (!split.every((s) => s[i] === first[i])) break;\n  }\n  return first.slice(0, i).join(\"/\") || \"/\";\n}\n\ninterface FileMeta {\n  path: string; // base-relative POSIX\n  abs: string;\n  root: string | null;\n  mtimeMs: number;\n  size: number;\n}\n\n/** Scan + stat all roots (cheap, no file reads). Resolves the base + ResolveCtx. */\nfunction scanRoots(rootOrRoots: string | string[], base?: string): { metas: FileMeta[]; ctx: ResolveCtx } {\n  const roots = (Array.isArray(rootOrRoots) ? rootOrRoots : [rootOrRoots]).map((r) => toPosix(resolve(r)));\n  const baseDir = toPosix(base ? resolve(base) : roots.length === 1 ? roots[0] : commonAncestor(roots));\n\n  const byPath = new Map<string, FileMeta>();\n  const aliases: Alias[] = [];\n  for (const root of roots) {\n    const rootRel = toPosix(relative(baseDir, root)); // \"\" for the base root, \"packages/api\" for a sub-root\n    for (const a of loadTsAliases(root)) {\n      aliases.push({ from: a.from, to: [rootRel, a.to].filter(Boolean).join(\"/\") });\n    }\n    for (const rel of scanCodeFiles(root)) {\n      const abs = toPosix(join(root, rel));\n      const path = toPosix(relative(baseDir, abs));\n      if (byPath.has(path)) continue; // overlapping roots — keep first\n      try {\n        const st = statSync(abs);\n        byPath.set(path, { path, abs, root: rootRel || null, mtimeMs: st.mtimeMs, size: st.size });\n      } catch {\n        /* vanished between readdir and stat — skip */\n      }\n    }\n  }\n\n  const goModulePath = roots.map(loadGoModule).find(Boolean) ?? loadGoModule(baseDir);\n  const metas = [...byPath.values()].sort((a, b) => a.path.localeCompare(b.path));\n  return { metas, ctx: { fileSet: new Set(byPath.keys()), tsAliases: aliases, goModulePath } };\n}\n\n/** Read + extract one file's import specifiers. Giant/unreadable files contribute none. */\nfunction extractSpecifiers(meta: FileMeta): Set<string> {\n  const resolver = resolverForPath(meta.path);\n  if (!resolver || meta.size > 200_000) return new Set();\n  try {\n    return resolver.specifiers(readFileSync(meta.abs, \"utf8\"));\n  } catch {\n    return new Set();\n  }\n}\n\n/**\n * Stateful, incremental code-graph builder. Caches each file's extracted import\n * specifiers keyed by (mtimeMs, size); a rebuild re-reads ONLY files whose stat\n * changed and reuses cached specifiers for the rest — so a save in a large repo\n * re-parses one file, not thousands. Resolution still runs every build against the\n * fresh file set, so adding a file correctly lights up edges from unchanged importers.\n */\nexport function createCodeGraphBuilder(rootOrRoots: string | string[], base?: string) {\n  const cache = new Map<string, { mtimeMs: number; size: number; specifiers: Set<string> }>();\n\n  function build(): CodeGraphSnapshot {\n    const { metas, ctx } = scanRoots(rootOrRoots, base);\n    const present = new Set(metas.map((m) => m.path));\n    for (const k of [...cache.keys()]) if (!present.has(k)) cache.delete(k);\n\n    let read = 0;\n    let reused = 0;\n    const edges: { from: string; to: string }[] = [];\n    for (const m of metas) {\n      const cached = cache.get(m.path);\n      let specs: Set<string>;\n      if (cached && cached.mtimeMs === m.mtimeMs && cached.size === m.size) {\n        specs = cached.specifiers;\n        reused++;\n      } else {\n        specs = extractSpecifiers(m);\n        cache.set(m.path, { mtimeMs: m.mtimeMs, size: m.size, specifiers: specs });\n        read++;\n      }\n      const resolver = resolverForPath(m.path);\n      if (!resolver) continue;\n      const seen = new Set<string>();\n      for (const spec of specs) {\n        for (const hit of resolver.resolve(spec, m.path, ctx)) {\n          if (!hit || hit === m.path || seen.has(hit)) continue;\n          seen.add(hit);\n          edges.push({ from: m.path, to: hit });\n        }\n      }\n    }\n\n    const files: CodeGraphFile[] = metas.map((m) => ({\n      path: m.path,\n      lang: detectLang(m.path),\n      root: m.root,\n      mtimeMs: m.mtimeMs,\n      size: m.size,\n    }));\n    return { files, edges, stats: { read, reused } };\n  }\n\n  return { build };\n}\n\n/**\n * One-shot code-graph snapshot (no caching across calls). Accepts a single root\n * (back-compat) or many; with many, every path is computed relative to their common\n * base so paths stay unique + readable.\n */\nexport function buildCodeGraph(rootOrRoots: string | string[], base?: string): CodeGraphSnapshot {\n  return createCodeGraphBuilder(rootOrRoots, base).build();\n}\n","import { dirname, resolve as resolvePath } from \"node:path\";\nimport type { Alias, LanguageResolver, ResolveCtx } from \"./types\";\n\n// TS/JS resolver. This is the precise path that understands `tsconfig` `paths`\n// aliases, index files, and every import form (static, dynamic, bare side-effect,\n// require). Patterns and resolution match the original intel/extractors/code-graph.ts\n// behavior exactly — the code-graph build now delegates here.\n\nexport const TS_EXTENSIONS = [\".ts\", \".tsx\", \".js\", \".jsx\", \".mjs\", \".cjs\"];\n\nconst IMPORT_PATTERNS = [\n  /(?:^|[\\n;])\\s*(?:import|export)[^'\"`\\n]*?from\\s*['\"]([^'\"`]+)['\"]/g,\n  /(?:^|[\\n;])\\s*import\\s*['\"]([^'\"`]+)['\"]/g, // bare side-effect import\n  /\\brequire\\(\\s*['\"]([^'\"`]+)['\"]\\s*\\)/g,\n  /\\bimport\\(\\s*['\"]([^'\"`]+)['\"]\\s*\\)/g,\n];\n\nfunction toPosix(p: string): string {\n  return p.split(/[\\\\/]/).join(\"/\");\n}\n\n/** Try a repo-relative base against the file set: exact, +ext, /index+ext. */\nfunction probe(repoRel: string, fileSet: Set<string>): string | null {\n  if (fileSet.has(repoRel)) return repoRel;\n  for (const ext of TS_EXTENSIONS) {\n    const p = `${repoRel}${ext}`;\n    if (fileSet.has(p)) return p;\n  }\n  for (const ext of TS_EXTENSIONS) {\n    const p = `${repoRel}/index${ext}`;\n    if (fileSet.has(p)) return p;\n  }\n  return null;\n}\n\nfunction specifiers(content: string): Set<string> {\n  const out = new Set<string>();\n  for (const re of IMPORT_PATTERNS) {\n    re.lastIndex = 0;\n    let m: RegExpExecArray | null;\n    while ((m = re.exec(content))) out.add(m[1]);\n  }\n  return out;\n}\n\nfunction resolveSpec(\n  spec: string,\n  fromFile: string,\n  fileSet: Set<string>,\n  aliases: Alias[],\n): string | null {\n  if (spec.startsWith(\".\")) {\n    const abs = resolvePath(\"/\", dirname(fromFile), spec); // \"/\"-rooted, harmless\n    const repoRel = toPosix(abs).replace(/^\\//, \"\");\n    return probe(repoRel, fileSet);\n  }\n  // Try every alias whose prefix matches and return the first that hits a real file.\n  // (Single-root: one alias. Monorepo: two roots may both define `@/`, so we must not\n  // stop at the first prefix match — only at the first that actually resolves.)\n  for (const a of aliases) {\n    if (spec.startsWith(a.from)) {\n      const rest = spec.slice(a.from.length);\n      const repoRel = a.to ? `${a.to}/${rest}` : rest;\n      const hit = probe(repoRel, fileSet);\n      if (hit) return hit;\n    }\n  }\n  return null; // bare package — external\n}\n\nexport const tsResolver: LanguageResolver = {\n  id: \"ts\",\n  extensions: TS_EXTENSIONS,\n  specifiers,\n  resolve(spec, fromFile, ctx: ResolveCtx) {\n    const hit = resolveSpec(spec, fromFile, ctx.fileSet, ctx.tsAliases ?? []);\n    return hit ? [hit] : [];\n  },\n};\n","import { dirname, join, normalize } from \"node:path\";\nimport type { LanguageResolver, ResolveCtx } from \"./types\";\n\n// Python resolver. Handles the two real import shapes:\n//   import pkg.mod / from pkg.mod import x   → absolute dotted module\n//   from .mod import x / from ..pkg import y → package-relative (leading dots)\n// Resolves to a `.py`/`.pyi` file or a package `__init__.py`. Absolute imports are\n// probed repo-relative (a source-root prefix like `src/` is handled at build time by\n// the base-relative path scheme); unresolved → external (stdlib / third-party).\n\nexport const PY_EXTENSIONS = [\".py\", \".pyi\"];\n\nconst PATTERNS = [\n  /(?:^|[\\n;])\\s*from\\s+(\\.*[\\w.]*)\\s+import\\b/g, // from .mod import x  |  from pkg.mod import x\n  /(?:^|[\\n;])\\s*import\\s+([\\w.]+(?:\\s*,\\s*[\\w.]+)*)/g, // import a.b, c.d\n];\n\nfunction probe(base: string, fileSet: Set<string>): string[] {\n  for (const cand of [`${base}.py`, `${base}/__init__.py`, `${base}.pyi`]) {\n    if (fileSet.has(cand)) return [cand];\n  }\n  return [];\n}\n\nfunction specifiers(content: string): Set<string> {\n  const out = new Set<string>();\n  // from ... import\n  PATTERNS[0].lastIndex = 0;\n  let m: RegExpExecArray | null;\n  while ((m = PATTERNS[0].exec(content))) {\n    const s = m[1].trim();\n    if (s) out.add(s);\n  }\n  // import a.b, c.d  → split the comma list\n  PATTERNS[1].lastIndex = 0;\n  while ((m = PATTERNS[1].exec(content))) {\n    for (const tok of m[1].split(/\\s*,\\s*/)) {\n      const t = tok.trim().split(/\\s+as\\s+/)[0].trim();\n      if (t) out.add(t);\n    }\n  }\n  return out;\n}\n\nexport const pythonResolver: LanguageResolver = {\n  id: \"python\",\n  extensions: PY_EXTENSIONS,\n  specifiers,\n  resolve(spec, fromFile, ctx: ResolveCtx) {\n    if (spec.startsWith(\".\")) {\n      // Leading dots: 1 = current package, each extra = one level up.\n      const dots = spec.length - spec.replace(/^\\.+/, \"\").length;\n      const rest = spec.slice(dots); // module path after the dots (may be \"\")\n      let dir = dirname(fromFile);\n      for (let i = 1; i < dots; i++) dir = dirname(dir);\n      // \"from . import x\" loses x — best-effort resolves to the package itself.\n      const base = rest ? join(dir, rest.replace(/\\./g, \"/\")) : dir;\n      return probe(normalize(base).replace(/\\\\/g, \"/\"), ctx.fileSet);\n    }\n    // Absolute dotted module, probed repo-relative.\n    return probe(spec.replace(/\\./g, \"/\"), ctx.fileSet);\n  },\n};\n","import { dirname } from \"node:path\";\nimport type { LanguageResolver, ResolveCtx } from \"./types\";\n\n// Go resolver. Go imports are package paths (\"example.com/app/util\"), not file paths.\n// With the module path from go.mod, an import under that prefix maps to a package\n// directory; the package is every .go file directly in that dir. We emit an edge to\n// each of them (a file-level approximation of \"this file depends on that package\").\n// Imports outside the module (stdlib, third-party) are external → [].\n\nexport const GO_EXTENSIONS = [\".go\"];\n\nconst SINGLE = /(?:^|[\\n;])\\s*import\\s+(?:[\\w.]+\\s+)?\"([^\"]+)\"/g; // import \"x\"  |  import alias \"x\"\nconst BLOCK = /(?:^|[\\n;])\\s*import\\s*\\(([\\s\\S]*?)\\)/g; // import ( \"a\" \\n \"b\" )\nconst QUOTED = /\"([^\"]+)\"/g;\n\nfunction specifiers(content: string): Set<string> {\n  const out = new Set<string>();\n  SINGLE.lastIndex = 0;\n  let m: RegExpExecArray | null;\n  while ((m = SINGLE.exec(content))) out.add(m[1]);\n  BLOCK.lastIndex = 0;\n  while ((m = BLOCK.exec(content))) {\n    QUOTED.lastIndex = 0;\n    let q: RegExpExecArray | null;\n    while ((q = QUOTED.exec(m[1]))) out.add(q[1]);\n  }\n  return out;\n}\n\nexport const goResolver: LanguageResolver = {\n  id: \"go\",\n  extensions: GO_EXTENSIONS,\n  resolve(spec, _fromFile, ctx: ResolveCtx) {\n    const mod = ctx.goModulePath;\n    if (!mod) return [];\n    let dir: string | null = null;\n    if (spec === mod) dir = \"\";\n    else if (spec.startsWith(`${mod}/`)) dir = spec.slice(mod.length + 1);\n    if (dir === null) return []; // stdlib / third-party\n    const out: string[] = [];\n    for (const p of ctx.fileSet) {\n      if (!p.endsWith(\".go\")) continue;\n      const d = dirname(p);\n      if ((dir === \"\" && d === \".\") || d === dir) out.push(p);\n    }\n    return out.sort();\n  },\n  specifiers,\n};\n","import { basename, dirname, join, normalize } from \"node:path\";\nimport type { LanguageResolver, ResolveCtx } from \"./types\";\n\n// Rust resolver. The module tree is declared structurally, so we key off:\n//   mod foo;            → submodule foo  (foo.rs | foo/mod.rs, sibling or owner-dir)\n//   use crate::a::b;    → crate-root-relative\n//   use super::x; / use self::y; → relative\n// Best-effort and deterministic; symbol-level precision is out of scope.\n\nexport const RS_EXTENSIONS = [\".rs\"];\n\nconst MOD = /(?:^|[\\n;])\\s*(?:pub\\s+)?mod\\s+(\\w+)\\s*;/g;\nconst USE = /(?:^|[\\n;])\\s*(?:pub\\s+)?use\\s+([\\w:]+)/g;\n\nfunction normalizeUse(path: string): string {\n  const segs = path.split(\"::\").filter((s) => s && s !== \"*\");\n  if (!segs.length) return \"\";\n  if (segs[0] === \"crate\") return [\"crate\", ...segs.slice(1)].join(\"/\");\n  if (segs[0] === \"super\") return [\"..\", ...segs.slice(1)].join(\"/\");\n  if (segs[0] === \"self\") return [\".\", ...segs.slice(1)].join(\"/\");\n  return segs.join(\"/\"); // external crate (std, serde, …)\n}\n\nfunction probeRs(base: string, fileSet: Set<string>): string[] {\n  for (const cand of [`${base}.rs`, `${base}/mod.rs`]) {\n    if (fileSet.has(cand)) return [cand];\n  }\n  return [];\n}\n\nconst ROOT_FILES = new Set([\"mod.rs\", \"lib.rs\", \"main.rs\"]);\n\nfunction specifiers(content: string): Set<string> {\n  const out = new Set<string>();\n  MOD.lastIndex = 0;\n  let m: RegExpExecArray | null;\n  while ((m = MOD.exec(content))) out.add(`./${m[1]}`);\n  USE.lastIndex = 0;\n  while ((m = USE.exec(content))) {\n    const n = normalizeUse(m[1]);\n    if (n) out.add(n);\n  }\n  return out;\n}\n\nexport const rustResolver: LanguageResolver = {\n  id: \"rust\",\n  extensions: RS_EXTENSIONS,\n  specifiers,\n  resolve(spec, fromFile, ctx: ResolveCtx) {\n    const fileSet = ctx.fileSet;\n    if (spec.startsWith(\"./\") || spec.startsWith(\"../\")) {\n      const name = spec.replace(/^\\.\\//, \"\");\n      // Candidate 1: sibling of the current file.\n      const sibling = normalize(join(dirname(fromFile), spec)).replace(/\\\\/g, \"/\");\n      let hit = probeRs(sibling, fileSet);\n      if (hit.length) return hit;\n      // Candidate 2: owner-directory rule — `mod x;` in `foo.rs` lives in `foo/x.rs`.\n      if (spec.startsWith(\"./\") && !ROOT_FILES.has(basename(fromFile))) {\n        const owner = join(dirname(fromFile), basename(fromFile, \".rs\"), name);\n        hit = probeRs(normalize(owner).replace(/\\\\/g, \"/\"), fileSet);\n        if (hit.length) return hit;\n      }\n      return [];\n    }\n    if (spec.startsWith(\"crate/\")) {\n      // Resolve against the nearest `src/` ancestor of the importing file.\n      const parts = fromFile.split(\"/\");\n      const srcIdx = parts.lastIndexOf(\"src\");\n      const srcRoot = srcIdx >= 0 ? parts.slice(0, srcIdx + 1).join(\"/\") : dirname(fromFile);\n      const rest = spec.slice(\"crate/\".length).split(\"/\");\n      // Try full path, then drop the trailing segment (often an item, not a module).\n      for (const r of [rest.join(\"/\"), rest.slice(0, -1).join(\"/\")]) {\n        if (!r) continue;\n        const hit = probeRs(`${srcRoot}/${r}`, fileSet);\n        if (hit.length) return hit;\n      }\n      return [];\n    }\n    return []; // external crate\n  },\n};\n","import { dirname, extname, join, normalize } from \"node:path\";\nimport type { LanguageResolver, ResolveCtx } from \"./types\";\n\n// Heuristic fallback for every recognized source extension without a precise\n// resolver (Swift, Java, Ruby, Kotlin, C#, PHP, C/C++, …). Best-effort and\n// deterministic: extract common import/require/include/using forms, then resolve\n// path-like specifiers relative to the importing file (preferring its own\n// extension) or repo-relative. Module-only specifiers that map to no file\n// (e.g. Swift `import Foo`) stay unresolved — that's the documented tradeoff.\n\nexport const FALLBACK_EXTENSIONS = [\n  \".swift\", \".java\", \".rb\", \".kt\", \".kts\", \".cs\", \".php\", \".scala\",\n  \".c\", \".h\", \".cpp\", \".hpp\", \".cc\", \".hh\", \".m\", \".mm\",\n  \".ex\", \".exs\", \".lua\", \".dart\", \".vue\", \".svelte\",\n];\n\nconst PATTERNS = [\n  /\\b(?:require_relative|require|include|import|use|using|from)\\s*\\(?\\s*['\"]([^'\"`\\n]+)['\"]/g,\n  /(?:^|[\\n;])\\s*import\\s+([\\w.]+)/g, // java/swift: import a.b.C\n  /(?:^|[\\n;])\\s*from\\s+([\\w.]+)\\s+import\\b/g, // python-like\n  /(?:^|[\\n;])\\s*using\\s+([\\w.]+)\\s*;/g, // C#: using A.B;\n  /(?:^|[\\n;])\\s*use\\s+([\\w\\\\]+)/g, // php: use A\\B\\C;\n  /#\\s*include\\s*[<\"]([^>\"\\n]+)[>\"]/g, // C/C++: #include \"x\"\n];\n\nfunction specifiers(content: string): Set<string> {\n  const out = new Set<string>();\n  for (const re of PATTERNS) {\n    re.lastIndex = 0;\n    let m: RegExpExecArray | null;\n    while ((m = re.exec(content))) {\n      const s = m[1].trim();\n      if (s) out.add(s);\n    }\n  }\n  return out;\n}\n\nexport const fallbackResolver: LanguageResolver = {\n  id: \"fallback\",\n  extensions: FALLBACK_EXTENSIONS,\n  specifiers,\n  resolve(spec, fromFile, ctx: ResolveCtx) {\n    const own = extname(fromFile).toLowerCase();\n    const exts = [own, ...FALLBACK_EXTENSIONS].filter((e, i, a) => e && a.indexOf(e) === i);\n\n    const hasSep = spec.includes(\"/\") || spec.includes(\"\\\\\");\n    // Path-like (relative or already slashed) → keep; dotted/`::` module → slashes.\n    const path = spec.startsWith(\".\") || hasSep\n      ? spec.replace(/\\\\/g, \"/\")\n      : spec.replace(/[.:]+/g, \"/\");\n\n    const bases = [\n      normalize(join(dirname(fromFile), path)).replace(/\\\\/g, \"/\"), // relative to file\n      path.replace(/^\\.\\//, \"\"), // repo-relative\n    ];\n    for (const b of bases) {\n      if (ctx.fileSet.has(b)) return [b]; // spec already had an extension\n      for (const e of exts) {\n        const cand = b.endsWith(e) ? b : `${b}${e}`;\n        if (ctx.fileSet.has(cand)) return [cand];\n        if (ctx.fileSet.has(`${b}/index${e}`)) return [`${b}/index${e}`];\n      }\n    }\n    return [];\n  },\n};\n","import { extname } from \"node:path\";\nimport type { LanguageResolver } from \"./types\";\nimport { tsResolver } from \"./ts\";\nimport { pythonResolver } from \"./python\";\nimport { goResolver } from \"./go\";\nimport { rustResolver } from \"./rust\";\nimport { fallbackResolver } from \"./fallback\";\n\nexport type { Alias, LanguageResolver, ResolveCtx } from \"./types\";\n\n// The registry: precise resolvers first, the heuristic fallback last. Extensions are\n// disjoint, so dispatch is unambiguous; the order only documents intent.\nexport const RESOLVERS: LanguageResolver[] = [\n  tsResolver,\n  pythonResolver,\n  goResolver,\n  rustResolver,\n  fallbackResolver,\n];\n\nconst RESOLVER_BY_EXT = new Map<string, LanguageResolver>();\nfor (const r of RESOLVERS) for (const e of r.extensions) RESOLVER_BY_EXT.set(e, r);\n\n// Extension → clean, groupable language id (for the CodeFile.lang tag + canvas color).\n// Extensions present in the registry but absent here fall back to the bare extension.\nconst LANG_BY_EXT: Record<string, string> = {\n  \".ts\": \"ts\", \".tsx\": \"ts\",\n  \".js\": \"js\", \".jsx\": \"js\", \".mjs\": \"js\", \".cjs\": \"js\",\n  \".py\": \"py\", \".pyi\": \"py\",\n  \".go\": \"go\",\n  \".rs\": \"rs\",\n  \".swift\": \"swift\",\n  \".java\": \"java\",\n  \".rb\": \"ruby\",\n  \".kt\": \"kotlin\", \".kts\": \"kotlin\",\n  \".cs\": \"csharp\",\n  \".php\": \"php\",\n  \".scala\": \"scala\",\n  \".c\": \"c\", \".h\": \"c\",\n  \".cpp\": \"cpp\", \".hpp\": \"cpp\", \".cc\": \"cpp\", \".hh\": \"cpp\",\n  \".m\": \"objc\", \".mm\": \"objc\",\n  \".ex\": \"elixir\", \".exs\": \"elixir\",\n  \".lua\": \"lua\", \".dart\": \"dart\", \".vue\": \"vue\", \".svelte\": \"svelte\",\n};\n\n/** The resolver that handles this file's extension, or null if not a source file. */\nexport function resolverForPath(path: string): LanguageResolver | null {\n  return RESOLVER_BY_EXT.get(extname(path).toLowerCase()) ?? null;\n}\n\n/** Clean language id for a path (by extension), or null if not graphed. */\nexport function detectLang(path: string): string | null {\n  const ext = extname(path).toLowerCase();\n  if (!RESOLVER_BY_EXT.has(ext)) return null;\n  return LANG_BY_EXT[ext] ?? ext.slice(1);\n}\n\n/** Every extension any resolver claims — the scanner's allow-list. */\nexport function allExtensions(): Set<string> {\n  return new Set(RESOLVER_BY_EXT.keys());\n}\n","import { existsSync, readFileSync } from \"node:fs\";\nimport { join, resolve } from \"node:path\";\nimport chokidar from \"chokidar\";\nimport { createCodeGraphBuilder } from \"@/intel/extractors/code-graph\";\nimport { ingestCodeGraph } from \"@/lib/code-graph\";\nimport { getDb } from \"@/lib/db-drizzle\";\nimport { dbUrlFor, ensureWorkspaceDb } from \"@/lib/workspaces\";\n\n// Per-workspace in-process code-graph watcher. The manager (intel/watch-manager.ts)\n// starts one of these per active repo. Each pins its writes to its OWN workspace DB —\n// never the dropdown-active one — so a save in repo A can never corrupt repo B's graph.\n// Code-graph only (cheap, deterministic, no AI); the standalone intel/watch.ts still\n// owns the AI DB/endpoints pipeline. Both writers are idempotent so co-running is safe.\n\nconst IGNORE =\n  /[/\\\\](node_modules|\\.git|\\.next|dist|build|__pycache__|target|\\.venv|venv|\\.beacon|\\.playwright-mcp|generated|coverage)[/\\\\]/;\n\ninterface WatchTarget {\n  id: string;\n  path: string;\n  name: string;\n}\n\n/** Configured roots for a repo: beacon.config.json `roots` if present, else the repo itself. */\nfunction rootsForRepo(repoPath: string): string[] {\n  try {\n    const cfgPath = join(repoPath, \"beacon.config.json\");\n    if (existsSync(cfgPath)) {\n      const cfg = JSON.parse(readFileSync(cfgPath, \"utf8\"));\n      if (Array.isArray(cfg.roots) && cfg.roots.length) {\n        return cfg.roots.map((r: string) => resolve(repoPath, r));\n      }\n    }\n  } catch {\n    /* malformed config — fall back to the repo root */\n  }\n  return [repoPath];\n}\n\n/** Start a live, incremental code-graph watcher for one workspace. */\nexport function startWatcherForWorkspace(ws: WatchTarget): { stop: () => Promise<void> } {\n  const roots = rootsForRepo(ws.path);\n  // Provision/migrate in the background and await it before the first ingest (below) so a brand-new\n  // or migration-behind db is ready when the watcher's first tick writes. Cached per process → cheap.\n  const dbReady = ensureWorkspaceDb(ws.id);\n  const targetDb = getDb(dbUrlFor(ws.id));\n\n  // One builder for the watcher's lifetime — its specifier cache makes each tick\n  // incremental (only changed files are re-read). Base = repo path → repo-relative paths.\n  const builder = createCodeGraphBuilder(roots, ws.path);\n  let debounce: ReturnType<typeof setTimeout> | null = null;\n  let running = false;\n\n  async function run() {\n    if (running) {\n      schedule();\n      return;\n    }\n    running = true;\n    try {\n      await dbReady;\n      const graph = builder.build();\n      const r = await ingestCodeGraph(graph, targetDb);\n      console.log(\n        `[beacon-inline] code-graph synced (${ws.name}): ${r.files} files / ${r.edges} imports${\n          r.circular > 0 ? ` (${r.circular} circular)` : \"\"\n        }`,\n      );\n    } catch (e) {\n      console.error(`[beacon-inline] error (${ws.name}):`, e instanceof Error ? e.message : e);\n    } finally {\n      running = false;\n    }\n  }\n\n  function schedule() {\n    if (debounce) clearTimeout(debounce);\n    debounce = setTimeout(run, 600);\n  }\n\n  const watcher = chokidar.watch(roots, {\n    ignored: (p: string) => IGNORE.test(p),\n    ignoreInitial: true,\n    persistent: true,\n  });\n\n  watcher.on(\"ready\", () => {\n    console.log(`[beacon-inline] watching ${ws.name} (${roots.join(\", \")}) — initial extract…`);\n    void run();\n  });\n  watcher.on(\"all\", () => schedule());\n  watcher.on(\"error\", (e) => console.error(`[beacon-inline] watcher error (${ws.name}):`, e));\n\n  return {\n    async stop() {\n      if (debounce) clearTimeout(debounce);\n      await watcher.close();\n    },\n  };\n}\n","import { existsSync } from \"node:fs\";\nimport { getWorkspace, listWorkspaces } from \"@/lib/workspaces\";\nimport { startWatcherForWorkspace } from \"@/intel/watch-inline\";\n\n// Manages one code-graph watcher per ACTIVE workspace. The Beacon daemon serves every\n// registered repo, but watching all of them would be N chokidar instances + N scans for\n// repos you aren't using. So we watch the recently-opened subset (top-N by lastOpenedAt)\n// and lazily warm a watcher for any repo the moment it's queried (ensureWatcher). The\n// active-watcher set doubles as the staleness signal's \"is this repo being watched?\".\n\nexport interface WatchableWorkspace {\n  id: string;\n  path: string;\n  name: string;\n}\n\nexport interface WatcherHandle {\n  stop: () => Promise<void>;\n}\n\nexport interface WatcherManagerDeps {\n  list: () => WatchableWorkspace[]; // registry, most-recently-opened first\n  get: (id: string) => WatchableWorkspace | null;\n  exists: (path: string) => boolean;\n  start: (ws: WatchableWorkspace) => WatcherHandle;\n  /** How many top workspaces get an auto-started watcher on boot/reconcile. */\n  limit?: number;\n  /** Absolute cap on concurrent watchers (auto + lazy) before LRU eviction kicks in. */\n  hardCap?: number;\n}\n\nexport function createWatcherManager(deps: WatcherManagerDeps) {\n  const limit = deps.limit ?? 6;\n  const hardCap = deps.hardCap ?? 12;\n  const active = new Map<string, { handle: WatcherHandle; seq: number }>();\n  let seq = 0;\n  let topIds = new Set<string>();\n\n  function touch(id: string): void {\n    const e = active.get(id);\n    if (e) e.seq = ++seq;\n  }\n\n  function startFor(ws: WatchableWorkspace): void {\n    if (active.has(ws.id)) return touch(ws.id);\n    if (!deps.exists(ws.path)) return;\n    active.set(ws.id, { handle: deps.start(ws), seq: ++seq });\n  }\n\n  /** Stop the oldest watcher that isn't in the current top-N (protected) set. */\n  function evictLruNonTop(): void {\n    let victim: string | null = null;\n    let min = Infinity;\n    for (const [id, e] of active) {\n      if (topIds.has(id)) continue;\n      if (e.seq < min) {\n        min = e.seq;\n        victim = id;\n      }\n    }\n    if (victim) {\n      void active.get(victim)!.handle.stop();\n      active.delete(victim);\n    }\n  }\n\n  /** Start watchers for the top-N existing workspaces; stop any whose repo vanished. */\n  function reconcile(): void {\n    const top = deps.list().filter((w) => deps.exists(w.path)).slice(0, limit);\n    topIds = new Set(top.map((w) => w.id));\n    for (const ws of top) startFor(ws);\n    for (const [id, e] of [...active]) {\n      const ws = deps.get(id);\n      if (!ws || !deps.exists(ws.path)) {\n        void e.handle.stop();\n        active.delete(id);\n      }\n    }\n  }\n\n  /** Lazily warm a watcher for a repo being queried (no-op if already watching). */\n  function ensureWatcher(id: string): void {\n    if (active.has(id)) return touch(id);\n    const ws = deps.get(id);\n    if (!ws || !deps.exists(ws.path)) return;\n    if (active.size >= hardCap) evictLruNonTop();\n    if (active.size >= hardCap) return; // every watcher is top-N protected — refuse\n    active.set(id, { handle: deps.start(ws), seq: ++seq });\n  }\n\n  function isWatching(id: string): boolean {\n    return active.has(id);\n  }\n\n  function activeIds(): string[] {\n    return [...active.keys()];\n  }\n\n  async function stopAll(): Promise<void> {\n    await Promise.all([...active.values()].map((e) => e.handle.stop()));\n    active.clear();\n  }\n\n  return { reconcile, ensureWatcher, isWatching, activeIds, stopAll };\n}\n\n// ── Process-wide singleton, wired to the real registry + watcher factory ──────────\n\nconst manager = createWatcherManager({\n  list: listWorkspaces,\n  get: getWorkspace,\n  exists: existsSync,\n  start: (ws) => startWatcherForWorkspace(ws),\n});\n\nlet timer: ReturnType<typeof setInterval> | null = null;\n\n/** Boot watchers for the active workspaces and keep reconciling as the registry changes. */\nexport function startWorkspaceWatchers(): void {\n  manager.reconcile();\n  if (!timer) {\n    timer = setInterval(() => manager.reconcile(), 30_000);\n    timer.unref?.();\n  }\n}\n\n/** Lazily ensure a queried repo has a live watcher (called by the context/blast-radius routes). */\nexport function ensureWatcher(id: string): void {\n  manager.ensureWatcher(id);\n}\n\n/** Whether a workspace's code graph is being kept live right now (staleness signal). */\nexport function isWatching(id: string): boolean {\n  return manager.isWatching(id);\n}\n\nexport async function stopWorkspaceWatchers(): Promise<void> {\n  if (timer) {\n    clearInterval(timer);\n    timer = null;\n  }\n  await manager.stopAll();\n}\n"],"names":["EntryTypes","FILE_TYPE","DIR_TYPE","FILE_DIR_TYPE","EVERYTHING_TYPE","defaultOptions","root","fileFilter","_entryInfo","directoryFilter","type","lstat","depth","alwaysStat","highWaterMark","Object","freeze","RECURSIVE_ERROR_CODE","NORMAL_FLOW_ERRORS","Set","ALL_TYPES","DIR_TYPES","FILE_TYPES","isNormalFlowError","error","has","code","wantBigintFsStats","process","platform","emptyFn","normalizeFilter","filter","undefined","fl","trim","entry","basename","Array","isArray","trItems","map","item","some","f","ReaddirpStream","parents","reading","parent","_stat","_maxDepth","_wantsDir","_wantsFile","_wantsEverything","_root","_isDirent","_statsProp","_rdOptions","_fileFilter","_directoryFilter","options","objectMode","autoDestroy","opts","statMethod","Number","isSafeInteger","encoding","withFileTypes","_exploreDir","_read","batch","destroyed","par","fil","files","length","path","slice","splice","dirent","_formatEntry","awaited","Promise","all","entryType","_getEntryType","push","fullPath","_includeAsFile","pop","destroy","_onError","name","err","emit","stats","isFile","isDirectory","isSymbolicLink","full","entryRealPath","entryRealPathStats","len","startsWith","substr","recursiveError","Error","readdirp","TypeError","includes","join","readdirpPromise","resolve","reject","on","TS_EXTENSIONS","IMPORT_PATTERNS","toPosix","p","split","probe","repoRel","fileSet","ext","specifiers","content","out","re","lastIndex","m","exec","add","resolveSpec","spec","fromFile","aliases","abs","replace","a","from","rest","to","hit","tsResolver","id","extensions","ctx","tsAliases","IGNORE","rootsForRepo","repoPath","cfgPath","cfg","JSON","parse","roots","r","startWatcherForWorkspace","ws","dbReady","targetDb","builder","debounce","running","run","schedule","graph","build","console","log","edges","circular","e","message","clearTimeout","setTimeout","watcher","watch","ignored","test","ignoreInitial","persistent","stop","close","createWatcherManager","deps","limit","hardCap","active","Map","seq","topIds","touch","get","startFor","exists","set","handle","start","evictLruNonTop","victim","min","Infinity","delete","reconcile","top","list","w","ensureWatcher","size","isWatching","activeIds","keys","stopAll","values","clear","manager","timer","startWorkspaceWatchers","setInterval","unref","stopWorkspaceWatchers","clearInterval"],"mappings":"4QACA,IAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,MACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OCFA,EAAA,EAAA,CAAA,CAAA,OACO,MAAMA,AACE,UACD,GAFY,aAGP,oBAGbK,EAAiB,CACnBC,KAAM,IACNC,WAAY,AAACC,IAAe,EAC5BC,gBAAiB,AAACD,IAAe,EACjCE,IAAAA,EAAMV,CACNW,OAAO,EACPC,CAFiBX,KAEV,IAFmB,OAG1BY,YAAY,EACZC,cAAe,IACnB,EACAC,OAAOC,MAAM,CAACX,GACd,IAAMY,EAAuB,2BACvBC,EAAqB,IAAIC,IAAI,CAAC,SAAU,QAAS,SAAU,QAASF,EAAqB,EACzFG,EAAY,aAKjB,CACKC,EAAY,IAAIF,IAAI,WAIzB,EACKG,EAAa,IAAIH,IAAI,WAI1B,EAEyBS,QAAQC,QAAQ,CAC1C,IAD+C,AACzCC,EAAU,AAACtB,IAAe,EAC1BuB,EAAkB,AAACC,IACrB,GAAIA,AAAWC,WACX,OAAOH,EACX,GAAsB,YAAlB,OAAOE,EACP,OAAOA,EACX,GAAsB,UAAlB,OAAOA,EAAqB,CAC5B,IAAME,EAAKF,EAAOG,IAAI,GACtB,OAAO,AAACC,GAAUA,EAAMC,QAAQ,GAAKH,CACzC,CACA,GAAII,MAAMC,OAAO,CAACP,GAAS,CACvB,IAAMQ,EAAUR,EAAOS,GAAG,CAAC,AAACC,GAASA,EAAKP,IAAI,IAC9C,OAAO,AAACC,GAAUI,EAAQG,IAAI,CAAC,AAACC,GAAMR,EAAMC,QAAQ,GAAKO,EAC7D,CACA,OAAOd,CACX,CAEO,OAAMe,UAAuB,EAAA,QAAQ,CACxCC,OAAQ,CACRC,OAAQ,CACRC,MAAO,CACPC,KAAM,CACNC,SAAU,CACVC,SAAU,CACVC,UAAW,AACXC,iBAAiB,CACjBC,KAAM,CACNC,SAAU,CACVC,UAAW,CACXC,UAAW,CACXC,WAAY,CACZC,gBAAiB,AACjBd,aAAYe,EAAU,CAAC,CAAC,CAAE,CACtB,KAAK,CAAC,CACFC,YAAY,EACZC,aAAa,EACbhD,cAAe8C,EAAQ9C,aAAa,AACxC,GACA,MAAMiD,EAAO,CAAE,GAAG1D,CAAc,CAAE,GAAGuD,CAAO,AAAC,EACvC,MAAEtD,CAAI,MAAEI,CAAI,CAAE,CAAGqD,CACvB,KAAI,CAACL,WAAW,CAAG3B,EAAgBgC,EAAKxD,UAAU,EAClD,IAAI,CAACoD,gBAAgB,CAAG5B,EAAgBgC,EAAKtD,eAAe,EAC5D,MAAMuD,EAAaD,EAAKpD,KAAK,CAAG,EAAA,KAAK,CAAG,EAAA,IAAI,CAMxC,IAAI,CAACsC,KAAK,CAAGe,EAEjB,IAAI,CAACd,SAAS,CACI,MAAda,EAAKnD,KAAK,EAAYqD,OAAOC,aAAa,CAACH,EAAKnD,KAAK,EAAImD,EAAKnD,KAAK,CAAGP,EAAeO,KAAK,CAC9F,IAAI,CAACuC,SAAS,GAAGzC,GAAOW,EAAUI,GAAG,CAACf,GACtC,IAAI,CAD0C,AACzC0C,UAAU,CAAG1C,KAAOY,EAAWG,GAAG,CAACf,GACxC,IAAI,CAD4C,AAC3C2C,gBAAgB,CAvFR,QAuFW3C,EACxB,IAAI,CAAC4C,EAD4BtD,GACvB,CAAG,CAAA,EAAA,EAAA,EAD+BI,KACvB,AAAR,EAASE,GACtB,IAAI,CAACiD,AAFsD,SAE7C,CAAG,CAACQ,EAAKlD,UAAU,CACjC,IAAI,CAAC2C,UAAU,CAAG,IAAI,CAACD,SAAS,CAAG,SAAW,QAC9C,IAAI,CAACE,UAAU,CAAG,CAAEU,SAAU,OAAQC,cAAe,IAAI,CAACb,SAAU,AAAD,EAEnE,IAAI,CAACT,OAAO,CAAG,CAAC,IAAI,CAACuB,WAAW,CAAC/D,EAAM,GAAG,CAC1C,IAAI,CAACyC,OAAO,EAAG,EACf,IAAI,CAACC,MAAM,MAAGf,CAClB,CACA,MAAMqC,MAAMC,CAAK,CAAE,CACf,IAAI,IAAI,CAACxB,OAAO,EACZ,AACJ,IAAI,CAACA,OAAO,EAAG,EACf,GAAI,CACA,KAAO,CAAC,IAAI,CAACyB,SAAS,EAAID,EAAQ,GAAG,CACjC,IAAME,EAAM,IAAI,CAACzB,MAAM,CACjB0B,EAAMD,GAAOA,EAAIE,KAAK,CAC5B,GAAID,GAAOA,EAAIE,MAAM,CAAG,EAAG,CACvB,GAAM,MAAEC,CAAI,OAAEjE,CAAK,CAAE,CAAG6D,EAClBK,EAAQJ,EAAIK,MAAM,CAAC,EAAGR,GAAO9B,GAAG,CAAC,AAACuC,GAAW,IAAI,CAACC,YAAY,CAACD,EAAQH,IAE7E,IAAK,IAAMzC,KADK,IACI8C,EADEC,QAAQC,GAAG,CAACN,EAAAA,EACL,CACzB,GAAI,CAAC1C,EACD,SACJ,GAAI,IAAI,CAACoC,SAAS,CACd,OACJ,IAAMa,EAAY,MAAM,IAAI,CAACC,aAAa,CAAClD,GACzB,cAAdiD,GAA6B,IAAI,CAAC1B,gBAAgB,CAACvB,IAC/CxB,GAAS,CAD8C,GAC1C,CAACsC,SAAS,EAAE,AACzB,IAAI,CAACJ,OAAO,CAACyC,IAAI,CAAC,IAAI,CAAClB,WAAW,CAACjC,EAAMoD,QAAQ,CAAE5E,EAAQ,IAE3D,IAAI,CAACuC,SAAS,EAAE,CAChB,IAAI,CAACoC,IAAI,CAACnD,GACVmC,OAGgB,SAAdc,GAAwB,IAAI,CAACI,cAAc,CAACrD,EAAAA,CAAM,EACxD,IAAI,CAACsB,WAAW,CAACtB,IACb,IADqB,AACjB,CAACgB,UAAU,EAAE,CACjB,IAAI,CAACmC,IAAI,CAACnD,GACVmC,IAGZ,CACJ,KACK,CACD,IAAMvB,EAAS,IAAI,CAACF,OAAO,CAAC4C,GAAG,GAC/B,GAAI,CAAC1C,EAAQ,CACT,IAAI,CAACuC,IAAI,CAAC,MACV,KACJ,CAEA,GADA,IAAI,CAACvC,MAAM,CAAG,MAAMA,EAChB,IAAI,CAACwB,SAAS,CACd,MACR,CACJ,CACJ,CACA,MAAOhD,EAAO,CACV,IAAI,CAACmE,OAAO,CAACnE,EACjB,QACQ,CACJ,IAAI,CAACuB,OAAO,EAAG,CACnB,EACJ,CACA,MAAMsB,YAAYQ,CAAI,CAAEjE,CAAK,CAAE,CAC3B,IAAI+D,EACJ,GAAI,CACAA,EAAQ,MAAM,CAAA,EAAA,EAAA,OAAA,AAAO,EAACE,EAAM,IAAI,CAACpB,UAAU,CAC/C,CACA,MAAOjC,EAAO,CACV,IAAI,CAACoE,QAAQ,CAACpE,EAClB,CACA,MAAO,OAAEmD,QAAO/D,OAAOiE,CAAK,CAChC,CACA,MAAMI,aAAaD,CAAM,CAAEH,CAAI,CAAE,CAE7B,IADIzC,EACEC,EAAW,IAAI,CAACkB,SAAS,CAAGyB,EAAOa,IAAI,CAAGb,EAChD,GAAI,CACA,IAAMQ,EAAW,CAAA,EAAA,EAAA,OAAA,AAAQ,EAAC,CAAA,EAAA,EAAA,IAAA,AAAK,EAACX,EAAMxC,GAEtCD,EADAA,EAAQ,CAAEyC,KAAM,CAAA,EAAA,EAAA,QAAA,AAAS,EAAC,IAAI,CAACvB,KAAK,CAAEkC,YAAWA,WAAUnD,EAAS,CAC/D,CAAC,IAAI,CAACmB,UAAU,CAAC,CAAG,IAAI,CAACD,SAAS,CAAGyB,EAAS,MAAM,IAAI,CAAC/B,KAAK,CAACuC,EACxE,CACA,MAAOM,EAAK,CACR,IAAI,CAACF,QAAQ,CAACE,GACd,MACJ,CACA,OAAO1D,CACX,CACAwD,SAASE,CAAG,CAAE,CAjJmB5E,EAAmBO,GAAG,CAkJ7BqE,AAlJ8BtE,EAAME,IAAI,GAkJhC,CAAC,IAAI,CAAC8C,SAAS,CACzC,CAD2C,GACvC,CAACuB,IAAI,CAAC,OAAQD,GAGlB,IAAI,CAACH,OAAO,CAACG,EAErB,CACA,MAAMR,cAAclD,CAAK,CAAE,CAGvB,GAAI,CAACA,GAAS,IAAI,CAACoB,UAAU,IAAIpB,EAC7B,KADoC,CAC7B,GAEX,IAAM4D,EAAQ5D,CAAK,CAAC,IAAI,CAACoB,UAAU,CAAC,CACpC,GAAIwC,EAAMC,MAAM,GACZ,MAAO,OACX,GAAID,EAAME,WAAW,GACjB,MAAO,YACX,GAAIF,GAASA,EAAMG,cAAc,GAAI,CACjC,IAAMC,EAAOhE,EAAMoD,QAAQ,CAC3B,GAAI,CACA,IAAMa,EAAgB,MAAM,CAAA,EAAA,EAAA,QAAA,AAAQ,EAACD,GAC/BE,EAAqB,MAAM,CAAA,EAAA,EAAA,KAAK,AAAL,EAAMD,GACvC,GAAIC,EAAmBL,MAAM,GACzB,CAD6B,KACtB,OAEX,GAAIK,EAAmBJ,WAAW,GAAI,CAClC,IAAMK,EAAMF,EAAczB,MAAM,CAChC,GAAIwB,EAAKI,UAAU,CAACH,IAAkBD,EAAKK,MAAM,CAACF,EAAK,KAAO,EAAA,GAAI,CAAE,CAChE,IAAMG,EAAiB,AAAIC,MAAM,CAAC,4BAA4B,EAAEP,EAAK,aAAa,EAAEC,EAAc,CAAC,CAAC,EAGpG,OADAK,EAAehF,IAAI,CAAGT,EACf,IAAI,CAAC2E,QAAQ,CAACc,EACzB,CACA,MAAO,WACX,CACJ,CACA,MAAOlF,EAAO,CAEV,OADA,IAAI,CAACoE,QAAQ,CAACpE,GACP,EACX,CACJ,CACJ,CACAiE,eAAerD,CAAK,CAAE,CAClB,IAAM4D,EAAQ5D,GAASA,CAAK,CAAC,IAAI,CAACoB,UAAU,CAAC,CAC7C,OAAOwC,GAAS,IAAI,CAAC3C,gBAAgB,EAAI,CAAC2C,EAAME,WAAW,EAC/D,CACJ,CCrOA,IAAA,EAAA,EAAA,CAAA,CAAA,OAKO,IAAM,EAAW,KAAQ,EAE1B,EAAK,QAAQ,QAAQ,CACd,EAAY,AAAO,YACnB,EAAiB,WAAP,EACV,EAAiBtF,UAAP,EACV,EAAmB,YAAP,EACZ,EAAsB,UAAb,CAAA,EAAA,EAAA,IAAA,AAAM,MAEnB,QACE,UACF,QACG,WACC,WACD,WACI,cACP,QACE,QAIL,EAAc,CAAE,MAAA,EAAA,KAAK,CAAE,KAAA,EAAA,IAAK,AAAD,EAC3B,EAAgB,YAChB,EAAU,cACV,EAAU,cACV,EAAe,CAAC,EAAeO,EAAS,EAAQ,CAEhD,EAAmB,IAAI,IAAI,CAC7B,MAAO,MAAO,MAAO,MAAO,KAAM,IAAK,MAAO,MAAO,WAAY,UAAW,QAAS,KACrF,MAAO,OAAQ,MAAO,MAAO,MAAO,WAAY,KAAM,MAAOW,MAAO,KAAM,MAC1E,MAAO,OAAQ,KAAM,MAAO,KAAM,MAAO,OAAQ,MAAO,QACxD,MAAO,MAAO,MAAO,QAAS,MAAO,OAAQ,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,OACvF,MAAO,MAAO,MAAO,MAAO,OAAQ,OAAQ,MAAO,OAAQ,MAAO,WAAY,MAAO,MACrF,QAAS,MAAO,MAAO,MACvB,YAAa,YAAa,YAAa,MAAO,MAAO,MAAO,OAAQY,MACpE,MAAO,MAAO,KAAM,MAAO,OAAQ,UAAW,MAAO,MAAO,MAAO,MAAO,MAC1E,KAAM,KAAM,MAAO,UAAW,KAAM,OACpC,OAAQ,OAAQ,OAAQ,OAAQ,MAAO,MAAO,MAAO,MAAO,MAC5D,MAAO,OAAQ,MAAO,OAAQ,MAAOK,MAAO,MAAO,MACnDE,MAAO,MAAO,MAAO,KAAM,MAAO,OAAQ,MAC1C,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,OAAQ,MAAO,MAAO,MAAO,MAAO,MACrF,OAAQ,MAAO,QAAS,MACxB,MAAO,OAAQ,OAAQ,MAAO,OAAQ,MACtC,MAAO,MAAO,UAAW,QACzB,IAAK,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MACtD,QAAS,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO3C,OAC/E,OAAQ,MAAO,OACf,MAAO,MAAO,OAAQ,OAAQC,MAAO,OAAQ,OAAQ,MAAO,MAAO,MAAO,MAAO,MACjF,KACA,MAAO,MAAO,MAAO,YAAa,MAAO,MAAO,MAAO,MAAO,OAAQ,MAAO,MAAO,KACpF,MAAO,MAAO,OAAQ,MAAO,OAAQ,OAAQ,MAAO,SAAU,MAAO,MAAO,MAAO,KACnF,MAAO,MAAO,MAAO,MACrB,MAAO,MAAO,OAAQ,MAAO,MAAO,OAAQ,MAAO,OAAQ,MAAO,MAAO,MAAO,MAChF,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAC1CwD,MAAO,MACP,MAAO,MAAO,MAAO,OAAQ,MAAO,OAAQnD,OAAQP,OAAQ,MAAOO,MAAO,KAAM,MAChF,MAAO,MAAO,OAAQ,QAAS,MAAO,MACtC,MAAO,MAAO,MAAOF,OAAQ,MAAO,OAAQ,OAAQ,OAAQ,MAAO,OAAQ,OAAQ,KACnF,QAAS,MAAO,MAAO,MAAO,KAC9B,IAAK,MAAO,OACf,EAGK,EAAU,CAAC,EAAK,KACd,aAAe,IACf,CADoB,CAChB,OAAO,CAAC,GAGZ,EAAG,EAEX,EACM,EAAgB,CAAC,EAAM,EAAM,KAC/B,IAAI,EAAY,CAAI,CAAC,EACjB,AADsB,CACrB,AAAC,aAAqB,GAAG,GAAG,AAC7B,CAAI,CAAC,EAAK,CAAG,EAAY,IAAI,IAAI,CAAC,GAAU,EAEhD,EAAU,GAAG,CAAC,EAClB,EAUM,EAAa,CAAC,EAAM,EAAM,KAC5B+D,IAAM,EAAY,CAAI,CAAC,EAAK,CACxB,aAAqB,IACrB,CAD0B,CAChB,MAAM,CAAC,GAEZ,IAAc,GACnB,GADyB,IAClB,CAAI,CAAC,EAAKK,AAEzB,EACM,EAAa,AAAC,GAAS,aAAe,IAAM,AAAa,MAAT,IAAI,CAAS,CAAC,EAC9D,EAAmB,IAAI,IAU7B,SAAS,EAAsB5B,CAAI,CAAE,CAAO,CAAE,CAAQ,CAAE,CAAU,CAAE,CAAO,EAUvE,GAAI,CACA,MAAO,CAAA,EAAA,EAAA,KAAQ,AAAR,EAAS,EAAM,CAClB,WAAY,EAAQ,UAAU,AAClC,EAZgB,CAYb,AAZc,EAAU,KAC3B,EAAS,GACT,EAAQ,EAAU,EAAQ,CAAE,YAAa,CAAK,GAG1C,GAAU,IAAS,GACnB,EAAiB,EAAA,CADU,MACA,CAAC,EAAM,GAAS,EAAe,EAAA,IAAO,CAAC,EAAM,GAEhF,EAKA,CACA,MAAO,EAAO,CACV,EAAW,GACX,MACJ,CADW,AAEf,CAKA,IAAM,EAAmB,CAAC,EAAU,EAAc,EAAM,EAAM,KAC1D,IAAM,EAAO,EAAiB,GAAG,CAAC,GAC7B,GAEL,EAAQ,CADJ,AACQ,CAAC,EAAa,CAAG,AAAD,IACxB,EAAS,EAAM,EAAM,EACzB,EACJ,EA+EM,EAAuB,IAAI,GAmE1B,OAAM,EACT,GAAI,AACJ,kBACA,AADkB,aACN,CAAG,CAAE,CACb,IAAI,CAAC,GAAG,CAAG,EACX,IAAI,CAAC,iBAAiB,CAAG,AAAC,GAAU,EAAI,YAAY,CAAC,EACzD,CAOA,iBAAiB,CAAI,CAAE,CAAQ,CAAE,CAC7B,IAWI,EAXE,EAAO,IAAI,CAAC,GAAG,CAAC,OAAO,CACvB,EAAY,EAAA,OAAU,CAAC,GACvB,EAAW,EAAA,QAAW,CAAC,GACd,AACf,IADmB,CAAC,GAAG,CAAC,cAAc,CAAC,GAChC,GAAG,CAAC,GACX,IAAM,EAAe,EAAA,OAAU,CAAC,GAC1B,EAAU,CACZ,WAAY,EAAK,UAAU,AAC/B,EAIA,GAHI,AAAC,IACD,EAAW,CAAA,EAEX,EAAK,UAAU,CAEf,CAFiB,CAET,QAAQ,CADE,AACC,EADI,QAAQ,GAAK,AACJ,EADS,cAAc,EA1PhC,EAAiB,GAAG,CAAC,EAAA,OAAU,CAAC,AA2PV,GA3PoB,KAAK,CAAC,GAAG,WAAW,IA2P5B,EAAK,cAAc,CAAG,EAAK,QAAQ,CAC5F,EAAS,CAtFU,CAAC,EAAM,EAAU,EAAS,KACrD,GAAM,UAAE,CAAQ,YAAE,CAAU,CAAE,CAAG,EAC7B,EAAO,EAAqB,GAAG,CAAC,GAG9B,EAAQ,GAAQ,EAAK,OAAO,CAsClC,OArCI,IAAU,EAAM,GAAP,OAAiB,CAAG,EAAQ,UAAU,EAAI,EAAM,QAAQ,CAAG,EAAQ,QAAA,AAAQ,GAAG,CAOvF,CAAA,EAAA,EAAA,WAAA,AAAW,EAAC,GACZ,OAAO,GAEP,GACAd,EAAc,CADR,CACc,EAAe,GACnC,EAAc,EAAM,EAAS,KAM7B,EAAO,CACH,UAAW,EACX,YAAa,UACb,EACA,QAAS,CAAA,EAAA,EAAA,SAAA,AAAS,EAAC,EAAU,EAAS,CAAC,EAAM,KACzC,EAAQ,EAAK,WAAW,CAAG,AAAD,IACtB,IAAsB,EAAU,KAArB,CAAuB,EAApB,KAA0B,CAAK,AAAzB,EACxB,GACA,IAAM,EAAY,EAAK,OAAO,EAC1B,EAAK,IAAI,GAAK,EAAK,IAAI,EAAI,EAAY,EAAK,OAAO,MAAI,CAAc,GAAG,AACxE,EAAQ,EAAK,SAAS,CAAE,AAAC,GAAa,EAAS,EAAM,GAE7D,EACJ,EACA,EAAqB,GAAG,CAAC,EAAU,IAKhC,KACH,EAAW,EAAM,EAAe,GAChC,EAAW,EAAM,EAAS,GACtB,EAAW,EAAK,SAAS,GAAG,CAC5B,EAAqB,MAAM,CAAC,GAC5B,CAAA,EAAA,EAAA,WAAA,AAAW,EAAC,GACZ,EAAK,OAAO,CAAG,EAAK,OAAO,MAAG,EAC9B,OAAO,MAAM,CAAC,GAEtB,EACJ,EAiC4C,EAAM,EAAc,EAAS,UACzD,EACA,WAAY,IAAI,CAAC,GAAG,CAAC,QAAQ,AACjC,QAGA,EAAS,CA5KM,CAAC,EAAM,EAAU,EAAS,KACjD,IAEI,EAFE,UAAE,CAAQ,YAAE,CAAU,YAAE,CAAU,CAAE,CAAG,EACzC,EAAO,EAAiB,GAAG,CAAC,GAEhC,GAAI,CAAC,EAAQ,UAAU,CAAE,CAErB,GAAI,CAAC,CADL,EAAU,EAAsB,EAAM,EAAS,EAAU,EAAY,EAAA,EAEjE,OACJ,OAAO,EAAQ,KAAK,CAAC,IAAI,CAAC,EAC9B,CACA,GAAI,EACA,EAAc,EADR,AACc,EAAe,GACnC,EAAc,EAAM,EAAS,GAC7B,EAAc,EAAM0D,EAAS,OAE5B,CAGD,GAAI,CAAC,AAFL,GAAU,EAAsB,EAAM,EAAS,EAAiB,IAAI,CAAC,KAAM,EAAU,GAAgB,EACrG,EAAiB,IAAI,CAAC,KAAM,EAAU,GAAA,EAElC,OACJ,EAAQ,EAAE,CAAC,EAAU,CAAP,KAAK,AAAS,IACxB,IAAM,EAAe,EAAiB,IAAI,CAAC,KAAM,EAAU,GACvD,IACA,EAAK,eAAe,EAAG,CAAA,EAavB,CAb6B,CAahB,EAErB,GACA,EAAO,CACH,UAAW,EACX,UAlBgE,EAkBnDS,EACb,YAAa,EACb,SACJ,EACA,EAAiB,GAAG,CAAC,EAAU,EACnC,CAIA,MAAO,KAIH,GAHA,EAAW,EAAM,EAAe,GAChC,EAAW,EAAM,EAAS,GAC1B,EAAW,EAAM,EAAS,GACtB,EAAW,EAAK,SAAS,EAAG,OAG5B,EAAK,OAAO,CAAC,KAAKnE,GAElB,EAAiB,MAAM,CAAC,GACxB,EAAaiB,OAAO,CAAC,CAjId,EAiIwB,EAjIf,AAAC,IACzB,IAAM,EAAM,CAAI,CAAC,EAAI,CACjB,aAAe,IACf,CADoB,CAChB,KAAK,GAGT,OAAO,CAAI,CAACqB,EAAIE,AAExB,IA2HY,EAAK,OAAO,MAAG,EACf,OAAO,MAAM,CAAC,EAClB,CACJ,EACJ,EA0GwC,EAAM,EAAc,EAAS,CACrD,WACA,WAAY,IAAI,CAAC,iBAAiB,CAClC,WAAY,IAAI,CAAC,GAAG,CAAC,QACzB,AADiC,GAGrC,OAAO,CACX,CAKA,YAAY,CAAI,CAAE,CAAK,CAAE,CAAU,CAAE,CACjC,GAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CACf,CADiB,MAGrB,IAAM,EAAU,EAAA,OAAU,CAAC,GACrB,EAAW,EAAA,QAAW,CAAC,GACvB,EAAS,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,GAEnC,EAAY,EAEhB,GAAI,EAAO,GAAG,CAAC,GACX,OACJ,IAAM,EAAW,MAAO,EAAM,KAC1B,GAAK,CAAD,GAAK,CAAC,GAAG,CAAC,SAAS,CAAC,AApUR,QAoU6B,EAAM,GAEnD,CADI,EACA,AAAC,GAAiC,GAAG,CAAxB,EAAS,OAAO,EA4B5B,GAAI,EAAO,GAAG,CAAC,GAAW,CAE3B,IAAM,EAAK,EAAS,OAAO,CACrB,EAAK,EAAS,OAAO,EACvB,CAAC,GAAM,GAAM,GAAM,IAAO,EAAU,OAAA,AAAO,EAAE,CAC7C,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAW,CAAR,CAAc,GAEpC,EAF4B,AAEhB,EAChB,MAnCI,GAAI,CACA,IAAM,EAAW,MAAM,CAAA,EAAA,EAAA,IAAA,AAAI,EAAC,GAC5B,GAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CACf,OAEJ,IAAM,EAAK,EAAS,OAAO,CACrB,EAAK,EAAS,OAAO,CAI3B,IAHI,CAAC,GAAM,GAAM,GAAM,IAAO,EAAU,OAAA,AAAO,EAAE,CAC7C,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAW,CAAR,CAAc,GAEhC,CAAC,CAFuB,EAEZ,GAAW,CAAA,CAAS,EAAK,EAAU,GAAG,GAAK,EAAS,GAAG,CAAE,CACrE,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GACpB,EAAY,EACZ,IAAM,EAAS,IAAI,CAAC,gBAAgB,CAAC,EAAM,EACvC,IACA,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,EAAM,EACtC,MAEI,CADC,CACW,CAEpB,CACA,MAAO,EAAO,CAEV,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAS,EAC9B,CAYR,EAEM,EAAS,IAAI,CAAC,gBAAgB,CAAC,EAAM,GAE3C,GAAI,CAAC,CAAC,GAAc,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,aAAA,AAAa,GAAK,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,GAAO,CAChF,GAAI,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAQ,CAAL,CAAW,EAAR,CAC1B,OACJ,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAQ,CAAL,CAAW,EAAR,AACzB,CACA,OAAO,CACX,CASA,MAAM,eAAe,CAAK,CAAE,CAAS,CAAE,CAAI,CAAE,CAAI,CAAE,CAC/C,GAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CACf,CADiB,MAGrB,IAAM,EAAO,EAAM,QAAQ,CACrB,EAAM,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,GACpC,GAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,cAAc,CAAE,KAG9B,EADJ,IAAI,CAAC,GAAG,CAAC,eAAe,GAExB,GAAI,CACA,EAAW,MAAM,CAAA,EAAA,EAAA,QAAU,AAAV,EAAW,EAChC,CACA,MAAO,EAAG,CAEN,OADA,IAAI,CAAC,GAAG,CAAC,UAAU,IACZ,CACX,CACA,GAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CACf,OAaJ,OAZI,EAAI,GAAG,CAAC,GACJ,IADW,AACP,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,KAAU,IACrC,IAAI,CAAC,CAD0C,EACvC,CAAC,aAAa,CAAC,GAAG,CAAC,EAAM,GACjC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAW,CAAR,CAAc,EAAM,GAAd,EAAmB,IAI/C,EAAI,GAAG,CAAC,GACR,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,EAAM,GACjC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAQ,CAAL,CAAW,EAAR,AAAc,KAAK,GAE5C,IAAI,CAAC,GAAG,CAAC,UAAU,IACZ,CACX,CAEA,GAAI,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,GAC3B,IADkC,GAC3B,EAEX,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,GAAM,EACrC,CACA,YAAY,CAAS,CAAE,CAAU,CAAE,CAAE,CAAE,CAAM,CAAE,CAAG,CAAE,CAAK,CAAE,CAAS,CAAE,CAElE,EAAY,EAAA,IAAO,CAAC,EAAW,IAC/B,IAAM,EAAc,EAAS,CAAA,EAAG,EAAU,CAAC,EAAE,EAAA,CAAQ,CAAG,EAExD,GAAI,CADJ,AACK,GADO,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,UAAW,EAAa,IAAA,EAEnD,OACJ,IAAM,EAAW,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,EAAG,IAAI,EAC1C,EAAU,IAAI,IAChB,EAAS,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAW,CACvC,WAAY,AAAC,GAAU,EAAG,UAAU,CAAC,GACrC,gBAAiB,AAAC,GAAU,EAAG,SAAS,CAAC,EAC7C,GACA,GAAK,CAAD,CA8BJ,MA7BI,CACJ,EACK,EAAE,CAAC,AA5cQ,OA4cE,MAAO,IACrB,GAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAE,CACjB,OAAS,EACT,MACJ,CACA,IAAM,EAAO,EAAM,IAAI,CACnB,EAAO,EAAA,IAAO,CAAC,EAAW,GAE9B,GADA,EAAQ,GAAG,CAAC,KACR,EAAM,KAAK,CAAC,cAAc,IACzB,MAAM,IAAI,CAAC,cAAc,CAAC,EAAO,EAAW,EAAM,EAAA,GAAQ,AAG/D,GAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAE,CACjB,OAAS,EACT,MACJ,CAII,IAAS,IAAW,AAAC,GAAW,EAAS,GAAG,CAAC,CAAd,CAAc,GAAQ,CACrD,IAAI,CAAC,GAAG,CAAC,eAAe,GAExB,EAAO,EAAA,IAAO,CAAC,EAAK,EAAA,QAAW,CAAC,EAAK,IACrC,IAAI,CAAC,YAAY,CAAC,EAAM,EAAY,EAAI,EAAQ,IAExD,GACK,EAAE,CAAC,EAAU,CAAP,GAAW,CAAC,CAAP,gBAAwB,EACjC,IAAI,QAAQ,CAAC,EAAS,KACzB,GAAI,CAAC,EACD,OAAO,IACX,EAAO,IAAI,CAAC,MAAS,KACjB,GAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAE,CACjB,EAAS,OACT,MACJ,CACA,IAAM,EAAe,KAAY,EAAU,KAAK,GAChD,EADqD,KAC7C,GAIR,EACK,WAAW,GACX,MAAM,CAAC,AAAC,GACF,IAAS,GAAa,CAAC,EAAQ,GAAG,CAAC,IAEzC,OAAO,CAAC,AAAC,IACV,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAW,EAChC,GACA,OAAS,EAEL,GACA,IAAI,CAAC,WAAW,CAAC,GAAW,EAAO,EAAI,EAAQ,EAAK,EAAO,EACnE,EACJ,EACJ,CAYA,MAAM,WAAW,CAAG,CAAE,CAAK,CAAE,CAAU,CAAE,CAAK,CAAE,CAAM,CAAE,CAAE,CAAE,CAAQ,CAAE,CAClE,IAQI,EACA,EATE,EAAY,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,EAAA,OAAU,CAAC,IAC/C,EAAU,EAAU,GAAG,CAAC,EAAA,QAAW,CAAC,GACtC,CAAC,AAAC,GAAc,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,aAAa,EAAM,GAAD,AAAY,GAC/D,IAAI,AAD0D,CACzD,CADmE,EAChE,CAAC,KAAK,CAAC,EAAY,CAAT,CAAc,GAGpC,EAAU,CAHmB,EAGhB,CAAC,EAAA,QAAW,CAAC,IAC1B,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,GAGxB,IAAM,EAAS,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CACrC,GAAI,CAAW,MAAV,GAAkB,GAAS,CAAA,CAAM,EAAK,CAAC,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,GAAW,CAC9E,GAAI,CAAC,IACD,IADS,EACH,IAAI,CAAC,WAAW,CAAC,EAAK,EAAY,EAAI,EAAQ,EAAK,EAAO,GAC5D,IAAI,CAAC,GAAG,CAAC,MAAM,EACf,OAER,EAAS,IAAI,CAAC,gBAAgB,CAAC,EAAK,CAAC,EAAS,KAEtC,GAA2B,GAC3B,CADS,EAAM,OAAO,EAE1B,IAAI,CAAC,WAAW,CAAC,GAAS,EAAO,EAAI,EAAQ,EAAK,EAAO,EAC7D,EACJ,CACA,OAAO,CACX,CAUA,MAAM,aAAa,CAAI,CAAE,CAAU,CAAE,CAAO,CAAE,CAAK,CAAE,CAAM,CAAE,CACzD,IAAM,EAAQ,IAAI,CAAC,GAAG,CAAC,UAAU,CACjC,GAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAS,IAAI,CAAC,GAAG,CAAC,MAAM,CAE5C,CAF8C,MAC9C,KACO,EAEX,IAAM,EAAK,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,GACjC,IACA,EAAG,GADM,OACI,CAAG,AAAC,GAAU,EAAQ,UAAU,CAAC,GAC9C,EAAG,SAAS,CAAG,AAAC,GAAU,EAAQ,SAAS,CAAC,IAGhD,GAAI,CACA,IAQI,EARE,EAAQ,MAAM,CAAW,CAAC,EAAG,UAAU,CAAC,CAAC,EAAG,SAAS,EAC3D,GAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CACf,OACJ,GAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,EAAG,SAAS,CAAE,GAElC,KAF0C,EAC1C,KACO,EAEX,IAAM,EAAS,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,cAAc,CAE9C,GAAI,EAAM,WAAW,GAAI,CACrB,IAAM,EAAU,EAAA,OAAU,CAAC,GACrB,EAAa,EAAS,MAAM,CAAA,EAAA,EAAA,QAAA,AAAU,EAAC,GAAQ,EACrD,GAAI,IAAI,CAAC,GAAG,CAAC,MAAM,GAEnB,EAAS,MAAM,IAAI,CAAC,UAAU,CAAC,EAAG,SAAS,CAAE,EAAO,EAAY,EAAO,EAAQ,EAAI,GAC/E,IAAI,CAAC,GAAG,CAAC,MAAM,EACf,AAHA,OAKA,IAAY,QAA6B,IAAf,GAC1B,IADoD,AAChD,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,EAAS,EAE5C,MACK,GAAI,EAAM,cAAc,GAAI,CAC7B,IAAM,EAAa,EAAS,MAAM,CAAA,EAAA,EAAA,QAAA,AAAU,EAAC,GAAQ,EACrD,GAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CACf,OACJ,IAAM,EAAS,EAAA,OAAU,CAAC,EAAG,SAAS,EAItC,GAHA,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,GAAQ,GAAG,CAAC,EAAG,SAAS,EAChD,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAQ,CAAL,CAAQ,EAAL,OAAc,CAAE,GACrC,EAAS,MAAM,IAAI,CAAC,UAAU,CAAC,EAAQ,EAAO,EAAY,EAAO,EAAM,EAAI,GACvE,IAAI,CAAC,GAAG,CAAC,MAAM,CACf,YAEe,IAAf,GACA,IAD0B,AACtB,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,EAAA,OAAU,CAAC,GAAO,EAErD,MAEI,CADC,CACQ,IAAI,CAAC,WAAW,CAAC,EAAG,SAAS,CAAE,EAAO,GAKnD,OAHA,IACI,GACA,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,EAAM,IAC3B,CACX,CACA,MAAO,EAAO,CACV,GAAI,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,GAEtB,KAF8B,EAC9B,IACO,CAEf,CACJ,CACJ,CF3mBA,IAAM,EAAgB,MAChB,EAAkB,QAClB,EAAS,mCACT,EAAc,WACpB,SAAS,GAAO,CAAI,EAChB1D,OAAO,MAAM,OAAO,CAAC,GAAQ,EAAO,CAAC,EAAK,AAC9C,CACA,IAAM,GAAkB,AAAC,GAA+B,UAAnB,OAAO,GAAoC,OAAZ,GAAoB,CAAC,CAAC,aAAmB,MAAA,CAAM,CAqCnH,SAAS,GAAc,CAAQ,CAAE,CAAUoC,CAAE,CAAK,EAC9C,IAAM,EAAO,AAdjB,SAAuBd,AAAd,CAAkB,EACvB,GAAoB,UAAhB,OAAO,EACP,MAAM,AAAI,MAAM,mBAEpB,EAAO,CADP,EAAOH,EAAAA,SAAY,CAACO,EAAAA,EACR,OAAO,CAAC,MAAO,KAC3B,IAAI,GAAU,EAMd,OALI,EAAK,UAAU,CAAC,QAChB,GAAU,CAAA,EACd,EAAO,EAAK,OAAO,CAAC,EAAiB,KACjC,IACA,EAAO,IAAMM,CAAAA,EACV,CACX,EAE+BO,GAC3B,IAAK,IAAI,EAAQ,EAAG,EAAQ,EAAS,MAAM,CAAE,IAEzC,GAAI,CAF8C,EAClC,CAAQ,CAAC,EAAM,AAAN,EACb,EAAM,GACd,KADsB,EACf,EAGf3C,OAAO,CACX,CAeA,IAAM,GAAa,AAAC,IAChB,IAAM,EAAQ,GAAO,GAAQ,IAAI,GACjC,GAAI,CAAC,EAAM,KAAK,CAAC,AAAC,GAvEF,UAuEQ,OAAO,GAC3B,GADiC,GACvBiD,AAAJ,UAAc,CAAC,AAD0B,mCACS,EAAEZ,EAAAA,CAAO,EAErE,OAAO,EAAMzC,GAAG,CAAC,GACrB,EAGM,GAAS,AAAC,IACZ,IAAI,EAAM,EAAO,OAAO,CAAC,OACrB6C,GAAU,EAQd,GATwC,IAEpC,EAAI,UAAU,CAAC,AApFH,QAqFZ,EAAU,EAAA,EAEd,AAHiC,EAG3B,EAAI,OAAO,CAAC,OACd,IACA,EAAM,AA1FA,GAyFG,CADsB,AAEjB,CAAA,EAEXc,CACX,EAGM,GAAsB,AAAC,GAAS,GAAO,EAAA,SAAY,CAAC,GAAO,KAE3D,GAAmB,CAAC,EAAM,EAAE,GAAK,AAACE,GACpC,AAAoBE,UAAhB,AAA0B,OAAnB,EACA,GAAoBA,EAAAA,UAAa,CAAC,GAAQ,EAAO,EAAA,IAAO,CAAC,EAAK,IAG9D,EAST,GAAY,OAAO,MAAM,CAAC,IAAI,IAIpC,OAAM,GACF,IAAK,CACL,cACA,AADe,MACTrC,AACN,aAAY,CAAG,CAAE,CAAa,CAAE,CAC5B,IAAI,CAAC,IAAI,CAAG,EACZ,IAAI,CAAC,cAAc,CAAG,EACtB,IAAI,CAAC,KAAK,CAAG,IAAI,GACrB,CACA,IAAIiD,CAAI,CAAE,CACN,GAAM,OAAE,CAAK,CAAE,CAAG,IAAI,CACjB,OACD,EACA,GA9HK,MA8HI,CAAW,GACpB,EAAM,GAAG,CAAC,AADmB,EAErC,CACA,MAAM,OAAO,CAAI,CAAE,CACf,GAAM,OAAE,CAAK,CAAE,CAAG,IAAI,CACtB,GAAI,CAAC,IAEL,EAAM,MAAM,CAAC,GACT,EAAM,IAAI,CAAG,GAFb,AAGA,OACJ,IAAM,EAAM,IAAI,CAAC,IAAI,CACrB,GAAI,CACA,MAAM,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,EAClB,CACA,MAAO,EAAK,CACJ,IAAI,CAAC,cAAc,EAAE,AACrB,IAAI,CAAC,cAAc,CAAC,EAAA,OAAU,CAAC,GAAM,EAAA,QAAW,CAAC,GAEzD,CACJ,CACA,IAAI,CAAI,CAAE,CACN,GAAM,CAAE,OAAK,CAAE,CAAG,IAAI,CACtB,GAAKjD,CAAD,CAEJ,KADI,EACG,EAAM,GAAG,CAAC,EACrB,CACA,aAAc,CACV,GAAM,CAAE,OAAK,CAAE,CAAG,IAAI,QACtB,AAAK,EAEE,EAFH,EAEO,CADP,CACa,MAAM,GAAG,CADf,EAEf,AAFiB,CAGjB,SAAU,CACN,IAAI,CAAC,KAAK,CAAC,KAAK,GAChB,IAAI,CAAC,IAAI,CAAG,GACZ,IAAI,CAAC,cAAcY,CAAG,EACtB,IAAI,CAAC,KAAK,CAAG,GACb,OAAO,MAAM,CAAC,IAAI,CACtB,CACJ,CAGO,MAAM,GACT,GAAI,CACJA,IAAK,CACL,SAAU,CACV,aAAc,CACd,QAAS,CACT,cAAe,CACf,UAAW,AACX,aAAY,CAAI,CAAE,CAAM,CAAE,CAAG,CAAE,CAC3B,IAAI,CAAC,GAAG,CAAG,EACX,MAAM,EAAY,EAClB,IAAI,CAAC,IAAI,CAAG,EAAO,EAAK,OAAO,CAAC,EAAa,IAC7C,IAAI,CAAC,SAAS,CAAG,EACjB,IAAI,CAAC,aAAa,CAAG,EAAA,OAAU,CAAC,GAChC,IAAI,CAAC,QAAQ,CAAG,EAAE,CAClB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAACS,AAAC,IACf,EAAM,MAAM,CAAG,GACf,EAAM,GAAG,EACjB,GACA,IAAI,CAAC,cAAc7C,CAAG,EACtB,IAAI,CAAC,UAAU,CAAG,EAtBJ,OAsBa,AArBb,OAsBlB,CACA,QAF+C,EAErC,CAAK,CAAE,CACb,OAAOoE,EAAAA,IAAOa,CAAC,IAAI,CAAC,SAAS,CAAE,EAAA,QAAW,CAAC,IAAI,CAAC,SAAS,CAAE,EAAM,QAAQ,EAC7E,CACAhB,WAAW,CAAK,CAAE,CACd,GAAM,OAAE,CAAK,CAAE,CAAG,EAClBvB,GAAI,GAAS,EAAM,cAAc,GAC7B,OAAO,IAAI,CAAC,SAAS,CAAC,GAC1B,IAAM,EAAe,IAAI,CAAC,SAAS,CAAC,GAEpC,OAAO,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,EAAc,IAAU,IAAI,CAAC,GAAG,CAAC,mBAAmB,CAAC,EACtF,CACA,UAAUwC,CAAK,CAAE,CACb,OAAO,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,GAAQ,EAAM,KAAK,CACnE,CACJ,CASO,MAAM,WAAkB,EAAA,YAAY,CACvC,MAAO,CACP,OAAQ,CACR,QAAS,CACTE,aAAc,CACd,UAAW,CACX,QAAS,CACT,aAAc,CACd,QAAS,CACT,cAAe,CACf,eAAgB,CAChB,WAAYG,AACZ,WAAW,CACX,aAAc,CACd,YAAa,CACb,aAAc,AACd,SAAS,CACT,YAAa,CACb,cAAe,AAEf,aAAY,EAAQ,CAAC,CAAC,CAAE,CACpB,KAAK,GACL,IAAI,CAAC,MAAM,EAAG,EACd,IAAI,CAAC,QAAQ,CAAG,IAAI,IACpB,IAAI,CAAC,aAAa,CAAG,IAAI,IACzB,IAAI,CAAC,UAAU,CAAG,IAAI,IACtB,IAAI,CAAC,QAAQ,CAAG,IAAI,IACpB,IAAIvB,CAAC,aAAa,CAAG,IAAI,IACzB,IAAI,CAAC,QAAQ,CAAG,IAAI,IACpB6B,IAAI,CAAC,cAAc,CAAG,IAAI,IAC1B,IAAI,CAAC,eAAe,CAAG,IAAI,IAC3B,IAAI,CAAC,WAAW,CAAG,EACnB,IAAI,CAAC,aAAa,EAAG,EACrB,MAAM,EAAM,EAAM,gBAAgB,CAC5B,EAAU,CAAE,mBAAoB/E,IAAM,aAAc,GAAI,EACxD,EAAO,CAET,YAAY,EACZ,eAAe,EACf,wBAAwB,EACxB,SAAU,IACV,eAAgB,IAChB,eAAgB,GAChB,YAAY,EAEZsE,QAAQ5D,EACR,GAAG,CAAK,CAER,QAAS,EAAM,OAAO,CAAG,GAAO,EAAM,OAAO,EAAI,GAAO,EAAE,EAC1D,kBAA0B,IAAR,EAAe,EAAyB,UAAf,OAAO,GAAmB,CAAE,GAAG,CAAO,CAAE,GAAG,CAAG,AAAC,CAC9F,EAEI,CAH8F,GAI9F,EAAK,UAAU,EAAG,CAAA,OAEF,IAAhB,EAAK,MAAM,EACX,GAAK,MAAMwB,CAAG,CAAC,EAAK,UAAA,AAAU,EAIlC,MAAM,EAAU,QAAQ,GAAG,CAAC,mBAAmBxC,CAC/C0F,QAAgB,IAAZ,EAAuB,CACvB,MAAM,EAAW,EAAQ,WAAW,GACnB,UAAbC,GAAqC,MAAb,EACxB,EAAK,UAAU,EAAGnD,EACA,SAAb,GAAoC,MAAb,EAC5B,EAAK,UAAU,EAAG,EAElB,EAAK,UAAU,CAAG,CAAC,CAAC,CAC5B,CACA,MAAM,EAAc,QAAQ,GAAG,CAAC,iBAAiB,CAC7C,IACAtD,EAAK,QAAQ,CAAG,OAAO,QAAQ,CAAC,EAAa,GAAA,EAEjD,IAAI,EAAa,EACjB,IAAI,CAAC,UAAU,CAAG,OAEV6G,GAAc,IAAI,CAAC,WAAW3F,EAAE,CAChC,IAAI,CAAC,UAAU,CAAG,EAClB,IAAI,CAAC,aAAa,EAAG,EAErB,QAAQ,QAAQ,CAAC,IAAM,IAAI,CAAC,IAAI,CAAC,IAEzC,EACA,CAH4C,GAGxC,CAAC,CAH4C,OAGpC,CAAG,CAAC,GAAG,IAAS,IAAI,CAAC,IAAI,CAAC,KAAW,EAAR,CAC1C,EAD6C,EACzC,CAAC,YAAY,CAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAC1C,IAAI,CAAC,OAAO,CAAG,EACf,IAAI,CAAC,cAAc,CAAG,IAAI,EAAc,IAAI,EAE5C,OAAO,MAAM,CAAC,EAClB,CACA,gBAAgB,CAAO,CAAE,CACrB,GAAI,GAAgB,IAEhB,IAAK,EAFqB,EAEf,KAAW,IAAI,CAAC,aAAa,CAAE,AACtC,GAAI,GAAgB,IAChB,EAAQ,IAAI,GAAK,EAAQ,IAAI,EAC7B,EAAQ,SAAS,GAAK,EAAQ,SAAS,CACvC,CADyC,KAGjD,CAEJ,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAC3B,CACA,mBAAmB,CAAO,CAAE,CAGxB,GAFA,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,GAEH,UAAnB,AAA6B,OAAtB,EACP,IAAK,IAAM,KAAW,IAAI,CAAC,aAAa,CAAE,AAIlC,GAAgB,IAAY,EAAQ,IAAI,GAAK,GAC7C,IAAI,CAAC,CADiD,YACpC,CAAC,MAAM,CAAC,EAI1C,CAMA,IAAI,CAAM,CAAE,CAAQ,CAAE,CAAS,CAAE,CAC7B,GAAM,KAAE,CAAG,CAAE,CAAG,IAAI,CAAC,OAAO,CAC5B,IAAI,CAAC,MAAM,EAAG,EACd,IAAI,CAAC,aAAa,MAAG,EACrB,IAAI,EAAQ,GAAW,GA4BvB,OA3BI,GACA,EADK,CACG,EAAM,GAAG,CAAC,AAAC,GA9O3B,AAAIkD,EAAAA,UAAa,CAACH,KAGX,EAHkB9B,AAGlB,IAAO,CA4OoC,AA5OnC,EA4O6B,GAGpC,AA/OY,EAiPhB,EAAM,OAAO,CAAC,AAAC,IACX,IAAI,CAAC,kBAAkB,CAAC,EAC5B,GACA,IAAI,CAAC,YAAY,MAAG,EACf,AAAD,IAAK,CAAC,WAAW,GACjB,IAAI,CAAC,WAAW,EAAG,EACvB,IAAI,CAAC,WAAW,EAAI,EAAM,MAAM,CAChC,QAAQ,GAAG,CAAC,EAAM,GAAG,CAAC,MAAO,IACzB,IAAM,EAAM,MAAM,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,EAAM,CAAC,EAAW,OAAW,EAAG,GAGnF,OAFI,GACA,IAAI,CAAC,UAAU,GACZ,CACX,IAAI,IAAI,CAAC,AAAC,IACF,IAAI,CAAC,MAAM,EACX,AACJ,EAAQ,OAAO,CAAC,AAAC,IACT,GACA,IAAI,CAAC,GAAG,CAAC,EAAA,OAAU,CAAC,GAAO,EAAA,QAAW,CAAC,GAAY,GAC3D,EACJ,GACO,IAAI,AACf,CAIA,QAAQ,CAAM,CAAE,CACZ,GAAI,IAAI,CAAC,MAAM,CACX,OAAO,IAAI,CACf,IAAM,EAAQ,GAAW,GACnB,KAAE,CAAG,CAAE,CAAG,IAAI,CAAC,OAAO,CAoB5B,OAnBA,EAAM,OAAO,CAAC,AAAC,IAEN,EAAA,UAAa,CAAC,IAAU,IAAI,CAAL,AAAM,QAAQ,CAAC,GAAG,CAAC,KACvC,EAD8C,EAE9C,EAAO,EAAA,IAAO,CAAC,EAAK,EAAA,EACxB,EAAO,EAAA,OAAU,CAAC,IAEtB,IAAI,CAAC,UAAU,CAAC,GAChB,IAAI,CAAC,eAAe,CAAC,GACjB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAClB,GADyB,CACrB,CAAC,eAAe,CAAC,CACjB,OACA,WAAW,CACf,GAIJ,IAAI,CAAC,YAAY,MAAG,CACxB,GACO,IAAI,AACf,CAIA,OAAQ,CACJ,GAAI,IAAI,CAAC,aAAa,CAClB,CADoB,MACb,IAAI,CAAC,aAAa,CAE7B,IAAI,CAAC,MAAM,EAAG,EAEd,IAAI,CAAC,kBAAkB,GACvB,IAAM,EAAU,EAAE,CAmBlB,OAlBA,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,AAAC,GAAe,EAAW,OAAO,CAAE,AAAD,IACrD,IAAM,EAAU,IACZ,aAAmB,SACnB,EAAQ,IAAI,CAAC,EACrB,IACA,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,AAAC,GAAW,EAAO,OAAO,IAChD,IAAI,CAAC,YAAY,MAAG,EACpB,IAAI,CAAC,WAAW,CAAG,EACnB,IAAI,CAAC,aAAa,EAAG,EACrB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAE,AAAD,GAAY,EAAO,OAAO,IAChD,IAAI,CAAC,QAAQ,CAAC,KAAK,GACnB,IAAI,CAAC,QAAQ,CAAC,KAAK,GACnB,IAAI,CAAC,QAAQ,CAAC,KAAK,GACnB,IAAI,CAAC,aAAa,CAAC,KAAK,GACxB,IAAI,CAAC,UAAU,CAAC,KAAK,GACrB,IAAI,CAAC,aAAa,CAAG,EAAQ,MAAM,CAC7B,QAAQ,GAAG,CAAC,GAAS,IAAI,CAAC,SAAM,GAChC,QAAQ,OAAO,GACd,IAAI,CAAC,aAAa,AAC7B,CAKA,YAAa,CACT,IAAM,EAAY,CAAC,EAMnB,OALA,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAO,KAG1B,CAAS,CADK,AACJ,CAFE,IAAI,CAAC,CACI,MADG,CAAC,GAAG,CAAG,EAAA,QAAW,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAE,GAAO,CAAA,GAtbhE,IAwbY,CAAG,EAAM,WAAW,GAAG,IAAI,EAC/C,GACO,CACX,CACA,YAAY,CAAK,CAAE,CAAI,CAAE,CACrB,IAAI,CAAC,IAAI,CAAC,KAAU,GAChB,OACA,GADU,CACN,CAAC,IAAI,CADI,AACH,EAAQ,GADA,EACL,AAAe,EACpC,CADwB,AAYxB,MAAM,MAAM,CAAK,CAAE,CAAI,CAAE,CAAK,CAAE,KAYxB,EAXJ,GAAI,IAAI,CAAC,MAAM,CACX,OACJ,IAAM,EAAO,IAAI,CAAC,OAAO,CACrB,IACA,EAAO,EAAA,SAAY,CAAC,EAAA,EACpB,EAAK,GAAG,GACR,EAAO,EAAA,QAAW,CAAC,EAAK,GAAG,CAAE,EAAA,EACjC,IAAM,EAAO,CAAC,EAAK,AACN,OAAT,GACA,EAAK,IAAI,CAAC,GACd,IAAM,EAAM,EAAK,gBAAgB,CAEjC,GAAI,IAAQ,EAAK,CAAN,GAAU,CAAC,cAAc,CAAC,GAAG,CAAC,EAAA,CAAK,CAE1C,EAF6C,KAC7C,EAAG,UAAU,CAAG,IAAI,KACb,IAAI,CAEf,GAAI,EAAK,MAAM,CAAE,CACb,GAAI,MASA,IATU,GACV,IAAI,AADS,CACR,KADc,EAAE,QACD,CAAC,GAAG,CAAC,EAAM,CAAC,KAAU,EAAK,EAC/C,WAAW,KACP,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,EAAO,KACjC,IAAI,CAAC,IAAI,IAAI,GACb,IAAI,CAAC,IAAI,CAAC,KAAW,EAAR,CACb,EADgB,EACZ,CAAC,eAAe,CAAC,MAAM,CAAC,EAChC,EACJ,EAA0B,UAAvB,OAAO,EAAK,MAAM,CAAgB,EAAK,MAAM,CAAG,KAC5C,IAAI,CAEX,OAAoB,GAAV,CAAc,CAAC,KAAZ,GAAG,OAAwB,CAAC,GAAG,CAAC,KAC7C,EADoD,EAEpD,IAAI,AADI,CACH,MADM,MAAM,GACG,CAAC,MAAM,CAAC,GAEpC,CACA,GAAI,IAAQ,GAAD,IAAqB,GAAV,EAAuB,CAAM,EAAK,EAA/B,AAAiB,EAAkB,CAAC,AAAjC,IAAiB,SAA6B,CAAE,CACxE,IAAM,EAAU,CAAC,EAAK,KACd,GACA,EADK,EAEL,CAAI,CAAC,EADG,AACD,CAAG,EACV,IAFW,AAEP,CAAC,IAFW,OAEA,CAAC,EAAO,IAEnB,IAED,EAAK,CAFG,KAEG,CAAG,EACd,CAAI,AADa,CACZ,EAAE,CAAG,EAGV,EAAK,IAAI,CAAC,GAEd,IAAI,CAAC,WAAW,CAAC,EAAO,GAEhC,EAEA,OADA,IAAI,CAAC,iBAAiB,CAAC,EAAM,EAAI,kBAAkB,CAAE,EAAO,GACrD,IAAI,AACf,CACA,GAAI,OACoB,CAAC,EADX,EACe,CAAC,IADb,KACsB,CADhB,AACiB,EADf,AAC0B,EAAM,GAAd,CAEnC,KAFyC,EAElC,IAAI,CAEnB,GAAI,EAAK,UAAU,OACL,IAAV,IACC,KAAD,EAAqB,GAAV,IAAkC,GAA/B,AAAiB,EAA2B,CAAzC,AAA+C,CAAG,CACnE,EADkC,AAAqB,EAEnD,EADE,EAAW,CADyC,AAAjB,CACnB,GAAG,CAAG,EAAA,IAAO,CAAC,EAAK,GAAG,CAAE,GAAQ,EAEtD,GAAI,CACA,EAAQ,MAAM,CAAA,EAAA,EAAA,IAAA,AAAI,EAAC,EACvB,CACA,MAAO,EAAK,CAEZ,CAEA,GAAI,CAAC,GAAS,IAAI,CAAC,MAAM,CACrB,OACJ,EAAK,IAAI,CAAC,EACd,CAEA,OADA,IAAI,CAAC,WAAW,CAAC,EAAO,GACjB,IAAI,AACf,CAKA,aAAa,CAAK,CAAE,CAChB,IAAM,EAAO,GAAS,EAAM,IAAI,CAOhC,OANI,GACS,WAAT,GACS,YAAT,CACA,EAAC,EAAC,IAAI,CAAC,OAAO,CAAC,sBAAsB,EAAc,UAAT,GAA6B,WAAT,CAAS,CAAS,EAChF,CADmF,GAC/E,CAAC,IAAI,CAAC,EAAU,GAEjB,EAFU,CAED,IAFM,AAEF,CAAC,MAAM,AAC/B,CAQA,UAAU,CAAU,CAAE,CAAI,CAAE,CAAO,CAAE,KAa7B,CAZA,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IACrB,IAAI,CAAC,IAD6B,MACnB,CAAC,GAAG,CAAC,EAAY,IAAI,KAExC,IAAM,EAAS,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GACnC,GAAI,CAAC,EACD,MAAM,AAAI,MAAM,oBACpB,IAAM,EAAa,EAAO,GAAG,CAAC,GAC9B,GAAI,EAEA,OADA,EAAW,CADC,IACI,IACT,EAIX,IAAM,EAAQ,KACV,IAAM,EAAO,EAAO,GAAG,CAAC,GAClB,EAAQ,EAAO,EAAK,KAAK,CAAG,EAKlC,OAJA,EAAO,MAAM,CAAC,GACd,aAAa,GACT,GACA,aAAa,EAAK,aAAa,EAC5B,CACX,EAEM,EAAM,CAAE,cADd,EAAgB,WAAW,EAAO,SACL,EAAO,MAAO,CAAE,EAE7C,OADA,EAAO,GAAG,CAAC,EAAM,GACV,CACX,CACA,iBAAkB,CACd,OAAO,IAAI,CAAC,WAAW,EAC3B,CASA,kBAAkB,CAAI,CAAE,CAAS,CAAE,CAAK,CAAE,CAAO,CAAE,CAC/C,IAII,EAJE,EAAM,IAAI,CAAC,OAAO,CAAC,gBAAgB,CACzC,GAAmB,UAAf,OAAO,EACP,OACJ,IAAM,EAAe,EAAI,YAAY,CAEjC,EAAW,EACX,IAAI,CAAC,OAAO,CAAC,GAAG,EAAI,CAAC,EAAA,UAAa,CAAC,KACnC,EAD0C,AAC/B,EAAA,IAAO,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAE,EAAA,EAEzC,IAAM,EAAM,IAAI,KACV,EAAS,IAAI,CAAC,cAAc,CAuB7B,EAAO,GAAG,CAAC,KACZ,EADmB,AACZ,GAAG,CAAC,EAAM,CACb,WAAY,EACZ,WAAY,KACR,EAAO,MAAM,CAAC,GACd,aAAa,GACN,EAEf,GACA,EAAiB,WA/BrB,AA+BgC,SA/BvB,EAAmB,CAAQ,EAChC,CAAA,EAAA,EAAA,IAAA,AAAM,EAAC,EAAU,CAAC,EAAK,KACnB,GAAI,GAAO,CAAC,EAAO,GAAG,CAAC,GAAO,CACtB,GAAoB,WAAb,EAAI,IAAI,EACf,EAAQ,GACZ,MACJ,CACA,IAAM,EAAM,OAAO,IAAI,MACnB,GAAY,EAAQ,IAAI,GAAK,EAAS,IAAI,EAAE,CAC5C,EAAO,GAAG,CAAC,GAAM,UAAU,CAAG,CAAA,EAI9B,AADO,EADA,AACM,EADC,GAAG,CAAC,GACF,UAAU,EACpB,GACN,EAAO,MAAM,AADI,CACH,GACd,OAAQ,EAAW,IAGnB,EAAiB,WAAW,EAAoB,EAAc,EAEtE,EACJ,EAUoD,GAExD,CAIA,WAAW,CAAI,CAAE,CAAK,CAAE,CACpB,GAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAI,EAAO,IAAI,CAAC,GACnC,OAAO,EACX,GAAI,CAAC,IAAI,CAAC,YAAY,CAAE,CACpB,GAAM,KAAE,CAAG,CAAE,CAAG,IAAI,CAAC,OAAO,CAEtB,EAAU,CAAC,AADL,IAAI,CAAC,OAAO,CAAC,OAAO,EACR,EAAA,AAAE,EAAE,GAAG,CAAC,GAAiB,IAE3C,EAAO,IADQ,AACJ,IADQ,IAAI,CAAC,aAAa,CAAC,CACd,GAAG,CAAC,GAAiB,OAAU,EAAQ,CACrE,IAAI,CAAC,YAAY,CAAG,AAvlBhC,SAAS,AAAS,CAAQ,CAAE,CAAU,EAClC,GAAgB,MAAZ,AAAkB,EAClB,MAAM,AAAI,UAAUsB,oCAIxB,IAAM,EAAW,AADK,GAAO,GACE,GAAG,CAAC,AAAC,GAnDpC,AAAuB,OAmDyB,KAnD5C,AACA,OAAO,AADA,IAEP,AAAmB,OAAZ,GACP,SAAO,AAAC,GAAW,AAgDuC,IAhD3B,EAC/BzC,aAAmB,OACZ,AAAC,CAAR,EAAmB,EAAQ,IAAI,CAAC,GACb,UAAnB,OAAO,GAAwB,AAAY,MAAM,GAC1C,AAAC,IACJ,GAAI,EAAQ,IAAI,GAAK,EACjB,OAAO,EACX,GAAIQ,EAAQ,SAAS,CAAE,CACnB,IAAM,EAAW,EAAA,QAAW,CAAC,EAAQ,IAAIE,CAAE,SAC3C,CAAI,CAAC,GAGE,CAAC,EAAS,IAHF,MAGY,CAAC,OAAS,CAAC,EAAA,UAAa,CAACA,EACxD,CACA,OAAO,CACX,EAEG,KAAM,UAgCb,AAAkB,MAAd,AAAoB,EACb,CAAC,EAAY,IACT,GAAc,EAAU,EAAY,GAG5C,GAAc,EAAU,EACnC,EA0kByC,OAAM,EACvC,CACA,OAAO,IAAI,CAAC,YAAY,CAAC,EAAM,EACnC,CACA,aAAa,CAAI,CAAE,CAAI,CAAE,CACrB,MAAO,CAAC,IAAI,CAAC,UAAU,CAAC,EAAM,EAClC,CAKA,iBAAiB,CAAI,CAAE,CACnB,OAAO,IAAI,GAAY,EAAM,IAAI,CAAC,OAAO,CAAC,cAAc,CAAE,IAAI,CAClE,CAOA,eAAe,CAAS,CAAE,CACtB,IAAM,EAAM,EAAA,OAAU,CAAC,GAGvB,OAFI,AAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IACnB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAK,IAAI,GAAS,EAAK,IAAI,CAAC,YAAY,GACvD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAC7B,CAMA,oBAAoB,CAAK,CAAE,OACvB,EAAI,IAAI,CAAC,OAAO,CAAC,sBAAsB,EACnC,CACG,EAA6B,IADzB,AACI,OAAO,EAAM,IAAI,CAAI,CACxC,CAQA,QAAQ,CAAS,CAAE,CAAI,CAAE,CAAW,CAAE,CAIlC,IAAM,EAAO,EAAA,IAAO,CAAC,EAAW,GAC1B,EAAW,EAAA,OAAU,CAAC,GAK5B,GAJA,EACmB,MAAf,EAAsB,EAAc,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAS,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAGjF,CAAC,IAAI,CAAC,SAAS,CAAC,SAAU,EAAM,KAChC,MAEA,CAAC,GAAsC,GAAG,CAA1B,IAAI,CAAC,QAAQ,CAAC,IAAI,EAClC,IAAI,CAAC,GAAG,CAAC,EAAW,GAAM,GAInB,AACqB,AAEhC,IAHe,CAAC,cAAc,CAAC,GACI,WAAW,GAEtB,OAAO,CAAE,AAAD,GAAY,IAAI,CAAC,OAAO,CAAC,EAAM,IAE/D,IAAM,EAAS,IAAI,CAAC,cAAc,CAAC,GAC7B,EAAa,EAAO,GAAG,CAAC,GAC9B,EAAO,MAAM,CAAC,GAMV,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IACvB,IAAI,CAAC,EAD6B,WAChB,CAAC,MAAM,CAAC,GAG9B,IAAI,EAAU,EAGd,GAFI,IAAI,CAAC,OAAO,CAAC,GAAG,GAChB,EAAU,EAAA,QAAW,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAE,EAAA,EACxC,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAC3C,AACV,IADc,CAAC,CADgD,IAErD,OAAG,EADgB,CAAC,AACd,GADiB,CAAC,GAAS,UAAU,OAErD,OAIR,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GACrB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GACrB,IAAM,EAAY,MACd,GAAc,CAAC,IADa,AACT,CAAC,MADW,IACD,CAAC,IAC/B,CAFyC,GAAG,AAExC,CAAC,KAAK,CAFqC,AAEpC,EAAW,GAE1B,CAJyD,GAIrD,CAAC,UAAU,CAAC,EACpB,CAIA,WAAW,CAAI,CAAE,CACb,IAAI,CAAC,UAAU,CAAC,GAChB,IAAM,EAAM,EAAA,OAAU,CAAC,GACvB,IAAI,CAAC,cAAc,CAAC,GAAK,MAAM,CAAC,EAAA,QAAW,CAAC,GAChD,CAIA,WAAW,CAAI,CAAE,CACb,IAAM,EAAU,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAC7B,IAEL,EAAQ,GADJ,IACW,CAAE,AAAD,GAAY,KAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GACzB,CACA,eAAe,CAAI,CAAE,CAAM,CAAE,CACzB,GAAI,CAAC,EACD,OACJ,IAAI,EAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GACxB,IACD,EADO,AACA,EAAE,CACT,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAM,IAE5B,EAAK,IAAI,CAAC,EACd,CACA,UAAU,CAAI,CAAE,CAAI,CAAE,CAClB,GAAI,IAAI,CAAC,MAAM,CACX,OAEJ,IAAI,EC3iBL,AD2iBc,SC3iBL4E,AAAStG,CAAI,CAAEsD,EAAU,CAAC,CAAC,EAEvC,IAAIlD,EAAOkD,EAAQyB,SAAS,EAAIzB,EAAQlD,IAAI,CAK5C,GAJa,CAIT,QAJAA,GACAA,IAAkBP,CAAa,CAC/BO,CADOV,AAA0B,GAEjC4D,EAAQlD,IAAI,CAAGA,CAFGP,AAEHO,EACdJ,EAGA,IAAoB,AAHd,OAHoD,GAMtD,AAA0B,OAAnBA,EACZ,MAAM,AAAIuG,UAAU,iFAEnB,GAAInG,GAAQ,CAACU,EAAU0F,QAAQ,CAACpG,GACjC,IADwC,EAClC,AAAIiG,MAAM,CAAC,0CAA0C,EAAEvF,EAAU2F,IAAI,CAAC,MAAA,CAAO,CACvF,MAPI,MAAM,AAAIJ,MAAM,uEASpB,OADA/C,EAAQtD,IAAI,CAAGA,EACR,IAAIuC,EAAee,EAC9B,EDyhB8B,EADN,CAAE,GACU,CADV,EAAM,CAAQ,MAAL,GAAG,GAAc,EAAM,MAAO,GAAM,GAAG,CAAI,CAAE,MAAO,CAAE,GAYjF,OAVA,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAClB,EAAO,IAAI,CAAC,AErxBK,QFqxBM,KACnB,OAAS,CACb,GACA,EAAO,IAAI,CAAC,AEzxBG,MFyxBM,KACb,IACA,IAAI,AADI,CACH,QAAQ,CAAC,MAAM,CAAC,GACrB,OAAS,EAEjB,GACO,CACX,CACJ,kBAee,CAAE,MALV,CAKiB,QALR,AAAM,CAAK,CAAE,EAAU,CAAC,CAAC,EACrC,IAAM,EAAU,IAAI,GAAU,GAE9B,OADA,EAAQ,GAAG,CAAC,GACL,CACX,EAC+B,UAAW,EAAU,kCGrzBpD,IAAA,EAAA,EAAA,CAAA,CAAA,MACA,EAAA,EAAA,CAAA,CAAA,OCOO,IAAMwD,EAAgB,CAAC,MAAO,OAAQ,MAAO,OAAQ,OAAQ,OAAO,CAErEC,EAAkB,CACtB,qEACA,4CACA,wCACA,uCACD,CAOD,SAASI,EAAMC,CAAe,CAAEC,CAAoB,EAClD,GAAIA,EAAQlG,GAAG,CAACiG,GAAU,OAAOA,EACjC,IAAK,IAAME,KAAOR,EAAe,CAC/B,IAAMG,EAAI,CAAA,EAAGG,EAAAA,EAAUE,EAAAA,CAAK,CAC5B,GAAID,EAAQlG,GAAG,CAAC8F,GAAI,OAAOA,CAC7B,CACA,IAAK,IAAMK,KAAOR,EAAe,CAC/B,IAAMG,EAAI,CAAA,EAAGG,EAAQ,MAAM,EAAEE,EAAAA,CAAK,CAClC,GAAID,EAAQlG,GAAG,CAAC8F,GAAI,OAAOA,CAC7B,CACA,OAAO,IACT,CChBA,SAAS,EAAM,CAAY,CAAE,CAAoB,EAC/C,IAAK,IAAM,IAAQ,CAAC,CAAA,EAAG,EAAK,GAAG,CAAC,CAAE,CAAA,EAAG,EAAK,YAAY,CAAC,CAAE,CAAA,EAAG,EAAK,IAAI,CAAC,CAAC,CAAE,AACvE,GAAI,EAAQ,GAAG,CAAC,GAAO,MAAO,CAAC,EAAK,CAEtC,MAAOI,EAAE,AACX,CCXA,IAAM,EAAS,kDACT,CAD4D,CACpD,iCADsF,QAE9F,CADkD,CACzC,aCFT,EAAM,QDCoE,oCCA1E,EAAM,2CAWZ,SAAS,EAAQ,CAAY,CAAE,CAAoB,EACjD,IAAK,IAAM,IAAQ,CAAC,CAAA,EAAG,EAAK,GAAG,CAAC,CAAE,CAAA,EAAG,EAAK,OAAOlG,CAAC,CAAC,CAAE8F,AACnD,GAAI,EAAQ,GAAG,CAAC,GAAO,MAAO,CAAC,EAAK,CAEtC,MAAO,EAAE,AACX,CAEA,IAAM,EAAa,IAAI,IAAI,CAAC,SAAU,SAAU,UAAU,ECpB7C,EAAsB,CACjC,SAAU,QAAS,MAAO,MAAO,OAAQ,MAAO,OAAQ,SACxD,KAAM,KAAM,OAAQ,OAAQ,MAAO,MAAO,KAAM,MAChD,MAAO,OAAQ,OAAQ,QAAS,OAAQ,UACzC,CAEK,EAAW,CACf,4FACA,mCACA,4CACA,sCACA,iCACA,oCACD,CCXY,EAAgC,CL0DD,CAC1C0B,GAAI,KACJC,WAAY9B,EACZS,WAtCF,SAASA,AAAWC,CAAe,EACjC,IAAMC,EAAM,IAAI5G,IAChB,IAAK,IAAM6G,KAAMX,EAAiB,KAE5Ba,EACJ,IAFAF,EAAGC,SAAS,CAAG,EAEPC,EAAIF,EAAGG,IAAI,CAACL,IAAWC,EAAIK,GAAG,CAACF,CAAC,CAAC,EAAE,CAC7C,CACA,OAAOH,CACT,EA+BEd,QAAQqB,CAAI,CAAEC,CAAQ,CAAEY,CAAe,EACrC,IAAMJ,EAAMV,AA9BhB,SAASA,AACPC,CAAY,CACZC,CAAgB,CAChBZ,CAAoB,CACpBa,CAAgB,EAEhB,GAAIF,EAAK9B,UAAU,CAAC,KAGlB,CAHwB,MAGjBiB,EAFK,AACIH,AAnCXC,CAkCO,EAAA,CAECG,CAFD,GACYe,IADZ,AAAW,EAAC,IAAK,CAAA,EAAA,EAAA,OAAA,AAAO,EAACF,GAAWD,GAlCzCd,IAkCgD,CAlC3C,CAAC,SAAST,IAAI,CAAC,KAmCE2B,EADiD,KAC1C,CAAC,MAAO,IACtBf,GAKxB,IAAK,IAAMgB,KAAKH,EACd,GAAIF,EAAK9B,CADc,SACJ,CAACmC,EAAEC,IAAI,EAAG,CAC3B,IAAMC,EAAOP,EAAKxD,KAAK,CAAC6D,EAAEC,IAAI,CAAChE,MAAM,EAE/BmE,EAAMtB,EADIkB,EAAEG,EAAE,AACFpB,CADK,CAAA,EAAGiB,EAAEG,EAAE,CAAC,CAAC,EAAED,EAAAA,CAAM,CAAGA,EAChBlB,GAC3B,GAAIoB,EAAK,OAAOA,CAClB,CAEF,OAAO,IACT,EADe,AAQaT,EAAMC,EAAUY,EAAIxB,OAAO,CAAEwB,EAAIC,SAAS,CAR7B,CAQiC,EAAE,EACxE,OAAOL,EAAM,CAACA,EAAI,CAAG,EAAE,AACzB,CACF,EClCgD,CAC9C,GAAI,SACJ,WApC2B,CAoCf,AApCgB,MAAO,OAAO,CAqC1C,WAvBF,CAuBE,QAvBO,AAAW,CAAe,EACjC,IAGI,EAHE,EAAM,IAAI,IAIhB,IAFA,qGAAQ,CAAC,EAAE,CAAC,SAAS,CAAG,EAEhB,EAAI,QAAQ,CAAC,EAAE,oCAACrB,IAAI,CAAC,IAAWE,CACtC,IAAM,EAAI,CAAC,CAAC,EAAE,CAAC,IAAI,GACf,GAAG,EAAI,GAAG,CAAC,EACjB,CAGA,IAvBe,AAsBf,CArBA,oGAED,AAmBS,CAAC,EAAE,CAAC,SAAS,CAAG,EAChB,EArBR,AAqBY,QAAQ,CAAC,EAAE,0CAAC,IAAI,CAAC,IAC3B,IAAK,CADiC,GAC3B,KAAO,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,WAAY,CACvC,IAAM,EAAI,EAAI,IAAI,GAAG,KAAKM,CAAC,WAAWJ,CAAC,EAAE,CAAC,IAAI,GAC1C,GAAG,EAAI,GAAG,CAAC,EACjB,CAEF,OAAOO,CACT,EAME,QAAQ,CAAI,CAAE,CAAQ,CAAE,CAAe,EACrC,GAAI,EAAK,UAAU,CAAC,KAAM,CAExB,IAAM,EAAO,EAAKZ,MAAMC,CAAG,EAAK,OAAO,CAAC,OAAQ,IAAI,MAAM,CACpD,EAAO,EAAK,KAAK,CAAC,GACpB,EAAM,CAAA,CADqB,CACrB,EAAA,OAAA,AAAO,EAAC,GAClB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,IAAK,EAAM,CAAA,EAAA,CAFmC,CAEnC,OAAA,AAAO,EAAC,GAE7C,IAAM,EAAO,EAAOY,CAAAA,EAAAA,EAAAA,IAAAA,AAAI,EAAC9B,EAAK,EAAK,OAAO,CAAC,MAAO,MAAQ,EAC1D,OAAO,EAAM,CAAA,EAAA,EAAA,SAAA,AAAS,EAAC,GAAM,OAAOkB,CAAC,MAAO,KAAM,EAAI,OAAO,CAC/D,CAEA,OAAO,EAAM,EAAK,OAAO,CAAC,MAAO,KAAM,EAAI,OAAO,CACpD,CACF,ECjC4C,CAC1C,GAAI,KACJ,WAtB2B,CAsBf,AAtBgB,MAAM,CAuBlC,QAAQ,CAAI,CAAE,CAAS,CAAE,CAAe,EACtC,IAAM,EAAM,EAAI,YAAY,CAC5B,GAAI,CAAC,EAAK,MAAO,EAAE,CACnB,IAAI,EAAqB,KAGzB,GAFI,IAAS,EAAK,EAAM,GACf,EAAKO,UAAU,CAAC,CAAA,EAAG,EAAI,CAAC,CAAC,GAAGC,GAAM,EAAK,KAAK,CAAC,EAAI,MAAM,CAAG,EAAA,EAC/D,AAAQ,SAAM,MAAO,EAAE,CAC3B,CAD6B,GACvB,EAAgB,EAAE,CACxB,IAAK,IAAM,KAAK,EAFoCH,AAEhC,OAAO,CAAE,CAC3B,GAAI,CAAC,EAAE,QAAQ,CAAC,OAAQ,SACxB,IAAM,EAAI,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,IACb,AAAQ,QAAY,MAAN,GAAc,IAAM,CAAA,GAAK,EAAI,IAAI,CAAC,EACvD,CACA,OAAO,EAAI,IAAI,EACjB,EACA,WAhCF,CAgCE,QAhCkB,AAAX,CAA0B,EACjC,IAEI,EAFE,EAAM,IAAIP,IAGhB,IAFA,EAAO,SAAS,CAAG,EAEX,EAAI,EAAO,IAAI,CAAC,IAAW,EAAI,GAAG,CAACC,CAAC,CAAC,EAAE,EAE/C,IADA,EAAM,SAAS,CAAG,EACV,EAAI,EAAM,IAAI,CAAC,IAAW,KAE5B,EACJ,IAFA,EAAO,SAAS,CAAG,EAEX,EAAI,EAAO,IAAI,CAAC,CAAC,CAAC,EAAE,GAAI,EAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAC9C,CACA,OAAOhG,CACT,CAqBA,ECH8C,CAC5C,GAAI,OACJ,WAtC2B,CAAC,AAsChB,MAtCsB,CAuClC,WAhBF8F,CAgBE,QAhBO,AAAW,CAAe,EACjC,IAEI,EAFE,EAAM,IAAI,IAGhB,IAFA,EAAI,SAAS,CAAG,EAER,EAAI,EAAI,IAAI,CAAC,IAAW,EAAI,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAA,CAAE,EAEnD,IADA,EAAI,SAAS,CAAG,EACR,EAAI,EAAI,IAAI,CAAC,IAAW,CAC9B,IAAM,EAzBV,AAyBc,SAzBL,AAAa,CAAY,EAChC,IAAM,EAAO,EAAK,KAAK,CAAC,MAAM,MAAM,CAAC,AAAC,GAAM,GAAW,MAAN,UACjD,AAAK,EAAK,EAAN,IAAY,CACA,CADE,QACO,CAArB,CAAI,CAAC,EAAE,CAAqB,CAAC,WAAY,EAAK,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAC7DA,AAAY,SAAS,EAAjB,CAAC,EAAE,CAAqB,CAAC,QAAS,EAAK,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAC9C,QAAQ,CAApB,CAAI,CAAC,EAAE,CAAoB,CAAC,OAAQ,EAAK,KAAK,CAAC,GAAG,CAAC,IAAIG,CAAC,KACrD,EAAK,IAAI,CAAC,KAJQ,CAIF,CACzB,EAkB2B,CAAC,CAAC,EAAE,CACvB,IAAG,EAAI,GAAG,CAAC,EACjB,CACA,OAAO,CACT,EAMEe,EA7BwD,MA6BhD,CAAI,CAAE,CAAQ,CAAE,CAAe,EACrC,IAAM,EAAU,EAAI,OAAO,CAC3B,GAAI,EAAK,UAAU,CAAC,OAAS,EAAK,UAAU,CAAC,OAAQ,CACnD,IAAM,EAAO,EAAK,OAAO,CAAC,QAAS,IAG/B,EAAM,EADM,CAAA,EAAA,EAAA,CACE,QADF,AAAS,EAAC,CAAA,EAAA,EAAA,IAAA,AAAI,EAAC,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,GAAW,IAAO,OAAO,CAAC,MAAO,KAC7C,GAC3B,GAAI,EAAI,MAAM,CAAE,OAAO,EAEvB,GAAI,EAAK,UAAU,CAAC,OAAS,CAACG,EAAW,GAAG,CAAC,CAAA,EAAA,EAAA,QAAA,AAAQ,EAAC,IAAYD,CAChEA,IAAM,EAAQ,CAAA,EAAA,EAAA,IAAA,AAAI,EAAC,CAAA,EAAA,EAAA,OAAO,AAAP,EAAQ,GAAW,CAAA,EAAA,EAAA,QAAA,AAAQ,EAACjB,EAAU,OAAQ,GAEjE,GAAI,CADJ,EAAM,EAAQ,CAAA,EAAA,EAAA,SAAA,AAAS,EAAC,GAAO,OAAO,CAAC,MAAO,KAAM,EAAA,EAC5C,MAAM,CAAE,OAAO,CACzB,CACA,MAAO,EAAE,AACX,CACA,GAAI,EAAKN,UAAU,CAAC,UAAW,CAE7B,IAAM,EAAQ,EAAS,KAAK,CAACgC,KACvB,EAAS,EAAM,WAAW,CAAC,OAC3B,EAAU,GAAU,EAAI,EAAM,KAAK,CAAC,EAAG,EAAS,GAAG,IAAI,CAAC,KAAO,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,GACvE,EAAO,EAAK,KAAK,CAAC,GAAiB,KAAK,CAAb,AAAc,KAE/C,CAFuC,GAElC,IAAM,IAAK,CAAC,EAAK,IAAI,CAAC,KAAM,EAAK,KAAK,CAAC,EAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAE,CAC7D,GAAI,CAAC,EAAG,SACR,IAAM,EAAM,EAAQ,CAAA,EAAG,EAAQ,CAAC,EAAE,EAAA,CAAG,CAAE,GACvC,GAAI,EAAI,MAAM,CAAE,OAAO,CACzB,CAEF,CACA,MAAO,EAAE,AACX,CACF,CAFe,CCzCmC,CAChD,GAAI,WACJ,CDuC8B,UCvClB,EACZZ,WAhBFZ,CAgBEY,QAhBO,AAAW,CAAe,EACjC,IAAM,EAAM,IAAI,IAChB,IAAK,IAAM,KAAM,EAAU,KAErB,EACJ,IAFA,EAAGT,SAAS,CAAG,EAEP,EAAI,EAAG,IAAI,CAAC,IAAW,CAC7BG,IAAM,EAAI,CAAC,CAAC,EAAE,CAAC,IAAI,GACf,GAAG,EAAI,GAAGF,CAAC,EACjB,CACF,CACA,OAAO,CACT,EAME,QAAQ,CAAI,CAAE,CAAQ,CAAE,CAAe,EAErC,IAAM,EAAO,CADD,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,GAAU,WAAW,MACnB,EAAoB,CAAC,MAAM,CAACN,CAAC,EAAG,EAAG,IAAM,GAAKe,EAAE,OAAO,CAAC,KAAO,GAE/E,EAAS,EAAK,QAAQ,CAAC,MAAQ,EAAK,QAAQ,CAAC,MAE7C,EAAO,EAAK,UAAU,CAAC,MAAQ,EACjC,EAAK,OAAO,CAAC,MAAO,KACpB,EAAK,OAAO,CAAC,SAAU,KAM3B,IAAK,IAAM,IAJG,CACZ,AAGc,CAHd,EAAA,EAAA,SAAA,AAAS,EAAC,CAAA,EAAA,EAAA,IAAI,AAAJ,EAAK,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,GAAW,IAAO,OAAO,CAAC,MAAOE,KACxD,EAAK,OAAO,CAAC,QAAS,IACvBG,CACsB,CACrB,GAAI,EAAI,OAAO,CAAC,GAAG,CAAC,GAAI,MAAO,CAAC,EAAE,CAClC,CADoC,GAC/B,IAAM,KAAK,EAAM,CACpB,IAAM,EAAO,EAAE,QAAQ,CAF2C,AAE1C,GAAK,EAAI,CAAA,EAAG,EAAA,EAAI,EAAA,CAAG,CAC3C,GAAI,EAAI,OAAO,CAAC,GAAG,CAAC,GAAO,MAAO,CAAC,EAAK,CACxCjB,GAAI,EAAI,OAAO,CAAC,GAAG,CAAC,CAAA,EAAG,EAAE,MAAM,EAAE,EAAA,CAAG,EAAG,MAAO,CAAC,CAAA,EAAG,EAAE,MAAM,EAAE,EAAA,CAAG,CAAC,AAClE,CACF,CACA,MAAOU,EAAE,AACX,CACF,EChDC,CAEK,EAAkB,IAAI,IAC5B,IAAK,IAAM,KAAK,EAAW,IAAK,IAAM,KAAK,EAAE,UAAU,CAAE,EAAgB,GAAG,CAAC,EAAG,GAIhF,IAAM,EAAsC,CAC1CZ,MAAO,KAAM,OAAQ,KACrBD,MAAO,KAAM,OAAQ,KAAM,OAAQ,KAAM,OAAQ,KACjD,MAAO,KAAM,OAAQ,KACrB,MAAO,KACP,MAAO,KACP,SAAU,QACV,QAAS,OACT,MAAO,OACP,MAAO,SAAU,OAAQ,SACzB,MAAO,SACP,OAAQ,MACR,SAAU,QACV,KAAM,IAAK,KAAM,IACjB,OAAQ,MAAO,OAAQ,MAAOvG,MAAO,MAAO,MAAO,MACnD,KAAM,OAAQ,MAAO,OACrB,MAAO,SAAU,OAAQ,SACzB,OAAQ,MAAO,QAAS+G,OAAQ,OAAQ,MAAOH,UAAW,QAC5D,EAGO,SAAS,EAAgB,CAAY,EAC1C,OAAO,EAAgB,GAAG,CAAC,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,GAAM,WAAW,KAAO,IAC7D,CN5BA,IAAM,EAAY,IAAI,IAAI,CACxB,eACA,OACA,QACA,OACA,QACA,cACA,SACA,QACA,OACA,MACA,SACA,WACAL,UACA,kBACA,YACD,EAiED,SAAS,EAAa,CAAS,EAC7B,OAAO,EAAE,OAAO,CAAC,SAAU,IAAI,OAAO,CAAC,MAAO,GAChD,CA4BO,SAAS,EAAa,CAAW,EACtC,IAAM,EAAO,CAAA,EAAA,EAAA,IAAA,AAAI,EAAC,EAAK,UACvB,GAAI,CAAC,CAAA,EAAA,EAAA,UAAA,AAAU,EAAC,GAAO,OAAO,KAC9B,GAAI,CACF,IAAM,EAAI,sBAAsB,IAAI,CAAC,CAAA,EAAA,EAAA,YAAA,AAAY,EAAC,EAAM,SACxD,OAAO,EAAI,CAAC,CAAC,EAAE,CAAG,IACpB,CAAE,KAAM,CACN,OAAO,IACT,CACF,CAIA,SAAS,EAAQ,CAAS,EACxB,OAAO,EAAE,KAAK,CAAC,SAAS,IAAI,CAAC,IAC/B,iCAsEO,SAAS,AAAuB,CAA8B,CAAE,CAAa,EAClF,IAAM,EAAQ,IAAI,IA2ClB,MAAO,CAAE,MAzCT,SAAS,EACP,GAAM,OAAE,CAAK,KAAE,CAAG,CAAE,CAnDxB,AAmD2B,SAnDlB,AAAU,CAA8B,CAAE,CAAa,EAC9D,IAAM,EAAQ,CAAC,MAAM,OAAO,CAAC,GAAe,EAAc,CAAC,EAAY,EAAE,GAAG,CAAC,AAAC,GAAM,EAAQ,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,KAC9F,EAAU,EAAQ,EAAO,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,GAAyB,AAAjB,MAAM,MAAM,CAAS,CAAK,CAAC,EAAE,CAAG,AAtBjF,SAAS,AAAe,CAAe,EACrC,GAAqB,IAAjB,EAAM,MAAM,CAAQ,OAAO,CAAK,CAAC,EAAE,CACvC,IAAM,EAAQ,EAAM,GAAG,CAAC,AAAC,GAAM,EAAQ,GAAG,KAAK,CAAC,MAC1C,EAAQ,CAAK,CAAC,EAAE,CAClB,EAAI,EACR,KAAO,EAAI,EAAM,MAAM,EAChB,EAAM,KAAK,CAAC,AAAC,GAAM,CAAC,CAAC,EAAE,GAAK,CAAK,CAAC,EAAE,EADlB,CACqB,GADhB,CAG9B,OAAO,EAAM,KAAK,CAAC,EAAG,GAAG,IAAI,CAAC,MAAQ,GACxC,EAagG,IAExF,EAAS,IAAI,IACb,EAAmB,EAAE,CAC3B,IAAK,IAAM,KAAQ,EAAO,CACxB,IAAM,EAAU,EAAQ,CAAA,EAAA,EAAA,QAAQ,AAAR,EAAS,EAAS,IAC1C,IADkD,AAC7C,IAAM,KAvER,AAuEa,SAvEJ,AAAc,CAAY,EACxC,IAEI,EAFE,EAAO,CAAA,EAAA,EAAA,IAAA,AAAI,EAAC,EAAM,YAqEkF,KApE1G,GAAI,CAAC,CAAA,EAAA,EAAA,UAAA,AAAU,EAAC,GAAO,MAAO,EAAE,CAEhC,GAAI,CACF,EAAM,AAzBV,SAAS,AAAc,CAAW,EAGhC,GAAI,CACF,OAAO,KAAK,KAAK,CAAC,EACpB,CAAE,KAAM,CAER,CAKA,OAAO,KAAK,KAAK,CAAC,AAJD,EACd,OAAO,CAAC,kBAAmB,IAC3B,OAAO,CAAC,qBAAsB,MAC9B,OAAO,CAAC,eAAgB,MAE7B,EAYwB,CAAA,EAAA,EAAA,YAAA,AAAY,EAAC,EAAM,QACzC,CAAE,KAAM,CACN,MAAO,EACT,AADW,CAEX,IAAM,EAAQ,EAAI,eAAe,EAAE,OAAS,CAAC,EACvC,EAAU,EAAa,EAAI,eAAe,EAAE,SAAW,KACvD,EAAe,EAAE,CACvB,IAAK,GAAM,CAAC,EAAS,EAAQ,GAAI,OAAO,OAAO,CAAC,GAAQ,CACtD,GAAI,CAAC,EAAQ,QAAQ,CAAC,OAAS,CAAC,EAAQ,MAAM,CAAE,SAChD,IAAM,EAAS,CAAO,CAAC,EAAE,CACzB,GAAI,CAAC,EAAO,QAAQ,CAAC,MAAO,SAC5B,IAAM,EAAO,EAAQ,KAAK,CAAC,EAAG,CAAC,GAEzB,CAF6B,CAExB,CAAC,EADM,EAAa,CADW,CACJ,KAAK,CAAC,EAAG,CAAC,IACjB,CAAC,AADqB,MACf,CAAC,OAD4B,EACnB,IAAI,CAAC,KACrD,EAAI,IAAI,CAAC,MAAE,KAAM,CAAG,EACtB,CACA,OAAO,CACT,EAiDkC,GAC5B,EAAQ,CAD2B,GACvB,CAAC,CAAE,KAAM,EAAE,IAAI,CAAE,GAAI,CAAC,EAAS,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,IAAI,CAAC,IAAK,GAE7E,IAAK,IAAM,KAAO,AAtGf,SAAS,AAAc,CAAY,EACxC,IAAM,EAAgB,EAAE,CAExB,OA1BF,AAyBE,SAzBO,EAAK,CAAY,CAAE,CAAW,CAAE,CAAiB,CAAE,CAAa,EACvE,IAAI,EACJ,GAAI,CACFA,EAAUJ,CAAAA,EAAAA,EAAAA,WAAAA,AAAW,EAAC,EAAK,CAAE,eAAe,CAAK,EACnD,CAAE,KAAM,CACNK,MACF,CACA,IAAK,IAAM,KAAK,EAAS,CACvB,GAAI,EAAE,IAAI,CAAC,UAAU,CAAC,MAClB,EAAU,GAAG,CAAC,EAAE,IAAI,EADI,CACD,QAC3B,IAAM,EAAO,CAAA,EAAA,EAAA,IAAA,AAAI,EAAC,EAAK,EAAE,IAAI,EAC7B,GAAI,EAAE,WAAW,GAAI,CACnB,EAAK,EAAM,EAAM,EAAM,GACvB,QACF,GACI,CAAC,EAAE,MAAM,IAAI,AACbgB,EAAE,IAAI,CAAC,QAAQ,CAAC,UAAU,CACzB,EAAK,GAAG,CAAC,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,EAAE,IAAI,EAAEL,WAAWK,KAAK,AAC9C,EAAI,IAAI,CAACjB,CAAAA,EAAAA,EAAAA,QAAAA,AAAQ,EAAC,EAAM,GAC1B,CACF,EAKO,EAAM,EMrBJ,INqBU,AMrBNY,IAAI,EAAgB,IAAI,INqBD,GAC3B,EAAI,GAAGT,CAAC,AAAC,GAAM,EAAE,KAAK,CAAC,SAAS,IAAI,CAAC,MAAM,IAAI,EACxD,EAkGoC,GAAO,CACrC,IAAM,EAAM,EAAQ,CAAA,EAAA,EAAA,IAAA,AAAI,EAAC,EAAM,IACzB,EAAO,EAAQ,CAAA,EAAA,EAAA,QAAA,AAAQ,EAAC,EAAS,IACvC,IAAI,EAAO,GAAG,CAAC,GACf,GAAI,CADkB,AAEpB,IAAM,EAAK,CAAA,EAAA,CAFmB,CAEnB,QAAQ,AAAR,EAAS,GACpB,EAAO,GAAG,CAAC,EAAM,MAAE,KAH4C,CAGtC,EAAK,KAAM,GAAW,KAAM,QAAS,EAAG,OAAO,CAAE,KAAM,EAAG,IAAI,AAAC,EAC1F,CAAE,KAAM,CAER,CACF,CACF,CAEA,IAAM,EAAe,EAAM,GAAG,CAAC,GAAc,IAAI,CAAC,UAAY,EAAa,GAE3E,MAAO,CAAE,MADK,IAAI,EAAO,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,EAAG,IAAM,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE,IAAI,GAC7D,IAAK,CAAE,QAAS,IAAI,IAAI,EAAO,IAAI,IAAK,UAAW,eAAS,CAAa,CAAE,CAC7F,EAwBqC,EAAa,GACxC,EAAU,IAAI,IAAI,EAAM,GAAG,CAAC,AAAC,GAAM,EAAE,IAAI,GAC/C,IAAK,IAAM,IAAK,IAAI,EAAM,IAAI,GAAG,CAAE,AAAI,AAAC,EAAQ,GAAG,CAAC,IAAI,EAAM,MAAM,CAAC,GAErE,IAAI,EAAO,EACP,EAAS,EACP,EAAwC,EAAE,CAChD,IAAK,IAAM,KAAK,EAAO,CACrB,IACI,EADE,EAAS,EAAM,GAAG,CAAC,EAAE,IAAI,EAE3B,GAAU,EAAO,OAAO,GAAK,EAAE,OAAO,EAAI,EAAO,IAAI,GAAK,EAAE,IAAI,EAAE,AACpE,EAAQ,EAAO,UAAU,CACzB,MAEA,EAAQ,AAnChB,SAAS,AAAkB,CAAc,EACvC,IAAM,EAAW,EAAgB,EAAK,IAAI,EAC1C,GAAI,CAAC,GAAY,EAAK,IAAI,CAAG,IAAS,OAAO,IAAI,IACjD,GAAI,CACF,OAAO,EAAS,UAAU,CAAC,CAAA,EAAA,EAAA,YAAA,AAAY,EAAC,EAAK,GAAG,CAAE,QACpD,CAAE,KAAM,CACN,OAAO,IAAI,GACb,CACF,EA2BkC,GAC1B,EAAM,GAAG,CAAC,EAAE,IAAI,CAAE,CAAE,QAAS,EAAE,OAAO,CAAE,KAAM,EAAE,IAAI,CAAE,WAAY,CAAM,GACxE,KAEF,IAAM,EAAW,EAAgB,EAAE,IAAI,EACvC,GAAI,CAAC,EAAU,SACf,IAAM,EAAO,IAAI,IACjB,IAAK,IAAM,KAAQ,EACjB,IADwB,AACnB,IAAM,KAAO,EAAS,OAAO,CAAC,EAAM,EAAE,IAAI,CAAE,GAC3C,CAAC,CADgD,EACzC,IAAQ,EAAE,IAAI,EAAI,EAAK,GAAG,CAAC,KACvC,CAD6C,CACxC,GAAG,CAAC,GACT,EAAM,IAAI,CAAC,CAAE,KAAM,EAAE,IAAI,CAAE,GAAI,CAAI,GAGzC,CASA,MAAO,CAAE,MAPsB,EAAM,GAAG,CAAC,AAAC,IAAM,kBAAC,CAC/C,KAAM,EAAE,IAAI,CACZ,IAAA,EMzMqB,ANyMf,EAAW,EAAE,AMzMc,INyMV,CMxMrB,EAAM,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,GAAM,WAAW,GAChC,AAAL,EAAqB,EAAjB,CAAoB,CAAC,GAClB,CAAW,CAAC,CADY,CACR,EAAI,EAAI,KAAK,CAAC,GADC,MNwMlC,KAAM,EAAE,IAAI,CACZ,QAAS,EAAE,OAAO,CAClB,KAAM,EAAE,IACV,AADc,CACb,SACe,EAAO,MAAO,MAAE,SAAM,CAAO,CAAE,CACjD,CAEe,CACjB,yCOrQA,IAAA,EAAA,EAAA,CAAA,CAAA,MACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,6CAQA,IAAMwB,EACJ,iKAyBK,SAASS,AAAyBC,CAAe,EACtD,IAAMH,EAjBR,AAiBgBN,SAjBPA,AAAaC,CAAgB,EACpC,GAAI,CACF,IAAMC,EAAU,CAAA,EAAA,EAAA,IAAA,AAAI,EAACD,EAAU,sBAC/B,GAAI,CAAA,EAAA,EAAA,UAAA,AAAU,EAACC,GAAU,CACvB,IAAMC,EAAMC,KAAKC,KAAK,CAAC,CAAA,EAAA,EAAA,YAAA,AAAY,EAACH,EAAS,SAC7C,GAAIlH,MAAMC,OAAO,CAACkH,EAAIG,KAAK,GAAKH,EAAIG,KAAK,CAAChF,MAAM,CAC9C,CADgD,MACzC6E,EAAIG,KAAK,CAACnH,GAAG,CAAC,AAACoH,GAAc,CAAA,EAAA,EAAA,OAAA,AAAO,EAACN,EAAUM,GAE1D,CACF,CAAE,KAAM,CAER,CACA,MAAO,CAACN,EAAS,AACnB,EAI6BQ,EAAGlF,IAAI,EAG5BmF,EAAU,CAAA,EAAA,EAAA,iBAAiB,AAAjB,EAAkBD,EAAGd,EAAE,EACjCgB,EAAW,CAAA,EAAA,EAAA,KAAA,AAAK,EAAC,CAAA,EAAA,EAAA,QAAA,AAAQ,EAACF,EAAGd,EAAE,GAI/BiB,EAAU,CAAA,EAAA,EAAA,sBAAsB,AAAtB,EAAuBN,EAAOG,EAAGlF,IAAI,EACjDsF,EAAiD,KACjDC,GAAU,EAEd,eAAeC,IACb,GAAID,EAAS,YACXE,IAGFF,GAAU,EACV,GAAI,CACF,MAAMJ,EACN,IAAMO,EAAQL,EAAQM,KAAK,GACrBX,EAAI,MAAM,CAAA,EAAA,EAAA,eAAA,AAAe,EAACU,EAAON,GACvCQ,QAAQC,GAAG,CACT,CAAC,mCAAmC,EAAEX,EAAGlE,IAAI,CAAC,GAAG,EAAEgE,EAAElF,KAAK,CAAC,SAAS,EAAEkF,EAAEc,KAAK,CAAC,QAAQ,EACpFd,EAAEe,QAAQ,CAAG,EAAI,CAAC,EAAE,EAAEf,EAAEe,QAAQ,CAAC,UAAU,CAAC,CAAG,GAAA,CAC/C,CAEN,CAAE,MAAOC,EAAG,CACVJ,QAAQjJ,KAAK,CAAC,CAAC,uBAAuB,EAAEuI,EAAGlE,IAAI,CAAC,EAAE,CAAC,CAAEgF,aAAalE,MAAQkE,EAAEC,OAAO,CAAGD,EACxF,QAAU,CACRT,EAAU,EACZ,CACF,CAEA,SAASE,IACHH,GAAUY,aAAaZ,GAC3BA,EAAWa,WAAWX,EAAK,IAC7B,CAEA,IAAMY,EAAU,EAAA,OAAQ,CAACC,KAAK,CAACtB,EAAO,CACpCuB,QAAS,AAAC5D,GAAc8B,EAAO+B,IAAI,CAAC7D,GACpC8D,cAAe,GACfC,YAAY,CACd,GASA,OAPAL,EAAQ9D,EAAE,CAAC,QAAS,KAClBsD,QAAQC,GAAG,CAAC,CAAC,yBAAyB,EAAEX,EAAGlE,IAAI,CAAC,EAAE,EAAE+D,EAAM7C,IAAI,CAAC,MAAM,oBAAoB,CAAC,EACrFsD,GACP,GACAY,EAAQ9D,EAAE,CAAC,MAAO,IAAMmD,KACxBW,EAAQ9D,EAAE,CAAC,QAAS,AAAC0D,GAAMJ,QAAQjJ,KAAK,CAAC,CAAC,+BAA+B,EAAEuI,EAAGlE,IAAI,CAAC,EAAE,CAAC,CAAEgF,IAEjF,CACL,MAAMU,OACApB,GAAUY,aAAaZ,GAC3B,MAAMc,EAAQO,KAAK,EACrB,CACF,CACF,0DCnGA,IAAA,EAAA,EAAA,CAAA,CAAA,MACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,yCA0GA,IAAMiC,EA7EC,AA6EShC,SA7EAA,AAAqBC,CAAwB,EAC3D,IAAMC,EAAQD,EAAKC,KAAK,EAAI,EACtBC,EAAUF,EAAKE,OAAO,EAAI,GAC1BC,EAAS,IAAIC,IACfC,EAAM,EACNC,EAAS,IAAI7K,IAEjB,SAAS8K,EAAMhD,CAAU,EACvB,IAAM4B,EAAIgB,EAAOK,GAAG,CAACjD,GACjB4B,IAAGA,EAAEkB,GAAG,CAAG,EAAEA,CAAAA,CACnB,CAyDA,eAAeuB,IACb,MAAMnI,QAAQC,GAAG,CAAC,IAAIyG,EAAO0B,MAAM,GAAG,CAAC9K,GAAG,CAAC,AAACoI,GAAMA,EAAEyB,MAAM,CAACf,IAAI,KAC/DM,EAAO2B,KAAK,EACd,CAEA,MAAO,CAAEX,UApCT,SAASA,EACP,IAAMC,EAAMpB,EAAKqB,IAAI,GAAG/K,MAAM,CAAEgL,AAAD,GAAOtB,EAAKU,MAAM,CAACY,EAAEnI,IAAI,GAAGC,KAAK,CAAC,EAAG6G,GAEpE,IAAK,IAAM5B,KADXiC,EAAS,IAAI7K,IAAI2L,EAAIrK,GAAG,CAAC,AAACuK,GAAMA,EAAE/D,EAAE,GACnB6D,IAAKX,AA3BxB,SAASA,AAASpC,CAAsB,EACtC,GAAI8B,EAAOpK,GAAG,CAACsI,EAAGd,EAAE,EAAG,OAAOgD,EAAMlC,EAAGd,EAAE,EACpCyC,EAAKU,MAAM,CAACrC,EAAGlF,IAAI,GACxBgH,AAD2B,EACpBQ,GAAG,CAACtC,EAAGd,EAAE,CAAE,CAAEqD,OAAQZ,EAAKa,KAAK,CAACxC,GAAKgC,IAAK,EAAEA,CAAI,EACzD,EAuBiChC,GAC/B,IAAK,GAAM,CAACd,EAAI4B,EAAE,EAAI,IAAIgB,EAAO,CAAE,CACjC,IAAM9B,EAAK2B,EAAKQ,GAAG,CAACjD,GACfc,GAAO2B,EAAKU,CAAN,KAAY,CAACrC,EAAGlF,IAAI,GAAG,CAC3BgG,EAAEyB,MAAM,CAACf,IAAI,GAClBM,EAAOe,MAAM,CAAC3D,GAElB,CACF,EAyBoBgE,cAtBpB,SAAuBhE,AAAdgE,CAAwB,EAC/B,GAAIpB,EAAOpK,GAAG,CAACwH,GAAK,OAAOgD,EAAMhD,GACjC,IAAMc,EAAK2B,EAAKQ,GAAG,CAACjD,EACpB,CAAKc,GAAD,AAAQ2B,EAAKU,CAAN,KAAY,CAACrC,EAAGlF,IAAI,GAAG,CAC9BgH,EAAOqB,IAAI,EAAItB,GAASY,AAnC9B,SAASA,EACP,IAAIC,EAAwB,KACxBC,EAAMC,IACV,IAAK,GAAM,CAAC1D,EAAI4B,EAAE,GAAIgB,GAChBG,EAAOvK,EADiB,CACd,CAACwH,IACX4B,CADgB,CACdkB,GAAG,CAAGW,IACVA,CADe,CACT7B,EAAEkB,GAAG,CACXU,EAASxD,GAGTwD,IACGZ,EAAOK,EADF,CACK,CAACO,GAASH,MAAM,CAACf,IAAI,GACpCM,EAAOe,MAAM,CAACH,GAElB,IAsBMZ,EAAOqB,IAAI,EAAItB,GACnBC,EAAOQ,GAAG,CADkB,AACjBpD,EAAI,CAAEqD,KADmB,EACXZ,EAAKa,KAAK,CAACxC,GAAKgC,IAAK,EAAEA,CAAI,GACtD,EAemCoB,WAbnC,QAJkF,CAIzEA,AAAWlE,CAAU,EAC5B,OAAO4C,EAAOpK,GAAG,CAACwH,EACpB,EAW+CmE,UAT/C,SAASA,EACP,MAAO,IAAIvB,EAAOwB,IAAI,GAAG,AAC3B,UAO0DC,CAAQ,CACpE,EAIqC,CACnCP,KAAM,EAAA,cAAc,CACpBb,IAAK,EAAA,YAAY,CACjBE,OAAQ,EAAA,UAAU,CAClBG,MAAO,AAACxC,GAAO,CAAA,EAAA,EAAA,wBAAA,AAAwB,EAACA,EAC1C,0BAcO,SAASkD,AAAchE,CAAU,EACtCwE,EAAQR,aAAa,CAAChE,EACxB,iBAGO,SAASkE,AAAWlE,CAAU,EACnC,OAAOwE,EAAQN,UAAU,CAAClE,EAC5B","ignoreList":[0,1,2]}

package/.next/server/chunks/[root-of-the-server]__0-68r22._.js

@@ -0,0 +1,3 @@
+module.exports=[18622,(e,t,n)=>{t.exports=e.x("next/dist/compiled/next-server/app-page-turbo.runtime.prod.js",()=>require("next/dist/compiled/next-server/app-page-turbo.runtime.prod.js"))},56704,(e,t,n)=>{t.exports=e.x("next/dist/server/app-render/work-async-storage.external.js",()=>require("next/dist/server/app-render/work-async-storage.external.js"))},32319,(e,t,n)=>{t.exports=e.x("next/dist/server/app-render/work-unit-async-storage.external.js",()=>require("next/dist/server/app-render/work-unit-async-storage.external.js"))},70406,(e,t,n)=>{t.exports=e.x("next/dist/compiled/@opentelemetry/api",()=>require("next/dist/compiled/@opentelemetry/api"))},93695,(e,t,n)=>{t.exports=e.x("next/dist/shared/lib/no-fallback-error.external.js",()=>require("next/dist/shared/lib/no-fallback-error.external.js"))},60338,e=>{"use strict";var t=e.i(56325),n=e.i(44988),r=e.i(18899);e.s(["avg",0,function(e){return r.sql`avg(${e})`.mapWith(String)},"avgDistinct",0,function(e){return r.sql`avg(distinct ${e})`.mapWith(String)},"count",0,function(e){return r.sql`count(${e||r.sql.raw("*")})`.mapWith(Number)},"countDistinct",0,function(e){return r.sql`count(distinct ${e})`.mapWith(Number)},"max",0,function(e){return r.sql`max(${e})`.mapWith((0,n.is)(e,t.Column)?e:String)},"min",0,function(e){return r.sql`min(${e})`.mapWith((0,n.is)(e,t.Column)?e:String)},"sum",0,function(e){return r.sql`sum(${e})`.mapWith(String)},"sumDistinct",0,function(e){return r.sql`sum(distinct ${e})`.mapWith(String)}])},3723,e=>e.a(async(t,n)=>{try{var r=e.i(75225),a=e.i(91426),i=e.i(34700),o=t([a]);function l(e){let t=Math.floor(e/12);return{x:-300-280*t,y:e%12*60}}async function s(e=a.db){let t=await e.query.endpoint.findMany({orderBy:(e,{asc:t,desc:n})=>[t(e.y),n(e.x),t(e.id)]});if(0===t.length)return 0;let n=0;for(let a=0;a<t.length;a++){let{x:o,y:s}=l(a),u=t[a];(u.x!==o||u.y!==s)&&(await e.update(i.endpoint).set({x:o,y:s}).where((0,r.eq)(i.endpoint.id,u.id)),n++)}return n}async function u(e=a.db){let[t,n]=await Promise.all([e.query.dbTable.findFirst({orderBy:(e,{desc:t})=>t(e.y)}),e.query.endpoint.findFirst({orderBy:(e,{desc:t})=>t(e.y)})]),r=Math.max(t?.y??0,n?.y??0);return r>0?r+280:0}[a]=o.then?(await o)():o,e.s(["computeDraftOriginY",0,u,"endpointsOverlap",0,function(e){for(let t=0;t<e.length;t++)for(let n=t+1;n<e.length;n++){let r=e[t],a=e[n];if(r.x<a.x+240&&r.x+240>a.x&&r.y<a.y+50&&r.y+50>a.y)return!0}return!1},"gridPositionForEndpoint",0,l,"relayoutEndpoints",0,s]),n()}catch(e){n(e)}},!1),46409,e=>e.a(async(t,n)=>{try{var r=e.i(75225),a=e.i(91426),i=e.i(34700),o=t([a]);async function l(e=a.db){let[t,n]=await Promise.all([e.query.endpoint.findMany({where:(e,{ne:t})=>t(e.source,"INTROSPECTION")}),e.query.endpoint.findMany({where:(e,{eq:t})=>t(e.source,"INTROSPECTION")})]),o={collapsed:0,mappings:[]};for(let a of t){let t=n.find(e=>(function(e,t){if(e.method.toUpperCase()!==t.method.toUpperCase())return!1;let n=e.path.replace(/\{[^}]*\}/g,"{}"),r=t.path.replace(/\{[^}]*\}/g,"{}");return r===n||r.endsWith(n)})(a,e));t&&(await e.delete(i.endpoint).where((0,r.eq)(i.endpoint.id,a.id)),o.collapsed++,o.mappings.push({planned:`${a.method} ${a.path}`,code:`${t.method} ${t.path}`}))}return o}[a]=o.then?(await o)():o,e.s(["reconcilePlannedEndpoints",0,l]),n()}catch(e){n(e)}},!1),96902,e=>e.a(async(t,n)=>{try{var r=e.i(75225),a=e.i(91426),i=e.i(34700),o=t([a]);function l(e){return 36+30*Math.max(0,e)+16}function s(e,t=[]){let n=[,,,,].fill(0);for(let e of t){let t=Math.max(0,Math.min(3,Math.round(e.x/320))),r=e.y+l(e.columnCount)+50;r>n[t]&&(n[t]=r)}let r=new Map;for(let t of e){let e=0;for(let t=1;t<4;t++)n[t]<n[e]&&(e=t);let a=320*e,i=n[e];r.set(t.key,{x:a,y:i}),n[e]=i+l(t.columnCount)+50}return r}async function u(e=a.db){let t=await e.query.dbTable.findMany({where:(e,{eq:t})=>t(e.source,"INTROSPECTION"),with:{columns:{columns:{id:!0}}},orderBy:(e,{asc:t})=>t(e.name)});if(0===t.length)return 0;let n=s(t.map(e=>({key:e.id,columnCount:e.columns.length}))),o=0;for(let a of t){let t=n.get(a.id);t&&(Math.round(t.x)!==Math.round(a.x)||Math.round(t.y)!==Math.round(a.y))&&(await e.update(i.dbTable).set({x:t.x,y:t.y}).where((0,r.eq)(i.dbTable.id,a.id)),o++)}return o}[a]=o.then?(await o)():o,e.s(["estimateTableHeight",0,l,"packTablesMasonry",0,s,"relayoutTables",0,u,"tablesOverlap",0,function(e){for(let t=0;t<e.length;t++)for(let n=t+1;n<e.length;n++){let r=e[t],a=e[n],i=l(r.columnCount),o=l(a.columnCount);if(r.x<a.x+300&&r.x+300>a.x&&r.y<a.y+o&&r.y+i>a.y)return!0}return!1}]),n()}catch(e){n(e)}},!1),6659,e=>e.a(async(t,n)=>{try{var r=e.i(69719),a=e.i(75225),i=e.i(60338),o=e.i(18899),l=e.i(91426),s=e.i(34700),u=e.i(3723),d=e.i(46409),c=e.i(96902),m=t([l,u,d,c]);[l,u,d,c]=m.then?(await m)():m;let h=r.z.object({tables:r.z.array(r.z.object({name:r.z.string().trim().min(1),domain:r.z.string().nullish(),description:r.z.string().nullish(),columns:r.z.array(r.z.object({name:r.z.string().trim().min(1),type:r.z.string().trim().min(1),isPk:r.z.boolean().optional(),isFk:r.z.boolean().optional(),nullable:r.z.boolean().optional(),note:r.z.string().nullish()})).default([])})).default([]),relations:r.z.array(r.z.object({fromTable:r.z.string(),fromColumn:r.z.string(),toTable:r.z.string(),toColumn:r.z.string(),label:r.z.string().nullish()})).default([]),endpoints:r.z.array(r.z.object({method:r.z.string().trim().min(1),path:r.z.string().trim().min(1),domain:r.z.string().nullish(),description:r.z.string().nullish(),uses:r.z.array(r.z.object({table:r.z.string(),access:r.z.string().default("read")})).default([])})).default([])});async function p(e=l.db){let t=await e.query.syncState.findFirst({where:(e,{eq:t})=>t(e.id,"singleton")});return t?.version??0}async function y(e=l.db){let[t]=await e.insert(s.syncState).values({id:"singleton",version:1}).onConflictDoUpdate({target:s.syncState.id,set:{version:o.sql`${s.syncState.version} + 1`}}).returning();return t.version}async function f(e,t=l.db){let n=h.parse(e),r=n.tables.map(e=>e.name);await t.delete(s.dbTable).where(r.length?(0,a.and)((0,a.eq)(s.dbTable.source,"INTROSPECTION"),(0,a.notInArray)(s.dbTable.name,r)):(0,a.eq)(s.dbTable.source,"INTROSPECTION"));let o=await t.query.dbTable.findMany({columns:{name:!0,x:!0,y:!0},with:{columns:{columns:{id:!0}}}}),m=new Map(o.map(e=>[e.name,e])),p=(0,c.packTablesMasonry)(n.tables.filter(e=>!m.has(e.name)).map(e=>({key:e.name,columnCount:e.columns.length})),o.map(e=>({x:e.x,y:e.y,columnCount:e.columns.length}))),b=new Map;for(let e of n.tables){let n=m.get(e.name),r=p.get(e.name),i=n?.x??r?.x??0,o=n?.y??r?.y??0,[l]=await t.insert(s.dbTable).values({name:e.name,domain:e.domain??null,description:e.description??null,source:"INTROSPECTION",x:i,y:o}).onConflictDoUpdate({target:s.dbTable.name,set:{domain:e.domain??null,description:e.description??null,source:"INTROSPECTION"}}).returning();b.set(e.name,l.id),await t.delete(s.dbColumn).where((0,a.eq)(s.dbColumn.tableId,l.id)),e.columns.length&&await t.insert(s.dbColumn).values(e.columns.map((e,t)=>({tableId:l.id,name:e.name,type:e.type,isPk:e.isPk??!1,isFk:e.isFk??!1,nullable:e.nullable??!0,note:e.note??null,ord:t})))}let g=[...b.values()];for(let e of(g.length&&await t.delete(s.dbRelation).where((0,a.or)((0,a.inArray)(s.dbRelation.fromTableId,g),(0,a.inArray)(s.dbRelation.toTableId,g))),n.relations)){let n=b.get(e.fromTable),r=b.get(e.toTable);n&&r&&await t.insert(s.dbRelation).values({fromTableId:n,toTableId:r,fromColumn:e.fromColumn,toColumn:e.toColumn,label:e.label??`${e.fromColumn} → ${e.toTable}.${e.toColumn}`})}let w=new Set(n.endpoints.map(e=>`${e.method} ${e.path}`)),x=(await t.query.endpoint.findMany({where:(e,{eq:t})=>t(e.source,"INTROSPECTION")})).filter(e=>!w.has(`${e.method} ${e.path}`)).map(e=>e.id);x.length&&await t.delete(s.endpoint).where((0,a.inArray)(s.endpoint.id,x));let T=(await t.select({n:(0,i.count)()}).from(s.endpoint))[0].n;for(let e of n.endpoints){let n,r,i=await t.query.endpoint.findFirst({where:(t,{and:n,eq:r})=>n(r(t.method,e.method),r(t.path,e.path))});if(i)n=i.x,r=i.y;else{let e=(0,u.gridPositionForEndpoint)(T);n=e.x,r=e.y,T++}let[o]=await t.insert(s.endpoint).values({method:e.method,path:e.path,domain:e.domain??null,description:e.description??null,source:"INTROSPECTION",x:n,y:r}).onConflictDoUpdate({target:[s.endpoint.method,s.endpoint.path],set:{domain:e.domain??null,description:e.description??null,source:"INTROSPECTION"}}).returning();for(let n of(await t.delete(s.endpointTable).where((0,a.eq)(s.endpointTable.endpointId,o.id)),e.uses)){let e=b.get(n.table)??(await t.query.dbTable.findFirst({where:(e,{eq:t})=>t(e.name,n.table)}))?.id;e&&await t.insert(s.endpointTable).values({endpointId:o.id,tableId:e,access:n.access})}}await (0,d.reconcilePlannedEndpoints)(t);let q=await t.query.dbTable.findMany({where:(e,{eq:t})=>t(e.source,"INTROSPECTION"),columns:{x:!0,y:!0},with:{columns:{columns:{id:!0}}}});(0,c.tablesOverlap)(q.map(e=>({x:e.x,y:e.y,columnCount:e.columns.length})))&&await (0,c.relayoutTables)(t);let C=await t.select({x:s.endpoint.x,y:s.endpoint.y}).from(s.endpoint);(0,u.endpointsOverlap)(C)&&await (0,u.relayoutEndpoints)(t);let v=await y(t);return{tables:n.tables.length,relations:n.relations.length,endpoints:n.endpoints.length,version:v}}e.s(["bumpVersion",0,y,"getVersion",0,p,"ingestSnapshot",0,f,"snapshotSchema",0,h]),n()}catch(e){n(e)}},!1),58708,e=>{"use strict";let t=null;async function n(){return t||(t=(async()=>{let{pipeline:t}=await e.A(46128);return await t("feature-extraction","Xenova/all-MiniLM-L6-v2")})().catch(e=>{throw t=null,e})),t}async function r(e){let t=e.trim();if(!t)return null;try{let e=await n(),r=await e(t,{pooling:"mean",normalize:!0});return Array.from(r.data)}catch(e){return console.error("[embeddings] failed:",e instanceof Error?e.message:e),null}}function a(e){return[e.title,e.role,e.plain,e.cluster].filter(Boolean).join(". ")}function i(e){return JSON.stringify(e)}async function o(t){try{let{db:n}=await e.A(35914),{node:o}=await e.A(29363),{eq:l}=await e.A(96359),s=await n.query.node.findFirst({where:(e,{eq:n})=>n(e.id,t),columns:{title:!0,role:!0,plain:!0,cluster:!0}});if(!s)return;let u=await r(a(s));if(!u)return;await n.update(o).set({embedding:i(u)}).where(l(o.id,t))}catch(e){console.error("[embeddings] reembed failed:",t,e instanceof Error?e.message:e)}}async function l(e,t){let n=await r(e);if(!n)return null;let a=[];for(let e of t){let t=function(e){if(!e)return null;try{let t=JSON.parse(e);if(!Array.isArray(t)||t.some(e=>"number"!=typeof e||!Number.isFinite(e)))return null;return t}catch{return null}}(e.embedding);t&&a.push({item:e,score:function(e,t){if(e.length!==t.length)return 0;let n=0,r=0,a=0;for(let i=0;i<e.length;i++)n+=e[i]*t[i],r+=e[i]*e[i],a+=t[i]*t[i];return 0===r||0===a?0:n/(Math.sqrt(r)*Math.sqrt(a))}(n,t)})}return a.sort((e,t)=>t.score-e.score),a}e.s(["embedText",0,r,"encodeVector",0,i,"nodeEmbeddingInput",0,a,"rankByQuery",0,l,"reembedNode",0,o])}];
+
+//# sourceMappingURL=%5Broot-of-the-server%5D__0-68r22._.js.map

package/.next/server/chunks/[root-of-the-server]__0-68r22._.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../node_modules/src/sql/functions/aggregate.ts","../../../lib/endpoint-layout.ts","../../../lib/endpoint-reconcile.ts","../../../lib/table-layout.ts","../../../lib/ingest.ts","../../../lib/embeddings.ts"],"sourcesContent":["import { type AnyColumn, Column } from '~/column.ts';\nimport { is } from '~/entity.ts';\nimport { type SQL, sql, type SQLWrapper } from '../sql.ts';\n\n/**\n * Returns the number of values in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // Number employees with null values\n * db.select({ value: count() }).from(employees)\n * // Number of employees where `name` is not null\n * db.select({ value: count(employees.name) }).from(employees)\n * ```\n *\n * @see countDistinct to get the number of non-duplicate values in `expression`\n */\nexport function count(expression?: SQLWrapper): SQL<number> {\n\treturn sql`count(${expression || sql.raw('*')})`.mapWith(Number);\n}\n\n/**\n * Returns the number of non-duplicate values in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // Number of employees where `name` is distinct\n * db.select({ value: countDistinct(employees.name) }).from(employees)\n * ```\n *\n * @see count to get the number of values in `expression`, including duplicates\n */\nexport function countDistinct(expression: SQLWrapper): SQL<number> {\n\treturn sql`count(distinct ${expression})`.mapWith(Number);\n}\n\n/**\n * Returns the average (arithmetic mean) of all non-null values in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // Average salary of an employee\n * db.select({ value: avg(employees.salary) }).from(employees)\n * ```\n *\n * @see avgDistinct to get the average of all non-null and non-duplicate values in `expression`\n */\nexport function avg(expression: SQLWrapper): SQL<string | null> {\n\treturn sql`avg(${expression})`.mapWith(String);\n}\n\n/**\n * Returns the average (arithmetic mean) of all non-null and non-duplicate values in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // Average salary of an employee where `salary` is distinct\n * db.select({ value: avgDistinct(employees.salary) }).from(employees)\n * ```\n *\n * @see avg to get the average of all non-null values in `expression`, including duplicates\n */\nexport function avgDistinct(expression: SQLWrapper): SQL<string | null> {\n\treturn sql`avg(distinct ${expression})`.mapWith(String);\n}\n\n/**\n * Returns the sum of all non-null values in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // Sum of every employee's salary\n * db.select({ value: sum(employees.salary) }).from(employees)\n * ```\n *\n * @see sumDistinct to get the sum of all non-null and non-duplicate values in `expression`\n */\nexport function sum(expression: SQLWrapper): SQL<string | null> {\n\treturn sql`sum(${expression})`.mapWith(String);\n}\n\n/**\n * Returns the sum of all non-null and non-duplicate values in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // Sum of every employee's salary where `salary` is distinct (no duplicates)\n * db.select({ value: sumDistinct(employees.salary) }).from(employees)\n * ```\n *\n * @see sum to get the sum of all non-null values in `expression`, including duplicates\n */\nexport function sumDistinct(expression: SQLWrapper): SQL<string | null> {\n\treturn sql`sum(distinct ${expression})`.mapWith(String);\n}\n\n/**\n * Returns the maximum value in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // The employee with the highest salary\n * db.select({ value: max(employees.salary) }).from(employees)\n * ```\n */\nexport function max<T extends SQLWrapper>(expression: T): SQL<(T extends AnyColumn ? T['_']['data'] : string) | null> {\n\treturn sql`max(${expression})`.mapWith(is(expression, Column) ? expression : String) as any;\n}\n\n/**\n * Returns the minimum value in `expression`.\n *\n * ## Examples\n *\n * ```ts\n * // The employee with the lowest salary\n * db.select({ value: min(employees.salary) }).from(employees)\n * ```\n */\nexport function min<T extends SQLWrapper>(expression: T): SQL<(T extends AnyColumn ? T['_']['data'] : string) | null> {\n\treturn sql`min(${expression})`.mapWith(is(expression, Column) ? expression : String) as any;\n}\n","import { count, eq } from \"drizzle-orm\";\nimport { db, type DB } from \"@/lib/db-drizzle\";\nimport { endpoint } from \"@/lib/drizzle/schema\";\n\n// Endpoints are uniform 240px-wide pill cards on /db, kept to the left of the table\n// gutter (negative x). The previous layout stacked every endpoint in one column at\n// y = i * 110, so a real backend like Beacon ended up with a 4000px-tall stack the\n// user had to scroll past. We now wrap into a multi-column grid that grows leftward,\n// so the canvas reads as a compact block instead of a fence.\n\nconst EP_ROW_HEIGHT = 60;\nconst EP_COL_WIDTH = 280;\nconst EP_BASE_X = -300; // closest column to the tables on the right\nconst EP_ROWS_PER_COL = 12;\nconst EP_CARD_WIDTH = 240;\nconst EP_CARD_HEIGHT = 50;\n\n/**\n * Bounding-box overlap check ingest uses to decide whether to self-heal the column.\n * Endpoint cards are uniform 240px wide × ~40px tall pills — anything overlapping\n * means an old single-column ingest left a stack behind, or two ingest runs collided.\n */\nexport function endpointsOverlap(\n  eps: ReadonlyArray<{ x: number; y: number }>,\n): boolean {\n  for (let i = 0; i < eps.length; i++) {\n    for (let j = i + 1; j < eps.length; j++) {\n      const a = eps[i];\n      const b = eps[j];\n      if (\n        a.x < b.x + EP_CARD_WIDTH &&\n        a.x + EP_CARD_WIDTH > b.x &&\n        a.y < b.y + EP_CARD_HEIGHT &&\n        a.y + EP_CARD_HEIGHT > b.y\n      ) {\n        return true;\n      }\n    }\n  }\n  return false;\n}\n\nexport function gridPositionForEndpoint(index: number): { x: number; y: number } {\n  const col = Math.floor(index / EP_ROWS_PER_COL);\n  const row = index % EP_ROWS_PER_COL;\n  return { x: EP_BASE_X - col * EP_COL_WIDTH, y: row * EP_ROW_HEIGHT };\n}\n\n/**\n * One-off repair: re-pack every endpoint into a clean grid. Stable order — sorts by\n * current (y, x) so the user's visual ordering carries over across the change, then by\n * id as a tiebreaker.\n */\nexport async function relayoutEndpoints(prisma: DB = db): Promise<number> {\n  const eps = await prisma.query.endpoint.findMany({\n    orderBy: (t, { asc, desc }) => [asc(t.y), desc(t.x), asc(t.id)],\n  });\n  if (eps.length === 0) return 0;\n  let moved = 0;\n  for (let i = 0; i < eps.length; i++) {\n    const { x, y } = gridPositionForEndpoint(i);\n    const e = eps[i];\n    if (e.x === x && e.y === y) continue;\n    await prisma.update(endpoint).set({ x, y }).where(eq(endpoint.id, e.id));\n    moved++;\n  }\n  return moved;\n}\n\n/**\n * Where to drop the next NEW endpoint so it lands in the first unfilled grid slot.\n * Used by ingest to keep code-derived endpoints from re-stacking the old single column.\n */\nexport async function nextEndpointSlot(prisma: DB = db): Promise<{ x: number; y: number }> {\n  const [{ n }] = await prisma.select({ n: count() }).from(endpoint);\n  return gridPositionForEndpoint(n);\n}\n\n/**\n * Where to drop a freshly-proposed draft on the /db canvas so it doesn't land on top of\n * the existing tables/endpoints. Returns the largest y in use plus a margin, or 0 if the\n * canvas is empty.\n */\nconst DRAFT_MARGIN = 280;\nexport async function computeDraftOriginY(prisma: DB = db): Promise<number> {\n  const [topTbl, topEp] = await Promise.all([\n    prisma.query.dbTable.findFirst({ orderBy: (t, { desc }) => desc(t.y) }),\n    prisma.query.endpoint.findFirst({ orderBy: (t, { desc }) => desc(t.y) }),\n  ]);\n  const maxY = Math.max(topTbl?.y ?? 0, topEp?.y ?? 0);\n  return maxY > 0 ? maxY + DRAFT_MARGIN : 0;\n}\n","import { eq } from \"drizzle-orm\";\nimport { db, type DB } from \"@/lib/db-drizzle\";\nimport { endpoint } from \"@/lib/drizzle/schema\";\n\n// Plans and code rarely share a path prefix: a feature designed as `/orgs` ships at\n// `/api/v1/orgs`. We collapse a planned (MANUAL) endpoint into its code-derived\n// (INTROSPECTION) twin when the verbs match and the code path ends with the planned path\n// on a segment boundary, ignoring path-param names.\n\nconst normalize = (path: string) => path.replace(/\\{[^}]*\\}/g, \"{}\");\n\nexport function isImplementedBy(\n  planned: { method: string; path: string },\n  code: { method: string; path: string },\n): boolean {\n  if (planned.method.toUpperCase() !== code.method.toUpperCase()) return false;\n  const p = normalize(planned.path);\n  const c = normalize(code.path);\n  // planned paths start with \"/\", so endsWith() already lands on a segment boundary.\n  return c === p || c.endsWith(p);\n}\n\nexport interface ReconcileReport {\n  collapsed: number;\n  mappings: { planned: string; code: string }[];\n}\n\n/**\n * Deletes planned endpoints (anything not code-derived — drafts approved as MANUAL, init/\n * session scaffolds) once they have an INTROSPECTION twin, so the canvas shows reality\n * instead of duplicates. Unbuilt plans are left intact. Returns what was collapsed (also\n * surfaces the planned→code path discrepancy to the caller).\n */\nexport async function reconcilePlannedEndpoints(prisma: DB = db): Promise<ReconcileReport> {\n  const [planned, code] = await Promise.all([\n    prisma.query.endpoint.findMany({ where: (t, { ne }) => ne(t.source, \"INTROSPECTION\") }),\n    prisma.query.endpoint.findMany({ where: (t, { eq }) => eq(t.source, \"INTROSPECTION\") }),\n  ]);\n\n  const report: ReconcileReport = { collapsed: 0, mappings: [] };\n  for (const m of planned) {\n    const twin = code.find((c) => isImplementedBy(m, c));\n    if (!twin) continue;\n    await prisma.delete(endpoint).where(eq(endpoint.id, m.id));\n    report.collapsed++;\n    report.mappings.push({ planned: `${m.method} ${m.path}`, code: `${twin.method} ${twin.path}` });\n  }\n  return report;\n}\n","import { eq } from \"drizzle-orm\";\nimport { db, type DB } from \"@/lib/db-drizzle\";\nimport { dbTable } from \"@/lib/drizzle/schema\";\n\n// Layout constants for /db. Tables are 232px wide cards whose height is dominated by\n// their column count; the previous fixed grid (`y = floor(i/4) * 260`) silently stacked\n// tall tables on top of their neighbours. We pack into four columns masonry-style: each\n// column tracks its cumulative bottom and the next table goes into whichever column has\n// the most room. Same shape ingest seeds use, same shape `relayoutTables` uses to repair.\n\nexport const TABLE_COL_WIDTH = 320;\nexport const TABLE_COL_COUNT = 4;\nexport const TABLE_GAP_PX = 50;\nconst TABLE_HEADER_PX = 36;\nconst TABLE_ROW_PX = 30;\nconst TABLE_PADDING_PX = 16;\n\nexport function estimateTableHeight(columnCount: number): number {\n  return TABLE_HEADER_PX + Math.max(0, columnCount) * TABLE_ROW_PX + TABLE_PADDING_PX;\n}\n\nexport interface NewTable {\n  key: string;\n  columnCount: number;\n}\nexport interface PlacedTable {\n  x: number;\n  y: number;\n  columnCount: number;\n}\n\n/**\n * Assigns (x, y) to each `newTables` entry using a masonry pack across `TABLE_COL_COUNT`\n * columns, treating `existing` as already-occupied slots so we never land on top of a\n * persisted table. Returns a Map keyed by the entry's `key` (id or name — caller's choice).\n */\nexport function packTablesMasonry(\n  newTables: NewTable[],\n  existing: PlacedTable[] = [],\n): Map<string, { x: number; y: number }> {\n  const bottoms = new Array<number>(TABLE_COL_COUNT).fill(0);\n  for (const e of existing) {\n    const col = Math.max(\n      0,\n      Math.min(TABLE_COL_COUNT - 1, Math.round(e.x / TABLE_COL_WIDTH)),\n    );\n    const bottom = e.y + estimateTableHeight(e.columnCount) + TABLE_GAP_PX;\n    if (bottom > bottoms[col]) bottoms[col] = bottom;\n  }\n  const out = new Map<string, { x: number; y: number }>();\n  for (const t of newTables) {\n    let col = 0;\n    for (let i = 1; i < TABLE_COL_COUNT; i++) if (bottoms[i] < bottoms[col]) col = i;\n    const x = col * TABLE_COL_WIDTH;\n    const y = bottoms[col];\n    out.set(t.key, { x, y });\n    bottoms[col] = y + estimateTableHeight(t.columnCount) + TABLE_GAP_PX;\n  }\n  return out;\n}\n\n/**\n * Bounding-box overlap check used by ingest to decide whether to self-heal the layout.\n * Card width is `TABLE_COL_WIDTH - 20` (the visible card sits inside its column slot).\n */\nexport function tablesOverlap(\n  placed: ReadonlyArray<{ x: number; y: number; columnCount: number }>,\n): boolean {\n  const w = TABLE_COL_WIDTH - 20;\n  for (let i = 0; i < placed.length; i++) {\n    for (let j = i + 1; j < placed.length; j++) {\n      const a = placed[i];\n      const b = placed[j];\n      const ah = estimateTableHeight(a.columnCount);\n      const bh = estimateTableHeight(b.columnCount);\n      if (a.x < b.x + w && a.x + w > b.x && a.y < b.y + bh && a.y + ah > b.y) {\n        return true;\n      }\n    }\n  }\n  return false;\n}\n\n/**\n * Self-heal for the /db canvas: re-packs all INTROSPECTION tables into a masonry\n * layout sized to each table's actual column count. Called automatically by ingest\n * when the post-upsert positions still overlap (a stale layout from before the\n * masonry formula, or a hand-placement that drifted into a neighbour). Manual\n * (non-introspection) tables keep their positions — they're drafts the user is\n * composing or hand-placed. Ordering by name keeps the result stable across re-syncs.\n */\nexport async function relayoutTables(prisma: DB = db): Promise<number> {\n  const tables = await prisma.query.dbTable.findMany({\n    where: (t, { eq }) => eq(t.source, \"INTROSPECTION\"),\n    with: { columns: { columns: { id: true } } },\n    orderBy: (t, { asc }) => asc(t.name),\n  });\n  if (tables.length === 0) return 0;\n  const positions = packTablesMasonry(\n    tables.map((t) => ({ key: t.id, columnCount: t.columns.length })),\n  );\n  let moved = 0;\n  for (const t of tables) {\n    const p = positions.get(t.id);\n    if (!p) continue;\n    if (Math.round(p.x) === Math.round(t.x) && Math.round(p.y) === Math.round(t.y)) continue;\n    await prisma.update(dbTable).set({ x: p.x, y: p.y }).where(eq(dbTable.id, t.id));\n    moved++;\n  }\n  return moved;\n}\n","import { z } from \"zod\";\nimport { and, count, eq, inArray, notInArray, or, sql } from \"drizzle-orm\";\nimport { db, type DB } from \"@/lib/db-drizzle\";\nimport { dbTable, dbColumn, dbRelation, endpoint, endpointTable, syncState } from \"@/lib/drizzle/schema\";\nimport {\n  endpointsOverlap,\n  gridPositionForEndpoint,\n  relayoutEndpoints,\n} from \"@/lib/endpoint-layout\";\nimport { reconcilePlannedEndpoints } from \"@/lib/endpoint-reconcile\";\nimport { packTablesMasonry, relayoutTables, tablesOverlap } from \"@/lib/table-layout\";\n\n// ── Snapshot contract (what the intel daemon POSTs) ─────────────────────────\n\nexport const snapshotSchema = z.object({\n  tables: z\n    .array(\n      z.object({\n        name: z.string().trim().min(1),\n        domain: z.string().nullish(),\n        description: z.string().nullish(),\n        columns: z\n          .array(\n            z.object({\n              name: z.string().trim().min(1),\n              type: z.string().trim().min(1),\n              isPk: z.boolean().optional(),\n              isFk: z.boolean().optional(),\n              nullable: z.boolean().optional(),\n              note: z.string().nullish(),\n            }),\n          )\n          .default([]),\n      }),\n    )\n    .default([]),\n  relations: z\n    .array(\n      z.object({\n        fromTable: z.string(),\n        fromColumn: z.string(),\n        toTable: z.string(),\n        toColumn: z.string(),\n        label: z.string().nullish(),\n      }),\n    )\n    .default([]),\n  endpoints: z\n    .array(\n      z.object({\n        method: z.string().trim().min(1),\n        path: z.string().trim().min(1),\n        domain: z.string().nullish(),\n        description: z.string().nullish(),\n        uses: z\n          .array(\n            z.object({\n              table: z.string(),\n              access: z.string().default(\"read\"),\n            }),\n          )\n          .default([]),\n      }),\n    )\n    .default([]),\n});\nexport type Snapshot = z.input<typeof snapshotSchema>;\n\ntype Prisma = DB;\n\nexport async function getVersion(prisma: Prisma = db): Promise<number> {\n  const s = await prisma.query.syncState.findFirst({ where: (t, { eq }) => eq(t.id, \"singleton\") });\n  return s?.version ?? 0;\n}\n\nexport async function bumpVersion(prisma: Prisma = db): Promise<number> {\n  const [s] = await prisma\n    .insert(syncState)\n    .values({ id: \"singleton\", version: 1 })\n    .onConflictDoUpdate({\n      target: syncState.id,\n      set: { version: sql`${syncState.version} + 1` },\n    })\n    .returning();\n  return s.version;\n}\n\n/**\n * Upserts a code-derived snapshot. Full-replace of `source=INTROSPECTION`\n * entities: upsert by stable key (name / method+path) preserving manual x/y,\n * delete introspected entities absent from the snapshot. Manual entities and\n * the roadmap are never touched. Bumps the sync version.\n */\nexport async function ingestSnapshot(input: unknown, prisma: Prisma = db) {\n  const snap = snapshotSchema.parse(input);\n\n  // tables ----------------------------------------------------------------\n  const keepTables = snap.tables.map((t) => t.name);\n  await prisma\n    .delete(dbTable)\n    .where(\n      keepTables.length\n        ? and(eq(dbTable.source, \"INTROSPECTION\"), notInArray(dbTable.name, keepTables))\n        : eq(dbTable.source, \"INTROSPECTION\"),\n    );\n\n  // Position NEW tables with a masonry pack sized to each table's column count, anchored\n  // against whatever tables are already on the canvas. The old `(i%4)*320, floor(i/4)*260`\n  // grid silently stacked tall tables (Node, DbColumn) on top of their neighbours.\n  const allExisting = await prisma.query.dbTable.findMany({\n    columns: { name: true, x: true, y: true },\n    with: { columns: { columns: { id: true } } },\n  });\n  const existingByName = new Map(allExisting.map((t) => [t.name, t]));\n  const newTablePositions = packTablesMasonry(\n    snap.tables\n      .filter((t) => !existingByName.has(t.name))\n      .map((t) => ({ key: t.name, columnCount: t.columns.length })),\n    allExisting.map((t) => ({ x: t.x, y: t.y, columnCount: t.columns.length })),\n  );\n\n  const tableIdByName = new Map<string, string>();\n  for (const t of snap.tables) {\n    const existing = existingByName.get(t.name);\n    const pos = newTablePositions.get(t.name);\n    const x = existing?.x ?? pos?.x ?? 0;\n    const y = existing?.y ?? pos?.y ?? 0;\n    const [saved] = await prisma\n      .insert(dbTable)\n      .values({\n        name: t.name,\n        domain: t.domain ?? null,\n        description: t.description ?? null,\n        source: \"INTROSPECTION\",\n        x,\n        y,\n      })\n      .onConflictDoUpdate({\n        target: dbTable.name,\n        set: {\n          domain: t.domain ?? null,\n          description: t.description ?? null,\n          source: \"INTROSPECTION\",\n        },\n      })\n      .returning();\n    tableIdByName.set(t.name, saved.id);\n    await prisma.delete(dbColumn).where(eq(dbColumn.tableId, saved.id));\n    if (t.columns.length) {\n      await prisma.insert(dbColumn).values(\n        t.columns.map((c, i) => ({\n          tableId: saved.id,\n          name: c.name,\n          type: c.type,\n          isPk: c.isPk ?? false,\n          isFk: c.isFk ?? false,\n          nullable: c.nullable ?? true,\n          note: c.note ?? null,\n          ord: i,\n        })),\n      );\n    }\n  }\n\n  // relations (rebuild those touching an introspected table) ---------------\n  const introTableIds = [...tableIdByName.values()];\n  if (introTableIds.length) {\n    await prisma\n      .delete(dbRelation)\n      .where(\n        or(\n          inArray(dbRelation.fromTableId, introTableIds),\n          inArray(dbRelation.toTableId, introTableIds),\n        ),\n      );\n  }\n  for (const r of snap.relations) {\n    const fromId = tableIdByName.get(r.fromTable);\n    const toId = tableIdByName.get(r.toTable);\n    if (!fromId || !toId) continue;\n    await prisma.insert(dbRelation).values({\n      fromTableId: fromId,\n      toTableId: toId,\n      fromColumn: r.fromColumn,\n      toColumn: r.toColumn,\n      label: r.label ?? `${r.fromColumn} → ${r.toTable}.${r.toColumn}`,\n    });\n  }\n\n  // endpoints --------------------------------------------------------------\n  const keepEp = new Set(snap.endpoints.map((e) => `${e.method} ${e.path}`));\n  const introEps = await prisma.query.endpoint.findMany({\n    where: (t, { eq }) => eq(t.source, \"INTROSPECTION\"),\n  });\n  const stale = introEps.filter((e) => !keepEp.has(`${e.method} ${e.path}`)).map((e) => e.id);\n  if (stale.length) await prisma.delete(endpoint).where(inArray(endpoint.id, stale));\n\n  // For NEW endpoints we drop into the next free slot of the multi-column grid (the\n  // single-column stack made a real backend's endpoints into a 4000px-tall fence).\n  let nextSlotIndex = (await prisma.select({ n: count() }).from(endpoint))[0].n;\n  for (const e of snap.endpoints) {\n    const existing = await prisma.query.endpoint.findFirst({\n      where: (t, { and, eq }) => and(eq(t.method, e.method), eq(t.path, e.path)),\n    });\n    let x: number, y: number;\n    if (existing) {\n      x = existing.x;\n      y = existing.y;\n    } else {\n      const slot = gridPositionForEndpoint(nextSlotIndex);\n      x = slot.x;\n      y = slot.y;\n      nextSlotIndex++;\n    }\n    const [saved] = await prisma\n      .insert(endpoint)\n      .values({\n        method: e.method,\n        path: e.path,\n        domain: e.domain ?? null,\n        description: e.description ?? null,\n        source: \"INTROSPECTION\",\n        x,\n        y,\n      })\n      .onConflictDoUpdate({\n        target: [endpoint.method, endpoint.path],\n        set: {\n          domain: e.domain ?? null,\n          description: e.description ?? null,\n          source: \"INTROSPECTION\",\n        },\n      })\n      .returning();\n    await prisma.delete(endpointTable).where(eq(endpointTable.endpointId, saved.id));\n    for (const u of e.uses) {\n      const tid =\n        tableIdByName.get(u.table) ??\n        (\n          await prisma.query.dbTable.findFirst({ where: (t, { eq }) => eq(t.name, u.table) })\n        )?.id;\n      if (!tid) continue;\n      await prisma.insert(endpointTable).values({\n        endpointId: saved.id,\n        tableId: tid,\n        access: u.access,\n      });\n    }\n  }\n\n  // Collapse planned endpoints that this scan just proved are implemented in code.\n  await reconcilePlannedEndpoints(prisma);\n\n  // Self-heal layout: if any pair of tables or endpoints overlaps after the upserts\n  // (a stale layout from before the masonry/grid formulas, or a hand-placement that\n  // drifted into a neighbour), repack them. Drag-and-drop positions that don't\n  // collide are preserved — the heal only fires when the canvas is actually broken.\n  const placedTables = await prisma.query.dbTable.findMany({\n    where: (t, { eq }) => eq(t.source, \"INTROSPECTION\"),\n    columns: { x: true, y: true },\n    with: { columns: { columns: { id: true } } },\n  });\n  if (\n    tablesOverlap(\n      placedTables.map((t) => ({ x: t.x, y: t.y, columnCount: t.columns.length })),\n    )\n  ) {\n    await relayoutTables(prisma);\n  }\n  const placedEps = await prisma.select({ x: endpoint.x, y: endpoint.y }).from(endpoint);\n  if (endpointsOverlap(placedEps)) await relayoutEndpoints(prisma);\n\n  const version = await bumpVersion(prisma);\n  return {\n    tables: snap.tables.length,\n    relations: snap.relations.length,\n    endpoints: snap.endpoints.length,\n    version,\n  };\n}\n","// Local semantic-search embedder. Loads Xenova/all-MiniLM-L6-v2 in-process\n// (~22MB cached on first use, ~50-100ms per text after that). Stays local so\n// the Beacon panel has no API-key dependency and no per-query network hop.\n// Vectors live in `Node.embedding` as JSON strings; cosine is computed in JS\n// at query time — at hundreds of nodes per workspace, sqlite-vec is overkill.\n\ntype FeatureExtractionPipeline = (\n  text: string | string[],\n  opts?: { pooling?: \"mean\" | \"cls\"; normalize?: boolean },\n) => Promise<{ data: Float32Array | number[] }>;\n\nlet pipelinePromise: Promise<FeatureExtractionPipeline> | null = null;\n\nasync function getEmbedder(): Promise<FeatureExtractionPipeline> {\n  if (!pipelinePromise) {\n    pipelinePromise = (async () => {\n      const { pipeline } = await import(\"@huggingface/transformers\");\n      // 384-dim sentence embeddings. The \"feature-extraction\" task with\n      // mean-pooled + normalized output is the canonical sentence-encoder shape.\n      return (await pipeline(\n        \"feature-extraction\",\n        \"Xenova/all-MiniLM-L6-v2\",\n      )) as unknown as FeatureExtractionPipeline;\n    })().catch((e) => {\n      pipelinePromise = null; // let the next call retry on transient failure\n      throw e;\n    });\n  }\n  return pipelinePromise;\n}\n\n/** Compute a 384-dim sentence embedding. Returns null on failure (caller falls back to lexical). */\nexport async function embedText(text: string): Promise<number[] | null> {\n  const trimmed = text.trim();\n  if (!trimmed) return null;\n  try {\n    const embedder = await getEmbedder();\n    const out = await embedder(trimmed, { pooling: \"mean\", normalize: true });\n    return Array.from(out.data);\n  } catch (e) {\n    console.error(\"[embeddings] failed:\", e instanceof Error ? e.message : e);\n    return null;\n  }\n}\n\n/** Build the embedding input text from a node's queryable fields. */\nexport function nodeEmbeddingInput(node: {\n  title: string;\n  role?: string | null;\n  plain?: string | null;\n  cluster?: string | null;\n}): string {\n  return [node.title, node.role, node.plain, node.cluster].filter(Boolean).join(\". \");\n}\n\n/** Cosine similarity, defensive against zero vectors and dimension mismatch. */\nexport function cosineSimilarity(a: number[], b: number[]): number {\n  if (a.length !== b.length) return 0;\n  let dot = 0;\n  let normA = 0;\n  let normB = 0;\n  for (let i = 0; i < a.length; i++) {\n    dot += a[i] * b[i];\n    normA += a[i] * a[i];\n    normB += b[i] * b[i];\n  }\n  if (normA === 0 || normB === 0) return 0;\n  return dot / (Math.sqrt(normA) * Math.sqrt(normB));\n}\n\nexport function encodeVector(v: number[]): string {\n  return JSON.stringify(v);\n}\n\nexport function decodeVector(raw: string | null | undefined): number[] | null {\n  if (!raw) return null;\n  try {\n    const parsed = JSON.parse(raw);\n    if (!Array.isArray(parsed)) return null;\n    if (parsed.some((x) => typeof x !== \"number\" || !Number.isFinite(x))) return null;\n    return parsed as number[];\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Re-embed a Node from its current title/plain/role/cluster. Idempotent; swallows\n * errors so a failed embed never breaks the write that triggered it.\n */\nexport async function reembedNode(id: string): Promise<void> {\n  try {\n    const { db } = await import(\"@/lib/db\");\n    const { node } = await import(\"@/lib/drizzle/schema\");\n    const { eq } = await import(\"drizzle-orm\");\n    const row = await db.query.node.findFirst({\n      where: (t, { eq: eqf }) => eqf(t.id, id),\n      columns: { title: true, role: true, plain: true, cluster: true },\n    });\n    if (!row) return;\n    const vec = await embedText(nodeEmbeddingInput(row));\n    if (!vec) return;\n    await db.update(node).set({ embedding: encodeVector(vec) }).where(eq(node.id, id));\n  } catch (e) {\n    console.error(\"[embeddings] reembed failed:\", id, e instanceof Error ? e.message : e);\n  }\n}\n\n/** Rank candidates by cosine. Returns null when the query embedding fails. */\nexport async function rankByQuery<T extends { embedding: string | null }>(\n  query: string,\n  candidates: T[],\n): Promise<Array<{ item: T; score: number }> | null> {\n  const queryVec = await embedText(query);\n  if (!queryVec) return null;\n  const scored: Array<{ item: T; score: number }> = [];\n  for (const item of candidates) {\n    const v = decodeVector(item.embedding);\n    if (!v) continue;\n    scored.push({ item, score: cosineSimilarity(queryVec, v) });\n  }\n  scored.sort((a, b) => b.score - a.score);\n  return scored;\n}\n"],"names":["EP_ROW_HEIGHT","EP_COL_WIDTH","EP_BASE_X","EP_ROWS_PER_COL","EP_CARD_WIDTH","EP_CARD_HEIGHT","endpointsOverlap","eps","i","length","j","a","b","x","y","gridPositionForEndpoint","index","col","Math","floor","row","relayoutEndpoints","prisma","query","endpoint","findMany","orderBy","t","asc","desc","id","moved","e","update","set","where","nextEndpointSlot","n","select","from","DRAFT_MARGIN","computeDraftOriginY","topTbl","topEp","Promise","all","dbTable","findFirst","maxY","max","normalize","path","replace","isImplementedBy","planned","code","method","toUpperCase","p","c","endsWith","reconcilePlannedEndpoints","ne","source","eq","report","collapsed","mappings","m","twin","find","delete","push","TABLE_COL_WIDTH","TABLE_COL_COUNT","TABLE_GAP_PX","TABLE_HEADER_PX","TABLE_ROW_PX","TABLE_PADDING_PX","estimateTableHeight","columnCount","packTablesMasonry","newTables","existing","bottoms","Array","fill","min","round","bottom","out","Map","key","tablesOverlap","placed","w","ah","bh","relayoutTables","tables","with","columns","name","positions","map","get","snapshotSchema","object","array","string","trim","domain","nullish","description","type","isPk","boolean","optional","isFk","nullable","note","default","relations","fromTable","fromColumn","toTable","toColumn","label","endpoints","uses","table","access","getVersion","s","syncState","version","bumpVersion","insert","values","onConflictDoUpdate","target","returning","ingestSnapshot","input","snap","parse","keepTables","allExisting","existingByName","newTablePositions","filter","has","tableIdByName","pos","saved","tableId","ord","introTableIds","fromTableId","toTableId","r","fromId","toId","keepEp","Set","introEps","stale","nextSlotIndex","and","slot","endpointId","u","tid","placedTables","placedEps","pipelinePromise","getEmbedder","pipeline","catch","embedText","text","trimmed","embedder","pooling","data","console","error","Error","message","nodeEmbeddingInput","node","title","role","plain","cluster","Boolean","join","cosineSimilarity","dot","normA","normB","sqrt","encodeVector","v","JSON","stringify","decodeVector","raw","parsed","isArray","some","Number","isFinite","reembedNode","db","eqf","vec","embedding","rankByQuery","candidates","queryVec","scored","item","score","sort"],"mappings":"g0BAAA,IAAA,EAAuC,EAAA,CAAA,AAAd,CAAc,OACvC,EAAmB,EAAA,CAAV,AAAU,CADoB,AACpB,OACnB,EADmB,AAC4B,EAAA,CAAA,AAA5B,CAA4B,UAAA,UAgDxC,SAAS,AAAI,CAAA,EAA4C,AAC/D,OAAO,EAAA,GAAA,CAAA,IAAA,EAAU,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAQ,MAAM,CAC9C,kBAcO,SAAS,AAAY,CAAA,EAA4C,AACvE,OAAO,EAAA,GAAA,CAAA,aAAA,EAAmB,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAQ,MAAM,CACvD,YAlDO,SAAS,AAAM,CAAA,EAAsC,AAC3D,OAAO,EAAA,GAAA,CAAA,MAAA,EAAY,GAAc,EAAA,GAAA,CAAI,GAAA,CAAI,GAAG,CAAC,CAAA,CAAA,CAAA,CAAI,OAAA,CAAQ,MAAM,CAChE,oBAcO,SAAS,AAAc,CAAA,EAC7B,AADkE,OAC3D,EAAA,GAAA,CAAA,eAAA,EAAqB,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAQ,MAAM,CACzD,UA4EO,SAAS,AAA0B,CAAA,EAA4E,AACrH,OAAO,EAAA,GAAA,CAAA,IAAA,EAAU,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAA,CAAA,EAAQ,EAAA,EAAA,EAAG,EAAY,EAAA,MAAM,EAAI,EAAa,MAAM,CACpF,UAYO,SAAmC,AAA1B,CAA0B,EAA4E,AACrH,OAAO,EAAA,GAAA,CAAA,IAAA,EAAU,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAA,CAAA,EAAQ,EAAA,EAAA,EAAG,EAAY,EAAA,MAAM,EAAI,EAAa,MAAM,CACpF,UA9CO,SAAS,AAAI,CAAA,EAA4C,AAC/D,OAAO,EAAA,GAAA,CAAA,IAAA,EAAU,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAQ,MAAM,CAC9C,kBAcO,SAAS,AAAY,CAAA,EAA4C,AACvE,OAAO,EAAA,GAAA,CAAA,aAAA,EAAmB,EAAU,CAAA,CAAA,CAAI,KAAJ,EAAI,CAAQ,MAAM,CACvD,kCCpGA,IAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,gBAwCO,SAASe,EAAwBC,CAAa,EACnD,IAAMC,EAAMC,KAAKC,KAAK,CAACH,MAEvB,EAF+Bb,IAExB,CAAEU,EAAGX,AAjCI,CAAC,IADE,CACG,GAiCEe,EAAoBH,EADhCE,AACmCI,EAAjBnB,AAhCR,GAHF,CAmCiCD,CAAc,CAD/CG,AAEtB,CAOO,eAAekB,EAAkBC,EAAa,EAAA,EAAE,EACrD,GA1CkE,CA0C5Df,EAAM,MAAMe,EAAOC,KAAK,CAACC,QAAQ,CAACC,QAAQ,CAAC,CAC/CC,QAAS,CAACC,EAAG,KAAEC,CAAG,MAAEC,CAAI,CAAE,GAAK,CAACD,EAAID,EAAEb,CAAC,EAAGe,EAAKF,EAAEd,CAAC,EAAGe,EAAID,EAAEG,EAAE,EAAE,AACjE,GACA,GAAmB,IAAfvB,EAAIE,MAAM,CAAQ,OAAO,EAC7B,IAAIsB,EAAQ,EACZ,IAAK,IAAIvB,EAAI,EAAGA,EAAID,EAAIE,MAAM,CAAED,IAAK,CACnC,GAAM,GAAEK,CAAC,GAAEC,CAAC,CAAE,CAAGC,EAAwBP,GACnCwB,EAAIzB,CAAG,CAACC,EAAE,EACZwB,EAAEnB,CAAC,GAAKA,GAAKmB,EAAElB,CAAC,IAAKA,GAAG,CAC5B,MAAMQ,EAAOW,MAAM,CAAC,EAAA,QAAQ,EAAEC,GAAG,CAAC,GAAErB,IAAGC,CAAE,GAAGqB,KAAK,CAAC,CAAA,EAAA,EAAA,EAAA,AAAE,EAAC,EAAA,QAAQ,CAACL,EAAE,CAAEE,EAAEF,EAAE,GACtEC,IACF,CACA,OAAOA,CACT,CAiBO,eAAeU,EAAoBnB,EAAa,EAAA,EAAE,EACvD,GAAM,CAACoB,EAAQC,EAAM,CAAG,MAAMC,QAAQC,GAAG,CAAC,CACxCvB,EAAOC,KAAK,CAACuB,OAAO,CAACC,SAAS,CAAC,CAAErB,QAAS,CAACC,EAAG,CAAEE,MAAI,CAAE,GAAKA,EAAKF,EAAEb,CAAC,CAAE,GACrEQ,EAAOC,KAAK,CAACC,QAAQ,CAACuB,SAAS,CAAC,CAAErB,QAAS,CAACC,EAAG,MAAEE,CAAI,CAAE,GAAKA,EAAKF,EAAEb,CAAC,CAAE,GACvE,EACKkC,EAAO9B,KAAK+B,GAAG,CAACP,GAAQ5B,GAAK,EAAG6B,GAAO7B,GAAK,GAClD,OAAOkC,EAAO,EAAIA,EAPC,IAOqB,CAC1C,AAD2BR,8EApEpB,SAASlC,AACdC,CAA4C,EAE5C,IAAK,IAAIC,EAAI,EAAGA,EAAID,EAAIE,MAAM,CAAED,IAAK,AACnC,IAAK,IAAIE,EAAIF,EAAI,EAAGE,EAAIH,EAAIE,MAAM,CAAEC,IAAK,CACvC,IAAMC,EAAIJ,CAAG,CAACC,EAAE,CACVI,EAAIL,CAAG,CAACG,EAAE,CAChB,GACEC,EAAEE,CAAC,CAAGD,EAAEC,CAAC,GAAGT,GACZO,EAAEE,CAAC,CAjBW,EAiBRT,EAAgBQ,EAAEC,CAAC,EACzBF,EAAEG,CAAC,CAAGF,EAAEE,CAAC,GAAGT,EACZM,EAAEG,CAAC,CAlBY,EAkBTT,CAAiBO,EAAEE,CAAC,CAE1B,CADA,MACO,CAEX,CAEF,MAAO,EACT,gHCxCA,IAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,gBA+BO,eAAe+C,EAA0BvC,EAAa,EAAA,EAAE,EAC7D,GAAM,CAACgC,EAASC,EAAK,CAAG,MAAMX,QAAQC,GAAG,CAAC,CACxCvB,EAAOC,KAAK,CAACC,QAAQ,CAACC,QAAQ,CAAC,CAAEU,MAAO,CAACR,EAAG,IAAEmC,CAAE,CAAE,GAAKA,EAAGnC,EAAEoC,MAAM,CAAE,gBAAiB,GACrFzC,EAAOC,KAAK,CAACC,QAAQ,CAACC,QAAQ,CAAC,CAAEU,MAAO,CAACR,EAAG,IAAEqC,CAAE,CAAE,GAAKA,EAAGrC,EAAEoC,MAAM,CAAE,gBAAiB,GACtF,EAEKE,EAA0B,CAAEC,UAAW,EAAGC,SAAU,EAAE,AAAC,EAC7D,IAAK,IAAMC,KAAKd,EAAS,CACvB,IAAMe,EAAOd,EAAKe,IAAI,CAAC,AAACX,GAAMN,CA9B3B,SAASA,AACdC,CAAyC,CACzCC,CAAsC,EAEtC,GAAID,EAAQE,MAAM,CAACC,WAAW,KAAOF,EAAKC,MAAM,CAACC,WAAW,GAAI,OAAO,EACvE,IAAMC,EAAcJ,EAAVJ,AAAkBC,IAAI,4BAC1BQ,EAAcJ,AARcJ,EAQxBD,AAAeC,IAAI,CARUC,OAAO,CAAC,aAAc,MAU7D,OAAOO,IAAMD,GAAKC,EAAEC,QAAQ,CAACF,GAC/B,EAqBkDU,EAAGT,IAC5CU,IACL,EADW,IACL/C,EAAOiD,MAAM,CAAC,EAAA,QAAQ,EAAEpC,KAAK,CAAC,CAAA,EAAA,EAAA,EAAE,AAAF,EAAG,EAAA,QAAQ,CAACL,EAAE,CAAEsC,EAAEtC,EAAE,GACxDmC,EAAOC,SAAS,GAChBD,EAAOE,QAAQ,CAACK,IAAI,CAAC,CAAElB,QAAS,CAAA,EAAGc,EAAEZ,MAAM,CAAC,CAAC,EAAEY,EAAEjB,IAAI,CAAA,CAAE,CAAEI,KAAM,CAAA,EAAGc,EAAKb,MAAM,CAAC,CAAC,EAAEa,EAAKlB,IAAI,CAAA,CAAE,AAAC,GAC/F,CACA,OAAOc,CACT,uHChDA,IAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,gBAeO,SAASc,EAAoBC,CAAmB,EACrD,OALsB,AAKfJ,GAJY,GAIM1D,KAAK+B,GAAG,CAAC,EAAG+B,GAHd,EAIzB,CAiBO,SAlB+CH,AAkBtCI,EACdC,CAAqB,CACrBC,EAA0B,EAAE,EAE5B,IAAMC,CAtB6DN,CAsBnD,IAAIO,EAAcX,CAAiBY,GAAjBZ,CAAqB,CAAC,GACxD,IAAK,IAAM1C,KAAKmD,EAAU,CACxB,IAAMlE,EAAMC,KAAK+B,GAAG,CAClB,EACA/B,KAAKqE,GAAG,CAACb,EAAqBxD,KAAKsE,KAAK,CAACxD,EAAEnB,CAAC,EAAjB,CAAoB4D,KAE3CgB,EAASzD,EAAElB,CAAC,CAAGiE,EAAoB/C,EAAEgD,WAAW,IAAIL,CACtDc,EAASL,CAAO,CAACnE,EAAI,GAAEmE,CAAO,CAACnE,EAAI,CAAGwE,CAAAA,CAC5C,CACA,IAAMC,EAAM,IAAIC,IAChB,IAAK,IAAMhE,KAAKuD,EAAW,CACzB,IAAIjE,EAAM,EACV,IAAK,IAAIT,EAAI,EAAGA,EAzCW,EAyCPkE,AAAiBlE,IAAK,AAAI4E,CAAO,CAAC5E,EAAE,CAAG4E,CAAO,CAACnE,EAAI,GAAEA,GAAMT,EAC/E,IAAMK,EA3CqB,IA2CjBI,EACJH,EAAIsE,CAAO,CAACnE,AADFwD,EACM,CACtBiB,EAAIxD,GAAG,CAACP,EAAEiE,GAAG,CAAE,GAAE/E,IAAGC,CAAE,GACtBsE,CAAO,CAACnE,EAAI,CAAGH,EAAIiE,EAAoBpD,EAAEqD,WAAW,EA5C5B,EA6C1B,AAD0DL,CAE1D,OAAOe,CACT,CAgCO,eAAeQ,EAAe5E,EAAa,EAAA,EAAE,EAClD,IAAM6E,EAAS,MAAM7E,EAAOC,KAAK,CAACuB,OAAO,CAACrB,QAAQ,CAAC,CACjDU,MAAO,CAACR,EAAG,IAAEqC,CAAE,CAAE,GAAKA,EAAGrC,EAAEoC,MAAM,CAAE,iBACnCqC,KAAM,CAAEC,QAAS,CAAEA,QAAS,CAAEvE,IAAI,CAAK,CAAE,CAAE,EAC3CJ,QAAS,CAACC,EAAG,KAAEC,CAAG,CAAE,GAAKA,EAAID,EAAE2E,IAAI,CACrC,GACA,GAAsB,IAAlBH,EAAO1F,MAAM,CAAQ,OAAO,EAChC,IAAM8F,EAAYtB,EAChBkB,EAAOK,GAAG,CAAC,AAAC7E,IAAM,AAAC,CAAEiE,IAAKjE,EAAEG,EAAE,CAAEkD,YAAarD,EAAE0E,OAAO,CAAC5F,MAAM,CAAC,CAAC,GAE7DsB,EAAQ,EACZ,IAAK,IAAMJ,KAAKwE,EAAQ,CACtB,IAAMzC,EAAI6C,EAAUE,GAAG,CAAC9E,EAAEG,EAAE,EACvB4B,GAAG,CACJxC,KAAKsE,KAAK,CAAC9B,EAAE7C,CAAC,IAAMK,KAAKsE,KAAK,CAAC7D,EAAEd,CAAC,GAAKK,KAAKsE,KAAK,CAAC9B,EAAE5C,CAAC,IAAMI,KAAKsE,KAAK,CAAC7D,EAAEb,EAAC,GAAG,CAChF,MAAMQ,EAAOW,MAAM,CAAC,EAAA,OAAO,EAAEC,GAAG,CAAC,CAAErB,EAAG6C,EAAE7C,CAAC,CAAEC,EAAG4C,EAAE5C,CAAC,AAAC,GAAGqB,KAAK,CAAC,CAAA,EAAA,EAAA,EAAA,AAAE,EAAC,EAAA,OAAO,CAACL,EAAE,CAAEH,EAAEG,EAAE,GAC9EC,IACF,CACA,OAAOA,CACT,wHA7CO,SAAS8D,AACdC,CAAoE,EAGpE,IAAK,IAAItF,EAAI,EAAGA,EAAIsF,EAAOrF,MAAM,CAAED,IAAK,AACtC,IAAK,IAAIE,EAAIF,EAAI,EAAGE,EAAIoF,EAAOrF,MAAM,CAAEC,IAAK,CAC1C,IAAMC,EAAImF,CAAM,CAACtF,EAAE,CACbI,EAAIkF,CAAM,CAACpF,EAAE,CACbsF,EAAKjB,EAAoBpE,EAAEqE,WAAW,EACtCiB,EAAKlB,EAAoBnE,EAAEoE,WAAW,EAC5C,GAAIrE,EAAEE,CAAC,CAAGD,EAAEC,CAAC,GAAGkF,GAAKpF,EAAEE,CAAC,CAPlB4D,EAOqBsB,EAAInF,EAAEC,CAAC,EAAIF,EAAEG,CAAC,CAAGF,EAAEE,CAAC,CAAGmF,CAP1B,EAOgCtF,EAAEG,CAAC,CAAGkF,EAAKpF,EAAEE,CAAC,CACpE,CADsE,MAC/D,CAEX,CAEF,OAAO,CACT,yDCjFA,IAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OAAA,EAAA,EAAA,CAAA,CAAA,OAAA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,MAKA,EAAA,EAAA,CAAA,CAAA,OACA,EAAA,EAAA,CAAA,CAAA,qDAIO,IAAM4F,EAAiB,EAAA,CAAC,CAACC,MAAM,CAAC,CACrCR,OAAQ,EAAA,CAAC,CACNS,KAAK,CACJ,EAAA,CAAC,CAACD,MAAM,CAAC,CACPL,KAAM,EAAA,CAAC,CAACO,MAAM,GAAGC,IAAI,GAAGvB,GAAG,CAAC,GAC5BwB,OAAQ,EAAA,CAAC,CAACF,MAAM,GAAGG,OAAO,GAC1BC,YAAa,EAAA,CAAC,CAACJ,MAAM,GAAGG,OAAO,GAC/BX,QAAS,EAAA,CAAC,CACPO,KAAK,CACJ,EAAA,CAAC,CAACD,MAAM,CAAC,CACPL,KAAM,EAAA,CAAC,CAACO,MAAM,GAAGC,IAAI,GAAGvB,GAAG,CAAC,GAC5B2B,KAAM,EAAA,CAAC,CAACL,MAAM,GAAGC,IAAI,GAAGvB,GAAG,CAAC,GAC5B4B,KAAM,EAAA,CAAC,CAACC,OAAO,GAAGC,QAAQ,GAC1BC,KAAM,EAAA,CAAC,CAACF,OAAO,GAAGC,QAAQ,GAC1BE,SAAU,EAAA,CAAC,CAACH,OAAO,GAAGC,QAAQ,GAC9BG,KAAM,EAAA,CAAC,CAACX,MAAM,GAAGG,OAAO,EAC1B,IAEDS,OAAO,CAAC,EAAE,CACf,IAEDA,OAAO,CAAC,EAAE,EACbC,UAAW,EAAA,CAAC,CACTd,KAAK,CACJ,EAAA,CAAC,CAACD,MAAM,CAAC,CACPgB,UAAW,EAAA,CAAC,CAACd,MAAM,GACnBe,WAAY,EAAA,CAAC,CAACf,MAAM,GACpBgB,QAAS,EAAA,CAAC,CAAChB,MAAM,GACjBiB,SAAU,EAAA,CAAC,CAACjB,MAAM,GAClBkB,MAAO,EAAA,CAAC,CAAClB,MAAM,GAAGG,OAAO,EAC3B,IAEDS,OAAO,CAAC,EAAE,EACbO,UAAW,EAAA,CAAC,CACTpB,KAAK,CACJ,EAAA,CAAC,CAACD,MAAM,CAAC,CACPnD,OAAQ,EAAA,CAAC,CAACqD,MAAM,GAAGC,IAAI,GAAGvB,GAAG,CAAC,GAC9BpC,KAAM,EAAA,CAAC,CAAC0D,MAAM,GAAGC,IAAI,GAAGvB,GAAG,CAAC,GAC5BwB,OAAQ,EAAA,CAAC,CAACF,MAAM,GAAGG,OAAO,GAC1BC,YAAa,EAAA,CAAC,CAACJ,MAAM,GAAGG,OAAO,GAC/BiB,KAAM,EAAA,CAAC,CACJrB,KAAK,CACJ,EAAA,CAAC,CAACD,MAAM,CAAC,CACPuB,MAAO,EAAA,CAAC,CAACrB,MAAM,GACfsB,OAAQ,EAAA,CAAC,CAACtB,MAAM,GAAGY,OAAO,CAAC,OAC7B,IAEDA,OAAO,CAAC,EAAE,CACf,IAEDA,OAAO,CAAC,EAAE,CACf,GAKO,eAAeW,EAAW9G,EAAiB,EAAA,EAAE,EAClD,IAAM+G,EAAI,MAAM/G,EAAOC,KAAK,CAAC+G,SAAS,CAACvF,SAAS,CAAC,CAAEZ,MAAO,CAACR,EAAG,IAAEqC,CAAE,CAAE,GAAKA,EAAGrC,EAAEG,EAAE,CAAE,YAAa,GAC/F,OAAOuG,GAAGE,SAAW,CACvB,CAEO,eAAeC,EAAYlH,EAAiB,EAAA,EAAE,EACnD,GAAM,CAAC+G,EAAE,CAAG,MAAM/G,EACfmH,MAAM,CAAC,EAAA,SAAS,EAChBC,MAAM,CAAC,CAAE5G,GAAI,YAAayG,QAAS,CAAE,GACrCI,kBAAkB,CAAC,CAClBC,OAAQ,EAAA,SAAS,CAAC9G,EAAE,CACpBI,IAAK,CAAEqG,QAAS,EAAA,GAAG,CAAC,EAAE,EAAA,SAAS,CAACA,OAAO,CAAC,IAAI,CAAC,AAAC,CAChD,GACCM,SAAS,GACZ,OAAOR,EAAEE,OAAO,AAClB,CAQO,eAAeO,EAAeC,CAAc,CAAEzH,EAAiB,EAAA,EAAE,EACtE,IAAM0H,EAAOtC,EAAeuC,KAAK,CAACF,GAG5BG,EAAaF,EAAK7C,MAAM,CAACK,GAAG,CAAC,AAAC7E,GAAMA,EAAE2E,IAAI,CAChD,OAAMhF,EACHiD,MAAM,CAAC,EAAA,OAAO,EACdpC,KAAK,CACJ+G,EAAWzI,MAAM,CACb,CAAA,EAAA,EAAA,GAAA,AAAG,EAAC,CAAA,EAAA,EAAA,EAAE,AAAF,EAAG,EAAA,OAAO,CAACsD,MAAM,CAAE,iBAAkB,CAAA,EAAA,EAAA,UAAA,AAAU,EAAC,EAAA,OAAO,CAACuC,IAAI,CAAE4C,IAClE,CAAA,EAAA,EAAA,EAAE,AAAF,EAAG,EAAA,OAAO,CAACnF,MAAM,CAAE,kBAM3B,IAAMoF,EAAc,MAAM7H,EAAOC,KAAK,CAACuB,OAAO,CAACrB,QAAQ,CAAC,CACtD4E,QAAS,CAAEC,MAAM,EAAMzF,EAAG,GAAMC,EAAG,EAAK,EACxCsF,KAAM,CAAEC,QAAS,CAAEA,QAAS,CAAEvE,IAAI,CAAK,CAAE,CAAE,CAC7C,GACMsH,EAAiB,IAAIzD,IAAIwD,EAAY3C,GAAG,CAAC,AAAC7E,GAAM,CAACA,EAAE2E,IAAI,CAAE3E,EAAE,GAC3D0H,EAAoB,CAAA,EAAA,EAAA,iBAAA,AAAiB,EACzCL,EAAK7C,MAAM,CACRmD,MAAM,CAAC,AAAC3H,GAAM,CAACyH,EAAeG,GAAG,CAAC5H,EAAE2E,IAAI,GACxCE,GAAG,CAAC,AAAC7E,IAAM,AAAC,CAAEiE,IAAKjE,EAAE2E,IAAI,CAAEtB,YAAarD,EAAE0E,OAAO,CAAC5F,MAAM,CAAC,CAAC,EAC7D0I,EAAY3C,GAAG,CAAE7E,AAAD,IAAQ,AAAD,CAAGd,EAAGc,EAAEd,CAAC,CAAEC,EAAGa,EAAEb,CAAC,CAAEkE,YAAarD,EAAE0E,OAAO,CAAC5F,MAAM,CAAC,CAAC,GAGrE+I,EAAgB,IAAI7D,IAC1B,IAAK,IAAMhE,KAAKqH,EAAK7C,MAAM,CAAE,CAC3B,IAAMhB,EAAWiE,EAAe3C,GAAG,CAAC9E,EAAE2E,IAAI,EACpCmD,EAAMJ,EAAkB5C,GAAG,CAAC9E,EAAE2E,IAAI,EAClCzF,EAAIsE,GAAUtE,GAAK4I,GAAK5I,GAAK,EAC7BC,EAAIqE,GAAUrE,GAAK2I,GAAK3I,GAAK,EAC7B,CAAC4I,EAAM,CAAG,MAAMpI,EACnBmH,MAAM,CAAC,EAAA,OAAO,EACdC,MAAM,CAAC,CACNpC,KAAM3E,EAAE2E,IAAI,CACZS,OAAQpF,EAAEoF,MAAM,EAAI,KACpBE,YAAatF,EAAEsF,WAAW,EAAI,KAC9BlD,OAAQ,kBACRlD,IACAC,CACF,GACC6H,kBAAkB,CAAC,CAClBC,OAAQ,EAAA,OAAO,CAACtC,IAAI,CACpBpE,IAAK,CACH6E,OAAQpF,EAAEoF,MAAM,EAAI,KACpBE,YAAatF,EAAEsF,WAAW,EAAI,KAC9BlD,OAAQ,eACV,CACF,GACC8E,SAAS,GACZW,EAActH,GAAG,CAACP,EAAE2E,IAAI,CAAEoD,EAAM5H,EAAE,EAClC,MAAMR,EAAOiD,MAAM,CAAC,EAAA,QAAQ,EAAEpC,KAAK,CAAC,CAAA,EAAA,EAAA,EAAA,AAAE,EAAC,EAAA,QAAQ,CAACwH,OAAO,CAAED,EAAM5H,EAAE,GAC7DH,EAAE0E,OAAO,CAAC5F,MAAM,EAAE,AACpB,MAAMa,EAAOmH,MAAM,CAAC,EAAA,QAAQ,EAAEC,MAAM,CAClC/G,EAAE0E,OAAO,CAACG,GAAG,CAAC,CAAC7C,EAAGnD,IAAM,CAAC,CACvBmJ,QAASD,EAAM5H,EAAE,CACjBwE,KAAM3C,EAAE2C,IAAI,CACZY,KAAMvD,EAAEuD,IAAI,CACZC,KAAMxD,EAAEwD,IAAI,GAAI,EAChBG,KAAM3D,EAAE2D,IAAI,GAAI,EAChBC,SAAU5D,EAAE4D,QAAQ,GAAI,EACxBC,KAAM7D,EAAE6D,IAAI,EAAI,KAChBoC,IAAKpJ,CACP,CAAC,GAGP,CAGA,IAAMqJ,EAAgB,IAAIL,EAAcd,MAAM,GAAG,CAWjD,IAAK,IAAMsB,KAVPH,EAAcpJ,MAAM,EAAE,AACxB,MAAMa,EACHiD,MAAM,CAAC,EAAA,UAAU,EACjBpC,KAAK,CACJ,CAAA,EAAA,EAAA,EAAA,AAAE,EACA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAQ,EAAA,UAAU,CAAC2H,WAAW,CAAED,GAChC,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,EAAA,UAAU,CAACE,SAAS,CAAEF,KAItBb,EAAKtB,SAAS,EAAE,CAC9B,IAAMuC,EAAST,EAAc/C,GAAG,CAACuD,EAAErC,SAAS,EACtCuC,EAAOV,EAAc/C,GAAG,CAACuD,EAAEnC,OAAO,EACnCoC,GAAWC,GAChB,GADsB,CAAP,EACT5I,EAAOmH,MAAM,CAAC,EAAA,UAAU,EAAEC,MAAM,CAAC,CACrCoB,YAAaG,EACbF,UAAWG,EACXtC,WAAYoC,EAAEpC,UAAU,CACxBE,SAAUkC,EAAElC,QAAQ,CACpBC,MAAOiC,EAAEjC,KAAK,EAAI,CAAA,EAAGiC,EAAEpC,UAAU,CAAC,GAAG,EAAEoC,EAAEnC,OAAO,CAAC,CAAC,EAAEmC,EAAElC,QAAQ,CAAA,CAAE,AAClE,EACF,CAGA,IAAMqC,EAAS,IAAIC,IAAIpB,EAAKhB,SAAS,CAACxB,GAAG,CAAC,AAACxE,GAAM,CAAA,EAAGA,EAAEwB,MAAM,CAAC,CAAC,EAAExB,EAAEmB,IAAI,CAAA,CAAE,GAIlEmH,EAAQD,CAHG,MAAM/I,EAAOC,KAAK,CAACC,QAAQ,CAACC,QAAQ,CAAC,CACpDU,MAAO,CAACR,EAAG,IAAEqC,CAAE,CAAE,GAAKA,EAAGrC,EAAEoC,MAAM,CAAE,gBACrC,EAAA,EACuBuF,MAAM,CAAEtH,AAAD,GAAO,CAACmI,EAAOZ,GAAG,CAAC,CAAA,EAAGvH,EAAEwB,MAAM,CAAC,CAAC,EAAExB,EAAEmB,IAAI,CAAA,CAAE,GAAGqD,GAAG,CAAC,AAACxE,GAAMA,EAAEF,EAAE,CACtFwI,GAAM7J,MAAM,EAAE,MAAMa,EAAOiD,MAAM,CAAC,EAAA,QAAQ,EAAEpC,KAAK,CAAC,CAAA,EAAA,EAAA,OAAA,AAAO,EAAC,EAAA,QAAQ,CAACL,EAAE,CAAEwI,IAI3E,IAAIC,EAAgB,CAAC,MAAMjJ,EAAOgB,MAAM,CAAC,CAAED,EAAG,CAAA,EAAA,EAAA,KAAK,AAAL,GAAQ,GAAGE,IAAI,CAAC,EAAA,SAAQ,CAAC,AAAC,CAAC,EAAE,CAACF,CAAC,CAC7E,IAAK,IAAML,KAAKgH,EAAKhB,SAAS,CAAE,CAC9B,IAGInH,EAAWC,EAHTqE,EAAW,MAAM7D,EAAOC,KAAK,CAACC,QAAQ,CAACuB,SAAS,CAAC,CACrDZ,MAAO,CAACR,EAAG,KAAE6I,CAAG,CAAExG,IAAE,CAAE,GAAKwG,EAAIxG,EAAGrC,EAAE6B,MAAM,CAAExB,EAAEwB,MAAM,EAAGQ,EAAGrC,EAAEwB,IAAI,CAAEnB,EAAEmB,IAAI,EAC1E,GAEA,GAAIgC,EACFtE,EAAIsE,EAAStE,CAAC,CACdC,EAAIqE,AAFQ,EAECrE,CAAC,KACT,CACL,IAAM2J,EAAO,CAAA,EAAA,EAAA,uBAAA,AAAuB,EAACF,GACrC1J,EAAI4J,EAAK5J,CAAC,CACVC,EAAI2J,EAAK3J,CAAC,CACVyJ,GACF,CACA,GAAM,CAACb,EAAM,CAAG,MAAMpI,EACnBmH,MAAM,CAAC,EAAA,QAAQ,EACfC,MAAM,CAAC,CACNlF,OAAQxB,EAAEwB,MAAM,CAChBL,KAAMnB,EAAEmB,IAAI,CACZ4D,OAAQ/E,EAAE+E,MAAM,EAAI,KACpBE,YAAajF,EAAEiF,WAAW,EAAI,KAC9BlD,OAAQ,kBACRlD,EACAC,GACF,GACC6H,kBAAkB,CAAC,CAClBC,OAAQ,CAAC,EAAA,QAAQ,CAACpF,MAAM,CAAE,EAAA,QAAQ,CAACL,IAAI,CAAC,CACxCjB,IAAK,CACH6E,OAAQ/E,EAAE+E,MAAM,EAAI,KACpBE,YAAajF,EAAEiF,WAAW,EAAI,KAC9BlD,OAAQ,eACV,CACF,GACC8E,SAAS,GAEZ,IAAK,IAAM8B,KADX,MAAMrJ,EAAOiD,MAAM,CAAC,EAAA,aAAa,EAAEpC,KAAK,CAAC,CAAA,EAAA,EAAA,EAAA,AAAE,EAAC,EAAA,aAAa,CAACuI,UAAU,CAAEhB,EAAM5H,EAAE,GAC9DE,EAAEiG,IAAI,EAAE,CACtB,IAAM2C,EACJpB,EAAc/C,GAAG,CAACkE,EAAEzC,KAAK,IAEvB,CADF,KACQ5G,EAAOC,KAAK,CAACuB,OAAO,CAACC,SAAS,CAAC,CAAEZ,MAAO,CAACR,EAAG,IAAEqC,CAAE,CAAE,GAAKA,EAAGrC,EAAE2E,IAAI,CAAEqE,EAAEzC,KAAK,CAAE,EAAA,CACnF,EAAGpG,GACA8I,GACL,EADU,IACJtJ,EAAOmH,MAAM,CAAC,EAAA,aAAa,EAAEC,MAAM,CAAC,CACxCgC,WAAYhB,EAAM5H,EAAE,CACpB6H,QAASiB,EACTzC,OAAQwC,EAAExC,MAAM,AAClB,EACF,CACF,CAGA,MAAM,CAAA,EAAA,EAAA,yBAAA,AAAyB,EAAC7G,GAMhC,IAAMuJ,EAAe,MAAMvJ,EAAOC,KAAK,CAACuB,OAAO,CAACrB,QAAQ,CAAC,CACvDU,MAAO,CAACR,EAAG,IAAEqC,CAAE,CAAE,GAAKA,EAAGrC,EAAEoC,MAAM,CAAE,iBACnCsC,QAAS,CAAExF,EAAG,GAAMC,GAAG,CAAK,EAC5BsF,KAAM,CAAEC,QAAS,CAAEA,QAAS,CAAEvE,IAAI,CAAK,CAAE,CAAE,CAC7C,GAEE,CAAA,EAAA,EAAA,aAAA,AAAa,EACX+I,EAAarE,GAAG,CAAC,AAAC7E,IAAM,AAAC,CAAEd,EAAGc,EAAEd,CAAC,CAAEC,EAAGa,EAAEb,CAAC,CAAEkE,YAAarD,EAAE0E,OAAO,CAAC5F,MAAM,CAAC,CAAC,IAG5E,CADA,KACM,CAAA,EAAA,EAAA,cAAA,AAAc,EAACa,GAEvB,IAAMwJ,EAAY,MAAMxJ,EAAOgB,MAAM,CAAC,CAAEzB,EAAG,EAAA,QAAQ,CAACA,CAAC,CAAEC,EAAG,EAAA,QAAQ,CAACA,CAAE,AAAD,GAAIyB,IAAI,CAAC,EAAA,QAAQ,CACjF,CAAA,CAAA,EAAA,EAAA,gBAAA,AAAgB,EAACuI,IAAY,MAAM,CAAA,EAAA,EAAA,iBAAA,AAAiB,EAACxJ,GAEzD,IAAMiH,EAAU,MAAMC,EAAYlH,GAClC,MAAO,CACL6E,OAAQ6C,EAAK7C,MAAM,CAAC1F,MAAM,CAC1BiH,UAAWsB,EAAKtB,SAAS,CAACjH,MAAM,CAChCuH,UAAWgB,EAAKhB,SAAS,CAACvH,MAAM,SAChC8H,CACF,CACF,oIC5QA,IAAIwC,EAA6D,KAEjE,eAAeC,IAeb,OAdI,AAACD,IACHA,EAAkB,CAAC,UADC,AAElB,GAAM,CAAEE,UAAQ,CAAE,CAAG,MAAA,EAAA,CAAA,CAAA,OAGrB,OAAQ,MAAMA,EACZ,qBACA,2BAEJ,CAAC,GAAIC,KAAK,CAAC,AAAClJ,IAEV,MADA+I,EAAkB,KACZ/I,CADkB,AAE1B,EAAA,EAEK+I,CACT,CAGO,eAAeI,EAAUC,CAAY,EAC1C,IAAMC,EAAUD,EAAKtE,IAAI,GACzB,GAAI,CAACuE,EAVsE,AAU7D,OAAO,KACrB,GAAI,CACF,IAAMC,EAAW,MAAMN,IACjBtF,EAAM,MAAM4F,EAASD,EAAS,CAAEE,QAAS,OAAQrI,WAAW,CAAK,GACvE,OAAOmC,MAAM9C,IAAI,CAACmD,EAAI8F,IAAI,CAC5B,CAAE,MAAOxJ,EAAG,CAEV,OADAyJ,QAAQC,KAAK,CAAC,uBAAwB1J,aAAa2J,MAAQ3J,EAAE4J,OAAO,CAAG5J,GAChE,IACT,CACF,CAGO,SAAS6J,EAAmBC,CAKlC,EACC,MAAO,CAACA,EAAKC,KAAK,CAAED,EAAKE,IAAI,CAAEF,EAAKG,KAAK,CAAEH,EAAKI,OAAO,CAAC,CAAC5C,MAAM,CAAC6C,SAASC,IAAI,CAAC,KAChF,CAiBO,SAASM,EAAaC,CAAW,EACtC,OAAOC,KAAKC,SAAS,CAACF,EACxB,CAkBO,eAAeU,EAAYvL,CAAU,EAC1C,GAAI,CACF,GAAM,IAAEwL,CAAE,CAAE,CAAG,MAAA,EAAA,CAAA,CAAA,OACT,CAAExB,MAAI,CAAE,CAAG,MAAA,EAAA,CAAA,CAAA,OACX,IAAE9H,CAAE,CAAE,CAAG,MAAA,EAAA,CAAA,CAAA,OACT5C,EAAM,MAAMkM,EAAG/L,KAAK,CAACuK,IAAI,CAAC/I,SAAS,CAAC,CACxCZ,MAAO,CAACR,EAAG,CAAEqC,GAAIuJ,CAAG,CAAE,GAAKA,EAAI5L,EAAEG,EAAE,CAAEA,GACrCuE,QAAS,CAAE0F,OAAO,EAAMC,MAAM,EAAMC,OAAO,EAAMC,SAAS,CAAK,CACjE,GACA,GAAI,CAAC9K,EAAK,OACV,IAAMoM,EAAM,MAAMrC,EAAUU,EAAmBzK,IAC/C,GAAI,CAACoM,EAAK,MACV,OAAMF,EAAGrL,MAAM,CAAC6J,GAAM5J,GAAG,CAAC,CAAEuL,UAAWf,EAAac,EAAK,GAAGrL,KAAK,CAAC6B,EAAG8H,EAAKhK,EAAE,CAAEA,GAChF,CAAE,MAAOE,EAAG,CACVyJ,QAAQC,KAAK,CAAC,+BAAgC5J,EAAIE,aAAa2J,MAAQ3J,EAAE4J,OAAO,CAAG5J,EACrF,CACF,CAGO,eAAe0L,EACpBnM,CAAa,CACboM,CAAe,EAEf,IAAMC,EAAW,MAAMzC,EAAU5J,GACjC,GAAI,CAACqM,EAAU,OAAO,KACtB,IAAMC,EAA4C,EAAE,CACpD,IAAK,IAAMC,KAAQH,EAAY,CAC7B,IAAMhB,EA3CH,AA2COG,SA3CeC,AAAbD,CAA2C,EACzD,GAAI,CAACC,EAAK,OAAO,KACjB,GAAI,CACF,IAAMC,EAASJ,KAAK3D,KAAK,CAAC8D,GAC1B,GAAI,CAAC1H,MAAM4H,OAAO,CAACD,IACfA,EAAOE,IAAI,CAAC,AAACrM,GAAmB,UAAb,OAAOA,GAAkB,CAACsM,OAAOC,QAAQ,CAACvM,IADrC,CAC0C,MADnC,CAC0C,IAC7E,OAAOmM,CACT,CAAE,KAAM,CACN,OAAO,IACT,CACF,EAiC2Bc,EAAKL,SAAS,EAChCd,GAAG,AACRkB,EAAOrJ,IAAI,CAAC,MAAEsJ,EAAMC,MA/DjB,AA+DwB1B,SA/DfA,AAAiB1L,CAAW,CAAEC,CAAW,EACvD,GAAID,EAAEF,MAAM,GAAKG,EAAEH,MAAM,CAAE,OAAO,EAClC,IAAI6L,EAAM,EACNC,EAAQ,EACRC,EAAQ,EACZ,IAAK,IAAIhM,EAAI,EAAGA,EAAIG,EAAEF,MAAM,CAAED,IAC5B8L,AADiC,GAC1B3L,CAAC,CAACH,EAAE,CAAGI,CAAC,CAACJ,EAAE,CAClB+L,GAAS5L,CAAC,CAACH,EAAE,CAAGG,CAAC,CAACH,EAAE,CACpBgM,GAAS5L,CAAC,CAACJ,EAAE,CAAGI,CAAC,CAACJ,EAAE,QAEtB,AAAc,IAAV+L,GAAyB,GAAG,CAAbC,EAAoB,EAChCF,GAAOpL,GAAD,EAAMuL,IAAI,CAACF,GAASrL,KAAKuL,IAAI,CAACD,EAAAA,CAC7C,AADmD,EAoDHoB,EAAUjB,EAAG,EAC3D,CAEA,OADAkB,EAAOG,IAAI,CAAC,CAACrN,EAAGC,IAAMA,EAAEmN,KAAK,CAAGpN,EAAEoN,KAAK,EAChCF,CACT"}

package/.next/server/chunks/[root-of-the-server]__008acf8._.js

@@ -0,0 +1,3 @@
+module.exports=[58708,e=>{"use strict";let t=null;async function r(){return t||(t=(async()=>{let{pipeline:t}=await e.A(46128);return await t("feature-extraction","Xenova/all-MiniLM-L6-v2")})().catch(e=>{throw t=null,e})),t}async function a(e){let t=e.trim();if(!t)return null;try{let e=await r(),a=await e(t,{pooling:"mean",normalize:!0});return Array.from(a.data)}catch(e){return console.error("[embeddings] failed:",e instanceof Error?e.message:e),null}}function n(e){return[e.title,e.role,e.plain,e.cluster].filter(Boolean).join(". ")}function i(e){return JSON.stringify(e)}async function s(t){try{let{db:r}=await e.A(35914),{node:s}=await e.A(29363),{eq:o}=await e.A(96359),l=await r.query.node.findFirst({where:(e,{eq:r})=>r(e.id,t),columns:{title:!0,role:!0,plain:!0,cluster:!0}});if(!l)return;let u=await a(n(l));if(!u)return;await r.update(s).set({embedding:i(u)}).where(o(s.id,t))}catch(e){console.error("[embeddings] reembed failed:",t,e instanceof Error?e.message:e)}}async function o(e,t){let r=await a(e);if(!r)return null;let n=[];for(let e of t){let t=function(e){if(!e)return null;try{let t=JSON.parse(e);if(!Array.isArray(t)||t.some(e=>"number"!=typeof e||!Number.isFinite(e)))return null;return t}catch{return null}}(e.embedding);t&&n.push({item:e,score:function(e,t){if(e.length!==t.length)return 0;let r=0,a=0,n=0;for(let i=0;i<e.length;i++)r+=e[i]*t[i],a+=e[i]*e[i],n+=t[i]*t[i];return 0===a||0===n?0:r/(Math.sqrt(a)*Math.sqrt(n))}(r,t)})}return n.sort((e,t)=>t.score-e.score),n}e.s(["embedText",0,a,"encodeVector",0,i,"nodeEmbeddingInput",0,n,"rankByQuery",0,o,"reembedNode",0,s])},53828,e=>e.a(async(t,r)=>{try{var a=e.i(91426),n=e.i(34700),i=t([a]);async function s(e=a.db){let[t]=await e.insert(n.appSetting).values({id:"singleton"}).onConflictDoUpdate({target:n.appSetting.id,set:{id:"singleton"}}).returning();return t}async function o(e,t=a.db){let[r]=await t.insert(n.appSetting).values({id:"singleton",...e}).onConflictDoUpdate({target:n.appSetting.id,set:e}).returning();return r}[a]=i.then?(await i)():i,e.s(["getAppSettings",0,s,"setAppSettings",0,o]),r()}catch(e){r(e)}},!1),91153,e=>{"use strict";let t=new Set(["a","an","the","of","for","to","and","or","in","on","with","via","by","using","use","add","adds","support","implement","implementation","feature","new","build","create","o","os","as","um","uma","de","da","do","das","dos","para","por","com","e","ou","no","na","nos","nas","ao","aos","adicionar","implementar","suporte","suportar","nova","novo","funcionalidade","usar","usando","criar"]);function r(e){return e.normalize("NFD").replace(/[̀-ͯ]/g,"").toLowerCase().replace(/[^a-z0-9]+/g," ").trim().replace(/\s+/g," ")}function a(e){return r(e).split(" ").filter(e=>e&&!t.has(e))}function n(e,t){if(!e.size||!t.size)return 0;let r=0;for(let a of e)t.has(a)&&r++;return 2*r/(e.size+t.size)}function i(e){let t=r(e).replace(/ /g,""),a=new Set;for(let e=0;e<t.length-1;e++)a.add(t.slice(e,e+2));return a}e.s(["matchFeature",0,function(e,t,s={}){let o=s.confident??.72,l=s.consider??.5,u=s.margin??.1,d=t.map(t=>{var s,o;let l,u;return{...t,score:Math.round(100*(s=e,o=t.title,l=r(s),u=r(o),l&&u?l===u?1:Math.min(1,.7*n(new Set(a(s)),new Set(a(o)))+.4*n(i(s),i(o))):0))/100}}).sort((e,t)=>t.score-e.score),c=d[0];if(!c||c.score<l)return{best:null,candidates:[]};let p=d[1]?.score??0,f=1===d.length||c.score-p>=u;return c.score>=o&&f?{best:c,candidates:[]}:{best:null,candidates:d.filter(e=>e.score>=l).slice(0,4)}}])},32665,e=>{"use strict";var t=e.i(91153);e.s(["validateFeatureCreation",0,function(e){let r=(e.title??"").trim();if(!r)return"⛔ A feature needs a non-empty title.";if(!(e.category??"").trim()){let t=function(e){let t=new Set;for(let r of e){let e=(r.cluster??"").trim();e&&t.add(e)}return[...t].sort()}(e.existing),a=t.length?` Reuse an existing category where it fits: ${t.join(", ")}.`:"";return`⛔ Feature "${r}" has no category. Every roadmap feature needs one — it drives grouping and color on the board.${a} Pass it as \`category\` (e.g. AUTH, SEARCH, DATA, INTEL, BILLING, INFRA …); don't rely on a default.`}let a=(0,t.matchFeature)(r,e.existing.map(e=>({id:e.id,title:e.title})));if(a.best){let t=e.existing.find(e=>e.id===a.best.id),n=t?.status?` (${t.status})`:"";return`⛔ "${r}" already exists as the feature "${t?.title??a.best.title}"${n}. Don't create a duplicate — mark progress on it with \`beacon_start_feature({ id })\`, add sub-tasks with \`beacon_add_subtasks\`, or finish it with \`beacon_describe_feature\`.`}return null},"validateFront",0,function(e,r){let a=(e??"").trim();if(!a)return null;let n=(0,t.matchFeature)(a,r);if(n.best)return null;let i=n.candidates.length?` Did you mean: ${n.candidates.map(e=>`"${e.title}"`).join(", ")}?`:"";return`⛔ front "${a}" doesn't match an existing feature.${i} \`front\` nests a feature UNDER an existing parent feature — it is NOT a domain tag. If "${a}" is a domain, pass it as \`category\` instead. If it's a real umbrella feature, create it first via beacon_propose_plan.`},"validateNoDuplicateFeatures",0,function(e,r){let a=r.map(e=>({id:e.id,title:e.title})),n=e.map(e=>{let n=(0,t.matchFeature)(e.title??"",a);return n.best?{title:e.title,hit:r.find(e=>e.id===n.best.id)}:null}).filter(e=>null!==e);return n.length?"⛔ These proposed features already exist on the roadmap — reuse them instead of creating duplicates:\n"+n.map(e=>`  • "${e.title}" → existing "${e.hit.title}"${e.hit.status?` (${e.hit.status})`:""}`).join("\n")+"\n\nDrop the duplicate(s) from the plan; to add work to an existing feature, ship sub-tasks or update it via beacon_describe_feature. Keep only genuinely new features in the proposal.":null},"validateProposedFeatures",0,function(e){let t=e.map(e=>{let t=[],r=e.cluster??e.category??e.domain??null;return r&&r.trim()||t.push("category"),null==e.priority&&t.push("priority"),t.length?`  • "${e.title?.trim()||"(untitled)"}" — missing ${t.join(" + ")}`:null}).filter(e=>null!==e);return 0===t.length?null:"⛔ Every roadmap feature needs a category AND a priority — they drive grouping and ordering on the board, and the user shouldn't have to add them by hand. Missing:\n"+t.join("\n")+"\n\nRe-present with each feature carrying its category as `category` (or `cluster` — both work; e.g. AUTH, SEARCH, DATA, INTEL, BILLING …) and `priority` (0 = P0 critical, 1 = P1 high, 2 = P2 medium, 3 = P3 low). Set BOTH on EVERY feature; don't rely on defaults."}])},36357,e=>e.a(async(t,r)=>{try{var a=e.i(46260),n=e.i(91426),i=e.i(14859),s=t([a,n]);async function o(e){try{let t=await e.json();if("string"!=typeof t.title||!t.title.trim())return new Response("title required",{status:400});return await (0,i.runWithWorkspace)((0,i.workspaceIdFromRequest)(e),async()=>{let e=await (0,a.startFeature)({title:t.title,id:"string"==typeof t.id?t.id:null,front:"string"==typeof t.front?t.front:null,detail:"string"==typeof t.detail?t.detail:null,cluster:"string"==typeof t.cluster?t.cluster:"string"==typeof t.category?t.category:"string"==typeof t.domain?t.domain:null});return"rejected"===e.action?Response.json({error:e.message},{status:422}):(Array.isArray(t.files)&&("flagged"===e.action||"created"===e.action)&&await (0,a.touchFiles)({id:e.id,files:t.files.filter(e=>"string"==typeof e)}),Response.json(e))})}catch(e){return new Response(`start failed: ${e instanceof Error?e.message:"error"}`,{status:500})}}[a,n]=s.then?(await s)():s,e.s(["POST",0,o,"dynamic",0,"force-dynamic"]),r()}catch(e){r(e)}},!1),64300,e=>e.a(async(t,r)=>{try{var a=e.i(47909),n=e.i(74017),i=e.i(96250),s=e.i(59756),o=e.i(61916),l=e.i(74677),u=e.i(69741),d=e.i(16795),c=e.i(87718),p=e.i(95169),f=e.i(47587),h=e.i(66012),g=e.i(70101),m=e.i(26937),y=e.i(10372),v=e.i(93695);e.i(20232);var w=e.i(220),R=e.i(36357),b=t([R]);[R]=b.then?(await b)():b;let A=new a.AppRouteRouteModule({definition:{kind:n.RouteKind.APP_ROUTE,page:"/api/map/start/route",pathname:"/api/map/start",filename:"route",bundlePath:""},distDir:".next",relativeProjectDir:"",resolvedPagePath:"[project]/app/api/map/start/route.ts",nextConfigOutput:"",userland:R,...{}}),{workAsyncStorage:_,workUnitAsyncStorage:x,serverHooks:C}=A;async function E(e,t,r){r.requestMeta&&(0,s.setRequestMeta)(e,r.requestMeta),A.isDev&&(0,s.addRequestMeta)(e,"devRequestTimingInternalsEnd",process.hrtime.bigint());let a="/api/map/start/route";a=a.replace(/\/index$/,"")||"/";let i=await A.prepare(e,t,{srcPage:a,multiZoneDraftMode:!1});if(!i)return t.statusCode=400,t.end("Bad Request"),null==r.waitUntil||r.waitUntil.call(r,Promise.resolve()),null;let{buildId:R,deploymentId:b,params:E,nextConfig:_,parsedUrl:x,isDraftMode:C,prerenderManifest:N,routerServerContext:S,isOnDemandRevalidate:P,revalidateOnlyGenerated:T,resolvedPathname:$,clientReferenceManifest:I,serverActionsManifest:k}=i,O=(0,u.normalizeAppPath)(a),q=!!(N.dynamicRoutes[O]||N.routes[$]),D=async()=>((null==S?void 0:S.render404)?await S.render404(e,t,x,!1):t.end("This page could not be found"),null);if(q&&!C){let e=!!N.routes[$],t=N.dynamicRoutes[O];if(t&&!1===t.fallback&&!e){if(_.adapterPath)return await D();throw new v.NoFallbackError}}let F=null;!q||A.isDev||C||(F=$,F="/index"===F?"/":F);let H=!0===A.isDev||!q,M=q&&!H;k&&I&&(0,l.setManifestsSingleton)({page:a,clientReferenceManifest:I,serverActionsManifest:k});let j=e.method||"GET",U=(0,o.getTracer)(),L=U.getActiveScopeSpan(),z=!!(null==S?void 0:S.isWrappedByNextServer),B=!!(0,s.getRequestMeta)(e,"minimalMode"),K=(0,s.getRequestMeta)(e,"incrementalCache")||await A.getIncrementalCache(e,_,N,B);null==K||K.resetRequestCache(),globalThis.__incrementalCache=K;let G={params:E,previewProps:N.preview,renderOpts:{experimental:{authInterrupts:!!_.experimental.authInterrupts},cacheComponents:!!_.cacheComponents,supportsDynamicResponse:H,incrementalCache:K,cacheLifeProfiles:_.cacheLife,waitUntil:r.waitUntil,onClose:e=>{t.on("close",e)},onAfterTaskError:void 0,onInstrumentationRequestError:(t,r,a,n)=>A.onRequestError(e,t,a,n,S)},sharedContext:{buildId:R,deploymentId:b}},V=new d.NodeNextRequest(e),W=new d.NodeNextResponse(t),X=c.NextRequestAdapter.fromNodeNextRequest(V,(0,c.signalFromNodeResponse)(t));try{let i,s=async e=>A.handle(X,G).finally(()=>{if(!e)return;e.setAttributes({"http.status_code":t.statusCode,"next.rsc":!1});let r=U.getRootSpanAttributes();if(!r)return;if(r.get("next.span_type")!==p.BaseServerSpan.handleRequest)return void console.warn(`Unexpected root span type '${r.get("next.span_type")}'. Please report this Next.js issue https://github.com/vercel/next.js`);let n=r.get("next.route");if(n){let t=`${j} ${n}`;e.setAttributes({"next.route":n,"http.route":n,"next.span_name":t}),e.updateName(t),i&&i!==e&&(i.setAttribute("http.route",n),i.updateName(t))}else e.updateName(`${j} ${a}`)}),l=async i=>{var o,l;let u=async({previousCacheEntry:n})=>{try{if(!B&&P&&T&&!n)return t.statusCode=404,t.setHeader("x-nextjs-cache","REVALIDATED"),t.end("This page could not be found"),null;let a=await s(i);e.fetchMetrics=G.renderOpts.fetchMetrics;let o=G.renderOpts.pendingWaitUntil;o&&r.waitUntil&&(r.waitUntil(o),o=void 0);let l=G.renderOpts.collectedTags;if(!q)return await (0,h.sendResponse)(V,W,a,G.renderOpts.pendingWaitUntil),null;{let e=await a.blob(),t=(0,g.toNodeOutgoingHttpHeaders)(a.headers);l&&(t[y.NEXT_CACHE_TAGS_HEADER]=l),!t["content-type"]&&e.type&&(t["content-type"]=e.type);let r=void 0!==G.renderOpts.collectedRevalidate&&!(G.renderOpts.collectedRevalidate>=y.INFINITE_CACHE)&&G.renderOpts.collectedRevalidate,n=void 0===G.renderOpts.collectedExpire||G.renderOpts.collectedExpire>=y.INFINITE_CACHE?void 0:G.renderOpts.collectedExpire;return{value:{kind:w.CachedRouteKind.APP_ROUTE,status:a.status,body:Buffer.from(await e.arrayBuffer()),headers:t},cacheControl:{revalidate:r,expire:n}}}}catch(t){throw(null==n?void 0:n.isStale)&&await A.onRequestError(e,t,{routerKind:"App Router",routePath:a,routeType:"route",revalidateReason:(0,f.getRevalidateReason)({isStaticGeneration:M,isOnDemandRevalidate:P})},!1,S),t}},d=await A.handleResponse({req:e,nextConfig:_,cacheKey:F,routeKind:n.RouteKind.APP_ROUTE,isFallback:!1,prerenderManifest:N,isRoutePPREnabled:!1,isOnDemandRevalidate:P,revalidateOnlyGenerated:T,responseGenerator:u,waitUntil:r.waitUntil,isMinimalMode:B});if(!q)return null;if((null==d||null==(o=d.value)?void 0:o.kind)!==w.CachedRouteKind.APP_ROUTE)throw Object.defineProperty(Error(`Invariant: app-route received invalid cache entry ${null==d||null==(l=d.value)?void 0:l.kind}`),"__NEXT_ERROR_CODE",{value:"E701",enumerable:!1,configurable:!0});B||t.setHeader("x-nextjs-cache",P?"REVALIDATED":d.isMiss?"MISS":d.isStale?"STALE":"HIT"),C&&t.setHeader("Cache-Control","private, no-cache, no-store, max-age=0, must-revalidate");let c=(0,g.fromNodeOutgoingHttpHeaders)(d.value.headers);return B&&q||c.delete(y.NEXT_CACHE_TAGS_HEADER),!d.cacheControl||t.getHeader("Cache-Control")||c.get("Cache-Control")||c.set("Cache-Control",(0,m.getCacheControlHeader)(d.cacheControl)),await (0,h.sendResponse)(V,W,new Response(d.value.body,{headers:c,status:d.value.status||200})),null};z&&L?await l(L):(i=U.getActiveScopeSpan(),await U.withPropagatedContext(e.headers,()=>U.trace(p.BaseServerSpan.handleRequest,{spanName:`${j} ${a}`,kind:o.SpanKind.SERVER,attributes:{"http.method":j,"http.target":e.url}},l),void 0,!z))}catch(t){if(t instanceof v.NoFallbackError||await A.onRequestError(e,t,{routerKind:"App Router",routePath:O,routeType:"route",revalidateReason:(0,f.getRevalidateReason)({isStaticGeneration:M,isOnDemandRevalidate:P})},!1,S),q)throw t;return await (0,h.sendResponse)(V,W,new Response(null,{status:500})),null}}e.s(["handler",0,E,"patchFetch",0,function(){return(0,i.patchFetch)({workAsyncStorage:_,workUnitAsyncStorage:x})},"routeModule",0,A,"serverHooks",0,C,"workAsyncStorage",0,_,"workUnitAsyncStorage",0,x]),r()}catch(e){r(e)}},!1),58502,e=>{e.v(t=>Promise.all(["server/chunks/[root-of-the-server]__1t2egm-._.js"].map(t=>e.l(t))).then(()=>t(51514)))},46128,e=>{e.v(t=>Promise.all(["server/chunks/[externals]_@huggingface_transformers_05bd-zz._.js"].map(t=>e.l(t))).then(()=>t(99732)))},35914,e=>{e.v(t=>Promise.all(["server/chunks/lib_db_ts_0h_yn5m._.js"].map(t=>e.l(t))).then(()=>t(62294)))},29363,e=>{e.v(e=>Promise.resolve().then(()=>e(34700)))},96359,e=>{e.v(t=>Promise.all(["server/chunks/node_modules_drizzle-orm_index_1qnscv7.js"].map(t=>e.l(t))).then(()=>t(32628)))}];
+
+//# sourceMappingURL=%5Broot-of-the-server%5D__008acf8._.js.map