| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/s390x-linux-ghc-8.4.4/PSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2_p.a |
| FileSize | 513632 |
| MD5 | F0BED78D70B1752664B16A9B4FBD19CE |
| SHA-1 | 65C2FB22846393297CDD8D40A321EB94CC02D389 |
| SHA-256 | 62AC447367202133562FBBC3CF49CDDDDD271AF52B22AAD013AAE22FCD39DAD4 |
| SSDEEP | 6144:1+BYbYvugOugHBXnXYjTmXRmXRmRlg3K:A3K |
| TLSH | T1DCB4EBE29B88550BD6F99F73399E8B24F73B470396FF7B07C92986B20C50781494D892 |
| 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 |
|---|---|
| FileSize | 62072 |
| MD5 | 4F8341A7EE87CA3087E3716F01431BE3 |
| PackageDescription | Priority Search Queue; profiling libraries A /priority search queue/ efficiently supports the opperations of both a search tree and a priority queue. A 'Binding' is a product of a key and a priority. Bindings can be inserted, deleted, modified and queried in logarithmic time, and the binding with the least priority can be retrieved in constant time. A queue can be built from a list of bindings, sorted by keys, in linear time. . This package contains the libraries compiled with profiling enabled. |
| PackageMaintainer | Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org> |
| PackageName | libghc-psqueue-prof |
| PackageSection | haskell |
| PackageVersion | 1.1-13+b2 |
| SHA-1 | 04CE8F66F18F5B6806423A1AD655104F4C058F68 |
| SHA-256 | D847C620CDF3877353E250432E0E86459962056EF64B774682765A7F1463FE8D |