Result for 23258C8FF1ADCC14EEF5B1457E23AF8E0A5223CA

Query result

Key Value
FileName./usr/lib64/python3.4/site-packages/blist/__pycache__/_sortedlist.cpython-34.pyo
FileSize23968
MD500EF84EDEB8E07ACECB108E1693A0F1D
SHA-123258C8FF1ADCC14EEF5B1457E23AF8E0A5223CA
SHA-256682A56FC7913204D03AB0695AD1A745BB556D018A4D6267046F3CE0829488156
SSDEEP384:/uJACB2b3Tzf2Iy0Rc1Y2m9KnAanA87bxybUeIw2pIHjwN+adO3o2nppsasiFE2C:/uSqw2P77QgeGpIHUN+YO3oMppsasiFi
TLSHT16CB2319477820D6BFA59F3FA80751251BB7BD6636381B33521F4C47A3E863A4AA73090
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
MD5DE32E5E9F016BF5C9E4C4E31A1D74601
PackageArchppc64le
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.
PackageMaintainerFedora Project
PackageNamepython3-blist
PackageRelease5.fc23
PackageVersion1.3.6
SHA-1073F647F30ADE888A3972B0B3980BB2CFB4E0E28
SHA-2562E71FF09AA3C4B9439C12C16397BA4788C1CF576AE2524BF6690E2E0E65145DA