How to Install and Uninstall libre2-9-32bit Package on openSUSE Leap
Last updated: December 28,2024
Deprecated! Installation of this package may no longer be supported.
1. Install "libre2-9-32bit" package
This is a short guide on how to install libre2-9-32bit on openSUSE Leap
$
sudo zypper refresh
Copied
$
sudo zypper install
libre2-9-32bit
Copied
2. Uninstall "libre2-9-32bit" package
Here is a brief guide to show you how to uninstall libre2-9-32bit on openSUSE Leap:
$
sudo zypper remove
libre2-9-32bit
Copied
3. Information about the libre2-9-32bit package on openSUSE Leap
Information for package libre2-9-32bit:
---------------------------------------
Repository : Update repository of openSUSE Backports
Name : libre2-9-32bit
Version : 20211101-bp153.5.5.1
Arch : x86_64
Vendor : openSUSE
Installed Size : 566,7 KiB
Installed : No
Status : not installed
Source package : re2-20211101-bp153.5.5.1.src
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 : Update repository of openSUSE Backports
Name : libre2-9-32bit
Version : 20211101-bp153.5.5.1
Arch : x86_64
Vendor : openSUSE
Installed Size : 566,7 KiB
Installed : No
Status : not installed
Source package : re2-20211101-bp153.5.5.1.src
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).