Key | Value |
---|---|
FileName | ./usr/share/doc/libghc-psqueue-doc/html/index.html |
FileSize | 1782 |
MD5 | DF9E3ABDA772C24FC99D226345F7B1D8 |
SHA-1 | 48CC14D3108808081A562B995B5E8AAB6272F23D |
SHA-256 | 08B1BF2A735743F6A60A43C81D1BE3B98ECA71CA97F8BA2FA35CB804D6D25DB7 |
SSDEEP | 48:Im34uzYm94xlXEzNgz9Ig1ma46pCTHcWCtIa:n87/XEBgpP4qCTHjXa |
TLSH | T14531959A692CB51302B39AC6F7F6F70022ABC2599211488420EC94DC36C1F8DFE02695 |
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 |