@itwin/tree-widget-react 4.0.0-alpha.22 → 4.0.0-alpha.24

package/lib/esm/tree-widget-react/components/trees/classifications-tree/internal/visibility/FilteredTree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"FilteredTree.js","sourceRoot":"","sources":["../../../../../../../../src/tree-widget-react/components/trees/classifications-tree/internal/visibility/FilteredTree.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG,OAAO,EAAE,cAAc,EAAE,MAAM,MAAM,CAAC;AACtC,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,OAAO,EAAE,yBAAyB,EAAE,8BAA8B,EAAE,6BAA6B,EAAE,MAAM,kDAAkD,CAAC;AAC5J,OAAO,EAAE,kBAAkB,EAAE,oBAAoB,EAAE,MAAM,yDAAyD,CAAC;AAyDnH,gBAAgB;AAChB,MAAM,CAAC,KAAK,UAAU,iCAAiC,CAAC,KAIvD;IACC,MAAM,EAAE,YAAY,EAAE,cAAc,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC;IACzD,OAAO,kBAAkB,CAAC;QACxB,oBAAoB,EAAE,IAAI,uCAAuC,CAAC,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC;QAC7F,cAAc;KACf,CAAC,CAAC;AACL,CAAC;AAqBD,MAAM,uCAAwC,SAAQ,oBAIrD;IACU,MAAM,CAA+C;IAC9D,YAAY,KAAmD;QAC7D,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAEM,KAAK,CAAC,yBAAyB;QACpC,MAAM,2BAA2B,GAAG,IAAI,GAAG,EAAgE,CAAC;QAC5G,MAAM,2BAA2B,GAAG,IAAI,GAAG,EAAgE,CAAC;QAC5G,MAAM,MAAM,GAA2B;YACrC,kBAAkB,EAAE,IAAI,GAAG,EAAE;YAC7B,kBAAkB,EAAE,IAAI,GAAG,EAAE;SAC9B,CAAC;QACF,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACzC,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;gBAC9B,2BAA2B,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YACjD,CAAC;iBAAM,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;gBACrC,2BAA2B,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;QAED,MAAM,sBAAsB,GAAG,MAAM,cAAc,CACjD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,uBAAuB,CAAC;YAC3C,YAAY,EAAE,CAAC,GAAG,2BAA2B,CAAC,IAAI,EAAE,CAAC;YACrD,YAAY,EAAE,CAAC,GAAG,2BAA2B,CAAC,IAAI,EAAE,CAAC;SACtD,CAAC,CACH,CAAC;QACF,2BAA2B,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE;YAClD,MAAM,KAAK,GAAG,sBAAsB,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACrD,MAAM,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC;YAC5B,MAAM,CAAC,kBAAkB,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC;QAC1G,CAAC,CAAC,CAAC;QACH,2BAA2B,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE;YAClD,MAAM,KAAK,GAAG,sBAAsB,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACrD,MAAM,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC;YAC5B,MAAM,CAAC,kBAAkB,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC;QAC1G,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IAEM,2BAA2B,CAChC,aAA0C,EAC1C,sBAA8C;QAE9C,MAAM,aAAa,GAA0B,EAAE,CAAC;QAEhD,aAAa,CAAC,OAAO,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,IAAI,CAAC,oBAAoB,CAAC,aAAa,EAAE,YAAY,EAAE,sBAAsB,CAAC,CAAC,CAAC;QAExH,OAAO,IAAI,CAAC,4BAA4B,CAAC,aAAa,CAAC,CAAC;IAC1D,CAAC;IAEO,4BAA4B,CAAC,aAAoC;QACvE,IAAI,CAAC,aAAa,CAAC,iBAAiB,IAAI,CAAC,aAAa,CAAC,iBAAiB,IAAI,CAAC,aAAa,CAAC,UAAU,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC;YACnI,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,OAAO;YACL,iBAAiB,EAAE,aAAa,CAAC,iBAAiB;YAClD,sBAAsB,EAAE,aAAa,CAAC,iBAAiB;YACvD,UAAU,EAAE,aAAa,CAAC,UAAU;gBAClC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB,EAAE,QAAQ,CAAC,EAAE,EAAE;oBAC5E,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,qBAAqB,CAAC,gBAAgB,CAAC,CAAC;oBAC7E,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;gBAC3C,CAAC,CAAC;gBACJ,CAAC,CAAC,SAAS;YACb,UAAU,EAAE,aAAa,CAAC,UAAU;gBAClC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB,EAAE,QAAQ,CAAC,EAAE,EAAE;oBAC5E,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,qBAAqB,CAAC,gBAAgB,CAAC,CAAC;oBAC7E,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;gBAC3C,CAAC,CAAC;gBACJ,CAAC,CAAC,SAAS;SACd,CAAC;IACJ,CAAC;IAEO,oBAAoB,CAAC,aAAoC,EAAE,IAA+B,EAAE,sBAA8C;QAChJ,MAAM,YAAY,GAChB,IAAI,CAAC,IAAI,KAAK,WAAW;YACvB,CAAC,CAAC,sBAAsB,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACxD,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,WAAW;gBACzB,CAAC,CAAC,sBAAsB,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxD,CAAC,CAAC,IAAI,CAAC;QACb,MAAM,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC;QACnC,IAAI,YAAY,CAAC,cAAc,EAAE,CAAC;YAChC,IAAI,CAAC,SAAS,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC;YAC5C,OAAO;QACT,CAAC;QAED,IAAI,YAAY,CAAC,IAAI,KAAK,WAAW,IAAI,YAAY,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAC3E,6DAA6D;YAC7D,IAAI,CAAC,SAAS,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC;QAC9C,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnB,OAAO;QACT,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,IAAI,CAAC,oBAAoB,CAAC,aAAa,EAAE,KAAK,EAAE,sBAAsB,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC;IAEO,SAAS,CAAC,aAAoC,EAAE,IAAsB;QAC5E,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,qBAAqB;gBACxB,CAAC,aAAa,CAAC,sBAAsB,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAClE,OAAO;YACT,KAAK,gBAAgB;gBACnB,CAAC,aAAa,CAAC,iBAAiB,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC7D,OAAO;YACT,KAAK,WAAW;gBACd,MAAM,YAAY,GAAG,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;gBAChF,MAAM,UAAU,GAAG,CAAC,aAAa,CAAC,UAAU,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;gBAC9E,IAAI,UAAU,EAAE,CAAC;oBACf,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC;gBACnE,CAAC;qBAAM,CAAC;oBACN,aAAa,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5G,CAAC;gBACD,OAAO;YACT,KAAK,WAAW;gBACd,MAAM,YAAY,GAAG,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;gBAChF,MAAM,UAAU,GAAG,CAAC,aAAa,CAAC,UAAU,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;gBAC9E,IAAI,UAAU,EAAE,CAAC;oBACf,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC;gBACnE,CAAC;qBAAM,CAAC;oBACN,aAAa,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5G,CAAC;gBACD,OAAO;QACX,CAAC;IACH,CAAC;IAEO,sBAAsB,CAAC,OAAmB,EAAE,UAAsB;QACxE,OAAO,GAAG,OAAO,IAAI,UAAU,EAAE,CAAC;IACpC,CAAC;IAEO,qBAAqB,CAAC,GAAqB;QACjD,MAAM,CAAC,OAAO,EAAE,UAAU,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC7C,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;IACjC,CAAC;IAEM,sBAAsB,CAAC,EAC5B,IAAI,EACJ,EAAE,EACF,cAAc,GAKf;QACC,IAAI,IAAI,KAAK,WAAW,IAAI,IAAI,KAAK,WAAW,EAAE,CAAC;YACjD,OAAO;gBACL,EAAE;gBACF,cAAc;gBACd,IAAI;gBACJ,OAAO,EAAE,SAAS;gBAClB,UAAU,EAAE,SAAS;aACtB,CAAC;QACJ,CAAC;QACD,OAAO;YACL,EAAE;YACF,cAAc;YACd,IAAI;SACL,CAAC;IACJ,CAAC;IAEM,KAAK,CAAC,OAAO,CAAC,SAAiB;QACpC,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,gBAAgB,CAAC,SAAS,EAAE,8BAA8B,CAAC,EAAE,CAAC;YAC/F,OAAO,qBAAqB,CAAC;QAC/B,CAAC;QACD,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,gBAAgB,CAAC,SAAS,EAAE,yBAAyB,CAAC,EAAE,CAAC;YAC1F,OAAO,gBAAgB,CAAC;QAC1B,CAAC;QACD,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,gBAAgB,CAAC,SAAS,EAAE,6BAA6B,CAAC,EAAE,CAAC;YAC9F,OAAO,WAAW,CAAC;QACrB,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { firstValueFrom } from \"rxjs\";\nimport { assert } from \"@itwin/core-bentley\";\nimport { CLASS_NAME_Classification, CLASS_NAME_ClassificationTable, CLASS_NAME_GeometricElement2d } from \"../../../common/internal/ClassNameDefinitions.js\";\nimport { createFilteredTree, FilteredNodesHandler } from \"../../../common/internal/visibility/BaseFilteredTree.js\";\n\nimport type { Id64Set, Id64String } from \"@itwin/core-bentley\";\nimport type { HierarchyFilteringPath } from \"@itwin/presentation-hierarchies\";\nimport type { ECClassHierarchyInspector } from \"@itwin/presentation-shared\";\nimport type { CategoryId, ElementId, ModelId } from \"../../../common/internal/Types.js\";\nimport type { BaseFilteredTreeNode, FilteredTree, FilteredTreeNodeChildren } from \"../../../common/internal/visibility/BaseFilteredTree.js\";\nimport type { ClassificationsTreeIdsCache } from \"../ClassificationsTreeIdsCache.js\";\n\ninterface ClassificationTableFilteredTreeNode extends BaseFilteredTreeNode<ClassificationTableFilteredTreeNode> {\n  type: \"classificationTable\";\n}\n\ninterface ClassificationFilteredTreeNode extends BaseFilteredTreeNode<ClassificationFilteredTreeNode> {\n  type: \"classification\";\n}\n\ninterface Element2dFilteredTreeNode extends BaseFilteredTreeNode<Element2dFilteredTreeNode> {\n  type: \"element2d\";\n  categoryId: Id64String;\n  modelId: Id64String;\n}\n\ninterface Element3dFilteredTreeNode extends BaseFilteredTreeNode<Element3dFilteredTreeNode> {\n  type: \"element3d\";\n  categoryId: Id64String;\n  modelId: Id64String;\n}\n\ntype FilteredTreeNode = ClassificationTableFilteredTreeNode | ClassificationFilteredTreeNode | Element2dFilteredTreeNode | Element3dFilteredTreeNode;\n\ntype TemporaryElement2dFilteredNode = Omit<Element2dFilteredTreeNode, \"modelId\" | \"categoryId\" | \"children\"> & {\n  modelId: string | undefined;\n  categoryId: string | undefined;\n  children?: FilteredTreeNodeChildren<TemporaryElement2dFilteredNode>;\n};\n\ntype TemporaryElement3dFilteredNode = Omit<Element3dFilteredTreeNode, \"modelId\" | \"categoryId\" | \"children\"> & {\n  modelId: string | undefined;\n  categoryId: string | undefined;\n  children?: FilteredTreeNodeChildren<TemporaryElement3dFilteredNode>;\n};\n\ntype TemporaryFilteredTreeNode =\n  | ClassificationTableFilteredTreeNode\n  | ClassificationFilteredTreeNode\n  | TemporaryElement2dFilteredNode\n  | TemporaryElement3dFilteredNode;\n\n/** @internal */\nexport interface ClassificationsTreeFilterTargets {\n  elements2d?: Array<{ modelId: Id64String; categoryId: Id64String; elements: Map<ElementId, { isFilterTarget: boolean }> }>;\n  elements3d?: Array<{ modelId: Id64String; categoryId: Id64String; elements: Map<ElementId, { isFilterTarget: boolean }> }>;\n  classificationTableIds?: Id64Set;\n  classificationIds?: Id64Set;\n}\n\n/** @internal */\nexport async function createFilteredClassificationsTree(props: {\n  imodelAccess: ECClassHierarchyInspector;\n  filteringPaths: HierarchyFilteringPath[];\n  idsCache: ClassificationsTreeIdsCache;\n}): Promise<FilteredTree<ClassificationsTreeFilterTargets>> {\n  const { imodelAccess, filteringPaths, idsCache } = props;\n  return createFilteredTree({\n    filteredNodesHandler: new ClassificationsTreeFilteredNodesHandler({ idsCache, imodelAccess }),\n    filteringPaths,\n  });\n}\n\ninterface FilterTargetsInternal {\n  elements2d?: Map<ModelCategoryKey, Map<ElementId, { isFilterTarget: boolean }>>;\n  elements3d?: Map<ModelCategoryKey, Map<ElementId, { isFilterTarget: boolean }>>;\n  classificationTableIds?: Id64Set;\n  classificationIds?: Id64Set;\n}\n\ninterface ClassificationsTreeFilteredNodesHandlerProps {\n  idsCache: ClassificationsTreeIdsCache;\n  imodelAccess: ECClassHierarchyInspector;\n}\n\ntype ModelCategoryKey = `${ModelId}-${CategoryId}`;\n\ninterface ProcessedFilteredNodes {\n  filtered2dElements: Map<Id64String, Omit<Element2dFilteredTreeNode, \"children\">>;\n  filtered3dElements: Map<Id64String, Omit<Element3dFilteredTreeNode, \"children\">>;\n}\n\nclass ClassificationsTreeFilteredNodesHandler extends FilteredNodesHandler<\n  ProcessedFilteredNodes,\n  ClassificationsTreeFilterTargets,\n  TemporaryFilteredTreeNode\n> {\n  readonly #props: ClassificationsTreeFilteredNodesHandlerProps;\n  constructor(props: ClassificationsTreeFilteredNodesHandlerProps) {\n    super();\n    this.#props = props;\n  }\n\n  public async getProcessedFilteredNodes(): Promise<ProcessedFilteredNodes> {\n    const filteredTemporary2dElements = new Map<Id64String, Omit<TemporaryElement2dFilteredNode, \"children\">>();\n    const filteredTemporary3dElements = new Map<Id64String, Omit<TemporaryElement3dFilteredNode, \"children\">>();\n    const result: ProcessedFilteredNodes = {\n      filtered2dElements: new Map(),\n      filtered3dElements: new Map(),\n    };\n    for (const node of this.filteredNodesArr) {\n      if (node.type === \"element2d\") {\n        filteredTemporary2dElements.set(node.id, node);\n      } else if (node.type === \"element3d\") {\n        filteredTemporary3dElements.set(node.id, node);\n      }\n    }\n\n    const filteredElementsModels = await firstValueFrom(\n      this.#props.idsCache.getFilteredElementsData({\n        element2dIds: [...filteredTemporary2dElements.keys()],\n        element3dIds: [...filteredTemporary3dElements.keys()],\n      }),\n    );\n    filteredTemporary2dElements.forEach((element, id) => {\n      const entry = filteredElementsModels.get(element.id);\n      assert(entry !== undefined);\n      result.filtered2dElements.set(id, { ...element, modelId: entry.modelId, categoryId: entry.categoryId });\n    });\n    filteredTemporary3dElements.forEach((element, id) => {\n      const entry = filteredElementsModels.get(element.id);\n      assert(entry !== undefined);\n      result.filtered3dElements.set(id, { ...element, modelId: entry.modelId, categoryId: entry.categoryId });\n    });\n    return result;\n  }\n\n  public convertNodesToFilterTargets(\n    filteredNodes: TemporaryFilteredTreeNode[],\n    processedFilteredNodes: ProcessedFilteredNodes,\n  ): ClassificationsTreeFilterTargets | undefined {\n    const filterTargets: FilterTargetsInternal = {};\n\n    filteredNodes.forEach((filteredNode) => this.collectFilterTargets(filterTargets, filteredNode, processedFilteredNodes));\n\n    return this.convertInternalFilterTargets(filterTargets);\n  }\n\n  private convertInternalFilterTargets(filterTargets: FilterTargetsInternal): ClassificationsTreeFilterTargets | undefined {\n    if (!filterTargets.classificationIds && !filterTargets.classificationIds && !filterTargets.elements2d && !filterTargets.elements3d) {\n      return undefined;\n    }\n\n    return {\n      classificationIds: filterTargets.classificationIds,\n      classificationTableIds: filterTargets.classificationIds,\n      elements2d: filterTargets.elements2d\n        ? [...filterTargets.elements2d?.entries()].map(([modelCategoryKey, elements]) => {\n            const { modelId, categoryId } = this.parseModelCategoryKey(modelCategoryKey);\n            return { modelId, categoryId, elements };\n          })\n        : undefined,\n      elements3d: filterTargets.elements3d\n        ? [...filterTargets.elements3d?.entries()].map(([modelCategoryKey, elements]) => {\n            const { modelId, categoryId } = this.parseModelCategoryKey(modelCategoryKey);\n            return { modelId, categoryId, elements };\n          })\n        : undefined,\n    };\n  }\n\n  private collectFilterTargets(changeTargets: FilterTargetsInternal, node: TemporaryFilteredTreeNode, processedFilteredNodes: ProcessedFilteredNodes) {\n    const filteredNode =\n      node.type === \"element2d\"\n        ? processedFilteredNodes.filtered2dElements.get(node.id)\n        : node.type === \"element3d\"\n          ? processedFilteredNodes.filtered3dElements.get(node.id)\n          : node;\n    assert(filteredNode !== undefined);\n    if (filteredNode.isFilterTarget) {\n      this.addTarget(changeTargets, filteredNode);\n      return;\n    }\n\n    if (filteredNode.type === \"element2d\" || filteredNode.type === \"element3d\") {\n      // need to add parent ids as filter target will be an element\n      this.addTarget(changeTargets, filteredNode);\n    }\n\n    if (!node.children) {\n      return;\n    }\n\n    for (const child of node.children.values()) {\n      this.collectFilterTargets(changeTargets, child, processedFilteredNodes);\n    }\n  }\n\n  private addTarget(filterTargets: FilterTargetsInternal, node: FilteredTreeNode) {\n    switch (node.type) {\n      case \"classificationTable\":\n        (filterTargets.classificationTableIds ??= new Set()).add(node.id);\n        return;\n      case \"classification\":\n        (filterTargets.classificationIds ??= new Set()).add(node.id);\n        return;\n      case \"element2d\":\n        const element2dKey = this.createModelCategoryKey(node.modelId, node.categoryId);\n        const elements2d = (filterTargets.elements2d ??= new Map()).get(element2dKey);\n        if (elements2d) {\n          elements2d.set(node.id, { isFilterTarget: node.isFilterTarget });\n        } else {\n          filterTargets.elements2d.set(element2dKey, new Map([[node.id, { isFilterTarget: node.isFilterTarget }]]));\n        }\n        return;\n      case \"element3d\":\n        const element3dKey = this.createModelCategoryKey(node.modelId, node.categoryId);\n        const elements3d = (filterTargets.elements3d ??= new Map()).get(element3dKey);\n        if (elements3d) {\n          elements3d.set(node.id, { isFilterTarget: node.isFilterTarget });\n        } else {\n          filterTargets.elements3d.set(element3dKey, new Map([[node.id, { isFilterTarget: node.isFilterTarget }]]));\n        }\n        return;\n    }\n  }\n\n  private createModelCategoryKey(modelId: Id64String, categoryId: Id64String): ModelCategoryKey {\n    return `${modelId}-${categoryId}`;\n  }\n\n  private parseModelCategoryKey(key: ModelCategoryKey): { modelId: Id64String; categoryId: Id64String } {\n    const [modelId, categoryId] = key.split(\"-\");\n    return { modelId, categoryId };\n  }\n\n  public createFilteredTreeNode({\n    type,\n    id,\n    isFilterTarget,\n  }: {\n    type: FilteredTreeNode[\"type\"];\n    id: Id64String;\n    isFilterTarget: boolean;\n  }): TemporaryFilteredTreeNode {\n    if (type === \"element2d\" || type === \"element3d\") {\n      return {\n        id,\n        isFilterTarget,\n        type,\n        modelId: undefined,\n        categoryId: undefined,\n      };\n    }\n    return {\n      id,\n      isFilterTarget,\n      type,\n    };\n  }\n\n  public async getType(className: string): Promise<TemporaryFilteredTreeNode[\"type\"]> {\n    if (await this.#props.imodelAccess.classDerivesFrom(className, CLASS_NAME_ClassificationTable)) {\n      return \"classificationTable\";\n    }\n    if (await this.#props.imodelAccess.classDerivesFrom(className, CLASS_NAME_Classification)) {\n      return \"classification\";\n    }\n    if (await this.#props.imodelAccess.classDerivesFrom(className, CLASS_NAME_GeometricElement2d)) {\n      return \"element2d\";\n    }\n    return \"element3d\";\n  }\n}\n"]}

