| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-7.10.3/PSQueue-1.1-B2W2Jqwxlgm7tpuk3TcoPN/libHSPSQueue-1.1-B2W2Jqwxlgm7tpuk3TcoPN-ghc7.10.3.so |
| FileSize | 167920 |
| MD5 | 957A0887B8A8365C525E63B25400D800 |
| SHA-1 | 5587A7F2E183A5E58F06196BA57A5674D151D28B |
| SHA-256 | 4534EA8A0A8ED883BF06AD53A5B5E647272E6F9D0B23D0FD44112B6EC7543678 |
| SSDEEP | 3072:aL2Kns+7Wsu7mvIe7EqETWtAR/QJJuBSBX36gjAECZo7C:UwfSBX36gjAg+ |
| TLSH | T100F362369D8550E4C57C9BB87E896BA53ED4704A9722133B1BF046712E639C82BEC7F0 |
| 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 | 57450 |
| MD5 | CE4BA69557348DE90864E0E9D49620F0 |
| PackageDescription | Priority Search Queue 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 normal library files. |
| PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | libghc-psqueue-dev |
| PackageSection | haskell |
| PackageVersion | 1.1-8 |
| SHA-1 | 300DF5DBFBAC532F9E76431DCF26A519461A20C1 |
| SHA-256 | 6668DFE27941BB71E2ADF2CEF2E3C6638B882179AE298B1B9E50D325546F31A8 |