| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/arm-linux-ghc-8.8.4/libHSPSQueue-1.1.0.1-5DtmDOZW73VHv1dRPVXwE2-ghc8.8.4.so |
| FileSize | 136172 |
| MD5 | B8F48B3FF325E972576EBAB33EE247B0 |
| SHA-1 | 55AE734BBA7342E5F9DEA795681A4376DD793EE8 |
| SHA-256 | B36FAFB5CEA183193036319CAC6E9544EBD311D0B7A0784152ACECCDEFA964DD |
| SSDEEP | 3072:7SpL5618xeUvNuW0Ds0V6tFhPr/8gA0zw5QsI:780Ds00P4cgjI |
| TLSH | T10CD3B611FE45CE90CB8E94FEB37E9960B667054F9BC7D217142881F13F9ADA0DC1A48A |
| 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 | 67628 |
| MD5 | E45F76AC5E3592D04DE20C3BDF6F0D07 |
| 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.0.1-3+b1 |
| SHA-1 | 25D4A882423BC6C28E5740448FF4EBB288212DA0 |
| SHA-256 | 9E23D66F022AF8BE605AADB79AC031379E874F7C77A29A981E435A63F1292FB7 |