package/lib/esm/tree-widget-react/components/trees/common/internal/visibility/BaseFilteredTree.d.ts

@@ -1,91 +0,0 @@
-import { HierarchyFilteringPath, HierarchyNode } from "@itwin/presentation-hierarchies";
-import type { Id64String } from "@itwin/core-bentley";
-import type { ClassGroupingNodeKey, InstancesNodeKey } from "@itwin/presentation-hierarchies";
-import type { InstanceKey } from "@itwin/presentation-shared";
-/** @internal */
-export type FilteredTreeNodeChildren<TFilteredTreeNode> = Map<Id64String, TFilteredTreeNode>;
-/**
- * A generic interface for a filtered tree root node.
- *
- * It differs from `BaseFilteredTreeNode` in that it only contains children details and nothing else.
- * @internal
- */
-export interface FilteredTreeRootNode<TFilteredTreeNode extends BaseFilteredTreeNode<TFilteredTreeNode>> {
-    children: FilteredTreeNodeChildren<TFilteredTreeNode>;
-}
-/**
- * A generic interface for a filtered tree node.
- *
- * It represents every node in a filtered tree structure.
- * @internal
- * */
-export interface BaseFilteredTreeNode<TFilteredTreeNode extends BaseFilteredTreeNode<TFilteredTreeNode>> {
-    type: string;
-    id: Id64String;
-    children?: FilteredTreeNodeChildren<TFilteredTreeNode>;
-    isFilterTarget: boolean;
-}
-/**
- * Class that provides methods to handle filtered nodes in a tree structure.
- *
- * It provides two methods that can be shared across different filtered trees:
- * - `processFilteredNodes` - processes filtered nodes and returns a function to get filter targets for a node.
- * - `accept` - accepts a new node and adds it to the tree structure.
- * @internal
- */
-export declare abstract class FilteredNodesHandler<TProcessedFilteredNodes, TFilterTargets, TFilteredTreeNode extends BaseFilteredTreeNode<TFilteredTreeNode>> {
-    readonly root: FilteredTreeRootNode<TFilteredTreeNode>;
-    readonly filteredNodesArr: TFilteredTreeNode[];
-    /** Returns filtered tree node type based on its' className */
-    abstract getType(className: string): Promise<TFilteredTreeNode["type"]>;
-    /** Converts nodes to filter targets */
-    abstract convertNodesToFilterTargets(filteredNodes: TFilteredTreeNode[], processedFilteredNodes: TProcessedFilteredNodes): TFilterTargets | undefined;
-    /**
-     * Processes filtered nodes.
-     *
-     * Nodes are created using filtering paths, and some information is not present in the filtering paths.
-     * Because of this, some nodes may need to be processed to get additional information.
-     *
-     * E.g. Retrieving categoryId of elements can't be done using filtering paths.
-     */
-    abstract getProcessedFilteredNodes(): Promise<TProcessedFilteredNodes>;
-    /** Creates filtered nodes  */
-    abstract createFilteredTreeNode(props: {
-        type: TFilteredTreeNode["type"];
-        id: Id64String;
-        isFilterTarget: boolean;
-        parent: TFilteredTreeNode | FilteredTreeRootNode<TFilteredTreeNode>;
-    }): TFilteredTreeNode;
-    processFilteredNodes(): Promise<{
-        getNodeFilterTargets: (node: HierarchyNode & {
-            key: ClassGroupingNodeKey | InstancesNodeKey;
-        }) => TFilterTargets | undefined;
-    }>;
-    /** Takes a new node and adds it to the tree structure. */
-    accept(props: {
-        instanceKey: InstanceKey;
-        parentNode: TFilteredTreeNode | FilteredTreeRootNode<TFilteredTreeNode>;
-        isFilterTarget: boolean;
-    }): Promise<TFilteredTreeNode>;
-    /** Takes a specific node and gets all filter targets related to it. */
-    private getNodeFilterTargets;
-    /** Finds filtered nodes that match the given keys. */
-    private findMatchingFilteredNodes;
-}
-/** @internal */
-export interface FilteredTree<TFilterTargets> {
-    getFilterTargets: (node: HierarchyNode & {
-        key: ClassGroupingNodeKey | InstancesNodeKey;
-    }) => TFilterTargets | undefined;
-}
-/** @internal */
-export interface CreateFilteredTreeProps<TProcessedFilteredNodes, TFilterTargets, TFilteredTreeNode extends BaseFilteredTreeNode<TFilteredTreeNode>> {
-    filteredNodesHandler: FilteredNodesHandler<TProcessedFilteredNodes, TFilterTargets, TFilteredTreeNode>;
-    filteringPaths: HierarchyFilteringPath[];
-}
-/**
- * Function iterates over filtering paths and creates uses `filteredNodesHandler` to create a filtered tree.
- * @internal
- */
-export declare function createFilteredTree<TProcessedFilteredNodes, TFilterTargets, TFilteredTreeNode extends BaseFilteredTreeNode<TFilteredTreeNode>>(props: CreateFilteredTreeProps<TProcessedFilteredNodes, TFilterTargets, TFilteredTreeNode>): Promise<FilteredTree<TFilterTargets>>;
-//# sourceMappingURL=BaseFilteredTree.d.ts.map

