Ubuntu
re2 package

re2 20200101+dfsg-1build1 source package in Ubuntu

Changelog

re2 (20200101+dfsg-1build1) focal; urgency=medium

  * No-change rebuild for libgcc-s1 package name change.

 -- Matthias Klose <email address hidden>  Sat, 21 Mar 2020 13:29:16 +0100

Upload details

Uploaded by:
Matthias Klose
Uploaded to:
Focal
Original maintainer:
Stefano Rivera
Architectures:
any
Section:
libs
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Focal release main libs

Downloads

File Size SHA-256 Checksum
re2_20200101+dfsg.orig.tar.xz 234.3 KiB c06e4a3738f09dd73dc0d679d04a215731bac54029347cc680db0f7eafc6a837
re2_20200101+dfsg-1build1.debian.tar.xz 9.4 KiB 2199f9f6d17c532571655912d83ff4296f81d09d4fe8c0b3571c39e41e147e95
re2_20200101+dfsg-1build1.dsc 2.0 KiB 35a6599e0ab90e46101b4796f4ee0da1754ef57502d2378a963ec5f6d1029e6d

View changes file

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: No summary available for libre2-5-dbgsym in ubuntu groovy.

No description available for libre2-5-dbgsym in ubuntu groovy.

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.