handsontable 12.1.3 → 12.3.0-next-bb1a7c2-20221208

package/utils/dataStructures/linkedList.js

@@ -1,14 +1,23 @@
 "use strict";
 
+require("core-js/modules/es.symbol.to-primitive.js");
+require("core-js/modules/es.date.to-primitive.js");
+require("core-js/modules/es.symbol.js");
+require("core-js/modules/es.symbol.description.js");
+require("core-js/modules/es.object.to-string.js");
+require("core-js/modules/es.number.constructor.js");
+require("core-js/modules/es.symbol.iterator.js");
+require("core-js/modules/es.array.iterator.js");
+require("core-js/modules/es.string.iterator.js");
+require("core-js/modules/web.dom-collections.iterator.js");
+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); }
 exports.__esModule = true;
 exports.default = exports.NodeStructure = void 0;
-
-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 _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 _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
-
 /**
  * Refactored implementation of LinkedList (part of javascript-algorithms project) by Github users:
  * mgechev, AndriiHeonia, Microfed and Jakeh (part of javascript-algorithms project - all project contributors
@@ -16,7 +25,6 @@ function _classCallCheck(instance, Constructor) { if (!(instance instanceof Cons
  *
  * Link to repository: https://github.com/mgechev/javascript-algorithms.
  */
