jqtree 1.6.2 → 1.7.0

package/lib/node.js

@@ -4,40 +4,30 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.getPositionName = exports.getPosition = exports.Position = exports.Node = void 0;
-
 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 _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 _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, descriptor.key, descriptor); } }
-
+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 _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
-
+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 _toPropertyKey(arg) { var key = _toPrimitive(arg, "string"); return _typeof(key) === "symbol" ? key : String(key); }
+function _toPrimitive(input, hint) { if (_typeof(input) !== "object" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || "default"); if (_typeof(res) !== "object") return res; throw new TypeError("@@toPrimitive must return a primitive value."); } return (hint === "string" ? String : Number)(input); }
 function _typeof(obj) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && "function" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }, _typeof(obj); }
-
 var Position;
 exports.Position = Position;
-
 (function (Position) {
   Position[Position["Before"] = 1] = "Before";
   Position[Position["After"] = 2] = "After";
   Position[Position["Inside"] = 3] = "Inside";
   Position[Position["None"] = 4] = "None";
 })(Position || (exports.Position = Position = {}));
-
 var positionNames = {
   before: Position.Before,
   after: Position.After,
   inside: Position.Inside,
   none: Position.None
 };
-
 var getPositionName = function getPositionName(position) {
   for (var name in positionNames) {
     if (Object.prototype.hasOwnProperty.call(positionNames, name)) {
@@ -46,67 +36,47 @@ var getPositionName = function getPositionName(position) {
       }
     }
   }
-
   return "";
 };
-
 exports.getPositionName = getPositionName;
-
 var getPosition = function getPosition(name) {
   return positionNames[name];
 };
-
 exports.getPosition = getPosition;
-
 var isNodeRecordWithChildren = function isNodeRecordWithChildren(data) {
   return _typeof(data) === "object" && "children" in data && data["children"] instanceof Array;
 };
