| Key | Value |
|---|---|
| FileName | ./usr/share/doc/libghc-psqueue-doc/html/index-frames.html |
| FileSize | 803 |
| MD5 | 794FCEB976FAAD21BB9504999D6D9843 |
| SHA-1 | 24CEF458A327C44364705B5A89BF22D771987B41 |
| SHA-256 | 90B6D126CE5C031402EC5E4A59FAB3A931E36A64A7BF9E0D1CED669BADEF8FCA |
| SSDEEP | 24:hMNmVpks4utNJqm1wgwnkR+VMmCTLOnAga:Im34uzYmkCTqny |
| TLSH | T1E201F1885C2DFA468105EFE1F1FAF718149FC18B9241CC4CA8C860DAE585FDDDD065C8 |
| 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 | 41214 |
| MD5 | 33C3551CC9CA9ADF36E3FB68C9B4F0C8 |
| 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-10 |
| SHA-1 | 1C6E1F6FE0DE8CBFD2BD3DCC1312E672C78BD4DC |
| SHA-256 | B29F205FBDDA8355A3E342F01AD29F61D439CB580964819345AA20B161E11C25 |