| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/mips-linux-ghc-8.4.4/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2-ghc8.4.4.so |
| FileSize | 295376 |
| MD5 | 859655DC6A7D8BD2736B98ED87E9445C |
| SHA-1 | AFA68E0BD88067DBA25DED2B790C330A0F9AAAC3 |
| SHA-256 | 25D18D037C8D930F9359A2F150E9591C048E8ED014C4F34DE6D2C4CD81B24493 |
| SSDEEP | 3072:WAvlwPjKbUcy1awl8/Vh+S/MfkP4ESB6iJ16XDg:5ynB62 |
| TLSH | T11E54866AFF05D67DC9CF94B9C835C0EDF6A10884A1118B4B91380DA47D32E9BD949CBB |
| 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 |