Parents (Total: 4)
The searched file hash is included in 4 parent files which include package known and seen by metalookup. A sample is included below:
Key |
Value |
MD5 | 8FD6325836E56D7D9CF2F72B9EBEC2A1 |
PackageArch | noarch |
PackageDescription | 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. |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | python310-cachey |
PackageRelease | 1.8 |
PackageVersion | 0.2.1 |
SHA-1 | 05F0394CE6293DED0D85F97B3C070E763C805C1A |
SHA-256 | 36F6CDBFA4F4BDC3BE36012F2FE7F262213B2EA7EF8C6EE06459A3BA77D14250 |
Key |
Value |
MD5 | AE53C1177F11745EDE12C5032F04E396 |
PackageArch | noarch |
PackageDescription | 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. |
PackageName | python310-cachey |
PackageRelease | 8.28 |
PackageVersion | 0.2.1 |
SHA-1 | 767BEACB8F9013BF35DB65C352F23A32BF2EE773 |
SHA-256 | A68E4DA1D8919350AE4EE6D4348F0EF391324F602FC7836D66D2004D94C6CD14 |
Key |
Value |
MD5 | E9372D0B067E45636CA63E3214E7B26D |
PackageArch | noarch |
PackageDescription | 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. |
PackageName | python310-cachey |
PackageRelease | 8.16 |
PackageVersion | 0.2.1 |
SHA-1 | 2FC7F3229029ACBFB7701CE40C61926F13BED3E9 |
SHA-256 | 31DD0B2089A39BEF57DD5F11786189F373A1C22FE1CD7711FEAFD07100FE2CB9 |
Key |
Value |
MD5 | C0CC9AC207D17BB5243EAFC3572A3D3C |
PackageArch | noarch |
PackageDescription | 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. |
PackageName | python310-cachey |
PackageRelease | 8.18 |
PackageVersion | 0.2.1 |
SHA-1 | 0B641757FB80CEF32223A4E13309C2BE8CF0A3CF |
SHA-256 | CD537EBDF74F43B5F69C7C7EC17304980207A9961F81E73807D11B31456F77F0 |