| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/aarch64-linux-ghc-8.4.4/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2-ghc8.4.4.so |
| FileSize | 203392 |
| MD5 | 47B15DD99A49B50E77E1138AD6617616 |
| SHA-1 | FF97BA1DC5F97117A2F636CCE34B056B4C37EE01 |
| SHA-256 | 094B22D5D2663C29372E23B3C42B465EC1FFBDA46A7FD7A6D9F9819FEA65BCA4 |
| SSDEEP | 1536:k4WeY9rLfx1UTl3VYv0GyrAw3K5BEoSb1Dn9ZjU3CyIwwlihGA6HUaSueoGTqC+o:Jqx1UTkv0GyhwBRqC |
| TLSH | T1FE14A42FDF0CD86ACFCAD5F6851ADA397B7A02090365D92344384960FCD1EC6AC99F46 |
| 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 | 63460 |
| MD5 | FE561E9395F483ED0CB72C4203D925FF |
| 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-13+b2 |
| SHA-1 | ACB09AC491D614C6828CFB1D32E92FD49312647F |
| SHA-256 | 9EFFB94214F3D62409732A4BCF25627EE2C39F43B83D7FB90E91647D964AAD56 |