| Key | Value |
|---|---|
| FileName | ./var/lib/ghc/package.conf.d/PSQueue-1.1.conf |
| FileSize | 1245 |
| MD5 | 7C68C63599A2879426653CDAED908EC7 |
| SHA-1 | 36759C156D59B695A337A8C3D6A97F28FF76F8B1 |
| SHA-256 | 0338301A2DF6F1260C9702FF0876FA9E20FDBCDBD06C4DB58F8416D604B2BA8A |
| SSDEEP | 24:kxh++n+eWmINWh3cTwQfmHmog7EkJa85iaAP6N+5aSy+e+zSy+W4hnz+WwbPew+K:kxh+i+YINWVIrmKY3ag6vP+RP+WGnz+D |
| TLSH | T14B2110A0723D98227D73F8D3D72AA4E9231D61B1221AF9D021DC4750376288A3117EE4 |
| 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 | 131980 |
| MD5 | D4EB541E882E0732CAEFE0E2D5554392 |
| 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 | 68E51C82B391EEFFB47F7A68F55D26BCBCA75451 |
| SHA-256 | 6B0AA1532DC136B86777037969B6F1FE48281FB17E30085D2366B3F57A5CE5F9 |