Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/mips-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/libHSPSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d_p.a |
FileSize | 529292 |
MD5 | E15C629D35FF1694585C011FCD6DAE63 |
SHA-1 | CD602BA7C4F4944F2A9D965AF615F73310AB8A79 |
SHA-256 | 0F441E7304821D7E5891EE57FB150F49D7A38F68528C401795DAD6E82729011D |
SSDEEP | 6144:jFBZWRBk51D6917fYaiUiMWK3APORHxgg1E7ON7O67MgmbAmbvdHFgg1L81g81ZD:8ZyFH5aL |
TLSH | T10BB4FAC1AB04ED96C53F27F1869F97543BEA829517B5E889310B8108CF25FDD9208FE9 |
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 | 69024 |
MD5 | 2A7A7038A71683E6333D31D4F9D04373 |
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 | CCE41D7F42F71B425E4F725361787DDC3016F720 |
SHA-256 | 41F3AB0785869E80A49C1DADD2D29745BAA8BB0FFF92E19B0DCCD47DE7BE63CC |