@itwin/presentation-hierarchies 2.0.0-alpha.16 → 2.0.0-alpha.18

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (421) hide show
  1. package/CHANGELOG.md +134 -0
  2. package/README.md +4 -6
  3. package/lib/hierarchies/HierarchyErrors.d.ts.map +1 -0
  4. package/lib/hierarchies/HierarchyErrors.js.map +1 -0
  5. package/lib/hierarchies/HierarchyMerge.d.ts.map +1 -0
  6. package/lib/{esm/hierarchies → hierarchies}/HierarchyMerge.js +1 -1
  7. package/lib/hierarchies/HierarchyMerge.js.map +1 -0
  8. package/lib/hierarchies/HierarchyNode.d.ts.map +1 -0
  9. package/lib/hierarchies/HierarchyNode.js.map +1 -0
  10. package/lib/hierarchies/HierarchyNodeIdentifier.d.ts.map +1 -0
  11. package/lib/hierarchies/HierarchyNodeIdentifier.js.map +1 -0
  12. package/lib/{esm/hierarchies → hierarchies}/HierarchyNodeKey.d.ts +4 -4
  13. package/lib/hierarchies/HierarchyNodeKey.d.ts.map +1 -0
  14. package/lib/{esm/hierarchies → hierarchies}/HierarchyNodeKey.js +8 -8
  15. package/lib/hierarchies/HierarchyNodeKey.js.map +1 -0
  16. package/lib/hierarchies/HierarchyProvider.d.ts.map +1 -0
  17. package/lib/hierarchies/HierarchyProvider.js.map +1 -0
  18. package/lib/hierarchies/HierarchySearch.d.ts.map +1 -0
  19. package/lib/hierarchies/HierarchySearch.js.map +1 -0
  20. package/lib/hierarchies/Logging.d.ts.map +1 -0
  21. package/lib/hierarchies/Logging.js.map +1 -0
  22. package/lib/hierarchies/imodel/HierarchyCache.d.ts.map +1 -0
  23. package/lib/hierarchies/imodel/HierarchyCache.js.map +1 -0
  24. package/lib/{esm/hierarchies → hierarchies}/imodel/IModelHierarchyDefinition.d.ts +3 -3
  25. package/lib/hierarchies/imodel/IModelHierarchyDefinition.d.ts.map +1 -0
  26. package/lib/hierarchies/imodel/IModelHierarchyDefinition.js.map +1 -0
  27. package/lib/{esm/hierarchies → hierarchies}/imodel/IModelHierarchyNode.d.ts +2 -2
  28. package/lib/hierarchies/imodel/IModelHierarchyNode.d.ts.map +1 -0
  29. package/lib/hierarchies/imodel/IModelHierarchyNode.js.map +1 -0
  30. package/lib/{cjs/hierarchies → hierarchies}/imodel/IModelHierarchyProvider.d.ts +2 -4
  31. package/lib/hierarchies/imodel/IModelHierarchyProvider.d.ts.map +1 -0
  32. package/lib/{esm/hierarchies → hierarchies}/imodel/IModelHierarchyProvider.js +15 -12
  33. package/lib/hierarchies/imodel/IModelHierarchyProvider.js.map +1 -0
  34. package/lib/hierarchies/imodel/LimitingECSqlQueryExecutor.d.ts.map +1 -0
  35. package/lib/hierarchies/imodel/LimitingECSqlQueryExecutor.js.map +1 -0
  36. package/lib/{esm/hierarchies → hierarchies}/imodel/NodeSelectQueryFactory.d.ts +10 -6
  37. package/lib/hierarchies/imodel/NodeSelectQueryFactory.d.ts.map +1 -0
  38. package/lib/{esm/hierarchies → hierarchies}/imodel/NodeSelectQueryFactory.js +80 -43
  39. package/lib/hierarchies/imodel/NodeSelectQueryFactory.js.map +1 -0
  40. package/lib/{esm/hierarchies → hierarchies}/imodel/PredicateBasedHierarchyDefinition.d.ts +4 -4
  41. package/lib/hierarchies/imodel/PredicateBasedHierarchyDefinition.d.ts.map +1 -0
  42. package/lib/{esm/hierarchies → hierarchies}/imodel/PredicateBasedHierarchyDefinition.js +1 -1
  43. package/lib/hierarchies/imodel/PredicateBasedHierarchyDefinition.js.map +1 -0
  44. package/lib/{cjs/hierarchies → hierarchies}/imodel/SearchHierarchyDefinition.d.ts +2 -2
  45. package/lib/hierarchies/imodel/SearchHierarchyDefinition.d.ts.map +1 -0
  46. package/lib/{esm/hierarchies → hierarchies}/imodel/SearchHierarchyDefinition.js +3 -4
  47. package/lib/hierarchies/imodel/SearchHierarchyDefinition.js.map +1 -0
  48. package/lib/{esm/hierarchies → hierarchies}/imodel/TreeNodesReader.d.ts +1 -1
  49. package/lib/hierarchies/imodel/TreeNodesReader.d.ts.map +1 -0
  50. package/lib/{esm/hierarchies → hierarchies}/imodel/TreeNodesReader.js +2 -5
  51. package/lib/hierarchies/imodel/TreeNodesReader.js.map +1 -0
  52. package/lib/hierarchies/imodel/Utils.d.ts.map +1 -0
  53. package/lib/hierarchies/imodel/Utils.js.map +1 -0
  54. package/lib/hierarchies/imodel/operators/DetermineChildren.d.ts.map +1 -0
  55. package/lib/hierarchies/imodel/operators/DetermineChildren.js.map +1 -0
  56. package/lib/{esm/hierarchies → hierarchies}/imodel/operators/Grouping.d.ts +2 -2
  57. package/lib/hierarchies/imodel/operators/Grouping.d.ts.map +1 -0
  58. package/lib/hierarchies/imodel/operators/Grouping.js.map +1 -0
  59. package/lib/hierarchies/imodel/operators/HideIfNoChildren.d.ts.map +1 -0
  60. package/lib/hierarchies/imodel/operators/HideIfNoChildren.js.map +1 -0
  61. package/lib/hierarchies/imodel/operators/HideNodesInHierarchy.d.ts.map +1 -0
  62. package/lib/hierarchies/imodel/operators/HideNodesInHierarchy.js.map +1 -0
  63. package/lib/hierarchies/imodel/operators/grouping/AutoExpand.d.ts.map +1 -0
  64. package/lib/hierarchies/imodel/operators/grouping/AutoExpand.js.map +1 -0
  65. package/lib/{cjs/hierarchies → hierarchies}/imodel/operators/grouping/BaseClassGrouping.d.ts +3 -3
  66. package/lib/hierarchies/imodel/operators/grouping/BaseClassGrouping.d.ts.map +1 -0
  67. package/lib/{esm/hierarchies → hierarchies}/imodel/operators/grouping/BaseClassGrouping.js +9 -10
  68. package/lib/hierarchies/imodel/operators/grouping/BaseClassGrouping.js.map +1 -0
  69. package/lib/hierarchies/imodel/operators/grouping/ClassGrouping.d.ts.map +1 -0
  70. package/lib/{esm/hierarchies → hierarchies}/imodel/operators/grouping/ClassGrouping.js +4 -6
  71. package/lib/hierarchies/imodel/operators/grouping/ClassGrouping.js.map +1 -0
  72. package/lib/hierarchies/imodel/operators/grouping/GroupHiding.d.ts.map +1 -0
  73. package/lib/hierarchies/imodel/operators/grouping/GroupHiding.js.map +1 -0
  74. package/lib/hierarchies/imodel/operators/grouping/LabelGrouping.d.ts.map +1 -0
  75. package/lib/hierarchies/imodel/operators/grouping/LabelGrouping.js.map +1 -0
  76. package/lib/{cjs/hierarchies → hierarchies}/imodel/operators/grouping/PropertiesGrouping.d.ts +4 -4
  77. package/lib/hierarchies/imodel/operators/grouping/PropertiesGrouping.d.ts.map +1 -0
  78. package/lib/{esm/hierarchies → hierarchies}/imodel/operators/grouping/PropertiesGrouping.js +38 -30
  79. package/lib/hierarchies/imodel/operators/grouping/PropertiesGrouping.js.map +1 -0
  80. package/lib/hierarchies/imodel/operators/grouping/Shared.d.ts.map +1 -0
  81. package/lib/hierarchies/imodel/operators/grouping/Shared.js.map +1 -0
  82. package/lib/hierarchies/internal/Common.d.ts.map +1 -0
  83. package/lib/hierarchies/internal/Common.js.map +1 -0
  84. package/lib/hierarchies/internal/DisposePolyfill.d.ts.map +1 -0
  85. package/lib/hierarchies/internal/DisposePolyfill.js.map +1 -0
  86. package/lib/hierarchies/internal/LoggingUtils.d.ts.map +1 -0
  87. package/lib/hierarchies/internal/LoggingUtils.js.map +1 -0
  88. package/lib/hierarchies/internal/RxjsHierarchyDefinition.d.ts.map +1 -0
  89. package/lib/hierarchies/internal/RxjsHierarchyDefinition.js.map +1 -0
  90. package/lib/hierarchies/internal/SubscriptionScheduler.d.ts.map +1 -0
  91. package/lib/hierarchies/internal/SubscriptionScheduler.js.map +1 -0
  92. package/lib/hierarchies/internal/operators/Partition.d.ts.map +1 -0
  93. package/lib/hierarchies/internal/operators/Partition.js.map +1 -0
  94. package/lib/hierarchies/internal/operators/ReduceToMergeMap.d.ts.map +1 -0
  95. package/lib/hierarchies/internal/operators/ReduceToMergeMap.js.map +1 -0
  96. package/lib/hierarchies/internal/operators/ReleaseMainThread.d.ts.map +1 -0
  97. package/lib/hierarchies/internal/operators/ReleaseMainThread.js.map +1 -0
  98. package/lib/hierarchies/internal/operators/ShareReplayWithErrors.d.ts.map +1 -0
  99. package/lib/hierarchies/internal/operators/ShareReplayWithErrors.js.map +1 -0
  100. package/lib/hierarchies/internal/operators/Sorting.d.ts.map +1 -0
  101. package/lib/hierarchies/internal/operators/Sorting.js.map +1 -0
  102. package/lib/hierarchies/internal/operators/TapOnce.d.ts.map +1 -0
  103. package/lib/hierarchies/internal/operators/TapOnce.js.map +1 -0
  104. package/lib/presentation-hierarchies.d.ts.map +1 -0
  105. package/lib/{cjs/presentation-hierarchies.js.map → presentation-hierarchies.js.map} +1 -1
  106. package/package.json +19 -21
  107. package/lib/cjs/hierarchies/HierarchyErrors.d.ts.map +0 -1
  108. package/lib/cjs/hierarchies/HierarchyErrors.js +0 -20
  109. package/lib/cjs/hierarchies/HierarchyErrors.js.map +0 -1
  110. package/lib/cjs/hierarchies/HierarchyMerge.d.ts.map +0 -1
  111. package/lib/cjs/hierarchies/HierarchyMerge.js +0 -43
  112. package/lib/cjs/hierarchies/HierarchyMerge.js.map +0 -1
  113. package/lib/cjs/hierarchies/HierarchyNode.d.ts.map +0 -1
  114. package/lib/cjs/hierarchies/HierarchyNode.js +0 -82
  115. package/lib/cjs/hierarchies/HierarchyNode.js.map +0 -1
  116. package/lib/cjs/hierarchies/HierarchyNodeIdentifier.d.ts.map +0 -1
  117. package/lib/cjs/hierarchies/HierarchyNodeIdentifier.js +0 -52
  118. package/lib/cjs/hierarchies/HierarchyNodeIdentifier.js.map +0 -1
  119. package/lib/cjs/hierarchies/HierarchyNodeKey.d.ts +0 -162
  120. package/lib/cjs/hierarchies/HierarchyNodeKey.d.ts.map +0 -1
  121. package/lib/cjs/hierarchies/HierarchyNodeKey.js +0 -166
  122. package/lib/cjs/hierarchies/HierarchyNodeKey.js.map +0 -1
  123. package/lib/cjs/hierarchies/HierarchyProvider.d.ts.map +0 -1
  124. package/lib/cjs/hierarchies/HierarchyProvider.js +0 -64
  125. package/lib/cjs/hierarchies/HierarchyProvider.js.map +0 -1
  126. package/lib/cjs/hierarchies/HierarchySearch.d.ts.map +0 -1
  127. package/lib/cjs/hierarchies/HierarchySearch.js +0 -468
  128. package/lib/cjs/hierarchies/HierarchySearch.js.map +0 -1
  129. package/lib/cjs/hierarchies/Logging.d.ts.map +0 -1
  130. package/lib/cjs/hierarchies/Logging.js +0 -27
  131. package/lib/cjs/hierarchies/Logging.js.map +0 -1
  132. package/lib/cjs/hierarchies/imodel/HierarchyCache.d.ts.map +0 -1
  133. package/lib/cjs/hierarchies/imodel/HierarchyCache.js +0 -81
  134. package/lib/cjs/hierarchies/imodel/HierarchyCache.js.map +0 -1
  135. package/lib/cjs/hierarchies/imodel/IModelHierarchyDefinition.d.ts +0 -144
  136. package/lib/cjs/hierarchies/imodel/IModelHierarchyDefinition.d.ts.map +0 -1
  137. package/lib/cjs/hierarchies/imodel/IModelHierarchyDefinition.js +0 -21
  138. package/lib/cjs/hierarchies/imodel/IModelHierarchyDefinition.js.map +0 -1
  139. package/lib/cjs/hierarchies/imodel/IModelHierarchyNode.d.ts +0 -234
  140. package/lib/cjs/hierarchies/imodel/IModelHierarchyNode.d.ts.map +0 -1
  141. package/lib/cjs/hierarchies/imodel/IModelHierarchyNode.js +0 -29
  142. package/lib/cjs/hierarchies/imodel/IModelHierarchyNode.js.map +0 -1
  143. package/lib/cjs/hierarchies/imodel/IModelHierarchyProvider.d.ts.map +0 -1
  144. package/lib/cjs/hierarchies/imodel/IModelHierarchyProvider.js +0 -657
  145. package/lib/cjs/hierarchies/imodel/IModelHierarchyProvider.js.map +0 -1
  146. package/lib/cjs/hierarchies/imodel/LimitingECSqlQueryExecutor.d.ts.map +0 -1
  147. package/lib/cjs/hierarchies/imodel/LimitingECSqlQueryExecutor.js +0 -126
  148. package/lib/cjs/hierarchies/imodel/LimitingECSqlQueryExecutor.js.map +0 -1
  149. package/lib/cjs/hierarchies/imodel/NodeSelectQueryFactory.d.ts +0 -231
  150. package/lib/cjs/hierarchies/imodel/NodeSelectQueryFactory.d.ts.map +0 -1
  151. package/lib/cjs/hierarchies/imodel/NodeSelectQueryFactory.js +0 -629
  152. package/lib/cjs/hierarchies/imodel/NodeSelectQueryFactory.js.map +0 -1
  153. package/lib/cjs/hierarchies/imodel/PredicateBasedHierarchyDefinition.d.ts +0 -140
  154. package/lib/cjs/hierarchies/imodel/PredicateBasedHierarchyDefinition.d.ts.map +0 -1
  155. package/lib/cjs/hierarchies/imodel/PredicateBasedHierarchyDefinition.js +0 -94
  156. package/lib/cjs/hierarchies/imodel/PredicateBasedHierarchyDefinition.js.map +0 -1
  157. package/lib/cjs/hierarchies/imodel/SearchHierarchyDefinition.d.ts.map +0 -1
  158. package/lib/cjs/hierarchies/imodel/SearchHierarchyDefinition.js +0 -268
  159. package/lib/cjs/hierarchies/imodel/SearchHierarchyDefinition.js.map +0 -1
  160. package/lib/cjs/hierarchies/imodel/TreeNodesReader.d.ts +0 -35
  161. package/lib/cjs/hierarchies/imodel/TreeNodesReader.d.ts.map +0 -1
  162. package/lib/cjs/hierarchies/imodel/TreeNodesReader.js +0 -51
  163. package/lib/cjs/hierarchies/imodel/TreeNodesReader.js.map +0 -1
  164. package/lib/cjs/hierarchies/imodel/Utils.d.ts.map +0 -1
  165. package/lib/cjs/hierarchies/imodel/Utils.js +0 -73
  166. package/lib/cjs/hierarchies/imodel/Utils.js.map +0 -1
  167. package/lib/cjs/hierarchies/imodel/operators/DetermineChildren.d.ts.map +0 -1
  168. package/lib/cjs/hierarchies/imodel/operators/DetermineChildren.js +0 -40
  169. package/lib/cjs/hierarchies/imodel/operators/DetermineChildren.js.map +0 -1
  170. package/lib/cjs/hierarchies/imodel/operators/Grouping.d.ts +0 -26
  171. package/lib/cjs/hierarchies/imodel/operators/Grouping.d.ts.map +0 -1
  172. package/lib/cjs/hierarchies/imodel/operators/Grouping.js +0 -176
  173. package/lib/cjs/hierarchies/imodel/operators/Grouping.js.map +0 -1
  174. package/lib/cjs/hierarchies/imodel/operators/HideIfNoChildren.d.ts.map +0 -1
  175. package/lib/cjs/hierarchies/imodel/operators/HideIfNoChildren.js +0 -75
  176. package/lib/cjs/hierarchies/imodel/operators/HideIfNoChildren.js.map +0 -1
  177. package/lib/cjs/hierarchies/imodel/operators/HideNodesInHierarchy.d.ts.map +0 -1
  178. package/lib/cjs/hierarchies/imodel/operators/HideNodesInHierarchy.js +0 -84
  179. package/lib/cjs/hierarchies/imodel/operators/HideNodesInHierarchy.js.map +0 -1
  180. package/lib/cjs/hierarchies/imodel/operators/grouping/AutoExpand.d.ts.map +0 -1
  181. package/lib/cjs/hierarchies/imodel/operators/grouping/AutoExpand.js +0 -26
  182. package/lib/cjs/hierarchies/imodel/operators/grouping/AutoExpand.js.map +0 -1
  183. package/lib/cjs/hierarchies/imodel/operators/grouping/BaseClassGrouping.d.ts.map +0 -1
  184. package/lib/cjs/hierarchies/imodel/operators/grouping/BaseClassGrouping.js +0 -113
  185. package/lib/cjs/hierarchies/imodel/operators/grouping/BaseClassGrouping.js.map +0 -1
  186. package/lib/cjs/hierarchies/imodel/operators/grouping/ClassGrouping.d.ts.map +0 -1
  187. package/lib/cjs/hierarchies/imodel/operators/grouping/ClassGrouping.js +0 -54
  188. package/lib/cjs/hierarchies/imodel/operators/grouping/ClassGrouping.js.map +0 -1
  189. package/lib/cjs/hierarchies/imodel/operators/grouping/GroupHiding.d.ts.map +0 -1
  190. package/lib/cjs/hierarchies/imodel/operators/grouping/GroupHiding.js +0 -49
  191. package/lib/cjs/hierarchies/imodel/operators/grouping/GroupHiding.js.map +0 -1
  192. package/lib/cjs/hierarchies/imodel/operators/grouping/LabelGrouping.d.ts.map +0 -1
  193. package/lib/cjs/hierarchies/imodel/operators/grouping/LabelGrouping.js +0 -52
  194. package/lib/cjs/hierarchies/imodel/operators/grouping/LabelGrouping.js.map +0 -1
  195. package/lib/cjs/hierarchies/imodel/operators/grouping/PropertiesGrouping.d.ts.map +0 -1
  196. package/lib/cjs/hierarchies/imodel/operators/grouping/PropertiesGrouping.js +0 -310
  197. package/lib/cjs/hierarchies/imodel/operators/grouping/PropertiesGrouping.js.map +0 -1
  198. package/lib/cjs/hierarchies/imodel/operators/grouping/Shared.d.ts.map +0 -1
  199. package/lib/cjs/hierarchies/imodel/operators/grouping/Shared.js +0 -31
  200. package/lib/cjs/hierarchies/imodel/operators/grouping/Shared.js.map +0 -1
  201. package/lib/cjs/hierarchies/internal/Common.d.ts.map +0 -1
  202. package/lib/cjs/hierarchies/internal/Common.js +0 -91
  203. package/lib/cjs/hierarchies/internal/Common.js.map +0 -1
  204. package/lib/cjs/hierarchies/internal/DisposePolyfill.d.ts +0 -1
  205. package/lib/cjs/hierarchies/internal/DisposePolyfill.d.ts.map +0 -1
  206. package/lib/cjs/hierarchies/internal/DisposePolyfill.js +0 -11
  207. package/lib/cjs/hierarchies/internal/DisposePolyfill.js.map +0 -1
  208. package/lib/cjs/hierarchies/internal/EachValueFrom.d.ts +0 -12
  209. package/lib/cjs/hierarchies/internal/EachValueFrom.d.ts.map +0 -1
  210. package/lib/cjs/hierarchies/internal/EachValueFrom.js +0 -111
  211. package/lib/cjs/hierarchies/internal/EachValueFrom.js.map +0 -1
  212. package/lib/cjs/hierarchies/internal/LoggingUtils.d.ts.map +0 -1
  213. package/lib/cjs/hierarchies/internal/LoggingUtils.js +0 -37
  214. package/lib/cjs/hierarchies/internal/LoggingUtils.js.map +0 -1
  215. package/lib/cjs/hierarchies/internal/RxjsHierarchyDefinition.d.ts.map +0 -1
  216. package/lib/cjs/hierarchies/internal/RxjsHierarchyDefinition.js +0 -28
  217. package/lib/cjs/hierarchies/internal/RxjsHierarchyDefinition.js.map +0 -1
  218. package/lib/cjs/hierarchies/internal/SubscriptionScheduler.d.ts.map +0 -1
  219. package/lib/cjs/hierarchies/internal/SubscriptionScheduler.js +0 -54
  220. package/lib/cjs/hierarchies/internal/SubscriptionScheduler.js.map +0 -1
  221. package/lib/cjs/hierarchies/internal/operators/Partition.d.ts.map +0 -1
  222. package/lib/cjs/hierarchies/internal/operators/Partition.js +0 -60
  223. package/lib/cjs/hierarchies/internal/operators/Partition.js.map +0 -1
  224. package/lib/cjs/hierarchies/internal/operators/ReduceToMergeMap.d.ts.map +0 -1
  225. package/lib/cjs/hierarchies/internal/operators/ReduceToMergeMap.js +0 -50
  226. package/lib/cjs/hierarchies/internal/operators/ReduceToMergeMap.js.map +0 -1
  227. package/lib/cjs/hierarchies/internal/operators/ReleaseMainThread.d.ts.map +0 -1
  228. package/lib/cjs/hierarchies/internal/operators/ReleaseMainThread.js +0 -24
  229. package/lib/cjs/hierarchies/internal/operators/ReleaseMainThread.js.map +0 -1
  230. package/lib/cjs/hierarchies/internal/operators/ShareReplayWithErrors.d.ts.map +0 -1
  231. package/lib/cjs/hierarchies/internal/operators/ShareReplayWithErrors.js +0 -23
  232. package/lib/cjs/hierarchies/internal/operators/ShareReplayWithErrors.js.map +0 -1
  233. package/lib/cjs/hierarchies/internal/operators/Sorting.d.ts.map +0 -1
  234. package/lib/cjs/hierarchies/internal/operators/Sorting.js +0 -25
  235. package/lib/cjs/hierarchies/internal/operators/Sorting.js.map +0 -1
  236. package/lib/cjs/hierarchies/internal/operators/TapOnce.d.ts.map +0 -1
  237. package/lib/cjs/hierarchies/internal/operators/TapOnce.js +0 -19
  238. package/lib/cjs/hierarchies/internal/operators/TapOnce.js.map +0 -1
  239. package/lib/cjs/package.json +0 -1
  240. package/lib/cjs/presentation-hierarchies.d.ts.map +0 -1
  241. package/lib/cjs/presentation-hierarchies.js +0 -40
  242. package/lib/esm/hierarchies/HierarchyErrors.d.ts +0 -9
  243. package/lib/esm/hierarchies/HierarchyErrors.d.ts.map +0 -1
  244. package/lib/esm/hierarchies/HierarchyErrors.js.map +0 -1
  245. package/lib/esm/hierarchies/HierarchyMerge.d.ts +0 -19
  246. package/lib/esm/hierarchies/HierarchyMerge.d.ts.map +0 -1
  247. package/lib/esm/hierarchies/HierarchyMerge.js.map +0 -1
  248. package/lib/esm/hierarchies/HierarchyNode.d.ts +0 -149
  249. package/lib/esm/hierarchies/HierarchyNode.d.ts.map +0 -1
  250. package/lib/esm/hierarchies/HierarchyNode.js.map +0 -1
  251. package/lib/esm/hierarchies/HierarchyNodeIdentifier.d.ts +0 -31
  252. package/lib/esm/hierarchies/HierarchyNodeIdentifier.d.ts.map +0 -1
  253. package/lib/esm/hierarchies/HierarchyNodeIdentifier.js.map +0 -1
  254. package/lib/esm/hierarchies/HierarchyNodeKey.d.ts.map +0 -1
  255. package/lib/esm/hierarchies/HierarchyNodeKey.js.map +0 -1
  256. package/lib/esm/hierarchies/HierarchyProvider.d.ts +0 -134
  257. package/lib/esm/hierarchies/HierarchyProvider.d.ts.map +0 -1
  258. package/lib/esm/hierarchies/HierarchyProvider.js.map +0 -1
  259. package/lib/esm/hierarchies/HierarchySearch.d.ts +0 -297
  260. package/lib/esm/hierarchies/HierarchySearch.d.ts.map +0 -1
  261. package/lib/esm/hierarchies/HierarchySearch.js.map +0 -1
  262. package/lib/esm/hierarchies/Logging.d.ts +0 -13
  263. package/lib/esm/hierarchies/Logging.d.ts.map +0 -1
  264. package/lib/esm/hierarchies/Logging.js.map +0 -1
  265. package/lib/esm/hierarchies/imodel/HierarchyCache.d.ts +0 -18
  266. package/lib/esm/hierarchies/imodel/HierarchyCache.d.ts.map +0 -1
  267. package/lib/esm/hierarchies/imodel/HierarchyCache.js.map +0 -1
  268. package/lib/esm/hierarchies/imodel/IModelHierarchyDefinition.d.ts.map +0 -1
  269. package/lib/esm/hierarchies/imodel/IModelHierarchyDefinition.js.map +0 -1
  270. package/lib/esm/hierarchies/imodel/IModelHierarchyNode.d.ts.map +0 -1
  271. package/lib/esm/hierarchies/imodel/IModelHierarchyNode.js.map +0 -1
  272. package/lib/esm/hierarchies/imodel/IModelHierarchyProvider.d.ts +0 -138
  273. package/lib/esm/hierarchies/imodel/IModelHierarchyProvider.d.ts.map +0 -1
  274. package/lib/esm/hierarchies/imodel/IModelHierarchyProvider.js.map +0 -1
  275. package/lib/esm/hierarchies/imodel/LimitingECSqlQueryExecutor.d.ts +0 -21
  276. package/lib/esm/hierarchies/imodel/LimitingECSqlQueryExecutor.d.ts.map +0 -1
  277. package/lib/esm/hierarchies/imodel/LimitingECSqlQueryExecutor.js.map +0 -1
  278. package/lib/esm/hierarchies/imodel/NodeSelectQueryFactory.d.ts.map +0 -1
  279. package/lib/esm/hierarchies/imodel/NodeSelectQueryFactory.js.map +0 -1
  280. package/lib/esm/hierarchies/imodel/PredicateBasedHierarchyDefinition.d.ts.map +0 -1
  281. package/lib/esm/hierarchies/imodel/PredicateBasedHierarchyDefinition.js.map +0 -1
  282. package/lib/esm/hierarchies/imodel/SearchHierarchyDefinition.d.ts +0 -35
  283. package/lib/esm/hierarchies/imodel/SearchHierarchyDefinition.d.ts.map +0 -1
  284. package/lib/esm/hierarchies/imodel/SearchHierarchyDefinition.js.map +0 -1
  285. package/lib/esm/hierarchies/imodel/TreeNodesReader.d.ts.map +0 -1
  286. package/lib/esm/hierarchies/imodel/TreeNodesReader.js.map +0 -1
  287. package/lib/esm/hierarchies/imodel/Utils.d.ts +0 -5
  288. package/lib/esm/hierarchies/imodel/Utils.d.ts.map +0 -1
  289. package/lib/esm/hierarchies/imodel/Utils.js.map +0 -1
  290. package/lib/esm/hierarchies/imodel/operators/DetermineChildren.d.ts +0 -11
  291. package/lib/esm/hierarchies/imodel/operators/DetermineChildren.d.ts.map +0 -1
  292. package/lib/esm/hierarchies/imodel/operators/DetermineChildren.js.map +0 -1
  293. package/lib/esm/hierarchies/imodel/operators/Grouping.d.ts.map +0 -1
  294. package/lib/esm/hierarchies/imodel/operators/Grouping.js.map +0 -1
  295. package/lib/esm/hierarchies/imodel/operators/HideIfNoChildren.d.ts +0 -11
  296. package/lib/esm/hierarchies/imodel/operators/HideIfNoChildren.d.ts.map +0 -1
  297. package/lib/esm/hierarchies/imodel/operators/HideIfNoChildren.js.map +0 -1
  298. package/lib/esm/hierarchies/imodel/operators/HideNodesInHierarchy.d.ts +0 -11
  299. package/lib/esm/hierarchies/imodel/operators/HideNodesInHierarchy.d.ts.map +0 -1
  300. package/lib/esm/hierarchies/imodel/operators/HideNodesInHierarchy.js.map +0 -1
  301. package/lib/esm/hierarchies/imodel/operators/grouping/AutoExpand.d.ts +0 -4
  302. package/lib/esm/hierarchies/imodel/operators/grouping/AutoExpand.d.ts.map +0 -1
  303. package/lib/esm/hierarchies/imodel/operators/grouping/AutoExpand.js.map +0 -1
  304. package/lib/esm/hierarchies/imodel/operators/grouping/BaseClassGrouping.d.ts +0 -11
  305. package/lib/esm/hierarchies/imodel/operators/grouping/BaseClassGrouping.d.ts.map +0 -1
  306. package/lib/esm/hierarchies/imodel/operators/grouping/BaseClassGrouping.js.map +0 -1
  307. package/lib/esm/hierarchies/imodel/operators/grouping/ClassGrouping.d.ts +0 -7
  308. package/lib/esm/hierarchies/imodel/operators/grouping/ClassGrouping.d.ts.map +0 -1
  309. package/lib/esm/hierarchies/imodel/operators/grouping/ClassGrouping.js.map +0 -1
  310. package/lib/esm/hierarchies/imodel/operators/grouping/GroupHiding.d.ts +0 -4
  311. package/lib/esm/hierarchies/imodel/operators/grouping/GroupHiding.d.ts.map +0 -1
  312. package/lib/esm/hierarchies/imodel/operators/grouping/GroupHiding.js.map +0 -1
  313. package/lib/esm/hierarchies/imodel/operators/grouping/LabelGrouping.d.ts +0 -5
  314. package/lib/esm/hierarchies/imodel/operators/grouping/LabelGrouping.d.ts.map +0 -1
  315. package/lib/esm/hierarchies/imodel/operators/grouping/LabelGrouping.js.map +0 -1
  316. package/lib/esm/hierarchies/imodel/operators/grouping/PropertiesGrouping.d.ts +0 -32
  317. package/lib/esm/hierarchies/imodel/operators/grouping/PropertiesGrouping.d.ts.map +0 -1
  318. package/lib/esm/hierarchies/imodel/operators/grouping/PropertiesGrouping.js.map +0 -1
  319. package/lib/esm/hierarchies/imodel/operators/grouping/Shared.d.ts +0 -5
  320. package/lib/esm/hierarchies/imodel/operators/grouping/Shared.d.ts.map +0 -1
  321. package/lib/esm/hierarchies/imodel/operators/grouping/Shared.js.map +0 -1
  322. package/lib/esm/hierarchies/internal/Common.d.ts +0 -61
  323. package/lib/esm/hierarchies/internal/Common.d.ts.map +0 -1
  324. package/lib/esm/hierarchies/internal/Common.js.map +0 -1
  325. package/lib/esm/hierarchies/internal/DisposePolyfill.d.ts.map +0 -1
  326. package/lib/esm/hierarchies/internal/DisposePolyfill.js.map +0 -1
  327. package/lib/esm/hierarchies/internal/EachValueFrom.d.ts +0 -12
  328. package/lib/esm/hierarchies/internal/EachValueFrom.d.ts.map +0 -1
  329. package/lib/esm/hierarchies/internal/EachValueFrom.js +0 -108
  330. package/lib/esm/hierarchies/internal/EachValueFrom.js.map +0 -1
  331. package/lib/esm/hierarchies/internal/LoggingUtils.d.ts +0 -12
  332. package/lib/esm/hierarchies/internal/LoggingUtils.d.ts.map +0 -1
  333. package/lib/esm/hierarchies/internal/LoggingUtils.js.map +0 -1
  334. package/lib/esm/hierarchies/internal/RxjsHierarchyDefinition.d.ts +0 -75
  335. package/lib/esm/hierarchies/internal/RxjsHierarchyDefinition.d.ts.map +0 -1
  336. package/lib/esm/hierarchies/internal/RxjsHierarchyDefinition.js.map +0 -1
  337. package/lib/esm/hierarchies/internal/SubscriptionScheduler.d.ts +0 -17
  338. package/lib/esm/hierarchies/internal/SubscriptionScheduler.d.ts.map +0 -1
  339. package/lib/esm/hierarchies/internal/SubscriptionScheduler.js.map +0 -1
  340. package/lib/esm/hierarchies/internal/operators/Partition.d.ts +0 -7
  341. package/lib/esm/hierarchies/internal/operators/Partition.d.ts.map +0 -1
  342. package/lib/esm/hierarchies/internal/operators/Partition.js.map +0 -1
  343. package/lib/esm/hierarchies/internal/operators/ReduceToMergeMap.d.ts +0 -22
  344. package/lib/esm/hierarchies/internal/operators/ReduceToMergeMap.d.ts.map +0 -1
  345. package/lib/esm/hierarchies/internal/operators/ReduceToMergeMap.js.map +0 -1
  346. package/lib/esm/hierarchies/internal/operators/ReleaseMainThread.d.ts +0 -7
  347. package/lib/esm/hierarchies/internal/operators/ReleaseMainThread.d.ts.map +0 -1
  348. package/lib/esm/hierarchies/internal/operators/ReleaseMainThread.js.map +0 -1
  349. package/lib/esm/hierarchies/internal/operators/ShareReplayWithErrors.d.ts +0 -9
  350. package/lib/esm/hierarchies/internal/operators/ShareReplayWithErrors.d.ts.map +0 -1
  351. package/lib/esm/hierarchies/internal/operators/ShareReplayWithErrors.js.map +0 -1
  352. package/lib/esm/hierarchies/internal/operators/Sorting.d.ts +0 -13
  353. package/lib/esm/hierarchies/internal/operators/Sorting.d.ts.map +0 -1
  354. package/lib/esm/hierarchies/internal/operators/Sorting.js.map +0 -1
  355. package/lib/esm/hierarchies/internal/operators/TapOnce.d.ts +0 -4
  356. package/lib/esm/hierarchies/internal/operators/TapOnce.d.ts.map +0 -1
  357. package/lib/esm/hierarchies/internal/operators/TapOnce.js.map +0 -1
  358. package/lib/esm/presentation-hierarchies.d.ts +0 -24
  359. package/lib/esm/presentation-hierarchies.d.ts.map +0 -1
  360. package/lib/esm/presentation-hierarchies.js.map +0 -1
  361. /package/lib/{cjs/hierarchies → hierarchies}/HierarchyErrors.d.ts +0 -0
  362. /package/lib/{esm/hierarchies → hierarchies}/HierarchyErrors.js +0 -0
  363. /package/lib/{cjs/hierarchies → hierarchies}/HierarchyMerge.d.ts +0 -0
  364. /package/lib/{cjs/hierarchies → hierarchies}/HierarchyNode.d.ts +0 -0
  365. /package/lib/{esm/hierarchies → hierarchies}/HierarchyNode.js +0 -0
  366. /package/lib/{cjs/hierarchies → hierarchies}/HierarchyNodeIdentifier.d.ts +0 -0
  367. /package/lib/{esm/hierarchies → hierarchies}/HierarchyNodeIdentifier.js +0 -0
  368. /package/lib/{cjs/hierarchies → hierarchies}/HierarchyProvider.d.ts +0 -0
  369. /package/lib/{esm/hierarchies → hierarchies}/HierarchyProvider.js +0 -0
  370. /package/lib/{cjs/hierarchies → hierarchies}/HierarchySearch.d.ts +0 -0
  371. /package/lib/{esm/hierarchies → hierarchies}/HierarchySearch.js +0 -0
  372. /package/lib/{cjs/hierarchies → hierarchies}/Logging.d.ts +0 -0
  373. /package/lib/{esm/hierarchies → hierarchies}/Logging.js +0 -0
  374. /package/lib/{cjs/hierarchies → hierarchies}/imodel/HierarchyCache.d.ts +0 -0
  375. /package/lib/{esm/hierarchies → hierarchies}/imodel/HierarchyCache.js +0 -0
  376. /package/lib/{esm/hierarchies → hierarchies}/imodel/IModelHierarchyDefinition.js +0 -0
  377. /package/lib/{esm/hierarchies → hierarchies}/imodel/IModelHierarchyNode.js +0 -0
  378. /package/lib/{cjs/hierarchies → hierarchies}/imodel/LimitingECSqlQueryExecutor.d.ts +0 -0
  379. /package/lib/{esm/hierarchies → hierarchies}/imodel/LimitingECSqlQueryExecutor.js +0 -0
  380. /package/lib/{cjs/hierarchies → hierarchies}/imodel/Utils.d.ts +0 -0
  381. /package/lib/{esm/hierarchies → hierarchies}/imodel/Utils.js +0 -0
  382. /package/lib/{cjs/hierarchies → hierarchies}/imodel/operators/DetermineChildren.d.ts +0 -0
  383. /package/lib/{esm/hierarchies → hierarchies}/imodel/operators/DetermineChildren.js +0 -0
  384. /package/lib/{esm/hierarchies → hierarchies}/imodel/operators/Grouping.js +0 -0
  385. /package/lib/{cjs/hierarchies → hierarchies}/imodel/operators/HideIfNoChildren.d.ts +0 -0
  386. /package/lib/{esm/hierarchies → hierarchies}/imodel/operators/HideIfNoChildren.js +0 -0
  387. /package/lib/{cjs/hierarchies → hierarchies}/imodel/operators/HideNodesInHierarchy.d.ts +0 -0
  388. /package/lib/{esm/hierarchies → hierarchies}/imodel/operators/HideNodesInHierarchy.js +0 -0
  389. /package/lib/{cjs/hierarchies → hierarchies}/imodel/operators/grouping/AutoExpand.d.ts +0 -0
  390. /package/lib/{esm/hierarchies → hierarchies}/imodel/operators/grouping/AutoExpand.js +0 -0
  391. /package/lib/{cjs/hierarchies → hierarchies}/imodel/operators/grouping/ClassGrouping.d.ts +0 -0
  392. /package/lib/{cjs/hierarchies → hierarchies}/imodel/operators/grouping/GroupHiding.d.ts +0 -0
  393. /package/lib/{esm/hierarchies → hierarchies}/imodel/operators/grouping/GroupHiding.js +0 -0
  394. /package/lib/{cjs/hierarchies → hierarchies}/imodel/operators/grouping/LabelGrouping.d.ts +0 -0
  395. /package/lib/{esm/hierarchies → hierarchies}/imodel/operators/grouping/LabelGrouping.js +0 -0
  396. /package/lib/{cjs/hierarchies → hierarchies}/imodel/operators/grouping/Shared.d.ts +0 -0
  397. /package/lib/{esm/hierarchies → hierarchies}/imodel/operators/grouping/Shared.js +0 -0
  398. /package/lib/{cjs/hierarchies → hierarchies}/internal/Common.d.ts +0 -0
  399. /package/lib/{esm/hierarchies → hierarchies}/internal/Common.js +0 -0
  400. /package/lib/{esm/hierarchies → hierarchies}/internal/DisposePolyfill.d.ts +0 -0
  401. /package/lib/{esm/hierarchies → hierarchies}/internal/DisposePolyfill.js +0 -0
  402. /package/lib/{cjs/hierarchies → hierarchies}/internal/LoggingUtils.d.ts +0 -0
  403. /package/lib/{esm/hierarchies → hierarchies}/internal/LoggingUtils.js +0 -0
  404. /package/lib/{cjs/hierarchies → hierarchies}/internal/RxjsHierarchyDefinition.d.ts +0 -0
  405. /package/lib/{esm/hierarchies → hierarchies}/internal/RxjsHierarchyDefinition.js +0 -0
  406. /package/lib/{cjs/hierarchies → hierarchies}/internal/SubscriptionScheduler.d.ts +0 -0
  407. /package/lib/{esm/hierarchies → hierarchies}/internal/SubscriptionScheduler.js +0 -0
  408. /package/lib/{cjs/hierarchies → hierarchies}/internal/operators/Partition.d.ts +0 -0
  409. /package/lib/{esm/hierarchies → hierarchies}/internal/operators/Partition.js +0 -0
  410. /package/lib/{cjs/hierarchies → hierarchies}/internal/operators/ReduceToMergeMap.d.ts +0 -0
  411. /package/lib/{esm/hierarchies → hierarchies}/internal/operators/ReduceToMergeMap.js +0 -0
  412. /package/lib/{cjs/hierarchies → hierarchies}/internal/operators/ReleaseMainThread.d.ts +0 -0
  413. /package/lib/{esm/hierarchies → hierarchies}/internal/operators/ReleaseMainThread.js +0 -0
  414. /package/lib/{cjs/hierarchies → hierarchies}/internal/operators/ShareReplayWithErrors.d.ts +0 -0
  415. /package/lib/{esm/hierarchies → hierarchies}/internal/operators/ShareReplayWithErrors.js +0 -0
  416. /package/lib/{cjs/hierarchies → hierarchies}/internal/operators/Sorting.d.ts +0 -0
  417. /package/lib/{esm/hierarchies → hierarchies}/internal/operators/Sorting.js +0 -0
  418. /package/lib/{cjs/hierarchies → hierarchies}/internal/operators/TapOnce.d.ts +0 -0
  419. /package/lib/{esm/hierarchies → hierarchies}/internal/operators/TapOnce.js +0 -0
  420. /package/lib/{cjs/presentation-hierarchies.d.ts → presentation-hierarchies.d.ts} +0 -0
  421. /package/lib/{esm/presentation-hierarchies.js → presentation-hierarchies.js} +0 -0
