| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/arm-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/libHSPSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d.a |
| FileSize | 316264 |
| MD5 | D4ABF12055C8E6F78189D843A26426D2 |
| SHA-1 | 21B7062D55F68311A537DD02BB488A60201A9087 |
| SHA-256 | 0108892B8B87B754B76B333F7BA0E7B59F5431076D1F405B3293CE54F26EBF81 |
| SSDEEP | 6144:ECOIrtEbLtkdyREbp9DENwQf9iB6Ax6gW:EIrtEbLtkdX9hwwQO |
| TLSH | T1B7647483EB658F12CEACE9B6E00FE7149747C4AB4267D323051452E52F369D93D20EAD |
| 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 | 76928 |
| MD5 | 156F37737FC3FB0E9B87ACF8E31A868A |
| 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 | 006E3E0350A9CB241FD140179A7874121DAE6803 |
| SHA-256 | 6ABD7C592CED0E0922EFA1B790545298ABA91DE53A0106F210EB05D42503B37F |