| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/s390x-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/libHSPSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d.a |
| FileSize | 942400 |
| MD5 | BB467694135BF56B8FE14FDD9CE63F37 |
| SHA-1 | 4D54021FA3B2A9C1A5E4DC0A7FEF3F4E9D2DBE21 |
| SHA-256 | 3104A1B5C59EE41B689F0D501AF6784469F9B69851F732E748B2D3CFB59EDBC9 |
| SSDEEP | 6144:y9uG1IrsWfOxoecDzVQEokGCgsGSsS1md5ooZZXooZZXooXXver39Q8:KONQ |
| TLSH | T1AA15BD9456984083DAEABFF36ACF0B04BF379543E3A77D4186869B7208D3746DC6C4A4 |
| 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 | 131980 |
| MD5 | D4EB541E882E0732CAEFE0E2D5554392 |
| 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 | 68E51C82B391EEFFB47F7A68F55D26BCBCA75451 |
| SHA-256 | 6B0AA1532DC136B86777037969B6F1FE48281FB17E30085D2366B3F57A5CE5F9 |