Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/powerpc64le-linux-ghc-8.4.4/PSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2.a |
FileSize | 385792 |
MD5 | 213CBA1FF130AB98C8FB1AC10F196872 |
SHA-1 | FC0E2885A246101D662492419564C11C70EC71C9 |
SHA-256 | 884A991B52BA810F8D2E39235478681F27D3C03A4FB2085864F18DAA4BAEBE49 |
SSDEEP | 3072:JfNjztjzYsOccOccCFURt12+QvKj1fJQObFbyFXWhH8:JfNjztjzYsOccOcc+OdKw |
TLSH | T12C84F0ADDF1466CAC65CD975DC774F3426A308E991836E22CC6885902CE5BE1F9CBC83 |
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 | 74800 |
MD5 | 4882F1985CAE8720B2BBB6C2A81604C3 |
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 | 03E97B0F809183AA28B7FD8F958F01D68591A6D4 |
SHA-256 | A88EF5B607B93B5207DB4A67EE355709CDAF9E86508463B55231EFFA0EB2C29C |