package/lib/esm/tree-widget-react/components/trees/common/internal/visibility/BaseFilteredTree.js

@@ -1,112 +0,0 @@
-/*---------------------------------------------------------------------------------------------
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
- * See LICENSE.md in the project root for license terms and full copyright notice.
- *--------------------------------------------------------------------------------------------*/
-import { Id64 } from "@itwin/core-bentley";
-import { HierarchyFilteringPath, HierarchyNode, HierarchyNodeIdentifier, HierarchyNodeKey } from "@itwin/presentation-hierarchies";
-/**
- * Class that provides methods to handle filtered nodes in a tree structure.
- *
- * It provides two methods that can be shared across different filtered trees:
- * - `processFilteredNodes` - processes filtered nodes and returns a function to get filter targets for a node.
- * - `accept` - accepts a new node and adds it to the tree structure.
- * @internal
- */
-export class FilteredNodesHandler {
-    root = {
-        children: new Map(),
-    };
-    filteredNodesArr = new Array();
-    async processFilteredNodes() {
-        const processedFilteredNodes = await this.getProcessedFilteredNodes();
-        return {
-            getNodeFilterTargets: (node) => this.getNodeFilterTargets(node, processedFilteredNodes),
-        };
-    }
-    /** Takes a new node and adds it to the tree structure. */
-    async accept(props) {
-        const { instanceKey, parentNode, isFilterTarget } = props;
-        const type = await this.getType(instanceKey.className);
-        const newNode = this.createFilteredTreeNode({
-            type,
-            id: instanceKey.id,
-            isFilterTarget,
-            parent: parentNode,
-        });
-        (parentNode.children ??= new Map()).set(instanceKey.id, newNode);
-        this.filteredNodesArr.push(newNode);
-        return newNode;
-    }
-    /** Takes a specific node and gets all filter targets related to it. */
-    getNodeFilterTargets(node, processedFilteredNodes) {
-        let lookupParents = [this.root];
-        // find the filtered parent nodes of the `node`
-        for (const parentKey of node.parentKeys) {
-            if (!HierarchyNodeKey.isInstances(parentKey)) {
-                continue;
-            }
-            // tree node might be merged from multiple instances. As filtered tree stores only one instance per node, we need to find all matching nodes
-            // and use them when checking for matching node in one level deeper.
-            const parentNodes = this.findMatchingFilteredNodes(lookupParents, parentKey.instanceKeys.map((key) => key.id));
-            if (parentNodes.length === 0) {
-                return undefined;
-            }
-            lookupParents = parentNodes;
-        }
-        const ids = HierarchyNode.isInstancesNode(node) ? node.key.instanceKeys.map(({ id }) => id) : node.groupedInstanceKeys.map(({ id }) => id);
-        // find filtered nodes that match the `node`
-        const filteredNodes = this.findMatchingFilteredNodes(lookupParents, ids);
-        if (filteredNodes.length === 0) {
-            return undefined;
-        }
-        return this.convertNodesToFilterTargets(filteredNodes, processedFilteredNodes);
-    }
-    /** Finds filtered nodes that match the given keys. */
-    findMatchingFilteredNodes(lookupParents, ids) {
-        return lookupParents.flatMap((lookup) => {
-            const childrenArray = Array();
-            for (const id of Id64.iterable(ids)) {
-                const node = lookup.children?.get(id);
-                if (node) {
-                    childrenArray.push(node);
-                }
-            }
-            return childrenArray;
-        });
-    }
-}
-/**
- * Function iterates over filtering paths and creates uses `filteredNodesHandler` to create a filtered tree.
- * @internal
- */
-export async function createFilteredTree(props) {
-    const { filteringPaths, filteredNodesHandler } = props;
-    for (const filteringPath of filteringPaths) {
-        const normalizedPath = HierarchyFilteringPath.normalize(filteringPath).path;
-        let parentNode = filteredNodesHandler.root;
-        for (let i = 0; i < normalizedPath.length; ++i) {
-            if ("type" in parentNode && "isFilterTarget" in parentNode && parentNode.isFilterTarget) {
-                break;
-            }
-            const identifier = normalizedPath[i];
-            if (!HierarchyNodeIdentifier.isInstanceNodeIdentifier(identifier)) {
-                break;
-            }
-            const currentNode = parentNode.children?.get(identifier.id);
-            if (currentNode !== undefined) {
-                parentNode = currentNode;
-                continue;
-            }
-            parentNode = await filteredNodesHandler.accept({
-                instanceKey: identifier,
-                parentNode,
-                isFilterTarget: i === normalizedPath.length - 1,
-            });
-        }
-    }
-    const processedFilteredNodes = await filteredNodesHandler.processFilteredNodes();
-    return {
-        getFilterTargets: (node) => processedFilteredNodes.getNodeFilterTargets(node),
-    };
-}
-//# sourceMappingURL=BaseFilteredTree.js.map

