@fluidframework/merge-tree 2.0.0-internal.8.0.0 → 2.0.0-rc.1.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 (481) hide show
  1. package/CHANGELOG.md +38 -0
  2. package/README.md +0 -6
  3. package/api-extractor-esm.json +17 -0
  4. package/api-extractor-lint.json +1 -10
  5. package/api-extractor.json +0 -4
  6. package/api-report/merge-tree.api.md +4 -9
  7. package/dist/client.d.ts +0 -7
  8. package/dist/client.d.ts.map +1 -1
  9. package/dist/client.js +0 -7
  10. package/dist/client.js.map +1 -1
  11. package/dist/merge-tree-alpha.d.ts +27 -12
  12. package/dist/merge-tree-beta.d.ts +0 -16
  13. package/dist/merge-tree-public.d.ts +0 -16
  14. package/dist/merge-tree-untrimmed.d.ts +5 -29
  15. package/dist/mergeTree.d.ts +0 -17
  16. package/dist/mergeTree.d.ts.map +1 -1
  17. package/dist/mergeTree.js +0 -130
  18. package/dist/mergeTree.js.map +1 -1
  19. package/dist/ops.d.ts +1 -1
  20. package/dist/ops.js +1 -1
  21. package/dist/ops.js.map +1 -1
  22. package/dist/revertibles.d.ts +4 -4
  23. package/dist/revertibles.js +3 -3
  24. package/dist/revertibles.js.map +1 -1
  25. package/dist/test/Insertion.perf.spec.d.ts +6 -0
  26. package/dist/test/Insertion.perf.spec.d.ts.map +1 -0
  27. package/dist/test/Insertion.perf.spec.js +113 -0
  28. package/dist/test/Insertion.perf.spec.js.map +1 -0
  29. package/dist/test/PartialLengths.perf.spec.d.ts +6 -0
  30. package/dist/test/PartialLengths.perf.spec.d.ts.map +1 -0
  31. package/dist/test/PartialLengths.perf.spec.js +67 -0
  32. package/dist/test/PartialLengths.perf.spec.js.map +1 -0
  33. package/dist/test/Removal.perf.spec.d.ts +6 -0
  34. package/dist/test/Removal.perf.spec.d.ts.map +1 -0
  35. package/dist/test/Removal.perf.spec.js +166 -0
  36. package/dist/test/Removal.perf.spec.js.map +1 -0
  37. package/dist/test/Snapshot.perf.spec.d.ts +6 -0
  38. package/dist/test/Snapshot.perf.spec.d.ts.map +1 -0
  39. package/dist/test/Snapshot.perf.spec.js +33 -0
  40. package/dist/test/Snapshot.perf.spec.js.map +1 -0
  41. package/dist/test/attributionCollection.perf.spec.d.ts +6 -0
  42. package/dist/test/attributionCollection.perf.spec.d.ts.map +1 -0
  43. package/dist/test/attributionCollection.perf.spec.js +231 -0
  44. package/dist/test/attributionCollection.perf.spec.js.map +1 -0
  45. package/dist/test/attributionCollection.spec.d.ts +6 -0
  46. package/dist/test/attributionCollection.spec.d.ts.map +1 -0
  47. package/dist/test/attributionCollection.spec.js +486 -0
  48. package/dist/test/attributionCollection.spec.js.map +1 -0
  49. package/dist/test/attributionPolicy.spec.d.ts +6 -0
  50. package/dist/test/attributionPolicy.spec.d.ts.map +1 -0
  51. package/dist/test/attributionPolicy.spec.js +189 -0
  52. package/dist/test/attributionPolicy.spec.js.map +1 -0
  53. package/dist/test/beastTest.d.ts +54 -0
  54. package/dist/test/beastTest.d.ts.map +1 -0
  55. package/dist/test/beastTest.js +1333 -0
  56. package/dist/test/beastTest.js.map +1 -0
  57. package/dist/test/client.annotateMarker.spec.d.ts +6 -0
  58. package/dist/test/client.annotateMarker.spec.d.ts.map +1 -0
  59. package/dist/test/client.annotateMarker.spec.js +45 -0
  60. package/dist/test/client.annotateMarker.spec.js.map +1 -0
  61. package/dist/test/client.apis.d.ts +7 -0
  62. package/dist/test/client.apis.d.ts.map +1 -0
  63. package/dist/test/client.apis.js +72 -0
  64. package/dist/test/client.apis.js.map +1 -0
  65. package/dist/test/client.applyMsg.spec.d.ts +6 -0
  66. package/dist/test/client.applyMsg.spec.d.ts.map +1 -0
  67. package/dist/test/client.applyMsg.spec.js +500 -0
  68. package/dist/test/client.applyMsg.spec.js.map +1 -0
  69. package/dist/test/client.applyStashedOpFarm.spec.d.ts +12 -0
  70. package/dist/test/client.applyStashedOpFarm.spec.d.ts.map +1 -0
  71. package/dist/test/client.applyStashedOpFarm.spec.js +144 -0
  72. package/dist/test/client.applyStashedOpFarm.spec.js.map +1 -0
  73. package/dist/test/client.attributionFarm.spec.d.ts +7 -0
  74. package/dist/test/client.attributionFarm.spec.d.ts.map +1 -0
  75. package/dist/test/client.attributionFarm.spec.js +96 -0
  76. package/dist/test/client.attributionFarm.spec.js.map +1 -0
  77. package/dist/test/client.conflictFarm.spec.d.ts +15 -0
  78. package/dist/test/client.conflictFarm.spec.d.ts.map +1 -0
  79. package/dist/test/client.conflictFarm.spec.js +88 -0
  80. package/dist/test/client.conflictFarm.spec.js.map +1 -0
  81. package/dist/test/client.getPosition.spec.d.ts +6 -0
  82. package/dist/test/client.getPosition.spec.d.ts.map +1 -0
  83. package/dist/test/client.getPosition.spec.js +54 -0
  84. package/dist/test/client.getPosition.spec.js.map +1 -0
  85. package/dist/test/client.localReference.spec.d.ts +6 -0
  86. package/dist/test/client.localReference.spec.d.ts.map +1 -0
  87. package/dist/test/client.localReference.spec.js +439 -0
  88. package/dist/test/client.localReference.spec.js.map +1 -0
  89. package/dist/test/client.localReferenceFarm.spec.d.ts +6 -0
  90. package/dist/test/client.localReferenceFarm.spec.d.ts.map +1 -0
  91. package/dist/test/client.localReferenceFarm.spec.js +88 -0
  92. package/dist/test/client.localReferenceFarm.spec.js.map +1 -0
  93. package/dist/test/client.rebasePosition.spec.d.ts +6 -0
  94. package/dist/test/client.rebasePosition.spec.d.ts.map +1 -0
  95. package/dist/test/client.rebasePosition.spec.js +102 -0
  96. package/dist/test/client.rebasePosition.spec.js.map +1 -0
  97. package/dist/test/client.reconnectFarm.spec.d.ts +12 -0
  98. package/dist/test/client.reconnectFarm.spec.d.ts.map +1 -0
  99. package/dist/test/client.reconnectFarm.spec.js +91 -0
  100. package/dist/test/client.reconnectFarm.spec.js.map +1 -0
  101. package/dist/test/client.replay.spec.d.ts +6 -0
  102. package/dist/test/client.replay.spec.d.ts.map +1 -0
  103. package/dist/test/client.replay.spec.js +85 -0
  104. package/dist/test/client.replay.spec.js.map +1 -0
  105. package/dist/test/client.rollback.spec.d.ts +6 -0
  106. package/dist/test/client.rollback.spec.d.ts.map +1 -0
  107. package/dist/test/client.rollback.spec.js +453 -0
  108. package/dist/test/client.rollback.spec.js.map +1 -0
  109. package/dist/test/client.rollbackFarm.spec.d.ts +6 -0
  110. package/dist/test/client.rollbackFarm.spec.d.ts.map +1 -0
  111. package/dist/test/client.rollbackFarm.spec.js +48 -0
  112. package/dist/test/client.rollbackFarm.spec.js.map +1 -0
  113. package/dist/test/client.searchForMarker.spec.d.ts +6 -0
  114. package/dist/test/client.searchForMarker.spec.d.ts.map +1 -0
  115. package/dist/test/client.searchForMarker.spec.js +446 -0
  116. package/dist/test/client.searchForMarker.spec.js.map +1 -0
  117. package/dist/test/client.walkSegments.spec.d.ts +6 -0
  118. package/dist/test/client.walkSegments.spec.d.ts.map +1 -0
  119. package/dist/test/client.walkSegments.spec.js +54 -0
  120. package/dist/test/client.walkSegments.spec.js.map +1 -0
  121. package/dist/test/collections.list.spec.d.ts +6 -0
  122. package/dist/test/collections.list.spec.d.ts.map +1 -0
  123. package/dist/test/collections.list.spec.js +84 -0
  124. package/dist/test/collections.list.spec.js.map +1 -0
  125. package/dist/test/createInsertOnlyAttributionPolicy.spec.d.ts +6 -0
  126. package/dist/test/createInsertOnlyAttributionPolicy.spec.d.ts.map +1 -0
  127. package/dist/test/createInsertOnlyAttributionPolicy.spec.js +35 -0
  128. package/dist/test/createInsertOnlyAttributionPolicy.spec.js.map +1 -0
  129. package/dist/test/index.d.ts +13 -0
  130. package/dist/test/index.d.ts.map +1 -0
  131. package/dist/test/index.js +88 -0
  132. package/dist/test/index.js.map +1 -0
  133. package/dist/test/mergeTree.annotate.deltaCallback.spec.d.ts +6 -0
  134. package/dist/test/mergeTree.annotate.deltaCallback.spec.d.ts.map +1 -0
  135. package/dist/test/mergeTree.annotate.deltaCallback.spec.js +142 -0
  136. package/dist/test/mergeTree.annotate.deltaCallback.spec.js.map +1 -0
  137. package/dist/test/mergeTree.annotate.spec.d.ts +6 -0
  138. package/dist/test/mergeTree.annotate.spec.d.ts.map +1 -0
  139. package/dist/test/mergeTree.annotate.spec.js +448 -0
  140. package/dist/test/mergeTree.annotate.spec.js.map +1 -0
  141. package/dist/test/mergeTree.insert.deltaCallback.spec.d.ts +6 -0
  142. package/dist/test/mergeTree.insert.deltaCallback.spec.d.ts.map +1 -0
  143. package/dist/test/mergeTree.insert.deltaCallback.spec.js +126 -0
  144. package/dist/test/mergeTree.insert.deltaCallback.spec.js.map +1 -0
  145. package/dist/test/mergeTree.insertingWalk.spec.d.ts +6 -0
  146. package/dist/test/mergeTree.insertingWalk.spec.d.ts.map +1 -0
  147. package/dist/test/mergeTree.insertingWalk.spec.js +279 -0
  148. package/dist/test/mergeTree.insertingWalk.spec.js.map +1 -0
  149. package/dist/test/mergeTree.markRangeRemoved.deltaCallback.spec.d.ts +6 -0
  150. package/dist/test/mergeTree.markRangeRemoved.deltaCallback.spec.d.ts.map +1 -0
  151. package/dist/test/mergeTree.markRangeRemoved.deltaCallback.spec.js +178 -0
  152. package/dist/test/mergeTree.markRangeRemoved.deltaCallback.spec.js.map +1 -0
  153. package/dist/test/mergeTree.markRangeRemoved.spec.d.ts +6 -0
  154. package/dist/test/mergeTree.markRangeRemoved.spec.d.ts.map +1 -0
  155. package/dist/test/mergeTree.markRangeRemoved.spec.js +130 -0
  156. package/dist/test/mergeTree.markRangeRemoved.spec.js.map +1 -0
  157. package/dist/test/mergeTree.walk.spec.d.ts +6 -0
  158. package/dist/test/mergeTree.walk.spec.d.ts.map +1 -0
  159. package/dist/test/mergeTree.walk.spec.js +63 -0
  160. package/dist/test/mergeTree.walk.spec.js.map +1 -0
  161. package/dist/test/mergeTree.zamboni.spec.d.ts +6 -0
  162. package/dist/test/mergeTree.zamboni.spec.d.ts.map +1 -0
  163. package/dist/test/mergeTree.zamboni.spec.js +52 -0
  164. package/dist/test/mergeTree.zamboni.spec.js.map +1 -0
  165. package/dist/test/mergeTreeOperationRunner.d.ts +63 -0
  166. package/dist/test/mergeTreeOperationRunner.d.ts.map +1 -0
  167. package/dist/test/mergeTreeOperationRunner.js +245 -0
  168. package/dist/test/mergeTreeOperationRunner.js.map +1 -0
  169. package/dist/test/mergeTreeOperationRunner.spec.d.ts +6 -0
  170. package/dist/test/mergeTreeOperationRunner.spec.d.ts.map +1 -0
  171. package/dist/test/mergeTreeOperationRunner.spec.js +156 -0
  172. package/dist/test/mergeTreeOperationRunner.spec.js.map +1 -0
  173. package/dist/test/obliterate.concurrent.spec.d.ts +6 -0
  174. package/dist/test/obliterate.concurrent.spec.d.ts.map +1 -0
  175. package/dist/test/obliterate.concurrent.spec.js +1446 -0
  176. package/dist/test/obliterate.concurrent.spec.js.map +1 -0
  177. package/dist/test/obliterate.partialLength.spec.d.ts +6 -0
  178. package/dist/test/obliterate.partialLength.spec.d.ts.map +1 -0
  179. package/dist/test/obliterate.partialLength.spec.js +279 -0
  180. package/dist/test/obliterate.partialLength.spec.js.map +1 -0
  181. package/dist/test/obliterate.reconnect.spec.d.ts +6 -0
  182. package/dist/test/obliterate.reconnect.spec.d.ts.map +1 -0
  183. package/dist/test/obliterate.reconnect.spec.js +164 -0
  184. package/dist/test/obliterate.reconnect.spec.js.map +1 -0
  185. package/dist/test/obliterate.spec.d.ts +6 -0
  186. package/dist/test/obliterate.spec.d.ts.map +1 -0
  187. package/dist/test/obliterate.spec.js +162 -0
  188. package/dist/test/obliterate.spec.js.map +1 -0
  189. package/dist/test/ordinal.spec.d.ts +2 -0
  190. package/dist/test/ordinal.spec.d.ts.map +1 -0
  191. package/dist/test/ordinal.spec.js +43 -0
  192. package/dist/test/ordinal.spec.js.map +1 -0
  193. package/dist/test/partialLength.spec.d.ts +6 -0
  194. package/dist/test/partialLength.spec.d.ts.map +1 -0
  195. package/dist/test/partialLength.spec.js +282 -0
  196. package/dist/test/partialLength.spec.js.map +1 -0
  197. package/dist/test/properties.spec.d.ts +6 -0
  198. package/dist/test/properties.spec.d.ts.map +1 -0
  199. package/dist/test/properties.spec.js +55 -0
  200. package/dist/test/properties.spec.js.map +1 -0
  201. package/dist/test/reconnectHelper.d.ts +48 -0
  202. package/dist/test/reconnectHelper.d.ts.map +1 -0
  203. package/dist/test/reconnectHelper.js +86 -0
  204. package/dist/test/reconnectHelper.js.map +1 -0
  205. package/dist/test/resetPendingSegmentsToOp.spec.d.ts +6 -0
  206. package/dist/test/resetPendingSegmentsToOp.spec.d.ts.map +1 -0
  207. package/dist/test/resetPendingSegmentsToOp.spec.js +218 -0
  208. package/dist/test/resetPendingSegmentsToOp.spec.js.map +1 -0
  209. package/dist/test/revertibleFarm.spec.d.ts +6 -0
  210. package/dist/test/revertibleFarm.spec.d.ts.map +1 -0
  211. package/dist/test/revertibleFarm.spec.js +124 -0
  212. package/dist/test/revertibleFarm.spec.js.map +1 -0
  213. package/dist/test/revertibles.spec.d.ts +17 -0
  214. package/dist/test/revertibles.spec.d.ts.map +1 -0
  215. package/dist/test/revertibles.spec.js +385 -0
  216. package/dist/test/revertibles.spec.js.map +1 -0
  217. package/dist/test/segmentGroupCollection.spec.d.ts +6 -0
  218. package/dist/test/segmentGroupCollection.spec.d.ts.map +1 -0
  219. package/dist/test/segmentGroupCollection.spec.js +60 -0
  220. package/dist/test/segmentGroupCollection.spec.js.map +1 -0
  221. package/dist/test/snapshot.spec.d.ts +6 -0
  222. package/dist/test/snapshot.spec.d.ts.map +1 -0
  223. package/dist/test/snapshot.spec.js +178 -0
  224. package/dist/test/snapshot.spec.js.map +1 -0
  225. package/dist/test/snapshot.utils.d.ts +33 -0
  226. package/dist/test/snapshot.utils.d.ts.map +1 -0
  227. package/dist/test/snapshot.utils.js +109 -0
  228. package/dist/test/snapshot.utils.js.map +1 -0
  229. package/dist/test/snapshotlegacy.spec.d.ts +6 -0
  230. package/dist/test/snapshotlegacy.spec.d.ts.map +1 -0
  231. package/dist/test/snapshotlegacy.spec.js +139 -0
  232. package/dist/test/snapshotlegacy.spec.js.map +1 -0
  233. package/dist/test/sortedSegmentSet.spec.d.ts +6 -0
  234. package/dist/test/sortedSegmentSet.spec.d.ts.map +1 -0
  235. package/dist/test/sortedSegmentSet.spec.js +95 -0
  236. package/dist/test/sortedSegmentSet.spec.js.map +1 -0
  237. package/dist/test/testClient.d.ts +119 -0
  238. package/dist/test/testClient.d.ts.map +1 -0
  239. package/dist/test/testClient.js +439 -0
  240. package/dist/test/testClient.js.map +1 -0
  241. package/dist/test/testClientLogger.d.ts +44 -0
  242. package/dist/test/testClientLogger.d.ts.map +1 -0
  243. package/dist/test/testClientLogger.js +287 -0
  244. package/dist/test/testClientLogger.js.map +1 -0
  245. package/dist/test/testSerializer.d.ts +18 -0
  246. package/dist/test/testSerializer.d.ts.map +1 -0
  247. package/dist/test/testSerializer.js +33 -0
  248. package/dist/test/testSerializer.js.map +1 -0
  249. package/dist/test/testServer.d.ts +36 -0
  250. package/dist/test/testServer.d.ts.map +1 -0
  251. package/dist/test/testServer.js +138 -0
  252. package/dist/test/testServer.js.map +1 -0
  253. package/dist/test/testUtils.d.ts +69 -0
  254. package/dist/test/testUtils.d.ts.map +1 -0
  255. package/dist/test/testUtils.js +149 -0
  256. package/dist/test/testUtils.js.map +1 -0
  257. package/dist/test/text.d.ts +9 -0
  258. package/dist/test/text.d.ts.map +1 -0
  259. package/dist/test/text.js +76 -0
  260. package/dist/test/text.js.map +1 -0
  261. package/dist/test/tracking.spec.d.ts +6 -0
  262. package/dist/test/tracking.spec.d.ts.map +1 -0
  263. package/dist/test/tracking.spec.js +120 -0
  264. package/dist/test/tracking.spec.js.map +1 -0
  265. package/dist/test/wordUnitTests.d.ts +6 -0
  266. package/dist/test/wordUnitTests.d.ts.map +1 -0
  267. package/dist/test/wordUnitTests.js +172 -0
  268. package/dist/test/wordUnitTests.js.map +1 -0
  269. package/lib/{MergeTreeTextHelper.d.ts → MergeTreeTextHelper.d.mts} +3 -3
  270. package/lib/MergeTreeTextHelper.d.mts.map +1 -0
  271. package/lib/{MergeTreeTextHelper.js → MergeTreeTextHelper.mjs} +5 -10
  272. package/lib/MergeTreeTextHelper.mjs.map +1 -0
  273. package/lib/{attributionCollection.d.ts → attributionCollection.d.mts} +2 -2
  274. package/lib/attributionCollection.d.mts.map +1 -0
  275. package/lib/{attributionCollection.js → attributionCollection.mjs} +9 -14
  276. package/lib/attributionCollection.mjs.map +1 -0
  277. package/lib/{attributionPolicy.d.ts → attributionPolicy.d.mts} +2 -2
  278. package/lib/attributionPolicy.d.mts.map +1 -0
  279. package/lib/{attributionPolicy.js → attributionPolicy.mjs} +21 -27
  280. package/lib/attributionPolicy.mjs.map +1 -0
  281. package/lib/{client.d.ts → client.d.mts} +9 -16
  282. package/lib/client.d.mts.map +1 -0
  283. package/lib/{client.js → client.mjs} +101 -110
  284. package/lib/client.mjs.map +1 -0
  285. package/lib/collections/{index.d.ts → index.d.mts} +3 -3
  286. package/lib/collections/index.d.mts.map +1 -0
  287. package/lib/collections/index.mjs +7 -0
  288. package/lib/collections/index.mjs.map +1 -0
  289. package/lib/collections/{list.d.ts → list.d.mts} +1 -1
  290. package/lib/collections/list.d.mts.map +1 -0
  291. package/lib/collections/{list.js → list.mjs} +6 -11
  292. package/lib/collections/list.mjs.map +1 -0
  293. package/lib/collections/{rbTree.d.ts → rbTree.d.mts} +1 -1
  294. package/lib/collections/rbTree.d.mts.map +1 -0
  295. package/lib/collections/{rbTree.js → rbTree.mjs} +16 -20
  296. package/lib/collections/rbTree.mjs.map +1 -0
  297. package/lib/{constants.d.ts → constants.d.mts} +1 -1
  298. package/lib/constants.d.mts.map +1 -0
  299. package/lib/constants.mjs +32 -0
  300. package/lib/constants.mjs.map +1 -0
  301. package/lib/{endOfTreeSegment.d.ts → endOfTreeSegment.d.mts} +4 -4
  302. package/lib/endOfTreeSegment.d.mts.map +1 -0
  303. package/lib/{endOfTreeSegment.js → endOfTreeSegment.mjs} +13 -18
  304. package/lib/endOfTreeSegment.mjs.map +1 -0
  305. package/lib/{index.d.ts → index.d.mts} +21 -21
  306. package/lib/index.d.mts.map +1 -0
  307. package/lib/index.mjs +24 -0
  308. package/lib/index.mjs.map +1 -0
  309. package/lib/{localReference.d.ts → localReference.d.mts} +7 -7
  310. package/lib/localReference.d.mts.map +1 -0
  311. package/lib/{localReference.js → localReference.mjs} +38 -47
  312. package/lib/localReference.mjs.map +1 -0
  313. package/lib/{merge-tree-alpha.d.ts → merge-tree-alpha.d.mts} +27 -12
  314. package/lib/{merge-tree-beta.d.ts → merge-tree-beta.d.mts} +0 -16
  315. package/lib/{merge-tree-public.d.ts → merge-tree-public.d.mts} +0 -16
  316. package/lib/{merge-tree-untrimmed.d.ts → merge-tree-untrimmed.d.mts} +5 -29
  317. package/lib/{mergeTree.d.ts → mergeTree.d.mts} +12 -29
  318. package/lib/mergeTree.d.mts.map +1 -0
  319. package/lib/{mergeTree.js → mergeTree.mjs} +203 -340
  320. package/lib/mergeTree.mjs.map +1 -0
  321. package/lib/{mergeTreeDeltaCallback.d.ts → mergeTreeDeltaCallback.d.mts} +4 -8
  322. package/lib/mergeTreeDeltaCallback.d.mts.map +1 -0
  323. package/lib/{mergeTreeDeltaCallback.js → mergeTreeDeltaCallback.mjs} +2 -5
  324. package/lib/mergeTreeDeltaCallback.mjs.map +1 -0
  325. package/lib/{mergeTreeNodeWalk.d.ts → mergeTreeNodeWalk.d.mts} +2 -2
  326. package/lib/mergeTreeNodeWalk.d.mts.map +1 -0
  327. package/lib/{mergeTreeNodeWalk.js → mergeTreeNodeWalk.mjs} +14 -21
  328. package/lib/mergeTreeNodeWalk.mjs.map +1 -0
  329. package/lib/{mergeTreeNodes.d.ts → mergeTreeNodes.d.mts} +12 -12
  330. package/lib/mergeTreeNodes.d.mts.map +1 -0
  331. package/lib/{mergeTreeNodes.js → mergeTreeNodes.mjs} +60 -76
  332. package/lib/mergeTreeNodes.mjs.map +1 -0
  333. package/lib/{mergeTreeTracking.d.ts → mergeTreeTracking.d.mts} +3 -3
  334. package/lib/mergeTreeTracking.d.mts.map +1 -0
  335. package/lib/{mergeTreeTracking.js → mergeTreeTracking.mjs} +6 -13
  336. package/lib/mergeTreeTracking.mjs.map +1 -0
  337. package/lib/{opBuilder.d.ts → opBuilder.d.mts} +4 -4
  338. package/lib/opBuilder.d.mts.map +1 -0
  339. package/lib/{opBuilder.js → opBuilder.mjs} +15 -25
  340. package/lib/opBuilder.mjs.map +1 -0
  341. package/lib/{ops.d.ts → ops.d.mts} +2 -2
  342. package/lib/ops.d.mts.map +1 -0
  343. package/lib/{ops.js → ops.mjs} +5 -8
  344. package/lib/ops.mjs.map +1 -0
  345. package/lib/{ordinal.d.ts → ordinal.d.mts} +1 -1
  346. package/lib/ordinal.d.mts.map +1 -0
  347. package/lib/{ordinal.js → ordinal.mjs} +4 -9
  348. package/lib/ordinal.mjs.map +1 -0
  349. package/lib/{partialLengths.d.ts → partialLengths.d.mts} +4 -4
  350. package/lib/partialLengths.d.mts.map +1 -0
  351. package/lib/{partialLengths.js → partialLengths.mjs} +38 -46
  352. package/lib/partialLengths.mjs.map +1 -0
  353. package/lib/{properties.d.ts → properties.d.mts} +1 -1
  354. package/lib/properties.d.mts.map +1 -0
  355. package/lib/{properties.js → properties.mjs} +7 -16
  356. package/lib/properties.mjs.map +1 -0
  357. package/lib/{referencePositions.d.ts → referencePositions.d.mts} +5 -5
  358. package/lib/referencePositions.d.mts.map +1 -0
  359. package/lib/referencePositions.mjs +70 -0
  360. package/lib/referencePositions.mjs.map +1 -0
  361. package/lib/{revertibles.d.ts → revertibles.d.mts} +12 -12
  362. package/lib/revertibles.d.mts.map +1 -0
  363. package/lib/{revertibles.js → revertibles.mjs} +60 -67
  364. package/lib/revertibles.mjs.map +1 -0
  365. package/lib/{segmentGroupCollection.d.ts → segmentGroupCollection.d.mts} +2 -2
  366. package/lib/segmentGroupCollection.d.mts.map +1 -0
  367. package/lib/{segmentGroupCollection.js → segmentGroupCollection.mjs} +5 -9
  368. package/lib/segmentGroupCollection.mjs.map +1 -0
  369. package/lib/{segmentPropertiesManager.d.ts → segmentPropertiesManager.d.mts} +3 -3
  370. package/lib/segmentPropertiesManager.d.mts.map +1 -0
  371. package/lib/{segmentPropertiesManager.js → segmentPropertiesManager.mjs} +14 -20
  372. package/lib/{segmentPropertiesManager.js.map → segmentPropertiesManager.mjs.map} +1 -1
  373. package/lib/{snapshotChunks.d.ts → snapshotChunks.d.mts} +4 -4
  374. package/lib/snapshotChunks.d.mts.map +1 -0
  375. package/lib/{snapshotChunks.js → snapshotChunks.mjs} +10 -17
  376. package/lib/snapshotChunks.mjs.map +1 -0
  377. package/lib/{snapshotLoader.d.ts → snapshotLoader.d.mts} +3 -3
  378. package/lib/snapshotLoader.d.mts.map +1 -0
  379. package/lib/{snapshotLoader.js → snapshotLoader.mjs} +33 -38
  380. package/lib/snapshotLoader.mjs.map +1 -0
  381. package/lib/{snapshotV1.d.ts → snapshotV1.d.mts} +4 -4
  382. package/lib/snapshotV1.d.mts.map +1 -0
  383. package/lib/{snapshotV1.js → snapshotV1.mjs} +28 -32
  384. package/lib/snapshotV1.mjs.map +1 -0
  385. package/lib/{snapshotlegacy.d.ts → snapshotlegacy.d.mts} +3 -3
  386. package/lib/snapshotlegacy.d.mts.map +1 -0
  387. package/lib/{snapshotlegacy.js → snapshotlegacy.mjs} +21 -26
  388. package/lib/snapshotlegacy.mjs.map +1 -0
  389. package/lib/{sortedSegmentSet.d.ts → sortedSegmentSet.d.mts} +4 -4
  390. package/lib/sortedSegmentSet.d.mts.map +1 -0
  391. package/lib/{sortedSegmentSet.js → sortedSegmentSet.mjs} +3 -8
  392. package/lib/sortedSegmentSet.mjs.map +1 -0
  393. package/lib/{sortedSet.d.ts → sortedSet.d.mts} +1 -1
  394. package/lib/sortedSet.d.mts.map +1 -0
  395. package/lib/{sortedSet.js → sortedSet.mjs} +2 -6
  396. package/lib/sortedSet.mjs.map +1 -0
  397. package/lib/{textSegment.d.ts → textSegment.d.mts} +4 -4
  398. package/lib/textSegment.d.mts.map +1 -0
  399. package/lib/{textSegment.js → textSegment.mjs} +8 -12
  400. package/lib/textSegment.mjs.map +1 -0
  401. package/lib/{zamboni.d.ts → zamboni.d.mts} +3 -3
  402. package/lib/zamboni.d.mts.map +1 -0
  403. package/lib/{zamboni.js → zamboni.mjs} +22 -28
  404. package/lib/zamboni.mjs.map +1 -0
  405. package/package.json +95 -164
  406. package/src/client.ts +0 -8
  407. package/src/mergeTree.ts +0 -226
  408. package/src/ops.ts +1 -1
  409. package/src/revertibles.ts +4 -4
  410. package/lib/MergeTreeTextHelper.d.ts.map +0 -1
  411. package/lib/MergeTreeTextHelper.js.map +0 -1
  412. package/lib/attributionCollection.d.ts.map +0 -1
  413. package/lib/attributionCollection.js.map +0 -1
  414. package/lib/attributionPolicy.d.ts.map +0 -1
  415. package/lib/attributionPolicy.js.map +0 -1
  416. package/lib/client.d.ts.map +0 -1
  417. package/lib/client.js.map +0 -1
  418. package/lib/collections/index.d.ts.map +0 -1
  419. package/lib/collections/index.js +0 -14
  420. package/lib/collections/index.js.map +0 -1
  421. package/lib/collections/list.d.ts.map +0 -1
  422. package/lib/collections/list.js.map +0 -1
  423. package/lib/collections/rbTree.d.ts.map +0 -1
  424. package/lib/collections/rbTree.js.map +0 -1
  425. package/lib/constants.d.ts.map +0 -1
  426. package/lib/constants.js +0 -35
  427. package/lib/constants.js.map +0 -1
  428. package/lib/endOfTreeSegment.d.ts.map +0 -1
  429. package/lib/endOfTreeSegment.js.map +0 -1
  430. package/lib/index.d.ts.map +0 -1
  431. package/lib/index.js +0 -80
  432. package/lib/index.js.map +0 -1
  433. package/lib/localReference.d.ts.map +0 -1
  434. package/lib/localReference.js.map +0 -1
  435. package/lib/mergeTree.d.ts.map +0 -1
  436. package/lib/mergeTree.js.map +0 -1
  437. package/lib/mergeTreeDeltaCallback.d.ts.map +0 -1
  438. package/lib/mergeTreeDeltaCallback.js.map +0 -1
  439. package/lib/mergeTreeNodeWalk.d.ts.map +0 -1
  440. package/lib/mergeTreeNodeWalk.js.map +0 -1
  441. package/lib/mergeTreeNodes.d.ts.map +0 -1
  442. package/lib/mergeTreeNodes.js.map +0 -1
  443. package/lib/mergeTreeTracking.d.ts.map +0 -1
  444. package/lib/mergeTreeTracking.js.map +0 -1
  445. package/lib/opBuilder.d.ts.map +0 -1
  446. package/lib/opBuilder.js.map +0 -1
  447. package/lib/ops.d.ts.map +0 -1
  448. package/lib/ops.js.map +0 -1
  449. package/lib/ordinal.d.ts.map +0 -1
  450. package/lib/ordinal.js.map +0 -1
  451. package/lib/partialLengths.d.ts.map +0 -1
  452. package/lib/partialLengths.js.map +0 -1
  453. package/lib/properties.d.ts.map +0 -1
  454. package/lib/properties.js.map +0 -1
  455. package/lib/referencePositions.d.ts.map +0 -1
  456. package/lib/referencePositions.js +0 -80
  457. package/lib/referencePositions.js.map +0 -1
  458. package/lib/revertibles.d.ts.map +0 -1
  459. package/lib/revertibles.js.map +0 -1
  460. package/lib/segmentGroupCollection.d.ts.map +0 -1
  461. package/lib/segmentGroupCollection.js.map +0 -1
  462. package/lib/segmentPropertiesManager.d.ts.map +0 -1
  463. package/lib/snapshotChunks.d.ts.map +0 -1
  464. package/lib/snapshotChunks.js.map +0 -1
  465. package/lib/snapshotLoader.d.ts.map +0 -1
  466. package/lib/snapshotLoader.js.map +0 -1
  467. package/lib/snapshotV1.d.ts.map +0 -1
  468. package/lib/snapshotV1.js.map +0 -1
  469. package/lib/snapshotlegacy.d.ts.map +0 -1
  470. package/lib/snapshotlegacy.js.map +0 -1
  471. package/lib/sortedSegmentSet.d.ts.map +0 -1
  472. package/lib/sortedSegmentSet.js.map +0 -1
  473. package/lib/sortedSet.d.ts.map +0 -1
  474. package/lib/sortedSet.js.map +0 -1
  475. package/lib/textSegment.d.ts.map +0 -1
  476. package/lib/textSegment.js.map +0 -1
  477. package/lib/zamboni.d.ts.map +0 -1
  478. package/lib/zamboni.js.map +0 -1
  479. package/merge-tree.test-files.tar +0 -0
  480. package/src/mergeTreeExample1.pdf +0 -0
  481. package/tsconfig.esnext.json +0 -6
