@theia/scm 1.77.0-next.1 → 1.77.0-next.108

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 (319) hide show
  1. package/lib/browser/decorations/scm-decorations-service.d.ts +2 -2
  2. package/lib/browser/decorations/scm-decorations-service.d.ts.map +1 -1
  3. package/lib/browser/decorations/scm-decorations-service.js +22 -28
  4. package/lib/browser/decorations/scm-decorations-service.js.map +1 -1
  5. package/lib/browser/decorations/scm-navigator-decorator.js +22 -28
  6. package/lib/browser/decorations/scm-navigator-decorator.js.map +1 -1
  7. package/lib/browser/dirty-diff/content-lines.js +2 -5
  8. package/lib/browser/dirty-diff/content-lines.js.map +1 -1
  9. package/lib/browser/dirty-diff/content-lines.spec.js +15 -16
  10. package/lib/browser/dirty-diff/content-lines.spec.js.map +1 -1
  11. package/lib/browser/dirty-diff/diff-computer.d.ts +1 -1
  12. package/lib/browser/dirty-diff/diff-computer.d.ts.map +1 -1
  13. package/lib/browser/dirty-diff/diff-computer.js +11 -15
  14. package/lib/browser/dirty-diff/diff-computer.js.map +1 -1
  15. package/lib/browser/dirty-diff/diff-computer.spec.js +26 -27
  16. package/lib/browser/dirty-diff/diff-computer.spec.js.map +1 -1
  17. package/lib/browser/dirty-diff/dirty-diff-decorator.d.ts +1 -1
  18. package/lib/browser/dirty-diff/dirty-diff-decorator.d.ts.map +1 -1
  19. package/lib/browser/dirty-diff/dirty-diff-decorator.js +19 -22
  20. package/lib/browser/dirty-diff/dirty-diff-decorator.js.map +1 -1
  21. package/lib/browser/dirty-diff/dirty-diff-module.js +11 -14
  22. package/lib/browser/dirty-diff/dirty-diff-module.js.map +1 -1
  23. package/lib/browser/dirty-diff/dirty-diff-navigator.d.ts +3 -3
  24. package/lib/browser/dirty-diff/dirty-diff-navigator.d.ts.map +1 -1
  25. package/lib/browser/dirty-diff/dirty-diff-navigator.js +30 -40
  26. package/lib/browser/dirty-diff/dirty-diff-navigator.js.map +1 -1
  27. package/lib/browser/dirty-diff/dirty-diff-widget.d.ts +1 -1
  28. package/lib/browser/dirty-diff/dirty-diff-widget.d.ts.map +1 -1
  29. package/lib/browser/dirty-diff/dirty-diff-widget.js +50 -54
  30. package/lib/browser/dirty-diff/dirty-diff-widget.js.map +1 -1
  31. package/lib/browser/merge-editor/merge-editor-contribution.d.ts +2 -2
  32. package/lib/browser/merge-editor/merge-editor-contribution.d.ts.map +1 -1
  33. package/lib/browser/merge-editor/merge-editor-contribution.js +43 -49
  34. package/lib/browser/merge-editor/merge-editor-contribution.js.map +1 -1
  35. package/lib/browser/merge-editor/merge-editor-dev-contribution.d.ts +2 -2
  36. package/lib/browser/merge-editor/merge-editor-dev-contribution.d.ts.map +1 -1
  37. package/lib/browser/merge-editor/merge-editor-dev-contribution.js +35 -45
  38. package/lib/browser/merge-editor/merge-editor-dev-contribution.js.map +1 -1
  39. package/lib/browser/merge-editor/merge-editor-module.d.ts +1 -1
  40. package/lib/browser/merge-editor/merge-editor-module.d.ts.map +1 -1
  41. package/lib/browser/merge-editor/merge-editor-module.js +49 -54
  42. package/lib/browser/merge-editor/merge-editor-module.js.map +1 -1
  43. package/lib/browser/merge-editor/merge-editor.d.ts +5 -5
  44. package/lib/browser/merge-editor/merge-editor.d.ts.map +1 -1
  45. package/lib/browser/merge-editor/merge-editor.js +77 -92
  46. package/lib/browser/merge-editor/merge-editor.js.map +1 -1
  47. package/lib/browser/merge-editor/model/line-range.js +6 -10
  48. package/lib/browser/merge-editor/model/line-range.js.map +1 -1
  49. package/lib/browser/merge-editor/model/live-diff.d.ts +1 -1
  50. package/lib/browser/merge-editor/model/live-diff.d.ts.map +1 -1
  51. package/lib/browser/merge-editor/model/live-diff.js +14 -18
  52. package/lib/browser/merge-editor/model/live-diff.js.map +1 -1
  53. package/lib/browser/merge-editor/model/merge-editor-model.d.ts +4 -4
  54. package/lib/browser/merge-editor/model/merge-editor-model.d.ts.map +1 -1
  55. package/lib/browser/merge-editor/model/merge-editor-model.js +88 -98
  56. package/lib/browser/merge-editor/model/merge-editor-model.js.map +1 -1
  57. package/lib/browser/merge-editor/model/merge-range.d.ts +3 -3
  58. package/lib/browser/merge-editor/model/merge-range.d.ts.map +1 -1
  59. package/lib/browser/merge-editor/model/merge-range.js +26 -30
  60. package/lib/browser/merge-editor/model/merge-range.js.map +1 -1
  61. package/lib/browser/merge-editor/model/range-editing.d.ts +1 -1
  62. package/lib/browser/merge-editor/model/range-editing.d.ts.map +1 -1
  63. package/lib/browser/merge-editor/model/range-editing.js +8 -13
  64. package/lib/browser/merge-editor/model/range-editing.js.map +1 -1
  65. package/lib/browser/merge-editor/model/range-mapping.d.ts +2 -2
  66. package/lib/browser/merge-editor/model/range-mapping.d.ts.map +1 -1
  67. package/lib/browser/merge-editor/model/range-mapping.js +28 -37
  68. package/lib/browser/merge-editor/model/range-mapping.js.map +1 -1
  69. package/lib/browser/merge-editor/model/range-mapping.spec.js +19 -21
  70. package/lib/browser/merge-editor/model/range-mapping.spec.js.map +1 -1
  71. package/lib/browser/merge-editor/model/range-utils.js +9 -12
  72. package/lib/browser/merge-editor/model/range-utils.js.map +1 -1
  73. package/lib/browser/merge-editor/view/diff-spacers.d.ts +1 -1
  74. package/lib/browser/merge-editor/view/diff-spacers.d.ts.map +1 -1
  75. package/lib/browser/merge-editor/view/diff-spacers.js +7 -10
  76. package/lib/browser/merge-editor/view/diff-spacers.js.map +1 -1
  77. package/lib/browser/merge-editor/view/merge-editor-panes/index.d.ts +5 -5
  78. package/lib/browser/merge-editor/view/merge-editor-panes/index.d.ts.map +1 -1
  79. package/lib/browser/merge-editor/view/merge-editor-panes/index.js +5 -8
  80. package/lib/browser/merge-editor/view/merge-editor-panes/index.js.map +1 -1
  81. package/lib/browser/merge-editor/view/merge-editor-panes/merge-editor-base-pane.d.ts +3 -3
  82. package/lib/browser/merge-editor/view/merge-editor-panes/merge-editor-base-pane.d.ts.map +1 -1
  83. package/lib/browser/merge-editor/view/merge-editor-panes/merge-editor-base-pane.js +11 -15
  84. package/lib/browser/merge-editor/view/merge-editor-panes/merge-editor-base-pane.js.map +1 -1
  85. package/lib/browser/merge-editor/view/merge-editor-panes/merge-editor-pane-header.js +18 -25
  86. package/lib/browser/merge-editor/view/merge-editor-panes/merge-editor-pane-header.js.map +1 -1
  87. package/lib/browser/merge-editor/view/merge-editor-panes/merge-editor-pane.d.ts +5 -5
  88. package/lib/browser/merge-editor/view/merge-editor-panes/merge-editor-pane.d.ts.map +1 -1
  89. package/lib/browser/merge-editor/view/merge-editor-panes/merge-editor-pane.js +48 -58
  90. package/lib/browser/merge-editor/view/merge-editor-panes/merge-editor-pane.js.map +1 -1
  91. package/lib/browser/merge-editor/view/merge-editor-panes/merge-editor-result-pane.d.ts +4 -4
  92. package/lib/browser/merge-editor/view/merge-editor-panes/merge-editor-result-pane.d.ts.map +1 -1
  93. package/lib/browser/merge-editor/view/merge-editor-panes/merge-editor-result-pane.js +32 -38
  94. package/lib/browser/merge-editor/view/merge-editor-panes/merge-editor-result-pane.js.map +1 -1
  95. package/lib/browser/merge-editor/view/merge-editor-panes/merge-editor-side-pane.d.ts +4 -4
  96. package/lib/browser/merge-editor/view/merge-editor-panes/merge-editor-side-pane.d.ts.map +1 -1
  97. package/lib/browser/merge-editor/view/merge-editor-panes/merge-editor-side-pane.js +32 -41
  98. package/lib/browser/merge-editor/view/merge-editor-panes/merge-editor-side-pane.js.map +1 -1
  99. package/lib/browser/merge-editor/view/merge-editor-scroll-sync.d.ts +2 -2
  100. package/lib/browser/merge-editor/view/merge-editor-scroll-sync.d.ts.map +1 -1
  101. package/lib/browser/merge-editor/view/merge-editor-scroll-sync.js +3 -7
  102. package/lib/browser/merge-editor/view/merge-editor-scroll-sync.js.map +1 -1
  103. package/lib/browser/merge-editor/view/merge-editor-view-zones.d.ts +5 -5
  104. package/lib/browser/merge-editor/view/merge-editor-view-zones.d.ts.map +1 -1
  105. package/lib/browser/merge-editor/view/merge-editor-view-zones.js +18 -25
  106. package/lib/browser/merge-editor/view/merge-editor-view-zones.js.map +1 -1
  107. package/lib/browser/merge-editor/view/merge-range-actions.d.ts +2 -2
  108. package/lib/browser/merge-editor/view/merge-range-actions.d.ts.map +1 -1
  109. package/lib/browser/merge-editor/view/merge-range-actions.js +34 -38
  110. package/lib/browser/merge-editor/view/merge-range-actions.js.map +1 -1
  111. package/lib/browser/multi-diff-editor/multi-diff-editor-module.d.ts +4 -0
  112. package/lib/browser/multi-diff-editor/multi-diff-editor-module.d.ts.map +1 -0
  113. package/lib/browser/multi-diff-editor/multi-diff-editor-module.js +31 -0
  114. package/lib/browser/multi-diff-editor/multi-diff-editor-module.js.map +1 -0
  115. package/lib/browser/multi-diff-editor/multi-diff-editor-uri.d.ts +15 -0
  116. package/lib/browser/multi-diff-editor/multi-diff-editor-uri.d.ts.map +1 -0
  117. package/lib/browser/multi-diff-editor/multi-diff-editor-uri.js +65 -0
  118. package/lib/browser/multi-diff-editor/multi-diff-editor-uri.js.map +1 -0
  119. package/lib/browser/multi-diff-editor/multi-diff-editor-widget-factory.d.ts +18 -0
  120. package/lib/browser/multi-diff-editor/multi-diff-editor-widget-factory.d.ts.map +1 -0
  121. package/lib/browser/multi-diff-editor/multi-diff-editor-widget-factory.js +72 -0
  122. package/lib/browser/multi-diff-editor/multi-diff-editor-widget-factory.js.map +1 -0
  123. package/lib/browser/multi-diff-editor/multi-diff-editor-widget.spec.d.ts +2 -0
  124. package/lib/browser/multi-diff-editor/multi-diff-editor-widget.spec.d.ts.map +1 -0
  125. package/lib/browser/multi-diff-editor/multi-diff-editor-widget.spec.js +832 -0
  126. package/lib/browser/multi-diff-editor/multi-diff-editor-widget.spec.js.map +1 -0
  127. package/lib/browser/multi-diff-editor/multi-diff-editor.d.ts +163 -0
  128. package/lib/browser/multi-diff-editor/multi-diff-editor.d.ts.map +1 -0
  129. package/lib/browser/multi-diff-editor/multi-diff-editor.js +552 -0
  130. package/lib/browser/multi-diff-editor/multi-diff-editor.js.map +1 -0
  131. package/lib/browser/multi-diff-editor/multi-diff-editor.spec.d.ts +2 -0
  132. package/lib/browser/multi-diff-editor/multi-diff-editor.spec.d.ts.map +1 -0
  133. package/lib/browser/multi-diff-editor/multi-diff-editor.spec.js +165 -0
  134. package/lib/browser/multi-diff-editor/multi-diff-editor.spec.js.map +1 -0
  135. package/lib/browser/scm-action-button-widget.d.ts +2 -2
  136. package/lib/browser/scm-action-button-widget.d.ts.map +1 -1
  137. package/lib/browser/scm-action-button-widget.js +30 -39
  138. package/lib/browser/scm-action-button-widget.js.map +1 -1
  139. package/lib/browser/scm-amend-component.d.ts +3 -3
  140. package/lib/browser/scm-amend-component.d.ts.map +1 -1
  141. package/lib/browser/scm-amend-component.js +24 -28
  142. package/lib/browser/scm-amend-component.js.map +1 -1
  143. package/lib/browser/scm-amend-widget.d.ts +2 -2
  144. package/lib/browser/scm-amend-widget.d.ts.map +1 -1
  145. package/lib/browser/scm-amend-widget.js +26 -36
  146. package/lib/browser/scm-amend-widget.js.map +1 -1
  147. package/lib/browser/scm-avatar-service.js +7 -10
  148. package/lib/browser/scm-avatar-service.js.map +1 -1
  149. package/lib/browser/scm-colors.js +2 -5
  150. package/lib/browser/scm-colors.js.map +1 -1
  151. package/lib/browser/scm-commit-widget.d.ts +2 -2
  152. package/lib/browser/scm-commit-widget.d.ts.map +1 -1
  153. package/lib/browser/scm-commit-widget.js +25 -31
  154. package/lib/browser/scm-commit-widget.js.map +1 -1
  155. package/lib/browser/scm-context-key-service.js +10 -17
  156. package/lib/browser/scm-context-key-service.js.map +1 -1
  157. package/lib/browser/scm-context-key-service.spec.js +33 -35
  158. package/lib/browser/scm-context-key-service.spec.js.map +1 -1
  159. package/lib/browser/scm-contribution.d.ts +8 -8
  160. package/lib/browser/scm-contribution.d.ts.map +1 -1
  161. package/lib/browser/scm-contribution.js +114 -131
  162. package/lib/browser/scm-contribution.js.map +1 -1
  163. package/lib/browser/scm-frontend-module.d.ts.map +1 -1
  164. package/lib/browser/scm-frontend-module.js +99 -101
  165. package/lib/browser/scm-frontend-module.js.map +1 -1
  166. package/lib/browser/scm-groups-tree-model.d.ts +3 -3
  167. package/lib/browser/scm-groups-tree-model.d.ts.map +1 -1
  168. package/lib/browser/scm-groups-tree-model.js +15 -22
  169. package/lib/browser/scm-groups-tree-model.js.map +1 -1
  170. package/lib/browser/scm-history-graph-contribution.d.ts +4 -4
  171. package/lib/browser/scm-history-graph-contribution.d.ts.map +1 -1
  172. package/lib/browser/scm-history-graph-contribution.js +52 -60
  173. package/lib/browser/scm-history-graph-contribution.js.map +1 -1
  174. package/lib/browser/scm-history-graph-contribution.spec.js +35 -37
  175. package/lib/browser/scm-history-graph-contribution.spec.js.map +1 -1
  176. package/lib/browser/scm-history-graph-helpers.d.ts +1 -1
  177. package/lib/browser/scm-history-graph-helpers.d.ts.map +1 -1
  178. package/lib/browser/scm-history-graph-helpers.js +14 -30
  179. package/lib/browser/scm-history-graph-helpers.js.map +1 -1
  180. package/lib/browser/scm-history-graph-helpers.spec.js +44 -46
  181. package/lib/browser/scm-history-graph-helpers.spec.js.map +1 -1
  182. package/lib/browser/scm-history-graph-lanes.js +1 -4
  183. package/lib/browser/scm-history-graph-lanes.js.map +1 -1
  184. package/lib/browser/scm-history-graph-lanes.spec.js +135 -137
  185. package/lib/browser/scm-history-graph-lanes.spec.js.map +1 -1
  186. package/lib/browser/scm-history-graph-model.d.ts +4 -4
  187. package/lib/browser/scm-history-graph-model.d.ts.map +1 -1
  188. package/lib/browser/scm-history-graph-model.js +34 -43
  189. package/lib/browser/scm-history-graph-model.js.map +1 -1
  190. package/lib/browser/scm-history-graph-model.spec.js +74 -76
  191. package/lib/browser/scm-history-graph-model.spec.js.map +1 -1
  192. package/lib/browser/scm-history-graph-tooltip.d.ts +2 -2
  193. package/lib/browser/scm-history-graph-tooltip.d.ts.map +1 -1
  194. package/lib/browser/scm-history-graph-tooltip.js +33 -42
  195. package/lib/browser/scm-history-graph-tooltip.js.map +1 -1
  196. package/lib/browser/scm-history-graph-tooltip.spec.js +63 -65
  197. package/lib/browser/scm-history-graph-tooltip.spec.js.map +1 -1
  198. package/lib/browser/scm-history-graph-widget.d.ts +7 -7
  199. package/lib/browser/scm-history-graph-widget.d.ts.map +1 -1
  200. package/lib/browser/scm-history-graph-widget.js +116 -134
  201. package/lib/browser/scm-history-graph-widget.js.map +1 -1
  202. package/lib/browser/scm-history-graph-widget.spec.js +40 -42
  203. package/lib/browser/scm-history-graph-widget.spec.js.map +1 -1
  204. package/lib/browser/scm-input.js +10 -14
  205. package/lib/browser/scm-input.js.map +1 -1
  206. package/lib/browser/scm-layout-migrations.js +15 -18
  207. package/lib/browser/scm-layout-migrations.js.map +1 -1
  208. package/lib/browser/scm-provider.d.ts +2 -0
  209. package/lib/browser/scm-provider.d.ts.map +1 -1
  210. package/lib/browser/scm-provider.js +1 -4
  211. package/lib/browser/scm-provider.js.map +1 -1
  212. package/lib/browser/scm-quick-open-service.d.ts +1 -1
  213. package/lib/browser/scm-quick-open-service.d.ts.map +1 -1
  214. package/lib/browser/scm-quick-open-service.js +20 -27
  215. package/lib/browser/scm-quick-open-service.js.map +1 -1
  216. package/lib/browser/scm-repositories-widget.d.ts +4 -4
  217. package/lib/browser/scm-repositories-widget.d.ts.map +1 -1
  218. package/lib/browser/scm-repositories-widget.js +55 -67
  219. package/lib/browser/scm-repositories-widget.js.map +1 -1
  220. package/lib/browser/scm-repositories-widget.spec.js +86 -88
  221. package/lib/browser/scm-repositories-widget.spec.js.map +1 -1
  222. package/lib/browser/scm-repository.d.ts +2 -2
  223. package/lib/browser/scm-repository.d.ts.map +1 -1
  224. package/lib/browser/scm-repository.js +6 -10
  225. package/lib/browser/scm-repository.js.map +1 -1
  226. package/lib/browser/scm-service.d.ts +3 -3
  227. package/lib/browser/scm-service.d.ts.map +1 -1
  228. package/lib/browser/scm-service.js +18 -22
  229. package/lib/browser/scm-service.js.map +1 -1
  230. package/lib/browser/scm-service.spec.js +15 -17
  231. package/lib/browser/scm-service.spec.js.map +1 -1
  232. package/lib/browser/scm-tree-label-provider.d.ts +1 -1
  233. package/lib/browser/scm-tree-label-provider.d.ts.map +1 -1
  234. package/lib/browser/scm-tree-label-provider.js +16 -20
  235. package/lib/browser/scm-tree-label-provider.js.map +1 -1
  236. package/lib/browser/scm-tree-model.d.ts +2 -2
  237. package/lib/browser/scm-tree-model.d.ts.map +1 -1
  238. package/lib/browser/scm-tree-model.js +27 -32
  239. package/lib/browser/scm-tree-model.js.map +1 -1
  240. package/lib/browser/scm-tree-widget.d.ts +4 -4
  241. package/lib/browser/scm-tree-widget.d.ts.map +1 -1
  242. package/lib/browser/scm-tree-widget.js +98 -122
  243. package/lib/browser/scm-tree-widget.js.map +1 -1
  244. package/lib/browser/scm-widget.d.ts +6 -6
  245. package/lib/browser/scm-widget.d.ts.map +1 -1
  246. package/lib/browser/scm-widget.js +49 -64
  247. package/lib/browser/scm-widget.js.map +1 -1
  248. package/lib/common/scm-preferences.js +21 -26
  249. package/lib/common/scm-preferences.js.map +1 -1
  250. package/lib/node/scm-backend-module.js +4 -6
  251. package/lib/node/scm-backend-module.js.map +1 -1
  252. package/package.json +15 -6
  253. package/src/browser/decorations/scm-decorations-service.ts +5 -5
  254. package/src/browser/dirty-diff/content-lines.spec.ts +3 -2
  255. package/src/browser/dirty-diff/diff-computer.spec.ts +4 -3
  256. package/src/browser/dirty-diff/diff-computer.ts +1 -1
  257. package/src/browser/dirty-diff/dirty-diff-decorator.ts +1 -1
  258. package/src/browser/dirty-diff/dirty-diff-module.ts +3 -3
  259. package/src/browser/dirty-diff/dirty-diff-navigator.ts +4 -4
  260. package/src/browser/dirty-diff/dirty-diff-widget.ts +2 -2
  261. package/src/browser/merge-editor/merge-editor-contribution.ts +2 -2
  262. package/src/browser/merge-editor/merge-editor-dev-contribution.ts +1 -1
  263. package/src/browser/merge-editor/merge-editor-module.ts +7 -7
  264. package/src/browser/merge-editor/merge-editor.ts +5 -5
  265. package/src/browser/merge-editor/model/live-diff.ts +2 -2
  266. package/src/browser/merge-editor/model/merge-editor-model.ts +8 -8
  267. package/src/browser/merge-editor/model/merge-range.ts +4 -4
  268. package/src/browser/merge-editor/model/range-editing.ts +1 -1
  269. package/src/browser/merge-editor/model/range-mapping.spec.ts +1 -1
  270. package/src/browser/merge-editor/model/range-mapping.ts +3 -3
  271. package/src/browser/merge-editor/view/diff-spacers.ts +1 -1
  272. package/src/browser/merge-editor/view/merge-editor-panes/index.ts +5 -5
  273. package/src/browser/merge-editor/view/merge-editor-panes/merge-editor-base-pane.ts +3 -3
  274. package/src/browser/merge-editor/view/merge-editor-panes/merge-editor-pane.ts +7 -7
  275. package/src/browser/merge-editor/view/merge-editor-panes/merge-editor-result-pane.ts +4 -4
  276. package/src/browser/merge-editor/view/merge-editor-panes/merge-editor-side-pane.ts +4 -4
  277. package/src/browser/merge-editor/view/merge-editor-scroll-sync.ts +2 -2
  278. package/src/browser/merge-editor/view/merge-editor-view-zones.ts +5 -5
  279. package/src/browser/merge-editor/view/merge-range-actions.ts +2 -2
  280. package/src/browser/multi-diff-editor/multi-diff-editor-module.ts +35 -0
  281. package/src/browser/multi-diff-editor/multi-diff-editor-uri.ts +83 -0
  282. package/src/browser/multi-diff-editor/multi-diff-editor-widget-factory.ts +81 -0
  283. package/src/browser/multi-diff-editor/multi-diff-editor-widget.spec.ts +878 -0
  284. package/src/browser/multi-diff-editor/multi-diff-editor.spec.ts +189 -0
  285. package/src/browser/multi-diff-editor/multi-diff-editor.ts +628 -0
  286. package/src/browser/scm-action-button-widget.tsx +3 -3
  287. package/src/browser/scm-amend-component.tsx +3 -3
  288. package/src/browser/scm-amend-widget.tsx +3 -3
  289. package/src/browser/scm-commit-widget.tsx +2 -2
  290. package/src/browser/scm-context-key-service.spec.ts +3 -3
  291. package/src/browser/scm-contribution.ts +8 -8
  292. package/src/browser/scm-frontend-module.ts +25 -22
  293. package/src/browser/scm-groups-tree-model.ts +3 -3
  294. package/src/browser/scm-history-graph-contribution.spec.ts +3 -3
  295. package/src/browser/scm-history-graph-contribution.ts +6 -6
  296. package/src/browser/scm-history-graph-helpers.spec.ts +2 -2
  297. package/src/browser/scm-history-graph-helpers.ts +1 -1
  298. package/src/browser/scm-history-graph-lanes.spec.ts +1 -1
  299. package/src/browser/scm-history-graph-model.spec.ts +3 -3
  300. package/src/browser/scm-history-graph-model.ts +5 -5
  301. package/src/browser/scm-history-graph-tooltip.spec.ts +3 -3
  302. package/src/browser/scm-history-graph-tooltip.ts +3 -3
  303. package/src/browser/scm-history-graph-widget.spec.ts +4 -4
  304. package/src/browser/scm-history-graph-widget.tsx +8 -8
  305. package/src/browser/scm-input.ts +1 -1
  306. package/src/browser/scm-layout-migrations.ts +1 -1
  307. package/src/browser/scm-provider.ts +2 -0
  308. package/src/browser/scm-quick-open-service.ts +1 -1
  309. package/src/browser/scm-repositories-widget.spec.ts +2 -2
  310. package/src/browser/scm-repositories-widget.tsx +4 -4
  311. package/src/browser/scm-repository.ts +2 -2
  312. package/src/browser/scm-service.spec.ts +2 -2
  313. package/src/browser/scm-service.ts +3 -3
  314. package/src/browser/scm-tree-label-provider.ts +1 -1
  315. package/src/browser/scm-tree-model.ts +2 -2
  316. package/src/browser/scm-tree-widget.tsx +4 -4
  317. package/src/browser/scm-widget.tsx +6 -6
  318. package/src/browser/style/multi-diff-editor.css +113 -0
  319. package/src/node/scm-backend-module.ts +1 -1
