handsontable 12.1.2 → 12.2.0

package/translations/maps/utils/physicallyIndexed.mjs

@@ -13,42 +13,33 @@ import "core-js/modules/web.dom-collections.iterator.js";
 import "core-js/modules/es.array.from.js";
 import "core-js/modules/es.function.name.js";
 import "core-js/modules/es.regexp.exec.js";
-
 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 _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 _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 _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 { isFunction } from "../../../helpers/function.mjs";
-import { arrayFilter } from "../../../helpers/array.mjs";
-/**
- * Insert new items to the list.
- *
- * @private
- * @param {Array} indexedValues List of values for particular indexes.
- * @param {number} insertionIndex Position inside the actual list.
- * @param {Array} insertedIndexes List of inserted indexes.
- * @param {*} insertedValuesMapping Mapping which may provide value or function returning value for the specific parameters.
- * @returns {Array} List with new mappings.
- */
-
+import { arrayFilter } from "../../../helpers/array.mjs"; /**
+                                                           * Insert new items to the list.
+                                                           *
+                                                           * @private
+                                                           * @param {Array} indexedValues List of values for particular indexes.
+                                                           * @param {number} insertionIndex Position inside the actual list.
+                                                           * @param {Array} insertedIndexes List of inserted indexes.
+                                                           * @param {*} insertedValuesMapping Mapping which may provide value or function returning value for the specific parameters.
+                                                           * @returns {Array} List with new mappings.
+                                                           */
 export function getListWithInsertedItems(indexedValues, insertionIndex, insertedIndexes, insertedValuesMapping) {
   var firstInsertedIndex = insertedIndexes.length ? insertedIndexes[0] : void 0;
   return [].concat(_toConsumableArray(indexedValues.slice(0, firstInsertedIndex)), _toConsumableArray(insertedIndexes.map(function (insertedIndex, ordinalNumber) {
     if (isFunction(insertedValuesMapping)) {
       return insertedValuesMapping(insertedIndex, ordinalNumber);
     }
-
     return insertedValuesMapping;
   })), _toConsumableArray(firstInsertedIndex === void 0 ? [] : indexedValues.slice(firstInsertedIndex)));
 }
+
 /**
  * Filter items from the list.
  *
@@ -57,7 +48,6 @@ export function getListWithInsertedItems(indexedValues, insertionIndex, inserted
  * @param {Array} removedIndexes List of removed indexes.
  * @returns {Array} Reduced list of mappings.
  */
-
 export function getListWithRemovedItems(indexedValues, removedIndexes) {
   return arrayFilter(indexedValues, function (_, index) {
     return removedIndexes.includes(index) === false;

package/utils/dataStructures/linkedList.js

@@ -2,13 +2,9 @@
 
 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 _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
-
 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 +12,6 @@ function _classCallCheck(instance, Constructor) { if (!(instance instanceof Cons
  *
  * Link to repository: https://github.com/mgechev/javascript-algorithms.
  */
-
 /**
  * Linked list node.
  *
@@ -25,7 +20,6 @@ function _classCallCheck(instance, Constructor) { if (!(instance instanceof Cons
  */
 var NodeStructure = /*#__PURE__*/_createClass(function NodeStructure(data) {
   _classCallCheck(this, NodeStructure);
-
   /**
    * Data of the node.
    *
@@ -37,45 +31,36 @@ var NodeStructure = /*#__PURE__*/_createClass(function NodeStructure(data) {
    *
    * @member {NodeStructure}
    */
-
   this.next = null;
   /**
    * Previous node.
    *
    * @member {NodeStructure}
    */
-
   this.prev = null;
-});
-/**
- * Linked list.
- *
- * @class LinkedList
- * @util
- */
-
-
+}); /**
+     * Linked list.
+     *
+     * @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 +71,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 +91,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 +217,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 +249,6 @@ var LinkedList = /*#__PURE__*/function () {
         prev = current;
         current = temp;
       }
-
       this.first.next = null;
       this.last.prev = null;
       temp = this.first;
@@ -295,9 +256,7 @@ var LinkedList = /*#__PURE__*/function () {
       this.last = temp;
     }
   }]);
-
   return LinkedList;
 }();
-
 var _default = LinkedList;
 exports.default = _default;

package/utils/dataStructures/linkedList.mjs

@@ -1,9 +1,6 @@
 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 _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
-
 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 +8,6 @@ function _classCallCheck(instance, Constructor) { if (!(instance instanceof Cons
  *
  * Link to repository: https://github.com/mgechev/javascript-algorithms.
  */
-
 /**
  * Linked list node.
  *
@@ -20,7 +16,6 @@ function _classCallCheck(instance, Constructor) { if (!(instance instanceof Cons
  */
 var NodeStructure = /*#__PURE__*/_createClass(function NodeStructure(data) {
   _classCallCheck(this, NodeStructure);
-
   /**
    * Data of the node.
    *
@@ -32,43 +27,35 @@ var NodeStructure = /*#__PURE__*/_createClass(function NodeStructure(data) {
    *
    * @member {NodeStructure}
    */
-
   this.next = null;
   /**
    * Previous node.
    *
    * @member {NodeStructure}
    */
-
   this.prev = null;
-});
-/**
- * Linked list.
- *
- * @class LinkedList
- * @util
- */
-
-
+}); /**
+     * Linked list.
+     *
+     * @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 +66,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 +86,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 +212,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 +244,6 @@ var LinkedList = /*#__PURE__*/function () {
         prev = current;
         current = temp;
       }
-
       this.first.next = null;
       this.last.prev = null;
       temp = this.first;
@@ -288,9 +251,7 @@ var LinkedList = /*#__PURE__*/function () {
       this.last = temp;
     }
   }]);
-
   return LinkedList;
 }();
-
 export { NodeStructure };
 export default LinkedList;