Like a Set, but provides the index of the `key` in the backing array
Secure, audited & minimal implementation of BIP39 mnemonic phrases
Lazy-evaluating list of files, based on globs or regex patterns
Create an array with values that are present in the first input array but not additional ones
Universal Module for Secure Random Generator in JavaScript
Create an array without duplicates
Minimal async jobs utility library, with streams support
Define complex binary structures using composable primitives
No description provided.
Remove duplicate values from an array. Fastest ES5 implementation.
Random utility functions for ethers.
Fast JavaScript array sorting by implementing Python's Timsort algorithm
Turn anything into an array
Tailwind CSS linting rules for oxlint
Loop over each item in an array and call the given function on every element.
Array-slice method. Slices `array` from the `start` index up to, but not including, the `end` index.
Stringify your JSON at max speed
`Array#forEach()` but it’s possible to define where to move to next
Node-red nodes to convert values to and from buffer/array. Supports Big/Little Endian, BCD, byte swapping and much more
Dead simple, single file, tiny byte formatter
pure-JS library to handle codepages
Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.
utilities for primitive JavaScript types
Chai assertions for byte arrays equality