package/lib/esm/tree-widget-react/components/trees/common/internal/visibility/BaseFilteredTree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"BaseFilteredTree.js","sourceRoot":"","sources":["../../../../../../../../src/tree-widget-react/components/trees/common/internal/visibility/BaseFilteredTree.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG,OAAO,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAC3C,OAAO,EAAE,sBAAsB,EAAE,aAAa,EAAE,uBAAuB,EAAE,gBAAgB,EAAE,MAAM,iCAAiC,CAAC;AAgCnI;;;;;;;GAOG;AACH,MAAM,OAAgB,oBAAoB;IACxB,IAAI,GAA4C;QAC9D,QAAQ,EAAE,IAAI,GAAG,EAAE;KACpB,CAAC;IACc,gBAAgB,GAAG,IAAI,KAAK,EAAqB,CAAC;IAuB3D,KAAK,CAAC,oBAAoB;QAG/B,MAAM,sBAAsB,GAAG,MAAM,IAAI,CAAC,yBAAyB,EAAE,CAAC;QACtE,OAAO;YACL,oBAAoB,EAAE,CAAC,IAAsE,EAAE,EAAE,CAAC,IAAI,CAAC,oBAAoB,CAAC,IAAI,EAAE,sBAAsB,CAAC;SAC1J,CAAC;IACJ,CAAC;IAED,0DAA0D;IACnD,KAAK,CAAC,MAAM,CAAC,KAInB;QACC,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,cAAc,EAAE,GAAG,KAAK,CAAC;QAC1D,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QAEvD,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC;YAC1C,IAAI;YACJ,EAAE,EAAE,WAAW,CAAC,EAAE;YAClB,cAAc;YACd,MAAM,EAAE,UAAU;SACnB,CAAC,CAAC;QACH,CAAC,UAAU,CAAC,QAAQ,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QACjE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpC,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,uEAAuE;IAC/D,oBAAoB,CAC1B,IAAsE,EACtE,sBAA+C;QAE/C,IAAI,aAAa,GAAuE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEpG,+CAA+C;QAC/C,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACxC,IAAI,CAAC,gBAAgB,CAAC,WAAW,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC7C,SAAS;YACX,CAAC;YAED,4IAA4I;YAC5I,oEAAoE;YACpE,MAAM,WAAW,GAAG,IAAI,CAAC,yBAAyB,CAChD,aAAa,EACb,SAAS,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAC5C,CAAC;YACF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC7B,OAAO,SAAS,CAAC;YACnB,CAAC;YACD,aAAa,GAAG,WAAW,CAAC;QAC9B,CAAC;QAED,MAAM,GAAG,GAAG,aAAa,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC3I,4CAA4C;QAC5C,MAAM,aAAa,GAAG,IAAI,CAAC,yBAAyB,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;QACzE,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,OAAO,IAAI,CAAC,2BAA2B,CAAC,aAAa,EAAE,sBAAsB,CAAC,CAAC;IACjF,CAAC;IAED,sDAAsD;IAC9C,yBAAyB,CAAC,aAAiF,EAAE,GAAY;QAC/H,OAAO,aAAa,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE;YACtC,MAAM,aAAa,GAAG,KAAK,EAAqB,CAAC;YACjD,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBACpC,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;gBACtC,IAAI,IAAI,EAAE,CAAC;oBACT,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;YACD,OAAO,aAAa,CAAC;QACvB,CAAC,CAAC,CAAC;IACL,CAAC;CACF;AAaD;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,KAA0F;IAE1F,MAAM,EAAE,cAAc,EAAE,oBAAoB,EAAE,GAAG,KAAK,CAAC;IAEvD,KAAK,MAAM,aAAa,IAAI,cAAc,EAAE,CAAC;QAC3C,MAAM,cAAc,GAAG,sBAAsB,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC;QAE5E,IAAI,UAAU,GAAgE,oBAAoB,CAAC,IAAI,CAAC;QACxG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;YAC/C,IAAI,MAAM,IAAI,UAAU,IAAI,gBAAgB,IAAI,UAAU,IAAI,UAAU,CAAC,cAAc,EAAE,CAAC;gBACxF,MAAM;YACR,CAAC;YAED,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YAErC,IAAI,CAAC,uBAAuB,CAAC,wBAAwB,CAAC,UAAU,CAAC,EAAE,CAAC;gBAClE,MAAM;YACR,CAAC;YAED,MAAM,WAAW,GAAkC,UAAU,CAAC,QAAQ,EAAE,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YAC3F,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;gBAC9B,UAAU,GAAG,WAAW,CAAC;gBACzB,SAAS;YACX,CAAC;YACD,UAAU,GAAG,MAAM,oBAAoB,CAAC,MAAM,CAAC;gBAC7C,WAAW,EAAE,UAAU;gBACvB,UAAU;gBACV,cAAc,EAAE,CAAC,KAAK,cAAc,CAAC,MAAM,GAAG,CAAC;aAChD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,MAAM,sBAAsB,GAAG,MAAM,oBAAoB,CAAC,oBAAoB,EAAE,CAAC;IACjF,OAAO;QACL,gBAAgB,EAAE,CAAC,IAAsE,EAAE,EAAE,CAAC,sBAAsB,CAAC,oBAAoB,CAAC,IAAI,CAAC;KAChJ,CAAC;AACJ,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { Id64 } from \"@itwin/core-bentley\";\nimport { HierarchyFilteringPath, HierarchyNode, HierarchyNodeIdentifier, HierarchyNodeKey } from \"@itwin/presentation-hierarchies\";\n\nimport type { Id64Arg, Id64String } from \"@itwin/core-bentley\";\nimport type { ClassGroupingNodeKey, InstancesNodeKey } from \"@itwin/presentation-hierarchies\";\nimport type { InstanceKey } from \"@itwin/presentation-shared\";\n\n/** @internal */\nexport type FilteredTreeNodeChildren<TFilteredTreeNode> = Map<Id64String, TFilteredTreeNode>;\n\n/**\n * A generic interface for a filtered tree root node.\n *\n * It differs from `BaseFilteredTreeNode` in that it only contains children details and nothing else.\n * @internal\n */\nexport interface FilteredTreeRootNode<TFilteredTreeNode extends BaseFilteredTreeNode<TFilteredTreeNode>> {\n  children: FilteredTreeNodeChildren<TFilteredTreeNode>;\n}\n\n/**\n * A generic interface for a filtered tree node.\n *\n * It represents every node in a filtered tree structure.\n * @internal\n * */\nexport interface BaseFilteredTreeNode<TFilteredTreeNode extends BaseFilteredTreeNode<TFilteredTreeNode>> {\n  type: string;\n  id: Id64String;\n  children?: FilteredTreeNodeChildren<TFilteredTreeNode>;\n  isFilterTarget: boolean;\n}\n\n/**\n * Class that provides methods to handle filtered nodes in a tree structure.\n *\n * It provides two methods that can be shared across different filtered trees:\n * - `processFilteredNodes` - processes filtered nodes and returns a function to get filter targets for a node.\n * - `accept` - accepts a new node and adds it to the tree structure.\n * @internal\n */\nexport abstract class FilteredNodesHandler<TProcessedFilteredNodes, TFilterTargets, TFilteredTreeNode extends BaseFilteredTreeNode<TFilteredTreeNode>> {\n  public readonly root: FilteredTreeRootNode<TFilteredTreeNode> = {\n    children: new Map(),\n  };\n  public readonly filteredNodesArr = new Array<TFilteredTreeNode>();\n\n  /** Returns filtered tree node type based on its' className */\n  public abstract getType(className: string): Promise<TFilteredTreeNode[\"type\"]>;\n  /** Converts nodes to filter targets */\n  public abstract convertNodesToFilterTargets(filteredNodes: TFilteredTreeNode[], processedFilteredNodes: TProcessedFilteredNodes): TFilterTargets | undefined;\n  /**\n   * Processes filtered nodes.\n   *\n   * Nodes are created using filtering paths, and some information is not present in the filtering paths.\n   * Because of this, some nodes may need to be processed to get additional information.\n   *\n   * E.g. Retrieving categoryId of elements can't be done using filtering paths.\n   */\n  public abstract getProcessedFilteredNodes(): Promise<TProcessedFilteredNodes>;\n  /** Creates filtered nodes  */\n  public abstract createFilteredTreeNode(props: {\n    type: TFilteredTreeNode[\"type\"];\n    id: Id64String;\n    isFilterTarget: boolean;\n    parent: TFilteredTreeNode | FilteredTreeRootNode<TFilteredTreeNode>;\n  }): TFilteredTreeNode;\n\n  public async processFilteredNodes(): Promise<{\n    getNodeFilterTargets: (node: HierarchyNode & { key: ClassGroupingNodeKey | InstancesNodeKey }) => TFilterTargets | undefined;\n  }> {\n    const processedFilteredNodes = await this.getProcessedFilteredNodes();\n    return {\n      getNodeFilterTargets: (node: HierarchyNode & { key: ClassGroupingNodeKey | InstancesNodeKey }) => this.getNodeFilterTargets(node, processedFilteredNodes),\n    };\n  }\n\n  /** Takes a new node and adds it to the tree structure. */\n  public async accept(props: {\n    instanceKey: InstanceKey;\n    parentNode: TFilteredTreeNode | FilteredTreeRootNode<TFilteredTreeNode>;\n    isFilterTarget: boolean;\n  }): Promise<TFilteredTreeNode> {\n    const { instanceKey, parentNode, isFilterTarget } = props;\n    const type = await this.getType(instanceKey.className);\n\n    const newNode = this.createFilteredTreeNode({\n      type,\n      id: instanceKey.id,\n      isFilterTarget,\n      parent: parentNode,\n    });\n    (parentNode.children ??= new Map()).set(instanceKey.id, newNode);\n    this.filteredNodesArr.push(newNode);\n    return newNode;\n  }\n\n  /** Takes a specific node and gets all filter targets related to it. */\n  private getNodeFilterTargets(\n    node: HierarchyNode & { key: ClassGroupingNodeKey | InstancesNodeKey },\n    processedFilteredNodes: TProcessedFilteredNodes,\n  ): TFilterTargets | undefined {\n    let lookupParents: Array<FilteredTreeRootNode<TFilteredTreeNode> | TFilteredTreeNode> = [this.root];\n\n    // find the filtered parent nodes of the `node`\n    for (const parentKey of node.parentKeys) {\n      if (!HierarchyNodeKey.isInstances(parentKey)) {\n        continue;\n      }\n\n      // tree node might be merged from multiple instances. As filtered tree stores only one instance per node, we need to find all matching nodes\n      // and use them when checking for matching node in one level deeper.\n      const parentNodes = this.findMatchingFilteredNodes(\n        lookupParents,\n        parentKey.instanceKeys.map((key) => key.id),\n      );\n      if (parentNodes.length === 0) {\n        return undefined;\n      }\n      lookupParents = parentNodes;\n    }\n\n    const ids = HierarchyNode.isInstancesNode(node) ? node.key.instanceKeys.map(({ id }) => id) : node.groupedInstanceKeys.map(({ id }) => id);\n    // find filtered nodes that match the `node`\n    const filteredNodes = this.findMatchingFilteredNodes(lookupParents, ids);\n    if (filteredNodes.length === 0) {\n      return undefined;\n    }\n\n    return this.convertNodesToFilterTargets(filteredNodes, processedFilteredNodes);\n  }\n\n  /** Finds filtered nodes that match the given keys. */\n  private findMatchingFilteredNodes(lookupParents: Array<FilteredTreeRootNode<TFilteredTreeNode> | TFilteredTreeNode>, ids: Id64Arg) {\n    return lookupParents.flatMap((lookup) => {\n      const childrenArray = Array<TFilteredTreeNode>();\n      for (const id of Id64.iterable(ids)) {\n        const node = lookup.children?.get(id);\n        if (node) {\n          childrenArray.push(node);\n        }\n      }\n      return childrenArray;\n    });\n  }\n}\n\n/** @internal */\nexport interface FilteredTree<TFilterTargets> {\n  getFilterTargets: (node: HierarchyNode & { key: ClassGroupingNodeKey | InstancesNodeKey }) => TFilterTargets | undefined;\n}\n\n/** @internal */\nexport interface CreateFilteredTreeProps<TProcessedFilteredNodes, TFilterTargets, TFilteredTreeNode extends BaseFilteredTreeNode<TFilteredTreeNode>> {\n  filteredNodesHandler: FilteredNodesHandler<TProcessedFilteredNodes, TFilterTargets, TFilteredTreeNode>;\n  filteringPaths: HierarchyFilteringPath[];\n}\n\n/**\n * Function iterates over filtering paths and creates uses `filteredNodesHandler` to create a filtered tree.\n * @internal\n */\nexport async function createFilteredTree<TProcessedFilteredNodes, TFilterTargets, TFilteredTreeNode extends BaseFilteredTreeNode<TFilteredTreeNode>>(\n  props: CreateFilteredTreeProps<TProcessedFilteredNodes, TFilterTargets, TFilteredTreeNode>,\n): Promise<FilteredTree<TFilterTargets>> {\n  const { filteringPaths, filteredNodesHandler } = props;\n\n  for (const filteringPath of filteringPaths) {\n    const normalizedPath = HierarchyFilteringPath.normalize(filteringPath).path;\n\n    let parentNode: FilteredTreeRootNode<TFilteredTreeNode> | TFilteredTreeNode = filteredNodesHandler.root;\n    for (let i = 0; i < normalizedPath.length; ++i) {\n      if (\"type\" in parentNode && \"isFilterTarget\" in parentNode && parentNode.isFilterTarget) {\n        break;\n      }\n\n      const identifier = normalizedPath[i];\n\n      if (!HierarchyNodeIdentifier.isInstanceNodeIdentifier(identifier)) {\n        break;\n      }\n\n      const currentNode: TFilteredTreeNode | undefined = parentNode.children?.get(identifier.id);\n      if (currentNode !== undefined) {\n        parentNode = currentNode;\n        continue;\n      }\n      parentNode = await filteredNodesHandler.accept({\n        instanceKey: identifier,\n        parentNode,\n        isFilterTarget: i === normalizedPath.length - 1,\n      });\n    }\n  }\n  const processedFilteredNodes = await filteredNodesHandler.processFilteredNodes();\n  return {\n    getFilterTargets: (node: HierarchyNode & { key: ClassGroupingNodeKey | InstancesNodeKey }) => processedFilteredNodes.getNodeFilterTargets(node),\n  };\n}\n"]}

package/lib/esm/tree-widget-react/components/trees/models-tree/internal/UseFilteredPaths.d.ts

@@ -1,41 +0,0 @@
-import { HierarchyFilteringPath } from "@itwin/presentation-hierarchies";
-import type { GuidString, Id64String } from "@itwin/core-bentley";
-import type { InstanceKey } from "@itwin/presentation-shared";
-import type { VisibilityTreeProps } from "../../common/components/VisibilityTree.js";
-import type { NormalizedHierarchyFilteringPath } from "../../common/Utils.js";
-import type { ElementsGroupInfo, ModelsTreeHierarchyConfiguration } from "../ModelsTreeDefinition.js";
-import type { ModelsTreeIdsCache } from "./ModelsTreeIdsCache.js";
-/** @internal */
-export type ModelsTreeFilteringError = "tooManyFilterMatches" | "tooManyInstancesFocused" | "unknownFilterError" | "unknownInstanceFocusError";
-/** @internal */
-export type ModelsTreeSubTreeError = "unknownSubTreeError";
-/** @internal */
-export declare function useFilteredPaths({ hierarchyConfiguration, filter, getFilteredPaths, getSubTreePaths, getModelsTreeIdsCache, onModelsFiltered, onFilteredPathsChanged, componentId, }: {
-    hierarchyConfiguration: ModelsTreeHierarchyConfiguration;
-    filter?: string;
-    getFilteredPaths?: (props: {
-        /** A function that creates filtering paths based on provided target instance keys or node label. */
-        createInstanceKeyPaths: (props: {
-            targetItems: Array<InstanceKey | ElementsGroupInfo>;
-        } | {
-            label: string;
-        }) => Promise<NormalizedHierarchyFilteringPath[]>;
-        /** Filter which would be used to create filter paths if `getFilteredPaths` wouldn't be provided. */
-        filter?: string;
-    }) => Promise<HierarchyFilteringPath[] | undefined>;
-    getSubTreePaths?: (props: {
-        /** A function that creates filtering paths based on provided target instance keys. */
-        createInstanceKeyPaths: (props: {
-            targetItems: Array<InstanceKey | ElementsGroupInfo>;
-        }) => Promise<NormalizedHierarchyFilteringPath[]>;
-    }) => Promise<HierarchyFilteringPath[]>;
-    getModelsTreeIdsCache: () => ModelsTreeIdsCache;
-    onModelsFiltered?: (modelIds: Id64String[] | undefined) => void;
-    onFilteredPathsChanged: (paths: HierarchyFilteringPath[] | undefined) => void;
-    componentId: GuidString;
-}): {
-    getPaths: VisibilityTreeProps["getFilteredPaths"] | undefined;
-    filteringError: ModelsTreeFilteringError | undefined;
-    subTreeError: ModelsTreeSubTreeError | undefined;
-};
-//# sourceMappingURL=UseFilteredPaths.d.ts.map

