@fluid-experimental/tree 2.0.0-rc.2.0.1 → 2.0.0-rc.3.0.0

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 (571) hide show
  1. package/CHANGELOG.md +23 -0
  2. package/api-report/experimental-tree.api.md +2 -2
  3. package/dist/ChangeCompression.d.ts +2 -2
  4. package/dist/ChangeCompression.d.ts.map +1 -1
  5. package/dist/ChangeCompression.js +1 -1
  6. package/dist/ChangeCompression.js.map +1 -1
  7. package/dist/ChangeTypes.d.ts +1 -1
  8. package/dist/ChangeTypes.d.ts.map +1 -1
  9. package/dist/ChangeTypes.js +4 -4
  10. package/dist/ChangeTypes.js.map +1 -1
  11. package/dist/Checkout.d.ts +3 -3
  12. package/dist/Checkout.d.ts.map +1 -1
  13. package/dist/Checkout.js +17 -17
  14. package/dist/Checkout.js.map +1 -1
  15. package/dist/EditLog.d.ts +1 -1
  16. package/dist/EditLog.d.ts.map +1 -1
  17. package/dist/EditLog.js +9 -9
  18. package/dist/EditLog.js.map +1 -1
  19. package/dist/EditUtilities.d.ts +3 -3
  20. package/dist/EditUtilities.d.ts.map +1 -1
  21. package/dist/EditUtilities.js +6 -6
  22. package/dist/EditUtilities.js.map +1 -1
  23. package/dist/Forest.d.ts.map +1 -1
  24. package/dist/Forest.js +23 -23
  25. package/dist/Forest.js.map +1 -1
  26. package/dist/HistoryEditFactory.d.ts +1 -1
  27. package/dist/HistoryEditFactory.d.ts.map +1 -1
  28. package/dist/HistoryEditFactory.js +7 -7
  29. package/dist/HistoryEditFactory.js.map +1 -1
  30. package/dist/IdConversion.d.ts.map +1 -1
  31. package/dist/IdConversion.js.map +1 -1
  32. package/dist/LogViewer.d.ts +2 -2
  33. package/dist/LogViewer.d.ts.map +1 -1
  34. package/dist/LogViewer.js +7 -7
  35. package/dist/LogViewer.js.map +1 -1
  36. package/dist/MergeHealth.d.ts.map +1 -1
  37. package/dist/MergeHealth.js +1 -1
  38. package/dist/MergeHealth.js.map +1 -1
  39. package/dist/NodeIdUtilities.d.ts +1 -1
  40. package/dist/NodeIdUtilities.d.ts.map +1 -1
  41. package/dist/NodeIdUtilities.js +1 -1
  42. package/dist/NodeIdUtilities.js.map +1 -1
  43. package/dist/PayloadUtilities.d.ts.map +1 -1
  44. package/dist/PayloadUtilities.js +2 -2
  45. package/dist/PayloadUtilities.js.map +1 -1
  46. package/dist/ReconciliationPath.d.ts +1 -1
  47. package/dist/ReconciliationPath.d.ts.map +1 -1
  48. package/dist/ReconciliationPath.js.map +1 -1
  49. package/dist/RevisionValueCache.d.ts.map +1 -1
  50. package/dist/RevisionValueCache.js +2 -2
  51. package/dist/RevisionValueCache.js.map +1 -1
  52. package/dist/RevisionView.d.ts +2 -2
  53. package/dist/RevisionView.d.ts.map +1 -1
  54. package/dist/RevisionView.js.map +1 -1
  55. package/dist/SerializationUtilities.d.ts +1 -1
  56. package/dist/SerializationUtilities.d.ts.map +1 -1
  57. package/dist/SerializationUtilities.js.map +1 -1
  58. package/dist/SharedTree.d.ts +8 -7
  59. package/dist/SharedTree.d.ts.map +1 -1
  60. package/dist/SharedTree.js +78 -78
  61. package/dist/SharedTree.js.map +1 -1
  62. package/dist/SharedTreeEncoder.d.ts +1 -1
  63. package/dist/SharedTreeEncoder.d.ts.map +1 -1
  64. package/dist/SharedTreeEncoder.js +31 -31
  65. package/dist/SharedTreeEncoder.js.map +1 -1
  66. package/dist/Summary.d.ts +2 -2
  67. package/dist/Summary.d.ts.map +1 -1
  68. package/dist/Summary.js +2 -2
  69. package/dist/Summary.js.map +1 -1
  70. package/dist/SummaryBackCompatibility.d.ts.map +1 -1
  71. package/dist/SummaryBackCompatibility.js.map +1 -1
  72. package/dist/SummaryTestUtilities.d.ts +1 -1
  73. package/dist/SummaryTestUtilities.d.ts.map +1 -1
  74. package/dist/SummaryTestUtilities.js.map +1 -1
  75. package/dist/Transaction.d.ts +3 -3
  76. package/dist/Transaction.d.ts.map +1 -1
  77. package/dist/Transaction.js +3 -3
  78. package/dist/Transaction.js.map +1 -1
  79. package/dist/TransactionInternal.d.ts +3 -3
  80. package/dist/TransactionInternal.d.ts.map +1 -1
  81. package/dist/TransactionInternal.js +6 -6
  82. package/dist/TransactionInternal.js.map +1 -1
  83. package/dist/TreeCompressor.d.ts +5 -1
  84. package/dist/TreeCompressor.d.ts.map +1 -1
  85. package/dist/TreeCompressor.js +5 -5
  86. package/dist/TreeCompressor.js.map +1 -1
  87. package/dist/TreeNodeHandle.d.ts +1 -1
  88. package/dist/TreeNodeHandle.d.ts.map +1 -1
  89. package/dist/TreeNodeHandle.js.map +1 -1
  90. package/dist/TreeView.d.ts +1 -1
  91. package/dist/TreeView.d.ts.map +1 -1
  92. package/dist/TreeView.js +2 -3
  93. package/dist/TreeView.js.map +1 -1
  94. package/dist/UuidUtilities.d.ts.map +1 -1
  95. package/dist/UuidUtilities.js.map +1 -1
  96. package/dist/id-compressor/AppendOnlySortedMap.d.ts.map +1 -1
  97. package/dist/id-compressor/AppendOnlySortedMap.js +3 -3
  98. package/dist/id-compressor/AppendOnlySortedMap.js.map +1 -1
  99. package/dist/id-compressor/IdCompressor.d.ts +1 -1
  100. package/dist/id-compressor/IdCompressor.d.ts.map +1 -1
  101. package/dist/id-compressor/IdCompressor.js +25 -26
  102. package/dist/id-compressor/IdCompressor.js.map +1 -1
  103. package/dist/id-compressor/IdRange.d.ts.map +1 -1
  104. package/dist/id-compressor/IdRange.js +2 -2
  105. package/dist/id-compressor/IdRange.js.map +1 -1
  106. package/dist/id-compressor/NumericUuid.d.ts.map +1 -1
  107. package/dist/id-compressor/NumericUuid.js +2 -1
  108. package/dist/id-compressor/NumericUuid.js.map +1 -1
  109. package/dist/id-compressor/SessionIdNormalizer.d.ts.map +1 -1
  110. package/dist/id-compressor/SessionIdNormalizer.js +8 -9
  111. package/dist/id-compressor/SessionIdNormalizer.js.map +1 -1
  112. package/dist/migration-shim/migrationDeltaHandler.d.ts +1 -1
  113. package/dist/migration-shim/migrationDeltaHandler.d.ts.map +1 -1
  114. package/dist/migration-shim/migrationDeltaHandler.js +11 -11
  115. package/dist/migration-shim/migrationDeltaHandler.js.map +1 -1
  116. package/dist/migration-shim/migrationShim.d.ts +8 -4
  117. package/dist/migration-shim/migrationShim.d.ts.map +1 -1
  118. package/dist/migration-shim/migrationShim.js +13 -13
  119. package/dist/migration-shim/migrationShim.js.map +1 -1
  120. package/dist/migration-shim/migrationShimFactory.d.ts +2 -2
  121. package/dist/migration-shim/migrationShimFactory.d.ts.map +1 -1
  122. package/dist/migration-shim/migrationShimFactory.js +2 -2
  123. package/dist/migration-shim/migrationShimFactory.js.map +1 -1
  124. package/dist/migration-shim/packageVersion.d.ts +0 -2
  125. package/dist/migration-shim/packageVersion.d.ts.map +1 -1
  126. package/dist/migration-shim/packageVersion.js +0 -2
  127. package/dist/migration-shim/packageVersion.js.map +1 -1
  128. package/dist/migration-shim/sharedTreeDeltaHandler.d.ts.map +1 -1
  129. package/dist/migration-shim/sharedTreeDeltaHandler.js +8 -8
  130. package/dist/migration-shim/sharedTreeDeltaHandler.js.map +1 -1
  131. package/dist/migration-shim/sharedTreeShim.d.ts +2 -2
  132. package/dist/migration-shim/sharedTreeShim.d.ts.map +1 -1
  133. package/dist/migration-shim/sharedTreeShim.js +8 -4
  134. package/dist/migration-shim/sharedTreeShim.js.map +1 -1
  135. package/dist/migration-shim/sharedTreeShimFactory.d.ts +1 -1
  136. package/dist/migration-shim/sharedTreeShimFactory.d.ts.map +1 -1
  137. package/dist/migration-shim/sharedTreeShimFactory.js +2 -2
  138. package/dist/migration-shim/sharedTreeShimFactory.js.map +1 -1
  139. package/dist/migration-shim/shimChannelServices.d.ts +1 -1
  140. package/dist/migration-shim/shimChannelServices.d.ts.map +1 -1
  141. package/dist/migration-shim/shimChannelServices.js.map +1 -1
  142. package/dist/migration-shim/shimDeltaConnection.d.ts +1 -1
  143. package/dist/migration-shim/shimDeltaConnection.d.ts.map +1 -1
  144. package/dist/migration-shim/shimDeltaConnection.js +2 -2
  145. package/dist/migration-shim/shimDeltaConnection.js.map +1 -1
  146. package/dist/migration-shim/shimHandle.d.ts.map +1 -1
  147. package/dist/migration-shim/shimHandle.js.map +1 -1
  148. package/dist/migration-shim/types.d.ts +1 -1
  149. package/dist/migration-shim/types.d.ts.map +1 -1
  150. package/dist/migration-shim/types.js.map +1 -1
  151. package/dist/migration-shim/utils.d.ts +1 -1
  152. package/dist/migration-shim/utils.d.ts.map +1 -1
  153. package/dist/migration-shim/utils.js.map +1 -1
  154. package/dist/persisted-types/0.0.2.d.ts +1 -1
  155. package/dist/persisted-types/0.0.2.d.ts.map +1 -1
  156. package/dist/persisted-types/0.0.2.js.map +1 -1
  157. package/dist/persisted-types/0.1.1.d.ts +1 -1
  158. package/dist/persisted-types/0.1.1.d.ts.map +1 -1
  159. package/dist/persisted-types/0.1.1.js +3 -3
  160. package/dist/persisted-types/0.1.1.js.map +1 -1
  161. package/lib/ChangeCompression.d.ts +2 -2
  162. package/lib/ChangeCompression.d.ts.map +1 -1
  163. package/lib/ChangeCompression.js +1 -1
  164. package/lib/ChangeCompression.js.map +1 -1
  165. package/lib/ChangeTypes.d.ts +1 -1
  166. package/lib/ChangeTypes.d.ts.map +1 -1
  167. package/lib/ChangeTypes.js +2 -2
  168. package/lib/ChangeTypes.js.map +1 -1
  169. package/lib/Checkout.d.ts +3 -3
  170. package/lib/Checkout.d.ts.map +1 -1
  171. package/lib/Checkout.js +4 -4
  172. package/lib/Checkout.js.map +1 -1
  173. package/lib/EditLog.d.ts +1 -1
  174. package/lib/EditLog.d.ts.map +1 -1
  175. package/lib/EditLog.js +2 -2
  176. package/lib/EditLog.js.map +1 -1
  177. package/lib/EditUtilities.d.ts +3 -3
  178. package/lib/EditUtilities.d.ts.map +1 -1
  179. package/lib/EditUtilities.js +5 -5
  180. package/lib/EditUtilities.js.map +1 -1
  181. package/lib/Forest.d.ts.map +1 -1
  182. package/lib/Forest.js +2 -2
  183. package/lib/Forest.js.map +1 -1
  184. package/lib/HistoryEditFactory.d.ts +1 -1
  185. package/lib/HistoryEditFactory.d.ts.map +1 -1
  186. package/lib/HistoryEditFactory.js +5 -5
  187. package/lib/HistoryEditFactory.js.map +1 -1
  188. package/lib/IdConversion.d.ts.map +1 -1
  189. package/lib/IdConversion.js.map +1 -1
  190. package/lib/LogViewer.d.ts +2 -2
  191. package/lib/LogViewer.d.ts.map +1 -1
  192. package/lib/LogViewer.js +3 -3
  193. package/lib/LogViewer.js.map +1 -1
  194. package/lib/MergeHealth.d.ts.map +1 -1
  195. package/lib/MergeHealth.js +1 -1
  196. package/lib/MergeHealth.js.map +1 -1
  197. package/lib/NodeIdUtilities.d.ts +1 -1
  198. package/lib/NodeIdUtilities.d.ts.map +1 -1
  199. package/lib/NodeIdUtilities.js +1 -1
  200. package/lib/NodeIdUtilities.js.map +1 -1
  201. package/lib/PayloadUtilities.d.ts.map +1 -1
  202. package/lib/PayloadUtilities.js +1 -1
  203. package/lib/PayloadUtilities.js.map +1 -1
  204. package/lib/ReconciliationPath.d.ts +1 -1
  205. package/lib/ReconciliationPath.d.ts.map +1 -1
  206. package/lib/ReconciliationPath.js.map +1 -1
  207. package/lib/RevisionValueCache.d.ts.map +1 -1
  208. package/lib/RevisionValueCache.js +2 -2
  209. package/lib/RevisionValueCache.js.map +1 -1
  210. package/lib/RevisionView.d.ts +2 -2
  211. package/lib/RevisionView.d.ts.map +1 -1
  212. package/lib/RevisionView.js.map +1 -1
  213. package/lib/SerializationUtilities.d.ts +1 -1
  214. package/lib/SerializationUtilities.d.ts.map +1 -1
  215. package/lib/SerializationUtilities.js.map +1 -1
  216. package/lib/SharedTree.d.ts +8 -7
  217. package/lib/SharedTree.d.ts.map +1 -1
  218. package/lib/SharedTree.js +13 -13
  219. package/lib/SharedTree.js.map +1 -1
  220. package/lib/SharedTreeEncoder.d.ts +1 -1
  221. package/lib/SharedTreeEncoder.d.ts.map +1 -1
  222. package/lib/SharedTreeEncoder.js +5 -5
  223. package/lib/SharedTreeEncoder.js.map +1 -1
  224. package/lib/Summary.d.ts +2 -2
  225. package/lib/Summary.d.ts.map +1 -1
  226. package/lib/Summary.js +1 -1
  227. package/lib/Summary.js.map +1 -1
  228. package/lib/SummaryBackCompatibility.d.ts.map +1 -1
  229. package/lib/SummaryBackCompatibility.js.map +1 -1
  230. package/lib/SummaryTestUtilities.d.ts +1 -1
  231. package/lib/SummaryTestUtilities.d.ts.map +1 -1
  232. package/lib/SummaryTestUtilities.js.map +1 -1
  233. package/lib/Transaction.d.ts +3 -3
  234. package/lib/Transaction.d.ts.map +1 -1
  235. package/lib/Transaction.js +3 -3
  236. package/lib/Transaction.js.map +1 -1
  237. package/lib/TransactionInternal.d.ts +3 -3
  238. package/lib/TransactionInternal.d.ts.map +1 -1
  239. package/lib/TransactionInternal.js +3 -3
  240. package/lib/TransactionInternal.js.map +1 -1
  241. package/lib/TreeCompressor.d.ts +5 -1
  242. package/lib/TreeCompressor.d.ts.map +1 -1
  243. package/lib/TreeCompressor.js +2 -2
  244. package/lib/TreeCompressor.js.map +1 -1
  245. package/lib/TreeNodeHandle.d.ts +1 -1
  246. package/lib/TreeNodeHandle.d.ts.map +1 -1
  247. package/lib/TreeNodeHandle.js.map +1 -1
  248. package/lib/TreeView.d.ts +1 -1
  249. package/lib/TreeView.d.ts.map +1 -1
  250. package/lib/TreeView.js +1 -2
  251. package/lib/TreeView.js.map +1 -1
  252. package/lib/UuidUtilities.d.ts.map +1 -1
  253. package/lib/UuidUtilities.js +1 -1
  254. package/lib/UuidUtilities.js.map +1 -1
  255. package/lib/id-compressor/AppendOnlySortedMap.d.ts.map +1 -1
  256. package/lib/id-compressor/AppendOnlySortedMap.js +1 -1
  257. package/lib/id-compressor/AppendOnlySortedMap.js.map +1 -1
  258. package/lib/id-compressor/IdCompressor.d.ts +1 -1
  259. package/lib/id-compressor/IdCompressor.d.ts.map +1 -1
  260. package/lib/id-compressor/IdCompressor.js +4 -5
  261. package/lib/id-compressor/IdCompressor.js.map +1 -1
  262. package/lib/id-compressor/IdRange.d.ts.map +1 -1
  263. package/lib/id-compressor/IdRange.js +1 -1
  264. package/lib/id-compressor/IdRange.js.map +1 -1
  265. package/lib/id-compressor/NumericUuid.d.ts.map +1 -1
  266. package/lib/id-compressor/NumericUuid.js +2 -1
  267. package/lib/id-compressor/NumericUuid.js.map +1 -1
  268. package/lib/id-compressor/SessionIdNormalizer.d.ts.map +1 -1
  269. package/lib/id-compressor/SessionIdNormalizer.js +1 -2
  270. package/lib/id-compressor/SessionIdNormalizer.js.map +1 -1
  271. package/lib/migration-shim/migrationDeltaHandler.d.ts +1 -1
  272. package/lib/migration-shim/migrationDeltaHandler.d.ts.map +1 -1
  273. package/lib/migration-shim/migrationDeltaHandler.js +1 -1
  274. package/lib/migration-shim/migrationDeltaHandler.js.map +1 -1
  275. package/lib/migration-shim/migrationShim.d.ts +8 -4
  276. package/lib/migration-shim/migrationShim.d.ts.map +1 -1
  277. package/lib/migration-shim/migrationShim.js +3 -3
  278. package/lib/migration-shim/migrationShim.js.map +1 -1
  279. package/lib/migration-shim/migrationShimFactory.d.ts +2 -2
  280. package/lib/migration-shim/migrationShimFactory.d.ts.map +1 -1
  281. package/lib/migration-shim/migrationShimFactory.js +1 -1
  282. package/lib/migration-shim/migrationShimFactory.js.map +1 -1
  283. package/lib/migration-shim/packageVersion.d.ts +0 -2
  284. package/lib/migration-shim/packageVersion.d.ts.map +1 -1
  285. package/lib/migration-shim/packageVersion.js +0 -2
  286. package/lib/migration-shim/packageVersion.js.map +1 -1
  287. package/lib/migration-shim/sharedTreeDeltaHandler.d.ts.map +1 -1
  288. package/lib/migration-shim/sharedTreeDeltaHandler.js +1 -1
  289. package/lib/migration-shim/sharedTreeDeltaHandler.js.map +1 -1
  290. package/lib/migration-shim/sharedTreeShim.d.ts +2 -2
  291. package/lib/migration-shim/sharedTreeShim.d.ts.map +1 -1
  292. package/lib/migration-shim/sharedTreeShim.js +6 -2
  293. package/lib/migration-shim/sharedTreeShim.js.map +1 -1
  294. package/lib/migration-shim/sharedTreeShimFactory.d.ts +1 -1
  295. package/lib/migration-shim/sharedTreeShimFactory.d.ts.map +1 -1
  296. package/lib/migration-shim/sharedTreeShimFactory.js +1 -1
  297. package/lib/migration-shim/sharedTreeShimFactory.js.map +1 -1
  298. package/lib/migration-shim/shimChannelServices.d.ts +1 -1
  299. package/lib/migration-shim/shimChannelServices.d.ts.map +1 -1
  300. package/lib/migration-shim/shimChannelServices.js.map +1 -1
  301. package/lib/migration-shim/shimDeltaConnection.d.ts +1 -1
  302. package/lib/migration-shim/shimDeltaConnection.d.ts.map +1 -1
  303. package/lib/migration-shim/shimDeltaConnection.js +1 -1
  304. package/lib/migration-shim/shimDeltaConnection.js.map +1 -1
  305. package/lib/migration-shim/shimHandle.d.ts.map +1 -1
  306. package/lib/migration-shim/shimHandle.js.map +1 -1
  307. package/lib/migration-shim/types.d.ts +1 -1
  308. package/lib/migration-shim/types.d.ts.map +1 -1
  309. package/lib/migration-shim/types.js.map +1 -1
  310. package/lib/migration-shim/utils.d.ts +1 -1
  311. package/lib/migration-shim/utils.d.ts.map +1 -1
  312. package/lib/migration-shim/utils.js.map +1 -1
  313. package/lib/persisted-types/0.0.2.d.ts +1 -1
  314. package/lib/persisted-types/0.0.2.d.ts.map +1 -1
  315. package/lib/persisted-types/0.0.2.js.map +1 -1
  316. package/lib/persisted-types/0.1.1.d.ts +1 -1
  317. package/lib/persisted-types/0.1.1.d.ts.map +1 -1
  318. package/lib/persisted-types/0.1.1.js +1 -1
  319. package/lib/persisted-types/0.1.1.js.map +1 -1
  320. package/package.json +33 -32
  321. package/src/ChangeCompression.ts +8 -8
  322. package/src/ChangeTypes.ts +5 -4
  323. package/src/Checkout.ts +9 -7
  324. package/src/EditLog.ts +4 -3
  325. package/src/EditUtilities.ts +9 -8
  326. package/src/Forest.ts +3 -2
  327. package/src/HistoryEditFactory.ts +12 -11
  328. package/src/IdConversion.ts +2 -2
  329. package/src/LogViewer.ts +5 -4
  330. package/src/MergeHealth.ts +2 -1
  331. package/src/NodeIdUtilities.ts +2 -2
  332. package/src/PayloadUtilities.ts +2 -1
  333. package/src/ReconciliationPath.ts +1 -1
  334. package/src/RevisionValueCache.ts +3 -2
  335. package/src/RevisionView.ts +3 -3
  336. package/src/SerializationUtilities.ts +1 -1
  337. package/src/SharedTree.ts +46 -49
  338. package/src/SharedTreeEncoder.ts +30 -29
  339. package/src/Summary.ts +5 -3
  340. package/src/SummaryBackCompatibility.ts +1 -0
  341. package/src/SummaryTestUtilities.ts +2 -1
  342. package/src/Transaction.ts +7 -6
  343. package/src/TransactionInternal.ts +17 -16
  344. package/src/TreeCompressor.ts +6 -4
  345. package/src/TreeNodeHandle.ts +2 -2
  346. package/src/TreeView.ts +3 -3
  347. package/src/UuidUtilities.ts +2 -1
  348. package/src/id-compressor/AppendOnlySortedMap.ts +2 -1
  349. package/src/id-compressor/IdCompressor.ts +18 -17
  350. package/src/id-compressor/IdRange.ts +2 -1
  351. package/src/id-compressor/NumericUuid.ts +1 -1
  352. package/src/id-compressor/SessionIdNormalizer.ts +3 -3
  353. package/src/migration-shim/migrationDeltaHandler.ts +3 -2
  354. package/src/migration-shim/migrationShim.ts +14 -10
  355. package/src/migration-shim/migrationShimFactory.ts +6 -4
  356. package/src/migration-shim/packageVersion.ts +0 -2
  357. package/src/migration-shim/sharedTreeDeltaHandler.ts +3 -2
  358. package/src/migration-shim/sharedTreeShim.ts +7 -5
  359. package/src/migration-shim/sharedTreeShimFactory.ts +3 -3
  360. package/src/migration-shim/shimChannelServices.ts +1 -1
  361. package/src/migration-shim/shimDeltaConnection.ts +3 -2
  362. package/src/migration-shim/shimHandle.ts +1 -0
  363. package/src/migration-shim/types.ts +3 -1
  364. package/src/migration-shim/utils.ts +2 -1
  365. package/src/persisted-types/0.0.2.ts +2 -2
  366. package/src/persisted-types/0.1.1.ts +10 -8
  367. package/dist/tree-alpha.d.ts +0 -2901
  368. package/dist/tree-beta.d.ts +0 -348
  369. package/dist/tree-public.d.ts +0 -348
  370. package/dist/tree-untrimmed.d.ts +0 -3820
  371. package/lib/test/AppendOnlySortedMap.perf.tests.d.ts +0 -6
  372. package/lib/test/AppendOnlySortedMap.perf.tests.d.ts.map +0 -1
  373. package/lib/test/AppendOnlySortedMap.perf.tests.js +0 -49
  374. package/lib/test/AppendOnlySortedMap.perf.tests.js.map +0 -1
  375. package/lib/test/AppendOnlySortedMap.tests.d.ts +0 -6
  376. package/lib/test/AppendOnlySortedMap.tests.d.ts.map +0 -1
  377. package/lib/test/AppendOnlySortedMap.tests.js +0 -213
  378. package/lib/test/AppendOnlySortedMap.tests.js.map +0 -1
  379. package/lib/test/ChangeCompression.tests.d.ts +0 -6
  380. package/lib/test/ChangeCompression.tests.d.ts.map +0 -1
  381. package/lib/test/ChangeCompression.tests.js +0 -154
  382. package/lib/test/ChangeCompression.tests.js.map +0 -1
  383. package/lib/test/Checkout.tests.d.ts +0 -10
  384. package/lib/test/Checkout.tests.d.ts.map +0 -1
  385. package/lib/test/Checkout.tests.js +0 -460
  386. package/lib/test/Checkout.tests.js.map +0 -1
  387. package/lib/test/Common.tests.d.ts +0 -6
  388. package/lib/test/Common.tests.d.ts.map +0 -1
  389. package/lib/test/Common.tests.js +0 -102
  390. package/lib/test/Common.tests.js.map +0 -1
  391. package/lib/test/EagerCheckout.tests.d.ts +0 -6
  392. package/lib/test/EagerCheckout.tests.d.ts.map +0 -1
  393. package/lib/test/EagerCheckout.tests.js +0 -20
  394. package/lib/test/EagerCheckout.tests.js.map +0 -1
  395. package/lib/test/Edit.tests.d.ts +0 -6
  396. package/lib/test/Edit.tests.d.ts.map +0 -1
  397. package/lib/test/Edit.tests.js +0 -60
  398. package/lib/test/Edit.tests.js.map +0 -1
  399. package/lib/test/EditLog.perf.tests.d.ts +0 -6
  400. package/lib/test/EditLog.perf.tests.d.ts.map +0 -1
  401. package/lib/test/EditLog.perf.tests.js +0 -41
  402. package/lib/test/EditLog.perf.tests.js.map +0 -1
  403. package/lib/test/EditLog.tests.d.ts +0 -6
  404. package/lib/test/EditLog.tests.d.ts.map +0 -1
  405. package/lib/test/EditLog.tests.js +0 -355
  406. package/lib/test/EditLog.tests.js.map +0 -1
  407. package/lib/test/EditUtilities.tests.d.ts +0 -6
  408. package/lib/test/EditUtilities.tests.d.ts.map +0 -1
  409. package/lib/test/EditUtilities.tests.js +0 -512
  410. package/lib/test/EditUtilities.tests.js.map +0 -1
  411. package/lib/test/Forest.perf.tests.d.ts +0 -6
  412. package/lib/test/Forest.perf.tests.d.ts.map +0 -1
  413. package/lib/test/Forest.perf.tests.js +0 -135
  414. package/lib/test/Forest.perf.tests.js.map +0 -1
  415. package/lib/test/Forest.tests.d.ts +0 -6
  416. package/lib/test/Forest.tests.d.ts.map +0 -1
  417. package/lib/test/Forest.tests.js +0 -213
  418. package/lib/test/Forest.tests.js.map +0 -1
  419. package/lib/test/GenericTransaction.tests.d.ts +0 -6
  420. package/lib/test/GenericTransaction.tests.d.ts.map +0 -1
  421. package/lib/test/GenericTransaction.tests.js +0 -31
  422. package/lib/test/GenericTransaction.tests.js.map +0 -1
  423. package/lib/test/HistoryEditFactory.tests.d.ts +0 -6
  424. package/lib/test/HistoryEditFactory.tests.d.ts.map +0 -1
  425. package/lib/test/HistoryEditFactory.tests.js +0 -170
  426. package/lib/test/HistoryEditFactory.tests.js.map +0 -1
  427. package/lib/test/IdCompressor.perf.tests.d.ts +0 -6
  428. package/lib/test/IdCompressor.perf.tests.d.ts.map +0 -1
  429. package/lib/test/IdCompressor.perf.tests.js +0 -290
  430. package/lib/test/IdCompressor.perf.tests.js.map +0 -1
  431. package/lib/test/IdCompressor.tests.d.ts +0 -6
  432. package/lib/test/IdCompressor.tests.d.ts.map +0 -1
  433. package/lib/test/IdCompressor.tests.js +0 -1542
  434. package/lib/test/IdCompressor.tests.js.map +0 -1
  435. package/lib/test/IdConversion.tests.d.ts +0 -6
  436. package/lib/test/IdConversion.tests.d.ts.map +0 -1
  437. package/lib/test/IdConversion.tests.js +0 -36
  438. package/lib/test/IdConversion.tests.js.map +0 -1
  439. package/lib/test/LazyCheckout.tests.d.ts +0 -6
  440. package/lib/test/LazyCheckout.tests.d.ts.map +0 -1
  441. package/lib/test/LazyCheckout.tests.js +0 -22
  442. package/lib/test/LazyCheckout.tests.js.map +0 -1
  443. package/lib/test/LogViewer.tests.d.ts +0 -6
  444. package/lib/test/LogViewer.tests.d.ts.map +0 -1
  445. package/lib/test/LogViewer.tests.js +0 -588
  446. package/lib/test/LogViewer.tests.js.map +0 -1
  447. package/lib/test/MergeHealthTelemetryHeartbeat.tests.d.ts +0 -6
  448. package/lib/test/MergeHealthTelemetryHeartbeat.tests.d.ts.map +0 -1
  449. package/lib/test/MergeHealthTelemetryHeartbeat.tests.js +0 -351
  450. package/lib/test/MergeHealthTelemetryHeartbeat.tests.js.map +0 -1
  451. package/lib/test/NumericUuid.perf.tests.d.ts +0 -6
  452. package/lib/test/NumericUuid.perf.tests.d.ts.map +0 -1
  453. package/lib/test/NumericUuid.perf.tests.js +0 -68
  454. package/lib/test/NumericUuid.perf.tests.js.map +0 -1
  455. package/lib/test/NumericUuid.tests.d.ts +0 -6
  456. package/lib/test/NumericUuid.tests.d.ts.map +0 -1
  457. package/lib/test/NumericUuid.tests.js +0 -192
  458. package/lib/test/NumericUuid.tests.js.map +0 -1
  459. package/lib/test/RevisionValueCache.tests.d.ts +0 -6
  460. package/lib/test/RevisionValueCache.tests.d.ts.map +0 -1
  461. package/lib/test/RevisionValueCache.tests.js +0 -106
  462. package/lib/test/RevisionValueCache.tests.js.map +0 -1
  463. package/lib/test/RevisionView.tests.d.ts +0 -6
  464. package/lib/test/RevisionView.tests.d.ts.map +0 -1
  465. package/lib/test/RevisionView.tests.js +0 -131
  466. package/lib/test/RevisionView.tests.js.map +0 -1
  467. package/lib/test/SessionIdNormalizer.tests.d.ts +0 -6
  468. package/lib/test/SessionIdNormalizer.tests.d.ts.map +0 -1
  469. package/lib/test/SessionIdNormalizer.tests.js +0 -377
  470. package/lib/test/SessionIdNormalizer.tests.js.map +0 -1
  471. package/lib/test/SharedTree.fuzz.tests.d.ts +0 -6
  472. package/lib/test/SharedTree.fuzz.tests.d.ts.map +0 -1
  473. package/lib/test/SharedTree.fuzz.tests.js +0 -9
  474. package/lib/test/SharedTree.fuzz.tests.js.map +0 -1
  475. package/lib/test/SharedTree.perf.tests.d.ts +0 -6
  476. package/lib/test/SharedTree.perf.tests.d.ts.map +0 -1
  477. package/lib/test/SharedTree.perf.tests.js +0 -39
  478. package/lib/test/SharedTree.perf.tests.js.map +0 -1
  479. package/lib/test/SharedTree.tests.d.ts +0 -6
  480. package/lib/test/SharedTree.tests.d.ts.map +0 -1
  481. package/lib/test/SharedTree.tests.js +0 -22
  482. package/lib/test/SharedTree.tests.js.map +0 -1
  483. package/lib/test/StringInterner.tests.d.ts +0 -6
  484. package/lib/test/StringInterner.tests.d.ts.map +0 -1
  485. package/lib/test/StringInterner.tests.js +0 -73
  486. package/lib/test/StringInterner.tests.js.map +0 -1
  487. package/lib/test/Summary.tests.d.ts +0 -7
  488. package/lib/test/Summary.tests.d.ts.map +0 -1
  489. package/lib/test/Summary.tests.js +0 -386
  490. package/lib/test/Summary.tests.js.map +0 -1
  491. package/lib/test/Transaction.tests.d.ts +0 -6
  492. package/lib/test/Transaction.tests.d.ts.map +0 -1
  493. package/lib/test/Transaction.tests.js +0 -124
  494. package/lib/test/Transaction.tests.js.map +0 -1
  495. package/lib/test/TransactionInternal.tests.d.ts +0 -6
  496. package/lib/test/TransactionInternal.tests.d.ts.map +0 -1
  497. package/lib/test/TransactionInternal.tests.js +0 -576
  498. package/lib/test/TransactionInternal.tests.js.map +0 -1
  499. package/lib/test/TreeCompression.tests.d.ts +0 -6
  500. package/lib/test/TreeCompression.tests.d.ts.map +0 -1
  501. package/lib/test/TreeCompression.tests.js +0 -291
  502. package/lib/test/TreeCompression.tests.js.map +0 -1
  503. package/lib/test/TreeView.tests.d.ts +0 -6
  504. package/lib/test/TreeView.tests.d.ts.map +0 -1
  505. package/lib/test/TreeView.tests.js +0 -178
  506. package/lib/test/TreeView.tests.js.map +0 -1
  507. package/lib/test/UndoRedoHandler.tests.d.ts +0 -6
  508. package/lib/test/UndoRedoHandler.tests.d.ts.map +0 -1
  509. package/lib/test/UndoRedoHandler.tests.js +0 -37
  510. package/lib/test/UndoRedoHandler.tests.js.map +0 -1
  511. package/lib/test/fuzz/Generators.d.ts +0 -8
  512. package/lib/test/fuzz/Generators.d.ts.map +0 -1
  513. package/lib/test/fuzz/Generators.js +0 -345
  514. package/lib/test/fuzz/Generators.js.map +0 -1
  515. package/lib/test/fuzz/SharedTreeFuzzTests.d.ts +0 -23
  516. package/lib/test/fuzz/SharedTreeFuzzTests.d.ts.map +0 -1
  517. package/lib/test/fuzz/SharedTreeFuzzTests.js +0 -241
  518. package/lib/test/fuzz/SharedTreeFuzzTests.js.map +0 -1
  519. package/lib/test/fuzz/Types.d.ts +0 -136
  520. package/lib/test/fuzz/Types.d.ts.map +0 -1
  521. package/lib/test/fuzz/Types.js +0 -6
  522. package/lib/test/fuzz/Types.js.map +0 -1
  523. package/lib/test/utilities/IdCompressorTestUtilities.d.ts +0 -246
  524. package/lib/test/utilities/IdCompressorTestUtilities.d.ts.map +0 -1
  525. package/lib/test/utilities/IdCompressorTestUtilities.js +0 -608
  526. package/lib/test/utilities/IdCompressorTestUtilities.js.map +0 -1
  527. package/lib/test/utilities/MockTransaction.d.ts +0 -35
  528. package/lib/test/utilities/MockTransaction.d.ts.map +0 -1
  529. package/lib/test/utilities/MockTransaction.js +0 -51
  530. package/lib/test/utilities/MockTransaction.js.map +0 -1
  531. package/lib/test/utilities/PendingLocalStateTests.d.ts +0 -12
  532. package/lib/test/utilities/PendingLocalStateTests.d.ts.map +0 -1
  533. package/lib/test/utilities/PendingLocalStateTests.js +0 -223
  534. package/lib/test/utilities/PendingLocalStateTests.js.map +0 -1
  535. package/lib/test/utilities/SharedTreeTests.d.ts +0 -12
  536. package/lib/test/utilities/SharedTreeTests.d.ts.map +0 -1
  537. package/lib/test/utilities/SharedTreeTests.js +0 -949
  538. package/lib/test/utilities/SharedTreeTests.js.map +0 -1
  539. package/lib/test/utilities/SharedTreeVersioningTests.d.ts +0 -11
  540. package/lib/test/utilities/SharedTreeVersioningTests.d.ts.map +0 -1
  541. package/lib/test/utilities/SharedTreeVersioningTests.js +0 -439
  542. package/lib/test/utilities/SharedTreeVersioningTests.js.map +0 -1
  543. package/lib/test/utilities/SummaryLoadPerfTests.d.ts +0 -10
  544. package/lib/test/utilities/SummaryLoadPerfTests.d.ts.map +0 -1
  545. package/lib/test/utilities/SummaryLoadPerfTests.js +0 -105
  546. package/lib/test/utilities/SummaryLoadPerfTests.js.map +0 -1
  547. package/lib/test/utilities/SummarySizeTests.d.ts +0 -11
  548. package/lib/test/utilities/SummarySizeTests.d.ts.map +0 -1
  549. package/lib/test/utilities/SummarySizeTests.js +0 -160
  550. package/lib/test/utilities/SummarySizeTests.js.map +0 -1
  551. package/lib/test/utilities/TestCommon.d.ts +0 -13
  552. package/lib/test/utilities/TestCommon.d.ts.map +0 -1
  553. package/lib/test/utilities/TestCommon.js +0 -19
  554. package/lib/test/utilities/TestCommon.js.map +0 -1
  555. package/lib/test/utilities/TestNode.d.ts +0 -140
  556. package/lib/test/utilities/TestNode.d.ts.map +0 -1
  557. package/lib/test/utilities/TestNode.js +0 -282
  558. package/lib/test/utilities/TestNode.js.map +0 -1
  559. package/lib/test/utilities/TestSerializer.d.ts +0 -24
  560. package/lib/test/utilities/TestSerializer.d.ts.map +0 -1
  561. package/lib/test/utilities/TestSerializer.js +0 -40
  562. package/lib/test/utilities/TestSerializer.js.map +0 -1
  563. package/lib/test/utilities/TestUtilities.d.ts +0 -212
  564. package/lib/test/utilities/TestUtilities.d.ts.map +0 -1
  565. package/lib/test/utilities/TestUtilities.js +0 -413
  566. package/lib/test/utilities/TestUtilities.js.map +0 -1
  567. package/lib/test/utilities/UndoRedoTests.d.ts +0 -32
  568. package/lib/test/utilities/UndoRedoTests.d.ts.map +0 -1
  569. package/lib/test/utilities/UndoRedoTests.js +0 -317
  570. package/lib/test/utilities/UndoRedoTests.js.map +0 -1
  571. /package/{dist → lib}/tsdoc-metadata.json +0 -0