@@ -0,0 +1,385 @@
1
+ "use strict";
2
+ /*!
3
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
4
+ * Licensed under the MIT License.
5
+ */
6
+ Object.defineProperty(exports, "__esModule", { value: true });
7
+ exports.spyOnMethod = void 0;
8
+ const assert_1 = require("assert");
9
+ const test_pairwise_generator_1 = require("@fluid-private/test-pairwise-generator");
10
+ const ops_1 = require("../ops");
11
+ const revertibles_1 = require("../revertibles");
12
+ const mergeTreeTracking_1 = require("../mergeTreeTracking");
13
+ const testClient_1 = require("./testClient");
14
+ const testClientLogger_1 = require("./testClientLogger");
15
+ /**
16
+ * Run a custom "spy function" every time the given method is invoked.
17
+ * @param methodClass - the class that has the method
18
+ * @param methodName - the name of the method
19
+ * @param spy - the spy function to run alongside the method
20
+ * @returns a function which will remove the spy function when invoked. Should be called exactly once
21
+ * after the spy is no longer needed.
22
+ *
23
+ * This method is duplicated between shared-tree test code, and should eventually
24
+ * be merged with the implementation that lives there
25
+ */
26
+ function spyOnMethod(
27
+ // eslint-disable-next-line @typescript-eslint/ban-types
28
+ methodClass, methodName, spy) {
29
+ const { prototype } = methodClass;
30
+ const method = prototype[methodName];
31
+ (0, assert_1.strict)(typeof method === "function", `Method does not exist: ${methodName}`);
32
+ const methodSpy = function (...args) {
33
+ spy();
34
+ return method.call(this, ...args);
35
+ };
36
+ prototype[methodName] = methodSpy;
37
+ return () => {
38
+ prototype[methodName] = method;
39
+ };
40
+ }
41
+ exports.spyOnMethod = spyOnMethod;
42
+ describe("MergeTree.Revertibles", () => {
43
+ it("revert insert", () => {
44
+ const clients = (0, testClientLogger_1.createClientsAtInitialState)({ initialState: "123", options: {} }, "A", "B");
45
+ const logger = new testClientLogger_1.TestClientLogger(clients.all);
46
+ let seq = 0;
47
+ const ops = [];
48
+ const clientB_Revertibles = [];
49
+ const clientBDriver = (0, testClient_1.createRevertDriver)(clients.B);
50
+ clientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));
51
+ clients.B.on("delta", (op, delta) => {
52
+ (0, revertibles_1.appendToMergeTreeDeltaRevertibles)(delta, clientB_Revertibles);
53
+ });
54
+ ops.push(clients.B.makeOpMessage(clients.B.insertTextLocal(0, "BB"), ++seq));
55
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
56
+ logger.validate({ baseText: "BB123" });
57
+ (0, revertibles_1.revertMergeTreeDeltaRevertibles)(clientBDriver, clientB_Revertibles.splice(0));
58
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
59
+ logger.validate({ baseText: "123" });
60
+ });
61
+ it("has reasonable asymptotics in face of remove", () => {
62
+ const length = 100;
63
+ // track the amount of tracking group linking that occurs
64
+ let linkCount = 0;
65
+ let unlinkCount = 0;
66
+ const unspy1 = spyOnMethod(mergeTreeTracking_1.TrackingGroup, "link", () => (linkCount += 1));
67
+ const unspy2 = spyOnMethod(mergeTreeTracking_1.TrackingGroup, "unlink", () => (unlinkCount += 1));
68
+ const unspy3 = spyOnMethod(mergeTreeTracking_1.UnorderedTrackingGroup, "link", () => (linkCount += 1));
69
+ const unspy4 = spyOnMethod(mergeTreeTracking_1.UnorderedTrackingGroup, "unlink", () => (unlinkCount += 1));
70
+ try {
71
+ const clients = (0, testClientLogger_1.createClientsAtInitialState)({
72
+ initialState: "",
73
+ options: {},
74
+ }, "A");
75
+ for (let i = 1; i <= length; i++) {
76
+ const insertOp = clients.A.insertTextLocal(i - 1, "a");
77
+ clients.A.applyMsg(clients.A.makeOpMessage(insertOp,
78
+ /* seq */ i + 1,
79
+ /* refSeq */ i, clients.A.longClientId,
80
+ /* minSeq */ 1));
81
+ }
82
+ const revertibles = [];
83
+ clients.A.on("delta", (_op, delta) => {
84
+ (0, revertibles_1.appendToMergeTreeDeltaRevertibles)(delta, revertibles);
85
+ });
86
+ const op = clients.A.removeRangeLocal(0, length - 1);
87
+ clients.A.applyMsg(clients.A.makeOpMessage(op,
88
+ /* seq */ length + 1,
89
+ /* refSeq */ length, clients.A.longClientId,
90
+ /* minSeq */ length));
91
+ // the below checks act as a proxy for the asymptotics of undo-redo
92
+ // linking. they are perhaps a bit more strict than necessary. if these
93
+ // tests are failing and the number of calls is still within a sane limit,
94
+ // it should be fine to update these checks to allow a larger number of
95
+ // calls
96
+ (0, assert_1.strict)(linkCount <= length * 3, `expected tracking group link to occur at most three times per segment. found ${linkCount} instead of ${length * 3}`);
97
+ (0, assert_1.strict)(unlinkCount <= length * 2, `expected tracking group unlink to occur at most twice per segment. found ${unlinkCount} instead of ${length * 2}`);
98
+ }
99
+ finally {
100
+ unspy1();
101
+ unspy2();
102
+ unspy3();
103
+ unspy4();
104
+ }
105
+ });
106
+ it("revert remove", () => {
107
+ const clients = (0, testClientLogger_1.createClientsAtInitialState)({ initialState: "123", options: {} }, "A", "B");
108
+ const logger = new testClientLogger_1.TestClientLogger(clients.all);
109
+ let seq = 0;
110
+ const ops = [];
111
+ const clientB_Revertibles = [];
112
+ const clientBDriver = (0, testClient_1.createRevertDriver)(clients.B);
113
+ clientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));
114
+ clients.B.on("delta", (op, delta) => {
115
+ (0, revertibles_1.appendToMergeTreeDeltaRevertibles)(delta, clientB_Revertibles);
116
+ });
117
+ ops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(0, 1), ++seq));
118
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
119
+ logger.validate({ baseText: "23" });
120
+ (0, revertibles_1.revertMergeTreeDeltaRevertibles)(clientBDriver, clientB_Revertibles.splice(0));
121
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
122
+ logger.validate({ baseText: "123" });
123
+ });
124
+ for (const { name, removeStart, removeEnd, expectedPostRemove } of [
125
+ {
126
+ name: "revert overlapping remove",
127
+ removeStart: 0,
128
+ removeEnd: 1,
129
+ expectedPostRemove: "23",
130
+ },
131
+ {
132
+ name: "revert overlapping remove of multiple segments",
133
+ removeStart: 0,
134
+ removeEnd: 2,
135
+ expectedPreRemove: "23",
136
+ },
137
+ ]) {
138
+ it(name, () => {
139
+ const clients = (0, testClientLogger_1.createClientsAtInitialState)({ initialState: "1-23", options: {} }, "A", "B", "C");
140
+ const logger = new testClientLogger_1.TestClientLogger(clients.all);
141
+ let seq = 0;
142
+ const ops = [];
143
+ const clientB_Revertibles = [];
144
+ const clientBDriver = (0, testClient_1.createRevertDriver)(clients.B);
145
+ clientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));
146
+ clients.B.on("delta", (op, delta) => {
147
+ (0, revertibles_1.appendToMergeTreeDeltaRevertibles)(delta, clientB_Revertibles);
148
+ });
149
+ ops.push(clients.C.makeOpMessage(clients.C.removeRangeLocal(removeStart, removeEnd), ++seq));
150
+ ops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(removeStart, removeEnd), ++seq));
151
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
152
+ logger.validate({ baseText: expectedPostRemove });
153
+ (0, revertibles_1.revertMergeTreeDeltaRevertibles)(clientBDriver, clientB_Revertibles.splice(0));
154
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
155
+ logger.validate({ baseText: "123" });
156
+ });
157
+ }
158
+ it("revert two overlapping removes", () => {
159
+ const clients = (0, testClientLogger_1.createClientsAtInitialState)({ initialState: "123", options: {} }, "A", "B", "C");
160
+ const logger = new testClientLogger_1.TestClientLogger(clients.all);
161
+ let seq = 0;
162
+ const ops = [];
163
+ const clientB_Revertibles = [];
164
+ const clientBDriver = (0, testClient_1.createRevertDriver)(clients.B);
165
+ clientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));
166
+ const clientC_Revertibles = [];
167
+ const clientCDriver = (0, testClient_1.createRevertDriver)(clients.C);
168
+ clientCDriver.submitOpCallback = (op) => ops.push(clients.C.makeOpMessage(op, ++seq));
169
+ clients.B.on("delta", (op, delta) => {
170
+ (0, revertibles_1.appendToMergeTreeDeltaRevertibles)(delta, clientB_Revertibles);
171
+ });
172
+ clients.C.on("delta", (op, delta) => {
173
+ (0, revertibles_1.appendToMergeTreeDeltaRevertibles)(delta, clientC_Revertibles);
174
+ });
175
+ ops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(0, 1), ++seq));
176
+ ops.push(clients.C.makeOpMessage(clients.C.removeRangeLocal(0, 1), ++seq));
177
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
178
+ logger.validate({ baseText: "23" });
179
+ (0, revertibles_1.revertMergeTreeDeltaRevertibles)(clientBDriver, clientB_Revertibles.splice(0));
180
+ (0, revertibles_1.revertMergeTreeDeltaRevertibles)(clientCDriver, clientC_Revertibles.splice(0));
181
+ // "123" would be the ideal final state, but due to current limitations,
182
+ // the eventual consistent state is "1123"
183
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
184
+ logger.validate({ baseText: "1123" });
185
+ });
186
+ it("revert annotate", () => {
187
+ const clients = (0, testClientLogger_1.createClientsAtInitialState)({ initialState: "123", options: {} }, "A", "B");
188
+ const logger = new testClientLogger_1.TestClientLogger(clients.all);
189
+ let seq = 0;
190
+ const ops = [];
191
+ const clientB_Revertibles = [];
192
+ const clientBDriver = (0, testClient_1.createRevertDriver)(clients.B);
193
+ clientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));
194
+ clients.B.on("delta", (op, delta) => {
195
+ (0, revertibles_1.appendToMergeTreeDeltaRevertibles)(delta, clientB_Revertibles);
196
+ });
197
+ ops.push(clients.B.makeOpMessage(clients.B.annotateRangeLocal(0, 1, { test: 1 }), ++seq));
198
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
199
+ logger.validate({ baseText: "123" });
200
+ (0, revertibles_1.revertMergeTreeDeltaRevertibles)(clientBDriver, clientB_Revertibles.splice(0));
201
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
202
+ logger.validate({ baseText: "123" });
203
+ });
204
+ it("Remove All Original Text and Insert then Revert", () => {
205
+ const clients = (0, testClientLogger_1.createClientsAtInitialState)({ initialState: "1-2--", options: {} }, "A", "B", "C");
206
+ const logger = new testClientLogger_1.TestClientLogger(clients.all);
207
+ let seq = 0;
208
+ const ops = [];
209
+ const clientB_Revertibles = [];
210
+ // the test logger uses these callbacks, so preserve it
211
+ const clientBDriver = (0, testClient_1.createRevertDriver)(clients.B);
212
+ const deltaCallback = (op, delta) => {
213
+ (0, revertibles_1.appendToMergeTreeDeltaRevertibles)(delta, clientB_Revertibles);
214
+ };
215
+ clientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));
216
+ clients.B.on("delta", deltaCallback);
217
+ ops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(0, 1), ++seq));
218
+ ops.push(clients.B.makeOpMessage(clients.B.insertTextLocal(0, "BB"), ++seq));
219
+ ops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(2, 3), ++seq));
220
+ // revert to the original callback
221
+ clients.B.off("delta", deltaCallback);
222
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
223
+ (0, revertibles_1.revertMergeTreeDeltaRevertibles)(clientBDriver, clientB_Revertibles.splice(0));
224
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
225
+ logger.validate({ baseText: "12" });
226
+ });
227
+ it("Re-Insert at position 0 in empty string", () => {
228
+ const clients = (0, testClientLogger_1.createClientsAtInitialState)({ initialState: "BBC-", options: {} }, "A", "B", "C");
229
+ const logger = new testClientLogger_1.TestClientLogger(clients.all);
230
+ let seq = 0;
231
+ const ops = [];
232
+ const clientB_Revertibles = [];
233
+ const deltaCallback = (op, delta) => {
234
+ (0, revertibles_1.appendToMergeTreeDeltaRevertibles)(delta, clientB_Revertibles);
235
+ };
236
+ const clientBDriver = (0, testClient_1.createRevertDriver)(clients.B);
237
+ clientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));
238
+ clients.B.on("delta", deltaCallback);
239
+ ops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(2, 3), ++seq));
240
+ ops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(0, 1), ++seq));
241
+ ops.push(clients.B.makeOpMessage(clients.B.insertTextLocal(1, "BB"), ++seq));
242
+ // revert to the original callback
243
+ clients.B.off("delta", deltaCallback);
244
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
245
+ (0, revertibles_1.revertMergeTreeDeltaRevertibles)(clientBDriver, clientB_Revertibles.splice(0));
246
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
247
+ logger.validate({ baseText: "BBC" });
248
+ });
249
+ it("Revert remove to empty with annotate", () => {
250
+ const clients = (0, testClientLogger_1.createClientsAtInitialState)({ initialState: "1-23--", options: {} }, "A", "B", "C");
251
+ const logger = new testClientLogger_1.TestClientLogger(clients.all);
252
+ let seq = 0;
253
+ const ops = [];
254
+ const clientB_Revertibles = [];
255
+ const deltaCallback = (op, delta) => {
256
+ (0, revertibles_1.appendToMergeTreeDeltaRevertibles)(delta, clientB_Revertibles);
257
+ };
258
+ const clientBDriver = (0, testClient_1.createRevertDriver)(clients.B);
259
+ clientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));
260
+ clients.B.on("delta", deltaCallback);
261
+ ops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(0, 2), ++seq));
262
+ ops.push(clients.B.makeOpMessage(clients.B.annotateRangeLocal(0, 1, { test: 1 }), ++seq));
263
+ ops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(0, 1), ++seq));
264
+ // revert to the original callback
265
+ clients.B.off("delta", deltaCallback);
266
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
267
+ (0, revertibles_1.revertMergeTreeDeltaRevertibles)(clientBDriver, clientB_Revertibles.splice(0));
268
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
269
+ logger.validate({ baseText: "123" });
270
+ });
271
+ it("Revert Local annotate and remove with intersecting remote annotate", () => {
272
+ const clients = (0, testClientLogger_1.createClientsAtInitialState)({ initialState: "1234-----", options: {} }, "A", "B", "C");
273
+ const logger = new testClientLogger_1.TestClientLogger(clients.all);
274
+ let seq = 0;
275
+ const ops = [];
276
+ const clientB_Revertibles = [];
277
+ const deltaCallback = (op, delta) => {
278
+ if (op.sequencedMessage === undefined) {
279
+ (0, revertibles_1.appendToMergeTreeDeltaRevertibles)(delta, clientB_Revertibles);
280
+ }
281
+ };
282
+ const clientBDriver = (0, testClient_1.createRevertDriver)(clients.B);
283
+ clientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));
284
+ clients.B.on("delta", deltaCallback);
285
+ ops.push(clients.B.makeOpMessage(clients.B.annotateRangeLocal(0, 4, { test: "B" }), ++seq));
286
+ ops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(1, 2), ++seq));
287
+ // revert to the original callback
288
+ clients.B.off("delta", deltaCallback);
289
+ ops.push(clients.C.makeOpMessage(clients.C.annotateRangeLocal(3, 4, { test: "C" }), ++seq));
290
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
291
+ logger.validate({ baseText: "134" });
292
+ try {
293
+ (0, revertibles_1.revertMergeTreeDeltaRevertibles)(clientBDriver, clientB_Revertibles.splice(0));
294
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
295
+ }
296
+ catch (e) {
297
+ throw logger.addLogsToError(e);
298
+ }
299
+ logger.validate({ baseText: "1234" });
300
+ });
301
+ describe("Revertibles work as expected when a pair of markers and text is involved", () => {
302
+ (0, test_pairwise_generator_1.generatePairwiseOptions)({
303
+ revertMarkerInsert: [true, undefined],
304
+ ackMarkerInsert: [true, undefined],
305
+ splitInsertTextRevertible: [true, undefined],
306
+ ackTextInsert: [true, undefined],
307
+ splitRemoveRevertible: [true, undefined],
308
+ ackTextRemove: [true, undefined],
309
+ ackUndo: [true, undefined],
310
+ }).forEach((options) => {
311
+ it(JSON.stringify(options), () => {
312
+ const clients = (0, testClientLogger_1.createClientsAtInitialState)({ initialState: "", options: {} }, "A", "B");
313
+ const logger = new testClientLogger_1.TestClientLogger(clients.all);
314
+ let seq = 0;
315
+ const ops = [];
316
+ const clientB_Revertibles = [];
317
+ const openNewUndoRedoTransaction = () => clientB_Revertibles.unshift([]);
318
+ // the test logger uses these callbacks, so preserve it
319
+ const clientBDriver = (0, testClient_1.createRevertDriver)(clients.B);
320
+ clientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));
321
+ clients.B.on("delta", (op, delta) => {
322
+ if (op.sequencedMessage === undefined && clientB_Revertibles.length > 0) {
323
+ (0, revertibles_1.appendToMergeTreeDeltaRevertibles)(delta, clientB_Revertibles[0]);
324
+ }
325
+ });
326
+ let afterUndoBaseText;
327
+ if (options.revertMarkerInsert) {
328
+ openNewUndoRedoTransaction();
329
+ afterUndoBaseText ?? (afterUndoBaseText = clients.B.getText());
330
+ }
331
+ ops.push(clients.B.makeOpMessage(clients.B.insertMarkerLocal(0, ops_1.ReferenceType.Simple), ++seq));
332
+ ops.push(clients.B.makeOpMessage(clients.B.insertMarkerLocal(1, ops_1.ReferenceType.Simple), ++seq));
333
+ if (options.ackMarkerInsert) {
334
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
335
+ logger.validate({ baseText: afterUndoBaseText });
336
+ }
337
+ if (options.splitInsertTextRevertible) {
338
+ openNewUndoRedoTransaction();
339
+ afterUndoBaseText ?? (afterUndoBaseText = clients.B.getText());
340
+ }
341
+ ops.push(clients.B.makeOpMessage(clients.B.insertTextLocal(1, "B"), ++seq));
342
+ if (options.ackTextInsert) {
343
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
344
+ logger.validate({ baseText: "B" });
345
+ }
346
+ if (options.splitRemoveRevertible) {
347
+ openNewUndoRedoTransaction();
348
+ afterUndoBaseText ?? (afterUndoBaseText = clients.B.getText());
349
+ }
350
+ ops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(1, 2), ++seq));
351
+ if (options.ackTextRemove) {
352
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
353
+ logger.validate({ baseText: "" });
354
+ }
355
+ const afterRevertBaseTest = clients.B.getText();
356
+ try {
357
+ const reverts = clientB_Revertibles.splice(0);
358
+ reverts.forEach((revert) => {
359
+ openNewUndoRedoTransaction();
360
+ (0, revertibles_1.revertMergeTreeDeltaRevertibles)(clientBDriver, revert);
361
+ });
362
+ }
363
+ catch (e) {
364
+ throw logger.addLogsToError(e);
365
+ }
366
+ if (options.ackUndo) {
367
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
368
+ logger.validate({ baseText: afterUndoBaseText });
369
+ }
370
+ try {
371
+ const reverts = clientB_Revertibles.splice(0);
372
+ reverts.forEach((revert) => {
373
+ (0, revertibles_1.revertMergeTreeDeltaRevertibles)(clientBDriver, revert);
374
+ });
375
+ }
376
+ catch (e) {
377
+ throw logger.addLogsToError(e);
378
+ }
379
+ ops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));
380
+ logger.validate({ baseText: afterRevertBaseTest });
381
+ });
382
+ });
383
+ });
384
+ });
385
+ //# sourceMappingURL=revertibles.spec.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"revertibles.spec.js","sourceRoot":"","sources":["../../src/test/revertibles.spec.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,mCAA0C;AAC1C,oFAAiF;AAEjF,gCAAuC;AACvC,gDAIwB;AACxB,4DAA6E;AAC7E,6CAAkD;AAClD,yDAAmF;AAEnF;;;;;;;;;;GAUG;AACH,SAAgB,WAAW;AAC1B,wDAAwD;AACxD,WAAqB,EACrB,UAAkB,EAClB,GAAe;IAEf,MAAM,EAAE,SAAS,EAAE,GAAG,WAAW,CAAC;IAClC,MAAM,MAAM,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC;IACrC,IAAA,eAAM,EAAC,OAAO,MAAM,KAAK,UAAU,EAAE,0BAA0B,UAAU,EAAE,CAAC,CAAC;IAE7E,MAAM,SAAS,GAAG,UAAyB,GAAG,IAAe;QAC5D,GAAG,EAAE,CAAC;QACN,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC;IACF,SAAS,CAAC,UAAU,CAAC,GAAG,SAAS,CAAC;IAElC,OAAO,GAAG,EAAE;QACX,SAAS,CAAC,UAAU,CAAC,GAAG,MAAM,CAAC;IAChC,CAAC,CAAC;AACH,CAAC;AAnBD,kCAmBC;AAED,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;IACtC,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;QACxB,MAAM,OAAO,GAAG,IAAA,8CAA2B,EAAC,EAAE,YAAY,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC5F,MAAM,MAAM,GAAG,IAAI,mCAAgB,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,MAAM,GAAG,GAAgC,EAAE,CAAC;QAE5C,MAAM,mBAAmB,GAA+B,EAAE,CAAC;QAC3D,MAAM,aAAa,GAAG,IAAA,+BAAkB,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACpD,aAAa,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAEtF,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;YACnC,IAAA,+CAAiC,EAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;QAEH,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAE7E,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC;QAEvC,IAAA,6CAA+B,EAAC,aAAa,EAAE,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAE9E,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACvD,MAAM,MAAM,GAAG,GAAG,CAAC;QAEnB,yDAAyD;QACzD,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,MAAM,MAAM,GAAG,WAAW,CAAC,iCAAa,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,MAAM,GAAG,WAAW,CAAC,iCAAa,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9E,MAAM,MAAM,GAAG,WAAW,CAAC,0CAAsB,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,CAAC;QACnF,MAAM,MAAM,GAAG,WAAW,CAAC,0CAAsB,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC,CAAC;QAEvF,IAAI;YACH,MAAM,OAAO,GAAG,IAAA,8CAA2B,EAC1C;gBACC,YAAY,EAAE,EAAE;gBAChB,OAAO,EAAE,EAAE;aACX,EACD,GAAG,CACH,CAAC;YAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,EAAE,EAAE;gBACjC,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;gBACvD,OAAO,CAAC,CAAC,CAAC,QAAQ,CACjB,OAAO,CAAC,CAAC,CAAC,aAAa,CACtB,QAAQ;gBACR,SAAS,CAAC,CAAC,GAAG,CAAC;gBACf,YAAY,CAAC,CAAC,EACd,OAAO,CAAC,CAAC,CAAC,YAAY;gBACtB,YAAY,CAAC,CAAC,CACd,CACD,CAAC;aACF;YAED,MAAM,WAAW,GAA+B,EAAE,CAAC;YACnD,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE;gBACpC,IAAA,+CAAiC,EAAC,KAAK,EAAE,WAAW,CAAC,CAAC;YACvD,CAAC,CAAC,CAAC;YAEH,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;YAErD,OAAO,CAAC,CAAC,CAAC,QAAQ,CACjB,OAAO,CAAC,CAAC,CAAC,aAAa,CACtB,EAAE;YACF,SAAS,CAAC,MAAM,GAAG,CAAC;YACpB,YAAY,CAAC,MAAM,EACnB,OAAO,CAAC,CAAC,CAAC,YAAY;YACtB,YAAY,CAAC,MAAM,CACnB,CACD,CAAC;YAEF,mEAAmE;YACnE,uEAAuE;YACvE,0EAA0E;YAC1E,uEAAuE;YACvE,QAAQ;YACR,IAAA,eAAM,EACL,SAAS,IAAI,MAAM,GAAG,CAAC,EACvB,gFAAgF,SAAS,eACxF,MAAM,GAAG,CACV,EAAE,CACF,CAAC;YACF,IAAA,eAAM,EACL,WAAW,IAAI,MAAM,GAAG,CAAC,EACzB,4EAA4E,WAAW,eACtF,MAAM,GAAG,CACV,EAAE,CACF,CAAC;SACF;gBAAS;YACT,MAAM,EAAE,CAAC;YACT,MAAM,EAAE,CAAC;YACT,MAAM,EAAE,CAAC;YACT,MAAM,EAAE,CAAC;SACT;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;QACxB,MAAM,OAAO,GAAG,IAAA,8CAA2B,EAAC,EAAE,YAAY,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC5F,MAAM,MAAM,GAAG,IAAI,mCAAgB,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,MAAM,GAAG,GAAgC,EAAE,CAAC;QAE5C,MAAM,mBAAmB,GAA+B,EAAE,CAAC;QAC3D,MAAM,aAAa,GAAG,IAAA,+BAAkB,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACpD,aAAa,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAEtF,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;YACnC,IAAA,+CAAiC,EAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;QAEH,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAE3E,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;QAEpC,IAAA,6CAA+B,EAAC,aAAa,EAAE,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAE9E,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,KAAK,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,SAAS,EAAE,kBAAkB,EAAE,IAAI;QAClE;YACC,IAAI,EAAE,2BAA2B;YACjC,WAAW,EAAE,CAAC;YACd,SAAS,EAAE,CAAC;YACZ,kBAAkB,EAAE,IAAI;SACxB;QACD;YACC,IAAI,EAAE,gDAAgD;YACtD,WAAW,EAAE,CAAC;YACd,SAAS,EAAE,CAAC;YACZ,iBAAiB,EAAE,IAAI;SACvB;KACD,EAAE;QACF,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE;YACb,MAAM,OAAO,GAAG,IAAA,8CAA2B,EAC1C,EAAE,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,EAAE,EACrC,GAAG,EACH,GAAG,EACH,GAAG,CACH,CAAC;YACF,MAAM,MAAM,GAAG,IAAI,mCAAgB,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACjD,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,MAAM,GAAG,GAAgC,EAAE,CAAC;YAE5C,MAAM,mBAAmB,GAA+B,EAAE,CAAC;YAC3D,MAAM,aAAa,GAAG,IAAA,+BAAkB,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACpD,aAAa,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;YAEtF,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;gBACnC,IAAA,+CAAiC,EAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;YAC/D,CAAC,CAAC,CAAC;YAEH,GAAG,CAAC,IAAI,CACP,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,WAAW,EAAE,SAAS,CAAC,EAAE,EAAE,GAAG,CAAC,CAClF,CAAC;YACF,GAAG,CAAC,IAAI,CACP,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,WAAW,EAAE,SAAS,CAAC,EAAE,EAAE,GAAG,CAAC,CAClF,CAAC;YAEF,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,kBAAkB,EAAE,CAAC,CAAC;YAElD,IAAA,6CAA+B,EAAC,aAAa,EAAE,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAE9E,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;KACH;IAED,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACzC,MAAM,OAAO,GAAG,IAAA,8CAA2B,EAC1C,EAAE,YAAY,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,EACpC,GAAG,EACH,GAAG,EACH,GAAG,CACH,CAAC;QACF,MAAM,MAAM,GAAG,IAAI,mCAAgB,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,MAAM,GAAG,GAAgC,EAAE,CAAC;QAE5C,MAAM,mBAAmB,GAA+B,EAAE,CAAC;QAC3D,MAAM,aAAa,GAAG,IAAA,+BAAkB,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACpD,aAAa,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAEtF,MAAM,mBAAmB,GAA+B,EAAE,CAAC;QAC3D,MAAM,aAAa,GAAG,IAAA,+BAAkB,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACpD,aAAa,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAEtF,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;YACnC,IAAA,+CAAiC,EAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;QAEH,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;YACnC,IAAA,+CAAiC,EAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;QAEH,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3E,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAE3E,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;QAEpC,IAAA,6CAA+B,EAAC,aAAa,EAAE,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9E,IAAA,6CAA+B,EAAC,aAAa,EAAE,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAE9E,wEAAwE;QACxE,0CAA0C;QAC1C,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAC1B,MAAM,OAAO,GAAG,IAAA,8CAA2B,EAAC,EAAE,YAAY,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC5F,MAAM,MAAM,GAAG,IAAI,mCAAgB,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,MAAM,GAAG,GAAgC,EAAE,CAAC;QAE5C,MAAM,mBAAmB,GAA+B,EAAE,CAAC;QAC3D,MAAM,aAAa,GAAG,IAAA,+BAAkB,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACpD,aAAa,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAEtF,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;YACnC,IAAA,+CAAiC,EAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;QACH,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAE1F,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;QAErC,IAAA,6CAA+B,EAAC,aAAa,EAAE,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAE9E,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QAC1D,MAAM,OAAO,GAAG,IAAA,8CAA2B,EAC1C,EAAE,YAAY,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,EACtC,GAAG,EACH,GAAG,EACH,GAAG,CACH,CAAC;QAEF,MAAM,MAAM,GAAG,IAAI,mCAAgB,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,MAAM,GAAG,GAAgC,EAAE,CAAC;QAE5C,MAAM,mBAAmB,GAA+B,EAAE,CAAC;QAC3D,uDAAuD;QACvD,MAAM,aAAa,GAAG,IAAA,+BAAkB,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,aAAa,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;YACnC,IAAA,+CAAiC,EAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;QAC/D,CAAC,CAAC;QACF,aAAa,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAEtF,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;QACrC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3E,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAC7E,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAE3E,kCAAkC;QAClC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;QAEtC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAE1E,IAAA,6CAA+B,EAAC,aAAa,EAAE,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAE9E,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAE1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,MAAM,OAAO,GAAG,IAAA,8CAA2B,EAC1C,EAAE,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,EAAE,EACrC,GAAG,EACH,GAAG,EACH,GAAG,CACH,CAAC;QAEF,MAAM,MAAM,GAAG,IAAI,mCAAgB,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,MAAM,GAAG,GAAgC,EAAE,CAAC;QAE5C,MAAM,mBAAmB,GAA+B,EAAE,CAAC;QAC3D,MAAM,aAAa,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;YACnC,IAAA,+CAAiC,EAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;QAC/D,CAAC,CAAC;QACF,MAAM,aAAa,GAAG,IAAA,+BAAkB,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACpD,aAAa,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAEtF,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;QACrC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3E,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3E,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAE7E,kCAAkC;QAClC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;QAEtC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAE1E,IAAA,6CAA+B,EAAC,aAAa,EAAE,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAE9E,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAE1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC/C,MAAM,OAAO,GAAG,IAAA,8CAA2B,EAC1C,EAAE,YAAY,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE,EACvC,GAAG,EACH,GAAG,EACH,GAAG,CACH,CAAC;QAEF,MAAM,MAAM,GAAG,IAAI,mCAAgB,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,MAAM,GAAG,GAAgC,EAAE,CAAC;QAE5C,MAAM,mBAAmB,GAA+B,EAAE,CAAC;QAC3D,MAAM,aAAa,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;YACnC,IAAA,+CAAiC,EAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;QAC/D,CAAC,CAAC;QACF,MAAM,aAAa,GAAG,IAAA,+BAAkB,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACpD,aAAa,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAEtF,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;QACrC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3E,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAC1F,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAE3E,kCAAkC;QAClC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;QAEtC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAE1E,IAAA,6CAA+B,EAAC,aAAa,EAAE,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAE9E,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAE1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oEAAoE,EAAE,GAAG,EAAE;QAC7E,MAAM,OAAO,GAAG,IAAA,8CAA2B,EAC1C,EAAE,YAAY,EAAE,WAAW,EAAE,OAAO,EAAE,EAAE,EAAE,EAC1C,GAAG,EACH,GAAG,EACH,GAAG,CACH,CAAC;QAEF,MAAM,MAAM,GAAG,IAAI,mCAAgB,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,MAAM,GAAG,GAAgC,EAAE,CAAC;QAE5C,MAAM,mBAAmB,GAA+B,EAAE,CAAC;QAC3D,MAAM,aAAa,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;YACnC,IAAI,EAAE,CAAC,gBAAgB,KAAK,SAAS,EAAE;gBACtC,IAAA,+CAAiC,EAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;aAC9D;QACF,CAAC,CAAC;QACF,MAAM,aAAa,GAAG,IAAA,+BAAkB,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACpD,aAAa,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAEtF,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;QACrC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAC5F,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAE3E,kCAAkC;QAClC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;QAEtC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAE5F,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;QAErC,IAAI;YACH,IAAA,6CAA+B,EAAC,aAAa,EAAE,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9E,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;SAC1E;QAAC,OAAO,CAAC,EAAE;YACX,MAAM,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;SAC/B;QAED,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,0EAA0E,EAAE,GAAG,EAAE;QACzF,IAAA,iDAAuB,EAAC;YACvB,kBAAkB,EAAE,CAAC,IAAI,EAAE,SAAS,CAAC;YACrC,eAAe,EAAE,CAAC,IAAI,EAAE,SAAS,CAAC;YAClC,yBAAyB,EAAE,CAAC,IAAI,EAAE,SAAS,CAAC;YAC5C,aAAa,EAAE,CAAC,IAAI,EAAE,SAAS,CAAC;YAChC,qBAAqB,EAAE,CAAC,IAAI,EAAE,SAAS,CAAC;YACxC,aAAa,EAAE,CAAC,IAAI,EAAE,SAAS,CAAC;YAChC,OAAO,EAAE,CAAC,IAAI,EAAE,SAAS,CAAC;SAC1B,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;YACtB,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE;gBAChC,MAAM,OAAO,GAAG,IAAA,8CAA2B,EAC1C,EAAE,YAAY,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,EACjC,GAAG,EACH,GAAG,CACH,CAAC;gBAEF,MAAM,MAAM,GAAG,IAAI,mCAAgB,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBACjD,IAAI,GAAG,GAAG,CAAC,CAAC;gBACZ,MAAM,GAAG,GAAgC,EAAE,CAAC;gBAE5C,MAAM,mBAAmB,GAAiC,EAAE,CAAC;gBAC7D,MAAM,0BAA0B,GAAG,GAAG,EAAE,CAAC,mBAAmB,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;gBACzE,uDAAuD;gBACvD,MAAM,aAAa,GAAG,IAAA,+BAAkB,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACpD,aAAa,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,CACvC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;gBAC9C,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;oBACnC,IAAI,EAAE,CAAC,gBAAgB,KAAK,SAAS,IAAI,mBAAmB,CAAC,MAAM,GAAG,CAAC,EAAE;wBACxE,IAAA,+CAAiC,EAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC;qBACjE;gBACF,CAAC,CAAC,CAAC;gBACH,IAAI,iBAAqC,CAAC;gBAC1C,IAAI,OAAO,CAAC,kBAAkB,EAAE;oBAC/B,0BAA0B,EAAE,CAAC;oBAC7B,iBAAiB,KAAjB,iBAAiB,GAAK,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,EAAC;iBAC1C;gBACD,GAAG,CAAC,IAAI,CACP,OAAO,CAAC,CAAC,CAAC,aAAa,CACtB,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,EAAE,mBAAa,CAAC,MAAM,CAAC,EACpD,EAAE,GAAG,CACL,CACD,CAAC;gBACF,GAAG,CAAC,IAAI,CACP,OAAO,CAAC,CAAC,CAAC,aAAa,CACtB,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,EAAE,mBAAa,CAAC,MAAM,CAAC,EACpD,EAAE,GAAG,CACL,CACD,CAAC;gBAEF,IAAI,OAAO,CAAC,eAAe,EAAE;oBAC5B,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBAC1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,iBAAiB,EAAE,CAAC,CAAC;iBACjD;gBAED,IAAI,OAAO,CAAC,yBAAyB,EAAE;oBACtC,0BAA0B,EAAE,CAAC;oBAC7B,iBAAiB,KAAjB,iBAAiB,GAAK,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,EAAC;iBAC1C;gBACD,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;gBAC5E,IAAI,OAAO,CAAC,aAAa,EAAE;oBAC1B,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBAC1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC;iBACnC;gBAED,IAAI,OAAO,CAAC,qBAAqB,EAAE;oBAClC,0BAA0B,EAAE,CAAC;oBAC7B,iBAAiB,KAAjB,iBAAiB,GAAK,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,EAAC;iBAC1C;gBAED,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;gBAC3E,IAAI,OAAO,CAAC,aAAa,EAAE;oBAC1B,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBAC1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;iBAClC;gBAED,MAAM,mBAAmB,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;gBAChD,IAAI;oBACH,MAAM,OAAO,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAC9C,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE;wBAC1B,0BAA0B,EAAE,CAAC;wBAC7B,IAAA,6CAA+B,EAAC,aAAa,EAAE,MAAM,CAAC,CAAC;oBACxD,CAAC,CAAC,CAAC;iBACH;gBAAC,OAAO,CAAC,EAAE;oBACX,MAAM,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;iBAC/B;gBAED,IAAI,OAAO,CAAC,OAAO,EAAE;oBACpB,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBAC1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,iBAAiB,EAAE,CAAC,CAAC;iBACjD;gBAED,IAAI;oBACH,MAAM,OAAO,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAC9C,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE;wBAC1B,IAAA,6CAA+B,EAAC,aAAa,EAAE,MAAM,CAAC,CAAC;oBACxD,CAAC,CAAC,CAAC;iBACH;gBAAC,OAAO,CAAC,EAAE;oBACX,MAAM,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;iBAC/B;gBAED,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC1E,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,mBAAmB,EAAE,CAAC,CAAC;YACpD,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\nimport { generatePairwiseOptions } from \"@fluid-private/test-pairwise-generator\";\nimport { ISequencedDocumentMessage } from \"@fluidframework/protocol-definitions\";\nimport { ReferenceType } from \"../ops\";\nimport {\n\tappendToMergeTreeDeltaRevertibles,\n\tMergeTreeDeltaRevertible,\n\trevertMergeTreeDeltaRevertibles,\n} from \"../revertibles\";\nimport { TrackingGroup, UnorderedTrackingGroup } from \"../mergeTreeTracking\";\nimport { createRevertDriver } from \"./testClient\";\nimport { createClientsAtInitialState, TestClientLogger } from \"./testClientLogger\";\n\n/**\n * Run a custom \"spy function\" every time the given method is invoked.\n * @param methodClass - the class that has the method\n * @param methodName - the name of the method\n * @param spy - the spy function to run alongside the method\n * @returns a function which will remove the spy function when invoked. Should be called exactly once\n * after the spy is no longer needed.\n *\n * This method is duplicated between shared-tree test code, and should eventually\n * be merged with the implementation that lives there\n */\nexport function spyOnMethod(\n\t// eslint-disable-next-line @typescript-eslint/ban-types\n\tmethodClass: Function,\n\tmethodName: string,\n\tspy: () => void,\n): () => void {\n\tconst { prototype } = methodClass;\n\tconst method = prototype[methodName];\n\tassert(typeof method === \"function\", `Method does not exist: ${methodName}`);\n\n\tconst methodSpy = function (this: unknown, ...args: unknown[]): unknown {\n\t\tspy();\n\t\treturn method.call(this, ...args);\n\t};\n\tprototype[methodName] = methodSpy;\n\n\treturn () => {\n\t\tprototype[methodName] = method;\n\t};\n}\n\ndescribe(\"MergeTree.Revertibles\", () => {\n\tit(\"revert insert\", () => {\n\t\tconst clients = createClientsAtInitialState({ initialState: \"123\", options: {} }, \"A\", \"B\");\n\t\tconst logger = new TestClientLogger(clients.all);\n\t\tlet seq = 0;\n\t\tconst ops: ISequencedDocumentMessage[] = [];\n\n\t\tconst clientB_Revertibles: MergeTreeDeltaRevertible[] = [];\n\t\tconst clientBDriver = createRevertDriver(clients.B);\n\t\tclientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));\n\n\t\tclients.B.on(\"delta\", (op, delta) => {\n\t\t\tappendToMergeTreeDeltaRevertibles(delta, clientB_Revertibles);\n\t\t});\n\n\t\tops.push(clients.B.makeOpMessage(clients.B.insertTextLocal(0, \"BB\"), ++seq));\n\n\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\t\tlogger.validate({ baseText: \"BB123\" });\n\n\t\trevertMergeTreeDeltaRevertibles(clientBDriver, clientB_Revertibles.splice(0));\n\n\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\t\tlogger.validate({ baseText: \"123\" });\n\t});\n\n\tit(\"has reasonable asymptotics in face of remove\", () => {\n\t\tconst length = 100;\n\n\t\t// track the amount of tracking group linking that occurs\n\t\tlet linkCount = 0;\n\t\tlet unlinkCount = 0;\n\n\t\tconst unspy1 = spyOnMethod(TrackingGroup, \"link\", () => (linkCount += 1));\n\t\tconst unspy2 = spyOnMethod(TrackingGroup, \"unlink\", () => (unlinkCount += 1));\n\t\tconst unspy3 = spyOnMethod(UnorderedTrackingGroup, \"link\", () => (linkCount += 1));\n\t\tconst unspy4 = spyOnMethod(UnorderedTrackingGroup, \"unlink\", () => (unlinkCount += 1));\n\n\t\ttry {\n\t\t\tconst clients = createClientsAtInitialState(\n\t\t\t\t{\n\t\t\t\t\tinitialState: \"\",\n\t\t\t\t\toptions: {},\n\t\t\t\t},\n\t\t\t\t\"A\",\n\t\t\t);\n\n\t\t\tfor (let i = 1; i <= length; i++) {\n\t\t\t\tconst insertOp = clients.A.insertTextLocal(i - 1, \"a\");\n\t\t\t\tclients.A.applyMsg(\n\t\t\t\t\tclients.A.makeOpMessage(\n\t\t\t\t\t\tinsertOp,\n\t\t\t\t\t\t/* seq */ i + 1,\n\t\t\t\t\t\t/* refSeq */ i,\n\t\t\t\t\t\tclients.A.longClientId,\n\t\t\t\t\t\t/* minSeq */ 1,\n\t\t\t\t\t),\n\t\t\t\t);\n\t\t\t}\n\n\t\t\tconst revertibles: MergeTreeDeltaRevertible[] = [];\n\t\t\tclients.A.on(\"delta\", (_op, delta) => {\n\t\t\t\tappendToMergeTreeDeltaRevertibles(delta, revertibles);\n\t\t\t});\n\n\t\t\tconst op = clients.A.removeRangeLocal(0, length - 1);\n\n\t\t\tclients.A.applyMsg(\n\t\t\t\tclients.A.makeOpMessage(\n\t\t\t\t\top,\n\t\t\t\t\t/* seq */ length + 1,\n\t\t\t\t\t/* refSeq */ length,\n\t\t\t\t\tclients.A.longClientId,\n\t\t\t\t\t/* minSeq */ length,\n\t\t\t\t),\n\t\t\t);\n\n\t\t\t// the below checks act as a proxy for the asymptotics of undo-redo\n\t\t\t// linking. they are perhaps a bit more strict than necessary. if these\n\t\t\t// tests are failing and the number of calls is still within a sane limit,\n\t\t\t// it should be fine to update these checks to allow a larger number of\n\t\t\t// calls\n\t\t\tassert(\n\t\t\t\tlinkCount <= length * 3,\n\t\t\t\t`expected tracking group link to occur at most three times per segment. found ${linkCount} instead of ${\n\t\t\t\t\tlength * 3\n\t\t\t\t}`,\n\t\t\t);\n\t\t\tassert(\n\t\t\t\tunlinkCount <= length * 2,\n\t\t\t\t`expected tracking group unlink to occur at most twice per segment. found ${unlinkCount} instead of ${\n\t\t\t\t\tlength * 2\n\t\t\t\t}`,\n\t\t\t);\n\t\t} finally {\n\t\t\tunspy1();\n\t\t\tunspy2();\n\t\t\tunspy3();\n\t\t\tunspy4();\n\t\t}\n\t});\n\n\tit(\"revert remove\", () => {\n\t\tconst clients = createClientsAtInitialState({ initialState: \"123\", options: {} }, \"A\", \"B\");\n\t\tconst logger = new TestClientLogger(clients.all);\n\t\tlet seq = 0;\n\t\tconst ops: ISequencedDocumentMessage[] = [];\n\n\t\tconst clientB_Revertibles: MergeTreeDeltaRevertible[] = [];\n\t\tconst clientBDriver = createRevertDriver(clients.B);\n\t\tclientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));\n\n\t\tclients.B.on(\"delta\", (op, delta) => {\n\t\t\tappendToMergeTreeDeltaRevertibles(delta, clientB_Revertibles);\n\t\t});\n\n\t\tops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(0, 1), ++seq));\n\n\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\t\tlogger.validate({ baseText: \"23\" });\n\n\t\trevertMergeTreeDeltaRevertibles(clientBDriver, clientB_Revertibles.splice(0));\n\n\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\t\tlogger.validate({ baseText: \"123\" });\n\t});\n\n\tfor (const { name, removeStart, removeEnd, expectedPostRemove } of [\n\t\t{\n\t\t\tname: \"revert overlapping remove\",\n\t\t\tremoveStart: 0,\n\t\t\tremoveEnd: 1,\n\t\t\texpectedPostRemove: \"23\",\n\t\t},\n\t\t{\n\t\t\tname: \"revert overlapping remove of multiple segments\",\n\t\t\tremoveStart: 0,\n\t\t\tremoveEnd: 2,\n\t\t\texpectedPreRemove: \"23\",\n\t\t},\n\t]) {\n\t\tit(name, () => {\n\t\t\tconst clients = createClientsAtInitialState(\n\t\t\t\t{ initialState: \"1-23\", options: {} },\n\t\t\t\t\"A\",\n\t\t\t\t\"B\",\n\t\t\t\t\"C\",\n\t\t\t);\n\t\t\tconst logger = new TestClientLogger(clients.all);\n\t\t\tlet seq = 0;\n\t\t\tconst ops: ISequencedDocumentMessage[] = [];\n\n\t\t\tconst clientB_Revertibles: MergeTreeDeltaRevertible[] = [];\n\t\t\tconst clientBDriver = createRevertDriver(clients.B);\n\t\t\tclientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));\n\n\t\t\tclients.B.on(\"delta\", (op, delta) => {\n\t\t\t\tappendToMergeTreeDeltaRevertibles(delta, clientB_Revertibles);\n\t\t\t});\n\n\t\t\tops.push(\n\t\t\t\tclients.C.makeOpMessage(clients.C.removeRangeLocal(removeStart, removeEnd), ++seq),\n\t\t\t);\n\t\t\tops.push(\n\t\t\t\tclients.B.makeOpMessage(clients.B.removeRangeLocal(removeStart, removeEnd), ++seq),\n\t\t\t);\n\n\t\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\t\t\tlogger.validate({ baseText: expectedPostRemove });\n\n\t\t\trevertMergeTreeDeltaRevertibles(clientBDriver, clientB_Revertibles.splice(0));\n\n\t\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\t\t\tlogger.validate({ baseText: \"123\" });\n\t\t});\n\t}\n\n\tit(\"revert two overlapping removes\", () => {\n\t\tconst clients = createClientsAtInitialState(\n\t\t\t{ initialState: \"123\", options: {} },\n\t\t\t\"A\",\n\t\t\t\"B\",\n\t\t\t\"C\",\n\t\t);\n\t\tconst logger = new TestClientLogger(clients.all);\n\t\tlet seq = 0;\n\t\tconst ops: ISequencedDocumentMessage[] = [];\n\n\t\tconst clientB_Revertibles: MergeTreeDeltaRevertible[] = [];\n\t\tconst clientBDriver = createRevertDriver(clients.B);\n\t\tclientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));\n\n\t\tconst clientC_Revertibles: MergeTreeDeltaRevertible[] = [];\n\t\tconst clientCDriver = createRevertDriver(clients.C);\n\t\tclientCDriver.submitOpCallback = (op) => ops.push(clients.C.makeOpMessage(op, ++seq));\n\n\t\tclients.B.on(\"delta\", (op, delta) => {\n\t\t\tappendToMergeTreeDeltaRevertibles(delta, clientB_Revertibles);\n\t\t});\n\n\t\tclients.C.on(\"delta\", (op, delta) => {\n\t\t\tappendToMergeTreeDeltaRevertibles(delta, clientC_Revertibles);\n\t\t});\n\n\t\tops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(0, 1), ++seq));\n\t\tops.push(clients.C.makeOpMessage(clients.C.removeRangeLocal(0, 1), ++seq));\n\n\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\t\tlogger.validate({ baseText: \"23\" });\n\n\t\trevertMergeTreeDeltaRevertibles(clientBDriver, clientB_Revertibles.splice(0));\n\t\trevertMergeTreeDeltaRevertibles(clientCDriver, clientC_Revertibles.splice(0));\n\n\t\t// \"123\" would be the ideal final state, but due to current limitations,\n\t\t// the eventual consistent state is \"1123\"\n\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\t\tlogger.validate({ baseText: \"1123\" });\n\t});\n\n\tit(\"revert annotate\", () => {\n\t\tconst clients = createClientsAtInitialState({ initialState: \"123\", options: {} }, \"A\", \"B\");\n\t\tconst logger = new TestClientLogger(clients.all);\n\t\tlet seq = 0;\n\t\tconst ops: ISequencedDocumentMessage[] = [];\n\n\t\tconst clientB_Revertibles: MergeTreeDeltaRevertible[] = [];\n\t\tconst clientBDriver = createRevertDriver(clients.B);\n\t\tclientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));\n\n\t\tclients.B.on(\"delta\", (op, delta) => {\n\t\t\tappendToMergeTreeDeltaRevertibles(delta, clientB_Revertibles);\n\t\t});\n\t\tops.push(clients.B.makeOpMessage(clients.B.annotateRangeLocal(0, 1, { test: 1 }), ++seq));\n\n\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\t\tlogger.validate({ baseText: \"123\" });\n\n\t\trevertMergeTreeDeltaRevertibles(clientBDriver, clientB_Revertibles.splice(0));\n\n\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\t\tlogger.validate({ baseText: \"123\" });\n\t});\n\n\tit(\"Remove All Original Text and Insert then Revert\", () => {\n\t\tconst clients = createClientsAtInitialState(\n\t\t\t{ initialState: \"1-2--\", options: {} },\n\t\t\t\"A\",\n\t\t\t\"B\",\n\t\t\t\"C\",\n\t\t);\n\n\t\tconst logger = new TestClientLogger(clients.all);\n\t\tlet seq = 0;\n\t\tconst ops: ISequencedDocumentMessage[] = [];\n\n\t\tconst clientB_Revertibles: MergeTreeDeltaRevertible[] = [];\n\t\t// the test logger uses these callbacks, so preserve it\n\t\tconst clientBDriver = createRevertDriver(clients.B);\n\t\tconst deltaCallback = (op, delta) => {\n\t\t\tappendToMergeTreeDeltaRevertibles(delta, clientB_Revertibles);\n\t\t};\n\t\tclientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));\n\n\t\tclients.B.on(\"delta\", deltaCallback);\n\t\tops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(0, 1), ++seq));\n\t\tops.push(clients.B.makeOpMessage(clients.B.insertTextLocal(0, \"BB\"), ++seq));\n\t\tops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(2, 3), ++seq));\n\n\t\t// revert to the original callback\n\t\tclients.B.off(\"delta\", deltaCallback);\n\n\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\n\t\trevertMergeTreeDeltaRevertibles(clientBDriver, clientB_Revertibles.splice(0));\n\n\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\n\t\tlogger.validate({ baseText: \"12\" });\n\t});\n\n\tit(\"Re-Insert at position 0 in empty string\", () => {\n\t\tconst clients = createClientsAtInitialState(\n\t\t\t{ initialState: \"BBC-\", options: {} },\n\t\t\t\"A\",\n\t\t\t\"B\",\n\t\t\t\"C\",\n\t\t);\n\n\t\tconst logger = new TestClientLogger(clients.all);\n\t\tlet seq = 0;\n\t\tconst ops: ISequencedDocumentMessage[] = [];\n\n\t\tconst clientB_Revertibles: MergeTreeDeltaRevertible[] = [];\n\t\tconst deltaCallback = (op, delta) => {\n\t\t\tappendToMergeTreeDeltaRevertibles(delta, clientB_Revertibles);\n\t\t};\n\t\tconst clientBDriver = createRevertDriver(clients.B);\n\t\tclientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));\n\n\t\tclients.B.on(\"delta\", deltaCallback);\n\t\tops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(2, 3), ++seq));\n\t\tops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(0, 1), ++seq));\n\t\tops.push(clients.B.makeOpMessage(clients.B.insertTextLocal(1, \"BB\"), ++seq));\n\n\t\t// revert to the original callback\n\t\tclients.B.off(\"delta\", deltaCallback);\n\n\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\n\t\trevertMergeTreeDeltaRevertibles(clientBDriver, clientB_Revertibles.splice(0));\n\n\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\n\t\tlogger.validate({ baseText: \"BBC\" });\n\t});\n\n\tit(\"Revert remove to empty with annotate\", () => {\n\t\tconst clients = createClientsAtInitialState(\n\t\t\t{ initialState: \"1-23--\", options: {} },\n\t\t\t\"A\",\n\t\t\t\"B\",\n\t\t\t\"C\",\n\t\t);\n\n\t\tconst logger = new TestClientLogger(clients.all);\n\t\tlet seq = 0;\n\t\tconst ops: ISequencedDocumentMessage[] = [];\n\n\t\tconst clientB_Revertibles: MergeTreeDeltaRevertible[] = [];\n\t\tconst deltaCallback = (op, delta) => {\n\t\t\tappendToMergeTreeDeltaRevertibles(delta, clientB_Revertibles);\n\t\t};\n\t\tconst clientBDriver = createRevertDriver(clients.B);\n\t\tclientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));\n\n\t\tclients.B.on(\"delta\", deltaCallback);\n\t\tops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(0, 2), ++seq));\n\t\tops.push(clients.B.makeOpMessage(clients.B.annotateRangeLocal(0, 1, { test: 1 }), ++seq));\n\t\tops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(0, 1), ++seq));\n\n\t\t// revert to the original callback\n\t\tclients.B.off(\"delta\", deltaCallback);\n\n\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\n\t\trevertMergeTreeDeltaRevertibles(clientBDriver, clientB_Revertibles.splice(0));\n\n\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\n\t\tlogger.validate({ baseText: \"123\" });\n\t});\n\n\tit(\"Revert Local annotate and remove with intersecting remote annotate\", () => {\n\t\tconst clients = createClientsAtInitialState(\n\t\t\t{ initialState: \"1234-----\", options: {} },\n\t\t\t\"A\",\n\t\t\t\"B\",\n\t\t\t\"C\",\n\t\t);\n\n\t\tconst logger = new TestClientLogger(clients.all);\n\t\tlet seq = 0;\n\t\tconst ops: ISequencedDocumentMessage[] = [];\n\n\t\tconst clientB_Revertibles: MergeTreeDeltaRevertible[] = [];\n\t\tconst deltaCallback = (op, delta) => {\n\t\t\tif (op.sequencedMessage === undefined) {\n\t\t\t\tappendToMergeTreeDeltaRevertibles(delta, clientB_Revertibles);\n\t\t\t}\n\t\t};\n\t\tconst clientBDriver = createRevertDriver(clients.B);\n\t\tclientBDriver.submitOpCallback = (op) => ops.push(clients.B.makeOpMessage(op, ++seq));\n\n\t\tclients.B.on(\"delta\", deltaCallback);\n\t\tops.push(clients.B.makeOpMessage(clients.B.annotateRangeLocal(0, 4, { test: \"B\" }), ++seq));\n\t\tops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(1, 2), ++seq));\n\n\t\t// revert to the original callback\n\t\tclients.B.off(\"delta\", deltaCallback);\n\n\t\tops.push(clients.C.makeOpMessage(clients.C.annotateRangeLocal(3, 4, { test: \"C\" }), ++seq));\n\n\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\t\tlogger.validate({ baseText: \"134\" });\n\n\t\ttry {\n\t\t\trevertMergeTreeDeltaRevertibles(clientBDriver, clientB_Revertibles.splice(0));\n\t\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\t\t} catch (e) {\n\t\t\tthrow logger.addLogsToError(e);\n\t\t}\n\n\t\tlogger.validate({ baseText: \"1234\" });\n\t});\n\n\tdescribe(\"Revertibles work as expected when a pair of markers and text is involved\", () => {\n\t\tgeneratePairwiseOptions({\n\t\t\trevertMarkerInsert: [true, undefined],\n\t\t\tackMarkerInsert: [true, undefined],\n\t\t\tsplitInsertTextRevertible: [true, undefined],\n\t\t\tackTextInsert: [true, undefined],\n\t\t\tsplitRemoveRevertible: [true, undefined],\n\t\t\tackTextRemove: [true, undefined],\n\t\t\tackUndo: [true, undefined],\n\t\t}).forEach((options) => {\n\t\t\tit(JSON.stringify(options), () => {\n\t\t\t\tconst clients = createClientsAtInitialState(\n\t\t\t\t\t{ initialState: \"\", options: {} },\n\t\t\t\t\t\"A\",\n\t\t\t\t\t\"B\",\n\t\t\t\t);\n\n\t\t\t\tconst logger = new TestClientLogger(clients.all);\n\t\t\t\tlet seq = 0;\n\t\t\t\tconst ops: ISequencedDocumentMessage[] = [];\n\n\t\t\t\tconst clientB_Revertibles: MergeTreeDeltaRevertible[][] = [];\n\t\t\t\tconst openNewUndoRedoTransaction = () => clientB_Revertibles.unshift([]);\n\t\t\t\t// the test logger uses these callbacks, so preserve it\n\t\t\t\tconst clientBDriver = createRevertDriver(clients.B);\n\t\t\t\tclientBDriver.submitOpCallback = (op) =>\n\t\t\t\t\tops.push(clients.B.makeOpMessage(op, ++seq));\n\t\t\t\tclients.B.on(\"delta\", (op, delta) => {\n\t\t\t\t\tif (op.sequencedMessage === undefined && clientB_Revertibles.length > 0) {\n\t\t\t\t\t\tappendToMergeTreeDeltaRevertibles(delta, clientB_Revertibles[0]);\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t\tlet afterUndoBaseText: string | undefined;\n\t\t\t\tif (options.revertMarkerInsert) {\n\t\t\t\t\topenNewUndoRedoTransaction();\n\t\t\t\t\tafterUndoBaseText ??= clients.B.getText();\n\t\t\t\t}\n\t\t\t\tops.push(\n\t\t\t\t\tclients.B.makeOpMessage(\n\t\t\t\t\t\tclients.B.insertMarkerLocal(0, ReferenceType.Simple),\n\t\t\t\t\t\t++seq,\n\t\t\t\t\t),\n\t\t\t\t);\n\t\t\t\tops.push(\n\t\t\t\t\tclients.B.makeOpMessage(\n\t\t\t\t\t\tclients.B.insertMarkerLocal(1, ReferenceType.Simple),\n\t\t\t\t\t\t++seq,\n\t\t\t\t\t),\n\t\t\t\t);\n\n\t\t\t\tif (options.ackMarkerInsert) {\n\t\t\t\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\t\t\t\t\tlogger.validate({ baseText: afterUndoBaseText });\n\t\t\t\t}\n\n\t\t\t\tif (options.splitInsertTextRevertible) {\n\t\t\t\t\topenNewUndoRedoTransaction();\n\t\t\t\t\tafterUndoBaseText ??= clients.B.getText();\n\t\t\t\t}\n\t\t\t\tops.push(clients.B.makeOpMessage(clients.B.insertTextLocal(1, \"B\"), ++seq));\n\t\t\t\tif (options.ackTextInsert) {\n\t\t\t\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\t\t\t\t\tlogger.validate({ baseText: \"B\" });\n\t\t\t\t}\n\n\t\t\t\tif (options.splitRemoveRevertible) {\n\t\t\t\t\topenNewUndoRedoTransaction();\n\t\t\t\t\tafterUndoBaseText ??= clients.B.getText();\n\t\t\t\t}\n\n\t\t\t\tops.push(clients.B.makeOpMessage(clients.B.removeRangeLocal(1, 2), ++seq));\n\t\t\t\tif (options.ackTextRemove) {\n\t\t\t\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\t\t\t\t\tlogger.validate({ baseText: \"\" });\n\t\t\t\t}\n\n\t\t\t\tconst afterRevertBaseTest = clients.B.getText();\n\t\t\t\ttry {\n\t\t\t\t\tconst reverts = clientB_Revertibles.splice(0);\n\t\t\t\t\treverts.forEach((revert) => {\n\t\t\t\t\t\topenNewUndoRedoTransaction();\n\t\t\t\t\t\trevertMergeTreeDeltaRevertibles(clientBDriver, revert);\n\t\t\t\t\t});\n\t\t\t\t} catch (e) {\n\t\t\t\t\tthrow logger.addLogsToError(e);\n\t\t\t\t}\n\n\t\t\t\tif (options.ackUndo) {\n\t\t\t\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\t\t\t\t\tlogger.validate({ baseText: afterUndoBaseText });\n\t\t\t\t}\n\n\t\t\t\ttry {\n\t\t\t\t\tconst reverts = clientB_Revertibles.splice(0);\n\t\t\t\t\treverts.forEach((revert) => {\n\t\t\t\t\t\trevertMergeTreeDeltaRevertibles(clientBDriver, revert);\n\t\t\t\t\t});\n\t\t\t\t} catch (e) {\n\t\t\t\t\tthrow logger.addLogsToError(e);\n\t\t\t\t}\n\n\t\t\t\tops.splice(0).forEach((op) => clients.all.forEach((c) => c.applyMsg(op)));\n\t\t\t\tlogger.validate({ baseText: afterRevertBaseTest });\n\t\t\t});\n\t\t});\n\t});\n});\n"]}
@@ -0,0 +1,6 @@
1
+ /*!
2
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
3
+ * Licensed under the MIT License.
4
+ */
5
+ export {};
6
+ //# sourceMappingURL=segmentGroupCollection.spec.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"segmentGroupCollection.spec.d.ts","sourceRoot":"","sources":["../../src/test/segmentGroupCollection.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG"}
@@ -0,0 +1,60 @@
1
+ "use strict";
2
+ /*!
3
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
4
+ * Licensed under the MIT License.
5
+ */
6
+ Object.defineProperty(exports, "__esModule", { value: true });
7
+ const assert_1 = require("assert");
8
+ const textSegment_1 = require("../textSegment");
9
+ describe("segmentGroupCollection", () => {
10
+ let segment;
11
+ beforeEach(() => {
12
+ segment = textSegment_1.TextSegment.make("abc");
13
+ });
14
+ it(".empty", () => {
15
+ (0, assert_1.strict)(segment.segmentGroups.empty);
16
+ });
17
+ it(".size", () => {
18
+ assert_1.strict.equal(segment.segmentGroups.size, 0);
19
+ });
20
+ it(".enqueue", () => {
21
+ const segmentGroup = { segments: [], localSeq: 1, refSeq: 0 };
22
+ segment.segmentGroups.enqueue(segmentGroup);
23
+ (0, assert_1.strict)(!segment.segmentGroups.empty);
24
+ assert_1.strict.equal(segment.segmentGroups.size, 1);
25
+ assert_1.strict.equal(segmentGroup.segments.length, 1);
26
+ assert_1.strict.equal(segmentGroup.segments[0], segment);
27
+ });
28
+ it(".dequeue", () => {
29
+ const segmentGroup = { segments: [], localSeq: 1, refSeq: 0 };
30
+ segment.segmentGroups.enqueue(segmentGroup);
31
+ const segmentGroupCount = 6;
32
+ while (segment.segmentGroups.size < segmentGroupCount) {
33
+ segment.segmentGroups.enqueue({ segments: [], localSeq: 1, refSeq: 0 });
34
+ }
35
+ const dequeuedSegmentGroup = segment.segmentGroups.dequeue();
36
+ assert_1.strict.equal(segment.segmentGroups.size, segmentGroupCount - 1);
37
+ assert_1.strict.equal(dequeuedSegmentGroup?.segments.length, 1);
38
+ assert_1.strict.equal(dequeuedSegmentGroup.segments[0], segment);
39
+ assert_1.strict.equal(dequeuedSegmentGroup, segmentGroup);
40
+ });
41
+ it(".copyTo", () => {
42
+ const segmentGroupCount = 6;
43
+ while (segment.segmentGroups.size < segmentGroupCount) {
44
+ segment.segmentGroups.enqueue({ segments: [], localSeq: 1, refSeq: 0 });
45
+ }
46
+ const segmentCopy = textSegment_1.TextSegment.make("");
47
+ segment.segmentGroups.copyTo(segmentCopy);
48
+ assert_1.strict.equal(segment.segmentGroups.size, segmentGroupCount);
49
+ assert_1.strict.equal(segmentCopy.segmentGroups.size, segmentGroupCount);
50
+ while (!segment.segmentGroups.empty || !segmentCopy.segmentGroups.empty) {
51
+ const segmentGroup = segment.segmentGroups.dequeue();
52
+ const copySegmentGroup = segmentCopy.segmentGroups.dequeue();
53
+ assert_1.strict.equal(segmentGroup, copySegmentGroup);
54
+ assert_1.strict.equal(segmentGroup?.segments.length, 2);
55
+ assert_1.strict.equal(segmentGroup.segments[0], segment);
56
+ assert_1.strict.equal(segmentGroup.segments[1], segmentCopy);
57
+ }
58
+ });
59
+ });
60
+ //# sourceMappingURL=segmentGroupCollection.spec.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"segmentGroupCollection.spec.js","sourceRoot":"","sources":["../../src/test/segmentGroupCollection.spec.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,mCAA0C;AAE1C,gDAA6C;AAE7C,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;IACvC,IAAI,OAAiB,CAAC;IACtB,UAAU,CAAC,GAAG,EAAE;QACf,OAAO,GAAG,yBAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;QACjB,IAAA,eAAM,EAAC,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE;QAChB,eAAM,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE;QACnB,MAAM,YAAY,GAAG,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QAC9D,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QAE5C,IAAA,eAAM,EAAC,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QACrC,eAAM,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC5C,eAAM,CAAC,KAAK,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC9C,eAAM,CAAC,KAAK,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE;QACnB,MAAM,YAAY,GAAG,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QAC9D,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QAC5C,MAAM,iBAAiB,GAAG,CAAC,CAAC;QAC5B,OAAO,OAAO,CAAC,aAAa,CAAC,IAAI,GAAG,iBAAiB,EAAE;YACtD,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;SACxE;QAED,MAAM,oBAAoB,GAAG,OAAO,CAAC,aAAa,CAAC,OAAO,EAAE,CAAC;QAE7D,eAAM,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,EAAE,iBAAiB,GAAG,CAAC,CAAC,CAAC;QAChE,eAAM,CAAC,KAAK,CAAC,oBAAoB,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACvD,eAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QACxD,eAAM,CAAC,KAAK,CAAC,oBAAoB,EAAE,YAAY,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;QAClB,MAAM,iBAAiB,GAAG,CAAC,CAAC;QAC5B,OAAO,OAAO,CAAC,aAAa,CAAC,IAAI,GAAG,iBAAiB,EAAE;YACtD,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;SACxE;QAED,MAAM,WAAW,GAAG,yBAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzC,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAE1C,eAAM,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAC;QAC5D,eAAM,CAAC,KAAK,CAAC,WAAW,CAAC,aAAa,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAC;QAEhE,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,KAAK,EAAE;YACxE,MAAM,YAAY,GAAG,OAAO,CAAC,aAAa,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,gBAAgB,GAAG,WAAW,CAAC,aAAa,CAAC,OAAO,EAAE,CAAC;YAE7D,eAAM,CAAC,KAAK,CAAC,YAAY,EAAE,gBAAgB,CAAC,CAAC;YAC7C,eAAM,CAAC,KAAK,CAAC,YAAY,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC/C,eAAM,CAAC,KAAK,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAChD,eAAM,CAAC,KAAK,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;SACpD;IACF,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 { ISegment } from \"../mergeTreeNodes\";\nimport { TextSegment } from \"../textSegment\";\n\ndescribe(\"segmentGroupCollection\", () => {\n\tlet segment: ISegment;\n\tbeforeEach(() => {\n\t\tsegment = TextSegment.make(\"abc\");\n\t});\n\tit(\".empty\", () => {\n\t\tassert(segment.segmentGroups.empty);\n\t});\n\n\tit(\".size\", () => {\n\t\tassert.equal(segment.segmentGroups.size, 0);\n\t});\n\n\tit(\".enqueue\", () => {\n\t\tconst segmentGroup = { segments: [], localSeq: 1, refSeq: 0 };\n\t\tsegment.segmentGroups.enqueue(segmentGroup);\n\n\t\tassert(!segment.segmentGroups.empty);\n\t\tassert.equal(segment.segmentGroups.size, 1);\n\t\tassert.equal(segmentGroup.segments.length, 1);\n\t\tassert.equal(segmentGroup.segments[0], segment);\n\t});\n\n\tit(\".dequeue\", () => {\n\t\tconst segmentGroup = { segments: [], localSeq: 1, refSeq: 0 };\n\t\tsegment.segmentGroups.enqueue(segmentGroup);\n\t\tconst segmentGroupCount = 6;\n\t\twhile (segment.segmentGroups.size < segmentGroupCount) {\n\t\t\tsegment.segmentGroups.enqueue({ segments: [], localSeq: 1, refSeq: 0 });\n\t\t}\n\n\t\tconst dequeuedSegmentGroup = segment.segmentGroups.dequeue();\n\n\t\tassert.equal(segment.segmentGroups.size, segmentGroupCount - 1);\n\t\tassert.equal(dequeuedSegmentGroup?.segments.length, 1);\n\t\tassert.equal(dequeuedSegmentGroup.segments[0], segment);\n\t\tassert.equal(dequeuedSegmentGroup, segmentGroup);\n\t});\n\n\tit(\".copyTo\", () => {\n\t\tconst segmentGroupCount = 6;\n\t\twhile (segment.segmentGroups.size < segmentGroupCount) {\n\t\t\tsegment.segmentGroups.enqueue({ segments: [], localSeq: 1, refSeq: 0 });\n\t\t}\n\n\t\tconst segmentCopy = TextSegment.make(\"\");\n\t\tsegment.segmentGroups.copyTo(segmentCopy);\n\n\t\tassert.equal(segment.segmentGroups.size, segmentGroupCount);\n\t\tassert.equal(segmentCopy.segmentGroups.size, segmentGroupCount);\n\n\t\twhile (!segment.segmentGroups.empty || !segmentCopy.segmentGroups.empty) {\n\t\t\tconst segmentGroup = segment.segmentGroups.dequeue();\n\t\t\tconst copySegmentGroup = segmentCopy.segmentGroups.dequeue();\n\n\t\t\tassert.equal(segmentGroup, copySegmentGroup);\n\t\t\tassert.equal(segmentGroup?.segments.length, 2);\n\t\t\tassert.equal(segmentGroup.segments[0], segment);\n\t\t\tassert.equal(segmentGroup.segments[1], segmentCopy);\n\t\t}\n\t});\n});\n"]}
@@ -0,0 +1,6 @@
1
+ /*!
2
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
3
+ * Licensed under the MIT License.
4
+ */
5
+ export {};
6
+ //# sourceMappingURL=snapshot.spec.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"snapshot.spec.d.ts","sourceRoot":"","sources":["../../src/test/snapshot.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG"}