@@ -1,4 +1,3 @@
1
- "use strict";
2
1
  // *****************************************************************************
3
2
  // Copyright (C) 2026 EclipseSource GmbH and others.
4
3
  //
@@ -14,12 +13,11 @@
14
13
  //
15
14
  // SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0
16
15
  // *****************************************************************************
17
- Object.defineProperty(exports, "__esModule", { value: true });
18
- const chai_1 = require("chai");
19
- const scm_history_graph_lanes_1 = require("./scm-history-graph-lanes");
16
+ import { expect } from 'chai';
17
+ import { computeGraphRows } from './scm-history-graph-lanes.js';
20
18
  describe('computeGraphRows', () => {
21
19
  function lanes(commits) {
22
- return (0, scm_history_graph_lanes_1.computeGraphRows)(commits).map(r => r.lane);
20
+ return computeGraphRows(commits).map(r => r.lane);
23
21
  }
24
22
  // -------------------------------------------------------------------------
25
23
  // Linear history
@@ -31,26 +29,26 @@ describe('computeGraphRows', () => {
31
29
  { id: 'A', parentIds: [] },
32
30
  ];
33
31
  it('all commits stay in lane 0', () => {
34
- (0, chai_1.expect)(lanes(commits)).to.deep.equal([0, 0, 0]);
32
+ expect(lanes(commits)).to.deep.equal([0, 0, 0]);
35
33
  });
36
34
  it('colors default to the first rotation color (foreground1 = index 3)', () => {
37
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
38
- (0, chai_1.expect)(rows.map(r => r.color)).to.deep.equal([3, 3, 3]);
35
+ const rows = computeGraphRows(commits);
36
+ expect(rows.map(r => r.color)).to.deep.equal([3, 3, 3]);
39
37
  });
40
38
  it('topColor equals color when no ref color overrides the lane', () => {
41
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
42
- rows.forEach(r => (0, chai_1.expect)(r.topColor).to.equal(r.color));
39
+ const rows = computeGraphRows(commits);
40
+ rows.forEach(r => expect(r.topColor).to.equal(r.color));
43
41
  });
44
42
  it('first parent same-lane continuation emits no separate edge (handled by commit line)', () => {
45
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
43
+ const rows = computeGraphRows(commits);
46
44
  // Row 0 (C): first parent B is in the same lane — no edge emitted
47
45
  // Only pass-through edges from other lanes (none here) are emitted
48
46
  const edgesC = rows[0].edges.filter(e => e.fromLane === 0 && e.toLane === 0);
49
- (0, chai_1.expect)(edgesC.length).to.equal(0);
47
+ expect(edgesC.length).to.equal(0);
50
48
  });
51
49
  it('root commit (A) emits no edges', () => {
52
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
53
- (0, chai_1.expect)(rows[2].edges).to.be.empty;
50
+ const rows = computeGraphRows(commits);
51
+ expect(rows[2].edges).to.be.empty;
54
52
  });
55
53
  });
56
54
  // -------------------------------------------------------------------------
@@ -76,42 +74,42 @@ describe('computeGraphRows', () => {
76
74
  { id: 'A', parentIds: [] },
77
75
  ];
78
76
  it('merge commit M is in lane 0', () => {
79
- (0, chai_1.expect)(lanes(commits)[0]).to.equal(0);
77
+ expect(lanes(commits)[0]).to.equal(0);
80
78
  });
81
79
  it('D (first parent) stays in lane 0', () => {
82
- (0, chai_1.expect)(lanes(commits)[1]).to.equal(0);
80
+ expect(lanes(commits)[1]).to.equal(0);
83
81
  });
84
82
  it('E (second parent) is in a different lane', () => {
85
- (0, chai_1.expect)(lanes(commits)[2]).to.not.equal(0);
83
+ expect(lanes(commits)[2]).to.not.equal(0);
86
84
  });
87
85
  it('B and A eventually converge back to lane 0', () => {
88
86
  const ls = lanes(commits);
89
87
  // B must be in lane 0 (first parent chain)
90
- (0, chai_1.expect)(ls[3]).to.equal(0);
88
+ expect(ls[3]).to.equal(0);
91
89
  // A also stays in lane 0
92
- (0, chai_1.expect)(ls[4]).to.equal(0);
90
+ expect(ls[4]).to.equal(0);
93
91
  });
94
92
  it('M emits a branch-out edge for second parent E', () => {
95
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
93
+ const rows = computeGraphRows(commits);
96
94
  const mEdges = rows[0].edges;
97
95
  // Branch-out: from commit lane 0 to E's new lane
98
96
  const branchOut = mEdges.filter(e => e.type === 'branch-out' && e.fromLane === 0);
99
- (0, chai_1.expect)(branchOut.length).to.be.greaterThan(0);
97
+ expect(branchOut.length).to.be.greaterThan(0);
100
98
  });
101
99
  it('M does not emit a merge-in edge (no existing lane converges into M)', () => {
102
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
100
+ const rows = computeGraphRows(commits);
103
101
  const mEdges = rows[0].edges;
104
102
  const mergeIn = mEdges.filter(e => e.type === 'merge-in');
105
- (0, chai_1.expect)(mergeIn.length).to.equal(0);
103
+ expect(mergeIn.length).to.equal(0);
106
104
  });
107
105
  it('E emits a merge-in edge (E parent B is already in lane 0)', () => {
108
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
106
+ const rows = computeGraphRows(commits);
109
107
  // E is at index 2, in lane 1; its parent B is already in lane 0.
110
108
  // merge-in edge: fromLane=0 (B's lane), toLane=1 (E's commit lane)
111
109
  const eRow = rows[2];
112
110
  const eEdges = eRow.edges;
113
111
  const mergeIn = eEdges.filter(e => e.type === 'merge-in' && e.fromLane === 0 && e.toLane === eRow.lane);
114
- (0, chai_1.expect)(mergeIn.length).to.be.greaterThan(0);
112
+ expect(mergeIn.length).to.be.greaterThan(0);
115
113
  });
116
114
  });
