| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/s390x-linux-ghc-8.4.4/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2-ghc8.4.4.so |
| FileSize | 275096 |
| MD5 | C7EC42F21E6DF19D99133CE808E66586 |
| SHA-1 | 76D3B309FE7793AE1DEC0EE321DEA0EEBCB7DFE8 |
| SHA-256 | 30FB064954B0692112B3977F39AE6FDB864715EB96E849D91BA1A1B32AE4BEB4 |
| SSDEEP | 6144:XgjsbAOZ8I++mXWGLbnWm/c+Zhzt0lqXaHEPPYzSEDiUOJb/JF:onB |
| TLSH | T1EA442EE2E4109104E8B5FF71BA9F8B14E337070322FD774BEB2AA7722C517A055959E2 |
| 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 |