package/lib/test/utilities/SharedTreeTests.js.map DELETED
@@ -1 +0,0 @@
1
- {"version":3,"file":"SharedTreeTests.js","sourceRoot":"","sources":["../../../src/test/utilities/SharedTreeTests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAE9B,OAAO,EAA6B,WAAW,EAAE,MAAM,sCAAsC,CAAC;AAC9F,OAAO,EAGN,yBAAyB,EACzB,sBAAsB,GACtB,MAAM,oCAAoC,CAAC;AAC5C,OAAO,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,IAAI,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAGhG,OAAO,EAAE,OAAO,EAAkB,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACnD,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,WAAW,EAAE,MAAM,mCAAmC,CAAC;AAChE,OAAO,EAAE,+BAA+B,EAAE,MAAM,sBAAsB,CAAC;AACvE,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAChE,OAAO,EAAE,qBAAqB,EAAE,MAAM,iCAAiC,CAAC;AAExE,OAAO,EAIN,kBAAkB,EAClB,UAAU,EAKV,WAAW,GACX,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,EAAa,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAC/F,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC5E,OAAO,EAAE,SAAS,EAAmB,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EAAE,uBAAuB,EAAE,MAAM,yBAAyB,CAAC;AAClE,OAAO,EAAE,uBAAuB,EAAE,uBAAuB,EAAE,MAAM,4BAA4B,CAAC;AAC9F,OAAO,EAAE,qBAAqB,EAAE,MAAM,0BAA0B,CAAC;AACjE,OAAO,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAC3D,OAAO,EAAE,gBAAgB,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACnE,OAAO,EAAE,SAAS,EAAE,cAAc,EAAY,MAAM,eAAe,CAAC;AACpE,OAAO,EAAE,eAAe,EAAE,mBAAmB,EAAE,MAAM,qBAAqB,CAAC;AAC3E,OAAO,EAAE,8BAA8B,EAAE,MAAM,oBAAoB,CAAC;AACpE,OAAO,EACN,kBAAkB,EAClB,aAAa,EAGb,aAAa,EACb,SAAS,EACT,cAAc,EACd,WAAW,EACX,iBAAiB,EACjB,YAAY,EACZ,WAAW,EACX,aAAa,EACb,6BAA6B,EAC7B,kBAAkB,GAClB,MAAM,oBAAoB,CAAC;AAE5B,SAAS,gBAAgB,CAAC,IAAgB,EAAE,IAAY;IACvD,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,kFAAkF;AAClF,MAAM,eAAe,GAAG;IACvB,KAAK,EAAE,QAAQ;IACf,IAAI,EAAE,gBAAgB;IACtB,IAAI,EAAE,gBAAgB;CACtB,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,4BAA4B,CAC3C,KAAa,EACb,WAAwB,EACxB,qCAA0G;IAE1G,MAAM,mBAAmB,GAAiD,CAAC,OAAO,EAAE,EAAE,CACrF,qCAAqC,CAAC,EAAE,WAAW,EAAE,GAAG,OAAO,EAAE,CAAC,CAAC;IA6BpE,SAAS,oBAAoB,CAAC,OAAkC;QAC/D,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,gBAAgB,EAAE,uBAAuB,EAAE,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;QACrG,MAAM,QAAQ,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC;QAC3C,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,gBAAgB,EAAE,uBAAuB,EAAE,CAAC;IAC5E,CAAC;IAED,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE;QACpB,MAAM,cAAc,GAAG,IAAI,mBAAmB,EAAE,CAAC;QAEjD,QAAQ,CAAC,kCAAkC,EAAE,GAAG,EAAE;YACjD,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;gBACtC,MAAM,EAAE,IAAI,EAAE,GAAG,mBAAmB,EAAE,CAAC;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;YAClC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;gBACrC,MAAM,EAAE,IAAI,EAAE,GAAG,mBAAmB,EAAE,CAAC;gBACvC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CACzE,EAAE,EACF,gEAAgE,CAChE,CAAC;YACH,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;YAC1C,EAAE,CAAC,mEAAmE,EAAE,GAAG,EAAE;gBAC5E,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,oBAAoB,EAAE,CAAC;gBAExD,IAAI,WAAW,GAAG,CAAC,CAAC;gBACpB,UAAU,CAAC,EAAE,CAAC,eAAe,CAAC,aAAa,EAAE,GAAG,EAAE;oBACjD,MAAM,SAAS,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;oBAC/E,MAAM,UAAU,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;oBAEjF,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,6BAA6B;oBACnE,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,gCAAgC;oBAEvE,WAAW,IAAI,CAAC,CAAC;gBAClB,CAAC,CAAC,CAAC;gBAEH,UAAU,CAAC,SAAS,CACnB,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAClF,CAAC;gBACF,MAAM,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;gBACpC,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,oBAAoB,EAAE,CAAC;gBAExD,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;gBAChE,MAAM,OAAO,GAAG,CAAC,CAAC;gBAClB,MAAM,kBAAkB,GAAG,UAAwB,CAAC;gBACpD,MAAM,UAAU,GAAG;oBAClB,UAAU,EAAE,QAAQ,CAAC,cAAc,EAAE;oBACrC,UAAU,EAAE,MAAM;oBAClB,MAAM,EAAE;wBACP,CAAC,kBAAkB,CAAC,EAAE,OAAO;qBAC7B;iBACD,CAAC;gBACF,MAAM,QAAQ,GAAG,CAAC,CAAC;gBACnB,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;gBACpD,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;gBACvD,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;gBAEhF,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,WAAW,EAAE,YAAY,CAAC,CAAC;gBAE5D,MAAM,SAAS,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC/E,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACrC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;gBACrD,MAAM,aAAa,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC;oBACrD,MAAM,EAAE,UAAU,CAAC,UAAU;oBAC7B,KAAK,EAAE,kBAAkB;iBACzB,CAAC,CAAC;gBACH,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACzC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;YACzD,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;gBAClD,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,oBAAoB,CAAC,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC,CAAC;gBAEhF,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;gBACvC,MAAM,OAAO,GAAG,CAAC,CAAC;gBAClB,MAAM,kBAAkB,GAAG,UAAU,CAAC;gBACtC,MAAM,UAAU,GAAc;oBAC7B,UAAU,EAAE,QAAQ,CAAC,cAAc,EAAE;oBACrC,UAAU,EAAE,MAAM;oBAClB,MAAM,EAAE;wBACP,CAAC,kBAAkB,CAAC,EAAE,OAAO;qBAC7B;iBACD,CAAC;gBACF,MAAM,WAAW,GAAc;oBAC9B,UAAU,EAAE,QAAQ,CAAC,cAAc,EAAE;oBACrC,UAAU,EAAE,MAAM;oBAClB,MAAM,EAAE;wBACP,CAAC,kBAAkB,CAAC,EAAE,OAAO;qBAC7B;iBACD,CAAC;gBAEF,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;gBACpD,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;gBAChD,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;gBAElD,aAAa,CAAC,UAAU,EAAE,GAAG,EAAE;oBAC9B,2DAA2D;oBAC3D,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,WAAW,EAAE,YAAY,CAAC,CAAC;gBAC7D,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;YAEH,oCAAoC;YACpC,EAAE,CAAC,IAAI,CAAC,4DAA4D,EAAE,GAAG,EAAE;gBAC1E,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,oBAAoB,CAAC,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC;gBAE9E,MAAM,YAAY,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;gBACnE,MAAM,kBAAkB,GAAG,CAAC,CAAC;gBAC7B,MAAM,EAAE,EAAE,EAAE,GAAG,UAAU,CAAC,SAAS,CAClC,MAAM,CAAC,KAAK,CAAC,YAAY,EAAE,kBAAkB,CAAC,EAC9C,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,UAAU,EAAE,EAAE,CAAC,EAC9C,MAAM,CAAC,MAAM,CAAC,kBAAkB,EAAE,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CACpE,CAAC;gBACF,MAAM,SAAS,GAAG,UAAU,CAAC,SAA6B,CAAC;gBAC3D,MAAM,CAAC,SAAS,CAAC,qBAAqB,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CACpF,UAAU,CAAC,OAAO,CAClB,CAAC;gBACF,UAAU,CAAC,WAAW,CAAC,gBAAgB,EAAE,CAAC;YAC3C,CAAC,CAAC,CAAC;YAEH,oCAAoC;YACpC,EAAE,CAAC,IAAI,CAAC,sEAAsE,EAAE,GAAG,EAAE;gBACpF,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,oBAAoB,CAAC,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC;gBAE9E,MAAM,eAAe,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;gBAC7C,MAAM,yBAAyB,GAAG,CAAC,CAAC;gBACpC,MAAM,2BAA2B,GAAG,CAAC,CAAC;gBACtC,MAAM,EAAE,EAAE,EAAE,GAAG,UAAU,CAAC,SAAS,CAClC,MAAM,CAAC,KAAK,CAAC,eAAe,EAAE,yBAAyB,CAAC,EACxD,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,2BAA2B,CAAC;gBAC5E,8DAA8D;gBAC9D,MAAM,CAAC,MAAM,CACZ,yBAAyB,EACzB,WAAW,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,EAAE,KAAmB,EAAE,CAAC,CACxF,EACD,MAAM,CAAC,MAAM,CAAC,2BAA2B,EAAE,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAC7E,CAAC;gBACF,MAAM,SAAS,GAAG,UAAU,CAAC,SAA6B,CAAC;gBAC3D,MAAM,CAAC,SAAS,CAAC,qBAAqB,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CACpF,UAAU,CAAC,OAAO,CAClB,CAAC;gBACF,UAAU,CAAC,WAAW,CAAC,gBAAgB,EAAE,CAAC;YAC3C,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;gBACxC,MAAM,EAAE,UAAU,EAAE,GAAG,oBAAoB,CAAC,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC;gBACpE,MAAM,MAAM,GAAG,UAAU,CAAC,eAAe,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;gBAClE,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC/C,aAAa,CAAC,UAAU,EAAE,GAAG,EAAE;oBAC9B,yBAAyB;oBACzB,UAAU,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC/D,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;gBACjE,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,oBAAoB,EAAE,CAAC;gBAExD,MAAM,OAAO,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;gBAE9D,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACtF,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAEnG,MAAM,SAAS,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC/E,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACnC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YACjD,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;gBAC9D,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,GAAG,oBAAoB,EAAE,CAAC;gBAC3D,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,mBAAmB,EAAE,CAAC;gBACpD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;YACrD,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,2EAA2E,EAAE,GAAG,EAAE;gBACpF,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,GAAG,oBAAoB,EAAE,CAAC;gBAC3D,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,GAAG,oBAAoB,EAAE,CAAC;gBAE3D,oEAAoE;gBACpE,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;YACrD,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;gBACpC,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,oBAAoB,CAAC,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC;gBAE9E,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;gBAChE,MAAM,UAAU,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;gBAEjE,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,SAAS,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACxF,UAAU,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBAEjE,iFAAiF;gBACjF,kBAAkB;gBAClB,aAAa,CAAC,UAAU,EAAE,GAAG,EAAE;oBAC9B,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,UAAU,EAAE,WAAW,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBACtF,CAAC,CAAC,CAAC;gBAEH,MAAM,SAAS,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC/E,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;gBACrC,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,oBAAoB,CAAC,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC;gBAE9E,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;gBAChE,MAAM,UAAU,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;gBACjE,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;gBAEhE,UAAU,CAAC,SAAS,CACnB,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,SAAS,EAAE,UAAU,EAAE,SAAS,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAC1F,CAAC;gBACF,UAAU,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBAElE,aAAa,CAAC,UAAU,EAAE,GAAG,EAAE;oBAC9B,yEAAyE;oBACzE,UAAU,CAAC,SAAS,CACnB,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAChG,CAAC;oBAEF,wEAAwE;oBACxE,UAAU,CAAC,SAAS,CACnB,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAC/F,CAAC;gBACH,CAAC,CAAC,CAAC;gBAEH,4CAA4C;gBAC5C,MAAM,SAAS,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC/E,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;gBACtC,MAAM,EAAE,UAAU,EAAE,GAAG,oBAAoB,CAAC,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC,CAAC;gBAEtE,aAAa,CAAC,UAAU,EAAE,GAAG,EAAE;oBAC9B,UAAU,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC3C,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;gBAC3C,MAAM,aAAa,GAAG,gBAAgB,EAAE,CAAC;gBACzC,MAAM,EAAE,IAAI,EAAE,GAAG,mBAAmB,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC;gBACxD,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,WAAW,KAAK,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;YACnG,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;gBACxC,MAAM,aAAa,GAAG,gBAAgB,EAAE,CAAC;gBACzC,MAAM,EAAE,IAAI,EAAE,GAAG,mBAAmB,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC;gBACxD,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;gBACjC,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,WAAW,KAAK,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;YACzG,CAAC,CAAC,CAAC;YAEH,8BAA8B,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,GAAG,eAAe,EAAE,CAAC,CAAC;QACzE,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,wDAAwD,EAAE,GAAG,EAAE;YACvE;;;eAGG;YACH,MAAM,YAAY,GAAG,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;YAE1C;;eAEG;YACH,SAAS,uBAAuB,CAC/B,uBAAoD;gBAEpD,OAAO;oBACN,uBAAuB;oBACvB,EAAE,EAAE,sBAAsB;oBAC1B,SAAS,EAAE,KAAK;iBAChB,CAAC;YACH,CAAC;YAED,IAAI,WAAW,KAAK,WAAW,CAAC,MAAM,EAAE;gBACvC,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;oBACtD,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,uBAAuB,EAAE,GAAG,mBAAmB,CAAC,YAAY,CAAC,CAAC;oBACzF,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,oBAAoB,CAC5E,uBAAuB,CAAC,uBAAuB,CAAC,CAChD,CAAC;oBAEF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;oBAC7C,MAAM,mBAAmB,GAAG,uBAAuB,CAAC,WAAW,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;oBAC9F,uBAAuB,CAAC,WAAW,GAAG,CAAC,GAAG,EAAE,EAAE;wBAC7C,yFAAyF;wBACxF,GAAG,CAAC,QAAkC,CAAC,OAAO,GAAG,SAAS,CAAC;wBAC5D,mBAAmB,CAAC,GAAG,CAAC,CAAC;oBAC1B,CAAC,CAAC;oBAEF,8EAA8E;oBAC9E,WAAW,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBAExE,MAAM,eAAe,GAAG,CAAC,UAAsB,EAAE,EAAE,CAClD,IAAI,cAAc,CACjB,UAAU,CAAC,WAAW,EACtB,UAAU,CAAC,eAAe,CAAC,WAAW,CAAC,qBAAqB,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CACnF,CAAC;oBAEH,IAAI,KAAK,GAAG,eAAe,CAAC,WAAW,CAAC,CAAC;oBACzC,IAAI,KAAK,GAAG,eAAe,CAAC,WAAW,CAAC,CAAC;oBAEzC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAC/E,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAErF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;oBAE7C,KAAK,GAAG,eAAe,CAAC,WAAW,CAAC,CAAC;oBACrC,KAAK,GAAG,eAAe,CAAC,WAAW,CAAC,CAAC;oBACrC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBACrF,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtF,CAAC,CAAC,CAAC;aACH;YAED,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;gBACnD,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,uBAAuB,EAAE,GAAG,mBAAmB,CAAC,YAAY,CAAC,CAAC;gBACzF,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,mBAAmB,CAAC,uBAAuB,CAAC,uBAAuB,CAAC,CAAC,CAAC;gBAEpG,MAAM,UAAU,GAAG,WAAW,CAAC,cAAc,EAAE,CAAC;gBAChD,WAAW,CAAC,SAAS,CACpB,GAAG,MAAM,CAAC,UAAU,CACnB,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,EACvB,WAAW,CAAC,SAAS,CAAC,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CACzD,CACD,CAAC;gBAEF,oBAAoB;gBACpB,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAE7C,MAAM,UAAU,GAAG,WAAW,CAAC,UAAU,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;gBAErE,mCAAmC;gBACnC,MAAM,CAAC,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;gBAC5E,MAAM,CAAC,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;gBAE5E,WAAW,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBAEnE,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAE7C,MAAM,KAAK,GAAG,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBAChF,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;gBAEzD,MAAM,KAAK,GAAG,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBAChF,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;YAC1D,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;gBACtD,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,uBAAuB,EAAE,GAAG,mBAAmB,CAAC,YAAY,CAAC,CAAC;gBACzF,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,GAAG,oBAAoB,CACvD,uBAAuB,CAAC,uBAAuB,CAAC,CAChD,CAAC;gBAEF,MAAM,UAAU,GAAG,WAAW,CAAC,cAAc,EAAE,CAAC;gBAChD,WAAW,CAAC,SAAS,CACpB,GAAG,MAAM,CAAC,UAAU,CACnB,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,EACvB,WAAW,CAAC,SAAS,CAAC,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CACzD,CACD,CAAC;gBACF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAE7C,qEAAqE;gBACrE,WAAW,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gBAE1F,2DAA2D;gBAC3D,MAAM,UAAU,GAAG,WAAW,CAAC,cAAc,EAAE,CAAC;gBAChD,WAAW,CAAC,SAAS,CACpB,GAAG,MAAM,CAAC,UAAU,CACnB,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,EACvB,WAAW,CAAC,SAAS,CAAC,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CACzD,CACD,CAAC;gBAEF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAE7C,yEAAyE;gBACzE,6FAA6F;gBAC7F,MAAM,SAAS,GAAG,YAAY,CAC7B,WAAW,EACX,GAAG,WAAW,CAAC,WAAW,CAAC,QAAQ,CAAC,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CACvE,CAAC;gBACF,MAAM,eAAe,GAAG,YAAY,CACnC,WAAW,EACX,GAAG,WAAW,CAAC,WAAW,CAAC,QAAQ,CAAC,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CACvE,CAAC;gBACF,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACnC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC,CAAC;gBAClE,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;YAChD,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;gBACjD,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,uBAAuB,EAAE,GAAG,mBAAmB,CAAC,YAAY,CAAC,CAAC;gBACzF,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,mBAAmB,CAAC,uBAAuB,CAAC,uBAAuB,CAAC,CAAC,CAAC;gBACpG,MAAM,UAAU,GAAG,WAAW,CAAC,cAAc,EAAE,CAAC;gBAChD,WAAW,CAAC,SAAS,CACpB,GAAG,MAAM,CAAC,UAAU,CACnB;oBACC;wBACC,UAAU,EAAE,UAAU;wBACtB,UAAU,EAAE,KAAK;wBACjB,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE;qBACjD;iBACD,EACD,WAAW,CAAC,SAAS,CAAC,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CACzD,CACD,CAAC;gBACF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAC7C,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;gBACnD,WAAW,CAAC,SAAS,CACpB,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC,CAClF,CAAC;gBACF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAC7C,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;YACpD,CAAC,CAAC,CAAC;YAEH,oCAAoC;YACpC,EAAE,CAAC,IAAI,CAAC,+EAA+E,EAAE,GAAG,EAAE;gBAC7F,MAAM,EAAE,QAAQ,EAAE,GAAG,oBAAoB,EAAE,CAAC;gBAE5C,MAAM,QAAQ,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;gBAE/D,MAAM,WAAW,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;gBAElE,MAAM,WAAW,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;gBAClE,MAAM,SAAS,GAAG,WAAW,CAAC,UAAU,CAAC;gBAEzC,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;gBAChE,MAAM,OAAO,GAAG,SAAS,CAAC,UAAU,CAAC;gBAErC,MAAM,WAAW,GAAG;oBACnB,GAAG,QAAQ;oBACX,MAAM,EAAE;wBACP,OAAO,EAAE;4BACR;gCACC,GAAG,WAAW;gCACd,MAAM,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE;6BAC5B;4BACD,WAAW;yBACX;qBACD;iBACD,CAAC;gBAEF,MAAM,sBAAsB,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,OAAqB,EAAE,CAAC;gBACnF,MAAM,kBAAkB,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,UAAwB,EAAE,CAAC;gBAEhF,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,uBAAuB,EAAE,GAAG,mBAAmB,CAAC;oBAC1E,GAAG,YAAY;oBACf,WAAW;oBACX,YAAY,EAAE,IAAI;iBAClB,CAAC,CAAC;gBACH,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,mBAAmB,CAAC;oBACjD,GAAG,uBAAuB,CAAC,uBAAuB,CAAC;oBACnD,YAAY,EAAE,IAAI;iBAClB,CAAC,CAAC;gBACH,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAE7C,+BAA+B;gBAC/B,sDAAsD;gBACtD,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,CAClC,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,WAAW,CAAC,SAAS,CAAC,sBAAsB,CAAC,CAAC,CACxF,CAAC;gBAEF,wCAAwC;gBACxC,2DAA2D;gBAC3D,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,CAClC,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,WAAW,CAAC,SAAS,CAAC,kBAAkB,CAAC,CAAC,CACtF,CAAC;gBAEF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAC7C,MAAM,SAAS,GAAG,WAAW,CAAC,SAA6B,CAAC;gBAC5D,MAAM,CAAC,SAAS,CAAC,qBAAqB,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAC1F,UAAU,CAAC,OAAO,CAClB,CAAC;gBACF,MAAM,CAAC,SAAS,CAAC,qBAAqB,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAC1F,UAAU,CAAC,OAAO,CAClB,CAAC;gBACF,WAAW,CAAC,WAAW,CAAC,gBAAgB,EAAE,CAAC;YAC5C,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;gBACpC,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,uBAAuB,EAAE,GAAG,mBAAmB,CAAC;oBAC1E,GAAG,YAAY;oBACf,YAAY,EAAE,IAAI;iBAClB,CAAC,CAAC;gBACH,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,mBAAmB,CAAC;oBACjD,GAAG,uBAAuB,CAAC,uBAAuB,CAAC;oBACnD,YAAY,EAAE,IAAI;iBAClB,CAAC,CAAC;gBAEH,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAE7C,MAAM,UAAU,GAAG,SAAS,CAAC,WAAW,CAAC,cAAc,EAAE,CAAC,CAAC;gBAC3D,MAAM,SAAS,GAAG,WAAW,CAAC,SAAS,CACtC,GAAG,MAAM,CAAC,UAAU,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,CAC3F,CAAC;gBACF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAE7C,8CAA8C;gBAC9C,kCAAkC;gBAClC,MAAM,UAAU,GAAG,WAAW,CAAC,SAAS,CACvC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC,CAClF,CAAC;gBAEF,IAAI,SAAS,CAAC;gBACd,aAAa,CAAC,WAAW,EAAE,GAAG,EAAE;oBAC/B,0EAA0E;oBAC1E,MAAM,WAAW,GAAG,SAAS,EAAE,CAAC;oBAChC,SAAS,GAAG,WAAW,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;oBACpG,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAC9C,CAAC,CAAC,CAAC;gBAEH,MAAM,SAAS,GAAG,WAAW,CAAC,WAAW,CAAC,QAAQ,CAAC,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC;gBACvF,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAErC,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC;gBAE1C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBAC1C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;gBAC3C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YAC3C,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;gBACrC,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,uBAAuB,EAAE,GAAG,mBAAmB,CAAC;oBAC1E,GAAG,YAAY;oBACf,YAAY,EAAE,IAAI;iBAClB,CAAC,CAAC;gBACH,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,mBAAmB,CAAC,uBAAuB,CAAC,uBAAuB,CAAC,CAAC,CAAC;gBAEpG,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAE7C,MAAM,UAAU,GAAG,SAAS,CAAC,WAAW,CAAC,cAAc,EAAE,CAAC,CAAC;gBAC3D,MAAM,WAAW,GAAG,SAAS,CAAC,WAAW,CAAC,cAAc,EAAE,CAAC,CAAC;gBAC5D,MAAM,SAAS,GAAG,SAAS,EAAE,CAAC;gBAC9B,MAAM,SAAS,GAAG,WAAW,CAAC,SAAS,CACtC,GAAG,MAAM,CAAC,UAAU,CACnB,CAAC,UAAU,EAAE,WAAW,EAAE,SAAS,CAAC,EACpC,WAAW,CAAC,SAAS,CAAC,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CACzD,CACD,CAAC;gBACF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAE7C,kCAAkC;gBAClC,MAAM,UAAU,GAAG,WAAW,CAAC,SAAS,CACvC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC,CACnF,CAAC;gBAEF,4FAA4F;gBAC5F,MAAM,SAAS,GAAG,WAAW,CAAC,SAAS,CACtC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAClG,CAAC;gBAEF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAE7C,4CAA4C;gBAC5C,MAAM,SAAS,GAAG,WAAW,CAAC,WAAW,CAAC,QAAQ,CAAC,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC;gBACvF,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAErC,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,OAAO,CAAC;gBAC1C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBAC1C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;gBAC3C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YAC3C,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;gBACtC,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,uBAAuB,EAAE,GAAG,oBAAoB,CAAC;oBACjF,GAAG,YAAY;oBACf,cAAc,EAAE,IAAI;iBACpB,CAAC,CAAC;gBACH,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,mBAAmB,CAAC,uBAAuB,CAAC,uBAAuB,CAAC,CAAC,CAAC;gBAEpG,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAE7C,IAAI,MAAe,CAAC;gBACpB,aAAa,CAAC,WAAW,EAAE,GAAG,EAAE;oBAC/B,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;oBAClC,MAAM,GAAG,WAAW,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBACzC,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAC9C,CAAC,CAAC,CAAC;gBAEH,8BAA8B;gBAC9B,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC5D,CAAC,CAAC,CAAC;YAEH,8BAA8B,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,eAAe,EAAE,CAAC,CAAC;YAEzE,mFAAmF;YACnF,0DAA0D;YAC1D,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;gBAC3D,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,uBAAuB,EAAE,GAAG,oBAAoB,CAAC,YAAY,CAAC,CAAC;gBAChG,MAAM,aAAa,GAAG,uBAAuB,CAAC,sBAAsB,CAAC,IAAI,yBAAyB,EAAE,CAAC,CAAC;gBACtG,MAAM,GAAG,GAAG,iBAAiB,CAAC,uBAAuB,CAAC,CAAC;gBACvD,MAAM,gBAAgB,GAAG,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC;gBAClD,WAAW,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;gBAC3E,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,qBAAqB,CAAC,SAAS,CAAC,CAAC;gBAC9D,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAC7C,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC;YACjE,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;gBAC3C,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,uBAAuB,EAAE,GAAG,mBAAmB,CAAC;oBAC1E,GAAG,YAAY;oBACf,YAAY,EAAE,IAAI;iBAClB,CAAC,CAAC;gBACH,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,mBAAmB,CAAC;oBACjD,GAAG,uBAAuB,CAAC,uBAAuB,CAAC;oBACnD,YAAY,EAAE,IAAI;iBAClB,CAAC,CAAC;gBACH,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAE7C,MAAM,WAAW,GAAG,WAAW,CAAC;gBAChC,WAAW,CAAC,SAAS,CACpB,GAAG,MAAM,CAAC,UAAU,CACnB,CAAC,SAAS,CAAC,WAAW,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,CAAC,EACpD,WAAW,CAAC,OAAO,CAAC,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CACvD,CACD,CAAC;gBACF,WAAW,CAAC,SAAS,CACpB,GAAG,MAAM,CAAC,UAAU,CACnB,CAAC,SAAS,CAAC,WAAW,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,CAAC,EACpD,WAAW,CAAC,OAAO,CAAC,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CACvD,CACD,CAAC;gBAEF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAC7C,MAAM,CAAC,WAAW,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACjD,MAAM,MAAM,GAAG,WAAW,CAAC,WAAW,CAAC,QAAQ,CAAC,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC;gBACpF,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,CAAC,WAAW,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;gBAC3E,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC;YACzC,CAAC,CAAC,CAAC;YAEH,IAAI,WAAW,KAAK,WAAW,CAAC,MAAM,EAAE;gBACvC,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;oBACvC,MAAM,cAAc,GAAG,gBAAgB,EAAE,CAAC;oBAC1C,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,uBAAuB,EAAE,GAAG,mBAAmB,CAAC;wBAC1E,GAAG,YAAY;wBACf,aAAa,EAAE,cAAc;qBAC7B,CAAC,CAAC;oBACH,MAAM,cAAc,GAAG,gBAAgB,EAAE,CAAC;oBAC1C,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,mBAAmB,CAAC;wBACjD,GAAG,uBAAuB,CAAC,uBAAuB,CAAC;wBACnD,aAAa,EAAE,cAAc;qBAC7B,CAAC,CAAC;oBACH,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;oBAE7C,MAAM,OAAO,GAAG,WAAW,CAAC,cAAc,EAAE,CAAC;oBAC7C,MAAM,aAAa,GAAG,WAAW,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC;oBACjE,WAAW,CAAC,SAAS,CACpB,GAAG,MAAM,CAAC,UAAU,CACnB,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,EACpB,WAAW,CAAC,OAAO,CAAC,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CACvD,CACD,CAAC;oBAEF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;oBAC7C,MAAM,CAAC,WAAW,CAAC,eAAe,CAAC,WAAW,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CACvF,cAAc,CACd,CAAC;oBAEF,MAAM,OAAO,GAAG,WAAW,CAAC,cAAc,EAAE,CAAC;oBAC7C,MAAM,aAAa,GAAG,WAAW,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC;oBACjE,WAAW,CAAC,SAAS,CACpB,GAAG,MAAM,CAAC,UAAU,CACnB,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,EACpB,WAAW,CAAC,OAAO,CAAC,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CACvD,CACD,CAAC;oBAEF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;oBAC7C,MAAM,CAAC,WAAW,CAAC,eAAe,CAAC,WAAW,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CACvF,cAAc,CACd,CAAC;gBACH,CAAC,CAAC,CAAC;aACH;QACF,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;YACvC,MAAM,UAAU,GAAG,IAAI,eAAe,EAAE,CAAC;YAEzC,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;gBACjD,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,EAAE,EAAE,cAAc,CAAC,CAAC,CAAC;gBACrD,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,oBAAoB,EAAE,cAAc,CAAC,CAAC,CAAC;gBACvE,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,yBAAyB,EAAE,cAAc,CAAC,CAAC,CAAC;YAC7E,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;gBACvD,MAAM,EAAE,IAAI,EAAE,iBAAiB,EAAE,GAAG,mBAAmB,EAAE,CAAC;gBAE1D,mEAAmE;gBACnE,MAAM,UAAU,GAAG,SAAS,CAAC,iBAAiB,CAAC,WAAW,EAAE,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;gBAC1F,MAAM,UAAU,GAAG,WAAW,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;gBAC3D,IAAI,WAAW,KAAK,WAAW,CAAC,MAAM,EAAE;oBACvC,MAAM,OAAO,GAAG,UAAqC,CAAC;oBACtD,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;oBACjD,MAAM,CAAC,gBAAgB,CAAC,OAAO,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;iBACtE;qBAAM;oBACN,MAAM,OAAO,GAAG,UAA+B,CAAC;oBAChD,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;oBAC3E,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;oBACpD,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;iBAClD;YACF,CAAC,CAAC,CAAC;YAEH,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,aAAa,EAAE,EAAE;gBACvC,EAAE,CAAC,6CAA6C,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,QAAQ,EAAE,KAAK,IAAI,EAAE;oBACrG,uCAAuC;oBACvC,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,uBAAuB,EAAE,GAAG,oBAAoB,CAAC;wBAC9E,SAAS,EAAE,aAAa;qBACxB,CAAC,CAAC;oBAEH,MAAM,OAAO,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;oBACrC,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACvF,IAAI,UAAkB,CAAC;oBACvB,IAAI,aAAa,EAAE;wBAClB,MAAM,EAAE,OAAO,EAAE,GAAG,UAAU,CAAC,gBAAgB,EAAE,CAAC;wBAClD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI,EAAE,6BAA6B,CAAC,CAAC;wBAC5E,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI,EAAE,oCAAoC,CAAC,CAAC;wBAC/F,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,OAAiB,CAAC;qBACnD;yBAAM;wBACN,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;wBAC7C,UAAU,GAAG,SAAS,CAAC,UAAU,CAAC,WAAW,EAAE,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;qBAC7E;oBAED,MAAM,WAAW,GAA0B,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;oBAClE,MAAM,UAAU,GACf,WAAW,KAAK,WAAW,CAAC,MAAM;wBACjC,CAAC,CAAC,IAAI,uBAAuB,CAAC,IAAI,CAAC,CAAC,aAAa,CAC/C,WAAgC,EAChC,UAAU,CAAC,aAAa,CACvB;wBACH,CAAC,CAAC,IAAI,uBAAuB,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,WAAsC,CAAC,CAAC;oBAE5F,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;oBACnD,MAAM,QAAQ,GAAG,gBAAgB,CAChC,kBAAkB,CAAC,UAAU,CAAC,WAAW,EAAE,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CACvE,CAAC;oBACF,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;oBACrC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;oBACjD,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;oBAClD,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBAEhD,MAAM,OAAO,GAAmC,IAAI,OAAO,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;oBAEpF,kGAAkG;oBAClG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBAEnC,uDAAuD;oBACvD,MAAM,YAAY,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC;oBAC5E,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBAChD,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;oBAChE,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;gBAClE,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;gBAC3C,MAAM,EACL,UAAU,EAAE,WAAW,EACvB,QAAQ,EAAE,SAAS,EACnB,uBAAuB,GACvB,GAAG,oBAAoB,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;gBAC/C,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,mBAAmB,EAAE,CAAC;gBAEpD,MAAM,OAAO,GAAG,SAAS,CAAC,SAAS,EAAE,CAAC;gBAEtC,WAAW,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACzF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAE7C,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC,CAAC;gBAEnD,kGAAkG;gBAClG,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;YACpD,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;gBACnE,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,uBAAuB,EAAE,GAAG,oBAAoB,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;gBACxG,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,mBAAmB,EAAE,CAAC;gBAEpD,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAE7C,yDAAyD;gBACzD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;gBAEpD,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC,CAAC;gBAEnD,kGAAkG;gBAClG,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;YACpD,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;gBAC/D,MAAM,EACL,UAAU,EAAE,WAAW,EACvB,QAAQ,EAAE,SAAS,EACnB,uBAAuB,GACvB,GAAG,oBAAoB,CAAC;oBACxB,SAAS,EAAE,KAAK;oBAChB,gBAAgB,EAAE,IAAI;oBACtB,WAAW,EAAE,WAAW,CAAC,MAAM;iBAC/B,CAAC,CAAC;gBACH,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,mBAAmB,EAAE,CAAC;gBAEpD,MAAM,OAAO,GAAG,SAAS,CAAC,SAAS,EAAE,CAAC;gBAEtC,WAAW,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACzF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAC7C,MAAM,OAAO,GAAG,WAAW,CAAC,WAAW,EAA6B,CAAC;gBACrE,MAAM,cAAc,GAAG,kBAAkB,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,KAAK,EAAE,CAAC;gBAC1E,cAAc,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;gBACvC,MAAM,gBAAgB,GAAG;oBACxB,GAAG,OAAO;oBACV,cAAc;iBACd,CAAC;gBACF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,WAAW,CAAC,WAAW,CAAC,gBAAgB,CAAC,EAC/C,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,WAAW,CAAC,CACpD,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,0CAA0C,EAAE,KAAK,IAAI,EAAE;gBACzD,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,oBAAoB,CAAC;oBACrD,SAAS,EAAE,IAAI;oBACf,gBAAgB,EAAE,KAAK;iBACvB,CAAC,CAAC;gBAEH,MAAM,OAAO,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;gBACrC,MAAM,EAAE,EAAE,EAAE,GAAG,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACtG,MAAM,UAAU,GAAG,gBAAgB,CAClC,qBAAqB,CAAC,UAAU,CAAC,WAAW,CAAC,EAC7C,CAAC,IAAI,EAAE,EAAE,CAAC,kBAAkB,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,UAAU,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC,CAChF,CAAC;gBACF,MAAM,EAAE,OAAO,EAAE,GAAG,UAAU,CAAC,gBAAgB,EAAE,CAAC;gBAClD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI,EAAE,6BAA6B,CAAC,CAAC;gBAC5E,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI,EAAE,oCAAoC,CAAC,CAAC;gBAC/F,MAAM,WAAW,GAA0B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,OAAiB,CAAC,CAAC;gBAE7F,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,mBAAmB,EAAE,CAAC;gBAEpD,WAAW,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;gBACrC,MAAM,SAAS,GAAG,gBAAgB,CACjC,qBAAqB,CAAC,WAAW,CAAC,WAAW,CAAC,EAC9C,CAAC,IAAI,EAAE,EAAE,CAAC,kBAAkB,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,WAAW,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC,CACjF,CAAC;gBACF,6FAA6F;gBAC7F,MAAM,CAAC,gBAAgB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;gBAE3D,yEAAyE;gBACzE,8EAA8E;gBAC9E,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;YAChE,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;gBACjD,MAAM,OAAO,GAAG,KAAK,CAAC;gBACtB,MAAM,EAAE,IAAI,EAAE,uBAAuB,EAAE,GAAG,mBAAmB,CAAC,EAAE,gBAAgB,EAAE,KAAK,EAAE,CAAC,CAAC;gBAC3F,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;gBAClE,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;gBACnC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,mBAAmB,CAAC,EAAE,gBAAgB,EAAE,KAAK,EAAE,CAAC,CAAC;gBACzE,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;gBAC3B,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAC7F,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;YACxB,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;gBAC/B,yEAAyE;gBACzE,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,oBAAoB,EAAE,CAAC;gBACxD,MAAM,UAAU,GAAG,IAAI,cAAc,CAAC,UAAU,CAAC,WAAW,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACxF,MAAM,CAAC,kBAAkB,CAAC,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;gBACjE,MAAM,CAAC,kBAAkB,CAAC,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;YACpE,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;gBAC3C,gFAAgF;gBAChF,uCAAuC;gBACvC,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,oBAAoB,EAAE,CAAC;gBACxD,MAAM,UAAU,GAAG,IAAI,cAAc,CAAC,UAAU,CAAC,WAAW,EAAE,QAAQ,CAAC,UAAU,CAAC,CAAC;gBACnF,MAAM,CAAC,kBAAkB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;gBAC5D,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,CAAC,kBAAkB,CAAC,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;gBACjE,MAAM,CAAC,UAAU,YAAY,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;YACzD,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;gBAClE,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,oBAAoB,EAAE,CAAC;gBACxD,MAAM,UAAU,GAAG,IAAI,cAAc,CAAC,UAAU,CAAC,WAAW,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACxF,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;gBAChD,4BAA4B;gBAC5B,UAAU,CAAC,SAAS,CACnB,GAAG,MAAM,CAAC,IAAI,CACb,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAChC,WAAW,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,CAC7F,CACD,CAAC;gBACF,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;YACjD,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;YAC1B,MAAM,kCAAkC;gBACvC,YACkB,mBAA4D,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI;oBAAvE,qBAAgB,GAAhB,gBAAgB,CAAuD;oBAElF,WAAM,GAA0B,EAAE,CAAC;gBADvC,CAAC;gBAEG,IAAI,CAAC,KAA0B;oBACrC,IAAI,iBAAiB,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE;wBAC7D,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;qBACxB;gBACF,CAAC;aACD;YAED,QAAQ,CAAC,iCAAiC,EAAE,GAAG,EAAE;gBAChD,EAAE,CAAC,8CAA8C,EAAE,KAAK,IAAI,EAAE;oBAC7D,yEAAyE;oBACzE,MAAM,MAAM,GAAG,IAAI,kCAAkC,EAAE,CAAC;oBACxD,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,uBAAuB,EAAE,GAAG,oBAAoB,CAAC;wBAC9E,MAAM;wBACN,YAAY,EAAE,IAAI;qBAClB,CAAC,CAAC;oBACH,+BAA+B,CAAC,UAAU,CAAC,CAAC;oBAE5C,eAAe;oBACf,UAAU,CAAC,SAAS,CACnB,GAAG,MAAM,CAAC,UAAU,CACnB,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EACtB,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAChE,CACD,CAAC;oBACF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;oBAC7C,sFAAsF;oBACtF,UAAU,CAAC,SAAS,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;oBACvE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;oBAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;wBAC/B,MAAM,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC;oBAC1C,CAAC,CAAC,CAAC;gBACJ,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,8EAA8E,EAAE,KAAK,IAAI,EAAE;oBAC7F,MAAM,MAAM,GAAG,IAAI,kCAAkC,CACpD,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,CAAC,CACpD,CAAC;oBAEF,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,uBAAuB,EAAE,GAAG,oBAAoB,CAAC;wBAC9E,MAAM;wBACN,YAAY,EAAE,IAAI;qBAClB,CAAC,CAAC;oBACH,+BAA+B,CAAC,UAAU,CAAC,CAAC;oBAE5C,eAAe;oBACf,UAAU,CAAC,SAAS,CACnB,GAAG,MAAM,CAAC,UAAU,CACnB,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EACtB,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAChE,CACD,CAAC;oBACF,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBACvC,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;oBAC7C,sFAAsF;oBACtF,UAAU,CAAC,SAAS,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;oBACvE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBACvC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;oBACpD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,uDAAuD,CAAC,CAAC;gBACpG,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,gCAAgC,EAAE,KAAK,IAAI,EAAE;oBAC/C,MAAM,MAAM,GAAG,IAAI,kCAAkC,CACpD,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,CAAC,CACpD,CAAC;oBACF,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,uBAAuB,EAAE,GAAG,oBAAoB,CAAC;wBAC9E,MAAM;wBACN,YAAY,EAAE,IAAI;qBAClB,CAAC,CAAC;oBACH,MAAM,EAAE,OAAO,EAAE,GAAG,+BAA+B,CAAC,UAAU,CAAC,CAAC;oBAEhE,UAAU,CAAC,SAAS,CACnB,GAAG,MAAM,CAAC,UAAU,CACnB,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EACtB,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAChE,CACD,CAAC;oBACF,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBACvC,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;oBAC7C,UAAU,CAAC,SAAS,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;oBACvE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBACvC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,uDAAuD,CAAC,CAAC;oBAEnG,OAAO,EAAE,CAAC;oBAEV,UAAU,CAAC,SAAS,CACnB,GAAG,MAAM,CAAC,UAAU,CACnB,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EACtB,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAChE,CACD,CAAC;oBACF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;oBAC7C,UAAU,CAAC,SAAS,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;oBACvE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAEvC,+BAA+B,CAAC,UAAU,CAAC,CAAC;oBAE5C,UAAU,CAAC,SAAS,CACnB,GAAG,MAAM,CAAC,UAAU,CACnB,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EACtB,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAChE,CACD,CAAC;oBACF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;oBAC7C,UAAU,CAAC,SAAS,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;oBAEvE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBACvC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,uDAAuD,CAAC,CAAC;gBACpG,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,+BAA+B,EAAE,KAAK,IAAI,EAAE;oBAC9C,MAAM,MAAM,GAAG,IAAI,kCAAkC,CACpD,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,CAAC,CACpD,CAAC;oBACF,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,uBAAuB,EAAE,GAAG,oBAAoB,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;oBAC3F,+BAA+B,CAAC,UAAU,CAAC,CAAC;oBAE5C,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACnG,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;oBAC7C,UAAU,CAAC,SAAS,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;oBACvE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,gCAAgC,EAAE,KAAK,IAAI,EAAE;oBAC/C,MAAM,MAAM,GAAG,IAAI,kCAAkC,CACpD,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,CAAC,CACpD,CAAC;oBACF,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,uBAAuB,EAAE,GAAG,oBAAoB,CAAC;wBACjF,MAAM;wBACN,YAAY,EAAE,IAAI;wBAClB,SAAS,EAAE,KAAK;qBAChB,CAAC,CAAC;oBACH,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,oBAAoB,CAAC;wBAC7E,uBAAuB;wBACvB,EAAE,EAAE,sBAAsB;wBAC1B,SAAS,EAAE,KAAK;qBAChB,CAAC,CAAC;oBACH,+BAA+B,CAAC,WAAW,CAAC,CAAC;oBAE7C,WAAW,CAAC,SAAS,CACpB,GAAG,MAAM,CAAC,UAAU,CACnB,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,EACvB,WAAW,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,cAAc,EAAE,CAAC,CAAC,CAClE,CACD,CAAC;oBACF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;oBAC7C,WAAW,CAAC,SAAS,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;oBACxE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;YACvB,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;gBACnD,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,oBAAoB,EAAE,CAAC;gBAExD,IAAI,UAAU,GAAG,CAAC,CAAC;gBACnB,IAAI,eAAmC,CAAC;gBACxC,UAAU,CAAC,EAAE,CAAC,eAAe,CAAC,aAAa,EAAE,CAAC,IAAiC,EAAE,EAAE;oBAClF,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC;oBACxB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;oBACrC,eAAe,GAAG,IAAI,CAAC,MAAM,CAAC;oBAC9B,UAAU,IAAI,CAAC,CAAC;gBACjB,CAAC,CAAC,CAAC;gBAEH,iBAAiB;gBACjB,MAAM,WAAW,GAAG,UAAU,CAAC,SAAS,CACvC,GAAG,MAAM,CAAC,UAAU,CACnB,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EACtB,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAChE,CACD,CAAC;gBACF,MAAM,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;gBAC/C,MAAM,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAE7B,eAAe;gBACf,MAAM,EAAE,EAAE,EAAE,GAAG,UAAU,CAAC,SAAS,CAClC,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAC5E,CAAC;gBACF,MAAM,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACnC,MAAM,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC9B,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,iDAAiD,EAAE,KAAK,IAAI,EAAE;gBAChE,MAAM,EACL,UAAU,EAAE,WAAW,EACvB,QAAQ,EACR,uBAAuB,GACvB,GAAG,oBAAoB,CAAC;oBACxB,YAAY,EAAE,IAAI;oBAClB,SAAS,EAAE,KAAK;iBAChB,CAAC,CAAC;gBACH,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,mBAAmB,CAAC;oBACjD,uBAAuB;oBACvB,EAAE,EAAE,sBAAsB;oBAC1B,SAAS,EAAE,KAAK;iBAChB,CAAC,CAAC;gBAEH,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAC7C,WAAW,CAAC,SAAS,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;gBAExE,MAAM,SAAS,GAAyC,EAAE,CAAC;gBAC3D,WAAW,CAAC,EAAE,CAAC,eAAe,CAAC,oBAAoB,EAAE,CAAC,IAAwC,EAAE,EAAE,CACjG,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CACpB,CAAC;gBAEF,iBAAiB;gBACjB,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;gBAChE,MAAM,WAAW,GAAG,WAAW,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;gBAClD,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAC7C,WAAW,CAAC,SAAS,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;gBAExE,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACnC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;gBACpD,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC3C,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACzD,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBAE/D,eAAe;gBACf,MAAM,UAAU,GAAG,WAAW,CAAC,SAAS,CACvC,GAAG,MAAM,CAAC,UAAU,CACnB,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EACtB,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CACzD,CACD,CAAC;gBAEF,eAAe;gBACf,MAAM,UAAU,GAAG,WAAW,CAAC,SAAS,CACvC,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAC5E,CAAC;gBACF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAC7C,WAAW,CAAC,SAAS,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;gBAExE,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACnC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;gBACnD,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC5C,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACzD,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBAE/D,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;gBACnD,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC3C,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACzD,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YAChE,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,2DAA2D;QAC3D,IAAI,WAAW,KAAK,WAAW,CAAC,MAAM,EAAE;YACvC,QAAQ,CAAC,uCAAuC,EAAE,GAAG,EAAE;gBACtD,SAAS,wBAAwB,CAAC,IAAgB;oBACjD,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;oBACnC,QAAQ,OAAO,CAAC,OAAO,EAAE;wBACxB,KAAK,WAAW,CAAC,MAAM;4BACtB,OAAO,IAAI,qBAAqB,EAAE,CAAC;wBACpC,KAAK,WAAW,CAAC,MAAM;4BACtB,OAAO,IAAI,qBAAqB,CAAE,OAA6B,CAAC,eAAe,CAAC,CAAC;wBAClF;4BACC,IAAI,CAAC,2BAA2B,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;qBACpD;gBACF,CAAC;gBAED,EAAE,CAAC,sFAAsF,EAAE,GAAG,EAAE;oBAC/F,MAAM,EACL,UAAU,EAAE,IAAI,EAChB,QAAQ,EACR,uBAAuB,GACvB,GAAG,oBAAoB,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC;oBAC1C,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,mBAAmB,CAAC,EAAE,uBAAuB,EAAE,WAAW,EAAE,CAAC,CAAC;oBAC3F,MAAM,aAAa,GAAG,uBAAuB,CAAC,sBAAsB,CACnE,IAAI,yBAAyB,EAAE,CAC/B,CAAC;oBAEF,MAAM,OAAO,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;oBAC9D,IAAI,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAChF,IAAI,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAK7F,MAAM,OAAO,GAAI,aAA8D,CAAC,OAAO,CAAC;oBACxF,MAAM,QAAQ,GAAI,OAAgE,CAAC,QAAQ,CAAC;oBAE5F,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACpC,KAAK,MAAM,OAAO,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;wBACxC,sEAAsE;wBACtE,KAAK,MAAM,MAAM,IAAK,OAAO,CAAC,QAA6B,CAAC,IAAI,CAAC,OAAO,EAAE;4BACzE,IAAI,MAAM,CAAC,IAAI,KAAK,kBAAkB,CAAC,eAAe,EAAE;gCACvD,MAAM,mBAAmB,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;gCAC7D,MAAM,CAAC,mBAAmB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,cAAc,CAAC,cAAc,CAAC,CAAC;6BAC1E;yBACD;qBACD;oBACD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;oBAE5C,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;oBAC7C,MAAM,EAAE,eAAe,EAAE,GAAG,IAAI,CAAC,WAAW,EAAuB,CAAC;oBAEpE,MAAM,GAAG,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;oBACrC,MAAM,IAAI,GAAG,kBAAkB,CAAC,UAAU,CAAC,CAAC;oBAC5C,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;oBAC3F,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;oBACzF,MAAM,WAAW,GAAG,aAAa,CAAC,UAAU,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;oBACnG,MAAM,SAAS,GAAG,aAAa,CAAC,UAAU,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;oBACjG,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;oBAC9C,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;oBAC1C,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;oBAC3C,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,cAAc,CAAC,cAAc,CAAC,CAAC;oBAClE,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;gBACxD,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,sFAAsF,EAAE,GAAG,EAAE;oBAC/F,MAAM,EACL,UAAU,EAAE,IAAI,EAChB,QAAQ,EAAE,QAAQ,EAClB,uBAAuB,GACvB,GAAG,oBAAoB,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC;oBAE1C,MAAM,OAAO,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;oBAC9D,IAAI,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAChF,IAAI,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAE7F,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;oBAE7C,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAuB,CAAC;oBACxD,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;oBACpD,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBAEnD,MAAM,QAAQ,GAAG,IAAI,qBAAqB,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;oBACpE,MAAM,cAAc,GAAG,IAAI,uBAAuB,EAAE,CAAC;oBACrD,MAAM,sBAAsB,GAAG,cAAc,CAAC,QAAQ,CACrD,qBAAqB,CAAC,IAAI,CAAC,WAAW,CAAC,EACvC,QAAQ,EACR,qBAAqB,CAAC,6BAA6B,CAAC,IAAI,CAAC,CAAC,CAC1D,CAAC;oBAEF,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,sBAAsB,CAAC,CAAC;oBAE/D,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,mBAAmB,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC;oBAClE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;oBAC5C,UAAU,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;oBAChC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;gBAC5C,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;SACH;QAED,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;YAC/B,MAAM,qBAAqB,GAAG,CAAC,IAAgB,EAAE,QAAkB,EAAkB,EAAE;gBACtF,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC;gBAC9B,MAAM,MAAM,GAAG,IAAI,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;gBACnD,OAAO,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9C,CAAC,CAAC;YAEF,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;gBACxC,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,oBAAoB,EAAE,CAAC;gBACxD,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,oBAAoB,EAAE,CAAC;gBAChF,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnG,UAAU,CAAC,SAAS,CACnB,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,UAAU,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CACjG,CAAC;gBACF,MAAM,iBAAiB,GAAG,qBAAqB,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;gBACxE,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;gBACpG,qFAAqF;gBACrF,WAAW,CAAC,cAAc,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;gBAC9C,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,UAAU,GAAG,qBAAqB,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;gBACjE,MAAM,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;gBACzE,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACzE,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;gBAC7C,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,oBAAoB,EAAE,CAAC;gBACxD,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,oBAAoB,EAAE,CAAC;gBAChF,wDAAwD;gBACxD,MAAM,aAAa,GAAmC;oBACrD,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU;oBACzB,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU;oBAC9B,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU;iBAC/B,CAAC;gBACF,wEAAwE;gBACxE,MAAM,cAAc,GAAG,IAAI,GAAG,CAC7B,aAAa,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;oBAC7B,UAAU,CAAC,qBAAqB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;oBAClD,WAAW,CAAC,qBAAqB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;iBACpD,CAAC,CACF,CAAC;gBACF,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnG,UAAU,CAAC,SAAS,CACnB,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,UAAU,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CACjG,CAAC;gBACF,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;gBACjG,WAAW,CAAC,cAAc,CAAC,UAAU,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;gBAEpF,MAAM,IAAI,GAAG,qBAAqB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;gBACzD,MAAM,KAAK,GAAG,qBAAqB,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;gBAE5D,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACxD,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAE3D,wCAAwC;gBACxC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClD,0CAA0C;gBAC1C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACxD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YACtE,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from 'assert';\nimport { expect } from 'chai';\nimport { ITelemetryBaseEvent, ITelemetryBaseLogger } from '@fluidframework/core-interfaces';\nimport { ISequencedDocumentMessage, SummaryType } from '@fluidframework/protocol-definitions';\nimport {\n\tMockContainerRuntime,\n\tMockContainerRuntimeFactory,\n\tMockFluidDataStoreRuntime,\n\tvalidateAssertionError,\n} from '@fluidframework/test-runtime-utils';\nimport { assertArrayOfOne, assertNotUndefined, fail, isSharedTreeEvent } from '../../Common.js';\nimport { EditId, NodeId, TraitLabel } from '../../Identifiers.js';\nimport { CachingLogViewer } from '../../LogViewer.js';\nimport { EditLog, OrderedEditSet } from '../../EditLog.js';\nimport { initialTree } from '../../InitialTree.js';\nimport { TreeNodeHandle } from '../../TreeNodeHandle.js';\nimport { deserialize } from '../../SummaryBackCompatibility.js';\nimport { useFailedSequencedEditTelemetry } from '../../MergeHealth.js';\nimport { MutableStringInterner } from '../../StringInterner.js';\nimport { getChangeNodeFromView } from '../../SerializationUtilities.js';\nimport { EditCommittedEventArguments, SequencedEditAppliedEventArguments, SharedTree } from '../../SharedTree.js';\nimport {\n\tChangeInternal,\n\tChangeNode,\n\tChangeNode_0_0_2,\n\tChangeTypeInternal,\n\tEditStatus,\n\tSharedTreeEditOp,\n\tSharedTreeSummary,\n\tSharedTreeSummaryBase,\n\tSharedTreeSummary_0_0_2,\n\tWriteFormat,\n} from '../../persisted-types/index.js';\nimport { SharedTreeEvent } from '../../EventTypes.js';\nimport { BuildNode, Change, ChangeType, StablePlace, StableRange } from '../../ChangeTypes.js';\nimport { convertTreeNodes, deepCompareNodes } from '../../EditUtilities.js';\nimport { serialize, SummaryContents } from '../../Summary.js';\nimport { InterningTreeCompressor } from '../../TreeCompressor.js';\nimport { SharedTreeEncoder_0_0_2, SharedTreeEncoder_0_1_1 } from '../../SharedTreeEncoder.js';\nimport { sequencedIdNormalizer } from '../../NodeIdUtilities.js';\nimport { convertNodeDataIds } from '../../IdConversion.js';\nimport { generateStableId, nilUuid } from '../../UuidUtilities.js';\nimport { buildLeaf, SimpleTestTree, TestTree } from './TestNode.js';\nimport { TestFluidHandle, TestFluidSerializer } from './TestSerializer.js';\nimport { runSharedTreeUndoRedoTestSuite } from './UndoRedoTests.js';\nimport {\n\tareNodesEquivalent,\n\tassertNoDelta,\n\tSharedTreeTestingComponents,\n\tSharedTreeTestingOptions,\n\tsetUpTestTree,\n\ttestTrait,\n\ttestTraitLabel,\n\ttranslateId,\n\tspyOnSubmittedOps,\n\tnormalizeIds,\n\tnormalizeId,\n\tnormalizeEdit,\n\tgetIdNormalizerFromSharedTree,\n\tgetEditLogInternal,\n} from './TestUtilities.js';\n\nfunction revertEditInTree(tree: SharedTree, edit: EditId): EditId | undefined {\n\treturn tree.revert(edit);\n}\n\n// Options for the undo/redo test suite. The undo and redo functions are the same.\nconst undoRedoOptions = {\n\ttitle: 'Revert',\n\tundo: revertEditInTree,\n\tredo: revertEditInTree,\n};\n\n/**\n * Runs a test suite for operations on `SharedTree` writing ops at `writeFormat`.\n * This suite can be used to test other implementations that aim to fulfill `SharedTree`'s contract.\n */\nexport function runSharedTreeOperationsTests(\n\ttitle: string,\n\twriteFormat: WriteFormat,\n\tsetUpTestSharedTreeWithDefaultVersion: (options?: SharedTreeTestingOptions) => SharedTreeTestingComponents\n) {\n\tconst setUpTestSharedTree: typeof setUpTestSharedTreeWithDefaultVersion = (options) =>\n\t\tsetUpTestSharedTreeWithDefaultVersion({ writeFormat, ...options });\n\n\t/**\n\t * Convenience bundling of test components.\n\t * Like {@link SharedTreeTestingComponents}, but contains both the {@link SimpleTestTree} and\n\t * its associated {@link TSharedTree}.\n\t */\n\tinterface SharedTreeTest {\n\t\t/**\n\t\t * {@inheritDoc SharedTreeTestingComponents.tree}\n\t\t */\n\t\tsharedTree: SharedTree;\n\n\t\t/**\n\t\t * {@link SimpleTestTree} corresponding to {@link SharedTreeTest.sharedTree}\n\t\t */\n\t\ttestTree: TestTree;\n\n\t\t/**\n\t\t * {@inheritDoc SharedTreeTestingComponents.componentRuntime}\n\t\t */\n\t\tcomponentRuntime: MockFluidDataStoreRuntime;\n\n\t\t/**\n\t\t * {@inheritDoc SharedTreeTestingComponents.containerRuntimeFactory}\n\t\t */\n\t\tcontainerRuntimeFactory: MockContainerRuntimeFactory;\n\t}\n\n\tfunction createSimpleTestTree(options?: SharedTreeTestingOptions): SharedTreeTest {\n\t\tconst { tree: sharedTree, componentRuntime, containerRuntimeFactory } = setUpTestSharedTree(options);\n\t\tconst testTree = setUpTestTree(sharedTree);\n\t\treturn { sharedTree, testTree, componentRuntime, containerRuntimeFactory };\n\t}\n\n\tdescribe(title, () => {\n\t\tconst testSerializer = new TestFluidSerializer();\n\n\t\tdescribe('SharedTree before initialization', () => {\n\t\t\tit('can create a new SharedTree', () => {\n\t\t\t\tconst { tree } = setUpTestSharedTree();\n\t\t\t\texpect(tree).to.not.be.undefined;\n\t\t\t});\n\n\t\t\tit('valid without initial tree', () => {\n\t\t\t\tconst { tree } = setUpTestSharedTree();\n\t\t\t\texpect(tree.currentView.getTrait(testTrait(tree.currentView))).deep.equals(\n\t\t\t\t\t[],\n\t\t\t\t\t'Root should exist, and child traits should be valid but empty.'\n\t\t\t\t);\n\t\t\t});\n\t\t});\n\n\t\tdescribe('SharedTree in local state', () => {\n\t\t\tit('does not emit change events for each change in a batch of changes', () => {\n\t\t\t\tconst { sharedTree, testTree } = createSimpleTestTree();\n\n\t\t\t\tlet changeCount = 0;\n\t\t\t\tsharedTree.on(SharedTreeEvent.EditCommitted, () => {\n\t\t\t\t\tconst leftTrait = sharedTree.currentView.getTrait(testTree.left.traitLocation);\n\t\t\t\t\tconst rightTrait = sharedTree.currentView.getTrait(testTree.right.traitLocation);\n\n\t\t\t\t\texpect(leftTrait.length).to.equal(0); // \"left\" child is deleted...\n\t\t\t\t\texpect(rightTrait.length).to.equal(2); // ...and added to \"right\" trait\n\n\t\t\t\t\tchangeCount += 1;\n\t\t\t\t});\n\n\t\t\t\tsharedTree.applyEdit(\n\t\t\t\t\t...Change.move(StableRange.only(testTree.left), StablePlace.after(testTree.right))\n\t\t\t\t);\n\t\t\t\texpect(changeCount).equals(1);\n\t\t\t});\n\n\t\t\tit('can insert a wrapped tree', () => {\n\t\t\t\tconst { sharedTree, testTree } = createSimpleTestTree();\n\n\t\t\t\tconst childNode = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\t\tconst childId = 0;\n\t\t\t\tconst childrenTraitLabel = 'children' as TraitLabel;\n\t\t\t\tconst parentNode = {\n\t\t\t\t\tidentifier: testTree.generateNodeId(),\n\t\t\t\t\tdefinition: 'node',\n\t\t\t\t\ttraits: {\n\t\t\t\t\t\t[childrenTraitLabel]: childId,\n\t\t\t\t\t},\n\t\t\t\t};\n\t\t\t\tconst parentId = 1;\n\t\t\t\tconst buildChild = Change.build(childNode, childId);\n\t\t\t\tconst buildParent = Change.build(parentNode, parentId);\n\t\t\t\tconst insertParent = Change.insert(parentId, StablePlace.before(testTree.left));\n\n\t\t\t\tsharedTree.applyEdit(buildChild, buildParent, insertParent);\n\n\t\t\t\tconst leftTrait = sharedTree.currentView.getTrait(testTree.left.traitLocation);\n\t\t\t\texpect(leftTrait.length).to.equal(2);\n\t\t\t\texpect(leftTrait[0]).to.equal(parentNode.identifier);\n\t\t\t\tconst childrenTrait = sharedTree.currentView.getTrait({\n\t\t\t\t\tparent: parentNode.identifier,\n\t\t\t\t\tlabel: childrenTraitLabel,\n\t\t\t\t});\n\t\t\t\texpect(childrenTrait.length).to.equal(1);\n\t\t\t\texpect(childrenTrait[0]).to.equal(childNode.identifier);\n\t\t\t});\n\n\t\t\tit('prevents multi-parenting detached trees', () => {\n\t\t\t\tconst { sharedTree, testTree } = createSimpleTestTree({ allowMalformed: true });\n\n\t\t\t\tconst childNode = testTree.buildLeaf();\n\t\t\t\tconst childId = 0;\n\t\t\t\tconst childrenTraitLabel = 'children';\n\t\t\t\tconst parentNode: BuildNode = {\n\t\t\t\t\tidentifier: testTree.generateNodeId(),\n\t\t\t\t\tdefinition: 'node',\n\t\t\t\t\ttraits: {\n\t\t\t\t\t\t[childrenTraitLabel]: childId,\n\t\t\t\t\t},\n\t\t\t\t};\n\t\t\t\tconst parentNode2: BuildNode = {\n\t\t\t\t\tidentifier: testTree.generateNodeId(),\n\t\t\t\t\tdefinition: 'node',\n\t\t\t\t\ttraits: {\n\t\t\t\t\t\t[childrenTraitLabel]: childId,\n\t\t\t\t\t},\n\t\t\t\t};\n\n\t\t\t\tconst buildChild = Change.build(childNode, childId);\n\t\t\t\tconst buildParent = Change.build(parentNode, 1);\n\t\t\t\tconst buildParent2 = Change.build(parentNode2, 2);\n\n\t\t\t\tassertNoDelta(sharedTree, () => {\n\t\t\t\t\t// we don't expect this edit application to change anything\n\t\t\t\t\tsharedTree.applyEdit(buildChild, buildParent, buildParent2);\n\t\t\t\t});\n\t\t\t});\n\n\t\t\t// TODO:#58052: Make this test pass.\n\t\t\tit.skip('prevents setting the value of a node in a detached subtree', () => {\n\t\t\t\tconst { sharedTree, testTree } = createSimpleTestTree({ allowInvalid: true });\n\n\t\t\t\tconst detachedNode = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\t\tconst detachedSequenceId = 0;\n\t\t\t\tconst { id } = sharedTree.applyEdit(\n\t\t\t\t\tChange.build(detachedNode, detachedSequenceId),\n\t\t\t\t\tChange.setPayload(detachedNode.identifier, 42),\n\t\t\t\t\tChange.insert(detachedSequenceId, StablePlace.before(testTree.left))\n\t\t\t\t);\n\t\t\t\tconst logViewer = sharedTree.logViewer as CachingLogViewer;\n\t\t\t\texpect(logViewer.getEditResultInMemory(logViewer.log.getIndexOfId(id)).status).equals(\n\t\t\t\t\tEditStatus.Invalid\n\t\t\t\t);\n\t\t\t\tsharedTree.currentView.assertConsistent();\n\t\t\t});\n\n\t\t\t// TODO:#58052: Make this test pass.\n\t\t\tit.skip('prevents inserting a node in a detached subtree through a local edit', () => {\n\t\t\t\tconst { sharedTree, testTree } = createSimpleTestTree({ allowInvalid: true });\n\n\t\t\t\tconst detachedNewNode = testTree.buildLeaf();\n\t\t\t\tconst detachedNewNodeSequenceId = 0;\n\t\t\t\tconst detachedRightNodeSequenceId = 1;\n\t\t\t\tconst { id } = sharedTree.applyEdit(\n\t\t\t\t\tChange.build(detachedNewNode, detachedNewNodeSequenceId),\n\t\t\t\t\tChange.detach(StableRange.only(testTree.right), detachedRightNodeSequenceId),\n\t\t\t\t\t// This change attempts to insert a node under a detached node\n\t\t\t\t\tChange.insert(\n\t\t\t\t\t\tdetachedNewNodeSequenceId,\n\t\t\t\t\t\tStablePlace.atStartOf({ parent: testTree.right.identifier, label: 'foo' as TraitLabel })\n\t\t\t\t\t),\n\t\t\t\t\tChange.insert(detachedRightNodeSequenceId, StablePlace.before(testTree.left))\n\t\t\t\t);\n\t\t\t\tconst logViewer = sharedTree.logViewer as CachingLogViewer;\n\t\t\t\texpect(logViewer.getEditResultInMemory(logViewer.log.getIndexOfId(id)).status).equals(\n\t\t\t\t\tEditStatus.Invalid\n\t\t\t\t);\n\t\t\t\tsharedTree.currentView.assertConsistent();\n\t\t\t});\n\n\t\t\tit('prevents deletion of the root', () => {\n\t\t\t\tconst { sharedTree } = createSimpleTestTree({ allowInvalid: true });\n\t\t\t\tconst rootId = sharedTree.convertToNodeId(initialTree.identifier);\n\t\t\t\texpect(sharedTree.currentView.hasNode(rootId));\n\t\t\t\tassertNoDelta(sharedTree, () => {\n\t\t\t\t\t// Try to delete the root\n\t\t\t\t\tsharedTree.applyEdit(Change.delete(StableRange.only(rootId)));\n\t\t\t\t});\n\t\t\t});\n\n\t\t\tit('can apply multiple local edits without ack from server', () => {\n\t\t\t\tconst { sharedTree, testTree } = createSimpleTestTree();\n\n\t\t\t\tconst newNode = testTree.buildLeaf(testTree.generateNodeId());\n\n\t\t\t\tsharedTree.applyEdit(...Change.insertTree(newNode, StablePlace.after(testTree.left)));\n\t\t\t\tsharedTree.applyEdit(...Change.move(StableRange.only(newNode), StablePlace.before(testTree.left)));\n\n\t\t\t\tconst leftTrait = sharedTree.currentView.getTrait(testTree.left.traitLocation);\n\t\t\t\texpect(leftTrait.length).equals(2);\n\t\t\t\texpect(leftTrait[0]).equals(newNode.identifier);\n\t\t\t});\n\n\t\t\tit('is not equal to a tree with different current views', () => {\n\t\t\t\tconst { sharedTree: sharedTree1 } = createSimpleTestTree();\n\t\t\t\tconst { tree: sharedTree2 } = setUpTestSharedTree();\n\t\t\t\texpect(sharedTree1.equals(sharedTree2)).to.be.false;\n\t\t\t});\n\n\t\t\tit('is not equal to a tree with the same current view but different edit logs', () => {\n\t\t\t\tconst { sharedTree: sharedTree1 } = createSimpleTestTree();\n\t\t\t\tconst { sharedTree: sharedTree2 } = createSimpleTestTree();\n\n\t\t\t\t// The edits that create the initial tree have different identities.\n\t\t\t\texpect(sharedTree1.equals(sharedTree2)).to.be.false;\n\t\t\t});\n\n\t\t\tit('tolerates invalid inserts', () => {\n\t\t\t\tconst { sharedTree, testTree } = createSimpleTestTree({ allowInvalid: true });\n\n\t\t\t\tconst firstNode = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\t\tconst secondNode = testTree.buildLeaf(testTree.generateNodeId());\n\n\t\t\t\tsharedTree.applyEdit(...Change.insertTree(firstNode, StablePlace.after(testTree.left)));\n\t\t\t\tsharedTree.applyEdit(Change.delete(StableRange.only(firstNode)));\n\n\t\t\t\t// Trying to insert next to the deleted node should drop, confirm that it doesn't\n\t\t\t\t// change the view\n\t\t\t\tassertNoDelta(sharedTree, () => {\n\t\t\t\t\tsharedTree.applyEdit(...Change.insertTree(secondNode, StablePlace.after(firstNode)));\n\t\t\t\t});\n\n\t\t\t\tconst leftTrait = sharedTree.currentView.getTrait(testTree.left.traitLocation);\n\t\t\t\texpect(leftTrait.length).to.equal(1);\n\t\t\t});\n\n\t\t\tit('tolerates invalid detaches', () => {\n\t\t\t\tconst { sharedTree, testTree } = createSimpleTestTree({ allowInvalid: true });\n\n\t\t\t\tconst firstNode = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\t\tconst secondNode = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\t\tconst thirdNode = testTree.buildLeaf(testTree.generateNodeId());\n\n\t\t\t\tsharedTree.applyEdit(\n\t\t\t\t\t...Change.insertTree([firstNode, secondNode, thirdNode], StablePlace.after(testTree.left))\n\t\t\t\t);\n\t\t\t\tsharedTree.applyEdit(Change.delete(StableRange.only(secondNode)));\n\n\t\t\t\tassertNoDelta(sharedTree, () => {\n\t\t\t\t\t// Trying to delete from before firstNode to after secondNode should drop\n\t\t\t\t\tsharedTree.applyEdit(\n\t\t\t\t\t\tChange.delete(StableRange.from(StablePlace.before(firstNode)).to(StablePlace.after(secondNode)))\n\t\t\t\t\t);\n\n\t\t\t\t\t// Trying to delete from after thirdNode to before firstNode should drop\n\t\t\t\t\tsharedTree.applyEdit(\n\t\t\t\t\t\tChange.delete(StableRange.from(StablePlace.after(thirdNode)).to(StablePlace.before(firstNode)))\n\t\t\t\t\t);\n\t\t\t\t});\n\n\t\t\t\t// Expect that firstNode did not get deleted\n\t\t\t\tconst leftTrait = sharedTree.currentView.getTrait(testTree.left.traitLocation);\n\t\t\t\texpect(leftTrait.length).to.equal(3);\n\t\t\t});\n\n\t\t\tit('tolerates malformed inserts', () => {\n\t\t\t\tconst { sharedTree } = createSimpleTestTree({ allowMalformed: true });\n\n\t\t\t\tassertNoDelta(sharedTree, () => {\n\t\t\t\t\tsharedTree.applyEdit(Change.build([], 0));\n\t\t\t\t});\n\t\t\t});\n\n\t\t\tit('correctly reports attribution ID', () => {\n\t\t\t\tconst attributionId = generateStableId();\n\t\t\t\tconst { tree } = setUpTestSharedTree({ attributionId });\n\t\t\t\texpect(tree.attributionId).to.equal(writeFormat === WriteFormat.v0_0_2 ? nilUuid : attributionId);\n\t\t\t});\n\n\t\t\tit('correctly attributes node IDs', () => {\n\t\t\t\tconst attributionId = generateStableId();\n\t\t\t\tconst { tree } = setUpTestSharedTree({ attributionId });\n\t\t\t\tconst id = tree.generateNodeId();\n\t\t\t\texpect(tree.attributeNodeId(id)).to.equal(writeFormat === WriteFormat.v0_0_2 ? nilUuid : attributionId);\n\t\t\t});\n\n\t\t\trunSharedTreeUndoRedoTestSuite({ localMode: true, ...undoRedoOptions });\n\t\t});\n\n\t\tdescribe('SharedTree in connected state with a remote SharedTree', () => {\n\t\t\t/**\n\t\t\t * Initial tree options for multi-tree tests below.\n\t\t\t * Intended to be passed to {@link createSimpleTestTree}.\n\t\t\t */\n\t\t\tconst tree1Options = { localMode: false };\n\n\t\t\t/**\n\t\t\t * Secondary tree options derived from some initial tree.\n\t\t\t */\n\t\t\tfunction createSecondTreeOptions(\n\t\t\t\tcontainerRuntimeFactory: MockContainerRuntimeFactory\n\t\t\t): SharedTreeTestingOptions {\n\t\t\t\treturn {\n\t\t\t\t\tcontainerRuntimeFactory,\n\t\t\t\t\tid: 'secondTestSharedTree',\n\t\t\t\t\tlocalMode: false,\n\t\t\t\t};\n\t\t\t}\n\n\t\t\tif (writeFormat === WriteFormat.v0_0_2) {\n\t\t\t\tit('applies unversioned ops in the 0.0.2 format', () => {\n\t\t\t\t\tconst { tree: sharedTree1, containerRuntimeFactory } = setUpTestSharedTree(tree1Options);\n\t\t\t\t\tconst { sharedTree: sharedTree2, testTree: testTree2 } = createSimpleTestTree(\n\t\t\t\t\t\tcreateSecondTreeOptions(containerRuntimeFactory)\n\t\t\t\t\t);\n\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t\tconst originalPushMessage = containerRuntimeFactory.pushMessage.bind(containerRuntimeFactory);\n\t\t\t\t\tcontainerRuntimeFactory.pushMessage = (msg) => {\n\t\t\t\t\t\t// Drop the version property to replicate ops created before the version property existed\n\t\t\t\t\t\t(msg.contents as { version?: unknown }).version = undefined;\n\t\t\t\t\t\toriginalPushMessage(msg);\n\t\t\t\t\t};\n\n\t\t\t\t\t// Ensure that an edit can be passed and processed between two trees as normal\n\t\t\t\t\tsharedTree2.applyEdit(Change.delete(StableRange.only(testTree2.right)));\n\n\t\t\t\t\tconst getTestTreeRoot = (sharedTree: SharedTree) =>\n\t\t\t\t\t\tnew TreeNodeHandle(\n\t\t\t\t\t\t\tsharedTree.currentView,\n\t\t\t\t\t\t\tsharedTree.convertToNodeId(sharedTree2.convertToStableNodeId(testTree2.identifier))\n\t\t\t\t\t\t);\n\n\t\t\t\t\tlet root1 = getTestTreeRoot(sharedTree1);\n\t\t\t\t\tlet root2 = getTestTreeRoot(sharedTree2);\n\n\t\t\t\t\texpect(Array.from(root1.traits[testTree2.right.traitLabel])).to.have.length(1);\n\t\t\t\t\texpect(Array.from(root2.traits[testTree2.right.traitLabel] ?? [])).to.have.length(0);\n\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t\t\t\troot1 = getTestTreeRoot(sharedTree1);\n\t\t\t\t\troot2 = getTestTreeRoot(sharedTree2);\n\t\t\t\t\texpect(Array.from(root1.traits[testTree2.right.traitLabel] ?? [])).to.have.length(0);\n\t\t\t\t\texpect(Array.from(root2.traits[testTree2.right.traitLabel] ?? [])).to.have.length(0);\n\t\t\t\t});\n\t\t\t}\n\n\t\t\tit('should apply remote changes and converge', () => {\n\t\t\t\tconst { tree: sharedTree1, containerRuntimeFactory } = setUpTestSharedTree(tree1Options);\n\t\t\t\tconst { tree: sharedTree2 } = setUpTestSharedTree(createSecondTreeOptions(containerRuntimeFactory));\n\n\t\t\t\tconst newNodeId1 = sharedTree1.generateNodeId();\n\t\t\t\tsharedTree1.applyEdit(\n\t\t\t\t\t...Change.insertTree(\n\t\t\t\t\t\t[buildLeaf(newNodeId1)],\n\t\t\t\t\t\tStablePlace.atStartOf(testTrait(sharedTree1.currentView))\n\t\t\t\t\t)\n\t\t\t\t);\n\n\t\t\t\t// Sync initial tree\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t\t\tconst newNodeId2 = translateId(newNodeId1, sharedTree1, sharedTree2);\n\n\t\t\t\t// Both trees should contain 'left'\n\t\t\t\texpect(sharedTree1.currentView.getViewNode(newNodeId1)).to.not.be.undefined;\n\t\t\t\texpect(sharedTree2.currentView.getViewNode(newNodeId2)).to.not.be.undefined;\n\n\t\t\t\tsharedTree2.applyEdit(Change.delete(StableRange.only(newNodeId2)));\n\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t\t\tconst rootA = sharedTree1.currentView.getViewNode(sharedTree1.currentView.root);\n\t\t\t\texpect(rootA.traits.get(testTraitLabel)).to.be.undefined;\n\n\t\t\t\tconst rootB = sharedTree2.currentView.getViewNode(sharedTree2.currentView.root);\n\t\t\t\texpect(rootB.traits.get(testTraitLabel)).to.be.undefined;\n\t\t\t});\n\n\t\t\tit('converges in the face of concurrent changes', () => {\n\t\t\t\tconst { tree: sharedTree1, containerRuntimeFactory } = setUpTestSharedTree(tree1Options);\n\t\t\t\tconst { sharedTree: sharedTree2 } = createSimpleTestTree(\n\t\t\t\t\tcreateSecondTreeOptions(containerRuntimeFactory)\n\t\t\t\t);\n\n\t\t\t\tconst newNodeId1 = sharedTree1.generateNodeId();\n\t\t\t\tsharedTree1.applyEdit(\n\t\t\t\t\t...Change.insertTree(\n\t\t\t\t\t\t[buildLeaf(newNodeId1)],\n\t\t\t\t\t\tStablePlace.atStartOf(testTrait(sharedTree1.currentView))\n\t\t\t\t\t)\n\t\t\t\t);\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t\t\t// First client deletes a trait containing a node in the initial tree\n\t\t\t\tsharedTree1.applyEdit(Change.delete(StableRange.all(testTrait(sharedTree1.currentView))));\n\n\t\t\t\t// Second client concurrently adds a new node to that trait\n\t\t\t\tconst newNodeId2 = sharedTree2.generateNodeId();\n\t\t\t\tsharedTree2.applyEdit(\n\t\t\t\t\t...Change.insertTree(\n\t\t\t\t\t\t[buildLeaf(newNodeId2)],\n\t\t\t\t\t\tStablePlace.atStartOf(testTrait(sharedTree2.currentView))\n\t\t\t\t\t)\n\t\t\t\t);\n\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t\t\t// Second client's change gets sequenced after the deletion, so the trait\n\t\t\t\t// should exist and contain the second new node on both clients after messages are delivered.\n\t\t\t\tconst leftTrait = normalizeIds(\n\t\t\t\t\tsharedTree1,\n\t\t\t\t\t...sharedTree1.currentView.getTrait(testTrait(sharedTree1.currentView))\n\t\t\t\t);\n\t\t\t\tconst secondLeftTrait = normalizeIds(\n\t\t\t\t\tsharedTree2,\n\t\t\t\t\t...sharedTree2.currentView.getTrait(testTrait(sharedTree2.currentView))\n\t\t\t\t);\n\t\t\t\texpect(leftTrait.length).equals(1);\n\t\t\t\texpect(leftTrait[0]).equals(normalizeId(sharedTree2, newNodeId2));\n\t\t\t\texpect(leftTrait).deep.equals(secondLeftTrait);\n\t\t\t});\n\n\t\t\tit('is equal to a tree with the same state', () => {\n\t\t\t\tconst { tree: sharedTree1, containerRuntimeFactory } = setUpTestSharedTree(tree1Options);\n\t\t\t\tconst { tree: sharedTree2 } = setUpTestSharedTree(createSecondTreeOptions(containerRuntimeFactory));\n\t\t\t\tconst newNodeId1 = sharedTree1.generateNodeId();\n\t\t\t\tsharedTree1.applyEdit(\n\t\t\t\t\t...Change.insertTree(\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tidentifier: newNodeId1,\n\t\t\t\t\t\t\t\tdefinition: 'foo',\n\t\t\t\t\t\t\t\ttraits: { left: buildLeaf(), right: buildLeaf() },\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t\tStablePlace.atStartOf(testTrait(sharedTree1.currentView))\n\t\t\t\t\t)\n\t\t\t\t);\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\texpect(sharedTree1.equals(sharedTree2)).to.be.true;\n\t\t\t\tsharedTree2.applyEdit(\n\t\t\t\t\tChange.delete(StableRange.only(translateId(newNodeId1, sharedTree1, sharedTree2)))\n\t\t\t\t);\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\texpect(sharedTree1.equals(sharedTree2)).to.be.true;\n\t\t\t});\n\n\t\t\t// TODO:#58052: Make this test pass.\n\t\t\tit.skip('prevents inserting a node in a detached subtree as the result of merged edits', () => {\n\t\t\t\tconst { testTree } = createSimpleTestTree();\n\n\t\t\t\tconst rootNode = testTree.buildLeaf(testTree.generateNodeId());\n\n\t\t\t\tconst parent1Node = testTree.buildLeaf(testTree.generateNodeId());\n\n\t\t\t\tconst parent2Node = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\t\tconst parent2Id = parent2Node.identifier;\n\n\t\t\t\tconst childNode = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\t\tconst childId = childNode.identifier;\n\n\t\t\t\tconst initialTree = {\n\t\t\t\t\t...rootNode,\n\t\t\t\t\ttraits: {\n\t\t\t\t\t\tparents: [\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t...parent1Node,\n\t\t\t\t\t\t\t\ttraits: { child: childNode },\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tparent2Node,\n\t\t\t\t\t\t],\n\t\t\t\t\t},\n\t\t\t\t};\n\n\t\t\t\tconst childTraitUnderParent2 = { parent: parent2Id, label: 'child' as TraitLabel };\n\t\t\t\tconst badTraitUnderChild = { parent: childId, label: 'whatever' as TraitLabel };\n\n\t\t\t\tconst { tree: sharedTree1, containerRuntimeFactory } = setUpTestSharedTree({\n\t\t\t\t\t...tree1Options,\n\t\t\t\t\tinitialTree,\n\t\t\t\t\tallowInvalid: true,\n\t\t\t\t});\n\t\t\t\tconst { tree: sharedTree2 } = setUpTestSharedTree({\n\t\t\t\t\t...createSecondTreeOptions(containerRuntimeFactory),\n\t\t\t\t\tallowInvalid: true,\n\t\t\t\t});\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t\t\t// Move the child under parent2\n\t\t\t\t// This first edit should succeed locally and globally\n\t\t\t\tconst edit1 = sharedTree1.applyEdit(\n\t\t\t\t\t...Change.move(StableRange.only(childId), StablePlace.atStartOf(childTraitUnderParent2))\n\t\t\t\t);\n\n\t\t\t\t// Concurrently move parent2 under child\n\t\t\t\t// This first edit should succeed locally but fail globally\n\t\t\t\tconst edit2 = sharedTree2.applyEdit(\n\t\t\t\t\t...Change.move(StableRange.only(parent2Id), StablePlace.atStartOf(badTraitUnderChild))\n\t\t\t\t);\n\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\tconst logViewer = sharedTree1.logViewer as CachingLogViewer;\n\t\t\t\texpect(logViewer.getEditResultInMemory(logViewer.log.getIndexOfId(edit1.id)).status).equals(\n\t\t\t\t\tEditStatus.Applied\n\t\t\t\t);\n\t\t\t\texpect(logViewer.getEditResultInMemory(logViewer.log.getIndexOfId(edit2.id)).status).equals(\n\t\t\t\t\tEditStatus.Invalid\n\t\t\t\t);\n\t\t\t\tsharedTree1.currentView.assertConsistent();\n\t\t\t});\n\n\t\t\tit('tolerates invalid inserts', () => {\n\t\t\t\tconst { tree: sharedTree1, containerRuntimeFactory } = setUpTestSharedTree({\n\t\t\t\t\t...tree1Options,\n\t\t\t\t\tallowInvalid: true,\n\t\t\t\t});\n\t\t\t\tconst { tree: sharedTree2 } = setUpTestSharedTree({\n\t\t\t\t\t...createSecondTreeOptions(containerRuntimeFactory),\n\t\t\t\t\tallowInvalid: true,\n\t\t\t\t});\n\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t\t\tconst firstNode2 = buildLeaf(sharedTree2.generateNodeId());\n\t\t\t\tconst firstEdit = sharedTree2.applyEdit(\n\t\t\t\t\t...Change.insertTree(firstNode2, StablePlace.atStartOf(testTrait(sharedTree2.currentView)))\n\t\t\t\t);\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t\t\t// Concurrently edit, creating invalid insert.\n\t\t\t\t// Create delete. This will apply.\n\t\t\t\tconst secondEdit = sharedTree1.applyEdit(\n\t\t\t\t\tChange.delete(StableRange.only(translateId(firstNode2, sharedTree2, sharedTree1)))\n\t\t\t\t);\n\n\t\t\t\tlet thirdEdit;\n\t\t\t\tassertNoDelta(sharedTree1, () => {\n\t\t\t\t\t// concurrently insert next to the deleted node: this will become invalid.\n\t\t\t\t\tconst secondNode2 = buildLeaf();\n\t\t\t\t\tthirdEdit = sharedTree2.applyEdit(...Change.insertTree(secondNode2, StablePlace.after(firstNode2)));\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t});\n\n\t\t\t\tconst leftTrait = sharedTree2.currentView.getTrait(testTrait(sharedTree2.currentView));\n\t\t\t\texpect(leftTrait.length).to.equal(0);\n\n\t\t\t\tconst editIds = sharedTree1.edits.editIds;\n\n\t\t\t\texpect(editIds[0]).is.equal(firstEdit.id);\n\t\t\t\texpect(editIds[1]).is.equal(secondEdit.id);\n\t\t\t\texpect(editIds[2]).is.equal(thirdEdit.id);\n\t\t\t});\n\n\t\t\tit('tolerates invalid detaches', () => {\n\t\t\t\tconst { tree: sharedTree1, containerRuntimeFactory } = setUpTestSharedTree({\n\t\t\t\t\t...tree1Options,\n\t\t\t\t\tallowInvalid: true,\n\t\t\t\t});\n\t\t\t\tconst { tree: sharedTree2 } = setUpTestSharedTree(createSecondTreeOptions(containerRuntimeFactory));\n\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t\t\tconst firstNode2 = buildLeaf(sharedTree2.generateNodeId());\n\t\t\t\tconst secondNode2 = buildLeaf(sharedTree2.generateNodeId());\n\t\t\t\tconst thirdNode = buildLeaf();\n\t\t\t\tconst firstEdit = sharedTree2.applyEdit(\n\t\t\t\t\t...Change.insertTree(\n\t\t\t\t\t\t[firstNode2, secondNode2, thirdNode],\n\t\t\t\t\t\tStablePlace.atStartOf(testTrait(sharedTree2.currentView))\n\t\t\t\t\t)\n\t\t\t\t);\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t\t\t// Create delete. This will apply.\n\t\t\t\tconst secondEdit = sharedTree1.applyEdit(\n\t\t\t\t\tChange.delete(StableRange.only(translateId(secondNode2, sharedTree2, sharedTree1)))\n\t\t\t\t);\n\n\t\t\t\t// concurrently delete from before firstNode to after secondNode: this should become invalid\n\t\t\t\tconst thirdEdit = sharedTree2.applyEdit(\n\t\t\t\t\tChange.delete(StableRange.from(StablePlace.before(firstNode2)).to(StablePlace.after(secondNode2)))\n\t\t\t\t);\n\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t\t\t// Expect that firstNode did not get deleted\n\t\t\t\tconst leftTrait = sharedTree1.currentView.getTrait(testTrait(sharedTree1.currentView));\n\t\t\t\texpect(leftTrait.length).to.equal(2);\n\n\t\t\t\tconst editIds = sharedTree1.edits.editIds;\n\t\t\t\texpect(editIds[0]).to.equal(firstEdit.id);\n\t\t\t\texpect(editIds[1]).to.equal(secondEdit.id);\n\t\t\t\texpect(editIds[2]).to.equal(thirdEdit.id);\n\t\t\t});\n\n\t\t\tit('tolerates malformed inserts', () => {\n\t\t\t\tconst { sharedTree: sharedTree1, containerRuntimeFactory } = createSimpleTestTree({\n\t\t\t\t\t...tree1Options,\n\t\t\t\t\tallowMalformed: true,\n\t\t\t\t});\n\t\t\t\tconst { tree: sharedTree2 } = setUpTestSharedTree(createSecondTreeOptions(containerRuntimeFactory));\n\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t\t\tlet editId!: EditId;\n\t\t\t\tassertNoDelta(sharedTree1, () => {\n\t\t\t\t\tconst build = Change.build([], 0);\n\t\t\t\t\teditId = sharedTree2.applyEdit(build).id;\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t});\n\n\t\t\t\t// Edit 0 creates initial tree\n\t\t\t\texpect(sharedTree1.edits.getIdAtIndex(1)).to.equal(editId);\n\t\t\t});\n\n\t\t\trunSharedTreeUndoRedoTestSuite({ localMode: false, ...undoRedoOptions });\n\n\t\t\t// This is a regression test for documents corrupted by the following github issue:\n\t\t\t// https://github.com/microsoft/FluidFramework/issues/4399\n\t\t\tit('tolerates duplicate edits in trailing operations', () => {\n\t\t\t\tconst { sharedTree: sharedTree1, containerRuntimeFactory } = createSimpleTestTree(tree1Options);\n\t\t\t\tconst remoteRuntime = containerRuntimeFactory.createContainerRuntime(new MockFluidDataStoreRuntime());\n\t\t\t\tconst ops = spyOnSubmittedOps(containerRuntimeFactory);\n\t\t\t\tconst initialEditCount = sharedTree1.edits.length;\n\t\t\t\tsharedTree1.applyEdit(Change.setPayload(sharedTree1.currentView.root, 42));\n\t\t\t\tremoteRuntime.submit(ops[0], /* localOpMetadata */ undefined);\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\texpect(sharedTree1.edits.length).to.equal(initialEditCount + 1);\n\t\t\t});\n\n\t\t\tit('detects concurrent duplicate IDs', () => {\n\t\t\t\tconst { tree: sharedTree1, containerRuntimeFactory } = setUpTestSharedTree({\n\t\t\t\t\t...tree1Options,\n\t\t\t\t\tallowInvalid: true,\n\t\t\t\t});\n\t\t\t\tconst { tree: sharedTree2 } = setUpTestSharedTree({\n\t\t\t\t\t...createSecondTreeOptions(containerRuntimeFactory),\n\t\t\t\t\tallowInvalid: true,\n\t\t\t\t});\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t\t\tconst duplicateId = 'duplicate';\n\t\t\t\tsharedTree1.applyEdit(\n\t\t\t\t\t...Change.insertTree(\n\t\t\t\t\t\t[buildLeaf(sharedTree1.generateNodeId(duplicateId))],\n\t\t\t\t\t\tStablePlace.atEndOf(testTrait(sharedTree1.currentView))\n\t\t\t\t\t)\n\t\t\t\t);\n\t\t\t\tsharedTree2.applyEdit(\n\t\t\t\t\t...Change.insertTree(\n\t\t\t\t\t\t[buildLeaf(sharedTree2.generateNodeId(duplicateId))],\n\t\t\t\t\t\tStablePlace.atEndOf(testTrait(sharedTree2.currentView))\n\t\t\t\t\t)\n\t\t\t\t);\n\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\texpect(sharedTree1.currentView.size).to.equal(2);\n\t\t\t\tconst trait1 = sharedTree1.currentView.getTrait(testTrait(sharedTree1.currentView));\n\t\t\t\texpect(trait1.length).to.equal(1);\n\t\t\t\texpect(sharedTree1.convertToStableNodeId(trait1[0])).to.equal(duplicateId);\n\t\t\t\texpect(sharedTree1.equals(sharedTree2));\n\t\t\t});\n\n\t\t\tif (writeFormat !== WriteFormat.v0_0_2) {\n\t\t\t\tit('can exchange attribution IDs', () => {\n\t\t\t\t\tconst attributionId1 = generateStableId();\n\t\t\t\t\tconst { tree: sharedTree1, containerRuntimeFactory } = setUpTestSharedTree({\n\t\t\t\t\t\t...tree1Options,\n\t\t\t\t\t\tattributionId: attributionId1,\n\t\t\t\t\t});\n\t\t\t\t\tconst attributionId2 = generateStableId();\n\t\t\t\t\tconst { tree: sharedTree2 } = setUpTestSharedTree({\n\t\t\t\t\t\t...createSecondTreeOptions(containerRuntimeFactory),\n\t\t\t\t\t\tattributionId: attributionId2,\n\t\t\t\t\t});\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t\t\t\tconst nodeId1 = sharedTree1.generateNodeId();\n\t\t\t\t\tconst stableNodeId1 = sharedTree1.convertToStableNodeId(nodeId1);\n\t\t\t\t\tsharedTree1.applyEdit(\n\t\t\t\t\t\t...Change.insertTree(\n\t\t\t\t\t\t\t[buildLeaf(nodeId1)],\n\t\t\t\t\t\t\tStablePlace.atEndOf(testTrait(sharedTree1.currentView))\n\t\t\t\t\t\t)\n\t\t\t\t\t);\n\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t\texpect(sharedTree2.attributeNodeId(sharedTree2.convertToNodeId(stableNodeId1))).to.equal(\n\t\t\t\t\t\tattributionId1\n\t\t\t\t\t);\n\n\t\t\t\t\tconst nodeId2 = sharedTree2.generateNodeId();\n\t\t\t\t\tconst stableNodeId2 = sharedTree2.convertToStableNodeId(nodeId1);\n\t\t\t\t\tsharedTree2.applyEdit(\n\t\t\t\t\t\t...Change.insertTree(\n\t\t\t\t\t\t\t[buildLeaf(nodeId2)],\n\t\t\t\t\t\t\tStablePlace.atEndOf(testTrait(sharedTree2.currentView))\n\t\t\t\t\t\t)\n\t\t\t\t\t);\n\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t\texpect(sharedTree1.attributeNodeId(sharedTree1.convertToNodeId(stableNodeId2))).to.equal(\n\t\t\t\t\t\tattributionId2\n\t\t\t\t\t);\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\n\t\tdescribe('SharedTree summarizing', () => {\n\t\t\tconst testHandle = new TestFluidHandle();\n\n\t\t\tit('throws error when given bad json input', () => {\n\t\t\t\tassert.throws(() => deserialize('', testSerializer));\n\t\t\t\tassert.throws(() => deserialize('~ malformed JSON ~', testSerializer));\n\t\t\t\tassert.throws(() => deserialize('{ unrecognizedKey: 42 }', testSerializer));\n\t\t\t});\n\n\t\t\tit('correctly handles snapshots of default trees', () => {\n\t\t\t\tconst { tree: uninitializedTree } = setUpTestSharedTree();\n\n\t\t\t\t// Serialize the state of one uninitialized tree into a second tree\n\t\t\t\tconst serialized = serialize(uninitializedTree.saveSummary(), testSerializer, testHandle);\n\t\t\t\tconst parsedTree = deserialize(serialized, testSerializer);\n\t\t\t\tif (writeFormat === WriteFormat.v0_0_2) {\n\t\t\t\t\tconst summary = parsedTree as SharedTreeSummary_0_0_2;\n\t\t\t\t\texpect(summary.sequencedEdits).to.deep.equal([]);\n\t\t\t\t\texpect(deepCompareNodes(summary.currentTree, initialTree)).to.be.true;\n\t\t\t\t} else {\n\t\t\t\t\tconst summary = parsedTree as SharedTreeSummary;\n\t\t\t\t\texpect(summary.editHistory).to.deep.equal({ editChunks: [], editIds: [] });\n\t\t\t\t\texpect(summary.currentTree).to.be.instanceOf(Array);\n\t\t\t\t\texpect(summary.internedStrings).to.have.length(1);\n\t\t\t\t}\n\t\t\t});\n\n\t\t\t[true, false].forEach((hasLocalEdits) => {\n\t\t\t\tit(`produces correct snapshot for a tree with ${hasLocalEdits ? 'local' : 'acked'} edits`, async () => {\n\t\t\t\t\t// The initial tree results in an edit.\n\t\t\t\t\tconst { sharedTree, testTree, containerRuntimeFactory } = createSimpleTestTree({\n\t\t\t\t\t\tlocalMode: hasLocalEdits,\n\t\t\t\t\t});\n\n\t\t\t\t\tconst newNode = testTree.buildLeaf();\n\t\t\t\t\tsharedTree.applyEdit(...Change.insertTree(newNode, StablePlace.before(testTree.left)));\n\t\t\t\t\tlet serialized: string;\n\t\t\t\t\tif (hasLocalEdits) {\n\t\t\t\t\t\tconst { summary } = sharedTree.getAttachSummary();\n\t\t\t\t\t\tassert.equal(summary.type, SummaryType.Tree, 'Summary type should be Tree');\n\t\t\t\t\t\tassert.equal(summary.tree.header.type, SummaryType.Blob, 'Summary should contain header blob');\n\t\t\t\t\t\tserialized = summary.tree.header.content as string;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t\t\tserialized = serialize(sharedTree.saveSummary(), testSerializer, testHandle);\n\t\t\t\t\t}\n\n\t\t\t\t\tconst treeContent: SharedTreeSummaryBase = JSON.parse(serialized);\n\t\t\t\t\tconst parsedTree: SummaryContents =\n\t\t\t\t\t\twriteFormat === WriteFormat.v0_1_1\n\t\t\t\t\t\t\t? new SharedTreeEncoder_0_1_1(true).decodeSummary(\n\t\t\t\t\t\t\t\t\ttreeContent as SharedTreeSummary,\n\t\t\t\t\t\t\t\t\tsharedTree.attributionId\n\t\t\t\t\t\t\t )\n\t\t\t\t\t\t\t: new SharedTreeEncoder_0_0_2(true).decodeSummary(treeContent as SharedTreeSummary_0_0_2);\n\n\t\t\t\t\texpect(parsedTree.currentTree).to.not.be.undefined;\n\t\t\t\t\tconst testRoot = assertArrayOfOne(\n\t\t\t\t\t\tassertNotUndefined(parsedTree.currentTree?.traits[testTree.traitLabel])\n\t\t\t\t\t);\n\t\t\t\t\texpect(testRoot).to.not.be.undefined;\n\t\t\t\t\texpect(testRoot.traits.left).to.not.be.undefined;\n\t\t\t\t\texpect(testRoot.traits.right).to.not.be.undefined;\n\t\t\t\t\texpect(testRoot.traits.left.length).to.equal(2);\n\n\t\t\t\t\tconst editLog: OrderedEditSet<ChangeInternal> = new EditLog(parsedTree.editHistory);\n\n\t\t\t\t\t// Expect there to be a change in the edit history in addition to the one from setUpTestSharedTree\n\t\t\t\t\texpect(editLog.length).to.equal(2);\n\n\t\t\t\t\t// The first operation to be sequenced is the tree init\n\t\t\t\t\tconst treeInitEdit = editLog.tryGetEditAtIndex(1) ?? fail('edit not found');\n\t\t\t\t\texpect(treeInitEdit.changes.length).to.equal(2);\n\t\t\t\t\texpect(treeInitEdit.changes[0].type).to.equal(ChangeType.Build);\n\t\t\t\t\texpect(treeInitEdit.changes[1].type).to.equal(ChangeType.Insert);\n\t\t\t\t});\n\t\t\t});\n\n\t\t\tit('can be used to initialize a tree', () => {\n\t\t\t\tconst {\n\t\t\t\t\tsharedTree: sharedTree1,\n\t\t\t\t\ttestTree: testTree1,\n\t\t\t\t\tcontainerRuntimeFactory,\n\t\t\t\t} = createSimpleTestTree({ localMode: false });\n\t\t\t\tconst { tree: sharedTree2 } = setUpTestSharedTree();\n\n\t\t\t\tconst newNode = testTree1.buildLeaf();\n\n\t\t\t\tsharedTree1.applyEdit(...Change.insertTree(newNode, StablePlace.before(testTree1.left)));\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t\t\tsharedTree2.loadSummary(sharedTree1.saveSummary());\n\n\t\t\t\t// Trees should have equal state since we deserialized the first tree's state into the second tree\n\t\t\t\texpect(sharedTree1.equals(sharedTree2)).to.be.true;\n\t\t\t});\n\n\t\t\tit('can be used to initialize a tree with an empty edit list', () => {\n\t\t\t\tconst { sharedTree: sharedTree1, containerRuntimeFactory } = createSimpleTestTree({ localMode: false });\n\t\t\t\tconst { tree: sharedTree2 } = setUpTestSharedTree();\n\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t\t\t// The second tree is not caught up to the first tree yet\n\t\t\t\texpect(sharedTree1.equals(sharedTree2)).to.be.false;\n\n\t\t\t\tsharedTree2.loadSummary(sharedTree1.saveSummary());\n\n\t\t\t\t// Trees should have equal state since we deserialized the first tree's state into the second tree\n\t\t\t\texpect(sharedTree1.equals(sharedTree2)).to.be.true;\n\t\t\t});\n\n\t\t\tit('asserts when loading a summary with duplicated edits', () => {\n\t\t\t\tconst {\n\t\t\t\t\tsharedTree: sharedTree1,\n\t\t\t\t\ttestTree: testTree1,\n\t\t\t\t\tcontainerRuntimeFactory,\n\t\t\t\t} = createSimpleTestTree({\n\t\t\t\t\tlocalMode: false,\n\t\t\t\t\tsummarizeHistory: true,\n\t\t\t\t\twriteFormat: WriteFormat.v0_0_2,\n\t\t\t\t});\n\t\t\t\tconst { tree: sharedTree2 } = setUpTestSharedTree();\n\n\t\t\t\tconst newNode = testTree1.buildLeaf();\n\n\t\t\t\tsharedTree1.applyEdit(...Change.insertTree(newNode, StablePlace.before(testTree1.left)));\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\tconst summary = sharedTree1.saveSummary() as SharedTreeSummary_0_0_2;\n\t\t\t\tconst sequencedEdits = assertNotUndefined(summary.sequencedEdits).slice();\n\t\t\t\tsequencedEdits.push(sequencedEdits[0]);\n\t\t\t\tconst corruptedSummary = {\n\t\t\t\t\t...summary,\n\t\t\t\t\tsequencedEdits,\n\t\t\t\t};\n\t\t\t\tassert.throws(\n\t\t\t\t\t() => sharedTree2.loadSummary(corruptedSummary),\n\t\t\t\t\t(e: Error) => validateAssertionError(e, /Duplicate/)\n\t\t\t\t);\n\t\t\t});\n\n\t\t\tit('can be used without history preservation', async () => {\n\t\t\t\tconst { sharedTree, testTree } = createSimpleTestTree({\n\t\t\t\t\tlocalMode: true,\n\t\t\t\t\tsummarizeHistory: false,\n\t\t\t\t});\n\n\t\t\t\tconst newNode = testTree.buildLeaf();\n\t\t\t\tconst { id } = sharedTree.applyEdit(...Change.insertTree(newNode, StablePlace.before(testTree.left)));\n\t\t\t\tconst treeBefore = convertTreeNodes<ChangeNode, ChangeNode_0_0_2>(\n\t\t\t\t\tgetChangeNodeFromView(sharedTree.currentView),\n\t\t\t\t\t(node) => convertNodeDataIds(node, (id) => sharedTree.convertToStableNodeId(id))\n\t\t\t\t);\n\t\t\t\tconst { summary } = sharedTree.getAttachSummary();\n\t\t\t\tassert.equal(summary.type, SummaryType.Tree, 'Summary type should be Tree');\n\t\t\t\tassert.equal(summary.tree.header.type, SummaryType.Blob, 'Summary should contain header blob');\n\t\t\t\tconst treeContent: SharedTreeSummaryBase = JSON.parse(summary.tree.header.content as string);\n\n\t\t\t\tconst { tree: sharedTree2 } = setUpTestSharedTree();\n\n\t\t\t\tsharedTree2.loadSummary(treeContent);\n\t\t\t\tconst treeAfter = convertTreeNodes<ChangeNode, ChangeNode_0_0_2>(\n\t\t\t\t\tgetChangeNodeFromView(sharedTree2.currentView),\n\t\t\t\t\t(node) => convertNodeDataIds(node, (id) => sharedTree2.convertToStableNodeId(id))\n\t\t\t\t);\n\t\t\t\t// The current state of the tree should be identical to the one contained in the old summary.\n\t\t\t\texpect(deepCompareNodes(treeBefore, treeAfter)).to.be.true;\n\n\t\t\t\t// The history should have been dropped by the default handling behavior.\n\t\t\t\t// It will contain a single entry setting the tree to equal the head revision.\n\t\t\t\texpect(sharedTree2.edits.length).to.equal(1);\n\t\t\t\texpect(sharedTree2.edits.tryGetEditFromId(id)).to.be.undefined;\n\t\t\t});\n\n\t\t\tit('correctly handles payloads at the root', () => {\n\t\t\t\tconst payload = 'foo';\n\t\t\t\tconst { tree, containerRuntimeFactory } = setUpTestSharedTree({ summarizeHistory: false });\n\t\t\t\ttree.applyEdit(Change.setPayload(tree.currentView.root, payload));\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\tconst summary = tree.saveSummary();\n\t\t\t\tconst { tree: tree2 } = setUpTestSharedTree({ summarizeHistory: false });\n\t\t\t\ttree2.loadSummary(summary);\n\t\t\t\texpect(tree2.currentView.tryGetViewNode(tree2.currentView.root)?.payload).to.equal(payload);\n\t\t\t});\n\t\t});\n\n\t\tdescribe('handles', () => {\n\t\t\tit('can reference a node', () => {\n\t\t\t\t// Test that a handle can wrap a node and retrieve that node's properties\n\t\t\t\tconst { sharedTree, testTree } = createSimpleTestTree();\n\t\t\t\tconst leftHandle = new TreeNodeHandle(sharedTree.currentView, testTree.left.identifier);\n\t\t\t\texpect(areNodesEquivalent(testTree.left, leftHandle)).to.be.true;\n\t\t\t\texpect(areNodesEquivalent(testTree.right, leftHandle)).to.be.false;\n\t\t\t});\n\n\t\t\tit('can create handles from children', () => {\n\t\t\t\t// Test that when retrieving children via the \"traits\" property of a handle, the\n\t\t\t\t// children are also wrapped in handles\n\t\t\t\tconst { sharedTree, testTree } = createSimpleTestTree();\n\t\t\t\tconst rootHandle = new TreeNodeHandle(sharedTree.currentView, testTree.identifier);\n\t\t\t\texpect(areNodesEquivalent(testTree, rootHandle)).to.be.true;\n\t\t\t\tconst leftHandle = rootHandle.traits.left[0];\n\t\t\t\texpect(areNodesEquivalent(testTree.left, leftHandle)).to.be.true;\n\t\t\t\texpect(leftHandle instanceof TreeNodeHandle).to.be.true;\n\t\t\t});\n\n\t\t\tit('do not update when the current view of the tree changes', () => {\n\t\t\t\tconst { sharedTree, testTree } = createSimpleTestTree();\n\t\t\t\tconst leftHandle = new TreeNodeHandle(sharedTree.currentView, testTree.left.identifier);\n\t\t\t\texpect(leftHandle.traits.right).to.be.undefined;\n\t\t\t\t// Move \"right\" under \"left\"\n\t\t\t\tsharedTree.applyEdit(\n\t\t\t\t\t...Change.move(\n\t\t\t\t\t\tStableRange.only(testTree.right),\n\t\t\t\t\t\tStablePlace.atStartOf({ parent: testTree.left.identifier, label: testTree.right.traitLabel })\n\t\t\t\t\t)\n\t\t\t\t);\n\t\t\t\texpect(leftHandle.traits.right).to.be.undefined;\n\t\t\t});\n\t\t});\n\n\t\tdescribe('telemetry', () => {\n\t\t\tclass LoggerThatOnlySeesSharedTreeEvents implements ITelemetryBaseLogger {\n\t\t\t\tpublic constructor(\n\t\t\t\t\tprivate readonly additionalFilter: (event: ITelemetryBaseEvent) => boolean = (e) => true\n\t\t\t\t) {}\n\t\t\t\tpublic events: ITelemetryBaseEvent[] = [];\n\t\t\t\tpublic send(event: ITelemetryBaseEvent) {\n\t\t\t\t\tif (isSharedTreeEvent(event) && this.additionalFilter(event)) {\n\t\t\t\t\t\tthis.events.push(event);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tdescribe('useFailedSequencedEditTelemetry', () => {\n\t\t\t\tit('decorates events with the correct properties', async () => {\n\t\t\t\t\t// Test that a handle can wrap a node and retrieve that node's properties\n\t\t\t\t\tconst logger = new LoggerThatOnlySeesSharedTreeEvents();\n\t\t\t\t\tconst { sharedTree, testTree, containerRuntimeFactory } = createSimpleTestTree({\n\t\t\t\t\t\tlogger,\n\t\t\t\t\t\tallowInvalid: true,\n\t\t\t\t\t});\n\t\t\t\t\tuseFailedSequencedEditTelemetry(sharedTree);\n\n\t\t\t\t\t// Invalid edit\n\t\t\t\t\tsharedTree.applyEdit(\n\t\t\t\t\t\t...Change.insertTree(\n\t\t\t\t\t\t\t[testTree.buildLeaf()],\n\t\t\t\t\t\t\tStablePlace.after(testTree.buildLeaf(testTree.generateNodeId()))\n\t\t\t\t\t\t)\n\t\t\t\t\t);\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t\t// Force demand, which will cause a telemetry event for the invalid edit to be emitted\n\t\t\t\t\tsharedTree.logViewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\t\t\texpect(logger.events.length).is.greaterThan(0);\n\t\t\t\t\tlogger.events.forEach((event) => {\n\t\t\t\t\t\texpect(isSharedTreeEvent(event)).is.true;\n\t\t\t\t\t});\n\t\t\t\t});\n\n\t\t\t\tit('is logged for invalid locally generated edits when those edits are sequenced', async () => {\n\t\t\t\t\tconst logger = new LoggerThatOnlySeesSharedTreeEvents(\n\t\t\t\t\t\t(event) => !event.eventName.includes('IdCompressor')\n\t\t\t\t\t);\n\n\t\t\t\t\tconst { sharedTree, testTree, containerRuntimeFactory } = createSimpleTestTree({\n\t\t\t\t\t\tlogger,\n\t\t\t\t\t\tallowInvalid: true,\n\t\t\t\t\t});\n\t\t\t\t\tuseFailedSequencedEditTelemetry(sharedTree);\n\n\t\t\t\t\t// Invalid edit\n\t\t\t\t\tsharedTree.applyEdit(\n\t\t\t\t\t\t...Change.insertTree(\n\t\t\t\t\t\t\t[testTree.buildLeaf()],\n\t\t\t\t\t\t\tStablePlace.after(testTree.buildLeaf(testTree.generateNodeId()))\n\t\t\t\t\t\t)\n\t\t\t\t\t);\n\t\t\t\t\texpect(logger.events.length).equals(0);\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t\t// Force demand, which will cause a telemetry event for the invalid edit to be emitted\n\t\t\t\t\tsharedTree.logViewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\t\t\texpect(logger.events.length).equals(1);\n\t\t\t\t\texpect(logger.events[0].category).equals('generic');\n\t\t\t\t\texpect(logger.events[0].eventName).equals('SharedTree:SequencedEditApplied:InvalidSharedTreeEdit');\n\t\t\t\t});\n\n\t\t\t\tit('can be disabled and re-enabled', async () => {\n\t\t\t\t\tconst logger = new LoggerThatOnlySeesSharedTreeEvents(\n\t\t\t\t\t\t(event) => !event.eventName.includes('IdCompressor')\n\t\t\t\t\t);\n\t\t\t\t\tconst { sharedTree, testTree, containerRuntimeFactory } = createSimpleTestTree({\n\t\t\t\t\t\tlogger,\n\t\t\t\t\t\tallowInvalid: true,\n\t\t\t\t\t});\n\t\t\t\t\tconst { disable } = useFailedSequencedEditTelemetry(sharedTree);\n\n\t\t\t\t\tsharedTree.applyEdit(\n\t\t\t\t\t\t...Change.insertTree(\n\t\t\t\t\t\t\t[testTree.buildLeaf()],\n\t\t\t\t\t\t\tStablePlace.after(testTree.buildLeaf(testTree.generateNodeId()))\n\t\t\t\t\t\t)\n\t\t\t\t\t);\n\t\t\t\t\texpect(logger.events.length).equals(0);\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t\tsharedTree.logViewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\t\t\texpect(logger.events.length).equals(1);\n\t\t\t\t\texpect(logger.events[0].eventName).equals('SharedTree:SequencedEditApplied:InvalidSharedTreeEdit');\n\n\t\t\t\t\tdisable();\n\n\t\t\t\t\tsharedTree.applyEdit(\n\t\t\t\t\t\t...Change.insertTree(\n\t\t\t\t\t\t\t[testTree.buildLeaf()],\n\t\t\t\t\t\t\tStablePlace.after(testTree.buildLeaf(testTree.generateNodeId()))\n\t\t\t\t\t\t)\n\t\t\t\t\t);\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t\tsharedTree.logViewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\t\t\texpect(logger.events.length).equals(1);\n\n\t\t\t\t\tuseFailedSequencedEditTelemetry(sharedTree);\n\n\t\t\t\t\tsharedTree.applyEdit(\n\t\t\t\t\t\t...Change.insertTree(\n\t\t\t\t\t\t\t[testTree.buildLeaf()],\n\t\t\t\t\t\t\tStablePlace.after(testTree.buildLeaf(testTree.generateNodeId()))\n\t\t\t\t\t\t)\n\t\t\t\t\t);\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t\tsharedTree.logViewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\n\t\t\t\t\texpect(logger.events.length).equals(2);\n\t\t\t\t\texpect(logger.events[1].eventName).equals('SharedTree:SequencedEditApplied:InvalidSharedTreeEdit');\n\t\t\t\t});\n\n\t\t\t\tit('is not logged for valid edits', async () => {\n\t\t\t\t\tconst logger = new LoggerThatOnlySeesSharedTreeEvents(\n\t\t\t\t\t\t(event) => !event.eventName.includes('IdCompressor')\n\t\t\t\t\t);\n\t\t\t\t\tconst { sharedTree, testTree, containerRuntimeFactory } = createSimpleTestTree({ logger });\n\t\t\t\t\tuseFailedSequencedEditTelemetry(sharedTree);\n\n\t\t\t\t\tsharedTree.applyEdit(...Change.insertTree(testTree.buildLeaf(), StablePlace.after(testTree.left)));\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t\tsharedTree.logViewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\t\t\texpect(logger.events.length).equals(0);\n\t\t\t\t});\n\n\t\t\t\tit('is not logged for remote edits', async () => {\n\t\t\t\t\tconst logger = new LoggerThatOnlySeesSharedTreeEvents(\n\t\t\t\t\t\t(event) => !event.eventName.includes('IdCompressor')\n\t\t\t\t\t);\n\t\t\t\t\tconst { sharedTree: sharedTree1, containerRuntimeFactory } = createSimpleTestTree({\n\t\t\t\t\t\tlogger,\n\t\t\t\t\t\tallowInvalid: true,\n\t\t\t\t\t\tlocalMode: false,\n\t\t\t\t\t});\n\t\t\t\t\tconst { sharedTree: sharedTree2, testTree: testTree2 } = createSimpleTestTree({\n\t\t\t\t\t\tcontainerRuntimeFactory,\n\t\t\t\t\t\tid: 'secondTestSharedTree',\n\t\t\t\t\t\tlocalMode: false,\n\t\t\t\t\t});\n\t\t\t\t\tuseFailedSequencedEditTelemetry(sharedTree1);\n\n\t\t\t\t\tsharedTree2.applyEdit(\n\t\t\t\t\t\t...Change.insertTree(\n\t\t\t\t\t\t\t[testTree2.buildLeaf()],\n\t\t\t\t\t\t\tStablePlace.after(testTree2.buildLeaf(testTree2.generateNodeId()))\n\t\t\t\t\t\t)\n\t\t\t\t\t);\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t\tsharedTree1.logViewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\t\t\texpect(logger.events.length).equals(0);\n\t\t\t\t});\n\t\t\t});\n\t\t});\n\n\t\tdescribe('Events', () => {\n\t\t\tit('fires an event when an edit is committed', () => {\n\t\t\t\tconst { sharedTree, testTree } = createSimpleTestTree();\n\n\t\t\t\tlet eventCount = 0;\n\t\t\t\tlet editIdFromEvent: EditId | undefined;\n\t\t\t\tsharedTree.on(SharedTreeEvent.EditCommitted, (args: EditCommittedEventArguments) => {\n\t\t\t\t\texpect(args.local).true;\n\t\t\t\t\texpect(args.tree).equals(sharedTree);\n\t\t\t\t\teditIdFromEvent = args.editId;\n\t\t\t\t\teventCount += 1;\n\t\t\t\t});\n\n\t\t\t\t// Invalid change\n\t\t\t\tconst invalidEdit = sharedTree.applyEdit(\n\t\t\t\t\t...Change.insertTree(\n\t\t\t\t\t\t[testTree.buildLeaf()],\n\t\t\t\t\t\tStablePlace.after(testTree.buildLeaf(testTree.generateNodeId()))\n\t\t\t\t\t)\n\t\t\t\t);\n\t\t\t\texpect(editIdFromEvent).equals(invalidEdit.id);\n\t\t\t\texpect(eventCount).equals(1);\n\n\t\t\t\t// Valid change\n\t\t\t\tconst { id } = sharedTree.applyEdit(\n\t\t\t\t\t...Change.insertTree(testTree.buildLeaf(), StablePlace.after(testTree.left))\n\t\t\t\t);\n\t\t\t\texpect(editIdFromEvent).equals(id);\n\t\t\t\texpect(eventCount).equals(2);\n\t\t\t});\n\n\t\t\tit('fires an event when a sequenced edit is applied', async () => {\n\t\t\t\tconst {\n\t\t\t\t\tsharedTree: sharedTree1,\n\t\t\t\t\ttestTree,\n\t\t\t\t\tcontainerRuntimeFactory,\n\t\t\t\t} = createSimpleTestTree({\n\t\t\t\t\tallowInvalid: true,\n\t\t\t\t\tlocalMode: false,\n\t\t\t\t});\n\t\t\t\tconst { tree: sharedTree2 } = setUpTestSharedTree({\n\t\t\t\t\tcontainerRuntimeFactory,\n\t\t\t\t\tid: 'secondTestSharedTree',\n\t\t\t\t\tlocalMode: false,\n\t\t\t\t});\n\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\tsharedTree1.logViewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\n\t\t\t\tconst eventArgs: SequencedEditAppliedEventArguments[] = [];\n\t\t\t\tsharedTree1.on(SharedTreeEvent.SequencedEditApplied, (args: SequencedEditAppliedEventArguments) =>\n\t\t\t\t\teventArgs.push(args)\n\t\t\t\t);\n\n\t\t\t\t// Invalid change\n\t\t\t\tconst change = Change.setPayload(testTree.generateNodeId(), 42);\n\t\t\t\tconst invalidEdit = sharedTree1.applyEdit(change);\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\tsharedTree1.logViewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\n\t\t\t\texpect(eventArgs.length).equals(1);\n\t\t\t\texpect(eventArgs[0].edit.id).equals(invalidEdit.id);\n\t\t\t\texpect(eventArgs[0].wasLocal).equals(true);\n\t\t\t\texpect(eventArgs[0].reconciliationPath.length).equals(0);\n\t\t\t\texpect(eventArgs[0].outcome.status).equals(EditStatus.Invalid);\n\n\t\t\t\t// Valid change\n\t\t\t\tconst validEdit1 = sharedTree2.applyEdit(\n\t\t\t\t\t...Change.insertTree(\n\t\t\t\t\t\t[testTree.buildLeaf()],\n\t\t\t\t\t\tStablePlace.after(testTree.left.translateId(sharedTree2))\n\t\t\t\t\t)\n\t\t\t\t);\n\n\t\t\t\t// Valid change\n\t\t\t\tconst validEdit2 = sharedTree1.applyEdit(\n\t\t\t\t\t...Change.insertTree(testTree.buildLeaf(), StablePlace.after(testTree.left))\n\t\t\t\t);\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\tsharedTree1.logViewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\n\t\t\t\texpect(eventArgs.length).equals(3);\n\t\t\t\texpect(eventArgs[1].edit.id).equals(validEdit1.id);\n\t\t\t\texpect(eventArgs[1].wasLocal).equals(false);\n\t\t\t\texpect(eventArgs[1].reconciliationPath.length).equals(0);\n\t\t\t\texpect(eventArgs[1].outcome.status).equals(EditStatus.Applied);\n\n\t\t\t\texpect(eventArgs[2].edit.id).equals(validEdit2.id);\n\t\t\t\texpect(eventArgs[2].wasLocal).equals(true);\n\t\t\t\texpect(eventArgs[2].reconciliationPath.length).equals(1);\n\t\t\t\texpect(eventArgs[2].outcome.status).equals(EditStatus.Applied);\n\t\t\t});\n\t\t});\n\n\t\t// This functionality was only implemented in format 0.1.1.\n\t\tif (writeFormat !== WriteFormat.v0_0_2) {\n\t\t\tdescribe('String interning and tree compression', () => {\n\t\t\t\tfunction getMutableStringInterner(tree: SharedTree): MutableStringInterner {\n\t\t\t\t\tconst summary = tree.saveSummary();\n\t\t\t\t\tswitch (summary.version) {\n\t\t\t\t\t\tcase WriteFormat.v0_0_2:\n\t\t\t\t\t\t\treturn new MutableStringInterner();\n\t\t\t\t\t\tcase WriteFormat.v0_1_1:\n\t\t\t\t\t\t\treturn new MutableStringInterner((summary as SharedTreeSummary).internedStrings);\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\tfail(`Invalid summary format: ${summary.version}`);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tit('compress ops via interning and tree compression and decompress when processing edits', () => {\n\t\t\t\t\tconst {\n\t\t\t\t\t\tsharedTree: tree,\n\t\t\t\t\t\ttestTree,\n\t\t\t\t\t\tcontainerRuntimeFactory,\n\t\t\t\t\t} = createSimpleTestTree({ writeFormat });\n\t\t\t\t\tconst { tree: secondTree } = setUpTestSharedTree({ containerRuntimeFactory, writeFormat });\n\t\t\t\t\tconst remoteRuntime = containerRuntimeFactory.createContainerRuntime(\n\t\t\t\t\t\tnew MockFluidDataStoreRuntime()\n\t\t\t\t\t);\n\n\t\t\t\t\tconst newNode = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\t\t\ttree.applyEdit(...Change.insertTree(newNode, StablePlace.after(testTree.left)));\n\t\t\t\t\ttree.applyEdit(...Change.move(StableRange.only(newNode), StablePlace.before(testTree.left)));\n\n\t\t\t\t\t// Unit testing the interning of ops requires access violation since factory and messages are protected.\n\t\t\t\t\ttype WithFactory<T> = T & { factory: MockContainerRuntimeFactory };\n\t\t\t\t\ttype WithMessages<T> = T & { messages: ISequencedDocumentMessage[] };\n\t\t\t\t\tconst factory = (remoteRuntime as unknown as WithFactory<MockContainerRuntime>).factory;\n\t\t\t\t\tconst messages = (factory as unknown as WithMessages<MockContainerRuntimeFactory>).messages;\n\n\t\t\t\t\texpect(messages.length).to.equal(3);\n\t\t\t\t\tfor (const message of messages.slice(1)) {\n\t\t\t\t\t\t// After the initial setup edit, common definitions should be interned\n\t\t\t\t\t\tfor (const change of (message.contents as SharedTreeEditOp).edit.changes) {\n\t\t\t\t\t\t\tif (change.type === ChangeTypeInternal.CompressedBuild) {\n\t\t\t\t\t\t\t\tconst stringifiedContents = JSON.stringify(message.contents);\n\t\t\t\t\t\t\t\texpect(stringifiedContents).to.not.include(SimpleTestTree.leftTraitLabel);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\texpect(tree.equals(secondTree)).to.be.false;\n\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t\tconst { internedStrings } = tree.saveSummary() as SharedTreeSummary;\n\n\t\t\t\t\tconst log = getEditLogInternal(tree);\n\t\t\t\t\tconst log2 = getEditLogInternal(secondTree);\n\t\t\t\t\tconst insertEdit = normalizeEdit(tree, log.tryGetEditAtIndex(1) ?? fail('edit not found'));\n\t\t\t\t\tconst moveEdit = normalizeEdit(tree, log.tryGetEditAtIndex(2) ?? fail('edit not found'));\n\t\t\t\t\tconst insertEdit2 = normalizeEdit(secondTree, log2.tryGetEditAtIndex(1) ?? fail('edit not found'));\n\t\t\t\t\tconst moveEdit2 = normalizeEdit(secondTree, log2.tryGetEditAtIndex(2) ?? fail('edit not found'));\n\t\t\t\t\texpect(insertEdit).to.deep.equal(insertEdit2);\n\t\t\t\t\texpect(moveEdit).to.deep.equal(moveEdit2);\n\t\t\t\t\texpect(tree.equals(secondTree)).to.be.true;\n\t\t\t\t\texpect(internedStrings).to.include(SimpleTestTree.leftTraitLabel);\n\t\t\t\t\texpect(internedStrings).to.include(newNode.definition);\n\t\t\t\t});\n\n\t\t\t\tit('compress summaries via interning and tree compression on save and decompress on load', () => {\n\t\t\t\t\tconst {\n\t\t\t\t\t\tsharedTree: tree,\n\t\t\t\t\t\ttestTree: testTree,\n\t\t\t\t\t\tcontainerRuntimeFactory,\n\t\t\t\t\t} = createSimpleTestTree({ writeFormat });\n\n\t\t\t\t\tconst newNode = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\t\t\ttree.applyEdit(...Change.insertTree(newNode, StablePlace.after(testTree.left)));\n\t\t\t\t\ttree.applyEdit(...Change.move(StableRange.only(newNode), StablePlace.before(testTree.left)));\n\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t\t\t\tconst summary = tree.saveSummary() as SharedTreeSummary;\n\t\t\t\t\texpect(summary.internedStrings).to.not.be.undefined;\n\t\t\t\t\texpect(summary.internedStrings.length).to.equal(5);\n\n\t\t\t\t\tconst interner = new MutableStringInterner(summary.internedStrings);\n\t\t\t\t\tconst treeCompressor = new InterningTreeCompressor();\n\t\t\t\t\tconst expectedCompressedTree = treeCompressor.compress(\n\t\t\t\t\t\tgetChangeNodeFromView(tree.currentView),\n\t\t\t\t\t\tinterner,\n\t\t\t\t\t\tsequencedIdNormalizer(getIdNormalizerFromSharedTree(tree))\n\t\t\t\t\t);\n\n\t\t\t\t\texpect(summary.currentTree).deep.equal(expectedCompressedTree);\n\n\t\t\t\t\tconst { tree: secondTree } = setUpTestSharedTree({ writeFormat });\n\t\t\t\t\texpect(tree.equals(secondTree)).to.be.false;\n\t\t\t\t\tsecondTree.loadSummary(summary);\n\t\t\t\t\texpect(tree.equals(secondTree)).to.be.true;\n\t\t\t\t});\n\t\t\t});\n\t\t}\n\n\t\tdescribe('mergeEditsFrom', () => {\n\t\t\tconst getTestTreeRootHandle = (tree: SharedTree, testTree: TestTree): TreeNodeHandle => {\n\t\t\t\tconst view = tree.currentView;\n\t\t\t\tconst handle = new TreeNodeHandle(view, view.root);\n\t\t\t\treturn handle.traits[testTree.traitLabel][0];\n\t\t\t};\n\n\t\t\tit('can be used with simple edits', () => {\n\t\t\t\tconst { sharedTree, testTree } = createSimpleTestTree();\n\t\t\t\tconst { sharedTree: sharedTree2, testTree: testTree2 } = createSimpleTestTree();\n\t\t\t\tsharedTree.applyEdit(...Change.insertTree(testTree.buildLeaf(), StablePlace.after(testTree.left)));\n\t\t\t\tsharedTree.applyEdit(\n\t\t\t\t\tChange.delete(StableRange.all({ parent: testTree.identifier, label: testTree.right.traitLabel }))\n\t\t\t\t);\n\t\t\t\tconst preEditRootHandle = getTestTreeRootHandle(sharedTree2, testTree2);\n\t\t\t\tconst edits = [0, 1, 2].map((i) => sharedTree.edits.tryGetEditAtIndex(i) ?? fail('edit not found'));\n\t\t\t\t// Since the TestTree setup edit is a `setTrait`, this should wipe `testTree2` state.\n\t\t\t\tsharedTree2.mergeEditsFrom(sharedTree, edits);\n\t\t\t\texpect(sharedTree2.edits.length).to.equal(4);\n\t\t\t\tconst rootHandle = getTestTreeRootHandle(sharedTree2, testTree2);\n\t\t\t\texpect(preEditRootHandle.identifier).to.not.equal(rootHandle.identifier);\n\t\t\t\texpect(rootHandle.traits[testTree2.left.traitLabel].length).to.equal(2);\n\t\t\t});\n\n\t\t\tit('can be used with a translation map', () => {\n\t\t\t\tconst { sharedTree, testTree } = createSimpleTestTree();\n\t\t\t\tconst { sharedTree: sharedTree2, testTree: testTree2 } = createSimpleTestTree();\n\t\t\t\t// For each of the identities in the simple test tree...\n\t\t\t\tconst nodeIdGetters: ((tree: TestTree) => NodeId)[] = [\n\t\t\t\t\t(tree) => tree.identifier,\n\t\t\t\t\t(tree) => tree.left.identifier,\n\t\t\t\t\t(tree) => tree.right.identifier,\n\t\t\t\t];\n\t\t\t\t// Make a map translating that identifier from `testTree` to `testTree2`\n\t\t\t\tconst translationMap = new Map(\n\t\t\t\t\tnodeIdGetters.map((getter) => [\n\t\t\t\t\t\tsharedTree.convertToStableNodeId(getter(testTree)),\n\t\t\t\t\t\tsharedTree2.convertToStableNodeId(getter(testTree2)),\n\t\t\t\t\t])\n\t\t\t\t);\n\t\t\t\tsharedTree.applyEdit(...Change.insertTree(testTree.buildLeaf(), StablePlace.after(testTree.left)));\n\t\t\t\tsharedTree.applyEdit(\n\t\t\t\t\tChange.delete(StableRange.all({ parent: testTree.identifier, label: testTree.right.traitLabel }))\n\t\t\t\t);\n\t\t\t\tconst edits = [1, 2].map((i) => sharedTree.edits.tryGetEditAtIndex(i) ?? fail('edit not found'));\n\t\t\t\tsharedTree2.mergeEditsFrom(sharedTree, edits, (id) => translationMap.get(id) ?? id);\n\n\t\t\t\tconst root = getTestTreeRootHandle(sharedTree, testTree);\n\t\t\t\tconst root2 = getTestTreeRootHandle(sharedTree2, testTree2);\n\n\t\t\t\tconst leftTrait = root.traits[testTree.left.traitLabel];\n\t\t\t\tconst leftTrait2 = root2.traits[testTree2.left.traitLabel];\n\n\t\t\t\t// Inserted leaves should be equivalent.\n\t\t\t\texpect(leftTrait2.length).to.equal(2);\n\t\t\t\texpect(leftTrait2[1]).to.deep.equal(leftTrait[1]);\n\t\t\t\t// Right subtree should have been deleted.\n\t\t\t\texpect(Object.entries(root2.traits).length).to.equal(1);\n\t\t\t\texpect(root2.traits[testTree2.right.traitLabel]).to.equal(undefined);\n\t\t\t});\n\t\t});\n\t});\n}\n"]}
package/lib/test/utilities/SharedTreeVersioningTests.d.ts DELETED
@@ -1,11 +0,0 @@
1
- /*!
2
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
3
- * Licensed under the MIT License.
4
- */
5
- import { SharedTreeTestingComponents, SharedTreeTestingOptions } from './TestUtilities.js';
6
- /**
7
- * Runs a test suite for operations on `SharedTree` that depend on correct versioning.
8
- * This suite can be used to test other implementations that aim to fulfill `SharedTree`'s contract.
9
- */
10
- export declare function runSharedTreeVersioningTests(title: string, setUpTestSharedTree: (options?: SharedTreeTestingOptions) => SharedTreeTestingComponents): void;
11
- //# sourceMappingURL=SharedTreeVersioningTests.d.ts.map
package/lib/test/utilities/SharedTreeVersioningTests.d.ts.map DELETED
@@ -1 +0,0 @@
1
- {"version":3,"file":"SharedTreeVersioningTests.d.ts","sourceRoot":"","sources":["../../../src/test/utilities/SharedTreeVersioningTests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAmBH,OAAO,EAIN,2BAA2B,EAC3B,wBAAwB,EAIxB,MAAM,oBAAoB,CAAC;AAO5B;;;GAGG;AACH,wBAAgB,4BAA4B,CAC3C,KAAK,EAAE,MAAM,EACb,mBAAmB,EAAE,CAAC,OAAO,CAAC,EAAE,wBAAwB,KAAK,2BAA2B,QA2hBxF"}