You can find it here. It’s been there a while, but probably no-one has noticed:

https://github.com/laurikari/tre/

The repo has been migrated from the old repo in Darcs.

Pull requests are welcome.

As you may already know, the Darcs repository and the mailing list as well as the archive are down. Previously, I was actually running this site on a box sitting under my desk at home. I moved to a new house recently. Unfortunately, the fiber link isn’t yet hooked up, so now I’m using a hosting service for this site. As you can probably image, with a new house and everything, I haven’t been able to take the time to set up all services my old box had.

The plan is to migrate the TRE project to a proper platform such as Google Code, Bitbucket, or CodePlex, instead of spending a lot of my time in system administration. This will entail also moving from Darcs to Mercurial or Git. But I’m really looking forward to starting using an actual bug tracker for TRE.

I’ll keep this site updated as things start taking shape with the new site.

Yesterday, Russ Cox released a new regex matching library from Google, as an open source project. I think it’s very interesting and worth a look.

It shares many of the technical characteristics with TRE, mainly:

• Guarantee searching time linear to the size of input (no backreferences).
• Guarantee small fixed stack usage when searching

RE2 is compatible with the PCRE API, whereas TRE uses the POSIX API. RE2 does not have approximate matching support, so that continues to be the main differentiator of TRE compared to any other library out there.

Download here. New in this release:

• Added tre_ prefix to all functions exported from libtre. This changes the binary interface (ABI). The old source interface (API) is still available in <tre/regex.h>.  New code should use <tre/tre.h> which exports functions that have the prefix.
• Visual C++ 6 project files replaced with Visual Studio 2008 files.
• Bug fixes.

Earlier this year Alistair Crooks contacted me, telling that they would be interested in replacing the old NetBSD C library regex implementation with libtre.  The only problem was the license (LGPL).  I thought about it for about two seconds, and decided to finally release TRE with a BSD license.  So starting from 0.7.6, TRE comes with a 2-clause BSD license instead of the LGPL.

In a Google Summer of Code project, Matthias-Christian Ott has now ported TRE to NetBSD:

NetBSD’s current regular expression library was initially written by Henry Spencer in 1986, when ASCII was the de facto standard. Moreover, Spencer described it as slow. So it makes real sense to replace it and seek for alternatives.

The project home page is here.