Important
Please participate in the survey here!
(open until end of February)
To achieve a better sample size, I'd highly appreciate if you could circulate the link to this survey in your own networks.
Note
This is one of 189 standalone projects, maintained as part of the @thi.ng/umbrella monorepo and anti-framework.
🚀 Help me to work full-time on these projects by sponsoring me on GitHub. Thank you! ❤️
Array / Arraylike utilities.
STABLE - used in production
Search or submit any issues for this package
yarn add @thi.ng/arrays
ES 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.89 KB
Several projects in this repo's /examples directory are using this package:
Screenshot | Description | Live demo | Source |
---|---|---|---|
k-means clustering visualization | Demo | Source | |
Randomized 4-point 2D color gradient image generator | Demo | Source | |
Animated, iterative polygon subdivisions & visualization | Demo | Source | |
Responsive image gallery with tag-based Jaccard similarity ranking | Demo | Source | |
Responsive & reactively computed stacked column layout | Demo | Source |
arrayIterator()
argMin()
/ argMax()argSort()
binarySearch()
bisect()
blit1d()
/ blit2d()endsWith()
ensureArray()
ensureIterable()
fillRange()
find()
floydRivest()
fuzzyMatch()
insert()
into()
isSorted()
levenshtein()
multiSwap()
peek()
quickSort()
rotate()
/rotateTyped()
selectThresholdMin()
/selectThresholdMax()
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)
// -1
If 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 - 2024 Karsten Schmidt // Apache License 2.0