| 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 | 310528 |
| MD5 | D053B02094B38F7B150CF484E7840F44 |
| SHA-1 | FAFC69EFCB3D2AC4965D0F6FED6B69B072A3980D |
| SHA-256 | AC724217BF183963158BED6E78F797D37C62C4BB2CA933EBB1323F07531C4426 |
| SSDEEP | 6144:NCf295LHjcQYWmHXXGdkiwQzljbeHx6gW:E295LHjcQYawQzdb |
| TLSH | T117647383EB658F12CEACE9B6E00FE7149747C4AA4367D323051452E52F369D93D20EAD |
| 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 | 75546 |
| MD5 | 319E6B31415BC063ECA5622E087478B7 |
| 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 | 0C5F7E18D74C1E03D8876AC0CB11379EED936831 |
| SHA-256 | FE35D415D554CC59301299ABA010362B994A12906F6B201944F9E57C62D4817E |