@difizen/mana-app
Version:
281 lines (276 loc) • 14.3 kB
JavaScript
;
Object.defineProperty(exports, "__esModule", {
value: true
});
exports.TreeSelectionState = exports.FocusableTreeSelection = void 0;
var _manaObservable = require("@difizen/mana-observable");
var _treeIterator = require("./tree-iterator");
var _treeSelection = require("./tree-selection");
function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
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; }
function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }
function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : String(i); }
function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
/**
* A tree selection that might contain additional information about the tree node that has the focus.
*/
var FocusableTreeSelection;
(function (_FocusableTreeSelection) {
function is(arg) {
return _treeSelection.TreeSelection.is(arg) && 'focus' in arg;
}
_FocusableTreeSelection.is = is;
function focus(arg) {
return is(arg) ? arg.focus : undefined;
}
_FocusableTreeSelection.focus = focus;
})(FocusableTreeSelection || (exports.FocusableTreeSelection = FocusableTreeSelection = {}));
/**
* Class for representing and managing the selection state and the focus of a tree.
*/
var TreeSelectionState = exports.TreeSelectionState = /*#__PURE__*/function () {
function TreeSelectionState(tree) {
var selectionStack = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];
_classCallCheck(this, TreeSelectionState);
this.selectionStack = [];
this.tree = tree;
this.selectionStack = selectionStack;
}
_createClass(TreeSelectionState, [{
key: "nextState",
value: function nextState(selection) {
var _type$selection = _objectSpread({
type: _treeSelection.TreeSelection.SelectionType.DEFAULT
}, selection),
node = _type$selection.node,
type = _type$selection.type;
switch (type) {
case _treeSelection.TreeSelection.SelectionType.DEFAULT:
return this.handleDefault(this, node);
case _treeSelection.TreeSelection.SelectionType.TOGGLE:
return this.handleToggle(this, node);
case _treeSelection.TreeSelection.SelectionType.RANGE:
return this.handleRange(this, node);
default:
throw new Error("Unexpected tree selection type: ".concat(type, "."));
}
}
}, {
key: "selection",
value: function selection() {
var _this = this;
var copy = this.checkNoDefaultSelection(this.selectionStack);
var nodeIds = new Set();
for (var i = 0; i < copy.length; i++) {
var _copy$i = copy[i],
node = _copy$i.node,
type = _copy$i.type;
if (_treeSelection.TreeSelection.isRange(type)) {
var selection = copy[i];
var _iterator = _createForOfIteratorHelper(this.selectionRange(selection).map(function (n) {
return n.id;
})),
_step;
try {
for (_iterator.s(); !(_step = _iterator.n()).done;) {
var id = _step.value;
nodeIds.add(id);
}
} catch (err) {
_iterator.e(err);
} finally {
_iterator.f();
}
} else if (_treeSelection.TreeSelection.isToggle(type)) {
if (nodeIds.has(node.id)) {
nodeIds.delete(node.id);
} else {
nodeIds.add(node.id);
}
}
}
return Array.from(nodeIds.keys()).map(function (id) {
return _this.tree.getNode(id);
}).filter(_treeSelection.SelectableTreeNode.is).reverse();
}
}, {
key: "focus",
get: function get() {
var copy = this.checkNoDefaultSelection(this.selectionStack);
var candidate = copy[copy.length - 1].focus;
return this.toSelectableTreeNode(candidate);
}
}, {
key: "handleDefault",
value: function handleDefault(state, node) {
var tree = state.tree;
return new TreeSelectionState(tree, [{
node: node,
type: _treeSelection.TreeSelection.SelectionType.TOGGLE,
focus: node
}]);
}
}, {
key: "handleToggle",
value: function handleToggle(state, node) {
var _this2 = this;
var tree = state.tree,
selectionStack = state.selectionStack;
var copy = this.checkNoDefaultSelection(selectionStack).slice();
var focus = function () {
var allRanges = copy.filter(function (selection) {
return _treeSelection.TreeSelection.isRange(selection);
});
for (var i = allRanges.length - 1; i >= 0; i--) {
var latestRangeIndex = copy.indexOf(allRanges[i]);
var latestRangeSelection = copy[latestRangeIndex];
var latestRange = latestRangeSelection && latestRangeSelection.focus ? _this2.selectionRange(latestRangeSelection) : [];
if (latestRange.indexOf(node) !== -1) {
if ((0, _manaObservable.equals)(_this2.focus, latestRangeSelection.focus)) {
return latestRangeSelection.focus || node;
}
return _this2.focus;
}
}
return node;
}();
return new TreeSelectionState(tree, [].concat(_toConsumableArray(copy), [{
node: node,
type: _treeSelection.TreeSelection.SelectionType.TOGGLE,
focus: focus
}]));
}
}, {
key: "handleRange",
value: function handleRange(state, node) {
var tree = state.tree,
selectionStack = state.selectionStack;
var copy = this.checkNoDefaultSelection(selectionStack).slice();
var focus = FocusableTreeSelection.focus(copy[copy.length - 1]);
// Drop the previous range when we are trying to modify that.
if (_treeSelection.TreeSelection.isRange(copy[copy.length - 1])) {
var range = this.selectionRange(copy.pop());
// And we drop all preceding individual nodes that were contained in the range we are dropping.
// That means, anytime we cover individual nodes with a range, they will belong to the range so we need to drop them now.
for (var i = copy.length - 1; i >= 0; i--) {
if (range.indexOf(copy[i].node) !== -1) {
// Make sure to keep a reference to the focus while we are discarding previous elements. Otherwise, we lose this information.
focus = copy[i].focus;
copy.splice(i, 1);
}
}
}
return new TreeSelectionState(tree, [].concat(_toConsumableArray(copy), [{
node: node,
type: _treeSelection.TreeSelection.SelectionType.RANGE,
focus: focus
}]));
}
/**
* Returns with an array of items representing the selection range. The from node is the `focus` the to node
* is the selected node itself on the tree selection. Both the `from` node and the `to` node are inclusive.
*/
}, {
key: "selectionRange",
value: function selectionRange(selection) {
var fromNode = selection.focus;
var toNode = selection.node;
if (fromNode === undefined) {
return [];
}
if (toNode === fromNode) {
return [toNode];
}
var root = this.tree.root;
if (root === undefined) {
return [];
}
var to = this.tree.validateNode(toNode);
if (to === undefined) {
return [];
}
var from = this.tree.validateNode(fromNode);
if (from === undefined) {
return [];
}
var started = false;
var finished = false;
var range = [];
var _iterator2 = _createForOfIteratorHelper(new _treeIterator.DepthFirstTreeIterator(root, {
pruneCollapsed: true
})),
_step2;
try {
for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
var node = _step2.value;
if (finished) {
break;
}
// Only collect items which are between (inclusive) the `from` node and the `to` node.
if ((0, _manaObservable.equals)(node, from) || (0, _manaObservable.equals)(node, to)) {
if (started) {
finished = true;
} else {
started = true;
}
}
if (started) {
range.push(node);
}
}
// We need to reverse the selection range order.
} catch (err) {
_iterator2.e(err);
} finally {
_iterator2.f();
}
if (range.indexOf(from) > range.indexOf(to)) {
range.reverse();
}
return range.filter(_treeSelection.SelectableTreeNode.is);
}
}, {
key: "toSelectableTreeNode",
value: function toSelectableTreeNode(node) {
if (node) {
var candidate = this.tree.getNode(node.id);
if (candidate) {
if (_treeSelection.SelectableTreeNode.is(candidate)) {
return candidate;
}
console.warn("Could not map to a selectable tree node. Node with ID: ".concat(node.id, " is not a selectable node."));
} else {
console.warn("Could not map to a selectable tree node. Node does not exist with ID: ".concat(node.id, "."));
}
}
return undefined;
}
/**
* Checks whether the argument contains any `DEFAULT` tree selection type. If yes, throws an error, otherwise returns with a reference the argument.
*/
}, {
key: "checkNoDefaultSelection",
value: function checkNoDefaultSelection(selections) {
if (selections.some(function (selection) {
return selection.type === undefined || selection.type === _treeSelection.TreeSelection.SelectionType.DEFAULT;
})) {
throw new Error("Unexpected DEFAULT selection type. [".concat(selections.map(function (selection) {
return "ID: ".concat(selection.node.id, " | ").concat(selection.type);
}).join(', '), "]"));
}
return selections;
}
}]);
return TreeSelectionState;
}();