| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/i386-linux-ghc-8.8.4/PSQueue-1.1.0.1-5DtmDOZW73VHv1dRPVXwE2/libHSPSQueue-1.1.0.1-5DtmDOZW73VHv1dRPVXwE2.a |
| FileSize | 142026 |
| MD5 | 44A2EDBD2D575690D7DE57AD8C1C7BAE |
| SHA-1 | EC5322247247DC3669BDB1D64109C236D720564C |
| SHA-256 | 0EF93E5BFB2574CA803F0E55DB631B135DF009487726B348169126FBDE03B8A4 |
| SSDEEP | 3072:QOIpAt6bFnHYFys1rr/Lbplwf15mqc7oBOf:eUpr |
| TLSH | T1DED35400AF8DC5D4CF9F8AF9067D53B0B58B4B878293A20FA5584AC12D44EE5FD56C8B |
| 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 | 65580 |
| MD5 | EDACE8EF261133623A2609B071BFEE2B |
| PackageDescription | Priority Search Queue 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 normal library files. |
| PackageMaintainer | Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org> |
| PackageName | libghc-psqueue-dev |
| PackageSection | haskell |
| PackageVersion | 1.1.0.1-3+b1 |
| SHA-1 | 1E2CF31FF644CA0058015F9E4FF1C43A819D0E1F |
| SHA-256 | 3A7B85E37F0EBCE76F0DB1C546443193833A92E6F7C33E5F599F73A1D69F241E |