| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/mips-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/libHSPSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d.a |
| FileSize | 594576 |
| MD5 | 427AA594B8E228EFCECFDC26E5F1C094 |
| SHA-1 | 1C778CB42FF0BEDA1091853591B13801647A4663 |
| SHA-256 | CD74EAC75BF1992098081DBE38C1E152A473ECD100268972BAE6C65FB00FBCD4 |
| SSDEEP | 3072:20tqiitjSgHg3mkRIWNuKQfBcccMccc/MgxKOOkkurlABT+FQRHRx:20tqiAWNuKll |
| TLSH | T138C41F685701C739CBCA9276D48BCBE1F773844AB3824B7B523417743D26A3EAF019A5 |
| 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 | 83106 |
| MD5 | 99519FB123D398BFD137501622828C3A |
| 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 | Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org> |
| PackageName | libghc-psqueue-dev |
| PackageSection | haskell |
| PackageVersion | 1.1-10 |
| SHA-1 | 85BD1853BC36C7BECE954EA0F0FA60DD04846AEA |
| SHA-256 | 39D1A3FB3D402061A2EFA0F241750CAF2CB74ECEAA954D2DDAB18F092E6991BF |