UNPKG

@graffy/common

Version:

Common libraries that used by various Graffy modules.

45 lines (36 loc) 1.98 kB
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; } /* getKnown accepts a graph and returns a query for the knowledge in that graph. */ export default function getKnown(graph, version) { if (version === void 0) { version = 0; } var query = []; for (var _iterator = _createForOfIteratorHelperLoose(graph), _step; !(_step = _iterator()).done;) { var _step$value = _step.value, key = _step$value.key, end = _step$value.end, children = _step$value.children; var node = { key: key, version: version }; if (end) { if (end !== key) node.end = end; node.options = { subtree: true }; } if (children) { node.children = getKnown(children); } else { node.value = 1; } query.push(node); } return query; }