Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/i386-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/libHSPSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d-ghc8.0.1.so |
FileSize | 158676 |
MD5 | A2C1C30E9D6F29F4EBF011B0AF6F854C |
SHA-1 | 581CD4E95AC7FD272A7CDAC3C7022842BF11431B |
SHA-256 | FAA94F8C38539FB043EF4A00C7B718DA8B7BAC04840FE3A192218FA7F03472B3 |
SSDEEP | 1536:MswDfOBcAOFrP/ZY3vBVUvvzgsgHy57nIb8+3QpNVrJAoYVMY4:MTfOBcvPBY3vBVMzjwqLl |
TLSH | T169F3D850E9A9C6A4CAE6EB7511197239D18E020F8773D34F974B37B1ECA1899F403EC6 |
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 | 66816 |
MD5 | BBACE80A50C7EA6F41B6CF11DE2CC3F3 |
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 | 23706928B2FE25BC74D16281EFF0ABF221FB1E95 |
SHA-256 | 5842E5A8FA9AADFCF7202FCE6F5F56458E413BA29AB0F2AFF8436F30F93B9503 |