@keystrokehq/keystroke 1.0.7 → 1.0.9

package/dist/trigger.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"trigger.mjs","names":[],"sources":["../../../node_modules/.pnpm/cron-schedule@6.0.0/node_modules/cron-schedule/dist/utils.js","../../../node_modules/.pnpm/cron-schedule@6.0.0/node_modules/cron-schedule/dist/cron.js","../../../node_modules/.pnpm/cron-schedule@6.0.0/node_modules/cron-schedule/dist/cron-parser.js","../../trigger/dist/index.mjs"],"sourcesContent":["export const TIMEOUT_MAX = 2147483647; // 2^31-1\n/**\n * Creates a new timeout, which can exceed the max timeout limit of 2^31-1.\n * Since multiple timeouts are used internally, the timeoutId used to clear the timeout\n * is returned as a handle (object) and changes whenever the max timeout limit is exceeded.\n * The handle parameter can be ignored, it is used internally for updating the timeoutId\n * in the handle after creating the next timeout.\n */\nexport function longTimeout(fn, timeout, previousHandle) {\n    let nextTimeout = timeout;\n    let remainingTimeout = 0;\n    if (nextTimeout > TIMEOUT_MAX) {\n        remainingTimeout = nextTimeout - TIMEOUT_MAX;\n        nextTimeout = TIMEOUT_MAX;\n    }\n    const handle = previousHandle !== null && previousHandle !== void 0 ? previousHandle : {\n        timeoutId: undefined,\n    };\n    handle.timeoutId = setTimeout(() => {\n        if (remainingTimeout > 0) {\n            longTimeout(fn, remainingTimeout, previousHandle);\n        }\n        else {\n            fn();\n        }\n    }, nextTimeout);\n    return handle;\n}\n/* Extracts second, minute, hour, date, month and the weekday from a date. */\nexport function extractDateElements(date) {\n    return {\n        second: date.getSeconds(),\n        minute: date.getMinutes(),\n        hour: date.getHours(),\n        day: date.getDate(),\n        month: date.getMonth(),\n        weekday: date.getDay(),\n        year: date.getFullYear(),\n    };\n}\n/* Gets the amount of days in the given month (indexed by 0) of the given year. */\nexport function getDaysInMonth(year, month) {\n    return new Date(year, month + 1, 0).getDate();\n}\n/* Gets the amount of days from weekday1 to weekday2. */\nexport function getDaysBetweenWeekdays(weekday1, weekday2) {\n    if (weekday1 <= weekday2) {\n        return weekday2 - weekday1;\n    }\n    return 6 - weekday1 + weekday2 + 1;\n}\nexport function wrapFunction(fn, errorHandler) {\n    return () => {\n        try {\n            const res = fn();\n            if (res instanceof Promise) {\n                res.catch((err) => {\n                    if (errorHandler) {\n                        errorHandler(err);\n                    }\n                });\n            }\n        }\n        catch (err) {\n            if (errorHandler) {\n                errorHandler(err);\n            }\n        }\n    };\n}\n//# sourceMappingURL=utils.js.map","import { extractDateElements, getDaysBetweenWeekdays, getDaysInMonth, } from './utils.js';\nexport class Cron {\n    constructor({ seconds, minutes, hours, days, months, weekdays, }) {\n        // Validate that there are values provided.\n        if (!seconds || seconds.size === 0)\n            throw new Error('There must be at least one allowed second.');\n        if (!minutes || minutes.size === 0)\n            throw new Error('There must be at least one allowed minute.');\n        if (!hours || hours.size === 0)\n            throw new Error('There must be at least one allowed hour.');\n        if (!months || months.size === 0)\n            throw new Error('There must be at least one allowed month.');\n        if ((!weekdays || weekdays.size === 0) && (!days || days.size === 0))\n            throw new Error('There must be at least one allowed day or weekday.');\n        // Convert set to array and sort in ascending order.\n        this.seconds = Array.from(seconds).sort((a, b) => a - b);\n        this.minutes = Array.from(minutes).sort((a, b) => a - b);\n        this.hours = Array.from(hours).sort((a, b) => a - b);\n        this.days = Array.from(days).sort((a, b) => a - b);\n        this.months = Array.from(months).sort((a, b) => a - b);\n        this.weekdays = Array.from(weekdays).sort((a, b) => a - b);\n        // Validate that all values are integers within the constraint.\n        const validateData = (name, data, constraint) => {\n            if (data.some((x) => typeof x !== 'number' ||\n                x % 1 !== 0 ||\n                x < constraint.min ||\n                x > constraint.max)) {\n                throw new Error(`${name} must only consist of integers which are within the range of ${constraint.min} and ${constraint.max}`);\n            }\n        };\n        validateData('seconds', this.seconds, { min: 0, max: 59 });\n        validateData('minutes', this.minutes, { min: 0, max: 59 });\n        validateData('hours', this.hours, { min: 0, max: 23 });\n        validateData('days', this.days, { min: 1, max: 31 });\n        validateData('months', this.months, { min: 0, max: 11 });\n        validateData('weekdays', this.weekdays, { min: 0, max: 6 });\n        // For each element, store a reversed copy in the reversed attribute for finding prev dates.\n        this.reversed = {\n            seconds: this.seconds.map((x) => x).reverse(),\n            minutes: this.minutes.map((x) => x).reverse(),\n            hours: this.hours.map((x) => x).reverse(),\n            days: this.days.map((x) => x).reverse(),\n            months: this.months.map((x) => x).reverse(),\n            weekdays: this.weekdays.map((x) => x).reverse(),\n        };\n    }\n    /**\n     * Find the next or previous hour, starting from the given start hour that matches the hour constraint.\n     * startHour itself might also be allowed.\n     */\n    findAllowedHour(dir, startHour) {\n        return dir === 'next'\n            ? this.hours.find((x) => x >= startHour)\n            : this.reversed.hours.find((x) => x <= startHour);\n    }\n    /**\n     * Find the next or previous minute, starting from the given start minute that matches the minute constraint.\n     * startMinute itself might also be allowed.\n     */\n    findAllowedMinute(dir, startMinute) {\n        return dir === 'next'\n            ? this.minutes.find((x) => x >= startMinute)\n            : this.reversed.minutes.find((x) => x <= startMinute);\n    }\n    /**\n     * Find the next or previous second, starting from the given start second that matches the second constraint.\n     * startSecond itself IS NOT allowed.\n     */\n    findAllowedSecond(dir, startSecond) {\n        return dir === 'next'\n            ? this.seconds.find((x) => x > startSecond)\n            : this.reversed.seconds.find((x) => x < startSecond);\n    }\n    /**\n     * Find the next or previous time, starting from the given start time that matches the hour, minute\n     * and second constraints. startTime itself might also be allowed.\n     */\n    findAllowedTime(dir, startTime) {\n        // Try to find an allowed hour.\n        let hour = this.findAllowedHour(dir, startTime.hour);\n        if (hour !== undefined) {\n            if (hour === startTime.hour) {\n                // We found an hour that is the start hour. Try to find an allowed minute.\n                let minute = this.findAllowedMinute(dir, startTime.minute);\n                if (minute !== undefined) {\n                    if (minute === startTime.minute) {\n                        // We found a minute that is the start minute. Try to find an allowed second.\n                        const second = this.findAllowedSecond(dir, startTime.second);\n                        if (second !== undefined) {\n                            // We found a second within the start hour and minute.\n                            return { hour, minute, second };\n                        }\n                        // We did not find a valid second within the start minute. Try to find another minute.\n                        minute = this.findAllowedMinute(dir, dir === 'next' ? startTime.minute + 1 : startTime.minute - 1);\n                        if (minute !== undefined) {\n                            // We found a minute which is not the start minute. Return that minute together with the hour and the first / last allowed second.\n                            return {\n                                hour,\n                                minute,\n                                second: dir === 'next' ? this.seconds[0] : this.reversed.seconds[0],\n                            };\n                        }\n                    }\n                    else {\n                        // We found a minute which is not the start minute. Return that minute together with the hour and the first / last allowed second.\n                        return {\n                            hour,\n                            minute,\n                            second: dir === 'next' ? this.seconds[0] : this.reversed.seconds[0],\n                        };\n                    }\n                }\n                // We did not find an allowed minute / second combination inside the start hour. Try to find the next / previous allowed hour.\n                hour = this.findAllowedHour(dir, dir === 'next' ? startTime.hour + 1 : startTime.hour - 1);\n                if (hour !== undefined) {\n                    // We found an allowed hour which is not the start hour. Return that hour together with the first / last allowed minutes / seconds.\n                    return {\n                        hour,\n                        minute: dir === 'next' ? this.minutes[0] : this.reversed.minutes[0],\n                        second: dir === 'next' ? this.seconds[0] : this.reversed.seconds[0],\n                    };\n                }\n            }\n            else {\n                // We found an allowed hour which is not the start hour. Return that hour together with the first / last allowed minutes / seconds.\n                return {\n                    hour,\n                    minute: dir === 'next' ? this.minutes[0] : this.reversed.minutes[0],\n                    second: dir === 'next' ? this.seconds[0] : this.reversed.seconds[0],\n                };\n            }\n        }\n        // No allowed time found.\n        return undefined;\n    }\n    /**\n     * Find the next or previous day in the given month, starting from the given startDay\n     * that matches either the day or the weekday constraint. startDay itself might also be allowed.\n     */\n    findAllowedDayInMonth(dir, year, month, startDay) {\n        var _a, _b;\n        if (startDay < 1)\n            throw new Error('startDay must not be smaller than 1.');\n        // If only days are restricted: allow day based on day constraint only.\n        // If only weekdays are restricted: allow day based on weekday constraint only.\n        // If both are restricted: allow day based on both day and weekday constraint. pick day that is closer to startDay.\n        // If none are restricted: return the day closest to startDay (respecting dir) that is allowed (or startDay itself).\n        const daysInMonth = getDaysInMonth(year, month);\n        const daysRestricted = this.days.length !== 31;\n        const weekdaysRestricted = this.weekdays.length !== 7;\n        if (!daysRestricted && !weekdaysRestricted) {\n            if (startDay > daysInMonth) {\n                return dir === 'next' ? undefined : daysInMonth;\n            }\n            return startDay;\n        }\n        // Try to find a day based on the days constraint.\n        let allowedDayByDays;\n        if (daysRestricted) {\n            allowedDayByDays =\n                dir === 'next'\n                    ? this.days.find((x) => x >= startDay)\n                    : this.reversed.days.find((x) => x <= startDay);\n            // Make sure the day does not exceed the amount of days in month.\n            if (allowedDayByDays !== undefined && allowedDayByDays > daysInMonth) {\n                allowedDayByDays = undefined;\n            }\n        }\n        // Try to find a day based on the weekday constraint.\n        let allowedDayByWeekdays;\n        if (weekdaysRestricted) {\n            const startWeekday = new Date(year, month, startDay).getDay();\n            const nearestAllowedWeekday = dir === 'next'\n                ? ((_a = this.weekdays.find((x) => x >= startWeekday)) !== null && _a !== void 0 ? _a : this.weekdays[0])\n                : ((_b = this.reversed.weekdays.find((x) => x <= startWeekday)) !== null && _b !== void 0 ? _b : this.reversed.weekdays[0]);\n            if (nearestAllowedWeekday !== undefined) {\n                const daysBetweenWeekdays = dir === 'next'\n                    ? getDaysBetweenWeekdays(startWeekday, nearestAllowedWeekday)\n                    : getDaysBetweenWeekdays(nearestAllowedWeekday, startWeekday);\n                allowedDayByWeekdays =\n                    dir === 'next'\n                        ? startDay + daysBetweenWeekdays\n                        : startDay - daysBetweenWeekdays;\n                // Make sure the day does not exceed the month boundaries.\n                if (allowedDayByWeekdays > daysInMonth || allowedDayByWeekdays < 1) {\n                    allowedDayByWeekdays = undefined;\n                }\n            }\n        }\n        if (allowedDayByDays !== undefined && allowedDayByWeekdays !== undefined) {\n            // If a day is found both via the days and the weekdays constraint, pick the day\n            // that is closer to start date.\n            return dir === 'next'\n                ? Math.min(allowedDayByDays, allowedDayByWeekdays)\n                : Math.max(allowedDayByDays, allowedDayByWeekdays);\n        }\n        if (allowedDayByDays !== undefined) {\n            return allowedDayByDays;\n        }\n        if (allowedDayByWeekdays !== undefined) {\n            return allowedDayByWeekdays;\n        }\n        return undefined;\n    }\n    /** Gets the next date starting from the given start date or now. */\n    getNextDate(startDate = new Date()) {\n        const startDateElements = extractDateElements(startDate);\n        let minYear = startDateElements.year;\n        let startIndexMonth = this.months.findIndex((x) => x >= startDateElements.month);\n        if (startIndexMonth === -1) {\n            startIndexMonth = 0;\n            minYear++;\n        }\n        // We try every month within the next 5 years to make sure that we tried to\n        // find a matching date insidde a whole leap year.\n        const maxIterations = this.months.length * 5;\n        for (let i = 0; i < maxIterations; i++) {\n            // Get the next year and month.\n            const year = minYear + Math.floor((startIndexMonth + i) / this.months.length);\n            const month = this.months[(startIndexMonth + i) % this.months.length];\n            const isStartMonth = year === startDateElements.year && month === startDateElements.month;\n            // Find the next day.\n            let day = this.findAllowedDayInMonth('next', year, month, isStartMonth ? startDateElements.day : 1);\n            let isStartDay = isStartMonth && day === startDateElements.day;\n            // If we found a day and it is the start day, try to find a valid time beginning from the start date time.\n            if (day !== undefined && isStartDay) {\n                const nextTime = this.findAllowedTime('next', startDateElements);\n                if (nextTime !== undefined) {\n                    return new Date(year, month, day, nextTime.hour, nextTime.minute, nextTime.second);\n                }\n                // If no valid time has been found for the start date, try the next day.\n                day = this.findAllowedDayInMonth('next', year, month, day + 1);\n                isStartDay = false;\n            }\n            // If we found a next day and it is not the start day, just use the next day with the first allowed values\n            // for hours, minutes and seconds.\n            if (day !== undefined && !isStartDay) {\n                return new Date(year, month, day, this.hours[0], this.minutes[0], this.seconds[0]);\n            }\n            // No allowed day has been found for this month. Continue to search in next month.\n        }\n        throw new Error('No valid next date was found.');\n    }\n    /** Gets the specified amount of future dates starting from the given start date or now. */\n    getNextDates(amount, startDate) {\n        const dates = [];\n        let nextDate;\n        for (let i = 0; i < amount; i++) {\n            nextDate = this.getNextDate(nextDate !== null && nextDate !== void 0 ? nextDate : startDate);\n            dates.push(nextDate);\n        }\n        return dates;\n    }\n    /**\n     * Get an ES6 compatible iterator which iterates over the next dates starting from startDate or now.\n     * The iterator runs until the optional endDate is reached or forever.\n     */\n    *getNextDatesIterator(startDate, endDate) {\n        let nextDate;\n        while (true) {\n            nextDate = this.getNextDate(nextDate !== null && nextDate !== void 0 ? nextDate : startDate);\n            if (endDate && endDate.getTime() < nextDate.getTime()) {\n                return;\n            }\n            yield nextDate;\n        }\n    }\n    /** Gets the previous date starting from the given start date or now. */\n    getPrevDate(startDate = new Date()) {\n        const startDateElements = extractDateElements(startDate);\n        let maxYear = startDateElements.year;\n        let startIndexMonth = this.reversed.months.findIndex((x) => x <= startDateElements.month);\n        if (startIndexMonth === -1) {\n            startIndexMonth = 0;\n            maxYear--;\n        }\n        // We try every month within the past 5 years to make sure that we tried to\n        // find a matching date inside a whole leap year.\n        const maxIterations = this.reversed.months.length * 5;\n        for (let i = 0; i < maxIterations; i++) {\n            // Get the next year and month.\n            const year = maxYear -\n                Math.floor((startIndexMonth + i) / this.reversed.months.length);\n            const month = this.reversed.months[(startIndexMonth + i) % this.reversed.months.length];\n            const isStartMonth = year === startDateElements.year && month === startDateElements.month;\n            // Find the previous day.\n            let day = this.findAllowedDayInMonth('prev', year, month, isStartMonth\n                ? startDateElements.day\n                : // Start searching from the last day of the month.\n                    getDaysInMonth(year, month));\n            let isStartDay = isStartMonth && day === startDateElements.day;\n            // If we found a day and it is the start day, try to find a valid time beginning from the start date time.\n            if (day !== undefined && isStartDay) {\n                const prevTime = this.findAllowedTime('prev', startDateElements);\n                if (prevTime !== undefined) {\n                    return new Date(year, month, day, prevTime.hour, prevTime.minute, prevTime.second);\n                }\n                // If no valid time has been found for the start date, try the previous day.\n                if (day > 1) {\n                    day = this.findAllowedDayInMonth('prev', year, month, day - 1);\n                    isStartDay = false;\n                }\n            }\n            // If we found a previous day and it is not the start day, just use the previous day with the first allowed values\n            // for hours, minutes and seconds (which will be the latest time due to using the reversed array).\n            if (day !== undefined && !isStartDay) {\n                return new Date(year, month, day, this.reversed.hours[0], this.reversed.minutes[0], this.reversed.seconds[0]);\n            }\n            // No allowed day has been found for this month. Continue to search in previous month.\n        }\n        throw new Error('No valid previous date was found.');\n    }\n    /** Gets the specified amount of previous dates starting from the given start date or now. */\n    getPrevDates(amount, startDate) {\n        const dates = [];\n        let prevDate;\n        for (let i = 0; i < amount; i++) {\n            prevDate = this.getPrevDate(prevDate !== null && prevDate !== void 0 ? prevDate : startDate);\n            dates.push(prevDate);\n        }\n        return dates;\n    }\n    /**\n     * Get an ES6 compatible iterator which iterates over the previous dates starting from startDate or now.\n     * The iterator runs until the optional endDate is reached or forever.\n     */\n    *getPrevDatesIterator(startDate, endDate) {\n        let prevDate;\n        while (true) {\n            prevDate = this.getPrevDate(prevDate !== null && prevDate !== void 0 ? prevDate : startDate);\n            if (endDate && endDate.getTime() > prevDate.getTime()) {\n                return;\n            }\n            yield prevDate;\n        }\n    }\n    /** Returns true when there is a cron date at the given date. */\n    matchDate(date) {\n        const { second, minute, hour, day, month, weekday } = extractDateElements(date);\n        if (this.seconds.indexOf(second) === -1 ||\n            this.minutes.indexOf(minute) === -1 ||\n            this.hours.indexOf(hour) === -1 ||\n            this.months.indexOf(month) === -1) {\n            return false;\n        }\n        if (this.days.length !== 31 && this.weekdays.length !== 7) {\n            return (this.days.indexOf(day) !== -1 || this.weekdays.indexOf(weekday) !== -1);\n        }\n        return (this.days.indexOf(day) !== -1 && this.weekdays.indexOf(weekday) !== -1);\n    }\n}\n//# sourceMappingURL=cron.js.map","import { Cron } from './cron.js';\nconst secondConstraint = {\n    min: 0,\n    max: 59,\n};\nconst minuteConstraint = {\n    min: 0,\n    max: 59,\n};\nconst hourConstraint = {\n    min: 0,\n    max: 23,\n};\nconst dayConstraint = {\n    min: 1,\n    max: 31,\n};\nconst monthConstraint = {\n    min: 1,\n    max: 12,\n    aliases: {\n        jan: '1',\n        feb: '2',\n        mar: '3',\n        apr: '4',\n        may: '5',\n        jun: '6',\n        jul: '7',\n        aug: '8',\n        sep: '9',\n        oct: '10',\n        nov: '11',\n        dec: '12',\n    },\n};\nconst weekdayConstraint = {\n    min: 0,\n    max: 7,\n    aliases: {\n        mon: '1',\n        tue: '2',\n        wed: '3',\n        thu: '4',\n        fri: '5',\n        sat: '6',\n        sun: '7',\n    },\n};\nconst timeNicknames = {\n    '@yearly': '0 0 1 1 *',\n    '@annually': '0 0 1 1 *',\n    '@monthly': '0 0 1 * *',\n    '@weekly': '0 0 * * 0',\n    '@daily': '0 0 * * *',\n    '@hourly': '0 * * * *',\n    '@minutely': '* * * * *',\n};\nfunction parseElement(element, constraint) {\n    const result = new Set();\n    // If returned set of numbers is empty, the scheduler class interpretes the emtpy set of numbers as all valid values of the constraint\n    if (element === '*') {\n        for (let i = constraint.min; i <= constraint.max; i = i + 1) {\n            result.add(i);\n        }\n        return result;\n    }\n    // If the element is a list, parse each element in the list.\n    const listElements = element.split(',');\n    if (listElements.length > 1) {\n        for (const listElement of listElements) {\n            const parsedListElement = parseElement(listElement, constraint);\n            for (const x of parsedListElement) {\n                result.add(x);\n            }\n        }\n        return result;\n    }\n    // Helper function to parse a single element, which includes checking for alias, valid number and constraint min and max.\n    const parseSingleElement = (singleElement) => {\n        var _a, _b;\n        singleElement =\n            (_b = (_a = constraint.aliases) === null || _a === void 0 ? void 0 : _a[singleElement.toLowerCase()]) !== null && _b !== void 0 ? _b : singleElement;\n        const parsedElement = Number.parseInt(singleElement, 10);\n        if (Number.isNaN(parsedElement)) {\n            throw new Error(`Failed to parse ${element}: ${singleElement} is NaN.`);\n        }\n        if (parsedElement < constraint.min || parsedElement > constraint.max) {\n            throw new Error(`Failed to parse ${element}: ${singleElement} is outside of constraint range of ${constraint.min} - ${constraint.max}.`);\n        }\n        return parsedElement;\n    };\n    // Detect if the element is a range.\n    // Possible range formats: 'start-end', 'start-end/step', '*', '*/step'.\n    // Where start and end can be numbers or aliases.\n    // Capture groups: 1: start-end, 2: start, 3: end, 4: /step, 5: step.\n    const rangeSegments = /^(([0-9a-zA-Z]+)-([0-9a-zA-Z]+)|\\*)(\\/([0-9]+))?$/.exec(element);\n    // If not, it must be a single element.\n    if (rangeSegments === null) {\n        result.add(parseSingleElement(element));\n        return result;\n    }\n    // If it is a range, get start and end of the range.\n    let parsedStart = rangeSegments[1] === '*'\n        ? constraint.min\n        : parseSingleElement(rangeSegments[2]);\n    const parsedEnd = rangeSegments[1] === '*'\n        ? constraint.max\n        : parseSingleElement(rangeSegments[3]);\n    // need to catch Sunday, which gets parsed here as 7, but is also legitimate at the start of a range as 0, to avoid the out of order error\n    if (constraint === weekdayConstraint &&\n        parsedStart === 7 &&\n        // this check ensures that sun-sun is not incorrectly parsed as [0,1,2,3,4,5,6]\n        parsedEnd !== 7) {\n        parsedStart = 0;\n    }\n    if (parsedStart > parsedEnd) {\n        throw new Error(`Failed to parse ${element}: Invalid range (start: ${parsedStart}, end: ${parsedEnd}).`);\n    }\n    // Check whether there is a custom step defined for the range, defaulting to 1.\n    const step = rangeSegments[5];\n    let parsedStep = 1;\n    if (step !== undefined) {\n        parsedStep = Number.parseInt(step, 10);\n        if (Number.isNaN(parsedStep)) {\n            throw new Error(`Failed to parse step: ${step} is NaN.`);\n        }\n        if (parsedStep < 1) {\n            throw new Error(`Failed to parse step: Expected ${step} to be greater than 0.`);\n        }\n    }\n    // Go from start to end of the range by the given steps.\n    for (let i = parsedStart; i <= parsedEnd; i = i + parsedStep) {\n        result.add(i);\n    }\n    return result;\n}\n/** Parses a cron expression into a Cron instance. */\nexport function parseCronExpression(cronExpression) {\n    var _a;\n    if (typeof cronExpression !== 'string') {\n        throw new TypeError('Invalid cron expression: must be of type string.');\n    }\n    // Convert time nicknames.\n    cronExpression = (_a = timeNicknames[cronExpression.toLowerCase()]) !== null && _a !== void 0 ? _a : cronExpression;\n    // Split the cron expression into its elements, removing empty elements (extra whitespaces).\n    const elements = cronExpression.split(' ').filter((elem) => elem.length > 0);\n    if (elements.length < 5 || elements.length > 6) {\n        throw new Error('Invalid cron expression: expected 5 or 6 elements.');\n    }\n    const rawSeconds = elements.length === 6 ? elements[0] : '0';\n    const rawMinutes = elements.length === 6 ? elements[1] : elements[0];\n    const rawHours = elements.length === 6 ? elements[2] : elements[1];\n    const rawDays = elements.length === 6 ? elements[3] : elements[2];\n    const rawMonths = elements.length === 6 ? elements[4] : elements[3];\n    const rawWeekdays = elements.length === 6 ? elements[5] : elements[4];\n    return new Cron({\n        seconds: parseElement(rawSeconds, secondConstraint),\n        minutes: parseElement(rawMinutes, minuteConstraint),\n        hours: parseElement(rawHours, hourConstraint),\n        days: parseElement(rawDays, dayConstraint),\n        // months in cron are indexed by 1, but Cron expects indexes by 0, so we need to reduce all set values by one.\n        months: new Set(Array.from(parseElement(rawMonths, monthConstraint)).map((x) => x - 1)),\n        weekdays: new Set(Array.from(parseElement(rawWeekdays, weekdayConstraint)).map((x) => x % 7)),\n    });\n}\n//# sourceMappingURL=cron-parser.js.map","import { parseCronExpression } from \"cron-schedule\";\nimport { z } from \"zod\";\nimport { isWorkflow } from \"@keystrokehq/workflow\";\n//#region src/cron/cron-schedule.ts\n/**\n* Validates and brands a cron expression. Accepts anything the `cron-schedule`\n* engine accepts (5/6 fields, named months/weekdays, `@daily`-style nicknames)\n* so authoring validation never rejects a schedule the scheduler can run. The\n* `.brand()` makes `CronSchedule` nominally distinct from a plain `string`, so\n* a raw string can't be passed where a validated schedule is expected.\n*/\nconst cronScheduleSchema = z.string().trim().min(1, \"cron schedule must be a non-empty string\").refine(isParseableCron, \"must be a valid cron expression\").brand();\n/** Parse/validate an arbitrary value into a branded `CronSchedule` (throws on failure). */\nfunction parseCronSchedule(value) {\n\treturn cronScheduleSchema.parse(value);\n}\n/**\n* Resolves the effective schedule for an attachment, applying overrides by\n* precedence: per-attachment override → global override → the authored\n* schedule. Pure string precedence — no cron parsing.\n*/\nfunction resolveCronSchedule(attachmentId, schedule, options) {\n\treturn options.attachmentScheduleOverrides?.[attachmentId] ?? options.cronScheduleOverride ?? schedule;\n}\n/** Parse a schedule into a `cron-schedule` `Cron` instance (throws on invalid input). */\nfunction parseTriggerSchedule(schedule) {\n\treturn toCron(schedule);\n}\n/** The next time the schedule fires at or after `from`. */\nfunction nextTriggerRunAt(schedule, from = /* @__PURE__ */ new Date()) {\n\treturn toCron(schedule).getNextDate(from);\n}\n/**\n* Single touchpoint for the `cron-schedule` library — every parse, validation,\n* and next-run calculation in this package goes through here.\n*/\nfunction toCron(schedule) {\n\treturn parseCronExpression(schedule);\n}\nfunction isParseableCron(value) {\n\ttry {\n\t\ttoCron(value);\n\t\treturn true;\n\t} catch {\n\t\treturn false;\n\t}\n}\n//#endregion\n//#region src/attachment-definition.ts\nconst zodSchema = z.custom((v) => v instanceof z.ZodType, \"must be a Zod schema\");\nconst workflowSchema = z.custom((v) => isWorkflow(v), \"must be defineWorkflow(...)\");\nconst agentSchema = z.custom((v) => typeof v === \"object\" && v !== null && typeof v.slug === \"string\" && v.slug.trim().length > 0 && typeof v.prompt === \"function\", \"must be defineAgent(...)\");\nconst promptSchema = z.union([z.string(), z.function()]);\nconst baseSourceShape = {\n\tkey: z.string().trim().min(1),\n\tattach: z.function()\n};\nconst webhookSourceSchema = z.object({\n\tkind: z.literal(\"webhook\"),\n\t...baseSourceShape,\n\tendpoint: z.string().min(1),\n\trequest: zodSchema,\n\tfilter: zodSchema.optional(),\n\tpasses: z.function()\n});\nconst cronSourceSchema = z.object({\n\tkind: z.literal(\"cron\"),\n\t...baseSourceShape,\n\tschedule: cronScheduleSchema\n});\nconst pollSourceSchema = z.object({\n\tkind: z.literal(\"poll\"),\n\t...baseSourceShape,\n\tid: z.string().optional(),\n\tschedule: cronScheduleSchema,\n\trun: z.function(),\n\tfilters: z.array(z.function()),\n\tpasses: z.function()\n});\n/** Runtime validation for a trigger source (webhook | cron | poll). */\nconst triggerSourceSchema = z.discriminatedUnion(\"kind\", [\n\twebhookSourceSchema,\n\tcronSourceSchema,\n\tpollSourceSchema\n]);\nconst workflowAttachmentSchema = z.object({\n\tkey: z.string().trim().min(1),\n\tsource: triggerSourceSchema,\n\ttarget: z.literal(\"workflow\"),\n\tworkflow: workflowSchema,\n\ttransform: z.function().optional()\n});\nconst agentAttachmentSchema = z.object({\n\tkey: z.string().trim().min(1),\n\tsource: triggerSourceSchema,\n\ttarget: z.literal(\"agent\"),\n\tagent: agentSchema,\n\tprompt: promptSchema\n});\n/** Runtime validation for an unbranded trigger attachment. */\nconst triggerAttachmentCoreSchema = z.discriminatedUnion(\"target\", [workflowAttachmentSchema, agentAttachmentSchema]);\nconst TRIGGER_ATTACHMENT = Symbol.for(\"keystroke.triggerAttachment\");\n/**\n* Validates brand + shape via `triggerAttachmentCoreSchema` so server discovery\n* rejects unbranded or malformed attachments.\n*/\nfunction isTriggerAttachment(value) {\n\tif (typeof value !== \"object\" || value === null) return false;\n\tif (!(TRIGGER_ATTACHMENT in value) || value[TRIGGER_ATTACHMENT] !== true) return false;\n\treturn triggerAttachmentCoreSchema.safeParse(value).success;\n}\nfunction isWorkflowTriggerAttachment(attachment) {\n\treturn attachment.target === \"workflow\";\n}\nfunction isAgentTriggerAttachment(attachment) {\n\treturn attachment.target === \"agent\";\n}\n//#endregion\n//#region src/attachment-key.ts\nfunction workflowKeyFromDefinition(workflow) {\n\tconst slug = workflow.slug?.trim();\n\tif (!slug) throw new Error(\"Workflow definition requires a non-empty slug\");\n\treturn slug;\n}\nfunction agentKeyFromAgent(agent) {\n\tconst slug = agent.slug?.trim();\n\tif (!slug) throw new Error(\"Agent definition requires a non-empty slug\");\n\treturn slug;\n}\nfunction attachmentKeyFrom(triggerKey, targetKey) {\n\treturn `${triggerKey}:${targetKey}`;\n}\n//#endregion\n//#region src/attach-options.ts\nfunction isAgentAttachOptions(options) {\n\treturn \"agent\" in options;\n}\n//#endregion\n//#region src/define-trigger-attachment.ts\n/**\n* Internal helper used by source `.attach()` factories. Validates the\n* attachment shape against `triggerAttachmentCoreSchema` and applies the\n* `TRIGGER_ATTACHMENT` brand.\n*/\nfunction defineTriggerAttachment(input) {\n\tconst result = triggerAttachmentCoreSchema.safeParse(input);\n\tif (!result.success) throw new Error(`Invalid trigger attachment: ${formatIssues(result.error.issues)}`);\n\treturn {\n\t\t...input,\n\t\t[TRIGGER_ATTACHMENT]: true\n\t};\n}\nfunction formatIssues(issues) {\n\treturn issues.map((issue) => {\n\t\treturn `${issue.path.length > 0 ? `${issue.path.join(\".\")}: ` : \"\"}${issue.message}`;\n\t}).join(\"; \");\n}\n//#endregion\n//#region src/attach-from-source.ts\nfunction attachFromSource(source, triggerKey, options) {\n\tif (isAgentAttachOptions(options)) return defineTriggerAttachment({\n\t\tkey: attachmentKeyFrom(triggerKey, agentKeyFromAgent(options.agent)),\n\t\tsource,\n\t\ttarget: \"agent\",\n\t\tagent: options.agent,\n\t\tprompt: options.prompt\n\t});\n\treturn defineTriggerAttachment({\n\t\tkey: attachmentKeyFrom(triggerKey, workflowKeyFromDefinition(options.workflow)),\n\t\tsource,\n\t\ttarget: \"workflow\",\n\t\tworkflow: options.workflow,\n\t\ttransform: options.transform\n\t});\n}\n//#endregion\n//#region src/trigger-match-schema.ts\nfunction matchShapeAndFilter(shape, filter, payload) {\n\tconst shaped = shape.safeParse(payload);\n\tif (!shaped.success) return;\n\tif (filter && !filter.safeParse(shaped.data).success) return;\n\treturn shaped.data;\n}\nfunction passesShapeAndFilter(shape, filter, payload) {\n\treturn matchShapeAndFilter(shape, filter, payload) !== void 0;\n}\nfunction matchWebhookPayload(raw, schemas) {\n\tconst matches = [];\n\tif (typeof z.fromJSONSchema !== \"function\") throw new Error(\"z.fromJSONSchema is required for JSON schema matching\");\n\tfor (const schema of schemas) {\n\t\tconst data = matchShapeAndFilter(z.fromJSONSchema(schema.requestSchema), schema.filterSchema ? z.fromJSONSchema(schema.filterSchema) : void 0, raw);\n\t\tif (data === void 0) continue;\n\t\tmatches.push({\n\t\t\tattachmentKey: schema.attachmentKey,\n\t\t\tdata\n\t\t});\n\t}\n\treturn matches;\n}\n/** Live Zod validation for webhook `request` + optional Zod `filter` (in-process paths). */\nfunction passesTriggerMatch(shape, filter, payload) {\n\treturn passesShapeAndFilter(shape, filter, payload);\n}\n//#endregion\n//#region src/sources/webhook-source.ts\nfunction normalizeWebhookEndpoint(endpoint) {\n\treturn endpoint.replace(/^\\/+|\\/+$/g, \"\").replace(/^triggers\\/?/, \"\");\n}\nfunction webhookFilterSchema(filter) {\n\tif (filter instanceof z.ZodObject) return filter.loose();\n\treturn filter;\n}\n/**\n* Defines a webhook trigger source — fires its attached workflow when a request\n* hits `/triggers/{endpoint}` and satisfies `request` plus any optional `filter`.\n*\n* @param options.key - Stable trigger key; attachment id is `{key}:{workflowKey}`.\n* @param options.endpoint - Shared route suffix under `/triggers/` (e.g. `\"stripe\"`).\n*/\nfunction defineWebhookSource(options) {\n\tconst triggerKey = options.key.trim();\n\tif (!triggerKey) throw new Error(\"defineWebhookSource requires a non-empty key\");\n\tconst endpoint = normalizeWebhookEndpoint(options.endpoint);\n\tif (!endpoint) throw new Error(\"defineWebhookSource requires a non-empty endpoint\");\n\tconst filter = options.filter ? webhookFilterSchema(options.filter) : void 0;\n\tconst source = {\n\t\tkind: \"webhook\",\n\t\tkey: triggerKey,\n\t\tendpoint,\n\t\trequest: options.request,\n\t\tfilter,\n\t\tpasses(payload) {\n\t\t\treturn passesTriggerMatch(options.request, filter, payload);\n\t\t},\n\t\tattach(attachOptions) {\n\t\t\treturn attachFromSource(source, triggerKey, attachOptions);\n\t\t}\n\t};\n\treturn source;\n}\n//#endregion\n//#region src/sources/cron-source.ts\n/**\n* Defines a cron trigger source — fires its attached workflow on a schedule.\n*\n* @param options.key - Stable trigger key; the attachment id is `{key}:{workflowKey}`.\n* @param options.schedule - A cron expression. Pass a 5-field literal (e.g.\n*   `\"0 9 * * *\"`) for compile-time shape checking, or wrap with\n*   `parseCronSchedule(...)` for 6-field, named (`MON`), or `@daily`-style\n*   schedules. Validated at runtime; throws if the expression is invalid.\n* @example\n* defineCronSource({ key: \"morning\", schedule: \"0 9 * * *\" }).attach({ workflow });\n*/\nfunction defineCronSource(options) {\n\tconst triggerKey = options.key.trim();\n\tif (!triggerKey) throw new Error(\"defineCronSource requires a non-empty key\");\n\tconst source = {\n\t\tkind: \"cron\",\n\t\tkey: triggerKey,\n\t\tschedule: parseCronSchedule(options.schedule),\n\t\tattach(attachOptions) {\n\t\t\treturn attachFromSource(source, triggerKey, attachOptions);\n\t\t}\n\t};\n\treturn source;\n}\n//#endregion\n//#region src/sources/poll-source.ts\n/**\n* Defines a poll trigger source — runs `run` on a schedule and, when the result\n* passes any `.filter(...)`, fires the attached workflow with it.\n*\n* @param options.key - Stable trigger key; the attachment id is `{key}:{workflowKey}`.\n* @param options.id - Optional group id; poll sources sharing an id poll together.\n* @param options.schedule - Cron expression for the poll cadence (see `defineCronSource`).\n* @param options.run - Produces the payload checked by `filter` and passed to the workflow.\n* @param options.filter - Source-level predicate; the workflow only fires when it returns true.\n* @example\n* definePollSource({ key: \"inbox\", schedule: \"0 * * * *\", run: fetchInbox })\n*   .filter((r) => r.length > 0)\n*   .attach({ workflow });\n*/\nfunction definePollSource(options) {\n\tconst triggerKey = options.key.trim();\n\tif (!triggerKey) throw new Error(\"definePollSource requires a non-empty key\");\n\tconst schedule = parseCronSchedule(options.schedule);\n\tconst filters = [];\n\tif (options.filter) filters.push(options.filter);\n\tconst source = {\n\t\tkind: \"poll\",\n\t\tkey: triggerKey,\n\t\tid: options.id,\n\t\tschedule,\n\t\trun: options.run,\n\t\tfilters,\n\t\tpasses(payload) {\n\t\t\treturn source.filters.every((candidate) => candidate(payload));\n\t\t},\n\t\tattach(attachOptions) {\n\t\t\treturn attachFromSource(source, triggerKey, attachOptions);\n\t\t}\n\t};\n\tconst chain = source;\n\tchain.filter = (fn) => {\n\t\tsource.filters.push(fn);\n\t\treturn chain;\n\t};\n\treturn chain;\n}\n//#endregion\n//#region src/ephemeral-match.ts\nfunction emptyObjectSchema() {\n\treturn {\n\t\ttype: \"object\",\n\t\tproperties: {},\n\t\trequired: []\n\t};\n}\nfunction setConstAtPath(schema, path, value) {\n\tconst [head, ...rest] = path;\n\tif (!head) return;\n\tif (!schema.required.includes(head)) schema.required.push(head);\n\tif (rest.length === 0) {\n\t\tschema.properties[head] = { const: value };\n\t\treturn;\n\t}\n\tconst existing = schema.properties[head];\n\tconst child = existing && typeof existing === \"object\" && existing.type === \"object\" ? existing : emptyObjectSchema();\n\tschema.properties[head] = child;\n\tsetConstAtPath(child, rest, value);\n}\n/**\n* Compiles a shallow `match` object into a JSON Schema usable as a stored webhook\n* `requestSchema`. Dots in keys are treated as path separators; an empty match\n* produces a schema that accepts any JSON object payload.\n*/\nfunction matchToJsonSchema(match) {\n\tconst schema = emptyObjectSchema();\n\tfor (const [path, value] of Object.entries(match)) setConstAtPath(schema, path.split(\".\").filter((segment) => segment.length > 0), value);\n\tif (schema.required.length === 0) return { type: \"object\" };\n\treturn schema;\n}\n//#endregion\n//#region src/interpolate-prompt.ts\nfunction resolvePath(payload, path) {\n\tlet current = payload;\n\tfor (const segment of path) {\n\t\tif (current === null || typeof current !== \"object\") return;\n\t\tcurrent = current[segment];\n\t}\n\treturn current;\n}\n/**\n* Resolves `{{path}}` / `{{payload.path}}` dot-path tokens in an ephemeral trigger\n* prompt against the webhook payload. Unresolved tokens are left untouched so the\n* agent can see what failed to bind.\n*/\nfunction interpolatePrompt(template, payload) {\n\treturn template.replace(/\\{\\{\\s*([\\w.$-]+)\\s*\\}\\}/g, (token, rawPath) => {\n\t\tconst segments = rawPath.split(\".\");\n\t\tif (segments[0] === \"payload\") segments.shift();\n\t\tconst value = segments.length === 0 ? payload : resolvePath(payload, segments);\n\t\tif (value === void 0) return token;\n\t\treturn typeof value === \"string\" ? value : JSON.stringify(value);\n\t});\n}\n//#endregion\n//#region src/resolve-agent-prompt.ts\n/** Resolves the agent prompt for a validated trigger payload. */\nfunction resolveAgentPrompt(attachment, payload) {\n\tconst prompt = attachment.prompt;\n\tif (typeof prompt === \"function\") return prompt(payload ?? {});\n\treturn prompt;\n}\n//#endregion\n//#region src/resolve-attachment-input.ts\nfunction applyAttachmentTransform(attachment, payload) {\n\treturn attachment.transform ? attachment.transform(payload) : payload;\n}\n/**\n* Applies attachment `transform` to a payload that already passed source validation.\n* Webhook payloads are matched at ingress via persisted Zod JSON schemas.\n*/\nfunction resolveAttachmentTransform(attachment, payload) {\n\tif (isAgentTriggerAttachment(attachment)) return payload;\n\treturn applyAttachmentTransform(attachment, payload);\n}\n/** Applies poll source filters and attachment `transform`. Webhook ingress already matched Zod schemas. */\nfunction resolveAttachmentInput(attachment, payload) {\n\tconst source = attachment.source;\n\tif (source.kind === \"poll\" && !source.passes(payload)) return;\n\tif (isAgentTriggerAttachment(attachment)) return payload;\n\treturn applyAttachmentTransform(attachment, payload);\n}\n//#endregion\nexport { TRIGGER_ATTACHMENT, cronScheduleSchema, defineCronSource, definePollSource, defineWebhookSource, interpolatePrompt, isAgentTriggerAttachment, isTriggerAttachment, isWorkflowTriggerAttachment, matchToJsonSchema, matchWebhookPayload, nextTriggerRunAt, normalizeWebhookEndpoint, parseCronSchedule, parseTriggerSchedule, resolveAgentPrompt, resolveAttachmentInput, resolveAttachmentTransform, resolveCronSchedule };\n\n//# sourceMappingURL=index.mjs.map"],"x_google_ignoreList":[0,1,2],"mappings":";;;AA6BA,SAAgB,oBAAoB,MAAM;CACtC,OAAO;EACH,QAAQ,KAAK,WAAW;EACxB,QAAQ,KAAK,WAAW;EACxB,MAAM,KAAK,SAAS;EACpB,KAAK,KAAK,QAAQ;EAClB,OAAO,KAAK,SAAS;EACrB,SAAS,KAAK,OAAO;EACrB,MAAM,KAAK,YAAY;CAC3B;AACJ;AAEA,SAAgB,eAAe,MAAM,OAAO;CACxC,OAAO,IAAI,KAAK,MAAM,QAAQ,GAAG,CAAC,EAAE,QAAQ;AAChD;AAEA,SAAgB,uBAAuB,UAAU,UAAU;CACvD,IAAI,YAAY,UACZ,OAAO,WAAW;CAEtB,OAAO,IAAI,WAAW,WAAW;AACrC;;;ACjDA,IAAa,OAAb,MAAkB;CACd,YAAY,EAAE,SAAS,SAAS,OAAO,MAAM,QAAQ,YAAa;EAE9D,IAAI,CAAC,WAAW,QAAQ,SAAS,GAC7B,MAAM,IAAI,MAAM,4CAA4C;EAChE,IAAI,CAAC,WAAW,QAAQ,SAAS,GAC7B,MAAM,IAAI,MAAM,4CAA4C;EAChE,IAAI,CAAC,SAAS,MAAM,SAAS,GACzB,MAAM,IAAI,MAAM,0CAA0C;EAC9D,IAAI,CAAC,UAAU,OAAO,SAAS,GAC3B,MAAM,IAAI,MAAM,2CAA2C;EAC/D,KAAK,CAAC,YAAY,SAAS,SAAS,OAAO,CAAC,QAAQ,KAAK,SAAS,IAC9D,MAAM,IAAI,MAAM,oDAAoD;EAExE,KAAK,UAAU,MAAM,KAAK,OAAO,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;EACvD,KAAK,UAAU,MAAM,KAAK,OAAO,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;EACvD,KAAK,QAAQ,MAAM,KAAK,KAAK,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;EACnD,KAAK,OAAO,MAAM,KAAK,IAAI,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;EACjD,KAAK,SAAS,MAAM,KAAK,MAAM,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;EACrD,KAAK,WAAW,MAAM,KAAK,QAAQ,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;EAEzD,MAAM,gBAAgB,MAAM,MAAM,eAAe;GAC7C,IAAI,KAAK,MAAM,MAAM,OAAO,MAAM,YAC9B,IAAI,MAAM,KACV,IAAI,WAAW,OACf,IAAI,WAAW,GAAG,GAClB,MAAM,IAAI,MAAM,GAAG,KAAK,+DAA+D,WAAW,IAAI,OAAO,WAAW,KAAK;EAErI;EACA,aAAa,WAAW,KAAK,SAAS;GAAE,KAAK;GAAG,KAAK;EAAG,CAAC;EACzD,aAAa,WAAW,KAAK,SAAS;GAAE,KAAK;GAAG,KAAK;EAAG,CAAC;EACzD,aAAa,SAAS,KAAK,OAAO;GAAE,KAAK;GAAG,KAAK;EAAG,CAAC;EACrD,aAAa,QAAQ,KAAK,MAAM;GAAE,KAAK;GAAG,KAAK;EAAG,CAAC;EACnD,aAAa,UAAU,KAAK,QAAQ;GAAE,KAAK;GAAG,KAAK;EAAG,CAAC;EACvD,aAAa,YAAY,KAAK,UAAU;GAAE,KAAK;GAAG,KAAK;EAAE,CAAC;EAE1D,KAAK,WAAW;GACZ,SAAS,KAAK,QAAQ,KAAK,MAAM,CAAC,EAAE,QAAQ;GAC5C,SAAS,KAAK,QAAQ,KAAK,MAAM,CAAC,EAAE,QAAQ;GAC5C,OAAO,KAAK,MAAM,KAAK,MAAM,CAAC,EAAE,QAAQ;GACxC,MAAM,KAAK,KAAK,KAAK,MAAM,CAAC,EAAE,QAAQ;GACtC,QAAQ,KAAK,OAAO,KAAK,MAAM,CAAC,EAAE,QAAQ;GAC1C,UAAU,KAAK,SAAS,KAAK,MAAM,CAAC,EAAE,QAAQ;EAClD;CACJ;;;;;CAKA,gBAAgB,KAAK,WAAW;EAC5B,OAAO,QAAQ,SACT,KAAK,MAAM,MAAM,MAAM,KAAK,SAAS,IACrC,KAAK,SAAS,MAAM,MAAM,MAAM,KAAK,SAAS;CACxD;;;;;CAKA,kBAAkB,KAAK,aAAa;EAChC,OAAO,QAAQ,SACT,KAAK,QAAQ,MAAM,MAAM,KAAK,WAAW,IACzC,KAAK,SAAS,QAAQ,MAAM,MAAM,KAAK,WAAW;CAC5D;;;;;CAKA,kBAAkB,KAAK,aAAa;EAChC,OAAO,QAAQ,SACT,KAAK,QAAQ,MAAM,MAAM,IAAI,WAAW,IACxC,KAAK,SAAS,QAAQ,MAAM,MAAM,IAAI,WAAW;CAC3D;;;;;CAKA,gBAAgB,KAAK,WAAW;EAE5B,IAAI,OAAO,KAAK,gBAAgB,KAAK,UAAU,IAAI;EACnD,IAAI,SAAS,KAAA,GACT,IAAI,SAAS,UAAU,MAAM;GAEzB,IAAI,SAAS,KAAK,kBAAkB,KAAK,UAAU,MAAM;GACzD,IAAI,WAAW,KAAA,GACX,IAAI,WAAW,UAAU,QAAQ;IAE7B,MAAM,SAAS,KAAK,kBAAkB,KAAK,UAAU,MAAM;IAC3D,IAAI,WAAW,KAAA,GAEX,OAAO;KAAE;KAAM;KAAQ;IAAO;IAGlC,SAAS,KAAK,kBAAkB,KAAK,QAAQ,SAAS,UAAU,SAAS,IAAI,UAAU,SAAS,CAAC;IACjG,IAAI,WAAW,KAAA,GAEX,OAAO;KACH;KACA;KACA,QAAQ,QAAQ,SAAS,KAAK,QAAQ,KAAK,KAAK,SAAS,QAAQ;IACrE;GAER,OAGI,OAAO;IACH;IACA;IACA,QAAQ,QAAQ,SAAS,KAAK,QAAQ,KAAK,KAAK,SAAS,QAAQ;GACrE;GAIR,OAAO,KAAK,gBAAgB,KAAK,QAAQ,SAAS,UAAU,OAAO,IAAI,UAAU,OAAO,CAAC;GACzF,IAAI,SAAS,KAAA,GAET,OAAO;IACH;IACA,QAAQ,QAAQ,SAAS,KAAK,QAAQ,KAAK,KAAK,SAAS,QAAQ;IACjE,QAAQ,QAAQ,SAAS,KAAK,QAAQ,KAAK,KAAK,SAAS,QAAQ;GACrE;EAER,OAGI,OAAO;GACH;GACA,QAAQ,QAAQ,SAAS,KAAK,QAAQ,KAAK,KAAK,SAAS,QAAQ;GACjE,QAAQ,QAAQ,SAAS,KAAK,QAAQ,KAAK,KAAK,SAAS,QAAQ;EACrE;CAKZ;;;;;CAKA,sBAAsB,KAAK,MAAM,OAAO,UAAU;EAC9C,IAAI,IAAI;EACR,IAAI,WAAW,GACX,MAAM,IAAI,MAAM,sCAAsC;EAK1D,MAAM,cAAc,eAAe,MAAM,KAAK;EAC9C,MAAM,iBAAiB,KAAK,KAAK,WAAW;EAC5C,MAAM,qBAAqB,KAAK,SAAS,WAAW;EACpD,IAAI,CAAC,kBAAkB,CAAC,oBAAoB;GACxC,IAAI,WAAW,aACX,OAAO,QAAQ,SAAS,KAAA,IAAY;GAExC,OAAO;EACX;EAEA,IAAI;EACJ,IAAI,gBAAgB;GAChB,mBACI,QAAQ,SACF,KAAK,KAAK,MAAM,MAAM,KAAK,QAAQ,IACnC,KAAK,SAAS,KAAK,MAAM,MAAM,KAAK,QAAQ;GAEtD,IAAI,qBAAqB,KAAA,KAAa,mBAAmB,aACrD,mBAAmB,KAAA;EAE3B;EAEA,IAAI;EACJ,IAAI,oBAAoB;GACpB,MAAM,eAAe,IAAI,KAAK,MAAM,OAAO,QAAQ,EAAE,OAAO;GAC5D,MAAM,wBAAwB,QAAQ,UAC9B,KAAK,KAAK,SAAS,MAAM,MAAM,KAAK,YAAY,OAAO,QAAQ,OAAO,KAAK,IAAI,KAAK,KAAK,SAAS,MAClG,KAAK,KAAK,SAAS,SAAS,MAAM,MAAM,KAAK,YAAY,OAAO,QAAQ,OAAO,KAAK,IAAI,KAAK,KAAK,SAAS,SAAS;GAC5H,IAAI,0BAA0B,KAAA,GAAW;IACrC,MAAM,sBAAsB,QAAQ,SAC9B,uBAAuB,cAAc,qBAAqB,IAC1D,uBAAuB,uBAAuB,YAAY;IAChE,uBACI,QAAQ,SACF,WAAW,sBACX,WAAW;IAErB,IAAI,uBAAuB,eAAe,uBAAuB,GAC7D,uBAAuB,KAAA;GAE/B;EACJ;EACA,IAAI,qBAAqB,KAAA,KAAa,yBAAyB,KAAA,GAG3D,OAAO,QAAQ,SACT,KAAK,IAAI,kBAAkB,oBAAoB,IAC/C,KAAK,IAAI,kBAAkB,oBAAoB;EAEzD,IAAI,qBAAqB,KAAA,GACrB,OAAO;EAEX,IAAI,yBAAyB,KAAA,GACzB,OAAO;CAGf;;CAEA,YAAY,4BAAY,IAAI,KAAK,GAAG;EAChC,MAAM,oBAAoB,oBAAoB,SAAS;EACvD,IAAI,UAAU,kBAAkB;EAChC,IAAI,kBAAkB,KAAK,OAAO,WAAW,MAAM,KAAK,kBAAkB,KAAK;EAC/E,IAAI,oBAAoB,IAAI;GACxB,kBAAkB;GAClB;EACJ;EAGA,MAAM,gBAAgB,KAAK,OAAO,SAAS;EAC3C,KAAK,IAAI,IAAI,GAAG,IAAI,eAAe,KAAK;GAEpC,MAAM,OAAO,UAAU,KAAK,OAAO,kBAAkB,KAAK,KAAK,OAAO,MAAM;GAC5E,MAAM,QAAQ,KAAK,QAAQ,kBAAkB,KAAK,KAAK,OAAO;GAC9D,MAAM,eAAe,SAAS,kBAAkB,QAAQ,UAAU,kBAAkB;GAEpF,IAAI,MAAM,KAAK,sBAAsB,QAAQ,MAAM,OAAO,eAAe,kBAAkB,MAAM,CAAC;GAClG,IAAI,aAAa,gBAAgB,QAAQ,kBAAkB;GAE3D,IAAI,QAAQ,KAAA,KAAa,YAAY;IACjC,MAAM,WAAW,KAAK,gBAAgB,QAAQ,iBAAiB;IAC/D,IAAI,aAAa,KAAA,GACb,OAAO,IAAI,KAAK,MAAM,OAAO,KAAK,SAAS,MAAM,SAAS,QAAQ,SAAS,MAAM;IAGrF,MAAM,KAAK,sBAAsB,QAAQ,MAAM,OAAO,MAAM,CAAC;IAC7D,aAAa;GACjB;GAGA,IAAI,QAAQ,KAAA,KAAa,CAAC,YACtB,OAAO,IAAI,KAAK,MAAM,OAAO,KAAK,KAAK,MAAM,IAAI,KAAK,QAAQ,IAAI,KAAK,QAAQ,EAAE;EAGzF;EACA,MAAM,IAAI,MAAM,+BAA+B;CACnD;;CAEA,aAAa,QAAQ,WAAW;EAC5B,MAAM,QAAQ,CAAC;EACf,IAAI;EACJ,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;GAC7B,WAAW,KAAK,YAAY,aAAa,QAAQ,aAAa,KAAK,IAAI,WAAW,SAAS;GAC3F,MAAM,KAAK,QAAQ;EACvB;EACA,OAAO;CACX;;;;;CAKA,CAAC,qBAAqB,WAAW,SAAS;EACtC,IAAI;EACJ,OAAO,MAAM;GACT,WAAW,KAAK,YAAY,aAAa,QAAQ,aAAa,KAAK,IAAI,WAAW,SAAS;GAC3F,IAAI,WAAW,QAAQ,QAAQ,IAAI,SAAS,QAAQ,GAChD;GAEJ,MAAM;EACV;CACJ;;CAEA,YAAY,4BAAY,IAAI,KAAK,GAAG;EAChC,MAAM,oBAAoB,oBAAoB,SAAS;EACvD,IAAI,UAAU,kBAAkB;EAChC,IAAI,kBAAkB,KAAK,SAAS,OAAO,WAAW,MAAM,KAAK,kBAAkB,KAAK;EACxF,IAAI,oBAAoB,IAAI;GACxB,kBAAkB;GAClB;EACJ;EAGA,MAAM,gBAAgB,KAAK,SAAS,OAAO,SAAS;EACpD,KAAK,IAAI,IAAI,GAAG,IAAI,eAAe,KAAK;GAEpC,MAAM,OAAO,UACT,KAAK,OAAO,kBAAkB,KAAK,KAAK,SAAS,OAAO,MAAM;GAClE,MAAM,QAAQ,KAAK,SAAS,QAAQ,kBAAkB,KAAK,KAAK,SAAS,OAAO;GAChF,MAAM,eAAe,SAAS,kBAAkB,QAAQ,UAAU,kBAAkB;GAEpF,IAAI,MAAM,KAAK,sBAAsB,QAAQ,MAAM,OAAO,eACpD,kBAAkB,MAEhB,eAAe,MAAM,KAAK,CAAC;GACnC,IAAI,aAAa,gBAAgB,QAAQ,kBAAkB;GAE3D,IAAI,QAAQ,KAAA,KAAa,YAAY;IACjC,MAAM,WAAW,KAAK,gBAAgB,QAAQ,iBAAiB;IAC/D,IAAI,aAAa,KAAA,GACb,OAAO,IAAI,KAAK,MAAM,OAAO,KAAK,SAAS,MAAM,SAAS,QAAQ,SAAS,MAAM;IAGrF,IAAI,MAAM,GAAG;KACT,MAAM,KAAK,sBAAsB,QAAQ,MAAM,OAAO,MAAM,CAAC;KAC7D,aAAa;IACjB;GACJ;GAGA,IAAI,QAAQ,KAAA,KAAa,CAAC,YACtB,OAAO,IAAI,KAAK,MAAM,OAAO,KAAK,KAAK,SAAS,MAAM,IAAI,KAAK,SAAS,QAAQ,IAAI,KAAK,SAAS,QAAQ,EAAE;EAGpH;EACA,MAAM,IAAI,MAAM,mCAAmC;CACvD;;CAEA,aAAa,QAAQ,WAAW;EAC5B,MAAM,QAAQ,CAAC;EACf,IAAI;EACJ,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;GAC7B,WAAW,KAAK,YAAY,aAAa,QAAQ,aAAa,KAAK,IAAI,WAAW,SAAS;GAC3F,MAAM,KAAK,QAAQ;EACvB;EACA,OAAO;CACX;;;;;CAKA,CAAC,qBAAqB,WAAW,SAAS;EACtC,IAAI;EACJ,OAAO,MAAM;GACT,WAAW,KAAK,YAAY,aAAa,QAAQ,aAAa,KAAK,IAAI,WAAW,SAAS;GAC3F,IAAI,WAAW,QAAQ,QAAQ,IAAI,SAAS,QAAQ,GAChD;GAEJ,MAAM;EACV;CACJ;;CAEA,UAAU,MAAM;EACZ,MAAM,EAAE,QAAQ,QAAQ,MAAM,KAAK,OAAO,YAAY,oBAAoB,IAAI;EAC9E,IAAI,KAAK,QAAQ,QAAQ,MAAM,MAAM,MACjC,KAAK,QAAQ,QAAQ,MAAM,MAAM,MACjC,KAAK,MAAM,QAAQ,IAAI,MAAM,MAC7B,KAAK,OAAO,QAAQ,KAAK,MAAM,IAC/B,OAAO;EAEX,IAAI,KAAK,KAAK,WAAW,MAAM,KAAK,SAAS,WAAW,GACpD,OAAQ,KAAK,KAAK,QAAQ,GAAG,MAAM,MAAM,KAAK,SAAS,QAAQ,OAAO,MAAM;EAEhF,OAAQ,KAAK,KAAK,QAAQ,GAAG,MAAM,MAAM,KAAK,SAAS,QAAQ,OAAO,MAAM;CAChF;AACJ;;;AC7VA,MAAM,mBAAmB;CACrB,KAAK;CACL,KAAK;AACT;AACA,MAAM,mBAAmB;CACrB,KAAK;CACL,KAAK;AACT;AACA,MAAM,iBAAiB;CACnB,KAAK;CACL,KAAK;AACT;AACA,MAAM,gBAAgB;CAClB,KAAK;CACL,KAAK;AACT;AACA,MAAM,kBAAkB;CACpB,KAAK;CACL,KAAK;CACL,SAAS;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;CACT;AACJ;AACA,MAAM,oBAAoB;CACtB,KAAK;CACL,KAAK;CACL,SAAS;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;CACT;AACJ;AACA,MAAM,gBAAgB;CAClB,WAAW;CACX,aAAa;CACb,YAAY;CACZ,WAAW;CACX,UAAU;CACV,WAAW;CACX,aAAa;AACjB;AACA,SAAS,aAAa,SAAS,YAAY;CACvC,MAAM,yBAAS,IAAI,IAAI;CAEvB,IAAI,YAAY,KAAK;EACjB,KAAK,IAAI,IAAI,WAAW,KAAK,KAAK,WAAW,KAAK,IAAI,IAAI,GACtD,OAAO,IAAI,CAAC;EAEhB,OAAO;CACX;CAEA,MAAM,eAAe,QAAQ,MAAM,GAAG;CACtC,IAAI,aAAa,SAAS,GAAG;EACzB,KAAK,MAAM,eAAe,cAAc;GACpC,MAAM,oBAAoB,aAAa,aAAa,UAAU;GAC9D,KAAK,MAAM,KAAK,mBACZ,OAAO,IAAI,CAAC;EAEpB;EACA,OAAO;CACX;CAEA,MAAM,sBAAsB,kBAAkB;EAC1C,IAAI,IAAI;EACR,iBACK,MAAM,KAAK,WAAW,aAAa,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,cAAc,YAAY,QAAQ,QAAQ,OAAO,KAAK,IAAI,KAAK;EAC3I,MAAM,gBAAgB,OAAO,SAAS,eAAe,EAAE;EACvD,IAAI,OAAO,MAAM,aAAa,GAC1B,MAAM,IAAI,MAAM,mBAAmB,QAAQ,IAAI,cAAc,SAAS;EAE1E,IAAI,gBAAgB,WAAW,OAAO,gBAAgB,WAAW,KAC7D,MAAM,IAAI,MAAM,mBAAmB,QAAQ,IAAI,cAAc,qCAAqC,WAAW,IAAI,KAAK,WAAW,IAAI,EAAE;EAE3I,OAAO;CACX;CAKA,MAAM,gBAAgB,oDAAoD,KAAK,OAAO;CAEtF,IAAI,kBAAkB,MAAM;EACxB,OAAO,IAAI,mBAAmB,OAAO,CAAC;EACtC,OAAO;CACX;CAEA,IAAI,cAAc,cAAc,OAAO,MACjC,WAAW,MACX,mBAAmB,cAAc,EAAE;CACzC,MAAM,YAAY,cAAc,OAAO,MACjC,WAAW,MACX,mBAAmB,cAAc,EAAE;CAEzC,IAAI,eAAe,qBACf,gBAAgB,KAEhB,cAAc,GACd,cAAc;CAElB,IAAI,cAAc,WACd,MAAM,IAAI,MAAM,mBAAmB,QAAQ,0BAA0B,YAAY,SAAS,UAAU,GAAG;CAG3G,MAAM,OAAO,cAAc;CAC3B,IAAI,aAAa;CACjB,IAAI,SAAS,KAAA,GAAW;EACpB,aAAa,OAAO,SAAS,MAAM,EAAE;EACrC,IAAI,OAAO,MAAM,UAAU,GACvB,MAAM,IAAI,MAAM,yBAAyB,KAAK,SAAS;EAE3D,IAAI,aAAa,GACb,MAAM,IAAI,MAAM,kCAAkC,KAAK,uBAAuB;CAEtF;CAEA,KAAK,IAAI,IAAI,aAAa,KAAK,WAAW,IAAI,IAAI,YAC9C,OAAO,IAAI,CAAC;CAEhB,OAAO;AACX;;AAEA,SAAgB,oBAAoB,gBAAgB;CAChD,IAAI;CACJ,IAAI,OAAO,mBAAmB,UAC1B,MAAM,IAAI,UAAU,kDAAkD;CAG1E,kBAAkB,KAAK,cAAc,eAAe,YAAY,QAAQ,QAAQ,OAAO,KAAK,IAAI,KAAK;CAErG,MAAM,WAAW,eAAe,MAAM,GAAG,EAAE,QAAQ,SAAS,KAAK,SAAS,CAAC;CAC3E,IAAI,SAAS,SAAS,KAAK,SAAS,SAAS,GACzC,MAAM,IAAI,MAAM,oDAAoD;CAExE,MAAM,aAAa,SAAS,WAAW,IAAI,SAAS,KAAK;CACzD,MAAM,aAAa,SAAS,WAAW,IAAI,SAAS,KAAK,SAAS;CAClE,MAAM,WAAW,SAAS,WAAW,IAAI,SAAS,KAAK,SAAS;CAChE,MAAM,UAAU,SAAS,WAAW,IAAI,SAAS,KAAK,SAAS;CAC/D,MAAM,YAAY,SAAS,WAAW,IAAI,SAAS,KAAK,SAAS;CACjE,MAAM,cAAc,SAAS,WAAW,IAAI,SAAS,KAAK,SAAS;CACnE,OAAO,IAAI,KAAK;EACZ,SAAS,aAAa,YAAY,gBAAgB;EAClD,SAAS,aAAa,YAAY,gBAAgB;EAClD,OAAO,aAAa,UAAU,cAAc;EAC5C,MAAM,aAAa,SAAS,aAAa;EAEzC,QAAQ,IAAI,IAAI,MAAM,KAAK,aAAa,WAAW,eAAe,CAAC,EAAE,KAAK,MAAM,IAAI,CAAC,CAAC;EACtF,UAAU,IAAI,IAAI,MAAM,KAAK,aAAa,aAAa,iBAAiB,CAAC,EAAE,KAAK,MAAM,IAAI,CAAC,CAAC;CAChG,CAAC;AACL;;;;;;;;;;ACzJA,MAAM,qBAAqB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,0CAA0C,EAAE,OAAO,iBAAiB,iCAAiC,EAAE,MAAM;;AAEjK,SAAS,kBAAkB,OAAO;CACjC,OAAO,mBAAmB,MAAM,KAAK;AACtC;;;;;;AAMA,SAAS,oBAAoB,cAAc,UAAU,SAAS;CAC7D,OAAO,QAAQ,8BAA8B,iBAAiB,QAAQ,wBAAwB;AAC/F;;AAEA,SAAS,qBAAqB,UAAU;CACvC,OAAO,OAAO,QAAQ;AACvB;;AAEA,SAAS,iBAAiB,UAAU,uBAAuB,IAAI,KAAK,GAAG;CACtE,OAAO,OAAO,QAAQ,EAAE,YAAY,IAAI;AACzC;;;;;AAKA,SAAS,OAAO,UAAU;CACzB,OAAO,oBAAoB,QAAQ;AACpC;AACA,SAAS,gBAAgB,OAAO;CAC/B,IAAI;EACH,OAAO,KAAK;EACZ,OAAO;CACR,QAAQ;EACP,OAAO;CACR;AACD;AAGA,MAAM,YAAY,EAAE,QAAQ,MAAM,aAAa,EAAE,SAAS,sBAAsB;AAChF,MAAM,iBAAiB,EAAE,QAAQ,MAAM,WAAW,CAAC,GAAG,6BAA6B;AACnF,MAAM,cAAc,EAAE,QAAQ,MAAM,OAAO,MAAM,YAAY,MAAM,QAAQ,OAAO,EAAE,SAAS,YAAY,EAAE,KAAK,KAAK,EAAE,SAAS,KAAK,OAAO,EAAE,WAAW,YAAY,0BAA0B;AAC/L,MAAM,eAAe,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,EAAE,SAAS,CAAC,CAAC;AACvD,MAAM,kBAAkB;CACvB,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC;CAC5B,QAAQ,EAAE,SAAS;AACpB;AACA,MAAM,sBAAsB,EAAE,OAAO;CACpC,MAAM,EAAE,QAAQ,SAAS;CACzB,GAAG;CACH,UAAU,EAAE,OAAO,EAAE,IAAI,CAAC;CAC1B,SAAS;CACT,QAAQ,UAAU,SAAS;CAC3B,QAAQ,EAAE,SAAS;AACpB,CAAC;AACD,MAAM,mBAAmB,EAAE,OAAO;CACjC,MAAM,EAAE,QAAQ,MAAM;CACtB,GAAG;CACH,UAAU;AACX,CAAC;AACD,MAAM,mBAAmB,EAAE,OAAO;CACjC,MAAM,EAAE,QAAQ,MAAM;CACtB,GAAG;CACH,IAAI,EAAE,OAAO,EAAE,SAAS;CACxB,UAAU;CACV,KAAK,EAAE,SAAS;CAChB,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC;CAC7B,QAAQ,EAAE,SAAS;AACpB,CAAC;;AAED,MAAM,sBAAsB,EAAE,mBAAmB,QAAQ;CACxD;CACA;CACA;AACD,CAAC;AACD,MAAM,2BAA2B,EAAE,OAAO;CACzC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC;CAC5B,QAAQ;CACR,QAAQ,EAAE,QAAQ,UAAU;CAC5B,UAAU;CACV,WAAW,EAAE,SAAS,EAAE,SAAS;AAClC,CAAC;AACD,MAAM,wBAAwB,EAAE,OAAO;CACtC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC;CAC5B,QAAQ;CACR,QAAQ,EAAE,QAAQ,OAAO;CACzB,OAAO;CACP,QAAQ;AACT,CAAC;;AAED,MAAM,8BAA8B,EAAE,mBAAmB,UAAU,CAAC,0BAA0B,qBAAqB,CAAC;AACpH,MAAM,qBAAqB,OAAO,IAAI,6BAA6B;;;;;AAKnE,SAAS,oBAAoB,OAAO;CACnC,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO;CACxD,IAAI,EAAE,sBAAsB,UAAU,MAAM,wBAAwB,MAAM,OAAO;CACjF,OAAO,4BAA4B,UAAU,KAAK,EAAE;AACrD;AACA,SAAS,4BAA4B,YAAY;CAChD,OAAO,WAAW,WAAW;AAC9B;AACA,SAAS,yBAAyB,YAAY;CAC7C,OAAO,WAAW,WAAW;AAC9B;AAGA,SAAS,0BAA0B,UAAU;CAC5C,MAAM,OAAO,SAAS,MAAM,KAAK;CACjC,IAAI,CAAC,MAAM,MAAM,IAAI,MAAM,+CAA+C;CAC1E,OAAO;AACR;AACA,SAAS,kBAAkB,OAAO;CACjC,MAAM,OAAO,MAAM,MAAM,KAAK;CAC9B,IAAI,CAAC,MAAM,MAAM,IAAI,MAAM,4CAA4C;CACvE,OAAO;AACR;AACA,SAAS,kBAAkB,YAAY,WAAW;CACjD,OAAO,GAAG,WAAW,GAAG;AACzB;AAGA,SAAS,qBAAqB,SAAS;CACtC,OAAO,WAAW;AACnB;;;;;;AAQA,SAAS,wBAAwB,OAAO;CACvC,MAAM,SAAS,4BAA4B,UAAU,KAAK;CAC1D,IAAI,CAAC,OAAO,SAAS,MAAM,IAAI,MAAM,+BAA+B,aAAa,OAAO,MAAM,MAAM,GAAG;CACvG,OAAO;EACN,GAAG;GACF,qBAAqB;CACvB;AACD;AACA,SAAS,aAAa,QAAQ;CAC7B,OAAO,OAAO,KAAK,UAAU;EAC5B,OAAO,GAAG,MAAM,KAAK,SAAS,IAAI,GAAG,MAAM,KAAK,KAAK,GAAG,EAAE,MAAM,KAAK,MAAM;CAC5E,CAAC,EAAE,KAAK,IAAI;AACb;AAGA,SAAS,iBAAiB,QAAQ,YAAY,SAAS;CACtD,IAAI,qBAAqB,OAAO,GAAG,OAAO,wBAAwB;EACjE,KAAK,kBAAkB,YAAY,kBAAkB,QAAQ,KAAK,CAAC;EACnE;EACA,QAAQ;EACR,OAAO,QAAQ;EACf,QAAQ,QAAQ;CACjB,CAAC;CACD,OAAO,wBAAwB;EAC9B,KAAK,kBAAkB,YAAY,0BAA0B,QAAQ,QAAQ,CAAC;EAC9E;EACA,QAAQ;EACR,UAAU,QAAQ;EAClB,WAAW,QAAQ;CACpB,CAAC;AACF;AAGA,SAAS,oBAAoB,OAAO,QAAQ,SAAS;CACpD,MAAM,SAAS,MAAM,UAAU,OAAO;CACtC,IAAI,CAAC,OAAO,SAAS;CACrB,IAAI,UAAU,CAAC,OAAO,UAAU,OAAO,IAAI,EAAE,SAAS;CACtD,OAAO,OAAO;AACf;AACA,SAAS,qBAAqB,OAAO,QAAQ,SAAS;CACrD,OAAO,oBAAoB,OAAO,QAAQ,OAAO,MAAM,KAAK;AAC7D;AACA,SAAS,oBAAoB,KAAK,SAAS;CAC1C,MAAM,UAAU,CAAC;CACjB,IAAI,OAAO,EAAE,mBAAmB,YAAY,MAAM,IAAI,MAAM,uDAAuD;CACnH,KAAK,MAAM,UAAU,SAAS;EAC7B,MAAM,OAAO,oBAAoB,EAAE,eAAe,OAAO,aAAa,GAAG,OAAO,eAAe,EAAE,eAAe,OAAO,YAAY,IAAI,KAAK,GAAG,GAAG;EAClJ,IAAI,SAAS,KAAK,GAAG;EACrB,QAAQ,KAAK;GACZ,eAAe,OAAO;GACtB;EACD,CAAC;CACF;CACA,OAAO;AACR;;AAEA,SAAS,mBAAmB,OAAO,QAAQ,SAAS;CACnD,OAAO,qBAAqB,OAAO,QAAQ,OAAO;AACnD;AAGA,SAAS,yBAAyB,UAAU;CAC3C,OAAO,SAAS,QAAQ,cAAc,EAAE,EAAE,QAAQ,gBAAgB,EAAE;AACrE;AACA,SAAS,oBAAoB,QAAQ;CACpC,IAAI,kBAAkB,EAAE,WAAW,OAAO,OAAO,MAAM;CACvD,OAAO;AACR;;;;;;;;AAQA,SAAS,oBAAoB,SAAS;CACrC,MAAM,aAAa,QAAQ,IAAI,KAAK;CACpC,IAAI,CAAC,YAAY,MAAM,IAAI,MAAM,8CAA8C;CAC/E,MAAM,WAAW,yBAAyB,QAAQ,QAAQ;CAC1D,IAAI,CAAC,UAAU,MAAM,IAAI,MAAM,mDAAmD;CAClF,MAAM,SAAS,QAAQ,SAAS,oBAAoB,QAAQ,MAAM,IAAI,KAAK;CAC3E,MAAM,SAAS;EACd,MAAM;EACN,KAAK;EACL;EACA,SAAS,QAAQ;EACjB;EACA,OAAO,SAAS;GACf,OAAO,mBAAmB,QAAQ,SAAS,QAAQ,OAAO;EAC3D;EACA,OAAO,eAAe;GACrB,OAAO,iBAAiB,QAAQ,YAAY,aAAa;EAC1D;CACD;CACA,OAAO;AACR;;;;;;;;;;;;AAcA,SAAS,iBAAiB,SAAS;CAClC,MAAM,aAAa,QAAQ,IAAI,KAAK;CACpC,IAAI,CAAC,YAAY,MAAM,IAAI,MAAM,2CAA2C;CAC5E,MAAM,SAAS;EACd,MAAM;EACN,KAAK;EACL,UAAU,kBAAkB,QAAQ,QAAQ;EAC5C,OAAO,eAAe;GACrB,OAAO,iBAAiB,QAAQ,YAAY,aAAa;EAC1D;CACD;CACA,OAAO;AACR;;;;;;;;;;;;;;;AAiBA,SAAS,iBAAiB,SAAS;CAClC,MAAM,aAAa,QAAQ,IAAI,KAAK;CACpC,IAAI,CAAC,YAAY,MAAM,IAAI,MAAM,2CAA2C;CAC5E,MAAM,WAAW,kBAAkB,QAAQ,QAAQ;CACnD,MAAM,UAAU,CAAC;CACjB,IAAI,QAAQ,QAAQ,QAAQ,KAAK,QAAQ,MAAM;CAC/C,MAAM,SAAS;EACd,MAAM;EACN,KAAK;EACL,IAAI,QAAQ;EACZ;EACA,KAAK,QAAQ;EACb;EACA,OAAO,SAAS;GACf,OAAO,OAAO,QAAQ,OAAO,cAAc,UAAU,OAAO,CAAC;EAC9D;EACA,OAAO,eAAe;GACrB,OAAO,iBAAiB,QAAQ,YAAY,aAAa;EAC1D;CACD;CACA,MAAM,QAAQ;CACd,MAAM,UAAU,OAAO;EACtB,OAAO,QAAQ,KAAK,EAAE;EACtB,OAAO;CACR;CACA,OAAO;AACR;AAGA,SAAS,oBAAoB;CAC5B,OAAO;EACN,MAAM;EACN,YAAY,CAAC;EACb,UAAU,CAAC;CACZ;AACD;AACA,SAAS,eAAe,QAAQ,MAAM,OAAO;CAC5C,MAAM,CAAC,MAAM,GAAG,QAAQ;CACxB,IAAI,CAAC,MAAM;CACX,IAAI,CAAC,OAAO,SAAS,SAAS,IAAI,GAAG,OAAO,SAAS,KAAK,IAAI;CAC9D,IAAI,KAAK,WAAW,GAAG;EACtB,OAAO,WAAW,QAAQ,EAAE,OAAO,MAAM;EACzC;CACD;CACA,MAAM,WAAW,OAAO,WAAW;CACnC,MAAM,QAAQ,YAAY,OAAO,aAAa,YAAY,SAAS,SAAS,WAAW,WAAW,kBAAkB;CACpH,OAAO,WAAW,QAAQ;CAC1B,eAAe,OAAO,MAAM,KAAK;AAClC;;;;;;AAMA,SAAS,kBAAkB,OAAO;CACjC,MAAM,SAAS,kBAAkB;CACjC,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,KAAK,GAAG,eAAe,QAAQ,KAAK,MAAM,GAAG,EAAE,QAAQ,YAAY,QAAQ,SAAS,CAAC,GAAG,KAAK;CACxI,IAAI,OAAO,SAAS,WAAW,GAAG,OAAO,EAAE,MAAM,SAAS;CAC1D,OAAO;AACR;AAGA,SAAS,YAAY,SAAS,MAAM;CACnC,IAAI,UAAU;CACd,KAAK,MAAM,WAAW,MAAM;EAC3B,IAAI,YAAY,QAAQ,OAAO,YAAY,UAAU;EACrD,UAAU,QAAQ;CACnB;CACA,OAAO;AACR;;;;;;AAMA,SAAS,kBAAkB,UAAU,SAAS;CAC7C,OAAO,SAAS,QAAQ,8BAA8B,OAAO,YAAY;EACxE,MAAM,WAAW,QAAQ,MAAM,GAAG;EAClC,IAAI,SAAS,OAAO,WAAW,SAAS,MAAM;EAC9C,MAAM,QAAQ,SAAS,WAAW,IAAI,UAAU,YAAY,SAAS,QAAQ;EAC7E,IAAI,UAAU,KAAK,GAAG,OAAO;EAC7B,OAAO,OAAO,UAAU,WAAW,QAAQ,KAAK,UAAU,KAAK;CAChE,CAAC;AACF;;AAIA,SAAS,mBAAmB,YAAY,SAAS;CAChD,MAAM,SAAS,WAAW;CAC1B,IAAI,OAAO,WAAW,YAAY,OAAO,OAAO,WAAW,CAAC,CAAC;CAC7D,OAAO;AACR;AAGA,SAAS,yBAAyB,YAAY,SAAS;CACtD,OAAO,WAAW,YAAY,WAAW,UAAU,OAAO,IAAI;AAC/D;;;;;AAKA,SAAS,2BAA2B,YAAY,SAAS;CACxD,IAAI,yBAAyB,UAAU,GAAG,OAAO;CACjD,OAAO,yBAAyB,YAAY,OAAO;AACpD;;AAEA,SAAS,uBAAuB,YAAY,SAAS;CACpD,MAAM,SAAS,WAAW;CAC1B,IAAI,OAAO,SAAS,UAAU,CAAC,OAAO,OAAO,OAAO,GAAG;CACvD,IAAI,yBAAyB,UAAU,GAAG,OAAO;CACjD,OAAO,yBAAyB,YAAY,OAAO;AACpD"}
+{"version":3,"file":"trigger.mjs","names":[],"sources":["../../../node_modules/.pnpm/cron-schedule@6.0.0/node_modules/cron-schedule/dist/utils.js","../../../node_modules/.pnpm/cron-schedule@6.0.0/node_modules/cron-schedule/dist/cron.js","../../../node_modules/.pnpm/cron-schedule@6.0.0/node_modules/cron-schedule/dist/cron-parser.js","../../trigger/dist/index.mjs"],"sourcesContent":["export const TIMEOUT_MAX = 2147483647; // 2^31-1\n/**\n * Creates a new timeout, which can exceed the max timeout limit of 2^31-1.\n * Since multiple timeouts are used internally, the timeoutId used to clear the timeout\n * is returned as a handle (object) and changes whenever the max timeout limit is exceeded.\n * The handle parameter can be ignored, it is used internally for updating the timeoutId\n * in the handle after creating the next timeout.\n */\nexport function longTimeout(fn, timeout, previousHandle) {\n    let nextTimeout = timeout;\n    let remainingTimeout = 0;\n    if (nextTimeout > TIMEOUT_MAX) {\n        remainingTimeout = nextTimeout - TIMEOUT_MAX;\n        nextTimeout = TIMEOUT_MAX;\n    }\n    const handle = previousHandle !== null && previousHandle !== void 0 ? previousHandle : {\n        timeoutId: undefined,\n    };\n    handle.timeoutId = setTimeout(() => {\n        if (remainingTimeout > 0) {\n            longTimeout(fn, remainingTimeout, previousHandle);\n        }\n        else {\n            fn();\n        }\n    }, nextTimeout);\n    return handle;\n}\n/* Extracts second, minute, hour, date, month and the weekday from a date. */\nexport function extractDateElements(date) {\n    return {\n        second: date.getSeconds(),\n        minute: date.getMinutes(),\n        hour: date.getHours(),\n        day: date.getDate(),\n        month: date.getMonth(),\n        weekday: date.getDay(),\n        year: date.getFullYear(),\n    };\n}\n/* Gets the amount of days in the given month (indexed by 0) of the given year. */\nexport function getDaysInMonth(year, month) {\n    return new Date(year, month + 1, 0).getDate();\n}\n/* Gets the amount of days from weekday1 to weekday2. */\nexport function getDaysBetweenWeekdays(weekday1, weekday2) {\n    if (weekday1 <= weekday2) {\n        return weekday2 - weekday1;\n    }\n    return 6 - weekday1 + weekday2 + 1;\n}\nexport function wrapFunction(fn, errorHandler) {\n    return () => {\n        try {\n            const res = fn();\n            if (res instanceof Promise) {\n                res.catch((err) => {\n                    if (errorHandler) {\n                        errorHandler(err);\n                    }\n                });\n            }\n        }\n        catch (err) {\n            if (errorHandler) {\n                errorHandler(err);\n            }\n        }\n    };\n}\n//# sourceMappingURL=utils.js.map","import { extractDateElements, getDaysBetweenWeekdays, getDaysInMonth, } from './utils.js';\nexport class Cron {\n    constructor({ seconds, minutes, hours, days, months, weekdays, }) {\n        // Validate that there are values provided.\n        if (!seconds || seconds.size === 0)\n            throw new Error('There must be at least one allowed second.');\n        if (!minutes || minutes.size === 0)\n            throw new Error('There must be at least one allowed minute.');\n        if (!hours || hours.size === 0)\n            throw new Error('There must be at least one allowed hour.');\n        if (!months || months.size === 0)\n            throw new Error('There must be at least one allowed month.');\n        if ((!weekdays || weekdays.size === 0) && (!days || days.size === 0))\n            throw new Error('There must be at least one allowed day or weekday.');\n        // Convert set to array and sort in ascending order.\n        this.seconds = Array.from(seconds).sort((a, b) => a - b);\n        this.minutes = Array.from(minutes).sort((a, b) => a - b);\n        this.hours = Array.from(hours).sort((a, b) => a - b);\n        this.days = Array.from(days).sort((a, b) => a - b);\n        this.months = Array.from(months).sort((a, b) => a - b);\n        this.weekdays = Array.from(weekdays).sort((a, b) => a - b);\n        // Validate that all values are integers within the constraint.\n        const validateData = (name, data, constraint) => {\n            if (data.some((x) => typeof x !== 'number' ||\n                x % 1 !== 0 ||\n                x < constraint.min ||\n                x > constraint.max)) {\n                throw new Error(`${name} must only consist of integers which are within the range of ${constraint.min} and ${constraint.max}`);\n            }\n        };\n        validateData('seconds', this.seconds, { min: 0, max: 59 });\n        validateData('minutes', this.minutes, { min: 0, max: 59 });\n        validateData('hours', this.hours, { min: 0, max: 23 });\n        validateData('days', this.days, { min: 1, max: 31 });\n        validateData('months', this.months, { min: 0, max: 11 });\n        validateData('weekdays', this.weekdays, { min: 0, max: 6 });\n        // For each element, store a reversed copy in the reversed attribute for finding prev dates.\n        this.reversed = {\n            seconds: this.seconds.map((x) => x).reverse(),\n            minutes: this.minutes.map((x) => x).reverse(),\n            hours: this.hours.map((x) => x).reverse(),\n            days: this.days.map((x) => x).reverse(),\n            months: this.months.map((x) => x).reverse(),\n            weekdays: this.weekdays.map((x) => x).reverse(),\n        };\n    }\n    /**\n     * Find the next or previous hour, starting from the given start hour that matches the hour constraint.\n     * startHour itself might also be allowed.\n     */\n    findAllowedHour(dir, startHour) {\n        return dir === 'next'\n            ? this.hours.find((x) => x >= startHour)\n            : this.reversed.hours.find((x) => x <= startHour);\n    }\n    /**\n     * Find the next or previous minute, starting from the given start minute that matches the minute constraint.\n     * startMinute itself might also be allowed.\n     */\n    findAllowedMinute(dir, startMinute) {\n        return dir === 'next'\n            ? this.minutes.find((x) => x >= startMinute)\n            : this.reversed.minutes.find((x) => x <= startMinute);\n    }\n    /**\n     * Find the next or previous second, starting from the given start second that matches the second constraint.\n     * startSecond itself IS NOT allowed.\n     */\n    findAllowedSecond(dir, startSecond) {\n        return dir === 'next'\n            ? this.seconds.find((x) => x > startSecond)\n            : this.reversed.seconds.find((x) => x < startSecond);\n    }\n    /**\n     * Find the next or previous time, starting from the given start time that matches the hour, minute\n     * and second constraints. startTime itself might also be allowed.\n     */\n    findAllowedTime(dir, startTime) {\n        // Try to find an allowed hour.\n        let hour = this.findAllowedHour(dir, startTime.hour);\n        if (hour !== undefined) {\n            if (hour === startTime.hour) {\n                // We found an hour that is the start hour. Try to find an allowed minute.\n                let minute = this.findAllowedMinute(dir, startTime.minute);\n                if (minute !== undefined) {\n                    if (minute === startTime.minute) {\n                        // We found a minute that is the start minute. Try to find an allowed second.\n                        const second = this.findAllowedSecond(dir, startTime.second);\n                        if (second !== undefined) {\n                            // We found a second within the start hour and minute.\n                            return { hour, minute, second };\n                        }\n                        // We did not find a valid second within the start minute. Try to find another minute.\n                        minute = this.findAllowedMinute(dir, dir === 'next' ? startTime.minute + 1 : startTime.minute - 1);\n                        if (minute !== undefined) {\n                            // We found a minute which is not the start minute. Return that minute together with the hour and the first / last allowed second.\n                            return {\n                                hour,\n                                minute,\n                                second: dir === 'next' ? this.seconds[0] : this.reversed.seconds[0],\n                            };\n                        }\n                    }\n                    else {\n                        // We found a minute which is not the start minute. Return that minute together with the hour and the first / last allowed second.\n                        return {\n                            hour,\n                            minute,\n                            second: dir === 'next' ? this.seconds[0] : this.reversed.seconds[0],\n                        };\n                    }\n                }\n                // We did not find an allowed minute / second combination inside the start hour. Try to find the next / previous allowed hour.\n                hour = this.findAllowedHour(dir, dir === 'next' ? startTime.hour + 1 : startTime.hour - 1);\n                if (hour !== undefined) {\n                    // We found an allowed hour which is not the start hour. Return that hour together with the first / last allowed minutes / seconds.\n                    return {\n                        hour,\n                        minute: dir === 'next' ? this.minutes[0] : this.reversed.minutes[0],\n                        second: dir === 'next' ? this.seconds[0] : this.reversed.seconds[0],\n                    };\n                }\n            }\n            else {\n                // We found an allowed hour which is not the start hour. Return that hour together with the first / last allowed minutes / seconds.\n                return {\n                    hour,\n                    minute: dir === 'next' ? this.minutes[0] : this.reversed.minutes[0],\n                    second: dir === 'next' ? this.seconds[0] : this.reversed.seconds[0],\n                };\n            }\n        }\n        // No allowed time found.\n        return undefined;\n    }\n    /**\n     * Find the next or previous day in the given month, starting from the given startDay\n     * that matches either the day or the weekday constraint. startDay itself might also be allowed.\n     */\n    findAllowedDayInMonth(dir, year, month, startDay) {\n        var _a, _b;\n        if (startDay < 1)\n            throw new Error('startDay must not be smaller than 1.');\n        // If only days are restricted: allow day based on day constraint only.\n        // If only weekdays are restricted: allow day based on weekday constraint only.\n        // If both are restricted: allow day based on both day and weekday constraint. pick day that is closer to startDay.\n        // If none are restricted: return the day closest to startDay (respecting dir) that is allowed (or startDay itself).\n        const daysInMonth = getDaysInMonth(year, month);\n        const daysRestricted = this.days.length !== 31;\n        const weekdaysRestricted = this.weekdays.length !== 7;\n        if (!daysRestricted && !weekdaysRestricted) {\n            if (startDay > daysInMonth) {\n                return dir === 'next' ? undefined : daysInMonth;\n            }\n            return startDay;\n        }\n        // Try to find a day based on the days constraint.\n        let allowedDayByDays;\n        if (daysRestricted) {\n            allowedDayByDays =\n                dir === 'next'\n                    ? this.days.find((x) => x >= startDay)\n                    : this.reversed.days.find((x) => x <= startDay);\n            // Make sure the day does not exceed the amount of days in month.\n            if (allowedDayByDays !== undefined && allowedDayByDays > daysInMonth) {\n                allowedDayByDays = undefined;\n            }\n        }\n        // Try to find a day based on the weekday constraint.\n        let allowedDayByWeekdays;\n        if (weekdaysRestricted) {\n            const startWeekday = new Date(year, month, startDay).getDay();\n            const nearestAllowedWeekday = dir === 'next'\n                ? ((_a = this.weekdays.find((x) => x >= startWeekday)) !== null && _a !== void 0 ? _a : this.weekdays[0])\n                : ((_b = this.reversed.weekdays.find((x) => x <= startWeekday)) !== null && _b !== void 0 ? _b : this.reversed.weekdays[0]);\n            if (nearestAllowedWeekday !== undefined) {\n                const daysBetweenWeekdays = dir === 'next'\n                    ? getDaysBetweenWeekdays(startWeekday, nearestAllowedWeekday)\n                    : getDaysBetweenWeekdays(nearestAllowedWeekday, startWeekday);\n                allowedDayByWeekdays =\n                    dir === 'next'\n                        ? startDay + daysBetweenWeekdays\n                        : startDay - daysBetweenWeekdays;\n                // Make sure the day does not exceed the month boundaries.\n                if (allowedDayByWeekdays > daysInMonth || allowedDayByWeekdays < 1) {\n                    allowedDayByWeekdays = undefined;\n                }\n            }\n        }\n        if (allowedDayByDays !== undefined && allowedDayByWeekdays !== undefined) {\n            // If a day is found both via the days and the weekdays constraint, pick the day\n            // that is closer to start date.\n            return dir === 'next'\n                ? Math.min(allowedDayByDays, allowedDayByWeekdays)\n                : Math.max(allowedDayByDays, allowedDayByWeekdays);\n        }\n        if (allowedDayByDays !== undefined) {\n            return allowedDayByDays;\n        }\n        if (allowedDayByWeekdays !== undefined) {\n            return allowedDayByWeekdays;\n        }\n        return undefined;\n    }\n    /** Gets the next date starting from the given start date or now. */\n    getNextDate(startDate = new Date()) {\n        const startDateElements = extractDateElements(startDate);\n        let minYear = startDateElements.year;\n        let startIndexMonth = this.months.findIndex((x) => x >= startDateElements.month);\n        if (startIndexMonth === -1) {\n            startIndexMonth = 0;\n            minYear++;\n        }\n        // We try every month within the next 5 years to make sure that we tried to\n        // find a matching date insidde a whole leap year.\n        const maxIterations = this.months.length * 5;\n        for (let i = 0; i < maxIterations; i++) {\n            // Get the next year and month.\n            const year = minYear + Math.floor((startIndexMonth + i) / this.months.length);\n            const month = this.months[(startIndexMonth + i) % this.months.length];\n            const isStartMonth = year === startDateElements.year && month === startDateElements.month;\n            // Find the next day.\n            let day = this.findAllowedDayInMonth('next', year, month, isStartMonth ? startDateElements.day : 1);\n            let isStartDay = isStartMonth && day === startDateElements.day;\n            // If we found a day and it is the start day, try to find a valid time beginning from the start date time.\n            if (day !== undefined && isStartDay) {\n                const nextTime = this.findAllowedTime('next', startDateElements);\n                if (nextTime !== undefined) {\n                    return new Date(year, month, day, nextTime.hour, nextTime.minute, nextTime.second);\n                }\n                // If no valid time has been found for the start date, try the next day.\n                day = this.findAllowedDayInMonth('next', year, month, day + 1);\n                isStartDay = false;\n            }\n            // If we found a next day and it is not the start day, just use the next day with the first allowed values\n            // for hours, minutes and seconds.\n            if (day !== undefined && !isStartDay) {\n                return new Date(year, month, day, this.hours[0], this.minutes[0], this.seconds[0]);\n            }\n            // No allowed day has been found for this month. Continue to search in next month.\n        }\n        throw new Error('No valid next date was found.');\n    }\n    /** Gets the specified amount of future dates starting from the given start date or now. */\n    getNextDates(amount, startDate) {\n        const dates = [];\n        let nextDate;\n        for (let i = 0; i < amount; i++) {\n            nextDate = this.getNextDate(nextDate !== null && nextDate !== void 0 ? nextDate : startDate);\n            dates.push(nextDate);\n        }\n        return dates;\n    }\n    /**\n     * Get an ES6 compatible iterator which iterates over the next dates starting from startDate or now.\n     * The iterator runs until the optional endDate is reached or forever.\n     */\n    *getNextDatesIterator(startDate, endDate) {\n        let nextDate;\n        while (true) {\n            nextDate = this.getNextDate(nextDate !== null && nextDate !== void 0 ? nextDate : startDate);\n            if (endDate && endDate.getTime() < nextDate.getTime()) {\n                return;\n            }\n            yield nextDate;\n        }\n    }\n    /** Gets the previous date starting from the given start date or now. */\n    getPrevDate(startDate = new Date()) {\n        const startDateElements = extractDateElements(startDate);\n        let maxYear = startDateElements.year;\n        let startIndexMonth = this.reversed.months.findIndex((x) => x <= startDateElements.month);\n        if (startIndexMonth === -1) {\n            startIndexMonth = 0;\n            maxYear--;\n        }\n        // We try every month within the past 5 years to make sure that we tried to\n        // find a matching date inside a whole leap year.\n        const maxIterations = this.reversed.months.length * 5;\n        for (let i = 0; i < maxIterations; i++) {\n            // Get the next year and month.\n            const year = maxYear -\n                Math.floor((startIndexMonth + i) / this.reversed.months.length);\n            const month = this.reversed.months[(startIndexMonth + i) % this.reversed.months.length];\n            const isStartMonth = year === startDateElements.year && month === startDateElements.month;\n            // Find the previous day.\n            let day = this.findAllowedDayInMonth('prev', year, month, isStartMonth\n                ? startDateElements.day\n                : // Start searching from the last day of the month.\n                    getDaysInMonth(year, month));\n            let isStartDay = isStartMonth && day === startDateElements.day;\n            // If we found a day and it is the start day, try to find a valid time beginning from the start date time.\n            if (day !== undefined && isStartDay) {\n                const prevTime = this.findAllowedTime('prev', startDateElements);\n                if (prevTime !== undefined) {\n                    return new Date(year, month, day, prevTime.hour, prevTime.minute, prevTime.second);\n                }\n                // If no valid time has been found for the start date, try the previous day.\n                if (day > 1) {\n                    day = this.findAllowedDayInMonth('prev', year, month, day - 1);\n                    isStartDay = false;\n                }\n            }\n            // If we found a previous day and it is not the start day, just use the previous day with the first allowed values\n            // for hours, minutes and seconds (which will be the latest time due to using the reversed array).\n            if (day !== undefined && !isStartDay) {\n                return new Date(year, month, day, this.reversed.hours[0], this.reversed.minutes[0], this.reversed.seconds[0]);\n            }\n            // No allowed day has been found for this month. Continue to search in previous month.\n        }\n        throw new Error('No valid previous date was found.');\n    }\n    /** Gets the specified amount of previous dates starting from the given start date or now. */\n    getPrevDates(amount, startDate) {\n        const dates = [];\n        let prevDate;\n        for (let i = 0; i < amount; i++) {\n            prevDate = this.getPrevDate(prevDate !== null && prevDate !== void 0 ? prevDate : startDate);\n            dates.push(prevDate);\n        }\n        return dates;\n    }\n    /**\n     * Get an ES6 compatible iterator which iterates over the previous dates starting from startDate or now.\n     * The iterator runs until the optional endDate is reached or forever.\n     */\n    *getPrevDatesIterator(startDate, endDate) {\n        let prevDate;\n        while (true) {\n            prevDate = this.getPrevDate(prevDate !== null && prevDate !== void 0 ? prevDate : startDate);\n            if (endDate && endDate.getTime() > prevDate.getTime()) {\n                return;\n            }\n            yield prevDate;\n        }\n    }\n    /** Returns true when there is a cron date at the given date. */\n    matchDate(date) {\n        const { second, minute, hour, day, month, weekday } = extractDateElements(date);\n        if (this.seconds.indexOf(second) === -1 ||\n            this.minutes.indexOf(minute) === -1 ||\n            this.hours.indexOf(hour) === -1 ||\n            this.months.indexOf(month) === -1) {\n            return false;\n        }\n        if (this.days.length !== 31 && this.weekdays.length !== 7) {\n            return (this.days.indexOf(day) !== -1 || this.weekdays.indexOf(weekday) !== -1);\n        }\n        return (this.days.indexOf(day) !== -1 && this.weekdays.indexOf(weekday) !== -1);\n    }\n}\n//# sourceMappingURL=cron.js.map","import { Cron } from './cron.js';\nconst secondConstraint = {\n    min: 0,\n    max: 59,\n};\nconst minuteConstraint = {\n    min: 0,\n    max: 59,\n};\nconst hourConstraint = {\n    min: 0,\n    max: 23,\n};\nconst dayConstraint = {\n    min: 1,\n    max: 31,\n};\nconst monthConstraint = {\n    min: 1,\n    max: 12,\n    aliases: {\n        jan: '1',\n        feb: '2',\n        mar: '3',\n        apr: '4',\n        may: '5',\n        jun: '6',\n        jul: '7',\n        aug: '8',\n        sep: '9',\n        oct: '10',\n        nov: '11',\n        dec: '12',\n    },\n};\nconst weekdayConstraint = {\n    min: 0,\n    max: 7,\n    aliases: {\n        mon: '1',\n        tue: '2',\n        wed: '3',\n        thu: '4',\n        fri: '5',\n        sat: '6',\n        sun: '7',\n    },\n};\nconst timeNicknames = {\n    '@yearly': '0 0 1 1 *',\n    '@annually': '0 0 1 1 *',\n    '@monthly': '0 0 1 * *',\n    '@weekly': '0 0 * * 0',\n    '@daily': '0 0 * * *',\n    '@hourly': '0 * * * *',\n    '@minutely': '* * * * *',\n};\nfunction parseElement(element, constraint) {\n    const result = new Set();\n    // If returned set of numbers is empty, the scheduler class interpretes the emtpy set of numbers as all valid values of the constraint\n    if (element === '*') {\n        for (let i = constraint.min; i <= constraint.max; i = i + 1) {\n            result.add(i);\n        }\n        return result;\n    }\n    // If the element is a list, parse each element in the list.\n    const listElements = element.split(',');\n    if (listElements.length > 1) {\n        for (const listElement of listElements) {\n            const parsedListElement = parseElement(listElement, constraint);\n            for (const x of parsedListElement) {\n                result.add(x);\n            }\n        }\n        return result;\n    }\n    // Helper function to parse a single element, which includes checking for alias, valid number and constraint min and max.\n    const parseSingleElement = (singleElement) => {\n        var _a, _b;\n        singleElement =\n            (_b = (_a = constraint.aliases) === null || _a === void 0 ? void 0 : _a[singleElement.toLowerCase()]) !== null && _b !== void 0 ? _b : singleElement;\n        const parsedElement = Number.parseInt(singleElement, 10);\n        if (Number.isNaN(parsedElement)) {\n            throw new Error(`Failed to parse ${element}: ${singleElement} is NaN.`);\n        }\n        if (parsedElement < constraint.min || parsedElement > constraint.max) {\n            throw new Error(`Failed to parse ${element}: ${singleElement} is outside of constraint range of ${constraint.min} - ${constraint.max}.`);\n        }\n        return parsedElement;\n    };\n    // Detect if the element is a range.\n    // Possible range formats: 'start-end', 'start-end/step', '*', '*/step'.\n    // Where start and end can be numbers or aliases.\n    // Capture groups: 1: start-end, 2: start, 3: end, 4: /step, 5: step.\n    const rangeSegments = /^(([0-9a-zA-Z]+)-([0-9a-zA-Z]+)|\\*)(\\/([0-9]+))?$/.exec(element);\n    // If not, it must be a single element.\n    if (rangeSegments === null) {\n        result.add(parseSingleElement(element));\n        return result;\n    }\n    // If it is a range, get start and end of the range.\n    let parsedStart = rangeSegments[1] === '*'\n        ? constraint.min\n        : parseSingleElement(rangeSegments[2]);\n    const parsedEnd = rangeSegments[1] === '*'\n        ? constraint.max\n        : parseSingleElement(rangeSegments[3]);\n    // need to catch Sunday, which gets parsed here as 7, but is also legitimate at the start of a range as 0, to avoid the out of order error\n    if (constraint === weekdayConstraint &&\n        parsedStart === 7 &&\n        // this check ensures that sun-sun is not incorrectly parsed as [0,1,2,3,4,5,6]\n        parsedEnd !== 7) {\n        parsedStart = 0;\n    }\n    if (parsedStart > parsedEnd) {\n        throw new Error(`Failed to parse ${element}: Invalid range (start: ${parsedStart}, end: ${parsedEnd}).`);\n    }\n    // Check whether there is a custom step defined for the range, defaulting to 1.\n    const step = rangeSegments[5];\n    let parsedStep = 1;\n    if (step !== undefined) {\n        parsedStep = Number.parseInt(step, 10);\n        if (Number.isNaN(parsedStep)) {\n            throw new Error(`Failed to parse step: ${step} is NaN.`);\n        }\n        if (parsedStep < 1) {\n            throw new Error(`Failed to parse step: Expected ${step} to be greater than 0.`);\n        }\n    }\n    // Go from start to end of the range by the given steps.\n    for (let i = parsedStart; i <= parsedEnd; i = i + parsedStep) {\n        result.add(i);\n    }\n    return result;\n}\n/** Parses a cron expression into a Cron instance. */\nexport function parseCronExpression(cronExpression) {\n    var _a;\n    if (typeof cronExpression !== 'string') {\n        throw new TypeError('Invalid cron expression: must be of type string.');\n    }\n    // Convert time nicknames.\n    cronExpression = (_a = timeNicknames[cronExpression.toLowerCase()]) !== null && _a !== void 0 ? _a : cronExpression;\n    // Split the cron expression into its elements, removing empty elements (extra whitespaces).\n    const elements = cronExpression.split(' ').filter((elem) => elem.length > 0);\n    if (elements.length < 5 || elements.length > 6) {\n        throw new Error('Invalid cron expression: expected 5 or 6 elements.');\n    }\n    const rawSeconds = elements.length === 6 ? elements[0] : '0';\n    const rawMinutes = elements.length === 6 ? elements[1] : elements[0];\n    const rawHours = elements.length === 6 ? elements[2] : elements[1];\n    const rawDays = elements.length === 6 ? elements[3] : elements[2];\n    const rawMonths = elements.length === 6 ? elements[4] : elements[3];\n    const rawWeekdays = elements.length === 6 ? elements[5] : elements[4];\n    return new Cron({\n        seconds: parseElement(rawSeconds, secondConstraint),\n        minutes: parseElement(rawMinutes, minuteConstraint),\n        hours: parseElement(rawHours, hourConstraint),\n        days: parseElement(rawDays, dayConstraint),\n        // months in cron are indexed by 1, but Cron expects indexes by 0, so we need to reduce all set values by one.\n        months: new Set(Array.from(parseElement(rawMonths, monthConstraint)).map((x) => x - 1)),\n        weekdays: new Set(Array.from(parseElement(rawWeekdays, weekdayConstraint)).map((x) => x % 7)),\n    });\n}\n//# sourceMappingURL=cron-parser.js.map","import { parseCronExpression } from \"cron-schedule\";\nimport { z } from \"zod\";\nimport { isWorkflow } from \"@keystrokehq/workflow\";\n//#region src/cron/cron-schedule.ts\n/**\n* Validates and brands a cron expression. Accepts anything the `cron-schedule`\n* engine accepts (5/6 fields, named months/weekdays, `@daily`-style nicknames)\n* so authoring validation never rejects a schedule the scheduler can run. The\n* `.brand()` makes `CronSchedule` nominally distinct from a plain `string`, so\n* a raw string can't be passed where a validated schedule is expected.\n*/\nconst cronScheduleSchema = z.string().trim().min(1, \"cron schedule must be a non-empty string\").refine(isParseableCron, \"must be a valid cron expression\").brand();\n/** Parse/validate an arbitrary value into a branded `CronSchedule` (throws on failure). */\nfunction parseCronSchedule(value) {\n\treturn cronScheduleSchema.parse(value);\n}\n/**\n* Resolves the effective schedule for an attachment, applying overrides by\n* precedence: per-attachment override → global override → the authored\n* schedule. Pure string precedence — no cron parsing.\n*/\nfunction resolveCronSchedule(attachmentId, schedule, options) {\n\treturn options.attachmentScheduleOverrides?.[attachmentId] ?? options.cronScheduleOverride ?? schedule;\n}\n/** Parse a schedule into a `cron-schedule` `Cron` instance (throws on invalid input). */\nfunction parseTriggerSchedule(schedule) {\n\treturn toCron(schedule);\n}\n/** The next time the schedule fires at or after `from`. */\nfunction nextTriggerRunAt(schedule, from = /* @__PURE__ */ new Date()) {\n\treturn toCron(schedule).getNextDate(from);\n}\n/**\n* Single touchpoint for the `cron-schedule` library — every parse, validation,\n* and next-run calculation in this package goes through here.\n*/\nfunction toCron(schedule) {\n\treturn parseCronExpression(schedule);\n}\nfunction isParseableCron(value) {\n\ttry {\n\t\ttoCron(value);\n\t\treturn true;\n\t} catch {\n\t\treturn false;\n\t}\n}\n//#endregion\n//#region src/attachment-definition.ts\nconst zodSchema = z.custom((v) => v instanceof z.ZodType, \"must be a Zod schema\");\nconst workflowSchema = z.custom((v) => isWorkflow(v), \"must be defineWorkflow(...)\");\nconst agentSchema = z.custom((v) => typeof v === \"object\" && v !== null && typeof v.slug === \"string\" && v.slug.trim().length > 0 && typeof v.prompt === \"function\", \"must be defineAgent(...)\");\nconst promptSchema = z.union([z.string(), z.function()]);\nconst baseSourceShape = {\n\tkey: z.string().trim().min(1),\n\tattach: z.function()\n};\nconst webhookSourceSchema = z.object({\n\tkind: z.literal(\"webhook\"),\n\t...baseSourceShape,\n\tendpoint: z.string().min(1),\n\trequest: zodSchema,\n\tfilter: zodSchema.optional(),\n\tpasses: z.function()\n});\nconst cronSourceSchema = z.object({\n\tkind: z.literal(\"cron\"),\n\t...baseSourceShape,\n\tschedule: cronScheduleSchema\n});\nconst pollSourceSchema = z.object({\n\tkind: z.literal(\"poll\"),\n\t...baseSourceShape,\n\tid: z.string().optional(),\n\tschedule: cronScheduleSchema,\n\trun: z.function(),\n\tfilters: z.array(z.function()),\n\tpasses: z.function()\n});\n/** Runtime validation for a trigger source (webhook | cron | poll). */\nconst triggerSourceSchema = z.discriminatedUnion(\"kind\", [\n\twebhookSourceSchema,\n\tcronSourceSchema,\n\tpollSourceSchema\n]);\nconst workflowAttachmentSchema = z.object({\n\tkey: z.string().trim().min(1),\n\tsource: triggerSourceSchema,\n\ttarget: z.literal(\"workflow\"),\n\tworkflow: workflowSchema,\n\ttransform: z.function().optional()\n});\nconst agentAttachmentSchema = z.object({\n\tkey: z.string().trim().min(1),\n\tsource: triggerSourceSchema,\n\ttarget: z.literal(\"agent\"),\n\tagent: agentSchema,\n\tprompt: promptSchema\n});\n/** Runtime validation for an unbranded trigger attachment. */\nconst triggerAttachmentCoreSchema = z.discriminatedUnion(\"target\", [workflowAttachmentSchema, agentAttachmentSchema]);\nconst TRIGGER_ATTACHMENT = Symbol.for(\"keystroke.triggerAttachment\");\n/**\n* Validates brand + shape via `triggerAttachmentCoreSchema` so server discovery\n* rejects unbranded or malformed attachments.\n*/\nfunction isTriggerAttachment(value) {\n\tif (typeof value !== \"object\" || value === null) return false;\n\tif (!(TRIGGER_ATTACHMENT in value) || value[TRIGGER_ATTACHMENT] !== true) return false;\n\treturn triggerAttachmentCoreSchema.safeParse(value).success;\n}\nfunction isWorkflowTriggerAttachment(attachment) {\n\treturn attachment.target === \"workflow\";\n}\nfunction isAgentTriggerAttachment(attachment) {\n\treturn attachment.target === \"agent\";\n}\n//#endregion\n//#region src/attachment-key.ts\nfunction workflowKeyFromDefinition(workflow) {\n\tconst slug = workflow.slug?.trim();\n\tif (!slug) throw new Error(\"Workflow definition requires a non-empty slug\");\n\treturn slug;\n}\nfunction agentKeyFromAgent(agent) {\n\tconst slug = agent.slug?.trim();\n\tif (!slug) throw new Error(\"Agent definition requires a non-empty slug\");\n\treturn slug;\n}\nfunction attachmentKeyFrom(triggerKey, targetKey) {\n\treturn `${triggerKey}:${targetKey}`;\n}\n//#endregion\n//#region src/attach-options.ts\nfunction isAgentAttachOptions(options) {\n\treturn \"agent\" in options;\n}\n//#endregion\n//#region src/define-trigger-attachment.ts\n/**\n* Internal helper used by source `.attach()` factories. Validates the\n* attachment shape against `triggerAttachmentCoreSchema` and applies the\n* `TRIGGER_ATTACHMENT` brand.\n*/\nfunction defineTriggerAttachment(input) {\n\tconst result = triggerAttachmentCoreSchema.safeParse(input);\n\tif (!result.success) throw new Error(`Invalid trigger attachment: ${formatIssues(result.error.issues)}`);\n\treturn {\n\t\t...input,\n\t\t[TRIGGER_ATTACHMENT]: true\n\t};\n}\nfunction formatIssues(issues) {\n\treturn issues.map((issue) => {\n\t\treturn `${issue.path.length > 0 ? `${issue.path.join(\".\")}: ` : \"\"}${issue.message}`;\n\t}).join(\"; \");\n}\n//#endregion\n//#region src/attach-from-source.ts\nfunction attachFromSource(source, triggerKey, options) {\n\tif (isAgentAttachOptions(options)) return defineTriggerAttachment({\n\t\tkey: attachmentKeyFrom(triggerKey, agentKeyFromAgent(options.agent)),\n\t\tsource,\n\t\ttarget: \"agent\",\n\t\tagent: options.agent,\n\t\tprompt: options.prompt\n\t});\n\treturn defineTriggerAttachment({\n\t\tkey: attachmentKeyFrom(triggerKey, workflowKeyFromDefinition(options.workflow)),\n\t\tsource,\n\t\ttarget: \"workflow\",\n\t\tworkflow: options.workflow,\n\t\ttransform: options.transform\n\t});\n}\n//#endregion\n//#region src/trigger-match-schema.ts\nfunction matchShapeAndFilter(shape, filter, payload) {\n\tconst shaped = shape.safeParse(payload);\n\tif (!shaped.success) return;\n\tif (filter && !filter.safeParse(shaped.data).success) return;\n\treturn shaped.data;\n}\nfunction passesShapeAndFilter(shape, filter, payload) {\n\treturn matchShapeAndFilter(shape, filter, payload) !== void 0;\n}\nfunction matchWebhookPayload(raw, schemas) {\n\tconst matches = [];\n\tif (typeof z.fromJSONSchema !== \"function\") throw new Error(\"z.fromJSONSchema is required for JSON schema matching\");\n\tfor (const schema of schemas) {\n\t\tconst data = matchShapeAndFilter(z.fromJSONSchema(schema.requestSchema), schema.filterSchema ? z.fromJSONSchema(schema.filterSchema) : void 0, raw);\n\t\tif (data === void 0) continue;\n\t\tmatches.push({\n\t\t\tattachmentKey: schema.attachmentKey,\n\t\t\tdata\n\t\t});\n\t}\n\treturn matches;\n}\n/** Live Zod validation for webhook `request` + optional Zod `filter` (in-process paths). */\nfunction passesTriggerMatch(shape, filter, payload) {\n\treturn passesShapeAndFilter(shape, filter, payload);\n}\n//#endregion\n//#region src/sources/webhook-source.ts\nfunction normalizeWebhookEndpoint(endpoint) {\n\treturn endpoint.replace(/^\\/+|\\/+$/g, \"\").replace(/^triggers\\/?/, \"\");\n}\nfunction webhookObjectSchema(schema) {\n\tif (schema instanceof z.ZodObject) return schema.loose();\n\treturn schema;\n}\n/**\n* Defines a webhook trigger source — fires its attached workflow when a request\n* hits `/triggers/{endpoint}` and satisfies `request` plus any optional `filter`.\n*\n* @param options.key - Stable trigger key; attachment id is `{key}:{workflowKey}`.\n* @param options.endpoint - Shared route suffix under `/triggers/` (e.g. `\"stripe\"`).\n*/\nfunction defineWebhookSource(options) {\n\tconst triggerKey = options.key.trim();\n\tif (!triggerKey) throw new Error(\"defineWebhookSource requires a non-empty key\");\n\tconst endpoint = normalizeWebhookEndpoint(options.endpoint);\n\tif (!endpoint) throw new Error(\"defineWebhookSource requires a non-empty endpoint\");\n\tconst request = webhookObjectSchema(options.request);\n\tconst filter = options.filter ? webhookObjectSchema(options.filter) : void 0;\n\tconst source = {\n\t\tkind: \"webhook\",\n\t\tkey: triggerKey,\n\t\tendpoint,\n\t\trequest,\n\t\tfilter,\n\t\tpasses(payload) {\n\t\t\treturn passesTriggerMatch(request, filter, payload);\n\t\t},\n\t\tattach(attachOptions) {\n\t\t\treturn attachFromSource(source, triggerKey, attachOptions);\n\t\t}\n\t};\n\treturn source;\n}\n//#endregion\n//#region src/sources/cron-source.ts\n/**\n* Defines a cron trigger source — fires its attached workflow on a schedule.\n*\n* @param options.key - Stable trigger key; the attachment id is `{key}:{workflowKey}`.\n* @param options.schedule - A cron expression. Pass a 5-field literal (e.g.\n*   `\"0 9 * * *\"`) for compile-time shape checking, or wrap with\n*   `parseCronSchedule(...)` for 6-field, named (`MON`), or `@daily`-style\n*   schedules. Validated at runtime; throws if the expression is invalid.\n* @example\n* defineCronSource({ key: \"morning\", schedule: \"0 9 * * *\" }).attach({ workflow });\n*/\nfunction defineCronSource(options) {\n\tconst triggerKey = options.key.trim();\n\tif (!triggerKey) throw new Error(\"defineCronSource requires a non-empty key\");\n\tconst source = {\n\t\tkind: \"cron\",\n\t\tkey: triggerKey,\n\t\tschedule: parseCronSchedule(options.schedule),\n\t\tattach(attachOptions) {\n\t\t\treturn attachFromSource(source, triggerKey, attachOptions);\n\t\t}\n\t};\n\treturn source;\n}\n//#endregion\n//#region src/sources/poll-source.ts\n/**\n* Defines a poll trigger source — runs `run` on a schedule and, when the result\n* passes any `.filter(...)`, fires the attached workflow with it.\n*\n* @param options.key - Stable trigger key; the attachment id is `{key}:{workflowKey}`.\n* @param options.id - Optional group id; poll sources sharing an id poll together.\n* @param options.schedule - Cron expression for the poll cadence (see `defineCronSource`).\n* @param options.run - Produces the payload checked by `filter` and passed to the workflow.\n* @param options.filter - Source-level predicate; the workflow only fires when it returns true.\n* @example\n* definePollSource({ key: \"inbox\", schedule: \"0 * * * *\", run: fetchInbox })\n*   .filter((r) => r.length > 0)\n*   .attach({ workflow });\n*/\nfunction definePollSource(options) {\n\tconst triggerKey = options.key.trim();\n\tif (!triggerKey) throw new Error(\"definePollSource requires a non-empty key\");\n\tconst schedule = parseCronSchedule(options.schedule);\n\tconst filters = [];\n\tif (options.filter) filters.push(options.filter);\n\tconst source = {\n\t\tkind: \"poll\",\n\t\tkey: triggerKey,\n\t\tid: options.id,\n\t\tschedule,\n\t\trun: options.run,\n\t\tfilters,\n\t\tpasses(payload) {\n\t\t\treturn source.filters.every((candidate) => candidate(payload));\n\t\t},\n\t\tattach(attachOptions) {\n\t\t\treturn attachFromSource(source, triggerKey, attachOptions);\n\t\t}\n\t};\n\tconst chain = source;\n\tchain.filter = (fn) => {\n\t\tsource.filters.push(fn);\n\t\treturn chain;\n\t};\n\treturn chain;\n}\n//#endregion\n//#region src/ephemeral-match.ts\nfunction emptyObjectSchema() {\n\treturn {\n\t\ttype: \"object\",\n\t\tproperties: {},\n\t\trequired: []\n\t};\n}\nfunction setConstAtPath(schema, path, value) {\n\tconst [head, ...rest] = path;\n\tif (!head) return;\n\tif (!schema.required.includes(head)) schema.required.push(head);\n\tif (rest.length === 0) {\n\t\tschema.properties[head] = { const: value };\n\t\treturn;\n\t}\n\tconst existing = schema.properties[head];\n\tconst child = existing && typeof existing === \"object\" && existing.type === \"object\" ? existing : emptyObjectSchema();\n\tschema.properties[head] = child;\n\tsetConstAtPath(child, rest, value);\n}\n/**\n* Compiles a shallow `match` object into a JSON Schema usable as a stored webhook\n* `requestSchema`. Dots in keys are treated as path separators; an empty match\n* produces a schema that accepts any JSON object payload.\n*/\nfunction matchToJsonSchema(match) {\n\tconst schema = emptyObjectSchema();\n\tfor (const [path, value] of Object.entries(match)) setConstAtPath(schema, path.split(\".\").filter((segment) => segment.length > 0), value);\n\tif (schema.required.length === 0) return { type: \"object\" };\n\treturn schema;\n}\n//#endregion\n//#region src/interpolate-prompt.ts\nfunction resolvePath(payload, path) {\n\tlet current = payload;\n\tfor (const segment of path) {\n\t\tif (current === null || typeof current !== \"object\") return;\n\t\tcurrent = current[segment];\n\t}\n\treturn current;\n}\n/**\n* Resolves `{{path}}` / `{{payload.path}}` dot-path tokens in an ephemeral trigger\n* prompt against the webhook payload. Unresolved tokens are left untouched so the\n* agent can see what failed to bind.\n*/\nfunction interpolatePrompt(template, payload) {\n\treturn template.replace(/\\{\\{\\s*([\\w.$-]+)\\s*\\}\\}/g, (token, rawPath) => {\n\t\tconst segments = rawPath.split(\".\");\n\t\tif (segments[0] === \"payload\") segments.shift();\n\t\tconst value = segments.length === 0 ? payload : resolvePath(payload, segments);\n\t\tif (value === void 0) return token;\n\t\treturn typeof value === \"string\" ? value : JSON.stringify(value);\n\t});\n}\n//#endregion\n//#region src/resolve-agent-prompt.ts\n/** Resolves the agent prompt for a validated trigger payload. */\nfunction resolveAgentPrompt(attachment, payload) {\n\tconst prompt = attachment.prompt;\n\tif (typeof prompt === \"function\") return prompt(payload ?? {});\n\treturn prompt;\n}\n//#endregion\n//#region src/resolve-attachment-input.ts\nfunction applyAttachmentTransform(attachment, payload) {\n\treturn attachment.transform ? attachment.transform(payload) : payload;\n}\n/**\n* Applies attachment `transform` to a payload that already passed source validation.\n* Webhook payloads are matched at ingress via persisted Zod JSON schemas.\n*/\nfunction resolveAttachmentTransform(attachment, payload) {\n\tif (isAgentTriggerAttachment(attachment)) return payload;\n\treturn applyAttachmentTransform(attachment, payload);\n}\n/** Applies poll source filters and attachment `transform`. Webhook ingress already matched Zod schemas. */\nfunction resolveAttachmentInput(attachment, payload) {\n\tconst source = attachment.source;\n\tif (source.kind === \"poll\" && !source.passes(payload)) return;\n\tif (isAgentTriggerAttachment(attachment)) return payload;\n\treturn applyAttachmentTransform(attachment, payload);\n}\n//#endregion\nexport { TRIGGER_ATTACHMENT, cronScheduleSchema, defineCronSource, definePollSource, defineWebhookSource, interpolatePrompt, isAgentTriggerAttachment, isTriggerAttachment, isWorkflowTriggerAttachment, matchToJsonSchema, matchWebhookPayload, nextTriggerRunAt, normalizeWebhookEndpoint, parseCronSchedule, parseTriggerSchedule, resolveAgentPrompt, resolveAttachmentInput, resolveAttachmentTransform, resolveCronSchedule };\n\n//# sourceMappingURL=index.mjs.map"],"x_google_ignoreList":[0,1,2],"mappings":";;;AA6BA,SAAgB,oBAAoB,MAAM;CACtC,OAAO;EACH,QAAQ,KAAK,WAAW;EACxB,QAAQ,KAAK,WAAW;EACxB,MAAM,KAAK,SAAS;EACpB,KAAK,KAAK,QAAQ;EAClB,OAAO,KAAK,SAAS;EACrB,SAAS,KAAK,OAAO;EACrB,MAAM,KAAK,YAAY;CAC3B;AACJ;AAEA,SAAgB,eAAe,MAAM,OAAO;CACxC,OAAO,IAAI,KAAK,MAAM,QAAQ,GAAG,CAAC,EAAE,QAAQ;AAChD;AAEA,SAAgB,uBAAuB,UAAU,UAAU;CACvD,IAAI,YAAY,UACZ,OAAO,WAAW;CAEtB,OAAO,IAAI,WAAW,WAAW;AACrC;;;ACjDA,IAAa,OAAb,MAAkB;CACd,YAAY,EAAE,SAAS,SAAS,OAAO,MAAM,QAAQ,YAAa;EAE9D,IAAI,CAAC,WAAW,QAAQ,SAAS,GAC7B,MAAM,IAAI,MAAM,4CAA4C;EAChE,IAAI,CAAC,WAAW,QAAQ,SAAS,GAC7B,MAAM,IAAI,MAAM,4CAA4C;EAChE,IAAI,CAAC,SAAS,MAAM,SAAS,GACzB,MAAM,IAAI,MAAM,0CAA0C;EAC9D,IAAI,CAAC,UAAU,OAAO,SAAS,GAC3B,MAAM,IAAI,MAAM,2CAA2C;EAC/D,KAAK,CAAC,YAAY,SAAS,SAAS,OAAO,CAAC,QAAQ,KAAK,SAAS,IAC9D,MAAM,IAAI,MAAM,oDAAoD;EAExE,KAAK,UAAU,MAAM,KAAK,OAAO,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;EACvD,KAAK,UAAU,MAAM,KAAK,OAAO,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;EACvD,KAAK,QAAQ,MAAM,KAAK,KAAK,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;EACnD,KAAK,OAAO,MAAM,KAAK,IAAI,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;EACjD,KAAK,SAAS,MAAM,KAAK,MAAM,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;EACrD,KAAK,WAAW,MAAM,KAAK,QAAQ,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;EAEzD,MAAM,gBAAgB,MAAM,MAAM,eAAe;GAC7C,IAAI,KAAK,MAAM,MAAM,OAAO,MAAM,YAC9B,IAAI,MAAM,KACV,IAAI,WAAW,OACf,IAAI,WAAW,GAAG,GAClB,MAAM,IAAI,MAAM,GAAG,KAAK,+DAA+D,WAAW,IAAI,OAAO,WAAW,KAAK;EAErI;EACA,aAAa,WAAW,KAAK,SAAS;GAAE,KAAK;GAAG,KAAK;EAAG,CAAC;EACzD,aAAa,WAAW,KAAK,SAAS;GAAE,KAAK;GAAG,KAAK;EAAG,CAAC;EACzD,aAAa,SAAS,KAAK,OAAO;GAAE,KAAK;GAAG,KAAK;EAAG,CAAC;EACrD,aAAa,QAAQ,KAAK,MAAM;GAAE,KAAK;GAAG,KAAK;EAAG,CAAC;EACnD,aAAa,UAAU,KAAK,QAAQ;GAAE,KAAK;GAAG,KAAK;EAAG,CAAC;EACvD,aAAa,YAAY,KAAK,UAAU;GAAE,KAAK;GAAG,KAAK;EAAE,CAAC;EAE1D,KAAK,WAAW;GACZ,SAAS,KAAK,QAAQ,KAAK,MAAM,CAAC,EAAE,QAAQ;GAC5C,SAAS,KAAK,QAAQ,KAAK,MAAM,CAAC,EAAE,QAAQ;GAC5C,OAAO,KAAK,MAAM,KAAK,MAAM,CAAC,EAAE,QAAQ;GACxC,MAAM,KAAK,KAAK,KAAK,MAAM,CAAC,EAAE,QAAQ;GACtC,QAAQ,KAAK,OAAO,KAAK,MAAM,CAAC,EAAE,QAAQ;GAC1C,UAAU,KAAK,SAAS,KAAK,MAAM,CAAC,EAAE,QAAQ;EAClD;CACJ;;;;;CAKA,gBAAgB,KAAK,WAAW;EAC5B,OAAO,QAAQ,SACT,KAAK,MAAM,MAAM,MAAM,KAAK,SAAS,IACrC,KAAK,SAAS,MAAM,MAAM,MAAM,KAAK,SAAS;CACxD;;;;;CAKA,kBAAkB,KAAK,aAAa;EAChC,OAAO,QAAQ,SACT,KAAK,QAAQ,MAAM,MAAM,KAAK,WAAW,IACzC,KAAK,SAAS,QAAQ,MAAM,MAAM,KAAK,WAAW;CAC5D;;;;;CAKA,kBAAkB,KAAK,aAAa;EAChC,OAAO,QAAQ,SACT,KAAK,QAAQ,MAAM,MAAM,IAAI,WAAW,IACxC,KAAK,SAAS,QAAQ,MAAM,MAAM,IAAI,WAAW;CAC3D;;;;;CAKA,gBAAgB,KAAK,WAAW;EAE5B,IAAI,OAAO,KAAK,gBAAgB,KAAK,UAAU,IAAI;EACnD,IAAI,SAAS,KAAA,GACT,IAAI,SAAS,UAAU,MAAM;GAEzB,IAAI,SAAS,KAAK,kBAAkB,KAAK,UAAU,MAAM;GACzD,IAAI,WAAW,KAAA,GACX,IAAI,WAAW,UAAU,QAAQ;IAE7B,MAAM,SAAS,KAAK,kBAAkB,KAAK,UAAU,MAAM;IAC3D,IAAI,WAAW,KAAA,GAEX,OAAO;KAAE;KAAM;KAAQ;IAAO;IAGlC,SAAS,KAAK,kBAAkB,KAAK,QAAQ,SAAS,UAAU,SAAS,IAAI,UAAU,SAAS,CAAC;IACjG,IAAI,WAAW,KAAA,GAEX,OAAO;KACH;KACA;KACA,QAAQ,QAAQ,SAAS,KAAK,QAAQ,KAAK,KAAK,SAAS,QAAQ;IACrE;GAER,OAGI,OAAO;IACH;IACA;IACA,QAAQ,QAAQ,SAAS,KAAK,QAAQ,KAAK,KAAK,SAAS,QAAQ;GACrE;GAIR,OAAO,KAAK,gBAAgB,KAAK,QAAQ,SAAS,UAAU,OAAO,IAAI,UAAU,OAAO,CAAC;GACzF,IAAI,SAAS,KAAA,GAET,OAAO;IACH;IACA,QAAQ,QAAQ,SAAS,KAAK,QAAQ,KAAK,KAAK,SAAS,QAAQ;IACjE,QAAQ,QAAQ,SAAS,KAAK,QAAQ,KAAK,KAAK,SAAS,QAAQ;GACrE;EAER,OAGI,OAAO;GACH;GACA,QAAQ,QAAQ,SAAS,KAAK,QAAQ,KAAK,KAAK,SAAS,QAAQ;GACjE,QAAQ,QAAQ,SAAS,KAAK,QAAQ,KAAK,KAAK,SAAS,QAAQ;EACrE;CAKZ;;;;;CAKA,sBAAsB,KAAK,MAAM,OAAO,UAAU;EAC9C,IAAI,IAAI;EACR,IAAI,WAAW,GACX,MAAM,IAAI,MAAM,sCAAsC;EAK1D,MAAM,cAAc,eAAe,MAAM,KAAK;EAC9C,MAAM,iBAAiB,KAAK,KAAK,WAAW;EAC5C,MAAM,qBAAqB,KAAK,SAAS,WAAW;EACpD,IAAI,CAAC,kBAAkB,CAAC,oBAAoB;GACxC,IAAI,WAAW,aACX,OAAO,QAAQ,SAAS,KAAA,IAAY;GAExC,OAAO;EACX;EAEA,IAAI;EACJ,IAAI,gBAAgB;GAChB,mBACI,QAAQ,SACF,KAAK,KAAK,MAAM,MAAM,KAAK,QAAQ,IACnC,KAAK,SAAS,KAAK,MAAM,MAAM,KAAK,QAAQ;GAEtD,IAAI,qBAAqB,KAAA,KAAa,mBAAmB,aACrD,mBAAmB,KAAA;EAE3B;EAEA,IAAI;EACJ,IAAI,oBAAoB;GACpB,MAAM,eAAe,IAAI,KAAK,MAAM,OAAO,QAAQ,EAAE,OAAO;GAC5D,MAAM,wBAAwB,QAAQ,UAC9B,KAAK,KAAK,SAAS,MAAM,MAAM,KAAK,YAAY,OAAO,QAAQ,OAAO,KAAK,IAAI,KAAK,KAAK,SAAS,MAClG,KAAK,KAAK,SAAS,SAAS,MAAM,MAAM,KAAK,YAAY,OAAO,QAAQ,OAAO,KAAK,IAAI,KAAK,KAAK,SAAS,SAAS;GAC5H,IAAI,0BAA0B,KAAA,GAAW;IACrC,MAAM,sBAAsB,QAAQ,SAC9B,uBAAuB,cAAc,qBAAqB,IAC1D,uBAAuB,uBAAuB,YAAY;IAChE,uBACI,QAAQ,SACF,WAAW,sBACX,WAAW;IAErB,IAAI,uBAAuB,eAAe,uBAAuB,GAC7D,uBAAuB,KAAA;GAE/B;EACJ;EACA,IAAI,qBAAqB,KAAA,KAAa,yBAAyB,KAAA,GAG3D,OAAO,QAAQ,SACT,KAAK,IAAI,kBAAkB,oBAAoB,IAC/C,KAAK,IAAI,kBAAkB,oBAAoB;EAEzD,IAAI,qBAAqB,KAAA,GACrB,OAAO;EAEX,IAAI,yBAAyB,KAAA,GACzB,OAAO;CAGf;;CAEA,YAAY,4BAAY,IAAI,KAAK,GAAG;EAChC,MAAM,oBAAoB,oBAAoB,SAAS;EACvD,IAAI,UAAU,kBAAkB;EAChC,IAAI,kBAAkB,KAAK,OAAO,WAAW,MAAM,KAAK,kBAAkB,KAAK;EAC/E,IAAI,oBAAoB,IAAI;GACxB,kBAAkB;GAClB;EACJ;EAGA,MAAM,gBAAgB,KAAK,OAAO,SAAS;EAC3C,KAAK,IAAI,IAAI,GAAG,IAAI,eAAe,KAAK;GAEpC,MAAM,OAAO,UAAU,KAAK,OAAO,kBAAkB,KAAK,KAAK,OAAO,MAAM;GAC5E,MAAM,QAAQ,KAAK,QAAQ,kBAAkB,KAAK,KAAK,OAAO;GAC9D,MAAM,eAAe,SAAS,kBAAkB,QAAQ,UAAU,kBAAkB;GAEpF,IAAI,MAAM,KAAK,sBAAsB,QAAQ,MAAM,OAAO,eAAe,kBAAkB,MAAM,CAAC;GAClG,IAAI,aAAa,gBAAgB,QAAQ,kBAAkB;GAE3D,IAAI,QAAQ,KAAA,KAAa,YAAY;IACjC,MAAM,WAAW,KAAK,gBAAgB,QAAQ,iBAAiB;IAC/D,IAAI,aAAa,KAAA,GACb,OAAO,IAAI,KAAK,MAAM,OAAO,KAAK,SAAS,MAAM,SAAS,QAAQ,SAAS,MAAM;IAGrF,MAAM,KAAK,sBAAsB,QAAQ,MAAM,OAAO,MAAM,CAAC;IAC7D,aAAa;GACjB;GAGA,IAAI,QAAQ,KAAA,KAAa,CAAC,YACtB,OAAO,IAAI,KAAK,MAAM,OAAO,KAAK,KAAK,MAAM,IAAI,KAAK,QAAQ,IAAI,KAAK,QAAQ,EAAE;EAGzF;EACA,MAAM,IAAI,MAAM,+BAA+B;CACnD;;CAEA,aAAa,QAAQ,WAAW;EAC5B,MAAM,QAAQ,CAAC;EACf,IAAI;EACJ,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;GAC7B,WAAW,KAAK,YAAY,aAAa,QAAQ,aAAa,KAAK,IAAI,WAAW,SAAS;GAC3F,MAAM,KAAK,QAAQ;EACvB;EACA,OAAO;CACX;;;;;CAKA,CAAC,qBAAqB,WAAW,SAAS;EACtC,IAAI;EACJ,OAAO,MAAM;GACT,WAAW,KAAK,YAAY,aAAa,QAAQ,aAAa,KAAK,IAAI,WAAW,SAAS;GAC3F,IAAI,WAAW,QAAQ,QAAQ,IAAI,SAAS,QAAQ,GAChD;GAEJ,MAAM;EACV;CACJ;;CAEA,YAAY,4BAAY,IAAI,KAAK,GAAG;EAChC,MAAM,oBAAoB,oBAAoB,SAAS;EACvD,IAAI,UAAU,kBAAkB;EAChC,IAAI,kBAAkB,KAAK,SAAS,OAAO,WAAW,MAAM,KAAK,kBAAkB,KAAK;EACxF,IAAI,oBAAoB,IAAI;GACxB,kBAAkB;GAClB;EACJ;EAGA,MAAM,gBAAgB,KAAK,SAAS,OAAO,SAAS;EACpD,KAAK,IAAI,IAAI,GAAG,IAAI,eAAe,KAAK;GAEpC,MAAM,OAAO,UACT,KAAK,OAAO,kBAAkB,KAAK,KAAK,SAAS,OAAO,MAAM;GAClE,MAAM,QAAQ,KAAK,SAAS,QAAQ,kBAAkB,KAAK,KAAK,SAAS,OAAO;GAChF,MAAM,eAAe,SAAS,kBAAkB,QAAQ,UAAU,kBAAkB;GAEpF,IAAI,MAAM,KAAK,sBAAsB,QAAQ,MAAM,OAAO,eACpD,kBAAkB,MAEhB,eAAe,MAAM,KAAK,CAAC;GACnC,IAAI,aAAa,gBAAgB,QAAQ,kBAAkB;GAE3D,IAAI,QAAQ,KAAA,KAAa,YAAY;IACjC,MAAM,WAAW,KAAK,gBAAgB,QAAQ,iBAAiB;IAC/D,IAAI,aAAa,KAAA,GACb,OAAO,IAAI,KAAK,MAAM,OAAO,KAAK,SAAS,MAAM,SAAS,QAAQ,SAAS,MAAM;IAGrF,IAAI,MAAM,GAAG;KACT,MAAM,KAAK,sBAAsB,QAAQ,MAAM,OAAO,MAAM,CAAC;KAC7D,aAAa;IACjB;GACJ;GAGA,IAAI,QAAQ,KAAA,KAAa,CAAC,YACtB,OAAO,IAAI,KAAK,MAAM,OAAO,KAAK,KAAK,SAAS,MAAM,IAAI,KAAK,SAAS,QAAQ,IAAI,KAAK,SAAS,QAAQ,EAAE;EAGpH;EACA,MAAM,IAAI,MAAM,mCAAmC;CACvD;;CAEA,aAAa,QAAQ,WAAW;EAC5B,MAAM,QAAQ,CAAC;EACf,IAAI;EACJ,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;GAC7B,WAAW,KAAK,YAAY,aAAa,QAAQ,aAAa,KAAK,IAAI,WAAW,SAAS;GAC3F,MAAM,KAAK,QAAQ;EACvB;EACA,OAAO;CACX;;;;;CAKA,CAAC,qBAAqB,WAAW,SAAS;EACtC,IAAI;EACJ,OAAO,MAAM;GACT,WAAW,KAAK,YAAY,aAAa,QAAQ,aAAa,KAAK,IAAI,WAAW,SAAS;GAC3F,IAAI,WAAW,QAAQ,QAAQ,IAAI,SAAS,QAAQ,GAChD;GAEJ,MAAM;EACV;CACJ;;CAEA,UAAU,MAAM;EACZ,MAAM,EAAE,QAAQ,QAAQ,MAAM,KAAK,OAAO,YAAY,oBAAoB,IAAI;EAC9E,IAAI,KAAK,QAAQ,QAAQ,MAAM,MAAM,MACjC,KAAK,QAAQ,QAAQ,MAAM,MAAM,MACjC,KAAK,MAAM,QAAQ,IAAI,MAAM,MAC7B,KAAK,OAAO,QAAQ,KAAK,MAAM,IAC/B,OAAO;EAEX,IAAI,KAAK,KAAK,WAAW,MAAM,KAAK,SAAS,WAAW,GACpD,OAAQ,KAAK,KAAK,QAAQ,GAAG,MAAM,MAAM,KAAK,SAAS,QAAQ,OAAO,MAAM;EAEhF,OAAQ,KAAK,KAAK,QAAQ,GAAG,MAAM,MAAM,KAAK,SAAS,QAAQ,OAAO,MAAM;CAChF;AACJ;;;AC7VA,MAAM,mBAAmB;CACrB,KAAK;CACL,KAAK;AACT;AACA,MAAM,mBAAmB;CACrB,KAAK;CACL,KAAK;AACT;AACA,MAAM,iBAAiB;CACnB,KAAK;CACL,KAAK;AACT;AACA,MAAM,gBAAgB;CAClB,KAAK;CACL,KAAK;AACT;AACA,MAAM,kBAAkB;CACpB,KAAK;CACL,KAAK;CACL,SAAS;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;CACT;AACJ;AACA,MAAM,oBAAoB;CACtB,KAAK;CACL,KAAK;CACL,SAAS;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;CACT;AACJ;AACA,MAAM,gBAAgB;CAClB,WAAW;CACX,aAAa;CACb,YAAY;CACZ,WAAW;CACX,UAAU;CACV,WAAW;CACX,aAAa;AACjB;AACA,SAAS,aAAa,SAAS,YAAY;CACvC,MAAM,yBAAS,IAAI,IAAI;CAEvB,IAAI,YAAY,KAAK;EACjB,KAAK,IAAI,IAAI,WAAW,KAAK,KAAK,WAAW,KAAK,IAAI,IAAI,GACtD,OAAO,IAAI,CAAC;EAEhB,OAAO;CACX;CAEA,MAAM,eAAe,QAAQ,MAAM,GAAG;CACtC,IAAI,aAAa,SAAS,GAAG;EACzB,KAAK,MAAM,eAAe,cAAc;GACpC,MAAM,oBAAoB,aAAa,aAAa,UAAU;GAC9D,KAAK,MAAM,KAAK,mBACZ,OAAO,IAAI,CAAC;EAEpB;EACA,OAAO;CACX;CAEA,MAAM,sBAAsB,kBAAkB;EAC1C,IAAI,IAAI;EACR,iBACK,MAAM,KAAK,WAAW,aAAa,QAAQ,OAAO,KAAK,IAAI,KAAK,IAAI,GAAG,cAAc,YAAY,QAAQ,QAAQ,OAAO,KAAK,IAAI,KAAK;EAC3I,MAAM,gBAAgB,OAAO,SAAS,eAAe,EAAE;EACvD,IAAI,OAAO,MAAM,aAAa,GAC1B,MAAM,IAAI,MAAM,mBAAmB,QAAQ,IAAI,cAAc,SAAS;EAE1E,IAAI,gBAAgB,WAAW,OAAO,gBAAgB,WAAW,KAC7D,MAAM,IAAI,MAAM,mBAAmB,QAAQ,IAAI,cAAc,qCAAqC,WAAW,IAAI,KAAK,WAAW,IAAI,EAAE;EAE3I,OAAO;CACX;CAKA,MAAM,gBAAgB,oDAAoD,KAAK,OAAO;CAEtF,IAAI,kBAAkB,MAAM;EACxB,OAAO,IAAI,mBAAmB,OAAO,CAAC;EACtC,OAAO;CACX;CAEA,IAAI,cAAc,cAAc,OAAO,MACjC,WAAW,MACX,mBAAmB,cAAc,EAAE;CACzC,MAAM,YAAY,cAAc,OAAO,MACjC,WAAW,MACX,mBAAmB,cAAc,EAAE;CAEzC,IAAI,eAAe,qBACf,gBAAgB,KAEhB,cAAc,GACd,cAAc;CAElB,IAAI,cAAc,WACd,MAAM,IAAI,MAAM,mBAAmB,QAAQ,0BAA0B,YAAY,SAAS,UAAU,GAAG;CAG3G,MAAM,OAAO,cAAc;CAC3B,IAAI,aAAa;CACjB,IAAI,SAAS,KAAA,GAAW;EACpB,aAAa,OAAO,SAAS,MAAM,EAAE;EACrC,IAAI,OAAO,MAAM,UAAU,GACvB,MAAM,IAAI,MAAM,yBAAyB,KAAK,SAAS;EAE3D,IAAI,aAAa,GACb,MAAM,IAAI,MAAM,kCAAkC,KAAK,uBAAuB;CAEtF;CAEA,KAAK,IAAI,IAAI,aAAa,KAAK,WAAW,IAAI,IAAI,YAC9C,OAAO,IAAI,CAAC;CAEhB,OAAO;AACX;;AAEA,SAAgB,oBAAoB,gBAAgB;CAChD,IAAI;CACJ,IAAI,OAAO,mBAAmB,UAC1B,MAAM,IAAI,UAAU,kDAAkD;CAG1E,kBAAkB,KAAK,cAAc,eAAe,YAAY,QAAQ,QAAQ,OAAO,KAAK,IAAI,KAAK;CAErG,MAAM,WAAW,eAAe,MAAM,GAAG,EAAE,QAAQ,SAAS,KAAK,SAAS,CAAC;CAC3E,IAAI,SAAS,SAAS,KAAK,SAAS,SAAS,GACzC,MAAM,IAAI,MAAM,oDAAoD;CAExE,MAAM,aAAa,SAAS,WAAW,IAAI,SAAS,KAAK;CACzD,MAAM,aAAa,SAAS,WAAW,IAAI,SAAS,KAAK,SAAS;CAClE,MAAM,WAAW,SAAS,WAAW,IAAI,SAAS,KAAK,SAAS;CAChE,MAAM,UAAU,SAAS,WAAW,IAAI,SAAS,KAAK,SAAS;CAC/D,MAAM,YAAY,SAAS,WAAW,IAAI,SAAS,KAAK,SAAS;CACjE,MAAM,cAAc,SAAS,WAAW,IAAI,SAAS,KAAK,SAAS;CACnE,OAAO,IAAI,KAAK;EACZ,SAAS,aAAa,YAAY,gBAAgB;EAClD,SAAS,aAAa,YAAY,gBAAgB;EAClD,OAAO,aAAa,UAAU,cAAc;EAC5C,MAAM,aAAa,SAAS,aAAa;EAEzC,QAAQ,IAAI,IAAI,MAAM,KAAK,aAAa,WAAW,eAAe,CAAC,EAAE,KAAK,MAAM,IAAI,CAAC,CAAC;EACtF,UAAU,IAAI,IAAI,MAAM,KAAK,aAAa,aAAa,iBAAiB,CAAC,EAAE,KAAK,MAAM,IAAI,CAAC,CAAC;CAChG,CAAC;AACL;;;;;;;;;;ACzJA,MAAM,qBAAqB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,0CAA0C,EAAE,OAAO,iBAAiB,iCAAiC,EAAE,MAAM;;AAEjK,SAAS,kBAAkB,OAAO;CACjC,OAAO,mBAAmB,MAAM,KAAK;AACtC;;;;;;AAMA,SAAS,oBAAoB,cAAc,UAAU,SAAS;CAC7D,OAAO,QAAQ,8BAA8B,iBAAiB,QAAQ,wBAAwB;AAC/F;;AAEA,SAAS,qBAAqB,UAAU;CACvC,OAAO,OAAO,QAAQ;AACvB;;AAEA,SAAS,iBAAiB,UAAU,uBAAuB,IAAI,KAAK,GAAG;CACtE,OAAO,OAAO,QAAQ,EAAE,YAAY,IAAI;AACzC;;;;;AAKA,SAAS,OAAO,UAAU;CACzB,OAAO,oBAAoB,QAAQ;AACpC;AACA,SAAS,gBAAgB,OAAO;CAC/B,IAAI;EACH,OAAO,KAAK;EACZ,OAAO;CACR,QAAQ;EACP,OAAO;CACR;AACD;AAGA,MAAM,YAAY,EAAE,QAAQ,MAAM,aAAa,EAAE,SAAS,sBAAsB;AAChF,MAAM,iBAAiB,EAAE,QAAQ,MAAM,WAAW,CAAC,GAAG,6BAA6B;AACnF,MAAM,cAAc,EAAE,QAAQ,MAAM,OAAO,MAAM,YAAY,MAAM,QAAQ,OAAO,EAAE,SAAS,YAAY,EAAE,KAAK,KAAK,EAAE,SAAS,KAAK,OAAO,EAAE,WAAW,YAAY,0BAA0B;AAC/L,MAAM,eAAe,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,EAAE,SAAS,CAAC,CAAC;AACvD,MAAM,kBAAkB;CACvB,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC;CAC5B,QAAQ,EAAE,SAAS;AACpB;AACA,MAAM,sBAAsB,EAAE,OAAO;CACpC,MAAM,EAAE,QAAQ,SAAS;CACzB,GAAG;CACH,UAAU,EAAE,OAAO,EAAE,IAAI,CAAC;CAC1B,SAAS;CACT,QAAQ,UAAU,SAAS;CAC3B,QAAQ,EAAE,SAAS;AACpB,CAAC;AACD,MAAM,mBAAmB,EAAE,OAAO;CACjC,MAAM,EAAE,QAAQ,MAAM;CACtB,GAAG;CACH,UAAU;AACX,CAAC;AACD,MAAM,mBAAmB,EAAE,OAAO;CACjC,MAAM,EAAE,QAAQ,MAAM;CACtB,GAAG;CACH,IAAI,EAAE,OAAO,EAAE,SAAS;CACxB,UAAU;CACV,KAAK,EAAE,SAAS;CAChB,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC;CAC7B,QAAQ,EAAE,SAAS;AACpB,CAAC;;AAED,MAAM,sBAAsB,EAAE,mBAAmB,QAAQ;CACxD;CACA;CACA;AACD,CAAC;AACD,MAAM,2BAA2B,EAAE,OAAO;CACzC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC;CAC5B,QAAQ;CACR,QAAQ,EAAE,QAAQ,UAAU;CAC5B,UAAU;CACV,WAAW,EAAE,SAAS,EAAE,SAAS;AAClC,CAAC;AACD,MAAM,wBAAwB,EAAE,OAAO;CACtC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC;CAC5B,QAAQ;CACR,QAAQ,EAAE,QAAQ,OAAO;CACzB,OAAO;CACP,QAAQ;AACT,CAAC;;AAED,MAAM,8BAA8B,EAAE,mBAAmB,UAAU,CAAC,0BAA0B,qBAAqB,CAAC;AACpH,MAAM,qBAAqB,OAAO,IAAI,6BAA6B;;;;;AAKnE,SAAS,oBAAoB,OAAO;CACnC,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO;CACxD,IAAI,EAAE,sBAAsB,UAAU,MAAM,wBAAwB,MAAM,OAAO;CACjF,OAAO,4BAA4B,UAAU,KAAK,EAAE;AACrD;AACA,SAAS,4BAA4B,YAAY;CAChD,OAAO,WAAW,WAAW;AAC9B;AACA,SAAS,yBAAyB,YAAY;CAC7C,OAAO,WAAW,WAAW;AAC9B;AAGA,SAAS,0BAA0B,UAAU;CAC5C,MAAM,OAAO,SAAS,MAAM,KAAK;CACjC,IAAI,CAAC,MAAM,MAAM,IAAI,MAAM,+CAA+C;CAC1E,OAAO;AACR;AACA,SAAS,kBAAkB,OAAO;CACjC,MAAM,OAAO,MAAM,MAAM,KAAK;CAC9B,IAAI,CAAC,MAAM,MAAM,IAAI,MAAM,4CAA4C;CACvE,OAAO;AACR;AACA,SAAS,kBAAkB,YAAY,WAAW;CACjD,OAAO,GAAG,WAAW,GAAG;AACzB;AAGA,SAAS,qBAAqB,SAAS;CACtC,OAAO,WAAW;AACnB;;;;;;AAQA,SAAS,wBAAwB,OAAO;CACvC,MAAM,SAAS,4BAA4B,UAAU,KAAK;CAC1D,IAAI,CAAC,OAAO,SAAS,MAAM,IAAI,MAAM,+BAA+B,aAAa,OAAO,MAAM,MAAM,GAAG;CACvG,OAAO;EACN,GAAG;GACF,qBAAqB;CACvB;AACD;AACA,SAAS,aAAa,QAAQ;CAC7B,OAAO,OAAO,KAAK,UAAU;EAC5B,OAAO,GAAG,MAAM,KAAK,SAAS,IAAI,GAAG,MAAM,KAAK,KAAK,GAAG,EAAE,MAAM,KAAK,MAAM;CAC5E,CAAC,EAAE,KAAK,IAAI;AACb;AAGA,SAAS,iBAAiB,QAAQ,YAAY,SAAS;CACtD,IAAI,qBAAqB,OAAO,GAAG,OAAO,wBAAwB;EACjE,KAAK,kBAAkB,YAAY,kBAAkB,QAAQ,KAAK,CAAC;EACnE;EACA,QAAQ;EACR,OAAO,QAAQ;EACf,QAAQ,QAAQ;CACjB,CAAC;CACD,OAAO,wBAAwB;EAC9B,KAAK,kBAAkB,YAAY,0BAA0B,QAAQ,QAAQ,CAAC;EAC9E;EACA,QAAQ;EACR,UAAU,QAAQ;EAClB,WAAW,QAAQ;CACpB,CAAC;AACF;AAGA,SAAS,oBAAoB,OAAO,QAAQ,SAAS;CACpD,MAAM,SAAS,MAAM,UAAU,OAAO;CACtC,IAAI,CAAC,OAAO,SAAS;CACrB,IAAI,UAAU,CAAC,OAAO,UAAU,OAAO,IAAI,EAAE,SAAS;CACtD,OAAO,OAAO;AACf;AACA,SAAS,qBAAqB,OAAO,QAAQ,SAAS;CACrD,OAAO,oBAAoB,OAAO,QAAQ,OAAO,MAAM,KAAK;AAC7D;AACA,SAAS,oBAAoB,KAAK,SAAS;CAC1C,MAAM,UAAU,CAAC;CACjB,IAAI,OAAO,EAAE,mBAAmB,YAAY,MAAM,IAAI,MAAM,uDAAuD;CACnH,KAAK,MAAM,UAAU,SAAS;EAC7B,MAAM,OAAO,oBAAoB,EAAE,eAAe,OAAO,aAAa,GAAG,OAAO,eAAe,EAAE,eAAe,OAAO,YAAY,IAAI,KAAK,GAAG,GAAG;EAClJ,IAAI,SAAS,KAAK,GAAG;EACrB,QAAQ,KAAK;GACZ,eAAe,OAAO;GACtB;EACD,CAAC;CACF;CACA,OAAO;AACR;;AAEA,SAAS,mBAAmB,OAAO,QAAQ,SAAS;CACnD,OAAO,qBAAqB,OAAO,QAAQ,OAAO;AACnD;AAGA,SAAS,yBAAyB,UAAU;CAC3C,OAAO,SAAS,QAAQ,cAAc,EAAE,EAAE,QAAQ,gBAAgB,EAAE;AACrE;AACA,SAAS,oBAAoB,QAAQ;CACpC,IAAI,kBAAkB,EAAE,WAAW,OAAO,OAAO,MAAM;CACvD,OAAO;AACR;;;;;;;;AAQA,SAAS,oBAAoB,SAAS;CACrC,MAAM,aAAa,QAAQ,IAAI,KAAK;CACpC,IAAI,CAAC,YAAY,MAAM,IAAI,MAAM,8CAA8C;CAC/E,MAAM,WAAW,yBAAyB,QAAQ,QAAQ;CAC1D,IAAI,CAAC,UAAU,MAAM,IAAI,MAAM,mDAAmD;CAClF,MAAM,UAAU,oBAAoB,QAAQ,OAAO;CACnD,MAAM,SAAS,QAAQ,SAAS,oBAAoB,QAAQ,MAAM,IAAI,KAAK;CAC3E,MAAM,SAAS;EACd,MAAM;EACN,KAAK;EACL;EACA;EACA;EACA,OAAO,SAAS;GACf,OAAO,mBAAmB,SAAS,QAAQ,OAAO;EACnD;EACA,OAAO,eAAe;GACrB,OAAO,iBAAiB,QAAQ,YAAY,aAAa;EAC1D;CACD;CACA,OAAO;AACR;;;;;;;;;;;;AAcA,SAAS,iBAAiB,SAAS;CAClC,MAAM,aAAa,QAAQ,IAAI,KAAK;CACpC,IAAI,CAAC,YAAY,MAAM,IAAI,MAAM,2CAA2C;CAC5E,MAAM,SAAS;EACd,MAAM;EACN,KAAK;EACL,UAAU,kBAAkB,QAAQ,QAAQ;EAC5C,OAAO,eAAe;GACrB,OAAO,iBAAiB,QAAQ,YAAY,aAAa;EAC1D;CACD;CACA,OAAO;AACR;;;;;;;;;;;;;;;AAiBA,SAAS,iBAAiB,SAAS;CAClC,MAAM,aAAa,QAAQ,IAAI,KAAK;CACpC,IAAI,CAAC,YAAY,MAAM,IAAI,MAAM,2CAA2C;CAC5E,MAAM,WAAW,kBAAkB,QAAQ,QAAQ;CACnD,MAAM,UAAU,CAAC;CACjB,IAAI,QAAQ,QAAQ,QAAQ,KAAK,QAAQ,MAAM;CAC/C,MAAM,SAAS;EACd,MAAM;EACN,KAAK;EACL,IAAI,QAAQ;EACZ;EACA,KAAK,QAAQ;EACb;EACA,OAAO,SAAS;GACf,OAAO,OAAO,QAAQ,OAAO,cAAc,UAAU,OAAO,CAAC;EAC9D;EACA,OAAO,eAAe;GACrB,OAAO,iBAAiB,QAAQ,YAAY,aAAa;EAC1D;CACD;CACA,MAAM,QAAQ;CACd,MAAM,UAAU,OAAO;EACtB,OAAO,QAAQ,KAAK,EAAE;EACtB,OAAO;CACR;CACA,OAAO;AACR;AAGA,SAAS,oBAAoB;CAC5B,OAAO;EACN,MAAM;EACN,YAAY,CAAC;EACb,UAAU,CAAC;CACZ;AACD;AACA,SAAS,eAAe,QAAQ,MAAM,OAAO;CAC5C,MAAM,CAAC,MAAM,GAAG,QAAQ;CACxB,IAAI,CAAC,MAAM;CACX,IAAI,CAAC,OAAO,SAAS,SAAS,IAAI,GAAG,OAAO,SAAS,KAAK,IAAI;CAC9D,IAAI,KAAK,WAAW,GAAG;EACtB,OAAO,WAAW,QAAQ,EAAE,OAAO,MAAM;EACzC;CACD;CACA,MAAM,WAAW,OAAO,WAAW;CACnC,MAAM,QAAQ,YAAY,OAAO,aAAa,YAAY,SAAS,SAAS,WAAW,WAAW,kBAAkB;CACpH,OAAO,WAAW,QAAQ;CAC1B,eAAe,OAAO,MAAM,KAAK;AAClC;;;;;;AAMA,SAAS,kBAAkB,OAAO;CACjC,MAAM,SAAS,kBAAkB;CACjC,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,KAAK,GAAG,eAAe,QAAQ,KAAK,MAAM,GAAG,EAAE,QAAQ,YAAY,QAAQ,SAAS,CAAC,GAAG,KAAK;CACxI,IAAI,OAAO,SAAS,WAAW,GAAG,OAAO,EAAE,MAAM,SAAS;CAC1D,OAAO;AACR;AAGA,SAAS,YAAY,SAAS,MAAM;CACnC,IAAI,UAAU;CACd,KAAK,MAAM,WAAW,MAAM;EAC3B,IAAI,YAAY,QAAQ,OAAO,YAAY,UAAU;EACrD,UAAU,QAAQ;CACnB;CACA,OAAO;AACR;;;;;;AAMA,SAAS,kBAAkB,UAAU,SAAS;CAC7C,OAAO,SAAS,QAAQ,8BAA8B,OAAO,YAAY;EACxE,MAAM,WAAW,QAAQ,MAAM,GAAG;EAClC,IAAI,SAAS,OAAO,WAAW,SAAS,MAAM;EAC9C,MAAM,QAAQ,SAAS,WAAW,IAAI,UAAU,YAAY,SAAS,QAAQ;EAC7E,IAAI,UAAU,KAAK,GAAG,OAAO;EAC7B,OAAO,OAAO,UAAU,WAAW,QAAQ,KAAK,UAAU,KAAK;CAChE,CAAC;AACF;;AAIA,SAAS,mBAAmB,YAAY,SAAS;CAChD,MAAM,SAAS,WAAW;CAC1B,IAAI,OAAO,WAAW,YAAY,OAAO,OAAO,WAAW,CAAC,CAAC;CAC7D,OAAO;AACR;AAGA,SAAS,yBAAyB,YAAY,SAAS;CACtD,OAAO,WAAW,YAAY,WAAW,UAAU,OAAO,IAAI;AAC/D;;;;;AAKA,SAAS,2BAA2B,YAAY,SAAS;CACxD,IAAI,yBAAyB,UAAU,GAAG,OAAO;CACjD,OAAO,yBAAyB,YAAY,OAAO;AACpD;;AAEA,SAAS,uBAAuB,YAAY,SAAS;CACpD,MAAM,SAAS,WAAW;CAC1B,IAAI,OAAO,SAAS,UAAU,CAAC,OAAO,OAAO,OAAO,GAAG;CACvD,IAAI,yBAAyB,UAAU,GAAG,OAAO;CACjD,OAAO,yBAAyB,YAAY,OAAO;AACpD"}

