igniteui-webcomponents 7.2.4 → 7.3.0-beta.0

package/components/validation-container/validation-container.js.map

@@ -1 +1 @@
-{"version":3,"file":"validation-container.js","sourceRoot":"","sources":["../../../src/components/validation-container/validation-container.ts"],"names":[],"mappings":";;;;;;AAAA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAuB,MAAM,KAAK,CAAC;AAC/E,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAE,MAAM,8BAA8B,CAAC;AACzD,OAAO,EAAE,oBAAoB,EAAE,MAAM,qCAAqC,CAAC;AAC3E,OAAO,EAAE,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AAC/D,OAAO,EAAE,iBAAiB,EAAE,MAAM,mCAAmC,CAAC;AACtE,OAAO,EAEL,oBAAoB,EACpB,kBAAkB,GACnB,MAAM,iCAAiC,CAAC;AACzC,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAChD,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACzD,OAAO,gBAAgB,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,GAAG,IAAI,WAAW,EAAE,MAAM,2BAA2B,CAAC;AAC/D,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,yCAAyC,CAAC;AAC3E,OAAO,EAAE,MAAM,EAAE,MAAM,gCAAgC,CAAC;AAcxD,MAAM,kBAAkB,GAAG,MAAM,CAAC;AAClC,MAAM,YAAY,GAAyB,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AAM7D,MAAM,aAAa,GAA4C;IAC7D,UAAU;IACV,aAAa;IACb,iBAAiB;IACjB,eAAe;IACf,gBAAgB;IAChB,cAAc;IACd,SAAS;IACT,UAAU;IACV,cAAc;IACd,cAAc;CACf,CAAC;AAMF,QAAQ,CAAC,CAAC,qBAAqB,CAAC,QAAuB;IACrD,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACpB,MAAM,SAAS,CAAC;IAClB,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;QAChC,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAClB,MAAM,WAAW,CAAC,GAAG,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;AACH,CAAC;AAUD,MAAM,CAAC,OAAO,OAAO,+BAAgC,SAAQ,UAAU;aAC9C,YAAO,GAAG,eAAe,AAAlB,CAAmB;aAC1B,WAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,AAAnB,CAAoB;IAG1C,MAAM,CAAC,QAAQ;QACpB,iBAAiB,CAAC,+BAA+B,EAAE,gBAAgB,CAAC,CAAC;IACvE,CAAC;IAQM,MAAM,CAAC,MAAM,CAClB,IAAoB,EACpB,SAAoC;QAClC,EAAE,EAAE,aAAa;QACjB,aAAa,EAAE,IAAI;KACpB;QAED,MAAM,UAAU,GAAG,MAAM,CAAC,aAAa;YACrC,CAAC,CAAC,IAAI,CAAA,qDAAqD;YAC3D,CAAC,CAAC,OAAO,CAAC;QAIZ,MAAM,eAAe,GAAG,IAAI,CAAC,UAAU;YACrC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBAChD,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAA,cAAc,IAAI,SAAS,IAAI,UAAU,CAAC;iBAC5D,OAAO,EAAE;YACd,CAAC,CAAC,OAAO,CAAC;QAEZ,OAAO,IAAI,CAAA;;aAEF,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;eAClB,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC;eACtB,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC;mBAClB,IAAI,CAAC,OAAO;kBACb,IAAI;;;UAGZ,UAAU,GAAG,eAAe;;KAEjC,CAAC;IACJ,CAAC;IAwBD,IAAW,MAAM,CAAC,KAAqB;QACrC,IAAI,IAAI,CAAC,OAAO,KAAK,KAAK,EAAE,CAAC;YAC3B,OAAO;QACT,CAAC;QAED,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC;QAErC,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;QACrB,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,oBAAoB,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;QACtE,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,kBAAkB,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;IACtE,CAAC;IAED,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED;QACE,KAAK,EAAE,CAAC;QAxCO,iBAAY,GAAG,iBAAiB,EAAE,CAAC;QAU7C,YAAO,GAAG,KAAK,CAAC;QA+BrB,oBAAoB,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IAC1C,CAAC;IAEkB,gBAAgB;QACjC,MAAM,IAAI,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;QACtC,IAAI,CAAC,gBAAgB,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QAC1C,OAAO,IAAI,CAAC;IACd,CAAC;IAGM,WAAW,CAAC,KAAY;QAC7B,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;YACnB,KAAK,oBAAoB;gBACvB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;gBACpB,MAAM;YACR,KAAK,kBAAkB;gBACrB,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;gBACrB,MAAM;QACV,CAAC;QAED,IAAI,CAAC,aAAa,EAAE,CAAC;IACvB,CAAC;IAQO,sBAAsB;QAI5B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QAErC,IAAI,QAAQ,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACjC,OAAO,EAAE,iBAAiB,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;QAClD,CAAC;QAED,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CACtB,IAAI,CAAC,UAAU,CAAC,gBAAgB,CAAkB,kBAAkB,CAAC,CACtE,CAAC;QACF,IAAI,iBAAiB,GAAG,IAAI,CAAC;QAE7B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,OAAO,CAAC,IAAI,CAAC,gBAAgB,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC;gBACjD,SAAS;YACX,CAAC;YAED,iBAAiB,GAAG,KAAK,CAAC;YAC1B,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;gBAC7C,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,OAAO,EAAE,iBAAiB,EAAE,UAAU,EAAE,CAAC;IAC3C,CAAC;IAES,wBAAwB,CAChC,QAAgB,EAChB,cAAmC;QAEnC,MAAM,gBAAgB,GAAG,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACtD,MAAM,KAAK,GAAG,EAAE,oBAAoB,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,gBAAgB,EAAE,CAAC;QACvE,MAAM,IAAI,GAAG,gBAAgB;YAC3B,CAAC,CAAC,IAAI,CAAA;;;;;;SAMH;YACH,CAAC,CAAC,OAAO,CAAC;QAEZ,OAAO,IAAI,CAAA,aAAa,OAAO,CAAC,KAAK,CAAC;QAClC,IAAI,cAAc,QAAQ;WACvB,CAAC;IACV,CAAC;IAES,aAAa,CACrB,uBAAgC;QAEhC,OAAO,IAAI,CAAC,OAAO,IAAI,uBAAuB;YAC5C,CAAC,CAAC,OAAO;YACT,CAAC,CAAC,IAAI,CAAA,kCAAkC,CAAC;IAC7C,CAAC;IAEkB,YAAY;QAM7B,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,cAAc,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IAEkB,MAAM;QACvB,MAAM,EAAE,iBAAiB,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC;QACxE,MAAM,QAAQ,GACZ,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,OAAO;YAC7B,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;iBACvD,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,wBAAwB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;iBAC9D,OAAO,EAAE;YACd,CAAC,CAAC,OAAO,CAAC;QAEd,OAAO,IAAI,CAAA;;eAEA,OAAO,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,KAAK,EAAE,iBAAiB,EAAE,CAAC;;;UAG/D,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;;KAExD,CAAC;IACJ,CAAC;;AAlJM;IADN,QAAQ,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;gEACL;AAYvB;IADC,QAAQ,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;6DAY9B","sourcesContent":["import { html, isServer, LitElement, nothing, type TemplateResult } from 'lit';\nimport { property } from 'lit/decorators.js';\nimport { ifDefined } from 'lit/directives/if-defined.js';\nimport { addThemingController } from '../../theming/theming-controller.js';\nimport { createAbortHandle } from '../common/abort-handler.js';\nimport { registerComponent } from '../common/definitions/register.js';\nimport {\n  type IgcFormControl,\n  InternalInvalidEvent,\n  InternalResetEvent,\n} from '../common/mixins/forms/types.js';\nimport { partMap } from '../common/part-map.js';\nimport { isEmpty, toKebabCase } from '../common/util.js';\nimport IgcIconComponent from '../icon/icon.js';\nimport { all as inputThemes } from '../input/themes/themes.js';\nimport { styles as shared } from './themes/shared/validator.common.css.js';\nimport { styles } from './themes/validator.base.css.js';\n\n/** Configuration for the validation container. */\ninterface ValidationContainerConfig {\n  /** The id attribute for the validation container. */\n  id?: string;\n  /** Project the validation container to the given slot inside the host shadow DOM. */\n  slot?: string;\n  /** Additional part(s) that should be bound to the validation container. */\n  part?: string;\n  /** Whether the validation container should expose a helper-text slot. */\n  hasHelperText?: boolean;\n}\n\nconst ALL_SLOTS_SELECTOR = 'slot';\nconst QUERY_CONFIG: AssignedNodesOptions = { flatten: true };\n\n/**\n * Validity flags rendered as validation message slots, in a stable order so the\n * generated slots are deterministic across browsers.\n */\nconst VALIDITY_KEYS: ReadonlyArray<keyof ValidityStateFlags> = [\n  'badInput',\n  'customError',\n  'patternMismatch',\n  'rangeOverflow',\n  'rangeUnderflow',\n  'stepMismatch',\n  'tooLong',\n  'tooShort',\n  'typeMismatch',\n  'valueMissing',\n];\n\n/**\n * Yields the active validation slot names for the given validity state, in a\n * stable order (`invalid` first, then each failing constraint).\n */\nfunction* activeValidationSlots(validity: ValidityState): Generator<string> {\n  if (!validity.valid) {\n    yield 'invalid';\n  }\n\n  for (const key of VALIDITY_KEYS) {\n    if (validity[key]) {\n      yield toKebabCase(key);\n    }\n  }\n}\n\n/* blazorSuppress */\n/**\n * @element igc-validator\n *\n * @csspart helper-text - The base wrapper\n * @csspart validation-message - The validation error message container\n * @csspart validation-icon - The validation error icon\n */\nexport default class IgcValidationContainerComponent extends LitElement {\n  public static readonly tagName = 'igc-validator';\n  public static override styles = [styles, shared];\n\n  /* blazorSuppress */\n  public static register(): void {\n    registerComponent(IgcValidationContainerComponent, IgcIconComponent);\n  }\n\n  /**\n   * Creates a validation container for the given form control.\n   *\n   * The container will render validation messages based on the control's validity state\n   * and projected content, and reflect the control's `invalid` state.\n   */\n  public static create(\n    host: IgcFormControl,\n    config: ValidationContainerConfig = {\n      id: 'helper-text',\n      hasHelperText: true,\n    }\n  ): TemplateResult {\n    const helperText = config.hasHelperText\n      ? html`<slot name=\"helper-text\" slot=\"helper-text\"></slot>`\n      : nothing;\n\n    // `hasUpdated` is false during SSR and the host's hydrating render, so both\n    // emit `nothing`. The real validation slots are projected post-hydration.\n    const validationSlots = host.hasUpdated\n      ? Iterator.from(activeValidationSlots(host.validity))\n          .map((name) => html`<slot name=${name} slot=${name}></slot>`)\n          .toArray()\n      : nothing;\n\n    return html`\n      <igc-validator\n        id=${ifDefined(config.id)}\n        part=${ifDefined(config.part)}\n        slot=${ifDefined(config.slot)}\n        ?invalid=${host.invalid}\n        .target=${host}\n        exportparts=\"helper-text, validation-message, validation-icon\"\n      >\n        ${helperText}${validationSlots}\n      </igc-validator>\n    `;\n  }\n\n  private readonly _abortHandle = createAbortHandle();\n  private _target!: IgcFormControl;\n\n  /**\n   * Whether the container is in an invalid state.\n   *\n   * This is reflected from the target's `invalid` property,\n   * and is used to determine whether to render the validation message slots.\n   */\n  @property({ type: Boolean })\n  public invalid = false;\n\n  /**\n   * The form control whose validity state is being rendered. The target's `invalid`\n   * property is reflected to the container, and its validity state is used to\n   * determine which validation message slots to render.\n   *\n   * @remarks The target must be set for the container to function, and should be\n   * set before the first update cycle for SSR compatibility. When using the\n   * `create` method, the target is set automatically.\n   */\n  @property({ attribute: false })\n  public set target(value: IgcFormControl) {\n    if (this._target === value) {\n      return;\n    }\n\n    this._abortHandle.abort();\n    const { signal } = this._abortHandle;\n\n    this._target = value;\n    this._target.addEventListener(InternalInvalidEvent, this, { signal });\n    this._target.addEventListener(InternalResetEvent, this, { signal });\n  }\n\n  public get target(): IgcFormControl {\n    return this._target;\n  }\n\n  constructor() {\n    super();\n    addThemingController(this, inputThemes);\n  }\n\n  protected override createRenderRoot(): HTMLElement | DocumentFragment {\n    const root = super.createRenderRoot();\n    root.addEventListener('slotchange', this);\n    return root;\n  }\n\n  /** @internal */\n  public handleEvent(event: Event): void {\n    switch (event.type) {\n      case InternalInvalidEvent:\n        this.invalid = true;\n        break;\n      case InternalResetEvent:\n        this.invalid = false;\n        break;\n    }\n\n    this.requestUpdate();\n  }\n\n  /**\n   * Collects the projection state of the container slots in a single DOM pass.\n   *\n   * @returns Whether every slot is empty and the set of non-empty validation\n   * slot names (i.e. excluding `helper-text`).\n   */\n  private _collectProjectedSlots(): {\n    isProjectionEmpty: boolean;\n    validation: Set<string>;\n  } {\n    const validation = new Set<string>();\n\n    if (isServer || !this.hasUpdated) {\n      return { isProjectionEmpty: false, validation };\n    }\n\n    const slots = Array.from(\n      this.renderRoot.querySelectorAll<HTMLSlotElement>(ALL_SLOTS_SELECTOR)\n    );\n    let isProjectionEmpty = true;\n\n    for (const slot of slots) {\n      if (isEmpty(slot.assignedElements(QUERY_CONFIG))) {\n        continue;\n      }\n\n      isProjectionEmpty = false;\n      if (slot.name && slot.name !== 'helper-text') {\n        validation.add(slot.name);\n      }\n    }\n\n    return { isProjectionEmpty, validation };\n  }\n\n  protected _renderValidationMessage(\n    slotName: string,\n    projectedSlots: ReadonlySet<string>\n  ): TemplateResult {\n    const hasProjectedIcon = projectedSlots.has(slotName);\n    const parts = { 'validation-message': true, empty: !hasProjectedIcon };\n    const icon = hasProjectedIcon\n      ? html`\n          <igc-icon\n            aria-hidden=\"true\"\n            name=\"error\"\n            part=\"validation-icon\"\n          ></igc-icon>\n        `\n      : nothing;\n\n    return html`<div part=${partMap(parts)}>\n      ${icon}<slot name=${slotName}></slot>\n    </div>`;\n  }\n\n  protected _renderHelper(\n    hasValidationProjection: boolean\n  ): TemplateResult | typeof nothing {\n    return this.invalid && hasValidationProjection\n      ? nothing\n      : html`<slot name=\"helper-text\"></slot>`;\n  }\n\n  protected override firstUpdated(): void {\n    // The first render is intentionally neutral to match the SSR output during\n    // hydration. Only reconcile when the field hydrated in an invalid state, and\n    // do it off the current update cycle so we don't schedule an update as a side\n    // effect of the one in progress, projecting the real validation messages now\n    // that `hasUpdated` is true.\n    if (this.invalid) {\n      queueMicrotask(() => this.requestUpdate());\n    }\n  }\n\n  protected override render(): TemplateResult {\n    const { isProjectionEmpty, validation } = this._collectProjectedSlots();\n    const messages =\n      this.hasUpdated && this.invalid\n        ? Iterator.from(activeValidationSlots(this.target.validity))\n            .map((name) => this._renderValidationMessage(name, validation))\n            .toArray()\n        : nothing;\n\n    return html`\n      <div\n        part=${partMap({ 'helper-text': true, empty: isProjectionEmpty })}\n        aria-live=\"polite\"\n      >\n        ${messages}${this._renderHelper(!isEmpty(validation))}\n      </div>\n    `;\n  }\n}\n\ndeclare global {\n  interface HTMLElementTagNameMap {\n    'igc-validator': IgcValidationContainerComponent;\n  }\n}\n"]}
+{"version":3,"file":"validation-container.js","sourceRoot":"","sources":["../../../src/components/validation-container/validation-container.ts"],"names":[],"mappings":";;;;;;AAAA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAuB,MAAM,KAAK,CAAC;AAC/E,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAE,MAAM,8BAA8B,CAAC;AACzD,OAAO,EAAE,iBAAiB,EAAE,MAAM,6BAA6B,CAAC;AAChE,OAAO,EAAE,iBAAiB,EAAE,MAAM,oCAAoC,CAAC;AACvE,OAAO,EAEL,oBAAoB,EACpB,kBAAkB,GACnB,MAAM,kCAAkC,CAAC;AAC1C,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,OAAO,EAAE,MAAM,4BAA4B,CAAC;AACrD,OAAO,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAC1D,OAAO,EAAE,oBAAoB,EAAE,MAAM,gCAAgC,CAAC;AACtE,OAAO,gBAAgB,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,GAAG,IAAI,WAAW,EAAE,MAAM,2BAA2B,CAAC;AAC/D,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,yCAAyC,CAAC;AAC3E,OAAO,EAAE,MAAM,EAAE,MAAM,gCAAgC,CAAC;AAcxD,MAAM,kBAAkB,GAAG,MAAM,CAAC;AAClC,MAAM,YAAY,GAAyB,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AAM7D,MAAM,aAAa,GAA4C;IAC7D,UAAU;IACV,aAAa;IACb,iBAAiB;IACjB,eAAe;IACf,gBAAgB;IAChB,cAAc;IACd,SAAS;IACT,UAAU;IACV,cAAc;IACd,cAAc;CACf,CAAC;AAMF,QAAQ,CAAC,CAAC,qBAAqB,CAAC,QAAuB;IACrD,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACpB,MAAM,SAAS,CAAC;IAClB,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;QAChC,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAClB,MAAM,WAAW,CAAC,GAAG,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;AACH,CAAC;AAUD,MAAM,CAAC,OAAO,OAAO,+BAAgC,SAAQ,UAAU;aAC9C,YAAO,GAAG,eAAe,AAAlB,CAAmB;aAC1B,WAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,AAAnB,CAAoB;IAG1C,MAAM,CAAC,QAAQ;QACpB,iBAAiB,CAAC,+BAA+B,EAAE,gBAAgB,CAAC,CAAC;IACvE,CAAC;IAQM,MAAM,CAAC,MAAM,CAClB,IAAoB,EACpB,SAAoC;QAClC,EAAE,EAAE,aAAa;QACjB,aAAa,EAAE,IAAI;KACpB;QAED,MAAM,UAAU,GAAG,MAAM,CAAC,aAAa;YACrC,CAAC,CAAC,IAAI,CAAA,qDAAqD;YAC3D,CAAC,CAAC,OAAO,CAAC;QAIZ,MAAM,eAAe,GAAG,IAAI,CAAC,UAAU;YACrC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBAChD,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAA,cAAc,IAAI,SAAS,IAAI,UAAU,CAAC;iBAC5D,OAAO,EAAE;YACd,CAAC,CAAC,OAAO,CAAC;QAEZ,OAAO,IAAI,CAAA;;aAEF,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;eAClB,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC;eACtB,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC;mBAClB,IAAI,CAAC,OAAO;kBACb,IAAI;;;UAGZ,UAAU,GAAG,eAAe;;KAEjC,CAAC;IACJ,CAAC;IAwBD,IAAW,MAAM,CAAC,KAAqB;QACrC,IAAI,IAAI,CAAC,OAAO,KAAK,KAAK,EAAE,CAAC;YAC3B,OAAO;QACT,CAAC;QAED,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC;QAErC,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;QACrB,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,oBAAoB,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;QACtE,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,kBAAkB,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;IACtE,CAAC;IAED,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED;QACE,KAAK,EAAE,CAAC;QAxCO,iBAAY,GAAG,iBAAiB,EAAE,CAAC;QAU7C,YAAO,GAAG,KAAK,CAAC;QA+BrB,oBAAoB,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IAC1C,CAAC;IAEkB,gBAAgB;QACjC,MAAM,IAAI,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;QACtC,IAAI,CAAC,gBAAgB,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QAC1C,OAAO,IAAI,CAAC;IACd,CAAC;IAGM,WAAW,CAAC,KAAY;QAC7B,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;YACnB,KAAK,oBAAoB;gBACvB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;gBACpB,MAAM;YACR,KAAK,kBAAkB;gBACrB,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;gBACrB,MAAM;QACV,CAAC;QAED,IAAI,CAAC,aAAa,EAAE,CAAC;IACvB,CAAC;IAQO,sBAAsB;QAI5B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QAErC,IAAI,QAAQ,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACjC,OAAO,EAAE,iBAAiB,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;QAClD,CAAC;QAED,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CACtB,IAAI,CAAC,UAAU,CAAC,gBAAgB,CAAkB,kBAAkB,CAAC,CACtE,CAAC;QACF,IAAI,iBAAiB,GAAG,IAAI,CAAC;QAE7B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,OAAO,CAAC,IAAI,CAAC,gBAAgB,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC;gBACjD,SAAS;YACX,CAAC;YAED,iBAAiB,GAAG,KAAK,CAAC;YAC1B,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;gBAC7C,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,OAAO,EAAE,iBAAiB,EAAE,UAAU,EAAE,CAAC;IAC3C,CAAC;IAES,wBAAwB,CAChC,QAAgB,EAChB,cAAmC;QAEnC,MAAM,gBAAgB,GAAG,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACtD,MAAM,KAAK,GAAG,EAAE,oBAAoB,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,gBAAgB,EAAE,CAAC;QACvE,MAAM,IAAI,GAAG,gBAAgB;YAC3B,CAAC,CAAC,IAAI,CAAA;;;;;;SAMH;YACH,CAAC,CAAC,OAAO,CAAC;QAEZ,OAAO,IAAI,CAAA,aAAa,OAAO,CAAC,KAAK,CAAC;QAClC,IAAI,cAAc,QAAQ;WACvB,CAAC;IACV,CAAC;IAES,aAAa,CACrB,uBAAgC;QAEhC,OAAO,IAAI,CAAC,OAAO,IAAI,uBAAuB;YAC5C,CAAC,CAAC,OAAO;YACT,CAAC,CAAC,IAAI,CAAA,kCAAkC,CAAC;IAC7C,CAAC;IAEkB,YAAY;QAM7B,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,cAAc,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IAEkB,MAAM;QACvB,MAAM,EAAE,iBAAiB,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC;QACxE,MAAM,QAAQ,GACZ,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,OAAO;YAC7B,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;iBACvD,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,wBAAwB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;iBAC9D,OAAO,EAAE;YACd,CAAC,CAAC,OAAO,CAAC;QAEd,OAAO,IAAI,CAAA;;eAEA,OAAO,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,KAAK,EAAE,iBAAiB,EAAE,CAAC;;;UAG/D,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;;KAExD,CAAC;IACJ,CAAC;;AAlJM;IADN,QAAQ,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;gEACL;AAYvB;IADC,QAAQ,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;6DAY9B","sourcesContent":["import { html, isServer, LitElement, nothing, type TemplateResult } from 'lit';\nimport { property } from 'lit/decorators.js';\nimport { ifDefined } from 'lit/directives/if-defined.js';\nimport { createAbortHandle } from '#internals/abort-handler.js';\nimport { registerComponent } from '#internals/definitions/register.js';\nimport {\n  type IgcFormControl,\n  InternalInvalidEvent,\n  InternalResetEvent,\n} from '#internals/mixins/forms/types.js';\nimport { partMap } from '#internals/part-map.js';\nimport { isEmpty } from '#internals/utils/arrays.js';\nimport { toKebabCase } from '#internals/utils/strings.js';\nimport { addThemingController } from '#theming/theming-controller.js';\nimport IgcIconComponent from '../icon/icon.js';\nimport { all as inputThemes } from '../input/themes/themes.js';\nimport { styles as shared } from './themes/shared/validator.common.css.js';\nimport { styles } from './themes/validator.base.css.js';\n\n/** Configuration for the validation container. */\ninterface ValidationContainerConfig {\n  /** The id attribute for the validation container. */\n  id?: string;\n  /** Project the validation container to the given slot inside the host shadow DOM. */\n  slot?: string;\n  /** Additional part(s) that should be bound to the validation container. */\n  part?: string;\n  /** Whether the validation container should expose a helper-text slot. */\n  hasHelperText?: boolean;\n}\n\nconst ALL_SLOTS_SELECTOR = 'slot';\nconst QUERY_CONFIG: AssignedNodesOptions = { flatten: true };\n\n/**\n * Validity flags rendered as validation message slots, in a stable order so the\n * generated slots are deterministic across browsers.\n */\nconst VALIDITY_KEYS: ReadonlyArray<keyof ValidityStateFlags> = [\n  'badInput',\n  'customError',\n  'patternMismatch',\n  'rangeOverflow',\n  'rangeUnderflow',\n  'stepMismatch',\n  'tooLong',\n  'tooShort',\n  'typeMismatch',\n  'valueMissing',\n];\n\n/**\n * Yields the active validation slot names for the given validity state, in a\n * stable order (`invalid` first, then each failing constraint).\n */\nfunction* activeValidationSlots(validity: ValidityState): Generator<string> {\n  if (!validity.valid) {\n    yield 'invalid';\n  }\n\n  for (const key of VALIDITY_KEYS) {\n    if (validity[key]) {\n      yield toKebabCase(key);\n    }\n  }\n}\n\n/* blazorSuppress */\n/**\n * @element igc-validator\n *\n * @csspart helper-text - The base wrapper\n * @csspart validation-message - The validation error message container\n * @csspart validation-icon - The validation error icon\n */\nexport default class IgcValidationContainerComponent extends LitElement {\n  public static readonly tagName = 'igc-validator';\n  public static override styles = [styles, shared];\n\n  /* blazorSuppress */\n  public static register(): void {\n    registerComponent(IgcValidationContainerComponent, IgcIconComponent);\n  }\n\n  /**\n   * Creates a validation container for the given form control.\n   *\n   * The container will render validation messages based on the control's validity state\n   * and projected content, and reflect the control's `invalid` state.\n   */\n  public static create(\n    host: IgcFormControl,\n    config: ValidationContainerConfig = {\n      id: 'helper-text',\n      hasHelperText: true,\n    }\n  ): TemplateResult {\n    const helperText = config.hasHelperText\n      ? html`<slot name=\"helper-text\" slot=\"helper-text\"></slot>`\n      : nothing;\n\n    // `hasUpdated` is false during SSR and the host's hydrating render, so both\n    // emit `nothing`. The real validation slots are projected post-hydration.\n    const validationSlots = host.hasUpdated\n      ? Iterator.from(activeValidationSlots(host.validity))\n          .map((name) => html`<slot name=${name} slot=${name}></slot>`)\n          .toArray()\n      : nothing;\n\n    return html`\n      <igc-validator\n        id=${ifDefined(config.id)}\n        part=${ifDefined(config.part)}\n        slot=${ifDefined(config.slot)}\n        ?invalid=${host.invalid}\n        .target=${host}\n        exportparts=\"helper-text, validation-message, validation-icon\"\n      >\n        ${helperText}${validationSlots}\n      </igc-validator>\n    `;\n  }\n\n  private readonly _abortHandle = createAbortHandle();\n  private _target!: IgcFormControl;\n\n  /**\n   * Whether the container is in an invalid state.\n   *\n   * This is reflected from the target's `invalid` property,\n   * and is used to determine whether to render the validation message slots.\n   */\n  @property({ type: Boolean })\n  public invalid = false;\n\n  /**\n   * The form control whose validity state is being rendered. The target's `invalid`\n   * property is reflected to the container, and its validity state is used to\n   * determine which validation message slots to render.\n   *\n   * @remarks The target must be set for the container to function, and should be\n   * set before the first update cycle for SSR compatibility. When using the\n   * `create` method, the target is set automatically.\n   */\n  @property({ attribute: false })\n  public set target(value: IgcFormControl) {\n    if (this._target === value) {\n      return;\n    }\n\n    this._abortHandle.abort();\n    const { signal } = this._abortHandle;\n\n    this._target = value;\n    this._target.addEventListener(InternalInvalidEvent, this, { signal });\n    this._target.addEventListener(InternalResetEvent, this, { signal });\n  }\n\n  public get target(): IgcFormControl {\n    return this._target;\n  }\n\n  constructor() {\n    super();\n    addThemingController(this, inputThemes);\n  }\n\n  protected override createRenderRoot(): HTMLElement | DocumentFragment {\n    const root = super.createRenderRoot();\n    root.addEventListener('slotchange', this);\n    return root;\n  }\n\n  /** @internal */\n  public handleEvent(event: Event): void {\n    switch (event.type) {\n      case InternalInvalidEvent:\n        this.invalid = true;\n        break;\n      case InternalResetEvent:\n        this.invalid = false;\n        break;\n    }\n\n    this.requestUpdate();\n  }\n\n  /**\n   * Collects the projection state of the container slots in a single DOM pass.\n   *\n   * @returns Whether every slot is empty and the set of non-empty validation\n   * slot names (i.e. excluding `helper-text`).\n   */\n  private _collectProjectedSlots(): {\n    isProjectionEmpty: boolean;\n    validation: Set<string>;\n  } {\n    const validation = new Set<string>();\n\n    if (isServer || !this.hasUpdated) {\n      return { isProjectionEmpty: false, validation };\n    }\n\n    const slots = Array.from(\n      this.renderRoot.querySelectorAll<HTMLSlotElement>(ALL_SLOTS_SELECTOR)\n    );\n    let isProjectionEmpty = true;\n\n    for (const slot of slots) {\n      if (isEmpty(slot.assignedElements(QUERY_CONFIG))) {\n        continue;\n      }\n\n      isProjectionEmpty = false;\n      if (slot.name && slot.name !== 'helper-text') {\n        validation.add(slot.name);\n      }\n    }\n\n    return { isProjectionEmpty, validation };\n  }\n\n  protected _renderValidationMessage(\n    slotName: string,\n    projectedSlots: ReadonlySet<string>\n  ): TemplateResult {\n    const hasProjectedIcon = projectedSlots.has(slotName);\n    const parts = { 'validation-message': true, empty: !hasProjectedIcon };\n    const icon = hasProjectedIcon\n      ? html`\n          <igc-icon\n            aria-hidden=\"true\"\n            name=\"error\"\n            part=\"validation-icon\"\n          ></igc-icon>\n        `\n      : nothing;\n\n    return html`<div part=${partMap(parts)}>\n      ${icon}<slot name=${slotName}></slot>\n    </div>`;\n  }\n\n  protected _renderHelper(\n    hasValidationProjection: boolean\n  ): TemplateResult | typeof nothing {\n    return this.invalid && hasValidationProjection\n      ? nothing\n      : html`<slot name=\"helper-text\"></slot>`;\n  }\n\n  protected override firstUpdated(): void {\n    // The first render is intentionally neutral to match the SSR output during\n    // hydration. Only reconcile when the field hydrated in an invalid state, and\n    // do it off the current update cycle so we don't schedule an update as a side\n    // effect of the one in progress, projecting the real validation messages now\n    // that `hasUpdated` is true.\n    if (this.invalid) {\n      queueMicrotask(() => this.requestUpdate());\n    }\n  }\n\n  protected override render(): TemplateResult {\n    const { isProjectionEmpty, validation } = this._collectProjectedSlots();\n    const messages =\n      this.hasUpdated && this.invalid\n        ? Iterator.from(activeValidationSlots(this.target.validity))\n            .map((name) => this._renderValidationMessage(name, validation))\n            .toArray()\n        : nothing;\n\n    return html`\n      <div\n        part=${partMap({ 'helper-text': true, empty: isProjectionEmpty })}\n        aria-live=\"polite\"\n      >\n        ${messages}${this._renderHelper(!isEmpty(validation))}\n      </div>\n    `;\n  }\n}\n\ndeclare global {\n  interface HTMLElementTagNameMap {\n    'igc-validator': IgcValidationContainerComponent;\n  }\n}\n"]}

