@sanity/desk-tool
Version:
Tool for managing all sorts of content in a structured manner
48 lines (45 loc) • 2.81 kB
JavaScript
;
Object.defineProperty(exports, "__esModule", {
value: true
});
exports._sortElements = _sortElements;
var _getDOMPath2 = require("./_getDOMPath");
function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, 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 normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
var EMPTY_PATH = [];
/**
* @internal
*/
function _sortElements(rootElement, elements) {
// Create a map containing the DOM path of each pane element.
// The DOM path is relative to the `rootElement`, and is used in the next step for sorting.
var map = new WeakMap();
var _iterator = _createForOfIteratorHelper(elements),
_step;
try {
for (_iterator.s(); !(_step = _iterator.n()).done;) {
var element = _step.value;
map.set(element, (0, _getDOMPath2._getDOMPath)(rootElement, element));
}
} catch (err) {
_iterator.e(err);
} finally {
_iterator.f();
}
var _sortByElementPath = (a, b) => {
var _a = map.get(a) || EMPTY_PATH;
var _b = map.get(b) || EMPTY_PATH;
var len = Math.max(_a.length, _b.length);
// Loop until there are different indexes
for (var i = 0; i < len; i += 1) {
var aIndex = _a[i] || -1;
var bIndex = _b[i] || -1;
if (aIndex !== bIndex) {
return aIndex - bIndex;
}
}
return 0;
};
elements.sort(_sortByElementPath);
}