Ubuntu
re2 package

re2 20230201-1 source package in Ubuntu

Changelog

re2 (20230201-1) experimental; urgency=medium

  * New upstream release.
  * Drop the +dfsg repack, upstream has removed the XKCD cartoon.
  * Refresh patches.
  * Bump copyright years.

 -- Stefano Rivera <email address hidden>  Sun, 05 Feb 2023 19:12:44 -0400

Upload details

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

See full publishing history Publishing

Series Pocket Published Component Section
Lunar release main libs

Downloads

File Size SHA-256 Checksum
re2_20230201-1.dsc 1.3 KiB a1f4600f27fac297311e553f7f906cf7ef1cad00fbb3ce3891709165ea576f28
re2_20230201.orig.tar.gz 373.8 KiB cbce8b7803e856827201a132862e41af386e7afd9cc6d9a9bc7a4fa4d8ddbdde
re2_20230201-1.debian.tar.xz 10.1 KiB fd68412b83adb526a2e93d6536ec2de462b1d38d4166f74d82f12dee7a0f9be3

Available diffs

No changes file available.

Binary packages built by this source

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