| Key | Value |
|---|---|
| FileName | ./usr/share/doc/libghc-psqueue-doc/html/Data-PSQueue.html |
| FileSize | 35701 |
| MD5 | 755DB6C011FB895FC9822CE452973ABF |
| SHA-1 | 136D8A07C91A4D578ED70BCB78B57FDC2562FF85 |
| SHA-256 | 6FD0BEF9DC891CD8AEA2EFD124B993CFE4C70738501D35B1433A48F04A91ADC8 |
| SSDEEP | 768:st1DR9mzApAip+1p0nVpfxFv+0eEHYecvBgghOC8Rr7cKa9:2RwEx+MdZ/O9 |
| TLSH | T1B4F2E1A093D543BD8769CACE92D4722F324338F9F5419F05209C8C47DB89FAC795A8A7 |
| 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 | 28042 |
| MD5 | ED5BD020EF74C4FCF8261F52D85C346F |
| 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-8 |
| SHA-1 | 41FEE02FF21C1E446A5E3E2BA144E2B2578DFFFB |
| SHA-256 | EB2B25D033CBF9821FC49924F338B5539C5C34DF220E97E46E881B54FDB50DED |