@folder/readdir
Recursively read a directory, blazing fast.
Recursively read a directory, blazing fast.
Find newer versions of dependencies than what your package.json allows
Js (immutable) array helper.
获取文本中所有链接,支持过滤。
Traverse through nested collections with ease.
Fixed-size disjoint set data structures for JavaScript
Binary search -based indexOf for sorted arrays.
Find all indexes at which an array element exists, by binary search.
Find the array index of where to add an element to keep it sorted.
Returns true if the element exists in the array
Returns all indexes at which an element is found.
Sorting by insertion - Look for bigger numbers on the left side. Runtime: O(n^2). It starts from the 2nd element, and it tries to find any element (to the left) that could be bigger than the current index. It will move all the elements that are bigger and
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
Binary search -based indexOf for sorted arrays.
R.find exported as a module
standalone AsyncAF package: includesAF (https://async-af.js.org/AsyncAF#includesAF)
standalone AsyncAF package: lastIndexOfAF (https://async-af.js.org/AsyncAF#lastIndexOfAF)
standalone AsyncAF package: splitAF (https://async-af.js.org/AsyncAF#splitAF)
standalone AsyncAF package: concatAF (https://async-af.js.org/AsyncAF#concatAF)
standalone AsyncAF package: filterAF (https://async-af.js.org/AsyncAF#filterAF)