| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/PSQueue-1.1/ghc-7.6.3/libHSPSQueue-1.1_p.a |
| FileSize | 433104 |
| MD5 | 5AFCA60ADFB169F3947A6C11AFF63C3B |
| SHA-1 | E2AD46DCD9BD108B799A21726EEBAA0D3FB06B5F |
| SHA-256 | 2613010751AF5337A30364E8403745D80229D2492B83DC68B8C36B8670024F54 |
| SSDEEP | 3072:1Xgb7J7RbVNuCv3MgcXaVGAy5C4ygUApVHMm+bOVYQoxaOqk6mrNetelnk3lL6D3:GbHuQ3BVGZ5ZpVHMZbmTQe55oZ/ |
| TLSH | T108940E11DD9AE5CAC0FCD2B536AF82793A757C8AA7125743253823F42FB3B502A6C570 |
| 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 | 76934 |
| MD5 | 67F0AC92F75BEBF215D2004FD29A83C8 |
| 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 | A487E568529E81113216DE75A75FD1FD72706E69 |
| SHA-256 | 725A588B94314CEE2641A515AB8DCE91BA075A143A39F1ABD543C1B9B5BCD9B8 |