Key | Value |
---|---|
FileName | ./usr/lib/python3.8/site-packages/blist/__pycache__/__init__.cpython-38.pyc |
FileSize | 564 |
MD5 | 346444A7BE570372D26A8FDF75E98E3B |
SHA-1 | 601447C1C495C324A22A91497DBC0DA2CE77B05A |
SHA-256 | 2A84352AAF9182ED787DD048B3C639FAFCADFFB504552410D68E1FD94BB637A2 |
SSDEEP | 12:cIiDGB+sG1IgBBY8G/OpLAXkS0sdwov2B72m6wqD4YKo:cIcs3gvYN/gcEQw02d2xwiKo |
TLSH | T114F08B607E59FD32F4CEAABB603345157A61CE30528C47001B48988E850E680803792E |
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 | 673752BA84D42E741AE2E8A4FDB60312 |
PackageArch | armv7hl |
PackageDescription | The blist is a drop-in replacement for the Python list that provides better performance when modifying large lists. The blist package also provides sortedlist, sortedset, weaksortedlist, weaksortedset, sorteddict, and btuple types. Python's built-in list is a dynamically-sized array; to insert or remove an item from the beginning or middle of the list, it has to move most of the list in memory, i.e., O(n) operations. The blist uses a flexible, hybrid array/tree structure and only needs to move a small portion of items in memory, specifically using O(log n) operations. For small lists, the blist and the built-in list have virtually identical performance. Python 3 version. |
PackageMaintainer | Fedora Project |
PackageName | python3-blist |
PackageRelease | 24.fc32 |
PackageVersion | 1.3.6 |
SHA-1 | 999B87FF4082E7E3778470CE22907624A366AECF |
SHA-256 | AA77D544F1CC70A7D253EC4366E6CEF620C8C26DEA7FC6A9AE3B0D9DE6DABEE6 |