How to Install and Uninstall re2.i686 Package on Fedora 35
Last updated: November 25,2024
1. Install "re2.i686" package
This guide let you learn how to install re2.i686 on Fedora 35
$
sudo dnf update
Copied
$
sudo dnf install
re2.i686
Copied
2. Uninstall "re2.i686" package
Please follow the step by step instructions below to uninstall re2.i686 on Fedora 35:
$
sudo dnf remove
re2.i686
Copied
$
sudo dnf autoremove
Copied
3. Information about the re2.i686 package on Fedora 35
Last metadata expiration check: 5:27:58 ago on Wed Sep 7 02:25:42 2022.
Available Packages
Name : re2
Epoch : 1
Version : 20190801
Release : 9.fc35
Architecture : i686
Size : 163 k
Source : re2-20190801-9.fc35.src.rpm
Repository : fedora
Summary : C++ fast alternative to backtracking RE engines
URL : http://github.com/google/re2/
License : BSD
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).
Available Packages
Name : re2
Epoch : 1
Version : 20190801
Release : 9.fc35
Architecture : i686
Size : 163 k
Source : re2-20190801-9.fc35.src.rpm
Repository : fedora
Summary : C++ fast alternative to backtracking RE engines
URL : http://github.com/google/re2/
License : BSD
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).