Ubuntu
re2 package

re2 20220201+dfsg-1 source package in Ubuntu

Changelog

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

  * New upstream release.
    - No longer declaring -std=c++11 in the .pc file. (Closes: #1003482)

 -- Stefano Rivera <email address hidden>  Wed, 02 Feb 2022 11:52:37 -0400

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
Jammy release main libs

Downloads

File Size SHA-256 Checksum
re2_20220201+dfsg-1.dsc 1.4 KiB aefba4829c3e5a7f3a80410ac46d0c74f154107c57b0f165bd8b29891d95be5f
re2_20220201+dfsg.orig.tar.xz 247.7 KiB 12fbc0cb7b16bcd84396174a29bf06492ab11e07f6c7acc45eda422e4e402895
re2_20220201+dfsg-1.debian.tar.xz 9.9 KiB d573222819fd58e81cc2090fce9f9085077170a9cfd4573a20a289d4d9b742d0

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.