langgraph-ui-components 0.0.4 → 0.0.6

package/dist/index.es230.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es230.js","sources":["../node_modules/.pnpm/langsmith@0.4.6_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/p-retry/index.js"],"sourcesContent":["/* eslint-disable */\n// @ts-nocheck\n// p-retry code vendored to avoid import issues\n// Source: https://github.com/sindresorhus/p-retry\nimport isNetworkError from \"../is-network-error/index.js\";\nfunction validateRetries(retries) {\n    if (typeof retries === \"number\") {\n        if (retries < 0) {\n            throw new TypeError(\"Expected `retries` to be a non-negative number.\");\n        }\n        if (Number.isNaN(retries)) {\n            throw new TypeError(\"Expected `retries` to be a valid number or Infinity, got NaN.\");\n        }\n    }\n    else if (retries !== undefined) {\n        throw new TypeError(\"Expected `retries` to be a number or Infinity.\");\n    }\n}\nfunction validateNumberOption(name, value, { min = 0, allowInfinity = false } = {}) {\n    if (value === undefined) {\n        return;\n    }\n    if (typeof value !== \"number\" || Number.isNaN(value)) {\n        throw new TypeError(`Expected \\`${name}\\` to be a number${allowInfinity ? \" or Infinity\" : \"\"}.`);\n    }\n    if (!allowInfinity && !Number.isFinite(value)) {\n        throw new TypeError(`Expected \\`${name}\\` to be a finite number.`);\n    }\n    if (value < min) {\n        throw new TypeError(`Expected \\`${name}\\` to be \\u2265 ${min}.`);\n    }\n}\nexport class AbortError extends Error {\n    constructor(message) {\n        super();\n        if (message instanceof Error) {\n            this.originalError = message;\n            ({ message } = message);\n        }\n        else {\n            this.originalError = new Error(message);\n            this.originalError.stack = this.stack;\n        }\n        this.name = \"AbortError\";\n        this.message = message;\n    }\n}\nfunction calculateDelay(retriesConsumed, options) {\n    const attempt = Math.max(1, retriesConsumed + 1);\n    const random = options.randomize ? Math.random() + 1 : 1;\n    let timeout = Math.round(random * options.minTimeout * options.factor ** (attempt - 1));\n    timeout = Math.min(timeout, options.maxTimeout);\n    return timeout;\n}\nfunction calculateRemainingTime(start, max) {\n    if (!Number.isFinite(max)) {\n        return max;\n    }\n    return max - (performance.now() - start);\n}\nasync function onAttemptFailure({ error, attemptNumber, retriesConsumed, startTime, options, }) {\n    const normalizedError = error instanceof Error\n        ? error\n        : new TypeError(`Non-error was thrown: \"${error}\". You should only throw errors.`);\n    if (normalizedError instanceof AbortError) {\n        throw normalizedError.originalError;\n    }\n    const retriesLeft = Number.isFinite(options.retries)\n        ? Math.max(0, options.retries - retriesConsumed)\n        : options.retries;\n    const maxRetryTime = options.maxRetryTime ?? Number.POSITIVE_INFINITY;\n    const context = Object.freeze({\n        error: normalizedError,\n        attemptNumber,\n        retriesLeft,\n        retriesConsumed,\n    });\n    await options.onFailedAttempt(context);\n    if (calculateRemainingTime(startTime, maxRetryTime) <= 0) {\n        throw normalizedError;\n    }\n    const consumeRetry = await options.shouldConsumeRetry(context);\n    const remainingTime = calculateRemainingTime(startTime, maxRetryTime);\n    if (remainingTime <= 0 || retriesLeft <= 0) {\n        throw normalizedError;\n    }\n    if (normalizedError instanceof TypeError &&\n        !isNetworkError(normalizedError)) {\n        if (consumeRetry) {\n            throw normalizedError;\n        }\n        options.signal?.throwIfAborted();\n        return false;\n    }\n    if (!(await options.shouldRetry(context))) {\n        throw normalizedError;\n    }\n    if (!consumeRetry) {\n        options.signal?.throwIfAborted();\n        return false;\n    }\n    const delayTime = calculateDelay(retriesConsumed, options);\n    const finalDelay = Math.min(delayTime, remainingTime);\n    if (finalDelay > 0) {\n        await new Promise((resolve, reject) => {\n            const onAbort = () => {\n                clearTimeout(timeoutToken);\n                options.signal?.removeEventListener(\"abort\", onAbort);\n                reject(options.signal.reason);\n            };\n            const timeoutToken = setTimeout(() => {\n                options.signal?.removeEventListener(\"abort\", onAbort);\n                resolve();\n            }, finalDelay);\n            if (options.unref) {\n                timeoutToken.unref?.();\n            }\n            options.signal?.addEventListener(\"abort\", onAbort, { once: true });\n        });\n    }\n    options.signal?.throwIfAborted();\n    return true;\n}\nexport default async function pRetry(input, options = {}) {\n    options = { ...options };\n    validateRetries(options.retries);\n    if (Object.hasOwn(options, \"forever\")) {\n        throw new Error(\"The `forever` option is no longer supported. For many use-cases, you can set `retries: Infinity` instead.\");\n    }\n    options.retries ??= 10;\n    options.factor ??= 2;\n    options.minTimeout ??= 1000;\n    options.maxTimeout ??= Number.POSITIVE_INFINITY;\n    options.maxRetryTime ??= Number.POSITIVE_INFINITY;\n    options.randomize ??= false;\n    options.onFailedAttempt ??= () => { };\n    options.shouldRetry ??= () => true;\n    options.shouldConsumeRetry ??= () => true;\n    // Validate numeric options and normalize edge cases\n    validateNumberOption(\"factor\", options.factor, {\n        min: 0,\n        allowInfinity: false,\n    });\n    validateNumberOption(\"minTimeout\", options.minTimeout, {\n        min: 0,\n        allowInfinity: false,\n    });\n    validateNumberOption(\"maxTimeout\", options.maxTimeout, {\n        min: 0,\n        allowInfinity: true,\n    });\n    validateNumberOption(\"maxRetryTime\", options.maxRetryTime, {\n        min: 0,\n        allowInfinity: true,\n    });\n    // Treat non-positive factor as 1 to avoid zero backoff or negative behavior\n    if (!(options.factor > 0)) {\n        options.factor = 1;\n    }\n    options.signal?.throwIfAborted();\n    let attemptNumber = 0;\n    let retriesConsumed = 0;\n    const startTime = performance.now();\n    while (Number.isFinite(options.retries) ? retriesConsumed <= options.retries : true) {\n        attemptNumber++;\n        try {\n            options.signal?.throwIfAborted();\n            const result = await input(attemptNumber);\n            options.signal?.throwIfAborted();\n            return result;\n        }\n        catch (error) {\n            if (await onAttemptFailure({\n                error,\n                attemptNumber,\n                retriesConsumed,\n                startTime,\n                options,\n            })) {\n                retriesConsumed++;\n            }\n        }\n    }\n    // Should not reach here, but in case it does, throw an error\n    throw new Error(\"Retry attempts exhausted without throwing an error.\");\n}\nexport function makeRetriable(function_, options) {\n    return function (...arguments_) {\n        return pRetry(() => function_.apply(this, arguments_), options);\n    };\n}\n"],"names":[],"mappings":";AAKA,SAAS,gBAAgB,SAAS;AAC9B,MAAI,OAAO,YAAY,UAAU;AAC7B,QAAI,UAAU,GAAG;AACb,YAAM,IAAI,UAAU,iDAAiD;AAAA,IACzE;AACA,QAAI,OAAO,MAAM,OAAO,GAAG;AACvB,YAAM,IAAI,UAAU,+DAA+D;AAAA,IACvF;AAAA,EACJ,WACS,YAAY,QAAW;AAC5B,UAAM,IAAI,UAAU,gDAAgD;AAAA,EACxE;AACJ;AACA,SAAS,qBAAqB,MAAM,OAAO,EAAE,MAAM,GAAG,gBAAgB,MAAK,IAAK,IAAI;AAChF,MAAI,UAAU,QAAW;AACrB;AAAA,EACJ;AACA,MAAI,OAAO,UAAU,YAAY,OAAO,MAAM,KAAK,GAAG;AAClD,UAAM,IAAI,UAAU,cAAc,IAAI,oBAAoB,gBAAgB,iBAAiB,EAAE,GAAG;AAAA,EACpG;AACA,MAAI,CAAC,iBAAiB,CAAC,OAAO,SAAS,KAAK,GAAG;AAC3C,UAAM,IAAI,UAAU,cAAc,IAAI,2BAA2B;AAAA,EACrE;AACA,MAAI,QAAQ,KAAK;AACb,UAAM,IAAI,UAAU,cAAc,IAAI,cAAmB,GAAG,GAAG;AAAA,EACnE;AACJ;AACO,MAAM,mBAAmB,MAAM;AAAA,EAClC,YAAY,SAAS;AACjB,UAAK;AACL,QAAI,mBAAmB,OAAO;AAC1B,WAAK,gBAAgB;AACrB,OAAC,EAAE,QAAO,IAAK;AAAA,IACnB,OACK;AACD,WAAK,gBAAgB,IAAI,MAAM,OAAO;AACtC,WAAK,cAAc,QAAQ,KAAK;AAAA,IACpC;AACA,SAAK,OAAO;AACZ,SAAK,UAAU;AAAA,EACnB;AACJ;AACA,SAAS,eAAe,iBAAiB,SAAS;AAC9C,QAAM,UAAU,KAAK,IAAI,GAAG,kBAAkB,CAAC;AAC/C,QAAM,SAAS,QAAQ,YAAY,KAAK,OAAM,IAAK,IAAI;AACvD,MAAI,UAAU,KAAK,MAAM,SAAS,QAAQ,aAAa,QAAQ,WAAW,UAAU,EAAE;AACtF,YAAU,KAAK,IAAI,SAAS,QAAQ,UAAU;AAC9C,SAAO;AACX;AACA,SAAS,uBAAuB,OAAO,KAAK;AACxC,MAAI,CAAC,OAAO,SAAS,GAAG,GAAG;AACvB,WAAO;AAAA,EACX;AACA,SAAO,OAAO,YAAY,IAAG,IAAK;AACtC;AACA,eAAe,iBAAiB,EAAE,OAAO,eAAe,iBAAiB,WAAW,WAAY;AAC5F,QAAM,kBAAkB,iBAAiB,QACnC,QACA,IAAI,UAAU,0BAA0B,KAAK,kCAAkC;AACrF,MAAI,2BAA2B,YAAY;AACvC,UAAM,gBAAgB;AAAA,EAC1B;AACA,QAAM,cAAc,OAAO,SAAS,QAAQ,OAAO,IAC7C,KAAK,IAAI,GAAG,QAAQ,UAAU,eAAe,IAC7C,QAAQ;AACd,QAAM,eAAe,QAAQ,gBAAgB,OAAO;AACpD,QAAM,UAAU,OAAO,OAAO;AAAA,IAC1B,OAAO;AAAA,IACP;AAAA,IACA;AAAA,IACA;AAAA,EACR,CAAK;AACD,QAAM,QAAQ,gBAAgB,OAAO;AACrC,MAAI,uBAAuB,WAAW,YAAY,KAAK,GAAG;AACtD,UAAM;AAAA,EACV;AACA,QAAM,eAAe,MAAM,QAAQ,mBAAmB,OAAO;AAC7D,QAAM,gBAAgB,uBAAuB,WAAW,YAAY;AACpE,MAAI,iBAAiB,KAAK,eAAe,GAAG;AACxC,UAAM;AAAA,EACV;AACA,MAAI,2BAA2B,aAC3B,CAAC,eAAe,eAAe,GAAG;AAClC,QAAI,cAAc;AACd,YAAM;AAAA,IACV;AACA,YAAQ,QAAQ,eAAc;AAC9B,WAAO;AAAA,EACX;AACA,MAAI,CAAE,MAAM,QAAQ,YAAY,OAAO,GAAI;AACvC,UAAM;AAAA,EACV;AACA,MAAI,CAAC,cAAc;AACf,YAAQ,QAAQ,eAAc;AAC9B,WAAO;AAAA,EACX;AACA,QAAM,YAAY,eAAe,iBAAiB,OAAO;AACzD,QAAM,aAAa,KAAK,IAAI,WAAW,aAAa;AACpD,MAAI,aAAa,GAAG;AAChB,UAAM,IAAI,QAAQ,CAAC,SAAS,WAAW;AACnC,YAAM,UAAU,MAAM;AAClB,qBAAa,YAAY;AACzB,gBAAQ,QAAQ,oBAAoB,SAAS,OAAO;AACpD,eAAO,QAAQ,OAAO,MAAM;AAAA,MAChC;AACA,YAAM,eAAe,WAAW,MAAM;AAClC,gBAAQ,QAAQ,oBAAoB,SAAS,OAAO;AACpD,gBAAO;AAAA,MACX,GAAG,UAAU;AACb,UAAI,QAAQ,OAAO;AACf,qBAAa,QAAK;AAAA,MACtB;AACA,cAAQ,QAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,MAAM;AAAA,IACrE,CAAC;AAAA,EACL;AACA,UAAQ,QAAQ,eAAc;AAC9B,SAAO;AACX;AACe,eAAe,OAAO,OAAO,UAAU,IAAI;AACtD,YAAU,EAAE,GAAG,QAAO;AACtB,kBAAgB,QAAQ,OAAO;AAC/B,MAAI,OAAO,OAAO,SAAS,SAAS,GAAG;AACnC,UAAM,IAAI,MAAM,2GAA2G;AAAA,EAC/H;AACA,UAAQ,YAAY;AACpB,UAAQ,WAAW;AACnB,UAAQ,eAAe;AACvB,UAAQ,eAAe,OAAO;AAC9B,UAAQ,iBAAiB,OAAO;AAChC,UAAQ,cAAc;AACtB,UAAQ,oBAAoB,MAAM;AAAA,EAAE;AACpC,UAAQ,gBAAgB,MAAM;AAC9B,UAAQ,uBAAuB,MAAM;AAErC,uBAAqB,UAAU,QAAQ,QAAQ;AAAA,IAC3C,KAAK;AAAA,IACL,eAAe;AAAA,EACvB,CAAK;AACD,uBAAqB,cAAc,QAAQ,YAAY;AAAA,IACnD,KAAK;AAAA,IACL,eAAe;AAAA,EACvB,CAAK;AACD,uBAAqB,cAAc,QAAQ,YAAY;AAAA,IACnD,KAAK;AAAA,IACL,eAAe;AAAA,EACvB,CAAK;AACD,uBAAqB,gBAAgB,QAAQ,cAAc;AAAA,IACvD,KAAK;AAAA,IACL,eAAe;AAAA,EACvB,CAAK;AAED,MAAI,EAAE,QAAQ,SAAS,IAAI;AACvB,YAAQ,SAAS;AAAA,EACrB;AACA,UAAQ,QAAQ,eAAc;AAC9B,MAAI,gBAAgB;AACpB,MAAI,kBAAkB;AACtB,QAAM,YAAY,YAAY,IAAG;AACjC,SAAO,OAAO,SAAS,QAAQ,OAAO,IAAI,mBAAmB,QAAQ,UAAU,MAAM;AACjF;AACA,QAAI;AACA,cAAQ,QAAQ,eAAc;AAC9B,YAAM,SAAS,MAAM,MAAM,aAAa;AACxC,cAAQ,QAAQ,eAAc;AAC9B,aAAO;AAAA,IACX,SACO,OAAO;AACV,UAAI,MAAM,iBAAiB;AAAA,QACvB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MAChB,CAAa,GAAG;AACA;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAEA,QAAM,IAAI,MAAM,qDAAqD;AACzE;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es230.js","sources":["../node_modules/.pnpm/@cfworker+json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/validate.js"],"sourcesContent":["import { deepCompareStrict } from './deep-compare-strict.js';\nimport { dereference } from './dereference.js';\nimport { format } from './format.js';\nimport { encodePointer } from './pointer.js';\nimport { ucs2length } from './ucs2-length.js';\nexport function validate(instance, schema, draft = '2019-09', lookup = dereference(schema), shortCircuit = true, recursiveAnchor = null, instanceLocation = '#', schemaLocation = '#', evaluated = Object.create(null)) {\n    if (schema === true) {\n        return { valid: true, errors: [] };\n    }\n    if (schema === false) {\n        return {\n            valid: false,\n            errors: [\n                {\n                    instanceLocation,\n                    keyword: 'false',\n                    keywordLocation: instanceLocation,\n                    error: 'False boolean schema.'\n                }\n            ]\n        };\n    }\n    const rawInstanceType = typeof instance;\n    let instanceType;\n    switch (rawInstanceType) {\n        case 'boolean':\n        case 'number':\n        case 'string':\n            instanceType = rawInstanceType;\n            break;\n        case 'object':\n            if (instance === null) {\n                instanceType = 'null';\n            }\n            else if (Array.isArray(instance)) {\n                instanceType = 'array';\n            }\n            else {\n                instanceType = 'object';\n            }\n            break;\n        default:\n            throw new Error(`Instances of \"${rawInstanceType}\" type are not supported.`);\n    }\n    const { $ref, $recursiveRef, $recursiveAnchor, type: $type, const: $const, enum: $enum, required: $required, not: $not, anyOf: $anyOf, allOf: $allOf, oneOf: $oneOf, if: $if, then: $then, else: $else, format: $format, properties: $properties, patternProperties: $patternProperties, additionalProperties: $additionalProperties, unevaluatedProperties: $unevaluatedProperties, minProperties: $minProperties, maxProperties: $maxProperties, propertyNames: $propertyNames, dependentRequired: $dependentRequired, dependentSchemas: $dependentSchemas, dependencies: $dependencies, prefixItems: $prefixItems, items: $items, additionalItems: $additionalItems, unevaluatedItems: $unevaluatedItems, contains: $contains, minContains: $minContains, maxContains: $maxContains, minItems: $minItems, maxItems: $maxItems, uniqueItems: $uniqueItems, minimum: $minimum, maximum: $maximum, exclusiveMinimum: $exclusiveMinimum, exclusiveMaximum: $exclusiveMaximum, multipleOf: $multipleOf, minLength: $minLength, maxLength: $maxLength, pattern: $pattern, __absolute_ref__, __absolute_recursive_ref__ } = schema;\n    const errors = [];\n    if ($recursiveAnchor === true && recursiveAnchor === null) {\n        recursiveAnchor = schema;\n    }\n    if ($recursiveRef === '#') {\n        const refSchema = recursiveAnchor === null\n            ? lookup[__absolute_recursive_ref__]\n            : recursiveAnchor;\n        const keywordLocation = `${schemaLocation}/$recursiveRef`;\n        const result = validate(instance, recursiveAnchor === null ? schema : recursiveAnchor, draft, lookup, shortCircuit, refSchema, instanceLocation, keywordLocation, evaluated);\n        if (!result.valid) {\n            errors.push({\n                instanceLocation,\n                keyword: '$recursiveRef',\n                keywordLocation,\n                error: 'A subschema had errors.'\n            }, ...result.errors);\n        }\n    }\n    if ($ref !== undefined) {\n        const uri = __absolute_ref__ || $ref;\n        const refSchema = lookup[uri];\n        if (refSchema === undefined) {\n            let message = `Unresolved $ref \"${$ref}\".`;\n            if (__absolute_ref__ && __absolute_ref__ !== $ref) {\n                message += `  Absolute URI \"${__absolute_ref__}\".`;\n            }\n            message += `\\nKnown schemas:\\n- ${Object.keys(lookup).join('\\n- ')}`;\n            throw new Error(message);\n        }\n        const keywordLocation = `${schemaLocation}/$ref`;\n        const result = validate(instance, refSchema, draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, keywordLocation, evaluated);\n        if (!result.valid) {\n            errors.push({\n                instanceLocation,\n                keyword: '$ref',\n                keywordLocation,\n                error: 'A subschema had errors.'\n            }, ...result.errors);\n        }\n        if (draft === '4' || draft === '7') {\n            return { valid: errors.length === 0, errors };\n        }\n    }\n    if (Array.isArray($type)) {\n        let length = $type.length;\n        let valid = false;\n        for (let i = 0; i < length; i++) {\n            if (instanceType === $type[i] ||\n                ($type[i] === 'integer' &&\n                    instanceType === 'number' &&\n                    instance % 1 === 0 &&\n                    instance === instance)) {\n                valid = true;\n                break;\n            }\n        }\n        if (!valid) {\n            errors.push({\n                instanceLocation,\n                keyword: 'type',\n                keywordLocation: `${schemaLocation}/type`,\n                error: `Instance type \"${instanceType}\" is invalid. Expected \"${$type.join('\", \"')}\".`\n            });\n        }\n    }\n    else if ($type === 'integer') {\n        if (instanceType !== 'number' || instance % 1 || instance !== instance) {\n            errors.push({\n                instanceLocation,\n                keyword: 'type',\n                keywordLocation: `${schemaLocation}/type`,\n                error: `Instance type \"${instanceType}\" is invalid. Expected \"${$type}\".`\n            });\n        }\n    }\n    else if ($type !== undefined && instanceType !== $type) {\n        errors.push({\n            instanceLocation,\n            keyword: 'type',\n            keywordLocation: `${schemaLocation}/type`,\n            error: `Instance type \"${instanceType}\" is invalid. Expected \"${$type}\".`\n        });\n    }\n    if ($const !== undefined) {\n        if (instanceType === 'object' || instanceType === 'array') {\n            if (!deepCompareStrict(instance, $const)) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'const',\n                    keywordLocation: `${schemaLocation}/const`,\n                    error: `Instance does not match ${JSON.stringify($const)}.`\n                });\n            }\n        }\n        else if (instance !== $const) {\n            errors.push({\n                instanceLocation,\n                keyword: 'const',\n                keywordLocation: `${schemaLocation}/const`,\n                error: `Instance does not match ${JSON.stringify($const)}.`\n            });\n        }\n    }\n    if ($enum !== undefined) {\n        if (instanceType === 'object' || instanceType === 'array') {\n            if (!$enum.some(value => deepCompareStrict(instance, value))) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'enum',\n                    keywordLocation: `${schemaLocation}/enum`,\n                    error: `Instance does not match any of ${JSON.stringify($enum)}.`\n                });\n            }\n        }\n        else if (!$enum.some(value => instance === value)) {\n            errors.push({\n                instanceLocation,\n                keyword: 'enum',\n                keywordLocation: `${schemaLocation}/enum`,\n                error: `Instance does not match any of ${JSON.stringify($enum)}.`\n            });\n        }\n    }\n    if ($not !== undefined) {\n        const keywordLocation = `${schemaLocation}/not`;\n        const result = validate(instance, $not, draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, keywordLocation);\n        if (result.valid) {\n            errors.push({\n                instanceLocation,\n                keyword: 'not',\n                keywordLocation,\n                error: 'Instance matched \"not\" schema.'\n            });\n        }\n    }\n    let subEvaluateds = [];\n    if ($anyOf !== undefined) {\n        const keywordLocation = `${schemaLocation}/anyOf`;\n        const errorsLength = errors.length;\n        let anyValid = false;\n        for (let i = 0; i < $anyOf.length; i++) {\n            const subSchema = $anyOf[i];\n            const subEvaluated = Object.create(evaluated);\n            const result = validate(instance, subSchema, draft, lookup, shortCircuit, $recursiveAnchor === true ? recursiveAnchor : null, instanceLocation, `${keywordLocation}/${i}`, subEvaluated);\n            errors.push(...result.errors);\n            anyValid = anyValid || result.valid;\n            if (result.valid) {\n                subEvaluateds.push(subEvaluated);\n            }\n        }\n        if (anyValid) {\n            errors.length = errorsLength;\n        }\n        else {\n            errors.splice(errorsLength, 0, {\n                instanceLocation,\n                keyword: 'anyOf',\n                keywordLocation,\n                error: 'Instance does not match any subschemas.'\n            });\n        }\n    }\n    if ($allOf !== undefined) {\n        const keywordLocation = `${schemaLocation}/allOf`;\n        const errorsLength = errors.length;\n        let allValid = true;\n        for (let i = 0; i < $allOf.length; i++) {\n            const subSchema = $allOf[i];\n            const subEvaluated = Object.create(evaluated);\n            const result = validate(instance, subSchema, draft, lookup, shortCircuit, $recursiveAnchor === true ? recursiveAnchor : null, instanceLocation, `${keywordLocation}/${i}`, subEvaluated);\n            errors.push(...result.errors);\n            allValid = allValid && result.valid;\n            if (result.valid) {\n                subEvaluateds.push(subEvaluated);\n            }\n        }\n        if (allValid) {\n            errors.length = errorsLength;\n        }\n        else {\n            errors.splice(errorsLength, 0, {\n                instanceLocation,\n                keyword: 'allOf',\n                keywordLocation,\n                error: `Instance does not match every subschema.`\n            });\n        }\n    }\n    if ($oneOf !== undefined) {\n        const keywordLocation = `${schemaLocation}/oneOf`;\n        const errorsLength = errors.length;\n        const matches = $oneOf.filter((subSchema, i) => {\n            const subEvaluated = Object.create(evaluated);\n            const result = validate(instance, subSchema, draft, lookup, shortCircuit, $recursiveAnchor === true ? recursiveAnchor : null, instanceLocation, `${keywordLocation}/${i}`, subEvaluated);\n            errors.push(...result.errors);\n            if (result.valid) {\n                subEvaluateds.push(subEvaluated);\n            }\n            return result.valid;\n        }).length;\n        if (matches === 1) {\n            errors.length = errorsLength;\n        }\n        else {\n            errors.splice(errorsLength, 0, {\n                instanceLocation,\n                keyword: 'oneOf',\n                keywordLocation,\n                error: `Instance does not match exactly one subschema (${matches} matches).`\n            });\n        }\n    }\n    if (instanceType === 'object' || instanceType === 'array') {\n        Object.assign(evaluated, ...subEvaluateds);\n    }\n    if ($if !== undefined) {\n        const keywordLocation = `${schemaLocation}/if`;\n        const conditionResult = validate(instance, $if, draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, keywordLocation, evaluated).valid;\n        if (conditionResult) {\n            if ($then !== undefined) {\n                const thenResult = validate(instance, $then, draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, `${schemaLocation}/then`, evaluated);\n                if (!thenResult.valid) {\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'if',\n                        keywordLocation,\n                        error: `Instance does not match \"then\" schema.`\n                    }, ...thenResult.errors);\n                }\n            }\n        }\n        else if ($else !== undefined) {\n            const elseResult = validate(instance, $else, draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, `${schemaLocation}/else`, evaluated);\n            if (!elseResult.valid) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'if',\n                    keywordLocation,\n                    error: `Instance does not match \"else\" schema.`\n                }, ...elseResult.errors);\n            }\n        }\n    }\n    if (instanceType === 'object') {\n        if ($required !== undefined) {\n            for (const key of $required) {\n                if (!(key in instance)) {\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'required',\n                        keywordLocation: `${schemaLocation}/required`,\n                        error: `Instance does not have required property \"${key}\".`\n                    });\n                }\n            }\n        }\n        const keys = Object.keys(instance);\n        if ($minProperties !== undefined && keys.length < $minProperties) {\n            errors.push({\n                instanceLocation,\n                keyword: 'minProperties',\n                keywordLocation: `${schemaLocation}/minProperties`,\n                error: `Instance does not have at least ${$minProperties} properties.`\n            });\n        }\n        if ($maxProperties !== undefined && keys.length > $maxProperties) {\n            errors.push({\n                instanceLocation,\n                keyword: 'maxProperties',\n                keywordLocation: `${schemaLocation}/maxProperties`,\n                error: `Instance does not have at least ${$maxProperties} properties.`\n            });\n        }\n        if ($propertyNames !== undefined) {\n            const keywordLocation = `${schemaLocation}/propertyNames`;\n            for (const key in instance) {\n                const subInstancePointer = `${instanceLocation}/${encodePointer(key)}`;\n                const result = validate(key, $propertyNames, draft, lookup, shortCircuit, recursiveAnchor, subInstancePointer, keywordLocation);\n                if (!result.valid) {\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'propertyNames',\n                        keywordLocation,\n                        error: `Property name \"${key}\" does not match schema.`\n                    }, ...result.errors);\n                }\n            }\n        }\n        if ($dependentRequired !== undefined) {\n            const keywordLocation = `${schemaLocation}/dependantRequired`;\n            for (const key in $dependentRequired) {\n                if (key in instance) {\n                    const required = $dependentRequired[key];\n                    for (const dependantKey of required) {\n                        if (!(dependantKey in instance)) {\n                            errors.push({\n                                instanceLocation,\n                                keyword: 'dependentRequired',\n                                keywordLocation,\n                                error: `Instance has \"${key}\" but does not have \"${dependantKey}\".`\n                            });\n                        }\n                    }\n                }\n            }\n        }\n        if ($dependentSchemas !== undefined) {\n            for (const key in $dependentSchemas) {\n                const keywordLocation = `${schemaLocation}/dependentSchemas`;\n                if (key in instance) {\n                    const result = validate(instance, $dependentSchemas[key], draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, `${keywordLocation}/${encodePointer(key)}`, evaluated);\n                    if (!result.valid) {\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'dependentSchemas',\n                            keywordLocation,\n                            error: `Instance has \"${key}\" but does not match dependant schema.`\n                        }, ...result.errors);\n                    }\n                }\n            }\n        }\n        if ($dependencies !== undefined) {\n            const keywordLocation = `${schemaLocation}/dependencies`;\n            for (const key in $dependencies) {\n                if (key in instance) {\n                    const propsOrSchema = $dependencies[key];\n                    if (Array.isArray(propsOrSchema)) {\n                        for (const dependantKey of propsOrSchema) {\n                            if (!(dependantKey in instance)) {\n                                errors.push({\n                                    instanceLocation,\n                                    keyword: 'dependencies',\n                                    keywordLocation,\n                                    error: `Instance has \"${key}\" but does not have \"${dependantKey}\".`\n                                });\n                            }\n                        }\n                    }\n                    else {\n                        const result = validate(instance, propsOrSchema, draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, `${keywordLocation}/${encodePointer(key)}`);\n                        if (!result.valid) {\n                            errors.push({\n                                instanceLocation,\n                                keyword: 'dependencies',\n                                keywordLocation,\n                                error: `Instance has \"${key}\" but does not match dependant schema.`\n                            }, ...result.errors);\n                        }\n                    }\n                }\n            }\n        }\n        const thisEvaluated = Object.create(null);\n        let stop = false;\n        if ($properties !== undefined) {\n            const keywordLocation = `${schemaLocation}/properties`;\n            for (const key in $properties) {\n                if (!(key in instance)) {\n                    continue;\n                }\n                const subInstancePointer = `${instanceLocation}/${encodePointer(key)}`;\n                const result = validate(instance[key], $properties[key], draft, lookup, shortCircuit, recursiveAnchor, subInstancePointer, `${keywordLocation}/${encodePointer(key)}`);\n                if (result.valid) {\n                    evaluated[key] = thisEvaluated[key] = true;\n                }\n                else {\n                    stop = shortCircuit;\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'properties',\n                        keywordLocation,\n                        error: `Property \"${key}\" does not match schema.`\n                    }, ...result.errors);\n                    if (stop)\n                        break;\n                }\n            }\n        }\n        if (!stop && $patternProperties !== undefined) {\n            const keywordLocation = `${schemaLocation}/patternProperties`;\n            for (const pattern in $patternProperties) {\n                const regex = new RegExp(pattern, 'u');\n                const subSchema = $patternProperties[pattern];\n                for (const key in instance) {\n                    if (!regex.test(key)) {\n                        continue;\n                    }\n                    const subInstancePointer = `${instanceLocation}/${encodePointer(key)}`;\n                    const result = validate(instance[key], subSchema, draft, lookup, shortCircuit, recursiveAnchor, subInstancePointer, `${keywordLocation}/${encodePointer(pattern)}`);\n                    if (result.valid) {\n                        evaluated[key] = thisEvaluated[key] = true;\n                    }\n                    else {\n                        stop = shortCircuit;\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'patternProperties',\n                            keywordLocation,\n                            error: `Property \"${key}\" matches pattern \"${pattern}\" but does not match associated schema.`\n                        }, ...result.errors);\n                    }\n                }\n            }\n        }\n        if (!stop && $additionalProperties !== undefined) {\n            const keywordLocation = `${schemaLocation}/additionalProperties`;\n            for (const key in instance) {\n                if (thisEvaluated[key]) {\n                    continue;\n                }\n                const subInstancePointer = `${instanceLocation}/${encodePointer(key)}`;\n                const result = validate(instance[key], $additionalProperties, draft, lookup, shortCircuit, recursiveAnchor, subInstancePointer, keywordLocation);\n                if (result.valid) {\n                    evaluated[key] = true;\n                }\n                else {\n                    stop = shortCircuit;\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'additionalProperties',\n                        keywordLocation,\n                        error: `Property \"${key}\" does not match additional properties schema.`\n                    }, ...result.errors);\n                }\n            }\n        }\n        else if (!stop && $unevaluatedProperties !== undefined) {\n            const keywordLocation = `${schemaLocation}/unevaluatedProperties`;\n            for (const key in instance) {\n                if (!evaluated[key]) {\n                    const subInstancePointer = `${instanceLocation}/${encodePointer(key)}`;\n                    const result = validate(instance[key], $unevaluatedProperties, draft, lookup, shortCircuit, recursiveAnchor, subInstancePointer, keywordLocation);\n                    if (result.valid) {\n                        evaluated[key] = true;\n                    }\n                    else {\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'unevaluatedProperties',\n                            keywordLocation,\n                            error: `Property \"${key}\" does not match unevaluated properties schema.`\n                        }, ...result.errors);\n                    }\n                }\n            }\n        }\n    }\n    else if (instanceType === 'array') {\n        if ($maxItems !== undefined && instance.length > $maxItems) {\n            errors.push({\n                instanceLocation,\n                keyword: 'maxItems',\n                keywordLocation: `${schemaLocation}/maxItems`,\n                error: `Array has too many items (${instance.length} > ${$maxItems}).`\n            });\n        }\n        if ($minItems !== undefined && instance.length < $minItems) {\n            errors.push({\n                instanceLocation,\n                keyword: 'minItems',\n                keywordLocation: `${schemaLocation}/minItems`,\n                error: `Array has too few items (${instance.length} < ${$minItems}).`\n            });\n        }\n        const length = instance.length;\n        let i = 0;\n        let stop = false;\n        if ($prefixItems !== undefined) {\n            const keywordLocation = `${schemaLocation}/prefixItems`;\n            const length2 = Math.min($prefixItems.length, length);\n            for (; i < length2; i++) {\n                const result = validate(instance[i], $prefixItems[i], draft, lookup, shortCircuit, recursiveAnchor, `${instanceLocation}/${i}`, `${keywordLocation}/${i}`);\n                evaluated[i] = true;\n                if (!result.valid) {\n                    stop = shortCircuit;\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'prefixItems',\n                        keywordLocation,\n                        error: `Items did not match schema.`\n                    }, ...result.errors);\n                    if (stop)\n                        break;\n                }\n            }\n        }\n        if ($items !== undefined) {\n            const keywordLocation = `${schemaLocation}/items`;\n            if (Array.isArray($items)) {\n                const length2 = Math.min($items.length, length);\n                for (; i < length2; i++) {\n                    const result = validate(instance[i], $items[i], draft, lookup, shortCircuit, recursiveAnchor, `${instanceLocation}/${i}`, `${keywordLocation}/${i}`);\n                    evaluated[i] = true;\n                    if (!result.valid) {\n                        stop = shortCircuit;\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'items',\n                            keywordLocation,\n                            error: `Items did not match schema.`\n                        }, ...result.errors);\n                        if (stop)\n                            break;\n                    }\n                }\n            }\n            else {\n                for (; i < length; i++) {\n                    const result = validate(instance[i], $items, draft, lookup, shortCircuit, recursiveAnchor, `${instanceLocation}/${i}`, keywordLocation);\n                    evaluated[i] = true;\n                    if (!result.valid) {\n                        stop = shortCircuit;\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'items',\n                            keywordLocation,\n                            error: `Items did not match schema.`\n                        }, ...result.errors);\n                        if (stop)\n                            break;\n                    }\n                }\n            }\n            if (!stop && $additionalItems !== undefined) {\n                const keywordLocation = `${schemaLocation}/additionalItems`;\n                for (; i < length; i++) {\n                    const result = validate(instance[i], $additionalItems, draft, lookup, shortCircuit, recursiveAnchor, `${instanceLocation}/${i}`, keywordLocation);\n                    evaluated[i] = true;\n                    if (!result.valid) {\n                        stop = shortCircuit;\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'additionalItems',\n                            keywordLocation,\n                            error: `Items did not match additional items schema.`\n                        }, ...result.errors);\n                    }\n                }\n            }\n        }\n        if ($contains !== undefined) {\n            if (length === 0 && $minContains === undefined) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'contains',\n                    keywordLocation: `${schemaLocation}/contains`,\n                    error: `Array is empty. It must contain at least one item matching the schema.`\n                });\n            }\n            else if ($minContains !== undefined && length < $minContains) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'minContains',\n                    keywordLocation: `${schemaLocation}/minContains`,\n                    error: `Array has less items (${length}) than minContains (${$minContains}).`\n                });\n            }\n            else {\n                const keywordLocation = `${schemaLocation}/contains`;\n                const errorsLength = errors.length;\n                let contained = 0;\n                for (let j = 0; j < length; j++) {\n                    const result = validate(instance[j], $contains, draft, lookup, shortCircuit, recursiveAnchor, `${instanceLocation}/${j}`, keywordLocation);\n                    if (result.valid) {\n                        evaluated[j] = true;\n                        contained++;\n                    }\n                    else {\n                        errors.push(...result.errors);\n                    }\n                }\n                if (contained >= ($minContains || 0)) {\n                    errors.length = errorsLength;\n                }\n                if ($minContains === undefined &&\n                    $maxContains === undefined &&\n                    contained === 0) {\n                    errors.splice(errorsLength, 0, {\n                        instanceLocation,\n                        keyword: 'contains',\n                        keywordLocation,\n                        error: `Array does not contain item matching schema.`\n                    });\n                }\n                else if ($minContains !== undefined && contained < $minContains) {\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'minContains',\n                        keywordLocation: `${schemaLocation}/minContains`,\n                        error: `Array must contain at least ${$minContains} items matching schema. Only ${contained} items were found.`\n                    });\n                }\n                else if ($maxContains !== undefined && contained > $maxContains) {\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'maxContains',\n                        keywordLocation: `${schemaLocation}/maxContains`,\n                        error: `Array may contain at most ${$maxContains} items matching schema. ${contained} items were found.`\n                    });\n                }\n            }\n        }\n        if (!stop && $unevaluatedItems !== undefined) {\n            const keywordLocation = `${schemaLocation}/unevaluatedItems`;\n            for (i; i < length; i++) {\n                if (evaluated[i]) {\n                    continue;\n                }\n                const result = validate(instance[i], $unevaluatedItems, draft, lookup, shortCircuit, recursiveAnchor, `${instanceLocation}/${i}`, keywordLocation);\n                evaluated[i] = true;\n                if (!result.valid) {\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'unevaluatedItems',\n                        keywordLocation,\n                        error: `Items did not match unevaluated items schema.`\n                    }, ...result.errors);\n                }\n            }\n        }\n        if ($uniqueItems) {\n            for (let j = 0; j < length; j++) {\n                const a = instance[j];\n                const ao = typeof a === 'object' && a !== null;\n                for (let k = 0; k < length; k++) {\n                    if (j === k) {\n                        continue;\n                    }\n                    const b = instance[k];\n                    const bo = typeof b === 'object' && b !== null;\n                    if (a === b || (ao && bo && deepCompareStrict(a, b))) {\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'uniqueItems',\n                            keywordLocation: `${schemaLocation}/uniqueItems`,\n                            error: `Duplicate items at indexes ${j} and ${k}.`\n                        });\n                        j = Number.MAX_SAFE_INTEGER;\n                        k = Number.MAX_SAFE_INTEGER;\n                    }\n                }\n            }\n        }\n    }\n    else if (instanceType === 'number') {\n        if (draft === '4') {\n            if ($minimum !== undefined &&\n                (($exclusiveMinimum === true && instance <= $minimum) ||\n                    instance < $minimum)) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'minimum',\n                    keywordLocation: `${schemaLocation}/minimum`,\n                    error: `${instance} is less than ${$exclusiveMinimum ? 'or equal to ' : ''} ${$minimum}.`\n                });\n            }\n            if ($maximum !== undefined &&\n                (($exclusiveMaximum === true && instance >= $maximum) ||\n                    instance > $maximum)) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'maximum',\n                    keywordLocation: `${schemaLocation}/maximum`,\n                    error: `${instance} is greater than ${$exclusiveMaximum ? 'or equal to ' : ''} ${$maximum}.`\n                });\n            }\n        }\n        else {\n            if ($minimum !== undefined && instance < $minimum) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'minimum',\n                    keywordLocation: `${schemaLocation}/minimum`,\n                    error: `${instance} is less than ${$minimum}.`\n                });\n            }\n            if ($maximum !== undefined && instance > $maximum) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'maximum',\n                    keywordLocation: `${schemaLocation}/maximum`,\n                    error: `${instance} is greater than ${$maximum}.`\n                });\n            }\n            if ($exclusiveMinimum !== undefined && instance <= $exclusiveMinimum) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'exclusiveMinimum',\n                    keywordLocation: `${schemaLocation}/exclusiveMinimum`,\n                    error: `${instance} is less than ${$exclusiveMinimum}.`\n                });\n            }\n            if ($exclusiveMaximum !== undefined && instance >= $exclusiveMaximum) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'exclusiveMaximum',\n                    keywordLocation: `${schemaLocation}/exclusiveMaximum`,\n                    error: `${instance} is greater than or equal to ${$exclusiveMaximum}.`\n                });\n            }\n        }\n        if ($multipleOf !== undefined) {\n            const remainder = instance % $multipleOf;\n            if (Math.abs(0 - remainder) >= 1.1920929e-7 &&\n                Math.abs($multipleOf - remainder) >= 1.1920929e-7) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'multipleOf',\n                    keywordLocation: `${schemaLocation}/multipleOf`,\n                    error: `${instance} is not a multiple of ${$multipleOf}.`\n                });\n            }\n        }\n    }\n    else if (instanceType === 'string') {\n        const length = $minLength === undefined && $maxLength === undefined\n            ? 0\n            : ucs2length(instance);\n        if ($minLength !== undefined && length < $minLength) {\n            errors.push({\n                instanceLocation,\n                keyword: 'minLength',\n                keywordLocation: `${schemaLocation}/minLength`,\n                error: `String is too short (${length} < ${$minLength}).`\n            });\n        }\n        if ($maxLength !== undefined && length > $maxLength) {\n            errors.push({\n                instanceLocation,\n                keyword: 'maxLength',\n                keywordLocation: `${schemaLocation}/maxLength`,\n                error: `String is too long (${length} > ${$maxLength}).`\n            });\n        }\n        if ($pattern !== undefined && !new RegExp($pattern, 'u').test(instance)) {\n            errors.push({\n                instanceLocation,\n                keyword: 'pattern',\n                keywordLocation: `${schemaLocation}/pattern`,\n                error: `String does not match pattern.`\n            });\n        }\n        if ($format !== undefined &&\n            format[$format] &&\n            !format[$format](instance)) {\n            errors.push({\n                instanceLocation,\n                keyword: 'format',\n                keywordLocation: `${schemaLocation}/format`,\n                error: `String does not match format \"${$format}\".`\n            });\n        }\n    }\n    return { valid: errors.length === 0, errors };\n}\n"],"names":["keywordLocation"],"mappings":";;;;;AAKO,SAAS,SAAS,UAAU,QAAQ,QAAQ,WAAW,SAAS,YAAY,MAAM,GAAG,eAAe,MAAM,kBAAkB,MAAM,mBAAmB,KAAK,iBAAiB,KAAK,YAAY,uBAAO,OAAO,IAAI,GAAG;AACpN,MAAI,WAAW,MAAM;AACjB,WAAO,EAAE,OAAO,MAAM,QAAQ,CAAA,EAAE;AAAA,EACpC;AACA,MAAI,WAAW,OAAO;AAClB,WAAO;AAAA,MACH,OAAO;AAAA,MACP,QAAQ;AAAA,QACJ;AAAA,UACI;AAAA,UACA,SAAS;AAAA,UACT,iBAAiB;AAAA,UACjB,OAAO;AAAA,QAC3B;AAAA,MACA;AAAA,IACA;AAAA,EACI;AACA,QAAM,kBAAkB,OAAO;AAC/B,MAAI;AACJ,UAAQ,iBAAe;AAAA,IACnB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACD,qBAAe;AACf;AAAA,IACJ,KAAK;AACD,UAAI,aAAa,MAAM;AACnB,uBAAe;AAAA,MACnB,WACS,MAAM,QAAQ,QAAQ,GAAG;AAC9B,uBAAe;AAAA,MACnB,OACK;AACD,uBAAe;AAAA,MACnB;AACA;AAAA,IACJ;AACI,YAAM,IAAI,MAAM,iBAAiB,eAAe,2BAA2B;AAAA,EACvF;AACI,QAAM,EAAE,MAAM,eAAe,kBAAkB,MAAM,OAAO,OAAO,QAAQ,MAAM,OAAO,UAAU,WAAW,KAAK,MAAM,OAAO,QAAQ,OAAO,QAAQ,OAAO,QAAQ,IAAI,KAAK,MAAM,OAAO,MAAM,OAAO,QAAQ,SAAS,YAAY,aAAa,mBAAmB,oBAAoB,sBAAsB,uBAAuB,uBAAuB,wBAAwB,eAAe,gBAAgB,eAAe,gBAAgB,eAAe,gBAAgB,mBAAmB,oBAAoB,kBAAkB,mBAAmB,cAAc,eAAe,aAAa,cAAc,OAAO,QAAQ,iBAAiB,kBAAkB,kBAAkB,mBAAmB,UAAU,WAAW,aAAa,cAAc,aAAa,cAAc,UAAU,WAAW,UAAU,WAAW,aAAa,cAAc,SAAS,UAAU,SAAS,UAAU,kBAAkB,mBAAmB,kBAAkB,mBAAmB,YAAY,aAAa,WAAW,YAAY,WAAW,YAAY,SAAS,UAAU,kBAAkB,2BAA0B,IAAK;AACxjC,QAAM,SAAS,CAAA;AACf,MAAI,qBAAqB,QAAQ,oBAAoB,MAAM;AACvD,sBAAkB;AAAA,EACtB;AACA,MAAI,kBAAkB,KAAK;AACvB,UAAM,YAAY,oBAAoB,OAChC,OAAO,0BAA0B,IACjC;AACN,UAAM,kBAAkB,GAAG,cAAc;AACzC,UAAM,SAAS,SAAS,UAAU,oBAAoB,OAAO,SAAS,iBAAiB,OAAO,QAAQ,cAAc,WAAW,kBAAkB,iBAAiB,SAAS;AAC3K,QAAI,CAAC,OAAO,OAAO;AACf,aAAO,KAAK;AAAA,QACR;AAAA,QACA,SAAS;AAAA,QACT;AAAA,QACA,OAAO;AAAA,MACvB,GAAe,GAAG,OAAO,MAAM;AAAA,IACvB;AAAA,EACJ;AACA,MAAI,SAAS,QAAW;AACpB,UAAM,MAAM,oBAAoB;AAChC,UAAM,YAAY,OAAO,GAAG;AAC5B,QAAI,cAAc,QAAW;AACzB,UAAI,UAAU,oBAAoB,IAAI;AACtC,UAAI,oBAAoB,qBAAqB,MAAM;AAC/C,mBAAW,mBAAmB,gBAAgB;AAAA,MAClD;AACA,iBAAW;AAAA;AAAA,IAAuB,OAAO,KAAK,MAAM,EAAE,KAAK,MAAM,CAAC;AAClE,YAAM,IAAI,MAAM,OAAO;AAAA,IAC3B;AACA,UAAM,kBAAkB,GAAG,cAAc;AACzC,UAAM,SAAS,SAAS,UAAU,WAAW,OAAO,QAAQ,cAAc,iBAAiB,kBAAkB,iBAAiB,SAAS;AACvI,QAAI,CAAC,OAAO,OAAO;AACf,aAAO,KAAK;AAAA,QACR;AAAA,QACA,SAAS;AAAA,QACT;AAAA,QACA,OAAO;AAAA,MACvB,GAAe,GAAG,OAAO,MAAM;AAAA,IACvB;AACA,QAAI,UAAU,OAAO,UAAU,KAAK;AAChC,aAAO,EAAE,OAAO,OAAO,WAAW,GAAG,OAAM;AAAA,IAC/C;AAAA,EACJ;AACA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACtB,QAAI,SAAS,MAAM;AACnB,QAAI,QAAQ;AACZ,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC7B,UAAI,iBAAiB,MAAM,CAAC,KACvB,MAAM,CAAC,MAAM,aACV,iBAAiB,YACjB,WAAW,MAAM,KACjB,aAAa,UAAW;AAC5B,gBAAQ;AACR;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,CAAC,OAAO;AACR,aAAO,KAAK;AAAA,QACR;AAAA,QACA,SAAS;AAAA,QACT,iBAAiB,GAAG,cAAc;AAAA,QAClC,OAAO,kBAAkB,YAAY,2BAA2B,MAAM,KAAK,MAAM,CAAC;AAAA,MAClG,CAAa;AAAA,IACL;AAAA,EACJ,WACS,UAAU,WAAW;AAC1B,QAAI,iBAAiB,YAAY,WAAW,KAAK,aAAa,UAAU;AACpE,aAAO,KAAK;AAAA,QACR;AAAA,QACA,SAAS;AAAA,QACT,iBAAiB,GAAG,cAAc;AAAA,QAClC,OAAO,kBAAkB,YAAY,2BAA2B,KAAK;AAAA,MACrF,CAAa;AAAA,IACL;AAAA,EACJ,WACS,UAAU,UAAa,iBAAiB,OAAO;AACpD,WAAO,KAAK;AAAA,MACR;AAAA,MACA,SAAS;AAAA,MACT,iBAAiB,GAAG,cAAc;AAAA,MAClC,OAAO,kBAAkB,YAAY,2BAA2B,KAAK;AAAA,IACjF,CAAS;AAAA,EACL;AACA,MAAI,WAAW,QAAW;AACtB,QAAI,iBAAiB,YAAY,iBAAiB,SAAS;AACvD,UAAI,CAAC,kBAAkB,UAAU,MAAM,GAAG;AACtC,eAAO,KAAK;AAAA,UACR;AAAA,UACA,SAAS;AAAA,UACT,iBAAiB,GAAG,cAAc;AAAA,UAClC,OAAO,2BAA2B,KAAK,UAAU,MAAM,CAAC;AAAA,QAC5E,CAAiB;AAAA,MACL;AAAA,IACJ,WACS,aAAa,QAAQ;AAC1B,aAAO,KAAK;AAAA,QACR;AAAA,QACA,SAAS;AAAA,QACT,iBAAiB,GAAG,cAAc;AAAA,QAClC,OAAO,2BAA2B,KAAK,UAAU,MAAM,CAAC;AAAA,MACxE,CAAa;AAAA,IACL;AAAA,EACJ;AACA,MAAI,UAAU,QAAW;AACrB,QAAI,iBAAiB,YAAY,iBAAiB,SAAS;AACvD,UAAI,CAAC,MAAM,KAAK,WAAS,kBAAkB,UAAU,KAAK,CAAC,GAAG;AAC1D,eAAO,KAAK;AAAA,UACR;AAAA,UACA,SAAS;AAAA,UACT,iBAAiB,GAAG,cAAc;AAAA,UAClC,OAAO,kCAAkC,KAAK,UAAU,KAAK,CAAC;AAAA,QAClF,CAAiB;AAAA,MACL;AAAA,IACJ,WACS,CAAC,MAAM,KAAK,WAAS,aAAa,KAAK,GAAG;AAC/C,aAAO,KAAK;AAAA,QACR;AAAA,QACA,SAAS;AAAA,QACT,iBAAiB,GAAG,cAAc;AAAA,QAClC,OAAO,kCAAkC,KAAK,UAAU,KAAK,CAAC;AAAA,MAC9E,CAAa;AAAA,IACL;AAAA,EACJ;AACA,MAAI,SAAS,QAAW;AACpB,UAAM,kBAAkB,GAAG,cAAc;AACzC,UAAM,SAAS,SAAS,UAAU,MAAM,OAAO,QAAQ,cAAc,iBAAiB,kBAAkB,eAAe;AACvH,QAAI,OAAO,OAAO;AACd,aAAO,KAAK;AAAA,QACR;AAAA,QACA,SAAS;AAAA,QACT;AAAA,QACA,OAAO;AAAA,MACvB,CAAa;AAAA,IACL;AAAA,EACJ;AACA,MAAI,gBAAgB,CAAA;AACpB,MAAI,WAAW,QAAW;AACtB,UAAM,kBAAkB,GAAG,cAAc;AACzC,UAAM,eAAe,OAAO;AAC5B,QAAI,WAAW;AACf,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,YAAM,YAAY,OAAO,CAAC;AAC1B,YAAM,eAAe,OAAO,OAAO,SAAS;AAC5C,YAAM,SAAS,SAAS,UAAU,WAAW,OAAO,QAAQ,cAAc,qBAAqB,OAAO,kBAAkB,MAAM,kBAAkB,GAAG,eAAe,IAAI,CAAC,IAAI,YAAY;AACvL,aAAO,KAAK,GAAG,OAAO,MAAM;AAC5B,iBAAW,YAAY,OAAO;AAC9B,UAAI,OAAO,OAAO;AACd,sBAAc,KAAK,YAAY;AAAA,MACnC;AAAA,IACJ;AACA,QAAI,UAAU;AACV,aAAO,SAAS;AAAA,IACpB,OACK;AACD,aAAO,OAAO,cAAc,GAAG;AAAA,QAC3B;AAAA,QACA,SAAS;AAAA,QACT;AAAA,QACA,OAAO;AAAA,MACvB,CAAa;AAAA,IACL;AAAA,EACJ;AACA,MAAI,WAAW,QAAW;AACtB,UAAM,kBAAkB,GAAG,cAAc;AACzC,UAAM,eAAe,OAAO;AAC5B,QAAI,WAAW;AACf,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,YAAM,YAAY,OAAO,CAAC;AAC1B,YAAM,eAAe,OAAO,OAAO,SAAS;AAC5C,YAAM,SAAS,SAAS,UAAU,WAAW,OAAO,QAAQ,cAAc,qBAAqB,OAAO,kBAAkB,MAAM,kBAAkB,GAAG,eAAe,IAAI,CAAC,IAAI,YAAY;AACvL,aAAO,KAAK,GAAG,OAAO,MAAM;AAC5B,iBAAW,YAAY,OAAO;AAC9B,UAAI,OAAO,OAAO;AACd,sBAAc,KAAK,YAAY;AAAA,MACnC;AAAA,IACJ;AACA,QAAI,UAAU;AACV,aAAO,SAAS;AAAA,IACpB,OACK;AACD,aAAO,OAAO,cAAc,GAAG;AAAA,QAC3B;AAAA,QACA,SAAS;AAAA,QACT;AAAA,QACA,OAAO;AAAA,MACvB,CAAa;AAAA,IACL;AAAA,EACJ;AACA,MAAI,WAAW,QAAW;AACtB,UAAM,kBAAkB,GAAG,cAAc;AACzC,UAAM,eAAe,OAAO;AAC5B,UAAM,UAAU,OAAO,OAAO,CAAC,WAAW,MAAM;AAC5C,YAAM,eAAe,OAAO,OAAO,SAAS;AAC5C,YAAM,SAAS,SAAS,UAAU,WAAW,OAAO,QAAQ,cAAc,qBAAqB,OAAO,kBAAkB,MAAM,kBAAkB,GAAG,eAAe,IAAI,CAAC,IAAI,YAAY;AACvL,aAAO,KAAK,GAAG,OAAO,MAAM;AAC5B,UAAI,OAAO,OAAO;AACd,sBAAc,KAAK,YAAY;AAAA,MACnC;AACA,aAAO,OAAO;AAAA,IAClB,CAAC,EAAE;AACH,QAAI,YAAY,GAAG;AACf,aAAO,SAAS;AAAA,IACpB,OACK;AACD,aAAO,OAAO,cAAc,GAAG;AAAA,QAC3B;AAAA,QACA,SAAS;AAAA,QACT;AAAA,QACA,OAAO,kDAAkD,OAAO;AAAA,MAChF,CAAa;AAAA,IACL;AAAA,EACJ;AACA,MAAI,iBAAiB,YAAY,iBAAiB,SAAS;AACvD,WAAO,OAAO,WAAW,GAAG,aAAa;AAAA,EAC7C;AACA,MAAI,QAAQ,QAAW;AACnB,UAAM,kBAAkB,GAAG,cAAc;AACzC,UAAM,kBAAkB,SAAS,UAAU,KAAK,OAAO,QAAQ,cAAc,iBAAiB,kBAAkB,iBAAiB,SAAS,EAAE;AAC5I,QAAI,iBAAiB;AACjB,UAAI,UAAU,QAAW;AACrB,cAAM,aAAa,SAAS,UAAU,OAAO,OAAO,QAAQ,cAAc,iBAAiB,kBAAkB,GAAG,cAAc,SAAS,SAAS;AAChJ,YAAI,CAAC,WAAW,OAAO;AACnB,iBAAO,KAAK;AAAA,YACR;AAAA,YACA,SAAS;AAAA,YACT;AAAA,YACA,OAAO;AAAA,UAC/B,GAAuB,GAAG,WAAW,MAAM;AAAA,QAC3B;AAAA,MACJ;AAAA,IACJ,WACS,UAAU,QAAW;AAC1B,YAAM,aAAa,SAAS,UAAU,OAAO,OAAO,QAAQ,cAAc,iBAAiB,kBAAkB,GAAG,cAAc,SAAS,SAAS;AAChJ,UAAI,CAAC,WAAW,OAAO;AACnB,eAAO,KAAK;AAAA,UACR;AAAA,UACA,SAAS;AAAA,UACT;AAAA,UACA,OAAO;AAAA,QAC3B,GAAmB,GAAG,WAAW,MAAM;AAAA,MAC3B;AAAA,IACJ;AAAA,EACJ;AACA,MAAI,iBAAiB,UAAU;AAC3B,QAAI,cAAc,QAAW;AACzB,iBAAW,OAAO,WAAW;AACzB,YAAI,EAAE,OAAO,WAAW;AACpB,iBAAO,KAAK;AAAA,YACR;AAAA,YACA,SAAS;AAAA,YACT,iBAAiB,GAAG,cAAc;AAAA,YAClC,OAAO,6CAA6C,GAAG;AAAA,UAC/E,CAAqB;AAAA,QACL;AAAA,MACJ;AAAA,IACJ;AACA,UAAM,OAAO,OAAO,KAAK,QAAQ;AACjC,QAAI,mBAAmB,UAAa,KAAK,SAAS,gBAAgB;AAC9D,aAAO,KAAK;AAAA,QACR;AAAA,QACA,SAAS;AAAA,QACT,iBAAiB,GAAG,cAAc;AAAA,QAClC,OAAO,mCAAmC,cAAc;AAAA,MACxE,CAAa;AAAA,IACL;AACA,QAAI,mBAAmB,UAAa,KAAK,SAAS,gBAAgB;AAC9D,aAAO,KAAK;AAAA,QACR;AAAA,QACA,SAAS;AAAA,QACT,iBAAiB,GAAG,cAAc;AAAA,QAClC,OAAO,mCAAmC,cAAc;AAAA,MACxE,CAAa;AAAA,IACL;AACA,QAAI,mBAAmB,QAAW;AAC9B,YAAM,kBAAkB,GAAG,cAAc;AACzC,iBAAW,OAAO,UAAU;AACxB,cAAM,qBAAqB,GAAG,gBAAgB,IAAI,cAAc,GAAG,CAAC;AACpE,cAAM,SAAS,SAAS,KAAK,gBAAgB,OAAO,QAAQ,cAAc,iBAAiB,oBAAoB,eAAe;AAC9H,YAAI,CAAC,OAAO,OAAO;AACf,iBAAO,KAAK;AAAA,YACR;AAAA,YACA,SAAS;AAAA,YACT;AAAA,YACA,OAAO,kBAAkB,GAAG;AAAA,UACpD,GAAuB,GAAG,OAAO,MAAM;AAAA,QACvB;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,uBAAuB,QAAW;AAClC,YAAM,kBAAkB,GAAG,cAAc;AACzC,iBAAW,OAAO,oBAAoB;AAClC,YAAI,OAAO,UAAU;AACjB,gBAAM,WAAW,mBAAmB,GAAG;AACvC,qBAAW,gBAAgB,UAAU;AACjC,gBAAI,EAAE,gBAAgB,WAAW;AAC7B,qBAAO,KAAK;AAAA,gBACR;AAAA,gBACA,SAAS;AAAA,gBACT;AAAA,gBACA,OAAO,iBAAiB,GAAG,wBAAwB,YAAY;AAAA,cAC/F,CAA6B;AAAA,YACL;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,sBAAsB,QAAW;AACjC,iBAAW,OAAO,mBAAmB;AACjC,cAAM,kBAAkB,GAAG,cAAc;AACzC,YAAI,OAAO,UAAU;AACjB,gBAAM,SAAS,SAAS,UAAU,kBAAkB,GAAG,GAAG,OAAO,QAAQ,cAAc,iBAAiB,kBAAkB,GAAG,eAAe,IAAI,cAAc,GAAG,CAAC,IAAI,SAAS;AAC/K,cAAI,CAAC,OAAO,OAAO;AACf,mBAAO,KAAK;AAAA,cACR;AAAA,cACA,SAAS;AAAA,cACT;AAAA,cACA,OAAO,iBAAiB,GAAG;AAAA,YACvD,GAA2B,GAAG,OAAO,MAAM;AAAA,UACvB;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,kBAAkB,QAAW;AAC7B,YAAM,kBAAkB,GAAG,cAAc;AACzC,iBAAW,OAAO,eAAe;AAC7B,YAAI,OAAO,UAAU;AACjB,gBAAM,gBAAgB,cAAc,GAAG;AACvC,cAAI,MAAM,QAAQ,aAAa,GAAG;AAC9B,uBAAW,gBAAgB,eAAe;AACtC,kBAAI,EAAE,gBAAgB,WAAW;AAC7B,uBAAO,KAAK;AAAA,kBACR;AAAA,kBACA,SAAS;AAAA,kBACT;AAAA,kBACA,OAAO,iBAAiB,GAAG,wBAAwB,YAAY;AAAA,gBACnG,CAAiC;AAAA,cACL;AAAA,YACJ;AAAA,UACJ,OACK;AACD,kBAAM,SAAS,SAAS,UAAU,eAAe,OAAO,QAAQ,cAAc,iBAAiB,kBAAkB,GAAG,eAAe,IAAI,cAAc,GAAG,CAAC,EAAE;AAC3J,gBAAI,CAAC,OAAO,OAAO;AACf,qBAAO,KAAK;AAAA,gBACR;AAAA,gBACA,SAAS;AAAA,gBACT;AAAA,gBACA,OAAO,iBAAiB,GAAG;AAAA,cAC3D,GAA+B,GAAG,OAAO,MAAM;AAAA,YACvB;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,UAAM,gBAAgB,uBAAO,OAAO,IAAI;AACxC,QAAI,OAAO;AACX,QAAI,gBAAgB,QAAW;AAC3B,YAAM,kBAAkB,GAAG,cAAc;AACzC,iBAAW,OAAO,aAAa;AAC3B,YAAI,EAAE,OAAO,WAAW;AACpB;AAAA,QACJ;AACA,cAAM,qBAAqB,GAAG,gBAAgB,IAAI,cAAc,GAAG,CAAC;AACpE,cAAM,SAAS,SAAS,SAAS,GAAG,GAAG,YAAY,GAAG,GAAG,OAAO,QAAQ,cAAc,iBAAiB,oBAAoB,GAAG,eAAe,IAAI,cAAc,GAAG,CAAC,EAAE;AACrK,YAAI,OAAO,OAAO;AACd,oBAAU,GAAG,IAAI,cAAc,GAAG,IAAI;AAAA,QAC1C,OACK;AACD,iBAAO;AACP,iBAAO,KAAK;AAAA,YACR;AAAA,YACA,SAAS;AAAA,YACT;AAAA,YACA,OAAO,aAAa,GAAG;AAAA,UAC/C,GAAuB,GAAG,OAAO,MAAM;AACnB,cAAI;AACA;AAAA,QACR;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,CAAC,QAAQ,uBAAuB,QAAW;AAC3C,YAAM,kBAAkB,GAAG,cAAc;AACzC,iBAAW,WAAW,oBAAoB;AACtC,cAAM,QAAQ,IAAI,OAAO,SAAS,GAAG;AACrC,cAAM,YAAY,mBAAmB,OAAO;AAC5C,mBAAW,OAAO,UAAU;AACxB,cAAI,CAAC,MAAM,KAAK,GAAG,GAAG;AAClB;AAAA,UACJ;AACA,gBAAM,qBAAqB,GAAG,gBAAgB,IAAI,cAAc,GAAG,CAAC;AACpE,gBAAM,SAAS,SAAS,SAAS,GAAG,GAAG,WAAW,OAAO,QAAQ,cAAc,iBAAiB,oBAAoB,GAAG,eAAe,IAAI,cAAc,OAAO,CAAC,EAAE;AAClK,cAAI,OAAO,OAAO;AACd,sBAAU,GAAG,IAAI,cAAc,GAAG,IAAI;AAAA,UAC1C,OACK;AACD,mBAAO;AACP,mBAAO,KAAK;AAAA,cACR;AAAA,cACA,SAAS;AAAA,cACT;AAAA,cACA,OAAO,aAAa,GAAG,sBAAsB,OAAO;AAAA,YAChF,GAA2B,GAAG,OAAO,MAAM;AAAA,UACvB;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,CAAC,QAAQ,0BAA0B,QAAW;AAC9C,YAAM,kBAAkB,GAAG,cAAc;AACzC,iBAAW,OAAO,UAAU;AACxB,YAAI,cAAc,GAAG,GAAG;AACpB;AAAA,QACJ;AACA,cAAM,qBAAqB,GAAG,gBAAgB,IAAI,cAAc,GAAG,CAAC;AACpE,cAAM,SAAS,SAAS,SAAS,GAAG,GAAG,uBAAuB,OAAO,QAAQ,cAAc,iBAAiB,oBAAoB,eAAe;AAC/I,YAAI,OAAO,OAAO;AACd,oBAAU,GAAG,IAAI;AAAA,QACrB,OACK;AACD,iBAAO;AACP,iBAAO,KAAK;AAAA,YACR;AAAA,YACA,SAAS;AAAA,YACT;AAAA,YACA,OAAO,aAAa,GAAG;AAAA,UAC/C,GAAuB,GAAG,OAAO,MAAM;AAAA,QACvB;AAAA,MACJ;AAAA,IACJ,WACS,CAAC,QAAQ,2BAA2B,QAAW;AACpD,YAAM,kBAAkB,GAAG,cAAc;AACzC,iBAAW,OAAO,UAAU;AACxB,YAAI,CAAC,UAAU,GAAG,GAAG;AACjB,gBAAM,qBAAqB,GAAG,gBAAgB,IAAI,cAAc,GAAG,CAAC;AACpE,gBAAM,SAAS,SAAS,SAAS,GAAG,GAAG,wBAAwB,OAAO,QAAQ,cAAc,iBAAiB,oBAAoB,eAAe;AAChJ,cAAI,OAAO,OAAO;AACd,sBAAU,GAAG,IAAI;AAAA,UACrB,OACK;AACD,mBAAO,KAAK;AAAA,cACR;AAAA,cACA,SAAS;AAAA,cACT;AAAA,cACA,OAAO,aAAa,GAAG;AAAA,YACnD,GAA2B,GAAG,OAAO,MAAM;AAAA,UACvB;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ,WACS,iBAAiB,SAAS;AAC/B,QAAI,cAAc,UAAa,SAAS,SAAS,WAAW;AACxD,aAAO,KAAK;AAAA,QACR;AAAA,QACA,SAAS;AAAA,QACT,iBAAiB,GAAG,cAAc;AAAA,QAClC,OAAO,6BAA6B,SAAS,MAAM,MAAM,SAAS;AAAA,MAClF,CAAa;AAAA,IACL;AACA,QAAI,cAAc,UAAa,SAAS,SAAS,WAAW;AACxD,aAAO,KAAK;AAAA,QACR;AAAA,QACA,SAAS;AAAA,QACT,iBAAiB,GAAG,cAAc;AAAA,QAClC,OAAO,4BAA4B,SAAS,MAAM,MAAM,SAAS;AAAA,MACjF,CAAa;AAAA,IACL;AACA,UAAM,SAAS,SAAS;AACxB,QAAI,IAAI;AACR,QAAI,OAAO;AACX,QAAI,iBAAiB,QAAW;AAC5B,YAAM,kBAAkB,GAAG,cAAc;AACzC,YAAM,UAAU,KAAK,IAAI,aAAa,QAAQ,MAAM;AACpD,aAAO,IAAI,SAAS,KAAK;AACrB,cAAM,SAAS,SAAS,SAAS,CAAC,GAAG,aAAa,CAAC,GAAG,OAAO,QAAQ,cAAc,iBAAiB,GAAG,gBAAgB,IAAI,CAAC,IAAI,GAAG,eAAe,IAAI,CAAC,EAAE;AACzJ,kBAAU,CAAC,IAAI;AACf,YAAI,CAAC,OAAO,OAAO;AACf,iBAAO;AACP,iBAAO,KAAK;AAAA,YACR;AAAA,YACA,SAAS;AAAA,YACT;AAAA,YACA,OAAO;AAAA,UAC/B,GAAuB,GAAG,OAAO,MAAM;AACnB,cAAI;AACA;AAAA,QACR;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,WAAW,QAAW;AACtB,YAAM,kBAAkB,GAAG,cAAc;AACzC,UAAI,MAAM,QAAQ,MAAM,GAAG;AACvB,cAAM,UAAU,KAAK,IAAI,OAAO,QAAQ,MAAM;AAC9C,eAAO,IAAI,SAAS,KAAK;AACrB,gBAAM,SAAS,SAAS,SAAS,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,QAAQ,cAAc,iBAAiB,GAAG,gBAAgB,IAAI,CAAC,IAAI,GAAG,eAAe,IAAI,CAAC,EAAE;AACnJ,oBAAU,CAAC,IAAI;AACf,cAAI,CAAC,OAAO,OAAO;AACf,mBAAO;AACP,mBAAO,KAAK;AAAA,cACR;AAAA,cACA,SAAS;AAAA,cACT;AAAA,cACA,OAAO;AAAA,YACnC,GAA2B,GAAG,OAAO,MAAM;AACnB,gBAAI;AACA;AAAA,UACR;AAAA,QACJ;AAAA,MACJ,OACK;AACD,eAAO,IAAI,QAAQ,KAAK;AACpB,gBAAM,SAAS,SAAS,SAAS,CAAC,GAAG,QAAQ,OAAO,QAAQ,cAAc,iBAAiB,GAAG,gBAAgB,IAAI,CAAC,IAAI,eAAe;AACtI,oBAAU,CAAC,IAAI;AACf,cAAI,CAAC,OAAO,OAAO;AACf,mBAAO;AACP,mBAAO,KAAK;AAAA,cACR;AAAA,cACA,SAAS;AAAA,cACT;AAAA,cACA,OAAO;AAAA,YACnC,GAA2B,GAAG,OAAO,MAAM;AACnB,gBAAI;AACA;AAAA,UACR;AAAA,QACJ;AAAA,MACJ;AACA,UAAI,CAAC,QAAQ,qBAAqB,QAAW;AACzC,cAAMA,mBAAkB,GAAG,cAAc;AACzC,eAAO,IAAI,QAAQ,KAAK;AACpB,gBAAM,SAAS,SAAS,SAAS,CAAC,GAAG,kBAAkB,OAAO,QAAQ,cAAc,iBAAiB,GAAG,gBAAgB,IAAI,CAAC,IAAIA,gBAAe;AAChJ,oBAAU,CAAC,IAAI;AACf,cAAI,CAAC,OAAO,OAAO;AACf,mBAAO;AACP,mBAAO,KAAK;AAAA,cACR;AAAA,cACA,SAAS;AAAA,cACT,iBAAAA;AAAA,cACA,OAAO;AAAA,YACnC,GAA2B,GAAG,OAAO,MAAM;AAAA,UACvB;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,cAAc,QAAW;AACzB,UAAI,WAAW,KAAK,iBAAiB,QAAW;AAC5C,eAAO,KAAK;AAAA,UACR;AAAA,UACA,SAAS;AAAA,UACT,iBAAiB,GAAG,cAAc;AAAA,UAClC,OAAO;AAAA,QAC3B,CAAiB;AAAA,MACL,WACS,iBAAiB,UAAa,SAAS,cAAc;AAC1D,eAAO,KAAK;AAAA,UACR;AAAA,UACA,SAAS;AAAA,UACT,iBAAiB,GAAG,cAAc;AAAA,UAClC,OAAO,yBAAyB,MAAM,uBAAuB,YAAY;AAAA,QAC7F,CAAiB;AAAA,MACL,OACK;AACD,cAAM,kBAAkB,GAAG,cAAc;AACzC,cAAM,eAAe,OAAO;AAC5B,YAAI,YAAY;AAChB,iBAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC7B,gBAAM,SAAS,SAAS,SAAS,CAAC,GAAG,WAAW,OAAO,QAAQ,cAAc,iBAAiB,GAAG,gBAAgB,IAAI,CAAC,IAAI,eAAe;AACzI,cAAI,OAAO,OAAO;AACd,sBAAU,CAAC,IAAI;AACf;AAAA,UACJ,OACK;AACD,mBAAO,KAAK,GAAG,OAAO,MAAM;AAAA,UAChC;AAAA,QACJ;AACA,YAAI,cAAc,gBAAgB,IAAI;AAClC,iBAAO,SAAS;AAAA,QACpB;AACA,YAAI,iBAAiB,UACjB,iBAAiB,UACjB,cAAc,GAAG;AACjB,iBAAO,OAAO,cAAc,GAAG;AAAA,YAC3B;AAAA,YACA,SAAS;AAAA,YACT;AAAA,YACA,OAAO;AAAA,UAC/B,CAAqB;AAAA,QACL,WACS,iBAAiB,UAAa,YAAY,cAAc;AAC7D,iBAAO,KAAK;AAAA,YACR;AAAA,YACA,SAAS;AAAA,YACT,iBAAiB,GAAG,cAAc;AAAA,YAClC,OAAO,+BAA+B,YAAY,gCAAgC,SAAS;AAAA,UACnH,CAAqB;AAAA,QACL,WACS,iBAAiB,UAAa,YAAY,cAAc;AAC7D,iBAAO,KAAK;AAAA,YACR;AAAA,YACA,SAAS;AAAA,YACT,iBAAiB,GAAG,cAAc;AAAA,YAClC,OAAO,6BAA6B,YAAY,2BAA2B,SAAS;AAAA,UAC5G,CAAqB;AAAA,QACL;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,CAAC,QAAQ,sBAAsB,QAAW;AAC1C,YAAM,kBAAkB,GAAG,cAAc;AACzC,WAAK,GAAG,IAAI,QAAQ,KAAK;AACrB,YAAI,UAAU,CAAC,GAAG;AACd;AAAA,QACJ;AACA,cAAM,SAAS,SAAS,SAAS,CAAC,GAAG,mBAAmB,OAAO,QAAQ,cAAc,iBAAiB,GAAG,gBAAgB,IAAI,CAAC,IAAI,eAAe;AACjJ,kBAAU,CAAC,IAAI;AACf,YAAI,CAAC,OAAO,OAAO;AACf,iBAAO,KAAK;AAAA,YACR;AAAA,YACA,SAAS;AAAA,YACT;AAAA,YACA,OAAO;AAAA,UAC/B,GAAuB,GAAG,OAAO,MAAM;AAAA,QACvB;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,cAAc;AACd,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC7B,cAAM,IAAI,SAAS,CAAC;AACpB,cAAM,KAAK,OAAO,MAAM,YAAY,MAAM;AAC1C,iBAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC7B,cAAI,MAAM,GAAG;AACT;AAAA,UACJ;AACA,gBAAM,IAAI,SAAS,CAAC;AACpB,gBAAM,KAAK,OAAO,MAAM,YAAY,MAAM;AAC1C,cAAI,MAAM,KAAM,MAAM,MAAM,kBAAkB,GAAG,CAAC,GAAI;AAClD,mBAAO,KAAK;AAAA,cACR;AAAA,cACA,SAAS;AAAA,cACT,iBAAiB,GAAG,cAAc;AAAA,cAClC,OAAO,8BAA8B,CAAC,QAAQ,CAAC;AAAA,YAC3E,CAAyB;AACD,gBAAI,OAAO;AACX,gBAAI,OAAO;AAAA,UACf;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ,WACS,iBAAiB,UAAU;AAChC,QAAI,UAAU,KAAK;AACf,UAAI,aAAa,WACX,sBAAsB,QAAQ,YAAY,YACxC,WAAW,WAAW;AAC1B,eAAO,KAAK;AAAA,UACR;AAAA,UACA,SAAS;AAAA,UACT,iBAAiB,GAAG,cAAc;AAAA,UAClC,OAAO,GAAG,QAAQ,iBAAiB,oBAAoB,iBAAiB,EAAE,IAAI,QAAQ;AAAA,QAC1G,CAAiB;AAAA,MACL;AACA,UAAI,aAAa,WACX,sBAAsB,QAAQ,YAAY,YACxC,WAAW,WAAW;AAC1B,eAAO,KAAK;AAAA,UACR;AAAA,UACA,SAAS;AAAA,UACT,iBAAiB,GAAG,cAAc;AAAA,UAClC,OAAO,GAAG,QAAQ,oBAAoB,oBAAoB,iBAAiB,EAAE,IAAI,QAAQ;AAAA,QAC7G,CAAiB;AAAA,MACL;AAAA,IACJ,OACK;AACD,UAAI,aAAa,UAAa,WAAW,UAAU;AAC/C,eAAO,KAAK;AAAA,UACR;AAAA,UACA,SAAS;AAAA,UACT,iBAAiB,GAAG,cAAc;AAAA,UAClC,OAAO,GAAG,QAAQ,iBAAiB,QAAQ;AAAA,QAC/D,CAAiB;AAAA,MACL;AACA,UAAI,aAAa,UAAa,WAAW,UAAU;AAC/C,eAAO,KAAK;AAAA,UACR;AAAA,UACA,SAAS;AAAA,UACT,iBAAiB,GAAG,cAAc;AAAA,UAClC,OAAO,GAAG,QAAQ,oBAAoB,QAAQ;AAAA,QAClE,CAAiB;AAAA,MACL;AACA,UAAI,sBAAsB,UAAa,YAAY,mBAAmB;AAClE,eAAO,KAAK;AAAA,UACR;AAAA,UACA,SAAS;AAAA,UACT,iBAAiB,GAAG,cAAc;AAAA,UAClC,OAAO,GAAG,QAAQ,iBAAiB,iBAAiB;AAAA,QACxE,CAAiB;AAAA,MACL;AACA,UAAI,sBAAsB,UAAa,YAAY,mBAAmB;AAClE,eAAO,KAAK;AAAA,UACR;AAAA,UACA,SAAS;AAAA,UACT,iBAAiB,GAAG,cAAc;AAAA,UAClC,OAAO,GAAG,QAAQ,gCAAgC,iBAAiB;AAAA,QACvF,CAAiB;AAAA,MACL;AAAA,IACJ;AACA,QAAI,gBAAgB,QAAW;AAC3B,YAAM,YAAY,WAAW;AAC7B,UAAI,KAAK,IAAI,IAAI,SAAS,KAAK,gBAC3B,KAAK,IAAI,cAAc,SAAS,KAAK,cAAc;AACnD,eAAO,KAAK;AAAA,UACR;AAAA,UACA,SAAS;AAAA,UACT,iBAAiB,GAAG,cAAc;AAAA,UAClC,OAAO,GAAG,QAAQ,yBAAyB,WAAW;AAAA,QAC1E,CAAiB;AAAA,MACL;AAAA,IACJ;AAAA,EACJ,WACS,iBAAiB,UAAU;AAChC,UAAM,SAAS,eAAe,UAAa,eAAe,SACpD,IACA,WAAW,QAAQ;AACzB,QAAI,eAAe,UAAa,SAAS,YAAY;AACjD,aAAO,KAAK;AAAA,QACR;AAAA,QACA,SAAS;AAAA,QACT,iBAAiB,GAAG,cAAc;AAAA,QAClC,OAAO,wBAAwB,MAAM,MAAM,UAAU;AAAA,MACrE,CAAa;AAAA,IACL;AACA,QAAI,eAAe,UAAa,SAAS,YAAY;AACjD,aAAO,KAAK;AAAA,QACR;AAAA,QACA,SAAS;AAAA,QACT,iBAAiB,GAAG,cAAc;AAAA,QAClC,OAAO,uBAAuB,MAAM,MAAM,UAAU;AAAA,MACpE,CAAa;AAAA,IACL;AACA,QAAI,aAAa,UAAa,CAAC,IAAI,OAAO,UAAU,GAAG,EAAE,KAAK,QAAQ,GAAG;AACrE,aAAO,KAAK;AAAA,QACR;AAAA,QACA,SAAS;AAAA,QACT,iBAAiB,GAAG,cAAc;AAAA,QAClC,OAAO;AAAA,MACvB,CAAa;AAAA,IACL;AACA,QAAI,YAAY,UACZ,OAAO,OAAO,KACd,CAAC,OAAO,OAAO,EAAE,QAAQ,GAAG;AAC5B,aAAO,KAAK;AAAA,QACR;AAAA,QACA,SAAS;AAAA,QACT,iBAAiB,GAAG,cAAc;AAAA,QAClC,OAAO,iCAAiC,OAAO;AAAA,MAC/D,CAAa;AAAA,IACL;AAAA,EACJ;AACA,SAAO,EAAE,OAAO,OAAO,WAAW,GAAG,OAAM;AAC/C;","x_google_ignoreList":[0]}

