Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/arm-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/libHSPSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d-ghc8.0.1.so |
FileSize | 180448 |
MD5 | 7073F619801598323F9965D7B99D856A |
SHA-1 | 2936D32969FD92991D71422332D1140D4E6212E2 |
SHA-256 | FAB40400B5E9983E85DEF12FDC6910736FD79A7E708EF43A71C2EA7D60CDC935 |
SSDEEP | 3072:ruOShu3Fcof6uNY0q0eWHFs//B54zNjslIvClhRAP1I:9FcJ0HeWHFs//8zNjsOClL |
TLSH | T19C049442F571CF50CF99BDBAF10FD955D0A6481B832BE2221514A3F83B3ADD92911F8A |
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 | 76928 |
MD5 | 156F37737FC3FB0E9B87ACF8E31A868A |
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 | 006E3E0350A9CB241FD140179A7874121DAE6803 |
SHA-256 | 6ABD7C592CED0E0922EFA1B790545298ABA91DE53A0106F210EB05D42503B37F |