How to Install and Uninstall python310-PyTrie Package on openSuSE Tumbleweed
Last updated: November 08,2024
1. Install "python310-PyTrie" package
This tutorial shows how to install python310-PyTrie on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
python310-PyTrie
Copied
2. Uninstall "python310-PyTrie" package
This tutorial shows how to uninstall python310-PyTrie on openSuSE Tumbleweed:
$
sudo zypper remove
python310-PyTrie
Copied
3. Information about the python310-PyTrie package on openSuSE Tumbleweed
Information for package python310-PyTrie:
-----------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : python310-PyTrie
Version : 0.4.0-1.17
Arch : noarch
Vendor : openSUSE
Installed Size : 32.2 KiB
Installed : No
Status : not installed
Source package : python-PyTrie-0.4.0-1.17.src
Upstream URL : https://github.com/gsakkis/pytrie/
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 : python310-PyTrie
Version : 0.4.0-1.17
Arch : noarch
Vendor : openSUSE
Installed Size : 32.2 KiB
Installed : No
Status : not installed
Source package : python-PyTrie-0.4.0-1.17.src
Upstream URL : https://github.com/gsakkis/pytrie/
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.