Array filtering faster than the native array.filter method
react-select filterOptions function optimized to quickly filter large options lists
Small, performant & immutable iteration utilities for Arrays and Objects
broccoli filter but with a persistent cache
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Fast deep equal
Fastest deep equal comparison for React. Great for React.memo & shouldComponentUpdate. Also really fast general-purpose deep comparison.
Property based testing framework for JavaScript (like QuickCheck)
React is a JavaScript library for building user interfaces.
Validate XML, Parse XML, Build XML without C/C++ based libraries
CSV parser and writer
fast-csv formatting module
fast-csv parsing package
Dependency-free RFC 3986 URI toolbox
fork of fast-memoize and support esm
deterministic `JSON.stringify()` - a faster version of substack's json-stable-strigify without jsonify
Build XML from JSON without C/C++ based libraries
A fast and minimal alternative to globby and fast-glob
Parse HTTP Content-Type header according to RFC 7231
Force V8 to use fast properties for an object
Build and manage the fast-json-stringify instances for the fastify framework
PNG image decoder and encoder written entirely in JavaScript
Stringify your JSON at max speed
Fast Javascript text diff
Native Ruby extension to filter a list quickly.
Memory-efficient scalable Bloom Filter that grows dynamically. No upfront capacity needed. 20-50x less memory than Set, perfect for Rails apps.
A fast Bloom Filter library for Ruby for unices.
A fast, in-memory, bit map filter!
Filter strings on basis of percentage of changes to be made in the string in terms of levenshtein distance by string length
A fast Bloom Filter library for Ruby for unices.
A libcsv-based CSV parser for Ruby
Fast Bloom filter in C and Ruby.
Bloom filters for Ruby with automatic sizing and a fast native in-memory core, with a small, Set-like API.
bloombroom has two bloom filter implementations, a standard filter for bounded key space and a continuous filter for unbounded keys (stream). also contains fast C/FFI FNV hashing and fast bit field and bit bucket field (multi bits).
Fast n-dimensional filtering and grouping of records.
Fast and awesome tables, with pagination, sorting, filtering and custom views.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.