117
115
  // -------------------------------------------------------------------------
@@ -128,18 +126,18 @@ describe('computeGraphRows', () => {
128
126
  { id: 'B1', parentIds: [] },
129
127
  ];
130
128
  it('A2 is in lane 0', () => {
131
- (0, chai_1.expect)(lanes(commits)[0]).to.equal(0);
129
+ expect(lanes(commits)[0]).to.equal(0);
132
130
  });
133
131
  it('B2 is in a different lane from A2', () => {
134
132
  const ls = lanes(commits);
135
- (0, chai_1.expect)(ls[1]).to.not.equal(ls[0]);
133
+ expect(ls[1]).to.not.equal(ls[0]);
136
134
  });
137
135
  it('A1 is in lane 0 (continues A2 branch)', () => {
138
- (0, chai_1.expect)(lanes(commits)[2]).to.equal(0);
136
+ expect(lanes(commits)[2]).to.equal(0);
139
137
  });
140
138
  it('B1 continues in the same lane as B2', () => {
141
139
  const ls = lanes(commits);
142
- (0, chai_1.expect)(ls[3]).to.equal(ls[1]);
140
+ expect(ls[3]).to.equal(ls[1]);
143
141
  });
144
142
  });
145
143
  // -------------------------------------------------------------------------
@@ -155,36 +153,36 @@ describe('computeGraphRows', () => {
155
153
  { id: 'P3', parentIds: [] },
156
154
  ];
157
155
  it('O is in lane 0', () => {
158
- (0, chai_1.expect)(lanes(commits)[0]).to.equal(0);
156
+ expect(lanes(commits)[0]).to.equal(0);
159
157
  });
160
158
  it('P1 is in lane 0 (first parent)', () => {
161
- (0, chai_1.expect)(lanes(commits)[1]).to.equal(0);
159
+ expect(lanes(commits)[1]).to.equal(0);
162
160
  });
163
161
  it('P2 is in a distinct lane', () => {
164
162
  const ls = lanes(commits);
165
- (0, chai_1.expect)(ls[2]).to.not.equal(0);
163
+ expect(ls[2]).to.not.equal(0);
166
164
  });
167
165
  it('P3 is in a distinct lane different from P2', () => {
168
166
  const ls = lanes(commits);
169
- (0, chai_1.expect)(ls[3]).to.not.equal(ls[2]);
167
+ expect(ls[3]).to.not.equal(ls[2]);
170
168
  });
171
169
  it('O emits 2 branch-out edges (for P2 and P3; P1 same-lane has no edge)', () => {
172
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
170
+ const rows = computeGraphRows(commits);
173
171
  const oEdges = rows[0].edges.filter(e => e.type === 'branch-out');
174
- (0, chai_1.expect)(oEdges.length).to.equal(2);
172
+ expect(oEdges.length).to.equal(2);
175
173
  });
176
174
  it('O emits no merge-in edges (no existing lanes converge into O)', () => {
177
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
175
+ const rows = computeGraphRows(commits);
178
176
  const mergeIn = rows[0].edges.filter(e => e.type === 'merge-in');
179
- (0, chai_1.expect)(mergeIn.length).to.equal(0);
177
+ expect(mergeIn.length).to.equal(0);
180
178
  });
181
179
  it('lane colors rotate through the default registry (indices 3-7)', () => {
182
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
180
+ const rows = computeGraphRows(commits);
183
181
  // O and P1 share lane 0 → first rotation color; P2/P3 opened new lanes
184
- (0, chai_1.expect)(rows[0].color).to.equal(3);
185
- (0, chai_1.expect)(rows[1].color).to.equal(3);
186
- (0, chai_1.expect)(rows[2].color).to.not.equal(rows[3].color);
187
- rows.forEach(r => (0, chai_1.expect)(r.color).to.be.within(3, 7));
182
+ expect(rows[0].color).to.equal(3);
183
+ expect(rows[1].color).to.equal(3);
184
+ expect(rows[2].color).to.not.equal(rows[3].color);
185
+ rows.forEach(r => expect(r.color).to.be.within(3, 7));
188
186
  });
189
187
  });
