Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/arm-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/libHSPSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d-ghc8.0.1.so |
FileSize | 180460 |
MD5 | D0A4634DCC027AF77BC545C5E1925742 |
SHA-1 | BC4E2C75434F02DE236059058D27A8FD8761C6D3 |
SHA-256 | 18C07541B4F03D45EF9A29E82908AF09AEA3DDD1B3BAD979C7A257F74F8AE4B9 |
SSDEEP | 3072:SuOShu3FcVh348cCCG55fzc+SKS4Tqbznwv9y0GxRI/f:CFcxC+5fzc+Q4TqbO92/ |
TLSH | T19A048242F525CF50CF99BDFAF10FD555D0A6481B832BE2221514A3FC3B2ADE92911F8A |
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 | 75546 |
MD5 | 319E6B31415BC063ECA5622E087478B7 |
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-10 |
SHA-1 | 0C5F7E18D74C1E03D8876AC0CB11379EED936831 |
SHA-256 | FE35D415D554CC59301299ABA010362B994A12906F6B201944F9E57C62D4817E |