| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/libHSPSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d.a |
| FileSize | 242140 |
| MD5 | E3B80388DB361840ACF6D40E52835F27 |
| SHA-1 | 6C345371CE43097D2B8296C7301BB3F0F0B20790 |
| SHA-256 | D34131DEF8CE5C775A78C0B3A3DA43C73D7EC84547D28F65ACFA986C27641181 |
| SSDEEP | 6144:QG/JravLJwfm7IzXyeWbbDcOlw2eR3ziYnUB:rXyeWbbDcOlomY |
| TLSH | T1A03445513C9688D2C93CCFB1A6E6715532EAAC4ACF1737332564336D2F72F442A94AB4 |
| 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 | 58322 |
| MD5 | 73939D82D43FD84BC30080DB32B35B13 |
| 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 | 6F2A276F0171EEAA1A1071735C38A55E834F176F |
| SHA-256 | BD37D8028E97E9BDC2F328316EE21BE63E789A3DE51AC874B6E32297194EE39A |