@ember-eui/core 14.1.4 → 16.0.0

package/dist/utils/data-grid/row-tree.js

@@ -0,0 +1,271 @@
+/**
+ * Row tree model for EuiDataGrid's nested rows (`@rowTree`) and row grouping
+ * (`@grouping`). Ember EUI extension: upstream EUI has neither.
+ *
+ * Framework free: builds a tree of data rows (from nested `children` arrays
+ * or flat `parentId` references), optionally groups rows by column values,
+ * sorts siblings, and flattens the tree into the list of visible rows given
+ * the expanded ids.
+ */
+
+const isObject = value => typeof value === 'object' && value !== null;
+function defaultChildren(row) {
+  return isObject(row) && Array.isArray(row['children']) ? row['children'] : undefined;
+}
+function defaultParentId(row) {
+  if (!isObject(row)) return undefined;
+  return row['parentId'] ?? row['parent'];
+}
+function defaultHasChildren(row) {
+  return isObject(row) && row['hasChildren'] === true;
+}
+function defaultRowId(row) {
+  return isObject(row) ? row['id'] : undefined;
+}
+
+/** Whether rows nest through `children` (otherwise they reference a `parentId`). */
+function isNestedRowSource(source) {
+  if (source.getChildren) return true;
+  if (source.getParentId) return false;
+  return source.rows.some(row => defaultChildren(row) !== undefined);
+}
+
+/**
+ * Builds the data row tree. Nested rows get data row indexes in pre-order
+ * (parents before children); flat rows keep their array index.
+ */
+function buildRowTree(source) {
+  const getRowId = source.getRowId ?? defaultRowId;
+  const idOf = (row, rowIndex) => {
+    const id = getRowId(row, rowIndex);
+    return id == null ? String(rowIndex) : String(id);
+  };
+  const hasChildren = source.hasChildren ?? defaultHasChildren;
+  if (isNestedRowSource(source)) {
+    const getChildren = source.getChildren ?? defaultChildren;
+    const rows = [];
+    const seen = new Set();
+    const visit = row => {
+      if (isObject(row)) {
+        if (seen.has(row)) return null; // cycle or shared row
+        seen.add(row);
+      }
+      const rowIndex = rows.length;
+      rows.push(row);
+      const node = {
+        id: idOf(row, rowIndex),
+        kind: 'row',
+        rowIndex,
+        children: []
+      };
+      if (hasChildren(row)) node.canExpand = true;
+      for (const child of getChildren(row) ?? []) {
+        const childNode = visit(child);
+        if (childNode) node.children.push(childNode);
+      }
+      return node;
+    };
+    const roots = [];
+    for (const row of source.rows) {
+      const node = visit(row);
+      if (node) roots.push(node);
+    }
+    return {
+      roots,
+      rows
+    };
+  }
+  const getParentId = source.getParentId ?? defaultParentId;
+  const nodes = source.rows.map((row, rowIndex) => ({
+    id: idOf(row, rowIndex),
+    kind: 'row',
+    rowIndex,
+    children: [],
+    ...(hasChildren(row) ? {
+      canExpand: true
+    } : {})
+  }));
+  const byId = new Map();
+  for (const node of nodes) if (!byId.has(node.id)) byId.set(node.id, node);
+  const parentOf = new Map();
+  for (const [rowIndex, node] of nodes.entries()) {
+    const parentId = getParentId(source.rows[rowIndex]);
+    if (parentId == null) continue;
+    const parent = byId.get(String(parentId));
+    if (parent && parent !== node) parentOf.set(node, parent);
+  }
+  // break cycles: a row whose ancestry loops back becomes a root
+  for (const node of nodes) {
+    const ancestors = new Set([node]);
+    let parent = parentOf.get(node);
+    while (parent) {
+      if (ancestors.has(parent)) {
+        parentOf.delete(node);
+        break;
+      }
+      ancestors.add(parent);
+      parent = parentOf.get(parent);
+    }
+  }
+  const roots = [];
+  for (const node of nodes) {
+    const parent = parentOf.get(node);
+    if (parent) parent.children.push(node);else roots.push(node);
+  }
+  return {
+    roots,
+    rows: source.rows
+  };
+}
+
+/** Root nodes for `rowCount` flat rows (grouping without `rows`). */
+function buildFlatRows(rowCount) {
+  return Array.from({
+    length: Math.max(0, rowCount)
+  }, (_, rowIndex) => ({
+    id: String(rowIndex),
+    kind: 'row',
+    rowIndex,
+    children: []
+  }));
+}
+
+/** Identifier of a group: its column values from the outermost group down. */
+function groupId(values) {
+  return `group:${JSON.stringify(values.map(value => value === undefined ? null : value))}`;
+}
+
+/**
+ * Groups rows by the values of `groupBy` columns (outermost first). Groups
+ * keep the order in which their values first appear; sort them with
+ * `sortRowTree`. Grouped rows keep their own children.
+ */
+function groupRowTree(nodes, groupBy, getValue) {
+  if (!groupBy.length) return nodes;
+  let ordinal = 0;
+  const group = (items, level, path) => {
+    if (level >= groupBy.length) return items;
+    const columnId = groupBy[level];
+    const buckets = new Map();
+    for (const item of items) {
+      const value = getValue(item.rowIndex, columnId);
+      // Dates group by time, not identity; null and undefined are one group
+      const key = value instanceof Date ? `date:${value.getTime()}` : value ?? null;
+      const bucket = buckets.get(key);
+      if (bucket) bucket.push(item);else buckets.set(key, [item]);
+    }
+    const groups = [];
+    for (const bucket of buckets.values()) {
+      const value = getValue(bucket[0].rowIndex, columnId);
+      const valuePath = [...path, value];
+      const node = {
+        id: groupId(valuePath),
+        kind: 'group',
+        rowIndex: -1 - ordinal++,
+        group: {
+          columnId,
+          value,
+          count: bucket.length,
+          rowIndices: bucket.map(item => item.rowIndex)
+        },
+        children: []
+      };
+      node.children = group(bucket, level + 1, valuePath);
+      groups.push(node);
+    }
+    return groups;
+  };
+  return group(nodes, 0, []);
+}
+
+/** Compares group values: empty values last, numbers/dates numerically, text naturally. */
+function compareGroupValues(a, b) {
+  const aEmpty = a == null || a === '';
+  const bEmpty = b == null || b === '';
+  if (aEmpty || bEmpty) return aEmpty === bEmpty ? 0 : aEmpty ? 1 : -1;
+  if (a instanceof Date && b instanceof Date) return a.getTime() - b.getTime();
+  if (typeof a === 'number' && typeof b === 'number') return a - b;
+  if (typeof a === 'boolean' && typeof b === 'boolean') return Number(a) - Number(b);
+  return String(a).localeCompare(String(b), undefined, {
+    numeric: true,
+    sensitivity: 'base'
+  });
+}
+
+/**
+ * Sorts every level of the tree (stable; returns new arrays). Siblings are
+ * compared with `compare`; nodes it ranks equal keep their order.
+ */
+function sortRowTree(nodes, compare) {
+  return nodes.map((node, index) => ({
+    node,
+    index
+  })).sort((a, b) => compare(a.node, b.node) || a.index - b.index).map(({
+    node
+  }) => node.children.length ? {
+    ...node,
+    children: sortRowTree(node.children, compare)
+  } : node);
+}
+
+/** The visible rows: roots, and the children of expanded rows, depth first. */
+function flattenRowTree(roots, isExpanded) {
+  const result = [];
+  const visit = (nodes, depth, parentId) => {
+    const setSize = nodes.length;
+    nodes.forEach((node, index) => {
+      const hasChildren = node.children.length > 0 || !!node.canExpand;
+      const expanded = hasChildren && isExpanded(node);
+      result.push({
+        id: node.id,
+        kind: node.kind,
+        rowIndex: node.rowIndex,
+        group: node.group,
+        depth,
+        hasChildren,
+        isExpanded: expanded,
+        parentId,
+        posInSet: index + 1,
+        setSize
+      });
+      if (expanded) visit(node.children, depth + 1, node.id);
+    });
+  };
+  visit(roots, 0, null);
+  return result;
+}
+
+/** Ids of every node with children, by kind. */
+function collectExpandableIds(roots) {
+  const ids = {
+    row: [],
+    group: []
+  };
+  const visit = nodes => {
+    for (const node of nodes) {
+      if (!node.children.length && !node.canExpand) continue;
+      ids[node.kind].push(node.id);
+      visit(node.children);
+    }
+  };
+  visit(roots);
+  return ids;
+}
+
+/** Ancestors (outermost first) of the node with a data row index, or null if absent. */
+function findAncestors(roots, rowIndex) {
+  const path = [];
+  const visit = nodes => {
+    for (const node of nodes) {
+      if (node.rowIndex === rowIndex) return true;
+      path.push(node);
+      if (visit(node.children)) return true;
+      path.pop();
+    }
+    return false;
+  };
+  return visit(roots) ? path : null;
+}
+
+export { buildFlatRows, buildRowTree, collectExpandableIds, compareGroupValues, findAncestors, flattenRowTree, groupId, groupRowTree, isNestedRowSource, sortRowTree };
+//# sourceMappingURL=row-tree.js.map

