Package: libre2-5
Architecture: amd64
Version: 20190101+dfsg-2
Built-Using: unicode-data (= 11.0.0-1)
Multi-Arch: same
Priority: optional
Section: libs
Source: re2
Maintainer: Stefano Rivera <stefanor@debian.org>
Installed-Size: 457
Depends: libc6 (>= 2.14), libgcc1 (>= 1:3.0), libstdc++6 (>= 5.2)
Breaks: libre2-dev (<< 20131024+dfsg-1~)
Replaces: libre2-dev (<< 20131024+dfsg-1~)
Filename: ./depends/libre2-5/libre2-5_20190101+dfsg-2_amd64.deb
Size: 160800
MD5sum: 7088f32351c3078be470f15642e2cefa
SHA1: 664286b56b92576e01042c964ff327190154303e
SHA256: 3c88bb69f49bcc80b7e0a84c400113957898d0800f0a00b458eafc9e8dc39aeb
SHA512: b9f13b777a0e8153d8f5318132052dafa3850b93cb10971b42ed9cf43ac3e38ad031a8d1fccbbadd766ef4c2747d290ab585e417ca8872dac932063baa9a3f50
Homepage: https://github.com/google/re2
Description: 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.