How to Install and Uninstall libre2-11 Package on openSuSE Tumbleweed
Last updated: December 27,2024
1. Install "libre2-11" package
Please follow the step by step instructions below to install libre2-11 on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
libre2-11
Copied
2. Uninstall "libre2-11" package
Please follow the step by step instructions below to uninstall libre2-11 on openSuSE Tumbleweed:
$
sudo zypper remove
libre2-11
Copied
3. Information about the libre2-11 package on openSuSE Tumbleweed
Information for package libre2-11:
----------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : libre2-11
Version : 20240301-59.2
Arch : x86_64
Vendor : openSUSE
Installed Size : 483.8 KiB
Installed : No
Status : not installed
Source package : re2-20240301-59.2.src
Upstream URL : https://github.com/google/re2
Summary : C++ fast alternative to backtracking RE engines
Description :
RE2 is a C++ library providing a fast, safe, thread-friendly alternative to
backtracking regular expression engines like those used in PCRE, Perl, and
Python.
Backtracking engines are typically full of features and convenient syntactic
sugar but can be forced into taking exponential amounts of time on even small
inputs.
In contrast, RE2 uses automata theory to guarantee that regular expression
searches run in time linear in the size of the input, at the expense of some
missing features (e.g. back references and generalized assertions).
----------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : libre2-11
Version : 20240301-59.2
Arch : x86_64
Vendor : openSUSE
Installed Size : 483.8 KiB
Installed : No
Status : not installed
Source package : re2-20240301-59.2.src
Upstream URL : https://github.com/google/re2
Summary : C++ fast alternative to backtracking RE engines
Description :
RE2 is a C++ library providing a fast, safe, thread-friendly alternative to
backtracking regular expression engines like those used in PCRE, Perl, and
Python.
Backtracking engines are typically full of features and convenient syntactic
sugar but can be forced into taking exponential amounts of time on even small
inputs.
In contrast, RE2 uses automata theory to guarantee that regular expression
searches run in time linear in the size of the input, at the expense of some
missing features (e.g. back references and generalized assertions).