@@ -1 +0,0 @@
1
- {"version":3,"file":"Shared.js","sourceRoot":"","sources":["../../../../../../src/hierarchies/imodel/operators/grouping/Shared.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AAShG,wEAyBC;AA1BD,gBAAgB;AAChB,SAAgB,8BAA8B,CAC5C,UAAmD,EACnD,YAA0B,EAC1B,EAAwF;IAExF,SAAS,iBAAiB,CAAC,MAAyD;QAClF,QAAQ,YAAY,EAAE,CAAC;YACrB,KAAK,YAAY;gBACf,OAAO,MAAM,EAAE,QAAQ,EAAE,aAAa,CAAC;YACzC,KAAK,OAAO;gBACV,OAAO,OAAO,MAAM,EAAE,QAAQ,EAAE,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;YAC7F,KAAK,OAAO;gBACV,OAAO,OAAO,MAAM,EAAE,QAAQ,EAAE,OAAO,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,KAAK,OAAO;oBAChG,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO;oBACzB,CAAC,CAAC,SAAS,CAAC;YAChB,KAAK,UAAU;gBACb,OAAO,MAAM,EAAE,QAAQ,EAAE,YAAY,CAAC;QAC1C,CAAC;IACH,CAAC;IACD,KAAK,MAAM,SAAS,IAAI,UAAU,CAAC,QAAQ,EAAE,CAAC;QAC5C,MAAM,cAAc,GAAG,iBAAiB,CAAC,SAAS,CAAC,gBAAgB,CAAC,CAAC;QACrE,IAAI,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC;YACvB,OAAO;QACT,CAAC;IACH,CAAC;AACH,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 type {\n HierarchyNodeGroupingParamsBase,\n InstanceHierarchyNodeProcessingParams,\n} from \"../../IModelHierarchyNode.js\";\nimport type { GroupingType, ProcessedInstancesGroupingHierarchyNode } from \"../Grouping.js\";\n\n/** @internal */\nexport function iterateChildNodeGroupingParams(\n parentNode: ProcessedInstancesGroupingHierarchyNode,\n groupingType: GroupingType,\n cb: (groupingParams: HierarchyNodeGroupingParamsBase | undefined) => boolean | undefined,\n): void {\n function getGroupingParams(params: InstanceHierarchyNodeProcessingParams | undefined) {\n switch (groupingType) {\n case \"base-class\":\n return params?.grouping?.byBaseClasses;\n case \"class\":\n return typeof params?.grouping?.byClass === \"object\" ? params.grouping.byClass : undefined;\n case \"label\":\n return typeof params?.grouping?.byLabel === \"object\" && params.grouping.byLabel.action !== \"merge\"\n ? params.grouping.byLabel\n : undefined;\n case \"property\":\n return params?.grouping?.byProperties;\n }\n }\n for (const childNode of parentNode.children) {\n const groupingParams = getGroupingParams(childNode.processingParams);\n if (cb(groupingParams)) {\n return;\n }\n }\n}\n"]}
@@ -1 +0,0 @@
1
- {"version":3,"file":"Common.d.ts","sourceRoot":"","sources":["../../../../src/hierarchies/internal/Common.ts"],"names":[],"mappings":"AAKA,OAAO,sBAAsB,CAAC;AAK9B,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,MAAM,CAAC;AACvC,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AACpE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAE/D;;;GAGG;AACH,eAAO,MAAM,iBAAiB,6BAA6B,CAAC;AAE5D;;;GAGG;AACH,eAAO,MAAM,6BAA6B,yCAAqC,CAAC;AAEhF;;;;GAIG;AACH,eAAO,MAAM,0BAA0B,qCAAqC,CAAC;AAE7E;;;;GAIG;AACH,eAAO,MAAM,sCAAsC,iDAA8C,CAAC;AAElG,gBAAgB;AAChB,wBAAgB,8BAA8B,CAC5C,YAAY,EAAE,MAAM,EACpB,YAAY,EACR,OAAO,iBAAiB,GACxB,OAAO,6BAA6B,GACpC,OAAO,0BAA0B,GACjC,OAAO,sCAAsC,UAGlD;AAED,gBAAgB;AAEhB,wBAAgB,8BAA8B,CAC5C,IAAI,EAAE;IAAE,KAAK,EAAE,MAAM,GAAG,iBAAiB,CAAC;IAAC,GAAG,EAAE,gBAAgB,CAAC;IAAC,UAAU,CAAC,EAAE,gBAAgB,EAAE,CAAA;CAAE,GAAG,SAAS,UAchH;AAGD,gBAAgB;AAChB,wBAAgB,WAAW,CAAC,KAAK,SAAS;IAAE,QAAQ,CAAC,EAAE,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,CAAA;CAAE,EAAE,IAAI,EAAE,KAAK,WAE7F;AAED,gBAAgB;AAChB,wBAAgB,mBAAmB,CAAC,QAAQ,SAAS;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,EAAE,QAAQ,SAAS;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,EACxG,GAAG,EAAE,QAAQ,EACb,GAAG,EAAE,QAAQ,GACZ,MAAM,CAER;AAED;;;;;;;;GAQG;AACH,wBAAgB,WAAW,CAAC,UAAU,EAAE,EAAE,GAAG;IAAE,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,MAAM,IAAI,CAAA;CAAE,GAAG;IAAE,OAAO,EAAE,MAAM,IAAI,CAAA;CAAE,QAMtG;AAED,gBAAgB;AAChB,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,eAAe,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAErF"}
@@ -1,91 +0,0 @@
1
- "use strict";
2
- /*---------------------------------------------------------------------------------------------
3
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
4
- * See LICENSE.md in the project root for license terms and full copyright notice.
5
- *--------------------------------------------------------------------------------------------*/
6
- var __importDefault = (this && this.__importDefault) || function (mod) {
7
- return (mod && mod.__esModule) ? mod : { "default": mod };
8
- };
9
- Object.defineProperty(exports, "__esModule", { value: true });
10
- exports.LOGGING_NAMESPACE_PERFORMANCE_INTERNAL = exports.LOGGING_NAMESPACE_INTERNAL = exports.LOGGING_NAMESPACE_PERFORMANCE = exports.LOGGING_NAMESPACE = void 0;
11
- exports.createOperatorLoggingNamespace = createOperatorLoggingNamespace;
12
- exports.createNodeIdentifierForLogging = createNodeIdentifierForLogging;
13
- exports.hasChildren = hasChildren;
14
- exports.compareNodesByLabel = compareNodesByLabel;
15
- exports.safeDispose = safeDispose;
16
- exports.fromPossiblyPromise = fromPossiblyPromise;
17
- require("./DisposePolyfill.js");
18
- const natural_compare_lite_1 = __importDefault(require("natural-compare-lite"));
19
- const rxjs_1 = require("rxjs");
20
- /**
21
- * This is a logging namespace for public log messages that may be interesting to consumers.
22
- * @internal
23
- */
24
- exports.LOGGING_NAMESPACE = "Presentation.Hierarchies";
25
- /**
26
- * This is a logging namespace for public performance-related log messages that may be interesting to consumers.
27
- * @internal
28
- */
29
- exports.LOGGING_NAMESPACE_PERFORMANCE = `${exports.LOGGING_NAMESPACE}.Performance`;
30
- /**
31
- * This is a logging namespace for internal log messages that are only interesting to package contributors,
32
- * but not the consumers.
33
- * @internal
34
- */
35
- exports.LOGGING_NAMESPACE_INTERNAL = "Presentation.HierarchiesInternal";
36
- /**
37
- * This is a logging namespace for internal performance-related log messages that are only interesting
38
- * to package contributors, but not the consumers.
39
- * @internal
40
- */
41
- exports.LOGGING_NAMESPACE_PERFORMANCE_INTERNAL = `${exports.LOGGING_NAMESPACE_INTERNAL}.Performance`;
42
- /** @internal */
43
- function createOperatorLoggingNamespace(operatorName, baseCategory) {
44
- return `${baseCategory}.Operators.${operatorName}`;
45
- }
46
- /** @internal */
47
- /* v8 ignore start */
48
- function createNodeIdentifierForLogging(node) {
49
- if (!node) {
50
- return "<root>";
51
- }
52
- const { label, key } = node;
53
- const parentKeys = "parentKeys" in node ? node.parentKeys : "<unknown>";
54
- const groupedInstanceKeys = "groupedInstanceKeys" in node && Array.isArray(node.groupedInstanceKeys)
55
- ? node.groupedInstanceKeys.length <= 3
56
- ? node.groupedInstanceKeys
57
- : `<${node.groupedInstanceKeys.length} keys>`
58
- : undefined;
59
- return JSON.stringify({ label, key, parentKeys, groupedInstanceKeys });
60
- }
61
- /* v8 ignore stop */
62
- /** @internal */
63
- function hasChildren(node) {
64
- return node.children === true || (Array.isArray(node.children) && node.children.length > 0);
65
- }
66
- /** @internal */
67
- function compareNodesByLabel(lhs, rhs) {
68
- return (0, natural_compare_lite_1.default)(lhs.label.toLocaleLowerCase(), rhs.label.toLocaleLowerCase());
69
- }
70
- /**
71
- * A helper that disposes the given object, if it's disposable.
72
- *
73
- * The first option is to dispose using the deprecated `dispose` method if it exists on the object.
74
- * If not, we use the new `Symbol.dispose` method. If that doesn't exist either, the object is
75
- * considered as non-disposable and nothing is done with it.
76
- *
77
- * @internal
78
- */
79
- function safeDispose(disposable) {
80
- if ("dispose" in disposable) {
81
- disposable.dispose();
82
- }
83
- else if (Symbol.dispose in disposable) {
84
- disposable[Symbol.dispose]();
85
- }
86
- }
87
- /** @internal */
88
- function fromPossiblyPromise(possiblyPromise) {
89
- return possiblyPromise instanceof Promise ? (0, rxjs_1.from)(possiblyPromise) : (0, rxjs_1.of)(possiblyPromise);
90
- }
91
- //# sourceMappingURL=Common.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"Common.js","sourceRoot":"","sources":["../../../../src/hierarchies/internal/Common.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;;;;;AAsChG,wEASC;AAID,wEAeC;AAID,kCAEC;AAGD,kDAKC;AAWD,kCAMC;AAGD,kDAEC;AApGD,gCAA8B;AAE9B,gFAAkD;AAClD,+BAAgC;AAMhC;;;GAGG;AACU,QAAA,iBAAiB,GAAG,0BAA0B,CAAC;AAE5D;;;GAGG;AACU,QAAA,6BAA6B,GAAG,GAAG,yBAAiB,cAAc,CAAC;AAEhF;;;;GAIG;AACU,QAAA,0BAA0B,GAAG,kCAAkC,CAAC;AAE7E;;;;GAIG;AACU,QAAA,sCAAsC,GAAG,GAAG,kCAA0B,cAAc,CAAC;AAElG,gBAAgB;AAChB,SAAgB,8BAA8B,CAC5C,YAAoB,EACpB,YAIiD;IAEjD,OAAO,GAAG,YAAY,cAAc,YAAY,EAAE,CAAC;AACrD,CAAC;AAED,gBAAgB;AAChB,qBAAqB;AACrB,SAAgB,8BAA8B,CAC5C,IAA+G;IAE/G,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;IAC5B,MAAM,UAAU,GAAG,YAAY,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,CAAC;IACxE,MAAM,mBAAmB,GACvB,qBAAqB,IAAI,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,mBAAmB,CAAC;QACtE,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC,MAAM,IAAI,CAAC;YACpC,CAAC,CAAC,IAAI,CAAC,mBAAmB;YAC1B,CAAC,CAAC,IAAI,IAAI,CAAC,mBAAmB,CAAC,MAAM,QAAQ;QAC/C,CAAC,CAAC,SAAS,CAAC;IAChB,OAAO,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,mBAAmB,EAAE,CAAC,CAAC;AACzE,CAAC;AACD,oBAAoB;AAEpB,gBAAgB;AAChB,SAAgB,WAAW,CAAwD,IAAW;IAC5F,OAAO,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC9F,CAAC;AAED,gBAAgB;AAChB,SAAgB,mBAAmB,CACjC,GAAa,EACb,GAAa;IAEb,OAAO,IAAA,8BAAc,EAAC,GAAG,CAAC,KAAK,CAAC,iBAAiB,EAAE,EAAE,GAAG,CAAC,KAAK,CAAC,iBAAiB,EAAE,CAAC,CAAC;AACtF,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,WAAW,CAAC,UAA2E;IACrG,IAAI,SAAS,IAAI,UAAU,EAAE,CAAC;QAC5B,UAAU,CAAC,OAAO,EAAE,CAAC;IACvB,CAAC;SAAM,IAAI,MAAM,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;QACxC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;IAC/B,CAAC;AACH,CAAC;AAED,gBAAgB;AAChB,SAAgB,mBAAmB,CAAI,eAA+B;IACpE,OAAO,eAAe,YAAY,OAAO,CAAC,CAAC,CAAC,IAAA,WAAI,EAAC,eAAe,CAAC,CAAC,CAAC,CAAC,IAAA,SAAE,EAAC,eAAe,CAAC,CAAC;AAC1F,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 \"./DisposePolyfill.js\";\n\nimport naturalCompare from \"natural-compare-lite\";\nimport { from, of } from \"rxjs\";\n\nimport type { Observable } from \"rxjs\";\nimport type { ConcatenatedValue } from \"@itwin/presentation-shared\";\nimport type { HierarchyNodeKey } from \"../HierarchyNodeKey.js\";\n\n/**\n * This is a logging namespace for public log messages that may be interesting to consumers.\n * @internal\n */\nexport const LOGGING_NAMESPACE = \"Presentation.Hierarchies\";\n\n/**\n * This is a logging namespace for public performance-related log messages that may be interesting to consumers.\n * @internal\n */\nexport const LOGGING_NAMESPACE_PERFORMANCE = `${LOGGING_NAMESPACE}.Performance`;\n\n/**\n * This is a logging namespace for internal log messages that are only interesting to package contributors,\n * but not the consumers.\n * @internal\n */\nexport const LOGGING_NAMESPACE_INTERNAL = \"Presentation.HierarchiesInternal\";\n\n/**\n * This is a logging namespace for internal performance-related log messages that are only interesting\n * to package contributors, but not the consumers.\n * @internal\n */\nexport const LOGGING_NAMESPACE_PERFORMANCE_INTERNAL = `${LOGGING_NAMESPACE_INTERNAL}.Performance`;\n\n/** @internal */\nexport function createOperatorLoggingNamespace(\n operatorName: string,\n baseCategory:\n | typeof LOGGING_NAMESPACE\n | typeof LOGGING_NAMESPACE_PERFORMANCE\n | typeof LOGGING_NAMESPACE_INTERNAL\n | typeof LOGGING_NAMESPACE_PERFORMANCE_INTERNAL,\n) {\n return `${baseCategory}.Operators.${operatorName}`;\n}\n\n/** @internal */\n/* v8 ignore start */\nexport function createNodeIdentifierForLogging(\n node: { label: string | ConcatenatedValue; key: HierarchyNodeKey; parentKeys?: HierarchyNodeKey[] } | undefined,\n) {\n if (!node) {\n return \"<root>\";\n }\n const { label, key } = node;\n const parentKeys = \"parentKeys\" in node ? node.parentKeys : \"<unknown>\";\n const groupedInstanceKeys =\n \"groupedInstanceKeys\" in node && Array.isArray(node.groupedInstanceKeys)\n ? node.groupedInstanceKeys.length <= 3\n ? node.groupedInstanceKeys\n : `<${node.groupedInstanceKeys.length} keys>`\n : undefined;\n return JSON.stringify({ label, key, parentKeys, groupedInstanceKeys });\n}\n/* v8 ignore stop */\n\n/** @internal */\nexport function hasChildren<TNode extends { children?: boolean | Array<unknown> }>(node: TNode) {\n return node.children === true || (Array.isArray(node.children) && node.children.length > 0);\n}\n\n/** @internal */\nexport function compareNodesByLabel<TLhsNode extends { label: string }, TRhsNode extends { label: string }>(\n lhs: TLhsNode,\n rhs: TRhsNode,\n): number {\n return naturalCompare(lhs.label.toLocaleLowerCase(), rhs.label.toLocaleLowerCase());\n}\n\n/**\n * A helper that disposes the given object, if it's disposable.\n *\n * The first option is to dispose using the deprecated `dispose` method if it exists on the object.\n * If not, we use the new `Symbol.dispose` method. If that doesn't exist either, the object is\n * considered as non-disposable and nothing is done with it.\n *\n * @internal\n */\nexport function safeDispose(disposable: {} | { [Symbol.dispose]: () => void } | { dispose: () => void }) {\n if (\"dispose\" in disposable) {\n disposable.dispose();\n } else if (Symbol.dispose in disposable) {\n disposable[Symbol.dispose]();\n }\n}\n\n/** @internal */\nexport function fromPossiblyPromise<T>(possiblyPromise: T | Promise<T>): Observable<T> {\n return possiblyPromise instanceof Promise ? from(possiblyPromise) : of(possiblyPromise);\n}\n"]}
@@ -1 +0,0 @@
1
- //# sourceMappingURL=DisposePolyfill.d.ts.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"DisposePolyfill.d.ts","sourceRoot":"","sources":["../../../../src/hierarchies/internal/DisposePolyfill.ts"],"names":[],"mappings":""}
@@ -1,11 +0,0 @@
1
- "use strict";
2
- /*---------------------------------------------------------------------------------------------
3
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
4
- * See LICENSE.md in the project root for license terms and full copyright notice.
5
- *--------------------------------------------------------------------------------------------*/
6
- /**
7
- * Polyfill for upcoming resource management feature: https://github.com/tc39/proposal-explicit-resource-management
8
- */
9
- Symbol.dispose ??= Symbol("Symbol.dispose");
10
- Symbol.asyncDispose ??= Symbol("Symbol.asyncDispose");
11
- //# sourceMappingURL=DisposePolyfill.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"DisposePolyfill.js","sourceRoot":"","sources":["../../../../src/hierarchies/internal/DisposePolyfill.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;AAEhG;;GAEG;AACF,MAAc,CAAC,OAAO,KAAK,MAAM,CAAC,gBAAgB,CAAC,CAAC;AACpD,MAAc,CAAC,YAAY,KAAK,MAAM,CAAC,qBAAqB,CAAC,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\n/**\n * Polyfill for upcoming resource management feature: https://github.com/tc39/proposal-explicit-resource-management\n */\n(Symbol as any).dispose ??= Symbol(\"Symbol.dispose\");\n(Symbol as any).asyncDispose ??= Symbol(\"Symbol.asyncDispose\");\n"]}
@@ -1,12 +0,0 @@
1
- import type { Observable } from "rxjs";
2
- /**
3
- * This is pretty much a combination of:
4
- * - https://github.com/benlesh/rxjs-for-await/blob/94f9cf9cb015ac3700dfd1850eb81d36962eb70f/src/index.ts#L33,
5
- * - https://github.com/ReactiveX/rxjs/blob/2587ee852eb43eeb0883a7787bac2944d823392b/packages/observable/src/observable.ts#L922.
6
- *
7
- * Our implementation uses a linked list rather than an array to store values, which is more efficient.
8
- *
9
- * @internal
10
- */
11
- export declare function eachValueFrom<T>(source: Observable<T>): AsyncIterableIterator<T>;
12
- //# sourceMappingURL=EachValueFrom.d.ts.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"EachValueFrom.d.ts","sourceRoot":"","sources":["../../../../src/hierarchies/internal/EachValueFrom.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,MAAM,CAAC;AAIvC;;;;;;;;GAQG;AACH,wBAAuB,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,qBAAqB,CAAC,CAAC,CAAC,CAwDvF"}
@@ -1,111 +0,0 @@
1
- "use strict";
2
- /*---------------------------------------------------------------------------------------------
3
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
4
- * See LICENSE.md in the project root for license terms and full copyright notice.
5
- *--------------------------------------------------------------------------------------------*/
6
- Object.defineProperty(exports, "__esModule", { value: true });
7
- exports.eachValueFrom = eachValueFrom;
8
- // cspell:words deferreds
9
- /**
10
- * This is pretty much a combination of:
11
- * - https://github.com/benlesh/rxjs-for-await/blob/94f9cf9cb015ac3700dfd1850eb81d36962eb70f/src/index.ts#L33,
12
- * - https://github.com/ReactiveX/rxjs/blob/2587ee852eb43eeb0883a7787bac2944d823392b/packages/observable/src/observable.ts#L922.
13
- *
14
- * Our implementation uses a linked list rather than an array to store values, which is more efficient.
15
- *
16
- * @internal
17
- */
18
- async function* eachValueFrom(source) {
19
- const deferreds = new Queue();
20
- const values = new Queue();
21
- let error;
22
- let completed = false;
23
- const subs = source.subscribe({
24
- next: (value) => {
25
- const deferred = deferreds.pop();
26
- if (deferred) {
27
- deferred.resolve({ value, done: false });
28
- }
29
- else {
30
- values.push(value);
31
- }
32
- },
33
- error: (err) => {
34
- error = err;
35
- for (let deferred = deferreds.pop(); deferred !== undefined; deferred = deferreds.pop()) {
36
- deferred.reject(err);
37
- }
38
- },
39
- complete: () => {
40
- completed = true;
41
- for (let deferred = deferreds.pop(); deferred !== undefined; deferred = deferreds.pop()) {
42
- deferred.resolve({ value: undefined, done: true });
43
- }
44
- },
45
- });
46
- try {
47
- while (true) {
48
- const value = values.pop();
49
- if (value !== undefined) {
50
- yield value;
51
- continue;
52
- }
53
- // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition
54
- if (completed) {
55
- return;
56
- }
57
- // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition
58
- if (error) {
59
- // eslint-disable-next-line @typescript-eslint/only-throw-error
60
- throw error;
61
- }
62
- const result = await new Promise((resolve, reject) => {
63
- deferreds.push({ resolve, reject });
64
- });
65
- if (result.done) {
66
- return;
67
- }
68
- yield result.value;
69
- }
70
- }
71
- catch (err) {
72
- throw err;
73
- }
74
- finally {
75
- subs.unsubscribe();
76
- }
77
- }
78
- class QueueEntry {
79
- value;
80
- next;
81
- constructor(value, next) {
82
- this.value = value;
83
- this.next = next;
84
- }
85
- }
86
- class Queue {
87
- _front;
88
- _back;
89
- push(item) {
90
- const entry = new QueueEntry(item);
91
- if (this._back) {
92
- this._back.next = entry;
93
- }
94
- this._back = entry;
95
- if (!this._front) {
96
- this._front = entry;
97
- }
98
- }
99
- pop() {
100
- if (!this._front) {
101
- return undefined;
102
- }
103
- const value = this._front.value;
104
- this._front = this._front.next;
105
- if (!this._front) {
106
- this._back = undefined;
107
- }
108
- return value;
109
- }
110
- }
111
- //# sourceMappingURL=EachValueFrom.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"EachValueFrom.js","sourceRoot":"","sources":["../../../../src/hierarchies/internal/EachValueFrom.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AAehG,sCAwDC;AAnED,yBAAyB;AAEzB;;;;;;;;GAQG;AACI,KAAK,SAAS,CAAC,CAAC,aAAa,CAAI,MAAqB;IAC3D,MAAM,SAAS,GAAG,IAAI,KAAK,EAAsF,CAAC;IAClH,MAAM,MAAM,GAAG,IAAI,KAAK,EAAK,CAAC;IAC9B,IAAI,KAAK,CAAC;IACV,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,MAAM,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC;QAC5B,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE;YACd,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC;YACjC,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;YAC3C,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QACD,KAAK,EAAE,CAAC,GAAG,EAAE,EAAE;YACb,KAAK,GAAG,GAAG,CAAC;YACZ,KAAK,IAAI,QAAQ,GAAG,SAAS,CAAC,GAAG,EAAE,EAAE,QAAQ,KAAK,SAAS,EAAE,QAAQ,GAAG,SAAS,CAAC,GAAG,EAAE,EAAE,CAAC;gBACxF,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QACD,QAAQ,EAAE,GAAG,EAAE;YACb,SAAS,GAAG,IAAI,CAAC;YACjB,KAAK,IAAI,QAAQ,GAAG,SAAS,CAAC,GAAG,EAAE,EAAE,QAAQ,KAAK,SAAS,EAAE,QAAQ,GAAG,SAAS,CAAC,GAAG,EAAE,EAAE,CAAC;gBACxF,QAAQ,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;KACF,CAAC,CAAC;IACH,IAAI,CAAC;QACH,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC;YAC3B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,MAAM,KAAK,CAAC;gBACZ,SAAS;YACX,CAAC;YACD,uEAAuE;YACvE,IAAI,SAAS,EAAE,CAAC;gBACd,OAAO;YACT,CAAC;YACD,uEAAuE;YACvE,IAAI,KAAK,EAAE,CAAC;gBACV,+DAA+D;gBAC/D,MAAM,KAAK,CAAC;YACd,CAAC;YACD,MAAM,MAAM,GAAG,MAAM,IAAI,OAAO,CAAoB,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBACtE,SAAS,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;YACtC,CAAC,CAAC,CAAC;YACH,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;gBAChB,OAAO;YACT,CAAC;YACD,MAAM,MAAM,CAAC,KAAK,CAAC;QACrB,CAAC;IACH,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,GAAG,CAAC;IACZ,CAAC;YAAS,CAAC;QACT,IAAI,CAAC,WAAW,EAAE,CAAC;IACrB,CAAC;AACH,CAAC;AAED,MAAM,UAAU;IAEI;IACT;IAFT,YACkB,KAAQ,EACjB,IAAoB;QADX,UAAK,GAAL,KAAK,CAAG;QACjB,SAAI,GAAJ,IAAI,CAAgB;IAC1B,CAAC;CACL;AAED,MAAM,KAAK;IACD,MAAM,CAAiB;IACvB,KAAK,CAAiB;IAEvB,IAAI,CAAC,IAAO;QACjB,MAAM,KAAK,GAAG,IAAI,UAAU,CAAI,IAAI,CAAC,CAAC;QACtC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC;QAC1B,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACjB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,CAAC;IACH,CAAC;IAEM,GAAG;QACR,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACjB,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;QAChC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;QAC/B,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACjB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACzB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,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 type { Observable } from \"rxjs\";\n\n// cspell:words deferreds\n\n/**\n * This is pretty much a combination of:\n * - https://github.com/benlesh/rxjs-for-await/blob/94f9cf9cb015ac3700dfd1850eb81d36962eb70f/src/index.ts#L33,\n * - https://github.com/ReactiveX/rxjs/blob/2587ee852eb43eeb0883a7787bac2944d823392b/packages/observable/src/observable.ts#L922.\n *\n * Our implementation uses a linked list rather than an array to store values, which is more efficient.\n *\n * @internal\n */\nexport async function* eachValueFrom<T>(source: Observable<T>): AsyncIterableIterator<T> {\n const deferreds = new Queue<{ resolve: (value: IteratorResult<T>) => void; reject: (reason: unknown) => void }>();\n const values = new Queue<T>();\n let error;\n let completed = false;\n const subs = source.subscribe({\n next: (value) => {\n const deferred = deferreds.pop();\n if (deferred) {\n deferred.resolve({ value, done: false });\n } else {\n values.push(value);\n }\n },\n error: (err) => {\n error = err;\n for (let deferred = deferreds.pop(); deferred !== undefined; deferred = deferreds.pop()) {\n deferred.reject(err);\n }\n },\n complete: () => {\n completed = true;\n for (let deferred = deferreds.pop(); deferred !== undefined; deferred = deferreds.pop()) {\n deferred.resolve({ value: undefined, done: true });\n }\n },\n });\n try {\n while (true) {\n const value = values.pop();\n if (value !== undefined) {\n yield value;\n continue;\n }\n // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n if (completed) {\n return;\n }\n // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n if (error) {\n // eslint-disable-next-line @typescript-eslint/only-throw-error\n throw error;\n }\n const result = await new Promise<IteratorResult<T>>((resolve, reject) => {\n deferreds.push({ resolve, reject });\n });\n if (result.done) {\n return;\n }\n yield result.value;\n }\n } catch (err) {\n throw err;\n } finally {\n subs.unsubscribe();\n }\n}\n\nclass QueueEntry<T> {\n constructor(\n public readonly value: T,\n public next?: QueueEntry<T>,\n ) {}\n}\n\nclass Queue<T> {\n private _front?: QueueEntry<T>;\n private _back?: QueueEntry<T>;\n\n public push(item: T) {\n const entry = new QueueEntry<T>(item);\n if (this._back) {\n this._back.next = entry;\n }\n this._back = entry;\n if (!this._front) {\n this._front = entry;\n }\n }\n\n public pop(): T | undefined {\n if (!this._front) {\n return undefined;\n }\n const value = this._front.value;\n this._front = this._front.next;\n if (!this._front) {\n this._back = undefined;\n }\n return value;\n }\n}\n"]}
@@ -1 +0,0 @@
1
- {"version":3,"file":"LoggingUtils.d.ts","sourceRoot":"","sources":["../../../../src/hierarchies/internal/LoggingUtils.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAW,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAEpE,gBAAgB;AAChB,MAAM,WAAW,eAAe,CAAC,WAAW,GAAG,IAAI;IACjD,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE,QAAQ,CAAC;IACpB,OAAO,EAAE,CAAC,GAAG,EAAE,WAAW,KAAK,MAAM,CAAC;CACvC;AAED,gBAAgB;AAChB,wBAAgB,KAAK,CAAC,KAAK,EAAE,eAAe,QAQ3C;AAeD,gBAAgB;AAChB,wBAAgB,GAAG,CAAC,WAAW,EAAE,KAAK,EAAE,eAAe,CAAC,WAAW,CAAC,wDAEnE"}
@@ -1,37 +0,0 @@
1
- "use strict";
2
- /*---------------------------------------------------------------------------------------------
3
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
4
- * See LICENSE.md in the project root for license terms and full copyright notice.
5
- *--------------------------------------------------------------------------------------------*/
6
- Object.defineProperty(exports, "__esModule", { value: true });
7
- exports.doLog = doLog;
8
- exports.log = log;
9
- const rxjs_1 = require("rxjs");
10
- const Logging_js_1 = require("../Logging.js");
11
- /** @internal */
12
- function doLog(props) {
13
- const logger = (0, Logging_js_1.getLogger)();
14
- const severity = props.severity ?? "trace";
15
- if (!logger.isEnabled(props.category, severity)) {
16
- return;
17
- }
18
- const logFunc = getLogFunc(logger, severity);
19
- logFunc(props.category, props.message());
20
- }
21
- function getLogFunc(logger, severity) {
22
- switch (severity) {
23
- case "error":
24
- return logger.logError.bind(logger);
25
- case "warning":
26
- return logger.logWarning.bind(logger);
27
- case "info":
28
- return logger.logInfo.bind(logger);
29
- case "trace":
30
- return logger.logTrace.bind(logger);
31
- }
32
- }
33
- /** @internal */
34
- function log(props) {
35
- return (0, rxjs_1.tap)((n) => doLog({ ...props, message: () => props.message(n) }));
36
- }
37
- //# sourceMappingURL=LoggingUtils.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"LoggingUtils.js","sourceRoot":"","sources":["../../../../src/hierarchies/internal/LoggingUtils.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AAehG,sBAQC;AAgBD,kBAEC;AAvCD,+BAA2B;AAC3B,8CAA0C;AAW1C,gBAAgB;AAChB,SAAgB,KAAK,CAAC,KAAsB;IAC1C,MAAM,MAAM,GAAG,IAAA,sBAAS,GAAE,CAAC;IAC3B,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,IAAI,OAAO,CAAC;IAC3C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC;QAChD,OAAO;IACT,CAAC;IACD,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAC7C,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;AAC3C,CAAC;AAED,SAAS,UAAU,CAAC,MAAe,EAAE,QAAkB;IACrD,QAAQ,QAAQ,EAAE,CAAC;QACjB,KAAK,OAAO;YACV,OAAO,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtC,KAAK,SAAS;YACZ,OAAO,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxC,KAAK,MAAM;YACT,OAAO,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,KAAK,OAAO;YACV,OAAO,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACxC,CAAC;AACH,CAAC;AAED,gBAAgB;AAChB,SAAgB,GAAG,CAAc,KAAmC;IAClE,OAAO,IAAA,UAAG,EAAc,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACvF,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 { tap } from \"rxjs\";\nimport { getLogger } from \"../Logging.js\";\n\nimport type { ILogger, LogLevel } from \"@itwin/presentation-shared\";\n\n/** @internal */\nexport interface LogMessageProps<TMessageArg = void> {\n category: string;\n severity?: LogLevel;\n message: (arg: TMessageArg) => string;\n}\n\n/** @internal */\nexport function doLog(props: LogMessageProps) {\n const logger = getLogger();\n const severity = props.severity ?? \"trace\";\n if (!logger.isEnabled(props.category, severity)) {\n return;\n }\n const logFunc = getLogFunc(logger, severity);\n logFunc(props.category, props.message());\n}\n\nfunction getLogFunc(logger: ILogger, severity: LogLevel) {\n switch (severity) {\n case \"error\":\n return logger.logError.bind(logger);\n case \"warning\":\n return logger.logWarning.bind(logger);\n case \"info\":\n return logger.logInfo.bind(logger);\n case \"trace\":\n return logger.logTrace.bind(logger);\n }\n}\n\n/** @internal */\nexport function log<TMessageArg>(props: LogMessageProps<TMessageArg>) {\n return tap<TMessageArg>((n) => doLog({ ...props, message: () => props.message(n) }));\n}\n"]}
@@ -1 +0,0 @@
1
- {"version":3,"file":"RxjsHierarchyDefinition.d.ts","sourceRoot":"","sources":["../../../../src/hierarchies/internal/RxjsHierarchyDefinition.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,MAAM,CAAC;AACvC,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,qBAAqB,CAAC;AAC/D,OAAO,KAAK,EACV,yBAAyB,EACzB,mBAAmB,EACnB,6BAA6B,EAC7B,wBAAwB,EACzB,MAAM,wCAAwC,CAAC;AAChD,OAAO,KAAK,EACV,6BAA6B,EAC7B,sBAAsB,EACtB,8BAA8B,EAC9B,2BAA2B,EAC5B,MAAM,kCAAkC,CAAC;AAE1C;;;GAGG;AACH,MAAM,MAAM,cAAc,GAAG,CAAC,KAAK,EAAE;IACnC,GAAG,EAAE;QAAE,CAAC,UAAU,EAAE,MAAM,GAAG,GAAG,CAAA;KAAE,CAAC;IACnC,UAAU,CAAC,EAAE,6BAA6B,CAAC;IAC3C,SAAS,EAAE,MAAM,CAAC;CACnB,KAAK,UAAU,CAAC,2BAA2B,CAAC,CAAC;AAE9C;;;;;;GAMG;AACH,MAAM,MAAM,oBAAoB,GAAG,CACjC,KAAK,SAAS,6BAA6B,GAAG,8BAA8B,EAC5E,KAAK,EAAE;IACP,IAAI,EAAE,KAAK,CAAC;IACZ,UAAU,CAAC,EAAE,mBAAmB,CAAC;CAClC,KAAK,UAAU,CAAC,KAAK,CAAC,CAAC;AAExB;;;;;GAKG;AACH,MAAM,MAAM,qBAAqB,GAAG,CAAC,KAAK,EAAE;IAC1C,IAAI,EAAE,sBAAsB,CAAC;IAC7B,UAAU,CAAC,EAAE,mBAAmB,CAAC;CAClC,KAAK,UAAU,CAAC,sBAAsB,CAAC,CAAC;AAEzC;;;GAGG;AACH,MAAM,WAAW,uBAAuB;IACtC;;;;;;;;;OASG;IACH,SAAS,CAAC,EAAE,cAAc,CAAC;IAE3B;;;;;;OAMG;IACH,cAAc,CAAC,EAAE,oBAAoB,CAAC;IAEtC;;;;;;;OAOG;IACH,eAAe,CAAC,EAAE,qBAAqB,CAAC;IAExC,+EAA+E;IAC/E,oBAAoB,CAAC,KAAK,EAAE,yBAAyB,GAAG,UAAU,CAAC,wBAAwB,CAAC,CAAC;CAC9F;AAED,gBAAgB;AAChB,wBAAgB,0BAA0B,CAAC,mBAAmB,EAAE,mBAAmB,GAAG,uBAAuB,CAiB5G"}
@@ -1,28 +0,0 @@
1
- "use strict";
2
- /*---------------------------------------------------------------------------------------------
3
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
4
- * See LICENSE.md in the project root for license terms and full copyright notice.
5
- *--------------------------------------------------------------------------------------------*/
6
- Object.defineProperty(exports, "__esModule", { value: true });
7
- exports.getRxjsHierarchyDefinition = getRxjsHierarchyDefinition;
8
- const rxjs_1 = require("rxjs");
9
- const Common_js_1 = require("./Common.js");
10
- /** @internal */
11
- function getRxjsHierarchyDefinition(hierarchyDefinition) {
12
- return {
13
- parseNode: hierarchyDefinition.parseNode
14
- ? (props) => {
15
- const parsedNode = hierarchyDefinition.parseNode(props);
16
- return (0, Common_js_1.fromPossiblyPromise)(parsedNode);
17
- }
18
- : undefined,
19
- preProcessNode: hierarchyDefinition.preProcessNode
20
- ? (props) => (0, rxjs_1.from)(hierarchyDefinition.preProcessNode(props)).pipe((0, rxjs_1.filter)((preprocessedNode) => !!preprocessedNode))
21
- : undefined,
22
- postProcessNode: hierarchyDefinition.postProcessNode
23
- ? (props) => (0, rxjs_1.from)(hierarchyDefinition.postProcessNode(props))
24
- : undefined,
25
- defineHierarchyLevel: (props) => (0, rxjs_1.from)(hierarchyDefinition.defineHierarchyLevel(props)),
26
- };
27
- }
28
- //# sourceMappingURL=RxjsHierarchyDefinition.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"RxjsHierarchyDefinition.js","sourceRoot":"","sources":["../../../../src/hierarchies/internal/RxjsHierarchyDefinition.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AAgGhG,gEAiBC;AA/GD,+BAAoC;AACpC,2CAAkD;AA4FlD,gBAAgB;AAChB,SAAgB,0BAA0B,CAAC,mBAAwC;IACjF,OAAO;QACL,SAAS,EAAE,mBAAmB,CAAC,SAAS;YACtC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE;gBACR,MAAM,UAAU,GAAG,mBAAmB,CAAC,SAAU,CAAC,KAAK,CAAC,CAAC;gBACzD,OAAO,IAAA,+BAAmB,EAAC,UAAU,CAAC,CAAC;YACzC,CAAC;YACH,CAAC,CAAC,SAAS;QACb,cAAc,EAAE,mBAAmB,CAAC,cAAc;YAChD,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CACR,IAAA,WAAI,EAAC,mBAAmB,CAAC,cAAe,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAA,aAAM,EAAC,CAAC,gBAAgB,EAAE,EAAE,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC;YAC3G,CAAC,CAAC,SAAS;QACb,eAAe,EAAE,mBAAmB,CAAC,eAAe;YAClD,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAA,WAAI,EAAC,mBAAmB,CAAC,eAAgB,CAAC,KAAK,CAAC,CAAC;YAC9D,CAAC,CAAC,SAAS;QACb,oBAAoB,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,IAAA,WAAI,EAAC,mBAAmB,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;KACvF,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 { filter, from } from \"rxjs\";\nimport { fromPossiblyPromise } from \"./Common.js\";\n\nimport type { Observable } from \"rxjs\";\nimport type { ParentHierarchyNode } from \"../HierarchyNode.js\";\nimport type {\n DefineHierarchyLevelProps,\n HierarchyDefinition,\n HierarchyDefinitionParentNode,\n HierarchyLevelDefinition,\n} from \"../imodel/IModelHierarchyDefinition.js\";\nimport type {\n ProcessedGenericHierarchyNode,\n ProcessedHierarchyNode,\n ProcessedInstanceHierarchyNode,\n SourceInstanceHierarchyNode,\n} from \"../imodel/IModelHierarchyNode.js\";\n\n/**\n * A type for a function that parses a `SourceInstanceHierarchyNode` from provided ECSQL `row` object.\n * @internal\n */\nexport type RxjsNodeParser = (props: {\n row: { [columnName: string]: any };\n parentNode?: HierarchyDefinitionParentNode;\n imodelKey: string;\n}) => Observable<SourceInstanceHierarchyNode>;\n\n/**\n * A type for a function that pre-processes given node. Unless the function decides not to make any modifications,\n * it should return a new - modified - node, rather than modifying the given one. Returning `undefined` omits the node\n * from the hierarchy.\n *\n * @internal\n */\nexport type RxjsNodePreProcessor = <\n TNode extends ProcessedGenericHierarchyNode | ProcessedInstanceHierarchyNode,\n>(props: {\n node: TNode;\n parentNode?: ParentHierarchyNode;\n}) => Observable<TNode>;\n\n/**\n * A type for a function that post-processes given node. Unless the function decides not to make any modifications,\n * it should return a new - modified - node, rather than modifying the given one.\n *\n * @internal\n */\nexport type RxjsNodePostProcessor = (props: {\n node: ProcessedHierarchyNode;\n parentNode?: ParentHierarchyNode;\n}) => Observable<ProcessedHierarchyNode>;\n\n/**\n * An interface for a factory that knows how define a hierarchy based on a given parent node.\n * @internal\n */\nexport interface RxjsHierarchyDefinition {\n /**\n * An optional function for parsing ECInstance node from ECSQL row.\n *\n * Should be used in situations when the `HierarchyDefinition` implementation\n * introduces additional ECSQL columns into the select clause and wants to assign additional\n * data to the nodes it produces.\n *\n * Defaults to a function that parses all `HierarchyNode` attributes from a query, whose SELECT\n * clause is created using `NodeSelectQueryFactory.createSelectClause`.\n */\n parseNode?: RxjsNodeParser;\n\n /**\n * An optional function for pre-processing nodes.\n *\n * Pre-processing happens immediately after the nodes are loaded based on `HierarchyLevelDefinition`\n * returned by this `HierarchyDefinition` and before their processing (hiding, grouping, sorting, etc.) starts.\n * The step allows assigning nodes additional data or excluding them from the hierarchy based on some attributes.\n */\n preProcessNode?: RxjsNodePreProcessor;\n\n /**\n * An optional function for post-processing nodes.\n *\n * Post-processing happens after the loaded nodes go through all the merging, hiding and grouping\n * steps, but before sorting them. This step allows `HierarchyDefinition` implementations to assign additional data\n * to nodes after they're processed. This is especially true for grouping nodes as they're only created during\n * processing.\n */\n postProcessNode?: RxjsNodePostProcessor;\n\n /** A function to create a hierarchy level definition for given parent node. */\n defineHierarchyLevel(props: DefineHierarchyLevelProps): Observable<HierarchyLevelDefinition>;\n}\n\n/** @internal */\nexport function getRxjsHierarchyDefinition(hierarchyDefinition: HierarchyDefinition): RxjsHierarchyDefinition {\n return {\n parseNode: hierarchyDefinition.parseNode\n ? (props) => {\n const parsedNode = hierarchyDefinition.parseNode!(props);\n return fromPossiblyPromise(parsedNode);\n }\n : undefined,\n preProcessNode: hierarchyDefinition.preProcessNode\n ? (props) =>\n from(hierarchyDefinition.preProcessNode!(props)).pipe(filter((preprocessedNode) => !!preprocessedNode))\n : undefined,\n postProcessNode: hierarchyDefinition.postProcessNode\n ? (props) => from(hierarchyDefinition.postProcessNode!(props))\n : undefined,\n defineHierarchyLevel: (props) => from(hierarchyDefinition.defineHierarchyLevel(props)),\n };\n}\n"]}
@@ -1 +0,0 @@
1
- {"version":3,"file":"SubscriptionScheduler.d.ts","sourceRoot":"","sources":["../../../../src/hierarchies/internal/SubscriptionScheduler.ts"],"names":[],"mappings":"AAqBA,OAAO,KAAK,EAAe,UAAU,EAAE,MAAM,MAAM,CAAC;AAEpD,gBAAgB;AAChB,qBAAa,qBAAqB;IAChC,OAAO,CAAC,UAAU,CAAuC;gBAC7C,WAAW,EAAE,MAAM;IAwB/B;;;;;;;;OAQG;IACI,oBAAoB,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;CAerE"}
@@ -1,54 +0,0 @@
1
- "use strict";
2
- /*---------------------------------------------------------------------------------------------
3
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
4
- * See LICENSE.md in the project root for license terms and full copyright notice.
5
- *--------------------------------------------------------------------------------------------*/
6
- Object.defineProperty(exports, "__esModule", { value: true });
7
- exports.SubscriptionScheduler = void 0;
8
- const rxjs_1 = require("rxjs");
9
- /** @internal */
10
- class SubscriptionScheduler {
11
- _scheduler = new rxjs_1.Subject();
12
- constructor(concurrency) {
13
- this._scheduler
14
- .pipe((0, rxjs_1.mergeMap)((sourceObservable) => {
15
- return sourceObservable.pipe(
16
- // connect source observable when scheduler subscribes
17
- (0, rxjs_1.tap)({
18
- subscribe: () => {
19
- sourceObservable.connect();
20
- },
21
- }),
22
- // Guard against stack overflow when a lot of observables are scheduled. Without this operation `mergeMap`
23
- // will process each observable that is present in the pipeline recursively.
24
- (0, rxjs_1.observeOn)(rxjs_1.queueScheduler),
25
- // Delay the connection until another event loop task
26
- (0, rxjs_1.subscribeOn)(rxjs_1.asapScheduler),
27
- // Ignore errors in this pipeline without suppressing them for other subscribers
28
- (0, rxjs_1.onErrorResumeNextWith)());
29
- }, concurrency))
30
- // Start consuming scheduled observables
31
- .subscribe();
32
- }
33
- /**
34
- * Schedules `source` for subscription in the current scheduler.
35
- *
36
- * The actual scheduling is performed when the returned observable is subscribed to. To cancel, remove all subscribers
37
- * from the returned observable.
38
- *
39
- * @param source Input observable for which to schedule a subscription.
40
- * @returns Hot observable which starts emitting `source` values after subscription.
41
- */
42
- scheduleSubscription(source) {
43
- return (0, rxjs_1.defer)(() => {
44
- let unsubscribed = false;
45
- const connectableObservable = (0, rxjs_1.connectable)((0, rxjs_1.iif)(() => unsubscribed, rxjs_1.EMPTY, source), { connector: () => new rxjs_1.Subject(), resetOnDisconnect: false });
46
- this._scheduler.next(connectableObservable);
47
- return connectableObservable.pipe((0, rxjs_1.finalize)(() => {
48
- unsubscribed = true;
49
- }));
50
- });
51
- }
52
- }
53
- exports.SubscriptionScheduler = SubscriptionScheduler;
54
- //# sourceMappingURL=SubscriptionScheduler.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"SubscriptionScheduler.js","sourceRoot":"","sources":["../../../../src/hierarchies/internal/SubscriptionScheduler.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;;AAEhG,+BAcc;AAId,gBAAgB;AAChB,MAAa,qBAAqB;IACxB,UAAU,GAAG,IAAI,cAAO,EAAwB,CAAC;IACzD,YAAY,WAAmB;QAC7B,IAAI,CAAC,UAAU;aACZ,IAAI,CACH,IAAA,eAAQ,EAAC,CAAC,gBAAgB,EAAE,EAAE;YAC5B,OAAO,gBAAgB,CAAC,IAAI;YAC1B,sDAAsD;YACtD,IAAA,UAAG,EAAC;gBACF,SAAS,EAAE,GAAG,EAAE;oBACd,gBAAgB,CAAC,OAAO,EAAE,CAAC;gBAC7B,CAAC;aACF,CAAC;YACF,0GAA0G;YAC1G,4EAA4E;YAC5E,IAAA,gBAAS,EAAC,qBAAc,CAAC;YACzB,qDAAqD;YACrD,IAAA,kBAAW,EAAC,oBAAa,CAAC;YAC1B,gFAAgF;YAChF,IAAA,4BAAqB,GAAE,CACxB,CAAC;QACJ,CAAC,EAAE,WAAW,CAAC,CAChB;YACD,wCAAwC;aACvC,SAAS,EAAE,CAAC;IACjB,CAAC;IACD;;;;;;;;OAQG;IACI,oBAAoB,CAAI,MAAqB;QAClD,OAAO,IAAA,YAAK,EAAC,GAAG,EAAE;YAChB,IAAI,YAAY,GAAG,KAAK,CAAC;YACzB,MAAM,qBAAqB,GAAG,IAAA,kBAAW,EACvC,IAAA,UAAG,EAAC,GAAG,EAAE,CAAC,YAAY,EAAE,YAAK,EAAE,MAAM,CAAC,EACtC,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,IAAI,cAAO,EAAK,EAAE,iBAAiB,EAAE,KAAK,EAAE,CAChE,CAAC;YACF,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;YAC5C,OAAO,qBAAqB,CAAC,IAAI,CAC/B,IAAA,eAAQ,EAAC,GAAG,EAAE;gBACZ,YAAY,GAAG,IAAI,CAAC;YACtB,CAAC,CAAC,CACH,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;CACF;AAlDD,sDAkDC","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 {\n asapScheduler,\n connectable,\n defer,\n EMPTY,\n finalize,\n iif,\n mergeMap,\n observeOn,\n onErrorResumeNextWith,\n queueScheduler,\n Subject,\n subscribeOn,\n tap,\n} from \"rxjs\";\n\nimport type { Connectable, Observable } from \"rxjs\";\n\n/** @internal */\nexport class SubscriptionScheduler {\n private _scheduler = new Subject<Connectable<unknown>>();\n constructor(concurrency: number) {\n this._scheduler\n .pipe(\n mergeMap((sourceObservable) => {\n return sourceObservable.pipe(\n // connect source observable when scheduler subscribes\n tap({\n subscribe: () => {\n sourceObservable.connect();\n },\n }),\n // Guard against stack overflow when a lot of observables are scheduled. Without this operation `mergeMap`\n // will process each observable that is present in the pipeline recursively.\n observeOn(queueScheduler),\n // Delay the connection until another event loop task\n subscribeOn(asapScheduler),\n // Ignore errors in this pipeline without suppressing them for other subscribers\n onErrorResumeNextWith(),\n );\n }, concurrency),\n )\n // Start consuming scheduled observables\n .subscribe();\n }\n /**\n * Schedules `source` for subscription in the current scheduler.\n *\n * The actual scheduling is performed when the returned observable is subscribed to. To cancel, remove all subscribers\n * from the returned observable.\n *\n * @param source Input observable for which to schedule a subscription.\n * @returns Hot observable which starts emitting `source` values after subscription.\n */\n public scheduleSubscription<T>(source: Observable<T>): Observable<T> {\n return defer(() => {\n let unsubscribed = false;\n const connectableObservable = connectable(\n iif(() => unsubscribed, EMPTY, source),\n { connector: () => new Subject<T>(), resetOnDisconnect: false },\n );\n this._scheduler.next(connectableObservable);\n return connectableObservable.pipe(\n finalize(() => {\n unsubscribed = true;\n }),\n );\n });\n }\n}\n"]}
@@ -1 +0,0 @@
1
- {"version":3,"file":"Partition.d.ts","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/Partition.ts"],"names":[],"mappings":"AAKA,OAAO,EAAQ,UAAU,EAAiB,MAAM,MAAM,CAAC;AAGvD,OAAO,KAAK,EAAE,eAAe,EAAgB,MAAM,MAAM,CAAC;AAE1D,gBAAgB;AAChB,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EACtC,MAAM,EAAE,eAAe,CAAC,CAAC,CAAC,EAC1B,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,GAClC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAC9C,gBAAgB;AAChB,wBAAgB,SAAS,CAAC,CAAC,EACzB,MAAM,EAAE,eAAe,CAAC,CAAC,CAAC,EAC1B,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAC/B,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC"}
@@ -1,60 +0,0 @@
1
- "use strict";
2
- /*---------------------------------------------------------------------------------------------
3
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
4
- * See LICENSE.md in the project root for license terms and full copyright notice.
5
- *--------------------------------------------------------------------------------------------*/
6
- Object.defineProperty(exports, "__esModule", { value: true });
7
- exports.partition = partition;
8
- const rxjs_1 = require("rxjs");
9
- const core_bentley_1 = require("@itwin/core-bentley");
10
- /**
11
- * This is similar to `rxjs` `partition` operator, but it subscribes to source observable only once.
12
- * @internal
13
- */
14
- function partition(source, predicate) {
15
- const matches = new rxjs_1.ReplaySubject();
16
- const nonMatches = new rxjs_1.ReplaySubject();
17
- let sourceSubscription;
18
- let sourceSubscriptionsCount = 0;
19
- function subscribeToSource() {
20
- if (sourceSubscriptionsCount++ > 0) {
21
- return;
22
- }
23
- (0, core_bentley_1.assert)(!sourceSubscription);
24
- sourceSubscription = (0, rxjs_1.from)(source).subscribe({
25
- next(value) {
26
- if (predicate(value)) {
27
- matches.next(value);
28
- }
29
- else {
30
- nonMatches.next(value);
31
- }
32
- },
33
- error(error) {
34
- matches.error(error);
35
- nonMatches.error(error);
36
- },
37
- complete() {
38
- matches.complete();
39
- nonMatches.complete();
40
- },
41
- });
42
- }
43
- function unsubscribeFromSource() {
44
- (0, core_bentley_1.assert)(sourceSubscriptionsCount > 0);
45
- if (--sourceSubscriptionsCount === 0) {
46
- (0, core_bentley_1.assert)(!!sourceSubscription);
47
- sourceSubscription.unsubscribe();
48
- sourceSubscription = undefined;
49
- }
50
- }
51
- return [matches, nonMatches].map((subject) => new rxjs_1.Observable((subscriber) => {
52
- const subjectSubscription = subject.subscribe(subscriber);
53
- subscribeToSource();
54
- return () => {
55
- subjectSubscription.unsubscribe();
56
- unsubscribeFromSource();
57
- };
58
- }));
59
- }
60
- //# sourceMappingURL=Partition.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"Partition.js","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/Partition.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AAsBhG,8BAkDC;AAtED,+BAAuD;AACvD,sDAA6C;AAe7C;;;GAGG;AACH,SAAgB,SAAS,CACvB,MAA0B,EAC1B,SAAgC;IAEhC,MAAM,OAAO,GAAG,IAAI,oBAAa,EAAK,CAAC;IACvC,MAAM,UAAU,GAAG,IAAI,oBAAa,EAAK,CAAC;IAC1C,IAAI,kBAA4C,CAAC;IACjD,IAAI,wBAAwB,GAAG,CAAC,CAAC;IACjC,SAAS,iBAAiB;QACxB,IAAI,wBAAwB,EAAE,GAAG,CAAC,EAAE,CAAC;YACnC,OAAO;QACT,CAAC;QACD,IAAA,qBAAM,EAAC,CAAC,kBAAkB,CAAC,CAAC;QAC5B,kBAAkB,GAAG,IAAA,WAAI,EAAC,MAAM,CAAC,CAAC,SAAS,CAAC;YAC1C,IAAI,CAAC,KAAK;gBACR,IAAI,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;oBACrB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACtB,CAAC;qBAAM,CAAC;oBACN,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,CAAC;YACH,CAAC;YACD,KAAK,CAAC,KAAK;gBACT,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBACrB,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC1B,CAAC;YACD,QAAQ;gBACN,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACnB,UAAU,CAAC,QAAQ,EAAE,CAAC;YACxB,CAAC;SACF,CAAC,CAAC;IACL,CAAC;IACD,SAAS,qBAAqB;QAC5B,IAAA,qBAAM,EAAC,wBAAwB,GAAG,CAAC,CAAC,CAAC;QACrC,IAAI,EAAE,wBAAwB,KAAK,CAAC,EAAE,CAAC;YACrC,IAAA,qBAAM,EAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC;YAC7B,kBAAkB,CAAC,WAAW,EAAE,CAAC;YACjC,kBAAkB,GAAG,SAAS,CAAC;QACjC,CAAC;IACH,CAAC;IACD,OAAO,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC,GAAG,CAC9B,CAAC,OAAO,EAAE,EAAE,CACV,IAAI,iBAAU,CAAC,CAAC,UAAU,EAAE,EAAE;QAC5B,MAAM,mBAAmB,GAAG,OAAO,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAC1D,iBAAiB,EAAE,CAAC;QACpB,OAAO,GAAG,EAAE;YACV,mBAAmB,CAAC,WAAW,EAAE,CAAC;YAClC,qBAAqB,EAAE,CAAC;QAC1B,CAAC,CAAC;IACJ,CAAC,CAAC,CAC6B,CAAC;AACtC,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 { from, Observable, ReplaySubject } from \"rxjs\";\nimport { assert } from \"@itwin/core-bentley\";\n\nimport type { ObservableInput, Subscription } from \"rxjs\";\n\n/** @internal */\nexport function partition<T, U extends T>(\n source: ObservableInput<T>,\n predicate: (value: T) => value is U,\n): [Observable<U>, Observable<Exclude<T, U>>];\n/** @internal */\nexport function partition<T>(\n source: ObservableInput<T>,\n predicate: (value: T) => boolean,\n): [Observable<T>, Observable<T>];\n\n/**\n * This is similar to `rxjs` `partition` operator, but it subscribes to source observable only once.\n * @internal\n */\nexport function partition<T>(\n source: ObservableInput<T>,\n predicate: (value: T) => boolean,\n): [Observable<T>, Observable<T>] {\n const matches = new ReplaySubject<T>();\n const nonMatches = new ReplaySubject<T>();\n let sourceSubscription: Subscription | undefined;\n let sourceSubscriptionsCount = 0;\n function subscribeToSource() {\n if (sourceSubscriptionsCount++ > 0) {\n return;\n }\n assert(!sourceSubscription);\n sourceSubscription = from(source).subscribe({\n next(value) {\n if (predicate(value)) {\n matches.next(value);\n } else {\n nonMatches.next(value);\n }\n },\n error(error) {\n matches.error(error);\n nonMatches.error(error);\n },\n complete() {\n matches.complete();\n nonMatches.complete();\n },\n });\n }\n function unsubscribeFromSource() {\n assert(sourceSubscriptionsCount > 0);\n if (--sourceSubscriptionsCount === 0) {\n assert(!!sourceSubscription);\n sourceSubscription.unsubscribe();\n sourceSubscription = undefined;\n }\n }\n return [matches, nonMatches].map(\n (subject) =>\n new Observable((subscriber) => {\n const subjectSubscription = subject.subscribe(subscriber);\n subscribeToSource();\n return () => {\n subjectSubscription.unsubscribe();\n unsubscribeFromSource();\n };\n }),\n ) as [Observable<T>, Observable<T>];\n}\n"]}
@@ -1 +0,0 @@
1
- {"version":3,"file":"ReduceToMergeMap.d.ts","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/ReduceToMergeMap.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,MAAM,CAAC;AAE5C;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAAC,WAAW,EAAE,QAAQ,EAAE,OAAO,SAAS,MAAM,EAChF,GAAG,EAAE,CAAC,IAAI,EAAE,WAAW,KAAK,OAAO,EACnC,KAAK,EAAE,CAAC,IAAI,EAAE,WAAW,KAAK,QAAQ,iGASvC;AAED;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAAC,WAAW,EAAE,QAAQ,EAAE,OAAO,SAAS,MAAM,EAChF,GAAG,EAAE,CAAC,IAAI,EAAE,WAAW,KAAK,OAAO,EACnC,SAAS,EAAE,CAAC,UAAU,EAAE,WAAW,EAAE,OAAO,EAAE,QAAQ,GAAG,SAAS,KAAK,QAAQ,IAEvE,QAAQ,eAAe,CAAC,WAAW,CAAC,uDAa7C"}
@@ -1,50 +0,0 @@
1
- "use strict";
2
- /*---------------------------------------------------------------------------------------------
3
- * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
4
- * See LICENSE.md in the project root for license terms and full copyright notice.
5
- *--------------------------------------------------------------------------------------------*/
6
- Object.defineProperty(exports, "__esModule", { value: true });
7
- exports.reduceToMergeMapList = reduceToMergeMapList;
8
- exports.reduceToMergeMapItem = reduceToMergeMapItem;
9
- const rxjs_1 = require("rxjs");
10
- /**
11
- * Reduces the source observable into a `Map<string, TMapItem[]>`, where all input items are grouped based on their key
12
- * and placed into arrays.
13
- *
14
- * @param key A function to calculate map key for the item.
15
- * @param value A function to calculate entry value for the item.
16
- *
17
- * @internal
18
- */
19
- function reduceToMergeMapList(key, value) {
20
- return reduceToMergeMapItem(key, (item, list) => {
21
- if (!list) {
22
- list = [];
23
- }
24
- list.push(value(item));
25
- return list;
26
- });
27
- }
28
- /**
29
- * Reduces the source observable into a `Map<string, TMapItem>`, where all input items are grouped based on their key
30
- * and merged into a single value using provided merge function.
31
- *
32
- * @param key A function to calculate map key for the item.
33
- * @param value A function to create map value using the _current_ item and an item already _existing_ in the map with the same key.
34
- *
35
- * @internal
36
- */
37
- function reduceToMergeMapItem(key, mergeFunc) {
38
- return (source) => (0, rxjs_1.from)(source).pipe((0, rxjs_1.reduce)((mergedMap, item) => {
39
- if (mergedMap === EMPTY_MAP) {
40
- // this helps us avoid creating an empty map for cases when source observable
41
- // doesn't emit any values
42
- mergedMap = new Map();
43
- }
44
- const mergeKey = key(item);
45
- mergedMap.set(mergeKey, mergeFunc(item, mergedMap.get(mergeKey)));
46
- return mergedMap;
47
- }, EMPTY_MAP));
48
- }
49
- const EMPTY_MAP = new Map();
50
- //# sourceMappingURL=ReduceToMergeMap.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"ReduceToMergeMap.js","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/ReduceToMergeMap.ts"],"names":[],"mappings":";AAAA;;;gGAGgG;;AAehG,oDAWC;AAWD,oDAiBC;AApDD,+BAAoC;AAIpC;;;;;;;;GAQG;AACH,SAAgB,oBAAoB,CAClC,GAAmC,EACnC,KAAsC;IAEtC,OAAO,oBAAoB,CAAmC,GAAG,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE;QAChF,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,GAAG,EAAE,CAAC;QACZ,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,oBAAoB,CAClC,GAAmC,EACnC,SAA+E;IAE/E,OAAO,CAAC,MAAoC,EAAE,EAAE,CAC9C,IAAA,WAAI,EAAC,MAAM,CAAC,CAAC,IAAI,CACf,IAAA,aAAM,EAAsC,CAAC,SAAS,EAAE,IAAI,EAAE,EAAE;QAC9D,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,6EAA6E;YAC7E,0BAA0B;YAC1B,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;QACxB,CAAC;QACD,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAClE,OAAO,SAAS,CAAC;IACnB,CAAC,EAAE,SAAS,CAAC,CACd,CAAC;AACN,CAAC;AACD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAE,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 { from, reduce } from \"rxjs\";\n\nimport type { ObservableInput } from \"rxjs\";\n\n/**\n * Reduces the source observable into a `Map<string, TMapItem[]>`, where all input items are grouped based on their key\n * and placed into arrays.\n *\n * @param key A function to calculate map key for the item.\n * @param value A function to calculate entry value for the item.\n *\n * @internal\n */\nexport function reduceToMergeMapList<TSourceItem, TMapItem, TMapKey extends string>(\n key: (item: TSourceItem) => TMapKey,\n value: (item: TSourceItem) => TMapItem,\n) {\n return reduceToMergeMapItem<TSourceItem, TMapItem[], TMapKey>(key, (item, list) => {\n if (!list) {\n list = [];\n }\n list.push(value(item));\n return list;\n });\n}\n\n/**\n * Reduces the source observable into a `Map<string, TMapItem>`, where all input items are grouped based on their key\n * and merged into a single value using provided merge function.\n *\n * @param key A function to calculate map key for the item.\n * @param value A function to create map value using the _current_ item and an item already _existing_ in the map with the same key.\n *\n * @internal\n */\nexport function reduceToMergeMapItem<TSourceItem, TMapItem, TMapKey extends string>(\n key: (item: TSourceItem) => TMapKey,\n mergeFunc: (sourceItem: TSourceItem, mapItem: TMapItem | undefined) => TMapItem,\n) {\n return (source: ObservableInput<TSourceItem>) =>\n from(source).pipe(\n reduce<TSourceItem, Map<TMapKey, TMapItem>>((mergedMap, item) => {\n if (mergedMap === EMPTY_MAP) {\n // this helps us avoid creating an empty map for cases when source observable\n // doesn't emit any values\n mergedMap = new Map();\n }\n const mergeKey = key(item);\n mergedMap.set(mergeKey, mergeFunc(item, mergedMap.get(mergeKey)));\n return mergedMap;\n }, EMPTY_MAP),\n );\n}\nconst EMPTY_MAP = new Map();\n"]}
@@ -1 +0,0 @@
1
- {"version":3,"file":"ReleaseMainThread.d.ts","sourceRoot":"","sources":["../../../../../src/hierarchies/internal/operators/ReleaseMainThread.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,MAAM,CAAC;AAEvC;;;GAGG;AACH,wBAAgB,6BAA6B,CAAC,CAAC,EAAE,YAAY,EAAE,MAAM,IAC3D,KAAK,UAAU,CAAC,CAAC,CAAC,KAAG,UAAU,CAAC,CAAC,CAAC,CAa3C"}