re2 20210801+dfsg-1 source package in Ubuntu

Changelog

re2 (20210801+dfsg-1) experimental; urgency=medium

  * New upstream release.

 -- Stefano Rivera <email address hidden>  Wed, 04 Aug 2021 15:46:22 -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

Downloads

File Size SHA-256 Checksum
re2_20210801+dfsg-1.dsc 1.4 KiB fd0beabc2d35bc1170c40187f740d84c64ce750c8689387f8966c9e5da908446
re2_20210801+dfsg.orig.tar.xz 245.7 KiB b0e883c8ceb0ec635173fed10898fa48a0f07fc7544e6d4d4e495f9be93e2ebe
re2_20210801+dfsg-1.debian.tar.xz 9.9 KiB f0fe6380b3865d78ddb606718a2e759508d1c4a5c351981f4f03fbdd5a551cdf

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.