Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/i386-linux-ghc-8.4.4/PSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2_p.a |
FileSize | 243490 |
MD5 | C6A802D07328427DA92A8687D6B33BD5 |
SHA-1 | 797FA551A1CC7617C86110A594CF48442AE62F23 |
SHA-256 | 53EA78BB66751B8423B254FA93B786D2BDFA9936E7477A3C5D32892B873F07B1 |
SSDEEP | 3072:jGNuR2Wo/gHU/eL4e/Okdi/P2Q/J0K2rW2EJe8DCeDB9Z:jGNe2F/gHoeU/ZrDv1D |
TLSH | T13134A7509E4CCC54C67BEEB6642E6B35A05B0A099392D60BEE041FD03CE4DD2F796C2B |
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 | 56384 |
MD5 | 6CAC6845A57E72733587BF4786C8E53F |
PackageDescription | Priority Search Queue; profiling libraries 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 libraries compiled with profiling enabled. |
PackageMaintainer | Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org> |
PackageName | libghc-psqueue-prof |
PackageSection | haskell |
PackageVersion | 1.1-13+b2 |
SHA-1 | 6E0AF6BA943306C7C3152233FC97B44081CAA668 |
SHA-256 | D07266F604F01DBF80E0EF397F64687576526A0D74DAC4FEF82BC76F5A43C248 |