| Key | Value |
|---|---|
| FileName | ./var/lib/ghc/package.conf.d/PSQueue-1.1.conf |
| FileSize | 1249 |
| MD5 | EAA62A659D80992DFA6929F2AE8BE2B9 |
| SHA-1 | 8ABD320C1DB7EB1513944E7F781BD2A223BA8F02 |
| SHA-256 | E421CE7189432D9B7C101ABE760259DDB75E8BE35057E707C6EAEA7E49F66C6B |
| SSDEEP | 24:kxh++n+eWmINWh3cTwQfmHmog7EkJa85iaAP6N+5aay+e+zay+W4hnz+WwbPew+K:kxh+i+YINWVIrmKY3ag6vX+RX+WGnz+D |
| TLSH | T1F1211DA0723D99227DB3F8D3D72AB8F9231961B1231AF9D061CC4760376288A3117EE4 |
| 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 | 82296 |
| MD5 | E2F6AD116DB9250294CC9334B130327A |
| 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-10 |
| SHA-1 | 2F3BBC35150833B1114772B391654FBE9D3ECEA5 |
| SHA-256 | 8D0948201F04503EF20013302F3FA4D9439181285D34338D1D542251C95856A1 |