随机生成arr Packages

Linear-time Partitioning. Runtime: O(n). Chooses a pivot and re-arrages the array so that everything on the left is <= pivot and everything on the right is > pivot

Efficient in-place recursive sorting algorithm of numeric values. Avg. Runtime: O(n log n) | Worst: O(n^2)

Selection sort array

Sort an array considerably faster than the native Array.prototype.sort as a drop-in replacement. Fork of of the famous timsort module, but this module allows for passing comparator-builder options instead of a comparator function. In short, advanced compa

For a sorted array, add an element. Whichever comparator function was used to sort the array, can be passed. Also supports comparator-builder options. For reference, see: https://github.com/bemoje/bemoje-arr-sort-comparator

Check whether a condition is true for any element of an array. The condition check is in the form of a callback.

Sort array by bubbling up bigger values to the right side. Runtime: O(n^2)

Remove an element in place from an array, if present.

Returns true if the predicate is satisfied for every element of the passed array; otherwise false.

A tiny, faster alternative to native Array.prototype.includes

Some useful array methods

A npm pacakge of es6, it's a function of determinating a variable is an array or not.

Swap a SubArray

A npm pacakge of es6, it's a function of determinating a variable is an array or not.

js-yaml concatenate / merge sequences / arrays

[English Document](https://github.com/JsonLee12138/frontend-factory/blob/main/packages/utils/README.en.md)

iol项目组各个平台跳转地址

Sort the keys in an object.

Some useful array methods

Returns an array sorted by elements priority