| Key | Value |
|---|---|
| FileName | ./var/lib/ghc/package.conf.d/PSQueue-1.1.conf |
| FileSize | 1257 |
| MD5 | A02C03D2A3411E2E93927C7EA3222293 |
| SHA-1 | 0E9FB15AAD6A689F38E14A0F3171C288B9D633DC |
| SHA-256 | 145E2F58EDB6DC7E93404C8DA3C6CC651D7D44407B8B57AC83543FB260BEAA6E |
| SSDEEP | 24:kxh++n+eWmINWh3cTwQfmHmog7EkJa85iaAP6N+5aHSy+e+zHSy+W4hnz+WwbPey:kxh+i+YINWVIrmKY3ag6vv+Rv+WGnz+D |
| TLSH | T1FD2110E1723D98627D73F8D3E76AA4E9231D61B1221AF9D021CC97503B6288E3117EE4 |
| 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 | 79000 |
| MD5 | 4524186EB109231EF412E25071802B34 |
| 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 | 2F48CE6DB4D602ACAD1B6EB346A067473D5153E0 |
| SHA-256 | 48E7532E324CF50C6BA15895E4D3A7081563C95009EFE06F0E71CE5EF8FD28D2 |