Ubuntu
re2 package

re2 20191201+dfsg-1 source package in Ubuntu

Changelog

re2 (20191201+dfsg-1) unstable; urgency=medium

  * New upstream release.
  * Refresh patches.

 -- Stefano Rivera <email address hidden>  Tue, 24 Dec 2019 09:05:45 +0200

Upload details

Uploaded by:
Stefano Rivera
Uploaded to:
Sid
Original maintainer:
Stefano Rivera
Architectures:
any
Section:
libs
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
re2_20191201+dfsg-1.dsc 1.4 KiB 72ee2c4a1860677b8ad635c72ed0ea07bedb66b5f8913d79ed2988de277445fe
re2_20191201+dfsg.orig.tar.xz 234.4 KiB 20f4c6770a4af98876210f8e0f7dabd650d65780e045ebaa8fffc3a8c39c43c4
re2_20191201+dfsg-1.debian.tar.xz 9.3 KiB ad49b2e30412270620cbc594c329ac4334f8fa61bf6482de5856e75197a7f73e

No changes file available.

Binary packages built by this source

libre2-5: efficient, principled regular expression library

 RE2 is a fast, safe, thread-friendly alternative to backtracking regular
 expression engines like those used in PCRE, Perl, and Python. It is a C++
 library.
 .
 RE2 uses automata theory to guarantee that regular expression searches run in
 time linear in the size of the input. RE2 implements memory limits, so that
 searches can be constrained to a fixed amount of memory. RE2 is engineered to
 use a small fixed C++ stack footprint no matter what inputs or regular
 expressions it must process; thus RE2 is useful in multithreaded environments
 where thread stacks cannot grow arbitrarily large.
 .
 On large inputs, RE2 is often much faster than backtracking engines; its use
 of automata theory lets it apply optimizations that the others cannot.

libre2-5-dbgsym: debug symbols for libre2-5
libre2-dev: efficient, principled regular expression library, development kit

 RE2 is a fast, safe, thread-friendly alternative to backtracking regular
 expression engines like those used in PCRE, Perl, and Python. It is a C++
 library.
 .
 RE2 uses automata theory to guarantee that regular expression searches run in
 time linear in the size of the input. RE2 implements memory limits, so that
 searches can be constrained to a fixed amount of memory. RE2 is engineered to
 use a small fixed C++ stack footprint no matter what inputs or regular
 expressions it must process; thus RE2 is useful in multithreaded environments
 where thread stacks cannot grow arbitrarily large.
 .
 On large inputs, RE2 is often much faster than backtracking engines; its use
 of automata theory lets it apply optimizations that the others cannot.
 .
 This package contains the static library and header files used in development.