Ubuntu
re2 package

re2 20240501-3build1 source package in Ubuntu

Changelog

re2 (20240501-3build1) oracular; urgency=medium

  * Rebuild against new libre2-11.

 -- Gianfranco Costamagna <email address hidden>  Fri, 24 May 2024 19:31:38 +0200

Upload details

Uploaded by:
Gianfranco Costamagna
Uploaded to:
Oracular
Original maintainer:
Stefano Rivera
Architectures:
any
Section:
libs
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Oracular release main libs

Downloads

File Size SHA-256 Checksum
re2_20240501.orig.tar.gz 381.0 KiB fef2f366578401eada34f5603679fb2aebe9b409de8d275a482ce5f2cbac2492
re2_20240501-3build1.debian.tar.xz 9.4 KiB 0621a4da21d405fdcfbd580820f7162b0a593e3975b7a312426181ab7988e062
re2_20240501-3build1.dsc 2.0 KiB ce6dbe51959a059752f3c7406d6d08eb5ed6fd0578dd63f7de2307ad94953b3b

View changes file

Binary packages built by this source

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