igniteui-webcomponents 7.3.2 → 7.4.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,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;AAkBxD,MAAM,cAAc,GAGlB;IACE,UAAU;IACV,aAAa;IACb,iBAAiB;IACjB,eAAe;IACf,gBAAgB;IAChB,cAAc;IACd,SAAS;IACT,UAAU;IACV,cAAc;IACd,cAAc;CAEjB,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,WAAW,CAAC,GAAG,CAAC,CAAU,CAAC,CAAC;AAMjD,QAAQ,CAAC,CAAC,qBAAqB,CAAC,QAAuB;IACrD,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACpB,MAAM,SAAS,CAAC;IAClB,CAAC;IAED,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,cAAc,EAAE,CAAC;QACzC,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAClB,MAAM,IAAI,CAAC;QACb,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;QAKZ,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;QAIZ,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;IAqBD,IAAW,MAAM,CAAC,KAAqB;QACrC,IAAI,IAAI,CAAC,OAAO,KAAK,KAAK,EAAE,CAAC;YAC3B,OAAO;QACT,CAAC;QAID,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;QAvCO,iBAAY,GAAG,iBAAiB,EAAE,CAAC;QAU7C,YAAO,GAAG,KAAK,CAAC;QA8BrB,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;IASO,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,IAAI,iBAAiB,GAAG,IAAI,CAAC;QAE7B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC;YAC5D,IAAI,OAAO,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;gBACtD,SAAS;YACX,CAAC;YAED,iBAAiB,GAAG,KAAK,CAAC;YAC1B,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;gBAChC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,OAAO,EAAE,iBAAiB,EAAE,UAAU,EAAE,CAAC;IAC3C,CAAC;IAEO,wBAAwB,CAC9B,QAAgB,EAChB,cAAmC;QAEnC,MAAM,mBAAmB,GAAG,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACzD,MAAM,KAAK,GAAG,EAAE,oBAAoB,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,mBAAmB,EAAE,CAAC;QAC1E,MAAM,IAAI,GAAG,mBAAmB;YAC9B,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;IAEO,aAAa,CACnB,cAAmC;QAEnC,OAAO,IAAI,CAAC,OAAO,IAAI,cAAc,CAAC,IAAI,GAAG,CAAC;YAC5C,CAAC,CAAC,OAAO;YACT,CAAC,CAAC,IAAI,CAAA,kCAAkC,CAAC;IAC7C,CAAC;IAEkB,YAAY;QAI7B,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;QAC9B,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,UAAU,CAAC;;KAE9C,CAAC;IACJ,CAAC;;AA7IM;IADN,QAAQ,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;gEACL;AASvB;IADC,QAAQ,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;6DAc9B","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. */\nexport interface 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\n/**\n * Validity flags and their slot names, in a stable order so the generated slots\n * are deterministic across browsers.\n */\nconst VALIDITY_SLOTS: ReadonlyArray<\n  readonly [keyof ValidityStateFlags, string]\n> = (\n  [\n    'badInput',\n    'customError',\n    'patternMismatch',\n    'rangeOverflow',\n    'rangeUnderflow',\n    'stepMismatch',\n    'tooLong',\n    'tooShort',\n    'typeMismatch',\n    'valueMissing',\n  ] as const\n).map((key) => [key, toKebabCase(key)] as const);\n\n/**\n * Yields the active validation slot names for the given validity state:\n * `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, slot] of VALIDITY_SLOTS) {\n    if (validity[key]) {\n      yield slot;\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 hydrating render, so both emit\n    // `nothing` and the slots are projected on the next host render (see\n    // `firstUpdated` in the container).\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    // `?invalid` tracks host re-renders; the internal invalid/reset events cover\n    // a form reset, which restores the value without re-rendering the host.\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 rendered.\n   *\n   * @remarks Must be set before the first update for SSR compatibility;\n   * `create` sets it automatically.\n   */\n  @property({ attribute: false })\n  public set target(value: IgcFormControl) {\n    if (this._target === value) {\n      return;\n    }\n\n    // Listeners are not removed on disconnect: the container lives in the\n    // target's shadow root and shares its lifetime.\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 which slots have assigned content.\n   *\n   * @remarks Reads the shadow DOM from the previous commit. On the render where\n   * `invalid` flips on, the message slots do not exist yet, so every message is\n   * `empty`; their `slotchange` schedules a second render before paint.\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    let isProjectionEmpty = true;\n\n    for (const slot of this.renderRoot.querySelectorAll('slot')) {\n      if (isEmpty(slot.assignedElements({ flatten: true }))) {\n        continue;\n      }\n\n      isProjectionEmpty = false;\n      if (slot.name !== 'helper-text') {\n        validation.add(slot.name);\n      }\n    }\n\n    return { isProjectionEmpty, validation };\n  }\n\n  private _renderValidationMessage(\n    slotName: string,\n    projectedSlots: ReadonlySet<string>\n  ): TemplateResult {\n    const hasProjectedContent = projectedSlots.has(slotName);\n    const parts = { 'validation-message': true, empty: !hasProjectedContent };\n    const icon = hasProjectedContent\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  private _renderHelper(\n    projectedSlots: ReadonlySet<string>\n  ): TemplateResult | typeof nothing {\n    return this.invalid && projectedSlots.size > 0\n      ? nothing\n      : html`<slot name=\"helper-text\"></slot>`;\n  }\n\n  protected override firstUpdated(): void {\n    // `create` omits the validation slots until the host has updated. If the\n    // host hydrated invalid, ask it to re-render so the slots are projected;\n    // their `slotchange` then updates this container.\n    if (this.invalid) {\n      this.target.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(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;AAkBxD,MAAM,cAAc,GAGlB;IACE,UAAU;IACV,aAAa;IACb,iBAAiB;IACjB,eAAe;IACf,gBAAgB;IAChB,cAAc;IACd,SAAS;IACT,UAAU;IACV,cAAc;IACd,cAAc;CAEjB,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,WAAW,CAAC,GAAG,CAAC,CAAU,CAAC,CAAC;AAMjD,QAAQ,CAAC,CAAC,qBAAqB,CAAC,QAAuB;IACrD,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACpB,MAAM,SAAS,CAAC;IAClB,CAAC;IAED,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,cAAc,EAAE,CAAC;QACzC,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAClB,MAAM,IAAI,CAAC;QACb,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;QAIZ,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;IAqBD,IAAW,MAAM,CAAC,KAAqB;QACrC,IAAI,IAAI,CAAC,OAAO,KAAK,KAAK,EAAE,CAAC;YAC3B,OAAO;QACT,CAAC;QAID,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;QAvCO,iBAAY,GAAG,iBAAiB,EAAE,CAAC;QAU7C,YAAO,GAAG,KAAK,CAAC;QA8BrB,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;IASO,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,IAAI,iBAAiB,GAAG,IAAI,CAAC;QAE7B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC;YAC5D,IAAI,OAAO,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;gBACtD,SAAS;YACX,CAAC;YAED,iBAAiB,GAAG,KAAK,CAAC;YAC1B,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;gBAChC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,OAAO,EAAE,iBAAiB,EAAE,UAAU,EAAE,CAAC;IAC3C,CAAC;IAEO,wBAAwB,CAC9B,QAAgB,EAChB,cAAmC;QAEnC,MAAM,mBAAmB,GAAG,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACzD,MAAM,KAAK,GAAG,EAAE,oBAAoB,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,mBAAmB,EAAE,CAAC;QAC1E,MAAM,IAAI,GAAG,mBAAmB;YAC9B,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;IAEO,aAAa,CACnB,cAAmC;QAEnC,OAAO,IAAI,CAAC,OAAO,IAAI,cAAc,CAAC,IAAI,GAAG,CAAC;YAC5C,CAAC,CAAC,OAAO;YACT,CAAC,CAAC,IAAI,CAAA,kCAAkC,CAAC;IAC7C,CAAC;IAEkB,YAAY;QAI7B,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;QAC9B,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,UAAU,CAAC;;KAE9C,CAAC;IACJ,CAAC;;AA7IM;IADN,QAAQ,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;gEACL;AASvB;IADC,QAAQ,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;6DAc9B","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. */\nexport interface 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\n/**\n * Validity flags and their slot names, in a stable order so the generated slots\n * are deterministic across browsers.\n */\nconst VALIDITY_SLOTS: ReadonlyArray<\n  readonly [keyof ValidityStateFlags, string]\n> = (\n  [\n    'badInput',\n    'customError',\n    'patternMismatch',\n    'rangeOverflow',\n    'rangeUnderflow',\n    'stepMismatch',\n    'tooLong',\n    'tooShort',\n    'typeMismatch',\n    'valueMissing',\n  ] as const\n).map((key) => [key, toKebabCase(key)] as const);\n\n/**\n * Yields the active validation slot names for the given validity state:\n * `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, slot] of VALIDITY_SLOTS) {\n    if (validity[key]) {\n      yield slot;\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 hydrating render, so both give\n    // `nothing`, and the next host render projects the slots. See `firstUpdated`.\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    // `?invalid` tracks host re-renders; the internal invalid/reset events cover\n    // a form reset, which restores the value without re-rendering the host.\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 rendered.\n   *\n   * @remarks Must be set before the first update for SSR compatibility;\n   * `create` sets it automatically.\n   */\n  @property({ attribute: false })\n  public set target(value: IgcFormControl) {\n    if (this._target === value) {\n      return;\n    }\n\n    // Listeners are not removed on disconnect: the container lives in the\n    // target's shadow root and shares its lifetime.\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 which slots have assigned content.\n   *\n   * @remarks Reads the shadow DOM from the previous commit. On the render where\n   * `invalid` flips on, the message slots do not exist yet, so every message is\n   * `empty`; their `slotchange` schedules a second render before paint.\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    let isProjectionEmpty = true;\n\n    for (const slot of this.renderRoot.querySelectorAll('slot')) {\n      if (isEmpty(slot.assignedElements({ flatten: true }))) {\n        continue;\n      }\n\n      isProjectionEmpty = false;\n      if (slot.name !== 'helper-text') {\n        validation.add(slot.name);\n      }\n    }\n\n    return { isProjectionEmpty, validation };\n  }\n\n  private _renderValidationMessage(\n    slotName: string,\n    projectedSlots: ReadonlySet<string>\n  ): TemplateResult {\n    const hasProjectedContent = projectedSlots.has(slotName);\n    const parts = { 'validation-message': true, empty: !hasProjectedContent };\n    const icon = hasProjectedContent\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  private _renderHelper(\n    projectedSlots: ReadonlySet<string>\n  ): TemplateResult | typeof nothing {\n    return this.invalid && projectedSlots.size > 0\n      ? nothing\n      : html`<slot name=\"helper-text\"></slot>`;\n  }\n\n  protected override firstUpdated(): void {\n    // `create` omits the validation slots until the host updates. If the host\n    // hydrated invalid, make it render again to project the slots. Their\n    // `slotchange` then updates this container.\n    if (this.invalid) {\n      this.target.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(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

@@ -16,9 +16,9 @@ import type { ScrollAlignment, VisibleRange } from './types.js';
 export declare class VirtualScrollEngine {
     private _maxBrowserSize;
     /**
-     * The ratio `totalSize / maxBrowserSize` when `totalSize` is larger than
-     * the maximum DOM coordinate the browser supports; `1` otherwise.
-     * Maps virtual scroll positions to DOM scroll positions.
+     * Maps a virtual scroll position to a DOM scroll position. The ratio
+     * `totalSize / maxBrowserSize` if `totalSize` is larger than the maximum DOM
+     * coordinate of the browser, and `1` in all other cases.
      */
     private _virtualRatio;
     /** Binary Indexed Tree for O(log N) size queries and updates. */
@@ -57,8 +57,8 @@ export declare class VirtualScrollEngine {
     getScrollOffsetForIndex(index: number): number;
     /**
      * The largest DOM scroll offset the host can reach for the given viewport
-     * size. A request beyond it does nothing, so offsets given to a caller
-     * that waits for the scroll to settle are clamped to it.
+     * size. A request past it does nothing, so an offset given to a caller that
+     * waits for the scroll to settle is clamped to this value.
      */
     private _getMaxScrollOffset;
     /**

package/components/virtualization/engine.js.map

@@ -1 +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;AAgBD,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;IAsLlD,CAAC;IAnLC,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;IAOO,mBAAmB,CAAC,YAAoB;QAC9C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,GAAG,YAAY,CAAC,CAAC;IAClD,CAAC;IAYM,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;IAMM,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 of a document does not change.\n * All instances in one document share one probe result.\n */\nconst _maxBrowserSizeCache = new WeakMap<Document, number>();\n\n/**\n * Measures the maximum scrollable coordinate that the browser 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]`. This keeps `prefixSum(index)` and\n * `prefixSum(index + 1)` valid. Callers make sure that `length > 0`.\n */\nfunction clampIndex(index: number, length: number): number {\n  return clamp(index, 0, length - 1);\n}\n\n/**\n * Fills `tree` with the partial range sums of `sizes` in one O(N) pass.\n * `tree` is a 1-indexed Fenwick array of `sizes.length + 1` zeroed entries.\n * Returns the total sum.\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. Each hot-path operation\n * is O(log N): point update (item measured), prefix sum (scroll offset), and\n * index at offset (scroll to item, through binary lifting).\n */\nclass SizeTree {\n  public readonly length: number;\n\n  /** A 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 calculation. */\n  private readonly _sizes: Float64Array;\n\n  /**\n   * Flags the indices that hold a DOM-measured size (`1`) instead of an\n   * estimate (`0`). `applyEstimate` changes only the estimated entries.\n   */\n  private readonly _measured: Uint8Array;\n\n  /** Running total. Updated together with the tree in O(1). */\n  private _total: number;\n\n  /**\n   * The highest power of two <= `length`, for the binary lifting in\n   * `findIndexAtOffset`. Precomputed because that runs on each 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, each set to `fillSize` and marked\n   * unmeasured. 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   * Sets the size of the item at a 0-based index and marks the item as\n   * measured. Later `applyEstimate()` calls do not change measured items.\n   * Returns true when the size 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 one O(N) pass. Sizes and\n   * measured flags are kept up to `min(this.length, newLength, retainCount)`.\n   * The remainder is filled with `fillSize` and marked unmeasured. Pass a\n   * `retainCount` below the item count when the data behind those indices\n   * 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   * Sets `estimatedSize` on each unmeasured item. Measured items do not\n   * change. Returns true when at least one size changed.\n   *\n   * One estimate change can touch most of the list, so this rebuilds in one\n   * 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 that contains the scroll `offset`:\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 one axis of virtual scrolling. A Fenwick tree\n * holds all size state.\n *\n * ### Virtual and DOM coordinates\n *\n * Browsers limit how far an element can scroll. When the total item size is\n * larger than that limit, the engine compresses the *virtual* space\n * (`0…totalSize`) into the *DOM* space the browser can represent\n * (`0…domSize`) by the factor `_virtualRatio`. Each offset that crosses that\n * boundary is scaled: incoming scroll positions are multiplied by the ratio,\n * and outgoing offsets are divided by it. Items render at their real pixel\n * size, so item sizes are always virtual.\n */\nexport class VirtualScrollEngine {\n  private _maxBrowserSize = Number.POSITIVE_INFINITY;\n\n  /**\n   * The ratio `totalSize / maxBrowserSize` when `totalSize` is larger than\n   * the maximum DOM coordinate the browser supports; `1` otherwise.\n   * Maps 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 when item sizes or the item count change.\n   * Example: `() => 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  /** Measures the maximum browser size for the document and rescales. */\n  public initMaxBrowserSize(doc: Document): void {\n    this._maxBrowserSize = getMaxBrowserSizeProbePx(doc);\n    this._updateVirtualRatio();\n  }\n\n  /**\n   * Resizes the internal sizes array to `length`. Measured sizes below\n   * `retainCount` are kept. The remainder is filled with `estimatedSize` and\n   * marked unmeasured. Callers that only append can keep the default\n   * `retainCount`. Callers whose data changed identity at some index must\n   * pass that index, so the stale measurements after 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 each item that is not measured in the\n   * DOM. Use this when `estimatedItemSize` changes but the item count does\n   * not, because `resize` is then 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. A request beyond it does nothing, so offsets given to a caller\n   * that waits for the scroll to settle are clamped 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` in a\n   * `viewportSize` px viewport, aligned by `align` and 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. One DOM pixel equals\n   * `_virtualRatio` virtual pixels, so mixed coordinates would scale the\n   * 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` is visible without more scrolling at the\n   * given DOM scroll position. True when the item is fully inside the\n   * viewport, or when it is larger than the viewport and covers it fully.\n   * The second case matches 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 and over-scanned item range for the given scroll\n   * 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 pixel size, so a `viewportSize` px viewport always shows that many\n    // virtual pixels of items, at any compression of the scroll range.\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]. The\n   * render pass uses it to clamp the content translate offset, so rendered\n   * items do not overflow past `domSize` 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"]}
+{"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;AAgBD,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;IAsLlD,CAAC;IAnLC,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;IAOO,mBAAmB,CAAC,YAAoB;QAC9C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,GAAG,YAAY,CAAC,CAAC;IAClD,CAAC;IAYM,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;IAMM,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 of a document does not change.\n * All instances in one document share one probe result.\n */\nconst _maxBrowserSizeCache = new WeakMap<Document, number>();\n\n/**\n * Measures the maximum scrollable coordinate that the browser 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]`. This keeps `prefixSum(index)` and\n * `prefixSum(index + 1)` valid. Callers make sure that `length > 0`.\n */\nfunction clampIndex(index: number, length: number): number {\n  return clamp(index, 0, length - 1);\n}\n\n/**\n * Fills `tree` with the partial range sums of `sizes` in one O(N) pass.\n * `tree` is a 1-indexed Fenwick array of `sizes.length + 1` zeroed entries.\n * Returns the total sum.\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. Each hot-path operation\n * is O(log N): point update (item measured), prefix sum (scroll offset), and\n * index at offset (scroll to item, through binary lifting).\n */\nclass SizeTree {\n  public readonly length: number;\n\n  /** A 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 calculation. */\n  private readonly _sizes: Float64Array;\n\n  /**\n   * Flags the indices that hold a DOM-measured size (`1`) instead of an\n   * estimate (`0`). `applyEstimate` changes only the estimated entries.\n   */\n  private readonly _measured: Uint8Array;\n\n  /** Running total. Updated together with the tree in O(1). */\n  private _total: number;\n\n  /**\n   * The highest power of two <= `length`, for the binary lifting in\n   * `findIndexAtOffset`. Precomputed because that runs on each 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, each set to `fillSize` and marked\n   * unmeasured. 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   * Sets the size of the item at a 0-based index and marks the item as\n   * measured. Later `applyEstimate()` calls do not change measured items.\n   * Returns true when the size 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 one O(N) pass. Sizes and\n   * measured flags are kept up to `min(this.length, newLength, retainCount)`.\n   * The remainder is filled with `fillSize` and marked unmeasured. Pass a\n   * `retainCount` below the item count when the data behind those indices\n   * 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   * Sets `estimatedSize` on each unmeasured item. Measured items do not\n   * change. Returns true when at least one size changed.\n   *\n   * One estimate change can touch most of the list, so this rebuilds in one\n   * 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 that contains the scroll `offset`:\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 one axis of virtual scrolling. A Fenwick tree\n * holds all size state.\n *\n * ### Virtual and DOM coordinates\n *\n * Browsers limit how far an element can scroll. When the total item size is\n * larger than that limit, the engine compresses the *virtual* space\n * (`0…totalSize`) into the *DOM* space the browser can represent\n * (`0…domSize`) by the factor `_virtualRatio`. Each offset that crosses that\n * boundary is scaled: incoming scroll positions are multiplied by the ratio,\n * and outgoing offsets are divided by it. Items render at their real pixel\n * size, so item sizes are always virtual.\n */\nexport class VirtualScrollEngine {\n  private _maxBrowserSize = Number.POSITIVE_INFINITY;\n\n  /**\n   * Maps a virtual scroll position to a DOM scroll position. The ratio\n   * `totalSize / maxBrowserSize` if `totalSize` is larger than the maximum DOM\n   * coordinate of the browser, and `1` in all other cases.\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 when item sizes or the item count change.\n   * Example: `() => 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  /** Measures the maximum browser size for the document and rescales. */\n  public initMaxBrowserSize(doc: Document): void {\n    this._maxBrowserSize = getMaxBrowserSizeProbePx(doc);\n    this._updateVirtualRatio();\n  }\n\n  /**\n   * Resizes the internal sizes array to `length`. Measured sizes below\n   * `retainCount` are kept. The remainder is filled with `estimatedSize` and\n   * marked unmeasured. Callers that only append can keep the default\n   * `retainCount`. Callers whose data changed identity at some index must\n   * pass that index, so the stale measurements after 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 each item that is not measured in the\n   * DOM. Use this when `estimatedItemSize` changes but the item count does\n   * not, because `resize` is then 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. A request past it does nothing, so an offset given to a caller that\n   * waits for the scroll to settle is clamped to this value.\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` in a\n   * `viewportSize` px viewport, aligned by `align` and 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. One DOM pixel equals\n   * `_virtualRatio` virtual pixels, so mixed coordinates would scale the\n   * 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` is visible without more scrolling at the\n   * given DOM scroll position. True when the item is fully inside the\n   * viewport, or when it is larger than the viewport and covers it fully.\n   * The second case matches 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 and over-scanned item range for the given scroll\n   * 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 virtual ratio does not scale the viewport. Items render at their real\n    // pixel size, so a `viewportSize` px viewport shows that many virtual pixels\n    // of items at any compression of the scroll range.\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]. The\n   * render pass uses it to clamp the content translate offset, so rendered\n   * items do not overflow past `domSize` 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/virtualization.d.ts

@@ -32,10 +32,10 @@ export default class IgcVirtualScrollComponent<T = any> extends IgcVirtualScroll
     private readonly _itemResizeController;
     private _currentRange;
     /**
-     * The item index each wrapper element was last observed under. Lit reuses
-     * the wrapper elements across renders. After a scroll, the same element
-     * can host a different item at an identical size, and a ResizeObserver
-     * does not report that. See `_scheduleItemMeasurement`.
+     * The item index each wrapper element was last observed under. Lit keeps the
+     * wrapper elements between renders, so after a scroll one element can hold a
+     * different item at the same size, which a ResizeObserver does not report.
+     * See `_scheduleItemMeasurement`.
      */
     private readonly _observedItemIndexes;
     private _lastEmittedState;
@@ -43,18 +43,18 @@ export default class IgcVirtualScrollComponent<T = any> extends IgcVirtualScroll
     private _layoutCompletePromise;
     private _scrollRequestId;
     /**
-     * The `startIndex` of the last emitted `igcDataRequest`, which is also the
-     * item count at that emit. See `_checkDataRequest`.
+     * The `startIndex` of the last `igcDataRequest`, which is also the item count
+     * at that emit. See `_checkDataRequest`.
      *
-     * Kept across a disconnect, like `_hasPendingDataRequest`: a move in the
-     * DOM does not undo what the consumer was already asked for. If only one
-     * of the two were cleared, the request loop would reopen on reconnect.
+     * Kept across a disconnect, as `_hasPendingDataRequest` is. A move in the DOM
+     * does not cancel what the consumer was already asked for, and clearing only
+     * one of the two opens the request loop again on reconnect.
      */
     private _lastDataRequestIndex;
     /**
-     * The live scroll offset on the active axis. Not reactive by design:
-     * `render` reads it only through `_currentRange`, so `_handleScroll`
-     * schedules an update only when the window moves.
+     * The live scroll offset on the active axis. Not reactive: `render` reads it
+     * only through `_currentRange`, so `_handleScroll` schedules an update only
+     * if the window moves.
      */
     private _scrollPosition;
     private _viewportSize;
@@ -106,8 +106,6 @@ export default class IgcVirtualScrollComponent<T = any> extends IgcVirtualScroll
     createRenderRoot(): HTMLElement | DocumentFragment;
     /** @internal */
     connectedCallback(): void;
-    /** @internal */
-    disconnectedCallback(): void;
     protected willUpdate(changed: PropertyValues<this>): void;
     protected updated(_changed: PropertyValues<this>): void;
     protected render(): TemplateResult;
@@ -124,12 +122,12 @@ export default class IgcVirtualScrollComponent<T = any> extends IgcVirtualScroll
      */
     private _computeRange;
     /**
-     * The scroll offset that aligns `index` in the viewport according to
-     * `options`, from the engine's current size data. As more items are
-     * measured, the same input can give a different, more accurate result.
+     * The scroll offset that aligns `index` in the viewport, as `options` gives,
+     * from the current size data of the engine. The same input can give a
+     * different result as more items are measured.
      *
-     * For `block: 'nearest'` on an item already in view, returns the current
-     * offset, so no scroll occurs.
+     * For `block: 'nearest'` on an item in view, returns the current offset, so
+     * no scroll occurs.
      */
     private _getAlignedScrollOffset;
     /** Applies a scroll offset to the correct axis, accounting for RTL. */
@@ -137,84 +135,84 @@ export default class IgcVirtualScrollComponent<T = any> extends IgcVirtualScroll
     /** The current real scroll position on the active axis, normalized for RTL. */
     private _currentAxisScroll;
     /**
-     * Applies a scroll offset to the active axis and waits for the scroll,
-     * instant or smooth, to settle.
+     * Applies a scroll offset to the active axis, and waits for the scroll to
+     * settle.
      *
-     * `scrollend` does not fire when the requested offset does not move the
-     * scroll position, so that case resolves immediately. The timeout covers
-     * an event that never arrives, for example when the element disconnects
-     * mid-scroll.
+     * @remarks
+     * `scrollend` does not fire if the offset does not move the scroll position,
+     * so that case resolves immediately. The timeout covers an event that never
+     * arrives, for example when the element disconnects during the scroll.
      */
     private _scrollAndWaitForEnd;
     /**
-     * Resolves with `task` or with a deadline of `ms`, whichever comes first.
-     * The signal then tears down the other, so no live timer or dangling
-     * listener remains.
+     * Resolves with `task`, or with a deadline of `ms`, whichever is first. The
+     * signal then stops the other, so no timer or listener stays alive.
      */
     private _withDeadline;
     private _waitForScrollEnd;
     /**
-     * Resolves when no `scroll` event arrives for `SCROLL_IDLE_MS`: the
-     * closest replacement for `scrollend`. The first timer starts immediately,
-     * so a scroll that does not move still settles.
+     * Resolves if no `scroll` event arrives for `SCROLL_IDLE_MS`, which is the
+     * closest replacement for `scrollend`. The first timer starts immediately, so
+     * a scroll that does not move also settles.
      */
     private _waitForScrollIdle;
     private _timeout;
     private _measureViewport;
     /**
-     * Records the new scroll offset. Schedules a render only when the rendered
+     * Records the new scroll offset. Schedules a render only if the rendered
      * window moves.
      *
-     * `render` derives the track size, the content translate, and the item
-     * slice from `_currentRange`, not from the scroll offset. Without the
-     * guard, a scroll inside one item would re-run each item template for an
-     * identical result. `willUpdate` still recomputes `_currentRange` for each
-     * other trigger, so this suppresses only redundant passes, never a needed
-     * one.
+     * @remarks
+     * `render` reads `_currentRange`, not the scroll offset. Without the guard,
+     * a scroll inside one item runs each item template again for the same
+     * result. `willUpdate` recomputes `_currentRange` for the other triggers,
+     * so this skips only the redundant passes.
      */
     private _handleScroll;
     /**
-     * The number of leading items that kept their identity across a `data`
-     * change: the index of the first item whose measured size no longer
-     * matches its rendered content. An append (the `igcDataRequest` flow)
-     * retains all items. A filter or a replacement retains only the unchanged
-     * prefix.
+     * The length of the prefix that a `data` change keeps: the first index at
+     * which the old and the new items differ, or the length of the shorter array
+     * if neither differs. Measurements below that index stay valid. An append
+     * keeps all the previous items. A filter or a replacement keeps fewer.
+     *
+     * @remarks
+     * The test is item identity. An item that changes in place keeps its
+     * measured size.
      */
     private _firstChangedIndex;
     private _handleItemResize;
     /**
-     * Synchronizes the item observer with the rendered window and applies only
-     * the difference. A newly observed element gets one initial measurement.
-     * An `observe` call on an already observed element is a no-op, so a
-     * re-measurement on demand requires re-registration: unobserve, then
-     * observe.
+     * Syncs the item observer with the rendered window, and applies only the
+     * difference.
      *
-     * Re-registration is applied to each element whose `data-vs-index`
-     * changed. Lit reuses the wrapper elements across renders, so after a
-     * scroll the same element can host a different item at an identical size.
-     * The observer does not report that, and the new index would keep its
+     * @remarks
+     * `observe` on an already observed element does nothing, so a new
+     * measurement needs `unobserve` and then `observe`. Do this for each element
+     * whose `data-vs-index` changed. Lit keeps the wrapper elements between
+     * renders, so after a scroll one element can hold a different item at the
+     * same size. The observer does not report that, and the new index keeps its
      * estimated size.
      */
     private _scheduleItemMeasurement;
     /**
-     * Emits `igcStateChange`. Skipped when the window is empty or equal to the
-     * last reported one, because measurement passes re-render without a window
-     * change.
+     * Emits `igcStateChange`. Does nothing if the window is empty or equal to
+     * the last reported one, because a measurement pass renders again with no
+     * window change.
      */
     private _emitStateChange;
     private _checkDataRequest;
     /**
-     * Resolves on the next animation frame, or after `LAYOUT_FRAME_TIMEOUT_MS`
-     * when no frame arrives. A hidden tab or a disconnected element gets no
-     * frames, and `layoutComplete` must still settle there. That state has no
-     * layout to wait for, so an early resolve is safe.
+     * Resolves on the next animation frame, or after `LAYOUT_FRAME_TIMEOUT_MS` if
+     * no frame arrives. A hidden tab or a disconnected element gets no frames,
+     * and `layoutComplete` must still settle. Such a state has no layout to wait
+     * for, so an early resolve is safe.
      */
     private _nextFrame;
     /**
-     * Waits for the current update, then lets ResizeObserver item measurements
-     * run. When those schedule a follow-up render, for example an estimate
-     * replaced by a measured size, the wait repeats until nothing is pending,
-     * up to a safety cap.
+     * Waits for the current update, then lets the ResizeObserver measurements
+     * run. If those schedule one more render, for example when a measured size
+     * replaces an estimate, the wait repeats until nothing is pending, up to a
+     * safety cap.
      */
     private _resolveLayoutComplete;
     /**

package/components/virtualization/virtualization.js

@@ -8,6 +8,7 @@ import { html, isServer, LitElement, nothing, } from 'lit';
 import { property, state } from 'lit/decorators.js';
 import { createRef, ref } from 'lit/directives/ref.js';
 import { styleMap } from 'lit/directives/style-map.js';
+import { addHostListeners } from '#internals/controllers/host-listeners.js';
 import { createResizeObserverController } from '#internals/controllers/resize-observer.js';
 import { registerComponent } from '#internals/definitions/register.js';
 import { EventEmitterMixin } from '#internals/mixins/event-emitter.js';
@@ -132,6 +133,11 @@ export default class IgcVirtualScrollComponent extends EventEmitterMixin(LitElem
         this.itemTemplate = null;
         this._engine.onSizeChange = () => this.requestUpdate();
         this._handleScroll = this._handleScroll.bind(this);
+        addHostListeners(this, {
+            events: ['scroll'],
+            listener: this._handleScroll,
+            options: { passive: true },
+        });
         createResizeObserverController(this, {
             callback: this._measureViewport,
         });
@@ -144,11 +150,6 @@ export default class IgcVirtualScrollComponent extends EventEmitterMixin(LitElem
         this._adoptStyles();
         this._engine.initMaxBrowserSize(this.ownerDocument);
         this._measureViewport();
-        this.addEventListener('scroll', this._handleScroll, { passive: true });
-    }
-    disconnectedCallback() {
-        super.disconnectedCallback();
-        this.removeEventListener('scroll', this._handleScroll);
     }
     willUpdate(changed) {
         this._adoptStyles();