Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/libHSPSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d_p.a |
FileSize | 405576 |
MD5 | 1D4A6EC915F184E1DC284B18409F47AF |
SHA-1 | D08FF93856C55D9E9D864B10513B73833C749B13 |
SHA-256 | 076693D55C5A74E8027121B0F2FE2068C6540FB05EACC544EC24778B3349CFDF |
SSDEEP | 12288:6nQEjEl5P/0rKn+FxSnEWr0cPK94B3KQ4Uh/hI/iBJ3a1Qg0Gqfr3orZYWbUZrOf:6nQEj |
TLSH | T1E98444023C5799A6CF298BF49575E1A032BABD568F1377231530323D2FB1F642EA49B4 |
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 | 53480 |
MD5 | 945E76EDB5A0BB75B5503F37E0CF975C |
PackageDescription | Priority Search Queue; profiling libraries 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 libraries compiled with profiling enabled. |
PackageMaintainer | Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org> |
PackageName | libghc-psqueue-prof |
PackageSection | haskell |
PackageVersion | 1.1-10 |
SHA-1 | 4D8891D827E34FED7D44BC41A671385129855E48 |
SHA-256 | D0A185A585863D95724B01530409510A40391CBF990FD67C5A09F0365DF77AF7 |