UNPKG

@atlaskit/editor-plugin-show-diff

Version:

ShowDiff plugin for @atlaskit/editor-core

165 lines (164 loc) 8.65 kB
import _defineProperty from "@babel/runtime/helpers/defineProperty"; import _toConsumableArray from "@babel/runtime/helpers/toConsumableArray"; function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; } function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; } function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (!t) { if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t.return || t.return(); } finally { if (u) throw o; } } }; } function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } } function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; } import { simplifyChanges, ChangeSet } from 'prosemirror-changeset'; import { Mapping, ReplaceStep } from '@atlaskit/editor-prosemirror/transform'; import { optimizeChanges } from './optimizeChanges'; var mapPosition = function mapPosition(mapping, pos) { return mapping.map(pos); }; var createMapping = function createMapping(maps) { var mapping = new Mapping(); var _iterator = _createForOfIteratorHelper(maps), _step; try { for (_iterator.s(); !(_step = _iterator.n()).done;) { var map = _step.value; mapping.appendMap(map); } } catch (err) { _iterator.e(err); } finally { _iterator.f(); } return mapping; }; var createSpans = function createSpans(length) { return length > 0 ? [{ length: length, data: null }] : []; }; var mergeOverlappingByNewDocRange = function mergeOverlappingByNewDocRange(changes) { if (changes.length <= 1) { return changes; } var sortedChanges = _toConsumableArray(changes).sort(function (left, right) { return left.fromB - right.fromB; }); var merged = []; var current = _objectSpread({}, sortedChanges[0]); for (var i = 1; i < sortedChanges.length; i++) { var next = sortedChanges[i]; var isOverlapping = next.fromB <= current.toB; if (isOverlapping) { current = { fromA: Math.min(current.fromA, next.fromA), toA: Math.max(current.toA, next.toA), fromB: Math.min(current.fromB, next.fromB), toB: Math.max(current.toB, next.toB), deleted: [].concat(_toConsumableArray(current.deleted), _toConsumableArray(next.deleted)), inserted: [].concat(_toConsumableArray(current.inserted), _toConsumableArray(next.inserted)) }; } else { merged.push(current); current = _objectSpread({}, next); } } merged.push(current); return merged; }; var isReplaceStepForTextBlockNode = function isReplaceStepForTextBlockNode(step, before, from, to) { var _replacedSlice$conten, _replacingSlice$conte, _replacedSlice$conten2; if (!(step instanceof ReplaceStep)) { return false; } if (step.slice.openStart !== 0 || step.slice.openEnd !== 0) { return false; } var replacedSlice = before.slice(from, to); var replacingSlice = step.slice; return Boolean(replacedSlice.openStart === 0 && replacedSlice.openEnd === 0 && replacedSlice.content.childCount === 1 && replacingSlice.content.childCount === 1 && ((_replacedSlice$conten = replacedSlice.content.firstChild) === null || _replacedSlice$conten === void 0 ? void 0 : _replacedSlice$conten.type.name) === ((_replacingSlice$conte = replacingSlice.content.firstChild) === null || _replacingSlice$conte === void 0 ? void 0 : _replacingSlice$conte.type.name) && ((_replacedSlice$conten2 = replacedSlice.content.firstChild) === null || _replacedSlice$conten2 === void 0 ? void 0 : _replacedSlice$conten2.type.isTextblock)); }; export var diffBySteps = function diffBySteps(originalDoc, steps) { var changes = []; var currentDoc = originalDoc; var successfulStepMaps = []; var rangedSteps = []; var _iterator2 = _createForOfIteratorHelper(steps), _step2; try { for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) { var step = _step2.value; var before = currentDoc; var result = step.apply(currentDoc); if (result.failed !== null || !result.doc) { continue; } var stepMap = step.getMap(); var rangeStep = step; if (typeof rangeStep.from === 'number' && typeof rangeStep.to === 'number') { rangedSteps.push({ before: before, doc: result.doc, from: rangeStep.from, to: rangeStep.to, mapIndex: successfulStepMaps.length, step: step, stepMap: stepMap }); } successfulStepMaps.push(stepMap); currentDoc = result.doc; } } catch (err) { _iterator2.e(err); } finally { _iterator2.f(); } for (var _i = 0, _rangedSteps = rangedSteps; _i < _rangedSteps.length; _i++) { var rangedStep = _rangedSteps[_i]; // Mapping from original -> doc before this step. var originalToBeforeStep = createMapping(successfulStepMaps.slice(0, rangedStep.mapIndex)); var beforeStepToOriginal = originalToBeforeStep.invert(); var fromA = mapPosition(beforeStepToOriginal, rangedStep.from); var toA = mapPosition(beforeStepToOriginal, rangedStep.to); // Map the step range into final steppedDoc coordinates. var fromAfterStep = rangedStep.stepMap.map(rangedStep.from, -1); var toAfterStep = rangedStep.stepMap.map(rangedStep.to, 1); var afterStepToFinal = createMapping(successfulStepMaps.slice(rangedStep.mapIndex + 1)); var fromB = mapPosition(afterStepToFinal, fromAfterStep); var toB = mapPosition(afterStepToFinal, toAfterStep); if (isReplaceStepForTextBlockNode(rangedStep.step, rangedStep.before, rangedStep.from, rangedStep.to)) { var granularStepChanges = ChangeSet.create(rangedStep.before).addSteps(rangedStep.doc, [rangedStep.stepMap], null); var optimizedGranularStepChanges = optimizeChanges(simplifyChanges(granularStepChanges.changes, granularStepChanges.startDoc)); var _iterator3 = _createForOfIteratorHelper(optimizedGranularStepChanges), _step3; try { for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) { var granularChange = _step3.value; var granularFromA = mapPosition(beforeStepToOriginal, granularChange.fromA); var granularToA = mapPosition(beforeStepToOriginal, granularChange.toA); var granularFromB = mapPosition(afterStepToFinal, granularChange.fromB); var granularToB = mapPosition(afterStepToFinal, granularChange.toB); changes.push({ fromA: granularFromA, toA: granularToA, fromB: granularFromB, toB: granularToB, deleted: createSpans(Math.max(0, granularToA - granularFromA)), inserted: createSpans(Math.max(0, granularToB - granularFromB)) }); } } catch (err) { _iterator3.e(err); } finally { _iterator3.f(); } continue; } changes.push({ fromA: fromA, toA: toA, fromB: fromB, toB: toB, deleted: createSpans(Math.max(0, toA - fromA)), inserted: createSpans(Math.max(0, toB - fromB)) }); } return mergeOverlappingByNewDocRange(changes); };