re2 20230301-2 source package in Ubuntu

Changelog

re2 (20230301-2) unstable; urgency=medium

  * Upload to unstable.
  * Clean correctly.

 -- Stefano Rivera <email address hidden>  Tue, 13 Jun 2023 22:38:17 -0400

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
Mantic release main libs

Downloads

File Size SHA-256 Checksum
re2_20230301-2.dsc 1.3 KiB 7b444fa1b7bb1853dbeb0ccc91b7361000a2099e59ee93ed6c52acbd1f73631c
re2_20230301.orig.tar.gz 374.3 KiB 7a9a4824958586980926a300b4717202485c4b4115ac031822e29aa4ef207e48
re2_20230301-2.debian.tar.xz 10.2 KiB 293b7f39cae3a047cc15e5e03c82148c0e4e9814ce7c8327e3d3b0542cc31de7

Available diffs

No changes file available.

Binary packages built by this source

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