package/dist/utils/data-grid/row-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"row-tree.js","sources":["../../../src/utils/data-grid/row-tree.ts"],"sourcesContent":["/**\n * Row tree model for EuiDataGrid's nested rows (`@rowTree`) and row grouping\n * (`@grouping`). Ember EUI extension: upstream EUI has neither.\n *\n * Framework free: builds a tree of data rows (from nested `children` arrays\n * or flat `parentId` references), optionally groups rows by column values,\n * sorts siblings, and flattens the tree into the list of visible rows given\n * the expanded ids.\n */\n\nexport type RowTreeNodeKind = 'row' | 'group';\n\nexport interface RowTreeGroup {\n  /** The grouped column. */\n  columnId: string;\n  /** The column value shared by the group's rows. */\n  value: unknown;\n  /** Number of grouped rows (data rows at the grouped level, in all subgroups). */\n  count: number;\n  /** Data row indexes of the grouped rows. */\n  rowIndices: number[];\n}\n\nexport interface RowTreeNode {\n  id: string;\n  kind: RowTreeNodeKind;\n  /**\n   * Data row index for rows; a stable negative index (`-1`, `-2`, …) for\n   * groups, so per-row grid state (heights, cell props) never collides with\n   * data rows.\n   */\n  rowIndex: number;\n  group?: RowTreeGroup;\n  children: RowTreeNode[];\n  /** Shows a toggle although no children are loaded yet (lazy loading). */\n  canExpand?: boolean;\n}\n\nexport interface RowTreeVisibleRow {\n  id: string;\n  kind: RowTreeNodeKind;\n  rowIndex: number;\n  group?: RowTreeGroup;\n  /** 0 for root rows. */\n  depth: number;\n  hasChildren: boolean;\n  isExpanded: boolean;\n  parentId: string | null;\n  /** 1-based position among its siblings. */\n  posInSet: number;\n  setSize: number;\n}\n\nexport type RowId = string | number;\n\nexport interface RowTreeSource<T = any> {\n  rows: T[];\n  /** Child rows of a row (nested form). Defaults to `row.children` when it is an array. */\n  getChildren?: (row: T) => T[] | null | undefined;\n  /** Parent row id of a row (flat form). Defaults to `row.parentId ?? row.parent`. */\n  getParentId?: (row: T) => RowId | null | undefined;\n  /** Row id. Defaults to `row.id`, else the row's index. */\n  getRowId?: (row: T, rowIndex: number) => RowId | null | undefined;\n  /**\n   * Whether a row can expand before its children are loaded (lazy loading).\n   * Defaults to `row.hasChildren === true`.\n   */\n  hasChildren?: (row: T) => boolean;\n}\n\nexport interface BuiltRowTree {\n  roots: RowTreeNode[];\n  /** Row objects by data row index (pre-order for nested rows, array index for flat rows). */\n  rows: unknown[];\n}\n\nconst isObject = (value: unknown): value is Record<string, unknown> =>\n  typeof value === 'object' && value !== null;\n\nfunction defaultChildren(row: unknown): unknown[] | undefined {\n  return isObject(row) && Array.isArray(row['children'])\n    ? (row['children'] as unknown[])\n    : undefined;\n}\n\nfunction defaultParentId(row: unknown): RowId | null | undefined {\n  if (!isObject(row)) return undefined;\n  return (row['parentId'] ?? row['parent']) as RowId | null | undefined;\n}\n\nfunction defaultHasChildren(row: unknown): boolean {\n  return isObject(row) && row['hasChildren'] === true;\n}\n\nfunction defaultRowId(row: unknown): RowId | null | undefined {\n  return isObject(row) ? (row['id'] as RowId | null | undefined) : undefined;\n}\n\n/** Whether rows nest through `children` (otherwise they reference a `parentId`). */\nexport function isNestedRowSource(source: RowTreeSource): boolean {\n  if (source.getChildren) return true;\n  if (source.getParentId) return false;\n  return source.rows.some((row) => defaultChildren(row) !== undefined);\n}\n\n/**\n * Builds the data row tree. Nested rows get data row indexes in pre-order\n * (parents before children); flat rows keep their array index.\n */\nexport function buildRowTree<T>(source: RowTreeSource<T>): BuiltRowTree {\n  const getRowId = source.getRowId ?? defaultRowId;\n  const idOf = (row: T, rowIndex: number): string => {\n    const id = getRowId(row, rowIndex);\n    return id == null ? String(rowIndex) : String(id);\n  };\n  const hasChildren = (source.hasChildren ?? defaultHasChildren) as (row: T) => boolean;\n\n  if (isNestedRowSource(source)) {\n    const getChildren = (source.getChildren ?? defaultChildren) as (row: T) => T[] | null | undefined;\n    const rows: unknown[] = [];\n    const seen = new Set<unknown>();\n    const visit = (row: T): RowTreeNode | null => {\n      if (isObject(row)) {\n        if (seen.has(row)) return null; // cycle or shared row\n        seen.add(row);\n      }\n      const rowIndex = rows.length;\n      rows.push(row);\n      const node: RowTreeNode = {\n        id: idOf(row, rowIndex),\n        kind: 'row',\n        rowIndex,\n        children: []\n      };\n      if (hasChildren(row)) node.canExpand = true;\n      for (const child of getChildren(row) ?? []) {\n        const childNode = visit(child);\n        if (childNode) node.children.push(childNode);\n      }\n      return node;\n    };\n    const roots: RowTreeNode[] = [];\n    for (const row of source.rows) {\n      const node = visit(row);\n      if (node) roots.push(node);\n    }\n    return { roots, rows };\n  }\n\n  const getParentId = (source.getParentId ?? defaultParentId) as (row: T) => RowId | null | undefined;\n  const nodes = source.rows.map(\n    (row, rowIndex): RowTreeNode => ({\n      id: idOf(row, rowIndex),\n      kind: 'row',\n      rowIndex,\n      children: [],\n      ...(hasChildren(row) ? { canExpand: true } : {})\n    })\n  );\n  const byId = new Map<string, RowTreeNode>();\n  for (const node of nodes) if (!byId.has(node.id)) byId.set(node.id, node);\n  const parentOf = new Map<RowTreeNode, RowTreeNode>();\n  for (const [rowIndex, node] of nodes.entries()) {\n    const parentId = getParentId(source.rows[rowIndex]!);\n    if (parentId == null) continue;\n    const parent = byId.get(String(parentId));\n    if (parent && parent !== node) parentOf.set(node, parent);\n  }\n  // break cycles: a row whose ancestry loops back becomes a root\n  for (const node of nodes) {\n    const ancestors = new Set<RowTreeNode>([node]);\n    let parent = parentOf.get(node);\n    while (parent) {\n      if (ancestors.has(parent)) {\n        parentOf.delete(node);\n        break;\n      }\n      ancestors.add(parent);\n      parent = parentOf.get(parent);\n    }\n  }\n  const roots: RowTreeNode[] = [];\n  for (const node of nodes) {\n    const parent = parentOf.get(node);\n    if (parent) parent.children.push(node);\n    else roots.push(node);\n  }\n  return { roots, rows: source.rows };\n}\n\n/** Root nodes for `rowCount` flat rows (grouping without `rows`). */\nexport function buildFlatRows(rowCount: number): RowTreeNode[] {\n  return Array.from({ length: Math.max(0, rowCount) }, (_, rowIndex) => ({\n    id: String(rowIndex),\n    kind: 'row' as const,\n    rowIndex,\n    children: []\n  }));\n}\n\n/** Identifier of a group: its column values from the outermost group down. */\nexport function groupId(values: unknown[]): string {\n  return `group:${JSON.stringify(values.map((value) => (value === undefined ? null : value)))}`;\n}\n\n/**\n * Groups rows by the values of `groupBy` columns (outermost first). Groups\n * keep the order in which their values first appear; sort them with\n * `sortRowTree`. Grouped rows keep their own children.\n */\nexport function groupRowTree(\n  nodes: RowTreeNode[],\n  groupBy: string[],\n  getValue: (rowIndex: number, columnId: string) => unknown\n): RowTreeNode[] {\n  if (!groupBy.length) return nodes;\n  let ordinal = 0;\n  const group = (items: RowTreeNode[], level: number, path: unknown[]): RowTreeNode[] => {\n    if (level >= groupBy.length) return items;\n    const columnId = groupBy[level]!;\n    const buckets = new Map<unknown, RowTreeNode[]>();\n    for (const item of items) {\n      const value = getValue(item.rowIndex, columnId);\n      // Dates group by time, not identity; null and undefined are one group\n      const key = value instanceof Date ? `date:${value.getTime()}` : (value ?? null);\n      const bucket = buckets.get(key);\n      if (bucket) bucket.push(item);\n      else buckets.set(key, [item]);\n    }\n    const groups: RowTreeNode[] = [];\n    for (const bucket of buckets.values()) {\n      const value = getValue(bucket[0]!.rowIndex, columnId);\n      const valuePath = [...path, value];\n      const node: RowTreeNode = {\n        id: groupId(valuePath),\n        kind: 'group',\n        rowIndex: -1 - ordinal++,\n        group: {\n          columnId,\n          value,\n          count: bucket.length,\n          rowIndices: bucket.map((item) => item.rowIndex)\n        },\n        children: []\n      };\n      node.children = group(bucket, level + 1, valuePath);\n      groups.push(node);\n    }\n    return groups;\n  };\n  return group(nodes, 0, []);\n}\n\n/** Compares group values: empty values last, numbers/dates numerically, text naturally. */\nexport function compareGroupValues(a: unknown, b: unknown): number {\n  const aEmpty = a == null || a === '';\n  const bEmpty = b == null || b === '';\n  if (aEmpty || bEmpty) return aEmpty === bEmpty ? 0 : aEmpty ? 1 : -1;\n  if (a instanceof Date && b instanceof Date) return a.getTime() - b.getTime();\n  if (typeof a === 'number' && typeof b === 'number') return a - b;\n  if (typeof a === 'boolean' && typeof b === 'boolean') return Number(a) - Number(b);\n  return String(a as string).localeCompare(String(b as string), undefined, {\n    numeric: true,\n    sensitivity: 'base'\n  });\n}\n\n/**\n * Sorts every level of the tree (stable; returns new arrays). Siblings are\n * compared with `compare`; nodes it ranks equal keep their order.\n */\nexport function sortRowTree(\n  nodes: RowTreeNode[],\n  compare: (a: RowTreeNode, b: RowTreeNode) => number\n): RowTreeNode[] {\n  return nodes\n    .map((node, index) => ({ node, index }))\n    .sort((a, b) => compare(a.node, b.node) || a.index - b.index)\n    .map(({ node }) =>\n      node.children.length ? { ...node, children: sortRowTree(node.children, compare) } : node\n    );\n}\n\n/** The visible rows: roots, and the children of expanded rows, depth first. */\nexport function flattenRowTree(\n  roots: RowTreeNode[],\n  isExpanded: (node: RowTreeNode) => boolean\n): RowTreeVisibleRow[] {\n  const result: RowTreeVisibleRow[] = [];\n  const visit = (nodes: RowTreeNode[], depth: number, parentId: string | null) => {\n    const setSize = nodes.length;\n    nodes.forEach((node, index) => {\n      const hasChildren = node.children.length > 0 || !!node.canExpand;\n      const expanded = hasChildren && isExpanded(node);\n      result.push({\n        id: node.id,\n        kind: node.kind,\n        rowIndex: node.rowIndex,\n        group: node.group,\n        depth,\n        hasChildren,\n        isExpanded: expanded,\n        parentId,\n        posInSet: index + 1,\n        setSize\n      });\n      if (expanded) visit(node.children, depth + 1, node.id);\n    });\n  };\n  visit(roots, 0, null);\n  return result;\n}\n\n/** Ids of every node with children, by kind. */\nexport function collectExpandableIds(roots: RowTreeNode[]): { row: string[]; group: string[] } {\n  const ids = { row: [] as string[], group: [] as string[] };\n  const visit = (nodes: RowTreeNode[]) => {\n    for (const node of nodes) {\n      if (!node.children.length && !node.canExpand) continue;\n      ids[node.kind].push(node.id);\n      visit(node.children);\n    }\n  };\n  visit(roots);\n  return ids;\n}\n\n/** Ancestors (outermost first) of the node with a data row index, or null if absent. */\nexport function findAncestors(roots: RowTreeNode[], rowIndex: number): RowTreeNode[] | null {\n  const path: RowTreeNode[] = [];\n  const visit = (nodes: RowTreeNode[]): boolean => {\n    for (const node of nodes) {\n      if (node.rowIndex === rowIndex) return true;\n      path.push(node);\n      if (visit(node.children)) return true;\n      path.pop();\n    }\n    return false;\n  };\n  return visit(roots) ? path : null;\n}\n"],"names":["isObject","value","defaultChildren","row","Array","isArray","undefined","defaultParentId","defaultHasChildren","defaultRowId","isNestedRowSource","source","getChildren","getParentId","rows","some","buildRowTree","getRowId","idOf","rowIndex","id","String","hasChildren","seen","Set","visit","has","add","length","push","node","kind","children","canExpand","child","childNode","roots","nodes","map","byId","Map","set","parentOf","entries","parentId","parent","get","ancestors","delete","buildFlatRows","rowCount","from","Math","max","_","groupId","values","JSON","stringify","groupRowTree","groupBy","getValue","ordinal","group","items","level","path","columnId","buckets","item","key","Date","getTime","bucket","groups","valuePath","count","rowIndices","compareGroupValues","a","b","aEmpty","bEmpty","Number","localeCompare","numeric","sensitivity","sortRowTree","compare","index","sort","flattenRowTree","isExpanded","result","depth","setSize","forEach","expanded","posInSet","collectExpandableIds","ids","findAncestors","pop"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAoEA,MAAMA,QAAQ,GAAIC,KAAc,IAC9B,OAAOA,KAAK,KAAK,QAAQ,IAAIA,KAAK,KAAK,IAAI;AAE7C,SAASC,eAAeA,CAACC,GAAY,EAAyB;EAC5D,OAAOH,QAAQ,CAACG,GAAG,CAAC,IAAIC,KAAK,CAACC,OAAO,CAACF,GAAG,CAAC,UAAU,CAAC,CAAC,GACjDA,GAAG,CAAC,UAAU,CAAC,GAChBG,SAAS;AACf;AAEA,SAASC,eAAeA,CAACJ,GAAY,EAA4B;AAC/D,EAAA,IAAI,CAACH,QAAQ,CAACG,GAAG,CAAC,EAAE,OAAOG,SAAS;EACpC,OAAQH,GAAG,CAAC,UAAU,CAAC,IAAIA,GAAG,CAAC,QAAQ,CAAC;AAC1C;AAEA,SAASK,kBAAkBA,CAACL,GAAY,EAAW;EACjD,OAAOH,QAAQ,CAACG,GAAG,CAAC,IAAIA,GAAG,CAAC,aAAa,CAAC,KAAK,IAAI;AACrD;AAEA,SAASM,YAAYA,CAACN,GAAY,EAA4B;EAC5D,OAAOH,QAAQ,CAACG,GAAG,CAAC,GAAIA,GAAG,CAAC,IAAI,CAAC,GAAgCG,SAAS;AAC5E;;AAEA;AACO,SAASI,iBAAiBA,CAACC,MAAqB,EAAW;AAChE,EAAA,IAAIA,MAAM,CAACC,WAAW,EAAE,OAAO,IAAI;AACnC,EAAA,IAAID,MAAM,CAACE,WAAW,EAAE,OAAO,KAAK;AACpC,EAAA,OAAOF,MAAM,CAACG,IAAI,CAACC,IAAI,CAAEZ,GAAG,IAAKD,eAAe,CAACC,GAAG,CAAC,KAAKG,SAAS,CAAC;AACtE;;AAEA;AACA;AACA;AACA;AACO,SAASU,YAAYA,CAAIL,MAAwB,EAAgB;AACtE,EAAA,MAAMM,QAAQ,GAAGN,MAAM,CAACM,QAAQ,IAAIR,YAAY;AAChD,EAAA,MAAMS,IAAI,GAAGA,CAACf,GAAM,EAAEgB,QAAgB,KAAa;AACjD,IAAA,MAAMC,EAAE,GAAGH,QAAQ,CAACd,GAAG,EAAEgB,QAAQ,CAAC;AAClC,IAAA,OAAOC,EAAE,IAAI,IAAI,GAAGC,MAAM,CAACF,QAAQ,CAAC,GAAGE,MAAM,CAACD,EAAE,CAAC;EACnD,CAAC;AACD,EAAA,MAAME,WAAW,GAAIX,MAAM,CAACW,WAAW,IAAId,kBAA0C;AAErF,EAAA,IAAIE,iBAAiB,CAACC,MAAM,CAAC,EAAE;AAC7B,IAAA,MAAMC,WAAW,GAAID,MAAM,CAACC,WAAW,IAAIV,eAAsD;IACjG,MAAMY,IAAe,GAAG,EAAE;AAC1B,IAAA,MAAMS,IAAI,GAAG,IAAIC,GAAG,EAAW;IAC/B,MAAMC,KAAK,GAAItB,GAAM,IAAyB;AAC5C,MAAA,IAAIH,QAAQ,CAACG,GAAG,CAAC,EAAE;QACjB,IAAIoB,IAAI,CAACG,GAAG,CAACvB,GAAG,CAAC,EAAE,OAAO,IAAI,CAAC;AAC/BoB,QAAAA,IAAI,CAACI,GAAG,CAACxB,GAAG,CAAC;AACf,MAAA;AACA,MAAA,MAAMgB,QAAQ,GAAGL,IAAI,CAACc,MAAM;AAC5Bd,MAAAA,IAAI,CAACe,IAAI,CAAC1B,GAAG,CAAC;AACd,MAAA,MAAM2B,IAAiB,GAAG;AACxBV,QAAAA,EAAE,EAAEF,IAAI,CAACf,GAAG,EAAEgB,QAAQ,CAAC;AACvBY,QAAAA,IAAI,EAAE,KAAK;QACXZ,QAAQ;AACRa,QAAAA,QAAQ,EAAE;OACX;MACD,IAAIV,WAAW,CAACnB,GAAG,CAAC,EAAE2B,IAAI,CAACG,SAAS,GAAG,IAAI;MAC3C,KAAK,MAAMC,KAAK,IAAItB,WAAW,CAACT,GAAG,CAAC,IAAI,EAAE,EAAE;AAC1C,QAAA,MAAMgC,SAAS,GAAGV,KAAK,CAACS,KAAK,CAAC;QAC9B,IAAIC,SAAS,EAAEL,IAAI,CAACE,QAAQ,CAACH,IAAI,CAACM,SAAS,CAAC;AAC9C,MAAA;AACA,MAAA,OAAOL,IAAI;IACb,CAAC;IACD,MAAMM,KAAoB,GAAG,EAAE;AAC/B,IAAA,KAAK,MAAMjC,GAAG,IAAIQ,MAAM,CAACG,IAAI,EAAE;AAC7B,MAAA,MAAMgB,IAAI,GAAGL,KAAK,CAACtB,GAAG,CAAC;AACvB,MAAA,IAAI2B,IAAI,EAAEM,KAAK,CAACP,IAAI,CAACC,IAAI,CAAC;AAC5B,IAAA;IACA,OAAO;MAAEM,KAAK;AAAEtB,MAAAA;KAAM;AACxB,EAAA;AAEA,EAAA,MAAMD,WAAW,GAAIF,MAAM,CAACE,WAAW,IAAIN,eAAwD;AACnG,EAAA,MAAM8B,KAAK,GAAG1B,MAAM,CAACG,IAAI,CAACwB,GAAG,CAC3B,CAACnC,GAAG,EAAEgB,QAAQ,MAAmB;AAC/BC,IAAAA,EAAE,EAAEF,IAAI,CAACf,GAAG,EAAEgB,QAAQ,CAAC;AACvBY,IAAAA,IAAI,EAAE,KAAK;IACXZ,QAAQ;AACRa,IAAAA,QAAQ,EAAE,EAAE;AACZ,IAAA,IAAIV,WAAW,CAACnB,GAAG,CAAC,GAAG;AAAE8B,MAAAA,SAAS,EAAE;KAAM,GAAG,EAAE;AACjD,GAAC,CACH,CAAC;AACD,EAAA,MAAMM,IAAI,GAAG,IAAIC,GAAG,EAAuB;EAC3C,KAAK,MAAMV,IAAI,IAAIO,KAAK,EAAE,IAAI,CAACE,IAAI,CAACb,GAAG,CAACI,IAAI,CAACV,EAAE,CAAC,EAAEmB,IAAI,CAACE,GAAG,CAACX,IAAI,CAACV,EAAE,EAAEU,IAAI,CAAC;AACzE,EAAA,MAAMY,QAAQ,GAAG,IAAIF,GAAG,EAA4B;AACpD,EAAA,KAAK,MAAM,CAACrB,QAAQ,EAAEW,IAAI,CAAC,IAAIO,KAAK,CAACM,OAAO,EAAE,EAAE;IAC9C,MAAMC,QAAQ,GAAG/B,WAAW,CAACF,MAAM,CAACG,IAAI,CAACK,QAAQ,CAAE,CAAC;IACpD,IAAIyB,QAAQ,IAAI,IAAI,EAAE;IACtB,MAAMC,MAAM,GAAGN,IAAI,CAACO,GAAG,CAACzB,MAAM,CAACuB,QAAQ,CAAC,CAAC;AACzC,IAAA,IAAIC,MAAM,IAAIA,MAAM,KAAKf,IAAI,EAAEY,QAAQ,CAACD,GAAG,CAACX,IAAI,EAAEe,MAAM,CAAC;AAC3D,EAAA;AACA;AACA,EAAA,KAAK,MAAMf,IAAI,IAAIO,KAAK,EAAE;IACxB,MAAMU,SAAS,GAAG,IAAIvB,GAAG,CAAc,CAACM,IAAI,CAAC,CAAC;AAC9C,IAAA,IAAIe,MAAM,GAAGH,QAAQ,CAACI,GAAG,CAAChB,IAAI,CAAC;AAC/B,IAAA,OAAOe,MAAM,EAAE;AACb,MAAA,IAAIE,SAAS,CAACrB,GAAG,CAACmB,MAAM,CAAC,EAAE;AACzBH,QAAAA,QAAQ,CAACM,MAAM,CAAClB,IAAI,CAAC;AACrB,QAAA;AACF,MAAA;AACAiB,MAAAA,SAAS,CAACpB,GAAG,CAACkB,MAAM,CAAC;AACrBA,MAAAA,MAAM,GAAGH,QAAQ,CAACI,GAAG,CAACD,MAAM,CAAC;AAC/B,IAAA;AACF,EAAA;EACA,MAAMT,KAAoB,GAAG,EAAE;AAC/B,EAAA,KAAK,MAAMN,IAAI,IAAIO,KAAK,EAAE;AACxB,IAAA,MAAMQ,MAAM,GAAGH,QAAQ,CAACI,GAAG,CAAChB,IAAI,CAAC;AACjC,IAAA,IAAIe,MAAM,EAAEA,MAAM,CAACb,QAAQ,CAACH,IAAI,CAACC,IAAI,CAAC,CAAC,KAClCM,KAAK,CAACP,IAAI,CAACC,IAAI,CAAC;AACvB,EAAA;EACA,OAAO;IAAEM,KAAK;IAAEtB,IAAI,EAAEH,MAAM,CAACG;GAAM;AACrC;;AAEA;AACO,SAASmC,aAAaA,CAACC,QAAgB,EAAiB;EAC7D,OAAO9C,KAAK,CAAC+C,IAAI,CAAC;AAAEvB,IAAAA,MAAM,EAAEwB,IAAI,CAACC,GAAG,CAAC,CAAC,EAAEH,QAAQ;AAAE,GAAC,EAAE,CAACI,CAAC,EAAEnC,QAAQ,MAAM;AACrEC,IAAAA,EAAE,EAAEC,MAAM,CAACF,QAAQ,CAAC;AACpBY,IAAAA,IAAI,EAAE,KAAc;IACpBZ,QAAQ;AACRa,IAAAA,QAAQ,EAAE;AACZ,GAAC,CAAC,CAAC;AACL;;AAEA;AACO,SAASuB,OAAOA,CAACC,MAAiB,EAAU;EACjD,OAAO,CAAA,MAAA,EAASC,IAAI,CAACC,SAAS,CAACF,MAAM,CAAClB,GAAG,CAAErC,KAAK,IAAMA,KAAK,KAAKK,SAAS,GAAG,IAAI,GAAGL,KAAM,CAAC,CAAC,CAAA,CAAE;AAC/F;;AAEA;AACA;AACA;AACA;AACA;AACO,SAAS0D,YAAYA,CAC1BtB,KAAoB,EACpBuB,OAAiB,EACjBC,QAAyD,EAC1C;AACf,EAAA,IAAI,CAACD,OAAO,CAAChC,MAAM,EAAE,OAAOS,KAAK;EACjC,IAAIyB,OAAO,GAAG,CAAC;EACf,MAAMC,KAAK,GAAGA,CAACC,KAAoB,EAAEC,KAAa,EAAEC,IAAe,KAAoB;AACrF,IAAA,IAAID,KAAK,IAAIL,OAAO,CAAChC,MAAM,EAAE,OAAOoC,KAAK;AACzC,IAAA,MAAMG,QAAQ,GAAGP,OAAO,CAACK,KAAK,CAAE;AAChC,IAAA,MAAMG,OAAO,GAAG,IAAI5B,GAAG,EAA0B;AACjD,IAAA,KAAK,MAAM6B,IAAI,IAAIL,KAAK,EAAE;MACxB,MAAM/D,KAAK,GAAG4D,QAAQ,CAACQ,IAAI,CAAClD,QAAQ,EAAEgD,QAAQ,CAAC;AAC/C;AACA,MAAA,MAAMG,GAAG,GAAGrE,KAAK,YAAYsE,IAAI,GAAG,CAAA,KAAA,EAAQtE,KAAK,CAACuE,OAAO,EAAE,CAAA,CAAE,GAAIvE,KAAK,IAAI,IAAK;AAC/E,MAAA,MAAMwE,MAAM,GAAGL,OAAO,CAACtB,GAAG,CAACwB,GAAG,CAAC;AAC/B,MAAA,IAAIG,MAAM,EAAEA,MAAM,CAAC5C,IAAI,CAACwC,IAAI,CAAC,CAAC,KACzBD,OAAO,CAAC3B,GAAG,CAAC6B,GAAG,EAAE,CAACD,IAAI,CAAC,CAAC;AAC/B,IAAA;IACA,MAAMK,MAAqB,GAAG,EAAE;IAChC,KAAK,MAAMD,MAAM,IAAIL,OAAO,CAACZ,MAAM,EAAE,EAAE;AACrC,MAAA,MAAMvD,KAAK,GAAG4D,QAAQ,CAACY,MAAM,CAAC,CAAC,CAAC,CAAEtD,QAAQ,EAAEgD,QAAQ,CAAC;AACrD,MAAA,MAAMQ,SAAS,GAAG,CAAC,GAAGT,IAAI,EAAEjE,KAAK,CAAC;AAClC,MAAA,MAAM6B,IAAiB,GAAG;AACxBV,QAAAA,EAAE,EAAEmC,OAAO,CAACoB,SAAS,CAAC;AACtB5C,QAAAA,IAAI,EAAE,OAAO;AACbZ,QAAAA,QAAQ,EAAE,EAAE,GAAG2C,OAAO,EAAE;AACxBC,QAAAA,KAAK,EAAE;UACLI,QAAQ;UACRlE,KAAK;UACL2E,KAAK,EAAEH,MAAM,CAAC7C,MAAM;UACpBiD,UAAU,EAAEJ,MAAM,CAACnC,GAAG,CAAE+B,IAAI,IAAKA,IAAI,CAAClD,QAAQ;SAC/C;AACDa,QAAAA,QAAQ,EAAE;OACX;AACDF,MAAAA,IAAI,CAACE,QAAQ,GAAG+B,KAAK,CAACU,MAAM,EAAER,KAAK,GAAG,CAAC,EAAEU,SAAS,CAAC;AACnDD,MAAAA,MAAM,CAAC7C,IAAI,CAACC,IAAI,CAAC;AACnB,IAAA;AACA,IAAA,OAAO4C,MAAM;EACf,CAAC;AACD,EAAA,OAAOX,KAAK,CAAC1B,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;AAC5B;;AAEA;AACO,SAASyC,kBAAkBA,CAACC,CAAU,EAAEC,CAAU,EAAU;EACjE,MAAMC,MAAM,GAAGF,CAAC,IAAI,IAAI,IAAIA,CAAC,KAAK,EAAE;EACpC,MAAMG,MAAM,GAAGF,CAAC,IAAI,IAAI,IAAIA,CAAC,KAAK,EAAE;AACpC,EAAA,IAAIC,MAAM,IAAIC,MAAM,EAAE,OAAOD,MAAM,KAAKC,MAAM,GAAG,CAAC,GAAGD,MAAM,GAAG,CAAC,GAAG,EAAE;AACpE,EAAA,IAAIF,CAAC,YAAYR,IAAI,IAAIS,CAAC,YAAYT,IAAI,EAAE,OAAOQ,CAAC,CAACP,OAAO,EAAE,GAAGQ,CAAC,CAACR,OAAO,EAAE;AAC5E,EAAA,IAAI,OAAOO,CAAC,KAAK,QAAQ,IAAI,OAAOC,CAAC,KAAK,QAAQ,EAAE,OAAOD,CAAC,GAAGC,CAAC;AAChE,EAAA,IAAI,OAAOD,CAAC,KAAK,SAAS,IAAI,OAAOC,CAAC,KAAK,SAAS,EAAE,OAAOG,MAAM,CAACJ,CAAC,CAAC,GAAGI,MAAM,CAACH,CAAC,CAAC;AAClF,EAAA,OAAO3D,MAAM,CAAC0D,CAAW,CAAC,CAACK,aAAa,CAAC/D,MAAM,CAAC2D,CAAW,CAAC,EAAE1E,SAAS,EAAE;AACvE+E,IAAAA,OAAO,EAAE,IAAI;AACbC,IAAAA,WAAW,EAAE;AACf,GAAC,CAAC;AACJ;;AAEA;AACA;AACA;AACA;AACO,SAASC,WAAWA,CACzBlD,KAAoB,EACpBmD,OAAmD,EACpC;EACf,OAAOnD,KAAK,CACTC,GAAG,CAAC,CAACR,IAAI,EAAE2D,KAAK,MAAM;IAAE3D,IAAI;AAAE2D,IAAAA;AAAM,GAAC,CAAC,CAAC,CACvCC,IAAI,CAAC,CAACX,CAAC,EAAEC,CAAC,KAAKQ,OAAO,CAACT,CAAC,CAACjD,IAAI,EAAEkD,CAAC,CAAClD,IAAI,CAAC,IAAIiD,CAAC,CAACU,KAAK,GAAGT,CAAC,CAACS,KAAK,CAAC,CAC5DnD,GAAG,CAAC,CAAC;AAAER,IAAAA;AAAK,GAAC,KACZA,IAAI,CAACE,QAAQ,CAACJ,MAAM,GAAG;AAAE,IAAA,GAAGE,IAAI;AAAEE,IAAAA,QAAQ,EAAEuD,WAAW,CAACzD,IAAI,CAACE,QAAQ,EAAEwD,OAAO;GAAG,GAAG1D,IACtF,CAAC;AACL;;AAEA;AACO,SAAS6D,cAAcA,CAC5BvD,KAAoB,EACpBwD,UAA0C,EACrB;EACrB,MAAMC,MAA2B,GAAG,EAAE;EACtC,MAAMpE,KAAK,GAAGA,CAACY,KAAoB,EAAEyD,KAAa,EAAElD,QAAuB,KAAK;AAC9E,IAAA,MAAMmD,OAAO,GAAG1D,KAAK,CAACT,MAAM;AAC5BS,IAAAA,KAAK,CAAC2D,OAAO,CAAC,CAAClE,IAAI,EAAE2D,KAAK,KAAK;AAC7B,MAAA,MAAMnE,WAAW,GAAGQ,IAAI,CAACE,QAAQ,CAACJ,MAAM,GAAG,CAAC,IAAI,CAAC,CAACE,IAAI,CAACG,SAAS;AAChE,MAAA,MAAMgE,QAAQ,GAAG3E,WAAW,IAAIsE,UAAU,CAAC9D,IAAI,CAAC;MAChD+D,MAAM,CAAChE,IAAI,CAAC;QACVT,EAAE,EAAEU,IAAI,CAACV,EAAE;QACXW,IAAI,EAAED,IAAI,CAACC,IAAI;QACfZ,QAAQ,EAAEW,IAAI,CAACX,QAAQ;QACvB4C,KAAK,EAAEjC,IAAI,CAACiC,KAAK;QACjB+B,KAAK;QACLxE,WAAW;AACXsE,QAAAA,UAAU,EAAEK,QAAQ;QACpBrD,QAAQ;QACRsD,QAAQ,EAAET,KAAK,GAAG,CAAC;AACnBM,QAAAA;AACF,OAAC,CAAC;AACF,MAAA,IAAIE,QAAQ,EAAExE,KAAK,CAACK,IAAI,CAACE,QAAQ,EAAE8D,KAAK,GAAG,CAAC,EAAEhE,IAAI,CAACV,EAAE,CAAC;AACxD,IAAA,CAAC,CAAC;EACJ,CAAC;AACDK,EAAAA,KAAK,CAACW,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC;AACrB,EAAA,OAAOyD,MAAM;AACf;;AAEA;AACO,SAASM,oBAAoBA,CAAC/D,KAAoB,EAAsC;AAC7F,EAAA,MAAMgE,GAAG,GAAG;AAAEjG,IAAAA,GAAG,EAAE,EAAc;AAAE4D,IAAAA,KAAK,EAAE;GAAgB;EAC1D,MAAMtC,KAAK,GAAIY,KAAoB,IAAK;AACtC,IAAA,KAAK,MAAMP,IAAI,IAAIO,KAAK,EAAE;MACxB,IAAI,CAACP,IAAI,CAACE,QAAQ,CAACJ,MAAM,IAAI,CAACE,IAAI,CAACG,SAAS,EAAE;MAC9CmE,GAAG,CAACtE,IAAI,CAACC,IAAI,CAAC,CAACF,IAAI,CAACC,IAAI,CAACV,EAAE,CAAC;AAC5BK,MAAAA,KAAK,CAACK,IAAI,CAACE,QAAQ,CAAC;AACtB,IAAA;EACF,CAAC;EACDP,KAAK,CAACW,KAAK,CAAC;AACZ,EAAA,OAAOgE,GAAG;AACZ;;AAEA;AACO,SAASC,aAAaA,CAACjE,KAAoB,EAAEjB,QAAgB,EAAwB;EAC1F,MAAM+C,IAAmB,GAAG,EAAE;EAC9B,MAAMzC,KAAK,GAAIY,KAAoB,IAAc;AAC/C,IAAA,KAAK,MAAMP,IAAI,IAAIO,KAAK,EAAE;AACxB,MAAA,IAAIP,IAAI,CAACX,QAAQ,KAAKA,QAAQ,EAAE,OAAO,IAAI;AAC3C+C,MAAAA,IAAI,CAACrC,IAAI,CAACC,IAAI,CAAC;MACf,IAAIL,KAAK,CAACK,IAAI,CAACE,QAAQ,CAAC,EAAE,OAAO,IAAI;MACrCkC,IAAI,CAACoC,GAAG,EAAE;AACZ,IAAA;AACA,IAAA,OAAO,KAAK;EACd,CAAC;AACD,EAAA,OAAO7E,KAAK,CAACW,KAAK,CAAC,GAAG8B,IAAI,GAAG,IAAI;AACnC;;"}

package/dist/utils/data-grid/scheduling.js

@@ -0,0 +1,34 @@
+import { isDestroying, isDestroyed } from '@ember/destroyable';
+import { schedule } from '@ember/runloop';
+
+/**
+ * Run `fn` after the current render. Modifiers install during the render
+ * transaction, so measurements they take must update tracked state later
+ * (Ember forbids updating values already consumed by the same render).
+ */
+function afterRender(owner, fn) {
+  schedule('afterRender', () => {
+    if (isDestroying(owner) || isDestroyed(owner)) return;
+    fn();
+  });
+}
+
+/**
+ * Observe element sizes; the callback runs on the next animation frame so
+ * layout changes it causes never trigger "ResizeObserver loop" errors.
+ */
+function observeResize(elements, callback) {
+  let frame = 0;
+  const observer = new ResizeObserver(() => {
+    cancelAnimationFrame(frame);
+    frame = requestAnimationFrame(callback);
+  });
+  for (const element of elements) observer.observe(element);
+  return () => {
+    cancelAnimationFrame(frame);
+    observer.disconnect();
+  };
+}
+
+export { afterRender, observeResize };
+//# sourceMappingURL=scheduling.js.map

package/dist/utils/data-grid/scheduling.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduling.js","sources":["../../../src/utils/data-grid/scheduling.ts"],"sourcesContent":["import { isDestroyed, isDestroying } from '@ember/destroyable';\nimport { schedule } from '@ember/runloop';\n\n/**\n * Run `fn` after the current render. Modifiers install during the render\n * transaction, so measurements they take must update tracked state later\n * (Ember forbids updating values already consumed by the same render).\n */\nexport function afterRender(owner: object, fn: () => void): void {\n  schedule('afterRender', () => {\n    if (isDestroying(owner) || isDestroyed(owner)) return;\n    fn();\n  });\n}\n\n/**\n * Observe element sizes; the callback runs on the next animation frame so\n * layout changes it causes never trigger \"ResizeObserver loop\" errors.\n */\nexport function observeResize(\n  elements: Element[],\n  callback: () => void\n): () => void {\n  let frame = 0;\n  const observer = new ResizeObserver(() => {\n    cancelAnimationFrame(frame);\n    frame = requestAnimationFrame(callback);\n  });\n  for (const element of elements) observer.observe(element);\n  return () => {\n    cancelAnimationFrame(frame);\n    observer.disconnect();\n  };\n}\n"],"names":["afterRender","owner","fn","schedule","isDestroying","isDestroyed","observeResize","elements","callback","frame","observer","ResizeObserver","cancelAnimationFrame","requestAnimationFrame","element","observe","disconnect"],"mappings":";;;AAGA;AACA;AACA;AACA;AACA;AACO,SAASA,WAAWA,CAACC,KAAa,EAAEC,EAAc,EAAQ;EAC/DC,QAAQ,CAAC,aAAa,EAAE,MAAM;IAC5B,IAAIC,YAAY,CAACH,KAAK,CAAC,IAAII,WAAW,CAACJ,KAAK,CAAC,EAAE;AAC/CC,IAAAA,EAAE,EAAE;AACN,EAAA,CAAC,CAAC;AACJ;;AAEA;AACA;AACA;AACA;AACO,SAASI,aAAaA,CAC3BC,QAAmB,EACnBC,QAAoB,EACR;EACZ,IAAIC,KAAK,GAAG,CAAC;AACb,EAAA,MAAMC,QAAQ,GAAG,IAAIC,cAAc,CAAC,MAAM;IACxCC,oBAAoB,CAACH,KAAK,CAAC;AAC3BA,IAAAA,KAAK,GAAGI,qBAAqB,CAACL,QAAQ,CAAC;AACzC,EAAA,CAAC,CAAC;EACF,KAAK,MAAMM,OAAO,IAAIP,QAAQ,EAAEG,QAAQ,CAACK,OAAO,CAACD,OAAO,CAAC;AACzD,EAAA,OAAO,MAAM;IACXF,oBAAoB,CAACH,KAAK,CAAC;IAC3BC,QAAQ,CAACM,UAAU,EAAE;EACvB,CAAC;AACH;;"}

package/dist/utils/data-grid/schema.js

@@ -0,0 +1,244 @@
+/*
+ * Copyright Elasticsearch B.V. and/or licensed to Elasticsearch B.V. under one
+ * or more contributor license agreements. Licensed under the Elastic License
+ * 2.0 and the Server Side Public License, v 1; you may not use this file except
+ * in compliance with, at your election, the Elastic License 2.0 or the Server
+ * Side Public License, v 1.
+ */
+
+/**
+ * Port of EUI 123.1.0 `components/datagrid/utils/data_grid_schema.tsx`:
+ * default schema detectors/comparators and in-memory schema detection.
+ * Sort labels are i18n `{ token, default }` pairs instead of `<EuiI18n>`.
+ */
+
+const numericChars = new Set(['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.', '-']);
+const schemaDetectors = [{
+  type: 'boolean',
+  detector(value) {
+    return value.toLowerCase() === 'true' || value.toLowerCase() === 'false' ? 1 : 0;
+  },
+  comparator(a, b, direction) {
+    const aValue = a.toLowerCase() === 'true';
+    const bValue = b.toLowerCase() === 'true';
+    if (aValue < bValue) return direction === 'asc' ? -1 : 1;
+    if (aValue > bValue) return direction === 'asc' ? 1 : -1;
+    return 0;
+  },
+  icon: 'tokenBoolean',
+  sortTextAsc: {
+    token: 'euiDataGridSchema.booleanSortTextAsc',
+    default: 'False-True'
+  },
+  sortTextDesc: {
+    token: 'euiDataGridSchema.booleanSortTextDesc',
+    default: 'True-False'
+  }
+}, {
+  type: 'currency',
+  detector(value) {
+    const matchLength = (value.match(
+    // currency prefers starting with 1-3 characters for the currency symbol
+    // then it matches against numerical data + $
+    /(^[^-(.]{1,3})?[$-(]*[\d,]+(\.\d*)?[$)]*/) || [''])[0].length;
+
+    // if there is no currency symbol then reduce the score
+    const hasCurrency = value.indexOf('$') !== -1;
+    const confidenceAdjustment = hasCurrency ? 1 : 0.95;
+    return matchLength / value.length * confidenceAdjustment || 0;
+  },
+  comparator(a, b, direction) {
+    const aValue = parseFloat(a.split('').filter(char => numericChars.has(char)).join(''));
+    const bValue = parseFloat(b.split('').filter(char => numericChars.has(char)).join(''));
+    if (aValue < bValue) return direction === 'asc' ? -1 : 1;
+    if (aValue > bValue) return direction === 'asc' ? 1 : -1;
+    return 0;
+  },
+  icon: 'money',
+  color: 'euiColorVis0',
+  sortTextAsc: {
+    token: 'euiDataGridSchema.currencySortTextAsc',
+    default: 'Low-High'
+  },
+  sortTextDesc: {
+    token: 'euiDataGridSchema.currencySortTextDesc',
+    default: 'High-Low'
+  }
+}, {
+  type: 'datetime',
+  detector(value) {
+    // matches the most common forms of ISO-8601
+    const isoTimestampMatch = value.match(
+    // 2019 - 09    - 17     T 12     : 18    : 32      .853     Z or -0600
+    /^\d{2,4}-\d{1,2}-\d{1,2}(T?\d{1,2}:\d{1,2}:\d{1,2}(\.\d{3})?(Z|[+-]\d{4})?)?/);
+
+    // matches 9 digits (seconds) or 13 digits (milliseconds) since unix epoch
+    const unixTimestampMatch = value.match(/^(\d{9}|\d{13})$/);
+    const isoMatchLength = isoTimestampMatch ? isoTimestampMatch[0].length : 0;
+
+    // reduce the confidence of a unix timestamp match to 75%
+    // (a column of all unix timestamps should be numeric instead)
+    const unixMatchLength = unixTimestampMatch ? unixTimestampMatch[0].length * 0.75 : 0;
+    return Math.max(isoMatchLength, unixMatchLength) / value.length || 0;
+  },
+  icon: 'tokenDate',
+  sortTextAsc: {
+    token: 'euiDataGridSchema.dateSortTextAsc',
+    default: 'Old-New'
+  },
+  sortTextDesc: {
+    token: 'euiDataGridSchema.dateSortTextDesc',
+    default: 'New-Old'
+  }
+}, {
+  type: 'numeric',
+  detector(value) {
+    const matchLength = (value.match(/[%-(]*[\d,]+(\.\d*)?[%)]*/) || [''])[0].length;
+    return matchLength / value.length || 0;
+  },
+  comparator(a, b, direction) {
+    // sort on all digits groups
+    const aGroups = a.split(/\D+/);
+    const bGroups = b.split(/\D+/);
+    const maxGroups = Math.max(aGroups.length, bGroups.length);
+    for (let i = 0; i < maxGroups; i++) {
+      // if A and B's group counts differ and they match until that difference, prefer whichever is shorter
+      if (i >= aGroups.length) return direction === 'asc' ? -1 : 1;
+      if (i >= bGroups.length) return direction === 'asc' ? 1 : -1;
+      const aValue = parseInt(aGroups[i], 10);
+      const bValue = parseInt(bGroups[i], 10);
+      if (aValue < bValue) return direction === 'asc' ? -1 : 1;
+      if (aValue > bValue) return direction === 'asc' ? 1 : -1;
+    }
+    return 0;
+  },
+  icon: 'tokenNumber',
+  sortTextAsc: {
+    token: 'euiDataGridSchema.numberSortTextAsc',
+    default: 'Low-High'
+  },
+  sortTextDesc: {
+    token: 'euiDataGridSchema.numberSortTextDesc',
+    default: 'High-Low'
+  }
+}, {
+  type: 'json',
+  detector(value) {
+    // does this look like it might be a JSON object?
+    const maybeArray = value[0] === '[' && value[value.length - 1] === ']';
+    const maybeObject = value[0] === '{' && value[value.length - 1] === '}';
+    if (!maybeArray && !maybeObject) return 0;
+    try {
+      JSON.parse(value);
+      return 1;
+    } catch {
+      return 0;
+    }
+  },
+  comparator(a, b, direction) {
+    if (a.length > b.length) return direction === 'asc' ? 1 : -1;
+    if (a.length < b.length) return direction === 'asc' ? 1 : -1;
+    return 0;
+  },
+  icon: 'tokenObject',
+  sortTextAsc: {
+    token: 'euiDataGridSchema.jsonSortTextAsc',
+    default: 'Small-Large'
+  },
+  sortTextDesc: {
+    token: 'euiDataGridSchema.jsonSortTextDesc',
+    default: 'Large-Small'
+  }
+}];
+function defaultComparator(a, b, direction) {
+  if (a < b) return direction === 'asc' ? -1 : 1;
+  if (a > b) return direction === 'asc' ? 1 : -1;
+  return 0;
+}
+
+// completely arbitrary minimum match upstream came up with
+// represents lowest score a type detector can have to be considered valid
+const MINIMUM_SCORE_MATCH = 0.5;
+
+/** Port of `useDetectSchema` (pure): detect column types from in-memory values. */
+function detectSchema({
+  columns,
+  inMemory,
+  inMemoryValues,
+  schemaDetectors: detectors,
+  autoDetectSchema
+}) {
+  const schema = {};
+  if (autoDetectSchema === false) return schema;
+  const definedColumnSchemas = new Set();
+  for (const {
+    id,
+    schema: columnSchema
+  } of columns) if (columnSchema != null) definedColumnSchemas.add(id);
+  const columnSchemas = {};
+  const columnIdsWithDefinedSchemas = new Set([...(inMemory?.skipColumns ?? []), ...definedColumnSchemas]);
+
+  // for each row, score each value by each detector and put the results on `columnSchemas`
+  for (const rowIndex of Object.keys(inMemoryValues)) {
+    const rowData = inMemoryValues[rowIndex];
+    for (const columnId of Object.keys(rowData)) {
+      if (columnIdsWithDefinedSchemas.has(columnId)) continue;
+      const schemaColumn = columnSchemas[columnId] = columnSchemas[columnId] || {};
+      const columnValue = rowData[columnId].trim();
+      for (const {
+        type,
+        detector
+      } of detectors) {
+        const score = detector(columnValue);
+        (schemaColumn[type] = schemaColumn[type] || []).push(score);
+      }
+    }
+  }
+
+  // for each column, reduce each detector type's score to a single value and find the best fit
+  for (const columnId of Object.keys(columnSchemas)) {
+    const columnScores = columnSchemas[columnId];
+    let bestType = null;
+    let bestScore = 0;
+    for (const typeId of Object.keys(columnScores)) {
+      const typeScores = columnScores[typeId];
+      const mean = typeScores.reduce((total, score) => total + score, 0) / typeScores.length;
+      const sd = Math.sqrt(typeScores.reduce((sum, score) => sum + (score - mean) * (score - mean), 0) / typeScores.length);
+      // the mean-standard_deviation calculation is fairly arbitrary but fits the patterns
+      const score = mean - sd;
+      if (score > MINIMUM_SCORE_MATCH && (bestType == null || score > bestScore)) {
+        bestType = typeId;
+        bestScore = score;
+      }
+    }
+    schema[columnId] = {
+      columnType: bestType
+    };
+  }
+  return schema;
+}
+
+/** Port of `useMergedSchema`: explicit column schemas win over detection. */
+function mergeSchema(detected, columns) {
+  const merged = {
+    ...detected
+  };
+  for (const {
+    id,
+    schema
+  } of columns) {
+    if (schema != null) merged[id] = {
+      ...detected[id],
+      columnType: schema
+    };
+  }
+  return merged;
+}
+
+/** Given a provided schema, return the details for the schema. */
+function getDetailsForSchema(detectors, providedSchema) {
+  return detectors.find(detector => detector.type === providedSchema);
+}
+
+export { defaultComparator, detectSchema, getDetailsForSchema, mergeSchema, schemaDetectors };
+//# sourceMappingURL=schema.js.map

package/dist/utils/data-grid/schema.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"schema.js","sources":["../../../src/utils/data-grid/schema.ts"],"sourcesContent":["/*\n * Copyright Elasticsearch B.V. and/or licensed to Elasticsearch B.V. under one\n * or more contributor license agreements. Licensed under the Elastic License\n * 2.0 and the Server Side Public License, v 1; you may not use this file except\n * in compliance with, at your election, the Elastic License 2.0 or the Server\n * Side Public License, v 1.\n */\n\n/**\n * Port of EUI 123.1.0 `components/datagrid/utils/data_grid_schema.tsx`:\n * default schema detectors/comparators and in-memory schema detection.\n * Sort labels are i18n `{ token, default }` pairs instead of `<EuiI18n>`.\n */\nimport type {\n  EuiDataGridColumn,\n  EuiDataGridInMemory,\n  EuiDataGridInMemoryValues,\n  EuiDataGridSchema,\n  EuiDataGridSchemaDetector\n} from './types.ts';\n\nconst numericChars = new Set([\n  '0',\n  '1',\n  '2',\n  '3',\n  '4',\n  '5',\n  '6',\n  '7',\n  '8',\n  '9',\n  '.',\n  '-'\n]);\n\nexport const schemaDetectors: EuiDataGridSchemaDetector[] = [\n  {\n    type: 'boolean',\n    detector(value) {\n      return value.toLowerCase() === 'true' || value.toLowerCase() === 'false'\n        ? 1\n        : 0;\n    },\n    comparator(a, b, direction) {\n      const aValue = a.toLowerCase() === 'true';\n      const bValue = b.toLowerCase() === 'true';\n      if (aValue < bValue) return direction === 'asc' ? -1 : 1;\n      if (aValue > bValue) return direction === 'asc' ? 1 : -1;\n      return 0;\n    },\n    icon: 'tokenBoolean',\n    sortTextAsc: {\n      token: 'euiDataGridSchema.booleanSortTextAsc',\n      default: 'False-True'\n    },\n    sortTextDesc: {\n      token: 'euiDataGridSchema.booleanSortTextDesc',\n      default: 'True-False'\n    }\n  },\n  {\n    type: 'currency',\n    detector(value) {\n      const matchLength = (value.match(\n        // currency prefers starting with 1-3 characters for the currency symbol\n        // then it matches against numerical data + $\n        /(^[^-(.]{1,3})?[$-(]*[\\d,]+(\\.\\d*)?[$)]*/\n      ) || [''])[0].length;\n\n      // if there is no currency symbol then reduce the score\n      const hasCurrency = value.indexOf('$') !== -1;\n      const confidenceAdjustment = hasCurrency ? 1 : 0.95;\n\n      return (matchLength / value.length) * confidenceAdjustment || 0;\n    },\n    comparator(a, b, direction) {\n      const aValue = parseFloat(\n        a\n          .split('')\n          .filter((char) => numericChars.has(char))\n          .join('')\n      );\n      const bValue = parseFloat(\n        b\n          .split('')\n          .filter((char) => numericChars.has(char))\n          .join('')\n      );\n      if (aValue < bValue) return direction === 'asc' ? -1 : 1;\n      if (aValue > bValue) return direction === 'asc' ? 1 : -1;\n      return 0;\n    },\n    icon: 'money',\n    color: 'euiColorVis0',\n    sortTextAsc: {\n      token: 'euiDataGridSchema.currencySortTextAsc',\n      default: 'Low-High'\n    },\n    sortTextDesc: {\n      token: 'euiDataGridSchema.currencySortTextDesc',\n      default: 'High-Low'\n    }\n  },\n  {\n    type: 'datetime',\n    detector(value) {\n      // matches the most common forms of ISO-8601\n      const isoTimestampMatch = value.match(\n        // 2019 - 09    - 17     T 12     : 18    : 32      .853     Z or -0600\n        /^\\d{2,4}-\\d{1,2}-\\d{1,2}(T?\\d{1,2}:\\d{1,2}:\\d{1,2}(\\.\\d{3})?(Z|[+-]\\d{4})?)?/\n      );\n\n      // matches 9 digits (seconds) or 13 digits (milliseconds) since unix epoch\n      const unixTimestampMatch = value.match(/^(\\d{9}|\\d{13})$/);\n\n      const isoMatchLength = isoTimestampMatch\n        ? isoTimestampMatch[0].length\n        : 0;\n\n      // reduce the confidence of a unix timestamp match to 75%\n      // (a column of all unix timestamps should be numeric instead)\n      const unixMatchLength = unixTimestampMatch\n        ? unixTimestampMatch[0].length * 0.75\n        : 0;\n\n      return Math.max(isoMatchLength, unixMatchLength) / value.length || 0;\n    },\n    icon: 'tokenDate',\n    sortTextAsc: {\n      token: 'euiDataGridSchema.dateSortTextAsc',\n      default: 'Old-New'\n    },\n    sortTextDesc: {\n      token: 'euiDataGridSchema.dateSortTextDesc',\n      default: 'New-Old'\n    }\n  },\n  {\n    type: 'numeric',\n    detector(value) {\n      const matchLength = (value.match(/[%-(]*[\\d,]+(\\.\\d*)?[%)]*/) || [''])[0]\n        .length;\n      return matchLength / value.length || 0;\n    },\n    comparator(a, b, direction) {\n      // sort on all digits groups\n      const aGroups = a.split(/\\D+/);\n      const bGroups = b.split(/\\D+/);\n\n      const maxGroups = Math.max(aGroups.length, bGroups.length);\n      for (let i = 0; i < maxGroups; i++) {\n        // if A and B's group counts differ and they match until that difference, prefer whichever is shorter\n        if (i >= aGroups.length) return direction === 'asc' ? -1 : 1;\n        if (i >= bGroups.length) return direction === 'asc' ? 1 : -1;\n\n        const aValue = parseInt(aGroups[i]!, 10);\n        const bValue = parseInt(bGroups[i]!, 10);\n\n        if (aValue < bValue) return direction === 'asc' ? -1 : 1;\n        if (aValue > bValue) return direction === 'asc' ? 1 : -1;\n      }\n\n      return 0;\n    },\n    icon: 'tokenNumber',\n    sortTextAsc: {\n      token: 'euiDataGridSchema.numberSortTextAsc',\n      default: 'Low-High'\n    },\n    sortTextDesc: {\n      token: 'euiDataGridSchema.numberSortTextDesc',\n      default: 'High-Low'\n    }\n  },\n  {\n    type: 'json',\n    detector(value) {\n      // does this look like it might be a JSON object?\n      const maybeArray = value[0] === '[' && value[value.length - 1] === ']';\n      const maybeObject = value[0] === '{' && value[value.length - 1] === '}';\n      if (!maybeArray && !maybeObject) return 0;\n\n      try {\n        JSON.parse(value);\n        return 1;\n      } catch {\n        return 0;\n      }\n    },\n    comparator(a, b, direction) {\n      if (a.length > b.length) return direction === 'asc' ? 1 : -1;\n      if (a.length < b.length) return direction === 'asc' ? 1 : -1;\n      return 0;\n    },\n    icon: 'tokenObject',\n    sortTextAsc: {\n      token: 'euiDataGridSchema.jsonSortTextAsc',\n      default: 'Small-Large'\n    },\n    sortTextDesc: {\n      token: 'euiDataGridSchema.jsonSortTextDesc',\n      default: 'Large-Small'\n    }\n  }\n];\n\nexport function defaultComparator<T>(\n  a: T,\n  b: T,\n  direction: 'asc' | 'desc'\n): number {\n  if (a < b) return direction === 'asc' ? -1 : 1;\n  if (a > b) return direction === 'asc' ? 1 : -1;\n  return 0;\n}\n\n// completely arbitrary minimum match upstream came up with\n// represents lowest score a type detector can have to be considered valid\nconst MINIMUM_SCORE_MATCH = 0.5;\n\n/** Port of `useDetectSchema` (pure): detect column types from in-memory values. */\nexport function detectSchema({\n  columns,\n  inMemory,\n  inMemoryValues,\n  schemaDetectors: detectors,\n  autoDetectSchema\n}: {\n  columns: EuiDataGridColumn[];\n  inMemory?: EuiDataGridInMemory;\n  inMemoryValues: EuiDataGridInMemoryValues;\n  schemaDetectors: EuiDataGridSchemaDetector[];\n  autoDetectSchema: boolean;\n}): EuiDataGridSchema {\n  const schema: EuiDataGridSchema = {};\n  if (autoDetectSchema === false) return schema;\n\n  const definedColumnSchemas = new Set<string>();\n  for (const { id, schema: columnSchema } of columns)\n    if (columnSchema != null) definedColumnSchemas.add(id);\n\n  const columnSchemas: Record<string, Record<string, number[]>> = {};\n  const columnIdsWithDefinedSchemas = new Set([\n    ...(inMemory?.skipColumns ?? []),\n    ...definedColumnSchemas\n  ]);\n\n  // for each row, score each value by each detector and put the results on `columnSchemas`\n  for (const rowIndex of Object.keys(inMemoryValues)) {\n    const rowData = inMemoryValues[rowIndex]!;\n    for (const columnId of Object.keys(rowData)) {\n      if (columnIdsWithDefinedSchemas.has(columnId)) continue;\n      const schemaColumn = (columnSchemas[columnId] =\n        columnSchemas[columnId] || {});\n      const columnValue = rowData[columnId]!.trim();\n      for (const { type, detector } of detectors) {\n        const score = detector(columnValue);\n        (schemaColumn[type] = schemaColumn[type] || []).push(score);\n      }\n    }\n  }\n\n  // for each column, reduce each detector type's score to a single value and find the best fit\n  for (const columnId of Object.keys(columnSchemas)) {\n    const columnScores = columnSchemas[columnId]!;\n    let bestType: string | null = null;\n    let bestScore = 0;\n    for (const typeId of Object.keys(columnScores)) {\n      const typeScores = columnScores[typeId]!;\n      const mean =\n        typeScores.reduce((total, score) => total + score, 0) /\n        typeScores.length;\n      const sd = Math.sqrt(\n        typeScores.reduce(\n          (sum, score) => sum + (score - mean) * (score - mean),\n          0\n        ) / typeScores.length\n      );\n      // the mean-standard_deviation calculation is fairly arbitrary but fits the patterns\n      const score = mean - sd;\n      if (score > MINIMUM_SCORE_MATCH && (bestType == null || score > bestScore)) {\n        bestType = typeId;\n        bestScore = score;\n      }\n    }\n    schema[columnId] = { columnType: bestType };\n  }\n  return schema;\n}\n\n/** Port of `useMergedSchema`: explicit column schemas win over detection. */\nexport function mergeSchema(\n  detected: EuiDataGridSchema,\n  columns: EuiDataGridColumn[]\n): EuiDataGridSchema {\n  const merged: EuiDataGridSchema = { ...detected };\n  for (const { id, schema } of columns) {\n    if (schema != null) merged[id] = { ...detected[id], columnType: schema };\n  }\n  return merged;\n}\n\n/** Given a provided schema, return the details for the schema. */\nexport function getDetailsForSchema(\n  detectors: EuiDataGridSchemaDetector[],\n  providedSchema: string | null | undefined\n): EuiDataGridSchemaDetector | undefined {\n  return detectors.find((detector) => detector.type === providedSchema);\n}\n"],"names":["numericChars","Set","schemaDetectors","type","detector","value","toLowerCase","comparator","a","b","direction","aValue","bValue","icon","sortTextAsc","token","default","sortTextDesc","matchLength","match","length","hasCurrency","indexOf","confidenceAdjustment","parseFloat","split","filter","char","has","join","color","isoTimestampMatch","unixTimestampMatch","isoMatchLength","unixMatchLength","Math","max","aGroups","bGroups","maxGroups","i","parseInt","maybeArray","maybeObject","JSON","parse","defaultComparator","MINIMUM_SCORE_MATCH","detectSchema","columns","inMemory","inMemoryValues","detectors","autoDetectSchema","schema","definedColumnSchemas","id","columnSchema","add","columnSchemas","columnIdsWithDefinedSchemas","skipColumns","rowIndex","Object","keys","rowData","columnId","schemaColumn","columnValue","trim","score","push","columnScores","bestType","bestScore","typeId","typeScores","mean","reduce","total","sd","sqrt","sum","columnType","mergeSchema","detected","merged","getDetailsForSchema","providedSchema","find"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AASA,MAAMA,YAAY,GAAG,IAAIC,GAAG,CAAC,CAC3B,GAAG,EACH,GAAG,EACH,GAAG,EACH,GAAG,EACH,GAAG,EACH,GAAG,EACH,GAAG,EACH,GAAG,EACH,GAAG,EACH,GAAG,EACH,GAAG,EACH,GAAG,CACJ,CAAC;AAEK,MAAMC,eAA4C,GAAG,CAC1D;AACEC,EAAAA,IAAI,EAAE,SAAS;EACfC,QAAQA,CAACC,KAAK,EAAE;AACd,IAAA,OAAOA,KAAK,CAACC,WAAW,EAAE,KAAK,MAAM,IAAID,KAAK,CAACC,WAAW,EAAE,KAAK,OAAO,GACpE,CAAC,GACD,CAAC;EACP,CAAC;AACDC,EAAAA,UAAUA,CAACC,CAAC,EAAEC,CAAC,EAAEC,SAAS,EAAE;IAC1B,MAAMC,MAAM,GAAGH,CAAC,CAACF,WAAW,EAAE,KAAK,MAAM;IACzC,MAAMM,MAAM,GAAGH,CAAC,CAACH,WAAW,EAAE,KAAK,MAAM;AACzC,IAAA,IAAIK,MAAM,GAAGC,MAAM,EAAE,OAAOF,SAAS,KAAK,KAAK,GAAG,EAAE,GAAG,CAAC;AACxD,IAAA,IAAIC,MAAM,GAAGC,MAAM,EAAE,OAAOF,SAAS,KAAK,KAAK,GAAG,CAAC,GAAG,EAAE;AACxD,IAAA,OAAO,CAAC;EACV,CAAC;AACDG,EAAAA,IAAI,EAAE,cAAc;AACpBC,EAAAA,WAAW,EAAE;AACXC,IAAAA,KAAK,EAAE,sCAAsC;AAC7CC,IAAAA,OAAO,EAAE;GACV;AACDC,EAAAA,YAAY,EAAE;AACZF,IAAAA,KAAK,EAAE,uCAAuC;AAC9CC,IAAAA,OAAO,EAAE;AACX;AACF,CAAC,EACD;AACEb,EAAAA,IAAI,EAAE,UAAU;EAChBC,QAAQA,CAACC,KAAK,EAAE;AACd,IAAA,MAAMa,WAAW,GAAG,CAACb,KAAK,CAACc,KAAK;AAC9B;AACA;IACA,0CACF,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAACC,MAAM;;AAEpB;IACA,MAAMC,WAAW,GAAGhB,KAAK,CAACiB,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE;AAC7C,IAAA,MAAMC,oBAAoB,GAAGF,WAAW,GAAG,CAAC,GAAG,IAAI;IAEnD,OAAQH,WAAW,GAAGb,KAAK,CAACe,MAAM,GAAIG,oBAAoB,IAAI,CAAC;EACjE,CAAC;AACDhB,EAAAA,UAAUA,CAACC,CAAC,EAAEC,CAAC,EAAEC,SAAS,EAAE;IAC1B,MAAMC,MAAM,GAAGa,UAAU,CACvBhB,CAAC,CACEiB,KAAK,CAAC,EAAE,CAAC,CACTC,MAAM,CAAEC,IAAI,IAAK3B,YAAY,CAAC4B,GAAG,CAACD,IAAI,CAAC,CAAC,CACxCE,IAAI,CAAC,EAAE,CACZ,CAAC;IACD,MAAMjB,MAAM,GAAGY,UAAU,CACvBf,CAAC,CACEgB,KAAK,CAAC,EAAE,CAAC,CACTC,MAAM,CAAEC,IAAI,IAAK3B,YAAY,CAAC4B,GAAG,CAACD,IAAI,CAAC,CAAC,CACxCE,IAAI,CAAC,EAAE,CACZ,CAAC;AACD,IAAA,IAAIlB,MAAM,GAAGC,MAAM,EAAE,OAAOF,SAAS,KAAK,KAAK,GAAG,EAAE,GAAG,CAAC;AACxD,IAAA,IAAIC,MAAM,GAAGC,MAAM,EAAE,OAAOF,SAAS,KAAK,KAAK,GAAG,CAAC,GAAG,EAAE;AACxD,IAAA,OAAO,CAAC;EACV,CAAC;AACDG,EAAAA,IAAI,EAAE,OAAO;AACbiB,EAAAA,KAAK,EAAE,cAAc;AACrBhB,EAAAA,WAAW,EAAE;AACXC,IAAAA,KAAK,EAAE,uCAAuC;AAC9CC,IAAAA,OAAO,EAAE;GACV;AACDC,EAAAA,YAAY,EAAE;AACZF,IAAAA,KAAK,EAAE,wCAAwC;AAC/CC,IAAAA,OAAO,EAAE;AACX;AACF,CAAC,EACD;AACEb,EAAAA,IAAI,EAAE,UAAU;EAChBC,QAAQA,CAACC,KAAK,EAAE;AACd;AACA,IAAA,MAAM0B,iBAAiB,GAAG1B,KAAK,CAACc,KAAK;AACnC;AACA,IAAA,8EACF,CAAC;;AAED;AACA,IAAA,MAAMa,kBAAkB,GAAG3B,KAAK,CAACc,KAAK,CAAC,kBAAkB,CAAC;IAE1D,MAAMc,cAAc,GAAGF,iBAAiB,GACpCA,iBAAiB,CAAC,CAAC,CAAC,CAACX,MAAM,GAC3B,CAAC;;AAEL;AACA;AACA,IAAA,MAAMc,eAAe,GAAGF,kBAAkB,GACtCA,kBAAkB,CAAC,CAAC,CAAC,CAACZ,MAAM,GAAG,IAAI,GACnC,CAAC;AAEL,IAAA,OAAOe,IAAI,CAACC,GAAG,CAACH,cAAc,EAAEC,eAAe,CAAC,GAAG7B,KAAK,CAACe,MAAM,IAAI,CAAC;EACtE,CAAC;AACDP,EAAAA,IAAI,EAAE,WAAW;AACjBC,EAAAA,WAAW,EAAE;AACXC,IAAAA,KAAK,EAAE,mCAAmC;AAC1CC,IAAAA,OAAO,EAAE;GACV;AACDC,EAAAA,YAAY,EAAE;AACZF,IAAAA,KAAK,EAAE,oCAAoC;AAC3CC,IAAAA,OAAO,EAAE;AACX;AACF,CAAC,EACD;AACEb,EAAAA,IAAI,EAAE,SAAS;EACfC,QAAQA,CAACC,KAAK,EAAE;AACd,IAAA,MAAMa,WAAW,GAAG,CAACb,KAAK,CAACc,KAAK,CAAC,2BAA2B,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CACtEC,MAAM;AACT,IAAA,OAAOF,WAAW,GAAGb,KAAK,CAACe,MAAM,IAAI,CAAC;EACxC,CAAC;AACDb,EAAAA,UAAUA,CAACC,CAAC,EAAEC,CAAC,EAAEC,SAAS,EAAE;AAC1B;AACA,IAAA,MAAM2B,OAAO,GAAG7B,CAAC,CAACiB,KAAK,CAAC,KAAK,CAAC;AAC9B,IAAA,MAAMa,OAAO,GAAG7B,CAAC,CAACgB,KAAK,CAAC,KAAK,CAAC;AAE9B,IAAA,MAAMc,SAAS,GAAGJ,IAAI,CAACC,GAAG,CAACC,OAAO,CAACjB,MAAM,EAAEkB,OAAO,CAAClB,MAAM,CAAC;IAC1D,KAAK,IAAIoB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGD,SAAS,EAAEC,CAAC,EAAE,EAAE;AAClC;AACA,MAAA,IAAIA,CAAC,IAAIH,OAAO,CAACjB,MAAM,EAAE,OAAOV,SAAS,KAAK,KAAK,GAAG,EAAE,GAAG,CAAC;AAC5D,MAAA,IAAI8B,CAAC,IAAIF,OAAO,CAAClB,MAAM,EAAE,OAAOV,SAAS,KAAK,KAAK,GAAG,CAAC,GAAG,EAAE;MAE5D,MAAMC,MAAM,GAAG8B,QAAQ,CAACJ,OAAO,CAACG,CAAC,CAAC,EAAG,EAAE,CAAC;MACxC,MAAM5B,MAAM,GAAG6B,QAAQ,CAACH,OAAO,CAACE,CAAC,CAAC,EAAG,EAAE,CAAC;AAExC,MAAA,IAAI7B,MAAM,GAAGC,MAAM,EAAE,OAAOF,SAAS,KAAK,KAAK,GAAG,EAAE,GAAG,CAAC;AACxD,MAAA,IAAIC,MAAM,GAAGC,MAAM,EAAE,OAAOF,SAAS,KAAK,KAAK,GAAG,CAAC,GAAG,EAAE;AAC1D,IAAA;AAEA,IAAA,OAAO,CAAC;EACV,CAAC;AACDG,EAAAA,IAAI,EAAE,aAAa;AACnBC,EAAAA,WAAW,EAAE;AACXC,IAAAA,KAAK,EAAE,qCAAqC;AAC5CC,IAAAA,OAAO,EAAE;GACV;AACDC,EAAAA,YAAY,EAAE;AACZF,IAAAA,KAAK,EAAE,sCAAsC;AAC7CC,IAAAA,OAAO,EAAE;AACX;AACF,CAAC,EACD;AACEb,EAAAA,IAAI,EAAE,MAAM;EACZC,QAAQA,CAACC,KAAK,EAAE;AACd;AACA,IAAA,MAAMqC,UAAU,GAAGrC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,IAAIA,KAAK,CAACA,KAAK,CAACe,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG;AACtE,IAAA,MAAMuB,WAAW,GAAGtC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,IAAIA,KAAK,CAACA,KAAK,CAACe,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG;AACvE,IAAA,IAAI,CAACsB,UAAU,IAAI,CAACC,WAAW,EAAE,OAAO,CAAC;IAEzC,IAAI;AACFC,MAAAA,IAAI,CAACC,KAAK,CAACxC,KAAK,CAAC;AACjB,MAAA,OAAO,CAAC;AACV,IAAA,CAAC,CAAC,MAAM;AACN,MAAA,OAAO,CAAC;AACV,IAAA;EACF,CAAC;AACDE,EAAAA,UAAUA,CAACC,CAAC,EAAEC,CAAC,EAAEC,SAAS,EAAE;AAC1B,IAAA,IAAIF,CAAC,CAACY,MAAM,GAAGX,CAAC,CAACW,MAAM,EAAE,OAAOV,SAAS,KAAK,KAAK,GAAG,CAAC,GAAG,EAAE;AAC5D,IAAA,IAAIF,CAAC,CAACY,MAAM,GAAGX,CAAC,CAACW,MAAM,EAAE,OAAOV,SAAS,KAAK,KAAK,GAAG,CAAC,GAAG,EAAE;AAC5D,IAAA,OAAO,CAAC;EACV,CAAC;AACDG,EAAAA,IAAI,EAAE,aAAa;AACnBC,EAAAA,WAAW,EAAE;AACXC,IAAAA,KAAK,EAAE,mCAAmC;AAC1CC,IAAAA,OAAO,EAAE;GACV;AACDC,EAAAA,YAAY,EAAE;AACZF,IAAAA,KAAK,EAAE,oCAAoC;AAC3CC,IAAAA,OAAO,EAAE;AACX;AACF,CAAC;AAGI,SAAS8B,iBAAiBA,CAC/BtC,CAAI,EACJC,CAAI,EACJC,SAAyB,EACjB;AACR,EAAA,IAAIF,CAAC,GAAGC,CAAC,EAAE,OAAOC,SAAS,KAAK,KAAK,GAAG,EAAE,GAAG,CAAC;AAC9C,EAAA,IAAIF,CAAC,GAAGC,CAAC,EAAE,OAAOC,SAAS,KAAK,KAAK,GAAG,CAAC,GAAG,EAAE;AAC9C,EAAA,OAAO,CAAC;AACV;;AAEA;AACA;AACA,MAAMqC,mBAAmB,GAAG,GAAG;;AAE/B;AACO,SAASC,YAAYA,CAAC;EAC3BC,OAAO;EACPC,QAAQ;EACRC,cAAc;AACdjD,EAAAA,eAAe,EAAEkD,SAAS;AAC1BC,EAAAA;AAOF,CAAC,EAAqB;EACpB,MAAMC,MAAyB,GAAG,EAAE;AACpC,EAAA,IAAID,gBAAgB,KAAK,KAAK,EAAE,OAAOC,MAAM;AAE7C,EAAA,MAAMC,oBAAoB,GAAG,IAAItD,GAAG,EAAU;AAC9C,EAAA,KAAK,MAAM;IAAEuD,EAAE;AAAEF,IAAAA,MAAM,EAAEG;AAAa,GAAC,IAAIR,OAAO,EAChD,IAAIQ,YAAY,IAAI,IAAI,EAAEF,oBAAoB,CAACG,GAAG,CAACF,EAAE,CAAC;EAExD,MAAMG,aAAuD,GAAG,EAAE;AAClE,EAAA,MAAMC,2BAA2B,GAAG,IAAI3D,GAAG,CAAC,CAC1C,IAAIiD,QAAQ,EAAEW,WAAW,IAAI,EAAE,CAAC,EAChC,GAAGN,oBAAoB,CACxB,CAAC;;AAEF;EACA,KAAK,MAAMO,QAAQ,IAAIC,MAAM,CAACC,IAAI,CAACb,cAAc,CAAC,EAAE;AAClD,IAAA,MAAMc,OAAO,GAAGd,cAAc,CAACW,QAAQ,CAAE;IACzC,KAAK,MAAMI,QAAQ,IAAIH,MAAM,CAACC,IAAI,CAACC,OAAO,CAAC,EAAE;AAC3C,MAAA,IAAIL,2BAA2B,CAAChC,GAAG,CAACsC,QAAQ,CAAC,EAAE;AAC/C,MAAA,MAAMC,YAAY,GAAIR,aAAa,CAACO,QAAQ,CAAC,GAC3CP,aAAa,CAACO,QAAQ,CAAC,IAAI,EAAG;MAChC,MAAME,WAAW,GAAGH,OAAO,CAACC,QAAQ,CAAC,CAAEG,IAAI,EAAE;AAC7C,MAAA,KAAK,MAAM;QAAElE,IAAI;AAAEC,QAAAA;OAAU,IAAIgD,SAAS,EAAE;AAC1C,QAAA,MAAMkB,KAAK,GAAGlE,QAAQ,CAACgE,WAAW,CAAC;AACnC,QAAA,CAACD,YAAY,CAAChE,IAAI,CAAC,GAAGgE,YAAY,CAAChE,IAAI,CAAC,IAAI,EAAE,EAAEoE,IAAI,CAACD,KAAK,CAAC;AAC7D,MAAA;AACF,IAAA;AACF,EAAA;;AAEA;EACA,KAAK,MAAMJ,QAAQ,IAAIH,MAAM,CAACC,IAAI,CAACL,aAAa,CAAC,EAAE;AACjD,IAAA,MAAMa,YAAY,GAAGb,aAAa,CAACO,QAAQ,CAAE;IAC7C,IAAIO,QAAuB,GAAG,IAAI;IAClC,IAAIC,SAAS,GAAG,CAAC;IACjB,KAAK,MAAMC,MAAM,IAAIZ,MAAM,CAACC,IAAI,CAACQ,YAAY,CAAC,EAAE;AAC9C,MAAA,MAAMI,UAAU,GAAGJ,YAAY,CAACG,MAAM,CAAE;MACxC,MAAME,IAAI,GACRD,UAAU,CAACE,MAAM,CAAC,CAACC,KAAK,EAAET,KAAK,KAAKS,KAAK,GAAGT,KAAK,EAAE,CAAC,CAAC,GACrDM,UAAU,CAACxD,MAAM;AACnB,MAAA,MAAM4D,EAAE,GAAG7C,IAAI,CAAC8C,IAAI,CAClBL,UAAU,CAACE,MAAM,CACf,CAACI,GAAG,EAAEZ,KAAK,KAAKY,GAAG,GAAG,CAACZ,KAAK,GAAGO,IAAI,KAAKP,KAAK,GAAGO,IAAI,CAAC,EACrD,CACF,CAAC,GAAGD,UAAU,CAACxD,MACjB,CAAC;AACD;AACA,MAAA,MAAMkD,KAAK,GAAGO,IAAI,GAAGG,EAAE;AACvB,MAAA,IAAIV,KAAK,GAAGvB,mBAAmB,KAAK0B,QAAQ,IAAI,IAAI,IAAIH,KAAK,GAAGI,SAAS,CAAC,EAAE;AAC1ED,QAAAA,QAAQ,GAAGE,MAAM;AACjBD,QAAAA,SAAS,GAAGJ,KAAK;AACnB,MAAA;AACF,IAAA;IACAhB,MAAM,CAACY,QAAQ,CAAC,GAAG;AAAEiB,MAAAA,UAAU,EAAEV;KAAU;AAC7C,EAAA;AACA,EAAA,OAAOnB,MAAM;AACf;;AAEA;AACO,SAAS8B,WAAWA,CACzBC,QAA2B,EAC3BpC,OAA4B,EACT;AACnB,EAAA,MAAMqC,MAAyB,GAAG;IAAE,GAAGD;GAAU;AACjD,EAAA,KAAK,MAAM;IAAE7B,EAAE;AAAEF,IAAAA;GAAQ,IAAIL,OAAO,EAAE;IACpC,IAAIK,MAAM,IAAI,IAAI,EAAEgC,MAAM,CAAC9B,EAAE,CAAC,GAAG;MAAE,GAAG6B,QAAQ,CAAC7B,EAAE,CAAC;AAAE2B,MAAAA,UAAU,EAAE7B;KAAQ;AAC1E,EAAA;AACA,EAAA,OAAOgC,MAAM;AACf;;AAEA;AACO,SAASC,mBAAmBA,CACjCnC,SAAsC,EACtCoC,cAAyC,EACF;EACvC,OAAOpC,SAAS,CAACqC,IAAI,CAAErF,QAAQ,IAAKA,QAAQ,CAACD,IAAI,KAAKqF,cAAc,CAAC;AACvE;;"}