| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/powerpc64le-linux-ghc-8.4.4/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2-ghc8.4.4.so |
| FileSize | 276848 |
| MD5 | D57443FA7EBECEC7BAEA0FD053A59F5D |
| SHA-1 | D905D1CFE9BBD3859DE6AE9F884F10050439B794 |
| SHA-256 | C9FFC93D9BF41D4489487D167FA7DF1D85DEE826D7695D30B1B32587BF443EBC |
| SSDEEP | 3072:NLEt12+QvKj1NLMczdiFsTTvXyLz+ogNHwRFSRpWW3Q3o:AviF8TvXyLz+ogNHwRFSRpW |
| TLSH | T1544422E6FF6461A6C684EE78D43A7930313D249DD79FAA12943D85233CD8C91E44E8E3 |
| 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 |