package/components/virtualization/engine.d.ts

@@ -0,0 +1,92 @@
+import type { ScrollAlignment, VisibleRange } from './types.js';
+/**
+ * Pure scroll-math engine for a single axis of virtual scrolling. All size
+ * state is held in a Fenwick tree.
+ *
+ * ### Virtual vs DOM coordinates
+ *
+ * Browsers cap how far an element can be scrolled. When the summed item size
+ * exceeds that cap, the engine compresses the *virtual* space (`0…totalSize`)
+ * into the *DOM* space the browser can represent (`0…domSize`) by the factor
+ * `_virtualRatio`. Every offset crossing that boundary is scaled: incoming
+ * scroll positions are multiplied by the ratio, outgoing offsets divided by
+ * it. Item sizes render at their real px size and so are always virtual.
+ */
+export declare class VirtualScrollEngine {
+    private _maxBrowserSize;
+    /**
+     * The ratio `totalSize / maxBrowserSize` when `totalSize` exceeds the
+     * maximum DOM coordinate the browser supports; `1` otherwise.
+     * Used to map virtual scroll positions to DOM scroll positions.
+     */
+    private _virtualRatio;
+    /** Binary Indexed Tree for O(log N) size queries and updates. */
+    private _tree;
+    /**
+     * Called whenever item sizes or the item count change, e.g.
+     * `() => this.requestUpdate()`.
+     */
+    onSizeChange: (() => void) | null;
+    /** Total virtual size of all items in px. */
+    get totalSize(): number;
+    /** Total size in DOM space, clamped to the maximum browser size. */
+    get domSize(): number;
+    /** Probes the document for the maximum browser size and rescales. */
+    initMaxBrowserSize(doc: Document): void;
+    /**
+     * Grows or shrinks the internal sizes array to `length`. Measured sizes
+     * below `retainCount` are preserved; the rest is refilled with
+     * `estimatedSize` and marked unmeasured. Callers that only append can leave
+     * `retainCount` at its default; callers whose data changed identity at some
+     * index must pass it, so the stale measurements behind it are discarded.
+     */
+    resize(length: number, estimatedSize: number, retainCount?: number): void;
+    /** Records the measured DOM size for a single item. */
+    measureItem(index: number, size: number): void;
+    /**
+     * Applies a new estimated size to every item not yet measured in the DOM.
+     * Use this when `estimatedItemSize` changes but the item count doesn't, so
+     * `resize` would be a no-op.
+     */
+    updateEstimatedSize(estimatedSize: number): void;
+    /**
+     * Returns the DOM scroll offset in px that puts the item at `index` at the
+     * leading edge of the viewport.
+     */
+    getScrollOffsetForIndex(index: number): number;
+    /**
+     * The largest DOM scroll offset the host can reach for the given viewport
+     * size. Requesting anything beyond it silently does nothing, so offsets
+     * handed out to a caller that waits for the scroll to settle are clamped
+     * to it.
+     */
+    private _getMaxScrollOffset;
+    /**
+     * Returns the DOM scroll offset that positions the item at `index`
+     * according to `align` within a `viewportSize` px viewport, clamped to the
+     * reachable scroll range.
+     *
+     * The slack is computed in virtual space against the item's real size and
+     * converted to DOM space once, at the end: a DOM pixel is worth
+     * `_virtualRatio` virtual pixels, so mixing the two would scale the slack.
+     */
+    getAlignedScrollOffset(index: number, viewportSize: number, align: ScrollAlignment): number;
+    /**
+     * Whether the item at `index` needs no scrolling to be seen at the given DOM
+     * scroll position: either it sits entirely inside the viewport, or it is
+     * larger than the viewport and already covers it end to end. The latter
+     * mirrors native `scrollIntoView({ block: 'nearest' })`.
+     */
+    isIndexInView(index: number, scrollPosition: number, viewportSize: number): boolean;
+    /**
+     * Returns the visible + over-scanned item range for the given scroll state.
+     */
+    getVisibleRange(scrollPosition: number, viewportSize: number, overScan: number): VisibleRange;
+    /**
+     * Sum of the actual sizes of the items in [startIndex, endIndex]. Clamps the
+     * content translate offset so rendered items never overflow past `domSize`
+     * under coordinate compression.
+     */
+    getPhysicalRangeSize(startIndex: number, endIndex: number): number;
+    private _updateVirtualRatio;
+}

