@graffy/common
Version:
Common libraries that used by various Graffy modules.
34 lines (30 loc) • 2.06 kB
JavaScript
function _createForOfIteratorHelperLoose(o, allowArrayLike) { var it; if (typeof Symbol === "undefined" || o[Symbol.iterator] == null) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } it = o[Symbol.iterator](); return it.next.bind(it); }
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; }
// import { isRange } from '../node';
// import { keyAfter } from './step';
export default function setVersion(graph, version) {
// mergeRanges(graph);
for (var _iterator = _createForOfIteratorHelperLoose(graph), _step; !(_step = _iterator()).done;) {
var node = _step.value;
node.version = version;
if (node.children) setVersion(node.children, version);
}
return graph;
} // function mergeRanges(graph) {
// for (let i = 0; i < graph.length; i++) {
// if (!isRange(graph[i])) continue;
// let j = i;
// do {
// j++;
// } while (isRange(graph[j]) && graph[j].key === keyAfter(graph[j - 1].end));
// j = j - 1;
// if (j === i) continue;
// graph.splice(i, j - i + 1, {
// key: graph[i].key,
// end: graph[j].end,
// version: graph[i].version,
// });
// // i = j;
// }
// }