| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/mips-linux-ghc-8.4.4/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2-ghc8.4.4.so |
| FileSize | 212940 |
| MD5 | BC63EE9347058CBD574088702E30F255 |
| SHA-1 | 7656BF9529E2A6ACFF971AA3D3F02BB8137A3136 |
| SHA-256 | F87C5023BC6D32E910CF7F7CEBE814586D1C7726F2F62D2B2917BEF6CD175622 |
| SSDEEP | 3072:66/oYN16PxwAUMNEUdD+1wJsoaD+zbGlpFqbgnUeIx2vsXC0MXCQALqBbDOFnjMj:6qtQL0EG1 |
| TLSH | T14424A8C32D18ECA0C15D4AB19AABBF6837C382142998DE4474138D4C5FBADE7E385DD6 |
| 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 | 70124 |
| MD5 | 5ECC96D15B560FE17BB1EC745933ED79 |
| 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-13+b2 |
| SHA-1 | 90E6A4BB4D634893A925663833476E8EBA02BD95 |
| SHA-256 | E3D9DC6929AC5F81CBE29606E35E4B154F9C8370B9CD76CDE8C34F0E4344849D |