@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
package/lib/test/TransactionInternal.tests.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"TransactionInternal.tests.js","sourceRoot":"","sources":["../../src/test/TransactionInternal.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAEtC,OAAO,EAAE,yBAAyB,EAAE,MAAM,2BAA2B,CAAC;AACtE,OAAO,EAAsB,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AACjF,OAAO,EACN,cAAc,EAEd,kBAAkB,EAClB,gBAAgB,EAChB,UAAU,EAEV,IAAI,EACJ,mBAAmB,EACnB,mBAAmB,GACnB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC1D,OAAO,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,yBAAyB,EAAE,MAAM,kBAAkB,CAAC;AACtG,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,2BAA2B,CAAC;AAEvF,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC5B,IAAI,WAA+B,CAAC;IACpC,MAAM,QAAQ,GAAG,eAAe,CAC/B,SAAS,EACT,CAAC,CAAC,EAAE,EAAE;QACL,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACnD,CAAC,EACD,IAAI,CACJ,CAAC;IACF,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QAC5B,SAAS,YAAY;YACpB,OAAO,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;QACrD,CAAC;QAED,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE;YACrB,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAAU;aACnC,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;YACvB,MAAM,KAAK,GAAG,QAAQ,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;YACrD,MAAM,kBAAkB,GAAwB;gBAC/C,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,KAAK,EAAE;gBACpD,GAAG,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;aAC1B,CAAC;YACF,MAAM,UAAU,GAAG;gBAClB,WAAW,EAAE;oBACZ,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,KAAK,EAAE;oBACpD,GAAG,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;iBAC1B;gBACD,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAA2C;aACpE,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YACpC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,mBAAmB;gBACzD,UAAU;gBACV,SAAS,EAAE;oBACV,IAAI,EAAE,mBAAmB,CAAC,uBAAuB,CAAC,QAAQ;oBAC1D,YAAY,EAAE;wBACb,IAAI,EAAE,yBAAyB,CAAC,QAAQ;wBACxC,KAAK,EAAE,kBAAkB,CAAC,KAAK;wBAC/B,YAAY,EAAE,qBAAqB,CAAC,cAAc;qBAClD;iBACD;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,KAAK,GAAG,QAAQ,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;YACrD,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE;oBACZ,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,KAAK,EAAE;oBACpD,GAAG,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;iBAC1B;gBACD,MAAM,EAAE,gBAAgB,CAAC,UAAU;gBACnC,IAAI,EAAE,kBAAkB,CAAC,UAAU;aACnC,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC5B,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAAU;gBACnC,MAAM,EAAE,CAAC;aACT,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9B,MAAM,UAAU,GAAG;gBAClB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAA2C;gBACpE,MAAM,EAAE,CAAC;aACT,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YACpC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,mBAAmB;gBACzD,UAAU;gBACV,SAAS,EAAE;oBACV,IAAI,EAAE,mBAAmB,CAAC,uBAAuB,CAAC,SAAS;oBAC3D,MAAM,EAAE,CAAC;iBACT;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC5B,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAAU;gBACnC,UAAU,EAAE,QAAQ,CAAC,UAAU;aAC/B,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9B,MAAM,UAAU,GAAG,QAAQ,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;YAC1D,MAAM,UAAU,GAAG;gBAClB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAA2C;gBACpE,UAAU;aACV,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YACpC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,mBAAmB;gBACzD,UAAU;gBACV,SAAS,EAAE;oBACV,IAAI,EAAE,mBAAmB,CAAC,uBAAuB,CAAC,SAAS;oBAC3D,MAAM,EAAE,UAAU;iBAClB;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAAU;gBACnC,KAAK,EAAE,cAAc;aACrB,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7B,MAAM,UAAU,GAAG;gBAClB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAA2C;gBACpE,KAAK,EAAE,sCAAoD;aAC3D,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YACpC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,mBAAmB;gBACzD,UAAU;gBACV,SAAS,EAAE;oBACV,IAAI,EAAE,mBAAmB,CAAC,uBAAuB,CAAC,QAAQ;oBAC1D,MAAM,EAAE,cAAc;iBACtB;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;QACzB,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACpD,MAAM,MAAM,GAAqB;gBAChC,YAAY,EAAE,QAAQ,CAAC,cAAc,EAAE;gBACvC,OAAO,EAAE,EAAE;gBACX,IAAI,EAAE,kBAAkB,CAAC,QAAQ;aACjC,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAEhC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,SAAS;gBAC/C,MAAM;gBACN,EAAE,EAAE,MAAM,CAAC,YAAY;aACvB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7B,MAAM,OAAO,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;YAC5B,WAAW,CAAC,WAAW,CAAC;gBACvB,YAAY,EAAE,QAAQ,CAAC,UAAU;gBACjC,OAAO;gBACP,IAAI,EAAE,kBAAkB,CAAC,QAAQ;aACjC,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACxF,CAAC,CAAC,CAAC;QAEH,4EAA4E;QAC5E,KAAK,MAAM,OAAO,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE;YACtC,EAAE,CAAC,sBAAsB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,EAAE,GAAG,EAAE;gBACxD,WAAW,CAAC,WAAW,CAAC;oBACvB,YAAY,EAAE,QAAQ,CAAC,UAAU;oBACjC,OAAO;oBACP,IAAI,EAAE,kBAAkB,CAAC,QAAQ;iBACjC,CAAC,CAAC;gBACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBACtD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACnF,CAAC,CAAC,CAAC;SACH;QAED,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACrC,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;YAC1E,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;YACzG,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,yBAAyB,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,CAAC;iBACzG,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,WAAW,CAAC,WAAW,CAAC;gBACvB,YAAY,EAAE,QAAQ,CAAC,UAAU;gBACjC,OAAO,EAAE,EAAE;gBACX,IAAI,EAAE,kBAAkB,CAAC,QAAQ;aACjC,CAAC,CAAC;YAEH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC;YAChF,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;YAC1E,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;YACzG,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,yBAAyB,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,CAAC;iBACzG,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACvB,MAAM,OAAO,GAAG,CAAuB,CAAC;QAExC,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;YACjC,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;gBACjD,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;gBACvF,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM;gBACnC,2BAA2B;gBAC3B,CAAuB,EACvB,EAAE,gBAAgB,EAAE,QAAQ,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,CAC3D,CAAC;gBACF,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;gBAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;gBACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;gBACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;gBAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;oBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,wBAAwB;oBAC9D,MAAM;oBACN,UAAU,EAAE,MAAM,CAAC,MAAM;iBACzB,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;YACH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;gBAC7C,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC/D,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;gBAEvF,MAAM,cAAc,GAAG,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC;gBACnD,MAAM,cAAc,GAAG;oBACtB,gFAAgF;oBAChF,cAAc;oBACd,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;oBAC1C,IAAI,EAAE,IAAI,CAAC,MAAM;iBACjB,CAAC;gBACF,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;gBAC9D,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;gBAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;gBACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;gBACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;gBAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;oBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,QAAQ;oBAC9C,MAAM;oBACN,KAAK,EAAE,cAAc;oBACrB,YAAY,EAAE,qBAAqB,CAAC,SAAS;iBAC7C,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;YAC1D,MAAM,KAAK,GAAG,QAAQ,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;YACrD,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/D,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;YACvF,MAAM,KAAK,GAAG;gBACb,gBAAgB,EAAE,KAAK;gBACvB,IAAI,EAAE,IAAI,CAAC,KAAK;aAChB,CAAC;YACF,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YACrD,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,QAAQ;gBAC9C,MAAM;gBACN,KAAK;gBACL,YAAY,EAAE,qBAAqB,CAAC,cAAc;aAClD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;YACzC,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/D,MAAM,OAAO,GAAG,EAAE,CAAC;YACnB,MAAM,UAAU,GAAG,CAAuB,CAAC;YAC3C,WAAW,CAAC,YAAY,CAAC;gBACxB,cAAc,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC;gBAC5D,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC;gBAClE,cAAc,CAAC,MAAM,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;aACrF,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YACvG,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC1F,CAAC,CAAC,CAAC;QACH,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YAC1C,EAAE,CAAC,4BAA4B,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,aAAa,EAAE,GAAG,EAAE;gBAC3F,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC/D,MAAM,SAAS,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;gBAC5C,MAAM,OAAO,GAAG,QAAQ,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;gBACtD,WAAW,CAAC,YAAY,CACvB,cAAc,CAAC,UAAU,CACxB,CAAC,OAAO,CAAC,EACT,IAAI,KAAK,IAAI,CAAC,KAAK;oBAClB,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC;oBACpD,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CACnD,CACD,CAAC;gBACF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CACzE,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,SAAS,CAAC,CACnG,CAAC;YACH,CAAC,CAAC,CAAC;YACH,EAAE,CAAC,qBAAqB,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,eAAe,EAAE,GAAG,EAAE;gBACtF,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC/D,MAAM,OAAO,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;gBAE7C,WAAW,CAAC,YAAY,CACvB,cAAc,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,CAAC,CAC1F,CAAC;gBACF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CACzE,IAAI,KAAK,IAAI,CAAC,MAAM;oBACnB,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC;oBAChD,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,CACjD,CAAC;YACH,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACtB,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACxD,8CAA8C;YAC9C,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAAE,CAAuB,CAAC,CAAC,CAAC;YACvG,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAAE,CAAuB,CAAC,CAAC;YAC7F,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,8BAA8B;gBACpE,MAAM;gBACN,UAAU,EAAE,MAAM,CAAC,WAAW;aAC9B,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;YAC7D,+DAA+D;YAC/D,MAAM,OAAO,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;YAC7C,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAClC;gBACC,OAAO;gBACP;oBACC,GAAG,QAAQ,CAAC,iBAAiB,EAAE;oBAC/B,MAAM,EAAE;wBACP,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE;4BAC3B,EAAE,GAAG,QAAQ,CAAC,iBAAiB,EAAE,EAAE,UAAU,EAAE,OAAO,CAAC,UAAU,EAAE;yBACnE;qBACD;iBACD;aACD,EACD,CAAuB,CACvB,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,kBAAkB;gBACxD,MAAM;gBACN,EAAE,EAAE,OAAO,CAAC,UAAU;aACtB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iEAAiE,EAAE,GAAG,EAAE;YAC1E,2CAA2C;YAC3C,MAAM,UAAU,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YAC7C,MAAM,KAAK,GAAe;gBACzB,UAAU;gBACV,UAAU,EAAE,cAAc,CAAC,UAAU;gBACrC,MAAM,EAAE,EAAE;aACV,CAAC;YACF,MAAM,KAAK,GAAe;gBACzB,UAAU;gBACV,UAAU,EAAE,cAAc,CAAC,UAAU;gBACrC,MAAM,EAAE,EAAE;aACV,CAAC;YAEF,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,EAAE,CAAuB,CAAC,CAAC,CAAC;YAChF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,EAAE,CAAuB,CAAC,CAAC;YACtE,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,cAAc;gBACpD,MAAM;gBACN,EAAE,EAAE,UAAU;aACd,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;YACpE,6DAA6D;YAC7D,MAAM,OAAO,GAAe;gBAC3B,UAAU,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;gBACpC,UAAU,EAAE,cAAc,CAAC,UAAU;gBACrC,MAAM,EAAE,EAAE;aACV,CAAC;YAEF,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAuB,CAAC,CAAC,CAAC;YAClF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC;QACpF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACpC,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/D,MAAM,OAAO,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;YAC7C,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAuB,CAAC,CAAC,CAAC;YAClF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC;YAC7D,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC;YAC/E,MAAM,CAAC,gBAAgB,CAAC,yBAAyB,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;iBACtG,IAAI,CAAC;QACR,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;YACjE,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/D,MAAM,kBAAkB,GAAG,CAAuB,CAAC;YACnD,MAAM,MAAM,GAAG;gBACd,WAAW,EAAE,CAAuB;gBACpC,MAAM,EAAE,CAAC,kBAAkB,CAAC;gBAC5B,IAAI,EAAE,kBAAkB,CAAC,KAAiC;aAC1D,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,wBAAwB;gBAC9D,MAAM;gBACN,UAAU,EAAE,kBAAkB;aAC9B,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACxD,0CAA0C;YAC1C,MAAM,aAAa,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;YACnD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;YAC/C,MAAM,UAAU,GAAa,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAEjD,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/D,MAAM,kBAAkB,GAAG,CAAuB,CAAC;YACnD,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,aAAa,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC;YACnF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,iBAAiB,GAAG,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YACjF,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACvB,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;YAC5D,MAAM,cAAc,GAAG;gBACtB,gFAAgF;gBAChF,cAAc,EAAE,QAAQ,CAAC,IAAI,CAAC,aAAa;gBAC3C,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;gBAC1C,IAAI,EAAE,IAAI,CAAC,MAAM;aACjB,CAAC;YACF,MAAM,KAAK,GAAG,mBAAmB,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,mBAAmB,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;YACrG,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5C,oCAAoC;YACpC,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,QAAQ;gBAC9C,MAAM;gBACN,KAAK;gBACL,YAAY,EAAE;oBACb,IAAI,EAAE,yBAAyB,CAAC,QAAQ;oBACxC,KAAK,EAAE,cAAc;oBACrB,YAAY,EAAE,qBAAqB,CAAC,SAAS;iBAC7C;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,mEAAmE,EAAE,GAAG,EAAE;YAC5E,WAAW,CAAC,WAAW,CACtB,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAuB,CAAC,CACvF,CAAC;YACF,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAuB,CAAC,CAAC;YACxG,oCAAoC;YACpC,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,8BAA8B;gBACpE,MAAM;gBACN,UAAU,EAAE,MAAM,CAAC,WAAW;aAC9B,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACxD,MAAM,KAAK,GAAG,mBAAmB,CAAC,IAAI,CAAC,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAClG,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAC1D,CAAC;YACF,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5C,kCAAkC;YAClC,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,QAAQ;gBAC9C,MAAM;gBACN,KAAK;gBACL,YAAY,EAAE,yBAAyB,CAAC,QAAQ;aAChD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC5B,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC;QACrE,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAClC,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAC/B,MAAM,UAAU,GAAG,CAAuB,CAAC;YAC3C,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;YACpG,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,UAAU,EAAE,mBAAmB,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACtG,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC/E,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAC3E,QAAQ,CAAC,KAAK,CAAC,UAAU;gBACzB,QAAQ,CAAC,IAAI,CAAC,UAAU;aACxB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;YACjC,gGAAgG;YAChG,oFAAoF;YACpF,MAAM,kBAAkB,GAAG,CAAuB,CAAC;YACnD,MAAM,gBAAgB,GAAG,CAAuB,CAAC;YACjD,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC;YAC5G,mCAAmC;YACnC,MAAM,gBAAgB,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YACnD,MAAM,kBAAkB,GAAG,QAAQ,CAAC,iBAAiB,CAAC,gBAAgB,CAAC,CAAC;YACxE,MAAM,kBAAkB,GAAG,WAAyB,CAAC;YACrD,WAAW,CAAC,WAAW,CACtB,cAAc,CAAC,KAAK,CACnB;gBACC;oBACC,GAAG,kBAAkB;oBACrB,MAAM,EAAE,EAAE,CAAC,kBAAkB,CAAC,EAAE,CAAC,kBAAkB,CAAC,EAAE,EAAE,gCAAgC;iBACxF;aACD,EACD,gBAAgB,CAChB,CACD,CAAC;YACF,WAAW,CAAC,WAAW,CACtB,cAAc,CAAC,MAAM,CAAC,gBAAgB,EAAE,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAC3F,CAAC;YACF,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACzE,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC;YAClD,MAAM,aAAa,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC;gBAC/C,MAAM,EAAE,gBAAgB;gBACxB,KAAK,EAAE,kBAAkB;aACzB,CAAC,CAAC;YACH,MAAM,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;YACtE,MAAM,kBAAkB,GAAG,CAAuB,CAAC;YACnD,MAAM,mBAAmB,GAAG,CAAuB,CAAC;YACpD,MAAM,iBAAiB,GAAG,CAAuB,CAAC;YAClD,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC;YAC5G,WAAW,CAAC,WAAW,CACtB,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,mBAAmB,CAAC,CACpF,CAAC;YAEF,MAAM,cAAc,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YACjD,MAAM,eAAe,GAAG;gBACvB,GAAG,QAAQ,CAAC,iBAAiB,CAAC,cAAc,CAAC;gBAC7C,MAAM,EAAE;oBACP,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,kBAAkB,CAAC;oBAChD,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,mBAAmB,CAAC;iBAClD;aACD,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC;YACpF,WAAW,CAAC,WAAW,CACtB,cAAc,CAAC,MAAM,CAAC,iBAAiB,EAAE,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAC5F,CAAC;YACF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAChF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;YAE7F,MAAM,eAAe,GAAG,yBAAyB,CAAC,WAAW,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;YACpF,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC;YAEtC,MAAM,cAAc,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACxD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,gBAAgB,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;YAEtE,MAAM,eAAe,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YAC1D,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,gBAAgB,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QACzE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kFAAkF,EAAE,GAAG,EAAE;YAC3F,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/D,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxF,MAAM,wBAAwB,GAAG,CAAuB,CAAC;YACzD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAE/E,MAAM,OAAO,GAAe;gBAC3B,UAAU,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;gBACpC,UAAU,EAAE,cAAc,CAAC,UAAU;gBACrC,MAAM,EAAE,EAAE;aACV,CAAC;YAEF,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,wBAAwB,CAAC,CAAC,CAAC;YACnF,WAAW,CAAC,WAAW,CACtB,cAAc,CAAC,MAAM,CAAC,wBAAwB,EAAE,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CACnG,CAAC;YACF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QACxG,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 { expect, assert } from 'chai';\nimport { DetachedSequenceId, NodeId, TraitLabel } from '../Identifiers';\nimport { getChangeNodeFromViewNode } from '../SerializationUtilities';\nimport { GenericTransaction, TransactionInternal } from '../TransactionInternal';\nimport {\n\tChangeInternal,\n\tChangeNode,\n\tChangeTypeInternal,\n\tConstraintEffect,\n\tEditStatus,\n\tSetValueInternal,\n\tSide,\n\tStablePlaceInternal,\n\tStableRangeInternal,\n} from '../persisted-types';\nimport { StablePlace, StableRange } from '../ChangeTypes';\nimport { deepCompareNodes, PlaceValidationResult, RangeValidationResultKind } from '../EditUtilities';\nimport { SimpleTestTree } from './utilities/TestNode';\nimport { refreshTestTree, testTrait, testTraitLabel } from './utilities/TestUtilities';\n\ndescribe('Transaction', () => {\n\tlet transaction: GenericTransaction;\n\tconst testTree = refreshTestTree(\n\t\tundefined,\n\t\t(t) => {\n\t\t\ttransaction = TransactionInternal.factory(t.view);\n\t\t},\n\t\ttrue\n\t);\n\tdescribe('Constraints', () => {\n\t\tfunction getTestTrait(): StableRangeInternal {\n\t\t\treturn StableRange.all(testTrait(transaction.view));\n\t\t}\n\n\t\tit('can be met', () => {\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('can be unmet', () => {\n\t\t\tconst badId = testTree.generateNodeId('not in tree');\n\t\t\tconst invalidStableRange: StableRangeInternal = {\n\t\t\t\tstart: { side: Side.After, referenceSibling: badId },\n\t\t\t\tend: { side: Side.Before },\n\t\t\t};\n\t\t\tconst constraint = {\n\t\t\t\ttoConstrain: {\n\t\t\t\t\tstart: { side: Side.After, referenceSibling: badId },\n\t\t\t\t\tend: { side: Side.Before },\n\t\t\t\t},\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint as ChangeTypeInternal.Constraint,\n\t\t\t};\n\t\t\ttransaction.applyChange(constraint);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.ConstraintViolation,\n\t\t\t\tconstraint,\n\t\t\t\tviolation: {\n\t\t\t\t\tkind: TransactionInternal.ConstraintViolationKind.BadRange,\n\t\t\t\t\trangeFailure: {\n\t\t\t\t\t\tkind: RangeValidationResultKind.BadPlace,\n\t\t\t\t\t\tplace: invalidStableRange.start,\n\t\t\t\t\t\tplaceFailure: PlaceValidationResult.MissingSibling,\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\t\tit('effect can apply anyway', () => {\n\t\t\tconst badId = testTree.generateNodeId('not in tree');\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: {\n\t\t\t\t\tstart: { side: Side.After, referenceSibling: badId },\n\t\t\t\t\tend: { side: Side.Before },\n\t\t\t\t},\n\t\t\t\teffect: ConstraintEffect.ValidRetry,\n\t\t\t\ttype: ChangeTypeInternal.Constraint,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('length can be met', () => {\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint,\n\t\t\t\tlength: 0,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('length can be unmet', () => {\n\t\t\tconst constraint = {\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint as ChangeTypeInternal.Constraint,\n\t\t\t\tlength: 1,\n\t\t\t};\n\t\t\ttransaction.applyChange(constraint);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.ConstraintViolation,\n\t\t\t\tconstraint,\n\t\t\t\tviolation: {\n\t\t\t\t\tkind: TransactionInternal.ConstraintViolationKind.BadLength,\n\t\t\t\t\tactual: 0,\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\t\tit('parent can be met', () => {\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint,\n\t\t\t\tparentNode: testTree.identifier,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('parent can be unmet', () => {\n\t\t\tconst parentNode = testTree.generateNodeId('not in tree');\n\t\t\tconst constraint = {\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint as ChangeTypeInternal.Constraint,\n\t\t\t\tparentNode,\n\t\t\t};\n\t\t\ttransaction.applyChange(constraint);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.ConstraintViolation,\n\t\t\t\tconstraint,\n\t\t\t\tviolation: {\n\t\t\t\t\tkind: TransactionInternal.ConstraintViolationKind.BadParent,\n\t\t\t\t\tactual: parentNode,\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\t\tit('label can be met', () => {\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint,\n\t\t\t\tlabel: testTraitLabel,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('label can be unmet', () => {\n\t\t\tconst constraint = {\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint as ChangeTypeInternal.Constraint,\n\t\t\t\tlabel: '7969ee2e-5418-43db-929a-4e9a23c5499d' as TraitLabel,\n\t\t\t};\n\t\t\ttransaction.applyChange(constraint);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.ConstraintViolation,\n\t\t\t\tconstraint,\n\t\t\t\tviolation: {\n\t\t\t\t\tkind: TransactionInternal.ConstraintViolationKind.BadLabel,\n\t\t\t\t\tactual: testTraitLabel,\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\t});\n\n\tdescribe('SetValue', () => {\n\t\tit('can be invalid if the node does not exist', () => {\n\t\t\tconst change: SetValueInternal = {\n\t\t\t\tnodeToModify: testTree.generateNodeId(),\n\t\t\t\tpayload: {},\n\t\t\t\ttype: ChangeTypeInternal.SetValue,\n\t\t\t};\n\t\t\ttransaction.applyChange(change);\n\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.UnknownId,\n\t\t\t\tchange,\n\t\t\t\tid: change.nodeToModify,\n\t\t\t});\n\t\t});\n\n\t\tit('can change payload', () => {\n\t\t\tconst payload = { foo: {} };\n\t\t\ttransaction.applyChange({\n\t\t\t\tnodeToModify: testTree.identifier,\n\t\t\t\tpayload, // Arbitrary payload.\n\t\t\t\ttype: ChangeTypeInternal.SetValue,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect(transaction.view.getViewNode(testTree.identifier).payload).deep.equals(payload);\n\t\t});\n\n\t\t// 'null' is not included here since it means clear the payload in setValue.\n\t\tfor (const payload of [0, '', [], {}]) {\n\t\t\tit(`can set payload to ${JSON.stringify(payload)}`, () => {\n\t\t\t\ttransaction.applyChange({\n\t\t\t\t\tnodeToModify: testTree.identifier,\n\t\t\t\t\tpayload,\n\t\t\t\t\ttype: ChangeTypeInternal.SetValue,\n\t\t\t\t});\n\t\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\t\texpect(transaction.view.getViewNode(testTree.identifier).payload).equals(payload);\n\t\t\t});\n\t\t}\n\n\t\tit('can clear an unset payload', () => {\n\t\t\ttransaction.applyChange(ChangeInternal.clearPayload(testTree.identifier));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect({}.hasOwnProperty.call(transaction.view.getViewNode(testTree.identifier), 'payload')).to.be.false;\n\t\t\texpect({}.hasOwnProperty.call(getChangeNodeFromViewNode(transaction.view, testTree.identifier), 'payload'))\n\t\t\t\t.to.be.false;\n\t\t});\n\n\t\tit('can clear a set payload', () => {\n\t\t\ttransaction.applyChange({\n\t\t\t\tnodeToModify: testTree.identifier,\n\t\t\t\tpayload: {},\n\t\t\t\ttype: ChangeTypeInternal.SetValue,\n\t\t\t});\n\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect(transaction.view.getViewNode(testTree.identifier).payload).not.undefined;\n\t\t\ttransaction.applyChange(ChangeInternal.clearPayload(testTree.identifier));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect({}.hasOwnProperty.call(transaction.view.getViewNode(testTree.identifier), 'payload')).to.be.false;\n\t\t\texpect({}.hasOwnProperty.call(getChangeNodeFromViewNode(transaction.view, testTree.identifier), 'payload'))\n\t\t\t\t.to.be.false;\n\t\t});\n\t});\n\n\tdescribe('Insert', () => {\n\t\tconst buildId = 0 as DetachedSequenceId;\n\n\t\tdescribe('can be malformed', () => {\n\t\t\tit('when the detached sequence ID is bogus', () => {\n\t\t\t\ttransaction.applyChange(ChangeInternal.build([testTree.buildLeafInternal()], buildId));\n\t\t\t\tconst change = ChangeInternal.insert(\n\t\t\t\t\t// Non-existent detached id\n\t\t\t\t\t1 as DetachedSequenceId,\n\t\t\t\t\t{ referenceSibling: testTree.identifier, side: Side.After }\n\t\t\t\t);\n\t\t\t\ttransaction.applyChange(change);\n\t\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\t\tconst result = transaction.close();\n\t\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\t\texpect(result.failure).deep.equals({\n\t\t\t\t\tkind: TransactionInternal.FailureKind.DetachedSequenceNotFound,\n\t\t\t\t\tchange,\n\t\t\t\t\tsequenceId: change.source,\n\t\t\t\t});\n\t\t\t});\n\t\t\tit('when the target place is malformed', () => {\n\t\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\t\ttransaction.applyChange(ChangeInternal.build([testTree.buildLeafInternal()], buildId));\n\n\t\t\t\tconst referenceTrait = testTree.left.traitLocation;\n\t\t\t\tconst malformedPlace = {\n\t\t\t\t\t// A place is malformed if it has both a reference trait and a reference sibling\n\t\t\t\t\treferenceTrait,\n\t\t\t\t\treferenceSibling: testTree.left.identifier,\n\t\t\t\t\tside: Side.Before,\n\t\t\t\t};\n\t\t\t\tconst change = ChangeInternal.insert(buildId, malformedPlace);\n\t\t\t\ttransaction.applyChange(change);\n\t\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\t\tconst result = transaction.close();\n\t\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\t\texpect(result.failure).deep.equals({\n\t\t\t\t\tkind: TransactionInternal.FailureKind.BadPlace,\n\t\t\t\t\tchange,\n\t\t\t\t\tplace: malformedPlace,\n\t\t\t\t\tplaceFailure: PlaceValidationResult.Malformed,\n\t\t\t\t});\n\t\t\t});\n\t\t});\n\t\tit('can be invalid when the target place is invalid', () => {\n\t\t\tconst badId = testTree.generateNodeId('not in tree');\n\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\ttransaction.applyChange(ChangeInternal.build([testTree.buildLeafInternal()], buildId));\n\t\t\tconst place = {\n\t\t\t\treferenceSibling: badId,\n\t\t\t\tside: Side.After,\n\t\t\t};\n\t\t\tconst change = ChangeInternal.insert(buildId, place);\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.BadPlace,\n\t\t\t\tchange,\n\t\t\t\tplace,\n\t\t\t\tplaceFailure: PlaceValidationResult.MissingSibling,\n\t\t\t});\n\t\t});\n\t\tit('a detached node with a payload', () => {\n\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\tconst payload = 42;\n\t\t\tconst detachedId = 0 as DetachedSequenceId;\n\t\t\ttransaction.applyChanges([\n\t\t\t\tChangeInternal.setPayload(testTree.left.identifier, payload),\n\t\t\t\tChangeInternal.detach(StableRange.only(testTree.left), detachedId),\n\t\t\t\tChangeInternal.insert(detachedId, StablePlace.atStartOf(testTree.left.traitLocation)),\n\t\t\t]);\n\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals([testTree.left.identifier]);\n\t\t\texpect(transaction.view.getViewNode(testTree.left.identifier).payload).to.equal(payload);\n\t\t});\n\t\t[Side.Before, Side.After].forEach((side) => {\n\t\t\tit(`can insert a node at the ${side === Side.After ? 'beginning' : 'end'} of a trait`, () => {\n\t\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\t\tconst newNodeId = testTree.generateNodeId();\n\t\t\t\tconst newNode = testTree.buildLeafInternal(newNodeId);\n\t\t\t\ttransaction.applyChanges(\n\t\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t\t[newNode],\n\t\t\t\t\t\tside === Side.After\n\t\t\t\t\t\t\t? StablePlace.atStartOf(testTree.left.traitLocation)\n\t\t\t\t\t\t\t: StablePlace.atEndOf(testTree.left.traitLocation)\n\t\t\t\t\t)\n\t\t\t\t);\n\t\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals(\n\t\t\t\t\tside === Side.After ? [newNodeId, testTree.left.identifier] : [testTree.left.identifier, newNodeId]\n\t\t\t\t);\n\t\t\t});\n\t\t\tit(`can insert a node ${side === Side.Before ? 'before' : 'after'} another node`, () => {\n\t\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\t\tconst newNode = testTree.buildLeafInternal();\n\n\t\t\t\ttransaction.applyChanges(\n\t\t\t\t\tChangeInternal.insertTree([newNode], { referenceSibling: testTree.left.identifier, side })\n\t\t\t\t);\n\t\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals(\n\t\t\t\t\tside === Side.Before\n\t\t\t\t\t\t? [newNode.identifier, testTree.left.identifier]\n\t\t\t\t\t\t: [testTree.left.identifier, newNode.identifier]\n\t\t\t\t);\n\t\t\t});\n\t\t});\n\t});\n\n\tdescribe('Build', () => {\n\t\tit('can be malformed due to detached ID collision', () => {\n\t\t\t// Apply two Build_s with the same detached id\n\t\t\ttransaction.applyChange(ChangeInternal.build([testTree.buildLeafInternal()], 0 as DetachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\tconst change = ChangeInternal.build([testTree.buildLeafInternal()], 0 as DetachedSequenceId);\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.DetachedSequenceIdAlreadyInUse,\n\t\t\t\tchange,\n\t\t\t\tsequenceId: change.destination,\n\t\t\t});\n\t\t});\n\n\t\tit('can be malformed due to duplicate node identifiers', () => {\n\t\t\t// Build two nodes with the same identifier, one of them nested\n\t\t\tconst newNode = testTree.buildLeafInternal();\n\t\t\tconst change = ChangeInternal.build(\n\t\t\t\t[\n\t\t\t\t\tnewNode,\n\t\t\t\t\t{\n\t\t\t\t\t\t...testTree.buildLeafInternal(),\n\t\t\t\t\t\ttraits: {\n\t\t\t\t\t\t\t[testTree.left.traitLabel]: [\n\t\t\t\t\t\t\t\t{ ...testTree.buildLeafInternal(), identifier: newNode.identifier },\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\t0 as DetachedSequenceId\n\t\t\t);\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.DuplicateIdInBuild,\n\t\t\t\tchange,\n\t\t\t\tid: newNode.identifier,\n\t\t\t});\n\t\t});\n\n\t\tit('is invalid when a node already exists with the given identifier', () => {\n\t\t\t// Build two nodes with the same identifier\n\t\t\tconst identifier = testTree.generateNodeId();\n\t\t\tconst node1: ChangeNode = {\n\t\t\t\tidentifier,\n\t\t\t\tdefinition: SimpleTestTree.definition,\n\t\t\t\ttraits: {},\n\t\t\t};\n\t\t\tconst node2: ChangeNode = {\n\t\t\t\tidentifier,\n\t\t\t\tdefinition: SimpleTestTree.definition,\n\t\t\t\ttraits: {},\n\t\t\t};\n\n\t\t\ttransaction.applyChange(ChangeInternal.build([node1], 0 as DetachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\tconst change = ChangeInternal.build([node2], 1 as DetachedSequenceId);\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.IdAlreadyInUse,\n\t\t\t\tchange,\n\t\t\t\tid: identifier,\n\t\t\t});\n\t\t});\n\n\t\tit('is invalid to build a node that has already been inserted', () => {\n\t\t\t// Build new node using identifier already in use in the tree\n\t\t\tconst newNode: ChangeNode = {\n\t\t\t\tidentifier: testTree.left.identifier,\n\t\t\t\tdefinition: SimpleTestTree.definition,\n\t\t\t\ttraits: {},\n\t\t\t};\n\n\t\t\ttransaction.applyChange(ChangeInternal.build([newNode], 0 as DetachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure.kind).equals(TransactionInternal.FailureKind.IdAlreadyInUse);\n\t\t});\n\n\t\tit('can build a detached node', () => {\n\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\tconst newNode = testTree.buildLeafInternal();\n\t\t\ttransaction.applyChange(ChangeInternal.build([newNode], 0 as DetachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect(transaction.view.hasNode(newNode.identifier)).is.true;\n\t\t\texpect(transaction.view.tryGetParentViewNode(newNode.identifier)).is.undefined;\n\t\t\texpect(deepCompareNodes(getChangeNodeFromViewNode(transaction.view, newNode.identifier), newNode)).to.be\n\t\t\t\t.true;\n\t\t});\n\n\t\tit(\"can be malformed if detached sequence id doesn't exist\", () => {\n\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\tconst detachedSequenceId = 0 as DetachedSequenceId;\n\t\t\tconst change = {\n\t\t\t\tdestination: 1 as DetachedSequenceId,\n\t\t\t\tsource: [detachedSequenceId],\n\t\t\t\ttype: ChangeTypeInternal.Build as ChangeTypeInternal.Build,\n\t\t\t};\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.DetachedSequenceNotFound,\n\t\t\t\tchange,\n\t\t\t\tsequenceId: detachedSequenceId,\n\t\t\t});\n\t\t});\n\n\t\tit('can build a node with an explicit empty trait', () => {\n\t\t\t// Forest should strip off the empty trait\n\t\t\tconst nodeWithEmpty = testTree.buildLeafInternal();\n\t\t\tconst traits = new Map<TraitLabel, NodeId[]>();\n\t\t\tconst emptyTrait: NodeId[] = [];\n\t\t\ttraits.set(testTree.left.traitLabel, emptyTrait);\n\n\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\tconst detachedSequenceId = 0 as DetachedSequenceId;\n\t\t\ttransaction.applyChange(ChangeInternal.build([nodeWithEmpty], detachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\tconst viewNodeWithEmpty = transaction.view.getViewNode(nodeWithEmpty.identifier);\n\t\t\texpect(viewNodeWithEmpty.traits.size).to.equal(0);\n\t\t});\n\t});\n\n\tdescribe('Detach', () => {\n\t\tit('can be malformed if the target range is malformed', () => {\n\t\t\tconst malformedPlace = {\n\t\t\t\t// A place is malformed if it has both a reference trait and a reference sibling\n\t\t\t\treferenceTrait: testTree.left.traitLocation,\n\t\t\t\treferenceSibling: testTree.left.identifier,\n\t\t\t\tside: Side.Before,\n\t\t\t};\n\t\t\tconst range = StableRangeInternal.from(malformedPlace).to(StablePlaceInternal.after(testTree.right));\n\t\t\tconst change = ChangeInternal.detach(range);\n\t\t\t// Supplied StableRange is malformed\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.BadRange,\n\t\t\t\tchange,\n\t\t\t\trange,\n\t\t\t\trangeFailure: {\n\t\t\t\t\tkind: RangeValidationResultKind.BadPlace,\n\t\t\t\t\tplace: malformedPlace,\n\t\t\t\t\tplaceFailure: PlaceValidationResult.Malformed,\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\t\tit('can be malformed if the destination sequence id is already in use', () => {\n\t\t\ttransaction.applyChange(\n\t\t\t\tChangeInternal.detach(StableRangeInternal.only(testTree.left), 0 as DetachedSequenceId)\n\t\t\t);\n\t\t\tconst change = ChangeInternal.detach(StableRangeInternal.only(testTree.right), 0 as DetachedSequenceId);\n\t\t\t// Supplied StableRange is malformed\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.DetachedSequenceIdAlreadyInUse,\n\t\t\t\tchange,\n\t\t\t\tsequenceId: change.destination,\n\t\t\t});\n\t\t});\n\t\tit('can be invalid if the target range is invalid', () => {\n\t\t\tconst range = StableRangeInternal.from(StablePlaceInternal.atEndOf(testTree.left.traitLocation)).to(\n\t\t\t\tStablePlaceInternal.atStartOf(testTree.left.traitLocation)\n\t\t\t);\n\t\t\tconst change = ChangeInternal.detach(range);\n\t\t\t// Start place is before end place\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.BadRange,\n\t\t\t\tchange,\n\t\t\t\trange,\n\t\t\t\trangeFailure: RangeValidationResultKind.Inverted,\n\t\t\t});\n\t\t});\n\t\tit('can delete a node', () => {\n\t\t\ttransaction.applyChange(ChangeInternal.detach(StableRangeInternal.only(testTree.left)));\n\t\t\texpect(transaction.view.hasNode(testTree.left.identifier)).is.false;\n\t\t});\n\t});\n\n\tdescribe('Composite changes', () => {\n\t\tit('can form a node move', () => {\n\t\t\tconst detachedId = 0 as DetachedSequenceId;\n\t\t\ttransaction.applyChange(ChangeInternal.detach(StableRangeInternal.only(testTree.left), detachedId));\n\t\t\ttransaction.applyChange(ChangeInternal.insert(detachedId, StablePlaceInternal.after(testTree.right)));\n\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals([]);\n\t\t\texpect(transaction.view.getTrait(testTree.right.traitLocation)).deep.equals([\n\t\t\t\ttestTree.right.identifier,\n\t\t\t\ttestTree.left.identifier,\n\t\t\t]);\n\t\t});\n\t\tit('can form a wrap insert', () => {\n\t\t\t// A wrap insert is an edit that inserts a new node between a subtree and its parent atomically.\n\t\t\t// Ex: given A -> B -> C, a wrap insert of D around B would produce A -> D -> B -> C\n\t\t\tconst leftNodeDetachedId = 0 as DetachedSequenceId;\n\t\t\tconst parentDetachedId = 1 as DetachedSequenceId;\n\t\t\ttransaction.applyChange(ChangeInternal.detach(StableRangeInternal.only(testTree.left), leftNodeDetachedId));\n\t\t\t// This is node D, from the example\n\t\t\tconst wrappingParentId = testTree.generateNodeId();\n\t\t\tconst wrappingParentNode = testTree.buildLeafInternal(wrappingParentId);\n\t\t\tconst wrappingTraitLabel = 'wrapTrait' as TraitLabel;\n\t\t\ttransaction.applyChange(\n\t\t\t\tChangeInternal.build(\n\t\t\t\t\t[\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t...wrappingParentNode,\n\t\t\t\t\t\t\ttraits: { [wrappingTraitLabel]: [leftNodeDetachedId] }, // Re-parent left under new node\n\t\t\t\t\t\t},\n\t\t\t\t\t],\n\t\t\t\t\tparentDetachedId\n\t\t\t\t)\n\t\t\t);\n\t\t\ttransaction.applyChange(\n\t\t\t\tChangeInternal.insert(parentDetachedId, StablePlace.atStartOf(testTree.left.traitLocation))\n\t\t\t);\n\t\t\tconst leftTrait = transaction.view.getTrait(testTree.left.traitLocation);\n\t\t\texpect(leftTrait).deep.equals([wrappingParentId]);\n\t\t\tconst wrappingTrait = transaction.view.getTrait({\n\t\t\t\tparent: wrappingParentId,\n\t\t\t\tlabel: wrappingTraitLabel,\n\t\t\t});\n\t\t\texpect(wrappingTrait).deep.equals([testTree.left.identifier]);\n\t\t});\n\n\t\tit('can build and insert a tree that contains detached subtrees', () => {\n\t\t\tconst leftNodeDetachedId = 0 as DetachedSequenceId;\n\t\t\tconst rightNodeDetachedId = 1 as DetachedSequenceId;\n\t\t\tconst detachedIdSubtree = 2 as DetachedSequenceId;\n\t\t\ttransaction.applyChange(ChangeInternal.detach(StableRangeInternal.only(testTree.left), leftNodeDetachedId));\n\t\t\ttransaction.applyChange(\n\t\t\t\tChangeInternal.detach(StableRangeInternal.only(testTree.right), rightNodeDetachedId)\n\t\t\t);\n\n\t\t\tconst detachedNodeId = testTree.generateNodeId();\n\t\t\tconst detachedSubtree = {\n\t\t\t\t...testTree.buildLeafInternal(detachedNodeId),\n\t\t\t\ttraits: {\n\t\t\t\t\t[testTree.left.traitLabel]: [leftNodeDetachedId],\n\t\t\t\t\t[testTree.right.traitLabel]: [rightNodeDetachedId],\n\t\t\t\t},\n\t\t\t};\n\t\t\ttransaction.applyChange(ChangeInternal.build([detachedSubtree], detachedIdSubtree));\n\t\t\ttransaction.applyChange(\n\t\t\t\tChangeInternal.insert(detachedIdSubtree, StablePlace.atStartOf(testTree.left.traitLocation))\n\t\t\t);\n\t\t\texpect(transaction.view.getTrait(testTree.right.traitLocation)).deep.equals([]);\n\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals([detachedNodeId]);\n\n\t\t\tconst insertedSubtree = getChangeNodeFromViewNode(transaction.view, detachedNodeId);\n\t\t\tconst traits = insertedSubtree.traits;\n\n\t\t\tconst leftTreeTraits = traits[testTree.left.traitLabel];\n\t\t\texpect(leftTreeTraits).to.have.lengthOf(1);\n\t\t\texpect(deepCompareNodes(leftTreeTraits[0], testTree.left)).to.be.true;\n\n\t\t\tconst rightTreeTraits = traits[testTree.right.traitLabel];\n\t\t\texpect(rightTreeTraits).to.have.lengthOf(1);\n\t\t\texpect(deepCompareNodes(rightTreeTraits[0], testTree.right)).to.be.true;\n\t\t});\n\n\t\tit('can build and insert a tree with the same identity as that of a detached subtree', () => {\n\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\ttransaction.applyChange(ChangeInternal.detach(StableRangeInternal.only(testTree.left)));\n\t\t\tconst idOfDetachedNodeToInsert = 1 as DetachedSequenceId;\n\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals([]);\n\n\t\t\tconst newNode: ChangeNode = {\n\t\t\t\tidentifier: testTree.left.identifier,\n\t\t\t\tdefinition: SimpleTestTree.definition,\n\t\t\t\ttraits: {},\n\t\t\t};\n\n\t\t\ttransaction.applyChange(ChangeInternal.build([newNode], idOfDetachedNodeToInsert));\n\t\t\ttransaction.applyChange(\n\t\t\t\tChangeInternal.insert(idOfDetachedNodeToInsert, StablePlace.atStartOf(testTree.left.traitLocation))\n\t\t\t);\n\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals([testTree.left.identifier]);\n\t\t});\n\t});\n});\n"]}
1
+ {"version":3,"file":"TransactionInternal.tests.js","sourceRoot":"","sources":["../../src/test/TransactionInternal.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAEtC,OAAO,EAAE,yBAAyB,EAAE,MAAM,8BAA8B,CAAC;AACzE,OAAO,EAAsB,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AACpF,OAAO,EACN,cAAc,EAEd,kBAAkB,EAClB,gBAAgB,EAChB,UAAU,EAEV,IAAI,EACJ,mBAAmB,EACnB,mBAAmB,GACnB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAC7D,OAAO,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,yBAAyB,EAAE,MAAM,qBAAqB,CAAC;AACzG,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,eAAe,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,8BAA8B,CAAC;AAE1F,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC5B,IAAI,WAA+B,CAAC;IACpC,MAAM,QAAQ,GAAG,eAAe,CAC/B,SAAS,EACT,CAAC,CAAC,EAAE,EAAE;QACL,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACnD,CAAC,EACD,IAAI,CACJ,CAAC;IACF,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QAC5B,SAAS,YAAY;YACpB,OAAO,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;QACrD,CAAC;QAED,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE;YACrB,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAAU;aACnC,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;YACvB,MAAM,KAAK,GAAG,QAAQ,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;YACrD,MAAM,kBAAkB,GAAwB;gBAC/C,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,KAAK,EAAE;gBACpD,GAAG,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;aAC1B,CAAC;YACF,MAAM,UAAU,GAAG;gBAClB,WAAW,EAAE;oBACZ,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,KAAK,EAAE;oBACpD,GAAG,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;iBAC1B;gBACD,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAA2C;aACpE,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YACpC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,mBAAmB;gBACzD,UAAU;gBACV,SAAS,EAAE;oBACV,IAAI,EAAE,mBAAmB,CAAC,uBAAuB,CAAC,QAAQ;oBAC1D,YAAY,EAAE;wBACb,IAAI,EAAE,yBAAyB,CAAC,QAAQ;wBACxC,KAAK,EAAE,kBAAkB,CAAC,KAAK;wBAC/B,YAAY,EAAE,qBAAqB,CAAC,cAAc;qBAClD;iBACD;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,KAAK,GAAG,QAAQ,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;YACrD,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE;oBACZ,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,KAAK,EAAE;oBACpD,GAAG,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;iBAC1B;gBACD,MAAM,EAAE,gBAAgB,CAAC,UAAU;gBACnC,IAAI,EAAE,kBAAkB,CAAC,UAAU;aACnC,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC5B,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAAU;gBACnC,MAAM,EAAE,CAAC;aACT,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9B,MAAM,UAAU,GAAG;gBAClB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAA2C;gBACpE,MAAM,EAAE,CAAC;aACT,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YACpC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,mBAAmB;gBACzD,UAAU;gBACV,SAAS,EAAE;oBACV,IAAI,EAAE,mBAAmB,CAAC,uBAAuB,CAAC,SAAS;oBAC3D,MAAM,EAAE,CAAC;iBACT;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC5B,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAAU;gBACnC,UAAU,EAAE,QAAQ,CAAC,UAAU;aAC/B,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9B,MAAM,UAAU,GAAG,QAAQ,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;YAC1D,MAAM,UAAU,GAAG;gBAClB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAA2C;gBACpE,UAAU;aACV,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YACpC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,mBAAmB;gBACzD,UAAU;gBACV,SAAS,EAAE;oBACV,IAAI,EAAE,mBAAmB,CAAC,uBAAuB,CAAC,SAAS;oBAC3D,MAAM,EAAE,UAAU;iBAClB;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAAU;gBACnC,KAAK,EAAE,cAAc;aACrB,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7B,MAAM,UAAU,GAAG;gBAClB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAA2C;gBACpE,KAAK,EAAE,sCAAoD;aAC3D,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YACpC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,mBAAmB;gBACzD,UAAU;gBACV,SAAS,EAAE;oBACV,IAAI,EAAE,mBAAmB,CAAC,uBAAuB,CAAC,QAAQ;oBAC1D,MAAM,EAAE,cAAc;iBACtB;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;QACzB,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACpD,MAAM,MAAM,GAAqB;gBAChC,YAAY,EAAE,QAAQ,CAAC,cAAc,EAAE;gBACvC,OAAO,EAAE,EAAE;gBACX,IAAI,EAAE,kBAAkB,CAAC,QAAQ;aACjC,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAEhC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,SAAS;gBAC/C,MAAM;gBACN,EAAE,EAAE,MAAM,CAAC,YAAY;aACvB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7B,MAAM,OAAO,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;YAC5B,WAAW,CAAC,WAAW,CAAC;gBACvB,YAAY,EAAE,QAAQ,CAAC,UAAU;gBACjC,OAAO;gBACP,IAAI,EAAE,kBAAkB,CAAC,QAAQ;aACjC,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACxF,CAAC,CAAC,CAAC;QAEH,4EAA4E;QAC5E,KAAK,MAAM,OAAO,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE;YACtC,EAAE,CAAC,sBAAsB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,EAAE,GAAG,EAAE;gBACxD,WAAW,CAAC,WAAW,CAAC;oBACvB,YAAY,EAAE,QAAQ,CAAC,UAAU;oBACjC,OAAO;oBACP,IAAI,EAAE,kBAAkB,CAAC,QAAQ;iBACjC,CAAC,CAAC;gBACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBACtD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACnF,CAAC,CAAC,CAAC;SACH;QAED,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACrC,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;YAC1E,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;YACzG,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,yBAAyB,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,CAAC;iBACzG,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,WAAW,CAAC,WAAW,CAAC;gBACvB,YAAY,EAAE,QAAQ,CAAC,UAAU;gBACjC,OAAO,EAAE,EAAE;gBACX,IAAI,EAAE,kBAAkB,CAAC,QAAQ;aACjC,CAAC,CAAC;YAEH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC;YAChF,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;YAC1E,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;YACzG,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,yBAAyB,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,CAAC;iBACzG,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACvB,MAAM,OAAO,GAAG,CAAuB,CAAC;QAExC,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;YACjC,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;gBACjD,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;gBACvF,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM;gBACnC,2BAA2B;gBAC3B,CAAuB,EACvB,EAAE,gBAAgB,EAAE,QAAQ,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,CAC3D,CAAC;gBACF,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;gBAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;gBACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;gBACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;gBAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;oBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,wBAAwB;oBAC9D,MAAM;oBACN,UAAU,EAAE,MAAM,CAAC,MAAM;iBACzB,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;YACH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;gBAC7C,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC/D,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;gBAEvF,MAAM,cAAc,GAAG,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC;gBACnD,MAAM,cAAc,GAAG;oBACtB,gFAAgF;oBAChF,cAAc;oBACd,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;oBAC1C,IAAI,EAAE,IAAI,CAAC,MAAM;iBACjB,CAAC;gBACF,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;gBAC9D,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;gBAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;gBACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;gBACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;gBAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;oBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,QAAQ;oBAC9C,MAAM;oBACN,KAAK,EAAE,cAAc;oBACrB,YAAY,EAAE,qBAAqB,CAAC,SAAS;iBAC7C,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;YAC1D,MAAM,KAAK,GAAG,QAAQ,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;YACrD,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/D,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;YACvF,MAAM,KAAK,GAAG;gBACb,gBAAgB,EAAE,KAAK;gBACvB,IAAI,EAAE,IAAI,CAAC,KAAK;aAChB,CAAC;YACF,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YACrD,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,QAAQ;gBAC9C,MAAM;gBACN,KAAK;gBACL,YAAY,EAAE,qBAAqB,CAAC,cAAc;aAClD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;YACzC,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/D,MAAM,OAAO,GAAG,EAAE,CAAC;YACnB,MAAM,UAAU,GAAG,CAAuB,CAAC;YAC3C,WAAW,CAAC,YAAY,CAAC;gBACxB,cAAc,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC;gBAC5D,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC;gBAClE,cAAc,CAAC,MAAM,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;aACrF,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YACvG,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC1F,CAAC,CAAC,CAAC;QACH,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YAC1C,EAAE,CAAC,4BAA4B,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,aAAa,EAAE,GAAG,EAAE;gBAC3F,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC/D,MAAM,SAAS,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;gBAC5C,MAAM,OAAO,GAAG,QAAQ,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;gBACtD,WAAW,CAAC,YAAY,CACvB,cAAc,CAAC,UAAU,CACxB,CAAC,OAAO,CAAC,EACT,IAAI,KAAK,IAAI,CAAC,KAAK;oBAClB,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC;oBACpD,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CACnD,CACD,CAAC;gBACF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CACzE,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,SAAS,CAAC,CACnG,CAAC;YACH,CAAC,CAAC,CAAC;YACH,EAAE,CAAC,qBAAqB,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,eAAe,EAAE,GAAG,EAAE;gBACtF,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC/D,MAAM,OAAO,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;gBAE7C,WAAW,CAAC,YAAY,CACvB,cAAc,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,CAAC,CAC1F,CAAC;gBACF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CACzE,IAAI,KAAK,IAAI,CAAC,MAAM;oBACnB,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC;oBAChD,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,CACjD,CAAC;YACH,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACtB,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACxD,8CAA8C;YAC9C,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAAE,CAAuB,CAAC,CAAC,CAAC;YACvG,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAAE,CAAuB,CAAC,CAAC;YAC7F,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,8BAA8B;gBACpE,MAAM;gBACN,UAAU,EAAE,MAAM,CAAC,WAAW;aAC9B,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;YAC7D,+DAA+D;YAC/D,MAAM,OAAO,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;YAC7C,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAClC;gBACC,OAAO;gBACP;oBACC,GAAG,QAAQ,CAAC,iBAAiB,EAAE;oBAC/B,MAAM,EAAE;wBACP,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE;4BAC3B,EAAE,GAAG,QAAQ,CAAC,iBAAiB,EAAE,EAAE,UAAU,EAAE,OAAO,CAAC,UAAU,EAAE;yBACnE;qBACD;iBACD;aACD,EACD,CAAuB,CACvB,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,kBAAkB;gBACxD,MAAM;gBACN,EAAE,EAAE,OAAO,CAAC,UAAU;aACtB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iEAAiE,EAAE,GAAG,EAAE;YAC1E,2CAA2C;YAC3C,MAAM,UAAU,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YAC7C,MAAM,KAAK,GAAe;gBACzB,UAAU;gBACV,UAAU,EAAE,cAAc,CAAC,UAAU;gBACrC,MAAM,EAAE,EAAE;aACV,CAAC;YACF,MAAM,KAAK,GAAe;gBACzB,UAAU;gBACV,UAAU,EAAE,cAAc,CAAC,UAAU;gBACrC,MAAM,EAAE,EAAE;aACV,CAAC;YAEF,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,EAAE,CAAuB,CAAC,CAAC,CAAC;YAChF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,EAAE,CAAuB,CAAC,CAAC;YACtE,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,cAAc;gBACpD,MAAM;gBACN,EAAE,EAAE,UAAU;aACd,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;YACpE,6DAA6D;YAC7D,MAAM,OAAO,GAAe;gBAC3B,UAAU,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;gBACpC,UAAU,EAAE,cAAc,CAAC,UAAU;gBACrC,MAAM,EAAE,EAAE;aACV,CAAC;YAEF,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAuB,CAAC,CAAC,CAAC;YAClF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC;QACpF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACpC,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/D,MAAM,OAAO,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;YAC7C,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAuB,CAAC,CAAC,CAAC;YAClF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC;YAC7D,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC;YAC/E,MAAM,CAAC,gBAAgB,CAAC,yBAAyB,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;iBACtG,IAAI,CAAC;QACR,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;YACjE,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/D,MAAM,kBAAkB,GAAG,CAAuB,CAAC;YACnD,MAAM,MAAM,GAAG;gBACd,WAAW,EAAE,CAAuB;gBACpC,MAAM,EAAE,CAAC,kBAAkB,CAAC;gBAC5B,IAAI,EAAE,kBAAkB,CAAC,KAAiC;aAC1D,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,wBAAwB;gBAC9D,MAAM;gBACN,UAAU,EAAE,kBAAkB;aAC9B,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACxD,0CAA0C;YAC1C,MAAM,aAAa,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;YACnD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;YAC/C,MAAM,UAAU,GAAa,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAEjD,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/D,MAAM,kBAAkB,GAAG,CAAuB,CAAC;YACnD,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,aAAa,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC;YACnF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,iBAAiB,GAAG,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YACjF,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACvB,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;YAC5D,MAAM,cAAc,GAAG;gBACtB,gFAAgF;gBAChF,cAAc,EAAE,QAAQ,CAAC,IAAI,CAAC,aAAa;gBAC3C,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;gBAC1C,IAAI,EAAE,IAAI,CAAC,MAAM;aACjB,CAAC;YACF,MAAM,KAAK,GAAG,mBAAmB,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,mBAAmB,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;YACrG,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5C,oCAAoC;YACpC,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,QAAQ;gBAC9C,MAAM;gBACN,KAAK;gBACL,YAAY,EAAE;oBACb,IAAI,EAAE,yBAAyB,CAAC,QAAQ;oBACxC,KAAK,EAAE,cAAc;oBACrB,YAAY,EAAE,qBAAqB,CAAC,SAAS;iBAC7C;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,mEAAmE,EAAE,GAAG,EAAE;YAC5E,WAAW,CAAC,WAAW,CACtB,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAuB,CAAC,CACvF,CAAC;YACF,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAuB,CAAC,CAAC;YACxG,oCAAoC;YACpC,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,8BAA8B;gBACpE,MAAM;gBACN,UAAU,EAAE,MAAM,CAAC,WAAW;aAC9B,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACxD,MAAM,KAAK,GAAG,mBAAmB,CAAC,IAAI,CAAC,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAClG,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAC1D,CAAC;YACF,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5C,kCAAkC;YAClC,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,QAAQ;gBAC9C,MAAM;gBACN,KAAK;gBACL,YAAY,EAAE,yBAAyB,CAAC,QAAQ;aAChD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC5B,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC;QACrE,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAClC,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAC/B,MAAM,UAAU,GAAG,CAAuB,CAAC;YAC3C,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;YACpG,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,UAAU,EAAE,mBAAmB,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACtG,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC/E,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAC3E,QAAQ,CAAC,KAAK,CAAC,UAAU;gBACzB,QAAQ,CAAC,IAAI,CAAC,UAAU;aACxB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;YACjC,gGAAgG;YAChG,oFAAoF;YACpF,MAAM,kBAAkB,GAAG,CAAuB,CAAC;YACnD,MAAM,gBAAgB,GAAG,CAAuB,CAAC;YACjD,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC;YAC5G,mCAAmC;YACnC,MAAM,gBAAgB,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YACnD,MAAM,kBAAkB,GAAG,QAAQ,CAAC,iBAAiB,CAAC,gBAAgB,CAAC,CAAC;YACxE,MAAM,kBAAkB,GAAG,WAAyB,CAAC;YACrD,WAAW,CAAC,WAAW,CACtB,cAAc,CAAC,KAAK,CACnB;gBACC;oBACC,GAAG,kBAAkB;oBACrB,MAAM,EAAE,EAAE,CAAC,kBAAkB,CAAC,EAAE,CAAC,kBAAkB,CAAC,EAAE,EAAE,gCAAgC;iBACxF;aACD,EACD,gBAAgB,CAChB,CACD,CAAC;YACF,WAAW,CAAC,WAAW,CACtB,cAAc,CAAC,MAAM,CAAC,gBAAgB,EAAE,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAC3F,CAAC;YACF,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACzE,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC;YAClD,MAAM,aAAa,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC;gBAC/C,MAAM,EAAE,gBAAgB;gBACxB,KAAK,EAAE,kBAAkB;aACzB,CAAC,CAAC;YACH,MAAM,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;YACtE,MAAM,kBAAkB,GAAG,CAAuB,CAAC;YACnD,MAAM,mBAAmB,GAAG,CAAuB,CAAC;YACpD,MAAM,iBAAiB,GAAG,CAAuB,CAAC;YAClD,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC;YAC5G,WAAW,CAAC,WAAW,CACtB,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,mBAAmB,CAAC,CACpF,CAAC;YAEF,MAAM,cAAc,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YACjD,MAAM,eAAe,GAAG;gBACvB,GAAG,QAAQ,CAAC,iBAAiB,CAAC,cAAc,CAAC;gBAC7C,MAAM,EAAE;oBACP,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,kBAAkB,CAAC;oBAChD,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,mBAAmB,CAAC;iBAClD;aACD,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC;YACpF,WAAW,CAAC,WAAW,CACtB,cAAc,CAAC,MAAM,CAAC,iBAAiB,EAAE,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAC5F,CAAC;YACF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAChF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;YAE7F,MAAM,eAAe,GAAG,yBAAyB,CAAC,WAAW,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;YACpF,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC;YAEtC,MAAM,cAAc,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACxD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,gBAAgB,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;YAEtE,MAAM,eAAe,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YAC1D,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,gBAAgB,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QACzE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kFAAkF,EAAE,GAAG,EAAE;YAC3F,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/D,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxF,MAAM,wBAAwB,GAAG,CAAuB,CAAC;YACzD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAE/E,MAAM,OAAO,GAAe;gBAC3B,UAAU,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;gBACpC,UAAU,EAAE,cAAc,CAAC,UAAU;gBACrC,MAAM,EAAE,EAAE;aACV,CAAC;YAEF,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,wBAAwB,CAAC,CAAC,CAAC;YACnF,WAAW,CAAC,WAAW,CACtB,cAAc,CAAC,MAAM,CAAC,wBAAwB,EAAE,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CACnG,CAAC;YACF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QACxG,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 { expect, assert } from 'chai';\nimport { DetachedSequenceId, NodeId, TraitLabel } from '../Identifiers.js';\nimport { getChangeNodeFromViewNode } from '../SerializationUtilities.js';\nimport { GenericTransaction, TransactionInternal } from '../TransactionInternal.js';\nimport {\n\tChangeInternal,\n\tChangeNode,\n\tChangeTypeInternal,\n\tConstraintEffect,\n\tEditStatus,\n\tSetValueInternal,\n\tSide,\n\tStablePlaceInternal,\n\tStableRangeInternal,\n} from '../persisted-types/index.js';\nimport { StablePlace, StableRange } from '../ChangeTypes.js';\nimport { deepCompareNodes, PlaceValidationResult, RangeValidationResultKind } from '../EditUtilities.js';\nimport { SimpleTestTree } from './utilities/TestNode.js';\nimport { refreshTestTree, testTrait, testTraitLabel } from './utilities/TestUtilities.js';\n\ndescribe('Transaction', () => {\n\tlet transaction: GenericTransaction;\n\tconst testTree = refreshTestTree(\n\t\tundefined,\n\t\t(t) => {\n\t\t\ttransaction = TransactionInternal.factory(t.view);\n\t\t},\n\t\ttrue\n\t);\n\tdescribe('Constraints', () => {\n\t\tfunction getTestTrait(): StableRangeInternal {\n\t\t\treturn StableRange.all(testTrait(transaction.view));\n\t\t}\n\n\t\tit('can be met', () => {\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('can be unmet', () => {\n\t\t\tconst badId = testTree.generateNodeId('not in tree');\n\t\t\tconst invalidStableRange: StableRangeInternal = {\n\t\t\t\tstart: { side: Side.After, referenceSibling: badId },\n\t\t\t\tend: { side: Side.Before },\n\t\t\t};\n\t\t\tconst constraint = {\n\t\t\t\ttoConstrain: {\n\t\t\t\t\tstart: { side: Side.After, referenceSibling: badId },\n\t\t\t\t\tend: { side: Side.Before },\n\t\t\t\t},\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint as ChangeTypeInternal.Constraint,\n\t\t\t};\n\t\t\ttransaction.applyChange(constraint);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.ConstraintViolation,\n\t\t\t\tconstraint,\n\t\t\t\tviolation: {\n\t\t\t\t\tkind: TransactionInternal.ConstraintViolationKind.BadRange,\n\t\t\t\t\trangeFailure: {\n\t\t\t\t\t\tkind: RangeValidationResultKind.BadPlace,\n\t\t\t\t\t\tplace: invalidStableRange.start,\n\t\t\t\t\t\tplaceFailure: PlaceValidationResult.MissingSibling,\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\t\tit('effect can apply anyway', () => {\n\t\t\tconst badId = testTree.generateNodeId('not in tree');\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: {\n\t\t\t\t\tstart: { side: Side.After, referenceSibling: badId },\n\t\t\t\t\tend: { side: Side.Before },\n\t\t\t\t},\n\t\t\t\teffect: ConstraintEffect.ValidRetry,\n\t\t\t\ttype: ChangeTypeInternal.Constraint,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('length can be met', () => {\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint,\n\t\t\t\tlength: 0,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('length can be unmet', () => {\n\t\t\tconst constraint = {\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint as ChangeTypeInternal.Constraint,\n\t\t\t\tlength: 1,\n\t\t\t};\n\t\t\ttransaction.applyChange(constraint);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.ConstraintViolation,\n\t\t\t\tconstraint,\n\t\t\t\tviolation: {\n\t\t\t\t\tkind: TransactionInternal.ConstraintViolationKind.BadLength,\n\t\t\t\t\tactual: 0,\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\t\tit('parent can be met', () => {\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint,\n\t\t\t\tparentNode: testTree.identifier,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('parent can be unmet', () => {\n\t\t\tconst parentNode = testTree.generateNodeId('not in tree');\n\t\t\tconst constraint = {\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint as ChangeTypeInternal.Constraint,\n\t\t\t\tparentNode,\n\t\t\t};\n\t\t\ttransaction.applyChange(constraint);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.ConstraintViolation,\n\t\t\t\tconstraint,\n\t\t\t\tviolation: {\n\t\t\t\t\tkind: TransactionInternal.ConstraintViolationKind.BadParent,\n\t\t\t\t\tactual: parentNode,\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\t\tit('label can be met', () => {\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint,\n\t\t\t\tlabel: testTraitLabel,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('label can be unmet', () => {\n\t\t\tconst constraint = {\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint as ChangeTypeInternal.Constraint,\n\t\t\t\tlabel: '7969ee2e-5418-43db-929a-4e9a23c5499d' as TraitLabel,\n\t\t\t};\n\t\t\ttransaction.applyChange(constraint);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.ConstraintViolation,\n\t\t\t\tconstraint,\n\t\t\t\tviolation: {\n\t\t\t\t\tkind: TransactionInternal.ConstraintViolationKind.BadLabel,\n\t\t\t\t\tactual: testTraitLabel,\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\t});\n\n\tdescribe('SetValue', () => {\n\t\tit('can be invalid if the node does not exist', () => {\n\t\t\tconst change: SetValueInternal = {\n\t\t\t\tnodeToModify: testTree.generateNodeId(),\n\t\t\t\tpayload: {},\n\t\t\t\ttype: ChangeTypeInternal.SetValue,\n\t\t\t};\n\t\t\ttransaction.applyChange(change);\n\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.UnknownId,\n\t\t\t\tchange,\n\t\t\t\tid: change.nodeToModify,\n\t\t\t});\n\t\t});\n\n\t\tit('can change payload', () => {\n\t\t\tconst payload = { foo: {} };\n\t\t\ttransaction.applyChange({\n\t\t\t\tnodeToModify: testTree.identifier,\n\t\t\t\tpayload, // Arbitrary payload.\n\t\t\t\ttype: ChangeTypeInternal.SetValue,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect(transaction.view.getViewNode(testTree.identifier).payload).deep.equals(payload);\n\t\t});\n\n\t\t// 'null' is not included here since it means clear the payload in setValue.\n\t\tfor (const payload of [0, '', [], {}]) {\n\t\t\tit(`can set payload to ${JSON.stringify(payload)}`, () => {\n\t\t\t\ttransaction.applyChange({\n\t\t\t\t\tnodeToModify: testTree.identifier,\n\t\t\t\t\tpayload,\n\t\t\t\t\ttype: ChangeTypeInternal.SetValue,\n\t\t\t\t});\n\t\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\t\texpect(transaction.view.getViewNode(testTree.identifier).payload).equals(payload);\n\t\t\t});\n\t\t}\n\n\t\tit('can clear an unset payload', () => {\n\t\t\ttransaction.applyChange(ChangeInternal.clearPayload(testTree.identifier));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect({}.hasOwnProperty.call(transaction.view.getViewNode(testTree.identifier), 'payload')).to.be.false;\n\t\t\texpect({}.hasOwnProperty.call(getChangeNodeFromViewNode(transaction.view, testTree.identifier), 'payload'))\n\t\t\t\t.to.be.false;\n\t\t});\n\n\t\tit('can clear a set payload', () => {\n\t\t\ttransaction.applyChange({\n\t\t\t\tnodeToModify: testTree.identifier,\n\t\t\t\tpayload: {},\n\t\t\t\ttype: ChangeTypeInternal.SetValue,\n\t\t\t});\n\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect(transaction.view.getViewNode(testTree.identifier).payload).not.undefined;\n\t\t\ttransaction.applyChange(ChangeInternal.clearPayload(testTree.identifier));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect({}.hasOwnProperty.call(transaction.view.getViewNode(testTree.identifier), 'payload')).to.be.false;\n\t\t\texpect({}.hasOwnProperty.call(getChangeNodeFromViewNode(transaction.view, testTree.identifier), 'payload'))\n\t\t\t\t.to.be.false;\n\t\t});\n\t});\n\n\tdescribe('Insert', () => {\n\t\tconst buildId = 0 as DetachedSequenceId;\n\n\t\tdescribe('can be malformed', () => {\n\t\t\tit('when the detached sequence ID is bogus', () => {\n\t\t\t\ttransaction.applyChange(ChangeInternal.build([testTree.buildLeafInternal()], buildId));\n\t\t\t\tconst change = ChangeInternal.insert(\n\t\t\t\t\t// Non-existent detached id\n\t\t\t\t\t1 as DetachedSequenceId,\n\t\t\t\t\t{ referenceSibling: testTree.identifier, side: Side.After }\n\t\t\t\t);\n\t\t\t\ttransaction.applyChange(change);\n\t\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\t\tconst result = transaction.close();\n\t\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\t\texpect(result.failure).deep.equals({\n\t\t\t\t\tkind: TransactionInternal.FailureKind.DetachedSequenceNotFound,\n\t\t\t\t\tchange,\n\t\t\t\t\tsequenceId: change.source,\n\t\t\t\t});\n\t\t\t});\n\t\t\tit('when the target place is malformed', () => {\n\t\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\t\ttransaction.applyChange(ChangeInternal.build([testTree.buildLeafInternal()], buildId));\n\n\t\t\t\tconst referenceTrait = testTree.left.traitLocation;\n\t\t\t\tconst malformedPlace = {\n\t\t\t\t\t// A place is malformed if it has both a reference trait and a reference sibling\n\t\t\t\t\treferenceTrait,\n\t\t\t\t\treferenceSibling: testTree.left.identifier,\n\t\t\t\t\tside: Side.Before,\n\t\t\t\t};\n\t\t\t\tconst change = ChangeInternal.insert(buildId, malformedPlace);\n\t\t\t\ttransaction.applyChange(change);\n\t\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\t\tconst result = transaction.close();\n\t\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\t\texpect(result.failure).deep.equals({\n\t\t\t\t\tkind: TransactionInternal.FailureKind.BadPlace,\n\t\t\t\t\tchange,\n\t\t\t\t\tplace: malformedPlace,\n\t\t\t\t\tplaceFailure: PlaceValidationResult.Malformed,\n\t\t\t\t});\n\t\t\t});\n\t\t});\n\t\tit('can be invalid when the target place is invalid', () => {\n\t\t\tconst badId = testTree.generateNodeId('not in tree');\n\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\ttransaction.applyChange(ChangeInternal.build([testTree.buildLeafInternal()], buildId));\n\t\t\tconst place = {\n\t\t\t\treferenceSibling: badId,\n\t\t\t\tside: Side.After,\n\t\t\t};\n\t\t\tconst change = ChangeInternal.insert(buildId, place);\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.BadPlace,\n\t\t\t\tchange,\n\t\t\t\tplace,\n\t\t\t\tplaceFailure: PlaceValidationResult.MissingSibling,\n\t\t\t});\n\t\t});\n\t\tit('a detached node with a payload', () => {\n\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\tconst payload = 42;\n\t\t\tconst detachedId = 0 as DetachedSequenceId;\n\t\t\ttransaction.applyChanges([\n\t\t\t\tChangeInternal.setPayload(testTree.left.identifier, payload),\n\t\t\t\tChangeInternal.detach(StableRange.only(testTree.left), detachedId),\n\t\t\t\tChangeInternal.insert(detachedId, StablePlace.atStartOf(testTree.left.traitLocation)),\n\t\t\t]);\n\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals([testTree.left.identifier]);\n\t\t\texpect(transaction.view.getViewNode(testTree.left.identifier).payload).to.equal(payload);\n\t\t});\n\t\t[Side.Before, Side.After].forEach((side) => {\n\t\t\tit(`can insert a node at the ${side === Side.After ? 'beginning' : 'end'} of a trait`, () => {\n\t\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\t\tconst newNodeId = testTree.generateNodeId();\n\t\t\t\tconst newNode = testTree.buildLeafInternal(newNodeId);\n\t\t\t\ttransaction.applyChanges(\n\t\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t\t[newNode],\n\t\t\t\t\t\tside === Side.After\n\t\t\t\t\t\t\t? StablePlace.atStartOf(testTree.left.traitLocation)\n\t\t\t\t\t\t\t: StablePlace.atEndOf(testTree.left.traitLocation)\n\t\t\t\t\t)\n\t\t\t\t);\n\t\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals(\n\t\t\t\t\tside === Side.After ? [newNodeId, testTree.left.identifier] : [testTree.left.identifier, newNodeId]\n\t\t\t\t);\n\t\t\t});\n\t\t\tit(`can insert a node ${side === Side.Before ? 'before' : 'after'} another node`, () => {\n\t\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\t\tconst newNode = testTree.buildLeafInternal();\n\n\t\t\t\ttransaction.applyChanges(\n\t\t\t\t\tChangeInternal.insertTree([newNode], { referenceSibling: testTree.left.identifier, side })\n\t\t\t\t);\n\t\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals(\n\t\t\t\t\tside === Side.Before\n\t\t\t\t\t\t? [newNode.identifier, testTree.left.identifier]\n\t\t\t\t\t\t: [testTree.left.identifier, newNode.identifier]\n\t\t\t\t);\n\t\t\t});\n\t\t});\n\t});\n\n\tdescribe('Build', () => {\n\t\tit('can be malformed due to detached ID collision', () => {\n\t\t\t// Apply two Build_s with the same detached id\n\t\t\ttransaction.applyChange(ChangeInternal.build([testTree.buildLeafInternal()], 0 as DetachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\tconst change = ChangeInternal.build([testTree.buildLeafInternal()], 0 as DetachedSequenceId);\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.DetachedSequenceIdAlreadyInUse,\n\t\t\t\tchange,\n\t\t\t\tsequenceId: change.destination,\n\t\t\t});\n\t\t});\n\n\t\tit('can be malformed due to duplicate node identifiers', () => {\n\t\t\t// Build two nodes with the same identifier, one of them nested\n\t\t\tconst newNode = testTree.buildLeafInternal();\n\t\t\tconst change = ChangeInternal.build(\n\t\t\t\t[\n\t\t\t\t\tnewNode,\n\t\t\t\t\t{\n\t\t\t\t\t\t...testTree.buildLeafInternal(),\n\t\t\t\t\t\ttraits: {\n\t\t\t\t\t\t\t[testTree.left.traitLabel]: [\n\t\t\t\t\t\t\t\t{ ...testTree.buildLeafInternal(), identifier: newNode.identifier },\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\t0 as DetachedSequenceId\n\t\t\t);\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.DuplicateIdInBuild,\n\t\t\t\tchange,\n\t\t\t\tid: newNode.identifier,\n\t\t\t});\n\t\t});\n\n\t\tit('is invalid when a node already exists with the given identifier', () => {\n\t\t\t// Build two nodes with the same identifier\n\t\t\tconst identifier = testTree.generateNodeId();\n\t\t\tconst node1: ChangeNode = {\n\t\t\t\tidentifier,\n\t\t\t\tdefinition: SimpleTestTree.definition,\n\t\t\t\ttraits: {},\n\t\t\t};\n\t\t\tconst node2: ChangeNode = {\n\t\t\t\tidentifier,\n\t\t\t\tdefinition: SimpleTestTree.definition,\n\t\t\t\ttraits: {},\n\t\t\t};\n\n\t\t\ttransaction.applyChange(ChangeInternal.build([node1], 0 as DetachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\tconst change = ChangeInternal.build([node2], 1 as DetachedSequenceId);\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.IdAlreadyInUse,\n\t\t\t\tchange,\n\t\t\t\tid: identifier,\n\t\t\t});\n\t\t});\n\n\t\tit('is invalid to build a node that has already been inserted', () => {\n\t\t\t// Build new node using identifier already in use in the tree\n\t\t\tconst newNode: ChangeNode = {\n\t\t\t\tidentifier: testTree.left.identifier,\n\t\t\t\tdefinition: SimpleTestTree.definition,\n\t\t\t\ttraits: {},\n\t\t\t};\n\n\t\t\ttransaction.applyChange(ChangeInternal.build([newNode], 0 as DetachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure.kind).equals(TransactionInternal.FailureKind.IdAlreadyInUse);\n\t\t});\n\n\t\tit('can build a detached node', () => {\n\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\tconst newNode = testTree.buildLeafInternal();\n\t\t\ttransaction.applyChange(ChangeInternal.build([newNode], 0 as DetachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect(transaction.view.hasNode(newNode.identifier)).is.true;\n\t\t\texpect(transaction.view.tryGetParentViewNode(newNode.identifier)).is.undefined;\n\t\t\texpect(deepCompareNodes(getChangeNodeFromViewNode(transaction.view, newNode.identifier), newNode)).to.be\n\t\t\t\t.true;\n\t\t});\n\n\t\tit(\"can be malformed if detached sequence id doesn't exist\", () => {\n\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\tconst detachedSequenceId = 0 as DetachedSequenceId;\n\t\t\tconst change = {\n\t\t\t\tdestination: 1 as DetachedSequenceId,\n\t\t\t\tsource: [detachedSequenceId],\n\t\t\t\ttype: ChangeTypeInternal.Build as ChangeTypeInternal.Build,\n\t\t\t};\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.DetachedSequenceNotFound,\n\t\t\t\tchange,\n\t\t\t\tsequenceId: detachedSequenceId,\n\t\t\t});\n\t\t});\n\n\t\tit('can build a node with an explicit empty trait', () => {\n\t\t\t// Forest should strip off the empty trait\n\t\t\tconst nodeWithEmpty = testTree.buildLeafInternal();\n\t\t\tconst traits = new Map<TraitLabel, NodeId[]>();\n\t\t\tconst emptyTrait: NodeId[] = [];\n\t\t\ttraits.set(testTree.left.traitLabel, emptyTrait);\n\n\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\tconst detachedSequenceId = 0 as DetachedSequenceId;\n\t\t\ttransaction.applyChange(ChangeInternal.build([nodeWithEmpty], detachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\tconst viewNodeWithEmpty = transaction.view.getViewNode(nodeWithEmpty.identifier);\n\t\t\texpect(viewNodeWithEmpty.traits.size).to.equal(0);\n\t\t});\n\t});\n\n\tdescribe('Detach', () => {\n\t\tit('can be malformed if the target range is malformed', () => {\n\t\t\tconst malformedPlace = {\n\t\t\t\t// A place is malformed if it has both a reference trait and a reference sibling\n\t\t\t\treferenceTrait: testTree.left.traitLocation,\n\t\t\t\treferenceSibling: testTree.left.identifier,\n\t\t\t\tside: Side.Before,\n\t\t\t};\n\t\t\tconst range = StableRangeInternal.from(malformedPlace).to(StablePlaceInternal.after(testTree.right));\n\t\t\tconst change = ChangeInternal.detach(range);\n\t\t\t// Supplied StableRange is malformed\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.BadRange,\n\t\t\t\tchange,\n\t\t\t\trange,\n\t\t\t\trangeFailure: {\n\t\t\t\t\tkind: RangeValidationResultKind.BadPlace,\n\t\t\t\t\tplace: malformedPlace,\n\t\t\t\t\tplaceFailure: PlaceValidationResult.Malformed,\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\t\tit('can be malformed if the destination sequence id is already in use', () => {\n\t\t\ttransaction.applyChange(\n\t\t\t\tChangeInternal.detach(StableRangeInternal.only(testTree.left), 0 as DetachedSequenceId)\n\t\t\t);\n\t\t\tconst change = ChangeInternal.detach(StableRangeInternal.only(testTree.right), 0 as DetachedSequenceId);\n\t\t\t// Supplied StableRange is malformed\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.DetachedSequenceIdAlreadyInUse,\n\t\t\t\tchange,\n\t\t\t\tsequenceId: change.destination,\n\t\t\t});\n\t\t});\n\t\tit('can be invalid if the target range is invalid', () => {\n\t\t\tconst range = StableRangeInternal.from(StablePlaceInternal.atEndOf(testTree.left.traitLocation)).to(\n\t\t\t\tStablePlaceInternal.atStartOf(testTree.left.traitLocation)\n\t\t\t);\n\t\t\tconst change = ChangeInternal.detach(range);\n\t\t\t// Start place is before end place\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.BadRange,\n\t\t\t\tchange,\n\t\t\t\trange,\n\t\t\t\trangeFailure: RangeValidationResultKind.Inverted,\n\t\t\t});\n\t\t});\n\t\tit('can delete a node', () => {\n\t\t\ttransaction.applyChange(ChangeInternal.detach(StableRangeInternal.only(testTree.left)));\n\t\t\texpect(transaction.view.hasNode(testTree.left.identifier)).is.false;\n\t\t});\n\t});\n\n\tdescribe('Composite changes', () => {\n\t\tit('can form a node move', () => {\n\t\t\tconst detachedId = 0 as DetachedSequenceId;\n\t\t\ttransaction.applyChange(ChangeInternal.detach(StableRangeInternal.only(testTree.left), detachedId));\n\t\t\ttransaction.applyChange(ChangeInternal.insert(detachedId, StablePlaceInternal.after(testTree.right)));\n\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals([]);\n\t\t\texpect(transaction.view.getTrait(testTree.right.traitLocation)).deep.equals([\n\t\t\t\ttestTree.right.identifier,\n\t\t\t\ttestTree.left.identifier,\n\t\t\t]);\n\t\t});\n\t\tit('can form a wrap insert', () => {\n\t\t\t// A wrap insert is an edit that inserts a new node between a subtree and its parent atomically.\n\t\t\t// Ex: given A -> B -> C, a wrap insert of D around B would produce A -> D -> B -> C\n\t\t\tconst leftNodeDetachedId = 0 as DetachedSequenceId;\n\t\t\tconst parentDetachedId = 1 as DetachedSequenceId;\n\t\t\ttransaction.applyChange(ChangeInternal.detach(StableRangeInternal.only(testTree.left), leftNodeDetachedId));\n\t\t\t// This is node D, from the example\n\t\t\tconst wrappingParentId = testTree.generateNodeId();\n\t\t\tconst wrappingParentNode = testTree.buildLeafInternal(wrappingParentId);\n\t\t\tconst wrappingTraitLabel = 'wrapTrait' as TraitLabel;\n\t\t\ttransaction.applyChange(\n\t\t\t\tChangeInternal.build(\n\t\t\t\t\t[\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t...wrappingParentNode,\n\t\t\t\t\t\t\ttraits: { [wrappingTraitLabel]: [leftNodeDetachedId] }, // Re-parent left under new node\n\t\t\t\t\t\t},\n\t\t\t\t\t],\n\t\t\t\t\tparentDetachedId\n\t\t\t\t)\n\t\t\t);\n\t\t\ttransaction.applyChange(\n\t\t\t\tChangeInternal.insert(parentDetachedId, StablePlace.atStartOf(testTree.left.traitLocation))\n\t\t\t);\n\t\t\tconst leftTrait = transaction.view.getTrait(testTree.left.traitLocation);\n\t\t\texpect(leftTrait).deep.equals([wrappingParentId]);\n\t\t\tconst wrappingTrait = transaction.view.getTrait({\n\t\t\t\tparent: wrappingParentId,\n\t\t\t\tlabel: wrappingTraitLabel,\n\t\t\t});\n\t\t\texpect(wrappingTrait).deep.equals([testTree.left.identifier]);\n\t\t});\n\n\t\tit('can build and insert a tree that contains detached subtrees', () => {\n\t\t\tconst leftNodeDetachedId = 0 as DetachedSequenceId;\n\t\t\tconst rightNodeDetachedId = 1 as DetachedSequenceId;\n\t\t\tconst detachedIdSubtree = 2 as DetachedSequenceId;\n\t\t\ttransaction.applyChange(ChangeInternal.detach(StableRangeInternal.only(testTree.left), leftNodeDetachedId));\n\t\t\ttransaction.applyChange(\n\t\t\t\tChangeInternal.detach(StableRangeInternal.only(testTree.right), rightNodeDetachedId)\n\t\t\t);\n\n\t\t\tconst detachedNodeId = testTree.generateNodeId();\n\t\t\tconst detachedSubtree = {\n\t\t\t\t...testTree.buildLeafInternal(detachedNodeId),\n\t\t\t\ttraits: {\n\t\t\t\t\t[testTree.left.traitLabel]: [leftNodeDetachedId],\n\t\t\t\t\t[testTree.right.traitLabel]: [rightNodeDetachedId],\n\t\t\t\t},\n\t\t\t};\n\t\t\ttransaction.applyChange(ChangeInternal.build([detachedSubtree], detachedIdSubtree));\n\t\t\ttransaction.applyChange(\n\t\t\t\tChangeInternal.insert(detachedIdSubtree, StablePlace.atStartOf(testTree.left.traitLocation))\n\t\t\t);\n\t\t\texpect(transaction.view.getTrait(testTree.right.traitLocation)).deep.equals([]);\n\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals([detachedNodeId]);\n\n\t\t\tconst insertedSubtree = getChangeNodeFromViewNode(transaction.view, detachedNodeId);\n\t\t\tconst traits = insertedSubtree.traits;\n\n\t\t\tconst leftTreeTraits = traits[testTree.left.traitLabel];\n\t\t\texpect(leftTreeTraits).to.have.lengthOf(1);\n\t\t\texpect(deepCompareNodes(leftTreeTraits[0], testTree.left)).to.be.true;\n\n\t\t\tconst rightTreeTraits = traits[testTree.right.traitLabel];\n\t\t\texpect(rightTreeTraits).to.have.lengthOf(1);\n\t\t\texpect(deepCompareNodes(rightTreeTraits[0], testTree.right)).to.be.true;\n\t\t});\n\n\t\tit('can build and insert a tree with the same identity as that of a detached subtree', () => {\n\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\ttransaction.applyChange(ChangeInternal.detach(StableRangeInternal.only(testTree.left)));\n\t\t\tconst idOfDetachedNodeToInsert = 1 as DetachedSequenceId;\n\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals([]);\n\n\t\t\tconst newNode: ChangeNode = {\n\t\t\t\tidentifier: testTree.left.identifier,\n\t\t\t\tdefinition: SimpleTestTree.definition,\n\t\t\t\ttraits: {},\n\t\t\t};\n\n\t\t\ttransaction.applyChange(ChangeInternal.build([newNode], idOfDetachedNodeToInsert));\n\t\t\ttransaction.applyChange(\n\t\t\t\tChangeInternal.insert(idOfDetachedNodeToInsert, StablePlace.atStartOf(testTree.left.traitLocation))\n\t\t\t);\n\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals([testTree.left.identifier]);\n\t\t});\n\t});\n});\n"]}
package/lib/test/TreeCompression.tests.js CHANGED
@@ -4,14 +4,14 @@
4
4
  */
