| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/mips-linux-ghc-8.4.4/PSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2.a |
| FileSize | 433288 |
| MD5 | F605E809C38195BF8E6DAC308409B223 |
| SHA-1 | 98FA1236058A41954AB3C929EAF433497187DCFA |
| SHA-256 | 01B345E4A8E3004433C6737924C8C454BEDEEB2EAFCE16C332AD29C11088DD19 |
| SSDEEP | 3072:HLv6lAdIGiDUo4O9fgnvN16PxwAUMP8R3kUfnSf5:HZo4O9Enc |
| TLSH | T1AC9431AC1B44CB7ECBDA8677C4168BE0F7538409B2914F3792700AB41D62ADFDF89856 |
| 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 | 75956 |
| MD5 | 714D06299E73335E873E9BDB521B5825 |
| 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+b2 |
| SHA-1 | FDE31ED60DBE50642A4AF95D1A69C1FCDEC28737 |
| SHA-256 | 5B3693487BD4F111F962BCB0F8496A8E49CC60C9BECFD78AA8310ED3F99E9C1F |