package/dist/index.es231.js

@@ -1,41 +1,69 @@
-const objectToString = Object.prototype.toString;
-const isError = (value) => objectToString.call(value) === "[object Error]";
-const errorMessages = /* @__PURE__ */ new Set([
-  "network error",
-  // Chrome
-  "Failed to fetch",
-  // Chrome
-  "NetworkError when attempting to fetch resource.",
-  // Firefox
-  "The Internet connection appears to be offline.",
-  // Safari 16
-  "Network request failed",
-  // `cross-fetch`
-  "fetch failed",
-  // Undici (Node.js)
-  "terminated",
-  // Undici (Node.js)
-  " A network error occurred.",
-  // Bun (WebKit)
-  "Network connection lost"
-  // Cloudflare Workers (fetch)
-]);
-function isNetworkError(error) {
-  const isValid = error && isError(error) && error.name === "TypeError" && typeof error.message === "string";
-  if (!isValid) {
-    return false;
-  }
-  const { message, stack } = error;
-  if (message === "Load failed") {
-    return stack === void 0 || // Sentry adds its own stack trace to the fetch error, so also check for that
-    "__sentry_captured__" in error;
-  }
-  if (message.startsWith("error sending request for url")) {
-    return true;
-  }
-  return errorMessages.has(message);
-}
+const GEN_AI_OPERATION_NAME = "gen_ai.operation.name";
+const GEN_AI_SYSTEM = "gen_ai.system";
+const GEN_AI_REQUEST_MODEL = "gen_ai.request.model";
+const GEN_AI_RESPONSE_MODEL = "gen_ai.response.model";
+const GEN_AI_USAGE_INPUT_TOKENS = "gen_ai.usage.input_tokens";
+const GEN_AI_USAGE_OUTPUT_TOKENS = "gen_ai.usage.output_tokens";
+const GEN_AI_USAGE_TOTAL_TOKENS = "gen_ai.usage.total_tokens";
+const GEN_AI_REQUEST_MAX_TOKENS = "gen_ai.request.max_tokens";
+const GEN_AI_REQUEST_TEMPERATURE = "gen_ai.request.temperature";
+const GEN_AI_REQUEST_TOP_P = "gen_ai.request.top_p";
+const GEN_AI_REQUEST_FREQUENCY_PENALTY = "gen_ai.request.frequency_penalty";
+const GEN_AI_REQUEST_PRESENCE_PENALTY = "gen_ai.request.presence_penalty";
+const GEN_AI_RESPONSE_FINISH_REASONS = "gen_ai.response.finish_reasons";
+const GENAI_PROMPT = "gen_ai.prompt";
+const GENAI_COMPLETION = "gen_ai.completion";
+const GEN_AI_REQUEST_EXTRA_QUERY = "gen_ai.request.extra_query";
+const GEN_AI_REQUEST_EXTRA_BODY = "gen_ai.request.extra_body";
+const GEN_AI_SERIALIZED_NAME = "gen_ai.serialized.name";
+const GEN_AI_SERIALIZED_SIGNATURE = "gen_ai.serialized.signature";
+const GEN_AI_SERIALIZED_DOC = "gen_ai.serialized.doc";
+const GEN_AI_RESPONSE_ID = "gen_ai.response.id";
+const GEN_AI_RESPONSE_SERVICE_TIER = "gen_ai.response.service_tier";
+const GEN_AI_RESPONSE_SYSTEM_FINGERPRINT = "gen_ai.response.system_fingerprint";
+const GEN_AI_USAGE_INPUT_TOKEN_DETAILS = "gen_ai.usage.input_token_details";
+const GEN_AI_USAGE_OUTPUT_TOKEN_DETAILS = "gen_ai.usage.output_token_details";
+const LANGSMITH_SESSION_ID = "langsmith.trace.session_id";
+const LANGSMITH_SESSION_NAME = "langsmith.trace.session_name";
+const LANGSMITH_RUN_TYPE = "langsmith.span.kind";
+const LANGSMITH_NAME = "langsmith.trace.name";
+const LANGSMITH_METADATA = "langsmith.metadata";
+const LANGSMITH_TAGS = "langsmith.span.tags";
+const LANGSMITH_REQUEST_STREAMING = "langsmith.request.streaming";
+const LANGSMITH_REQUEST_HEADERS = "langsmith.request.headers";
 export {
-  isNetworkError as default
+  GENAI_COMPLETION,
+  GENAI_PROMPT,
+  GEN_AI_OPERATION_NAME,
+  GEN_AI_REQUEST_EXTRA_BODY,
+  GEN_AI_REQUEST_EXTRA_QUERY,
+  GEN_AI_REQUEST_FREQUENCY_PENALTY,
+  GEN_AI_REQUEST_MAX_TOKENS,
+  GEN_AI_REQUEST_MODEL,
+  GEN_AI_REQUEST_PRESENCE_PENALTY,
+  GEN_AI_REQUEST_TEMPERATURE,
+  GEN_AI_REQUEST_TOP_P,
+  GEN_AI_RESPONSE_FINISH_REASONS,
+  GEN_AI_RESPONSE_ID,
+  GEN_AI_RESPONSE_MODEL,
+  GEN_AI_RESPONSE_SERVICE_TIER,
+  GEN_AI_RESPONSE_SYSTEM_FINGERPRINT,
+  GEN_AI_SERIALIZED_DOC,
+  GEN_AI_SERIALIZED_NAME,
+  GEN_AI_SERIALIZED_SIGNATURE,
+  GEN_AI_SYSTEM,
+  GEN_AI_USAGE_INPUT_TOKENS,
+  GEN_AI_USAGE_INPUT_TOKEN_DETAILS,
+  GEN_AI_USAGE_OUTPUT_TOKENS,
+  GEN_AI_USAGE_OUTPUT_TOKEN_DETAILS,
+  GEN_AI_USAGE_TOTAL_TOKENS,
+  LANGSMITH_METADATA,
+  LANGSMITH_NAME,
+  LANGSMITH_REQUEST_HEADERS,
+  LANGSMITH_REQUEST_STREAMING,
+  LANGSMITH_RUN_TYPE,
+  LANGSMITH_SESSION_ID,
+  LANGSMITH_SESSION_NAME,
+  LANGSMITH_TAGS
 };
 //# sourceMappingURL=index.es231.js.map

