Key | Value |
---|---|
FileName | ./usr/lib/python3.8/site-packages/blist/__pycache__/_sorteddict.cpython-38.pyc |
FileSize | 7407 |
MD5 | F26489207680DAA71746EE660F8D953D |
SHA-1 | 1FCE286DFFA33275C02328BB2272817455AC1401 |
SHA-256 | A6C34A228AF93BA3594011F2A9B8C6612DAA020969EB404110AA80DE3E98B892 |
SSDEEP | 192:cbErPcpT1T/ScC66uZZWxEQ6O+Yo9ErcLJV:UErPc9N/1quZoOQ6O+Yo9Eryb |
TLSH | T1FCE1BCC156824F9FFDBDF2B680E61260B6259B7B5B4EA3434210E06B3E4D7C9483295F |
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 |