Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/mips-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/libHSPSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d_p.a |
FileSize | 529292 |
MD5 | BC2D8F6095E11E93AB5B8F6130D95CAB |
SHA-1 | 5BDDA9756E09FFA6697093F1F5A54CBE81A6C130 |
SHA-256 | 03689F1CE3FAA4EA958AAFB138FD9D0BB6259AAB5FE2EF03F2D98842CBCD4456 |
SSDEEP | 12288:qZcbMfHXXoGgBGVjkjh6hLb4fY9rqwjLamI7:6 |
TLSH | T1D9B4A603C6ECAD71D94CE5B1C495A2CC39B4F88F1359C753015862AAF86B799BF039E8 |
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 | 71416 |
MD5 | 9AAF83D9274AC1C9CDA4D736907B9DF0 |
PackageDescription | Priority Search Queue; profiling libraries 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 libraries compiled with profiling enabled. |
PackageMaintainer | Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org> |
PackageName | libghc-psqueue-prof |
PackageSection | haskell |
PackageVersion | 1.1-10 |
SHA-1 | 210045FA2FF8E7E54091A27F0CDEFAEB7D980E96 |
SHA-256 | 36333FCBC63667609E9EFF7D54A5A0FF6E8651C01FCE7781E097CD9B527B2410 |