package/lib/esm/tree-widget-react/components/trees/models-tree/internal/UseFilteredPaths.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"UseFilteredPaths.js","sourceRoot":"","sources":["../../../../../../../src/tree-widget-react/components/trees/models-tree/internal/UseFilteredPaths.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,OAAO,CAAC;AACrD,OAAO,EAAE,cAAc,EAAE,MAAM,MAAM,CAAC;AACtC,OAAO,EAAE,sBAAsB,EAAE,uBAAuB,EAAE,gBAAgB,EAAE,MAAM,iCAAiC,CAAC;AACpH,OAAO,EAAE,0BAA0B,EAAE,MAAM,yCAAyC,CAAC;AACrF,OAAO,EAAE,2BAA2B,EAAE,kBAAkB,EAAE,MAAM,+CAA+C,CAAC;AAChH,OAAO,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AACtE,OAAO,EAAE,mBAAmB,EAAE,MAAM,qCAAqC,CAAC;AAC1E,OAAO,EAAE,2BAA2B,EAAE,MAAM,uBAAuB,CAAC;AACpE,OAAO,EAAE,oBAAoB,EAAE,MAAM,4BAA4B,CAAC;AAelE,gBAAgB;AAChB,MAAM,UAAU,gBAAgB,CAAC,EAC/B,sBAAsB,EACtB,MAAM,EACN,gBAAgB,EAChB,eAAe,EACf,qBAAqB,EACrB,gBAAgB,EAChB,sBAAsB,EACtB,WAAW,GAkBZ;IAKC,MAAM,CAAC,cAAc,EAAE,iBAAiB,CAAC,GAAG,QAAQ,CAAuC,SAAS,CAAC,CAAC;IACtG,MAAM,CAAC,YAAY,EAAE,eAAe,CAAC,GAAG,QAAQ,CAAqC,SAAS,CAAC,CAAC;IAEhG,MAAM,EAAE,aAAa,EAAE,GAAG,mBAAmB,EAAE,CAAC;IAChD,MAAM,EAAE,gBAAgB,EAAE,GAAG,0BAA0B,EAAE,CAAC;IAE1D,SAAS,CAAC,GAAG,EAAE;QACb,iBAAiB,CAAC,SAAS,CAAC,CAAC;QAC7B,eAAe,CAAC,SAAS,CAAC,CAAC;QAC3B,gBAAgB,EAAE,CAAC,SAAS,CAAC,CAAC;QAE9B,8HAA8H;QAC9H,IAAI,CAAC,gBAAgB,IAAI,CAAC,gBAAgB,IAAI,CAAC,MAAM,IAAI,CAAC,eAAe,EAAE,CAAC;YAC1E,sBAAsB,CAAC,SAAS,CAAC,CAAC;QACpC,CAAC;IACH,CAAC,EAAE,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,EAAE,gBAAgB,EAAE,sBAAsB,CAAC,CAAC,CAAC;IAE5G,MAAM,uBAAuB,GAAG,OAAO,CAErC,GAAG,EAAE;QACL,IAAI,CAAC,eAAe,EAAE,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,OAAO,KAAK,EAAE,EAAE,YAAY,EAAE,WAAW,EAAE,EAAE,EAAE;YAC7C,IAAI,CAAC;gBACH,MAAM,KAAK,GAAG,MAAM,eAAe,CAAC;oBAClC,sBAAsB,EAAE,KAAK,EAAE,EAAE,WAAW,EAAE,EAAE,EAAE,CAChD,oBAAoB,CAAC,sBAAsB,CAAC;wBAC1C,YAAY;wBACZ,WAAW;wBACX,QAAQ,EAAE,qBAAqB,EAAE;wBACjC,eAAe,EAAE,sBAAsB;wBACvC,KAAK,EAAE,WAAW;wBAClB,WAAW;wBACX,WAAW,EAAE,GAAG,WAAW,UAAU;qBACtC,CAAC;iBACL,CAAC,CAAC;gBACH,OAAO,KAAK,CAAC,GAAG,CAAC,sBAAsB,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;YAC7E,CAAC;YAAC,MAAM,CAAC;gBACP,MAAM,QAAQ,GAAG,qBAAqB,CAAC;gBACvC,eAAe,CAAC,QAAQ,CAAC,CAAC;gBAC1B,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC,CAAC;IACJ,CAAC,EAAE,CAAC,qBAAqB,EAAE,sBAAsB,EAAE,eAAe,EAAE,WAAW,CAAC,CAAC,CAAC;IAElF,MAAM,QAAQ,GAAG,OAAO,CAAsD,GAAG,EAAE;QACjF,MAAM,WAAW,GAAG,KAAK,EAAE,aAAmD,EAAE,cAAyC,EAAE,EAAE;YAC3H,sBAAsB,CAAC,aAAa,CAAC,CAAC;YACtC,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACtB,OAAO;YACT,CAAC;YAED,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,MAAM,SAAS,CAAC,aAAa,EAAE,qBAAqB,EAAE,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACrH,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAC7B,CAAC,CAAC;QAEF,IAAI,gBAAgB,EAAE,CAAC;YACrB,OAAO,KAAK,EAAE,EAAE,YAAY,EAAE,WAAW,EAAE,EAAE,EAAE;gBAC7C,IAAI,CAAC;oBACH,MAAM,YAAY,GAAG,MAAM,mBAAmB,CAAC,gBAAgB,CAAC,CAAC;oBACjE,OAAO,MAAM,0BAA0B,CAAC;wBACtC,iBAAiB,EAAE,KAAK,IAAI,EAAE;4BAC5B,MAAM,KAAK,GAAG,MAAM,oBAAoB,CAAC,sBAAsB,CAAC;gCAC9D,YAAY;gCACZ,QAAQ,EAAE,qBAAqB,EAAE;gCACjC,WAAW,EAAE,YAAY;gCACzB,eAAe,EAAE,sBAAsB;gCACvC,WAAW;gCACX,WAAW;6BACZ,CAAC,CAAC;4BACH,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,GAAG,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;wBAC7F,CAAC;wBACD,eAAe,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,uBAAuB,CAAC,EAAE,YAAY,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;wBAC3H,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,CAAC;qBAC/D,CAAC,CAAC;gBACL,CAAC;gBAAC,OAAO,CAAC,EAAE,CAAC;oBACX,MAAM,QAAQ,GAAG,CAAC,YAAY,wBAAwB,CAAC,CAAC,CAAC,yBAAyB,CAAC,CAAC,CAAC,2BAA2B,CAAC;oBACjH,IAAI,QAAQ,KAAK,yBAAyB,EAAE,CAAC;wBAC3C,MAAM,OAAO,GAAG,CAAC,YAAY,KAAK,IAAI,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,iDAAiD,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,eAAe,CAAC;wBAChJ,aAAa,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,iBAAiB,EAAE,KAAK,EAAE,CAAC,CAAC;oBAClE,CAAC;oBACD,iBAAiB,CAAC,QAAQ,CAAC,CAAC;oBAC5B,OAAO,EAAE,CAAC;gBACZ,CAAC;YACH,CAAC,CAAC;QACJ,CAAC;QAED,IAAI,gBAAgB,EAAE,CAAC;YACrB,OAAO,KAAK,EAAE,EAAE,YAAY,EAAE,WAAW,EAAE,EAAE,EAAE;gBAC7C,IAAI,CAAC;oBACH,OAAO,MAAM,0BAA0B,CAAC;wBACtC,iBAAiB,EAAE,KAAK,IAAI,EAAE;4BAC5B,MAAM,KAAK,GAAG,MAAM,gBAAgB,CAAC;gCACnC,sBAAsB,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,CACtC,oBAAoB,CAAC,sBAAsB,CAAC;oCAC1C,GAAG,KAAK;oCACR,YAAY;oCACZ,QAAQ,EAAE,qBAAqB,EAAE;oCACjC,eAAe,EAAE,sBAAsB;oCACvC,KAAK,EAAE,WAAW;oCAClB,WAAW;oCACX,WAAW;iCACZ,CAAC;gCACJ,MAAM;6BACP,CAAC,CAAC;4BACH,OAAO,KAAK,EAAE,GAAG,CAAC,sBAAsB,CAAC,SAAS,CAAC,CAAC;wBACtD,CAAC;wBACD,eAAe,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,uBAAuB,CAAC,EAAE,YAAY,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;wBAC3H,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,CAAC;qBAC/D,CAAC,CAAC;gBACL,CAAC;gBAAC,OAAO,CAAC,EAAE,CAAC;oBACX,MAAM,QAAQ,GAAG,CAAC,YAAY,wBAAwB,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,oBAAoB,CAAC;oBACvG,IAAI,QAAQ,KAAK,sBAAsB,EAAE,CAAC;wBACxC,MAAM,OAAO,GAAG,CAAC,YAAY,KAAK,IAAI,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,iDAAiD,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,eAAe,CAAC;wBAChJ,aAAa,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,iBAAiB,EAAE,KAAK,EAAE,CAAC,CAAC;oBAClE,CAAC;oBACD,iBAAiB,CAAC,QAAQ,CAAC,CAAC;oBAC5B,OAAO,EAAE,CAAC;gBACZ,CAAC;YACH,CAAC,CAAC;QACJ,CAAC;QAED,IAAI,MAAM,EAAE,CAAC;YACX,OAAO,KAAK,EAAE,EAAE,YAAY,EAAE,WAAW,EAAE,EAAE,EAAE;gBAC7C,aAAa,CAAC,EAAE,SAAS,EAAE,WAAW,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,CAAC;gBACnE,IAAI,CAAC;oBACH,OAAO,MAAM,0BAA0B,CAAC;wBACtC,iBAAiB,EAAE,KAAK,IAAI,EAAE;4BAC5B,MAAM,KAAK,GAAG,MAAM,oBAAoB,CAAC,sBAAsB,CAAC;gCAC9D,YAAY;gCACZ,KAAK,EAAE,MAAM;gCACb,QAAQ,EAAE,qBAAqB,EAAE;gCACjC,eAAe,EAAE,sBAAsB;gCACvC,WAAW;gCACX,WAAW;6BACZ,CAAC,CAAC;4BACH,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,GAAG,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;wBAC7F,CAAC;wBACD,eAAe,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,uBAAuB,CAAC,EAAE,YAAY,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;wBAC3H,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,CAAC;qBAC/D,CAAC,CAAC;gBACL,CAAC;gBAAC,OAAO,CAAC,EAAE,CAAC;oBACX,MAAM,QAAQ,GAAG,CAAC,YAAY,wBAAwB,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,oBAAoB,CAAC;oBACvG,IAAI,QAAQ,KAAK,sBAAsB,EAAE,CAAC;wBACxC,MAAM,OAAO,GAAG,CAAC,YAAY,KAAK,IAAI,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,iDAAiD,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,eAAe,CAAC;wBAChJ,aAAa,CAAC,EAAE,SAAS,EAAE,OAAO,EAAE,iBAAiB,EAAE,KAAK,EAAE,CAAC,CAAC;oBAClE,CAAC;oBACD,iBAAiB,CAAC,QAAQ,CAAC,CAAC;oBAC5B,OAAO,EAAE,CAAC;gBACZ,CAAC;YACH,CAAC,CAAC;QACJ,CAAC;QACD,OAAO,uBAAuB,CAAC;IACjC,CAAC,EAAE;QACD,MAAM;QACN,gBAAgB;QAChB,qBAAqB;QACrB,aAAa;QACb,gBAAgB;QAChB,sBAAsB;QACtB,gBAAgB;QAChB,sBAAsB;QACtB,uBAAuB;QACvB,WAAW;KACZ,CAAC,CAAC;IAEH,OAAO;QACL,QAAQ;QACR,cAAc;QACd,YAAY;KACb,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,SAAS,CAAC,KAA+B,EAAE,QAA4B,EAAE,cAAyC;IAC/H,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,cAAc,GAAG,IAAI,GAAG,EAAc,CAAC;IAC7C,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAc,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,uBAAuB,CAAC,wBAAwB,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChE,MAAM;YACR,CAAC;YAED,sEAAsE;YACtE,IAAI,CAAC,KAAK,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,CAAC,SAAS,KAAK,kBAAkB,EAAE,CAAC;gBAC3E,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBAClC,MAAM;YACR,CAAC;YAED,gDAAgD;YAChD,IAAI,MAAM,cAAc,CAAC,gBAAgB,CAAC,QAAQ,CAAC,SAAS,EAAE,2BAA2B,CAAC,EAAE,CAAC;gBAC3F,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,cAAc,GAAG,MAAM,cAAc,CAAC,QAAQ,CAAC,kBAAkB,CAAC,gBAAgB,CAAC,CAAC,CAAC;IAC3F,OAAO,CAAC,GAAG,cAAc,EAAE,GAAG,cAAc,CAAC,CAAC;AAChD,CAAC;AAED,KAAK,UAAU,mBAAmB,CAAC,gBAAkF;IACnH,MAAM,YAAY,GAA2C,EAAE,CAAC;IAChE,MAAM,iBAAiB,GAKlB,EAAE,CAAC;IACR,IAAI,KAAK,EAAE,MAAM,GAAG,IAAI,gBAAgB,EAAE,EAAE,CAAC;QAC3C,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;YAChB,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACvB,SAAS;QACX,CAAC;QAED,IAAI,CAAC,gBAAgB,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC/C,SAAS;QACX,CAAC;QAED,MAAM,YAAY,GAAG,GAAiC,CAAC;QACvD,IAAI,CAAC,YAAY,CAAC,mBAAmB,IAAI,CAAC,gBAAgB,CAAC,WAAW,CAAC,YAAY,CAAC,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC;YAC7G,SAAS;QACX,CAAC;QAED,MAAM,SAAS,GAAG,YAAY,CAAC,mBAAmB,CAAC,GAAG,CAAC;QACvD,MAAM,IAAI,GAAG,YAAY,CAAC,mBAAmB,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC;QAChG,MAAM,QAAQ,GAAG,CAAE,YAAY,CAAC,mBAAmB,CAAC,YAAY,EAAE,QAA2B,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QAC3H,iBAAiB,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC,CAAC;IAClF,CAAC;IACD,YAAY,CAAC,IAAI,CACf,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,EAAE,UAAU,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/E,MAAM,EACJ,UAAU,KAAK,SAAS;YACtB,CAAC,CAAC,EAAE,IAAI,EAAE,SAAkB,EAAE,GAAG,EAAE,SAAS,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAChF,CAAC,CAAC,EAAE,IAAI,EAAE,UAAmB,EAAE,GAAG,EAAE,SAAS,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE;QAC/F,YAAY;KACb,CAAC,CAAC,CACJ,CAAC;IACF,OAAO,YAAY,CAAC;AACtB,CAAC;AAED,KAAK,UAAU,0BAA0B,CAAC,EACxC,eAAe,EACf,iBAAiB,EACjB,WAAW,GAKZ;IACC,MAAM,CAAC,YAAY,EAAE,WAAW,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,eAAe,EAAE,EAAE,iBAAiB,EAAE,CAAC,CAAC,CAAC;IAChG,IAAI,WAAiD,CAAC;IACtD,IAAI,CAAC;QACH,IAAI,YAAY,IAAI,WAAW,EAAE,CAAC;YAChC,OAAO,CAAC,WAAW,GAAG,2BAA2B,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC,CAAC;QAChF,CAAC;QACD,IAAI,YAAY,EAAE,CAAC;YACjB,OAAO,CAAC,WAAW,GAAG,YAAY,CAAC,CAAC;QACtC,CAAC;QACD,IAAI,WAAW,EAAE,CAAC;YAChB,OAAO,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;YAAS,CAAC;QACT,KAAK,WAAW,CAAC,WAAW,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { useEffect, useMemo, useState } from \"react\";\nimport { firstValueFrom } from \"rxjs\";\nimport { HierarchyFilteringPath, HierarchyNodeIdentifier, HierarchyNodeKey } from \"@itwin/presentation-hierarchies\";\nimport { useFocusedInstancesContext } from \"../../common/FocusedInstancesContext.js\";\nimport { CLASS_NAME_GeometricModel3d, CLASS_NAME_Subject } from \"../../common/internal/ClassNameDefinitions.js\";\nimport { FilterLimitExceededError } from \"../../common/TreeErrors.js\";\nimport { useTelemetryContext } from \"../../common/UseTelemetryContext.js\";\nimport { joinHierarchyFilteringPaths } from \"../../common/Utils.js\";\nimport { ModelsTreeDefinition } from \"../ModelsTreeDefinition.js\";\n\nimport type { GuidString, Id64Array, Id64String } from \"@itwin/core-bentley\";\nimport type { GroupingHierarchyNode, HierarchyNodeIdentifiersPath, InstancesNodeKey } from \"@itwin/presentation-hierarchies\";\nimport type { ECClassHierarchyInspector, InstanceKey } from \"@itwin/presentation-shared\";\nimport type { VisibilityTreeProps } from \"../../common/components/VisibilityTree.js\";\nimport type { NormalizedHierarchyFilteringPath } from \"../../common/Utils.js\";\nimport type { ClassGroupingHierarchyNode, ElementsGroupInfo, ModelsTreeHierarchyConfiguration } from \"../ModelsTreeDefinition.js\";\nimport type { ModelsTreeIdsCache } from \"./ModelsTreeIdsCache.js\";\n\n/** @internal */\nexport type ModelsTreeFilteringError = \"tooManyFilterMatches\" | \"tooManyInstancesFocused\" | \"unknownFilterError\" | \"unknownInstanceFocusError\";\n/** @internal */\nexport type ModelsTreeSubTreeError = \"unknownSubTreeError\";\n\n/** @internal */\nexport function useFilteredPaths({\n  hierarchyConfiguration,\n  filter,\n  getFilteredPaths,\n  getSubTreePaths,\n  getModelsTreeIdsCache,\n  onModelsFiltered,\n  onFilteredPathsChanged,\n  componentId,\n}: {\n  hierarchyConfiguration: ModelsTreeHierarchyConfiguration;\n  filter?: string;\n  getFilteredPaths?: (props: {\n    /** A function that creates filtering paths based on provided target instance keys or node label. */\n    createInstanceKeyPaths: (props: { targetItems: Array<InstanceKey | ElementsGroupInfo> } | { label: string }) => Promise<NormalizedHierarchyFilteringPath[]>;\n    /** Filter which would be used to create filter paths if `getFilteredPaths` wouldn't be provided. */\n    filter?: string;\n  }) => Promise<HierarchyFilteringPath[] | undefined>;\n  getSubTreePaths?: (props: {\n    /** A function that creates filtering paths based on provided target instance keys. */\n    createInstanceKeyPaths: (props: { targetItems: Array<InstanceKey | ElementsGroupInfo> }) => Promise<NormalizedHierarchyFilteringPath[]>;\n  }) => Promise<HierarchyFilteringPath[]>;\n  getModelsTreeIdsCache: () => ModelsTreeIdsCache;\n  onModelsFiltered?: (modelIds: Id64String[] | undefined) => void;\n  onFilteredPathsChanged: (paths: HierarchyFilteringPath[] | undefined) => void;\n  componentId: GuidString;\n}): {\n  getPaths: VisibilityTreeProps[\"getFilteredPaths\"] | undefined;\n  filteringError: ModelsTreeFilteringError | undefined;\n  subTreeError: ModelsTreeSubTreeError | undefined;\n} {\n  const [filteringError, setFilteringError] = useState<ModelsTreeFilteringError | undefined>(undefined);\n  const [subTreeError, setSubTreeError] = useState<ModelsTreeSubTreeError | undefined>(undefined);\n\n  const { onFeatureUsed } = useTelemetryContext();\n  const { loadFocusedItems } = useFocusedInstancesContext();\n\n  useEffect(() => {\n    setFilteringError(undefined);\n    setSubTreeError(undefined);\n    onModelsFiltered?.(undefined);\n\n    // reset filtered paths if there is no filters applied. This allows to keep current filtered paths until new paths are loaded.\n    if (!loadFocusedItems && !getFilteredPaths && !filter && !getSubTreePaths) {\n      onFilteredPathsChanged(undefined);\n    }\n  }, [loadFocusedItems, getFilteredPaths, getSubTreePaths, filter, onModelsFiltered, onFilteredPathsChanged]);\n\n  const getSubTreePathsInternal = useMemo<\n    ((...props: Parameters<Required<VisibilityTreeProps>[\"getFilteredPaths\"]>) => Promise<HierarchyNodeIdentifiersPath[]>) | undefined\n  >(() => {\n    if (!getSubTreePaths) {\n      return undefined;\n    }\n    return async ({ imodelAccess, abortSignal }) => {\n      try {\n        const paths = await getSubTreePaths({\n          createInstanceKeyPaths: async ({ targetItems }) =>\n            ModelsTreeDefinition.createInstanceKeyPaths({\n              imodelAccess,\n              targetItems,\n              idsCache: getModelsTreeIdsCache(),\n              hierarchyConfig: hierarchyConfiguration,\n              limit: \"unbounded\",\n              abortSignal,\n              componentId: `${componentId}/subTree`,\n            }),\n        });\n        return paths.map(HierarchyFilteringPath.normalize).map(({ path }) => path);\n      } catch {\n        const newError = \"unknownSubTreeError\";\n        setSubTreeError(newError);\n        return [];\n      }\n    };\n  }, [getModelsTreeIdsCache, hierarchyConfiguration, getSubTreePaths, componentId]);\n\n  const getPaths = useMemo<VisibilityTreeProps[\"getFilteredPaths\"] | undefined>(() => {\n    const handlePaths = async (filteredPaths: HierarchyFilteringPath[] | undefined, classInspector: ECClassHierarchyInspector) => {\n      onFilteredPathsChanged(filteredPaths);\n      if (!onModelsFiltered) {\n        return;\n      }\n\n      const modelIds = filteredPaths ? await getModels(filteredPaths, getModelsTreeIdsCache(), classInspector) : undefined;\n      onModelsFiltered(modelIds);\n    };\n\n    if (loadFocusedItems) {\n      return async ({ imodelAccess, abortSignal }) => {\n        try {\n          const focusedItems = await collectFocusedItems(loadFocusedItems);\n          return await createFilteringPathsResult({\n            getFilteringPaths: async () => {\n              const paths = await ModelsTreeDefinition.createInstanceKeyPaths({\n                imodelAccess,\n                idsCache: getModelsTreeIdsCache(),\n                targetItems: focusedItems,\n                hierarchyConfig: hierarchyConfiguration,\n                abortSignal,\n                componentId,\n              });\n              return paths.map(({ path, options }) => ({ path, options: { ...options, reveal: true } }));\n            },\n            getSubTreePaths: async () => (getSubTreePathsInternal ? getSubTreePathsInternal({ imodelAccess, abortSignal }) : undefined),\n            handlePaths: async (paths) => handlePaths(paths, imodelAccess),\n          });\n        } catch (e) {\n          const newError = e instanceof FilterLimitExceededError ? \"tooManyInstancesFocused\" : \"unknownInstanceFocusError\";\n          if (newError !== \"tooManyInstancesFocused\") {\n            const feature = e instanceof Error && e.message.includes(\"query too long to execute or server is too busy\") ? \"error-timeout\" : \"error-unknown\";\n            onFeatureUsed({ featureId: feature, reportInteraction: false });\n          }\n          setFilteringError(newError);\n          return [];\n        }\n      };\n    }\n\n    if (getFilteredPaths) {\n      return async ({ imodelAccess, abortSignal }) => {\n        try {\n          return await createFilteringPathsResult({\n            getFilteringPaths: async () => {\n              const paths = await getFilteredPaths({\n                createInstanceKeyPaths: async (props) =>\n                  ModelsTreeDefinition.createInstanceKeyPaths({\n                    ...props,\n                    imodelAccess,\n                    idsCache: getModelsTreeIdsCache(),\n                    hierarchyConfig: hierarchyConfiguration,\n                    limit: \"unbounded\",\n                    abortSignal,\n                    componentId,\n                  }),\n                filter,\n              });\n              return paths?.map(HierarchyFilteringPath.normalize);\n            },\n            getSubTreePaths: async () => (getSubTreePathsInternal ? getSubTreePathsInternal({ imodelAccess, abortSignal }) : undefined),\n            handlePaths: async (paths) => handlePaths(paths, imodelAccess),\n          });\n        } catch (e) {\n          const newError = e instanceof FilterLimitExceededError ? \"tooManyFilterMatches\" : \"unknownFilterError\";\n          if (newError !== \"tooManyFilterMatches\") {\n            const feature = e instanceof Error && e.message.includes(\"query too long to execute or server is too busy\") ? \"error-timeout\" : \"error-unknown\";\n            onFeatureUsed({ featureId: feature, reportInteraction: false });\n          }\n          setFilteringError(newError);\n          return [];\n        }\n      };\n    }\n\n    if (filter) {\n      return async ({ imodelAccess, abortSignal }) => {\n        onFeatureUsed({ featureId: \"filtering\", reportInteraction: true });\n        try {\n          return await createFilteringPathsResult({\n            getFilteringPaths: async () => {\n              const paths = await ModelsTreeDefinition.createInstanceKeyPaths({\n                imodelAccess,\n                label: filter,\n                idsCache: getModelsTreeIdsCache(),\n                hierarchyConfig: hierarchyConfiguration,\n                abortSignal,\n                componentId,\n              });\n              return paths.map(({ path, options }) => ({ path, options: { ...options, reveal: true } }));\n            },\n            getSubTreePaths: async () => (getSubTreePathsInternal ? getSubTreePathsInternal({ imodelAccess, abortSignal }) : undefined),\n            handlePaths: async (paths) => handlePaths(paths, imodelAccess),\n          });\n        } catch (e) {\n          const newError = e instanceof FilterLimitExceededError ? \"tooManyFilterMatches\" : \"unknownFilterError\";\n          if (newError !== \"tooManyFilterMatches\") {\n            const feature = e instanceof Error && e.message.includes(\"query too long to execute or server is too busy\") ? \"error-timeout\" : \"error-unknown\";\n            onFeatureUsed({ featureId: feature, reportInteraction: false });\n          }\n          setFilteringError(newError);\n          return [];\n        }\n      };\n    }\n    return getSubTreePathsInternal;\n  }, [\n    filter,\n    loadFocusedItems,\n    getModelsTreeIdsCache,\n    onFeatureUsed,\n    getFilteredPaths,\n    hierarchyConfiguration,\n    onModelsFiltered,\n    onFilteredPathsChanged,\n    getSubTreePathsInternal,\n    componentId,\n  ]);\n\n  return {\n    getPaths,\n    filteringError,\n    subTreeError,\n  };\n}\n\nasync function getModels(paths: HierarchyFilteringPath[], idsCache: ModelsTreeIdsCache, classInspector: ECClassHierarchyInspector) {\n  if (!paths) {\n    return undefined;\n  }\n\n  const targetModelIds = new Set<Id64String>();\n  const targetSubjectIds = new Set<Id64String>();\n  for (const path of paths) {\n    const currPath = Array.isArray(path) ? path : path.path;\n    for (let i = 0; i < currPath.length; i++) {\n      const currStep = currPath[i];\n      if (!HierarchyNodeIdentifier.isInstanceNodeIdentifier(currStep)) {\n        break;\n      }\n\n      // if paths end with subject need to get all models under that subject\n      if (i === currPath.length - 1 && currStep.className === CLASS_NAME_Subject) {\n        targetSubjectIds.add(currStep.id);\n        break;\n      }\n\n      // collect all the models from the filtered path\n      if (await classInspector.classDerivesFrom(currStep.className, CLASS_NAME_GeometricModel3d)) {\n        targetModelIds.add(currStep.id);\n      }\n    }\n  }\n\n  const matchingModels = await firstValueFrom(idsCache.getSubjectModelIds(targetSubjectIds));\n  return [...targetModelIds, ...matchingModels];\n}\n\nasync function collectFocusedItems(loadFocusedItems: () => AsyncIterableIterator<InstanceKey | GroupingHierarchyNode>) {\n  const focusedItems: Array<InstanceKey | ElementsGroupInfo> = [];\n  const groupingNodeInfos: Array<{\n    parentKey: InstancesNodeKey;\n    parentType: \"element\" | \"category\";\n    groupingNode: ClassGroupingHierarchyNode;\n    modelIds: Id64Array;\n  }> = [];\n  for await (const key of loadFocusedItems()) {\n    if (\"id\" in key) {\n      focusedItems.push(key);\n      continue;\n    }\n\n    if (!HierarchyNodeKey.isClassGrouping(key.key)) {\n      continue;\n    }\n\n    const groupingNode = key as ClassGroupingHierarchyNode;\n    if (!groupingNode.nonGroupingAncestor || !HierarchyNodeKey.isInstances(groupingNode.nonGroupingAncestor.key)) {\n      continue;\n    }\n\n    const parentKey = groupingNode.nonGroupingAncestor.key;\n    const type = groupingNode.nonGroupingAncestor.extendedData?.isCategory ? \"category\" : \"element\";\n    const modelIds = ((groupingNode.nonGroupingAncestor.extendedData?.modelIds as Id64String[][]) ?? []).flatMap((ids) => ids);\n    groupingNodeInfos.push({ groupingNode, parentType: type, parentKey, modelIds });\n  }\n  focusedItems.push(\n    ...groupingNodeInfos.map(({ parentKey, parentType, groupingNode, modelIds }) => ({\n      parent:\n        parentType === \"element\"\n          ? { type: \"element\" as const, ids: parentKey.instanceKeys.map((key) => key.id) }\n          : { type: \"category\" as const, ids: parentKey.instanceKeys.map((key) => key.id), modelIds },\n      groupingNode,\n    })),\n  );\n  return focusedItems;\n}\n\nasync function createFilteringPathsResult({\n  getSubTreePaths,\n  getFilteringPaths,\n  handlePaths,\n}: {\n  getSubTreePaths: () => Promise<HierarchyNodeIdentifiersPath[] | undefined>;\n  getFilteringPaths: () => Promise<NormalizedHierarchyFilteringPath[] | undefined>;\n  handlePaths: (filteredPaths: HierarchyFilteringPath[] | undefined) => Promise<void>;\n}): Promise<HierarchyFilteringPath[] | undefined> {\n  const [subTreePaths, filterPaths] = await Promise.all([getSubTreePaths(), getFilteringPaths()]);\n  let joinedPaths: HierarchyFilteringPath[] | undefined;\n  try {\n    if (subTreePaths && filterPaths) {\n      return (joinedPaths = joinHierarchyFilteringPaths(subTreePaths, filterPaths));\n    }\n    if (subTreePaths) {\n      return (joinedPaths = subTreePaths);\n    }\n    if (filterPaths) {\n      return (joinedPaths = filterPaths);\n    }\n  } finally {\n    void handlePaths(joinedPaths);\n  }\n  return joinedPaths;\n}\n"]}

