Make React Faster. Automatically.
Pass two numbers, get a regex-compatible source string for matching ranges. Validated against more than 2.78 million test assertions.
Plugin for integrating Million components in Piral.
Everyday 30 million people experience. It's reliable, flexible and extendable carousel.
Computed Pi decimals, up to one million.
Everyday 30 million people experience. It's reliable, flexible and extendable carousel.
Everyday 30 million people experience. It's reliable, flexible and extendable carousel.
Everyday 30 million people experience. It's reliable, flexible and extendable carousel.
Everyday 30 million people experience. It's reliable, flexible and extendable carousel.
A tiny & fast key value store with append-only disk log. Ideal for apps with < 1 million records.
A command-line tool to verify if Million Lint is active in a project.
Simple WebComponents powered by Million vDOM
Pass two numbers, get a regex-compatible source string for matching ranges. Validated against more than 2.78 million test assertions.
JS library to manage and format numbers with Thousand (k), Million (M), etc. syntax
A tiny & fast key value store with append-only disk log. Ideal for apps with < 1 million records. Now with type declarations
A blazingly fast implementation of the justified layout gallery view popularized by Flickr, written in Rust and exported to WebAssembly. Capable of processing hundreds of thousands of boxes in under a millisecond, or 10 million boxes in under 50ms.
## Scaffolding Your Next Million Dollar Project
URL database with 90+ million categorized domains, using machine learning.
Everyday 30 million people experience. It's reliable, flexible and extendable carousel.
Everyday 30 million people experience. It's reliable, flexible and extendable carousel.
Search and explore 19.4 million Smithsonian Open Access museum objects, retrieve CC0 media, and discover cross-collection connections via MCP.
MCP server for searching 160 million academic papers from Giiisp database
A React component library for K-Million applications, providing a set of reusable UI components and utilities.
a very simple function to stringify any huge number of seconds. give it million seconds and it tells you how many days, hours, minutes and seconds in a pretty string.
BVH library with various build algorithms and high performance using packet traversal.
A high-performance, O(P) data structure for weighted random sampling of binned probabilities, ideal for large-scale simulations.
A Rust library designed for computing pi to millions of digits.
Just for test purpose
A Rust library designed for computing tau to millions of digits
A high-performance, declarative stream processor for delimited text data.
Some fast bloom filter implemented by Rust for Python and Rust!
A fast mpmc broadcast queue
Tiny LLM inference for ESP32 microcontrollers with INT8/INT4 quantization, multi-chip federation, RuVector semantic memory, and SNN-gated energy optimization
tallystick is a rust library for talling votes
In-memory cache implementation with TinyLFU as the admission policy and S3-FIFO as the eviction policy
Represent numbers in French language
MassiveSitemap - build huge sitemaps painfree. Differential updates keeps generation time short and reduces load on DB. It's heavealy inspired by BigSitemaps and offers compatiable API
Also, PI up to the Feynman Point
Delayed is a multi-threaded, SQL-driven ActiveJob backend used at Betterment to process millions of background jobs per day. It supports postgres, mysql, and sqlite, and is designed to be Reliable (with co-transactional job enqueues and guaranteed, at-least-once execution), Scalable (with an optimized pickup query and concurrent job execution), Resilient (with built-in retry mechanisms, exponential backoff, and failed job preservation), and Maintainable (with robust instrumentation, continuous monitoring, and priority-based alerting).
Because the world needs more buzzwords.
Rake on steroids
Fast Ruby PG csv export. Uses pg function 'copy to csv'. Effective on millions rows.
Returns a randomly selected Dutchism
Provides a system for processing data ranging from 1 million to several billion records
A kdtree is a data structure that makes it possible to quickly solve the nearest neighbor problem. This is a native 2d kdtree suitable for production use with millions of points.
So I don't have to copy and paste a million times.
Making rails easier, like a million other gems
Converts the metadata of PGN files from Lichess' game database to a database file, using lazy file enumerators for optimizing the conversion of large PGN files with millions of chess games.
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.