Result for 17926FBB4BA0A6F8958E4C80E49AEAC3420792BB

Query result

Key Value
FileName./usr/lib/python3.8/site-packages/blist/__pycache__/_btuple.cpython-38.pyc
FileSize3915
MD5233C1D3954EB907F7A803A7EBFD212DD
SHA-117926FBB4BA0A6F8958E4C80E49AEAC3420792BB
SHA-256B074B26CF1B523C7C3F384BE9537A116E507A35803A063BB73B64AD7237E09F9
SSDEEP96:CJoqsfAgfKmxQMpcdc8qlCqkgTqHqFq1qhqCqIqVqO5TsgWHquq9qIqz0q9UJqdX:cPmxQY8qkqksqHqFq1qhqCqIqVqAsNqc
TLSHT134819DC952892F5BFC7DFABC879256107335637B234E914B1520F02B7E8B29868319F5
hashlookup:parent-total1
hashlookup:trust55

Network graph view

Parents (Total: 1)

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
MD5673752BA84D42E741AE2E8A4FDB60312
PackageArcharmv7hl
PackageDescriptionThe 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.
PackageMaintainerFedora Project
PackageNamepython3-blist
PackageRelease24.fc32
PackageVersion1.3.6
SHA-1999B87FF4082E7E3778470CE22907624A366AECF
SHA-256AA77D544F1CC70A7D253EC4366E6CEF620C8C26DEA7FC6A9AE3B0D9DE6DABEE6