Open-source alternatives to Multimatch

A minimal matching utility.

Please consider following this project's author, Jon Schlinkert, and consider starring the project to show your :heart: and support.

randexp will generate a random string that matches a given RegExp Javascript object.

Simple wildcard matching

path-to-regexp is an HTTP route matcher and regular expression generator that transforms parameterized path strings into regular expressions for matching web addresses. It functions as a URL route parser and pattern compiler, enabling the conversion of human-readable path templates into functional expressions for routing. The project provides capabilities for extracting named parameters and wildcards from URLs based on defined path patterns. It also handles the reverse process of dynamic path generation, transforming key-value pairs into formatted path strings by injecting values into defined

Escape RegExp special characters

Instead of having to iterate over RegExp#exec, immutable, and with a nicer result format.

Pinot is a distributed, columnar analytical database designed for high-concurrency, low-latency query processing. It functions as a real-time OLAP datastore, enabling interactive, user-facing analytics by ingesting and querying massive datasets from both streaming and batch sources. The system architecture relies on a centralized controller for cluster coordination and a distributed segment-based storage model to ensure horizontal scalability. The platform distinguishes itself through a hybrid ingestion pipeline that unifies real-time event streams and historical batch data into a single quer

Spider is a multi-threaded web crawler and link extraction library designed for systematic website traversal and data collection. It functions as a utility for discovering and cataloging hyperlinks across domains, enabling the mapping of site architecture and the gathering of structured information. The tool utilizes a thread-pool concurrency model to fetch and parse multiple web pages simultaneously, maximizing network throughput during the crawling process. It manages navigation through a centralized queue-based frontier and employs in-memory state tracking to ensure efficient deduplication