-
 var Node = /*#__PURE__*/function () {
   function Node() {
     var o = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : null;
     var isRoot = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
     var nodeClass = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : Node;
-
     _classCallCheck(this, Node);
-
     _defineProperty(this, "id", void 0);
-
     _defineProperty(this, "name", void 0);
-
     _defineProperty(this, "children", void 0);
-
     _defineProperty(this, "parent", void 0);
-
     _defineProperty(this, "idMapping", void 0);
-
     _defineProperty(this, "tree", void 0);
-
     _defineProperty(this, "nodeClass", void 0);
-
     _defineProperty(this, "load_on_demand", void 0);
-
     _defineProperty(this, "is_open", void 0);
-
     _defineProperty(this, "element", void 0);
-
     _defineProperty(this, "is_loading", void 0);
-
     _defineProperty(this, "isEmptyFolder", void 0);
-
     this.name = "";
     this.isEmptyFolder = false;
     this.load_on_demand = false;
     this.setData(o);
     this.children = [];
     this.parent = null;
-
     if (isRoot) {
       this.idMapping = new Map();
       this.tree = this;
       this.nodeClass = nodeClass;
     }
   }
+
   /*
   Set the data of this node.
    setData(string): set the name of the node
@@ -118,8 +88,6 @@ var Node = /*#__PURE__*/function () {
    * This is an internal function; it is not in the docs
   * Does not remove existing node values
   */
-
-
   _createClass(Node, [{
     key: "setData",
     value: function setData(o) {
@@ -131,7 +99,6 @@ var Node = /*#__PURE__*/function () {
         for (var _key in o) {
           if (Object.prototype.hasOwnProperty.call(o, _key)) {
             var value = o[_key];
-
             if (_key === "label" || _key === "name") {
               // You can use the 'label' key instead of 'name'; this is a legacy feature
               if (typeof value === "string") {
@@ -145,6 +112,7 @@ var Node = /*#__PURE__*/function () {
         }
       }
     }
+
     /*
     Create tree from data.
      Structure of data is:
@@ -161,23 +129,17 @@ var Node = /*#__PURE__*/function () {
         }
     ]
     */
-
   }, {
     key: "loadFromData",
     value: function loadFromData(data) {
       this.removeChildren();
-
       var _iterator = _createForOfIteratorHelper(data),
-          _step;
-
+        _step;
       try {
         for (_iterator.s(); !(_step = _iterator.n()).done;) {
           var o = _step.value;
-
           var _node = this.createNode(o);
-
           this.addChild(_node);
-
           if (isNodeRecordWithChildren(o)) {
             if (o.children.length === 0) {
               _node.isEmptyFolder = true;
@@ -191,22 +153,22 @@ var Node = /*#__PURE__*/function () {
       } finally {
         _iterator.f();
       }
-
       return this;
     }
+
     /*
     Add child.
      tree.addChild(
         new Node('child1')
     );
     */
-
   }, {
     key: "addChild",
     value: function addChild(node) {
       this.children.push(node);
       node.setParent(this);
     }
+
     /*
     Add child at position. Index starts at 0.
      tree.addChildAtPosition(
@@ -214,18 +176,17 @@ var Node = /*#__PURE__*/function () {
         1
     );
     */
-
   }, {
     key: "addChildAtPosition",
     value: function addChildAtPosition(node, index) {
       this.children.splice(index, 0, node);
       node.setParent(this);
     }
+
     /*
     Remove child. This also removes the children of the node.
      tree.removeChild(tree.children[0]);
     */
-
   }, {
     key: "removeChild",
     value: function removeChild(node) {
@@ -233,23 +194,23 @@ var Node = /*#__PURE__*/function () {
       node.removeChildren();
       this.doRemoveChild(node);
     }
+
     /*
     Get child index.
      var index = getChildIndex(node);
     */
-
   }, {
     key: "getChildIndex",
     value: function getChildIndex(node) {
       return this.children.indexOf(node);
     }
+
     /*
     Does the tree have children?
      if (tree.hasChildren()) {
         //
     }
     */
-
   }, {
     key: "hasChildren",
     value: function hasChildren() {
@@ -260,6 +221,7 @@ var Node = /*#__PURE__*/function () {
     value: function isFolder() {
       return this.hasChildren() || this.load_on_demand;
     }
+
     /*
     Iterate over all the nodes in the tree.
      Calls callback with (node, level).
@@ -272,20 +234,17 @@ var Node = /*#__PURE__*/function () {
         }
     );
      */
-
   }, {
     key: "iterate",
     value: function iterate(callback) {
       var _iterate = function _iterate(node, level) {
         if (node.children) {
           var _iterator2 = _createForOfIteratorHelper(node.children),
-              _step2;
-
+            _step2;
           try {
             for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
               var child = _step2.value;
               var result = callback(child, level);
-
               if (result && child.hasChildren()) {
                 _iterate(child, level + 1);
               }
@@ -297,16 +256,15 @@ var Node = /*#__PURE__*/function () {
           }
         }
       };
-
       _iterate(this, 0);
     }
+
     /*
     Move node relative to another node.
      Argument position: Position.BEFORE, Position.AFTER or Position.Inside
      // move node1 after node2
     tree.moveNode(node1, node2, Position.AFTER);
     */
-
   }, {
     key: "moveNode",
     value: function moveNode(movedNode, targetNode, position) {
@@ -316,7 +274,6 @@ var Node = /*#__PURE__*/function () {
         return false;
       } else {
         movedNode.parent.doRemoveChild(movedNode);
-
         switch (position) {
           case Position.After:
             {
@@ -324,60 +281,50 @@ var Node = /*#__PURE__*/function () {
                 targetNode.parent.addChildAtPosition(movedNode, targetNode.parent.getChildIndex(targetNode) + 1);
                 return true;
               }
-
               return false;
             }
-
           case Position.Before:
             {
               if (targetNode.parent) {
                 targetNode.parent.addChildAtPosition(movedNode, targetNode.parent.getChildIndex(targetNode));
                 return true;
               }
-
               return false;
             }
-
           case Position.Inside:
             {
               // move inside as first child
               targetNode.addChildAtPosition(movedNode, 0);
               return true;
             }
-
           default:
             return false;
         }
       }
     }
+
     /*
     Get the tree as data.
     */
-
   }, {
     key: "getData",
     value: function getData() {
       var includeParent = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : false;
-
       var getDataFromNodes = function getDataFromNodes(nodes) {
         return nodes.map(function (node) {
           var tmpNode = {};
-
           for (var k in node) {
             if (["parent", "children", "element", "idMapping", "load_on_demand", "nodeClass", "tree", "isEmptyFolder"].indexOf(k) === -1 && Object.prototype.hasOwnProperty.call(node, k)) {
               var v = node[k];
               tmpNode[k] = v;
             }
           }
-
           if (node.hasChildren()) {
             tmpNode["children"] = getDataFromNodes(node.children);
           }
-
           return tmpNode;
         });
       };
-
       if (includeParent) {
         return getDataFromNodes([this]);
       } else {
@@ -397,11 +344,9 @@ var Node = /*#__PURE__*/function () {
       var node = this.getNodeByCallback(function (n) {
         return n.name === name;
       });
-
       if (!node) {
         throw "Node with name ".concat(name, " not found");
       }
-
       return node;
     }
   }, {
@@ -427,14 +372,11 @@ var Node = /*#__PURE__*/function () {
         return null;
       } else {
         var _node2 = this.createNode(nodeInfo);
-
         var childIndex = this.parent.getChildIndex(this);
         this.parent.addChildAtPosition(_node2, childIndex + 1);
-
         if (isNodeRecordWithChildren(nodeInfo) && nodeInfo.children.length) {
           _node2.loadFromData(nodeInfo.children);
         }
-
         return _node2;
       }
     }
@@ -445,14 +387,11 @@ var Node = /*#__PURE__*/function () {
         return null;
       } else {
         var _node3 = this.createNode(nodeInfo);
-
         var childIndex = this.parent.getChildIndex(this);
         this.parent.addChildAtPosition(_node3, childIndex);
-
         if (isNodeRecordWithChildren(nodeInfo) && nodeInfo.children.length) {
           _node3.loadFromData(nodeInfo.children);
         }
-
         return _node3;
       }
     }
@@ -463,16 +402,12 @@ var Node = /*#__PURE__*/function () {
         return null;
       } else {
         var newParent = this.createNode(nodeInfo);
-
         if (this.tree) {
           newParent.setParent(this.tree);
         }
-
         var originalParent = this.parent;
-
         var _iterator3 = _createForOfIteratorHelper(originalParent.children),
-            _step3;
-
+          _step3;
         try {
           for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
             var child = _step3.value;
@@ -483,7 +418,6 @@ var Node = /*#__PURE__*/function () {
         } finally {
           _iterator3.f();
         }
-
         originalParent.children = [];
         originalParent.addChild(newParent);
         return newParent;
@@ -502,11 +436,9 @@ var Node = /*#__PURE__*/function () {
     value: function append(nodeInfo) {
       var node = this.createNode(nodeInfo);
       this.addChild(node);
-
       if (isNodeRecordWithChildren(nodeInfo) && nodeInfo.children.length) {
         node.loadFromData(nodeInfo.children);
       }
-
       return node;
     }
   }, {
@@ -514,26 +446,21 @@ var Node = /*#__PURE__*/function () {
     value: function prepend(nodeInfo) {
       var node = this.createNode(nodeInfo);
       this.addChildAtPosition(node, 0);
-
       if (isNodeRecordWithChildren(nodeInfo) && nodeInfo.children.length) {
         node.loadFromData(nodeInfo.children);
       }
-
       return node;
     }
   }, {
     key: "isParentOf",
     value: function isParentOf(node) {
       var parent = node.parent;
-
       while (parent) {
         if (parent === this) {
           return true;
         }
-
         parent = parent.parent;
       }
-
       return false;
     }
   }, {
@@ -546,7 +473,6 @@ var Node = /*#__PURE__*/function () {
         level += 1;
         node = node.parent;
       }
-
       return level;
     }
   }, {
@@ -572,10 +498,8 @@ var Node = /*#__PURE__*/function () {
     key: "removeChildren",
     value: function removeChildren() {
       var _this = this;
-
       this.iterate(function (child) {
         var _this$tree;
-
         (_this$tree = _this.tree) === null || _this$tree === void 0 ? void 0 : _this$tree.removeNodeFromIndex(child);
         return true;
       });
@@ -588,7 +512,6 @@ var Node = /*#__PURE__*/function () {
         return null;
       } else {
         var previousIndex = this.parent.getChildIndex(this) - 1;
-
         if (previousIndex >= 0) {
           return this.parent.children[previousIndex];
         } else {
@@ -603,7 +526,6 @@ var Node = /*#__PURE__*/function () {
         return null;
       } else {
         var nextIndex = this.parent.getChildIndex(this) + 1;
-
         if (nextIndex < this.parent.children.length) {
           return this.parent.children[nextIndex];
         } else {
@@ -626,7 +548,6 @@ var Node = /*#__PURE__*/function () {
         if (f(node)) {
           result.push(node);
         }
-
         return true;
       });
       return result;
@@ -635,8 +556,23 @@ var Node = /*#__PURE__*/function () {
     key: "getNextNode",
     value: function getNextNode() {
       var includeChildren = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : true;
-
-      if (includeChildren && this.hasChildren() && this.is_open) {
+      if (includeChildren && this.hasChildren()) {
+        return this.children[0];
+      } else if (!this.parent) {
+        return null;
+      } else {
+        var nextSibling = this.getNextSibling();
+        if (nextSibling) {
+          return nextSibling;
+        } else {
+          return this.parent.getNextNode(false);
+        }
+      }
+    }
+  }, {
+    key: "getNextVisibleNode",
+    value: function getNextVisibleNode() {
+      if (this.hasChildren() && this.is_open) {
         // First child
         return this.children[0];
       } else {
@@ -644,7 +580,6 @@ var Node = /*#__PURE__*/function () {
           return null;
         } else {
           var nextSibling = this.getNextSibling();
-
           if (nextSibling) {
             // Next sibling
             return nextSibling;
@@ -662,17 +597,30 @@ var Node = /*#__PURE__*/function () {
         return null;
       } else {
         var previousSibling = this.getPreviousSibling();
-
-        if (previousSibling) {
-          if (!previousSibling.hasChildren() || !previousSibling.is_open) {
-            // Previous sibling
-            return previousSibling;
-          } else {
-            // Last child of previous sibling
-            return previousSibling.getLastChild();
-          }
+        if (!previousSibling) {
+          return this.getParent();
+        } else if (previousSibling.hasChildren()) {
+          return previousSibling.getLastChild();
         } else {
+          return previousSibling;
+        }
+      }
+    }
+  }, {
+    key: "getPreviousVisibleNode",
+    value: function getPreviousVisibleNode() {
+      if (!this.parent) {
+        return null;
+      } else {
+        var previousSibling = this.getPreviousSibling();
+        if (!previousSibling) {
           return this.getParent();
+        } else if (!previousSibling.hasChildren() || !previousSibling.is_open) {
+          // Previous sibling
+          return previousSibling;
+        } else {
+          // Last child of previous sibling
+          return previousSibling.getLastChild();
         }
       }
     }
@@ -696,40 +644,33 @@ var Node = /*#__PURE__*/function () {
         return null;
       } else {
         var lastChild = this.children[this.children.length - 1];
-
         if (!(lastChild.hasChildren() && lastChild.is_open)) {
           return lastChild;
         } else {
           return lastChild.getLastChild();
         }
       }
-    } // Init Node from data without making it the root of the tree
+    }
 
+    // Init Node from data without making it the root of the tree
   }, {
     key: "initFromData",
     value: function initFromData(data) {
       var _this2 = this;
-
       var addNode = function addNode(nodeData) {
         _this2.setData(nodeData);
-
         if (isNodeRecordWithChildren(nodeData) && nodeData.children.length) {
           addChildren(nodeData.children);
         }
       };
-
       var addChildren = function addChildren(childrenData) {
         var _iterator4 = _createForOfIteratorHelper(childrenData),
-            _step4;
-
+          _step4;
         try {
           for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
             var child = _step4.value;
-
             var _node4 = _this2.createNode();
-
             _node4.initFromData(child);
-
             _this2.addChild(_node4);
           }
         } catch (err) {
@@ -738,14 +679,12 @@ var Node = /*#__PURE__*/function () {
           _iterator4.f();
         }
       };
-
       addNode(data);
     }
   }, {
     key: "setParent",
     value: function setParent(parent) {
       var _this$tree2;
-
       this.parent = parent;
       this.tree = parent.tree;
       (_this$tree2 = this.tree) === null || _this$tree2 === void 0 ? void 0 : _this$tree2.addNodeToIndex(this);
@@ -754,7 +693,6 @@ var Node = /*#__PURE__*/function () {
     key: "doRemoveChild",
     value: function doRemoveChild(node) {
       var _this$tree3;
-
       this.children.splice(this.getChildIndex(node), 1);
       (_this$tree3 = this.tree) === null || _this$tree3 === void 0 ? void 0 : _this$tree3.removeNodeFromIndex(node);
     }
@@ -762,7 +700,6 @@ var Node = /*#__PURE__*/function () {
     key: "getNodeClass",
     value: function getNodeClass() {
       var _this$tree4;
-
       return this.nodeClass || (this === null || this === void 0 ? void 0 : (_this$tree4 = this.tree) === null || _this$tree4 === void 0 ? void 0 : _this$tree4.nodeClass) || Node;
     }
   }, {
@@ -772,8 +709,6 @@ var Node = /*#__PURE__*/function () {
       return new nodeClass(nodeData);
     }
   }]);
-
   return Node;
 }();
-
 exports.Node = Node;