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 | 579160 |
MD5 | 08BC5B5461350C3A55FB8181A0F4465F |
SHA-1 | 7C060822E4DEB1CB4236DC80AE8F9D5942EEF239 |
SHA-256 | C25F8180796FC85B1838477C14789FFA384B9B3FD1FE3ACD68304E55039D9FEE |
SSDEEP | 6144:4PP8Agx2nM3T3RvILrFOqVvnVJXc5OjwcbIXjKWYKWM1BVeS2hGOIXIiuAiuAtxS:VjLYsZH |
TLSH | T18FC434791744CB2EDBDBA67B88068BE0B363C409B3914B3796380B7C1D52ADEDF49851 |
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 | 66124 |
MD5 | 720AA3D9CE2B7F7C7E64B3722AFA6AC2 |
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 | C6C3626EA039C73400503F9A5252B37E9A99BE51 |
SHA-256 | FE039770A3E0671527A3A7D40FCD67FF7B9D1FC310F4CA4F875F515961C5630C |