How to Install and Uninstall libdatrie.i686 Package on Red Hat Enterprise Linux 9 (RHEL 9)
Last updated: November 25,2024
1. Install "libdatrie.i686" package
Please follow the steps below to install libdatrie.i686 on Red Hat Enterprise Linux 9 (RHEL 9)
$
sudo dnf update
Copied
$
sudo dnf install
libdatrie.i686
Copied
2. Uninstall "libdatrie.i686" package
Please follow the step by step instructions below to uninstall libdatrie.i686 on Red Hat Enterprise Linux 9 (RHEL 9):
$
sudo dnf remove
libdatrie.i686
Copied
$
sudo dnf autoremove
Copied
3. Information about the libdatrie.i686 package on Red Hat Enterprise Linux 9 (RHEL 9)
Last metadata expiration check: 1:28:42 ago on Mon Feb 26 07:04:30 2024.
Available Packages
Name : libdatrie
Version : 0.2.13
Release : 4.el9
Architecture : i686
Size : 35 k
Source : libdatrie-0.2.13-4.el9.src.rpm
Repository : ubi-9-appstream-rpms
Summary : Implementation of Double-Array structure for representing trie
URL : http://linux.thai.net/projects/datrie
License : LGPLv2+
Description : datrie is an implementation of double-array structure for representing trie.
:
: Trie is a kind of digital search tree, an efficient indexing method with O(1)
: time complexity for searching. Comparably as efficient as hashing, trie also
: provides flexibility on incremental matching and key spelling manipulation.
: This makes it ideal for lexical analyzers, as well as spelling dictionaries.
:
: Details of the implementation: http://linux.thai.net/~thep/datrie/datrie.html
Available Packages
Name : libdatrie
Version : 0.2.13
Release : 4.el9
Architecture : i686
Size : 35 k
Source : libdatrie-0.2.13-4.el9.src.rpm
Repository : ubi-9-appstream-rpms
Summary : Implementation of Double-Array structure for representing trie
URL : http://linux.thai.net/projects/datrie
License : LGPLv2+
Description : datrie is an implementation of double-array structure for representing trie.
:
: Trie is a kind of digital search tree, an efficient indexing method with O(1)
: time complexity for searching. Comparably as efficient as hashing, trie also
: provides flexibility on incremental matching and key spelling manipulation.
: This makes it ideal for lexical analyzers, as well as spelling dictionaries.
:
: Details of the implementation: http://linux.thai.net/~thep/datrie/datrie.html