190
188
  // -------------------------------------------------------------------------
@@ -193,11 +191,11 @@ describe('computeGraphRows', () => {
193
191
  describe('single root commit', () => {
194
192
  const commits = [{ id: 'R', parentIds: [] }];
195
193
  it('is placed in lane 0', () => {
196
- (0, chai_1.expect)(lanes(commits)).to.deep.equal([0]);
194
+ expect(lanes(commits)).to.deep.equal([0]);
197
195
  });
198
196
  it('emits no edges', () => {
199
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
200
- (0, chai_1.expect)(rows[0].edges).to.be.empty;
197
+ const rows = computeGraphRows(commits);
198
+ expect(rows[0].edges).to.be.empty;
201
199
  });
202
200
  });
203
201
  // -------------------------------------------------------------------------
@@ -205,7 +203,7 @@ describe('computeGraphRows', () => {
205
203
  // -------------------------------------------------------------------------
206
204
  describe('empty input', () => {
207
205
  it('returns an empty array', () => {
208
- (0, chai_1.expect)((0, scm_history_graph_lanes_1.computeGraphRows)([])).to.deep.equal([]);
206
+ expect(computeGraphRows([])).to.deep.equal([]);
209
207
  });
210
208
  });
211
209
  // -------------------------------------------------------------------------
@@ -219,19 +217,19 @@ describe('computeGraphRows', () => {
219
217
  { id: 'A', parentIds: [] },
220
218
  ];
221
219
  it('first (newest/HEAD) commit has hasContinuation:true, hasTopLine:false', () => {
222
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
223
- (0, chai_1.expect)(rows[0].hasContinuation).to.equal(true);
224
- (0, chai_1.expect)(rows[0].hasTopLine).to.equal(false);
220
+ const rows = computeGraphRows(commits);
221
+ expect(rows[0].hasContinuation).to.equal(true);
222
+ expect(rows[0].hasTopLine).to.equal(false);
225
223
  });
226
224
  it('middle commit has hasContinuation:true, hasTopLine:true', () => {
227
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
228
- (0, chai_1.expect)(rows[1].hasContinuation).to.equal(true);
229
- (0, chai_1.expect)(rows[1].hasTopLine).to.equal(true);
225
+ const rows = computeGraphRows(commits);
226
+ expect(rows[1].hasContinuation).to.equal(true);
227
+ expect(rows[1].hasTopLine).to.equal(true);
230
228
  });
231
229
  it('root (oldest) commit has hasContinuation:false, hasTopLine:true', () => {
232
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
233
- (0, chai_1.expect)(rows[2].hasContinuation).to.equal(false);
234
- (0, chai_1.expect)(rows[2].hasTopLine).to.equal(true);
230
+ const rows = computeGraphRows(commits);
231
+ expect(rows[2].hasContinuation).to.equal(false);
232
+ expect(rows[2].hasTopLine).to.equal(true);
235
233
  });
236
234
  });
237
235
  describe('branch-and-merge', () => {
@@ -253,19 +251,19 @@ describe('computeGraphRows', () => {
253
251
  { id: 'A', parentIds: [] },
254
252
  ];
255
253
  it('merge commit E (whose parent B is already in lane 0) has hasContinuation:false, hasTopLine:true', () => {
256
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
254
+ const rows = computeGraphRows(commits);
257
255
  // E is at index 2; its first parent B is already in lane 0,
258
256
  // so its own lane is freed — hasContinuation must be false.
259
257
  // E was reserved as a parent by M, so hasTopLine must be true.
260
- (0, chai_1.expect)(rows[2].hasContinuation).to.equal(false);
261
- (0, chai_1.expect)(rows[2].hasTopLine).to.equal(true);
258
+ expect(rows[2].hasContinuation).to.equal(false);
259
+ expect(rows[2].hasTopLine).to.equal(true);
262
260
  });
263
261
  });
264
262
  describe('single root commit (no parents)', () => {
265
263
  it('has hasContinuation:false, hasTopLine:false', () => {
266
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)([{ id: 'R', parentIds: [] }]);
267
- (0, chai_1.expect)(rows[0].hasContinuation).to.equal(false);
268
- (0, chai_1.expect)(rows[0].hasTopLine).to.equal(false);
264
+ const rows = computeGraphRows([{ id: 'R', parentIds: [] }]);
265
+ expect(rows[0].hasContinuation).to.equal(false);
266
+ expect(rows[0].hasTopLine).to.equal(false);
269
267
  });
270
268
  });
271
269
  });
@@ -293,25 +291,25 @@ describe('computeGraphRows', () => {
293
291
  { id: 'A', parentIds: [] },
294
292
  ];
295
293
  it('E is placed in lane 1', () => {
296
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
297
- (0, chai_1.expect)(rows[2].lane).to.equal(1); // E
294
+ const rows = computeGraphRows(commits);
295
+ expect(rows[2].lane).to.equal(1); // E
298
296
  });
299
297
  it('B is in lane 0 (converges back after E)', () => {
300
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
301
- (0, chai_1.expect)(rows[3].lane).to.equal(0); // B
298
+ const rows = computeGraphRows(commits);
299
+ expect(rows[3].lane).to.equal(0); // B
302
300
  });
303
301
  it('A is in lane 0', () => {
304
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
305
- (0, chai_1.expect)(rows[4].lane).to.equal(0); // A
302
+ const rows = computeGraphRows(commits);
303
+ expect(rows[4].lane).to.equal(0); // A
306
304
  });
307
305
  it('lane 1 is freed after E — B row has no pass-through edge for lane 1', () => {
308
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
306
+ const rows = computeGraphRows(commits);
309
307
  // Row for B (index 3): there should be no pass-through edge that
310
308
  // goes from lane 1 to lane 1, because E has already been rendered
311
309
  // and its lane should have been freed.
312
310
  const bRow = rows[3];
313
311
  const spuriousEdge = bRow.edges.find(e => e.fromLane === 1 && e.toLane === 1);
314
- (0, chai_1.expect)(spuriousEdge).to.be.undefined;
312
+ expect(spuriousEdge).to.be.undefined;
315
313
  });
316
314
  it('lane 1 is reusable after E — new branch between B and A uses lane 1', () => {
317
315
  // Insert an independent branch X→Y between B and A so that at the
@@ -330,18 +328,18 @@ describe('computeGraphRows', () => {
330
328
  { id: 'A', parentIds: [] },
331
329
  { id: 'Y', parentIds: [] },
332
330
  ];
333
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commitsWithExtra);
331
+ const rows = computeGraphRows(commitsWithExtra);
334
332
  // X (index 4) should reuse the freed lane 1 rather than lane 2.
335
- (0, chai_1.expect)(rows[4].lane).to.equal(1);
333
+ expect(rows[4].lane).to.equal(1);
336
334
  });
337
335
  it('E emits a merge-in edge from lane 0 into E\'s commit lane (B already in lane 0)', () => {
338
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
336
+ const rows = computeGraphRows(commits);
339
337
  // E is at index 2, in lane 1; B is in lane 0.
340
338
  // merge-in edge: fromLane=0 (B's existing lane), toLane=1 (E's commit lane)
341
339
  const eRow = rows[2];
342
340
  const eEdges = eRow.edges;
343
341
  const mergeIn = eEdges.filter(e => e.type === 'merge-in' && e.fromLane === 0 && e.toLane === eRow.lane);
344
- (0, chai_1.expect)(mergeIn.length).to.equal(1);
342
+ expect(mergeIn.length).to.equal(1);
345
343
  });
346
344
  });