package/dist/workflow.cjs

@@ -1,5 +1,5 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_dist = require("./dist-DQL6zTI5.cjs");
+const require_dist = require("./dist-C0fPHFaM.cjs");
 exports.MemoryEventLog = require_dist.MemoryEventLog;
 exports.RunCanceledError = require_dist.RunCanceledError;
 exports.defineWorkflow = require_dist.defineWorkflow;

package/dist/workflow.d.cts

@@ -1,3 +1,3 @@
-import { _ as PromptLlmThinkingLevel, g as PromptLlmRunOptions } from "./index-e9f4pcX4.cjs";
-import { C as deserializeWorkflowError, D as promptLlm, E as isWorkflow, O as serializeWorkflowError, S as defineWorkflow, T as isRunCanceledError, _ as SleepPendingItem, a as HookHandle, b as WorkflowRunContext, c as LlmStepExecutor, d as PromptLlmOptions, f as ReplayEvent, g as SleepDuration, h as SerializedWorkflowError, i as ExecuteWorkflowOptions, l as MemoryEventLog, m as RunCanceledError, n as AppendEventInput, o as HookOptions, p as ReplayResult, r as DurableEventLog, s as HookPendingItem, t as AgentStepExecutor, u as PendingItem, v as WorkflowDefinition, w as executeWorkflow, x as WorkflowSleep, y as WorkflowHook } from "./index-BMqj40Li.cjs";
+import { _ as PromptLlmRunOptions, v as PromptLlmThinkingLevel } from "./index-WT4ULMiw.cjs";
+import { C as deserializeWorkflowError, D as promptLlm, E as isWorkflow, O as serializeWorkflowError, S as defineWorkflow, T as isRunCanceledError, _ as SleepPendingItem, a as HookHandle, b as WorkflowRunContext, c as LlmStepExecutor, d as PromptLlmOptions, f as ReplayEvent, g as SleepDuration, h as SerializedWorkflowError, i as ExecuteWorkflowOptions, l as MemoryEventLog, m as RunCanceledError, n as AppendEventInput, o as HookOptions, p as ReplayResult, r as DurableEventLog, s as HookPendingItem, t as AgentStepExecutor, u as PendingItem, v as WorkflowDefinition, w as executeWorkflow, x as WorkflowSleep, y as WorkflowHook } from "./index-3P7ec4Vo.cjs";
 export { type AgentStepExecutor, type AppendEventInput, type DurableEventLog, type ExecuteWorkflowOptions, type HookHandle, type HookOptions, type HookPendingItem, type LlmStepExecutor, MemoryEventLog, type PendingItem, type PromptLlmOptions, type PromptLlmRunOptions, type PromptLlmThinkingLevel, type ReplayEvent, type ReplayResult, RunCanceledError, type SerializedWorkflowError, type SleepDuration, type SleepPendingItem, type WorkflowDefinition, type WorkflowHook, type WorkflowRunContext, type WorkflowSleep, defineWorkflow, deserializeWorkflowError, executeWorkflow, isRunCanceledError, isWorkflow, promptLlm, serializeWorkflowError };

