| 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.a |
| FileSize | 419698 |
| MD5 | 65A0ED3111540BA5EBEC9B863C9752A5 |
| SHA-1 | BAB11C8A9D3199F7811E6E1BB44CB010E6F07796 |
| SHA-256 | 66134DE57A7EF90C55812C2A2536072259D848E2FD6F9636DDB452F760D2C41C |
| SSDEEP | 6144:YxpJsRsN5OxkADSOxvxYV/cX0jUxrZnaTeklVpA+p+pA+: |
| TLSH | T12194AA999B845446DBAEABB3359D4F50F33B038313EF370B86B952B21C81790DF558A2 |
| 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 |