| Key | Value |
|---|---|
| FileName | ./usr/share/doc/libghc-psqueue-doc/html/Data-PSQueue.html |
| FileSize | 44433 |
| MD5 | 814CA56DD5B82215E059B63A4BE876F1 |
| SHA-1 | 0A8002D7F2314D42CDE1F8A1667F7F54B54900D8 |
| SHA-256 | 526E4F2CB065F8A91EEDB2CF8D426F673A90C86DA39465E5F66530C8C4A4BD91 |
| SSDEEP | 768:Kt1DRbTzKkk/ocHqURSOTR1yL7iMS8AaQ5267YszBvaBA9J/nrycvva:IRfcllNzTe+a |
| TLSH | T14913D2A093D5927D8B65C6CAE2D4753F324374F9E5419F0470ACC807DB8AFAC396A893 |
| 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 | 28620 |
| MD5 | 0A2DF556A91A804DA8AEDA086A796D8C |
| 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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | libghc-psqueue-doc |
| PackageSection | doc |
| PackageVersion | 1.1-10build1 |
| SHA-1 | 00546AA60C14969282906604790E143A1A476EF0 |
| SHA-256 | 61E967D940F88AAEE2D9C29FCA1AA505FFDCBC1ED080C5B8ED40FF93F269F526 |