| Key | Value |
|---|---|
| FileName | ./usr/share/doc/libghc-psqueue-doc/html/src/Data-PSQueue.html |
| FileSize | 152051 |
| MD5 | A0C44C89A5CF39A969177BD54CD5B1D5 |
| SHA-1 | 8E520D95E1014E420A5B625CB3148B28027F9411 |
| SHA-256 | A9259D46B57D5A4CDF98954D25F1DE94FCFC428389E4B89722771D6BC2C40DD3 |
| SSDEEP | 768:JIi928HHlpSIFw6lS5XGNChuFEtoEREp3PpXJJeIqZGhwYee:JI1PGAoFf4See |
| TLSH | T1F7E3ADD0C6F38A262173D0E365DE7FF3B4A054EDD986196C66EF83A65BF9C04B806811 |
| 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 |