Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/mips-linux-ghc-8.4.4/PSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2_p.a |
FileSize | 386868 |
MD5 | D7421D8FBB2D3BE3E4228D66ED51A355 |
SHA-1 | 57C893D9BCA3FF399C2A6799B82BC99E35D64E31 |
SHA-256 | 24AD7872962A8DFF3956C695E60DCD11F60F177441954F04144AB9A232DB23E1 |
SSDEEP | 3072:rb76ADfvrcDLrq8JbPmS6TVXHO08OVZH8IU+OqfFYgCsf2bDHbr/8875zUxk:r6ADvrcbbOSAVXbpfGEm5zqk |
TLSH | T13084DB826F08DD57C12F0BF146ABAB283BF7025417B4E88575068148DE94FEAE64CFD6 |
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 | 62988 |
MD5 | E24405EF72EF6FDB284CCD92DFDBFAD3 |
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-13+b2 |
SHA-1 | 0692F45312A46E03C4339FE5F54323F093217DB7 |
SHA-256 | DF43EFC1AA01B9582D4B30C015E14CE502A1A835E6AE364AE6100CE31E691516 |