| Key | Value |
|---|---|
| FileName | ./var/lib/ghc/package.conf.d/PSQueue-1.1.conf |
| FileSize | 1310 |
| MD5 | E4C236711D3142CEF5F3332B1AF1828B |
| SHA-1 | DC1A11E7B32A388303DC1ABA1D38DA7B6E0CF1B8 |
| SHA-256 | 9E3F2FBD1A01FB6FCA049AF30E6F62CB914551DC9161B4BBFB47C37D047CA943 |
| SSDEEP | 24:kxhPX7m8N8h3cFwWmHm8gfEQJ885iaATW+5ahkzhcz+I0cnY1BWeJ+27w+wPRD:kxhf68N8VwzmccbaHvhchczWcnYmUwJt |
| TLSH | T19521E256223C916239F7A8C3A765B4AD735A53F0311AE4C175CC8BD137A2C9E3413EA5 |
| 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 | 127362 |
| MD5 | 5DCFBA82C5B32991BB289E378456A763 |
| 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-4 |
| SHA-1 | C2652375F0BEDA2C8C05BBFA18DD8D5460E01467 |
| SHA-256 | E358B118CA0355178330055A5D21152B38B98CDBEA48900DE60FA9FB1AD765E9 |