package/dist/workflow.d.mts

@@ -1,3 +1,3 @@
-import { _ as PromptLlmThinkingLevel, g as PromptLlmRunOptions } from "./index-e9f4pcX4.mjs";
-import { C as deserializeWorkflowError, D as promptLlm, E as isWorkflow, O as serializeWorkflowError, S as defineWorkflow, T as isRunCanceledError, _ as SleepPendingItem, a as HookHandle, b as WorkflowRunContext, c as LlmStepExecutor, d as PromptLlmOptions, f as ReplayEvent, g as SleepDuration, h as SerializedWorkflowError, i as ExecuteWorkflowOptions, l as MemoryEventLog, m as RunCanceledError, n as AppendEventInput, o as HookOptions, p as ReplayResult, r as DurableEventLog, s as HookPendingItem, t as AgentStepExecutor, u as PendingItem, v as WorkflowDefinition, w as executeWorkflow, x as WorkflowSleep, y as WorkflowHook } from "./index-CWZAGTad.mjs";
+import { _ as PromptLlmRunOptions, v as PromptLlmThinkingLevel } from "./index-WT4ULMiw.mjs";
+import { C as deserializeWorkflowError, D as promptLlm, E as isWorkflow, O as serializeWorkflowError, S as defineWorkflow, T as isRunCanceledError, _ as SleepPendingItem, a as HookHandle, b as WorkflowRunContext, c as LlmStepExecutor, d as PromptLlmOptions, f as ReplayEvent, g as SleepDuration, h as SerializedWorkflowError, i as ExecuteWorkflowOptions, l as MemoryEventLog, m as RunCanceledError, n as AppendEventInput, o as HookOptions, p as ReplayResult, r as DurableEventLog, s as HookPendingItem, t as AgentStepExecutor, u as PendingItem, v as WorkflowDefinition, w as executeWorkflow, x as WorkflowSleep, y as WorkflowHook } from "./index-D7UUmswR.mjs";
 export { type AgentStepExecutor, type AppendEventInput, type DurableEventLog, type ExecuteWorkflowOptions, type HookHandle, type HookOptions, type HookPendingItem, type LlmStepExecutor, MemoryEventLog, type PendingItem, type PromptLlmOptions, type PromptLlmRunOptions, type PromptLlmThinkingLevel, type ReplayEvent, type ReplayResult, RunCanceledError, type SerializedWorkflowError, type SleepDuration, type SleepPendingItem, type WorkflowDefinition, type WorkflowHook, type WorkflowRunContext, type WorkflowSleep, defineWorkflow, deserializeWorkflowError, executeWorkflow, isRunCanceledError, isWorkflow, promptLlm, serializeWorkflowError };

