Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/arm-linux-ghc-8.4.4/PSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2_p.a |
FileSize | 271312 |
MD5 | ECEEC81293BD38338BC742AE1F36CDF4 |
SHA-1 | 9489FA19BA2C6D274276C8A430D2EA64551E0BCD |
SHA-256 | 2A6719521608FADAE11B96EA961903CF127DD76F8E77FBCC5E0A8361007DF41A |
SSDEEP | 3072:yNyAbVXAnlFxN8HBLxzK7ObrUNMfrPgR+6GqoQa5/Zhbx6Ur:yAAbVXAnlFv8HVxzKbDG/5fbx6 |
TLSH | T1B644844B5F98CA25C96ED9FBE11FEB387756C4255261CB0388200AD03DD2DE2AD4AF17 |
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 | 56416 |
MD5 | DFBC60C8FE8FECE4BA2E286B3F5D6B6E |
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 | C257134C01C7CD5BB24E6EFD9A63244D3842CBB9 |
SHA-256 | 5D77E436D464FBA214B88B68A10C05844EF2276FF363F7DBFE239AF471BAADE3 |