JSPM

Get the first fulfilled promise that satisfies the provided testing function

Fastest Levenshtein distance implementation in JS.

Repeat the given string n times. Fastest implementation for repeating a string.

Pure random number generator written in TypeScript

Wait for any promise to be fulfilled

Wait for a specified number of promises to be fulfilled

A Quick and Precise Library for Calculating the Median Value of an Array of Numbers (Typed or Untyped)

🔥 A Quick and Precise Way to get the Median Value of an Array of Numbers (Typed or Untyped)

Extremely fast deep cloning function

the fastest function for deep clone js objects compatible with es6

Fastest array flatten.

A high-performance charting library.

fastest-expressjs-validator is a robust and easy-to-use middleware package for Express.js applications that simplifies request validation. With this package, you can effortlessly define validation schemas for request body, URL parameters, and query parame

Get the size of a folder by recursively iterating through all its sub(files && folders). Use go, so high-speed

Wait for any promise to be fulfilled. This is a fork of sindresorhus/p-any, but with CommonJS support.

Wait for a specified number of promises to be fulfilled. This is a fork of sindresorhus/p-some, but with CommonJS support.

quicker uuid, very fast

fs.readdir done right! Support sync, async and stream API, recursiveness and filters/globs.

Create docs faster than light

Benchmarks for Node.js JSON-schema validators

the fastest function for comparing two js objects compatible with es6

Enhance your website with our customizable React navbar. Enjoy the convenience of a sticky feature for seamless navigation.

List github repositories and download individual files or whole repos conveniently. Faster than clone depth=1 for an entire repo and much faster if you just need a single file

Rapid & lightweight build system.

Set of the fastest tools for optimizing the work of a React application

🚀 Servexy - The Fastest HTTP File Server. Lightning-fast HTTP server for serving files and directories with zero configuration.

this package lets you compare two strings and give you how much percent they are similar

Spell checker and suggestions with lightning fast c++ sym spell engine.

Github Extractor cli: List or download a whole repo or specific files and folders very quickly

Repeat huge string patterns quickly up to a precise number count.

Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.

Find Fastest Ubuntu Mirror

An extremely fast web scraper that parses megabytes of HTML in a blink of an eye. No dependencies. PHP5+

eslint rocket fast faster fastest speed super parallel Multi Processing Multi Threading git diff algorithm between commit blame

Get the first fulfilled promise that satisfies the provided testing function

Resolve multible promises with order: fastest, queue, stack

clash auto select fastest proxy tool

fastest router for koa

Fastest Levenshtein distance implementation in JS.

the fastest memoization library for memoizing JS functions that remembers the last result with deep argument comparison

NPM library for JSONSki for faster parsing of JSON data

Fastest, simplest and smallest. Pass `arguments` object or list of arguments and get flattened array.

Recursively crawl through directories

Deflate compression library based WebAssembly

HTML template literals view engine with compiler for plain Node.js modules

Recursive concurrent copy, ultrafast

A custom hook to handle state for all kinds of react applications. it's probabaly the smallest react state management library in the world. it also simplies the state management for complex applications.

download file as fast as possible

<h1> what is the fastest way to shrink an enlarged prostate? </h1>

Get the size of a folder by recursively iterating through all its sub(files && folders). Use go, so high-speed

A lightning-fast implementation of the Levenshtein distance algorithm. Written in AssemblyScript, compiled to WebAssembly, and optimized for speed.

A fast server side router

Fastest Minimalist CoffeeScript/JavaScript CoffeeCup/Handlebars/Mustache template engine.

fast glob. but use go, so high-speed

The FasTest way to test your code in all connected devices/browsers!

fs-readdir with additional performance-enhancing options.

<h1> what is the fastest way to shrink an enlarged prostate? </h1>

<h1> what is the fastest way to shrink an enlarged prostate? </h1>

<h1> what is the fastest way to shrink an enlarged prostate? </h1>

Maintains a collection of an objects of a single type for reuse.

Get fastest endpoint, given an array of urls.

Wait for a left-most matched promise to be fulfilled

<h1> what is the fastest way to shrink an enlarged prostate? </h1>

Find the fastest working route to a TCP service.

a small and fast utility to generate unique IDs

Repeat the given string n times. Fastest implementation for repeating a string.

Get fastest IP in your region.

Repeat the given string n times. Fastest implementation for repeating a string.

A fastest module to calculate the sum of numbers in an array.

Repeat the given string n times. Fastest implementation for repeating a string.

Repeat the given string n times. Fastest implementation for repeating a string.

Repeat the given string n times. Fastest implementation for repeating a string.

Create docs faster than light

Repeat the given string n times. Fastest implementation for repeating a string.

A fixed version of koa-rapid-router

fastest router for koa,fixed koa-rapid-router not found on window.

Use Fastest Ubuntu Mirror

Repeat the given string n times. Fastest implementation for repeating a string.

Repeat the given string n times. Fastest implementation for repeating a string.

Repeat the given string n times. Fastest implementation for repeating a string.

Faster implementations of JS functions leveraging WebAssembly

Repeat the given string n times. Fastest implementation for repeating a string.

Uses cache to save already computed levenshtein distance. If the strings you compare often repeat, this will save you a lot of compotation power