| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/aarch64-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/libHSPSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d-ghc8.0.1.so |
| FileSize | 360312 |
| MD5 | BD7F61BF16119D1D2349450250EB5C17 |
| SHA-1 | 20E6241208477EDE52B208E0D8E6C37D7386224C |
| SHA-256 | 0278A5E6F984F566A191AEE3D15362D9676A1385EEA24C82CF6899BBDECD79BF |
| SSDEEP | 3072:OHs9KOOkyIdnHOguYFRbFjHdh9szklz4FthyTf+guBAakmP:O8F7R5jHdh96VP |
| TLSH | T1C4745659DA2174CADB4CC6B0CB4F21BB56B8545522658F821A48F2F8FFCB9E83903DD4 |
| 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 | 82296 |
| MD5 | E2F6AD116DB9250294CC9334B130327A |
| 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 | 2F3BBC35150833B1114772B391654FBE9D3ECEA5 |
| SHA-256 | 8D0948201F04503EF20013302F3FA4D9439181285D34338D1D542251C95856A1 |