UNPKG

devextreme

Version:

HTML5 JavaScript Component Suite for Responsive Web Development

219 lines (209 loc) • 6.94 kB
/** * DevExtreme (cjs/core/utils/array.js) * Version: 21.1.4 * Build date: Mon Jun 21 2021 * * Copyright (c) 2012 - 2021 Developer Express Inc. ALL RIGHTS RESERVED * Read about DevExtreme licensing here: https://js.devexpress.com/Licensing/ */ "use strict"; exports.groupBy = exports.find = exports.merge = exports.normalizeIndexes = exports.removeDuplicates = exports.uniqueValues = exports.intersection = exports.inArray = exports.wrapToArray = exports.isEmpty = void 0; var _type = require("./type"); var _iterator = require("./iterator"); var _object = require("./object"); var _config = _interopRequireDefault(require("../config")); function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj } } 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 _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 ("string" === typeof o) { return _arrayLikeToArray(o, minLen) } var n = Object.prototype.toString.call(o).slice(8, -1); if ("Object" === n && o.constructor) { n = o.constructor.name } if ("Map" === n || "Set" === n) { return Array.from(o) } if ("Arguments" === n || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) { return _arrayLikeToArray(o, minLen) } } function _iterableToArray(iter) { if ("undefined" !== typeof Symbol && null != iter[Symbol.iterator] || null != iter["@@iterator"]) { return Array.from(iter) } } function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) { return _arrayLikeToArray(arr) } } function _arrayLikeToArray(arr, len) { if (null == len || len > arr.length) { len = arr.length } for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i] } return arr2 } function _extends() { _extends = Object.assign || function(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key] } } } return target }; return _extends.apply(this, arguments) } var isEmpty = function(entity) { return Array.isArray(entity) && !entity.length }; exports.isEmpty = isEmpty; var wrapToArray = function(entity) { return Array.isArray(entity) ? entity : [entity] }; exports.wrapToArray = wrapToArray; var inArray = function(value, object) { if (!object) { return -1 } var array = Array.isArray(object) ? object : object.toArray(); return array.indexOf(value) }; exports.inArray = inArray; var intersection = function(a, b) { if (!Array.isArray(a) || 0 === a.length || !Array.isArray(b) || 0 === b.length) { return [] } var result = []; (0, _iterator.each)(a, (function(_, value) { var index = inArray(value, b); if (-1 !== index) { result.push(value) } })); return result }; exports.intersection = intersection; var uniqueValues = function(data) { return data.filter((function(item, position) { return data.indexOf(item) === position })) }; exports.uniqueValues = uniqueValues; var removeDuplicates = function(from, what) { if (!Array.isArray(from) || 0 === from.length) { return [] } if (!Array.isArray(what) || 0 === what.length) { return from.slice() } var result = []; (0, _iterator.each)(from, (function(_, value) { var index = inArray(value, what); if (-1 === index) { result.push(value) } })); return result }; exports.removeDuplicates = removeDuplicates; var normalizeIndexes = function(items, indexParameterName, currentItem, needIndexCallback) { var indexedItems = {}; var parameterIndex = 0; var useLegacyVisibleIndex = (0, _config.default)().useLegacyVisibleIndex; (0, _iterator.each)(items, (function(index, item) { index = item[indexParameterName]; if (index >= 0) { indexedItems[index] = indexedItems[index] || []; if (item === currentItem) { indexedItems[index].unshift(item) } else { indexedItems[index].push(item) } } else { item[indexParameterName] = void 0 } })); if (!useLegacyVisibleIndex) { (0, _iterator.each)(items, (function() { if (!(0, _type.isDefined)(this[indexParameterName]) && (!needIndexCallback || needIndexCallback(this))) { while (indexedItems[parameterIndex]) { parameterIndex++ } indexedItems[parameterIndex] = [this]; parameterIndex++ } })) } parameterIndex = 0; (0, _object.orderEach)(indexedItems, (function(index, items) { (0, _iterator.each)(items, (function() { if (index >= 0) { this[indexParameterName] = parameterIndex++ } })) })); if (useLegacyVisibleIndex) { (0, _iterator.each)(items, (function() { if (!(0, _type.isDefined)(this[indexParameterName]) && (!needIndexCallback || needIndexCallback(this))) { this[indexParameterName] = parameterIndex++ } })) } return parameterIndex }; exports.normalizeIndexes = normalizeIndexes; var merge = function(array1, array2) { for (var i = 0; i < array2.length; i++) { array1[array1.length] = array2[i] } return array1 }; exports.merge = merge; var find = function(array, condition) { for (var i = 0; i < array.length; i++) { if (condition(array[i])) { return array[i] } } }; exports.find = find; var groupBy = function(array, cb) { return array.reduce((function(result, item) { return _extends({}, result, _defineProperty({}, cb(item), [].concat(_toConsumableArray(result[cb(item)] || []), [item]))) }), {}) }; exports.groupBy = groupBy;