Ubuntu
re2 package

re2 20211101+dfsg-1 source package in Ubuntu

Changelog

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

  * New upstream release.
  * Refresh patches.
  * Drop patch python3, superseded upstream.
  * Bump Standards-Version to 4.6.0, no changes needed.

 -- Stefano Rivera <email address hidden>  Mon, 01 Nov 2021 18:05:34 -0700

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_20211101+dfsg-1.dsc 1.4 KiB 3b7f1e9a999cffb8ca2cadd88f27c302775458961ed6993dfad9f4ed35cb12e1
re2_20211101+dfsg.orig.tar.xz 246.5 KiB 6db1034c65d8b7e5b7648645795b07f20210412fe936e20a65be5824e92baad0
re2_20211101+dfsg-1.debian.tar.xz 9.8 KiB cc3aae14ee3847ae2c9f1a8489d232f869633bb58005e50e5dafa010993b385f

No changes file available.

Binary packages built by this source

libre2-9: 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-9-dbgsym: debug symbols for libre2-9
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.