@atlaskit/editor-plugin-show-diff
Version:
ShowDiff plugin for @atlaskit/editor-core
77 lines (75 loc) • 3.81 kB
JavaScript
;
var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
Object.defineProperty(exports, "__esModule", {
value: true
});
exports.groupChangesByBlock = groupChangesByBlock;
var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime/helpers/toConsumableArray"));
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; }
/**
* Finds the position range of the top-level block (direct child of doc) that contains `pos`.
* Returns null if `pos` is at the doc boundary or outside the doc content.
*/
function getTopLevelBlockAt(doc, from, to) {
return {
from: doc.resolve(from).before(1),
to: doc.resolve(to).after(1)
};
}
/**
* Groups all changes that fall within the same top-level block (direct child of doc)
* and merges them into a single change spanning the full block in both old and new doc.
*/
function groupChangesByBlock(changes, docA, docB) {
var groups = new Map();
var _iterator = _createForOfIteratorHelper(changes),
_step;
try {
for (_iterator.s(); !(_step = _iterator.n()).done;) {
var change = _step.value;
var blockA = getTopLevelBlockAt(docA, change.fromA, change.toA);
var blockB = getTopLevelBlockAt(docB, change.fromB, change.toB);
if (!groups.has(blockB.from)) {
groups.set(blockB.from, {
fromB: blockB.from,
toB: blockB.to,
fromA: blockA ? blockA.from : change.fromA,
toA: blockA ? blockA.to : change.toA,
changed: []
});
}
var group = groups.get(blockB.from);
if (group) {
group.changed = [].concat((0, _toConsumableArray2.default)(group.changed), (0, _toConsumableArray2.default)(change.inserted), (0, _toConsumableArray2.default)(change.deleted));
}
}
} catch (err) {
_iterator.e(err);
} finally {
_iterator.f();
}
return Array.from(groups.values()).sort(function (a, b) {
return a.fromB - b.fromB;
}).map(function (_ref) {
var fromA = _ref.fromA,
toA = _ref.toA,
fromB = _ref.fromB,
toB = _ref.toB,
changed = _ref.changed;
return {
fromA: fromA,
toA: toA,
fromB: fromB,
toB: toB,
/**
* We add all changes (both deleted and inserted) as that will
* inform the calculateDiffDecorations function that changes should be rendered
* (even if the change is only one of the two).
*/
deleted: changed,
inserted: changed
};
});
}