@fluid-experimental/tree 2.0.0-rc.1.0.3 → 2.0.0-rc.2.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 (572) hide show
  1. package/{.eslintrc.js → .eslintrc.cjs} +1 -1
  2. package/{.mocharc.js → .mocharc.cjs} +1 -1
  3. package/.vscode/settings.json +1 -1
  4. package/CHANGELOG.md +4 -0
  5. package/api-report/experimental-tree.api.md +4 -15
  6. package/dist/ChangeCompression.d.ts +5 -5
  7. package/dist/ChangeCompression.d.ts.map +1 -1
  8. package/dist/ChangeCompression.js +24 -24
  9. package/dist/ChangeCompression.js.map +1 -1
  10. package/dist/ChangeTypes.d.ts +3 -3
  11. package/dist/ChangeTypes.d.ts.map +1 -1
  12. package/dist/ChangeTypes.js +9 -9
  13. package/dist/ChangeTypes.js.map +1 -1
  14. package/dist/Checkout.d.ts +7 -7
  15. package/dist/Checkout.d.ts.map +1 -1
  16. package/dist/Checkout.js +27 -27
  17. package/dist/Checkout.js.map +1 -1
  18. package/dist/Common.d.ts +2 -2
  19. package/dist/Common.d.ts.map +1 -1
  20. package/dist/Common.js.map +1 -1
  21. package/dist/EagerCheckout.d.ts +3 -3
  22. package/dist/EagerCheckout.d.ts.map +1 -1
  23. package/dist/EagerCheckout.js +2 -2
  24. package/dist/EagerCheckout.js.map +1 -1
  25. package/dist/EditLog.d.ts +4 -6
  26. package/dist/EditLog.d.ts.map +1 -1
  27. package/dist/EditLog.js +9 -9
  28. package/dist/EditLog.js.map +1 -1
  29. package/dist/EditUtilities.d.ts +6 -6
  30. package/dist/EditUtilities.d.ts.map +1 -1
  31. package/dist/EditUtilities.js +28 -28
  32. package/dist/EditUtilities.js.map +1 -1
  33. package/dist/Forest.d.ts +2 -2
  34. package/dist/Forest.d.ts.map +1 -1
  35. package/dist/Forest.js +13 -13
  36. package/dist/Forest.js.map +1 -1
  37. package/dist/HistoryEditFactory.d.ts +3 -3
  38. package/dist/HistoryEditFactory.d.ts.map +1 -1
  39. package/dist/HistoryEditFactory.js +36 -36
  40. package/dist/HistoryEditFactory.js.map +1 -1
  41. package/dist/IdConversion.d.ts +3 -3
  42. package/dist/IdConversion.d.ts.map +1 -1
  43. package/dist/IdConversion.js +23 -23
  44. package/dist/IdConversion.js.map +1 -1
  45. package/dist/InitialTree.d.ts +1 -1
  46. package/dist/InitialTree.d.ts.map +1 -1
  47. package/dist/InitialTree.js +2 -2
  48. package/dist/InitialTree.js.map +1 -1
  49. package/dist/LazyCheckout.d.ts +5 -5
  50. package/dist/LazyCheckout.d.ts.map +1 -1
  51. package/dist/LazyCheckout.js +2 -2
  52. package/dist/LazyCheckout.js.map +1 -1
  53. package/dist/LogViewer.d.ts +7 -7
  54. package/dist/LogViewer.d.ts.map +1 -1
  55. package/dist/LogViewer.js +25 -25
  56. package/dist/LogViewer.js.map +1 -1
  57. package/dist/MergeHealth.d.ts +1 -1
  58. package/dist/MergeHealth.d.ts.map +1 -1
  59. package/dist/MergeHealth.js +32 -32
  60. package/dist/MergeHealth.js.map +1 -1
  61. package/dist/NodeIdUtilities.d.ts +3 -3
  62. package/dist/NodeIdUtilities.d.ts.map +1 -1
  63. package/dist/NodeIdUtilities.js +4 -4
  64. package/dist/NodeIdUtilities.js.map +1 -1
  65. package/dist/PayloadUtilities.d.ts +1 -1
  66. package/dist/PayloadUtilities.d.ts.map +1 -1
  67. package/dist/PayloadUtilities.js.map +1 -1
  68. package/dist/ReconciliationPath.d.ts +3 -3
  69. package/dist/ReconciliationPath.d.ts.map +1 -1
  70. package/dist/ReconciliationPath.js.map +1 -1
  71. package/dist/RevisionValueCache.js +5 -5
  72. package/dist/RevisionValueCache.js.map +1 -1
  73. package/dist/RevisionView.d.ts +5 -5
  74. package/dist/RevisionView.d.ts.map +1 -1
  75. package/dist/RevisionView.js +11 -11
  76. package/dist/RevisionView.js.map +1 -1
  77. package/dist/SerializationUtilities.d.ts +4 -4
  78. package/dist/SerializationUtilities.d.ts.map +1 -1
  79. package/dist/SerializationUtilities.js +5 -5
  80. package/dist/SerializationUtilities.js.map +1 -1
  81. package/dist/SharedTree.d.ts +15 -18
  82. package/dist/SharedTree.d.ts.map +1 -1
  83. package/dist/SharedTree.js +154 -166
  84. package/dist/SharedTree.js.map +1 -1
  85. package/dist/SharedTreeEncoder.d.ts +8 -8
  86. package/dist/SharedTreeEncoder.d.ts.map +1 -1
  87. package/dist/SharedTreeEncoder.js +67 -67
  88. package/dist/SharedTreeEncoder.js.map +1 -1
  89. package/dist/StringInterner.d.ts +1 -1
  90. package/dist/StringInterner.d.ts.map +1 -1
  91. package/dist/StringInterner.js +2 -2
  92. package/dist/StringInterner.js.map +1 -1
  93. package/dist/Summary.d.ts +4 -4
  94. package/dist/Summary.d.ts.map +1 -1
  95. package/dist/Summary.js +2 -2
  96. package/dist/Summary.js.map +1 -1
  97. package/dist/SummaryBackCompatibility.d.ts +3 -3
  98. package/dist/SummaryBackCompatibility.d.ts.map +1 -1
  99. package/dist/SummaryBackCompatibility.js +13 -13
  100. package/dist/SummaryBackCompatibility.js.map +1 -1
  101. package/dist/SummaryTestUtilities.d.ts +2 -2
  102. package/dist/SummaryTestUtilities.d.ts.map +1 -1
  103. package/dist/SummaryTestUtilities.js.map +1 -1
  104. package/dist/Transaction.d.ts +4 -4
  105. package/dist/Transaction.d.ts.map +1 -1
  106. package/dist/Transaction.js +10 -10
  107. package/dist/Transaction.js.map +1 -1
  108. package/dist/TransactionInternal.d.ts +7 -7
  109. package/dist/TransactionInternal.d.ts.map +1 -1
  110. package/dist/TransactionInternal.js +87 -87
  111. package/dist/TransactionInternal.js.map +1 -1
  112. package/dist/TreeCompressor.d.ts +4 -4
  113. package/dist/TreeCompressor.d.ts.map +1 -1
  114. package/dist/TreeCompressor.js +6 -6
  115. package/dist/TreeCompressor.js.map +1 -1
  116. package/dist/TreeNodeHandle.d.ts +3 -3
  117. package/dist/TreeNodeHandle.d.ts.map +1 -1
  118. package/dist/TreeNodeHandle.js +5 -5
  119. package/dist/TreeNodeHandle.js.map +1 -1
  120. package/dist/TreeView.d.ts +3 -3
  121. package/dist/TreeView.d.ts.map +1 -1
  122. package/dist/TreeView.js +10 -10
  123. package/dist/TreeView.js.map +1 -1
  124. package/dist/TreeViewUtilities.d.ts +2 -2
  125. package/dist/TreeViewUtilities.d.ts.map +1 -1
  126. package/dist/TreeViewUtilities.js +3 -3
  127. package/dist/TreeViewUtilities.js.map +1 -1
  128. package/dist/UndoRedoHandler.d.ts +2 -2
  129. package/dist/UndoRedoHandler.d.ts.map +1 -1
  130. package/dist/UndoRedoHandler.js +5 -5
  131. package/dist/UndoRedoHandler.js.map +1 -1
  132. package/dist/UuidUtilities.d.ts +1 -1
  133. package/dist/UuidUtilities.d.ts.map +1 -1
  134. package/dist/UuidUtilities.js +3 -3
  135. package/dist/UuidUtilities.js.map +1 -1
  136. package/dist/id-compressor/AppendOnlySortedMap.js +4 -4
  137. package/dist/id-compressor/AppendOnlySortedMap.js.map +1 -1
  138. package/dist/id-compressor/IdCompressor.d.ts +2 -2
  139. package/dist/id-compressor/IdCompressor.d.ts.map +1 -1
  140. package/dist/id-compressor/IdCompressor.js +78 -78
  141. package/dist/id-compressor/IdCompressor.js.map +1 -1
  142. package/dist/id-compressor/IdRange.d.ts +1 -1
  143. package/dist/id-compressor/IdRange.d.ts.map +1 -1
  144. package/dist/id-compressor/IdRange.js.map +1 -1
  145. package/dist/id-compressor/NumericUuid.d.ts +1 -1
  146. package/dist/id-compressor/NumericUuid.d.ts.map +1 -1
  147. package/dist/id-compressor/NumericUuid.js +6 -6
  148. package/dist/id-compressor/NumericUuid.js.map +1 -1
  149. package/dist/id-compressor/SessionIdNormalizer.d.ts +2 -2
  150. package/dist/id-compressor/SessionIdNormalizer.d.ts.map +1 -1
  151. package/dist/id-compressor/SessionIdNormalizer.js +14 -14
  152. package/dist/id-compressor/SessionIdNormalizer.js.map +1 -1
  153. package/dist/id-compressor/index.d.ts +4 -4
  154. package/dist/id-compressor/index.d.ts.map +1 -1
  155. package/dist/id-compressor/index.js +11 -11
  156. package/dist/id-compressor/index.js.map +1 -1
  157. package/dist/id-compressor/persisted-types/0.0.1.d.ts +1 -1
  158. package/dist/id-compressor/persisted-types/0.0.1.d.ts.map +1 -1
  159. package/dist/id-compressor/persisted-types/0.0.1.js.map +1 -1
  160. package/dist/id-compressor/persisted-types/index.d.ts +1 -1
  161. package/dist/id-compressor/persisted-types/index.d.ts.map +1 -1
  162. package/dist/id-compressor/persisted-types/index.js.map +1 -1
  163. package/dist/index.d.ts +29 -29
  164. package/dist/index.d.ts.map +1 -1
  165. package/dist/index.js +73 -73
  166. package/dist/index.js.map +1 -1
  167. package/dist/migration-shim/migrationDeltaHandler.d.ts +1 -1
  168. package/dist/migration-shim/migrationDeltaHandler.d.ts.map +1 -1
  169. package/dist/migration-shim/migrationDeltaHandler.js +5 -8
  170. package/dist/migration-shim/migrationDeltaHandler.js.map +1 -1
  171. package/dist/migration-shim/migrationShim.d.ts +1 -1
  172. package/dist/migration-shim/migrationShim.d.ts.map +1 -1
  173. package/dist/migration-shim/migrationShim.js +1 -1
  174. package/dist/migration-shim/migrationShim.js.map +1 -1
  175. package/dist/migration-shim/migrationShimFactory.d.ts +1 -1
  176. package/dist/migration-shim/migrationShimFactory.d.ts.map +1 -1
  177. package/dist/migration-shim/migrationShimFactory.js.map +1 -1
  178. package/dist/migration-shim/sharedTreeDeltaHandler.d.ts +1 -1
  179. package/dist/migration-shim/sharedTreeDeltaHandler.d.ts.map +1 -1
  180. package/dist/migration-shim/sharedTreeDeltaHandler.js +2 -5
  181. package/dist/migration-shim/sharedTreeDeltaHandler.js.map +1 -1
  182. package/dist/migration-shim/types.d.ts +1 -1
  183. package/dist/migration-shim/types.d.ts.map +1 -1
  184. package/dist/migration-shim/types.js.map +1 -1
  185. package/dist/package.json +3 -0
  186. package/dist/persisted-types/0.0.2.d.ts +1 -1
  187. package/dist/persisted-types/0.0.2.d.ts.map +1 -1
  188. package/dist/persisted-types/0.0.2.js.map +1 -1
  189. package/dist/persisted-types/0.1.1.d.ts +4 -4
  190. package/dist/persisted-types/0.1.1.d.ts.map +1 -1
  191. package/dist/persisted-types/0.1.1.js +13 -13
  192. package/dist/persisted-types/0.1.1.js.map +1 -1
  193. package/dist/persisted-types/index.d.ts +2 -2
  194. package/dist/persisted-types/index.d.ts.map +1 -1
  195. package/dist/persisted-types/index.js +13 -13
  196. package/dist/persisted-types/index.js.map +1 -1
  197. package/dist/tree-alpha.d.ts +5 -8
  198. package/dist/tree-beta.d.ts +5 -1
  199. package/dist/tree-public.d.ts +5 -1
  200. package/dist/tree-untrimmed.d.ts +5 -8
  201. package/dist/tsdoc-metadata.json +1 -1
  202. package/lib/ChangeCompression.d.ts +5 -5
  203. package/lib/ChangeCompression.d.ts.map +1 -1
  204. package/lib/ChangeCompression.js +3 -3
  205. package/lib/ChangeCompression.js.map +1 -1
  206. package/lib/ChangeTypes.d.ts +3 -3
  207. package/lib/ChangeTypes.d.ts.map +1 -1
  208. package/lib/ChangeTypes.js +3 -3
  209. package/lib/ChangeTypes.js.map +1 -1
  210. package/lib/Checkout.d.ts +7 -7
  211. package/lib/Checkout.d.ts.map +1 -1
  212. package/lib/Checkout.js +6 -6
  213. package/lib/Checkout.js.map +1 -1
  214. package/lib/Common.d.ts +2 -2
  215. package/lib/Common.d.ts.map +1 -1
  216. package/lib/Common.js.map +1 -1
  217. package/lib/EagerCheckout.d.ts +3 -3
  218. package/lib/EagerCheckout.d.ts.map +1 -1
  219. package/lib/EagerCheckout.js +1 -1
  220. package/lib/EagerCheckout.js.map +1 -1
  221. package/lib/EditLog.d.ts +4 -6
  222. package/lib/EditLog.d.ts.map +1 -1
  223. package/lib/EditLog.js +1 -1
  224. package/lib/EditLog.js.map +1 -1
  225. package/lib/EditUtilities.d.ts +6 -6
  226. package/lib/EditUtilities.d.ts.map +1 -1
  227. package/lib/EditUtilities.js +7 -7
  228. package/lib/EditUtilities.js.map +1 -1
  229. package/lib/Forest.d.ts +2 -2
  230. package/lib/Forest.d.ts.map +1 -1
  231. package/lib/Forest.js +2 -2
  232. package/lib/Forest.js.map +1 -1
  233. package/lib/HistoryEditFactory.d.ts +3 -3
  234. package/lib/HistoryEditFactory.d.ts.map +1 -1
  235. package/lib/HistoryEditFactory.js +7 -7
  236. package/lib/HistoryEditFactory.js.map +1 -1
  237. package/lib/IdConversion.d.ts +3 -3
  238. package/lib/IdConversion.d.ts.map +1 -1
  239. package/lib/IdConversion.js +4 -4
  240. package/lib/IdConversion.js.map +1 -1
  241. package/lib/InitialTree.d.ts +1 -1
  242. package/lib/InitialTree.d.ts.map +1 -1
  243. package/lib/InitialTree.js +1 -1
  244. package/lib/InitialTree.js.map +1 -1
  245. package/lib/LazyCheckout.d.ts +5 -5
  246. package/lib/LazyCheckout.d.ts.map +1 -1
  247. package/lib/LazyCheckout.js +1 -1
  248. package/lib/LazyCheckout.js.map +1 -1
  249. package/lib/LogViewer.d.ts +7 -7
  250. package/lib/LogViewer.d.ts.map +1 -1
  251. package/lib/LogViewer.js +4 -4
  252. package/lib/LogViewer.js.map +1 -1
  253. package/lib/MergeHealth.d.ts +1 -1
  254. package/lib/MergeHealth.d.ts.map +1 -1
  255. package/lib/MergeHealth.js +5 -5
  256. package/lib/MergeHealth.js.map +1 -1
  257. package/lib/NodeIdUtilities.d.ts +3 -3
  258. package/lib/NodeIdUtilities.d.ts.map +1 -1
  259. package/lib/NodeIdUtilities.js +2 -2
  260. package/lib/NodeIdUtilities.js.map +1 -1
  261. package/lib/PayloadUtilities.d.ts +1 -1
  262. package/lib/PayloadUtilities.d.ts.map +1 -1
  263. package/lib/PayloadUtilities.js.map +1 -1
  264. package/lib/ReconciliationPath.d.ts +3 -3
  265. package/lib/ReconciliationPath.d.ts.map +1 -1
  266. package/lib/ReconciliationPath.js.map +1 -1
  267. package/lib/RevisionValueCache.js +1 -1
  268. package/lib/RevisionValueCache.js.map +1 -1
  269. package/lib/RevisionView.d.ts +5 -5
  270. package/lib/RevisionView.d.ts.map +1 -1
  271. package/lib/RevisionView.js +3 -3
  272. package/lib/RevisionView.js.map +1 -1
  273. package/lib/SerializationUtilities.d.ts +4 -4
  274. package/lib/SerializationUtilities.d.ts.map +1 -1
  275. package/lib/SerializationUtilities.js +1 -1
  276. package/lib/SerializationUtilities.js.map +1 -1
  277. package/lib/SharedTree.d.ts +15 -18
  278. package/lib/SharedTree.d.ts.map +1 -1
  279. package/lib/SharedTree.js +28 -40
  280. package/lib/SharedTree.js.map +1 -1
  281. package/lib/SharedTreeEncoder.d.ts +8 -8
  282. package/lib/SharedTreeEncoder.d.ts.map +1 -1
  283. package/lib/SharedTreeEncoder.js +12 -12
  284. package/lib/SharedTreeEncoder.js.map +1 -1
  285. package/lib/StringInterner.d.ts +1 -1
  286. package/lib/StringInterner.d.ts.map +1 -1
  287. package/lib/StringInterner.js +1 -1
  288. package/lib/StringInterner.js.map +1 -1
  289. package/lib/Summary.d.ts +4 -4
  290. package/lib/Summary.d.ts.map +1 -1
  291. package/lib/Summary.js +1 -1
  292. package/lib/Summary.js.map +1 -1
  293. package/lib/SummaryBackCompatibility.d.ts +3 -3
  294. package/lib/SummaryBackCompatibility.d.ts.map +1 -1
  295. package/lib/SummaryBackCompatibility.js +3 -3
  296. package/lib/SummaryBackCompatibility.js.map +1 -1
  297. package/lib/SummaryTestUtilities.d.ts +2 -2
  298. package/lib/SummaryTestUtilities.d.ts.map +1 -1
  299. package/lib/SummaryTestUtilities.js.map +1 -1
  300. package/lib/Transaction.d.ts +4 -4
  301. package/lib/Transaction.d.ts.map +1 -1
  302. package/lib/Transaction.js +5 -5
  303. package/lib/Transaction.js.map +1 -1
  304. package/lib/TransactionInternal.d.ts +7 -7
  305. package/lib/TransactionInternal.d.ts.map +1 -1
  306. package/lib/TransactionInternal.js +5 -5
  307. package/lib/TransactionInternal.js.map +1 -1
  308. package/lib/TreeCompressor.d.ts +4 -4
  309. package/lib/TreeCompressor.d.ts.map +1 -1
  310. package/lib/TreeCompressor.js +2 -2
  311. package/lib/TreeCompressor.js.map +1 -1
  312. package/lib/TreeNodeHandle.d.ts +3 -3
  313. package/lib/TreeNodeHandle.d.ts.map +1 -1
  314. package/lib/TreeNodeHandle.js +1 -1
  315. package/lib/TreeNodeHandle.js.map +1 -1
  316. package/lib/TreeView.d.ts +3 -3
  317. package/lib/TreeView.d.ts.map +1 -1
  318. package/lib/TreeView.js +3 -3
  319. package/lib/TreeView.js.map +1 -1
  320. package/lib/TreeViewUtilities.d.ts +2 -2
  321. package/lib/TreeViewUtilities.d.ts.map +1 -1
  322. package/lib/TreeViewUtilities.js +1 -1
  323. package/lib/TreeViewUtilities.js.map +1 -1
  324. package/lib/UndoRedoHandler.d.ts +2 -2
  325. package/lib/UndoRedoHandler.d.ts.map +1 -1
  326. package/lib/UndoRedoHandler.js +2 -2
  327. package/lib/UndoRedoHandler.js.map +1 -1
  328. package/lib/UuidUtilities.d.ts +1 -1
  329. package/lib/UuidUtilities.d.ts.map +1 -1
  330. package/lib/UuidUtilities.js +1 -1
  331. package/lib/UuidUtilities.js.map +1 -1
  332. package/lib/id-compressor/AppendOnlySortedMap.js +1 -1
  333. package/lib/id-compressor/AppendOnlySortedMap.js.map +1 -1
  334. package/lib/id-compressor/IdCompressor.d.ts +2 -2
  335. package/lib/id-compressor/IdCompressor.d.ts.map +1 -1
  336. package/lib/id-compressor/IdCompressor.js +6 -6
  337. package/lib/id-compressor/IdCompressor.js.map +1 -1
  338. package/lib/id-compressor/IdRange.d.ts +1 -1
  339. package/lib/id-compressor/IdRange.d.ts.map +1 -1
  340. package/lib/id-compressor/IdRange.js.map +1 -1
  341. package/lib/id-compressor/NumericUuid.d.ts +1 -1
  342. package/lib/id-compressor/NumericUuid.d.ts.map +1 -1
  343. package/lib/id-compressor/NumericUuid.js +2 -2
  344. package/lib/id-compressor/NumericUuid.js.map +1 -1
  345. package/lib/id-compressor/SessionIdNormalizer.d.ts +2 -2
  346. package/lib/id-compressor/SessionIdNormalizer.d.ts.map +1 -1
  347. package/lib/id-compressor/SessionIdNormalizer.js +2 -2
  348. package/lib/id-compressor/SessionIdNormalizer.js.map +1 -1
  349. package/lib/id-compressor/index.d.ts +4 -4
  350. package/lib/id-compressor/index.d.ts.map +1 -1
  351. package/lib/id-compressor/index.js +3 -3
  352. package/lib/id-compressor/index.js.map +1 -1
  353. package/lib/id-compressor/persisted-types/0.0.1.d.ts +1 -1
  354. package/lib/id-compressor/persisted-types/0.0.1.d.ts.map +1 -1
  355. package/lib/id-compressor/persisted-types/0.0.1.js.map +1 -1
  356. package/lib/id-compressor/persisted-types/index.d.ts +1 -1
  357. package/lib/id-compressor/persisted-types/index.d.ts.map +1 -1
  358. package/lib/id-compressor/persisted-types/index.js.map +1 -1
  359. package/lib/index.d.ts +29 -29
  360. package/lib/index.d.ts.map +1 -1
  361. package/lib/index.js +22 -22
  362. package/lib/index.js.map +1 -1
  363. package/lib/migration-shim/migrationDeltaHandler.d.ts +1 -1
  364. package/lib/migration-shim/migrationDeltaHandler.d.ts.map +1 -1
  365. package/lib/migration-shim/migrationDeltaHandler.js +5 -8
  366. package/lib/migration-shim/migrationDeltaHandler.js.map +1 -1
  367. package/lib/migration-shim/migrationShim.d.ts +1 -1
  368. package/lib/migration-shim/migrationShim.d.ts.map +1 -1
  369. package/lib/migration-shim/migrationShim.js +1 -1
  370. package/lib/migration-shim/migrationShim.js.map +1 -1
  371. package/lib/migration-shim/migrationShimFactory.d.ts +1 -1
  372. package/lib/migration-shim/migrationShimFactory.d.ts.map +1 -1
  373. package/lib/migration-shim/migrationShimFactory.js.map +1 -1
  374. package/lib/migration-shim/sharedTreeDeltaHandler.d.ts +1 -1
  375. package/lib/migration-shim/sharedTreeDeltaHandler.d.ts.map +1 -1
  376. package/lib/migration-shim/sharedTreeDeltaHandler.js +2 -5
  377. package/lib/migration-shim/sharedTreeDeltaHandler.js.map +1 -1
  378. package/lib/migration-shim/types.d.ts +1 -1
  379. package/lib/migration-shim/types.d.ts.map +1 -1
  380. package/lib/migration-shim/types.js.map +1 -1
  381. package/lib/persisted-types/0.0.2.d.ts +1 -1
  382. package/lib/persisted-types/0.0.2.d.ts.map +1 -1
  383. package/lib/persisted-types/0.0.2.js.map +1 -1
  384. package/lib/persisted-types/0.1.1.d.ts +4 -4
  385. package/lib/persisted-types/0.1.1.d.ts.map +1 -1
  386. package/lib/persisted-types/0.1.1.js +2 -2
  387. package/lib/persisted-types/0.1.1.js.map +1 -1
  388. package/lib/persisted-types/index.d.ts +2 -2
  389. package/lib/persisted-types/index.d.ts.map +1 -1
  390. package/lib/persisted-types/index.js +2 -2
  391. package/lib/persisted-types/index.js.map +1 -1
  392. package/lib/test/AppendOnlySortedMap.perf.tests.js +2 -2
  393. package/lib/test/AppendOnlySortedMap.perf.tests.js.map +1 -1
  394. package/lib/test/AppendOnlySortedMap.tests.js +2 -2
  395. package/lib/test/AppendOnlySortedMap.tests.js.map +1 -1
  396. package/lib/test/ChangeCompression.tests.js +9 -9
  397. package/lib/test/ChangeCompression.tests.js.map +1 -1
  398. package/lib/test/Checkout.tests.d.ts +1 -1
  399. package/lib/test/Checkout.tests.d.ts.map +1 -1
  400. package/lib/test/Checkout.tests.js +2 -2
  401. package/lib/test/Checkout.tests.js.map +1 -1
  402. package/lib/test/Common.tests.js +1 -1
  403. package/lib/test/Common.tests.js.map +1 -1
  404. package/lib/test/EagerCheckout.tests.js +4 -4
  405. package/lib/test/EagerCheckout.tests.js.map +1 -1
  406. package/lib/test/Edit.tests.js +2 -2
  407. package/lib/test/Edit.tests.js.map +1 -1
  408. package/lib/test/EditLog.perf.tests.js +4 -4
  409. package/lib/test/EditLog.perf.tests.js.map +1 -1
  410. package/lib/test/EditLog.tests.js +3 -3
  411. package/lib/test/EditLog.tests.js.map +1 -1
  412. package/lib/test/EditUtilities.tests.js +6 -6
  413. package/lib/test/EditUtilities.tests.js.map +1 -1
  414. package/lib/test/Forest.perf.tests.js +4 -4
  415. package/lib/test/Forest.perf.tests.js.map +1 -1
  416. package/lib/test/Forest.tests.js +2 -2
  417. package/lib/test/Forest.tests.js.map +1 -1
  418. package/lib/test/GenericTransaction.tests.js +3 -3
  419. package/lib/test/GenericTransaction.tests.js.map +1 -1
  420. package/lib/test/HistoryEditFactory.tests.js +4 -4
  421. package/lib/test/HistoryEditFactory.tests.js.map +1 -1
  422. package/lib/test/IdCompressor.perf.tests.js +4 -4
  423. package/lib/test/IdCompressor.perf.tests.js.map +1 -1
  424. package/lib/test/IdCompressor.tests.js +7 -7
  425. package/lib/test/IdCompressor.tests.js.map +1 -1
  426. package/lib/test/IdConversion.tests.js +3 -3
  427. package/lib/test/IdConversion.tests.js.map +1 -1
  428. package/lib/test/LazyCheckout.tests.js +4 -4
  429. package/lib/test/LazyCheckout.tests.js.map +1 -1
  430. package/lib/test/LogViewer.tests.js +12 -12
  431. package/lib/test/LogViewer.tests.js.map +1 -1
  432. package/lib/test/MergeHealthTelemetryHeartbeat.tests.js +6 -6
  433. package/lib/test/MergeHealthTelemetryHeartbeat.tests.js.map +1 -1
  434. package/lib/test/NumericUuid.perf.tests.js +3 -3
  435. package/lib/test/NumericUuid.perf.tests.js.map +1 -1
  436. package/lib/test/NumericUuid.tests.js +4 -4
  437. package/lib/test/NumericUuid.tests.js.map +1 -1
  438. package/lib/test/RevisionValueCache.tests.js +2 -2
  439. package/lib/test/RevisionValueCache.tests.js.map +1 -1
  440. package/lib/test/RevisionView.tests.js +6 -6
  441. package/lib/test/RevisionView.tests.js.map +1 -1
  442. package/lib/test/SessionIdNormalizer.tests.js +3 -3
  443. package/lib/test/SessionIdNormalizer.tests.js.map +1 -1
  444. package/lib/test/SharedTree.fuzz.tests.js +1 -1
  445. package/lib/test/SharedTree.fuzz.tests.js.map +1 -1
  446. package/lib/test/SharedTree.perf.tests.js +2 -2
  447. package/lib/test/SharedTree.perf.tests.js.map +1 -1
  448. package/lib/test/SharedTree.tests.js +7 -7
  449. package/lib/test/SharedTree.tests.js.map +1 -1
  450. package/lib/test/StringInterner.tests.js +1 -1
  451. package/lib/test/StringInterner.tests.js.map +1 -1
  452. package/lib/test/Summary.tests.d.ts +2 -2
  453. package/lib/test/Summary.tests.d.ts.map +1 -1
  454. package/lib/test/Summary.tests.js +14 -14
  455. package/lib/test/Summary.tests.js.map +1 -1
  456. package/lib/test/Transaction.tests.js +5 -5
  457. package/lib/test/Transaction.tests.js.map +1 -1
  458. package/lib/test/TransactionInternal.tests.js +7 -7
  459. package/lib/test/TransactionInternal.tests.js.map +1 -1
  460. package/lib/test/TreeCompression.tests.js +8 -8
  461. package/lib/test/TreeCompression.tests.js.map +1 -1
  462. package/lib/test/TreeView.tests.js +3 -3
  463. package/lib/test/TreeView.tests.js.map +1 -1
  464. package/lib/test/UndoRedoHandler.tests.js +2 -2
  465. package/lib/test/UndoRedoHandler.tests.js.map +1 -1
  466. package/lib/test/fuzz/Generators.d.ts +1 -1
  467. package/lib/test/fuzz/Generators.d.ts.map +1 -1
  468. package/lib/test/fuzz/Generators.js +4 -4
  469. package/lib/test/fuzz/Generators.js.map +1 -1
  470. package/lib/test/fuzz/SharedTreeFuzzTests.d.ts +1 -1
  471. package/lib/test/fuzz/SharedTreeFuzzTests.d.ts.map +1 -1
  472. package/lib/test/fuzz/SharedTreeFuzzTests.js +5 -5
  473. package/lib/test/fuzz/SharedTreeFuzzTests.js.map +1 -1
  474. package/lib/test/fuzz/Types.d.ts +6 -6
  475. package/lib/test/fuzz/Types.d.ts.map +1 -1
  476. package/lib/test/fuzz/Types.js.map +1 -1
  477. package/lib/test/utilities/IdCompressorTestUtilities.d.ts +6 -6
  478. package/lib/test/utilities/IdCompressorTestUtilities.d.ts.map +1 -1
  479. package/lib/test/utilities/IdCompressorTestUtilities.js +6 -6
  480. package/lib/test/utilities/IdCompressorTestUtilities.js.map +1 -1
  481. package/lib/test/utilities/MockTransaction.d.ts +4 -4
  482. package/lib/test/utilities/MockTransaction.d.ts.map +1 -1
  483. package/lib/test/utilities/MockTransaction.js +3 -3
  484. package/lib/test/utilities/MockTransaction.js.map +1 -1
  485. package/lib/test/utilities/PendingLocalStateTests.d.ts +1 -1
  486. package/lib/test/utilities/PendingLocalStateTests.d.ts.map +1 -1
  487. package/lib/test/utilities/PendingLocalStateTests.js +5 -5
  488. package/lib/test/utilities/PendingLocalStateTests.js.map +1 -1
  489. package/lib/test/utilities/SharedTreeTests.d.ts +2 -2
  490. package/lib/test/utilities/SharedTreeTests.d.ts.map +1 -1
  491. package/lib/test/utilities/SharedTreeTests.js +22 -22
  492. package/lib/test/utilities/SharedTreeTests.js.map +1 -1
  493. package/lib/test/utilities/SharedTreeVersioningTests.d.ts +1 -1
  494. package/lib/test/utilities/SharedTreeVersioningTests.d.ts.map +1 -1
  495. package/lib/test/utilities/SharedTreeVersioningTests.js +10 -10
  496. package/lib/test/utilities/SharedTreeVersioningTests.js.map +1 -1
  497. package/lib/test/utilities/SummaryLoadPerfTests.js +6 -6
  498. package/lib/test/utilities/SummaryLoadPerfTests.js.map +1 -1
  499. package/lib/test/utilities/SummarySizeTests.d.ts +1 -1
  500. package/lib/test/utilities/SummarySizeTests.d.ts.map +1 -1
  501. package/lib/test/utilities/SummarySizeTests.js +5 -5
  502. package/lib/test/utilities/SummarySizeTests.js.map +1 -1
  503. package/lib/test/utilities/TestNode.d.ts +6 -6
  504. package/lib/test/utilities/TestNode.d.ts.map +1 -1
  505. package/lib/test/utilities/TestNode.js +5 -5
  506. package/lib/test/utilities/TestNode.js.map +1 -1
  507. package/lib/test/utilities/TestUtilities.d.ts +12 -12
  508. package/lib/test/utilities/TestUtilities.d.ts.map +1 -1
  509. package/lib/test/utilities/TestUtilities.js +18 -19
  510. package/lib/test/utilities/TestUtilities.js.map +1 -1
  511. package/lib/test/utilities/UndoRedoTests.d.ts +2 -2
  512. package/lib/test/utilities/UndoRedoTests.d.ts.map +1 -1
  513. package/lib/test/utilities/UndoRedoTests.js +7 -7
  514. package/lib/test/utilities/UndoRedoTests.js.map +1 -1
  515. package/package.json +57 -31
  516. package/src/ChangeCompression.ts +7 -7
  517. package/src/ChangeTypes.ts +5 -5
  518. package/src/Checkout.ts +13 -13
  519. package/src/Common.ts +2 -2
  520. package/src/EagerCheckout.ts +3 -3
  521. package/src/EditLog.ts +6 -7
  522. package/src/EditUtilities.ts +10 -10
  523. package/src/Forest.ts +4 -4
  524. package/src/HistoryEditFactory.ts +11 -11
  525. package/src/IdConversion.ts +4 -4
  526. package/src/InitialTree.ts +3 -3
  527. package/src/LazyCheckout.ts +5 -5
  528. package/src/LogViewer.ts +8 -8
  529. package/src/MergeHealth.ts +6 -6
  530. package/src/NodeIdUtilities.ts +4 -4
  531. package/src/PayloadUtilities.ts +1 -1
  532. package/src/ReconciliationPath.ts +3 -3
  533. package/src/RevisionValueCache.ts +1 -1
  534. package/src/RevisionView.ts +7 -7
  535. package/src/SerializationUtilities.ts +5 -5
  536. package/src/SharedTree.ts +34 -54
  537. package/src/SharedTreeEncoder.ts +15 -15
  538. package/src/StringInterner.ts +2 -2
  539. package/src/Summary.ts +5 -5
  540. package/src/SummaryBackCompatibility.ts +10 -5
  541. package/src/SummaryTestUtilities.ts +3 -3
  542. package/src/Transaction.ts +8 -8
  543. package/src/TransactionInternal.ts +8 -8
  544. package/src/TreeCompressor.ts +6 -6
  545. package/src/TreeNodeHandle.ts +4 -4
  546. package/src/TreeView.ts +4 -4
  547. package/src/TreeViewUtilities.ts +3 -3
  548. package/src/UndoRedoHandler.ts +4 -4
  549. package/src/UuidUtilities.ts +2 -2
  550. package/src/id-compressor/AppendOnlySortedMap.ts +1 -1
  551. package/src/id-compressor/IdCompressor.ts +8 -8
  552. package/src/id-compressor/IdRange.ts +1 -1
  553. package/src/id-compressor/NumericUuid.ts +3 -3
  554. package/src/id-compressor/SessionIdNormalizer.ts +4 -4
  555. package/src/id-compressor/index.ts +4 -4
  556. package/src/id-compressor/persisted-types/0.0.1.ts +1 -1
  557. package/src/id-compressor/persisted-types/index.ts +1 -1
  558. package/src/index.ts +29 -29
  559. package/src/migration-shim/migrationDeltaHandler.ts +9 -10
  560. package/src/migration-shim/migrationShim.ts +7 -5
  561. package/src/migration-shim/migrationShimFactory.ts +4 -1
  562. package/src/migration-shim/sharedTreeDeltaHandler.ts +7 -6
  563. package/src/migration-shim/types.ts +1 -1
  564. package/src/persisted-types/0.0.2.ts +1 -1
  565. package/src/persisted-types/0.1.1.ts +4 -4
  566. package/src/persisted-types/index.ts +2 -2
  567. package/tsconfig.esnext.json +1 -2
  568. package/tsconfig.json +3 -0
  569. package/lib/test/Attach.tests.d.ts +0 -6
  570. package/lib/test/Attach.tests.d.ts.map +0 -1
  571. package/lib/test/Attach.tests.js +0 -52
  572. package/lib/test/Attach.tests.js.map +0 -1
