re2 20230201-ok1 source package in openKylin

Changelog

re2 (20230201-ok1) nile; urgency=medium

  * Build for openKylin.

 -- zhouganqing <email address hidden>  Mon, 23 Oct 2023 17:37:43 +0800

Upload details

Uploaded by:
周淦清
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

Downloads

File Size SHA-256 Checksum
re2_20230201.orig.tar.gz 373.8 KiB cbce8b7803e856827201a132862e41af386e7afd9cc6d9a9bc7a4fa4d8ddbdde
re2_20230201-ok1.debian.tar.xz 6.0 KiB 36c7a69054b9b1530e49072cf65a659a7e6cbfa96a896eacdcd27c330e172ce5
re2_20230201-ok1.dsc 1.7 KiB c4b7963e2012ae76cdec0122af7fa82458e122c2b7c395133cb11ea73d8e4c03

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.