1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
Source: re2
Section: libs
Priority: optional
Maintainer: Stefano Rivera <stefanor@debian.org>
Build-Depends:
debhelper-compat (= 13),
dpkg-dev (>= 1.16~),
g++ (>= 4:5),
python3,
python3-six,
unicode-data
Standards-Version: 4.5.1
Homepage: https://github.com/google/re2
Vcs-Git: https://salsa.debian.org/debian/re2.git
Vcs-Browser: https://salsa.debian.org/debian/re2
Rules-Requires-Root: no
Package: libre2-9
Architecture: any
Multi-Arch: same
Breaks: libre2-dev (<< 20131024+dfsg-1~)
Replaces: libre2-dev (<< 20131024+dfsg-1~)
Depends: ${misc:Depends}, ${shlibs:Depends}
Built-Using: ${Built-Using}
Description: 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.
Package: libre2-dev
Section: libdevel
Architecture: any
Multi-Arch: same
Breaks: libre2-0 (<< 0+hg40+dfsg-1~)
Replaces: libre2-0 (<< 0+hg40+dfsg-1~)
Depends: libre2-9 (= ${binary:Version}), ${misc:Depends}
Built-Using: ${Built-Using}
Description: 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.
|
