<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
    <title>f#</title>
    <link rel="self" type="application/atom+xml" href="https://links.biapy.com/guest/tags/3430/feed"/>
    <updated>2026-04-30T04:38:11+00:00</updated>
    <id>https://links.biapy.com/guest/tags/3430/feed</id>
            <entry>
            <id>https://links.biapy.com/links/12280</id>
            <title type="text"><![CDATA[RE#]]></title>
            <link rel="alternate" href="https://github.com/ieviev/resharp-dotnet" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/12280"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[RE# - A high-performance, automata based regex engine with first-class support for intersection and complement operations. 

RE# compiles patterns into deterministic automata. All matching is non-backtracking with guaranteed linear-time execution. RE# extends System.Text.RegularExpressions syntax with intersection (&amp;amp;), complement (~), and a universal wildcard (_), enabling patterns that are impossible or impractical to express with standard regex. 

Related contents:

- [RE#: how we built the world&amp;#039;s fastest regex engine in F# @ ian erik varatalu](https://iev.ee/blog/resharp-how-we-built-the-fastest-regex-in-fsharp/).
- [finding all regex matches has always been O(n²). even in the engines built to prevent it @ ian erik varatalu](https://iev.ee/blog/the-quadratic-problem-nobody-fixed/).]]>
            </summary>
            <updated>2026-03-24T13:53:48+00:00</updated>
        </entry>
    </feed>
