| Key | Value |
|---|---|
| FileName | ./var/lib/ghc/package.conf.d/PSQueue-1.1.conf |
| FileSize | 1374 |
| MD5 | A94EB8864E759BF312069B2AD0352F44 |
| SHA-1 | 87150D449F82D8C9D0F202674854A83CA5F29402 |
| SHA-256 | 76AC16018877975963D43BFFE1F82383D55FDE8A66303049F6C9BC90E6F9F053 |
| SSDEEP | 24:kxhIqInGCpINWh3cTwQfmHmog7EkJa85iXvAl5aEIVzEIxTzBhnzIF0nmjIw+wPt:kxhIqInHINWVIrmKY3XvDEIpEIxPbnzO |
| TLSH | T1572106A1232CC17279B37CC7FB6AACB5235AA7B02519F48074D897103B91CCDA516D91 |
| 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 |