-
 /**
  * Linked list node.
  *
@@ -25,7 +33,6 @@ function _classCallCheck(instance, Constructor) { if (!(instance instanceof Cons
  */
 var NodeStructure = /*#__PURE__*/_createClass(function NodeStructure(data) {
   _classCallCheck(this, NodeStructure);
-
   /**
    * Data of the node.
    *
@@ -37,14 +44,12 @@ var NodeStructure = /*#__PURE__*/_createClass(function NodeStructure(data) {
    *
    * @member {NodeStructure}
    */
-
   this.next = null;
   /**
    * Previous node.
    *
    * @member {NodeStructure}
    */
-
   this.prev = null;
 });
 /**
@@ -53,29 +58,23 @@ var NodeStructure = /*#__PURE__*/_createClass(function NodeStructure(data) {
  * @class LinkedList
  * @util
  */
-
-
 exports.NodeStructure = NodeStructure;
-
 var LinkedList = /*#__PURE__*/function () {
   function LinkedList() {
     _classCallCheck(this, LinkedList);
-
     this.first = null;
     this.last = null;
   }
+
   /**
    * Add data to the end of linked list.
    *
    * @param {object} data Data which should be added.
    */
-
-
   _createClass(LinkedList, [{
     key: "push",
     value: function push(data) {
       var node = new NodeStructure(data);
-
       if (this.first === null) {
         this.first = node;
         this.last = node;
@@ -86,17 +85,16 @@ var LinkedList = /*#__PURE__*/function () {
         temp.next = node;
       }
     }
+
     /**
      * Add data to the beginning of linked list.
      *
      * @param {object} data Data which should be added.
      */
-
   }, {
     key: "unshift",
     value: function unshift(data) {
       var node = new NodeStructure(data);
-
       if (this.first === null) {
         this.first = node;
         this.last = node;
@@ -107,138 +105,121 @@ var LinkedList = /*#__PURE__*/function () {
         temp.prev = node;
       }
     }
+
     /**
      * In order traversal of the linked list.
      *
      * @param {Function} callback Callback which should be executed on each node.
      */
-
   }, {
     key: "inorder",
     value: function inorder(callback) {
       var temp = this.first;
-
       while (temp) {
         callback(temp);
         temp = temp.next;
       }
     }
+
     /**
      * Remove data from the linked list.
      *
      * @param {object} data Data which should be removed.
      * @returns {boolean} Returns true if data has been removed.
      */
-
   }, {
     key: "remove",
     value: function remove(data) {
       if (this.first === null) {
         return false;
       }
-
       var temp = this.first;
       var next;
       var prev;
-
       while (temp) {
         if (temp.data === data) {
           next = temp.next;
           prev = temp.prev;
-
           if (next) {
             next.prev = prev;
           }
-
           if (prev) {
             prev.next = next;
           }
-
           if (temp === this.first) {
             this.first = next;
           }
-
           if (temp === this.last) {
             this.last = prev;
           }
-
           return true;
         }
-
         temp = temp.next;
       }
-
       return false;
     }
+
     /**
      * Check if linked list contains cycle.
      *
      * @returns {boolean} Returns true if linked list contains cycle.
      */
-
   }, {
     key: "hasCycle",
     value: function hasCycle() {
       var fast = this.first;
       var slow = this.first;
-
       while (true) {
         if (fast === null) {
           return false;
         }
-
         fast = fast.next;
-
         if (fast === null) {
           return false;
         }
-
         fast = fast.next;
         slow = slow.next;
-
         if (fast === slow) {
           return true;
         }
       }
     }
+
     /**
      * Return last node from the linked list.
      *
      * @returns {NodeStructure} Last node.
      */
-
   }, {
     key: "pop",
     value: function pop() {
       if (this.last === null) {
         return null;
       }
-
       var temp = this.last;
       this.last = this.last.prev;
       return temp;
     }
+
     /**
      * Return first node from the linked list.
      *
      * @returns {NodeStructure} First node.
      */
-
   }, {
     key: "shift",
     value: function shift() {
       if (this.first === null) {
         return null;
       }
-
       var temp = this.first;
       this.first = this.first.next;
       return temp;
     }
+
     /**
      * Reverses the linked list recursively.
      */
-
   }, {
     key: "recursiveReverse",
     value: function recursiveReverse() {
@@ -250,36 +231,31 @@ var LinkedList = /*#__PURE__*/function () {
         if (!next) {
           return;
         }
-
         inverse(next, next.next);
         next.next = current;
       }
-
       if (!this.first) {
         return;
       }
-
       inverse(this.first, this.first.next);
       this.first.next = null;
       var temp = this.first;
       this.first = this.last;
       this.last = temp;
     }
+
     /**
      * Reverses the linked list iteratively.
      */
-
   }, {
     key: "reverse",
     value: function reverse() {
       if (!this.first || !this.first.next) {
         return;
       }
-
       var current = this.first.next;
       var prev = this.first;
       var temp;
-
       while (current) {
         temp = current.next;
         current.next = prev;
@@ -287,7 +263,6 @@ var LinkedList = /*#__PURE__*/function () {
         prev = current;
         current = temp;
       }
-
       this.first.next = null;
       this.last.prev = null;
       temp = this.first;
@@ -295,9 +270,7 @@ var LinkedList = /*#__PURE__*/function () {
       this.last = temp;
     }
   }]);
-
   return LinkedList;
 }();
-
 var _default = LinkedList;
 exports.default = _default;

package/utils/dataStructures/linkedList.mjs

@@ -1,9 +1,19 @@
-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); } }
-
+import "core-js/modules/es.symbol.to-primitive.js";
+import "core-js/modules/es.date.to-primitive.js";
+import "core-js/modules/es.symbol.js";
+import "core-js/modules/es.symbol.description.js";
+import "core-js/modules/es.object.to-string.js";
+import "core-js/modules/es.number.constructor.js";
+import "core-js/modules/es.symbol.iterator.js";
+import "core-js/modules/es.array.iterator.js";
+import "core-js/modules/es.string.iterator.js";
+import "core-js/modules/web.dom-collections.iterator.js";
+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); }
+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(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 _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
-
 /**
  * Refactored implementation of LinkedList (part of javascript-algorithms project) by Github users:
  * mgechev, AndriiHeonia, Microfed and Jakeh (part of javascript-algorithms project - all project contributors
@@ -11,7 +21,6 @@ function _classCallCheck(instance, Constructor) { if (!(instance instanceof Cons
  *
  * Link to repository: https://github.com/mgechev/javascript-algorithms.
  */
-
 /**
  * Linked list node.
  *
@@ -20,7 +29,6 @@ function _classCallCheck(instance, Constructor) { if (!(instance instanceof Cons
  */
 var NodeStructure = /*#__PURE__*/_createClass(function NodeStructure(data) {
   _classCallCheck(this, NodeStructure);
-
   /**
    * Data of the node.
    *
@@ -32,14 +40,12 @@ var NodeStructure = /*#__PURE__*/_createClass(function NodeStructure(data) {
    *
    * @member {NodeStructure}
    */
-
   this.next = null;
   /**
    * Previous node.
    *
    * @member {NodeStructure}
    */
-
   this.prev = null;
 });
 /**
@@ -48,27 +54,22 @@ var NodeStructure = /*#__PURE__*/_createClass(function NodeStructure(data) {
  * @class LinkedList
  * @util
  */
-
-
 var LinkedList = /*#__PURE__*/function () {
   function LinkedList() {
     _classCallCheck(this, LinkedList);
-
     this.first = null;
     this.last = null;
   }
+
   /**
    * Add data to the end of linked list.
    *
    * @param {object} data Data which should be added.
    */
-
-
   _createClass(LinkedList, [{
     key: "push",
     value: function push(data) {
       var node = new NodeStructure(data);
-
       if (this.first === null) {
         this.first = node;
         this.last = node;
@@ -79,17 +80,16 @@ var LinkedList = /*#__PURE__*/function () {
         temp.next = node;
       }
     }
+
     /**
      * Add data to the beginning of linked list.
      *
      * @param {object} data Data which should be added.
      */
-
   }, {
     key: "unshift",
     value: function unshift(data) {
       var node = new NodeStructure(data);
-
       if (this.first === null) {
         this.first = node;
         this.last = node;
@@ -100,138 +100,121 @@ var LinkedList = /*#__PURE__*/function () {
         temp.prev = node;
       }
     }
+
     /**
      * In order traversal of the linked list.
      *
      * @param {Function} callback Callback which should be executed on each node.
      */
-
   }, {
     key: "inorder",
     value: function inorder(callback) {
       var temp = this.first;
-
       while (temp) {
         callback(temp);
         temp = temp.next;
       }
     }
+
     /**
      * Remove data from the linked list.
      *
      * @param {object} data Data which should be removed.
      * @returns {boolean} Returns true if data has been removed.
      */
-
   }, {
     key: "remove",
     value: function remove(data) {
       if (this.first === null) {
         return false;
       }
-
       var temp = this.first;
       var next;
       var prev;
-
       while (temp) {
         if (temp.data === data) {
           next = temp.next;
           prev = temp.prev;
-
           if (next) {
             next.prev = prev;
           }
-
           if (prev) {
             prev.next = next;
           }
-
           if (temp === this.first) {
             this.first = next;
           }
-
           if (temp === this.last) {
             this.last = prev;
           }
-
           return true;
         }
-
         temp = temp.next;
       }
-
       return false;
     }
+
     /**
      * Check if linked list contains cycle.
      *
      * @returns {boolean} Returns true if linked list contains cycle.
      */
-
   }, {
     key: "hasCycle",
     value: function hasCycle() {
       var fast = this.first;
       var slow = this.first;
-
       while (true) {
         if (fast === null) {
           return false;
         }
-
         fast = fast.next;
-
         if (fast === null) {
           return false;
         }
-
         fast = fast.next;
         slow = slow.next;
-
         if (fast === slow) {
           return true;
         }
       }
     }
+
     /**
      * Return last node from the linked list.
      *
      * @returns {NodeStructure} Last node.
      */
-
   }, {
     key: "pop",
     value: function pop() {
       if (this.last === null) {
         return null;
       }
-
       var temp = this.last;
       this.last = this.last.prev;
       return temp;
     }
+
     /**
      * Return first node from the linked list.
      *
      * @returns {NodeStructure} First node.
      */
-
   }, {
     key: "shift",
     value: function shift() {
       if (this.first === null) {
         return null;
       }
-
       var temp = this.first;
       this.first = this.first.next;
       return temp;
     }
+
     /**
      * Reverses the linked list recursively.
      */
-
   }, {
     key: "recursiveReverse",
     value: function recursiveReverse() {
@@ -243,36 +226,31 @@ var LinkedList = /*#__PURE__*/function () {
         if (!next) {
           return;
         }
-
         inverse(next, next.next);
         next.next = current;
       }
-
       if (!this.first) {
         return;
       }
-
       inverse(this.first, this.first.next);
       this.first.next = null;
       var temp = this.first;
       this.first = this.last;
       this.last = temp;
     }
+
     /**
      * Reverses the linked list iteratively.
      */
-
   }, {
     key: "reverse",
     value: function reverse() {
       if (!this.first || !this.first.next) {
         return;
       }
-
       var current = this.first.next;
       var prev = this.first;
       var temp;
-
       while (current) {
         temp = current.next;
         current.next = prev;
@@ -280,7 +258,6 @@ var LinkedList = /*#__PURE__*/function () {
         prev = current;
         current = temp;
       }
-
       this.first.next = null;
       this.last.prev = null;
       temp = this.first;
@@ -288,9 +265,7 @@ var LinkedList = /*#__PURE__*/function () {
       this.last = temp;
     }
   }]);
-
   return LinkedList;
 }();
-
 export { NodeStructure };
 export default LinkedList;