How to Install and Uninstall python38-cachey Package on openSuSE Tumbleweed
Last updated: February 01,2025
Deprecated! Installation of this package may no longer be supported.
1. Install "python38-cachey" package
Learn how to install python38-cachey on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
python38-cachey
Copied
2. Uninstall "python38-cachey" package
Please follow the step by step instructions below to uninstall python38-cachey on openSuSE Tumbleweed:
$
sudo zypper remove
python38-cachey
Copied
3. Information about the python38-cachey package on openSuSE Tumbleweed
Information for package python38-cachey:
----------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : python38-cachey
Version : 0.2.1-1.6
Arch : noarch
Vendor : openSUSE
Installed Size : 29,0 KiB
Installed : No
Status : not installed
Source package : python-cachey-0.2.1-1.6.src
Summary : A Python cache mindful of computation/storage costs
Description :
Cachey tries to hold on to values that have the following characteristics
1. Expensive to recompute (in seconds)
2. Cheap to store (in bytes)
3. Frequently used
4. Recenty used
It accomplishes this by adding the following to each items score on each access
score += compute_time / num_bytes * (1 + eps) ** tick_time
For some small value of epsilon (which determines the memory halflife). This
has units of inverse bandwidth, has exponential decay of old results and
roughly linear amplification of repeated results.
----------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : python38-cachey
Version : 0.2.1-1.6
Arch : noarch
Vendor : openSUSE
Installed Size : 29,0 KiB
Installed : No
Status : not installed
Source package : python-cachey-0.2.1-1.6.src
Summary : A Python cache mindful of computation/storage costs
Description :
Cachey tries to hold on to values that have the following characteristics
1. Expensive to recompute (in seconds)
2. Cheap to store (in bytes)
3. Frequently used
4. Recenty used
It accomplishes this by adding the following to each items score on each access
score += compute_time / num_bytes * (1 + eps) ** tick_time
For some small value of epsilon (which determines the memory halflife). This
has units of inverse bandwidth, has exponential decay of old results and
roughly linear amplification of repeated results.