| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/mips-linux-ghc-8.4.4/PSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2.a |
| FileSize | 285644 |
| MD5 | FFDC6F9143466507859FCE7C1A9FE895 |
| SHA-1 | CD2D694A70692C89F9F2A0A5A9ED14272A3B0F44 |
| SHA-256 | 5BF34DA2BF0EF1D166A9F28E1522160F09BF6692F7CEDC045B59172BC415BBB5 |
| SSDEEP | 3072:A/aYGsubjBN16PxwAUMU7HYYYCdCXp64WZ42jB:Ialb9B4pEB |
| TLSH | T1215485825F04DDA6C02F0AF1DE7B5B283BF7021917E8D881714B85489FA4EDAD648FD6 |
| 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 |