| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/s390x-linux-ghc-8.8.4/libHSPSQueue-1.1.0.1-5DtmDOZW73VHv1dRPVXwE2-ghc8.8.4.so |
| FileSize | 304768 |
| MD5 | 6A8A3003D0F1B2EEE079FB46A0099913 |
| SHA-1 | 7A83F38AC647183B08CC5CEDF13F50807F34152E |
| SHA-256 | 251F15237CCCA462E8E21EDAA4BECB90C2FF70EE9776C95B45C6FCF1ED2E8E18 |
| SSDEEP | 6144:iVa9eUs4GIIqmWPUbukNuUULmmjCsccLA8MNjPpaw6t+fJupOvZKm:iVhgC6nm |
| TLSH | T1FE541DE1EA516104E9B6FBB0369F8B10E337075322FD374FEA19A3B32C5036455669E2 |
| 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 | 91180 |
| MD5 | 5A7DF24808103BF40759C94AB4E4AA05 |
| 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.0.1-3+b2 |
| SHA-1 | 1433FB3B03FADDB962C0E315940FD614A47F0C59 |
| SHA-256 | 155205DAA4C59FBB91249901677C6A812FE8B970B23103EA5607A82FEC7C3F21 |