| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/i386-linux-ghc-8.4.4/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2-ghc8.4.4.so |
| FileSize | 114304 |
| MD5 | B854E760C1A5332B1463D3283391A965 |
| SHA-1 | A50E6CA20FC9CD1E3F1A6F75F0A0F3C6E214BAF2 |
| SHA-256 | D41B3C8E5CBB1459CE79ACD732DBD074BFF70F7A09A2029D1B77D5DA15E60D33 |
| SSDEEP | 3072:nH2Q/J7K2rkVlpamsTTBNROGfieaTjM/aBP:nml6WXMiBP |
| TLSH | T132B37612FD49C668CDFADEB6522E5238D26A020F4233930F9B161BC4ACE1DD5ED95CC6 |
| 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 | 61124 |
| MD5 | E0E93F34E0897D6E39CAF39A716D11F4 |
| 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 | E285C74BA36E414CB4FD6086D770551628910647 |
| SHA-256 | DEC0F1370706EB5FCF5F91270E327838D67BDB9389DD70E7C5F3636B541A6B5F |