Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/mips-linux-ghc-8.8.4/PSQueue-1.1.0.1-5DtmDOZW73VHv1dRPVXwE2/libHSPSQueue-1.1.0.1-5DtmDOZW73VHv1dRPVXwE2.a |
FileSize | 487354 |
MD5 | BBD549D8C9408A3FE4C051A382C0F323 |
SHA-1 | 2D6CF0697158C4A19A5310BB8EFF97616CB2FB43 |
SHA-256 | 8A7D671A0CE19DFABB9A118BE6FA38C9133E2B04A2666C5FF966B0B2EECD11D2 |
SSDEEP | 3072:boUyZEATIGGvDQv4Hxgn+DF5X1NHq1C0/7YMB4jd1/oq8RGqZcL:bov4Hx7FA4/oq2/Zq |
TLSH | T1D6A444282B41D7BECBCE43B694658BE0FB53848AB3C2073B923406B51D11B6EDF56C56 |
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 | 82172 |
MD5 | 03FD2DE2A88B898815B7477C0AFB0D53 |
PackageDescription | Priority Search Queue 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 normal library files. |
PackageMaintainer | Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org> |
PackageName | libghc-psqueue-dev |
PackageSection | haskell |
PackageVersion | 1.1.0.1-3+b1 |
SHA-1 | 9FB0B99EA5249369D527CCA8383FED3F8ADDD288 |
SHA-256 | 2F9E7702195F346E466B2ACF71F525CF2FED109E9DC9A8138C7DAFAE0C89A88C |