Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/s390x-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/libHSPSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d-ghc8.0.1.so |
FileSize | 541760 |
MD5 | A7ED3355F54DC97ED3BADDD5002906E5 |
SHA-1 | B533A39561D8CB32AEB795F1880A87C1BC30D19A |
SHA-256 | 2A58DFCCA08882848ED0C9EA65A727153C2093CB7DABB1D362B7049E5CDB5221 |
SSDEEP | 6144:jR5ccWVlBxben4e7w8qGDSY15Fsa8GksuR/Sr539QTDV69KVe5TGGzz5GF77Fqqy:Sx1e7G |
TLSH | T176B4DAD961184184EA73FB313A8F4E58F233A6523AED39C5D707EFA32C60B5852548F6 |
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 |