re2 20200101+dfsg-1 source package in Ubuntu
Changelog
re2 (20200101+dfsg-1) unstable; urgency=medium * New upstream release. * Bump copyright years. -- Stefano Rivera <email address hidden> Thu, 02 Jan 2020 14:18:11 +0200
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 | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| re2_20200101+dfsg-1.dsc | 1.4 KiB | 44575fe1be43c5cdc5d2ea33ca4d220545f0b1e6eb8fe607d374f447c6ae2834 |
| re2_20200101+dfsg.orig.tar.xz | 234.3 KiB | c06e4a3738f09dd73dc0d679d04a215731bac54029347cc680db0f7eafc6a837 |
| re2_20200101+dfsg-1.debian.tar.xz | 9.3 KiB | 91e80853f9f05b6a9e70f85e51c95e97832b20900027b5193ed5fadcb95ac48c |
Available diffs
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.
