Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/arm-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/libHSPSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d_p.a |
FileSize | 426760 |
MD5 | 054348DE2F29AD96428BA9849BAD716B |
SHA-1 | DB496DA9CB7DD0369FDB82ED98C6E0394D2DBE95 |
SHA-256 | A64E03C461C4E2C0A88B8817DE1396D0536BDB1529CC32EE6D773AEF7196709B |
SSDEEP | 6144:EVmEUMkRn+qxCHHrm4qEvaot5g55ccBH+Hdx6gHa:EVmEUMkUT52eHVa |
TLSH | T18094A68EAB244F21CEDDE4F6E00FA760A756C527436BE713001452F43F56AEA3D11EA9 |
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 | 74274 |
MD5 | 19ACAA6BC83CF430D4D6F6034A5BF913 |
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-10 |
SHA-1 | E5586CEEC0327F0510B33415951DD542064A084E |
SHA-256 | F99C98871C0856BD448870186FEF85A6FE543945764C1394995EFBFB31904502 |