@@ -3,9 +3,9 @@
3
3
  * Licensed under the MIT License.
4
4
  */
5
5
  import { expect } from 'chai';
6
- import { StablePlace, StableRange } from '../ChangeTypes';
7
- import { convertStablePlaceIds, convertStableRangeIds, convertNodeDataIds } from '../IdConversion';
8
- import { refreshTestTree, areNodesEquivalent } from './utilities/TestUtilities';
6
+ import { StablePlace, StableRange } from '../ChangeTypes.js';
7
+ import { convertStablePlaceIds, convertStableRangeIds, convertNodeDataIds } from '../IdConversion.js';
8
+ import { refreshTestTree, areNodesEquivalent } from './utilities/TestUtilities.js';
9
9
  describe('0_0_2 type conversions', () => {
10
10
  const testTree = refreshTestTree();
11
11
  it('can convert stable places', () => {
@@ -1 +1 @@
1
- {"version":3,"file":"IdConversion.tests.js","sourceRoot":"","sources":["../../src/test/IdConversion.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC1D,OAAO,EAAE,qBAAqB,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AAEnG,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAEhF,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;IACvC,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAC;IAEnC,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACpC,MAAM,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrD,MAAM,yBAAyB,GAAG,qBAAqB,CAAC,WAAW,EAAE,iBAAiB,CAAC,CAAC;QACxF,MAAM,oBAAoB,GAAG,qBAAqB,CAAC,yBAAyB,EAAE,eAAe,CAAC,CAAC;QAC/F,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACpC,MAAM,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACpD,MAAM,yBAAyB,GAAG,qBAAqB,CAAC,WAAW,EAAE,iBAAiB,CAAC,CAAC;QACxF,MAAM,oBAAoB,GAAG,qBAAqB,CAAC,yBAAyB,EAAE,eAAe,CAAC,CAAC;QAC/F,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;QAChC,MAAM,QAAQ,GAAG,QAAQ,CAAC;QAC1B,MAAM,cAAc,GAAG,kBAAkB,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC;QACvE,MAAM,iBAAiB,GAAG,kBAAkB,CAAC,cAAc,EAAE,eAAe,CAAC,CAAC;QAC9E,MAAM,CAAC,kBAAkB,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,SAAS,iBAAiB,CAAC,EAAU;QACpC,OAAO,QAAQ,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC;IAC3C,CAAC;IAED,SAAS,eAAe,CAAC,EAAgB;QACxC,OAAO,QAAQ,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;IACrC,CAAC;AACF,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { expect } from 'chai';\nimport { StablePlace, StableRange } from '../ChangeTypes';\nimport { convertStablePlaceIds, convertStableRangeIds, convertNodeDataIds } from '../IdConversion';\nimport { NodeId, StableNodeId } from '../Identifiers';\nimport { refreshTestTree, areNodesEquivalent } from './utilities/TestUtilities';\n\ndescribe('0_0_2 type conversions', () => {\n\tconst testTree = refreshTestTree();\n\n\tit('can convert stable places', () => {\n\t\tconst stablePlace = StablePlace.after(testTree.left);\n\t\tconst stablePlaceInternal_0_0_2 = convertStablePlaceIds(stablePlace, convertToStableId);\n\t\tconst stablePlaceConverted = convertStablePlaceIds(stablePlaceInternal_0_0_2, convertToNodeId);\n\t\texpect(stablePlace).to.deep.equal(stablePlaceConverted);\n\t});\n\n\tit('can convert stable ranges', () => {\n\t\tconst stableRange = StableRange.only(testTree.left);\n\t\tconst stableRangeInternal_0_0_2 = convertStableRangeIds(stableRange, convertToStableId);\n\t\tconst stableRangeConverted = convertStableRangeIds(stableRangeInternal_0_0_2, convertToNodeId);\n\t\texpect(stableRange).to.deep.equal(stableRangeConverted);\n\t});\n\n\tit('can convert node data', () => {\n\t\tconst nodeData = testTree;\n\t\tconst nodeData_0_0_2 = convertNodeDataIds(nodeData, convertToStableId);\n\t\tconst nodeDataConverted = convertNodeDataIds(nodeData_0_0_2, convertToNodeId);\n\t\texpect(areNodesEquivalent(nodeData, nodeDataConverted)).to.be.true;\n\t});\n\n\tfunction convertToStableId(id: NodeId): StableNodeId {\n\t\treturn testTree.convertToStableNodeId(id);\n\t}\n\n\tfunction convertToNodeId(id: StableNodeId): NodeId {\n\t\treturn testTree.convertToNodeId(id);\n\t}\n});\n"]}
1
+ {"version":3,"file":"IdConversion.tests.js","sourceRoot":"","sources":["../../src/test/IdConversion.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAC7D,OAAO,EAAE,qBAAqB,EAAE,qBAAqB,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAEtG,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAEnF,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;IACvC,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAC;IAEnC,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACpC,MAAM,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrD,MAAM,yBAAyB,GAAG,qBAAqB,CAAC,WAAW,EAAE,iBAAiB,CAAC,CAAC;QACxF,MAAM,oBAAoB,GAAG,qBAAqB,CAAC,yBAAyB,EAAE,eAAe,CAAC,CAAC;QAC/F,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACpC,MAAM,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACpD,MAAM,yBAAyB,GAAG,qBAAqB,CAAC,WAAW,EAAE,iBAAiB,CAAC,CAAC;QACxF,MAAM,oBAAoB,GAAG,qBAAqB,CAAC,yBAAyB,EAAE,eAAe,CAAC,CAAC;QAC/F,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;QAChC,MAAM,QAAQ,GAAG,QAAQ,CAAC;QAC1B,MAAM,cAAc,GAAG,kBAAkB,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC;QACvE,MAAM,iBAAiB,GAAG,kBAAkB,CAAC,cAAc,EAAE,eAAe,CAAC,CAAC;QAC9E,MAAM,CAAC,kBAAkB,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,SAAS,iBAAiB,CAAC,EAAU;QACpC,OAAO,QAAQ,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC;IAC3C,CAAC;IAED,SAAS,eAAe,CAAC,EAAgB;QACxC,OAAO,QAAQ,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;IACrC,CAAC;AACF,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { expect } from 'chai';\nimport { StablePlace, StableRange } from '../ChangeTypes.js';\nimport { convertStablePlaceIds, convertStableRangeIds, convertNodeDataIds } from '../IdConversion.js';\nimport { NodeId, StableNodeId } from '../Identifiers.js';\nimport { refreshTestTree, areNodesEquivalent } from './utilities/TestUtilities.js';\n\ndescribe('0_0_2 type conversions', () => {\n\tconst testTree = refreshTestTree();\n\n\tit('can convert stable places', () => {\n\t\tconst stablePlace = StablePlace.after(testTree.left);\n\t\tconst stablePlaceInternal_0_0_2 = convertStablePlaceIds(stablePlace, convertToStableId);\n\t\tconst stablePlaceConverted = convertStablePlaceIds(stablePlaceInternal_0_0_2, convertToNodeId);\n\t\texpect(stablePlace).to.deep.equal(stablePlaceConverted);\n\t});\n\n\tit('can convert stable ranges', () => {\n\t\tconst stableRange = StableRange.only(testTree.left);\n\t\tconst stableRangeInternal_0_0_2 = convertStableRangeIds(stableRange, convertToStableId);\n\t\tconst stableRangeConverted = convertStableRangeIds(stableRangeInternal_0_0_2, convertToNodeId);\n\t\texpect(stableRange).to.deep.equal(stableRangeConverted);\n\t});\n\n\tit('can convert node data', () => {\n\t\tconst nodeData = testTree;\n\t\tconst nodeData_0_0_2 = convertNodeDataIds(nodeData, convertToStableId);\n\t\tconst nodeDataConverted = convertNodeDataIds(nodeData_0_0_2, convertToNodeId);\n\t\texpect(areNodesEquivalent(nodeData, nodeDataConverted)).to.be.true;\n\t});\n\n\tfunction convertToStableId(id: NodeId): StableNodeId {\n\t\treturn testTree.convertToStableNodeId(id);\n\t}\n\n\tfunction convertToNodeId(id: StableNodeId): NodeId {\n\t\treturn testTree.convertToNodeId(id);\n\t}\n});\n"]}
@@ -3,10 +3,10 @@
3
3
  * Licensed under the MIT License.
4
4
  */
5
5
  import { expect } from 'chai';
6
- import { Change, StableRange } from '../ChangeTypes';
7
- import { LazyCheckout } from '../LazyCheckout';
8
- import { checkoutTests } from './Checkout.tests';
9
- import { setUpTestSharedTree, setUpTestTree } from './utilities/TestUtilities';
6
+ import { Change, StableRange } from '../ChangeTypes.js';
7
+ import { LazyCheckout } from '../LazyCheckout.js';
8
+ import { checkoutTests } from './Checkout.tests.js';
9
+ import { setUpTestSharedTree, setUpTestTree } from './utilities/TestUtilities.js';
10
10
  checkoutTests('LazyCheckout', async (tree) => Promise.resolve(new LazyCheckout(tree)), () => {
11
11
  it('updates lazily', async () => {
12
12
  const { tree } = setUpTestSharedTree();
@@ -1 +1 @@
1
- {"version":3,"file":"LazyCheckout.tests.js","sourceRoot":"","sources":["../../src/test/LazyCheckout.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AACrD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,mBAAmB,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAE/E,aAAa,CACZ,cAAc,EACd,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,EACvD,GAAG,EAAE;IACJ,EAAE,CAAC,gBAAgB,EAAE,KAAK,IAAI,EAAE;QAC/B,MAAM,EAAE,IAAI,EAAE,GAAG,mBAAmB,EAAE,CAAC;QACvC,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;QACxC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QACjE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/D,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QAClE,MAAM,QAAQ,CAAC,qBAAqB,EAAE,CAAC;QACvC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;IAClE,CAAC,CAAC,CAAC;AACJ,CAAC,CACD,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { expect } from 'chai';\nimport { Change, StableRange } from '../ChangeTypes';\nimport { LazyCheckout } from '../LazyCheckout';\nimport { checkoutTests } from './Checkout.tests';\nimport { setUpTestSharedTree, setUpTestTree } from './utilities/TestUtilities';\n\ncheckoutTests(\n\t'LazyCheckout',\n\tasync (tree) => Promise.resolve(new LazyCheckout(tree)),\n\t() => {\n\t\tit('updates lazily', async () => {\n\t\t\tconst { tree } = setUpTestSharedTree();\n\t\t\tconst testTree = setUpTestTree(tree);\n\t\t\tconst checkout = new LazyCheckout(tree);\n\t\t\texpect(tree.currentView.equals(checkout.currentView)).to.be.true;\n\t\t\ttree.applyEdit(Change.delete(StableRange.only(testTree.left)));\n\t\t\texpect(tree.currentView.equals(checkout.currentView)).to.be.false;\n\t\t\tawait checkout.waitForPendingUpdates();\n\t\t\texpect(tree.currentView.equals(checkout.currentView)).to.be.true;\n\t\t});\n\t}\n);\n"]}
1
+ {"version":3,"file":"LazyCheckout.tests.js","sourceRoot":"","sources":["../../src/test/LazyCheckout.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACxD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EAAE,mBAAmB,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAElF,aAAa,CACZ,cAAc,EACd,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,EACvD,GAAG,EAAE;IACJ,EAAE,CAAC,gBAAgB,EAAE,KAAK,IAAI,EAAE;QAC/B,MAAM,EAAE,IAAI,EAAE,GAAG,mBAAmB,EAAE,CAAC;QACvC,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;QACxC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QACjE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/D,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QAClE,MAAM,QAAQ,CAAC,qBAAqB,EAAE,CAAC;QACvC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;IAClE,CAAC,CAAC,CAAC;AACJ,CAAC,CACD,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { expect } from 'chai';\nimport { Change, StableRange } from '../ChangeTypes.js';\nimport { LazyCheckout } from '../LazyCheckout.js';\nimport { checkoutTests } from './Checkout.tests.js';\nimport { setUpTestSharedTree, setUpTestTree } from './utilities/TestUtilities.js';\n\ncheckoutTests(\n\t'LazyCheckout',\n\tasync (tree) => Promise.resolve(new LazyCheckout(tree)),\n\t() => {\n\t\tit('updates lazily', async () => {\n\t\t\tconst { tree } = setUpTestSharedTree();\n\t\t\tconst testTree = setUpTestTree(tree);\n\t\t\tconst checkout = new LazyCheckout(tree);\n\t\t\texpect(tree.currentView.equals(checkout.currentView)).to.be.true;\n\t\t\ttree.applyEdit(Change.delete(StableRange.only(testTree.left)));\n\t\t\texpect(tree.currentView.equals(checkout.currentView)).to.be.false;\n\t\t\tawait checkout.waitForPendingUpdates();\n\t\t\texpect(tree.currentView.equals(checkout.currentView)).to.be.true;\n\t\t});\n\t}\n);\n"]}
@@ -6,18 +6,18 @@ import { strict as assert } from 'assert';
6
6
  import { expect } from 'chai';
7
7
  import { v4 as uuidv4 } from 'uuid';
8
8
  import { validateAssertionError } from '@fluidframework/test-runtime-utils';
9
- import { EditLog } from '../EditLog';
10
- import { CachingLogViewer, CachingLogViewerDiagnosticEvents, } from '../LogViewer';
11
- import { copyPropertyIfDefined, fail } from '../Common';
12
- import { initialTree } from '../InitialTree';
13
- import { ChangeInternal, ChangeTypeInternal, ConstraintEffect, EditStatus, StablePlaceInternal, } from '../persisted-types';
14
- import { areRevisionViewsSemanticallyEqual, newEdit } from '../EditUtilities';
15
- import { RevisionView } from '../RevisionView';
16
- import { TransactionInternal } from '../TransactionInternal';
17
- import { StableRange } from '../ChangeTypes';
18
- import { expectDefined } from './utilities/TestCommon';
19
- import { buildLeaf } from './utilities/TestNode';
20
- import { refreshTestTree, testTraitLabel } from './utilities/TestUtilities';
9
+ import { EditLog } from '../EditLog.js';
10
+ import { CachingLogViewer, CachingLogViewerDiagnosticEvents, } from '../LogViewer.js';
11
+ import { copyPropertyIfDefined, fail } from '../Common.js';
12
+ import { initialTree } from '../InitialTree.js';
13
+ import { ChangeInternal, ChangeTypeInternal, ConstraintEffect, EditStatus, StablePlaceInternal, } from '../persisted-types/index.js';
14
+ import { areRevisionViewsSemanticallyEqual, newEdit } from '../EditUtilities.js';
15
+ import { RevisionView } from '../RevisionView.js';
16
+ import { TransactionInternal } from '../TransactionInternal.js';
17
+ import { StableRange } from '../ChangeTypes.js';
18
+ import { expectDefined } from './utilities/TestCommon.js';
19
+ import { buildLeaf } from './utilities/TestNode.js';
20
+ import { refreshTestTree, testTraitLabel } from './utilities/TestUtilities.js';
21
21
  /**
22
22
  * Creates an {@link EditLog} and accompanying {@link RevisionView} with pre-existing edits.
23
23
  *
@@ -1 +1 @@
1
- {"version":3,"file":"LogViewer.tests.js","sourceRoot":"","sources":["../../src/test/LogViewer.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,EAAE,IAAI,MAAM,EAAE,MAAM,MAAM,CAAC;AACpC,OAAO,EAAE,sBAAsB,EAAE,MAAM,oCAAoC,CAAC;AAC5E,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AACrC,OAAO,EACN,gBAAgB,EAChB,gCAAgC,GAKhC,MAAM,cAAc,CAAC;AAEtB,OAAO,EAAE,qBAAqB,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACxD,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EACN,cAAc,EAEd,kBAAkB,EAClB,gBAAgB,EAEhB,UAAU,EAEV,mBAAmB,GACnB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,iCAAiC,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAE9E,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAC7D,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAY,MAAM,sBAAsB,CAAC;AAC3D,OAAO,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,2BAA2B,CAAC;AAE5E;;;;;;GAMG;AACH,SAAS,cAAc,CAAC,QAAkB;IACzC,MAAM,GAAG,GAAG,IAAI,OAAO,EAAkB,CAAC;IAC1C,GAAG,CAAC,gBAAgB,CACnB,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAC9C,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAC1D,CACD,EACD,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CACjD,CAAC;IACF,GAAG,CAAC,gBAAgB,CACnB,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,EAC/C,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAC3D,CACD,EACD,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CACjD,CAAC;IAEF,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,SAAS,kBAAkB,CAAC,aAA4B,EAAE,QAAgB;IACzE,MAAM,GAAG,GAAG,IAAI,OAAO,EAAkB,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;QAClC,GAAG,CAAC,gBAAgB,CACnB,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,SAAS,CAAC,aAAa,CAAC,cAAc,EAAE,CAAC,CAAC,EAC3C,mBAAmB,CAAC,SAAS,CAAC;YAC7B,KAAK,EAAE,cAAc;YACrB,MAAM,EAAE,aAAa,CAAC,eAAe,CAAC,WAAW,CAAC,UAAU,CAAC;SAC7D,CAAC,CACF,CACD,EACD;YACC,cAAc,EAAE,CAAC,GAAG,CAAC;YACrB,uBAAuB,EAAE,CAAC;SAC1B,CACD,CAAC;KACF;IAED,OAAO,GAAG,CAAC;AACZ,CAAC;AAED;;;;;GAKG;AACH,SAAS,oBAAoB,CAAC,QAAkB;IAC/C,MAAM,IAAI,GAAe,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IAC1G,qBAAqB,CAAC,QAAQ,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;IACjD,OAAO,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,0BAA0B,CAAC,QAAkB;IACrD,MAAM,iBAAiB,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;IACnD,iBAAiB,CAAC,YAAY,CAC7B,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CACxD,CACD,CACD,CAAC;IACF,iBAAiB,CAAC,YAAY,CAC7B,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CACzD,CACD,CACD,CAAC;IACF,iBAAiB,CAAC,YAAY,CAC7B,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CACxD,CACD,CACD,CAAC;IACF,OAAO,iBAAiB,CAAC;AAC1B,CAAC;AAED,SAAS,cAAc,CAAC,GAA4B,EAAE,QAAsB;IAC3E,MAAM,KAAK,GAAmB,CAAC,QAAQ,CAAC,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,IAAI,GAAG,GAAG,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAChE,MAAM,MAAM,GAAG,mBAAmB,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC;QACxF,IAAI,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,EAAE;YACzC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;SACzB;aAAM;YACN,MAAM,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;SACpC;KACD;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,4BAA4B,CACpC,aAAkF;IAElF,OAAO,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QACjC,IAAI,SAAkC,CAAC;QACvC,IAAI,iBAA+B,CAAC;QACpC,IAAI,oBAAkC,CAAC;QACvC,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE;YACjD,iBAAiB,GAAG,oBAAoB,CAAC,CAAC,CAAC,CAAC;YAC5C,SAAS,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YAC9B,oBAAoB,GAAG,CAAC,CAAC,IAAI,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;YAChE,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,OAAO,EAAE,EAAE,iBAAiB,CAAC,CAAC;YAC/D,MAAM,QAAQ,GAAG,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;YACnD,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,CAAC,YAAY,CAAC,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACtF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACtD,MAAM,MAAM,GAAG,aAAa,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;YAC3D,MAAM,QAAQ,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YAC1E,MAAM,CAAC,iCAAiC,CAAC,QAAQ,EAAE,QAAQ,EAAE,oBAAoB,EAAE,QAAQ,CAAC,CAAC,CAAC;YAC9F,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;YACzD,MAAM,QAAQ,GAAG,aAAa,CAAC,YAAY,CAAC,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC,CAAC;YAC7E,MAAM,QAAQ,GAAG,EAAE,CAAC;YACpB,MAAM,MAAM,GAAG,aAAa,CAAC,kBAAkB,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC/E,MAAM,eAAe,GAAG,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;YAC1D,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;YACpD,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,WAAW,GAAG,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,SAAS,GAAG;gBACjB,KAAK,EAAE,cAAc;gBACrB,MAAM,EAAE,QAAQ,CAAC,eAAe,CAAC,WAAW,CAAC,UAAU,CAAC;aACxD,CAAC;YACF,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3D,MAAM,WAAW,GAAG,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3D,MAAM,SAAS,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YAC3E,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACjE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;YAClE,MAAM,UAAU,GAAG,IAAI,OAAO,EAAkB,CAAC;YACjD,MAAM,MAAM,GAAG,aAAa,CAAC,UAAU,EAAE,iBAAiB,CAAC,CAAC;YAC5D,MAAM,WAAW,GAAG,cAAc,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;YACjE,mGAAmG;YACnG,uHAAuH;YACvH,yFAAyF;YACzF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBAC5C,MAAM,UAAU,GAAG,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;oBACrD,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;iBACrD;gBACD,uFAAuF;gBACvF,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE;oBACzB,MAAM,IAAI,GAAG,SAAS,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC;oBACtE,UAAU,CAAC,gBAAgB,CAAC,IAAI,EAAE,EAAE,cAAc,EAAE,CAAC,GAAG,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;iBACzF;aACD;QACF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4GAA4G,EAAE,GAAG,EAAE;YACrH,SAAS,kBAAkB,CAAC,MAAiB,EAAE,YAAoB;gBAClE,MAAM,KAAK,GAAmB,EAAE,CAAC;gBACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,YAAY,EAAE,CAAC,EAAE,EAAE;oBACvC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC9C;gBACD,OAAO,KAAK,CAAC;YACd,CAAC;YAED,SAAS,mBAAmB,CAAC,GAA4B,EAAE,MAAiB;gBAC3E,MAAM,WAAW,GAAG,cAAc,CAAC,GAAG,EAAE,iBAAiB,CAAC,CAAC;gBAC3D,MAAM,cAAc,GAAG,kBAAkB,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC9D,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;gBAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBAC5C,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;iBAC5D;YACF,CAAC;YAED,MAAM,iBAAiB,GAAG,0BAA0B,CAAC,QAAQ,CAAC,CAAC;YAC/D,MAAM,MAAM,GAAG,aAAa,CAAC,iBAAiB,EAAE,iBAAiB,CAAC,CAAC;YACnE,mBAAmB,CAAC,iBAAiB,EAAE,MAAM,CAAC,CAAC;YAE/C,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,kFAAkF;YAClF,OAAO,iBAAiB,CAAC,kBAAkB,GAAG,CAAC,EAAE;gBAChD,8BAA8B;gBAC9B,iBAAiB,CAAC,gBAAgB,CACjC,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAC3D,CACD,EACD,EAAE,cAAc,EAAE,SAAS,EAAE,uBAAuB,EAAE,SAAS,GAAG,CAAC,EAAE,CACrE,CAAC;gBACF,EAAE,SAAS,CAAC;gBACZ,mBAAmB,CAAC,iBAAiB,EAAE,MAAM,CAAC,CAAC;gBAC/C,wBAAwB;gBACxB,iBAAiB,CAAC,gBAAgB,CACjC,iBAAiB,CAAC,iBAAiB,CAAC,iBAAiB,CAAC,sBAAsB,CAAC;oBAC5E,IAAI,CAAC,gBAAgB,CAAC,EACvB,EAAE,cAAc,EAAE,SAAS,EAAE,uBAAuB,EAAE,SAAS,GAAG,CAAC,EAAE,CACrE,CAAC;gBACF,EAAE,SAAS,CAAC;gBACZ,mBAAmB,CAAC,iBAAiB,EAAE,MAAM,CAAC,CAAC;aAC/C;QACF,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IACjC,2DAA2D;IAC3D,IAAI,SAAkC,CAAC;IACvC,IAAI,iBAA+B,CAAC;IACpC,IAAI,oBAAkC,CAAC;IACvC,gHAAgH;IAChH,IAAI,qBAAmC,CAAC;IACxC,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE;QACjD,iBAAiB,GAAG,oBAAoB,CAAC,CAAC,CAAC,CAAC;QAC5C,SAAS,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAC9B,oBAAoB,GAAG,CAAC,CAAC,IAAI,CAAC;QAC9B,qBAAqB,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IAChF,CAAC,CAAC,CAAC;IAEH,SAAS,qCAAqC,CAC7C,GAA4B,EAC5B,QAAsB,EACtB,kBAAuC,EACvC,2BAAyD,EACzD,eAAwC;QAExC,OAAO,IAAI,gBAAgB,CAC1B,GAAG,EACH,QAAQ,EACR,eAAe,KAAK,SAAS;YAC5B,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;YAC3F,CAAC,CAAC,SAAS,EACZ,kBAAkB,EAClB,2BAA2B,EAC3B,GAAG,CAAC,sBAAsB,CAC1B,CAAC;IACH,CAAC;IAED,4BAA4B,CAAC,qCAAqC,CAAC,CAAC;IAEpE,EAAE,CAAC,2DAA2D,EAAE,KAAK,IAAI,EAAE;QAC1E,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE;YACJ,OAAO,qCAAqC,CAAC,SAAS,EAAE,iBAAiB,EAAE,SAAS,EAAE,SAAS,EAAE;gBAChG,GAAG;gBACH,oBAAoB;aACpB,CAAC,CAAC;QACJ,CAAC,EACD,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,6BAA6B,CAAC,CACtE,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6DAA6D,EAAE,KAAK,IAAI,EAAE;QAC5E,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE;YACJ,OAAO,qCAAqC,CAAC,SAAS,EAAE,iBAAiB,EAAE,SAAS,EAAE,SAAS,EAAE;gBAChG,IAAI;gBACJ,oBAAoB;aACpB,CAAC,CAAC;QACJ,CAAC,EACD,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,2DAA2D,CAAC,CACpG,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,KAAK,IAAI,EAAE;QACxD,MAAM,KAAK,GAAG,cAAc,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;QAC3D,MAAM,eAAe,GAAG,CAAC,CAAC;QAC1B,MAAM,MAAM,GAAG,qCAAqC,CACnD,SAAS,EACT,iBAAiB,EAEjB,SAAS,EACT,SAAS,EACT,CAAC,eAAe,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC,CACzC,CAAC;QACF,MAAM,CAAC,MAAM,CAAC,uBAAuB,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;IACnG,CAAC,CAAC,CAAC;IAEH,SAAS,uBAAuB,CAAC,MAAwB,EAAE,GAA4B;QACtF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;SAClC;IACF,CAAC;IAED,EAAE,CAAC,2CAA2C,EAAE,KAAK,IAAI,EAAE;QAC1D,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,MAAM,MAAM,GAAG,qCAAqC,CAAC,SAAS,EAAE,iBAAiB,EAAE,GAAG,EAAE,CAAC,cAAc,EAAE,CAAC,CAAC;QAC3G,MAAM,CAAC,SAAS,CAAC,MAAM,GAAG,gBAAgB,CAAC,qBAAqB,CAAC,CAAC;QAElE,uBAAuB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC3C,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAElD,wFAAwF;QACxF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC3C,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;SAClC;QACD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,KAAK,IAAI,EAAE;QACxD,sBAAsB;QACtB,SAAS,CAAC,gBAAgB,CACzB,OAAO,CAAC;YACP;gBACC,IAAI,EAAE,kBAAkB,CAAC,UAAU;gBACnC,WAAW,EAAE,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAC5C,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,MAAM,EAAE,CAAC;aACT;SACD,CAAC,EACF,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,qBAAqB,EAAE,CAAC,EAAE,CAC3E,CAAC;QACF,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,MAAM,MAAM,GAAG,qCAAqC,CAAC,SAAS,EAAE,iBAAiB,EAAE,GAAG,EAAE,CAAC,cAAc,EAAE,CAAC,CAAC;QAC3G,MAAM,CAAC,SAAS,CAAC,MAAM,GAAG,gBAAgB,CAAC,qBAAqB,CAAC,CAAC;QAElE,uBAAuB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC3C,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAElD,MAAM,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACjE,MAAM,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAC1E,MAAM,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAC1E,MAAM,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,KAAK,IAAI,EAAE;QAC5C,MAAM,MAAM,GAAG,qCAAqC,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;QACnF,MAAM,CAAC,MAAM,CAAC,qBAAqB,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACnD,uBAAuB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,qBAAqB,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QAClD,SAAS,CAAC,YAAY,CACrB,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CACzD,CACD,CACD,CAAC;QACF,SAAS,CAAC,gBAAgB,CACzB,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CACzD,CACD,EACD;YACC,cAAc,EAAE,CAAC;YACjB,uBAAuB,EAAE,CAAC;YAC1B,qBAAqB,EAAE,CAAC;SACxB,CACD,CAAC;QACF,MAAM,CAAC,MAAM,CAAC,qBAAqB,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qEAAqE,EAAE,KAAK,IAAI,EAAE;QACpF,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,kBAAkB,CAAC,QAAQ,EAAE,gBAAgB,CAAC,qBAAqB,GAAG,CAAC,CAAC,CAAC;QACrF,MAAM,MAAM,GAAG,qCAAqC,CACnD,GAAG,EACH,aAAa,CAAC,YAAY,CAAC,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC,EAC3D,GAAG,EAAE,CAAC,cAAc,EAAE,CACtB,CAAC;QACF,MAAM,CAAC,wBAAwB,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,+CAA+C;QAEhG,uBAAuB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QACrC,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAE5C,cAAc,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,gBAAgB,CAAC,qBAAqB,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC9E,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;SAClC;QACD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAEnC,MAAM,CAAC,uBAAuB,CAAC,gBAAgB,CAAC,qBAAqB,CAAC,CAAC;QACvE,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,gBAAgB,CAAC,qBAAqB,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mEAAmE,EAAE,KAAK,IAAI,EAAE;QAClF,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,kBAAkB,CAAC,QAAQ,EAAE,gBAAgB,CAAC,qBAAqB,GAAG,CAAC,CAAC,CAAC;QACrF,MAAM,MAAM,GAAG,qCAAqC,CACnD,GAAG,EACH,aAAa,CAAC,YAAY,CAAC,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC,EAC3D,GAAG,EAAE,CAAC,cAAc,EAAE,CACtB,CAAC;QAEF,wCAAwC;QACxC,MAAM,CAAC,wBAAwB,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC;QAE5D,uBAAuB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QACrC,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAE5C,cAAc,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,gBAAgB,CAAC,qBAAqB,EAAE,CAAC,EAAE,EAAE;YACjE,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;SAClC;QACD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,gBAAgB,CAAC,qBAAqB,CAAC,CAAC;QAExE,cAAc,GAAG,CAAC,CAAC;QACnB,MAAM,CAAC,uBAAuB,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC;QAC3D,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,KAAK,IAAI,EAAE;QAC1D,MAAM,iBAAiB,GAAG,0BAA0B,CAAC,QAAQ,CAAC,CAAC;QAC/D,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,MAAM,MAAM,GAAG,qCAAqC,CACnD,iBAAiB,EACjB,iBAAiB,EACjB,GAAG,EAAE,CAAC,cAAc,EAAE,CACtB,CAAC;QACF,MAAM,CAAC,iBAAiB,CAAC,MAAM,GAAG,gBAAgB,CAAC,qBAAqB,CAAC,CAAC;QAE1E,uBAAuB,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;QACnD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAE1D,4EAA4E;QAC5E,cAAc,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,iBAAiB,CAAC,sBAAsB,GAAG,CAAC,EAAE,CAAC,IAAI,iBAAiB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC9F,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;SACnC;QAED,qDAAqD;QACrD,kFAAkF;QAClF,cAAc,GAAG,CAAC,CAAC;QACnB,iBAAiB,CAAC,YAAY,CAC7B,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CACzD,CACD,CACD,CAAC;QACF,uBAAuB,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;QACnD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAEnC,cAAc,GAAG,CAAC,CAAC;QACnB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,OAAO,iBAAiB,CAAC,kBAAkB,GAAG,CAAC,EAAE;YAChD,iBAAiB,CAAC,gBAAgB,CACjC,iBAAiB,CAAC,iBAAiB,CAAC,iBAAiB,CAAC,sBAAsB,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,EACvG,EAAE,cAAc,EAAE,SAAS,EAAE,uBAAuB,EAAE,SAAS,GAAG,CAAC,EAAE,CACrE,CAAC;YACF,EAAE,SAAS,CAAC;YACZ,MAAM,CAAC,uBAAuB,CAAC,iBAAiB,CAAC,sBAAsB,CAAC,CAAC,CAAC,6CAA6C;YACvH,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,+CAA+C;YACzG,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;SACnC;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sFAAsF,EAAE,GAAG,EAAE;QAC/F,MAAM,iBAAiB,GAAG,0BAA0B,CAAC,QAAQ,CAAC,CAAC;QAC/D,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,MAAM,MAAM,GAAG,qCAAqC,CACnD,iBAAiB,EACjB,iBAAiB,EACjB,GAAG,EAAE,CAAC,cAAc,EAAE,CACtB,CAAC;QAEF,gDAAgD;QAChD,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACzD,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACzD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAE1D,sBAAsB;QACtB,cAAc,GAAG,CAAC,CAAC;QACnB,iBAAiB,CAAC,gBAAgB,CACjC,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CACzD,CACD,EACD,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,qBAAqB,EAAE,CAAC,EAAE,CAC3E,CAAC;QACF,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACzD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,kBAAkB,GAAG,CAAC,CAAC,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACpC,MAAM,GAAG,GAAG,IAAI,OAAO,EAAkB,CAAC;QAC1C,MAAM,cAAc,GAAc,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,qCAAqC,CAAC,GAAG,EAAE,iBAAiB,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,CACjG,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAC9B,CAAC;QACF,MAAM,MAAM,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACxE,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACvB,MAAM,CAAC,qBAAqB,CAAC,IAAI,EAAE;YAClC,MAAM,EAAE,UAAU,CAAC,OAAO;YAC1B,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,MAAM;YACN,KAAK,EAAE,qBAAqB;YAC5B,KAAK,EAAE,EAAE;SACT,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACvE,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QAClE,MAAM,GAAG,GAAG,IAAI,OAAO,EAAkB,CAAC;QAC1C,MAAM,cAAc,GAAc,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,qCAAqC,CAAC,GAAG,EAAE,iBAAiB,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,CACjG,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAC9B,CAAC;QACF,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACvB,MAAM,CAAC,qBAAqB,CAAC,IAAI,EAAE;YAClC,MAAM,EAAE,UAAU,CAAC,OAAO;YAC1B,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,MAAM,EAAE,qBAAqB;YAC7B,KAAK,EAAE,qBAAqB;YAC5B,KAAK,EAAE,EAAE;SACT,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACvE,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,MAAM,GAAG,GAAG,IAAI,OAAO,EAAkB,CAAC;QAC1C,MAAM,cAAc,GAAc,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,qCAAqC,CAAC,GAAG,EAAE,iBAAiB,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,CACjG,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAC9B,CAAC;QACF,MAAM,MAAM,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACxE,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACvB,MAAM,CAAC,qBAAqB,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;YACzC,MAAM,EAAE,UAAU,CAAC,OAAO;YAC1B,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,MAAM;YACN,KAAK,EAAE,qBAAqB;YAC5B,KAAK,EAAE,EAAE;SACT,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACvE,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACxD,MAAM,GAAG,GAAG,IAAI,OAAO,EAAkB,CAAC;QAC1C,MAAM,cAAc,GAAc,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,qCAAqC,CAAC,GAAG,EAAE,iBAAiB,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,CACjG,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAC9B,CAAC;QACF,MAAM,KAAK,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QAC1B,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAExB,MAAM,MAAM,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACxE,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3C,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,CAAC,qBAAqB,CAAC,KAAK,EAAE;YACnC,MAAM,EAAE,UAAU,CAAC,OAAO;YAC1B,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,MAAM;YACN,KAAK,EAAE,qBAAqB;YAC5B,KAAK,EAAE,EAAE;SACT,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACvE,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC;QAC3C,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACzD,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6DAA6D,EAAE,KAAK,IAAI,EAAE;QAC5E,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,MAAM,iBAAiB,GAAG,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,IAAI,OAAO,CACtB,SAAS,EACT,SAAS,EACT,SAAS,EACT,iBAAiB,EACjB,iBAAiB,GAAG,CAAC,CACrB,CAAC;QACF,MAAM,MAAM,GAAG,qCAAqC,CAAC,GAAG,EAAE,iBAAiB,CAAC,CAAC;QAE7E,MAAM,CAAC,EAAE,CAAC,gCAAgC,CAAC,gBAAgB,EAAE,CAAC,QAAQ,EAAE,EAAE;YACzE,gBAAgB,GAAG,QAAQ,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,gDAAgD;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,EAAE,CAAC,EAAE,EAAE;YAC3C,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACzB,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAClF,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;SAC5C;QACD,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC;aAChB,MAAM,CAAC,GAAG,CAAC,sBAAsB,CAAC;aAClC,GAAG,CAAC,MAAM,CAAC,iBAAiB,EAAE,yCAAyC,CAAC,CAAC;QAE3E,gDAAgD;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,EAAE,CAAC,EAAE,EAAE;YAC3C,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACzB,MAAM,cAAc,GAAG,iBAAiB,GAAG,CAAC,CAAC;YAC7C,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE;gBAC1B,cAAc;gBACd,uBAAuB,EAAE,cAAc,GAAG,CAAC;gBAC3C,qBAAqB,EAAE,cAAc,GAAG,CAAC;aACzC,CAAC,CAAC;SACH;QAED,8CAA8C;QAC9C,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;QAErD,2EAA2E;QAC3E,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QAC1B,SAAS,SAAS;YAKjB,MAAM,GAAG,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,MAAM,GAA0B,EAAE,CAAC;YACzC,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAClC,GAAG,EACH,iBAAiB,EACjB,SAAS,EACT,SAAS,EACT,CAAC,IAAyB,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAChD,CAAC;YACF,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;QAChC,CAAC;QAED,SAAS,cAAc,CAAC,GAA4B;YACnD,0FAA0F;YAC1F,MAAM,IAAI,GAAG,OAAO,CACnB,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,aAAa,CACZ,mBAAmB,CAAC,OAAO,CAAC;gBAC3B,KAAK,EAAE,cAAc;gBACrB,MAAM,EAAE,QAAQ,CAAC,cAAc,EAAE;aACjC,CAAC,CACF,CACD,CACD,CAAC;YACF,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YACvB,OAAO,IAAI,CAAC;QACb,CAAC;QAED,EAAE,CAAC,uEAAuE,EAAE,KAAK,IAAI,EAAE;YACtF,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,SAAS,EAAE,CAAC;YAC5C,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YACzD,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEjB,+CAA+C;YAC/C,MAAM,WAAW,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;YACxC,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YACzD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEhC,GAAG,CAAC,gBAAgB,CAAC,WAAW,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;YACrF,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YACzD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;YACjD,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACxC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YAC3D,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEtD,MAAM,UAAU,GAAG,OAAO,CACzB,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAC1D,CACD,CAAC;YACF,GAAG,CAAC,gBAAgB,CAAC,UAAU,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;YACpF,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YACzD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YAChD,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YAC3D,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEtD,MAAM,UAAU,GAAG,OAAO,CACzB,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAC1D,CACD,CAAC;YACF,GAAG,CAAC,gBAAgB,CAAC,UAAU,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;YACpF,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YACzD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YAChD,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YAC3D,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QAC3B,SAAS,WAAW,CACnB,SAA2B,EAC3B,cAAsB,EACtB,uBAAgC;YAEhC,MAAM,EAAE,GAAG,MAAM,CAAC,cAAc,IAAI,MAAM,EAAE,CAAW,CAAC;YACxD,MAAM,IAAI,GAAG,EAAE,OAAO,EAAE,CAAC,cAAc,CAAC,UAAU,CAAC,iBAAiB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC;YACtF,SAAS,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE;gBACpC,cAAc;gBACd,uBAAuB,EAAE,uBAAuB,IAAI,cAAc,GAAG,CAAC;aACtE,CAAC,CAAC;YACH,OAAO,IAAI,CAAC;QACb,CAAC;QAED,SAAS,gBAAgB;YACxB,OAAO,IAAI,gBAAgB,CAAC,IAAI,OAAO,EAAE,EAAE,iBAAiB,CAAC,CAAC;QAC/D,CAAC;QAED,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;YAC5D,MAAM,SAAS,GAAG,gBAAgB,EAAE,CAAC;YACrC,MAAM,CAAC,SAAS,CAAC,6BAA6B,EAAE,CAAC,CAAC,SAAS,CAAC;YAE5D,qBAAqB;YACrB,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,EAAE,EAAE,MAAM,EAAY,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;YACpE,MAAM,CAAC,SAAS,CAAC,6BAA6B,EAAE,CAAC,CAAC,SAAS,CAAC;YAE5D,uBAAuB;YACvB,MAAM,IAAI,GAAG,WAAW,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;YACzC,MAAM,QAAQ,GAAG,EAAE,IAAI,EAAE,cAAc,EAAE,GAAG,EAAE,CAAC;YAC/C,MAAM,CAAC,SAAS,CAAC,6BAA6B,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAExE,qBAAqB;YACrB,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,EAAE,EAAE,MAAM,EAAY,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;YACpE,MAAM,CAAC,SAAS,CAAC,6BAA6B,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAExE,wBAAwB;YACxB,WAAW,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;YAC5B,MAAM,CAAC,SAAS,CAAC,6BAA6B,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACzE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;YACvD,MAAM,SAAS,GAAG,gBAAgB,EAAE,CAAC;YACrC,MAAM,CAAC,SAAS,CAAC,+BAA+B,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;YAEhE,qBAAqB;YACrB,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,EAAE,EAAE,MAAM,EAAY,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;YACpE,MAAM,CAAC,SAAS,CAAC,+BAA+B,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;YAEhE,uBAAuB;YACvB,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;YAC1C,MAAM,CAAC,SAAS,CAAC,+BAA+B,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;YAChE,MAAM,SAAS,GAAG;gBACjB,EAAE,EAAE,KAAK,CAAC,EAAE;aACZ,CAAC;YACF,MAAM,CAAC,SAAS,CAAC,+BAA+B,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YAC3E,uFAAuF;YACvF,MAAM,CAAC,SAAS,CAAC,+BAA+B,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YAE3E,wBAAwB;YACxB,gGAAgG;YAChG,4HAA4H;YAC5H,4BAA4B;YAC5B,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;YAC1C,MAAM,CAAC,SAAS,CAAC,+BAA+B,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YAC3E,uFAAuF;YACvF,MAAM,CAAC,SAAS,CAAC,+BAA+B,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YAC3E,MAAM,SAAS,GAAG;gBACjB,EAAE,EAAE,KAAK,CAAC,EAAE;aACZ,CAAC;YACF,MAAM,CAAC,SAAS,CAAC,+BAA+B,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YAC3E,uFAAuF;YACvF,MAAM,CAAC,SAAS,CAAC,+BAA+B,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC5E,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;YAC1D,MAAM,SAAS,GAAG,gBAAgB,EAAE,CAAC;YAErC,SAAS,wBAAwB,CAAC,IAAmB,EAAE,IAAqB;gBAC3E,MAAM,MAAM,GAAG,SAAS,CAAC,0BAA0B,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC7D,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;oBACrC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBACnC,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,cAAkC,CAAC;oBAC/D,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;iBAC1C;YACF,CAAC;YAED,qBAAqB;YACrB,MAAM,UAAU,GAAG,EAAE,EAAE,EAAE,MAAM,EAAY,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;YAC3D,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;YACvC,wBAAwB,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;YAEzC,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;YAC3C,wBAAwB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAEpC,gGAAgG;YAChG,4HAA4H;YAC5H,4BAA4B;YAC5B,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YACjD,wBAAwB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAEpC,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YACjD,wBAAwB,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YAEzC,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YACjD,wBAAwB,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YAEzC,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YAChD,wBAAwB,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,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 { v4 as uuidv4 } from 'uuid';\nimport { validateAssertionError } from '@fluidframework/test-runtime-utils';\nimport { EditLog } from '../EditLog';\nimport {\n\tCachingLogViewer,\n\tCachingLogViewerDiagnosticEvents,\n\tEditStatusCallback,\n\tLogViewer,\n\tSequencedEditResult,\n\tSequencedEditResultCallback,\n} from '../LogViewer';\nimport { EditId } from '../Identifiers';\nimport { copyPropertyIfDefined, fail } from '../Common';\nimport { initialTree } from '../InitialTree';\nimport {\n\tChangeInternal,\n\tChangeNode,\n\tChangeTypeInternal,\n\tConstraintEffect,\n\tEdit,\n\tEditStatus,\n\tSetValueInternal,\n\tStablePlaceInternal,\n} from '../persisted-types';\nimport { areRevisionViewsSemanticallyEqual, newEdit } from '../EditUtilities';\nimport { NodeIdContext } from '../NodeIdUtilities';\nimport { RevisionView } from '../RevisionView';\nimport { TransactionInternal } from '../TransactionInternal';\nimport { StableRange } from '../ChangeTypes';\nimport { expectDefined } from './utilities/TestCommon';\nimport { buildLeaf, TestTree } from './utilities/TestNode';\nimport { refreshTestTree, testTraitLabel } from './utilities/TestUtilities';\n\n/**\n * Creates an {@link EditLog} and accompanying {@link RevisionView} with pre-existing edits.\n *\n * @remarks Intended to be used with {@link getSimpleLogBaseView}\n * @param testTree - Test tree to work on\n * @param numEdits - The number of edits to make to the base tree\n */\nfunction getTestTreeLog(testTree: TestTree): EditLog<ChangeInternal> {\n\tconst log = new EditLog<ChangeInternal>();\n\tlog.addSequencedEdit(\n\t\tnewEdit(\n\t\t\tChangeInternal.insertTree(\n\t\t\t\t[testTree.buildLeaf(testTree.left.identifier)],\n\t\t\t\tStablePlaceInternal.atStartOf(testTree.left.traitLocation)\n\t\t\t)\n\t\t),\n\t\t{ sequenceNumber: 1, referenceSequenceNumber: 0 }\n\t);\n\tlog.addSequencedEdit(\n\t\tnewEdit(\n\t\t\tChangeInternal.insertTree(\n\t\t\t\t[testTree.buildLeaf(testTree.right.identifier)],\n\t\t\t\tStablePlaceInternal.atStartOf(testTree.right.traitLocation)\n\t\t\t)\n\t\t),\n\t\t{ sequenceNumber: 2, referenceSequenceNumber: 1 }\n\t);\n\n\treturn log;\n}\n\nfunction getLogWithNumEdits(nodeIdContext: NodeIdContext, numEdits: number): EditLog<ChangeInternal> {\n\tconst log = new EditLog<ChangeInternal>();\n\tfor (let i = 0; i < numEdits; i++) {\n\t\tlog.addSequencedEdit(\n\t\t\tnewEdit(\n\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t[buildLeaf(nodeIdContext.generateNodeId())],\n\t\t\t\t\tStablePlaceInternal.atStartOf({\n\t\t\t\t\t\tlabel: testTraitLabel,\n\t\t\t\t\t\tparent: nodeIdContext.convertToNodeId(initialTree.identifier),\n\t\t\t\t\t})\n\t\t\t\t)\n\t\t\t),\n\t\t\t{\n\t\t\t\tsequenceNumber: i + 1,\n\t\t\t\treferenceSequenceNumber: i,\n\t\t\t}\n\t\t);\n\t}\n\n\treturn log;\n}\n\n/**\n * Get a base view for a log created with {@link getTestTreeLog}.\n * This can then be used to construct a {@link LogViewer} for that log.\n *\n * @param testTree - Test tree to work from\n */\nfunction getSimpleLogBaseView(testTree: TestTree): RevisionView {\n\tconst node: ChangeNode = { definition: testTree.definition, identifier: testTree.identifier, traits: {} };\n\tcopyPropertyIfDefined(testTree, node, 'payload');\n\treturn RevisionView.fromTree(node);\n}\n\nfunction getSimpleLogWithLocalEdits(testTree: TestTree): EditLog<ChangeInternal> {\n\tconst logWithLocalEdits = getTestTreeLog(testTree);\n\tlogWithLocalEdits.addLocalEdit(\n\t\tnewEdit(\n\t\t\tChangeInternal.insertTree(\n\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\tStablePlaceInternal.atEndOf(testTree.left.traitLocation)\n\t\t\t)\n\t\t)\n\t);\n\tlogWithLocalEdits.addLocalEdit(\n\t\tnewEdit(\n\t\t\tChangeInternal.insertTree(\n\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\tStablePlaceInternal.atEndOf(testTree.right.traitLocation)\n\t\t\t)\n\t\t)\n\t);\n\tlogWithLocalEdits.addLocalEdit(\n\t\tnewEdit(\n\t\t\tChangeInternal.insertTree(\n\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\tStablePlaceInternal.atEndOf(testTree.left.traitLocation)\n\t\t\t)\n\t\t)\n\t);\n\treturn logWithLocalEdits;\n}\n\nfunction getViewsForLog(log: EditLog<ChangeInternal>, baseView: RevisionView): RevisionView[] {\n\tconst views: RevisionView[] = [baseView];\n\tfor (let i = 0; i < log.length; i++) {\n\t\tconst edit = log.tryGetEditAtIndex(i) ?? fail('edit not found');\n\t\tconst result = TransactionInternal.factory(views[i]).applyChanges(edit.changes).close();\n\t\tif (result.status === EditStatus.Applied) {\n\t\t\tviews.push(result.after);\n\t\t} else {\n\t\t\texpect.fail('edit failed to apply');\n\t\t}\n\t}\n\treturn views;\n}\n\nfunction runLogViewerCorrectnessTests(\n\tviewerCreator: (log: EditLog<ChangeInternal>, baseView: RevisionView) => LogViewer\n): Mocha.Suite {\n\treturn describe('LogViewer', () => {\n\t\tlet simpleLog: EditLog<ChangeInternal>;\n\t\tlet simpleLogBaseView: RevisionView;\n\t\tlet simpleLogInitialView: RevisionView;\n\t\tconst testTree = refreshTestTree(undefined, (t) => {\n\t\t\tsimpleLogBaseView = getSimpleLogBaseView(t);\n\t\t\tsimpleLog = getTestTreeLog(t);\n\t\t\tsimpleLogInitialView = t.view;\n\t\t});\n\n\t\tit('generates initialTree by default for the 0th revision', () => {\n\t\t\tconst viewer = viewerCreator(new EditLog(), simpleLogBaseView);\n\t\t\tconst headView = viewer.getRevisionViewInMemory(0);\n\t\t\texpect(headView.equals(expectDefined(RevisionView.fromTree(initialTree, testTree))));\n\t\t});\n\n\t\tit('can be constructed from a non-empty EditLog', () => {\n\t\t\tconst viewer = viewerCreator(simpleLog, simpleLogBaseView);\n\t\t\tconst headView = viewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\texpect(areRevisionViewsSemanticallyEqual(headView, testTree, simpleLogInitialView, testTree));\n\t\t\texpect(headView.equals(simpleLogInitialView)).to.be.true;\n\t\t});\n\n\t\tit('can generate all revision views for an EditLog', () => {\n\t\t\tconst baseView = expectDefined(RevisionView.fromTree(initialTree, testTree));\n\t\t\tconst numNodes = 10;\n\t\t\tconst viewer = viewerCreator(getLogWithNumEdits(testTree, numNodes), baseView);\n\t\t\tconst initialRevision = viewer.getRevisionViewInMemory(0);\n\t\t\texpect(initialRevision.equals(baseView)).to.be.true;\n\t\t\texpect(initialRevision.size).to.equal(1);\n\t\t\tconst oneNodeView = viewer.getRevisionViewInMemory(1);\n\t\t\tconst testTrait = {\n\t\t\t\tlabel: testTraitLabel,\n\t\t\t\tparent: testTree.convertToNodeId(initialTree.identifier),\n\t\t\t};\n\t\t\texpect(oneNodeView.getTrait(testTrait).length).to.equal(1);\n\t\t\tconst twoNodeView = viewer.getRevisionViewInMemory(2);\n\t\t\texpect(twoNodeView.getTrait(testTrait).length).to.equal(2);\n\t\t\tconst finalView = viewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\texpect(finalView.getTrait(testTrait).length).to.equal(numNodes);\n\t\t});\n\n\t\tit('produces correct revision views when the log is mutated', () => {\n\t\t\tconst mutableLog = new EditLog<ChangeInternal>();\n\t\t\tconst viewer = viewerCreator(mutableLog, simpleLogBaseView);\n\t\t\tconst viewsForLog = getViewsForLog(simpleLog, simpleLogBaseView);\n\t\t\t// This test takes an empty log (A) and a log with edits in it (B), and adds the edits from B to A.\n\t\t\t// After each addition, the test code will iterate from [0, length_of_A] and get a view for each revision via LogViewer\n\t\t\t// and assert that none of the views differ from those created via pure Transaction APIs.\n\t\t\tfor (let i = 0; i <= simpleLog.length; i++) {\n\t\t\t\tfor (let j = 0; j <= mutableLog.length; j++) {\n\t\t\t\t\tconst viewerView = viewer.getRevisionViewInMemory(j);\n\t\t\t\t\texpect(viewerView.equals(viewsForLog[j])).to.be.true;\n\t\t\t\t}\n\t\t\t\t// Revisions are from [0, simpleLog.length], edits are at indices [0, simpleLog.length)\n\t\t\t\tif (i < simpleLog.length) {\n\t\t\t\t\tconst edit = simpleLog.tryGetEditAtIndex(i) ?? fail('edit not found');\n\t\t\t\t\tmutableLog.addSequencedEdit(edit, { sequenceNumber: i + 1, referenceSequenceNumber: i });\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\tit('produces correct revision views when local edits are shifted in the log due to sequenced edits being added', () => {\n\t\t\tfunction getViewsFromViewer(viewer: LogViewer, lastRevision: number): RevisionView[] {\n\t\t\t\tconst views: RevisionView[] = [];\n\t\t\t\tfor (let i = 0; i <= lastRevision; i++) {\n\t\t\t\t\tviews.push(viewer.getRevisionViewInMemory(i));\n\t\t\t\t}\n\t\t\t\treturn views;\n\t\t\t}\n\n\t\t\tfunction expectViewsAreEqual(log: EditLog<ChangeInternal>, viewer: LogViewer): void {\n\t\t\t\tconst viewsForLog = getViewsForLog(log, simpleLogBaseView);\n\t\t\t\tconst viewsForViewer = getViewsFromViewer(viewer, log.length);\n\t\t\t\texpect(viewsForLog.length).to.equal(viewsForViewer.length);\n\t\t\t\tfor (let i = 0; i < viewsForLog.length; i++) {\n\t\t\t\t\texpect(viewsForLog[i].equals(viewsForViewer[i])).to.be.true;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tconst logWithLocalEdits = getSimpleLogWithLocalEdits(testTree);\n\t\t\tconst viewer = viewerCreator(logWithLocalEdits, simpleLogBaseView);\n\t\t\texpectViewsAreEqual(logWithLocalEdits, viewer);\n\n\t\t\tlet seqNumber = 1;\n\t\t\t// Sequence the existing local edits and ensure viewer generates the correct views\n\t\t\twhile (logWithLocalEdits.numberOfLocalEdits > 0) {\n\t\t\t\t// Add a remote sequenced edit\n\t\t\t\tlogWithLocalEdits.addSequencedEdit(\n\t\t\t\t\tnewEdit(\n\t\t\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\t\t\t\tStablePlaceInternal.atStartOf(testTree.right.traitLocation)\n\t\t\t\t\t\t)\n\t\t\t\t\t),\n\t\t\t\t\t{ sequenceNumber: seqNumber, referenceSequenceNumber: seqNumber - 1 }\n\t\t\t\t);\n\t\t\t\t++seqNumber;\n\t\t\t\texpectViewsAreEqual(logWithLocalEdits, viewer);\n\t\t\t\t// Sequence a local edit\n\t\t\t\tlogWithLocalEdits.addSequencedEdit(\n\t\t\t\t\tlogWithLocalEdits.tryGetEditAtIndex(logWithLocalEdits.numberOfSequencedEdits) ??\n\t\t\t\t\t\tfail('edit not found'),\n\t\t\t\t\t{ sequenceNumber: seqNumber, referenceSequenceNumber: seqNumber - 1 }\n\t\t\t\t);\n\t\t\t\t++seqNumber;\n\t\t\t\texpectViewsAreEqual(logWithLocalEdits, viewer);\n\t\t\t}\n\t\t});\n\t});\n}\n\ndescribe('CachingLogViewer', () => {\n\t// TODO: Dedupe? shared hook for getting all of this stuff?\n\tlet simpleLog: EditLog<ChangeInternal>;\n\tlet simpleLogBaseView: RevisionView;\n\tlet simpleLogInitialView: RevisionView;\n\t// An arbitrary revision view which can be used to check to see if it gets used when provided as a cached value.\n\tlet arbitraryRevisionView: RevisionView;\n\tconst testTree = refreshTestTree(undefined, (t) => {\n\t\tsimpleLogBaseView = getSimpleLogBaseView(t);\n\t\tsimpleLog = getTestTreeLog(t);\n\t\tsimpleLogInitialView = t.view;\n\t\tarbitraryRevisionView = RevisionView.fromTree(t.buildLeaf(t.generateNodeId()));\n\t});\n\n\tfunction getCachingLogViewerAssumeAppliedEdits(\n\t\tlog: EditLog<ChangeInternal>,\n\t\tbaseView: RevisionView,\n\t\teditStatusCallback?: EditStatusCallback,\n\t\tsequencedEditResultCallback?: SequencedEditResultCallback,\n\t\tinitialRevision?: [number, RevisionView]\n\t): CachingLogViewer {\n\t\treturn new CachingLogViewer(\n\t\t\tlog,\n\t\t\tbaseView,\n\t\t\tinitialRevision !== undefined\n\t\t\t\t? [initialRevision[0], { view: initialRevision[1], status: EditStatus.Applied, steps: [] }]\n\t\t\t\t: undefined,\n\t\t\teditStatusCallback,\n\t\t\tsequencedEditResultCallback,\n\t\t\tlog.numberOfSequencedEdits\n\t\t);\n\t}\n\n\trunLogViewerCorrectnessTests(getCachingLogViewerAssumeAppliedEdits);\n\n\tit('detects non-integer revisions when setting revision views', async () => {\n\t\tassert.throws(\n\t\t\t() => {\n\t\t\t\treturn getCachingLogViewerAssumeAppliedEdits(simpleLog, simpleLogBaseView, undefined, undefined, [\n\t\t\t\t\t2.4,\n\t\t\t\t\tsimpleLogInitialView,\n\t\t\t\t]);\n\t\t\t},\n\t\t\t(e: Error) => validateAssertionError(e, 'revision must be an integer')\n\t\t);\n\t});\n\n\tit('detects out-of-bounds revisions when setting revision views', async () => {\n\t\tassert.throws(\n\t\t\t() => {\n\t\t\t\treturn getCachingLogViewerAssumeAppliedEdits(simpleLog, simpleLogBaseView, undefined, undefined, [\n\t\t\t\t\t1000,\n\t\t\t\t\tsimpleLogInitialView,\n\t\t\t\t]);\n\t\t\t},\n\t\t\t(e: Error) => validateAssertionError(e, 'revision must correspond to the result of a SequencedEdit')\n\t\t);\n\t});\n\n\tit('can be created with an initial revision', async () => {\n\t\tconst views = getViewsForLog(simpleLog, simpleLogBaseView);\n\t\tconst initialRevision = 0;\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(\n\t\t\tsimpleLog,\n\t\t\tsimpleLogBaseView,\n\n\t\t\tundefined,\n\t\t\tundefined,\n\t\t\t[initialRevision, views[initialRevision]]\n\t\t);\n\t\texpect(viewer.getRevisionViewInMemory(initialRevision).equals(views[initialRevision])).to.be.true;\n\t});\n\n\tfunction requestAllRevisionViews(viewer: CachingLogViewer, log: EditLog<ChangeInternal>): void {\n\t\tfor (let i = 0; i <= log.length; i++) {\n\t\t\tviewer.getRevisionViewInMemory(i);\n\t\t}\n\t}\n\n\tit('caches revision views for sequenced edits', async () => {\n\t\tlet editsProcessed = 0;\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(simpleLog, simpleLogBaseView, () => editsProcessed++);\n\t\tassert(simpleLog.length < CachingLogViewer.sequencedCacheSizeMax);\n\n\t\trequestAllRevisionViews(viewer, simpleLog);\n\t\texpect(editsProcessed).to.equal(simpleLog.length);\n\n\t\t// Ask for every view; no edit application should occur, since the views will be cached.\n\t\tfor (let i = 0; i <= simpleLog.length; i++) {\n\t\t\tviewer.getRevisionViewInMemory(i);\n\t\t}\n\t\texpect(editsProcessed).to.equal(simpleLog.length);\n\t});\n\n\tit('caches edit results for sequenced edits', async () => {\n\t\t// Add an invalid edit\n\t\tsimpleLog.addSequencedEdit(\n\t\t\tnewEdit([\n\t\t\t\t{\n\t\t\t\t\ttype: ChangeTypeInternal.Constraint,\n\t\t\t\t\ttoConstrain: StableRange.only(testTree.left),\n\t\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\t\tlength: 0,\n\t\t\t\t},\n\t\t\t]),\n\t\t\t{ sequenceNumber: 3, referenceSequenceNumber: 2, minimumSequenceNumber: 2 }\n\t\t);\n\t\tlet editsProcessed = 0;\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(simpleLog, simpleLogBaseView, () => editsProcessed++);\n\t\tassert(simpleLog.length < CachingLogViewer.sequencedCacheSizeMax);\n\n\t\trequestAllRevisionViews(viewer, simpleLog);\n\t\texpect(editsProcessed).to.equal(simpleLog.length);\n\n\t\texpect(viewer.getEditResultInMemory(0).status).equals(undefined);\n\t\texpect(viewer.getEditResultInMemory(1).status).equals(EditStatus.Applied);\n\t\texpect(viewer.getEditResultInMemory(2).status).equals(EditStatus.Applied);\n\t\texpect(viewer.getEditResultInMemory(3).status).equals(EditStatus.Invalid);\n\t});\n\n\tit('caches the highest revision', async () => {\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(simpleLog, simpleLogBaseView);\n\t\texpect(viewer.highestRevisionCached()).to.be.false;\n\t\trequestAllRevisionViews(viewer, simpleLog);\n\t\texpect(viewer.highestRevisionCached()).to.be.true;\n\t\tsimpleLog.addLocalEdit(\n\t\t\tnewEdit(\n\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\t\tStablePlaceInternal.atEndOf(testTree.right.traitLocation)\n\t\t\t\t)\n\t\t\t)\n\t\t);\n\t\tsimpleLog.addSequencedEdit(\n\t\t\tnewEdit(\n\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\t\tStablePlaceInternal.atEndOf(testTree.right.traitLocation)\n\t\t\t\t)\n\t\t\t),\n\t\t\t{\n\t\t\t\tsequenceNumber: 3,\n\t\t\t\treferenceSequenceNumber: 2,\n\t\t\t\tminimumSequenceNumber: 2,\n\t\t\t}\n\t\t);\n\t\texpect(viewer.highestRevisionCached()).to.be.false;\n\t});\n\n\tit('evicts least recently set cached revision views for sequenced edits', async () => {\n\t\tlet editsProcessed = 0;\n\t\tconst log = getLogWithNumEdits(testTree, CachingLogViewer.sequencedCacheSizeMax * 2);\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(\n\t\t\tlog,\n\t\t\texpectDefined(RevisionView.fromTree(initialTree, testTree)),\n\t\t\t() => editsProcessed++\n\t\t);\n\t\tviewer.setMinimumSequenceNumber(log.length + 1); // simulate all edits being subject to eviction\n\n\t\trequestAllRevisionViews(viewer, log);\n\t\texpect(editsProcessed).to.equal(log.length);\n\n\t\teditsProcessed = 0;\n\t\tfor (let i = CachingLogViewer.sequencedCacheSizeMax + 1; i <= log.length; i++) {\n\t\t\tviewer.getRevisionViewInMemory(i);\n\t\t}\n\t\texpect(editsProcessed).to.equal(0);\n\n\t\tviewer.getRevisionViewInMemory(CachingLogViewer.sequencedCacheSizeMax);\n\t\texpect(editsProcessed).to.equal(CachingLogViewer.sequencedCacheSizeMax);\n\t});\n\n\tit('never evicts the revision view for the most recent sequenced edit', async () => {\n\t\tlet editsProcessed = 0;\n\t\tconst log = getLogWithNumEdits(testTree, CachingLogViewer.sequencedCacheSizeMax * 2);\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(\n\t\t\tlog,\n\t\t\texpectDefined(RevisionView.fromTree(initialTree, testTree)),\n\t\t\t() => editsProcessed++\n\t\t);\n\n\t\t// Simulate all clients being caught up.\n\t\tviewer.setMinimumSequenceNumber(log.numberOfSequencedEdits);\n\n\t\trequestAllRevisionViews(viewer, log);\n\t\texpect(editsProcessed).to.equal(log.length);\n\n\t\teditsProcessed = 0;\n\t\tfor (let i = 0; i <= CachingLogViewer.sequencedCacheSizeMax; i++) {\n\t\t\tviewer.getRevisionViewInMemory(i);\n\t\t}\n\t\texpect(editsProcessed).to.equal(CachingLogViewer.sequencedCacheSizeMax);\n\n\t\teditsProcessed = 0;\n\t\tviewer.getRevisionViewInMemory(log.numberOfSequencedEdits);\n\t\texpect(editsProcessed).to.equal(0);\n\t});\n\n\tit('caches revision views for local revisions', async () => {\n\t\tconst logWithLocalEdits = getSimpleLogWithLocalEdits(testTree);\n\t\tlet editsProcessed = 0;\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(\n\t\t\tlogWithLocalEdits,\n\t\t\tsimpleLogBaseView,\n\t\t\t() => editsProcessed++\n\t\t);\n\t\tassert(logWithLocalEdits.length < CachingLogViewer.sequencedCacheSizeMax);\n\n\t\trequestAllRevisionViews(viewer, logWithLocalEdits);\n\t\texpect(editsProcessed).to.equal(logWithLocalEdits.length);\n\n\t\t// Local edits should now be cached until next remote sequenced edit arrives\n\t\teditsProcessed = 0;\n\t\tfor (let i = logWithLocalEdits.numberOfSequencedEdits + 1; i <= logWithLocalEdits.length; i++) {\n\t\t\tviewer.getRevisionViewInMemory(i);\n\t\t\texpect(editsProcessed).to.equal(0);\n\t\t}\n\n\t\t// Add a new local edit, and request the latest view.\n\t\t// This should apply only a single edit, as the most recent HEAD should be cached.\n\t\teditsProcessed = 0;\n\t\tlogWithLocalEdits.addLocalEdit(\n\t\t\tnewEdit(\n\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\t\tStablePlaceInternal.atEndOf(testTree.right.traitLocation)\n\t\t\t\t)\n\t\t\t)\n\t\t);\n\t\trequestAllRevisionViews(viewer, logWithLocalEdits);\n\t\texpect(editsProcessed).to.equal(1);\n\n\t\teditsProcessed = 0;\n\t\tlet seqNumber = 1;\n\t\twhile (logWithLocalEdits.numberOfLocalEdits > 0) {\n\t\t\tlogWithLocalEdits.addSequencedEdit(\n\t\t\t\tlogWithLocalEdits.tryGetEditAtIndex(logWithLocalEdits.numberOfSequencedEdits) ?? fail('edit not found'),\n\t\t\t\t{ sequenceNumber: seqNumber, referenceSequenceNumber: seqNumber - 1 }\n\t\t\t);\n\t\t\t++seqNumber;\n\t\t\tviewer.getRevisionViewInMemory(logWithLocalEdits.numberOfSequencedEdits); // get the latest (just added) sequenced edit\n\t\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY); // get the last view, which is a local revision\n\t\t\texpect(editsProcessed).to.equal(0);\n\t\t}\n\t});\n\n\tit('invalidates cached revision views for local revisions when remote edits are received', () => {\n\t\tconst logWithLocalEdits = getSimpleLogWithLocalEdits(testTree);\n\t\tlet editsProcessed = 0;\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(\n\t\t\tlogWithLocalEdits,\n\t\t\tsimpleLogBaseView,\n\t\t\t() => editsProcessed++\n\t\t);\n\n\t\t// Request twice, should only process edits once\n\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\texpect(editsProcessed).to.equal(logWithLocalEdits.length);\n\n\t\t// Remote edit arrives\n\t\teditsProcessed = 0;\n\t\tlogWithLocalEdits.addSequencedEdit(\n\t\t\tnewEdit(\n\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\t\tStablePlaceInternal.atEndOf(testTree.right.traitLocation)\n\t\t\t\t)\n\t\t\t),\n\t\t\t{ sequenceNumber: 3, referenceSequenceNumber: 2, minimumSequenceNumber: 2 }\n\t\t);\n\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\texpect(editsProcessed).to.equal(logWithLocalEdits.numberOfLocalEdits + 1);\n\t});\n\n\tit('uses known editing result', () => {\n\t\tconst log = new EditLog<ChangeInternal>();\n\t\tconst editsProcessed: boolean[] = [];\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(log, simpleLogBaseView, (_, _2, wasCached) =>\n\t\t\teditsProcessed.push(wasCached)\n\t\t);\n\t\tconst before = viewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\tconst edit = newEdit([]);\n\t\tlog.addLocalEdit(edit);\n\t\tviewer.setKnownEditingResult(edit, {\n\t\t\tstatus: EditStatus.Applied,\n\t\t\tchanges: edit.changes,\n\t\t\tbefore,\n\t\t\tafter: arbitraryRevisionView,\n\t\t\tsteps: [],\n\t\t});\n\t\tconst after = viewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\texpect(editsProcessed).deep.equal([true]);\n\t\texpect(after).equal(arbitraryRevisionView);\n\t});\n\n\tit('ignores known editing if for wrong before revision view', () => {\n\t\tconst log = new EditLog<ChangeInternal>();\n\t\tconst editsProcessed: boolean[] = [];\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(log, simpleLogBaseView, (_, _2, wasCached) =>\n\t\t\teditsProcessed.push(wasCached)\n\t\t);\n\t\tconst edit = newEdit([]);\n\t\tlog.addLocalEdit(edit);\n\t\tviewer.setKnownEditingResult(edit, {\n\t\t\tstatus: EditStatus.Applied,\n\t\t\tchanges: edit.changes,\n\t\t\tbefore: arbitraryRevisionView,\n\t\t\tafter: arbitraryRevisionView,\n\t\t\tsteps: [],\n\t\t});\n\t\tconst after = viewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\texpect(editsProcessed).deep.equal([false]);\n\t\texpect(after).not.equal(arbitraryRevisionView);\n\t});\n\n\tit('ignores known editing if for wrong edit', () => {\n\t\tconst log = new EditLog<ChangeInternal>();\n\t\tconst editsProcessed: boolean[] = [];\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(log, simpleLogBaseView, (_, _2, wasCached) =>\n\t\t\teditsProcessed.push(wasCached)\n\t\t);\n\t\tconst before = viewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\tconst edit = newEdit([]);\n\t\tlog.addLocalEdit(edit);\n\t\tviewer.setKnownEditingResult(newEdit([]), {\n\t\t\tstatus: EditStatus.Applied,\n\t\t\tchanges: edit.changes,\n\t\t\tbefore,\n\t\t\tafter: arbitraryRevisionView,\n\t\t\tsteps: [],\n\t\t});\n\t\tconst after = viewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\texpect(editsProcessed).deep.equal([false]);\n\t\texpect(after).not.equal(arbitraryRevisionView);\n\t});\n\n\tit('uses known editing result with multiple edits', () => {\n\t\tconst log = new EditLog<ChangeInternal>();\n\t\tconst editsProcessed: boolean[] = [];\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(log, simpleLogBaseView, (_, _2, wasCached) =>\n\t\t\teditsProcessed.push(wasCached)\n\t\t);\n\t\tconst edit1 = newEdit([]);\n\t\tconst edit2 = newEdit([]);\n\t\tconst edit3 = newEdit([]);\n\t\tlog.addLocalEdit(edit1);\n\n\t\tconst before = viewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\texpect(editsProcessed).deep.equal([false]);\n\t\tlog.addLocalEdit(edit2);\n\t\tviewer.setKnownEditingResult(edit2, {\n\t\t\tstatus: EditStatus.Applied,\n\t\t\tchanges: edit2.changes,\n\t\t\tbefore,\n\t\t\tafter: arbitraryRevisionView,\n\t\t\tsteps: [],\n\t\t});\n\t\tconst after = viewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\texpect(editsProcessed).deep.equal([false, true]);\n\t\texpect(after).equal(arbitraryRevisionView);\n\t\tlog.addLocalEdit(edit3);\n\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\texpect(editsProcessed).deep.equal([false, true, false]);\n\t});\n\n\tit('caches the oldest in memory revision when edits are evicted', async () => {\n\t\tlet retainedRevision = 0;\n\t\tconst targetEditLogSize = 10;\n\t\tconst log = new EditLog<ChangeInternal>(\n\t\t\tundefined,\n\t\t\tundefined,\n\t\t\tundefined,\n\t\t\ttargetEditLogSize,\n\t\t\ttargetEditLogSize * 2\n\t\t);\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(log, simpleLogBaseView);\n\n\t\tviewer.on(CachingLogViewerDiagnosticEvents.RevisionRetained, (revision) => {\n\t\t\tretainedRevision = revision;\n\t\t});\n\n\t\t// Add enough edits to the log to start evicting\n\t\tfor (let i = 0; i < targetEditLogSize; i++) {\n\t\t\tconst edit = newEdit([]);\n\t\t\tlog.addSequencedEdit(edit, { sequenceNumber: i, referenceSequenceNumber: i - 1 });\n\t\t\texpect(log.getIndexOfId(edit.id)).equals(i);\n\t\t}\n\t\texpect(log.length)\n\t\t\t.equals(log.numberOfSequencedEdits)\n\t\t\t.and.equals(targetEditLogSize, 'Only sequenced edits should be present.');\n\n\t\t// Add more edits so that the oldest get evicted\n\t\tfor (let i = 0; i < targetEditLogSize; i++) {\n\t\t\tconst edit = newEdit([]);\n\t\t\tconst sequenceNumber = targetEditLogSize + i;\n\t\t\tlog.addSequencedEdit(edit, {\n\t\t\t\tsequenceNumber,\n\t\t\t\treferenceSequenceNumber: sequenceNumber - 1,\n\t\t\t\tminimumSequenceNumber: sequenceNumber - 1,\n\t\t\t});\n\t\t}\n\n\t\t// Check to see that the revision was retained\n\t\texpect(retainedRevision).to.equal(targetEditLogSize);\n\n\t\t// Make sure retrieving the latest revision is possible after edit eviction\n\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t});\n\n\tdescribe('Callbacks', () => {\n\t\tfunction getViewer(): {\n\t\t\tlog: EditLog<ChangeInternal>;\n\t\t\tviewer: CachingLogViewer;\n\t\t\tevents: SequencedEditResult[];\n\t\t} {\n\t\t\tconst log = getTestTreeLog(testTree);\n\t\t\tconst events: SequencedEditResult[] = [];\n\t\t\tconst viewer = new CachingLogViewer(\n\t\t\t\tlog,\n\t\t\t\tsimpleLogBaseView,\n\t\t\t\tundefined,\n\t\t\t\tundefined,\n\t\t\t\t(args: SequencedEditResult) => events.push(args)\n\t\t\t);\n\t\t\treturn { log, viewer, events };\n\t\t}\n\n\t\tfunction addInvalidEdit(log: EditLog<ChangeInternal>): Edit<ChangeInternal> {\n\t\t\t// Add a local edit that will be invalid (inserts a node at a location that doesn't exist)\n\t\t\tconst edit = newEdit(\n\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\t\texpectDefined(\n\t\t\t\t\t\tStablePlaceInternal.atEndOf({\n\t\t\t\t\t\t\tlabel: testTraitLabel,\n\t\t\t\t\t\t\tparent: testTree.generateNodeId(),\n\t\t\t\t\t\t})\n\t\t\t\t\t)\n\t\t\t\t)\n\t\t\t);\n\t\t\tlog.addLocalEdit(edit);\n\t\t\treturn edit;\n\t\t}\n\n\t\tit('processSequencedEditResult is called when a sequenced edit is applied', async () => {\n\t\t\tconst { log, events, viewer } = getViewer();\n\t\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\tevents.splice(0);\n\n\t\t\t// Non-sequenced edit should not trigger a call\n\t\t\tconst invalidEdit = addInvalidEdit(log);\n\t\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\texpect(events.length).equals(0);\n\n\t\t\tlog.addSequencedEdit(invalidEdit, { sequenceNumber: 3, referenceSequenceNumber: 2 });\n\t\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\texpect(events.length).equals(1);\n\t\t\texpect(events[0].edit.id).equals(invalidEdit.id);\n\t\t\texpect(events[0].wasLocal).equals(true);\n\t\t\texpect(events[0].result.status).equals(EditStatus.Invalid);\n\t\t\texpect(events[0].reconciliationPath.length).equals(0);\n\n\t\t\tconst validEdit1 = newEdit(\n\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\t\tStablePlaceInternal.atStartOf(testTree.left.traitLocation)\n\t\t\t\t)\n\t\t\t);\n\t\t\tlog.addSequencedEdit(validEdit1, { sequenceNumber: 3, referenceSequenceNumber: 2 });\n\t\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\texpect(events.length).equals(2);\n\t\t\texpect(events[1].edit.id).equals(validEdit1.id);\n\t\t\texpect(events[1].wasLocal).equals(false);\n\t\t\texpect(events[1].result.status).equals(EditStatus.Applied);\n\t\t\texpect(events[1].reconciliationPath.length).equals(0);\n\n\t\t\tconst validEdit2 = newEdit(\n\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\t\tStablePlaceInternal.atStartOf(testTree.left.traitLocation)\n\t\t\t\t)\n\t\t\t);\n\t\t\tlog.addSequencedEdit(validEdit2, { sequenceNumber: 4, referenceSequenceNumber: 2 });\n\t\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\texpect(events.length).equals(3);\n\t\t\texpect(events[2].edit.id).equals(validEdit2.id);\n\t\t\texpect(events[2].wasLocal).equals(false);\n\t\t\texpect(events[2].result.status).equals(EditStatus.Applied);\n\t\t\texpect(events[2].reconciliationPath.length).equals(1);\n\t\t});\n\t});\n\n\tdescribe('Sequencing', () => {\n\t\tfunction addFakeEdit(\n\t\t\tlogViewer: CachingLogViewer,\n\t\t\tsequenceNumber: number,\n\t\t\treferenceSequenceNumber?: number\n\t\t): Edit<unknown> {\n\t\t\tconst id = String(sequenceNumber ?? uuidv4()) as EditId;\n\t\t\tconst edit = { changes: [ChangeInternal.setPayload(simpleLogBaseView.root, id)], id };\n\t\t\tlogViewer.log.addSequencedEdit(edit, {\n\t\t\t\tsequenceNumber,\n\t\t\t\treferenceSequenceNumber: referenceSequenceNumber ?? sequenceNumber - 1,\n\t\t\t});\n\t\t\treturn edit;\n\t\t}\n\n\t\tfunction minimalLogViewer(): CachingLogViewer {\n\t\t\treturn new CachingLogViewer(new EditLog(), simpleLogBaseView);\n\t\t}\n\n\t\tit('tracks the earliest sequenced edit in the session', () => {\n\t\t\tconst logViewer = minimalLogViewer();\n\t\t\texpect(logViewer.earliestSequencedEditInMemory()).undefined;\n\n\t\t\t// Non-sequenced edit\n\t\t\tlogViewer.log.addLocalEdit({ id: uuidv4() as EditId, changes: [] });\n\t\t\texpect(logViewer.earliestSequencedEditInMemory()).undefined;\n\n\t\t\t// First sequenced edit\n\t\t\tconst edit = addFakeEdit(logViewer, 123);\n\t\t\tconst expected = { edit, sequenceNumber: 123 };\n\t\t\texpect(logViewer.earliestSequencedEditInMemory()).deep.equals(expected);\n\n\t\t\t// Non-sequenced edit\n\t\t\tlogViewer.log.addLocalEdit({ id: uuidv4() as EditId, changes: [] });\n\t\t\texpect(logViewer.earliestSequencedEditInMemory()).deep.equals(expected);\n\n\t\t\t// Second sequenced edit\n\t\t\taddFakeEdit(logViewer, 456);\n\t\t\texpect(logViewer.earliestSequencedEditInMemory()).deep.equals(expected);\n\t\t});\n\n\t\tit('can provide edit results for sequenced edits', () => {\n\t\t\tconst logViewer = minimalLogViewer();\n\t\t\texpect(logViewer.getEditResultFromSequenceNumber(42)).undefined;\n\n\t\t\t// Non-sequenced edit\n\t\t\tlogViewer.log.addLocalEdit({ id: uuidv4() as EditId, changes: [] });\n\t\t\texpect(logViewer.getEditResultFromSequenceNumber(42)).undefined;\n\n\t\t\t// First sequenced edit\n\t\t\tconst edit1 = addFakeEdit(logViewer, 123);\n\t\t\texpect(logViewer.getEditResultFromSequenceNumber(42)).undefined;\n\t\t\tconst expected1 = {\n\t\t\t\tid: edit1.id,\n\t\t\t};\n\t\t\texpect(logViewer.getEditResultFromSequenceNumber(123)).contains(expected1);\n\t\t\t// Check that when no such sequence number exists, the closest earlier edit is returned\n\t\t\texpect(logViewer.getEditResultFromSequenceNumber(124)).contains(expected1);\n\n\t\t\t// Second sequenced edit\n\t\t\t// Note that this edit is given a greater sequence number than simply incrementing after edit 1.\n\t\t\t// This is deliberately done to simulate scenarios where a given DDS may not be sent all sequenced ops (because an other DDS\n\t\t\t// might be receiving them).\n\t\t\tconst edit2 = addFakeEdit(logViewer, 456);\n\t\t\texpect(logViewer.getEditResultFromSequenceNumber(123)).contains(expected1);\n\t\t\t// Check that when no such sequence number exists, the closest earlier edit is returned\n\t\t\texpect(logViewer.getEditResultFromSequenceNumber(124)).contains(expected1);\n\t\t\tconst expected2 = {\n\t\t\t\tid: edit2.id,\n\t\t\t};\n\t\t\texpect(logViewer.getEditResultFromSequenceNumber(456)).contains(expected2);\n\t\t\t// Check that when no such sequence number exists, the closest earlier edit is returned\n\t\t\texpect(logViewer.getEditResultFromSequenceNumber(457)).contains(expected2);\n\t\t});\n\n\t\tit('can provide the reconciliation path for an edit', () => {\n\t\t\tconst logViewer = minimalLogViewer();\n\n\t\t\tfunction expectReconciliationPath(edit: Edit<unknown>, path: Edit<unknown>[]) {\n\t\t\t\tconst actual = logViewer.reconciliationPathFromEdit(edit.id);\n\t\t\t\texpect(actual.length).equals(path.length);\n\t\t\t\tfor (let i = 0; i < path.length; ++i) {\n\t\t\t\t\texpect(actual[i].length).equals(1);\n\t\t\t\t\tconst change = actual[i][0].resolvedChange as SetValueInternal;\n\t\t\t\t\texpect(change.payload).equals(path[i].id);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Non-sequenced edit\n\t\t\tconst nonSeqEdit = { id: uuidv4() as EditId, changes: [] };\n\t\t\tlogViewer.log.addLocalEdit(nonSeqEdit);\n\t\t\texpectReconciliationPath(nonSeqEdit, []);\n\n\t\t\tconst edit1 = addFakeEdit(logViewer, 1001);\n\t\t\texpectReconciliationPath(edit1, []);\n\n\t\t\t// Note that this edit is given a greater sequence number than simply incrementing after edit 1.\n\t\t\t// This is deliberately done to simulate scenarios where a given DDS may not be sent all sequenced ops (because an other DDS\n\t\t\t// might be receiving them).\n\t\t\tconst edit2 = addFakeEdit(logViewer, 2001, 1001);\n\t\t\texpectReconciliationPath(edit2, []);\n\n\t\t\tconst edit3 = addFakeEdit(logViewer, 3001, 2000);\n\t\t\texpectReconciliationPath(edit3, [edit2]);\n\n\t\t\tconst edit4 = addFakeEdit(logViewer, 4001, 2500);\n\t\t\texpectReconciliationPath(edit4, [edit3]);\n\n\t\t\tconst edit5 = addFakeEdit(logViewer, 5001, 500);\n\t\t\texpectReconciliationPath(edit5, [edit1, edit2, edit3, edit4]);\n\t\t});\n\t});\n});\n"]}
1
+ {"version":3,"file":"LogViewer.tests.js","sourceRoot":"","sources":["../../src/test/LogViewer.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,EAAE,IAAI,MAAM,EAAE,MAAM,MAAM,CAAC;AACpC,OAAO,EAAE,sBAAsB,EAAE,MAAM,oCAAoC,CAAC;AAC5E,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACxC,OAAO,EACN,gBAAgB,EAChB,gCAAgC,GAKhC,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EAAE,qBAAqB,EAAE,IAAI,EAAE,MAAM,cAAc,CAAC;AAC3D,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EACN,cAAc,EAEd,kBAAkB,EAClB,gBAAgB,EAEhB,UAAU,EAEV,mBAAmB,GACnB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAAE,iCAAiC,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAEjF,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAChE,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,EAAE,SAAS,EAAY,MAAM,yBAAyB,CAAC;AAC9D,OAAO,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,8BAA8B,CAAC;AAE/E;;;;;;GAMG;AACH,SAAS,cAAc,CAAC,QAAkB;IACzC,MAAM,GAAG,GAAG,IAAI,OAAO,EAAkB,CAAC;IAC1C,GAAG,CAAC,gBAAgB,CACnB,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAC9C,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAC1D,CACD,EACD,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CACjD,CAAC;IACF,GAAG,CAAC,gBAAgB,CACnB,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,EAC/C,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAC3D,CACD,EACD,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CACjD,CAAC;IAEF,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,SAAS,kBAAkB,CAAC,aAA4B,EAAE,QAAgB;IACzE,MAAM,GAAG,GAAG,IAAI,OAAO,EAAkB,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;QAClC,GAAG,CAAC,gBAAgB,CACnB,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,SAAS,CAAC,aAAa,CAAC,cAAc,EAAE,CAAC,CAAC,EAC3C,mBAAmB,CAAC,SAAS,CAAC;YAC7B,KAAK,EAAE,cAAc;YACrB,MAAM,EAAE,aAAa,CAAC,eAAe,CAAC,WAAW,CAAC,UAAU,CAAC;SAC7D,CAAC,CACF,CACD,EACD;YACC,cAAc,EAAE,CAAC,GAAG,CAAC;YACrB,uBAAuB,EAAE,CAAC;SAC1B,CACD,CAAC;KACF;IAED,OAAO,GAAG,CAAC;AACZ,CAAC;AAED;;;;;GAKG;AACH,SAAS,oBAAoB,CAAC,QAAkB;IAC/C,MAAM,IAAI,GAAe,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;IAC1G,qBAAqB,CAAC,QAAQ,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;IACjD,OAAO,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,0BAA0B,CAAC,QAAkB;IACrD,MAAM,iBAAiB,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;IACnD,iBAAiB,CAAC,YAAY,CAC7B,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CACxD,CACD,CACD,CAAC;IACF,iBAAiB,CAAC,YAAY,CAC7B,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CACzD,CACD,CACD,CAAC;IACF,iBAAiB,CAAC,YAAY,CAC7B,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CACxD,CACD,CACD,CAAC;IACF,OAAO,iBAAiB,CAAC;AAC1B,CAAC;AAED,SAAS,cAAc,CAAC,GAA4B,EAAE,QAAsB;IAC3E,MAAM,KAAK,GAAmB,CAAC,QAAQ,CAAC,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,IAAI,GAAG,GAAG,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAChE,MAAM,MAAM,GAAG,mBAAmB,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC;QACxF,IAAI,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,EAAE;YACzC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;SACzB;aAAM;YACN,MAAM,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;SACpC;KACD;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,4BAA4B,CACpC,aAAkF;IAElF,OAAO,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QACjC,IAAI,SAAkC,CAAC;QACvC,IAAI,iBAA+B,CAAC;QACpC,IAAI,oBAAkC,CAAC;QACvC,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE;YACjD,iBAAiB,GAAG,oBAAoB,CAAC,CAAC,CAAC,CAAC;YAC5C,SAAS,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YAC9B,oBAAoB,GAAG,CAAC,CAAC,IAAI,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;YAChE,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,OAAO,EAAE,EAAE,iBAAiB,CAAC,CAAC;YAC/D,MAAM,QAAQ,GAAG,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;YACnD,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,CAAC,YAAY,CAAC,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACtF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACtD,MAAM,MAAM,GAAG,aAAa,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;YAC3D,MAAM,QAAQ,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YAC1E,MAAM,CAAC,iCAAiC,CAAC,QAAQ,EAAE,QAAQ,EAAE,oBAAoB,EAAE,QAAQ,CAAC,CAAC,CAAC;YAC9F,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;YACzD,MAAM,QAAQ,GAAG,aAAa,CAAC,YAAY,CAAC,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC,CAAC;YAC7E,MAAM,QAAQ,GAAG,EAAE,CAAC;YACpB,MAAM,MAAM,GAAG,aAAa,CAAC,kBAAkB,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC/E,MAAM,eAAe,GAAG,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;YAC1D,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;YACpD,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,WAAW,GAAG,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,SAAS,GAAG;gBACjB,KAAK,EAAE,cAAc;gBACrB,MAAM,EAAE,QAAQ,CAAC,eAAe,CAAC,WAAW,CAAC,UAAU,CAAC;aACxD,CAAC;YACF,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3D,MAAM,WAAW,GAAG,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3D,MAAM,SAAS,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YAC3E,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACjE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;YAClE,MAAM,UAAU,GAAG,IAAI,OAAO,EAAkB,CAAC;YACjD,MAAM,MAAM,GAAG,aAAa,CAAC,UAAU,EAAE,iBAAiB,CAAC,CAAC;YAC5D,MAAM,WAAW,GAAG,cAAc,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;YACjE,mGAAmG;YACnG,uHAAuH;YACvH,yFAAyF;YACzF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBAC5C,MAAM,UAAU,GAAG,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;oBACrD,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;iBACrD;gBACD,uFAAuF;gBACvF,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE;oBACzB,MAAM,IAAI,GAAG,SAAS,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC;oBACtE,UAAU,CAAC,gBAAgB,CAAC,IAAI,EAAE,EAAE,cAAc,EAAE,CAAC,GAAG,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;iBACzF;aACD;QACF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4GAA4G,EAAE,GAAG,EAAE;YACrH,SAAS,kBAAkB,CAAC,MAAiB,EAAE,YAAoB;gBAClE,MAAM,KAAK,GAAmB,EAAE,CAAC;gBACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,YAAY,EAAE,CAAC,EAAE,EAAE;oBACvC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC9C;gBACD,OAAO,KAAK,CAAC;YACd,CAAC;YAED,SAAS,mBAAmB,CAAC,GAA4B,EAAE,MAAiB;gBAC3E,MAAM,WAAW,GAAG,cAAc,CAAC,GAAG,EAAE,iBAAiB,CAAC,CAAC;gBAC3D,MAAM,cAAc,GAAG,kBAAkB,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC9D,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;gBAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBAC5C,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;iBAC5D;YACF,CAAC;YAED,MAAM,iBAAiB,GAAG,0BAA0B,CAAC,QAAQ,CAAC,CAAC;YAC/D,MAAM,MAAM,GAAG,aAAa,CAAC,iBAAiB,EAAE,iBAAiB,CAAC,CAAC;YACnE,mBAAmB,CAAC,iBAAiB,EAAE,MAAM,CAAC,CAAC;YAE/C,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,kFAAkF;YAClF,OAAO,iBAAiB,CAAC,kBAAkB,GAAG,CAAC,EAAE;gBAChD,8BAA8B;gBAC9B,iBAAiB,CAAC,gBAAgB,CACjC,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAC3D,CACD,EACD,EAAE,cAAc,EAAE,SAAS,EAAE,uBAAuB,EAAE,SAAS,GAAG,CAAC,EAAE,CACrE,CAAC;gBACF,EAAE,SAAS,CAAC;gBACZ,mBAAmB,CAAC,iBAAiB,EAAE,MAAM,CAAC,CAAC;gBAC/C,wBAAwB;gBACxB,iBAAiB,CAAC,gBAAgB,CACjC,iBAAiB,CAAC,iBAAiB,CAAC,iBAAiB,CAAC,sBAAsB,CAAC;oBAC5E,IAAI,CAAC,gBAAgB,CAAC,EACvB,EAAE,cAAc,EAAE,SAAS,EAAE,uBAAuB,EAAE,SAAS,GAAG,CAAC,EAAE,CACrE,CAAC;gBACF,EAAE,SAAS,CAAC;gBACZ,mBAAmB,CAAC,iBAAiB,EAAE,MAAM,CAAC,CAAC;aAC/C;QACF,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IACjC,2DAA2D;IAC3D,IAAI,SAAkC,CAAC;IACvC,IAAI,iBAA+B,CAAC;IACpC,IAAI,oBAAkC,CAAC;IACvC,gHAAgH;IAChH,IAAI,qBAAmC,CAAC;IACxC,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE;QACjD,iBAAiB,GAAG,oBAAoB,CAAC,CAAC,CAAC,CAAC;QAC5C,SAAS,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAC9B,oBAAoB,GAAG,CAAC,CAAC,IAAI,CAAC;QAC9B,qBAAqB,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IAChF,CAAC,CAAC,CAAC;IAEH,SAAS,qCAAqC,CAC7C,GAA4B,EAC5B,QAAsB,EACtB,kBAAuC,EACvC,2BAAyD,EACzD,eAAwC;QAExC,OAAO,IAAI,gBAAgB,CAC1B,GAAG,EACH,QAAQ,EACR,eAAe,KAAK,SAAS;YAC5B,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;YAC3F,CAAC,CAAC,SAAS,EACZ,kBAAkB,EAClB,2BAA2B,EAC3B,GAAG,CAAC,sBAAsB,CAC1B,CAAC;IACH,CAAC;IAED,4BAA4B,CAAC,qCAAqC,CAAC,CAAC;IAEpE,EAAE,CAAC,2DAA2D,EAAE,KAAK,IAAI,EAAE;QAC1E,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE;YACJ,OAAO,qCAAqC,CAAC,SAAS,EAAE,iBAAiB,EAAE,SAAS,EAAE,SAAS,EAAE;gBAChG,GAAG;gBACH,oBAAoB;aACpB,CAAC,CAAC;QACJ,CAAC,EACD,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,6BAA6B,CAAC,CACtE,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6DAA6D,EAAE,KAAK,IAAI,EAAE;QAC5E,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE;YACJ,OAAO,qCAAqC,CAAC,SAAS,EAAE,iBAAiB,EAAE,SAAS,EAAE,SAAS,EAAE;gBAChG,IAAI;gBACJ,oBAAoB;aACpB,CAAC,CAAC;QACJ,CAAC,EACD,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,2DAA2D,CAAC,CACpG,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,KAAK,IAAI,EAAE;QACxD,MAAM,KAAK,GAAG,cAAc,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;QAC3D,MAAM,eAAe,GAAG,CAAC,CAAC;QAC1B,MAAM,MAAM,GAAG,qCAAqC,CACnD,SAAS,EACT,iBAAiB,EAEjB,SAAS,EACT,SAAS,EACT,CAAC,eAAe,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC,CACzC,CAAC;QACF,MAAM,CAAC,MAAM,CAAC,uBAAuB,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;IACnG,CAAC,CAAC,CAAC;IAEH,SAAS,uBAAuB,CAAC,MAAwB,EAAE,GAA4B;QACtF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;SAClC;IACF,CAAC;IAED,EAAE,CAAC,2CAA2C,EAAE,KAAK,IAAI,EAAE;QAC1D,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,MAAM,MAAM,GAAG,qCAAqC,CAAC,SAAS,EAAE,iBAAiB,EAAE,GAAG,EAAE,CAAC,cAAc,EAAE,CAAC,CAAC;QAC3G,MAAM,CAAC,SAAS,CAAC,MAAM,GAAG,gBAAgB,CAAC,qBAAqB,CAAC,CAAC;QAElE,uBAAuB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC3C,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAElD,wFAAwF;QACxF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC3C,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;SAClC;QACD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,KAAK,IAAI,EAAE;QACxD,sBAAsB;QACtB,SAAS,CAAC,gBAAgB,CACzB,OAAO,CAAC;YACP;gBACC,IAAI,EAAE,kBAAkB,CAAC,UAAU;gBACnC,WAAW,EAAE,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAC5C,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,MAAM,EAAE,CAAC;aACT;SACD,CAAC,EACF,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,qBAAqB,EAAE,CAAC,EAAE,CAC3E,CAAC;QACF,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,MAAM,MAAM,GAAG,qCAAqC,CAAC,SAAS,EAAE,iBAAiB,EAAE,GAAG,EAAE,CAAC,cAAc,EAAE,CAAC,CAAC;QAC3G,MAAM,CAAC,SAAS,CAAC,MAAM,GAAG,gBAAgB,CAAC,qBAAqB,CAAC,CAAC;QAElE,uBAAuB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC3C,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAElD,MAAM,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACjE,MAAM,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAC1E,MAAM,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAC1E,MAAM,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,KAAK,IAAI,EAAE;QAC5C,MAAM,MAAM,GAAG,qCAAqC,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;QACnF,MAAM,CAAC,MAAM,CAAC,qBAAqB,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACnD,uBAAuB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,qBAAqB,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QAClD,SAAS,CAAC,YAAY,CACrB,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CACzD,CACD,CACD,CAAC;QACF,SAAS,CAAC,gBAAgB,CACzB,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CACzD,CACD,EACD;YACC,cAAc,EAAE,CAAC;YACjB,uBAAuB,EAAE,CAAC;YAC1B,qBAAqB,EAAE,CAAC;SACxB,CACD,CAAC;QACF,MAAM,CAAC,MAAM,CAAC,qBAAqB,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qEAAqE,EAAE,KAAK,IAAI,EAAE;QACpF,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,kBAAkB,CAAC,QAAQ,EAAE,gBAAgB,CAAC,qBAAqB,GAAG,CAAC,CAAC,CAAC;QACrF,MAAM,MAAM,GAAG,qCAAqC,CACnD,GAAG,EACH,aAAa,CAAC,YAAY,CAAC,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC,EAC3D,GAAG,EAAE,CAAC,cAAc,EAAE,CACtB,CAAC;QACF,MAAM,CAAC,wBAAwB,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,+CAA+C;QAEhG,uBAAuB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QACrC,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAE5C,cAAc,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,gBAAgB,CAAC,qBAAqB,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC9E,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;SAClC;QACD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAEnC,MAAM,CAAC,uBAAuB,CAAC,gBAAgB,CAAC,qBAAqB,CAAC,CAAC;QACvE,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,gBAAgB,CAAC,qBAAqB,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mEAAmE,EAAE,KAAK,IAAI,EAAE;QAClF,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,kBAAkB,CAAC,QAAQ,EAAE,gBAAgB,CAAC,qBAAqB,GAAG,CAAC,CAAC,CAAC;QACrF,MAAM,MAAM,GAAG,qCAAqC,CACnD,GAAG,EACH,aAAa,CAAC,YAAY,CAAC,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC,EAC3D,GAAG,EAAE,CAAC,cAAc,EAAE,CACtB,CAAC;QAEF,wCAAwC;QACxC,MAAM,CAAC,wBAAwB,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC;QAE5D,uBAAuB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QACrC,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAE5C,cAAc,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,gBAAgB,CAAC,qBAAqB,EAAE,CAAC,EAAE,EAAE;YACjE,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;SAClC;QACD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,gBAAgB,CAAC,qBAAqB,CAAC,CAAC;QAExE,cAAc,GAAG,CAAC,CAAC;QACnB,MAAM,CAAC,uBAAuB,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC;QAC3D,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,KAAK,IAAI,EAAE;QAC1D,MAAM,iBAAiB,GAAG,0BAA0B,CAAC,QAAQ,CAAC,CAAC;QAC/D,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,MAAM,MAAM,GAAG,qCAAqC,CACnD,iBAAiB,EACjB,iBAAiB,EACjB,GAAG,EAAE,CAAC,cAAc,EAAE,CACtB,CAAC;QACF,MAAM,CAAC,iBAAiB,CAAC,MAAM,GAAG,gBAAgB,CAAC,qBAAqB,CAAC,CAAC;QAE1E,uBAAuB,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;QACnD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAE1D,4EAA4E;QAC5E,cAAc,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,iBAAiB,CAAC,sBAAsB,GAAG,CAAC,EAAE,CAAC,IAAI,iBAAiB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC9F,MAAM,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;SACnC;QAED,qDAAqD;QACrD,kFAAkF;QAClF,cAAc,GAAG,CAAC,CAAC;QACnB,iBAAiB,CAAC,YAAY,CAC7B,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CACzD,CACD,CACD,CAAC;QACF,uBAAuB,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;QACnD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAEnC,cAAc,GAAG,CAAC,CAAC;QACnB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,OAAO,iBAAiB,CAAC,kBAAkB,GAAG,CAAC,EAAE;YAChD,iBAAiB,CAAC,gBAAgB,CACjC,iBAAiB,CAAC,iBAAiB,CAAC,iBAAiB,CAAC,sBAAsB,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,EACvG,EAAE,cAAc,EAAE,SAAS,EAAE,uBAAuB,EAAE,SAAS,GAAG,CAAC,EAAE,CACrE,CAAC;YACF,EAAE,SAAS,CAAC;YACZ,MAAM,CAAC,uBAAuB,CAAC,iBAAiB,CAAC,sBAAsB,CAAC,CAAC,CAAC,6CAA6C;YACvH,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,+CAA+C;YACzG,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;SACnC;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sFAAsF,EAAE,GAAG,EAAE;QAC/F,MAAM,iBAAiB,GAAG,0BAA0B,CAAC,QAAQ,CAAC,CAAC;QAC/D,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,MAAM,MAAM,GAAG,qCAAqC,CACnD,iBAAiB,EACjB,iBAAiB,EACjB,GAAG,EAAE,CAAC,cAAc,EAAE,CACtB,CAAC;QAEF,gDAAgD;QAChD,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACzD,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACzD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAE1D,sBAAsB;QACtB,cAAc,GAAG,CAAC,CAAC;QACnB,iBAAiB,CAAC,gBAAgB,CACjC,OAAO,CACN,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CACzD,CACD,EACD,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,qBAAqB,EAAE,CAAC,EAAE,CAC3E,CAAC;QACF,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACzD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,kBAAkB,GAAG,CAAC,CAAC,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACpC,MAAM,GAAG,GAAG,IAAI,OAAO,EAAkB,CAAC;QAC1C,MAAM,cAAc,GAAc,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,qCAAqC,CAAC,GAAG,EAAE,iBAAiB,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,CACjG,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAC9B,CAAC;QACF,MAAM,MAAM,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACxE,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACvB,MAAM,CAAC,qBAAqB,CAAC,IAAI,EAAE;YAClC,MAAM,EAAE,UAAU,CAAC,OAAO;YAC1B,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,MAAM;YACN,KAAK,EAAE,qBAAqB;YAC5B,KAAK,EAAE,EAAE;SACT,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACvE,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QAClE,MAAM,GAAG,GAAG,IAAI,OAAO,EAAkB,CAAC;QAC1C,MAAM,cAAc,GAAc,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,qCAAqC,CAAC,GAAG,EAAE,iBAAiB,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,CACjG,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAC9B,CAAC;QACF,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACvB,MAAM,CAAC,qBAAqB,CAAC,IAAI,EAAE;YAClC,MAAM,EAAE,UAAU,CAAC,OAAO;YAC1B,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,MAAM,EAAE,qBAAqB;YAC7B,KAAK,EAAE,qBAAqB;YAC5B,KAAK,EAAE,EAAE;SACT,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACvE,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,MAAM,GAAG,GAAG,IAAI,OAAO,EAAkB,CAAC;QAC1C,MAAM,cAAc,GAAc,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,qCAAqC,CAAC,GAAG,EAAE,iBAAiB,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,CACjG,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAC9B,CAAC;QACF,MAAM,MAAM,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACxE,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACvB,MAAM,CAAC,qBAAqB,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;YACzC,MAAM,EAAE,UAAU,CAAC,OAAO;YAC1B,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,MAAM;YACN,KAAK,EAAE,qBAAqB;YAC5B,KAAK,EAAE,EAAE;SACT,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACvE,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACxD,MAAM,GAAG,GAAG,IAAI,OAAO,EAAkB,CAAC;QAC1C,MAAM,cAAc,GAAc,EAAE,CAAC;QACrC,MAAM,MAAM,GAAG,qCAAqC,CAAC,GAAG,EAAE,iBAAiB,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,CACjG,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAC9B,CAAC;QACF,MAAM,KAAK,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QAC1B,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAExB,MAAM,MAAM,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACxE,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3C,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,CAAC,qBAAqB,CAAC,KAAK,EAAE;YACnC,MAAM,EAAE,UAAU,CAAC,OAAO;YAC1B,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,MAAM;YACN,KAAK,EAAE,qBAAqB;YAC5B,KAAK,EAAE,EAAE;SACT,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACvE,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC;QAC3C,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACzD,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6DAA6D,EAAE,KAAK,IAAI,EAAE;QAC5E,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,MAAM,iBAAiB,GAAG,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,IAAI,OAAO,CACtB,SAAS,EACT,SAAS,EACT,SAAS,EACT,iBAAiB,EACjB,iBAAiB,GAAG,CAAC,CACrB,CAAC;QACF,MAAM,MAAM,GAAG,qCAAqC,CAAC,GAAG,EAAE,iBAAiB,CAAC,CAAC;QAE7E,MAAM,CAAC,EAAE,CAAC,gCAAgC,CAAC,gBAAgB,EAAE,CAAC,QAAQ,EAAE,EAAE;YACzE,gBAAgB,GAAG,QAAQ,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,gDAAgD;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,EAAE,CAAC,EAAE,EAAE;YAC3C,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACzB,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAClF,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;SAC5C;QACD,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC;aAChB,MAAM,CAAC,GAAG,CAAC,sBAAsB,CAAC;aAClC,GAAG,CAAC,MAAM,CAAC,iBAAiB,EAAE,yCAAyC,CAAC,CAAC;QAE3E,gDAAgD;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,EAAE,CAAC,EAAE,EAAE;YAC3C,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACzB,MAAM,cAAc,GAAG,iBAAiB,GAAG,CAAC,CAAC;YAC7C,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE;gBAC1B,cAAc;gBACd,uBAAuB,EAAE,cAAc,GAAG,CAAC;gBAC3C,qBAAqB,EAAE,cAAc,GAAG,CAAC;aACzC,CAAC,CAAC;SACH;QAED,8CAA8C;QAC9C,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;QAErD,2EAA2E;QAC3E,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QAC1B,SAAS,SAAS;YAKjB,MAAM,GAAG,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,MAAM,GAA0B,EAAE,CAAC;YACzC,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAClC,GAAG,EACH,iBAAiB,EACjB,SAAS,EACT,SAAS,EACT,CAAC,IAAyB,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAChD,CAAC;YACF,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;QAChC,CAAC;QAED,SAAS,cAAc,CAAC,GAA4B;YACnD,0FAA0F;YAC1F,MAAM,IAAI,GAAG,OAAO,CACnB,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,aAAa,CACZ,mBAAmB,CAAC,OAAO,CAAC;gBAC3B,KAAK,EAAE,cAAc;gBACrB,MAAM,EAAE,QAAQ,CAAC,cAAc,EAAE;aACjC,CAAC,CACF,CACD,CACD,CAAC;YACF,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YACvB,OAAO,IAAI,CAAC;QACb,CAAC;QAED,EAAE,CAAC,uEAAuE,EAAE,KAAK,IAAI,EAAE;YACtF,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,SAAS,EAAE,CAAC;YAC5C,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YACzD,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEjB,+CAA+C;YAC/C,MAAM,WAAW,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;YACxC,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YACzD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEhC,GAAG,CAAC,gBAAgB,CAAC,WAAW,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;YACrF,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YACzD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;YACjD,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACxC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YAC3D,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEtD,MAAM,UAAU,GAAG,OAAO,CACzB,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAC1D,CACD,CAAC;YACF,GAAG,CAAC,gBAAgB,CAAC,UAAU,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;YACpF,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YACzD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YAChD,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YAC3D,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAEtD,MAAM,UAAU,GAAG,OAAO,CACzB,cAAc,CAAC,UAAU,CACxB,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAC9B,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAC1D,CACD,CAAC;YACF,GAAG,CAAC,gBAAgB,CAAC,UAAU,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;YACpF,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;YACzD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YAChD,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YAC3D,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QAC3B,SAAS,WAAW,CACnB,SAA2B,EAC3B,cAAsB,EACtB,uBAAgC;YAEhC,MAAM,EAAE,GAAG,MAAM,CAAC,cAAc,IAAI,MAAM,EAAE,CAAW,CAAC;YACxD,MAAM,IAAI,GAAG,EAAE,OAAO,EAAE,CAAC,cAAc,CAAC,UAAU,CAAC,iBAAiB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC;YACtF,SAAS,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE;gBACpC,cAAc;gBACd,uBAAuB,EAAE,uBAAuB,IAAI,cAAc,GAAG,CAAC;aACtE,CAAC,CAAC;YACH,OAAO,IAAI,CAAC;QACb,CAAC;QAED,SAAS,gBAAgB;YACxB,OAAO,IAAI,gBAAgB,CAAC,IAAI,OAAO,EAAE,EAAE,iBAAiB,CAAC,CAAC;QAC/D,CAAC;QAED,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;YAC5D,MAAM,SAAS,GAAG,gBAAgB,EAAE,CAAC;YACrC,MAAM,CAAC,SAAS,CAAC,6BAA6B,EAAE,CAAC,CAAC,SAAS,CAAC;YAE5D,qBAAqB;YACrB,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,EAAE,EAAE,MAAM,EAAY,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;YACpE,MAAM,CAAC,SAAS,CAAC,6BAA6B,EAAE,CAAC,CAAC,SAAS,CAAC;YAE5D,uBAAuB;YACvB,MAAM,IAAI,GAAG,WAAW,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;YACzC,MAAM,QAAQ,GAAG,EAAE,IAAI,EAAE,cAAc,EAAE,GAAG,EAAE,CAAC;YAC/C,MAAM,CAAC,SAAS,CAAC,6BAA6B,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAExE,qBAAqB;YACrB,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,EAAE,EAAE,MAAM,EAAY,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;YACpE,MAAM,CAAC,SAAS,CAAC,6BAA6B,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAExE,wBAAwB;YACxB,WAAW,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;YAC5B,MAAM,CAAC,SAAS,CAAC,6BAA6B,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACzE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;YACvD,MAAM,SAAS,GAAG,gBAAgB,EAAE,CAAC;YACrC,MAAM,CAAC,SAAS,CAAC,+BAA+B,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;YAEhE,qBAAqB;YACrB,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,EAAE,EAAE,MAAM,EAAY,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;YACpE,MAAM,CAAC,SAAS,CAAC,+BAA+B,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;YAEhE,uBAAuB;YACvB,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;YAC1C,MAAM,CAAC,SAAS,CAAC,+BAA+B,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;YAChE,MAAM,SAAS,GAAG;gBACjB,EAAE,EAAE,KAAK,CAAC,EAAE;aACZ,CAAC;YACF,MAAM,CAAC,SAAS,CAAC,+BAA+B,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YAC3E,uFAAuF;YACvF,MAAM,CAAC,SAAS,CAAC,+BAA+B,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YAE3E,wBAAwB;YACxB,gGAAgG;YAChG,4HAA4H;YAC5H,4BAA4B;YAC5B,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;YAC1C,MAAM,CAAC,SAAS,CAAC,+BAA+B,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YAC3E,uFAAuF;YACvF,MAAM,CAAC,SAAS,CAAC,+BAA+B,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YAC3E,MAAM,SAAS,GAAG;gBACjB,EAAE,EAAE,KAAK,CAAC,EAAE;aACZ,CAAC;YACF,MAAM,CAAC,SAAS,CAAC,+BAA+B,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YAC3E,uFAAuF;YACvF,MAAM,CAAC,SAAS,CAAC,+BAA+B,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC5E,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;YAC1D,MAAM,SAAS,GAAG,gBAAgB,EAAE,CAAC;YAErC,SAAS,wBAAwB,CAAC,IAAmB,EAAE,IAAqB;gBAC3E,MAAM,MAAM,GAAG,SAAS,CAAC,0BAA0B,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC7D,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;oBACrC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBACnC,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,cAAkC,CAAC;oBAC/D,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;iBAC1C;YACF,CAAC;YAED,qBAAqB;YACrB,MAAM,UAAU,GAAG,EAAE,EAAE,EAAE,MAAM,EAAY,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;YAC3D,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;YACvC,wBAAwB,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;YAEzC,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;YAC3C,wBAAwB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAEpC,gGAAgG;YAChG,4HAA4H;YAC5H,4BAA4B;YAC5B,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YACjD,wBAAwB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAEpC,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YACjD,wBAAwB,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YAEzC,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YACjD,wBAAwB,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;YAEzC,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YAChD,wBAAwB,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,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 { v4 as uuidv4 } from 'uuid';\nimport { validateAssertionError } from '@fluidframework/test-runtime-utils';\nimport { EditLog } from '../EditLog.js';\nimport {\n\tCachingLogViewer,\n\tCachingLogViewerDiagnosticEvents,\n\tEditStatusCallback,\n\tLogViewer,\n\tSequencedEditResult,\n\tSequencedEditResultCallback,\n} from '../LogViewer.js';\nimport { EditId } from '../Identifiers.js';\nimport { copyPropertyIfDefined, fail } from '../Common.js';\nimport { initialTree } from '../InitialTree.js';\nimport {\n\tChangeInternal,\n\tChangeNode,\n\tChangeTypeInternal,\n\tConstraintEffect,\n\tEdit,\n\tEditStatus,\n\tSetValueInternal,\n\tStablePlaceInternal,\n} from '../persisted-types/index.js';\nimport { areRevisionViewsSemanticallyEqual, newEdit } from '../EditUtilities.js';\nimport { NodeIdContext } from '../NodeIdUtilities.js';\nimport { RevisionView } from '../RevisionView.js';\nimport { TransactionInternal } from '../TransactionInternal.js';\nimport { StableRange } from '../ChangeTypes.js';\nimport { expectDefined } from './utilities/TestCommon.js';\nimport { buildLeaf, TestTree } from './utilities/TestNode.js';\nimport { refreshTestTree, testTraitLabel } from './utilities/TestUtilities.js';\n\n/**\n * Creates an {@link EditLog} and accompanying {@link RevisionView} with pre-existing edits.\n *\n * @remarks Intended to be used with {@link getSimpleLogBaseView}\n * @param testTree - Test tree to work on\n * @param numEdits - The number of edits to make to the base tree\n */\nfunction getTestTreeLog(testTree: TestTree): EditLog<ChangeInternal> {\n\tconst log = new EditLog<ChangeInternal>();\n\tlog.addSequencedEdit(\n\t\tnewEdit(\n\t\t\tChangeInternal.insertTree(\n\t\t\t\t[testTree.buildLeaf(testTree.left.identifier)],\n\t\t\t\tStablePlaceInternal.atStartOf(testTree.left.traitLocation)\n\t\t\t)\n\t\t),\n\t\t{ sequenceNumber: 1, referenceSequenceNumber: 0 }\n\t);\n\tlog.addSequencedEdit(\n\t\tnewEdit(\n\t\t\tChangeInternal.insertTree(\n\t\t\t\t[testTree.buildLeaf(testTree.right.identifier)],\n\t\t\t\tStablePlaceInternal.atStartOf(testTree.right.traitLocation)\n\t\t\t)\n\t\t),\n\t\t{ sequenceNumber: 2, referenceSequenceNumber: 1 }\n\t);\n\n\treturn log;\n}\n\nfunction getLogWithNumEdits(nodeIdContext: NodeIdContext, numEdits: number): EditLog<ChangeInternal> {\n\tconst log = new EditLog<ChangeInternal>();\n\tfor (let i = 0; i < numEdits; i++) {\n\t\tlog.addSequencedEdit(\n\t\t\tnewEdit(\n\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t[buildLeaf(nodeIdContext.generateNodeId())],\n\t\t\t\t\tStablePlaceInternal.atStartOf({\n\t\t\t\t\t\tlabel: testTraitLabel,\n\t\t\t\t\t\tparent: nodeIdContext.convertToNodeId(initialTree.identifier),\n\t\t\t\t\t})\n\t\t\t\t)\n\t\t\t),\n\t\t\t{\n\t\t\t\tsequenceNumber: i + 1,\n\t\t\t\treferenceSequenceNumber: i,\n\t\t\t}\n\t\t);\n\t}\n\n\treturn log;\n}\n\n/**\n * Get a base view for a log created with {@link getTestTreeLog}.\n * This can then be used to construct a {@link LogViewer} for that log.\n *\n * @param testTree - Test tree to work from\n */\nfunction getSimpleLogBaseView(testTree: TestTree): RevisionView {\n\tconst node: ChangeNode = { definition: testTree.definition, identifier: testTree.identifier, traits: {} };\n\tcopyPropertyIfDefined(testTree, node, 'payload');\n\treturn RevisionView.fromTree(node);\n}\n\nfunction getSimpleLogWithLocalEdits(testTree: TestTree): EditLog<ChangeInternal> {\n\tconst logWithLocalEdits = getTestTreeLog(testTree);\n\tlogWithLocalEdits.addLocalEdit(\n\t\tnewEdit(\n\t\t\tChangeInternal.insertTree(\n\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\tStablePlaceInternal.atEndOf(testTree.left.traitLocation)\n\t\t\t)\n\t\t)\n\t);\n\tlogWithLocalEdits.addLocalEdit(\n\t\tnewEdit(\n\t\t\tChangeInternal.insertTree(\n\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\tStablePlaceInternal.atEndOf(testTree.right.traitLocation)\n\t\t\t)\n\t\t)\n\t);\n\tlogWithLocalEdits.addLocalEdit(\n\t\tnewEdit(\n\t\t\tChangeInternal.insertTree(\n\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\tStablePlaceInternal.atEndOf(testTree.left.traitLocation)\n\t\t\t)\n\t\t)\n\t);\n\treturn logWithLocalEdits;\n}\n\nfunction getViewsForLog(log: EditLog<ChangeInternal>, baseView: RevisionView): RevisionView[] {\n\tconst views: RevisionView[] = [baseView];\n\tfor (let i = 0; i < log.length; i++) {\n\t\tconst edit = log.tryGetEditAtIndex(i) ?? fail('edit not found');\n\t\tconst result = TransactionInternal.factory(views[i]).applyChanges(edit.changes).close();\n\t\tif (result.status === EditStatus.Applied) {\n\t\t\tviews.push(result.after);\n\t\t} else {\n\t\t\texpect.fail('edit failed to apply');\n\t\t}\n\t}\n\treturn views;\n}\n\nfunction runLogViewerCorrectnessTests(\n\tviewerCreator: (log: EditLog<ChangeInternal>, baseView: RevisionView) => LogViewer\n): Mocha.Suite {\n\treturn describe('LogViewer', () => {\n\t\tlet simpleLog: EditLog<ChangeInternal>;\n\t\tlet simpleLogBaseView: RevisionView;\n\t\tlet simpleLogInitialView: RevisionView;\n\t\tconst testTree = refreshTestTree(undefined, (t) => {\n\t\t\tsimpleLogBaseView = getSimpleLogBaseView(t);\n\t\t\tsimpleLog = getTestTreeLog(t);\n\t\t\tsimpleLogInitialView = t.view;\n\t\t});\n\n\t\tit('generates initialTree by default for the 0th revision', () => {\n\t\t\tconst viewer = viewerCreator(new EditLog(), simpleLogBaseView);\n\t\t\tconst headView = viewer.getRevisionViewInMemory(0);\n\t\t\texpect(headView.equals(expectDefined(RevisionView.fromTree(initialTree, testTree))));\n\t\t});\n\n\t\tit('can be constructed from a non-empty EditLog', () => {\n\t\t\tconst viewer = viewerCreator(simpleLog, simpleLogBaseView);\n\t\t\tconst headView = viewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\texpect(areRevisionViewsSemanticallyEqual(headView, testTree, simpleLogInitialView, testTree));\n\t\t\texpect(headView.equals(simpleLogInitialView)).to.be.true;\n\t\t});\n\n\t\tit('can generate all revision views for an EditLog', () => {\n\t\t\tconst baseView = expectDefined(RevisionView.fromTree(initialTree, testTree));\n\t\t\tconst numNodes = 10;\n\t\t\tconst viewer = viewerCreator(getLogWithNumEdits(testTree, numNodes), baseView);\n\t\t\tconst initialRevision = viewer.getRevisionViewInMemory(0);\n\t\t\texpect(initialRevision.equals(baseView)).to.be.true;\n\t\t\texpect(initialRevision.size).to.equal(1);\n\t\t\tconst oneNodeView = viewer.getRevisionViewInMemory(1);\n\t\t\tconst testTrait = {\n\t\t\t\tlabel: testTraitLabel,\n\t\t\t\tparent: testTree.convertToNodeId(initialTree.identifier),\n\t\t\t};\n\t\t\texpect(oneNodeView.getTrait(testTrait).length).to.equal(1);\n\t\t\tconst twoNodeView = viewer.getRevisionViewInMemory(2);\n\t\t\texpect(twoNodeView.getTrait(testTrait).length).to.equal(2);\n\t\t\tconst finalView = viewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\texpect(finalView.getTrait(testTrait).length).to.equal(numNodes);\n\t\t});\n\n\t\tit('produces correct revision views when the log is mutated', () => {\n\t\t\tconst mutableLog = new EditLog<ChangeInternal>();\n\t\t\tconst viewer = viewerCreator(mutableLog, simpleLogBaseView);\n\t\t\tconst viewsForLog = getViewsForLog(simpleLog, simpleLogBaseView);\n\t\t\t// This test takes an empty log (A) and a log with edits in it (B), and adds the edits from B to A.\n\t\t\t// After each addition, the test code will iterate from [0, length_of_A] and get a view for each revision via LogViewer\n\t\t\t// and assert that none of the views differ from those created via pure Transaction APIs.\n\t\t\tfor (let i = 0; i <= simpleLog.length; i++) {\n\t\t\t\tfor (let j = 0; j <= mutableLog.length; j++) {\n\t\t\t\t\tconst viewerView = viewer.getRevisionViewInMemory(j);\n\t\t\t\t\texpect(viewerView.equals(viewsForLog[j])).to.be.true;\n\t\t\t\t}\n\t\t\t\t// Revisions are from [0, simpleLog.length], edits are at indices [0, simpleLog.length)\n\t\t\t\tif (i < simpleLog.length) {\n\t\t\t\t\tconst edit = simpleLog.tryGetEditAtIndex(i) ?? fail('edit not found');\n\t\t\t\t\tmutableLog.addSequencedEdit(edit, { sequenceNumber: i + 1, referenceSequenceNumber: i });\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\tit('produces correct revision views when local edits are shifted in the log due to sequenced edits being added', () => {\n\t\t\tfunction getViewsFromViewer(viewer: LogViewer, lastRevision: number): RevisionView[] {\n\t\t\t\tconst views: RevisionView[] = [];\n\t\t\t\tfor (let i = 0; i <= lastRevision; i++) {\n\t\t\t\t\tviews.push(viewer.getRevisionViewInMemory(i));\n\t\t\t\t}\n\t\t\t\treturn views;\n\t\t\t}\n\n\t\t\tfunction expectViewsAreEqual(log: EditLog<ChangeInternal>, viewer: LogViewer): void {\n\t\t\t\tconst viewsForLog = getViewsForLog(log, simpleLogBaseView);\n\t\t\t\tconst viewsForViewer = getViewsFromViewer(viewer, log.length);\n\t\t\t\texpect(viewsForLog.length).to.equal(viewsForViewer.length);\n\t\t\t\tfor (let i = 0; i < viewsForLog.length; i++) {\n\t\t\t\t\texpect(viewsForLog[i].equals(viewsForViewer[i])).to.be.true;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tconst logWithLocalEdits = getSimpleLogWithLocalEdits(testTree);\n\t\t\tconst viewer = viewerCreator(logWithLocalEdits, simpleLogBaseView);\n\t\t\texpectViewsAreEqual(logWithLocalEdits, viewer);\n\n\t\t\tlet seqNumber = 1;\n\t\t\t// Sequence the existing local edits and ensure viewer generates the correct views\n\t\t\twhile (logWithLocalEdits.numberOfLocalEdits > 0) {\n\t\t\t\t// Add a remote sequenced edit\n\t\t\t\tlogWithLocalEdits.addSequencedEdit(\n\t\t\t\t\tnewEdit(\n\t\t\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\t\t\t\tStablePlaceInternal.atStartOf(testTree.right.traitLocation)\n\t\t\t\t\t\t)\n\t\t\t\t\t),\n\t\t\t\t\t{ sequenceNumber: seqNumber, referenceSequenceNumber: seqNumber - 1 }\n\t\t\t\t);\n\t\t\t\t++seqNumber;\n\t\t\t\texpectViewsAreEqual(logWithLocalEdits, viewer);\n\t\t\t\t// Sequence a local edit\n\t\t\t\tlogWithLocalEdits.addSequencedEdit(\n\t\t\t\t\tlogWithLocalEdits.tryGetEditAtIndex(logWithLocalEdits.numberOfSequencedEdits) ??\n\t\t\t\t\t\tfail('edit not found'),\n\t\t\t\t\t{ sequenceNumber: seqNumber, referenceSequenceNumber: seqNumber - 1 }\n\t\t\t\t);\n\t\t\t\t++seqNumber;\n\t\t\t\texpectViewsAreEqual(logWithLocalEdits, viewer);\n\t\t\t}\n\t\t});\n\t});\n}\n\ndescribe('CachingLogViewer', () => {\n\t// TODO: Dedupe? shared hook for getting all of this stuff?\n\tlet simpleLog: EditLog<ChangeInternal>;\n\tlet simpleLogBaseView: RevisionView;\n\tlet simpleLogInitialView: RevisionView;\n\t// An arbitrary revision view which can be used to check to see if it gets used when provided as a cached value.\n\tlet arbitraryRevisionView: RevisionView;\n\tconst testTree = refreshTestTree(undefined, (t) => {\n\t\tsimpleLogBaseView = getSimpleLogBaseView(t);\n\t\tsimpleLog = getTestTreeLog(t);\n\t\tsimpleLogInitialView = t.view;\n\t\tarbitraryRevisionView = RevisionView.fromTree(t.buildLeaf(t.generateNodeId()));\n\t});\n\n\tfunction getCachingLogViewerAssumeAppliedEdits(\n\t\tlog: EditLog<ChangeInternal>,\n\t\tbaseView: RevisionView,\n\t\teditStatusCallback?: EditStatusCallback,\n\t\tsequencedEditResultCallback?: SequencedEditResultCallback,\n\t\tinitialRevision?: [number, RevisionView]\n\t): CachingLogViewer {\n\t\treturn new CachingLogViewer(\n\t\t\tlog,\n\t\t\tbaseView,\n\t\t\tinitialRevision !== undefined\n\t\t\t\t? [initialRevision[0], { view: initialRevision[1], status: EditStatus.Applied, steps: [] }]\n\t\t\t\t: undefined,\n\t\t\teditStatusCallback,\n\t\t\tsequencedEditResultCallback,\n\t\t\tlog.numberOfSequencedEdits\n\t\t);\n\t}\n\n\trunLogViewerCorrectnessTests(getCachingLogViewerAssumeAppliedEdits);\n\n\tit('detects non-integer revisions when setting revision views', async () => {\n\t\tassert.throws(\n\t\t\t() => {\n\t\t\t\treturn getCachingLogViewerAssumeAppliedEdits(simpleLog, simpleLogBaseView, undefined, undefined, [\n\t\t\t\t\t2.4,\n\t\t\t\t\tsimpleLogInitialView,\n\t\t\t\t]);\n\t\t\t},\n\t\t\t(e: Error) => validateAssertionError(e, 'revision must be an integer')\n\t\t);\n\t});\n\n\tit('detects out-of-bounds revisions when setting revision views', async () => {\n\t\tassert.throws(\n\t\t\t() => {\n\t\t\t\treturn getCachingLogViewerAssumeAppliedEdits(simpleLog, simpleLogBaseView, undefined, undefined, [\n\t\t\t\t\t1000,\n\t\t\t\t\tsimpleLogInitialView,\n\t\t\t\t]);\n\t\t\t},\n\t\t\t(e: Error) => validateAssertionError(e, 'revision must correspond to the result of a SequencedEdit')\n\t\t);\n\t});\n\n\tit('can be created with an initial revision', async () => {\n\t\tconst views = getViewsForLog(simpleLog, simpleLogBaseView);\n\t\tconst initialRevision = 0;\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(\n\t\t\tsimpleLog,\n\t\t\tsimpleLogBaseView,\n\n\t\t\tundefined,\n\t\t\tundefined,\n\t\t\t[initialRevision, views[initialRevision]]\n\t\t);\n\t\texpect(viewer.getRevisionViewInMemory(initialRevision).equals(views[initialRevision])).to.be.true;\n\t});\n\n\tfunction requestAllRevisionViews(viewer: CachingLogViewer, log: EditLog<ChangeInternal>): void {\n\t\tfor (let i = 0; i <= log.length; i++) {\n\t\t\tviewer.getRevisionViewInMemory(i);\n\t\t}\n\t}\n\n\tit('caches revision views for sequenced edits', async () => {\n\t\tlet editsProcessed = 0;\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(simpleLog, simpleLogBaseView, () => editsProcessed++);\n\t\tassert(simpleLog.length < CachingLogViewer.sequencedCacheSizeMax);\n\n\t\trequestAllRevisionViews(viewer, simpleLog);\n\t\texpect(editsProcessed).to.equal(simpleLog.length);\n\n\t\t// Ask for every view; no edit application should occur, since the views will be cached.\n\t\tfor (let i = 0; i <= simpleLog.length; i++) {\n\t\t\tviewer.getRevisionViewInMemory(i);\n\t\t}\n\t\texpect(editsProcessed).to.equal(simpleLog.length);\n\t});\n\n\tit('caches edit results for sequenced edits', async () => {\n\t\t// Add an invalid edit\n\t\tsimpleLog.addSequencedEdit(\n\t\t\tnewEdit([\n\t\t\t\t{\n\t\t\t\t\ttype: ChangeTypeInternal.Constraint,\n\t\t\t\t\ttoConstrain: StableRange.only(testTree.left),\n\t\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\t\tlength: 0,\n\t\t\t\t},\n\t\t\t]),\n\t\t\t{ sequenceNumber: 3, referenceSequenceNumber: 2, minimumSequenceNumber: 2 }\n\t\t);\n\t\tlet editsProcessed = 0;\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(simpleLog, simpleLogBaseView, () => editsProcessed++);\n\t\tassert(simpleLog.length < CachingLogViewer.sequencedCacheSizeMax);\n\n\t\trequestAllRevisionViews(viewer, simpleLog);\n\t\texpect(editsProcessed).to.equal(simpleLog.length);\n\n\t\texpect(viewer.getEditResultInMemory(0).status).equals(undefined);\n\t\texpect(viewer.getEditResultInMemory(1).status).equals(EditStatus.Applied);\n\t\texpect(viewer.getEditResultInMemory(2).status).equals(EditStatus.Applied);\n\t\texpect(viewer.getEditResultInMemory(3).status).equals(EditStatus.Invalid);\n\t});\n\n\tit('caches the highest revision', async () => {\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(simpleLog, simpleLogBaseView);\n\t\texpect(viewer.highestRevisionCached()).to.be.false;\n\t\trequestAllRevisionViews(viewer, simpleLog);\n\t\texpect(viewer.highestRevisionCached()).to.be.true;\n\t\tsimpleLog.addLocalEdit(\n\t\t\tnewEdit(\n\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\t\tStablePlaceInternal.atEndOf(testTree.right.traitLocation)\n\t\t\t\t)\n\t\t\t)\n\t\t);\n\t\tsimpleLog.addSequencedEdit(\n\t\t\tnewEdit(\n\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\t\tStablePlaceInternal.atEndOf(testTree.right.traitLocation)\n\t\t\t\t)\n\t\t\t),\n\t\t\t{\n\t\t\t\tsequenceNumber: 3,\n\t\t\t\treferenceSequenceNumber: 2,\n\t\t\t\tminimumSequenceNumber: 2,\n\t\t\t}\n\t\t);\n\t\texpect(viewer.highestRevisionCached()).to.be.false;\n\t});\n\n\tit('evicts least recently set cached revision views for sequenced edits', async () => {\n\t\tlet editsProcessed = 0;\n\t\tconst log = getLogWithNumEdits(testTree, CachingLogViewer.sequencedCacheSizeMax * 2);\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(\n\t\t\tlog,\n\t\t\texpectDefined(RevisionView.fromTree(initialTree, testTree)),\n\t\t\t() => editsProcessed++\n\t\t);\n\t\tviewer.setMinimumSequenceNumber(log.length + 1); // simulate all edits being subject to eviction\n\n\t\trequestAllRevisionViews(viewer, log);\n\t\texpect(editsProcessed).to.equal(log.length);\n\n\t\teditsProcessed = 0;\n\t\tfor (let i = CachingLogViewer.sequencedCacheSizeMax + 1; i <= log.length; i++) {\n\t\t\tviewer.getRevisionViewInMemory(i);\n\t\t}\n\t\texpect(editsProcessed).to.equal(0);\n\n\t\tviewer.getRevisionViewInMemory(CachingLogViewer.sequencedCacheSizeMax);\n\t\texpect(editsProcessed).to.equal(CachingLogViewer.sequencedCacheSizeMax);\n\t});\n\n\tit('never evicts the revision view for the most recent sequenced edit', async () => {\n\t\tlet editsProcessed = 0;\n\t\tconst log = getLogWithNumEdits(testTree, CachingLogViewer.sequencedCacheSizeMax * 2);\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(\n\t\t\tlog,\n\t\t\texpectDefined(RevisionView.fromTree(initialTree, testTree)),\n\t\t\t() => editsProcessed++\n\t\t);\n\n\t\t// Simulate all clients being caught up.\n\t\tviewer.setMinimumSequenceNumber(log.numberOfSequencedEdits);\n\n\t\trequestAllRevisionViews(viewer, log);\n\t\texpect(editsProcessed).to.equal(log.length);\n\n\t\teditsProcessed = 0;\n\t\tfor (let i = 0; i <= CachingLogViewer.sequencedCacheSizeMax; i++) {\n\t\t\tviewer.getRevisionViewInMemory(i);\n\t\t}\n\t\texpect(editsProcessed).to.equal(CachingLogViewer.sequencedCacheSizeMax);\n\n\t\teditsProcessed = 0;\n\t\tviewer.getRevisionViewInMemory(log.numberOfSequencedEdits);\n\t\texpect(editsProcessed).to.equal(0);\n\t});\n\n\tit('caches revision views for local revisions', async () => {\n\t\tconst logWithLocalEdits = getSimpleLogWithLocalEdits(testTree);\n\t\tlet editsProcessed = 0;\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(\n\t\t\tlogWithLocalEdits,\n\t\t\tsimpleLogBaseView,\n\t\t\t() => editsProcessed++\n\t\t);\n\t\tassert(logWithLocalEdits.length < CachingLogViewer.sequencedCacheSizeMax);\n\n\t\trequestAllRevisionViews(viewer, logWithLocalEdits);\n\t\texpect(editsProcessed).to.equal(logWithLocalEdits.length);\n\n\t\t// Local edits should now be cached until next remote sequenced edit arrives\n\t\teditsProcessed = 0;\n\t\tfor (let i = logWithLocalEdits.numberOfSequencedEdits + 1; i <= logWithLocalEdits.length; i++) {\n\t\t\tviewer.getRevisionViewInMemory(i);\n\t\t\texpect(editsProcessed).to.equal(0);\n\t\t}\n\n\t\t// Add a new local edit, and request the latest view.\n\t\t// This should apply only a single edit, as the most recent HEAD should be cached.\n\t\teditsProcessed = 0;\n\t\tlogWithLocalEdits.addLocalEdit(\n\t\t\tnewEdit(\n\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\t\tStablePlaceInternal.atEndOf(testTree.right.traitLocation)\n\t\t\t\t)\n\t\t\t)\n\t\t);\n\t\trequestAllRevisionViews(viewer, logWithLocalEdits);\n\t\texpect(editsProcessed).to.equal(1);\n\n\t\teditsProcessed = 0;\n\t\tlet seqNumber = 1;\n\t\twhile (logWithLocalEdits.numberOfLocalEdits > 0) {\n\t\t\tlogWithLocalEdits.addSequencedEdit(\n\t\t\t\tlogWithLocalEdits.tryGetEditAtIndex(logWithLocalEdits.numberOfSequencedEdits) ?? fail('edit not found'),\n\t\t\t\t{ sequenceNumber: seqNumber, referenceSequenceNumber: seqNumber - 1 }\n\t\t\t);\n\t\t\t++seqNumber;\n\t\t\tviewer.getRevisionViewInMemory(logWithLocalEdits.numberOfSequencedEdits); // get the latest (just added) sequenced edit\n\t\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY); // get the last view, which is a local revision\n\t\t\texpect(editsProcessed).to.equal(0);\n\t\t}\n\t});\n\n\tit('invalidates cached revision views for local revisions when remote edits are received', () => {\n\t\tconst logWithLocalEdits = getSimpleLogWithLocalEdits(testTree);\n\t\tlet editsProcessed = 0;\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(\n\t\t\tlogWithLocalEdits,\n\t\t\tsimpleLogBaseView,\n\t\t\t() => editsProcessed++\n\t\t);\n\n\t\t// Request twice, should only process edits once\n\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\texpect(editsProcessed).to.equal(logWithLocalEdits.length);\n\n\t\t// Remote edit arrives\n\t\teditsProcessed = 0;\n\t\tlogWithLocalEdits.addSequencedEdit(\n\t\t\tnewEdit(\n\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\t\tStablePlaceInternal.atEndOf(testTree.right.traitLocation)\n\t\t\t\t)\n\t\t\t),\n\t\t\t{ sequenceNumber: 3, referenceSequenceNumber: 2, minimumSequenceNumber: 2 }\n\t\t);\n\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\texpect(editsProcessed).to.equal(logWithLocalEdits.numberOfLocalEdits + 1);\n\t});\n\n\tit('uses known editing result', () => {\n\t\tconst log = new EditLog<ChangeInternal>();\n\t\tconst editsProcessed: boolean[] = [];\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(log, simpleLogBaseView, (_, _2, wasCached) =>\n\t\t\teditsProcessed.push(wasCached)\n\t\t);\n\t\tconst before = viewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\tconst edit = newEdit([]);\n\t\tlog.addLocalEdit(edit);\n\t\tviewer.setKnownEditingResult(edit, {\n\t\t\tstatus: EditStatus.Applied,\n\t\t\tchanges: edit.changes,\n\t\t\tbefore,\n\t\t\tafter: arbitraryRevisionView,\n\t\t\tsteps: [],\n\t\t});\n\t\tconst after = viewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\texpect(editsProcessed).deep.equal([true]);\n\t\texpect(after).equal(arbitraryRevisionView);\n\t});\n\n\tit('ignores known editing if for wrong before revision view', () => {\n\t\tconst log = new EditLog<ChangeInternal>();\n\t\tconst editsProcessed: boolean[] = [];\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(log, simpleLogBaseView, (_, _2, wasCached) =>\n\t\t\teditsProcessed.push(wasCached)\n\t\t);\n\t\tconst edit = newEdit([]);\n\t\tlog.addLocalEdit(edit);\n\t\tviewer.setKnownEditingResult(edit, {\n\t\t\tstatus: EditStatus.Applied,\n\t\t\tchanges: edit.changes,\n\t\t\tbefore: arbitraryRevisionView,\n\t\t\tafter: arbitraryRevisionView,\n\t\t\tsteps: [],\n\t\t});\n\t\tconst after = viewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\texpect(editsProcessed).deep.equal([false]);\n\t\texpect(after).not.equal(arbitraryRevisionView);\n\t});\n\n\tit('ignores known editing if for wrong edit', () => {\n\t\tconst log = new EditLog<ChangeInternal>();\n\t\tconst editsProcessed: boolean[] = [];\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(log, simpleLogBaseView, (_, _2, wasCached) =>\n\t\t\teditsProcessed.push(wasCached)\n\t\t);\n\t\tconst before = viewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\tconst edit = newEdit([]);\n\t\tlog.addLocalEdit(edit);\n\t\tviewer.setKnownEditingResult(newEdit([]), {\n\t\t\tstatus: EditStatus.Applied,\n\t\t\tchanges: edit.changes,\n\t\t\tbefore,\n\t\t\tafter: arbitraryRevisionView,\n\t\t\tsteps: [],\n\t\t});\n\t\tconst after = viewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\texpect(editsProcessed).deep.equal([false]);\n\t\texpect(after).not.equal(arbitraryRevisionView);\n\t});\n\n\tit('uses known editing result with multiple edits', () => {\n\t\tconst log = new EditLog<ChangeInternal>();\n\t\tconst editsProcessed: boolean[] = [];\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(log, simpleLogBaseView, (_, _2, wasCached) =>\n\t\t\teditsProcessed.push(wasCached)\n\t\t);\n\t\tconst edit1 = newEdit([]);\n\t\tconst edit2 = newEdit([]);\n\t\tconst edit3 = newEdit([]);\n\t\tlog.addLocalEdit(edit1);\n\n\t\tconst before = viewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\texpect(editsProcessed).deep.equal([false]);\n\t\tlog.addLocalEdit(edit2);\n\t\tviewer.setKnownEditingResult(edit2, {\n\t\t\tstatus: EditStatus.Applied,\n\t\t\tchanges: edit2.changes,\n\t\t\tbefore,\n\t\t\tafter: arbitraryRevisionView,\n\t\t\tsteps: [],\n\t\t});\n\t\tconst after = viewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\texpect(editsProcessed).deep.equal([false, true]);\n\t\texpect(after).equal(arbitraryRevisionView);\n\t\tlog.addLocalEdit(edit3);\n\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\texpect(editsProcessed).deep.equal([false, true, false]);\n\t});\n\n\tit('caches the oldest in memory revision when edits are evicted', async () => {\n\t\tlet retainedRevision = 0;\n\t\tconst targetEditLogSize = 10;\n\t\tconst log = new EditLog<ChangeInternal>(\n\t\t\tundefined,\n\t\t\tundefined,\n\t\t\tundefined,\n\t\t\ttargetEditLogSize,\n\t\t\ttargetEditLogSize * 2\n\t\t);\n\t\tconst viewer = getCachingLogViewerAssumeAppliedEdits(log, simpleLogBaseView);\n\n\t\tviewer.on(CachingLogViewerDiagnosticEvents.RevisionRetained, (revision) => {\n\t\t\tretainedRevision = revision;\n\t\t});\n\n\t\t// Add enough edits to the log to start evicting\n\t\tfor (let i = 0; i < targetEditLogSize; i++) {\n\t\t\tconst edit = newEdit([]);\n\t\t\tlog.addSequencedEdit(edit, { sequenceNumber: i, referenceSequenceNumber: i - 1 });\n\t\t\texpect(log.getIndexOfId(edit.id)).equals(i);\n\t\t}\n\t\texpect(log.length)\n\t\t\t.equals(log.numberOfSequencedEdits)\n\t\t\t.and.equals(targetEditLogSize, 'Only sequenced edits should be present.');\n\n\t\t// Add more edits so that the oldest get evicted\n\t\tfor (let i = 0; i < targetEditLogSize; i++) {\n\t\t\tconst edit = newEdit([]);\n\t\t\tconst sequenceNumber = targetEditLogSize + i;\n\t\t\tlog.addSequencedEdit(edit, {\n\t\t\t\tsequenceNumber,\n\t\t\t\treferenceSequenceNumber: sequenceNumber - 1,\n\t\t\t\tminimumSequenceNumber: sequenceNumber - 1,\n\t\t\t});\n\t\t}\n\n\t\t// Check to see that the revision was retained\n\t\texpect(retainedRevision).to.equal(targetEditLogSize);\n\n\t\t// Make sure retrieving the latest revision is possible after edit eviction\n\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t});\n\n\tdescribe('Callbacks', () => {\n\t\tfunction getViewer(): {\n\t\t\tlog: EditLog<ChangeInternal>;\n\t\t\tviewer: CachingLogViewer;\n\t\t\tevents: SequencedEditResult[];\n\t\t} {\n\t\t\tconst log = getTestTreeLog(testTree);\n\t\t\tconst events: SequencedEditResult[] = [];\n\t\t\tconst viewer = new CachingLogViewer(\n\t\t\t\tlog,\n\t\t\t\tsimpleLogBaseView,\n\t\t\t\tundefined,\n\t\t\t\tundefined,\n\t\t\t\t(args: SequencedEditResult) => events.push(args)\n\t\t\t);\n\t\t\treturn { log, viewer, events };\n\t\t}\n\n\t\tfunction addInvalidEdit(log: EditLog<ChangeInternal>): Edit<ChangeInternal> {\n\t\t\t// Add a local edit that will be invalid (inserts a node at a location that doesn't exist)\n\t\t\tconst edit = newEdit(\n\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\t\texpectDefined(\n\t\t\t\t\t\tStablePlaceInternal.atEndOf({\n\t\t\t\t\t\t\tlabel: testTraitLabel,\n\t\t\t\t\t\t\tparent: testTree.generateNodeId(),\n\t\t\t\t\t\t})\n\t\t\t\t\t)\n\t\t\t\t)\n\t\t\t);\n\t\t\tlog.addLocalEdit(edit);\n\t\t\treturn edit;\n\t\t}\n\n\t\tit('processSequencedEditResult is called when a sequenced edit is applied', async () => {\n\t\t\tconst { log, events, viewer } = getViewer();\n\t\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\tevents.splice(0);\n\n\t\t\t// Non-sequenced edit should not trigger a call\n\t\t\tconst invalidEdit = addInvalidEdit(log);\n\t\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\texpect(events.length).equals(0);\n\n\t\t\tlog.addSequencedEdit(invalidEdit, { sequenceNumber: 3, referenceSequenceNumber: 2 });\n\t\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\texpect(events.length).equals(1);\n\t\t\texpect(events[0].edit.id).equals(invalidEdit.id);\n\t\t\texpect(events[0].wasLocal).equals(true);\n\t\t\texpect(events[0].result.status).equals(EditStatus.Invalid);\n\t\t\texpect(events[0].reconciliationPath.length).equals(0);\n\n\t\t\tconst validEdit1 = newEdit(\n\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\t\tStablePlaceInternal.atStartOf(testTree.left.traitLocation)\n\t\t\t\t)\n\t\t\t);\n\t\t\tlog.addSequencedEdit(validEdit1, { sequenceNumber: 3, referenceSequenceNumber: 2 });\n\t\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\texpect(events.length).equals(2);\n\t\t\texpect(events[1].edit.id).equals(validEdit1.id);\n\t\t\texpect(events[1].wasLocal).equals(false);\n\t\t\texpect(events[1].result.status).equals(EditStatus.Applied);\n\t\t\texpect(events[1].reconciliationPath.length).equals(0);\n\n\t\t\tconst validEdit2 = newEdit(\n\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t[testTree.buildLeafInternal()],\n\t\t\t\t\tStablePlaceInternal.atStartOf(testTree.left.traitLocation)\n\t\t\t\t)\n\t\t\t);\n\t\t\tlog.addSequencedEdit(validEdit2, { sequenceNumber: 4, referenceSequenceNumber: 2 });\n\t\t\tviewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\t\t\texpect(events.length).equals(3);\n\t\t\texpect(events[2].edit.id).equals(validEdit2.id);\n\t\t\texpect(events[2].wasLocal).equals(false);\n\t\t\texpect(events[2].result.status).equals(EditStatus.Applied);\n\t\t\texpect(events[2].reconciliationPath.length).equals(1);\n\t\t});\n\t});\n\n\tdescribe('Sequencing', () => {\n\t\tfunction addFakeEdit(\n\t\t\tlogViewer: CachingLogViewer,\n\t\t\tsequenceNumber: number,\n\t\t\treferenceSequenceNumber?: number\n\t\t): Edit<unknown> {\n\t\t\tconst id = String(sequenceNumber ?? uuidv4()) as EditId;\n\t\t\tconst edit = { changes: [ChangeInternal.setPayload(simpleLogBaseView.root, id)], id };\n\t\t\tlogViewer.log.addSequencedEdit(edit, {\n\t\t\t\tsequenceNumber,\n\t\t\t\treferenceSequenceNumber: referenceSequenceNumber ?? sequenceNumber - 1,\n\t\t\t});\n\t\t\treturn edit;\n\t\t}\n\n\t\tfunction minimalLogViewer(): CachingLogViewer {\n\t\t\treturn new CachingLogViewer(new EditLog(), simpleLogBaseView);\n\t\t}\n\n\t\tit('tracks the earliest sequenced edit in the session', () => {\n\t\t\tconst logViewer = minimalLogViewer();\n\t\t\texpect(logViewer.earliestSequencedEditInMemory()).undefined;\n\n\t\t\t// Non-sequenced edit\n\t\t\tlogViewer.log.addLocalEdit({ id: uuidv4() as EditId, changes: [] });\n\t\t\texpect(logViewer.earliestSequencedEditInMemory()).undefined;\n\n\t\t\t// First sequenced edit\n\t\t\tconst edit = addFakeEdit(logViewer, 123);\n\t\t\tconst expected = { edit, sequenceNumber: 123 };\n\t\t\texpect(logViewer.earliestSequencedEditInMemory()).deep.equals(expected);\n\n\t\t\t// Non-sequenced edit\n\t\t\tlogViewer.log.addLocalEdit({ id: uuidv4() as EditId, changes: [] });\n\t\t\texpect(logViewer.earliestSequencedEditInMemory()).deep.equals(expected);\n\n\t\t\t// Second sequenced edit\n\t\t\taddFakeEdit(logViewer, 456);\n\t\t\texpect(logViewer.earliestSequencedEditInMemory()).deep.equals(expected);\n\t\t});\n\n\t\tit('can provide edit results for sequenced edits', () => {\n\t\t\tconst logViewer = minimalLogViewer();\n\t\t\texpect(logViewer.getEditResultFromSequenceNumber(42)).undefined;\n\n\t\t\t// Non-sequenced edit\n\t\t\tlogViewer.log.addLocalEdit({ id: uuidv4() as EditId, changes: [] });\n\t\t\texpect(logViewer.getEditResultFromSequenceNumber(42)).undefined;\n\n\t\t\t// First sequenced edit\n\t\t\tconst edit1 = addFakeEdit(logViewer, 123);\n\t\t\texpect(logViewer.getEditResultFromSequenceNumber(42)).undefined;\n\t\t\tconst expected1 = {\n\t\t\t\tid: edit1.id,\n\t\t\t};\n\t\t\texpect(logViewer.getEditResultFromSequenceNumber(123)).contains(expected1);\n\t\t\t// Check that when no such sequence number exists, the closest earlier edit is returned\n\t\t\texpect(logViewer.getEditResultFromSequenceNumber(124)).contains(expected1);\n\n\t\t\t// Second sequenced edit\n\t\t\t// Note that this edit is given a greater sequence number than simply incrementing after edit 1.\n\t\t\t// This is deliberately done to simulate scenarios where a given DDS may not be sent all sequenced ops (because an other DDS\n\t\t\t// might be receiving them).\n\t\t\tconst edit2 = addFakeEdit(logViewer, 456);\n\t\t\texpect(logViewer.getEditResultFromSequenceNumber(123)).contains(expected1);\n\t\t\t// Check that when no such sequence number exists, the closest earlier edit is returned\n\t\t\texpect(logViewer.getEditResultFromSequenceNumber(124)).contains(expected1);\n\t\t\tconst expected2 = {\n\t\t\t\tid: edit2.id,\n\t\t\t};\n\t\t\texpect(logViewer.getEditResultFromSequenceNumber(456)).contains(expected2);\n\t\t\t// Check that when no such sequence number exists, the closest earlier edit is returned\n\t\t\texpect(logViewer.getEditResultFromSequenceNumber(457)).contains(expected2);\n\t\t});\n\n\t\tit('can provide the reconciliation path for an edit', () => {\n\t\t\tconst logViewer = minimalLogViewer();\n\n\t\t\tfunction expectReconciliationPath(edit: Edit<unknown>, path: Edit<unknown>[]) {\n\t\t\t\tconst actual = logViewer.reconciliationPathFromEdit(edit.id);\n\t\t\t\texpect(actual.length).equals(path.length);\n\t\t\t\tfor (let i = 0; i < path.length; ++i) {\n\t\t\t\t\texpect(actual[i].length).equals(1);\n\t\t\t\t\tconst change = actual[i][0].resolvedChange as SetValueInternal;\n\t\t\t\t\texpect(change.payload).equals(path[i].id);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Non-sequenced edit\n\t\t\tconst nonSeqEdit = { id: uuidv4() as EditId, changes: [] };\n\t\t\tlogViewer.log.addLocalEdit(nonSeqEdit);\n\t\t\texpectReconciliationPath(nonSeqEdit, []);\n\n\t\t\tconst edit1 = addFakeEdit(logViewer, 1001);\n\t\t\texpectReconciliationPath(edit1, []);\n\n\t\t\t// Note that this edit is given a greater sequence number than simply incrementing after edit 1.\n\t\t\t// This is deliberately done to simulate scenarios where a given DDS may not be sent all sequenced ops (because an other DDS\n\t\t\t// might be receiving them).\n\t\t\tconst edit2 = addFakeEdit(logViewer, 2001, 1001);\n\t\t\texpectReconciliationPath(edit2, []);\n\n\t\t\tconst edit3 = addFakeEdit(logViewer, 3001, 2000);\n\t\t\texpectReconciliationPath(edit3, [edit2]);\n\n\t\t\tconst edit4 = addFakeEdit(logViewer, 4001, 2500);\n\t\t\texpectReconciliationPath(edit4, [edit3]);\n\n\t\t\tconst edit5 = addFakeEdit(logViewer, 5001, 500);\n\t\t\texpectReconciliationPath(edit5, [edit1, edit2, edit3, edit4]);\n\t\t});\n\t});\n});\n"]}
@@ -3,12 +3,12 @@
3
3
  * Licensed under the MIT License.
4
4
  */
5
5
  import { expect } from 'chai';
6
- import { SharedTreeMergeHealthTelemetryHeartbeat } from '../MergeHealth';
7
- import { Change, ChangeType, StablePlace, StableRange } from '../ChangeTypes';
8
- import { ConstraintEffect, EditStatus } from '../persisted-types';
9
- import { TransactionInternal } from '../TransactionInternal';
10
- import { buildLeaf } from './utilities/TestNode';
11
- import { setUpTestSharedTree, setUpTestTree } from './utilities/TestUtilities';
6
+ import { SharedTreeMergeHealthTelemetryHeartbeat } from '../MergeHealth.js';
7
+ import { Change, ChangeType, StablePlace, StableRange } from '../ChangeTypes.js';
8
+ import { ConstraintEffect, EditStatus } from '../persisted-types/index.js';
9
+ import { TransactionInternal } from '../TransactionInternal.js';
10
+ import { buildLeaf } from './utilities/TestNode.js';
11
+ import { setUpTestSharedTree, setUpTestTree } from './utilities/TestUtilities.js';
12
12
  async function setupHeartbeat() {
13
13
  const events = [];
14
14
  const { tree, containerRuntimeFactory } = setUpTestSharedTree({
@@ -1 +1 @@
1
- {"version":3,"file":"MergeHealthTelemetryHeartbeat.tests.js","sourceRoot":"","sources":["../../src/test/MergeHealthTelemetryHeartbeat.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAG9B,OAAO,EAAE,uCAAuC,EAAE,MAAM,gBAAgB,CAAC;AAGzE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC9E,OAAO,EAAE,gBAAgB,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAClE,OAAO,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAC7D,OAAO,EAAE,SAAS,EAAY,MAAM,sBAAsB,CAAC;AAC3D,OAAO,EAAE,mBAAmB,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAE/E,KAAK,UAAU,cAAc;IAC5B,MAAM,MAAM,GAA0B,EAAE,CAAC;IACzC,MAAM,EAAE,IAAI,EAAE,uBAAuB,EAAE,GAAG,mBAAmB,CAAC;QAC7D,SAAS,EAAE,KAAK;QAChB,MAAM,EAAE,EAAE,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;QAC5F,YAAY,EAAE,IAAI;KAClB,CAAC,CAAC;IACH,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IACrC,MAAM,EAAE,IAAI,EAAE,cAAc,EAAE,GAAG,mBAAmB,CAAC;QACpD,uBAAuB;QACvB,EAAE,EAAE,sBAAsB;QAC1B,SAAS,EAAE,KAAK;QAChB,YAAY,EAAE,IAAI;KAClB,CAAC,CAAC;IACH,MAAM,SAAS,GAAG,IAAI,uCAAuC,EAAE,CAAC;IAChE,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;IAC7C,IAAI,CAAC,SAAS,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;IACjE,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAC3B,OAAO;QACN,IAAI;QACJ,QAAQ;QACR,cAAc;QACd,uBAAuB;QACvB,MAAM;QACN,SAAS;KACT,CAAC;AACH,CAAC;AAED,SAAS,KAAK,CAAC,IAAgB,EAAE,uBAAoD;IACpF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;IAC7C,OAAO,IAAI,CAAC,SAAS,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;AACzE,CAAC;AAED,SAAS,YAAY,CACpB,oBAA4B,EAC5B,SAIC;IAED,OAAO,EAAE,CAAC,cAAc,oBAAoB,EAAE,EAAE,KAAK,IAAI,EAAE;QAC1D,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,cAAc,EAAE,uBAAuB,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,cAAc,EAAE,CAAC;QAC9G,MAAM,MAAM,GAAG,SAAS,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAC;QAC7D,SAAS,CAAC,SAAS,EAAE,CAAC;QACtB,IAAI,MAAM,CAAC,eAAe,KAAK,SAAS,EAAE;YACzC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,eAAe,EAAE;gBAC1C,cAAc,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC;aAClC;SACD;QACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE;YAChC,IAAI,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC;SACxB;QACD,KAAK,CAAC,IAAI,EAAE,uBAAuB,CAAC,CAAC;QACrC,SAAS,CAAC,cAAc,EAAE,CAAC;QAC3B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,kBAAkB,CAC1B,oBAA4B,EAC5B,MAAqF,EACrF,MAAqC;IAErC,OAAO,EAAE,CAAC,qBAAqB,oBAAoB,EAAE,EAAE,GAAG,EAAE;QAC3D,MAAM,MAAM,GAA0B,EAAE,CAAC;QACzC,MAAM,MAAM,GAAG,EAAE,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACvD,MAAM,SAAS,GAAG,IAAI,uCAAuC,EAAE,CAAC;QAChE,IAAI,aAAwC,CAAC;QAC7C,MAAM,QAAQ,GAAG;YAChB,EAAE,EAAE,CAAC,KAAa,EAAE,QAAkC,EAAE,EAAE;gBACzD,aAAa,GAAG,QAAQ,CAAC;YAC1B,CAAC;SACD,CAAC;QACF,SAAS,CAAC,UAAU,CAAC,QAAsB,CAAC,CAAC;QAC7C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YAC3B,aAAa,CAAC;gBACb,IAAI,EAAE,QAAQ;gBACd,MAAM;gBACN,IAAI,EAAE,EAAE;gBACR,kBAAkB,EAAE,EAAE;gBACtB,KAAK,EAAE,EAAE;gBACT,QAAQ,EAAE,IAAI;gBACd,OAAO,EAAE;oBACR,MAAM,EAAE,UAAU,CAAC,OAAO;iBAC1B;gBACD,GAAG,KAAK;aACR,CAAC,CAAC;SACH;QACD,SAAS,CAAC,cAAc,EAAE,CAAC;QAC3B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxC,MAAM,CAAC,KAAK,CAAC,CAAC;IACf,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,QAAQ,CAAC,yCAAyC,EAAE,GAAG,EAAE;IACxD,EAAE,CAAC,gDAAgD,EAAE,KAAK,IAAI,EAAE;QAC/D,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,uBAAuB,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,cAAc,EAAE,CAAC;QAC9F,IAAI,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/F,KAAK,CAAC,IAAI,EAAE,uBAAuB,CAAC,CAAC;QACrC,oDAAoD;QACpD,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACrD,wCAAwC;QACxC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8BAA8B,EAAE,KAAK,IAAI,EAAE;QAC7C,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,uBAAuB,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,cAAc,EAAE,CAAC;QAC9F,IAAI,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/F,KAAK,CAAC,IAAI,EAAE,uBAAuB,CAAC,CAAC;QACrC,SAAS,CAAC,cAAc,EAAE,CAAC;QAC3B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;YAC1B,QAAQ,EAAE,WAAW;YACrB,SAAS,EAAE,iDAAiD;SAC5D,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;QACpE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,cAAc,EAAE,uBAAuB,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,cAAc,EAAE,CAAC;QAC9G,cAAc,CAAC,SAAS,CACvB,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CACjG,CAAC;QACF,KAAK,CAAC,IAAI,EAAE,uBAAuB,CAAC,CAAC;QACrC,SAAS,CAAC,cAAc,EAAE,CAAC;QAC3B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,8BAA8B,EAAE,GAAG,EAAE;QAC7C,YAAY,CAAC,aAAa,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;YAC9C,KAAK,EAAE;gBACN,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC3E,MAAM,CAAC,UAAU,CAChB,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EACtB,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAChE;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACzC,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CAAC,4BAA4B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC7E,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,KAAK,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;YACpF,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,KAAK,CAAC,4BAA4B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtD,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CACX,gEAAgE,EAChE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAClC,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1F,KAAK,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;YACpF,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,KAAK,CAAC,4BAA4B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtD,CAAC;SACD,CAAC,CACF,CAAC;QAEF,YAAY,CACX,+DAA+D,EAC/D,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAClC,mEAAmE;YACnE,eAAe,EAAE;gBAChB,MAAM,CAAC,IAAI,CACV,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAC3D,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC,CAC3E;aACD;YACD,KAAK,EAAE;gBACN;oBACC,MAAM,CAAC,MAAM,CACZ,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CACrD,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAChD,CACD;iBACD;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,KAAK,CAAC,2CAA2C,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACrE,CAAC;SACD,CAAC,CACF,CAAC;QAEF,YAAY,CAAC,6DAA6D,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC9G,6EAA6E;YAC7E,eAAe,EAAE;gBAChB,MAAM,CAAC,IAAI,CACV,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAC5D,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC,CAC5E;aACD;YACD,KAAK,EAAE;gBACN;oBACC,MAAM,CAAC,MAAM,CACZ,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CACzF;iBACD;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,KAAK,CAAC,yBAAyB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACnD,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CACX,+DAA+D,EAC/D,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAClC,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,KAAK,EAAE;gBACN,MAAM,CAAC,UAAU,CAChB,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EACtB,WAAW,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAC5F;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,KAAK,CAAC,4BAA4B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtD,CAAC;SACD,CAAC,CACF,CAAC;QAEF,YAAY,CAAC,4BAA4B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC7E,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CAAC,6BAA6B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC9E,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,KAAK,EAAE;gBACN;oBACC;wBACC,IAAI,EAAE,UAAU,CAAC,UAAU;wBAC3B,WAAW,EAAE,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;wBAC5C,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;qBAC1C;iBACD;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACjD,MAAM,CAAC,KAAK,CAAC,6BAA6B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACvD,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CAAC,8BAA8B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/E,eAAe,EAAE;gBAChB,MAAM,CAAC,IAAI,CACV,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAC5D,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAC5D;aACD;YACD,KAAK,EAAE;gBACN;oBACC;wBACC,IAAI,EAAE,UAAU,CAAC,UAAU;wBAC3B,WAAW,EAAE,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC;wBACzD,MAAM,EAAE,CAAC;wBACT,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;qBAC1C;iBACD;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACjD,MAAM,CAAC,KAAK,CAAC,8BAA8B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACxD,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CAAC,8BAA8B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/E,eAAe,EAAE;gBAChB,MAAM,CAAC,IAAI,CACV,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAC5D,WAAW,CAAC,SAAS,CAAC;oBACrB,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;oBACjD,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;iBAC/B,CAAC,CACF;aACD;YACD,KAAK,EAAE;gBACN;oBACC;wBACC,IAAI,EAAE,UAAU,CAAC,UAAU;wBAC3B,WAAW,EAAE,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;wBAC7C,UAAU,EAAE,QAAQ,CAAC,UAAU;wBAC/B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;qBAC1C;iBACD;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACjD,MAAM,CAAC,KAAK,CAAC,8BAA8B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACxD,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CAAC,6BAA6B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC9E,eAAe,EAAE;gBAChB,MAAM,CAAC,IAAI,CACV,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAC3D,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAC7D;aACD;YACD,KAAK,EAAE;gBACN;oBACC;wBACC,IAAI,EAAE,UAAU,CAAC,UAAU;wBAC3B,WAAW,EAAE,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;wBAC5C,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;wBAC/B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;qBAC1C;iBACD;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACjD,MAAM,CAAC,KAAK,CAAC,6BAA6B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACvD,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CAAC,+BAA+B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE;YAC9E,MAAM,iBAAiB,GAAG,cAAc,CAAC;YACzC,OAAO;gBACN,eAAe,EAAE;oBAChB,MAAM,CAAC,UAAU,CAChB,CAAC,SAAS,CAAC,cAAc,CAAC,cAAc,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAC7D,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAC5D;iBACD;gBACD,KAAK,EAAE;oBACN,MAAM,CAAC,UAAU,CAChB,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAChE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAChC;iBACD;gBACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;oBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBACxC,MAAM,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC7C,CAAC;aACD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,YAAY,CAAC,0BAA0B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3E,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YACxD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACxC,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,gEAAgE;QAChE,kBAAkB,CACjB,aAAa,EACb;YACC,EAAE,kBAAkB,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,EAAE,kBAAkB,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,EAAE,kBAAkB,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,EAAE,kBAAkB,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,EAAE,kBAAkB,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE;SACtC,EACD,CAAC,KAAK,EAAE,EAAE;YACT,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;QACtD,CAAC,CACD,CAAC;QAEF,2FAA2F;QAC3F,kBAAkB,CACjB,oCAAoC,EACpC;YACC;gBACC,IAAI,EAAE,EAAE,gBAAgB,EAAE,EAAE,EAAE;aAC9B;YACD;gBACC,IAAI,EAAE,EAAE,gBAAgB,EAAE,EAAE,EAAE;aAC9B;YACD;gBACC,IAAI,EAAE,EAAE,gBAAgB,EAAE,EAAE,EAAE;aAC9B;SACD,EACD,CAAC,KAAK,EAAE,EAAE;YACT,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1C,CAAC,CACD,CAAC;QAEF,sHAAsH;QACtH,gCAAgC;QAChC,kBAAkB,CACjB,8BAA8B,EAC9B;YACC;gBACC,OAAO,EAAE;oBACR,MAAM,EAAE,UAAU,CAAC,SAAS;oBAC5B,OAAO,EAAE,EAAE,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,sBAAsB,EAAE;iBACzE;aACD;SACD,EACD,CAAC,KAAK,EAAE,EAAE;YACT,8HAA8H;YAC9H,4BAA4B;YAC5B,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC,CACD,CAAC;IACH,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { expect } from 'chai';\nimport { ITelemetryBaseEvent } from '@fluidframework/core-interfaces';\nimport { MockContainerRuntimeFactory } from '@fluidframework/test-runtime-utils';\nimport { SharedTreeMergeHealthTelemetryHeartbeat } from '../MergeHealth';\nimport { SequencedEditAppliedEventArguments, SharedTree } from '../SharedTree';\nimport { RevisionView } from '../RevisionView';\nimport { Change, ChangeType, StablePlace, StableRange } from '../ChangeTypes';\nimport { ConstraintEffect, EditStatus } from '../persisted-types';\nimport { TransactionInternal } from '../TransactionInternal';\nimport { buildLeaf, TestTree } from './utilities/TestNode';\nimport { setUpTestSharedTree, setUpTestTree } from './utilities/TestUtilities';\n\nasync function setupHeartbeat() {\n\tconst events: ITelemetryBaseEvent[] = [];\n\tconst { tree, containerRuntimeFactory } = setUpTestSharedTree({\n\t\tlocalMode: false,\n\t\tlogger: { send: (event) => !event.eventName.includes('IdCompressor') && events.push(event) },\n\t\tallowInvalid: true,\n\t});\n\tconst testTree = setUpTestTree(tree);\n\tconst { tree: concurrentTree } = setUpTestSharedTree({\n\t\tcontainerRuntimeFactory,\n\t\tid: 'secondTestSharedTree',\n\t\tlocalMode: false,\n\t\tallowInvalid: true,\n\t});\n\tconst heartbeat = new SharedTreeMergeHealthTelemetryHeartbeat();\n\tcontainerRuntimeFactory.processAllMessages();\n\ttree.logViewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\theartbeat.attachTree(tree);\n\treturn {\n\t\ttree,\n\t\ttestTree,\n\t\tconcurrentTree,\n\t\tcontainerRuntimeFactory,\n\t\tevents,\n\t\theartbeat,\n\t};\n}\n\nfunction flush(tree: SharedTree, containerRuntimeFactory: MockContainerRuntimeFactory): RevisionView {\n\tcontainerRuntimeFactory.processAllMessages();\n\treturn tree.logViewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n}\n\nfunction itAggregates(\n\tnameOfAggregatedData: string,\n\tparamFunc: (params: { tree: SharedTree; testTree: TestTree; concurrentTree: SharedTree }) => {\n\t\tedits: Change[][];\n\t\tconcurrentEdits?: Change[][];\n\t\taction: (ITelemetryBaseEvent) => void;\n\t}\n): Mocha.Test {\n\treturn it(`Aggregates ${nameOfAggregatedData}`, async () => {\n\t\tconst { tree, testTree, concurrentTree, containerRuntimeFactory, events, heartbeat } = await setupHeartbeat();\n\t\tconst params = paramFunc({ tree, testTree, concurrentTree });\n\t\theartbeat.clearData();\n\t\tif (params.concurrentEdits !== undefined) {\n\t\t\tfor (const edit of params.concurrentEdits) {\n\t\t\t\tconcurrentTree.applyEdit(...edit);\n\t\t\t}\n\t\t}\n\t\tfor (const edit of params.edits) {\n\t\t\ttree.applyEdit(...edit);\n\t\t}\n\t\tflush(tree, containerRuntimeFactory);\n\t\theartbeat.flushHeartbeat();\n\t\texpect(events.length).greaterThan(0);\n\t\tparams.action(events[events.length - 1]);\n\t});\n}\n\nfunction itAggregatesMocked(\n\tnameOfAggregatedData: string,\n\tparams: readonly Partial<Record<keyof SequencedEditAppliedEventArguments, unknown>>[],\n\taction: (ITelemetryBaseEvent) => void\n): Mocha.Test {\n\treturn it(`Aggregates mocked ${nameOfAggregatedData}`, () => {\n\t\tconst events: ITelemetryBaseEvent[] = [];\n\t\tconst logger = { send: (event) => events.push(event) };\n\t\tconst heartbeat = new SharedTreeMergeHealthTelemetryHeartbeat();\n\t\tlet savedListener!: (...args: any[]) => void;\n\t\tconst mockTree = {\n\t\t\ton: (event: string, listener: (...args: any[]) => void) => {\n\t\t\t\tsavedListener = listener;\n\t\t\t},\n\t\t};\n\t\theartbeat.attachTree(mockTree as SharedTree);\n\t\tfor (const param of params) {\n\t\t\tsavedListener({\n\t\t\t\ttree: mockTree,\n\t\t\t\tlogger,\n\t\t\t\tedit: {},\n\t\t\t\treconciliationPath: [],\n\t\t\t\tsteps: [],\n\t\t\t\twasLocal: true,\n\t\t\t\toutcome: {\n\t\t\t\t\tstatus: EditStatus.Applied,\n\t\t\t\t},\n\t\t\t\t...param,\n\t\t\t});\n\t\t}\n\t\theartbeat.flushHeartbeat();\n\t\texpect(events.length).greaterThan(0);\n\t\tconst event = events[events.length - 1];\n\t\taction(event);\n\t});\n}\n\ndescribe('SharedTreeMergeHealthTelemetryHeartbeat', () => {\n\tit('Does not automatically send data synchronously', async () => {\n\t\tconst { tree, testTree, containerRuntimeFactory, events, heartbeat } = await setupHeartbeat();\n\t\ttree.applyEdit(...Change.insertTree([testTree.buildLeaf()], StablePlace.after(testTree.left)));\n\t\tflush(tree, containerRuntimeFactory);\n\t\t// Expect some data to have made it to the heartbeat\n\t\texpect(heartbeat.getStats(tree).editCount).equals(1);\n\t\t// Expect no data was sent to the logger\n\t\texpect(events).deep.equals([]);\n\t});\n\n\tit('Can be flushed synchronously', async () => {\n\t\tconst { tree, testTree, containerRuntimeFactory, events, heartbeat } = await setupHeartbeat();\n\t\ttree.applyEdit(...Change.insertTree([testTree.buildLeaf()], StablePlace.after(testTree.left)));\n\t\tflush(tree, containerRuntimeFactory);\n\t\theartbeat.flushHeartbeat();\n\t\texpect(events.length).equals(1);\n\t\texpect(events[0]).contains({\n\t\t\tcategory: 'Heartbeat',\n\t\t\teventName: 'SharedTree:SequencedEditApplied:EditMergeHealth',\n\t\t});\n\t});\n\n\tit('Does not send data if no local edits have been made', async () => {\n\t\tconst { tree, testTree, concurrentTree, containerRuntimeFactory, events, heartbeat } = await setupHeartbeat();\n\t\tconcurrentTree.applyEdit(\n\t\t\t...Change.insertTree([buildLeaf()], StablePlace.after(testTree.left.translateId(concurrentTree)))\n\t\t);\n\t\tflush(tree, containerRuntimeFactory);\n\t\theartbeat.flushHeartbeat();\n\t\texpect(events.length).equals(0);\n\t});\n\n\tdescribe('Aggregates merge health data', () => {\n\t\titAggregates('edit counts', ({ testTree }) => ({\n\t\t\tedits: [\n\t\t\t\tChange.insertTree([testTree.buildLeaf()], StablePlace.after(testTree.left)),\n\t\t\t\tChange.insertTree(\n\t\t\t\t\t[testTree.buildLeaf()],\n\t\t\t\t\tStablePlace.after(testTree.buildLeaf(testTree.generateNodeId()))\n\t\t\t\t),\n\t\t\t],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.editCount).equals(2);\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates('preventable place failures', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [[Change.delete(StableRange.only(testTree.left.translateId(concurrentTree)))]],\n\t\t\tedits: [Change.insertTree([testTree.buildLeaf()], StablePlace.after(testTree.left))],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.badPlaceCount).equals(1);\n\t\t\t\texpect(event.deletedSiblingBadPlaceCount).equals(1);\n\t\t\t\texpect(event.deletedAncestorBadPlaceCount).equals(0);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates(\n\t\t\t'failures for the parent of a sibling-based place being deleted',\n\t\t\t({ testTree, concurrentTree }) => ({\n\t\t\t\tconcurrentEdits: [[Change.delete(StableRange.only(testTree.translateId(concurrentTree)))]],\n\t\t\t\tedits: [Change.insertTree([testTree.buildLeaf()], StablePlace.after(testTree.left))],\n\t\t\t\taction: (event) => {\n\t\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\t\texpect(event.badPlaceCount).equals(1);\n\t\t\t\t\texpect(event.deletedSiblingBadPlaceCount).equals(1);\n\t\t\t\t\texpect(event.deletedAncestorBadPlaceCount).equals(0);\n\t\t\t\t},\n\t\t\t})\n\t\t);\n\n\t\titAggregates(\n\t\t\t'failures for a range made of valid places in different traits',\n\t\t\t({ testTree, concurrentTree }) => ({\n\t\t\t\t// Move the \"right\" node to another trait to make the range invalid\n\t\t\t\tconcurrentEdits: [\n\t\t\t\t\tChange.move(\n\t\t\t\t\t\tStableRange.only(testTree.left.translateId(concurrentTree)),\n\t\t\t\t\t\tStablePlace.atEndOf(testTree.right.traitLocation.translate(concurrentTree))\n\t\t\t\t\t),\n\t\t\t\t],\n\t\t\t\tedits: [\n\t\t\t\t\t[\n\t\t\t\t\t\tChange.delete(\n\t\t\t\t\t\t\tStableRange.from(StablePlace.before(testTree.left)).to(\n\t\t\t\t\t\t\t\tStablePlace.atEndOf(testTree.left.traitLocation)\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],\n\t\t\t\taction: (event) => {\n\t\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\t\texpect(event.badRangeCount).equals(1);\n\t\t\t\t\texpect(event.deletedSiblingBadRangeCount).equals(0);\n\t\t\t\t\texpect(event.updatedRangeHasPlacesInDifferentTraitsCount).equals(1);\n\t\t\t\t},\n\t\t\t})\n\t\t);\n\n\t\titAggregates('failures for a range made of valid places that are inverted', ({ testTree, concurrentTree }) => ({\n\t\t\t// Move the \"right\" node to the start of the trait to make the range inverted\n\t\t\tconcurrentEdits: [\n\t\t\t\tChange.move(\n\t\t\t\t\tStableRange.only(testTree.right.translateId(concurrentTree)),\n\t\t\t\t\tStablePlace.atStartOf(testTree.left.traitLocation.translate(concurrentTree))\n\t\t\t\t),\n\t\t\t],\n\t\t\tedits: [\n\t\t\t\t[\n\t\t\t\t\tChange.delete(\n\t\t\t\t\t\tStableRange.from(StablePlace.after(testTree.left)).to(StablePlace.before(testTree.right))\n\t\t\t\t\t),\n\t\t\t\t],\n\t\t\t],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.badRangeCount).equals(1);\n\t\t\t\texpect(event.deletedSiblingBadRangeCount).equals(0);\n\t\t\t\texpect(event.updatedRangeInvertedCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates(\n\t\t\t'failures for the parent of a parent-based place being deleted',\n\t\t\t({ testTree, concurrentTree }) => ({\n\t\t\t\tconcurrentEdits: [[Change.delete(StableRange.only(testTree.left.translateId(concurrentTree)))]],\n\t\t\t\tedits: [\n\t\t\t\t\tChange.insertTree(\n\t\t\t\t\t\t[testTree.buildLeaf()],\n\t\t\t\t\t\tStablePlace.atStartOf({ parent: testTree.left.identifier, label: testTree.left.traitLabel })\n\t\t\t\t\t),\n\t\t\t\t],\n\t\t\t\taction: (event) => {\n\t\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\t\texpect(event.badPlaceCount).equals(1);\n\t\t\t\t\texpect(event.deletedSiblingBadPlaceCount).equals(0);\n\t\t\t\t\texpect(event.deletedAncestorBadPlaceCount).equals(1);\n\t\t\t\t},\n\t\t\t})\n\t\t);\n\n\t\titAggregates('preventable range failures', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [[Change.delete(StableRange.only(testTree.left.translateId(concurrentTree)))]],\n\t\t\tedits: [[Change.delete(StableRange.only(testTree.left))]],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.badRangeCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates('range constraint violations', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [[Change.delete(StableRange.only(testTree.left.translateId(concurrentTree)))]],\n\t\t\tedits: [\n\t\t\t\t[\n\t\t\t\t\t{\n\t\t\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t\t\t\ttoConstrain: StableRange.only(testTree.left),\n\t\t\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.constraintViolationCount).equals(1);\n\t\t\t\texpect(event.rangeConstraintViolationCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates('length constraint violations', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [\n\t\t\t\tChange.move(\n\t\t\t\t\tStableRange.only(testTree.right.translateId(concurrentTree)),\n\t\t\t\t\tStablePlace.after(testTree.left.translateId(concurrentTree))\n\t\t\t\t),\n\t\t\t],\n\t\t\tedits: [\n\t\t\t\t[\n\t\t\t\t\t{\n\t\t\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t\t\t\ttoConstrain: StableRange.all(testTree.left.traitLocation),\n\t\t\t\t\t\tlength: 1,\n\t\t\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.constraintViolationCount).equals(1);\n\t\t\t\texpect(event.lengthConstraintViolationCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates('parent constraint violations', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [\n\t\t\t\tChange.move(\n\t\t\t\t\tStableRange.only(testTree.right.translateId(concurrentTree)),\n\t\t\t\t\tStablePlace.atStartOf({\n\t\t\t\t\t\tparent: testTree.left.translateId(concurrentTree),\n\t\t\t\t\t\tlabel: testTree.left.traitLabel,\n\t\t\t\t\t})\n\t\t\t\t),\n\t\t\t],\n\t\t\tedits: [\n\t\t\t\t[\n\t\t\t\t\t{\n\t\t\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t\t\t\ttoConstrain: StableRange.only(testTree.right),\n\t\t\t\t\t\tparentNode: testTree.identifier,\n\t\t\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.constraintViolationCount).equals(1);\n\t\t\t\texpect(event.parentConstraintViolationCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates('label constraint violations', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [\n\t\t\t\tChange.move(\n\t\t\t\t\tStableRange.only(testTree.left.translateId(concurrentTree)),\n\t\t\t\t\tStablePlace.after(testTree.right.translateId(concurrentTree))\n\t\t\t\t),\n\t\t\t],\n\t\t\tedits: [\n\t\t\t\t[\n\t\t\t\t\t{\n\t\t\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t\t\t\ttoConstrain: StableRange.only(testTree.left),\n\t\t\t\t\t\tlabel: testTree.left.traitLabel,\n\t\t\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.constraintViolationCount).equals(1);\n\t\t\t\texpect(event.labelConstraintViolationCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates('failures due to ID collisions', ({ testTree, concurrentTree }) => {\n\t\t\tconst duplicateOverride = 'duplicate ID';\n\t\t\treturn {\n\t\t\t\tconcurrentEdits: [\n\t\t\t\t\tChange.insertTree(\n\t\t\t\t\t\t[buildLeaf(concurrentTree.generateNodeId(duplicateOverride))],\n\t\t\t\t\t\tStablePlace.after(testTree.left.translateId(concurrentTree))\n\t\t\t\t\t),\n\t\t\t\t],\n\t\t\t\tedits: [\n\t\t\t\t\tChange.insertTree(\n\t\t\t\t\t\t[testTree.buildLeaf(testTree.generateNodeId(duplicateOverride))],\n\t\t\t\t\t\tStablePlace.after(testTree.left)\n\t\t\t\t\t),\n\t\t\t\t],\n\t\t\t\taction: (event) => {\n\t\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\t\texpect(event.idAlreadyInUseCount).equals(1);\n\t\t\t\t},\n\t\t\t};\n\t\t});\n\n\t\titAggregates('failures due unknown IDs', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [[Change.delete(StableRange.only(testTree.left.translateId(concurrentTree)))]],\n\t\t\tedits: [[Change.clearPayload(testTree.left.identifier)]],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.unknownIdCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\t// This test uses itAggregatesMocked to streamline the test code\n\t\titAggregatesMocked(\n\t\t\t'path length',\n\t\t\t[\n\t\t\t\t{ reconciliationPath: { length: 0 } },\n\t\t\t\t{ reconciliationPath: { length: 1 } },\n\t\t\t\t{ reconciliationPath: { length: 1 } },\n\t\t\t\t{ reconciliationPath: { length: 2 } },\n\t\t\t\t{ reconciliationPath: { length: 42 } },\n\t\t\t],\n\t\t\t(event) => {\n\t\t\t\texpect(event.pathLengths).equals('0:1,1:2,2:1,42:1');\n\t\t\t}\n\t\t);\n\n\t\t// This test uses itAggregatesMocked because multiple attempts are currently not being made\n\t\titAggregatesMocked(\n\t\t\t'maximum attempt number for an edit',\n\t\t\t[\n\t\t\t\t{\n\t\t\t\t\tedit: { pastAttemptCount: 40 },\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tedit: { pastAttemptCount: 42 },\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tedit: { pastAttemptCount: 41 },\n\t\t\t\t},\n\t\t\t],\n\t\t\t(event) => {\n\t\t\t\texpect(event.maxAttemptCount).equals(42);\n\t\t\t}\n\t\t);\n\n\t\t// This test uses itAggregatesMocked because there should be no way for a sequenced edit to become a malformed edit in\n\t\t// the face of concurrent edits.\n\t\titAggregatesMocked(\n\t\t\t'failures due malformed edits',\n\t\t\t[\n\t\t\t\t{\n\t\t\t\t\toutcome: {\n\t\t\t\t\t\tstatus: EditStatus.Malformed,\n\t\t\t\t\t\tfailure: { kind: TransactionInternal.FailureKind.UnusedDetachedSequence },\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t],\n\t\t\t(event) => {\n\t\t\t\t// This test has to mock a lot of things because there should be no way for a sequenced edit to become a malformed edit in the\n\t\t\t\t// face of concurrent edits.\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.malformedEditCount).equals(1);\n\t\t\t}\n\t\t);\n\t});\n});\n"]}
1
+ {"version":3,"file":"MergeHealthTelemetryHeartbeat.tests.js","sourceRoot":"","sources":["../../src/test/MergeHealthTelemetryHeartbeat.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAG9B,OAAO,EAAE,uCAAuC,EAAE,MAAM,mBAAmB,CAAC;AAG5E,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACjF,OAAO,EAAE,gBAAgB,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AAC3E,OAAO,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAChE,OAAO,EAAE,SAAS,EAAY,MAAM,yBAAyB,CAAC;AAC9D,OAAO,EAAE,mBAAmB,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAElF,KAAK,UAAU,cAAc;IAC5B,MAAM,MAAM,GAA0B,EAAE,CAAC;IACzC,MAAM,EAAE,IAAI,EAAE,uBAAuB,EAAE,GAAG,mBAAmB,CAAC;QAC7D,SAAS,EAAE,KAAK;QAChB,MAAM,EAAE,EAAE,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;QAC5F,YAAY,EAAE,IAAI;KAClB,CAAC,CAAC;IACH,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IACrC,MAAM,EAAE,IAAI,EAAE,cAAc,EAAE,GAAG,mBAAmB,CAAC;QACpD,uBAAuB;QACvB,EAAE,EAAE,sBAAsB;QAC1B,SAAS,EAAE,KAAK;QAChB,YAAY,EAAE,IAAI;KAClB,CAAC,CAAC;IACH,MAAM,SAAS,GAAG,IAAI,uCAAuC,EAAE,CAAC;IAChE,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;IAC7C,IAAI,CAAC,SAAS,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;IACjE,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAC3B,OAAO;QACN,IAAI;QACJ,QAAQ;QACR,cAAc;QACd,uBAAuB;QACvB,MAAM;QACN,SAAS;KACT,CAAC;AACH,CAAC;AAED,SAAS,KAAK,CAAC,IAAgB,EAAE,uBAAoD;IACpF,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;IAC7C,OAAO,IAAI,CAAC,SAAS,CAAC,uBAAuB,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;AACzE,CAAC;AAED,SAAS,YAAY,CACpB,oBAA4B,EAC5B,SAIC;IAED,OAAO,EAAE,CAAC,cAAc,oBAAoB,EAAE,EAAE,KAAK,IAAI,EAAE;QAC1D,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,cAAc,EAAE,uBAAuB,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,cAAc,EAAE,CAAC;QAC9G,MAAM,MAAM,GAAG,SAAS,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAC;QAC7D,SAAS,CAAC,SAAS,EAAE,CAAC;QACtB,IAAI,MAAM,CAAC,eAAe,KAAK,SAAS,EAAE;YACzC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,eAAe,EAAE;gBAC1C,cAAc,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC;aAClC;SACD;QACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE;YAChC,IAAI,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC;SACxB;QACD,KAAK,CAAC,IAAI,EAAE,uBAAuB,CAAC,CAAC;QACrC,SAAS,CAAC,cAAc,EAAE,CAAC;QAC3B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,kBAAkB,CAC1B,oBAA4B,EAC5B,MAAqF,EACrF,MAAqC;IAErC,OAAO,EAAE,CAAC,qBAAqB,oBAAoB,EAAE,EAAE,GAAG,EAAE;QAC3D,MAAM,MAAM,GAA0B,EAAE,CAAC;QACzC,MAAM,MAAM,GAAG,EAAE,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACvD,MAAM,SAAS,GAAG,IAAI,uCAAuC,EAAE,CAAC;QAChE,IAAI,aAAwC,CAAC;QAC7C,MAAM,QAAQ,GAAG;YAChB,EAAE,EAAE,CAAC,KAAa,EAAE,QAAkC,EAAE,EAAE;gBACzD,aAAa,GAAG,QAAQ,CAAC;YAC1B,CAAC;SACD,CAAC;QACF,SAAS,CAAC,UAAU,CAAC,QAAsB,CAAC,CAAC;QAC7C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YAC3B,aAAa,CAAC;gBACb,IAAI,EAAE,QAAQ;gBACd,MAAM;gBACN,IAAI,EAAE,EAAE;gBACR,kBAAkB,EAAE,EAAE;gBACtB,KAAK,EAAE,EAAE;gBACT,QAAQ,EAAE,IAAI;gBACd,OAAO,EAAE;oBACR,MAAM,EAAE,UAAU,CAAC,OAAO;iBAC1B;gBACD,GAAG,KAAK;aACR,CAAC,CAAC;SACH;QACD,SAAS,CAAC,cAAc,EAAE,CAAC;QAC3B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxC,MAAM,CAAC,KAAK,CAAC,CAAC;IACf,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,QAAQ,CAAC,yCAAyC,EAAE,GAAG,EAAE;IACxD,EAAE,CAAC,gDAAgD,EAAE,KAAK,IAAI,EAAE;QAC/D,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,uBAAuB,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,cAAc,EAAE,CAAC;QAC9F,IAAI,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/F,KAAK,CAAC,IAAI,EAAE,uBAAuB,CAAC,CAAC;QACrC,oDAAoD;QACpD,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACrD,wCAAwC;QACxC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8BAA8B,EAAE,KAAK,IAAI,EAAE;QAC7C,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,uBAAuB,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,cAAc,EAAE,CAAC;QAC9F,IAAI,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/F,KAAK,CAAC,IAAI,EAAE,uBAAuB,CAAC,CAAC;QACrC,SAAS,CAAC,cAAc,EAAE,CAAC;QAC3B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;YAC1B,QAAQ,EAAE,WAAW;YACrB,SAAS,EAAE,iDAAiD;SAC5D,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;QACpE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,cAAc,EAAE,uBAAuB,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,cAAc,EAAE,CAAC;QAC9G,cAAc,CAAC,SAAS,CACvB,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CACjG,CAAC;QACF,KAAK,CAAC,IAAI,EAAE,uBAAuB,CAAC,CAAC;QACrC,SAAS,CAAC,cAAc,EAAE,CAAC;QAC3B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,8BAA8B,EAAE,GAAG,EAAE;QAC7C,YAAY,CAAC,aAAa,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;YAC9C,KAAK,EAAE;gBACN,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC3E,MAAM,CAAC,UAAU,CAChB,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EACtB,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAChE;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACzC,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CAAC,4BAA4B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC7E,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,KAAK,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;YACpF,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,KAAK,CAAC,4BAA4B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtD,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CACX,gEAAgE,EAChE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAClC,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1F,KAAK,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;YACpF,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,KAAK,CAAC,4BAA4B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtD,CAAC;SACD,CAAC,CACF,CAAC;QAEF,YAAY,CACX,+DAA+D,EAC/D,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAClC,mEAAmE;YACnE,eAAe,EAAE;gBAChB,MAAM,CAAC,IAAI,CACV,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAC3D,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC,CAC3E;aACD;YACD,KAAK,EAAE;gBACN;oBACC,MAAM,CAAC,MAAM,CACZ,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CACrD,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAChD,CACD;iBACD;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,KAAK,CAAC,2CAA2C,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACrE,CAAC;SACD,CAAC,CACF,CAAC;QAEF,YAAY,CAAC,6DAA6D,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC9G,6EAA6E;YAC7E,eAAe,EAAE;gBAChB,MAAM,CAAC,IAAI,CACV,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAC5D,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC,CAC5E;aACD;YACD,KAAK,EAAE;gBACN;oBACC,MAAM,CAAC,MAAM,CACZ,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CACzF;iBACD;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,KAAK,CAAC,yBAAyB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACnD,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CACX,+DAA+D,EAC/D,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAClC,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,KAAK,EAAE;gBACN,MAAM,CAAC,UAAU,CAChB,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EACtB,WAAW,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAC5F;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,KAAK,CAAC,4BAA4B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtD,CAAC;SACD,CAAC,CACF,CAAC;QAEF,YAAY,CAAC,4BAA4B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC7E,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CAAC,6BAA6B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC9E,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,KAAK,EAAE;gBACN;oBACC;wBACC,IAAI,EAAE,UAAU,CAAC,UAAU;wBAC3B,WAAW,EAAE,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;wBAC5C,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;qBAC1C;iBACD;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACjD,MAAM,CAAC,KAAK,CAAC,6BAA6B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACvD,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CAAC,8BAA8B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/E,eAAe,EAAE;gBAChB,MAAM,CAAC,IAAI,CACV,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAC5D,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAC5D;aACD;YACD,KAAK,EAAE;gBACN;oBACC;wBACC,IAAI,EAAE,UAAU,CAAC,UAAU;wBAC3B,WAAW,EAAE,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC;wBACzD,MAAM,EAAE,CAAC;wBACT,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;qBAC1C;iBACD;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACjD,MAAM,CAAC,KAAK,CAAC,8BAA8B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACxD,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CAAC,8BAA8B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/E,eAAe,EAAE;gBAChB,MAAM,CAAC,IAAI,CACV,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAC5D,WAAW,CAAC,SAAS,CAAC;oBACrB,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;oBACjD,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;iBAC/B,CAAC,CACF;aACD;YACD,KAAK,EAAE;gBACN;oBACC;wBACC,IAAI,EAAE,UAAU,CAAC,UAAU;wBAC3B,WAAW,EAAE,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;wBAC7C,UAAU,EAAE,QAAQ,CAAC,UAAU;wBAC/B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;qBAC1C;iBACD;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACjD,MAAM,CAAC,KAAK,CAAC,8BAA8B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACxD,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CAAC,6BAA6B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC9E,eAAe,EAAE;gBAChB,MAAM,CAAC,IAAI,CACV,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAC3D,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAC7D;aACD;YACD,KAAK,EAAE;gBACN;oBACC;wBACC,IAAI,EAAE,UAAU,CAAC,UAAU;wBAC3B,WAAW,EAAE,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;wBAC5C,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;wBAC/B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;qBAC1C;iBACD;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACjD,MAAM,CAAC,KAAK,CAAC,6BAA6B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACvD,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CAAC,+BAA+B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE;YAC9E,MAAM,iBAAiB,GAAG,cAAc,CAAC;YACzC,OAAO;gBACN,eAAe,EAAE;oBAChB,MAAM,CAAC,UAAU,CAChB,CAAC,SAAS,CAAC,cAAc,CAAC,cAAc,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAC7D,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAC5D;iBACD;gBACD,KAAK,EAAE;oBACN,MAAM,CAAC,UAAU,CAChB,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAChE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAChC;iBACD;gBACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;oBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBACxC,MAAM,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC7C,CAAC;aACD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,YAAY,CAAC,0BAA0B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3E,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YACxD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACxC,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,gEAAgE;QAChE,kBAAkB,CACjB,aAAa,EACb;YACC,EAAE,kBAAkB,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,EAAE,kBAAkB,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,EAAE,kBAAkB,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,EAAE,kBAAkB,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,EAAE,kBAAkB,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE;SACtC,EACD,CAAC,KAAK,EAAE,EAAE;YACT,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;QACtD,CAAC,CACD,CAAC;QAEF,2FAA2F;QAC3F,kBAAkB,CACjB,oCAAoC,EACpC;YACC;gBACC,IAAI,EAAE,EAAE,gBAAgB,EAAE,EAAE,EAAE;aAC9B;YACD;gBACC,IAAI,EAAE,EAAE,gBAAgB,EAAE,EAAE,EAAE;aAC9B;YACD;gBACC,IAAI,EAAE,EAAE,gBAAgB,EAAE,EAAE,EAAE;aAC9B;SACD,EACD,CAAC,KAAK,EAAE,EAAE;YACT,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1C,CAAC,CACD,CAAC;QAEF,sHAAsH;QACtH,gCAAgC;QAChC,kBAAkB,CACjB,8BAA8B,EAC9B;YACC;gBACC,OAAO,EAAE;oBACR,MAAM,EAAE,UAAU,CAAC,SAAS;oBAC5B,OAAO,EAAE,EAAE,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,sBAAsB,EAAE;iBACzE;aACD;SACD,EACD,CAAC,KAAK,EAAE,EAAE;YACT,8HAA8H;YAC9H,4BAA4B;YAC5B,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC,CACD,CAAC;IACH,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { expect } from 'chai';\nimport { ITelemetryBaseEvent } from '@fluidframework/core-interfaces';\nimport { MockContainerRuntimeFactory } from '@fluidframework/test-runtime-utils';\nimport { SharedTreeMergeHealthTelemetryHeartbeat } from '../MergeHealth.js';\nimport { SequencedEditAppliedEventArguments, SharedTree } from '../SharedTree.js';\nimport { RevisionView } from '../RevisionView.js';\nimport { Change, ChangeType, StablePlace, StableRange } from '../ChangeTypes.js';\nimport { ConstraintEffect, EditStatus } from '../persisted-types/index.js';\nimport { TransactionInternal } from '../TransactionInternal.js';\nimport { buildLeaf, TestTree } from './utilities/TestNode.js';\nimport { setUpTestSharedTree, setUpTestTree } from './utilities/TestUtilities.js';\n\nasync function setupHeartbeat() {\n\tconst events: ITelemetryBaseEvent[] = [];\n\tconst { tree, containerRuntimeFactory } = setUpTestSharedTree({\n\t\tlocalMode: false,\n\t\tlogger: { send: (event) => !event.eventName.includes('IdCompressor') && events.push(event) },\n\t\tallowInvalid: true,\n\t});\n\tconst testTree = setUpTestTree(tree);\n\tconst { tree: concurrentTree } = setUpTestSharedTree({\n\t\tcontainerRuntimeFactory,\n\t\tid: 'secondTestSharedTree',\n\t\tlocalMode: false,\n\t\tallowInvalid: true,\n\t});\n\tconst heartbeat = new SharedTreeMergeHealthTelemetryHeartbeat();\n\tcontainerRuntimeFactory.processAllMessages();\n\ttree.logViewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n\theartbeat.attachTree(tree);\n\treturn {\n\t\ttree,\n\t\ttestTree,\n\t\tconcurrentTree,\n\t\tcontainerRuntimeFactory,\n\t\tevents,\n\t\theartbeat,\n\t};\n}\n\nfunction flush(tree: SharedTree, containerRuntimeFactory: MockContainerRuntimeFactory): RevisionView {\n\tcontainerRuntimeFactory.processAllMessages();\n\treturn tree.logViewer.getRevisionViewInMemory(Number.POSITIVE_INFINITY);\n}\n\nfunction itAggregates(\n\tnameOfAggregatedData: string,\n\tparamFunc: (params: { tree: SharedTree; testTree: TestTree; concurrentTree: SharedTree }) => {\n\t\tedits: Change[][];\n\t\tconcurrentEdits?: Change[][];\n\t\taction: (ITelemetryBaseEvent) => void;\n\t}\n): Mocha.Test {\n\treturn it(`Aggregates ${nameOfAggregatedData}`, async () => {\n\t\tconst { tree, testTree, concurrentTree, containerRuntimeFactory, events, heartbeat } = await setupHeartbeat();\n\t\tconst params = paramFunc({ tree, testTree, concurrentTree });\n\t\theartbeat.clearData();\n\t\tif (params.concurrentEdits !== undefined) {\n\t\t\tfor (const edit of params.concurrentEdits) {\n\t\t\t\tconcurrentTree.applyEdit(...edit);\n\t\t\t}\n\t\t}\n\t\tfor (const edit of params.edits) {\n\t\t\ttree.applyEdit(...edit);\n\t\t}\n\t\tflush(tree, containerRuntimeFactory);\n\t\theartbeat.flushHeartbeat();\n\t\texpect(events.length).greaterThan(0);\n\t\tparams.action(events[events.length - 1]);\n\t});\n}\n\nfunction itAggregatesMocked(\n\tnameOfAggregatedData: string,\n\tparams: readonly Partial<Record<keyof SequencedEditAppliedEventArguments, unknown>>[],\n\taction: (ITelemetryBaseEvent) => void\n): Mocha.Test {\n\treturn it(`Aggregates mocked ${nameOfAggregatedData}`, () => {\n\t\tconst events: ITelemetryBaseEvent[] = [];\n\t\tconst logger = { send: (event) => events.push(event) };\n\t\tconst heartbeat = new SharedTreeMergeHealthTelemetryHeartbeat();\n\t\tlet savedListener!: (...args: any[]) => void;\n\t\tconst mockTree = {\n\t\t\ton: (event: string, listener: (...args: any[]) => void) => {\n\t\t\t\tsavedListener = listener;\n\t\t\t},\n\t\t};\n\t\theartbeat.attachTree(mockTree as SharedTree);\n\t\tfor (const param of params) {\n\t\t\tsavedListener({\n\t\t\t\ttree: mockTree,\n\t\t\t\tlogger,\n\t\t\t\tedit: {},\n\t\t\t\treconciliationPath: [],\n\t\t\t\tsteps: [],\n\t\t\t\twasLocal: true,\n\t\t\t\toutcome: {\n\t\t\t\t\tstatus: EditStatus.Applied,\n\t\t\t\t},\n\t\t\t\t...param,\n\t\t\t});\n\t\t}\n\t\theartbeat.flushHeartbeat();\n\t\texpect(events.length).greaterThan(0);\n\t\tconst event = events[events.length - 1];\n\t\taction(event);\n\t});\n}\n\ndescribe('SharedTreeMergeHealthTelemetryHeartbeat', () => {\n\tit('Does not automatically send data synchronously', async () => {\n\t\tconst { tree, testTree, containerRuntimeFactory, events, heartbeat } = await setupHeartbeat();\n\t\ttree.applyEdit(...Change.insertTree([testTree.buildLeaf()], StablePlace.after(testTree.left)));\n\t\tflush(tree, containerRuntimeFactory);\n\t\t// Expect some data to have made it to the heartbeat\n\t\texpect(heartbeat.getStats(tree).editCount).equals(1);\n\t\t// Expect no data was sent to the logger\n\t\texpect(events).deep.equals([]);\n\t});\n\n\tit('Can be flushed synchronously', async () => {\n\t\tconst { tree, testTree, containerRuntimeFactory, events, heartbeat } = await setupHeartbeat();\n\t\ttree.applyEdit(...Change.insertTree([testTree.buildLeaf()], StablePlace.after(testTree.left)));\n\t\tflush(tree, containerRuntimeFactory);\n\t\theartbeat.flushHeartbeat();\n\t\texpect(events.length).equals(1);\n\t\texpect(events[0]).contains({\n\t\t\tcategory: 'Heartbeat',\n\t\t\teventName: 'SharedTree:SequencedEditApplied:EditMergeHealth',\n\t\t});\n\t});\n\n\tit('Does not send data if no local edits have been made', async () => {\n\t\tconst { tree, testTree, concurrentTree, containerRuntimeFactory, events, heartbeat } = await setupHeartbeat();\n\t\tconcurrentTree.applyEdit(\n\t\t\t...Change.insertTree([buildLeaf()], StablePlace.after(testTree.left.translateId(concurrentTree)))\n\t\t);\n\t\tflush(tree, containerRuntimeFactory);\n\t\theartbeat.flushHeartbeat();\n\t\texpect(events.length).equals(0);\n\t});\n\n\tdescribe('Aggregates merge health data', () => {\n\t\titAggregates('edit counts', ({ testTree }) => ({\n\t\t\tedits: [\n\t\t\t\tChange.insertTree([testTree.buildLeaf()], StablePlace.after(testTree.left)),\n\t\t\t\tChange.insertTree(\n\t\t\t\t\t[testTree.buildLeaf()],\n\t\t\t\t\tStablePlace.after(testTree.buildLeaf(testTree.generateNodeId()))\n\t\t\t\t),\n\t\t\t],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.editCount).equals(2);\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates('preventable place failures', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [[Change.delete(StableRange.only(testTree.left.translateId(concurrentTree)))]],\n\t\t\tedits: [Change.insertTree([testTree.buildLeaf()], StablePlace.after(testTree.left))],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.badPlaceCount).equals(1);\n\t\t\t\texpect(event.deletedSiblingBadPlaceCount).equals(1);\n\t\t\t\texpect(event.deletedAncestorBadPlaceCount).equals(0);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates(\n\t\t\t'failures for the parent of a sibling-based place being deleted',\n\t\t\t({ testTree, concurrentTree }) => ({\n\t\t\t\tconcurrentEdits: [[Change.delete(StableRange.only(testTree.translateId(concurrentTree)))]],\n\t\t\t\tedits: [Change.insertTree([testTree.buildLeaf()], StablePlace.after(testTree.left))],\n\t\t\t\taction: (event) => {\n\t\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\t\texpect(event.badPlaceCount).equals(1);\n\t\t\t\t\texpect(event.deletedSiblingBadPlaceCount).equals(1);\n\t\t\t\t\texpect(event.deletedAncestorBadPlaceCount).equals(0);\n\t\t\t\t},\n\t\t\t})\n\t\t);\n\n\t\titAggregates(\n\t\t\t'failures for a range made of valid places in different traits',\n\t\t\t({ testTree, concurrentTree }) => ({\n\t\t\t\t// Move the \"right\" node to another trait to make the range invalid\n\t\t\t\tconcurrentEdits: [\n\t\t\t\t\tChange.move(\n\t\t\t\t\t\tStableRange.only(testTree.left.translateId(concurrentTree)),\n\t\t\t\t\t\tStablePlace.atEndOf(testTree.right.traitLocation.translate(concurrentTree))\n\t\t\t\t\t),\n\t\t\t\t],\n\t\t\t\tedits: [\n\t\t\t\t\t[\n\t\t\t\t\t\tChange.delete(\n\t\t\t\t\t\t\tStableRange.from(StablePlace.before(testTree.left)).to(\n\t\t\t\t\t\t\t\tStablePlace.atEndOf(testTree.left.traitLocation)\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],\n\t\t\t\taction: (event) => {\n\t\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\t\texpect(event.badRangeCount).equals(1);\n\t\t\t\t\texpect(event.deletedSiblingBadRangeCount).equals(0);\n\t\t\t\t\texpect(event.updatedRangeHasPlacesInDifferentTraitsCount).equals(1);\n\t\t\t\t},\n\t\t\t})\n\t\t);\n\n\t\titAggregates('failures for a range made of valid places that are inverted', ({ testTree, concurrentTree }) => ({\n\t\t\t// Move the \"right\" node to the start of the trait to make the range inverted\n\t\t\tconcurrentEdits: [\n\t\t\t\tChange.move(\n\t\t\t\t\tStableRange.only(testTree.right.translateId(concurrentTree)),\n\t\t\t\t\tStablePlace.atStartOf(testTree.left.traitLocation.translate(concurrentTree))\n\t\t\t\t),\n\t\t\t],\n\t\t\tedits: [\n\t\t\t\t[\n\t\t\t\t\tChange.delete(\n\t\t\t\t\t\tStableRange.from(StablePlace.after(testTree.left)).to(StablePlace.before(testTree.right))\n\t\t\t\t\t),\n\t\t\t\t],\n\t\t\t],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.badRangeCount).equals(1);\n\t\t\t\texpect(event.deletedSiblingBadRangeCount).equals(0);\n\t\t\t\texpect(event.updatedRangeInvertedCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates(\n\t\t\t'failures for the parent of a parent-based place being deleted',\n\t\t\t({ testTree, concurrentTree }) => ({\n\t\t\t\tconcurrentEdits: [[Change.delete(StableRange.only(testTree.left.translateId(concurrentTree)))]],\n\t\t\t\tedits: [\n\t\t\t\t\tChange.insertTree(\n\t\t\t\t\t\t[testTree.buildLeaf()],\n\t\t\t\t\t\tStablePlace.atStartOf({ parent: testTree.left.identifier, label: testTree.left.traitLabel })\n\t\t\t\t\t),\n\t\t\t\t],\n\t\t\t\taction: (event) => {\n\t\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\t\texpect(event.badPlaceCount).equals(1);\n\t\t\t\t\texpect(event.deletedSiblingBadPlaceCount).equals(0);\n\t\t\t\t\texpect(event.deletedAncestorBadPlaceCount).equals(1);\n\t\t\t\t},\n\t\t\t})\n\t\t);\n\n\t\titAggregates('preventable range failures', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [[Change.delete(StableRange.only(testTree.left.translateId(concurrentTree)))]],\n\t\t\tedits: [[Change.delete(StableRange.only(testTree.left))]],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.badRangeCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates('range constraint violations', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [[Change.delete(StableRange.only(testTree.left.translateId(concurrentTree)))]],\n\t\t\tedits: [\n\t\t\t\t[\n\t\t\t\t\t{\n\t\t\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t\t\t\ttoConstrain: StableRange.only(testTree.left),\n\t\t\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.constraintViolationCount).equals(1);\n\t\t\t\texpect(event.rangeConstraintViolationCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates('length constraint violations', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [\n\t\t\t\tChange.move(\n\t\t\t\t\tStableRange.only(testTree.right.translateId(concurrentTree)),\n\t\t\t\t\tStablePlace.after(testTree.left.translateId(concurrentTree))\n\t\t\t\t),\n\t\t\t],\n\t\t\tedits: [\n\t\t\t\t[\n\t\t\t\t\t{\n\t\t\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t\t\t\ttoConstrain: StableRange.all(testTree.left.traitLocation),\n\t\t\t\t\t\tlength: 1,\n\t\t\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.constraintViolationCount).equals(1);\n\t\t\t\texpect(event.lengthConstraintViolationCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates('parent constraint violations', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [\n\t\t\t\tChange.move(\n\t\t\t\t\tStableRange.only(testTree.right.translateId(concurrentTree)),\n\t\t\t\t\tStablePlace.atStartOf({\n\t\t\t\t\t\tparent: testTree.left.translateId(concurrentTree),\n\t\t\t\t\t\tlabel: testTree.left.traitLabel,\n\t\t\t\t\t})\n\t\t\t\t),\n\t\t\t],\n\t\t\tedits: [\n\t\t\t\t[\n\t\t\t\t\t{\n\t\t\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t\t\t\ttoConstrain: StableRange.only(testTree.right),\n\t\t\t\t\t\tparentNode: testTree.identifier,\n\t\t\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.constraintViolationCount).equals(1);\n\t\t\t\texpect(event.parentConstraintViolationCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates('label constraint violations', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [\n\t\t\t\tChange.move(\n\t\t\t\t\tStableRange.only(testTree.left.translateId(concurrentTree)),\n\t\t\t\t\tStablePlace.after(testTree.right.translateId(concurrentTree))\n\t\t\t\t),\n\t\t\t],\n\t\t\tedits: [\n\t\t\t\t[\n\t\t\t\t\t{\n\t\t\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t\t\t\ttoConstrain: StableRange.only(testTree.left),\n\t\t\t\t\t\tlabel: testTree.left.traitLabel,\n\t\t\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.constraintViolationCount).equals(1);\n\t\t\t\texpect(event.labelConstraintViolationCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates('failures due to ID collisions', ({ testTree, concurrentTree }) => {\n\t\t\tconst duplicateOverride = 'duplicate ID';\n\t\t\treturn {\n\t\t\t\tconcurrentEdits: [\n\t\t\t\t\tChange.insertTree(\n\t\t\t\t\t\t[buildLeaf(concurrentTree.generateNodeId(duplicateOverride))],\n\t\t\t\t\t\tStablePlace.after(testTree.left.translateId(concurrentTree))\n\t\t\t\t\t),\n\t\t\t\t],\n\t\t\t\tedits: [\n\t\t\t\t\tChange.insertTree(\n\t\t\t\t\t\t[testTree.buildLeaf(testTree.generateNodeId(duplicateOverride))],\n\t\t\t\t\t\tStablePlace.after(testTree.left)\n\t\t\t\t\t),\n\t\t\t\t],\n\t\t\t\taction: (event) => {\n\t\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\t\texpect(event.idAlreadyInUseCount).equals(1);\n\t\t\t\t},\n\t\t\t};\n\t\t});\n\n\t\titAggregates('failures due unknown IDs', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [[Change.delete(StableRange.only(testTree.left.translateId(concurrentTree)))]],\n\t\t\tedits: [[Change.clearPayload(testTree.left.identifier)]],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.unknownIdCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\t// This test uses itAggregatesMocked to streamline the test code\n\t\titAggregatesMocked(\n\t\t\t'path length',\n\t\t\t[\n\t\t\t\t{ reconciliationPath: { length: 0 } },\n\t\t\t\t{ reconciliationPath: { length: 1 } },\n\t\t\t\t{ reconciliationPath: { length: 1 } },\n\t\t\t\t{ reconciliationPath: { length: 2 } },\n\t\t\t\t{ reconciliationPath: { length: 42 } },\n\t\t\t],\n\t\t\t(event) => {\n\t\t\t\texpect(event.pathLengths).equals('0:1,1:2,2:1,42:1');\n\t\t\t}\n\t\t);\n\n\t\t// This test uses itAggregatesMocked because multiple attempts are currently not being made\n\t\titAggregatesMocked(\n\t\t\t'maximum attempt number for an edit',\n\t\t\t[\n\t\t\t\t{\n\t\t\t\t\tedit: { pastAttemptCount: 40 },\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tedit: { pastAttemptCount: 42 },\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tedit: { pastAttemptCount: 41 },\n\t\t\t\t},\n\t\t\t],\n\t\t\t(event) => {\n\t\t\t\texpect(event.maxAttemptCount).equals(42);\n\t\t\t}\n\t\t);\n\n\t\t// This test uses itAggregatesMocked because there should be no way for a sequenced edit to become a malformed edit in\n\t\t// the face of concurrent edits.\n\t\titAggregatesMocked(\n\t\t\t'failures due malformed edits',\n\t\t\t[\n\t\t\t\t{\n\t\t\t\t\toutcome: {\n\t\t\t\t\t\tstatus: EditStatus.Malformed,\n\t\t\t\t\t\tfailure: { kind: TransactionInternal.FailureKind.UnusedDetachedSequence },\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t],\n\t\t\t(event) => {\n\t\t\t\t// This test has to mock a lot of things because there should be no way for a sequenced edit to become a malformed edit in the\n\t\t\t\t// face of concurrent edits.\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.malformedEditCount).equals(1);\n\t\t\t}\n\t\t);\n\t});\n});\n"]}
@@ -3,9 +3,9 @@
3
3
  * Licensed under the MIT License.
4
4
  */
5
5
  import { benchmark, BenchmarkType } from '@fluid-tools/benchmark';
6
- import { defaultClusterCapacity } from '../id-compressor/IdCompressor';
7
- import { getPositiveDelta, incrementUuid, numericUuidFromStableId, stableIdFromNumericUuid, } from '../id-compressor/NumericUuid';
8
- import { assertIsStableId, generateStableId } from '../UuidUtilities';
6
+ import { defaultClusterCapacity } from '../id-compressor/IdCompressor.js';
7
+ import { getPositiveDelta, incrementUuid, numericUuidFromStableId, stableIdFromNumericUuid, } from '../id-compressor/NumericUuid.js';
8
+ import { assertIsStableId, generateStableId } from '../UuidUtilities.js';
9
9
  describe('NumericUuid Perf', () => {
10
10
  const stableId = assertIsStableId('4779fbf2-2012-4510-b4f0-28a99a9f8946');
11
11
  const stableId2 = assertIsStableId('5ccf492c-6a82-438c-9129-d76467525912');