ieviev

ieviev / resharp-dotnet

Public

RE# - A high-performance, automata based regex engine with first-class support for intersection and complement operations.

regex regex-engine
103
2
100% credibility
Found Feb 28, 2026 at 84 stars -- GitGems finds repos before they trend. Get early access to the next one.
Sign Up Free
AI Analysis
F#
AI Summary

RE# is a high-performance regex engine for .NET that extends standard syntax with intersection (&), complement (~), and universal wildcard (_) operators for linear-time, non-backtracking matching.

How It Works

1
🔍 Discover super-fast text search

You hear about RE#, a tool that makes finding and matching patterns in text incredibly quick for your apps.

2
📦 Add it to your project

With one easy step, bring RE# into your work so it powers up your text handling.

3
✨ Unlock powerful patterns

Write smart searches that combine must-match and must-not-match rules, like finding strings with specific words but without others.

4
⚡ Test the speed boost

Run your searches on real data and watch them finish way faster than before.

5
🚀 Use in your app

Plug it into your program and enjoy lightning-quick text processing every time.

🎉 Blazing-fast results

Your app now searches and matches text effortlessly, saving time and delighting users.

Sign up to see the full architecture

4 more

Sign Up Free

Star Growth

See how this repo grew from 84 to 103 stars Sign Up Free
Repurpose This Repo

Repurpose is a Pro feature

Generate ready-to-use prompts for X threads, LinkedIn posts, blog posts, YouTube scripts, and more -- with full repo context baked in.

Unlock Repurpose
AI-Generated Review

What is resharp-dotnet?

RE# delivers a high-performance regex engine for .NET, built in F# as an automata-based alternative to System.Text.RegularExpressions. It compiles patterns to deterministic finite automata for guaranteed linear-time, non-backtracking matches, extending standard syntax with first-class intersection (&), complement (~), and universal wildcard (_) operations. Developers get thread-safe instances for reuse, plus zero-allocation matching via ValueMatches, ideal for complex patterns like "contains cat AND dog AND 8-15 chars."

Why is it gaining traction?

This github re engine crushes .NET's compiled and source-generated regex on rebar benchmarks—158x faster on date extraction, 34k x on unicode dictionary with context—thanks to start-set inference, literal prefixes, and full DFA precompilation. Unlike most automata engines, it handles lookarounds; users notice blazing speed on large alternations, loops, or set ops impossible in traditional regex. A web playground and ACM paper back its claims for dotnet high-performance needs.

Who should use this?

.NET backend engineers parsing logs, validating passwords/emails with intersections/complements, or scanning dictionaries in security tools like noseyparker. Suited for F#-C# apps needing linear-time regex on unstructured text, where standard engines bog down on complex ops.

Verdict

Promising re github fork for perf regex in dotnet—benchmarks scream "use me" for tough patterns—but 77 stars and 1.0% credibility score signal early maturity; docs solid, tests present, but watch for wider adoption. Prototype in the playground before committing.

Sign up to read the full AI review Sign Up Free

Similar repos coming soon.