re2 20200101+dfsg-ok1 source package in openKylin

Changelog

re2 (20200101+dfsg-ok1) yangtze; urgency=medium

  * Build for openKylin.

 -- openKylinBot <email address hidden>  Mon, 25 Apr 2022 22:03:04 +0800

Upload details

Uploaded by:
openKylinBot
Sponsored by:
luzp
Uploaded to:
Yangtze V1.0
Original maintainer:
Openkylin Developers
Architectures:
any
Section:
libs
Urgency:
Medium Urgency

Publishing See full publishing history

Series Pocket Published Component Section
Yangtze V1.0 release main libs

Downloads

File Size SHA-256 Checksum
re2_20200101+dfsg.orig.tar.xz 234.3 KiB c06e4a3738f09dd73dc0d679d04a215731bac54029347cc680db0f7eafc6a837
re2_20200101+dfsg-ok1.debian.tar.xz 6.2 KiB 28a0f469840978b9a79a6f8086e894148de63cc781890e578f6853c350fa7ca9
re2_20200101+dfsg-ok1.dsc 1.8 KiB 518759adb440cf39ae3b7124f68c9fbd5fbd7d6eaabf6dfd9a16421e1ed466d7

View changes file

Binary packages built by this source

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