package/dist/index.es231.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es231.js","sources":["../node_modules/.pnpm/langsmith@0.4.6_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/is-network-error/index.js"],"sourcesContent":["/* eslint-disable */\n// @ts-nocheck\n// is-network-error vendored to avoid import issues\n// Source: https://github.com/sindresorhus/is-network-error\nconst objectToString = Object.prototype.toString;\nconst isError = (value) => objectToString.call(value) === \"[object Error]\";\nconst errorMessages = new Set([\n    \"network error\", // Chrome\n    \"Failed to fetch\", // Chrome\n    \"NetworkError when attempting to fetch resource.\", // Firefox\n    \"The Internet connection appears to be offline.\", // Safari 16\n    \"Network request failed\", // `cross-fetch`\n    \"fetch failed\", // Undici (Node.js)\n    \"terminated\", // Undici (Node.js)\n    \" A network error occurred.\", // Bun (WebKit)\n    \"Network connection lost\", // Cloudflare Workers (fetch)\n]);\nexport default function isNetworkError(error) {\n    const isValid = error &&\n        isError(error) &&\n        error.name === \"TypeError\" &&\n        typeof error.message === \"string\";\n    if (!isValid) {\n        return false;\n    }\n    const { message, stack } = error;\n    // Safari 17+ has generic message but no stack for network errors\n    if (message === \"Load failed\") {\n        return (stack === undefined ||\n            // Sentry adds its own stack trace to the fetch error, so also check for that\n            \"__sentry_captured__\" in error);\n    }\n    // Deno network errors start with specific text\n    if (message.startsWith(\"error sending request for url\")) {\n        return true;\n    }\n    // Standard network error messages\n    return errorMessages.has(message);\n}\n"],"names":[],"mappings":"AAIA,MAAM,iBAAiB,OAAO,UAAU;AACxC,MAAM,UAAU,CAAC,UAAU,eAAe,KAAK,KAAK,MAAM;AAC1D,MAAM,gBAAgB,oBAAI,IAAI;AAAA,EAC1B;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AACJ,CAAC;AACc,SAAS,eAAe,OAAO;AAC1C,QAAM,UAAU,SACZ,QAAQ,KAAK,KACb,MAAM,SAAS,eACf,OAAO,MAAM,YAAY;AAC7B,MAAI,CAAC,SAAS;AACV,WAAO;AAAA,EACX;AACA,QAAM,EAAE,SAAS,MAAK,IAAK;AAE3B,MAAI,YAAY,eAAe;AAC3B,WAAQ,UAAU;AAAA,IAEd,yBAAyB;AAAA,EACjC;AAEA,MAAI,QAAQ,WAAW,+BAA+B,GAAG;AACrD,WAAO;AAAA,EACX;AAEA,SAAO,cAAc,IAAI,OAAO;AACpC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es231.js","sources":["../node_modules/.pnpm/langsmith@0.4.6_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/experimental/otel/constants.js"],"sourcesContent":["// OpenTelemetry GenAI semantic convention attribute names\nexport const GEN_AI_OPERATION_NAME = \"gen_ai.operation.name\";\nexport const GEN_AI_SYSTEM = \"gen_ai.system\";\nexport const GEN_AI_REQUEST_MODEL = \"gen_ai.request.model\";\nexport const GEN_AI_RESPONSE_MODEL = \"gen_ai.response.model\";\nexport const GEN_AI_USAGE_INPUT_TOKENS = \"gen_ai.usage.input_tokens\";\nexport const GEN_AI_USAGE_OUTPUT_TOKENS = \"gen_ai.usage.output_tokens\";\nexport const GEN_AI_USAGE_TOTAL_TOKENS = \"gen_ai.usage.total_tokens\";\nexport const GEN_AI_REQUEST_MAX_TOKENS = \"gen_ai.request.max_tokens\";\nexport const GEN_AI_REQUEST_TEMPERATURE = \"gen_ai.request.temperature\";\nexport const GEN_AI_REQUEST_TOP_P = \"gen_ai.request.top_p\";\nexport const GEN_AI_REQUEST_FREQUENCY_PENALTY = \"gen_ai.request.frequency_penalty\";\nexport const GEN_AI_REQUEST_PRESENCE_PENALTY = \"gen_ai.request.presence_penalty\";\nexport const GEN_AI_RESPONSE_FINISH_REASONS = \"gen_ai.response.finish_reasons\";\nexport const GENAI_PROMPT = \"gen_ai.prompt\";\nexport const GENAI_COMPLETION = \"gen_ai.completion\";\nexport const GEN_AI_REQUEST_EXTRA_QUERY = \"gen_ai.request.extra_query\";\nexport const GEN_AI_REQUEST_EXTRA_BODY = \"gen_ai.request.extra_body\";\nexport const GEN_AI_SERIALIZED_NAME = \"gen_ai.serialized.name\";\nexport const GEN_AI_SERIALIZED_SIGNATURE = \"gen_ai.serialized.signature\";\nexport const GEN_AI_SERIALIZED_DOC = \"gen_ai.serialized.doc\";\nexport const GEN_AI_RESPONSE_ID = \"gen_ai.response.id\";\nexport const GEN_AI_RESPONSE_SERVICE_TIER = \"gen_ai.response.service_tier\";\nexport const GEN_AI_RESPONSE_SYSTEM_FINGERPRINT = \"gen_ai.response.system_fingerprint\";\nexport const GEN_AI_USAGE_INPUT_TOKEN_DETAILS = \"gen_ai.usage.input_token_details\";\nexport const GEN_AI_USAGE_OUTPUT_TOKEN_DETAILS = \"gen_ai.usage.output_token_details\";\n// LangSmith custom attributes\nexport const LANGSMITH_SESSION_ID = \"langsmith.trace.session_id\";\nexport const LANGSMITH_SESSION_NAME = \"langsmith.trace.session_name\";\nexport const LANGSMITH_RUN_TYPE = \"langsmith.span.kind\";\nexport const LANGSMITH_NAME = \"langsmith.trace.name\";\nexport const LANGSMITH_METADATA = \"langsmith.metadata\";\nexport const LANGSMITH_TAGS = \"langsmith.span.tags\";\nexport const LANGSMITH_RUNTIME = \"langsmith.span.runtime\";\nexport const LANGSMITH_REQUEST_STREAMING = \"langsmith.request.streaming\";\nexport const LANGSMITH_REQUEST_HEADERS = \"langsmith.request.headers\";\nexport const LANGSMITH_RUN_ID = \"langsmith.span.id\";\nexport const LANGSMITH_TRACE_ID = \"langsmith.trace.id\";\nexport const LANGSMITH_DOTTED_ORDER = \"langsmith.span.dotted_order\";\nexport const LANGSMITH_PARENT_RUN_ID = \"langsmith.span.parent_id\";\nexport const LANGSMITH_USAGE_METADATA = \"langsmith.usage_metadata\";\nexport const LANGSMITH_REFERENCE_EXAMPLE_ID = \"langsmith.reference_example_id\";\nexport const LANGSMITH_TRACEABLE = \"langsmith.traceable\";\nexport const LANGSMITH_IS_ROOT = \"langsmith.is_root\";\nexport const LANGSMITH_TRACEABLE_PARENT_OTEL_SPAN_ID = \"langsmith.traceable_parent_otel_span_id\";\n// GenAI event names\nexport const GEN_AI_SYSTEM_MESSAGE = \"gen_ai.system.message\";\nexport const GEN_AI_USER_MESSAGE = \"gen_ai.user.message\";\nexport const GEN_AI_ASSISTANT_MESSAGE = \"gen_ai.assistant.message\";\nexport const GEN_AI_CHOICE = \"gen_ai.choice\";\nexport const AI_SDK_LLM_OPERATIONS = [\n    \"ai.generateText.doGenerate\",\n    \"ai.streamText.doStream\",\n    \"ai.generateObject.doGenerate\",\n    \"ai.streamObject.doStream\",\n];\nexport const AI_SDK_TOOL_OPERATIONS = [\"ai.toolCall\"];\n"],"names":[],"mappings":"AACY,MAAC,wBAAwB;AACzB,MAAC,gBAAgB;AACjB,MAAC,uBAAuB;AACxB,MAAC,wBAAwB;AACzB,MAAC,4BAA4B;AAC7B,MAAC,6BAA6B;AAC9B,MAAC,4BAA4B;AAC7B,MAAC,4BAA4B;AAC7B,MAAC,6BAA6B;AAC9B,MAAC,uBAAuB;AACxB,MAAC,mCAAmC;AACpC,MAAC,kCAAkC;AACnC,MAAC,iCAAiC;AAClC,MAAC,eAAe;AAChB,MAAC,mBAAmB;AACpB,MAAC,6BAA6B;AAC9B,MAAC,4BAA4B;AAC7B,MAAC,yBAAyB;AAC1B,MAAC,8BAA8B;AAC/B,MAAC,wBAAwB;AACzB,MAAC,qBAAqB;AACtB,MAAC,+BAA+B;AAChC,MAAC,qCAAqC;AACtC,MAAC,mCAAmC;AACpC,MAAC,oCAAoC;AAErC,MAAC,uBAAuB;AACxB,MAAC,yBAAyB;AAC1B,MAAC,qBAAqB;AACtB,MAAC,iBAAiB;AAClB,MAAC,qBAAqB;AACtB,MAAC,iBAAiB;AAElB,MAAC,8BAA8B;AAC/B,MAAC,4BAA4B;","x_google_ignoreList":[0]}

