Ubuntu
re2 package

re2 20230301-3build1 source package in Ubuntu

Changelog

re2 (20230301-3build1) noble; urgency=high

  * No change rebuild for 64-bit time_t and frame pointers.

 -- Julian Andres Klode <email address hidden>  Mon, 08 Apr 2024 18:18:20 +0200

Upload details

Uploaded by:
Julian Andres Klode
Uploaded to:
Noble
Original maintainer:
Ubuntu Developers
Architectures:
any
Section:
libs
Urgency:
Very Urgent

See full publishing history Publishing

Series Pocket Published Component Section
Noble release main libs

Downloads

File Size SHA-256 Checksum
re2_20230301.orig.tar.gz 374.3 KiB 7a9a4824958586980926a300b4717202485c4b4115ac031822e29aa4ef207e48
re2_20230301-3build1.debian.tar.xz 10.3 KiB 238ee936c9e2cceff4ee3ba222106ecdcf0116163233ef96213b12ab81d1b46f
re2_20230301-3build1.dsc 2.0 KiB d28f7db3e848457c158a95c146aea86804111e247eedd5700aa9df5f57364d83

View changes file

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.