Search results
3920 packages found
Fast binary heap priority queue implementation in JavaScript
- typescript
- Array.prototype.contains
- swf
- browser
- cjk
- cloudtrail
- fast-deep-copy
- launch
- loadbalancing
- error
- Symbol
- BigUint64Array
- fixed-width
- authentication
- View more
- ebs
- last
- nope
- StyleSheet
- emr
- slot
- stylesheet
- AsyncIterator
- persistent
- tester
- sanitize
- arrays
- pipe
- dotenv
- View more
Fast, lexicographic base62 encode and decode
- base62
- alphabetical
- lex
- lexico
- lexicographic
- lexicographical
- order
- sort
- fast
- efficient
- performance
- perf
- encode
- decode
- View more
simple and fast counting-sort
Table component with integrated filter search, column sort and pagination.
Function takes an array of numbers and returns new array with numbers in numeric order
Implements a blazingly fast O(n) sorting algorithm
No dependency binomial heap, compatible with typescript, can have custom compare function
sorting networks for up to 64 inputs. the fastest way to sort small lists.
Implements a blazingly fast O(???) sorting algorithm
List of utilities that speeds ups your project and lowers your cpu consumption.
Provide a `SortableCollectionView` and `SortableCollectionItemView` to sort **visually** a collection of items. The items are not sorted in memory, but only on the screen, which allow very fast sorting.
A tiny, fast, sortable, compact, flexible id generator. Think Stripe IDs but customizable, ULIDs but faster.
- flexid
- uuid
- tiny
- fast
- sortable
- compact
- flexible
- benchmark
- nanoid
- ksuid
- ulid
- uuid-random
- short-uuid
- auth0-id
- View more
Pass objects or variables and the generated hash will be the same regardless of the order the parameters were passed.
This is a javascript library to perform binary search on a sorted array.
Better version of a map with more utility methods.
C++ ternary search tree, for Node Buffers
A fast, flexible, sortable uuid generator