re2 20180201+dfsg-2 source package in Ubuntu

Changelog

re2 (20180201+dfsg-2) unstable; urgency=medium

  * Upload to unstable.

 -- Stefano Rivera <email address hidden>  Fri, 23 Feb 2018 10:44:39 +0100

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
Bionic release universe libs

Downloads

File Size SHA-256 Checksum
re2_20180201+dfsg-2.dsc 1.6 KiB 99bcd6d5953d88b25326833539535d682d0b19d9b913b840c9227ea6ec391cd3
re2_20180201+dfsg.orig.tar.gz 313.0 KiB cbf6cc81a81535a92385043cc12dfff096f4a89130495a17cd30a95fde7ba255
re2_20180201+dfsg-2.debian.tar.xz 8.9 KiB a4e4477a90f9433b90b5dbe71ffdea2cc0fb190a6572f31f7bc9a3a5529a208b

No changes file available.

Binary packages built by this source

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

No description available for libre2-4-dbgsym in ubuntu cosmic.

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.