| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/arm-linux-ghc-8.4.4/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2-ghc8.4.4.so |
| FileSize | 123408 |
| MD5 | 97C6A33E3C1A02A33710B29D3A54E559 |
| SHA-1 | AF2F9A657C0BF64529F483F60CBDFC1B79097A82 |
| SHA-256 | 0FC31F2AC13CAE20A98D3A51F0CEB883EDE3355CBE8929F1BE51EF23D0762458 |
| SSDEEP | 3072:x9bV5UbpNFFyf5J4wsBNSo/TjD5dO1wI:fJ4wshTjD5KP |
| TLSH | T117C3A846FC18C921C96ADDFBF26F9D247327050E9A6AEB23482445E03F9ACE1DC59C47 |
| 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 | 63240 |
| MD5 | B41B45B383B9579F47AF9F306E06B6A3 |
| 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-13+b2 |
| SHA-1 | EA2B120517701A115EDFA0C201507DA0D022F9F9 |
| SHA-256 | 4415BFD40CE08F5D36A07C7F91C5F3A724FE83D02F45547BE10EF7DE6C1876E2 |