347
345
  // -------------------------------------------------------------------------
@@ -351,8 +349,8 @@ describe('computeGraphRows', () => {
351
349
  it('cycles through indices 3-7 and wraps', () => {
352
350
  // 6 independent tips → 6 lanes; the sixth wraps back to the first color
353
351
  const commits = ['A', 'B', 'C', 'D', 'E', 'F'].map(id => ({ id, parentIds: [id.toLowerCase()] }));
354
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
355
- (0, chai_1.expect)(rows.map(r => r.color)).to.deep.equal([3, 4, 5, 6, 7, 3]);
352
+ const rows = computeGraphRows(commits);
353
+ expect(rows.map(r => r.color)).to.deep.equal([3, 4, 5, 6, 7, 3]);
356
354
  });
357
355
  it('assigns distinct lanes to 8 simultaneous branches', () => {
358
356
  // 8 independent commits whose parents haven't been seen yet
@@ -366,11 +364,11 @@ describe('computeGraphRows', () => {
366
364
  { id: 'G', parentIds: ['g'] },
367
365
  { id: 'H', parentIds: ['h'] },
368
366
  ];
369
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
367
+ const rows = computeGraphRows(commits);
370
368
  const laneSet = new Set(rows.map(r => r.lane));
371
- (0, chai_1.expect)(laneSet.size).to.equal(8); // all distinct lanes
369
+ expect(laneSet.size).to.equal(8); // all distinct lanes
372
370
  // Default colors never use the reserved ref color indices 0-2
373
- rows.forEach(r => (0, chai_1.expect)(r.color).to.be.within(3, 7));
371
+ rows.forEach(r => expect(r.color).to.be.within(3, 7));
374
372
  });
375
373
  });
376
374
  // -------------------------------------------------------------------------
@@ -384,19 +382,19 @@ describe('computeGraphRows', () => {
384
382
  { id: 'A', parentIds: [] },
385
383
  ];
386
384
  it('a tip with a color index colors its row', () => {
387
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(behindCommits);
388
- (0, chai_1.expect)(rows[0].color).to.equal(1);
385
+ const rows = computeGraphRows(behindCommits);
386
+ expect(rows[0].color).to.equal(1);
389
387
  });
390
388
  it('an overriding commit recolors the chain from its row downward', () => {
391
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(behindCommits);
392
- (0, chai_1.expect)(rows[1].color).to.equal(0);
393
- (0, chai_1.expect)(rows[2].color).to.equal(0);
389
+ const rows = computeGraphRows(behindCommits);
390
+ expect(rows[1].color).to.equal(0);
391
+ expect(rows[2].color).to.equal(0);
394
392
  });
395
393
  it('topColor keeps the inherited color for the segment above an overriding commit', () => {
396
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(behindCommits);
397
- (0, chai_1.expect)(rows[0].topColor).to.equal(1);
398
- (0, chai_1.expect)(rows[1].topColor).to.equal(1);
399
- (0, chai_1.expect)(rows[2].topColor).to.equal(0);
394
+ const rows = computeGraphRows(behindCommits);
395
+ expect(rows[0].topColor).to.equal(1);
396
+ expect(rows[1].topColor).to.equal(1);
397
+ expect(rows[2].topColor).to.equal(0);
400
398
  });
401
399
  // Diverged: L (main = HEAD) and R (origin/main) both branched off A
402
400
  const divergedCommits = [
@@ -405,14 +403,14 @@ describe('computeGraphRows', () => {
405
403
  { id: 'A', parentIds: [] },
406
404
  ];
407
405
  it('pass-through edges use the propagated ref color', () => {
408
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(divergedCommits);
406
+ const rows = computeGraphRows(divergedCommits);
409
407
  const pass = rows[1].edges.find(e => e.type === 'pass-through');
410
- (0, chai_1.expect)(pass?.color).to.equal(0);
408
+ expect(pass?.color).to.equal(0);
411
409
  });
412
410
  it('merge-in edges from a ref-colored lane keep that color', () => {
413
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(divergedCommits);
411
+ const rows = computeGraphRows(divergedCommits);
414
412
  const mergeIn = rows[2].edges.find(e => e.type === 'merge-in');
415
- (0, chai_1.expect)(mergeIn?.color).to.equal(1);
413
+ expect(mergeIn?.color).to.equal(1);
416
414
  });
417
415
  });
418
416
  // -------------------------------------------------------------------------
@@ -425,10 +423,10 @@ describe('computeGraphRows', () => {
425
423
  { id: 'B', parentIds: ['b'] },
426
424
  { id: 'C', parentIds: ['c'] },
427
425
  ];
428
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
426
+ const rows = computeGraphRows(commits);
429
427
  // Row for B (index 1): A's lane (0) passes through as pass-through
430
428
  const bPassThrough = rows[1].edges.filter(e => e.type === 'pass-through');
431
- bPassThrough.forEach(e => (0, chai_1.expect)(e.fromLane).to.equal(e.toLane));
429
+ bPassThrough.forEach(e => expect(e.fromLane).to.equal(e.toLane));
432
430
  });
433
431
  it('branch-out edges have fromLane equal to commit lane', () => {
434
432
  const commits = [
@@ -436,10 +434,10 @@ describe('computeGraphRows', () => {
436
434
  { id: 'D', parentIds: [] },
437
435
  { id: 'E', parentIds: [] },
438
436
  ];
439
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
437
+ const rows = computeGraphRows(commits);
440
438
  const mRow = rows[0];
441
439
  const branchOut = mRow.edges.filter(e => e.type === 'branch-out');
442
- branchOut.forEach(e => (0, chai_1.expect)(e.fromLane).to.equal(mRow.lane));
440
+ branchOut.forEach(e => expect(e.fromLane).to.equal(mRow.lane));
443
441
  });
444
442
  it('merge-in edges have toLane equal to commit lane', () => {
445
443
  // M (lane 0) parents: D (lane 0, new), E (lane 1, new)
@@ -450,11 +448,11 @@ describe('computeGraphRows', () => {
450
448
  { id: 'E', parentIds: ['B'] }, // B already in lane 0
451
449
  { id: 'B', parentIds: [] },
452
450
  ];
453
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits2);
451
+ const rows = computeGraphRows(commits2);
454
452
  const eRow = rows[2]; // E
455
453
  const mergeIn = eRow.edges.filter(e => e.type === 'merge-in');
456
454
  // toLane of merge-in must equal the commit's own lane
457
- mergeIn.forEach(e => (0, chai_1.expect)(e.toLane).to.equal(eRow.lane));
455
+ mergeIn.forEach(e => expect(e.toLane).to.equal(eRow.lane));
458
456
  });
459
457
  });
460
458
  // -------------------------------------------------------------------------
@@ -476,59 +474,59 @@ describe('computeGraphRows', () => {
476
474
  { id: 'Q', parentIds: [] },
477
475
  ];
478
476
  it('A is placed in lane 0', () => {
479
- (0, chai_1.expect)((0, scm_history_graph_lanes_1.computeGraphRows)(commits)[0].lane).to.equal(0);
477
+ expect(computeGraphRows(commits)[0].lane).to.equal(0);
480
478
  });
481
479
  it('B is placed in lane 1 (sibling gets new lane)', () => {
482
- (0, chai_1.expect)((0, scm_history_graph_lanes_1.computeGraphRows)(commits)[1].lane).to.equal(1);
480
+ expect(computeGraphRows(commits)[1].lane).to.equal(1);
483
481
  });
484
482
  it('P converges back to lane 0', () => {
485
- (0, chai_1.expect)((0, scm_history_graph_lanes_1.computeGraphRows)(commits)[2].lane).to.equal(0);
483
+ expect(computeGraphRows(commits)[2].lane).to.equal(0);
486
484
  });
487
485
  it('A row (row 0) emits NO branch-out edges (siblings are not connected to each other)', () => {
488
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
486
+ const rows = computeGraphRows(commits);
489
487
  const aEdges = rows[0].edges;
490
488
  const branchOut = aEdges.filter(e => e.type === 'branch-out');
491
- (0, chai_1.expect)(branchOut.length).to.equal(0);
489
+ expect(branchOut.length).to.equal(0);
492
490
  });
493
491
  it('B row (row 1) has hasTopLine:false (lane starts fresh, no connection from above)', () => {
494
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
495
- (0, chai_1.expect)(rows[1].hasTopLine).to.equal(false);
492
+ const rows = computeGraphRows(commits);
493
+ expect(rows[1].hasTopLine).to.equal(false);
496
494
  });
497
495
  it('B row (row 1) has hasContinuation:true (lane continues as pass-through to parent P at row 2)', () => {
498
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
499
- (0, chai_1.expect)(rows[1].hasContinuation).to.equal(true);
496
+ const rows = computeGraphRows(commits);
497
+ expect(rows[1].hasContinuation).to.equal(true);
500
498
  });
501
499
  it('B row (row 1) does NOT emit a merge-in edge', () => {
502
500
  // A merge-in on B\'s row would mean "a top-of-row line curves into B\'s
503
501
  // circle", which is wrong since B was not pre-reserved.
504
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
502
+ const rows = computeGraphRows(commits);
505
503
  const mergeIn = rows[1].edges.filter(e => e.type === 'merge-in');
506
- (0, chai_1.expect)(mergeIn.length).to.equal(0);
504
+ expect(mergeIn.length).to.equal(0);
507
505
  });
508
506
  it('A row (row 0) has hasTopLine:false (A was not pre-reserved)', () => {
509
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
510
- (0, chai_1.expect)(rows[0].hasTopLine).to.equal(false);
507
+ const rows = computeGraphRows(commits);
508
+ expect(rows[0].hasTopLine).to.equal(false);
511
509
  });
512
510
  it('P row (row 2) has hasTopLine:true (continuing from A\'s lane)', () => {
513
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
514
- (0, chai_1.expect)(rows[2].hasTopLine).to.equal(true);
511
+ const rows = computeGraphRows(commits);
512
+ expect(rows[2].hasTopLine).to.equal(true);
515
513
  });
516
514
  it('B row (row 1) has a pass-through edge for lane 0', () => {
517
515
  // Lane 0 (pointing at P) continues as a pass-through through B\'s row.
518
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
516
+ const rows = computeGraphRows(commits);
519
517
  const passThrough = rows[1].edges.find(e => e.type === 'pass-through' && e.fromLane === 0 && e.toLane === 0);
520
- (0, chai_1.expect)(passThrough).to.not.be.undefined;
518
+ expect(passThrough).to.not.be.undefined;
521
519
  });
522
520
  it('P row (row 2) has a merge-in edge from lane 1', () => {
523
521
  // Lane 1 (kept alive through B) converges into P\'s lane 0 with a merge-in.
524
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
522
+ const rows = computeGraphRows(commits);
525
523
  const mergeIn = rows[2].edges.find(e => e.type === 'merge-in' && e.fromLane === 1 && e.toLane === 0);
526
- (0, chai_1.expect)(mergeIn).to.not.be.undefined;
524
+ expect(mergeIn).to.not.be.undefined;
527
525
  });
528
526
  it('P row (row 2) has no pass-through for lane 1 (lane 1 is freed at P)', () => {
529
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
527
+ const rows = computeGraphRows(commits);
530
528
  const spurious = rows[2].edges.find(e => e.fromLane === 1 && e.toLane === 1 && e.type === 'pass-through');
531
- (0, chai_1.expect)(spurious).to.be.undefined;
529
+ expect(spurious).to.be.undefined;
532
530
  });
533
531
  });