package/components/virtualization/engine.js

@@ -0,0 +1,217 @@
+import { clamp } from '#internals/utils/math.js';
+const _maxBrowserSizeCache = new WeakMap();
+function getMaxBrowserSizeProbePx(doc) {
+    const cached = _maxBrowserSizeCache.get(doc);
+    if (cached !== undefined) {
+        return cached;
+    }
+    const container = doc.body ?? doc.documentElement;
+    if (!container) {
+        return Number.POSITIVE_INFINITY;
+    }
+    const div = doc.createElement('div');
+    div.style.position = 'absolute';
+    div.style.top = `${Number.MAX_SAFE_INTEGER}px`;
+    div.style.width = '0';
+    div.style.height = '0';
+    div.style.visibility = 'hidden';
+    container.appendChild(div);
+    const scrollOffset = doc.documentElement?.scrollTop ?? 0;
+    const size = Math.abs(div.getBoundingClientRect().top) + scrollOffset;
+    container.removeChild(div);
+    _maxBrowserSizeCache.set(doc, size);
+    return size;
+}
+function clampIndex(index, length) {
+    return clamp(index, 0, length - 1);
+}
+function buildTree(tree, sizes) {
+    const length = sizes.length;
+    let total = 0;
+    for (let i = 1; i <= length; i++) {
+        tree[i] += sizes[i - 1];
+        total += sizes[i - 1];
+        const j = i + (i & -i);
+        if (j <= length) {
+            tree[j] += tree[i];
+        }
+    }
+    return total;
+}
+class SizeTree {
+    constructor(length, sizes, tree, total, measured) {
+        this.length = length;
+        this._sizes = sizes;
+        this._tree = tree;
+        this._total = total;
+        this._measured = measured;
+        this._topBit = length > 0 ? 1 << (31 - Math.clz32(length)) : 0;
+    }
+    static filled(length, fillSize) {
+        return SizeTree._build(new Float64Array(length).fill(fillSize), new Uint8Array(length));
+    }
+    static _build(sizes, measured) {
+        const tree = new Float64Array(sizes.length + 1);
+        const total = buildTree(tree, sizes);
+        return new SizeTree(sizes.length, sizes, tree, total, measured);
+    }
+    get totalSize() {
+        return this._total;
+    }
+    prefixSum(i) {
+        let sum = 0;
+        for (let j = i; j > 0; j -= j & -j) {
+            sum += this._tree[j];
+        }
+        return sum;
+    }
+    update(index, newSize) {
+        if (index < 0 || index >= this.length)
+            return false;
+        const old = this._sizes[index];
+        this._measured[index] = 1;
+        if (old === newSize)
+            return false;
+        const delta = newSize - old;
+        this._sizes[index] = newSize;
+        this._total += delta;
+        for (let i = index + 1; i <= this.length; i += i & -i) {
+            this._tree[i] += delta;
+        }
+        return true;
+    }
+    cloneResized(newLength, fillSize, retainCount = newLength) {
+        const sizes = new Float64Array(newLength).fill(fillSize);
+        const measured = new Uint8Array(newLength);
+        const retained = Math.max(0, Math.min(this.length, newLength, retainCount));
+        sizes.set(this._sizes.subarray(0, retained));
+        measured.set(this._measured.subarray(0, retained));
+        return SizeTree._build(sizes, measured);
+    }
+    applyEstimate(estimatedSize) {
+        let changed = false;
+        for (let i = 0; i < this.length; i++) {
+            if (!this._measured[i] && this._sizes[i] !== estimatedSize) {
+                this._sizes[i] = estimatedSize;
+                changed = true;
+            }
+        }
+        if (!changed)
+            return false;
+        this._tree.fill(0);
+        this._total = buildTree(this._tree, this._sizes);
+        return true;
+    }
+    findIndexAtOffset(offset) {
+        if (offset <= 0 || this.length === 0)
+            return 0;
+        let idx = 0;
+        let remaining = offset;
+        for (let bit = this._topBit; bit > 0; bit >>= 1) {
+            const next = idx + bit;
+            if (next <= this.length && this._tree[next] <= remaining) {
+                idx = next;
+                remaining -= this._tree[idx];
+            }
+        }
+        return Math.min(this.length - 1, idx);
+    }
+}
+export class VirtualScrollEngine {
+    constructor() {
+        this._maxBrowserSize = Number.POSITIVE_INFINITY;
+        this._virtualRatio = 1;
+        this._tree = null;
+        this.onSizeChange = null;
+    }
+    get totalSize() {
+        return this._tree?.totalSize ?? 0;
+    }
+    get domSize() {
+        return this._virtualRatio !== 1 ? this._maxBrowserSize : this.totalSize;
+    }
+    initMaxBrowserSize(doc) {
+        this._maxBrowserSize = getMaxBrowserSizeProbePx(doc);
+        this._updateVirtualRatio();
+    }
+    resize(length, estimatedSize, retainCount = length) {
+        if (this._tree?.length === length && retainCount >= length)
+            return;
+        this._tree = this._tree
+            ? this._tree.cloneResized(length, estimatedSize, retainCount)
+            : SizeTree.filled(length, estimatedSize);
+        this._updateVirtualRatio();
+        this.onSizeChange?.();
+    }
+    measureItem(index, size) {
+        if (!this._tree?.update(index, size))
+            return;
+        this._updateVirtualRatio();
+        this.onSizeChange?.();
+    }
+    updateEstimatedSize(estimatedSize) {
+        if (!this._tree?.applyEstimate(estimatedSize))
+            return;
+        this._updateVirtualRatio();
+        this.onSizeChange?.();
+    }
+    getScrollOffsetForIndex(index) {
+        if (!this._tree || index <= 0)
+            return 0;
+        const clamped = Math.min(index, this._tree.length);
+        return this._tree.prefixSum(clamped) / this._virtualRatio;
+    }
+    _getMaxScrollOffset(viewportSize) {
+        return Math.max(0, this.domSize - viewportSize);
+    }
+    getAlignedScrollOffset(index, viewportSize, align) {
+        if (!this._tree || this._tree.length === 0)
+            return 0;
+        const clamped = clampIndex(index, this._tree.length);
+        const itemStart = this._tree.prefixSum(clamped);
+        let offset = itemStart;
+        if (align !== 'start') {
+            const itemEnd = this._tree.prefixSum(clamped + 1);
+            const slack = viewportSize - Math.max(0, itemEnd - itemStart);
+            offset -= align === 'center' ? slack / 2 : slack;
+        }
+        return clamp(offset / this._virtualRatio, 0, this._getMaxScrollOffset(viewportSize));
+    }
+    isIndexInView(index, scrollPosition, viewportSize) {
+        if (!this._tree || this._tree.length === 0)
+            return false;
+        const clamped = clampIndex(index, this._tree.length);
+        const itemStart = this._tree.prefixSum(clamped);
+        const itemEnd = this._tree.prefixSum(clamped + 1);
+        const viewStart = Math.max(0, scrollPosition) * this._virtualRatio;
+        const viewEnd = viewStart + viewportSize;
+        const contained = itemStart >= viewStart && itemEnd <= viewEnd;
+        const spanning = itemStart <= viewStart && itemEnd >= viewEnd;
+        return contained || spanning;
+    }
+    getVisibleRange(scrollPosition, viewportSize, overScan) {
+        if (!this._tree || this._tree.length === 0 || viewportSize <= 0) {
+            return { startIndex: 0, endIndex: -1 };
+        }
+        const startOffset = Math.max(0, scrollPosition) * this._virtualRatio;
+        const first = this._tree.findIndexAtOffset(startOffset);
+        const last = this._tree.findIndexAtOffset(startOffset + viewportSize);
+        return {
+            startIndex: Math.max(0, first - overScan),
+            endIndex: Math.min(this._tree.length - 1, last + overScan),
+        };
+    }
+    getPhysicalRangeSize(startIndex, endIndex) {
+        if (!this._tree)
+            return 0;
+        const start = Math.max(0, startIndex);
+        const end = Math.min(Math.max(endIndex + 1, start), this._tree.length);
+        return this._tree.prefixSum(end) - this._tree.prefixSum(start);
+    }
+    _updateVirtualRatio() {
+        const totalSize = this._tree?.totalSize ?? 0;
+        this._virtualRatio =
+            totalSize <= this._maxBrowserSize ? 1 : totalSize / this._maxBrowserSize;
+    }
+}
+//# sourceMappingURL=engine.js.map

