This project is part of the @thi.ng/umbrella monorepo.
Array / Arraylike utilities.
STABLE - used in production
Search or submit any issues for this package
yarn add @thi.ng/arraysES module import:
<script type="module" src="https://cdn.skypack.dev/@thi.ng/arrays"></script>For Node.js REPL:
const arrays = await import("@thi.ng/arrays");Package sizes (brotli'd, pre-treeshake): ESM: 2.61 KB
Several demos in this repo's /examples directory are using this package.
A selection:
| Screenshot | Description | Live demo | Source |
|---|---|---|---|
 |
k-means clustering visualization | Demo | Source |
- arrayIterator()
- argSort()
- binarySearch()
- bisect()
- blit1d() / blit2d()
- endsWith()
- ensureArray()
- ensureIterable()
- fillRange()
- find()
- floydRivest()
- fuzzyMatch()
- insert()
- into()
- isSorted()
- levenshtein()
- multiSwap()
- peek()
- quickSort()
- shuffle() (w/ custom PRNG support)
- shuffleRange() (w/ custom PRNG support)
- sortByCachedKey()
- startsWith()
- swap()
- swizzle()
- topoSort()
The following predicates can be used to perform predecessor / successor
queries using binarySearch().
bsLT()- Returns index of last item less than search value or -1 if no such values existbsLE()- Similar tobsLT(), but for less-than-equals queriesbsGT()- Returns index of first item greater than search value or -1 if no such values existbsGE()- Similar tobsGT(), but for less-than-equals queriesbsEQ()- Merely syntax sugar, casting any non-found result indices to -1
const src = [10, 20, 30, 40];
bsLT(binarySearch(src, 25))
// 1
// greater-than queries also require the array length
bsGT(binarySearch(src, 25), src.length)
// 2
bsGT(binarySearch(src, 40), src.length)
// -1If this project contributes to an academic publication, please cite it as:
@misc{thing-arrays,
title = "@thi.ng/arrays",
author = "Karsten Schmidt",
note = "https://thi.ng/arrays",
year = 2018
}© 2018 - 2023 Karsten Schmidt // Apache License 2.0