package/dist/workflow.mjs

@@ -1,2 +1,2 @@
-import { a as executeWorkflow, c as promptLlm, i as deserializeWorkflowError, l as serializeWorkflowError, n as RunCanceledError, o as isRunCanceledError, r as defineWorkflow, s as isWorkflow, t as MemoryEventLog } from "./dist-BpkCqbil.mjs";
+import { a as executeWorkflow, c as promptLlm, i as deserializeWorkflowError, l as serializeWorkflowError, n as RunCanceledError, o as isRunCanceledError, r as defineWorkflow, s as isWorkflow, t as MemoryEventLog } from "./dist-nvW8vbKn.mjs";
 export { MemoryEventLog, RunCanceledError, defineWorkflow, deserializeWorkflowError, executeWorkflow, isRunCanceledError, isWorkflow, promptLlm, serializeWorkflowError };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@keystrokehq/keystroke",
-  "version": "1.0.7",
+  "version": "1.0.9",
   "description": "Keystroke authoring facade — re-exports primitives for user projects.",
   "repository": {
     "type": "git",

package/dist/dist-BpkCqbil.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"dist-BpkCqbil.mjs","names":[],"sources":["../../workflow/dist/index.mjs"],"sourcesContent":["import { z } from \"zod\";\nimport { executeAction, getActionCredentialRequirements, getRunSignal, getWorkflowRunHandle, normalizeCredentialList, registerWorkflowRunGetter } from \"@keystrokehq/action\";\nimport { captureConsole, logSystem, withSpan } from \"@keystrokehq/tracing\";\nimport { resolveActionCredentials } from \"@keystrokehq/credentials\";\nimport { AsyncLocalStorage } from \"node:async_hooks\";\n//#region src/run-canceled-error.ts\nvar RunCanceledError = class extends Error {\n\tconstructor(runId) {\n\t\tsuper(runId ? `Workflow run ${runId} was canceled` : \"Workflow run was canceled\");\n\t\tthis.name = \"RunCanceledError\";\n\t}\n};\nfunction isRunCanceledError(error) {\n\treturn error instanceof RunCanceledError;\n}\n//#endregion\n//#region src/workflow-definition.ts\nconst zodSchema = z.custom((v) => v instanceof z.ZodType, \"must be a Zod schema\");\n/** Runtime validation for an unbranded workflow definition. */\nconst workflowCoreSchema = z.object({\n\tslug: z.string().trim().min(1),\n\tname: z.string().optional(),\n\tdescription: z.string().optional(),\n\tsubscription: z.object({ mode: z.enum([\"system\", \"subscribable\"]).optional() }).optional(),\n\tinput: zodSchema,\n\toutput: zodSchema,\n\trun: z.function()\n});\nconst WORKFLOW = Symbol.for(\"keystroke.workflow\");\n/**\n* Validates brand + shape via `workflowCoreSchema` so discovery and guards\n* reject malformed definitions.\n*/\nfunction isWorkflow(value) {\n\tif (typeof value !== \"object\" || value === null) return false;\n\tif (!(WORKFLOW in value) || value[WORKFLOW] !== true) return false;\n\treturn workflowCoreSchema.safeParse(value).success;\n}\n//#endregion\n//#region src/define-workflow.ts\nfunction defineWorkflow(def) {\n\tconst result = workflowCoreSchema.safeParse(def);\n\tif (!result.success) throw new Error(`Invalid workflow definition: ${formatIssues(result.error.issues)}`);\n\treturn {\n\t\t...result.data,\n\t\t[WORKFLOW]: true\n\t};\n}\nfunction formatIssues(issues) {\n\treturn issues.map((issue) => {\n\t\treturn `${issue.path.length > 0 ? `${issue.path.join(\".\")}: ` : \"\"}${issue.message}`;\n\t}).join(\"; \");\n}\n//#endregion\n//#region src/replay/error.ts\nfunction serializeWorkflowError(error) {\n\tif (error instanceof Error) return {\n\t\tname: error.name,\n\t\tmessage: error.message\n\t};\n\treturn { message: String(error) };\n}\n/** Rebuild an Error from a recorded error so replay re-raises the same failure. */\nfunction deserializeWorkflowError(data) {\n\tconst serialized = data;\n\tconst error = new Error(serialized?.message ?? \"Workflow step failed\");\n\tif (serialized?.name) error.name = serialized.name;\n\treturn error;\n}\n//#endregion\n//#region src/replay/duration.ts\nconst UNIT_MS = {\n\tms: 1,\n\ts: 1e3,\n\tm: 6e4,\n\th: 36e5,\n\td: 864e5\n};\n/** Resolve a sleep duration to an absolute resume time. */\nfunction resolveResumeAt(duration, now = /* @__PURE__ */ new Date()) {\n\tif (duration instanceof Date) return duration;\n\tif (typeof duration === \"number\") return new Date(now.getTime() + Math.max(0, duration));\n\treturn new Date(now.getTime() + parseDurationToMs(duration));\n}\nfunction parseDurationToMs(value) {\n\tconst match = /^(\\d+(?:\\.\\d+)?)\\s*(ms|s|m|h|d)$/.exec(value.trim());\n\tif (!match) throw new Error(`Invalid sleep duration \"${value}\". Use a number of ms, a Date, or a string like \"5s\", \"10m\", \"1h\".`);\n\tconst amount = Number(match[1]);\n\tconst unit = match[2];\n\treturn Math.round(amount * UNIT_MS[unit]);\n}\n//#endregion\n//#region src/replay/events-consumer.ts\n/** Indexes replay events by correlationId for O(1) cache-hit checks during replay. */\nvar EventsConsumer = class {\n\tbyCorrelationId = /* @__PURE__ */ new Map();\n\tconstructor(events) {\n\t\tfor (const event of events) {\n\t\t\tif (!event.correlationId) continue;\n\t\t\tconst list = this.byCorrelationId.get(event.correlationId);\n\t\t\tif (list) list.push(event);\n\t\t\telse this.byCorrelationId.set(event.correlationId, [event]);\n\t\t}\n\t}\n\tevents(correlationId) {\n\t\treturn this.byCorrelationId.get(correlationId) ?? [];\n\t}\n\thasEventType(correlationId, type) {\n\t\treturn this.events(correlationId).some((event) => event.type === type);\n\t}\n\t/**\n\t* Cache lookup for a step. Returns the recorded output on a `step_completed`,\n\t* re-raises the recorded error on a terminal `step_failed` (so a permanently\n\t* failed step is not re-executed), and otherwise reports a miss — including\n\t* when only `step_retrying` events exist (the step re-runs on the next pass).\n\t*/\n\tgetStepResult(correlationId) {\n\t\tconst events = this.events(correlationId);\n\t\tconst failed = events.find((event) => event.type === \"step_failed\");\n\t\tif (failed) throw deserializeWorkflowError(failed.data);\n\t\tconst completed = events.find((event) => event.type === \"step_completed\");\n\t\tif (completed) return {\n\t\t\tcompleted: true,\n\t\t\tresult: completed.data\n\t\t};\n\t\treturn { completed: false };\n\t}\n\t/** Number of prior `step_retrying` events recorded for a step (= failed attempts so far). */\n\tcountRetrying(correlationId) {\n\t\treturn this.events(correlationId).filter((event) => event.type === \"step_retrying\").length;\n\t}\n\tisSleepCompleted(correlationId) {\n\t\treturn this.hasEventType(correlationId, \"sleep_completed\");\n\t}\n\t/** Returns the persisted resumeAt for a scheduled-but-not-completed sleep, if any. */\n\tgetSleepResumeAt(correlationId) {\n\t\tconst scheduled = this.events(correlationId).find((event) => event.type === \"sleep_scheduled\");\n\t\tif (!scheduled) return;\n\t\tconst data = scheduled.data;\n\t\treturn data?.resumeAt ? new Date(data.resumeAt) : void 0;\n\t}\n\tgetHookToken(correlationId) {\n\t\treturn (this.events(correlationId).find((event) => event.type === \"hook_created\")?.data)?.token;\n\t}\n\tgetHookResult(correlationId) {\n\t\tconst resumed = this.events(correlationId).find((event) => event.type === \"hook_resumed\");\n\t\tif (!resumed) return { resolved: false };\n\t\treturn {\n\t\t\tresolved: true,\n\t\t\tpayload: resumed.data?.payload\n\t\t};\n\t}\n};\n//#endregion\n//#region src/replay/suspension.ts\n/** A promise that never settles — returned by a suspending primitive so the body parks. */\nfunction createPendingPromise() {\n\treturn new Promise(() => {});\n}\n/**\n* Collects pending items requested within a single tick and resolves once, so\n* parallel suspensions (e.g. Promise.all of two sleeps) batch into one suspension.\n*/\nvar SuspensionCoordinator = class {\n\titems = /* @__PURE__ */ new Map();\n\tscheduled = false;\n\tresolve;\n\tpromise;\n\tconstructor() {\n\t\tthis.promise = new Promise((resolve) => {\n\t\t\tthis.resolve = resolve;\n\t\t});\n\t}\n\trequest(item) {\n\t\tthis.items.set(item.correlationId, item);\n\t\tif (!this.scheduled) {\n\t\t\tthis.scheduled = true;\n\t\t\tqueueMicrotask(() => {\n\t\t\t\tthis.resolve([...this.items.values()]);\n\t\t\t});\n\t\t}\n\t}\n\twaitForSuspension() {\n\t\treturn this.promise;\n\t}\n};\n//#endregion\n//#region src/replay/replay-context.ts\nfunction createReplayState(params) {\n\treturn {\n\t\trunId: params.runId,\n\t\tconsumer: params.consumer,\n\t\tcoordinator: params.coordinator,\n\t\teventLog: params.eventLog,\n\t\tnewEvents: [],\n\t\tnow: params.now ?? /* @__PURE__ */ new Date(),\n\t\thookBaseUrl: params.hookBaseUrl,\n\t\tsleepCounter: 0,\n\t\thookCounter: 0,\n\t\tstepOccurrences: /* @__PURE__ */ new Map(),\n\t\tstepCorrelationIds: /* @__PURE__ */ new Set()\n\t};\n}\n/**\n* Allocate the correlation id for a step. An explicit `.stepId(x)` maps to\n* `step:x` (and must be unique within a run); otherwise the key is\n* `step:<actionKey>#<occurrence>` so that two calls to the same action get\n* distinct, replay-stable ids and inserting an unrelated call never shifts the\n* ids of later calls (unlike a single global ordinal).\n*/\nfunction nextStepCorrelationId(state, actionKey, explicitId) {\n\tif (explicitId !== void 0) {\n\t\tconst correlationId = `step:${explicitId}`;\n\t\tif (state.stepCorrelationIds.has(correlationId)) throw new Error(`Duplicate step id \"${explicitId}\" in workflow run ${state.runId}`);\n\t\tstate.stepCorrelationIds.add(correlationId);\n\t\treturn correlationId;\n\t}\n\tconst occurrence = state.stepOccurrences.get(actionKey) ?? 0;\n\tstate.stepOccurrences.set(actionKey, occurrence + 1);\n\tconst correlationId = `step:${actionKey}#${occurrence}`;\n\tstate.stepCorrelationIds.add(correlationId);\n\treturn correlationId;\n}\nfunction createSleep(state) {\n\treturn function sleep(duration) {\n\t\tconst correlationId = `sleep#${state.sleepCounter++}`;\n\t\tif (state.consumer.isSleepCompleted(correlationId)) return Promise.resolve();\n\t\tconst scheduledResumeAt = state.consumer.getSleepResumeAt(correlationId);\n\t\tconst resumeAt = scheduledResumeAt ?? resolveResumeAt(duration, state.now);\n\t\tif (scheduledResumeAt && resumeAt.getTime() <= state.now.getTime()) {\n\t\t\tstate.newEvents.push({\n\t\t\t\tid: `sleep_completed:${state.runId}:${correlationId}`,\n\t\t\t\trunId: state.runId,\n\t\t\t\ttype: \"sleep_completed\",\n\t\t\t\tcorrelationId\n\t\t\t});\n\t\t\treturn Promise.resolve();\n\t\t}\n\t\tif (!scheduledResumeAt) state.newEvents.push({\n\t\t\tid: `sleep_scheduled:${state.runId}:${correlationId}`,\n\t\t\trunId: state.runId,\n\t\t\ttype: \"sleep_scheduled\",\n\t\t\tcorrelationId,\n\t\t\tdata: { resumeAt: resumeAt.toISOString() }\n\t\t});\n\t\tstate.coordinator.request({\n\t\t\tkind: \"sleep\",\n\t\t\tcorrelationId,\n\t\t\tresumeAt\n\t\t});\n\t\treturn createPendingPromise();\n\t};\n}\nfunction createHook(state) {\n\treturn function hook(options) {\n\t\tconst correlationId = `hook#${state.hookCounter++}`;\n\t\tconst token = options?.token ?? state.consumer.getHookToken(correlationId) ?? `hook_${crypto.randomUUID()}`;\n\t\treturn {\n\t\t\ttoken,\n\t\t\tresumeUrl: state.hookBaseUrl ? `${state.hookBaseUrl}/hooks/${token}/resume` : `/hooks/${token}/resume`,\n\t\t\tthen(onFulfilled, onRejected) {\n\t\t\t\tconst result = state.consumer.getHookResult(correlationId);\n\t\t\t\tif (result.resolved) {\n\t\t\t\t\tconst payload = options?.schema ? options.schema.parse(result.payload) : result.payload;\n\t\t\t\t\treturn Promise.resolve(payload).then(onFulfilled, onRejected);\n\t\t\t\t}\n\t\t\t\tif (!state.consumer.hasEventType(correlationId, \"hook_created\")) state.newEvents.push({\n\t\t\t\t\tid: `hook_created:${state.runId}:${correlationId}`,\n\t\t\t\t\trunId: state.runId,\n\t\t\t\t\ttype: \"hook_created\",\n\t\t\t\t\tcorrelationId,\n\t\t\t\t\tdata: { token }\n\t\t\t\t});\n\t\t\t\tstate.coordinator.request({\n\t\t\t\t\tkind: \"hook\",\n\t\t\t\t\tcorrelationId,\n\t\t\t\t\ttoken\n\t\t\t\t});\n\t\t\t\treturn createPendingPromise().then(onFulfilled, onRejected);\n\t\t\t}\n\t\t};\n\t};\n}\n//#endregion\n//#region src/run-durable-step.ts\n/**\n* Shared durable-step shell: resolve a stable `correlation_id`, short-circuit\n* from the event log on a cache hit, otherwise execute and append\n* `step_completed` immediately (per-step crash durability). A thrown step\n* appends `step_retrying` (non-fatal, re-run on the next attempt) and\n* rethrows; the terminal `step_failed` is written by the job handler once the\n* queue exhausts retries.\n*/\nasync function runDurableStep(state, options) {\n\tconst { runId, consumer, eventLog } = state;\n\tgetRunSignal().throwIfAborted();\n\tconst correlationId = nextStepCorrelationId(state, options.key, options.id);\n\tconst cached = consumer.getStepResult(correlationId);\n\tconst metadata = {\n\t\trunId,\n\t\t[options.metadataKey]: options.key,\n\t\tcorrelationId\n\t};\n\tif (cached.completed) {\n\t\tawait withSpan({\n\t\t\tkind: options.kind,\n\t\t\tname: options.key,\n\t\t\trefId: `${runId}:${correlationId}`,\n\t\t\tmetadata: {\n\t\t\t\t...metadata,\n\t\t\t\treplayed: true\n\t\t\t}\n\t\t}, async () => {\n\t\t\tawait logSystem(\"info\", options.replayMessage, metadata);\n\t\t});\n\t\treturn options.parseCached ? options.parseCached(cached.result) : cached.result;\n\t}\n\treturn withSpan({\n\t\tkind: options.kind,\n\t\tname: options.key,\n\t\trefId: `${runId}:${correlationId}`,\n\t\tmetadata\n\t}, async () => captureConsole(async () => {\n\t\ttry {\n\t\t\tconst result = await options.execute();\n\t\t\tawait eventLog.append({\n\t\t\t\tid: `step_completed:${runId}:${correlationId}`,\n\t\t\t\trunId,\n\t\t\t\ttype: \"step_completed\",\n\t\t\t\tcorrelationId,\n\t\t\t\tdata: result\n\t\t\t});\n\t\t\treturn result;\n\t\t} catch (error) {\n\t\t\tconst attempt = consumer.countRetrying(correlationId);\n\t\t\tawait eventLog.append({\n\t\t\t\tid: `step_retrying:${runId}:${correlationId}:${attempt}`,\n\t\t\t\trunId,\n\t\t\t\ttype: \"step_retrying\",\n\t\t\t\tcorrelationId,\n\t\t\t\tdata: serializeWorkflowError(error)\n\t\t\t});\n\t\t\tstate.failedCorrelationId = correlationId;\n\t\t\tthrow error;\n\t\t}\n\t}));\n}\n//#endregion\n//#region src/create-action-runner.ts\nfunction withCredentialScopeOverride(requirements, scope) {\n\tif (!requirements || !scope) return requirements;\n\treturn normalizeCredentialList(requirements).map((requirement) => ({\n\t\t...requirement,\n\t\tscope\n\t}));\n}\n/** Builds the per-run action runner; durability lives in {@link runDurableStep}. */\nfunction createActionRunner(state, options = {}) {\n\treturn (action, input, runOptions) => runDurableStep(state, {\n\t\tkind: \"action\",\n\t\tkey: action.slug,\n\t\tid: runOptions?.id,\n\t\tmetadataKey: \"actionKey\",\n\t\treplayMessage: \"action replayed from checkpoint\",\n\t\tparseCached: (cached) => action.output.parse(cached),\n\t\texecute: async () => {\n\t\t\tconst requirements = withCredentialScopeOverride(getActionCredentialRequirements(action), runOptions?.credentialScope);\n\t\t\treturn executeAction(action, input, requirements?.length ? await resolveActionCredentials(requirements, {\n\t\t\t\tresolveCredentials: options.resolveCredentials,\n\t\t\t\tcontext: options.credentialContext,\n\t\t\t\toauthAdapter: options.oauthAdapter,\n\t\t\t\tconsumer: {\n\t\t\t\t\tkind: \"action\",\n\t\t\t\t\tname: action.slug\n\t\t\t\t}\n\t\t\t}) : {});\n\t\t}\n\t});\n}\n//#endregion\n//#region src/create-agent-step-runner.ts\n/**\n* Builds the per-run agent runner: each `agent.prompt()` in a workflow body\n* becomes a durable step keyed `step:<agentKey>#<occurrence>` (same scheme as\n* actions). The actual prompt execution is delegated to `runAgent`, supplied\n* by the host (server) via `executeWorkflow({ runAgent })`.\n*/\nfunction createAgentStepRunner(state, runAgent) {\n\treturn (agent, input, options) => {\n\t\tconst slug = agent.slug;\n\t\treturn runDurableStep(state, {\n\t\t\tkind: \"agent_session\",\n\t\t\tkey: slug,\n\t\t\tid: options?.id,\n\t\t\tmetadataKey: \"agentKey\",\n\t\t\treplayMessage: \"agent step replayed from checkpoint\",\n\t\t\texecute: () => runAgent(agent, input, options?.runPrompt)\n\t\t});\n\t};\n}\n//#endregion\n//#region src/create-llm-step-runner.ts\n/**\n* Builds the per-run LLM runner: each `promptLlm()` in a workflow body becomes a\n* durable step keyed `step:promptLlm#<occurrence>`. The actual LLM call is\n* delegated to `runLlm`, supplied by the host (server) via `executeWorkflow({ runLlm })`.\n*/\nfunction createLlmStepRunner(state, runLlm) {\n\treturn (opts) => runDurableStep(state, {\n\t\tkind: \"llm\",\n\t\tkey: \"promptLlm\",\n\t\tid: opts.stepId,\n\t\tmetadataKey: \"llmKey\",\n\t\treplayMessage: \"llm step replayed from checkpoint\",\n\t\tparseCached: (cached) => opts.outputSchema ? opts.outputSchema.parse(cached) : cached,\n\t\texecute: () => runLlm(opts)\n\t});\n}\n//#endregion\n//#region src/run-context.ts\nconst storage = new AsyncLocalStorage();\nregisterWorkflowRunGetter(() => {\n\tconst store = storage.getStore();\n\tif (!store) return;\n\treturn {\n\t\tactionRunner: store.actionRunner,\n\t\tagentRunner: store.agentRunner,\n\t\tllmRunner: store.llmRunner\n\t};\n});\nfunction runWithWorkflowContext(store, fn) {\n\treturn storage.run(store, fn);\n}\n//#endregion\n//#region src/replay/memory-event-log.ts\n/** In-memory durable log for inline execution and tests. */\nvar MemoryEventLog = class {\n\tevents = [];\n\tids = /* @__PURE__ */ new Set();\n\tasync append(event) {\n\t\tconst id = event.id ?? crypto.randomUUID();\n\t\tif (this.ids.has(id)) return false;\n\t\tthis.ids.add(id);\n\t\tthis.events.push({\n\t\t\tid,\n\t\t\trunId: event.runId,\n\t\t\tseq: this.events.length,\n\t\t\ttype: event.type,\n\t\t\tcorrelationId: event.correlationId ?? null,\n\t\t\tdata: event.data ?? null\n\t\t});\n\t\treturn true;\n\t}\n\tasync listReplay(runId) {\n\t\treturn this.events.filter((event) => event.runId === runId).map((event) => ({ ...event }));\n\t}\n};\n//#endregion\n//#region src/execute-workflow.ts\n/**\n* The single way to run a workflow: replay its event log from the top, execute\n* un-cached primitives, and either complete/fail or suspend at the first\n* un-satisfied sleep/hook. New events (sleep_scheduled/sleep_completed/\n* hook_created/run_completed/run_failed) are flushed before returning.\n*\n* Durability comes entirely from the log — a suspended run resumes by calling\n* this again with the same `runId` and event log once the sleep is due or the\n* hook is resumed.\n*/\nasync function executeWorkflow(workflow, input, options = {}) {\n\tconst runId = options.runId ?? crypto.randomUUID();\n\tconst eventLog = options.eventLog ?? new MemoryEventLog();\n\tconst signal = getRunSignal();\n\tconst consumer = new EventsConsumer(await eventLog.listReplay(runId));\n\tconst coordinator = new SuspensionCoordinator();\n\tconst state = createReplayState({\n\t\trunId,\n\t\tconsumer,\n\t\tcoordinator,\n\t\teventLog,\n\t\thookBaseUrl: options.hookBaseUrl,\n\t\tnow: options.now\n\t});\n\tconst actionRunner = createActionRunner(state, {\n\t\tresolveCredentials: options.resolveCredentials,\n\t\tcredentialContext: options.credentialContext,\n\t\toauthAdapter: options.oauthAdapter\n\t});\n\tconst ctx = {\n\t\trunId,\n\t\tsleep: createSleep(state),\n\t\thook: createHook(state),\n\t\t...options.context\n\t};\n\tconst agentRunner = options.runAgent ? createAgentStepRunner(state, options.runAgent) : void 0;\n\tconst llmRunner = options.runLlm ? createLlmStepRunner(state, options.runLlm) : void 0;\n\tconst validatedInput = workflow.input.parse(input);\n\tconst bodyPromise = runWithWorkflowContext({\n\t\tactionRunner,\n\t\tagentRunner,\n\t\tllmRunner,\n\t\trunId\n\t}, () => captureConsole(async () => workflow.run(validatedInput, ctx)));\n\tlet onAbort;\n\tconst waitForAbort = signal.aborted ? Promise.resolve({ type: \"canceled\" }) : new Promise((resolve) => {\n\t\tonAbort = () => resolve({ type: \"canceled\" });\n\t\tsignal.addEventListener(\"abort\", onAbort, { once: true });\n\t});\n\tconst outcome = await Promise.race([\n\t\tbodyPromise.then((output) => ({\n\t\t\ttype: \"done\",\n\t\t\toutput\n\t\t}), (error) => ({\n\t\t\ttype: \"error\",\n\t\t\terror\n\t\t})),\n\t\tcoordinator.waitForSuspension().then((items) => ({\n\t\t\ttype: \"suspended\",\n\t\t\titems\n\t\t})),\n\t\twaitForAbort\n\t]);\n\tif (onAbort) signal.removeEventListener(\"abort\", onAbort);\n\tlet result;\n\tif (outcome.type === \"suspended\") {\n\t\tbodyPromise.catch(() => {});\n\t\tresult = {\n\t\t\tstatus: \"suspended\",\n\t\t\titems: outcome.items\n\t\t};\n\t} else if (outcome.type === \"done\") {\n\t\tconst output = workflow.output.parse(outcome.output);\n\t\tstate.newEvents.push({\n\t\t\tid: `run_completed:${runId}`,\n\t\t\trunId,\n\t\t\ttype: \"run_completed\",\n\t\t\tdata: { output }\n\t\t});\n\t\tresult = {\n\t\t\tstatus: \"completed\",\n\t\t\toutput\n\t\t};\n\t} else if (outcome.type === \"canceled\" || isRunCanceledError(outcome.error)) {\n\t\tbodyPromise.catch(() => {});\n\t\tstate.newEvents.push({\n\t\t\tid: `run_canceled:${runId}`,\n\t\t\trunId,\n\t\t\ttype: \"run_canceled\"\n\t\t});\n\t\tresult = { status: \"canceled\" };\n\t} else result = {\n\t\tstatus: \"failed\",\n\t\terror: outcome.error,\n\t\tfailedCorrelationId: state.failedCorrelationId\n\t};\n\tfor (const event of state.newEvents) await eventLog.append(event);\n\treturn result;\n}\n//#endregion\n//#region src/prompt-llm.ts\nfunction promptLlm(prompt, opts) {\n\tconst handle = getWorkflowRunHandle();\n\tif (!handle?.llmRunner) throw new Error(\"promptLlm must run inside a workflow with an injected llm executor (executeWorkflow({ runLlm })).\");\n\treturn handle.llmRunner({\n\t\tprompt,\n\t\t...opts\n\t});\n}\n//#endregion\nexport { MemoryEventLog, RunCanceledError, defineWorkflow, deserializeWorkflowError, executeWorkflow, isRunCanceledError, isWorkflow, promptLlm, serializeWorkflowError };\n\n//# sourceMappingURL=index.mjs.map"],"mappings":";;;;;AAMA,IAAI,mBAAmB,cAAc,MAAM;CAC1C,YAAY,OAAO;EAClB,MAAM,QAAQ,gBAAgB,MAAM,iBAAiB,2BAA2B;EAChF,KAAK,OAAO;CACb;AACD;AACA,SAAS,mBAAmB,OAAO;CAClC,OAAO,iBAAiB;AACzB;AAGA,MAAM,YAAY,EAAE,QAAQ,MAAM,aAAa,EAAE,SAAS,sBAAsB;;AAEhF,MAAM,qBAAqB,EAAE,OAAO;CACnC,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC;CAC7B,MAAM,EAAE,OAAO,EAAE,SAAS;CAC1B,aAAa,EAAE,OAAO,EAAE,SAAS;CACjC,cAAc,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,UAAU,cAAc,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS;CACzF,OAAO;CACP,QAAQ;CACR,KAAK,EAAE,SAAS;AACjB,CAAC;AACD,MAAM,WAAW,OAAO,IAAI,oBAAoB;;;;;AAKhD,SAAS,WAAW,OAAO;CAC1B,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO;CACxD,IAAI,EAAE,YAAY,UAAU,MAAM,cAAc,MAAM,OAAO;CAC7D,OAAO,mBAAmB,UAAU,KAAK,EAAE;AAC5C;AAGA,SAAS,eAAe,KAAK;CAC5B,MAAM,SAAS,mBAAmB,UAAU,GAAG;CAC/C,IAAI,CAAC,OAAO,SAAS,MAAM,IAAI,MAAM,gCAAgC,aAAa,OAAO,MAAM,MAAM,GAAG;CACxG,OAAO;EACN,GAAG,OAAO;GACT,WAAW;CACb;AACD;AACA,SAAS,aAAa,QAAQ;CAC7B,OAAO,OAAO,KAAK,UAAU;EAC5B,OAAO,GAAG,MAAM,KAAK,SAAS,IAAI,GAAG,MAAM,KAAK,KAAK,GAAG,EAAE,MAAM,KAAK,MAAM;CAC5E,CAAC,EAAE,KAAK,IAAI;AACb;AAGA,SAAS,uBAAuB,OAAO;CACtC,IAAI,iBAAiB,OAAO,OAAO;EAClC,MAAM,MAAM;EACZ,SAAS,MAAM;CAChB;CACA,OAAO,EAAE,SAAS,OAAO,KAAK,EAAE;AACjC;;AAEA,SAAS,yBAAyB,MAAM;CACvC,MAAM,aAAa;CACnB,MAAM,QAAQ,IAAI,MAAM,YAAY,WAAW,sBAAsB;CACrE,IAAI,YAAY,MAAM,MAAM,OAAO,WAAW;CAC9C,OAAO;AACR;AAGA,MAAM,UAAU;CACf,IAAI;CACJ,GAAG;CACH,GAAG;CACH,GAAG;CACH,GAAG;AACJ;;AAEA,SAAS,gBAAgB,UAAU,sBAAsB,IAAI,KAAK,GAAG;CACpE,IAAI,oBAAoB,MAAM,OAAO;CACrC,IAAI,OAAO,aAAa,UAAU,OAAO,IAAI,KAAK,IAAI,QAAQ,IAAI,KAAK,IAAI,GAAG,QAAQ,CAAC;CACvF,OAAO,IAAI,KAAK,IAAI,QAAQ,IAAI,kBAAkB,QAAQ,CAAC;AAC5D;AACA,SAAS,kBAAkB,OAAO;CACjC,MAAM,QAAQ,mCAAmC,KAAK,MAAM,KAAK,CAAC;CAClE,IAAI,CAAC,OAAO,MAAM,IAAI,MAAM,2BAA2B,MAAM,mEAAmE;CAChI,MAAM,SAAS,OAAO,MAAM,EAAE;CAC9B,MAAM,OAAO,MAAM;CACnB,OAAO,KAAK,MAAM,SAAS,QAAQ,KAAK;AACzC;;AAIA,IAAI,iBAAiB,MAAM;CAC1B,kCAAkC,IAAI,IAAI;CAC1C,YAAY,QAAQ;EACnB,KAAK,MAAM,SAAS,QAAQ;GAC3B,IAAI,CAAC,MAAM,eAAe;GAC1B,MAAM,OAAO,KAAK,gBAAgB,IAAI,MAAM,aAAa;GACzD,IAAI,MAAM,KAAK,KAAK,KAAK;QACpB,KAAK,gBAAgB,IAAI,MAAM,eAAe,CAAC,KAAK,CAAC;EAC3D;CACD;CACA,OAAO,eAAe;EACrB,OAAO,KAAK,gBAAgB,IAAI,aAAa,KAAK,CAAC;CACpD;CACA,aAAa,eAAe,MAAM;EACjC,OAAO,KAAK,OAAO,aAAa,EAAE,MAAM,UAAU,MAAM,SAAS,IAAI;CACtE;;;;;;;CAOA,cAAc,eAAe;EAC5B,MAAM,SAAS,KAAK,OAAO,aAAa;EACxC,MAAM,SAAS,OAAO,MAAM,UAAU,MAAM,SAAS,aAAa;EAClE,IAAI,QAAQ,MAAM,yBAAyB,OAAO,IAAI;EACtD,MAAM,YAAY,OAAO,MAAM,UAAU,MAAM,SAAS,gBAAgB;EACxE,IAAI,WAAW,OAAO;GACrB,WAAW;GACX,QAAQ,UAAU;EACnB;EACA,OAAO,EAAE,WAAW,MAAM;CAC3B;;CAEA,cAAc,eAAe;EAC5B,OAAO,KAAK,OAAO,aAAa,EAAE,QAAQ,UAAU,MAAM,SAAS,eAAe,EAAE;CACrF;CACA,iBAAiB,eAAe;EAC/B,OAAO,KAAK,aAAa,eAAe,iBAAiB;CAC1D;;CAEA,iBAAiB,eAAe;EAC/B,MAAM,YAAY,KAAK,OAAO,aAAa,EAAE,MAAM,UAAU,MAAM,SAAS,iBAAiB;EAC7F,IAAI,CAAC,WAAW;EAChB,MAAM,OAAO,UAAU;EACvB,OAAO,MAAM,WAAW,IAAI,KAAK,KAAK,QAAQ,IAAI,KAAK;CACxD;CACA,aAAa,eAAe;EAC3B,QAAQ,KAAK,OAAO,aAAa,EAAE,MAAM,UAAU,MAAM,SAAS,cAAc,GAAG,OAAO;CAC3F;CACA,cAAc,eAAe;EAC5B,MAAM,UAAU,KAAK,OAAO,aAAa,EAAE,MAAM,UAAU,MAAM,SAAS,cAAc;EACxF,IAAI,CAAC,SAAS,OAAO,EAAE,UAAU,MAAM;EACvC,OAAO;GACN,UAAU;GACV,SAAS,QAAQ,MAAM;EACxB;CACD;AACD;;AAIA,SAAS,uBAAuB;CAC/B,OAAO,IAAI,cAAc,CAAC,CAAC;AAC5B;;;;;AAKA,IAAI,wBAAwB,MAAM;CACjC,wBAAwB,IAAI,IAAI;CAChC,YAAY;CACZ;CACA;CACA,cAAc;EACb,KAAK,UAAU,IAAI,SAAS,YAAY;GACvC,KAAK,UAAU;EAChB,CAAC;CACF;CACA,QAAQ,MAAM;EACb,KAAK,MAAM,IAAI,KAAK,eAAe,IAAI;EACvC,IAAI,CAAC,KAAK,WAAW;GACpB,KAAK,YAAY;GACjB,qBAAqB;IACpB,KAAK,QAAQ,CAAC,GAAG,KAAK,MAAM,OAAO,CAAC,CAAC;GACtC,CAAC;EACF;CACD;CACA,oBAAoB;EACnB,OAAO,KAAK;CACb;AACD;AAGA,SAAS,kBAAkB,QAAQ;CAClC,OAAO;EACN,OAAO,OAAO;EACd,UAAU,OAAO;EACjB,aAAa,OAAO;EACpB,UAAU,OAAO;EACjB,WAAW,CAAC;EACZ,KAAK,OAAO,uBAAuB,IAAI,KAAK;EAC5C,aAAa,OAAO;EACpB,cAAc;EACd,aAAa;EACb,iCAAiC,IAAI,IAAI;EACzC,oCAAoC,IAAI,IAAI;CAC7C;AACD;;;;;;;;AAQA,SAAS,sBAAsB,OAAO,WAAW,YAAY;CAC5D,IAAI,eAAe,KAAK,GAAG;EAC1B,MAAM,gBAAgB,QAAQ;EAC9B,IAAI,MAAM,mBAAmB,IAAI,aAAa,GAAG,MAAM,IAAI,MAAM,sBAAsB,WAAW,oBAAoB,MAAM,OAAO;EACnI,MAAM,mBAAmB,IAAI,aAAa;EAC1C,OAAO;CACR;CACA,MAAM,aAAa,MAAM,gBAAgB,IAAI,SAAS,KAAK;CAC3D,MAAM,gBAAgB,IAAI,WAAW,aAAa,CAAC;CACnD,MAAM,gBAAgB,QAAQ,UAAU,GAAG;CAC3C,MAAM,mBAAmB,IAAI,aAAa;CAC1C,OAAO;AACR;AACA,SAAS,YAAY,OAAO;CAC3B,OAAO,SAAS,MAAM,UAAU;EAC/B,MAAM,gBAAgB,SAAS,MAAM;EACrC,IAAI,MAAM,SAAS,iBAAiB,aAAa,GAAG,OAAO,QAAQ,QAAQ;EAC3E,MAAM,oBAAoB,MAAM,SAAS,iBAAiB,aAAa;EACvE,MAAM,WAAW,qBAAqB,gBAAgB,UAAU,MAAM,GAAG;EACzE,IAAI,qBAAqB,SAAS,QAAQ,KAAK,MAAM,IAAI,QAAQ,GAAG;GACnE,MAAM,UAAU,KAAK;IACpB,IAAI,mBAAmB,MAAM,MAAM,GAAG;IACtC,OAAO,MAAM;IACb,MAAM;IACN;GACD,CAAC;GACD,OAAO,QAAQ,QAAQ;EACxB;EACA,IAAI,CAAC,mBAAmB,MAAM,UAAU,KAAK;GAC5C,IAAI,mBAAmB,MAAM,MAAM,GAAG;GACtC,OAAO,MAAM;GACb,MAAM;GACN;GACA,MAAM,EAAE,UAAU,SAAS,YAAY,EAAE;EAC1C,CAAC;EACD,MAAM,YAAY,QAAQ;GACzB,MAAM;GACN;GACA;EACD,CAAC;EACD,OAAO,qBAAqB;CAC7B;AACD;AACA,SAAS,WAAW,OAAO;CAC1B,OAAO,SAAS,KAAK,SAAS;EAC7B,MAAM,gBAAgB,QAAQ,MAAM;EACpC,MAAM,QAAQ,SAAS,SAAS,MAAM,SAAS,aAAa,aAAa,KAAK,QAAQ,OAAO,WAAW;EACxG,OAAO;GACN;GACA,WAAW,MAAM,cAAc,GAAG,MAAM,YAAY,SAAS,MAAM,WAAW,UAAU,MAAM;GAC9F,KAAK,aAAa,YAAY;IAC7B,MAAM,SAAS,MAAM,SAAS,cAAc,aAAa;IACzD,IAAI,OAAO,UAAU;KACpB,MAAM,UAAU,SAAS,SAAS,QAAQ,OAAO,MAAM,OAAO,OAAO,IAAI,OAAO;KAChF,OAAO,QAAQ,QAAQ,OAAO,EAAE,KAAK,aAAa,UAAU;IAC7D;IACA,IAAI,CAAC,MAAM,SAAS,aAAa,eAAe,cAAc,GAAG,MAAM,UAAU,KAAK;KACrF,IAAI,gBAAgB,MAAM,MAAM,GAAG;KACnC,OAAO,MAAM;KACb,MAAM;KACN;KACA,MAAM,EAAE,MAAM;IACf,CAAC;IACD,MAAM,YAAY,QAAQ;KACzB,MAAM;KACN;KACA;IACD,CAAC;IACD,OAAO,qBAAqB,EAAE,KAAK,aAAa,UAAU;GAC3D;EACD;CACD;AACD;;;;;;;;;AAWA,eAAe,eAAe,OAAO,SAAS;CAC7C,MAAM,EAAE,OAAO,UAAU,aAAa;CACtC,aAAa,EAAE,eAAe;CAC9B,MAAM,gBAAgB,sBAAsB,OAAO,QAAQ,KAAK,QAAQ,EAAE;CAC1E,MAAM,SAAS,SAAS,cAAc,aAAa;CACnD,MAAM,WAAW;EAChB;GACC,QAAQ,cAAc,QAAQ;EAC/B;CACD;CACA,IAAI,OAAO,WAAW;EACrB,MAAM,SAAS;GACd,MAAM,QAAQ;GACd,MAAM,QAAQ;GACd,OAAO,GAAG,MAAM,GAAG;GACnB,UAAU;IACT,GAAG;IACH,UAAU;GACX;EACD,GAAG,YAAY;GACd,MAAM,UAAU,QAAQ,QAAQ,eAAe,QAAQ;EACxD,CAAC;EACD,OAAO,QAAQ,cAAc,QAAQ,YAAY,OAAO,MAAM,IAAI,OAAO;CAC1E;CACA,OAAO,SAAS;EACf,MAAM,QAAQ;EACd,MAAM,QAAQ;EACd,OAAO,GAAG,MAAM,GAAG;EACnB;CACD,GAAG,YAAY,eAAe,YAAY;EACzC,IAAI;GACH,MAAM,SAAS,MAAM,QAAQ,QAAQ;GACrC,MAAM,SAAS,OAAO;IACrB,IAAI,kBAAkB,MAAM,GAAG;IAC/B;IACA,MAAM;IACN;IACA,MAAM;GACP,CAAC;GACD,OAAO;EACR,SAAS,OAAO;GACf,MAAM,UAAU,SAAS,cAAc,aAAa;GACpD,MAAM,SAAS,OAAO;IACrB,IAAI,iBAAiB,MAAM,GAAG,cAAc,GAAG;IAC/C;IACA,MAAM;IACN;IACA,MAAM,uBAAuB,KAAK;GACnC,CAAC;GACD,MAAM,sBAAsB;GAC5B,MAAM;EACP;CACD,CAAC,CAAC;AACH;AAGA,SAAS,4BAA4B,cAAc,OAAO;CACzD,IAAI,CAAC,gBAAgB,CAAC,OAAO,OAAO;CACpC,OAAO,wBAAwB,YAAY,EAAE,KAAK,iBAAiB;EAClE,GAAG;EACH;CACD,EAAE;AACH;;AAEA,SAAS,mBAAmB,OAAO,UAAU,CAAC,GAAG;CAChD,QAAQ,QAAQ,OAAO,eAAe,eAAe,OAAO;EAC3D,MAAM;EACN,KAAK,OAAO;EACZ,IAAI,YAAY;EAChB,aAAa;EACb,eAAe;EACf,cAAc,WAAW,OAAO,OAAO,MAAM,MAAM;EACnD,SAAS,YAAY;GACpB,MAAM,eAAe,4BAA4B,gCAAgC,MAAM,GAAG,YAAY,eAAe;GACrH,OAAO,cAAc,QAAQ,OAAO,cAAc,SAAS,MAAM,yBAAyB,cAAc;IACvG,oBAAoB,QAAQ;IAC5B,SAAS,QAAQ;IACjB,cAAc,QAAQ;IACtB,UAAU;KACT,MAAM;KACN,MAAM,OAAO;IACd;GACD,CAAC,IAAI,CAAC,CAAC;EACR;CACD,CAAC;AACF;;;;;;;AASA,SAAS,sBAAsB,OAAO,UAAU;CAC/C,QAAQ,OAAO,OAAO,YAAY;EACjC,MAAM,OAAO,MAAM;EACnB,OAAO,eAAe,OAAO;GAC5B,MAAM;GACN,KAAK;GACL,IAAI,SAAS;GACb,aAAa;GACb,eAAe;GACf,eAAe,SAAS,OAAO,OAAO,SAAS,SAAS;EACzD,CAAC;CACF;AACD;;;;;;AAQA,SAAS,oBAAoB,OAAO,QAAQ;CAC3C,QAAQ,SAAS,eAAe,OAAO;EACtC,MAAM;EACN,KAAK;EACL,IAAI,KAAK;EACT,aAAa;EACb,eAAe;EACf,cAAc,WAAW,KAAK,eAAe,KAAK,aAAa,MAAM,MAAM,IAAI;EAC/E,eAAe,OAAO,IAAI;CAC3B,CAAC;AACF;AAGA,MAAM,UAAU,IAAI,kBAAkB;AACtC,gCAAgC;CAC/B,MAAM,QAAQ,QAAQ,SAAS;CAC/B,IAAI,CAAC,OAAO;CACZ,OAAO;EACN,cAAc,MAAM;EACpB,aAAa,MAAM;EACnB,WAAW,MAAM;CAClB;AACD,CAAC;AACD,SAAS,uBAAuB,OAAO,IAAI;CAC1C,OAAO,QAAQ,IAAI,OAAO,EAAE;AAC7B;;AAIA,IAAI,iBAAiB,MAAM;CAC1B,SAAS,CAAC;CACV,sBAAsB,IAAI,IAAI;CAC9B,MAAM,OAAO,OAAO;EACnB,MAAM,KAAK,MAAM,MAAM,OAAO,WAAW;EACzC,IAAI,KAAK,IAAI,IAAI,EAAE,GAAG,OAAO;EAC7B,KAAK,IAAI,IAAI,EAAE;EACf,KAAK,OAAO,KAAK;GAChB;GACA,OAAO,MAAM;GACb,KAAK,KAAK,OAAO;GACjB,MAAM,MAAM;GACZ,eAAe,MAAM,iBAAiB;GACtC,MAAM,MAAM,QAAQ;EACrB,CAAC;EACD,OAAO;CACR;CACA,MAAM,WAAW,OAAO;EACvB,OAAO,KAAK,OAAO,QAAQ,UAAU,MAAM,UAAU,KAAK,EAAE,KAAK,WAAW,EAAE,GAAG,MAAM,EAAE;CAC1F;AACD;;;;;;;;;;;AAaA,eAAe,gBAAgB,UAAU,OAAO,UAAU,CAAC,GAAG;CAC7D,MAAM,QAAQ,QAAQ,SAAS,OAAO,WAAW;CACjD,MAAM,WAAW,QAAQ,YAAY,IAAI,eAAe;CACxD,MAAM,SAAS,aAAa;CAC5B,MAAM,WAAW,IAAI,eAAe,MAAM,SAAS,WAAW,KAAK,CAAC;CACpE,MAAM,cAAc,IAAI,sBAAsB;CAC9C,MAAM,QAAQ,kBAAkB;EAC/B;EACA;EACA;EACA;EACA,aAAa,QAAQ;EACrB,KAAK,QAAQ;CACd,CAAC;CACD,MAAM,eAAe,mBAAmB,OAAO;EAC9C,oBAAoB,QAAQ;EAC5B,mBAAmB,QAAQ;EAC3B,cAAc,QAAQ;CACvB,CAAC;CACD,MAAM,MAAM;EACX;EACA,OAAO,YAAY,KAAK;EACxB,MAAM,WAAW,KAAK;EACtB,GAAG,QAAQ;CACZ;CACA,MAAM,cAAc,QAAQ,WAAW,sBAAsB,OAAO,QAAQ,QAAQ,IAAI,KAAK;CAC7F,MAAM,YAAY,QAAQ,SAAS,oBAAoB,OAAO,QAAQ,MAAM,IAAI,KAAK;CACrF,MAAM,iBAAiB,SAAS,MAAM,MAAM,KAAK;CACjD,MAAM,cAAc,uBAAuB;EAC1C;EACA;EACA;EACA;CACD,SAAS,eAAe,YAAY,SAAS,IAAI,gBAAgB,GAAG,CAAC,CAAC;CACtE,IAAI;CACJ,MAAM,eAAe,OAAO,UAAU,QAAQ,QAAQ,EAAE,MAAM,WAAW,CAAC,IAAI,IAAI,SAAS,YAAY;EACtG,gBAAgB,QAAQ,EAAE,MAAM,WAAW,CAAC;EAC5C,OAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;CACzD,CAAC;CACD,MAAM,UAAU,MAAM,QAAQ,KAAK;EAClC,YAAY,MAAM,YAAY;GAC7B,MAAM;GACN;EACD,KAAK,WAAW;GACf,MAAM;GACN;EACD,EAAE;EACF,YAAY,kBAAkB,EAAE,MAAM,WAAW;GAChD,MAAM;GACN;EACD,EAAE;EACF;CACD,CAAC;CACD,IAAI,SAAS,OAAO,oBAAoB,SAAS,OAAO;CACxD,IAAI;CACJ,IAAI,QAAQ,SAAS,aAAa;EACjC,YAAY,YAAY,CAAC,CAAC;EAC1B,SAAS;GACR,QAAQ;GACR,OAAO,QAAQ;EAChB;CACD,OAAO,IAAI,QAAQ,SAAS,QAAQ;EACnC,MAAM,SAAS,SAAS,OAAO,MAAM,QAAQ,MAAM;EACnD,MAAM,UAAU,KAAK;GACpB,IAAI,iBAAiB;GACrB;GACA,MAAM;GACN,MAAM,EAAE,OAAO;EAChB,CAAC;EACD,SAAS;GACR,QAAQ;GACR;EACD;CACD,OAAO,IAAI,QAAQ,SAAS,cAAc,mBAAmB,QAAQ,KAAK,GAAG;EAC5E,YAAY,YAAY,CAAC,CAAC;EAC1B,MAAM,UAAU,KAAK;GACpB,IAAI,gBAAgB;GACpB;GACA,MAAM;EACP,CAAC;EACD,SAAS,EAAE,QAAQ,WAAW;CAC/B,OAAO,SAAS;EACf,QAAQ;EACR,OAAO,QAAQ;EACf,qBAAqB,MAAM;CAC5B;CACA,KAAK,MAAM,SAAS,MAAM,WAAW,MAAM,SAAS,OAAO,KAAK;CAChE,OAAO;AACR;AAGA,SAAS,UAAU,QAAQ,MAAM;CAChC,MAAM,SAAS,qBAAqB;CACpC,IAAI,CAAC,QAAQ,WAAW,MAAM,IAAI,MAAM,mGAAmG;CAC3I,OAAO,OAAO,UAAU;EACvB;EACA,GAAG;CACJ,CAAC;AACF"}