@atlaskit/editor-common
Version:
A package that contains common classes and components for editor and renderer
80 lines (77 loc) • 3.85 kB
JavaScript
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 { Fragment } from '@atlaskit/editor-prosemirror/model';
/** Rebuilds a list-like PM node from a flat array of items. */
/** Extracts top-level content nodes from an item being broken out past the root list. */
/**
* Build a replacement Fragment from a flat array of items.
*
* Items with depth >= 0 are grouped and rebuilt via `rebuildFn`.
* Items with depth < 0 are extracted via `extractContentFn`.
*/
export function buildReplacementFragment(_ref) {
var items = _ref.items,
schema = _ref.schema,
rebuildFn = _ref.rebuildFn,
extractContentFn = _ref.extractContentFn;
var fragment = Fragment.empty;
var pendingListSegment = [];
var pendingStartIdx = 0;
var contentStartOffsets = new Array(items.length);
var flushListSegment = function flushListSegment() {
if (pendingListSegment.length > 0) {
var fragmentOffset = fragment.size;
var result = rebuildFn(pendingListSegment, schema);
if (result) {
// Map the rebuild's content start offsets into the overall fragment.
for (var i = 0; i < pendingListSegment.length; i++) {
contentStartOffsets[pendingStartIdx + i] = fragmentOffset + result.contentStartOffsets[i];
}
fragment = fragment.addToEnd(result.node);
}
pendingListSegment = [];
}
};
var elIdx = 0;
var _iterator = _createForOfIteratorHelper(items),
_step;
try {
for (_iterator.s(); !(_step = _iterator.n()).done;) {
var _item = _step.value;
if (_item.depth < 0) {
flushListSegment();
// Extracted element — content children become top-level nodes.
// Record offset of first content child.
contentStartOffsets[elIdx] = fragment.size;
var _iterator2 = _createForOfIteratorHelper(extractContentFn(_item, schema)),
_step2;
try {
for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
var node = _step2.value;
fragment = fragment.addToEnd(node);
}
} catch (err) {
_iterator2.e(err);
} finally {
_iterator2.f();
}
} else {
if (pendingListSegment.length === 0) {
pendingStartIdx = elIdx;
}
pendingListSegment.push(_item);
}
elIdx++;
}
} catch (err) {
_iterator.e(err);
} finally {
_iterator.f();
}
flushListSegment();
return {
fragment: fragment,
contentStartOffsets: contentStartOffsets
};
}