Search results
78 packages found
Fast 2d array suitable for dynamic programming
Make iteration, faster, prettier, or both.
A simple but fast native Hashmap implementation
Return intersect object that have same key from a number of objects
Quickest Way to get the Maximum Value of an Array of Numbers (Typed or Untyped)
O DB.js é uma biblioteca JavaScript poderosa e eficiente que simplifica a manipulação de dados JSON. Com funcionalidades semelhantes às operações de um ORM (Mapeamento Objeto-Relacional) e baseado em arrays de objetos ou listas do JavaScript, o DB.js ofer
Quickest Way to get the Minimum Value of an Array of Numbers (Typed or Untyped)
Concatenate mutiple Uint8Arrays super efficiently.
Get all but the last element or last n elements of an array.
A collection of useful utility functions with associated TypeScript types. All functions have been unit tested.
- TypeScript
- isNullOrUndefined
- isEmpty
- isEqual
- isNumber
- randomNumberBetweenRange
- random number between range
- asyncForEach
- async for each
- delay
- convertTimeUnits
- convert time units
- getToday
- setEndOfDay
- View more
[](https://www.npmjs.com/package/levenary) [](https://github.com/tanhauhau/levenary/actions)
- leven
- levenshtein
- distance
- array
- string
- algorithm
- algo
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more
Fastest array flatten.
Functions for working with arrays of bytes (Array and Uint8Array)
A fast and type safe recursive (deep) object/array/function freeze
alib-aquery is a high performance, chainable array querying library that is extensible to support any type of filtering. It supports filter (in place of where), limit, offset and order by. It is inspired by the SQL SELECT statement but for arrays of objec
Array library.
A tiny and fast circular buffer
Native JavaScript Array, but extended with custom indexing and group support for super-fast lookups.
A fast, small (~0.5 KB gzipped) and dependency-free JavaScript library to sort arrays. It uses quick sort internally to sort arrays _in place_, without recursion. Simply replace JavaScript's built-in `Array.prototype.sort` with f-sort's `sort` to see ~2x
A fast and performant *Least Frequently Used* (LFU) sorted set implementation for working with reasonably sized integers (unsigned). Trades memory for performance, optimised for frequently updating and counting a relatively small set of integers (integer