package/components/virtualization/engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine.js","sourceRoot":"","sources":["../../../src/components/virtualization/engine.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,0BAA0B,CAAC;AAOjD,MAAM,oBAAoB,GAAG,IAAI,OAAO,EAAoB,CAAC;AAK7D,SAAS,wBAAwB,CAAC,GAAa;IAC7C,MAAM,MAAM,GAAG,oBAAoB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,MAAM,SAAS,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,eAAe,CAAC;IAClD,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,OAAO,MAAM,CAAC,iBAAiB,CAAC;IAClC,CAAC;IAED,MAAM,GAAG,GAAG,GAAG,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;IACrC,GAAG,CAAC,KAAK,CAAC,QAAQ,GAAG,UAAU,CAAC;IAChC,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,gBAAgB,IAAI,CAAC;IAC/C,GAAG,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC;IACtB,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC;IACvB,GAAG,CAAC,KAAK,CAAC,UAAU,GAAG,QAAQ,CAAC;IAChC,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,YAAY,GAAG,GAAG,CAAC,eAAe,EAAE,SAAS,IAAI,CAAC,CAAC;IACzD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,qBAAqB,EAAE,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC;IACtE,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAE3B,oBAAoB,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACpC,OAAO,IAAI,CAAC;AACd,CAAC;AAMD,SAAS,UAAU,CAAC,KAAa,EAAE,MAAc;IAC/C,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;AACrC,CAAC;AAOD,SAAS,SAAS,CAAC,IAAkB,EAAE,KAAmB;IACxD,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxB,KAAK,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,CAAC,IAAI,MAAM,EAAE,CAAC;YAChB,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAOD,MAAM,QAAQ;IAwBZ,YACE,MAAc,EACd,KAAmB,EACnB,IAAkB,EAClB,KAAa,EACb,QAAoB;QAEpB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,OAAO,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,CAAC;IAMM,MAAM,CAAC,MAAM,CAAC,MAAc,EAAE,QAAgB;QACnD,OAAO,QAAQ,CAAC,MAAM,CACpB,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,EACvC,IAAI,UAAU,CAAC,MAAM,CAAC,CACvB,CAAC;IACJ,CAAC;IAKO,MAAM,CAAC,MAAM,CAAC,KAAmB,EAAE,QAAoB;QAC7D,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACrC,OAAO,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;IAClE,CAAC;IAGD,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAMM,SAAS,CAAC,CAAS;QACxB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YACnC,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAOM,MAAM,CAAC,KAAa,EAAE,OAAe;QAC1C,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAEpD,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC/B,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,GAAG,KAAK,OAAO;YAAE,OAAO,KAAK,CAAC;QAElC,MAAM,KAAK,GAAG,OAAO,GAAG,GAAG,CAAC;QAC5B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;QAC7B,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YACtD,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;QACzB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IASM,YAAY,CACjB,SAAiB,EACjB,QAAgB,EAChB,WAAW,GAAG,SAAS;QAEvB,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzD,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;QAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC;QAC5E,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC7C,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;QACnD,OAAO,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC1C,CAAC;IASM,aAAa,CAAC,aAAqB;QACxC,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,aAAa,EAAE,CAAC;gBAC3D,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC;gBAC/B,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAE3B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACjD,OAAO,IAAI,CAAC;IACd,CAAC;IAMM,iBAAiB,CAAC,MAAc;QACrC,IAAI,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAE/C,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,SAAS,GAAG,MAAM,CAAC;QAEvB,KAAK,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;YAChD,MAAM,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC;YACvB,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC;gBACzD,GAAG,GAAG,IAAI,CAAC;gBACX,SAAS,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;IACxC,CAAC;CACF;AAeD,MAAM,OAAO,mBAAmB;IAAhC;QACU,oBAAe,GAAG,MAAM,CAAC,iBAAiB,CAAC;QAO3C,kBAAa,GAAG,CAAC,CAAC;QAGlB,UAAK,GAAoB,IAAI,CAAC;QAM/B,iBAAY,GAAwB,IAAI,CAAC;IAqLlD,CAAC;IAlLC,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,KAAK,EAAE,SAAS,IAAI,CAAC,CAAC;IACpC,CAAC;IAGD,IAAW,OAAO;QAChB,OAAO,IAAI,CAAC,aAAa,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;IAC1E,CAAC;IAGM,kBAAkB,CAAC,GAAa;QACrC,IAAI,CAAC,eAAe,GAAG,wBAAwB,CAAC,GAAG,CAAC,CAAC;QACrD,IAAI,CAAC,mBAAmB,EAAE,CAAC;IAC7B,CAAC;IASM,MAAM,CACX,MAAc,EACd,aAAqB,EACrB,WAAW,GAAG,MAAM;QAEpB,IAAI,IAAI,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,IAAI,WAAW,IAAI,MAAM;YAAE,OAAO;QAEnE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK;YACrB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,EAAE,aAAa,EAAE,WAAW,CAAC;YAC7D,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;QAC3C,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC3B,IAAI,CAAC,YAAY,EAAE,EAAE,CAAC;IACxB,CAAC;IAGM,WAAW,CAAC,KAAa,EAAE,IAAY;QAC5C,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC;YAAE,OAAO;QAE7C,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC3B,IAAI,CAAC,YAAY,EAAE,EAAE,CAAC;IACxB,CAAC;IAOM,mBAAmB,CAAC,aAAqB;QAC9C,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,CAAC,aAAa,CAAC;YAAE,OAAO;QAEtD,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC3B,IAAI,CAAC,YAAY,EAAE,EAAE,CAAC;IACxB,CAAC;IAMM,uBAAuB,CAAC,KAAa;QAC1C,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAExC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC;IAC5D,CAAC;IAQO,mBAAmB,CAAC,YAAoB;QAC9C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,GAAG,YAAY,CAAC,CAAC;IAClD,CAAC;IAWM,sBAAsB,CAC3B,KAAa,EACb,YAAoB,EACpB,KAAsB;QAEtB,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAErD,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACrD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAChD,IAAI,MAAM,GAAG,SAAS,CAAC;QAEvB,IAAI,KAAK,KAAK,OAAO,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;YAClD,MAAM,KAAK,GAAG,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC,CAAC;YAC9D,MAAM,IAAI,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACnD,CAAC;QAED,OAAO,KAAK,CACV,MAAM,GAAG,IAAI,CAAC,aAAa,EAC3B,CAAC,EACD,IAAI,CAAC,mBAAmB,CAAC,YAAY,CAAC,CACvC,CAAC;IACJ,CAAC;IAQM,aAAa,CAClB,KAAa,EACb,cAAsB,EACtB,YAAoB;QAEpB,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAEzD,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACrD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAChD,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;QAClD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC;QACnE,MAAM,OAAO,GAAG,SAAS,GAAG,YAAY,CAAC;QAEzC,MAAM,SAAS,GAAG,SAAS,IAAI,SAAS,IAAI,OAAO,IAAI,OAAO,CAAC;QAC/D,MAAM,QAAQ,GAAG,SAAS,IAAI,SAAS,IAAI,OAAO,IAAI,OAAO,CAAC;QAE9D,OAAO,SAAS,IAAI,QAAQ,CAAC;IAC/B,CAAC;IAKM,eAAe,CACpB,cAAsB,EACtB,YAAoB,EACpB,QAAgB;QAEhB,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,YAAY,IAAI,CAAC,EAAE,CAAC;YAChE,OAAO,EAAE,UAAU,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC;QACzC,CAAC;QAKD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC;QACrE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,WAAW,CAAC,CAAC;QACxD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,WAAW,GAAG,YAAY,CAAC,CAAC;QAEtE,OAAO;YACL,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,QAAQ,CAAC;YACzC,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,GAAG,QAAQ,CAAC;SAC3D,CAAC;IACJ,CAAC;IAOM,oBAAoB,CAAC,UAAkB,EAAE,QAAgB;QAC9D,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO,CAAC,CAAC;QAE1B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QACtC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACvE,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACjE,CAAC;IAEO,mBAAmB;QACzB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,EAAE,SAAS,IAAI,CAAC,CAAC;QAC7C,IAAI,CAAC,aAAa;YAChB,SAAS,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC,eAAe,CAAC;IAC7E,CAAC;CACF","sourcesContent":["import { clamp } from '#internals/utils/math.js';\nimport type { ScrollAlignment, VisibleRange } from './types.js';\n\n/**\n * The maximum scrollable coordinate doesn't change over a document's lifetime,\n * so instances sharing one document share a single probe.\n */\nconst _maxBrowserSizeCache = new WeakMap<Document, number>();\n\n/**\n * Probes the browser for the maximum scrollable coordinate it supports.\n */\nfunction getMaxBrowserSizeProbePx(doc: Document): number {\n  const cached = _maxBrowserSizeCache.get(doc);\n  if (cached !== undefined) {\n    return cached;\n  }\n\n  const container = doc.body ?? doc.documentElement;\n  if (!container) {\n    return Number.POSITIVE_INFINITY;\n  }\n\n  const div = doc.createElement('div');\n  div.style.position = 'absolute';\n  div.style.top = `${Number.MAX_SAFE_INTEGER}px`;\n  div.style.width = '0';\n  div.style.height = '0';\n  div.style.visibility = 'hidden';\n  container.appendChild(div);\n  const scrollOffset = doc.documentElement?.scrollTop ?? 0;\n  const size = Math.abs(div.getBoundingClientRect().top) + scrollOffset;\n  container.removeChild(div);\n\n  _maxBrowserSizeCache.set(doc, size);\n  return size;\n}\n\n/**\n * Clamps `index` into `[0, length - 1]`, keeping both `prefixSum(index)` and\n * `prefixSum(index + 1)` addressable. Callers guard for `length > 0`.\n */\nfunction clampIndex(index: number, length: number): number {\n  return clamp(index, 0, length - 1);\n}\n\n/**\n * Fills `tree` - a 1-indexed Fenwick array of `sizes.length + 1` entries,\n * expected to be zeroed - with the partial range sums of `sizes` in a single\n * O(N) pass. Returns the grand total.\n */\nfunction buildTree(tree: Float64Array, sizes: Float64Array): number {\n  const length = sizes.length;\n  let total = 0;\n\n  for (let i = 1; i <= length; i++) {\n    tree[i] += sizes[i - 1];\n    total += sizes[i - 1];\n    const j = i + (i & -i);\n    if (j <= length) {\n      tree[j] += tree[i];\n    }\n  }\n  return total;\n}\n\n/**\n * Binary Indexed Tree (Fenwick tree) over item sizes. Every hot-path\n * operation is O(log N): point update (item measured), prefix sum (scroll\n * offset) and index at offset (scroll -> item, via binary lifting).\n */\nclass SizeTree {\n  public readonly length: number;\n\n  /** 1-indexed BIT; each cell holds a partial range sum. */\n  private readonly _tree: Float64Array;\n\n  /** Raw per-item sizes (0-indexed), kept for O(1) reads and delta calc. */\n  private readonly _sizes: Float64Array;\n\n  /**\n   * Which indices hold a real, DOM-measured size (`1`) rather than an\n   * estimate (`0`). Only the latter are touched by `applyEstimate`.\n   */\n  private readonly _measured: Uint8Array;\n\n  /** Running total maintained alongside tree updates in O(1). */\n  private _total: number;\n\n  /**\n   * Highest power-of-two <= `length`, for the binary lifting in\n   * `findIndexAtOffset`. Precomputed since that runs on every scroll event.\n   */\n  private readonly _topBit: number;\n\n  private constructor(\n    length: number,\n    sizes: Float64Array,\n    tree: Float64Array,\n    total: number,\n    measured: Uint8Array\n  ) {\n    this.length = length;\n    this._sizes = sizes;\n    this._tree = tree;\n    this._total = total;\n    this._measured = measured;\n    this._topBit = length > 0 ? 1 << (31 - Math.clz32(length)) : 0;\n  }\n\n  /**\n   * Creates a tree of `length` items all initialized to `fillSize`, none of\n   * which are considered measured yet. O(N).\n   */\n  public static filled(length: number, fillSize: number): SizeTree {\n    return SizeTree._build(\n      new Float64Array(length).fill(fillSize),\n      new Uint8Array(length)\n    );\n  }\n\n  /**\n   * Builds a tree from a sizes array and its matching measured-flags array. O(N).\n   */\n  private static _build(sizes: Float64Array, measured: Uint8Array): SizeTree {\n    const tree = new Float64Array(sizes.length + 1);\n    const total = buildTree(tree, sizes);\n    return new SizeTree(sizes.length, sizes, tree, total, measured);\n  }\n\n  /** Total size of all items. O(1). */\n  public get totalSize(): number {\n    return this._total;\n  }\n\n  /**\n   * Prefix sum of items [0, i) — the virtual scroll offset at the leading\n   * edge of item i. O(log N).\n   */\n  public prefixSum(i: number): number {\n    let sum = 0;\n    for (let j = i; j > 0; j -= j & -j) {\n      sum += this._tree[j];\n    }\n    return sum;\n  }\n\n  /**\n   * Update the size of the item at 0-based index. Marks the item as\n   * explicitly measured, exempting it from future `applyEstimate()` calls.\n   * Returns true when the size actually changed. O(log N).\n   */\n  public update(index: number, newSize: number): boolean {\n    if (index < 0 || index >= this.length) return false;\n\n    const old = this._sizes[index];\n    this._measured[index] = 1;\n    if (old === newSize) return false;\n\n    const delta = newSize - old;\n    this._sizes[index] = newSize;\n    this._total += delta;\n    for (let i = index + 1; i <= this.length; i += i & -i) {\n      this._tree[i] += delta;\n    }\n    return true;\n  }\n\n  /**\n   * Returns a new tree of `newLength` items in a single O(N) pass. Sizes and\n   * their measured flags are preserved up to\n   * `min(this.length, newLength, retainCount)`; the rest is filled with\n   * `fillSize` and marked unmeasured. Pass a `retainCount` below the item\n   * count when the data behind those indices changed identity.\n   */\n  public cloneResized(\n    newLength: number,\n    fillSize: number,\n    retainCount = newLength\n  ): SizeTree {\n    const sizes = new Float64Array(newLength).fill(fillSize);\n    const measured = new Uint8Array(newLength);\n    const retained = Math.max(0, Math.min(this.length, newLength, retainCount));\n    sizes.set(this._sizes.subarray(0, retained));\n    measured.set(this._measured.subarray(0, retained));\n    return SizeTree._build(sizes, measured);\n  }\n\n  /**\n   * Applies `estimatedSize` to every unmeasured item, leaving measured ones\n   * untouched. Returns true when at least one size changed.\n   *\n   * One estimate change can affect most of the list at once, so this rebuilds\n   * in a single O(N) pass instead of one O(log N) `update` per item.\n   */\n  public applyEstimate(estimatedSize: number): boolean {\n    let changed = false;\n    for (let i = 0; i < this.length; i++) {\n      if (!this._measured[i] && this._sizes[i] !== estimatedSize) {\n        this._sizes[i] = estimatedSize;\n        changed = true;\n      }\n    }\n    if (!changed) return false;\n\n    this._tree.fill(0);\n    this._total = buildTree(this._tree, this._sizes);\n    return true;\n  }\n\n  /**\n   * Returns the 0-based index of the item containing the scroll `offset`, i.e.\n   * the largest i where `prefixSum(i) <= offset < prefixSum(i + 1)`. O(log N).\n   */\n  public findIndexAtOffset(offset: number): number {\n    if (offset <= 0 || this.length === 0) return 0;\n\n    let idx = 0;\n    let remaining = offset;\n\n    for (let bit = this._topBit; bit > 0; bit >>= 1) {\n      const next = idx + bit;\n      if (next <= this.length && this._tree[next] <= remaining) {\n        idx = next;\n        remaining -= this._tree[idx];\n      }\n    }\n    return Math.min(this.length - 1, idx);\n  }\n}\n\n/**\n * Pure scroll-math engine for a single axis of virtual scrolling. All size\n * state is held in a Fenwick tree.\n *\n * ### Virtual vs DOM coordinates\n *\n * Browsers cap how far an element can be scrolled. When the summed item size\n * exceeds that cap, the engine compresses the *virtual* space (`0…totalSize`)\n * into the *DOM* space the browser can represent (`0…domSize`) by the factor\n * `_virtualRatio`. Every offset crossing that boundary is scaled: incoming\n * scroll positions are multiplied by the ratio, outgoing offsets divided by\n * it. Item sizes render at their real px size and so are always virtual.\n */\nexport class VirtualScrollEngine {\n  private _maxBrowserSize = Number.POSITIVE_INFINITY;\n\n  /**\n   * The ratio `totalSize / maxBrowserSize` when `totalSize` exceeds the\n   * maximum DOM coordinate the browser supports; `1` otherwise.\n   * Used to map virtual scroll positions to DOM scroll positions.\n   */\n  private _virtualRatio = 1;\n\n  /** Binary Indexed Tree for O(log N) size queries and updates. */\n  private _tree: SizeTree | null = null;\n\n  /**\n   * Called whenever item sizes or the item count change, e.g.\n   * `() => this.requestUpdate()`.\n   */\n  public onSizeChange: (() => void) | null = null;\n\n  /** Total virtual size of all items in px. */\n  public get totalSize(): number {\n    return this._tree?.totalSize ?? 0;\n  }\n\n  /** Total size in DOM space, clamped to the maximum browser size. */\n  public get domSize(): number {\n    return this._virtualRatio !== 1 ? this._maxBrowserSize : this.totalSize;\n  }\n\n  /** Probes the document for the maximum browser size and rescales. */\n  public initMaxBrowserSize(doc: Document): void {\n    this._maxBrowserSize = getMaxBrowserSizeProbePx(doc);\n    this._updateVirtualRatio();\n  }\n\n  /**\n   * Grows or shrinks the internal sizes array to `length`. Measured sizes\n   * below `retainCount` are preserved; the rest is refilled with\n   * `estimatedSize` and marked unmeasured. Callers that only append can leave\n   * `retainCount` at its default; callers whose data changed identity at some\n   * index must pass it, so the stale measurements behind it are discarded.\n   */\n  public resize(\n    length: number,\n    estimatedSize: number,\n    retainCount = length\n  ): void {\n    if (this._tree?.length === length && retainCount >= length) return;\n\n    this._tree = this._tree\n      ? this._tree.cloneResized(length, estimatedSize, retainCount)\n      : SizeTree.filled(length, estimatedSize);\n    this._updateVirtualRatio();\n    this.onSizeChange?.();\n  }\n\n  /** Records the measured DOM size for a single item. */\n  public measureItem(index: number, size: number): void {\n    if (!this._tree?.update(index, size)) return;\n\n    this._updateVirtualRatio();\n    this.onSizeChange?.();\n  }\n\n  /**\n   * Applies a new estimated size to every item not yet measured in the DOM.\n   * Use this when `estimatedItemSize` changes but the item count doesn't, so\n   * `resize` would be a no-op.\n   */\n  public updateEstimatedSize(estimatedSize: number): void {\n    if (!this._tree?.applyEstimate(estimatedSize)) return;\n\n    this._updateVirtualRatio();\n    this.onSizeChange?.();\n  }\n\n  /**\n   * Returns the DOM scroll offset in px that puts the item at `index` at the\n   * leading edge of the viewport.\n   */\n  public getScrollOffsetForIndex(index: number): number {\n    if (!this._tree || index <= 0) return 0;\n\n    const clamped = Math.min(index, this._tree.length);\n    return this._tree.prefixSum(clamped) / this._virtualRatio;\n  }\n\n  /**\n   * The largest DOM scroll offset the host can reach for the given viewport\n   * size. Requesting anything beyond it silently does nothing, so offsets\n   * handed out to a caller that waits for the scroll to settle are clamped\n   * to it.\n   */\n  private _getMaxScrollOffset(viewportSize: number): number {\n    return Math.max(0, this.domSize - viewportSize);\n  }\n\n  /**\n   * Returns the DOM scroll offset that positions the item at `index`\n   * according to `align` within a `viewportSize` px viewport, clamped to the\n   * reachable scroll range.\n   *\n   * The slack is computed in virtual space against the item's real size and\n   * converted to DOM space once, at the end: a DOM pixel is worth\n   * `_virtualRatio` virtual pixels, so mixing the two would scale the slack.\n   */\n  public getAlignedScrollOffset(\n    index: number,\n    viewportSize: number,\n    align: ScrollAlignment\n  ): number {\n    if (!this._tree || this._tree.length === 0) return 0;\n\n    const clamped = clampIndex(index, this._tree.length);\n    const itemStart = this._tree.prefixSum(clamped);\n    let offset = itemStart;\n\n    if (align !== 'start') {\n      const itemEnd = this._tree.prefixSum(clamped + 1);\n      const slack = viewportSize - Math.max(0, itemEnd - itemStart);\n      offset -= align === 'center' ? slack / 2 : slack;\n    }\n\n    return clamp(\n      offset / this._virtualRatio,\n      0,\n      this._getMaxScrollOffset(viewportSize)\n    );\n  }\n\n  /**\n   * Whether the item at `index` needs no scrolling to be seen at the given DOM\n   * scroll position: either it sits entirely inside the viewport, or it is\n   * larger than the viewport and already covers it end to end. The latter\n   * mirrors native `scrollIntoView({ block: 'nearest' })`.\n   */\n  public isIndexInView(\n    index: number,\n    scrollPosition: number,\n    viewportSize: number\n  ): boolean {\n    if (!this._tree || this._tree.length === 0) return false;\n\n    const clamped = clampIndex(index, this._tree.length);\n    const itemStart = this._tree.prefixSum(clamped);\n    const itemEnd = this._tree.prefixSum(clamped + 1);\n    const viewStart = Math.max(0, scrollPosition) * this._virtualRatio;\n    const viewEnd = viewStart + viewportSize;\n\n    const contained = itemStart >= viewStart && itemEnd <= viewEnd;\n    const spanning = itemStart <= viewStart && itemEnd >= viewEnd;\n\n    return contained || spanning;\n  }\n\n  /**\n   * Returns the visible + over-scanned item range for the given scroll state.\n   */\n  public getVisibleRange(\n    scrollPosition: number,\n    viewportSize: number,\n    overScan: number\n  ): VisibleRange {\n    if (!this._tree || this._tree.length === 0 || viewportSize <= 0) {\n      return { startIndex: 0, endIndex: -1 };\n    }\n\n    // The viewport is *not* scaled by the virtual ratio: items render at their\n    // real px size, so a `viewportSize` px viewport always shows that many\n    // virtual px worth of items, however compressed the scroll range is.\n    const startOffset = Math.max(0, scrollPosition) * this._virtualRatio;\n    const first = this._tree.findIndexAtOffset(startOffset);\n    const last = this._tree.findIndexAtOffset(startOffset + viewportSize);\n\n    return {\n      startIndex: Math.max(0, first - overScan),\n      endIndex: Math.min(this._tree.length - 1, last + overScan),\n    };\n  }\n\n  /**\n   * Sum of the actual sizes of the items in [startIndex, endIndex]. Clamps the\n   * content translate offset so rendered items never overflow past `domSize`\n   * under coordinate compression.\n   */\n  public getPhysicalRangeSize(startIndex: number, endIndex: number): number {\n    if (!this._tree) return 0;\n\n    const start = Math.max(0, startIndex);\n    const end = Math.min(Math.max(endIndex + 1, start), this._tree.length);\n    return this._tree.prefixSum(end) - this._tree.prefixSum(start);\n  }\n\n  private _updateVirtualRatio(): void {\n    const totalSize = this._tree?.totalSize ?? 0;\n    this._virtualRatio =\n      totalSize <= this._maxBrowserSize ? 1 : totalSize / this._maxBrowserSize;\n  }\n}\n"]}

package/components/virtualization/types.d.ts

@@ -0,0 +1,53 @@
+/**
+ * Context passed to the item template: the item data, its index and utility
+ * properties for rendering.
+ */
+export declare class VirtualScrollItemContext<T> {
+    /** The current item in the virtual scroll */
+    readonly value: T;
+    /** The index of the current item */
+    readonly index: number;
+    /** The total number of items */
+    readonly count: number;
+    constructor(value: T, index: number, count: number);
+    /** Whether the current item is the first item */
+    get isFirst(): boolean;
+    /** Whether the current item is the last item */
+    get isLast(): boolean;
+}
+/**
+ * How `scrollToIndex` positions the requested item within the viewport.
+ * Mirrors the subset of `ScrollLogicalPosition` the engine can act on.
+ */
+export type ScrollAlignment = 'start' | 'center' | 'end';
+/** The currently visible (and over-scanned) range of items. */
+export interface VisibleRange {
+    /** Index of the first rendered item (inclusive) */
+    startIndex: number;
+    /** Index of the last rendered item (inclusive) */
+    endIndex: number;
+}
+/** Snapshot of the currently rendered virtual window */
+export interface VirtualScrollState {
+    /** The index of the first item currently rendered in the viewport. */
+    startIndex: number;
+    /** The index of the last item currently rendered in the viewport (inclusive). */
+    endIndex: number;
+    /** The size of the viewport in pixels. */
+    viewportSize: number;
+    /** The total size of the virtual scroll content in pixels. */
+    totalSize: number;
+}
+/**
+ * A request for more data, emitted when the rendered window comes near the end
+ * of the loaded items. Consumers listen for it and append what it asks for.
+ */
+export interface VirtualScrollDataRequest {
+    /**
+     * The first index that does not yet have data.
+     * Append at least `count` more items starting here.
+     */
+    startIndex: number;
+    /** Number of items being requested. */
+    count: number;
+}

package/components/virtualization/types.js

@@ -0,0 +1,14 @@
+export class VirtualScrollItemContext {
+    constructor(value, index, count) {
+        this.value = value;
+        this.index = index;
+        this.count = count;
+    }
+    get isFirst() {
+        return this.index === 0;
+    }
+    get isLast() {
+        return this.index === this.count - 1;
+    }
+}
+//# sourceMappingURL=types.js.map

package/components/virtualization/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/components/virtualization/types.ts"],"names":[],"mappings":"AAIA,MAAM,OAAO,wBAAwB;IAQnC,YAAY,KAAQ,EAAE,KAAa,EAAE,KAAa;QAChD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAGD,IAAW,OAAO;QAChB,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC;IAC1B,CAAC;IAGD,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACvC,CAAC;CACF","sourcesContent":["/**\n * Context passed to the item template: the item data, its index and utility\n * properties for rendering.\n */\nexport class VirtualScrollItemContext<T> {\n  /** The current item in the virtual scroll */\n  public readonly value: T;\n  /** The index of the current item */\n  public readonly index: number;\n  /** The total number of items */\n  public readonly count: number;\n\n  constructor(value: T, index: number, count: number) {\n    this.value = value;\n    this.index = index;\n    this.count = count;\n  }\n\n  /** Whether the current item is the first item */\n  public get isFirst(): boolean {\n    return this.index === 0;\n  }\n\n  /** Whether the current item is the last item */\n  public get isLast(): boolean {\n    return this.index === this.count - 1;\n  }\n}\n\n/**\n * How `scrollToIndex` positions the requested item within the viewport.\n * Mirrors the subset of `ScrollLogicalPosition` the engine can act on.\n */\nexport type ScrollAlignment = 'start' | 'center' | 'end';\n\n/** The currently visible (and over-scanned) range of items. */\nexport interface VisibleRange {\n  /** Index of the first rendered item (inclusive) */\n  startIndex: number;\n  /** Index of the last rendered item (inclusive) */\n  endIndex: number;\n}\n\n/** Snapshot of the currently rendered virtual window */\nexport interface VirtualScrollState {\n  /** The index of the first item currently rendered in the viewport. */\n  startIndex: number;\n  /** The index of the last item currently rendered in the viewport (inclusive). */\n  endIndex: number;\n  /** The size of the viewport in pixels. */\n  viewportSize: number;\n  /** The total size of the virtual scroll content in pixels. */\n  totalSize: number;\n}\n\n/**\n * A request for more data, emitted when the rendered window comes near the end\n * of the loaded items. Consumers listen for it and append what it asks for.\n */\nexport interface VirtualScrollDataRequest {\n  /**\n   * The first index that does not yet have data.\n   * Append at least `count` more items starting here.\n   */\n  startIndex: number;\n  /** Number of items being requested. */\n  count: number;\n}\n"]}