How to Install and Uninstall python38-PyTrie Package on openSuSE Tumbleweed
Last updated: November 07,2024
Deprecated! Installation of this package may no longer be supported.
1. Install "python38-PyTrie" package
In this section, we are going to explain the necessary steps to install python38-PyTrie on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
python38-PyTrie
Copied
2. Uninstall "python38-PyTrie" package
Please follow the step by step instructions below to uninstall python38-PyTrie on openSuSE Tumbleweed:
$
sudo zypper remove
python38-PyTrie
Copied
3. Information about the python38-PyTrie package on openSuSE Tumbleweed
Information for package python38-PyTrie:
----------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : python38-PyTrie
Version : 0.4.0-1.5
Arch : noarch
Vendor : openSUSE
Installed Size : 32,1 KiB
Installed : No
Status : not installed
Source package : python-PyTrie-0.4.0-1.5.src
Summary : A pure Python implementation of the trie data structure
Description :
pytrie is a pure Python 3 implementation of the trie data structure.
A trie is an ordered tree data structure that is used to store a mapping
where the keys are sequences, usually strings over an alphabet. In addition to
implementing the mapping interface, tries allow finding the items for a given
prefix, and vice versa, finding the items whose keys are prefixes of a given key.
----------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : python38-PyTrie
Version : 0.4.0-1.5
Arch : noarch
Vendor : openSUSE
Installed Size : 32,1 KiB
Installed : No
Status : not installed
Source package : python-PyTrie-0.4.0-1.5.src
Summary : A pure Python implementation of the trie data structure
Description :
pytrie is a pure Python 3 implementation of the trie data structure.
A trie is an ordered tree data structure that is used to store a mapping
where the keys are sequences, usually strings over an alphabet. In addition to
implementing the mapping interface, tries allow finding the items for a given
prefix, and vice versa, finding the items whose keys are prefixes of a given key.