package/dist/index.es232.js

@@ -1,140 +1,177 @@
-import { __require as requireRe } from "./index.es233.js";
-import { __require as requireConstants } from "./index.es234.js";
-import { __require as requireSemver$1 } from "./index.es235.js";
-import { __require as requireIdentifiers } from "./index.es236.js";
-import { __require as requireParse } from "./index.es237.js";
-import { __require as requireValid } from "./index.es238.js";
-import { __require as requireClean } from "./index.es239.js";
-import { __require as requireInc } from "./index.es240.js";
-import { __require as requireDiff } from "./index.es241.js";
-import { __require as requireMajor } from "./index.es242.js";
-import { __require as requireMinor } from "./index.es243.js";
-import { __require as requirePatch } from "./index.es244.js";
-import { __require as requirePrerelease } from "./index.es245.js";
-import { __require as requireCompare } from "./index.es246.js";
-import { __require as requireRcompare } from "./index.es247.js";
-import { __require as requireCompareLoose } from "./index.es248.js";
-import { __require as requireCompareBuild } from "./index.es249.js";
-import { __require as requireSort } from "./index.es250.js";
-import { __require as requireRsort } from "./index.es251.js";
-import { __require as requireGt } from "./index.es252.js";
-import { __require as requireLt } from "./index.es253.js";
-import { __require as requireEq } from "./index.es254.js";
-import { __require as requireNeq } from "./index.es255.js";
-import { __require as requireGte } from "./index.es256.js";
-import { __require as requireLte } from "./index.es257.js";
-import { __require as requireCmp } from "./index.es258.js";
-import { __require as requireCoerce } from "./index.es259.js";
-import { __require as requireComparator } from "./index.es260.js";
-import { __require as requireRange } from "./index.es261.js";
-import { __require as requireSatisfies } from "./index.es262.js";
-import { __require as requireToComparators } from "./index.es263.js";
-import { __require as requireMaxSatisfying } from "./index.es264.js";
-import { __require as requireMinSatisfying } from "./index.es265.js";
-import { __require as requireMinVersion } from "./index.es266.js";
-import { __require as requireValid$1 } from "./index.es267.js";
-import { __require as requireOutside } from "./index.es268.js";
-import { __require as requireGtr } from "./index.es269.js";
-import { __require as requireLtr } from "./index.es270.js";
-import { __require as requireIntersects } from "./index.es271.js";
-import { __require as requireSimplify } from "./index.es272.js";
-import { __require as requireSubset } from "./index.es273.js";
-var semver;
-var hasRequiredSemver;
-function requireSemver() {
-  if (hasRequiredSemver) return semver;
-  hasRequiredSemver = 1;
-  const internalRe = requireRe();
-  const constants = requireConstants();
-  const SemVer = requireSemver$1();
-  const identifiers = requireIdentifiers();
-  const parse = requireParse();
-  const valid = requireValid();
-  const clean = requireClean();
-  const inc = requireInc();
-  const diff = requireDiff();
-  const major = requireMajor();
-  const minor = requireMinor();
-  const patch = requirePatch();
-  const prerelease = requirePrerelease();
-  const compare = requireCompare();
-  const rcompare = requireRcompare();
-  const compareLoose = requireCompareLoose();
-  const compareBuild = requireCompareBuild();
-  const sort = requireSort();
-  const rsort = requireRsort();
-  const gt = requireGt();
-  const lt = requireLt();
-  const eq = requireEq();
-  const neq = requireNeq();
-  const gte = requireGte();
-  const lte = requireLte();
-  const cmp = requireCmp();
-  const coerce = requireCoerce();
-  const Comparator = requireComparator();
-  const Range = requireRange();
-  const satisfies = requireSatisfies();
-  const toComparators = requireToComparators();
-  const maxSatisfying = requireMaxSatisfying();
-  const minSatisfying = requireMinSatisfying();
-  const minVersion = requireMinVersion();
-  const validRange = requireValid$1();
-  const outside = requireOutside();
-  const gtr = requireGtr();
-  const ltr = requireLtr();
-  const intersects = requireIntersects();
-  const simplifyRange = requireSimplify();
-  const subset = requireSubset();
-  semver = {
-    parse,
-    valid,
-    clean,
-    inc,
-    diff,
-    major,
-    minor,
-    patch,
-    prerelease,
-    compare,
-    rcompare,
-    compareLoose,
-    compareBuild,
-    sort,
-    rsort,
-    gt,
-    lt,
-    eq,
-    neq,
-    gte,
-    lte,
-    cmp,
-    coerce,
-    Comparator,
-    Range,
-    satisfies,
-    toComparators,
-    maxSatisfying,
-    minSatisfying,
-    minVersion,
-    validRange,
-    outside,
-    gtr,
-    ltr,
-    intersects,
-    simplifyRange,
-    subset,
-    SemVer,
-    re: internalRe.re,
-    src: internalRe.src,
-    tokens: internalRe.t,
-    SEMVER_SPEC_VERSION: constants.SEMVER_SPEC_VERSION,
-    RELEASE_TYPES: constants.RELEASE_TYPES,
-    compareIdentifiers: identifiers.compareIdentifiers,
-    rcompareIdentifiers: identifiers.rcompareIdentifiers
+import isNetworkError from "./index.es275.js";
+function validateRetries(retries) {
+  if (typeof retries === "number") {
+    if (retries < 0) {
+      throw new TypeError("Expected `retries` to be a non-negative number.");
+    }
+    if (Number.isNaN(retries)) {
+      throw new TypeError("Expected `retries` to be a valid number or Infinity, got NaN.");
+    }
+  } else if (retries !== void 0) {
+    throw new TypeError("Expected `retries` to be a number or Infinity.");
+  }
+}
+function validateNumberOption(name, value, { min = 0, allowInfinity = false } = {}) {
+  if (value === void 0) {
+    return;
+  }
+  if (typeof value !== "number" || Number.isNaN(value)) {
+    throw new TypeError(`Expected \`${name}\` to be a number${allowInfinity ? " or Infinity" : ""}.`);
+  }
+  if (!allowInfinity && !Number.isFinite(value)) {
+    throw new TypeError(`Expected \`${name}\` to be a finite number.`);
+  }
+  if (value < min) {
+    throw new TypeError(`Expected \`${name}\` to be ≥ ${min}.`);
+  }
+}
+class AbortError extends Error {
+  constructor(message) {
+    super();
+    if (message instanceof Error) {
+      this.originalError = message;
+      ({ message } = message);
+    } else {
+      this.originalError = new Error(message);
+      this.originalError.stack = this.stack;
+    }
+    this.name = "AbortError";
+    this.message = message;
+  }
+}
+function calculateDelay(retriesConsumed, options) {
+  const attempt = Math.max(1, retriesConsumed + 1);
+  const random = options.randomize ? Math.random() + 1 : 1;
+  let timeout = Math.round(random * options.minTimeout * options.factor ** (attempt - 1));
+  timeout = Math.min(timeout, options.maxTimeout);
+  return timeout;
+}
+function calculateRemainingTime(start, max) {
+  if (!Number.isFinite(max)) {
+    return max;
+  }
+  return max - (performance.now() - start);
+}
+async function onAttemptFailure({ error, attemptNumber, retriesConsumed, startTime, options }) {
+  const normalizedError = error instanceof Error ? error : new TypeError(`Non-error was thrown: "${error}". You should only throw errors.`);
+  if (normalizedError instanceof AbortError) {
+    throw normalizedError.originalError;
+  }
+  const retriesLeft = Number.isFinite(options.retries) ? Math.max(0, options.retries - retriesConsumed) : options.retries;
+  const maxRetryTime = options.maxRetryTime ?? Number.POSITIVE_INFINITY;
+  const context = Object.freeze({
+    error: normalizedError,
+    attemptNumber,
+    retriesLeft,
+    retriesConsumed
+  });
+  await options.onFailedAttempt(context);
+  if (calculateRemainingTime(startTime, maxRetryTime) <= 0) {
+    throw normalizedError;
+  }
+  const consumeRetry = await options.shouldConsumeRetry(context);
+  const remainingTime = calculateRemainingTime(startTime, maxRetryTime);
+  if (remainingTime <= 0 || retriesLeft <= 0) {
+    throw normalizedError;
+  }
+  if (normalizedError instanceof TypeError && !isNetworkError(normalizedError)) {
+    if (consumeRetry) {
+      throw normalizedError;
+    }
+    options.signal?.throwIfAborted();
+    return false;
+  }
+  if (!await options.shouldRetry(context)) {
+    throw normalizedError;
+  }
+  if (!consumeRetry) {
+    options.signal?.throwIfAborted();
+    return false;
+  }
+  const delayTime = calculateDelay(retriesConsumed, options);
+  const finalDelay = Math.min(delayTime, remainingTime);
+  if (finalDelay > 0) {
+    await new Promise((resolve, reject) => {
+      const onAbort = () => {
+        clearTimeout(timeoutToken);
+        options.signal?.removeEventListener("abort", onAbort);
+        reject(options.signal.reason);
+      };
+      const timeoutToken = setTimeout(() => {
+        options.signal?.removeEventListener("abort", onAbort);
+        resolve();
+      }, finalDelay);
+      if (options.unref) {
+        timeoutToken.unref?.();
+      }
+      options.signal?.addEventListener("abort", onAbort, { once: true });
+    });
+  }
+  options.signal?.throwIfAborted();
+  return true;
+}
+async function pRetry(input, options = {}) {
+  options = { ...options };
+  validateRetries(options.retries);
+  if (Object.hasOwn(options, "forever")) {
+    throw new Error("The `forever` option is no longer supported. For many use-cases, you can set `retries: Infinity` instead.");
+  }
+  options.retries ??= 10;
+  options.factor ??= 2;
+  options.minTimeout ??= 1e3;
+  options.maxTimeout ??= Number.POSITIVE_INFINITY;
+  options.maxRetryTime ??= Number.POSITIVE_INFINITY;
+  options.randomize ??= false;
+  options.onFailedAttempt ??= () => {
   };
-  return semver;
+  options.shouldRetry ??= () => true;
+  options.shouldConsumeRetry ??= () => true;
+  validateNumberOption("factor", options.factor, {
+    min: 0,
+    allowInfinity: false
+  });
+  validateNumberOption("minTimeout", options.minTimeout, {
+    min: 0,
+    allowInfinity: false
+  });
+  validateNumberOption("maxTimeout", options.maxTimeout, {
+    min: 0,
+    allowInfinity: true
+  });
+  validateNumberOption("maxRetryTime", options.maxRetryTime, {
+    min: 0,
+    allowInfinity: true
+  });
+  if (!(options.factor > 0)) {
+    options.factor = 1;
+  }
+  options.signal?.throwIfAborted();
+  let attemptNumber = 0;
+  let retriesConsumed = 0;
+  const startTime = performance.now();
+  while (Number.isFinite(options.retries) ? retriesConsumed <= options.retries : true) {
+    attemptNumber++;
+    try {
+      options.signal?.throwIfAborted();
+      const result = await input(attemptNumber);
+      options.signal?.throwIfAborted();
+      return result;
+    } catch (error) {
+      if (await onAttemptFailure({
+        error,
+        attemptNumber,
+        retriesConsumed,
+        startTime,
+        options
+      })) {
+        retriesConsumed++;
+      }
+    }
+  }
+  throw new Error("Retry attempts exhausted without throwing an error.");
 }
 export {
-  requireSemver as __require
+  AbortError,
+  pRetry as default
 };
 //# sourceMappingURL=index.es232.js.map