awesome-repositories.com
Blog
MCP
awesome-repositories.com

Découvrez les meilleurs dépôts open-source grâce à notre recherche par IA.

ExplorerRecherches sélectionnéesAlternatives open sourceLogiciels auto-hébergésBlogPlan du site
ProjetÀ proposNotre méthodologiePresseServeur MCP
Mentions légalesConfidentialitéConditions d'utilisation
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·
intel avatar

intel/hyperscan

0
View on GitHub↗
5,315 stars·782 forks·C++·other·6 vueswww.hyperscan.io↗

Hyperscan

Hyperscan is a high-performance regular expression matching library that scans large volumes of data against thousands of patterns simultaneously. It accepts PCRE-compatible regular expressions and supports multi-pattern matching in a single pass, approximate matching within a configurable edit distance, and streaming mode for processing data that arrives in blocks. The library is designed for throughput-oriented scanning across block, streaming, and vectored inputs.

What distinguishes Hyperscan is its hybrid automata engine, which combines deterministic and nondeterministic finite automata to match many patterns at once. It offers a lightweight runtime that excludes the compiler, reducing dependencies for embedded deployments. Other differentiating capabilities include logical combination of patterns (match fires only when a boolean expression over matches is true), pattern prefiltering for unsupported patterns, serialization of compiled databases with version and platform checks, and a custom allocator interface for controlling memory allocation.

Hyperscan provides pattern compilation of PCRE-compatible expressions and literal strings, syntax validation, and an approximate prefiltering compilation mode. Scanning operations include block mode for discrete records, streaming mode with state tracking across blocks, and a callback interface reporting match start and end offsets. Memory management covers user-supplied allocation for databases, scratch space, and streams, with independent scratch space lifecycle. At load time, Hyperscan selects the most efficient CPU instruction set variant automatically, and includes a throughput benchmarking tool for evaluating scanning performance.

Features

  • High-Performance Matchers - A high-throughput regex matching library for scanning large pattern sets across streaming, block, and vectored data.
  • Pattern Matching Engines - Accepts PCRE-compatible regular expressions and supports approximate matching with edit distance constraints.
  • Streaming Regex Matching - Matches patterns across streaming data blocks, tracking partial matches without recompilation.
  • Block Mode Scanning Operations - Scans discrete records in block mode for faster pattern matching without streaming overhead.
  • Hybrid DFA-NFA Engines - Combines DFA and NFA to match thousands of patterns simultaneously in a single scan pass.
  • Multi-Pattern Scanners - Scans input simultaneously against thousands of compiled regular expressions using hybrid automata techniques.
  • Pre-Compiled Engines - Compiles regular expressions into an optimized pre-compiled database for high-performance concurrent scanning.
  • High-Performance Regex Scanners - Scans large data volumes for many regex patterns simultaneously using SIMD and automata techniques.
  • Pattern Scanning Interfaces - Provides a callback interface for reporting match offsets during scanning of various data layouts.
  • Extended Syntax Support - Accepts PCRE-compatible regular expressions, enabling easy migration from other regex engines.
  • Approximate Matchers - Performs fuzzy pattern matching within a specified edit distance, trading performance for tolerance to variations.
  • Stream and Block Pattern Scanners - Supports both streaming mode across data blocks and block mode for faster discrete input scanning.
  • Approximate Matching Tools - Matches patterns within a configurable edit distance for approximate, fuzzy matching.
  • Multi-Pattern Matching Algorithms - Matches thousands of regular expressions simultaneously in a single pass using hybrid automata.
  • Compiler-Free Runtimes - Ships a lightweight runtime that excludes the compiler for reduced dependencies in embedded deployments.
  • Binary Pattern Serialization - Serializes compiled pattern databases with version and platform checks for storage or transfer.
  • CPU Instruction Optimizations - Selects the most efficient CPU instruction set variant at load time for maximum scanning performance.
  • Logical Pattern Combinations - Supports logical combinations of patterns so a match fires only when a boolean expression over matches is true.
  • Compiler-Free Runtimes - Ships a lightweight runtime that excludes the compiler for reduced dependencies in embedded deployments.
  • Streaming Matchers - Matches regular expressions across data streams, tracking partial matches across multiple blocks.
  • Streaming Regex Matchers - Matches patterns across data streams, tracking partial matches across multiple blocks.
  • Approximate Prefiltering Compilation Modes - Provides approximate prefilter compilation for unsupported patterns to enable fuzzy matching via later exact confirmation.
  • Approximate Regex Matchers - Moves pattern matching with a specified edit distance for fuzzy matching.
  • Edit Distance Matchers - Enables fuzzy pattern matching within a configurable edit distance, trading throughput for tolerance to small variations.
  • Pattern Match Combinators - Combines pattern matches with boolean logic so a match fires only when a logical expression over matches is true.
  • Regular Expressions - High-performance library for simultaneous matching of multiple regular expressions.

