| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/PSQueue-1.1/ghc-7.6.3/libHSPSQueue-1.1_p.a |
| FileSize | 274520 |
| MD5 | 7EDE981FF3FFB68296F5E965BAAD25DD |
| SHA-1 | F7FC0B54B6FC55797FCBB20DD50B9F78F100562F |
| SHA-256 | F2BEE5E48346AF3826307291F688A1B0074CEF8E5B76E63DDBD229F2459D7EF6 |
| SSDEEP | 3072:Lq/oG9frOjXGs4lKKBnrtJMY9bb4GYLPIL09epyyWBmpgdMaiKWJrDelhW696J4Q:+oG9J9cAkMjr6lP9KuS |
| TLSH | T12244C941734CC909C65E5BB24BAF73197259C32C865EE74F3C94E6683E01EE2BE1662C |
| 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 | 71996 |
| MD5 | B090A480D80CCAF7AABD901A62E23AC3 |
| 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-4 |
| SHA-1 | C9DF363A3509F85A4279FD31F1DACECF0D6194E5 |
| SHA-256 | 88F44285D41912877F4EF37627922332756377C0AA9C8A4FA380082AC34F20B7 |