534
532
  // -------------------------------------------------------------------------
@@ -544,47 +542,47 @@ describe('computeGraphRows', () => {
544
542
  { id: 'P', parentIds: [] },
545
543
  ];
546
544
  it('A is lane 0', () => {
547
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
548
- (0, chai_1.expect)(rows[0].lane).to.equal(0);
545
+ const rows = computeGraphRows(commits);
546
+ expect(rows[0].lane).to.equal(0);
549
547
  });
550
548
  it('B is lane 1', () => {
551
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
552
- (0, chai_1.expect)(rows[1].lane).to.equal(1);
549
+ const rows = computeGraphRows(commits);
550
+ expect(rows[1].lane).to.equal(1);
553
551
  });
554
552
  it('C is in a lane other than lane 0', () => {
555
553
  // C is a sibling tip; its lane is re-assigned from freed lanes
556
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
557
- (0, chai_1.expect)(rows[2].lane).to.not.equal(0);
554
+ const rows = computeGraphRows(commits);
555
+ expect(rows[2].lane).to.not.equal(0);
558
556
  });
559
557
  it('A row emits NO branch-out edges (siblings are not connected to each other)', () => {
560
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
558
+ const rows = computeGraphRows(commits);
561
559
  const branchOuts = rows[0].edges.filter(e => e.type === 'branch-out');
562
- (0, chai_1.expect)(branchOuts.length).to.equal(0);
560
+ expect(branchOuts.length).to.equal(0);
563
561
  });
564
562
  it('B row emits NO branch-out edges', () => {
565
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
563
+ const rows = computeGraphRows(commits);
566
564
  const branchOuts = rows[1].edges.filter(e => e.type === 'branch-out');
567
- (0, chai_1.expect)(branchOuts.length).to.equal(0);
565
+ expect(branchOuts.length).to.equal(0);
568
566
  });
569
567
  it('B and C rows both have hasTopLine:false (lanes start fresh, no connection from above)', () => {
570
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
571
- (0, chai_1.expect)(rows[1].hasTopLine).to.equal(false);
572
- (0, chai_1.expect)(rows[2].hasTopLine).to.equal(false);
568
+ const rows = computeGraphRows(commits);
569
+ expect(rows[1].hasTopLine).to.equal(false);
570
+ expect(rows[2].hasTopLine).to.equal(false);
573
571
  });
574
572
  it('B and C rows have no merge-in edges', () => {
575
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
576
- (0, chai_1.expect)(rows[1].edges.filter(e => e.type === 'merge-in').length).to.equal(0);
577
- (0, chai_1.expect)(rows[2].edges.filter(e => e.type === 'merge-in').length).to.equal(0);
573
+ const rows = computeGraphRows(commits);
574
+ expect(rows[1].edges.filter(e => e.type === 'merge-in').length).to.equal(0);
575
+ expect(rows[2].edges.filter(e => e.type === 'merge-in').length).to.equal(0);
578
576
  });
579
577
  it('P row has merge-in edges from both B\'s lane and C\'s lane', () => {
580
- const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
578
+ const rows = computeGraphRows(commits);
581
579
  // P is at index 3, in lane 0. Both lane 1 (B) and lane 2 (C) must
582
580
  // converge into P with merge-in edges.
583
581
  const pRow = rows[3];
584
582
  const mergeInFromLane1 = pRow.edges.find(e => e.type === 'merge-in' && e.fromLane === rows[1].lane && e.toLane === pRow.lane);
585
583
  const mergeInFromLane2 = pRow.edges.find(e => e.type === 'merge-in' && e.fromLane === rows[2].lane && e.toLane === pRow.lane);
586
- (0, chai_1.expect)(mergeInFromLane1).to.not.be.undefined;
587
- (0, chai_1.expect)(mergeInFromLane2).to.not.be.undefined;
584
+ expect(mergeInFromLane1).to.not.be.undefined;
585
+ expect(mergeInFromLane2).to.not.be.undefined;
588
586
  });
589
587
  });
590
588
  });