Ubuntu
re2 package

re2 20190901+dfsg-1 source package in Ubuntu

Changelog

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

  * New upstream release.
  * Refresh patches.

 -- Stefano Rivera <email address hidden>  Mon, 02 Sep 2019 17:58:17 -0300

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

Downloads

File Size SHA-256 Checksum
re2_20190901+dfsg-1.dsc 1.6 KiB 27fca92f3d9faf710c4c16ebab907e4efa0620d32e593f9701a540d0171013d0
re2_20190901+dfsg.orig.tar.xz 234.0 KiB 0ff6e2d64aed6f12c0b1c998673b8e661b8a757c0cbbca07906fe4e9a1c65ef9
re2_20190901+dfsg-1.debian.tar.xz 9.2 KiB 84e8c275ddc6c35d237492f15881ca62995af77c7ef803a47a8349291b031af1

No changes file available.

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