Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/s390x-linux-ghc-8.8.4/PSQueue-1.1.0.1-5DtmDOZW73VHv1dRPVXwE2/libHSPSQueue-1.1.0.1-5DtmDOZW73VHv1dRPVXwE2_p.a |
FileSize | 566206 |
MD5 | 7B5E329A25BEB8832116628FA6B9AF88 |
SHA-1 | 27D4158307471512AD63D247992EF2A9212234B9 |
SHA-256 | 9C168F17F3DA6F88509021167AE5BCB8BD7CE05E25F75A43806892E893821EC3 |
SSDEEP | 6144:i6Msns3JrJHP3pP3M8qVheTNcdCJu/ZuZu/Z3oKvIWcW:UJrJW8qVB |
TLSH | T18DC4DCDAA7845946DB7AAB7339AD9F50F337174322EF370B893942B20811790CF594E2 |
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 | 65704 |
MD5 | 5C0EFEB210E947EA01C42AAFEC029BF6 |
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.0.1-3+b2 |
SHA-1 | 2F84D098042D1AD617CBA61A161DA2A5FE9B6DD1 |
SHA-256 | 454F5C52055E9B8CCB3B5F188F0F6BE2C3A728C07666F313524297D7BF922EC3 |