| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/s390x-linux-ghc-8.4.4/PSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2.a |
| FileSize | 371856 |
| MD5 | 083BD1BDD06F986791F6933B1F588DCE |
| SHA-1 | 9ACDEBEC21E563CBEA560E6C18D10641F197D042 |
| SHA-256 | AAD3DDD467354057A5AF6EBF55D9D178EAED7182E35A63F3457AE56B1839C0A6 |
| SSDEEP | 6144:8ku69wYlYFI0TDLTiKeJqcUQ/IxKe7cpNkiNkiNiGO:2 |
| TLSH | T1DD840FD59A88850AD9F9DF7379DE8B10F637034393FF3B0BC92986713C507A09999892 |
| 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 | 78628 |
| MD5 | 39A0FCEC8B472EC5A6F77FB20ADA444B |
| 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 | CAEF1A54A491518CBE982066955896580CD0DBDB |
| SHA-256 | C05A70A57540E1E2576A7AB2B3FE79408D6F195281D4A21537FBD7CC9C2ADBD3 |