Key | Value |
---|---|
FileName | ./usr/lib/python3.8/site-packages/smmap/__pycache__/buf.cpython-38.opt-1.pyc |
FileSize | 5226 |
MD5 | 8BF255535B0C91846B0C8ECDABDCC753 |
SHA-1 | 2218468E936A4E4C517AB51EE9676E2C057489D7 |
SHA-256 | B415C4C6F98C694F49EF182946C420ECC42830DAE6C210D8CC13B9D1B8D9B53E |
SSDEEP | 96:4ydVgx3QM42U3Piy9Owup1C7nMi5Xy+Qr+rJb8r3WUivAimD0ycxc:Td83QpZ36y9OwoeFzb6WUivB4x |
TLSH | T133B1B587AF60673BFC15F2B460EF67EAA36450BF6624C240381C94593F0EAE184339D4 |
hashlookup:parent-total | 1 |
hashlookup:trust | 55 |
The searched file hash is included in 1 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
MD5 | 9A810B7873D0F518EBAD3C9CF8F9B695 |
PackageArch | noarch |
PackageDescription | When reading from many possibly large files in a fashion similar to random access, it is usually the fastest and most efficient to use memory maps. Although memory maps have many advantages, they represent a very limited system resource as every map uses one file descriptor, whose amount is limited per process. On 32 bit systems, the amount of memory you can have mapped at a time is naturally limited to theoretical 4GB of memory, which may not be enough for some applications. The documentation can be found here: http://packages.python.org/smmap |
PackageName | python3-smmap |
PackageRelease | 2.2 |
PackageVersion | 3.0.2 |
SHA-1 | 7DC1FE7856709ACFB815295162BDF95EFDA8F705 |
SHA-256 | 716395FD5EB9B82B93BF83842B9340179600EE9EC505E8455341F59B2B1D09B6 |