re2 20230301-ok2 source package in openKylin

Changelog

re2 (20230301-ok2) nile; urgency=medium

  * Update symbol.

 -- liubo01 <email address hidden>  Thu, 08 Aug 2024 14:34:14 +0800

Upload details

Uploaded by:
liubo01
Sponsored by:
Cibot
Uploaded to:
Nile V2.0
Original maintainer:
Openkylin Developers
Architectures:
any
Section:
libs
Urgency:
Medium Urgency

Publishing See full publishing history

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

Downloads

File Size SHA-256 Checksum
re2_20230301.orig.tar.gz 374.3 KiB 7a9a4824958586980926a300b4717202485c4b4115ac031822e29aa4ef207e48
re2_20230301-ok2.debian.tar.xz 6.0 KiB ba1793668fbc5f9eb2bf6f987944c932f49b9f9f1914b3918c42e9f911d16add
re2_20230301-ok2.dsc 1.7 KiB 28a6eb69f50ba1fdb61df9905f95fab29523a5d4117288dfc9264227347fff63

Available diffs

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.