5
5
  import { expect, assert } from 'chai';
6
6
  import { v4 as uuidv4 } from 'uuid';
7
- import { walkTree } from '../EditUtilities';
8
- import { createSessionId, IdCompressor, isFinalId, isLocalId } from '../id-compressor';
9
- import { isDetachedSequenceId, } from '../Identifiers';
10
- import { scopeIdNormalizer } from '../NodeIdUtilities';
11
- import { RevisionView } from '../RevisionView';
12
- import { MutableStringInterner } from '../StringInterner';
13
- import { InterningTreeCompressor } from '../TreeCompressor';
14
- import { makeNodeIdContext, setUpTestTree } from './utilities/TestUtilities';
7
+ import { walkTree } from '../EditUtilities.js';
8
+ import { createSessionId, IdCompressor, isFinalId, isLocalId } from '../id-compressor/index.js';
9
+ import { isDetachedSequenceId, } from '../Identifiers.js';
10
+ import { scopeIdNormalizer } from '../NodeIdUtilities.js';
11
+ import { RevisionView } from '../RevisionView.js';
12
+ import { MutableStringInterner } from '../StringInterner.js';
13
+ import { InterningTreeCompressor } from '../TreeCompressor.js';
14
+ import { makeNodeIdContext, setUpTestTree } from './utilities/TestUtilities.js';
15
15
  /**
16
16
  * Verifies a tree can round-trip through compression/decompression. Optionally also asserts the compressed state
17
17
  * matches some expected state.
package/lib/test/TreeCompression.tests.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"TreeCompression.tests.js","sourceRoot":"","sources":["../../src/test/TreeCompression.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AACtC,OAAO,EAAE,EAAE,IAAI,MAAM,EAAE,MAAM,MAAM,CAAC;AACpC,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5C,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AACvF,OAAO,EAIN,oBAAoB,GAIpB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAAkC,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAEvF,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC;AAC1D,OAAO,EAAE,uBAAuB,EAAE,MAAM,mBAAmB,CAAC;AAC5D,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAE7E;;;;;;GAMG;AACH,SAAS,eAAe,CACvB,IAAmC,EACnC,YAA2D,EAC3D,UAAmE,EACnE,iBAAkH,EAClH,gBAAgG,CAC/F,QAAQ,EACR,IAAI,EACH,EAAE;IACH,QAAQ,CACP,IAAI,EACJ,CAAC,IAAI,EAAE,EAAE;QACR,QAAQ,CAAC,qBAAqB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAChD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;YACpD,QAAQ,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;SACtC;IACF,CAAC,EACD,oBAAoB,CACpB,CAAC;AACH,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,qBAAqB,EAAE,CAAC;IAC7C,aAAa,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAC9B,MAAM,cAAc,GAAG,IAAI,uBAAuB,EAAgB,CAAC;IACnE,MAAM,cAAc,GAAG,cAAc,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;IAC7E,IAAI,UAAU,KAAK,SAAS,EAAE;QAC7B,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;KACjD;IACD,MAAM,eAAe,GAAG,QAAQ,CAAC,eAAe,EAAE,CAAC;IACnD,MAAM,WAAW,GAAG,IAAI,qBAAqB,CAAC,eAAe,CAAC,CAAC;IAC/D,MAAM,gBAAgB,GAAG,cAAc,CAAC,UAAU,CAAC,cAAc,EAAE,WAAW,EAAE,YAAY,CAAC,CAAC;IAC9F,IAAI,iBAAiB,EAAE;QACtB,iBAAiB,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC;KAC1C;SAAM;QACN,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;KAC7C;AACF,CAAC;AAED;;;GAGG;AACH,SAAS,UAAU,CAAC,CAAS;IAC5B,OAAO,CAAqB,CAAC;AAC9B,CAAC;AAED,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAChC,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC3C,MAAM,aAAa,GAAG,EAAwB,CAAC;QAC/C,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,eAAe,CAAC,aAAa,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE,aAAa,CAAC,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;QACnE,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACpC,MAAM,kBAAkB,GAAG,EAAwB,CAAC;QACpD,MAAM,IAAI,GAAwC;YACjD,UAAU,EAAE,EAAE;YACd,UAAU,EAAE,MAAoB;YAChC,MAAM,EAAE;gBACP,SAAS,EAAE,CAAC,kBAAkB,CAAC;aAC/B;SACD,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE;YACjD,UAAU,CAAC,CAAC,CAAC;YACb,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC;YAC9B,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,kBAAkB,CAAC,CAAC;SACrC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;QAC9D,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACpC,MAAM,IAAI,GAAoB;YAC7B,UAAU,EAAE,EAAE;YACd,UAAU,EAAE,MAAoB;YAChC,MAAM,EAAE,EAAE;SACV,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACpG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACrC,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACpC,MAAM,IAAI,GAAoB;YAC7B,UAAU,EAAE,EAAE;YACd,UAAU,EAAE,MAAoB;YAChC,MAAM,EAAE,EAAE;YACV,OAAO,EAAE,CAAC;SACV,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC7C,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACpC,MAAM,UAAU,GAAG,MAAoB,CAAC;QACxC,MAAM,IAAI,GAAoB;YAC7B,UAAU,EAAE,EAAE;YACd,UAAU;YACV,MAAM,EAAE,EAAE;SACV,CAAC;QACF,eAAe,CACd,IAAI,EACJ,iBAAiB,CAAC,OAAO,CAAC,EAC1B,CAAC,UAAU,EAAE,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC,EAC5C,SAAS,EACT,GAAG,EAAE,GAAE,CAAC,CAAC,oBAAoB,CAC7B,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC7C,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACzC,MAAM,gBAAgB,GAAG,MAAoB,CAAC;QAC9C,MAAM,eAAe,GAAG,MAAoB,CAAC;QAC7C,MAAM,IAAI,GAAoB;YAC7B,UAAU,EAAE,QAAQ;YACpB,UAAU,EAAE,gBAAgB;YAC5B,MAAM,EAAE;gBACP,MAAM,EAAE;oBACP;wBACC,UAAU,EAAE,OAAO;wBACnB,UAAU,EAAE,eAAe;wBAC3B,MAAM,EAAE,EAAE;qBACV;iBACD;aACD;SACD,CAAC;QACF,eAAe,CACd,IAAI,EACJ,iBAAiB,CAAC,OAAO,CAAC,EAC1B,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,QAAQ,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACpF,SAAS,EACT,CAAC,QAAQ,EAAE,EAAE;YACZ,QAAQ,CAAC,qBAAqB,CAAC,gBAAgB,CAAC,CAAC;YACjD,QAAQ,CAAC,qBAAqB,CAAC,eAAe,CAAC,CAAC;QACjD,CAAC,CACD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACtD,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACzC,MAAM,gBAAgB,GAAG,MAAoB,CAAC;QAC9C,MAAM,eAAe,GAAG,MAAoB,CAAC;QAC7C,MAAM,IAAI,GAAoB;YAC7B,UAAU,EAAE,QAAQ;YACpB,UAAU,EAAE,gBAAgB;YAC5B,MAAM,EAAE;gBACP,MAAM,EAAE;oBACP;wBACC,UAAU,EAAE,OAAO;wBACnB,UAAU,EAAE,eAAe;wBAC3B,MAAM,EAAE,EAAE;qBACV;iBACD;aACD;SACD,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE;YACjD,UAAU,CAAC,CAAC,CAAC;YACb,OAAO,CAAC,kBAAkB,CAAC,QAAQ,CAAC;YACpC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAClC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACnD,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACzC,MAAM,gBAAgB,GAAG,MAAoB,CAAC;QAC9C,MAAM,eAAe,GAAG,MAAoB,CAAC;QAC7C,MAAM,OAAO,GAAG,eAAe,CAAC;QAChC,MAAM,IAAI,GAAoB;YAC7B,UAAU,EAAE,QAAQ;YACpB,UAAU,EAAE,gBAAgB;YAC5B,MAAM,EAAE;gBACP,MAAM,EAAE;oBACP;wBACC,UAAU,EAAE,OAAO;wBACnB,UAAU,EAAE,eAAe;wBAC3B,MAAM,EAAE,EAAE;qBACV;iBACD;aACD;YACD,OAAO;SACP,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE;YACjD,UAAU,CAAC,CAAC,CAAC;YACb,OAAO,CAAC,kBAAkB,CAAC,QAAQ,CAAC;YACpC,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3C,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC7C,MAAM,IAAI,GAAG,aAAa,EAAE,CAAC;QAC7B,eAAe,CACd,IAAI,EACJ,iBAAiB,CAAC,IAAI,CAAC,EACvB;YACC,UAAU,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,UAAU,CAAC;YACxC;gBACC,UAAU,CAAC,CAAC,CAAC;gBACb,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;gBAChE,UAAU,CAAC,CAAC,CAAC;gBACb,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,2CAA2C;aAC9D;SACD;QACD,mHAAmH;QACnH,0EAA0E;QAC1E,CAAC,IAAI,EAAE,kBAAkB,EAAE,EAAE;YAC5B,MAAM,CACL,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,EAC7E,wBAAwB,CACxB,CAAC;QACH,CAAC,CACD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACpD,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,GAAoB,EAAE,CAAC,CAAC;YACxC,UAAU,EAAE,OAAO,CAAC,cAAc,EAAE;YACpC,UAAU,EAAE,MAAM,EAAgB;YAClC,MAAM,EAAE,EAAE;SACV,CAAC,CAAC;QAEH,oDAAoD;QACpD,MAAM,kBAAkB,GAAG,CAAC,MAAc,EAAmB,EAAE;YAC9D,IAAI,MAAM,KAAK,CAAC,EAAE;gBACjB,OAAO,QAAQ,EAAE,CAAC;aAClB;YAED,OAAO;gBACN,UAAU,EAAE,OAAO,CAAC,cAAc,EAAE;gBACpC,UAAU,EAAE,MAAM,EAAgB;gBAClC,MAAM,EAAE;oBACP,CAAC,MAAM,EAAgB,CAAC,EAAE,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBAC1D,CAAC,MAAM,EAAgB,CAAC,EAAE,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;iBAC1D;aACD,CAAC;QACH,CAAC,CAAC;QAEF,eAAe,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC5D,MAAM,eAAe,GAAG,CAAC,CAAC;QAC1B,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,eAAe,EAAE,EAAE,eAAe,CAAC,CAAC;QAC1E,MAAM,OAAO,GAAG,iBAAiB,CAAC,YAAY,CAAC,CAAC;QAChD,0DAA0D;QAC1D,0DAA0D;QAC1D,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,cAAc,EAAE,CAAC,CAAC;QAC3E,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,eAAe,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC,CAAW,CAAC,CAAC;QAC3G,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAEhD,SAAS,IAAI,CACZ,UAAkB,EAClB,MAAoD;YAEpD,OAAO;gBACN,UAAU;gBACV,UAAU,EAAE,KAAmB;gBAC/B,MAAM,EAAE,MAAM,IAAI,EAAE;aACpB,CAAC;QACH,CAAC;QAED,MAAM,IAAI,GAAoB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;YAC/C,KAAK,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,OAAO,EAAE;gBACR,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;oBACjB,QAAQ,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;oBACnE,QAAQ,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC7B,CAAC;aACF;YACD,QAAQ,EAAE;gBACT,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;oBACjB,UAAU,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC/B,CAAC;aACF;SACD,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAE9B,SAAS,EAAE,CAAC,EAAU;YACrB,OAAO,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;QACvC,CAAC;QAED,eAAe,CAAQ,IAAI,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE;YACxD,OAAO;YACP,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC;YACnB;gBACC,UAAU,CAAC,CAAC,CAAC;gBACb,CAAC,CAAC,OAAO,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzC,UAAU,CAAC,CAAC,CAAC;gBACb;oBACC,CAAC,OAAO,CAAC;oBACT;wBACC,OAAO;wBACP,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;wBACf;4BACC,UAAU,CAAC,CAAC,CAAC;4BACb,CAAC,CAAC,OAAO,CAAC,CAAC;4BACX,UAAU,CAAC,CAAC,CAAC;4BACb,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;yBACnE;qBACD;iBACD;gBACD,UAAU,CAAC,CAAC,CAAC;gBACb;oBACC,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC1B,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC1B;aACD;SACD,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 { expect, assert } from 'chai';\nimport { v4 as uuidv4 } from 'uuid';\nimport { walkTree } from '../EditUtilities';\nimport { createSessionId, IdCompressor, isFinalId, isLocalId } from '../id-compressor';\nimport {\n\tDefinition,\n\tDetachedSequenceId,\n\tInternedStringId,\n\tisDetachedSequenceId,\n\tNodeId,\n\tOpSpaceNodeId,\n\tTraitLabel,\n} from '../Identifiers';\nimport { ContextualizedNodeIdNormalizer, scopeIdNormalizer } from '../NodeIdUtilities';\nimport { CompressedPlaceholderTree, PlaceholderTree, TraitMap, TreeNode } from '../persisted-types';\nimport { RevisionView } from '../RevisionView';\nimport { MutableStringInterner } from '../StringInterner';\nimport { InterningTreeCompressor } from '../TreeCompressor';\nimport { makeNodeIdContext, setUpTestTree } from './utilities/TestUtilities';\n\n/**\n * Verifies a tree can round-trip through compression/decompression. Optionally also asserts the compressed state\n * matches some expected state.\n *\n * By default, this function asserts the round-tripped tree is deeply equal to the `tree` parameter.\n * If that parameter is not normalized (ex: contains extra properties), a custom `roundTripAsserter` can be passed instead.\n */\nfunction testCompression<TPlaceholder extends DetachedSequenceId | never>(\n\ttree: PlaceholderTree<TPlaceholder>,\n\tidNormalizer: ContextualizedNodeIdNormalizer<OpSpaceNodeId>,\n\tcompressed?: CompressedPlaceholderTree<OpSpaceNodeId, TPlaceholder>,\n\troundTripAsserter?: (tree: PlaceholderTree<TPlaceholder>, roundTrippedTree: PlaceholderTree<TPlaceholder>) => void,\n\tinternStrings: (interner: MutableStringInterner, tree: PlaceholderTree<TPlaceholder>) => void = (\n\t\tinterner,\n\t\ttree\n\t) => {\n\t\twalkTree<Exclude<PlaceholderTree<DetachedSequenceId>, DetachedSequenceId>, DetachedSequenceId>(\n\t\t\ttree,\n\t\t\t(node) => {\n\t\t\t\tinterner.getOrCreateInternedId(node.definition);\n\t\t\t\tfor (const trait of Object.keys(node.traits).sort()) {\n\t\t\t\t\tinterner.getOrCreateInternedId(trait);\n\t\t\t\t}\n\t\t\t},\n\t\t\tisDetachedSequenceId\n\t\t);\n\t}\n): void {\n\tconst interner = new MutableStringInterner();\n\tinternStrings(interner, tree);\n\tconst treeCompressor = new InterningTreeCompressor<TPlaceholder>();\n\tconst compressedTree = treeCompressor.compress(tree, interner, idNormalizer);\n\tif (compressed !== undefined) {\n\t\texpect(compressedTree).to.deep.equal(compressed);\n\t}\n\tconst internedStrings = interner.getSerializable();\n\tconst newInterner = new MutableStringInterner(internedStrings);\n\tconst decompressedTree = treeCompressor.decompress(compressedTree, newInterner, idNormalizer);\n\tif (roundTripAsserter) {\n\t\troundTripAsserter(tree, decompressedTree);\n\t} else {\n\t\texpect(decompressedTree).to.deep.equal(tree);\n\t}\n}\n\n/**\n * Brands the passed in number as an `InternedStringId`.\n * Ergonomic helper for making expected compressed trees typecheck.\n */\nfunction internedId(n: number): InternedStringId {\n\treturn n as InternedStringId;\n}\n\ndescribe('TreeCompression', () => {\n\tit('noops on a placeholder root tree', () => {\n\t\tconst placeholderId = 42 as DetachedSequenceId;\n\t\tconst context = makeNodeIdContext();\n\t\ttestCompression(placeholderId, scopeIdNormalizer(context), placeholderId);\n\t});\n\n\tit('can compress trees containing nested DetachedSequenceIds', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst id = context.generateNodeId();\n\t\tconst detachedSequenceId = 43 as DetachedSequenceId;\n\t\tconst tree: PlaceholderTree<DetachedSequenceId> = {\n\t\t\tidentifier: id,\n\t\t\tdefinition: 'node' as Definition,\n\t\t\ttraits: {\n\t\t\t\tsomeTrait: [detachedSequenceId],\n\t\t\t},\n\t\t};\n\t\ttestCompression(tree, scopeIdNormalizer(context), [\n\t\t\tinternedId(0),\n\t\t\tcontext.normalizeToOpSpace(id),\n\t\t\t[internedId(1), [detachedSequenceId]],\n\t\t]);\n\t});\n\n\tit('omits traits and payload fields on empty leaf nodes', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst id = context.generateNodeId();\n\t\tconst tree: PlaceholderTree = {\n\t\t\tidentifier: id,\n\t\t\tdefinition: 'node' as Definition,\n\t\t\ttraits: {},\n\t\t};\n\t\ttestCompression(tree, scopeIdNormalizer(context), [internedId(0), context.normalizeToOpSpace(id)]);\n\t});\n\n\tit('handles payloads on leaves', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst id = context.generateNodeId();\n\t\tconst tree: PlaceholderTree = {\n\t\t\tidentifier: id,\n\t\t\tdefinition: 'node' as Definition,\n\t\t\ttraits: {},\n\t\t\tpayload: 5,\n\t\t};\n\t\ttestCompression(tree, scopeIdNormalizer(context), [internedId(0), context.normalizeToOpSpace(id), [5]]);\n\t});\n\n\tit('handles non-interned `Definition`s', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst id = context.generateNodeId();\n\t\tconst definition = 'node' as Definition;\n\t\tconst tree: PlaceholderTree = {\n\t\t\tidentifier: id,\n\t\t\tdefinition,\n\t\t\ttraits: {},\n\t\t};\n\t\ttestCompression(\n\t\t\ttree,\n\t\t\tscopeIdNormalizer(context),\n\t\t\t[definition, context.normalizeToOpSpace(id)],\n\t\t\tundefined,\n\t\t\t() => {} /* intern nothing */\n\t\t);\n\t});\n\n\tit('handles non-interned `TraitLabel`s', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst parentId = context.generateNodeId();\n\t\tconst childId = context.generateNodeId();\n\t\tconst parentDefinition = 'def1' as Definition;\n\t\tconst childDefinition = 'def2' as Definition;\n\t\tconst tree: PlaceholderTree = {\n\t\t\tidentifier: parentId,\n\t\t\tdefinition: parentDefinition,\n\t\t\ttraits: {\n\t\t\t\ttrait1: [\n\t\t\t\t\t{\n\t\t\t\t\t\tidentifier: childId,\n\t\t\t\t\t\tdefinition: childDefinition,\n\t\t\t\t\t\ttraits: {},\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t},\n\t\t};\n\t\ttestCompression(\n\t\t\ttree,\n\t\t\tscopeIdNormalizer(context),\n\t\t\t[internedId(0), context.normalizeToOpSpace(parentId), ['trait1', [[internedId(1)]]]],\n\t\t\tundefined,\n\t\t\t(interner) => {\n\t\t\t\tinterner.getOrCreateInternedId(parentDefinition);\n\t\t\t\tinterner.getOrCreateInternedId(childDefinition);\n\t\t\t}\n\t\t);\n\t});\n\n\tit('handles intermediate nodes without payloads', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst parentId = context.generateNodeId();\n\t\tconst childId = context.generateNodeId();\n\t\tconst parentDefinition = 'def1' as Definition;\n\t\tconst childDefinition = 'def2' as Definition;\n\t\tconst tree: PlaceholderTree = {\n\t\t\tidentifier: parentId,\n\t\t\tdefinition: parentDefinition,\n\t\t\ttraits: {\n\t\t\t\ttrait1: [\n\t\t\t\t\t{\n\t\t\t\t\t\tidentifier: childId,\n\t\t\t\t\t\tdefinition: childDefinition,\n\t\t\t\t\t\ttraits: {},\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t},\n\t\t};\n\t\ttestCompression(tree, scopeIdNormalizer(context), [\n\t\t\tinternedId(0),\n\t\t\tcontext.normalizeToOpSpace(parentId),\n\t\t\t[internedId(1), [[internedId(2)]]],\n\t\t]);\n\t});\n\n\tit('handles intermediate nodes with payloads', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst parentId = context.generateNodeId();\n\t\tconst childId = context.generateNodeId();\n\t\tconst parentDefinition = 'def1' as Definition;\n\t\tconst childDefinition = 'def2' as Definition;\n\t\tconst payload = 'parentPayload';\n\t\tconst tree: PlaceholderTree = {\n\t\t\tidentifier: parentId,\n\t\t\tdefinition: parentDefinition,\n\t\t\ttraits: {\n\t\t\t\ttrait1: [\n\t\t\t\t\t{\n\t\t\t\t\t\tidentifier: childId,\n\t\t\t\t\t\tdefinition: childDefinition,\n\t\t\t\t\t\ttraits: {},\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t},\n\t\t\tpayload,\n\t\t};\n\t\ttestCompression(tree, scopeIdNormalizer(context), [\n\t\t\tinternedId(0),\n\t\t\tcontext.normalizeToOpSpace(parentId),\n\t\t\t[payload, internedId(1), [[internedId(2)]]],\n\t\t]);\n\t});\n\n\tit('handles traits with multiple nodes', () => {\n\t\tconst tree = setUpTestTree();\n\t\ttestCompression<never>(\n\t\t\ttree,\n\t\t\tscopeIdNormalizer(tree),\n\t\t\t[\n\t\t\t\tinternedId(0),\n\t\t\t\ttree.normalizeToOpSpace(tree.identifier),\n\t\t\t\t[\n\t\t\t\t\tinternedId(1),\n\t\t\t\t\t[[internedId(0), tree.normalizeToOpSpace(tree.left.identifier)]],\n\t\t\t\t\tinternedId(2),\n\t\t\t\t\t[[internedId(0)]], // Right ID should be elided, but no others\n\t\t\t\t],\n\t\t\t],\n\t\t\t// SimpleTestTree contains extra properties, so deep compare as objects is insufficient. The revision view strategy\n\t\t\t// only works for valid standalone trees (i.e. ones without placeholders).\n\t\t\t(tree, treeAfterRoundTrip) => {\n\t\t\t\texpect(\n\t\t\t\t\tRevisionView.fromTree(tree).equals(RevisionView.fromTree(treeAfterRoundTrip)),\n\t\t\t\t\t'Unequal revision views'\n\t\t\t\t);\n\t\t\t}\n\t\t);\n\t});\n\n\tit('can round trip a tree with several levels', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst makeLeaf = (): PlaceholderTree => ({\n\t\t\tidentifier: context.generateNodeId(),\n\t\t\tdefinition: uuidv4() as Definition,\n\t\t\ttraits: {},\n\t\t});\n\n\t\t// Makes a full 2-ary tree with the provided height.\n\t\tconst makeTreeWithHeight = (height: number): PlaceholderTree => {\n\t\t\tif (height === 0) {\n\t\t\t\treturn makeLeaf();\n\t\t\t}\n\n\t\t\treturn {\n\t\t\t\tidentifier: context.generateNodeId(),\n\t\t\t\tdefinition: uuidv4() as Definition,\n\t\t\t\ttraits: {\n\t\t\t\t\t[uuidv4() as TraitLabel]: [makeTreeWithHeight(height - 1)],\n\t\t\t\t\t[uuidv4() as TraitLabel]: [makeTreeWithHeight(height - 1)],\n\t\t\t\t},\n\t\t\t};\n\t\t};\n\n\t\ttestCompression(makeTreeWithHeight(3), scopeIdNormalizer(context));\n\t});\n\n\tit('elides IDs that span multiple children or cousins', () => {\n\t\tconst reservedIdCount = 4;\n\t\tconst idCompressor = new IdCompressor(createSessionId(), reservedIdCount);\n\t\tconst context = makeNodeIdContext(idCompressor);\n\t\t// Order of IDs: [-1, -2, -3, -4, 0, 1, 2, -5, 3, -6, -6]\n\t\t// After elision: [-1, _, _, _, 0, _, _, -5, 3, -6, -6]\n\t\tconst localIds = [...Array(6).keys()].map((_) => context.generateNodeId());\n\t\tlocalIds.forEach((id) => assert(isLocalId(id)));\n\t\tconst finalIds = [...Array(reservedIdCount).keys()].map((_, i) => idCompressor.getReservedId(i) as NodeId);\n\t\tfinalIds.forEach((id) => assert(isFinalId(id)));\n\n\t\tfunction node(\n\t\t\tidentifier: NodeId,\n\t\t\ttraits?: TraitMap<TreeNode<PlaceholderTree, NodeId>>\n\t\t): TreeNode<PlaceholderTree, NodeId> {\n\t\t\treturn {\n\t\t\t\tidentifier,\n\t\t\t\tdefinition: 'def' as Definition,\n\t\t\t\ttraits: traits ?? {},\n\t\t\t};\n\t\t}\n\n\t\tconst tree: PlaceholderTree = node(localIds[0], {\n\t\t\tzebra: [node(localIds[5]), node(localIds[5])],\n\t\t\tmaganio: [\n\t\t\t\tnode(localIds[3]),\n\t\t\t\tnode(finalIds[0], {\n\t\t\t\t\tpardesio: [node(finalIds[2]), node(localIds[4]), node(finalIds[3])],\n\t\t\t\t\thortonio: [node(finalIds[1])],\n\t\t\t\t}),\n\t\t\t],\n\t\t\taardvark: [\n\t\t\t\tnode(localIds[1], {\n\t\t\t\t\tbasketball: [node(localIds[2])],\n\t\t\t\t}),\n\t\t\t],\n\t\t});\n\n\t\tconst nodeDef = internedId(0);\n\n\t\tfunction id(id: NodeId): OpSpaceNodeId {\n\t\t\treturn context.normalizeToOpSpace(id);\n\t\t}\n\n\t\ttestCompression<never>(tree, scopeIdNormalizer(context), [\n\t\t\tnodeDef,\n\t\t\tid(tree.identifier),\n\t\t\t[\n\t\t\t\tinternedId(1), // aardvark\n\t\t\t\t[[nodeDef, [internedId(4), [[nodeDef]]]]],\n\t\t\t\tinternedId(2), // maganio\n\t\t\t\t[\n\t\t\t\t\t[nodeDef],\n\t\t\t\t\t[\n\t\t\t\t\t\tnodeDef,\n\t\t\t\t\t\tid(finalIds[0]),\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\tinternedId(5), // hortonio\n\t\t\t\t\t\t\t[[nodeDef]],\n\t\t\t\t\t\t\tinternedId(6), // pardesio\n\t\t\t\t\t\t\t[[nodeDef], [nodeDef, id(localIds[4])], [nodeDef, id(finalIds[3])]],\n\t\t\t\t\t\t],\n\t\t\t\t\t],\n\t\t\t\t],\n\t\t\t\tinternedId(3), // zebra\n\t\t\t\t[\n\t\t\t\t\t[nodeDef, id(localIds[5])],\n\t\t\t\t\t[nodeDef, id(localIds[5])],\n\t\t\t\t],\n\t\t\t],\n\t\t]);\n\t});\n});\n"]}
1
+ {"version":3,"file":"TreeCompression.tests.js","sourceRoot":"","sources":["../../src/test/TreeCompression.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AACtC,OAAO,EAAE,EAAE,IAAI,MAAM,EAAE,MAAM,MAAM,CAAC;AACpC,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAC/C,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AAChG,OAAO,EAIN,oBAAoB,GAIpB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAkC,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAE1F,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAC;AAC7D,OAAO,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAC/D,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAEhF;;;;;;GAMG;AACH,SAAS,eAAe,CACvB,IAAmC,EACnC,YAA2D,EAC3D,UAAmE,EACnE,iBAAkH,EAClH,gBAAgG,CAC/F,QAAQ,EACR,IAAI,EACH,EAAE;IACH,QAAQ,CACP,IAAI,EACJ,CAAC,IAAI,EAAE,EAAE;QACR,QAAQ,CAAC,qBAAqB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAChD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;YACpD,QAAQ,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;SACtC;IACF,CAAC,EACD,oBAAoB,CACpB,CAAC;AACH,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,qBAAqB,EAAE,CAAC;IAC7C,aAAa,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAC9B,MAAM,cAAc,GAAG,IAAI,uBAAuB,EAAgB,CAAC;IACnE,MAAM,cAAc,GAAG,cAAc,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;IAC7E,IAAI,UAAU,KAAK,SAAS,EAAE;QAC7B,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;KACjD;IACD,MAAM,eAAe,GAAG,QAAQ,CAAC,eAAe,EAAE,CAAC;IACnD,MAAM,WAAW,GAAG,IAAI,qBAAqB,CAAC,eAAe,CAAC,CAAC;IAC/D,MAAM,gBAAgB,GAAG,cAAc,CAAC,UAAU,CAAC,cAAc,EAAE,WAAW,EAAE,YAAY,CAAC,CAAC;IAC9F,IAAI,iBAAiB,EAAE;QACtB,iBAAiB,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC;KAC1C;SAAM;QACN,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;KAC7C;AACF,CAAC;AAED;;;GAGG;AACH,SAAS,UAAU,CAAC,CAAS;IAC5B,OAAO,CAAqB,CAAC;AAC9B,CAAC;AAED,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAChC,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC3C,MAAM,aAAa,GAAG,EAAwB,CAAC;QAC/C,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,eAAe,CAAC,aAAa,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE,aAAa,CAAC,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;QACnE,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACpC,MAAM,kBAAkB,GAAG,EAAwB,CAAC;QACpD,MAAM,IAAI,GAAwC;YACjD,UAAU,EAAE,EAAE;YACd,UAAU,EAAE,MAAoB;YAChC,MAAM,EAAE;gBACP,SAAS,EAAE,CAAC,kBAAkB,CAAC;aAC/B;SACD,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE;YACjD,UAAU,CAAC,CAAC,CAAC;YACb,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC;YAC9B,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,kBAAkB,CAAC,CAAC;SACrC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;QAC9D,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACpC,MAAM,IAAI,GAAoB;YAC7B,UAAU,EAAE,EAAE;YACd,UAAU,EAAE,MAAoB;YAChC,MAAM,EAAE,EAAE;SACV,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACpG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACrC,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACpC,MAAM,IAAI,GAAoB;YAC7B,UAAU,EAAE,EAAE;YACd,UAAU,EAAE,MAAoB;YAChC,MAAM,EAAE,EAAE;YACV,OAAO,EAAE,CAAC;SACV,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC7C,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACpC,MAAM,UAAU,GAAG,MAAoB,CAAC;QACxC,MAAM,IAAI,GAAoB;YAC7B,UAAU,EAAE,EAAE;YACd,UAAU;YACV,MAAM,EAAE,EAAE;SACV,CAAC;QACF,eAAe,CACd,IAAI,EACJ,iBAAiB,CAAC,OAAO,CAAC,EAC1B,CAAC,UAAU,EAAE,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC,EAC5C,SAAS,EACT,GAAG,EAAE,GAAE,CAAC,CAAC,oBAAoB,CAC7B,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC7C,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACzC,MAAM,gBAAgB,GAAG,MAAoB,CAAC;QAC9C,MAAM,eAAe,GAAG,MAAoB,CAAC;QAC7C,MAAM,IAAI,GAAoB;YAC7B,UAAU,EAAE,QAAQ;YACpB,UAAU,EAAE,gBAAgB;YAC5B,MAAM,EAAE;gBACP,MAAM,EAAE;oBACP;wBACC,UAAU,EAAE,OAAO;wBACnB,UAAU,EAAE,eAAe;wBAC3B,MAAM,EAAE,EAAE;qBACV;iBACD;aACD;SACD,CAAC;QACF,eAAe,CACd,IAAI,EACJ,iBAAiB,CAAC,OAAO,CAAC,EAC1B,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,QAAQ,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACpF,SAAS,EACT,CAAC,QAAQ,EAAE,EAAE;YACZ,QAAQ,CAAC,qBAAqB,CAAC,gBAAgB,CAAC,CAAC;YACjD,QAAQ,CAAC,qBAAqB,CAAC,eAAe,CAAC,CAAC;QACjD,CAAC,CACD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACtD,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACzC,MAAM,gBAAgB,GAAG,MAAoB,CAAC;QAC9C,MAAM,eAAe,GAAG,MAAoB,CAAC;QAC7C,MAAM,IAAI,GAAoB;YAC7B,UAAU,EAAE,QAAQ;YACpB,UAAU,EAAE,gBAAgB;YAC5B,MAAM,EAAE;gBACP,MAAM,EAAE;oBACP;wBACC,UAAU,EAAE,OAAO;wBACnB,UAAU,EAAE,eAAe;wBAC3B,MAAM,EAAE,EAAE;qBACV;iBACD;aACD;SACD,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE;YACjD,UAAU,CAAC,CAAC,CAAC;YACb,OAAO,CAAC,kBAAkB,CAAC,QAAQ,CAAC;YACpC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAClC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACnD,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACzC,MAAM,gBAAgB,GAAG,MAAoB,CAAC;QAC9C,MAAM,eAAe,GAAG,MAAoB,CAAC;QAC7C,MAAM,OAAO,GAAG,eAAe,CAAC;QAChC,MAAM,IAAI,GAAoB;YAC7B,UAAU,EAAE,QAAQ;YACpB,UAAU,EAAE,gBAAgB;YAC5B,MAAM,EAAE;gBACP,MAAM,EAAE;oBACP;wBACC,UAAU,EAAE,OAAO;wBACnB,UAAU,EAAE,eAAe;wBAC3B,MAAM,EAAE,EAAE;qBACV;iBACD;aACD;YACD,OAAO;SACP,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE;YACjD,UAAU,CAAC,CAAC,CAAC;YACb,OAAO,CAAC,kBAAkB,CAAC,QAAQ,CAAC;YACpC,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3C,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC7C,MAAM,IAAI,GAAG,aAAa,EAAE,CAAC;QAC7B,eAAe,CACd,IAAI,EACJ,iBAAiB,CAAC,IAAI,CAAC,EACvB;YACC,UAAU,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,UAAU,CAAC;YACxC;gBACC,UAAU,CAAC,CAAC,CAAC;gBACb,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;gBAChE,UAAU,CAAC,CAAC,CAAC;gBACb,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,2CAA2C;aAC9D;SACD;QACD,mHAAmH;QACnH,0EAA0E;QAC1E,CAAC,IAAI,EAAE,kBAAkB,EAAE,EAAE;YAC5B,MAAM,CACL,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,EAC7E,wBAAwB,CACxB,CAAC;QACH,CAAC,CACD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACpD,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,GAAoB,EAAE,CAAC,CAAC;YACxC,UAAU,EAAE,OAAO,CAAC,cAAc,EAAE;YACpC,UAAU,EAAE,MAAM,EAAgB;YAClC,MAAM,EAAE,EAAE;SACV,CAAC,CAAC;QAEH,oDAAoD;QACpD,MAAM,kBAAkB,GAAG,CAAC,MAAc,EAAmB,EAAE;YAC9D,IAAI,MAAM,KAAK,CAAC,EAAE;gBACjB,OAAO,QAAQ,EAAE,CAAC;aAClB;YAED,OAAO;gBACN,UAAU,EAAE,OAAO,CAAC,cAAc,EAAE;gBACpC,UAAU,EAAE,MAAM,EAAgB;gBAClC,MAAM,EAAE;oBACP,CAAC,MAAM,EAAgB,CAAC,EAAE,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBAC1D,CAAC,MAAM,EAAgB,CAAC,EAAE,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;iBAC1D;aACD,CAAC;QACH,CAAC,CAAC;QAEF,eAAe,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC5D,MAAM,eAAe,GAAG,CAAC,CAAC;QAC1B,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,eAAe,EAAE,EAAE,eAAe,CAAC,CAAC;QAC1E,MAAM,OAAO,GAAG,iBAAiB,CAAC,YAAY,CAAC,CAAC;QAChD,0DAA0D;QAC1D,0DAA0D;QAC1D,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,cAAc,EAAE,CAAC,CAAC;QAC3E,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,eAAe,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC,CAAW,CAAC,CAAC;QAC3G,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAEhD,SAAS,IAAI,CACZ,UAAkB,EAClB,MAAoD;YAEpD,OAAO;gBACN,UAAU;gBACV,UAAU,EAAE,KAAmB;gBAC/B,MAAM,EAAE,MAAM,IAAI,EAAE;aACpB,CAAC;QACH,CAAC;QAED,MAAM,IAAI,GAAoB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;YAC/C,KAAK,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,OAAO,EAAE;gBACR,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;oBACjB,QAAQ,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;oBACnE,QAAQ,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC7B,CAAC;aACF;YACD,QAAQ,EAAE;gBACT,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;oBACjB,UAAU,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC/B,CAAC;aACF;SACD,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAE9B,SAAS,EAAE,CAAC,EAAU;YACrB,OAAO,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;QACvC,CAAC;QAED,eAAe,CAAQ,IAAI,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE;YACxD,OAAO;YACP,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC;YACnB;gBACC,UAAU,CAAC,CAAC,CAAC;gBACb,CAAC,CAAC,OAAO,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzC,UAAU,CAAC,CAAC,CAAC;gBACb;oBACC,CAAC,OAAO,CAAC;oBACT;wBACC,OAAO;wBACP,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;wBACf;4BACC,UAAU,CAAC,CAAC,CAAC;4BACb,CAAC,CAAC,OAAO,CAAC,CAAC;4BACX,UAAU,CAAC,CAAC,CAAC;4BACb,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;yBACnE;qBACD;iBACD;gBACD,UAAU,CAAC,CAAC,CAAC;gBACb;oBACC,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC1B,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC1B;aACD;SACD,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 { expect, assert } from 'chai';\nimport { v4 as uuidv4 } from 'uuid';\nimport { walkTree } from '../EditUtilities.js';\nimport { createSessionId, IdCompressor, isFinalId, isLocalId } from '../id-compressor/index.js';\nimport {\n\tDefinition,\n\tDetachedSequenceId,\n\tInternedStringId,\n\tisDetachedSequenceId,\n\tNodeId,\n\tOpSpaceNodeId,\n\tTraitLabel,\n} from '../Identifiers.js';\nimport { ContextualizedNodeIdNormalizer, scopeIdNormalizer } from '../NodeIdUtilities.js';\nimport { CompressedPlaceholderTree, PlaceholderTree, TraitMap, TreeNode } from '../persisted-types/index.js';\nimport { RevisionView } from '../RevisionView.js';\nimport { MutableStringInterner } from '../StringInterner.js';\nimport { InterningTreeCompressor } from '../TreeCompressor.js';\nimport { makeNodeIdContext, setUpTestTree } from './utilities/TestUtilities.js';\n\n/**\n * Verifies a tree can round-trip through compression/decompression. Optionally also asserts the compressed state\n * matches some expected state.\n *\n * By default, this function asserts the round-tripped tree is deeply equal to the `tree` parameter.\n * If that parameter is not normalized (ex: contains extra properties), a custom `roundTripAsserter` can be passed instead.\n */\nfunction testCompression<TPlaceholder extends DetachedSequenceId | never>(\n\ttree: PlaceholderTree<TPlaceholder>,\n\tidNormalizer: ContextualizedNodeIdNormalizer<OpSpaceNodeId>,\n\tcompressed?: CompressedPlaceholderTree<OpSpaceNodeId, TPlaceholder>,\n\troundTripAsserter?: (tree: PlaceholderTree<TPlaceholder>, roundTrippedTree: PlaceholderTree<TPlaceholder>) => void,\n\tinternStrings: (interner: MutableStringInterner, tree: PlaceholderTree<TPlaceholder>) => void = (\n\t\tinterner,\n\t\ttree\n\t) => {\n\t\twalkTree<Exclude<PlaceholderTree<DetachedSequenceId>, DetachedSequenceId>, DetachedSequenceId>(\n\t\t\ttree,\n\t\t\t(node) => {\n\t\t\t\tinterner.getOrCreateInternedId(node.definition);\n\t\t\t\tfor (const trait of Object.keys(node.traits).sort()) {\n\t\t\t\t\tinterner.getOrCreateInternedId(trait);\n\t\t\t\t}\n\t\t\t},\n\t\t\tisDetachedSequenceId\n\t\t);\n\t}\n): void {\n\tconst interner = new MutableStringInterner();\n\tinternStrings(interner, tree);\n\tconst treeCompressor = new InterningTreeCompressor<TPlaceholder>();\n\tconst compressedTree = treeCompressor.compress(tree, interner, idNormalizer);\n\tif (compressed !== undefined) {\n\t\texpect(compressedTree).to.deep.equal(compressed);\n\t}\n\tconst internedStrings = interner.getSerializable();\n\tconst newInterner = new MutableStringInterner(internedStrings);\n\tconst decompressedTree = treeCompressor.decompress(compressedTree, newInterner, idNormalizer);\n\tif (roundTripAsserter) {\n\t\troundTripAsserter(tree, decompressedTree);\n\t} else {\n\t\texpect(decompressedTree).to.deep.equal(tree);\n\t}\n}\n\n/**\n * Brands the passed in number as an `InternedStringId`.\n * Ergonomic helper for making expected compressed trees typecheck.\n */\nfunction internedId(n: number): InternedStringId {\n\treturn n as InternedStringId;\n}\n\ndescribe('TreeCompression', () => {\n\tit('noops on a placeholder root tree', () => {\n\t\tconst placeholderId = 42 as DetachedSequenceId;\n\t\tconst context = makeNodeIdContext();\n\t\ttestCompression(placeholderId, scopeIdNormalizer(context), placeholderId);\n\t});\n\n\tit('can compress trees containing nested DetachedSequenceIds', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst id = context.generateNodeId();\n\t\tconst detachedSequenceId = 43 as DetachedSequenceId;\n\t\tconst tree: PlaceholderTree<DetachedSequenceId> = {\n\t\t\tidentifier: id,\n\t\t\tdefinition: 'node' as Definition,\n\t\t\ttraits: {\n\t\t\t\tsomeTrait: [detachedSequenceId],\n\t\t\t},\n\t\t};\n\t\ttestCompression(tree, scopeIdNormalizer(context), [\n\t\t\tinternedId(0),\n\t\t\tcontext.normalizeToOpSpace(id),\n\t\t\t[internedId(1), [detachedSequenceId]],\n\t\t]);\n\t});\n\n\tit('omits traits and payload fields on empty leaf nodes', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst id = context.generateNodeId();\n\t\tconst tree: PlaceholderTree = {\n\t\t\tidentifier: id,\n\t\t\tdefinition: 'node' as Definition,\n\t\t\ttraits: {},\n\t\t};\n\t\ttestCompression(tree, scopeIdNormalizer(context), [internedId(0), context.normalizeToOpSpace(id)]);\n\t});\n\n\tit('handles payloads on leaves', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst id = context.generateNodeId();\n\t\tconst tree: PlaceholderTree = {\n\t\t\tidentifier: id,\n\t\t\tdefinition: 'node' as Definition,\n\t\t\ttraits: {},\n\t\t\tpayload: 5,\n\t\t};\n\t\ttestCompression(tree, scopeIdNormalizer(context), [internedId(0), context.normalizeToOpSpace(id), [5]]);\n\t});\n\n\tit('handles non-interned `Definition`s', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst id = context.generateNodeId();\n\t\tconst definition = 'node' as Definition;\n\t\tconst tree: PlaceholderTree = {\n\t\t\tidentifier: id,\n\t\t\tdefinition,\n\t\t\ttraits: {},\n\t\t};\n\t\ttestCompression(\n\t\t\ttree,\n\t\t\tscopeIdNormalizer(context),\n\t\t\t[definition, context.normalizeToOpSpace(id)],\n\t\t\tundefined,\n\t\t\t() => {} /* intern nothing */\n\t\t);\n\t});\n\n\tit('handles non-interned `TraitLabel`s', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst parentId = context.generateNodeId();\n\t\tconst childId = context.generateNodeId();\n\t\tconst parentDefinition = 'def1' as Definition;\n\t\tconst childDefinition = 'def2' as Definition;\n\t\tconst tree: PlaceholderTree = {\n\t\t\tidentifier: parentId,\n\t\t\tdefinition: parentDefinition,\n\t\t\ttraits: {\n\t\t\t\ttrait1: [\n\t\t\t\t\t{\n\t\t\t\t\t\tidentifier: childId,\n\t\t\t\t\t\tdefinition: childDefinition,\n\t\t\t\t\t\ttraits: {},\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t},\n\t\t};\n\t\ttestCompression(\n\t\t\ttree,\n\t\t\tscopeIdNormalizer(context),\n\t\t\t[internedId(0), context.normalizeToOpSpace(parentId), ['trait1', [[internedId(1)]]]],\n\t\t\tundefined,\n\t\t\t(interner) => {\n\t\t\t\tinterner.getOrCreateInternedId(parentDefinition);\n\t\t\t\tinterner.getOrCreateInternedId(childDefinition);\n\t\t\t}\n\t\t);\n\t});\n\n\tit('handles intermediate nodes without payloads', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst parentId = context.generateNodeId();\n\t\tconst childId = context.generateNodeId();\n\t\tconst parentDefinition = 'def1' as Definition;\n\t\tconst childDefinition = 'def2' as Definition;\n\t\tconst tree: PlaceholderTree = {\n\t\t\tidentifier: parentId,\n\t\t\tdefinition: parentDefinition,\n\t\t\ttraits: {\n\t\t\t\ttrait1: [\n\t\t\t\t\t{\n\t\t\t\t\t\tidentifier: childId,\n\t\t\t\t\t\tdefinition: childDefinition,\n\t\t\t\t\t\ttraits: {},\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t},\n\t\t};\n\t\ttestCompression(tree, scopeIdNormalizer(context), [\n\t\t\tinternedId(0),\n\t\t\tcontext.normalizeToOpSpace(parentId),\n\t\t\t[internedId(1), [[internedId(2)]]],\n\t\t]);\n\t});\n\n\tit('handles intermediate nodes with payloads', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst parentId = context.generateNodeId();\n\t\tconst childId = context.generateNodeId();\n\t\tconst parentDefinition = 'def1' as Definition;\n\t\tconst childDefinition = 'def2' as Definition;\n\t\tconst payload = 'parentPayload';\n\t\tconst tree: PlaceholderTree = {\n\t\t\tidentifier: parentId,\n\t\t\tdefinition: parentDefinition,\n\t\t\ttraits: {\n\t\t\t\ttrait1: [\n\t\t\t\t\t{\n\t\t\t\t\t\tidentifier: childId,\n\t\t\t\t\t\tdefinition: childDefinition,\n\t\t\t\t\t\ttraits: {},\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t},\n\t\t\tpayload,\n\t\t};\n\t\ttestCompression(tree, scopeIdNormalizer(context), [\n\t\t\tinternedId(0),\n\t\t\tcontext.normalizeToOpSpace(parentId),\n\t\t\t[payload, internedId(1), [[internedId(2)]]],\n\t\t]);\n\t});\n\n\tit('handles traits with multiple nodes', () => {\n\t\tconst tree = setUpTestTree();\n\t\ttestCompression<never>(\n\t\t\ttree,\n\t\t\tscopeIdNormalizer(tree),\n\t\t\t[\n\t\t\t\tinternedId(0),\n\t\t\t\ttree.normalizeToOpSpace(tree.identifier),\n\t\t\t\t[\n\t\t\t\t\tinternedId(1),\n\t\t\t\t\t[[internedId(0), tree.normalizeToOpSpace(tree.left.identifier)]],\n\t\t\t\t\tinternedId(2),\n\t\t\t\t\t[[internedId(0)]], // Right ID should be elided, but no others\n\t\t\t\t],\n\t\t\t],\n\t\t\t// SimpleTestTree contains extra properties, so deep compare as objects is insufficient. The revision view strategy\n\t\t\t// only works for valid standalone trees (i.e. ones without placeholders).\n\t\t\t(tree, treeAfterRoundTrip) => {\n\t\t\t\texpect(\n\t\t\t\t\tRevisionView.fromTree(tree).equals(RevisionView.fromTree(treeAfterRoundTrip)),\n\t\t\t\t\t'Unequal revision views'\n\t\t\t\t);\n\t\t\t}\n\t\t);\n\t});\n\n\tit('can round trip a tree with several levels', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst makeLeaf = (): PlaceholderTree => ({\n\t\t\tidentifier: context.generateNodeId(),\n\t\t\tdefinition: uuidv4() as Definition,\n\t\t\ttraits: {},\n\t\t});\n\n\t\t// Makes a full 2-ary tree with the provided height.\n\t\tconst makeTreeWithHeight = (height: number): PlaceholderTree => {\n\t\t\tif (height === 0) {\n\t\t\t\treturn makeLeaf();\n\t\t\t}\n\n\t\t\treturn {\n\t\t\t\tidentifier: context.generateNodeId(),\n\t\t\t\tdefinition: uuidv4() as Definition,\n\t\t\t\ttraits: {\n\t\t\t\t\t[uuidv4() as TraitLabel]: [makeTreeWithHeight(height - 1)],\n\t\t\t\t\t[uuidv4() as TraitLabel]: [makeTreeWithHeight(height - 1)],\n\t\t\t\t},\n\t\t\t};\n\t\t};\n\n\t\ttestCompression(makeTreeWithHeight(3), scopeIdNormalizer(context));\n\t});\n\n\tit('elides IDs that span multiple children or cousins', () => {\n\t\tconst reservedIdCount = 4;\n\t\tconst idCompressor = new IdCompressor(createSessionId(), reservedIdCount);\n\t\tconst context = makeNodeIdContext(idCompressor);\n\t\t// Order of IDs: [-1, -2, -3, -4, 0, 1, 2, -5, 3, -6, -6]\n\t\t// After elision: [-1, _, _, _, 0, _, _, -5, 3, -6, -6]\n\t\tconst localIds = [...Array(6).keys()].map((_) => context.generateNodeId());\n\t\tlocalIds.forEach((id) => assert(isLocalId(id)));\n\t\tconst finalIds = [...Array(reservedIdCount).keys()].map((_, i) => idCompressor.getReservedId(i) as NodeId);\n\t\tfinalIds.forEach((id) => assert(isFinalId(id)));\n\n\t\tfunction node(\n\t\t\tidentifier: NodeId,\n\t\t\ttraits?: TraitMap<TreeNode<PlaceholderTree, NodeId>>\n\t\t): TreeNode<PlaceholderTree, NodeId> {\n\t\t\treturn {\n\t\t\t\tidentifier,\n\t\t\t\tdefinition: 'def' as Definition,\n\t\t\t\ttraits: traits ?? {},\n\t\t\t};\n\t\t}\n\n\t\tconst tree: PlaceholderTree = node(localIds[0], {\n\t\t\tzebra: [node(localIds[5]), node(localIds[5])],\n\t\t\tmaganio: [\n\t\t\t\tnode(localIds[3]),\n\t\t\t\tnode(finalIds[0], {\n\t\t\t\t\tpardesio: [node(finalIds[2]), node(localIds[4]), node(finalIds[3])],\n\t\t\t\t\thortonio: [node(finalIds[1])],\n\t\t\t\t}),\n\t\t\t],\n\t\t\taardvark: [\n\t\t\t\tnode(localIds[1], {\n\t\t\t\t\tbasketball: [node(localIds[2])],\n\t\t\t\t}),\n\t\t\t],\n\t\t});\n\n\t\tconst nodeDef = internedId(0);\n\n\t\tfunction id(id: NodeId): OpSpaceNodeId {\n\t\t\treturn context.normalizeToOpSpace(id);\n\t\t}\n\n\t\ttestCompression<never>(tree, scopeIdNormalizer(context), [\n\t\t\tnodeDef,\n\t\t\tid(tree.identifier),\n\t\t\t[\n\t\t\t\tinternedId(1), // aardvark\n\t\t\t\t[[nodeDef, [internedId(4), [[nodeDef]]]]],\n\t\t\t\tinternedId(2), // maganio\n\t\t\t\t[\n\t\t\t\t\t[nodeDef],\n\t\t\t\t\t[\n\t\t\t\t\t\tnodeDef,\n\t\t\t\t\t\tid(finalIds[0]),\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\tinternedId(5), // hortonio\n\t\t\t\t\t\t\t[[nodeDef]],\n\t\t\t\t\t\t\tinternedId(6), // pardesio\n\t\t\t\t\t\t\t[[nodeDef], [nodeDef, id(localIds[4])], [nodeDef, id(finalIds[3])]],\n\t\t\t\t\t\t],\n\t\t\t\t\t],\n\t\t\t\t],\n\t\t\t\tinternedId(3), // zebra\n\t\t\t\t[\n\t\t\t\t\t[nodeDef, id(localIds[5])],\n\t\t\t\t\t[nodeDef, id(localIds[5])],\n\t\t\t\t],\n\t\t\t],\n\t\t]);\n\t});\n});\n"]}
package/lib/test/TreeView.tests.js CHANGED
@@ -5,9 +5,9 @@
5
5
  import { strict as assert } from 'assert';
6
6
  import { expect } from 'chai';
7
7
  import { validateAssertionError } from '@fluidframework/test-runtime-utils';
8
- import { RevisionView } from '../RevisionView';
9
- import { refreshTestTree } from './utilities/TestUtilities';
10
- import { expectDefined } from './utilities/TestCommon';
8
+ import { RevisionView } from '../RevisionView.js';
9
+ import { refreshTestTree } from './utilities/TestUtilities.js';
10
+ import { expectDefined } from './utilities/TestCommon.js';
11
11
  describe('TreeView', () => {
12
12
  const testTree = refreshTestTree();
13
13
  describe('can compute deltas', () => {
package/lib/test/TreeView.tests.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"TreeView.tests.js","sourceRoot":"","sources":["../../src/test/TreeView.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,sBAAsB,EAAE,MAAM,oCAAoC,CAAC;AAE5E,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,OAAO,EAAE,eAAe,EAAE,MAAM,2BAA2B,CAAC;AAE5D,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAEvD,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;IACzB,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAC;IAEnC,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QACnC,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACnC,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBACpC,OAAO,EAAE,EAAE;gBACX,KAAK,EAAE,EAAE;gBACT,OAAO,EAAE,EAAE;aACX,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAW,QAAQ,CAAC,CAAC;YACxD,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAW,QAAQ,CAAC,CAAC;YACxD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBACtC,OAAO,EAAE,EAAE;gBACX,KAAK,EAAE,EAAE;gBACT,OAAO,EAAE,EAAE;aACX,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;YACnF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;YACnF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,EACxB,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,8DAA8D,CAAC,CACvG,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,MAAM,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YAEzC,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;YAC5D,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;YAE5D,MAAM,QAAQ,GAAG;gBAChB,UAAU,EAAE,QAAQ,CAAC,cAAc,EAAE;gBACrC,UAAU,EAAE,MAAoB;gBAChC,MAAM,EAAE,EAAE,QAAQ,EAAE,CAAC,KAAK,CAAC,EAAE;aAC7B,CAAC;YACF,MAAM,QAAQ,GAAG;gBAChB,UAAU,EAAE,QAAQ,CAAC,cAAc,EAAE;gBACrC,UAAU,EAAE,MAAoB;gBAChC,MAAM,EAAE,EAAE,QAAQ,EAAE,CAAC,KAAK,CAAC,EAAE;aAC7B,CAAC;YAEF,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,MAAM;gBAClB,UAAU,EAAE,MAAoB;gBAChC,MAAM,EAAE;oBACP,QAAQ,EAAE,CAAC,QAAQ,CAAC;iBACpB;aACD,CAAC;YACF,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,MAAM;gBAClB,UAAU,EAAE,MAAoB;gBAChC,MAAM,EAAE;oBACP,QAAQ,EAAE,CAAC,QAAQ,CAAC;iBACpB;aACD,CAAC;YAEF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YACpD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACjD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YAClD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,MAAM,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YACzC,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,MAAM;gBAClB,UAAU,EAAE,MAAoB;gBAChC,OAAO,EAAE,OAAO;gBAChB,MAAM,EAAE,EAAE;aACV,CAAC;YACF,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,MAAM;gBAClB,UAAU,EAAE,MAAoB;gBAChC,OAAO,EAAE,OAAO;gBAChB,MAAM,EAAE,EAAE;aACV,CAAC;YAEF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACtC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;YAC1B,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC5B,MAAM,YAAY,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;YACnE,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,MAAM,EAAE,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,YAAY,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE;aACnE,CAAC;YACF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACtC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;YACzB,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC5B,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,MAAM,EAAE,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE;aACxC,CAAC;YACF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YAC9D,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;YACvB,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC5B,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,MAAM,EAAE,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE;aAChF,CAAC;YACF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACtC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC3C,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;YACxB,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC9D,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC7B,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAChD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;gBACtE,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;aACzD;SACD;IACF,CAAC,CAAC,CAAC;IAEH,+CAA+C;IAC/C,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAChD,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;QACvF,MAAM,MAAM,GAAG,aAA2B,CAAC;QAC3C,MAAM,MAAM,GAAG,aAA2B,CAAC;QAC3C,MAAM,EAAE,UAAU,EAAE,GAAG,QAAQ,CAAC;QAChC,MAAM,KAAK,GAAe;YACzB,UAAU,EAAE,GAAG;YACf,UAAU;YACV,MAAM,EAAE;gBACP,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;gBACvD,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;aACvD;SACD,CAAC;QACF,8GAA8G;QAC9G,MAAM,KAAK,GAAe;YACzB,UAAU,EAAE,GAAG;YACf,UAAU;YACV,MAAM,EAAE;gBACP,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;gBACvD,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;aACvD;SACD,CAAC;QACF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC3C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACxF,oDAAoD;QACpD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACzF,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 { validateAssertionError } from '@fluidframework/test-runtime-utils';\nimport { Definition, TraitLabel } from '../Identifiers';\nimport { RevisionView } from '../RevisionView';\nimport { ChangeNode } from '../persisted-types';\nimport { refreshTestTree } from './utilities/TestUtilities';\nimport { TestNode } from './utilities/TestNode';\nimport { expectDefined } from './utilities/TestCommon';\n\ndescribe('TreeView', () => {\n\tconst testTree = refreshTestTree();\n\n\tdescribe('can compute deltas', () => {\n\t\tit('that are the same object', () => {\n\t\t\tconst view = testTree.view;\n\t\t\texpect(view.delta(view)).deep.equals({\n\t\t\t\tchanged: [],\n\t\t\t\tadded: [],\n\t\t\t\tremoved: [],\n\t\t\t});\n\t\t});\n\n\t\tit('that have the same tree', () => {\n\t\t\tconst viewA = RevisionView.fromTree<TestNode>(testTree);\n\t\t\tconst viewB = RevisionView.fromTree<TestNode>(testTree);\n\t\t\texpect(viewA.delta(viewB)).deep.equals({\n\t\t\t\tchanged: [],\n\t\t\t\tadded: [],\n\t\t\t\tremoved: [],\n\t\t\t});\n\t\t});\n\n\t\tit('with different root ids', () => {\n\t\t\tconst viewA = RevisionView.fromTree(testTree.buildLeaf(testTree.generateNodeId()));\n\t\t\tconst viewB = RevisionView.fromTree(testTree.buildLeaf(testTree.generateNodeId()));\n\t\t\tassert.throws(\n\t\t\t\t() => viewA.delta(viewB),\n\t\t\t\t(e: Error) => validateAssertionError(e, 'Delta can only be calculated between views that share a root')\n\t\t\t);\n\t\t});\n\n\t\tit('with different subtrees', () => {\n\t\t\tconst rootId = testTree.generateNodeId();\n\n\t\t\tconst leafA = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\tconst leafB = testTree.buildLeaf(testTree.generateNodeId());\n\n\t\t\tconst subtreeA = {\n\t\t\t\tidentifier: testTree.generateNodeId(),\n\t\t\t\tdefinition: 'node' as Definition,\n\t\t\t\ttraits: { children: [leafA] },\n\t\t\t};\n\t\t\tconst subtreeB = {\n\t\t\t\tidentifier: testTree.generateNodeId(),\n\t\t\t\tdefinition: 'node' as Definition,\n\t\t\t\ttraits: { children: [leafB] },\n\t\t\t};\n\n\t\t\tconst rootA: ChangeNode = {\n\t\t\t\tidentifier: rootId,\n\t\t\t\tdefinition: 'node' as Definition,\n\t\t\t\ttraits: {\n\t\t\t\t\tchildren: [subtreeA],\n\t\t\t\t},\n\t\t\t};\n\t\t\tconst rootB: ChangeNode = {\n\t\t\t\tidentifier: rootId,\n\t\t\t\tdefinition: 'node' as Definition,\n\t\t\t\ttraits: {\n\t\t\t\t\tchildren: [subtreeB],\n\t\t\t\t},\n\t\t\t};\n\n\t\t\tconst viewA = RevisionView.fromTree(rootA);\n\t\t\tconst viewB = RevisionView.fromTree(rootB);\n\t\t\tconst delta = viewA.delta(viewB);\n\t\t\texpect(delta.changed).deep.equals([rootId]);\n\t\t\texpect(delta.removed.length).equals(2);\n\t\t\texpect(delta.added.length).equals(2);\n\t\t\texpect(delta.removed).contains(subtreeA.identifier);\n\t\t\texpect(delta.removed).contains(leafA.identifier);\n\t\t\texpect(delta.added).contains(subtreeB.identifier);\n\t\t\texpect(delta.added).contains(leafB.identifier);\n\t\t});\n\n\t\tit('with different payloads', () => {\n\t\t\tconst rootId = testTree.generateNodeId();\n\t\t\tconst nodeA: ChangeNode = {\n\t\t\t\tidentifier: rootId,\n\t\t\t\tdefinition: 'node' as Definition,\n\t\t\t\tpayload: 'test1',\n\t\t\t\ttraits: {},\n\t\t\t};\n\t\t\tconst nodeB: ChangeNode = {\n\t\t\t\tidentifier: rootId,\n\t\t\t\tdefinition: 'node' as Definition,\n\t\t\t\tpayload: 'test2',\n\t\t\t\ttraits: {},\n\t\t\t};\n\n\t\t\tconst viewA = RevisionView.fromTree(nodeA);\n\t\t\tconst viewB = RevisionView.fromTree(nodeB);\n\t\t\tconst delta = viewA.delta(viewB);\n\t\t\texpect(delta.changed).deep.equals([rootId]);\n\t\t\texpect(delta.removed).deep.equals([]);\n\t\t\texpect(delta.added).deep.equals([]);\n\t\t});\n\n\t\tit('after an insert', () => {\n\t\t\tconst viewA = testTree.view;\n\t\t\tconst insertedNode = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\tconst treeB: ChangeNode = {\n\t\t\t\tidentifier: testTree.identifier,\n\t\t\t\tdefinition: testTree.definition,\n\t\t\t\ttraits: { ...testTree.traits, left: [insertedNode, testTree.left] },\n\t\t\t};\n\t\t\tconst viewB = RevisionView.fromTree(treeB);\n\t\t\tconst delta = viewA.delta(viewB);\n\t\t\texpect(delta.changed).deep.equals([testTree.identifier]);\n\t\t\texpect(delta.removed).deep.equals([]);\n\t\t\texpect(delta.added).deep.equals([insertedNode.identifier]);\n\t\t});\n\n\t\tit('after a delete', () => {\n\t\t\tconst viewA = testTree.view;\n\t\t\tconst treeB: ChangeNode = {\n\t\t\t\tidentifier: testTree.identifier,\n\t\t\t\tdefinition: testTree.definition,\n\t\t\t\ttraits: { ...testTree.traits, left: [] },\n\t\t\t};\n\t\t\tconst viewB = RevisionView.fromTree(treeB);\n\t\t\tconst delta = viewA.delta(viewB);\n\t\t\texpect(delta.changed).deep.equals([testTree.identifier]);\n\t\t\texpect(delta.removed).deep.equals([testTree.left.identifier]);\n\t\t\texpect(delta.added).deep.equals([]);\n\t\t});\n\n\t\tit('after a move', () => {\n\t\t\tconst viewA = testTree.view;\n\t\t\tconst treeB: ChangeNode = {\n\t\t\t\tidentifier: testTree.identifier,\n\t\t\t\tdefinition: testTree.definition,\n\t\t\t\ttraits: { ...testTree.traits, left: [], right: [testTree.right, testTree.left] },\n\t\t\t};\n\t\t\tconst viewB = RevisionView.fromTree(treeB);\n\t\t\tconst delta = viewA.delta(viewB);\n\t\t\texpect(delta.changed).deep.equals([testTree.identifier]);\n\t\t\texpect(delta.removed).deep.equals([]);\n\t\t\texpect(delta.added).deep.equals([]);\n\t\t});\n\t});\n\n\tit('correctly returns node parentage', () => {\n\t\tconst view = testTree.view;\n\t\tfor (const node of view) {\n\t\t\tconst parentNode = view.tryGetParentViewNode(node.identifier);\n\t\t\tif (parentNode !== undefined) {\n\t\t\t\tconst parentage = expectDefined(node.parentage);\n\t\t\t\texpect(parentage.label).to.equal(view.getTraitLabel(node.identifier));\n\t\t\t\texpect(parentage.parent).to.equal(parentNode.identifier);\n\t\t\t}\n\t\t}\n\t});\n\n\t// Regression test for the issue fixed in #9824\n\tit('can be iterated in a consistent order', () => {\n\t\tconst [id1, id2, id3] = Array.from({ length: 3 }).map(() => testTree.generateNodeId());\n\t\tconst label1 = 'traitLabelA' as TraitLabel;\n\t\tconst label2 = 'traitLabelB' as TraitLabel;\n\t\tconst { definition } = testTree;\n\t\tconst tree1: ChangeNode = {\n\t\t\tidentifier: id1,\n\t\t\tdefinition,\n\t\t\ttraits: {\n\t\t\t\t[label1]: [{ identifier: id2, definition, traits: {} }],\n\t\t\t\t[label2]: [{ identifier: id3, definition, traits: {} }],\n\t\t\t},\n\t\t};\n\t\t// Like tree1, but defined with the labels in the opposite order and with different node ids under each trait.\n\t\tconst tree2: ChangeNode = {\n\t\t\tidentifier: id1,\n\t\t\tdefinition,\n\t\t\ttraits: {\n\t\t\t\t[label2]: [{ identifier: id2, definition, traits: {} }],\n\t\t\t\t[label1]: [{ identifier: id3, definition, traits: {} }],\n\t\t\t},\n\t\t};\n\t\tconst view1 = RevisionView.fromTree(tree1);\n\t\tconst view2 = RevisionView.fromTree(tree2);\n\t\texpect(Array.from(view1).map((node) => node.identifier)).to.deep.equal([id1, id2, id3]);\n\t\t// Child iteration should be sorted on trait labels.\n\t\texpect(Array.from(view2).map((node) => node.identifier)).to.deep.equal([id1, id3, id2]);\n\t});\n});\n"]}
1
+ {"version":3,"file":"TreeView.tests.js","sourceRoot":"","sources":["../../src/test/TreeView.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,sBAAsB,EAAE,MAAM,oCAAoC,CAAC;AAE5E,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAElD,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAE/D,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAE1D,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;IACzB,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAC;IAEnC,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QACnC,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACnC,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBACpC,OAAO,EAAE,EAAE;gBACX,KAAK,EAAE,EAAE;gBACT,OAAO,EAAE,EAAE;aACX,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAW,QAAQ,CAAC,CAAC;YACxD,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAW,QAAQ,CAAC,CAAC;YACxD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBACtC,OAAO,EAAE,EAAE;gBACX,KAAK,EAAE,EAAE;gBACT,OAAO,EAAE,EAAE;aACX,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;YACnF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;YACnF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,EACxB,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,8DAA8D,CAAC,CACvG,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,MAAM,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YAEzC,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;YAC5D,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;YAE5D,MAAM,QAAQ,GAAG;gBAChB,UAAU,EAAE,QAAQ,CAAC,cAAc,EAAE;gBACrC,UAAU,EAAE,MAAoB;gBAChC,MAAM,EAAE,EAAE,QAAQ,EAAE,CAAC,KAAK,CAAC,EAAE;aAC7B,CAAC;YACF,MAAM,QAAQ,GAAG;gBAChB,UAAU,EAAE,QAAQ,CAAC,cAAc,EAAE;gBACrC,UAAU,EAAE,MAAoB;gBAChC,MAAM,EAAE,EAAE,QAAQ,EAAE,CAAC,KAAK,CAAC,EAAE;aAC7B,CAAC;YAEF,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,MAAM;gBAClB,UAAU,EAAE,MAAoB;gBAChC,MAAM,EAAE;oBACP,QAAQ,EAAE,CAAC,QAAQ,CAAC;iBACpB;aACD,CAAC;YACF,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,MAAM;gBAClB,UAAU,EAAE,MAAoB;gBAChC,MAAM,EAAE;oBACP,QAAQ,EAAE,CAAC,QAAQ,CAAC;iBACpB;aACD,CAAC;YAEF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YACpD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACjD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YAClD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,MAAM,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YACzC,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,MAAM;gBAClB,UAAU,EAAE,MAAoB;gBAChC,OAAO,EAAE,OAAO;gBAChB,MAAM,EAAE,EAAE;aACV,CAAC;YACF,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,MAAM;gBAClB,UAAU,EAAE,MAAoB;gBAChC,OAAO,EAAE,OAAO;gBAChB,MAAM,EAAE,EAAE;aACV,CAAC;YAEF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACtC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;YAC1B,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC5B,MAAM,YAAY,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;YACnE,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,MAAM,EAAE,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,YAAY,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE;aACnE,CAAC;YACF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACtC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;YACzB,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC5B,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,MAAM,EAAE,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE;aACxC,CAAC;YACF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YAC9D,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;YACvB,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC5B,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,MAAM,EAAE,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE;aAChF,CAAC;YACF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACtC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC3C,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;YACxB,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC9D,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC7B,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAChD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;gBACtE,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;aACzD;SACD;IACF,CAAC,CAAC,CAAC;IAEH,+CAA+C;IAC/C,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAChD,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;QACvF,MAAM,MAAM,GAAG,aAA2B,CAAC;QAC3C,MAAM,MAAM,GAAG,aAA2B,CAAC;QAC3C,MAAM,EAAE,UAAU,EAAE,GAAG,QAAQ,CAAC;QAChC,MAAM,KAAK,GAAe;YACzB,UAAU,EAAE,GAAG;YACf,UAAU;YACV,MAAM,EAAE;gBACP,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;gBACvD,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;aACvD;SACD,CAAC;QACF,8GAA8G;QAC9G,MAAM,KAAK,GAAe;YACzB,UAAU,EAAE,GAAG;YACf,UAAU;YACV,MAAM,EAAE;gBACP,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;gBACvD,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;aACvD;SACD,CAAC;QACF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC3C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACxF,oDAAoD;QACpD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACzF,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 { validateAssertionError } from '@fluidframework/test-runtime-utils';\nimport { Definition, TraitLabel } from '../Identifiers.js';\nimport { RevisionView } from '../RevisionView.js';\nimport { ChangeNode } from '../persisted-types/index.js';\nimport { refreshTestTree } from './utilities/TestUtilities.js';\nimport { TestNode } from './utilities/TestNode.js';\nimport { expectDefined } from './utilities/TestCommon.js';\n\ndescribe('TreeView', () => {\n\tconst testTree = refreshTestTree();\n\n\tdescribe('can compute deltas', () => {\n\t\tit('that are the same object', () => {\n\t\t\tconst view = testTree.view;\n\t\t\texpect(view.delta(view)).deep.equals({\n\t\t\t\tchanged: [],\n\t\t\t\tadded: [],\n\t\t\t\tremoved: [],\n\t\t\t});\n\t\t});\n\n\t\tit('that have the same tree', () => {\n\t\t\tconst viewA = RevisionView.fromTree<TestNode>(testTree);\n\t\t\tconst viewB = RevisionView.fromTree<TestNode>(testTree);\n\t\t\texpect(viewA.delta(viewB)).deep.equals({\n\t\t\t\tchanged: [],\n\t\t\t\tadded: [],\n\t\t\t\tremoved: [],\n\t\t\t});\n\t\t});\n\n\t\tit('with different root ids', () => {\n\t\t\tconst viewA = RevisionView.fromTree(testTree.buildLeaf(testTree.generateNodeId()));\n\t\t\tconst viewB = RevisionView.fromTree(testTree.buildLeaf(testTree.generateNodeId()));\n\t\t\tassert.throws(\n\t\t\t\t() => viewA.delta(viewB),\n\t\t\t\t(e: Error) => validateAssertionError(e, 'Delta can only be calculated between views that share a root')\n\t\t\t);\n\t\t});\n\n\t\tit('with different subtrees', () => {\n\t\t\tconst rootId = testTree.generateNodeId();\n\n\t\t\tconst leafA = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\tconst leafB = testTree.buildLeaf(testTree.generateNodeId());\n\n\t\t\tconst subtreeA = {\n\t\t\t\tidentifier: testTree.generateNodeId(),\n\t\t\t\tdefinition: 'node' as Definition,\n\t\t\t\ttraits: { children: [leafA] },\n\t\t\t};\n\t\t\tconst subtreeB = {\n\t\t\t\tidentifier: testTree.generateNodeId(),\n\t\t\t\tdefinition: 'node' as Definition,\n\t\t\t\ttraits: { children: [leafB] },\n\t\t\t};\n\n\t\t\tconst rootA: ChangeNode = {\n\t\t\t\tidentifier: rootId,\n\t\t\t\tdefinition: 'node' as Definition,\n\t\t\t\ttraits: {\n\t\t\t\t\tchildren: [subtreeA],\n\t\t\t\t},\n\t\t\t};\n\t\t\tconst rootB: ChangeNode = {\n\t\t\t\tidentifier: rootId,\n\t\t\t\tdefinition: 'node' as Definition,\n\t\t\t\ttraits: {\n\t\t\t\t\tchildren: [subtreeB],\n\t\t\t\t},\n\t\t\t};\n\n\t\t\tconst viewA = RevisionView.fromTree(rootA);\n\t\t\tconst viewB = RevisionView.fromTree(rootB);\n\t\t\tconst delta = viewA.delta(viewB);\n\t\t\texpect(delta.changed).deep.equals([rootId]);\n\t\t\texpect(delta.removed.length).equals(2);\n\t\t\texpect(delta.added.length).equals(2);\n\t\t\texpect(delta.removed).contains(subtreeA.identifier);\n\t\t\texpect(delta.removed).contains(leafA.identifier);\n\t\t\texpect(delta.added).contains(subtreeB.identifier);\n\t\t\texpect(delta.added).contains(leafB.identifier);\n\t\t});\n\n\t\tit('with different payloads', () => {\n\t\t\tconst rootId = testTree.generateNodeId();\n\t\t\tconst nodeA: ChangeNode = {\n\t\t\t\tidentifier: rootId,\n\t\t\t\tdefinition: 'node' as Definition,\n\t\t\t\tpayload: 'test1',\n\t\t\t\ttraits: {},\n\t\t\t};\n\t\t\tconst nodeB: ChangeNode = {\n\t\t\t\tidentifier: rootId,\n\t\t\t\tdefinition: 'node' as Definition,\n\t\t\t\tpayload: 'test2',\n\t\t\t\ttraits: {},\n\t\t\t};\n\n\t\t\tconst viewA = RevisionView.fromTree(nodeA);\n\t\t\tconst viewB = RevisionView.fromTree(nodeB);\n\t\t\tconst delta = viewA.delta(viewB);\n\t\t\texpect(delta.changed).deep.equals([rootId]);\n\t\t\texpect(delta.removed).deep.equals([]);\n\t\t\texpect(delta.added).deep.equals([]);\n\t\t});\n\n\t\tit('after an insert', () => {\n\t\t\tconst viewA = testTree.view;\n\t\t\tconst insertedNode = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\tconst treeB: ChangeNode = {\n\t\t\t\tidentifier: testTree.identifier,\n\t\t\t\tdefinition: testTree.definition,\n\t\t\t\ttraits: { ...testTree.traits, left: [insertedNode, testTree.left] },\n\t\t\t};\n\t\t\tconst viewB = RevisionView.fromTree(treeB);\n\t\t\tconst delta = viewA.delta(viewB);\n\t\t\texpect(delta.changed).deep.equals([testTree.identifier]);\n\t\t\texpect(delta.removed).deep.equals([]);\n\t\t\texpect(delta.added).deep.equals([insertedNode.identifier]);\n\t\t});\n\n\t\tit('after a delete', () => {\n\t\t\tconst viewA = testTree.view;\n\t\t\tconst treeB: ChangeNode = {\n\t\t\t\tidentifier: testTree.identifier,\n\t\t\t\tdefinition: testTree.definition,\n\t\t\t\ttraits: { ...testTree.traits, left: [] },\n\t\t\t};\n\t\t\tconst viewB = RevisionView.fromTree(treeB);\n\t\t\tconst delta = viewA.delta(viewB);\n\t\t\texpect(delta.changed).deep.equals([testTree.identifier]);\n\t\t\texpect(delta.removed).deep.equals([testTree.left.identifier]);\n\t\t\texpect(delta.added).deep.equals([]);\n\t\t});\n\n\t\tit('after a move', () => {\n\t\t\tconst viewA = testTree.view;\n\t\t\tconst treeB: ChangeNode = {\n\t\t\t\tidentifier: testTree.identifier,\n\t\t\t\tdefinition: testTree.definition,\n\t\t\t\ttraits: { ...testTree.traits, left: [], right: [testTree.right, testTree.left] },\n\t\t\t};\n\t\t\tconst viewB = RevisionView.fromTree(treeB);\n\t\t\tconst delta = viewA.delta(viewB);\n\t\t\texpect(delta.changed).deep.equals([testTree.identifier]);\n\t\t\texpect(delta.removed).deep.equals([]);\n\t\t\texpect(delta.added).deep.equals([]);\n\t\t});\n\t});\n\n\tit('correctly returns node parentage', () => {\n\t\tconst view = testTree.view;\n\t\tfor (const node of view) {\n\t\t\tconst parentNode = view.tryGetParentViewNode(node.identifier);\n\t\t\tif (parentNode !== undefined) {\n\t\t\t\tconst parentage = expectDefined(node.parentage);\n\t\t\t\texpect(parentage.label).to.equal(view.getTraitLabel(node.identifier));\n\t\t\t\texpect(parentage.parent).to.equal(parentNode.identifier);\n\t\t\t}\n\t\t}\n\t});\n\n\t// Regression test for the issue fixed in #9824\n\tit('can be iterated in a consistent order', () => {\n\t\tconst [id1, id2, id3] = Array.from({ length: 3 }).map(() => testTree.generateNodeId());\n\t\tconst label1 = 'traitLabelA' as TraitLabel;\n\t\tconst label2 = 'traitLabelB' as TraitLabel;\n\t\tconst { definition } = testTree;\n\t\tconst tree1: ChangeNode = {\n\t\t\tidentifier: id1,\n\t\t\tdefinition,\n\t\t\ttraits: {\n\t\t\t\t[label1]: [{ identifier: id2, definition, traits: {} }],\n\t\t\t\t[label2]: [{ identifier: id3, definition, traits: {} }],\n\t\t\t},\n\t\t};\n\t\t// Like tree1, but defined with the labels in the opposite order and with different node ids under each trait.\n\t\tconst tree2: ChangeNode = {\n\t\t\tidentifier: id1,\n\t\t\tdefinition,\n\t\t\ttraits: {\n\t\t\t\t[label2]: [{ identifier: id2, definition, traits: {} }],\n\t\t\t\t[label1]: [{ identifier: id3, definition, traits: {} }],\n\t\t\t},\n\t\t};\n\t\tconst view1 = RevisionView.fromTree(tree1);\n\t\tconst view2 = RevisionView.fromTree(tree2);\n\t\texpect(Array.from(view1).map((node) => node.identifier)).to.deep.equal([id1, id2, id3]);\n\t\t// Child iteration should be sorted on trait labels.\n\t\texpect(Array.from(view2).map((node) => node.identifier)).to.deep.equal([id1, id3, id2]);\n\t});\n});\n"]}
package/lib/test/UndoRedoHandler.tests.js CHANGED
@@ -3,8 +3,8 @@
3
3
  * Licensed under the MIT License.
4
4
  */
5
5
  import { UndoRedoStackManager } from '@fluidframework/undo-redo';
6
- import { SharedTreeUndoRedoHandler } from '../UndoRedoHandler';
7
- import { runSharedTreeUndoRedoTestSuite } from './utilities/UndoRedoTests';
6
+ import { SharedTreeUndoRedoHandler } from '../UndoRedoHandler.js';
7
+ import { runSharedTreeUndoRedoTestSuite } from './utilities/UndoRedoTests.js';
8
8
  describe('SharedTreeUndoRedoHandler', () => {
9
9
  let undoRedoStack;
10
10
  let handler;
package/lib/test/UndoRedoHandler.tests.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"UndoRedoHandler.tests.js","sourceRoot":"","sources":["../../src/test/UndoRedoHandler.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AAGjE,OAAO,EAAE,yBAAyB,EAAE,MAAM,oBAAoB,CAAC;AAC/D,OAAO,EAAE,8BAA8B,EAAE,MAAM,2BAA2B,CAAC;AAE3E,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;IAC1C,IAAI,aAAmC,CAAC;IACxC,IAAI,OAAkC,CAAC;IAEvC,MAAM,eAAe,GAAG;QACvB,UAAU,EAAE,CAAC,KAAmB,EAAE,EAAE;YACnC,aAAa,GAAG,IAAI,oBAAoB,EAAE,CAAC;YAC3C,OAAO,GAAG,IAAI,yBAAyB,CAAC,aAAa,CAAC,CAAC;YAEvD,kCAAkC;YAClC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;QACnD,CAAC;QACD,IAAI,EAAE,CAAC,IAAgB,EAAE,MAAc,EAAE,EAAE;YAC1C,aAAa,CAAC,aAAa,EAAE,CAAC;YAE9B,6DAA6D;YAC7D,OAAO,sCAAgD,CAAC;QACzD,CAAC;QACD,IAAI,EAAE,CAAC,IAAgB,EAAE,MAAc,EAAE,EAAE;YAC1C,aAAa,CAAC,aAAa,EAAE,CAAC;YAE9B,6DAA6D;YAC7D,OAAO,sCAAgD,CAAC;QACzD,CAAC;QACD,SAAS,EAAE,GAAG,EAAE;YACf,aAAa,CAAC,qBAAqB,EAAE,CAAC;QACvC,CAAC;QACD,sEAAsE;QACtE,oBAAoB,EAAE,KAAK;KAC3B,CAAC;IAEF,8BAA8B,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,eAAe,EAAE,GAAG,eAAe,EAAE,CAAC,CAAC;IAChG,8BAA8B,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,mBAAmB,EAAE,GAAG,eAAe,EAAE,CAAC,CAAC;AACtG,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { UndoRedoStackManager } from '@fluidframework/undo-redo';\nimport { EditId } from '../Identifiers';\nimport { SharedTree } from '../SharedTree';\nimport { SharedTreeUndoRedoHandler } from '../UndoRedoHandler';\nimport { runSharedTreeUndoRedoTestSuite } from './utilities/UndoRedoTests';\n\ndescribe('SharedTreeUndoRedoHandler', () => {\n\tlet undoRedoStack: UndoRedoStackManager;\n\tlet handler: SharedTreeUndoRedoHandler;\n\n\tconst undoRedoOptions = {\n\t\tbeforeEach: (trees: SharedTree[]) => {\n\t\t\tundoRedoStack = new UndoRedoStackManager();\n\t\t\thandler = new SharedTreeUndoRedoHandler(undoRedoStack);\n\n\t\t\t// Attach each tree to the handler\n\t\t\ttrees.forEach((tree) => handler.attachTree(tree));\n\t\t},\n\t\tundo: (tree: SharedTree, editId: EditId) => {\n\t\t\tundoRedoStack.undoOperation();\n\n\t\t\t// Returns a dummy edit id in order to satisfy the interface.\n\t\t\treturn 'aa26ef18-76a9-4238-9c29-9b796d21ef5a' as EditId;\n\t\t},\n\t\tredo: (tree: SharedTree, editId: EditId) => {\n\t\t\tundoRedoStack.redoOperation();\n\n\t\t\t// Returns a dummy edit id in order to satisfy the interface.\n\t\t\treturn 'aa26ef18-76a9-4238-9c29-9b796d21ef5a' as EditId;\n\t\t},\n\t\tafterEdit: () => {\n\t\t\tundoRedoStack.closeCurrentOperation();\n\t\t},\n\t\t// The SharedTreeUndoRedoHandler does not support out of order revert.\n\t\ttestOutOfOrderRevert: false,\n\t};\n\n\trunSharedTreeUndoRedoTestSuite({ localMode: true, title: 'in local mode', ...undoRedoOptions });\n\trunSharedTreeUndoRedoTestSuite({ localMode: false, title: 'in connected mode', ...undoRedoOptions });\n});\n"]}
1
+ {"version":3,"file":"UndoRedoHandler.tests.js","sourceRoot":"","sources":["../../src/test/UndoRedoHandler.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AAGjE,OAAO,EAAE,yBAAyB,EAAE,MAAM,uBAAuB,CAAC;AAClE,OAAO,EAAE,8BAA8B,EAAE,MAAM,8BAA8B,CAAC;AAE9E,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;IAC1C,IAAI,aAAmC,CAAC;IACxC,IAAI,OAAkC,CAAC;IAEvC,MAAM,eAAe,GAAG;QACvB,UAAU,EAAE,CAAC,KAAmB,EAAE,EAAE;YACnC,aAAa,GAAG,IAAI,oBAAoB,EAAE,CAAC;YAC3C,OAAO,GAAG,IAAI,yBAAyB,CAAC,aAAa,CAAC,CAAC;YAEvD,kCAAkC;YAClC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;QACnD,CAAC;QACD,IAAI,EAAE,CAAC,IAAgB,EAAE,MAAc,EAAE,EAAE;YAC1C,aAAa,CAAC,aAAa,EAAE,CAAC;YAE9B,6DAA6D;YAC7D,OAAO,sCAAgD,CAAC;QACzD,CAAC;QACD,IAAI,EAAE,CAAC,IAAgB,EAAE,MAAc,EAAE,EAAE;YAC1C,aAAa,CAAC,aAAa,EAAE,CAAC;YAE9B,6DAA6D;YAC7D,OAAO,sCAAgD,CAAC;QACzD,CAAC;QACD,SAAS,EAAE,GAAG,EAAE;YACf,aAAa,CAAC,qBAAqB,EAAE,CAAC;QACvC,CAAC;QACD,sEAAsE;QACtE,oBAAoB,EAAE,KAAK;KAC3B,CAAC;IAEF,8BAA8B,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,eAAe,EAAE,GAAG,eAAe,EAAE,CAAC,CAAC;IAChG,8BAA8B,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,mBAAmB,EAAE,GAAG,eAAe,EAAE,CAAC,CAAC;AACtG,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { UndoRedoStackManager } from '@fluidframework/undo-redo';\nimport { EditId } from '../Identifiers.js';\nimport { SharedTree } from '../SharedTree.js';\nimport { SharedTreeUndoRedoHandler } from '../UndoRedoHandler.js';\nimport { runSharedTreeUndoRedoTestSuite } from './utilities/UndoRedoTests.js';\n\ndescribe('SharedTreeUndoRedoHandler', () => {\n\tlet undoRedoStack: UndoRedoStackManager;\n\tlet handler: SharedTreeUndoRedoHandler;\n\n\tconst undoRedoOptions = {\n\t\tbeforeEach: (trees: SharedTree[]) => {\n\t\t\tundoRedoStack = new UndoRedoStackManager();\n\t\t\thandler = new SharedTreeUndoRedoHandler(undoRedoStack);\n\n\t\t\t// Attach each tree to the handler\n\t\t\ttrees.forEach((tree) => handler.attachTree(tree));\n\t\t},\n\t\tundo: (tree: SharedTree, editId: EditId) => {\n\t\t\tundoRedoStack.undoOperation();\n\n\t\t\t// Returns a dummy edit id in order to satisfy the interface.\n\t\t\treturn 'aa26ef18-76a9-4238-9c29-9b796d21ef5a' as EditId;\n\t\t},\n\t\tredo: (tree: SharedTree, editId: EditId) => {\n\t\t\tundoRedoStack.redoOperation();\n\n\t\t\t// Returns a dummy edit id in order to satisfy the interface.\n\t\t\treturn 'aa26ef18-76a9-4238-9c29-9b796d21ef5a' as EditId;\n\t\t},\n\t\tafterEdit: () => {\n\t\t\tundoRedoStack.closeCurrentOperation();\n\t\t},\n\t\t// The SharedTreeUndoRedoHandler does not support out of order revert.\n\t\ttestOutOfOrderRevert: false,\n\t};\n\n\trunSharedTreeUndoRedoTestSuite({ localMode: true, title: 'in local mode', ...undoRedoOptions });\n\trunSharedTreeUndoRedoTestSuite({ localMode: false, title: 'in connected mode', ...undoRedoOptions });\n});\n"]}
package/lib/test/fuzz/Generators.d.ts CHANGED
@@ -3,6 +3,6 @@
3
3
  * Licensed under the MIT License.
4
4
  */
5
5
  import { AsyncGenerator } from '@fluid-private/stochastic-test-utils';
6
- import { FuzzTestState, Operation, OperationGenerationConfig } from './Types';
6
+ import { FuzzTestState, Operation, OperationGenerationConfig } from './Types.js';
7
7
  export declare function makeOpGenerator(passedConfig: OperationGenerationConfig): AsyncGenerator<Operation, FuzzTestState>;
8
8
  //# sourceMappingURL=Generators.d.ts.map
package/lib/test/fuzz/Generators.d.ts.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"Generators.d.ts","sourceRoot":"","sources":["../../../src/test/fuzz/Generators.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAEN,cAAc,EAMd,MAAM,sCAAsC,CAAC;AAO9C,OAAO,EAMN,aAAa,EAGb,SAAS,EACT,yBAAyB,EAGzB,MAAM,SAAS,CAAC;AAgXjB,wBAAgB,eAAe,CAAC,YAAY,EAAE,yBAAyB,GAAG,cAAc,CAAC,SAAS,EAAE,aAAa,CAAC,CA6BjH"}
1
+ {"version":3,"file":"Generators.d.ts","sourceRoot":"","sources":["../../../src/test/fuzz/Generators.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAEN,cAAc,EAMd,MAAM,sCAAsC,CAAC;AAO9C,OAAO,EAMN,aAAa,EAGb,SAAS,EACT,yBAAyB,EAGzB,MAAM,YAAY,CAAC;AAgXpB,wBAAgB,eAAe,CAAC,YAAY,EAAE,yBAAyB,GAAG,cAAc,CAAC,SAAS,EAAE,aAAa,CAAC,CA6BjH"}
package/lib/test/fuzz/Generators.js CHANGED
@@ -4,10 +4,10 @@
4
4
  */
5
5
  import { IsoBuffer } from '@fluid-internal/client-utils';
6
6
  import { createWeightedAsyncGenerator, done, makeRandom, } from '@fluid-private/stochastic-test-utils';
7
- import { Side, WriteFormat } from '../../persisted-types';
8
- import { ChangeType, StablePlace, StableRange } from '../../ChangeTypes';
9
- import { fail } from '../../Common';
10
- import { rangeFromStableRange } from '../../TreeViewUtilities';
7
+ import { Side, WriteFormat } from '../../persisted-types/index.js';
8
+ import { ChangeType, StablePlace, StableRange } from '../../ChangeTypes.js';
9
+ import { fail } from '../../Common.js';
10
+ import { rangeFromStableRange } from '../../TreeViewUtilities.js';
11
11
  const defaultJoinConfig = {
12
12
  maximumActiveCollaborators: 10,
13
13
  maximumPassiveCollaborators: 10,