package/lib/esm/tree-widget-react/components/trees/models-tree/internal/visibility/FilteredTree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"FilteredTree.js","sourceRoot":"","sources":["../../../../../../../../src/tree-widget-react/components/trees/models-tree/internal/visibility/FilteredTree.ts"],"names":[],"mappings":"AAAA;;;gGAGgG;AAEhG,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,OAAO,EAAE,mBAAmB,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,kDAAkD,CAAC;AAC7H,OAAO,EAAE,kBAAkB,EAAE,oBAAoB,EAAE,MAAM,yDAAyD,CAAC;AAiCnH,gBAAgB;AAChB,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAAC,KAG9C;IACC,MAAM,EAAE,YAAY,EAAE,cAAc,EAAE,GAAG,KAAK,CAAC;IAC/C,OAAO,kBAAkB,CAAC;QACxB,oBAAoB,EAAE,IAAI,8BAA8B,CAAC,EAAE,YAAY,EAAE,CAAC;QAC1E,cAAc;KACf,CAAC,CAAC;AACL,CAAC;AAeD,MAAM,8BAA+B,SAAQ,oBAAqE;IACvG,MAAM,CAAsC;IACrD,YAAY,KAA0C;QACpD,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAEM,2BAA2B,CAAC,aAAiC;QAClE,MAAM,aAAa,GAA0B,EAAE,CAAC;QAEhD,aAAa,CAAC,OAAO,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,IAAI,CAAC,oBAAoB,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC,CAAC;QAEhG,OAAO,IAAI,CAAC,4BAA4B,CAAC,aAAa,CAAC,CAAC;IAC1D,CAAC;IAEM,KAAK,CAAC,yBAAyB,KAAmB,CAAC;IAElD,4BAA4B,CAAC,aAAoC;QACvE,IAAI,CAAC,aAAa,CAAC,UAAU,IAAI,CAAC,aAAa,CAAC,UAAU,IAAI,CAAC,aAAa,CAAC,QAAQ,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC;YACjH,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,OAAO;YACL,UAAU,EAAE,aAAa,CAAC,UAAU;gBAClC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,WAAW,CAAC,EAAE,EAAE;oBACrE,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC;gBAClC,CAAC,CAAC;gBACJ,CAAC,CAAC,SAAS;YACb,QAAQ,EAAE,aAAa,CAAC,QAAQ;gBAC9B,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB,EAAE,QAAQ,CAAC,EAAE,EAAE;oBACzE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,qBAAqB,CAAC,gBAAgB,CAAC,CAAC;oBAC7E,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;gBAC3C,CAAC,CAAC;gBACJ,CAAC,CAAC,SAAS;YACb,QAAQ,EAAE,aAAa,CAAC,QAAQ;YAChC,UAAU,EAAE,aAAa,CAAC,UAAU;SACrC,CAAC;IACJ,CAAC;IAEO,oBAAoB,CAAC,aAAoC,EAAE,YAA8B;QAC/F,IAAI,YAAY,CAAC,cAAc,EAAE,CAAC;YAChC,IAAI,CAAC,SAAS,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC;YAC5C,OAAO;QACT,CAAC;QAED,IAAI,YAAY,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YACpC,6DAA6D;YAC7D,IAAI,CAAC,SAAS,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC;QAC9C,CAAC;QAED,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC;YAC3B,OAAO;QACT,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YACnD,IAAI,CAAC,oBAAoB,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAEO,SAAS,CAAC,aAAoC,EAAE,IAAsB;QAC5E,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,SAAS;gBACZ,CAAC,aAAa,CAAC,UAAU,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACtD,OAAO;YACT,KAAK,OAAO;gBACV,CAAC,aAAa,CAAC,QAAQ,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACpD,OAAO;YACT,KAAK,UAAU;gBACb,MAAM,UAAU,GAAG,CAAC,aAAa,CAAC,UAAU,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAC9E,IAAI,UAAU,EAAE,CAAC;oBACf,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACxB,OAAO;gBACT,CAAC;gBACD,aAAa,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC/D,OAAO;YACT,KAAK,SAAS;gBACZ,MAAM,gBAAgB,GAAG,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;gBACpF,MAAM,QAAQ,GAAG,CAAC,aAAa,CAAC,QAAQ,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC;gBAC9E,IAAI,QAAQ,EAAE,CAAC;oBACb,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC;gBACjE,CAAC;qBAAM,CAAC;oBACN,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,gBAAgB,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,cAAc,EAAE,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9G,CAAC;QACL,CAAC;IACH,CAAC;IAEO,sBAAsB,CAAC,OAAmB,EAAE,UAAsB;QACxE,OAAO,GAAG,OAAO,IAAI,UAAU,EAAE,CAAC;IACpC,CAAC;IAEO,qBAAqB,CAAC,GAAqB;QACjD,MAAM,CAAC,OAAO,EAAE,UAAU,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC7C,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;IACjC,CAAC;IAEM,sBAAsB,CAAC,EAC5B,IAAI,EACJ,EAAE,EACF,cAAc,EACd,MAAM,GAMP;QACC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;YAC3C,OAAO;gBACL,EAAE;gBACF,cAAc;gBACd,IAAI;aACL,CAAC;QACJ,CAAC;QAED,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;YACxB,MAAM,CAAC,MAAM,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;YACpD,OAAO;gBACL,EAAE;gBACF,cAAc;gBACd,IAAI;gBACJ,OAAO,EAAE,MAAM,CAAC,EAAE;aACnB,CAAC;QACJ,CAAC;QAED,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YACnD,OAAO;gBACL,EAAE;gBACF,cAAc;gBACd,IAAI;gBACJ,OAAO,EAAE,MAAM,CAAC,OAAO;gBACvB,UAAU,EAAE,MAAM,CAAC,EAAE;aACtB,CAAC;QACJ,CAAC;QAED,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAClD,OAAO;gBACL,EAAE;gBACF,cAAc;gBACd,IAAI;gBACJ,OAAO,EAAE,MAAM,CAAC,OAAO;gBACvB,UAAU,EAAE,MAAM,CAAC,UAAU;aAC9B,CAAC;QACJ,CAAC;QAED,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;IAC9C,CAAC;IAEM,KAAK,CAAC,OAAO,CAAC,SAAiB;QACpC,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,gBAAgB,CAAC,SAAS,EAAE,kBAAkB,CAAC,EAAE,CAAC;YACnF,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,gBAAgB,CAAC,SAAS,EAAE,gBAAgB,CAAC,EAAE,CAAC;YACjF,OAAO,OAAO,CAAC;QACjB,CAAC;QACD,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,gBAAgB,CAAC,SAAS,EAAE,mBAAmB,CAAC,EAAE,CAAC;YACpF,OAAO,UAAU,CAAC;QACpB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n * Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n * See LICENSE.md in the project root for license terms and full copyright notice.\n *--------------------------------------------------------------------------------------------*/\n\nimport { assert } from \"@itwin/core-bentley\";\nimport { CLASS_NAME_Category, CLASS_NAME_Model, CLASS_NAME_Subject } from \"../../../common/internal/ClassNameDefinitions.js\";\nimport { createFilteredTree, FilteredNodesHandler } from \"../../../common/internal/visibility/BaseFilteredTree.js\";\n\nimport type { Id64Set, Id64String } from \"@itwin/core-bentley\";\nimport type { HierarchyFilteringPath } from \"@itwin/presentation-hierarchies\";\nimport type { ECClassHierarchyInspector } from \"@itwin/presentation-shared\";\nimport type { CategoryId, ElementId, ModelId } from \"../../../common/internal/Types.js\";\nimport type { BaseFilteredTreeNode, FilteredTree, FilteredTreeRootNode } from \"../../../common/internal/visibility/BaseFilteredTree.js\";\n\ninterface GenericFilteredTreeNode extends BaseFilteredTreeNode<GenericFilteredTreeNode> {\n  type: \"subject\" | \"model\";\n}\n\ninterface CategoryFilteredTreeNode extends BaseFilteredTreeNode<CategoryFilteredTreeNode> {\n  type: \"category\";\n  modelId: Id64String;\n}\n\ninterface ElementFilteredTreeNode extends BaseFilteredTreeNode<ElementFilteredTreeNode> {\n  type: \"element\";\n  modelId: Id64String;\n  categoryId: Id64String;\n}\n\ntype FilteredTreeNode = GenericFilteredTreeNode | CategoryFilteredTreeNode | ElementFilteredTreeNode;\n\n/** @internal */\nexport interface ModelsTreeFilterTargets {\n  subjectIds?: Id64Set;\n  modelIds?: Id64Set;\n  categories?: Array<{ modelId: Id64String | undefined; categoryIds: Id64Set }>;\n  elements?: Array<{ modelId: Id64String; categoryId: Id64String; elements: Map<ElementId, { isFilterTarget: boolean }> }>;\n}\n\n/** @internal */\nexport async function createFilteredModelsTree(props: {\n  imodelAccess: ECClassHierarchyInspector;\n  filteringPaths: HierarchyFilteringPath[];\n}): Promise<FilteredTree<ModelsTreeFilterTargets>> {\n  const { imodelAccess, filteringPaths } = props;\n  return createFilteredTree({\n    filteredNodesHandler: new ModelsTreeFilteredNodesHandler({ imodelAccess }),\n    filteringPaths,\n  });\n}\n\ninterface FilterTargetsInternal {\n  subjectIds?: Id64Set;\n  modelIds?: Id64Set;\n  categories?: Map<ModelId, Set<CategoryId>>;\n  elements?: Map<ModelCategoryKey, Map<ElementId, { isFilterTarget: boolean }>>;\n}\n\ninterface ModelsTreeFilteredNodesHandlerProps {\n  imodelAccess: ECClassHierarchyInspector;\n}\n\ntype ModelCategoryKey = `${ModelId}-${CategoryId}`;\n\nclass ModelsTreeFilteredNodesHandler extends FilteredNodesHandler<void, ModelsTreeFilterTargets, FilteredTreeNode> {\n  readonly #props: ModelsTreeFilteredNodesHandlerProps;\n  constructor(props: ModelsTreeFilteredNodesHandlerProps) {\n    super();\n    this.#props = props;\n  }\n\n  public convertNodesToFilterTargets(filteredNodes: FilteredTreeNode[]): ModelsTreeFilterTargets | undefined {\n    const filterTargets: FilterTargetsInternal = {};\n\n    filteredNodes.forEach((filteredNode) => this.collectFilterTargets(filterTargets, filteredNode));\n\n    return this.convertInternalFilterTargets(filterTargets);\n  }\n\n  public async getProcessedFilteredNodes(): Promise<void> {}\n\n  private convertInternalFilterTargets(filterTargets: FilterTargetsInternal): ModelsTreeFilterTargets | undefined {\n    if (!filterTargets.categories && !filterTargets.subjectIds && !filterTargets.elements && !filterTargets.modelIds) {\n      return undefined;\n    }\n\n    return {\n      categories: filterTargets.categories\n        ? [...filterTargets.categories.entries()].map(([modelId, categoryIds]) => {\n            return { modelId, categoryIds };\n          })\n        : undefined,\n      elements: filterTargets.elements\n        ? [...filterTargets.elements.entries()].map(([modelCategoryKey, elements]) => {\n            const { modelId, categoryId } = this.parseModelCategoryKey(modelCategoryKey);\n            return { modelId, categoryId, elements };\n          })\n        : undefined,\n      modelIds: filterTargets.modelIds,\n      subjectIds: filterTargets.subjectIds,\n    };\n  }\n\n  private collectFilterTargets(changeTargets: FilterTargetsInternal, filteredNode: FilteredTreeNode) {\n    if (filteredNode.isFilterTarget) {\n      this.addTarget(changeTargets, filteredNode);\n      return;\n    }\n\n    if (filteredNode.type === \"element\") {\n      // need to add parent ids as filter target will be an element\n      this.addTarget(changeTargets, filteredNode);\n    }\n\n    if (!filteredNode.children) {\n      return;\n    }\n\n    for (const child of filteredNode.children.values()) {\n      this.collectFilterTargets(changeTargets, child);\n    }\n  }\n\n  private addTarget(filterTargets: FilterTargetsInternal, node: FilteredTreeNode) {\n    switch (node.type) {\n      case \"subject\":\n        (filterTargets.subjectIds ??= new Set()).add(node.id);\n        return;\n      case \"model\":\n        (filterTargets.modelIds ??= new Set()).add(node.id);\n        return;\n      case \"category\":\n        const categories = (filterTargets.categories ??= new Map()).get(node.modelId);\n        if (categories) {\n          categories.add(node.id);\n          return;\n        }\n        filterTargets.categories.set(node.modelId, new Set([node.id]));\n        return;\n      case \"element\":\n        const modelCategoryKey = this.createModelCategoryKey(node.modelId, node.categoryId);\n        const elements = (filterTargets.elements ??= new Map()).get(modelCategoryKey);\n        if (elements) {\n          elements.set(node.id, { isFilterTarget: node.isFilterTarget });\n        } else {\n          filterTargets.elements.set(modelCategoryKey, new Map([[node.id, { isFilterTarget: node.isFilterTarget }]]));\n        }\n    }\n  }\n\n  private createModelCategoryKey(modelId: Id64String, categoryId: Id64String): ModelCategoryKey {\n    return `${modelId}-${categoryId}`;\n  }\n\n  private parseModelCategoryKey(key: ModelCategoryKey): { modelId: Id64String; categoryId: Id64String } {\n    const [modelId, categoryId] = key.split(\"-\");\n    return { modelId, categoryId };\n  }\n\n  public createFilteredTreeNode({\n    type,\n    id,\n    isFilterTarget,\n    parent,\n  }: {\n    type: FilteredTreeNode[\"type\"];\n    id: string;\n    isFilterTarget: boolean;\n    parent: FilteredTreeNode | FilteredTreeRootNode<FilteredTreeNode>;\n  }): FilteredTreeNode {\n    if (type === \"subject\" || type === \"model\") {\n      return {\n        id,\n        isFilterTarget,\n        type,\n      };\n    }\n\n    if (type === \"category\") {\n      assert(\"type\" in parent && parent.type === \"model\");\n      return {\n        id,\n        isFilterTarget,\n        type,\n        modelId: parent.id,\n      };\n    }\n\n    if (\"type\" in parent && parent.type === \"category\") {\n      return {\n        id,\n        isFilterTarget,\n        type,\n        modelId: parent.modelId,\n        categoryId: parent.id,\n      };\n    }\n\n    if (\"type\" in parent && parent.type === \"element\") {\n      return {\n        id,\n        isFilterTarget,\n        type,\n        modelId: parent.modelId,\n        categoryId: parent.categoryId,\n      };\n    }\n\n    throw new Error(\"Invalid parent node type\");\n  }\n\n  public async getType(className: string): Promise<FilteredTreeNode[\"type\"]> {\n    if (await this.#props.imodelAccess.classDerivesFrom(className, CLASS_NAME_Subject)) {\n      return \"subject\";\n    }\n    if (await this.#props.imodelAccess.classDerivesFrom(className, CLASS_NAME_Model)) {\n      return \"model\";\n    }\n    if (await this.#props.imodelAccess.classDerivesFrom(className, CLASS_NAME_Category)) {\n      return \"category\";\n    }\n    return \"element\";\n  }\n}\n"]}