/** * @class Ext.Array * @singleton * * A set of useful static methods to deal with arrays; provide missing methods for * older browsers. */Ext.Array = (function() {// @define Ext.lang.Array // @define Ext.Array // @require Ext // @require Ext.lang.Error var arrayPrototype = Array.prototype, slice = arrayPrototype.slice, supportsSplice = (function () { var array = [], lengthBefore, j = 20; if (!array.splice) { return false; } // This detects a bug in IE8 splice method: // see http://social.msdn.microsoft.com/Forums/en-US/iewebdevelopment/thread/6e946d03-e09f-4b22-a4dd-cd5e276bf05a/ while (j--) { array.push("A"); } array.splice(15, 0, "F", "F", "F", "F", "F","F","F","F","F","F","F","F","F","F","F","F","F","F","F","F","F"); lengthBefore = array.length; //41 array.splice(13, 0, "XXX"); // add one element if (lengthBefore + 1 !== array.length) { return false; } // end IE8 bug return true; }()), supportsIndexOf = 'indexOf' in arrayPrototype, supportsSliceOnNodeList = true; // Sort an array using the comparator, but if the comparator returns zero, use the objects' original indices to tiebreak // This results in a stable sort. function stableSort(array, userComparator) { var len = array.length, indices = new Array(len), i; // generate 0-n index map from original array for (i = 0; i < len; i++) { indices[i] = i; } // Sort indices array using a comparator which compares the original values at the two indices, and uses those indices as a tiebreaker indices.sort(function(index1, index2) { return userComparator(array[index1], array[index2]) || (index1 - index2); }); // Reconsitute a sorted array using the array that the indices have been sorted into for (i = 0; i < len; i++) { indices[i] = array[indices[i]]; } // Rebuild the original array for (i = 0; i < len; i++) { array[i] = indices[i]; } return array; } try { // IE 6 - 8 will throw an error when using Array.prototype.slice on NodeList if (typeof document !== 'undefined') { slice.call(document.getElementsByTagName('body')); } } catch (e) { supportsSliceOnNodeList = false; } var fixArrayIndex = function (array, index) { return (index < 0) ? Math.max(0, array.length + index) : Math.min(array.length, index); }, /* Does the same work as splice, but with a slightly more convenient signature. The splice method has bugs in IE8, so this is the implementation we use on that platform. The rippling of items in the array can be tricky. Consider two use cases: index=2 removeCount=2 /=====\ +---+---+---+---+---+---+---+---+ | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | +---+---+---+---+---+---+---+---+ / \/ \/ \/ \ / /\ /\ /\ \ / / \/ \/ \ +--------------------------+ / / /\ /\ +--------------------------+ \ / / / \/ +--------------------------+ \ \ / / / /+--------------------------+ \ \ \ / / / / \ \ \ \ v v v v v v v v +---+---+---+---+---+---+ +---+---+---+---+---+---+---+---+---+ | 0 | 1 | 4 | 5 | 6 | 7 | | 0 | 1 | a | b | c | 4 | 5 | 6 | 7 | +---+---+---+---+---+---+ +---+---+---+---+---+---+---+---+---+ A B \=========/ insert=[a,b,c] In case A, it is obvious that copying of [4,5,6,7] must be left-to-right so that we don't end up with [0,1,6,7,6,7]. In case B, we have the opposite; we must go right-to-left or else we would end up with [0,1,a,b,c,4,4,4,4]. */ replaceSim = function (array, index, removeCount, insert) { var add = insert ? insert.length : 0, length = array.length, pos = fixArrayIndex(array, index); // we try to use Array.push when we can for efficiency... if (pos === length) { if (add) { array.push.apply(array, insert); } } else { var remove = Math.min(removeCount, length - pos), tailOldPos = pos + remove, tailNewPos = tailOldPos + add - remove, tailCount = length - tailOldPos, lengthAfterRemove = length - remove, i; if (tailNewPos < tailOldPos) { // case A for (i = 0; i < tailCount; ++i) { array[tailNewPos+i] = array[tailOldPos+i]; } } else if (tailNewPos > tailOldPos) { // case B for (i = tailCount; i--; ) { array[tailNewPos+i] = array[tailOldPos+i]; } } // else, add == remove (nothing to do) if (add && pos === lengthAfterRemove) { array.length = lengthAfterRemove; // truncate array array.push.apply(array, insert); } else { array.length = lengthAfterRemove + add; // reserves space for (i = 0; i < add; ++i) { array[pos+i] = insert[i]; } } } return array; }, replaceNative = function (array, index, removeCount, insert) { if (insert && insert.length) { // Inserting at index zero with no removing: use unshift if (index === 0 && !removeCount) { array.unshift.apply(array, insert); } // Inserting/replacing in middle of array else if (index < array.length) { array.splice.apply(array, [index, removeCount].concat(insert)); } // Appending to array else { array.push.apply(array, insert); } } else { array.splice(index, removeCount); } return array; }, eraseSim = function (array, index, removeCount) { return replaceSim(array, index, removeCount); }, eraseNative = function (array, index, removeCount) { array.splice(index, removeCount); return array; }, spliceSim = function (array, index, removeCount) { var pos = fixArrayIndex(array, index), removed = array.slice(index, fixArrayIndex(array, pos+removeCount)); if (arguments.length < 4) { replaceSim(array, pos, removeCount); } else { replaceSim(array, pos, removeCount, slice.call(arguments, 3)); } return removed; }, spliceNative = function (array) { return array.splice.apply(array, slice.call(arguments, 1)); }, erase = supportsSplice ? eraseNative : eraseSim, replace = supportsSplice ? replaceNative : replaceSim, splice = supportsSplice ? spliceNative : spliceSim, // NOTE: from here on, use erase, replace or splice (not native methods)... ExtArray = { /** * This method returns the index that a given item would be inserted into the * given (sorted) `array`. Note that the given `item` may or may not be in the * array. This method will return the index of where the item *should* be. * * For example: * * var array = [ 'A', 'D', 'G', 'K', 'O', 'R', 'X' ]; * var index = Ext.Array.binarySearch(array, 'E'); * * console.log('index: ' + index); * // logs "index: 2" * * array.splice(index, 0, 'E'); * * console.log('array : ' + array.join('')); * // logs "array: ADEGKORX" * * @param {Object[]} array The array to search. * @param {Object} item The item that you want to insert into the `array`. * @param {Number} [begin=0] The first index in the `array` to consider. * @param {Number} [end=array.length] The index that marks the end of the range * to consider. The item at this index is *not* considered. * @param {Function} [compareFn] The comparison function that matches the sort * order of the `array`. The default `compareFn` compares items using less-than * and greater-than operators. * @return {Number} The index for the given item in the given array based on * the current sorters. */ binarySearch: function (array, item, begin, end, compareFn) { var length = array.length, middle, comparison; if (begin instanceof Function) { compareFn = begin; begin = 0; end = length; } else if (end instanceof Function) { compareFn = end; end = length; } else { if (begin === undefined) { begin = 0; } if (end === undefined) { end = length; } compareFn = compareFn || ExtArray.lexicalCompare; } --end; while (begin <= end) { middle = (begin + end) >> 1; comparison = compareFn(item, array[middle]); if (comparison >= 0) { begin = middle + 1; } else if (comparison < 0) { end = middle - 1; } } return begin; }, defaultCompare: function (lhs, rhs) { return (lhs < rhs) ? -1 : ((lhs > rhs) ? 1 : 0); }, // Default comparator to use when no comparator is specified for the sort method. // Javascript sort does LEXICAL comparison. lexicalCompare: function (lhs, rhs) { lhs = String(lhs); rhs = String(rhs); return (lhs < rhs) ? -1 : ((lhs > rhs) ? 1 : 0); }, /** * Iterates an array or an iterable value and invoke the given callback function for each item. * * var countries = ['Vietnam', 'Singapore', 'United States', 'Russia']; * * Ext.Array.each(countries, function(name, index, countriesItSelf) { * console.log(name); * }); * * var sum = function() { * var sum = 0; * * Ext.Array.each(arguments, function(value) { * sum += value; * }); * * return sum; * }; * * sum(1, 2, 3); // returns 6 * * The iteration can be stopped by returning false in the function callback. * * Ext.Array.each(countries, function(name, index, countriesItSelf) { * if (name === 'Singapore') { * return false; // break here * } * }); * * {@link Ext#each Ext.each} is alias for {@link Ext.Array#each Ext.Array.each} * * @param {Array/NodeList/Object} iterable The value to be iterated. If this * argument is not iterable, the callback function is called once. * @param {Function} fn The callback function. If it returns `false`, the iteration * stops and this method returns the current `index`. * @param {Object} fn.item The item at the current `index` in the passed `array` * @param {Number} fn.index The current `index` within the `array` * @param {Array} fn.allItems The `array` itself which was passed as the first argument * @param {Boolean} fn.return Return false to stop iteration. * @param {Object} scope (Optional) The scope (`this` reference) in which the specified function is executed. * @param {Boolean} [reverse=false] Reverse the iteration order (loop from the end to the beginning). * @return {Boolean} See description for the `fn` parameter. */ each: function(array, fn, scope, reverse) { array = ExtArray.from(array); var i, ln = array.length; if (reverse !== true) { for (i = 0; i < ln; i++) { if (fn.call(scope || array[i], array[i], i, array) === false) { return i; } } } else { for (i = ln - 1; i > -1; i--) { if (fn.call(scope || array[i], array[i], i, array) === false) { return i; } } } return true; }, /** * Iterates an array and invoke the given callback function for each item. Note that this will simply * delegate to the native `Array.prototype.forEach` method if supported. It doesn't support stopping the * iteration by returning `false` in the callback function like {@link Ext.Array#each}. However, performance * could be much better in modern browsers comparing with {@link Ext.Array#each} * * @param {Array} array The array to iterate. * @param {Function} fn The callback function. * @param {Object} fn.item The item at the current `index` in the passed `array`. * @param {Number} fn.index The current `index` within the `array`. * @param {Array} fn.allItems The `array` itself which was passed as the first argument. * @param {Object} scope (Optional) The execution scope (`this`) in which the * specified function is executed. */ forEach: ('forEach' in arrayPrototype) ? function(array, fn, scope) { return array.forEach(fn, scope); } : function(array, fn, scope) { for (var i = 0, ln = array.length; i < ln; i++) { fn.call(scope, array[i], i, array); } }, /** * Get the index of the provided `item` in the given `array`, a supplement for the * missing arrayPrototype.indexOf in Internet Explorer. * * @param {Array} array The array to check. * @param {Object} item The item to find. * @param {Number} from (Optional) The index at which to begin the search. * @return {Number} The index of item in the array (or -1 if it is not found). */ indexOf: supportsIndexOf ? function(array, item, from) { return arrayPrototype.indexOf.call(array, item, from); } : function(array, item, from) { var i, length = array.length; for (i = (from < 0) ? Math.max(0, length + from) : from || 0; i < length; i++) { if (array[i] === item) { return i; } } return -1; }, /** * Checks whether or not the given `array` contains the specified `item`. * * @param {Array} array The array to check. * @param {Object} item The item to find. * @return {Boolean} `true` if the array contains the item, `false` otherwise. */ contains: supportsIndexOf ? function(array, item) { return arrayPrototype.indexOf.call(array, item) !== -1; } : function(array, item) { var i, ln; for (i = 0, ln = array.length; i < ln; i++) { if (array[i] === item) { return true; } } return false; }, /** * Converts any iterable (numeric indices and a length property) into a true array. * * function test() { * var args = Ext.Array.toArray(arguments), * fromSecondToLastArgs = Ext.Array.toArray(arguments, 1); * * alert(args.join(' ')); * alert(fromSecondToLastArgs.join(' ')); * } * * test('just', 'testing', 'here'); // alerts 'just testing here'; * // alerts 'testing here'; * * Ext.Array.toArray(document.getElementsByTagName('div')); // will convert the NodeList into an array * Ext.Array.toArray('splitted'); // returns ['s', 'p', 'l', 'i', 't', 't', 'e', 'd'] * Ext.Array.toArray('splitted', 0, 3); // returns ['s', 'p', 'l'] * * {@link Ext#toArray Ext.toArray} is alias for {@link Ext.Array#toArray Ext.Array.toArray} * * @param {Object} iterable the iterable object to be turned into a true Array. * @param {Number} [start=0] a zero-based index that specifies the start of extraction. * @param {Number} [end=-1] a 1-based index that specifies the end of extraction. * @return {Array} */ toArray: function(iterable, start, end){ if (!iterable || !iterable.length) { return []; } if (typeof iterable === 'string') { iterable = iterable.split(''); } if (supportsSliceOnNodeList) { return slice.call(iterable, start || 0, end || iterable.length); } var array = [], i; start = start || 0; end = end ? ((end < 0) ? iterable.length + end : end) : iterable.length; for (i = start; i < end; i++) { array.push(iterable[i]); } return array; }, /** * Plucks the value of a property from each item in the Array. Example: * * Ext.Array.pluck(Ext.query("p"), "className"); // [el1.className, el2.className, ..., elN.className] * * @param {Array/NodeList} array The Array of items to pluck the value from. * @param {String} propertyName The property name to pluck from each element. * @return {Array} The value from each item in the Array. */ pluck: function(array, propertyName) { var ret = [], i, ln, item; for (i = 0, ln = array.length; i < ln; i++) { item = array[i]; ret.push(item[propertyName]); } return ret; }, /** * Creates a new array with the results of calling a provided function on every element in this array. * * @param {Array} array * @param {Function} fn Callback function for each item. * @param {Mixed} fn.item Current item. * @param {Number} fn.index Index of the item. * @param {Array} fn.array The whole array that's being iterated. * @param {Object} [scope] Callback function scope * @return {Array} results */ map: ('map' in arrayPrototype) ? function(array, fn, scope) { //<debug> Ext.Assert.isFunction(fn, 'Ext.Array.map must have a callback function passed as second argument.'); //</debug> return array.map(fn, scope); } : function(array, fn, scope) { //<debug> Ext.Assert.isFunction(fn, 'Ext.Array.map must have a callback function passed as second argument.'); //</debug> var results = [], i = 0, len = array.length; for (; i < len; i++) { results[i] = fn.call(scope, array[i], i, array); } return results; }, /** * Executes the specified function for each array element until the function returns a falsy value. * If such an item is found, the function will return `false` immediately. * Otherwise, it will return `true`. * * @param {Array} array * @param {Function} fn Callback function for each item. * @param {Mixed} fn.item Current item. * @param {Number} fn.index Index of the item. * @param {Array} fn.array The whole array that's being iterated. * @param {Object} scope Callback function scope. * @return {Boolean} `treu` if no false value is returned by the callback function. */ every: ('every' in arrayPrototype) ? function(array, fn, scope) { //<debug> Ext.Assert.isFunction(fn, 'Ext.Array.every must have a callback function passed as second argument.'); //</debug> return array.every(fn, scope); } : function(array, fn, scope) { //<debug> Ext.Assert.isFunction(fn, 'Ext.Array.every must have a callback function passed as second argument.'); //</debug> var i = 0, ln = array.length; for (; i < ln; ++i) { if (!fn.call(scope, array[i], i, array)) { return false; } } return true; }, /** * Executes the specified function for each array element until the function returns a truthy value. * If such an item is found, the function will return `true` immediately. Otherwise, it will return `false`. * * @param {Array} array * @param {Function} fn Callback function for each item. * @param {Mixed} fn.item Current item. * @param {Number} fn.index Index of the item. * @param {Array} fn.array The whole array that's being iterated. * @param {Object} scope Callback function scope. * @return {Boolean} `true` if the callback function returns a truthy value. */ some: ('some' in arrayPrototype) ? function(array, fn, scope) { //<debug> Ext.Assert.isFunction(fn, 'Ext.Array.some must have a callback function passed as second argument.'); //</debug> return array.some(fn, scope); } : function(array, fn, scope) { //<debug> Ext.Assert.isFunction(fn, 'Ext.Array.some must have a callback function passed as second argument.'); //</debug> var i = 0, ln = array.length; for (; i < ln; ++i) { if (fn.call(scope, array[i], i, array)) { return true; } } return false; }, /** * Shallow compares the contents of 2 arrays using strict equality. * @param {Array} array1 * @param {Array} array2 * @return {Boolean} `true` if the arrays are equal. */ equals: function(array1, array2) { var len1 = array1.length, len2 = array2.length, i; // Short circuit if the same array is passed twice if (array1 === array2) { return true; } if (len1 !== len2) { return false; } for (i = 0; i < len1; ++i) { if (array1[i] !== array2[i]) { return false; } } return true; }, /** * Filter through an array and remove empty item as defined in {@link Ext#isEmpty Ext.isEmpty}. * * See {@link Ext.Array#filter} * * @param {Array} array * @return {Array} results */ clean: function(array) { var results = [], i = 0, ln = array.length, item; for (; i < ln; i++) { item = array[i]; if (!Ext.isEmpty(item)) { results.push(item); } } return results; }, /** * Returns a new array with unique items. * * @param {Array} array * @return {Array} results */ unique: function(array) { var clone = [], i = 0, ln = array.length, item; for (; i < ln; i++) { item = array[i]; if (ExtArray.indexOf(clone, item) === -1) { clone.push(item); } } return clone; }, /** * Creates a new array with all of the elements of this array for which * the provided filtering function returns a truthy value. * * @param {Array} array * @param {Function} fn Callback function for each item. * @param {Mixed} fn.item Current item. * @param {Number} fn.index Index of the item. * @param {Array} fn.array The whole array that's being iterated. * @param {Object} scope Callback function scope. * @return {Array} results */ filter: ('filter' in arrayPrototype) ? function(array, fn, scope) { //<debug> Ext.Assert.isFunction(fn, 'Ext.Array.filter must have a filter function passed as second argument.'); //</debug> return array.filter(fn, scope); } : function(array, fn, scope) { //<debug> Ext.Assert.isFunction(fn, 'Ext.Array.filter must have a filter function passed as second argument.'); //</debug> var results = [], i = 0, ln = array.length; for (; i < ln; i++) { if (fn.call(scope, array[i], i, array)) { results.push(array[i]); } } return results; }, /** * Returns the first item in the array which elicits a truthy return value from the * passed selection function. * @param {Array} array The array to search * @param {Function} fn The selection function to execute for each item. * @param {Mixed} fn.item The array item. * @param {String} fn.index The index of the array item. * @param {Object} scope (optional) The scope (<code>this</code> reference) in which the * function is executed. Defaults to the array * @return {Object} The first item in the array which returned true from the selection * function, or null if none was found. */ findBy : function(array, fn, scope) { var i = 0, len = array.length; for (; i < len; i++) { if (fn.call(scope || array, array[i], i)) { return array[i]; } } return null; }, /** * Converts a value to an array if it's not already an array; returns: * * - An empty array if given value is `undefined` or `null` * - Itself if given value is already an array * - An array copy if given value is {@link Ext#isIterable iterable} (arguments, NodeList and alike) * - An array with one item which is the given value, otherwise * * @param {Object} value The value to convert to an array if it's not already is an array. * @param {Boolean} [newReference] `true` to clone the given array and return a new reference if necessary. * @return {Array} array */ from: function(value, newReference) { if (value === undefined || value === null) { return []; } if (Ext.isArray(value)) { return (newReference) ? slice.call(value) : value; } var type = typeof value; // Both strings and functions will have a length property. In phantomJS, NodeList // instances report typeof=='function' but don't have an apply method... if (value && value.length !== undefined && type !== 'string' && (type !== 'function' || !value.apply)) { return ExtArray.toArray(value); } return [value]; }, /** * Removes the specified item from the array if it exists. * * @param {Array} array The array. * @param {Object} item The item to remove. * @return {Array} The passed array. */ remove: function(array, item) { var index = ExtArray.indexOf(array, item); if (index !== -1) { erase(array, index, 1); } return array; }, /** * Removes item/s at the specified index. * * @param {Array} array The array. * @param {Number} index The index of the item to be removed. * @param {Number} [count=1] The number of items to be removed. * @return {Array} The passed array. */ removeAt: function(array, index, count) { var len = array.length; if (index >= 0 && index < len) { count = count || 1; count = Math.min(count, len - index); erase(array, index, count); } return array; }, /** * Push an item into the array only if the array doesn't contain it yet. * * @param {Array} array The array. * @param {Object} item The item to include. */ include: function(array, item) { if (!ExtArray.contains(array, item)) { array.push(item); } }, /** * Clone a flat array without referencing the previous one. Note that this is different * from `Ext.clone` since it doesn't handle recursive cloning. It's simply a convenient, easy-to-remember method * for `Array.prototype.slice.call(array)`. * * @param {Array} array The array. * @return {Array} The clone array. */ clone: function(array) { return slice.call(array); }, /** * Merge multiple arrays into one with unique items. * * {@link Ext.Array#union} is alias for {@link Ext.Array#merge} * * @param {Array} array1 * @param {Array} array2 * @param {Array} etc * @return {Array} merged */ merge: function() { var args = slice.call(arguments), array = [], i, ln; for (i = 0, ln = args.length; i < ln; i++) { array = array.concat(args[i]); } return ExtArray.unique(array); }, /** * Merge multiple arrays into one with unique items that exist in all of the arrays. * * @param {Array} array1 * @param {Array} array2 * @param {Array} etc * @return {Array} intersect */ intersect: function() { var intersection = [], arrays = slice.call(arguments), arraysLength, array, arrayLength, minArray, minArrayIndex, minArrayCandidate, minArrayLength, element, elementCandidate, elementCount, i, j, k; if (!arrays.length) { return intersection; } // Find the smallest array arraysLength = arrays.length; for (i = minArrayIndex = 0; i < arraysLength; i++) { minArrayCandidate = arrays[i]; if (!minArray || minArrayCandidate.length < minArray.length) { minArray = minArrayCandidate; minArrayIndex = i; } } minArray = ExtArray.unique(minArray); erase(arrays, minArrayIndex, 1); // Use the smallest unique'd array as the anchor loop. If the other array(s) do contain // an item in the small array, we're likely to find it before reaching the end // of the inner loop and can terminate the search early. minArrayLength = minArray.length; arraysLength = arrays.length; for (i = 0; i < minArrayLength; i++) { element = minArray[i]; elementCount = 0; for (j = 0; j < arraysLength; j++) { array = arrays[j]; arrayLength = array.length; for (k = 0; k < arrayLength; k++) { elementCandidate = array[k]; if (element === elementCandidate) { elementCount++; break; } } } if (elementCount === arraysLength) { intersection.push(element); } } return intersection; }, /** * Perform a set difference A-B by subtracting all items in array B from array A. * * @param {Array} arrayA * @param {Array} arrayB * @return {Array} difference */ difference: function(arrayA, arrayB) { var clone = slice.call(arrayA), ln = clone.length, i, j, lnB; for (i = 0,lnB = arrayB.length; i < lnB; i++) { for (j = 0; j < ln; j++) { if (clone[j] === arrayB[i]) { erase(clone, j, 1); j--; ln--; } } } return clone; }, /** * Returns a shallow copy of a part of an array. This is equivalent to the native * call `Array.prototype.slice.call(array, begin, end)`. This is often used when "array" * is "arguments" since the arguments object does not supply a slice method but can * be the context object to `Array.prototype.slice`. * * @param {Array} array The array (or arguments object). * @param {Number} begin The index at which to begin. Negative values are offsets from * the end of the array. * @param {Number} end The index at which to end. The copied items do not include * end. Negative values are offsets from the end of the array. If end is omitted, * all items up to the end of the array are copied. * @return {Array} The copied piece of the array. * @method slice */ // Note: IE8 will return [] on slice.call(x, undefined). slice: ([1,2].slice(1, undefined).length ? function (array, begin, end) { return slice.call(array, begin, end); } : function (array, begin, end) { // see http://jsperf.com/slice-fix if (typeof begin === 'undefined') { return slice.call(array); } if (typeof end === 'undefined') { return slice.call(array, begin); } return slice.call(array, begin, end); } ), /** * Sorts the elements of an Array in a stable manner (equivalently keyed values do not move relative to each other). * By default, this method sorts the elements alphabetically and ascending. * **Note:** This method modifies the passed array, in the same manner as the * native javascript Array.sort. * * @param {Array} array The array to sort. * @param {Function} [sortFn] The comparison function. * @param {Mixed} sortFn.a The first item to compare. * @param {Mixed} sortFn.b The second item to compare. * @param {Number} sortFn.return `-1` if a < b, `1` if a > b, otherwise `0`. * @return {Array} The sorted array. */ sort: function(array, sortFn) { return stableSort(array, sortFn || ExtArray.lexicalCompare); }, /** * Recursively flattens into 1-d Array. Injects Arrays inline. * * @param {Array} array The array to flatten * @return {Array} The 1-d array. */ flatten: function(array) { var worker = []; function rFlatten(a) { var i, ln, v; for (i = 0, ln = a.length; i < ln; i++) { v = a[i]; if (Ext.isArray(v)) { rFlatten(v); } else { worker.push(v); } } return worker; } return rFlatten(array); }, /** * Returns the minimum value in the Array. * * @param {Array/NodeList} array The Array from which to select the minimum value. * @param {Function} comparisonFn (optional) a function to perform the comparison which determines minimization. * If omitted the "<" operator will be used. * __Note:__ gt = 1; eq = 0; lt = -1 * @param {Mixed} comparisonFn.min Current minimum value. * @param {Mixed} comparisonFn.item The value to compare with the current minimum. * @return {Object} minValue The minimum value. */ min: function(array, comparisonFn) { var min = array[0], i, ln, item; for (i = 0, ln = array.length; i < ln; i++) { item = array[i]; if (comparisonFn) { if (comparisonFn(min, item) === 1) { min = item; } } else { if (item < min) { min = item; } } } return min; }, /** * Returns the maximum value in the Array. * * @param {Array/NodeList} array The Array from which to select the maximum value. * @param {Function} comparisonFn (optional) a function to perform the comparison which determines maximization. * If omitted the ">" operator will be used. * __Note:__ gt = 1; eq = 0; lt = -1 * @param {Mixed} comparisonFn.max Current maximum value. * @param {Mixed} comparisonFn.item The value to compare with the current maximum. * @return {Object} maxValue The maximum value. */ max: function(array, comparisonFn) { var max = array[0], i, ln, item; for (i = 0, ln = array.length; i < ln; i++) { item = array[i]; if (comparisonFn) { if (comparisonFn(max, item) === -1) { max = item; } } else { if (item > max) { max = item; } } } return max; }, /** * Calculates the mean of all items in the array. * * @param {Array} array The Array to calculate the mean value of. * @return {Number} The mean. */ mean: function(array) { return array.length > 0 ? ExtArray.sum(array) / array.length : undefined; }, /** * Calculates the sum of all items in the given array. * * @param {Array} array The Array to calculate the sum value of. * @return {Number} The sum. */ sum: function(array) { var sum = 0, i, ln, item; for (i = 0,ln = array.length; i < ln; i++) { item = array[i]; sum += item; } return sum; }, /** * Creates a map (object) keyed by the elements of the given array. The values in * the map are the index+1 of the array element. For example: * * var map = Ext.Array.toMap(['a','b','c']); * * // map = { a: 1, b: 2, c: 3 }; * * Or a key property can be specified: * * var map = Ext.Array.toMap([ * { name: 'a' }, * { name: 'b' }, * { name: 'c' } * ], 'name'); * * // map = { a: 1, b: 2, c: 3 }; * * Lastly, a key extractor can be provided: * * var map = Ext.Array.toMap([ * { name: 'a' }, * { name: 'b' }, * { name: 'c' } * ], function (obj) { return obj.name.toUpperCase(); }); * * // map = { A: 1, B: 2, C: 3 }; * * @param {Array} array The Array to create the map from. * @param {String/Function} [getKey] Name of the object property to use * as a key or a function to extract the key. * @param {Object} [scope] Value of `this` inside callback specified for `getKey`. * @return {Object} The resulting map. */ toMap: function(array, getKey, scope) { var map = {}, i = array.length; if (!getKey) { while (i--) { map[array[i]] = i+1; } } else if (typeof getKey === 'string') { while (i--) { map[array[i][getKey]] = i+1; } } else { while (i--) { map[getKey.call(scope, array[i])] = i+1; } } return map; }, /** * Creates a map (object) keyed by a property of elements of the given array. The values in * the map are the array element. For example: * * var map = Ext.Array.toValueMap(['a','b','c']); * * // map = { a: 'a', b: 'b', c: 'c' }; * * Or a key property can be specified: * * var map = Ext.Array.toValueMap([ * { name: 'a' }, * { name: 'b' }, * { name: 'c' } * ], 'name'); * * // map = { a: {name: 'a'}, b: {name: 'b'}, c: {name: 'c'} }; * * Lastly, a key extractor can be provided: * * var map = Ext.Array.toValueMap([ * { name: 'a' }, * { name: 'b' }, * { name: 'c' } * ], function (obj) { return obj.name.toUpperCase(); }); * * // map = { A: {name: 'a'}, B: {name: 'b'}, C: {name: 'c'} }; * * @param {Array} array The Array to create the map from. * @param {String/Function} [getKey] Name of the object property to use * as a key or a function to extract the key. * @param {Object} [scope] Value of this inside callback. This parameter is only * passed when `getKey` is a function. If `getKey` is not a function, the 3rd * argument is `arrayify`. * @param {Number} [arrayify] Pass `1` to create arrays for all map entries * or `2` to create arrays for map entries that have 2 or more items with the * same key. This only applies when `getKey` is specified. By default the map will * hold the last entry with a given key. * @return {Object} The resulting map. */ toValueMap: function(array, getKey, scope, arrayify) { var map = {}, i = array.length, autoArray, alwaysArray, entry, fn, key, value; if (!getKey) { while (i--) { value = array[i]; map[value] = value; } } else { if (!(fn = (typeof getKey !== 'string'))) { arrayify = scope; } alwaysArray = arrayify === 1; autoArray = arrayify === 2; while (i--) { value = array[i]; key = fn ? getKey.call(scope, value) : value[getKey]; if (alwaysArray) { if (key in map) { map[key].push(value); } else { map[key] = [ value ]; } } else if (autoArray && (key in map)) { if ((entry = map[key]) instanceof Array) { entry.push(value); } else { map[key] = [ entry, value ]; } } else { map[key] = value; } } } return map; }, //<debug> _replaceSim: replaceSim, // for unit testing _spliceSim: spliceSim, //</debug> /** * Removes items from an array. This is functionally equivalent to the splice method * of Array, but works around bugs in IE8's splice method and does not copy the * removed elements in order to return them (because very often they are ignored). * * @param {Array} array The Array on which to replace. * @param {Number} index The index in the array at which to operate. * @param {Number} removeCount The number of items to remove at index. * @return {Array} The array passed. * @method */ erase: erase, /** * Inserts items in to an array. * * @param {Array} array The Array in which to insert. * @param {Number} index The index in the array at which to operate. * @param {Array} items The array of items to insert at index. * @return {Array} The array passed. */ insert: function (array, index, items) { return replace(array, index, 0, items); }, /** * Replaces items in an array. This is functionally equivalent to the splice method * of Array, but works around bugs in IE8's splice method and is often more convenient * to call because it accepts an array of items to insert rather than use a variadic * argument list. * * @param {Array} array The Array on which to replace. * @param {Number} index The index in the array at which to operate. * @param {Number} removeCount The number of items to remove at index (can be 0). * @param {Array} insert (optional) An array of items to insert at index. * @return {Array} The array passed. * @method */ replace: replace, /** * Replaces items in an array. This is equivalent to the splice method of Array, but * works around bugs in IE8's splice method. The signature is exactly the same as the * splice method except that the array is the first argument. All arguments following * removeCount are inserted in the array at index. * * @param {Array} array The Array on which to replace. * @param {Number} index The index in the array at which to operate. * @param {Number} removeCount The number of items to remove at index (can be 0). * @param {Object...} elements The elements to add to the array. If you don't specify * any elements, splice simply removes elements from the array. * @return {Array} An array containing the removed items. * @method */ splice: splice, /** * Pushes new items onto the end of an Array. * * Passed parameters may be single items, or arrays of items. If an Array is found in the argument list, all its * elements are pushed into the end of the target Array. * * @param {Array} target The Array onto which to push new items * @param {Object...} elements The elements to add to the array. Each parameter may * be an Array, in which case all the elements of that Array will be pushed into the end of the * destination Array. * @return {Array} An array containing all the new items push onto the end. * */ push: function(target) { var len = arguments.length, i = 1, newItem; if (target === undefined) { target = []; } else if (!Ext.isArray(target)) { target = [target]; } for (; i < len; i++) { newItem = arguments[i]; Array.prototype.push[Ext.isIterable(newItem) ? 'apply' : 'call'](target, newItem); } return target; }, /** * A function used to sort an array by numeric value. By default, javascript array values * are coerced to strings when sorting, which can be problematic when using numeric values. To * ensure that the values are sorted numerically, this method can be passed to the sort method: * * Ext.Array.sort(myArray, Ext.Array.numericSortFn); */ numericSortFn: function(a, b) { return a - b; } }; /** * @method * @member Ext * @inheritdoc Ext.Array#each */ Ext.each = ExtArray.each; /** * @method * @member Ext.Array * @inheritdoc Ext.Array#merge */ ExtArray.union = ExtArray.merge; /** * Old alias to {@link Ext.Array#min} * @deprecated 4.0.0 Use {@link Ext.Array#min} instead * @method * @member Ext * @inheritdoc Ext.Array#min */ Ext.min = ExtArray.min; /** * Old alias to {@link Ext.Array#max} * @deprecated 4.0.0 Use {@link Ext.Array#max} instead * @method * @member Ext * @inheritdoc Ext.Array#max */ Ext.max = ExtArray.max; /** * Old alias to {@link Ext.Array#sum} * @deprecated 4.0.0 Use {@link Ext.Array#sum} instead * @method * @member Ext * @inheritdoc Ext.Array#sum */ Ext.sum = ExtArray.sum; /** * Old alias to {@link Ext.Array#mean} * @deprecated 4.0.0 Use {@link Ext.Array#mean} instead * @method * @member Ext * @inheritdoc Ext.Array#mean */ Ext.mean = ExtArray.mean; /** * Old alias to {@link Ext.Array#flatten} * @deprecated 4.0.0 Use {@link Ext.Array#flatten} instead * @method * @member Ext * @inheritdoc Ext.Array#flatten */ Ext.flatten = ExtArray.flatten; /** * Old alias to {@link Ext.Array#clean} * @deprecated 4.0.0 Use {@link Ext.Array#clean} instead * @method * @member Ext * @inheritdoc Ext.Array#clean */ Ext.clean = ExtArray.clean; /** * Old alias to {@link Ext.Array#unique} * @deprecated 4.0.0 Use {@link Ext.Array#unique} instead * @method * @member Ext * @inheritdoc Ext.Array#unique */ Ext.unique = ExtArray.unique; /** * Old alias to {@link Ext.Array#pluck Ext.Array.pluck} * @deprecated 4.0.0 Use {@link Ext.Array#pluck Ext.Array.pluck} instead * @method * @member Ext * @inheritdoc Ext.Array#pluck */ Ext.pluck = ExtArray.pluck; /** * @method * @member Ext * @inheritdoc Ext.Array#toArray */ Ext.toArray = function() { return ExtArray.toArray.apply(ExtArray, arguments); }; return ExtArray;}());