Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-8.8.4/PSQueue-1.1.0.1-5DtmDOZW73VHv1dRPVXwE2/libHSPSQueue-1.1.0.1-5DtmDOZW73VHv1dRPVXwE2_p.a |
FileSize | 344678 |
MD5 | 8AC0A93C5240055D8FC96EAEDBBB9857 |
SHA-1 | 81D1D787A80FF172938DCB1E3BEE4CB9562786FA |
SHA-256 | 00BF85FC285137213609E5045F724F85DF7994CB89FA243DCFFF0E79155B9688 |
SSDEEP | 3072:SoTkcROhXXJXBYvfqXypakcYJBvSP0ls+sHIUcp8IQwqlM4cZFNA23F3AuMR5UUB:KYoIlZAi1VS5R5SY |
TLSH | T159743F016FCEECE9CA2D82F52A6986B577257C434B52D303115032B93EB7FB09EB9461 |
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 | 49784 |
MD5 | ED594083F47DE55752EDBFB9B24C6AAB |
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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | libghc-psqueue-prof |
PackageSection | haskell |
PackageVersion | 1.1.0.1-3build2 |
SHA-1 | 356E739A4D87F3B37214FA41F32219413B56FEA2 |
SHA-256 | DC896CC92E8AEDD3EEC51C807192E003F444730D08C0F31421807B33698A6197 |