Historique des stars

Graphique de l'historique des stars pour intel/hyperscanGraphique de l'historique des stars pour intel/hyperscan

Recherche par IA

Explorez plus de dépôts awesome

Décrivez vos besoins en langage naturel — l'IA classe des milliers de projets open source sélectionnés par pertinence.

Start searching with AI

Questions fréquentes

Que fait intel/hyperscan ?

Hyperscan is a high-performance regular expression matching library that scans large volumes of data against thousands of patterns simultaneously. It accepts PCRE-compatible regular expressions and supports multi-pattern matching in a single pass, approximate matching within a configurable edit distance, and streaming mode for processing data that arrives in blocks. The library is designed for throughput-oriented scanning across block, streaming, and vectored inputs.

Quelles sont les fonctionnalités principales de intel/hyperscan ?

Les fonctionnalités principales de intel/hyperscan sont : High-Performance Matchers, Pattern Matching Engines, Streaming Regex Matching, Block Mode Scanning Operations, Hybrid DFA-NFA Engines, Multi-Pattern Scanners, Pre-Compiled Engines, High-Performance Regex Scanners.

Quelles sont les alternatives open-source à intel/hyperscan ?

Les alternatives open-source à intel/hyperscan incluent : tc39/proposal-pattern-matching — This is a TC39 proposal to add declarative pattern matching syntax to the ECMAScript language. It introduces a `match`… google/re2 — re2 is a C++ regular expression library designed for high-performance text processing. It is a non-backtracking regex… farzher/fuzzysort — fuzzysort is a JavaScript library for performing approximate string matching and ranking results. It functions as a… rapidfuzz/rapidfuzz — RapidFuzz is a C++ accelerated Python library providing high-performance string comparison and similarity… seatgeek/fuzzywuzzy — Fuzzywuzzy is a Python library and text processing utility designed to calculate similarity scores between strings. It… skim-rs/skim — Skim is a cross-platform interactive fuzzy finder that runs as a terminal application, a Rust library, a Vim and…

Alternatives open source à Hyperscan

Projets open source similaires, classés selon le nombre de fonctionnalités partagées avec Hyperscan.
  • tc39/proposal-pattern-matchingAvatar de tc39

    tc39/proposal-pattern-matching

    5,782Voir sur GitHub↗

    This is a TC39 proposal to add declarative pattern matching syntax to the ECMAScript language. It introduces a match expression that allows developers to inspect and branch on data structures using patterns with destructuring, guards, and logical combinators. The proposal defines a custom matcher protocol via a well-known symbol, enabling objects to implement user-defined matching logic with arbitrary extraction and decomposition. The proposal supports matching against literal primitives using SameValue equality with special handling for signed zero and NaN, as well as relational comparison

    HTML
    Voir sur GitHub↗5,782
  • google/re2Avatar de google

    google/re2

    9,699Voir sur GitHub↗

    re2 is a C++ regular expression library designed for high-performance text processing. It is a non-backtracking regex engine that provides linear-time pattern matching, ensuring that execution time remains proportional to the size of the input string regardless of the pattern used. The library supports UTF-8 and Latin-1 text encodings for searching and extracting substrings. It includes capabilities for multi-pattern optimization, allowing multiple regular expressions to be combined into a single representation to scan text for several patterns in one pass. The project covers core regex oper

    C++
    Voir sur GitHub↗9,699
  • farzher/fuzzysortAvatar de farzher

    farzher/fuzzysort

    4,302Voir sur GitHub↗

    fuzzysort is a JavaScript library for performing approximate string matching and ranking results. It functions as a string matching engine and weighted search utility designed to identify approximate matches within text and object lists. The library features a pre-indexed search implementation that processes target strings into an optimized format to accelerate repeated lookups. It supports weighted object retrieval, allowing users to search through lists of objects by matching multiple keys and applying custom weights to prioritize specific fields. The engine provides capabilities for searc

    JavaScriptfilterfuzzyjavascript
    Voir sur GitHub↗4,302
  • rapidfuzz/rapidfuzzAvatar de rapidfuzz

    rapidfuzz/RapidFuzz

    3,731Voir sur GitHub↗

    RapidFuzz is a C++ accelerated Python library providing high-performance string comparison and similarity calculations. It functions as a fuzzy string matching toolkit used to quantify the difference between text sequences through Levenshtein distance and other edit distance metrics. The library focuses on scalable approximate text matching, enabling the identification and ranking of similar strings within large datasets. It provides specialized utilities for finding the best matches in a collection and generating pairwise similarity matrices. The project covers a broad surface of text proce

    Pythoncpplevenshteinlevenshtein-distance
    Voir sur GitHub↗3,731
  • Voir les 30 alternatives à Hyperscan→