openKylin re2 package

re2 20250805-ok1 source package in openKylin

Changelog

re2 (20250805-ok1) huanghe; urgency=medium

  * Build for openKylin.

 -- openKylinBot <email address hidden>  Wed, 03 Jun 2026 11:21:24 +0800

Upload details

Uploaded by:
openKylinBot
Sponsored by:
Cibot
Uploaded to:
Huanghe V3.0
Original maintainer:
Openkylin Developers
Architectures:
any
Section:
libs
Urgency:
Medium Urgency

Publishing See full publishing history

Series Pocket Published Component Section
Huanghe V3.0 proposed main libs

Downloads

File Size SHA-256 Checksum
re2_20250805.orig.tar.gz 388.5 KiB b5708d8388110624c85f300e7e9b39c4ed5469891eb1127dd7f9d61272d04907
re2_20250805-ok1.debian.tar.xz 6.0 KiB 68aee0e298d1b9be29d72121dab446773b4ec9e5b1edef854dc7eebeea0bb7be
re2_20250805-ok1.dsc 2.0 KiB 46a32070ccc990dd25e75f73830ac2ce3fb5c9405923d0115822b348f85e9dad

Available diffs

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.

python3-re2: efficient, principled regular expression library, Python bindings

 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 Python bindings, providing a module (re2) which is a
 drop-in replacement for the standard library re module.

python3-re2-dbgsym: debug symbols for python3-re2