| Key | Value |
|---|---|
| FileName | ./usr/share/doc/libghc-psqueue-doc/buildinfo_all.gz |
| FileSize | 2485 |
| MD5 | DED875C1CC51BF2555A0EAABC8F467A8 |
| SHA-1 | 2B482C452D256DCAF4E17500D46CC2D9360CAB1E |
| SHA-256 | FF36E77194B347FBFC73A85D409B063B9B613AB1A94B502BF0C076561693419F |
| SSDEEP | 48:XmOE/Y1/kIz7qS9lSyT/rItVZnbHocmNlrTW2U+SV9k:Wl/YO2zDSyT/rIrVVqnW2sk |
| TLSH | T114514D48BD35347ED54B85BE77DACB88FC6CE4C0C5F855749609D40DC460E6984A8E92 |
| 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 | 46050 |
| MD5 | ABB28CD32FAD6BAA4008C52C6569AE38 |
| PackageDescription | Priority Search Queue; documentation 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 documentation files. |
| PackageMaintainer | Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org> |
| PackageName | libghc-psqueue-doc |
| PackageSection | doc |
| PackageVersion | 1.1-4 |
| SHA-1 | C2713CB8ADF6CAF14B920CC1C6AD27DBB2E5936D |
| SHA-256 | D697EEA99A99931FB2E45A863A52BC722917CECF234E7443166351AC8C0B918F |