Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/aarch64-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/libHSPSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d.a |
FileSize | 605434 |
MD5 | 4B96B1494E93222521A4A460C3BF5303 |
SHA-1 | 98248E26EE0177603CBEDFD8664EA7EC47C56B65 |
SHA-256 | 9E44B2F9A02E133BC75AE6F46608E1A0299285C4595D8556681445076817A59C |
SSDEEP | 3072:g47zt2XzKLfRfJ3VuRHRccckcccLso5gwKOOkycLFR+1Wodltsl2gdt1n:P2jKLfRf15VoW52Q |
TLSH | T1F5D48C6D6B151841F6128A70CFFB13BAAB75C16D426A0F9BC24811787EC57BB7C03A9C |
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 | 82296 |
MD5 | E2F6AD116DB9250294CC9334B130327A |
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 | 2F3BBC35150833B1114772B391654FBE9D3ECEA5 |
SHA-256 | 8D0948201F04503EF20013302F3FA4D9439181285D34338D1D542251C95856A1 |