| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/arm-linux-ghc-8.4.4/PSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2.a |
| FileSize | 199114 |
| MD5 | C2E5DEC4752BED27BE7B429133CFCD53 |
| SHA-1 | 616DF432130D4B4BAA64B75C7349EEEB1C950E47 |
| SHA-256 | 4B4A236A8503D5C244E2E01EBB5EB45800301EC30922D45B7E3D6869808D322F |
| SSDEEP | 3072:Zxk0kLRG3GQy1fFAV5UTcNFFyKtAMBi6x6:ERGUNGA6x6 |
| TLSH | T1C0141147AF08CB12CA6ED9FBD16FFB34A356C5194266DB03882007D02EA6DD1ED59C17 |
| 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 | 62700 |
| MD5 | 4F186DC9842827FF6D91F9C90C3E709F |
| 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+b3 |
| SHA-1 | C096B3CC0A4DA1EA6A42CF3B7B0471BBA4047963 |
| SHA-256 | 83ACE2C42EED253DC959C9D71921B0B581074782D82B6146DA09B24716A48780 |